36 lines · plain
1; RUN: opt < %s -passes='print<loopnest>' -disable-output 2>&1 | FileCheck %s2 3; Test that the loop nest analysis is able to analyze an infinite loop in a loop nest.4define void @test1(ptr %A, i1 %cond) {5; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: for.inner, Loops: ( for.inner )6; CHECK-LABEL: IsPerfect=false, Depth=2, OutermostLoop: for.outer, Loops: ( for.outer for.inner )7; CHECK-LABEL: IsPerfect=true, Depth=1, OutermostLoop: for.infinite, Loops: ( for.infinite )8entry:9 br label %for.outer10 11for.outer:12 %i = phi i64 [ 0, %entry ], [ %inc_i, %for.outer.latch ]13 br i1 %cond, label %for.inner, label %for.infinite14 15for.inner:16 %j = phi i64 [ 0, %for.outer ], [ %inc_j, %for.inner ]17 %arrayidx_i = getelementptr inbounds ptr, ptr %A, i64 %i18 %0 = load ptr, ptr %arrayidx_i, align 819 %arrayidx_j = getelementptr inbounds i32, ptr %0, i64 %j20 store i32 0, ptr %arrayidx_j, align 421 %inc_j = add nsw i64 %j, 122 %cmp_j = icmp slt i64 %inc_j, 10023 br i1 %cmp_j, label %for.inner, label %for.outer.latch24 25for.infinite:26 br label %for.infinite27 28for.outer.latch:29 %inc_i = add nsw i64 %i, 130 %cmp_i = icmp slt i64 %inc_i, 10031 br i1 %cmp_i, label %for.outer, label %for.end32 33for.end:34 ret void35}36