98 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 52; RUN: opt -S -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s3 4define i32 @widget() {5; CHECK-LABEL: 'widget'6; CHECK-NEXT: Classifying expressions for: @widget7; CHECK-NEXT: %phi = phi i32 [ 0, %b ], [ %udiv6, %b5 ]8; CHECK-NEXT: --> %phi U: [0,1) S: [0,1) Exits: <<Unknown>> LoopDispositions: { %b1: Variant }9; CHECK-NEXT: %phi2 = phi i32 [ 1, %b ], [ %add, %b5 ]10; CHECK-NEXT: --> {1,+,1}<nuw><nsw><%b1> U: [1,2) S: [1,2) Exits: <<Unknown>> LoopDispositions: { %b1: Computable }11; CHECK-NEXT: %udiv = udiv i32 10, %phi212; CHECK-NEXT: --> (10 /u {1,+,1}<nuw><nsw><%b1>) U: [10,11) S: [10,11) Exits: <<Unknown>> LoopDispositions: { %b1: Computable }13; CHECK-NEXT: %urem = urem i32 %udiv, 1014; CHECK-NEXT: --> ((-10 * ((10 /u {1,+,1}<nuw><nsw><%b1>) /u 10))<nuw><nsw> + (10 /u {1,+,1}<nuw><nsw><%b1>)) U: [0,1) S: [0,1) Exits: <<Unknown>> LoopDispositions: { %b1: Computable }15; CHECK-NEXT: %udiv6 = udiv i32 %phi2, 016; CHECK-NEXT: --> ({1,+,1}<nuw><nsw><%b1> /u 0) U: empty-set S: empty-set Exits: <<Unknown>> LoopDispositions: { %b1: Computable }17; CHECK-NEXT: %add = add i32 %phi2, 118; CHECK-NEXT: --> {2,+,1}<nuw><nsw><%b1> U: [2,3) S: [2,3) Exits: <<Unknown>> LoopDispositions: { %b1: Computable }19; CHECK-NEXT: Determining loop execution counts for: @widget20; CHECK-NEXT: Loop %b1: <multiple exits> Unpredictable backedge-taken count.21; CHECK-NEXT: exit count for b1: ***COULDNOTCOMPUTE***22; CHECK-NEXT: exit count for b3: i32 023; CHECK-NEXT: Loop %b1: constant max backedge-taken count is i32 024; CHECK-NEXT: Loop %b1: symbolic max backedge-taken count is i32 025; CHECK-NEXT: symbolic max exit count for b1: ***COULDNOTCOMPUTE***26; CHECK-NEXT: symbolic max exit count for b3: i32 027;28b:29 br label %b130 31b1: ; preds = %b5, %b32 %phi = phi i32 [ 0, %b ], [ %udiv6, %b5 ]33 %phi2 = phi i32 [ 1, %b ], [ %add, %b5 ]34 %icmp = icmp eq i32 %phi, 035 br i1 %icmp, label %b3, label %b836 37b3: ; preds = %b138 %udiv = udiv i32 10, %phi239 %urem = urem i32 %udiv, 1040 %icmp4 = icmp eq i32 %urem, 041 br i1 %icmp4, label %b7, label %b542 43b5: ; preds = %b344 %udiv6 = udiv i32 %phi2, 045 %add = add i32 %phi2, 146 br label %b147 48b7: ; preds = %b349 ret i32 550 51b8: ; preds = %b152 ret i32 753}54 55; Don't fold %indvar2 into (zext {0,+,1}) * %a56define i64 @test_poisonous(i64 %a, i32 %n) {57; CHECK-LABEL: 'test_poisonous'58; CHECK-NEXT: Classifying expressions for: @test_poisonous59; CHECK-NEXT: %indvar1 = phi i32 [ 0, %entry ], [ %indvar1.next, %loop.body ]60; CHECK-NEXT: --> {0,+,1}<%loop.body> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop.body: Computable }61; CHECK-NEXT: %indvar2 = phi i64 [ 0, %entry ], [ %mul, %loop.body ]62; CHECK-NEXT: --> %indvar2 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop.body: Variant }63; CHECK-NEXT: %indvar1.next = add i32 %indvar1, 164; CHECK-NEXT: --> {1,+,1}<%loop.body> U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop.body: Computable }65; CHECK-NEXT: %ext = zext i32 %indvar1.next to i6466; CHECK-NEXT: --> (zext i32 {1,+,1}<%loop.body> to i64) U: [0,4294967296) S: [0,4294967296) Exits: <<Unknown>> LoopDispositions: { %loop.body: Computable }67; CHECK-NEXT: %mul = mul i64 %ext, %a68; CHECK-NEXT: --> ((zext i32 {1,+,1}<%loop.body> to i64) * %a) U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %loop.body: Computable }69; CHECK-NEXT: Determining loop execution counts for: @test_poisonous70; CHECK-NEXT: Loop %loop.body: Unpredictable backedge-taken count.71; CHECK-NEXT: Loop %loop.body: Unpredictable constant max backedge-taken count.72; CHECK-NEXT: Loop %loop.body: Unpredictable symbolic max backedge-taken count.73; CHECK-NEXT: Loop %loop.body: Predicated backedge-taken count is (-1 + (1 smax (1 + (sext i32 %n to i64))<nsw>))<nsw>74; CHECK-NEXT: Predicates:75; CHECK-NEXT: {1,+,1}<%loop.body> Added Flags: <nssw>76; CHECK-NEXT: Loop %loop.body: Predicated constant max backedge-taken count is i64 214748364777; CHECK-NEXT: Predicates:78; CHECK-NEXT: {1,+,1}<%loop.body> Added Flags: <nssw>79; CHECK-NEXT: Loop %loop.body: Predicated symbolic max backedge-taken count is (-1 + (1 smax (1 + (sext i32 %n to i64))<nsw>))<nsw>80; CHECK-NEXT: Predicates:81; CHECK-NEXT: {1,+,1}<%loop.body> Added Flags: <nssw>82;83entry:84 br label %loop.body85 86loop.body:87 %indvar1 = phi i32 [ 0, %entry ], [ %indvar1.next, %loop.body ]88 %indvar2 = phi i64 [ 0, %entry ], [ %mul, %loop.body ]89 %indvar1.next = add i32 %indvar1, 190 %ext = zext i32 %indvar1.next to i6491 %mul = mul i64 %ext, %a92 %exitcond = icmp sgt i32 %indvar1.next, %n93 br i1 %exitcond, label %loop.exit, label %loop.body94 95loop.exit:96 ret i64 %mul97}98