]> Cypherpunks repositories - gostls13.git/commitdiff
cmd/internal/gc: unembed Name field
authorJosh Bleecher Snyder <josharian@gmail.com>
Fri, 15 May 2015 17:02:19 +0000 (10:02 -0700)
committerJosh Bleecher Snyder <josharian@gmail.com>
Fri, 15 May 2015 18:17:51 +0000 (18:17 +0000)
This is an automated follow-up to CL 10120.
It was generated with a combination of eg and gofmt -r.

No functional changes. Passes toolstash -cmp.

Change-Id: I0dc6d146372012b4cce9cc4064066daa6694eee6
Reviewed-on: https://go-review.googlesource.com/10144
Reviewed-by: Brad Fitzpatrick <bradfitz@golang.org>
19 files changed:
src/cmd/5g/ggen.go
src/cmd/5g/gsubr.go
src/cmd/6g/ggen.go
src/cmd/7g/ggen.go
src/cmd/8g/ggen.go
src/cmd/8g/gsubr.go
src/cmd/9g/ggen.go
src/cmd/internal/gc/cgen.go
src/cmd/internal/gc/closure.go
src/cmd/internal/gc/esc.go
src/cmd/internal/gc/gen.go
src/cmd/internal/gc/gsubr.go
src/cmd/internal/gc/inl.go
src/cmd/internal/gc/pgen.go
src/cmd/internal/gc/plive.go
src/cmd/internal/gc/sinit.go
src/cmd/internal/gc/syntax.go
src/cmd/internal/gc/typecheck.go
src/cmd/internal/gc/walk.go

