yuv_downscaler.c 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2010-2011, 2013-2014 Université de Bordeaux 1
  4. * Copyright (C) 2010 Mehdi Juhoor <mjuhoor@gmail.com>
  5. * Copyright (C) 2010, 2011, 2012, 2013 Centre National de la Recherche Scientifique
  6. *
  7. * StarPU is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU Lesser General Public License as published by
  9. * the Free Software Foundation; either version 2.1 of the License, or (at
  10. * your option) any later version.
  11. *
  12. * StarPU is distributed in the hope that it will be useful, but
  13. * WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  15. *
  16. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  17. */
  18. #include <starpu.h>
  19. #include <sys/types.h>
  20. #include <sys/stat.h>
  21. #include <unistd.h>
  22. #include <assert.h>
  23. #include <stdio.h>
  24. #include "yuv_downscaler.h"
  25. static double start;
  26. static double end;
  27. static const char *filename_in_default = "hugefile.2s.yuv";
  28. static const char *filename_out_default = "hugefile.2s.out.yuv";
  29. static char filename_in[1024];
  30. static char filename_out[1024];
  31. void parse_args(int argc, char **argv)
  32. {
  33. if (argc == 3)
  34. {
  35. strcpy(filename_in, argv[1]);
  36. strcpy(filename_out, argv[2]);
  37. }
  38. else
  39. {
  40. sprintf(filename_in, "%s/examples/ppm_downscaler/%s", STARPU_BUILD_DIR, filename_in_default);
  41. sprintf(filename_out, "%s/examples/ppm_downscaler/%s", STARPU_BUILD_DIR, filename_out_default);
  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[], STARPU_ATTRIBUTE_UNUSED void *arg)
  47. {
  48. uint8_t *input = (uint8_t *)STARPU_MATRIX_GET_PTR(descr[0]);
  49. const unsigned input_ld = STARPU_MATRIX_GET_LD(descr[0]);
  50. uint8_t *output = (uint8_t *)STARPU_MATRIX_GET_PTR(descr[1]);
  51. const unsigned output_ld = STARPU_MATRIX_GET_LD(descr[1]);
  52. const unsigned ncols = STARPU_MATRIX_GET_NX(descr[0]);
  53. const unsigned nlines = STARPU_MATRIX_GET_NY(descr[0]);
  54. unsigned line, col;
  55. for (line = 0; line < nlines; line+=FACTOR)
  56. for (col = 0; col < ncols; col+=FACTOR)
  57. {
  58. unsigned sum = 0;
  59. unsigned lline, lcol;
  60. for (lline = 0; lline < FACTOR; lline++)
  61. for (lcol = 0; lcol < FACTOR; lcol++)
  62. {
  63. unsigned in_index = (lcol + col) + (lline + line)*input_ld;
  64. sum += input[in_index];
  65. }
  66. unsigned out_index = (col / FACTOR) + (line / FACTOR)*output_ld;
  67. output[out_index] = (uint8_t)(sum/(FACTOR*FACTOR));
  68. }
  69. }
  70. static struct starpu_codelet ds_codelet =
  71. {
  72. .cpu_funcs = {ds_kernel_cpu, NULL},
  73. .cpu_funcs_name = {"ds_kernel_cpu", NULL},
  74. .nbuffers = 2, /* input -> output */
  75. .modes = {STARPU_R, STARPU_W},
  76. .model = NULL
  77. };
  78. /* each block contains BLOCK_HEIGHT consecutive lines */
  79. static struct starpu_data_filter filter_y =
  80. {
  81. .filter_func = starpu_matrix_filter_block,
  82. .nchildren= HEIGHT/BLOCK_HEIGHT
  83. };
  84. static struct starpu_data_filter filter_uv =
  85. {
  86. .filter_func = starpu_matrix_filter_block,
  87. .nchildren = (HEIGHT/2)/BLOCK_HEIGHT
  88. };
  89. int main(int argc, char **argv)
  90. {
  91. int ret;
  92. assert(HEIGHT % (2*BLOCK_HEIGHT) == 0);
  93. assert(HEIGHT % FACTOR == 0);
  94. parse_args(argc, argv);
  95. /* fprintf(stderr, "Reading input file ...\n"); */
  96. /* how many frames ? */
  97. struct stat stbuf;
  98. stat(filename_in, &stbuf);
  99. size_t filesize = stbuf.st_size;
  100. unsigned nframes = filesize/FRAMESIZE;
  101. /* fprintf(stderr, "filesize %lx (FRAME SIZE %lx NEW SIZE %lx); nframes %d\n", filesize, FRAMESIZE, NEW_FRAMESIZE, nframes); */
  102. assert((filesize % sizeof(struct yuv_frame)) == 0);
  103. struct yuv_frame *yuv_in_buffer = (struct yuv_frame *) malloc(nframes*FRAMESIZE);
  104. assert(yuv_in_buffer);
  105. /* fprintf(stderr, "Alloc output file ...\n"); */
  106. struct yuv_new_frame *yuv_out_buffer = (struct yuv_new_frame *) calloc(nframes, NEW_FRAMESIZE);
  107. assert(yuv_out_buffer);
  108. /* fetch input data */
  109. FILE *f_in = fopen(filename_in, "r");
  110. assert(f_in);
  111. /* allocate room for an output buffer */
  112. FILE *f_out = fopen(filename_out, "w+");
  113. assert(f_out);
  114. fread(yuv_in_buffer, FRAMESIZE, nframes, f_in);
  115. starpu_data_handle_t *frame_y_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  116. starpu_data_handle_t *frame_u_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  117. starpu_data_handle_t *frame_v_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  118. starpu_data_handle_t *new_frame_y_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  119. starpu_data_handle_t *new_frame_u_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  120. starpu_data_handle_t *new_frame_v_handle = (starpu_data_handle_t *) calloc(nframes, sizeof(starpu_data_handle_t));
  121. ret = starpu_init(NULL);
  122. STARPU_CHECK_RETURN_VALUE(ret, "starpu_init");
  123. /* register and partition all layers */
  124. unsigned frame;
  125. for (frame = 0; frame < nframes; frame++)
  126. {
  127. /* register Y layer */
  128. starpu_matrix_data_register(&frame_y_handle[frame], STARPU_MAIN_RAM,
  129. (uintptr_t)&yuv_in_buffer[frame].y,
  130. WIDTH, WIDTH, HEIGHT, sizeof(uint8_t));
  131. starpu_data_partition(frame_y_handle[frame], &filter_y);
  132. starpu_matrix_data_register(&new_frame_y_handle[frame], STARPU_MAIN_RAM,
  133. (uintptr_t)&yuv_out_buffer[frame].y,
  134. NEW_WIDTH, NEW_WIDTH, NEW_HEIGHT, sizeof(uint8_t));
  135. starpu_data_partition(new_frame_y_handle[frame], &filter_y);
  136. /* register U layer */
  137. starpu_matrix_data_register(&frame_u_handle[frame], STARPU_MAIN_RAM,
  138. (uintptr_t)&yuv_in_buffer[frame].u,
  139. WIDTH/2, WIDTH/2, HEIGHT/2, sizeof(uint8_t));
  140. starpu_data_partition(frame_u_handle[frame], &filter_uv);
  141. starpu_matrix_data_register(&new_frame_u_handle[frame], STARPU_MAIN_RAM,
  142. (uintptr_t)&yuv_out_buffer[frame].u,
  143. NEW_WIDTH/2, NEW_WIDTH/2, NEW_HEIGHT/2, sizeof(uint8_t));
  144. starpu_data_partition(new_frame_u_handle[frame], &filter_uv);
  145. /* register V layer */
  146. starpu_matrix_data_register(&frame_v_handle[frame], STARPU_MAIN_RAM,
  147. (uintptr_t)&yuv_in_buffer[frame].v,
  148. WIDTH/2, WIDTH/2, HEIGHT/2, sizeof(uint8_t));
  149. starpu_data_partition(frame_v_handle[frame], &filter_uv);
  150. starpu_matrix_data_register(&new_frame_v_handle[frame], STARPU_MAIN_RAM,
  151. (uintptr_t)&yuv_out_buffer[frame].v,
  152. NEW_WIDTH/2, NEW_WIDTH/2, NEW_HEIGHT/2, sizeof(uint8_t));
  153. starpu_data_partition(new_frame_v_handle[frame], &filter_uv);
  154. }
  155. /* how many tasks are there ? */
  156. unsigned nblocks_y = filter_y.nchildren;
  157. unsigned nblocks_uv = filter_uv.nchildren;
  158. unsigned ntasks = (nblocks_y + 2*nblocks_uv)*nframes;
  159. fprintf(stderr, "Start computation: there will be %u tasks for %u frames\n", ntasks, nframes);
  160. start = starpu_timing_now();
  161. /* do the computation */
  162. for (frame = 0; frame < nframes; frame++)
  163. {
  164. unsigned blocky;
  165. for (blocky = 0; blocky < nblocks_y; blocky++)
  166. {
  167. struct starpu_task *task = starpu_task_create();
  168. task->cl = &ds_codelet;
  169. /* input */
  170. task->handles[0] = starpu_data_get_sub_data(frame_y_handle[frame], 1, blocky);
  171. /* output */
  172. task->handles[1] = starpu_data_get_sub_data(new_frame_y_handle[frame], 1, blocky);
  173. ret = starpu_task_submit(task);
  174. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  175. }
  176. unsigned blocku;
  177. for (blocku = 0; blocku < nblocks_uv; blocku++)
  178. {
  179. struct starpu_task *task = starpu_task_create();
  180. task->cl = &ds_codelet;
  181. /* input */
  182. task->handles[0] = starpu_data_get_sub_data(frame_u_handle[frame], 1, blocku);
  183. /* output */
  184. task->handles[1] = starpu_data_get_sub_data(new_frame_u_handle[frame], 1, blocku);
  185. ret = starpu_task_submit(task);
  186. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  187. }
  188. unsigned blockv;
  189. for (blockv = 0; blockv < nblocks_uv; blockv++)
  190. {
  191. struct starpu_task *task = starpu_task_create();
  192. task->cl = &ds_codelet;
  193. /* input */
  194. task->handles[0] = starpu_data_get_sub_data(frame_v_handle[frame], 1, blockv);
  195. /* output */
  196. task->handles[1] = starpu_data_get_sub_data(new_frame_v_handle[frame], 1, blockv);
  197. ret = starpu_task_submit(task);
  198. STARPU_CHECK_RETURN_VALUE(ret, "starpu_task_submit");
  199. }
  200. }
  201. /* make sure all output buffers are sync'ed */
  202. for (frame = 0; frame < nframes; frame++)
  203. {
  204. starpu_data_unregister(frame_y_handle[frame]);
  205. starpu_data_unregister(frame_u_handle[frame]);
  206. starpu_data_unregister(frame_v_handle[frame]);
  207. starpu_data_unregister(new_frame_y_handle[frame]);
  208. starpu_data_unregister(new_frame_u_handle[frame]);
  209. starpu_data_unregister(new_frame_v_handle[frame]);
  210. }
  211. /* There is an implicit barrier: the unregister methods will block
  212. * until the computation is done and that the result was put back into
  213. * memory. */
  214. end = starpu_timing_now();
  215. double timing = end - start;
  216. fprintf(stderr, "Computation took %f seconds\n", timing/1000000);
  217. fprintf(stderr, "FPS %f\n", (1000000*nframes)/timing);
  218. fwrite(yuv_out_buffer, NEW_FRAMESIZE, nframes, f_out);
  219. /* partition the layers into smaller parts */
  220. starpu_shutdown();
  221. if (fclose(f_in) != 0)
  222. fprintf(stderr, "Could not close %s properly\n", filename_in);
  223. if (fclose(f_out) != 0)
  224. fprintf(stderr, "Could not close %s properly\n", filename_out);
  225. return 0;
  226. }