/external/clang/include/clang/AST/ |
H A D | StmtGraphTraits.h | 39 static inline ChildIteratorType child_end(NodeType* N) { function in struct:llvm::GraphTraits 40 if (N) return N->child_end(); 66 static inline ChildIteratorType child_end(NodeType* N) { function in struct:llvm::GraphTraits 67 if (N) return N->child_end();
|
H A D | Comment.h | 194 child_iterator child_end() const; 199 return child_end() - child_begin(); 252 child_iterator child_end() const { return NULL; } function in class:clang::comments::TextComment 312 child_iterator child_end() const { return NULL; } function in class:clang::comments::InlineCommandComment 441 child_iterator child_end() const { return NULL; } function in class:clang::comments::HTMLStartTagComment 498 child_iterator child_end() const { return NULL; } function in class:clang::comments::HTMLEndTagComment 553 child_iterator child_end() const { function in class:clang::comments::ParagraphComment 621 child_iterator child_end() const { function in class:clang::comments::BlockCommandComment 836 child_iterator child_end() const { return NULL; } function in class:clang::comments::VerbatimBlockLineComment 870 child_iterator child_end() cons function in class:clang::comments::VerbatimBlockComment 925 child_iterator child_end() const { return NULL; } function in class:clang::comments::VerbatimLineComment 1064 child_iterator child_end() const { function in class:clang::comments::FullComment [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | 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/ |
H A D | GraphTraits.h | 37 // static ChildIteratorType child_end (NodeType *) 99 static ChildIteratorType child_end(NodeType* N) { function in struct:llvm::GraphTraits 100 return GraphTraits<T>::child_end(N);
|
H A D | SCCIterator.h | 82 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { 103 assert(VisitStack.back().second ==GT::child_end(VisitStack.back().first)); 181 for (ChildItTy CI = GT::child_begin(N), CE=GT::child_end(N); CI != CE; ++CI)
|
/external/llvm/include/llvm/Support/ |
H A D | DataFlow.h | 38 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 55 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 74 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 95 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
H A D | CFG.h | 256 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 270 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 287 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 301 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 41 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 75 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 105 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 129 if (SI != BlockTraits::child_end(Out)) 151 PE = InvBlockTraits::child_end(Header); PI != PE; ++PI) { 174 InvBlockTraits::child_end(Header); 266 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB); 274 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB); 391 InvBlockTraits::child_end(PredBB)); 413 PE = InvBlockTraits::child_end(PredB [all...] |
H A D | Interval.h | 134 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 146 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
H A D | BlockFrequencyImpl.h | 158 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); 195 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); 239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head); 291 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); 327 SE = GraphTraits<BlockT *>::child_end(BB); SI != SE; ++SI) {
|
H A D | IntervalIterator.h | 175 E = GT::child_end(Node); I != E; ++I) 206 E = IGT::child_end(Node); I != E; ++I) { 229 End = GT::child_end(Node); It != End; ++It)
|
H A D | CallGraph.h | 322 static inline ChildIteratorType child_end (NodeType *N) { function in struct:GraphTraits 338 static inline ChildIteratorType child_end (NodeType *N) { return N->end(); } function in struct:GraphTraits
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineLoopInfo.h | 170 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 183 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
/external/clang/lib/AST/ |
H A D | Comment.cpp | 70 ASSERT_IMPLEMENTS_child_begin(&CLASS::child_end); 94 Comment::child_iterator Comment::child_end() const { function in class:clang::comments::Comment 100 return static_cast<const CLASS *>(this)->child_end(); 120 for (child_iterator I = child_begin(), E = child_end(); I != E; ++I) {
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | CheckSizeofPointer.cpp | 38 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I)
|
H A D | UndefBranchChecker.cpp | 41 E = Ex->child_end();I!=E;++I)
|
H A D | UndefCapturedBlockVarChecker.cpp | 42 for (Stmt::const_child_iterator I = S->child_begin(), E = S->child_end();
|
H A D | 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)
|
H A D | CStringSyntaxChecker.cpp | 170 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I != E;
|
H A D | ObjCContainersASTChecker.cpp | 157 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I)
|
H A D | VirtualCallChecker.cpp | 127 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I)
|
/external/llvm/unittests/ADT/ |
H A D | SCCIteratorTest.cpp | 226 /// child_end - Return the end iterator for children of the given node. 227 static ChildIterator child_end(NodeType *Parent) { 241 static inline ChildIteratorType child_end(NodeType *Node) { function in struct:llvm::GraphTraits 242 return Graph<N>::child_end(Node);
|
/external/clang/include/clang/Analysis/ |
H A D | CallGraph.h | 193 static inline ChildIteratorType child_end (NodeType *N) { function in struct:llvm::GraphTraits 206 static inline ChildIteratorType child_end (NodeType *N) { return N->end(); } function in struct:llvm::GraphTraits
|
/external/llvm/include/llvm/ |
H A D | Type.h | 433 static inline ChildIteratorType child_end(NodeType *N) { 446 static inline ChildIteratorType child_end(NodeType *N) { function in class:llvm::Type
|
/external/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 181 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|