shadow4d.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2021 Université de Bordeaux, CNRS (LaBRI UMR 5800), Inria
  4. * Copyright (C) 2010 Mehdi Juhoor
  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. /*
  18. * This examplifies the use of the 4D matrix shadow filters: a source "matrix" of
  19. * NX*NY*NZ*NT elements (plus SHADOW wrap-around elements) is partitioned into
  20. * matrices with some shadowing, and these are copied into a destination
  21. * "matrix2" of
  22. * NRPARTSX*NPARTSY*NPARTSZ*NPARTST*((NX/NPARTSX+2*SHADOWX)*(NY/NPARTSY+2*SHADOWY)*(NZ/NPARTSZ+2*SHADOWZ)*(NT/NPARTST+2*SHADOWT))
  23. * elements, partitioned in the traditionnal way, thus showing how shadowing
  24. * shows up.
  25. */
  26. #include <starpu.h>
  27. /* Shadow width */
  28. #define SHADOWX 2
  29. #define SHADOWY 2
  30. #define SHADOWZ 1
  31. #define SHADOWT 1
  32. #define NX 6
  33. #define NY 6
  34. #define NZ 2
  35. #define NT 2
  36. #define PARTSX 2
  37. #define PARTSY 2
  38. #define PARTSZ 2
  39. #define PARTST 2
  40. #define FPRINTF(ofile, fmt, ...) do { if (!getenv("STARPU_SSILENT")) {fprintf(ofile, fmt, ## __VA_ARGS__); }} while(0)
  41. void cpu_func(void *buffers[], void *cl_arg)
  42. {
  43. (void)cl_arg;
  44. /* length of the shadowed source matrix */
  45. unsigned ldy = STARPU_TENSOR_GET_LDY(buffers[0]);
  46. unsigned ldz = STARPU_TENSOR_GET_LDZ(buffers[0]);
  47. unsigned ldt = STARPU_TENSOR_GET_LDT(buffers[0]);
  48. unsigned x = STARPU_TENSOR_GET_NX(buffers[0]);
  49. unsigned y = STARPU_TENSOR_GET_NY(buffers[0]);
  50. unsigned z = STARPU_TENSOR_GET_NZ(buffers[0]);
  51. unsigned t = STARPU_TENSOR_GET_NT(buffers[0]);
  52. /* local copy of the shadowed source matrix pointer */
  53. int *val = (int *)STARPU_TENSOR_GET_PTR(buffers[0]);
  54. /* length of the destination matrix */
  55. unsigned ldy2 = STARPU_TENSOR_GET_LDY(buffers[1]);
  56. unsigned ldz2 = STARPU_TENSOR_GET_LDZ(buffers[1]);
  57. unsigned ldt2 = STARPU_TENSOR_GET_LDT(buffers[1]);
  58. unsigned x2 = STARPU_TENSOR_GET_NX(buffers[1]);
  59. unsigned y2 = STARPU_TENSOR_GET_NY(buffers[1]);
  60. unsigned z2 = STARPU_TENSOR_GET_NZ(buffers[1]);
  61. unsigned t2 = STARPU_TENSOR_GET_NT(buffers[1]);
  62. /* local copy of the destination matrix pointer */
  63. int *val2 = (int *)STARPU_TENSOR_GET_PTR(buffers[1]);
  64. unsigned i, j, k, l;
  65. /* If things go right, sizes should match */
  66. STARPU_ASSERT(x == x2);
  67. STARPU_ASSERT(y == y2);
  68. STARPU_ASSERT(z == z2);
  69. STARPU_ASSERT(t == t2);
  70. for (l = 0; l < t; l++)
  71. for (k = 0; k < z; k++)
  72. for (j = 0; j < y; j++)
  73. for (i = 0; i < x; i++)
  74. val2[l*ldt2+k*ldz2+j*ldy2+i] = val[l*ldt+k*ldz+j*ldy+i];
  75. }
  76. #ifdef STARPU_USE_CUDA
  77. void cuda_func(void *buffers[], void *cl_arg)
  78. {
  79. (void)cl_arg;
  80. /* length of the shadowed source matrix*/
  81. unsigned ldy = STARPU_TENSOR_GET_LDY(buffers[0]);
  82. unsigned ldz = STARPU_TENSOR_GET_LDZ(buffers[0]);
  83. unsigned ldt = STARPU_TENSOR_GET_LDT(buffers[0]);
  84. unsigned x = STARPU_TENSOR_GET_NX(buffers[0]);
  85. unsigned y = STARPU_TENSOR_GET_NY(buffers[0]);
  86. unsigned z = STARPU_TENSOR_GET_NZ(buffers[0]);
  87. unsigned t = STARPU_TENSOR_GET_NT(buffers[0]);
  88. /* local copy of the shadowed source matrix pointer */
  89. int *val = (int *)STARPU_TENSOR_GET_PTR(buffers[0]);
  90. /* length of the destination matrix */
  91. unsigned ldy2 = STARPU_TENSOR_GET_LDY(buffers[1]);
  92. unsigned ldz2 = STARPU_TENSOR_GET_LDZ(buffers[1]);
  93. unsigned ldt2 = STARPU_TENSOR_GET_LDT(buffers[1]);
  94. unsigned x2 = STARPU_TENSOR_GET_NX(buffers[1]);
  95. unsigned y2 = STARPU_TENSOR_GET_NY(buffers[1]);
  96. unsigned z2 = STARPU_TENSOR_GET_NZ(buffers[1]);
  97. unsigned t2 = STARPU_TENSOR_GET_NT(buffers[1]);
  98. /* local copy of the destination matrix pointer */
  99. int *val2 = (int *)STARPU_TENSOR_GET_PTR(buffers[1]);
  100. unsigned l;
  101. cudaError_t cures;
  102. /* If things go right, sizes should match */
  103. STARPU_ASSERT(x == x2);
  104. STARPU_ASSERT(y == y2);
  105. STARPU_ASSERT(z == z2);
  106. STARPU_ASSERT(t == t2);
  107. for (l = 0; l < t; l++)
  108. {
  109. for (k = 0; k < z; k++)
  110. {
  111. cures = cudaMemcpy2DAsync(val2+k*ldz2+l*ldt2, ldy2*sizeof(*val2), val+k*ldz+l*ldt, ldy*sizeof(*val),
  112. x*sizeof(*val), y, cudaMemcpyDeviceToDevice, starpu_cuda_get_local_stream());
  113. STARPU_ASSERT(!cures);
  114. }
  115. }
  116. }
  117. #endif
  118. int main(void)
  119. {
  120. unsigned i, j, k, l, m, n, p, q;
  121. int matrix[NT + 2*SHADOWT][NZ + 2*SHADOWZ][NY + 2*SHADOWY][NX + 2*SHADOWX];
  122. int matrix2[NT + PARTST*2*SHADOWT][NZ + PARTSZ*2*SHADOWZ][NY + PARTSY*2*SHADOWY][NX + PARTSX*2*SHADOWX];
  123. starpu_data_handle_t handle, handle2;
  124. int ret;
  125. struct starpu_codelet cl =
  126. {
  127. .cpu_funcs = {cpu_func},
  128. .cpu_funcs_name = {"cpu_func"},
  129. #ifdef STARPU_USE_CUDA
  130. .cuda_funcs = {cuda_func},
  131. .cuda_flags = {STARPU_CUDA_ASYNC},
  132. #endif
  133. .nbuffers = 2,
  134. .modes = {STARPU_R, STARPU_W}
  135. };
  136. memset(matrix, -1, sizeof(matrix));
  137. for(l=1 ; l<=NT ; l++)
  138. for(k=1 ; k<=NZ ; k++)
  139. for(j=1 ; j<=NY ; j++)
  140. for(i=1 ; i<=NX ; i++)
  141. matrix[SHADOWT+l-1][SHADOWZ+k-1][SHADOWY+j-1][SHADOWX+i-1] = i+j+k+l;
  142. /*copy cubes*/
  143. for (l = SHADOWT ; l<SHADOWT+NT ; l++)
  144. for (k = SHADOWZ ; k<SHADOWZ+NZ ; k++)
  145. for (j = SHADOWY ; j<SHADOWY+NY ; j++)
  146. for(i=0 ; i<SHADOWX ; i++)
  147. {
  148. matrix[l][k][j][i] = matrix[l][k][j][i+NX];
  149. matrix[l][k][j][SHADOWX+NX+i] = matrix[l][k][j][SHADOWX+i];
  150. }
  151. for (l = SHADOWT ; l<SHADOWT+NT ; l++)
  152. for(k=SHADOWZ ; k<SHADOWZ+NZ ; k++)
  153. for(j=0 ; j<SHADOWY ; j++)
  154. for(i=SHADOWX ; i<SHADOWX+NX ; i++)
  155. {
  156. matrix[l][k][j][i] = matrix[l][k][j+NY][i];
  157. matrix[l][k][SHADOWY+NY+j][i] = matrix[l][k][SHADOWY+j][i];
  158. }
  159. for (l = SHADOWT ; l<SHADOWT+NT ; l++)
  160. for(k=0 ; k<SHADOWZ ; k++)
  161. for(j=SHADOWY ; j<SHADOWY+NY ; j++)
  162. for(i=SHADOWX ; i<SHADOWX+NX ; i++)
  163. {
  164. matrix[l][k][j][i] = matrix[l][k+NZ][j][i];
  165. matrix[l][SHADOWZ+NZ+k][j][i] = matrix[l][SHADOWZ+k][j][i];
  166. }
  167. for (l = 0 ; l<SHADOWT ; l++)
  168. for(k=SHADOWZ ; k<SHADOWZ+NZ ; k++)
  169. for(j=SHADOWY ; j<SHADOWY+NY ; j++)
  170. for(i=SHADOWX ; i<SHADOWX+NX ; i++)
  171. {
  172. matrix[l][k][j][i] = matrix[l+NT][k][j][i];
  173. matrix[SHADOWT+NT+l][k][j][i] = matrix[SHADOWT+l][k][j][i];
  174. }
  175. /*copy planes*/
  176. for (l = SHADOWT ; l<SHADOWT+NT ; l++)
  177. for (k = SHADOWZ ; k<SHADOWZ+NZ ; k++)
  178. for(j=0 ; j<SHADOWY ; j++)
  179. for(i=0 ; i<SHADOWX ; i++)
  180. {
  181. matrix[l][k][j][i] = matrix[l][k][j+NY][i+NX];
  182. matrix[l][k][j][SHADOWX+NX+i] = matrix[l][k][j+NY][SHADOWX+i];
  183. matrix[l][k][SHADOWY+NY+j][i] = matrix[l][k][SHADOWY+j][i+NX];
  184. matrix[l][k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[l][k][SHADOWY+j][SHADOWX+i];
  185. }
  186. for (l = SHADOWT ; l<SHADOWT+NT ; l++)
  187. for (k=0 ; k<SHADOWZ ; k++)
  188. for(j = SHADOWY ; j<SHADOWY+NY ; j++)
  189. for(i=0 ; i<SHADOWX ; i++)
  190. {
  191. matrix[l][k][j][i] = matrix[l][k+NZ][j][i+NX];
  192. matrix[l][k][j][SHADOWX+NX+i] = matrix[l][k+NZ][j][SHADOWX+i];
  193. matrix[l][SHADOWZ+NZ+k][j][i] = matrix[l][SHADOWZ+k][j][i+NX];
  194. matrix[l][SHADOWZ+NZ+k][j][SHADOWX+NX+i] = matrix[l][SHADOWZ+k][j][SHADOWX+i];
  195. }
  196. for (l = SHADOWT ; l<SHADOWT+NT ; l++)
  197. for (k=0 ; k<SHADOWZ ; k++)
  198. for(j=0 ; j<SHADOWY ; j++)
  199. for(i=SHADOWX ; i<SHADOWX+NX ; i++)
  200. {
  201. matrix[l][k][j][i] = matrix[l][k+NZ][j+NY][i];
  202. matrix[l][k][SHADOWY+NY+j][i] = matrix[l][k+NZ][SHADOWY+j][i];
  203. matrix[l][SHADOWZ+NZ+k][j][i] = matrix[l][SHADOWZ+k][j+NY][i];
  204. matrix[l][SHADOWZ+NZ+k][SHADOWY+NY+j][i] = matrix[l][SHADOWZ+k][SHADOWY+j][i];
  205. }
  206. for (l=0 ; l<SHADOWT ; l++)
  207. for (k = SHADOWZ ; k<SHADOWZ+NZ ; k++)
  208. for(j = SHADOWY ; j<SHADOWY+NY ; j++)
  209. for(i=0 ; i<SHADOWX ; i++)
  210. {
  211. matrix[l][k][j][i] = matrix[l+NT][k][j][i+NX];
  212. matrix[l][k][j][SHADOWX+NX+i] = matrix[l+NT][k][j][SHADOWX+i];
  213. matrix[SHADOWT+NT+l][k][j][i] = matrix[SHADOWT+l][k][j][i+NX];
  214. matrix[SHADOWT+NT+l][k][j][SHADOWX+NX+i] = matrix[SHADOWT+l][k][j][SHADOWX+i];
  215. }
  216. for (l=0 ; l<SHADOWT ; l++)
  217. for (k = SHADOWZ ; k<SHADOWZ+NZ ; k++)
  218. for(j=0 ; j<SHADOWY ; j++)
  219. for(i=SHADOWX ; i<SHADOWX+NX ; i++)
  220. {
  221. matrix[l][k][j][i] = matrix[l+NT][k][j+NY][i];
  222. matrix[l][k][SHADOWY+NY+j][i] = matrix[l+NT][k][SHADOWY+j][i];
  223. matrix[SHADOWT+NT+l][k][j][i] = matrix[SHADOWT+l][k][j+NY][i];
  224. matrix[SHADOWT+NT+l][k][SHADOWY+NY+j][i] = matrix[SHADOWT+l][k][SHADOWY+j][i];
  225. }
  226. for (l=0 ; l<SHADOWT ; l++)
  227. for(k=0 ; k<SHADOWZ ; k++)
  228. for (j = SHADOWY ; j<SHADOWY+NY ; j++)
  229. for(i=SHADOWX ; i<SHADOWX+NX ; i++)
  230. {
  231. matrix[l][k][j][i] = matrix[l+NT][k+NZ][j][i];
  232. matrix[l][SHADOWZ+NZ+k][j][i] = matrix[l+NT][SHADOWZ+k][j][i];
  233. matrix[SHADOWT+NT+l][k][j][i] = matrix[SHADOWT+l][k+NZ][j][i];
  234. matrix[SHADOWT+NT+l][SHADOWZ+NZ+k][j][i] = matrix[SHADOWT+l][SHADOWZ+k][j][i];
  235. }
  236. /* Copy borders */
  237. for (l = SHADOWT ; l<SHADOWT+NT ; l++)
  238. for (k=0 ; k<SHADOWZ ; k++)
  239. for(j=0 ; j<SHADOWY ; j++)
  240. for(i=0 ; i<SHADOWX ; i++)
  241. {
  242. matrix[l][k][j][i] = matrix[l][k+NZ][j+NY][i+NX];
  243. matrix[l][k][j][SHADOWX+NX+i] = matrix[l][k+NZ][j+NY][SHADOWX+i];
  244. matrix[l][k][SHADOWY+NY+j][i] = matrix[l][k+NZ][SHADOWY+j][i+NX];
  245. matrix[l][k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[l][k+NZ][SHADOWY+j][SHADOWX+i];
  246. matrix[l][SHADOWZ+NZ+k][j][i] = matrix[l][SHADOWZ+k][j+NY][i+NX];
  247. matrix[l][SHADOWZ+NZ+k][j][SHADOWX+NX+i] = matrix[l][SHADOWZ+k][j+NY][SHADOWX+i];
  248. matrix[l][SHADOWZ+NZ+k][SHADOWY+NY+j][i] = matrix[l][SHADOWZ+k][SHADOWY+j][i+NX];
  249. matrix[l][SHADOWZ+NZ+k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[l][SHADOWZ+k][SHADOWY+j][SHADOWX+i];
  250. }
  251. for (l=0 ; l<SHADOWT ; l++)
  252. for (k = SHADOWZ ; k<SHADOWZ+NZ ; k++)
  253. for(j=0 ; j<SHADOWY ; j++)
  254. for(i=0 ; i<SHADOWX ; i++)
  255. {
  256. matrix[l][k][j][i] = matrix[l+NT][k][j+NY][i+NX];
  257. matrix[l][k][j][SHADOWX+NX+i] = matrix[l+NT][k][j+NY][SHADOWX+i];
  258. matrix[l][k][SHADOWY+NY+j][i] = matrix[l+NT][k][SHADOWY+j][i+NX];
  259. matrix[SHADOWT+NT+l][k][j][i] = matrix[SHADOWT+l][k][j+NY][i+NX];
  260. matrix[l][k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[l+NT][k][SHADOWY+j][SHADOWX+i];
  261. matrix[SHADOWT+NT+l][k][j][SHADOWX+NX+i] = matrix[SHADOWT+l][k][j+NY][SHADOWX+i];
  262. matrix[SHADOWT+NT+l][k][SHADOWY+NY+j][i] = matrix[SHADOWT+l][k][SHADOWY+j][i+NX];
  263. matrix[SHADOWT+NT+l][k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[SHADOWT+l][k][SHADOWY+j][SHADOWX+i];
  264. }
  265. for (l=0 ; l<SHADOWT ; l++)
  266. for(k=0 ; k<SHADOWZ ; k++)
  267. for (j = SHADOWY ; j<SHADOWY+NY ; j++)
  268. for(i=0 ; i<SHADOWX ; i++)
  269. {
  270. matrix[l][k][j][i] = matrix[l+NT][k+NZ][j][i+NX];
  271. matrix[l][k][j][SHADOWX+NX+i] = matrix[l+NT][k+NZ][j][SHADOWX+i];
  272. matrix[l][SHADOWZ+NZ+k][j][i] = matrix[l+NT][SHADOWZ+k][j][i+NX];
  273. matrix[SHADOWT+NT+l][k][j][i] = matrix[SHADOWT+l][k+NZ][j][i+NX];
  274. matrix[l][SHADOWZ+NZ+k][j][SHADOWX+NX+i] = matrix[l+NT][SHADOWZ+k][j][SHADOWX+i];
  275. matrix[SHADOWT+NT+l][k][j][SHADOWX+NX+i] = matrix[SHADOWT+l][k+NZ][j][SHADOWX+i];
  276. matrix[SHADOWT+NT+l][SHADOWZ+NZ+k][j][i] = matrix[SHADOWT+l][SHADOWZ+k][j][i+NX];
  277. matrix[SHADOWT+NT+l][SHADOWZ+NZ+k][j][SHADOWX+NX+i] = matrix[SHADOWT+l][SHADOWZ+k][j][SHADOWX+i];
  278. }
  279. for (l=0 ; l<SHADOWT ; l++)
  280. for(k=0 ; k<SHADOWZ ; k++)
  281. for(j=0 ; j<SHADOWY ; j++)
  282. for(i=SHADOWX ; i<SHADOWX+NX ; i++)
  283. {
  284. matrix[l][k][j][i] = matrix[l+NT][k+NZ][j+NY][i];
  285. matrix[l][k][SHADOWY+NY+j][i] = matrix[l+NT][k+NZ][SHADOWY+j][i];
  286. matrix[l][SHADOWZ+NZ+k][j][i] = matrix[l+NT][SHADOWZ+k][j+NY][i];
  287. matrix[SHADOWT+NT+l][k][j][i] = matrix[SHADOWT+l][k+NZ][j+NY][i];
  288. matrix[l][SHADOWZ+NZ+k][SHADOWY+NY+j][i] = matrix[l+NT][SHADOWZ+k][SHADOWY+j][i];
  289. matrix[SHADOWT+NT+l][k][SHADOWY+NY+j][i] = matrix[SHADOWT+l][k+NZ][SHADOWY+j][i];
  290. matrix[SHADOWT+NT+l][SHADOWZ+NZ+k][j][i] = matrix[SHADOWT+l][SHADOWZ+k][j+NY][i];
  291. matrix[SHADOWT+NT+l][SHADOWZ+NZ+k][SHADOWY+NY+j][i] = matrix[SHADOWT+l][SHADOWZ+k][SHADOWY+j][i];
  292. }
  293. /* Copy corners */
  294. for(l=0 ; l<SHADOWT ; l++)
  295. for(k=0 ; k<SHADOWZ ; k++)
  296. for(j=0 ; j<SHADOWY ; j++)
  297. for(i=0 ; i<SHADOWX ; i++)
  298. {
  299. matrix[l][k][j][i] = matrix[l+NT][k+NZ][j+NY][i+NX];
  300. matrix[l][k][j][SHADOWX+NX+i] = matrix[l+NT][k+NZ][j+NY][SHADOWX+i];
  301. matrix[l][k][SHADOWY+NY+j][i] = matrix[l+NT][k+NZ][SHADOWY+j][i+NX];
  302. matrix[l][k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[l+NT][k+NZ][SHADOWY+j][SHADOWX+i];
  303. matrix[l][SHADOWZ+NZ+k][j][i] = matrix[l+NT][SHADOWZ+k][j+NY][i+NX];
  304. matrix[l][SHADOWZ+NZ+k][j][SHADOWX+NX+i] = matrix[l+NT][SHADOWZ+k][j+NY][SHADOWX+i];
  305. matrix[l][SHADOWZ+NZ+k][SHADOWY+NY+j][i] = matrix[l+NT][SHADOWZ+k][SHADOWY+j][i+NX];
  306. matrix[l][SHADOWZ+NZ+k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[l+NT][SHADOWZ+k][SHADOWY+j][SHADOWX+i];
  307. matrix[SHADOWT+NT+l][k][j][i] = matrix[SHADOWT+l][k+NZ][j+NY][i+NX];
  308. matrix[SHADOWT+NT+l][k][j][SHADOWX+NX+i] = matrix[SHADOWT+l][k+NZ][j+NY][SHADOWX+i];
  309. matrix[SHADOWT+NT+l][k][SHADOWY+NY+j][i] = matrix[SHADOWT+l][k+NZ][SHADOWY+j][i+NX];
  310. matrix[SHADOWT+NT+l][SHADOWZ+NZ+k][j][i] = matrix[SHADOWT+l][SHADOWZ+k][j+NY][i+NX];
  311. matrix[SHADOWT+NT+l][k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[SHADOWT+l][k+NZ][SHADOWY+j][SHADOWX+i];
  312. matrix[SHADOWT+NT+l][SHADOWZ+NZ+k][j][SHADOWX+NX+i] = matrix[SHADOWT+l][SHADOWZ+k][j+NY][SHADOWX+i];
  313. matrix[SHADOWT+NT+l][SHADOWZ+NZ+k][SHADOWY+NY+j][i] = matrix[SHADOWT+l][SHADOWZ+k][SHADOWY+j][i+NX];
  314. matrix[SHADOWT+NT+l][SHADOWZ+NZ+k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[SHADOWT+l][SHADOWZ+k][SHADOWY+j][SHADOWX+i];
  315. }
  316. FPRINTF(stderr,"IN Matrix:\n");
  317. for(l=0 ; l<NT + 2*SHADOWT ; l++)
  318. {
  319. for(k=0 ; k<NZ + 2*SHADOWZ ; k++)
  320. {
  321. for(j=0 ; j<NY + 2*SHADOWY ; j++)
  322. {
  323. for(i=0 ; i<NX + 2*SHADOWX ; i++)
  324. FPRINTF(stderr, "%5d ", matrix[l][k][j][i]);
  325. FPRINTF(stderr,"\n");
  326. }
  327. FPRINTF(stderr,"\n\n");
  328. }
  329. FPRINTF(stderr,"\n\n");
  330. }
  331. FPRINTF(stderr,"\n");
  332. ret = starpu_init(NULL);
  333. if (ret == -ENODEV)
  334. exit(77);
  335. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  336. /* Declare source matrix to StarPU */
  337. starpu_tensor_data_register(&handle, STARPU_MAIN_RAM, (uintptr_t)matrix,
  338. NX + 2*SHADOWX, (NX + 2*SHADOWX) * (NY + 2*SHADOWY), (NX + 2*SHADOWX) * (NY + 2*SHADOWY) * (NZ + 2*SHADOWZ),
  339. NX + 2*SHADOWX, NY + 2*SHADOWY, NZ + 2*SHADOWZ, NT + 2*SHADOWT,
  340. sizeof(matrix[0][0][0][0]));
  341. /* Declare destination matrix to StarPU */
  342. starpu_tensor_data_register(&handle2, STARPU_MAIN_RAM, (uintptr_t)matrix2,
  343. NX + PARTSX*2*SHADOWX, (NX + PARTSX*2*SHADOWX) * (NY + PARTSY*2*SHADOWY), (NX + PARTSX*2*SHADOWX) * (NY + PARTSY*2*SHADOWY) * (NZ + PARTSZ*2*SHADOWZ),
  344. NX + PARTSX*2*SHADOWX, NY + PARTSY*2*SHADOWY, NZ + PARTSZ*2*SHADOWZ, NT + PARTST*2*SHADOWT,
  345. sizeof(matrix2[0][0][0][0]));
  346. /* Partition the source matrix in PARTST*PARTSZ*PARTSY*PARTSX sub-matrices with shadows */
  347. /* NOTE: the resulting handles should only be used in read-only mode,
  348. * as StarPU will not know how the overlapping parts would have to be
  349. * combined. */
  350. struct starpu_data_filter ft =
  351. {
  352. .filter_func = starpu_tensor_filter_time_block_shadow,
  353. .nchildren = PARTST,
  354. .filter_arg_ptr = (void*)(uintptr_t) SHADOWT /* Shadow width */
  355. };
  356. struct starpu_data_filter fz =
  357. {
  358. .filter_func = starpu_tensor_filter_depth_block_shadow,
  359. .nchildren = PARTSZ,
  360. .filter_arg_ptr = (void*)(uintptr_t) SHADOWZ /* Shadow width */
  361. };
  362. struct starpu_data_filter fy =
  363. {
  364. .filter_func = starpu_tensor_filter_vertical_block_shadow,
  365. .nchildren = PARTSY,
  366. .filter_arg_ptr = (void*)(uintptr_t) SHADOWY /* Shadow width */
  367. };
  368. struct starpu_data_filter fx =
  369. {
  370. .filter_func = starpu_tensor_filter_block_shadow,
  371. .nchildren = PARTSX,
  372. .filter_arg_ptr = (void*)(uintptr_t) SHADOWX /* Shadow width */
  373. };
  374. starpu_data_map_filters(handle, 4, &ft, &fz, &fy, &fx);
  375. /* Partition the destination matrix in PARTST*PARTSZ*PARTSY*PARTSX sub-matrices */
  376. struct starpu_data_filter ft2 =
  377. {
  378. .filter_func = starpu_tensor_filter_time_block,
  379. .nchildren = PARTST,
  380. };
  381. struct starpu_data_filter fz2 =
  382. {
  383. .filter_func = starpu_tensor_filter_depth_block,
  384. .nchildren = PARTSZ,
  385. };
  386. struct starpu_data_filter fy2 =
  387. {
  388. .filter_func = starpu_tensor_filter_vertical_block,
  389. .nchildren = PARTSY,
  390. };
  391. struct starpu_data_filter fx2 =
  392. {
  393. .filter_func = starpu_tensor_filter_block,
  394. .nchildren = PARTSX,
  395. };
  396. starpu_data_map_filters(handle2, 4, &ft2, &fz2, &fy2, &fx2);
  397. /* Submit a task on each sub-matrix */
  398. for (l=0; l<PARTST; l++)
  399. {
  400. for (k=0; k<PARTSZ; k++)
  401. {
  402. for (j=0; j<PARTSY; j++)
  403. {
  404. for (i=0; i<PARTSX; i++)
  405. {
  406. starpu_data_handle_t sub_handle = starpu_data_get_sub_data(handle, 4, l, k, j, i);
  407. starpu_data_handle_t sub_handle2 = starpu_data_get_sub_data(handle2, 4, l, k, j, i);
  408. struct starpu_task *task = starpu_task_create();
  409. task->handles[0] = sub_handle;
  410. task->handles[1] = sub_handle2;
  411. task->cl = &cl;
  412. task->synchronous = 1;
  413. ret = starpu_task_submit(task);
  414. if (ret == -ENODEV) goto enodev;
  415. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  416. }
  417. }
  418. }
  419. }
  420. starpu_data_unpartition(handle, STARPU_MAIN_RAM);
  421. starpu_data_unpartition(handle2, STARPU_MAIN_RAM);
  422. starpu_data_unregister(handle);
  423. starpu_data_unregister(handle2);
  424. starpu_shutdown();
  425. FPRINTF(stderr,"OUT Matrix:\n");
  426. for(l=0 ; l<NT + PARTST*2*SHADOWT ; l++)
  427. {
  428. for(k=0 ; k<NZ + PARTSZ*2*SHADOWZ ; k++)
  429. {
  430. for(j=0 ; j<NY + PARTSY*2*SHADOWY ; j++)
  431. {
  432. for(i=0 ; i<NX + PARTSX*2*SHADOWX ; i++)
  433. {
  434. FPRINTF(stderr, "%5d ", matrix2[l][k][j][i]);
  435. }
  436. FPRINTF(stderr,"\n");
  437. }
  438. FPRINTF(stderr,"\n\n");
  439. }
  440. FPRINTF(stderr,"\n\n");
  441. }
  442. FPRINTF(stderr,"\n");
  443. for(l=0 ; l<PARTST ; l++)
  444. for(k=0 ; k<PARTSZ ; k++)
  445. for(j=0 ; j<PARTSY ; j++)
  446. for(i=0 ; i<PARTSX ; i++)
  447. for (q=0 ; q<NT/PARTST + 2*SHADOWT ; q++)
  448. for (p=0 ; p<NZ/PARTSZ + 2*SHADOWZ ; p++)
  449. for (n=0 ; n<NY/PARTSY + 2*SHADOWY ; n++)
  450. for (m=0 ; m<NX/PARTSX + 2*SHADOWX ; m++)
  451. STARPU_ASSERT(matrix2[l*(NT/PARTST+2*SHADOWT)+q][k*(NZ/PARTSZ+2*SHADOWZ)+p][j*(NY/PARTSY+2*SHADOWY)+n][i*(NX/PARTSX+2*SHADOWX)+m] ==
  452. matrix[l*(NT/PARTST)+q][k*(NZ/PARTSZ)+p][j*(NY/PARTSY)+n][i*(NX/PARTSX)+m]);
  453. return 0;
  454. enodev:
  455. FPRINTF(stderr, "WARNING: No one can execute this task\n");
  456. starpu_shutdown();
  457. return 77;
  458. }