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

12

/external/llvm/include/llvm/Support/
H A DDataFlow.h27 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 DCFG.h249 typedef BasicBlock NodeType; typedef in struct:llvm::GraphTraits
252 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
253 static inline ChildIteratorType child_begin(NodeType *N) {
256 static inline ChildIteratorType child_end(NodeType *N) {
262 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits
265 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
267 static inline ChildIteratorType child_begin(NodeType *N) {
270 static inline ChildIteratorType child_end(NodeType *N) {
281 typedef BasicBlock NodeType; typedef in struct:llvm::GraphTraits
283 static NodeType *getEntryNod
293 typedef const BasicBlock NodeType; typedef in struct:llvm::GraphTraits
[all...]
H A DGraphWriter.h58 typedef typename GTraits::NodeType NodeType; typedef in class:llvm::GraphWriter
65 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) {
143 bool isNodeHidden(NodeType &Node) {
147 bool isNodeHidden(NodeType *const *Node) {
151 bool isNodeHidden(NodeType *Node) {
155 void writeNode(NodeType& Node) {
159 void writeNode(NodeType *const *Node) {
163 void writeNode(NodeType *Node) {
226 void writeEdge(NodeType *Nod
[all...]
/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.h63 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...]
H A DPostOrderIterator.h58 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 DSCCIterator.h38 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...]
/external/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp97 /// NodeType - Node index and set of children of the node.
98 typedef std::pair<unsigned, NodeSubset> NodeType;
102 NodeType Nodes[N];
128 NodeType *AccessNode(unsigned Idx) const {
132 return const_cast<NodeType *>(&Nodes[Idx]);
165 NodeType *FirstNode;
172 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {}
209 NodeType *operator*() {
222 static ChildIterator child_begin(NodeType *Parent) {
227 static ChildIterator child_end(NodeType *Paren
234 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:__anon299
/external/llvm/lib/Target/MBlaze/
H A DMBlazeISelLowering.h62 enum NodeType { enum in namespace:llvm::MBlazeISD
63 // Start the numbering from where ISD NodeType finishes.
/external/llvm/lib/Target/XCore/
H A DXCoreISelLowering.h29 enum NodeType { enum in namespace:llvm::XCoreISD
/external/chromium/chrome/common/
H A Dlibxml_utils.h102 int NodeType() { return xmlTextReaderNodeType(reader_); } function in class:XmlReader
/external/llvm/include/llvm/Analysis/
H A DInterval.h125 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 DCallGraph.h310 typedef CallGraphNode NodeType; typedef in struct:GraphTraits
315 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }
317 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType;
319 static inline ChildIteratorType child_begin(NodeType *N) {
322 static inline ChildIteratorType child_end (NodeType *N) {
333 typedef const CallGraphNode NodeType; typedef in struct:GraphTraits
334 typedef NodeType::const_iterator ChildIteratorType;
336 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }
337 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();}
338 static inline ChildIteratorType child_end (NodeType *
[all...]
/external/llvm/include/llvm/CodeGen/
H A DMachineDominators.h180 typedef MachineDomTreeNode NodeType; typedef in struct:llvm::GraphTraits
181 typedef NodeType::iterator ChildIteratorType;
183 static NodeType *getEntryNode(NodeType *N) {
186 static inline ChildIteratorType child_begin(NodeType* N) {
189 static inline ChildIteratorType child_end(NodeType* N) {
196 static NodeType *getEntryNode(MachineDominatorTree *DT) {
H A DMachineLoopInfo.h163 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) {
/external/llvm/lib/Target/CellSPU/
H A DSPUISelLowering.h24 enum NodeType { enum in namespace:llvm::SPUISD
/external/webkit/Source/WebKit/chromium/public/
H A DWebNode.h70 enum NodeType { enum in class:WebKit::WebNode
85 WEBKIT_API NodeType nodeType() const;
/external/clang/include/clang/Analysis/Analyses/
H A DDominators.h172 typedef ::clang::DomTreeNode NodeType; typedef in struct:llvm::GraphTraits
173 typedef NodeType::iterator ChildIteratorType;
175 static NodeType *getEntryNode(NodeType *N) {
178 static inline ChildIteratorType child_begin(NodeType *N) {
181 static inline ChildIteratorType child_end(NodeType *N) {
198 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
/external/clang/include/clang/Analysis/
H A DCallGraph.h184 typedef clang::CallGraphNode NodeType; typedef in struct:llvm::GraphTraits
188 static NodeType *getEntryNode(clang::CallGraphNode *CGN) { return CGN; }
189 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType;
190 static inline ChildIteratorType child_begin(NodeType *N) {
193 static inline ChildIteratorType child_end (NodeType *N) {
202 typedef const clang::CallGraphNode NodeType; typedef in struct:llvm::GraphTraits
203 typedef NodeType::const_iterator ChildIteratorType;
204 static NodeType *getEntryNode(const clang::CallGraphNode *CGN) { return CGN; }
205 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();}
206 static inline ChildIteratorType child_end (NodeType *
[all...]
/external/clang/lib/Serialization/
H A DModuleManager.cpp215 typedef ModuleFile NodeType; typedef in struct:llvm::GraphTraits
219 static ChildIteratorType child_begin(NodeType *Node) {
223 static ChildIteratorType child_end(NodeType *Node) {
/external/icu4c/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/lib/Target/Mips/
H A DMipsISelLowering.h25 enum NodeType { enum in namespace:llvm::MipsISD
26 // Start the numbering from where ISD NodeType finishes.
/external/llvm/lib/Target/NVPTX/
H A DNVPTXISelLowering.h25 enum NodeType { enum in namespace:llvm::NVPTXISD
26 // Start the numbering from where ISD NodeType finishes.

Completed in 1715 milliseconds

12