/* Exercise mpz_get_si.
Copyright 2000 , 2001 Free Software Foundation , Inc .
This file is part of the GNU MP Library test suite .
The GNU MP Library test suite is free software ; you can redistribute it
and / or modify it under the terms of the GNU General Public License as
published by the Free Software Foundation ; either version 3 of the License ,
or ( at your option ) any later version .
The GNU MP Library test suite is distributed in the hope that it will be
useful , but WITHOUT ANY WARRANTY ; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE . See the GNU General
Public License for more details .
You should have received a copy of the GNU General Public License along with
the GNU MP Library test suite. If not, see https://www.gnu.org/licenses/. */
#include <stdio.h>
#include <stdlib.h>
#include "gmp-impl.h"
#include "tests.h"
void
check_data (
void )
{
static const struct {
int base;
const char *f;
long want;
} data[] = {
{
10 ,
"0" ,
0 L },
{
10 ,
"1" ,
1 L },
{
10 ,
"-1" , -
1 L },
{
10 ,
"2" ,
2 L },
{
10 ,
"-2" , -
2 L },
{
10 ,
"12345" ,
12345 L },
{
10 ,
"-12345" , -
12345 L },
/* fraction bits ignored */
{
10 ,
"0.5" ,
0 L },
{
10 ,
"-0.5" ,
0 L },
{
10 ,
"1.1" ,
1 L },
{
10 ,
"-1.1" , -
1 L },
{
10 ,
"1.9" ,
1 L },
{
10 ,
"-1.9" , -
1 L },
{
16 ,
"1.000000000000000000000000000000000000000000000000001" ,
1 L },
{
16 ,
"-1.000000000000000000000000000000000000000000000000001" , -
1 L },
/* low bits extracted (this is undocumented) */
{
16 ,
"1000000000000000000000000000000000000000000000000001" ,
1 L },
{
16 ,
"-1000000000000000000000000000000000000000000000000001" , -
1 L },
};
int i;
mpf_t f;
long got;
mpf_init2 (f,
2000 L);
for (i =
0 ; i < numberof (data); i++)
{
mpf_set_str_or_abort (f, data[i].f, data[i].base);
got = mpf_get_si (f);
if (got != data[i].want)
{
printf (
"mpf_get_si wrong at data[%d]\n" , i);
printf (
" f \" %s\
"\n" , data[i].f);
printf (
" dec " ); mpf_out_str (stdout,
10 ,
0 , f); printf (
"\n" );
printf (
" hex " ); mpf_out_str (stdout,
16 ,
0 , f); printf (
"\n" );
printf (
" size %ld\n" , (
long ) SIZ(f));
printf (
" exp %ld\n" , (
long ) EXP(f));
printf (
" got %ld (0x%lX)\n" , got, got);
printf (
" want %ld (0x%lX)\n" , data[i].want, data[i].want);
abort();
}
}
mpf_clear (f);
}
void
check_max (
void )
{
mpf_t f;
long want;
long got;
mpf_init2 (f,
200 L);
#define CHECK_MAX(name) \
if (got != want) \
{ \
printf (
"mpf_get_si wrong on %s\n" , name); \
printf (
" f " ); \
mpf_out_str (stdout,
10 ,
0 , f); printf (
", hex " ); \
mpf_out_str (stdout,
16 ,
0 , f); printf (
"\n" ); \
printf (
" got %ld, hex %lX\n" , got, got); \
printf (
" want %ld, hex %lX\n" , want, want); \
abort(); \
}
want = LONG_MAX;
mpf_set_si (f, want);
got = mpf_get_si (f);
CHECK_MAX (
"LONG_MAX" );
want = LONG_MIN;
mpf_set_si (f, want);
got = mpf_get_si (f);
CHECK_MAX (
"LONG_MIN" );
mpf_clear (f);
}
void
check_limbdata (
void )
{
#define M GMP_NUMB_MAX
static const struct {
mp_exp_t exp;
mp_size_t size;
mp_limb_t d[
10 ];
unsigned long want;
} data[] = {
/* in the comments here, a "_" indicates a digit (ie. limb) position not
included in the d data, and therefore zero */
{
0 ,
0 , {
0 },
0 L },
/* 0 */
{
1 ,
1 , {
1 },
1 L },
/* 1 */
{
1 , -
1 , {
1 }, -
1 UL },
/* -1 */
{
0 ,
1 , {
1 },
0 L },
/* .1 */
{
0 , -
1 , {
1 },
0 L },
/* -.1 */
{ -
1 ,
1 , {
1 },
0 L },
/* ._1 */
{ -
1 , -
1 , {
1 },
0 L },
/* -._1 */
{ -
999 ,
1 , {
1 },
0 L },
/* .___1 small */
{ MP_EXP_T_MIN,
1 , {
1 },
0 L },
/* .____1 very small */
{
999 ,
1 , {
1 },
0 L },
/* 1____. big */
{ MP_EXP_T_MAX,
1 , {
1 },
0 L },
/* 1_____. very big */
{
1 ,
2 , {
999 ,
2 },
2 L },
/* 2.9 */
{
5 ,
8 , {
7 ,
8 ,
9 ,
3 ,
0 ,
0 ,
0 ,
1 },
3 L },
/* 10003.987 */
{
2 ,
2 , { M, M }, LONG_MAX },
/* FF. */
{
2 ,
2 , { M, M, M }, LONG_MAX },
/* FF.F */
{
3 ,
3 , { M, M, M }, LONG_MAX },
/* FFF. */
#if GMP_NUMB_BITS >= BITS_PER_ULONG
/* normal case, numb bigger than long */
{
2 ,
1 , {
1 },
0 L },
/* 1_. */
{
2 ,
2 , {
0 ,
1 },
0 L },
/* 10. */
{
2 ,
2 , {
999 ,
1 },
999 L },
/* 19. */
{
3 ,
2 , {
999 ,
1 },
0 L },
/* 19_. */
#else
/* nails case, numb smaller than long */
{
2 ,
1 , {
1 },
1 L << GMP_NUMB_BITS },
/* 1_. */
{
3 ,
1 , {
1 },
0 L },
/* 1__. */
{
2 ,
2 , {
99 ,
1 },
99 L + (
1 L << GMP_NUMB_BITS) },
/* 19. */
{
3 ,
2 , {
1 ,
99 },
1 L << GMP_NUMB_BITS },
/* 91_. */
{
3 ,
3 , {
0 ,
1 ,
99 },
1 L << GMP_NUMB_BITS },
/* 910. */
#endif
};
mpf_t f;
unsigned long got;
int i;
mp_limb_t buf[
20 + numberof(data[i].d)];
for (i =
0 ; i < numberof (data); i++)
{
refmpn_fill (buf,
10 , CNST_LIMB(
0 xDEADBEEF));
refmpn_copy (buf+
10 , data[i].d, ABS(data[i].size));
refmpn_fill (buf+
10 +ABS(data[i].size),
10 , CNST_LIMB(
0 xDEADBEEF));
PTR(f) = buf+
10 ;
EXP(f) = data[i].exp;
SIZ(f) = data[i].size;
PREC(f) = numberof (data[i].d);
MPF_CHECK_FORMAT (f);
got = mpf_get_si (f);
if (got != data[i].want)
{
printf (
"mpf_get_si wrong at limb data[%d]\n" , i);
mpf_trace (
" f" , f);
mpn_trace (
" d" , data[i].d, data[i].size);
printf (
" size %ld\n" , (
long ) data[i].size);
printf (
" exp %ld\n" , (
long ) data[i].exp);
printf (
" got %lu (0x%lX)\n" , got, got);
printf (
" want %lu (0x%lX)\n" , data[i].want, data[i].want);
abort();
}
}
}
int
main (
void )
{
tests_start ();
check_data ();
check_max ();
check_limbdata ();
tests_end ();
exit (
0 );
}
Messung V0.5 in Prozent C=93 H=97 G=94
¤ Dauer der Verarbeitung: 0.2 Sekunden
¤
*© Formatika GbR, Deutschland