forked from dealias/fftwpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
fftw++.h
1551 lines (1380 loc) · 45.9 KB
/
fftw++.h
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
/* Fast Fourier transform C++ header class for the FFTW3 Library
Copyright (C) 2004-16
John C. Bowman, University of Alberta
Malcolm Roberts, University of Strasbourg
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 3 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 Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
#ifndef __fftwpp_h__
#define __fftwpp_h__ 1
#define __FFTWPP_H_VERSION__ 2.06
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <fftw3.h>
#include <cerrno>
#include <map>
#ifndef _OPENMP
#ifndef FFTWPP_SINGLE_THREAD
#define FFTWPP_SINGLE_THREAD
#endif
#endif
#ifndef FFTWPP_SINGLE_THREAD
#include <omp.h>
#endif
inline int get_thread_num()
{
#ifdef FFTWPP_SINGLE_THREAD
return 0;
#else
return omp_get_thread_num();
#endif
}
inline int get_max_threads()
{
#ifdef FFTWPP_SINGLE_THREAD
return 1;
#else
return omp_get_max_threads();
#endif
}
#ifndef FFTWPP_SINGLE_THREAD
#define PARALLEL(code) \
if(threads > 1) { \
_Pragma("omp parallel for num_threads(threads)") \
code \
} else { \
code \
}
#else
#define PARALLEL(code) \
{ \
code \
}
#endif
#ifndef __Complex_h__
#include <complex>
typedef std::complex<double> Complex;
#endif
#include "seconds.h"
#include "statistics.h"
#include "align.h"
namespace fftwpp {
// Obsolete names:
#define FFTWComplex ComplexAlign
#define FFTWdouble doubleAlign
#define FFTWdelete deleteAlign
class fftw;
extern "C" fftw_plan Planner(fftw *F, Complex *in, Complex *out);
void LoadWisdom();
void SaveWisdom();
extern const char *inout;
struct threaddata {
unsigned int threads;
double mean;
double stdev;
threaddata() : threads(0), mean(0.0), stdev(0.0) {}
threaddata(unsigned int threads, double mean, double stdev) :
threads(threads), mean(mean), stdev(stdev) {}
};
class fftw;
class ThreadBase
{
protected:
unsigned int threads;
unsigned int innerthreads;
public:
ThreadBase();
ThreadBase(unsigned int threads) : threads(threads) {}
void Threads(unsigned int nthreads) {threads=nthreads;}
unsigned int Threads() {return threads;}
void multithread(unsigned int nx) {
if(nx >= threads) {
innerthreads=1;
} else {
innerthreads=threads;
threads=1;
}
}
};
inline unsigned int realsize(unsigned int n, Complex *in, Complex *out=NULL)
{
return (!out || in == out) ? 2*(n/2+1) : n;
}
inline unsigned int realsize(unsigned int n, Complex *in, double *out)
{
return realsize(n,in,(Complex *) out);
}
inline unsigned int realsize(unsigned int n, double *in, Complex *out)
{
return realsize(n,(Complex *) in,out);
}
// Base clase for fft routines
//
class fftw : public ThreadBase {
protected:
unsigned int doubles; // number of double precision values in dataset
int sign;
unsigned int threads;
double norm;
fftw_plan plan;
bool inplace;
unsigned int Dist(unsigned int n, size_t stride, size_t dist) {
return dist ? dist : ((stride == 1) ? n : 1);
}
static const double twopi;
public:
static unsigned int effort;
static unsigned int maxthreads;
static double testseconds;
static const char *WisdomName;
static fftw_plan (*planner)(fftw *f, Complex *in, Complex *out);
virtual unsigned int Threads() {return threads;}
static const char *oddshift;
// Inplace shift of Fourier origin to (nx/2,0) for even nx.
static void Shift(Complex *data, unsigned int nx, unsigned int ny,
unsigned int threads) {
unsigned int nyp=ny/2+1;
unsigned int stop=nx*nyp;
if(nx % 2 == 0) {
unsigned int inc=2*nyp;
#ifndef FFTWPP_SINGLE_THREAD
#pragma omp parallel for num_threads(threads)
#endif
for(unsigned int i=nyp; i < stop; i += inc) {
Complex *p=data+i;
for(unsigned int j=0; j < nyp; j++) p[j]=-p[j];
}
} else {
std::cerr << oddshift << std::endl;
exit(1);
}
}
// Out-of-place shift of Fourier origin to (nx/2,0) for even nx.
static void Shift(double *data, unsigned int nx, unsigned int ny,
unsigned int threads) {
if(nx % 2 == 0) {
unsigned int stop=nx*ny;
unsigned int inc=2*ny;
#ifndef FFTWPP_SINGLE_THREAD
#pragma omp parallel for num_threads(threads)
#endif
for(unsigned int i=ny; i < stop; i += inc) {
double *p=data+i;
for(unsigned int j=0; j < ny; j++) p[j]=-p[j];
}
} else {
std::cerr << oddshift << std::endl;
exit(1);
}
}
// Inplace shift of Fourier origin to (nx/2,ny/2,0) for even nx and ny.
static void Shift(Complex *data, unsigned int nx, unsigned int ny,
unsigned int nz, unsigned int threads) {
unsigned int nzp=nz/2+1;
unsigned int nyzp=ny*nzp;
if(nx % 2 == 0 && ny % 2 == 0) {
unsigned int pinc=2*nzp;
#ifndef FFTWPP_SINGLE_THREAD
#pragma omp parallel for num_threads(threads)
#endif
for(unsigned int i=0; i < nx; i++) {
Complex *pstart=data+i*nyzp;
Complex *pstop=pstart+nyzp;
for(Complex *p=pstart+(1-(i % 2))*nzp; p < pstop; p += pinc) {
for(unsigned int k=0; k < nzp; k++) p[k]=-p[k];
}
}
} else {
std::cerr << oddshift << " or odd ny" << std::endl;
exit(1);
}
}
// Out-of-place shift of Fourier origin to (nx/2,ny/2,0) for even nx and ny.
static void Shift(double *data, unsigned int nx, unsigned int ny,
unsigned int nz, unsigned int threads) {
unsigned int nyz=ny*nz;
if(nx % 2 == 0 && ny % 2 == 0) {
unsigned int pinc=2*nz;
#ifndef FFTWPP_SINGLE_THREAD
#pragma omp parallel for num_threads(threads)
#endif
for(unsigned int i=0; i < nx; i++) {
double *pstart=data+i*nyz;
double *pstop=pstart+nyz;
for(double *p=pstart+(1-(i % 2))*nz; p < pstop; p += pinc) {
for(unsigned int k=0; k < nz; k++) p[k]=-p[k];
}
}
} else {
std::cerr << oddshift << " or odd ny" << std::endl;
exit(1);
}
}
fftw() : plan(NULL) {}
fftw(unsigned int doubles, int sign, unsigned int threads,
unsigned int n=0) :
doubles(doubles), sign(sign), threads(threads),
norm(1.0/(n ? n : doubles/2)), plan(NULL) {
#ifndef FFTWPP_SINGLE_THREAD
fftw_init_threads();
#endif
}
virtual ~fftw() {
if(plan) fftw_destroy_plan(plan);
}
virtual fftw_plan Plan(Complex *in, Complex *out) {return NULL;};
inline void CheckAlign(Complex *p, const char *s) {
if((size_t) p % sizeof(Complex) == 0) return;
std::cerr << "WARNING: " << s << " array is not " << sizeof(Complex)
<< "-byte aligned: address " << p << std::endl;
}
void noplan() {
std::cerr << "Unable to construct FFTW plan" << std::endl;
exit(1);
}
static void planThreads(unsigned int threads) {
#ifndef FFTWPP_SINGLE_THREAD
omp_set_num_threads(threads);
fftw_plan_with_nthreads(threads);
#endif
}
threaddata time(fftw_plan plan1, fftw_plan planT, Complex *in, Complex *out,
unsigned int Threads) {
utils::statistics S,ST;
double stop=utils::totalseconds()+testseconds;
threads=1;
plan=plan1;
fft(in,out);
threads=Threads;
plan=planT;
fft(in,out);
unsigned int N=1;
for(;;) {
double t0=utils::totalseconds();
threads=1;
plan=plan1;
for(unsigned int i=0; i < N; ++i)
fft(in,out);
double t1=utils::totalseconds();
threads=Threads;
plan=planT;
for(unsigned int i=0; i < N; ++i)
fft(in,out);
double t=utils::totalseconds();
S.add(t1-t0);
ST.add(t-t1);
if(S.mean() < 100.0/CLOCKS_PER_SEC) N *= 2;
if(S.count() >= 10) {
double error=S.stdev();
double diff=ST.mean()-S.mean();
if(diff >= 0.0 || t > stop) {
threads=1;
plan=plan1;
fftw_destroy_plan(planT);
break;
}
if(diff < -error) {
threads=Threads;
fftw_destroy_plan(plan1);
break;
}
}
}
return threaddata(threads,S.mean(),S.stdev());
}
virtual threaddata lookup(bool inplace, unsigned int threads) {
return threaddata();
}
virtual void store(bool inplace, const threaddata& data) {}
inline Complex *CheckAlign(Complex *in, Complex *out, bool constructor=true)
{
#ifndef NO_CHECK_ALIGN
CheckAlign(in,constructor ? "constructor input" : "input");
if(out) CheckAlign(out,constructor ? "constructor output" : "output");
else out=in;
#else
if(!out) out=in;
#endif
return out;
}
threaddata Setup(Complex *in, Complex *out=NULL) {
bool alloc=!in;
if(alloc) in=utils::ComplexAlign((doubles+1)/2);
out=CheckAlign(in,out);
inplace=(out==in);
threaddata data;
unsigned int Threads=threads;
if(threads > 1) data=lookup(inplace,threads);
threads=data.threads > 0 ? data.threads : 1;
planThreads(threads);
plan=(*planner)(this,in,out);
if(!plan) noplan();
fftw_plan planT;
if(fftw::maxthreads > 1) {
threads=Threads;
planThreads(threads);
planT=(*planner)(this,in,out);
if(data.threads == 0) {
if(planT)
data=time(plan,planT,in,out,threads);
else noplan();
store(inplace,threaddata(threads,data.mean,data.stdev));
}
}
if(alloc) Array::deleteAlign(in,(doubles+1)/2);
return data;
}
threaddata Setup(Complex *in, double *out) {
return Setup(in,(Complex *) out);
}
threaddata Setup(double *in, Complex *out=NULL) {
return Setup((Complex *) in,out);
}
virtual void Execute(Complex *in, Complex *out, bool=false) {
fftw_execute_dft(plan,(fftw_complex *) in,(fftw_complex *) out);
}
Complex *Setout(Complex *in, Complex *out) {
out=CheckAlign(in,out,false);
if(inplace ^ (out == in)) {
std::cerr << "ERROR: fft " << inout << std::endl;
exit(1);
}
return out;
}
void fft(Complex *in, Complex *out=NULL) {
out=Setout(in,out);
Execute(in,out);
}
void fft(double *in, Complex *out=NULL) {
fft((Complex *) in,out);
}
void fft(Complex *in, double *out) {
fft(in,(Complex *) out);
}
void fft0(Complex *in, Complex *out=NULL) {
out=Setout(in,out);
Execute(in,out,true);
}
void fft0(double *in, Complex *out=NULL) {
fft0((Complex *) in,out);
}
void fft0(Complex *in, double *out) {
fft0(in,(Complex *) out);
}
void Normalize(Complex *out) {
unsigned int stop=doubles/2;
#ifndef FFTWPP_SINGLE_THREAD
#pragma omp parallel for num_threads(threads)
#endif
for(unsigned int i=0; i < stop; i++) out[i] *= norm;
}
void Normalize(double *out) {
#ifndef FFTWPP_SINGLE_THREAD
#pragma omp parallel for num_threads(threads)
#endif
for(unsigned int i=0; i < doubles; i++) out[i] *= norm;
}
virtual void fftNormalized(Complex *in, Complex *out=NULL, bool shift=false)
{
out=Setout(in,out);
Execute(in,out,shift);
Normalize(out);
}
void fftNormalized(Complex *in, double *out, bool shift=false) {
out=(double *) Setout(in,(Complex *) out);
Execute(in,(Complex *) out,shift);
Normalize(out);
}
void fftNormalized(double *in, Complex *out, bool shift=false) {
fftNormalized((Complex *) in,out,shift);
}
template<class I, class O>
void fft0Normalized(I in, O out) {
fftNormalized(in,out,true);
}
template<class O>
void Normalize(unsigned int nx, unsigned int M, size_t ostride,
size_t odist, O *out) {
unsigned int stop=nx*ostride;
O *outMdist=out+M*odist;
#ifndef FFTWPP_SINGLE_THREAD
#pragma omp parallel for num_threads(threads)
#endif
for(unsigned int i=0; i < stop; i += ostride) {
O *pstop=outMdist+i;
for(O *p=out+i; p < pstop; p += odist) {
*p *= norm;
}
}
}
template<class I, class O>
void fftNormalized(unsigned int nx, unsigned int M, size_t ostride,
size_t odist, I *in, O *out=NULL, bool shift=false) {
out=(O *) Setout((Complex *) in,(Complex *) out);
Execute((Complex *) in,(Complex *) out,shift);
Normalize(nx,M,ostride,odist,out);
}
}; // class fftw
class Transpose {
fftw_plan plan;
fftw_plan plan2;
unsigned int a,b;
unsigned int nlength,mlength;
unsigned int ilast,jlast;
unsigned int rows,cols;
unsigned int threads;
bool inplace;
unsigned int size;
public:
template<class T>
Transpose(unsigned int rows, unsigned int cols, unsigned int length,
T *in, T *out=NULL, unsigned int threads=fftw::maxthreads) :
rows(rows), cols(cols), threads(threads) {
size=sizeof(T);
if(size % sizeof(double) != 0) {
std::cerr << "ERROR: Transpose is not implemented for type of size "
<< size;
exit(1);
}
plan=plan2=NULL;
if(rows == 0 || cols == 0) return;
size /= sizeof(double);
length *= size;
if(!out) out=in;
inplace=(out==in);
if(inplace) {
fftw::planThreads(threads);
threads=1;
} else fftw::planThreads(1);
fftw_iodim dims[3];
a=std::min(rows,threads);
b=std::min(cols,threads/a);
unsigned int n=utils::ceilquotient(rows,a);
unsigned int m=utils::ceilquotient(cols,b);
// If rows <= threads then a=rows and n=1.
// If rows >= threads then b=1 and m=cols.
nlength=n*length;
mlength=m*length;
dims[0].n=n;
dims[0].is=cols*length;
dims[0].os=length;
dims[1].n=m;
dims[1].is=length;
dims[1].os=rows*length;
dims[2].n=length;
dims[2].is=1;
dims[2].os=1;
// A plan with rank=0 is a transpose.
plan=fftw_plan_guru_r2r(0,NULL,3,dims,(double *) in,(double *) out,
NULL,fftw::effort);
ilast=a;
jlast=b;
if(n*a > rows) { // Only happens when rows > threads.
a=utils::ceilquotient(rows,n);
ilast=a-1;
dims[0].n=rows-n*ilast;
plan2=fftw_plan_guru_r2r(0,NULL,3,dims,(double *) in,(double *) out,
NULL,fftw::effort);
} else { // Only happens when rows < threads.
if(m*b > cols) {
b=utils::ceilquotient(cols,m);
jlast=b-1;
dims[1].n=cols-m*jlast;
plan2=fftw_plan_guru_r2r(0,NULL,3,dims,(double *) in,(double *) out,
NULL,fftw::effort);
}
}
}
~Transpose() {
if(plan) fftw_destroy_plan(plan);
if(plan2) fftw_destroy_plan(plan2);
}
template<class T>
void transpose(T *in, T *out=NULL) {
if(rows == 0 || cols == 0) return;
if(!out) out=in;
if(inplace ^ (out == in)) {
std::cerr << "ERROR: Transpose " << inout << std::endl;
exit(1);
}
#ifndef FFTWPP_SINGLE_THREAD
if(a > 1) {
if(b > 1) {
int A=a, B=b;
#pragma omp parallel for num_threads(A)
for(unsigned int i=0; i < a; ++i) {
unsigned int I=i*nlength;
#pragma omp parallel for num_threads(B)
for(unsigned int j=0; j < b; ++j) {
unsigned int J=j*mlength;
fftw_execute_r2r((i < ilast && j < jlast) ? plan : plan2,
(double *) in+cols*I+J,
(double *) out+rows*J+I);
}
}
} else {
int A=a;
#pragma omp parallel for num_threads(A)
for(unsigned int i=0; i < a; ++i) {
unsigned int I=i*nlength;
fftw_execute_r2r(i < ilast ? plan : plan2,
(double *) in+cols*I,(double *) out+I);
}
}
} else if(b > 1) {
int B=b;
#pragma omp parallel for num_threads(B)
for(unsigned int j=0; j < b; ++j) {
unsigned int J=j*mlength;
fftw_execute_r2r(j < jlast ? plan : plan2,
(double *) in+J,(double *) out+rows*J);
}
} else
#endif
fftw_execute_r2r(plan,(double *) in,(double*) out);
}
};
template<class T, class L>
class Threadtable {
public:
typedef std::map<T,threaddata,L> Table;
threaddata Lookup(Table& table, T key) {
typename Table::iterator p=table.find(key);
return p == table.end() ? threaddata() : p->second;
}
void Store(Table& threadtable, T key, const threaddata& data) {
threadtable[key]=data;
}
};
struct keytype1 {
unsigned int nx;
unsigned int threads;
bool inplace;
keytype1(unsigned int nx, unsigned int threads, bool inplace) :
nx(nx), threads(threads), inplace(inplace) {}
};
struct keyless1 {
bool operator()(const keytype1& a, const keytype1& b) const {
return a.nx < b.nx || (a.nx == b.nx &&
(a.threads < b.threads || (a.threads == b.threads &&
a.inplace < b.inplace)));
}
};
struct keytype2 {
unsigned int nx;
unsigned int ny;
unsigned int threads;
bool inplace;
keytype2(unsigned int nx, unsigned int ny, unsigned int threads,
bool inplace) :
nx(nx), ny(ny), threads(threads), inplace(inplace) {}
};
struct keyless2 {
bool operator()(const keytype2& a, const keytype2& b) const {
return a.nx < b.nx || (a.nx == b.nx &&
(a.ny < b.ny || (a.ny == b.ny &&
(a.threads < b.threads ||
(a.threads == b.threads &&
a.inplace < b.inplace)))));
}
};
struct keytype3 {
unsigned int nx;
unsigned int ny;
unsigned int nz;
unsigned int threads;
bool inplace;
keytype3(unsigned int nx, unsigned int ny, unsigned int nz,
unsigned int threads, bool inplace) :
nx(nx), ny(ny), nz(nz), threads(threads), inplace(inplace) {}
};
struct keyless3 {
bool operator()(const keytype3& a, const keytype3& b) const {
return a.nx < b.nx || (a.nx == b.nx &&
(a.ny < b.ny || (a.ny == b.ny &&
(a.nz < b.nz ||
(a.nz == b.nz &&
(a.threads < b.threads ||
(a.threads == b.threads &&
a.inplace < b.inplace)))))));
}
};
// Compute the complex Fourier transform of n complex values.
// Before calling fft(), the arrays in and out (which may coincide) must be
// allocated as Complex[n].
//
// Out-of-place usage:
//
// fft1d Forward(n,-1,in,out);
// Forward.fft(in,out);
//
// fft1d Backward(n,1,in,out);
// Backward.fft(in,out);
//
// fft1d Backward(n,1,in,out);
// Backward.fftNormalized(in,out); // True inverse of Forward.fft(out,in);
//
// In-place usage:
//
// fft1d Forward(n,-1);
// Forward.fft(in);
//
// fft1d Backward(n,1);
// Backward.fft(in);
//
class fft1d : public fftw, public Threadtable<keytype1,keyless1> {
unsigned int nx;
static Table threadtable;
public:
fft1d(unsigned int nx, int sign, Complex *in=NULL, Complex *out=NULL,
unsigned int threads=maxthreads)
: fftw(2*nx,sign,threads), nx(nx) {Setup(in,out);}
#ifdef __Array_h__
fft1d(int sign, const Array::array1<Complex>& in,
const Array::array1<Complex>& out=Array::NULL1,
unsigned int threads=maxthreads)
: fftw(2*in.Nx(),sign,threads), nx(in.Nx()) {Setup(in,out);}
#endif
threaddata lookup(bool inplace, unsigned int threads) {
return this->Lookup(threadtable,keytype1(nx,threads,inplace));
}
void store(bool inplace, const threaddata& data) {
this->Store(threadtable,keytype1(nx,data.threads,inplace),data);
}
fftw_plan Plan(Complex *in, Complex *out) {
return fftw_plan_dft_1d(nx,(fftw_complex *) in,(fftw_complex *) out,
sign,effort);
}
};
template<class I, class O>
class fftwblock : public virtual fftw {
public:
int nx;
unsigned int M;
size_t istride,ostride;
size_t idist,odist;
fftw_plan plan1,plan2;
unsigned int T,Q,R;
fftwblock(unsigned int nx, unsigned int M,
size_t istride, size_t ostride, size_t idist, size_t odist,
Complex *in, Complex *out, unsigned int Threads)
: fftw(), nx(nx), M(M), istride(istride), ostride(ostride),
idist(Dist(nx,istride,idist)), odist(Dist(nx,ostride,odist)),
plan1(NULL), plan2(NULL) {
T=1;
Q=M;
R=0;
threaddata S1=Setup(in,out);
fftw_plan planT1=plan;
if(fftw::maxthreads > 1) {
if(Threads > 1) {
T=std::min(M,Threads);
Q=T > 0 ? M/T : 0;
R=M-Q*T;
threads=Threads;
threaddata ST=Setup(in,out);
if(R > 0 && threads == 1 && plan1 != plan2) {
fftw_destroy_plan(plan2);
plan2=plan1;
}
if(ST.mean > S1.mean-S1.stdev) { // Use FFTW's multi-threading
fftw_destroy_plan(plan);
if(R > 0) {
fftw_destroy_plan(plan2);
plan2=NULL;
}
T=1;
Q=M;
R=0;
plan=planT1;
threads=S1.threads;
} else { // Do the multi-threading ourselves
fftw_destroy_plan(planT1);
threads=ST.threads;
}
} else
Setup(in,out); // Synchronize wisdom
}
}
fftw_plan Plan(int Q, fftw_complex *in, fftw_complex *out) {
return fftw_plan_many_dft(1,&nx,Q,in,NULL,istride,idist,
out,NULL,ostride,odist,sign,effort);
}
fftw_plan Plan(int Q, double *in, fftw_complex *out) {
return fftw_plan_many_dft_r2c(1,&nx,Q,in,NULL,istride,idist,
out,NULL,ostride,odist,effort);
}
fftw_plan Plan(int Q, fftw_complex *in, double *out) {
return fftw_plan_many_dft_c2r(1,&nx,Q,in,NULL,istride,idist,
out,NULL,ostride,odist,effort);
}
fftw_plan Plan(Complex *in, Complex *out) {
if(R > 0) {
plan2=Plan(Q+1,(I *) in,(O *) out);
if(!plan2) return NULL;
if(threads == 1) plan1=plan2;
}
return Plan(Q,(I *) in,(O *) out);
}
void Execute(fftw_plan plan, fftw_complex *in, fftw_complex *out) {
fftw_execute_dft(plan,in,out);
}
void Execute(fftw_plan plan, double *in, fftw_complex *out) {
fftw_execute_dft_r2c(plan,in,out);
}
void Execute(fftw_plan plan, fftw_complex *in, double *out) {
fftw_execute_dft_c2r(plan,in,out);
}
void Execute(Complex *in, Complex *out, bool=false) {
if(T == 1)
Execute(plan,(I *) in,(O *) out);
else {
unsigned int extra=T-R;
#ifndef FFTWPP_SINGLE_THREAD
#pragma omp parallel for num_threads(T)
#endif
for(unsigned int i=0; i < T; ++i) {
unsigned int iQ=i*Q;
if(i < extra)
Execute(plan,(I *) in+iQ*idist,(O *) out+iQ*odist);
else {
unsigned int offset=iQ+i-extra;
Execute(plan2,(I *) in+offset*idist,(O *) out+offset*odist);
}
}
}
}
unsigned int Threads() {return std::max(T,threads);}
~fftwblock() {
if(plan2) fftw_destroy_plan(plan2);
}
};
// Compute the complex Fourier transform of M complex vectors, each of
// length n.
// Before calling fft(), the arrays in and out (which may coincide) must be
// allocated as Complex[M*n].
//
// Out-of-place usage:
//
// mfft1d Forward(n,-1,M,stride,dist,in,out);
// Forward.fft(in,out);
//
// In-place usage:
//
// mfft1d Forward(n,-1,M,stride,dist);
// Forward.fft(in);
//
// Notes:
// stride is the spacing between the elements of each Complex vector;
// dist is the spacing between the first elements of the vectors.
//
//
class mfft1d : public fftwblock<fftw_complex,fftw_complex>,
public Threadtable<keytype3,keyless3> {
static Table threadtable;
public:
mfft1d(unsigned int nx, int sign, unsigned int M=1, size_t stride=1,
size_t dist=0, Complex *in=NULL, Complex *out=NULL,
unsigned int threads=maxthreads) :
fftw(2*((nx-1)*stride+(M-1)*Dist(nx,stride,dist)+1),sign,threads,nx),
fftwblock<fftw_complex,fftw_complex>
(nx,M,stride,stride,dist,dist,in,out,threads) {}
mfft1d(unsigned int nx, int sign, unsigned int M,
size_t istride, size_t ostride, size_t idist, size_t odist,
Complex *in=NULL, Complex *out=NULL, unsigned int threads=maxthreads):
fftw(std::max(2*((nx-1)*istride+(M-1)*Dist(nx,istride,idist)+1),
2*((nx-1)*ostride+(M-1)*Dist(nx,ostride,odist)+1)),sign,
threads, nx),
fftwblock<fftw_complex,fftw_complex>(nx,M,istride,ostride,idist,odist,in,
out,threads) {}
threaddata lookup(bool inplace, unsigned int threads) {
return Lookup(threadtable,keytype3(nx,Q,R,threads,inplace));
}
void store(bool inplace, const threaddata& data) {
Store(threadtable,keytype3(nx,Q,R,data.threads,inplace),data);
}
};
// Compute the complex Fourier transform of n real values, using phase sign -1.
// Before calling fft(), the array in must be allocated as double[n] and
// the array out must be allocated as Complex[n/2+1]. The arrays in and out
// may coincide, allocated as Complex[n/2+1].
//
// Out-of-place usage:
//
// rcfft1d Forward(n,in,out);
// Forward.fft(in,out);
//
// In-place usage:
//
// rcfft1d Forward(n);
// Forward.fft(out);
//
// Notes:
// in contains the n real values stored as a Complex array;
// out contains the first n/2+1 Complex Fourier values.
//
class rcfft1d : public fftw, public Threadtable<keytype1,keyless1> {
unsigned int nx;
static Table threadtable;
public:
rcfft1d(unsigned int nx, Complex *out=NULL, unsigned int threads=maxthreads)
: fftw(2*(nx/2+1),-1,threads,nx), nx(nx) {Setup(out,(double*) NULL);}
rcfft1d(unsigned int nx, double *in, Complex *out=NULL,
unsigned int threads=maxthreads)
: fftw(2*(nx/2+1),-1,threads,nx), nx(nx) {Setup(in,out);}
threaddata lookup(bool inplace, unsigned int threads) {
return Lookup(threadtable,keytype1(nx,threads,inplace));
}
void store(bool inplace, const threaddata& data) {
Store(threadtable,keytype1(nx,data.threads,inplace),data);
}
fftw_plan Plan(Complex *in, Complex *out) {
return fftw_plan_dft_r2c_1d(nx,(double *) in,(fftw_complex *) out, effort);
}
void Execute(Complex *in, Complex *out, bool=false) {
fftw_execute_dft_r2c(plan,(double *) in,(fftw_complex *) out);
}
};
// Compute the real inverse Fourier transform of the n/2+1 Complex values
// corresponding to the non-negative part of the frequency spectrum, using
// phase sign +1.
// Before calling fft(), the array in must be allocated as Complex[n/2+1]
// and the array out must be allocated as double[n]. The arrays in and out
// may coincide, allocated as Complex[n/2+1].
//
// Out-of-place usage (input destroyed):
//
// crfft1d Backward(n,in,out);
// Backward.fft(in,out);
//
// In-place usage:
//
// crfft1d Backward(n);
// Backward.fft(in);
//
// Notes:
// in contains the first n/2+1 Complex Fourier values.
// out contains the n real values stored as a Complex array;
//
class crfft1d : public fftw, public Threadtable<keytype1,keyless1> {
unsigned int nx;
static Table threadtable;
public:
crfft1d(unsigned int nx, double *out=NULL, unsigned int threads=maxthreads)
: fftw(2*(nx/2+1),1,threads,nx), nx(nx) {Setup(out);}
crfft1d(unsigned int nx, Complex *in, double *out=NULL,
unsigned int threads=maxthreads)
: fftw(realsize(nx,in,out),1,threads,nx), nx(nx) {Setup(in,out);}
threaddata lookup(bool inplace, unsigned int threads) {