MeshDistributor.cc 65.9 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
      repartCounter(0),
61
      debugOutputDir(""),
62
      lastMeshChangeIndex(0)
63
  {
64
    FUNCNAME("MeshDistributor::ParalleDomainBase()");
Thomas Witkowski's avatar
Thomas Witkowski committed
65

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

    int tmp = 0;
    GET_PARAMETER(0, name + "->repartitioning", "%d", &tmp);
    repartitioningAllowed = (tmp > 0);
73
74

    GET_PARAMETER(0, name + "->debug output dir", &debugOutputDir);    
75
76
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
77

78
  void MeshDistributor::initParallelization()
79
  {
80
    FUNCNAME("MeshDistributor::initParallelization()");
81
82
83
84

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

85
86
    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");
87

88
89
90
    // 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).
91
    if (deserialized) {
92
93
      updateMacroElementInfo();

94
      setRankDofs();
95

96
      removePeriodicBoundaryConditions();
97

98
99
      macroElIndexMap.clear();
      macroElIndexTypeMap.clear();
100
101
102
103
104

      std::map<int, bool>& elementInRank = partitioner->getElementInRank();
      for (std::vector<MacroElement*>::iterator it = allMacroElements.begin();
	   it != allMacroElements.end(); ++it) {
	elementInRank[(*it)->getIndex()] = false;
105
106
107
108
	macroElIndexMap[(*it)->getIndex()] = (*it)->getElement();
	macroElIndexTypeMap[(*it)->getIndex()] = (*it)->getElType();
      }

109
110
111
112
      for (std::deque<MacroElement*>::iterator it = mesh->getMacroElements().begin();
	   it != mesh->getMacroElements().end(); ++it)
	elementInRank[(*it)->getIndex()] = true;      

113
      return;
114
    }
115

116
   
117
118
119
120
121
    // 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();

122
123
124
125
    // For later mesh repartitioning, we need to store some information about the
    // macro mesh.
    createMacroElementInfo();

126
127
    // create an initial partitioning of the mesh
    partitioner->createPartitionData();
128

129
    // set the element weights, which are 1 at the very first begin
130
    setInitialElementWeights();
131
132
133
134
135
136

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

137

Thomas Witkowski's avatar
Thomas Witkowski committed
138
#if (DEBUG != 0)
139
140
    debug::ElementIdxToDofs elMap;
    debug::createSortedDofs(mesh, elMap);
141
142
143
    if (mpiRank == 0) {
      int writePartMesh = 1;
      GET_PARAMETER(0, "dbg->write part mesh", "%d", &writePartMesh);
144

145
      if (writePartMesh > 0) {
146
147
	debug::writeElementIndexMesh(mesh, debugOutputDir + "elementIndex.vtu");
	writePartitioningMesh(debugOutputDir + "part.vtu");
148
      } else {
149
	MSG("Skip write part mesh!\n");
150
      }
151
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
152
#endif
153

154

155
    // === Create interior boundary information. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
156

157
    createInteriorBoundaryInfo();
Thomas Witkowski's avatar
Thomas Witkowski committed
158

159
#if (DEBUG != 0)
160
    ParallelDebug::printBoundaryInfo(*this);
161
162
#endif

163

Thomas Witkowski's avatar
n  
Thomas Witkowski committed
164
165
166
    // === Remove all macro elements that are not part of the rank partition. ===

    removeMacroElements();
167

Thomas Witkowski's avatar
n  
Thomas Witkowski committed
168

169
170
    // === Create new global and local DOF numbering. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
171

172
173
174
175
176
177
    // 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));
178

179
    updateLocalGlobalNumbering();
180

181

182
183
    // === If in debug mode, make some tests. ===

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

187
    ParallelDebug::testAllElements(*this);
188
    debug::testSortedDofs(mesh, elMap);
189
190
    ParallelDebug::testInteriorBoundary(*this);
    ParallelDebug::testCommonDofs(*this, true);
191
    ParallelDebug::testGlobalIndexByCoords(*this);
Thomas Witkowski's avatar
Thomas Witkowski committed
192

193
    debug::writeMesh(feSpace, -1, debugOutputDir + "macro_mesh");   
194
195

    MSG("Debug mode tests finished!\n");
196
#endif
197

198

199
200
    // === Create periodic dof mapping, if there are periodic boundaries. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
201
    createPeriodicMap();    
202

203
    // === Global refinements. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
204

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

Thomas Witkowski's avatar
Thomas Witkowski committed
208
    if (globalRefinement > 0) {
209
      refineManager->globalRefine(mesh, globalRefinement);
210

211
      updateLocalGlobalNumbering();
212
213

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

216
      createPeriodicMap();
Thomas Witkowski's avatar
Thomas Witkowski committed
217
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
218

219

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

222
    setRankDofs();
Thomas Witkowski's avatar
Thomas Witkowski committed
223

224

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

227
    removePeriodicBoundaryConditions();
228
229
  }

230

231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
  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");
248
      TEST_EXIT(mesh->getDofAdmin(0).getNumberOfPreDOFs(0) == 0)
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
	("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;
267
268
269
    GET_PARAMETER(0, probVec->getName() + "->output->write serialization", "%d", 
		  &writeSerialization);
    if (writeSerialization && !writeSerializationFile) {
270
271
272
273
274
      std::string filename = "";
      GET_PARAMETER(0, name + "->output->serialization filename", &filename);
      
      TEST_EXIT(filename != "")
	("No filename defined for parallel serialization file!\n");
275
276
277
278
279

      int tsModulo = -1;
      GET_PARAMETER(0, probVec->getName() + "->output->write every i-th timestep", 
		    "%d", &tsModulo);
      
280
      probVec->getFileWriterList().push_back(new Serializer<MeshDistributor>(this, filename, tsModulo));
281
282
      writeSerializationFile = true;
    }    
283
284

    int readSerialization = 0;
285
286
    GET_PARAMETER(0, probVec->getName() + "->input->read serialization", "%d", 
		  &readSerialization);
287
288
289
290
    if (readSerialization) {
      std::string filename = "";
      GET_PARAMETER(0, probVec->getName() + "->input->serialization filename", &filename);
      filename += ".p" + lexical_cast<std::string>(mpiRank);
291
      MSG("Start deserialization with %s\n", filename.c_str());
292
      std::ifstream in(filename.c_str());
293
294
295
296

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

297
      probVec->deserialize(in);
298
      in.close();
299
300
      MSG("Deserialization from file: %s\n", filename.c_str());

301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
      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;
317
318
319
320
321
322
    }

    probStat.push_back(probVec);
  }


323
  void MeshDistributor::exitParallelization()
324
  {}
325

326
  
327
  void MeshDistributor::testForMacroMesh()
328
  {
329
    FUNCNAME("MeshDistributor::testForMacroMesh()");
330
331
332
333
334
335
336

    int nMacroElements = 0;

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

      TEST_EXIT(elInfo->getType() == 0)
	("Only macro elements with level 0 are supported!\n");
341
342
343
344
345
346
347
348
349
350
      
      nMacroElements++;

      elInfo = stack.traverseNext(elInfo);
    }

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

351

352
  void MeshDistributor::synchVector(DOFVector<double> &vec)
353
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
354
    StdMpi<std::vector<double> > stdMpi(mpiComm);
355
356

    for (RankToDofContainer::iterator sendIt = sendDofs.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
357
	 sendIt != sendDofs.end(); ++sendIt) {
358
      std::vector<double> dofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
359
360
      int nSendDofs = sendIt->second.size();
      dofs.reserve(nSendDofs);
361
      
Thomas Witkowski's avatar
Thomas Witkowski committed
362
363
      for (int i = 0; i < nSendDofs; i++)
	dofs.push_back(vec[*((sendIt->second)[i])]);
364
365
366
367

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

Thomas Witkowski's avatar
Thomas Witkowski committed
368
369
370
    for (RankToDofContainer::iterator recvIt = recvDofs.begin();
	 recvIt != recvDofs.end(); ++recvIt)
      stdMpi.recv(recvIt->first, recvIt->second.size());
371

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

Thomas Witkowski's avatar
Thomas Witkowski committed
374
375
376
377
378
    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];
  }
379
380


381
  void MeshDistributor::synchVector(SystemVector &vec)
Thomas Witkowski's avatar
Thomas Witkowski committed
382
  {
383
    int nComponents = vec.getSize();
Thomas Witkowski's avatar
Thomas Witkowski committed
384
385
386
387
388
389
390
391
392
393
394
395
    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])]);
