6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-28 03:25:23 +00:00
Code Issues Projects Releases Wiki Activity

Pull iterators out of CFG.h and CFGdecls and put them in Support directory

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@664 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2001-09-28 22:56:31 +00:00
parent c56d779501
commit 3ff4387113
24 changed files with 284 additions and 458 deletions
Download Patch File Download Diff File Expand all files Collapse all files

68
include/llvm/BasicBlock.h
View File

@@ -24,7 +24,9 @@
#include "llvm/Value.h" // Get the definition of Value
#include "llvm/ValueHolder.h"
#include "llvm/CFGdecls.h"
#include "llvm/Support/GraphTraits.h"
#include "llvm/CFGdecls.h" // TODO FIXME: remove
class Instruction;
class Method;
@@ -140,4 +142,68 @@ public:
BasicBlock *splitBasicBlock(iterator I);
};
#include "llvm/CFG.h" // TODO FIXME when succ iterators are in BB.h
// Provide specializations of GraphTraits to be able to treat a method as a
// graph of basic blocks...
template <> struct GraphTraits<BasicBlock*> {
typedef BasicBlock NodeType;
typedef BasicBlock::succ_iterator ChildIteratorType;
static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
static inline ChildIteratorType child_begin(NodeType *N) {
return cfg::succ_begin(N);
}
static inline ChildIteratorType child_end(NodeType *N) {
return cfg::succ_end(N);
}
};
template <> struct GraphTraits<const BasicBlock*> {
typedef const BasicBlock NodeType;
typedef BasicBlock::succ_const_iterator ChildIteratorType;
static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
static inline ChildIteratorType child_begin(NodeType *N) {
return cfg::succ_begin(N);
}
static inline ChildIteratorType child_end(NodeType *N) {
return cfg::succ_end(N);
}
};
// Provide specializations of GraphTraits to be able to treat a method as a
// graph of basic blocks... and to walk it in inverse order. Inverse order for
// a method is considered to be when traversing the predecessor edges of a BB
// instead of the successor edges.
//
template <> struct GraphTraits<Inverse<BasicBlock*> > {
typedef BasicBlock NodeType;
typedef BasicBlock::pred_iterator ChildIteratorType;
static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
static inline ChildIteratorType child_begin(NodeType *N) {
return cfg::pred_begin(N);
}
static inline ChildIteratorType child_end(NodeType *N) {
return cfg::pred_end(N);
}
};
template <> struct GraphTraits<Inverse<const BasicBlock*> > {
typedef const BasicBlock NodeType;
typedef BasicBlock::pred_const_iterator ChildIteratorType;
static NodeType *getEntryNode(Inverse<const BasicBlock*> G) {
return G.Graph;
}
static inline ChildIteratorType child_begin(NodeType *N) {
return cfg::pred_begin(N);
}
static inline ChildIteratorType child_end(NodeType *N) {
return cfg::pred_end(N);
}
};
#endif