RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-02-10 14:36:12 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

convert cycle checker to smallptrset, add comments and make it

Browse Source 
more elegant.

llvm-svn: 97059
This commit is contained in:
Chris Lattner 2010-02-24 21:34:04 +00:00
parent fbafa903b5
commit 75062cedf7
1 changed files with 20 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
lib/CodeGen/SelectionDAG/SelectionDAG.cpp
View File

@ -6343,36 +6343,36 @@ bool ShuffleVectorSDNode::isSplatMask(const int *Mask, EVT VT) {
return true;
}
#ifdef XDEBUG
static void checkForCyclesHelper(const SDNode *N,
std::set<const SDNode *> &visited,
std::set<const SDNode *> &checked) {
if (checked.find(N) != checked.end())
SmallPtrSet<const SDNode*, 32> &Visited,
SmallPtrSet<const SDNode*, 32> &Checked) {
// If this node has already been checked, don't check it again.
if (Checked.count(N))
return;
if (visited.find(N) != visited.end()) {
// If a node has already been visited on this depth-first walk, reject it as
// a cycle.
if (!Visited.insert(N)) {
dbgs() << "Offending node:\n";
N->dumprFull();
assert(0 && "Detected cycle in SelectionDAG");
errs() << "Detected cycle in SelectionDAG\n";
abort();
}
std::set<const SDNode*>::iterator i;
bool inserted;
tie(i, inserted) = visited.insert(N);
assert(inserted && "Missed cycle");
for(unsigned i = 0; i < N->getNumOperands(); ++i) {
checkForCyclesHelper(N->getOperand(i).getNode(), visited, checked);
}
visited.erase(i);
checked.insert(N);
for(unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
checkForCyclesHelper(N->getOperand(i).getNode(), Visited, Checked);
Checked.insert(N);
Visited.erase(N);
}
#endif
void llvm::checkForCycles(const llvm::SDNode *N) {
#ifdef XDEBUG
assert(N && "Checking nonexistant SDNode");
std::set<const SDNode *> visited;
std::set<const SDNode *> checked;
SmallPtrSet<const SDNode*, 32> visited;
SmallPtrSet<const SDNode*, 32> checked;
checkForCyclesHelper(N, visited, checked);
#endif
}