/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | 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();
|
H A D | 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 850 child_iterator child_begin() const { return NULL; } function in class:clang::comments::VerbatimBlockLineComment 881 child_iterator child_begin() cons function in class:clang::comments::VerbatimBlockComment 937 child_iterator child_begin() const { return NULL; } function in class:clang::comments::VerbatimLineComment 1082 child_iterator child_begin() const { function in class:clang::comments::FullComment [all...] |
/freebsd-10.0-release/contrib/llvm/tools/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();
|
/freebsd-10.0-release/contrib/llvm/include/llvm/ADT/ |
H A D | 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);
|
H A D | DepthFirstIterator.h | 83 GT::child_begin(Node))); 92 GT::child_begin(Node))); 108 It = GT::child_begin(Node); 119 GT::child_begin(Next)));
|
H A D | 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)));
|
H A D | 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)
|
/freebsd-10.0-release/contrib/llvm/include/llvm/Support/ |
H A D | 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
|
H A D | CFG.h | 257 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 271 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 288 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 302 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
H A D | GraphWriter.h | 70 child_iterator EI = GTraits::child_begin(Node); 228 child_iterator EI = GTraits::child_begin(Node); 246 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt);
|
/freebsd-10.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | 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(PredB [all...] |
H A D | 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
|
H A D | 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), 326 SI = GraphTraits<BlockT *>::child_begin(BB),
|
H A D | 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),
|
H A D | 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),
|
H A D | 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
|
H A D | LoopInfo.h | 152 BlockTraits::child_begin(BB), 168 InvBlockTraits::child_begin(H), 687 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits 700 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
|
/freebsd-10.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | 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
|
/freebsd-10.0-release/contrib/llvm/tools/clang/lib/AST/ |
H A D | 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) {
|
/freebsd-10.0-release/contrib/llvm/tools/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 | 40 for (Stmt::const_child_iterator I = Ex->child_begin(),
|
H A D | UndefCapturedBlockVarChecker.cpp | 43 for (Stmt::const_child_iterator I = S->child_begin(), E = S->child_end();
|
H A D | 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)
|
/freebsd-10.0-release/contrib/llvm/tools/clang/include/clang/Analysis/ |
H A D | 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
|
/freebsd-10.0-release/usr.bin/dtc/ |
H A D | checking.cc | 58 if (n->child_begin() == n->child_end()) 112 for (node::child_iterator i=n->child_begin(), e=n->child_end() ; i!=e ;
|