brintos

brintos / llvm-project-archived public Read only

0
0
Text · 7.1 KiB · 32b4d03 Raw
143 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 22; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" 2>&1 | FileCheck %s3 4; Tests loops with huge trip counts. Trip count of >=2^32 are huge. Huge trip counts have a trip multiple5; 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_429496729512; 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, 115; 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_429496729517; CHECK-NEXT:  Loop %for.body: backedge-taken count is i64 429496729418; CHECK-NEXT:  Loop %for.body: constant max backedge-taken count is i64 429496729419; CHECK-NEXT:  Loop %for.body: symbolic max backedge-taken count is i64 429496729420; CHECK-NEXT:  Loop %for.body: Trip multiple is 429496729521;22entry:23  br label %for.body24 25for.cond.cleanup:                                 ; preds = %for.body26  ret void27 28for.body:                                         ; preds = %entry, %for.body29  %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ]30  tail call void (...) @foo() #231  %add = add nuw nsw i64 %i.02, 132  %exitcond.not = icmp eq i64 %add, 429496729533  br i1 %exitcond.not, label %for.cond.cleanup, label %for.body34}35 36define void @trip_count_4294967296() {37; CHECK-LABEL: 'trip_count_4294967296'38; CHECK-NEXT:  Classifying expressions for: @trip_count_429496729639; 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, 142; 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_429496729644; CHECK-NEXT:  Loop %for.body: backedge-taken count is i64 429496729545; CHECK-NEXT:  Loop %for.body: constant max backedge-taken count is i64 429496729546; CHECK-NEXT:  Loop %for.body: symbolic max backedge-taken count is i64 429496729547; CHECK-NEXT:  Loop %for.body: Trip multiple is 214748364848;49entry:50  br label %for.body51 52for.cond.cleanup:                                 ; preds = %for.body53  ret void54 55for.body:                                         ; preds = %entry, %for.body56  %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ]57  tail call void (...) @foo() #258  %add = add nuw nsw i64 %i.02, 159  %exitcond.not = icmp eq i64 %add, 429496729660  br i1 %exitcond.not, label %for.cond.cleanup, label %for.body61}62 63define void @trip_count_8589935692() {64; CHECK-LABEL: 'trip_count_8589935692'65; CHECK-NEXT:  Classifying expressions for: @trip_count_858993569266; 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, 169; 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_858993569271; CHECK-NEXT:  Loop %for.body: backedge-taken count is i64 858993459172; CHECK-NEXT:  Loop %for.body: constant max backedge-taken count is i64 858993459173; CHECK-NEXT:  Loop %for.body: symbolic max backedge-taken count is i64 858993459174; CHECK-NEXT:  Loop %for.body: Trip multiple is 214748364875;76entry:77  br label %for.body78 79for.cond.cleanup:                                 ; preds = %for.body80  ret void81 82for.body:                                         ; preds = %entry, %for.body83  %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ]84  tail call void (...) @foo() #285  %add = add nuw nsw i64 %i.02, 186  %exitcond.not = icmp eq i64 %add, 858993459287  br i1 %exitcond.not, label %for.cond.cleanup, label %for.body88}89 90define void @trip_count_9223372036854775808() {91; CHECK-LABEL: 'trip_count_9223372036854775808'92; CHECK-NEXT:  Classifying expressions for: @trip_count_922337203685477580893; 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, 196; 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_922337203685477580898; CHECK-NEXT:  Loop %for.body: backedge-taken count is i64 922337203685477580799; CHECK-NEXT:  Loop %for.body: constant max backedge-taken count is i64 9223372036854775807100; CHECK-NEXT:  Loop %for.body: symbolic max backedge-taken count is i64 9223372036854775807101; CHECK-NEXT:  Loop %for.body: Trip multiple is 2147483648102;103entry:104  br label %for.body105 106for.cond.cleanup:                                 ; preds = %for.body107  ret void108 109for.body:                                         ; preds = %entry, %for.body110  %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ]111  tail call void (...) @foo() #2112  %add = add nuw nsw i64 %i.02, 1113  %exitcond.not = icmp eq i64 %add, 9223372036854775808114  br i1 %exitcond.not, label %for.cond.cleanup, label %for.body115}116 117define void @trip_count_18446744073709551615() {118; CHECK-LABEL: 'trip_count_18446744073709551615'119; CHECK-NEXT:  Classifying expressions for: @trip_count_18446744073709551615120; 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, 1123; 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_18446744073709551615125; CHECK-NEXT:  Loop %for.body: backedge-taken count is i64 -2126; CHECK-NEXT:  Loop %for.body: constant max backedge-taken count is i64 -2127; CHECK-NEXT:  Loop %for.body: symbolic max backedge-taken count is i64 -2128; CHECK-NEXT:  Loop %for.body: Trip multiple is 1129;130entry:131  br label %for.body132 133for.cond.cleanup:                                 ; preds = %for.body134  ret void135 136for.body:                                         ; preds = %entry, %for.body137  %i.02 = phi i64 [ 0, %entry ], [ %add, %for.body ]138  tail call void (...) @foo() #2139  %add = add nuw nsw i64 %i.02, 1140  %exitcond.not = icmp eq i64 %add, 18446744073709551615141  br i1 %exitcond.not, label %for.cond.cleanup, label %for.body142}143