volume_mapper.hpp

/*---------------------------------------------------------------------------*\
 *
 *  bitpit
 *
 *  Copyright (C) 2015-2021 OPTIMAD engineering Srl
 *
 *  -------------------------------------------------------------------------
 *  License
 *  This file is part of bitpit.
 *
 *  bitpit is free software: you can redistribute it and/or modify it
 *  under the terms of the GNU Lesser General Public License v3 (LGPL)
 *  as published by the Free Software Foundation.
 *
 *  bitpit 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 Lesser General Public
 *  License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with bitpit. If not, see <http://www.gnu.org/licenses/>.
 *
\*---------------------------------------------------------------------------*/
 
#ifndef __BITPIT_VOLUME_MAPPER_HPP__
#define __BITPIT_VOLUME_MAPPER_HPP__
 
#if BITPIT_ENABLE_MPI
#    include <mpi.h>
#endif
#include <string>
#include <vector>
#include <unordered_map>
 
#include "volume_kernel.hpp"
 
namespace bitpit {
 
namespace mapping
{
 
enum Type {
    TYPE_UNKNOWN = 0,
    TYPE_REFINEMENT,
    TYPE_COARSENING,
    TYPE_RENUMBERING
};
 
enum Entity {
    ENTITY_UNKNOWN = -1,
    ENTITY_CELL,
};
 
struct Info
{
    Info()
    : type(TYPE_UNKNOWN), entity(ENTITY_UNKNOWN)
    {
    }
 
    Info(Type user_type, Entity user_entity)
    : type(user_type), entity(user_entity)
    {
    }
 
    Type type;                  
    Entity entity;              
    std::vector<long> ids;      
#if BITPIT_ENABLE_MPI
    std::vector<int> ranks;     
#endif
 
};
 
}
 
class VolumeMapper {
 
public:
    virtual ~VolumeMapper() = default;
 
    void clear();
    void clearMapping();
    void clearInverseMapping();
 
    const VolumeKernel *getReferencePatch() const;
    const VolumeKernel *getMappedPatch() const;
 
    const bitpit::PiercedStorage<mapping::Info> & getMapping() const;
    const bitpit::PiercedStorage<mapping::Info> & getInverseMapping() const;
 
    void initialize(bool fillInv = false);
 
    virtual void adaptionPrepare(const std::vector<adaption::Info> &infoAdapt, bool reference = true) = 0;
    virtual void adaptionAlter(const std::vector<adaption::Info> &infoAdapt, bool reference = true, bool fillInv = false) = 0;
    virtual void adaptionCleanup() = 0;
 
#if BITPIT_ENABLE_MPI
    virtual bool checkPartition() = 0;
    virtual std::unordered_map<int, std::vector<long> > getReceivedMappedIds() const = 0;
    virtual std::unordered_map<int, std::vector<long> > getSentMappedIds() const = 0;
    virtual std::unordered_map<int, std::vector<long> > getReceivedReferenceIds() const = 0;
    virtual std::unordered_map<int, std::vector<long> > getSentReferenceIds() const = 0;
#endif
 
protected:
    const VolumeKernel *m_referencePatch;    
    const VolumeKernel *m_mappedPatch;       
    PiercedStorage<mapping::Info> m_mapping;                     
    PiercedStorage<mapping::Info> m_inverseMapping;              
    std::unordered_map<long, mapping::Info> m_previousMapping;   
#if BITPIT_ENABLE_MPI
    MPI_Comm m_communicator; 
    int m_rank;              
    int m_nProcs;            
#endif
 
#if BITPIT_ENABLE_MPI
    VolumeMapper(const VolumeKernel *referencePatch, const VolumeKernel *mappedPatch, MPI_Comm communicator);
#else
    VolumeMapper(const VolumeKernel *referencePatch, const VolumeKernel *mappedPatch);
#endif
 
    virtual void _mapMeshes(bool fillInverse) = 0;
 
#if BITPIT_ENABLE_MPI
    void initializeCommunicator(MPI_Comm communicator);
    MPI_Comm getCommunicator() const;
    bool isCommunicatorSet() const;
    void freeCommunicator();
#endif
 
};
 
}
#endif