HomeSort by: relevance | last modified time | path
    Searched defs:rem (Results 1 - 25 of 242) sorted by relevancy

1 2 3 4 5 6 7 8 910

  /src/sys/external/bsd/compiler_rt/dist/test/Unit/
divmodsi4_test.c 19 extern si_int __divmodsi4(si_int a, si_int b, si_int* rem);
25 si_int rem; local
26 si_int result = __divmodsi4(a, b, &rem);
32 if (rem != expected_rem) {
34 a, b, rem, expected_rem);
udivmodsi4_test.c 19 extern su_int __udivmodsi4(su_int a, su_int b, su_int* rem);
24 su_int rem; local
25 su_int result = __udivmodsi4(a, b, &rem);
31 if (rem != expected_rem) {
33 a, b, rem, expected_rem);
  /src/sys/external/bsd/compiler_rt/dist/test/builtins/Unit/
divmodsi4_test.c 19 extern COMPILER_RT_ABI si_int __divmodsi4(si_int a, si_int b, si_int* rem);
25 si_int rem; local
26 si_int result = __divmodsi4(a, b, &rem);
32 if (rem != expected_rem) {
34 a, b, rem, expected_rem);
udivmodsi4_test.c 19 extern COMPILER_RT_ABI su_int __udivmodsi4(su_int a, su_int b, su_int* rem);
24 su_int rem; local
25 su_int result = __udivmodsi4(a, b, &rem);
31 if (rem != expected_rem) {
33 a, b, rem, expected_rem);
  /src/external/lgpl3/gmp/dist/mpz/
cdiv_q.c 39 mpz_t rem; local
44 MPZ_TMP_INIT (rem, ABS (divisor_size));
46 mpz_tdiv_qr (quot, rem, dividend, divisor);
48 if ((divisor_size ^ dividend_size) >= 0 && SIZ (rem) != 0)
fdiv_q.c 39 mpz_t rem; local
44 MPZ_TMP_INIT (rem, ABS (divisor_size));
46 mpz_tdiv_qr (quot, rem, dividend, divisor);
48 if ((divisor_size ^ dividend_size) < 0 && SIZ (rem) != 0)
divexact.c 48 mpz_t rem; local
49 mpz_init (rem);
50 mpz_tdiv_r (rem, num, den);
51 ASSERT (SIZ(rem) == 0);
52 mpz_clear (rem);
  /src/crypto/external/bsd/heimdal/dist/lib/roken/
