s/UpdateDT/ModifiedDT/g
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@128211 91177308-0d34-0410-b5e6-96231b3b80d8
diff --git a/lib/Transforms/Scalar/CodeGenPrepare.cpp b/lib/Transforms/Scalar/CodeGenPrepare.cpp
index 37b9783..fc7e136 100644
--- a/lib/Transforms/Scalar/CodeGenPrepare.cpp
+++ b/lib/Transforms/Scalar/CodeGenPrepare.cpp
@@ -81,9 +81,9 @@
/// multiple load/stores of the same address.
DenseMap<Value*, Value*> SunkAddrs;
- /// UpdateDT - If CFG is modified in anyway, dominator tree may need to
+ /// ModifiedDT - If CFG is modified in anyway, dominator tree may need to
/// be updated.
- bool UpdateDT;
+ bool ModifiedDT;
public:
static char ID; // Pass identification, replacement for typeid
@@ -124,7 +124,7 @@
bool CodeGenPrepare::runOnFunction(Function &F) {
bool EverMadeChange = false;
- UpdateDT = false;
+ ModifiedDT = false;
DT = getAnalysisIfAvailable<DominatorTree>();
PFI = getAnalysisIfAvailable<ProfileInfo>();
@@ -150,11 +150,11 @@
MadeChange |= ConstantFoldTerminator(BB);
if (MadeChange)
- UpdateDT = true;
+ ModifiedDT = true;
EverMadeChange |= MadeChange;
}
- if (UpdateDT && DT)
+ if (ModifiedDT && DT)
DT->DT->recalculate(F);
return EverMadeChange;
@@ -331,7 +331,7 @@
// The PHIs are now updated, change everything that refers to BB to use
// DestBB and remove BB.
BB->replaceAllUsesWith(DestBB);
- if (DT && !UpdateDT) {
+ if (DT && !ModifiedDT) {
BasicBlock *BBIDom = DT->getNode(BB)->getIDom()->getBlock();
BasicBlock *DestBBIDom = DT->getNode(DestBB)->getIDom()->getBlock();
BasicBlock *NewIDom = DT->findNearestCommonDominator(BBIDom, DestBBIDom);
@@ -535,7 +535,7 @@
WeakVH IterHandle(CurInstIterator);
ReplaceAndSimplifyAllUses(CI, RetVal, TLI ? TLI->getTargetData() : 0,
- UpdateDT ? 0 : DT);
+ ModifiedDT ? 0 : DT);
// If the iterator instruction was recursively deleted, start over at the
// start of the block.
@@ -669,7 +669,7 @@
// Duplicate the return into CallBB.
(void)FoldReturnIntoUncondBranch(RI, BB, CallBB);
- UpdateDT = Changed = true;
+ ModifiedDT = Changed = true;
++NumRetsDup;
}