28 lines · plain
1; RUN: opt < %s -loop-reduce -S | grep phi | count 12 3; This should only result in one PHI node!4 5; void foo(double *D, double *E, double F) {6; while (D != E)7; *D++ = F;8; }9 10define void @foo(ptr %D, ptr %E, double %F) nounwind {11entry:12 %tmp.24 = icmp eq ptr %D, %E ; <i1> [#uses=1]13 br i1 %tmp.24, label %return, label %no_exit14no_exit: ; preds = %no_exit, %entry15 %indvar = phi i32 [ 0, %entry ], [ %indvar.next, %no_exit ] ; <i32> [#uses=2]16 %D_addr.0.0.rec = bitcast i32 %indvar to i32 ; <i32> [#uses=2]17 %D_addr.0.0 = getelementptr double, ptr %D, i32 %D_addr.0.0.rec ; <ptr> [#uses=1]18 %inc.rec = add i32 %D_addr.0.0.rec, 1 ; <i32> [#uses=1]19 %inc = getelementptr double, ptr %D, i32 %inc.rec ; <ptr> [#uses=1]20 store double %F, ptr %D_addr.0.021 %tmp.2 = icmp eq ptr %inc, %E ; <i1> [#uses=1]22 %indvar.next = add i32 %indvar, 1 ; <i32> [#uses=1]23 br i1 %tmp.2, label %return, label %no_exit24return: ; preds = %no_exit, %entry25 ret void26}27 28