/freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ScalarEvolutionDivision.cpp | 54 // Denominator. 56 const SCEV *Denominator, const SCEV **Quotient, in divide() argument 58 assert(Numerator && Denominator && "Uninitialized SCEV"); in divide() 60 SCEVDivision D(SE, Numerator, Denominator); in divide() 64 if (Numerator == Denominator) { in divide() 77 if (Denominator->isOne()) { in divide() 83 // Split the Denominator when it is a product. in divide() 84 if (const SCEVMulExpr *T = dyn_cast<SCEVMulExpr>(Denominator)) { in divide() 92 // the Denominator. in divide() 109 if (const SCEVConstant *D = dyn_cast<SCEVConstant>(Denominator)) { in visitConstant() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Support/ |
H A D | BranchProbability.cpp | 40 BranchProbability::BranchProbability(uint32_t Numerator, uint32_t Denominator) { in BranchProbability() argument 41 assert(Denominator > 0 && "Denominator cannot be 0!"); in BranchProbability() 42 assert(Numerator <= Denominator && "Probability cannot be bigger than 1!"); in BranchProbability() 43 if (Denominator == D) in BranchProbability() 47 (Numerator * static_cast<uint64_t>(D) + Denominator / 2) / Denominator; in BranchProbability() 54 uint64_t Denominator) { in getBranchProbability() argument 55 assert(Numerator <= Denominator && "Probability cannot be bigger than 1!"); in getBranchProbability() 56 // Scale down Denominator to fit in a 32-bit integer. in getBranchProbability() 58 while (Denominator > UINT32_MAX) { in getBranchProbability() 59 Denominator >>= 1; in getBranchProbability() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/MCA/ |
H A D | Support.cpp | 25 if (Denominator == RHS.Denominator) in operator +=() 28 // Create a common denominator for LHS and RHS by calculating the least in operator +=() 30 unsigned GCD = std::gcd(Denominator, RHS.Denominator); in operator +=() 31 unsigned LCM = (Denominator * RHS.Denominator) / GCD; in operator +=() 32 unsigned LHSNumerator = Numerator * (LCM / Denominator); in operator +=() 33 unsigned RHSNumerator = RHS.Numerator * (LCM / RHS.Denominator); in operator +=() 35 Denominator in operator +=() [all...] |
/freebsd/contrib/llvm-project/llvm/include/llvm/MCA/ |
H A D | Support.h | 52 unsigned Numerator, Denominator; variable 55 ReleaseAtCycles() : Numerator(0), Denominator(1) {} in ResourceCycles() 57 : Numerator(Cycles), Denominator(ResourceUnits) {} in Numerator() 60 assert(Denominator && "Invalid denominator (must be non-zero)."); 61 return (Denominator == 1) ? Numerator : (double)Numerator / Denominator; 65 unsigned getDenominator() const { return Denominator; } in getDenominator() 68 // the final value here, we keep track of the numerator and denominator
|
/freebsd/usr.bin/random/ |
H A D | random.6 | 38 .Op Ar denominator 44 .Ar denominator . 45 .Ar ( denominator 48 .Ar denominator 60 .Ar denominator 72 .Ar denominator 75 .Ar denominator
|
H A D | random.c | 118 errx(1, "denominator is not valid."); in main() 120 errx(1, "denominator must be <= 256 for random exit."); in main() 179 fprintf(stderr, "usage: random [-elrUuw] [-f filename] [denominator]\n"); in usage()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | MathExtras.h | 400 /// Returns the integer ceil(Numerator / Denominator). Unsigned version. 403 constexpr T divideCeil(U Numerator, V Denominator) { in divideCeil() argument 404 assert(Denominator && "Division by zero"); in divideCeil() 406 return (Numerator - Bias) / Denominator + Bias; in divideCeil() 410 constexpr uint64_t divideCeil(uint64_t Numerator, uint64_t Denominator) { in divideCeil() argument 411 assert(Denominator && "Division by zero"); in divideCeil() 413 return (Numerator - Bias) / Denominator + Bias; in divideCeil() 417 // happens only when Numerator = INT_MIN and Denominator = -1. 419 constexpr bool divideSignedWouldOverflow(U Numerator, V Denominator) { in divideSignedWouldOverflow() argument 420 return Numerator == std::numeric_limits<U>::min() && Denominator == -1; in divideSignedWouldOverflow() [all …]
|
H A D | BranchProbability.h | 28 // denominator is always a constant value (here we use 1<<31 for maximum 34 // Denominator, which is a constant value. 38 // Construct a BranchProbability with only numerator assuming the denominator 44 BranchProbability(uint32_t Numerator, uint32_t Denominator); 53 // as denominator. 57 uint64_t Denominator);
|
/freebsd/sys/dev/clk/rockchip/ |
H A D | rk_clk_fract.c | 61 uint32_t denominator; member 122 /* Compute new denominator and save last one */ in clk_compute_fract_div() 149 sc->denominator = reg & 0xFFFF; in rk_clk_fract_init() 150 if (sc->denominator == 0) in rk_clk_fract_init() 151 sc->denominator = 1; in rk_clk_fract_init() 187 if (sc->denominator == 0) { in rk_clk_fract_recalc() 188 printf("%s: %s denominator is zero!\n", clknode_get_name(clk), in rk_clk_fract_recalc() 195 *freq /= sc->denominator; in rk_clk_fract_recalc() 248 sc->denominator = (uint32_t)div_d; in rk_clk_fract_set_freq() 251 WR4(clk, sc->offset, sc->numerator << 16 | sc->denominator); in rk_clk_fract_set_freq()
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolutionDivision.h | 29 // Denominator. 31 const SCEV *Denominator, const SCEV **Quotient, 35 // Expr by Denominator for the following functions with empty implementation. 61 const SCEV *Denominator); 68 const SCEV *Denominator, *Quotient, *Remainder, *Zero, *One; member
|
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
H A D | common.h | 119 inline void computePercentage(uptr Numerator, uptr Denominator, uptr *Integral, in computePercentage() argument 122 if (Denominator == 0) { in computePercentage() 128 *Integral = Numerator * Digits / Denominator; in computePercentage() 130 (((Numerator * Digits) % Denominator) * Digits + Denominator / 2) / in computePercentage() 131 Denominator; in computePercentage()
|
/freebsd/usr.bin/units/ |
H A D | units.c | 54 char *denominator[MAXSUBUNITS]; member 222 theunit->numerator[0] = theunit->denominator[0] = NULL; in initializeunit() 272 for (ptr = theunit->denominator; *ptr; ptr++) { in showunit() 273 if (ptr > theunit->denominator && **ptr && in showunit() 402 if (addsubunit(doingtop ^ flip ? theunit->numerator : theunit->denominator, item)) { in addunit() 437 for (count = 0, ptr = theunit->denominator; *ptr; ptr++, count++); in sortunit() 438 qsort(theunit->denominator, count, sizeof(char *), compare); in sortunit() 448 den = theunit->denominator; in cancelunit() 558 product = theunit->denominator; in reduceproduct() 588 Reduces numerator and denominator o [all...] |
/freebsd/usr.bin/gprof/ |
H A D | gprof.callg | 54 all of its parents. This is the denominator of 80 functions. This is the denominator of the 94 the propagated times and propagation denominator
|
/freebsd/sys/arm/freescale/vybrid/ |
H A D | vf_anadig.c | 60 #define ANADIG_PLL2_DENOM 0x060 /* PLL2 Denominator */ 63 #define ANADIG_PLL4_DENOM 0x090 /* PLL4 Denominator */ 66 #define ANADIG_PLL6_DENOM 0x0C0 /* PLL6 Denominator */ 79 #define ANADIG_PLL1_DENOM 0x2A0 /* PLL1 Denominator */
|
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/arm/ |
H A D | aeabi_ldivmod.S | 12 // __aeabi_ldivmod(int64_t numerator, int64_t denominator) { 14 // quot = __divmoddi4(numerator, denominator, &rem);
|
H A D | aeabi_uldivmod.S | 12 // __aeabi_uldivmod(uint64_t numerator, uint64_t denominator) { 14 // quot = __udivmoddi4(numerator, denominator, &rem);
|
H A D | aeabi_idivmod.S | 11 // struct { int quot, int rem} __aeabi_idivmod(int numerator, int denominator) { 13 // quot = __divmodsi4(numerator, denominator, &rem);
|
H A D | aeabi_uidivmod.S | 12 // __aeabi_uidivmod(unsigned numerator, unsigned denominator) { 14 // quot = __udivmodsi4(numerator, denominator, &rem);
|
/freebsd/sys/dev/isci/scil/ |
H A D | scic_library.h | 199 * @note SGL size is restricted to the lowest common denominator across all 217 * @note SGE count is restricted to the lowest common denominator across all 234 * @note IO length is restricted to the lowest common denominator across all
|
/freebsd/contrib/arm-optimized-routines/math/tools/ |
H A D | remez.jl | 107 # dcoeffs Array of BigFloats giving the coefficients of the denominator. 151 # dcoeffs Array of BigFloats giving the coefficients of the denominator. 157 # Special case: if the denominator is just 1, leave it out. 334 # d Degree of the denominator polynomial of the desired rational 385 # i.e. the denominator coefficient of x^i. 604 # n, d The degrees of the numerator and denominator of the desired 672 # and multiplying up by the denominator gives you a lot of 780 # n, d The degrees of the numerator and denominator of the desired 1059 the numerator, and <d> the denominator. If you just want an 1149 numerator and denominator. [all …]
|
/freebsd/sys/gnu/dev/bwn/phy_n/ |
H A D | if_bwn_phy_n_regs.h | 171 #define BWN_NPHY_RXF20_DENOM0 BWN_PHY_N(0x04C) /* RX filter 20 denominator 0 */ 172 #define BWN_NPHY_RXF20_DENOM1 BWN_PHY_N(0x04D) /* RX filter 20 denominator 1 */ 176 #define BWN_NPHY_RXF20_DENOM10 BWN_PHY_N(0x051) /* RX filter 20 denominator 10 */ 177 #define BWN_NPHY_RXF20_DENOM11 BWN_PHY_N(0x052) /* RX filter 20 denominator 11 */ 181 #define BWN_NPHY_RXF40_DENOM0 BWN_PHY_N(0x056) /* RX filter 40 denominator 0 */ 182 #define BWN_NPHY_RXF40_DENOM1 BWN_PHY_N(0x057) /* RX filter 40 denominator 1 */ 186 #define BWN_NPHY_RXF40_DENOM10 BWN_PHY_N(0x05B) /* RX filter 40 denominator 10 */ 187 #define BWN_NPHY_RXF40_DENOM11 BWN_PHY_N(0x05C) /* RX filter 40 denominator 11 */
|
/freebsd/share/mk/ |
H A D | host-target.mk | 59 # tr is insanely non-portable, accommodate the lowest common denominator
|
/freebsd/contrib/bmake/mk/ |
H A D | host-target.mk | 73 # tr is insanely non-portable, accommodate the lowest common denominator
|
/freebsd/share/man/man5/ |
H A D | pbm.5 | 9 The portable bitmap format is a lowest common denominator monochrome
|
/freebsd/share/doc/smm/18.net/ |
H A D | d.t | 47 as the lowest reasonable common denominator (at least reasonable
|