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)");
11 typedef struct s_smpi_mpi_group {
13 int *rank_to_index_map;
14 xbt_dict_t index_to_rank_map;
18 static s_smpi_mpi_group_t mpi_MPI_GROUP_EMPTY = {
20 NULL, /* rank_to_index_map */
21 NULL, /* index_to_rank_map */
22 1, /* refcount: start > 0 so that this group never gets freed */
25 MPI_Group MPI_GROUP_EMPTY = &mpi_MPI_GROUP_EMPTY;
27 MPI_Group smpi_group_new(int size)
32 group = xbt_new(s_smpi_mpi_group_t, 1);
34 group->rank_to_index_map = xbt_new(int, size);
35 group->index_to_rank_map = xbt_dict_new_homogeneous(xbt_free_f);
37 for (i = 0; i < size; i++) {
38 group->rank_to_index_map[i] = MPI_UNDEFINED;
44 MPI_Group smpi_group_copy(MPI_Group origin)
46 MPI_Group group=origin;
49 xbt_dict_cursor_t cursor = NULL;
52 if(origin != MPI_GROUP_NULL
53 && origin != MPI_GROUP_EMPTY)
55 group = xbt_new(s_smpi_mpi_group_t, 1);
56 group->size = origin->size;
57 group->rank_to_index_map = xbt_new(int, group->size);
58 group->index_to_rank_map = xbt_dict_new_homogeneous(xbt_free_f);
60 for (i = 0; i < group->size; i++) {
61 group->rank_to_index_map[i] = origin->rank_to_index_map[i];
64 xbt_dict_foreach(origin->index_to_rank_map, cursor, key, ptr_rank) {
65 int * cp = (int*)xbt_malloc(sizeof(int));
67 xbt_dict_set(group->index_to_rank_map, key, cp, NULL);
74 void smpi_group_destroy(MPI_Group group)
76 if(group!= smpi_comm_group(MPI_COMM_WORLD)
77 && group != MPI_GROUP_NULL
78 && group != MPI_GROUP_EMPTY)
79 smpi_group_unuse(group);
82 void smpi_group_set_mapping(MPI_Group group, int index, int rank)
86 if (rank < group->size) {
87 group->rank_to_index_map[rank] = index;
88 if (index!=MPI_UNDEFINED ) {
89 val_rank = (int *) malloc(sizeof(int));
92 char * key = bprintf("%d", index);
93 xbt_dict_set(group->index_to_rank_map, key, val_rank, NULL);
99 int smpi_group_index(MPI_Group group, int rank)
101 int index = MPI_UNDEFINED;
103 if (0 <= rank && rank < group->size) {
104 index = group->rank_to_index_map[rank];
109 int smpi_group_rank(MPI_Group group, int index)
111 int * ptr_rank = NULL;
112 char * key = bprintf("%d", index);
113 ptr_rank = static_cast<int*>(xbt_dict_get_or_null(group->index_to_rank_map, key));
117 return MPI_UNDEFINED;
121 int smpi_group_use(MPI_Group group)
124 return group->refcount;
127 int smpi_group_unuse(MPI_Group group)
130 if (group->refcount <= 0) {
131 xbt_free(group->rank_to_index_map);
132 xbt_dict_free(&group->index_to_rank_map);
136 return group->refcount;
139 int smpi_group_size(MPI_Group group)
144 int smpi_group_compare(MPI_Group group1, MPI_Group group2)
147 int i, index, rank, size;
150 if (smpi_group_size(group1) != smpi_group_size(group2)) {
151 result = MPI_UNEQUAL;
153 size = smpi_group_size(group2);
154 for (i = 0; i < size; i++) {
155 index = smpi_group_index(group1, i);
156 rank = smpi_group_rank(group2, index);
157 if (rank == MPI_UNDEFINED) {
158 result = MPI_UNEQUAL;
162 result = MPI_SIMILAR;
169 int smpi_group_incl(MPI_Group group, int n, int* ranks, MPI_Group* newgroup)
173 *newgroup = MPI_GROUP_EMPTY;
174 } else if (n == smpi_group_size(group)) {
176 if(group!= smpi_comm_group(MPI_COMM_WORLD)
177 && group != MPI_GROUP_NULL
178 && group != smpi_comm_group(MPI_COMM_SELF)
179 && group != MPI_GROUP_EMPTY)
180 smpi_group_use(group);
182 *newgroup = smpi_group_new(n);
183 for (i = 0; i < n; i++) {
184 index = smpi_group_index(group, ranks[i]);
185 smpi_group_set_mapping(*newgroup, index, i);