Lines Matching defs:bit
915 step is a bit more complicated, but we save a fair number of
1137 int dig, bit;
1157 for(bit = 0; bit < DIGIT_BIT; bit++) {
1512 int dig, bit;
1540 for(bit = 0; bit < DIGIT_BIT; bit++) {
2159 /* Compute T = (P ** -1) mod MP_RADIX. Also works for 16-bit mp_digits.
3100 /* Shift digits leftward by 1 bit */
4144 ** Divide 64-bit (Nhi,Nlo) by 32-bit divisor, which must be normalized
4145 ** so its high bit is 1. This code is from NSPR.
4354 mp_size dig, bit;
4357 bit = k % DIGIT_BIT;
4363 DIGIT(a, dig) |= ((mp_digit)1 << bit);
4682 No sign bit, number is positive. Leading zeros ignored.