-
Notifications
You must be signed in to change notification settings - Fork 57
/
bench_pffft.c
1402 lines (1233 loc) · 43.3 KB
/
bench_pffft.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
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
Copyright (c) 2013 Julien Pommier.
Copyright (c) 2019 Hayati Ayguen ( h_ayguen@web.de )
Small test & bench for PFFFT, comparing its performance with the scalar FFTPACK, FFTW, Intel MKL, and Apple vDSP
How to build:
on linux, with fftw3:
gcc -o test_pffft -DHAVE_FFTW -msse -mfpmath=sse -O3 -Wall -W pffft.c test_pffft.c fftpack.c -L/usr/local/lib -I/usr/local/include/ -lfftw3f -lm
on macos, without fftw3:
clang -o test_pffft -DHAVE_VECLIB -O3 -Wall -W pffft.c test_pffft.c fftpack.c -L/usr/local/lib -I/usr/local/include/ -framework Accelerate
on macos, with fftw3:
clang -o test_pffft -DHAVE_FFTW -DHAVE_VECLIB -O3 -Wall -W pffft.c test_pffft.c fftpack.c -L/usr/local/lib -I/usr/local/include/ -lfftw3f -framework Accelerate
as alternative: replace clang by gcc.
on macos, with fftw3 and Intel MKL:
clang -o test_pffft -I /opt/intel/mkl/include -DHAVE_FFTW -DHAVE_VECLIB -DHAVE_MKL -O3 -Wall -W pffft.c test_pffft.c fftpack.c -L/usr/local/lib -I/usr/local/include/ -lfftw3f -framework Accelerate /opt/intel/mkl/lib/libmkl_{intel_lp64,sequential,core}.a
on windows, with visual c++:
cl /Ox -D_USE_MATH_DEFINES /arch:SSE test_pffft.c pffft.c fftpack.c
build without SIMD instructions:
gcc -o test_pffft -DPFFFT_SIMD_DISABLE -O3 -Wall -W pffft.c test_pffft.c fftpack.c -lm
*/
#define CONCAT_TOKENS(A, B) A ## B
#define CONCAT_THREE_TOKENS(A, B, C) A ## B ## C
#ifdef PFFFT_ENABLE_FLOAT
#include "pffft.h"
typedef float pffft_scalar;
typedef PFFFT_Setup PFFFT_SETUP;
#define PFFFT_FUNC(F) CONCAT_TOKENS(pffft_, F)
#else
/*
Note: adapted for double precision dynamic range version.
*/
#include "pffft_double.h"
typedef double pffft_scalar;
typedef PFFFTD_Setup PFFFT_SETUP;
#define PFFFT_FUNC(F) CONCAT_TOKENS(pffftd_, F)
#endif
#ifdef HAVE_FFTPACK
#include "fftpack.h"
#endif
#ifdef PFFFT_ENABLE_FLOAT
#ifdef HAVE_GREEN_FFTS
#include "fftext.h"
#endif
#ifdef HAVE_KISS_FFT
#include <kiss_fft.h>
#include <kiss_fftr.h>
#endif
#endif
#ifdef HAVE_POCKET_FFT
#include <pocketfft_double.h>
#include <pocketfft_single.h>
#endif
#ifdef PFFFT_ENABLE_FLOAT
#define POCKFFTR_PRE(R) CONCAT_TOKENS(rffts, R)
#define POCKFFTC_PRE(R) CONCAT_TOKENS(cffts, R)
#define POCKFFTR_MID(L,R) CONCAT_THREE_TOKENS(L, rffts, R)
#define POCKFFTC_MID(L,R) CONCAT_THREE_TOKENS(L, cffts, R)
#else
#define POCKFFTR_PRE(R) CONCAT_TOKENS(rfft, R)
#define POCKFFTC_PRE(R) CONCAT_TOKENS(cfft, R)
#define POCKFFTR_MID(L,R) CONCAT_THREE_TOKENS(L, rfft, R)
#define POCKFFTC_MID(L,R) CONCAT_THREE_TOKENS(L, cfft, R)
#endif
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <assert.h>
#include <string.h>
#ifdef HAVE_SYS_TIMES
# include <sys/times.h>
# include <unistd.h>
#endif
#ifdef HAVE_VECLIB
# include <Accelerate/Accelerate.h>
#endif
#ifdef HAVE_FFTW
# include <fftw3.h>
#ifdef PFFFT_ENABLE_FLOAT
typedef fftwf_plan FFTW_PLAN;
typedef fftwf_complex FFTW_COMPLEX;
#define FFTW_FUNC(F) CONCAT_TOKENS(fftwf_, F)
#else
typedef fftw_plan FFTW_PLAN;
typedef fftw_complex FFTW_COMPLEX;
#define FFTW_FUNC(F) CONCAT_TOKENS(fftw_, F)
#endif
#endif /* HAVE_FFTW */
#ifdef HAVE_MKL
# include <mkl/mkl_dfti.h>
#endif
#ifndef M_LN2
#define M_LN2 0.69314718055994530942 /* log_e 2 */
#endif
#define NUM_FFT_ALGOS 10
enum {
ALGO_FFTPACK = 0,
ALGO_VECLIB,
ALGO_FFTW_ESTIM,
ALGO_FFTW_AUTO,
ALGO_GREEN,
ALGO_KISS,
ALGO_POCKET,
ALGO_MKL,
ALGO_PFFFT_U, /* = 8 */
ALGO_PFFFT_O /* = 9 */
};
#define NUM_TYPES 7
enum {
TYPE_PREP = 0, /* time for preparation in ms */
TYPE_DUR_NS = 1, /* time per fft in ns */
TYPE_DUR_FASTEST = 2, /* relative time to fastest */
TYPE_REL_PFFFT = 3, /* relative time to ALGO_PFFFT */
TYPE_ITER = 4, /* # of iterations in measurement */
TYPE_MFLOPS = 5, /* MFlops/sec */
TYPE_DUR_TOT = 6 /* test duration in sec */
};
/* double tmeas[NUM_TYPES][NUM_FFT_ALGOS]; */
const char * algoName[NUM_FFT_ALGOS] = {
"FFTPack ",
"vDSP (vec) ",
"FFTW F(estim)",
"FFTW F(auto) ",
"Green ",
"Kiss ",
"Pocket ",
"Intel MKL ",
"PFFFT-U(simd)", /* unordered */
"PFFFT (simd) " /* ordered */
};
int compiledInAlgo[NUM_FFT_ALGOS] = {
#ifdef HAVE_FFTPACK
1, /* "FFTPack " */
#else
0, /* "FFTPack " */
#endif
#if defined(HAVE_VECLIB) && defined(PFFFT_ENABLE_FLOAT)
1, /* "vDSP (vec) " */
#else
0,
#endif
#if defined(HAVE_FFTW)
1, /* "FFTW(estim)" */
1, /* "FFTW (auto)" */
#else
0, 0,
#endif
#if defined(HAVE_GREEN_FFTS) && defined(PFFFT_ENABLE_FLOAT)
1, /* "Green " */
#else
0,
#endif
#if defined(HAVE_KISS_FFT) && defined(PFFFT_ENABLE_FLOAT)
1, /* "Kiss " */
#else
0,
#endif
#if defined(HAVE_POCKET_FFT)
1, /* "Pocket " */
#else
0,
#endif
#if defined(HAVE_MKL)
1, /* "Intel MKL " */
#else
0,
#endif
1, /* "PFFFT_U " */
1 /* "PFFFT_O " */
};
const char * algoTableHeader[NUM_FFT_ALGOS][2] = {
{ "| real FFTPack ", "| cplx FFTPack " },
{ "| real vDSP ", "| cplx vDSP " },
{ "|real FFTWestim", "|cplx FFTWestim" },
{ "|real FFTWauto ", "|cplx FFTWauto " },
{ "| real Green ", "| cplx Green " },
{ "| real Kiss ", "| cplx Kiss " },
{ "| real Pocket ", "| cplx Pocket " },
{ "| real MKL ", "| cplx MKL " },
{ "| real PFFFT-U ", "| cplx PFFFT-U " },
{ "| real PFFFT ", "| cplx PFFFT " } };
const char * typeText[NUM_TYPES] = {
"preparation in ms",
"time per fft in ns",
"relative to fastest",
"relative to pffft",
"measured_num_iters",
"mflops",
"test duration in sec"
};
const char * typeFilenamePart[NUM_TYPES] = {
"1-preparation-in-ms",
"2-timePerFft-in-ns",
"3-rel-fastest",
"4-rel-pffft",
"5-num-iter",
"6-mflops",
"7-duration-in-sec"
};
#define SAVE_ALL_TYPES 0
const int saveType[NUM_TYPES] = {
1, /* "1-preparation-in-ms" */
0, /* "2-timePerFft-in-ns" */
0, /* "3-rel-fastest" */
1, /* "4-rel-pffft" */
1, /* "5-num-iter" */
1, /* "6-mflops" */
1, /* "7-duration-in-sec" */
};
#define MAX(x,y) ((x)>(y)?(x):(y))
#define MIN(x,y) ((x)<(y)?(x):(y))
unsigned Log2(unsigned v) {
/* we don't need speed records .. obvious way is good enough */
/* https://graphics.stanford.edu/~seander/bithacks.html#IntegerLogObvious */
/* Find the log base 2 of an integer with the MSB N set in O(N) operations (the obvious way):
* unsigned v: 32-bit word to find the log base 2 of */
unsigned r = 0; /* r will be lg(v) */
while (v >>= 1)
{
r++;
}
return r;
}
double frand() {
return rand()/(double)RAND_MAX;
}
#if defined(HAVE_SYS_TIMES)
inline double uclock_sec(void) {
static double ttclk = 0.;
struct tms t;
if (ttclk == 0.)
ttclk = sysconf(_SC_CLK_TCK);
times(&t);
/* use only the user time of this process - not realtime, which depends on OS-scheduler .. */
return ((double)t.tms_utime)) / ttclk;
}
# else
double uclock_sec(void)
{ return (double)clock()/(double)CLOCKS_PER_SEC; }
#endif
/* compare results with the regular fftpack */
int pffft_validate_N(int N, int cplx) {
#ifdef HAVE_FFTPACK
int Nfloat = N*(cplx?2:1);
int Nbytes = Nfloat * sizeof(pffft_scalar);
pffft_scalar *ref, *in, *out, *tmp, *tmp2;
PFFFT_SETUP *s = PFFFT_FUNC(new_setup)(N, cplx ? PFFFT_COMPLEX : PFFFT_REAL);
int pass;
if (!s) { printf("Skipping N=%d, not supported\n", N); return 0; }
ref = PFFFT_FUNC(aligned_malloc)(Nbytes);
in = PFFFT_FUNC(aligned_malloc)(Nbytes);
out = PFFFT_FUNC(aligned_malloc)(Nbytes);
tmp = PFFFT_FUNC(aligned_malloc)(Nbytes);
tmp2 = PFFFT_FUNC(aligned_malloc)(Nbytes);
for (pass=0; pass < 2; ++pass) {
float ref_max = 0;
int k;
/* printf("N=%d pass=%d cplx=%d\n", N, pass, cplx); */
/* compute reference solution with FFTPACK */
if (pass == 0) {
fftpack_real *wrk = malloc(2*Nbytes+15*sizeof(pffft_scalar));
for (k=0; k < Nfloat; ++k) {
ref[k] = in[k] = (float)( frand()*2-1 );
out[k] = 1e30F;
}
if (!cplx) {
rffti(N, wrk);
rfftf(N, ref, wrk);
/* use our ordering for real ffts instead of the one of fftpack */
{
float refN=ref[N-1];
for (k=N-2; k >= 1; --k) ref[k+1] = ref[k];
ref[1] = refN;
}
} else {
cffti(N, wrk);
cfftf(N, ref, wrk);
}
free(wrk);
}
for (k = 0; k < Nfloat; ++k) ref_max = MAX(ref_max, (float)( fabs(ref[k]) ));
/* pass 0 : non canonical ordering of transform coefficients */
if (pass == 0) {
/* test forward transform, with different input / output */
PFFFT_FUNC(transform)(s, in, tmp, 0, PFFFT_FORWARD);
memcpy(tmp2, tmp, Nbytes);
memcpy(tmp, in, Nbytes);
PFFFT_FUNC(transform)(s, tmp, tmp, 0, PFFFT_FORWARD);
for (k = 0; k < Nfloat; ++k) {
assert(tmp2[k] == tmp[k]);
}
/* test reordering */
PFFFT_FUNC(zreorder)(s, tmp, out, PFFFT_FORWARD);
PFFFT_FUNC(zreorder)(s, out, tmp, PFFFT_BACKWARD);
for (k = 0; k < Nfloat; ++k) {
assert(tmp2[k] == tmp[k]);
}
PFFFT_FUNC(zreorder)(s, tmp, out, PFFFT_FORWARD);
} else {
/* pass 1 : canonical ordering of transform coeffs. */
PFFFT_FUNC(transform_ordered)(s, in, tmp, 0, PFFFT_FORWARD);
memcpy(tmp2, tmp, Nbytes);
memcpy(tmp, in, Nbytes);
PFFFT_FUNC(transform_ordered)(s, tmp, tmp, 0, PFFFT_FORWARD);
for (k = 0; k < Nfloat; ++k) {
assert(tmp2[k] == tmp[k]);
}
memcpy(out, tmp, Nbytes);
}
{
for (k=0; k < Nfloat; ++k) {
if (!(fabs(ref[k] - out[k]) < 1e-3*ref_max)) {
printf("%s forward PFFFT mismatch found for N=%d\n", (cplx?"CPLX":"REAL"), N);
return 1;
}
}
if (pass == 0) PFFFT_FUNC(transform)(s, tmp, out, 0, PFFFT_BACKWARD);
else PFFFT_FUNC(transform_ordered)(s, tmp, out, 0, PFFFT_BACKWARD);
memcpy(tmp2, out, Nbytes);
memcpy(out, tmp, Nbytes);
if (pass == 0) PFFFT_FUNC(transform)(s, out, out, 0, PFFFT_BACKWARD);
else PFFFT_FUNC(transform_ordered)(s, out, out, 0, PFFFT_BACKWARD);
for (k = 0; k < Nfloat; ++k) {
assert(tmp2[k] == out[k]);
out[k] *= 1.f/N;
}
for (k = 0; k < Nfloat; ++k) {
if (fabs(in[k] - out[k]) > 1e-3 * ref_max) {
printf("pass=%d, %s IFFFT does not match for N=%d\n", pass, (cplx?"CPLX":"REAL"), N); break;
return 1;
}
}
}
/* quick test of the circular convolution in fft domain */
{
float conv_err = 0, conv_max = 0;
PFFFT_FUNC(zreorder)(s, ref, tmp, PFFFT_FORWARD);
memset(out, 0, Nbytes);
PFFFT_FUNC(zconvolve_accumulate)(s, ref, ref, out, 1.0);
PFFFT_FUNC(zreorder)(s, out, tmp2, PFFFT_FORWARD);
for (k=0; k < Nfloat; k += 2) {
float ar = tmp[k], ai=tmp[k+1];
if (cplx || k > 0) {
tmp[k] = ar*ar - ai*ai;
tmp[k+1] = 2*ar*ai;
} else {
tmp[0] = ar*ar;
tmp[1] = ai*ai;
}
}
for (k=0; k < Nfloat; ++k) {
float d = fabs(tmp[k] - tmp2[k]), e = fabs(tmp[k]);
if (d > conv_err) conv_err = d;
if (e > conv_max) conv_max = e;
}
if (conv_err > 1e-5*conv_max) {
printf("zconvolve error ? %g %g\n", conv_err, conv_max);
return 1;
}
}
}
printf("%s PFFFT is OK for N=%d\n", (cplx?"CPLX":"REAL"), N); fflush(stdout);
PFFFT_FUNC(destroy_setup)(s);
PFFFT_FUNC(aligned_free)(ref);
PFFFT_FUNC(aligned_free)(in);
PFFFT_FUNC(aligned_free)(out);
PFFFT_FUNC(aligned_free)(tmp);
PFFFT_FUNC(aligned_free)(tmp2);
return 0;
#else
return 2;
#endif /* HAVE_FFTPACK */
}
int pffft_validate(int cplx) {
static int Ntest[] = { 16, 32, 64, 96, 128, 160, 192, 256, 288, 384, 5*96, 512, 576, 5*128, 800, 864, 1024, 2048, 2592, 4000, 4096, 12000, 36864, 0};
int k, r;
for (k = 0; Ntest[k]; ++k) {
int N = Ntest[k];
if (N == 16 && !cplx) continue;
r = pffft_validate_N(N, cplx);
if (r)
return r;
}
return 0;
}
int array_output_format = 1;
void print_table(const char *txt, FILE *tableFile) {
fprintf(stdout, "%s", txt);
if (tableFile && tableFile != stdout)
fprintf(tableFile, "%s", txt);
}
void print_table_flops(float mflops, FILE *tableFile) {
fprintf(stdout, "|%11.0f ", mflops);
if (tableFile && tableFile != stdout)
fprintf(tableFile, "|%11.0f ", mflops);
}
void print_table_fftsize(int N, FILE *tableFile) {
fprintf(stdout, "|%9d ", N);
if (tableFile && tableFile != stdout)
fprintf(tableFile, "|%9d ", N);
}
double show_output(const char *name, int N, int cplx, float flops, float t0, float t1, int max_iter, FILE *tableFile) {
double T = (double)(t1-t0)/2/max_iter * 1e9;
float mflops = flops/1e6/(t1 - t0 + 1e-16);
if (array_output_format) {
if (flops != -1)
print_table_flops(mflops, tableFile);
else
print_table("| n/a ", tableFile);
} else {
if (flops != -1) {
printf("N=%5d, %s %16s : %6.0f MFlops [t=%6.0f ns, %d runs]\n", N, (cplx?"CPLX":"REAL"), name, mflops, (t1-t0)/2/max_iter * 1e9, max_iter);
}
}
fflush(stdout);
return T;
}
double cal_benchmark(int N, int cplx) {
const int log2N = Log2(N);
int Nfloat = (cplx ? N*2 : N);
int Nbytes = Nfloat * sizeof(pffft_scalar);
pffft_scalar *X = PFFFT_FUNC(aligned_malloc)(Nbytes), *Y = PFFFT_FUNC(aligned_malloc)(Nbytes), *Z = PFFFT_FUNC(aligned_malloc)(Nbytes);
double t0, t1, tstop, T, nI;
int k, iter;
assert( PFFFT_FUNC(is_power_of_two)(N) );
for (k = 0; k < Nfloat; ++k) {
X[k] = sqrtf(k+1);
}
/* PFFFT-U (unordered) benchmark */
PFFFT_SETUP *s = PFFFT_FUNC(new_setup)(N, cplx ? PFFFT_COMPLEX : PFFFT_REAL);
assert(s);
iter = 0;
t0 = uclock_sec();
tstop = t0 + 0.25; /* benchmark duration: 250 ms */
do {
for ( k = 0; k < 512; ++k ) {
PFFFT_FUNC(transform)(s, X, Z, Y, PFFFT_FORWARD);
PFFFT_FUNC(transform)(s, X, Z, Y, PFFFT_BACKWARD);
++iter;
}
t1 = uclock_sec();
} while ( t1 < tstop );
PFFFT_FUNC(destroy_setup)(s);
PFFFT_FUNC(aligned_free)(X);
PFFFT_FUNC(aligned_free)(Y);
PFFFT_FUNC(aligned_free)(Z);
T = ( t1 - t0 ); /* duration per fft() */
nI = ((double)iter) * ( log2N * N ); /* number of iterations "normalized" to O(N) = N*log2(N) */
return (nI / T); /* normalized iterations per second */
}
void benchmark_ffts(int N, int cplx, int withFFTWfullMeas, double iterCal, double tmeas[NUM_TYPES][NUM_FFT_ALGOS], int haveAlgo[NUM_FFT_ALGOS], FILE *tableFile ) {
const int log2N = Log2(N);
int nextPow2N = PFFFT_FUNC(next_power_of_two)(N);
int log2NextN = Log2(nextPow2N);
int pffftPow2N = nextPow2N;
int Nfloat = (cplx ? MAX(nextPow2N, pffftPow2N)*2 : MAX(nextPow2N, pffftPow2N));
int Nmax, k, iter;
int Nbytes = Nfloat * sizeof(pffft_scalar);
pffft_scalar *X = PFFFT_FUNC(aligned_malloc)(Nbytes + sizeof(pffft_scalar)), *Y = PFFFT_FUNC(aligned_malloc)(Nbytes + 2*sizeof(pffft_scalar) ), *Z = PFFFT_FUNC(aligned_malloc)(Nbytes);
double te, t0, t1, tstop, flops, Tfastest;
const double max_test_duration = 0.150; /* test duration 150 ms */
double numIter = max_test_duration * iterCal / ( log2N * N ); /* number of iteration for max_test_duration */
const int step_iter = MAX(1, ((int)(0.01 * numIter)) ); /* one hundredth */
int max_iter = MAX(1, ((int)numIter) ); /* minimum 1 iteration */
const float checkVal = 12345.0F;
/* printf("benchmark_ffts(N = %d, cplx = %d): Nfloat = %d, X_mem = 0x%p, X = %p\n", N, cplx, Nfloat, X_mem, X); */
memset( X, 0, Nfloat * sizeof(pffft_scalar) );
if ( Nfloat < 32 ) {
for (k = 0; k < Nfloat; k += 4)
X[k] = sqrtf(k+1);
} else {
for (k = 0; k < Nfloat; k += (Nfloat/16) )
X[k] = sqrtf(k+1);
}
for ( k = 0; k < NUM_TYPES; ++k )
{
for ( iter = 0; iter < NUM_FFT_ALGOS; ++iter )
tmeas[k][iter] = 0.0;
}
/* FFTPack benchmark */
Nmax = (cplx ? N*2 : N);
X[Nmax] = checkVal;
#ifdef HAVE_FFTPACK
{
fftpack_real *wrk = malloc(2*Nbytes + 15*sizeof(pffft_scalar));
te = uclock_sec();
if (cplx) cffti(N, wrk);
else rffti(N, wrk);
t0 = uclock_sec();
tstop = t0 + max_test_duration;
max_iter = 0;
do {
for ( k = 0; k < step_iter; ++k ) {
if (cplx) {
assert( X[Nmax] == checkVal );
cfftf(N, X, wrk);
assert( X[Nmax] == checkVal );
cfftb(N, X, wrk);
assert( X[Nmax] == checkVal );
} else {
assert( X[Nmax] == checkVal );
rfftf(N, X, wrk);
assert( X[Nmax] == checkVal );
rfftb(N, X, wrk);
assert( X[Nmax] == checkVal );
}
++max_iter;
}
t1 = uclock_sec();
} while ( t1 < tstop );
free(wrk);
flops = (max_iter*2) * ((cplx ? 5 : 2.5)*N*log((double)N)/M_LN2); /* see http://www.fftw.org/speed/method.html */
tmeas[TYPE_ITER][ALGO_FFTPACK] = max_iter;
tmeas[TYPE_MFLOPS][ALGO_FFTPACK] = flops/1e6/(t1 - t0 + 1e-16);
tmeas[TYPE_DUR_TOT][ALGO_FFTPACK] = t1 - t0;
tmeas[TYPE_DUR_NS][ALGO_FFTPACK] = show_output("FFTPack", N, cplx, flops, t0, t1, max_iter, tableFile);
tmeas[TYPE_PREP][ALGO_FFTPACK] = (t0 - te) * 1e3;
haveAlgo[ALGO_FFTPACK] = 1;
}
#endif
#if defined(HAVE_VECLIB) && defined(PFFFT_ENABLE_FLOAT)
Nmax = (cplx ? nextPow2N*2 : nextPow2N);
X[Nmax] = checkVal;
te = uclock_sec();
if ( 1 || PFFFT_FUNC(is_power_of_two)(N) ) {
FFTSetup setup;
setup = vDSP_create_fftsetup(log2NextN, FFT_RADIX2);
DSPSplitComplex zsamples;
zsamples.realp = &X[0];
zsamples.imagp = &X[Nfloat/2];
t0 = uclock_sec();
tstop = t0 + max_test_duration;
max_iter = 0;
do {
for ( k = 0; k < step_iter; ++k ) {
if (cplx) {
assert( X[Nmax] == checkVal );
vDSP_fft_zip(setup, &zsamples, 1, log2NextN, kFFTDirection_Forward);
assert( X[Nmax] == checkVal );
vDSP_fft_zip(setup, &zsamples, 1, log2NextN, kFFTDirection_Inverse);
assert( X[Nmax] == checkVal );
} else {
assert( X[Nmax] == checkVal );
vDSP_fft_zrip(setup, &zsamples, 1, log2NextN, kFFTDirection_Forward);
assert( X[Nmax] == checkVal );
vDSP_fft_zrip(setup, &zsamples, 1, log2NextN, kFFTDirection_Inverse);
assert( X[Nmax] == checkVal );
}
++max_iter;
}
t1 = uclock_sec();
} while ( t1 < tstop );
vDSP_destroy_fftsetup(setup);
flops = (max_iter*2) * ((cplx ? 5 : 2.5)*N*log((double)N)/M_LN2); /* see http://www.fftw.org/speed/method.html */
tmeas[TYPE_ITER][ALGO_VECLIB] = max_iter;
tmeas[TYPE_MFLOPS][ALGO_VECLIB] = flops/1e6/(t1 - t0 + 1e-16);
tmeas[TYPE_DUR_TOT][ALGO_VECLIB] = t1 - t0;
tmeas[TYPE_DUR_NS][ALGO_VECLIB] = show_output("vDSP", N, cplx, flops, t0, t1, max_iter, tableFile);
tmeas[TYPE_PREP][ALGO_VECLIB] = (t0 - te) * 1e3;
haveAlgo[ALGO_VECLIB] = 1;
} else {
show_output("vDSP", N, cplx, -1, -1, -1, -1, tableFile);
}
#endif
#if defined(HAVE_FFTW)
Nmax = (cplx ? N*2 : N);
X[Nmax] = checkVal;
{
/* int flags = (N <= (256*1024) ? FFTW_MEASURE : FFTW_ESTIMATE); measure takes a lot of time on largest ffts */
int flags = FFTW_ESTIMATE;
te = uclock_sec();
FFTW_PLAN planf, planb;
FFTW_COMPLEX *in = (FFTW_COMPLEX*) FFTW_FUNC(malloc)(sizeof(FFTW_COMPLEX) * N);
FFTW_COMPLEX *out = (FFTW_COMPLEX*) FFTW_FUNC(malloc)(sizeof(FFTW_COMPLEX) * N);
memset(in, 0, sizeof(FFTW_COMPLEX) * N);
if (cplx) {
planf = FFTW_FUNC(plan_dft_1d)(N, in, out, FFTW_FORWARD, flags);
planb = FFTW_FUNC(plan_dft_1d)(N, in, out, FFTW_BACKWARD, flags);
} else {
planf = FFTW_FUNC(plan_dft_r2c_1d)(N, (pffft_scalar*)in, out, flags);
planb = FFTW_FUNC(plan_dft_c2r_1d)(N, in, (pffft_scalar*)out, flags);
}
t0 = uclock_sec();
tstop = t0 + max_test_duration;
max_iter = 0;
do {
for ( k = 0; k < step_iter; ++k ) {
assert( X[Nmax] == checkVal );
FFTW_FUNC(execute)(planf);
assert( X[Nmax] == checkVal );
FFTW_FUNC(execute)(planb);
assert( X[Nmax] == checkVal );
++max_iter;
}
t1 = uclock_sec();
} while ( t1 < tstop );
FFTW_FUNC(destroy_plan)(planf);
FFTW_FUNC(destroy_plan)(planb);
FFTW_FUNC(free)(in); FFTW_FUNC(free)(out);
flops = (max_iter*2) * ((cplx ? 5 : 2.5)*N*log((double)N)/M_LN2); /* see http://www.fftw.org/speed/method.html */
tmeas[TYPE_ITER][ALGO_FFTW_ESTIM] = max_iter;
tmeas[TYPE_MFLOPS][ALGO_FFTW_ESTIM] = flops/1e6/(t1 - t0 + 1e-16);
tmeas[TYPE_DUR_TOT][ALGO_FFTW_ESTIM] = t1 - t0;
tmeas[TYPE_DUR_NS][ALGO_FFTW_ESTIM] = show_output((flags == FFTW_MEASURE ? algoName[ALGO_FFTW_AUTO] : algoName[ALGO_FFTW_ESTIM]), N, cplx, flops, t0, t1, max_iter, tableFile);
tmeas[TYPE_PREP][ALGO_FFTW_ESTIM] = (t0 - te) * 1e3;
haveAlgo[ALGO_FFTW_ESTIM] = 1;
}
Nmax = (cplx ? N*2 : N);
X[Nmax] = checkVal;
do {
/* int flags = (N <= (256*1024) ? FFTW_MEASURE : FFTW_ESTIMATE); measure takes a lot of time on largest ffts */
/* int flags = FFTW_MEASURE; */
#if ( defined(__arm__) || defined(__aarch64__) || defined(__arm64__) )
int limitFFTsize = 31; /* takes over a second on Raspberry Pi 3 B+ -- and much much more on higher ffts sizes! */
#else
int limitFFTsize = 2400; /* take over a second on i7 for fft size 2400 */
#endif
int flags = (N < limitFFTsize ? FFTW_MEASURE : (withFFTWfullMeas ? FFTW_MEASURE : FFTW_ESTIMATE));
if (flags == FFTW_ESTIMATE) {
show_output((flags == FFTW_MEASURE ? algoName[ALGO_FFTW_AUTO] : algoName[ALGO_FFTW_ESTIM]), N, cplx, -1, -1, -1, -1, tableFile);
/* copy values from estimation */
tmeas[TYPE_ITER][ALGO_FFTW_AUTO] = tmeas[TYPE_ITER][ALGO_FFTW_ESTIM];
tmeas[TYPE_DUR_TOT][ALGO_FFTW_AUTO] = tmeas[TYPE_DUR_TOT][ALGO_FFTW_ESTIM];
tmeas[TYPE_DUR_NS][ALGO_FFTW_AUTO] = tmeas[TYPE_DUR_NS][ALGO_FFTW_ESTIM];
tmeas[TYPE_PREP][ALGO_FFTW_AUTO] = tmeas[TYPE_PREP][ALGO_FFTW_ESTIM];
} else {
te = uclock_sec();
FFTW_PLAN planf, planb;
FFTW_COMPLEX *in = (FFTW_COMPLEX*) FFTW_FUNC(malloc)(sizeof(FFTW_COMPLEX) * N);
FFTW_COMPLEX *out = (FFTW_COMPLEX*) FFTW_FUNC(malloc)(sizeof(FFTW_COMPLEX) * N);
memset(in, 0, sizeof(FFTW_COMPLEX) * N);
if (cplx) {
planf = FFTW_FUNC(plan_dft_1d)(N, in, out, FFTW_FORWARD, flags);
planb = FFTW_FUNC(plan_dft_1d)(N, in, out, FFTW_BACKWARD, flags);
} else {
planf = FFTW_FUNC(plan_dft_r2c_1d)(N, (pffft_scalar*)in, out, flags);
planb = FFTW_FUNC(plan_dft_c2r_1d)(N, in, (pffft_scalar*)out, flags);
}
t0 = uclock_sec();
tstop = t0 + max_test_duration;
max_iter = 0;
do {
for ( k = 0; k < step_iter; ++k ) {
assert( X[Nmax] == checkVal );
FFTW_FUNC(execute)(planf);
assert( X[Nmax] == checkVal );
FFTW_FUNC(execute)(planb);
assert( X[Nmax] == checkVal );
++max_iter;
}
t1 = uclock_sec();
} while ( t1 < tstop );
FFTW_FUNC(destroy_plan)(planf);
FFTW_FUNC(destroy_plan)(planb);
FFTW_FUNC(free)(in); FFTW_FUNC(free)(out);
flops = (max_iter*2) * ((cplx ? 5 : 2.5)*N*log((double)N)/M_LN2); /* see http://www.fftw.org/speed/method.html */
tmeas[TYPE_ITER][ALGO_FFTW_AUTO] = max_iter;
tmeas[TYPE_MFLOPS][ALGO_FFTW_AUTO] = flops/1e6/(t1 - t0 + 1e-16);
tmeas[TYPE_DUR_TOT][ALGO_FFTW_AUTO] = t1 - t0;
tmeas[TYPE_DUR_NS][ALGO_FFTW_AUTO] = show_output((flags == FFTW_MEASURE ? algoName[ALGO_FFTW_AUTO] : algoName[ALGO_FFTW_ESTIM]), N, cplx, flops, t0, t1, max_iter, tableFile);
tmeas[TYPE_PREP][ALGO_FFTW_AUTO] = (t0 - te) * 1e3;
haveAlgo[ALGO_FFTW_AUTO] = 1;
}
} while (0);
#else
(void)withFFTWfullMeas;
#endif
#if defined(HAVE_GREEN_FFTS) && defined(PFFFT_ENABLE_FLOAT)
Nmax = (cplx ? nextPow2N*2 : nextPow2N);
X[Nmax] = checkVal;
if ( 1 || PFFFT_FUNC(is_power_of_two)(N) )
{
te = uclock_sec();
fftInit(log2NextN);
t0 = uclock_sec();
tstop = t0 + max_test_duration;
max_iter = 0;
do {
for ( k = 0; k < step_iter; ++k ) {
if (cplx) {
assert( X[Nmax] == checkVal );
ffts(X, log2NextN, 1);
assert( X[Nmax] == checkVal );
iffts(X, log2NextN, 1);
assert( X[Nmax] == checkVal );
} else {
rffts(X, log2NextN, 1);
riffts(X, log2NextN, 1);
}
++max_iter;
}
t1 = uclock_sec();
} while ( t1 < tstop );
fftFree();
flops = (max_iter*2) * ((cplx ? 5 : 2.5)*N*log((double)N)/M_LN2); /* see http://www.fftw.org/speed/method.html */
tmeas[TYPE_ITER][ALGO_GREEN] = max_iter;
tmeas[TYPE_MFLOPS][ALGO_GREEN] = flops/1e6/(t1 - t0 + 1e-16);
tmeas[TYPE_DUR_TOT][ALGO_GREEN] = t1 - t0;
tmeas[TYPE_DUR_NS][ALGO_GREEN] = show_output("Green", N, cplx, flops, t0, t1, max_iter, tableFile);
tmeas[TYPE_PREP][ALGO_GREEN] = (t0 - te) * 1e3;
haveAlgo[ALGO_GREEN] = 1;
} else {
show_output("Green", N, cplx, -1, -1, -1, -1, tableFile);
}
#endif
#if defined(HAVE_KISS_FFT) && defined(PFFFT_ENABLE_FLOAT)
Nmax = (cplx ? nextPow2N*2 : nextPow2N);
X[Nmax] = checkVal;
if ( 1 || PFFFT_FUNC(is_power_of_two)(N) )
{
kiss_fft_cfg stf;
kiss_fft_cfg sti;
kiss_fftr_cfg stfr;
kiss_fftr_cfg stir;
te = uclock_sec();
if (cplx) {
stf = kiss_fft_alloc(nextPow2N, 0, 0, 0);
sti = kiss_fft_alloc(nextPow2N, 1, 0, 0);
} else {
stfr = kiss_fftr_alloc(nextPow2N, 0, 0, 0);
stir = kiss_fftr_alloc(nextPow2N, 1, 0, 0);
}
t0 = uclock_sec();
tstop = t0 + max_test_duration;
max_iter = 0;
do {
for ( k = 0; k < step_iter; ++k ) {
if (cplx) {
assert( X[Nmax] == checkVal );
kiss_fft(stf, (const kiss_fft_cpx *)X, (kiss_fft_cpx *)Y);
assert( X[Nmax] == checkVal );
kiss_fft(sti, (const kiss_fft_cpx *)Y, (kiss_fft_cpx *)X);
assert( X[Nmax] == checkVal );
} else {
assert( X[Nmax] == checkVal );
kiss_fftr(stfr, X, (kiss_fft_cpx *)Y);
assert( X[Nmax] == checkVal );
kiss_fftri(stir, (const kiss_fft_cpx *)Y, X);
assert( X[Nmax] == checkVal );
}
++max_iter;
}
t1 = uclock_sec();
} while ( t1 < tstop );
kiss_fft_cleanup();
flops = (max_iter*2) * ((cplx ? 5 : 2.5)*N*log((double)N)/M_LN2); /* see http://www.fftw.org/speed/method.html */
tmeas[TYPE_ITER][ALGO_KISS] = max_iter;
tmeas[TYPE_MFLOPS][ALGO_KISS] = flops/1e6/(t1 - t0 + 1e-16);
tmeas[TYPE_DUR_TOT][ALGO_KISS] = t1 - t0;
tmeas[TYPE_DUR_NS][ALGO_KISS] = show_output("Kiss", N, cplx, flops, t0, t1, max_iter, tableFile);
tmeas[TYPE_PREP][ALGO_KISS] = (t0 - te) * 1e3;
haveAlgo[ALGO_KISS] = 1;
} else {
show_output("Kiss", N, cplx, -1, -1, -1, -1, tableFile);
}
#endif
#if defined(HAVE_POCKET_FFT)
Nmax = (cplx ? nextPow2N*2 : nextPow2N);
X[Nmax] = checkVal;
if ( 1 || PFFFT_FUNC(is_power_of_two)(N) )
{
POCKFFTR_PRE(_plan) planr;
POCKFFTC_PRE(_plan) planc;
te = uclock_sec();
if (cplx) {
planc = POCKFFTC_MID(make_,_plan)(nextPow2N);
} else {
planr = POCKFFTR_MID(make_,_plan)(nextPow2N);
}
t0 = uclock_sec();
tstop = t0 + max_test_duration;
max_iter = 0;
do {
for ( k = 0; k < step_iter; ++k ) {
if (cplx) {
assert( X[Nmax] == checkVal );
memcpy(Y, X, 2*nextPow2N * sizeof(pffft_scalar) );
POCKFFTC_PRE(_forward)(planc, Y, 1.);
assert( X[Nmax] == checkVal );
memcpy(X, Y, 2*nextPow2N * sizeof(pffft_scalar) );
POCKFFTC_PRE(_backward)(planc, X, 1./nextPow2N);
assert( X[Nmax] == checkVal );
} else {
assert( X[Nmax] == checkVal );
memcpy(Y, X, nextPow2N * sizeof(pffft_scalar) );
POCKFFTR_PRE(_forward)(planr, Y, 1.);
assert( X[Nmax] == checkVal );
memcpy(X, Y, nextPow2N * sizeof(pffft_scalar) );
POCKFFTR_PRE(_backward)(planr, X, 1./nextPow2N);
assert( X[Nmax] == checkVal );
}
++max_iter;
}
t1 = uclock_sec();
} while ( t1 < tstop );
if (cplx) {
POCKFFTC_MID(destroy_,_plan)(planc);
} else {
POCKFFTR_MID(destroy_,_plan)(planr);
}
flops = (max_iter*2) * ((cplx ? 5 : 2.5)*N*log((double)N)/M_LN2); /* see http://www.fftw.org/speed/method.html */
tmeas[TYPE_ITER][ALGO_POCKET] = max_iter;
tmeas[TYPE_MFLOPS][ALGO_POCKET] = flops/1e6/(t1 - t0 + 1e-16);
tmeas[TYPE_DUR_TOT][ALGO_POCKET] = t1 - t0;
tmeas[TYPE_DUR_NS][ALGO_POCKET] = show_output("Pocket", N, cplx, flops, t0, t1, max_iter, tableFile);
tmeas[TYPE_PREP][ALGO_POCKET] = (t0 - te) * 1e3;
haveAlgo[ALGO_POCKET] = 1;
} else {
show_output("Pocket", N, cplx, -1, -1, -1, -1, tableFile);
}
#endif
#if defined(HAVE_MKL)
{
DFTI_DESCRIPTOR_HANDLE fft_handle;
MKL_LONG mkl_status, mkl_ret;
te = uclock_sec();
if (sizeof(float) == sizeof(pffft_scalar))
mkl_status = DftiCreateDescriptor(&fft_handle, DFTI_SINGLE, (cplx ? DFTI_COMPLEX : DFTI_REAL), 1, N);
else if (sizeof(double) == sizeof(pffft_scalar))
mkl_status = DftiCreateDescriptor(&fft_handle, DFTI_DOUBLE, (cplx ? DFTI_COMPLEX : DFTI_REAL), 1, N);
else
mkl_status = 1;
while (mkl_status == 0) {
mkl_ret = DftiSetValue(fft_handle, DFTI_PLACEMENT, DFTI_NOT_INPLACE);
if (mkl_ret) {
DftiFreeDescriptor(&fft_handle);
mkl_status = 1;
break;
}
mkl_ret = DftiCommitDescriptor(fft_handle);
if (mkl_ret) {
DftiFreeDescriptor(&fft_handle);
mkl_status = 1;
break;
}
break;
}
if (mkl_status == 0) {
t0 = uclock_sec();
tstop = t0 + max_test_duration;
max_iter = 0;
do {
for ( k = 0; k < step_iter; ++k ) {
assert( X[Nmax] == checkVal );
DftiComputeForward(fft_handle, &X[0], &Y[0]);
assert( X[Nmax] == checkVal );
DftiComputeBackward(fft_handle, &X[0], &Y[0]);
assert( X[Nmax] == checkVal );
++max_iter;
}
t1 = uclock_sec();
} while ( t1 < tstop );
DftiFreeDescriptor(&fft_handle);
flops = (max_iter*2) * ((cplx ? 5 : 2.5)*N*log((double)N)/M_LN2); /* see http://www.fftw.org/speed/method.html */
tmeas[TYPE_ITER][ALGO_MKL] = max_iter;
tmeas[TYPE_MFLOPS][ALGO_MKL] = flops/1e6/(t1 - t0 + 1e-16);
tmeas[TYPE_DUR_TOT][ALGO_MKL] = t1 - t0;
tmeas[TYPE_DUR_NS][ALGO_MKL] = show_output("MKL", N, cplx, flops, t0, t1, max_iter, tableFile);
tmeas[TYPE_PREP][ALGO_MKL] = (t0 - te) * 1e3;
haveAlgo[ALGO_MKL] = 1;
} else {
show_output("MKL", N, cplx, -1, -1, -1, -1, tableFile);
}
}
#endif
/* PFFFT-U (unordered) benchmark */
Nmax = (cplx ? pffftPow2N*2 : pffftPow2N);
X[Nmax] = checkVal;
if ( pffftPow2N >= PFFFT_FUNC(min_fft_size)(cplx ? PFFFT_COMPLEX : PFFFT_REAL) )
{