Home
last modified time | relevance | path

Searched refs:child_begin (Results 1 – 25 of 75) sorted by relevance

123

/external/clang/lib/StaticAnalyzer/Core/
DCheckerHelpers.cpp25 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); in containsMacro()
41 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); in containsEnum()
59 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); in containsStaticLocal()
73 for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); in containsBuiltinOffsetOf()
/external/clang/include/clang/AST/
DStmtGraphTraits.h34 static inline ChildIteratorType child_begin(NodeType* N) {
35 if (N) return N->child_begin();
61 static inline ChildIteratorType child_begin(NodeType* N) {
62 if (N) return N->child_begin();
DComment.h228 child_iterator child_begin() const;
234 return child_end() - child_begin(); in child_count()
281 child_iterator child_begin() const { return nullptr; } in child_begin() function
339 child_iterator child_begin() const { return nullptr; } in child_begin() function
472 child_iterator child_begin() const { return nullptr; } in child_begin() function
527 child_iterator child_begin() const { return nullptr; } in child_begin() function
576 child_iterator child_begin() const { in child_begin() function
646 child_iterator child_begin() const { in child_begin() function
883 child_iterator child_begin() const { return nullptr; } in child_begin() function
914 child_iterator child_begin() const { in child_begin() function
[all …]
/external/llvm/include/llvm/Analysis/
DLoopInfoImpl.h39 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitingBlocks()
68 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitBlocks()
93 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitEdges()
115 typename BlockTraits::ChildIteratorType SI = BlockTraits::child_begin(Out); in getLoopPreheader()
138 InvBlockTraits::child_begin(Header), in getLoopPredecessor()
160 InvBlockTraits::child_begin(Header); in getLoopLatch()
249 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB); in verifyLoop()
257 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB); in verifyLoop()
372 InvBlockTraits::child_begin(PredBB), in discoverAndMapSubloop()
394 InvBlockTraits::child_begin(PredBB), in discoverAndMapSubloop()
[all …]
DIntervalIterator.h174 for (typename GT::ChildIteratorType I = GT::child_begin(Node), in ProcessInterval()
205 for (typename IGT::ChildIteratorType I = IGT::child_begin(Node), in ProcessNode()
228 for (typename GT::ChildIteratorType It = GT::child_begin(Node), in ProcessNode()
DInterval.h128 static inline ChildIteratorType child_begin(NodeType *N) {
140 static inline ChildIteratorType child_begin(NodeType *N) {
DLoopInfo.h157 BlockTraits::child_begin(BB), in isLoopExiting()
173 InvBlockTraits::child_begin(H), in getNumBackEdges()
240 InvBlockTraits::child_begin(H), in getLoopLatches()
758 static inline ChildIteratorType child_begin(NodeType *N) {
771 static inline ChildIteratorType child_begin(NodeType *N) {
/external/llvm/include/llvm/ADT/
DGraphTraits.h95 static ChildIteratorType child_begin(NodeType* N) {
96 return GraphTraits<T>::child_begin(N);
DDepthFirstIterator.h84 GT::child_begin(Node))); in df_iterator()
93 GT::child_begin(Node))); in df_iterator()
109 It = GT::child_begin(Node); in toNext()
120 GT::child_begin(Next))); in toNext()
DPostOrderIterator.h108 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
115 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
123 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
DSCCIterator.h146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
216 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE; in hasLoop()
/external/clang/lib/AST/
DComment.cpp58 ASSERT_IMPLEMENTS_child_begin(&CLASS::child_begin); \ in CheckCommentASTNodes()
69 Comment::child_iterator Comment::child_begin() const { in child_begin() function in clang::comments::Comment
75 return static_cast<const CLASS *>(this)->child_begin(); in child_begin()
107 for (child_iterator I = child_begin(), E = child_end(); I != E; ++I) { in isWhitespaceNoCache()
/external/llvm/include/llvm/IR/
DCFG.h279 static inline ChildIteratorType child_begin(NodeType *N) {
293 static inline ChildIteratorType child_begin(NodeType *N) {
310 static inline ChildIteratorType child_begin(NodeType *N) {
324 static inline ChildIteratorType child_begin(NodeType *N) {
DType.h449 static inline ChildIteratorType child_begin(NodeType *N) {
462 static inline ChildIteratorType child_begin(NodeType *N) {
/external/llvm/include/llvm/Support/
DGenericDomTreeConstruction.h58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); in DFSPass()
67 if (NextSucc == GraphT::child_begin(BB)) { in DFSPass()
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ))); in DFSPass()
209 InvTraits::child_begin(W), in Calculate()
DGraphWriter.h71 child_iterator EI = GTraits::child_begin(Node); in getEdgeSourceLabels()
229 child_iterator EI = GTraits::child_begin(Node); in writeNode()
247 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt); in writeEdge()
DGenericDomTree.h235 assert(std::distance(GraphT::child_begin(NewBB), in Split()
238 typename GraphT::NodeType* NewBBSucc = *GraphT::child_begin(NewBB); in Split()
243 InvTraits::child_begin(NewBB), in Split()
251 InvTraits::child_begin(NewBBSucc), in Split()
695 if (TraitsTy::child_begin(I) == TraitsTy::child_end(I)) in recalculate()
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp222 static ChildIterator child_begin(NodeType *Parent) { in child_begin() function in llvm::Graph
238 static inline ChildIteratorType child_begin(NodeType *Node) { in child_begin() function
239 return Graph<N>::child_begin(Node); in child_begin()
/external/llvm/include/llvm/CodeGen/
DMachineLoopInfo.h168 static inline ChildIteratorType child_begin(NodeType *N) {
181 static inline ChildIteratorType child_begin(NodeType *N) {
DMachineBasicBlock.h708 static inline ChildIteratorType child_begin(NodeType *N) {
721 static inline ChildIteratorType child_begin(NodeType *N) {
741 static inline ChildIteratorType child_begin(NodeType *N) {
755 static inline ChildIteratorType child_begin(NodeType *N) {
/external/clang/include/clang/Analysis/
DCallGraph.h180 static inline ChildIteratorType child_begin(NodeType *N) {
195 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();}
/external/clang/lib/StaticAnalyzer/Checkers/
DCheckObjCDealloc.cpp45 for (Stmt::child_iterator I = S->child_begin(), E= S->child_end(); I!=E; ++I) in scan_dealloc()
93 for (Stmt::child_iterator I = S->child_begin(), E= S->child_end(); I!=E; ++I) in scan_ivar_release()
DCheckSizeofPointer.cpp40 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I) in VisitChildren()
DUndefBranchChecker.cpp40 for (Stmt::const_child_iterator I = Ex->child_begin(), in FindExpr()
DUndefCapturedBlockVarChecker.cpp43 for (Stmt::const_child_iterator I = S->child_begin(), E = S->child_end(); in FindBlockDeclRefExpr()

123