X-Git-Url: http://bilbo.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/50bc81a8526eb95a52e6a4b4a2ae1be94dfb24c1..b7de212d0e5d452c778e6a2c4f79faabb0d5da38:/teshsuite/smpi/mpich3-test/rma/acc-loc.c

diff --git a/teshsuite/smpi/mpich3-test/rma/acc-loc.c b/teshsuite/smpi/mpich3-test/rma/acc-loc.c
new file mode 100644
index 0000000000..18c3e3a947
--- /dev/null
+++ b/teshsuite/smpi/mpich3-test/rma/acc-loc.c
@@ -0,0 +1,147 @@
+/*
+ *  (C) 2006 by Argonne National Laboratory.
+ *      See COPYRIGHT in top-level directory.
+ *
+ *  Portions of this code were written by Intel Corporation.
+ *  Copyright (C) 2011-2012 Intel Corporation.  Intel provides this material
+ *  to Argonne National Laboratory subject to Software Grant and Corporate
+ *  Contributor License Agreement dated February 8, 2012.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <mpi.h>
+#include "mpitest.h"
+
+typedef struct {
+    int val;
+    int loc;
+} twoint_t;
+
+static int errors = 0;
+
+int main(int argc, char **argv) {
+    int me, nproc;
+    twoint_t *data = NULL;
+    twoint_t mine;
+    MPI_Win win;
+
+    MTest_Init(&argc, &argv);
+
+    MPI_Comm_rank(MPI_COMM_WORLD, &me);
+    MPI_Comm_size(MPI_COMM_WORLD, &nproc);
+
+    if (me == 0) {
+        MPI_Alloc_mem(sizeof(twoint_t), MPI_INFO_NULL, &data);
+    }
+
+    MPI_Win_create(data, me == 0 ? sizeof(twoint_t) : 0, 1, MPI_INFO_NULL, MPI_COMM_WORLD, &win);
+    MPI_Win_fence(MPI_MODE_NOPRECEDE, win);
+
+    /* All processes perform MAXLOC and MINLOC operations on a 2INT on rank 0.
+     * The loc is the origin process' rank, and the value is (nproc-me).  In
+     * the case of MAXLOC, rank 0 should win and in the case of MINLOC, rank
+     * nproc-1 should win.
+     */
+
+    /** Test MAXLOC **/
+
+    if (me == 0) {
+        data->val = 0;
+        data->loc = -1;
+    }
+    MPI_Win_fence(0, win);
+
+    mine.loc = me;
+    mine.val = nproc - me;
+    MPI_Accumulate(&mine, 1, MPI_2INT, 0, 0, 1, MPI_2INT, MPI_MAXLOC, win);
+    MPI_Win_fence(0, win);
+
+    if (me == 0 && (data->loc != 0 || data->val != nproc)) {
+        errors++;
+        printf("Expected: { loc = %d, val = %d }  Actual: { loc = %d, val = %d }\n",
+               0, nproc, data->loc, data->val);
+    }
+
+    /** Test MINLOC **/
+
+    if (me == 0) {
+        data->val = nproc;
+        data->loc = -1;
+    }
+    MPI_Win_fence(0, win);
+
+    mine.loc = me;
+    mine.val = nproc - me;
+    MPI_Accumulate(&mine, 1, MPI_2INT, 0, 0, 1, MPI_2INT, MPI_MINLOC, win);
+    MPI_Win_fence(0, win);
+
+    if (me == 0 && (data->loc != nproc-1 || data->val != 1)) {
+        errors++;
+        printf("Expected: { loc = %d, val = %d }  Actual: { loc = %d, val = %d }\n",
+               nproc-1, 1, data->loc, data->val);
+    }
+
+    /* All processes perform MAXLOC and MINLOC operations on a 2INT on rank 0.
+     * The loc is the origin process' rank, and the value is 1.  In both cases,
+     * rank 0 should win because the values are equal and it has the lowest
+     * loc.
+     */
+
+    /** Test MAXLOC **/
+
+    if (me == 0) {
+        data->val = 0;
+        data->loc = -1;
+    }
+    MPI_Win_fence(MPI_MODE_NOSUCCEED, win);
+
+    mine.loc = me;
+    mine.val = 1;
+
+    MPI_Win_lock(MPI_LOCK_SHARED, 0, MPI_MODE_NOCHECK, win);
+    MPI_Accumulate(&mine, 1, MPI_2INT, 0, 0, 1, MPI_2INT, MPI_MAXLOC, win);
+    MPI_Win_unlock(0, win);
+
+    MPI_Barrier(MPI_COMM_WORLD);
+
+    if (me == 0 && (data->loc != 0 || data->val != 1)) {
+        errors++;
+        printf("Expected: { loc = %d, val = %d }  Actual: { loc = %d, val = %d }\n",
+               0, 1, data->loc, data->val);
+    }
+    MPI_Win_fence(MPI_MODE_NOPRECEDE, win);
+
+    /** Test MINLOC **/
+
+    if (me == 0) {
+        data->val = nproc;
+        data->loc = -1;
+    }
+    MPI_Win_fence(MPI_MODE_NOSUCCEED, win);
+
+    mine.loc = me;
+    mine.val = 1;
+
+    MPI_Win_lock(MPI_LOCK_SHARED, 0, MPI_MODE_NOCHECK, win);
+    MPI_Accumulate(&mine, 1, MPI_2INT, 0, 0, 1, MPI_2INT, MPI_MINLOC, win);
+    MPI_Win_unlock(0, win);
+
+    MPI_Barrier(MPI_COMM_WORLD);
+
+    if (me == 0 && (data->loc != 0 || data->val != 1)) {
+        errors++;
+        printf("Expected: { loc = %d, val = %d }  Actual: { loc = %d, val = %d }\n",
+               0, 1, data->loc, data->val);
+    }
+
+    MPI_Win_free(&win);
+
+    if (me == 0) {
+        MPI_Free_mem(data);
+    }
+
+    MTest_Finalize(errors);
+    MPI_Finalize();
+    return 0;
+}