MeshDistributor.cc 73.3 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.


Thomas Witkowski's avatar
Thomas Witkowski committed
13
#include <algorithm>
14
15
#include <iostream>
#include <fstream>
16
17
#include <limits>
#include <stdint.h>
Thomas Witkowski's avatar
Thomas Witkowski committed
18
#include <boost/lexical_cast.hpp>
19
20
#include <boost/filesystem.hpp>

21
#include "parallel/MeshDistributor.h"
22
#include "parallel/MeshManipulation.h"
23
#include "parallel/ParallelDebug.h"
24
#include "parallel/StdMpi.h"
25
#include "parallel/ParMetisPartitioner.h"
26
27
28
#include "io/ElementFileWriter.h"
#include "io/MacroInfo.h"
#include "io/VtkWriter.h"
29
30
31
32
33
#include "Mesh.h"
#include "Traverse.h"
#include "ElInfo.h"
#include "Element.h"
#include "MacroElement.h"
34
35
#include "DOFMatrix.h"
#include "DOFVector.h"
36
#include "SystemVector.h"
37
#include "ElementDofIterator.h"
38
39
#include "ProblemStatBase.h"
#include "StandardProblemIteration.h"
40
#include "VertexVector.h"
41
#include "MeshStructure.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
42
43
#include "ProblemVec.h"
#include "ProblemInstat.h"
44
#include "Debug.h"
45

