Home
last modified time | relevance | path

Searched refs:ChildItTy (Results 1 – 6 of 6) sorted by relevance

/external/llvm/include/llvm/ADT/
DSCCIterator.h45 typedef typename GT::ChildIteratorType ChildItTy; typedef
52 ChildItTy NextChild; ///< The next child, modified inplace during DFS.
55 StackElement(NodeType *Node, const ChildItTy &Child, unsigned Min) in StackElement()
216 for (ChildItTy CI = GT::child_begin(N), CE = GT::child_end(N); CI != CE; in hasLoop()
DDepthFirstIterator.h72 typedef typename GT::ChildIteratorType ChildItTy; typedef
78 std::vector<std::pair<PointerIntTy, ChildItTy>> VisitStack;
104 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back(); in toNext()
106 ChildItTy &It = Top.second; in toNext()
DPostOrderIterator.h99 typedef typename GT::ChildIteratorType ChildItTy; typedef
103 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack;
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DDepthFirstIterator.h72 typedef typename GT::ChildIteratorType ChildItTy; typedef
78 std::vector<std::pair<PointerIntTy, ChildItTy> > VisitStack;
103 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back(); in toNext()
105 ChildItTy &It = Top.second; in toNext()
DSCCIterator.h40 typedef typename GT::ChildIteratorType ChildItTy; typedef
61 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack;
181 for (ChildItTy CI = GT::child_begin(N), CE=GT::child_end(N); CI != CE; ++CI) in hasLoop()
DPostOrderIterator.h58 typedef typename GT::ChildIteratorType ChildItTy; typedef
62 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack;