early_stuff.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130
  1. /* StarPU --- Runtime system for heterogeneous multicore architectures.
  2. *
  3. * Copyright (C) 2019-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 <starpu_mpi.h>
  17. #include <math.h>
  18. #include "helper.h"
  19. #ifndef STARPU_USE_MPI_MPI
  20. int main(int argc, char **argv)
  21. {
  22. int mpi_init;
  23. MPI_INIT_THREAD(&argc, &argv, MPI_THREAD_SERIALIZED, &mpi_init);
  24. if (!mpi_init)
  25. MPI_Finalize();
  26. return 0;
  27. }
  28. #else
  29. #include <mpi/starpu_mpi_early_data.h>
  30. #include <mpi/starpu_mpi_early_request.h>
  31. #include <mpi/starpu_mpi_mpi_backend.h>
  32. void early_data()
  33. {
  34. struct _starpu_mpi_early_data_handle *edh[2];
  35. struct _starpu_mpi_envelope envelope[2];
  36. struct _starpu_mpi_node_tag node_tag[2];
  37. struct _starpu_mpi_early_data_handle *early;
  38. struct _starpu_mpi_early_data_handle_tag_hashlist *hash;
  39. memset(&node_tag[0], 0, sizeof(struct _starpu_mpi_node_tag));
  40. node_tag[0].node.rank = 1;
  41. node_tag[0].node.comm = MPI_COMM_WORLD;
  42. node_tag[0].data_tag = 42;
  43. memset(&node_tag[1], 0, sizeof(struct _starpu_mpi_node_tag));
  44. node_tag[1].node.rank = 2;
  45. node_tag[1].node.comm = MPI_COMM_WORLD;
  46. node_tag[1].data_tag = 84;
  47. envelope[0].data_tag = node_tag[0].data_tag;
  48. edh[0] = _starpu_mpi_early_data_create(&envelope[0], node_tag[0].node.rank, node_tag[0].node.comm);
  49. envelope[1].data_tag = node_tag[1].data_tag;
  50. edh[1] = _starpu_mpi_early_data_create(&envelope[1], node_tag[1].node.rank, node_tag[1].node.comm);
  51. _starpu_mpi_early_data_add(edh[0]);
  52. _starpu_mpi_early_data_add(edh[1]);
  53. hash = _starpu_mpi_early_data_extract(&node_tag[0]);
  54. STARPU_ASSERT(_starpu_mpi_early_data_handle_list_size(&hash->list) == 1);
  55. early = _starpu_mpi_early_data_handle_list_pop_front(&hash->list);
  56. STARPU_ASSERT(early->node_tag.node.comm == node_tag[0].node.comm && early->node_tag.node.rank == node_tag[0].node.rank && early->node_tag.data_tag == node_tag[0].data_tag);
  57. STARPU_ASSERT(_starpu_mpi_early_data_handle_list_size(&hash->list) == 0);
  58. _starpu_mpi_early_data_delete(early);
  59. free(hash);
  60. early = _starpu_mpi_early_data_find(&node_tag[1]);
  61. STARPU_ASSERT(early->node_tag.node.comm == node_tag[1].node.comm && early->node_tag.node.rank == node_tag[1].node.rank && early->node_tag.data_tag == node_tag[1].data_tag);
  62. _starpu_mpi_early_data_delete(early);
  63. }
  64. void early_request()
  65. {
  66. struct _starpu_mpi_req req[2];
  67. struct _starpu_mpi_req *early;
  68. struct _starpu_mpi_early_request_tag_hashlist *hash;
  69. memset(&req[0].node_tag, 0, sizeof(struct _starpu_mpi_node_tag));
  70. req[0].node_tag.node.rank = 1;
  71. req[0].node_tag.node.comm = MPI_COMM_WORLD;
  72. req[0].node_tag.data_tag = 42;
  73. memset(&req[1].node_tag, 0, sizeof(struct _starpu_mpi_node_tag));
  74. req[1].node_tag.node.rank = 2;
  75. req[1].node_tag.node.comm = MPI_COMM_WORLD;
  76. req[1].node_tag.data_tag = 84;
  77. _starpu_mpi_early_request_enqueue(&req[1]);
  78. _starpu_mpi_early_request_enqueue(&req[0]);
  79. early = _starpu_mpi_early_request_dequeue(req[0].node_tag.data_tag, req[0].node_tag.node.rank, req[0].node_tag.node.comm);
  80. STARPU_ASSERT(early->node_tag.data_tag == req[0].node_tag.data_tag && early->node_tag.node.rank == req[0].node_tag.node.rank && early->node_tag.node.comm == req[0].node_tag.node.comm);
  81. hash = _starpu_mpi_early_request_extract(req[1].node_tag.data_tag, req[1].node_tag.node.rank, req[1].node_tag.node.comm);
  82. STARPU_ASSERT(_starpu_mpi_req_list_size(&hash->list) == 1);
  83. early = _starpu_mpi_req_list_pop_front(&hash->list);
  84. STARPU_ASSERT(_starpu_mpi_req_list_size(&hash->list) == 0);
  85. STARPU_ASSERT(early->node_tag.data_tag == req[1].node_tag.data_tag && early->node_tag.node.rank == req[1].node_tag.node.rank && early->node_tag.node.comm == req[1].node_tag.node.comm);
  86. free(hash);
  87. }
  88. int main(int argc, char **argv)
  89. {
  90. int ret, rank, size, i;
  91. starpu_data_handle_t tab_handle[4];
  92. int mpi_init;
  93. MPI_INIT_THREAD(&argc, &argv, MPI_THREAD_SERIALIZED, &mpi_init);
  94. ret = starpu_mpi_init_conf(&argc, &argv, mpi_init, MPI_COMM_WORLD, NULL);
  95. STARPU_CHECK_RETURN_VALUE(ret, "starpu_mpi_init_conf");
  96. early_data();
  97. early_request();
  98. starpu_mpi_shutdown();
  99. if (!mpi_init)
  100. MPI_Finalize();
  101. return 0;
  102. }
  103. #endif