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

* Fix bug: test/Regression/Transforms/Mem2Reg/2002-03-28-UninitializedVal.ll

Browse Source 
* Minor cleanup that was missed in last patch


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2373 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-04-28 18:39:46 +00:00
parent 9f4eb01dd4
commit 5b5df1747f
1 changed files with 12 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -146,10 +146,18 @@ bool PromoteInstance::PromoteFunction(Function *F, DominanceFrontier &DF) {
}
}
// Set the incoming values for the basic block to be null values for all of
// the alloca's. We do this in case there is a load of a value that has not
// been stored yet. In this case, it will get this null value.
//
CurrentValue.push_back(vector<Value *>(Allocas.size()));
for (unsigned i = 0, e = Allocas.size(); i != e; ++i)
CurrentValue[0][i] =
Constant::getNullValue(Allocas[i]->getType()->getElementType());
// Walks all basic blocks in the function performing the SSA rename algorithm
// and inserting the phi nodes we marked as necessary
//
CurrentValue.push_back(vector<Value *>(Allocas.size()));
traverse(F->front(), 0); // there is no predecessor of the root node
// Remove all instructions marked by being placed in the KillList...
@ -197,13 +205,13 @@ void PromoteInstance::traverse(BasicBlock *BB, BasicBlock *Pred) {
// variable we need phinodes for.
vector<PHINode *> &BBPNs = NewPhiNodes[BB];
for (unsigned k = 0; k != BBPNs.size(); ++k)
if (BBPNs[k]) {
if (PHINode *PN = BBPNs[k]) {
// at this point we can assume that the array has phi nodes.. let's add
// the incoming data
BBPNs[k]->addIncoming(TOS[k], Pred);
PN->addIncoming(TOS[k], Pred);
// also note that the active variable IS designated by the phi node
TOS[k] = BBPNs[k];
TOS[k] = PN;
}
// don't revisit nodes