/freebsd-10.1-release/contrib/llvm/include/llvm/Support/ |
H A D | DataFlow.h | 27 typedef const Value NodeType; typedef in struct:llvm::GraphTraits 30 static NodeType *getEntryNode(const Value *G) { 34 static inline ChildIteratorType child_begin(NodeType *N) { 38 static inline ChildIteratorType child_end(NodeType *N) { 44 typedef Value NodeType; typedef in struct:llvm::GraphTraits 47 static NodeType *getEntryNode(Value *G) { 51 static inline ChildIteratorType child_begin(NodeType *N) { 55 static inline ChildIteratorType child_end(NodeType *N) { 61 typedef const Value NodeType; typedef in struct:llvm::GraphTraits 64 static NodeType *getEntryNod 82 typedef Value NodeType; typedef in struct:llvm::GraphTraits [all...] |
H A D | CFG.h | 257 typedef BasicBlock NodeType; typedef in struct:llvm::GraphTraits 260 static NodeType *getEntryNode(BasicBlock *BB) { return BB; } 261 static inline ChildIteratorType child_begin(NodeType *N) { 264 static inline ChildIteratorType child_end(NodeType *N) { 270 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits 273 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; } 275 static inline ChildIteratorType child_begin(NodeType *N) { 278 static inline ChildIteratorType child_end(NodeType *N) { 289 typedef BasicBlock NodeType; typedef in struct:llvm::GraphTraits 291 static NodeType *getEntryNod 301 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits [all...] |
H A D | GraphWriter.h | 63 typedef typename GTraits::NodeType NodeType; typedef in class:llvm::GraphWriter 70 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { 148 bool isNodeHidden(NodeType &Node) { 152 bool isNodeHidden(NodeType *const *Node) { 156 bool isNodeHidden(NodeType *Node) { 160 void writeNode(NodeType& Node) { 164 void writeNode(NodeType *const *Node) { 168 void writeNode(NodeType *Node) { 239 void writeEdge(NodeType *Nod [all...] |
/freebsd-10.1-release/contrib/llvm/include/llvm/Analysis/ |
H A D | RegionIterator.h | 33 template<class NodeType> 35 NodeType, ptrdiff_t> 37 typedef std::iterator<std::forward_iterator_tag, NodeType, ptrdiff_t> super; 50 PointerIntPair<NodeType*, 2, enum ItMode> Node; 62 NodeType* getNode() const{ return Node.getPointer(); } 87 typedef RNSuccIterator<NodeType> Self; 92 inline RNSuccIterator(NodeType* node) 107 inline RNSuccIterator(NodeType* node, bool) 165 template<class NodeType> 166 class RNSuccIterator<FlatIt<NodeType> > [all...] |
H A D | DominatorInternals.h | 34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, 35 typename GraphT::NodeType* V, unsigned N) { 56 SmallVector<std::pair<typename GraphT::NodeType*, 60 typename GraphT::NodeType* BB = Worklist.back().first; 63 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = 93 typename GraphT::NodeType* Succ = *NextSucc; 95 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &SuccVInfo = 107 typename GraphT::NodeType* 108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT, 109 typename GraphT::NodeType *VI [all...] |
H A D | Interval.h | 125 typedef Interval NodeType; typedef in struct:llvm::GraphTraits 128 static NodeType *getEntryNode(Interval *I) { return I; } 131 static inline ChildIteratorType child_begin(NodeType *N) { 134 static inline ChildIteratorType child_end(NodeType *N) { 140 typedef Interval NodeType; typedef in struct:llvm::GraphTraits 142 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; } 143 static inline ChildIteratorType child_begin(NodeType *N) { 146 static inline ChildIteratorType child_end(NodeType *N) {
|
H A D | CallGraph.h | 311 typedef CallGraphNode NodeType; typedef in struct:GraphTraits 316 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; } 318 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType; 320 static inline ChildIteratorType child_begin(NodeType *N) { 323 static inline ChildIteratorType child_end (NodeType *N) { 334 typedef const CallGraphNode NodeType; typedef in struct:GraphTraits 335 typedef NodeType::const_iterator ChildIteratorType; 337 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; } 338 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();} 339 static inline ChildIteratorType child_end (NodeType * [all...] |
H A D | Dominators.h | 183 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT, 239 void Split(DominatorTreeBase<typename GraphT::NodeType>& DT, 240 typename GraphT::NodeType* NewBB) { 244 typename GraphT::NodeType* NewBBSucc = *GraphT::child_begin(NewBB); 246 std::vector<typename GraphT::NodeType*> PredBlocks; 259 typename InvTraits::NodeType *ND = *PI; 577 friend typename GraphT::NodeType* Eval( 578 DominatorTreeBase<typename GraphT::NodeType>& DT, 579 typename GraphT::NodeType* V, 583 friend unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType> 898 typedef DomTreeNode NodeType; typedef in struct:llvm::GraphTraits [all...] |
H A D | LoopInfo.h | 714 typedef const Loop NodeType; typedef in struct:llvm::GraphTraits 717 static NodeType *getEntryNode(const Loop *L) { return L; } 718 static inline ChildIteratorType child_begin(NodeType *N) { 721 static inline ChildIteratorType child_end(NodeType *N) { 727 typedef Loop NodeType; typedef in struct:llvm::GraphTraits 730 static NodeType *getEntryNode(Loop *L) { return L; } 731 static inline ChildIteratorType child_begin(NodeType *N) { 734 static inline ChildIteratorType child_end(NodeType *N) {
|
H A D | PostDominators.h | 93 static NodeType *getEntryNode(PostDominatorTree *DT) {
|
/freebsd-10.1-release/contrib/llvm/include/llvm/ADT/ |
H A D | GraphTraits.h | 30 // typedef NodeType - Type of Node in the graph 33 // static NodeType *getEntryNode(const GraphType &) 36 // static ChildIteratorType child_begin(NodeType *) 37 // static ChildIteratorType child_end (NodeType *) 60 typedef typename GraphType::UnknownGraphTypeError NodeType; typedef in struct:llvm::GraphTraits 88 typedef typename GraphTraits<T>::NodeType NodeType; typedef in struct:llvm::GraphTraits 91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) { 95 static ChildIteratorType child_begin(NodeType* N) { 99 static ChildIteratorType child_end(NodeType* [all...] |
H A D | PostOrderIterator.h | 58 template<typename NodeType> 59 bool insertEdge(NodeType *From, NodeType *To) { 64 template<typename NodeType> 65 void finishPostorder(NodeType *BB) {} 79 template<class NodeType> 80 bool insertEdge(NodeType *From, NodeType *To) { return Visited.insert(To); } 83 template<class NodeType> 84 void finishPostorder(NodeType *B 96 typedef typename GT::NodeType NodeType; typedef in class:llvm::po_iterator 260 typedef typename GT::NodeType NodeType; typedef in class:llvm::ReversePostOrderTraversal [all...] |
H A D | SCCIterator.h | 38 std::vector<typename GT::NodeType>, ptrdiff_t> { 39 typedef typename GT::NodeType NodeType; typedef in class:llvm::scc_iterator 41 typedef std::vector<NodeType*> SccTy; 43 std::vector<typename GT::NodeType>, ptrdiff_t> super; 51 DenseMap<NodeType *, unsigned> nodeVisitNumbers; 54 std::vector<NodeType *> SCCNodeStack; 61 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack; 69 void DFSVisitOne(NodeType *N) { 84 NodeType *child [all...] |
H A D | DepthFirstIterator.h | 63 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>, 66 typename GT::NodeType, ptrdiff_t>, 69 typename GT::NodeType, ptrdiff_t> super; 71 typedef typename GT::NodeType NodeType; typedef in class:llvm::df_iterator 73 typedef PointerIntPair<NodeType*, 1> PointerIntTy; 80 inline df_iterator(NodeType *Node) { 88 inline df_iterator(NodeType *Node, SetType &S) 104 NodeType *Node = Top.first.getPointer(); 113 NodeType *Nex [all...] |
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | StmtGraphTraits.h | 28 typedef clang::Stmt NodeType; typedef in struct:llvm::GraphTraits 32 static NodeType* getEntryNode(clang::Stmt* S) { return S; } 34 static inline ChildIteratorType child_begin(NodeType* N) { 39 static inline ChildIteratorType child_end(NodeType* N) { 55 typedef const clang::Stmt NodeType; typedef in struct:llvm::GraphTraits 59 static NodeType* getEntryNode(const clang::Stmt* S) { return S; } 61 static inline ChildIteratorType child_begin(NodeType* N) { 66 static inline ChildIteratorType child_end(NodeType* N) {
|
/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | MachineLoopInfo.h | 163 typedef const MachineLoop NodeType; typedef in struct:llvm::GraphTraits 166 static NodeType *getEntryNode(const MachineLoop *L) { return L; } 167 static inline ChildIteratorType child_begin(NodeType *N) { 170 static inline ChildIteratorType child_end(NodeType *N) { 176 typedef MachineLoop NodeType; typedef in struct:llvm::GraphTraits 179 static NodeType *getEntryNode(MachineLoop *L) { return L; } 180 static inline ChildIteratorType child_begin(NodeType *N) { 183 static inline ChildIteratorType child_end(NodeType *N) {
|
H A D | MachineDominators.h | 182 typedef MachineDomTreeNode NodeType; typedef in struct:llvm::GraphTraits 183 typedef NodeType::iterator ChildIteratorType; 185 static NodeType *getEntryNode(NodeType *N) { 188 static inline ChildIteratorType child_begin(NodeType* N) { 191 static inline ChildIteratorType child_end(NodeType* N) { 198 static NodeType *getEntryNode(MachineDominatorTree *DT) {
|
H A D | MachineBasicBlock.h | 677 typedef MachineBasicBlock NodeType; typedef in struct:llvm::GraphTraits 680 static NodeType *getEntryNode(MachineBasicBlock *BB) { return BB; } 681 static inline ChildIteratorType child_begin(NodeType *N) { 684 static inline ChildIteratorType child_end(NodeType *N) { 690 typedef const MachineBasicBlock NodeType; typedef in struct:llvm::GraphTraits 693 static NodeType *getEntryNode(const MachineBasicBlock *BB) { return BB; } 694 static inline ChildIteratorType child_begin(NodeType *N) { 697 static inline ChildIteratorType child_end(NodeType *N) { 709 typedef MachineBasicBlock NodeType; typedef in struct:llvm::GraphTraits 711 static NodeType *getEntryNod 723 typedef const MachineBasicBlock NodeType; typedef in struct:llvm::GraphTraits [all...] |
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/ASTMatchers/ |
H A D | ASTMatchersMacros.h | 180 /// The variables are the same as for AST_MATCHER, but NodeType will be deduced 184 template <typename NodeType> \ 185 class matcher_##DefineMatcher##Matcher : public MatcherInterface<NodeType> { \ 187 virtual bool matches(const NodeType &Node, ASTMatchFinder *Finder, \ 197 template <typename NodeType> \ 198 bool internal::matcher_##DefineMatcher##Matcher<NodeType>::matches( \ 199 const NodeType &Node, ASTMatchFinder *Finder, \ 207 /// AST_MATCHER_P, with the addition of NodeType, which specifies the node type 208 /// of the matcher Matcher<NodeType> returned by the function matcher(). 219 template <typename NodeType, typenam [all...] |
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ExplodedGraph.h | 445 typedef clang::ento::ExplodedNode NodeType; typedef in struct:llvm::GraphTraits 446 typedef NodeType::succ_iterator ChildIteratorType; 447 typedef llvm::df_iterator<NodeType*> nodes_iterator; 449 static inline NodeType* getEntryNode(NodeType* N) { 453 static inline ChildIteratorType child_begin(NodeType* N) { 457 static inline ChildIteratorType child_end(NodeType* N) { 461 static inline nodes_iterator nodes_begin(NodeType* N) { 465 static inline nodes_iterator nodes_end(NodeType* N) { 471 typedef const clang::ento::ExplodedNode NodeType; typedef in struct:llvm::GraphTraits [all...] |
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 174 typedef clang::CallGraphNode NodeType; typedef in struct:llvm::GraphTraits 178 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; } 179 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType; 180 static inline ChildIteratorType child_begin(NodeType *N) { 183 static inline ChildIteratorType child_end (NodeType *N) { 192 typedef const clang::CallGraphNode NodeType; typedef in struct:llvm::GraphTraits 193 typedef NodeType::const_iterator ChildIteratorType; 194 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; } 195 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();} 196 static inline ChildIteratorType child_end(NodeType * [all...] |
H A D | CFG.h | 898 typedef ::clang::CFGBlock NodeType; typedef in struct:clang::llvm::GraphTraits 901 static NodeType* getEntryNode(::clang::CFGBlock *BB) 904 static inline ChildIteratorType child_begin(NodeType* N) 907 static inline ChildIteratorType child_end(NodeType* N) 912 typedef const ::clang::CFGBlock NodeType; typedef in struct:clang::llvm::GraphTraits 915 static NodeType* getEntryNode(const clang::CFGBlock *BB) 918 static inline ChildIteratorType child_begin(NodeType* N) 921 static inline ChildIteratorType child_end(NodeType* N) 926 typedef ::clang::CFGBlock NodeType; typedef in struct:clang::llvm::GraphTraits 929 static NodeType *getEntryNod 940 typedef const ::clang::CFGBlock NodeType; typedef in struct:clang::llvm::GraphTraits [all...] |
/freebsd-10.1-release/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 171 typedef ::clang::DomTreeNode NodeType; typedef in struct:llvm::GraphTraits 172 typedef NodeType::iterator ChildIteratorType; 174 static NodeType *getEntryNode(NodeType *N) { 177 static inline ChildIteratorType child_begin(NodeType *N) { 180 static inline ChildIteratorType child_end(NodeType *N) { 197 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
|
/freebsd-10.1-release/contrib/llvm/lib/Analysis/ |
H A D | BlockFrequencyInfo.cpp | 51 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits 55 static inline const NodeType *getEntryNode(const BlockFrequencyInfo *G) { 58 static ChildIteratorType child_begin(const NodeType *N) { 61 static ChildIteratorType child_end(const NodeType *N) {
|
/freebsd-10.1-release/contrib/llvm/include/llvm/IR/ |
H A D | Type.h | 455 typedef Type NodeType; 458 static inline NodeType *getEntryNode(Type *T) { return T; } 459 static inline ChildIteratorType child_begin(NodeType *N) { 462 static inline ChildIteratorType child_end(NodeType *N) { 468 typedef const Type NodeType; 471 static inline NodeType *getEntryNode(NodeType *T) { return T; } 472 static inline ChildIteratorType child_begin(NodeType *N) { 475 static inline ChildIteratorType child_end(NodeType *N) {
|