1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py 2; RUN: opt -analyze -scalar-evolution < %s -enable-new-pm=0 | FileCheck %s 3; RUN: opt -passes='print<scalar-evolution>' < %s -disable-output 2>&1 | FileCheck %s 4 5@b = dso_local global i32 5, align 4 6@__const.f.g = private unnamed_addr constant [1 x [4 x i16]] [[4 x i16] [i16 1, i16 0, i16 0, i16 0]], align 2 7@a = common dso_local global i32 0, align 4 8@c = common dso_local global i32 0, align 4 9@d = common dso_local global i32 0, align 4 10@e = common dso_local global i32 0, align 4 11 12; When inner.loop is taken as an exiting block of outer.loop, we cannot use the 13; addrec of %storemerge1921.3, which is {3, +, -1}<inner.loop>, to calculate the 14; exit count because it doesn't belong to outer.loop. 15define dso_local i32 @f() { 16; CHECK-LABEL: 'f' 17; CHECK-NEXT: Classifying expressions for: @f 18; CHECK-NEXT: %storemerge23 = phi i32 [ 3, %entry ], [ %dec16, %for.inc13.3 ] 19; CHECK-NEXT: --> {3,+,-1}<nsw><%outer.loop> U: [1,4) S: [1,4) Exits: <<Unknown>> LoopDispositions: { %outer.loop: Computable, %for.cond6: Invariant, %inner.loop: Invariant } 20; CHECK-NEXT: %storemerge1921 = phi i32 [ 3, %outer.loop ], [ %dec, %for.end ] 21; CHECK-NEXT: --> {3,+,-1}<nuw><nsw><%for.cond6> U: [3,4) S: [3,4) Exits: <<Unknown>> LoopDispositions: { %for.cond6: Computable, %outer.loop: Variant } 22; CHECK-NEXT: %idxprom20 = zext i32 %storemerge1921 to i64 23; CHECK-NEXT: --> {3,+,4294967295}<nuw><nsw><%for.cond6> U: [3,4) S: [3,4) Exits: <<Unknown>> LoopDispositions: { %for.cond6: Computable, %outer.loop: Variant } 24; CHECK-NEXT: %arrayidx7 = getelementptr inbounds [1 x [4 x i16]], [1 x [4 x i16]]* @__const.f.g, i64 0, i64 0, i64 %idxprom20 25; CHECK-NEXT: --> {(6 + @__const.f.g)<nuw>,+,8589934590}<nuw><%for.cond6> U: [6,-1) S: [-9223372036854775808,9223372036854775807) Exits: <<Unknown>> LoopDispositions: { %for.cond6: Computable, %outer.loop: Variant } 26; CHECK-NEXT: %i = load i16, i16* %arrayidx7, align 2 27; CHECK-NEXT: --> %i U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %for.cond6: Variant, %outer.loop: Variant } 28; CHECK-NEXT: %storemerge1822.lcssa.ph = phi i32 [ 0, %for.cond6 ] 29; CHECK-NEXT: --> 0 U: [0,1) S: [0,1) 30; CHECK-NEXT: %storemerge1822.lcssa.ph32 = phi i32 [ 3, %inner.loop ] 31; CHECK-NEXT: --> 3 U: [3,4) S: [3,4) 32; CHECK-NEXT: %storemerge1822.lcssa = phi i32 [ %storemerge1822.lcssa.ph, %if.end.loopexit ], [ %storemerge1822.lcssa.ph32, %if.end.loopexit31 ] 33; CHECK-NEXT: --> %storemerge1822.lcssa U: [0,4) S: [0,4) 34; CHECK-NEXT: %i1 = load i32, i32* @e, align 4 35; CHECK-NEXT: --> %i1 U: full-set S: full-set 36; CHECK-NEXT: %i2 = load volatile i32, i32* @b, align 4 37; CHECK-NEXT: --> %i2 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %for.cond6: Variant, %outer.loop: Variant } 38; CHECK-NEXT: %dec = add nsw i32 %storemerge1921, -1 39; CHECK-NEXT: --> {2,+,-1}<nsw><%for.cond6> U: [2,3) S: [2,3) Exits: <<Unknown>> LoopDispositions: { %for.cond6: Computable, %outer.loop: Variant } 40; CHECK-NEXT: %inc.lcssa.lcssa = phi i32 [ 4, %for.inc13.3 ] 41; CHECK-NEXT: --> 4 U: [4,5) S: [4,5) 42; CHECK-NEXT: %retval.0 = phi i32 [ %i1, %if.end ], [ 0, %cleanup.loopexit ] 43; CHECK-NEXT: --> %retval.0 U: full-set S: full-set 44; CHECK-NEXT: %storemerge1921.3 = phi i32 [ 3, %for.end ], [ %dec.3, %for.end.3 ] 45; CHECK-NEXT: --> {3,+,-1}<nuw><nsw><%inner.loop> U: [3,4) S: [3,4) Exits: <<Unknown>> LoopDispositions: { %inner.loop: Computable, %outer.loop: Variant } 46; CHECK-NEXT: %idxprom20.3 = zext i32 %storemerge1921.3 to i64 47; CHECK-NEXT: --> {3,+,4294967295}<nuw><nsw><%inner.loop> U: [3,4) S: [3,4) Exits: <<Unknown>> LoopDispositions: { %inner.loop: Computable, %outer.loop: Variant } 48; CHECK-NEXT: %arrayidx7.3 = getelementptr inbounds [1 x [4 x i16]], [1 x [4 x i16]]* @__const.f.g, i64 0, i64 0, i64 %idxprom20.3 49; CHECK-NEXT: --> {(6 + @__const.f.g)<nuw>,+,8589934590}<nuw><%inner.loop> U: [6,-1) S: [-9223372036854775808,9223372036854775807) Exits: <<Unknown>> LoopDispositions: { %inner.loop: Computable, %outer.loop: Variant } 50; CHECK-NEXT: %i7 = load i16, i16* %arrayidx7.3, align 2 51; CHECK-NEXT: --> %i7 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner.loop: Variant, %outer.loop: Variant } 52; CHECK-NEXT: %i8 = load volatile i32, i32* @b, align 4 53; CHECK-NEXT: --> %i8 U: full-set S: full-set Exits: <<Unknown>> LoopDispositions: { %inner.loop: Variant, %outer.loop: Variant } 54; CHECK-NEXT: %dec.3 = add nsw i32 %storemerge1921.3, -1 55; CHECK-NEXT: --> {2,+,-1}<nsw><%inner.loop> U: [2,3) S: [2,3) Exits: <<Unknown>> LoopDispositions: { %inner.loop: Computable, %outer.loop: Variant } 56; CHECK-NEXT: %storemerge1921.lcssa25.3 = phi i32 [ %storemerge1921.3, %for.end.3 ] 57; CHECK-NEXT: --> %storemerge1921.lcssa25.3 U: [3,4) S: [3,4) Exits: <<Unknown>> LoopDispositions: { %outer.loop: Variant, %for.cond6: Invariant, %inner.loop: Invariant } 58; CHECK-NEXT: %dec16 = add nsw i32 %storemerge23, -1 59; CHECK-NEXT: --> {2,+,-1}<nsw><%outer.loop> U: [0,3) S: [0,3) Exits: <<Unknown>> LoopDispositions: { %outer.loop: Computable, %for.cond6: Invariant, %inner.loop: Invariant } 60; CHECK-NEXT: Determining loop execution counts for: @f 61; CHECK-NEXT: Loop %for.cond6: <multiple exits> Unpredictable backedge-taken count. 62; CHECK-NEXT: exit count for for.cond6: 0 63; CHECK-NEXT: exit count for for.end: ***COULDNOTCOMPUTE*** 64; CHECK-NEXT: Loop %for.cond6: max backedge-taken count is 0 65; CHECK-NEXT: Loop %for.cond6: Unpredictable predicated backedge-taken count. 66; CHECK-NEXT: Loop %inner.loop: <multiple exits> Unpredictable backedge-taken count. 67; CHECK-NEXT: exit count for inner.loop: 0 68; CHECK-NEXT: exit count for for.end.3: ***COULDNOTCOMPUTE*** 69; CHECK-NEXT: Loop %inner.loop: max backedge-taken count is 0 70; CHECK-NEXT: Loop %inner.loop: Unpredictable predicated backedge-taken count. 71; CHECK-NEXT: Loop %outer.loop: <multiple exits> Unpredictable backedge-taken count. 72; CHECK-NEXT: exit count for for.cond6: ***COULDNOTCOMPUTE*** 73; CHECK-NEXT: exit count for inner.loop: ***COULDNOTCOMPUTE*** 74; CHECK-NEXT: exit count for for.inc13.3: 2 75; CHECK-NEXT: Loop %outer.loop: max backedge-taken count is 2 76; CHECK-NEXT: Loop %outer.loop: Unpredictable predicated backedge-taken count. 77; 78entry: 79 store i32 3, i32* @a, align 4 80 br label %outer.loop 81 82outer.loop: ; preds = %for.inc13.3, %entry 83 %storemerge23 = phi i32 [ 3, %entry ], [ %dec16, %for.inc13.3 ] 84 br label %for.cond6 85 86for.cond6: ; preds = %for.end, %outer.loop 87 %storemerge1921 = phi i32 [ 3, %outer.loop ], [ %dec, %for.end ] 88 %idxprom20 = zext i32 %storemerge1921 to i64 89 %arrayidx7 = getelementptr inbounds [1 x [4 x i16]], [1 x [4 x i16]]* @__const.f.g, i64 0, i64 0, i64 %idxprom20 90 %i = load i16, i16* %arrayidx7, align 2 91 %tobool8 = icmp eq i16 %i, 0 92 br i1 %tobool8, label %if.end.loopexit, label %for.end 93 94if.end.loopexit: ; preds = %for.cond6 95 %storemerge1822.lcssa.ph = phi i32 [ 0, %for.cond6 ] 96 br label %if.end 97 98if.end.loopexit31: ; preds = %inner.loop 99 %storemerge1822.lcssa.ph32 = phi i32 [ 3, %inner.loop ] 100 br label %if.end 101 102if.end: ; preds = %if.end.loopexit31, %if.end.loopexit 103 %storemerge1822.lcssa = phi i32 [ %storemerge1822.lcssa.ph, %if.end.loopexit ], [ %storemerge1822.lcssa.ph32, %if.end.loopexit31 ] 104 store i32 %storemerge1822.lcssa, i32* @c, align 4 105 store i32 2, i32* @d, align 4 106 %i1 = load i32, i32* @e, align 4 107 br label %cleanup 108 109for.end: ; preds = %for.cond6 110 %i2 = load volatile i32, i32* @b, align 4 111 %tobool9 = icmp eq i32 %i2, 0 112 %dec = add nsw i32 %storemerge1921, -1 113 br i1 %tobool9, label %for.cond6, label %inner.loop 114 115cleanup.loopexit: ; preds = %for.inc13.3 116 %inc.lcssa.lcssa = phi i32 [ 4, %for.inc13.3 ] 117 store i32 %inc.lcssa.lcssa, i32* @c, align 4 118 br label %cleanup 119 120cleanup: ; preds = %cleanup.loopexit, %if.end 121 %retval.0 = phi i32 [ %i1, %if.end ], [ 0, %cleanup.loopexit ] 122 ret i32 %retval.0 123 124inner.loop: ; preds = %for.end.3, %for.end 125 %storemerge1921.3 = phi i32 [ 3, %for.end ], [ %dec.3, %for.end.3 ] 126 %idxprom20.3 = zext i32 %storemerge1921.3 to i64 127 %arrayidx7.3 = getelementptr inbounds [1 x [4 x i16]], [1 x [4 x i16]]* @__const.f.g, i64 0, i64 0, i64 %idxprom20.3 128 %i7 = load i16, i16* %arrayidx7.3, align 2 129 %tobool8.3 = icmp eq i16 %i7, 0 130 br i1 %tobool8.3, label %if.end.loopexit31, label %for.end.3 131 132for.end.3: ; preds = %inner.loop 133 %i8 = load volatile i32, i32* @b, align 4 134 %tobool9.3 = icmp eq i32 %i8, 0 135 %dec.3 = add nsw i32 %storemerge1921.3, -1 136 br i1 %tobool9.3, label %inner.loop, label %for.inc13.3 137 138for.inc13.3: ; preds = %for.end.3 139 %storemerge1921.lcssa25.3 = phi i32 [ %storemerge1921.3, %for.end.3 ] 140 store i32 %storemerge1921.lcssa25.3, i32* @d, align 4 141 %dec16 = add nsw i32 %storemerge23, -1 142 store i32 %dec16, i32* @a, align 4 143 %tobool = icmp eq i32 %dec16, 0 144 br i1 %tobool, label %cleanup.loopexit, label %outer.loop 145} 146