-
-
Notifications
You must be signed in to change notification settings - Fork 5.6k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
optimizer: simplify inlining algorithm #47207
Conversation
Your benchmark job has completed - possible performance regressions were detected. A full report can be found here. |
787c127
to
481d121
Compare
@nanosoldier |
Your benchmark job has completed - possible performance regressions were detected. A full report can be found here. |
Okay, better performance. This should be ready. |
@nanosoldier |
Your benchmark job has completed - possible performance regressions were detected. A full report can be found here. |
The main purpose of this commit is to try to simplify our inlining algorithm by removing the delayed callee resolving mechanism (i.e. `DelayedInliningSpec` stuff), since that kind of mechanism currently has no users and we provide more fine grained control with `inlining_policy` now. This commit also adds some more cleanups, changing argument ordering of some subroutines so that they are aligned with the other ones, and removing dead subroutines.
481d121
to
74de264
Compare
@nanosoldier |
Your benchmark job has completed - no performance regressions were detected. A full report can be found here. |
The main purpose of this commit is to try to simplify our inlining
algorithm by removing the delayed callee resolving mechanism (i.e.
DelayedInliningSpec
stuff), since that kind of mechanism currentlyhas no users and we provide more fine grained control with
inlining_policy
now.This commit also adds some more cleanups, changing argument ordering of
some subroutines so that they are aligned with the other ones, and
removing dead subroutines.