Home
last modified time | relevance | path

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

123

/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.h217 child_iterator child_begin() const;
223 return child_end() - child_begin(); in child_count()
270 child_iterator child_begin() const { return NULL; } in child_begin() function
328 child_iterator child_begin() const { return NULL; } in child_begin() function
453 child_iterator child_begin() const { return NULL; } in child_begin() function
508 child_iterator child_begin() const { return NULL; } in child_begin() function
557 child_iterator child_begin() const { in child_begin() function
627 child_iterator child_begin() const { in child_begin() function
850 child_iterator child_begin() const { return NULL; } in child_begin() function
881 child_iterator child_begin() const { in child_begin() function
[all …]
/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/llvm/include/llvm/Support/
DDataFlow.h34 static inline ChildIteratorType child_begin(NodeType *N) {
51 static inline ChildIteratorType child_begin(NodeType *N) {
68 static inline ChildIteratorType child_begin(NodeType *N) {
89 static inline ChildIteratorType child_begin(NodeType *N) {
DCFG.h253 static inline ChildIteratorType child_begin(NodeType *N) {
267 static inline ChildIteratorType child_begin(NodeType *N) {
284 static inline ChildIteratorType child_begin(NodeType *N) {
298 static inline ChildIteratorType child_begin(NodeType *N) {
DGraphWriter.h70 child_iterator EI = GTraits::child_begin(Node); in getEdgeSourceLabels()
228 child_iterator EI = GTraits::child_begin(Node); in writeNode()
246 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt); in writeEdge()
/external/llvm/include/llvm/Analysis/
DLoopInfoImpl.h42 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitingBlocks()
76 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitBlocks()
106 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitEdges()
128 typename BlockTraits::ChildIteratorType SI = BlockTraits::child_begin(Out); in getLoopPreheader()
151 InvBlockTraits::child_begin(Header), in getLoopPredecessor()
173 InvBlockTraits::child_begin(Header); in getLoopLatch()
267 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB); in verifyLoop()
275 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB); in verifyLoop()
391 InvBlockTraits::child_begin(PredBB), in discoverAndMapSubloop()
413 InvBlockTraits::child_begin(PredBB), in discoverAndMapSubloop()
[all …]
DBlockFrequencyImpl.h157 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in getSingleBlockPred()
194 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in doBlock()
238 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head), in doLoop()
290 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in doFunction()
326 SI = GraphTraits<BlockT *>::child_begin(BB), in print()
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.h131 static inline ChildIteratorType child_begin(NodeType *N) {
143 static inline ChildIteratorType child_begin(NodeType *N) {
DDominatorInternals.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()
DLoopInfo.h152 BlockTraits::child_begin(BB), in isLoopExiting()
168 InvBlockTraits::child_begin(H), in getNumBackEdges()
687 static inline ChildIteratorType child_begin(NodeType *N) {
700 static inline ChildIteratorType child_begin(NodeType *N) {
DDominators.h241 assert(std::distance(GraphT::child_begin(NewBB), in Split()
244 typename GraphT::NodeType* NewBBSucc = *GraphT::child_begin(NewBB); in Split()
249 InvTraits::child_begin(NewBB), in Split()
257 InvTraits::child_begin(NewBBSucc), in Split()
666 if (TraitsTy::child_begin(I) == TraitsTy::child_end(I)) in recalculate()
884 static inline ChildIteratorType child_begin(NodeType *N) {
DCallGraph.h319 static inline ChildIteratorType child_begin(NodeType *N) {
337 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();}
/external/llvm/include/llvm/ADT/
DGraphTraits.h95 static ChildIteratorType child_begin(NodeType* N) {
96 return GraphTraits<T>::child_begin(N);
DDepthFirstIterator.h83 GT::child_begin(Node))); in df_iterator()
92 GT::child_begin(Node))); in df_iterator()
108 It = GT::child_begin(Node); in toNext()
119 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.h74 VisitStack.push_back(std::make_pair(N, GT::child_begin(N))); in DFSVisitOne()
181 for (ChildItTy CI = GT::child_begin(N), CE=GT::child_end(N); CI != CE; ++CI) in hasLoop()
/external/clang/lib/AST/
DComment.cpp55 ASSERT_IMPLEMENTS_child_begin(&CLASS::child_begin); \ in CheckCommentASTNodes()
66 Comment::child_iterator Comment::child_begin() const { in child_begin() function in clang::comments::Comment
72 return static_cast<const CLASS *>(this)->child_begin(); in child_begin()
106 for (child_iterator I = child_begin(), E = child_end(); I != E; ++I) { in isWhitespaceNoCache()
/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.h167 static inline ChildIteratorType child_begin(NodeType *N) {
180 static inline ChildIteratorType child_begin(NodeType *N) {
DMachineBasicBlock.h673 static inline ChildIteratorType child_begin(NodeType *N) {
686 static inline ChildIteratorType child_begin(NodeType *N) {
706 static inline ChildIteratorType child_begin(NodeType *N) {
720 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/
DCheckSizeofPointer.cpp38 for (Stmt::child_iterator I = S->child_begin(), E = S->child_end(); I!=E; ++I) in VisitChildren()
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()

123