MeshDistributor.cc 66.2 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
      nTimestepsAfterLastRepartitioning(0),
72
      repartCounter(0),
73
      debugOutputDir(""),
74
      lastMeshChangeIndex(0)
75
  {
76
    FUNCNAME("MeshDistributor::ParalleDomainBase()");
Thomas Witkowski's avatar
Thomas Witkowski committed
77

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

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
89

90
  void MeshDistributor::initParallelization()
91
  {
92
    FUNCNAME("MeshDistributor::initParallelization()");
93
94
95
96

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

97
98
    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");
99

100
101
102
    // 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).
103
    if (deserialized) {
104
105
      updateMacroElementInfo();

106
      setRankDofs();
107

108
      removePeriodicBoundaryConditions();
109

110
111
      macroElIndexMap.clear();
      macroElIndexTypeMap.clear();
112
113
114
115
116

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

121
122
123
124
      for (std::deque<MacroElement*>::iterator it = mesh->getMacroElements().begin();
	   it != mesh->getMacroElements().end(); ++it)
	elementInRank[(*it)->getIndex()] = true;      

125
      return;
126
    }
127

128
   
129
130
131
132
133
    // 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();

134
135
136
137
    // For later mesh repartitioning, we need to store some information about the
    // macro mesh.
    createMacroElementInfo();

138
139
    // create an initial partitioning of the mesh
    partitioner->createPartitionData();
140

141
    // set the element weights, which are 1 at the very first begin
142
    setInitialElementWeights();
143
144
145
146
147
148

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

149

Thomas Witkowski's avatar
Thomas Witkowski committed
150
#if (DEBUG != 0)
151
152
    debug::ElementIdxToDofs elMap;
    debug::createSortedDofs(mesh, elMap);
153
154
155
    if (mpiRank == 0) {
      int writePartMesh = 1;
      GET_PARAMETER(0, "dbg->write part mesh", "%d", &writePartMesh);
156

157
      if (writePartMesh > 0) {
158
159
	debug::writeElementIndexMesh(mesh, debugOutputDir + "elementIndex.vtu");
	writePartitioningMesh(debugOutputDir + "part.vtu");
160
      } else {
161
	MSG("Skip write part mesh!\n");
162
      }
163
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
164
#endif
165

166

167
    // === Create interior boundary information. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
168

169
    createInteriorBoundaryInfo();
Thomas Witkowski's avatar
Thomas Witkowski committed
170

171
#if (DEBUG != 0)
172
    ParallelDebug::printBoundaryInfo(*this);
173
174
#endif

175

Thomas Witkowski's avatar
n  
Thomas Witkowski committed
176
177
178
    // === Remove all macro elements that are not part of the rank partition. ===

    removeMacroElements();
179

Thomas Witkowski's avatar
n  
Thomas Witkowski committed
180

181
182
    // === Create new global and local DOF numbering. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
183

184
185
186
187
188
189
    // 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));
190

191
    updateLocalGlobalNumbering();
192

193

194
195
    // === If in debug mode, make some tests. ===

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

199
    ParallelDebug::testAllElements(*this);
200
    debug::testSortedDofs(mesh, elMap);
201
202
    ParallelDebug::testInteriorBoundary(*this);
    ParallelDebug::testCommonDofs(*this, true);
203
    ParallelDebug::testGlobalIndexByCoords(*this);
Thomas Witkowski's avatar
Thomas Witkowski committed
204

205
    debug::writeMesh(feSpace, -1, debugOutputDir + "macro_mesh");   
206
207

    MSG("Debug mode tests finished!\n");
208
#endif
209

210

211
212
    // === Create periodic dof mapping, if there are periodic boundaries. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
213
    createPeriodicMap();    
214

215
    // === Global refinements. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
216

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

Thomas Witkowski's avatar
Thomas Witkowski committed
220
    if (globalRefinement > 0) {
221
      refineManager->globalRefine(mesh, globalRefinement);
222

223
      updateLocalGlobalNumbering();
224
225

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

228
      createPeriodicMap();
Thomas Witkowski's avatar
Thomas Witkowski committed
229
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
230

231

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

234
    setRankDofs();
Thomas Witkowski's avatar
Thomas Witkowski committed
235

236

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

239
    removePeriodicBoundaryConditions();
240
241
  }

242

243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
  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");
260
      TEST_EXIT(mesh->getDofAdmin(0).getNumberOfPreDOFs(0) == 0)
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
	("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;
279
280
281
    GET_PARAMETER(0, probVec->getName() + "->output->write serialization", "%d", 
		  &writeSerialization);
    if (writeSerialization && !writeSerializationFile) {
282
283
284
285
286
      std::string filename = "";
      GET_PARAMETER(0, name + "->output->serialization filename", &filename);
      
      TEST_EXIT(filename != "")
	("No filename defined for parallel serialization file!\n");
287
288
289
290
291

      int tsModulo = -1;
      GET_PARAMETER(0, probVec->getName() + "->output->write every i-th timestep", 
		    "%d", &tsModulo);
      
292
      probVec->getFileWriterList().push_back(new Serializer<MeshDistributor>(this, filename, tsModulo));
293
294
      writeSerializationFile = true;
    }    
295
296

    int readSerialization = 0;
297
298
    GET_PARAMETER(0, probVec->getName() + "->input->read serialization", "%d", 
		  &readSerialization);
299
300
301
302
    if (readSerialization) {
      std::string filename = "";
      GET_PARAMETER(0, probVec->getName() + "->input->serialization filename", &filename);
      filename += ".p" + lexical_cast<std::string>(mpiRank);
303
      MSG("Start deserialization with %s\n", filename.c_str());
304
      std::ifstream in(filename.c_str());
305
306
307
308

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

309
      probVec->deserialize(in);
310
      in.close();
311
312
      MSG("Deserialization from file: %s\n", filename.c_str());

313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
      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;
329
330
331
332
333
334
    }

    probStat.push_back(probVec);
  }


335
  void MeshDistributor::exitParallelization()
336
  {}
337

338
  
339
  void MeshDistributor::testForMacroMesh()
340
  {
341
    FUNCNAME("MeshDistributor::testForMacroMesh()");
342
343
344
345
346
347
348

    int nMacroElements = 0;

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

      TEST_EXIT(elInfo->getType() == 0)
	("Only macro elements with level 0 are supported!\n");
353
354
355
356
357
358
359
360
361
362
      
      nMacroElements++;

      elInfo = stack.traverseNext(elInfo);
    }

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

363

364
  void MeshDistributor::synchVector(DOFVector<double> &vec)
365
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
366
    StdMpi<std::vector<double> > stdMpi(mpiComm);
367
368

    for (RankToDofContainer::iterator sendIt = sendDofs.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
369
	 sendIt != sendDofs.end(); ++sendIt) {
370
      std::vector<double> dofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
371
372
      int nSendDofs = sendIt->second.size();
      dofs.reserve(nSendDofs);
373
      
Thomas Witkowski's avatar
Thomas Witkowski committed
374
375
      for (int i = 0; i < nSendDofs; i++)
	dofs.push_back(vec[*((sendIt->second)[i])]);
376
377
378
379

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

Thomas Witkowski's avatar
Thomas Witkowski committed
380
381
382
    for (RankToDofContainer::iterator recvIt = recvDofs.begin();
	 recvIt != recvDofs.end(); ++recvIt)
      stdMpi.recv(recvIt->first, recvIt->second.size());
383

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

Thomas Witkowski's avatar
Thomas Witkowski committed
386
387
388
389
390
    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];
  }
391
392


393
  void MeshDistributor::synchVector(SystemVector &vec)
Thomas Witkowski's avatar
Thomas Witkowski committed
394
  {
395
    int nComponents = vec.getSize();
Thomas Witkowski's avatar
Thomas Witkowski committed
396
397
398
399
400
401
402
403
404
405
406
407
    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])]);
