yuv_downscaler.c 9.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011,2013 Inria
  4. * Copyright (C) 2009-2011,2013-2015,2017 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 uses a dummy algorithm to downscale a 1920x1080 yuv film.
  21. * Each frame is split in horizontal stripes which are processed in parallel.
  22. */
  23. #include <starpu.h>
  24. #include <sys/types.h>
  25. #include <sys/stat.h>
  26. #include <unistd.h>
  27. #include <assert.h>
  28. #include <stdio.h>
  29. #include "yuv_downscaler.h"
  30. static double start;
  31. static double end;
  32. static const char *filename_in_default = "hugefile.2s.yuv";
  33. static const char *filename_out_default = "hugefile.2s.out.yuv";
  34. static char filename_in[1024];
  35. static char filename_out[1024];
  36. void parse_args(int argc, char **argv)
  37. {
  38. if (argc == 3)
  39. {
  40. strncpy(filename_in, argv[1], 1023);
  41. strncpy(filename_out, argv[2], 1023);
  42. }
  43. else
  44. {
  45. snprintf(filename_in, sizeof(filename_in), "%s/examples/ppm_downscaler/%s", STARPU_BUILD_DIR, filename_in_default);
  46. snprintf(filename_out, sizeof(filename_out), "%s/examples/ppm_downscaler/%s", STARPU_BUILD_DIR, filename_out_default);
  47. }
  48. }
  49. #define FRAMESIZE sizeof(struct yuv_frame)
  50. #define NEW_FRAMESIZE sizeof(struct yuv_new_frame)
  51. void ds_kernel_cpu(void *descr[], void *arg)
  52. {
  53. (void)arg;
  54. uint8_t *input = (uint8_t *)STARPU_MATRIX_GET_PTR(descr[0]);
  55. const unsigned input_ld = STARPU_MATRIX_GET_LD(descr[0]);
  56. uint8_t *output = (uint8_t *)STARPU_MATRIX_GET_PTR(descr[1]);
  57. const unsigned output_ld = STARPU_MATRIX_GET_LD(descr[1]);
  58. const unsigned ncols = STARPU_MATRIX_GET_NX(descr[0]);
  59. const unsigned nlines = STARPU_MATRIX_GET_NY(descr[0]);
  60. unsigned line, col;
  61. for (line = 0; line < nlines; line+=FACTOR)
  62. for (col = 0; col < ncols; col+=FACTOR)
  63. {
  64. unsigned sum = 0;
  65. unsigned lline, lcol;
  66. for (lline = 0; lline < FACTOR; lline++)
  67. for (lcol = 0; lcol < FACTOR; lcol++)
  68. {
  69. unsigned in_index = (lcol + col) + (lline + line)*input_ld;
  70. sum += input[in_index];
  71. }
  72. unsigned out_index = (col / FACTOR) + (line / FACTOR)*output_ld;
  73. output[out_index] = (uint8_t)(sum/(FACTOR*FACTOR));
  74. }
  75. }
  76. static struct starpu_codelet ds_codelet =
  77. {
  78. .cpu_funcs = {ds_kernel_cpu},
  79. .cpu_funcs_name = {"ds_kernel_cpu"},
  80. .nbuffers = 2, /* input -> output */
  81. .modes = {STARPU_R, STARPU_W},
  82. .model = NULL
  83. };
  84. /* each block contains BLOCK_HEIGHT consecutive lines */
  85. static struct starpu_data_filter filter_y =
  86. {
  87. .filter_func = starpu_matrix_filter_block,
  88. .nchildren= HEIGHT/BLOCK_HEIGHT
  89. };
  90. static struct starpu_data_filter filter_uv =
  91. {
  92. .filter_func = starpu_matrix_filter_block,
  93. .nchildren = (HEIGHT/2)/BLOCK_HEIGHT
  94. };
  95. int main(int argc, char **argv)
  96. {
  97. int ret;
  98. size_t sret;
  99. assert(HEIGHT % (2*BLOCK_HEIGHT) == 0);
  100. assert(HEIGHT % FACTOR == 0);
  101. parse_args(argc, argv);
  102. /* fprintf(stderr, "Reading input file ...\n"); */
  103. /* how many frames ? */
  104. struct stat stbuf;
  105. ret = stat(filename_in, &stbuf);
  106. assert(ret);
  107. size_t filesize = stbuf.st_size;
  108. unsigned nframes = filesize/FRAMESIZE;
  109. /* fprintf(stderr, "filesize %lx (FRAME SIZE %lx NEW SIZE %lx); nframes %d\n", filesize, FRAMESIZE, NEW_FRAMESIZE, nframes); */
  110. assert((filesize % sizeof(struct yuv_frame)) == 0);
  111. struct yuv_frame *yuv_in_buffer = (struct yuv_frame *) malloc(nframes*FRAMESIZE);
  112. assert(yuv_in_buffer);
  113. /* fprintf(stderr, "Alloc output file ...\n"); */
  114. struct yuv_new_frame *yuv_out_buffer = (struct yuv_new_frame *) calloc(nframes, NEW_FRAMESIZE);
  115. assert(yuv_out_buffer);
  116. /* fetch input data */
  117. FILE *f_in = fopen(filename_in, "r");
  118. assert(f_in);
  119. /* allocate room for an output buffer */
  120. FILE *f_out = fopen(filename_out, "w+");
  121. assert(f_out);
  122. sret = fread(yuv_in_buffer, FRAMESIZE, nframes, f_in);
  123. assert(sret == nframes);
  124. starpu_data_handle_t *frame_y_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  125. starpu_data_handle_t *frame_u_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  126. starpu_data_handle_t *frame_v_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  127. starpu_data_handle_t *new_frame_y_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  128. starpu_data_handle_t *new_frame_u_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  129. starpu_data_handle_t *new_frame_v_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  130. ret = starpu_init(NULL);
  131. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  132. /* register and partition all layers */
  133. unsigned frame;
  134. for (frame = 0; frame < nframes; frame++)
  135. {
  136. /* register Y layer */
  137. starpu_matrix_data_register(&frame_y_handle[frame], STARPU_MAIN_RAM,
  138. (uintptr_t)&yuv_in_buffer[frame].y,
  139. WIDTH, WIDTH, HEIGHT, sizeof(uint8_t));
  140. starpu_data_partition(frame_y_handle[frame], &filter_y);
  141. starpu_matrix_data_register(&new_frame_y_handle[frame], STARPU_MAIN_RAM,
  142. (uintptr_t)&yuv_out_buffer[frame].y,
  143. NEW_WIDTH, NEW_WIDTH, NEW_HEIGHT, sizeof(uint8_t));
  144. starpu_data_partition(new_frame_y_handle[frame], &filter_y);
  145. /* register U layer */
  146. starpu_matrix_data_register(&frame_u_handle[frame], STARPU_MAIN_RAM,
  147. (uintptr_t)&yuv_in_buffer[frame].u,
  148. WIDTH/2, WIDTH/2, HEIGHT/2, sizeof(uint8_t));
  149. starpu_data_partition(frame_u_handle[frame], &filter_uv);
  150. starpu_matrix_data_register(&new_frame_u_handle[frame], STARPU_MAIN_RAM,
  151. (uintptr_t)&yuv_out_buffer[frame].u,
  152. NEW_WIDTH/2, NEW_WIDTH/2, NEW_HEIGHT/2, sizeof(uint8_t));
  153. starpu_data_partition(new_frame_u_handle[frame], &filter_uv);
  154. /* register V layer */
  155. starpu_matrix_data_register(&frame_v_handle[frame], STARPU_MAIN_RAM,
  156. (uintptr_t)&yuv_in_buffer[frame].v,
  157. WIDTH/2, WIDTH/2, HEIGHT/2, sizeof(uint8_t));
  158. starpu_data_partition(frame_v_handle[frame], &filter_uv);
  159. starpu_matrix_data_register(&new_frame_v_handle[frame], STARPU_MAIN_RAM,
  160. (uintptr_t)&yuv_out_buffer[frame].v,
  161. NEW_WIDTH/2, NEW_WIDTH/2, NEW_HEIGHT/2, sizeof(uint8_t));
  162. starpu_data_partition(new_frame_v_handle[frame], &filter_uv);
  163. }
  164. /* how many tasks are there ? */
  165. unsigned nblocks_y = filter_y.nchildren;
  166. unsigned nblocks_uv = filter_uv.nchildren;
  167. unsigned ntasks = (nblocks_y + 2*nblocks_uv)*nframes;
  168. fprintf(stderr, "Start computation: there will be %u tasks for %u frames\n", ntasks, nframes);
  169. start = starpu_timing_now();
  170. /* do the computation */
  171. for (frame = 0; frame < nframes; frame++)
  172. {
  173. starpu_iteration_push(frame);
  174. unsigned blocky;
  175. for (blocky = 0; blocky < nblocks_y; blocky++)
  176. {
  177. struct starpu_task *task = starpu_task_create();
  178. task->cl = &ds_codelet;
  179. /* input */
  180. task->handles[0] = starpu_data_get_sub_data(frame_y_handle[frame], 1, blocky);
  181. /* output */
  182. task->handles[1] = starpu_data_get_sub_data(new_frame_y_handle[frame], 1, blocky);
  183. ret = starpu_task_submit(task);
  184. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  185. }
  186. unsigned blocku;
  187. for (blocku = 0; blocku < nblocks_uv; blocku++)
  188. {
  189. struct starpu_task *task = starpu_task_create();
  190. task->cl = &ds_codelet;
  191. /* input */
  192. task->handles[0] = starpu_data_get_sub_data(frame_u_handle[frame], 1, blocku);
  193. /* output */
  194. task->handles[1] = starpu_data_get_sub_data(new_frame_u_handle[frame], 1, blocku);
  195. ret = starpu_task_submit(task);
  196. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  197. }
  198. unsigned blockv;
  199. for (blockv = 0; blockv < nblocks_uv; blockv++)
  200. {
  201. struct starpu_task *task = starpu_task_create();
  202. task->cl = &ds_codelet;
  203. /* input */
  204. task->handles[0] = starpu_data_get_sub_data(frame_v_handle[frame], 1, blockv);
  205. /* output */
  206. task->handles[1] = starpu_data_get_sub_data(new_frame_v_handle[frame], 1, blockv);
  207. ret = starpu_task_submit(task);
  208. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  209. }
  210. starpu_iteration_pop();
  211. }
  212. /* make sure all output buffers are sync'ed */
  213. for (frame = 0; frame < nframes; frame++)
  214. {
  215. starpu_data_unregister(frame_y_handle[frame]);
  216. starpu_data_unregister(frame_u_handle[frame]);
  217. starpu_data_unregister(frame_v_handle[frame]);
  218. starpu_data_unregister(new_frame_y_handle[frame]);
  219. starpu_data_unregister(new_frame_u_handle[frame]);
  220. starpu_data_unregister(new_frame_v_handle[frame]);
  221. }
  222. free(frame_y_handle);
  223. free(frame_u_handle);
  224. free(frame_v_handle);
  225. free(new_frame_y_handle);
  226. free(new_frame_u_handle);
  227. free(new_frame_v_handle);
  228. /* There is an implicit barrier: the unregister methods will block
  229. * until the computation is done and that the result was put back into
  230. * memory. */
  231. end = starpu_timing_now();
  232. double timing = end - start;
  233. printf("# s\tFPS\n");
  234. printf("%f\t%f\n", timing/1000000, (1000000*nframes)/timing);
  235. fwrite(yuv_out_buffer, NEW_FRAMESIZE, nframes, f_out);
  236. /* partition the layers into smaller parts */
  237. starpu_shutdown();
  238. if (fclose(f_in) != 0)
  239. fprintf(stderr, "Could not close %s properly\n", filename_in);
  240. if (fclose(f_out) != 0)
  241. fprintf(stderr, "Could not close %s properly\n", filename_out);
  242. return 0;
  243. }