Home
last modified time | relevance | path

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

12345

/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/swiftshader/third_party/LLVM/include/llvm/Support/
DDataFlow.h38 static inline ChildIteratorType child_end(NodeType *N) {
55 static inline ChildIteratorType child_end(NodeType *N) {
74 static inline ChildIteratorType child_end(NodeType *N) {
95 static inline ChildIteratorType child_end(NodeType *N) {
DCFG.h250 static inline ChildIteratorType child_end(NodeType *N) {
264 static inline ChildIteratorType child_end(NodeType *N) {
281 static inline ChildIteratorType child_end(NodeType *N) {
295 static inline ChildIteratorType child_end(NodeType *N) {
/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) {
DIntervalIterator.h184 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()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DRegionIterator.h111 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) in RNSuccIterator()
121 BItor(BlockTraits::child_end(node->getEntry())) {} in RNSuccIterator()
147 while (BItor != BlockTraits::child_end(getNode()->getEntry())
191 while (BlockTraits::child_end(Node->getEntry()) != Itor && in RNSuccIterator()
198 : Node(node), Itor(BlockTraits::child_end(node->getEntry())) { in RNSuccIterator()
267 static inline ChildIteratorType child_end(NodeRef N) { \
279 static inline ChildIteratorType child_end(NodeRef N) { \
DRegionInfoImpl.h169 InvBlockTraits::child_end(entry))) { in getEnteringBlock()
190 PE = InvBlockTraits::child_end(exit); in getExitingBlocks()
213 InvBlockTraits::child_end(exit))) { in getExitingBlock()
263 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyBBInRegion()
271 InvBlockTraits::child_end(BB))) { in verifyBBInRegion()
288 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyWalk()
470 InvBlockTraits::child_end(getExit()))) in getExpandedRegion()
482 InvBlockTraits::child_end(getExit()))) { in getExpandedRegion()
570 InvBlockTraits::child_end(BB))) { in isCommonDomFrontier()
655 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion()
[all …]
DIntervalIterator.h186 E = GT::child_end(Node); I != E; ++I) in ProcessInterval()
216 E = IGT::child_end(Node); I != E; ++I) { in ProcessNode()
239 End = GT::child_end(Node); It != End; ++It) in ProcessNode()
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DLoopInfo.h150 SE = BlockTraits::child_end(const_cast<BlockT*>(BB)); SI != SE; ++SI) { in isLoopExiting()
166 E = InvBlockTraits::child_end(const_cast<BlockT*>(H)); I != E; ++I) in getNumBackEdges()
194 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitingBlocks()
225 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitBlocks()
256 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); in getExitEdges()
279 if (SI != BlockTraits::child_end(Out)) in getLoopPreheader()
301 PE = InvBlockTraits::child_end(Header); PI != PE; ++PI) { in getLoopPredecessor()
323 InvBlockTraits::child_end(Header); in getLoopLatch()
433 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB); in verifyLoop()
441 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB); in verifyLoop()
[all …]
DBlockFrequencyImpl.h158 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in getSingleBlockPred()
195 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in doBlock()
239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head); in doLoop()
291 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); in doFunction()
326 SE = GraphTraits<BlockT *>::child_end(BB); SI != SE; ++SI) { in print()
DIntervalIterator.h175 E = GT::child_end(Node); I != E; ++I) in ProcessInterval()
206 E = IGT::child_end(Node); I != E; ++I) { in ProcessNode()
229 End = GT::child_end(Node); It != End; ++It) in ProcessNode()
/external/llvm/include/llvm/ADT/
DGraphTraits.h99 static ChildIteratorType child_end(NodeType* N) {
100 return GraphTraits<T>::child_end(N);
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DGraphTraits.h96 static ChildIteratorType child_end(NodeType* N) {
97 return GraphTraits<T>::child_end(N);
DSCCIterator.h82 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { in DFSVisitChildren()
103 assert(VisitStack.back().second ==GT::child_end(VisitStack.back().first)); in GetNextSCC()
181 for (ChildItTy CI = GT::child_begin(N), CE=GT::child_end(N); CI != CE; ++CI) 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/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/
DTestGraph.h230 static ChildIterator child_end(NodeType *Parent) { in child_end() function
244 static ChildIteratorType child_end(NodeRef Node) {
245 return Graph<N>::child_end(Node);
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
DCFG.h174 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
184 static ChildIteratorType child_end(NodeRef N) { return succ_end(N); }
198 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
207 static ChildIteratorType child_end(NodeRef N) { return pred_end(N); }
/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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
DSCCIterator.h158 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { in DFSVisitChildren()
183 assert(VisitStack.back().NextChild == GT::child_end(visitingN)); in GetNextSCC()
218 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE; in hasLoop()
DGraphTraits.h117 GraphTraits<GraphType>::child_end(G));
124 GraphTraits<Inverse<GraphType>>::child_end(G));
/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());

12345