408
409
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
410
      stdMpi.send(sendIt->first, dofs);
411
412
413
    }

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

Thomas Witkowski's avatar
Thomas Witkowski committed
417
    stdMpi.startCommunication<double>(MPI_DOUBLE);
418
419

    for (RankToDofContainer::iterator recvIt = recvDofs.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
420
421
	 recvIt != recvDofs.end(); ++recvIt) {
      int nRecvDofs = recvIt->second.size();
422
423

      int counter = 0;
Thomas Witkowski's avatar
Thomas Witkowski committed
424
425
426
427
428
      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++];
429
430
431
432
      }
    }
  }

433

434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
  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);
      }
    }
  }


453
454
  void MeshDistributor::removePeriodicBoundaryConditions()
  {
455
456
    FUNCNAME("MeshDistributor::removePeriodicBoundaryConditions()");

457
458
459
460
461
462
463
464
    // 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())
465
	    removePeriodicBoundaryConditions(const_cast<BoundaryIndexMap&>(mat->getBoundaryManager()->getBoundaryConditionMap()));
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
	}
	
	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);
    }    
483
484
485

    // Remove periodic vertex associations
    mesh->getPeriodicAssociations().clear();
486
487
488
489
  }


  void MeshDistributor::removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap)
Thomas Witkowski's avatar
Thomas Witkowski committed
490
491
492
493
494
495
496
497
498
499
500
  {
    BoundaryIndexMap::iterator it = boundaryMap.begin();
    while (it != boundaryMap.end()) {
      if (it->second->isPeriodic())
	boundaryMap.erase(it++);
      else
	++it;      
    }    
  }


