/barrelfish-2018-10-04/lib/msun/src/ |
H A D | w_drem.c | 2 * drem() wrapper for remainder(). 14 return remainder(x, y);
|
H A D | e_remainder.c | 78 __weak_reference(remainder, remainderl);
|
H A D | math.h | 284 double remainder(double, double);
|
H A D | math_private.h | 708 #define __ieee754_remainder remainder
|
/barrelfish-2018-10-04/lib/msun/i387/ |
H A D | e_remainder.S | 39 ENTRY(remainder) 48 END(remainder)
|
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/include/linux/ |
H A D | math64.h | 45 * div_u64_rem - unsigned 64bit divide with 32bit divisor with remainder 50 static inline u64 div_u64_rem(u64 dividend, u32 divisor, u32 *remainder) argument 52 *remainder = dividend % divisor; 105 static inline u64 div_u64_rem(u64 dividend, u32 divisor, u32 *remainder) argument 107 *remainder = do_div(dividend, divisor); 128 u32 remainder; local 129 return div_u64_rem(dividend, divisor, &remainder);
|
/barrelfish-2018-10-04/lib/msun/amd64/ |
H A D | e_remainder.S | 41 ENTRY(remainder)
|
/barrelfish-2018-10-04/lib/compiler-rt/builtins/arm/ |
H A D | divmodsi4.S | 27 @ int __divmodsi4(int divident, int divisor, int *remainder) 28 @ Calculate the quotient and remainder of the (signed) division. The return 29 @ value is the quotient, the remainder is placed in the variable.
|
H A D | udivmodsi4.S | 21 @ unsigned int *remainder) 22 @ Calculate the quotient and remainder of the (unsigned) division. The return 23 @ value is the quotient, the remainder is placed in the variable.
|
H A D | modsi3.S | 27 @ Calculate and return the remainder of the (signed) division.
|
H A D | umodsi3.S | 21 @ Calculate and return the remainder of the (unsigned) division.
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/engines/ccgost/ |
H A D | gosthash.h | 28 byte remainder[32]; member in struct:gost_hash_ctx
|
H A D | gosthash.c | 193 memcpy(&(ctx->remainder[ctx->left]),block,add_bytes); 200 hash_step(ctx->cipher_ctx,ctx->H,ctx->remainder); 201 add_blocks(32,ctx->S,ctx->remainder); 216 memcpy(ctx->remainder,curptr,ctx->left); 238 memcpy(buf,ctx->remainder,ctx->left);
|
/barrelfish-2018-10-04/lib/msun/ |
H A D | Makefile | 142 nextafter.3 remainder.3 rint.3 \ 210 MLINKS+=remainder.3 remainderf.3 remainder.3 remainderl.3 \ 211 remainder.3 remquo.3 remainder.3 remquof.3 remainder.3 remquol.3
|
/barrelfish-2018-10-04/usr/tests/msun/ |
H A D | rem_test.c | 28 * Test for remainder functions: remainder, remainderf, remainderl, 117 assert(isnan(remainder(x, y))); 172 rem = remainder(x, y);
|
/barrelfish-2018-10-04/usr/eclipseclp/Pds/src/ |
H A D | msgdd.c | 565 unsigned int remainder; 566 remainder = array_count % 4; 567 if (remainder) 568 *size = 4 + array_count + (4 - remainder); 564 unsigned int remainder; local
|
H A D | pds.mdt.c | 774 unsigned int remainder; 775 remainder = array_count % 4; 776 if (remainder) 777 *size = 4 + array_count + (4 - remainder); 773 unsigned int remainder; local
|
/barrelfish-2018-10-04/include/ |
H A D | math.h | 284 double remainder(double, double);
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umsarith.tex | 269 E1 rem E2 & integer remainder & integer $\times$ integer & integer \\ 332 Each division function is paired with a corresponding remainder function: 333 (\notation{rem} computes the remainder corresponding to \notation{//}, and 335 computes the remainder corresponding to \notation{div}\ 338 remainder corresponding to \notation{//}, i.e., behaved like \notation{rem}}. 339 The remainder results differ only in the case where the two arguments
|
H A D | umsprofile.tex | 91 remainder /3 eclipse 1.5% 0.16s 135 remainder /3 eclipse 0.9% 0.10s
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/MacOS/GetHTTPS.src/ |
H A D | CPStringUtils.cpp | 755 unsigned long tempNum,quotient,remainder; local 791 remainder = tempNum - (quotient * 10); 793 tempString[srcCharIndex] = '0' + remainder;
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ |
H A D | ic_probe_support.pl | 71 OutList - The remainder of the list after removing the value
|
H A D | probe_support.pl | 70 OutList - The remainder of the list after removing the value
|
/barrelfish-2018-10-04/lib/tommath/ |
H A D | tommath.tex | 530 After a foundation is formed the remainder of the library can be designed and implemented in a hierarchical fashion. 809 After the memory has been successfully initialized the remainder of the members are initialized 995 returns succesfully then it is correct to assume that the mp\_int structure is in a valid state for the remainder of the 2311 First the algorithm will multiply $a$ by $x^{\lfloor b / lg(\beta) \rfloor}$ which will ensure that the remainder multiplicand is less than 2376 This algorithm will divide an input $a$ by $2^b$ and produce the quotient and remainder. The algorithm is designed much like algorithm 2377 mp\_mul\_2d by first using whole digit shifts then single precision shifts. This algorithm will also produce the remainder of the division 2387 The implementation of algorithm mp\_div\_2d is slightly different than the algorithm specifies. The remainder $d$ may be optionally 2389 result of the remainder operation until the end. This allows $d$ and $a$ to represent the same mp\_int without modifying $a$ before 2392 The remainder of the source code is essentially the same as the source code for mp\_mul\_2d. The only significant difference is 2397 The last algorithm in the series of polynomial basis power of two algorithms is calculating the remainder o [all...] |
H A D | bn.tex | 1059 Which will divide $a$ by $2^b$, store the quotient in ``c'' and the remainder in ``d'. If $b \le 0$ then the 1061 value to signal that the remainder is not desired. 1085 This will divide $a$ in place by $x^b$ and discard the remainder. This function cannot fail as it performs the operations 1138 To perform a complete and general integer division with remainder use the following function. 1276 Modular reduction is process of taking the remainder of one quantity divided by another. Expressed 1277 as (\ref{eqn:mod}) the modular reduction is equivalent to the remainder of $b$ divided by $c$.
|