/external/clang/include/clang/AST/ |
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();
|
/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 | 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);
|
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/ |
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
|
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/ |
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
|
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) {
|
LoopInfo.h | 149 SE = BlockTraits::child_end(const_cast<BlockT*>(BB)); SI != SE; ++SI) { 165 E = InvBlockTraits::child_end(const_cast<BlockT*>(H)); I != E; ++I) 193 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 224 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 255 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 278 if (SI != BlockTraits::child_end(Out)) 300 PE = InvBlockTraits::child_end(Header); PI != PE; ++PI) { 322 InvBlockTraits::child_end(Header); 444 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB); 452 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB) 1059 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 1072 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits [all...] |
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)
|
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
|
RegionIterator.h | 263 // and child_end fail. 273 static inline ChildIteratorType child_end(NodeType *N) { \ 284 static inline ChildIteratorType child_end(NodeType *N) { \
|
/external/llvm/include/llvm/CodeGen/ |
MachineLoopInfo.h | 158 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 171 static inline ChildIteratorType child_end(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)
|
UndefBranchChecker.cpp | 41 E = Ex->child_end();I!=E;++I)
|
UndefCapturedBlockVarChecker.cpp | 42 for (Stmt::const_child_iterator I = S->child_begin(), E = S->child_end();
|
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)
|
CStringSyntaxChecker.cpp | 170 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I != E;
|
ObjCContainersASTChecker.cpp | 155 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I)
|
ObjCUnusedIVarsChecker.cpp | 50 for (Stmt::const_child_iterator I=S->child_begin(),E=S->child_end(); I!=E;++I)
|
VirtualCallChecker.cpp | 127 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I)
|
/external/llvm/unittests/ADT/ |
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/ |
CallGraph.h | 187 static inline ChildIteratorType child_end (NodeType *N) { function in struct:llvm::GraphTraits 200 static inline ChildIteratorType child_end (NodeType *N) { return N->end(); } function in struct:llvm::GraphTraits
|
/external/llvm/include/llvm/ |
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/ |
Dominators.h | 181 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|