MeshDistributor.cc 62.6 KB
Newer Older
Thomas Witkowski's avatar
Thomas Witkowski committed
1
#include <algorithm>
2
3
#include <iostream>
#include <fstream>
4
5
#include <limits>
#include <stdint.h>
Thomas Witkowski's avatar
Thomas Witkowski committed
6
#include <boost/lexical_cast.hpp>
7
8
#include <boost/filesystem.hpp>

9
#include "parallel/MeshDistributor.h"
10
#include "parallel/MeshManipulation.h"
11
#include "parallel/ParallelDebug.h"
12
#include "parallel/StdMpi.h"
13
#include "parallel/ParMetisPartitioner.h"
14
15
16
#include "io/ElementFileWriter.h"
#include "io/MacroInfo.h"
#include "io/VtkWriter.h"
17
18
19
20
21
#include "Mesh.h"
#include "Traverse.h"
#include "ElInfo.h"
#include "Element.h"
#include "MacroElement.h"
22
23
#include "DOFMatrix.h"
#include "DOFVector.h"
24
#include "SystemVector.h"
25
#include "ElementDofIterator.h"
26
27
#include "ProblemStatBase.h"
#include "StandardProblemIteration.h"
28
#include "VertexVector.h"
29
#include "MeshStructure.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
30
31
#include "ProblemVec.h"
#include "ProblemInstat.h"
32
#include "Debug.h"
33

