cmd/gc: handle non-escaping address-taken variables better
This CL makes the bitmaps a little more precise about variables
that have their address taken but for which the address does not
escape to the heap, so that the variables are kept in the stack frame
rather than allocated on the heap.
The code before this CL handled these variables by treating every
return statement as using every such variable and depending on
liveness analysis to essentially treat the variable as live during the
entire function. That approach has false positives and (worse) false
negatives. That is, it's both sloppy and buggy:
func f(b1, b2 bool) { // x live here! (sloppy)
if b2 {
print(0) // x live here! (sloppy)
return
}
var z **int
x := new(int)
*x = 42
z = &x
print(**z) // x live here (conservative)
if b2 {
print(1) // x live here (conservative)
return
}
for {
print(**z) // x not live here (buggy)
}
}
The first two liveness annotations (marked sloppy) are clearly
wrong: x cannot be live if it has not yet been declared.
The last liveness annotation (marked buggy) is also wrong:
x is live here as *z, but because there is no return statement
reachable from this point in the code, the analysis treats x as dead.
This CL changes the liveness calculation to mark such variables
live exactly at points in the code reachable from the variable
declaration. This keeps the conservative decisions but fixes
the sloppy and buggy ones.
The CL also detects ambiguously live variables, those that are
being marked live but may not actually have been initialized,
such as in this example:
func f(b1 bool) {
var z **int
if b1 {
x := new(int)
*x = 42
z = &x
} else {
y := new(int)
*y = 54
z = &y
}
print(**z) // x, y live here (conservative)
}
Since the print statement is reachable from the declaration of x,
x must conservatively be marked live. The same goes for y.
Although both x and y are marked live at the print statement,
clearly only one of them has been initialized. They are both
"ambiguously live".
These ambiguously live variables cause problems for garbage
collection: the collector cannot ignore them but also cannot
depend on them to be initialized to valid pointer values.
Ambiguously live variables do not come up too often in real code,
but recent changes to the way map and interface runtime functions
are invoked has created a large number of ambiguously live
compiler-generated temporary variables. The next CL will adjust
the analysis to understand these temporaries better, to make
ambiguously live variables fairly rare.
Once ambiguously live variables are rare enough, another CL will
introduce code at the beginning of a function to zero those
slots on the stack. At that point the garbage collector and the
stack copying routines will be able to depend on the guarantee that
if a slot is marked as live in a liveness bitmap, it is initialized.
R=khr
CC=golang-codereviews, iant
https://golang.org/cl/51810043
2014-01-16 10:32:30 -05:00
|
|
|
// errorcheck -0 -l -live
|
|
|
|
|
|
|
|
|
|
// Copyright 2014 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
|
|
|
|
|
|
|
|
|
|
func f1() {
|
|
|
|
|
var x *int
|
|
|
|
|
print(&x) // ERROR "live at call to printpointer: x$"
|
|
|
|
|
print(&x) // ERROR "live at call to printpointer: x$"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func f2(b bool) {
|
|
|
|
|
if b {
|
|
|
|
|
print(0) // nothing live here
|
|
|
|
|
return
|
|
|
|
|
}
|
|
|
|
|
var x *int
|
|
|
|
|
print(&x) // ERROR "live at call to printpointer: x$"
|
|
|
|
|
print(&x) // ERROR "live at call to printpointer: x$"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func f3(b bool) {
|
|
|
|
|
print(0)
|
|
|
|
|
if b == false {
|
|
|
|
|
print(0) // nothing live here
|
|
|
|
|
return
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if b {
|
|
|
|
|
var x *int
|
|
|
|
|
print(&x) // ERROR "live at call to printpointer: x$"
|
|
|
|
|
print(&x) // ERROR "live at call to printpointer: x$"
|
|
|
|
|
} else {
|
|
|
|
|
var y *int
|
|
|
|
|
print(&y) // ERROR "live at call to printpointer: y$"
|
|
|
|
|
print(&y) // ERROR "live at call to printpointer: y$"
|
|
|
|
|
}
|
cmd/gc: liveness-related bug fixes
1. On entry to a function, only zero the ambiguously live stack variables.
Before, we were zeroing all stack variables containing pointers.
The zeroing is pretty inefficient right now (issue 7624), but there are also
too many stack variables detected as ambiguously live (issue 7345),
and that must be addressed before deciding how to improve the zeroing code.
(Changes in 5g/ggen.c, 6g/ggen.c, 8g/ggen.c, gc/pgen.c)
Fixes #7647.
2. Make the regopt word-based liveness analysis preserve the
whole-variable liveness property expected by the garbage collection
bitmap liveness analysis. That is, if the regopt liveness decides that
one word in a struct needs to be preserved, make sure it preserves
the entire struct. This is particularly important for multiword values
such as strings, slices, and interfaces, in which all the words need
to be present in order to understand the meaning.
(Changes in 5g/reg.c, 6g/reg.c, 8g/reg.c.)
Fixes #7591.
3. Make the regopt word-based liveness analysis treat a variable
as having its address taken - which makes it preserved across
all future calls - whenever n->addrtaken is set, for consistency
with the gc bitmap liveness analysis, even if there is no machine
instruction actually taking the address. In this case n->addrtaken
is incorrect (a nicer way to put it is overconservative), and ideally
there would be no such cases, but they can happen and the two
analyses need to agree.
(Changes in 5g/reg.c, 6g/reg.c, 8g/reg.c; test in bug484.go.)
Fixes crashes found by turning off "zero everything" in step 1.
4. Remove spurious VARDEF annotations. As the comment in
gc/pgen.c explains, the VARDEF must immediately precede
the initialization. It cannot be too early, and it cannot be too late.
In particular, if a function call sits between the VARDEF and the
actual machine instructions doing the initialization, the variable
will be treated as live during that function call even though it is
uninitialized, leading to problems.
(Changes in gc/gen.c; test in live.go.)
Fixes crashes found by turning off "zero everything" in step 1.
5. Do not treat loading the address of a wide value as a signal
that the value must be initialized. Instead depend on the existence
of a VARDEF or the first actual read/write of a word in the value.
If the load is in order to pass the address to a function that does
the actual initialization, treating the load as an implicit VARDEF
causes the same problems as described in step 4.
The alternative is to arrange to zero every such value before
passing it to the real initialization function, but this is a much
easier and more efficient change.
(Changes in gc/plive.c.)
Fixes crashes found by turning off "zero everything" in step 1.
6. Treat wide input parameters with their address taken as
initialized on entry to the function. Otherwise they look
"ambiguously live" and we will try to emit code to zero them.
(Changes in gc/plive.c.)
Fixes crashes found by turning off "zero everything" in step 1.
7. An array of length 0 has no pointers, even if the element type does.
Without this change, the zeroing code complains when asked to
clear a 0-length array.
(Changes in gc/reflect.c.)
LGTM=khr
R=khr
CC=golang-codereviews
https://golang.org/cl/80160044
2014-03-27 14:05:57 -04:00
|
|
|
print(0) // ERROR "live at call to printint: x y$" "x \(type \*int\) is ambiguously live" "y \(type \*int\) is ambiguously live"
|
cmd/gc: handle non-escaping address-taken variables better
This CL makes the bitmaps a little more precise about variables
that have their address taken but for which the address does not
escape to the heap, so that the variables are kept in the stack frame
rather than allocated on the heap.
The code before this CL handled these variables by treating every
return statement as using every such variable and depending on
liveness analysis to essentially treat the variable as live during the
entire function. That approach has false positives and (worse) false
negatives. That is, it's both sloppy and buggy:
func f(b1, b2 bool) { // x live here! (sloppy)
if b2 {
print(0) // x live here! (sloppy)
return
}
var z **int
x := new(int)
*x = 42
z = &x
print(**z) // x live here (conservative)
if b2 {
print(1) // x live here (conservative)
return
}
for {
print(**z) // x not live here (buggy)
}
}
The first two liveness annotations (marked sloppy) are clearly
wrong: x cannot be live if it has not yet been declared.
The last liveness annotation (marked buggy) is also wrong:
x is live here as *z, but because there is no return statement
reachable from this point in the code, the analysis treats x as dead.
This CL changes the liveness calculation to mark such variables
live exactly at points in the code reachable from the variable
declaration. This keeps the conservative decisions but fixes
the sloppy and buggy ones.
The CL also detects ambiguously live variables, those that are
being marked live but may not actually have been initialized,
such as in this example:
func f(b1 bool) {
var z **int
if b1 {
x := new(int)
*x = 42
z = &x
} else {
y := new(int)
*y = 54
z = &y
}
print(**z) // x, y live here (conservative)
}
Since the print statement is reachable from the declaration of x,
x must conservatively be marked live. The same goes for y.
Although both x and y are marked live at the print statement,
clearly only one of them has been initialized. They are both
"ambiguously live".
These ambiguously live variables cause problems for garbage
collection: the collector cannot ignore them but also cannot
depend on them to be initialized to valid pointer values.
Ambiguously live variables do not come up too often in real code,
but recent changes to the way map and interface runtime functions
are invoked has created a large number of ambiguously live
compiler-generated temporary variables. The next CL will adjust
the analysis to understand these temporaries better, to make
ambiguously live variables fairly rare.
Once ambiguously live variables are rare enough, another CL will
introduce code at the beginning of a function to zero those
slots on the stack. At that point the garbage collector and the
stack copying routines will be able to depend on the guarantee that
if a slot is marked as live in a liveness bitmap, it is initialized.
R=khr
CC=golang-codereviews, iant
https://golang.org/cl/51810043
2014-01-16 10:32:30 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// The old algorithm treated x as live on all code that
|
|
|
|
|
// could flow to a return statement, so it included the
|
|
|
|
|
// function entry and code above the declaration of x
|
|
|
|
|
// but would not include an indirect use of x in an infinite loop.
|
|
|
|
|
// Check that these cases are handled correctly.
|
|
|
|
|
|
|
|
|
|
func f4(b1, b2 bool) { // x not live here
|
|
|
|
|
if b2 {
|
|
|
|
|
print(0) // x not live here
|
|
|
|
|
return
|
|
|
|
|
}
|
|
|
|
|
var z **int
|
|
|
|
|
x := new(int)
|
|
|
|
|
*x = 42
|
|
|
|
|
z = &x
|
|
|
|
|
print(**z) // ERROR "live at call to printint: x z$"
|
|
|
|
|
if b2 {
|
|
|
|
|
print(1) // ERROR "live at call to printint: x$"
|
|
|
|
|
return
|
|
|
|
|
}
|
|
|
|
|
for {
|
|
|
|
|
print(**z) // ERROR "live at call to printint: x z$"
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func f5(b1 bool) {
|
|
|
|
|
var z **int
|
|
|
|
|
if b1 {
|
|
|
|
|
x := new(int)
|
|
|
|
|
*x = 42
|
|
|
|
|
z = &x
|
|
|
|
|
} else {
|
|
|
|
|
y := new(int)
|
|
|
|
|
*y = 54
|
|
|
|
|
z = &y
|
|
|
|
|
}
|
cmd/gc: liveness-related bug fixes
1. On entry to a function, only zero the ambiguously live stack variables.
Before, we were zeroing all stack variables containing pointers.
The zeroing is pretty inefficient right now (issue 7624), but there are also
too many stack variables detected as ambiguously live (issue 7345),
and that must be addressed before deciding how to improve the zeroing code.
(Changes in 5g/ggen.c, 6g/ggen.c, 8g/ggen.c, gc/pgen.c)
Fixes #7647.
2. Make the regopt word-based liveness analysis preserve the
whole-variable liveness property expected by the garbage collection
bitmap liveness analysis. That is, if the regopt liveness decides that
one word in a struct needs to be preserved, make sure it preserves
the entire struct. This is particularly important for multiword values
such as strings, slices, and interfaces, in which all the words need
to be present in order to understand the meaning.
(Changes in 5g/reg.c, 6g/reg.c, 8g/reg.c.)
Fixes #7591.
3. Make the regopt word-based liveness analysis treat a variable
as having its address taken - which makes it preserved across
all future calls - whenever n->addrtaken is set, for consistency
with the gc bitmap liveness analysis, even if there is no machine
instruction actually taking the address. In this case n->addrtaken
is incorrect (a nicer way to put it is overconservative), and ideally
there would be no such cases, but they can happen and the two
analyses need to agree.
(Changes in 5g/reg.c, 6g/reg.c, 8g/reg.c; test in bug484.go.)
Fixes crashes found by turning off "zero everything" in step 1.
4. Remove spurious VARDEF annotations. As the comment in
gc/pgen.c explains, the VARDEF must immediately precede
the initialization. It cannot be too early, and it cannot be too late.
In particular, if a function call sits between the VARDEF and the
actual machine instructions doing the initialization, the variable
will be treated as live during that function call even though it is
uninitialized, leading to problems.
(Changes in gc/gen.c; test in live.go.)
Fixes crashes found by turning off "zero everything" in step 1.
5. Do not treat loading the address of a wide value as a signal
that the value must be initialized. Instead depend on the existence
of a VARDEF or the first actual read/write of a word in the value.
If the load is in order to pass the address to a function that does
the actual initialization, treating the load as an implicit VARDEF
causes the same problems as described in step 4.
The alternative is to arrange to zero every such value before
passing it to the real initialization function, but this is a much
easier and more efficient change.
(Changes in gc/plive.c.)
Fixes crashes found by turning off "zero everything" in step 1.
6. Treat wide input parameters with their address taken as
initialized on entry to the function. Otherwise they look
"ambiguously live" and we will try to emit code to zero them.
(Changes in gc/plive.c.)
Fixes crashes found by turning off "zero everything" in step 1.
7. An array of length 0 has no pointers, even if the element type does.
Without this change, the zeroing code complains when asked to
clear a 0-length array.
(Changes in gc/reflect.c.)
LGTM=khr
R=khr
CC=golang-codereviews
https://golang.org/cl/80160044
2014-03-27 14:05:57 -04:00
|
|
|
print(**z) // ERROR "live at call to printint: x y$" "x \(type \*int\) is ambiguously live" "y \(type \*int\) is ambiguously live"
|
cmd/gc: handle non-escaping address-taken variables better
This CL makes the bitmaps a little more precise about variables
that have their address taken but for which the address does not
escape to the heap, so that the variables are kept in the stack frame
rather than allocated on the heap.
The code before this CL handled these variables by treating every
return statement as using every such variable and depending on
liveness analysis to essentially treat the variable as live during the
entire function. That approach has false positives and (worse) false
negatives. That is, it's both sloppy and buggy:
func f(b1, b2 bool) { // x live here! (sloppy)
if b2 {
print(0) // x live here! (sloppy)
return
}
var z **int
x := new(int)
*x = 42
z = &x
print(**z) // x live here (conservative)
if b2 {
print(1) // x live here (conservative)
return
}
for {
print(**z) // x not live here (buggy)
}
}
The first two liveness annotations (marked sloppy) are clearly
wrong: x cannot be live if it has not yet been declared.
The last liveness annotation (marked buggy) is also wrong:
x is live here as *z, but because there is no return statement
reachable from this point in the code, the analysis treats x as dead.
This CL changes the liveness calculation to mark such variables
live exactly at points in the code reachable from the variable
declaration. This keeps the conservative decisions but fixes
the sloppy and buggy ones.
The CL also detects ambiguously live variables, those that are
being marked live but may not actually have been initialized,
such as in this example:
func f(b1 bool) {
var z **int
if b1 {
x := new(int)
*x = 42
z = &x
} else {
y := new(int)
*y = 54
z = &y
}
print(**z) // x, y live here (conservative)
}
Since the print statement is reachable from the declaration of x,
x must conservatively be marked live. The same goes for y.
Although both x and y are marked live at the print statement,
clearly only one of them has been initialized. They are both
"ambiguously live".
These ambiguously live variables cause problems for garbage
collection: the collector cannot ignore them but also cannot
depend on them to be initialized to valid pointer values.
Ambiguously live variables do not come up too often in real code,
but recent changes to the way map and interface runtime functions
are invoked has created a large number of ambiguously live
compiler-generated temporary variables. The next CL will adjust
the analysis to understand these temporaries better, to make
ambiguously live variables fairly rare.
Once ambiguously live variables are rare enough, another CL will
introduce code at the beginning of a function to zero those
slots on the stack. At that point the garbage collector and the
stack copying routines will be able to depend on the guarantee that
if a slot is marked as live in a liveness bitmap, it is initialized.
R=khr
CC=golang-codereviews, iant
https://golang.org/cl/51810043
2014-01-16 10:32:30 -05:00
|
|
|
}
|
2014-02-13 20:59:39 -05:00
|
|
|
|
|
|
|
|
// confusion about the _ result used to cause spurious "live at entry to f6: _".
|
|
|
|
|
|
|
|
|
|
func f6() (_, y string) {
|
|
|
|
|
y = "hello"
|
|
|
|
|
return
|
|
|
|
|
}
|
2014-02-13 21:11:50 -05:00
|
|
|
|
|
|
|
|
// confusion about addressed results used to cause "live at entry to f7: x".
|
|
|
|
|
|
|
|
|
|
func f7() (x string) {
|
|
|
|
|
_ = &x
|
|
|
|
|
x = "hello"
|
|
|
|
|
return
|
|
|
|
|
}
|
|
|
|
|
|
2014-02-13 22:45:16 -05:00
|
|
|
// ignoring block returns used to cause "live at entry to f8: x, y".
|
|
|
|
|
|
|
|
|
|
func f8() (x, y string) {
|
|
|
|
|
return g8()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func g8() (string, string)
|
|
|
|
|
|
|
|
|
|
// ignoring block assignments used to cause "live at entry to f9: x"
|
|
|
|
|
// issue 7205
|
|
|
|
|
|
|
|
|
|
var i9 interface{}
|
|
|
|
|
|
|
|
|
|
func f9() bool {
|
|
|
|
|
g8()
|
|
|
|
|
x := i9
|
|
|
|
|
return x != 99
|
|
|
|
|
}
|
2014-02-13 23:56:53 -05:00
|
|
|
|
|
|
|
|
// liveness formerly confused by UNDEF followed by RET,
|
|
|
|
|
// leading to "live at entry to f10: ~r1" (unnamed result).
|
|
|
|
|
|
|
|
|
|
func f10() string {
|
|
|
|
|
panic(1)
|
|
|
|
|
}
|
|
|
|
|
|
2014-02-14 00:38:24 -05:00
|
|
|
// liveness formerly confused by select, thinking runtime.selectgo
|
|
|
|
|
// can return to next instruction; it always jumps elsewhere.
|
|
|
|
|
// note that you have to use at least two cases in the select
|
|
|
|
|
// to get a true select; smaller selects compile to optimized helper functions.
|
|
|
|
|
|
|
|
|
|
var c chan *int
|
|
|
|
|
var b bool
|
|
|
|
|
|
|
|
|
|
// this used to have a spurious "live at entry to f11a: ~r0"
|
|
|
|
|
func f11a() *int {
|
|
|
|
|
select { // ERROR "live at call to selectgo: autotmp"
|
|
|
|
|
case <-c: // ERROR "live at call to selectrecv: autotmp"
|
|
|
|
|
return nil
|
|
|
|
|
case <-c: // ERROR "live at call to selectrecv: autotmp"
|
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func f11b() *int {
|
|
|
|
|
p := new(int)
|
|
|
|
|
if b {
|
|
|
|
|
// At this point p is dead: the code here cannot
|
|
|
|
|
// get to the bottom of the function.
|
|
|
|
|
// This used to have a spurious "live at call to printint: p".
|
|
|
|
|
print(1) // nothing live here!
|
|
|
|
|
select { // ERROR "live at call to selectgo: autotmp"
|
|
|
|
|
case <-c: // ERROR "live at call to selectrecv: autotmp"
|
|
|
|
|
return nil
|
|
|
|
|
case <-c: // ERROR "live at call to selectrecv: autotmp"
|
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
println(*p)
|
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func f11c() *int {
|
|
|
|
|
p := new(int)
|
|
|
|
|
if b {
|
|
|
|
|
// Unlike previous, the cases in this select fall through,
|
|
|
|
|
// so we can get to the println, so p is not dead.
|
|
|
|
|
print(1) // ERROR "live at call to printint: p"
|
|
|
|
|
select { // ERROR "live at call to newselect: p" "live at call to selectgo: autotmp.* p"
|
|
|
|
|
case <-c: // ERROR "live at call to selectrecv: autotmp.* p"
|
|
|
|
|
case <-c: // ERROR "live at call to selectrecv: autotmp.* p"
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
println(*p)
|
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// similarly, select{} does not fall through.
|
|
|
|
|
// this used to have a spurious "live at entry to f12: ~r0".
|
|
|
|
|
|
|
|
|
|
func f12() *int {
|
|
|
|
|
if b {
|
|
|
|
|
select{}
|
|
|
|
|
} else {
|
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
}
|
2014-02-15 10:58:55 -05:00
|
|
|
|
|
|
|
|
// incorrectly placed VARDEF annotations can cause missing liveness annotations.
|
|
|
|
|
// this used to be missing the fact that s is live during the call to g13 (because it is
|
|
|
|
|
// needed for the call to h13).
|
|
|
|
|
|
|
|
|
|
func f13() {
|
|
|
|
|
s := "hello"
|
|
|
|
|
s = h13(s, g13(s)) // ERROR "live at call to g13: s"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func g13(string) string
|
|
|
|
|
func h13(string, string) string
|
cmd/gc: liveness-related bug fixes
1. On entry to a function, only zero the ambiguously live stack variables.
Before, we were zeroing all stack variables containing pointers.
The zeroing is pretty inefficient right now (issue 7624), but there are also
too many stack variables detected as ambiguously live (issue 7345),
and that must be addressed before deciding how to improve the zeroing code.
(Changes in 5g/ggen.c, 6g/ggen.c, 8g/ggen.c, gc/pgen.c)
Fixes #7647.
2. Make the regopt word-based liveness analysis preserve the
whole-variable liveness property expected by the garbage collection
bitmap liveness analysis. That is, if the regopt liveness decides that
one word in a struct needs to be preserved, make sure it preserves
the entire struct. This is particularly important for multiword values
such as strings, slices, and interfaces, in which all the words need
to be present in order to understand the meaning.
(Changes in 5g/reg.c, 6g/reg.c, 8g/reg.c.)
Fixes #7591.
3. Make the regopt word-based liveness analysis treat a variable
as having its address taken - which makes it preserved across
all future calls - whenever n->addrtaken is set, for consistency
with the gc bitmap liveness analysis, even if there is no machine
instruction actually taking the address. In this case n->addrtaken
is incorrect (a nicer way to put it is overconservative), and ideally
there would be no such cases, but they can happen and the two
analyses need to agree.
(Changes in 5g/reg.c, 6g/reg.c, 8g/reg.c; test in bug484.go.)
Fixes crashes found by turning off "zero everything" in step 1.
4. Remove spurious VARDEF annotations. As the comment in
gc/pgen.c explains, the VARDEF must immediately precede
the initialization. It cannot be too early, and it cannot be too late.
In particular, if a function call sits between the VARDEF and the
actual machine instructions doing the initialization, the variable
will be treated as live during that function call even though it is
uninitialized, leading to problems.
(Changes in gc/gen.c; test in live.go.)
Fixes crashes found by turning off "zero everything" in step 1.
5. Do not treat loading the address of a wide value as a signal
that the value must be initialized. Instead depend on the existence
of a VARDEF or the first actual read/write of a word in the value.
If the load is in order to pass the address to a function that does
the actual initialization, treating the load as an implicit VARDEF
causes the same problems as described in step 4.
The alternative is to arrange to zero every such value before
passing it to the real initialization function, but this is a much
easier and more efficient change.
(Changes in gc/plive.c.)
Fixes crashes found by turning off "zero everything" in step 1.
6. Treat wide input parameters with their address taken as
initialized on entry to the function. Otherwise they look
"ambiguously live" and we will try to emit code to zero them.
(Changes in gc/plive.c.)
Fixes crashes found by turning off "zero everything" in step 1.
7. An array of length 0 has no pointers, even if the element type does.
Without this change, the zeroing code complains when asked to
clear a 0-length array.
(Changes in gc/reflect.c.)
LGTM=khr
R=khr
CC=golang-codereviews
https://golang.org/cl/80160044
2014-03-27 14:05:57 -04:00
|
|
|
|
|
|
|
|
// more incorrectly placed VARDEF.
|
|
|
|
|
|
|
|
|
|
func f14() {
|
|
|
|
|
x := g14()
|
|
|
|
|
print(&x) // ERROR "live at call to printpointer: x"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func g14() string
|
|
|
|
|
|
|
|
|
|
func f15() {
|
|
|
|
|
var x string
|
|
|
|
|
_ = &x
|
|
|
|
|
x = g15() // ERROR "live at call to g15: x"
|
|
|
|
|
print(x) // ERROR "live at call to printstring: x"
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func g15() string
|