HomeSort by: relevance | last modified time | path
    Searched refs:remainder (Results 1 - 25 of 52) sorted by relevancy

1 2 3

  /src/lib/libm/src/
w_drem.c 2 * drem() wrapper for remainder().
18 return remainder(x, y);
w_remainder.c 19 * wrapper remainder(x,p)
26 remainder(double x, double y) /* wrapper remainder */ function in typeref:typename:double
35 return __kernel_standard(x,y,28); /* remainder(x,0) */
  /src/sys/external/bsd/drm2/dist/drm/amd/display/dc/dml/
dml_inline_defs.h 119 unsigned int remainder; local in function:dml_round_to_multiple
124 remainder = num % multiple;
126 if (remainder == 0)
130 return (num + multiple - remainder);
132 return (num - remainder);
  /src/sys/external/bsd/drm2/dist/drm/amd/display/dc/calcs/
amdgpu_bw_fixed.c 69 uint64_t remainder; local in function:bw_frc_to_fixed
78 res_value = div64_u64_rem(arg1_value, arg2_value, &remainder);
88 remainder <<= 1;
92 if (remainder >= arg2_value)
95 remainder -= arg2_value;
102 uint64_t summand = (remainder << 1) >= arg2_value;
  /src/sys/external/bsd/compiler_rt/dist/lib/builtins/arm/
divmodsi4.S 29 @ int __divmodsi4(int divident, int divisor, int *remainder)
30 @ Calculate the quotient and remainder of the (signed) division. The return
31 @ value is the quotient, the remainder is placed in the variable.
udivmodsi4.S 25 @ unsigned int *remainder)
26 @ Calculate the quotient and remainder of the (unsigned) division. The return
27 @ value is the quotient, the remainder is placed in the variable.
modsi3.S 29 @ Calculate and return the remainder of the (signed) division.
umodsi3.S 24 @ Calculate and return the remainder of the (unsigned) division.
  /src/lib/libc/arch/x86_64/string/
swab.S 31 L2: shrq $3,%rdx # copy remainder 8 words at a time
  /src/sys/external/bsd/drm2/dist/drm/amd/display/dc/basics/
