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
|
/* -*- Mode: C; c-basic-offset:4 ; indent-tabs-mode:nil ; -*- */
/*
*
* (C) 2003 by Argonne National Laboratory.
* See COPYRIGHT in top-level directory.
*/
#include "mpi.h"
#include <stdio.h>
#include <stdlib.h>
#include "mpitest.h"
/*
static char MTEST_Descrip[] = "A simple test of Reduce with all choices of root process";
*/
int main(int argc, char *argv[])
{
int errs = 0;
int rank, size, root;
int *sendbuf, *recvbuf, i;
int minsize = 2, count;
MPI_Comm comm;
MTest_Init(&argc, &argv);
while (MTestGetIntracommGeneral(&comm, minsize, 1)) {
if (comm == MPI_COMM_NULL)
continue;
/* Determine the sender and receiver */
MPI_Comm_rank(comm, &rank);
MPI_Comm_size(comm, &size);
for (count = 1; count < 130000; count = count * 2) {
sendbuf = (int *) malloc(count * sizeof(int));
recvbuf = (int *) malloc(count * sizeof(int));
for (root = 0; root < size; root++) {
for (i = 0; i < count; i++)
sendbuf[i] = i;
for (i = 0; i < count; i++)
recvbuf[i] = -1;
MPI_Reduce(sendbuf, recvbuf, count, MPI_INT, MPI_SUM, root, comm);
if (rank == root) {
for (i = 0; i < count; i++) {
if (recvbuf[i] != i * size) {
errs++;
}
}
}
}
free(sendbuf);
free(recvbuf);
}
MTestFreeComm(&comm);
}
MTest_Finalize(errs);
return MTestReturnValue(errs);
}
|
