HomeSort by: relevance | last modified time | path
    Searched defs:Levels (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
CFLGraph.h 74 std::vector<NodeInfo> Levels;
78 auto NumLevels = Levels.size();
81 Levels.resize(Level + 1);
86 assert(Level < Levels.size());
87 return Levels[Level];
90 assert(Level < Levels.size());
91 return Levels[Level];
94 unsigned getNumLevels() const { return Levels.size(); }
DependenceAnalysis.cpp 259 : Dependence(Source, Destination), Levels(CommonLevels),
270 assert(0 < Level && Level <= Levels && "Level out of range");
277 assert(0 < Level && Level <= Levels && "Level out of range");
286 assert(0 < Level && Level <= Levels && "Level out of range");
294 assert(0 < Level && Level <= Levels && "Level out of range");
302 assert(0 < Level && Level <= Levels && "Level out of range");
309 assert(0 < Level && Level <= Levels && "Level out of range");
606 unsigned Levels = getLevels();
608 for (unsigned II = 1; II <= Levels; ++II) {
633 if (II < Levels)
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/AST/Interp/
InterpFrame.cpp 91 llvm::SmallVector<Pointer, 2> Levels;
93 Levels.push_back(F);
98 for (auto It = Levels.rbegin(); It != Levels.rend(); ++It) {
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopInterchange.cpp 136 unsigned Levels = D->getLevels();
138 for (unsigned II = 1; II <= Levels; ++II) {
1254 // Switch the loop levels.
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
DependenceAnalysis.h 218 unsigned Levels);
235 unsigned getLevels() const override { return Levels; }
263 unsigned short Levels;
471 /// Here's the map from loops to levels:

Completed in 25 milliseconds