MeshLevelData.h 2.72 KB
Newer Older
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
// ============================================================================
// ==                                                                        ==
// == AMDiS - Adaptive multidimensional simulations                          ==
// ==                                                                        ==
// ==  http://www.amdis-fem.org                                              ==
// ==                                                                        ==
// ============================================================================
//
// Software License for AMDiS
//
// Copyright (c) 2010 Dresden University of Technology 
// All rights reserved.
// Authors: Simon Vey, Thomas Witkowski et al.
//
// This file is part of AMDiS
//
// See also license.opensource.txt in the distribution.



/** \file MeshLevelData.h */

#ifndef AMDIS_MESH_LEVEL_DATA_H
#define AMDIS_MESH_LEVEL_DATA_H


#include <iostream>
#include <set>
#include <vector>
30
#include <mpi.h>
Thomas Witkowski's avatar
Thomas Witkowski committed
31
#include "Global.h"
32 33 34 35 36 37 38 39 40 41 42 43 44 45

namespace AMDiS {

  using namespace std;

  class MeshLevelData 
  {
  public:
    MeshLevelData()
      : nLevel(0)
    {}

    void init(std::set<int> &neighbourRanks);

46
    void addLevel(std::set<int> &ranksInDomain, int domainId);
47 48 49 50 51 52 53

    // Writes all data of this object to an output stream.
    void serialize(ostream &out);

    // Reads the object data from an input stream.
    void deserialize(istream &in);

Thomas Witkowski's avatar
Thomas Witkowski committed
54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69
    void print();

    std::set<int>& getLevelRanks(int level)
    {
      TEST_EXIT_DBG(level < nLevel)("Should not happen!\n");
      
      return levelRanks[level];
    }

    std::set<int>& getLevelNeighbours(int level)
    {
      TEST_EXIT_DBG(level < nLevel)("Should not happen!\n");
      
      return levelNeighbours[level];
    }

70 71 72 73 74
   int getLevelNumber()
   {
     return nLevel;
   }

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
   MPI::Intracomm& getMpiComm(int level)
   {
     TEST_EXIT_DBG(level < nLevel)("Should not happen!\n");

     return mpiComms[level];
   }

    MPI::Group& getMpiGroup(int level)
    {
      TEST_EXIT_DBG(level < nLevel)("Should not happen!\n");
      
      return mpiGroups[level];
    }

    int mapRank(int fromRank, int fromLevel, int toLevel)
    {
      int toRank = -1;

      MPI::Group::Translate_ranks(mpiGroups[fromLevel], 1, &fromRank, 
				  mpiGroups[toLevel], &toRank);
      if (toRank == MPI::UNDEFINED)
	toRank = -1;

      return toRank;			
    }

101 102 103 104 105 106 107
    bool rankInSubdomain(int rank, int level)
    {
      TEST_EXIT_DBG(level < nLevel)("Should not happen!\n");

      return static_cast<bool>(levelRanks[level].count(rank));
    }

108 109 110
  protected:
    int nLevel;

111 112
    vector<std::set<int> > levelRanks;
    
Thomas Witkowski's avatar
Thomas Witkowski committed
113
    vector<std::set<int> > levelNeighbours;
114 115

    vector<MPI::Intracomm> mpiComms;
116 117

    vector<MPI::Group> mpiGroups;
118 119 120 121 122
  };

}

#endif