int
main (int argc, char *argv[])
{
mp_limb_t bb, h, l, bb_inv;
int i, j;
for (i = 2; i < numberof (mp_bases); i++)
{
if (POW2_P (i))
{
count_trailing_zeros (j, i);
if (mp_bases[i].big_base != (mp_limb_t) j)
{
printf ("mp_bases[%d].big_base (trailing zeros) wrong\n", i);
abort ();
}
}
else
{
bb = 1;
for (j = 0; j < mp_bases[i].chars_per_limb; j++)
{
umul_ppmm (h, bb, bb, i);
if (h != 0 || (bb & GMP_NAIL_MASK) != 0)
{
printf ("mp_bases[%d].chars_per_limb overflow\n", i);
abort ();
}
}
umul_ppmm (h, l, bb, i);
if (h == 0 && (l & GMP_NAIL_MASK) == 0)
{
printf ("mp_bases[%d].chars_per_limb too small\n", i);
abort ();
}
if (mp_bases[i].big_base != bb)
{
printf ("mp_bases[%d].big_base wrong\n", i);
abort ();
}
invert_limb (bb_inv, bb << refmpn_count_leading_zeros (bb));
if (mp_bases[i].big_base_inverted != bb_inv)
{
printf ("mp_bases[%d].big_base_inverted wrong\n", i);
abort ();
}
}
}
if (MP_BASES_CHARS_PER_LIMB_10 != mp_bases[10].chars_per_limb)
{
printf ("MP_BASES_CHARS_PER_LIMB_10 not the same as mp_bases[10].chars_per_limb\n");
abort ();
}
if (MP_BASES_BIG_BASE_10 != mp_bases[10].big_base)
{
printf ("MP_BASES_BIG_BASE_10 not the same as mp_bases[10].big_base\n");
abort ();
}
if (MP_BASES_BIG_BASE_INVERTED_10 != mp_bases[10].big_base_inverted)
{
printf ("MP_BASES_BIG_BASE_INVERTED_10 not the same as mp_bases[10].big_base_inverted\n");
abort ();
}
if (MP_BASES_NORMALIZATION_STEPS_10
!= refmpn_count_leading_zeros (MP_BASES_BIG_BASE_10))
{
printf ("MP_BASES_NORMALIZATION_STEPS_10 wrong\n");
abort ();
}
exit (0);
}
int
main (int argc, char *argv[])
{
mp_limb_t want_bb, want_bb_inv;
int base, want_chars_per_limb;
want_chars_per_limb = refmpn_chars_per_limb (10);
if (MP_BASES_CHARS_PER_LIMB_10 != want_chars_per_limb)
{
printf ("MP_BASES_CHARS_PER_LIMB_10 wrong\n");
abort ();
}
want_bb = refmpn_big_base (10);
if (MP_BASES_BIG_BASE_10 != want_bb)
{
printf ("MP_BASES_BIG_BASE_10 wrong\n");
abort ();
}
want_bb_inv = refmpn_invert_limb
(want_bb << refmpn_count_leading_zeros (want_bb));
if (MP_BASES_BIG_BASE_INVERTED_10 != want_bb_inv)
{
printf ("MP_BASES_BIG_BASE_INVERTED_10 wrong\n");
abort ();
}
if (MP_BASES_NORMALIZATION_STEPS_10
!= refmpn_count_leading_zeros (MP_BASES_BIG_BASE_10))
{
printf ("MP_BASES_NORMALIZATION_STEPS_10 wrong\n");
abort ();
}
for (base = 2; base < numberof (mp_bases); base++)
{
want_chars_per_limb = refmpn_chars_per_limb (base);
if (mp_bases[base].chars_per_limb != want_chars_per_limb)
{
printf ("mp_bases[%d].chars_per_limb wrong\n", base);
printf (" got %d\n", mp_bases[base].chars_per_limb);
printf (" want %d\n", want_chars_per_limb);
abort ();
}
if (POW2_P (base))
{
want_bb = refmpn_count_trailing_zeros ((mp_limb_t) base);
if (mp_bases[base].big_base != want_bb)
{
printf ("mp_bases[%d].big_base (log2 of base) wrong\n", base);
abort ();
}
}
else
{
want_bb = refmpn_big_base (base);
if (mp_bases[base].big_base != want_bb)
{
printf ("mp_bases[%d].big_base wrong\n", base);
abort ();
}
#if USE_PREINV_DIVREM_1
want_bb_inv = refmpn_invert_limb
(want_bb << refmpn_count_leading_zeros (want_bb));
if (mp_bases[base].big_base_inverted != want_bb_inv)
{
printf ("mp_bases[%d].big_base_inverted wrong\n", base);
abort ();
}
#endif
}
}
exit (0);
}
void
check_data (void)
{
static const struct {
mp_limb_t n[1];
mp_size_t nsize;
mp_limb_t d;
mp_size_t qxn;
mp_limb_t want_q[5];
mp_limb_t want_r;
} data[] = {
{ { 0 }, 1, 1, 0,
{ 0 }, 0},
{ { 5 }, 1, 2, 0,
{ 2 }, 1},
#if GMP_NUMB_BITS == 32
{ { 0x3C }, 1, 0xF2, 1,
{ 0x3F789854, 0 }, 0x98 },
#endif
#if GMP_NUMB_BITS == 64
{ { 0x3C }, 1, 0xF2, 1,
{ CNST_LIMB(0x3F789854A0CB1B81), 0 }, 0x0E },
/* This case exposed some wrong code generated by SGI cc on mips64 irix
6.5 with -n32 -O2, in the fractional loop for normalized divisor
using udiv_qrnnd_preinv. A test "x>al" in one of the sub_ddmmss
expansions came out wrong, leading to an incorrect quotient. */
{ { CNST_LIMB(0x3C00000000000000) }, 1, CNST_LIMB(0xF200000000000000), 1,
{ CNST_LIMB(0x3F789854A0CB1B81), 0 }, CNST_LIMB(0x0E00000000000000) },
#endif
};
mp_limb_t dinv, got_r, got_q[numberof(data[0].want_q)];
mp_size_t qsize;
int i, shift;
for (i = 0; i < numberof (data); i++)
{
qsize = data[i].nsize + data[i].qxn;
ASSERT_ALWAYS (qsize <= numberof (got_q));
got_r = mpn_divrem_1 (got_q, data[i].qxn, data[i].n, data[i].nsize,
data[i].d);
if (got_r != data[i].want_r
|| refmpn_cmp (got_q, data[i].want_q, qsize) != 0)
{
printf ("mpn_divrem_1 wrong at data[%d]\n", i);
bad:
mpn_trace (" n", data[i].n, data[i].nsize);
printf (" nsize=%ld\n", (long) data[i].nsize);
mp_limb_trace (" d", data[i].d);
printf (" qxn=%ld\n", (long) data[i].qxn);
mpn_trace (" want q", data[i].want_q, qsize);
mpn_trace (" got q", got_q, qsize);
mp_limb_trace (" want r", data[i].want_r);
mp_limb_trace (" got r", got_r);
abort ();
}
/* test if available */
#if USE_PREINV_DIVREM_1 || HAVE_NATIVE_mpn_preinv_divrem_1
shift = refmpn_count_leading_zeros (data[i].d);
dinv = refmpn_invert_limb (data[i].d << shift);
got_r = mpn_preinv_divrem_1 (got_q, data[i].qxn,
data[i].n, data[i].nsize,
data[i].d, dinv, shift);
if (got_r != data[i].want_r
|| refmpn_cmp (got_q, data[i].want_q, qsize) != 0)
{
printf ("mpn_preinv divrem_1 wrong at data[%d]\n", i);
printf (" shift=%d\n", shift);
mp_limb_trace (" dinv", dinv);
goto bad;
}
#endif
}
}