starpu_mpi_task_insert_fortran.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553
  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_WITH_ARG_NFREE)
  206. {
  207. arg_i++;
  208. /* _starpu_callback_func_t */
  209. arg_i++;
  210. /* void* */
  211. }
  212. else if (arg_type==STARPU_CALLBACK_ARG)
  213. {
  214. arg_i++;
  215. /* void* */
  216. }
  217. else if (arg_type==STARPU_CALLBACK_ARG_NFREE)
  218. {
  219. arg_i++;
  220. /* void* */
  221. }
  222. else if (arg_type==STARPU_PRIORITY)
  223. {
  224. prio = *(int *)arglist[arg_i];
  225. arg_i++;
  226. /* int* */
  227. }
  228. /* STARPU_EXECUTE_ON_NODE handled above */
  229. /* STARPU_EXECUTE_ON_DATA handled above */
  230. /* STARPU_DATA_ARRAY handled above */
  231. /* STARPU_DATA_MODE_ARRAY handled above */
  232. else if (arg_type==STARPU_TAG)
  233. {
  234. arg_i++;
  235. /* starpu_tag_t* */
  236. }
  237. else if (arg_type==STARPU_HYPERVISOR_TAG)
  238. {
  239. arg_i++;
  240. /* int* */
  241. }
  242. else if (arg_type==STARPU_FLOPS)
  243. {
  244. arg_i++;
  245. /* double* */
  246. }
  247. else if (arg_type==STARPU_SCHED_CTX)
  248. {
  249. arg_i++;
  250. /* unsigned* */
  251. }
  252. else if (arg_type==STARPU_PROLOGUE_CALLBACK)
  253. {
  254. arg_i++;
  255. /* _starpu_callback_func_t */
  256. }
  257. else if (arg_type==STARPU_PROLOGUE_CALLBACK_ARG)
  258. {
  259. arg_i++;
  260. /* void* */
  261. }
  262. else if (arg_type==STARPU_PROLOGUE_CALLBACK_ARG_NFREE)
  263. {
  264. arg_i++;
  265. /* void* */
  266. }
  267. else if (arg_type==STARPU_PROLOGUE_CALLBACK_POP)
  268. {
  269. arg_i++;
  270. /* _starpu_callback_func_t */
  271. }
  272. else if (arg_type==STARPU_PROLOGUE_CALLBACK_POP_ARG)
  273. {
  274. arg_i++;
  275. /* void* */
  276. }
  277. else if (arg_type==STARPU_PROLOGUE_CALLBACK_POP_ARG_NFREE)
  278. {
  279. arg_i++;
  280. /* void* */
  281. }
  282. else if (arg_type==STARPU_EXECUTE_WHERE)
  283. {
  284. arg_i++;
  285. /* int* */
  286. }
  287. else if (arg_type==STARPU_EXECUTE_ON_WORKER)
  288. {
  289. arg_i++;
  290. /* int* */
  291. }
  292. else if (arg_type==STARPU_TAG_ONLY)
  293. {
  294. arg_i++;
  295. /* starpu_tag_t* */
  296. }
  297. else if (arg_type==STARPU_NAME)
  298. {
  299. arg_i++;
  300. /* char* */
  301. }
  302. else if (arg_type==STARPU_POSSIBLY_PARALLEL)
  303. {
  304. arg_i++;
  305. /* unsigned* */
  306. }
  307. else if (arg_type==STARPU_WORKER_ORDER)
  308. {
  309. arg_i++;
  310. /* unsigned* */
  311. }
  312. else if (arg_type==STARPU_NODE_SELECTION_POLICY)
  313. {
  314. arg_i++;
  315. /* int* */
  316. }
  317. else if (arg_type==STARPU_TASK_COLOR)
  318. {
  319. arg_i++;
  320. /* int* */
  321. }
  322. else if (arg_type==STARPU_TASK_SYNCHRONOUS)
  323. {
  324. arg_i++;
  325. /* int* */
  326. }
  327. else if (arg_type==STARPU_HANDLES_SEQUENTIAL_CONSISTENCY)
  328. {
  329. arg_i++;
  330. /* char* */
  331. }
  332. else if (arg_type==STARPU_TASK_END_DEP)
  333. {
  334. arg_i++;
  335. /* int */
  336. }
  337. else if (arg_type==STARPU_TASK_WORKERIDS)
  338. {
  339. arg_i++;
  340. /* unsigned */
  341. arg_i++;
  342. /* uint32_t* */
  343. }
  344. else if (arg_type==STARPU_SEQUENTIAL_CONSISTENCY)
  345. {
  346. arg_i++;
  347. /* unsigned */
  348. }
  349. else if (arg_type==STARPU_TASK_PROFILING_INFO)
  350. {
  351. arg_i++;
  352. /* struct starpu_profiling_task_info * */
  353. }
  354. else if (arg_type==STARPU_TASK_NO_SUBMITORDER)
  355. {
  356. arg_i++;
  357. /* unsigned */
  358. }
  359. else
  360. {
  361. STARPU_ABORT_MSG("Unrecognized argument %d, did you perhaps forget to end arguments with 0?\n", arg_type);
  362. }
  363. arg_i++;
  364. }
  365. if (inconsistent_execute == 1 || *xrank == -1)
  366. {
  367. // We need to find out which node is going to execute the codelet.
  368. _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");
  369. *xrank = _starpu_mpi_select_node(me, nb_nodes, descrs, nb_data, select_node_policy);
  370. *do_execute = *xrank == STARPU_MPI_PER_NODE || (me == *xrank);
  371. }
  372. else
  373. {
  374. _STARPU_MPI_DEBUG(100, "Inconsistent=%d - xrank=%d\n", inconsistent_execute, *xrank);
  375. *do_execute = *xrank == STARPU_MPI_PER_NODE || (me == *xrank);
  376. }
  377. _STARPU_MPI_DEBUG(100, "do_execute=%d\n", *do_execute);
  378. *descrs_p = descrs;
  379. *nb_data_p = nb_data;
  380. *prio_p = prio;
  381. _STARPU_TRACE_TASK_MPI_DECODE_END();
  382. return 0;
  383. }
  384. static
  385. 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)
  386. {
  387. int me, do_execute, xrank, nb_nodes;
  388. int ret;
  389. int i;
  390. struct starpu_data_descr *descrs;
  391. int nb_data;
  392. int prio;
  393. _STARPU_MPI_LOG_IN();
  394. starpu_mpi_comm_rank(comm, &me);
  395. starpu_mpi_comm_size(comm, &nb_nodes);
  396. /* Find out whether we are to execute the data because we own the data to be written to. */
  397. ret = _fstarpu_mpi_task_decode_v(codelet, me, nb_nodes, &xrank, &do_execute, &descrs, &nb_data, &prio, arglist);
  398. if (ret < 0)
  399. return ret;
  400. _STARPU_TRACE_TASK_MPI_PRE_START();
  401. /* Send and receive data as requested */
  402. for(i=0 ; i<nb_data ; i++)
  403. {
  404. _starpu_mpi_exchange_data_before_execution(descrs[i].handle, descrs[i].mode, me, xrank, do_execute, prio, comm);
  405. }
  406. if (xrank_p)
  407. *xrank_p = xrank;
  408. if (nb_data_p)
  409. *nb_data_p = nb_data;
  410. if (prio_p)
  411. *prio_p = prio;
  412. if (descrs_p)
  413. *descrs_p = descrs;
  414. else
  415. free(descrs);
  416. _STARPU_TRACE_TASK_MPI_PRE_END();
  417. if (do_execute == 0)
  418. {
  419. return 1;
  420. }
  421. else
  422. {
  423. _STARPU_MPI_DEBUG(100, "Execution of the codelet %p (%s)\n", codelet, codelet?codelet->name:NULL);
  424. *task = starpu_task_create();
  425. (*task)->cl_arg_free = 1;
  426. (*task)->callback_arg_free = 1;
  427. (*task)->prologue_callback_arg_free = 1;
  428. (*task)->prologue_callback_pop_arg_free = 1;
  429. _fstarpu_task_insert_create(codelet, *task, arglist);
  430. return 0;
  431. }
  432. }
  433. static
  434. int _fstarpu_mpi_task_insert_v(MPI_Comm comm, struct starpu_codelet *codelet, void **arglist)
  435. {
  436. struct starpu_task *task;
  437. int ret;
  438. int xrank;
  439. int do_execute = 0;
  440. struct starpu_data_descr *descrs;
  441. int nb_data;
  442. int prio;
  443. ret = _fstarpu_mpi_task_build_v(comm, codelet, &task, &xrank, &descrs, &nb_data, &prio, arglist);
  444. if (ret < 0)
  445. return ret;
  446. if (ret == 0)
  447. {
  448. do_execute = 1;
  449. ret = starpu_task_submit(task);
  450. if (STARPU_UNLIKELY(ret == -ENODEV))
  451. {
  452. _STARPU_MSG("submission of task %p wih codelet %p failed (symbol `%s') (err: ENODEV)\n",
  453. task, task->cl,
  454. (codelet == NULL) ? "none" :
  455. task->cl->name ? task->cl->name :
  456. (task->cl->model && task->cl->model->symbol)?task->cl->model->symbol:"none");
  457. task->destroy = 0;
  458. starpu_task_destroy(task);
  459. }
  460. }
  461. return _starpu_mpi_task_postbuild_v(comm, xrank, do_execute, descrs, nb_data, prio);
  462. }
  463. int fstarpu_mpi_task_insert(MPI_Fint comm, void ***_arglist)
  464. {
  465. void **arglist = *_arglist;
  466. struct starpu_codelet *codelet = arglist[0];
  467. if (codelet == NULL)
  468. {
  469. STARPU_ABORT_MSG("task without codelet");
  470. }
  471. int ret;
  472. ret = _fstarpu_mpi_task_insert_v(MPI_Comm_f2c(comm), codelet, arglist+1);
  473. return ret;
  474. }
  475. /* fstarpu_mpi_insert_task: aliased to fstarpu_mpi_task_insert in fstarpu_mpi_mod.f90 */
  476. struct starpu_task *fstarpu_mpi_task_build(MPI_Fint comm, void ***_arglist)
  477. {
  478. void **arglist = *_arglist;
  479. struct starpu_codelet *codelet = arglist[0];
  480. if (codelet == NULL)
  481. {
  482. STARPU_ABORT_MSG("task without codelet");
  483. }
  484. struct starpu_task *task;
  485. int ret;
  486. ret = _fstarpu_mpi_task_build_v(MPI_Comm_f2c(comm), codelet, &task, NULL, NULL, NULL, NULL, arglist+1);
  487. STARPU_ASSERT(ret >= 0);
  488. return (ret > 0) ? NULL : task;
  489. }
  490. int fstarpu_mpi_task_post_build(MPI_Fint _comm, void ***_arglist)
  491. {
  492. void **arglist = *_arglist;
  493. struct starpu_codelet *codelet = arglist[0];
  494. if (codelet == NULL)
  495. {
  496. STARPU_ABORT_MSG("task without codelet");
  497. }
  498. MPI_Comm comm = MPI_Comm_f2c(_comm);
  499. int xrank, do_execute;
  500. int ret, me, nb_nodes;
  501. struct starpu_data_descr *descrs;
  502. int nb_data;
  503. int prio;
  504. starpu_mpi_comm_rank(comm, &me);
  505. starpu_mpi_comm_size(comm, &nb_nodes);
  506. /* Find out whether we are to execute the data because we own the data to be written to. */
  507. ret = _fstarpu_mpi_task_decode_v(codelet, me, nb_nodes, &xrank, &do_execute, &descrs, &nb_data, &prio, arglist);
  508. if (ret < 0)
  509. return ret;
  510. return _starpu_mpi_task_postbuild_v(comm, xrank, do_execute, descrs, nb_data, prio);
  511. }
  512. #endif /* HAVE_MPI_COMM_F2C */