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
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
/* This test attempts to create a large number of communicators, in an effort
* to exceed the number of communicators that the MPI implementation can
* provide. It checks that the implementation detects this error correctly
* handles it.
*/
/* In this version, we duplicate MPI_COMM_WORLD in a non-blocking
* fashion until we run out of context IDs. */
#include <stdio.h>
#include <stdlib.h>
#include <mpi.h>
#include "mpitest.h"
#define MAX_NCOMM 200000
static const int verbose = 0;
int main(int argc, char **argv)
{
int rank, nproc, mpi_errno;
int i, ncomm;
int errs = 1;
MPI_Comm *comm_hdls;
MPI_Request req;
MTest_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &nproc);
MPI_Comm_set_errhandler(MPI_COMM_WORLD, MPI_ERRORS_RETURN);
comm_hdls = malloc(sizeof(MPI_Comm) * MAX_NCOMM);
ncomm = 0;
for (i = 0; i < MAX_NCOMM; i++) {
/* Note: the comms we create are all dups of MPI_COMM_WORLD */
MPI_Comm_idup(MPI_COMM_WORLD, &comm_hdls[i], &req);
mpi_errno = MPI_Wait(&req, MPI_STATUSES_IGNORE);
if (mpi_errno == MPI_SUCCESS) {
ncomm++;
} else {
if (verbose)
printf("%d: Error creating comm %d\n", rank, i);
errs = 0;
break;
}
}
for (i = 0; i < ncomm; i++)
MPI_Comm_free(&comm_hdls[i]);
free(comm_hdls);
MTest_Finalize(errs);
return MTestReturnValue(errs);
}
|
