cmd/compile: Enable inlining of tail calls

Enable inlining tail calls and do not limit emitting tail calls only to the
non-inlineable methods when generating wrappers. This change produces
additional code size reduction.

 Code size difference measured with this change (tried for x86_64):
    etcd binary:
    .text section size: 10613393 -> 10593841 (0.18%)
    total binary size:  33450787 -> 33424307 (0.07%)

    compile binary:
    .text section size: 10171025 -> 10126545 (0.43%)
    total binary size:  28241012 -> 28192628 (0.17%)

    cockroach binary:
    .text section size:  83947260 -> 83694140  (0.3%)
    total binary size:  263799808 -> 263534160 (0.1%)

Change-Id: I694f83cb838e64bd4c51f05b7b9f2bf0193bb551
Reviewed-on: https://go-review.googlesource.com/c/go/+/650455
LUCI-TryBot-Result: Go LUCI <golang-scoped@luci-project-accounts.iam.gserviceaccount.com>
Reviewed-by: Keith Randall <khr@google.com>
Reviewed-by: David Chase <drchase@google.com>
Reviewed-by: Keith Randall <khr@golang.org>
Auto-Submit: Keith Randall <khr@golang.org>
This commit is contained in:
Alexander Musman 2025-02-17 23:27:38 +03:00 committed by Gopher Robot
parent c18ff21cc8
commit 6c70f2b960
8 changed files with 31 additions and 23 deletions

View File

