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 declare void @use(i8 %x) 12 13 ; CHECK: @func 14 ; CHECK: for.cond: 15 ; CHECK: %inc1 = phi i8 [ 0, %entry ], [ %0, %for.body ] 16 ; CHECK: br label %for.body 17 18 ; CHECK: for.body: 19 ; CHECK: %inc.9 = add i8 %inc.8, 1 20 ; CHECK: %0 = add i8 %inc1, 10 21 ; CHECK: br label %for.cond 22 23 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" 24 define void @func() noreturn nounwind uwtable ssp { 25 entry: 26 br label %for.cond 27 28 for.cond.loopexit: ; preds = %for.body 29 %mul.lcssa = phi i8 [ %mul, %for.body ] 30 %0 = add i8 %inc1, 10 31 %indvars.iv.next = add i8 %indvars.iv, 10 32 br label %for.cond 33 34 for.cond: ; preds = %for.cond.loopexit, %entry 35 %indvars.iv = phi i8 [ %indvars.iv.next, %for.cond.loopexit ], [ 10, %entry ] 36 %mul3 = phi i8 [ undef, %entry ], [ %mul.lcssa, %for.cond.loopexit ] 37 %inc1 = phi i8 [ 0, %entry ], [ %0, %for.cond.loopexit ] 38 call void @use(i8 %inc1) 39 br label %for.body 40 41 for.body: ; preds = %for.body, %for.cond 42 %inc26 = phi i8 [ %inc1, %for.cond ], [ %inc, %for.body ] 43 %mul45 = phi i8 [ %mul3, %for.cond ], [ %mul, %for.body ] 44 %inc = add i8 %inc26, 1 45 %mul = mul i8 %inc26, %mul45 46 call void @use(i8 %inc) 47 %exitcond = icmp ne i8 %inc, %indvars.iv 48 br i1 %exitcond, label %for.body, label %for.cond.loopexit 49 } 50
