1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --version 2
; RUN: opt %s -passes=inline -inline-threshold=20 -S | FileCheck %s
declare i1 @llvm.is.constant.i64(i64)
declare void @foo()
define void @callee(i64 %val) {
; CHECK-LABEL: define void @callee
; CHECK-SAME: (i64 [[VAL:%.*]]) {
; CHECK-NEXT: [[COND:%.*]] = call i1 @llvm.is.constant.i64(i64 [[VAL]])
; CHECK-NEXT: br i1 [[COND]], label [[COND_TRUE:%.*]], label [[COND_FALSE:%.*]]
; CHECK: cond.true:
; CHECK-NEXT: call void @foo()
; CHECK-NEXT: call void @foo()
; CHECK-NEXT: ret void
; CHECK: cond.false:
; CHECK-NEXT: ret void
;
%cond = call i1 @llvm.is.constant.i64(i64 %val)
br i1 %cond, label %cond.true, label %cond.false
cond.true:
; Rack up costs with a couple of function calls so that this function
; gets inlined only when @llvm.is.constant.i64 is folded. In reality,
; the "then" clause of __builtin_constant_p tends to have statements
; that fold very well, so the cost of the "then" clause is not a huge
; concern.
call void @foo()
call void @foo()
ret void
cond.false:
ret void
}
define void @caller(i64 %val) {
; CHECK-LABEL: define void @caller
; CHECK-SAME: (i64 [[VAL:%.*]]) {
; CHECK-NEXT: [[COND_I:%.*]] = call i1 @llvm.is.constant.i64(i64 [[VAL]])
; CHECK-NEXT: br i1 [[COND_I]], label [[COND_TRUE_I:%.*]], label [[COND_FALSE_I:%.*]]
; CHECK: cond.true.i:
; CHECK-NEXT: call void @foo()
; CHECK-NEXT: call void @foo()
; CHECK-NEXT: br label [[CALLEE_EXIT:%.*]]
; CHECK: cond.false.i:
; CHECK-NEXT: br label [[CALLEE_EXIT]]
; CHECK: callee.exit:
; CHECK-NEXT: ret void
;
call void @callee(i64 %val)
ret void
}
|
