/linux-3.4.99/drivers/acpi/acpica/ |
D | utmath.c | 94 union uint64_overlay quotient; in acpi_ut_short_divide() local 113 quotient.part.hi, remainder32); in acpi_ut_short_divide() 115 quotient.part.lo, remainder32); in acpi_ut_short_divide() 120 *out_quotient = quotient.full; in acpi_ut_short_divide() 150 union uint64_overlay quotient; in acpi_ut_divide() local 181 quotient.part.hi, partial1); in acpi_ut_divide() 183 quotient.part.lo, remainder.part.lo); in acpi_ut_divide() 191 quotient.part.hi = 0; in acpi_ut_divide() 210 quotient.part.lo, partial1); in acpi_ut_divide() 216 partial1 = quotient.part.lo * divisor.part.hi; in acpi_ut_divide() [all …]
|
D | hwtimer.c | 145 u64 quotient; in ACPI_EXPORT_SYMBOL() local 184 PM_TIMER_FREQUENCY, "ient, NULL); in ACPI_EXPORT_SYMBOL() 186 *time_elapsed = (u32) quotient; in ACPI_EXPORT_SYMBOL()
|
D | utmisc.c | 726 u64 quotient; in acpi_ut_strtoul64() local 842 base, "ient, NULL); in acpi_ut_strtoul64() 844 if (return_value > quotient) { in acpi_ut_strtoul64()
|
/linux-3.4.99/lib/ |
D | div64.c | 64 u64 quotient; in div_s64_rem() local 67 quotient = div_u64_rem(-dividend, abs(divisor), (u32 *)remainder); in div_s64_rem() 70 quotient = -quotient; in div_s64_rem() 72 quotient = div_u64_rem(dividend, abs(divisor), (u32 *)remainder); in div_s64_rem() 74 quotient = -quotient; in div_s64_rem() 76 return quotient; in div_s64_rem()
|
/linux-3.4.99/arch/alpha/lib/ |
D | divide.S | 64 #define quotient $27 macro 72 #define quotient $2 macro 106 bis $31,$31,quotient 137 2: DIV_ONLY(addq quotient,mask,tmp2) 141 DIV_ONLY(cmovne compare,tmp2,quotient)
|
D | ev6-divide.S | 74 #define quotient $27 macro 82 #define quotient $2 macro 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
|
/linux-3.4.99/arch/m68k/ifpsp060/src/ |
D | ilsp.S | 77 # 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 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 longword and word remainder: 305 mov.w %d5, %d1 # first quotient word 312 mov.w %d5, %d1 # 2nd quotient 'digit' [all …]
|
/linux-3.4.99/arch/powerpc/lib/ |
D | div64.S | 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
|
/linux-3.4.99/arch/powerpc/boot/ |
D | div64.S | 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
|
/linux-3.4.99/arch/m68k/math-emu/ |
D | fp_emu.h | 56 #define fp_set_quotient(quotient) ({ \ argument 58 FPDATA->fpsr |= ((quotient) & 0xff) << 16; \
|
/linux-3.4.99/drivers/media/common/tuners/ |
D | max2165.c | 164 int fixpt_div32(u32 dividend, u32 divisor, u32 *quotient, u32 *fraction) in fixpt_div32() argument 185 *quotient = q; in fixpt_div32() 196 u32 quotient, fraction; in max2165_set_rf() local 201 "ient, &fraction); in max2165_set_rf() 208 max2165_write_reg(priv, REG_NDIV_INT, quotient); in max2165_set_rf()
|
D | tda18218.c | 32 u8 buf[1+len], quotient, remainder, i, msg_len, msg_len_max; in tda18218_wr_regs() local 42 quotient = len / msg_len_max; in tda18218_wr_regs() 45 for (i = 0; (i <= quotient && remainder); i++) { in tda18218_wr_regs() 46 if (i == quotient) /* set len of the last msg */ in tda18218_wr_regs()
|
/linux-3.4.99/arch/s390/lib/ |
D | qrnnd.S | 10 # the quotient q is to be returned 26 ahi %r1,1 # trick part 2: add 1 to the quotient
|
/linux-3.4.99/arch/c6x/lib/ |
D | divremu.S | 27 ;; At the end, we have both the remainder and most of the quotient 28 ;; in A4. The top bit of the quotient is computed first and is
|
D | divu.S | 44 ;; At the end, we have both the remainder and most of the quotient 45 ;; in A4. The top bit of the quotient is computed first and is
|
/linux-3.4.99/drivers/media/video/cx25821/ |
D | cx25821-medusa-video.c | 551 int quotient; in mapM() local 564 quotient = numerator / denominator; in mapM() 567 quotient++; in mapM() 569 *dstVal = quotient + dstMin; in mapM()
|
/linux-3.4.99/arch/m68k/fpsp040/ |
D | fpsp.h | 96 .set FPSR_QBYTE,USER_FPSR+1 | FPSR quotient 227 .set q_sn_bit,7 | sign bit of quotient byte
|
/linux-3.4.99/Documentation/ |
D | crc32.txt | 38 When computing a CRC, we don't care about the quotient, so we can 39 throw the quotient bit away, but subtract the appropriate multiple of
|
/linux-3.4.99/arch/arm/nwfpe/ |
D | softfloat-macros | 552 Returns an approximation to the 64-bit integer quotient obtained by dividing 554 divisor `b' must be at least 2^63. If q is the exact quotient truncated 556 If the exact quotient q is larger than 64 bits, the maximum positive 64-bit
|
/linux-3.4.99/arch/sparc/lib/ |
D | urem.S | 48 ! Ready to divide. Compute size of quotient; scale comparand.
|
D | udiv.S | 50 ! Ready to divide. Compute size of quotient; scale comparand.
|
D | rem.S | 64 ! Ready to divide. Compute size of quotient; scale comparand.
|
D | sdiv.S | 64 ! Ready to divide. Compute size of quotient; scale comparand.
|
/linux-3.4.99/arch/m68k/ifpsp060/ |
D | ilsp.doc | 108 mov.l (%sp)+,%d0 # load quotient
|
/linux-3.4.99/drivers/net/wireless/b43/ |
D | phy_lp.c | 1080 u32 quotient, remainder; in lpphy_qdiv_roundup() local 1085 quotient = dividend / divisor; in lpphy_qdiv_roundup() 1089 quotient <<= 1; in lpphy_qdiv_roundup() 1091 quotient++; in lpphy_qdiv_roundup() 1098 quotient++; in lpphy_qdiv_roundup() 1100 return quotient; in lpphy_qdiv_roundup()
|