Searched refs:BN_MASK2 (Results 1 – 18 of 18) sorted by relevance
43 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()
213 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 …]
74 # define BN_MASK2 (0xffffffffffffffffL) macro91 # define BN_MASK2 (0xffffffffffffffffLL) macro110 # define BN_MASK2 (0xffffffffL) macro489 # define Lw(t) (((BN_ULONG)(t))&BN_MASK2)490 # define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)577 # define L2HBITS(a) (((a)<<BN_BITS4)&BN_MASK2)593 m=(m+m1)&BN_MASK2; if (m < m1) ht+=L2HBITS((BN_ULONG)1); \596 lt=(lt+m1)&BN_MASK2; if (lt < m1) ht++; \613 l=(l+m)&BN_MASK2; if (l < m) h++; \627 l=(l+(c))&BN_MASK2; if (l < (c)) h++; \[all …]
46 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 …]
72 temp = ((ap[ai] & mask) + carry) & BN_MASK2; in bn_mod_add_fixed_top()76 tp[i] = ((bp[bi] & mask) + temp) & BN_MASK2; in bn_mod_add_fixed_top()162 ta = ((ap[i] & mask) + carry) & BN_MASK2; in bn_mod_sub_fixed_top()164 rp[i] = (rp[i] + ta) & BN_MASK2; in bn_mod_sub_fixed_top()169 ta = ((ap[i] & mask) + carry) & BN_MASK2; in bn_mod_sub_fixed_top()171 rp[i] = (rp[i] + ta) & BN_MASK2; in bn_mod_sub_fixed_top()
36 *(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()
136 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()
107 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()756 a->d[w] &= ~(BN_MASK2 << b); in BN_mask_bits()
126 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()
484 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()
112 t2 = (t1 + carry) & BN_MASK2; in BN_uadd()157 t2 = (t1 - borrow) & BN_MASK2; in BN_usub()
222 ln = (lo + c1) & BN_MASK2; in bn_sqr_recursive()233 ln = (lo + 1) & BN_MASK2; in bn_sqr_recursive()
812 *(ap++) = ((t << 1) | c) & BN_MASK2; in BN_nist_mod_256()1080 *(ap++) = ((t << 1) | c) & BN_MASK2; in BN_nist_mod_384()1164 #define BN_NIST_521_TOP_MASK ((BN_ULONG)BN_MASK2>>BN_NIST_521_LSHIFT)1212 t_d[i] = (tmp | val << BN_NIST_521_LSHIFT) & BN_MASK2; in BN_nist_mod_521()1215 (tmp = t_d[i + 1]) << BN_NIST_521_LSHIFT) & BN_MASK2; in BN_nist_mod_521()
386 r->d[0] = (0 - m->d[0]) & BN_MASK2; in BN_mod_exp_mont()388 r->d[i] = (~m->d[i]) & BN_MASK2; in BN_mod_exp_mont()478 ret = a->d[wordpos] & BN_MASK2; in bn_get_bits()486 return ret & BN_MASK2; in bn_get_bits()745 tmp.d[0] = (0 - m->d[0]) & BN_MASK2; in BN_mod_exp_mont_consttime()747 tmp.d[i] = (~m->d[i]) & BN_MASK2; in BN_mod_exp_mont_consttime()
662 udp[i] = ((u0 >> 1) | (u1 << (BN_BITS2 - 1))) & BN_MASK2; in BN_GF2m_mod_inv_vartime()665 bdp[i] = ((b0 >> 1) | (b1 << (BN_BITS2 - 1))) & BN_MASK2; in BN_GF2m_mod_inv_vartime()
259 # define BN_MASK2 0xffffffffffffffffL macro271 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()
1724 # h = ((h<<BN_BITS4)|(l>>BN_BITS4))&BN_MASK2
16530 equal (it gave wrong results if `(rem=(n1-q*d0)&BN_MASK2) < d0)`.