A variation on the issue is:

func f() {
        var p *int
        {
        x:
                if g() {
                        goto x
                }
        }
        p = new(int)
        h(p)
}

This is trickier though, because we flatten blocks in the Node tree representation, so the above is indistinguishable from:

func f() {
        var p *int
x:
        if g() {
                goto x
        }
        p = new(int)
        h(p)
}

(Which also really needn't escape, but requires more sophisticated control flow analysis.)

CC @dr2chase

It seems aggressive to make this a milestone before we even have a non-test example of a loop made from a goto.

The milestone is to set a point by which we should make progress. If you want to make progress by changing the milestone to unplanned, that is fine.

Milestone set to unplanned, lacking any performance problem in "real" code caused by this shortfall (which would be a bit of a pain to fix since the tree-based analyses lack structural loop detectors).

Change https://golang.org/cl/193517 mentions this issue: cmd/compile: handle loopdepth in looping label