1 /* Copyright (c) 2010-2020. 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. */
7 #ifndef SMPI_GROUP_HPP_INCLUDED
8 #define SMPI_GROUP_HPP_INCLUDED
10 #include "smpi_f2c.hpp"
11 #include <smpi/smpi.h>
18 class Group : public F2C{
20 /* This is actually a map from int to int. We could use std::map here, but looking up a value there costs O(log(n)).
21 * For a vector, this costs O(1). We hence go with the vector.
23 std::vector<s4u::Actor*> rank_to_actor_map_;
24 std::map<s4u::Actor*, int> actor_to_rank_map_;
25 std::vector<int> index_to_rank_map_;
27 int refcount_ = 1; /* refcount_: start > 0 so that this group never gets freed */
31 explicit Group(int size) : size_(size), rank_to_actor_map_(size, nullptr), index_to_rank_map_(size, MPI_UNDEFINED) {}
32 explicit Group(const Group* origin);
34 void set_mapping(s4u::Actor* actor, int rank);
36 s4u::Actor* actor(int rank);
37 int rank(s4u::Actor* process);
39 static void unref(MPI_Group group);
40 int size() const { return size_; }
41 int compare(MPI_Group group2);
42 int incl(int n, const int* ranks, MPI_Group* newgroup);
43 int excl(int n, const int* ranks, MPI_Group* newgroup);
44 int group_union(MPI_Group group2, MPI_Group* newgroup);
45 int intersection(MPI_Group group2, MPI_Group* newgroup);
46 int difference(MPI_Group group2, MPI_Group* newgroup);
47 int range_incl(int n, int ranges[][3], MPI_Group* newgroup);
48 int range_excl(int n, int ranges[][3], MPI_Group* newgroup);
50 static Group* f2c(int id);