InteriorBoundary.cc 7.69 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
//
// 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.


13
#include "InteriorBoundary.h"
14
15
#include "FiniteElemSpace.h"
#include "BasisFunction.h"
16
#include "Serializer.h"
17
#include "VertexVector.h"
18
19

namespace AMDiS {
Thomas Witkowski's avatar
Thomas Witkowski committed
20

21
22
23
24
25

  bool BoundaryObject::computeReverseMode(BoundaryObject &obj0, 
					  BoundaryObject &obj1,
					  FiniteElemSpace *feSpace,
					  BoundaryType boundary)
26
  {
27
    FUNCNAME("BoundaryObject::computeReverseMode()");
28

29
    bool reverseMode = false;
30
31
32

    switch (feSpace->getMesh()->getDim()) {
    case 2:
33
      reverseMode = true;
34
      break;
35

36
    case 3:
37
38
39
      TEST_EXIT_DBG(obj1.elType == 0)
	("Only 3D macro elements with level 0 are supported. This element has level %d!\n", 
	 obj1.elType);
40

41

42
43
44
45
46
      if (obj0.subObj == EDGE) {	
	int el0_v0 = obj0.el->getVertexOfEdge(obj0.ithObj, 0);
	int el0_v1 = obj0.el->getVertexOfEdge(obj0.ithObj, 1);
	int el1_v0 = obj0.el->getVertexOfEdge(obj1.ithObj, 0);
	int el1_v1 = obj0.el->getVertexOfEdge(obj1.ithObj, 1);
47
48
49
50

	const BasisFunction *basFcts = feSpace->getBasisFcts();
	int nBasFcts = basFcts->getNumber();
	std::vector<DegreeOfFreedom> localDofs0(nBasFcts), localDofs1(nBasFcts);
51
52
	basFcts->getLocalIndices(obj0.el, feSpace->getAdmin(), localDofs0);
	basFcts->getLocalIndices(obj1.el, feSpace->getAdmin(), localDofs1);
53

54
55
56
57
58
59
60
61
62
	Mesh *mesh = feSpace->getMesh();

	if (mesh->isPeriodicAssociation(boundary) == false) {
	  TEST_EXIT_DBG(localDofs0[el0_v0] == localDofs1[el1_v0] ||
			localDofs0[el0_v0] == localDofs1[el1_v1])
	    ("This should not happen!\n");
	  TEST_EXIT_DBG(localDofs0[el0_v1] == localDofs1[el1_v0] ||
			localDofs0[el0_v1] == localDofs1[el1_v1])
	    ("This should not happen!\n");
63

64
	  if (localDofs0[el0_v0] != localDofs1[el1_v0])
65
	    reverseMode = true; 	
66
67
	} else {
	  if (mesh->associated(localDofs0[el0_v0], localDofs1[el1_v0]) == false)
68
	    reverseMode = true;
69
	}
70
71
      }

72
      if (obj0.subObj == FACE && obj0.ithObj != 1) {
73
74
75
	const BasisFunction *basFcts = feSpace->getBasisFcts();
	int nBasFcts = basFcts->getNumber();
	std::vector<DegreeOfFreedom> localDofs0(nBasFcts), localDofs1(nBasFcts);
76
77
	basFcts->getLocalIndices(obj0.el, feSpace->getAdmin(), localDofs0);
	basFcts->getLocalIndices(obj1.el, feSpace->getAdmin(), localDofs1);
78
	
79
80
	if (obj0.ithObj == 2 || obj0.ithObj == 3)
	  reverseMode = (localDofs0[0] != localDofs1[0]);
81
	  
82
83
	if (obj0.ithObj == 0)
	  reverseMode = (localDofs0[1] != localDofs1[1]);
84
85
      }
      break;
86

87
88
89
90
    default:
      ERROR_EXIT("This should not happen!\n");
    }

91
92
93
94
    return reverseMode;
  }


95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
  bool BoundaryObject::operator==(const BoundaryObject& other) const
  {
    return (other.elIndex == elIndex && 
	    other.subObj == subObj && 
	    other.ithObj == ithObj);
  }


