Lines Matching refs:BN_BITS2
134 * Product of two polynomials a, b each with degree < BN_BITS2 - 1, result is
306 * Product of two polynomials a, b each with degree < 2 * BN_BITS2 - 1,
307 * result is a polynomial r with degree < 4 * BN_BITS2 - 1 The caller MUST
400 dN = p[0] / BN_BITS2;
412 d0 = n % BN_BITS2;
413 d1 = BN_BITS2 - d0;
414 n /= BN_BITS2;
422 d0 = p[0] % BN_BITS2;
423 d1 = BN_BITS2 - d0;
432 d0 = p[0] % BN_BITS2;
436 d1 = BN_BITS2 - d0;
449 n = p[k] / BN_BITS2;
450 d0 = p[k] % BN_BITS2;
451 d1 = BN_BITS2 - d0;
735 udp[i] = ((u0 >> 1) | (u1 << (BN_BITS2 - 1))) & BN_MASK2;
738 bdp[i] = ((b0 >> 1) | (b1 << (BN_BITS2 - 1))) & BN_MASK2;
746 if (ubits <= BN_BITS2) {
774 int utop = (ubits - 1) / BN_BITS2;
778 ubits = utop * BN_BITS2 + BN_num_bits_word(ul);
1263 for (j = BN_BITS2 - 1; j >= 0; j--) {
1266 p[k] = BN_BITS2 * i + j;