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

References

include/llvm/ADT/DepthFirstIterator.h
  130       while (*Opt != GT::child_end(Node)) {
include/llvm/ADT/GraphTraits.h
  123                     GraphTraits<GraphType>::child_end(G));
include/llvm/ADT/PostOrderIterator.h
  127     while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
include/llvm/ADT/SCCIterator.h
  157   while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
  182     assert(VisitStack.back().NextChild == GT::child_end(visitingN));
include/llvm/Analysis/CFG.h
  160     for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) {
include/llvm/Analysis/LoopInfoImpl.h
  175   if (SI != BlockTraits::child_end(Out))
  301                        GraphTraits<BlockT *>::child_end(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))) {
  654       BlockTraits::child_end(entry) - BlockTraits::child_begin(entry);
  848     else if (++BlockTraits::child_begin(BB) == BlockTraits::child_end(BB))
include/llvm/Analysis/RegionIterator.h
  110       while (BlockTraits::child_end(node->getEntry()) != BItor && isExit(*BItor))
  120         BItor(BlockTraits::child_end(node->getEntry())) {}
  146       while (BItor != BlockTraits::child_end(getNode()->getEntry())
  190     while (BlockTraits::child_end(Node->getEntry()) != Itor &&
  197       : Node(node), Itor(BlockTraits::child_end(node->getEntry())) {
include/llvm/Support/GenericDomTree.h
  776                          GraphT::child_end(NewBB)) == 1 &&