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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
|
#include "benchmark.h"
#include <limits.h>
enum {
HIGH_ONLY,
HIGH_AND_LOW,
HALF,
FULL
};
struct function {
const char *name;
void (*f)(z_t *, z_t *, struct function *);
size_t a_start;
size_t a_end;
size_t a_step;
int a_mode;
size_t b_start;
size_t b_end;
size_t b_step;
int b_mode;
size_t runs;
size_t measurements;
};
#define M_MAX 200
static char buf[1000];
static z_t temp, temp2;
static unsigned long long int measurements[M_MAX];
#if 1
static int
measurementpcmp(const void *ap_, const void *bp_)
{
const unsigned long long int *ap = ap_, *bp = bp_;
return *ap < *bp ? -1 : *ap > *bp;
}
# if 0
static unsigned long long int
gettime(size_t m)
{
qsort(measurements, m, sizeof(*measurements), measurementpcmp);
if (m & 1)
return measurements[m / 2];
return (measurements[m / 2] + measurements[m / 2 - 1]) / 2;
}
# else
static unsigned long long int
gettime(size_t m)
{
# define X 2 / 7
size_t i = m * X, n = m - m * X;
unsigned long long int tot = 0;
qsort(measurements, m, sizeof(*measurements), measurementpcmp);
for (; i < n; i++)
tot += measurements[i];
return tot / (n - m * X);
# undef X
}
# endif
#elif 0
static unsigned long long int
gettime(size_t m)
{
unsigned long long int tot = 0;
size_t i = m;
while (i--)
tot += measurements[i];
return tot / m;
}
#else
static unsigned long long int
gettime(size_t m)
{
unsigned long long int best = ULLONG_MAX;
size_t i = m;
while (i--)
if (best > measurements[i])
best = measurements[i];
return best;
}
#endif
#define FUNCTION_2D(NAME, INSTRUCTION, PREINSTRUCTION)\
void\
NAME(z_t *as, z_t* bs, struct function *f)\
{\
size_t i, j, k, n = f->a_end - f->a_start + 1;\
z_t *a;\
zmul(temp, as[n - 1], as[n - 1]);\
zadd(temp, temp, temp);\
for (i = 0; i < n; i += f->a_step) {\
a = as + i;\
zset(temp2, *a);\
PREINSTRUCTION;\
k = f->measurements;\
while (k--) {\
INSTRUCTION;\
INSTRUCTION;\
j = f->runs;\
TIC;\
while (j--) {\
INSTRUCTION;\
}\
TOC;\
measurements[k] = TICKS;\
}\
printf("%llu\n", gettime(f->measurements));\
a++;\
}\
(void) bs;\
}
#define FAST2D(P) 1, 4097, 64, P, 0, 0, 0, 0, 1000, M_MAX
#define SLOW2D(P) 1, 4097, 64, P, 0, 0, 0, 0, 10, 20
#define LIST_2D_FUNCTIONS\
X(zset, FAST2D(FULL), zset(temp, *a),)\
X(zneg, FAST2D(FULL), zneg(temp, *a),)\
X(zabs, FAST2D(FULL), zabs(temp, *a),)\
X(self_zneg, FAST2D(FULL), zneg(*a, *a),)\
X(self_zabs, FAST2D(FULL), zabs(*a, *a),)\
X(zadd_unsigned, FAST2D(FULL), zadd_unsigned(temp, *a, temp2),)\
X(zsub_unsigned, FAST2D(FULL), zsub_unsigned(temp, *a, temp2),)\
X(zadd, FAST2D(FULL), zadd(temp, *a, temp2),)\
X(zsub, FAST2D(FULL), zsub(temp, *a, temp2),)\
X(zand, FAST2D(FULL), zand(temp, *a, temp2),)\
X(zor, FAST2D(FULL), zor(temp, *a, temp2),)\
X(zxor, FAST2D(FULL), zxor(temp, *a, temp2),)\
X(znot, FAST2D(FULL), znot(temp, *a),)\
X(zeven, FAST2D(FULL), zeven(*a),)\
X(zodd, FAST2D(FULL), zodd(*a),)\
X(zeven_nonzero, FAST2D(FULL), zeven_nonzero(*a),)\
X(zodd_nonzero, FAST2D(FULL), zodd_nonzero(*a),)\
X(zzero, FAST2D(FULL), zzero(*a),)\
X(zsignum, FAST2D(FULL), zsignum(*a),)\
X(zbits, FAST2D(FULL), zbits(*a),)\
X(zlsb, FAST2D(HIGH_ONLY), zlsb(*a),)\
X(zswap, FAST2D(FULL), zswap(temp, *a),)\
X(zcmpmag, FAST2D(FULL), zcmpmag(temp2, *a),)\
X(zcmp, FAST2D(FULL), zcmp(temp2, *a),)\
X(sqr_zmul, SLOW2D(FULL), zmul(temp, *a, temp2),)\
X(zsqr, SLOW2D(FULL), zsqr(temp, *a),)\
X(zstr_length, SLOW2D(FULL), zstr_length(*a, 10),)\
X(zstr, SLOW2D(FULL), zstr(*a, buf, sizeof(buf) - 1),)\
X(auto_zstr, SLOW2D(FULL), zstr(*a, buf, 0),)\
X(zsave, FAST2D(FULL), zsave(*a, buf),)\
X(zload, FAST2D(FULL), zload(temp, buf), zsave(*a, buf))\
X(zbset_set, FAST2D(FULL), zbset(temp, *a, 2, 1),)\
X(zbset_clear, FAST2D(FULL), zbset(temp, *a, 2, 0),)\
X(zbset_flip, FAST2D(FULL), zbset(temp, *a, 2, -1),)\
X(self_zbset_set, FAST2D(FULL), zbset(temp2, temp2, 2, 1),)\
X(self_zbset_clear, FAST2D(FULL), zbset(temp2, temp2, 2, 0),)\
X(self_zbset_flip, FAST2D(FULL), zbset(temp2, temp2, 2, -1),)\
X(zbtest, FAST2D(FULL), zbtest(*a, 2),)\
X(zptest, FAST2D(FULL), zptest(temp, *a, 5),)\
X(zsets, FAST2D(FULL), zsets(temp, buf), zstr(*a, buf, sizeof(buf) - 1))\
X(zlsh, FAST2D(FULL), zlsh(temp, *a, 1),)\
X(zrsh, FAST2D(FULL), zrsh(temp, *a, 1),)\
X(ztrunc, FAST2D(FULL), ztrunc(temp, *a, i / 2),)\
X(self_ztrunc, FAST2D(FULL), ztrunc(*a, *a, i),)\
X(zsplit, FAST2D(FULL), zsplit(temp, temp2, *a, i / 2),)
/* TODO
zgcd
zpow
zpowu
zmodpow
zmodpowu
zrand
zdiv
zmod
zdivmod
zmul
zmodmul
sqr_zmodmul
zmodsqr
zdiv
zmod
zdivmod
*/
#define X(FN, A, F1, F2) FUNCTION_2D(bench_##FN, F1, F2)
LIST_2D_FUNCTIONS
#undef X
struct function functions[] = {
#define X(FN, A, F1, F2) {#FN, bench_##FN, A},
LIST_2D_FUNCTIONS
#undef X
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}
};
static z_t *
create_ints(size_t start, size_t end, int mode)
{
z_t *array = malloc((end - start + 1) * sizeof(z_t));
z_t *rc = array;
ssize_t n;
for (; start <= end; start++, array++) {
zinit(*array);
switch (mode) {
case HIGH_ONLY:
zsetu(temp, 1);
zlsh(*array, temp, start - 1);
break;
case HIGH_AND_LOW:
zsetu(temp, 1);
zlsh(*array, temp, start - 1);
if (start > 1)
zadd(*array, *array, temp);
break;
case HALF:
n = (ssize_t)start;
zsetu(temp, 1 << (~start & 1));
zsetu(*array, 0);
for (; n > 0; n -= 2) {
zlsh(*array, *array, 2);
zadd(*array, *array, temp);
}
break;
case FULL:
zsetu(temp, 1);
zlsh(*array, temp, start);
zsub(*array, *array, temp);
break;
default:
abort();
}
}
return rc;
}
static void
destroy_ints(z_t *array, size_t start, size_t end)
{
z_t *array_ = array;
for (; start <= end; start++)
zfree(*array++);
free(array_);
}
int
main(int argc, char *argv[])
{
struct function *fs = functions;
jmp_buf jmp;
z_t *as = 0, *bs = 0;
if (argc != 2) {
fprintf(stderr, "usage: %s function\n", *argv);
return 2;
}
benchmark_init();
if (setjmp(jmp)) {
zperror(argv[0]);
return 1;
}
zsetup(jmp);
printf("%s\n", BIGINT_LIBRARY);
zinit(temp);
zinit(temp2);
for (; fs->name && strcmp(fs->name, argv[1]); fs++);
if (!fs->name) {
fprintf(stderr, "%s: function not recognised: %s\n", *argv, argv[1]);
return 2;
}
if (fs->b_end) {
as = create_ints(fs->a_start, fs->a_end, fs->a_mode);
bs = create_ints(fs->b_start, fs->b_end, fs->b_mode);
printf("3\n%zu %zu %zu\n%zu %zu %zu\n",
fs->a_start, fs->a_end, fs->a_step,
fs->b_start, fs->b_end, fs->b_step);
} else {
as = create_ints(fs->a_start, fs->a_end, fs->a_mode);
printf("2\n%zu %zu %zu\n", fs->a_start, fs->a_end, fs->a_step);
}
fs->f(as, bs, fs);
if (as)
destroy_ints(as, fs->a_start, fs->a_end);
if (bs)
destroy_ints(bs, fs->b_start, fs->b_end);
zfree(temp);
zfree(temp2);
zunsetup();
return 0;
}
|
