Home
last modified time | relevance | path

Searched full:remainder (Results 1 – 25 of 1006) sorted by relevance

12345678910>>...41

/freebsd/crypto/openssl/test/recipes/10-test_bn_data/
H A Dbnmul.txt926 Remainder = -1
931 Remainder = 0
936 Remainder = 1
941 Remainder = -2
946 Remainder = -3
951 Remainder = 4
956 Remainder = 5
961 Remainder = -6
966 Remainder = -7
971 Remainder = 8
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/
H A Dmodsi3.S5 * Division/Remainder
20 * R -- the remainder so far -- initially == the dividend
41 * %o3 -- current remainder
166 ! remainder is nonnegative
171 ! remainder is nonnegative
176 ! remainder is nonnegative
181 ! remainder is nonnegative
186 ! remainder is negative
191 ! remainder is negative
196 ! remainder is nonnegative
[all …]
H A Ddivsi3.S5 * Division/Remainder
20 * R -- the remainder so far -- initially == the dividend
41 * %o3 -- current remainder
166 ! remainder is nonnegative
171 ! remainder is nonnegative
176 ! remainder is nonnegative
181 ! remainder is nonnegative
186 ! remainder is negative
191 ! remainder is negative
196 ! remainder is nonnegative
[all …]
H A Ddivmod.m46 * Division/Remainder
21 * R -- the remainder so far -- initially == the dividend
52 * R -- current remainder
66 ! remainder is nonnegative
74 ! remainder is negative
229 ! non-restoring fixup if remainder < 0, otherwise annulled
247 ',` mov %o3,%o0 ! remainder <- R
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolutionDivision.cpp53 // Computes the Quotient and Remainder of the division of Numerator by
57 const SCEV **Remainder) { in divide() argument
66 *Remainder = D.Zero; in divide()
72 *Remainder = D.Zero; in divide()
79 *Remainder = D.Zero; in divide()
95 *Remainder = Numerator; in divide()
99 *Remainder = D.Zero; in divide()
105 *Remainder = D.Remainder; in divide()
124 Remainder = SE.getConstant(RemainderVal); in visitConstant()
146 Remainder = SE.getAddRecExpr(StartR, StepR, Numerator->getLoop(), in visitAddRecExpr()
[all …]
/freebsd/sys/compat/linuxkpi/common/src/
H A Dlinux_schedule.c209 int remainder; in linux_wait_woken() local
214 remainder = jiffies + timeout; in linux_wait_woken()
234 remainder -= jiffies; in linux_wait_woken()
237 if (ret == -ERESTARTSYS && remainder < 1) in linux_wait_woken()
238 remainder = 1; in linux_wait_woken()
239 else if (remainder < 0) in linux_wait_woken()
240 remainder = 0; in linux_wait_woken()
241 else if (remainder > timeout) in linux_wait_woken()
242 remainder = timeout; in linux_wait_woken()
243 return (remainder); in linux_wait_woken()
[all …]
/freebsd/lib/msun/man/
H A Dremainder.332 .Nm remainder ,
44 .Fn remainder "double x" "double y"
56 .Fn remainder ,
63 return the remainder
87 the remainder is computed exactly and
95 But attempting to take the remainder when
124 .Fn remainder ,
133 The remainder is as defined in
137 .Fn remainder
/freebsd/lib/libutil/
H A Dhumanize_number.c52 int i, r, remainder, s1, s2, sign; in humanize_number() local
73 remainder = 0; in humanize_number()
145 (remainder >= divisordeccut || remainder >= in humanize_number()
147 remainder = quotient % divisor; in humanize_number()
155 remainder = quotient % divisor; in humanize_number()
165 if (((quotient == 9 && remainder < divisordeccut) || quotient < 9) && in humanize_number()
167 s1 = (int)quotient + ((remainder * 10 + divisor / 2) / in humanize_number()
169 s2 = ((remainder * 10 + divisor / 2) / divisor) % 10; in humanize_number()
175 sign * (quotient + (remainder + divisor / 2) / divisor), in humanize_number()
/freebsd/sys/contrib/openzfs/module/icp/algs/modes/
H A Dccm.c48 size_t remainder = length; in ccm_mode_encrypt_contiguous_blocks() local
80 if (need > remainder) in ccm_mode_encrypt_contiguous_blocks()
153 remainder = (size_t)&data[length] - (size_t)datap; in ccm_mode_encrypt_contiguous_blocks()
156 if (remainder > 0 && remainder < block_size) { in ccm_mode_encrypt_contiguous_blocks()
157 memcpy(ctx->ccm_remainder, datap, remainder); in ccm_mode_encrypt_contiguous_blocks()
158 ctx->ccm_remainder_len = remainder; in ccm_mode_encrypt_contiguous_blocks()
164 } while (remainder > 0); in ccm_mode_encrypt_contiguous_blocks()
229 /* copy remainder to temporary buffer */ in ccm_encrypt_final()
351 size_t remainder = length; in ccm_mode_decrypt_contiguous_blocks() local
440 if (need > remainder) in ccm_mode_decrypt_contiguous_blocks()
[all …]
H A Dgcm.c100 size_t remainder = length; in gcm_mode_encrypt_contiguous_blocks() local
133 if (need > remainder) in gcm_mode_encrypt_contiguous_blocks()
189 remainder = (size_t)&data[length] - (size_t)datap; in gcm_mode_encrypt_contiguous_blocks()
192 if (remainder > 0 && remainder < block_size) { in gcm_mode_encrypt_contiguous_blocks()
193 memcpy(ctx->gcm_remainder, datap, remainder); in gcm_mode_encrypt_contiguous_blocks()
194 ctx->gcm_remainder_len = remainder; in gcm_mode_encrypt_contiguous_blocks()
200 } while (remainder > 0); in gcm_mode_encrypt_contiguous_blocks()
385 size_t remainder; in gcm_decrypt_final() local
399 remainder = pt_len; in gcm_decrypt_final()
400 while (remainder > 0) { in gcm_decrypt_final()
[all …]
/freebsd/sys/contrib/dev/acpica/components/utilities/
H A Dutmath.c434 * OutRemainder - Pointer to where the remainder is returned
440 * 32-bit remainder.
470 * The quotient is 64 bits, the remainder is always 32 bits, in AcpiUtShortDivide()
501 * OutRemainder - Pointer to where the remainder is returned
519 UINT64_OVERLAY Remainder; in AcpiUtDivide() local
546 Remainder.Part.Hi = 0; in AcpiUtDivide()
549 * The quotient is 64 bits, the remainder is always 32 bits, in AcpiUtDivide()
556 Quotient.Part.Lo, Remainder.Part.Lo); in AcpiUtDivide()
588 * adjustment. The 64-bit remainder must be generated. in AcpiUtDivide()
594 Remainder.Part.Hi = Partial3.Part.Lo; in AcpiUtDivide()
[all …]
/freebsd/sys/libkern/arm/
H A Dldivmod.S45 sub sp, sp, #8 /* Space for the remainder */
49 add sp, sp, #8 /* Move sp to the remainder value */
50 ldmfd sp!, {r2, r3} /* Load the remainder */
55 sub sp, sp, #8 /* Space for the remainder */
59 add sp, sp, #8 /* Move sp to the remainder value */
60 ldmfd sp!, {r2, r3} /* Load the remainder */
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/hexagon/
H A Dudivdi3.S28 r3:2 = r1:0 // dividend is the initial remainder, r3:2 contains remainder
50 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
53 r7:6 = sub(r3:2, r13:12) // subtract shifted divisor from current remainder
58 r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
H A Dudivmoddi4.S28 r3:2 = r1:0 // dividend is the initial remainder, r3:2 contains remainder
50 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
53 r7:6 = sub(r3:2, r13:12) // subtract shifted divisor from current remainder
58 r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
H A Dumoddi3.S28 r3:2 = r1:0 // dividend is the initial remainder, r3:2 contains remainder
50 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
53 r7:6 = sub(r3:2, r13:12) // subtract shifted divisor from current remainder
58 r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
H A Ddivdi3.S35 r3:2 = r1:0 // dividend is the initial remainder, r3:2 contains remainder
58 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
61 r7:6 = sub(r3:2, r13:12) // subtract shifted divisor from current remainder
66 r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
H A Dmoddi3.S34 r3:2 = r1:0 // dividend is the initial remainder, r3:2 contains remainder
56 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
59 r7:6 = sub(r3:2, r13:12) // subtract shifted divisor from current remainder
64 r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
/freebsd/contrib/llvm-project/libcxx/include/__math/
H A Dremainder.h27 // remainder
29 inline _LIBCPP_HIDE_FROM_ABI float remainder(float __x, float __y) _NOEXCEPT { return __builtin_rem… in remainder() function
32 _LIBCPP_HIDE_FROM_ABI double remainder(double __x, double __y) _NOEXCEPT { in remainder() function
36 inline _LIBCPP_HIDE_FROM_ABI long double remainder(long double __x, long double __y) _NOEXCEPT { in remainder() function
41 inline _LIBCPP_HIDE_FROM_ABI typename __promote<_A1, _A2>::type remainder(_A1 __x, _A2 __y) _NOEXCE… in remainder() function
44 return __math::remainder((__result_type)__x, (__result_type)__y); in remainder()
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/
H A Dudivmodti4.c18 // Remainder stored in r.
31 du_int rhat; // A remainder in udiv128by64to64default()
107 utwords remainder; in __udivmodti4() local
115 remainder.s.high = 0; in __udivmodti4()
119 divisor.s.low, &remainder.s.low); in __udivmodti4()
122 // First, divide with the high part to get the remainder in dividend.s.high. in __udivmodti4()
127 divisor.s.low, &remainder.s.low); in __udivmodti4()
130 *rem = remainder.all; in __udivmodti4()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBypassSlowDivision.cpp46 Value *Remainder; member
49 : Quotient(InQuotient), Remainder(InRemainder) {} in QuotRemPair()
52 /// A quotient and remainder, plus a BB from which they logically "originate".
53 /// If you use Quotient or Remainder in a Phi node, you should use BB as its
58 Value *Remainder = nullptr; member
145 /// Reuses previously-computed dividend or remainder from the current BB if
147 /// perform the optimization and caches the resulting dividend and remainder.
170 return isDivisionOp() ? Value.Quotient : Value.Remainder; in getReplacement()
271 DivRemPair.Remainder = Builder.CreateSRem(Dividend, Divisor); in createSlowBB()
274 DivRemPair.Remainder = Builder.CreateURem(Dividend, Divisor); in createSlowBB()
[all …]
H A DIntegerDivision.cpp26 /// Generate code to compute the remainder of two signed integers. Returns the
27 /// remainder, which will have the sign of the dividend. Builder's insert point
68 /// Generate code to compute the remainder of two unsigned integers. Returns the
69 /// remainder. Builder's insert point should be pointing where the caller wants
75 // Remainder = Dividend - Quotient*Divisor in generatedUnsignedRemainderCode()
81 // ; %remainder = sub i32 %dividend, %product in generatedUnsignedRemainderCode()
86 Value *Remainder = Builder.CreateSub(Dividend, Product); in generatedUnsignedRemainderCode() local
91 return Remainder; in generatedUnsignedRemainderCode()
348 /// Generate code to calculate the remainder of two integers, replacing Rem with
357 "Trying to expand remainder from a non-remainder function"); in expandRemainder()
[all …]
/freebsd/stand/efi/boot1/
H A Dzfs_module.c57 size_t size, remainder, rb_size, blksz; in vdev_read() local
63 remainder = off % devinfo->dev->Media->BlockSize; in vdev_read()
69 * If we have remainder from off, we need to add remainder part. in vdev_read()
72 size = roundup2(bytes + remainder, devinfo->dev->Media->BlockSize); in vdev_read()
74 if (remainder != 0 || size != bytes) { in vdev_read()
82 blksz = rb_size - remainder; in vdev_read()
93 memcpy(buf, rb_buf + remainder, blksz); in vdev_read()
97 remainder = 0; in vdev_read()
/freebsd/sys/dev/usb/controller/
H A Dmusb_otg.c465 if (count != td->remainder) { in musbotg_dev_ctrl_setup_rx()
494 td->remainder = 0; in musbotg_dev_ctrl_setup_rx()
596 if (td->remainder == 0) { in musbotg_host_ctrl_setup_tx()
609 /* update offset and remainder */ in musbotg_host_ctrl_setup_tx()
611 td->remainder -= sizeof(req); in musbotg_host_ctrl_setup_tx()
661 if (td->remainder == 0) { in musbotg_dev_ctrl_data_rx()
694 if (count > td->remainder) { in musbotg_dev_ctrl_data_rx()
728 /* update offset and remainder */ in musbotg_dev_ctrl_data_rx()
730 td->remainder -= count; in musbotg_dev_ctrl_data_rx()
745 td->remainder -= temp; in musbotg_dev_ctrl_data_rx()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DAPInt.cpp1061 // Fill in the remainder based on the original sign. in ashrSlowCase()
1364 // D5. [Test remainder.] Set q[j] = qp. If the result of step D4 was in KnuthDiv()
1395 // remainder may be obtained by dividing u[...] by d. If r is non-null we in KnuthDiv()
1396 // compute the remainder (urem uses this). in KnuthDiv()
1403 DEBUG_KNUTH(dbgs() << "KnuthDiv: remainder:"); in KnuthDiv()
1421 unsigned rhsWords, WordType *Quotient, WordType *Remainder) { in divide() argument
1441 if ((Remainder?4:3)*n+2*m+1 <= 128) { in divide()
1445 if (Remainder) in divide()
1451 if (Remainder) in divide()
1472 // initialize the quotient and remainder in divide()
[all …]
/freebsd/usr.sbin/bhyve/
H A Diov.c43 size_t remainder = 0; in seek_iov() local
55 remainder = toseek; in seek_iov()
61 iov2[j - i].iov_base = (char *)iov1[j].iov_base + remainder; in seek_iov()
62 iov2[j - i].iov_len = iov1[j].iov_len - remainder; in seek_iov()
63 remainder = 0; in seek_iov()

12345678910>>...41