1 ; RUN: opt < %s -instcombine -S | grep "phi i32" | count 2 2 3 define void @test() nounwind { 4 entry: 5 br label %bb 6 7 bb: ; preds = %bb16, %entry 8 %i.0 = phi i32 [ 0, %entry ], [ %indvar.next, %somebb ] ; <i32> [#uses=1] 9 %x.0 = phi i32 [ 37, %entry ], [ %tmp17, %somebb ] ; <i32> [#uses=1] 10 %tmp = tail call i32 (...)* @bork( ) nounwind ; <i32> [#uses=0] 11 %tmp1 = tail call i32 (...)* @bork( ) nounwind ; <i32> [#uses=0] 12 %tmp2 = tail call i32 (...)* @bork( ) nounwind ; <i32> [#uses=1] 13 %tmp3 = icmp eq i32 %tmp2, 0 ; <i1> [#uses=1] 14 br i1 %tmp3, label %bb7, label %bb5 15 16 bb5: ; preds = %bb 17 %tmp6 = tail call i32 (...)* @bork( ) nounwind ; <i32> [#uses=0] 18 br label %bb7 19 20 bb7: ; preds = %bb5, %bb 21 %tmp8 = tail call i32 (...)* @bork( ) nounwind ; <i32> [#uses=0] 22 %tmp9 = tail call i32 (...)* @bork( ) nounwind ; <i32> [#uses=0] 23 %tmp11 = icmp eq i32 %x.0, 37 ; <i1> [#uses=1] 24 br i1 %tmp11, label %bb14, label %bb16 25 26 bb14: ; preds = %bb7 27 %tmp15 = tail call i32 (...)* @bar( ) nounwind ; <i32> [#uses=0] 28 br label %bb16 29 30 bb16: ; preds = %bb14, %bb7 31 %tmp17 = tail call i32 (...)* @zap( ) nounwind ; <i32> [#uses=1] 32 %indvar.next = add i32 %i.0, 1 ; <i32> [#uses=2] 33 %exitcond = icmp eq i32 %indvar.next, 42 ; <i1> [#uses=1] 34 br i1 %exitcond, label %return, label %somebb 35 36 somebb: 37 br label %bb 38 39 return: ; preds = %bb16 40 ret void 41 } 42 43 declare i32 @bork(...) 44 45 declare i32 @bar(...) 46 47 declare i32 @zap(...) 48