396
397
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
398
      stdMpi.send(sendIt->first, dofs);
399
400
401
    }

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

Thomas Witkowski's avatar
Thomas Witkowski committed
405
    stdMpi.startCommunication<double>(MPI_DOUBLE);
406
407

    for (RankToDofContainer::iterator recvIt = recvDofs.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
408
409
	 recvIt != recvDofs.end(); ++recvIt) {
      int nRecvDofs = recvIt->second.size();
410
411

      int counter = 0;
Thomas Witkowski's avatar
Thomas Witkowski committed
412
413
414
415
416
      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++];
417
418
419
420
      }
    }
  }

421

422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
  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);
      }
    }
  }


441
442
  void MeshDistributor::removePeriodicBoundaryConditions()
  {
443
444
    FUNCNAME("MeshDistributor::removePeriodicBoundaryConditions()");

445
446
447
448
449
450
451
452
    // 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())
453
	    removePeriodicBoundaryConditions(const_cast<BoundaryIndexMap&>(mat->getBoundaryManager()->getBoundaryConditionMap()));
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
	}
	
	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);
    }    
471
472
473

    // Remove periodic vertex associations
    mesh->getPeriodicAssociations().clear();
474
475
476
477
  }


  void MeshDistributor::removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap)
Thomas Witkowski's avatar
Thomas Witkowski committed
478
479
480
481
482
483
484
485
486
487
488
  {
    BoundaryIndexMap::iterator it = boundaryMap.begin();
    while (it != boundaryMap.end()) {
      if (it->second->isPeriodic())
	boundaryMap.erase(it++);
      else
	++it;      
    }    
  }


