| /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 | 122 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) {
|
| /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...] |
| DepthFirstIterator.h | 63 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;
73 typedef PointerIntPair<NodeType*, 1> PointerIntTy;
81 inline df_iterator(NodeType *Node) {
89 inline df_iterator(NodeType *Node, SetType &S)
105 NodeType *Node = Top.first.getPointer();
114 NodeType *Next = *It++
[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() {
|
| TablePage.java | 28 * @param <NodeType>
31 public abstract class TablePage<NodeType extends ICoverageNode> extends
32 NodePage<NodeType> {
48 protected TablePage(final NodeType node, final ReportPage parent,
|
| /external/pdfium/xfa/src/fxfa/src/common/ |
| xfa_utils.h | 13 template <class NodeType, class TraverseStrategy>
16 CXFA_NodeIteratorTemplate(NodeType* pRootNode = NULL) : m_pRoot(pRootNode) {
21 FX_BOOL Init(NodeType* pRootNode) {
37 FX_BOOL SetCurrent(NodeType* pCurNode) {
40 CFX_StackTemplate<NodeType*> revStack;
41 NodeType* pNode;
57 NodeType* GetCurrent() const {
60 NodeType* GetRoot() const { return m_pRoot; }
61 NodeType* MoveToPrev() {
66 NodeType* pCurItem = *m_NodeStack.GetTopElement();
[all...] |
| /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...] |
| Dominators.h | 43 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT, Function &F);
45 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *>>::NodeType> &DT,
145 typedef Node NodeType;
147 typedef df_iterator<Node *, SmallPtrSet<NodeType *, 8>> nodes_iterator;
149 static NodeType *getEntryNode(NodeType *N) { return N; }
150 static inline ChildIteratorType child_begin(NodeType *N) {
153 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); }
155 static nodes_iterator nodes_begin(NodeType *N) {
159 static nodes_iterator nodes_end(NodeType *N)
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineLoopInfo.h | 159 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) {
|
| MachineRegionInfo.h | 145 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/clang/unittests/AST/ |
| MatchVerifier.h | 41 template <typename NodeType>
68 const NodeType &Node) {}
86 template <typename NodeType> template <typename MatcherType>
87 testing::AssertionResult MatchVerifier<NodeType>::match(
130 template <typename NodeType>
131 void MatchVerifier<NodeType>::run(const MatchFinder::MatchResult &Result) {
132 const NodeType *Node = Result.Nodes.getNodeAs<NodeType>("");
160 template <typename NodeType>
161 class LocationVerifier : public MatchVerifier<NodeType> {
[all...] |
| /external/icu/icu4c/source/common/ |
| rbbinode.h | 27 enum NodeType {
54 NodeType fType;
87 RBBINode(NodeType t);
94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 95 /// NodeType - Node index and set of children of the node.
96 typedef std::pair<unsigned, NodeSubset> NodeType;
100 NodeType Nodes[N];
126 NodeType *AccessNode(unsigned Idx) const {
130 return const_cast<NodeType *>(&Nodes[Idx]);
163 NodeType *FirstNode;
170 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {}
207 NodeType *operator*() {
220 static ChildIterator child_begin(NodeType *Parent) {
225 static ChildIterator child_end(NodeType *Parent)
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 444 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;
[all...] |
| /external/clang/include/clang/Analysis/ |
| CallGraph.h | 174 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...] |
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| TreeAllocator.h | 37 typedef Node<DataType> NodeType;
43 NodeType* produce() {
44 NodeType* result = Alloc::allocate();
|
