http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-
20050801/027345.html
This breaks real programs and only fixes an obscure regression testcase. A
real fix is in development.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22606
91177308-0d34-0410-b5e6-
96231b3b80d8
// Move all PHI nodes in BB to Succ if they are alive, otherwise
// delete them.
while (PHINode *PN = dyn_cast<PHINode>(&BB->front()))
- if (PN->use_empty() || Succ->getSinglePredecessor() == 0) {
+ if (PN->use_empty() /*|| Succ->getSinglePredecessor() == 0*/) {
// We can only move the PHI node into Succ if BB dominates Succ.
// Since BB only has a single successor (Succ), the PHI nodes
// will dominate Succ, unless Succ has multiple predecessors. In