MeshDistributor.cc 78.5 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
226
#if (DEBUG != 0)
    ParallelDebug::testPeriodicBoundary(*this);
#endif
227

228
    // === Global refinements. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
229

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

Thomas Witkowski's avatar
Thomas Witkowski committed
233
    if (globalRefinement > 0) {
234
      refineManager->globalRefine(mesh, globalRefinement);
235

236
      updateLocalGlobalNumbering();
237
238

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

241
      createPeriodicMap();
Thomas Witkowski's avatar
Thomas Witkowski committed
242
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
243

244

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

247
    setRankDofs();
Thomas Witkowski's avatar
Thomas Witkowski committed
248

249

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

252
    removePeriodicBoundaryConditions();
253
254
  }

255

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

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

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

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

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

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

    probStat.push_back(probVec);
  }


348
  void MeshDistributor::exitParallelization()
349
  {}
350

351
  
352
  void MeshDistributor::testForMacroMesh()
353
  {
354
    FUNCNAME("MeshDistributor::testForMacroMesh()");
355
356
357
358
359
360
361

    int nMacroElements = 0;

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

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

      elInfo = stack.traverseNext(elInfo);
    }

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

376

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

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

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

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
399
400
401
402
403
    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];
  }
404
405


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

Thomas Witkowski's avatar
Thomas Witkowski committed
423
      stdMpi.send(sendIt->first, dofs);
424
425
426
    }

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

Thomas Witkowski's avatar
Thomas Witkowski committed
430
    stdMpi.startCommunication<double>(MPI_DOUBLE);
431
432

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

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

446

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


466
467
  void MeshDistributor::removePeriodicBoundaryConditions()
  {
468
469
    FUNCNAME("MeshDistributor::removePeriodicBoundaryConditions()");

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

    // Remove periodic vertex associations
    mesh->getPeriodicAssociations().clear();
499
500
501
502
  }


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


514
  void MeshDistributor::checkMeshChange()
515
  {
516
    FUNCNAME("MeshDistributor::checkMeshChange()");    
517

518
#if (DEBUG != 0)
519
    debug::writeMesh(feSpace, -1, debugOutputDir + "before_check_mesh");
520
521
#endif

522
523
    double first = MPI::Wtime();

524
525
526
527
528
    // === 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);
529

530
    if (recvAllValues == 0)
531
532
      return;

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

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

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

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

561

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

567
568
569
570
571
572
573
      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);
574
575
576
577

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

580
#if (DEBUG != 0)
581
    debug::writeMesh(feSpace, -1, debugOutputDir + "mesh");
582
583
584
#endif

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

586
587
    updateLocalGlobalNumbering();

588
589
590

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

591
    createPeriodicMap();    
592

593
594
595
596
597

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


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

600
601
602
    nTimestepsAfterLastRepartitioning++;

    if (repartitioningAllowed) {
603
      if (nTimestepsAfterLastRepartitioning >= repartitionIthChange) {
604
605
	repartitionMesh();
	nTimestepsAfterLastRepartitioning = 0;
606
      }
607
    }
608
609
610
  }

  
611
  bool MeshDistributor::checkAndAdaptBoundary(RankToBoundMap &allBound)
612
  {
613
    FUNCNAME("MeshDistributor::checkAndAdaptBoundary()");
614
615
616
617
618
619

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

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

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

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

646
647
	MeshStructure elCode;	
	elCode.init(boundIt->rankObj);
648

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

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

659
	  if (b)
660
	    meshFitTogether = false;	  
661
 	}
662

663
	i++;
664
665
666
      }
    }

667
    return meshFitTogether;
668
  }
669
670


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

680
681
    TEST_EXIT_DBG(el)("No element given!\n");

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

687
688
689
690
691
    // 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);
692

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

695
    bool meshChanged = false;
696
697
698
    Flag traverseFlag = 
      Mesh::CALL_EVERY_EL_PREORDER | Mesh::FILL_NEIGH | Mesh::FILL_BOUND;

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

704

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

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

717
      meshChanged = fitElementToMeshCode(code, stack, subObj, ithObj, reverseMode);
718
719
      return meshChanged;
    }
720

721
722
723

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

724
    if (el->isLeaf()) {
725
726

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

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

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

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

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

753
754
755
    // === 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.                                          ===
756

757
758
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
759

760
761
762
    if (s0 != -1) {
      while (elInfo && elInfo->getElement() != child0)
	elInfo = stack.traverseNext(elInfo);     
763

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

769
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
770
771
    }

772

773
    return meshChanged;
774
775
  }

776

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


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

788
789
    ElInfo *elInfo = stack.getElInfo();
    if (!elInfo)
790
      return false;
791

792
793
794
795

    // === 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.                                               ===
796
797
798
799
800
801
802

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

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

804
      return false;
805
    }
806

807
808
809
810
811
812

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


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

814
    if (el->isLeaf()) {
815
816
      TEST_EXIT_DBG(elInfo->getLevel() < 255)("This should not happen!\n");

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

824
825
826
827
828
829

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

837
838
839
840
841
842
843
    
    // === Traverse left child. ===

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

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

853
854
      do {
	elInfo = stack.traverseNext(elInfo);
855
856
857
      } while (elInfo && elInfo->getElement() != child1); 

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

860
861
862
863
864
865
866
867
868
869
    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.
870
871

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

878
      int level = elInfo->getLevel();
Thomas Witkowski's avatar