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 int PMPI_Group_incl(MPI_Group group, int n, const int *ranks, MPI_Group * newgroup)
104 CHECK_GROUP(1, group)
105 CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
106 CHECK_NULL(3, MPI_ERR_ARG, ranks)
107 CHECK_NULL(4, MPI_ERR_ARG, newgroup)
108 for(int i = 0; i < n; i++){
109 if (ranks[i] < 0 || ranks[i] >= group->size())
111 for(int j = i+1; j < n; j++){
112 if(ranks[i] == ranks[j])
116 if (n > group->size()){
117 XBT_WARN("MPI_Group_excl, param 2 > group size");
120 return group->incl(n, ranks, newgroup);
124 int PMPI_Group_excl(MPI_Group group, int n, const int *ranks, MPI_Group * newgroup)
126 CHECK_GROUP(1, group)
127 CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
128 CHECK_NULL(3, MPI_ERR_ARG, ranks)
129 CHECK_NULL(4, MPI_ERR_ARG, newgroup)
130 for(int i = 0; i < n; i++){
131 if (ranks[i] < 0 || ranks[i] >= group->size())
133 for(int j = i+1; j < n; j++){
134 if(ranks[i] == ranks[j])
138 if (n > group->size()){
139 XBT_WARN("MPI_Group_excl, param 2 > group size");
143 if (group != MPI_GROUP_EMPTY &&
144 group != MPI_COMM_WORLD->group() &&
145 ((smpi_process()->comm_self_is_set()) || (group != MPI_COMM_SELF->group())))
148 } else if (n == group->size()) {
149 *newgroup = MPI_GROUP_EMPTY;
152 return group->excl(n,ranks,newgroup);
156 int PMPI_Group_range_incl(MPI_Group group, int n, int ranges[][3], MPI_Group * newgroup)
158 CHECK_GROUP(1, group)
159 CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
160 CHECK_NULL(3, MPI_ERR_ARG, ranges)
161 CHECK_NULL(4, MPI_ERR_ARG, newgroup)
162 for(int i = 0; i < n; i++){
163 if (ranges[i][0] < 0 || ranges[i][0] >= group->size() ||
164 ranges[i][1] < 0 || ranges[i][1] >= group->size()){
167 if ((ranges[i][0] < ranges[i][1] && ranges[i][2] < 0) ||
168 (ranges[i][0] > ranges[i][1] && ranges[i][2] > 0)){
171 if (ranges[i][2] == 0)
174 if (n > group->size()){
175 XBT_WARN("MPI_Group_range_incl, param 2 > group size");
178 *newgroup = MPI_GROUP_EMPTY;
181 return group->range_incl(n,ranges,newgroup);
185 int PMPI_Group_range_excl(MPI_Group group, int n, int ranges[][3], MPI_Group * newgroup)
187 CHECK_GROUP(1, group)
188 CHECK_NEGATIVE(2, MPI_ERR_ARG, n)
189 CHECK_NULL(3, MPI_ERR_ARG, ranges)
190 CHECK_NULL(4, MPI_ERR_ARG, newgroup)
191 for(int i = 0; i < n; i++){
192 if (ranges[i][0] < 0 || ranges[i][0] >= group->size() ||
193 ranges[i][1] < 0 || ranges[i][1] >= group->size()){
196 if ((ranges[i][0] < ranges[i][1] && ranges[i][2] < 0) ||
197 (ranges[i][0] > ranges[i][1] && ranges[i][2] > 0)){
200 if (ranges[i][2] == 0)
205 if (group != MPI_GROUP_EMPTY &&
206 group != MPI_COMM_WORLD->group() &&
207 ((smpi_process()->comm_self_is_set()) || (group != MPI_COMM_SELF->group())))
211 return group->range_excl(n,ranges,newgroup);
215 MPI_Group PMPI_Group_f2c(MPI_Fint group){
217 return MPI_GROUP_NULL;
218 return simgrid::smpi::Group::f2c(group);
221 MPI_Fint PMPI_Group_c2f(MPI_Group group){
222 if(group==MPI_GROUP_NULL)