Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h493 Stack DFSStack(StackAllocator); in deepCopyInto()
510 if (DFSStack.AppendEmplace(Root, NewRoot) == nullptr) in deepCopyInto()
512 while (!DFSStack.empty()) { in deepCopyInto()
513 NodeAndParent NP = DFSStack.back(); in deepCopyInto()
516 DFSStack.trim(1); in deepCopyInto()
527 if (UNLIKELY(DFSStack.AppendEmplace(Callee.NodePtr, NewNode) == in deepCopyInto()
551 Stack DFSStack(StackAllocator); in mergeInto()
569 DFSStack.AppendEmplace(Root, TargetRoot); in mergeInto()
570 while (!DFSStack.empty()) { in mergeInto()
571 NodeAndTarget NT = DFSStack.back(); in mergeInto()
[all …]
H A Dxray_profile_collector.cpp172 StackArray DFSStack(StackAlloc); in populateRecords() local
174 DFSStack.Append(R); in populateRecords()
175 while (!DFSStack.empty()) { in populateRecords()
176 auto *Node = DFSStack.back(); in populateRecords()
177 DFSStack.trim(1); in populateRecords()
192 DFSStack.Append(C.NodePtr); in populateRecords()
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DLazyCallGraph.cpp774 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack; in switchInternalEdgeToRef() local
800 assert(DFSStack.empty() && in switchInternalEdgeToRef()
815 DFSStack.emplace_back(RootN, (*RootN)->call_begin()); in switchInternalEdgeToRef()
817 auto [N, I] = DFSStack.pop_back_val(); in switchInternalEdgeToRef()
824 DFSStack.emplace_back(N, I); in switchInternalEdgeToRef()
846 while (!DFSStack.empty()) in switchInternalEdgeToRef()
847 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first); in switchInternalEdgeToRef()
903 } while (!DFSStack.empty()); in switchInternalEdgeToRef()
1219 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack; in removeInternalRefEdge() local
1222 assert(DFSStack.empty() && in removeInternalRefEdge()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1418 std::vector<std::pair<const SUnit *, SUnit::const_pred_iterator>> DFSStack; member in __anon3a1cb6670311::SchedDAGReverseDFS
1421 bool isComplete() const { return DFSStack.empty(); } in isComplete()
1424 DFSStack.emplace_back(SU, SU->Preds.begin()); in follow()
1426 void advance() { ++DFSStack.back().second; } in advance()
1429 DFSStack.pop_back(); in backtrack()
1430 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); in backtrack()
1433 const SUnit *getCurr() const { return DFSStack.back().first; } in getCurr()
1435 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; } in getPred()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp3740 std::pair<int, int> dfs_back() const { return DFSStack.back(); } in dfs_back()
3744 DFSStack.emplace_back(DFSIn, DFSOut); in push_back()
3747 bool empty() const { return DFSStack.empty(); } in empty()
3752 return DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second; in isInScope()
3758 assert(ValueStack.size() == DFSStack.size() && in popUntilDFSScope()
3761 !DFSStack.empty() && in popUntilDFSScope()
3762 !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second)) { in popUntilDFSScope()
3763 DFSStack.pop_back(); in popUntilDFSScope()
3770 SmallVector<std::pair<int, int>, 8> DFSStack; member in __anon1f4f44df1511::ValueDFSStack