6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-08-22 10:29:35 +00:00
Code Issues Projects Releases Wiki Activity

rename "ping" to "verifyRemoved". I don't know why 'ping' what chosen,

Browse Source 
but it doesn't make any sense at all.

Also make the method const, private, and fit in 80 cols while we're at it.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@60215 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2008-11-28 21:42:09 +00:00
parent e85866313a
commit 8b589fa135
2 changed files with 17 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
include/llvm/Analysis/MemoryDependenceAnalysis.h
View File

@ -51,8 +51,6 @@ namespace llvm {
reverseDepMapType reverseDepNonLocal;
public:
void ping(Instruction* D);
// Special marker indicating that the query has no dependency
// in the specified block.
static Instruction* const NonLocal;
@ -104,6 +102,10 @@ namespace llvm {
void dropInstruction(Instruction* drop);
private:
/// verifyRemoved - Verify that the specified instruction does not occur
/// in our internal data structures.
void verifyRemoved(Instruction *Inst) const;
Instruction* getCallSiteDependency(CallSite C, Instruction* start,
BasicBlock* block);
void nonLocalHelper(Instruction* query, BasicBlock* block,

25
lib/Analysis/MemoryDependenceAnalysis.cpp
View File

@ -48,31 +48,32 @@ Instruction* const MemoryDependenceAnalysis::Dirty = (Instruction*)-5;
static RegisterPass<MemoryDependenceAnalysis> X("memdep",
"Memory Dependence Analysis", false, true);
void MemoryDependenceAnalysis::ping(Instruction *D) {
for (depMapType::iterator I = depGraphLocal.begin(), E = depGraphLocal.end();
I != E; ++I) {
void MemoryDependenceAnalysis::verifyRemoved(Instruction *D) const {
for (depMapType::const_iterator I = depGraphLocal.begin(),
E = depGraphLocal.end(); I != E; ++I) {
assert(I->first != D);
assert(I->second.first != D);
}
for (nonLocalDepMapType::iterator I = depGraphNonLocal.begin(), E = depGraphNonLocal.end();
I != E; ++I) {
for (nonLocalDepMapType::const_iterator I = depGraphNonLocal.begin(),
E = depGraphNonLocal.end(); I != E; ++I) {
assert(I->first != D);
for (DenseMap<BasicBlock*, Value*>::iterator II = I->second.begin(),
EE = I->second.end(); II != EE; ++II)
assert(II->second != D);
}
for (reverseDepMapType::iterator I = reverseDep.begin(), E = reverseDep.end();
I != E; ++I)
for (SmallPtrSet<Instruction*, 4>::iterator II = I->second.begin(), EE = I->second.end();
II != EE; ++II)
for (reverseDepMapType::const_iterator I = reverseDep.begin(),
E = reverseDep.end(); I != E; ++I)
for (SmallPtrSet<Instruction*, 4>::const_iterator II = I->second.begin(),
EE = I->second.end(); II != EE; ++II)
assert(*II != D);
for (reverseDepMapType::iterator I = reverseDepNonLocal.begin(), E = reverseDepNonLocal.end();
for (reverseDepMapType::const_iterator I = reverseDepNonLocal.begin(),
E = reverseDepNonLocal.end();
I != E; ++I)
for (SmallPtrSet<Instruction*, 4>::iterator II = I->second.begin(), EE = I->second.end();
II != EE; ++II)
for (SmallPtrSet<Instruction*, 4>::const_iterator II = I->second.begin(),
EE = I->second.end(); II != EE; ++II)
assert(*II != D);
}