Searched refs:NodeType (Results 1 - 25 of 111) sorted by relevance

12345

/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...]
/external/llvm/include/llvm/Analysis/
H A DRegionIterator.h33 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 DDominatorInternals.h34 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 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) {
/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 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...]
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...]
/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/webkit/Source/WebCore/dom/
H A DComment.h38 virtual NodeType nodeType() const;
40 virtual bool childTypeAllowed(NodeType) const;
H A DCDATASection.h38 virtual NodeType nodeType() const;
40 virtual bool childTypeAllowed(NodeType) const;
H A DNotation.cpp41 Node::NodeType Notation::nodeType() const
52 bool Notation::childTypeAllowed(NodeType) const
H A DCDATASection.cpp44 Node::NodeType CDATASection::nodeType() const
54 bool CDATASection::childTypeAllowed(NodeType) const
H A DComment.cpp44 Node::NodeType Comment::nodeType() const
54 bool Comment::childTypeAllowed(NodeType) const
H A DDocumentFragment.h44 virtual NodeType nodeType() const;
46 virtual bool childTypeAllowed(NodeType) const;
H A DNotation.h40 virtual NodeType nodeType() const;
42 virtual bool childTypeAllowed(NodeType) const;
H A DDocumentFragment.cpp50 Node::NodeType DocumentFragment::nodeType() const
55 bool DocumentFragment::childTypeAllowed(NodeType type) const
H A DEntityReference.cpp44 Node::NodeType EntityReference::nodeType() const
H A DEntityReference.h37 virtual NodeType nodeType() const;
/external/llvm/include/llvm/CodeGen/
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/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/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/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h435 typedef clang::ento::ExplodedNode NodeType; typedef in struct:llvm::GraphTraits
436 typedef NodeType::succ_iterator ChildIteratorType;
437 typedef llvm::df_iterator<NodeType*> nodes_iterator;
439 static inline NodeType* getEntryNode(NodeType* N) {
443 static inline ChildIteratorType child_begin(NodeType* N) {
447 static inline ChildIteratorType child_end(NodeType* N) {
451 static inline nodes_iterator nodes_begin(NodeType* N) {
455 static inline nodes_iterator nodes_end(NodeType* N) {
461 typedef const clang::ento::ExplodedNode NodeType; typedef in struct:llvm::GraphTraits
[all...]
/external/webkit/Source/WebCore/webaudio/
H A DAudioNode.h56 enum NodeType { enum in class:WebCore::AudioNode
73 NodeType type() const { return m_type; }
74 void setType(NodeType);
147 NodeType m_type;

Completed in 309 milliseconds

12345