Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/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();
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h138 static inline ChildIteratorType child_begin(NodeRef N) {
157 static inline ChildIteratorType child_begin(NodeRef N) {
184 static inline ChildIteratorType child_begin(NodeRef N) {
203 static inline ChildIteratorType child_begin(NodeRef N) {
257 static inline ChildIteratorType child_begin(NodeRef N) {
272 static inline ChildIteratorType child_begin(NodeRef N) {
292 static inline ChildIteratorType child_begin(NodeRef N) {
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
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 DRegionInfoImpl.h448 return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT); in getExpandedRegion()
625 BlockTraits::child_end(entry) - BlockTraits::child_begin(entry); in isTrivialRegion()
627 if (num_successors <= 1 && exit == *(BlockTraits::child_begin(entry))) in isTrivialRegion()
812 else if (std::next(BlockTraits::child_begin(BB)) == in getMaxRegionExit()
814 Exit = *BlockTraits::child_begin(BB); in getMaxRegionExit()
H A DCFG.h164 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) { in containsIrreducibleCFG()
H A DLoopInfo.h555 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
564 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
H A DCallGraph.h426 static ChildIteratorType child_begin(NodeRef N) {
447 static ChildIteratorType child_begin(NodeRef N) {
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DComment.cpp72 ASSERT_IMPLEMENTS_child_begin(&CLASS::child_begin); \ in CheckCommentASTNodes()
83 Comment::child_iterator Comment::child_begin() const { in child_begin() function in clang::comments::Comment
90 return static_cast<const CLASS *>(this)->child_begin(); in child_begin()
118 for (child_iterator I = child_begin(), E = child_end(); I != E; ++I) { in isWhitespaceNoCache()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h150 return make_range(GraphTraits<GraphType>::child_begin(G),
157 return make_range(GraphTraits<Inverse<GraphType>>::child_begin(G),
H A DGenericCycleInfo.h186 const_child_iterator child_begin() const { in child_begin() function
360 static ChildIteratorType child_begin(NodeRef Ref) { in child_begin() function
361 return Ref->child_begin(); in child_begin()
H A DPostOrderIterator.h119 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB)); in po_iterator()
128 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB)); in po_iterator()
145 VisitStack.emplace_back(BB, GT::child_begin(BB), GT::child_end(BB)); in traverseChild()
H A DSCCIterator.h155 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum)); in DFSVisitOne()
225 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()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGraphWriter.h85 child_iterator EI = GTraits::child_begin(Node); in getEdgeSourceLabels()
191 child_iterator EI = GTraits::child_begin(Node); in writeNode()
280 child_iterator EI = GTraits::child_begin(Node); in writeNode()
298 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt); in writeEdge()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DCFG.h306 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
321 static ChildIteratorType child_begin(NodeRef N) { return succ_begin(N); }
340 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
354 static ChildIteratorType child_begin(NodeRef N) { return pred_begin(N); }
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineLoopInfo.h183 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
192 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); }
H A DMachineDominators.h165 static ChildIteratorType child_begin(NodeRef N) { return N->begin(); } in child_begin() function
H A DMachineBasicBlock.h1345 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
1362 static ChildIteratorType child_begin(NodeRef N) { return N->succ_begin(); }
1388 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
1408 static ChildIteratorType child_begin(NodeRef N) { return N->pred_begin(); }
/freebsd/usr.bin/dtc/
H A Dchecking.cc82 if (n->child_begin() == n->child_end()) in check_node()
134 for (node::child_iterator i=n->child_begin(), e=n->child_end() ; i!=e ; in visit_node()
H A Dfdt.hh473 child_iterator begin() { return n.child_begin(); } in begin()
563 inline child_iterator child_begin() in child_begin() function in dtc::fdt::node
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/
H A DCallGraph.h246 static ChildIteratorType child_begin(NodeType *N) { return N->begin(); }
256 static ChildIteratorType child_begin(NodeType *N) { return N->begin();}
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h87 static ChildIteratorType child_begin(NodeRef N) { return N->succ_rbegin(); } in child_begin() function
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h505 static ChildIteratorType child_begin(NodeRef N) {
507 return child_begin(*N->succ_begin());
/freebsd/contrib/llvm-project/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()
702 for (Comment::child_iterator I = C->child_begin(), E = C->child_end(); I != E; in appendParagraphCommentWithKind()
/freebsd/contrib/llvm-project/llvm/include/llvm/Object/
H A DArchive.h351 child_iterator child_begin(Error &Err, bool SkipInternal = true) const;
355 return make_range(child_begin(Err, SkipInternal), child_end());

123