Partitionneur_Sous_Domaines.cpp

/****************************************************************************
* Copyright (c) 2026, CEA
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*****************************************************************************/
 
#include <Partitionneur_Sous_Domaines.h>
#include <Synonyme_info.h>
#include <Domaine.h>
#include <Sous_Domaines.h>
#include <Param.h>
#include <Interprete.h>
 
Implemente_instanciable_sans_constructeur(Partitionneur_Sous_Domaines,"Partitionneur_Sous_Domaines",Partitionneur_base);
// XD partitionneur_sous_domaines partitionneur_deriv partitionneur_sous_domaines INHERITS_BRACE This algorithm will
// XD_CONT create one part for each specified subdomaine/domain. All elements contained in the first subdomaine/domain
// XD_CONT are put in the first part, all remaining elements contained in the second subdomaine/domain in the second
// XD_CONT part, etc... NL2 If all elements of the current domain are contained in the specified subdomaines/domain,
// XD_CONT then N parts are created, otherwise, a supplemental part is created with the remaining elements. NL2 If no
// XD_CONT subdomaine is specified, all subdomaines defined in the domain are used to split the mesh.
Add_synonym(Partitionneur_Sous_Domaines, "Partitionneur_Sous_Zones");
 
Partitionneur_Sous_Domaines::Partitionneur_Sous_Domaines()
{
}
 
 
Sortie& Partitionneur_Sous_Domaines::printOn(Sortie& os) const
{
  Cerr << "Partitionneur_Sous_Domaines::printOn invalid\n" << finl;
  exit();
  return os;
}
 
/*! @brief Reading format: (the sub-domain/domain list is optional, N is the number of entities read)
 *
 *   {
 *      [ Sous_domaines N nom_sous_domaine1 nom_sous_domaine2  nom_sous_domaine3 ... ]
 *      [ Domaines N nom_domaine1 nom_domaine2 ... ]
 *   }
 *
 */
void Partitionneur_Sous_Domaines::set_param(Param& param) const
{
  if (!ref_domaine_)
    {
      Cerr << " Error: the domain has not been associated" << finl;
      Process::exit();
    }
  param.ajouter("sous_zones",&noms_sous_domaines_);  // XD attr sous_zones listchaine sous_zones OPT N SUBZONE_NAME_1
  // XD_CONT SUBZONE_NAME_2 ...
  param.ajouter("domaines",&noms_domaines_);         // XD attr domaines listchaine domaines OPT N DOMAIN_NAME_1
  // XD_CONT DOMAIN_NAME_2 ...
}
 
/*! @brief First initialisation step of the partitioner: associate a domain.
 *
 */
void Partitionneur_Sous_Domaines::associer_domaine(const Domaine& domaine)
{
  ref_domaine_ = domaine;
}
 
/*! @brief Second initialisation step: define the sub-domains to use.
 *
 * (readOn can be used instead).
 *
 */
void Partitionneur_Sous_Domaines::initialiser(const Noms& noms_sous_domaines)
{
  assert(ref_domaine_);
  noms_sous_domaines_ = noms_sous_domaines;
}
 
/*! @brief Each sub-domain in noms_sous_domaines_ defines the elements assigned to a processor.
 *
 *    Processors are assigned in the order of appearance of the
 *    sub-domains/domains within the domain (not in the order they appear in
 *    the sub-domain list).
 *    First sub-domain/domain in the list => proc 0
 *    Elements of the second sub-domain => proc 1
 *    ...
 *    Remaining elements not in any sub-domain => assigned to a new pe.
 *    If an element belongs to several sub-domains, the first sub-domain wins.
 *
 */
