starpu_mpi_task_insert_fortran.c 14 KB

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