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
|
; RUN: opt < %s -passes='print<loop-cache-cost>' -disable-output 2>&1 | FileCheck %s
; For a loop with a very large iteration count, make sure the cost
; calculation does not overflow:
;
; void a(int b) {
; for (int c;; c += b)
; for (long d = 0; d < -3ULL; d += 2ULL)
; A[c][d][d] = 0;
; }
; CHECK: Loop 'outer.loop' has cost = 9223372036854775807
; CHECK: Loop 'inner.loop' has cost = 9223372036854775807
@A = local_unnamed_addr global [11 x [11 x [11 x i32]]] zeroinitializer, align 16
define void @foo(i32 noundef %b) {
entry:
%0 = sext i32 %b to i64
br label %outer.loop
outer.loop:
%indvars.iv = phi i64 [ %indvars.iv.next, %outer.loop.cleanup ], [ 0, %entry ]
br label %inner.loop
outer.loop.cleanup:
%indvars.iv.next = add nsw i64 %indvars.iv, %0
br label %outer.loop
inner.loop:
%inner.iv = phi i64 [ 0, %outer.loop ], [ %add, %inner.loop ]
%arrayidx3 = getelementptr inbounds [11 x [11 x [11 x i32]]], ptr @A, i64 0, i64 %indvars.iv, i64 %inner.iv, i64 %inner.iv
store i32 0, ptr %arrayidx3, align 4
%add = add nuw i64 %inner.iv, 2
%cmp = icmp ult i64 %inner.iv, -5
br i1 %cmp, label %inner.loop, label %outer.loop.cleanup
}
|
