/* -*- Mode: C; c-basic-offset:4 ; indent-tabs-mode:nil ; -*- */ /* * (C) 2001 by Argonne National Laboratory. * See COPYRIGHT in top-level directory. */ #include "mpi.h" #include "stdio.h" #include "mpitest.h" #include "squelch.h" /* tests a series of Gets. Run on 2 processes. */ #define SIZE 2000 int main(int argc, char *argv[]) { int rank, nprocs, i, A[SIZE], B[SIZE]; MPI_Comm CommDeuce; MPI_Win win; int errs = 0; MTest_Init(&argc, &argv); MPI_Comm_size(MPI_COMM_WORLD, &nprocs); MPI_Comm_rank(MPI_COMM_WORLD, &rank); if (nprocs < 2) { printf("Run this program with 2 or more processes\n"); MPI_Abort(MPI_COMM_WORLD, 1); } MPI_Comm_split(MPI_COMM_WORLD, (rank < 2), rank, &CommDeuce); if (rank < 2) { if (rank == 0) { for (i = 0; i < SIZE; i++) B[i] = 500 + i; MPI_Win_create(B, SIZE * sizeof(int), sizeof(int), MPI_INFO_NULL, CommDeuce, &win); MPI_Win_fence(0, win); for (i = 0; i < SIZE; i++) { A[i] = i + 100; MPI_Get(&A[i], 1, MPI_INT, 1, i, 1, MPI_INT, win); } MPI_Win_fence(0, win); for (i = 0; i < SIZE; i++) if (A[i] != 1000 + i) { SQUELCH(printf("Rank 0: A[%d] is %d, should be %d\n", i, A[i], 1000 + i);); errs++; } } if (rank == 1) { for (i = 0; i < SIZE; i++) A[i] = 1000 + i; MPI_Win_create(A, SIZE * sizeof(int), sizeof(int), MPI_INFO_NULL, CommDeuce, &win); MPI_Win_fence(0, win); for (i = 0; i < SIZE; i++) { B[i] = i + 200; MPI_Get(&B[i], 1, MPI_INT, 0, i, 1, MPI_INT, win); } MPI_Win_fence(0, win); for (i = 0; i < SIZE; i++) if (B[i] != 500 + i) { SQUELCH(printf("Rank 1: B[%d] is %d, should be %d\n", i, B[i], 500 + i);); errs++; } } MPI_Win_free(&win); } MPI_Comm_free(&CommDeuce); MTest_Finalize(errs); MPI_Finalize(); return 0; }