mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 03:33:20 +01:00
recommit 96626, evidence that it broke things appears
to be spurious llvm-svn: 96662
This commit is contained in:
parent
80491f4c52
commit
0f58c73229
@ -586,6 +586,11 @@ namespace llvm {
|
||||
/// compute a trip count, or if the loop is deleted.
|
||||
void forgetLoop(const Loop *L);
|
||||
|
||||
/// forgetValue - This method should be called by the client when it has
|
||||
/// changed a value in a way that may effect its value, or which may
|
||||
/// disconnect it from a def-use chain linking it to a loop.
|
||||
void forgetValue(Value *V);
|
||||
|
||||
/// GetMinTrailingZeros - Determine the minimum number of zero bits that S
|
||||
/// is guaranteed to end in (at every loop iteration). It is, at the same
|
||||
/// time, the minimum number of times S is divisible by 2. For example,
|
||||
|
@ -3485,6 +3485,35 @@ void ScalarEvolution::forgetLoop(const Loop *L) {
|
||||
}
|
||||
}
|
||||
|
||||
/// forgetValue - This method should be called by the client when it has
|
||||
/// changed a value in a way that may effect its value, or which may
|
||||
/// disconnect it from a def-use chain linking it to a loop.
|
||||
void ScalarEvolution::forgetValue(Value *V) {
|
||||
Instruction *I = dyn_cast<Instruction>(V);
|
||||
if (!I) return;
|
||||
|
||||
// Drop information about expressions based on loop-header PHIs.
|
||||
SmallVector<Instruction *, 16> Worklist;
|
||||
Worklist.push_back(I);
|
||||
|
||||
SmallPtrSet<Instruction *, 8> Visited;
|
||||
while (!Worklist.empty()) {
|
||||
I = Worklist.pop_back_val();
|
||||
if (!Visited.insert(I)) continue;
|
||||
|
||||
std::map<SCEVCallbackVH, const SCEV *>::iterator It =
|
||||
Scalars.find(static_cast<Value *>(I));
|
||||
if (It != Scalars.end()) {
|
||||
ValuesAtScopes.erase(It->second);
|
||||
Scalars.erase(It);
|
||||
if (PHINode *PN = dyn_cast<PHINode>(I))
|
||||
ConstantEvolutionLoopExitValue.erase(PN);
|
||||
}
|
||||
|
||||
PushDefUseChildren(I, Worklist);
|
||||
}
|
||||
}
|
||||
|
||||
/// ComputeBackedgeTakenCount - Compute the number of times the backedge
|
||||
/// of the specified loop will execute.
|
||||
ScalarEvolution::BackedgeTakenInfo
|
||||
|
@ -246,6 +246,13 @@ void IndVarSimplify::RewriteLoopExitValues(Loop *L,
|
||||
if (!PN->getType()->isIntegerTy() && !PN->getType()->isPointerTy())
|
||||
continue;
|
||||
|
||||
// It's necessary to tell ScalarEvolution about this explicitly so that
|
||||
// it can walk the def-use list and forget all SCEVs, as it may not be
|
||||
// watching the PHI itself. Once the new exit value is in place, there
|
||||
// may not be a def-use connection between the loop and every instruction
|
||||
// which got a SCEVAddRecExpr for that loop.
|
||||
SE->forgetValue(PN);
|
||||
|
||||
// Iterate over all of the values in all the PHI nodes.
|
||||
for (unsigned i = 0; i != NumPreds; ++i) {
|
||||
// If the value being merged in is not integer or is not defined
|
||||
|
Loading…
Reference in New Issue
Block a user