mirror of
https://github.com/golang/go.git
synced 2025-12-08 06:10:04 +00:00
cmd/compile: fix transitive inlining of generic functions
If an imported, non-generic function F transitively calls a generic function G[T], we may need to call CanInline on G[T]. While here, we can also take advantage of the fact that we know G[T] was already seen and compiled in an imported package, so we don't need to call InlineCalls or add it to typecheck.Target.Decls. This saves us from wasting compile time re-creating DUPOK symbols that we know already exist in the imported package's link objects. Fixes #56280. Change-Id: I3336786bee01616ee9f2b18908738e4ca41c8102 Reviewed-on: https://go-review.googlesource.com/c/go/+/443535 Run-TryBot: Matthew Dempsky <mdempsky@google.com> TryBot-Result: Gopher Robot <gobot@golang.org> Reviewed-by: David Chase <drchase@google.com> Auto-Submit: Matthew Dempsky <mdempsky@google.com>
This commit is contained in:
parent
a7538d7821
commit
9944ba757b
7 changed files with 83 additions and 12 deletions
|
|
@ -83,7 +83,7 @@ var (
|
|||
)
|
||||
|
||||
// pgoInlinePrologue records the hot callsites from ir-graph.
|
||||
func pgoInlinePrologue(p *pgo.Profile) {
|
||||
func pgoInlinePrologue(p *pgo.Profile, decls []ir.Node) {
|
||||
if s, err := strconv.ParseFloat(base.Debug.InlineHotCallSiteCDFThreshold, 64); err == nil {
|
||||
inlineCDFHotCallSiteThresholdPercent = s
|
||||
}
|
||||
|
|
@ -104,7 +104,7 @@ func pgoInlinePrologue(p *pgo.Profile) {
|
|||
}
|
||||
}
|
||||
// mark hot call sites
|
||||
ir.VisitFuncsBottomUp(typecheck.Target.Decls, func(list []*ir.Func, recursive bool) {
|
||||
ir.VisitFuncsBottomUp(decls, func(list []*ir.Func, recursive bool) {
|
||||
for _, f := range list {
|
||||
name := ir.PkgFuncName(f)
|
||||
if n, ok := p.WeightedCG.IRNodes[name]; ok {
|
||||
|
|
@ -164,9 +164,9 @@ func computeThresholdFromCDF(p *pgo.Profile) (float64, []pgo.NodeMapKey) {
|
|||
}
|
||||
|
||||
// pgoInlineEpilogue updates IRGraph after inlining.
|
||||
func pgoInlineEpilogue(p *pgo.Profile) {
|
||||
func pgoInlineEpilogue(p *pgo.Profile, decls []ir.Node) {
|
||||
if base.Debug.PGOInline >= 2 {
|
||||
ir.VisitFuncsBottomUp(typecheck.Target.Decls, func(list []*ir.Func, recursive bool) {
|
||||
ir.VisitFuncsBottomUp(decls, func(list []*ir.Func, recursive bool) {
|
||||
for _, f := range list {
|
||||
name := ir.PkgFuncName(f)
|
||||
if n, ok := p.WeightedCG.IRNodes[name]; ok {
|
||||
|
|
@ -182,11 +182,16 @@ func pgoInlineEpilogue(p *pgo.Profile) {
|
|||
|
||||
// InlinePackage finds functions that can be inlined and clones them before walk expands them.
|
||||
func InlinePackage(p *pgo.Profile) {
|
||||
InlineDecls(p, typecheck.Target.Decls, true)
|
||||
}
|
||||
|
||||
// InlineDecls applies inlining to the given batch of declarations.
|
||||
func InlineDecls(p *pgo.Profile, decls []ir.Node, doInline bool) {
|
||||
if p != nil {
|
||||
pgoInlinePrologue(p)
|
||||
pgoInlinePrologue(p, decls)
|
||||
}
|
||||
|
||||
ir.VisitFuncsBottomUp(typecheck.Target.Decls, func(list []*ir.Func, recursive bool) {
|
||||
ir.VisitFuncsBottomUp(decls, func(list []*ir.Func, recursive bool) {
|
||||
numfns := numNonClosures(list)
|
||||
for _, n := range list {
|
||||
if !recursive || numfns > 1 {
|
||||
|
|
@ -199,12 +204,14 @@ func InlinePackage(p *pgo.Profile) {
|
|||
fmt.Printf("%v: cannot inline %v: recursive\n", ir.Line(n), n.Nname)
|
||||
}
|
||||
}
|
||||
InlineCalls(n, p)
|
||||
if doInline {
|
||||
InlineCalls(n, p)
|
||||
}
|
||||
}
|
||||
})
|
||||
|
||||
if p != nil {
|
||||
pgoInlineEpilogue(p)
|
||||
pgoInlineEpilogue(p, decls)
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue