/external/clang/include/clang/AST/ |
D | StmtOpenMP.h | 88 *child_begin() = S; in setAssociatedStmt() 199 return const_cast<Stmt *>(*child_begin()); in getAssociatedStmt() 336 &(*(std::next(child_begin(), getArraysOffset(getDirectiveKind()))))); in getCounters() 343 child_begin(), getArraysOffset(getDirectiveKind()) + CollapsedNum)); in getPrivateCounters() 350 &*std::next(child_begin(), in getInits() 358 &*std::next(child_begin(), in getUpdates() 366 &*std::next(child_begin(), in getFinals() 410 *std::next(child_begin(), IterationVariableOffset) = IV; in setIterationVariable() 413 *std::next(child_begin(), LastIterationOffset) = LI; in setLastIteration() 416 *std::next(child_begin(), CalcLastIterationOffset) = CLI; in setCalcLastIteration() [all …]
|
D | StmtGraphTraits.h | 34 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();
|
D | Comment.h | 230 child_iterator child_begin() const; 236 return child_end() - child_begin(); in child_count() 283 child_iterator child_begin() const { return nullptr; } in child_begin() function 341 child_iterator child_begin() const { return nullptr; } in child_begin() function 474 child_iterator child_begin() const { return nullptr; } in child_begin() function 529 child_iterator child_begin() const { return nullptr; } in child_begin() function 578 child_iterator child_begin() const { in child_begin() function 648 child_iterator child_begin() const { in child_begin() function 885 child_iterator child_begin() const { return nullptr; } in child_begin() function 916 child_iterator child_begin() const { in child_begin() 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() 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 …]
|
D | RegionInfoImpl.h | 167 for (PredIterTy PI = InvBlockTraits::child_begin(entry), in getEnteringBlock() 191 for (PredIterTy PI = InvBlockTraits::child_begin(exit), in getExitingBlock() 243 for (SuccIterTy SI = BlockTraits::child_begin(BB), in verifyBBInRegion() 252 for (PredIterTy SI = InvBlockTraits::child_begin(BB), in verifyBBInRegion() 270 for (SuccIterTy SI = BlockTraits::child_begin(BB), in verifyWalk() 450 for (PredIterTy PI = InvBlockTraits::child_begin(getExit()), in getExpandedRegion() 456 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT); in getExpandedRegion() 463 for (PredIterTy PI = InvBlockTraits::child_begin(getExit()), in getExpandedRegion() 560 for (PredIterTy PI = InvBlockTraits::child_begin(BB), in isCommonDomFrontier() 649 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion() [all …]
|
D | IntervalIterator.h | 183 for (typename GT::ChildIteratorType I = GT::child_begin(Node), in ProcessInterval() 214 for (typename IGT::ChildIteratorType I = IGT::child_begin(Node), in ProcessNode() 237 for (typename GT::ChildIteratorType It = GT::child_begin(Node), in ProcessNode()
|
D | Interval.h | 128 static inline ChildIteratorType child_begin(NodeType *N) { 140 static inline ChildIteratorType child_begin(NodeType *N) {
|
D | RegionIterator.h | 97 BItor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator() 177 Itor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator() 257 static inline ChildIteratorType child_begin(NodeType *N) { \ 268 static inline ChildIteratorType child_begin(NodeType *N) { \
|
D | LoopInfo.h | 170 BlockTraits::child_begin(BB), in isLoopExiting() 186 InvBlockTraits::child_begin(H), in getNumBackEdges() 253 InvBlockTraits::child_begin(H), in getLoopLatches() 780 static inline ChildIteratorType child_begin(NodeType *N) { 793 static inline ChildIteratorType child_begin(NodeType *N) {
|
D | LazyCallGraph.h | 525 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); } 533 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
|
/external/llvm/include/llvm/ADT/ |
D | GraphTraits.h | 95 static ChildIteratorType child_begin(NodeType* N) { 96 return GraphTraits<T>::child_begin(N);
|
D | DepthFirstIterator.h | 84 std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node))); in df_iterator() 93 std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node))); in df_iterator() 109 It = GT::child_begin(Node); in toNext() 119 std::make_pair(PointerIntTy(Next, 0), GT::child_begin(Next))); in toNext()
|
D | PostOrderIterator.h | 110 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild() 117 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator() 125 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
|
D | SCCIterator.h | 146 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/llvm/include/llvm/IR/ |
D | CFG.h | 161 static inline ChildIteratorType child_begin(NodeType *N) { 175 static inline ChildIteratorType child_begin(NodeType *N) { 192 static inline ChildIteratorType child_begin(NodeType *N) { 206 static inline ChildIteratorType child_begin(NodeType *N) {
|
/external/clang/lib/AST/ |
D | Comment.cpp | 58 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/Support/ |
D | GenericDomTreeConstruction.h | 57 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); in DFSPass() 66 if (NextSucc == GraphT::child_begin(BB)) { in DFSPass() 98 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ))); in DFSPass() 208 InvTraits::child_begin(W), in Calculate()
|
D | GraphWriter.h | 70 child_iterator EI = GTraits::child_begin(Node); in getEdgeSourceLabels() 230 child_iterator EI = GTraits::child_begin(Node); in writeNode() 248 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt); in writeEdge()
|
D | GenericDomTree.h | 255 assert(std::distance(GraphT::child_begin(NewBB), in Split() 258 typename GraphT::NodeType *NewBBSucc = *GraphT::child_begin(NewBB); in Split() 263 PI = InvTraits::child_begin(NewBB), in Split() 272 PI = InvTraits::child_begin(NewBBSucc), in Split() 737 if (TraitsTy::child_begin(&*I) == TraitsTy::child_end(&*I)) in recalculate()
|
/external/llvm/unittests/ADT/ |
D | SCCIteratorTest.cpp | 220 static ChildIterator child_begin(NodeType *Parent) { in child_begin() function in llvm::Graph 236 static inline ChildIteratorType child_begin(NodeType *Node) { in child_begin() function 237 return Graph<N>::child_begin(Node); in child_begin()
|
/external/llvm/include/llvm/CodeGen/ |
D | MachineLoopInfo.h | 163 static inline ChildIteratorType child_begin(NodeType *N) { 176 static inline ChildIteratorType child_begin(NodeType *N) {
|
D | MachineBasicBlock.h | 801 static inline ChildIteratorType child_begin(NodeType *N) { 814 static inline ChildIteratorType child_begin(NodeType *N) { 834 static inline ChildIteratorType child_begin(NodeType *N) { 848 static inline ChildIteratorType child_begin(NodeType *N) {
|
/external/llvm/include/llvm/Object/ |
D | Archive.h | 191 child_iterator child_begin(bool SkipInternal = true) const; 194 return make_range(child_begin(SkipInternal), child_end());
|
/external/clang/include/clang/Analysis/ |
D | CallGraph.h | 180 static inline ChildIteratorType child_begin(NodeType *N) { 195 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();}
|
/external/llvm/unittests/Analysis/ |
D | CallGraphTest.cpp | 36 auto S = GraphTraits<NodeTy *>::child_begin(N); in canSpecializeGraphTraitsIterators()
|