From: Chris Lattner Date: Sun, 30 Nov 2008 02:30:50 +0000 (+0000) Subject: introduce a typedef, no functionality change. X-Git-Tag: android-x86-6.0-r1~1003^2~24200 X-Git-Url: http://git.osdn.net/view?a=commitdiff_plain;h=25f4b2b7a3f1f2bbaf954257e7834ba29a6ede7c;p=android-x86%2Fexternal-llvm.git introduce a typedef, no functionality change. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60272 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/include/llvm/Analysis/MemoryDependenceAnalysis.h b/include/llvm/Analysis/MemoryDependenceAnalysis.h index 01a731730c5..66e2f429c91 100644 --- a/include/llvm/Analysis/MemoryDependenceAnalysis.h +++ b/include/llvm/Analysis/MemoryDependenceAnalysis.h @@ -127,10 +127,13 @@ namespace llvm { typedef DenseMap LocalDepMapType; LocalDepMapType LocalDeps; + typedef DenseMap NonLocalDepInfo; + + // A map from instructions to their non-local dependencies. typedef DenseMap*> NonLocalDepMapType; + NonLocalDepInfo*> NonLocalDepMapType; NonLocalDepMapType NonLocalDeps; // A reverse mapping from dependencies to the dependees. This is diff --git a/lib/Analysis/MemoryDependenceAnalysis.cpp b/lib/Analysis/MemoryDependenceAnalysis.cpp index 01af42c8636..25e978d3aff 100644 --- a/lib/Analysis/MemoryDependenceAnalysis.cpp +++ b/lib/Analysis/MemoryDependenceAnalysis.cpp @@ -227,10 +227,10 @@ getNonLocalDependency(Instruction *QueryInst, MemDepResult> > &Result) { assert(getDependency(QueryInst).isNonLocal() && "getNonLocalDependency should only be used on insts with non-local deps!"); - DenseMap* &CacheP = NonLocalDeps[QueryInst]; - if (CacheP == 0) CacheP = new DenseMap(); + NonLocalDepInfo *&CacheP = NonLocalDeps[QueryInst]; + if (CacheP == 0) CacheP = new NonLocalDepInfo(); - DenseMap &Cache = *CacheP; + NonLocalDepInfo &Cache = *CacheP; /// DirtyBlocks - This is the set of blocks that need to be recomputed. In /// the cached case, this can happen due to instructions being deleted etc. In @@ -243,8 +243,8 @@ getNonLocalDependency(Instruction *QueryInst, // determine what is dirty, seeding our initial DirtyBlocks worklist. // FIXME: In the "don't need to be updated" case, this is expensive, why not // have a per-"cache" flag saying it is undirty? - for (DenseMap::iterator I = Cache.begin(), - E = Cache.end(); I != E; ++I) + for (NonLocalDepInfo::iterator I = Cache.begin(), E = Cache.end(); + I != E; ++I) if (I->second.getInt() == Dirty) DirtyBlocks.push_back(I->first); @@ -303,8 +303,7 @@ getNonLocalDependency(Instruction *QueryInst, // Copy the result into the output set. - for (DenseMap::iterator I = Cache.begin(), - E = Cache.end(); I != E; ++I) + for (NonLocalDepInfo::iterator I = Cache.begin(), E = Cache.end(); I != E;++I) Result.push_back(std::make_pair(I->first, ConvToResult(I->second))); } @@ -316,9 +315,9 @@ void MemoryDependenceAnalysis::removeInstruction(Instruction *RemInst) { // for any cached queries. NonLocalDepMapType::iterator NLDI = NonLocalDeps.find(RemInst); if (NLDI != NonLocalDeps.end()) { - DenseMap &BlockMap = *NLDI->second; - for (DenseMap::iterator DI = - BlockMap.begin(), DE = BlockMap.end(); DI != DE; ++DI) + NonLocalDepInfo &BlockMap = *NLDI->second; + for (NonLocalDepInfo::iterator DI = BlockMap.begin(), DE = BlockMap.end(); + DI != DE; ++DI) if (Instruction *Inst = DI->second.getPointer()) ReverseNonLocalDeps[Inst].erase(RemInst); delete &BlockMap; @@ -389,11 +388,11 @@ void MemoryDependenceAnalysis::removeInstruction(Instruction *RemInst) { I != E; ++I) { assert(*I != RemInst && "Already removed NonLocalDep info for RemInst"); - DenseMap &INLD = *NonLocalDeps[*I]; + NonLocalDepInfo &INLD = *NonLocalDeps[*I]; assert(&INLD != 0 && "Reverse mapping out of date?"); - for (DenseMap::iterator - DI = INLD.begin(), DE = INLD.end(); DI != DE; ++DI) { + for (NonLocalDepInfo::iterator DI = INLD.begin(), DE = INLD.end(); + DI != DE; ++DI) { if (DI->second.getPointer() != RemInst) continue; // Convert to a dirty entry for the subsequent instruction. @@ -436,9 +435,9 @@ void MemoryDependenceAnalysis::verifyRemoved(Instruction *D) const { for (NonLocalDepMapType::const_iterator I = NonLocalDeps.begin(), E = NonLocalDeps.end(); I != E; ++I) { assert(I->first != D && "Inst occurs in data structures"); - DenseMap &INLD = *I->second; - for (DenseMap::iterator II = INLD.begin(), - EE = INLD.end(); II != EE; ++II) + NonLocalDepInfo &INLD = *I->second; + for (NonLocalDepInfo::iterator II = INLD.begin(), EE = INLD.end(); + II != EE; ++II) assert(II->second.getPointer() != D && "Inst occurs in data structures"); }