-
Notifications
You must be signed in to change notification settings - Fork 2
/
clfft++.hpp
694 lines (583 loc) · 17.2 KB
/
clfft++.hpp
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
/*
This file is part of clFFT++.
clFFT++ 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 3 of the License, or
(at your option) any later version.
clFFT++ 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 clFFT++. If not, see <http://www.gnu.org/licenses/>.
*/
#include <iostream>
#include <assert.h>
#include <clFFT.h> /* No need to explicitely include the OpenCL headers */
extern "C" {
#include "clutils.h"
}
namespace clfftpp {
class clfft_base
{
private:
static int count_zero;
protected:
clfftPlanHandle forward_plan, backward_plan;
cl_context ctx;
cl_command_queue queue;
bool inplace, realtocomplex;
clfftPrecision precision;
cl_mem workmem;
size_t nwork;
const char *clfft_errorstring(const cl_int err) {
const char *errstring = NULL;
errstring = clErrorString(err);
// FIXME: memory leak?
switch (err) {
case CL_SUCCESS:
errstring = "Success";
break;
case CLFFT_BUGCHECK:
errstring = "CLFFT_BUGCHECK";
break;
case CLFFT_NOTIMPLEMENTED:
errstring = "CLFFT_NOTIMPLEMENTED";
break;
case CLFFT_TRANSPOSED_NOTIMPLEMENTED:
errstring = "CLFFT_TRANSPOSED_NOTIMPLEMENTED";
break;
case CLFFT_FILE_NOT_FOUND:
errstring = "CLFFT_FILE_NOT_FOUND:";
break;
case CLFFT_FILE_CREATE_FAILURE:
errstring = "CLFFT_FILE_CREATE_FAILURE";
break;
case CLFFT_VERSION_MISMATCH:
errstring = "CLFFT_VERSION_MISMATCH";
break;
case CLFFT_INVALID_PLAN:
errstring = "CLFFT_INVALID_PLAN";
break;
case CLFFT_DEVICE_NO_DOUBLE:
errstring = "CLFFT_DEVICE_NO_DOUBLE";
break;
}
return errstring;
}
void create_default_plan(clfftPlanHandle &plan,
clfftDim dim, size_t *clLengths) {
cl_int ret;
ret = clfftCreateDefaultPlan(&plan,
ctx,
dim,
clLengths);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void set_inout_place(clfftPlanHandle &plan) {
cl_int ret;
ret = clfftSetResultLocation(plan,
inplace ? CLFFT_INPLACE : CLFFT_OUTOFPLACE);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void set_precision(clfftPlanHandle &plan, clfftPrecision precision) {
cl_int ret;
ret = clfftSetPlanPrecision(plan, precision);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void set_strides(clfftPlanHandle &plan, clfftDim dim,
size_t *istride, size_t *ostride) {
cl_int ret;
ret = clfftSetPlanInStride(plan,
dim, //const clfftDim dim,
istride //size_t * clStrides
);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
ret = clfftSetPlanOutStride(plan,
dim, //const clfftDim dim,
ostride //size_t * clStrides
);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void set_dists(clfftPlanHandle &plan, clfftDim dim,
size_t idist, size_t odist) {
cl_int ret;
ret = clfftSetPlanDistance(plan,
idist,
odist);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void set_data_layout_complex(clfftPlanHandle &plan) {
cl_int ret;
ret = clfftSetLayout(plan,
CLFFT_COMPLEX_INTERLEAVED,
CLFFT_COMPLEX_INTERLEAVED);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void set_data_layout_real_to_complex(clfftPlanHandle &plan) {
cl_int ret;
ret = clfftSetLayout(plan,
CLFFT_REAL,
CLFFT_HERMITIAN_INTERLEAVED);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void set_data_layout_complex_to_real(clfftPlanHandle &plan) {
cl_int ret;
ret = clfftSetLayout(plan,
CLFFT_HERMITIAN_INTERLEAVED,
CLFFT_REAL);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void set_data_layout(clfftPlanHandle &plan, bool forward = true) {
if(!realtocomplex) {
set_data_layout_complex(plan);
} else {
if(forward) {
set_data_layout_real_to_complex(plan);
} else {
set_data_layout_complex_to_real(plan);
}
}
}
void set_batchsize(clfftPlanHandle &plan, const size_t M) {
cl_int ret;
ret = clfftSetPlanBatchSize(plan, M);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void bake_plan(clfftPlanHandle &plan) {
cl_int ret;
ret = clfftBakePlan(plan,
1, // numQueues: number of experiments
&queue, // commQueueFFT
NULL, // Always NULL
NULL // Always NULL
);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
public:
clfft_base() :
inplace(true), realtocomplex(false), precision(CLFFT_DOUBLE) {
if(count_zero++ == 0)
clfft_setup();
nwork = 0;
}
clfft_base(cl_context ctx, cl_command_queue queue,
bool inplace, bool realtocomplex,
clfftPrecision precision = CLFFT_DOUBLE) :
ctx(ctx), queue(queue),
inplace(inplace), realtocomplex(realtocomplex), precision(precision) {
if(count_zero++ == 0)
clfft_setup();
nwork = 0;
}
~clfft_base() {
cl_int ret;
ret = clfftDestroyPlan(&forward_plan);
if(ret < CL_SUCCESS) std::cerr << clErrorString(ret) << std::endl;
assert(ret >= CL_SUCCESS);
ret = clfftDestroyPlan(&backward_plan);
if(ret < CL_SUCCESS) std::cerr << clErrorString(ret) << std::endl;
assert(ret >= CL_SUCCESS);
if(--count_zero == 0)
clfftTeardown();
}
void set_workmem(clfftPlanHandle &plan) {
cl_int ret;
ret = clfftGetTmpBufSize(plan, &nwork);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
if(nwork > 0) {
workmem = clCreateBuffer(ctx, CL_MEM_READ_WRITE, nwork, 0, &ret);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
} else {
workmem = NULL;
}
}
void clfft_setup() {
cl_int ret;
clfftSetupData fftSetup;
ret = clfftInitSetupData(&fftSetup);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
#ifdef DEBUG
fftSetup.debugFlags = CLFFT_DUMP_PROGRAMS;
#endif
ret = clfftSetup(&fftSetup);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void transform(clfftDirection direction,
cl_mem *inbuf, cl_mem *outbuf,
cl_uint nwait, cl_event *wait, cl_event *done) {
clfftPlanHandle plan
= (direction == CLFFT_FORWARD) ? forward_plan : backward_plan;
cl_int ret;
ret = clfftEnqueueTransform(plan, // clfftPlanHandle plHandle,
direction, // direction
1, // cl_uint numQueuesAndEvents,
&queue,
nwait, // cl_uint numWaitEvents,
wait, // const cl_event * waitEvents,
done, // cl_event * outEvents,
inbuf, // cl_mem * inputBuffers,
outbuf, // cl_mem * outputBuffers,
workmem // cl_mem tmpBuffer
);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
}
void forward(cl_mem *inbuf, cl_mem *outbuf,
cl_uint nwait, cl_event *wait, cl_event *done) {
transform(CLFFT_FORWARD, inbuf, outbuf, nwait, wait, done);
}
void backward(cl_mem *inbuf0, cl_mem *outbuf0,
cl_uint nwait, cl_event *wait, cl_event *done) {
transform(CLFFT_BACKWARD, inbuf0, outbuf0, nwait, wait, done);
}
};
class clfft1 : public clfft_base
{
private:
unsigned nx;
void setup() {
realtocomplex = false;
setup_plan(forward_plan);
setup_plan(backward_plan);
}
void setup_plan(clfftPlanHandle &plan) {
clfftDim dim = CLFFT_1D;
size_t clLengths[1] = {nx};
create_default_plan(plan, dim, clLengths);
set_precision(plan, precision);
set_inout_place(plan);
set_data_layout(plan);
bake_plan(plan);
set_workmem(plan);
}
public:
clfft1() : clfft_base(), nx(0) {
}
clfft1(unsigned int nx, bool inplace,
cl_command_queue queue, cl_context ctx) :
clfft_base(ctx, queue, inplace, true, CLFFT_DOUBLE), nx(nx) {
setup();
}
~clfft1() {
if(nwork > 0) {
cl_int ret;
ret = clReleaseMemObject(workmem);
if(ret < CL_SUCCESS) std::cerr << clfft_errorstring(ret) << std::endl;
assert(ret >= CL_SUCCESS);
nwork = 0;
}
}
};
class clfft2 : public clfft_base
{
private:
unsigned nx, ny;
void setup() {
realtocomplex = false;
setup_plan(forward_plan);
setup_plan(backward_plan);
}
void setup_plan(clfftPlanHandle &plan) {
clfftDim dim = CLFFT_2D;
size_t clLengths[2] = {ny, nx};
create_default_plan(plan, dim, clLengths);
set_precision(plan, precision);
set_data_layout(plan);
set_inout_place(plan);
bake_plan(plan);
set_workmem(plan);
}
public:
clfft2() :
clfft_base(), nx(0), ny(0) {
}
clfft2(unsigned int nx, unsigned int ny, bool inplace,
cl_command_queue queue, cl_context ctx) :
clfft_base(ctx, queue, inplace, true, CLFFT_DOUBLE), nx(nx), ny(ny) {
setup();
}
~clfft2() {
}
};
class clfft3 : public clfft_base
{
private:
unsigned nx, ny, nz;
void setup() {
realtocomplex = false;
setup_plan(forward_plan);
setup_plan(backward_plan);
}
void setup_plan(clfftPlanHandle &plan) {
clfftDim dim = CLFFT_3D;
size_t clLengths[3] = {nz, ny, nx};
create_default_plan(plan, dim, clLengths);
set_precision(plan, precision);
set_data_layout(plan);
set_inout_place(plan);
bake_plan(plan);
set_workmem(plan);
}
public:
clfft3(): clfft_base(), nx(0), ny(0), nz(0) {
}
clfft3(unsigned int nx, unsigned int ny, unsigned int nz, bool inplace,
cl_command_queue queue, cl_context ctx) :
clfft_base(ctx, queue, inplace, true, CLFFT_DOUBLE), nx(nx), ny(ny), nz(nz){
setup();
}
~clfft3() {
}
};
class clmfft1 : public clfft_base
{
private:
unsigned int nx;
unsigned int M;
size_t istride, ostride;
size_t idist, odist;
void setup() {
setup_plan(forward_plan);
setup_plan(backward_plan);
}
void setup_plan(clfftPlanHandle &plan) {
clfftDim dim = CLFFT_1D;
size_t clLengths[1] = {nx};
create_default_plan(plan, dim, clLengths);
set_precision(plan, precision);
set_inout_place(plan);
set_data_layout(plan);
set_batchsize(plan, M);
set_strides(plan, dim, &istride, &ostride);
set_dists(plan, dim, idist, odist);
bake_plan(plan);
set_workmem(plan);
}
public:
clmfft1() : clfft_base(), nx(0), M(0), istride(0), ostride(0), idist(0),
odist(0) {
realtocomplex = false;
}
clmfft1(unsigned int nx, unsigned int M,
int istride, int ostride, int idist, int odist,
bool inplace,
cl_command_queue queue, cl_context ctx) :
clfft_base(ctx, queue, inplace, true, CLFFT_DOUBLE),
nx(nx), M(M),
istride(istride), ostride(ostride), idist(idist), odist(odist) {
realtocomplex = false;
setup();
}
};
class clfft1r : public clfft_base
{
private:
unsigned nx;
void setup() {
realtocomplex = true;
setup_plan(forward_plan, CLFFT_FORWARD);
setup_plan(backward_plan, CLFFT_BACKWARD);
}
void setup_plan(clfftPlanHandle &plan, clfftDirection direction) {
bool forward = direction == CLFFT_FORWARD;
clfftDim dim = CLFFT_1D;
size_t clLengths[1] = {nx};
create_default_plan(plan, dim, clLengths);
set_precision(plan, precision);
set_data_layout(plan, forward);
set_inout_place(plan);
size_t iostrides[1] = {1};
set_strides(plan, dim, iostrides, iostrides);
size_t nxp = nx / 2 + 1;
size_t idist = forward ? nx : nxp;
size_t odist = forward ? nxp : nx;
set_dists(plan, dim, idist, odist);
bake_plan(plan);
set_workmem(plan);
}
public:
clfft1r() : clfft_base(), nx(0) {
}
clfft1r(unsigned int nx, bool inplace,
cl_command_queue queue, cl_context ctx) :
clfft_base(ctx, queue, inplace, true, CLFFT_DOUBLE), nx(nx) {
setup();
}
~clfft1r() {
}
};
class clfft2r : public clfft_base
{
private:
unsigned nx, ny;
void setup() {
realtocomplex = true;
setup_plan(forward_plan, CLFFT_FORWARD);
setup_plan(backward_plan, CLFFT_BACKWARD);
}
void setup_plan(clfftPlanHandle &plan, clfftDirection direction) {
bool forward = direction == CLFFT_FORWARD;
clfftDim dim = CLFFT_2D;
size_t clLengths[2] = {ny, nx};
create_default_plan(plan, dim, clLengths);
set_precision(plan, precision);
set_data_layout(plan, forward);
set_inout_place(plan);
set_precision(plan, precision);
size_t nyp = ny / 2 + 1;
size_t rstride[2] = {1, inplace ? 2 * nyp : ny};
size_t cstride[2] = {1, nyp};
if(forward)
set_strides(plan, dim, rstride, cstride);
else
set_strides(plan, dim, cstride, rstride);
size_t rdist = inplace ? nx * 2 * nyp : nx * ny;
size_t cdist = nx * nyp;
if(forward)
set_dists(plan, dim, rdist, cdist);
else
set_dists(plan, dim, cdist, rdist);
bake_plan(plan);
set_workmem(plan);
}
public:
clfft2r() : clfft_base(), nx(0), ny(0) {
}
clfft2r(unsigned int nx, unsigned int ny, bool inplace,
cl_command_queue queue, cl_context ctx) :
clfft_base(ctx, queue, inplace, true, CLFFT_DOUBLE), nx(nx), ny(ny) {
realtocomplex = true;
setup();
}
~clfft2r() {
}
};
class clfft3r : public clfft_base
{
private:
unsigned nx, ny, nz;
void setup() {
realtocomplex = true;
setup_plan(forward_plan, CLFFT_FORWARD);
setup_plan(backward_plan, CLFFT_BACKWARD);
}
void setup_plan(clfftPlanHandle &plan, clfftDirection direction) {
bool forward = (direction == CLFFT_FORWARD);
clfftDim dim = CLFFT_3D;
size_t clLengths[3] = {nz, ny, nx};
create_default_plan(plan, dim, clLengths);
set_precision(plan, precision);
set_data_layout(plan, forward);
set_inout_place(plan);
set_precision(plan, precision);
size_t nzp = nz / 2 + 1;
size_t rstride[3] = {1, inplace ? 2 * nzp : nz,
ny * (inplace ? 2 * nzp : nz)};
size_t cstride[3] = {1, nzp, ny * nzp};
if(forward) {
set_strides(plan, dim, rstride, cstride);
} else {
set_strides(plan, dim, cstride, rstride);
}
size_t rdist = nx * ny * inplace ? 2 * nzp : nz;
size_t cdist = nx * ny * nzp;
if(forward)
set_dists(plan, dim, rdist, cdist);
else
set_dists(plan, dim, cdist, rdist);
bake_plan(plan);
set_workmem(plan);
}
public:
clfft3r() : clfft_base(), nx(0), ny(0), nz(0) {
}
clfft3r(unsigned int nx, unsigned int ny, unsigned int nz, bool inplace,
cl_command_queue queue, cl_context ctx) :
clfft_base(ctx, queue, inplace, true, CLFFT_DOUBLE), nx(nx), ny(ny), nz(nz){
realtocomplex = true;
setup();
}
~clfft3r() {
}
};
class clmfft1r : public clfft_base
{
private:
unsigned int nx;
unsigned int M;
size_t istride, ostride;
size_t idist, odist;
void setup() {
realtocomplex = true;
setup_plan(forward_plan, CLFFT_FORWARD);
setup_plan(backward_plan, CLFFT_BACKWARD);
}
void setup_plan(clfftPlanHandle &plan, clfftDirection direction) {
bool forward = direction == CLFFT_FORWARD;
clfftDim dim = CLFFT_1D;
size_t clLengths[1] = {nx};
create_default_plan(plan, dim, clLengths);
set_precision(plan, precision);
if(forward)
set_data_layout_real_to_complex(plan);
else
set_data_layout_complex_to_real(plan);
set_data_layout(plan, forward);
set_inout_place(plan);
set_batchsize(plan, M);
size_t istride_t = istride;
size_t ostride_t = ostride;
if(forward)
set_strides(plan, dim, &istride_t, &ostride_t);
else
set_strides(plan, dim, &ostride_t, &istride_t);
// FIXME: correct for in-place?
size_t idist_t = idist;
size_t odist_t = odist;
if(forward)
set_dists(plan, dim, idist_t, odist_t);
else
set_dists(plan, dim, odist_t, idist_t);
/*
if(forward)
std::cout << "forward" << std::endl;
else
std::cout << "backward" << std::endl;
std::cout << "\tistride: " << istride << std::endl;
std::cout << "\tostride: " << ostride << std::endl;
std::cout << "\tidist: " << idist << std::endl;
std::cout << "\todist: " << odist << std::endl;
*/
bake_plan(plan);
set_workmem(plan);
}
public:
clmfft1r() : clfft_base(), nx(0), M(0) {
}
clmfft1r(unsigned int nx, unsigned int M, int istride, int ostride,
int idist, int odist,
bool inplace,
cl_command_queue queue, cl_context ctx) :
clfft_base(ctx, queue, inplace, true, CLFFT_DOUBLE),
nx(nx), M(M),
istride(istride), ostride(ostride), idist(idist), odist(odist) {
setup();
}
};
}