1 // Copyright 2012 The Go Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style
3 // license that can be found in the LICENSE file.
11 "cmd/compile/internal/base"
12 "cmd/compile/internal/ir"
13 "cmd/compile/internal/reflectdata"
14 "cmd/compile/internal/staticinit"
15 "cmd/compile/internal/typecheck"
16 "cmd/compile/internal/types"
21 // Rewrite tree to use separate statements to enforce
22 // order of evaluation. Makes walk easier, because it
23 // can (after this runs) reorder at will within an expression.
25 // Rewrite m[k] op= r into m[k] = m[k] op r if op is / or %.
27 // Introduce temporaries as needed by runtime routines.
28 // For example, the map runtime routines take the map key
29 // by reference, so make sure all map keys are addressable
30 // by copying them to temporaries as needed.
31 // The same is true for channel operations.
33 // Arrange that map index expressions only appear in direct
34 // assignments x = m[k] or m[k] = x, never in larger expressions.
36 // Arrange that receive expressions only appear in direct assignments
37 // x = <-c or as standalone statements <-c, never in larger expressions.
39 // TODO(rsc): The temporary introduction during multiple assignments
40 // should be moved into this file, so that the temporaries can be cleaned
41 // and so that conversions implicit in the OAS2FUNC and OAS2RECV
42 // nodes can be made explicit and then have their temporaries cleaned.
44 // TODO(rsc): Goto and multilevel break/continue can jump over
45 // inserted VARKILL annotations. Work out a way to handle these.
46 // The current implementation is safe, in that it will execute correctly.
47 // But it won't reuse temporaries as aggressively as it might, and
48 // it can result in unnecessary zeroing of those variables in the function
51 // orderState holds state during the ordering process.
52 type orderState struct {
53 out []ir.Node // list of generated statements
54 temp []*ir.Name // stack of temporary variables
55 free map[string][]*ir.Name // free list of unused temporaries, by type.LinkString().
56 edit func(ir.Node) ir.Node // cached closure of o.exprNoLHS
59 // Order rewrites fn.Nbody to apply the ordering constraints
60 // described in the comment at the top of the file.
61 func order(fn *ir.Func) {
63 s := fmt.Sprintf("\nbefore order %v", fn.Sym())
64 ir.DumpList(s, fn.Body)
66 ir.SetPos(fn) // Set reasonable position for instrumenting code. See issue 53688.
67 orderBlock(&fn.Body, map[string][]*ir.Name{})
70 // append typechecks stmt and appends it to out.
71 func (o *orderState) append(stmt ir.Node) {
72 o.out = append(o.out, typecheck.Stmt(stmt))
75 // newTemp allocates a new temporary with the given type,
76 // pushes it onto the temp stack, and returns it.
77 // If clear is true, newTemp emits code to zero the temporary.
78 func (o *orderState) newTemp(t *types.Type, clear bool) *ir.Name {
81 if a := o.free[key]; len(a) > 0 {
83 if !types.Identical(t, v.Type()) {
84 base.Fatalf("expected %L to have type %v", v, t)
86 o.free[key] = a[:len(a)-1]
91 o.append(ir.NewAssignStmt(base.Pos, v, nil))
94 o.temp = append(o.temp, v)
98 // copyExpr behaves like newTemp but also emits
99 // code to initialize the temporary to the value n.
100 func (o *orderState) copyExpr(n ir.Node) *ir.Name {
101 return o.copyExpr1(n, false)
104 // copyExprClear is like copyExpr but clears the temp before assignment.
105 // It is provided for use when the evaluation of tmp = n turns into
106 // a function call that is passed a pointer to the temporary as the output space.
107 // If the call blocks before tmp has been written,
108 // the garbage collector will still treat the temporary as live,
109 // so we must zero it before entering that call.
110 // Today, this only happens for channel receive operations.
111 // (The other candidate would be map access, but map access
112 // returns a pointer to the result data instead of taking a pointer
114 func (o *orderState) copyExprClear(n ir.Node) *ir.Name {
115 return o.copyExpr1(n, true)
118 func (o *orderState) copyExpr1(n ir.Node, clear bool) *ir.Name {
120 v := o.newTemp(t, clear)
121 o.append(ir.NewAssignStmt(base.Pos, v, n))
125 // cheapExpr returns a cheap version of n.
126 // The definition of cheap is that n is a variable or constant.
127 // If not, cheapExpr allocates a new tmp, emits tmp = n,
128 // and then returns tmp.
129 func (o *orderState) cheapExpr(n ir.Node) ir.Node {
135 case ir.ONAME, ir.OLITERAL, ir.ONIL:
137 case ir.OLEN, ir.OCAP:
138 n := n.(*ir.UnaryExpr)
139 l := o.cheapExpr(n.X)
143 a := ir.SepCopy(n).(*ir.UnaryExpr)
145 return typecheck.Expr(a)
151 // safeExpr returns a safe version of n.
152 // The definition of safe is that n can appear multiple times
153 // without violating the semantics of the original program,
154 // and that assigning to the safe version has the same effect
155 // as assigning to the original n.
157 // The intended use is to apply to x when rewriting x += y into x = x + y.
158 func (o *orderState) safeExpr(n ir.Node) ir.Node {
160 case ir.ONAME, ir.OLITERAL, ir.ONIL:
163 case ir.OLEN, ir.OCAP:
164 n := n.(*ir.UnaryExpr)
169 a := ir.SepCopy(n).(*ir.UnaryExpr)
171 return typecheck.Expr(a)
174 n := n.(*ir.SelectorExpr)
179 a := ir.SepCopy(n).(*ir.SelectorExpr)
181 return typecheck.Expr(a)
184 n := n.(*ir.SelectorExpr)
185 l := o.cheapExpr(n.X)
189 a := ir.SepCopy(n).(*ir.SelectorExpr)
191 return typecheck.Expr(a)
194 n := n.(*ir.StarExpr)
195 l := o.cheapExpr(n.X)
199 a := ir.SepCopy(n).(*ir.StarExpr)
201 return typecheck.Expr(a)
203 case ir.OINDEX, ir.OINDEXMAP:
204 n := n.(*ir.IndexExpr)
206 if n.X.Type().IsArray() {
211 r := o.cheapExpr(n.Index)
212 if l == n.X && r == n.Index {
215 a := ir.SepCopy(n).(*ir.IndexExpr)
218 return typecheck.Expr(a)
221 base.Fatalf("order.safeExpr %v", n.Op())
222 return nil // not reached
226 // isaddrokay reports whether it is okay to pass n's address to runtime routines.
227 // Taking the address of a variable makes the liveness and optimization analyses
228 // lose track of where the variable's lifetime ends. To avoid hurting the analyses
229 // of ordinary stack variables, those are not 'isaddrokay'. Temporaries are okay,
230 // because we emit explicit VARKILL instructions marking the end of those
231 // temporaries' lifetimes.
232 func isaddrokay(n ir.Node) bool {
233 return ir.IsAddressable(n) && (n.Op() != ir.ONAME || n.(*ir.Name).Class == ir.PEXTERN || ir.IsAutoTmp(n))
236 // addrTemp ensures that n is okay to pass by address to runtime routines.
237 // If the original argument n is not okay, addrTemp creates a tmp, emits
238 // tmp = n, and then returns tmp.
239 // The result of addrTemp MUST be assigned back to n, e.g.
241 // n.Left = o.addrTemp(n.Left)
242 func (o *orderState) addrTemp(n ir.Node) ir.Node {
243 if n.Op() == ir.OLITERAL || n.Op() == ir.ONIL {
244 // TODO: expand this to all static composite literal nodes?
245 n = typecheck.DefaultLit(n, nil)
246 types.CalcSize(n.Type())
247 vstat := readonlystaticname(n.Type())
248 var s staticinit.Schedule
249 s.StaticAssign(vstat, 0, n, n.Type())
251 base.Fatalf("staticassign of const generated code: %+v", n)
253 vstat = typecheck.Expr(vstat).(*ir.Name)
262 // mapKeyTemp prepares n to be a key in a map runtime call and returns n.
263 // It should only be used for map runtime calls which have *_fast* versions.
264 func (o *orderState) mapKeyTemp(t *types.Type, n ir.Node) ir.Node {
265 // Most map calls need to take the address of the key.
266 // Exception: map*_fast* calls. See golang.org/issue/19015.
274 kt = types.Types[types.TUINT32]
276 kt = types.Types[types.TUINT64]
277 case mapfast32ptr, mapfast64ptr:
278 kt = types.Types[types.TUNSAFEPTR]
280 kt = types.Types[types.TSTRING]
286 case nt.Kind() == kt.Kind(), nt.IsPtrShaped() && kt.IsPtrShaped():
287 // can directly convert (e.g. named type to underlying type, or one pointer to another)
288 return typecheck.Expr(ir.NewConvExpr(n.Pos(), ir.OCONVNOP, kt, n))
289 case nt.IsInteger() && kt.IsInteger():
290 // can directly convert (e.g. int32 to uint32)
291 if n.Op() == ir.OLITERAL && nt.IsSigned() {
292 // avoid constant overflow error
293 n = ir.NewConstExpr(constant.MakeUint64(uint64(ir.Int64Val(n))), n)
297 return typecheck.Expr(ir.NewConvExpr(n.Pos(), ir.OCONV, kt, n))
299 // Unsafe cast through memory.
300 // We'll need to do a load with type kt. Create a temporary of type kt to
301 // ensure sufficient alignment. nt may be under-aligned.
302 if uint8(kt.Alignment()) < uint8(nt.Alignment()) {
303 base.Fatalf("mapKeyTemp: key type is not sufficiently aligned, kt=%v nt=%v", kt, nt)
305 tmp := o.newTemp(kt, true)
307 var e ir.Node = typecheck.NodAddr(tmp)
308 e = ir.NewConvExpr(n.Pos(), ir.OCONVNOP, nt.PtrTo(), e)
309 e = ir.NewStarExpr(n.Pos(), e)
310 o.append(ir.NewAssignStmt(base.Pos, e, n))
315 // mapKeyReplaceStrConv replaces OBYTES2STR by OBYTES2STRTMP
316 // in n to avoid string allocations for keys in map lookups.
317 // Returns a bool that signals if a modification was made.
322 // x = m[T1{... Tn{..., string(k), ...}]
324 // where k is []byte, T1 to Tn is a nesting of struct and array literals,
325 // the allocation of backing bytes for the string can be avoided
326 // by reusing the []byte backing array. These are special cases
327 // for avoiding allocations when converting byte slices to strings.
328 // It would be nice to handle these generally, but because
329 // []byte keys are not allowed in maps, the use of string(k)
330 // comes up in important cases in practice. See issue 3512.
331 func mapKeyReplaceStrConv(n ir.Node) bool {
335 n := n.(*ir.ConvExpr)
336 n.SetOp(ir.OBYTES2STRTMP)
339 n := n.(*ir.CompLitExpr)
340 for _, elem := range n.List {
341 elem := elem.(*ir.StructKeyExpr)
342 if mapKeyReplaceStrConv(elem.Value) {
347 n := n.(*ir.CompLitExpr)
348 for _, elem := range n.List {
349 if elem.Op() == ir.OKEY {
350 elem = elem.(*ir.KeyExpr).Value
352 if mapKeyReplaceStrConv(elem) {
362 // markTemp returns the top of the temporary variable stack.
363 func (o *orderState) markTemp() ordermarker {
364 return ordermarker(len(o.temp))
367 // popTemp pops temporaries off the stack until reaching the mark,
368 // which must have been returned by markTemp.
369 func (o *orderState) popTemp(mark ordermarker) {
370 for _, n := range o.temp[mark:] {
371 key := n.Type().LinkString()
372 o.free[key] = append(o.free[key], n)
374 o.temp = o.temp[:mark]
377 // cleanTempNoPop emits VARKILL instructions to *out
378 // for each temporary above the mark on the temporary stack.
379 // It does not pop the temporaries from the stack.
380 func (o *orderState) cleanTempNoPop(mark ordermarker) []ir.Node {
382 for i := len(o.temp) - 1; i >= int(mark); i-- {
384 out = append(out, typecheck.Stmt(ir.NewUnaryExpr(base.Pos, ir.OVARKILL, n)))
389 // cleanTemp emits VARKILL instructions for each temporary above the
390 // mark on the temporary stack and removes them from the stack.
391 func (o *orderState) cleanTemp(top ordermarker) {
392 o.out = append(o.out, o.cleanTempNoPop(top)...)
396 // stmtList orders each of the statements in the list.
397 func (o *orderState) stmtList(l ir.Nodes) {
400 orderMakeSliceCopy(s[i:])
405 // orderMakeSliceCopy matches the pattern:
407 // m = OMAKESLICE([]T, x); OCOPY(m, s)
409 // and rewrites it to:
411 // m = OMAKESLICECOPY([]T, x, s); nil
412 func orderMakeSliceCopy(s []ir.Node) {
413 if base.Flag.N != 0 || base.Flag.Cfg.Instrumenting {
416 if len(s) < 2 || s[0] == nil || s[0].Op() != ir.OAS || s[1] == nil || s[1].Op() != ir.OCOPY {
420 as := s[0].(*ir.AssignStmt)
421 cp := s[1].(*ir.BinaryExpr)
422 if as.Y == nil || as.Y.Op() != ir.OMAKESLICE || ir.IsBlank(as.X) ||
423 as.X.Op() != ir.ONAME || cp.X.Op() != ir.ONAME || cp.Y.Op() != ir.ONAME ||
424 as.X.Name() != cp.X.Name() || cp.X.Name() == cp.Y.Name() {
425 // The line above this one is correct with the differing equality operators:
426 // we want as.X and cp.X to be the same name,
427 // but we want the initial data to be coming from a different name.
431 mk := as.Y.(*ir.MakeExpr)
432 if mk.Esc() == ir.EscNone || mk.Len == nil || mk.Cap != nil {
435 mk.SetOp(ir.OMAKESLICECOPY)
437 // Set bounded when m = OMAKESLICE([]T, len(s)); OCOPY(m, s)
438 mk.SetBounded(mk.Len.Op() == ir.OLEN && ir.SameSafeExpr(mk.Len.(*ir.UnaryExpr).X, cp.Y))
439 as.Y = typecheck.Expr(mk)
440 s[1] = nil // remove separate copy call
443 // edge inserts coverage instrumentation for libfuzzer.
444 func (o *orderState) edge() {
445 if base.Debug.Libfuzzer == 0 {
449 // Create a new uint8 counter to be allocated in section __sancov_cntrs
450 counter := staticinit.StaticName(types.Types[types.TUINT8])
451 counter.SetLibfuzzer8BitCounter(true)
452 // As well as setting SetLibfuzzer8BitCounter, we preemptively set the
453 // symbol type to SLIBFUZZER_8BIT_COUNTER so that the race detector
454 // instrumentation pass (which does not have access to the flags set by
455 // SetLibfuzzer8BitCounter) knows to ignore them. This information is
456 // lost by the time it reaches the compile step, so SetLibfuzzer8BitCounter
457 // is still necessary.
458 counter.Linksym().Type = objabi.SLIBFUZZER_8BIT_COUNTER
460 // We guarantee that the counter never becomes zero again once it has been
461 // incremented once. This implementation follows the NeverZero optimization
462 // presented by the paper:
463 // "AFL++: Combining Incremental Steps of Fuzzing Research"
464 // The NeverZero policy avoids the overflow to 0 by setting the counter to one
465 // after it reaches 255 and so, if an edge is executed at least one time, the entry is
467 // Another policy presented in the paper is the Saturated Counters policy which
468 // freezes the counter when it reaches the value of 255. However, a range
469 // of experiments showed that that decreases overall performance.
470 o.append(ir.NewIfStmt(base.Pos,
471 ir.NewBinaryExpr(base.Pos, ir.OEQ, counter, ir.NewInt(0xff)),
472 []ir.Node{ir.NewAssignStmt(base.Pos, counter, ir.NewInt(1))},
473 []ir.Node{ir.NewAssignOpStmt(base.Pos, ir.OADD, counter, ir.NewInt(1))}))
476 // orderBlock orders the block of statements in n into a new slice,
477 // and then replaces the old slice in n with the new slice.
478 // free is a map that can be used to obtain temporary variables by type.
479 func orderBlock(n *ir.Nodes, free map[string][]*ir.Name) {
481 // Set reasonable position for instrumenting code. See issue 53688.
482 // It would be nice if ir.Nodes had a position (the opening {, probably),
483 // but it doesn't. So we use the first statement's position instead.
488 mark := order.markTemp()
491 order.cleanTemp(mark)
495 // exprInPlace orders the side effects in *np and
496 // leaves them as the init list of the final *np.
497 // The result of exprInPlace MUST be assigned back to n, e.g.
499 // n.Left = o.exprInPlace(n.Left)
500 func (o *orderState) exprInPlace(n ir.Node) ir.Node {
503 n = order.expr(n, nil)
504 n = ir.InitExpr(order.out, n)
506 // insert new temporaries from order
507 // at head of outer list.
508 o.temp = append(o.temp, order.temp...)
512 // orderStmtInPlace orders the side effects of the single statement *np
513 // and replaces it with the resulting statement list.
514 // The result of orderStmtInPlace MUST be assigned back to n, e.g.
516 // n.Left = orderStmtInPlace(n.Left)
518 // free is a map that can be used to obtain temporary variables by type.
519 func orderStmtInPlace(n ir.Node, free map[string][]*ir.Name) ir.Node {
522 mark := order.markTemp()
524 order.cleanTemp(mark)
525 return ir.NewBlockStmt(src.NoXPos, order.out)
528 // init moves n's init list to o.out.
529 func (o *orderState) init(n ir.Node) {
530 if ir.MayBeShared(n) {
531 // For concurrency safety, don't mutate potentially shared nodes.
532 // First, ensure that no work is required here.
533 if len(n.Init()) > 0 {
534 base.Fatalf("order.init shared node with ninit")
538 o.stmtList(ir.TakeInit(n))
541 // call orders the call expression n.
542 // n.Op is OCALLFUNC/OCALLINTER or a builtin like OCOPY.
543 func (o *orderState) call(nn ir.Node) {
544 if len(nn.Init()) > 0 {
545 // Caller should have already called o.init(nn).
546 base.Fatalf("%v with unexpected ninit", nn.Op())
548 if nn.Op() == ir.OCALLMETH {
549 base.FatalfAt(nn.Pos(), "OCALLMETH missed by typecheck")
552 // Builtin functions.
553 if nn.Op() != ir.OCALLFUNC && nn.Op() != ir.OCALLINTER {
554 switch n := nn.(type) {
556 base.Fatalf("unexpected call: %+v", n)
558 n.X = o.expr(n.X, nil)
560 n.X = o.expr(n.X, nil)
562 n.X = o.expr(n.X, nil)
563 n.Y = o.expr(n.Y, nil)
565 n.Len = o.expr(n.Len, nil)
566 n.Cap = o.expr(n.Cap, nil)
573 n := nn.(*ir.CallExpr)
574 typecheck.FixVariadicCall(n)
576 if isFuncPCIntrinsic(n) && isIfaceOfFunc(n.Args[0]) {
577 // For internal/abi.FuncPCABIxxx(fn), if fn is a defined function,
578 // do not introduce temporaries here, so it is easier to rewrite it
579 // to symbol address reference later in walk.
583 n.X = o.expr(n.X, nil)
587 // mapAssign appends n to o.out.
588 func (o *orderState) mapAssign(n ir.Node) {
591 base.Fatalf("order.mapAssign %v", n.Op())
594 n := n.(*ir.AssignStmt)
595 if n.X.Op() == ir.OINDEXMAP {
596 n.Y = o.safeMapRHS(n.Y)
598 o.out = append(o.out, n)
600 n := n.(*ir.AssignOpStmt)
601 if n.X.Op() == ir.OINDEXMAP {
602 n.Y = o.safeMapRHS(n.Y)
604 o.out = append(o.out, n)
608 func (o *orderState) safeMapRHS(r ir.Node) ir.Node {
609 // Make sure we evaluate the RHS before starting the map insert.
610 // We need to make sure the RHS won't panic. See issue 22881.
611 if r.Op() == ir.OAPPEND {
612 r := r.(*ir.CallExpr)
614 for i, n := range s {
615 s[i] = o.cheapExpr(n)
619 return o.cheapExpr(r)
622 // stmt orders the statement n, appending to o.out.
623 // Temporaries created during the statement are cleaned
624 // up using VARKILL instructions as possible.
625 func (o *orderState) stmt(n ir.Node) {
635 base.Fatalf("order.stmt %v", n.Op())
637 case ir.OVARKILL, ir.OVARLIVE, ir.OINLMARK:
638 o.out = append(o.out, n)
641 n := n.(*ir.AssignStmt)
643 n.X = o.expr(n.X, nil)
644 n.Y = o.expr(n.Y, n.X)
649 n := n.(*ir.AssignOpStmt)
651 n.X = o.expr(n.X, nil)
652 n.Y = o.expr(n.Y, nil)
654 if base.Flag.Cfg.Instrumenting || n.X.Op() == ir.OINDEXMAP && (n.AsOp == ir.ODIV || n.AsOp == ir.OMOD) {
655 // Rewrite m[k] op= r into m[k] = m[k] op r so
656 // that we can ensure that if op panics
657 // because r is zero, the panic happens before
658 // the map assignment.
659 // DeepCopy is a big hammer here, but safeExpr
660 // makes sure there is nothing too deep being copied.
661 l1 := o.safeExpr(n.X)
662 l2 := ir.DeepCopy(src.NoXPos, l1)
663 if l2.Op() == ir.OINDEXMAP {
664 l2 := l2.(*ir.IndexExpr)
668 r := o.expr(typecheck.Expr(ir.NewBinaryExpr(n.Pos(), n.AsOp, l2, n.Y)), nil)
669 as := typecheck.Stmt(ir.NewAssignStmt(n.Pos(), l1, r))
679 n := n.(*ir.AssignListStmt)
683 o.out = append(o.out, n)
686 // Special: avoid copy of func call n.Right
688 n := n.(*ir.AssignListStmt)
693 if ic, ok := call.(*ir.InlinedCallExpr); ok {
697 n.Rhs = ic.ReturnVars
700 o.out = append(o.out, n)
707 // Special: use temporary variables to hold result,
708 // so that runtime can take address of temporary.
709 // No temporary for blank assignment.
711 // OAS2MAPR: make sure key is addressable if needed,
712 // and make sure OINDEXMAP is not copied out.
713 case ir.OAS2DOTTYPE, ir.OAS2RECV, ir.OAS2MAPR:
714 n := n.(*ir.AssignListStmt)
718 switch r := n.Rhs[0]; r.Op() {
720 r := r.(*ir.TypeAssertExpr)
721 r.X = o.expr(r.X, nil)
722 case ir.ODYNAMICDOTTYPE2:
723 r := r.(*ir.DynamicTypeAssertExpr)
724 r.X = o.expr(r.X, nil)
725 r.RType = o.expr(r.RType, nil)
726 r.ITab = o.expr(r.ITab, nil)
728 r := r.(*ir.UnaryExpr)
729 r.X = o.expr(r.X, nil)
731 r := r.(*ir.IndexExpr)
732 r.X = o.expr(r.X, nil)
733 r.Index = o.expr(r.Index, nil)
734 // See similar conversion for OINDEXMAP below.
735 _ = mapKeyReplaceStrConv(r.Index)
736 r.Index = o.mapKeyTemp(r.X.Type(), r.Index)
738 base.Fatalf("order.stmt: %v", r.Op())
744 // Special: does not save n onto out.
746 n := n.(*ir.BlockStmt)
749 // Special: n->left is not an expression; save as is.
759 o.out = append(o.out, n)
761 // Special: handle call arguments.
762 case ir.OCALLFUNC, ir.OCALLINTER:
763 n := n.(*ir.CallExpr)
766 o.out = append(o.out, n)
770 n := n.(*ir.InlinedCallExpr)
773 // discard results; double-check for no side effects
774 for _, result := range n.ReturnVars {
775 if staticinit.AnySideEffects(result) {
776 base.FatalfAt(result.Pos(), "inlined call result has side effects: %v", result)
780 case ir.OCHECKNIL, ir.OCLOSE, ir.OPANIC, ir.ORECV:
781 n := n.(*ir.UnaryExpr)
783 n.X = o.expr(n.X, nil)
784 o.out = append(o.out, n)
788 n := n.(*ir.BinaryExpr)
790 n.X = o.expr(n.X, nil)
791 n.Y = o.expr(n.Y, nil)
792 o.out = append(o.out, n)
795 case ir.OPRINT, ir.OPRINTN, ir.ORECOVERFP:
796 n := n.(*ir.CallExpr)
799 o.out = append(o.out, n)
802 // Special: order arguments to inner call but not call itself.
803 case ir.ODEFER, ir.OGO:
804 n := n.(*ir.GoDeferStmt)
808 o.out = append(o.out, n)
812 n := n.(*ir.CallExpr)
814 n.Args[0] = o.expr(n.Args[0], nil)
815 n.Args[1] = o.expr(n.Args[1], nil)
816 n.Args[1] = o.mapKeyTemp(n.Args[0].Type(), n.Args[1])
817 o.out = append(o.out, n)
820 // Clean temporaries from condition evaluation at
821 // beginning of loop body and after for statement.
825 n.Cond = o.exprInPlace(n.Cond)
826 n.Body.Prepend(o.cleanTempNoPop(t)...)
827 orderBlock(&n.Body, o.free)
828 n.Post = orderStmtInPlace(n.Post, o.free)
829 o.out = append(o.out, n)
832 // Clean temporaries from condition at
833 // beginning of both branches.
837 n.Cond = o.exprInPlace(n.Cond)
838 n.Body.Prepend(o.cleanTempNoPop(t)...)
839 n.Else.Prepend(o.cleanTempNoPop(t)...)
841 orderBlock(&n.Body, o.free)
842 orderBlock(&n.Else, o.free)
843 o.out = append(o.out, n)
846 // n.Right is the expression being ranged over.
847 // order it, and then make a copy if we need one.
848 // We almost always do, to ensure that we don't
849 // see any value changes made during the loop.
850 // Usually the copy is cheap (e.g., array pointer,
851 // chan, slice, string are all tiny).
852 // The exception is ranging over an array value
853 // (not a slice, not a pointer to array),
854 // which must make a copy to avoid seeing updates made during
855 // the range body. Ranging over an array value is uncommon though.
857 // Mark []byte(str) range expression to reuse string backing storage.
858 // It is safe because the storage cannot be mutated.
859 n := n.(*ir.RangeStmt)
860 if n.X.Op() == ir.OSTR2BYTES {
861 n.X.(*ir.ConvExpr).SetOp(ir.OSTR2BYTESTMP)
865 n.X = o.expr(n.X, nil)
868 xt := typecheck.RangeExprType(n.X.Type())
871 base.Fatalf("order.stmt range %v", n.Type())
873 case types.TARRAY, types.TSLICE:
874 if n.Value == nil || ir.IsBlank(n.Value) {
875 // for i := range x will only use x once, to compute len(x).
876 // No need to copy it.
881 case types.TCHAN, types.TSTRING:
882 // chan, string, slice, array ranges use value multiple times.
886 if r.Type().IsString() && r.Type() != types.Types[types.TSTRING] {
887 r = ir.NewConvExpr(base.Pos, ir.OCONV, nil, r)
888 r.SetType(types.Types[types.TSTRING])
889 r = typecheck.Expr(r)
896 // Preserve the body of the map clear pattern so it can
897 // be detected during walk. The loop body will not be used
898 // when optimizing away the range loop to a runtime call.
903 // copy the map value in case it is a map literal.
904 // TODO(rsc): Make tmp = literal expressions reuse tmp.
905 // For maps tmp is just one word so it hardly matters.
909 // n.Prealloc is the temp for the iterator.
910 // MapIterType contains pointers and needs to be zeroed.
911 n.Prealloc = o.newTemp(reflectdata.MapIterType(xt), true)
913 n.Key = o.exprInPlace(n.Key)
914 n.Value = o.exprInPlace(n.Value)
916 orderBlock(&n.Body, o.free)
918 o.out = append(o.out, n)
922 n := n.(*ir.ReturnStmt)
923 o.exprList(n.Results)
924 o.out = append(o.out, n)
926 // Special: clean case temporaries in each block entry.
927 // Select must enter one of its blocks, so there is no
928 // need for a cleaning at the end.
929 // Doubly special: evaluation order for select is stricter
930 // than ordinary expressions. Even something like p.c
931 // has to be hoisted into a temporary, so that it cannot be
932 // reordered after the channel evaluation for a different
933 // case (if p were nil, then the timing of the fault would
936 n := n.(*ir.SelectStmt)
938 for _, ncas := range n.Cases {
942 // Append any new body prologue to ninit.
943 // The next loop will insert ninit into nbody.
944 if len(ncas.Init()) != 0 {
945 base.Fatalf("order select ninit")
952 ir.Dump("select case", r)
953 base.Fatalf("unknown op in select %v", r.Op())
957 r := r.(*ir.AssignListStmt)
958 recv := r.Rhs[0].(*ir.UnaryExpr)
959 recv.X = o.expr(recv.X, nil)
960 if !ir.IsAutoTmp(recv.X) {
961 recv.X = o.copyExpr(recv.X)
963 init := ir.TakeInit(r)
966 do := func(i int, t *types.Type) {
971 // If this is case x := <-ch or case x, y := <-ch, the case has
972 // the ODCL nodes to declare x and y. We want to delay that
973 // declaration (and possible allocation) until inside the case body.
974 // Delete the ODCL nodes here and recreate them inside the body below.
976 if len(init) > 0 && init[0].Op() == ir.ODCL && init[0].(*ir.Decl).X == n {
979 // iimport may have added a default initialization assignment,
980 // due to how it handles ODCL statements.
981 if len(init) > 0 && init[0].Op() == ir.OAS && init[0].(*ir.AssignStmt).X == n {
985 dcl := typecheck.Stmt(ir.NewDecl(base.Pos, ir.ODCL, n.(*ir.Name)))
986 ncas.PtrInit().Append(dcl)
988 tmp := o.newTemp(t, t.HasPointers())
989 as := typecheck.Stmt(ir.NewAssignStmt(base.Pos, n, typecheck.Conv(tmp, n.Type())))
990 ncas.PtrInit().Append(as)
993 do(0, recv.X.Type().Elem())
994 do(1, types.Types[types.TBOOL])
996 ir.DumpList("ninit", init)
997 base.Fatalf("ninit on select recv")
999 orderBlock(ncas.PtrInit(), o.free)
1002 r := r.(*ir.SendStmt)
1003 if len(r.Init()) != 0 {
1004 ir.DumpList("ninit", r.Init())
1005 base.Fatalf("ninit on select send")
1009 // r->left is c, r->right is x, both are always evaluated.
1010 r.Chan = o.expr(r.Chan, nil)
1012 if !ir.IsAutoTmp(r.Chan) {
1013 r.Chan = o.copyExpr(r.Chan)
1015 r.Value = o.expr(r.Value, nil)
1016 if !ir.IsAutoTmp(r.Value) {
1017 r.Value = o.copyExpr(r.Value)
1021 // Now that we have accumulated all the temporaries, clean them.
1022 // Also insert any ninit queued during the previous loop.
1023 // (The temporary cleaning must follow that ninit work.)
1024 for _, cas := range n.Cases {
1025 orderBlock(&cas.Body, o.free)
1026 cas.Body.Prepend(o.cleanTempNoPop(t)...)
1028 // TODO(mdempsky): Is this actually necessary?
1029 // walkSelect appears to walk Ninit.
1030 cas.Body.Prepend(ir.TakeInit(cas)...)
1033 o.out = append(o.out, n)
1036 // Special: value being sent is passed as a pointer; make it addressable.
1038 n := n.(*ir.SendStmt)
1040 n.Chan = o.expr(n.Chan, nil)
1041 n.Value = o.expr(n.Value, nil)
1042 if base.Flag.Cfg.Instrumenting {
1043 // Force copying to the stack so that (chan T)(nil) <- x
1044 // is still instrumented as a read of x.
1045 n.Value = o.copyExpr(n.Value)
1047 n.Value = o.addrTemp(n.Value)
1049 o.out = append(o.out, n)
1052 // TODO(rsc): Clean temporaries more aggressively.
1053 // Note that because walkSwitch will rewrite some of the
1054 // switch into a binary search, this is not as easy as it looks.
1055 // (If we ran that code here we could invoke order.stmt on
1056 // the if-else chain instead.)
1057 // For now just clean all the temporaries at the end.
1058 // In practice that's fine.
1060 n := n.(*ir.SwitchStmt)
1061 if base.Debug.Libfuzzer != 0 && !hasDefaultCase(n) {
1062 // Add empty "default:" case for instrumentation.
1063 n.Cases = append(n.Cases, ir.NewCaseStmt(base.Pos, nil, nil))
1067 n.Tag = o.expr(n.Tag, nil)
1068 for _, ncas := range n.Cases {
1069 o.exprListInPlace(ncas.List)
1070 orderBlock(&ncas.Body, o.free)
1073 o.out = append(o.out, n)
1080 func hasDefaultCase(n *ir.SwitchStmt) bool {
1081 for _, ncas := range n.Cases {
1082 if len(ncas.List) == 0 {
1089 // exprList orders the expression list l into o.
1090 func (o *orderState) exprList(l ir.Nodes) {
1093 s[i] = o.expr(s[i], nil)
1097 // exprListInPlace orders the expression list l but saves
1098 // the side effects on the individual expression ninit lists.
1099 func (o *orderState) exprListInPlace(l ir.Nodes) {
1102 s[i] = o.exprInPlace(s[i])
1106 func (o *orderState) exprNoLHS(n ir.Node) ir.Node {
1107 return o.expr(n, nil)
1110 // expr orders a single expression, appending side
1111 // effects to o.out as needed.
1112 // If this is part of an assignment lhs = *np, lhs is given.
1113 // Otherwise lhs == nil. (When lhs != nil it may be possible
1114 // to avoid copying the result of the expression to a temporary.)
1115 // The result of expr MUST be assigned back to n, e.g.
1117 // n.Left = o.expr(n.Left, lhs)
1118 func (o *orderState) expr(n, lhs ir.Node) ir.Node {
1128 func (o *orderState) expr1(n, lhs ir.Node) ir.Node {
1134 o.edit = o.exprNoLHS // create closure once
1136 ir.EditChildren(n, o.edit)
1139 // Addition of strings turns into a function call.
1140 // Allocate a temporary to hold the strings.
1141 // Fewer than 5 strings use direct runtime helpers.
1143 n := n.(*ir.AddStringExpr)
1146 if len(n.List) > 5 {
1147 t := types.NewArray(types.Types[types.TSTRING], int64(len(n.List)))
1148 n.Prealloc = o.newTemp(t, false)
1151 // Mark string(byteSlice) arguments to reuse byteSlice backing
1152 // buffer during conversion. String concatenation does not
1153 // memorize the strings for later use, so it is safe.
1154 // However, we can do it only if there is at least one non-empty string literal.
1155 // Otherwise if all other arguments are empty strings,
1156 // concatstrings will return the reference to the temp string
1161 for _, n1 := range n.List {
1162 hasbyte = hasbyte || n1.Op() == ir.OBYTES2STR
1163 haslit = haslit || n1.Op() == ir.OLITERAL && len(ir.StringVal(n1)) != 0
1166 if haslit && hasbyte {
1167 for _, n2 := range n.List {
1168 if n2.Op() == ir.OBYTES2STR {
1169 n2 := n2.(*ir.ConvExpr)
1170 n2.SetOp(ir.OBYTES2STRTMP)
1177 n := n.(*ir.IndexExpr)
1178 n.X = o.expr(n.X, nil)
1179 n.Index = o.expr(n.Index, nil)
1183 // Enforce that any []byte slices we are not copying
1184 // can not be changed before the map index by forcing
1185 // the map index to happen immediately following the
1186 // conversions. See copyExpr a few lines below.
1187 needCopy = mapKeyReplaceStrConv(n.Index)
1189 if base.Flag.Cfg.Instrumenting {
1190 // Race detector needs the copy.
1195 // key must be addressable
1196 n.Index = o.mapKeyTemp(n.X.Type(), n.Index)
1198 return o.copyExpr(n)
1202 // concrete type (not interface) argument might need an addressable
1203 // temporary to pass to the runtime conversion routine.
1204 case ir.OCONVIFACE, ir.OCONVIDATA:
1205 n := n.(*ir.ConvExpr)
1206 n.X = o.expr(n.X, nil)
1207 if n.X.Type().IsInterface() {
1210 if _, _, needsaddr := dataWordFuncName(n.X.Type()); needsaddr || isStaticCompositeLiteral(n.X) {
1211 // Need a temp if we need to pass the address to the conversion function.
1212 // We also process static composite literal node here, making a named static global
1213 // whose address we can put directly in an interface (see OCONVIFACE/OCONVIDATA case in walk).
1214 n.X = o.addrTemp(n.X)
1219 n := n.(*ir.ConvExpr)
1220 if n.X.Op() == ir.OCALLMETH {
1221 base.FatalfAt(n.X.Pos(), "OCALLMETH missed by typecheck")
1223 if n.Type().IsKind(types.TUNSAFEPTR) && n.X.Type().IsKind(types.TUINTPTR) && (n.X.Op() == ir.OCALLFUNC || n.X.Op() == ir.OCALLINTER) {
1224 call := n.X.(*ir.CallExpr)
1225 // When reordering unsafe.Pointer(f()) into a separate
1226 // statement, the conversion and function call must stay
1227 // together. See golang.org/issue/15329.
1230 if lhs == nil || lhs.Op() != ir.ONAME || base.Flag.Cfg.Instrumenting {
1231 return o.copyExpr(n)
1234 n.X = o.expr(n.X, nil)
1238 case ir.OANDAND, ir.OOROR:
1243 // if r { // or !r, for OROR
1248 n := n.(*ir.LogicalExpr)
1249 r := o.newTemp(n.Type(), false)
1251 // Evaluate left-hand side.
1252 lhs := o.expr(n.X, nil)
1253 o.out = append(o.out, typecheck.Stmt(ir.NewAssignStmt(base.Pos, r, lhs)))
1255 // Evaluate right-hand side, save generated code.
1260 rhs := o.expr(n.Y, nil)
1261 o.out = append(o.out, typecheck.Stmt(ir.NewAssignStmt(base.Pos, r, rhs)))
1266 // If left-hand side doesn't cause a short-circuit, issue right-hand side.
1267 nif := ir.NewIfStmt(base.Pos, r, nil, nil)
1268 if n.Op() == ir.OANDAND {
1273 o.out = append(o.out, nif)
1277 base.FatalfAt(n.Pos(), "OCALLMETH missed by typecheck")
1278 panic("unreachable")
1299 // len([]rune(s)) is rewritten to runtime.countrunes(s) later.
1300 conv := n.(*ir.UnaryExpr).X.(*ir.ConvExpr)
1301 conv.X = o.expr(conv.X, nil)
1306 if lhs == nil || lhs.Op() != ir.ONAME || base.Flag.Cfg.Instrumenting {
1307 return o.copyExpr(n)
1312 n := n.(*ir.InlinedCallExpr)
1314 return n.SingleResult()
1317 // Check for append(x, make([]T, y)...) .
1318 n := n.(*ir.CallExpr)
1319 if isAppendOfMake(n) {
1320 n.Args[0] = o.expr(n.Args[0], nil) // order x
1321 mk := n.Args[1].(*ir.MakeExpr)
1322 mk.Len = o.expr(mk.Len, nil) // order y
1327 if lhs == nil || lhs.Op() != ir.ONAME && !ir.SameSafeExpr(lhs, n.Args[0]) {
1328 return o.copyExpr(n)
1332 case ir.OSLICE, ir.OSLICEARR, ir.OSLICESTR, ir.OSLICE3, ir.OSLICE3ARR:
1333 n := n.(*ir.SliceExpr)
1334 n.X = o.expr(n.X, nil)
1335 n.Low = o.cheapExpr(o.expr(n.Low, nil))
1336 n.High = o.cheapExpr(o.expr(n.High, nil))
1337 n.Max = o.cheapExpr(o.expr(n.Max, nil))
1338 if lhs == nil || lhs.Op() != ir.ONAME && !ir.SameSafeExpr(lhs, n.X) {
1339 return o.copyExpr(n)
1344 n := n.(*ir.ClosureExpr)
1345 if n.Transient() && len(n.Func.ClosureVars) > 0 {
1346 n.Prealloc = o.newTemp(typecheck.ClosureType(n), false)
1351 n := n.(*ir.SelectorExpr)
1352 n.X = o.expr(n.X, nil)
1354 t := typecheck.MethodValueType(n)
1355 n.Prealloc = o.newTemp(t, false)
1360 n := n.(*ir.CompLitExpr)
1363 t := types.NewArray(n.Type().Elem(), n.Len)
1364 n.Prealloc = o.newTemp(t, false)
1368 case ir.ODOTTYPE, ir.ODOTTYPE2:
1369 n := n.(*ir.TypeAssertExpr)
1370 n.X = o.expr(n.X, nil)
1371 if !types.IsDirectIface(n.Type()) || base.Flag.Cfg.Instrumenting {
1372 return o.copyExprClear(n)
1377 n := n.(*ir.UnaryExpr)
1378 n.X = o.expr(n.X, nil)
1379 return o.copyExprClear(n)
1381 case ir.OEQ, ir.ONE, ir.OLT, ir.OLE, ir.OGT, ir.OGE:
1382 n := n.(*ir.BinaryExpr)
1383 n.X = o.expr(n.X, nil)
1384 n.Y = o.expr(n.Y, nil)
1389 // Mark string(byteSlice) arguments to reuse byteSlice backing
1390 // buffer during conversion. String comparison does not
1391 // memorize the strings for later use, so it is safe.
1392 if n.X.Op() == ir.OBYTES2STR {
1393 n.X.(*ir.ConvExpr).SetOp(ir.OBYTES2STRTMP)
1395 if n.Y.Op() == ir.OBYTES2STR {
1396 n.Y.(*ir.ConvExpr).SetOp(ir.OBYTES2STRTMP)
1399 case t.IsStruct() || t.IsArray():
1400 // for complex comparisons, we need both args to be
1401 // addressable so we can pass them to the runtime.
1402 n.X = o.addrTemp(n.X)
1403 n.Y = o.addrTemp(n.Y)
1408 // Order map by converting:
1415 // m := map[int]int{}
1419 // Then order the result.
1420 // Without this special case, order would otherwise compute all
1421 // the keys and values before storing any of them to the map.
1423 n := n.(*ir.CompLitExpr)
1425 statics := entries[:0]
1426 var dynamics []*ir.KeyExpr
1427 for _, r := range entries {
1428 r := r.(*ir.KeyExpr)
1430 if !isStaticCompositeLiteral(r.Key) || !isStaticCompositeLiteral(r.Value) {
1431 dynamics = append(dynamics, r)
1435 // Recursively ordering some static entries can change them to dynamic;
1436 // e.g., OCONVIFACE nodes. See #31777.
1437 r = o.expr(r, nil).(*ir.KeyExpr)
1438 if !isStaticCompositeLiteral(r.Key) || !isStaticCompositeLiteral(r.Value) {
1439 dynamics = append(dynamics, r)
1443 statics = append(statics, r)
1447 if len(dynamics) == 0 {
1451 // Emit the creation of the map (with all its static entries).
1452 m := o.newTemp(n.Type(), false)
1453 as := ir.NewAssignStmt(base.Pos, m, n)
1457 // Emit eval+insert of dynamic entries, one at a time.
1458 for _, r := range dynamics {
1459 lhs := typecheck.AssignExpr(ir.NewIndexExpr(base.Pos, m, r.Key)).(*ir.IndexExpr)
1460 base.AssertfAt(lhs.Op() == ir.OINDEXMAP, lhs.Pos(), "want OINDEXMAP, have %+v", lhs)
1463 as := ir.NewAssignStmt(base.Pos, lhs, r.Value)
1468 // Remember that we issued these assignments so we can include that count
1469 // in the map alloc hint.
1470 // We're assuming here that all the keys in the map literal are distinct.
1471 // If any are equal, this will be an overcount. Probably not worth accounting
1472 // for that, as equal keys in map literals are rare, and at worst we waste
1474 n.Len += int64(len(dynamics))
1479 // No return - type-assertions above. Each case must return for itself.
1482 // as2func orders OAS2FUNC nodes. It creates temporaries to ensure left-to-right assignment.
1483 // The caller should order the right-hand side of the assignment before calling order.as2func.
1490 // tmp1, tmp2, tmp3 = ...
1491 // a, b, a = tmp1, tmp2, tmp3
1493 // This is necessary to ensure left to right assignment order.
1494 func (o *orderState) as2func(n *ir.AssignListStmt) {
1495 results := n.Rhs[0].Type()
1496 as := ir.NewAssignListStmt(n.Pos(), ir.OAS2, nil, nil)
1497 for i, nl := range n.Lhs {
1498 if !ir.IsBlank(nl) {
1499 typ := results.Field(i).Type
1500 tmp := o.newTemp(typ, typ.HasPointers())
1502 as.Lhs = append(as.Lhs, nl)
1503 as.Rhs = append(as.Rhs, tmp)
1507 o.out = append(o.out, n)
1508 o.stmt(typecheck.Stmt(as))
1511 // as2ok orders OAS2XXX with ok.
1512 // Just like as2func, this also adds temporaries to ensure left-to-right assignment.
1513 func (o *orderState) as2ok(n *ir.AssignListStmt) {
1514 as := ir.NewAssignListStmt(n.Pos(), ir.OAS2, nil, nil)
1516 do := func(i int, typ *types.Type) {
1517 if nl := n.Lhs[i]; !ir.IsBlank(nl) {
1518 var tmp ir.Node = o.newTemp(typ, typ.HasPointers())
1520 as.Lhs = append(as.Lhs, nl)
1522 // The "ok" result is an untyped boolean according to the Go
1523 // spec. We need to explicitly convert it to the LHS type in
1524 // case the latter is a defined boolean type (#8475).
1525 tmp = typecheck.Conv(tmp, nl.Type())
1527 as.Rhs = append(as.Rhs, tmp)
1531 do(0, n.Rhs[0].Type())
1532 do(1, types.Types[types.TBOOL])
1534 o.out = append(o.out, n)
1535 o.stmt(typecheck.Stmt(as))
1538 // isFuncPCIntrinsic returns whether n is a direct call of internal/abi.FuncPCABIxxx functions.
1539 func isFuncPCIntrinsic(n *ir.CallExpr) bool {
1540 if n.Op() != ir.OCALLFUNC || n.X.Op() != ir.ONAME {
1543 fn := n.X.(*ir.Name).Sym()
1544 return (fn.Name == "FuncPCABI0" || fn.Name == "FuncPCABIInternal") &&
1545 (fn.Pkg.Path == "internal/abi" || fn.Pkg == types.LocalPkg && base.Ctxt.Pkgpath == "internal/abi")
1548 // isIfaceOfFunc returns whether n is an interface conversion from a direct reference of a func.
1549 func isIfaceOfFunc(n ir.Node) bool {
1550 return n.Op() == ir.OCONVIFACE && n.(*ir.ConvExpr).X.Op() == ir.ONAME && n.(*ir.ConvExpr).X.(*ir.Name).Class == ir.PFUNC