/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();
|
Comment.h | 217 child_iterator child_begin() const; 223 return child_end() - child_begin(); 270 child_iterator child_begin() const { return NULL; } function in class:clang::comments::TextComment 328 child_iterator child_begin() const { return NULL; } function in class:clang::comments::InlineCommandComment 453 child_iterator child_begin() const { return NULL; } function in class:clang::comments::HTMLStartTagComment 508 child_iterator child_begin() const { return NULL; } function in class:clang::comments::HTMLEndTagComment 557 child_iterator child_begin() const { function in class:clang::comments::ParagraphComment 627 child_iterator child_begin() const { function in class:clang::comments::BlockCommandComment 864 child_iterator child_begin() const { return NULL; } function in class:clang::comments::VerbatimBlockLineComment 895 child_iterator child_begin() const function in class:clang::comments::VerbatimBlockComment 951 child_iterator child_begin() const { return NULL; } function in class:clang::comments::VerbatimLineComment 1096 child_iterator child_begin() const { function in class:clang::comments::FullComment [all...] |
/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 *) 95 static ChildIteratorType child_begin(NodeType* N) { function in struct:llvm::GraphTraits 96 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 | 108 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 115 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); 123 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 | 261 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 275 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 306 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
GraphWriter.h | 71 child_iterator EI = GTraits::child_begin(Node); 229 child_iterator EI = GTraits::child_begin(Node); 247 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt);
|
/external/llvm/include/llvm/Analysis/ |
LoopInfoImpl.h | 42 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 76 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 106 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 128 typename BlockTraits::ChildIteratorType SI = BlockTraits::child_begin(Out); 151 InvBlockTraits::child_begin(Header), 173 InvBlockTraits::child_begin(Header); 267 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB); 275 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB); 391 InvBlockTraits::child_begin(PredBB), 413 InvBlockTraits::child_begin(PredBB) [all...] |
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 | 134 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), 171 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), 219 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head), 296 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), 331 SI = GraphTraits<BlockT *>::child_begin(BB),
|
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),
|
LoopInfo.h | 153 BlockTraits::child_begin(BB), 169 InvBlockTraits::child_begin(H), 704 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 717 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
/external/llvm/include/llvm/CodeGen/ |
MachineLoopInfo.h | 167 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 180 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
MachineBasicBlock.h | 681 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 694 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 714 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 728 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
/external/clang/lib/AST/ |
Comment.cpp | 55 ASSERT_IMPLEMENTS_child_begin(&CLASS::child_begin); \ 66 Comment::child_iterator Comment::child_begin() const { function in class:clang::comments::Comment 72 return static_cast<const CLASS *>(this)->child_begin(); 106 for (child_iterator I = child_begin(), E = child_end(); I != E; ++I) {
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
CheckSizeofPointer.cpp | 38 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I)
|
UndefBranchChecker.cpp | 40 for (Stmt::const_child_iterator I = Ex->child_begin(),
|
UndefCapturedBlockVarChecker.cpp | 43 for (Stmt::const_child_iterator I = S->child_begin(), E = S->child_end();
|
CheckObjCDealloc.cpp | 45 for (Stmt::child_iterator I = S->child_begin(), E= S->child_end(); I!=E; ++I) 93 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/clang/include/clang/Analysis/ |
CallGraph.h | 180 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 195 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();} function in struct:llvm::GraphTraits
|