InteriorBoundary.h 4.26 KB
Newer Older
1
2
3
4
// ============================================================================
// ==                                                                        ==
// == AMDiS - Adaptive multidimensional simulations                          ==
// ==                                                                        ==
5
// ==  http://www.amdis-fem.org                                              ==
6
7
// ==                                                                        ==
// ============================================================================
8
9
10
11
12
13
14
15
16
17
18
19
//
// 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.


20
21
22
23
24
25
26

/** \file InteriorBoundary.h */

#ifndef AMDIS_INTERIORBOUNDARY_H
#define AMDIS_INTERIORBOUNDARY_H

#include <vector>
Thomas Witkowski's avatar
Thomas Witkowski committed
27
#include <map>
28

29
#include "AMDiS_fwd.h"
30
#include "BoundaryObject.h"
31
#include "parallel/MeshLevelData.h"
32
#include "parallel/ParallelTypes.h"
33
34
35

namespace AMDiS {

36
37
  using namespace std;

38
39
40
41
42
  /** \brief
   * Defines the interior boundary, i.e. a bound within the domain. It is used for
   * the classical domain decomposition parallelization.
   */
  class InteriorBoundary {
Thomas Witkowski's avatar
Thomas Witkowski committed
43
  public:
44
45
    void create(MeshLevelData &levelData,
		int level,
46
		ElementObjectDatabase &elObjDb);
Thomas Witkowski's avatar
Thomas Witkowski committed
47

48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
    RankToBoundMap& getOwn()
    {
      return own;
    }
 
    RankToBoundMap& getOther()
    {
      return other;
    }

    RankToBoundMap& getPeriodic()
    {
      return periodic;
    }

    bool hasPeriodic()
    {
      return static_cast<bool>(periodic.size());
    }

68
69
70
71
72
73
    /// Writes this object to a file.
    void serialize(ostream &out);

    /// Reads the state of an interior boundary from a file.
    void deserialize(istream &in, Mesh *mesh);

74
  private:
75
76
77
78
79
80
    AtomicBoundary& getNewOwn(int rank);

    AtomicBoundary& getNewOther(int rank);

    AtomicBoundary& getNewPeriodic(int rank);

81
82
83
84
85
86
    void serialize(ostream &out, RankToBoundMap& boundary);

    void deserialize(istream &in, 
		     RankToBoundMap& boundary,
		     map<int, Element*> &elIndexMap);

87
88
89
90
    void serializeExcludeList(ostream &out, ExcludeList &list);

    void deserializeExcludeList(istream &in, ExcludeList &list);    

91
  private:
92
93
    RankToBoundMap own, other, periodic;

94
    friend class ParallelDebug;
95
96

  public:
Thomas Witkowski's avatar
Thomas Witkowski committed
97
98
99
    /// Iterator for the interior boundary object.
    class iterator {      
    public:
100
      iterator(RankToBoundMap &b, int traverseLevel = 0)
101
	: bound(b),
102
	  level(traverseLevel)
103
104
105
106
      {
	reset();
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
107
108
109
      /// Set the iterator to the first position.
      void reset()
      {
110
	mapIt = bound.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
111
112
113
114
115
116
	nextNonempty();
      }

      /// Test if iterator is at the final position.
      bool end() const
      {
117
	return (mapIt == bound.end());
Thomas Witkowski's avatar
Thomas Witkowski committed
118
119
120
121
122
      }

      /// Move iterator to the next position.
      void operator++()
      {
123
124
	do {
	  ++vecIt;
125
	} while (vecIt != mapIt->second.end() && vecIt->maxLevel < level);
126

Thomas Witkowski's avatar
Thomas Witkowski committed
127
128
129
130
131
132
	if (vecIt == mapIt->second.end()) {
	  ++mapIt;
	  nextNonempty();
	}	
      }

133
134
135
136
137
138
139
140
141
142
      inline AtomicBoundary& operator*()
      {
	return *vecIt;
      }

      inline AtomicBoundary* operator->()
      {
	return &(*vecIt);
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
143
144
145
146
147
148
      void nextRank()
      {
	++mapIt;
	nextNonempty();
      }

149
      inline int getRank() 
Thomas Witkowski's avatar
Thomas Witkowski committed
150
151
152
153
154
155
156
157
      {
	return mapIt->first;
      }

    protected:

      inline void nextNonempty()
      {
158
159
	do {
	  // Return, we are at the end.
160
	  if (mapIt == bound.end())
161
162
163
164
165
	    return;
	  
	  // Search for the next non empty boundary map.
	  while (mapIt->second.size() == 0) {
	    ++mapIt;
166
	    if (mapIt == bound.end())
167
168
169
170
171
172
	      return;	  
	  }
	  
	  vecIt = mapIt->second.begin();
	  
	  // Search for the next atomic boundary on the mesh level
173
	  while (vecIt != mapIt->second.end() && vecIt->maxLevel < level)
174
175
176
177
178
179
180
181
182
	    ++vecIt;
	  
	  // If vector iterator is not at the end, we have found one and
	  // can return.
	  if (vecIt != mapIt->second.end())
	    return;
	  
	  // In this case, no boundary on the given level is found, continue
	  // with next rank.
183
	  ++mapIt;
184
	} while (true);
Thomas Witkowski's avatar
Thomas Witkowski committed
185
186
187
188
189
      }

    protected:
      RankToBoundMap::iterator mapIt;

190
      vector<AtomicBoundary>::iterator vecIt;
Thomas Witkowski's avatar
Thomas Witkowski committed
191

192
      RankToBoundMap &bound;
193

194
      int level;     
Thomas Witkowski's avatar
Thomas Witkowski committed
195
    };
196
197
198
199
  };
}

#endif // AMDIS_INTERIORBOUNDARY_H