68 // Queue of locations to walk. Has enough room for b.allLocs
69 // plus b.heapLoc, b.mutatorLoc, b.calleeLoc.
70▶ todo := newQueue(len(b.allLocs) + 3)
71
72 enqueue := func(loc *location) {
· · ·
77 // which in some cases allows attrEscape to
78 // propagate faster.
79▶ todo.pushFront(loc)
80 } else {
81 todo.pushBack(loc)
· · ·
81▶ todo.pushBack(loc)
82 }
83 }
· · ·
85
86 for _, loc := range b.allLocs {
87▶ todo.pushFront(loc)
88 // TODO(thepudds): clean up setting queuedWalkAll.
89 loc.queuedWalkAll = true
· · ·
88▶ // TODO(thepudds): clean up setting queuedWalkAll.
89 loc.queuedWalkAll = true
90 }
+ 21 more matches in this file