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
121
|
/* template for (complex,complex) -> complex function, for example add
Copyright (C) 2020 INRIA
This file is part of GNU MPC.
GNU MPC 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 3 of the License, or (at your
option) any later version.
GNU MPC 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 this program. If not, see http://www.gnu.org/licenses/ .
*/
#define CAT1(X,Y) X ## Y
#define CAT2(X,Y) CAT1(X,Y)
#define STRINGIFY(x) #x
#define TOSTRING(x) STRINGIFY(x)
#define FUN CAT2(test_,FOO)
#define MPC_FOO CAT2(mpc_,FOO)
#ifndef CFOO
#define CFOO CAT2(CAT2(c,FOO),SUFFIX)
#endif
#define BAR TOSTRING(FOO)
static void
FUN (mpfr_prec_t p, unsigned long n)
{
unsigned long i = 0;
mpc_t x, y, z, t;
TYPE complex xx, yy, zz;
int inex;
unsigned long errors = 0, max_err_re = 0, max_err_im = 0;
unsigned long special_errors = 0;
int cmp;
if (verbose > 0)
printf ("Testing function %s\n", BAR);
gmp_randseed_ui (state, seed);
mpc_init2 (x, p);
mpc_init2 (y, p);
mpc_init2 (z, p);
mpc_init2 (t, p);
for (i = 0; i < n; i++)
{
mpcheck_random (x);
mpcheck_random (y);
inex = MPC_FOO (z, x, y, MPC_RNDNN);
mpfr_subnormalize (mpc_realref (z), MPC_INEX_RE(inex), MPFR_RNDN);
mpfr_subnormalize (mpc_imagref (z), MPC_INEX_IM(inex), MPFR_RNDN);
xx = mpc_get_type (x, MPC_RNDNN);
yy = mpc_get_dc (y, MPC_RNDNN);
zz = CFOO(xx, yy);
mpc_set_type (t, zz, MPFR_RNDN);
cmp = mpcheck_mpc_cmp (t, z);
if (cmp > 1) /* NaN or Inf */
{
if (verbose > 1 || (verbose == 1 && special_errors == 0))
{
printf (" mpc_%s and c%s differ\n", BAR, BAR);
mpfr_printf (" for x=(%Re,%Re)\n y=(%Re,%Re)\n",
mpc_realref (x), mpc_imagref (x),
mpc_realref (y), mpc_imagref (y));
mpfr_printf (" mpc_%s gives (%Re,%Re)\n", BAR,
mpc_realref (z), mpc_imagref (z));
mpfr_printf (" c%s gives (%Re,%Re)\n", BAR,
mpc_realref (t), mpc_imagref (t));
special_errors ++;
}
errors ++;
}
else if (cmp != 0)
{
unsigned long err_re = ulp_error (mpc_realref (t), mpc_realref (z));
unsigned long err_im = ulp_error (mpc_imagref (t), mpc_imagref (z));
if (verbose > 0 && (err_re > max_err_re || err_im > max_err_im))
{
printf (" mpc_%s and c%s differ by (%lu,%lu) ulp(s)\n",
BAR, BAR, err_re, err_im);
mpfr_printf (" for x=(%Re,%Re)\n y=(%Re,%Re)\n",
mpc_realref (x), mpc_imagref (x),
mpc_realref (y), mpc_imagref (y));
mpfr_printf (" mpc_%s gives (%Re,%Re)\n", BAR,
mpc_realref (z), mpc_imagref (z));
mpfr_printf (" c%s gives (%Re,%Re)\n", BAR,
mpc_realref (t), mpc_imagref (t));
}
errors ++;
if (err_re > max_err_re)
{
max_err_re = err_re;
if (max_err_re > Max_err_re)
Max_err_re = max_err_re;
}
if (err_im > max_err_im)
{
max_err_im = err_im;
if (max_err_im > Max_err_im)
Max_err_im = max_err_im;
}
}
}
mpc_clear (x);
mpc_clear (y);
mpc_clear (z);
mpc_clear (t);
printf ("Errors for %s: %lu/%lu (max %lu,%lu) [seed %lu]\n", BAR, errors, n,
max_err_re, max_err_im, seed);
}
#undef FOO
#undef CFOO
|
