src/smpi/bindings/smpi_pmpi_group.cpp

   1 /* Copyright (c) 2007-2023. The SimGrid Team. All rights reserved.          */
   2
   3 /* This program is free software; you can redistribute it and/or modify it
   4  * under the terms of the license (GNU LGPL) which comes with this package. */
   5
   6 #include "private.hpp"
   7 #include "smpi_coll.hpp"
   8 #include "smpi_comm.hpp"
   9 #include "smpi_datatype_derived.hpp"
  10 #include "smpi_op.hpp"
  11 #include "src/smpi/include/smpi_actor.hpp"
  12
  13 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(smpi_pmpi);
  14
  15 /* PMPI User level calls */
  16
  17 int PMPI_Group_free(MPI_Group * group)
  18 {
  19   CHECK_NULL(1, MPI_ERR_ARG, group)
  20   CHECK_MPI_NULL(1, MPI_GROUP_NULL, MPI_ERR_GROUP, *group)
  21   if(*group != MPI_COMM_WORLD->group() && *group != MPI_GROUP_EMPTY){
  22     (*group)->mark_as_deleted();
  23     simgrid::smpi::Group::unref(*group);
  24   }
  25   *group = MPI_GROUP_NULL;
  26   return MPI_SUCCESS;
  27 }
  28
  29 int PMPI_Group_size(MPI_Group group, int *size)
  30 {
  31   CHECK_GROUP(1, group)
  32   CHECK_NULL(2, MPI_ERR_ARG, size)
  33   *size = group->size();
  34   return MPI_SUCCESS;
  35 }
  36
  37 int PMPI_Group_rank(MPI_Group group, int *rank)
  38 {
  39   CHECK_GROUP(1, group)
  40   CHECK_NULL(2, MPI_ERR_ARG, rank)
  41   *rank = group->rank(simgrid::s4u::this_actor::get_pid());
  42   return MPI_SUCCESS;
  43 }
  44
  45 int PMPI_Group_translate_ranks(MPI_Group group1, int n, const int *ranks1, MPI_Group group2, int *ranks2)
  46 {
  47   CHECK_GROUP(1, group1)
  48   CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
  49   CHECK_NULL(3, MPI_ERR_ARG, ranks1)
  50   CHECK_NULL(5, MPI_ERR_ARG, ranks2)
  51   CHECK_GROUP(4, group2)
  52   for (int i = 0; i < n; i++) {
  53     if (ranks1[i] != MPI_PROC_NULL && (ranks1[i] < 0 || ranks1[i] >= group1->size()))
  54       return MPI_ERR_RANK;
  55     if(ranks1[i]==MPI_PROC_NULL){
  56       ranks2[i]=MPI_PROC_NULL;
  57     }else{
  58       aid_t actor = group1->actor(ranks1[i]);
  59       ranks2[i] = group2->rank(actor);
  60     }
  61   }
  62   return MPI_SUCCESS;
  63 }
  64
  65 int PMPI_Group_compare(MPI_Group group1, MPI_Group group2, int *result)
  66 {
  67   CHECK_GROUP(1, group1)
  68   CHECK_GROUP(2, group2)
  69   CHECK_NULL(3, MPI_ERR_ARG, result)
  70   *result = group1->compare(group2);
  71   return MPI_SUCCESS;
  72 }
  73
  74 int PMPI_Group_union(MPI_Group group1, MPI_Group group2, MPI_Group * newgroup)
  75 {
  76   CHECK_GROUP(1, group1)
  77   CHECK_GROUP(2, group2)
  78   CHECK_NULL(3, MPI_ERR_ARG, newgroup)
  79   return group1->group_union(group2, newgroup);
  80 }
  81
  82 int PMPI_Group_intersection(MPI_Group group1, MPI_Group group2, MPI_Group * newgroup)
  83 {
  84   CHECK_GROUP(1, group1)
  85   CHECK_GROUP(2, group2)
  86   CHECK_NULL(3, MPI_ERR_ARG, newgroup)
  87   if(group1 == MPI_GROUP_EMPTY || group2 == MPI_GROUP_EMPTY){
  88     *newgroup = MPI_GROUP_EMPTY;
  89     return MPI_SUCCESS;
  90   }
  91   return group1->intersection(group2,newgroup);
  92 }
  93
  94 int PMPI_Group_difference(MPI_Group group1, MPI_Group group2, MPI_Group * newgroup)
  95 {
  96   CHECK_GROUP(1, group1)
  97   CHECK_GROUP(2, group2)
  98   CHECK_NULL(3, MPI_ERR_ARG, newgroup)
  99   return group1->difference(group2,newgroup);
 100 }
 101
 102 #define CHECK_GROUP_RANKS(group, n, ranks)                                                                             \
 103   for (int i = 0; i < (n); i++) {                                                                                      \
 104     if ((ranks)[i] < 0 || (ranks)[i] >= (group)->size())                                                               \
 105       return MPI_ERR_RANK;                                                                                             \
 106     for (int j = i + 1; j < (n); j++) {                                                                                \
 107       if ((ranks)[i] == (ranks)[j])                                                                                    \
 108         return MPI_ERR_RANK;                                                                                           \
 109     }                                                                                                                  \
 110   }                                                                                                                    \
 111   if ((n) > (group)->size()) {                                                                                         \
 112     XBT_WARN("%s, param 2 > group size", __func__);                                                                    \
 113     return MPI_ERR_ARG;                                                                                                \
 114   }
 115
 116 int PMPI_Group_incl(MPI_Group group, int n, const int *ranks, MPI_Group * newgroup)
 117 {
 118   CHECK_GROUP(1, group)
 119   CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
 120   if (n != 0)
 121     CHECK_NULL(3, MPI_ERR_ARG, ranks)
 122   CHECK_NULL(4, MPI_ERR_ARG, newgroup)
 123   CHECK_GROUP_RANKS(group, n, ranks)
 124   return group->incl(n, ranks, newgroup);
 125 }
 126
 127 int PMPI_Group_excl(MPI_Group group, int n, const int *ranks, MPI_Group * newgroup)
 128 {
 129   CHECK_GROUP(1, group)
 130   CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
 131   CHECK_NULL(3, MPI_ERR_ARG, ranks)
 132   CHECK_NULL(4, MPI_ERR_ARG, newgroup)
 133   CHECK_GROUP_RANKS(group, n, ranks)
 134   if (n == 0) {
 135     *newgroup = group;
 136     if (group != MPI_GROUP_EMPTY &&
 137         group != MPI_COMM_WORLD->group() &&
 138         ((smpi_process()->comm_self_is_set()) || (group != MPI_COMM_SELF->group())))
 139       group->ref();
 140     return MPI_SUCCESS;
 141   } else if (n == group->size()) {
 142     *newgroup = MPI_GROUP_EMPTY;
 143     return MPI_SUCCESS;
 144   } else {
 145     return group->excl(n,ranks,newgroup);
 146   }
 147 }
 148
 149 #undef CHECK_GROUP_RANKS
 150
 151 #define CHECK_GROUP_RANGES(group, n, ranges)                                                                           \
 152   for (int i = 0; i < (n); i++) {                                                                                      \
 153     if ((ranges)[i][0] < 0 || (ranges)[i][0] >= (group)->size() || (ranges)[i][1] < 0 ||                               \
 154         (ranges)[i][1] >= (group)->size()) {                                                                           \
 155       return MPI_ERR_RANK;                                                                                             \
 156     }                                                                                                                  \
 157     if (((ranges)[i][0] < (ranges)[i][1] && (ranges)[i][2] < 0) ||                                                     \
 158         ((ranges)[i][0] > (ranges)[i][1] && (ranges)[i][2] > 0)) {                                                     \
 159       return MPI_ERR_ARG;                                                                                              \
 160     }                                                                                                                  \
 161     if ((ranges)[i][2] == 0)                                                                                           \
 162       return MPI_ERR_ARG;                                                                                              \
 163   }                                                                                                                    \
 164   if ((n) > (group)->size()) {                                                                                         \
 165     XBT_WARN("%s, param 2 > group size", __func__);                                                                    \
 166     return MPI_ERR_ARG;                                                                                                \
 167   }
 168
 169 int PMPI_Group_range_incl(MPI_Group group, int n, int ranges[][3], MPI_Group * newgroup)
 170 {
 171   CHECK_GROUP(1, group)
 172   CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
 173   CHECK_NULL(3, MPI_ERR_ARG, ranges)
 174   CHECK_NULL(4, MPI_ERR_ARG, newgroup)
 175   CHECK_GROUP_RANGES(group, n, ranges)
 176   if (n == 0) {
 177     *newgroup = MPI_GROUP_EMPTY;
 178     return MPI_SUCCESS;
 179   } else {
 180     return group->range_incl(n,ranges,newgroup);
 181   }
 182 }
 183
 184 int PMPI_Group_range_excl(MPI_Group group, int n, int ranges[][3], MPI_Group * newgroup)
 185 {
 186   CHECK_GROUP(1, group)
 187   CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
 188   CHECK_NULL(3, MPI_ERR_ARG, ranges)
 189   CHECK_NULL(4, MPI_ERR_ARG, newgroup)
 190   CHECK_GROUP_RANGES(group, n, ranges)
 191   if (n == 0) {
 192     *newgroup = group;
 193     if (group != MPI_GROUP_EMPTY &&
 194         group != MPI_COMM_WORLD->group() &&
 195         ((smpi_process()->comm_self_is_set()) || (group != MPI_COMM_SELF->group())))
 196       group->ref();
 197     return MPI_SUCCESS;
 198   } else {
 199     return group->range_excl(n,ranges,newgroup);
 200   }
 201 }
 202
 203 #undef CHECK_GROUP_RANGES
 204
 205 MPI_Group PMPI_Group_f2c(MPI_Fint group){
 206   if(group==-1)
 207     return MPI_GROUP_NULL;
 208   return simgrid::smpi::Group::f2c(group);
 209 }
 210
 211 MPI_Fint PMPI_Group_c2f(MPI_Group group){
 212   if(group==MPI_GROUP_NULL)
 213     return -1;
 214   return group->c2f();
 215 }