1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
// -*- c++ -*-
//
// Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
// University Research and Technology
// Corporation. All rights reserved.
// Copyright (c) 2004-2005 The University of Tennessee and The University
// of Tennessee Research Foundation. All rights
// reserved.
// Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
// University of Stuttgart. All rights reserved.
// Copyright (c) 2004-2005 The Regents of the University of California.
// All rights reserved.
// Copyright (c) 2016 Cisco Systems, Inc. All rights reserved.
// $COPYRIGHT$
//
// Additional copyrights may follow
//
// $HEADER$
//
//
// Groups, Contexts, and Communicators
//
inline int
MPI::Group::Get_size() const
{
int size;
(void)MPI_Group_size(mpi_group, &size);
return size;
}
inline int
MPI::Group::Get_rank() const
{
int myrank;
(void)MPI_Group_rank(mpi_group, &myrank);
return myrank;
}
inline void
MPI::Group::Translate_ranks (const MPI::Group& group1, int n,
const int ranks1[],
const MPI::Group& group2, int ranks2[])
{
(void)MPI_Group_translate_ranks(group1, n, const_cast<int *>(ranks1), group2, const_cast<int *>(ranks2));
}
inline int
MPI::Group::Compare(const MPI::Group& group1, const MPI::Group& group2)
{
int result;
(void)MPI_Group_compare(group1, group2, &result);
return result;
}
inline MPI::Group
MPI::Group::Union(const MPI::Group &group1, const MPI::Group &group2)
{
MPI_Group newgroup;
(void)MPI_Group_union(group1, group2, &newgroup);
return newgroup;
}
inline MPI::Group
MPI::Group::Intersect(const MPI::Group &group1, const MPI::Group &group2)
{
MPI_Group newgroup;
(void)MPI_Group_intersection( group1, group2, &newgroup);
return newgroup;
}
inline MPI::Group
MPI::Group::Difference(const MPI::Group &group1, const MPI::Group &group2)
{
MPI_Group newgroup;
(void)MPI_Group_difference(group1, group2, &newgroup);
return newgroup;
}
inline MPI::Group
MPI::Group::Incl(int n, const int ranks[]) const
{
MPI_Group newgroup;
(void)MPI_Group_incl(mpi_group, n, const_cast<int *>(ranks), &newgroup);
return newgroup;
}
inline MPI::Group
MPI::Group::Excl(int n, const int ranks[]) const
{
MPI_Group newgroup;
(void)MPI_Group_excl(mpi_group, n, const_cast<int *>(ranks), &newgroup);
return newgroup;
}
inline MPI::Group
MPI::Group::Range_incl(int n, const int ranges[][3]) const
{
MPI_Group newgroup;
(void)MPI_Group_range_incl(mpi_group, n,
#if OMPI_CXX_SUPPORTS_2D_CONST_CAST
const_cast<int(*)[3]>(ranges),
#else
(int(*)[3]) ranges,
#endif
&newgroup);
return newgroup;
}
inline MPI::Group
MPI::Group::Range_excl(int n, const int ranges[][3]) const
{
MPI_Group newgroup;
(void)MPI_Group_range_excl(mpi_group, n,
#if OMPI_CXX_SUPPORTS_2D_CONST_CAST
const_cast<int(*)[3]>(ranges),
#else
(int(*)[3]) ranges,
#endif
&newgroup);
return newgroup;
}
inline void
MPI::Group::Free()
{
(void)MPI_Group_free(&mpi_group);
}
|
