Home
last modified time | relevance | path

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

123

/external/clang/include/clang/AST/
DStmtOpenMP.h88 *child_begin() = S; in setAssociatedStmt()
199 return const_cast<Stmt *>(*child_begin()); in getAssociatedStmt()
336 &(*(std::next(child_begin(), getArraysOffset(getDirectiveKind()))))); in getCounters()
343 child_begin(), getArraysOffset(getDirectiveKind()) + CollapsedNum)); in getPrivateCounters()
350 &*std::next(child_begin(), in getInits()
358 &*std::next(child_begin(), in getUpdates()
366 &*std::next(child_begin(), in getFinals()
410 *std::next(child_begin(), IterationVariableOffset) = IV; in setIterationVariable()
413 *std::next(child_begin(), LastIterationOffset) = LI; in setLastIteration()
416 *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/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.h167 for (PredIterTy PI = InvBlockTraits::child_begin(entry), in getEnteringBlock()
191 for (PredIterTy PI = InvBlockTraits::child_begin(exit), in getExitingBlock()
243 for (SuccIterTy SI = BlockTraits::child_begin(BB), in verifyBBInRegion()
252 for (PredIterTy SI = InvBlockTraits::child_begin(BB), in verifyBBInRegion()
270 for (SuccIterTy SI = BlockTraits::child_begin(BB), in verifyWalk()
450 for (PredIterTy PI = InvBlockTraits::child_begin(getExit()), in getExpandedRegion()
456 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT); in getExpandedRegion()
463 for (PredIterTy PI = InvBlockTraits::child_begin(getExit()), in getExpandedRegion()
560 for (PredIterTy PI = InvBlockTraits::child_begin(BB), in isCommonDomFrontier()
649 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion()
[all …]
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()
DInterval.h128 static inline ChildIteratorType child_begin(NodeType *N) {
140 static inline ChildIteratorType child_begin(NodeType *N) {
DRegionIterator.h97 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) { \
DLoopInfo.h170 BlockTraits::child_begin(BB), in isLoopExiting()
186 InvBlockTraits::child_begin(H), in getNumBackEdges()
253 InvBlockTraits::child_begin(H), in getLoopLatches()
780 static inline ChildIteratorType child_begin(NodeType *N) {
793 static inline ChildIteratorType child_begin(NodeType *N) {
DLazyCallGraph.h525 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
533 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
/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()
DPostOrderIterator.h110 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
117 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
125 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
DSCCIterator.h146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
216 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE; in hasLoop()
/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/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()
DGraphWriter.h70 child_iterator EI = GTraits::child_begin(Node); in getEdgeSourceLabels()
230 child_iterator EI = GTraits::child_begin(Node); in writeNode()
248 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt); in writeEdge()
DGenericDomTree.h255 assert(std::distance(GraphT::child_begin(NewBB), in Split()
258 typename GraphT::NodeType *NewBBSucc = *GraphT::child_begin(NewBB); in Split()
263 PI = InvTraits::child_begin(NewBB), in Split()
272 PI = InvTraits::child_begin(NewBBSucc), in Split()
737 if (TraitsTy::child_begin(&*I) == TraitsTy::child_end(&*I)) in recalculate()
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp220 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/llvm/include/llvm/CodeGen/
DMachineLoopInfo.h163 static inline ChildIteratorType child_begin(NodeType *N) {
176 static inline ChildIteratorType child_begin(NodeType *N) {
DMachineBasicBlock.h801 static inline ChildIteratorType child_begin(NodeType *N) {
814 static inline ChildIteratorType child_begin(NodeType *N) {
834 static inline ChildIteratorType child_begin(NodeType *N) {
848 static inline ChildIteratorType child_begin(NodeType *N) {
/external/llvm/include/llvm/Object/
DArchive.h191 child_iterator child_begin(bool SkipInternal = true) const;
194 return make_range(child_begin(SkipInternal), child_end());
/external/clang/include/clang/Analysis/
DCallGraph.h180 static inline ChildIteratorType child_begin(NodeType *N) {
195 static inline ChildIteratorType child_begin(NodeType *N) { return N->begin();}
/external/llvm/unittests/Analysis/
DCallGraphTest.cpp36 auto S = GraphTraits<NodeTy *>::child_begin(N); in canSpecializeGraphTraitsIterators()

123