6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-05-24 18:38:50 +00:00
Code Issues Projects Releases Wiki Activity

Add some more consistency checks.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@30305 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Nick Lewycky 2006-09-13 19:32:53 +00:00
parent 977be254c6
commit 668a1d0fd2
1 changed files with 20 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
lib/Transforms/Scalar/PredicateSimplifier.cpp
View File

@ -106,6 +106,10 @@ namespace {
return leaders.empty(); return leaders.empty();
} }
unsigned countLeaders() const {
return leaders.size();
}
iterator findLeader(ElemTy e) { iterator findLeader(ElemTy e) {
typename std::map<ElemTy, unsigned>::iterator MI = mapping.find(e); typename std::map<ElemTy, unsigned>::iterator MI = mapping.find(e);
if (MI == mapping.end()) return 0; if (MI == mapping.end()) return 0;
@ -123,6 +127,7 @@ namespace {
ElemTy &getLeader(iterator I) { ElemTy &getLeader(iterator I) {
assert(I != 0 && "Element zero is out of range."); assert(I != 0 && "Element zero is out of range.");
assert(I <= leaders.size() && "Invalid iterator.");
return leaders[I-1]; return leaders[I-1];
} }
@ -133,8 +138,10 @@ namespace {
#ifdef DEBUG #ifdef DEBUG
void debug(std::ostream &os) const { void debug(std::ostream &os) const {
std::set<Value *> Unique;
for (unsigned i = 1, e = leaders.size()+1; i != e; ++i) { for (unsigned i = 1, e = leaders.size()+1; i != e; ++i) {
os << i << ". " << *leaders[i-1] << ": ["; Unique.insert(getLeader(i));
os << i << ". " << *getLeader(i) << ": [";
for (std::map<Value *, unsigned>::const_iterator for (std::map<Value *, unsigned>::const_iterator
I = mapping.begin(), E = mapping.end(); I != E; ++I) { I = mapping.begin(), E = mapping.end(); I != E; ++I) {
if ((*I).second == i && (*I).first != leaders[i-1]) { if ((*I).second == i && (*I).first != leaders[i-1]) {
@ -143,6 +150,14 @@ namespace {
} }
os << "]\n"; os << "]\n";
} }
assert(Unique.size() == leaders.size() && "Duplicate leaders.");
for (typename std::map<ElemTy, unsigned>::const_iterator
I = mapping.begin(), E = mapping.end(); I != E; ++I) {
assert(I->second != 0 && "Zero iterator in mapping.");
assert(I->second <= leaders.size() &&
"Invalid iterator found in mapping.");
}
} }
#endif #endif
@ -428,11 +443,15 @@ namespace {
void debug(std::ostream &os) const { void debug(std::ostream &os) const {
static const char *OpcodeTable[] = { "EQ", "NE" }; static const char *OpcodeTable[] = { "EQ", "NE" };
unsigned int size = union_find.countLeaders();
union_find.debug(os); union_find.debug(os);
for (std::vector<Property>::const_iterator I = Properties.begin(), for (std::vector<Property>::const_iterator I = Properties.begin(),
E = Properties.end(); I != E; ++I) { E = Properties.end(); I != E; ++I) {
os << (*I).I1 << " " << OpcodeTable[(*I).Opcode] << " " os << (*I).I1 << " " << OpcodeTable[(*I).Opcode] << " "
<< (*I).I2 << "\n"; << (*I).I2 << "\n";
assert((*I).I1 <= size && "Invalid property.");
assert((*I).I2 <= size && "Invalid property.");
} }
os << "\n"; os << "\n";
} }