Home
last modified time | relevance | path

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

123

/openbsd/gnu/llvm/clang/include/clang/AST/
H A 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();
H A DComment.h229 child_iterator child_begin() const;
235 return child_end() - child_begin(); in child_count()
282 child_iterator child_begin() const { return nullptr; } in child_begin() function
334 child_iterator child_begin() const { return nullptr; } in child_begin() function
460 child_iterator child_begin() const { return nullptr; } in child_begin() function
515 child_iterator child_begin() const { return nullptr; } in child_begin() function
564 child_iterator child_begin() const { in child_begin() function
625 child_iterator child_begin() const { in child_begin() function
862 child_iterator child_begin() const { return nullptr; } in child_begin() function
893 child_iterator child_begin() const { in child_begin() function
[all …]
/openbsd/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h135 static inline ChildIteratorType child_begin(NodeRef N) {
154 static inline ChildIteratorType child_begin(NodeRef N) {
181 static inline ChildIteratorType child_begin(NodeRef N) {
200 static inline ChildIteratorType child_begin(NodeRef N) {
246 static inline ChildIteratorType child_begin(NodeRef N) {
261 static inline ChildIteratorType child_begin(NodeRef N) {
281 static inline ChildIteratorType child_begin(NodeRef N) {
/openbsd/gnu/llvm/llvm/include/llvm/Analysis/
H A DRegionInfoImpl.h180 for (PredIterTy PI = InvBlockTraits::child_begin(exit), in getExitingBlocks()
205 return find_singleton<BlockT>(make_range(InvBlockTraits::child_begin(exit), in getExitingBlock()
255 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(BB), in verifyBBInRegion()
454 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(getExit()), in getExpandedRegion()
466 for (BlockT *Pred : make_range(InvBlockTraits::child_begin(getExit()), in getExpandedRegion()
554 for (BlockT *P : make_range(InvBlockTraits::child_begin(BB), in isCommonDomFrontier()
638 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion()
640 if (num_successors <= 1 && exit == *(BlockTraits::child_begin(entry))) in isTrivialRegion()
831 else if (++BlockTraits::child_begin(BB) == BlockTraits::child_end(BB)) in getMaxRegionExit()
832 Exit = *BlockTraits::child_begin(BB); in getMaxRegionExit()
[all …]
H A DInterval.h123 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
132 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
H A DIntervalIterator.h183 for (typename GT::ChildIteratorType I = GT::child_begin(Node), in ProcessInterval()
213 for (typename IGT::ChildIteratorType I = IGT::child_begin(Node), in ProcessNode()
234 for (typename GT::ChildIteratorType It = GT::child_begin(Node), in ProcessNode()
H A DRegionIterator.h111 BItor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
191 : Node(node), Itor(BlockTraits::child_begin(node->getEntry())) { in RNSuccIterator()
270 static inline ChildIteratorType child_begin(NodeRef N) { \
282 static inline ChildIteratorType child_begin(NodeRef N) { \
H A DLoopInfoImpl.h196 typename BlockTraits::ChildIteratorType SI = BlockTraits::child_begin(Out); in getLoopPreheader()
318 assert(std::any_of(GraphTraits<BlockT *>::child_begin(BB), in verifyLoop()
323 assert(std::any_of(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
330 llvm::make_range(GraphTraits<Inverse<BlockT *>>::child_begin(BB), in verifyLoop()
464 InvBlockTraits::child_begin(PredBB), in discoverAndMapSubloop()
H A DCFG.h151 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) { in containsIrreducibleCFG()
H A DCallGraph.h438 static ChildIteratorType child_begin(NodeRef N) {
459 static ChildIteratorType child_begin(NodeRef N) {
/openbsd/gnu/llvm/llvm/include/llvm/ADT/
H A DGraphTraits.h124 return make_range(GraphTraits<GraphType>::child_begin(G),
131 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
H A DGenericCycleInfo.h159 const_child_iterator child_begin() const { in child_begin() function
320 static ChildIteratorType child_begin(NodeRef Ref) { in child_begin() function
321 return Ref->child_begin(); in child_begin()
H A DPostOrderIterator.h115 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
124 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in po_iterator()
139 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB))); in traverseChild()
H A DSCCIterator.h154 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
224 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE; in hasCycle()
H A DBreadthFirstIterator.h87 ChildIt.emplace(GT::child_begin(Node)); in toNext()
/openbsd/gnu/llvm/clang/lib/AST/
H A DComment.cpp71 ASSERT_IMPLEMENTS_child_begin(&CLASS::child_begin); \ in CheckCommentASTNodes()
82 Comment::child_iterator Comment::child_begin() const { in child_begin() function in clang::comments::Comment
88 return static_cast<const CLASS *>(this)->child_begin(); in child_begin()
115 for (child_iterator I = child_begin(), E = child_end(); I != E; ++I) { in isWhitespaceNoCache()
/openbsd/gnu/llvm/llvm/include/llvm/IR/
H A DCFG.h305 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
315 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
329 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
338 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
/openbsd/gnu/llvm/llvm/include/llvm/Support/
H A DGraphWriter.h84 child_iterator EI = GTraits::child_begin(Node); in getEdgeSourceLabels()
190 child_iterator EI = GTraits::child_begin(Node); in writeNode()
278 child_iterator EI = GTraits::child_begin(Node); in writeNode()
296 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt); in writeEdge()
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h189 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
198 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
H A DMachineBasicBlock.h1221 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
1230 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
1248 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
1260 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
/openbsd/gnu/llvm/clang/include/clang/Analysis/
H A DCallGraph.h249 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
259 static ChildIteratorType child_begin(NodeType *N) { return N->begin();}
/openbsd/gnu/llvm/clang/lib/Index/
H A DCommentToXML.cpp100 for (Comment::child_iterator I = C->child_begin(), E = C->child_end(); in FullCommentParts()
325 for (Comment::child_iterator I = C->child_begin(), E = C->child_end(); in visitParagraphComment()
492 for (Comment::child_iterator I = C->child_begin(), E = C->child_end(); in visitNonStandaloneParagraphComment()
698 for (Comment::child_iterator I = C->child_begin(), E = C->child_end(); in appendParagraphCommentWithKind()
/openbsd/gnu/llvm/llvm/include/llvm/Object/
H A DArchive.h342 child_iterator child_begin(Error &Err, bool SkipInternal = true) const;
346 return make_range(child_begin(Err, SkipInternal), child_end());
/openbsd/gnu/llvm/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h522 static ChildIteratorType child_begin(NodeRef N) {
524 return child_begin(*N->succ_begin());
/openbsd/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/
H A DIdenticalExprChecker.cpp332 Expr::const_child_iterator I1 = Expr1->child_begin(); in isIdenticalStmt()
333 Expr::const_child_iterator I2 = Expr2->child_begin(); in isIdenticalStmt()

123