HomeSort by: relevance | last modified time | path
    Searched defs:Min (Results 1 - 25 of 65) sorted by relevancy

1 2 3

  /src/external/gpl3/gdb/dist/sim/testsuite/cris/c/
sched5.c 10 int Min = sched_get_priority_min (SCHED_OTHER);
12 if (Min != 0 || Max != 0)
14 fprintf (stderr, "min: %d, max: %d\n", Min, Max);
  /src/external/gpl3/gdb.old/dist/sim/testsuite/cris/c/
sched5.c 10 int Min = sched_get_priority_min (SCHED_OTHER);
12 if (Min != 0 || Max != 0)
14 fprintf (stderr, "min: %d, max: %d\n", Min, Max);
  /src/external/apache2/llvm/dist/clang/lib/Basic/Targets/
OSTargets.cpp 51 unsigned Maj, Min, Rev;
53 Triple.getMacOSXVersion(Maj, Min, Rev);
56 Triple.getOSVersion(Maj, Min, Rev);
64 PlatformMinVersion = VersionTuple(Maj, Min, Rev);
70 assert(Maj < 100 && Min < 100 && Rev < 100 && "Invalid version!");
74 Str[1] = '0' + (Min / 10);
75 Str[2] = '0' + (Min % 10);
83 Str[2] = '0' + (Min / 10);
84 Str[3] = '0' + (Min % 10);
96 assert(Maj < 10 && Min < 100 && Rev < 100 && "Invalid version!")
    [all...]
OSTargets.h 376 unsigned Maj, Min, Rev;
377 Triple.getEnvironmentVersion(Maj, Min, Rev);
379 this->PlatformMinVersion = VersionTuple(Maj, Min, Rev);
  /src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/
RISCVSubtarget.cpp 37 "riscv-v-vector-bits-min",
132 unsigned Min = RVVVectorBitsMin;
134 Min = std::min(RVVVectorBitsMin, RVVVectorBitsMax);
135 return PowerOf2Floor(Min < 128 ? 0 : Min);
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
FuzzerDefs.h 145 template <class T> T Min(T a, T b) { return a < b ? a : b; }
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
AssumeBundleQueries.h 73 unsigned Min;
110 /// This is only intended for use in std::min/std::max between attribute that
115 "This is only intend for use in min/max to select the best for "
MemoryBuiltins.h 195 Min,
196 /// Same as Min, except we pick the maximum size of all of the branches.
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/
LowerTypeTests.h 63 uint64_t Min = std::numeric_limits<uint64_t>::max();
69 if (Min > Offset)
70 Min = Offset;
  /src/games/robots/
