Home
last modified time | relevance | path

Searched refs:Levels (Results 1 – 15 of 15) sorted by relevance

/freebsd-13.1/contrib/llvm-project/clang/lib/AST/Interp/
H A DInterpFrame.cpp91 llvm::SmallVector<Pointer, 2> Levels; in print() local
93 Levels.push_back(F); in print()
98 for (auto It = Levels.rbegin(); It != Levels.rend(); ++It) { in print()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DCFLGraph.h74 std::vector<NodeInfo> Levels; variable
78 auto NumLevels = Levels.size(); in addNodeToLevel()
81 Levels.resize(Level + 1); in addNodeToLevel()
86 assert(Level < Levels.size()); in getNodeInfoAtLevel()
87 return Levels[Level]; in getNodeInfoAtLevel()
90 assert(Level < Levels.size()); in getNodeInfoAtLevel()
91 return Levels[Level]; in getNodeInfoAtLevel()
94 unsigned getNumLevels() const { return Levels.size(); } in getNumLevels()
H A DLoopCacheAnalysis.cpp233 int Levels = D->getLevels(); in hasTemporalReuse() local
234 for (int Level = 1; Level <= Levels; ++Level) { in hasTemporalReuse()
H A DDependenceAnalysis.cpp259 : Dependence(Source, Destination), Levels(CommonLevels), in FullDependence()
270 assert(0 < Level && Level <= Levels && "Level out of range"); in getDirection()
277 assert(0 < Level && Level <= Levels && "Level out of range"); in getDistance()
286 assert(0 < Level && Level <= Levels && "Level out of range"); in isScalar()
294 assert(0 < Level && Level <= Levels && "Level out of range"); in isPeelFirst()
302 assert(0 < Level && Level <= Levels && "Level out of range"); in isPeelLast()
309 assert(0 < Level && Level <= Levels && "Level out of range"); in isSplitable()
606 unsigned Levels = getLevels(); in dump() local
608 for (unsigned II = 1; II <= Levels; ++II) { in dump()
633 if (II < Levels) in dump()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/
H A DScopedPrinter.h76 void indent(int Levels = 1) { IndentLevel += Levels; }
78 void unindent(int Levels = 1) {
79 IndentLevel = std::max(0, IndentLevel - Levels);
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h218 unsigned Levels);
235 unsigned getLevels() const override { return Levels; } in getLevels()
263 unsigned short Levels;
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp136 unsigned Levels = D->getLevels(); in populateDependencyMatrix() local
138 for (unsigned II = 1; II <= Levels; ++II) { in populateDependencyMatrix()
/freebsd-13.1/crypto/heimdal/lib/wind/
H A Drfc3491.txt154 Requirement Levels", BCP 14, RFC 2119, March 1997.
H A Drfc4518.txt436 Requirement Levels", BCP 14, RFC 2119, March 1997.
H A Drfc3490.txt964 Requirement Levels", BCP 14, RFC 2119, March 1997.
H A Drfc3492.txt1132 Requirement Levels", BCP 14, RFC 2119, March 1997.
H A Drfc3454.txt1033 Requirement Levels", BCP 14, RFC 2119, March 1997.
/freebsd-13.1/contrib/llvm-project/clang/lib/Frontend/
H A DCompilerInvocation.cpp1218 const std::vector<std::string> &Levels, in parseDiagnosticLevelMask() argument
1222 for (const auto &Level : Levels) { in parseDiagnosticLevelMask()
/freebsd-13.1/contrib/bearssl/src/ssl/
H A Dssl_hs_common.t0489 \ Levels shall be 1 (warning) or 2 (fatal); we convert
/freebsd-13.1/sys/contrib/dev/acpica/
H A Dchanges.txt8981 Fixed a problem with Mutex Sync Levels. Fixed a problem where if multiple