starpu_mpi_task_insert_fortran.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2016-2019 CNRS
  4. * Copyright (C) 2017,2018 Université de Bordeaux
  5. * Copyright (C) 2016 Inria
  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 <stdlib.h>
  19. #include <starpu_mpi.h>
  20. #include <common/config.h>
  21. #include <starpu_mpi_private.h>
  22. #include <starpu_mpi_task_insert.h>
  23. #include <starpu_mpi_select_node.h>
  24. #include <util/starpu_task_insert_utils.h>
  25. #ifdef HAVE_MPI_COMM_F2C
  26. static
  27. int _fstarpu_mpi_task_decode_v(struct starpu_codelet *codelet, int me, int nb_nodes, int *xrank, int *do_execute, struct starpu_data_descr **descrs_p, int *nb_data_p, int *prio_p, void **arglist)
  28. {
  29. int arg_i = 0;
  30. int inconsistent_execute = 0;
  31. int node_selected = 0;
  32. int nb_allocated_data = 16;
  33. struct starpu_data_descr *descrs;
  34. int nb_data;
  35. int prio = 0;
  36. int select_node_policy = STARPU_MPI_NODE_SELECTION_CURRENT_POLICY;
  37. _STARPU_TRACE_TASK_MPI_DECODE_START();
  38. _STARPU_MPI_MALLOC(descrs, nb_allocated_data * sizeof(struct starpu_data_descr));
  39. nb_data = 0;
  40. *do_execute = -1;
  41. *xrank = -1;
  42. while (arglist[arg_i] != NULL)
  43. {
  44. int arg_type = (int)(intptr_t)arglist[arg_i];
  45. int arg_type_nocommute = arg_type & ~STARPU_COMMUTE;
  46. if (arg_type==STARPU_EXECUTE_ON_NODE)
  47. {
  48. arg_i++;
  49. *xrank = *(int *)arglist[arg_i];
  50. if (node_selected == 0)
  51. {
  52. _STARPU_MPI_DEBUG(100, "Executing on node %d\n", *xrank);
  53. *do_execute = 1;
  54. node_selected = 1;
  55. inconsistent_execute = 0;
  56. }
  57. }
  58. else if (arg_type==STARPU_EXECUTE_ON_DATA)
  59. {
  60. arg_i++;
  61. starpu_data_handle_t data = arglist[arg_i];
  62. if (node_selected == 0)
  63. {
  64. *xrank = starpu_mpi_data_get_rank(data);
  65. STARPU_ASSERT_MSG(*xrank != -1, "Rank of the data must be set using starpu_mpi_data_register() or starpu_data_set_rank()");
  66. _STARPU_MPI_DEBUG(100, "Executing on data node %d\n", *xrank);
  67. STARPU_ASSERT_MSG(*xrank <= nb_nodes, "Node %d to execute codelet is not a valid node (%d)", *xrank, nb_nodes);
  68. *do_execute = 1;
  69. node_selected = 1;
  70. inconsistent_execute = 0;
  71. }
  72. }
  73. else if (arg_type_nocommute & STARPU_R || arg_type_nocommute & STARPU_W || arg_type_nocommute & STARPU_RW || arg_type & STARPU_SCRATCH || arg_type & STARPU_REDUX)
  74. {
  75. arg_i++;
  76. starpu_data_handle_t data = arglist[arg_i];
  77. enum starpu_data_access_mode mode = (enum starpu_data_access_mode) arg_type;
  78. if (node_selected == 0)
  79. {
  80. int ret = _starpu_mpi_find_executee_node(data, mode, me, do_execute, &inconsistent_execute, xrank);
  81. if (ret == -EINVAL)
  82. {
  83. free(descrs);
  84. _STARPU_TRACE_TASK_MPI_DECODE_END();
  85. return ret;
  86. }
  87. }
  88. if (nb_data >= nb_allocated_data)
  89. {
  90. nb_allocated_data *= 2;
  91. _STARPU_MPI_REALLOC(descrs, nb_allocated_data * sizeof(struct starpu_data_descr));
  92. }
  93. descrs[nb_data].handle = data;
  94. descrs[nb_data].mode = mode;
  95. nb_data ++;
  96. }
  97. else if (arg_type == STARPU_DATA_ARRAY)
  98. {
  99. arg_i++;
  100. starpu_data_handle_t *datas = arglist[arg_i];
  101. arg_i++;
  102. int nb_handles = *(int *)arglist[arg_i];
  103. int i;
  104. for(i=0 ; i<nb_handles ; i++)
  105. {
  106. STARPU_ASSERT_MSG(codelet->nbuffers == STARPU_VARIABLE_NBUFFERS || nb_data < codelet->nbuffers, "Too many data passed to starpu_mpi_task_insert");
  107. enum starpu_data_access_mode mode = STARPU_CODELET_GET_MODE(codelet, nb_data);
  108. if (node_selected == 0)
  109. {
  110. int ret = _starpu_mpi_find_executee_node(datas[i], mode, me, do_execute, &inconsistent_execute, xrank);
  111. if (ret == -EINVAL)
  112. {
  113. free(descrs);
  114. _STARPU_TRACE_TASK_MPI_DECODE_END();
  115. return ret;
  116. }
  117. }
  118. if (nb_data >= nb_allocated_data)
  119. {
  120. nb_allocated_data *= 2;
  121. _STARPU_MPI_REALLOC(descrs, nb_allocated_data * sizeof(struct starpu_data_descr));
  122. }
  123. descrs[nb_data].handle = datas[i];
  124. descrs[nb_data].mode = mode;
  125. nb_data ++;
  126. }
  127. }
  128. else if (arg_type == STARPU_DATA_MODE_ARRAY)
  129. {
  130. arg_i++;
  131. struct starpu_data_descr *_descrs = arglist[arg_i];
  132. arg_i++;
  133. int nb_handles = *(int *)arglist[arg_i];
  134. int i;
  135. for(i=0 ; i<nb_handles ; i++)
  136. {
  137. enum starpu_data_access_mode mode = _descrs[i].mode;
  138. if (node_selected == 0)
  139. {
  140. int ret = _starpu_mpi_find_executee_node(_descrs[i].handle, mode, me, do_execute, &inconsistent_execute, xrank);
  141. if (ret == -EINVAL)
  142. {
  143. free(descrs);
  144. _STARPU_TRACE_TASK_MPI_DECODE_END();
  145. return ret;
  146. }
  147. }
  148. if (nb_data >= nb_allocated_data)
  149. {
  150. nb_allocated_data *= 2;
  151. _STARPU_MPI_REALLOC(descrs, nb_allocated_data * sizeof(struct starpu_data_descr));
  152. }
  153. descrs[nb_data].handle = _descrs[i].handle;
  154. descrs[nb_data].mode = mode;
  155. nb_data ++;
  156. }
  157. }
  158. else if (arg_type==STARPU_VALUE)
  159. {
  160. arg_i++;
  161. /* void* */
  162. arg_i++;
  163. /* size_t */
  164. }
  165. else if (arg_type==STARPU_CL_ARGS)
  166. {
  167. arg_i++;
  168. /* void* */
  169. arg_i++;
  170. /* size_t */
  171. }
  172. else if (arg_type==STARPU_CL_ARGS_NFREE)
  173. {
  174. arg_i++;
  175. /* void* */
  176. arg_i++;
  177. /* size_t */
  178. }
  179. else if (arg_type==STARPU_TASK_DEPS_ARRAY)
  180. {
  181. arg_i++;
  182. /* unsigned */
  183. arg_i++;
  184. /* struct starpu_task ** */
  185. }
  186. else if (arg_type==STARPU_TASK_END_DEPS_ARRAY)
  187. {
  188. arg_i++;
  189. /* unsigned */
  190. arg_i++;
  191. /* struct starpu_task ** */
  192. }
  193. else if (arg_type==STARPU_CALLBACK)
  194. {
  195. arg_i++;
  196. /* _starpu_callback_func_t */
  197. }
  198. else if (arg_type==STARPU_CALLBACK_WITH_ARG)
  199. {
  200. arg_i++;
  201. /* _starpu_callback_func_t */
  202. arg_i++;
  203. /* void* */
  204. }
  205. else if (arg_type==STARPU_CALLBACK_ARG)
  206. {
  207. arg_i++;
  208. /* void* */
  209. }
  210. else if (arg_type==STARPU_PRIORITY)
  211. {
  212. prio = *(int *)arglist[arg_i];
  213. arg_i++;
  214. /* int* */
  215. }
  216. /* STARPU_EXECUTE_ON_NODE handled above */
  217. /* STARPU_EXECUTE_ON_DATA handled above */
  218. /* STARPU_DATA_ARRAY handled above */
  219. /* STARPU_DATA_MODE_ARRAY handled above */
  220. else if (arg_type==STARPU_TAG)
  221. {
  222. arg_i++;
  223. /* starpu_tag_t* */
  224. }
  225. else if (arg_type==STARPU_HYPERVISOR_TAG)
  226. {
  227. arg_i++;
  228. /* int* */
  229. }
  230. else if (arg_type==STARPU_FLOPS)
  231. {
  232. arg_i++;
  233. /* double* */
  234. }
  235. else if (arg_type==STARPU_SCHED_CTX)
  236. {
  237. arg_i++;
  238. /* unsigned* */
  239. }
  240. else if (arg_type==STARPU_PROLOGUE_CALLBACK)
  241. {
  242. arg_i++;
  243. /* _starpu_callback_func_t */
  244. }
  245. else if (arg_type==STARPU_PROLOGUE_CALLBACK_ARG)
  246. {
  247. arg_i++;
  248. /* void* */
  249. }
  250. else if (arg_type==STARPU_PROLOGUE_CALLBACK_POP)
  251. {
  252. arg_i++;
  253. /* _starpu_callback_func_t */
  254. }
  255. else if (arg_type==STARPU_PROLOGUE_CALLBACK_POP_ARG)
  256. {
  257. arg_i++;
  258. /* void* */
  259. }
  260. else if (arg_type==STARPU_EXECUTE_WHERE)
  261. {
  262. arg_i++;
  263. /* int* */
  264. }
  265. else if (arg_type==STARPU_EXECUTE_ON_WORKER)
  266. {
  267. arg_i++;
  268. /* int* */
  269. }
  270. else if (arg_type==STARPU_TAG_ONLY)
  271. {
  272. arg_i++;
  273. /* starpu_tag_t* */
  274. }
  275. else if (arg_type==STARPU_NAME)
  276. {
  277. arg_i++;
  278. /* char* */
  279. }
  280. else if (arg_type==STARPU_POSSIBLY_PARALLEL)
  281. {
  282. arg_i++;
  283. /* unsigned* */
  284. }
  285. else if (arg_type==STARPU_WORKER_ORDER)
  286. {
  287. arg_i++;
  288. /* unsigned* */
  289. }
  290. else if (arg_type==STARPU_NODE_SELECTION_POLICY)
  291. {
  292. arg_i++;
  293. /* int* */
  294. }
  295. else if (arg_type==STARPU_TASK_COLOR)
  296. {
  297. arg_i++;
  298. /* int* */
  299. }
  300. else if (arg_type==STARPU_TASK_SYNCHRONOUS)
  301. {
  302. arg_i++;
  303. /* int* */
  304. }
  305. else if (arg_type==STARPU_HANDLES_SEQUENTIAL_CONSISTENCY)
  306. {
  307. arg_i++;
  308. /* char* */
  309. }
  310. else if (arg_type==STARPU_TASK_END_DEP)
  311. {
  312. arg_i++;
  313. /* int */
  314. }
  315. else
  316. {
  317. STARPU_ABORT_MSG("Unrecognized argument %d, did you perhaps forget to end arguments with 0?\n", arg_type);
  318. }
  319. arg_i++;
  320. }
  321. if (inconsistent_execute == 1 || *xrank == -1)
  322. {
  323. // We need to find out which node is going to execute the codelet.
  324. _STARPU_MPI_DISP("Different nodes are owning W data. The node to execute the codelet is going to be selected with the current selection node policy. See starpu_mpi_node_selection_set_current_policy() to change the policy, or use STARPU_EXECUTE_ON_NODE or STARPU_EXECUTE_ON_DATA to specify the node\n");
  325. *xrank = _starpu_mpi_select_node(me, nb_nodes, descrs, nb_data, select_node_policy);
  326. *do_execute = *xrank == STARPU_MPI_PER_NODE || (me == *xrank);
  327. }
  328. else
  329. {
  330. _STARPU_MPI_DEBUG(100, "Inconsistent=%d - xrank=%d\n", inconsistent_execute, *xrank);
  331. *do_execute = *xrank == STARPU_MPI_PER_NODE || (me == *xrank);
  332. }
  333. _STARPU_MPI_DEBUG(100, "do_execute=%d\n", *do_execute);
  334. *descrs_p = descrs;
  335. *nb_data_p = nb_data;
  336. *prio_p = prio;
  337. _STARPU_TRACE_TASK_MPI_DECODE_END();
  338. return 0;
  339. }
  340. static
  341. int _fstarpu_mpi_task_build_v(MPI_Comm comm, struct starpu_codelet *codelet, struct starpu_task **task, int *xrank_p, struct starpu_data_descr **descrs_p, int *nb_data_p, int *prio_p, void **arglist)
  342. {
  343. int me, do_execute, xrank, nb_nodes;
  344. int ret;
  345. int i;
  346. struct starpu_data_descr *descrs;
  347. int nb_data;
  348. int prio;
  349. _STARPU_MPI_LOG_IN();
  350. starpu_mpi_comm_rank(comm, &me);
  351. starpu_mpi_comm_size(comm, &nb_nodes);
  352. /* Find out whether we are to execute the data because we own the data to be written to. */
  353. ret = _fstarpu_mpi_task_decode_v(codelet, me, nb_nodes, &xrank, &do_execute, &descrs, &nb_data, &prio, arglist);
  354. if (ret < 0)
  355. return ret;
  356. _STARPU_TRACE_TASK_MPI_PRE_START();
  357. /* Send and receive data as requested */
  358. for(i=0 ; i<nb_data ; i++)
  359. {
  360. _starpu_mpi_exchange_data_before_execution(descrs[i].handle, descrs[i].mode, me, xrank, do_execute, prio, comm);
  361. }
  362. if (xrank_p)
  363. *xrank_p = xrank;
  364. if (nb_data_p)
  365. *nb_data_p = nb_data;
  366. if (prio_p)
  367. *prio_p = prio;
  368. if (descrs_p)
  369. *descrs_p = descrs;
  370. else
  371. free(descrs);
  372. _STARPU_TRACE_TASK_MPI_PRE_END();
  373. if (do_execute == 0)
  374. {
  375. return 1;
  376. }
  377. else
  378. {
  379. _STARPU_MPI_DEBUG(100, "Execution of the codelet %p (%s)\n", codelet, codelet?codelet->name:NULL);
  380. *task = starpu_task_create();
  381. (*task)->cl_arg_free = 1;
  382. _fstarpu_task_insert_create(codelet, *task, arglist);
  383. return 0;
  384. }
  385. }
  386. static
  387. int _fstarpu_mpi_task_insert_v(MPI_Comm comm, struct starpu_codelet *codelet, void **arglist)
  388. {
  389. struct starpu_task *task;
  390. int ret;
  391. int xrank;
  392. int do_execute = 0;
  393. struct starpu_data_descr *descrs;
  394. int nb_data;
  395. int prio;
  396. ret = _fstarpu_mpi_task_build_v(comm, codelet, &task, &xrank, &descrs, &nb_data, &prio, arglist);
  397. if (ret < 0)
  398. return ret;
  399. if (ret == 0)
  400. {
  401. do_execute = 1;
  402. ret = starpu_task_submit(task);
  403. if (STARPU_UNLIKELY(ret == -ENODEV))
  404. {
  405. _STARPU_MSG("submission of task %p wih codelet %p failed (symbol `%s') (err: ENODEV)\n",
  406. task, task->cl,
  407. (codelet == NULL) ? "none" :
  408. task->cl->name ? task->cl->name :
  409. (task->cl->model && task->cl->model->symbol)?task->cl->model->symbol:"none");
  410. task->destroy = 0;
  411. starpu_task_destroy(task);
  412. }
  413. }
  414. return _starpu_mpi_task_postbuild_v(comm, xrank, do_execute, descrs, nb_data, prio);
  415. }
  416. int fstarpu_mpi_task_insert(MPI_Fint comm, void ***_arglist)
  417. {
  418. void **arglist = *_arglist;
  419. struct starpu_codelet *codelet = arglist[0];
  420. if (codelet == NULL)
  421. {
  422. STARPU_ABORT_MSG("task without codelet");
  423. }
  424. int ret;
  425. ret = _fstarpu_mpi_task_insert_v(MPI_Comm_f2c(comm), codelet, arglist+1);
  426. return ret;
  427. }
  428. /* fstarpu_mpi_insert_task: aliased to fstarpu_mpi_task_insert in fstarpu_mpi_mod.f90 */
  429. struct starpu_task *fstarpu_mpi_task_build(MPI_Fint comm, void ***_arglist)
  430. {
  431. void **arglist = *_arglist;
  432. struct starpu_codelet *codelet = arglist[0];
  433. if (codelet == NULL)
  434. {
  435. STARPU_ABORT_MSG("task without codelet");
  436. }
  437. struct starpu_task *task;
  438. int ret;
  439. ret = _fstarpu_mpi_task_build_v(MPI_Comm_f2c(comm), codelet, &task, NULL, NULL, NULL, NULL, arglist+1);
  440. STARPU_ASSERT(ret >= 0);
  441. return (ret > 0) ? NULL : task;
  442. }
  443. int fstarpu_mpi_task_post_build(MPI_Fint _comm, void ***_arglist)
  444. {
  445. void **arglist = *_arglist;
  446. struct starpu_codelet *codelet = arglist[0];
  447. if (codelet == NULL)
  448. {
  449. STARPU_ABORT_MSG("task without codelet");
  450. }
  451. MPI_Comm comm = MPI_Comm_f2c(_comm);
  452. int xrank, do_execute;
  453. int ret, me, nb_nodes;
  454. struct starpu_data_descr *descrs;
  455. int nb_data;
  456. int prio;
  457. starpu_mpi_comm_rank(comm, &me);
  458. starpu_mpi_comm_size(comm, &nb_nodes);
  459. /* Find out whether we are to execute the data because we own the data to be written to. */
  460. ret = _fstarpu_mpi_task_decode_v(codelet, me, nb_nodes, &xrank, &do_execute, &descrs, &nb_data, &prio, arglist);
  461. if (ret < 0)
  462. return ret;
  463. return _starpu_mpi_task_postbuild_v(comm, xrank, do_execute, descrs, nb_data, prio);
  464. }
  465. #endif /* HAVE_MPI_COMM_F2C */