Reduce the size of partial shared malloc tests.

[simgrid.git] / teshsuite / smpi / mpich3-test / rma / test5_am.c

diff --git a/teshsuite/smpi/mpich3-test/rma/test5_am.c b/teshsuite/smpi/mpich3-test/rma/test5_am.c
index f0482d3..9e963f0 100644 (file)
--- a/teshsuite/smpi/mpich3-test/rma/test5_am.c
+++ b/teshsuite/smpi/mpich3-test/rma/test5_am.c
@@ -3,7 +3,7 @@
  *  (C) 2001 by Argonne National Laboratory.
  *      See COPYRIGHT in top-level directory.
  */
-#include "mpi.h" 
+#include "mpi.h"
 #include "stdio.h"
 #include "mpitest.h"
 #include "squelch.h"
@@ -14,17 +14,17 @@
 
 #define SIZE 2000
 
-int main(int argc, char *argv[]) 
-{ 
+int main(int argc, char *argv[])
+{
     int rank, nprocs, i, *A, *B;
     MPI_Comm CommDeuce;
     MPI_Win win;
     int errs = 0;
 
-    MTest_Init(&argc,&argv); 
+    MTest_Init(&argc, &argv);
 
-    MPI_Comm_size(MPI_COMM_WORLD,&nprocs); 
-    MPI_Comm_rank(MPI_COMM_WORLD, &rank); 
+    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");
@@ -46,34 +46,34 @@ int main(int argc, char *argv[])
         }
 
         if (rank == 0) {
-            for (i=0; i<SIZE; i++)
+            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_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;
+            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++)
+            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); );
+                    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++)
+            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_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;
+            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++)
+            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); );
+                    SQUELCH(printf("Rank 1: B[%d] is %d, should be %d\n", i, B[i], 500 + i););
                     errs++;
                 }
         }
@@ -87,6 +87,6 @@ int main(int argc, char *argv[])
 
     MPI_Comm_free(&CommDeuce);
     MTest_Finalize(errs);
-    MPI_Finalize(); 
-    return 0; 
-} 
+    MPI_Finalize();
+    return 0;
+}