1 /* -*- Mode: C; c-basic-offset:4 ; indent-tabs-mode:nil ; -*- */
3 * (C) 2001 by Argonne National Laboratory.
4 * See COPYRIGHT in top-level directory.
11 /* tests a series of Gets. Run on 2 processes. */
15 int main(int argc, char *argv[])
17 int rank, nprocs, i, A[SIZE], B[SIZE];
22 MTest_Init(&argc, &argv);
24 MPI_Comm_size(MPI_COMM_WORLD, &nprocs);
25 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
28 printf("Run this program with 2 or more processes\n");
29 MPI_Abort(MPI_COMM_WORLD, 1);
32 MPI_Comm_split(MPI_COMM_WORLD, (rank < 2), rank, &CommDeuce);
36 for (i = 0; i < SIZE; i++)
38 MPI_Win_create(B, SIZE * sizeof(int), sizeof(int), MPI_INFO_NULL, CommDeuce, &win);
39 MPI_Win_fence(0, win);
40 for (i = 0; i < SIZE; i++) {
42 MPI_Get(&A[i], 1, MPI_INT, 1, i, 1, MPI_INT, win);
44 MPI_Win_fence(0, win);
45 for (i = 0; i < SIZE; i++)
46 if (A[i] != 1000 + i) {
47 SQUELCH(printf("Rank 0: A[%d] is %d, should be %d\n", i, A[i], 1000 + i););
52 for (i = 0; i < SIZE; i++)
54 MPI_Win_create(A, SIZE * sizeof(int), sizeof(int), MPI_INFO_NULL, CommDeuce, &win);
55 MPI_Win_fence(0, win);
56 for (i = 0; i < SIZE; i++) {
58 MPI_Get(&B[i], 1, MPI_INT, 0, i, 1, MPI_INT, win);
60 MPI_Win_fence(0, win);
61 for (i = 0; i < SIZE; i++)
62 if (B[i] != 500 + i) {
63 SQUELCH(printf("Rank 1: B[%d] is %d, should be %d\n", i, B[i], 500 + i););
70 MPI_Comm_free(&CommDeuce);