RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-13 23:20:41 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

rename GetValueInBlock -> GetValueAtEndOfBlock to better reflect

Browse Source 
what it does.

llvm-svn: 83740
This commit is contained in:
Chris Lattner 2009-10-10 22:41:58 +00:00
parent 1f9ff55cbc
commit 9899ce267c
2 changed files with 15 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
include/llvm/Transforms/Utils/SSAUpdater.h
View File

@ -52,16 +52,16 @@ public:
/// specified block with the specified value.
void AddAvailableValue(BasicBlock *BB, Value *V);
/// GetValueInBlock - Construct SSA form, materializing a value in the
/// specified block.
Value *GetValueInBlock(BasicBlock *BB);
/// GetValueAtEndOfBlock - Construct SSA form, materializing a value that is
/// live at the end of the specified block.
Value *GetValueAtEndOfBlock(BasicBlock *BB);
/// RewriteUse - Rewrite a use of the symbolic value. This handles PHI nodes,
/// which use their value in the corresponding predecessor.
void RewriteUse(Use &U);
private:
Value *GetValueInBlockInternal(BasicBlock *BB);
Value *GetValueAtEndOfBlockInternal(BasicBlock *BB);
void operator=(const SSAUpdater&); // DO NOT IMPLEMENT
SSAUpdater(const SSAUpdater&); // DO NOT IMPLEMENT
};

22
lib/Transforms/Utils/SSAUpdater.cpp
View File

@ -64,11 +64,11 @@ void SSAUpdater::AddAvailableValue(BasicBlock *BB, Value *V) {
getAvailableVals(AV)[BB] = V;
}
/// GetValueInBlock - Construct SSA form, materializing a value in the
/// GetValueAtEndOfBlock - Construct SSA form, materializing a value in the
/// specified block.
Value *SSAUpdater::GetValueInBlock(BasicBlock *BB) {
Value *SSAUpdater::GetValueAtEndOfBlock(BasicBlock *BB) {
assert(getIncomingPredInfo(IPI).empty() && "Unexpected Internal State");
Value *Res = GetValueInBlockInternal(BB);
Value *Res = GetValueAtEndOfBlockInternal(BB);
assert(getIncomingPredInfo(IPI).empty() && "Unexpected Internal State");
return Res;
}
@ -81,16 +81,16 @@ void SSAUpdater::RewriteUse(Use &U) {
if (PHINode *UserPN = dyn_cast<PHINode>(User))
UseBB = UserPN->getIncomingBlock(U);
U.set(GetValueInBlock(UseBB));
U.set(GetValueAtEndOfBlock(UseBB));
}
/// GetValueInBlock - Check to see if AvailableVals has an entry for the
/// specified BB and if so, return it. If not, construct SSA form by walking
/// predecessors inserting PHI nodes as needed until we get to a block where the
/// value is available.
/// GetValueAtEndOfBlockInternal - Check to see if AvailableVals has an entry
/// for the specified BB and if so, return it. If not, construct SSA form by
/// walking predecessors inserting PHI nodes as needed until we get to a block
/// where the value is available.
///
Value *SSAUpdater::GetValueInBlockInternal(BasicBlock *BB) {
Value *SSAUpdater::GetValueAtEndOfBlockInternal(BasicBlock *BB) {
AvailableValsTy &AvailableVals = getAvailableVals(AV);
// Query AvailableVals by doing an insertion of null.
@ -138,7 +138,7 @@ Value *SSAUpdater::GetValueInBlockInternal(BasicBlock *BB) {
if (PHINode *SomePhi = dyn_cast<PHINode>(BB->begin())) {
for (unsigned i = 0, e = SomePhi->getNumIncomingValues(); i != e; ++i) {
BasicBlock *PredBB = SomePhi->getIncomingBlock(i);
Value *PredVal = GetValueInBlockInternal(PredBB);
Value *PredVal = GetValueAtEndOfBlockInternal(PredBB);
IncomingPredInfo.push_back(std::make_pair(PredBB, PredVal));
// Compute SingularValue.
@ -151,7 +151,7 @@ Value *SSAUpdater::GetValueInBlockInternal(BasicBlock *BB) {
bool isFirstPred = true;
for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) {
BasicBlock *PredBB = *PI;
Value *PredVal = GetValueInBlockInternal(PredBB);
Value *PredVal = GetValueAtEndOfBlockInternal(PredBB);
IncomingPredInfo.push_back(std::make_pair(PredBB, PredVal));
// Compute SingularValue.