46
47
namespace AMDiS {

Thomas Witkowski's avatar
Thomas Witkowski committed
48
  using boost::lexical_cast;
49
  using namespace boost::filesystem;
Thomas Witkowski's avatar
Thomas Witkowski committed
50

51
52
53
54
55
  inline bool cmpDofsByValue(const DegreeOfFreedom* dof1, const DegreeOfFreedom* dof2)
  {
    return (*dof1 < *dof2);
  }

56

57
58
59
60
61
62
63
64
  MeshDistributor::MeshDistributor(std::string str)
    : probStat(0),
      name(str),
      feSpace(NULL),
      mesh(NULL),
      refineManager(NULL),
      info(10),
      partitioner(NULL),
65
      nRankDofs(0),
66
      nOverallDofs(0),
67
      rstart(0),
68
      deserialized(false),
69
      writeSerializationFile(false),
70
      repartitioningAllowed(false),
71
      repartitionIthChange(20),
72
      nTimestepsAfterLastRepartitioning(0),
73
      repartCounter(0),
74
      debugOutputDir(""),
75
      lastMeshChangeIndex(0)
76
  {
77
    FUNCNAME("MeshDistributor::ParalleDomainBase()");
Thomas Witkowski's avatar
Thomas Witkowski committed
78

79
80
81
    mpiRank = MPI::COMM_WORLD.Get_rank();
    mpiSize = MPI::COMM_WORLD.Get_size();
    mpiComm = MPI::COMM_WORLD;
82
83
84
85

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

87
88
    GET_PARAMETER(0, name + "->debug output dir", &debugOutputDir);
    GET_PARAMETER(0, name + "->repartition ith change", "%d", &repartitionIthChange);
89
90
91
92

    tmp = 0;
    GET_PARAMETER(0, name + "->log main rank", "%d", &tmp);
    Msg::outputMainRank = (tmp > 0);
93
94
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
95

96
  void MeshDistributor::initParallelization()
97
  {
98
    FUNCNAME("MeshDistributor::initParallelization()");
99
100
101
102

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

103
104
    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");
105

106
107
108
    // 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).
109
    if (deserialized) {
110
111
      updateMacroElementInfo();

112
      setRankDofs();
113

114
      removePeriodicBoundaryConditions();
115

116
117
      macroElIndexMap.clear();
      macroElIndexTypeMap.clear();
118
119
120
121
122

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

127
128
129
130
      for (std::deque<MacroElement*>::iterator it = mesh->getMacroElements().begin();
	   it != mesh->getMacroElements().end(); ++it)
	elementInRank[(*it)->getIndex()] = true;      

131
      return;
132
    }
133

134
   
135
136
137
138
139
    // 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();

140
141
142
143
    // For later mesh repartitioning, we need to store some information about the
    // macro mesh.
    createMacroElementInfo();

144
145
    // create an initial partitioning of the mesh
    partitioner->createPartitionData();
146

147
    // set the element weights, which are 1 at the very first begin
148
    setInitialElementWeights();
149
150
151

    // and now partition the mesh    
    partitioner->fillCoarsePartitionVec(&oldPartitionVec);
152
153
154
155

    bool partitioningSucceed = partitioner->partition(elemWeights, INITIAL);
    TEST_EXIT(partitioningSucceed)("Initial partitioning does not work!\n");

156
157
    partitioner->fillCoarsePartitionVec(&partitionVec);

158

Thomas Witkowski's avatar
Thomas Witkowski committed
159
#if (DEBUG != 0)
160
161
    debug::ElementIdxToDofs elMap;
    debug::createSortedDofs(mesh, elMap);
162
163
164
    if (mpiRank == 0) {
      int writePartMesh = 1;
      GET_PARAMETER(0, "dbg->write part mesh", "%d", &writePartMesh);
165

166
      if (writePartMesh > 0) {
167
168
	debug::writeElementIndexMesh(mesh, debugOutputDir + "elementIndex.vtu");
	writePartitioningMesh(debugOutputDir + "part.vtu");
169
      } else {
170
	MSG("Skip write part mesh!\n");
171
      }
172
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
173
#endif
174

175

176
    // === Create interior boundary information. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
177

178
    createInteriorBoundaryInfo();
Thomas Witkowski's avatar
Thomas Witkowski committed
179

180
#if (DEBUG != 0)
181
    ParallelDebug::printBoundaryInfo(*this);
182
183
#endif

184

Thomas Witkowski's avatar
n  
Thomas Witkowski committed
185
186
187
    // === Remove all macro elements that are not part of the rank partition. ===

    removeMacroElements();
188

Thomas Witkowski's avatar
n  
Thomas Witkowski committed
189

190
191
    // === Create new global and local DOF numbering. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
192

193
194
195
196
197
198
    // 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));
199

200
    updateLocalGlobalNumbering();
201

202

203
204
    // === If in debug mode, make some tests. ===

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

208
    ParallelDebug::testAllElements(*this);
209
    debug::testSortedDofs(mesh, elMap);
210
211
    ParallelDebug::testInteriorBoundary(*this);
    ParallelDebug::testCommonDofs(*this, true);
212
    ParallelDebug::testGlobalIndexByCoords(*this);
Thomas Witkowski's avatar
Thomas Witkowski committed
213

214
    debug::writeMesh(feSpace, -1, debugOutputDir + "macro_mesh");   
215
216

    MSG("Debug mode tests finished!\n");
217
#endif
218

219

220
221
    // === Create periodic dof mapping, if there are periodic boundaries. ===

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

224

225
    // === Global refinements. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
226

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

Thomas Witkowski's avatar
Thomas Witkowski committed
230
    if (globalRefinement > 0) {
231
      refineManager->globalRefine(mesh, globalRefinement);
232

233
      updateLocalGlobalNumbering();
234
235

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

238
      createPeriodicMap();
Thomas Witkowski's avatar
Thomas Witkowski committed
239
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
240

241

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

244
    setRankDofs();
Thomas Witkowski's avatar
Thomas Witkowski committed
245

246

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

249
    removePeriodicBoundaryConditions();
250
251
  }

252

253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
  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");
270
      TEST_EXIT(mesh->getDofAdmin(0).getNumberOfPreDofs(VERTEX) == 0)
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
	("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;
289
290
291
    GET_PARAMETER(0, probVec->getName() + "->output->write serialization", "%d", 
		  &writeSerialization);
    if (writeSerialization && !writeSerializationFile) {
292
293
294
295
296
      std::string filename = "";
      GET_PARAMETER(0, name + "->output->serialization filename", &filename);
      
      TEST_EXIT(filename != "")
	("No filename defined for parallel serialization file!\n");
297
298
299
300
301

      int tsModulo = -1;
      GET_PARAMETER(0, probVec->getName() + "->output->write every i-th timestep", 
		    "%d", &tsModulo);
      
302
      probVec->getFileWriterList().push_back(new Serializer<MeshDistributor>(this, filename, tsModulo));
303
304
      writeSerializationFile = true;
    }    
305
306

    int readSerialization = 0;
307
308
    GET_PARAMETER(0, probVec->getName() + "->input->read serialization", "%d", 
		  &readSerialization);
309
310
311
312
    if (readSerialization) {
      std::string filename = "";
      GET_PARAMETER(0, probVec->getName() + "->input->serialization filename", &filename);
      filename += ".p" + lexical_cast<std::string>(mpiRank);
313
      MSG("Start deserialization with %s\n", filename.c_str());
314
      std::ifstream in(filename.c_str());
315
316
317
318

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

319
      probVec->deserialize(in);
320
      in.close();
321
322
      MSG("Deserialization from file: %s\n", filename.c_str());

323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
      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;
339
340
341
342
343
344
    }

    probStat.push_back(probVec);
  }


345
  void MeshDistributor::exitParallelization()
346
  {}
347

348
  
349
  void MeshDistributor::testForMacroMesh()
350
  {
351
    FUNCNAME("MeshDistributor::testForMacroMesh()");
352
353
354
355
356
357
358

    int nMacroElements = 0;

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

      TEST_EXIT(elInfo->getType() == 0)
	("Only macro elements with level 0 are supported!\n");
363
364
365
366
367
368
369
370
371
372
      
      nMacroElements++;

      elInfo = stack.traverseNext(elInfo);
    }

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

373

374
  void MeshDistributor::synchVector(DOFVector<double> &vec)
375
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
376
    StdMpi<std::vector<double> > stdMpi(mpiComm);
377
378

    for (RankToDofContainer::iterator sendIt = sendDofs.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
379
	 sendIt != sendDofs.end(); ++sendIt) {
380
      std::vector<double> dofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
381
382
      int nSendDofs = sendIt->second.size();
      dofs.reserve(nSendDofs);
383
      
Thomas Witkowski's avatar
Thomas Witkowski committed
384
385
      for (int i = 0; i < nSendDofs; i++)
	dofs.push_back(vec[*((sendIt->second)[i])]);
386
387
388
389

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

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
396
397
398
399
400
    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];
  }
401
402


403
  void MeshDistributor::synchVector(SystemVector &vec)
Thomas Witkowski's avatar
Thomas Witkowski committed
404
  {
405
    int nComponents = vec.getSize();
Thomas Witkowski's avatar
Thomas Witkowski committed
406
407
408
409
410
411
412
413
414
415
416
417
    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])]);
