Home
last modified time | relevance | path

Searched refs:rem (Results 1 – 8 of 8) sorted by relevance

/lib/mpi/
Dmpi-div.c17 void mpi_tdiv_qr(MPI quot, MPI rem, MPI num, MPI den);
18 void mpi_fdiv_qr(MPI quot, MPI rem, MPI dividend, MPI divisor);
20 void mpi_fdiv_r(MPI rem, MPI dividend, MPI divisor) in mpi_fdiv_r() argument
29 if (rem == divisor) { in mpi_fdiv_r()
34 mpi_tdiv_r(rem, dividend, divisor); in mpi_fdiv_r()
36 if (((divisor_sign?1:0) ^ (dividend->sign?1:0)) && rem->nlimbs) in mpi_fdiv_r()
37 mpi_add(rem, rem, divisor); in mpi_fdiv_r()
50 void mpi_fdiv_qr(MPI quot, MPI rem, MPI dividend, MPI divisor) in mpi_fdiv_qr() argument
55 if (quot == divisor || rem == divisor) { in mpi_fdiv_qr()
60 mpi_tdiv_qr(quot, rem, dividend, divisor); in mpi_fdiv_qr()
[all …]
Dmpi-mod.c25 void mpi_mod(MPI rem, MPI dividend, MPI divisor) in mpi_mod() argument
27 mpi_fdiv_r(rem, dividend, divisor); in mpi_mod()
/lib/math/
Ddiv64.c33 uint64_t rem = *n; in __div64_32() local
36 uint32_t high = rem >> 32; in __div64_32()
43 rem -= (uint64_t) (high*base) << 32; in __div64_32()
46 while ((int64_t)b > 0 && b < rem) { in __div64_32()
52 if (rem >= b) { in __div64_32()
53 rem -= b; in __div64_32()
61 return rem; in __div64_32()
199 u64 res = 0, div, rem; in mul_u64_u64_div_u64() local
219 div = div64_u64_rem(b, c, &rem); in mul_u64_u64_div_u64()
221 b = rem; in mul_u64_u64_div_u64()
/lib/
Drandom32.c85 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()
Dnlattr.c91 int rem; in nla_validate_array() local
93 nla_for_each_attr(entry, head, len, rem) { in nla_validate_array()
579 int rem; in __nla_validate_parse() local
590 nla_for_each_attr(nla, head, len, rem) { in __nla_validate_parse()
614 if (unlikely(rem > 0)) { in __nla_validate_parse()
616 rem, current->comm); in __nla_validate_parse()
716 int rem; in nla_find() local
718 nla_for_each_attr(nla, head, len, rem) in nla_find()
Dbitmap.c107 unsigned off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG; in __bitmap_shift_right() local
116 if (!rem || off + k + 1 >= lim) in __bitmap_shift_right()
122 upper <<= (BITS_PER_LONG - rem); in __bitmap_shift_right()
127 lower >>= rem; in __bitmap_shift_right()
153 unsigned int off = shift/BITS_PER_LONG, rem = shift % BITS_PER_LONG; in __bitmap_shift_left() local
161 if (rem && k > 0) in __bitmap_shift_left()
162 lower = src[k - 1] >> (BITS_PER_LONG - rem); in __bitmap_shift_left()
165 upper = src[k] << rem; in __bitmap_shift_left()
Dbch.c504 int rem, c, r, p, k, param[BCH_MAX_M]; in solve_linear_system() local
511 rem = 0; in solve_linear_system()
521 rem = r+1; in solve_linear_system()
525 if (rem) { in solve_linear_system()
528 for (r = rem; r < m; r++) { in solve_linear_system()
Diov_iter.c562 unsigned long rem; in copy_mc_pipe_to_iter() local
569 rem = copy_mc_to_kernel(p + off, addr + xfer, chunk); in copy_mc_pipe_to_iter()
570 chunk -= rem; in copy_mc_pipe_to_iter()
574 if (rem) { in copy_mc_pipe_to_iter()
575 iov_iter_revert(i, rem); in copy_mc_pipe_to_iter()