1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 4 2; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" -scalar-evolution-classify-expressions=0 2>&1 | FileCheck %s 3 4; ScalarEvolution should be able to understand the loop and eliminate the casts. 5 6target datalayout = "e-p:32:32:32-p1:16:16:16-p2:8:8:8-p4:64:64:64-n16:32:64" 7 8define void @foo(ptr addrspace(1) nocapture %d, i32 %n) nounwind { 9; 10; CHECK-LABEL: 'foo' 11; CHECK-NEXT: Determining loop execution counts for: @foo 12; CHECK-NEXT: Loop %bb: backedge-taken count is (-1 + %n) 13; CHECK-NEXT: Loop %bb: constant max backedge-taken count is i32 2147483646 14; CHECK-NEXT: Loop %bb: symbolic max backedge-taken count is (-1 + %n) 15; CHECK-NEXT: Loop %bb: Trip multiple is 1 16; 17entry: 18 %0 = icmp sgt i32 %n, 0 ; <i1> [#uses=1] 19 br i1 %0, label %bb.nph, label %return 20 21bb.nph: ; preds = %entry 22 br label %bb 23 24bb: ; preds = %bb1, %bb.nph 25 %i.02 = phi i32 [ %5, %bb1 ], [ 0, %bb.nph ] ; <i32> [#uses=2] 26 %p.01 = phi i8 [ %4, %bb1 ], [ -1, %bb.nph ] ; <i8> [#uses=2] 27 %1 = sext i8 %p.01 to i32 ; <i32> [#uses=1] 28 %2 = sext i32 %i.02 to i64 ; <i64> [#uses=1] 29 %3 = getelementptr i32, ptr addrspace(1) %d, i64 %2 ; <ptr> [#uses=1] 30 store i32 %1, ptr addrspace(1) %3, align 4 31 %4 = add i8 %p.01, 1 ; <i8> [#uses=1] 32 %5 = add i32 %i.02, 1 ; <i32> [#uses=2] 33 br label %bb1 34 35bb1: ; preds = %bb 36 %6 = icmp slt i32 %5, %n ; <i1> [#uses=1] 37 br i1 %6, label %bb, label %bb1.return_crit_edge 38 39bb1.return_crit_edge: ; preds = %bb1 40 br label %return 41 42return: ; preds = %bb1.return_crit_edge, %entry 43 ret void 44} 45 46define void @test(ptr addrspace(1) %a, i32 %n) nounwind { 47; 48; CHECK-LABEL: 'test' 49; CHECK-NEXT: Determining loop execution counts for: @test 50; CHECK-NEXT: Loop %for.body: backedge-taken count is (-1 + (zext i32 %n to i64))<nsw> 51; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i64 2147483646 52; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is (-1 + (zext i32 %n to i64))<nsw> 53; CHECK-NEXT: Loop %for.body: Trip multiple is 1 54; 55entry: 56 %cmp1 = icmp sgt i32 %n, 0 57 br i1 %cmp1, label %for.body.lr.ph, label %for.end 58 59for.body.lr.ph: ; preds = %entry 60 %tmp = zext i32 %n to i64 61 br label %for.body 62 63for.body: ; preds = %for.body, %for.body.lr.ph 64 %indvar = phi i64 [ %indvar.next, %for.body ], [ 0, %for.body.lr.ph ] 65 %arrayidx = getelementptr i8, ptr addrspace(1) %a, i64 %indvar 66 store i8 0, ptr addrspace(1) %arrayidx, align 1 67 %indvar.next = add i64 %indvar, 1 68 %exitcond = icmp ne i64 %indvar.next, %tmp 69 br i1 %exitcond, label %for.body, label %for.cond.for.end_crit_edge 70 71for.cond.for.end_crit_edge: ; preds = %for.body 72 br label %for.end 73 74for.end: ; preds = %for.cond.for.end_crit_edge, %entry 75 ret void 76} 77