1 ; RUN: opt < %s -S -indvars -loop-unroll | FileCheck %s 2 ; 3 ; loop-unroll fully unrolls the inner loop, creating an interesting 4 ; chain of multiplication. indvars forces SCEV to run again on the 5 ; outer loop. While reducing the recurrence at %mul3, unsigned integer overflow 6 ; causes one of the terms to reach zero. This forces all multiples in 7 ; the recurrence to be zero, reducing the whole thing to a constant expression. 8 ; 9 ; PR12929: cast<Ty>() argument of incompatible type 10 11 ; CHECK: @func 12 ; CHECK: for.cond: 13 ; CHECK: %inc1 = phi i8 [ 0, %entry ], [ %0, %for.body ] 14 ; CHECK: br label %for.body 15 16 ; CHECK: for.body: 17 ; CHECK: %inc.9 = add i8 %inc.8, 1 18 ; CHECK: %0 = add i8 %inc1, 10 19 ; CHECK: br label %for.cond 20 21 target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128" 22 define void @func() noreturn nounwind uwtable ssp { 23 entry: 24 br label %for.cond 25 26 for.cond.loopexit: ; preds = %for.body 27 %mul.lcssa = phi i8 [ %mul, %for.body ] 28 %0 = add i8 %inc1, 10 29 %indvars.iv.next = add i8 %indvars.iv, 10 30 br label %for.cond 31 32 for.cond: ; preds = %for.cond.loopexit, %entry 33 %indvars.iv = phi i8 [ %indvars.iv.next, %for.cond.loopexit ], [ 10, %entry ] 34 %mul3 = phi i8 [ undef, %entry ], [ %mul.lcssa, %for.cond.loopexit ] 35 %inc1 = phi i8 [ 0, %entry ], [ %0, %for.cond.loopexit ] 36 br label %for.body 37 38 for.body: ; preds = %for.body, %for.cond 39 %inc26 = phi i8 [ %inc1, %for.cond ], [ %inc, %for.body ] 40 %mul45 = phi i8 [ %mul3, %for.cond ], [ %mul, %for.body ] 41 %inc = add i8 %inc26, 1 42 %mul = mul i8 %inc26, %mul45 43 %exitcond = icmp ne i8 %inc, %indvars.iv 44 br i1 %exitcond, label %for.body, label %for.cond.loopexit 45 } 46
