Home
last modified time | relevance | path

Searched refs:DFSStack (Results 1 – 5 of 5) sorted by relevance

/external/llvm/lib/Analysis/
DLazyCallGraph.cpp158 DFSStack(std::move(G.DFSStack)), in LazyCallGraph()
172 DFSStack = std::move(G.DFSStack); in operator =()
519 SmallVector<std::pair<Node *, call_edge_iterator>, 16> DFSStack; in switchInternalEdgeToRef() local
545 assert(DFSStack.empty() && in switchInternalEdgeToRef()
560 DFSStack.push_back({RootN, RootN->call_begin()}); in switchInternalEdgeToRef()
564 std::tie(N, I) = DFSStack.pop_back_val(); in switchInternalEdgeToRef()
571 DFSStack.push_back({N, I}); in switchInternalEdgeToRef()
593 while (!DFSStack.empty()) in switchInternalEdgeToRef()
594 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first); in switchInternalEdgeToRef()
651 } while (!DFSStack.empty()); in switchInternalEdgeToRef()
[all …]
/external/v8/src/compiler/
Dcontrol-equivalence.h81 typedef ZoneStack<DFSStackEntry> DFSStack; in NON_EXPORTED_BASE() typedef
155 void DFSPush(DFSStack& stack, Node* node, Node* from, DFSDirection dir); in NON_EXPORTED_BASE()
158 void DFSPop(DFSStack& stack, Node* node); in NON_EXPORTED_BASE()
Dcontrol-equivalence.cc192 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/
DScheduleDAGInstrs.cpp1595 std::vector<std::pair<const SUnit*, SUnit::const_pred_iterator> > DFSStack; member in __anonfeb57a920311::SchedDAGReverseDFS
1597 bool isComplete() const { return DFSStack.empty(); } in isComplete()
1600 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin())); in follow()
1602 void advance() { ++DFSStack.back().second; } in advance()
1605 DFSStack.pop_back(); in backtrack()
1606 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); in backtrack()
1609 const SUnit *getCurr() const { return DFSStack.back().first; } in getCurr()
1611 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; } in getPred()
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h867 SmallVector<std::pair<Node *, edge_iterator>, 4> DFSStack; variable