HomeSort by relevance Sort by last modified time
    Searched defs:Deps (Results 1 - 5 of 5) sorted by null

  /external/llvm/unittests/ADT/
DAGDeltaAlgorithmTest.cpp 61 std::vector<edge_ty> Deps;
65 Deps.clear();
66 Deps.push_back(std::make_pair(3, 1));
72 EXPECT_EQ(fixed_set(4, 1, 3, 5, 7), FDA.Run(range(20), Deps));
79 Deps.clear();
80 Deps.push_back(std::make_pair(1, 0));
81 Deps.push_back(std::make_pair(2, 0));
82 Deps.push_back(std::make_pair(4, 0));
83 Deps.push_back(std::make_pair(3, 2));
91 EXPECT_EQ(fixed_set(4, 0, 1, 2, 3), FDA2.Run(range(5), Deps));
    [all...]
  /external/llvm/lib/Analysis/
MemDepPrinter.cpp 41 DepSetMap Deps;
59 Deps.clear();
109 Deps[Inst].insert(std::make_pair(getInstTypePair(Res),
115 DepSet &InstDeps = Deps[Inst];
126 Deps[Inst].insert(std::make_pair(getInstTypePair(0, Unknown),
135 Deps[Inst].insert(std::make_pair(getInstTypePair(0, Unknown),
148 DepSet &InstDeps = Deps[Inst];
164 DepSetMap::const_iterator DI = Deps.find(Inst);
165 if (DI == Deps.end())
  /external/llvm/include/llvm/CodeGen/
ScheduleDAGInstrs.h 44 LoopDeps Deps;
51 assert(Deps.empty() && "stale loop dependencies");
83 Deps.insert(std::make_pair(MOReg, std::make_pair(&MO, Count)));
  /external/llvm/lib/CodeGen/
InlineSpiller.cpp 115 TinyPtrVector<VNInfo*> Deps;
325 OS << " deps[";
326 for (unsigned i = 0, e = SVI.Deps.size(); i != e; ++i)
327 OS << ' ' << SVI.Deps[i]->id << '@' << SVI.Deps[i]->def;
344 // When VNI is non-NULL, add it to SVI's deps, and only propagate to that.
348 SVI->second.Deps.push_back(VNI);
363 TinyPtrVector<VNInfo*> *Deps = VNI ? &FirstDeps : &SVI->second.Deps;
370 DEBUG(dbgs() << " prop to " << Deps->size() << ":
    [all...]
  /external/llvm/lib/Transforms/Scalar/
GVN.cpp 325 const MemoryDependenceAnalysis::NonLocalDepInfo &deps = local
332 for (unsigned i = 0, e = deps.size(); i != e; ++i) {
333 const NonLocalDepEntry *I = &deps[i];
    [all...]

Completed in 82 milliseconds