489
  void MeshDistributor::checkMeshChange()
490
  {
491
    FUNCNAME("MeshDistributor::checkMeshChange()");    
492

493
#if (DEBUG != 0)
494
    debug::writeMesh(feSpace, -1, debugOutputDir + "before_check_mesh");
495
496
#endif

497
498
499
500
501
    // === 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);
502

503
    if (recvAllValues == 0)
504
505
      return;

506
507
    // === At least one rank mesh has been changed, so the boundaries must be ===
    // === adapted to the new mesh structure.                                 ===
508

509
510
511
512
513
    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.
514
      RankToBoundMap allBound;
Thomas Witkowski's avatar
Thomas Witkowski committed
515
516

      for (InteriorBoundary::iterator it(myIntBoundary); !it.end(); ++it)
517
518
	if ((mesh->getDim() == 2 && it->rankObj.subObj == EDGE) || 
	    (mesh->getDim() == 3 && it->rankObj.subObj == FACE))
519
 	  allBound[it.getRank()].push_back(*it);
Thomas Witkowski's avatar
Thomas Witkowski committed
520
521

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

526
      for (InteriorBoundary::iterator it(periodicBoundary); !it.end(); ++it)
527
528
	if ((mesh->getDim() == 2 && it->rankObj.subObj == EDGE) || 
	    (mesh->getDim() == 3 && it->rankObj.subObj == FACE))
529
 	  allBound[it.getRank()].push_back(*it);	
530

531

532
      // === Check the boundaries and adapt mesh if necessary. ===
533
534
535
536
#if (DEBUG != 0)
      MSG("Run checkAndAdaptBoundary ...\n");
#endif

537
538
539
540
541
542
543
      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);
