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

  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
SuffixTree.h 247 std::vector<SuffixTreeNode *> ToVisit;
266 while (!ToVisit.empty()) {
267 SuffixTreeNode *Curr = ToVisit.back();
268 ToVisit.pop_back();
281 ToVisit.push_back(ChildPair.second);
337 ToVisit.push_back(N);
  /src/external/apache2/llvm/dist/llvm/lib/Support/
SuffixTree.cpp 73 std::vector<std::pair<SuffixTreeNode *, unsigned>> ToVisit;
80 ToVisit.push_back({CurrNode, CurrNodeLen});
81 while (!ToVisit.empty()) {
82 std::tie(CurrNode, CurrNodeLen) = ToVisit.back();
83 ToVisit.pop_back();
87 ToVisit.push_back(
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
PtrUseVisitor.h 234 UseToVisit ToVisit = Worklist.pop_back_val();
235 U = ToVisit.UseAndIsOffsetKnown.getPointer();
236 IsOffsetKnown = ToVisit.UseAndIsOffsetKnown.getInt();
238 Offset = std::move(ToVisit.Offset);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ReachingDefAnalysis.cpp 381 SmallVector<MachineBasicBlock *, 4> ToVisit(MBB->successors());
383 while (!ToVisit.empty()) {
384 MachineBasicBlock *MBB = ToVisit.back();
385 ToVisit.pop_back();
389 llvm::append_range(ToVisit, MBB->successors());
  /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/
BottleneckAnalysis.cpp 205 SmallVector<unsigned, 8> ToVisit;
229 // zero, then the corresponding node is added to a `ToVisit` set.
231 // At the end of every iteration of the outer loop, set `ToVisit` becomes our
254 ToVisit.emplace_back(ToIID);
258 std::swap(RootSet, ToVisit);
259 ToVisit.clear();
  /src/external/apache2/llvm/dist/llvm/lib/IR/
DebugInfo.cpp 656 SmallVector<MDNode *, 16> ToVisit;
660 ToVisit.push_back(N);
661 while (!ToVisit.empty()) {
662 auto *N = ToVisit.back();
666 ToVisit.pop_back();
673 ToVisit.push_back(MDN);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
CodeExtractor.cpp 98 SmallVector<User const *, 16> ToVisit;
101 ToVisit.push_back(&Inst);
103 while (!ToVisit.empty()) {
104 User const *Curr = ToVisit.pop_back_val();
115 ToVisit.push_back(UU);
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaTemplateDeduction.cpp 1244 // visited, while ToVisit is our stack of records that we still need to
1248 SmallVector<const RecordType *, 8> ToVisit;
1254 auto AddBases = [&Visited, &ToVisit](const RecordType *RT) {
1261 ToVisit.push_back(Base.getType()->getAs<RecordType>());
1270 while (!ToVisit.empty()) {
1271 const RecordType *NextT = ToVisit.pop_back_val();
1301 while (Matches.size() > 1 && !ToVisit.empty()) {
1302 const RecordType *NextT = ToVisit.pop_back_val();

Completed in 24 milliseconds