/* This file is part of the Open Porous Media project (OPM). OPM 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. OPM 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 OPM. If not, see . Consult the COPYING file in the top-level source directory of this module for the precise wording of the license and the list of copyright holders. */ #ifndef ECL_MPI_SERIALIZER_HH #define ECL_MPI_SERIALIZER_HH #include #include #include #include #include #include namespace detail { template struct MakeVariantImpl { template static decltype(auto) make_variant(std::size_t index) { if(Index == index) return std::variant{std::in_place_index_t{}}; if constexpr(sizeof...(Rest) != 0) return make_variant(index); else throw std::runtime_error("Invalid variant index"); } }; template decltype(auto) make_variant(std::size_t index) { return detail::MakeVariantImpl::template make_variant<0, Ts...>(index); } template using remove_cvr_t = std::remove_const_t>; } // namespace detail namespace Opm { /*! \brief Class for (de-)serializing and broadcasting data in parallel. *! \details If the class has a serializeOp member this is used, * if not it is passed on to the underlying primitive serializer. */ class EclMpiSerializer { public: //! \brief Constructor. //! \param comm The global communicator to broadcast using explicit EclMpiSerializer(Opm::Parallel::Communication comm) : m_comm(comm) {} //! \brief (De-)serialization for simple types. //! \details The data handled by this depends on the underlying serialization used. //! Currently you can call this for scalars, and stl containers with scalars. template void operator()(const T& data) { if constexpr (is_ptr::value) { ptr(data); } else if constexpr (is_pair::value) { pair(data); } else if constexpr (is_variant::value) { variant(data); } else if constexpr (is_optional::value) { optional(data); } else { if (m_op == Operation::PACKSIZE) m_packSize += Mpi::packSize(data, m_comm); else if (m_op == Operation::PACK) Mpi::pack(data, m_buffer, m_position, m_comm); else if (m_op == Operation::UNPACK) Mpi::unpack(const_cast(data), m_buffer, m_position, m_comm); } } //! \brief Handler for vectors. //! \tparam T Type for vector elements //! \param data The vector to (de-)serialize template void vector(std::vector& data) { auto handle = [&](auto& d) { for (auto& it : d) { if constexpr (is_pair::value) pair(it); else if constexpr (is_ptr::value) ptr(it); else if constexpr (has_serializeOp::value) it.serializeOp(*this); else (*this)(it); } }; if (m_op == Operation::PACKSIZE) { m_packSize += Mpi::packSize(data.size(), m_comm); handle(data); } else if (m_op == Operation::PACK) { Mpi::pack(data.size(), m_buffer, m_position, m_comm); handle(data); } else if (m_op == Operation::UNPACK) { size_t size; Mpi::unpack(size, m_buffer, m_position, m_comm); data.resize(size); handle(data); } } template void array(Array& data) { using T = typename Array::value_type; auto handle = [&](auto& d) { for (auto& it : d) { if constexpr (is_pair::value) pair(it); else if constexpr (is_ptr::value) ptr(it); else if constexpr (has_serializeOp::value) it.serializeOp(*this); else (*this)(it); } }; if (m_op == Operation::PACKSIZE) { m_packSize += Mpi::packSize(data.size(), m_comm); handle(data); } else if (m_op == Operation::PACK) { Mpi::pack(data.size(), m_buffer, m_position, m_comm); handle(data); } else if (m_op == Operation::UNPACK) { size_t size; Mpi::unpack(size, m_buffer, m_position, m_comm); handle(data); } } //! \brief Handler for std::variant. //! \param data The variant to (de-)serialize template void variant(const std::variant& data) { auto visitor = [&](auto& d) { if constexpr (has_serializeOp>::value) const_cast&>(d).serializeOp(*this); else (*this)(d); }; if (m_op == Operation::PACKSIZE) { m_packSize += Mpi::packSize(data.index(), m_comm); std::visit(visitor, data); } else if (m_op == Operation::PACK) { Mpi::pack(data.index(), m_buffer, m_position, m_comm); std::visit(visitor, data); } else if (m_op == Operation::UNPACK) { size_t index; Mpi::unpack(index, m_buffer, m_position, m_comm); auto& data_mut = const_cast&>(data); data_mut = detail::make_variant(index); std::visit(visitor, data_mut); } } //! \brief Handler for std::optional. //! \tparam T Type for data //! \param data The optional to (de-)serialize template void optional(const std::optional& data) { if (m_op == Operation::PACKSIZE) { m_packSize += Mpi::packSize(data.has_value(), m_comm); if (data.has_value()) { if constexpr (has_serializeOp::value) { const_cast(*data).serializeOp(*this); } else m_packSize += Mpi::packSize(*data, m_comm); } } else if (m_op == Operation::PACK) { Mpi::pack(data.has_value(), m_buffer, m_position, m_comm); if (data.has_value()) { if constexpr (has_serializeOp::value) { const_cast(*data).serializeOp(*this); } else { Mpi::pack(*data, m_buffer, m_position, m_comm); } } } else if (m_op == Operation::UNPACK) { bool has; Mpi::unpack(has, m_buffer, m_position, m_comm); if (has) { T res; if constexpr (has_serializeOp::value) { res.serializeOp(*this); } else { Mpi::unpack(res, m_buffer, m_position, m_comm); } const_cast&>(data) = res; } } } //! \brief Handler for maps. //! \tparam Map map type //! \param map The map to (de-)serialize template void map(Map& data) { using Key = typename Map::key_type; using Data = typename Map::mapped_type; auto handle = [&](auto& d) { if constexpr (is_vector::value) this->vector(d); else if constexpr (is_ptr::value) this->ptr(d); else if constexpr (is_map::value) this->map(d); else if constexpr (has_serializeOp::value) d.serializeOp(*this); else (*this)(d); }; auto keyHandle = [&](auto& d) { if constexpr (is_pair::value) pair(d); else if constexpr (has_serializeOp::value) d.serializeOp(*this); else (*this)(d); }; if (m_op == Operation::PACKSIZE) { m_packSize += Mpi::packSize(data.size(), m_comm); for (auto& it : data) { keyHandle(it.first); handle(it.second); } } else if (m_op == Operation::PACK) { Mpi::pack(data.size(), m_buffer, m_position, m_comm); for (auto& it : data) { keyHandle(it.first); handle(it.second); } } else if (m_op == Operation::UNPACK) { size_t size; Mpi::unpack(size, m_buffer, m_position, m_comm); for (size_t i = 0; i < size; ++i) { Key key; keyHandle(key); Data entry; handle(entry); data.insert(std::make_pair(key, entry)); } } } template void set(Set& data) { using Data = typename Set::value_type; auto handle = [&](auto& d) { if constexpr (is_vector::value) this->vector(d); else if constexpr (is_ptr::value) ptr(d); else if constexpr (has_serializeOp::value) d.serializeOp(*this); else (*this)(d); }; if (m_op == Operation::PACKSIZE) { m_packSize += Mpi::packSize(data.size(), m_comm); for (auto& it : data) { handle(it); } } else if (m_op == Operation::PACK) { Mpi::pack(data.size(), m_buffer, m_position, m_comm); for (auto& it : data) { handle(it); } } else if (m_op == Operation::UNPACK) { size_t size; Mpi::unpack(size, m_buffer, m_position, m_comm); for (size_t i = 0; i < size; ++i) { Data entry; handle(entry); data.insert(entry); } } } //! \brief Call this to serialize data. //! \tparam T Type of class to serialize //! \param data Class to serialize template void pack(T& data) { m_op = Operation::PACKSIZE; m_packSize = 0; data.serializeOp(*this); m_position = 0; m_buffer.resize(m_packSize); m_op = Operation::PACK; data.serializeOp(*this); } //! \brief Call this to de-serialize data. //! \tparam T Type of class to de-serialize //! \param data Class to de-serialize template void unpack(T& data) { m_position = 0; m_op = Operation::UNPACK; data.serializeOp(*this); } //! \brief Serialize and broadcast on root process, de-serialize on //! others. //! //! \tparam T Type of class to broadcast //! \param data Class to broadcast template void broadcast(T& data) { if (m_comm.size() == 1) return; if (m_comm.rank() == 0) { try { pack(data); m_packSize = m_position; m_comm.broadcast(&m_packSize, 1, 0); m_comm.broadcast(m_buffer.data(), m_position, 0); } catch (...) { m_packSize = std::numeric_limits::max(); m_comm.broadcast(&m_packSize, 1, 0); throw; } } else { m_comm.broadcast(&m_packSize, 1, 0); if (m_packSize == std::numeric_limits::max()) { throw std::runtime_error("Error detected in parallel serialization"); } m_buffer.resize(m_packSize); m_comm.broadcast(m_buffer.data(), m_packSize, 0); unpack(data); } } //! \brief Returns current position in buffer. size_t position() const { return m_position; } //! \brief Returns true if we are currently doing a serialization operation. bool isSerializing() const { return m_op != Operation::UNPACK; } protected: //! \brief Enumeration of operations. enum class Operation { PACKSIZE, //!< Calculating serialization buffer size PACK, //!< Performing serialization UNPACK //!< Performing de-serialization }; //! \brief Predicate for detecting pairs. template struct is_pair { constexpr static bool value = false; }; template struct is_pair> { constexpr static bool value = true; }; //! \brief Predicate for detecting vectors. template struct is_vector { constexpr static bool value = false; }; template struct is_vector> { constexpr static bool value = true; }; //! \brief Predicate for detecting variants. template struct is_variant { constexpr static bool value = false; }; template struct is_variant> { constexpr static bool value = true; }; //! \brief Predicate for smart pointers. template struct is_ptr { constexpr static bool value = false; }; template struct is_ptr> { constexpr static bool value = true; }; template struct is_ptr> { constexpr static bool value = true; }; //! \brief Predicate for std::optional. template struct is_optional { constexpr static bool value = false; }; template struct is_optional> { constexpr static bool value = true; }; //! \brief Predicate for maps template struct is_map { constexpr static bool value = false; }; template struct is_map> { constexpr static bool value = true; }; template struct is_map> { constexpr static bool value = true; }; //! Detect existence of \c serializeOp member function //! //! Base case (no \c serializeOp member function) template struct has_serializeOp : public std::false_type {}; //! Detect existence of \c serializeOp member function //! //! Non-default, albeit common, case (type has \c serializeOp member //! function) template struct has_serializeOp< T, std::void_t().serializeOp(std::declval()))> > : public std::true_type {}; //! \brief Handler for pairs. template void pair(const std::pair& data) { if constexpr (has_serializeOp::value) const_cast(data.first).serializeOp(*this); else (*this)(data.first); if constexpr (has_serializeOp::value) const_cast(data.second).serializeOp(*this); else (*this)(data.second); } //! \brief Handler for smart pointers. template void ptr(const PtrType& data) { using T1 = typename PtrType::element_type; bool value = data ? true : false; (*this)(value); if (m_op == Operation::UNPACK && value) { const_cast(data).reset(new T1); } if (data) { if constexpr (has_serializeOp::value) data->serializeOp(*this); else (*this)(*data); } } Parallel::Communication m_comm; //!< Communicator to broadcast using Operation m_op = Operation::PACKSIZE; //!< Current operation size_t m_packSize = 0; //!< Required buffer size after PACKSIZE has been done int m_position = 0; //!< Current position in buffer std::vector m_buffer; //!< Buffer for serialized data }; } #endif