544
545
546
547

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

550
#if (DEBUG != 0)
551
    debug::writeMesh(feSpace, -1, debugOutputDir + "mesh");
552
553
554
555
556
557
#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. ===
558

559
560
    updateLocalGlobalNumbering();

561
562
563
564

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

    createPeriodicMap();
565
566
567
568


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

569
570
571
    nTimestepsAfterLastRepartitioning++;

    if (repartitioningAllowed) {
572
      if (nTimestepsAfterLastRepartitioning >= 20) {
573
574
	repartitionMesh();
	nTimestepsAfterLastRepartitioning = 0;
575
      }
576
    }
577
578
579
  }

  
580
  bool MeshDistributor::checkAndAdaptBoundary(RankToBoundMap &allBound)
581
  {
582
    FUNCNAME("MeshDistributor::checkAndAdaptBoundary()");
583
584
585
586
587
588

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

590
591
592
      for (std::vector<AtomicBoundary>::iterator boundIt = it->second.begin();
	   boundIt != it->second.end(); ++boundIt) {
	MeshStructure elCode;
593
	elCode.init(boundIt->rankObj);
594
595
596
597
	sendCodes[it->first].push_back(elCode);
      }
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
598
    StdMpi<MeshCodeVec> stdMpi(mpiComm, true);
599
    stdMpi.send(sendCodes);
600
    stdMpi.recv(allBound);
601
    stdMpi.startCommunication<uint64_t>(MPI_UNSIGNED_LONG);
602
 
603
    // === Compare received mesh structure codes. ===
604
    
605
606
    bool meshFitTogether = true;

607
    for (RankToBoundMap::iterator it = allBound.begin(); it != allBound.end(); ++it) {
608
     
609
610
      MeshCodeVec &recvCodes = stdMpi.getRecvData()[it->first];
      int i = 0;
611
      
612
613
      for (std::vector<AtomicBoundary>::iterator boundIt = it->second.begin();
	   boundIt != it->second.end(); ++boundIt) {
614

615
616
	MeshStructure elCode;	
	elCode.init(boundIt->rankObj);
617

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

621
622
623
624
625
626
	  bool b = startFitElementToMeshCode(recvCodes[i], 
					     boundIt->rankObj.el,
					     boundIt->rankObj.subObj,
					     boundIt->rankObj.ithObj, 
					     boundIt->rankObj.elType,
					     boundIt->rankObj.reverseMode);
627

628
	  if (b)
629
	    meshFitTogether = false;	  
630
 	}
631

632
	i++;
633
634
635
      }
    }

636
    return meshFitTogether;
637
  }
638
639


640
641
642
643
644
645
  bool MeshDistributor::startFitElementToMeshCode(MeshStructure &code, 
						  Element *el, 
						  GeoIndex subObj,
						  int ithObj, 
						  int elType,
						  bool reverseMode)
646
  {
647
    FUNCNAME("MeshDistributor::startFitElementToMeshCode()");
648

649
650
    TEST_EXIT_DBG(el)("No element given!\n");

651
652
    // If the code is empty, the element does not matter and the function can
    // return without chaning the mesh.
653
654
    if (code.empty())
      return false;
655

656
657
658
659
660
    // 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);
661

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

664
    bool meshChanged = false;
665
666
667
    Flag traverseFlag = 
      Mesh::CALL_EVERY_EL_PREORDER | Mesh::FILL_NEIGH | Mesh::FILL_BOUND;

668
669
670
671
672
    // Test for reverse mode, in which the left and right children of elements
    // are flipped.
    if (reverseMode)
      traverseFlag |= Mesh::CALL_REVERSE_MODE;    

673

674
675
676
677
678
    // === 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.
679
      TraverseStack stack;
680
      ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
681
682
      while (elInfo && elInfo->getElement() != el)
	elInfo = stack.traverseNext(elInfo);      
683

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

686
      meshChanged = fitElementToMeshCode(code, stack, subObj, ithObj, reverseMode);
687
688
      return meshChanged;
    }
