yuv_downscaler.c 9.0 KB

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