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

12

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/
H A Ddiv64.c63 u64 quotient; local
66 quotient = div_u64_rem(-dividend, abs(divisor), (u32 *)remainder);
69 quotient = -quotient;
71 quotient = div_u64_rem(dividend, abs(divisor), (u32 *)remainder);
73 quotient = -quotient;
75 return quotient;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/acpi/acpica/
H A Dutmath.c62 * out_quotient - Pointer to where the quotient is returned
68 * divide and modulo. The result is a 64-bit quotient and a
77 union uint64_overlay quotient; local
92 * The quotient is 64 bits, the remainder is always 32 bits,
96 quotient.part.hi, remainder32);
98 quotient.part.lo, remainder32);
103 *out_quotient = quotient.full;
118 * out_quotient - Pointer to where the quotient is returned
133 union uint64_overlay quotient; local
160 * The quotient i
[all...]
H A Dhwtimer.c143 u64 quotient; local
182 PM_TIMER_FREQUENCY, &quotient, NULL);
184 *time_elapsed = (u32) quotient;
H A Dutmisc.c731 u64 quotient; local
847 base, &quotient, NULL);
849 if (return_value > quotient) {
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/powerpc/lib/
H A Ddiv64.S6 * the 64-bit quotient, and r4 contains the divisor.
27 mullw r0,r7,r4 # quotient.hi = dividend.hi / divisor
44 2: mullw r10,r11,r4 # to get an estimate of the quotient,
48 subfe. r5,r9,r5 # quotient
56 4: stw r7,0(r3) # return the quotient in *r3
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/alpha/lib/
H A Ddivide.S38 * $2 - modulus/quotient
44 * $27 - quotient/modulus
64 #define quotient $27 define
72 #define quotient $2 define
106 bis $31,$31,quotient
137 2: DIV_ONLY(addq quotient,mask,tmp2)
141 DIV_ONLY(cmovne compare,tmp2,quotient)
H A Dev6-divide.S38 * $2 - modulus/quotient
44 * $27 - quotient/modulus
74 #define quotient $27 define
82 #define quotient $2 define
117 bis $31,$31,quotient # E :
165 DIV_ONLY(addq quotient,mask,tmp2) # E :
174 DIV_ONLY(cmovne compare,tmp2,quotient) # E : Latency 2, extra map slot
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/common/
H A Dlonglong.cpp854 wxLongLongWx& quotient,
881 quotient = 0l;
886 // dividend, while the sign of the quotient is the product of the signs of
889 // dividend = quotient*divisor + remainder
916 quotient = 1l;
953 quotient <<= 1;
956 quotient |= 1;
973 quotient = -quotient;
978 wxULongLongWx& quotient,
853 Divide(const wxLongLongWx& divisorIn, wxLongLongWx& quotient, wxLongLongWx& remainderIO) const argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/powerpc/boot/
H A Ddiv64.S6 * the 64-bit quotient, and r4 contains the divisor.
27 mullw r0,r7,r4 # quotient.hi = dividend.hi / divisor
43 2: mullw r10,r11,r4 # to get an estimate of the quotient,
47 subfe. r5,r9,r5 # quotient
55 4: stw r7,0(r3) # return the quotient in *r3
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/m68k/math-emu/
H A Dfp_emu.h56 #define fp_set_quotient(quotient) ({ \
58 FPDATA->fpsr |= ((quotient) & 0xff) << 16; \
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/m68k/ifpsp060/src/
H A Dilsp.S77 # 0x10(sp) = pointer to location to place quotient/remainder #
80 # 0x10(sp) = points to location of remainder/quotient. #
81 # remainder is in first longword, quotient is in 2nd. #
204 eor.b %d0, NDIVIDEND(%a6) # chk if quotient is negative
221 # if the register numbers are the same, only the quotient gets saved.
222 # so, if we always save the quotient second, we save ourselves a cmp&beq
278 # The quotient is returned in %d6, remainder in %d5, unless the #
291 # In the general case, four quotient words would be created by
293 # the first two quotient words must be zero, or overflow would occur.
296 # the last two divisions to get a quotient longwor
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/s390/lib/
H A Dqrnnd.S8 # the quotient q is to be returned
25 ahi %r1,1 # trick part 2: add 1 to the quotient
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/media/common/tuners/
H A Dmax2165.c166 int fixpt_div32(u32 dividend, u32 divisor, u32 *quotient, u32 *fraction) argument
187 *quotient = q;
198 u32 quotient, fraction; local
202 &quotient, &fraction);
207 max2165_write_reg(priv, REG_NDIV_INT, quotient);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/staging/easycap/
H A Deasycap_sound.c826 above = sdr.quotient;
831 sdr.quotient, above, peasycap->audio_sample);
834 JOT(8, "audio dynamic range is roughly %lli\n", sdr.quotient);
850 sdr.quotient = 192000;
861 sdr.quotient = 192000;
863 JOT(8, "audio streaming at %lli bytes/second\n", sdr.quotient);
866 peasycap->dnbydt = sdr.quotient;
H A Deasycap.h565 long long int quotient; member in struct:signed_div_result
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/
H A Dgf2n.cpp282 void PolynomialMod2::Divide(PolynomialMod2 &remainder, PolynomialMod2 &quotient, argument
291 quotient.reg.CleanNew(BitsToWords(dividend.BitCount() - divisor.BitCount() + 1));
293 quotient.reg.CleanNew(0);
302 quotient.SetBit(i);
309 PolynomialMod2 remainder, quotient; local
310 PolynomialMod2::Divide(remainder, quotient, *this, b);
311 return quotient;
316 PolynomialMod2 remainder, quotient; local
317 PolynomialMod2::Divide(remainder, quotient, *this, b);
H A Dpolynomi.cpp311 PolynomialOver<T> remainder, quotient; local
312 Divide(remainder, quotient, *this, t, ring);
313 return quotient;
319 PolynomialOver<T> remainder, quotient; local
320 Divide(remainder, quotient, *this, t, ring);
H A Dinteger.cpp257 // returns quotient, which must fit in a word
330 // returns quotient, which must fit in a word
350 // do a 3 word by 2 word divide, returns quotient and leaves remainder in A
354 // assert {A[2],A[1]} < {B1,B0}, so quotient can fit in a S
357 // estimate the quotient: do a 2 S by 1 S divide
372 // Q <= actual quotient, so fix it
387 // do a 4 word by 2 word divide, returns 2 word quotient in Q0 and Q1
406 // returns quotient, which must fit in a word
2450 // do a 3 word by 2 word divide, returns quotient and leaves remainder in A
2453 // assert {A[2],A[1]} < {B1,B0}, so quotient ca
[all...]
H A Dinteger.h376 friend void PositiveDivide(Integer &remainder, Integer &quotient, const Integer &dividend, const Integer &divisor);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/staging/cx25821/
H A Dcx25821-medusa-video.c613 int quotient; local
626 quotient = numerator / denominator;
629 quotient++;
631 *dstVal = quotient + dstMin;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/MacOS/GetHTTPS.src/
H A DCPStringUtils.cpp755 unsigned long tempNum,quotient,remainder; local
789 quotient = tempNum / 10;
791 remainder = tempNum - (quotient * 10);
797 tempNum = quotient;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/MacOS/GetHTTPS.src/
H A DCPStringUtils.cpp755 unsigned long tempNum,quotient,remainder; local
789 quotient = tempNum / 10;
791 remainder = tempNum - (quotient * 10);
797 tempNum = quotient;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/MacOS/GetHTTPS.src/
H A DCPStringUtils.cpp755 unsigned long tempNum,quotient,remainder; local
789 quotient = tempNum / 10;
791 remainder = tempNum - (quotient * 10);
797 tempNum = quotient;
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/arch/sparc/lib/
H A Dudiv.S29 * Q the partial quotient under development (initially 0)
32 * equal to ceil(log2(quotient) / N). Note that this
33 * is the log base (2^N) of the quotient.
38 * ceil(log2(quotient) / N) * (10 + 7N/2) + C
40 * different path, as the upper bits of the quotient must be developed
50 ! Ready to divide. Compute size of quotient; scale comparand.
H A Durem.S28 * Q the partial quotient under development (initially 0)
31 * equal to ceil(log2(quotient) / N). Note that this
32 * is the log base (2^N) of the quotient.
37 * ceil(log2(quotient) / N) * (10 + 7N/2) + C
39 * different path, as the upper bits of the quotient must be developed
48 ! Ready to divide. Compute size of quotient; scale comparand.

Completed in 139 milliseconds

12