Home
last modified time | relevance | path

Searched refs:child_begin (Results 1 – 25 of 175) sorted by relevance

1234567

/external/clang/include/clang/AST/
DStmtOpenMP.h87 *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 …]
DStmtGraphTraits.h34 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();
DComment.h230 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-project/clang/include/clang/AST/
DStmtGraphTraits.h30 static ChildIteratorType child_begin(NodeRef N) {
31 if (N) return N->child_begin();
56 static ChildIteratorType child_begin(NodeRef N) {
57 if (N) return N->child_begin();
DComment.h224 child_iterator child_begin() const;
230 return child_end() - child_begin(); in child_count()
277 child_iterator child_begin() const { return nullptr; } in child_begin() function
336 child_iterator child_begin() const { return nullptr; } in child_begin() function
468 child_iterator child_begin() const { return nullptr; } in child_begin() function
523 child_iterator child_begin() const { return nullptr; } in child_begin() function
572 child_iterator child_begin() const { in child_begin() function
642 child_iterator child_begin() const { in child_begin() function
879 child_iterator child_begin() const { return nullptr; } in child_begin() function
910 child_iterator child_begin() const { in child_begin() 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()
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 …]
DRegionInfoImpl.h166 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 …]
DInterval.h130 static inline ChildIteratorType child_begin(NodeType *N) {
142 static inline ChildIteratorType child_begin(NodeType *N) {
DIntervalIterator.h183 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()
/external/llvm-project/llvm/include/llvm/Analysis/
DRegionInfoImpl.h167 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(entry), in getEnteringBlock()
188 for (PredIterTy PI = InvBlockTraits::child_begin(exit), in getExitingBlocks()
211 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(exit), in getExitingBlock()
262 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyBBInRegion()
269 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(BB), in verifyBBInRegion()
287 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyWalk()
468 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(getExit()), in getExpandedRegion()
473 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT); in getExpandedRegion()
480 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(getExit()), in getExpandedRegion()
568 for (BlockT *P : make_range(InvBlockTraits::child_begin(BB), in isCommonDomFrontier()
[all …]
DInterval.h126 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
135 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
DIntervalIterator.h184 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()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DRegionInfoImpl.h167 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(entry), in getEnteringBlock()
188 for (PredIterTy PI = InvBlockTraits::child_begin(exit), in getExitingBlocks()
211 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(exit), in getExitingBlock()
262 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyBBInRegion()
269 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(BB), in verifyBBInRegion()
287 make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) { in verifyWalk()
468 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(getExit()), in getExpandedRegion()
473 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT); in getExpandedRegion()
480 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(getExit()), in getExpandedRegion()
568 for (BlockT *P : make_range(InvBlockTraits::child_begin(BB), in isCommonDomFrontier()
[all …]
DInterval.h126 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
135 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
DIntervalIterator.h184 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()
DRegionIterator.h107 BItor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
184 : Node(node), Itor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
263 static inline ChildIteratorType child_begin(NodeRef N) { \
275 static inline ChildIteratorType child_begin(NodeRef N) { \
/external/llvm/include/llvm/ADT/
DGraphTraits.h95 static ChildIteratorType child_begin(NodeType* N) {
96 return GraphTraits<T>::child_begin(N);
DDepthFirstIterator.h84 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/
DCFG.h161 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/llvm-project/llvm/unittests/ADT/
DTestGraph.h224 static ChildIterator child_begin(NodeType *Parent) { in child_begin() function
240 static ChildIteratorType child_begin(NodeRef Node) {
241 return Graph<N>::child_begin(Node);
/external/llvm-project/llvm/include/llvm/ADT/
DGraphTraits.h122 return make_range(GraphTraits<GraphType>::child_begin(G),
129 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
DGraphTraits.h122 return make_range(GraphTraits<GraphType>::child_begin(G),
129 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
/external/llvm-project/mlir/include/mlir/IR/
DRegionGraphTraits.h29 static ChildIteratorType child_begin(NodeRef node) {
42 static inline ChildIteratorType child_begin(NodeRef node) {
/external/clang/lib/AST/
DComment.cpp58 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/
DGenericDomTreeConstruction.h57 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()

1234567