X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/98aaf6c28dde5365ca65b9b18182042f45867e70..996be9435416557e2c1b20cbf462848b475d168d:/teshsuite/smpi/coll-reduce/coll-reduce.c diff --git a/teshsuite/smpi/coll-reduce/coll-reduce.c b/teshsuite/smpi/coll-reduce/coll-reduce.c index 9b63466624..3cc84b882f 100644 --- a/teshsuite/smpi/coll-reduce/coll-reduce.c +++ b/teshsuite/smpi/coll-reduce/coll-reduce.c @@ -1,4 +1,4 @@ -/* Copyright (c) 2009-2010, 2013-2014. The SimGrid Team. +/* Copyright (c) 2009-2010, 2013-2018. The SimGrid Team. * All rights reserved. */ /* This program is free software; you can redistribute it and/or modify it @@ -10,25 +10,19 @@ #include #include "mpi.h" -#ifndef EXIT_SUCCESS -#define EXIT_SUCCESS 0 -#define EXIT_FAILURE 1 -#endif - int main(int argc, char *argv[]) { - int rank, size; + int rank; + int size; int i; - int *sb; - int *rb; int status; MPI_Init(&argc, &argv); MPI_Comm_rank(MPI_COMM_WORLD, &rank); MPI_Comm_size(MPI_COMM_WORLD, &size); - sb = (int *) xbt_malloc(size * sizeof(int)); - rb = (int *) xbt_malloc(size * sizeof(int)); + unsigned long long* sb = (unsigned long long *) xbt_malloc(size * sizeof(unsigned long long)); + unsigned long long* rb = (unsigned long long *) xbt_malloc(size * sizeof(unsigned long long)); for (i = 0; i < size; ++i) { sb[i] = rank*size + i; @@ -36,17 +30,17 @@ int main(int argc, char *argv[]) } printf("[%d] sndbuf=[", rank); for (i = 0; i < size; i++) - printf("%d ", sb[i]); + printf("%llu ", sb[i]); printf("]\n"); int root=0; - status = MPI_Reduce(sb, rb, size, MPI_INT, MPI_SUM, root, MPI_COMM_WORLD); + status = MPI_Reduce(sb, rb, size, MPI_UNSIGNED_LONG_LONG, MPI_SUM, root, MPI_COMM_WORLD); MPI_Barrier(MPI_COMM_WORLD); if (rank == root) { printf("[%d] rcvbuf=[", rank); for (i = 0; i < size; i++) - printf("%d ", rb[i]); + printf("%llu ", rb[i]); printf("]\n"); if (status != MPI_SUCCESS) { printf("all_to_all returned %d\n", status); @@ -56,17 +50,17 @@ int main(int argc, char *argv[]) printf("[%d] second sndbuf=[", rank); for (i = 0; i < 1; i++) - printf("%d ", sb[i]); + printf("%llu ", sb[i]); printf("]\n"); root=size-1; - status = MPI_Reduce(sb, rb, 1, MPI_INT, MPI_PROD, root, MPI_COMM_WORLD); + status = MPI_Reduce(sb, rb, 1, MPI_UNSIGNED_LONG_LONG, MPI_PROD, root, MPI_COMM_WORLD); MPI_Barrier(MPI_COMM_WORLD); if (rank == root) { printf("[%d] rcvbuf=[", rank); for (i = 0; i < 1; i++) - printf("%d ", rb[i]); + printf("%llu ", rb[i]); printf("]\n"); if (status != MPI_SUCCESS) { printf("all_to_all returned %d\n", status);