Stowage/go
2
0
Fork 0
mirror of https://github.com/golang/go.git synced 2025-12-08 06:10:04 +00:00
Code Issues Projects Releases Packages Wiki Activity

cmd/compile: remove Node.Ntest, Node.Stkdelta

Browse source 
$ sizeof -p cmd/compile/internal/gc Node
Node 272
$

Change-Id: I3d9b67eebfc0be0a4b9768d3de3dc76300abd89c
Reviewed-on: https://go-review.googlesource.com/10521
Reviewed-by: Ian Lance Taylor <iant@golang.org>
Reviewed-by: Josh Bleecher Snyder <josharian@gmail.com>
This commit is contained in:
Russ Cox 2015-05-26 21:30:20 -04:00
parent ffef180f82
commit 66be1481df
20 changed files with 207 additions and 269 deletions
Download patch file Download diff file Expand all files Collapse all files

20
src/cmd/compile/internal/gc/order.go
View file

@ -646,7 +646,7 @@ func orderstmt(n *Node, order *Order) {
case OFOR:
t := marktemp(order)
orderexprinplace(&n.Ntest, order)
orderexprinplace(&n.Left, order)
var l *NodeList
cleantempnopop(t, order, &l)
n.Nbody = concat(l, n.Nbody)
@ -660,7 +660,7 @@ func orderstmt(n *Node, order *Order) {
case OIF:
t := marktemp(order)
orderexprinplace(&n.Ntest, order)
orderexprinplace(&n.Left, order)
var l *NodeList
cleantempnopop(t, order, &l)
n.Nbody = concat(l, n.Nbody)
@ -793,7 +793,7 @@ func orderstmt(n *Node, order *Order) {
if t != nil && t.N.Op == ODCL && t.N.Left == r.Left {
t = t.Next
}
if t != nil && t.N.Op == ODCL && t.N.Left == r.Ntest {
if t != nil && t.N.Op == ODCL && r.List != nil && t.N.Left == r.List.N {
t = t.Next
}
if t == nil {
@ -844,19 +844,19 @@ func orderstmt(n *Node, order *Order) {
l.N.Ninit = list(l.N.Ninit, tmp2)
}
if r.Ntest != nil && isblank(r.Ntest) {
r.Ntest = nil
if r.List != nil && isblank(r.List.N) {
r.List = nil
}
if r.Ntest != nil {
tmp1 = r.Ntest
if r.List != nil {
tmp1 = r.List.N
if r.Colas {
tmp2 = Nod(ODCL, tmp1, nil)
typecheck(&tmp2, Etop)
l.N.Ninit = list(l.N.Ninit, tmp2)
}
r.Ntest = ordertemp(tmp1.Type, order, false)
tmp2 = Nod(OAS, tmp1, r.Ntest)
r.List = list1(ordertemp(tmp1.Type, order, false))
tmp2 = Nod(OAS, tmp1, r.List.N)
typecheck(&tmp2, Etop)
l.N.Ninit = list(l.N.Ninit, tmp2)
}
@ -918,7 +918,7 @@ func orderstmt(n *Node, order *Order) {
case OSWITCH:
t := marktemp(order)
orderexpr(&n.Ntest, order, nil)
orderexpr(&n.Left, order, nil)
for l := n.List; l != nil; l = l.Next {
if l.N.Op != OXCASE {
Fatal("order switch case %v", Oconv(int(l.N.Op), 0))