501
  void MeshDistributor::checkMeshChange()
502
  {
503
    FUNCNAME("MeshDistributor::checkMeshChange()");    
504

505
#if (DEBUG != 0)
506
    debug::writeMesh(feSpace, -1, debugOutputDir + "before_check_mesh");
507
508
#endif

509
510
511
512
513
    // === 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);
514

515
    if (recvAllValues == 0)
516
517
      return;

518
519
    // === At least one rank mesh has been changed, so the boundaries must be ===
    // === adapted to the new mesh structure.                                 ===
520

521
522
523
524
525
    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.
526
      RankToBoundMap allBound;
Thomas Witkowski's avatar
Thomas Witkowski committed
527
528

      for (InteriorBoundary::iterator it(myIntBoundary); !it.end(); ++it)
529
530
	if ((mesh->getDim() == 2 && it->rankObj.subObj == EDGE) || 
	    (mesh->getDim() == 3 && it->rankObj.subObj == FACE))
531
 	  allBound[it.getRank()].push_back(*it);
Thomas Witkowski's avatar
Thomas Witkowski committed
532
533

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

538
      for (InteriorBoundary::iterator it(periodicBoundary); !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);	
542

543

544
      // === Check the boundaries and adapt mesh if necessary. ===
545
546
547
548
#if (DEBUG != 0)
      MSG("Run checkAndAdaptBoundary ...\n");
#endif

549
550
551
552
553
554
555
      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);
556
557
558
559

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

562
#if (DEBUG != 0)
563
    debug::writeMesh(feSpace, -1, debugOutputDir + "mesh");
564
565
566
567
568
569
#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. ===
570

571
572
    updateLocalGlobalNumbering();

573
574
575
576

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

    createPeriodicMap();
577
578
579
580


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

581
582
583
    nTimestepsAfterLastRepartitioning++;

    if (repartitioningAllowed) {
584
      if (nTimestepsAfterLastRepartitioning >= 20) {
585
586
	repartitionMesh();
	nTimestepsAfterLastRepartitioning = 0;
587
      }
588
    }
589
590
591
  }

  
592
  bool MeshDistributor::checkAndAdaptBoundary(RankToBoundMap &allBound)
593
  {
594
    FUNCNAME("MeshDistributor::checkAndAdaptBoundary()");
595
596
597
598
599
600

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

602
603
604
      for (std::vector<AtomicBoundary>::iterator boundIt = it->second.begin();
	   boundIt != it->second.end(); ++boundIt) {
	MeshStructure elCode;
605
	elCode.init(boundIt->rankObj);
606
607
608
609
	sendCodes[it->first].push_back(elCode);
      }
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
610
    StdMpi<MeshCodeVec> stdMpi(mpiComm, true);
611
    stdMpi.send(sendCodes);
612
    stdMpi.recv(allBound);
613
    stdMpi.startCommunication<uint64_t>(MPI_UNSIGNED_LONG);
614
 
615
    // === Compare received mesh structure codes. ===
616
    
617
618
    bool meshFitTogether = true;

619
    for (RankToBoundMap::iterator it = allBound.begin(); it != allBound.end(); ++it) {
620
     
621
622
      MeshCodeVec &recvCodes = stdMpi.getRecvData()[it->first];
      int i = 0;
623
      
624
625
      for (std::vector<AtomicBoundary>::iterator boundIt = it->second.begin();
	   boundIt != it->second.end(); ++boundIt) {
626

627
628
	MeshStructure elCode;	
	elCode.init(boundIt->rankObj);
629

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

633
634
635
636
637
638
	  bool b = startFitElementToMeshCode(recvCodes[i], 
					     boundIt->rankObj.el,
					     boundIt->rankObj.subObj,
					     boundIt->rankObj.ithObj, 
					     boundIt->rankObj.elType,
					     boundIt->rankObj.reverseMode);
639

640
	  if (b)
641
	    meshFitTogether = false;	  
642
 	}
643

644
	i++;
645
646
647
      }
    }

648
    return meshFitTogether;
649
  }
650
651


652
653
654
655
656
657
  bool MeshDistributor::startFitElementToMeshCode(MeshStructure &code, 
						  Element *el, 
						  GeoIndex subObj,
						  int ithObj, 
						  int elType,
						  bool reverseMode)
