1 /* Copyright (c) 2007-2021. The SimGrid Team. All rights reserved. */
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. */
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"
13 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(smpi_pmpi);
15 /* PMPI User level calls */
17 int PMPI_Group_free(MPI_Group * group)
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);
25 *group = MPI_GROUP_NULL;
29 int PMPI_Group_size(MPI_Group group, int *size)
32 CHECK_NULL(2, MPI_ERR_ARG, size)
33 *size = group->size();
37 int PMPI_Group_rank(MPI_Group group, int *rank)
40 CHECK_NULL(2, MPI_ERR_ARG, rank)
41 *rank = group->rank(simgrid::s4u::this_actor::get_pid());
45 int PMPI_Group_translate_ranks(MPI_Group group1, int n, const int *ranks1, MPI_Group group2, int *ranks2)
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()))
55 if(ranks1[i]==MPI_PROC_NULL){
56 ranks2[i]=MPI_PROC_NULL;
58 aid_t actor = group1->actor(ranks1[i]);
59 ranks2[i] = group2->rank(actor);
65 int PMPI_Group_compare(MPI_Group group1, MPI_Group group2, int *result)
67 CHECK_GROUP(1, group1)
68 CHECK_GROUP(2, group2)
69 CHECK_NULL(3, MPI_ERR_ARG, result)
70 *result = group1->compare(group2);
74 int PMPI_Group_union(MPI_Group group1, MPI_Group group2, MPI_Group * newgroup)
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);
82 int PMPI_Group_intersection(MPI_Group group1, MPI_Group group2, MPI_Group * newgroup)
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;
91 return group1->intersection(group2,newgroup);
94 int PMPI_Group_difference(MPI_Group group1, MPI_Group group2, MPI_Group * newgroup)
96 CHECK_GROUP(1, group1)
97 CHECK_GROUP(2, group2)
98 CHECK_NULL(3, MPI_ERR_ARG, newgroup)
99 return group1->difference(group2,newgroup);
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; \
111 if ((n) > (group)->size()) { \
112 XBT_WARN("%s, param 2 > group size", __func__); \
113 return MPI_ERR_ARG; \
116 int PMPI_Group_incl(MPI_Group group, int n, const int *ranks, MPI_Group * newgroup)
118 CHECK_GROUP(1, group)
119 CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
120 CHECK_NULL(3, MPI_ERR_ARG, ranks)
121 CHECK_NULL(4, MPI_ERR_ARG, newgroup)
122 CHECK_GROUP_RANKS(group, n, ranks)
123 return group->incl(n, ranks, newgroup);
126 int PMPI_Group_excl(MPI_Group group, int n, const int *ranks, MPI_Group * newgroup)
128 CHECK_GROUP(1, group)
129 CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
130 CHECK_NULL(3, MPI_ERR_ARG, ranks)
131 CHECK_NULL(4, MPI_ERR_ARG, newgroup)
132 CHECK_GROUP_RANKS(group, n, ranks)
135 if (group != MPI_GROUP_EMPTY &&
136 group != MPI_COMM_WORLD->group() &&
137 ((smpi_process()->comm_self_is_set()) || (group != MPI_COMM_SELF->group())))
140 } else if (n == group->size()) {
141 *newgroup = MPI_GROUP_EMPTY;
144 return group->excl(n,ranks,newgroup);
148 #undef CHECK_GROUP_RANKS
150 #define CHECK_GROUP_RANGES(group, n, ranges) \
151 for (int i = 0; i < (n); i++) { \
152 if ((ranges)[i][0] < 0 || (ranges)[i][0] >= (group)->size() || (ranges)[i][1] < 0 || \
153 (ranges)[i][1] >= (group)->size()) { \
154 return MPI_ERR_RANK; \
156 if (((ranges)[i][0] < (ranges)[i][1] && (ranges)[i][2] < 0) || \
157 ((ranges)[i][0] > (ranges)[i][1] && (ranges)[i][2] > 0)) { \
158 return MPI_ERR_ARG; \
160 if ((ranges)[i][2] == 0) \
161 return MPI_ERR_ARG; \
163 if ((n) > (group)->size()) { \
164 XBT_WARN("%s, param 2 > group size", __func__); \
165 return MPI_ERR_ARG; \
168 int PMPI_Group_range_incl(MPI_Group group, int n, int ranges[][3], MPI_Group * newgroup)
170 CHECK_GROUP(1, group)
171 CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
172 CHECK_NULL(3, MPI_ERR_ARG, ranges)
173 CHECK_NULL(4, MPI_ERR_ARG, newgroup)
174 CHECK_GROUP_RANGES(group, n, ranges)
176 *newgroup = MPI_GROUP_EMPTY;
179 return group->range_incl(n,ranges,newgroup);
183 int PMPI_Group_range_excl(MPI_Group group, int n, int ranges[][3], MPI_Group * newgroup)
185 CHECK_GROUP(1, group)
186 CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
187 CHECK_NULL(3, MPI_ERR_ARG, ranges)
188 CHECK_NULL(4, MPI_ERR_ARG, newgroup)
189 CHECK_GROUP_RANGES(group, n, ranges)
192 if (group != MPI_GROUP_EMPTY &&
193 group != MPI_COMM_WORLD->group() &&
194 ((smpi_process()->comm_self_is_set()) || (group != MPI_COMM_SELF->group())))
198 return group->range_excl(n,ranges,newgroup);
202 #undef CHECK_GROUP_RANGES
204 MPI_Group PMPI_Group_f2c(MPI_Fint group){
206 return MPI_GROUP_NULL;
207 return simgrid::smpi::Group::f2c(group);
210 MPI_Fint PMPI_Group_c2f(MPI_Group group){
211 if(group==MPI_GROUP_NULL)