mirror of
https://github.com/golang/go.git
synced 2025-12-08 06:10:04 +00:00
cmd/compile: remove all remaining nodeSeq code
Passes toolstash -cmp. Update #14473. Change-Id: I2ac5c595d7af7a8da1a7e3945e6a753299446250 Reviewed-on: https://go-review.googlesource.com/20497 Run-TryBot: Ian Lance Taylor <iant@golang.org> TryBot-Result: Gobot Gobot <gobot@golang.org> Reviewed-by: Brad Fitzpatrick <bradfitz@golang.org>
This commit is contained in:
parent
53900cea1b
commit
f444b8a80e
16 changed files with 283 additions and 547 deletions
|
|
@ -54,13 +54,13 @@ type bottomUpVisitor struct {
|
|||
// If recursive is false, the list consists of only a single function and its closures.
|
||||
// If recursive is true, the list may still contain only a single function,
|
||||
// if that function is itself recursive.
|
||||
func visitBottomUp(list *NodeList, analyze func(list []*Node, recursive bool)) {
|
||||
func visitBottomUp(list []*Node, analyze func(list []*Node, recursive bool)) {
|
||||
var v bottomUpVisitor
|
||||
v.analyze = analyze
|
||||
v.nodeID = make(map[*Node]uint32)
|
||||
for l := list; l != nil; l = l.Next {
|
||||
if l.N.Op == ODCLFUNC && l.N.Func.FCurfn == nil {
|
||||
v.visit(l.N)
|
||||
for _, n := range list {
|
||||
if n.Op == ODCLFUNC && n.Func.FCurfn == nil {
|
||||
v.visit(n)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
@ -183,7 +183,7 @@ func (v *bottomUpVisitor) visitcode(n *Node, min uint32) uint32 {
|
|||
// needs to be moved to the heap, and new(T) and slice
|
||||
// literals are always real allocations.
|
||||
|
||||
func escapes(all *NodeList) {
|
||||
func escapes(all []*Node) {
|
||||
visitBottomUp(all, escAnalyze)
|
||||
}
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue