1; RUN: opt < %s -loop-reduce -S | grep phi | count 2 2; PR 2779 3 4; Provide legal integer types. 5target datalayout = "n8:16:32:64" 6 7@g_19 = common global i32 0 ; <i32*> [#uses=3] 8@"\01LC" = internal constant [4 x i8] c"%d\0A\00" ; <[4 x i8]*> [#uses=1] 9 10define i32 @func_8(i8 zeroext %p_9) nounwind { 11entry: 12 ret i32 1 13} 14 15define i32 @func_3(i8 signext %p_5) nounwind { 16entry: 17 ret i32 1 18} 19 20define void @func_1() nounwind { 21entry: 22 br label %bb 23 24bb: ; preds = %bb, %entry 25 %indvar = phi i16 [ 0, %entry ], [ %indvar.next, %bb ] ; <i16> [#uses=2] 26 %tmp = sub i16 0, %indvar ; <i16> [#uses=1] 27 %tmp27 = trunc i16 %tmp to i8 ; <i8> [#uses=1] 28 load i32, i32* @g_19, align 4 ; <i32>:0 [#uses=2] 29 add i32 %0, 1 ; <i32>:1 [#uses=1] 30 store i32 %1, i32* @g_19, align 4 31 trunc i32 %0 to i8 ; <i8>:2 [#uses=1] 32 tail call i32 @func_8( i8 zeroext %2 ) nounwind ; <i32>:3 [#uses=0] 33 shl i8 %tmp27, 2 ; <i8>:4 [#uses=1] 34 add i8 %4, -112 ; <i8>:5 [#uses=1] 35 tail call i32 @func_3( i8 signext %5 ) nounwind ; <i32>:6 [#uses=0] 36 %indvar.next = add i16 %indvar, 1 ; <i16> [#uses=2] 37 %exitcond = icmp eq i16 %indvar.next, -28 ; <i1> [#uses=1] 38 br i1 %exitcond, label %return, label %bb 39 40return: ; preds = %bb 41 ret void 42} 43 44define i32 @main() nounwind { 45entry: 46 tail call void @func_1( ) nounwind 47 load i32, i32* @g_19, align 4 ; <i32>:0 [#uses=1] 48 tail call i32 (i8*, ...) @printf( i8* getelementptr ([4 x i8], [4 x i8]* @"\01LC", i32 0, i32 0), i32 %0 ) nounwind ; <i32>:1 [#uses=0] 49 ret i32 0 50} 51 52declare i32 @printf(i8*, ...) nounwind 53