1 /* Copyright (c) 2007-2017. 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_comm.hpp"
8 #include "smpi_coll.hpp"
9 #include "smpi_datatype_derived.hpp"
10 #include "smpi_op.hpp"
11 #include "smpi_process.hpp"
13 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(smpi_pmpi);
16 /* PMPI User level calls */
17 extern "C" { // Obviously, the C MPI interface should use the C linkage
19 int PMPI_Group_free(MPI_Group * group)
21 if (group == nullptr) {
24 if(*group != MPI_COMM_WORLD->group() && *group != MPI_GROUP_EMPTY)
25 simgrid::smpi::Group::unref(*group);
26 *group = MPI_GROUP_NULL;
31 int PMPI_Group_size(MPI_Group group, int *size)
33 if (group == MPI_GROUP_NULL) {
35 } else if (size == nullptr) {
38 *size = group->size();
43 int PMPI_Group_rank(MPI_Group group, int *rank)
45 if (group == MPI_GROUP_NULL) {
47 } else if (rank == nullptr) {
50 *rank = group->rank(smpi_process()->index());
55 int PMPI_Group_translate_ranks(MPI_Group group1, int n, int *ranks1, MPI_Group group2, int *ranks2)
57 if (group1 == MPI_GROUP_NULL || group2 == MPI_GROUP_NULL) {
60 for (int i = 0; i < n; i++) {
61 if(ranks1[i]==MPI_PROC_NULL){
62 ranks2[i]=MPI_PROC_NULL;
64 int index = group1->index(ranks1[i]);
65 ranks2[i] = group2->rank(index);
72 int PMPI_Group_compare(MPI_Group group1, MPI_Group group2, int *result)
74 if (group1 == MPI_GROUP_NULL || group2 == MPI_GROUP_NULL) {
76 } else if (result == nullptr) {
79 *result = group1->compare(group2);
84 int PMPI_Group_union(MPI_Group group1, MPI_Group group2, MPI_Group * newgroup)
87 if (group1 == MPI_GROUP_NULL || group2 == MPI_GROUP_NULL) {
89 } else if (newgroup == nullptr) {
92 return group1->group_union(group2, newgroup);
96 int PMPI_Group_intersection(MPI_Group group1, MPI_Group group2, MPI_Group * newgroup)
99 if (group1 == MPI_GROUP_NULL || group2 == MPI_GROUP_NULL) {
100 return MPI_ERR_GROUP;
101 } else if (newgroup == nullptr) {
104 return group1->intersection(group2,newgroup);
108 int PMPI_Group_difference(MPI_Group group1, MPI_Group group2, MPI_Group * newgroup)
110 if (group1 == MPI_GROUP_NULL || group2 == MPI_GROUP_NULL) {
111 return MPI_ERR_GROUP;
112 } else if (newgroup == nullptr) {
115 return group1->difference(group2,newgroup);
119 int PMPI_Group_incl(MPI_Group group, int n, int *ranks, MPI_Group * newgroup)
121 if (group == MPI_GROUP_NULL) {
122 return MPI_ERR_GROUP;
123 } else if (newgroup == nullptr) {
126 return group->incl(n, ranks, newgroup);
130 int PMPI_Group_excl(MPI_Group group, int n, int *ranks, MPI_Group * newgroup)
132 if (group == MPI_GROUP_NULL) {
133 return MPI_ERR_GROUP;
134 } else if (newgroup == nullptr) {
139 if (group != MPI_COMM_WORLD->group()
140 && group != MPI_COMM_SELF->group() && group != MPI_GROUP_EMPTY)
143 } else if (n == group->size()) {
144 *newgroup = MPI_GROUP_EMPTY;
147 return group->excl(n,ranks,newgroup);
152 int PMPI_Group_range_incl(MPI_Group group, int n, int ranges[][3], MPI_Group * newgroup)
154 if (group == MPI_GROUP_NULL) {
155 return MPI_ERR_GROUP;
156 } else if (newgroup == nullptr) {
160 *newgroup = MPI_GROUP_EMPTY;
163 return group->range_incl(n,ranges,newgroup);
168 int PMPI_Group_range_excl(MPI_Group group, int n, int ranges[][3], MPI_Group * newgroup)
170 if (group == MPI_GROUP_NULL) {
171 return MPI_ERR_GROUP;
172 } else if (newgroup == nullptr) {
177 if (group != MPI_COMM_WORLD->group() && group != MPI_COMM_SELF->group() &&
178 group != MPI_GROUP_EMPTY)
182 return group->range_excl(n,ranges,newgroup);
187 MPI_Group PMPI_Group_f2c(MPI_Fint group){
188 return simgrid::smpi::Group::f2c(group);
191 MPI_Fint PMPI_Group_c2f(MPI_Group group){