Lines Matching refs:BN_BITS2
56 * Product of two polynomials a, b each with degree < BN_BITS2 - 1, result is
228 * Product of two polynomials a, b each with degree < 2 * BN_BITS2 - 1,
229 * result is a polynomial r with degree < 4 * BN_BITS2 - 1 The caller MUST
322 dN = p[0] / BN_BITS2;
334 d0 = n % BN_BITS2;
335 d1 = BN_BITS2 - d0;
336 n /= BN_BITS2;
344 d0 = p[0] % BN_BITS2;
345 d1 = BN_BITS2 - d0;
354 d0 = p[0] % BN_BITS2;
358 d1 = BN_BITS2 - d0;
371 n = p[k] / BN_BITS2;
372 d0 = p[k] % BN_BITS2;
373 d1 = BN_BITS2 - d0;
663 udp[i] = ((u0 >> 1) | (u1 << (BN_BITS2 - 1))) & BN_MASK2;
666 bdp[i] = ((b0 >> 1) | (b1 << (BN_BITS2 - 1))) & BN_MASK2;
674 if (ubits <= BN_BITS2) {
702 int utop = (ubits - 1) / BN_BITS2;
706 ubits = utop * BN_BITS2 + BN_num_bits_word(ul);
1165 for (j = BN_BITS2 - 1; j >= 0; j--) {
1168 p[k] = BN_BITS2 * i + j;