Home
last modified time | relevance | path

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

/freebsd/crypto/openssl/crypto/bn/
H A Dbn_asm.c213 return BN_MASK2; in bn_div_words()
263 h = ((h << BN_BITS4) | (l >> BN_BITS4)) & BN_MASK2; in bn_div_words()
284 r[0] = (BN_ULONG)ll & BN_MASK2; in bn_add_words()
287 r[1] = (BN_ULONG)ll & BN_MASK2; in bn_add_words()
290 r[2] = (BN_ULONG)ll & BN_MASK2; in bn_add_words()
293 r[3] = (BN_ULONG)ll & BN_MASK2; in bn_add_words()
303 r[0] = (BN_ULONG)ll & BN_MASK2; in bn_add_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()
[all …]
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_local.h94 # define BN_MASK2 (0xffffffffffffffffL) macro
111 # define BN_MASK2 (0xffffffffffffffffLL) macro
130 # define BN_MASK2 (0xffffffffL) macro
477 # define Lw(t) (((BN_ULONG)(t))&BN_MASK2)
478 # define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)
565 # define L2HBITS(a) (((a)<<BN_BITS4)&BN_MASK2)
581 m=(m+m1)&BN_MASK2; ht += L2HBITS((BN_ULONG)(m < m1)); \
584 lt=(lt+m1)&BN_MASK2; ht += (lt < m1); \
601 l=(l+m)&BN_MASK2; h += (l < m); \
615 l=(l+(c))&BN_MASK2; h += (l < (c)); \
[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.c77 temp = ((ap[ai] & mask) + carry) & BN_MASK2; in bn_mod_add_fixed_top()
81 tp[i] = ((bp[bi] & mask) + temp) & BN_MASK2; in bn_mod_add_fixed_top()
167 ta = ((ap[i] & mask) + carry) & BN_MASK2; in bn_mod_sub_fixed_top()
169 rp[i] = (rp[i] + ta) & BN_MASK2; in bn_mod_sub_fixed_top()
174 ta = ((ap[i] & mask) + carry) & BN_MASK2; in bn_mod_sub_fixed_top()
176 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.c107 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
114 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
120 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
126 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
132 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
138 mask = (0 - x) & BN_MASK2; in BN_num_bits_word()
413 return BN_MASK2; in BN_get_word()
770 a->d[w] &= ~(BN_MASK2 << b); in bn_cmp_words()
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_prime.c484 BN_ULONG maxdelta = BN_MASK2 - primes[trial_divisions - 1]; in probable_prime()
544 BN_ULONG maxdelta = BN_MASK2 - primes[trial_divisions - 1]; in probable_prime_dh()
550 if (maxdelta > BN_MASK2 - BN_get_word(add)) in probable_prime_dh()
551 maxdelta = BN_MASK2 - BN_get_word(add); in probable_prime_dh()
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_nist.c816 *(ap++) = ((t << 1) | c) & BN_MASK2; in BN_nist_mod_256()
1075 *(ap++) = ((t << 1) | c) & BN_MASK2; in BN_nist_mod_384()
1154 #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_exp.c405 r->d[0] = (0 - m->d[0]) & BN_MASK2; in BN_mod_exp_mont()
407 r->d[i] = (~m->d[i]) & BN_MASK2; in BN_mod_exp_mont()
497 ret = a->d[wordpos] & BN_MASK2; in bn_get_bits()
505 return ret & BN_MASK2; in bn_get_bits()
765 tmp.d[0] = (0 - m->d[0]) & BN_MASK2; in bn_mod_exp_mont_fixed_top()
767 tmp.d[i] = (~m->d[i]) & BN_MASK2; in bn_mod_exp_mont_fixed_top()
H A Dbn_gf2m.c663 udp[i] = ((u0 >> 1) | (u1 << (BN_BITS2 - 1))) & BN_MASK2; in BN_GF2m_mod_inv_vartime()
666 bdp[i] = ((b0 >> 1) | (b1 << (BN_BITS2 - 1))) & BN_MASK2; in BN_GF2m_mod_inv_vartime()
/freebsd/crypto/openssl/crypto/bn/asm/
H A Dx86_64-gcc.c259 # define BN_MASK2 0xffffffffffffffffL macro
271 r[0] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()
279 r[1] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()
287 r[2] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()
295 r[3] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()
H A Dppc.pl1724 # h = ((h<<BN_BITS4)|(l>>BN_BITS4))&BN_MASK2
/freebsd/crypto/openssl/
H A DCHANGES.md16930 equal (it gave wrong results if `(rem=(n1-q*d0)&BN_MASK2) < d0)`.