RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-22 12:08:33 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Disable this patch:

Browse Source 
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
This commit is contained in:
Chris Lattner 2005-08-02 23:31:38 +00:00
parent f5e982daa8
commit 17de414965
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
lib/Transforms/Utils/SimplifyCFG.cpp
View File

@ -894,7 +894,7 @@ bool llvm::SimplifyCFG(BasicBlock *BB) {
// 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