/dragonfly/sys/dev/drm/include/linux/ |
H A D | math64.h | 47 *remainder = dividend % divisor; in div_u64_rem() 48 return (dividend / divisor); in div_u64_rem() 54 return (dividend / divisor); in div64_u64() 58 div64_s64(int64_t dividend, int64_t divisor) in div64_s64() argument 60 return (dividend / divisor); in div64_s64() 64 div_u64(uint64_t dividend, uint32_t divisor) in div_u64() argument 66 return (dividend / divisor); in div_u64() 70 div_s64(int64_t dividend, int32_t divisor) in div_s64() argument 72 return (dividend / divisor); in div_s64() 78 *remainder = dividend % divisor; in div64_u64_rem() [all …]
|
H A D | kernel.h | 112 #define DIV_ROUND_CLOSEST(x, divisor) (((x) + ((divisor) /2)) / (divisor)) argument 115 mult_frac(uintmax_t x, uintmax_t multiplier, uintmax_t divisor) in mult_frac() argument 117 uintmax_t q = (x / divisor); in mult_frac() 118 uintmax_t r = (x % divisor); in mult_frac() 120 return ((q * multiplier) + ((r * multiplier) / divisor)); in mult_frac()
|
/dragonfly/lib/libutil/ |
H A D | humanize_number.c | 54 int64_t divisor, max; in humanize_number() local 89 divisor = 1024; in humanize_number() 98 divisor = 1000; in humanize_number() 105 divisor = 1024; in humanize_number() 150 quotient /= divisor; in humanize_number() 158 quotient /= divisor; in humanize_number() 166 sign * (quotient + (remainder + divisor / 2) / divisor), in humanize_number() 187 divisor / frac); in humanize_number() 188 s2 = ((remainder * frac + divisor / 2) / divisor) % frac; in humanize_number() 200 divisor / 10); in humanize_number() [all …]
|
/dragonfly/contrib/gmp/ |
H A D | gen-psqr.c | 105 int divisor; member 113 int divisor; member 129 if (p->divisor > q->divisor) in f_cmp_divisor() 131 else if (p->divisor < q->divisor) in f_cmp_divisor() 227 int i, divisor; in generate_mod() local 292 divisor = 1; in generate_mod() 355 if (rawfactor[i].divisor > max_divisor / rawfactor[i].divisor) in generate_mod() 383 factor[nfactor].divisor *= rawfactor[i].divisor; in generate_mod() 394 if (factor[i].divisor <= max_divisor / factor[0].divisor) in generate_mod() 396 factor[0].divisor *= factor[i].divisor; in generate_mod() [all …]
|
/dragonfly/contrib/gmp/mpz/ |
H A D | mod.c | 25 mpz_mod (mpz_ptr rem, mpz_srcptr dividend, mpz_srcptr divisor) in mpz_mod() argument 27 mp_size_t divisor_size = divisor->_mp_size; in mpz_mod() 36 if (rem == divisor) in mpz_mod() 39 mpz_set (temp_divisor, divisor); in mpz_mod() 40 divisor = temp_divisor; in mpz_mod() 43 mpz_tdiv_r (rem, dividend, divisor); in mpz_mod() 49 if (divisor->_mp_size < 0) in mpz_mod() 50 mpz_sub (rem, rem, divisor); in mpz_mod() 52 mpz_add (rem, rem, divisor); in mpz_mod()
|
H A D | cdiv_qr.c | 25 mpz_cdiv_qr (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, mpz_srcptr divisor) in mpz_cdiv_qr() argument 27 mp_size_t divisor_size = divisor->_mp_size; in mpz_cdiv_qr() 37 if (quot == divisor || rem == divisor) in mpz_cdiv_qr() 40 mpz_set (temp_divisor, divisor); in mpz_cdiv_qr() 41 divisor = temp_divisor; in mpz_cdiv_qr() 45 mpz_tdiv_qr (quot, rem, dividend, divisor); in mpz_cdiv_qr() 50 mpz_sub (rem, rem, divisor); in mpz_cdiv_qr()
|
H A D | fdiv_qr.c | 25 mpz_fdiv_qr (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, mpz_srcptr divisor) in mpz_fdiv_qr() argument 27 mp_size_t divisor_size = divisor->_mp_size; in mpz_fdiv_qr() 37 if (quot == divisor || rem == divisor) in mpz_fdiv_qr() 40 mpz_set (temp_divisor, divisor); in mpz_fdiv_qr() 41 divisor = temp_divisor; in mpz_fdiv_qr() 45 mpz_tdiv_qr (quot, rem, dividend, divisor); in mpz_fdiv_qr() 50 mpz_add (rem, rem, divisor); in mpz_fdiv_qr()
|
H A D | cdiv_ui.c | 28 mpz_cdiv_ui (mpz_srcptr dividend, unsigned long int divisor) in mpz_cdiv_ui() argument 34 if (divisor == 0) in mpz_cdiv_ui() 46 if (divisor > GMP_NUMB_MAX) in mpz_cdiv_ui() 61 dp[0] = divisor & GMP_NUMB_MASK; in mpz_cdiv_ui() 62 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_cdiv_ui() 71 rl = divisor - rl; in mpz_cdiv_ui() 81 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor); in mpz_cdiv_ui() 87 rl = divisor - rl; in mpz_cdiv_ui()
|
H A D | fdiv_ui.c | 26 mpz_fdiv_ui (mpz_srcptr dividend, unsigned long int divisor) in mpz_fdiv_ui() argument 32 if (divisor == 0) in mpz_fdiv_ui() 44 if (divisor > GMP_NUMB_MAX) in mpz_fdiv_ui() 59 dp[0] = divisor & GMP_NUMB_MASK; in mpz_fdiv_ui() 60 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_fdiv_ui() 69 rl = divisor - rl; in mpz_fdiv_ui() 79 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor); in mpz_fdiv_ui() 85 rl = divisor - rl; in mpz_fdiv_ui()
|
H A D | fdiv_r.c | 25 mpz_fdiv_r (mpz_ptr rem, mpz_srcptr dividend, mpz_srcptr divisor) in mpz_fdiv_r() argument 27 mp_size_t divisor_size = divisor->_mp_size; in mpz_fdiv_r() 36 if (rem == divisor) in mpz_fdiv_r() 39 mpz_set (temp_divisor, divisor); in mpz_fdiv_r() 40 divisor = temp_divisor; in mpz_fdiv_r() 43 mpz_tdiv_r (rem, dividend, divisor); in mpz_fdiv_r() 46 mpz_add (rem, rem, divisor); in mpz_fdiv_r()
|
H A D | cdiv_r.c | 25 mpz_cdiv_r (mpz_ptr rem, mpz_srcptr dividend, mpz_srcptr divisor) in mpz_cdiv_r() argument 27 mp_size_t divisor_size = divisor->_mp_size; in mpz_cdiv_r() 36 if (rem == divisor) in mpz_cdiv_r() 40 mpz_set (temp_divisor, divisor); in mpz_cdiv_r() 41 divisor = temp_divisor; in mpz_cdiv_r() 44 mpz_tdiv_r (rem, dividend, divisor); in mpz_cdiv_r() 47 mpz_sub (rem, rem, divisor); in mpz_cdiv_r()
|
H A D | cdiv_q_ui.c | 27 mpz_cdiv_q_ui (mpz_ptr quot, mpz_srcptr dividend, unsigned long int divisor) in mpz_cdiv_q_ui() argument 33 if (divisor == 0) in mpz_cdiv_q_ui() 49 if (divisor > GMP_NUMB_MAX) in mpz_cdiv_q_ui() 61 dp[0] = divisor & GMP_NUMB_MASK; in mpz_cdiv_q_ui() 62 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_cdiv_q_ui() 71 rl = divisor - rl; in mpz_cdiv_q_ui() 79 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); in mpz_cdiv_q_ui() 84 rl = divisor - rl; in mpz_cdiv_q_ui()
|
H A D | cdiv_r_ui.c | 28 mpz_cdiv_r_ui (mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor) in mpz_cdiv_r_ui() argument 34 if (divisor == 0) in mpz_cdiv_r_ui() 47 if (divisor > GMP_NUMB_MAX) in mpz_cdiv_r_ui() 65 dp[0] = divisor & GMP_NUMB_MASK; in mpz_cdiv_r_ui() 66 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_cdiv_r_ui() 75 rl = divisor - rl; in mpz_cdiv_r_ui() 86 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor); in mpz_cdiv_r_ui() 92 rl = divisor - rl; in mpz_cdiv_r_ui()
|
H A D | fdiv_q_ui.c | 26 mpz_fdiv_q_ui (mpz_ptr quot, mpz_srcptr dividend, unsigned long int divisor) in mpz_fdiv_q_ui() argument 32 if (divisor == 0) in mpz_fdiv_q_ui() 48 if (divisor > GMP_NUMB_MAX) in mpz_fdiv_q_ui() 60 dp[0] = divisor & GMP_NUMB_MASK; in mpz_fdiv_q_ui() 61 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_fdiv_q_ui() 70 rl = divisor - rl; in mpz_fdiv_q_ui() 78 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); in mpz_fdiv_q_ui() 83 rl = divisor - rl; in mpz_fdiv_q_ui()
|
H A D | fdiv_r_ui.c | 26 mpz_fdiv_r_ui (mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor) in mpz_fdiv_r_ui() argument 32 if (divisor == 0) in mpz_fdiv_r_ui() 45 if (divisor > GMP_NUMB_MAX) in mpz_fdiv_r_ui() 63 dp[0] = divisor & GMP_NUMB_MASK; in mpz_fdiv_r_ui() 64 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_fdiv_r_ui() 73 rl = divisor - rl; in mpz_fdiv_r_ui() 84 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor); in mpz_fdiv_r_ui() 90 rl = divisor - rl; in mpz_fdiv_r_ui()
|
H A D | fdiv_qr_ui.c | 26 mpz_fdiv_qr_ui (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor) in mpz_fdiv_qr_ui() argument 32 if (divisor == 0) in mpz_fdiv_qr_ui() 49 if (divisor > GMP_NUMB_MAX) in mpz_fdiv_qr_ui() 67 dp[0] = divisor & GMP_NUMB_MASK; in mpz_fdiv_qr_ui() 68 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_fdiv_qr_ui() 77 rl = divisor - rl; in mpz_fdiv_qr_ui() 89 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); in mpz_fdiv_qr_ui() 97 rl = divisor - rl; in mpz_fdiv_qr_ui()
|
H A D | cdiv_qr_ui.c | 28 mpz_cdiv_qr_ui (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor) in mpz_cdiv_qr_ui() argument 34 if (divisor == 0) in mpz_cdiv_qr_ui() 51 if (divisor > GMP_NUMB_MAX) in mpz_cdiv_qr_ui() 69 dp[0] = divisor & GMP_NUMB_MASK; in mpz_cdiv_qr_ui() 70 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_cdiv_qr_ui() 79 rl = divisor - rl; in mpz_cdiv_qr_ui() 91 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); in mpz_cdiv_qr_ui() 99 rl = divisor - rl; in mpz_cdiv_qr_ui()
|
H A D | tdiv_ui.c | 26 mpz_tdiv_ui (mpz_srcptr dividend, unsigned long int divisor) in mpz_tdiv_ui() argument 32 if (divisor == 0) in mpz_tdiv_ui() 45 if (divisor > GMP_NUMB_MAX) in mpz_tdiv_ui() 59 dp[0] = divisor & GMP_NUMB_MASK; in mpz_tdiv_ui() 60 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_tdiv_ui() 70 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor); in mpz_tdiv_ui()
|
H A D | tdiv_q_ui.c | 26 mpz_tdiv_q_ui (mpz_ptr quot, mpz_srcptr dividend, unsigned long int divisor) in mpz_tdiv_q_ui() argument 32 if (divisor == 0) in mpz_tdiv_q_ui() 48 if (divisor > GMP_NUMB_MAX) in mpz_tdiv_q_ui() 59 dp[0] = divisor & GMP_NUMB_MASK; in mpz_tdiv_q_ui() 60 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_tdiv_q_ui() 68 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); in mpz_tdiv_q_ui()
|
H A D | tdiv_r_ui.c | 26 mpz_tdiv_r_ui (mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor) in mpz_tdiv_r_ui() argument 32 if (divisor == 0) in mpz_tdiv_r_ui() 45 if (divisor > GMP_NUMB_MAX) in mpz_tdiv_r_ui() 64 dp[0] = divisor & GMP_NUMB_MASK; in mpz_tdiv_r_ui() 65 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_tdiv_r_ui() 76 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor); in mpz_tdiv_r_ui()
|
H A D | tdiv_qr_ui.c | 27 mpz_tdiv_qr_ui (mpz_ptr quot, mpz_ptr rem, mpz_srcptr dividend, unsigned long int divisor) in mpz_tdiv_qr_ui() argument 33 if (divisor == 0) in mpz_tdiv_qr_ui() 50 if (divisor > GMP_NUMB_MAX) in mpz_tdiv_qr_ui() 68 dp[0] = divisor & GMP_NUMB_MASK; in mpz_tdiv_qr_ui() 69 dp[1] = divisor >> GMP_NUMB_BITS; in mpz_tdiv_qr_ui() 79 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor); in mpz_tdiv_qr_ui()
|
H A D | dive_ui.c | 24 mpz_divexact_ui (mpz_ptr dst, mpz_srcptr src, unsigned long divisor) in mpz_divexact_ui() argument 29 if (divisor == 0) in mpz_divexact_ui() 34 if (divisor > GMP_NUMB_MAX) in mpz_divexact_ui() 40 mpz_set_ui (dz, divisor); in mpz_divexact_ui() 56 MPN_DIVREM_OR_DIVEXACT_1 (dst_ptr, PTR(src), abs_size, (mp_limb_t) divisor); in mpz_divexact_ui()
|
/dragonfly/contrib/gmp/mpn/generic/ |
H A D | dive_1.c | 67 mpn_divexact_1 (mp_ptr dst, mp_srcptr src, mp_size_t size, mp_limb_t divisor) in mpn_divexact_1() argument 74 ASSERT (divisor != 0); in mpn_divexact_1() 77 ASSERT_LIMB (divisor); in mpn_divexact_1() 83 dst[0] = s / divisor; in mpn_divexact_1() 87 if ((divisor & 1) == 0) in mpn_divexact_1() 89 count_trailing_zeros (shift, divisor); in mpn_divexact_1() 90 divisor >>= shift; in mpn_divexact_1() 95 binvert_limb (inverse, divisor); in mpn_divexact_1() 96 divisor <<= GMP_NAIL_BITS; in mpn_divexact_1() 115 umul_ppmm (h, dummy, l, divisor); in mpn_divexact_1() [all …]
|
/dragonfly/crypto/libressl/crypto/bn/ |
H A D | bn_div.c | 146 bn_check_top(divisor); in BN_div_internal() 148 if (BN_is_zero(divisor)) { in BN_div_internal() 153 if (!no_branch && BN_ucmp(num, divisor) < 0) { in BN_div_internal() 175 norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2); in BN_div_internal() 176 if (!(BN_lshift(sdiv, divisor, norm_shift))) in BN_div_internal() 225 res->neg = (num->neg ^ divisor->neg); in BN_div_internal() 382 BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, in BN_div() argument 386 (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0)); in BN_div() 388 return BN_div_internal(dv, rm, num, divisor, ctx, ct); in BN_div() 395 return BN_div_internal(dv, rm, num, divisor, ctx, 0); in BN_div_nonct() [all …]
|
/dragonfly/usr.sbin/ppp/ |
H A D | throughput.c | 104 int secs_up, divisor; in throughput_disp() local 114 divisor = secs_up ? secs_up : 1; in throughput_disp() 121 (t->OctetsIn + t->OctetsOut) / divisor); in throughput_disp() 131 (t->OctetsIn + t->OctetsOut) / divisor); in throughput_disp() 166 int uptime, divisor; in throughput_sampler() local 172 divisor = uptime < t->SamplePeriod ? uptime + 1 : t->SamplePeriod; in throughput_sampler() 176 t->in.OctetsPerSecond = (t->in.SampleOctets[t->nSample] - old) / divisor; in throughput_sampler() 267 int divisor; in throughput_clear() local 269 if ((divisor = throughput_uptime(t)) == 0) in throughput_clear() 270 divisor = 1; in throughput_clear() [all …]
|