net_read.c 51 size_t rem = nbytes; local
53 while (rem > 0) {
54 count = read (fd, cbuf, rem);
64 rem -= count;
76 size_t rem = nbytes; local
82 while (rem > 0) {
85 count = _read (sock, cbuf, rem);
87 count = recv (sock, cbuf, rem, 0);
95 count = _read (sock, cbuf, rem);
98 count = recv (sock, cbuf, rem, 0)
    [all...]
net_write.c 53 size_t rem = nbytes; local
55 while (rem > 0) {
56 count = write (fd, cbuf, rem);
65 return nbytes - rem;
71 rem -= count;
83 size_t rem = nbytes; local
88 while (rem > 0) {
91 count = _write (sock, cbuf, rem);
93 count = send (sock, cbuf, rem, 0);
101 count = _write (sock, cbuf, rem);
    [all...]
  /src/include/
inttypes.h 59 intmax_t rem; member in struct:__anon123
  /src/sys/arch/arm/include/
aeabi.h 132 typedef struct { long long quot; long long rem; } lldiv_t; member in struct:__anon1057
135 typedef struct { unsigned long long quot; unsigned long long rem; } ulldiv_t; member in struct:__anon1058
157 typedef struct { int quot, rem; } idiv_return; member in struct:__anon1059
158 typedef struct { unsigned int quot, rem; } uidiv_return; member in struct:__anon1060
  /src/sys/arch/hppa/spmath/
divu.S 55 rem: .reg %r3 /* remainder and upper part of dividend */ label
64 stws,ma rem,4(%sp) ; save registers on stack
71 addi 0,%arg0,rem ; get upper dividend
77 ds rem,dvr,rem ; 1st divide step, if carry
80 ds rem,dvr,rem ; 2nd divide step
82 ds rem,dvr,rem ; 3rd divide step
84 ds rem,dvr,rem ; 4th divide ste
    [all...]
  /src/crypto/external/bsd/heimdal/dist/lib/krb5/
net_write.c 59 size_t rem = len; local
87 count = send (fd, cbuf, rem, 0);
103 count = write (fd, cbuf, rem);
115 rem -= count;
117 } while (rem > 0);
store_fd.c 50 size_t rem = size; local
53 while (rem > 0) {
54 count = read (FD(sp), cbuf, rem);
64 rem -= count;
74 size_t rem = size; local
77 while (rem > 0) {
78 count = write(FD(sp), cbuf, rem);
86 rem -= count;
  /src/crypto/external/bsd/openssl/dist/crypto/sha/
sha3.c 49 size_t num, rem; local
55 rem = bsz - num;
57 if (len < rem) {
64 * buffer. So we append |rem| bytes and process the block,
67 memcpy(ctx->buf + num, inp, rem);
68 inp += rem, len -= rem;
75 rem = SHA3_absorb(ctx->A, inp, len, bsz);
77 rem = len;
79 if (rem) {
    [all...]
  /src/external/bsd/ntp/dist/util/
timetrim.c 51 char *rem; local
92 value = strtod(argv[0], &rem);
93 if (*rem != '\0') {
  /src/external/gpl3/gcc/dist/libquadmath/math/
cbrtq.c 67 int e, rem, sign; local
99 rem = e;
101 rem -= 3 * e;
102 if (rem == 1)
104 else if (rem == 2)
110 rem = e;
112 rem -= 3 * e;
113 if (rem == 1)
115 else if (rem == 2)
  /src/external/gpl3/gcc.old/dist/libquadmath/math/
cbrtq.c 67 int e, rem, sign; local
99 rem = e;
101 rem -= 3 * e;
102 if (rem == 1)
104 else if (rem == 2)
110 rem = e;
112 rem -= 3 * e;
113 if (rem == 1)
115 else if (rem == 2)
  /src/sys/compat/linux/common/
linux_uselib.c 95 size_t rem; local
109 &rem, NULL))) {
113 if (rem != 0) {
  /src/usr.sbin/sysinst/
factor.c 59 long rem; local
70 rem = 1;
72 if ((rem = pc % primes[j]) == 0)
76 if (rem)
  /src/crypto/external/apache2/openssl/dist/crypto/des/
cfb_enc.c 36 register int num = numbits / 8, n = (numbits + 7) / 8, i, rem = numbits % 8; local
88 if (rem == 0)
92 ovec[i] = ovec[i + num] << rem | ovec[i + num + 1] >> (8 - rem);
130 if (rem == 0)
134 ovec[i] = ovec[i + num] << rem | ovec[i + num + 1] >> (8 - rem);
  /src/crypto/external/apache2/openssl/dist/crypto/modes/
cfb128.c 152 int n, rem, num; local
171 rem = nbits % 8;
173 if (rem == 0)
177 ivec[n] = ovec[n + num] << rem | ovec[n + num + 1] >> (8 - rem);
  /src/crypto/external/apache2/openssl/dist/crypto/sha/
sha3.c 56 size_t num, rem; local
66 rem = bsz - num;
68 if (len < rem) {
75 * buffer. So we append |rem| bytes and process the block,
78 memcpy(ctx->buf + num, inp, rem);
79 inp += rem, len -= rem;
86 rem = SHA3_absorb(ctx->A, inp, len, bsz);
88 rem = len;
90 if (rem) {
    [all...]
  /src/crypto/external/apache2/openssl/dist/providers/implementations/ciphers/
cipher_chacha20_hw.c 45 unsigned int n, rem, ctr32; local
66 rem = (unsigned int)(inl % CHACHA_BLK_SIZE);
67 inl -= rem;
102 if (rem > 0) {
106 for (n = 0; n < rem; n++)
108 ctx->partial_len = rem;
  /src/crypto/external/bsd/openssh/dist/
atomicio.c 105 size_t pos = 0, rem; local
139 rem = (size_t)res;
140 pos += rem;
142 while (iovcnt > 0 && rem >= iov[0].iov_len) {
143 rem -= iov[0].iov_len;
148 if (rem > 0 && (iovcnt <= 0 || rem > iov[0].iov_len)) {
155 iov[0].iov_base = ((char *)iov[0].iov_base) + rem;
156 iov[0].iov_len -= rem;

Completed in 52 milliseconds

1 2 3 4 5 6 7 8 910