Lines Matching defs:bit
824 * converts an mp_int with 32-bit "digits" to an array
825 * of 64-bit numbers (least significant 64 bits in
966 * since useda is in units of 32-bit words,
1087 step is a bit more complicated, but we save a fair number of
1309 int dig, bit;
1329 for(bit = 0; bit < DIGIT_BIT; bit++) {
1684 int dig, bit;
1712 for(bit = 0; bit < DIGIT_BIT; bit++) {
2331 /* Compute T = (P ** -1) mod MP_RADIX. Also works for 16-bit mp_digits.
3272 /* Shift digits leftward by 1 bit */
4316 ** Divide 64-bit (Nhi,Nlo) by 32-bit divisor, which must be normalized
4317 ** so its high bit is 1. This code is from NSPR.
4526 mp_size dig, bit;
4529 bit = k % DIGIT_BIT;
4535 DIGIT(a, dig) |= ((mp_digit)1 << bit);
4854 No sign bit, number is positive. Leading zeros ignored.