amdgpu_fixpt31_32.c 46 * *remainder = dividend % divisor
51 unsigned long long *remainder)
59 *remainder = r64;
84 unsigned long long remainder; local in function:dc_fixpt_from_fraction
89 arg1_value, arg2_value, &remainder);
98 remainder <<= 1;
102 if (remainder >= arg2_value) {
104 remainder -= arg2_value;
111 unsigned long long summand = (remainder << 1) >= arg2_value;
  /src/sys/dev/pci/
if_enavar.h 554 int remainder, space; local in function:ena_m_append
560 remainder = len;
566 if (space > remainder)
567 space = remainder;
570 cp = cp + space, remainder -= space;
572 while (remainder > 0) {
580 n->m_len = uimin(MLEN, remainder);
582 cp += n->m_len, remainder -= n->m_len;
587 m0->m_pkthdr.len += len - remainder;
588 return (remainder == 0)
    [all...]
  /src/sys/arch/hppa/stand/common/
milli_tiny.S 75 ; $$remU unsigned division, return remainder
82 ; %r29 remainder
94 addl %r1,%r25,%r1 ; fix remainder
97 copy %r1,%r29 ; the return value is remainder
100 copy %r26,%r29 ; the remainder is dividend
  /src/lib/libc/arch/i386/string/
swab.S 36 L2: shrl $3,%ecx # copy remainder 8 words at a time
  /src/sys/arch/arm/samsung/
exynos_wdt.c 237 * the highest divisor which gives us the least remainder.
243 u_int remainder = sc->sc_freq % div; local in function:exynos_wdt_attach
244 if (remainder == 0) {
248 if (remainder < best_remainder) {
250 best_remainder = remainder;
  /src/sys/lib/libkern/arch/m68k/
udivsi3.S 77 movew %d2, %d1 | concat(remainder, low(dividend))
98 | correct, and the subtraction result is our remainder.
101 | divisor is our remainder.
126 addl %a1, %d1 | adjust remainder
  /src/sys/kern/
subr_time_arith.c 483 int64_t last_val, next_val, interval, remainder, now_ns; local in function:itimer_transition
547 * remainder last_val remainder
554 * always gives zero or a positive remainder, and dividing a
556 * negative remainder. Hence:
559 * the clock was wound backwards -- then remainder is zero or
567 * i.e., the clock ran fast -- then remainder is zero or
579 remainder = (now_ns - last_val) % interval;
580 next_val = now_ns - remainder;
590 if (remainder == 0)
    [all...]
  /src/bin/cp/
utils.c 203 size_t remainder; local in function:copy_file
215 remainder = fsize;
219 chunk = (remainder > MMAP_MAX_WRITE) ?
220 MMAP_MAX_WRITE : remainder;
221 if (write(to_fd, &p[fsize - remainder],
227 remainder -= chunk;
231 } while (remainder > 0);
  /src/sys/net80211/
ieee80211_netbsd.c 737 int remainder, space; local in function:m_append
743 remainder = len;
749 if (space > remainder)
750 space = remainder;
753 cp = cp + space, remainder -= space;
755 while (remainder > 0) {
763 n->m_len = uimin(MLEN, remainder);
765 cp += n->m_len, remainder -= n->m_len;
770 m0->m_pkthdr.len += len - remainder;
771 return (remainder == 0)
    [all...]
  /src/sys/dev/i2c/
sensirion_voc_algorithm.c 135 uint32_t remainder = (uint32_t)((a >= 0) ? a : (-a)); local in function:fix16_div
142 while (divider < remainder) {
155 if (remainder >= divider) {
157 remainder -= divider;
164 while (bit && remainder) {
165 if (remainder >= divider) {
167 remainder -= divider;
170 remainder <<= 1;
175 if (remainder >= divider) {
224 // The remainder 'num' is too large to be shifted lef
    [all...]
  /src/sys/external/isc/libsodium/dist/src/libsodium/sodium/
codecs.c 188 size_t remainder; local in function:sodium_bin2base64
193 remainder = bin_len - 3 * nibbles;
195 if (remainder != 0) {
199 b64_len += 2 + (remainder >> 1);
  /src/sys/dev/usb/
uatp.c 813 scale_motion(const struct uatp_softc *sc, int delta, int *remainder,
824 delta, *remainder, (delta + (*remainder))));
828 delta, *remainder,
830 (((delta + (*remainder)) * ((int) (*multiplier)))
832 (((delta + (*remainder)) * ((int) (*multiplier)))
836 delta += *remainder;
837 *remainder = 0;
845 *remainder = (product % ((int) (*divisor)));
850 uatp_scale_motion(const struct uatp_softc *sc, int delta, int *remainder)
    [all...]
  /src/lib/libc/arch/mips/string/
bcmp.S 79 b small # finish remainder
  /src/tests/lib/lua/libm/
h_lualibm.c 76 TEST(remainder(M_PI, M_E));
lualibm.lua 79 test("remainder(M_PI, M_E)", lm.remainder(lm.M_PI, lm.M_E))
  /src/sys/arch/m68k/060sp/dist/
ilsp.s 87 # 0x10(sp) = pointer to location to place quotient/remainder #
90 # 0x10(sp) = points to location of remainder/quotient. #
91 # remainder is in first longword, quotient is in 2nd. #
209 tst.b NDIVIDEND(%a6) # remainder has same sign
288 # The quotient is returned in %d6, remainder in %d5, unless the #
305 # longword of the dividend as (0) remainder (see Knuth) and merely complete
306 # the last two divisions to get a quotient longword and word remainder:
324 swap %d5 # now remainder
365 andi.l &0x0000ffff, %d1 # zero any remainder
439 # add 2nd word to quotient, get the remainder
    [all...]

Completed in 22 milliseconds

1 2 3