@ -279,12 +279,7 @@ func (s *inlClosureState) mark(n ir.Node) ir.Node {
ok := match(n) ok := match(n)
// can't wrap TailCall's child into ParenExpr
if t, ok := n.(*ir.TailCallStmt); ok {
ir.EditChildren(t.Call, s.mark)
} else {
ir.EditChildren(n, s.mark) ir.EditChildren(n, s.mark)
}
if ok { if ok {
if p == nil { if p == nil {
@ -322,6 +317,23 @@ func (s *inlClosureState) unparenthesize() {
n = paren.X n = paren.X
} }
ir.EditChildren(n, unparen) ir.EditChildren(n, unparen)
// special case for tail calls: if the tail call was inlined, transform
// the tail call to a return stmt if the inlined function was not void,
// otherwise replace it with the inlined expression followed by a return.
if tail, ok := n.(*ir.TailCallStmt); ok {
if inl, done := tail.Call.(*ir.InlinedCallExpr); done {
if len(inl.ReturnVars) != 0 {
ret := ir.NewReturnStmt(tail.Pos(), []ir.Node{inl})
if len(inl.ReturnVars) > 1 {
typecheck.RewriteMultiValueCall(ret, inl)
}
n = ret
} else {
ret := ir.NewReturnStmt(tail.Pos(), nil)
n = ir.NewBlockStmt(tail.Pos(), []ir.Node{inl, ret})
}
}
}
return n return n
} }
ir.EditChildren(s.fn, unparen) ir.EditChildren(s.fn, unparen)
@ -358,11 +370,9 @@ func (s *inlClosureState) fixpoint() bool {
} }
func match(n ir.Node) bool { func match(n ir.Node) bool {
switch n := n.(type) { switch n.(type) {
case *ir.CallExpr: case *ir.CallExpr:
return true return true
case *ir.TailCallStmt:
n.Call.NoInline = true // can't inline yet
} }
return false return false
} }

View File

@ -2202,13 +2202,13 @@ func (n *TailCallStmt) doChildrenWithHidden(do func(Node) bool) bool {
func (n *TailCallStmt) editChildren(edit func(Node) Node) { func (n *TailCallStmt) editChildren(edit func(Node) Node) {
editNodes(n.init, edit) editNodes(n.init, edit)
if n.Call != nil { if n.Call != nil {
n.Call = edit(n.Call).(*CallExpr) n.Call = edit(n.Call)
} }
} }
func (n *TailCallStmt) editChildrenWithHidden(edit func(Node) Node) { func (n *TailCallStmt) editChildrenWithHidden(edit func(Node) Node) {
editNodes(n.init, edit) editNodes(n.init, edit)
if n.Call != nil { if n.Call != nil {
n.Call = edit(n.Call).(*CallExpr) n.Call = edit(n.Call)
} }
} }

View File

@ -479,7 +479,7 @@ func NewSwitchStmt(pos src.XPos, tag Node, cases []*CaseClause) *SwitchStmt {
// code generation to jump directly to another function entirely. // code generation to jump directly to another function entirely.
type TailCallStmt struct { type TailCallStmt struct {
miniStmt miniStmt
Call *CallExpr // the underlying call Call Node // the underlying call
} }
func NewTailCallStmt(pos src.XPos, call *CallExpr) *TailCallStmt { func NewTailCallStmt(pos src.XPos, call *CallExpr) *TailCallStmt {

View File

@ -3983,12 +3983,11 @@ func addTailCall(pos src.XPos, fn *ir.Func, recv ir.Node, method *types.Field) {
if recv.Type() != nil && recv.Type().IsPtr() && method.Type.Recv().Type.IsPtr() && if recv.Type() != nil && recv.Type().IsPtr() && method.Type.Recv().Type.IsPtr() &&
method.Embedded != 0 && !types.IsInterfaceMethod(method.Type) && method.Embedded != 0 && !types.IsInterfaceMethod(method.Type) &&
!unifiedHaveInlineBody(ir.MethodExprName(dot).Func) &&
!(base.Ctxt.Arch.Name == "ppc64le" && base.Ctxt.Flag_dynlink) { !(base.Ctxt.Arch.Name == "ppc64le" && base.Ctxt.Flag_dynlink) {
if base.Debug.TailCall != 0 { if base.Debug.TailCall != 0 {
base.WarnfAt(fn.Nname.Type().Recv().Type.Elem().Pos(), "tail call emitted for the method %v wrapper", method.Nname) base.WarnfAt(fn.Nname.Type().Recv().Type.Elem().Pos(), "tail call emitted for the method %v wrapper", method.Nname)
} }
// Prefer OTAILCALL to reduce code size (except the case when the called method can be inlined). // Prefer OTAILCALL to reduce code size (the called method can be inlined).
fn.Body.Append(ir.NewTailCallStmt(pos, call)) fn.Body.Append(ir.NewTailCallStmt(pos, call))
return return
} }

View File

@ -1797,7 +1797,7 @@ func (s *state) stmt(n ir.Node) {
case ir.OTAILCALL: case ir.OTAILCALL:
n := n.(*ir.TailCallStmt) n := n.(*ir.TailCallStmt)
s.callResult(n.Call, callTail) s.callResult(n.Call.(*ir.CallExpr), callTail)
call := s.mem() call := s.mem()
b := s.endBlock() b := s.endBlock()
b.Kind = ssa.BlockRetJmp // could use BlockExit. BlockRetJmp is mostly for clarity. b.Kind = ssa.BlockRetJmp // could use BlockExit. BlockRetJmp is mostly for clarity.

View File

@ -137,7 +137,7 @@ assignOK:
if cr > len(rhs) { if cr > len(rhs) {
stmt := stmt.(*ir.AssignListStmt) stmt := stmt.(*ir.AssignListStmt)
stmt.SetOp(ir.OAS2FUNC) stmt.SetOp(ir.OAS2FUNC)
r := rhs[0].(*ir.CallExpr) r := rhs[0]
rtyp := r.Type() rtyp := r.Type()
mismatched := false mismatched := false

View File

@ -139,7 +139,8 @@ func walkStmt(n ir.Node) ir.Node {
n := n.(*ir.TailCallStmt) n := n.(*ir.TailCallStmt)
var init ir.Nodes var init ir.Nodes
n.Call.Fun = walkExpr(n.Call.Fun, &init) call := n.Call.(*ir.CallExpr)
call.Fun = walkExpr(call.Fun, &init)
if len(init) > 0 { if len(init) > 0 {
init.Append(n) init.Append(n)

View File

@ -7,16 +7,14 @@
package p package p
// Test that when generating wrappers for methods, we generate a tail call to the pointer version of // Test that when generating wrappers for methods, we generate a tail call to the pointer version of
// the method, if that method is not inlineable. We use go:noinline here to force the non-inlineability // the method.
// condition.
//go:noinline
func (f *Foo) Get2Vals() [2]int { return [2]int{f.Val, f.Val + 1} } func (f *Foo) Get2Vals() [2]int { return [2]int{f.Val, f.Val + 1} }
func (f *Foo) Get3Vals() [3]int { return [3]int{f.Val, f.Val + 1, f.Val + 2} } func (f *Foo) Get3Vals() (int, int, int) { return f.Val, f.Val + 1, f.Val + 2 }
type Foo struct{ Val int } type Foo struct{ Val int }
type Bar struct { // ERROR "tail call emitted for the method \(\*Foo\).Get2Vals wrapper" type Bar struct { // ERROR "tail call emitted for the method \(\*Foo\).Get2Vals wrapper" "tail call emitted for the method \(\*Foo\).Get3Vals wrapper"
int64 int64
*Foo // needs a method wrapper *Foo // needs a method wrapper
string string