Lines Matching defs:bits
102 * 128-bit values are called 'limbs'. Since the limbs are spaced only 64 bits
103 * apart, but are 128-bits wide, the most significant bits of each limb overlap
104 * with the least significant bits of the next.
864 * if out[i] > kPrime[i] then a will underflow and the high 64-bits
930 * felem_is_zero returns a limb with all bits set if |in| == 0 (mod p) and 0
1446 * index | bits | point
1466 * The reason for this is so that we can clock bits into four different
1682 u64 bits;
1702 /* first, look 32 bits upwards */
1703 bits = get_bit(g_scalar, i + 224) << 3;
1704 bits |= get_bit(g_scalar, i + 160) << 2;
1705 bits |= get_bit(g_scalar, i + 96) << 1;
1706 bits |= get_bit(g_scalar, i + 32);
1708 select_point(bits, 16, g_pre_comp[1], tmp);
1722 bits = get_bit(g_scalar, i + 192) << 3;
1723 bits |= get_bit(g_scalar, i + 128) << 2;
1724 bits |= get_bit(g_scalar, i + 64) << 1;
1725 bits |= get_bit(g_scalar, i);
1727 select_point(bits, 16, g_pre_comp[0], tmp);
1737 bits = get_bit(scalars[num], i + 4) << 5;
1738 bits |= get_bit(scalars[num], i + 3) << 4;
1739 bits |= get_bit(scalars[num], i + 2) << 3;
1740 bits |= get_bit(scalars[num], i + 1) << 2;
1741 bits |= get_bit(scalars[num], i) << 1;
1742 bits |= get_bit(scalars[num], i - 1);
1743 ossl_ec_GFp_nistp_recode_scalar_bits(&sign, &digit, bits);