Home
last modified time | relevance | path

Searched full:quotient (Results 1 – 25 of 74) sorted by relevance

123

/linux-6.12.1/arch/m68k/lib/
Dudivsi3.S99 divu d1, d2 /* high quotient in lower word */
100 movew d2, d0 /* save high quotient */
103 divu d1, d2 /* low quotient */
115 /* Multiply the 16 bit tentative quotient with the 32 bit divisor. Because of
117 greater than the dividend, the tentative quotient was too large. */
124 jne L5 /* if 17 bits, quotient was too large */
126 jcs L5 /* if sum is 33 bits, quotient was too large */
128 jls L6 /* if sum > dividend, quotient was too large */
129 L5: subql IMM (1), d0 /* adjust quotient */
/linux-6.12.1/drivers/acpi/acpica/
Dutmath.c244 * out_quotient - Pointer to where the quotient is returned
250 * divide and modulo. The result is a 64-bit quotient and a
260 union uint64_overlay quotient; in acpi_ut_short_divide() local
275 * The quotient is 64 bits, the remainder is always 32 bits, in acpi_ut_short_divide()
279 quotient.part.hi, remainder32); in acpi_ut_short_divide()
282 quotient.part.lo, remainder32); in acpi_ut_short_divide()
287 *out_quotient = quotient.full; in acpi_ut_short_divide()
302 * out_quotient - Pointer to where the quotient is returned
317 union uint64_overlay quotient; in acpi_ut_divide() local
344 * The quotient is 64 bits, the remainder is always 32 bits, in acpi_ut_divide()
[all …]
Dhwtimer.c123 u64 quotient; in ACPI_EXPORT_SYMBOL() local
168 ACPI_PM_TIMER_FREQUENCY, &quotient, NULL); in ACPI_EXPORT_SYMBOL()
170 *time_elapsed = (u32)quotient; in ACPI_EXPORT_SYMBOL()
/linux-6.12.1/lib/math/
Dtest_div64.c56 u64 quotient; member
152 static inline bool test_div64_verify(u64 quotient, u32 remainder, int i, int j) in test_div64_verify() argument
154 return (quotient == test_div64_results[i][j].quotient && in test_div64_verify()
165 u64 quotient; \
168 quotient = dividend; \
169 remainder = do_div(quotient, divisor); \
170 if (!test_div64_verify(quotient, remainder, i, j)) { \
172 dividend, divisor, quotient, remainder); \
174 test_div64_results[i][j].quotient, \
Ddiv64.c70 u64 quotient; in div_s64_rem() local
73 quotient = div_u64_rem(-dividend, abs(divisor), (u32 *)remainder); in div_s64_rem()
76 quotient = -quotient; in div_s64_rem()
78 quotient = div_u64_rem(dividend, abs(divisor), (u32 *)remainder); in div_s64_rem()
80 quotient = -quotient; in div_s64_rem()
82 return quotient; in div_s64_rem()
/linux-6.12.1/arch/powerpc/lib/
Ddiv64.S7 * the 64-bit quotient, and r4 contains the divisor.
23 mullw r0,r7,r4 # quotient.hi = dividend.hi / divisor
40 2: mullw r10,r11,r4 # to get an estimate of the quotient,
44 subfe. r5,r9,r5 # quotient
52 4: stw r7,0(r3) # return the quotient in *r3
/linux-6.12.1/Documentation/devicetree/bindings/power/avs/
Dqcom,cpr.yaml59 - description: Corner 1 quotient offset
60 - description: Corner 2 quotient offset
61 - description: Corner 3 quotient offset
65 - description: Corner 1 quotient
66 - description: Corner 2 quotient
67 - description: Corner 3 quotient
/linux-6.12.1/arch/nios2/kernel/
Dinsnemu.S220 * single register to store both the dividend and the quotient,
223 * remainder dividend:quotient
249 * The quotient is 00000110.
266 * OPX is div. Determine and store the sign of the quotient.
269 xor r17, r3, r5 /* MSB contains sign of quotient */
283 * r3 = dividend : quotient
288 * r17 = MSB contains sign of quotient
301 * (remainder:dividend:quotient) <<= 1;
312 * set LSB of quotient
329 * r3 = quotient
[all …]
/linux-6.12.1/arch/alpha/lib/
Ddivide.S39 * $2 - modulus/quotient
45 * $27 - quotient/modulus
66 #define quotient $27 macro
74 #define quotient $2 macro
108 bis $31,$31,quotient
139 2: DIV_ONLY(addq quotient,mask,tmp2)
143 DIV_ONLY(cmovne compare,tmp2,quotient)
Dev6-divide.S39 * $2 - modulus/quotient
45 * $27 - quotient/modulus
76 #define quotient $27 macro
84 #define quotient $2 macro
119 bis $31,$31,quotient # E :
167 DIV_ONLY(addq quotient,mask,tmp2) # E :
176 DIV_ONLY(cmovne compare,tmp2,quotient) # E : Latency 2, extra map slot
/linux-6.12.1/arch/riscv/lib/
Dcrc32.c29 * let "QT" denotes quotient of T/P, with the bit for 2^XLEN being implicit
35 * => lowest 32 bits of: S * (2^32) * quotient / T * P
36 * => lowest 32 bits of: S * quotient / 2^XLEN * P
48 /* Each below polynomial quotient has an implicit bit for 2^XLEN */
50 /* Polynomial quotient of (2^(XLEN+32))/CRC32_POLY, in LE format */
53 /* Polynomial quotient of (2^(XLEN+32))/CRC32C_POLY, in LE format */
56 /* Polynomial quotient of (2^(XLEN+32))/CRC32_POLY, in BE format, it should be
94 /* Each quotient should match the upper half of its analog in RV64 */
/linux-6.12.1/drivers/net/wireless/realtek/rtw89/
Dutil.h47 s32 quotient; in s32_div_u32_round_down() local
49 quotient = dividend / i_divisor; in s32_div_u32_round_down()
53 quotient--; in s32_div_u32_round_down()
59 return quotient; in s32_div_u32_round_down()
/linux-6.12.1/arch/xtensa/lib/
Ddivsi3.S23 movi a2, 0 /* quotient = 0 */
25 /* test-subtract-and-shift loop; one quotient bit on each iteration */
46 movltz a2, a5, a7 /* return (sign < 0) ? -quotient : quotient */
Dudivsi3.S22 movi a2, 0 /* quotient = 0 */
24 /* test-subtract-and-shift loop; one quotient bit on each iteration */
42 addi a2, a2, 1 /* increment quotient if dividend >= divisor */
/linux-6.12.1/arch/powerpc/boot/
Ddiv64.S7 * the 64-bit quotient, and r4 contains the divisor.
23 mullw r0,r7,r4 # quotient.hi = dividend.hi / divisor
40 2: mullw r10,r11,r4 # to get an estimate of the quotient,
44 subfe. r5,r9,r5 # quotient
52 4: stw r7,0(r3) # return the quotient in *r3
/linux-6.12.1/lib/crypto/mpi/
Dmpi-div.c76 /* Ensure space is enough for quotient and remainder. in mpi_tdiv_qr()
94 * numerator and quotient are the same. in mpi_tdiv_qr()
135 * numerator would be gradually overwritten by the quotient limbs. in mpi_tdiv_qr()
143 } else /* Put quotient at top of remainder. */ in mpi_tdiv_qr()
150 * numerator the same number of steps (to keep the quotient the same!). in mpi_tdiv_qr()
178 * temporary space if it overlaps with the quotient or remainder. in mpi_tdiv_qr()
Dmpih-div.c172 * the NSIZE-DSIZE least significant quotient limbs at QP
175 * other quotient limbs.
176 * Return the most significant limb of the quotient, this is always 0 or 1.
183 * possible to put the quotient in the high part of NUM, right after the
371 * Write DIVIDEND_SIZE limbs of quotient at QUOT_PTR.
Dmpi-pow.c82 /* Allocate (BSIZE + 1) with space for remainder and quotient. in mpi_powm()
83 * (The quotient is (bsize - msize + 1) limbs.) */ in mpi_powm()
88 /* We don't care about the quotient, store it above the remainder, in mpi_powm()
/linux-6.12.1/arch/m68k/ifpsp060/src/
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 longword and word remainder:
[all …]
/linux-6.12.1/drivers/media/tuners/
Dmax2165.c150 static int fixpt_div32(u32 dividend, u32 divisor, u32 *quotient, u32 *fraction) in fixpt_div32() argument
171 *quotient = q; in fixpt_div32()
182 u32 quotient, fraction; in max2165_set_rf() local
187 &quotient, &fraction); in max2165_set_rf()
194 max2165_write_reg(priv, REG_NDIV_INT, quotient); in max2165_set_rf()
/linux-6.12.1/drivers/clk/qcom/
Dclk-alpha-pll.c616 u64 quotient; in alpha_pll_round_rate() local
618 quotient = rate; in alpha_pll_round_rate()
619 remainder = do_div(quotient, prate); in alpha_pll_round_rate()
620 *l = quotient; in alpha_pll_round_rate()
628 quotient = remainder << ALPHA_SHIFT(alpha_width); in alpha_pll_round_rate()
630 remainder = do_div(quotient, prate); in alpha_pll_round_rate()
633 quotient++; in alpha_pll_round_rate()
635 *a = quotient; in alpha_pll_round_rate()
857 u64 quotient; in alpha_huayra_pll_round_rate() local
859 quotient = rate; in alpha_huayra_pll_round_rate()
[all …]
/linux-6.12.1/drivers/pmdomain/qcom/
Dcpr.c136 char *quotient; member
375 /* Program the step quotient and idle clocks */ in cpr_corner_restore()
380 /* Clear the target quotient value and gate count of all ROs */ in cpr_corner_restore()
699 * Clear the target quotient value and gate count of all in cpr_config()
896 /* Populate target quotient by scaling */ in cpr_fuse_corner_init()
897 ret = nvmem_cell_read_variable_le_u32(drv->dev, fuses->quotient, &fuse->quot); in cpr_fuse_corner_init()
1125 * Get the quotient adjustment scaling factor, according to: in cpr_corner_init()
1130 * QUOT(corner_N): quotient read from fuse for fuse corner N in cpr_corner_init()
1131 * QUOT(corner_N-1): quotient read from fuse for fuse corner (N - 1) in cpr_corner_init()
1137 * and calculate the quotient adjustment for each one using the in cpr_corner_init()
[all …]
/linux-6.12.1/arch/sparc/kernel/
Dtime_64.c822 unsigned long freq, quotient, tick; in init_tick_ops() local
825 quotient = clocksource_hz2mult(freq, SPARC64_NSEC_PER_CYC_SHIFT); in init_tick_ops()
828 ops->offset = (tick * quotient) >> SPARC64_NSEC_PER_CYC_SHIFT; in init_tick_ops()
829 ops->ticks_per_nsec_quotient = quotient; in init_tick_ops()
883 unsigned long quotient = tick_operations.ticks_per_nsec_quotient; in sched_clock() local
893 return ((get_tick() * quotient) >> SPARC64_NSEC_PER_CYC_SHIFT) - offset; in sched_clock()
/linux-6.12.1/arch/m68k/math-emu/
Dfp_emu.h56 #define fp_set_quotient(quotient) ({ \ argument
58 FPDATA->fpsr |= ((quotient) & 0xff) << 16; \
/linux-6.12.1/arch/powerpc/math-emu/
Dudivmodti4.c81 leading quotient digit q1 = 1). in _fp_udivmodti4()
138 quotient digit q0 = 0 or 1). in _fp_udivmodti4()

123