-
Notifications
You must be signed in to change notification settings - Fork 0
/
NTL-profile.c
423 lines (313 loc) · 9.37 KB
/
NTL-profile.c
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
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
/*============================================================================
This file is part of FLINT.
FLINT 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.
FLINT 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 FLINT; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
===============================================================================*/
/****************************************************************************
NTL-profile.c
Profiling for NTL
Copyright (C) 2007, Tomasz Lechowski, William Hart and David Harvey
*****************************************************************************/
#include <string.h>
#include <math.h>
#include <gmp.h>
#include "profiler-main.h"
#include "flint.h"
#include "memory-manager.h"
#include "fmpz_poly.h"
#include "mpz_poly.h"
#include "test-support.h"
#include <NTL/ZZX.h>
#include <NTL/ZZXFactoring.h>
#include <NTL/ZZ.h>
#include <stdio.h>
//=============================================================================
NTL_CLIENT
// whether to generate signed or unsigned random polys
#define SIGNS 0
unsigned long randint(unsigned long randsup)
{
static unsigned long randval = 4035456057U;
randval = ((unsigned long)randval*1025416097U+286824428U)%(unsigned long)4294967291U;
return (unsigned long)randval%randsup;
}
// ============================================================================
/*
Calls prof2d_sample(length, bits, NULL) for all length, bits combinations
such that length*bits < max_bits, with length and bits spaced out by
the given ratio
*/
void run_triangle(unsigned long max_bits, double ratio)
{
int max_iter = (int) ceil(log((double) max_bits) / log(ratio));
unsigned long last_length = 0;
unsigned long i;
for (i = 0; i <= max_iter; i++)
{
unsigned long length = (unsigned long) floor(powl(ratio, i));
if (length != last_length)
{
last_length = length;
unsigned long last_bits = 0;
unsigned long j;
for (j = 0; j <= max_iter; j++)
{
unsigned long bits = (unsigned long) floor(powl(ratio, j));
if (bits != last_bits)
{
last_bits = bits;
if (bits * length < max_bits)
prof2d_sample(length, bits, NULL);
}
}
}
}
}
// ============================================================================
void sample_NTL_factor(unsigned long length, unsigned long bits,
void* arg, unsigned long count)
{
ZZX poly1, poly2, poly3;
ZZ a, c;
vec_pair_ZZX_long factors;
poly1.SetMaxLength(length);
//poly2.SetMaxLength(length);
//poly3.SetMaxLength(2*length-1);
unsigned long r_count; // how often to generate new random data
if (count >= 1000) r_count = 100;
else if (count >= 100) r_count = 10;
else if (count >= 20) r_count = 5;
else if (count >= 8) r_count = 2;
else r_count = 1;
unsigned long i;
for (i = 0; i < count; i++)
{
if (i%r_count == 0)
{
unsigned long j;
for (j = 0; j<length; j++)
{
RandomBits(a,bits);
SetCoeff(poly1,j,a);
//RandomBits(a,bits);
//SetCoeff(poly2,j,a);
}
//mul(poly3, poly1, poly2);
}
prof_start();
factor(c, factors, poly1);
prof_stop();
}
}
char* profDriverString_NTL_factor(char* params)
{
return "NTL_factor factors polynomials of various lengths and various bit sizes.\n"
"Parameters are: max bitsize; ratio between consecutive lengths/bitsizes.";
}
char* profDriverDefaultParams_NTL_factor()
{
return "10000 1.2";
}
void profDriver_NTL_factor(char* params)
{
unsigned long max_bits;
double ratio;
sscanf(params, "%ld %lf", &max_bits, &ratio);
test_support_init();
prof2d_set_sampler(sample_NTL_factor);
run_triangle(max_bits, ratio);
test_support_cleanup();
}
// ============================================================================
void sample_NTL_poly_mul(unsigned long length, unsigned long bits,
void* arg, unsigned long count)
{
ZZX poly1;
ZZX poly2;
ZZX poly3;
ZZ a;
poly1.SetMaxLength(length);
poly2.SetMaxLength(length);
poly3.SetMaxLength(2*length-1);
unsigned long r_count; // how often to generate new random data
if (count >= 1000) r_count = 100;
else if (count >= 100) r_count = 10;
else if (count >= 20) r_count = 5;
else if (count >= 8) r_count = 2;
else r_count = 1;
unsigned long i;
for (i = 0; i < count; i++)
{
if (i%r_count == 0)
{
unsigned long j;
for (j = 0; j<length; j++)
{
RandomBits(a,bits);
SetCoeff(poly1,j,a);
RandomBits(a,bits);
SetCoeff(poly2,j,a);
}
}
prof_start();
mul(poly3, poly1, poly2);
prof_stop();
}
}
char* profDriverString_NTL_poly_mul(char* params)
{
return "NTL_poly_mul over various lengths and various bit sizes.\n"
"Parameters are: max bitsize; ratio between consecutive lengths/bitsizes.";
}
char* profDriverDefaultParams_NTL_poly_mul()
{
return "16000000 1.2";
}
void profDriver_NTL_poly_mul(char* params)
{
unsigned long max_bits;
double ratio;
sscanf(params, "%ld %lf", &max_bits, &ratio);
test_support_init();
prof2d_set_sampler(sample_NTL_poly_mul);
run_triangle(max_bits, ratio);
test_support_cleanup();
}
// ============================================================================
void sample_NTL_poly_div1(unsigned long length, unsigned long bits,
void* arg, unsigned long count)
{
ZZX poly1;
ZZX poly2;
ZZX poly3;
ZZ a;
poly1.SetMaxLength(length);
poly2.SetMaxLength(length);
poly3.SetMaxLength(2*length-1);
unsigned long r_count; // how often to generate new random data
if (count >= 10000) r_count = 100;
else if (count >= 100) r_count = 10;
else if (count >= 20) r_count = 4;
else if (count >= 8) r_count = 2;
else r_count = 1;
unsigned long i;
for (i = 0; i < count; i++)
{
if (i%r_count == 0)
{
do
{
unsigned long j;
for (j = 0; j < length; j++)
{
RandomBits(a,bits);
SetCoeff(poly1,j,a);
}
} while (IsZero(poly1));
unsigned long j;
for (j = 0; j < length; j++)
{
RandomBits(a,bits);
SetCoeff(poly2,j,a);
}
}
mul(poly3, poly1, poly2);
prof_start();
unsigned long count2;
for (count2 = 0; count2 < r_count; count2++)
{
divide(poly2, poly3, poly1);
}
prof_stop();
i += (r_count-1);
}
}
char* profDriverString_NTL_poly_div1(char* params)
{
return "NTL_poly_div1 over various lengths and various bit sizes.\n"
"Parameters are: max bitsize; ratio between consecutive lengths/bitsizes.";
}
char* profDriverDefaultParams_NTL_poly_div1()
{
return "1000000 1.2";
}
void profDriver_NTL_poly_div1(char* params)
{
unsigned long max_bits;
double ratio;
sscanf(params, "%ld %lf", &max_bits, &ratio);
test_support_init();
prof2d_set_sampler(sample_NTL_poly_div1);
run_triangle(max_bits, ratio);
test_support_cleanup();
}
// ============================================================================
void sample_NTL_poly_div2(unsigned long length, unsigned long bits,
void* arg, unsigned long count)
{
ZZX poly1;
ZZX poly2;
ZZX poly3;
ZZ a;
poly1.SetMaxLength(length);
poly2.SetMaxLength(length);
poly3.SetMaxLength(2*length-1);
unsigned long r_count; // how often to generate new random data
if (count >= 1000) r_count = 100;
else if (count >= 100) r_count = 10;
else if (count >= 20) r_count = 5;
else if (count >= 8) r_count = 2;
else r_count = 1;
unsigned long i;
for (i = 0; i < count; i++)
{
if (i%r_count == 0)
{
unsigned long j;
for (j = 0; j<length-1; j++)
{
RandomBits(a,bits);
SetCoeff(poly1,j,a);
}
SetCoeff(poly1,length-1,1);
unsigned long j;
for (j = 0; j<2*length-1; j++)
{
RandomBits(a,bits);
SetCoeff(poly3,j,a);
}
}
prof_start();
div(poly2, poly3, poly1);
prof_stop();
}
}
char* profDriverString_NTL_poly_div2(char* params)
{
return "NTL_poly_div2 over various lengths and various bit sizes.\n"
"Parameters are: max bitsize; ratio between consecutive lengths/bitsizes.";
}
char* profDriverDefaultParams_NTL_poly_div2()
{
return "1100000 1.77827941";
}
void profDriver_NTL_poly_div2(char* params)
{
unsigned long max_bits;
double ratio;
sscanf(params, "%ld %lf", &max_bits, &ratio);
test_support_init();
prof2d_set_sampler(sample_NTL_poly_div2);
run_triangle(max_bits, ratio);
test_support_cleanup();
}
// end of file ****************************************************************