Searched refs:DFSStack (Results 1 – 5 of 5) sorted by relevance
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 138 DFSStack(std::move(G.DFSStack)), in LazyCallGraph()
152 DFSStack = std::move(G.DFSStack); in operator =()
378 SmallVectorImpl<std::pair<Node *, Node::iterator>> &DFSStack, in internalDFS() argument
400 while (!DFSStack.empty()) in internalDFS()
401 insert(*DFSStack.pop_back_val().first); in internalDFS()
416 DFSStack.push_back(std::make_pair(N, I)); in internalDFS()
437 if (DFSStack.empty()) in internalDFS()
447 assert(!DFSStack.empty() && "We shouldn't have an empty stack!"); in internalDFS()
450 N = DFSStack.back().first; in internalDFS()
451 I = DFSStack.back().second; in internalDFS()
[all …]
|
| /external/v8/src/compiler/ |
| D | control-equivalence.h | 78 typedef ZoneStack<DFSStackEntry> DFSStack; typedef
152 void DFSPush(DFSStack& stack, Node* node, Node* from, DFSDirection dir);
155 void DFSPop(DFSStack& stack, Node* node);
|
| D | control-equivalence.cc | 192 void ControlEquivalence::DFSPush(DFSStack& stack, Node* node, Node* from, in DFSPush()
203 void ControlEquivalence::DFSPop(DFSStack& stack, Node* node) { in DFSPop()
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 1570 std::vector<std::pair<const SUnit*, SUnit::const_pred_iterator> > DFSStack; member in __anon843f11de0111::SchedDAGReverseDFS
1572 bool isComplete() const { return DFSStack.empty(); } in isComplete()
1575 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin())); in follow()
1577 void advance() { ++DFSStack.back().second; } in advance()
1580 DFSStack.pop_back(); in backtrack()
1581 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); in backtrack()
1584 const SUnit *getCurr() const { return DFSStack.back().first; } in getCurr()
1586 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; } in getPred()
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 223 internalDFS(SmallVectorImpl<std::pair<Node *, Node::iterator>> &DFSStack,
493 SmallVector<std::pair<Node *, iterator>, 4> DFSStack; variable
|