/usr/include/rheolef/mpi_assembly_end.h is in librheolef-dev 6.5-1+b1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 | #ifndef _RHEO_MPI_ASSEMBLY_END_H
#define _RHEO_MPI_ASSEMBLY_END_H
///
/// This file is part of Rheolef.
///
/// Copyright (C) 2000-2009 Pierre Saramito <Pierre.Saramito@imag.fr>
///
/// Rheolef is free software; you can redistribute it and/or modify
/// it under the terms of the GNU General Public License as published by
/// the Free Software Foundation; either version 2 of the License, or
/// (at your option) any later version.
///
/// Rheolef is distributed in the hope that it will be useful,
/// but WITHOUT ANY WARRANTY; without even the implied warranty of
/// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
/// GNU General Public License for more details.
///
/// You should have received a copy of the GNU General Public License
/// along with Rheolef; if not, write to the Free Software
/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
///
/// =========================================================================
#include "rheolef/msg_util.h"
#include <boost/functional.hpp>
#include <boost/iterator/transform_iterator.hpp>
namespace rheolef {
/*F:
NAME: msg_assembly_end -- array or matrix assembly (@PACKAGE@ @VERSION@)
DESCRIPTION:
Finish a dense array or sparse matrix assembly.
COMPLEXITY:
**TO DO**
AUTHORS:
LMC-IMAG, 38041 Grenoble cedex 9, France
| Pierre.Saramito@imag.fr
DATE: 23 march 1999
END:
*/
//<mpi_assembly_end:
template <
class Container,
class Message,
class Size>
Size
mpi_assembly_end (
// input:
Message& receive,
Message& send,
Size receive_max_size,
// output:
Container x)
{
typedef Size size_type;
typedef typename Container::data_type data_type;
// -----------------------------------------------------------------
// 1) receive data and store it in container
// -----------------------------------------------------------------
// note: for wait_any, build an iterator adapter that scan the pair.second in [index,request]
// and then get an iterator in the pair using iter.base(): retrive the corresponding index
// for computing the position in the receive.data buffer
typedef boost::transform_iterator<select2nd<size_type,mpi::request>,
typename std::list<std::pair<size_type,mpi::request> >::iterator>
request_iterator;
#define _RHEOLEF_BUG_FOR_NON_MPI_DATA_TYPE
#ifdef _RHEOLEF_BUG_FOR_NON_MPI_DATA_TYPE
while (receive.waits.size() != 0) {
request_iterator iter_r_waits (receive.waits.begin(), select2nd<size_type,mpi::request>()),
last_r_waits (receive.waits.end(), select2nd<size_type,mpi::request>());
// waits on any receive...
std::pair<mpi::status,request_iterator> pair_status = mpi::wait_any (iter_r_waits, last_r_waits);
// check status
boost::optional<int> i_msg_size_opt = pair_status.first.template count<data_type>();
check_macro (i_msg_size_opt, "receive wait failed");
int iproc = pair_status.first.source();
check_macro (iproc >= 0, "receive: source iproc = "<<iproc<<" < 0 !");
// get size of receive and number in data
size_type i_msg_size = (size_type)i_msg_size_opt.get();
typename std::list<std::pair<size_type,mpi::request> >::iterator i_pair_ptr = pair_status.second.base();
size_type i_receive = (*i_pair_ptr).first;
size_type i_start = i_receive*receive_max_size;
for (size_type j = i_start; j < i_start + i_msg_size; j++) {
x (receive.data[j]);
}
receive.waits.erase (i_pair_ptr);
}
#else // _RHEOLEF_BUG_FOR_NON_MPI_DATA_TYPE
// wait_all works better when using an array of non mpi_data_type, as an array of set<size_t>
request_iterator iter_r_waits (receive.waits.begin(), select2nd<size_type,mpi::request>()),
last_r_waits (receive.waits.end(), select2nd<size_type,mpi::request>());
std::vector<mpi::status> recv_status (receive.waits.size());
mpi::wait_all (iter_r_waits, last_r_waits, recv_status.begin());
for (size_type i_recv = 0, n_recv = recv_status.size(); i_recv < n_recv; i_recv++) {
boost::optional<int> i_msg_size_opt = recv_status[i_recv].template count<data_type>();
check_macro (i_msg_size_opt, "receive wait failed");
int iproc = recv_status[i_recv].source();
check_macro (iproc >= 0, "receive: source iproc = "<<iproc<<" < 0 !");
// get size of receive and number in data
size_type i_msg_size = (size_type)i_msg_size_opt.get();
size_type i_start = i_recv*receive_max_size;
for (size_type j = i_start; j < i_start + i_msg_size; j++) {
x (receive.data[j]);
}
}
#endif // _RHEOLEF_BUG_FOR_NON_MPI_DATA_TYPE
// -----------------------------------------------------------------
// 2) wait on sends
// -----------------------------------------------------------------
request_iterator iter_s_waits (send.waits.begin(), select2nd<size_type,mpi::request>()),
last_s_waits (send.waits.end(), select2nd<size_type,mpi::request>());
Size send_nproc = send.waits.size();
std::vector<mpi::status> send_status(send_nproc);
mpi::wait_all (iter_s_waits, last_s_waits, send_status.begin());
// -----------------------------------------------------------------
// 3) clear send & receive messages [waits,data]
// -----------------------------------------------------------------
send.waits.clear();
send.data.clear();
receive.waits.clear();
receive.data.clear();
return x.n_new_entry();
}
//>mpi_assembly_end:
} // namespace rheolef
#endif //_RHEO_MPI_ASSEMBLY_END_H
|