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
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>
#include "mpitest.h"
/* Test that comm_split fails gracefully when the number of communicators
is exhausted. Original version submitted by Paul Sack.
*/
#define MAX_COMMS 2000
/* Define VERBOSE to get an output line for every communicator */
/* #define VERBOSE 1 */
int main(int argc, char *argv[])
{
int i, rank;
int rc, maxcomm;
int errs = 0;
MPI_Comm comm[MAX_COMMS];
MTest_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_set_errhandler(MPI_COMM_WORLD, MPI_ERRORS_RETURN);
maxcomm = -1;
for (i = 0; i < MAX_COMMS; i++) {
#ifdef VERBOSE
if (rank == 0) {
if (i % 20 == 0) {
fprintf(stderr, "\n %d: ", i);
fflush(stdout);
} else {
fprintf(stderr, ".");
fflush(stdout);
}
}
#endif
rc = MPI_Comm_split(MPI_COMM_WORLD, 1, rank, &comm[i]);
if (rc != MPI_SUCCESS) {
break;
}
maxcomm = i;
}
for (i = 0; i <= maxcomm; i++) {
MPI_Comm_free(&comm[i]);
}
/* If we complete, there are no errors */
MTest_Finalize(errs);
return MTestReturnValue(errs);
}
|
