| /freebsd/lib/libutil/ |
| H A D | humanize_number.c | 48 humanize_number(char *buf, size_t len, int64_t quotient, in humanize_number() argument 113 if (quotient < 0) { in humanize_number() 115 quotient = -quotient; in humanize_number() 144 (quotient >= max || (quotient == max - 1 && in humanize_number() 147 remainder = quotient % divisor; in humanize_number() 148 quotient /= divisor; in humanize_number() 155 remainder = quotient % divisor; in humanize_number() 156 quotient /= divisor; in humanize_number() 165 if (((quotient == 9 && remainder < divisordeccut) || quotient < 9) && in humanize_number() 167 s1 = (int)quotient + ((remainder * 10 + divisor / 2) / in humanize_number() [all …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/builtins/ |
| H A D | udivmodti4.c | 106 utwords quotient; in __udivmodti4() local 118 quotient.s.low = udiv128by64to64(dividend.s.high, dividend.s.low, in __udivmodti4() 120 quotient.s.high = 0; in __udivmodti4() 124 quotient.s.high = dividend.s.high / divisor.s.low; in __udivmodti4() 126 quotient.s.low = udiv128by64to64(dividend.s.high, dividend.s.low, in __udivmodti4() 131 return quotient.all; in __udivmodti4() 137 quotient.s.high = 0; in __udivmodti4() 138 quotient.s.low = 0; in __udivmodti4() 140 quotient.s.low <<= 1; in __udivmodti4() 149 quotient.s.low |= s & 1; in __udivmodti4() [all …]
|
| H A D | int_div_impl.inc | 79 s_a ^= s_b; // sign of quotient
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/ |
| H A D | divmod.m4 | 20 * Q -- the partial quotient under development -- initially 0 23 * be required. Equal to CEIL( lg2(quotient)/N ) 24 * Note that this is log_base_(2ˆN) of the quotient. 28 * CEIL( lg2(quotient) / N ) x ( 10 + 7N/2 ) + C 30 * different path, as the upper bits of the quotient must be developed 45 * This is the recursive definition of how we develop quotient digits. 48 * $2 -- the current accumulation of quotient bits 50 * We add a new bit to $2 and either recurse or insert the bits in the quotient. 53 * Q -- current quotient 83 ifelse( ANSWER, `quotient', ` [all …]
|
| H A D | generate.sh | 4 m4 -DANSWER=quotient divmod.m4 | sed -e 's/[[:space:]]*$//' | grep -v '^$' > divsi3.S
|
| H A D | divsi3.S | 71 ! Compute size of quotient, scale comparand. 330 mov %o2,%o0 ! quotient <- %o2
|
| /freebsd/sys/contrib/dev/rtw89/ |
| H A D | util.h | 45 s32 quotient; in s32_div_u32_round_down() local 47 quotient = dividend / i_divisor; in s32_div_u32_round_down() 51 quotient--; in s32_div_u32_round_down() 57 return quotient; in s32_div_u32_round_down()
|
| /freebsd/stand/ficl/ |
| H A D | math64.c | 523 DPUNS quotient; in ficlLongDiv() local 527 quotient.lo = 0; in ficlLongDiv() 528 quotient.hi = 0; in ficlLongDiv() 548 quotient = m64Or(quotient, mask); in ficlLongDiv() 554 result.quot = quotient.lo; in ficlLongDiv()
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/builtins/avr/ |
| H A D | divmodhi4.S | 49 ret ; Return quotient via R23:R22 and remainder via R25:R24. 57 ret ; Return quotient via R23:R22 and remainder via R25:r24.
|
| H A D | divmodqi4.S | 44 ret ; Return quotient via R24 and remainder via R25.
|
| H A D | udivmodqi4.S | 38 com r24 ; The uint8 quotient is returned via R24.
|
| H A D | udivmodhi4.S | 46 mov r23, r25 ; The quotient is returned in R23:R22.
|
| /freebsd/crypto/openssl/test/ |
| H A D | bntests.pl | 68 my $quotient = bn($s{'Quotient'}); 74 $b->bmul($quotient); 88 return if $rempassed && $quotient == $a;
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/builtins/arm/ |
| H A D | divmodsi4.S | 28 @ Calculate the quotient and remainder of the (signed) division. The return 29 @ value is the quotient, the remainder is placed in the variable.
|
| H A D | udivmodsi4.S | 22 @ Calculate the quotient and remainder of the (unsigned) division. The return 23 @ value is the quotient, the remainder is placed in the variable.
|
| H A D | divsi3.S | 31 @ Calculate and return the quotient of the (signed) division.
|
| /freebsd/contrib/llvm-project/libc/src/__support/ |
| H A D | big_int.h | 339 BigInt quotient; 671 *this = result.quotient; 697 BigInt quotient; 733 quotient.val[q_pos - 1] = (q_tmp << HALF_WORD_SIZE) + rem / x_word; 749 quotient <<= last_shift; 776 quotient.val[0] += q_tmp; 798 *this = quotient; 1007 BigInt quotient; 1017 quotient.set_bit(static_cast<size_t>(cur_bit)); 1020 return Division{quotient, remainder}; [all …]
|
| /freebsd/sys/contrib/device-tree/Bindings/iio/afe/ |
| H A D | voltage-divider.txt | 29 is scaled by the Rout / (R + Rout) quotient.
|
| /freebsd/crypto/openssl/crypto/ml_kem/ |
| H A D | ml_kem.c | 809 uint32_t quotient = (uint32_t)(product >> kBarrettShift); in reduce() local 810 uint32_t remainder = x - quotient * kPrime; in reduce() 1134 uint32_t quotient = (uint32_t)(product >> kBarrettShift); in compress() local 1135 uint32_t remainder = shifted - quotient * kPrime; in compress() 1143 quotient += 1 & constant_time_lt_32(kHalfPrime, remainder); in compress() 1144 quotient += 1 & constant_time_lt_32(kPrime + kHalfPrime, remainder); in compress() 1145 return quotient & ((1 << bits) - 1); in compress()
|
| /freebsd/crypto/openssl/doc/man3/ |
| H A D | BN_mod_mul_reciprocal.pod | 43 BN_div_recp() divides B<a> by B<m> using B<recp>. It places the quotient
|
| /freebsd/crypto/openssl/crypto/bn/asm/ |
| H A D | bn-c64xplus.asm | 193 [!A2] MV B4,A4 ; reassign lo, will be quotient 210 ||[!A1] OR 1,A4,A4 ; quotient
|
| /freebsd/crypto/openssl/doc/internal/man3/ |
| H A D | OSSL_SAFE_MATH_SIGNED.pod | 54 I.e. it computes the quotient of I<a> and I<b> rounding any remainder towards
|
| /freebsd/lib/libc/softfloat/bits32/ |
| H A D | softfloat-macros | 479 Returns an approximation to the 32-bit integer quotient obtained by dividing 481 divisor `b' must be at least 2^31. If q is the exact quotient truncated 483 If the exact quotient q is larger than 32 bits, the maximum positive 32-bit
|
| /freebsd/usr.bin/sed/tests/ |
| H A D | math.sed | 238 # .[/%] numerator q quotient r remainder-divisor @stack
|
| /freebsd/contrib/bc/src/ |
| H A D | num.c | 1822 BcBigDig n1, dividend, quotient; in bc_num_d_long() local 1828 quotient = (dividend / divisor); in bc_num_d_long() 1833 if (quotient <= 1) in bc_num_d_long() 1835 quotient = 1; in bc_num_d_long() 1840 assert(quotient <= BC_BASE_POW); in bc_num_d_long() 1843 bc_num_mulArray(b, (BcBigDig) quotient, &cpb); in bc_num_d_long() 1849 result += quotient; in bc_num_d_long()
|