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.
12 /* Tests the example in Fig 6.8, pg 142, MPI-2 standard. Process 1 has
13 a blocking MPI_Recv between the Post and Wait. Therefore, this
14 example will not run if the one-sided operations are simply
15 implemented on top of MPI_Isends and Irecvs. They either need to be
16 implemented inside the progress engine or using threads with Isends
17 and Irecvs. In MPICH-2, they are implemented in the progress engine. */
19 /* same as test3.c but uses alloc_mem */
23 int main(int argc, char *argv[])
25 int rank, destrank, nprocs, *A, *B, i;
27 MPI_Group comm_group, group;
31 MTest_Init(&argc, &argv);
32 MPI_Comm_size(MPI_COMM_WORLD, &nprocs);
33 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
36 printf("Run this program with 2 or more processes\n");
37 MPI_Abort(MPI_COMM_WORLD, 1);
40 MPI_Comm_split(MPI_COMM_WORLD, (rank < 2), rank, &CommDeuce);
43 i = MPI_Alloc_mem(SIZE * sizeof(int), MPI_INFO_NULL, &A);
45 printf("Can't allocate memory in test program\n");
46 MPI_Abort(MPI_COMM_WORLD, 1);
49 MPI_Comm_group(CommDeuce, &comm_group);
52 i = MPI_Alloc_mem(SIZE * sizeof(int), MPI_INFO_NULL, &B);
54 printf("Can't allocate memory in test program\n");
55 MPI_Abort(MPI_COMM_WORLD, 1);
58 for (i = 0; i < SIZE; i++) {
62 #ifdef USE_WIN_ALLOCATE
64 MPI_Win_allocate(0, 1, MPI_INFO_NULL, CommDeuce, &base_ptr, &win);
66 MPI_Win_create(NULL, 0, 1, MPI_INFO_NULL, CommDeuce, &win);
69 MPI_Group_incl(comm_group, 1, &destrank, &group);
70 MPI_Win_start(group, 0, win);
71 MPI_Put(A, SIZE, MPI_INT, 1, 0, SIZE, MPI_INT, win);
72 MPI_Win_complete(win);
73 MPI_Send(B, SIZE, MPI_INT, 1, 100, MPI_COMM_WORLD);
78 #ifdef USE_WIN_ALLOCATE
79 MPI_Win_allocate(SIZE * sizeof(int), sizeof(int), MPI_INFO_NULL, CommDeuce, &B, &win);
81 i = MPI_Alloc_mem(SIZE * sizeof(int), MPI_INFO_NULL, &B);
83 printf("Can't allocate memory in test program\n");
84 MPI_Abort(MPI_COMM_WORLD, 1);
86 MPI_Win_create(B, SIZE * sizeof(int), sizeof(int), MPI_INFO_NULL, CommDeuce, &win);
88 MPI_Win_lock(MPI_LOCK_SHARED, rank, 0, win);
89 for (i = 0; i < SIZE; i++)
90 A[i] = B[i] = (-4) * i;
91 MPI_Win_unlock(rank, win);
94 MPI_Group_incl(comm_group, 1, &destrank, &group);
95 MPI_Win_post(group, 0, win);
96 MPI_Recv(A, SIZE, MPI_INT, 0, 100, MPI_COMM_WORLD, MPI_STATUS_IGNORE);
99 for (i = 0; i < SIZE; i++) {
101 SQUELCH(printf("Rank 1: Put Error: B[i] is %d, should be %d\n", B[i], i););
104 if (A[i] != SIZE + i) {
106 ("Rank 1: Send/Recv Error: A[i] is %d, should be %d\n", A[i],
112 #ifndef USE_WIN_ALLOCATE
117 MPI_Group_free(&group);
118 MPI_Group_free(&comm_group);
122 MPI_Comm_free(&CommDeuce);
123 MTest_Finalize(errs);