| /external/clang/include/clang/AST/ |
| D | StmtOpenMP.h | 87 *child_begin() = S; in setAssociatedStmt()
198 return const_cast<Stmt *>(*child_begin()); in getAssociatedStmt()
341 &(*(std::next(child_begin(), getArraysOffset(getDirectiveKind()))))); in getCounters()
348 child_begin(), getArraysOffset(getDirectiveKind()) + CollapsedNum)); in getPrivateCounters()
355 &*std::next(child_begin(), in getInits()
363 &*std::next(child_begin(), in getUpdates()
371 &*std::next(child_begin(), in getFinals()
415 *std::next(child_begin(), IterationVariableOffset) = IV; in setIterationVariable()
418 *std::next(child_begin(), LastIterationOffset) = LI; in setLastIteration()
421 *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/swiftshader/third_party/LLVM/include/llvm/Support/ |
| D | DataFlow.h | 34 static inline ChildIteratorType child_begin(NodeType *N) {
51 static inline ChildIteratorType child_begin(NodeType *N) {
68 static inline ChildIteratorType child_begin(NodeType *N) {
89 static inline ChildIteratorType child_begin(NodeType *N) {
|
| D | CFG.h | 247 static inline ChildIteratorType child_begin(NodeType *N) {
261 static inline ChildIteratorType child_begin(NodeType *N) {
278 static inline ChildIteratorType child_begin(NodeType *N) {
292 static inline ChildIteratorType child_begin(NodeType *N) {
|
| /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 | 166 for (PredIterTy PI = InvBlockTraits::child_begin(entry), in getEnteringBlock()
190 for (PredIterTy PI = InvBlockTraits::child_begin(exit), in getExitingBlock()
242 for (SuccIterTy SI = BlockTraits::child_begin(BB), in verifyBBInRegion()
251 for (PredIterTy SI = InvBlockTraits::child_begin(BB), in verifyBBInRegion()
269 for (SuccIterTy SI = BlockTraits::child_begin(BB), in verifyWalk()
449 for (PredIterTy PI = InvBlockTraits::child_begin(getExit()), in getExpandedRegion()
455 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT); in getExpandedRegion()
462 for (PredIterTy PI = InvBlockTraits::child_begin(getExit()), in getExpandedRegion()
559 for (PredIterTy PI = InvBlockTraits::child_begin(BB), in isCommonDomFrontier()
648 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion()
[all …]
|
| D | Interval.h | 130 static inline ChildIteratorType child_begin(NodeType *N) {
142 static inline ChildIteratorType child_begin(NodeType *N) {
|
| 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 | 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) { \
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| D | LoopInfo.h | 149 BlockTraits::child_begin(const_cast<BlockT*>(BB)), in isLoopExiting()
165 InvBlockTraits::child_begin(const_cast<BlockT*>(H)), 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()
277 typename BlockTraits::ChildIteratorType SI = BlockTraits::child_begin(Out); in getLoopPreheader()
300 InvBlockTraits::child_begin(Header), in getLoopPredecessor()
321 InvBlockTraits::child_begin(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 …]
|
| D | BlockFrequencyImpl.h | 157 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in getSingleBlockPred()
194 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in doBlock()
238 PI = GraphTraits< Inverse<BlockT *> >::child_begin(Head), in doLoop()
290 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), in doFunction()
325 SI = GraphTraits<BlockT *>::child_begin(BB), in print()
|
| D | IntervalIterator.h | 174 for (typename GT::ChildIteratorType I = GT::child_begin(Node), in ProcessInterval()
205 for (typename IGT::ChildIteratorType I = IGT::child_begin(Node), in ProcessNode()
228 for (typename GT::ChildIteratorType It = GT::child_begin(Node), in ProcessNode()
|
| D | Interval.h | 131 static inline ChildIteratorType child_begin(NodeType *N) {
143 static inline ChildIteratorType child_begin(NodeType *N) {
|
| D | DominatorInternals.h | 58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); in DFSPass()
67 if (NextSucc == GraphT::child_begin(BB)) { in DFSPass()
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ))); in DFSPass()
209 InvTraits::child_begin(W), in Calculate()
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | GraphTraits.h | 92 static ChildIteratorType child_begin(NodeType* N) {
93 return GraphTraits<T>::child_begin(N);
|
| D | DepthFirstIterator.h | 83 GT::child_begin(Node))); in df_iterator()
92 GT::child_begin(Node))); in df_iterator()
108 It = GT::child_begin(Node); in toNext()
119 GT::child_begin(Next))); in toNext()
|
| /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()
|
| /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()
|
| /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/swiftshader/third_party/LLVM/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 222 static ChildIterator child_begin(NodeType *Parent) { in child_begin() function in llvm::Graph
238 static inline ChildIteratorType child_begin(NodeType *Node) { in child_begin() function
239 return Graph<N>::child_begin(Node); in child_begin()
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| D | MachineLoopInfo.h | 155 static inline ChildIteratorType child_begin(NodeType *N) {
168 static inline ChildIteratorType child_begin(NodeType *N) {
|