yuv_downscaler.c 9.2 KB

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