Home
last modified time | relevance | path

Searched refs:quotient (Results 1 – 25 of 42) sorted by relevance

12

/freebsd/lib/libutil/
H A Dhumanize_number.c48 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 Dudivmodti4.c106 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 Dint_div_impl.inc79 s_a ^= s_b; // sign of quotient
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/
H A Ddivmod.m420 * 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 Dgenerate.sh4 m4 -DANSWER=quotient divmod.m4 | sed -e 's/[[:space:]]*$//' | grep -v '^$' > divsi3.S
H A Ddivsi3.S71 ! Compute size of quotient, scale comparand.
330 mov %o2,%o0 ! quotient <- %o2
/freebsd/sys/contrib/dev/rtw89/
H A Dutil.h29 s32 quotient; in s32_div_u32_round_down()
31 quotient = dividend / i_divisor; in s32_div_u32_round_down()
35 quotient--; in s32_div_u32_round_down()
41 return quotient;
27 s32 quotient; s32_div_u32_round_down() local
/freebsd/stand/ficl/
H A Dmath64.c523 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 Ddivmodhi4.S49 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 Ddivmodqi4.S44 ret ; Return quotient via R24 and remainder via R25.
H A Dudivmodqi4.S38 com r24 ; The uint8 quotient is returned via R24.
H A Dudivmodhi4.S46 mov r23, r25 ; The quotient is returned in R23:R22.
/freebsd/crypto/openssl/test/
H A Dbntests.pl68 my $quotient = bn($s{'Quotient'});
74 $b->bmul($quotient);
88 return if $rempassed && $quotient == $a;
H A Dbntest.c1511 BIGNUM *a = NULL, *b = NULL, *quotient = NULL, *remainder = NULL; in file_quotient() local
1518 || !TEST_ptr(quotient = getBN(s, "Quotient")) in file_quotient()
1526 || !equalBN("A / B", quotient, ret) in file_quotient()
1528 || !TEST_true(BN_mul(ret, quotient, b, ctx)) in file_quotient()
1555 if (!equalBN ("A / B (word)", quotient, ret)) in file_quotient()
1585 BN_free(quotient); in file_quotient()
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/arm/
H A Ddivmodsi4.S28 @ 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 Dudivmodsi4.S22 @ 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 Ddivsi3.S31 @ Calculate and return the quotient of the (signed) division.
/freebsd/sys/contrib/device-tree/Bindings/iio/afe/
H A Dvoltage-divider.txt29 is scaled by the Rout / (R + Rout) quotient.
/freebsd/crypto/openssl/doc/man3/
H A DBN_mod_mul_reciprocal.pod43 BN_div_recp() divides B<a> by B<m> using B<recp>. It places the quotient
/freebsd/crypto/openssl/crypto/bn/asm/
H A Dbn-c64xplus.asm193 [!A2] MV B4,A4 ; reassign lo, will be quotient
210 ||[!A1] OR 1,A4,A4 ; quotient
/freebsd/lib/libc/softfloat/bits32/
H A Dsoftfloat-macros479 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 Dmath.sed238 # .[/%] numerator q quotient r remainder-divisor @stack
/freebsd/contrib/bc/src/
H A Dnum.c1821 BcBigDig n1, dividend, quotient; in bc_num_d_long() local
1827 quotient = (dividend / divisor); in bc_num_d_long()
1832 if (quotient <= 1) in bc_num_d_long()
1834 quotient = 1; in bc_num_d_long()
1839 assert(quotient <= BC_BASE_POW); in bc_num_d_long()
1842 bc_num_mulArray(b, (BcBigDig) quotient, &cpb); in bc_num_d_long()
1848 result += quotient; in bc_num_d_long()
/freebsd/lib/libc/softfloat/bits64/
H A Dsoftfloat-macros554 Returns an approximation to the 64-bit integer quotient obtained by dividing
556 divisor `b' must be at least 2^63. If q is the exact quotient truncated
558 If the exact quotient q is larger than 64 bits, the maximum positive 64-bit
/freebsd/crypto/libecc/src/arithmetic_tests/
H A Darithmetic_tests_generator.py1089 quotient, remainder = divmod(d, 2)
1093 d = quotient

12