1 ; THis testcase caused an assertion failure because a PHI node did not have
2 ; entries for it's postdominator. But I think this can only happen when the
3 ; PHI node is dead, so we just avoid patching up dead PHI nodes.
5 ; RUN: as < %s | opt -adce
8 target pointersize = 32
10 implementation ; Functions:
13 entry: ; No predecessors!
16 loopentry: ; preds = %entry, %endif
17 %k.1 = phi int [ %k.0, %endif ], [ 0, %entry ] ; <int> [#uses=1]
18 br bool false, label %no_exit, label %return
20 no_exit: ; preds = %loopentry
21 br bool false, label %then, label %else
23 then: ; preds = %no_exit
26 else: ; preds = %no_exit
27 %dec = add int %k.1, -1 ; <int> [#uses=1]
30 endif: ; preds = %else, %then
31 %k.0 = phi int [ %dec, %else ], [ 0, %then ] ; <int> [#uses=1]
32 store int 2, int* null
35 return: ; preds = %loopentry