658
  {
659
    FUNCNAME("MeshDistributor::startFitElementToMeshCode()");
660

661
662
    TEST_EXIT_DBG(el)("No element given!\n");

663
664
    // If the code is empty, the element does not matter and the function can
    // return without chaning the mesh.
665
666
    if (code.empty())
      return false;
667

668
669
670
671
672
    // 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);
673

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

676
    bool meshChanged = false;
677
678
679
    Flag traverseFlag = 
      Mesh::CALL_EVERY_EL_PREORDER | Mesh::FILL_NEIGH | Mesh::FILL_BOUND;

680
681
682
683
684
    // Test for reverse mode, in which the left and right children of elements
    // are flipped.
    if (reverseMode)
      traverseFlag |= Mesh::CALL_REVERSE_MODE;    

685

686
687
688
689
690
    // === 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.
691
      TraverseStack stack;
692
      ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
693
694
      while (elInfo && elInfo->getElement() != el)
	elInfo = stack.traverseNext(elInfo);      
695

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

698
      meshChanged = fitElementToMeshCode(code, stack, subObj, ithObj, reverseMode);
699
700
      return meshChanged;
    }
701

702
703
704

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

705
    if (el->isLeaf()) {
706
707

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

711
      // Create traverse stack and traverse the mesh to the element.
712
      TraverseStack stack;
713
      ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
714
715
      while (elInfo && elInfo->getElement() != el)
	elInfo = stack.traverseNext(elInfo);      
716
717
718

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

719
      // Code is not leaf, therefore refine the element.
720
      el->setMark(1);
721
722
      refineManager->setMesh(el->getMesh());
      refineManager->setStack(&stack);
723
      refineManager->refineFunction(elInfo);
724
      meshChanged = true;
725
    }
726

727
728
    Element *child0 = el->getFirstChild();
    Element *child1 = el->getSecondChild();
729
730
731
732
    if (reverseMode) {
      std::swap(s0, s1);
      std::swap(child0, child1);    
    }
733

734
735
736
    // === 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.                                          ===
737

738
739
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
740

741
742
743
    if (s0 != -1) {
      while (elInfo && elInfo->getElement() != child0)
	elInfo = stack.traverseNext(elInfo);     
744

745
746
747
748
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s0, reverseMode);
    } else {
      while (elInfo && elInfo->getElement() != child1) 
	elInfo = stack.traverseNext(elInfo);      
749

750
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
751
752
    }

753

754
    return meshChanged;
755
756
  }

757

758
759
760
761
762
  bool MeshDistributor::fitElementToMeshCode(MeshStructure &code, 
					     TraverseStack &stack,
					     GeoIndex subObj,
					     int ithObj, 
					     bool reverseMode)
763
  {
764
765
766
767
    FUNCNAME("MeshDistributor::fitElementToMeshCode()");


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

769
770
    ElInfo *elInfo = stack.getElInfo();
    if (!elInfo)
771
      return false;
772

773
774
775
776

    // === 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.                                               ===
777
778
779
780
781
782
783

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

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

785
      return false;
786
    }
787

788
789
790
791
792
793

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


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

795
    if (el->isLeaf()) {
796
797
      TEST_EXIT_DBG(elInfo->getLevel() < 255)("This should not happen!\n");

798
      el->setMark(1);
799
800
      refineManager->setMesh(el->getMesh());
      refineManager->setStack(&stack);
801
      refineManager->refineFunction(elInfo);
802
      meshChanged = true;
803
804
    }

805
806
807
808
809
810

    // === 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());
811
812
813
    Element *child0 = el->getFirstChild();
    Element *child1 = el->getSecondChild();
    if (reverseMode) {
814
      std::swap(s0, s1);
815
816
      std::swap(child0, child1);
    }
817

818
819
820
821
822
823
824
    
    // === Traverse left child. ===

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

825
      stack.traverseNext(elInfo);
826
      code.nextElement();
827
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s0, reverseMode);
828
829
      elInfo = stack.getElInfo();
    } else {
830
831
832
833
      // 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.

834
835
      do {
	elInfo = stack.traverseNext(elInfo);
836
837
838
      } while (elInfo && elInfo->getElement() != child1); 

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

841
842
843
844
845
846
847
848
849
850
    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.
851
852

      code.nextElement();
853
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
854
    } else {
855
856
857
858
      // 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.

859
      int level = elInfo->getLevel();
860

861
862
863
864
      do {
	elInfo = stack.traverseNext(elInfo);
      } while (elInfo && elInfo->getLevel() > level);
    }
865

866
867

    return meshChanged;
868
869
  }

870
  
871
  void MeshDistributor::serialize(std::ostream &out, DofContainer &data)
Thomas Witkowski's avatar
Thomas Witkowski committed
872
  {    
873
    int vecSize = data.size();
874
    SerUtil::serialize(out, vecSize);
875
    for (int i = 0; i < vecSize; i++) {
876
      int dofIndex = *(data[i]);