  bool BoundaryObject::operator!=(const BoundaryObject& other) const
  {
    return (other.elIndex != elIndex || 
	    other.subObj != subObj || 
	    other.ithObj != ithObj);
  }


111
112
113
114
115
116
117
118
  bool AtomicBoundary::operator==(const AtomicBoundary& other) const
  {
    return (rankObj == other.rankObj && 
	    neighObj == other.neighObj && 
	    type == other.type);
  }


119
  AtomicBoundary& InteriorBoundary::getNewAtomic(int rank)
Thomas Witkowski's avatar
Thomas Witkowski committed
120
121
122
123
124
  {
    boundary[rank].resize(boundary[rank].size() + 1);
    return boundary[rank][boundary[rank].size() - 1];
  }

125

126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
  bool InteriorBoundary::operator==(const InteriorBoundary& other) const
  {
    InteriorBoundary& other2 = const_cast<InteriorBoundary&>(other);

    for (RankToBoundMap::const_iterator it = boundary.begin(); 
	 it != boundary.end(); ++it) {
      if (other2.boundary.count(it->first) == 0)
	return false;     

      if (other2.boundary[it->first].size() != it->second.size())
	return false;
            
      for (unsigned int i = 0; i < it->second.size(); i++) {
	std::vector<AtomicBoundary>::iterator bIt = 
	  find(other2.boundary[it->first].begin(),
	       other2.boundary[it->first].end(), it->second[i]);
	
	if (bIt == other2.boundary[it->first].end())
	  return false;	
      }      
    }

    return true;
  }


152
153
  void InteriorBoundary::serialize(std::ostream &out)
  {
154
155
    FUNCNAME("InteriorBoundary::serialize()");

156
    int mSize = boundary.size();
157
    SerUtil::serialize(out, mSize);
158
159
160
    for (RankToBoundMap::iterator it = boundary.begin(); it != boundary.end(); ++it) {
      int rank = it->first;
      int boundSize = it->second.size();
161
162
      SerUtil::serialize(out, rank);
      SerUtil::serialize(out, boundSize);
163
164
165
      for (int i = 0; i < boundSize; i++) {
	AtomicBoundary &bound = (it->second)[i];

166
	SerUtil::serialize(out, bound.rankObj.elIndex);
167
	SerUtil::serialize(out, bound.rankObj.elType);
168
169
	SerUtil::serialize(out, bound.rankObj.subObj);
	SerUtil::serialize(out, bound.rankObj.ithObj);
170
	SerUtil::serialize(out, bound.rankObj.reverseMode);
171
	serializeExcludeList(out, bound.rankObj.excludedSubstructures);
172

173
	SerUtil::serialize(out, bound.neighObj.elIndex);
174
	SerUtil::serialize(out, bound.neighObj.elType);
175
176
	SerUtil::serialize(out, bound.neighObj.subObj);
	SerUtil::serialize(out, bound.neighObj.ithObj);
177
	SerUtil::serialize(out, bound.neighObj.reverseMode);
178
	serializeExcludeList(out, bound.neighObj.excludedSubstructures);
179
180

	SerUtil::serialize(out, bound.type);
181
182
      }
    }
183
184
  }

185

186
187
  void InteriorBoundary::deserialize(std::istream &in, 
				     std::map<int, Element*> &elIndexMap)
188
  {
189
190
    FUNCNAME("InteriorBoundary::deserialize()");

191
    int mSize = 0;
192
    SerUtil::deserialize(in, mSize);
193
194
195
    for (int i = 0; i < mSize; i++) {
      int rank = 0;
      int boundSize = 0;
196
197
      SerUtil::deserialize(in, rank);
      SerUtil::deserialize(in, boundSize);
198
199
200
201
202

      boundary[rank].resize(boundSize);
      for (int i = 0; i < boundSize; i++) {
	AtomicBoundary &bound = boundary[rank][i];

203
	SerUtil::deserialize(in, bound.rankObj.elIndex);
204
	SerUtil::deserialize(in, bound.rankObj.elType);
205
206
	SerUtil::deserialize(in, bound.rankObj.subObj);
	SerUtil::deserialize(in, bound.rankObj.ithObj);
207
	SerUtil::deserialize(in, bound.rankObj.reverseMode);
208
	deserializeExcludeList(in, bound.rankObj.excludedSubstructures);
209

210
	SerUtil::deserialize(in, bound.neighObj.elIndex);
211
	SerUtil::deserialize(in, bound.neighObj.elType);
212
213
	SerUtil::deserialize(in, bound.neighObj.subObj);
	SerUtil::deserialize(in, bound.neighObj.ithObj);
214
	SerUtil::deserialize(in, bound.neighObj.reverseMode);
215
	deserializeExcludeList(in, bound.neighObj.excludedSubstructures);
216

217
218
	SerUtil::deserialize(in, bound.type);

219
220
221
222
	TEST_EXIT_DBG(elIndexMap.count(bound.rankObj.elIndex) == 1)
	  ("Cannot find element with index %d for deserialization!\n", 
	   bound.rankObj.elIndex);

223
224
225
	TEST_EXIT_DBG(elIndexMap[bound.rankObj.elIndex]->getIndex() == 
		      bound.rankObj.elIndex)("Should not happen!\n");

226
	bound.rankObj.el = elIndexMap[bound.rankObj.elIndex];
227
228
229
230
231
232
233
234

	// For the case of periodic interior boundaries, a rank may have an boundary
	// with itself. In this case, also the pointer to the neighbour object must
	// be set correctly.
	if (elIndexMap.count(bound.neighObj.elIndex))
	  bound.neighObj.el = elIndexMap[bound.neighObj.elIndex];
	else
	  bound.neighObj.el = NULL;
235
236
      }
    }
237
  }
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267


  void InteriorBoundary::serializeExcludeList(std::ostream &out, ExcludeList &list)
  {
    int size = list.size();
    SerUtil::serialize(out, size);
    for (int i = 0; i < size; i++) {
      SerUtil::serialize(out, list[i].first);
      SerUtil::serialize(out, list[i].second);
    }
  }


  void InteriorBoundary::deserializeExcludeList(std::istream &in, ExcludeList &list)
  {
    int size = 0;
    SerUtil::deserialize(in, size);
    list.resize(0);
    list.reserve(size);

    for (int i = 0; i < size; i++) {
      GeoIndex a;
      int b;

      SerUtil::deserialize(in, a);
      SerUtil::deserialize(in, b);
      list.push_back(std::make_pair(a, b));
    }
  }

268
}