extern.c 80 COORD Min; /* Min area robots take up */
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/
ReductionRules.h 50 PBQPNum Min = ECosts[0][j] + XCosts[0];
53 if (C < Min)
54 Min = C;
56 YCosts[j] += Min;
60 PBQPNum Min = ECosts[i][0] + XCosts[0];
63 if (C < Min)
64 Min = C;
66 YCosts[i] += Min;
112 PBQPNum Min = (*YXECosts)[i][0] + (*ZXECosts)[j][0] + XCosts[0];
115 if (C < Min) {
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/
CodeViewRecordIO.cpp 68 Optional<uint32_t> Min = Limits.front().bytesRemaining(Offset);
72 Min = (Min.hasValue()) ? std::min(*Min, *ThisMin) : *ThisMin;
74 assert(Min.hasValue() && "Every field must have a maximum length!");
76 return *Min;
276 if (Value >= std::numeric_limits<int8_t>::min()) {
281 } else if (Value >= std::numeric_limits<int16_t>::min()) {
286 } else if (Value >= std::numeric_limits<int32_t>::min()) {
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/
xray-color-helper.cpp 70 // Being below min, and missing left being above max.
86 int Min = 0;
89 if (Scaled[i] < Scaled[Min])
90 Min = i;
95 double C = Scaled[Max] - Scaled[Min];
113 double n = std::max(std::min(B, 1.0), 0.0);
142 double Min = V - C;
143 double RGB2[3] = {RGB1[0] + Min, RGB1[1] + Min, RGB1[2] + Min};
    [all...]
xray-account.cpp 68 MIN,
82 clEnumValN(SortField::MIN, "min", "minimum function durations"),
125 MM = std::make_pair(std::min(MM.first, V), std::max(MM.second, V));
128 template <class T> T diff(T L, T R) { return std::max(L, R) - std::min(L, R); }
262 double Min;
277 R.Min = *MinMax.first;
320 Row.Min /= CycleFrequency;
340 case SortField::MIN:
341 sortByKey(Results, [](const TupleType &X) { return std::get<2>(X).Min; });
    [all...]
xray-graph.h 39 enum class StatType { NONE, COUNT, MIN, MED, PCT90, PCT99, MAX, SUM };
44 double Min;
168 return {A.Count + B.Count, A.Min + B.Min, A.Median + B.Median,
177 return {A.Count - B.Count, A.Min - B.Min, A.Median - B.Median,
187 A.Min / B,
199 A.Min * B,
216 return {A.Count * B.Count, A.Min * B.Min, A.Median * B.Median
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/ubsan/
ubsan_diag.cc 254 MemoryLocation Min = subtractNoOverflow(Loc, MinBytesNearLoc);
256 MemoryLocation OrigMin = Min;
258 Min = __sanitizer::Min(Ranges[I].getStart().getMemoryLocation(), Min);
264 if (Max - Min > BytesToShow)
265 Min = __sanitizer::Min(Max - BytesToShow, OrigMin);
266 Max = addNoOverflow(Min, BytesToShow);
268 if (!IsAccessibleMemoryRange(Min, Max - Min))
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Frontend/
VerifyDiagnosticConsumer.h 196 bool MatchAnyLine, StringRef Text, unsigned Min, unsigned Max);
205 unsigned Min, Max;
223 unsigned Min, unsigned Max)
225 Min(Min), Max(Max), MatchAnyLine(MatchAnyLine || MatchAnyFileAndLine),
  /src/external/apache2/llvm/dist/clang/lib/AST/Interp/
Integral.h 65 static const auto Min = std::numeric_limits<T>::min();
125 bool isMin() const { return *this == min(bitWidth()); }
151 static Integral min(unsigned NumBits) { function in class:clang::interp::Integral
152 return Integral(Min);
183 return CheckRange<T, Min, Max>(Value);
246 template <typename T, T Min, T Max>
249 return Min <= V && V <= Max;
252 template <typename T, T Min, T Max>
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
Iterator.cpp 286 llvm::APSInt Min = -Max;
289 nonloc::ConcreteInt(Min), SVB.getConditionType());
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
KnownBits.h 126 APInt Min = One;
129 Min.setSignBit();
130 return Min;
  /src/external/apache2/llvm/dist/llvm/lib/IR/
ConstantRange.cpp 14 // ranges (other integral ranges use min/max values for special range values):
55 "Lower == Upper, but they aren't min or max value!");
669 APInt Min = APInt::getMinValue(BW).zextOrSelf(ResultBitWidth);
671 return ConstantRange(std::move(Min), std::move(Max));
1007 // be non-wrapping, round the result min and max value to the appropriate
1041 // [-1,4) * [-2,3) = min(-1*-2, -1*2, 3*-2, 3*2) = -6.
1042 // Similarly for the upper bound, swapping min for max.
1052 ConstantRange Result_sext(std::min(L, Compare), std::max(L, Compare) + 1);
1345 APInt min = getUnsignedMin();
1346 min <<= Other.getUnsignedMin()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPURegBankCombiner.cpp 50 unsigned Min, Max, Med;
91 // 4 operand commutes of: min(max(Val, K0), K1).
92 // Find K1 from outer instr: min(max(...), K1) or min(K1, max(...)).
94 // 4 operand commutes of: max(min(Val, K1), K0).
95 // Find K0 from outer instr: max(min(...), K0) or max(K0, min(...)).
96 // Find K1 and Val from inner instr: min(K1, Val) or min(Val, K1).
101 MMMOpc.Min, m_CommutativeBinOp(MMMOpc.Max, m_Reg(Val), m_Cst(K0))
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AVR/MCTargetDesc/
AVRAsmBackend.cpp 43 int64_t Min = minIntN(Width);
46 Diagnostic += " (expected an integer in the range " + std::to_string(Min) +
  /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
BenchmarkResult.h 78 enum ResultAggregationModeE { Min, Max, Mean, MinVariance };
106 double min() const { return MinValue; } function in class:llvm::exegesis::PerInstructionStats
115 double MaxValue = std::numeric_limits<double>::min();
  /src/external/apache2/llvm/dist/llvm/tools/llvm-pdbutil/
llvm-pdbutil.h 110 uint64_t Min;

Completed in 87 milliseconds

1 2 3