Home
last modified time | relevance | path

Searched refs:Smallest (Results 1 – 8 of 8) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DConstantRange.h333 enum PreferredRangeType { Smallest, Unsigned, Signed }; enumerator
339 const ConstantRange &CR, PreferredRangeType Type = Smallest) const;
347 PreferredRangeType Type = Smallest) const;
419 PreferredRangeType RangeType = Smallest) const;
432 PreferredRangeType RangeType = Smallest) const;
446 PreferredRangeType RangeType = Smallest) const;
520 PreferredRangeType RangeType = Smallest) const;
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZTDC.cpp131 APFloat Smallest = APFloat::getSmallestNormalized(Sem); in convertFCmp() local
132 APFloat NegSmallest = Smallest; in convertFCmp()
142 } else if (Const->isExactlyValue(Smallest)) { in convertFCmp()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp609 const SCEV *Smallest = nullptr, *Greatest = nullptr, *GreatestSeen = nullptr; in calculateSubRanges() local
613 Smallest = Start; in calculateSubRanges()
633 Smallest = SE.getAddExpr(End, One); in calculateSubRanges()
638 auto Clamp = [&SE, Smallest, Greatest, IsSignedPredicate](const SCEV *S) { in calculateSubRanges()
640 ? SE.getSMaxExpr(Smallest, SE.getSMinExpr(Greatest, S)) in calculateSubRanges()
641 : SE.getUMaxExpr(Smallest, SE.getUMinExpr(Greatest, S)); in calculateSubRanges()
651 SE.isKnownPredicate(PredLE, Range.getBegin(), Smallest); in calculateSubRanges()
/freebsd/contrib/unbound/doc/
H A Drequirements.txt72 o Smallest as possible component that does the job.
/freebsd/contrib/llvm-project/clang/lib/CodeGen/
H A DCGBuiltin.cpp4307 APFloat Smallest = APFloat::getSmallestNormalized( in EmitBuiltinExpr()
4310 Builder.CreateFCmpUGE(VAbs, ConstantFP::get(V->getContext(), Smallest), in EmitBuiltinExpr()
4303 APFloat Smallest = APFloat::getSmallestNormalized( EmitBuiltinExpr() local
/freebsd/contrib/one-true-awk/testdir/
H A Dfunstack.ok2081 -- for Finding the $i$th Smallest of $n$
3605 Smallest of $n$ Elements [M1]'' . . . . 301--304
H A Dfunstack.in15697 …title = "{ACM} Algorithm 489: The Algorithm {SELECT} -- for Finding the $i$th Smallest of $…
26772 …ark on {``Algorithm 489: The Algorithm SELECT --- for Finding the $i$th Smallest of $n$ Elements […
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolution.cpp7057 return SR.intersectWith(UR, ConstantRange::Smallest); in getRangeForAffineAR()