Searched refs:divisor (Results 1 - 24 of 24) sorted by last modified time

/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dumsarith.tex138 greatest common divisor of numerator and denominator is 1 and the
272 gcd(E1,E2) & greatest common divisor & integer $\times$ integer & integer \\
/barrelfish-2018-10-04/usr/bench/
H A Dbench.c80 divide_round(uint64_t quotient, uint64_t divisor) argument
82 if ((quotient % divisor) * 2 >= divisor) {
84 return (quotient / divisor) + 1;
86 return (quotient / divisor);
/barrelfish-2018-10-04/tools/usbboot/arch/omap4/
H A Dserial.c56 unsigned divisor = CONFIG_SERIAL_CLK_HZ / 16 / CONFIG_BAUDRATE; local
61 WR(divisor & 0xFF, DLL);
62 WR(divisor >> 8, DLM);
/barrelfish-2018-10-04/lib/tommath/
H A Dtommath.tex3652 The precision of the division is proportional to the value of $q$. If the divisor $b$ is used frequently as is the case with
3707 Note that the original divisor $2^q$ has been replaced with $\beta^{m+1}$ where in this case $q$ is a multiple of $lg(\beta)$. Also note that the
3708 exponent on the divisor when added to the amount $q_0$ was shifted by equals $2m$. If the optimization had not been performed the divisor
5258 will be used. Let $x$ represent the divisor and $y$ represent the dividend. Let $q$ represent the integer quotient $\lfloor y / x \rfloor$ and
5286 their reason of existing are never explained. For this example let $y = 5471$ represent the dividend and $x = 23$ represent the divisor.
5302 As alluded to earlier the quotient digit $k$ can be estimated from only the leading digits of both the divisor and dividend. When $p$ leading
5303 digits are used from both the divisor and dividend to form an estimation the accuracy of the estimation rises as $p$ grows. Technically
5305 dividend and divisor are zero.
5308 of the estimation technique is to use $t + 1$ digits of the dividend and $t$ digits of the divisor, i
[all...]
H A Dbn.tex1790 This will compute the greatest common divisor of $a$ and $b$ and store it in $c$.
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/
H A Dbn_div.c172 /* BN_div[_no_branch] computes dv := num / divisor, rounding towards
173 * zero, and sets up rm such that dv*divisor + rm = num holds.
175 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
180 const BIGNUM *divisor, BN_CTX *ctx);
181 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, argument
201 if ((BN_get_flags(num, BN_FLG_CONSTTIME) != 0) || (BN_get_flags(divisor, BN_FLG_CONSTTIME) != 0))
203 return BN_div_no_branch(dv, rm, num, divisor, ctx);
209 bn_check_top(divisor);
211 if (BN_is_zero(divisor))
217 if (BN_ucmp(num,divisor) <
426 BN_div_no_branch(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, BN_CTX *ctx) argument
[all...]
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/include/linux/
H A Dmath64.h45 * div_u64_rem - unsigned 64bit divide with 32bit divisor with remainder
50 static inline u64 div_u64_rem(u64 dividend, u32 divisor, u32 *remainder) argument
52 *remainder = dividend % divisor;
53 return dividend / divisor;
105 static inline u64 div_u64_rem(u64 dividend, u32 divisor, u32 *remainder) argument
107 *remainder = do_div(dividend, divisor);
118 ** div_u64 - unsigned 64bit divide with 32bit divisor
126 static inline u64 div_u64(u64 dividend, u32 divisor) argument
129 return div_u64_rem(dividend, divisor, &remainder);
/barrelfish-2018-10-04/lib/compiler-rt/test/
H A Dmulxc3_test.c58 long double _Complex divisor; local
62 __real__ divisor = c; local
63 __imag__ divisor = d; local
68 switch (classify(divisor))
93 switch (classify(divisor))
120 switch (classify(divisor))
145 switch (classify(divisor))
170 switch (classify(divisor))
H A Dmultc3_test.c59 long double _Complex divisor; local
63 __real__ divisor = c; local
64 __imag__ divisor = d; local
69 switch (classify(divisor))
94 switch (classify(divisor))
121 switch (classify(divisor))
146 switch (classify(divisor))
171 switch (classify(divisor))
H A Dmulsc3_test.c56 float _Complex divisor; local
60 __real__ divisor = c; local
61 __imag__ divisor = d; local
66 switch (classify(divisor))
91 switch (classify(divisor))
122 switch (classify(divisor))
147 switch (classify(divisor))
172 switch (classify(divisor))
H A Dmuldc3_test.c56 double _Complex divisor; local
60 __real__ divisor = c; local
61 __imag__ divisor = d; local
66 switch (classify(divisor))
91 switch (classify(divisor))
118 switch (classify(divisor))
143 switch (classify(divisor))
168 switch (classify(divisor))
H A Ddivxc3_test.c58 long double _Complex divisor; local
62 __real__ divisor = c; local
63 __imag__ divisor = d; local
68 switch (classify(divisor))
93 switch (classify(divisor))
124 switch (classify(divisor))
149 switch (classify(divisor))
174 switch (classify(divisor))
H A Ddivsc3_test.c56 float _Complex divisor; local
60 __real__ divisor = c; local
61 __imag__ divisor = d; local
66 switch (classify(divisor))
91 switch (classify(divisor))
122 switch (classify(divisor))
147 switch (classify(divisor))
172 switch (classify(divisor))
H A Ddivdc3_test.c56 double _Complex divisor; local
60 __real__ divisor = c; local
61 __imag__ divisor = d; local
66 switch (classify(divisor))
91 switch (classify(divisor))
122 switch (classify(divisor))
147 switch (classify(divisor))
172 switch (classify(divisor))
/barrelfish-2018-10-04/lib/compiler-rt/builtins/arm/
H A Dudivsi3.S23 @ unsigned int __udivsi3(unsigned int divident, unsigned int divisor)
H A Dumodsi3.S20 @ unsigned int __umodsi3(unsigned int divident, unsigned int divisor)
H A Dudivmodsi4.S20 @ unsigned int __udivmodsi4(unsigned int divident, unsigned int divisor,
H A Ddivsi3.S30 @ int __divsi3(int divident, int divisor)
H A Dmodsi3.S26 @ int __modsi3(int divident, int divisor)
H A Ddivmodsi4.S27 @ int __divmodsi4(int divident, int divisor, int *remainder)
/barrelfish-2018-10-04/kernel/
H A Dmicrobenchmarks.c26 static uint64_t divide_round(uint64_t quotient, uint64_t divisor) argument
28 if ((quotient % divisor) * 2 >= divisor) {
30 return (quotient / divisor) + 1;
32 return (quotient / divisor);
/barrelfish-2018-10-04/kernel/arch/armv7/
H A Dplat_zynq7.c164 uint32_t divisor= zynq_slcr_ARM_CLK_CTRL_DIVISOR_rdf(slcr); local
165 uint32_t cpu_clk= src_clk / divisor;
H A Dplat_omap44xx.c181 uint32_t divisor = /* This is N+1 */ local
184 MSG("M = %"PRIx32", N = %"PRIx32"\n", mult, divisor - 1);
186 uint64_t f_dpll= ((uint64_t)sys_clk * 2 * mult) / divisor;
197 /* In high-speed mode, the divisor is hardcoded to 1, and an
/barrelfish-2018-10-04/include/vm/
H A Dmemguard.c70 SYSCTL_UINT(_vm_memguard, OID_AUTO, divisor, CTLFLAG_RDTUN | CTLFLAG_NOFETCH,
166 TUNABLE_INT_FETCH("vm.memguard.divisor", &vm_memguard_divisor);

Completed in 129 milliseconds