1 /* -*- Mode: C; c-basic-offset:4 ; indent-tabs-mode:nil ; -*- */
4 * (C) 2012 by Argonne National Laboratory.
5 * See COPYRIGHT in top-level directory.
14 #define ELEM_PER_PROC 10000
16 const int verbose = 0;
18 int main(int argc, char **argv)
20 int i, j, rank, nproc;
21 int shm_rank, shm_nproc;
22 MPI_Info alloc_shared_info;
23 int errors = 0, all_errors = 0;
25 int *my_base, my_size;
29 MPI_Init(&argc, &argv);
31 MPI_Comm_rank(MPI_COMM_WORLD, &rank);
32 MPI_Comm_size(MPI_COMM_WORLD, &nproc);
34 MPI_Info_create(&alloc_shared_info);
35 MPI_Info_set(alloc_shared_info, "alloc_shared_noncontig", "true");
37 MPI_Comm_split_type(MPI_COMM_WORLD, MPI_COMM_TYPE_SHARED, rank, MPI_INFO_NULL, &shm_comm);
39 MPI_Comm_rank(shm_comm, &shm_rank);
40 MPI_Comm_size(shm_comm, &shm_nproc);
42 /* Allocate ELEM_PER_PROC integers on each even rank process */
43 my_size = (shm_rank % 2 == 0) ? sizeof(int) * ELEM_PER_PROC : 0;
44 MPI_Win_allocate_shared(my_size, sizeof(int), alloc_shared_info, shm_comm, &my_base, &shm_win);
46 for (i = 0; i < ELEM_PER_PROC; i++) {
47 MPI_Win_fence(MPI_MODE_NOPRECEDE, shm_win);
48 if (shm_rank % 2 == 0) {
49 MPI_Put(&i, 1, MPI_INT,
50 (shm_rank + 2 > shm_nproc) ? 0 : (shm_rank + 2) % shm_nproc,
51 i, 1, MPI_INT, shm_win);
53 MPI_Win_fence(MPI_MODE_NOSUCCEED, shm_win);
56 MPI_Barrier(shm_comm);
58 /* Read and verify everyone's data */
59 for (i = 0; i < shm_nproc; i++) {
63 MPI_Win_shared_query(shm_win, i, &size, &disp_unit, &base);
66 assert(size >= ELEM_PER_PROC * sizeof(int));
68 for (j = 0; j < ELEM_PER_PROC; j++) {
71 printf("%d -- Got %d at rank %d index %d, expected %d\n", shm_rank,
82 MPI_Win_free(&shm_win);
83 MPI_Comm_free(&shm_comm);
85 MPI_Info_free(&alloc_shared_info);
87 MPI_Reduce(&errors, &all_errors, 1, MPI_INT, MPI_SUM, 0, MPI_COMM_WORLD);
89 if (rank == 0 && all_errors == 0)
90 printf(" No Errors\n");