689

690
691
692

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

693
    if (el->isLeaf()) {
694
695

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

699
      // Create traverse stack and traverse the mesh to the element.
700
      TraverseStack stack;
701
      ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
702
703
      while (elInfo && elInfo->getElement() != el)
	elInfo = stack.traverseNext(elInfo);      
704
705
706

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

707
      // Code is not leaf, therefore refine the element.
708
      el->setMark(1);
709
710
      refineManager->setMesh(el->getMesh());
      refineManager->setStack(&stack);
711
      refineManager->refineFunction(elInfo);
712
      meshChanged = true;
713
    }
714

715
716
    Element *child0 = el->getFirstChild();
    Element *child1 = el->getSecondChild();
717
718
719
720
    if (reverseMode) {
      std::swap(s0, s1);
      std::swap(child0, child1);    
    }
721

722
723
724
    // === 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.                                          ===
725

726
727
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
728

729
730
731
    if (s0 != -1) {
      while (elInfo && elInfo->getElement() != child0)
	elInfo = stack.traverseNext(elInfo);     
732

733
734
735
736
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s0, reverseMode);
    } else {
      while (elInfo && elInfo->getElement() != child1) 
	elInfo = stack.traverseNext(elInfo);      
737

738
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
739
740
    }

741

742
    return meshChanged;
743
744
  }

745

746
747
748
749
750
  bool MeshDistributor::fitElementToMeshCode(MeshStructure &code, 
					     TraverseStack &stack,
					     GeoIndex subObj,
					     int ithObj, 
					     bool reverseMode)
751
  {
752
753
754
755
    FUNCNAME("MeshDistributor::fitElementToMeshCode()");


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

757
758
    ElInfo *elInfo = stack.getElInfo();
    if (!elInfo)
759
      return false;
760

761
762
763
764

    // === 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.                                               ===
765
766
767
768
769
770
771

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

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

773
      return false;
774
    }
775

776
777
778
779
780
781

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


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

783
    if (el->isLeaf()) {
784
785
      TEST_EXIT_DBG(elInfo->getLevel() < 255)("This should not happen!\n");

786
      el->setMark(1);
787
788
      refineManager->setMesh(el->getMesh());
      refineManager->setStack(&stack);
789
      refineManager->refineFunction(elInfo);
790
      meshChanged = true;
791
792
    }

793
794
795
796
797
798

    // === 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());
799
800
801
    Element *child0 = el->getFirstChild();
    Element *child1 = el->getSecondChild();
    if (reverseMode) {
802
      std::swap(s0, s1);
803
804
      std::swap(child0, child1);
    }
805

806
807
808
809
810
811
812
    
    // === Traverse left child. ===

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

813
      stack.traverseNext(elInfo);
814
      code.nextElement();
815
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s0, reverseMode);
816
817
      elInfo = stack.getElInfo();
    } else {
818
819
820
821
      // 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.

822
823
      do {
	elInfo = stack.traverseNext(elInfo);
824
825
826
      } while (elInfo && elInfo->getElement() != child1); 

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

829
830
831
832
833
834
835
836
837
838
    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.
839
840

      code.nextElement();
841
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
842
    } else {
843
844
845
846
      // 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.

847
      int level = elInfo->getLevel();
848

849
850
851
852
      do {
	elInfo = stack.traverseNext(elInfo);
      } while (elInfo && elInfo->getLevel() > level);
    }
853

854
855

    return meshChanged;
856
857
  }

858
  
859
  void MeshDistributor::serialize(std::ostream &out, DofContainer &data)
Thomas Witkowski's avatar
Thomas Witkowski committed
860
  {    
861
    int vecSize = data.size();
862
    SerUtil::serialize(out, vecSize);
863
    for (int i = 0; i < vecSize; i++) {
864
      int dofIndex = *(data[i]);
865
      SerUtil::serialize(out, dofIndex);
866
867
868
869
    }
  }