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
122
123
124
125
|
/* fft/compare_source.c
*
* Copyright (C) 1996, 1997, 1998, 1999, 2000 Brian Gough
*
* This program 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 2 of the License, or (at
* your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include "compare.h"
int
FUNCTION(compare_complex,results) (const char *name_a, const BASE a[],
const char *name_b, const BASE b[],
size_t stride, size_t n,
const double allowed_ticks)
{
size_t i;
double ticks, max_ticks = 0;
double dr, di;
const char *flag;
for (i = 0; i < n; i++)
{
dr = b[2*stride*i] - a[2*stride*i];
di = b[2*stride*i+1] - a[2*stride*i+1];
ticks = (fabs (dr) + fabs (di)) / BASE_EPSILON;
if (ticks > max_ticks)
{
max_ticks = ticks;
}
}
if (max_ticks < allowed_ticks)
{
return 0;
}
printf ("\n%s vs %s : max_ticks = %f\n", name_a, name_b, max_ticks);
for (i = 0; i < n; i++)
{
dr = b[2*stride*i] - a[2*stride*i];
di = b[2*stride*i+1] - a[2*stride*i+1];
ticks = (fabs (dr) + fabs (di)) / BASE_EPSILON;
if (ticks > 1000)
{
flag = "***";
}
else
{
flag = "";
}
printf ("%15s: %d %.16f %.16f %s\n", name_a, (int)i,
a[2*stride*i], a[2*stride*i+1], flag);
printf ("%15s: %d %.16f %.16f %e %s\n", name_b, (int)i,
b[2*stride*i], b[2*stride*i+1], ticks, flag);
}
return -1;
}
int
FUNCTION(compare_real,results) (const char *name_a, const BASE a[],
const char *name_b, const BASE b[],
size_t stride, size_t n,
const double allowed_ticks)
{
size_t i;
double ticks, max_ticks = 0;
double dr;
const char *flag;
for (i = 0; i < n; i++)
{
dr = b[stride*i] - a[stride*i];
ticks = fabs (dr) / BASE_EPSILON;
if (ticks > max_ticks)
{
max_ticks = ticks;
}
}
if (max_ticks < allowed_ticks)
{
return 0;
}
printf ("\n%s vs %s : max_ticks = %f\n", name_a, name_b, max_ticks);
for (i = 0; i < n; i++)
{
dr = b[stride*i] - a[stride*i];
ticks = fabs (dr) / BASE_EPSILON;
if (ticks > 1000)
{
flag = "***";
}
else
{
flag = "";
}
printf ("%15s: %d %.16f %s\n", name_a, (int)i,
a[stride*i], flag);
printf ("%15s: %d %.16f %e %s\n", name_b, (int)i,
b[stride*i], ticks, flag);
}
return -1;
}
|
