Home
last modified time | relevance | path

Searched refs:BN_MASK2 (Results 1 – 18 of 18) sorted by relevance

/freebsd-13.1/crypto/openssl/crypto/bn/
H A Dbn_word.c43 w &= BN_MASK2; in BN_mod_word()
67 w &= BN_MASK2; in BN_div_word()
86 ret = (l - ((d * w) & BN_MASK2)) & BN_MASK2; in BN_div_word()
104 w &= BN_MASK2; in BN_add_word()
121 a->d[i] = l = (a->d[i] + w) & BN_MASK2; in BN_add_word()
139 w &= BN_MASK2; in BN_sub_word()
170 a->d[i] = (a->d[i] - w) & BN_MASK2; in BN_sub_word()
186 w &= BN_MASK2; in BN_mul_word()
H A Dbn_asm.c213 return BN_MASK2; in bn_div_words()
326 t = (t + c) & BN_MASK2; in bn_add_words()
328 l = (t + b[0]) & BN_MASK2; in bn_add_words()
332 t = (t + c) & BN_MASK2; in bn_add_words()
334 l = (t + b[1]) & BN_MASK2; in bn_add_words()
338 t = (t + c) & BN_MASK2; in bn_add_words()
340 l = (t + b[2]) & BN_MASK2; in bn_add_words()
344 t = (t + c) & BN_MASK2; in bn_add_words()
346 l = (t + b[3]) & BN_MASK2; in bn_add_words()
357 t = (t + c) & BN_MASK2; in bn_add_words()
[all …]
H A Dbn_local.h67 # define BN_MASK2 (0xffffffffffffffffL) macro
84 # define BN_MASK2 (0xffffffffffffffffLL) macro
103 # define BN_MASK2 (0xffffffffL) macro
482 # define Lw(t) (((BN_ULONG)(t))&BN_MASK2)
606 l=(l+m)&BN_MASK2; if (l < m) h++; \
620 l=(l+(c))&BN_MASK2; if (l < (c)) h++; \
622 l=(l+(c))&BN_MASK2; if (l < (c)) h++; \
623 (c)=h&BN_MASK2; \
636 l+=(c); if ((l&BN_MASK2) < (c)) h++; \
637 (c)=h&BN_MASK2; \
[all …]
H A Dbn_mul.c46 r[0] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
53 r[1] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
60 r[2] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
67 r[3] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()
80 r[0] = (t - c) & BN_MASK2; in bn_sub_part_words()
87 r[1] = (t - c) & BN_MASK2; in bn_sub_part_words()
94 r[2] = (t - c) & BN_MASK2; in bn_sub_part_words()
101 r[3] = (t - c) & BN_MASK2; in bn_sub_part_words()
300 ln = (lo + c1) & BN_MASK2; in bn_mul_recursive()
311 ln = (lo + 1) & BN_MASK2; in bn_mul_recursive()
[all …]
H A Dbn_mod.c68 temp = ((ap[ai] & mask) + carry) & BN_MASK2; in bn_mod_add_fixed_top()
72 tp[i] = ((bp[bi] & mask) + temp) & BN_MASK2; in bn_mod_add_fixed_top()
158 ta = ((ap[i] & mask) + carry) & BN_MASK2; in bn_mod_sub_fixed_top()
160 rp[i] = (rp[i] + ta) & BN_MASK2; in bn_mod_sub_fixed_top()
165 ta = ((ap[i] & mask) + carry) & BN_MASK2; in bn_mod_sub_fixed_top()
167 rp[i] = (rp[i] + ta) & BN_MASK2; in bn_mod_sub_fixed_top()
H A Dbn_shift.c36 *(rp++) = ((t << 1) | c) & BN_MASK2; in BN_lshift1()
72 rp[i] = ((t >> 1) & BN_MASK2) | c; in BN_rshift1()
133 t[i] = (m | ((l >> rb) & rmask)) & BN_MASK2; in bn_lshift_fixed_top()
135 t[0] = (l << lb) & BN_MASK2; in bn_lshift_fixed_top()
H A Dbn_div.c136 return (Q | mask) & BN_MASK2; in bn_div_3_words()
154 d[i] = ((n << lshift) | m) & BN_MASK2; in bn_left_align()
353 q = BN_MASK2; in bn_div_fixed_top()
370 rem = (n1 - q * d0) & BN_MASK2; in bn_div_fixed_top()
388 rem = (n1 - q * d0) & BN_MASK2; in bn_div_fixed_top()
H A Dbn_mont.c126 v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2); in bn_from_montgomery_word()
127 v = (v + carry + rp[nl]) & BN_MASK2; in bn_from_montgomery_word()
329 Ri->d[0] = BN_MASK2; in BN_MONT_CTX_set()
330 Ri->d[1] = BN_MASK2; in BN_MONT_CTX_set()
360 if (!BN_set_word(Ri, BN_MASK2)) in BN_MONT_CTX_set()
H A Dbn_lib.c106 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
113 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
119 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
125 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
131 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
137 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
412 return BN_MASK2; in BN_get_word()
736 a->d[w] &= ~(BN_MASK2 << b); in BN_mask_bits()
H A Dbn_prime.c276 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; in probable_prime()
327 BN_ULONG maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; in probable_prime_dh()
333 if (maxdelta > BN_MASK2 - BN_get_word(add)) in probable_prime_dh()
334 maxdelta = BN_MASK2 - BN_get_word(add); in probable_prime_dh()
H A Dbn_add.c112 t2 = (t1 + carry) & BN_MASK2; in BN_uadd()
157 t2 = (t1 - borrow) & BN_MASK2; in BN_usub()
H A Dbn_sqr.c222 ln = (lo + c1) & BN_MASK2; in bn_sqr_recursive()
233 ln = (lo + 1) & BN_MASK2; in bn_sqr_recursive()
H A Dbn_exp.c388 r->d[0] = (0 - m->d[0]) & BN_MASK2; in BN_mod_exp_mont()
390 r->d[i] = (~m->d[i]) & BN_MASK2; in BN_mod_exp_mont()
481 ret = a->d[wordpos] & BN_MASK2; in bn_get_bits()
489 return ret & BN_MASK2; in bn_get_bits()
748 tmp.d[0] = (0 - m->d[0]) & BN_MASK2; in BN_mod_exp_mont_consttime()
750 tmp.d[i] = (~m->d[i]) & BN_MASK2; in BN_mod_exp_mont_consttime()
H A Dbn_nist.c801 *(ap++) = ((t << 1) | c) & BN_MASK2; in BN_nist_mod_256()
1069 *(ap++) = ((t << 1) | c) & BN_MASK2; in BN_nist_mod_384()
1153 #define BN_NIST_521_TOP_MASK ((BN_ULONG)BN_MASK2>>BN_NIST_521_LSHIFT)
1201 t_d[i] = (tmp | val << BN_NIST_521_LSHIFT) & BN_MASK2; in BN_nist_mod_521()
1204 (tmp = t_d[i + 1]) << BN_NIST_521_LSHIFT) & BN_MASK2; in BN_nist_mod_521()
H A Dbn_gf2m.c653 udp[i] = ((u0 >> 1) | (u1 << (BN_BITS2 - 1))) & BN_MASK2; in BN_GF2m_mod_inv_vartime()
656 bdp[i] = ((b0 >> 1) | (b1 << (BN_BITS2 - 1))) & BN_MASK2; in BN_GF2m_mod_inv_vartime()
/freebsd-13.1/crypto/openssl/crypto/bn/asm/
H A Dx86_64-gcc.c260 # define BN_MASK2 0xffffffffffffffffL macro
272 r[0] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()
280 r[1] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()
288 r[2] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()
296 r[3] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()
H A Dppc.pl1720 # h = ((h<<BN_BITS4)|(l>>BN_BITS4))&BN_MASK2
/freebsd-13.1/crypto/openssl/
H A DCHANGES11170 equal (it gave wrong results if (rem=(n1-q*d0)&BN_MASK2) < d0).