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
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
#include "mpi.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "mpitest.h"
#define ROOT 0
#define NUM_REPS 5
#define NUM_SIZES 4
int main(int argc, char **argv)
{
int *buf;
int i, rank, reps, n;
int bVerify = 1;
int sizes[NUM_SIZES] = { 100, 64 * 1024, 128 * 1024, 1024 * 1024 };
int errs = 0;
MTest_Init(&argc, &argv);
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
if (argc > 1) {
if (strcmp(argv[1], "-novalidate") == 0 || strcmp(argv[1], "-noverify") == 0)
bVerify = 0;
}
buf = (int *) malloc(sizes[NUM_SIZES - 1] * sizeof(int));
memset(buf, 0, sizes[NUM_SIZES - 1] * sizeof(int));
for (n = 0; n < NUM_SIZES; n++) {
#ifdef DEBUG
if (rank == ROOT) {
printf("bcasting %d MPI_INTs %d times\n", sizes[n], NUM_REPS);
fflush(stdout);
}
#endif
for (reps = 0; reps < NUM_REPS; reps++) {
if (bVerify) {
if (rank == ROOT) {
for (i = 0; i < sizes[n]; i++) {
buf[i] = 1000000 * (n * NUM_REPS + reps) + i;
}
} else {
for (i = 0; i < sizes[n]; i++) {
buf[i] = -1 - (n * NUM_REPS + reps);
}
}
}
# ifdef DEBUG
{
printf("rank=%d, n=%d, reps=%d\n", rank, n, reps);
}
#endif
MPI_Bcast(buf, sizes[n], MPI_INT, ROOT, MPI_COMM_WORLD);
if (bVerify) {
errs = 0;
for (i = 0; i < sizes[n]; i++) {
if (buf[i] != 1000000 * (n * NUM_REPS + reps) + i) {
errs++;
if (errs < 10) {
printf("Error: Rank=%d, n=%d, reps=%d, i=%d, buf[i]=%d expected=%d\n",
rank, n, reps, i, buf[i], 1000000 * (n * NUM_REPS + reps) + i);
fflush(stdout);
}
}
}
if (errs >= 10) {
printf("Error: Rank=%d, errs = %d\n", rank, errs);
fflush(stdout);
}
}
}
}
free(buf);
MTest_Finalize(errs);
return MTestReturnValue(errs);
}
|
