reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/ADT/DepthFirstIterator.h

  125         Opt.emplace(GT::child_begin(Node));

include/llvm/ADT/GraphTraits.h

  122   return make_range(GraphTraits<GraphType>::child_begin(G),

include/llvm/ADT/PostOrderIterator.h

  108     VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
  131         VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));

include/llvm/ADT/SCCIterator.h

  147   VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));

include/llvm/Analysis/CFG.h

  160     for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) {

include/llvm/Analysis/LoopInfoImpl.h

  173   typename BlockTraits::ChildIteratorType SI = BlockTraits::child_begin(Out);
  300     assert(std::any_of(GraphTraits<BlockT *>::child_begin(BB),

include/llvm/Analysis/RegionInfoImpl.h

  262        make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) {
  287        make_range(BlockTraits::child_begin(BB), BlockTraits::child_end(BB))) {
  473       return new RegionT(getEntry(), *BlockTraits::child_begin(exit), RI, DT);
  654       BlockTraits::child_end(entry) - BlockTraits::child_begin(entry);
  656   if (num_successors <= 1 && exit == *(BlockTraits::child_begin(entry)))
  848     else if (++BlockTraits::child_begin(BB) == BlockTraits::child_end(BB))
  849       Exit = *BlockTraits::child_begin(BB);

include/llvm/Analysis/RegionIterator.h

  107         BItor(BlockTraits::child_begin(node->getEntry())) {
  184       : Node(node), Itor(BlockTraits::child_begin(node->getEntry())) {

include/llvm/Support/GenericDomTree.h

  775     assert(std::distance(GraphT::child_begin(NewBB),
  778     NodeRef NewBBSucc = *GraphT::child_begin(NewBB);