X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/a3d08dd00246eb26ced68c5b0e046096706bbe23..0c8195a8faf2acaa4704408ee6fd364a42ab482d:/teshsuite/smpi/coll-allreduce/coll-allreduce.c diff --git a/teshsuite/smpi/coll-allreduce/coll-allreduce.c b/teshsuite/smpi/coll-allreduce/coll-allreduce.c index 509aec9883..c65fa92a87 100644 --- a/teshsuite/smpi/coll-allreduce/coll-allreduce.c +++ b/teshsuite/smpi/coll-allreduce/coll-allreduce.c @@ -1,4 +1,4 @@ -/* Copyright (c) 2009-2010, 2013-2014. The SimGrid Team. +/* Copyright (c) 2009-2018. The SimGrid Team. * All rights reserved. */ /* This program is free software; you can redistribute it and/or modify it @@ -10,11 +10,6 @@ #include #include "mpi.h" -#ifndef EXIT_SUCCESS -#define EXIT_SUCCESS 0 -#define EXIT_FAILURE 1 -#endif - int main(int argc, char *argv[]) { int rank; @@ -30,8 +25,8 @@ int main(int argc, char *argv[]) MPI_Comm_size(MPI_COMM_WORLD, &size); if (maxlen > 1) mult = maxlen > size ? size : maxlen; - int* sb = (int *) xbt_malloc(size *maxlen * sizeof(int)); - int* rb = (int *) xbt_malloc(size *maxlen * sizeof(int)); + int* sb = xbt_new0(int, size * maxlen); + int* rb = xbt_new0(int, size * maxlen); for (i = 0; i < size *maxlen; ++i) { sb[i] = rank*size + i; @@ -42,7 +37,6 @@ int main(int argc, char *argv[]) for (i = 0; i < size *mult; i++) printf("%d ", sb[i]); printf("]\n"); - status = MPI_Allreduce(sb, rb, size *maxlen, MPI_INT, MPI_SUM, MPI_COMM_WORLD); printf("[%d] rcvbuf=[", rank); @@ -50,11 +44,9 @@ int main(int argc, char *argv[]) printf("%d ", rb[i]); printf("]\n"); - if (rank == 0) { - if (status != MPI_SUCCESS) { - printf("all_to_all returned %d\n", status); - fflush(stdout); - } + if (rank == 0 && status != MPI_SUCCESS) { + printf("all_to_all returned %d\n", status); + fflush(stdout); } xbt_free(sb); xbt_free(rb);