418
419
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
420
      stdMpi.send(sendIt->first, dofs);
421
422
423
    }

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

Thomas Witkowski's avatar
Thomas Witkowski committed
427
    stdMpi.startCommunication<double>(MPI_DOUBLE);
428
429

    for (RankToDofContainer::iterator recvIt = recvDofs.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
430
431
	 recvIt != recvDofs.end(); ++recvIt) {
      int nRecvDofs = recvIt->second.size();
432
433

      int counter = 0;
Thomas Witkowski's avatar
Thomas Witkowski committed
434
435
436
437
438
      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++];
439
440
441
442
      }
    }
  }

443

444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
  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);
      }
    }
  }


463
464
  void MeshDistributor::removePeriodicBoundaryConditions()
  {
465
466
    FUNCNAME("MeshDistributor::removePeriodicBoundaryConditions()");

467
468
469
470
471
472
473
474
    // 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())
475
	    removePeriodicBoundaryConditions(const_cast<BoundaryIndexMap&>(mat->getBoundaryManager()->getBoundaryConditionMap()));
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
	}
	
	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);
    }    
493
494
495

    // Remove periodic vertex associations
    mesh->getPeriodicAssociations().clear();
496
497
498
499
  }


  void MeshDistributor::removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap)
Thomas Witkowski's avatar
Thomas Witkowski committed
500
501
502
503
504
505
506
507
508
509
510
  {
    BoundaryIndexMap::iterator it = boundaryMap.begin();
    while (it != boundaryMap.end()) {
      if (it->second->isPeriodic())
	boundaryMap.erase(it++);
      else
	++it;      
    }    
  }


511
  void MeshDistributor::checkMeshChange()
