Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h489 Stack DFSStack(StackAllocator); in deepCopyInto()
506 if (DFSStack.AppendEmplace(Root, NewRoot) == nullptr) in deepCopyInto()
508 while (!DFSStack.empty()) { in deepCopyInto()
509 NodeAndParent NP = DFSStack.back(); in deepCopyInto()
512 DFSStack.trim(1); in deepCopyInto()
523 if (UNLIKELY(DFSStack.AppendEmplace(Callee.NodePtr, NewNode) == in deepCopyInto()
547 Stack DFSStack(StackAllocator); in mergeInto()
565 DFSStack.AppendEmplace(Root, TargetRoot); in mergeInto()
566 while (!DFSStack.empty()) { in mergeInto()
567 NodeAndTarget NT = DFSStack.back(); in mergeInto()
[all …]
H A Dxray_profile_collector.cpp169 StackArray DFSStack(StackAlloc); in populateRecords() local
171 DFSStack.Append(R); in populateRecords()
172 while (!DFSStack.empty()) { in populateRecords()
173 auto *Node = DFSStack.back(); in populateRecords()
174 DFSStack.trim(1); in populateRecords()
189 DFSStack.Append(C.NodePtr); in populateRecords()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp784 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack; in switchInternalEdgeToRef() local
810 assert(DFSStack.empty() && in switchInternalEdgeToRef()
825 DFSStack.emplace_back(RootN, (*RootN)->call_begin()); in switchInternalEdgeToRef()
827 auto [N, I] = DFSStack.pop_back_val(); in switchInternalEdgeToRef()
834 DFSStack.emplace_back(N, I); in switchInternalEdgeToRef()
856 while (!DFSStack.empty()) in switchInternalEdgeToRef()
857 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first); in switchInternalEdgeToRef()
913 } while (!DFSStack.empty()); in switchInternalEdgeToRef()
1225 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack; in removeInternalRefEdges() local
1228 assert(DFSStack.empty() && in removeInternalRefEdges()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1449 std::vector<std::pair<const SUnit *, SUnit::const_pred_iterator>> DFSStack; member in __anon4ee60d700311::SchedDAGReverseDFS
1452 bool isComplete() const { return DFSStack.empty(); } in isComplete()
1455 DFSStack.emplace_back(SU, SU->Preds.begin()); in follow()
1457 void advance() { ++DFSStack.back().second; } in advance()
1460 DFSStack.pop_back(); in backtrack()
1461 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); in backtrack()
1464 const SUnit *getCurr() const { return DFSStack.back().first; } in getCurr()
1466 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; } in getPred()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp3783 std::pair<int, int> dfs_back() const { return DFSStack.back(); } in dfs_back()
3787 DFSStack.emplace_back(DFSIn, DFSOut); in push_back()
3790 bool empty() const { return DFSStack.empty(); } in empty()
3795 return DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second; in isInScope()
3801 assert(ValueStack.size() == DFSStack.size() && in popUntilDFSScope()
3804 !DFSStack.empty() && in popUntilDFSScope()
3805 !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second)) { in popUntilDFSScope()
3806 DFSStack.pop_back(); in popUntilDFSScope()
3813 SmallVector<std::pair<int, int>, 8> DFSStack; member in __anonb3555ec81511::ValueDFSStack