HomeSort by relevance Sort by last modified time
    Searched refs:VisitStack (Results 1 - 6 of 6) sorted by null

  /external/llvm/include/llvm/ADT/
SCCIterator.h 49 /// Element of VisitStack during DFS.
80 std::vector<StackElement> VisitStack;
108 assert(!CurrentSCC.empty() || VisitStack.empty());
113 return VisitStack == x.VisitStack && CurrentSCC == x.CurrentSCC;
146 VisitStack.push_back(StackElement(N, GT::child_begin(N), visitNum));
155 assert(!VisitStack.empty());
156 while (VisitStack.back().NextChild != GT::child_end(VisitStack.back().Node)) {
158 NodeType *childN = *VisitStack.back().NextChild++
    [all...]
DepthFirstIterator.h 76 // VisitStack - Used to maintain the ordering. Top = current block
79 std::vector<std::pair<PointerIntTy, ChildItTy> > VisitStack;
83 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
92 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
104 std::pair<PointerIntTy, ChildItTy> &Top = VisitStack.back();
119 VisitStack.push_back(std::make_pair(PointerIntTy(Next, 0),
126 VisitStack.pop_back();
127 } while (!VisitStack.empty());
147 return VisitStack == x.VisitStack;
    [all...]
PostOrderIterator.h 99 // VisitStack - Used to maintain the ordering. Top = current block
101 std::vector<std::pair<NodeType *, ChildItTy> > VisitStack;
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 == x.VisitStack
    [all...]
  /external/llvm/lib/Transforms/Scalar/
LoopInstSimplify.cpp 89 SmallVector<WorklistItem, 16> VisitStack;
97 VisitStack.clear();
100 VisitStack.push_back(WorklistItem(L->getHeader(), false));
102 while (!VisitStack.empty()) {
103 WorklistItem Item = VisitStack.pop_back_val();
157 VisitStack.push_back(WorklistItem(SuccBB, true));
165 VisitStack.push_back(WorklistItem(ExitBB, false));
176 VisitStack.push_back(WorklistItem(SuccBB, false));
  /external/llvm/lib/Analysis/
CFG.cpp 34 SmallVector<std::pair<const BasicBlock*, succ_const_iterator>, 8> VisitStack;
38 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
41 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back();
52 // Successor is in VisitStack, it's a back edge.
60 VisitStack.push_back(std::make_pair(BB, succ_begin(BB)));
63 InStack.erase(VisitStack.pop_back_val().first);
65 } while (!VisitStack.empty());
  /external/clang/lib/Sema/
SemaDecl.cpp     [all...]

Completed in 76 milliseconds