index e4612362a2a789e19a51160c5abe01acb2714550..2ab5d521bb2f613491f93443f821c60759ebdeb7 100644 (file)
@@ -30,7 +30,7 @@ func defframe(ptxt *obj.Prog) {
        r0 := uint32(0)
        for l := gc.Curfn.Func.Dcl; l != nil; l = l.Next {
                n = l.N
-               if !n.Needzero {
+               if !n.Name.Needzero {
                        continue
                }
                if n.Class != gc.PAUTO {
index 2f70bfd468d72c0eafbad679e129eed43e16fd94..2a23580b583e0c7d4e8868337e5d0c4c1bd214bf 100644 (file)
@@ -89,7 +89,7 @@ func split64(n *gc.Node, lo *gc.Node, hi *gc.Node) {
                case gc.ONAME:
                        if n.Class == gc.PPARAMREF {
                                var n1 gc.Node
-                               gc.Cgen(n.Heapaddr, &n1)
+                               gc.Cgen(n.Name.Heapaddr, &n1)
                                sclean[nsclean-1] = n1
                                n = &n1
                        }
index 12198d7187353784728348d23dba76b325ba6789..7282ac53e00393c14da31e775dcc2b4e7766c0cc 100644 (file)
@@ -32,7 +32,7 @@ func defframe(ptxt *obj.Prog) {
        // iterate through declarations - they are sorted in decreasing xoffset order.
        for l := gc.Curfn.Func.Dcl; l != nil; l = l.Next {
                n = l.N
-               if !n.Needzero {
+               if !n.Name.Needzero {
                        continue
                }
                if n.Class != gc.PAUTO {
index af51c31648651249059bf4d86cfb4b0491f687aa..ec2eb09e385898e0440eaebcbd6bb46b99e7115d 100644 (file)
@@ -32,7 +32,7 @@ func defframe(ptxt *obj.Prog) {
        // iterate through declarations - they are sorted in decreasing xoffset order.
        for l := gc.Curfn.Func.Dcl; l != nil; l = l.Next {
                n = l.N
-               if !n.Needzero {
+               if !n.Name.Needzero {
                        continue
                }
                if n.Class != gc.PAUTO {
index baa1b64d1efc06d11d4ac924585c190c4c0f5780..bd2c13e8679b4e948c6f3ef51f7fbda1ddb44ba7 100644 (file)
@@ -30,7 +30,7 @@ func defframe(ptxt *obj.Prog) {
        ax := uint32(0)
        for l := gc.Curfn.Func.Dcl; l != nil; l = l.Next {
                n = l.N
-               if !n.Needzero {
+               if !n.Name.Needzero {
                        continue
                }
                if n.Class != gc.PAUTO {
index b0b0aedabcf4b11ead968d98cb91b9876070d5ab..99bce6eaba7d2879429550ff44698ed4f9b240bb 100644 (file)
@@ -678,7 +678,7 @@ func split64(n *gc.Node, lo *gc.Node, hi *gc.Node) {
                case gc.ONAME:
                        if n.Class == gc.PPARAMREF {
                                var n1 gc.Node
-                               gc.Cgen(n.Heapaddr, &n1)
+                               gc.Cgen(n.Name.Heapaddr, &n1)
                                sclean[nsclean-1] = n1
                                n = &n1
                        }
index 265536921ad2e463b2f0250dc22e26383dbc07ba..3a10a2a76006830d7fa2da22f91bd2a3a71dc3ac 100644 (file)
@@ -32,7 +32,7 @@ func defframe(ptxt *obj.Prog) {
        // iterate through declarations - they are sorted in decreasing xoffset order.
        for l := gc.Curfn.Func.Dcl; l != nil; l = l.Next {
                n = l.N
-               if !n.Needzero {
+               if !n.Name.Needzero {
                        continue
                }
                if n.Class != gc.PAUTO {
index 7237e863ca0c72ef8194dd7489b011e974a51e72..bb022b835123715073df66adc4fe623f92b833d8 100644 (file)
@@ -1579,7 +1579,7 @@ func Agen(n *Node, res *Node) {
                        Fatal("agen: bad ONAME class %#x", n.Class)
                }
 
-               Cgen(n.Heapaddr, res)
+               Cgen(n.Name.Heapaddr, res)
                if n.Xoffset != 0 {
                        addOffset(res, n.Xoffset)
                }
@@ -2517,7 +2517,7 @@ func cgen_call(n *Node, proc int) {
        }
 
        // call direct
-       n.Left.Method = true
+       n.Left.Name.Method = true
 
        Ginscall(n.Left, proc)
 }
index 8d5fd5a600b17c797deef9e0734ec58b77bfcacd..b51e74b77dde96842d69c90ca482bce119f31524 100644 (file)
@@ -84,15 +84,15 @@ func typecheckclosure(func_ *Node, top int) {
 
        for l := func_.Func.Cvars; l != nil; l = l.Next {
                n = l.N.Closure
-               if !n.Captured {
-                       n.Captured = true
-                       if n.Decldepth == 0 {
+               if !n.Name.Captured {
+                       n.Name.Captured = true
+                       if n.Name.Decldepth == 0 {
                                Fatal("typecheckclosure: var %v does not have decldepth assigned", Nconv(n, obj.FmtShort))
                        }
 
                        // Ignore assignments to the variable in straightline code
                        // preceding the first capturing by a closure.
-                       if n.Decldepth == decldepth {
+                       if n.Name.Decldepth == decldepth {
                                n.Assigned = false
                        }
                }
@@ -100,7 +100,7 @@ func typecheckclosure(func_ *Node, top int) {
 
        for l := func_.Func.Dcl; l != nil; l = l.Next {
                if l.N.Op == ONAME && (l.N.Class == PPARAM || l.N.Class == PPARAMOUT) {
-                       l.N.Decldepth = 1
+                       l.N.Name.Decldepth = 1
                }
        }
 
@@ -254,7 +254,7 @@ func capturevars(xfunc *Node) {
 
                // out parameters will be assigned to implicitly upon return.
                if outer.Class != PPARAMOUT && !v.Closure.Addrtaken && !v.Closure.Assigned && v.Type.Width <= 128 {
-                       v.Byval = true
+                       v.Name.Byval = true
                } else {
                        v.Closure.Addrtaken = true
                        outer = Nod(OADDR, outer, nil)
@@ -266,7 +266,7 @@ func capturevars(xfunc *Node) {
                                name = v.Curfn.Nname.Sym
                        }
                        how := "ref"
-                       if v.Byval {
+                       if v.Name.Byval {
                                how = "value"
                        }
                        Warnl(int(v.Lineno), "%v capturing by %s: %v (addr=%v assign=%v width=%d)", name, how, v.Sym, v.Closure.Addrtaken, v.Closure.Assigned, int32(v.Type.Width))
@@ -321,7 +321,7 @@ func transformclosure(xfunc *Node) {
                        }
                        fld = typ(TFIELD)
                        fld.Funarg = 1
-                       if v.Byval {
+                       if v.Name.Byval {
                                // If v is captured by value, we merely downgrade it to PPARAM.
                                v.Class = PPARAM
 
@@ -335,7 +335,7 @@ func transformclosure(xfunc *Node) {
                                addr = newname(Lookupf("&%s", v.Sym.Name))
                                addr.Type = Ptrto(v.Type)
                                addr.Class = PPARAM
-                               v.Heapaddr = addr
+                               v.Name.Heapaddr = addr
                                fld.Nname = addr
                        }
 
@@ -375,14 +375,14 @@ func transformclosure(xfunc *Node) {
                        cv = Nod(OCLOSUREVAR, nil, nil)
 
                        cv.Type = v.Type
-                       if !v.Byval {
+                       if !v.Name.Byval {
                                cv.Type = Ptrto(v.Type)
                        }
                        offset = Rnd(offset, int64(cv.Type.Align))
                        cv.Xoffset = offset
                        offset += cv.Type.Width
 
-                       if v.Byval && v.Type.Width <= int64(2*Widthptr) && Thearch.Thechar == '6' {
+                       if v.Name.Byval && v.Type.Width <= int64(2*Widthptr) && Thearch.Thechar == '6' {
                                //  If it is a small variable captured by value, downgrade it to PAUTO.
                                // This optimization is currently enabled only for amd64, see:
                                // https://github.com/golang/go/issues/9865
@@ -400,8 +400,8 @@ func transformclosure(xfunc *Node) {
                                addr.Used = true
                                addr.Curfn = xfunc
                                xfunc.Func.Dcl = list(xfunc.Func.Dcl, addr)
-                               v.Heapaddr = addr
-                               if v.Byval {
+                               v.Name.Heapaddr = addr
+                               if v.Name.Byval {
                                        cv = Nod(OADDR, cv, nil)
                                }
                                body = list(body, Nod(OAS, addr, cv))
@@ -448,7 +448,7 @@ func walkclosure(func_ *Node, init **NodeList) *Node {
                        continue
                }
                typ1 = typenod(v.Type)
-               if !v.Byval {
+               if !v.Name.Byval {
                        typ1 = Nod(OIND, typ1, nil)
                }
                typ.List = list(typ.List, Nod(ODCLFIELD, newname(v.Sym), typ1))
index c816feaa7f1151bc0b463b53fb8c73dbed432fd5..5fb2095bda6b425f8b20fdd2ff2d77502c8d3489 100644 (file)
@@ -834,7 +834,7 @@ func esc(e *EscState, n *Node, up *Node) {
                                continue
                        }
                        a = v.Closure
-                       if !v.Byval {
+                       if !v.Name.Byval {
                                a = Nod(OADDR, a, nil)
                                a.Lineno = v.Lineno
                                a.Escloopdepth = e.loopdepth
index cd0e650ca99c6c1cd9e47983ce98941ea7a36628..d3c6387a4e79867de63994dcc04f162b4e0d84a0 100644 (file)
@@ -78,10 +78,10 @@ func addrescapes(n *Node) {
                        oldfn := Curfn
 
                        Curfn = n.Curfn
-                       n.Heapaddr = temp(Ptrto(n.Type))
+                       n.Name.Heapaddr = temp(Ptrto(n.Type))
                        buf := fmt.Sprintf("&%v", n.Sym)
-                       n.Heapaddr.Sym = Lookup(buf)
-                       n.Heapaddr.Orig.Sym = n.Heapaddr.Sym
+                       n.Name.Heapaddr.Sym = Lookup(buf)
+                       n.Name.Heapaddr.Orig.Sym = n.Name.Heapaddr.Sym
                        n.Esc = EscHeap
                        if Debug['m'] != 0 {
                                fmt.Printf("%v: moved to heap: %v\n", n.Line(), n)
@@ -262,7 +262,7 @@ func cgen_dcl(n *Node) {
        if n.Alloc == nil {
                n.Alloc = callnew(n.Type)
        }
-       Cgen_as(n.Heapaddr, n.Alloc)
+       Cgen_as(n.Name.Heapaddr, n.Alloc)
 }
 
 /*
index 98d6346e2a212b8d67d3d6d601307b96ca85d78c..5ec4587e74edaa71c883d8a14c9fc08588496995 100644 (file)
@@ -214,7 +214,7 @@ func ggloblnod(nam *Node) {
        p.To.Sym = nil
        p.To.Type = obj.TYPE_CONST
        p.To.Offset = nam.Type.Width
-       if nam.Readonly {
+       if nam.Name.Readonly {
                p.From3.Offset = obj.RODATA
        }
        if nam.Type != nil && !haspointers(nam.Type) {
@@ -369,7 +369,7 @@ func Naddr(a *obj.Addr, n *Node) {
                if s == nil {
                        s = Lookup(".noname")
                }
-               if n.Method {
+               if n.Name.Method {
                        if n.Type != nil {
                                if n.Type.Sym != nil {
                                        if n.Type.Sym.Pkg != nil {
index dd2087dec3d107b0b4b2459afb3b934eaf93db4c..22a5d3d9fe8aaef729fcaf6edf17a30a3cb0100e 100644 (file)
@@ -511,10 +511,10 @@ func mkinlcall(np **Node, fn *Node, isddd bool) {
 
 func tinlvar(t *Type) *Node {
        if t.Nname != nil && !isblank(t.Nname) {
-               if t.Nname.Inlvar == nil {
+               if t.Nname.Name.Inlvar == nil {
                        Fatal("missing inlvar for %v\n", t.Nname)
                }
-               return t.Nname.Inlvar
+               return t.Nname.Name.Inlvar
        }
 
        typecheck(&nblank, Erv|Easgn)
@@ -577,13 +577,13 @@ func mkinlcall1(np **Node, fn *Node, isddd bool) {
                        continue
                }
                if ll.N.Op == ONAME {
-                       ll.N.Inlvar = inlvar(ll.N)
+                       ll.N.Name.Inlvar = inlvar(ll.N)
 
                        // Typecheck because inlvar is not necessarily a function parameter.
-                       typecheck(&ll.N.Inlvar, Erv)
+                       typecheck(&ll.N.Name.Inlvar, Erv)
 
                        if ll.N.Class&^PHEAP != PAUTO {
-                               ninit = list(ninit, Nod(ODCL, ll.N.Inlvar, nil)) // otherwise gen won't emit the allocations for heapallocs
+                               ninit = list(ninit, Nod(ODCL, ll.N.Name.Inlvar, nil)) // otherwise gen won't emit the allocations for heapallocs
                        }
                }
        }
@@ -594,7 +594,7 @@ func mkinlcall1(np **Node, fn *Node, isddd bool) {
                if t != nil && t.Nname != nil && !isblank(t.Nname) {
                        m = inlvar(t.Nname)
                        typecheck(&m, Erv)
-                       t.Nname.Inlvar = m
+                       t.Nname.Name.Inlvar = m
                } else {
                        // anonymous return values, synthesize names for use in assignment that replaces return
                        m = retvar(t, i)
@@ -611,7 +611,7 @@ func mkinlcall1(np **Node, fn *Node, isddd bool) {
                // method call with a receiver.
                t := getthisx(fn.Type).Type
 
-               if t != nil && t.Nname != nil && !isblank(t.Nname) && t.Nname.Inlvar == nil {
+               if t != nil && t.Nname != nil && !isblank(t.Nname) && t.Nname.Name.Inlvar == nil {
                        Fatal("missing inlvar for %v\n", t.Nname)
                }
                if n.Left.Left == nil {
@@ -680,7 +680,7 @@ func mkinlcall1(np **Node, fn *Node, isddd bool) {
                // append receiver inlvar to LHS.
                t := getthisx(fn.Type).Type
 
-               if t != nil && t.Nname != nil && !isblank(t.Nname) && t.Nname.Inlvar == nil {
+               if t != nil && t.Nname != nil && !isblank(t.Nname) && t.Nname.Name.Inlvar == nil {
                        Fatal("missing inlvar for %v\n", t.Nname)
                }
                if t == nil {
@@ -907,11 +907,11 @@ func inlsubst(n *Node) *Node {
 
        switch n.Op {
        case ONAME:
-               if n.Inlvar != nil { // These will be set during inlnode
+               if n.Name.Inlvar != nil { // These will be set during inlnode
                        if Debug['m'] > 2 {
-                               fmt.Printf("substituting name %v  ->  %v\n", Nconv(n, obj.FmtSign), Nconv(n.Inlvar, obj.FmtSign))
+                               fmt.Printf("substituting name %v  ->  %v\n", Nconv(n, obj.FmtSign), Nconv(n.Name.Inlvar, obj.FmtSign))
                        }
-                       return n.Inlvar
+                       return n.Name.Inlvar
                }
 
                if Debug['m'] > 2 {
index f247a685ca01527ce44f8529668f4e9207f206c8..1b67cf2c3e0dd8f41cae1a4044a28749992d001c 100644 (file)
@@ -200,8 +200,8 @@ func cmpstackvar(a *Node, b *Node) int {
                return bp - ap
        }
 
-       ap = obj.Bool2int(a.Needzero)
-       bp = obj.Bool2int(b.Needzero)
+       ap = obj.Bool2int(a.Name.Needzero)
+       bp = obj.Bool2int(b.Name.Needzero)
        if ap != bp {
                return bp - ap
        }
index 040a77814ed2256e768f70b11249195fe9dbed30..977789f3e4a36d028b84df9d6c6d22d080b90dbd 100644 (file)
@@ -1281,8 +1281,8 @@ func livenessepilogue(lv *Liveness) {
                                                }
                                                bvset(all, pos) // silence future warnings in this block
                                                n = lv.vars[pos]
-                                               if !n.Needzero {
-                                                       n.Needzero = true
+                                               if !n.Name.Needzero {
+                                                       n.Name.Needzero = true
                                                        if debuglive >= 1 {
                                                                Warnl(int(p.Lineno), "%v: %v is ambiguously live", Curfn.Nname, Nconv(n, obj.FmtLong))
                                                        }
index 4fdb2e9223aff447cb8fd87991335442dfcd62ae..dfaec74de25ace723a6cbcc37ca6cc31d92e4f3a 100644 (file)
@@ -510,7 +510,7 @@ func staticname(t *Type, ctxt int) *Node {
        n := newname(Lookupf("statictmp_%.4d", statuniqgen))
        statuniqgen++
        if ctxt == 0 {
-               n.Readonly = true
+               n.Name.Readonly = true
        }
        addvar(n, t, PEXTERN)
        return n
index 9ef00a09cbd99da0721d2a4c224e9fa6eaf66e04..818d546970d824ff4bff52be218916eee49f745d 100644 (file)
@@ -64,7 +64,7 @@ type Node struct {
        Reg int16
 
        // ONAME
-       *Name
+       Name     *Name
        Ntype    *Node
        Defn     *Node // ONAME: initializing assignment; OLABEL: labeled statement
        Pack     *Node // real package for import . names
index 6ad8c82c32d7a8c9655205aed3fe54b31320a82d..06f8b34305e0c78664de99d51fdf20ea2833db6e 100644 (file)
@@ -311,8 +311,8 @@ OpSwitch:
                break OpSwitch
 
        case ONAME:
-               if n.Decldepth == 0 {
-                       n.Decldepth = decldepth
+               if n.Name.Decldepth == 0 {
+                       n.Name.Decldepth = decldepth
                }
                if n.Etype != 0 {
                        ok |= Ecall
@@ -3521,7 +3521,7 @@ func typecheckfunc(n *Node) {
 
        for l := n.Func.Dcl; l != nil; l = l.Next {
                if l.N.Op == ONAME && (l.N.Class == PPARAM || l.N.Class == PPARAMOUT) {
-                       l.N.Decldepth = 1
+                       l.N.Name.Decldepth = 1
                }
        }
 }
index 81bb8524b3aca6d18ef8af2b2f7a5bb079684c8d..a7f5256b1905aa229ed32606130873bd8b0b1786 100644 (file)
@@ -2719,7 +2719,7 @@ func paramstoheap(argin **Type, out int) *NodeList {
                if v.Alloc == nil {
                        v.Alloc = callnew(v.Type)
                }
-               nn = list(nn, Nod(OAS, v.Heapaddr, v.Alloc))
+               nn = list(nn, Nod(OAS, v.Name.Heapaddr, v.Alloc))
                if v.Class&^PHEAP != PPARAMOUT {
                        as = Nod(OAS, v, v.Stackparam)
                        v.Stackparam.Typecheck = 1