/external/clang/include/clang/AST/ |
D | StmtGraphTraits.h | 39 static inline ChildIteratorType child_end(NodeType* N) { 40 if (N) return N->child_end(); 66 static inline ChildIteratorType child_end(NodeType* N) { 67 if (N) return N->child_end();
|
D | Comment.h | 231 child_iterator child_end() const; 236 return child_end() - child_begin(); in child_count() 285 child_iterator child_end() const { return nullptr; } in child_end() function 343 child_iterator child_end() const { return nullptr; } in child_end() function 476 child_iterator child_end() const { return nullptr; } in child_end() function 531 child_iterator child_end() const { return nullptr; } in child_end() function 582 child_iterator child_end() const { in child_end() function 652 child_iterator child_end() const { in child_end() function 887 child_iterator child_end() const { return nullptr; } in child_end() function 920 child_iterator child_end() const { in child_end() function [all …]
|
/external/llvm/include/llvm/Analysis/ |
D | LoopInfoImpl.h | 39 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() 117 if (SI != BlockTraits::child_end(Out)) in getLoopPreheader() 139 PE = InvBlockTraits::child_end(Header); PI != PE; ++PI) { in getLoopPredecessor() 162 InvBlockTraits::child_end(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() 373 InvBlockTraits::child_end(PredBB)); in discoverAndMapSubloop() 395 PE = InvBlockTraits::child_end(PredBB); PI != PE; ++PI) { in discoverAndMapSubloop() [all …]
|
D | RegionIterator.h | 101 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator() 111 BItor(BlockTraits::child_end(node->getEntry())) {} in RNSuccIterator() 137 while (BItor != BlockTraits::child_end(getNode()->getEntry()) 183 while (BlockTraits::child_end(Node->getEntry()) != Itor in RNSuccIterator() 191 Itor(BlockTraits::child_end(node->getEntry())) { in RNSuccIterator() 260 static inline ChildIteratorType child_end(NodeType *N) { \ 271 static inline ChildIteratorType child_end(NodeType *N) { \
|
D | RegionInfoImpl.h | 168 PE = InvBlockTraits::child_end(entry); in getEnteringBlock() 192 PE = InvBlockTraits::child_end(exit); in getExitingBlock() 244 SE = BlockTraits::child_end(BB); in verifyBBInRegion() 253 SE = InvBlockTraits::child_end(BB); in verifyBBInRegion() 271 SE = BlockTraits::child_end(BB); in verifyWalk() 451 PE = InvBlockTraits::child_end(getExit()); in getExpandedRegion() 464 PE = InvBlockTraits::child_end(getExit()); in getExpandedRegion() 561 PE = InvBlockTraits::child_end(BB); in isCommonDomFrontier() 649 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion() 843 else if (++BlockTraits::child_begin(BB) == BlockTraits::child_end(BB)) in getMaxRegionExit() [all …]
|
D | Interval.h | 131 static inline ChildIteratorType child_end(NodeType *N) { 143 static inline ChildIteratorType child_end(NodeType *N) {
|
D | IntervalIterator.h | 184 E = GT::child_end(Node); I != E; ++I) in ProcessInterval() 215 E = IGT::child_end(Node); I != E; ++I) { in ProcessNode() 238 End = GT::child_end(Node); It != End; ++It) in ProcessNode()
|
D | LoopInfo.h | 171 SE = BlockTraits::child_end(BB); SI != SE; ++SI) { in isLoopExiting() 187 E = InvBlockTraits::child_end(H); I != E; ++I) in getNumBackEdges() 254 E = InvBlockTraits::child_end(H); I != E; ++I) in getLoopLatches() 783 static inline ChildIteratorType child_end(NodeType *N) { 796 static inline ChildIteratorType child_end(NodeType *N) {
|
D | LazyCallGraph.h | 526 static ChildIteratorType child_end(NodeType *N) { return N->end(); } 534 static ChildIteratorType child_end(NodeType *N) { return N->end(); }
|
/external/llvm/include/llvm/ADT/ |
D | GraphTraits.h | 99 static ChildIteratorType child_end(NodeType* N) { 100 return GraphTraits<T>::child_end(N);
|
D | SCCIterator.h | 156 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren() 181 assert(VisitStack.back().NextChild == GT::child_end(visitingN)); in GetNextSCC() 216 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE; in hasLoop()
|
/external/llvm/include/llvm/IR/ |
D | CFG.h | 164 static inline ChildIteratorType child_end(NodeType *N) { 178 static inline ChildIteratorType child_end(NodeType *N) { 195 static inline ChildIteratorType child_end(NodeType *N) { 209 static inline ChildIteratorType child_end(NodeType *N) {
|
D | Type.h | 447 static inline ChildIteratorType child_end(NodeType *N) { 460 static inline ChildIteratorType child_end(NodeType *N) {
|
/external/clang/lib/AST/ |
D | Comment.cpp | 59 ASSERT_IMPLEMENTS_child_begin(&CLASS::child_end); in CheckCommentASTNodes() 83 Comment::child_iterator Comment::child_end() const { in child_end() function in clang::comments::Comment 89 return static_cast<const CLASS *>(this)->child_end(); in child_end() 107 for (child_iterator I = child_begin(), E = child_end(); I != E; ++I) { in isWhitespaceNoCache()
|
/external/llvm/unittests/ADT/ |
D | SCCIteratorTest.cpp | 225 static ChildIterator child_end(NodeType *Parent) { in child_end() function in llvm::Graph 239 static inline ChildIteratorType child_end(NodeType *Node) { in child_end() function 240 return Graph<N>::child_end(Node); in child_end()
|
/external/llvm/include/llvm/CodeGen/ |
D | MachineLoopInfo.h | 166 static inline ChildIteratorType child_end(NodeType *N) { 179 static inline ChildIteratorType child_end(NodeType *N) {
|
D | MachineBasicBlock.h | 804 static inline ChildIteratorType child_end(NodeType *N) { 817 static inline ChildIteratorType child_end(NodeType *N) { 837 static inline ChildIteratorType child_end(NodeType *N) { 851 static inline ChildIteratorType child_end(NodeType *N) {
|
/external/llvm/lib/Object/ |
D | Archive.cpp | 277 child_iterator E = child_end(); in Archive() 422 return child_end(); in child_begin() 435 Archive::child_iterator Archive::child_end() const { in child_end() function in Archive 604 return child_end(); in findSym() 608 return child_end(); in findSym()
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
D | IdenticalExprChecker.cpp | 334 while (I1 != Expr1->child_end() && I2 != Expr2->child_end()) { in isIdenticalStmt() 342 if (I1 != Expr1->child_end()) in isIdenticalStmt() 344 if (I2 != Expr2->child_end()) in isIdenticalStmt()
|
/external/llvm/include/llvm/Object/ |
D | Archive.h | 192 child_iterator child_end() const; 194 return make_range(child_begin(SkipInternal), child_end());
|
/external/clang/include/clang/Analysis/ |
D | CallGraph.h | 183 static inline ChildIteratorType child_end (NodeType *N) { 196 static inline ChildIteratorType child_end(NodeType *N) { return N->end(); }
|
/external/llvm/unittests/Analysis/ |
D | CallGraphTest.cpp | 37 auto F = GraphTraits<NodeTy *>::child_end(N); in canSpecializeGraphTraitsIterators()
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
D | ExplodedGraph.h | 456 static inline ChildIteratorType child_end(NodeType* N) { 482 static inline ChildIteratorType child_end(NodeType* N) {
|
/external/llvm/include/llvm/Support/ |
D | GenericDomTreeConstruction.h | 83 if (NextSucc == GraphT::child_end(BB)) { in DFSPass() 209 E = InvTraits::child_end(W); CI != E; ++CI) { in Calculate()
|
D | GraphWriter.h | 71 child_iterator EE = GTraits::child_end(Node); in getEdgeSourceLabels() 231 child_iterator EE = GTraits::child_end(Node); in writeNode()
|