forked from OSchip/llvm-project
Reduce use list thrashing by using DenseMap's find_as for maps with ValueHandle keys.
No functionality change. llvm-svn: 159497
This commit is contained in:
parent
58d547200e
commit
e2ef47c145
|
@ -501,7 +501,7 @@ void AliasSetTracker::deleteValue(Value *PtrVal) {
|
|||
}
|
||||
|
||||
// First, look up the PointerRec for this pointer.
|
||||
PointerMapType::iterator I = PointerMap.find(PtrVal);
|
||||
PointerMapType::iterator I = PointerMap.find_as(PtrVal);
|
||||
if (I == PointerMap.end()) return; // Noop
|
||||
|
||||
// If we found one, remove the pointer from the alias set it is in.
|
||||
|
@ -527,7 +527,7 @@ void AliasSetTracker::copyValue(Value *From, Value *To) {
|
|||
AA.copyValue(From, To);
|
||||
|
||||
// First, look up the PointerRec for this pointer.
|
||||
PointerMapType::iterator I = PointerMap.find(From);
|
||||
PointerMapType::iterator I = PointerMap.find_as(From);
|
||||
if (I == PointerMap.end())
|
||||
return; // Noop
|
||||
assert(I->second->hasAliasSet() && "Dead entry?");
|
||||
|
@ -536,7 +536,7 @@ void AliasSetTracker::copyValue(Value *From, Value *To) {
|
|||
if (Entry.hasAliasSet()) return; // Already in the tracker!
|
||||
|
||||
// Add it to the alias set it aliases...
|
||||
I = PointerMap.find(From);
|
||||
I = PointerMap.find_as(From);
|
||||
AliasSet *AS = I->second->getAliasSet(*this);
|
||||
AS->addPointer(*this, Entry, I->second->getSize(),
|
||||
I->second->getTBAAInfo(),
|
||||
|
|
|
@ -2726,7 +2726,7 @@ const SCEV *ScalarEvolution::getCouldNotCompute() {
|
|||
const SCEV *ScalarEvolution::getSCEV(Value *V) {
|
||||
assert(isSCEVable(V->getType()) && "Value is not SCEVable!");
|
||||
|
||||
ValueExprMapType::const_iterator I = ValueExprMap.find(V);
|
||||
ValueExprMapType::const_iterator I = ValueExprMap.find_as(V);
|
||||
if (I != ValueExprMap.end()) return I->second;
|
||||
const SCEV *S = createSCEV(V);
|
||||
|
||||
|
@ -2963,7 +2963,7 @@ ScalarEvolution::ForgetSymbolicName(Instruction *PN, const SCEV *SymName) {
|
|||
if (!Visited.insert(I)) continue;
|
||||
|
||||
ValueExprMapType::iterator It =
|
||||
ValueExprMap.find(static_cast<Value *>(I));
|
||||
ValueExprMap.find_as(static_cast<Value *>(I));
|
||||
if (It != ValueExprMap.end()) {
|
||||
const SCEV *Old = It->second;
|
||||
|
||||
|
@ -3020,7 +3020,7 @@ const SCEV *ScalarEvolution::createNodeForPHI(PHINode *PN) {
|
|||
if (BEValueV && StartValueV) {
|
||||
// While we are analyzing this PHI node, handle its value symbolically.
|
||||
const SCEV *SymbolicName = getUnknown(PN);
|
||||
assert(ValueExprMap.find(PN) == ValueExprMap.end() &&
|
||||
assert(ValueExprMap.find_as(PN) == ValueExprMap.end() &&
|
||||
"PHI node already processed?");
|
||||
ValueExprMap.insert(std::make_pair(SCEVCallbackVH(PN, this), SymbolicName));
|
||||
|
||||
|
@ -4084,7 +4084,7 @@ ScalarEvolution::getBackedgeTakenInfo(const Loop *L) {
|
|||
if (!Visited.insert(I)) continue;
|
||||
|
||||
ValueExprMapType::iterator It =
|
||||
ValueExprMap.find(static_cast<Value *>(I));
|
||||
ValueExprMap.find_as(static_cast<Value *>(I));
|
||||
if (It != ValueExprMap.end()) {
|
||||
const SCEV *Old = It->second;
|
||||
|
||||
|
@ -4135,7 +4135,8 @@ void ScalarEvolution::forgetLoop(const Loop *L) {
|
|||
Instruction *I = Worklist.pop_back_val();
|
||||
if (!Visited.insert(I)) continue;
|
||||
|
||||
ValueExprMapType::iterator It = ValueExprMap.find(static_cast<Value *>(I));
|
||||
ValueExprMapType::iterator It =
|
||||
ValueExprMap.find_as(static_cast<Value *>(I));
|
||||
if (It != ValueExprMap.end()) {
|
||||
forgetMemoizedResults(It->second);
|
||||
ValueExprMap.erase(It);
|
||||
|
@ -4168,7 +4169,8 @@ void ScalarEvolution::forgetValue(Value *V) {
|
|||
I = Worklist.pop_back_val();
|
||||
if (!Visited.insert(I)) continue;
|
||||
|
||||
ValueExprMapType::iterator It = ValueExprMap.find(static_cast<Value *>(I));
|
||||
ValueExprMapType::iterator It =
|
||||
ValueExprMap.find_as(static_cast<Value *>(I));
|
||||
if (It != ValueExprMap.end()) {
|
||||
forgetMemoizedResults(It->second);
|
||||
ValueExprMap.erase(It);
|
||||
|
|
Loading…
Reference in New Issue