107 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py2; RUN: opt -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s3 4target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:32:32-n8:16:32"5target triple = "i386-pc-linux-gnu"6 7@arr1 = internal unnamed_addr constant [50 x i32] [i32 1, i32 2, i32 3, i32 4, i32 5, i32 6, i32 7, i32 8, i32 9, i32 10, i32 11, i32 12, i32 13, i32 14, i32 15, i32 16, i32 17, i32 18, i32 19, i32 20, i32 21, i32 22, i32 23, i32 24, i32 25, i32 26, i32 27, i32 28, i32 29, i32 30, i32 31, i32 32, i32 33, i32 34, i32 35, i32 36, i32 37, i32 38, i32 39, i32 40, i32 41, i32 42, i32 43, i32 44, i32 45, i32 46, i32 47, i32 48, i32 49, i32 50], align 48@arr2 = internal unnamed_addr constant [50 x i32] [i32 49, i32 48, i32 47, i32 46, i32 45, i32 44, i32 43, i32 42, i32 41, i32 40, i32 39, i32 38, i32 37, i32 36, i32 35, i32 34, i32 33, i32 32, i32 31, i32 30, i32 29, i32 28, i32 27, i32 26, i32 25, i32 24, i32 23, i32 22, i32 21, i32 20, i32 19, i32 18, i32 17, i32 16, i32 15, i32 14, i32 13, i32 12, i32 11, i32 10, i32 9, i32 8, i32 7, i32 6, i32 5, i32 4, i32 3, i32 2, i32 1, i32 0], align 49 10; PR1103411define i32 @test1() nounwind readnone {12; CHECK-LABEL: 'test1'13; CHECK-NEXT: Classifying expressions for: @test114; CHECK-NEXT: %sum.04 = phi i32 [ 0, %entry ], [ %add2, %for.body ]15; CHECK-NEXT: --> %sum.04 U: full-set S: full-set Exits: 2450 LoopDispositions: { %for.body: Variant }16; CHECK-NEXT: %i.03 = phi i32 [ 0, %entry ], [ %inc, %for.body ]17; CHECK-NEXT: --> {0,+,1}<nuw><nsw><%for.body> U: [0,50) S: [0,50) Exits: 49 LoopDispositions: { %for.body: Computable }18; CHECK-NEXT: %arrayidx = getelementptr inbounds [50 x i32], ptr @arr1, i32 0, i32 %i.0319; CHECK-NEXT: --> {@arr1,+,4}<nuw><%for.body> U: [4,-7) S: [-2147483648,2147483645) Exits: (196 + @arr1)<nuw> LoopDispositions: { %for.body: Computable }20; CHECK-NEXT: %0 = load i32, ptr %arrayidx, align 421; CHECK-NEXT: --> %0 U: full-set S: full-set Exits: 50 LoopDispositions: { %for.body: Variant }22; CHECK-NEXT: %arrayidx1 = getelementptr inbounds [50 x i32], ptr @arr2, i32 0, i32 %i.0323; CHECK-NEXT: --> {@arr2,+,4}<nuw><%for.body> U: [4,-7) S: [-2147483648,2147483645) Exits: (196 + @arr2)<nuw> LoopDispositions: { %for.body: Computable }24; CHECK-NEXT: %1 = load i32, ptr %arrayidx1, align 425; CHECK-NEXT: --> %1 U: full-set S: full-set Exits: 0 LoopDispositions: { %for.body: Variant }26; CHECK-NEXT: %add = add i32 %0, %sum.0427; CHECK-NEXT: --> (%0 + %sum.04) U: full-set S: full-set Exits: 2500 LoopDispositions: { %for.body: Variant }28; CHECK-NEXT: %add2 = add i32 %add, %129; CHECK-NEXT: --> (%1 + %0 + %sum.04) U: full-set S: full-set Exits: 2500 LoopDispositions: { %for.body: Variant }30; CHECK-NEXT: %inc = add nsw i32 %i.03, 131; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%for.body> U: [1,51) S: [1,51) Exits: 50 LoopDispositions: { %for.body: Computable }32; CHECK-NEXT: Determining loop execution counts for: @test133; CHECK-NEXT: Loop %for.body: backedge-taken count is i32 4934; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i32 4935; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is i32 4936; CHECK-NEXT: Loop %for.body: Trip multiple is 5037;38entry:39 br label %for.body40 41for.body: ; preds = %entry, %for.body42 %sum.04 = phi i32 [ 0, %entry ], [ %add2, %for.body ]43 %i.03 = phi i32 [ 0, %entry ], [ %inc, %for.body ]44 %arrayidx = getelementptr inbounds [50 x i32], ptr @arr1, i32 0, i32 %i.0345 %0 = load i32, ptr %arrayidx, align 446 %arrayidx1 = getelementptr inbounds [50 x i32], ptr @arr2, i32 0, i32 %i.0347 %1 = load i32, ptr %arrayidx1, align 448 %add = add i32 %0, %sum.0449 %add2 = add i32 %add, %150 %inc = add nsw i32 %i.03, 151 %cmp = icmp eq i32 %inc, 5052 br i1 %cmp, label %for.end, label %for.body53 54for.end: ; preds = %for.body55 ret i32 %add256}57 58 59%struct.ListNode = type { ptr, i32 }60 61@node5 = internal constant { ptr, i32, [4 x i8] } { ptr @node4, i32 4, [4 x i8] undef }, align 862@node4 = internal constant { ptr, i32, [4 x i8] } { ptr @node3, i32 3, [4 x i8] undef }, align 863@node3 = internal constant { ptr, i32, [4 x i8] } { ptr @node2, i32 2, [4 x i8] undef }, align 864@node2 = internal constant { ptr, i32, [4 x i8] } { ptr @node1, i32 1, [4 x i8] undef }, align 865@node1 = internal constant { ptr, i32, [4 x i8] } { ptr null, i32 0, [4 x i8] undef }, align 866 67define i32 @test2() nounwind uwtable readonly {68; CHECK-LABEL: 'test2'69; CHECK-NEXT: Classifying expressions for: @test270; CHECK-NEXT: %sum.02 = phi i32 [ 0, %entry ], [ %add, %for.body ]71; CHECK-NEXT: --> %sum.02 U: full-set S: full-set Exits: 10 LoopDispositions: { %for.body: Variant }72; CHECK-NEXT: %n.01 = phi ptr [ @node5, %entry ], [ %1, %for.body ]73; CHECK-NEXT: --> %n.01 U: full-set S: full-set Exits: @node1 LoopDispositions: { %for.body: Variant }74; CHECK-NEXT: %i = getelementptr inbounds %struct.ListNode, ptr %n.01, i64 0, i32 175; CHECK-NEXT: --> (4 + %n.01)<nuw> U: [4,0) S: [4,0) Exits: (4 + @node1)<nuw><nsw> LoopDispositions: { %for.body: Variant }76; CHECK-NEXT: %0 = load i32, ptr %i, align 477; CHECK-NEXT: --> %0 U: full-set S: full-set Exits: 0 LoopDispositions: { %for.body: Variant }78; CHECK-NEXT: %add = add nsw i32 %0, %sum.0279; CHECK-NEXT: --> (%0 + %sum.02) U: full-set S: full-set Exits: 10 LoopDispositions: { %for.body: Variant }80; CHECK-NEXT: %next = getelementptr inbounds %struct.ListNode, ptr %n.01, i64 0, i32 081; CHECK-NEXT: --> %n.01 U: full-set S: full-set Exits: @node1 LoopDispositions: { %for.body: Variant }82; CHECK-NEXT: %1 = load ptr, ptr %next, align 883; CHECK-NEXT: --> %1 U: full-set S: full-set Exits: null LoopDispositions: { %for.body: Variant }84; CHECK-NEXT: Determining loop execution counts for: @test285; CHECK-NEXT: Loop %for.body: backedge-taken count is i32 486; CHECK-NEXT: Loop %for.body: constant max backedge-taken count is i32 487; CHECK-NEXT: Loop %for.body: symbolic max backedge-taken count is i32 488; CHECK-NEXT: Loop %for.body: Trip multiple is 589;90entry:91 br label %for.body92 93for.body: ; preds = %entry, %for.body94 %sum.02 = phi i32 [ 0, %entry ], [ %add, %for.body ]95 %n.01 = phi ptr [ @node5, %entry ], [ %1, %for.body ]96 %i = getelementptr inbounds %struct.ListNode, ptr %n.01, i64 0, i32 197 %0 = load i32, ptr %i, align 498 %add = add nsw i32 %0, %sum.0299 %next = getelementptr inbounds %struct.ListNode, ptr %n.01, i64 0, i32 0100 %1 = load ptr, ptr %next, align 8101 %cmp = icmp eq ptr %1, null102 br i1 %cmp, label %for.end, label %for.body103 104for.end: ; preds = %for.body105 ret i32 %add106}107