/external/clang/include/clang/AST/ |
H A D | StmtGraphTraits.h | 39 static inline ChildIteratorType child_end(NodeType* N) { function in struct:llvm::GraphTraits 40 if (N) return N->child_end(); 66 static inline ChildIteratorType child_end(NodeType* N) { function in struct:llvm::GraphTraits 67 if (N) return N->child_end();
|
H A D | Comment.h | 231 child_iterator child_end() const; 236 return child_end() - child_begin(); 285 child_iterator child_end() const { return nullptr; } function in class:clang::comments::TextComment 343 child_iterator child_end() const { return nullptr; } function in class:clang::comments::InlineCommandComment 476 child_iterator child_end() const { return nullptr; } function in class:clang::comments::HTMLStartTagComment 531 child_iterator child_end() const { return nullptr; } function in class:clang::comments::HTMLEndTagComment 582 child_iterator child_end() const { function in class:clang::comments::ParagraphComment 652 child_iterator child_end() const { function in class:clang::comments::BlockCommandComment 887 child_iterator child_end() const { return nullptr; } function in class:clang::comments::ParamCommandComment::VerbatimBlockLineComment 920 child_iterator child_end() cons function in class:clang::comments::ParamCommandComment::VerbatimBlockComment 974 child_iterator child_end() const { return nullptr; } function in class:clang::comments::ParamCommandComment::VerbatimLineComment 1121 child_iterator child_end() const { function in class:clang::comments::ParamCommandComment::FullComment [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | GraphTraits.h | 37 // static ChildIteratorType child_end (NodeType *) 99 static ChildIteratorType child_end(NodeType* N) { function in struct:llvm::GraphTraits 100 return GraphTraits<T>::child_end(N);
|
H A D | SCCIterator.h | 156 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) { 181 assert(VisitStack.back().NextChild == GT::child_end(visitingN)); 216 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE;
|
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | GraphTraits.h | 37 // static ChildIteratorType child_end (NodeType *) 96 static ChildIteratorType child_end(NodeType* N) { function in struct:llvm::GraphTraits 97 return GraphTraits<T>::child_end(N);
|
H A D | SCCIterator.h | 82 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) { 103 assert(VisitStack.back().second ==GT::child_end(VisitStack.back().first)); 181 for (ChildItTy CI = GT::child_begin(N), CE=GT::child_end(N); CI != CE; ++CI)
|
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
H A D | DataFlow.h | 38 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 55 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 74 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 95 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
H A D | CFG.h | 250 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 264 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 281 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 295 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
/external/llvm/include/llvm/Analysis/ |
H A D | Interval.h | 133 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 145 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
H A D | RegionIterator.h | 101 while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor)) 111 BItor(BlockTraits::child_end(node->getEntry())) {} 137 while (BItor != BlockTraits::child_end(getNode()->getEntry()) 183 while (BlockTraits::child_end(Node->getEntry()) != Itor 191 Itor(BlockTraits::child_end(node->getEntry())) { 250 // and child_end fail. 260 static inline ChildIteratorType child_end(NodeType *N) { \ 271 static inline ChildIteratorType child_end(NodeType *N) { \
|
H A D | LoopInfoImpl.h | 39 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 68 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 93 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 117 if (SI != BlockTraits::child_end(Out)) 139 PE = InvBlockTraits::child_end(Header); PI != PE; ++PI) { 162 InvBlockTraits::child_end(Header); 249 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB); 257 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(BB); 373 InvBlockTraits::child_end(PredBB)); 395 PE = InvBlockTraits::child_end(PredB [all...] |
H A D | IntervalIterator.h | 184 E = GT::child_end(Node); I != E; ++I) 215 E = IGT::child_end(Node); I != E; ++I) { 238 End = GT::child_end(Node); It != End; ++It)
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineLoopInfo.h | 158 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 171 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
H A D | Interval.h | 134 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 146 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
H A D | BlockFrequencyImpl.h | 158 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); 195 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); 239 PE = GraphTraits< Inverse<BlockT *> >::child_end(Head); 291 PE = GraphTraits< Inverse<BlockT *> >::child_end(BB); 326 SE = GraphTraits<BlockT *>::child_end(BB); SI != SE; ++SI) {
|
H A D | LoopInfo.h | 150 SE = BlockTraits::child_end(const_cast<BlockT*>(BB)); SI != SE; ++SI) { 166 E = InvBlockTraits::child_end(const_cast<BlockT*>(H)); I != E; ++I) 194 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 225 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 256 BlockTraits::child_begin(*BI), E = BlockTraits::child_end(*BI); 279 if (SI != BlockTraits::child_end(Out)) 301 PE = InvBlockTraits::child_end(Header); PI != PE; ++PI) { 323 InvBlockTraits::child_end(Header); 433 BlockTraits::child_begin(BB), SE = BlockTraits::child_end(BB); 441 InvBlockTraits::child_begin(BB), PE = InvBlockTraits::child_end(B 1079 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 1092 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits [all...] |
H A D | IntervalIterator.h | 175 E = GT::child_end(Node); I != E; ++I) 206 E = IGT::child_end(Node); I != E; ++I) { 229 End = GT::child_end(Node); It != End; ++It)
|
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
H A D | MachineLoopInfo.h | 158 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 171 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
/external/llvm/include/llvm/IR/ |
H A D | CFG.h | 164 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 178 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 195 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits 209 static inline ChildIteratorType child_end(NodeType *N) { function in struct:llvm::GraphTraits
|
/external/llvm/unittests/Analysis/ |
H A D | CallGraphTest.cpp | 37 auto F = GraphTraits<NodeTy *>::child_end(N);
|
/external/clang/lib/AST/ |
H A D | Comment.cpp | 59 ASSERT_IMPLEMENTS_child_begin(&CLASS::child_end); 83 Comment::child_iterator Comment::child_end() const { function in class:clang::comments::Comment 89 return static_cast<const CLASS *>(this)->child_end(); 107 for (child_iterator I = child_begin(), E = child_end(); I != E; ++I) {
|
/external/llvm/lib/Analysis/ |
H A D | IteratedDominanceFrontier.cpp | 68 End = GraphTraits<NodeTy>::child_end(BB);
|
/external/llvm/include/llvm/Object/ |
H A D | Archive.h | 121 // will have been set to child_end(), and the following comparison should 138 C = C.getParent()->child_end().C; 201 child_iterator child_end() const; 204 return make_range(child_begin(Err, SkipInternal), child_end());
|
/external/llvm/unittests/ADT/ |
H A D | SCCIteratorTest.cpp | 224 /// child_end - Return the end iterator for children of the given node. 225 static ChildIterator child_end(NodeType *Parent) { 239 static inline ChildIteratorType child_end(NodeType *Node) { function in struct:llvm::GraphTraits 240 return Graph<N>::child_end(Node);
|
/external/swiftshader/third_party/LLVM/unittests/ADT/ |
H A D | SCCIteratorTest.cpp | 226 /// child_end - Return the end iterator for children of the given node. 227 static ChildIterator child_end(NodeType *Parent) { 241 static inline ChildIteratorType child_end(NodeType *Node) { function in struct:llvm::GraphTraits 242 return Graph<N>::child_end(Node);
|