| /external/clang/include/clang/AST/ |
| StmtGraphTraits.h | 34 static inline ChildIteratorType child_begin(NodeType* N) { function in struct:llvm::GraphTraits
35 if (N) return N->child_begin();
61 static inline ChildIteratorType child_begin(NodeType* N) { function in struct:llvm::GraphTraits
62 if (N) return N->child_begin();
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CheckerHelpers.cpp | 25 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end();
41 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end();
59 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end();
73 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end();
|
| /external/llvm/include/llvm/ADT/ |
| GraphTraits.h | 36 // static ChildIteratorType child_begin(NodeType *)
92 static ChildIteratorType child_begin(NodeType* N) { function in struct:llvm::GraphTraits
93 return GraphTraits<T>::child_begin(N);
|
| DepthFirstIterator.h | 83 GT::child_begin(Node)));
92 GT::child_begin(Node)));
108 It = GT::child_begin(Node);
119 GT::child_begin(Next)));
|
| SCCIterator.h | 74 VisitStack.push_back(std::make_pair(N, GT::child_begin(N)));
181 for (ChildItTy CI = GT::child_begin(N), CE=GT::child_end(N); CI != CE; ++CI)
|
| PostOrderIterator.h | 68 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
75 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
83 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
|
| /external/llvm/include/llvm/Support/ |
| DataFlow.h | 34 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
51 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
68 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
89 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
| CFG.h | 247 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
261 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
278 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
292 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
| GraphWriter.h | 66 child_iterator EI = GTraits::child_begin(Node);
216 child_iterator EI = GTraits::child_begin(Node);
234 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt);
|
| /external/llvm/include/llvm/Analysis/ |
| Interval.h | 131 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
143 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
| BlockFrequencyImpl.h | 157 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
194 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
238 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head),
290 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB),
325 SI = GraphTraits<BlockT *>::child_begin(BB),
|
| LoopInfo.h | 149 BlockTraits::child_begin(const_cast<BlockT*>(BB)),
165 InvBlockTraits::child_begin(const_cast<BlockT*>(H)),
194 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
225 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
256 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI);
277 typename BlockTraits::ChildIteratorType SI = BlockTraits::child_begin(Out);
300 InvBlockTraits::child_begin(Header),
321 InvBlockTraits::child_begin(Header);
433 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB);
441 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB)
1074 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
1087 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
[all...] |
| DominatorInternals.h | 58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V)));
67 if (NextSucc == GraphT::child_begin(BB)) {
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
209 InvTraits::child_begin(W),
|
| IntervalIterator.h | 174 for (typename GT::ChildIteratorType I = GT::child_begin(Node),
205 for (typename IGT::ChildIteratorType I = IGT::child_begin(Node),
228 for (typename GT::ChildIteratorType It = GT::child_begin(Node),
|
| CallGraph.h | 319 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:GraphTraits
337 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();} function in struct:GraphTraits
|
| RegionIterator.h | 262 // NodeT can either be region node or const region node, otherwise child_begin
270 static inline ChildIteratorType child_begin(NodeType *N) { \
281 static inline ChildIteratorType child_begin(NodeType *N) { \
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineLoopInfo.h | 155 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
168 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
| MachineBasicBlock.h | 474 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
487 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
507 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
521 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| CheckSizeofPointer.cpp | 38 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I)
|
| UndefCapturedBlockVarChecker.cpp | 41 for (Stmt::const_child_iterator I = S->child_begin(), E = S->child_end();
|
| UndefBranchChecker.cpp | 38 for (Stmt::const_child_iterator I = Ex->child_begin(),
|
| CheckObjCDealloc.cpp | 44 for (Stmt::child_iterator I = S->child_begin(), E= S->child_end(); I!=E; ++I)
92 for (Stmt::child_iterator I = S->child_begin(), E= S->child_end(); I!=E; ++I)
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 220 /// child_begin - Return an iterator pointing to the first child of the given
222 static ChildIterator child_begin(NodeType *Parent) {
238 static inline ChildIteratorType child_begin(NodeType *Node) { function in struct:llvm::GraphTraits
239 return Graph<N>::child_begin(Node);
|
| /external/llvm/include/llvm/ |
| Type.h | 378 static inline ChildIteratorType child_begin(NodeType *N) {
391 static inline ChildIteratorType child_begin(NodeType *N) {
|
| /external/clang/include/clang/Index/ |
| CallGraph.h | 120 static ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
