Searched refs:rem (Results 1 – 11 of 11) sorted by relevance
| /lib/crypto/mpi/ |
| A D | mpi-div.c | 29 if (rem == divisor) { in mpi_fdiv_r()
41 err = mpi_add(rem, rem, divisor); in mpi_fdiv_r()
81 err = mpi_resize(rem, rsize); in mpi_tdiv_qr()
87 if (num != rem) { in mpi_tdiv_qr()
88 rem->nlimbs = num->nlimbs; in mpi_tdiv_qr()
89 rem->sign = num->sign; in mpi_tdiv_qr()
111 rp = rem->d; in mpi_tdiv_qr()
126 rem->nlimbs = rsize; in mpi_tdiv_qr()
127 rem->sign = sign_remainder; in mpi_tdiv_qr()
218 rem->nlimbs = rsize; in mpi_tdiv_qr()
[all …]
|
| A D | mpi-mod.c | 10 int mpi_mod(MPI rem, MPI dividend, MPI divisor) in mpi_mod() argument
12 return mpi_fdiv_r(rem, dividend, divisor); in mpi_mod()
|
| /lib/crypto/arm64/ |
| A D | sha1.h | 21 size_t rem; in sha1_blocks() local
24 rem = __sha1_ce_transform(state, data, nblocks); in sha1_blocks()
26 data += (nblocks - rem) * SHA1_BLOCK_SIZE; in sha1_blocks()
27 nblocks = rem; in sha1_blocks()
|
| A D | sha512.h | 26 size_t rem; in sha512_blocks() local
29 rem = __sha512_ce_transform(state, data, nblocks); in sha512_blocks()
31 data += (nblocks - rem) * SHA512_BLOCK_SIZE; in sha512_blocks()
32 nblocks = rem; in sha512_blocks()
|
| A D | sha256.h | 28 size_t rem; in sha256_blocks() local
31 rem = __sha256_ce_transform(state, in sha256_blocks()
34 data += (nblocks - rem) * SHA256_BLOCK_SIZE; in sha256_blocks()
35 nblocks = rem; in sha256_blocks()
|
| /lib/math/ |
| A D | div64.c | 34 uint64_t rem = *n; in __div64_32() local
37 uint32_t high = rem >> 32; in __div64_32()
44 rem -= (uint64_t) (high*base) << 32; in __div64_32()
47 while ((int64_t)b > 0 && b < rem) { in __div64_32()
53 if (rem >= b) { in __div64_32()
54 rem -= b; in __div64_32()
62 return rem; in __div64_32()
|
| /lib/ |
| A D | bitmap.c | 96 unsigned off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG; in __bitmap_shift_right() local
105 if (!rem || off + k + 1 >= lim) in __bitmap_shift_right()
111 upper <<= (BITS_PER_LONG - rem); in __bitmap_shift_right()
116 lower >>= rem; in __bitmap_shift_right()
142 unsigned int off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG; in __bitmap_shift_left() local
150 if (rem && k > 0) in __bitmap_shift_left()
151 lower = src[k - 1] >> (BITS_PER_LONG - rem); in __bitmap_shift_left()
154 upper = src[k] << rem; in __bitmap_shift_left()
|
| A D | random32.c | 85 u32 rem = prandom_u32_state(state); in prandom_bytes_state() local
87 *ptr++ = (u8) rem; in prandom_bytes_state()
89 rem >>= BITS_PER_BYTE; in prandom_bytes_state()
|
| A D | nlattr.c | 95 int rem; in nla_validate_array() local
97 nla_for_each_attr(entry, head, len, rem) { in nla_validate_array()
611 int rem; in __nla_validate_parse() local
622 nla_for_each_attr(nla, head, len, rem) { in __nla_validate_parse()
646 if (unlikely(rem > 0)) { in __nla_validate_parse()
648 rem, current->comm); in __nla_validate_parse()
748 int rem; in nla_find() local
750 nla_for_each_attr(nla, head, len, rem) in nla_find()
|
| A D | bch.c | 470 int rem, c, r, p, k, param[BCH_MAX_M]; in solve_linear_system() local
477 rem = 0; in solve_linear_system()
484 rem = r+1; in solve_linear_system()
488 if (rem) { in solve_linear_system()
491 for (r = rem; r < m; r++) { in solve_linear_system()
|
| /lib/zstd/compress/ |
| A D | huf_compress.c | 113 size_t const rem = (size_t)workspace & mask; in HUF_alignUpWorkspace() local
114 size_t const add = (align - rem) & mask; in HUF_alignUpWorkspace()
996 int rem = n % kUnroll; in HUF_compress1X_usingCTable_internal_body_loop() local
997 if (rem > 0) { in HUF_compress1X_usingCTable_internal_body_loop()
998 for (; rem > 0; --rem) { in HUF_compress1X_usingCTable_internal_body_loop()
|
Completed in 24 milliseconds