Searched defs:VisitStack (Results 1 - 5 of 5) sorted by relevance

/external/llvm/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp81 SmallVector<WorklistItem, 16> VisitStack; local
89 VisitStack.clear();
92 VisitStack.push_back(WorklistItem(L->getHeader(), false));
94 while (!VisitStack.empty()) {
95 WorklistItem Item = VisitStack.pop_back_val();
142 VisitStack.push_back(WorklistItem(SuccBB, true));
150 VisitStack.push_back(WorklistItem(ExitBB, false));
161 VisitStack.push_back(WorklistItem(SuccBB, false));
/external/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h75 // VisitStack - Used to maintain the ordering. Top = current block
78 std::vector<std::pair<PointerIntTy, ChildItTy> > VisitStack; member in class:llvm::df_iterator
82 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
91 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
103 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back();
118 VisitStack.push_back(std::make_pair(PointerIntTy(Next, 0),
125 VisitStack.pop_back();
126 } while (!VisitStack.empty());
146 return VisitStack == x.VisitStack;
[all...]
H A DPostOrderIterator.h99 // VisitStack - Used to maintain the ordering. Top = current block
101 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack; member in class:llvm::po_iterator
104 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
105 NodeType *BB = *VisitStack.back().second++;
106 if (this->insertEdge(VisitStack.back().first, BB)) {
108 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
115 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
123 VisitStack.push_back(std::make_pair(BB, GT::child_begin(BB)));
145 return VisitStack
[all...]
H A DSCCIterator.h59 // VisitStack - Used to maintain the ordering. Top = current block
61 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack; member in class:llvm::scc_iterator
65 // the corresponding node on the VisitStack.
74 VisitStack.push_back(std::make_pair(N, GT::child_begin(N)));
81 assert(!VisitStack.empty());
82 while (VisitStack.back().second != GT::child_end(VisitStack.back().first)) {
84 NodeType *childN = *VisitStack.back().second++;
99 assert(VisitStack.size() == MinVisitNumStack.size());
101 while (!VisitStack
[all...]
/external/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp613 SmallVector<std::pair<const BasicBlock*, succ_const_iterator>, 8> VisitStack; local
617 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
620 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back();
631 // Successor is in VisitStack, it's a back edge.
639 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
642 InStack.erase(VisitStack.pop_back_val().first);
644 } while (!VisitStack.empty());

Completed in 3543 milliseconds