1 // Copyright 2011 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.
5 // The inlining facility makes 2 passes: first CanInline determines which
6 // functions are suitable for inlining, and for those that are it
7 // saves a copy of the body. Then InlineCalls walks each function body to
8 // expand calls to inlinable functions.
10 // The Debug.l flag controls the aggressiveness. Note that main() swaps level 0 and 1,
11 // making 1 the default and -l disable. Additional levels (beyond -l) may be buggy and
14 // 1: 80-nodes leaf functions, oneliners, panic, lazy typechecking (default)
17 // 4: allow non-leaf functions
19 // At some point this may get another default and become switch-offable with -N.
21 // The -d typcheckinl flag enables early typechecking of all imported bodies,
22 // which is useful to flush out bugs.
24 // The Debug.m flag enables diagnostic output. a single -m is useful for verifying
25 // which calls get inlined or not, more is for debugging, and may go away at any point.
35 "cmd/compile/internal/base"
36 "cmd/compile/internal/inline/inlheur"
37 "cmd/compile/internal/ir"
38 "cmd/compile/internal/logopt"
39 "cmd/compile/internal/pgo"
40 "cmd/compile/internal/typecheck"
41 "cmd/compile/internal/types"
45 // Inlining budget parameters, gathered in one place
48 inlineExtraAppendCost = 0
49 // default is to inline if there's at most one call. -l=4 overrides this by using 1 instead.
50 inlineExtraCallCost = 57 // 57 was benchmarked to provided most benefit with no bad surprises; see https://github.com/golang/go/issues/19348#issuecomment-439370742
51 inlineExtraPanicCost = 1 // do not penalize inlining panics.
52 inlineExtraThrowCost = inlineMaxBudget // with current (2018-05/1.11) code, inlining runtime.throw does not help.
54 inlineBigFunctionNodes = 5000 // Functions with this many nodes are considered "big".
55 inlineBigFunctionMaxCost = 20 // Max cost of inlinee when inlining into a "big" function.
59 // List of all hot callee nodes.
60 // TODO(prattmic): Make this non-global.
61 candHotCalleeMap = make(map[*pgo.IRNode]struct{})
63 // List of all hot call sites. CallSiteInfo.Callee is always nil.
64 // TODO(prattmic): Make this non-global.
65 candHotEdgeMap = make(map[pgo.CallSiteInfo]struct{})
67 // Threshold in percentage for hot callsite inlining.
68 inlineHotCallSiteThresholdPercent float64
70 // Threshold in CDF percentage for hot callsite inlining,
71 // that is, for a threshold of X the hottest callsites that
72 // make up the top X% of total edge weight will be
73 // considered hot for inlining candidates.
74 inlineCDFHotCallSiteThresholdPercent = float64(99)
76 // Budget increased due to hotness.
77 inlineHotMaxBudget int32 = 2000
80 // pgoInlinePrologue records the hot callsites from ir-graph.
81 func pgoInlinePrologue(p *pgo.Profile, funcs []*ir.Func) {
82 if base.Debug.PGOInlineCDFThreshold != "" {
83 if s, err := strconv.ParseFloat(base.Debug.PGOInlineCDFThreshold, 64); err == nil && s >= 0 && s <= 100 {
84 inlineCDFHotCallSiteThresholdPercent = s
86 base.Fatalf("invalid PGOInlineCDFThreshold, must be between 0 and 100")
89 var hotCallsites []pgo.NodeMapKey
90 inlineHotCallSiteThresholdPercent, hotCallsites = hotNodesFromCDF(p)
91 if base.Debug.PGODebug > 0 {
92 fmt.Printf("hot-callsite-thres-from-CDF=%v\n", inlineHotCallSiteThresholdPercent)
95 if x := base.Debug.PGOInlineBudget; x != 0 {
96 inlineHotMaxBudget = int32(x)
99 for _, n := range hotCallsites {
100 // mark inlineable callees from hot edges
101 if callee := p.WeightedCG.IRNodes[n.CalleeName]; callee != nil {
102 candHotCalleeMap[callee] = struct{}{}
104 // mark hot call sites
105 if caller := p.WeightedCG.IRNodes[n.CallerName]; caller != nil && caller.AST != nil {
106 csi := pgo.CallSiteInfo{LineOffset: n.CallSiteOffset, Caller: caller.AST}
107 candHotEdgeMap[csi] = struct{}{}
111 if base.Debug.PGODebug >= 3 {
112 fmt.Printf("hot-cg before inline in dot format:")
113 p.PrintWeightedCallGraphDOT(inlineHotCallSiteThresholdPercent)
117 // hotNodesFromCDF computes an edge weight threshold and the list of hot
118 // nodes that make up the given percentage of the CDF. The threshold, as
119 // a percent, is the lower bound of weight for nodes to be considered hot
120 // (currently only used in debug prints) (in case of equal weights,
121 // comparing with the threshold may not accurately reflect which nodes are
123 func hotNodesFromCDF(p *pgo.Profile) (float64, []pgo.NodeMapKey) {
124 nodes := make([]pgo.NodeMapKey, len(p.NodeMap))
126 for n := range p.NodeMap {
130 sort.Slice(nodes, func(i, j int) bool {
131 ni, nj := nodes[i], nodes[j]
132 if wi, wj := p.NodeMap[ni].EWeight, p.NodeMap[nj].EWeight; wi != wj {
133 return wi > wj // want larger weight first
135 // same weight, order by name/line number
136 if ni.CallerName != nj.CallerName {
137 return ni.CallerName < nj.CallerName
139 if ni.CalleeName != nj.CalleeName {
140 return ni.CalleeName < nj.CalleeName
142 return ni.CallSiteOffset < nj.CallSiteOffset
145 for i, n := range nodes {
146 w := p.NodeMap[n].EWeight
148 if pgo.WeightInPercentage(cum, p.TotalEdgeWeight) > inlineCDFHotCallSiteThresholdPercent {
149 // nodes[:i+1] to include the very last node that makes it to go over the threshold.
150 // (Say, if the CDF threshold is 50% and one hot node takes 60% of weight, we want to
151 // include that node instead of excluding it.)
152 return pgo.WeightInPercentage(w, p.TotalEdgeWeight), nodes[:i+1]
158 // InlinePackage finds functions that can be inlined and clones them before walk expands them.
159 func InlinePackage(p *pgo.Profile) {
160 if base.Debug.PGOInline == 0 {
164 InlineDecls(p, typecheck.Target.Funcs, true)
166 // Perform a garbage collection of hidden closures functions that
167 // are no longer reachable from top-level functions following
168 // inlining. See #59404 and #59638 for more context.
169 garbageCollectUnreferencedHiddenClosures()
171 if base.Debug.DumpInlFuncProps != "" {
172 inlheur.DumpFuncProps(nil, base.Debug.DumpInlFuncProps)
176 // InlineDecls applies inlining to the given batch of declarations.
177 func InlineDecls(p *pgo.Profile, funcs []*ir.Func, doInline bool) {
179 pgoInlinePrologue(p, funcs)
182 doCanInline := func(n *ir.Func, recursive bool, numfns int) {
183 if !recursive || numfns > 1 {
184 // We allow inlining if there is no
185 // recursion, or the recursion cycle is
186 // across more than one function.
189 if base.Flag.LowerM > 1 && n.OClosure == nil {
190 fmt.Printf("%v: cannot inline %v: recursive\n", ir.Line(n), n.Nname)
195 ir.VisitFuncsBottomUp(funcs, func(list []*ir.Func, recursive bool) {
196 numfns := numNonClosures(list)
197 // We visit functions within an SCC in fairly arbitrary order,
198 // so by computing inlinability for all functions in the SCC
199 // before performing any inlining, the results are less
200 // sensitive to the order within the SCC (see #58905 for an
203 // First compute inlinability for all functions in the SCC ...
204 for _, n := range list {
205 doCanInline(n, recursive, numfns)
207 // ... then make a second pass to do inlining of calls.
209 for _, n := range list {
216 // garbageCollectUnreferencedHiddenClosures makes a pass over all the
217 // top-level (non-hidden-closure) functions looking for nested closure
218 // functions that are reachable, then sweeps through the Target.Decls
219 // list and marks any non-reachable hidden closure function as dead.
220 // See issues #59404 and #59638 for more context.
221 func garbageCollectUnreferencedHiddenClosures() {
223 liveFuncs := make(map[*ir.Func]bool)
225 var markLiveFuncs func(fn *ir.Func)
226 markLiveFuncs = func(fn *ir.Func) {
231 ir.Visit(fn, func(n ir.Node) {
232 if clo, ok := n.(*ir.ClosureExpr); ok {
233 markLiveFuncs(clo.Func)
238 for i := 0; i < len(typecheck.Target.Funcs); i++ {
239 fn := typecheck.Target.Funcs[i]
240 if fn.IsHiddenClosure() {
246 for i := 0; i < len(typecheck.Target.Funcs); i++ {
247 fn := typecheck.Target.Funcs[i]
248 if !fn.IsHiddenClosure() {
251 if fn.IsDeadcodeClosure() {
257 fn.SetIsDeadcodeClosure(true)
258 if base.Flag.LowerM > 2 {
259 fmt.Printf("%v: unreferenced closure %v marked as dead\n", ir.Line(fn), fn)
261 if fn.Inl != nil && fn.LSym == nil {
262 ir.InitLSym(fn, true)
267 // inlineBudget determines the max budget for function 'fn' prior to
268 // analyzing the hairyness of the body of 'fn'. We pass in the pgo
269 // profile if available, which can change the budget. If 'verbose' is
270 // set, then print a remark where we boost the budget due to PGO.
271 func inlineBudget(fn *ir.Func, profile *pgo.Profile, verbose bool) int32 {
272 // Update the budget for profile-guided inlining.
273 budget := int32(inlineMaxBudget)
275 if n, ok := profile.WeightedCG.IRNodes[ir.LinkFuncName(fn)]; ok {
276 if _, ok := candHotCalleeMap[n]; ok {
277 budget = int32(inlineHotMaxBudget)
279 fmt.Printf("hot-node enabled increased budget=%v for func=%v\n", budget, ir.PkgFuncName(fn))
287 // CanInline determines whether fn is inlineable.
288 // If so, CanInline saves copies of fn.Body and fn.Dcl in fn.Inl.
289 // fn and fn.Body will already have been typechecked.
290 func CanInline(fn *ir.Func, profile *pgo.Profile) {
292 base.Fatalf("CanInline no nname %+v", fn)
295 if base.Debug.DumpInlFuncProps != "" {
296 defer inlheur.DumpFuncProps(fn, base.Debug.DumpInlFuncProps)
299 var reason string // reason, if any, that the function was not inlined
300 if base.Flag.LowerM > 1 || logopt.Enabled() {
303 if base.Flag.LowerM > 1 {
304 fmt.Printf("%v: cannot inline %v: %s\n", ir.Line(fn), fn.Nname, reason)
306 if logopt.Enabled() {
307 logopt.LogOpt(fn.Pos(), "cannotInlineFunction", "inline", ir.FuncName(fn), reason)
313 reason = InlineImpossible(fn)
317 if fn.Typecheck() == 0 {
318 base.Fatalf("CanInline on non-typechecked function %v", fn)
322 if n.Func.InlinabilityChecked() {
325 defer n.Func.SetInlinabilityChecked(true)
327 cc := int32(inlineExtraCallCost)
328 if base.Flag.LowerL == 4 {
329 cc = 1 // this appears to yield better performance than 0.
332 // Compute the inline budget for this function.
333 budget := inlineBudget(fn, profile, base.Debug.PGODebug > 0)
335 // At this point in the game the function we're looking at may
336 // have "stale" autos, vars that still appear in the Dcl list, but
337 // which no longer have any uses in the function body (due to
338 // elimination by deadcode). We'd like to exclude these dead vars
339 // when creating the "Inline.Dcl" field below; to accomplish this,
340 // the hairyVisitor below builds up a map of used/referenced
341 // locals, and we use this map to produce a pruned Inline.Dcl
342 // list. See issue 25459 for more context.
344 visitor := hairyVisitor{
351 if visitor.tooHairy(fn) {
352 reason = visitor.reason
356 n.Func.Inl = &ir.Inline{
357 Cost: budget - visitor.budget,
358 Dcl: pruneUnusedAutos(n.Func.Dcl, &visitor),
361 CanDelayResults: canDelayResults(fn),
364 if base.Flag.LowerM > 1 {
365 fmt.Printf("%v: can inline %v with cost %d as: %v { %v }\n", ir.Line(fn), n, budget-visitor.budget, fn.Type(), ir.Nodes(fn.Body))
366 } else if base.Flag.LowerM != 0 {
367 fmt.Printf("%v: can inline %v\n", ir.Line(fn), n)
369 if logopt.Enabled() {
370 logopt.LogOpt(fn.Pos(), "canInlineFunction", "inline", ir.FuncName(fn), fmt.Sprintf("cost: %d", budget-visitor.budget))
374 // InlineImpossible returns a non-empty reason string if fn is impossible to
375 // inline regardless of cost or contents.
376 func InlineImpossible(fn *ir.Func) string {
377 var reason string // reason, if any, that the function can not be inlined.
383 // If marked "go:noinline", don't inline.
384 if fn.Pragma&ir.Noinline != 0 {
385 reason = "marked go:noinline"
389 // If marked "go:norace" and -race compilation, don't inline.
390 if base.Flag.Race && fn.Pragma&ir.Norace != 0 {
391 reason = "marked go:norace with -race compilation"
395 // If marked "go:nocheckptr" and -d checkptr compilation, don't inline.
396 if base.Debug.Checkptr != 0 && fn.Pragma&ir.NoCheckPtr != 0 {
397 reason = "marked go:nocheckptr"
401 // If marked "go:cgo_unsafe_args", don't inline, since the function
402 // makes assumptions about its argument frame layout.
403 if fn.Pragma&ir.CgoUnsafeArgs != 0 {
404 reason = "marked go:cgo_unsafe_args"
408 // If marked as "go:uintptrkeepalive", don't inline, since the keep
409 // alive information is lost during inlining.
411 // TODO(prattmic): This is handled on calls during escape analysis,
412 // which is after inlining. Move prior to inlining so the keep-alive is
413 // maintained after inlining.
414 if fn.Pragma&ir.UintptrKeepAlive != 0 {
415 reason = "marked as having a keep-alive uintptr argument"
419 // If marked as "go:uintptrescapes", don't inline, since the escape
420 // information is lost during inlining.
421 if fn.Pragma&ir.UintptrEscapes != 0 {
422 reason = "marked as having an escaping uintptr argument"
426 // The nowritebarrierrec checker currently works at function
427 // granularity, so inlining yeswritebarrierrec functions can confuse it
428 // (#22342). As a workaround, disallow inlining them for now.
429 if fn.Pragma&ir.Yeswritebarrierrec != 0 {
430 reason = "marked go:yeswritebarrierrec"
434 // If a local function has no fn.Body (is defined outside of Go), cannot inline it.
435 // Imported functions don't have fn.Body but might have inline body in fn.Inl.
436 if len(fn.Body) == 0 && !typecheck.HaveInlineBody(fn) {
437 reason = "no function body"
444 // canDelayResults reports whether inlined calls to fn can delay
445 // declaring the result parameter until the "return" statement.
446 func canDelayResults(fn *ir.Func) bool {
447 // We can delay declaring+initializing result parameters if:
448 // (1) there's exactly one "return" statement in the inlined function;
449 // (2) it's not an empty return statement (#44355); and
450 // (3) the result parameters aren't named.
453 ir.VisitList(fn.Body, func(n ir.Node) {
454 if n, ok := n.(*ir.ReturnStmt); ok {
456 if len(n.Results) == 0 {
457 nreturns++ // empty return statement (case 2)
463 return false // not exactly one return statement (case 1)
466 // temporaries for return values.
467 for _, param := range fn.Type().Results() {
468 if sym := types.OrigSym(param.Sym); sym != nil && !sym.IsBlank() {
469 return false // found a named result parameter (case 3)
476 // hairyVisitor visits a function body to determine its inlining
477 // hairiness and whether or not it can be inlined.
478 type hairyVisitor struct {
479 // This is needed to access the current caller in the doNode function.
485 usedLocals ir.NameSet
486 do func(ir.Node) bool
490 func (v *hairyVisitor) tooHairy(fn *ir.Func) bool {
491 v.do = v.doNode // cache closure
492 if ir.DoChildren(fn, v.do) {
496 v.reason = fmt.Sprintf("function too complex: cost %d exceeds budget %d", v.maxBudget-v.budget, v.maxBudget)
502 // doNode visits n and its children, updates the state in v, and returns true if
503 // n makes the current function too hairy for inlining.
504 func (v *hairyVisitor) doNode(n ir.Node) bool {
510 // Call is okay if inlinable and we have the budget for the body.
512 n := n.(*ir.CallExpr)
513 // Functions that call runtime.getcaller{pc,sp} can not be inlined
514 // because getcaller{pc,sp} expect a pointer to the caller's first argument.
516 // runtime.throw is a "cheap call" like panic in normal code.
518 if n.X.Op() == ir.ONAME {
519 name := n.X.(*ir.Name)
520 if name.Class == ir.PFUNC {
521 switch fn := types.RuntimeSymName(name.Sym()); fn {
522 case "getcallerpc", "getcallersp":
523 v.reason = "call to " + fn
526 v.budget -= inlineExtraThrowCost
529 // Special case for reflect.noescape. It does just type
530 // conversions to appease the escape analysis, and doesn't
532 if types.ReflectSymName(name.Sym()) == "noescape" {
536 // Special case for coverage counter updates; although
537 // these correspond to real operations, we treat them as
538 // zero cost for the moment. This is due to the existence
539 // of tests that are sensitive to inlining-- if the
540 // insertion of coverage instrumentation happens to tip a
541 // given function over the threshold and move it from
542 // "inlinable" to "not-inlinable", this can cause changes
543 // in allocation behavior, which can then result in test
544 // failures (a good example is the TestAllocations in
546 if isAtomicCoverageCounterUpdate(n) {
550 if n.X.Op() == ir.OMETHEXPR {
551 if meth := ir.MethodExprName(n.X); meth != nil {
552 if fn := meth.Func; fn != nil {
554 if types.RuntimeSymName(s) == "heapBits.nextArena" {
555 // Special case: explicitly allow mid-stack inlining of
556 // runtime.heapBits.next even though it calls slow-path
557 // runtime.heapBits.nextArena.
560 // Special case: on architectures that can do unaligned loads,
561 // explicitly mark encoding/binary methods as cheap,
562 // because in practice they are, even though our inlining
563 // budgeting system does not see that. See issue 42958.
564 if base.Ctxt.Arch.CanMergeLoads && s.Pkg.Path == "encoding/binary" {
566 case "littleEndian.Uint64", "littleEndian.Uint32", "littleEndian.Uint16",
567 "bigEndian.Uint64", "bigEndian.Uint32", "bigEndian.Uint16",
568 "littleEndian.PutUint64", "littleEndian.PutUint32", "littleEndian.PutUint16",
569 "bigEndian.PutUint64", "bigEndian.PutUint32", "bigEndian.PutUint16",
570 "littleEndian.AppendUint64", "littleEndian.AppendUint32", "littleEndian.AppendUint16",
571 "bigEndian.AppendUint64", "bigEndian.AppendUint32", "bigEndian.AppendUint16":
579 break // treat like any other node, that is, cost of 1
582 // Determine if the callee edge is for an inlinable hot callee or not.
583 if v.profile != nil && v.curFunc != nil {
584 if fn := inlCallee(v.curFunc, n.X, v.profile); fn != nil && typecheck.HaveInlineBody(fn) {
585 lineOffset := pgo.NodeLineOffset(n, fn)
586 csi := pgo.CallSiteInfo{LineOffset: lineOffset, Caller: v.curFunc}
587 if _, o := candHotEdgeMap[csi]; o {
588 if base.Debug.PGODebug > 0 {
589 fmt.Printf("hot-callsite identified at line=%v for func=%v\n", ir.Line(n), ir.PkgFuncName(v.curFunc))
595 if ir.IsIntrinsicCall(n) {
596 // Treat like any other node.
600 if fn := inlCallee(v.curFunc, n.X, v.profile); fn != nil && typecheck.HaveInlineBody(fn) {
601 v.budget -= fn.Inl.Cost
605 // Call cost for non-leaf inlining.
606 v.budget -= v.extraCallCost
609 base.FatalfAt(n.Pos(), "OCALLMETH missed by typecheck")
611 // Things that are too hairy, irrespective of the budget
612 case ir.OCALL, ir.OCALLINTER:
613 // Call cost for non-leaf inlining.
614 v.budget -= v.extraCallCost
617 n := n.(*ir.UnaryExpr)
618 if n.X.Op() == ir.OCONVIFACE && n.X.(*ir.ConvExpr).Implicit() {
619 // Hack to keep reflect.flag.mustBe inlinable for TestIntendedInlining.
620 // Before CL 284412, these conversions were introduced later in the
621 // compiler, so they didn't count against inlining budget.
624 v.budget -= inlineExtraPanicCost
627 base.FatalfAt(n.Pos(), "ORECOVER missed typecheck")
629 // recover matches the argument frame pointer to find
630 // the right panic value, so it needs an argument frame.
631 v.reason = "call to recover"
635 if base.Debug.InlFuncsWithClosures == 0 {
636 v.reason = "not inlining functions with closures"
640 // TODO(danscales): Maybe make budget proportional to number of closure
642 //v.budget -= int32(len(n.(*ir.ClosureExpr).Func.ClosureVars) * 3)
643 // TODO(austin): However, if we're able to inline this closure into
644 // v.curFunc, then we actually pay nothing for the closure captures. We
645 // should try to account for that if we're going to account for captures.
648 case ir.OGO, ir.ODEFER, ir.OTAILCALL:
649 v.reason = "unhandled op " + n.Op().String()
653 v.budget -= inlineExtraAppendCost
656 n := n.(*ir.AddrExpr)
657 // Make "&s.f" cost 0 when f's offset is zero.
658 if dot, ok := n.X.(*ir.SelectorExpr); ok && (dot.Op() == ir.ODOT || dot.Op() == ir.ODOTPTR) {
659 if _, ok := dot.X.(*ir.Name); ok && dot.Selection.Offset == 0 {
660 v.budget += 2 // undo ir.OADDR+ir.ODOT/ir.ODOTPTR
665 // *(*X)(unsafe.Pointer(&x)) is low-cost
666 n := n.(*ir.StarExpr)
669 for ptr.Op() == ir.OCONVNOP {
670 ptr = ptr.(*ir.ConvExpr).X
672 if ptr.Op() == ir.OADDR {
673 v.budget += 1 // undo half of default cost of ir.ODEREF+ir.OADDR
677 // This doesn't produce code, but the children might.
678 v.budget++ // undo default cost
680 case ir.OFALL, ir.OTYPE:
681 // These nodes don't produce code; omit from inlining budget.
686 if ir.IsConst(n.Cond, constant.Bool) {
687 // This if and the condition cost nothing.
688 if doList(n.Init(), v.do) {
691 if ir.BoolVal(n.Cond) {
692 return doList(n.Body, v.do)
694 return doList(n.Else, v.do)
700 if n.Class == ir.PAUTO {
705 // The only OBLOCK we should see at this point is an empty one.
706 // In any event, let the visitList(n.List()) below take care of the statements,
707 // and don't charge for the OBLOCK itself. The ++ undoes the -- below.
710 case ir.OMETHVALUE, ir.OSLICELIT:
711 v.budget-- // Hack for toolstash -cmp.
714 v.budget++ // Hack for toolstash -cmp.
717 n := n.(*ir.AssignListStmt)
719 // Unified IR unconditionally rewrites:
730 // so that it can insert implicit conversions as necessary. To
731 // minimize impact to the existing inlining heuristics (in
732 // particular, to avoid breaking the existing inlinability regress
733 // tests), we need to compensate for this here.
735 // See also identical logic in isBigFunc.
736 if init := n.Rhs[0].Init(); len(init) == 1 {
737 if _, ok := init[0].(*ir.AssignListStmt); ok {
738 // 4 for each value, because each temporary variable now
739 // appears 3 times (DCL, LHS, RHS), plus an extra DCL node.
741 // 1 for the extra "tmp1, tmp2 = f()" assignment statement.
742 v.budget += 4*int32(len(n.Lhs)) + 1
747 // Special case for coverage counter updates and coverage
748 // function registrations. Although these correspond to real
749 // operations, we treat them as zero cost for the moment. This
750 // is primarily due to the existence of tests that are
751 // sensitive to inlining-- if the insertion of coverage
752 // instrumentation happens to tip a given function over the
753 // threshold and move it from "inlinable" to "not-inlinable",
754 // this can cause changes in allocation behavior, which can
755 // then result in test failures (a good example is the
756 // TestAllocations in crypto/ed25519).
757 n := n.(*ir.AssignStmt)
758 if n.X.Op() == ir.OINDEX && isIndexingCoverageCounter(n.X) {
765 // When debugging, don't stop early, to get full cost of inlining this function
766 if v.budget < 0 && base.Flag.LowerM < 2 && !logopt.Enabled() {
767 v.reason = "too expensive"
771 return ir.DoChildren(n, v.do)
774 func isBigFunc(fn *ir.Func) bool {
775 budget := inlineBigFunctionNodes
776 return ir.Any(fn, func(n ir.Node) bool {
777 // See logic in hairyVisitor.doNode, explaining unified IR's
778 // handling of "a, b = f()" assignments.
779 if n, ok := n.(*ir.AssignListStmt); ok && n.Op() == ir.OAS2 {
780 if init := n.Rhs[0].Init(); len(init) == 1 {
781 if _, ok := init[0].(*ir.AssignListStmt); ok {
782 budget += 4*len(n.Lhs) + 1
792 // InlineCalls/inlnode walks fn's statements and expressions and substitutes any
793 // calls made to inlineable functions. This is the external entry point.
794 func InlineCalls(fn *ir.Func, profile *pgo.Profile) {
797 bigCaller := isBigFunc(fn)
798 if bigCaller && base.Flag.LowerM > 1 {
799 fmt.Printf("%v: function %v considered 'big'; reducing max cost of inlinees\n", ir.Line(fn), fn)
801 var inlCalls []*ir.InlinedCallExpr
802 var edit func(ir.Node) ir.Node
803 edit = func(n ir.Node) ir.Node {
804 return inlnode(fn, n, bigCaller, &inlCalls, edit, profile)
806 ir.EditChildren(fn, edit)
808 // If we inlined any calls, we want to recursively visit their
809 // bodies for further inlining. However, we need to wait until
810 // *after* the original function body has been expanded, or else
811 // inlCallee can have false positives (e.g., #54632).
812 for len(inlCalls) > 0 {
814 inlCalls = inlCalls[1:]
815 ir.EditChildren(call, edit)
821 // inlnode recurses over the tree to find inlineable calls, which will
822 // be turned into OINLCALLs by mkinlcall. When the recursion comes
823 // back up will examine left, right, list, rlist, ninit, ntest, nincr,
824 // nbody and nelse and use one of the 4 inlconv/glue functions above
825 // to turn the OINLCALL into an expression, a statement, or patch it
826 // in to this nodes list or rlist as appropriate.
827 // NOTE it makes no sense to pass the glue functions down the
828 // recursion to the level where the OINLCALL gets created because they
829 // have to edit /this/ n, so you'd have to push that one down as well,
830 // but then you may as well do it here. so this is cleaner and
831 // shorter and less complicated.
832 // The result of inlnode MUST be assigned back to n, e.g.
834 // n.Left = inlnode(n.Left)
835 func inlnode(callerfn *ir.Func, n ir.Node, bigCaller bool, inlCalls *[]*ir.InlinedCallExpr, edit func(ir.Node) ir.Node, profile *pgo.Profile) ir.Node {
841 case ir.ODEFER, ir.OGO:
842 n := n.(*ir.GoDeferStmt)
843 switch call := n.Call; call.Op() {
845 base.FatalfAt(call.Pos(), "OCALLMETH missed by typecheck")
847 call := call.(*ir.CallExpr)
851 n := n.(*ir.TailCallStmt)
852 n.Call.NoInline = true // Not inline a tail call for now. Maybe we could inline it just like RETURN fn(arg)?
854 // TODO do them here (or earlier),
855 // so escape analysis can avoid more heapmoves.
859 base.FatalfAt(n.Pos(), "OCALLMETH missed by typecheck")
861 n := n.(*ir.CallExpr)
862 if n.X.Op() == ir.OMETHEXPR {
863 // Prevent inlining some reflect.Value methods when using checkptr,
864 // even when package reflect was compiled without it (#35073).
865 if meth := ir.MethodExprName(n.X); meth != nil {
867 if base.Debug.Checkptr != 0 {
868 switch types.ReflectSymName(s) {
869 case "Value.UnsafeAddr", "Value.Pointer":
879 ir.EditChildren(n, edit)
881 // with all the branches out of the way, it is now time to
882 // transmogrify this node itself unless inhibited by the
883 // switch at the top of this function.
886 base.FatalfAt(n.Pos(), "OCALLMETH missed by typecheck")
889 call := n.(*ir.CallExpr)
893 if base.Flag.LowerM > 3 {
894 fmt.Printf("%v:call to func %+v\n", ir.Line(n), call.X)
896 if ir.IsIntrinsicCall(call) {
899 if fn := inlCallee(callerfn, call.X, profile); fn != nil && typecheck.HaveInlineBody(fn) {
900 n = mkinlcall(callerfn, call, fn, bigCaller, inlCalls)
909 // inlCallee takes a function-typed expression and returns the underlying function ONAME
910 // that it refers to if statically known. Otherwise, it returns nil.
911 func inlCallee(caller *ir.Func, fn ir.Node, profile *pgo.Profile) (res *ir.Func) {
912 fn = ir.StaticValue(fn)
915 fn := fn.(*ir.SelectorExpr)
916 n := ir.MethodExprName(fn)
917 // Check that receiver type matches fn.X.
918 // TODO(mdempsky): Handle implicit dereference
919 // of pointer receiver argument?
920 if n == nil || !types.Identical(n.Type().Recv().Type, fn.X.Type()) {
926 if fn.Class == ir.PFUNC {
930 fn := fn.(*ir.ClosureExpr)
932 if len(c.ClosureVars) != 0 && c.ClosureVars[0].Outer.Curfn != caller {
933 return nil // inliner doesn't support inlining across closure frames
935 CanInline(c, profile)
943 // SSADumpInline gives the SSA back end a chance to dump the function
944 // when producing output for debugging the compiler itself.
945 var SSADumpInline = func(*ir.Func) {}
947 // InlineCall allows the inliner implementation to be overridden.
948 // If it returns nil, the function will not be inlined.
949 var InlineCall = func(callerfn *ir.Func, call *ir.CallExpr, fn *ir.Func, inlIndex int) *ir.InlinedCallExpr {
950 base.Fatalf("inline.InlineCall not overridden")
954 // inlineCostOK returns true if call n from caller to callee is cheap enough to
955 // inline. bigCaller indicates that caller is a big function.
957 // If inlineCostOK returns false, it also returns the max cost that the callee
959 func inlineCostOK(n *ir.CallExpr, caller, callee *ir.Func, bigCaller bool) (bool, int32) {
960 maxCost := int32(inlineMaxBudget)
962 // We use this to restrict inlining into very big functions.
963 // See issue 26546 and 17566.
964 maxCost = inlineBigFunctionMaxCost
967 if callee.Inl.Cost <= maxCost {
968 // Simple case. Function is already cheap enough.
972 // We'll also allow inlining of hot functions below inlineHotMaxBudget,
973 // but only in small functions.
975 lineOffset := pgo.NodeLineOffset(n, caller)
976 csi := pgo.CallSiteInfo{LineOffset: lineOffset, Caller: caller}
977 if _, ok := candHotEdgeMap[csi]; !ok {
979 return false, maxCost
985 if base.Debug.PGODebug > 0 {
986 fmt.Printf("hot-big check disallows inlining for call %s (cost %d) at %v in big function %s\n", ir.PkgFuncName(callee), callee.Inl.Cost, ir.Line(n), ir.PkgFuncName(caller))
988 return false, maxCost
991 if callee.Inl.Cost > inlineHotMaxBudget {
992 return false, inlineHotMaxBudget
995 if base.Debug.PGODebug > 0 {
996 fmt.Printf("hot-budget check allows inlining for call %s (cost %d) at %v in function %s\n", ir.PkgFuncName(callee), callee.Inl.Cost, ir.Line(n), ir.PkgFuncName(caller))
1002 // If n is a OCALLFUNC node, and fn is an ONAME node for a
1003 // function with an inlinable body, return an OINLCALL node that can replace n.
1004 // The returned node's Ninit has the parameter assignments, the Nbody is the
1005 // inlined function body, and (List, Rlist) contain the (input, output)
1007 // The result of mkinlcall MUST be assigned back to n, e.g.
1009 // n.Left = mkinlcall(n.Left, fn, isddd)
1010 func mkinlcall(callerfn *ir.Func, n *ir.CallExpr, fn *ir.Func, bigCaller bool, inlCalls *[]*ir.InlinedCallExpr) ir.Node {
1012 if logopt.Enabled() {
1013 logopt.LogOpt(n.Pos(), "cannotInlineCall", "inline", ir.FuncName(callerfn),
1014 fmt.Sprintf("%s cannot be inlined", ir.PkgFuncName(fn)))
1019 if ok, maxCost := inlineCostOK(n, callerfn, fn, bigCaller); !ok {
1020 if logopt.Enabled() {
1021 logopt.LogOpt(n.Pos(), "cannotInlineCall", "inline", ir.FuncName(callerfn),
1022 fmt.Sprintf("cost %d of %s exceeds max caller cost %d", fn.Inl.Cost, ir.PkgFuncName(fn), maxCost))
1028 // Can't recursively inline a function into itself.
1029 if logopt.Enabled() {
1030 logopt.LogOpt(n.Pos(), "cannotInlineCall", "inline", fmt.Sprintf("recursive call to %s", ir.FuncName(callerfn)))
1035 if base.Flag.Cfg.Instrumenting && types.IsNoInstrumentPkg(fn.Sym().Pkg) {
1036 // Runtime package must not be instrumented.
1037 // Instrument skips runtime package. However, some runtime code can be
1038 // inlined into other packages and instrumented there. To avoid this,
1039 // we disable inlining of runtime functions when instrumenting.
1040 // The example that we observed is inlining of LockOSThread,
1041 // which lead to false race reports on m contents.
1044 if base.Flag.Race && types.IsNoRacePkg(fn.Sym().Pkg) {
1048 parent := base.Ctxt.PosTable.Pos(n.Pos()).Base().InliningIndex()
1051 // Check if we've already inlined this function at this particular
1052 // call site, in order to stop inlining when we reach the beginning
1053 // of a recursion cycle again. We don't inline immediately recursive
1054 // functions, but allow inlining if there is a recursion cycle of
1055 // many functions. Most likely, the inlining will stop before we
1056 // even hit the beginning of the cycle again, but this catches the
1058 for inlIndex := parent; inlIndex >= 0; inlIndex = base.Ctxt.InlTree.Parent(inlIndex) {
1059 if base.Ctxt.InlTree.InlinedFunction(inlIndex) == sym {
1060 if base.Flag.LowerM > 1 {
1061 fmt.Printf("%v: cannot inline %v into %v: repeated recursive cycle\n", ir.Line(n), fn, ir.FuncName(callerfn))
1067 typecheck.AssertFixedCall(n)
1069 inlIndex := base.Ctxt.InlTree.Add(parent, n.Pos(), sym, ir.FuncName(fn))
1071 closureInitLSym := func(n *ir.CallExpr, fn *ir.Func) {
1072 // The linker needs FuncInfo metadata for all inlined
1073 // functions. This is typically handled by gc.enqueueFunc
1074 // calling ir.InitLSym for all function declarations in
1075 // typecheck.Target.Decls (ir.UseClosure adds all closures to
1078 // However, non-trivial closures in Decls are ignored, and are
1079 // insteaded enqueued when walk of the calling function
1082 // This presents a problem for direct calls to closures.
1083 // Inlining will replace the entire closure definition with its
1084 // body, which hides the closure from walk and thus suppresses
1087 // Explicitly create a symbol early in this edge case to ensure
1088 // we keep this metadata.
1090 // TODO: Refactor to keep a reference so this can all be done
1093 if n.Op() != ir.OCALLFUNC {
1094 // Not a standard call.
1097 if n.X.Op() != ir.OCLOSURE {
1098 // Not a direct closure call.
1102 clo := n.X.(*ir.ClosureExpr)
1103 if ir.IsTrivialClosure(clo) {
1104 // enqueueFunc will handle trivial closures anyways.
1108 ir.InitLSym(fn, true)
1111 closureInitLSym(n, fn)
1113 if base.Flag.GenDwarfInl > 0 {
1114 if !sym.WasInlined() {
1115 base.Ctxt.DwFixups.SetPrecursorFunc(sym, fn)
1116 sym.Set(obj.AttrWasInlined, true)
1120 if base.Flag.LowerM != 0 {
1121 fmt.Printf("%v: inlining call to %v\n", ir.Line(n), fn)
1123 if base.Flag.LowerM > 2 {
1124 fmt.Printf("%v: Before inlining: %+v\n", ir.Line(n), n)
1127 res := InlineCall(callerfn, n, fn, inlIndex)
1130 base.FatalfAt(n.Pos(), "inlining call to %v failed", fn)
1133 if base.Flag.LowerM > 2 {
1134 fmt.Printf("%v: After inlining %+v\n\n", ir.Line(res), res)
1137 *inlCalls = append(*inlCalls, res)
1142 // CalleeEffects appends any side effects from evaluating callee to init.
1143 func CalleeEffects(init *ir.Nodes, callee ir.Node) {
1145 init.Append(ir.TakeInit(callee)...)
1147 switch callee.Op() {
1148 case ir.ONAME, ir.OCLOSURE, ir.OMETHEXPR:
1152 conv := callee.(*ir.ConvExpr)
1156 ic := callee.(*ir.InlinedCallExpr)
1157 init.Append(ic.Body.Take()...)
1158 callee = ic.SingleResult()
1161 base.FatalfAt(callee.Pos(), "unexpected callee expression: %v", callee)
1166 func pruneUnusedAutos(ll []*ir.Name, vis *hairyVisitor) []*ir.Name {
1167 s := make([]*ir.Name, 0, len(ll))
1168 for _, n := range ll {
1169 if n.Class == ir.PAUTO {
1170 if !vis.usedLocals.Has(n) {
1171 // TODO(mdempsky): Simplify code after confident that this
1172 // never happens anymore.
1173 base.FatalfAt(n.Pos(), "unused auto: %v", n)
1182 // numNonClosures returns the number of functions in list which are not closures.
1183 func numNonClosures(list []*ir.Func) int {
1185 for _, fn := range list {
1186 if fn.OClosure == nil {
1193 func doList(list []ir.Node, do func(ir.Node) bool) bool {
1194 for _, x := range list {
1204 // isIndexingCoverageCounter returns true if the specified node 'n' is indexing
1205 // into a coverage counter array.
1206 func isIndexingCoverageCounter(n ir.Node) bool {
1207 if n.Op() != ir.OINDEX {
1210 ixn := n.(*ir.IndexExpr)
1211 if ixn.X.Op() != ir.ONAME || !ixn.X.Type().IsArray() {
1214 nn := ixn.X.(*ir.Name)
1215 return nn.CoverageCounter()
1218 // isAtomicCoverageCounterUpdate examines the specified node to
1219 // determine whether it represents a call to sync/atomic.AddUint32 to
1220 // increment a coverage counter.
1221 func isAtomicCoverageCounterUpdate(cn *ir.CallExpr) bool {
1222 if cn.X.Op() != ir.ONAME {
1225 name := cn.X.(*ir.Name)
1226 if name.Class != ir.PFUNC {
1229 fn := name.Sym().Name
1230 if name.Sym().Pkg.Path != "sync/atomic" ||
1231 (fn != "AddUint32" && fn != "StoreUint32") {
1234 if len(cn.Args) != 2 || cn.Args[0].Op() != ir.OADDR {
1237 adn := cn.Args[0].(*ir.AddrExpr)
1238 v := isIndexingCoverageCounter(adn.X)