6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-11-02 07:11:49 +00:00
Code Issues Projects Releases Wiki Activity

Cleanup. Remove an extraneous GraphTraits specialization.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@137264 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Andrew Trick 2011-08-10 22:55:39 +00:00
parent de2f526c7c
commit d8a2f3ab91
1 changed files with 5 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
include/llvm/Analysis/LoopIterator.h
View File

@ -109,27 +109,11 @@ public:
}
};
/// Define a graph of blocks within a loop. Allows LoopBlocksTraversal to
/// use the generic po_iterator with specialized GraphTraits.
struct LoopBlocksGraph {
Loop *L;
LoopBlocksGraph(Loop *Container) : L(Container) {}
};
template<> struct GraphTraits<LoopBlocksGraph> :
public GraphTraits<BasicBlock*> {
static BasicBlock *getEntryNode(LoopBlocksGraph G) {
return G.L->getHeader();
}
};
/// Traverse the blocks in a loop using a depth-first search.
class LoopBlocksTraversal {
public:
/// Graph traversal iterator.
typedef po_iterator<LoopBlocksGraph, LoopBlocksTraversal, true> POTIterator;
typedef po_iterator<BasicBlock*, LoopBlocksTraversal, true> POTIterator;
private:
LoopBlocksDFS &DFS;
@ -144,10 +128,12 @@ public:
/// finishPostorder to record the DFS result.
POTIterator begin() {
assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing");
return po_ext_begin(LoopBlocksGraph(DFS.L), *this);
assert(DFS.L->getNumBlocks() && "po_iterator cannot handle an empty graph");
return po_ext_begin(DFS.L->getHeader(), *this);
}
POTIterator end() {
return po_ext_end(LoopBlocksGraph(DFS.L), *this);
// po_ext_end interface requires a basic block, but ignores its value.
return po_ext_end(DFS.L->getHeader(), *this);
}
/// Called by po_iterator upon reaching a block via a CFG edge. If this block