case OCALLPART:
e.spill(k, n)
- // esc.go says "Contents make it to memory, lose
- // track." I think we can just flow n.Left to our
- // spilled location though.
- // TODO(mdempsky): Try that.
+ // TODO(mdempsky): We can do better here. See #27557.
e.assignHeap(n.Left, "call part", n)
case OPTRLIT:
func foo141() {
var f func()
+ // BAD: new(Tm) should not escape
t := new(Tm) // ERROR "new\(Tm\) escapes to heap$"
f = t.M // ERROR "t.M does not escape$"
_ = f
func foo141() {
var f func()
+ // BAD: new(Tm) should not escape
t := new(Tm) // ERROR "new\(Tm\) escapes to heap$"
f = t.M // ERROR "t.M does not escape$"
_ = f
var N int
func F1() {
+ // BAD: s should not escape
var s S // ERROR "moved to heap: s"
for i := 0; i < N; i++ {
fs := []func(){ // ERROR "\[\]func\(\) literal does not escape"
}
func F2() {
+ // BAD: s should not escape
var s S // ERROR "moved to heap: s"
for i := 0; i < N; i++ {
for _, f := range []func(){ // ERROR "\[\]func\(\) literal does not escape"
--- /dev/null
+// errorcheck -0 -l -m
+
+// Copyright 2019 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 p
+
+var sink interface{}
+
+func _() {
+ // BAD: t should not escape
+ var t T // ERROR "moved to heap"
+ f := t.noescape // ERROR "t.noescape does not escape"
+ f()
+}
+
+func _() {
+ var t T // ERROR "moved to heap"
+ f := t.escape // ERROR "t.escape does not escape"
+ f()
+}
+
+func _() {
+ var t T // ERROR "moved to heap"
+ f := t.returns // ERROR "t.returns does not escape"
+ sink = f()
+}
+
+type T struct{}
+
+func (t *T) noescape() {} // ERROR "t does not escape"
+func (t *T) escape() { sink = t } // ERROR "leaking param: t$"
+func (t *T) returns() *T { return t } // ERROR "leaking param: t to result ~r0 level=0"
+
+func (t *T) recursive() { // ERROR "leaking param: t$"
+ sink = t
+
+ var t2 T // ERROR "moved to heap"
+ f := t2.recursive // ERROR "t2.recursive does not escape"
+ f()
+}