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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
* Copyright (c) 2002, 2017 Jens Keiner, Stefan Kunis, Daniel Potts
*
* 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.
*/
/* Standard headers. */
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <CUnit/CUnit.h>
#include "nfft3.h"
#include "infft.h"
static INT _log2i(const INT m)
{
INT l = 0;
INT mm = m;
if (m <= 0)
return -1;
while (mm > (INT)(0))
{
mm = (mm >> 1);
l++;
}
return (l-1);
}
void X(check_log2i)(void)
{
INT i;
INT j;
{
INT r = Y(log2i)(0);
int ok = r == -1;
printf("log2i("__D__") = "__D__" -> %s\n", (INT)(0), r, ok ? "OK" : "FAIL");
CU_ASSERT(ok)
}
{
INT r = Y(log2i)(-1);
int ok = r == -1;
printf("log2i("__D__") = "__D__" -> %s\n", (INT)(-1), r, ok ? "OK" : "FAIL");
CU_ASSERT(ok)
}
for (i = 0, j = 1; i < 8 * SIZEOF_PTRDIFF_T - 1; i++, j <<= 1)
{
{
INT r = Y(log2i)(j);
INT r2 = _log2i(j);
int ok = r == r2;
printf("log2i("__D__") = "__D__" -> %s\n", j, r, ok ? "OK" : "FAIL");
CU_ASSERT(ok)
}
{
INT r = Y(log2i)(j - 1);
INT r2 = _log2i(j - 1);
int ok = r == r2;
printf("log2i("__D__") = "__D__" -> %s\n", j - 1, r, ok ? "OK" : "FAIL");
CU_ASSERT(ok)
}
}
}
/** Computes /f$n\ge N/f$ such that /f$n=2^j,\, j\in\mathhb{N}_0/f$.
*/
static INT _next_power_of_2(const INT N)
{
INT n,i,logn;
INT N_is_not_power_of_2=0;
if (N == 0)
return 1;
else if (N == 1)
return 2;
else
{
n = N;
logn = 0;
while (n != 1)
{
if (n%2 == 1)
N_is_not_power_of_2=1;
n = n/2;
logn++;
}
if (!N_is_not_power_of_2)
logn--;
for (i = 0; i <= logn; i++)
n = n*2;
return n;
}
}
void X(check_next_power_of_2)(void)
{
INT i;
INT j;
{
INT r = Y(next_power_of_2)(0);
int ok = r == 1;
printf("next_power_of_2("__D__") = "__D__" -> %s\n", (INT)(0), r, ok ? "OK" : "FAIL");
CU_ASSERT(ok)
}
{
INT r = Y(next_power_of_2)(-1);
int ok = r == -1;
printf("log2i("__D__") = "__D__" -> %s\n", (INT)(-1), r, ok ? "OK" : "FAIL");
CU_ASSERT(ok)
}
for (i = 0, j = 1; i < 8 * SIZEOF_PTRDIFF_T - 1; i++, j <<= 1)
{
{
INT r = Y(next_power_of_2)(j);
INT r2 = _next_power_of_2(j);
int ok = r == r2;
printf("next_power_of_2("__D__") = "__D__" -> %s\n", j, r, ok ? "OK" : "FAIL");
CU_ASSERT(ok)
}
{
INT r = Y(next_power_of_2)(j - 1);
INT r2 = _next_power_of_2(j - 1);
int ok = r == r2;
printf("next_power_of_2("__D__") = "__D__" -> %s\n", j - 1, r, ok ? "OK" : "FAIL");
CU_ASSERT(ok)
}
}
}
|
