Searched refs:limb (Results 1 – 4 of 4) sorted by relevance
25 mpi_limb_t limb = v; in mpi_cmp_ui() local39 if (u->d[0] == limb) in mpi_cmp_ui()41 else if (u->d[0] > limb) in mpi_cmp_ui()
65 mpi_limb_t limb; in mpi_test_bit() local72 limb = a->d[limbno]; in mpi_test_bit()73 return (limb & (A_LIMB_1 << bitno)) ? 1 : 0; in mpi_test_bit()
259 #error please implement for this limb size. in mpi_read_buffer()288 #error please implement for this limb size. in mpi_read_buffer()363 #error please implement for this limb size. in mpi_write_to_sgl()405 #error please implement for this limb size. in mpi_write_to_sgl()
2514 +// the limb width: we want efficient multiplication of double the bits in2515 +// limb, or for 64-bit limbs, at least 64-bit multiplication where we can2519 +// doing `8 * sizeof(limb)`.2522 +typedef uint64_t limb;2526 +typedef uint32_t limb;2530 +typedef span<limb> limb_span;2542 + limb data[size];2552 + // create stack vector from existing limb span.2557 + FASTFLOAT_CONSTEXPR14 limb &operator[](size_t index) noexcept {2561 + FASTFLOAT_CONSTEXPR14 const limb &operator[](size_t index) const noexcept {[all …]