Searched refs:DFSStack (Results 1 - 6 of 6) sorted by relevance
| /freebsd-13-stable/contrib/llvm-project/compiler-rt/lib/xray/ |
| H A D | xray_function_call_trie.h | 493 Stack DFSStack(StackAllocator);
510 if (DFSStack.AppendEmplace(Root, NewRoot) == nullptr)
512 while (!DFSStack.empty()) {
513 NodeAndParent NP = DFSStack.back();
516 DFSStack.trim(1);
527 if (UNLIKELY(DFSStack.AppendEmplace(Callee.NodePtr, NewNode) ==
551 Stack DFSStack(StackAllocator);
569 DFSStack.AppendEmplace(Root, TargetRoot);
570 while (!DFSStack.empty()) {
571 NodeAndTarget NT = DFSStack
[all...] |
| H A D | xray_profile_collector.cpp | 172 StackArray DFSStack(StackAlloc);
174 DFSStack.Append(R);
175 while (!DFSStack.empty()) {
176 auto *Node = DFSStack.back();
177 DFSStack.trim(1);
192 DFSStack.Append(C.NodePtr);
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | SpeculateAroundPHIs.cpp | 54 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack; local
93 DFSStack.push_back({UI, UI->value_op_begin()});
96 std::tie(UI, OpIt) = DFSStack.pop_back_val();
141 for (auto &StackPair : DFSStack) {
154 DFSStack.push_back({UI, OpIt});
164 } while (!DFSStack.empty());
350 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack; local
360 DFSStack.push_back({UI, UI->value_op_begin()});
363 std::tie(UI, OpIt) = DFSStack.pop_back_val();
377 DFSStack
[all...] |
| H A D | NewGVN.cpp | 3731 std::pair<int, int> dfs_back() const { return DFSStack.back(); }
3735 DFSStack.emplace_back(DFSIn, DFSOut);
3738 bool empty() const { return DFSStack.empty(); }
3743 return DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second;
3749 assert(ValueStack.size() == DFSStack.size() &&
3750 "Mismatch between ValueStack and DFSStack");
3752 !DFSStack.empty() &&
3753 !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack
[all...] |
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LazyCallGraph.cpp | 749 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack;
775 assert(DFSStack.empty() &&
790 DFSStack.push_back({RootN, (*RootN)->call_begin()});
794 std::tie(N, I) = DFSStack.pop_back_val();
801 DFSStack.push_back({N, I});
823 while (!DFSStack.empty())
824 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first);
880 } while (!DFSStack.empty());
1204 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack;
1207 assert(DFSStack
[all...] |
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ScheduleDAGInstrs.cpp | 1411 std::vector<std::pair<const SUnit *, SUnit::const_pred_iterator>> DFSStack; member in class:__anon3567::SchedDAGReverseDFS
1414 bool isComplete() const { return DFSStack.empty(); }
1417 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin()));
1419 void advance() { ++DFSStack.back().second; }
1422 DFSStack.pop_back();
1423 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second);
1426 const SUnit *getCurr() const { return DFSStack.back().first; }
1428 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; }
|
Completed in 90 milliseconds