starpu_insert_task_utils.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2011, 2012, 2013 Centre National de la Recherche Scientifique
  4. * Copyright (C) 2011 INRIA
  5. *
  6. * StarPU is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU Lesser General Public License as published by
  8. * the Free Software Foundation; either version 2.1 of the License, or (at
  9. * your option) any later version.
  10. *
  11. * StarPU is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  14. *
  15. * See the GNU Lesser General Public License in COPYING.LGPL for more details.
  16. */
  17. #include <util/starpu_insert_task_utils.h>
  18. #include <common/config.h>
  19. #include <common/utils.h>
  20. #include <core/task.h>
  21. typedef void (*_starpu_callback_func_t)(void *);
  22. /* Deal with callbacks. The unpack function may be called multiple times when
  23. * we have a parallel task, and we should not free the cl_arg parameter from
  24. * the callback function. */
  25. struct insert_task_cb_wrapper
  26. {
  27. _starpu_callback_func_t callback_func;
  28. void *callback_arg;
  29. };
  30. static
  31. void starpu_task_insert_callback_wrapper(void *_cl_arg_wrapper)
  32. {
  33. struct insert_task_cb_wrapper *cl_arg_wrapper = (struct insert_task_cb_wrapper *) _cl_arg_wrapper;
  34. /* Execute the callback specified by the application */
  35. if (cl_arg_wrapper->callback_func)
  36. cl_arg_wrapper->callback_func(cl_arg_wrapper->callback_arg);
  37. free(cl_arg_wrapper);
  38. }
  39. size_t _starpu_insert_task_get_arg_size(va_list varg_list)
  40. {
  41. int arg_type;
  42. size_t arg_buffer_size;
  43. arg_buffer_size = 0;
  44. arg_buffer_size += sizeof(char);
  45. while ((arg_type = va_arg(varg_list, int)) != 0)
  46. {
  47. if (arg_type & STARPU_R || arg_type & STARPU_W || arg_type & STARPU_SCRATCH || arg_type & STARPU_REDUX)
  48. {
  49. (void)va_arg(varg_list, starpu_data_handle_t);
  50. }
  51. else if (arg_type==STARPU_DATA_ARRAY)
  52. {
  53. (void)va_arg(varg_list, starpu_data_handle_t*);
  54. (void)va_arg(varg_list, int);
  55. }
  56. else if (arg_type==STARPU_VALUE)
  57. {
  58. (void)va_arg(varg_list, void *);
  59. size_t cst_size = va_arg(varg_list, size_t);
  60. arg_buffer_size += sizeof(size_t);
  61. arg_buffer_size += cst_size;
  62. }
  63. else if (arg_type==STARPU_CALLBACK)
  64. {
  65. (void)va_arg(varg_list, _starpu_callback_func_t);
  66. }
  67. else if (arg_type==STARPU_CALLBACK_WITH_ARG)
  68. {
  69. va_arg(varg_list, _starpu_callback_func_t);
  70. va_arg(varg_list, void *);
  71. }
  72. else if (arg_type==STARPU_CALLBACK_ARG)
  73. {
  74. (void)va_arg(varg_list, void *);
  75. }
  76. else if (arg_type==STARPU_PRIORITY)
  77. {
  78. (void)va_arg(varg_list, int);
  79. }
  80. else if (arg_type==STARPU_EXECUTE_ON_NODE)
  81. {
  82. (void)va_arg(varg_list, int);
  83. }
  84. else if (arg_type==STARPU_EXECUTE_ON_DATA)
  85. {
  86. (void)va_arg(varg_list, starpu_data_handle_t);
  87. }
  88. else if (arg_type==STARPU_SCHED_CTX)
  89. {
  90. (void)va_arg(varg_list, unsigned);
  91. }
  92. else if (arg_type==STARPU_HYPERVISOR_TAG)
  93. {
  94. (void)va_arg(varg_list, int);
  95. }
  96. else if (arg_type==STARPU_FLOPS)
  97. {
  98. (void)va_arg(varg_list, double);
  99. }
  100. else if (arg_type==STARPU_TAG)
  101. {
  102. (void)va_arg(varg_list, starpu_tag_t);
  103. }
  104. }
  105. va_end(varg_list);
  106. return arg_buffer_size;
  107. }
  108. int _starpu_codelet_pack_args(void **arg_buffer, size_t arg_buffer_size, va_list varg_list)
  109. {
  110. int arg_type;
  111. unsigned current_arg_offset = 0;
  112. unsigned char nargs = 0;
  113. char *_arg_buffer;
  114. /* The buffer will contain : nargs, {size, content} (x nargs)*/
  115. _arg_buffer = malloc(arg_buffer_size);
  116. /* We will begin the buffer with the number of args (which is stored as a char) */
  117. current_arg_offset += sizeof(char);
  118. while((arg_type = va_arg(varg_list, int)) != 0)
  119. {
  120. if (arg_type & STARPU_R || arg_type & STARPU_W || arg_type & STARPU_SCRATCH || arg_type & STARPU_REDUX)
  121. {
  122. (void)va_arg(varg_list, starpu_data_handle_t);
  123. }
  124. else if (arg_type==STARPU_DATA_ARRAY)
  125. {
  126. (void)va_arg(varg_list, starpu_data_handle_t*);
  127. (void)va_arg(varg_list, int);
  128. }
  129. else if (arg_type==STARPU_VALUE)
  130. {
  131. /* We have a constant value: this should be followed by a pointer to the cst value and the size of the constant */
  132. void *ptr = va_arg(varg_list, void *);
  133. size_t cst_size = va_arg(varg_list, size_t);
  134. *(size_t *)(&(_arg_buffer)[current_arg_offset]) = cst_size;
  135. current_arg_offset += sizeof(size_t);
  136. memcpy(&_arg_buffer[current_arg_offset], ptr, cst_size);
  137. current_arg_offset += cst_size;
  138. nargs++;
  139. STARPU_ASSERT(current_arg_offset <= arg_buffer_size);
  140. }
  141. else if (arg_type==STARPU_CALLBACK)
  142. {
  143. (void)va_arg(varg_list, _starpu_callback_func_t);
  144. }
  145. else if (arg_type==STARPU_CALLBACK_WITH_ARG)
  146. {
  147. va_arg(varg_list, _starpu_callback_func_t);
  148. va_arg(varg_list, void *);
  149. }
  150. else if (arg_type==STARPU_CALLBACK_ARG)
  151. {
  152. (void)va_arg(varg_list, void *);
  153. }
  154. else if (arg_type==STARPU_PROLOG_CALLBACK)
  155. {
  156. va_arg(varg_list, _starpu_callback_func_t);
  157. va_arg(varg_list, void *);
  158. }
  159. else if (arg_type==STARPU_PROLOG_CALLBACK_ARG)
  160. {
  161. (void)va_arg(varg_list, void *);
  162. }
  163. else if (arg_type==STARPU_PRIORITY)
  164. {
  165. (void)va_arg(varg_list, int);
  166. }
  167. else if (arg_type==STARPU_EXECUTE_ON_NODE)
  168. {
  169. (void)va_arg(varg_list, int);
  170. }
  171. else if (arg_type==STARPU_EXECUTE_ON_DATA)
  172. {
  173. (void)va_arg(varg_list, starpu_data_handle_t);
  174. }
  175. else if (arg_type==STARPU_SCHED_CTX)
  176. {
  177. (void)va_arg(varg_list, unsigned);
  178. }
  179. else if (arg_type==STARPU_HYPERVISOR_TAG)
  180. {
  181. (void)va_arg(varg_list, int);
  182. }
  183. else if (arg_type==STARPU_FLOPS)
  184. {
  185. (void)va_arg(varg_list, double);
  186. }
  187. else if (arg_type==STARPU_TAG)
  188. {
  189. (void)va_arg(varg_list, starpu_tag_t);
  190. }
  191. }
  192. if (nargs)
  193. {
  194. _arg_buffer[0] = nargs;
  195. }
  196. else
  197. {
  198. free(_arg_buffer);
  199. _arg_buffer = NULL;
  200. }
  201. *arg_buffer = _arg_buffer;
  202. va_end(varg_list);
  203. return 0;
  204. }
  205. int _starpu_insert_task_create_and_submit(void *arg_buffer, size_t arg_buffer_size, struct starpu_codelet *cl, struct starpu_task **task, va_list varg_list)
  206. {
  207. int arg_type;
  208. unsigned current_buffer = 0;
  209. struct insert_task_cb_wrapper *cl_arg_wrapper = (struct insert_task_cb_wrapper *) malloc(sizeof(struct insert_task_cb_wrapper));
  210. STARPU_ASSERT(cl_arg_wrapper);
  211. cl_arg_wrapper->callback_func = NULL;
  212. struct insert_task_cb_wrapper *prolog_cl_arg_wrapper = (struct insert_task_cb_wrapper *) malloc(sizeof(struct insert_task_cb_wrapper));
  213. STARPU_ASSERT(prolog_cl_arg_wrapper);
  214. prolog_cl_arg_wrapper->callback_func = NULL;
  215. while((arg_type = va_arg(varg_list, int)) != 0)
  216. {
  217. if (arg_type & STARPU_R || arg_type & STARPU_W || arg_type & STARPU_SCRATCH || arg_type & STARPU_REDUX)
  218. {
  219. /* We have an access mode : we expect to find a handle */
  220. starpu_data_handle_t handle = va_arg(varg_list, starpu_data_handle_t);
  221. enum starpu_data_access_mode mode = (enum starpu_data_access_mode) arg_type;
  222. STARPU_ASSERT(cl != NULL);
  223. STARPU_TASK_SET_HANDLE((*task), handle, current_buffer);
  224. if (STARPU_CODELET_GET_MODE(cl, current_buffer))
  225. {
  226. STARPU_ASSERT_MSG(STARPU_CODELET_GET_MODE(cl, current_buffer) == mode,
  227. "The codelet <%s> defines the access mode %d for the buffer %d which is different from the mode %d given to starpu_insert_task\n",
  228. cl->name, STARPU_CODELET_GET_MODE(cl, current_buffer),
  229. current_buffer, mode);
  230. }
  231. else
  232. {
  233. #ifdef STARPU_DEVEL
  234. # warning shall we print a warning to the user
  235. #endif
  236. STARPU_CODELET_SET_MODE(cl, mode, current_buffer);
  237. }
  238. current_buffer++;
  239. }
  240. else if (arg_type == STARPU_DATA_ARRAY)
  241. {
  242. // Expect to find a array of handles and its size
  243. starpu_data_handle_t *handles = va_arg(varg_list, starpu_data_handle_t *);
  244. int nb_handles = va_arg(varg_list, int);
  245. int i;
  246. for(i=0 ; i<nb_handles ; i++)
  247. {
  248. STARPU_TASK_SET_HANDLE((*task), handles[i], current_buffer);
  249. current_buffer++;
  250. }
  251. }
  252. else if (arg_type==STARPU_VALUE)
  253. {
  254. (void)va_arg(varg_list, void *);
  255. (void)va_arg(varg_list, size_t);
  256. }
  257. else if (arg_type==STARPU_CALLBACK)
  258. {
  259. void (*callback_func)(void *);
  260. callback_func = va_arg(varg_list, _starpu_callback_func_t);
  261. cl_arg_wrapper->callback_func = callback_func;
  262. }
  263. else if (arg_type==STARPU_CALLBACK_WITH_ARG)
  264. {
  265. void (*callback_func)(void *);
  266. void *callback_arg;
  267. callback_func = va_arg(varg_list, _starpu_callback_func_t);
  268. callback_arg = va_arg(varg_list, void *);
  269. cl_arg_wrapper->callback_func = callback_func;
  270. cl_arg_wrapper->callback_arg = callback_arg;
  271. }
  272. else if (arg_type==STARPU_CALLBACK_ARG)
  273. {
  274. void *callback_arg = va_arg(varg_list, void *);
  275. cl_arg_wrapper->callback_arg = callback_arg;
  276. }
  277. else if (arg_type==STARPU_PROLOG_CALLBACK)
  278. {
  279. void (*callback_func)(void *);
  280. void *callback_arg;
  281. callback_func = va_arg(varg_list, _starpu_callback_func_t);
  282. callback_arg = va_arg(varg_list, void *);
  283. prolog_cl_arg_wrapper->callback_func = callback_func;
  284. prolog_cl_arg_wrapper->callback_arg = callback_arg;
  285. }
  286. else if (arg_type==STARPU_PROLOG_CALLBACK_ARG)
  287. {
  288. void *callback_arg = va_arg(varg_list, void *);
  289. prolog_cl_arg_wrapper->callback_arg = callback_arg;
  290. }
  291. else if (arg_type==STARPU_PRIORITY)
  292. {
  293. /* Followed by a priority level */
  294. int prio = va_arg(varg_list, int);
  295. (*task)->priority = prio;
  296. }
  297. else if (arg_type==STARPU_EXECUTE_ON_NODE)
  298. {
  299. (void)va_arg(varg_list, int);
  300. }
  301. else if (arg_type==STARPU_EXECUTE_ON_DATA)
  302. {
  303. (void)va_arg(varg_list, starpu_data_handle_t);
  304. }
  305. else if (arg_type==STARPU_SCHED_CTX)
  306. {
  307. unsigned sched_ctx = va_arg(varg_list, unsigned);
  308. (*task)->sched_ctx = sched_ctx;
  309. }
  310. else if (arg_type==STARPU_HYPERVISOR_TAG)
  311. {
  312. int hypervisor_tag = va_arg(varg_list, int);
  313. (*task)->hypervisor_tag = hypervisor_tag;
  314. }
  315. else if (arg_type==STARPU_FLOPS)
  316. {
  317. double flops = va_arg(varg_list, double);
  318. (*task)->flops = flops;
  319. }
  320. else if (arg_type==STARPU_TAG)
  321. {
  322. starpu_tag_t tag = va_arg(varg_list, starpu_tag_t);
  323. (*task)->tag_id = tag;
  324. (*task)->use_tag = 1;
  325. }
  326. }
  327. va_end(varg_list);
  328. STARPU_ASSERT(cl == NULL || current_buffer == cl->nbuffers);
  329. (*task)->cl = cl;
  330. (*task)->cl_arg = arg_buffer;
  331. (*task)->cl_arg_size = arg_buffer_size;
  332. /* The callback will free the argument stack and execute the
  333. * application's callback, if any. */
  334. (*task)->callback_func = starpu_task_insert_callback_wrapper;
  335. (*task)->callback_arg = cl_arg_wrapper;
  336. (*task)->prolog_func = starpu_task_insert_callback_wrapper;
  337. (*task)->prolog_arg = prolog_cl_arg_wrapper;
  338. int ret = starpu_task_submit(*task);
  339. if (STARPU_UNLIKELY(ret == -ENODEV))
  340. {
  341. fprintf(stderr, "submission of task %p wih codelet %p failed (symbol `%s') (err: ENODEV)\n",
  342. *task, (*task)->cl,
  343. (cl == NULL) ? "none" :
  344. (*task)->cl->name ? (*task)->cl->name :
  345. ((*task)->cl->model && (*task)->cl->model->symbol)?(*task)->cl->model->symbol:"none");
  346. free(cl_arg_wrapper);
  347. free(prolog_cl_arg_wrapper);
  348. }
  349. return ret;
  350. }