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

The first PHI node may be null, scan for the first non-null one

Browse Source 
llvm-svn: 8865
This commit is contained in:
Chris Lattner 2003-10-05 05:34:39 +00:00
parent a5fd39ee21
commit ada012bfcd
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
lib/Transforms/Utils/PromoteMemoryToRegister.cpp
View File

@ -158,7 +158,10 @@ void PromoteMem2Reg::run() {
// Only do work here if there the PHI nodes are missing incoming values. We
// know that all PHI nodes that were inserted in a block will have the same
// number of incoming values, so we can just check any PHI node.
PHINode *FirstPHI = PNs[0];
PHINode *FirstPHI;
for (unsigned i = 0; (FirstPHI = PNs[i]) == 0; ++i)
/*empty*/;
if (Preds.size() != FirstPHI->getNumIncomingValues()) {
// Ok, now we know that all of the PHI nodes are missing entries for some
// basic blocks. Start by sorting the incoming predecessors for efficient