34
35
namespace AMDiS {

Thomas Witkowski's avatar
Thomas Witkowski committed
36
  using boost::lexical_cast;
37
  using namespace boost::filesystem;
Thomas Witkowski's avatar
Thomas Witkowski committed
38

39
40
41
42
43
  inline bool cmpDofsByValue(const DegreeOfFreedom* dof1, const DegreeOfFreedom* dof2)
  {
    return (*dof1 < *dof2);
  }

44

45
46
47
48
49
50
51
52
  MeshDistributor::MeshDistributor(std::string str)
    : probStat(0),
      name(str),
      feSpace(NULL),
      mesh(NULL),
      refineManager(NULL),
      info(10),
      partitioner(NULL),
53
      nRankDofs(0),
54
      nOverallDofs(0),
55
      rstart(0),
56
      deserialized(false),
57
      writeSerializationFile(false),
58
      repartitioningAllowed(false),
59
      nTimestepsAfterLastRepartitioning(0),
60
      lastMeshChangeIndex(0)
61
  {
62
    FUNCNAME("MeshDistributor::ParalleDomainBase()");
Thomas Witkowski's avatar
Thomas Witkowski committed
63

64
65
66
    mpiRank = MPI::COMM_WORLD.Get_rank();
    mpiSize = MPI::COMM_WORLD.Get_size();
    mpiComm = MPI::COMM_WORLD;
67
68
69
70

    int tmp = 0;
    GET_PARAMETER(0, name + "->repartitioning", "%d", &tmp);
    repartitioningAllowed = (tmp > 0);
71
72
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
73

74
  void MeshDistributor::initParallelization()
75
  {
76
    FUNCNAME("MeshDistributor::initParallelization()");
77
78
79
80

    TEST_EXIT(mpiSize > 1)
      ("Parallelization does not work with only one process!\n");

81
82
    TEST_EXIT(feSpace)("No FE space has been defined for the mesh distributor!\n");
    TEST_EXIT(mesh)("No mesh has been defined for the mesh distributor!\n");
83

84
85
86
    // If the problem has been already read from a file, we need only to set
    // isRankDofs to all matrices and rhs vector and to remove periodic 
    // boundary conditions (if there are some).
87
    if (deserialized) {
88
      setRankDofs();
89
      removePeriodicBoundaryConditions();
90

91
      return;
92
    }
93

94
   
95
96
97
98
99
    // Test, if the mesh is the macro mesh only! Paritioning of the mesh is supported
    // only for macro meshes, so it will not work yet if the mesh is already refined
    // in some way.
    testForMacroMesh();

100
101
102
103
    // For later mesh repartitioning, we need to store some information about the
    // macro mesh.
    createMacroElementInfo();

104
105
    // create an initial partitioning of the mesh
    partitioner->createPartitionData();
106

107
    // set the element weights, which are 1 at the very first begin
108
    setInitialElementWeights();
109
110
111
112
113
114

    // and now partition the mesh    
    partitioner->fillCoarsePartitionVec(&oldPartitionVec);
    partitioner->partition(&elemWeights, INITIAL);
    partitioner->fillCoarsePartitionVec(&partitionVec);

115

Thomas Witkowski's avatar
Thomas Witkowski committed
116
#if (DEBUG != 0)
117
118
    debug::ElementIdxToDofs elMap;
    debug::createSortedDofs(mesh, elMap);
119
120
121
    if (mpiRank == 0) {
      int writePartMesh = 1;
      GET_PARAMETER(0, "dbg->write part mesh", "%d", &writePartMesh);
122

123
124
      if (writePartMesh > 0) {
	debug::writeElementIndexMesh(mesh, "elementIndex.vtu");
125
	writePartitioningMesh("part.vtu");
126
      } else {
127
	MSG("Skip write part mesh!\n");
128
      }
129
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
130
#endif
131

132

133
    // === Create interior boundary information. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
134

135
    createInteriorBoundaryInfo();
Thomas Witkowski's avatar
Thomas Witkowski committed
136

137
#if (DEBUG != 0)
138
    ParallelDebug::printBoundaryInfo(*this);
139
140
#endif

141

Thomas Witkowski's avatar
n  
Thomas Witkowski committed
142
143
144
    // === Remove all macro elements that are not part of the rank partition. ===

    removeMacroElements();
145

Thomas Witkowski's avatar
n  
Thomas Witkowski committed
146

147
148
    // === Create new global and local DOF numbering. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
149

150
151
152
153
154
155
    // We have to remove the VertexVectors, which contain periodic assoiciations, 
    // because they are not valid anymore after some macro elements have been removed
    // and the corresponding DOFs were deleted.
    for (std::map<BoundaryType, VertexVector*>::iterator it = mesh->getPeriodicAssociations().begin();
	 it != mesh->getPeriodicAssociations().end(); ++it)
      const_cast<DOFAdmin&>(mesh->getDofAdmin(0)).removeDOFContainer(dynamic_cast<DOFContainer*>(it->second));
156

157
    updateLocalGlobalNumbering();
158

159

160
161
    // === If in debug mode, make some tests. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
162
#if (DEBUG != 0)
163
    MSG("AMDiS runs in debug mode, so make some test ...\n");
164

165
    ParallelDebug::testAllElements(*this);
166
    debug::testSortedDofs(mesh, elMap);
167
168
    ParallelDebug::testInteriorBoundary(*this);
    ParallelDebug::testCommonDofs(*this, true);
169
    ParallelDebug::testGlobalIndexByCoords(*this);
Thomas Witkowski's avatar
Thomas Witkowski committed
170

171
    debug::writeMesh(feSpace, -1, "macro_mesh");   
172
173

    MSG("Debug mode tests finished!\n");
174
#endif
175

176

177
178
    // === Create periodic dof mapping, if there are periodic boundaries. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
179
    createPeriodicMap();    
180

181
    // === Global refinements. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
182

Thomas Witkowski's avatar
Thomas Witkowski committed
183
    int globalRefinement = 0;
184
    GET_PARAMETER(0, mesh->getName() + "->global refinements", "%d", &globalRefinement);
Thomas Witkowski's avatar
Thomas Witkowski committed
185

Thomas Witkowski's avatar
Thomas Witkowski committed
186
    if (globalRefinement > 0) {
187
      refineManager->globalRefine(mesh, globalRefinement);
188

189
#if (DEBUG != 0)
190
      debug::writeMesh(feSpace, -1, "gr_mesh");
191
192
#endif

193
      updateLocalGlobalNumbering();
194
195

     
196
      // === Update periodic mapping, if there are periodic boundaries. ===
197
      
198
      createPeriodicMap();
Thomas Witkowski's avatar
Thomas Witkowski committed
199
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
200

201

Thomas Witkowski's avatar
Thomas Witkowski committed
202
203
    /// === Set DOF rank information to all matrices and vectors. ===

204
    setRankDofs();
Thomas Witkowski's avatar
Thomas Witkowski committed
205

206

Thomas Witkowski's avatar
Thomas Witkowski committed
207
208
    // === Remove periodic boundary conditions in sequential problem definition. ===

209
    removePeriodicBoundaryConditions();
210
211
  }

212

213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
  void MeshDistributor::addProblemStat(ProblemVec *probVec)
  {
    FUNCNAME("MeshDistributor::addProblemVec()");

    if (feSpace != NULL) {
      std::vector<FiniteElemSpace*> feSpaces = probVec->getFeSpaces();
      for (unsigned int i = 0; i < feSpaces.size(); i++) {
	TEST_EXIT(feSpace == feSpaces[i])
	  ("Parallelizaton is not supported for multiple FE spaces!\n");
      }
    } else {
      feSpace = probVec->getFeSpace(0);
      mesh = feSpace->getMesh();
      info = probVec->getInfo();
      
      TEST_EXIT(mesh->getNumberOfDOFAdmin() == 1)
	("Only meshes with one DOFAdmin are supported!\n");
230
      TEST_EXIT(mesh->getDofAdmin(0).getNumberOfPreDOFs(0) == 0)
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
	("Wrong pre dof number for DOFAdmin!\n");
      
      switch (mesh->getDim()) {
      case 2:
	refineManager = new RefinementManager2d();
	break;
      case 3:
	refineManager = new RefinementManager3d();
	break;
      default:
	ERROR_EXIT("This should not happen for dim = %d!\n", mesh->getDim());
      }

      partitioner = new ParMetisPartitioner(mesh, &mpiComm);
    }

    // Create parallel serialization file writer, if needed.
    int writeSerialization = 0;
249
250
251
    GET_PARAMETER(0, probVec->getName() + "->output->write serialization", "%d", 
		  &writeSerialization);
    if (writeSerialization && !writeSerializationFile) {
252
253
254
255
256
      std::string filename = "";
      GET_PARAMETER(0, name + "->output->serialization filename", &filename);
      
      TEST_EXIT(filename != "")
	("No filename defined for parallel serialization file!\n");
257
258
259
260
261

      int tsModulo = -1;
      GET_PARAMETER(0, probVec->getName() + "->output->write every i-th timestep", 
		    "%d", &tsModulo);
      
262
      probVec->getFileWriterList().push_back(new Serializer<MeshDistributor>(this, filename, tsModulo));
263
264
      writeSerializationFile = true;
    }    
265
266

    int readSerialization = 0;
267
268
    GET_PARAMETER(0, probVec->getName() + "->input->read serialization", "%d", 
		  &readSerialization);
269
270
271
272
    if (readSerialization) {
      std::string filename = "";
      GET_PARAMETER(0, probVec->getName() + "->input->serialization filename", &filename);
      filename += ".p" + lexical_cast<std::string>(mpiRank);
273
      MSG("Start deserialization with %s\n", filename.c_str());
274
      std::ifstream in(filename.c_str());
275
276
277
278

      TEST_EXIT(!in.fail())("Could not open deserialization file: %s\n",
			    filename.c_str());

279
      probVec->deserialize(in);
280
      in.close();
281
282
      MSG("Deserialization from file: %s\n", filename.c_str());

283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
      filename = "";
      GET_PARAMETER(0, name + "->input->serialization filename", &filename);
      
      TEST_EXIT(filename != "")
	("No filename defined for parallel deserialization file!\n");
      
      std::string rankFilename = filename + ".p" + lexical_cast<std::string>(mpiRank);
      in.open(rankFilename.c_str());
      
      TEST_EXIT(!in.fail())("Could not open parallel deserialization file: %s\n",
			    filename.c_str());
      
      deserialize(in);
      in.close();
      MSG("Deserializtion of mesh distributor from file: %s\n", rankFilename.c_str());
      deserialized = true;
299
300
301
302
303
304
    }

    probStat.push_back(probVec);
  }


305
  void MeshDistributor::exitParallelization()
306
  {}
307

308
  
309
  void MeshDistributor::testForMacroMesh()
310
  {
311
    FUNCNAME("MeshDistributor::testForMacroMesh()");
312
313
314
315
316
317
318

    int nMacroElements = 0;

    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(mesh, -1, Mesh::CALL_LEAF_EL);
    while (elInfo) {
      TEST_EXIT(elInfo->getLevel() == 0)
319
	("Mesh is already refined! This does not work with parallelization!\n");
320
321
322

      TEST_EXIT(elInfo->getType() == 0)
	("Only macro elements with level 0 are supported!\n");
323
324
325
326
327
328
329
330
331
332
      
      nMacroElements++;

      elInfo = stack.traverseNext(elInfo);
    }

    TEST_EXIT(nMacroElements >= mpiSize)
      ("The mesh has less macro elements than number of mpi processes!\n");
  }

333

334
  void MeshDistributor::synchVector(DOFVector<double> &vec)
335
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
336
    StdMpi<std::vector<double> > stdMpi(mpiComm);
337
338

    for (RankToDofContainer::iterator sendIt = sendDofs.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
339
	 sendIt != sendDofs.end(); ++sendIt) {
340
      std::vector<double> dofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
341
342
      int nSendDofs = sendIt->second.size();
      dofs.reserve(nSendDofs);
343
      
Thomas Witkowski's avatar
Thomas Witkowski committed
344
345
      for (int i = 0; i < nSendDofs; i++)
	dofs.push_back(vec[*((sendIt->second)[i])]);
346
347
348
349

      stdMpi.send(sendIt->first, dofs);
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
350
351
352
    for (RankToDofContainer::iterator recvIt = recvDofs.begin();
	 recvIt != recvDofs.end(); ++recvIt)
      stdMpi.recv(recvIt->first, recvIt->second.size());
353

Thomas Witkowski's avatar
Thomas Witkowski committed
354
    stdMpi.startCommunication<double>(MPI_DOUBLE);
355

Thomas Witkowski's avatar
Thomas Witkowski committed
356
357
358
359
360
    for (RankToDofContainer::iterator recvIt = recvDofs.begin();
	 recvIt != recvDofs.end(); ++recvIt)
      for (unsigned int i = 0; i < recvIt->second.size(); i++)
	vec[*(recvIt->second)[i]] = stdMpi.getRecvData(recvIt->first)[i];
  }
361
362


363
  void MeshDistributor::synchVector(SystemVector &vec)
Thomas Witkowski's avatar
Thomas Witkowski committed
364
  {
365
    int nComponents = vec.getSize();
Thomas Witkowski's avatar
Thomas Witkowski committed
366
367
368
369
370
371
372
373
374
375
376
377
    StdMpi<std::vector<double> > stdMpi(mpiComm);

    for (RankToDofContainer::iterator sendIt = sendDofs.begin();
	 sendIt != sendDofs.end(); ++sendIt) {
      std::vector<double> dofs;
      int nSendDofs = sendIt->second.size();
      dofs.reserve(nComponents * nSendDofs);
      
      for (int i = 0; i < nComponents; i++) {
	DOFVector<double> *dofvec = vec.getDOFVector(i);
	for (int j = 0; j < nSendDofs; j++)
	  dofs.push_back((*dofvec)[*((sendIt->second)[j])]);
378
379
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
380
      stdMpi.send(sendIt->first, dofs);
381
382
383
    }

    for (RankToDofContainer::iterator recvIt = recvDofs.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
384
385
	 recvIt != recvDofs.end(); ++recvIt)
      stdMpi.recv(recvIt->first, recvIt->second.size() * nComponents);
386

Thomas Witkowski's avatar
Thomas Witkowski committed
387
    stdMpi.startCommunication<double>(MPI_DOUBLE);
388
389

    for (RankToDofContainer::iterator recvIt = recvDofs.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
390
391
	 recvIt != recvDofs.end(); ++recvIt) {
      int nRecvDofs = recvIt->second.size();
392
393

      int counter = 0;
Thomas Witkowski's avatar
Thomas Witkowski committed
394
395
396
397
398
      for (int i = 0; i < nComponents; i++) {
	DOFVector<double> *dofvec = vec.getDOFVector(i);
 	for (int j = 0; j < nRecvDofs; j++)
	  (*dofvec)[*(recvIt->second)[j]] = 
	    stdMpi.getRecvData(recvIt->first)[counter++];
399
400
401
402
      }
    }
  }

403

404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
  void MeshDistributor::setRankDofs()
  {
    for (unsigned int i = 0; i < probStat.size(); i++) {
      int nComponents = probStat[i]->getNumComponents();
      for (int j = 0; j < nComponents; j++) {
	for (int k = 0; k < nComponents; k++)
	  if (probStat[i]->getSystemMatrix(j, k))
	    probStat[i]->getSystemMatrix(j, k)->setRankDofs(isRankDof);

	TEST_EXIT_DBG(probStat[i]->getRhs()->getDOFVector(j))("No RHS vector!\n");
	TEST_EXIT_DBG(probStat[i]->getSolution()->getDOFVector(j))("No solution vector!\n");
	
	probStat[i]->getRhs()->getDOFVector(j)->setRankDofs(isRankDof);
	probStat[i]->getSolution()->getDOFVector(j)->setRankDofs(isRankDof);
      }
    }
  }


423
424
  void MeshDistributor::removePeriodicBoundaryConditions()
  {
425
426
    FUNCNAME("MeshDistributor::removePeriodicBoundaryConditions()");

427
428
429
430
431
432
433
434
    // Remove periodic boundaries in boundary manager on matrices and vectors.
    for (unsigned int i = 0; i < probStat.size(); i++) {
      int nComponents = probStat[i]->getNumComponents();

      for (int j = 0; j < nComponents; j++) {
	for (int k = 0; k < nComponents; k++) {
	  DOFMatrix* mat = probStat[i]->getSystemMatrix(j, k);
	  if (mat && mat->getBoundaryManager())
435
	    removePeriodicBoundaryConditions(const_cast<BoundaryIndexMap&>(mat->getBoundaryManager()->getBoundaryConditionMap()));
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
	}
	
	if (probStat[i]->getSolution()->getDOFVector(j)->getBoundaryManager())
	  removePeriodicBoundaryConditions(const_cast<BoundaryIndexMap&>(probStat[i]->getSolution()->getDOFVector(j)->getBoundaryManager()->getBoundaryConditionMap()));
	
	if (probStat[i]->getRhs()->getDOFVector(j)->getBoundaryManager())
	  removePeriodicBoundaryConditions(const_cast<BoundaryIndexMap&>(probStat[i]->getRhs()->getDOFVector(j)->getBoundaryManager()->getBoundaryConditionMap()));
      }
    }

    // Remove periodic boundaries on elements in mesh.
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(mesh,  -1, Mesh::CALL_EVERY_EL_PREORDER);
    while (elInfo) {
      elInfo->getElement()->deleteElementData(PERIODIC);
      elInfo = stack.traverseNext(elInfo);
    }    
453
454
455

    // Remove periodic vertex associations
    mesh->getPeriodicAssociations().clear();
456
457
458
459
  }


  void MeshDistributor::removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap)
Thomas Witkowski's avatar
Thomas Witkowski committed
460
461
462
463
464
465
466
467
468
469
470
  {
    BoundaryIndexMap::iterator it = boundaryMap.begin();
    while (it != boundaryMap.end()) {
      if (it->second->isPeriodic())
	boundaryMap.erase(it++);
      else
	++it;      
    }    
  }


471
  void MeshDistributor::checkMeshChange()
472
  {
473
    FUNCNAME("MeshDistributor::checkMeshChange()");    
474

475
476
477
478
#if (DEBUG != 0)
    debug::writeMesh(feSpace, -1, "before_check_mesh");
#endif

479
480
481
482
483
    // === If mesh has not been changed on all ranks, return. ===

    int recvAllValues = 0;
    int sendValue = static_cast<int>(mesh->getChangeIndex() != lastMeshChangeIndex);
    mpiComm.Allreduce(&sendValue, &recvAllValues, 1, MPI_INT, MPI_SUM);
484

485
    if (recvAllValues == 0)
486
487
      return;

488
489
    // === At least one rank mesh has been changed, so the boundaries must be ===
    // === adapted to the new mesh structure.                                 ===
490

491
492
493
494
495
    clock_t first = clock();
    
    do {
      // To check the interior boundaries, the ownership of the boundaries is not 
      // important. Therefore, we add all boundaries to one boundary container.
496
      RankToBoundMap allBound;
Thomas Witkowski's avatar
Thomas Witkowski committed
497
498

      for (InteriorBoundary::iterator it(myIntBoundary); !it.end(); ++it)
499
500
	if ((mesh->getDim() == 2 && it->rankObj.subObj == EDGE) || 
	    (mesh->getDim() == 3 && it->rankObj.subObj == FACE))
501
 	  allBound[it.getRank()].push_back(*it);
Thomas Witkowski's avatar
Thomas Witkowski committed
502
503

      for (InteriorBoundary::iterator it(otherIntBoundary); !it.end(); ++it)
504
505
	if ((mesh->getDim() == 2 && it->rankObj.subObj == EDGE) || 
	    (mesh->getDim() == 3 && it->rankObj.subObj == FACE))
506
	  allBound[it.getRank()].push_back(*it);
Thomas Witkowski's avatar
Thomas Witkowski committed
507

508
      for (InteriorBoundary::iterator it(periodicBoundary); !it.end(); ++it)
509
510
	if ((mesh->getDim() == 2 && it->rankObj.subObj == EDGE) || 
	    (mesh->getDim() == 3 && it->rankObj.subObj == FACE))
511
 	  allBound[it.getRank()].push_back(*it);	
512

513

514
      // === Check the boundaries and adapt mesh if necessary. ===
515
516
517
518
#if (DEBUG != 0)
      MSG("Run checkAndAdaptBoundary ...\n");
#endif

519
520
521
522
523
524
525
      bool meshChanged = checkAndAdaptBoundary(allBound);

      // === Check on all ranks if at least one rank's mesh has changed. ===

      int sendValue = static_cast<int>(!meshChanged);
      recvAllValues = 0;
      mpiComm.Allreduce(&sendValue, &recvAllValues, 1, MPI_INT, MPI_SUM);
526
527
528
529

#if (DEBUG != 0)
      MSG("Mesh changed on %d ranks!\n", recvAllValues);
#endif
530
    } while (recvAllValues != 0);
531

532
#if (DEBUG != 0)
533
    debug::writeMesh(feSpace, -1, "mesh");
534
535
536
537
538
539
#endif

    INFO(info, 8)("Parallel mesh adaption needed %.5f seconds\n", 
		  TIME_USED(first, clock()));

    // === Because the mesh has been changed, update the DOF numbering and mappings. ===
540

541
542
    updateLocalGlobalNumbering();

543
544
545
546

    // === Update periodic mapping, if there are periodic boundaries. ===

    createPeriodicMap();
547
548
549
550


    // === The mesh has changed, so check if it is required to repartition the mesh. ===

551
552
553
554
555
556
557
558
    nTimestepsAfterLastRepartitioning++;

    if (repartitioningAllowed) {
      if (nTimestepsAfterLastRepartitioning >= 20) {
	repartitionMesh();
	nTimestepsAfterLastRepartitioning = 0;
      }
    }
559
560
561
  }

  
562
  bool MeshDistributor::checkAndAdaptBoundary(RankToBoundMap &allBound)
563
  {
564
    FUNCNAME("MeshDistributor::checkAndAdaptBoundary()");
565
566
567
568
569
570

    // === Create mesh structure codes for all ranks boundary elements. ===
       
    std::map<int, MeshCodeVec> sendCodes;
   
    for (RankToBoundMap::iterator it = allBound.begin(); it != allBound.end(); ++it) {
571

572
573
574
      for (std::vector<AtomicBoundary>::iterator boundIt = it->second.begin();
	   boundIt != it->second.end(); ++boundIt) {
	MeshStructure elCode;
575
	elCode.init(boundIt->rankObj);
576
577
578
579
	sendCodes[it->first].push_back(elCode);
      }
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
580
    StdMpi<MeshCodeVec> stdMpi(mpiComm, true);
581
    stdMpi.send(sendCodes);
582
    stdMpi.recv(allBound);
583
    stdMpi.startCommunication<uint64_t>(MPI_UNSIGNED_LONG);
584
 
585
    // === Compare received mesh structure codes. ===
586
    
587
588
    bool meshFitTogether = true;

589
    for (RankToBoundMap::iterator it = allBound.begin(); it != allBound.end(); ++it) {
590
     
591
592
      MeshCodeVec &recvCodes = stdMpi.getRecvData()[it->first];
      int i = 0;
593
      
594
595
      for (std::vector<AtomicBoundary>::iterator boundIt = it->second.begin();
	   boundIt != it->second.end(); ++boundIt) {
596

597
598
	MeshStructure elCode;	
	elCode.init(boundIt->rankObj);
599

600
601
	if (elCode.getCode() != recvCodes[i].getCode()) {
	  TEST_EXIT_DBG(refineManager)("Refinement manager is not set correctly!\n");
602

603
604
605
606
607
608
	  bool b = startFitElementToMeshCode(recvCodes[i], 
					     boundIt->rankObj.el,
					     boundIt->rankObj.subObj,
					     boundIt->rankObj.ithObj, 
					     boundIt->rankObj.elType,
					     boundIt->rankObj.reverseMode);
609

610
	  if (b)
611
	    meshFitTogether = false;	  
612
 	}
613

614
	i++;
615
616
617
      }
    }

618
    return meshFitTogether;
619
  }
620
621


622
623
624
625
626
627
  bool MeshDistributor::startFitElementToMeshCode(MeshStructure &code, 
						  Element *el, 
						  GeoIndex subObj,
						  int ithObj, 
						  int elType,
						  bool reverseMode)
628
  {
629
    FUNCNAME("MeshDistributor::startFitElementToMeshCode()");
630

631
632
    TEST_EXIT_DBG(el)("No element given!\n");

633
634
    // If the code is empty, the element does not matter and the function can
    // return without chaning the mesh.
635
636
    if (code.empty())
      return false;
637

638
639
640
641
642
    // s0 and s1 are the number of the edge/face in both child of the element,
    // which contain the edge/face the function has to traverse through. If the
    // edge/face is not contained in one of the children, s0 or s1 is -1.
    int s0 = el->getSubObjOfChild(0, subObj, ithObj, elType);
    int s1 = el->getSubObjOfChild(1, subObj, ithObj, elType);
643

644
    TEST_EXIT_DBG(s0 != -1 || s1 != -1)("This should not happen!\n");
645

646
    bool meshChanged = false;
647
648
649
    Flag traverseFlag = 
      Mesh::CALL_EVERY_EL_PREORDER | Mesh::FILL_NEIGH | Mesh::FILL_BOUND;

650
651
652
653
654
    // Test for reverse mode, in which the left and right children of elements
    // are flipped.
    if (reverseMode)
      traverseFlag |= Mesh::CALL_REVERSE_MODE;    

655

656
657
658
659
660
    // === If the edge/face is contained in both children. ===

    if (s0 != -1 && s1 != -1) {
      // Create traverse stack and traverse within the mesh until the element,
      // which should be fitted to the mesh structure code, is reached.
661
      TraverseStack stack;
662
      ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
663
664
      while (elInfo && elInfo->getElement() != el)
	elInfo = stack.traverseNext(elInfo);      
665

666
667
      TEST_EXIT_DBG(elInfo->getElement() == el)("This should not happen!\n");

668
      meshChanged = fitElementToMeshCode(code, stack, subObj, ithObj, reverseMode);
669
670
      return meshChanged;
    }
671

672
673
674

    // === The edge/face is contained in only on of the both children. ===

675
    if (el->isLeaf()) {
676
677

      // If element is leaf and code contains only one leaf element, we are finished.
678
679
680
      if (code.getNumElements() == 1 && code.isLeafElement())
	return false;     

681
      // Create traverse stack and traverse the mesh to the element.
682
      TraverseStack stack;
683
      ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
684
685
      while (elInfo && elInfo->getElement() != el)
	elInfo = stack.traverseNext(elInfo);      
686
687
688

      TEST_EXIT_DBG(elInfo)("This should not happen!\n");

689
      // Code is not leaf, therefore refine the element.
690
      el->setMark(1);
691
692
      refineManager->setMesh(el->getMesh());
      refineManager->setStack(&stack);
693
      refineManager->refineFunction(elInfo);
694
      meshChanged = true;
695
    }
696

697
698
    Element *child0 = el->getFirstChild();
    Element *child1 = el->getSecondChild();
699
700
701
702
    if (reverseMode) {
      std::swap(s0, s1);
      std::swap(child0, child1);    
    }
703

704
705
706
    // === We know that the edge/face is contained in only one of the children. ===
    // === Therefore, traverse the mesh to this children and fit this element   ===
    // === To the mesh structure code.                                          ===
707

708
709
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
710

711
712
713
    if (s0 != -1) {
      while (elInfo && elInfo->getElement() != child0)
	elInfo = stack.traverseNext(elInfo);     
714

715
716
717
718
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s0, reverseMode);
    } else {
      while (elInfo && elInfo->getElement() != child1) 
	elInfo = stack.traverseNext(elInfo);      
719

720
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
721
722
    }

723

724
    return meshChanged;
725
726
  }

727

728
729
730
731
732
  bool MeshDistributor::fitElementToMeshCode(MeshStructure &code, 
					     TraverseStack &stack,
					     GeoIndex subObj,
					     int ithObj, 
					     bool reverseMode)
733
  {
734
735
736
737
    FUNCNAME("MeshDistributor::fitElementToMeshCode()");


    // === Test if there are more elements in stack to check with the code. ===
738

739
740
    ElInfo *elInfo = stack.getElInfo();
    if (!elInfo)
741
      return false;
742

743
744
745
746

    // === Test if code contains a leaf element. If this is the case, the ===
    // === current element is finished. Traverse the mesh to the next     ===
    // === coarser element.                                               ===
747
748
749
750
751
752
753

    if (code.isLeafElement()) {
      int level = elInfo->getLevel();

      do {
	elInfo = stack.traverseNext(elInfo);
      } while (elInfo && elInfo->getLevel() > level);
754

755
      return false;
756
    }
757

758
759
760
761
762
763

    bool meshChanged = false;
    Element *el = elInfo->getElement();


    // === If element is leaf (and the code is not), refine the element. ===
764

765
    if (el->isLeaf()) {
766
767
      TEST_EXIT_DBG(elInfo->getLevel() < 255)("This should not happen!\n");

768
      el->setMark(1);
769
770
      refineManager->setMesh(el->getMesh());
      refineManager->setStack(&stack);
771
      refineManager->refineFunction(elInfo);
772
      meshChanged = true;
773
774
    }

775
776
777
778
779
780

    // === Continue fitting the mesh structure code to the children of the ===
    // === current element.                                                ===

    int s0 = el->getSubObjOfChild(0, subObj, ithObj, elInfo->getType());
    int s1 = el->getSubObjOfChild(1, subObj, ithObj, elInfo->getType());
781
782
783
    Element *child0 = el->getFirstChild();
    Element *child1 = el->getSecondChild();
    if (reverseMode) {
784
      std::swap(s0, s1);
785
786
      std::swap(child0, child1);
    }
787

788
789
790
791
792
793
794
    
    // === Traverse left child. ===

    if (s0 != -1) {
      // The edge/face is contained in the left child, therefore fit this
      // child to the mesh structure code.

795
      stack.traverseNext(elInfo);
796
      code.nextElement();
797
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s0, reverseMode);
798
799
      elInfo = stack.getElInfo();
    } else {
800
801
802
803
      // The edge/face is not contained in the left child. Hence we need
      // to traverse through all subelements of the left child until we get
      // the second child of the current element.

804
805
      do {
	elInfo = stack.traverseNext(elInfo);
806
807
808
      } while (elInfo && elInfo->getElement() != child1); 

      TEST_EXIT_DBG(elInfo != NULL)("This should not happen!\n");
809
810
    }  

811
812
813
814
815
816
817
818
819
820
    TEST_EXIT_DBG(elInfo->getElement() == child1)
      ("Got wrong child with idx = %d! Searched for child idx = %d\n",
       elInfo->getElement()->getIndex(), child1->getIndex());


    // === Traverse right child. ===

    if (s1 != -1) {
      // The edge/face is contained in the right child, therefore fit this
      // child to the mesh structure code.
821
822

      code.nextElement();
823
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
824
    } else {
825
826
827
828
      // The edge/face is not contained in the right child. Hence we need
      // to traverse through all subelements of the right child until we have
      // finished traversing the current element with all its subelements.

829
      int level = elInfo->getLevel();
830

831
832
833
834
      do {
	elInfo = stack.traverseNext(elInfo);
      } while (elInfo && elInfo->getLevel() > level);
    }
835

836
837

    return meshChanged;
838
839
  }

840
  
841
  void MeshDistributor::serialize(std::ostream &out, DofContainer &data)
Thomas Witkowski's avatar
Thomas Witkowski committed
842
  {    
843
    int vecSize = data.size();
844
    SerUtil::serialize(out, vecSize);
845
846
    for (int i = 0; i < vecSize; i++) {
      int dofIndex = (*data[i]);
847
      SerUtil::serialize(out, dofIndex);
848
849
850
851
    }
  }


852
  void MeshDistributor::deserialize(std::istream &in, DofContainer &data,
853
				    std::map<int, const DegreeOfFreedom*> &dofMap)
854
  {
855
    FUNCNAME("MeshDistributor::deserialize()");
856
857

    int vecSize = 0;
858
    SerUtil::deserialize(in, vecSize);
859
    data.clear();
860
861
862
    data.resize(vecSize);
    for (int i = 0; i < vecSize; i++) {
      int dofIndex = 0;
863
      SerUtil::deserialize(in, dofIndex);
864
865
866
867
868
869
870
871
872

      TEST_EXIT_DBG(dofMap.count(dofIndex) != 0)
	("Dof index could not be deserialized correctly!\n");

      data[i] = dofMap[dofIndex];
    }
  }


873
  void MeshDistributor::serialize(std::ostream &out, RankToDofContainer &data)
874
875
  {
    int mapSize = data.size();
Thomas Witkowski's avatar