shadow3d.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2012-2013 Inria
  4. * Copyright (C) 2010-2014 Université de Bordeaux
  5. * Copyright (C) 2010 Mehdi Juhoor
  6. * Copyright (C) 2010-2013,2015,2017 CNRS
  7. *
  8. * StarPU is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU Lesser General Public License as published by
  10. * the Free Software Foundation; either version 2.1 of the License, or (at
  11. * your option) any later version.
  12. *
  13. * StarPU is distributed in the hope that it will be useful, but
  14. * WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  16. *
  17. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  18. */
  19. /*
  20. * This examplifies the use of the 3D matrix shadow filters: a source "matrix" of
  21. * NX*NY*NZ elements (plus SHADOW wrap-around elements) is partitioned into
  22. * matrices with some shadowing, and these are copied into a destination
  23. * "matrix2" of
  24. * NRPARTSX*NPARTSY*NPARTSZ*((NX/NPARTSX+2*SHADOWX)*(NY/NPARTSY+2*SHADOWY)*(NZ/NPARTSZ+2*SHADOWZ))
  25. * elements, partitioned in the traditionnal way, thus showing how shadowing
  26. * shows up.
  27. */
  28. #include <starpu.h>
  29. /* Shadow width */
  30. #define SHADOWX 2
  31. #define SHADOWY 3
  32. #define SHADOWZ 4
  33. #define NX 12
  34. #define NY 9
  35. #define NZ 6
  36. #define PARTSX 4
  37. #define PARTSY 3
  38. #define PARTSZ 2
  39. #define FPRINTF(ofile, fmt, ...) do { if (!getenv("STARPU_SSILENT")) {fprintf(ofile, fmt, ## __VA_ARGS__); }} while(0)
  40. void cpu_func(void *buffers[], void *cl_arg)
  41. {
  42. (void)cl_arg;
  43. /* length of the shadowed source matrix */
  44. unsigned ldy = STARPU_BLOCK_GET_LDY(buffers[0]);
  45. unsigned ldz = STARPU_BLOCK_GET_LDZ(buffers[0]);
  46. unsigned x = STARPU_BLOCK_GET_NX(buffers[0]);
  47. unsigned y = STARPU_BLOCK_GET_NY(buffers[0]);
  48. unsigned z = STARPU_BLOCK_GET_NZ(buffers[0]);
  49. /* local copy of the shadowed source matrix pointer */
  50. int *val = (int *)STARPU_BLOCK_GET_PTR(buffers[0]);
  51. /* length of the destination matrix */
  52. unsigned ldy2 = STARPU_BLOCK_GET_LDY(buffers[1]);
  53. unsigned ldz2 = STARPU_BLOCK_GET_LDZ(buffers[1]);
  54. unsigned x2 = STARPU_BLOCK_GET_NX(buffers[1]);
  55. unsigned y2 = STARPU_BLOCK_GET_NY(buffers[1]);
  56. unsigned z2 = STARPU_BLOCK_GET_NZ(buffers[1]);
  57. /* local copy of the destination matrix pointer */
  58. int *val2 = (int *)STARPU_BLOCK_GET_PTR(buffers[1]);
  59. unsigned i, j, k;
  60. /* If things go right, sizes should match */
  61. STARPU_ASSERT(x == x2);
  62. STARPU_ASSERT(y == y2);
  63. STARPU_ASSERT(z == z2);
  64. for (k = 0; k < z; k++)
  65. for (j = 0; j < y; j++)
  66. for (i = 0; i < x; i++)
  67. val2[k*ldz2+j*ldy2+i] = val[k*ldz+j*ldy+i];
  68. }
  69. #ifdef STARPU_USE_CUDA
  70. void cuda_func(void *buffers[], void *cl_arg)
  71. {
  72. (void)cl_arg;
  73. /* length of the shadowed source matrix */
  74. unsigned ldy = STARPU_BLOCK_GET_LDY(buffers[0]);
  75. unsigned ldz = STARPU_BLOCK_GET_LDZ(buffers[0]);
  76. unsigned x = STARPU_BLOCK_GET_NX(buffers[0]);
  77. unsigned y = STARPU_BLOCK_GET_NY(buffers[0]);
  78. unsigned z = STARPU_BLOCK_GET_NZ(buffers[0]);
  79. /* local copy of the shadowed source matrix pointer */
  80. int *val = (int *)STARPU_BLOCK_GET_PTR(buffers[0]);
  81. /* length of the destination matrix */
  82. unsigned ldy2 = STARPU_BLOCK_GET_LDY(buffers[1]);
  83. unsigned ldz2 = STARPU_BLOCK_GET_LDZ(buffers[1]);
  84. unsigned x2 = STARPU_BLOCK_GET_NX(buffers[1]);
  85. unsigned y2 = STARPU_BLOCK_GET_NY(buffers[1]);
  86. unsigned z2 = STARPU_BLOCK_GET_NZ(buffers[1]);
  87. /* local copy of the destination matrix pointer */
  88. int *val2 = (int *)STARPU_BLOCK_GET_PTR(buffers[1]);
  89. unsigned k;
  90. cudaError_t cures;
  91. /* If things go right, sizes should match */
  92. STARPU_ASSERT(x == x2);
  93. STARPU_ASSERT(y == y2);
  94. STARPU_ASSERT(z == z2);
  95. for (k = 0; k < z; k++)
  96. {
  97. cures = cudaMemcpy2DAsync(val2+k*ldz2, ldy2*sizeof(*val2), val+k*ldz, ldy*sizeof(*val),
  98. x*sizeof(*val), y, cudaMemcpyDeviceToDevice, starpu_cuda_get_local_stream());
  99. STARPU_ASSERT(!cures);
  100. }
  101. }
  102. #endif
  103. int main(void)
  104. {
  105. unsigned i, j, k, l, m, n;
  106. int matrix[NZ + 2*SHADOWZ][NY + 2*SHADOWY][NX + 2*SHADOWX];
  107. int matrix2[NZ + PARTSZ*2*SHADOWZ][NY + PARTSY*2*SHADOWY][NX + PARTSX*2*SHADOWX];
  108. starpu_data_handle_t handle, handle2;
  109. int ret;
  110. struct starpu_codelet cl =
  111. {
  112. .cpu_funcs = {cpu_func},
  113. .cpu_funcs_name = {"cpu_func"},
  114. #ifdef STARPU_USE_CUDA
  115. .cuda_funcs = {cuda_func},
  116. .cuda_flags = {STARPU_CUDA_ASYNC},
  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. {
  131. matrix[k][j][i] = matrix[k][j][i+NX];
  132. matrix[k][j][SHADOWX+NX+i] = matrix[k][j][SHADOWX+i];
  133. }
  134. for(k=SHADOWZ ; k<SHADOWZ+NZ ; k++)
  135. for(j=0 ; j<SHADOWY ; j++)
  136. for(i=SHADOWX ; i<SHADOWX+NX ; i++)
  137. {
  138. matrix[k][j][i] = matrix[k][j+NY][i];
  139. matrix[k][SHADOWY+NY+j][i] = matrix[k][SHADOWY+j][i];
  140. }
  141. for(k=0 ; k<SHADOWZ ; k++)
  142. for(j=SHADOWY ; j<SHADOWY+NY ; j++)
  143. for(i=SHADOWX ; i<SHADOWX+NX ; i++)
  144. {
  145. matrix[k][j][i] = matrix[k+NZ][j][i];
  146. matrix[SHADOWZ+NZ+k][j][i] = matrix[SHADOWZ+k][j][i];
  147. }
  148. /* Copy borders */
  149. for (k = SHADOWZ ; k<SHADOWZ+NZ ; k++)
  150. for(j=0 ; j<SHADOWY ; j++)
  151. for(i=0 ; i<SHADOWX ; i++)
  152. {
  153. matrix[k][j][i] = matrix[k][j+NY][i+NX];
  154. matrix[k][SHADOWY+NY+j][i] = matrix[k][SHADOWY+j][i+NX];
  155. matrix[k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[k][SHADOWY+j][SHADOWX+i];
  156. matrix[k][j][SHADOWX+NX+i] = matrix[k][j+NY][SHADOWX+i];
  157. }
  158. for(k=0 ; k<SHADOWZ ; k++)
  159. for (j = SHADOWY ; j<SHADOWY+NY ; j++)
  160. for(i=0 ; i<SHADOWX ; i++)
  161. {
  162. matrix[k][j][i] = matrix[k+NZ][j][i+NX];
  163. matrix[SHADOWZ+NZ+k][j][i] = matrix[SHADOWZ+k][j][i+NX];
  164. matrix[SHADOWZ+NZ+k][j][SHADOWX+NX+i] = matrix[SHADOWZ+k][j][SHADOWX+i];
  165. matrix[k][j][SHADOWX+NX+i] = matrix[k+NZ][j][SHADOWX+i];
  166. }
  167. for(k=0 ; k<SHADOWZ ; k++)
  168. for(j=0 ; j<SHADOWY ; j++)
  169. for(i=SHADOWX ; i<SHADOWX+NX ; i++)
  170. {
  171. matrix[k][j][i] = matrix[k+NZ][j+NY][i];
  172. matrix[SHADOWZ+NZ+k][j][i] = matrix[SHADOWZ+k][j+NY][i];
  173. matrix[SHADOWZ+NZ+k][SHADOWY+NY+j][i] = matrix[SHADOWZ+k][SHADOWY+j][i];
  174. matrix[k][SHADOWY+NY+j][i] = matrix[k+NZ][SHADOWY+j][i];
  175. }
  176. /* Copy corners */
  177. for(k=0 ; k<SHADOWZ ; k++)
  178. for(j=0 ; j<SHADOWY ; j++)
  179. for(i=0 ; i<SHADOWX ; i++)
  180. {
  181. matrix[k][j][i] = matrix[k+NZ][j+NY][i+NX];
  182. matrix[k][j][SHADOWX+NX+i] = matrix[k+NZ][j+NY][SHADOWX+i];
  183. matrix[k][SHADOWY+NY+j][i] = matrix[k+NZ][SHADOWY+j][i+NX];
  184. matrix[k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[k+NZ][SHADOWY+j][SHADOWX+i];
  185. matrix[SHADOWZ+NZ+k][j][i] = matrix[SHADOWZ+k][j+NY][i+NX];
  186. matrix[SHADOWZ+NZ+k][j][SHADOWX+NX+i] = matrix[SHADOWZ+k][j+NY][SHADOWX+i];
  187. matrix[SHADOWZ+NZ+k][SHADOWY+NY+j][i] = matrix[SHADOWZ+k][SHADOWY+j][i+NX];
  188. matrix[SHADOWZ+NZ+k][SHADOWY+NY+j][SHADOWX+NX+i] = matrix[SHADOWZ+k][SHADOWY+j][SHADOWX+i];
  189. }
  190. FPRINTF(stderr,"IN Matrix:\n");
  191. for(k=0 ; k<NZ + 2*SHADOWZ ; k++)
  192. {
  193. for(j=0 ; j<NY + 2*SHADOWY ; j++)
  194. {
  195. for(i=0 ; i<NX + 2*SHADOWX ; i++)
  196. FPRINTF(stderr, "%5d ", matrix[k][j][i]);
  197. FPRINTF(stderr,"\n");
  198. }
  199. FPRINTF(stderr,"\n\n");
  200. }
  201. FPRINTF(stderr,"\n");
  202. ret = starpu_init(NULL);
  203. if (ret == -ENODEV)
  204. exit(77);
  205. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  206. /* Declare source matrix to StarPU */
  207. starpu_block_data_register(&handle, STARPU_MAIN_RAM, (uintptr_t)matrix,
  208. NX + 2*SHADOWX, (NX + 2*SHADOWX) * (NY + 2*SHADOWY),
  209. NX + 2*SHADOWX, NY + 2*SHADOWY, NZ + 2*SHADOWZ,
  210. sizeof(matrix[0][0][0]));
  211. /* Declare destination matrix to StarPU */
  212. starpu_block_data_register(&handle2, STARPU_MAIN_RAM, (uintptr_t)matrix2,
  213. NX + PARTSX*2*SHADOWX, (NX + PARTSX*2*SHADOWX) * (NY + PARTSY*2*SHADOWY),
  214. NX + PARTSX*2*SHADOWX, NY + PARTSY*2*SHADOWY, NZ + PARTSZ*2*SHADOWZ,
  215. sizeof(matrix2[0][0][0]));
  216. /* Partition the source matrix in PARTSZ*PARTSY*PARTSX sub-matrices with shadows */
  217. /* NOTE: the resulting handles should only be used in read-only mode,
  218. * as StarPU will not know how the overlapping parts would have to be
  219. * combined. */
  220. struct starpu_data_filter fz =
  221. {
  222. .filter_func = starpu_block_filter_depth_block_shadow,
  223. .nchildren = PARTSZ,
  224. .filter_arg_ptr = (void*)(uintptr_t) SHADOWZ /* Shadow width */
  225. };
  226. struct starpu_data_filter fy =
  227. {
  228. .filter_func = starpu_block_filter_vertical_block_shadow,
  229. .nchildren = PARTSY,
  230. .filter_arg_ptr = (void*)(uintptr_t) SHADOWY /* Shadow width */
  231. };
  232. struct starpu_data_filter fx =
  233. {
  234. .filter_func = starpu_block_filter_block_shadow,
  235. .nchildren = PARTSX,
  236. .filter_arg_ptr = (void*)(uintptr_t) SHADOWX /* Shadow width */
  237. };
  238. starpu_data_map_filters(handle, 3, &fz, &fy, &fx);
  239. /* Partition the destination matrix in PARTSZ*PARTSY*PARTSX sub-matrices */
  240. struct starpu_data_filter fz2 =
  241. {
  242. .filter_func = starpu_block_filter_depth_block,
  243. .nchildren = PARTSZ,
  244. };
  245. struct starpu_data_filter fy2 =
  246. {
  247. .filter_func = starpu_block_filter_vertical_block,
  248. .nchildren = PARTSY,
  249. };
  250. struct starpu_data_filter fx2 =
  251. {
  252. .filter_func = starpu_block_filter_block,
  253. .nchildren = PARTSX,
  254. };
  255. starpu_data_map_filters(handle2, 3, &fz2, &fy2, &fx2);
  256. /* Submit a task on each sub-matrix */
  257. for (k=0; k<PARTSZ; k++)
  258. {
  259. for (j=0; j<PARTSY; j++)
  260. {
  261. for (i=0; i<PARTSX; i++)
  262. {
  263. starpu_data_handle_t sub_handle = starpu_data_get_sub_data(handle, 3, k, j, i);
  264. starpu_data_handle_t sub_handle2 = starpu_data_get_sub_data(handle2, 3, k, j, i);
  265. struct starpu_task *task = starpu_task_create();
  266. task->handles[0] = sub_handle;
  267. task->handles[1] = sub_handle2;
  268. task->cl = &cl;
  269. task->synchronous = 1;
  270. ret = starpu_task_submit(task);
  271. if (ret == -ENODEV) goto enodev;
  272. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  273. }
  274. }
  275. }
  276. starpu_data_unpartition(handle, STARPU_MAIN_RAM);
  277. starpu_data_unpartition(handle2, STARPU_MAIN_RAM);
  278. starpu_data_unregister(handle);
  279. starpu_data_unregister(handle2);
  280. starpu_shutdown();
  281. FPRINTF(stderr,"OUT Matrix:\n");
  282. for(k=0 ; k<NZ + PARTSZ*2*SHADOWZ ; k++)
  283. {
  284. for(j=0 ; j<NY + PARTSY*2*SHADOWY ; j++)
  285. {
  286. for(i=0 ; i<NX + PARTSX*2*SHADOWX ; i++)
  287. {
  288. FPRINTF(stderr, "%5d ", matrix2[k][j][i]);
  289. }
  290. FPRINTF(stderr,"\n");
  291. }
  292. FPRINTF(stderr,"\n\n");
  293. }
  294. FPRINTF(stderr,"\n");
  295. for(k=0 ; k<PARTSZ ; k++)
  296. for(j=0 ; j<PARTSY ; j++)
  297. for(i=0 ; i<PARTSX ; i++)
  298. for (n=0 ; n<NZ/PARTSZ + 2*SHADOWZ ; n++)
  299. for (m=0 ; m<NY/PARTSY + 2*SHADOWY ; m++)
  300. for (l=0 ; l<NX/PARTSX + 2*SHADOWX ; l++)
  301. STARPU_ASSERT(matrix2[k*(NZ/PARTSZ+2*SHADOWZ)+n][j*(NY/PARTSY+2*SHADOWY)+m][i*(NX/PARTSX+2*SHADOWX)+l] ==
  302. matrix[k*(NZ/PARTSZ)+n][j*(NY/PARTSY)+m][i*(NX/PARTSX)+l]);
  303. return 0;
  304. enodev:
  305. FPRINTF(stderr, "WARNING: No one can execute this task\n");
  306. starpu_shutdown();
  307. return 77;
  308. }