512
  {
513
    FUNCNAME("MeshDistributor::checkMeshChange()");    
514

515
#if (DEBUG != 0)
516
    debug::writeMesh(feSpace, -1, debugOutputDir + "before_check_mesh");
517
518
#endif

519
520
    double first = MPI::Wtime();

521
522
523
524
525
    // === 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);
526

527
    if (recvAllValues == 0)
528
529
      return;

530
531
    // === At least one rank mesh has been changed, so the boundaries must be ===
    // === adapted to the new mesh structure.                                 ===
532
   
533
534
535
    do {
      // To check the interior boundaries, the ownership of the boundaries is not 
      // important. Therefore, we add all boundaries to one boundary container.
536
      RankToBoundMap allBound;
Thomas Witkowski's avatar
Thomas Witkowski committed
537
538

      for (InteriorBoundary::iterator it(myIntBoundary); !it.end(); ++it)
539
540
	if ((mesh->getDim() == 2 && it->rankObj.subObj == EDGE) || 
	    (mesh->getDim() == 3 && it->rankObj.subObj == FACE))
541
 	  allBound[it.getRank()].push_back(*it);
Thomas Witkowski's avatar
Thomas Witkowski committed
542
543

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

548
549
550
551
552
553
554
555
556
      for (InteriorBoundary::iterator it(periodicBoundary); !it.end(); ++it) {
	if (it.getRank() == mpiRank) {
	  //	  ERROR_EXIT("Na, du weisst schon!\n");
	} else {
	  if ((mesh->getDim() == 2 && it->rankObj.subObj == EDGE) || 
	      (mesh->getDim() == 3 && it->rankObj.subObj == FACE))
	    allBound[it.getRank()].push_back(*it);	
	}
      }
557

558

559
      // === Check the boundaries and adapt mesh if necessary. ===
560
561
562
563
#if (DEBUG != 0)
      MSG("Run checkAndAdaptBoundary ...\n");
#endif

564
565
566
567
568
569
570
      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);
571
572
573
574

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

577
#if (DEBUG != 0)
578
    debug::writeMesh(feSpace, -1, debugOutputDir + "mesh");
579
580
581
#endif

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

583
584
    updateLocalGlobalNumbering();

585
586
587

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

588
    createPeriodicMap();    
589

590
591
592
593
594

    INFO(info, 8)("Parallel mesh adaption needed %.5f seconds\n", 
		  MPI::Wtime() - first);


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

597
598
599
    nTimestepsAfterLastRepartitioning++;

    if (repartitioningAllowed) {
600
      if (nTimestepsAfterLastRepartitioning >= repartitionIthChange) {
601
602
	repartitionMesh();
	nTimestepsAfterLastRepartitioning = 0;
603
      }
604
    }
605
606
607
  }

  
608
  bool MeshDistributor::checkAndAdaptBoundary(RankToBoundMap &allBound)
609
  {
610
    FUNCNAME("MeshDistributor::checkAndAdaptBoundary()");
611
612
613
614
615
616

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

618
619
620
      for (std::vector<AtomicBoundary>::iterator boundIt = it->second.begin();
	   boundIt != it->second.end(); ++boundIt) {
	MeshStructure elCode;
621
	elCode.init(boundIt->rankObj);
622
623
624
625
	sendCodes[it->first].push_back(elCode);
      }
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
626
    StdMpi<MeshCodeVec> stdMpi(mpiComm, true);
627
    stdMpi.send(sendCodes);
628
    stdMpi.recv(allBound);
629
    stdMpi.startCommunication<uint64_t>(MPI_UNSIGNED_LONG);
630
 
631
    // === Compare received mesh structure codes. ===
632
    
633
634
    bool meshFitTogether = true;

635
    for (RankToBoundMap::iterator it = allBound.begin(); it != allBound.end(); ++it) {
636
     
637
638
      MeshCodeVec &recvCodes = stdMpi.getRecvData()[it->first];
      int i = 0;
639
      
640
641
      for (std::vector<AtomicBoundary>::iterator boundIt = it->second.begin();
	   boundIt != it->second.end(); ++boundIt) {
642

643
644
	MeshStructure elCode;	
	elCode.init(boundIt->rankObj);
645

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

649
650
651
652
653
654
	  bool b = startFitElementToMeshCode(recvCodes[i], 
					     boundIt->rankObj.el,
					     boundIt->rankObj.subObj,
					     boundIt->rankObj.ithObj, 
					     boundIt->rankObj.elType,
					     boundIt->rankObj.reverseMode);
655

656
	  if (b)
657
	    meshFitTogether = false;	  
658
 	}
659

660
	i++;
661
662
663
      }
    }

664
    return meshFitTogether;
665
  }
666
667


668
669
670
671
672
673
  bool MeshDistributor::startFitElementToMeshCode(MeshStructure &code, 
						  Element *el, 
						  GeoIndex subObj,
						  int ithObj, 
						  int elType,
						  bool reverseMode)
