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

  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
ConstantRange.h 95 /// Produce the smallest range such that all values that may satisfy the given
251 /// Return the smallest unsigned value contained in the ConstantRange.
257 /// Return the smallest signed value contained in the ConstantRange.
288 /// signed domain, or has the smallest size, is preferred. If a signedness is
290 /// smallest set size is preferred. If there are multiple smallest sets, any
292 enum PreferredRangeType { Smallest, Unsigned, Signed };
298 PreferredRangeType Type = Smallest) const;
306 PreferredRangeType Type = Smallest) const;
367 PreferredRangeType RangeType = Smallest) const
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/
SystemZTDC.cpp 137 // Compute the smallest normal number (and its negation).
139 APFloat Smallest = APFloat::getSmallestNormalized(Sem);
140 APFloat NegSmallest = Smallest;
150 } else if (Const->isExactlyValue(Smallest)) {
151 // For Smallest, we cannot do EQ separately from GT.
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
InductiveRangeCheckElimination.cpp 1086 // We compute `Smallest` and `Greatest` such that [Smallest, Greatest), or
1087 // [Smallest, GreatestSeen] is the range of values the induction variable
1090 const SCEV *Smallest = nullptr, *Greatest = nullptr, *GreatestSeen = nullptr;
1094 Smallest = Start;
1096 // No overflow, because the range [Smallest, GreatestSeen] is not empty.
1105 // * if `Smallest` sign-overflows we know `End` is `INT_SMAX`. Since the
1106 // induction variable is decreasing we know that that the smallest value
1107 // the loop body is actually executed with is `INT_SMIN` == `Smallest`.
1110 // that case, `Clamp` will always return `Smallest` an
    [all...]

Completed in 24 milliseconds