starpufftx2d.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2009-2012 Université de Bordeaux 1
  4. * Copyright (C) 2010, 2011, 2012 Centre National de la Recherche Scientifique
  5. *
  6. * StarPU is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU Lesser General Public License as published by
  8. * the Free Software Foundation; either version 2.1 of the License, or (at
  9. * your option) any later version.
  10. *
  11. * StarPU is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  14. *
  15. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  16. */
  17. #define DIV_2D_N 8
  18. #define DIV_2D_M 8
  19. #define I_SHIFT (I_BITS/2)
  20. #define J_BITS I_SHIFT
  21. #define STEP_TAG_2D(plan, step, i, j) _STEP_TAG(plan, step, ((starpu_tag_t) i << I_SHIFT) | (starpu_tag_t) j)
  22. #ifdef __STARPU_USE_CUDA
  23. /* Twist the full vector into a n2,m2 chunk */
  24. static void
  25. STARPUFFT(twist1_2d_kernel_gpu)(void *descr[], void *_args)
  26. {
  27. struct STARPUFFT(args) *args = _args;
  28. STARPUFFT(plan) plan = args->plan;
  29. int i = args->i;
  30. int j = args->j;
  31. int n1 = plan->n1[0];
  32. int n2 = plan->n2[0];
  33. int m1 = plan->n1[1];
  34. int m2 = plan->n2[1];
  35. _cufftComplex * restrict in = (_cufftComplex *)STARPU_VECTOR_GET_PTR(descr[0]);
  36. _cufftComplex * restrict twisted1 = (_cufftComplex *)STARPU_VECTOR_GET_PTR(descr[1]);
  37. STARPUFFT(cuda_twist1_2d_host)(in, twisted1, i, j, n1, n2, m1, m2);
  38. cudaStreamSynchronize(starpu_cuda_get_local_stream());
  39. }
  40. /* fft1:
  41. *
  42. * Perform one fft of size n2,m2 */
  43. static void
  44. STARPUFFT(fft1_2d_plan_gpu)(void *args)
  45. {
  46. STARPUFFT(plan) plan = args;
  47. int n2 = plan->n2[0];
  48. int m2 = plan->n2[1];
  49. int workerid = starpu_worker_get_id();
  50. cufftResult cures;
  51. cures = cufftPlan2d(&plan->plans[workerid].plan1_cuda, n2, m2, _CUFFT_C2C);
  52. STARPU_ASSERT(cures == CUFFT_SUCCESS);
  53. cufftSetStream(plan->plans[workerid].plan1_cuda, starpu_cuda_get_local_stream());
  54. STARPU_ASSERT(cures == CUFFT_SUCCESS);
  55. }
  56. static void
  57. STARPUFFT(fft1_2d_kernel_gpu)(void *descr[], void *_args)
  58. {
  59. struct STARPUFFT(args) *args = _args;
  60. STARPUFFT(plan) plan = args->plan;
  61. int i = args->i;
  62. int j = args->j;
  63. int n2 = plan->n2[0];
  64. int m2 = plan->n2[1];
  65. cufftResult cures;
  66. _cufftComplex * restrict in = (_cufftComplex *)STARPU_VECTOR_GET_PTR(descr[0]);
  67. _cufftComplex * restrict out = (_cufftComplex *)STARPU_VECTOR_GET_PTR(descr[1]);
  68. const _cufftComplex * restrict roots0 = (_cufftComplex *)STARPU_VECTOR_GET_PTR(descr[2]);
  69. const _cufftComplex * restrict roots1 = (_cufftComplex *)STARPU_VECTOR_GET_PTR(descr[3]);
  70. int workerid = starpu_worker_get_id();
  71. task_per_worker[workerid]++;
  72. cures = _cufftExecC2C(plan->plans[workerid].plan1_cuda, in, out, plan->sign == -1 ? CUFFT_FORWARD : CUFFT_INVERSE);
  73. STARPU_ASSERT(cures == CUFFT_SUCCESS);
  74. /* synchronization is done after the twiddling */
  75. STARPUFFT(cuda_twiddle_2d_host)(out, roots0, roots1, n2, m2, i, j);
  76. cudaStreamSynchronize(starpu_cuda_get_local_stream());
  77. }
  78. /* fft2:
  79. *
  80. * Perform n3*m3 ffts of size n1,m1 */
  81. static void
  82. STARPUFFT(fft2_2d_plan_gpu(void *args))
  83. {
  84. STARPUFFT(plan) plan = args;
  85. int n1 = plan->n1[0];
  86. int m1 = plan->n1[1];
  87. cufftResult cures;
  88. int workerid = starpu_worker_get_id();
  89. cures = cufftPlan2d(&plan->plans[workerid].plan2_cuda, n1, m1, _CUFFT_C2C);
  90. STARPU_ASSERT(cures == CUFFT_SUCCESS);
  91. cufftSetStream(plan->plans[workerid].plan2_cuda, starpu_cuda_get_local_stream());
  92. STARPU_ASSERT(cures == CUFFT_SUCCESS);
  93. }
  94. static void
  95. STARPUFFT(fft2_2d_kernel_gpu)(void *descr[], void *_args)
  96. {
  97. struct STARPUFFT(args) *args = _args;
  98. STARPUFFT(plan) plan = args->plan;
  99. int n1 = plan->n1[0];
  100. int n2 = plan->n2[0];
  101. int m1 = plan->n1[1];
  102. int m2 = plan->n2[1];
  103. int n3 = n2/DIV_2D_N;
  104. int m3 = m2/DIV_2D_M;
  105. int n;
  106. cufftResult cures;
  107. _cufftComplex * restrict in = (_cufftComplex *)STARPU_VECTOR_GET_PTR(descr[0]);
  108. _cufftComplex * restrict out = (_cufftComplex *)STARPU_VECTOR_GET_PTR(descr[1]);
  109. int workerid = starpu_worker_get_id();
  110. task_per_worker[workerid]++;
  111. for (n = 0; n < n3*m3; n++) {
  112. cures = _cufftExecC2C(plan->plans[workerid].plan2_cuda, in + n * n1*m1, out + n * n1*m1, plan->sign == -1 ? CUFFT_FORWARD : CUFFT_INVERSE);
  113. STARPU_ASSERT(cures == CUFFT_SUCCESS);
  114. }
  115. cudaStreamSynchronize(starpu_cuda_get_local_stream());
  116. }
  117. #endif
  118. /* Twist the full vector into a n2,m2 chunk */
  119. static void
  120. STARPUFFT(twist1_2d_kernel_cpu)(void *descr[], void *_args)
  121. {
  122. struct STARPUFFT(args) *args = _args;
  123. STARPUFFT(plan) plan = args->plan;
  124. int i = args->i;
  125. int j = args->j;
  126. int k, l;
  127. int n1 = plan->n1[0];
  128. int n2 = plan->n2[0];
  129. int m1 = plan->n1[1];
  130. int m2 = plan->n2[1];
  131. int m = plan->n[1];
  132. STARPUFFT(complex) * restrict in = (STARPUFFT(complex) *)STARPU_VECTOR_GET_PTR(descr[0]);
  133. STARPUFFT(complex) * restrict twisted1 = (STARPUFFT(complex) *)STARPU_VECTOR_GET_PTR(descr[1]);
  134. /* printf("twist1 %d %d %g\n", i, j, (double) cabs(plan->in[i+j])); */
  135. for (k = 0; k < n2; k++)
  136. for (l = 0; l < m2; l++)
  137. twisted1[k*m2+l] = in[i*m+j+k*m*n1+l*m1];
  138. }
  139. #ifdef STARPU_HAVE_FFTW
  140. /* Perform an n2,m2 fft */
  141. static void
  142. STARPUFFT(fft1_2d_kernel_cpu)(void *descr[], void *_args)
  143. {
  144. struct STARPUFFT(args) *args = _args;
  145. STARPUFFT(plan) plan = args->plan;
  146. int i = args->i;
  147. int j = args->j;
  148. int k, l;
  149. int n2 = plan->n2[0];
  150. int m2 = plan->n2[1];
  151. int workerid = starpu_worker_get_id();
  152. task_per_worker[workerid]++;
  153. STARPUFFT(complex) *twisted1 = (STARPUFFT(complex) *)STARPU_VECTOR_GET_PTR(descr[0]);
  154. STARPUFFT(complex) *fft1 = (STARPUFFT(complex) *)STARPU_VECTOR_GET_PTR(descr[1]);
  155. /* printf("fft1 %d %d %g\n", i, j, (double) cabs(twisted1[0])); */
  156. _FFTW(execute_dft)(plan->plans[workerid].plan1_cpu, twisted1, fft1);
  157. for (k = 0; k < n2; k++)
  158. for (l = 0; l < m2; l++)
  159. fft1[k*m2 + l] = fft1[k*m2 + l] * plan->roots[0][i*k] * plan->roots[1][j*l];
  160. }
  161. #endif
  162. /* Twist the full vector into a package of n2/DIV_2D_N,m2/DIV_2D_M (n1,m1) chunks */
  163. static void
  164. STARPUFFT(twist2_2d_kernel_cpu)(void *descr[], void *_args)
  165. {
  166. struct STARPUFFT(args) *args = _args;
  167. STARPUFFT(plan) plan = args->plan;
  168. int kk = args->kk; /* between 0 and DIV_2D_N */
  169. int ll = args->ll; /* between 0 and DIV_2D_M */
  170. int kkk, lll; /* beetween 0,0 and n3,m3 */
  171. int i, j;
  172. int n1 = plan->n1[0];
  173. int n2 = plan->n2[0];
  174. int m1 = plan->n1[1];
  175. int m2 = plan->n2[1];
  176. int n3 = n2/DIV_2D_N;
  177. int m3 = m2/DIV_2D_M;
  178. STARPUFFT(complex) * restrict twisted2 = (STARPUFFT(complex) *)STARPU_VECTOR_GET_PTR(descr[0]);
  179. /* printf("twist2 %d %d %g\n", kk, ll, (double) cabs(plan->fft1[kk+ll])); */
  180. for (kkk = 0; kkk < n3; kkk++) {
  181. int k = kk * n3 + kkk;
  182. for (lll = 0; lll < m3; lll++) {
  183. int l = ll * m3 + lll;
  184. for (i = 0; i < n1; i++)
  185. for (j = 0; j < m1; j++)
  186. twisted2[kkk*m3*n1*m1+lll*n1*m1+i*m1+j] = plan->fft1[i*n1*n2*m2+j*n2*m2+k*m2+l];
  187. }
  188. }
  189. }
  190. #ifdef STARPU_HAVE_FFTW
  191. /* Perform (n2/DIV_2D_N)*(m2/DIV_2D_M) (n1,m1) ffts */
  192. static void
  193. STARPUFFT(fft2_2d_kernel_cpu)(void *descr[], void *_args)
  194. {
  195. struct STARPUFFT(args) *args = _args;
  196. STARPUFFT(plan) plan = args->plan;
  197. /* int kk = args->kk; */
  198. /* int ll = args->ll; */
  199. int workerid = starpu_worker_get_id();
  200. task_per_worker[workerid]++;
  201. STARPUFFT(complex) *twisted2 = (STARPUFFT(complex) *)STARPU_VECTOR_GET_PTR(descr[0]);
  202. STARPUFFT(complex) *fft2 = (STARPUFFT(complex) *)STARPU_VECTOR_GET_PTR(descr[1]);
  203. /* printf("fft2 %d %d %g\n", kk, ll, (double) cabs(twisted2[plan->totsize4-1])); */
  204. _FFTW(execute_dft)(plan->plans[workerid].plan2_cpu, twisted2, fft2);
  205. }
  206. #endif
  207. /* Spread the package of (n2/DIV_2D_N)*(m2/DIV_2D_M) (n1,m1) chunks into the full vector */
  208. static void
  209. STARPUFFT(twist3_2d_kernel_cpu)(void *descr[], void *_args)
  210. {
  211. struct STARPUFFT(args) *args = _args;
  212. STARPUFFT(plan) plan = args->plan;
  213. int kk = args->kk; /* between 0 and DIV_2D_N */
  214. int ll = args->ll; /* between 0 and DIV_2D_M */
  215. int kkk, lll; /* beetween 0,0 and n3,m3 */
  216. int i, j;
  217. int n1 = plan->n1[0];
  218. int n2 = plan->n2[0];
  219. int m1 = plan->n1[1];
  220. int m2 = plan->n2[1];
  221. int n3 = n2/DIV_2D_N;
  222. int m3 = m2/DIV_2D_M;
  223. int m = plan->n[1];
  224. const STARPUFFT(complex) * restrict fft2 = (STARPUFFT(complex) *)STARPU_VECTOR_GET_PTR(descr[0]);
  225. /* printf("twist3 %d %d %g\n", kk, ll, (double) cabs(fft2[0])); */
  226. for (kkk = 0; kkk < n3; kkk++) {
  227. int k = kk * n3 + kkk;
  228. for (lll = 0; lll < m3; lll++) {
  229. int l = ll * m3 + lll;
  230. for (i = 0; i < n1; i++)
  231. for (j = 0; j < m1; j++)
  232. plan->out[i*n2*m+j*m2+k*m+l] = fft2[kkk*m3*n1*m1+lll*n1*m1+i*m1+j];
  233. }
  234. }
  235. }
  236. struct starpu_perfmodel STARPUFFT(twist1_2d_model) = {
  237. .type = STARPU_HISTORY_BASED,
  238. .symbol = TYPE"twist1_2d"
  239. };
  240. struct starpu_perfmodel STARPUFFT(fft1_2d_model) = {
  241. .type = STARPU_HISTORY_BASED,
  242. .symbol = TYPE"fft1_2d"
  243. };
  244. struct starpu_perfmodel STARPUFFT(twist2_2d_model) = {
  245. .type = STARPU_HISTORY_BASED,
  246. .symbol = TYPE"twist2_2d"
  247. };
  248. struct starpu_perfmodel STARPUFFT(fft2_2d_model) = {
  249. .type = STARPU_HISTORY_BASED,
  250. .symbol = TYPE"fft2_2d"
  251. };
  252. struct starpu_perfmodel STARPUFFT(twist3_2d_model) = {
  253. .type = STARPU_HISTORY_BASED,
  254. .symbol = TYPE"twist3_2d"
  255. };
  256. static struct starpu_codelet STARPUFFT(twist1_2d_codelet) = {
  257. .where =
  258. #ifdef __STARPU_USE_CUDA
  259. STARPU_CUDA|
  260. #endif
  261. STARPU_CPU,
  262. #ifdef __STARPU_USE_CUDA
  263. .cuda_funcs = {STARPUFFT(twist1_2d_kernel_gpu), NULL},
  264. #endif
  265. .cpu_funcs = {STARPUFFT(twist1_2d_kernel_cpu), NULL},
  266. CAN_EXECUTE
  267. .model = &STARPUFFT(twist1_2d_model),
  268. .nbuffers = 2,
  269. .modes = {STARPU_R, STARPU_W}
  270. };
  271. static struct starpu_codelet STARPUFFT(fft1_2d_codelet) = {
  272. .where =
  273. #ifdef __STARPU_USE_CUDA
  274. STARPU_CUDA|
  275. #endif
  276. #ifdef STARPU_HAVE_FFTW
  277. STARPU_CPU|
  278. #endif
  279. 0,
  280. #ifdef __STARPU_USE_CUDA
  281. .cuda_funcs = {STARPUFFT(fft1_2d_kernel_gpu), NULL},
  282. #endif
  283. #ifdef STARPU_HAVE_FFTW
  284. .cpu_funcs = {STARPUFFT(fft1_2d_kernel_cpu), NULL},
  285. #endif
  286. CAN_EXECUTE
  287. .model = &STARPUFFT(fft1_2d_model),
  288. .nbuffers = 4,
  289. .modes = {STARPU_R, STARPU_W, STARPU_R, STARPU_R}
  290. };
  291. static struct starpu_codelet STARPUFFT(twist2_2d_codelet) = {
  292. .where = STARPU_CPU,
  293. .cpu_funcs = {STARPUFFT(twist2_2d_kernel_cpu), NULL},
  294. CAN_EXECUTE
  295. .model = &STARPUFFT(twist2_2d_model),
  296. .nbuffers = 1,
  297. .modes = {STARPU_W}
  298. };
  299. static struct starpu_codelet STARPUFFT(fft2_2d_codelet) = {
  300. .where =
  301. #ifdef __STARPU_USE_CUDA
  302. STARPU_CUDA|
  303. #endif
  304. #ifdef STARPU_HAVE_FFTW
  305. STARPU_CPU|
  306. #endif
  307. 0,
  308. #ifdef __STARPU_USE_CUDA
  309. .cuda_funcs = {STARPUFFT(fft2_2d_kernel_gpu), NULL},
  310. #endif
  311. #ifdef STARPU_HAVE_FFTW
  312. .cpu_funcs = {STARPUFFT(fft2_2d_kernel_cpu), NULL},
  313. #endif
  314. CAN_EXECUTE
  315. .model = &STARPUFFT(fft2_2d_model),
  316. .nbuffers = 2,
  317. .modes = {STARPU_R, STARPU_W}
  318. };
  319. static struct starpu_codelet STARPUFFT(twist3_2d_codelet) = {
  320. .where = STARPU_CPU,
  321. .cpu_funcs = {STARPUFFT(twist3_2d_kernel_cpu), NULL},
  322. CAN_EXECUTE
  323. .model = &STARPUFFT(twist3_2d_model),
  324. .nbuffers = 1,
  325. .modes = {STARPU_R}
  326. };
  327. /*
  328. *
  329. * Sequential version
  330. *
  331. */
  332. #ifdef __STARPU_USE_CUDA
  333. /* Perform one fft of size n,m */
  334. static void
  335. STARPUFFT(fft_2d_plan_gpu)(void *args)
  336. {
  337. STARPUFFT(plan) plan = args;
  338. cufftResult cures;
  339. int n = plan->n[0];
  340. int m = plan->n[1];
  341. int workerid = starpu_worker_get_id();
  342. cures = cufftPlan2d(&plan->plans[workerid].plan_cuda, n, m, _CUFFT_C2C);
  343. STARPU_ASSERT(cures == CUFFT_SUCCESS);
  344. cufftSetStream(plan->plans[workerid].plan_cuda, starpu_cuda_get_local_stream());
  345. STARPU_ASSERT(cures == CUFFT_SUCCESS);
  346. }
  347. static void
  348. STARPUFFT(fft_2d_kernel_gpu)(void *descr[], void *args)
  349. {
  350. STARPUFFT(plan) plan = args;
  351. cufftResult cures;
  352. _cufftComplex * restrict in = (_cufftComplex *)STARPU_VECTOR_GET_PTR(descr[0]);
  353. _cufftComplex * restrict out = (_cufftComplex *)STARPU_VECTOR_GET_PTR(descr[1]);
  354. int workerid = starpu_worker_get_id();
  355. task_per_worker[workerid]++;
  356. cures = _cufftExecC2C(plan->plans[workerid].plan_cuda, in, out, plan->sign == -1 ? CUFFT_FORWARD : CUFFT_INVERSE);
  357. STARPU_ASSERT(cures == CUFFT_SUCCESS);
  358. cudaStreamSynchronize(starpu_cuda_get_local_stream());
  359. }
  360. #endif
  361. #ifdef STARPU_HAVE_FFTW
  362. /* Perform one fft of size n,m */
  363. static void
  364. STARPUFFT(fft_2d_kernel_cpu)(void *descr[], void *_args)
  365. {
  366. STARPUFFT(plan) plan = _args;
  367. int workerid = starpu_worker_get_id();
  368. task_per_worker[workerid]++;
  369. STARPUFFT(complex) * restrict in = (STARPUFFT(complex) *)STARPU_VECTOR_GET_PTR(descr[0]);
  370. STARPUFFT(complex) * restrict out = (STARPUFFT(complex) *)STARPU_VECTOR_GET_PTR(descr[1]);
  371. _FFTW(execute_dft)(plan->plans[workerid].plan_cpu, in, out);
  372. }
  373. #endif
  374. static struct starpu_perfmodel STARPUFFT(fft_2d_model) = {
  375. .type = STARPU_HISTORY_BASED,
  376. .symbol = TYPE"fft_2d"
  377. };
  378. static struct starpu_codelet STARPUFFT(fft_2d_codelet) = {
  379. .where =
  380. #ifdef __STARPU_USE_CUDA
  381. STARPU_CUDA|
  382. #endif
  383. #ifdef STARPU_HAVE_FFTW
  384. STARPU_CPU|
  385. #endif
  386. 0,
  387. #ifdef __STARPU_USE_CUDA
  388. .cuda_funcs = {STARPUFFT(fft_2d_kernel_gpu), NULL},
  389. #endif
  390. #ifdef STARPU_HAVE_FFTW
  391. .cpu_funcs = {STARPUFFT(fft_2d_kernel_cpu), NULL},
  392. #endif
  393. CAN_EXECUTE
  394. .model = &STARPUFFT(fft_2d_model),
  395. .nbuffers = 2,
  396. .modes = {STARPU_R, STARPU_W}
  397. };
  398. STARPUFFT(plan)
  399. STARPUFFT(plan_dft_2d)(int n, int m, int sign, unsigned flags)
  400. {
  401. int workerid;
  402. int n1 = DIV_2D_N;
  403. int n2 = n / n1;
  404. int n3;
  405. int m1 = DIV_2D_M;
  406. int m2 = m / m1;
  407. int m3;
  408. int z;
  409. struct starpu_task *task;
  410. if (PARALLEL) {
  411. /*
  412. * Simple strategy:
  413. *
  414. * - twist1: twist input in n1*m1 (n2,m2) chunks
  415. * - fft1: perform n1*m1 (n2,m2) ffts
  416. * - twist2: twist into n2*m2 (n1,m1) chunks distributed in
  417. * DIV_2D_N*DIV_2D_M groups
  418. * - fft2: perform DIV_2D_N*DIV_2D_M times n3*m3 (n1,m1) ffts
  419. * - twist3: twist back into output
  420. */
  421. #ifdef __STARPU_USE_CUDA
  422. /* cufft 2D-3D limited to [2,16384] */
  423. while (n2 > 16384) {
  424. n1 *= 2;
  425. n2 /= 2;
  426. }
  427. #endif
  428. STARPU_ASSERT(n == n1*n2);
  429. STARPU_ASSERT(n1 < (1ULL << J_BITS));
  430. #ifdef __STARPU_USE_CUDA
  431. /* cufft 2D-3D limited to [2,16384] */
  432. while (m2 > 16384) {
  433. m1 *= 2;
  434. m2 /= 2;
  435. }
  436. #endif
  437. STARPU_ASSERT(m == m1*m2);
  438. STARPU_ASSERT(m1 < (1ULL << J_BITS));
  439. /* distribute the n2*m2 second ffts into DIV_2D_N*DIV_2D_M packages */
  440. n3 = n2 / DIV_2D_N;
  441. STARPU_ASSERT(n2 == n3*DIV_2D_N);
  442. m3 = m2 / DIV_2D_M;
  443. STARPU_ASSERT(m2 == m3*DIV_2D_M);
  444. }
  445. /* TODO: flags? Automatically set FFTW_MEASURE on calibration? */
  446. STARPU_ASSERT(flags == 0);
  447. STARPUFFT(plan) plan = malloc(sizeof(*plan));
  448. memset(plan, 0, sizeof(*plan));
  449. if (PARALLEL) {
  450. plan->number = STARPU_ATOMIC_ADD(&starpufft_last_plan_number, 1) - 1;
  451. /* 4bit limitation in the tag space */
  452. STARPU_ASSERT(plan->number < (1ULL << NUMBER_BITS));
  453. }
  454. plan->dim = 2;
  455. plan->n = malloc(plan->dim * sizeof(*plan->n));
  456. plan->n[0] = n;
  457. plan->n[1] = m;
  458. if (PARALLEL) {
  459. check_dims(plan);
  460. plan->n1 = malloc(plan->dim * sizeof(*plan->n1));
  461. plan->n1[0] = n1;
  462. plan->n1[1] = m1;
  463. plan->n2 = malloc(plan->dim * sizeof(*plan->n2));
  464. plan->n2[0] = n2;
  465. plan->n2[1] = m2;
  466. }
  467. plan->totsize = n * m;
  468. if (PARALLEL) {
  469. plan->totsize1 = n1 * m1;
  470. plan->totsize2 = n2 * m2;
  471. plan->totsize3 = DIV_2D_N * DIV_2D_M;
  472. plan->totsize4 = plan->totsize / plan->totsize3;
  473. }
  474. plan->type = C2C;
  475. plan->sign = sign;
  476. if (PARALLEL) {
  477. /* Compute the w^k just once. */
  478. compute_roots(plan);
  479. }
  480. /* Initialize per-worker working set */
  481. for (workerid = 0; workerid < starpu_worker_get_count(); workerid++) {
  482. switch (starpu_worker_get_type(workerid)) {
  483. case STARPU_CPU_WORKER:
  484. #ifdef STARPU_HAVE_FFTW
  485. if (PARALLEL) {
  486. /* first fft plan: one n2*m2 fft */
  487. plan->plans[workerid].plan1_cpu = _FFTW(plan_dft_2d)(n2, m2, NULL, (void*) 1, sign, _FFTW_FLAGS);
  488. STARPU_ASSERT(plan->plans[workerid].plan1_cpu);
  489. /* second fft plan: n3*m3 n1*m1 ffts */
  490. plan->plans[workerid].plan2_cpu = _FFTW(plan_many_dft)(plan->dim,
  491. plan->n1, n3*m3,
  492. NULL, NULL, 1, plan->totsize1,
  493. (void*) 1, NULL, 1, plan->totsize1,
  494. sign, _FFTW_FLAGS);
  495. STARPU_ASSERT(plan->plans[workerid].plan2_cpu);
  496. } else {
  497. /* fft plan: one fft of size n, m. */
  498. plan->plans[workerid].plan_cpu = _FFTW(plan_dft_2d)(n, m, NULL, (void*) 1, sign, _FFTW_FLAGS);
  499. STARPU_ASSERT(plan->plans[workerid].plan_cpu);
  500. }
  501. #else
  502. /* #warning libstarpufft can not work correctly if libfftw3 is not installed */
  503. #endif
  504. break;
  505. case STARPU_CUDA_WORKER:
  506. break;
  507. default:
  508. /* Do not care, we won't be executing anything there. */
  509. break;
  510. }
  511. }
  512. #ifdef __STARPU_USE_CUDA
  513. if (PARALLEL) {
  514. starpu_execute_on_each_worker(STARPUFFT(fft1_2d_plan_gpu), plan, STARPU_CUDA);
  515. starpu_execute_on_each_worker(STARPUFFT(fft2_2d_plan_gpu), plan, STARPU_CUDA);
  516. } else {
  517. starpu_execute_on_each_worker(STARPUFFT(fft_2d_plan_gpu), plan, STARPU_CUDA);
  518. }
  519. #endif
  520. if (PARALLEL) {
  521. /* Allocate buffers. */
  522. plan->twisted1 = STARPUFFT(malloc)(plan->totsize * sizeof(*plan->twisted1));
  523. memset(plan->twisted1, 0, plan->totsize * sizeof(*plan->twisted1));
  524. plan->fft1 = STARPUFFT(malloc)(plan->totsize * sizeof(*plan->fft1));
  525. memset(plan->fft1, 0, plan->totsize * sizeof(*plan->fft1));
  526. plan->twisted2 = STARPUFFT(malloc)(plan->totsize * sizeof(*plan->twisted2));
  527. memset(plan->twisted2, 0, plan->totsize * sizeof(*plan->twisted2));
  528. plan->fft2 = STARPUFFT(malloc)(plan->totsize * sizeof(*plan->fft2));
  529. memset(plan->fft2, 0, plan->totsize * sizeof(*plan->fft2));
  530. /* Allocate handle arrays */
  531. plan->twisted1_handle = malloc(plan->totsize1 * sizeof(*plan->twisted1_handle));
  532. plan->fft1_handle = malloc(plan->totsize1 * sizeof(*plan->fft1_handle));
  533. plan->twisted2_handle = malloc(plan->totsize3 * sizeof(*plan->twisted2_handle));
  534. plan->fft2_handle = malloc(plan->totsize3 * sizeof(*plan->fft2_handle));
  535. /* Allocate task arrays */
  536. plan->twist1_tasks = malloc(plan->totsize1 * sizeof(*plan->twist1_tasks));
  537. plan->fft1_tasks = malloc(plan->totsize1 * sizeof(*plan->fft1_tasks));
  538. plan->twist2_tasks = malloc(plan->totsize3 * sizeof(*plan->twist2_tasks));
  539. plan->fft2_tasks = malloc(plan->totsize3 * sizeof(*plan->fft2_tasks));
  540. plan->twist3_tasks = malloc(plan->totsize3 * sizeof(*plan->twist3_tasks));
  541. /* Allocate codelet argument arrays */
  542. plan->fft1_args = malloc(plan->totsize1 * sizeof(*plan->fft1_args));
  543. plan->fft2_args = malloc(plan->totsize3 * sizeof(*plan->fft2_args));
  544. /* Create first-round tasks */
  545. for (z = 0; z < plan->totsize1; z++) {
  546. int i = z / m1, j = z % m1;
  547. #define STEP_TAG(step) STEP_TAG_2D(plan, step, i, j)
  548. /* TODO: get rid of tags */
  549. plan->fft1_args[z].plan = plan;
  550. plan->fft1_args[z].i = i;
  551. plan->fft1_args[z].j = j;
  552. /* Register (n2,m2) chunks */
  553. starpu_vector_data_register(&plan->twisted1_handle[z], 0, (uintptr_t) &plan->twisted1[z*plan->totsize2], plan->totsize2, sizeof(*plan->twisted1));
  554. starpu_vector_data_register(&plan->fft1_handle[z], 0, (uintptr_t) &plan->fft1[z*plan->totsize2], plan->totsize2, sizeof(*plan->fft1));
  555. /* We'll need it on the CPU for the second twist anyway */
  556. starpu_data_set_wt_mask(plan->fft1_handle[z], 1<<0);
  557. /* Create twist1 task */
  558. plan->twist1_tasks[z] = task = starpu_task_create();
  559. task->cl = &STARPUFFT(twist1_2d_codelet);
  560. /* task->handles[0] = to be filled at execution */
  561. task->handles[1] = plan->twisted1_handle[z];
  562. task->cl_arg = &plan->fft1_args[z];
  563. task->tag_id = STEP_TAG(TWIST1);
  564. task->use_tag = 1;
  565. task->destroy = 0;
  566. /* Tell that fft1 depends on twisted1 */
  567. starpu_tag_declare_deps(STEP_TAG(FFT1),
  568. 1, STEP_TAG(TWIST1));
  569. /* Create FFT1 task */
  570. plan->fft1_tasks[z] = task = starpu_task_create();
  571. task->cl = &STARPUFFT(fft1_2d_codelet);
  572. task->handles[0] = plan->twisted1_handle[z];
  573. task->handles[1] = plan->fft1_handle[z];
  574. task->handles[2] = plan->roots_handle[0];
  575. task->handles[3] = plan->roots_handle[1];
  576. task->cl_arg = &plan->fft1_args[z];
  577. task->tag_id = STEP_TAG(FFT1);
  578. task->use_tag = 1;
  579. task->destroy = 0;
  580. /* Tell that to be done with first step we need to have
  581. * finished this fft1 */
  582. starpu_tag_declare_deps(STEP_TAG_2D(plan, JOIN, 0, 0),
  583. 1, STEP_TAG(FFT1));
  584. #undef STEP_TAG
  585. }
  586. /* Create join task */
  587. plan->join_task = task = starpu_task_create();
  588. task->cl = NULL;
  589. task->tag_id = STEP_TAG_2D(plan, JOIN, 0, 0);
  590. task->use_tag = 1;
  591. task->destroy = 0;
  592. /* Create second-round tasks */
  593. for (z = 0; z < plan->totsize3; z++) {
  594. int kk = z / DIV_2D_M, ll = z % DIV_2D_M;
  595. #define STEP_TAG(step) STEP_TAG_2D(plan, step, kk, ll)
  596. plan->fft2_args[z].plan = plan;
  597. plan->fft2_args[z].kk = kk;
  598. plan->fft2_args[z].ll = ll;
  599. /* Register n3*m3 (n1,m1) chunks */
  600. starpu_vector_data_register(&plan->twisted2_handle[z], 0, (uintptr_t) &plan->twisted2[z*plan->totsize4], plan->totsize4, sizeof(*plan->twisted2));
  601. starpu_vector_data_register(&plan->fft2_handle[z], 0, (uintptr_t) &plan->fft2[z*plan->totsize4], plan->totsize4, sizeof(*plan->fft2));
  602. /* We'll need it on the CPU for the last twist anyway */
  603. starpu_data_set_wt_mask(plan->fft2_handle[z], 1<<0);
  604. /* Tell that twisted2 depends on the whole first step to be
  605. * done */
  606. starpu_tag_declare_deps(STEP_TAG(TWIST2),
  607. 1, STEP_TAG_2D(plan, JOIN, 0, 0));
  608. /* Create twist2 task */
  609. plan->twist2_tasks[z] = task = starpu_task_create();
  610. task->cl = &STARPUFFT(twist2_2d_codelet);
  611. task->handles[0] = plan->twisted2_handle[z];
  612. task->cl_arg = &plan->fft2_args[z];
  613. task->tag_id = STEP_TAG(TWIST2);
  614. task->use_tag = 1;
  615. task->destroy = 0;
  616. /* Tell that fft2 depends on twisted2 */
  617. starpu_tag_declare_deps(STEP_TAG(FFT2),
  618. 1, STEP_TAG(TWIST2));
  619. /* Create FFT2 task */
  620. plan->fft2_tasks[z] = task = starpu_task_create();
  621. task->cl = &STARPUFFT(fft2_2d_codelet);
  622. task->handles[0] = plan->twisted2_handle[z];
  623. task->handles[1] = plan->fft2_handle[z];
  624. task->cl_arg = &plan->fft2_args[z];
  625. task->tag_id = STEP_TAG(FFT2);
  626. task->use_tag = 1;
  627. task->destroy = 0;
  628. /* Tell that twist3 depends on fft2 */
  629. starpu_tag_declare_deps(STEP_TAG(TWIST3),
  630. 1, STEP_TAG(FFT2));
  631. /* Create twist3 tasks */
  632. /* These run only on CPUs and thus write directly into the
  633. * application output buffer. */
  634. plan->twist3_tasks[z] = task = starpu_task_create();
  635. task->cl = &STARPUFFT(twist3_2d_codelet);
  636. task->handles[0] = plan->fft2_handle[z];
  637. task->cl_arg = &plan->fft2_args[z];
  638. task->tag_id = STEP_TAG(TWIST3);
  639. task->use_tag = 1;
  640. task->destroy = 0;
  641. /* Tell that to be completely finished we need to have finished this twisted3 */
  642. starpu_tag_declare_deps(STEP_TAG_2D(plan, END, 0, 0),
  643. 1, STEP_TAG(TWIST3));
  644. #undef STEP_TAG
  645. }
  646. /* Create end task */
  647. plan->end_task = task = starpu_task_create();
  648. task->cl = NULL;
  649. task->tag_id = STEP_TAG_2D(plan, END, 0, 0);
  650. task->use_tag = 1;
  651. task->destroy = 0;
  652. }
  653. return plan;
  654. }
  655. /* Actually submit all the tasks. */
  656. static struct starpu_task *
  657. STARPUFFT(start2dC2C)(STARPUFFT(plan) plan, starpu_data_handle_t in, starpu_data_handle_t out)
  658. {
  659. STARPU_ASSERT(plan->type == C2C);
  660. int z;
  661. int ret;
  662. if (PARALLEL) {
  663. for (z=0; z < plan->totsize1; z++) {
  664. ret = starpu_task_submit(plan->twist1_tasks[z]);
  665. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  666. ret = starpu_task_submit(plan->fft1_tasks[z]);
  667. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  668. }
  669. ret = starpu_task_submit(plan->join_task);
  670. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  671. for (z=0; z < plan->totsize3; z++) {
  672. ret = starpu_task_submit(plan->twist2_tasks[z]);
  673. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  674. ret = starpu_task_submit(plan->fft2_tasks[z]);
  675. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  676. ret = starpu_task_submit(plan->twist3_tasks[z]);
  677. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  678. }
  679. ret = starpu_task_submit(plan->end_task);
  680. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  681. return plan->end_task;
  682. } else /* !PARALLEL */ {
  683. struct starpu_task *task;
  684. /* Create FFT task */
  685. task = starpu_task_create();
  686. task->detach = 0;
  687. task->cl = &STARPUFFT(fft_2d_codelet);
  688. task->handles[0] = in;
  689. task->handles[1] = out;
  690. task->cl_arg = plan;
  691. ret = starpu_task_submit(task);
  692. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  693. return task;
  694. }
  695. }
  696. /* Free all the tags. The generic code handles freeing the buffers. */
  697. static void
  698. STARPUFFT(free_2d_tags)(STARPUFFT(plan) plan)
  699. {
  700. unsigned i, j;
  701. int n1 = plan->n1[0];
  702. int m1 = plan->n1[1];
  703. if (!PARALLEL)
  704. return;
  705. for (i = 0; i < n1; i++) {
  706. for (j = 0; j < m1; j++) {
  707. starpu_tag_remove(STEP_TAG_2D(plan, TWIST1, i, j));
  708. starpu_tag_remove(STEP_TAG_2D(plan, FFT1, i, j));
  709. }
  710. }
  711. starpu_tag_remove(STEP_TAG_2D(plan, JOIN, 0, 0));
  712. for (i = 0; i < DIV_2D_N; i++) {
  713. for (j = 0; j < DIV_2D_M; j++) {
  714. starpu_tag_remove(STEP_TAG_2D(plan, TWIST2, i, j));
  715. starpu_tag_remove(STEP_TAG_2D(plan, FFT2, i, j));
  716. starpu_tag_remove(STEP_TAG_2D(plan, TWIST3, i, j));
  717. }
  718. }
  719. starpu_tag_remove(STEP_TAG_2D(plan, END, 0, 0));
  720. }