48 lines · plain
1; RUN: opt < %s -passes='print<loop-cache-cost>' -disable-output 2>&1 | FileCheck %s2 3; For a loop with a very large iteration count, make sure the cost4; calculation does not overflow:5;6; void a() {7; for (int c;; c += 2)8; for (long d = 0; d < -3ULL; d += 2ULL)9; for (long e = 0; e < -3ULL; e += 2ULL)10; A[c][d][e] = 0;11; }12 13; CHECK: Loop 'outer.loop' has cost = 922337203685477580714; CHECK: Loop 'middle.loop' has cost = 922337203685477580715; CHECK: Loop 'inner.loop' has cost = 922337203685477580716 17@A = local_unnamed_addr global [11 x [11 x [11 x i32]]] zeroinitializer, align 1618 19define void @foo() {20entry:21 br label %outer.loop22 23outer.loop:24 %indvars.iv = phi i64 [ %indvars.iv.next, %outer.loop.cleanup ], [ 0, %entry ]25 br label %middle.loop26 27outer.loop.cleanup:28 %indvars.iv.next = add i64 %indvars.iv, 229 br label %outer.loop30 31middle.loop:32 %middle.iv = phi i64 [ %middle.iv.next, %middle.loop.cleanup ], [ 0, %outer.loop ]33 br label %inner.loop34 35middle.loop.cleanup:36 %middle.iv.next = add nuw i64 %middle.iv, 237 %ec.middle = icmp ult i64 %middle.iv, -538 br i1 %ec.middle, label %middle.loop, label %outer.loop.cleanup39 40inner.loop:41 %inner.iv = phi i64 [ 0, %middle.loop ], [ %add, %inner.loop ]42 %arrayidx3 = getelementptr inbounds [11 x [11 x [11 x i32]]], ptr @A, i64 0, i64 %indvars.iv, i64 %middle.iv, i64 %inner.iv43 store i32 0, ptr %arrayidx3, align 444 %add = add nuw i64 %inner.iv, 245 %cmp = icmp ult i64 %inner.iv, -546 br i1 %cmp, label %inner.loop, label %middle.loop.cleanup47}48