Lines Matching defs:bits
77 * 128-bit values are called 'limbs'. Since the limbs are spaced only 64 bits
78 * apart, but are 128-bits wide, the most significant bits of each limb overlap
79 * with the least significant bits of the next.
763 /* if out[i] > kPrime[i] then a will underflow and the high 64-bits
822 /* felem_is_zero returns a limb with all bits set if |in| == 0 (mod p) and 0
1289 * index | bits | point
1309 * The reason for this is so that we can clock bits into four different
1514 u64 bits;
1534 /* first, look 32 bits upwards */
1535 bits = get_bit(g_scalar, i + 224) << 3;
1536 bits |= get_bit(g_scalar, i + 160) << 2;
1537 bits |= get_bit(g_scalar, i + 96) << 1;
1538 bits |= get_bit(g_scalar, i + 32);
1540 select_point(bits, 16, g_pre_comp[1], tmp);
1554 bits = get_bit(g_scalar, i + 192) << 3;
1555 bits |= get_bit(g_scalar, i + 128) << 2;
1556 bits |= get_bit(g_scalar, i + 64) << 1;
1557 bits |= get_bit(g_scalar, i);
1559 select_point(bits, 16, g_pre_comp[0], tmp);
1569 bits = get_bit(scalars[num], i + 4) << 5;
1570 bits |= get_bit(scalars[num], i + 3) << 4;
1571 bits |= get_bit(scalars[num], i + 2) << 3;
1572 bits |= get_bit(scalars[num], i + 1) << 2;
1573 bits |= get_bit(scalars[num], i) << 1;
1574 bits |= get_bit(scalars[num], i - 1);
1575 ec_GFp_nistp_recode_scalar_bits(&sign, &digit, bits);
