When calculating the specialization bonus for a given function argument, we recursively traverse the chain of (certain) users, accumulating the instruction costs. Then we exponentially increase the bonus to account for loop nests. This is problematic for two reasons: (a) the users might not themselves be inside the loop nest, (b) if they are we are accounting for it multiple times. Instead we should be adjusting the bonus before traversing the user chain. This reduces the instruction count for CTMark (newPM-O3) when Function Specialization is enabled without actually reducing the amount of specializations performed (geomean: -0.001% non-LTO, -0.406% LTO). Differential Revision: https://reviews.llvm.org/D136692
64 lines
1.5 KiB
LLVM
64 lines
1.5 KiB
LLVM
; RUN: opt -function-specialization -func-specialization-avg-iters-cost=5 -func-specialization-size-threshold=10 -S < %s | FileCheck %s
|
|
|
|
; Check that the loop depth results in a larger specialization bonus.
|
|
; CHECK: @foo.1(
|
|
; CHECK: @foo.2(
|
|
|
|
target datalayout = "e-m:e-i8:8:32-i16:16:32-i64:64-i128:128-n32:64-S128"
|
|
|
|
@A = external dso_local constant i32, align 4
|
|
@B = external dso_local constant i32, align 4
|
|
@C = external dso_local constant i32, align 4
|
|
@D = external dso_local constant i32, align 4
|
|
|
|
declare i1 @cond_begin()
|
|
declare i1 @cond_end()
|
|
declare i1 @getCond()
|
|
|
|
define internal i32 @foo(i32 %x, i32* %b, i32* %c) {
|
|
entry:
|
|
br label %loop.entry
|
|
|
|
loop.entry:
|
|
br label %loop2.entry
|
|
|
|
loop2.entry:
|
|
br label %loop2.body
|
|
|
|
loop2.body:
|
|
%0 = load i32, i32* %b, align 4
|
|
%1 = load i32, i32* %c, align 4
|
|
%add.0 = add nsw i32 %0, %1
|
|
%add = add nsw i32 %add.0, %x
|
|
br label %loop2.end
|
|
|
|
loop2.end:
|
|
%cond.end = call i1 @cond_end()
|
|
br i1 %cond.end, label %loop2.entry, label %loop.end
|
|
|
|
loop.end:
|
|
%cond2.end = call i1 @getCond()
|
|
br i1 %cond2.end, label %loop.entry, label %return
|
|
|
|
return:
|
|
ret i32 %add
|
|
}
|
|
|
|
define dso_local i32 @bar(i32 %x, i32 %y) {
|
|
entry:
|
|
%tobool = icmp ne i32 %x, 0
|
|
br i1 %tobool, label %if.then, label %if.else
|
|
|
|
if.then:
|
|
%call = call i32 @foo(i32 %x, i32* @A, i32* @C)
|
|
br label %return
|
|
|
|
if.else:
|
|
%call1 = call i32 @foo(i32 %y, i32* @B, i32* @D)
|
|
br label %return
|
|
|
|
return:
|
|
%retval.0 = phi i32 [ %call, %if.then ], [ %call1, %if.else ]
|
|
ret i32 %retval.0
|
|
}
|