1 /* Copyright (c) 2010, 2013-2015. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
9 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(smpi_group, smpi, "Logging specific to SMPI (group)");
10 simgrid::SMPI::Group mpi_MPI_GROUP_EMPTY;
11 MPI_Group MPI_GROUP_EMPTY=&mpi_MPI_GROUP_EMPTY;
19 m_rank_to_index_map=nullptr; /* m_rank_to_index_map */
20 m_index_to_rank_map=nullptr; /* m_index_to_rank_map */
21 m_refcount=1; /* m_refcount: start > 0 so that this group never gets freed */
29 m_rank_to_index_map = xbt_new(int, m_size);
30 m_index_to_rank_map = xbt_dict_new_homogeneous(xbt_free_f);
32 for (i = 0; i < m_size; i++) {
33 m_rank_to_index_map[i] = MPI_UNDEFINED;
37 Group::Group(MPI_Group origin)
41 xbt_dict_cursor_t cursor = nullptr;
44 if(origin != MPI_GROUP_NULL
45 && origin != MPI_GROUP_EMPTY)
47 m_size = origin->size();
48 m_rank_to_index_map = xbt_new(int, m_size);
49 m_index_to_rank_map = xbt_dict_new_homogeneous(xbt_free_f);
51 for (i = 0; i < m_size; i++) {
52 m_rank_to_index_map[i] = origin->m_rank_to_index_map[i];
55 xbt_dict_foreach(origin->m_index_to_rank_map, cursor, key, ptr_rank) {
56 int * cp = static_cast<int*>(xbt_malloc(sizeof(int)));
57 *cp=*reinterpret_cast<int*>(ptr_rank);
58 xbt_dict_set(m_index_to_rank_map, key, cp, nullptr);
65 xbt_free(m_rank_to_index_map);
66 xbt_dict_free(&m_index_to_rank_map);
71 if(this != MPI_COMM_WORLD->group()
72 && this != MPI_GROUP_EMPTY)
76 void Group::set_mapping(int index, int rank)
81 m_rank_to_index_map[rank] = index;
82 if (index!=MPI_UNDEFINED ) {
83 val_rank = static_cast<int *>(xbt_malloc(sizeof(int)));
86 char * key = bprintf("%d", index);
87 xbt_dict_set(m_index_to_rank_map, key, val_rank, nullptr);
93 int Group::index(int rank)
95 int index = MPI_UNDEFINED;
97 if (0 <= rank && rank < m_size) {
98 index = m_rank_to_index_map[rank];
103 int Group::rank(int index)
105 int * ptr_rank = nullptr;
106 if (this==MPI_GROUP_EMPTY)
107 return MPI_UNDEFINED;
108 char * key = bprintf("%d", index);
109 ptr_rank = static_cast<int*>(xbt_dict_get_or_null(m_index_to_rank_map, key));
112 if (ptr_rank==nullptr)
113 return MPI_UNDEFINED;
126 if (m_refcount <= 0) {
138 int Group::compare(MPI_Group group2)
141 int i, index, rank, sz;
144 if (m_size != group2->size()) {
145 result = MPI_UNEQUAL;
148 for (i = 0; i < sz; i++) {
149 index = this->index(i);
150 rank = group2->rank(index);
151 if (rank == MPI_UNDEFINED) {
152 result = MPI_UNEQUAL;
156 result = MPI_SIMILAR;
163 int Group::incl(int n, int* ranks, MPI_Group* newgroup)
167 *newgroup = MPI_GROUP_EMPTY;
168 } else if (n == m_size) {
170 if(this!= MPI_COMM_WORLD->group()
171 && this != MPI_COMM_SELF->group()
172 && this != MPI_GROUP_EMPTY)
175 *newgroup = new Group(n);
176 for (i = 0; i < n; i++) {
177 index = this->index(ranks[i]);
178 (*newgroup)->set_mapping(index, i);
184 int Group::group_union(MPI_Group group2, MPI_Group* newgroup)
187 int size2 = group2->size();
188 for (int i = 0; i < size2; i++) {
189 int proc2 = group2->index(i);
190 int proc1 = this->rank(proc2);
191 if (proc1 == MPI_UNDEFINED) {
196 *newgroup = MPI_GROUP_EMPTY;
198 *newgroup = new simgrid::SMPI::Group(size1);
199 size2 = this->size();
200 for (int i = 0; i < size2; i++) {
201 int proc1 = this->index(i);
202 (*newgroup)->set_mapping(proc1, i);
204 for (int i = size2; i < size1; i++) {
205 int proc2 = group2->index(i - size2);
206 (*newgroup)->set_mapping(proc2, i);
212 int Group::intersection(MPI_Group group2, MPI_Group* newgroup)
214 int size2 = group2->size();
215 for (int i = 0; i < size2; i++) {
216 int proc2 = group2->index(i);
217 int proc1 = this->rank(proc2);
218 if (proc1 == MPI_UNDEFINED) {
223 *newgroup = MPI_GROUP_EMPTY;
225 *newgroup = new simgrid::SMPI::Group(size2);
227 for (int i = 0; i < group2->size(); i++) {
228 int proc2 = group2->index(i);
229 int proc1 = this->rank(proc2);
230 if (proc1 != MPI_UNDEFINED) {
231 (*newgroup)->set_mapping(proc2, j);
239 int Group::difference(MPI_Group group2, MPI_Group* newgroup)
241 int newsize = m_size;
243 for (int i = 0; i < size2; i++) {
244 int proc1 = this->index(i);
245 int proc2 = group2->rank(proc1);
246 if (proc2 != MPI_UNDEFINED) {
251 *newgroup = MPI_GROUP_EMPTY;
253 *newgroup = new simgrid::SMPI::Group(newsize);
254 for (int i = 0; i < size2; i++) {
255 int proc1 = this->index(i);
256 int proc2 = group2->rank(proc1);
257 if (proc2 == MPI_UNDEFINED) {
258 (*newgroup)->set_mapping(proc1, i);
265 int Group::excl(int n, int *ranks, MPI_Group * newgroup){
266 int oldsize = m_size;
267 int newsize = oldsize - n;
268 *newgroup = new simgrid::SMPI::Group(newsize);
269 int* to_exclude=xbt_new0(int, m_size);
270 for (int i = 0; i < oldsize; i++)
272 for (int i = 0; i < n; i++)
273 to_exclude[ranks[i]]=1;
275 for (int i = 0; i < oldsize; i++) {
276 if(to_exclude[i]==0){
277 int index = this->index(i);
278 (*newgroup)->set_mapping(index, j);
282 xbt_free(to_exclude);
287 int Group::range_incl(int n, int ranges[][3], MPI_Group * newgroup){
289 for (int i = 0; i < n; i++) {
290 for (int rank = ranges[i][0]; /* First */
291 rank >= 0 && rank < m_size; /* Last */
294 if(rank == ranges[i][1]){/*already last ?*/
297 rank += ranges[i][2]; /* Stride */
298 if (ranges[i][0] < ranges[i][1]) {
299 if (rank > ranges[i][1])
302 if (rank < ranges[i][1])
307 *newgroup = new simgrid::SMPI::Group(newsize);
309 for (int i = 0; i < n; i++) {
310 for (int rank = ranges[i][0]; /* First */
311 rank >= 0 && rank < m_size; /* Last */
313 int index = this->index(rank);
314 (*newgroup)->set_mapping(index, j);
316 if(rank == ranges[i][1]){/*already last ?*/
319 rank += ranges[i][2]; /* Stride */
320 if (ranges[i][0] < ranges[i][1]) {
321 if (rank > ranges[i][1])
324 if (rank < ranges[i][1])
332 int Group::range_excl(int n, int ranges[][3], MPI_Group * newgroup){
333 int newsize = m_size;
334 for (int i = 0; i < n; i++) {
335 for (int rank = ranges[i][0]; /* First */
336 rank >= 0 && rank < m_size; /* Last */
339 if(rank == ranges[i][1]){/*already last ?*/
342 rank += ranges[i][2]; /* Stride */
343 if (ranges[i][0] < ranges[i][1]) {
344 if (rank > ranges[i][1])
347 if (rank < ranges[i][1])
353 *newgroup = MPI_GROUP_EMPTY;
355 *newgroup = new simgrid::SMPI::Group(newsize);
358 while (newrank < newsize) {
360 for (int i = 0; i < n; i++) {
361 for (int rank = ranges[i][0]; rank >= 0 && rank < m_size;) {
366 if(rank == ranges[i][1]){/*already last ?*/
369 rank += ranges[i][2]; /* Stride */
370 if (ranges[i][0]<ranges[i][1]){
371 if (rank > ranges[i][1])
374 if (rank < ranges[i][1])
380 int index = this->index(oldrank);
381 (*newgroup)->set_mapping(index, newrank);