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 puts, gets, and accumulate on 2 processes using fence */
12 /* Same as test1.c but uses derived datatypes to receive data */
16 int main(int argc, char *argv[])
18 int rank, nprocs, A[SIZE], B[SIZE], i;
21 MPI_Datatype contig_2ints;
24 MTest_Init(&argc,&argv);
25 MPI_Comm_size(MPI_COMM_WORLD,&nprocs);
26 MPI_Comm_rank(MPI_COMM_WORLD,&rank);
29 printf("Run this program with 2 or more processes\n");
30 MPI_Abort(MPI_COMM_WORLD, 1);
33 MPI_Comm_split(MPI_COMM_WORLD, (rank < 2), rank, &CommDeuce);
38 for (i=0; i<SIZE; i++)
42 for (i=0; i<SIZE; i++) {
48 MPI_Type_contiguous(2, MPI_INT, &contig_2ints);
49 MPI_Type_commit(&contig_2ints);
51 MPI_Win_create(B, SIZE*sizeof(int), sizeof(int), MPI_INFO_NULL, CommDeuce, &win);
53 MPI_Win_fence(0, win);
56 for (i=0; i<SIZE-2; i+=2)
57 MPI_Put(A+i, 2, MPI_INT, 1, i, 1, contig_2ints, win);
60 for (i=0; i<SIZE-2; i+=2)
61 MPI_Get(A+i, 2, MPI_INT, 0, i, 1, contig_2ints, win);
63 MPI_Accumulate(A+SIZE-2, 2, MPI_INT, 0, SIZE-2, 1, contig_2ints, MPI_SUM, win);
65 MPI_Win_fence(0, win);
68 for (i=0; i<SIZE-2; i++) {
70 SQUELCH( printf("Put/Get Error: A[i]=%d, B[i]=%d\n", A[i], B[i]); );
76 if (B[SIZE-1] != SIZE - 1 - 3*(SIZE-1)) {
77 SQUELCH( printf("Accumulate Error: B[SIZE-1] is %d, should be %d\n", B[SIZE-1], SIZE - 1 - 3*(SIZE-1)); );
83 MPI_Type_free(&contig_2ints);
85 MPI_Comm_free(&CommDeuce);