Searched refs:child_begin (Results 1 - 25 of 57) sorted by relevance

123

/external/clang/include/clang/AST/
H A DStmtGraphTraits.h34 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 DComment.h193 child_iterator child_begin() const;
199 return child_end() - child_begin();
250 child_iterator child_begin() const { return NULL; } function in class:clang::comments::TextComment
310 child_iterator child_begin() const { return NULL; } function in class:clang::comments::InlineCommandComment
439 child_iterator child_begin() const { return NULL; } function in class:clang::comments::HTMLStartTagComment
496 child_iterator child_begin() const { return NULL; } function in class:clang::comments::HTMLEndTagComment
549 child_iterator child_begin() const { function in class:clang::comments::ParagraphComment
617 child_iterator child_begin() const { function in class:clang::comments::BlockCommandComment
834 child_iterator child_begin() const { return NULL; } function in class:clang::comments::VerbatimBlockLineComment
866 child_iterator child_begin() cons function in class:clang::comments::VerbatimBlockComment
923 child_iterator child_begin() const { return NULL; } function in class:clang::comments::VerbatimLineComment
1060 child_iterator child_begin() const { function in class:clang::comments::FullComment
[all...]
/external/clang/lib/StaticAnalyzer/Core/
H A DCheckerHelpers.cpp25 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 DGraphTraits.h36 // 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 DDepthFirstIterator.h83 GT::child_begin(Node)));
92 GT::child_begin(Node)));
108 It = GT::child_begin(Node);
119 GT::child_begin(Next)));
H A DPostOrderIterator.h108 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 DSCCIterator.h74 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)
/external/llvm/include/llvm/Support/
H A DDataFlow.h34 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 DCFG.h253 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
267 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
284 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
298 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
H A DGraphWriter.h66 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/
H A DLoopInfoImpl.h41 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);
127 typename BlockTraits::ChildIteratorType SI = BlockTraits::child_begin(Out);
150 InvBlockTraits::child_begin(Header),
172 InvBlockTraits::child_begin(Header);
266 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB);
274 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB);
390 InvBlockTraits::child_begin(PredBB),
412 InvBlockTraits::child_begin(PredB
[all...]
H A DInterval.h131 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 DBlockFrequencyImpl.h157 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 DDominatorInternals.h58 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 DIntervalIterator.h174 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 DCallGraph.h319 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
/external/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h167 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
/external/clang/lib/AST/
H A DComment.cpp69 ASSERT_IMPLEMENTS_child_begin(&CLASS::child_begin); \
80 Comment::child_iterator Comment::child_begin() const { function in class:clang::comments::Comment
86 return static_cast<const CLASS *>(this)->child_begin();
120 for (child_iterator I = child_begin(), E = child_end(); I != E; ++I) {
/external/clang/lib/StaticAnalyzer/Checkers/
H A DCheckSizeofPointer.cpp38 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I)
H A DUndefBranchChecker.cpp40 for (Stmt::const_child_iterator I = Ex->child_begin(),
H A DUndefCapturedBlockVarChecker.cpp42 for (Stmt::const_child_iterator I = S->child_begin(), E = S->child_end();
H A DCheckObjCDealloc.cpp44 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/
H A DSCCIteratorTest.cpp220 /// 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/
H A DCallGraph.h190 static inline ChildIteratorType child_begin(NodeType *N) { function in struct:llvm::GraphTraits
205 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();} function in struct:llvm::GraphTraits
/external/llvm/include/llvm/
H A DType.h430 static inline ChildIteratorType child_begin(NodeType *N) {
443 static inline ChildIteratorType child_begin(NodeType *N) {

Completed in 299 milliseconds

123