Searched refs:quotient (Results 1 - 14 of 14) sorted by relevance

/illumos-gate/usr/src/common/ficl/
H A Ddouble.c55 result.quotient = q / y;
57 * Once we have the quotient, it's cheaper to calculate the
60 result.remainder = (ficlInteger)(q - (result.quotient * y));
302 ficl2Unsigned quotient; local
306 quotient.low = 0;
307 quotient.high = 0;
324 quotient = ficl2UnsignedOr(quotient, mask);
330 result.quotient = quotient;
[all...]
H A Dutility.c109 v = result.quotient;
141 ud = result.quotient;
H A Dficl.h702 ficl2Unsigned quotient; member in struct:__anon485
708 ficl2Integer quotient; member in struct:__anon486
721 * to get an UNS32 quotient and remainder. Much easier in asm
H A Dprimitives.c1527 * Divide ud1 by the number in BASE giving the quotient ud2 and the remainder
1546 ficlStackPush2Unsigned(vm->dataStack, uqr.quotient);
1573 * until the quotient is zero. ud2 is zero. An ambiguous condition exists if
1593 u = uqr.quotient;
2689 * Divide d1 by n1, giving the floored quotient n3 and the remainder n2.
2691 * exists if n1 is zero or if the quotient lies outside the range of a
2708 FICL_2UNSIGNED_GET_LOW(qr.quotient));
2714 * Divide d1 by n1, giving the symmetric quotient n3 and the remainder n2.
2716 * exists if n1 is zero or if the quotient lies outside the range of a
2733 FICL_2UNSIGNED_GET_LOW(qr.quotient));
[all...]
H A Dvm.c1439 * and the single-ficlCell quotient n4. An ambiguous condition
1458 dataTop[0].i = FICL_2UNSIGNED_GET_LOW(qr.quotient);
1483 ficl2IntegerDivideSymmetric(prod, z).quotient);
1502 dataTop[0].i = FICL_2UNSIGNED_GET_LOW(qr.quotient);
/illumos-gate/usr/src/lib/libc/i386/gen/
H A Dldivide.s70 rcll $1,%edx / numerator * 2 (also quotient)
74 incl %eax / turn on quotient bit for now
79 decl %eax / turn quotient bit off
83 / at this point, %edx:%eax has the quotient and %edi:%esi has the remainder
/illumos-gate/usr/src/lib/libbc/libc/crt/sparc/
H A Dmuldiv.s38 udiv %o0, %o1, %o0 ! o0 contains quotient a/b
51 sdiv %o0,%o1,%o0 ! o0 contains quotient a/b
/illumos-gate/usr/src/lib/libm/amd64/src/
H A Dremquol.s64 movl %eax,(%rdi) / last 3 significant bits of quotient
/illumos-gate/usr/src/lib/libm/i386/src/
H A Dremquo.s66 movl %eax,0(%ecx) / last 3 significant bits of quotient
H A Dremquof.s66 movl %eax,0(%ecx) / last 3 significant bits of quotient
H A Dremquol.s66 movl %eax,0(%ecx) / last 3 significant bits of quotient
/illumos-gate/usr/src/cmd/sgs/rtld.4.x/
H A Ddiv.s49 * Q -- the partial quotient under development -- initally 0
52 * be required. Equal to CEIL( lg2(quotient)/4 )
53 * Note that this is log_base_(2^4) of the quotient.
57 * CEIL( lg2(quotient) / 4 ) x ( 10 + 74/2 ) + C
59 * different path, as the upper bits of the quotient must be developed
77 * this is the recursive definition of how we develop quotient digits.
80 * $2 -- the current accumulation of quotient bits
83 * insert the bits in the quotient.
86 * %o2 -- current quotient
122 ! compute size of quotient, scal
[all...]
H A Drem.s49 * Q -- the partial quotient under development -- initally 0
52 * be required. Equal to CEIL( lg2(quotient)/4 )
53 * Note that this is log_base_(2^4) of the quotient.
57 * CEIL( lg2(quotient) / 4 ) x ( 10 + 74/2 ) + C
59 * different path, as the upper bits of the quotient must be developed
77 * this is the recursive definition of how we develop quotient digits.
80 * $2 -- the current accumulation of quotient bits
83 * insert the bits in the quotient.
86 * %o2 -- current quotient
121 ! compute size of quotient, scal
[all...]
/illumos-gate/usr/src/lib/libdtrace/common/
H A Ddt_consume.c226 dt_divide_128(uint64_t *dividend, uint64_t divisor, uint64_t *quotient) argument
265 quotient[0] = result[0];
266 quotient[1] = result[1];

Completed in 76 milliseconds