Home
last modified time | relevance | path

Searched refs:Greatest (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp609 const SCEV *Smallest = nullptr, *Greatest = nullptr, *GreatestSeen = nullptr; in calculateSubRanges() local
614 Greatest = End; in calculateSubRanges()
634 Greatest = SE.getAddExpr(Start, 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()
/freebsd/contrib/bc/manuals/
H A Dalgorithms.md344 ### Greatest Common Divisor (`bc` Math Library 2 Only)
/freebsd/contrib/one-true-awk/testdir/
H A Dfunstack.ok297 Gordon H. Bradley Algorithm and Bound for the Greatest
302 G. H. Bradley ACM Algorithm 386: Greatest Common
1341 D. I. Good Greatest common divisor of $n$ integers
H A Dfunstack.in2061 title = "Algorithm and Bound for the Greatest Common Divisor of $n$ Integers",
2125 title = "{ACM} Algorithm 386: Greatest Common Divisor of $n$ Integers and Multipliers",
9854 title = "Greatest common divisor of $n$ integers and multipliers",