| |
| |
| |
|
|
| package ir |
|
|
| import ( |
| "cmd/compile/internal/base" |
| ) |
|
|
| |
| |
| |
| |
| |
| |
| |
| |
| type ReassignOracle struct { |
| fn *Func |
| |
| |
| singleDef map[*Name]Node |
| } |
|
|
| |
| |
| |
| |
| func (ro *ReassignOracle) Init(fn *Func) { |
| ro.fn = fn |
|
|
| |
| |
| ro.singleDef = make(map[*Name]Node) |
| sig := fn.Type() |
| numParams := sig.NumRecvs() + sig.NumParams() |
| for _, param := range fn.Dcl[:numParams] { |
| if IsBlank(param) { |
| continue |
| } |
| |
| ro.singleDef[param] = fn |
| } |
|
|
| |
| |
| var findLocals func(n Node) bool |
| findLocals = func(n Node) bool { |
| if nn, ok := n.(*Name); ok { |
| if nn.Defn != nil && !nn.Addrtaken() && nn.Class == PAUTO { |
| ro.singleDef[nn] = nn.Defn |
| } |
| } else if nn, ok := n.(*ClosureExpr); ok { |
| Any(nn.Func, findLocals) |
| } |
| return false |
| } |
| Any(fn, findLocals) |
|
|
| outerName := func(x Node) *Name { |
| if x == nil { |
| return nil |
| } |
| n, ok := OuterValue(x).(*Name) |
| if ok { |
| return n.Canonical() |
| } |
| return nil |
| } |
|
|
| |
| |
| |
| |
| pruneIfNeeded := func(nn Node, asn Node) { |
| oname := outerName(nn) |
| if oname == nil { |
| return |
| } |
| defn, ok := ro.singleDef[oname] |
| if !ok { |
| return |
| } |
| |
| paramAssigned := oname.Class == PPARAM |
| |
| localAssigned := (oname.Class == PAUTO && asn != defn) |
| if paramAssigned || localAssigned { |
| |
| |
| |
| delete(ro.singleDef, oname) |
| } |
| } |
|
|
| |
| |
| |
| var do func(n Node) bool |
| do = func(n Node) bool { |
| switch n.Op() { |
| case OAS: |
| asn := n.(*AssignStmt) |
| pruneIfNeeded(asn.X, n) |
| case OAS2, OAS2FUNC, OAS2MAPR, OAS2DOTTYPE, OAS2RECV, OSELRECV2: |
| asn := n.(*AssignListStmt) |
| for _, p := range asn.Lhs { |
| pruneIfNeeded(p, n) |
| } |
| case OASOP: |
| asn := n.(*AssignOpStmt) |
| pruneIfNeeded(asn.X, n) |
| case ORANGE: |
| rs := n.(*RangeStmt) |
| pruneIfNeeded(rs.Key, n) |
| pruneIfNeeded(rs.Value, n) |
| case OCLOSURE: |
| n := n.(*ClosureExpr) |
| Any(n.Func, do) |
| } |
| return false |
| } |
| Any(fn, do) |
| } |
|
|
| |
| |
| func (ro *ReassignOracle) StaticValue(n Node) Node { |
| arg := n |
| for { |
| if n.Op() == OCONVNOP { |
| n = n.(*ConvExpr).X |
| continue |
| } |
|
|
| if n.Op() == OINLCALL { |
| n = n.(*InlinedCallExpr).SingleResult() |
| continue |
| } |
|
|
| n1 := ro.staticValue1(n) |
| if n1 == nil { |
| if consistencyCheckEnabled { |
| checkStaticValueResult(arg, n) |
| } |
| return n |
| } |
| n = n1 |
| } |
| } |
|
|
| func (ro *ReassignOracle) staticValue1(nn Node) Node { |
| if nn.Op() != ONAME { |
| return nil |
| } |
| n := nn.(*Name).Canonical() |
| if n.Class != PAUTO { |
| return nil |
| } |
|
|
| defn := n.Defn |
| if defn == nil { |
| return nil |
| } |
|
|
| var rhs Node |
| FindRHS: |
| switch defn.Op() { |
| case OAS: |
| defn := defn.(*AssignStmt) |
| rhs = defn.Y |
| case OAS2: |
| defn := defn.(*AssignListStmt) |
| for i, lhs := range defn.Lhs { |
| if lhs == n { |
| rhs = defn.Rhs[i] |
| break FindRHS |
| } |
| } |
| base.FatalfAt(defn.Pos(), "%v missing from LHS of %v", n, defn) |
| default: |
| return nil |
| } |
| if rhs == nil { |
| base.FatalfAt(defn.Pos(), "RHS is nil: %v", defn) |
| } |
|
|
| if _, ok := ro.singleDef[n]; !ok { |
| return nil |
| } |
|
|
| return rhs |
| } |
|
|
| |
| |
| func (ro *ReassignOracle) Reassigned(n *Name) bool { |
| _, ok := ro.singleDef[n] |
| result := !ok |
| if consistencyCheckEnabled { |
| checkReassignedResult(n, result) |
| } |
| return result |
| } |
|
|