Home
last modified time | relevance | path

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

12345

/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.h122 typedef Interval NodeType;
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;
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) {
DCallGraph.h404 typedef CallGraphNode NodeType;
410 static NodeType *getEntryNode(CallGraphNode *CGN) { return CGN; }
412 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType;
414 static inline ChildIteratorType child_begin(NodeType *N) {
417 static inline ChildIteratorType child_end(NodeType *N) {
425 typedef const CallGraphNode NodeType;
431 static NodeType *getEntryNode(const CallGraphNode *CGN) { return CGN; }
433 typedef mapped_iterator<NodeType::const_iterator, CGNDerefFun>
436 static inline ChildIteratorType child_begin(NodeType *N) {
439 static inline ChildIteratorType child_end(NodeType *N) {
[all …]
/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 …]
DGraphWriter.h62 typedef typename GTraits::NodeType NodeType; typedef
69 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { in getEdgeSourceLabels()
147 bool isNodeHidden(NodeType &Node) { in isNodeHidden()
151 bool isNodeHidden(NodeType *const *Node) { in isNodeHidden()
155 bool isNodeHidden(NodeType *Node) { in isNodeHidden()
159 void writeNode(NodeType& Node) { in writeNode()
163 void writeNode(NodeType *const *Node) { in writeNode()
167 void writeNode(NodeType *Node) { in writeNode()
240 void writeEdge(NodeType *Node, unsigned edgeidx, child_iterator EI) { in writeEdge()
241 if (NodeType *TargetNode = *EI) { in writeEdge()
/external/pdfium/xfa/src/fxfa/src/common/
Dxfa_utils.h13 template <class NodeType, class TraverseStrategy>
16 CXFA_NodeIteratorTemplate(NodeType* pRootNode = NULL) : m_pRoot(pRootNode) { in m_pRoot()
21 FX_BOOL Init(NodeType* pRootNode) { in Init()
37 FX_BOOL SetCurrent(NodeType* pCurNode) { in SetCurrent()
40 CFX_StackTemplate<NodeType*> revStack; in SetCurrent()
41 NodeType* pNode; in SetCurrent()
57 NodeType* GetCurrent() const { in GetCurrent()
60 NodeType* GetRoot() const { return m_pRoot; } in GetRoot()
61 NodeType* MoveToPrev() { in MoveToPrev()
66 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 …]
DDominators.h43 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT, Function &F);
45 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *>>::NodeType> &DT,
145 typedef Node NodeType; typedef
147 typedef df_iterator<Node *, SmallPtrSet<NodeType *, 8>> nodes_iterator;
149 static NodeType *getEntryNode(NodeType *N) { return N; } in getEntryNode()
150 static inline ChildIteratorType child_begin(NodeType *N) { in child_begin()
153 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); } in child_end()
155 static nodes_iterator nodes_begin(NodeType *N) { in nodes_begin()
159 static nodes_iterator nodes_end(NodeType *N) { in nodes_end()
175 static NodeType *getEntryNode(DominatorTree *DT) {
/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 …]
Dreadernext.py26 reader.NodeType() != 1 or reader.HasAttributes() != 0:
34 reader.NodeType() != 1 or reader.HasAttributes() != 0:
41 if reader.Name() != "c" or reader.NodeType() != 1 or \
49 if reader.Name() != "b" or reader.NodeType() != 15:
57 reader.NodeType() != 1 or reader.HasAttributes() != 0:
65 reader.NodeType() != 15 or reader.HasAttributes() != 0:
Dreader.py26 reader.NodeType() != 1 or reader.HasAttributes() != 0:
34 reader.NodeType() != 1 or reader.HasAttributes() != 1:
42 reader.NodeType() != 1 or reader.HasAttributes() != 0:
50 reader.NodeType() != 3 or reader.HasAttributes() != 0 or \
59 reader.NodeType() != 15 or reader.HasAttributes() != 0:
67 reader.NodeType() != 15 or reader.HasAttributes() != 0:
261 reader.Value() != "http://example.com/foo" or reader.NodeType() != 2:
278 reader.Value() != "http://example.com/foo" or reader.NodeType() != 2:
309 res=res + "%s (%s) [%s] %d %d\n" % (reader.NodeType(),reader.Name(),
312 if reader.NodeType() == 1: # Element
[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.h444 typedef clang::ento::ExplodedNode NodeType;
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;
471 typedef NodeType::const_succ_iterator ChildIteratorType;
[all …]
/external/clang/unittests/AST/
DMatchVerifier.h41 template <typename NodeType>
68 const NodeType &Node) {} in verify()
86 template <typename NodeType> template <typename MatcherType>
87 testing::AssertionResult MatchVerifier<NodeType>::match( in match()
130 template <typename NodeType>
131 void MatchVerifier<NodeType>::run(const MatchFinder::MatchResult &Result) { in run()
132 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>(""); in run()
160 template <typename NodeType>
161 class LocationVerifier : public MatchVerifier<NodeType> {
170 const NodeType &Node) override { in verify()
[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 …]
/external/llvm/include/llvm/CodeGen/
DMachineLoopInfo.h159 typedef const MachineLoop NodeType;
162 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
163 static inline ChildIteratorType child_begin(NodeType *N) {
166 static inline ChildIteratorType child_end(NodeType *N) {
172 typedef MachineLoop NodeType;
175 static NodeType *getEntryNode(MachineLoop *L) { return L; }
176 static inline ChildIteratorType child_begin(NodeType *N) {
179 static inline ChildIteratorType child_end(NodeType *N) {
DMachineRegionInfo.h145 typedef df_iterator<NodeType*, SmallPtrSet<NodeType*, 8>, false,
146 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
148 static NodeType *getEntryNode(MachineRegionInfo *RI) {
161 typedef df_iterator<NodeType*, SmallPtrSet<NodeType*, 8>, false,
162 GraphTraits<FlatIt<NodeType*> > > nodes_iterator;
164 static NodeType *getEntryNode(MachineRegionInfoPass *RI) {
/external/guice/extensions/grapher/src/com/google/inject/grapher/
DNodeId.java39 public enum NodeType { enum in NodeId
48 private final NodeType nodeType;
50 private NodeId(Key<?> key, NodeType nodeType) { in NodeId()
56 return new NodeId(key, NodeType.TYPE); in newTypeId()
60 return new NodeId(key, NodeType.INSTANCE); in newInstanceId()
/external/clang/include/clang/Analysis/Analyses/
DDominators.h170 typedef ::clang::DomTreeNode NodeType;
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) {

12345