shadow3d.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 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. /*
  18. * This examplifies the use of the 3D matrix shadow filters: a source "matrix" of
  19. * NX*NY*NZ 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*((NX/NPARTSX+2*SHADOWX)*(NY/NPARTSY+2*SHADOWY)*(NZ/NPARTSZ+2*SHADOWZ))
  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 3
  30. #define SHADOWZ 4
  31. #define NX 12
  32. #define NY 9
  33. #define NZ 6
  34. #define PARTSX 4
  35. #define PARTSY 3
  36. #define PARTSZ 2
  37. #define FPRINTF(ofile, fmt, args ...) do { if (!getenv("STARPU_SSILENT")) {fprintf(ofile, fmt, ##args); }} while(0)
  38. void cpu_func(void *buffers[], void *cl_arg)
  39. {
  40. /* length of the shadowed source matrix */
  41. unsigned ldy = STARPU_BLOCK_GET_LDY(buffers[0]);
  42. unsigned ldz = STARPU_BLOCK_GET_LDZ(buffers[0]);
  43. unsigned x = STARPU_BLOCK_GET_NX(buffers[0]);
  44. unsigned y = STARPU_BLOCK_GET_NY(buffers[0]);
  45. unsigned z = STARPU_BLOCK_GET_NZ(buffers[0]);
  46. /* local copy of the shadowed source matrix pointer */
  47. int *val = (int *)STARPU_BLOCK_GET_PTR(buffers[0]);
  48. /* length of the destination matrix */
  49. unsigned ldy2 = STARPU_BLOCK_GET_LDY(buffers[1]);
  50. unsigned ldz2 = STARPU_BLOCK_GET_LDZ(buffers[1]);
  51. unsigned x2 = STARPU_BLOCK_GET_NX(buffers[1]);
  52. unsigned y2 = STARPU_BLOCK_GET_NY(buffers[1]);
  53. unsigned z2 = STARPU_BLOCK_GET_NZ(buffers[1]);
  54. /* local copy of the destination matrix pointer */
  55. int *val2 = (int *)STARPU_BLOCK_GET_PTR(buffers[1]);
  56. unsigned i, j, k;
  57. /* If things go right, sizes should match */
  58. STARPU_ASSERT(x == x2);
  59. STARPU_ASSERT(y == y2);
  60. STARPU_ASSERT(z == z2);
  61. for (k = 0; k < z; k++)
  62. for (j = 0; j < y; j++)
  63. for (i = 0; i < x; i++)
  64. val2[k*ldz2+j*ldy2+i] = val[k*ldz+j*ldy+i];
  65. }
  66. #ifdef STARPU_USE_CUDA
  67. void cuda_func(void *buffers[], void *cl_arg)
  68. {
  69. /* length of the shadowed source matrix */
  70. unsigned ldy = STARPU_BLOCK_GET_LDY(buffers[0]);
  71. unsigned ldz = STARPU_BLOCK_GET_LDZ(buffers[0]);
  72. unsigned x = STARPU_BLOCK_GET_NX(buffers[0]);
  73. unsigned y = STARPU_BLOCK_GET_NY(buffers[0]);
  74. unsigned z = STARPU_BLOCK_GET_NZ(buffers[0]);
  75. /* local copy of the shadowed source matrix pointer */
  76. int *val = (int *)STARPU_BLOCK_GET_PTR(buffers[0]);
  77. /* length of the destination matrix */
  78. unsigned ldy2 = STARPU_BLOCK_GET_LDY(buffers[1]);
  79. unsigned ldz2 = STARPU_BLOCK_GET_LDZ(buffers[1]);
  80. unsigned x2 = STARPU_BLOCK_GET_NX(buffers[1]);
  81. unsigned y2 = STARPU_BLOCK_GET_NY(buffers[1]);
  82. unsigned z2 = STARPU_BLOCK_GET_NZ(buffers[1]);
  83. /* local copy of the destination matrix pointer */
  84. int *val2 = (int *)STARPU_BLOCK_GET_PTR(buffers[1]);
  85. unsigned k;
  86. cudaError_t cures;
  87. /* If things go right, sizes should match */
  88. STARPU_ASSERT(x == x2);
  89. STARPU_ASSERT(y == y2);
  90. STARPU_ASSERT(z == z2);
  91. for (k = 0; k < z; k++) {
  92. cures = cudaMemcpy2DAsync(val2+k*ldz2, ldy2*sizeof(*val2), val+k*ldz, ldy*sizeof(*val),
  93. x*sizeof(*val), y, cudaMemcpyDeviceToDevice, starpu_cuda_get_local_stream());
  94. STARPU_ASSERT(!cures);
  95. }
  96. cures = cudaStreamSynchronize(starpu_cuda_get_local_stream());
  97. STARPU_ASSERT(!cures);
  98. }
  99. #endif
  100. int main(int argc, char **argv)
  101. {
  102. unsigned i, j, k, l, m, n;
  103. int matrix[NZ + 2*SHADOWZ][NY + 2*SHADOWY][NX + 2*SHADOWX];
  104. int matrix2[NZ + PARTSZ*2*SHADOWZ][NY + PARTSY*2*SHADOWY][NX + PARTSX*2*SHADOWX];
  105. starpu_data_handle_t handle, handle2;
  106. int ret;
  107. struct starpu_codelet cl =
  108. {
  109. .where = STARPU_CPU
  110. #ifdef STARPU_USE_CUDA
  111. |STARPU_CUDA
  112. #endif
  113. ,
  114. .cpu_funcs = {cpu_func, NULL},
  115. #ifdef STARPU_USE_CUDA
  116. .cuda_funcs = {cuda_func, NULL},
  117. #endif
  118. .nbuffers = 2,
  119. .modes = {STARPU_R, STARPU_W}
  120. };
  121. memset(matrix, -1, sizeof(matrix));
  122. for(k=1 ; k<=NZ ; k++)
  123. for(j=1 ; j<=NY ; j++)
  124. for(i=1 ; i<=NX ; i++)
  125. matrix[SHADOWZ+k-1][SHADOWY+j-1][SHADOWX+i-1] = i+j+k;
  126. /* Copy planes */
  127. for (k = SHADOWZ ; k<SHADOWZ+NZ ; k++)
  128. for (j = SHADOWY ; j<SHADOWY+NY ; j++)
  129. for(i=0 ; i<SHADOWX ; i++) {
  130. matrix[k][j][i] = matrix[k][j][i+NX];
  131. matrix[k][j][SHADOWX+NX+i] = matrix[k][j][SHADOWX+i];
  132. }
  133. for(k=SHADOWZ ; k<SHADOWZ+NZ ; k++)
  134. for(j=0 ; j<SHADOWY ; j++)
  135. for(i=SHADOWX ; i<SHADOWX+NX ; i++) {
  136. matrix[k][j][i] = matrix[k][j+NY][i];
  137. matrix[k][SHADOWY+NY+j][i] = matrix[k][SHADOWY+j][i];
  138. }
  139. for(k=0 ; k<SHADOWZ ; k++)
  140. for(j=SHADOWY ; j<SHADOWY+NY ; j++)
  141. for(i=SHADOWX ; i<SHADOWX+NX ; i++) {
  142. matrix[k][j][i] = matrix[k+NZ][j][i];
  143. matrix[SHADOWZ+NZ+k][j][i] = matrix[SHADOWZ+k][j][i];
  144. }
  145. /* Copy borders */
  146. for (k = SHADOWZ ; k<SHADOWZ+NZ ; k++)
  147. for(j=0 ; j<SHADOWY ; j++)
  148. for(i=0 ; i<SHADOWX ; i++) {
  149. matrix[k][j][i] = matrix[k][j+NY][i+NX];
  150. matrix[k][SHADOWY+NY+j][i] = matrix[k][SHADOWY+j][i+NX];
  151. matrix[k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[k][SHADOWY+j][SHADOWX+i];
  152. matrix[k][j][SHADOWX+NX+i] = matrix[k][j+NY][SHADOWX+i];
  153. }
  154. for(k=0 ; k<SHADOWZ ; k++)
  155. for (j = SHADOWY ; j<SHADOWY+NY ; j++)
  156. for(i=0 ; i<SHADOWX ; i++) {
  157. matrix[k][j][i] = matrix[k+NZ][j][i+NX];
  158. matrix[SHADOWZ+NZ+k][j][i] = matrix[SHADOWZ+k][j][i+NX];
  159. matrix[SHADOWZ+NZ+k][j][SHADOWX+NX+i] = matrix[SHADOWZ+k][j][SHADOWX+i];
  160. matrix[k][j][SHADOWX+NX+i] = matrix[k+NZ][j][SHADOWX+i];
  161. }
  162. for(k=0 ; k<SHADOWZ ; k++)
  163. for(j=0 ; j<SHADOWY ; j++)
  164. for(i=SHADOWX ; i<SHADOWX+NX ; i++) {
  165. matrix[k][j][i] = matrix[k+NZ][j+NY][i];
  166. matrix[SHADOWZ+NZ+k][j][i] = matrix[SHADOWZ+k][j+NY][i];
  167. matrix[SHADOWZ+NZ+k][SHADOWY+NY+j][i] = matrix[SHADOWZ+k][SHADOWY+j][i];
  168. matrix[k][SHADOWY+NY+j][i] = matrix[k+NZ][SHADOWY+j][i];
  169. }
  170. /* Copy corners */
  171. for(k=0 ; k<SHADOWZ ; k++)
  172. for(j=0 ; j<SHADOWY ; j++)
  173. for(i=0 ; i<SHADOWX ; i++) {
  174. matrix[k][j][i] = matrix[k+NZ][j+NY][i+NX];
  175. matrix[k][j][SHADOWX+NX+i] = matrix[k+NZ][j+NY][SHADOWX+i];
  176. matrix[k][SHADOWY+NY+j][i] = matrix[k+NZ][SHADOWY+j][i+NX];
  177. matrix[k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[k+NZ][SHADOWY+j][SHADOWX+i];
  178. matrix[SHADOWZ+NZ+k][j][i] = matrix[SHADOWZ+k][j+NY][i+NX];
  179. matrix[SHADOWZ+NZ+k][j][SHADOWX+NX+i] = matrix[SHADOWZ+k][j+NY][SHADOWX+i];
  180. matrix[SHADOWZ+NZ+k][SHADOWY+NY+j][i] = matrix[SHADOWZ+k][SHADOWY+j][i+NX];
  181. matrix[SHADOWZ+NZ+k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[SHADOWZ+k][SHADOWY+j][SHADOWX+i];
  182. }
  183. FPRINTF(stderr,"IN Matrix:\n");
  184. for(k=0 ; k<NZ + 2*SHADOWZ ; k++)
  185. {
  186. for(j=0 ; j<NY + 2*SHADOWY ; j++)
  187. {
  188. for(i=0 ; i<NX + 2*SHADOWX ; i++)
  189. FPRINTF(stderr, "%5d ", matrix[k][j][i]);
  190. FPRINTF(stderr,"\n");
  191. }
  192. FPRINTF(stderr,"\n\n");
  193. }
  194. FPRINTF(stderr,"\n");
  195. ret = starpu_init(NULL);
  196. if (ret == -ENODEV)
  197. exit(77);
  198. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  199. /* Declare source matrix to StarPU */
  200. starpu_block_data_register(&handle, 0, (uintptr_t)matrix,
  201. NX + 2*SHADOWX, (NX + 2*SHADOWX) * (NY + 2*SHADOWY),
  202. NX + 2*SHADOWX, NY + 2*SHADOWY, NZ + 2*SHADOWZ,
  203. sizeof(matrix[0][0][0]));
  204. /* Declare destination matrix to StarPU */
  205. starpu_block_data_register(&handle2, 0, (uintptr_t)matrix2,
  206. NX + PARTSX*2*SHADOWX, (NX + PARTSX*2*SHADOWX) * (NY + PARTSY*2*SHADOWY),
  207. NX + PARTSX*2*SHADOWX, NY + PARTSY*2*SHADOWY, NZ + PARTSZ*2*SHADOWZ,
  208. sizeof(matrix2[0][0][0]));
  209. /* Partition the source matrix in PARTSZ*PARTSY*PARTSX sub-matrices with shadows */
  210. /* NOTE: the resulting handles should only be used in read-only mode,
  211. * as StarPU will not know how the overlapping parts would have to be
  212. * combined. */
  213. struct starpu_data_filter fz =
  214. {
  215. .filter_func = starpu_depth_block_shadow_filter_func_block,
  216. .nchildren = PARTSZ,
  217. .filter_arg_ptr = (void*)(uintptr_t) SHADOWZ /* Shadow width */
  218. };
  219. struct starpu_data_filter fy =
  220. {
  221. .filter_func = starpu_vertical_block_shadow_filter_func_block,
  222. .nchildren = PARTSY,
  223. .filter_arg_ptr = (void*)(uintptr_t) SHADOWY /* Shadow width */
  224. };
  225. struct starpu_data_filter fx =
  226. {
  227. .filter_func = starpu_block_shadow_filter_func_block,
  228. .nchildren = PARTSX,
  229. .filter_arg_ptr = (void*)(uintptr_t) SHADOWX /* Shadow width */
  230. };
  231. starpu_data_map_filters(handle, 3, &fz, &fy, &fx);
  232. /* Partition the destination matrix in PARTSZ*PARTSY*PARTSX sub-matrices */
  233. struct starpu_data_filter fz2 =
  234. {
  235. .filter_func = starpu_depth_block_filter_func_block,
  236. .nchildren = PARTSZ,
  237. };
  238. struct starpu_data_filter fy2 =
  239. {
  240. .filter_func = starpu_vertical_block_filter_func_block,
  241. .nchildren = PARTSY,
  242. };
  243. struct starpu_data_filter fx2 =
  244. {
  245. .filter_func = starpu_block_filter_func_block,
  246. .nchildren = PARTSX,
  247. };
  248. starpu_data_map_filters(handle2, 3, &fz2, &fy2, &fx2);
  249. /* Submit a task on each sub-matrix */
  250. for (k=0; k<PARTSZ; k++)
  251. {
  252. for (j=0; j<PARTSY; j++)
  253. {
  254. for (i=0; i<PARTSX; i++)
  255. {
  256. starpu_data_handle_t sub_handle = starpu_data_get_sub_data(handle, 3, k, j, i);
  257. starpu_data_handle_t sub_handle2 = starpu_data_get_sub_data(handle2, 3, k, j, i);
  258. struct starpu_task *task = starpu_task_create();
  259. task->handles[0] = sub_handle;
  260. task->handles[1] = sub_handle2;
  261. task->cl = &cl;
  262. task->synchronous = 1;
  263. ret = starpu_task_submit(task);
  264. if (ret == -ENODEV) goto enodev;
  265. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  266. }
  267. }
  268. }
  269. starpu_data_unpartition(handle, 0);
  270. starpu_data_unpartition(handle2, 0);
  271. starpu_data_unregister(handle);
  272. starpu_data_unregister(handle2);
  273. starpu_shutdown();
  274. FPRINTF(stderr,"OUT Matrix:\n");
  275. for(k=0 ; k<NZ + PARTSZ*2*SHADOWZ ; k++)
  276. {
  277. for(j=0 ; j<NY + PARTSY*2*SHADOWY ; j++)
  278. {
  279. for(i=0 ; i<NX + PARTSX*2*SHADOWX ; i++) {
  280. FPRINTF(stderr, "%5d ", matrix2[k][j][i]);
  281. }
  282. FPRINTF(stderr,"\n");
  283. }
  284. FPRINTF(stderr,"\n\n");
  285. }
  286. FPRINTF(stderr,"\n");
  287. for(k=0 ; k<PARTSZ ; k++)
  288. for(j=0 ; j<PARTSY ; j++)
  289. for(i=0 ; i<PARTSX ; i++)
  290. for (n=0 ; n<NZ/PARTSZ + 2*SHADOWZ ; n++)
  291. for (m=0 ; m<NY/PARTSY + 2*SHADOWY ; m++)
  292. for (l=0 ; l<NX/PARTSX + 2*SHADOWX ; l++)
  293. STARPU_ASSERT(matrix2[k*(NZ/PARTSZ+2*SHADOWZ)+n][j*(NY/PARTSY+2*SHADOWY)+m][i*(NX/PARTSX+2*SHADOWX)+l] ==
  294. matrix[k*(NZ/PARTSZ)+n][j*(NY/PARTSY)+m][i*(NX/PARTSX)+l]);
  295. return 0;
  296. enodev:
  297. FPRINTF(stderr, "WARNING: No one can execute this task\n");
  298. starpu_shutdown();
  299. return 77;
  300. }