void Partitionneur_Sous_Domaines::construire_partition(IntVect& elem_part, int& nb_parts_tot) const
{
  assert(ref_domaine_);
  const Domaine& dom = ref_domaine_.valeur();
  const int nb_elem = dom.nb_elem_tot();
  elem_part.resize(nb_elem);
  elem_part = -1;
  if (noms_domaines_.size()!=0 && noms_sous_domaines_.size())
    {
      Cerr << "Can't mix sous_domaines and domaines yet in sous_domaines partitionner." << finl;
      Process::exit();
    }
  // Current processor number being assigned:
  int pe = 0;
  int count = 0;
  if (noms_domaines_.size()!=0)
    {
      for (int i=0; i<noms_domaines_.size(); i++)
        {
          const Nom& nom_domaine = noms_domaines_[i];
          if (!interprete().objet_existant(nom_domaine) || !sub_type(Domaine, interprete().objet(nom_domaine)))
            {
              // Unlike sub-domains, the domain must exist for now
              Cerr << "Domain " << nom_domaine << " is not existing." << finl;
              Process::exit();
              // ToDo: eventually a list of domains from files e.g.: DOM_0000.Zones, DOM_0001.Zones
            }
          const Domaine& domaine = ref_cast(Domaine, interprete().objet(nom_domaine));
          DoubleTab domaine_xp;
          domaine.calculer_centres_gravite(domaine_xp);
          IntVect dom_cells_containing_domaine_cells;
          dom.chercher_elements(domaine_xp, dom_cells_containing_domaine_cells);
          Cerr << " Allocation of elements of the domain " << domaine.le_nom() << " to the processor " << pe << finl;
          for (int cell = 0; cell < dom_cells_containing_domaine_cells.size(); cell++)
            {
              int elem = dom_cells_containing_domaine_cells[cell];
              if (elem_part[elem] < 0)
                {
                  count++;
                  elem_part[elem] = pe;
                }
            }
          Cerr << " Number of elements attributed to the processor " << pe << " : " << count << finl;
          pe++;
        }
    }
  else
    {
      Noms noms_sous_domaines(noms_sous_domaines_);
      // If the name of the only Sous_Domaine is a list of Sous_Domaine, retrieve all of them:
      if (noms_sous_domaines_.size()==1 && sub_type(Sous_Domaines, Interprete::objet(noms_sous_domaines_[0])))
        {
          const Sous_Domaines& liste = ref_cast(Sous_Domaines, Interprete::objet(noms_sous_domaines_[0]));
          noms_sous_domaines.dimensionner_force(liste.size());
          for (int i=0; i<liste.size(); i++) noms_sous_domaines[i]=liste[i].le_nom();
        }
      const int nb_sous_domaines = dom.nb_ss_domaines();
      const int toutes_sous_domaines = (noms_sous_domaines.size() == 0);
      if (toutes_sous_domaines)
        Cerr << " No subarea specified, we use all existing subareas." << finl;
      for (int i_sous_domaine = 0; i_sous_domaine < nb_sous_domaines; i_sous_domaine++)
        {
          const Sous_Domaine& sous_domaine = dom.ss_domaine(i_sous_domaine);
          const Nom& nom = sous_domaine.le_nom();
          bool sous_domaine_trouvee = noms_sous_domaines.contient_(nom);
          if (!toutes_sous_domaines && !sous_domaine_trouvee)
            continue;
 
          count = 0;
          const int nb_elem_ssz = sous_domaine.nb_elem_tot();
          for (int i = 0; i < nb_elem_ssz; i++)
            {
              const int elem = sous_domaine[i];
              if (elem_part[elem] < 0)
                {
                  count++;
                  elem_part[elem] = pe;
                }
            }
          Cerr << " Allocation of " << count << " elements from the subarea " << nom << " to the processor " << pe << finl;
          pe++;
        }
    }
  count = 0;
  for (int elem = 0; elem < nb_elem; elem++)
    {
      if (elem_part[elem] < 0)
        {
          count++;
          elem_part[elem] = pe;
        }
    }
  if (count>0) Cerr << " Allocation of the remaining " << count << " elements to the processor " << pe << finl;
  /*
  if (count==0)
    {
      Cerr << "Error! The last domaine will be empty with 0 elements. It is surely not what you want." << finl;
      Cerr << "Check, your partition strategy." << finl;
      Process::exit();
    } */
  if (ref_domaine_->bords_perio().size() > 0)
    corriger_bords_avec_liste(dom, 0, elem_part);
 
  // Do not correct elem0 on proc0 (test case CouplageFluide_Pb1Pb2_VEF_CN)
}