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
|
; RUN: llc < %s -mtriple=powerpc64le-unknown-linux-gnu -verify-machineinstrs -mcpu=pwr8 | FileCheck %s
; RUN: llc < %s -mtriple=powerpc64le-unknown-linux-gnu -verify-machineinstrs -mcpu=a2q | FileCheck %s
; Verify that we do NOT generate the mtctr instruction for loop trip counts < 4
; The latency of the mtctr is only justified if there are more than 4 comparisons that are removed as a result.
@a = common local_unnamed_addr global i32 0, align 4
@arr = common local_unnamed_addr global [5 x i32] zeroinitializer, align 4
; Function Attrs: norecurse nounwind readonly
define signext i32 @testTripCount2(i32 signext %a) {
; CHECK-LABEL: testTripCount2:
; CHECK-NOT: mtctr
; CHECK: blr
entry:
br label %for.body
for.cond.cleanup: ; preds = %for.body
ret i32 %add
for.body: ; preds = %entry, %for.body
%indvars.iv = phi i64 [ 1, %entry ], [ %indvars.iv.next, %for.body ]
%Sum.05 = phi i32 [ 0, %entry ], [ %add, %for.body ]
%arrayidx = getelementptr inbounds [5 x i32], [5 x i32]* @arr, i64 0, i64 %indvars.iv
%0 = load i32, i32* %arrayidx, align 4
%add = add nsw i32 %0, %Sum.05
%indvars.iv.next = add nsw i64 %indvars.iv, -1
%tobool = icmp eq i64 %indvars.iv, 0
br i1 %tobool, label %for.cond.cleanup, label %for.body
}
; Function Attrs: norecurse nounwind readonly
define signext i32 @testTripCount3(i32 signext %a) {
; CHECK-LABEL: testTripCount3:
; CHECK-NOT: mtctr
; CHECK: blr
entry:
br label %for.body
for.cond.cleanup: ; preds = %for.body
ret i32 %add
for.body: ; preds = %entry, %for.body
%indvars.iv = phi i64 [ 2, %entry ], [ %indvars.iv.next, %for.body ]
%Sum.05 = phi i32 [ 0, %entry ], [ %add, %for.body ]
%arrayidx = getelementptr inbounds [5 x i32], [5 x i32]* @arr, i64 0, i64 %indvars.iv
%0 = load i32, i32* %arrayidx, align 4
%add = add nsw i32 %0, %Sum.05
%indvars.iv.next = add nsw i64 %indvars.iv, -1
%tobool = icmp eq i64 %indvars.iv, 0
br i1 %tobool, label %for.cond.cleanup, label %for.body
}
; Function Attrs: norecurse nounwind readonly
define signext i32 @testTripCount4(i32 signext %a) {
; CHECK-LABEL: testTripCount4:
; CHECK: mtctr
; CHECK: bdnz
entry:
br label %for.body
for.cond.cleanup: ; preds = %for.body
ret i32 %add
for.body: ; preds = %entry, %for.body
%indvars.iv = phi i64 [ 3, %entry ], [ %indvars.iv.next, %for.body ]
%Sum.05 = phi i32 [ 0, %entry ], [ %add, %for.body ]
%arrayidx = getelementptr inbounds [5 x i32], [5 x i32]* @arr, i64 0, i64 %indvars.iv
%0 = load i32, i32* %arrayidx, align 4
%add = add nsw i32 %0, %Sum.05
%indvars.iv.next = add nsw i64 %indvars.iv, -1
%tobool = icmp eq i64 %indvars.iv, 0
br i1 %tobool, label %for.cond.cleanup, label %for.body
}
; Function Attrs: norecurse nounwind
define signext i32 @testTripCount2NonSmallLoop() {
; CHECK-LABEL: testTripCount2NonSmallLoop:
; CHECK: mtctr
; CHECK: blr
entry:
%.pre = load i32, i32* @a, align 4
br label %for.body
for.body: ; preds = %entry, %if.end
%0 = phi i32 [ %.pre, %entry ], [ %1, %if.end ]
%dec4 = phi i32 [ 1, %entry ], [ %dec, %if.end ]
%b.03 = phi i8 [ 0, %entry ], [ %b.1, %if.end ]
%tobool1 = icmp eq i32 %0, 0
br i1 %tobool1, label %if.end, label %if.then
if.then: ; preds = %for.body
store i32 2, i32* @a, align 4
br label %if.end
if.end: ; preds = %for.body, %if.then
%1 = phi i32 [ 2, %if.then ], [ 0, %for.body ]
%b.1 = phi i8 [ 2, %if.then ], [ %b.03, %for.body ]
%dec = add nsw i32 %dec4, -1
%tobool = icmp eq i32 %dec4, 0
br i1 %tobool, label %for.end, label %for.body
for.end: ; preds = %if.end
%conv = zext i8 %b.1 to i32
ret i32 %conv
}
|
