Lines Matching refs:BN_BITS2
128 /* Product of two polynomials a, b each with degree < BN_BITS2 - 1,
206 /* Product of two polynomials a, b each with degree < 2 * BN_BITS2 - 1,
207 * result is a polynomial r with degree < 4 * BN_BITS2 - 1
297 dN = p[0] / BN_BITS2;
308 d0 = n % BN_BITS2; d1 = BN_BITS2 - d0;
309 n /= BN_BITS2;
316 d0 = p[0] % BN_BITS2;
317 d1 = BN_BITS2 - d0;
326 d0 = p[0] % BN_BITS2;
329 d1 = BN_BITS2 - d0;
343 n = p[k] / BN_BITS2;
344 d0 = p[k] % BN_BITS2;
345 d1 = BN_BITS2 - d0;
603 udp[i] = ((u0>>1)|(u1<<(BN_BITS2-1)))&BN_MASK2;
606 bdp[i] = ((b0>>1)|(b1<<(BN_BITS2-1)))&BN_MASK2;
614 if (ubits<=BN_BITS2 && udp[0]==1) break;
632 int utop = (ubits-1)/BN_BITS2;
635 ubits = utop*BN_BITS2 + BN_num_bits_word(ul);
1075 for (j = BN_BITS2 - 1; j >= 0; j--)
1079 if (k < max) p[k] = BN_BITS2 * i + j;
