Searched refs:BN_MASK2 (Results 1 – 19 of 19) sorted by relevance
76 w &= BN_MASK2; in BN_mod_word()95 w &= BN_MASK2; in BN_div_word()114 ret = (l - ((d * w) & BN_MASK2)) & BN_MASK2; in BN_div_word()130 w &= BN_MASK2; in BN_add_word()147 a->d[i] = l = (a->d[i] + w) & BN_MASK2; in BN_add_word()165 w &= BN_MASK2; in BN_sub_word()196 a->d[i] = (a->d[i] - w) & BN_MASK2; in BN_sub_word()212 w &= BN_MASK2; in BN_mul_word()
267 return (BN_MASK2); in bn_div_words()317 h = ((h << BN_BITS4) | (l >> BN_BITS4)) & BN_MASK2; in bn_div_words()338 r[0] = (BN_ULONG)ll & BN_MASK2; in bn_add_words()341 r[1] = (BN_ULONG)ll & BN_MASK2; in bn_add_words()344 r[2] = (BN_ULONG)ll & BN_MASK2; in bn_add_words()347 r[3] = (BN_ULONG)ll & BN_MASK2; in bn_add_words()357 r[0] = (BN_ULONG)ll & BN_MASK2; in bn_add_words()380 t = (t + c) & BN_MASK2; in bn_add_words()382 l = (t + b[0]) & BN_MASK2; in bn_add_words()386 t = (t + c) & BN_MASK2; in bn_add_words()[all …]
85 *(rp++) = ((t << 1) | c) & BN_MASK2; in BN_lshift1()123 rp[i] = ((t >> 1) & BN_MASK2) | c; in BN_rshift1()160 t[nw + i + 1] |= (l >> rb) & BN_MASK2; in BN_lshift()161 t[nw + i] = (l << lb) & BN_MASK2; in BN_lshift()215 tmp = (l >> rb) & BN_MASK2; in BN_rshift()217 *(t++) = (tmp | (l << lb)) & BN_MASK2; in BN_rshift()219 if ((l = (l >> rb) & BN_MASK2)) in BN_rshift()
304 # define Lw(t) (((BN_ULONG)(t))&BN_MASK2)305 # define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)405 # define L2HBITS(a) (((a)<<BN_BITS4)&BN_MASK2)421 m=(m+m1)&BN_MASK2; if (m < m1) ht+=L2HBITS((BN_ULONG)1); \424 lt=(lt+m1)&BN_MASK2; if (lt < m1) ht++; \441 l=(l+m)&BN_MASK2; if (l < m) h++; \455 l=(l+(c))&BN_MASK2; if (l < (c)) h++; \457 l=(l+(c))&BN_MASK2; if (l < (c)) h++; \458 (c)=h&BN_MASK2; \471 l+=(c); if ((l&BN_MASK2) < (c)) h++; \[all …]
105 r[0] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()112 r[1] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()119 r[2] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()126 r[3] = (0 - t - c) & BN_MASK2; in bn_sub_part_words()143 r[0] = (t - c) & BN_MASK2; in bn_sub_part_words()150 r[1] = (t - c) & BN_MASK2; in bn_sub_part_words()157 r[2] = (t - c) & BN_MASK2; in bn_sub_part_words()164 r[3] = (t - c) & BN_MASK2; in bn_sub_part_words()249 l = (c + b[0]) & BN_MASK2; in bn_add_part_words()255 l = (c + b[1]) & BN_MASK2; in bn_add_part_words()[all …]
143 t2 = (t1 + 1) & BN_MASK2; in BN_uadd()201 t1 = (t1 - t2 - 1) & BN_MASK2; in BN_usub()204 t1 = (t1 - t2) & BN_MASK2; in BN_usub()209 *(rp++) = t1 & BN_MASK2; in BN_usub()224 t2 = (t1 - 1) & BN_MASK2; in BN_usub()
223 t2 = (t3 * t2) & BN_MASK2; in BN_from_montgomery_word()228 v = bn_mul_add_words(rp, np, nl, (rp[0] * n0) & BN_MASK2); in BN_from_montgomery_word()230 v = (v + carry + rp[nl]) & BN_MASK2; in BN_from_montgomery_word()427 Ri->d[0] = BN_MASK2; in BN_MONT_CTX_set()428 Ri->d[1] = BN_MASK2; in BN_MONT_CTX_set()456 if (!BN_set_word(Ri, BN_MASK2)) in BN_MONT_CTX_set()
355 q = BN_MASK2; in BN_div()376 rem = (n1 - q * d0) & BN_MASK2; in BN_div()398 rem = (n1 - q * d0) & BN_MASK2; in BN_div()
273 ln = (lo + c1) & BN_MASK2; in bn_sqr_recursive()284 ln = (lo + 1) & BN_MASK2; in bn_sqr_recursive()
850 *(ap++) = ((t << 1) | c) & BN_MASK2; in BN_nist_mod_256()1118 *(ap++) = ((t << 1) | c) & BN_MASK2; in BN_nist_mod_384()1202 #define BN_NIST_521_TOP_MASK ((BN_ULONG)BN_MASK2>>BN_NIST_521_LSHIFT)1243 (tmp = t_d[i + 1]) << BN_NIST_521_LSHIFT) & BN_MASK2; in BN_nist_mod_521()
189 # define BN_MASK2 (0xffffffffffffffffL) macro217 # define BN_MASK2 (0xffffffffffffffffLL) macro246 # define BN_MASK2 (0xffffffffL) macro
580 return BN_MASK2; in BN_get_word()796 a->d[w] &= ~(BN_MASK2 << b); in BN_mask_bits()
390 maxdelta = BN_MASK2 - primes[NUMPRIMES - 1]; in probable_prime()
677 tmp.d[0] = (0 - m->d[0]) & BN_MASK2; /* 2^(top*BN_BITS2) - m */ in BN_mod_exp_mont_consttime()679 tmp.d[i] = (~m->d[i]) & BN_MASK2; in BN_mod_exp_mont_consttime()
733 udp[i] = ((u0 >> 1) | (u1 << (BN_BITS2 - 1))) & BN_MASK2; in BN_GF2m_mod_inv()736 bdp[i] = ((b0 >> 1) | (b1 << (BN_BITS2 - 1))) & BN_MASK2; in BN_GF2m_mod_inv()
252 # define BN_MASK2 0xffffffffffffffffL macro264 r[0] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()272 r[1] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()280 r[2] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()288 r[3] = (t1 - t2 - c) & BN_MASK2; in bn_sub_words()
1710 # h = ((h<<BN_BITS4)|(l>>BN_BITS4))&BN_MASK2
589 if (scale != BN_MASK2 && scale <= UINT_MAX) in set_scale()617 if (base != BN_MASK2 && base > 1 && base <= UINT_MAX) in set_obase()644 if (base != BN_MASK2 && 2 <= base && base <= 16) in set_ibase()884 else if (idx == BN_MASK2 || idx > MAX_ARRAY_INDEX) in load_array()924 } else if (idx == BN_MASK2 || idx > MAX_ARRAY_INDEX) { in store_array()1216 if (rscale > m || (a->scale > 0 && (b == BN_MASK2 || in bexp()1590 if (i == BN_MASK2 || i == 0) in quitN()1612 if (i == BN_MASK2) in skipN()
7842 equal (it gave wrong results if (rem=(n1-q*d0)&BN_MASK2) < d0).