early_stuff.c 4.3 KB

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