-/* Copyright (c) 2009-2021. The SimGrid Team.
+/* Copyright (c) 2009-2022. The SimGrid Team.
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
{
int rank;
int size;
- int i;
- int status;
- int mult=1;
MPI_Init(&argc, &argv);
int maxlen = argc >= 2 ? atoi(argv[1]) : 1;
MPI_Comm_size(MPI_COMM_WORLD, &size);
MPI_Comm_set_errhandler(dup, MPI_ERRORS_RETURN);
- if (maxlen > 1)
- mult = maxlen > size ? size : maxlen;
- int* sb = xbt_new0(int, size * maxlen);
- int* rb = xbt_new0(int, size * maxlen);
+ int* sb = (int*)calloc(size * maxlen, sizeof(int));
+ int* rb = (int*)calloc(size * maxlen+rank, sizeof(int));
- for (i = 0; i < size *maxlen; ++i) {
+ for (int i = 0; i < size * maxlen; ++i) {
sb[i] = rank*size + i;
rb[i] = 0;
}
- status = MPI_Allreduce(sb, rb, size *maxlen, MPI_INT, MPI_SUM, dup);
+ int status = MPI_Allreduce(sb, rb, size * maxlen, MPI_INT, MPI_SUM, dup);
if (rank == 0 && status != MPI_SUCCESS) {
printf("all_to_all returned %d\n", status);
fflush(stdout);
}
- //Do not free dup
- xbt_free(sb);
- xbt_free(rb);
+ //Do not free dup and rb/sb
MPI_Finalize();
- return (EXIT_SUCCESS);
+ return EXIT_SUCCESS;
}