Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h494 Stack DFSStack(StackAllocator); in deepCopyInto()
511 if (DFSStack.AppendEmplace(Root, NewRoot) == nullptr) in deepCopyInto()
513 while (!DFSStack.empty()) { in deepCopyInto()
514 NodeAndParent NP = DFSStack.back(); in deepCopyInto()
517 DFSStack.trim(1); in deepCopyInto()
552 Stack DFSStack(StackAllocator); in mergeInto()
570 DFSStack.AppendEmplace(Root, TargetRoot); in mergeInto()
571 while (!DFSStack.empty()) { in mergeInto()
572 NodeAndTarget NT = DFSStack.back(); in mergeInto()
575 DFSStack.trim(1); in mergeInto()
[all …]
H A Dxray_profile_collector.cc173 StackArray DFSStack(StackAlloc); in populateRecords() local
175 DFSStack.Append(R); in populateRecords()
176 while (!DFSStack.empty()) { in populateRecords()
177 auto *Node = DFSStack.back(); in populateRecords()
178 DFSStack.trim(1); in populateRecords()
193 DFSStack.Append(C.NodePtr); in populateRecords()
/freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/
H A DSpeculateAroundPHIs.cpp55 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack; in isSafeToSpeculatePHIUsers() local
86 DFSStack.push_back({UI, UI->value_op_begin()}); in isSafeToSpeculatePHIUsers()
89 std::tie(UI, OpIt) = DFSStack.pop_back_val(); in isSafeToSpeculatePHIUsers()
134 for (auto &StackPair : DFSStack) { in isSafeToSpeculatePHIUsers()
147 DFSStack.push_back({UI, OpIt}); in isSafeToSpeculatePHIUsers()
157 } while (!DFSStack.empty()); in isSafeToSpeculatePHIUsers()
339 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack; in visitPHIUsersAndDepsInPostOrder() local
349 DFSStack.push_back({UI, UI->value_op_begin()}); in visitPHIUsersAndDepsInPostOrder()
352 std::tie(UI, OpIt) = DFSStack.pop_back_val(); in visitPHIUsersAndDepsInPostOrder()
366 DFSStack.push_back({UI, OpIt}); in visitPHIUsersAndDepsInPostOrder()
[all …]
H A DNewGVN.cpp3752 std::pair<int, int> dfs_back() const { return DFSStack.back(); } in dfs_back()
3756 DFSStack.emplace_back(DFSIn, DFSOut); in push_back()
3759 bool empty() const { return DFSStack.empty(); } in empty()
3764 return DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second; in isInScope()
3770 assert(ValueStack.size() == DFSStack.size() && in popUntilDFSScope()
3773 !DFSStack.empty() && in popUntilDFSScope()
3774 !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second)) { in popUntilDFSScope()
3775 DFSStack.pop_back(); in popUntilDFSScope()
3782 SmallVector<std::pair<int, int>, 8> DFSStack; member in __anon46287ded1611::ValueDFSStack
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DLazyCallGraph.cpp750 assert(DFSStack.empty() && in switchInternalEdgeToRef()
776 DFSStack.push_back({N, I}); in switchInternalEdgeToRef()
798 while (!DFSStack.empty()) in switchInternalEdgeToRef()
855 } while (!DFSStack.empty()); in switchInternalEdgeToRef()
1182 assert(DFSStack.empty() && in removeInternalRefEdge()
1214 DFSStack.push_back({N, I}); in removeInternalRefEdge()
1246 assert(!DFSStack.empty() && in removeInternalRefEdge()
1287 } while (!DFSStack.empty()); in removeInternalRefEdge()
1569 assert(DFSStack.empty() && in buildGenericSCCs()
1595 DFSStack.push_back({N, I}); in buildGenericSCCs()
[all …]
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1346 std::vector<std::pair<const SUnit *, SUnit::const_pred_iterator>> DFSStack; member in __anon3c1d11350311::SchedDAGReverseDFS
1349 bool isComplete() const { return DFSStack.empty(); } in isComplete()
1352 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin())); in follow()
1354 void advance() { ++DFSStack.back().second; } in advance()
1357 DFSStack.pop_back(); in backtrack()
1358 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); in backtrack()
1361 const SUnit *getCurr() const { return DFSStack.back().first; } in getCurr()
1363 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; } in getPred()