1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 2 2; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" 2>&1 | FileCheck %s 3 4; Tests loops with huge trip counts. Trip count of >=2^32 are huge. Huge trip counts have a trip multiple 5; of the greatest power of 2 less than 2^32. 6 7declare void @foo(...) 8 9define void @trip_count_4294967295() { 10; CHECK-LABEL: 'trip_count_4294967295' 11; CHECK-NEXT: Classifying expressions for: @trip_count_4294967295 12; CHECK-NEXT: %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ] 13; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%for.body> U: [0,4294967295) S: [0,4294967295) Exits: 4294967294 LoopDispositions: { %for.body: Computable } 14; CHECK-NEXT: %add = add nuw nsw i64 %i.02, 1 15; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%for.body> U: [1,4294967296) S: [1,4294967296) Exits: 4294967295 LoopDispositions: { %for.body: Computable } 16; CHECK-NEXT: Determining loop execution counts for: @trip_count_4294967295 17; CHECK-NEXT: Loop %for.body: backedge-taken count is i64 4294967294 18; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i64 4294967294 19; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is i64 4294967294 20; CHECK-NEXT: Loop %for.body: Trip multiple is 4294967295 21; 22entry: 23 br label %for.body 24 25for.cond.cleanup: ; preds = %for.body 26 ret void 27 28for.body: ; preds = %entry, %for.body 29 %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ] 30 tail call void (...) @foo() #2 31 %add = add nuw nsw i64 %i.02, 1 32 %exitcond.not = icmp eq i64 %add, 4294967295 33 br i1 %exitcond.not, label %for.cond.cleanup, label %for.body 34} 35 36define void @trip_count_4294967296() { 37; CHECK-LABEL: 'trip_count_4294967296' 38; CHECK-NEXT: Classifying expressions for: @trip_count_4294967296 39; CHECK-NEXT: %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ] 40; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%for.body> U: [0,4294967296) S: [0,4294967296) Exits: 4294967295 LoopDispositions: { %for.body: Computable } 41; CHECK-NEXT: %add = add nuw nsw i64 %i.02, 1 42; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%for.body> U: [1,4294967297) S: [1,4294967297) Exits: 4294967296 LoopDispositions: { %for.body: Computable } 43; CHECK-NEXT: Determining loop execution counts for: @trip_count_4294967296 44; CHECK-NEXT: Loop %for.body: backedge-taken count is i64 4294967295 45; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i64 4294967295 46; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is i64 4294967295 47; CHECK-NEXT: Loop %for.body: Trip multiple is 2147483648 48; 49entry: 50 br label %for.body 51 52for.cond.cleanup: ; preds = %for.body 53 ret void 54 55for.body: ; preds = %entry, %for.body 56 %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ] 57 tail call void (...) @foo() #2 58 %add = add nuw nsw i64 %i.02, 1 59 %exitcond.not = icmp eq i64 %add, 4294967296 60 br i1 %exitcond.not, label %for.cond.cleanup, label %for.body 61} 62 63define void @trip_count_8589935692() { 64; CHECK-LABEL: 'trip_count_8589935692' 65; CHECK-NEXT: Classifying expressions for: @trip_count_8589935692 66; CHECK-NEXT: %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ] 67; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%for.body> U: [0,8589934592) S: [0,8589934592) Exits: 8589934591 LoopDispositions: { %for.body: Computable } 68; CHECK-NEXT: %add = add nuw nsw i64 %i.02, 1 69; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%for.body> U: [1,8589934593) S: [1,8589934593) Exits: 8589934592 LoopDispositions: { %for.body: Computable } 70; CHECK-NEXT: Determining loop execution counts for: @trip_count_8589935692 71; CHECK-NEXT: Loop %for.body: backedge-taken count is i64 8589934591 72; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i64 8589934591 73; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is i64 8589934591 74; CHECK-NEXT: Loop %for.body: Trip multiple is 2147483648 75; 76entry: 77 br label %for.body 78 79for.cond.cleanup: ; preds = %for.body 80 ret void 81 82for.body: ; preds = %entry, %for.body 83 %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ] 84 tail call void (...) @foo() #2 85 %add = add nuw nsw i64 %i.02, 1 86 %exitcond.not = icmp eq i64 %add, 8589934592 87 br i1 %exitcond.not, label %for.cond.cleanup, label %for.body 88} 89 90define void @trip_count_9223372036854775808() { 91; CHECK-LABEL: 'trip_count_9223372036854775808' 92; CHECK-NEXT: Classifying expressions for: @trip_count_9223372036854775808 93; CHECK-NEXT: %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ] 94; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%for.body> U: [0,-9223372036854775808) S: [0,-9223372036854775808) Exits: 9223372036854775807 LoopDispositions: { %for.body: Computable } 95; CHECK-NEXT: %add = add nuw nsw i64 %i.02, 1 96; CHECK-NEXT: --> {1,+,1}<nuw><%for.body> U: [1,-9223372036854775807) S: [1,-9223372036854775807) Exits: -9223372036854775808 LoopDispositions: { %for.body: Computable } 97; CHECK-NEXT: Determining loop execution counts for: @trip_count_9223372036854775808 98; CHECK-NEXT: Loop %for.body: backedge-taken count is i64 9223372036854775807 99; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i64 9223372036854775807 100; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is i64 9223372036854775807 101; CHECK-NEXT: Loop %for.body: Trip multiple is 2147483648 102; 103entry: 104 br label %for.body 105 106for.cond.cleanup: ; preds = %for.body 107 ret void 108 109for.body: ; preds = %entry, %for.body 110 %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ] 111 tail call void (...) @foo() #2 112 %add = add nuw nsw i64 %i.02, 1 113 %exitcond.not = icmp eq i64 %add, 9223372036854775808 114 br i1 %exitcond.not, label %for.cond.cleanup, label %for.body 115} 116 117define void @trip_count_18446744073709551615() { 118; CHECK-LABEL: 'trip_count_18446744073709551615' 119; CHECK-NEXT: Classifying expressions for: @trip_count_18446744073709551615 120; CHECK-NEXT: %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ] 121; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%for.body> U: [0,-9223372036854775808) S: [0,-9223372036854775808) Exits: -2 LoopDispositions: { %for.body: Computable } 122; CHECK-NEXT: %add = add nuw nsw i64 %i.02, 1 123; CHECK-NEXT: --> {1,+,1}<nuw><%for.body> U: [1,0) S: [1,0) Exits: -1 LoopDispositions: { %for.body: Computable } 124; CHECK-NEXT: Determining loop execution counts for: @trip_count_18446744073709551615 125; CHECK-NEXT: Loop %for.body: backedge-taken count is i64 -2 126; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i64 -2 127; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is i64 -2 128; CHECK-NEXT: Loop %for.body: Trip multiple is 1 129; 130entry: 131 br label %for.body 132 133for.cond.cleanup: ; preds = %for.body 134 ret void 135 136for.body: ; preds = %entry, %for.body 137 %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ] 138 tail call void (...) @foo() #2 139 %add = add nuw nsw i64 %i.02, 1 140 %exitcond.not = icmp eq i64 %add, 18446744073709551615 141 br i1 %exitcond.not, label %for.cond.cleanup, label %for.body 142} 143