Searched defs:NodeType (Results 1 - 25 of 44) sorted by relevance

12

/external/clang/include/clang/AST/
H A DStmtGraphTraits.h28 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) {
/external/llvm/include/llvm/ADT/
H A DGraphTraits.h30 // 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 DDepthFirstIterator.h64 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
67 typename GT::NodeType, ptrdiff_t>,
70 typename GT::NodeType, ptrdiff_t> super;
72 typedef typename GT::NodeType NodeType; typedef in class:llvm::df_iterator
74 typedef PointerIntPair<NodeType*, 1> PointerIntTy;
81 inline df_iterator(NodeType *Node) {
89 inline df_iterator(NodeType *Node, SetType &S)
105 NodeType *Node = Top.first.getPointer();
114 NodeType *Nex
[all...]
H A DPostOrderIterator.h59 template<typename NodeType>
60 bool insertEdge(NodeType *From, NodeType *To) {
65 template<typename NodeType>
66 void finishPostorder(NodeType *BB) {}
80 template <class NodeType> bool insertEdge(NodeType *From, NodeType *To) {
85 template<class NodeType>
86 void finishPostorder(NodeType *B
98 typedef typename GT::NodeType NodeType; typedef in class:llvm::po_iterator
283 typedef typename GT::NodeType NodeType; typedef in class:llvm::ReversePostOrderTraversal
[all...]
H A DSCCIterator.h43 const std::vector<typename GT::NodeType *>, ptrdiff_t> {
44 typedef typename GT::NodeType NodeType; typedef in class:llvm::scc_iterator
46 typedef std::vector<NodeType *> SccTy;
51 NodeType *Node; ///< The current node pointer.
55 StackElement(NodeType *Node, const ChildItTy &Child, unsigned Min)
70 DenseMap<NodeType *, unsigned> nodeVisitNumbers;
73 std::vector<NodeType *> SCCNodeStack;
83 void DFSVisitOne(NodeType *N);
91 scc_iterator(NodeType *entry
[all...]
/external/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp95 /// NodeType - Node index and set of children of the node.
96 typedef std::pair<unsigned, NodeSubset> NodeType;
100 NodeType Nodes[N];
126 NodeType *AccessNode(unsigned Idx) const {
130 return const_cast<NodeType *>(&Nodes[Idx]);
163 NodeType *FirstNode;
170 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {}
207 NodeType *operator*() {
220 static ChildIterator child_begin(NodeType *Parent) {
225 static ChildIterator child_end(NodeType *Paren
232 typedef typename Graph<N>::NodeType NodeType; typedef in struct:llvm::GraphTraits
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DACBTree.h12 } NodeType; typedef in typeref:enum:__anon302
/external/llvm/lib/Target/XCore/
H A DXCoreISelLowering.h29 enum NodeType { enum in namespace:llvm::XCoreISD
/external/clang/include/clang/Analysis/Analyses/
H A DDominators.h170 typedef ::clang::DomTreeNode NodeType; typedef in struct:llvm::GraphTraits
171 typedef NodeType::iterator ChildIteratorType;
173 static NodeType *getEntryNode(NodeType *N) {
176 static inline ChildIteratorType child_begin(NodeType *N) {
179 static inline ChildIteratorType child_end(NodeType *N) {
196 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
/external/llvm/include/llvm/Analysis/
H A DInterval.h122 typedef Interval NodeType; typedef in struct:llvm::GraphTraits
125 static NodeType *getEntryNode(Interval *I) { return I; }
128 static inline ChildIteratorType child_begin(NodeType *N) {
131 static inline ChildIteratorType child_end(NodeType *N) {
137 typedef Interval NodeType; typedef in struct:llvm::GraphTraits
139 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
140 static inline ChildIteratorType child_begin(NodeType *N) {
143 static inline ChildIteratorType child_end(NodeType *N) {
H A DCallGraph.h398 typedef CallGraphNode NodeType; typedef in struct:GraphTraits
404 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }
406 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType;
408 static inline ChildIteratorType child_begin(NodeType *N) {
411 static inline ChildIteratorType child_end(NodeType *N) {
419 typedef const CallGraphNode NodeType; typedef in struct:GraphTraits
425 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }
427 typedef mapped_iterator<NodeType::const_iterator, CGNDerefFun>
430 static inline ChildIteratorType child_begin(NodeType *N) {
433 static inline ChildIteratorType child_end(NodeType *
[all...]
H A DLazyCallGraph.h522 typedef LazyCallGraph::Node NodeType; typedef in struct:llvm::GraphTraits
525 static NodeType *getEntryNode(NodeType *N) { return N; }
526 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
527 static ChildIteratorType child_end(NodeType *N) { return N->end(); }
530 typedef LazyCallGraph::Node NodeType; typedef in struct:llvm::GraphTraits
533 static NodeType *getEntryNode(NodeType *N) { return N; }
534 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
535 static ChildIteratorType child_end(NodeType *
[all...]
H A DLoopInfo.h694 typedef const Loop NodeType; typedef in struct:llvm::GraphTraits
697 static NodeType *getEntryNode(const Loop *L) { return L; }
698 static inline ChildIteratorType child_begin(NodeType *N) {
701 static inline ChildIteratorType child_end(NodeType *N) {
707 typedef Loop NodeType; typedef in struct:llvm::GraphTraits
710 static NodeType *getEntryNode(Loop *L) { return L; }
711 static inline ChildIteratorType child_begin(NodeType *N) {
714 static inline ChildIteratorType child_end(NodeType *N) {
/external/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h164 typedef const MachineLoop NodeType; typedef in struct:llvm::GraphTraits
167 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
168 static inline ChildIteratorType child_begin(NodeType *N) {
171 static inline ChildIteratorType child_end(NodeType *N) {
177 typedef MachineLoop NodeType; typedef in struct:llvm::GraphTraits
180 static NodeType *getEntryNode(MachineLoop *L) { return L; }
181 static inline ChildIteratorType child_begin(NodeType *N) {
184 static inline ChildIteratorType child_end(NodeType *N) {
H A DMachineDominators.h252 typedef MachineDomTreeNode NodeType; typedef in struct:llvm::GraphTraits
253 typedef NodeType::iterator ChildIteratorType;
255 static NodeType *getEntryNode(NodeType *N) {
258 static inline ChildIteratorType child_begin(NodeType* N) {
261 static inline ChildIteratorType child_end(NodeType* N) {
268 static NodeType *getEntryNode(MachineDominatorTree *DT) {
/external/clang/include/clang/Analysis/
H A DCallGraph.h174 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...]
/external/icu/icu4c/source/common/
H A Drbbinode.h27 enum NodeType { enum in class:RBBINode
54 NodeType fType;
87 RBBINode(NodeType t);
94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
/external/llvm/include/llvm/IR/
H A DDominators.h44 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT LLVM_COMMA
48 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *> >::NodeType> &DT
130 typedef DomTreeNode NodeType; typedef in struct:llvm::GraphTraits
131 typedef NodeType::iterator ChildIteratorType;
133 static NodeType *getEntryNode(NodeType *N) {
136 static inline ChildIteratorType child_begin(NodeType *N) {
139 static inline ChildIteratorType child_end(NodeType *N) {
156 static NodeType *getEntryNode(DominatorTree *DT) {
H A DCFG.h293 typedef BasicBlock NodeType; typedef in struct:llvm::GraphTraits
296 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
297 static inline ChildIteratorType child_begin(NodeType *N) {
300 static inline ChildIteratorType child_end(NodeType *N) {
306 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits
309 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
311 static inline ChildIteratorType child_begin(NodeType *N) {
314 static inline ChildIteratorType child_end(NodeType *N) {
325 typedef BasicBlock NodeType; typedef in struct:llvm::GraphTraits
327 static NodeType *getEntryNod
337 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits
[all...]
/external/llvm/include/llvm/Support/
H A DGraphWriter.h62 typedef typename GTraits::NodeType NodeType; typedef in class:llvm::GraphWriter
69 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) {
147 bool isNodeHidden(NodeType &Node) {
151 bool isNodeHidden(NodeType *const *Node) {
155 bool isNodeHidden(NodeType *Node) {
159 void writeNode(NodeType& Node) {
163 void writeNode(NodeType *const *Node) {
167 void writeNode(NodeType *Node) {
238 void writeEdge(NodeType *Nod
[all...]
/external/llvm/lib/Analysis/
H A DBlockFrequencyInfo.cpp53 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits
57 static inline const NodeType *getEntryNode(const BlockFrequencyInfo *G) {
60 static ChildIteratorType child_begin(const NodeType *N) {
63 static ChildIteratorType child_end(const NodeType *N) {
H A DBlockFrequencyInfoImpl.cpp589 typedef const GraphT::IrrNode NodeType; typedef in struct:llvm::GraphTraits
592 static const NodeType *getEntryNode(const GraphT &G) {
595 static ChildIteratorType child_begin(NodeType *N) { return N->succ_begin(); }
596 static ChildIteratorType child_end(NodeType *N) { return N->succ_end(); }
/external/llvm/lib/CodeGen/
H A DMachineBlockFrequencyInfo.cpp54 typedef const MachineBasicBlock NodeType; typedef in struct:llvm::GraphTraits
59 const NodeType *getEntryNode(const MachineBlockFrequencyInfo *G) {
63 static ChildIteratorType child_begin(const NodeType *N) {
67 static ChildIteratorType child_end(const NodeType *N) {
/external/clang/lib/Serialization/
H A DModuleManager.cpp466 typedef ModuleFile NodeType; typedef in struct:llvm::GraphTraits
470 static ChildIteratorType child_begin(NodeType *Node) {
474 static ChildIteratorType child_end(NodeType *Node) {
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h444 typedef clang::ento::ExplodedNode NodeType; typedef in struct:llvm::GraphTraits
445 typedef NodeType::succ_iterator ChildIteratorType;
446 typedef llvm::df_iterator<NodeType*> nodes_iterator;
448 static inline NodeType* getEntryNode(NodeType* N) {
452 static inline ChildIteratorType child_begin(NodeType* N) {
456 static inline ChildIteratorType child_end(NodeType* N) {
460 static inline nodes_iterator nodes_begin(NodeType* N) {
464 static inline nodes_iterator nodes_end(NodeType* N) {
470 typedef const clang::ento::ExplodedNode NodeType; typedef in struct:llvm::GraphTraits
[all...]

Completed in 499 milliseconds

12