File: entry-count-adjustment.ll

package info (click to toggle)
llvm-toolchain-21 1%3A21.1.0-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 2,235,796 kB
  • sloc: cpp: 7,617,614; ansic: 1,433,901; asm: 1,058,726; python: 252,096; f90: 94,671; objc: 70,753; lisp: 42,813; pascal: 18,401; sh: 10,032; ml: 5,111; perl: 4,720; awk: 3,523; makefile: 3,401; javascript: 2,272; xml: 892; fortran: 770
file content (120 lines) | stat: -rw-r--r-- 4,997 bytes parent folder | download | duplicates (3)
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --check-globals
; RUN: opt -passes=tailcallelim -S %s -o - | FileCheck %s --check-prefixes=CHECK,ENABLED
; RUN: opt -passes=tailcallelim -tre-disable-entrycount-recompute -S %s -o - | FileCheck %s --check-prefixes=CHECK,DISABLED

; Test that tail call elimination correctly adjusts function entry counts
; when eliminating tail recursive calls.

; Basic test: eliminate a tail call and adjust entry count
define i32 @test_basic_entry_count_adjustment(i32 %n) !prof !0 {
; CHECK-LABEL: @test_basic_entry_count_adjustment(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    br label [[TAILRECURSE:%.*]]
; CHECK:       tailrecurse:
; CHECK-NEXT:    [[N_TR:%.*]] = phi i32 [ [[N:%.*]], [[ENTRY:%.*]] ], [ [[SUB:%.*]], [[IF_THEN:%.*]] ]
; CHECK-NEXT:    [[CMP:%.*]] = icmp sgt i32 [[N_TR]], 0
; CHECK-NEXT:    br i1 [[CMP]], label [[IF_THEN]], label [[IF_ELSE:%.*]], !prof [[PROF1:![0-9]+]]
; CHECK:       if.then:
; CHECK-NEXT:    [[SUB]] = sub i32 [[N_TR]], 1
; CHECK-NEXT:    br label [[TAILRECURSE]]
; CHECK:       if.else:
; CHECK-NEXT:    ret i32 0
;
entry:
  %cmp = icmp sgt i32 %n, 0
  br i1 %cmp, label %if.then, label %if.else, !prof !1

if.then:                                          ; preds = %entry
  %sub = sub i32 %n, 1
  %call = tail call i32 @test_basic_entry_count_adjustment(i32 %sub)
  ret i32 %call

if.else:                                          ; preds = %entry
  ret i32 0
}

; Test multiple tail calls in different blocks with different frequencies
define i32 @test_multiple_blocks_entry_count(i32 %n, i32 %flag) !prof !2 {
; CHECK-LABEL: @test_multiple_blocks_entry_count(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    br label [[TAILRECURSE:%.*]]
; CHECK:       tailrecurse:
; CHECK-NEXT:    [[N_TR:%.*]] = phi i32 [ [[N:%.*]], [[ENTRY:%.*]] ], [ [[SUB1:%.*]], [[BLOCK1:%.*]] ], [ [[SUB2:%.*]], [[BLOCK2:%.*]] ]
; CHECK-NEXT:    [[CMP:%.*]] = icmp sgt i32 [[N_TR]], 0
; CHECK-NEXT:    br i1 [[CMP]], label [[CHECK_FLAG:%.*]], label [[BASE_CASE:%.*]], !prof [[PROF3:![0-9]+]]
; CHECK:       check.flag:
; CHECK-NEXT:    [[CMP_FLAG:%.*]] = icmp eq i32 [[FLAG:%.*]], 1
; CHECK-NEXT:    br i1 [[CMP_FLAG]], label [[BLOCK1]], label [[BLOCK2]], !prof [[PROF4:![0-9]+]]
; CHECK:       block1:
; CHECK-NEXT:    [[SUB1]] = sub i32 [[N_TR]], 1
; CHECK-NEXT:    br label [[TAILRECURSE]]
; CHECK:       block2:
; CHECK-NEXT:    [[SUB2]] = sub i32 [[N_TR]], 2
; CHECK-NEXT:    br label [[TAILRECURSE]]
; CHECK:       base.case:
; CHECK-NEXT:    ret i32 1
;
entry:
  %cmp = icmp sgt i32 %n, 0
  br i1 %cmp, label %check.flag, label %base.case, !prof !3
check.flag:
  %cmp.flag = icmp eq i32 %flag, 1
  br i1 %cmp.flag, label %block1, label %block2, !prof !4
block1:                                           ; preds = %check.flag
  %sub1 = sub i32 %n, 1
  %call1 = tail call i32 @test_multiple_blocks_entry_count(i32 %sub1, i32 %flag)
  ret i32 %call1
block2:                                           ; preds = %check.flag
  %sub2 = sub i32 %n, 2
  %call2 = tail call i32 @test_multiple_blocks_entry_count(i32 %sub2, i32 %flag)
  ret i32 %call2
base.case:                                        ; preds = %entry
  ret i32 1
}

define i32 @test_no_entry_count(i32 %n) {
; CHECK-LABEL: @test_no_entry_count(
; CHECK-NEXT:  entry:
; CHECK-NEXT:    br label [[TAILRECURSE:%.*]]
; CHECK:       tailrecurse:
; CHECK-NEXT:    [[N_TR:%.*]] = phi i32 [ [[N:%.*]], [[ENTRY:%.*]] ], [ [[SUB:%.*]], [[IF_THEN:%.*]] ]
; CHECK-NEXT:    [[CMP:%.*]] = icmp sgt i32 [[N_TR]], 0
; CHECK-NEXT:    br i1 [[CMP]], label [[IF_THEN]], label [[IF_ELSE:%.*]]
; CHECK:       if.then:
; CHECK-NEXT:    [[SUB]] = sub i32 [[N_TR]], 1
; CHECK-NEXT:    br label [[TAILRECURSE]]
; CHECK:       if.else:
; CHECK-NEXT:    ret i32 0
;
entry:
  %cmp = icmp sgt i32 %n, 0
  br i1 %cmp, label %if.then, label %if.else

if.then:                                          ; preds = %entry
  %sub = sub i32 %n, 1
  %call = tail call i32 @test_no_entry_count(i32 %sub)
  ret i32 %call

if.else:                                          ; preds = %entry
  ret i32 0
}

; Function entry count metadata
!0 = !{!"function_entry_count", i64 1000}
!1 = !{!"branch_weights", i32 800, i32 200}
!2 = !{!"function_entry_count", i64 2000}
!3 = !{!"branch_weights", i32 3, i32 1}
!4 = !{!"branch_weights", i32 100, i32 900}
;.
; ENABLED: [[META0:![0-9]+]] = !{!"function_entry_count", i64 200}
; ENABLED: [[PROF1]] = !{!"branch_weights", i32 800, i32 200}
; ENABLED: [[META2:![0-9]+]] = !{!"function_entry_count", i64 500}
; ENABLED: [[PROF3]] = !{!"branch_weights", i32 3, i32 1}
; ENABLED: [[PROF4]] = !{!"branch_weights", i32 100, i32 900}
;.
; DISABLED: [[META0:![0-9]+]] = !{!"function_entry_count", i64 1000}
; DISABLED: [[PROF1]] = !{!"branch_weights", i32 800, i32 200}
; DISABLED: [[META2:![0-9]+]] = !{!"function_entry_count", i64 2000}
; DISABLED: [[PROF3]] = !{!"branch_weights", i32 3, i32 1}
; DISABLED: [[PROF4]] = !{!"branch_weights", i32 100, i32 900}
;.