Home
last modified time | relevance | path

Searched refs:NodeType (Results 1 – 25 of 174) sorted by relevance

1234567

/external/llvm/include/llvm/Analysis/
DRegionIterator.h33 template<class NodeType, class BlockT, class RegionT>
35 NodeType, ptrdiff_t> {
36 typedef std::iterator<std::forward_iterator_tag, NodeType, ptrdiff_t> super;
53 PointerIntPair<NodeType*, 2, ItMode> Node;
65 NodeType* getNode() const{ return Node.getPointer(); } in getNode()
72 NodeType* getISucc(BlockT* BB) const { in getISucc()
73 NodeType *succ; in getISucc()
90 typedef RNSuccIterator<NodeType, BlockT, RegionT> Self;
95 inline RNSuccIterator(NodeType* node) in RNSuccIterator()
109 inline RNSuccIterator(NodeType* node, bool) in RNSuccIterator()
[all …]
DInterval.h124 typedef Interval NodeType;
127 static NodeType *getEntryNode(Interval *I) { return I; }
130 static inline ChildIteratorType child_begin(NodeType *N) {
133 static inline ChildIteratorType child_end(NodeType *N) {
139 typedef Interval NodeType;
141 static NodeType *getEntryNode(Inverse<Interval *> G) { return G.Graph; }
142 static inline ChildIteratorType child_begin(NodeType *N) {
145 static inline ChildIteratorType child_end(NodeType *N) {
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
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(); } in getNode()
87 typedef RNSuccIterator<NodeType> Self;
92 inline RNSuccIterator(NodeType* node) in RNSuccIterator()
107 inline RNSuccIterator(NodeType* node, bool) in RNSuccIterator()
165 template<class NodeType>
166 class RNSuccIterator<FlatIt<NodeType> >
[all …]
DDominatorInternals.h34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, in DFSPass()
35 typename GraphT::NodeType* V, unsigned N) { in DFSPass()
56 SmallVector<std::pair<typename GraphT::NodeType*, in DFSPass()
60 typename GraphT::NodeType* BB = Worklist.back().first; in DFSPass()
63 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in DFSPass()
93 typename GraphT::NodeType* Succ = *NextSucc; in DFSPass()
95 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &SuccVInfo = in DFSPass()
107 typename GraphT::NodeType*
108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT, in Eval()
109 typename GraphT::NodeType *VIn, unsigned LastLinked) { in Eval()
[all …]
DInterval.h125 typedef Interval NodeType;
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;
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/Support/
DGenericDomTreeConstruction.h33 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, in DFSPass()
34 typename GraphT::NodeType* V, unsigned N) { in DFSPass()
55 SmallVector<std::pair<typename GraphT::NodeType*, in DFSPass()
59 typename GraphT::NodeType* BB = Worklist.back().first; in DFSPass()
62 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in DFSPass()
92 typename GraphT::NodeType* Succ = *NextSucc; in DFSPass()
94 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &SuccVInfo = in DFSPass()
106 typename GraphT::NodeType *
107 Eval(DominatorTreeBase<typename GraphT::NodeType> &DT, in Eval()
108 typename GraphT::NodeType *VIn, unsigned LastLinked) { in Eval()
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/Support/
DDataFlow.h27 typedef const Value NodeType;
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;
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;
64 static NodeType *getEntryNode(Inverse<const User*> G) {
[all …]
DCFG.h243 typedef BasicBlock NodeType;
246 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
247 static inline ChildIteratorType child_begin(NodeType *N) {
250 static inline ChildIteratorType child_end(NodeType *N) {
256 typedef const BasicBlock NodeType;
259 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
261 static inline ChildIteratorType child_begin(NodeType *N) {
264 static inline ChildIteratorType child_end(NodeType *N) {
275 typedef BasicBlock NodeType;
277 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
[all …]
/external/pdfium/xfa/fxfa/parser/
Dxfa_utils.h26 template <class NodeType, class TraverseStrategy>
29 explicit CXFA_NodeIteratorTemplate(NodeType* pRootNode = nullptr)
35 bool Init(NodeType* pRootNode) { in Init()
51 bool SetCurrent(NodeType* pCurNode) { in SetCurrent()
54 CFX_StackTemplate<NodeType*> revStack(100); in SetCurrent()
55 NodeType* pNode; in SetCurrent()
71 NodeType* GetCurrent() const { in GetCurrent()
74 NodeType* GetRoot() const { return m_pRoot; } in GetRoot()
75 NodeType* MoveToPrev() { in MoveToPrev()
80 NodeType* pCurItem = *m_NodeStack.GetTopElement(); in MoveToPrev()
[all …]
/external/llvm/include/llvm/ADT/
DPostOrderIterator.h59 template<typename NodeType>
60 bool insertEdge(NodeType *From, NodeType *To) { in insertEdge()
65 template<typename NodeType>
66 void finishPostorder(NodeType *BB) {} in finishPostorder()
80 template <class NodeType> bool insertEdge(NodeType *From, NodeType *To) { in insertEdge()
85 template<class NodeType>
86 void finishPostorder(NodeType *BB) {} in finishPostorder()
90 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
94 typename GT::NodeType, ptrdiff_t>,
97 typename GT::NodeType, ptrdiff_t> super;
[all …]
DSCCIterator.h43 const std::vector<typename GT::NodeType *>, ptrdiff_t> {
44 typedef typename GT::NodeType NodeType; typedef
46 typedef std::vector<NodeType *> SccTy;
51 NodeType *Node; ///< The current node pointer.
55 StackElement(NodeType *Node, const ChildItTy &Child, unsigned Min) in StackElement()
70 DenseMap<NodeType *, unsigned> nodeVisitNumbers;
73 std::vector<NodeType *> SCCNodeStack;
83 void DFSVisitOne(NodeType *N);
91 scc_iterator(NodeType *entryN) : visitNum(0) { in scc_iterator()
134 void ReplaceNode(NodeType *Old, NodeType *New) { in ReplaceNode()
[all …]
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
73 typedef PointerIntPair<NodeType*, 1> PointerIntTy;
81 inline df_iterator(NodeType *Node) { in df_iterator()
89 inline df_iterator(NodeType *Node, SetType &S) in df_iterator()
105 NodeType *Node = Top.first.getPointer(); in toNext()
114 NodeType *Next = *It++; in toNext()
155 NodeType *operator->() const { return **this; }
[all …]
DGraphTraits.h60 typedef typename GraphType::UnknownGraphTypeError NodeType; typedef
88 typedef typename GraphTraits<T>::NodeType NodeType;
91 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
95 static ChildIteratorType child_begin(NodeType* N) {
99 static ChildIteratorType child_end(NodeType* N) {
/external/llvm/include/llvm/IR/
DCFG.h157 typedef BasicBlock NodeType;
160 static NodeType *getEntryNode(BasicBlock *BB) { return BB; }
161 static inline ChildIteratorType child_begin(NodeType *N) {
164 static inline ChildIteratorType child_end(NodeType *N) {
170 typedef const BasicBlock NodeType;
173 static NodeType *getEntryNode(const BasicBlock *BB) { return BB; }
175 static inline ChildIteratorType child_begin(NodeType *N) {
178 static inline ChildIteratorType child_end(NodeType *N) {
189 typedef BasicBlock NodeType;
191 static NodeType *getEntryNode(Inverse<BasicBlock *> G) { return G.Graph; }
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DSCCIterator.h38 std::vector<typename GT::NodeType>, ptrdiff_t> {
39 typedef typename GT::NodeType NodeType; typedef
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) { in DFSVisitOne()
84 NodeType *childN = *VisitStack.back().second++; in DFSVisitChildren()
104 NodeType *visitingN = VisitStack.back().first; in GetNextSCC()
[all …]
DPostOrderIterator.h49 class SetType = llvm::SmallPtrSet<typename GraphTraits<GraphT>::NodeType*, 8>,
53 typename GT::NodeType, ptrdiff_t>,
56 typename GT::NodeType, ptrdiff_t> super;
57 typedef typename GT::NodeType NodeType; typedef
62 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack;
66 NodeType *BB = *VisitStack.back().second++; in traverseChild()
73 inline po_iterator(NodeType *BB) { in po_iterator()
80 inline po_iterator(NodeType *BB, SetType &S) : in po_iterator()
117 inline NodeType *operator->() const { return operator*(); }
141 template<class T, class SetType=std::set<typename GraphTraits<T>::NodeType*> >
[all …]
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
73 typedef PointerIntPair<NodeType*, 1> PointerIntTy;
80 inline df_iterator(NodeType *Node) { in df_iterator()
88 inline df_iterator(NodeType *Node, SetType &S) in df_iterator()
104 NodeType *Node = Top.first.getPointer(); in toNext()
113 NodeType *Next = *It++; in toNext()
158 inline NodeType *operator->() const { return operator*(); }
[all …]
/external/libxml2/python/tests/
Dreader3.py33 if reader.Name() == "doc" or reader.NodeType() == 10:
38 if reader.Name() != "doc" or reader.NodeType() != 1:
45 if reader.Name() != "tst" or reader.NodeType() != 5:
52 if reader.Name() != "doc" or reader.NodeType() != 15:
71 if reader.Name() == "doc" or reader.NodeType() == 10:
76 if reader.Name() != "doc" or reader.NodeType() != 1:
83 if reader.Name() != "p" or reader.NodeType() != 1:
90 if reader.NodeType() != 3 or reader.Value() != "test":
97 if reader.Name() != "p" or reader.NodeType() != 15:
104 if reader.Name() != "doc" or reader.NodeType() != 15:
[all …]
/external/clang/unittests/AST/
DMatchVerifier.h41 template <typename NodeType>
71 const NodeType &Node) {} in verify()
89 template <typename NodeType> template <typename MatcherType>
90 testing::AssertionResult MatchVerifier<NodeType>::match( in match()
135 template <typename NodeType> template <typename MatcherType>
136 testing::AssertionResult MatchVerifier<NodeType>::match( in match()
149 template <typename NodeType>
150 void MatchVerifier<NodeType>::run(const MatchFinder::MatchResult &Result) { in run()
151 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>(""); in run()
179 template <typename NodeType>
[all …]
/external/swiftshader/third_party/LLVM/unittests/ADT/
DSCCIteratorTest.cpp98 typedef std::pair<unsigned, NodeSubset> NodeType; typedef in llvm::Graph
102 NodeType Nodes[N];
128 NodeType *AccessNode(unsigned Idx) const { in AccessNode()
132 return const_cast<NodeType *>(&Nodes[Idx]); in AccessNode()
165 NodeType *FirstNode;
172 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} in ChildIterator()
209 NodeType *operator*() { in operator *()
222 static ChildIterator child_begin(NodeType *Parent) { in child_begin()
227 static ChildIterator child_end(NodeType *Parent) { in child_end()
234 typedef typename Graph<N>::NodeType NodeType; typedef
[all …]
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp96 typedef std::pair<unsigned, NodeSubset> NodeType; typedef in llvm::Graph
100 NodeType Nodes[N];
126 NodeType *AccessNode(unsigned Idx) const { in AccessNode()
130 return const_cast<NodeType *>(&Nodes[Idx]); in AccessNode()
163 NodeType *FirstNode;
170 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {} in ChildIterator()
207 NodeType *operator*() { in operator *()
220 static ChildIterator child_begin(NodeType *Parent) { in child_begin()
225 static ChildIterator child_end(NodeType *Parent) { in child_end()
232 typedef typename Graph<N>::NodeType NodeType; typedef
[all …]
/external/clang/include/clang/AST/
DStmtGraphTraits.h28 typedef clang::Stmt NodeType;
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;
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/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h454 typedef clang::ento::ExplodedNode NodeType;
455 typedef NodeType::succ_iterator ChildIteratorType;
456 typedef llvm::df_iterator<NodeType*> nodes_iterator;
458 static inline NodeType* getEntryNode(NodeType* N) {
462 static inline ChildIteratorType child_begin(NodeType* N) {
466 static inline ChildIteratorType child_end(NodeType* N) {
470 static inline nodes_iterator nodes_begin(NodeType* N) {
474 static inline nodes_iterator nodes_end(NodeType* N) {
480 typedef const clang::ento::ExplodedNode NodeType;
481 typedef NodeType::const_succ_iterator ChildIteratorType;
[all …]
/external/clang/include/clang/ASTMatchers/
DASTMatchersMacros.h233 template <typename NodeType> \
235 : public ::clang::ast_matchers::internal::MatcherInterface<NodeType> { \
237 bool matches(const NodeType &Node, \
249 template <typename NodeType> \
250 bool internal::matcher_##DefineMatcher##Matcher<NodeType>::matches( \
251 const NodeType &Node, \
272 template <typename NodeType, typename ParamT> \
274 : public ::clang::ast_matchers::internal::MatcherInterface<NodeType> { \
279 bool matches(const NodeType &Node, \
300 template <typename NodeType, typename ParamT> \
[all …]
/external/clang/include/clang/Analysis/
DCallGraph.h174 typedef clang::CallGraphNode NodeType;
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;
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 *N) { return N->end(); }
[all …]

1234567