Home
last modified time | relevance | path

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

/llvm-project-15.0.7/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()
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()
574 DFSStack.trim(1); 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()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DLazyCallGraph.cpp814 assert(DFSStack.empty() && in switchInternalEdgeToRef()
840 DFSStack.push_back({N, I}); in switchInternalEdgeToRef()
862 while (!DFSStack.empty()) in switchInternalEdgeToRef()
919 } while (!DFSStack.empty()); in switchInternalEdgeToRef()
1238 assert(DFSStack.empty() && in removeInternalRefEdge()
1270 DFSStack.push_back({N, I}); in removeInternalRefEdge()
1302 assert(!DFSStack.empty() && in removeInternalRefEdge()
1343 } while (!DFSStack.empty()); in removeInternalRefEdge()
1797 assert(DFSStack.empty() && in buildGenericSCCs()
1823 DFSStack.push_back({N, I}); in buildGenericSCCs()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1405 std::vector<std::pair<const SUnit *, SUnit::const_pred_iterator>> DFSStack; member in __anon22109aa00311::SchedDAGReverseDFS
1408 bool isComplete() const { return DFSStack.empty(); } in isComplete()
1411 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin())); in follow()
1413 void advance() { ++DFSStack.back().second; } in advance()
1416 DFSStack.pop_back(); in backtrack()
1417 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); in backtrack()
1420 const SUnit *getCurr() const { return DFSStack.back().first; } in getCurr()
1422 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; } in getPred()
/llvm-project-15.0.7/polly/lib/Analysis/
H A DScopDetection.cpp1822 std::stack<std::pair<BasicBlock *, unsigned>> DFSStack; in isReducibleRegion() local
1834 DFSStack.push(std::make_pair(CurrBB, 0)); in isReducibleRegion()
1836 while (!DFSStack.empty()) { in isReducibleRegion()
1838 CurrBB = DFSStack.top().first; in isReducibleRegion()
1839 AdjacentBlockIndex = DFSStack.top().second; in isReducibleRegion()
1840 DFSStack.pop(); in isReducibleRegion()
1856 DFSStack.push(std::make_pair(CurrBB, I + 1)); in isReducibleRegion()
1858 DFSStack.push(std::make_pair(SuccBB, 0)); in isReducibleRegion()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp3742 std::pair<int, int> dfs_back() const { return DFSStack.back(); } in dfs_back()
3746 DFSStack.emplace_back(DFSIn, DFSOut); in push_back()
3749 bool empty() const { return DFSStack.empty(); } in empty()
3754 return DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second; in isInScope()
3760 assert(ValueStack.size() == DFSStack.size() && in popUntilDFSScope()
3763 !DFSStack.empty() && in popUntilDFSScope()
3764 !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second)) { in popUntilDFSScope()
3765 DFSStack.pop_back(); in popUntilDFSScope()
3772 SmallVector<std::pair<int, int>, 8> DFSStack; member in __anonf7cb05f81511::ValueDFSStack