HomeSort by relevance Sort by last modified time
    Searched refs:NodeType (Results 1 - 25 of 109) sorted by null

1 2 3 4 5

  /external/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/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/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...]
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;
80 inline df_iterator(NodeType *Node) {
88 inline df_iterator(NodeType *Node, SetType &S)
104 NodeType *Node = Top.first.getPointer();
113 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/webkit/Source/WebCore/dom/
CDATASection.h 38 virtual NodeType nodeType() const;
40 virtual bool childTypeAllowed(NodeType) const;
Comment.h 38 virtual NodeType nodeType() const;
40 virtual bool childTypeAllowed(NodeType) const;
DocumentFragment.h 44 virtual NodeType nodeType() const;
46 virtual bool childTypeAllowed(NodeType) const;
Notation.cpp 41 Node::NodeType Notation::nodeType() const
52 bool Notation::childTypeAllowed(NodeType) const
Notation.h 40 virtual NodeType nodeType() const;
42 virtual bool childTypeAllowed(NodeType) const;
CDATASection.cpp 44 Node::NodeType CDATASection::nodeType() const
54 bool CDATASection::childTypeAllowed(NodeType) const
Comment.cpp 44 Node::NodeType Comment::nodeType() const
54 bool Comment::childTypeAllowed(NodeType) const
EntityReference.h 37 virtual NodeType nodeType() const;
DocumentFragment.cpp 50 Node::NodeType DocumentFragment::nodeType() const
55 bool DocumentFragment::childTypeAllowed(NodeType type) const
Text.h 54 virtual NodeType nodeType() const;
59 virtual bool childTypeAllowed(NodeType) const;
  /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/clang/include/clang/Index/
CallGraph.h 109 typedef clang::CallGraphNode NodeType;
111 typedef std::pair<clang::idx::ASTLocation, NodeType*> CGNPairTy;
112 typedef std::pointer_to_unary_function<CGNPairTy, NodeType*> CGNDerefFun;
114 typedef mapped_iterator<NodeType::iterator, CGNDerefFun> ChildIteratorType;
116 static NodeType *getEntryNode(GraphType *CG) {
120 static ChildIteratorType child_begin(NodeType *N) {
123 static ChildIteratorType child_end(NodeType *N) {
127 typedef std::pair<clang::idx::Entity, NodeType*> PairTy;
128 typedef std::pointer_to_unary_function<PairTy, NodeType*> DerefFun;
139 static NodeType *CGNDeref(CGNPairTy P) { return P.second;
    [all...]
  /external/icu4c/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 97 /// 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 *Parent)
    [all...]
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 413 typedef clang::ento::ExplodedNode NodeType;
414 typedef NodeType::succ_iterator ChildIteratorType;
415 typedef llvm::df_iterator<NodeType*> nodes_iterator;
417 static inline NodeType* getEntryNode(NodeType* N) {
421 static inline ChildIteratorType child_begin(NodeType* N) {
425 static inline ChildIteratorType child_end(NodeType* N) {
429 static inline nodes_iterator nodes_begin(NodeType* N) {
433 static inline nodes_iterator nodes_end(NodeType* N) {
439 typedef const clang::ento::ExplodedNode NodeType;
    [all...]

Completed in 688 milliseconds

1 2 3 4 5