The inline history makes sure that we don't keep inlining due to mutual devirtualization. But this gets forgotten between inliner invocations. So mark the inlined calls as noinline so we respect previous inline history decisions. This overlaps with D121084, but they're not redundant since we may not inline completely through a child SCC, but we still want a cost multiplier when that happens. See discussions in D145516. Reviewed By: jmorse Differential Revision: https://reviews.llvm.org/D150989
33 lines
840 B
LLVM
33 lines
840 B
LLVM
; RUN: opt -passes=inline -S < %s | FileCheck %s
|
|
|
|
; This will inline @f1 into @a, causing two new calls to @f2, which will get inlined for two calls to @f1.
|
|
; The inline history should stop recursive inlining here, and make sure to mark the inlined calls as noinline so we don't repeat the inlining later on when @a gets inlined into @b.
|
|
|
|
define internal void @f1(ptr %p) {
|
|
call void %p(ptr @f1)
|
|
ret void
|
|
}
|
|
|
|
define internal void @f2(ptr %p) {
|
|
call void %p(ptr @f2)
|
|
call void %p(ptr @f2)
|
|
ret void
|
|
}
|
|
|
|
define void @b() {
|
|
; CHECK-LABEL: define void @b() {
|
|
; CHECK-NEXT: call void @f1(ptr @f2) #[[NOINLINE:[0-9]+]]
|
|
; CHECK-NEXT: call void @f1(ptr @f2) #[[NOINLINE]]
|
|
; CHECK-NEXT: ret void
|
|
;
|
|
call void @a()
|
|
ret void
|
|
}
|
|
|
|
define internal void @a() {
|
|
call void @f1(ptr @f2)
|
|
ret void
|
|
}
|
|
|
|
; CHECK: [[NOINLINE]] = { noinline }
|