Home
last modified time | relevance | path

Searched refs:child_end (Results 1 – 25 of 166) sorted by relevance

1234567

/external/clang/include/clang/AST/
DStmtGraphTraits.h39 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();
DComment.h231 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-project/clang/include/clang/AST/
DStmtGraphTraits.h35 static ChildIteratorType child_end(NodeRef N) {
36 if (N) return N->child_end();
61 static ChildIteratorType child_end(NodeRef N) {
62 if (N) return N->child_end();
DComment.h225 child_iterator child_end() const;
230 return child_end() - child_begin(); in child_count()
279 child_iterator child_end() const { return nullptr; } in child_end() function
338 child_iterator child_end() const { return nullptr; } in child_end() function
470 child_iterator child_end() const { return nullptr; } in child_end() function
525 child_iterator child_end() const { return nullptr; } in child_end() function
576 child_iterator child_end() const { in child_end() function
646 child_iterator child_end() const { in child_end() function
881 child_iterator child_end() const { return nullptr; } in child_end() function
914 child_iterator child_end() const { in child_end() 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()
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 …]
DRegionIterator.h101 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) { \
DRegionInfoImpl.h167 PE = InvBlockTraits::child_end(entry); in getEnteringBlock()
191 PE = InvBlockTraits::child_end(exit); in getExitingBlock()
243 SE = BlockTraits::child_end(BB); in verifyBBInRegion()
252 SE = InvBlockTraits::child_end(BB); in verifyBBInRegion()
270 SE = BlockTraits::child_end(BB); in verifyWalk()
450 PE = InvBlockTraits::child_end(getExit()); in getExpandedRegion()
463 PE = InvBlockTraits::child_end(getExit()); in getExpandedRegion()
560 PE = InvBlockTraits::child_end(BB); in isCommonDomFrontier()
648 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion()
842 else if (++BlockTraits::child_begin(BB) == BlockTraits::child_end(BB)) in getMaxRegionExit()
[all …]
DInterval.h133 static inline ChildIteratorType child_end(NodeType *N) {
145 static inline ChildIteratorType child_end(NodeType *N) {
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DRegionIterator.h110 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator()
120 BItor(BlockTraits::child_end(node->getEntry())) {} in RNSuccIterator()
146 while (BItor != BlockTraits::child_end(getNode()->getEntry())
190 while (BlockTraits::child_end(Node->getEntry()) != Itor && in RNSuccIterator()
197 : Node(node), Itor(BlockTraits::child_end(node->getEntry())) { in RNSuccIterator()
266 static inline ChildIteratorType child_end(NodeRef N) { \
278 static inline ChildIteratorType child_end(NodeRef N) { \
DRegionInfoImpl.h168 InvBlockTraits::child_end(entry))) { in getEnteringBlock()
189 PE = InvBlockTraits::child_end(exit); in getExitingBlocks()
212 InvBlockTraits::child_end(exit))) { in getExitingBlock()
262 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyBBInRegion()
270 InvBlockTraits::child_end(BB))) { in verifyBBInRegion()
287 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyWalk()
469 InvBlockTraits::child_end(getExit()))) in getExpandedRegion()
481 InvBlockTraits::child_end(getExit()))) { in getExpandedRegion()
569 InvBlockTraits::child_end(BB))) { in isCommonDomFrontier()
654 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion()
[all …]
DInterval.h127 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
136 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
/external/llvm-project/llvm/include/llvm/Analysis/
DRegionIterator.h110 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator()
120 BItor(BlockTraits::child_end(node->getEntry())) {} in RNSuccIterator()
146 while (BItor != BlockTraits::child_end(getNode()->getEntry())
190 while (BlockTraits::child_end(Node->getEntry()) != Itor && in RNSuccIterator()
197 : Node(node), Itor(BlockTraits::child_end(node->getEntry())) { in RNSuccIterator()
266 static inline ChildIteratorType child_end(NodeRef N) { \
278 static inline ChildIteratorType child_end(NodeRef N) { \
DRegionInfoImpl.h168 InvBlockTraits::child_end(entry))) { in getEnteringBlock()
189 PE = InvBlockTraits::child_end(exit); in getExitingBlocks()
212 InvBlockTraits::child_end(exit))) { in getExitingBlock()
262 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyBBInRegion()
270 InvBlockTraits::child_end(BB))) { in verifyBBInRegion()
287 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyWalk()
469 InvBlockTraits::child_end(getExit()))) in getExpandedRegion()
481 InvBlockTraits::child_end(getExit()))) { in getExpandedRegion()
569 InvBlockTraits::child_end(BB))) { in isCommonDomFrontier()
654 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion()
[all …]
DInterval.h127 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
136 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
/external/llvm/include/llvm/ADT/
DGraphTraits.h99 static ChildIteratorType child_end(NodeType* N) {
100 return GraphTraits<T>::child_end(N);
DSCCIterator.h156 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/
DCFG.h164 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) {
/external/llvm-project/llvm/unittests/ADT/
DTestGraph.h229 static ChildIterator child_end(NodeType *Parent) { in child_end() function
243 static ChildIteratorType child_end(NodeRef Node) {
244 return Graph<N>::child_end(Node);
/external/llvm-project/llvm/include/llvm/ADT/
DGraphTraits.h123 GraphTraits<GraphType>::child_end(G));
130 GraphTraits<Inverse<GraphType>>::child_end(G));
DSCCIterator.h160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
185 assert(VisitStack.back().NextChild == GT::child_end(visitingN)); in GetNextSCC()
220 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE; in hasCycle()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DGraphTraits.h123 GraphTraits<GraphType>::child_end(G));
130 GraphTraits<Inverse<GraphType>>::child_end(G));
DSCCIterator.h160 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
185 assert(VisitStack.back().NextChild == GT::child_end(visitingN)); in GetNextSCC()
220 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE; in hasLoop()
/external/llvm-project/mlir/include/mlir/IR/
DRegionGraphTraits.h32 static ChildIteratorType child_end(NodeRef node) { return node->succ_end(); }
45 static inline ChildIteratorType child_end(NodeRef node) {
/external/clang/lib/AST/
DComment.cpp59 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/include/llvm/Object/
DArchive.h138 C = C.getParent()->child_end().C;
201 child_iterator child_end() const;
204 return make_range(child_begin(Err, SkipInternal), child_end());

1234567