-/* Copyright (c) 2013-2017. The SimGrid Team.
+/* Copyright (c) 2013-2019. The SimGrid Team.
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
int rank, size;
int i;
- MPI_Request *send_request_array;
- MPI_Request *recv_request_array;
- MPI_Status *send_status_array;
- MPI_Status *recv_status_array;
-
MPI_Aint extent;
extent = datatype->get_extent();
Request::recv(buf, count, datatype, from, tag, comm, &status);
}
- /* case: intermidiate node with only left child ==> relay message */
+ /* case: intermediate node with only left child ==> relay message */
else if (to_right == -1) {
Request::recv(buf, count, datatype, from, tag, comm, &status);
Request::send(buf, count, datatype, to_left, tag, comm);
}
- /* case: intermidiate node with both left and right children ==> relay message */
+ /* case: intermediate node with both left and right children ==> relay message */
else {
Request::recv(buf, count, datatype, from, tag, comm, &status);
Request::send(buf, count, datatype, to_left, tag, comm);
// pipelining
else {
- send_request_array =
- (MPI_Request *) xbt_malloc(2 * (size + pipe_length) * sizeof(MPI_Request));
- recv_request_array =
- (MPI_Request *) xbt_malloc((size + pipe_length) * sizeof(MPI_Request));
- send_status_array =
- (MPI_Status *) xbt_malloc(2 * (size + pipe_length) * sizeof(MPI_Status));
- recv_status_array =
- (MPI_Status *) xbt_malloc((size + pipe_length) * sizeof(MPI_Status));
-
-
+ MPI_Request* send_request_array = new MPI_Request[2 * (size + pipe_length)];
+ MPI_Request* recv_request_array = new MPI_Request[size + pipe_length];
+ MPI_Status* send_status_array = new MPI_Status[2 * (size + pipe_length)];
+ MPI_Status* recv_status_array = new MPI_Status[size + pipe_length];
/* case: root */
if (rank == 0) {
Request::waitall((pipe_length), recv_request_array, recv_status_array);
}
- /* case: intermidiate node with only left child ==> relay message */
+ /* case: intermediate node with only left child ==> relay message */
else if (to_right == -1) {
for (i = 0; i < pipe_length; i++) {
recv_request_array[i] = Request::irecv((char *) buf + (i * increment), segment, datatype, from,
Request::waitall(pipe_length, send_request_array, send_status_array);
}
- /* case: intermidiate node with both left and right children ==> relay message */
+ /* case: intermediate node with both left and right children ==> relay message */
else {
for (i = 0; i < pipe_length; i++) {
recv_request_array[i] = Request::irecv((char *) buf + (i * increment), segment, datatype, from,
Request::waitall((2 * pipe_length), send_request_array, send_status_array);
}
- free(send_request_array);
- free(recv_request_array);
- free(send_status_array);
- free(recv_status_array);
+ delete[] send_request_array;
+ delete[] recv_request_array;
+ delete[] send_status_array;
+ delete[] recv_status_array;
} /* end pipeline */
/* when count is not divisible by block size, use default BCAST for the remainder */