HomeSort by: relevance | last modified time | path
    Searched refs:DFSStack (Results 1 - 6 of 6) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/lib/xray/
xray_function_call_trie.h 494 Stack DFSStack(StackAllocator);
511 if (DFSStack.AppendEmplace(Root, NewRoot) == nullptr)
513 while (!DFSStack.empty()) {
514 NodeAndParent NP = DFSStack.back();
517 DFSStack.trim(1);
528 if (UNLIKELY(DFSStack.AppendEmplace(Callee.NodePtr, NewNode) ==
552 Stack DFSStack(StackAllocator);
570 DFSStack.AppendEmplace(Root, TargetRoot);
571 while (!DFSStack.empty()) {
572 NodeAndTarget NT = DFSStack.back()
    [all...]
xray_profile_collector.cc 173 StackArray DFSStack(StackAlloc);
175 DFSStack.Append(R);
176 while (!DFSStack.empty()) {
177 auto *Node = DFSStack.back();
178 DFSStack.trim(1);
193 DFSStack.Append(C.NodePtr);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
SpeculateAroundPHIs.cpp 54 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack;
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());
352 SmallVector<std::pair<Instruction *, User::value_op_iterator>, 16> DFSStack;
362 DFSStack.push_back({UI, UI->value_op_begin()});
365 std::tie(UI, OpIt) = DFSStack.pop_back_val();
379 DFSStack.push_back({UI, OpIt})
    [all...]
NewGVN.cpp 3710 std::pair<int, int> dfs_back() const { return DFSStack.back(); }
3714 DFSStack.emplace_back(DFSIn, DFSOut);
3717 bool empty() const { return DFSStack.empty(); }
3722 return DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second;
3728 assert(ValueStack.size() == DFSStack.size() &&
3729 "Mismatch between ValueStack and DFSStack");
3731 !DFSStack.empty() &&
3732 !(DFSIn >= DFSStack.back().first && DFSOut <= DFSStack.back().second))
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LazyCallGraph.cpp 787 SmallVector<std::pair<Node *, EdgeSequence::call_iterator>, 16> DFSStack;
813 assert(DFSStack.empty() &&
828 DFSStack.push_back({RootN, (*RootN)->call_begin()});
832 std::tie(N, I) = DFSStack.pop_back_val();
839 DFSStack.push_back({N, I});
861 while (!DFSStack.empty())
862 OldSCC.Nodes.push_back(DFSStack.pop_back_val().first);
918 } while (!DFSStack.empty());
1234 SmallVector<std::pair<Node *, EdgeSequence::iterator>, 4> DFSStack;
1237 assert(DFSStack.empty() &
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp 1417 std::vector<std::pair<const SUnit *, SUnit::const_pred_iterator>> DFSStack;
1420 bool isComplete() const { return DFSStack.empty(); }
1423 DFSStack.push_back(std::make_pair(SU, SU->Preds.begin()));
1425 void advance() { ++DFSStack.back().second; }
1428 DFSStack.pop_back();
1429 return DFSStack.empty() ? nullptr : std::prev(DFSStack.back().second);
1432 const SUnit *getCurr() const { return DFSStack.back().first; }
1434 SUnit::const_pred_iterator getPred() const { return DFSStack.back().second; }

Completed in 30 milliseconds