| /external/pdfium/xfa/fxfa/parser/ |
| cxfa_nodeiteratortemplate.h | 10 template <class NodeType, class TraverseStrategy>
13 explicit CXFA_NodeIteratorTemplate(NodeType* pRoot)
16 NodeType* GetRoot() const { return m_pRoot; }
17 NodeType* GetCurrent() const { return m_pCurrent; }
20 bool SetCurrent(NodeType* pNode) {
29 NodeType* MoveToPrev() {
36 NodeType* pSibling = PreviousSiblingWithinSubtree(m_pCurrent);
41 NodeType* pParent = ParentWithinSubtree(m_pCurrent);
49 NodeType* MoveToNext() {
52 NodeType* pChild = TraverseStrategy::GetFirstChild(m_pCurrent)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| RegionIterator.h | 33 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...] |
| DominatorInternals.h | 34 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 *VIn, unsigned LastLinked)
[all...] |
| Interval.h | 125 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/swiftshader/third_party/LLVM/include/llvm/Support/ |
| DataFlow.h | 27 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...] |
| CFG.h | 243 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/llvm/include/llvm/Analysis/ |
| RegionIterator.h | 33 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(); }
72 NodeType* getISucc(BlockT* BB) const {
73 NodeType *succ;
90 typedef RNSuccIterator<NodeType, BlockT, RegionT> Self;
95 inline RNSuccIterator(NodeType* node)
109 inline RNSuccIterator(NodeType* node, bool
[all...] |
| Interval.h | 124 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/llvm/include/llvm/ADT/ |
| GraphTraits.h | 30 // 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;
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)
[all...] |
| PostOrderIterator.h | 59 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 *BB) {
[all...] |
| SCCIterator.h | 43 const std::vector<typename GT::NodeType *>, ptrdiff_t> {
44 typedef typename GT::NodeType NodeType;
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 *entryN) : visitNum(0)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| GraphTraits.h | 30 // 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 *)
57 typedef typename GraphType::UnknownGraphTypeError NodeType;
85 typedef typename GraphTraits<T>::NodeType NodeType;
88 static NodeType *getEntryNode(Inverse<Inverse<T> > *G) {
92 static ChildIteratorType child_begin(NodeType* N) {
96 static ChildIteratorType child_end(NodeType* N)
[all...] |
| SCCIterator.h | 38 std::vector<typename GT::NodeType>, ptrdiff_t> {
39 typedef typename GT::NodeType NodeType;
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 *childN = *VisitStack.back().second++
[all...] |
| PostOrderIterator.h | 49 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;
62 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack;
66 NodeType *BB = *VisitStack.back().second++;
73 inline po_iterator(NodeType *BB) {
80 inline po_iterator(NodeType *BB, SetType &S) :
117 inline NodeType *operator->() const { return operator*();
[all...] |
| /external/clang/include/clang/AST/ |
| StmtGraphTraits.h | 28 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/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 33 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
34 typename GraphT::NodeType* V, unsigned N) {
55 SmallVector<std::pair<typename GraphT::NodeType*,
59 typename GraphT::NodeType* BB = Worklist.back().first;
62 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo =
92 typename GraphT::NodeType* Succ = *NextSucc;
94 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &SuccVInfo =
106 typename GraphT::NodeType *
107 Eval(DominatorTreeBase<typename GraphT::NodeType> &DT,
108 typename GraphT::NodeType *VIn, unsigned LastLinked)
[all...] |
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/page/ |
| NodePage.java | 24 * @param <NodeType>
27 public abstract class NodePage<NodeType extends ICoverageNode> extends
30 private final NodeType node;
44 protected NodePage(final NodeType node, final ReportPage parent,
66 public NodeType getNode() {
|
| /external/libxml2/python/tests/ |
| reader3.py | 33 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...] |
| reader4.py | 23 res=res + "%s (%s) [%s] %d\n" % (reader.NodeType(),reader.Name(),
25 if reader.NodeType() == 1: # Element
27 res = res + "-- %s (%s) [%s]\n" % (reader.NodeType(),
|
| readernext.py | 26 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:
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| NodeId.java | 39 public enum NodeType {
48 private final NodeType nodeType;
50 private NodeId(Key<?> key, NodeType nodeType) {
52 this.nodeType = nodeType;
56 return new NodeId(key, NodeType.TYPE);
60 return new NodeId(key, NodeType.INSTANCE);
68 return Objects.hashCode(key, nodeType);
[all...] |
| /external/llvm/include/llvm/IR/ |
| CFG.h | 157 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/llvm/include/llvm/CodeGen/ |
| MachineLoopInfo.h | 151 typedef const MachineLoop NodeType;
154 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
155 static inline ChildIteratorType child_begin(NodeType *N) {
158 static inline ChildIteratorType child_end(NodeType *N) {
164 typedef MachineLoop NodeType;
167 static NodeType *getEntryNode(MachineLoop *L) { return L; }
168 static inline ChildIteratorType child_begin(NodeType *N) {
171 static inline ChildIteratorType child_end(NodeType *N) {
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| MachineLoopInfo.h | 151 typedef const MachineLoop NodeType;
154 static NodeType *getEntryNode(const MachineLoop *L) { return L; }
155 static inline ChildIteratorType child_begin(NodeType *N) {
158 static inline ChildIteratorType child_end(NodeType *N) {
164 typedef MachineLoop NodeType;
167 static NodeType *getEntryNode(MachineLoop *L) { return L; }
168 static inline ChildIteratorType child_begin(NodeType *N) {
171 static inline ChildIteratorType child_end(NodeType *N) {
|
| /external/icu/icu4c/source/common/ |
| rbbinode.h | 30 enum NodeType {
57 NodeType fType;
94 RBBINode(NodeType t);
101 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
|
