1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
/* Test mpf_div, mpf_div_2exp, mpf_mul_2exp.
Copyright 1996, 2000 Free Software Foundation, Inc.
This file is part of the GNU MP Library.
The GNU MP Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at your
option) any later version.
The GNU MP Library 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 Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the GNU MP Library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA. */
#include <stdio.h>
#include "gmp.h"
#include "gmp-impl.h"
#include "urandom.h"
#ifndef SIZE
#define SIZE 16
#endif
main (argc, argv)
int argc;
char **argv;
{
int reps = 500000;
int i;
mpf_t u, v, w1, w2, w3;
mp_size_t bprec = 100;
mpf_t rerr, limit_rerr;
mp_size_t un;
mp_exp_t ue;
if (argc > 1)
{
reps = strtol (argv[1], 0, 0);
if (argc > 2)
bprec = strtol (argv[2], 0, 0);
}
mpf_set_default_prec (bprec);
mpf_init (rerr);
mpf_init (limit_rerr);
mpf_init (u);
mpf_init (v);
mpf_init (w1);
mpf_init (w2);
mpf_init (w3);
for (i = 0; i < reps; i++)
{
unsigned long int res_prec;
unsigned long int pow2;
res_prec = urandom () % (bprec + 100);
mpf_set_prec (w1, res_prec);
mpf_set_prec (w2, res_prec);
mpf_set_prec (w3, res_prec);
mpf_set_ui (limit_rerr, 1);
mpf_div_2exp (limit_rerr, limit_rerr, res_prec);
pow2 = urandom () % 0x10000;
mpf_set_ui (v, 1);
mpf_mul_2exp (v, v, pow2);
un = urandom () % (2 * SIZE) - SIZE;
ue = urandom () % SIZE;
mpf_random2 (u, un, ue);
mpf_div_2exp (w1, u, pow2);
mpf_div (w2, u, v);
mpf_reldiff (rerr, w1, w2);
if (mpf_cmp (rerr, limit_rerr) > 0)
{
printf ("ERROR in mpf_div or mpf_div_2exp after %d tests\n", i);
printf (" u = "); mpf_dump (u);
printf (" v = "); mpf_dump (v);
printf (" w1 = "); mpf_dump (w1);
printf (" w2 = "); mpf_dump (w2);
abort ();
}
mpf_mul_2exp (w3, w1, pow2);
mpf_reldiff (rerr, u, w3);
if (mpf_cmp (rerr, limit_rerr) > 0)
{
printf ("ERROR in mpf_mul_2exp after %d tests\n", i);
printf (" u = "); mpf_dump (u);
printf (" v = "); mpf_dump (v);
printf (" w1 = "); mpf_dump (w1);
printf (" w3 = "); mpf_dump (w3);
abort ();
}
}
exit (0);
}
oo (x)
mpf_t x;
{
mp_size_t i;
printf (" exp = %ld\n", x->_mp_exp);
printf ("size = %d\n", x->_mp_size);
for (i = ABS (x->_mp_size) - 1; i >= 0; i--)
printf ("%08lX ", x->_mp_d[i]);
printf ("\n");
mpf_dump (x);
}
|
