mirror of
https://github.com/golang/go
synced 2024-11-21 18:44:45 -07:00
test: merge nilptr/* into one test
The 512 MB array causes load delays on some systems. Now that we have recover, we can do all the tests in one binary, so that the delay is incurred just once. R=golang-dev, r CC=golang-dev https://golang.org/cl/5142044
This commit is contained in:
Russ Cox
parent
0b09a56a64
commit
67d48daae9
@ -111,8 +111,6 @@ panic: interface conversion: *main.S is not main.I: missing method Foo
|
||||
=========== interface/returntype.go
|
||||
panic: interface conversion: *main.S is not main.I2: missing method Name
|
||||
|
||||
== nilptr/
|
||||
|
||||
== syntax/
|
||||
|
||||
== dwarf/
|
||||
|
||||
125
test/nilptr.go
Normal file
125
test/nilptr.go
Normal file
@ -0,0 +1,125 @@
|
||||
// $G $D/$F.go && $L $F.$A && ./$A.out
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
// Having a big address space means that indexing
|
||||
// at a 256 MB offset from a nil pointer might not
|
||||
// cause a memory access fault. This test checks
|
||||
// that Go is doing the correct explicit checks to catch
|
||||
// these nil pointer accesses, not just relying on the hardware.
|
||||
var dummy [512 << 20]byte // give us a big address space
|
||||
|
||||
func main() {
|
||||
// the test only tests what we intend to test
|
||||
// if dummy starts in the first 256 MB of memory.
|
||||
// otherwise there might not be anything mapped
|
||||
// at the address that might be accidentally
|
||||
// dereferenced below.
|
||||
if uintptr(unsafe.Pointer(&dummy)) > 256<<20 {
|
||||
panic("dummy too far out")
|
||||
}
|
||||
|
||||
shouldPanic(p1)
|
||||
shouldPanic(p2)
|
||||
shouldPanic(p3)
|
||||
shouldPanic(p4)
|
||||
shouldPanic(p5)
|
||||
shouldPanic(p6)
|
||||
shouldPanic(p7)
|
||||
shouldPanic(p8)
|
||||
shouldPanic(p9)
|
||||
shouldPanic(p10)
|
||||
}
|
||||
|
||||
func shouldPanic(f func()) {
|
||||
defer func() {
|
||||
if recover() == nil {
|
||||
panic("memory reference did not panic")
|
||||
}
|
||||
}()
|
||||
f()
|
||||
}
|
||||
|
||||
func p1() {
|
||||
// Array index.
|
||||
var p *[1 << 30]byte = nil
|
||||
println(p[256<<20]) // very likely to be inside dummy, but should panic
|
||||
}
|
||||
|
||||
var xb byte
|
||||
|
||||
func p2() {
|
||||
var p *[1 << 30]byte = nil
|
||||
xb = 123
|
||||
|
||||
// Array index.
|
||||
println(p[uintptr(unsafe.Pointer(&xb))]) // should panic
|
||||
}
|
||||
|
||||
func p3() {
|
||||
// Array to slice.
|
||||
var p *[1 << 30]byte = nil
|
||||
var x []byte = p[0:] // should panic
|
||||
_ = x
|
||||
}
|
||||
|
||||
var q *[1 << 30]byte
|
||||
|
||||
func p4() {
|
||||
// Array to slice.
|
||||
var x []byte
|
||||
var y = &x
|
||||
*y = q[0:] // should crash (uses arraytoslice runtime routine)
|
||||
}
|
||||
|
||||
func fb([]byte) {
|
||||
panic("unreachable")
|
||||
}
|
||||
|
||||
func p5() {
|
||||
// Array to slice.
|
||||
var p *[1 << 30]byte = nil
|
||||
fb(p[0:]) // should crash
|
||||
}
|
||||
|
||||
func p6() {
|
||||
// Array to slice.
|
||||
var p *[1 << 30]byte = nil
|
||||
var _ []byte = p[10 : len(p)-10] // should crash
|
||||
}
|
||||
|
||||
type T struct {
|
||||
x [256 << 20]byte
|
||||
i int
|
||||
}
|
||||
|
||||
func f() *T {
|
||||
return nil
|
||||
}
|
||||
|
||||
var y *T
|
||||
var x = &y
|
||||
|
||||
func p7() {
|
||||
// Struct field access with large offset.
|
||||
println(f().i) // should crash
|
||||
}
|
||||
|
||||
func p8() {
|
||||
// Struct field access with large offset.
|
||||
println((*x).i) // should crash
|
||||
}
|
||||
|
||||
func p9() {
|
||||
// Struct field access with large offset.
|
||||
var t *T
|
||||
println(&t.i) // should crash
|
||||
}
|
||||
|
||||
func p10() {
|
||||
// Struct field access with large offset.
|
||||
var t *T
|
||||
println(t.i) // should crash
|
||||
}
|
||||
@ -1,26 +0,0 @@
|
||||
// $G $D/$F.go && $L $F.$A &&
|
||||
// ((! sh -c ./$A.out) >/dev/null 2>&1 || echo BUG: should fail)
|
||||
|
||||
// Copyright 2009 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
var x byte
|
||||
|
||||
func main() {
|
||||
var p *[1<<30]byte = nil
|
||||
x = 123
|
||||
|
||||
// The problem here is not the use of unsafe:
|
||||
// it is that indexing into p[] with a large
|
||||
// enough index jumps out of the unmapped section
|
||||
// at the beginning of memory and into valid memory.
|
||||
// Pointer offsets and array indices, if they are
|
||||
// very large, need to dereference the base pointer
|
||||
// to trigger a trap.
|
||||
println(p[uintptr(unsafe.Pointer(&x))]) // should crash
|
||||
}
|
||||
@ -1,31 +0,0 @@
|
||||
// $G $D/$F.go && $L $F.$A &&
|
||||
// ((! sh -c ./$A.out) >/dev/null 2>&1 || echo BUG: should fail)
|
||||
|
||||
// Copyright 2009 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
var dummy [512<<20]byte // give us a big address space
|
||||
func main() {
|
||||
// the test only tests what we intend to test
|
||||
// if dummy starts in the first 256 MB of memory.
|
||||
// otherwise there might not be anything mapped
|
||||
// at the address that might be accidentally
|
||||
// dereferenced below.
|
||||
if uintptr(unsafe.Pointer(&dummy)) > 256<<20 {
|
||||
panic("dummy too far out")
|
||||
}
|
||||
|
||||
// The problem here is that indexing into p[] with a large
|
||||
// enough index jumps out of the unmapped section
|
||||
// at the beginning of memory and into valid memory.
|
||||
// Pointer offsets and array indices, if they are
|
||||
// very large, need to dereference the base pointer
|
||||
// to trigger a trap.
|
||||
var p *[1<<30]byte = nil
|
||||
println(p[256<<20]) // very likely to be inside dummy, but should crash
|
||||
}
|
||||
@ -1,36 +0,0 @@
|
||||
// $G $D/$F.go && $L $F.$A &&
|
||||
// ((! sh -c ./$A.out) >/dev/null 2>&1 || echo BUG: should fail)
|
||||
|
||||
// Copyright 2009 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
func f([]byte) {
|
||||
panic("unreachable")
|
||||
}
|
||||
|
||||
var dummy [512<<20]byte // give us a big address space
|
||||
func main() {
|
||||
// the test only tests what we intend to test
|
||||
// if dummy starts in the first 256 MB of memory.
|
||||
// otherwise there might not be anything mapped
|
||||
// at the address that might be accidentally
|
||||
// dereferenced below.
|
||||
if uintptr(unsafe.Pointer(&dummy)) > 256<<20 {
|
||||
panic("dummy too far out")
|
||||
}
|
||||
|
||||
// The problem here is that indexing into p[] with a large
|
||||
// enough index can jump out of the unmapped section
|
||||
// at the beginning of memory and into valid memory.
|
||||
//
|
||||
// To avoid needing a check on every slice beyond the
|
||||
// usual len and cap, we require the *array -> slice
|
||||
// conversion to do the check.
|
||||
var p *[1<<30]byte = nil
|
||||
f(p[0:]) // should crash
|
||||
}
|
||||
@ -1,33 +0,0 @@
|
||||
// $G $D/$F.go && $L $F.$A &&
|
||||
// ((! sh -c ./$A.out) >/dev/null 2>&1 || echo BUG: should fail)
|
||||
|
||||
// Copyright 2009 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
var dummy [512<<20]byte // give us a big address space
|
||||
func main() {
|
||||
// the test only tests what we intend to test
|
||||
// if dummy starts in the first 256 MB of memory.
|
||||
// otherwise there might not be anything mapped
|
||||
// at the address that might be accidentally
|
||||
// dereferenced below.
|
||||
if uintptr(unsafe.Pointer(&dummy)) > 256<<20 {
|
||||
panic("dummy too far out")
|
||||
}
|
||||
|
||||
// The problem here is that indexing into p[] with a large
|
||||
// enough index can jump out of the unmapped section
|
||||
// at the beginning of memory and into valid memory.
|
||||
//
|
||||
// To avoid needing a check on every slice beyond the
|
||||
// usual len and cap, we require the *array -> slice
|
||||
// conversion to do the check.
|
||||
var p *[1<<30]byte = nil
|
||||
var x []byte = p[0:] // should crash
|
||||
_ = x
|
||||
}
|
||||
@ -1,34 +0,0 @@
|
||||
// $G $D/$F.go && $L $F.$A &&
|
||||
// ((! sh -c ./$A.out) >/dev/null 2>&1 || echo BUG: should fail)
|
||||
|
||||
// Copyright 2009 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
var dummy [512<<20]byte // give us a big address space
|
||||
var q *[1<<30]byte
|
||||
func main() {
|
||||
// the test only tests what we intend to test
|
||||
// if dummy starts in the first 256 MB of memory.
|
||||
// otherwise there might not be anything mapped
|
||||
// at the address that might be accidentally
|
||||
// dereferenced below.
|
||||
if uintptr(unsafe.Pointer(&dummy)) > 256<<20 {
|
||||
panic("dummy too far out")
|
||||
}
|
||||
|
||||
// The problem here is that indexing into p[] with a large
|
||||
// enough index can jump out of the unmapped section
|
||||
// at the beginning of memory and into valid memory.
|
||||
//
|
||||
// To avoid needing a check on every slice beyond the
|
||||
// usual len and cap, we require the *array -> slice
|
||||
// conversion to do the check.
|
||||
var x []byte
|
||||
var y = &x
|
||||
*y = q[0:] // should crash (uses arraytoslice runtime routine)
|
||||
}
|
||||
@ -1,32 +0,0 @@
|
||||
// $G $D/$F.go && $L $F.$A &&
|
||||
// ((! sh -c ./$A.out) >/dev/null 2>&1 || echo BUG: should fail)
|
||||
|
||||
// Copyright 2009 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
var dummy [512<<20]byte // give us a big address space
|
||||
func main() {
|
||||
// the test only tests what we intend to test
|
||||
// if dummy starts in the first 256 MB of memory.
|
||||
// otherwise there might not be anything mapped
|
||||
// at the address that might be accidentally
|
||||
// dereferenced below.
|
||||
if uintptr(unsafe.Pointer(&dummy)) > 256<<20 {
|
||||
panic("dummy too far out")
|
||||
}
|
||||
|
||||
// The problem here is that indexing into p[] with a large
|
||||
// enough index can jump out of the unmapped section
|
||||
// at the beginning of memory and into valid memory.
|
||||
//
|
||||
// To avoid needing a check on every slice beyond the
|
||||
// usual len and cap, we require the slice operation
|
||||
// to do the check.
|
||||
var p *[1<<30]byte = nil
|
||||
var _ []byte = p[10:len(p)-10] // should crash
|
||||
}
|
||||
@ -1,34 +0,0 @@
|
||||
// $G $D/$F.go && $L $F.$A &&
|
||||
// ((! sh -c ./$A.out) >/dev/null 2>&1 || echo BUG: should fail)
|
||||
|
||||
// Copyright 2009 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
var dummy [512<<20]byte // give us a big address space
|
||||
type T struct {
|
||||
x [256<<20] byte
|
||||
i int
|
||||
}
|
||||
|
||||
func main() {
|
||||
// the test only tests what we intend to test
|
||||
// if dummy starts in the first 256 MB of memory.
|
||||
// otherwise there might not be anything mapped
|
||||
// at the address that might be accidentally
|
||||
// dereferenced below.
|
||||
if uintptr(unsafe.Pointer(&dummy)) > 256<<20 {
|
||||
panic("dummy too far out")
|
||||
}
|
||||
|
||||
// The problem here is that indexing into t with a large
|
||||
// enough index can jump out of the unmapped section
|
||||
// at the beginning of memory and into valid memory.
|
||||
// We require the pointer dereference to check.
|
||||
var t *T
|
||||
println(t.i) // should crash
|
||||
}
|
||||
@ -1,37 +0,0 @@
|
||||
// $G $D/$F.go && $L $F.$A &&
|
||||
// ((! sh -c ./$A.out) >/dev/null 2>&1 || echo BUG: should fail)
|
||||
|
||||
// Copyright 2009 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
var dummy [512<<20]byte // give us a big address space
|
||||
type T struct {
|
||||
x [256<<20] byte
|
||||
i int
|
||||
}
|
||||
|
||||
func f() *T {
|
||||
return nil
|
||||
}
|
||||
|
||||
func main() {
|
||||
// the test only tests what we intend to test
|
||||
// if dummy starts in the first 256 MB of memory.
|
||||
// otherwise there might not be anything mapped
|
||||
// at the address that might be accidentally
|
||||
// dereferenced below.
|
||||
if uintptr(unsafe.Pointer(&dummy)) > 256<<20 {
|
||||
panic("dummy too far out")
|
||||
}
|
||||
|
||||
// The problem here is that indexing into t with a large
|
||||
// enough index can jump out of the unmapped section
|
||||
// at the beginning of memory and into valid memory.
|
||||
// We require the pointer dereference to check.
|
||||
println(f().i) // should crash
|
||||
}
|
||||
@ -1,36 +0,0 @@
|
||||
// $G $D/$F.go && $L $F.$A &&
|
||||
// ((! sh -c ./$A.out) >/dev/null 2>&1 || echo BUG: should fail)
|
||||
|
||||
// Copyright 2009 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
var dummy [512<<20]byte // give us a big address space
|
||||
type T struct {
|
||||
x [256<<20] byte
|
||||
i int
|
||||
}
|
||||
|
||||
var y *T
|
||||
var x = &y
|
||||
|
||||
func main() {
|
||||
// the test only tests what we intend to test
|
||||
// if dummy starts in the first 256 MB of memory.
|
||||
// otherwise there might not be anything mapped
|
||||
// at the address that might be accidentally
|
||||
// dereferenced below.
|
||||
if uintptr(unsafe.Pointer(&dummy)) > 256<<20 {
|
||||
panic("dummy too far out")
|
||||
}
|
||||
|
||||
// The problem here is that indexing into t with a large
|
||||
// enough index can jump out of the unmapped section
|
||||
// at the beginning of memory and into valid memory.
|
||||
// We require the pointer dereference to check.
|
||||
println((*x).i) // should crash
|
||||
}
|
||||
@ -1,34 +0,0 @@
|
||||
// $G $D/$F.go && $L $F.$A &&
|
||||
// ((! sh -c ./$A.out) >/dev/null 2>&1 || echo BUG: should fail)
|
||||
|
||||
// Copyright 2009 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package main
|
||||
|
||||
import "unsafe"
|
||||
|
||||
var dummy [512<<20]byte // give us a big address space
|
||||
type T struct {
|
||||
x [256<<20] byte
|
||||
i int
|
||||
}
|
||||
|
||||
func main() {
|
||||
// the test only tests what we intend to test
|
||||
// if dummy starts in the first 256 MB of memory.
|
||||
// otherwise there might not be anything mapped
|
||||
// at the address that might be accidentally
|
||||
// dereferenced below.
|
||||
if uintptr(unsafe.Pointer(&dummy)) > 256<<20 {
|
||||
panic("dummy too far out")
|
||||
}
|
||||
|
||||
// The problem here is that indexing into t with a large
|
||||
// enough index can jump out of the unmapped section
|
||||
// at the beginning of memory and into valid memory.
|
||||
// We require the address calculation to check.
|
||||
var t *T
|
||||
println(&t.i) // should crash
|
||||
}
|
||||
Loading…
Reference in New Issue
Block a user