674
  {
675
    FUNCNAME("MeshDistributor::startFitElementToMeshCode()");
676

677
678
    TEST_EXIT_DBG(el)("No element given!\n");

679
680
    // If the code is empty, the element does not matter and the function can
    // return without chaning the mesh.
681
682
    if (code.empty())
      return false;
683

684
685
686
687
688
    // 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);
689

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

692
    bool meshChanged = false;
693
694
695
    Flag traverseFlag = 
      Mesh::CALL_EVERY_EL_PREORDER | Mesh::FILL_NEIGH | Mesh::FILL_BOUND;

696
697
698
699
700
    // Test for reverse mode, in which the left and right children of elements
    // are flipped.
    if (reverseMode)
      traverseFlag |= Mesh::CALL_REVERSE_MODE;    

701

702
703
704
705
706
    // === 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.
707
      TraverseStack stack;
708
      ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
709
710
      while (elInfo && elInfo->getElement() != el)
	elInfo = stack.traverseNext(elInfo);      
711

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

714
      meshChanged = fitElementToMeshCode(code, stack, subObj, ithObj, reverseMode);
715
716
      return meshChanged;
    }
717

718
719
720

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

721
    if (el->isLeaf()) {
722
723

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

727
      // Create traverse stack and traverse the mesh to the element.
728
      TraverseStack stack;
729
      ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
730
731
      while (elInfo && elInfo->getElement() != el)
	elInfo = stack.traverseNext(elInfo);      
732
733
734

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

735
      // Code is not leaf, therefore refine the element.
736
      el->setMark(1);
737
738
      refineManager->setMesh(el->getMesh());
      refineManager->setStack(&stack);
739
      refineManager->refineFunction(elInfo);
740
      meshChanged = true;
741
    }
742

743
744
    Element *child0 = el->getFirstChild();
    Element *child1 = el->getSecondChild();
745
746
747
748
    if (reverseMode) {
      std::swap(s0, s1);
      std::swap(child0, child1);    
    }
749

750
751
752
    // === 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.                                          ===
753

754
755
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
756

757
758
759
    if (s0 != -1) {
      while (elInfo && elInfo->getElement() != child0)
	elInfo = stack.traverseNext(elInfo);     
760

761
762
763
764
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s0, reverseMode);
    } else {
      while (elInfo && elInfo->getElement() != child1) 
	elInfo = stack.traverseNext(elInfo);      
765

766
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
767
768
    }

769

770
    return meshChanged;
771
772
  }

773

774
775
776
777
778
  bool MeshDistributor::fitElementToMeshCode(MeshStructure &code, 
					     TraverseStack &stack,
					     GeoIndex subObj,
					     int ithObj, 
					     bool reverseMode)
779
  {
780
781
782
783
    FUNCNAME("MeshDistributor::fitElementToMeshCode()");


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

785
786
    ElInfo *elInfo = stack.getElInfo();
    if (!elInfo)
787
      return false;
788

789
790
791
792

    // === 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.                                               ===
793
794
795
796
797
798
799

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

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

801
      return false;
802
    }
803

804
805
806
807
808
809

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


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

811
    if (el->isLeaf()) {
812
813
      TEST_EXIT_DBG(elInfo->getLevel() < 255)("This should not happen!\n");

814
      el->setMark(1);
815
816
      refineManager->setMesh(el->getMesh());
      refineManager->setStack(&stack);
817
      refineManager->refineFunction(elInfo);
818
      meshChanged = true;
819
820
    }

821
822
823
824
825
826

    // === 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());
827
828
829
    Element *child0 = el->getFirstChild();
    Element *child1 = el->getSecondChild();
    if (reverseMode) {
830
      std::swap(s0, s1);
831
832
      std::swap(child0, child1);
    }
833

834
835
836
837
838
839
840
    
    // === Traverse left child. ===

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

841
      stack.traverseNext(elInfo);
842
      code.nextElement();
843
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s0, reverseMode);
844
845
      elInfo = stack.getElInfo();
    } else {
846
847
848
849
      // 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.

850
851
      do {
	elInfo = stack.traverseNext(elInfo);
852
853
854
      } while (elInfo && elInfo->getElement() != child1); 

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

857
858
859
860
861
862
863
864
865
866
    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.
867
868

      code.nextElement();
869
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
870
    } else {
871
872
873
874
      // 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.

875
      int level = elInfo->getLevel();
876

877
878
879
880
      do {
	elInfo = stack.traverseNext(elInfo);
      } while (elInfo && elInfo->getLevel() > level);
    }