Home
last modified time | relevance | path

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

/netbsd-src/sys/external/bsd/compiler_rt/dist/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()
528 if (UNLIKELY(DFSStack.AppendEmplace(Callee.NodePtr, NewNode) == 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()
[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()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DSpeculateAroundPHIs.cpp54 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack; in isSafeToSpeculatePHIUsers() local
93 DFSStack.push_back({UI, UI->value_op_begin()}); in isSafeToSpeculatePHIUsers()
96 std::tie(UI, OpIt) = DFSStack.pop_back_val(); in isSafeToSpeculatePHIUsers()
141 for (auto &StackPair : DFSStack) { in isSafeToSpeculatePHIUsers()
154 DFSStack.push_back({UI, OpIt}); in isSafeToSpeculatePHIUsers()
164 } while (!DFSStack.empty()); in isSafeToSpeculatePHIUsers()
352 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack; in visitPHIUsersAndDepsInPostOrder() local
362 DFSStack.push_back({UI, UI->value_op_begin()}); in visitPHIUsersAndDepsInPostOrder()
365 std::tie(UI, OpIt) = DFSStack.pop_back_val(); in visitPHIUsersAndDepsInPostOrder()
379 DFSStack.push_back({UI, OpIt}); in visitPHIUsersAndDepsInPostOrder()
[all …]
H A DNewGVN.cpp3710 std::pair<int, int> dfs_back() const { return DFSStack.back(); } in dfs_back()
3714 DFSStack.emplace_back(DFSIn, DFSOut); in push_back()
3717 bool empty() const { return DFSStack.empty(); } in empty()
3722 return DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second; in isInScope()
3728 assert(ValueStack.size() == DFSStack.size() && in popUntilDFSScope()
3731 !DFSStack.empty() && in popUntilDFSScope()
3732 !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second)) { in popUntilDFSScope()
3733 DFSStack.pop_back(); in popUntilDFSScope()
3740 SmallVector<std::pair<int, int>, 8> DFSStack; member in __anonccb5b2131511::ValueDFSStack
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DLazyCallGraph.cpp787 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack; in switchInternalEdgeToRef() local
813 assert(DFSStack.empty() && in switchInternalEdgeToRef()
828 DFSStack.push_back({RootN, (*RootN)->call_begin()}); in switchInternalEdgeToRef()
832 std::tie(N, I) = DFSStack.pop_back_val(); in switchInternalEdgeToRef()
839 DFSStack.push_back({N, I}); in switchInternalEdgeToRef()
861 while (!DFSStack.empty()) in switchInternalEdgeToRef()
862 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first); in switchInternalEdgeToRef()
918 } while (!DFSStack.empty()); in switchInternalEdgeToRef()
1234 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack; in removeInternalRefEdge() local
1237 assert(DFSStack.empty() && in removeInternalRefEdge()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1417 std::vector<std::pair<const SUnit *, SUnit::const_pred_iterator>> DFSStack; member in __anon9450ca1b0311::SchedDAGReverseDFS
1420 bool isComplete() const { return DFSStack.empty(); } in isComplete()
1423 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin())); in follow()
1425 void advance() { ++DFSStack.back().second; } in advance()
1428 DFSStack.pop_back(); in backtrack()
1429 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second); in backtrack()
1432 const SUnit *getCurr() const { return DFSStack.back().first; } in getCurr()
1434 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; } in getPred()