-/* Copyright (c) 2013-2019. The SimGrid Team.
+/* Copyright (c) 2013-2021. The SimGrid Team.
* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
namespace simgrid{
namespace smpi{
/* Non-topology-specific pipelined linear-reduce function */
-int Coll_reduce_arrival_pattern_aware::reduce(const void *buf, void *rbuf,
- int count,
- MPI_Datatype datatype,
- MPI_Op op, int root,
- MPI_Comm comm)
+int reduce__arrival_pattern_aware(const void *buf, void *rbuf,
+ int count,
+ MPI_Datatype datatype,
+ MPI_Op op, int root,
+ MPI_Comm comm)
{
int rank = comm->rank();
int tag = -COLL_TAG_REDUCE;
else {
// printf("node %d start\n",rank);
- MPI_Request* send_request_array = new MPI_Request[size + pipe_length];
- MPI_Request* recv_request_array = new MPI_Request[size + pipe_length];
- MPI_Status* send_status_array = new MPI_Status[size + pipe_length];
- MPI_Status* recv_status_array = new MPI_Status[size + pipe_length];
+ auto* send_request_array = new MPI_Request[size + pipe_length];
+ auto* recv_request_array = new MPI_Request[size + pipe_length];
+ auto* send_status_array = new MPI_Status[size + pipe_length];
+ auto* recv_status_array = new MPI_Status[size + pipe_length];
if (rank == 0) {
sent_count = 0;
/* when count is not divisible by block size, use default BCAST for the remainder */
if ((remainder != 0) && (count > segment)) {
- Coll_reduce_default::reduce((char*)buf + (pipe_length * increment), (char*)rbuf + (pipe_length * increment),
- remainder, datatype, op, root, comm);
+ reduce__default((char*)buf + (pipe_length * increment), (char*)rbuf + (pipe_length * increment),
+ remainder, datatype, op, root, comm);
}
smpi_free_tmp_buffer(tmp_buf);