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

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

34
35
namespace AMDiS {

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

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

44

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

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
72

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

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

80
81
    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");
82

83
84
85
    // 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).
86
    if (deserialized) {
87
      setRankDofs();
88
      removePeriodicBoundaryConditions();
89

90
      return;
91
    }
92

93
   
94
95
96
97
98
    // 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();

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

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

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

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

114

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

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

131

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

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

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

140

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

    removeMacroElements();
144

Thomas Witkowski's avatar
n  
Thomas Witkowski committed
145

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

Thomas Witkowski's avatar
Thomas Witkowski committed
148

149
150
151
152
153
154
    // 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));
155

156
    updateLocalGlobalNumbering();
157

158

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

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

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

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

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

175

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

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

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

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

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

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

192
      updateLocalGlobalNumbering();
193
194

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

200

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

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

205

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

208
    removePeriodicBoundaryConditions();
209
210
  }

211

212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
  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");
229
      TEST_EXIT(mesh->getDofAdmin(0).getNumberOfPreDOFs(0) == 0)
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
	("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;
248
249
250
    GET_PARAMETER(0, probVec->getName() + "->output->write serialization", "%d", 
		  &writeSerialization);
    if (writeSerialization && !writeSerializationFile) {
251
252
253
254
255
      std::string filename = "";
      GET_PARAMETER(0, name + "->output->serialization filename", &filename);
      
      TEST_EXIT(filename != "")
	("No filename defined for parallel serialization file!\n");
256
257
258
259
260

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

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

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

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

282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
      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;
298
299
300
301
302
303
    }

    probStat.push_back(probVec);
  }


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

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

    int nMacroElements = 0;

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

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

      elInfo = stack.traverseNext(elInfo);
    }

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

332

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

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

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

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
355
356
357
358
359
    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];
  }
360
361


362
  void MeshDistributor::synchVector(SystemVector &vec)
Thomas Witkowski's avatar
Thomas Witkowski committed
363
  {
364
    int nComponents = vec.getSize();
Thomas Witkowski's avatar
Thomas Witkowski committed
365
366
367
368
369
370
371
372
373
374
375
376
    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])]);
377
378
      }

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

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

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

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

      int counter = 0;
Thomas Witkowski's avatar
Thomas Witkowski committed
393
394
395
396
397
      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++];
398
399
400
401
      }
    }
  }

402

403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
  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);
      }
    }
  }


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

426
427
428
429
430
431
432
433
    // 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())
434
	    removePeriodicBoundaryConditions(const_cast<BoundaryIndexMap&>(mat->getBoundaryManager()->getBoundaryConditionMap()));
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
	}
	
	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);
    }    
452
453
454

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


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


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

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

478
479
480
481
482
    // === 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);
483

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

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

490
491
492
493
494
    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.
495
      RankToBoundMap allBound;
Thomas Witkowski's avatar
Thomas Witkowski committed
496
497

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

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

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

512

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

518
519
520
521
522
523
524
      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);
525
526
527
528

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

531
#if (DEBUG != 0)
532
    debug::writeMesh(feSpace, -1, "mesh");
533
534
535
536
537
538
#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. ===
539

540
541
    updateLocalGlobalNumbering();

542
543
544
545

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

    createPeriodicMap();
546
547
548
549


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

550
551
    if (repartitioningAllowed)
      repartitionMesh();
552
553
554
  }

  
555
  bool MeshDistributor::checkAndAdaptBoundary(RankToBoundMap &allBound)
556
  {
557
    FUNCNAME("MeshDistributor::checkAndAdaptBoundary()");
558
559
560
561
562
563

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

565
566
567
      for (std::vector<AtomicBoundary>::iterator boundIt = it->second.begin();
	   boundIt != it->second.end(); ++boundIt) {
	MeshStructure elCode;
568
	elCode.init(boundIt->rankObj);
569
570
571
572
	sendCodes[it->first].push_back(elCode);
      }
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
573
    StdMpi<MeshCodeVec> stdMpi(mpiComm, true);
574
    stdMpi.send(sendCodes);
575
    stdMpi.recv(allBound);
576
    stdMpi.startCommunication<uint64_t>(MPI_UNSIGNED_LONG);
577
 
578
    // === Compare received mesh structure codes. ===
579
    
580
581
    bool meshFitTogether = true;

582
    for (RankToBoundMap::iterator it = allBound.begin(); it != allBound.end(); ++it) {
583
     
584
585
      MeshCodeVec &recvCodes = stdMpi.getRecvData()[it->first];
      int i = 0;
586
      
587
588
      for (std::vector<AtomicBoundary>::iterator boundIt = it->second.begin();
	   boundIt != it->second.end(); ++boundIt) {
589

590
591
	MeshStructure elCode;	
	elCode.init(boundIt->rankObj);
592

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

596
597
598
599
600
601
	  bool b = startFitElementToMeshCode(recvCodes[i], 
					     boundIt->rankObj.el,
					     boundIt->rankObj.subObj,
					     boundIt->rankObj.ithObj, 
					     boundIt->rankObj.elType,
					     boundIt->rankObj.reverseMode);
602

603
	  if (b)
604
	    meshFitTogether = false;	  
605
 	}
606

607
	i++;
608
609
610
      }
    }

611
    return meshFitTogether;
612
  }
613
614


615
616
617
618
619
620
  bool MeshDistributor::startFitElementToMeshCode(MeshStructure &code, 
						  Element *el, 
						  GeoIndex subObj,
						  int ithObj, 
						  int elType,
						  bool reverseMode)
621
  {
622
    FUNCNAME("MeshDistributor::startFitElementToMeshCode()");
623

624
625
    TEST_EXIT_DBG(el)("No element given!\n");

626
627
    // If the code is empty, the element does not matter and the function can
    // return without chaning the mesh.
628
629
    if (code.empty())
      return false;
630

631
632
633
634
635
    // 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);
636

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

639
    bool meshChanged = false;
640
641
642
    Flag traverseFlag = 
      Mesh::CALL_EVERY_EL_PREORDER | Mesh::FILL_NEIGH | Mesh::FILL_BOUND;

643
644
645
646
647
    // Test for reverse mode, in which the left and right children of elements
    // are flipped.
    if (reverseMode)
      traverseFlag |= Mesh::CALL_REVERSE_MODE;    

648

649
650
651
652
653
    // === 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.
654
      TraverseStack stack;
655
      ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
656
657
      while (elInfo && elInfo->getElement() != el)
	elInfo = stack.traverseNext(elInfo);      
658

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

661
      meshChanged = fitElementToMeshCode(code, stack, subObj, ithObj, reverseMode);
662
663
      return meshChanged;
    }
664

665
666
667

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

668
    if (el->isLeaf()) {
669
670

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

674
      // Create traverse stack and traverse the mesh to the element.
675
      TraverseStack stack;
676
      ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
677
678
      while (elInfo && elInfo->getElement() != el)
	elInfo = stack.traverseNext(elInfo);      
679
680
681

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

682
      // Code is not leaf, therefore refine the element.
683
      el->setMark(1);
684
685
      refineManager->setMesh(el->getMesh());
      refineManager->setStack(&stack);
686
      refineManager->refineFunction(elInfo);
687
      meshChanged = true;
688
    }
689

690
691
    Element *child0 = el->getFirstChild();
    Element *child1 = el->getSecondChild();
692
693
694
695
    if (reverseMode) {
      std::swap(s0, s1);
      std::swap(child0, child1);    
    }
696

697
698
699
    // === 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.                                          ===
700

701
702
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(el->getMesh(), -1, traverseFlag);
703

704
705
706
    if (s0 != -1) {
      while (elInfo && elInfo->getElement() != child0)
	elInfo = stack.traverseNext(elInfo);     
707

708
709
710
711
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s0, reverseMode);
    } else {
      while (elInfo && elInfo->getElement() != child1) 
	elInfo = stack.traverseNext(elInfo);      
712

713
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
714
715
    }

716

717
    return meshChanged;
718
719
  }

720

721
722
723
724
725
  bool MeshDistributor::fitElementToMeshCode(MeshStructure &code, 
					     TraverseStack &stack,
					     GeoIndex subObj,
					     int ithObj, 
					     bool reverseMode)
726
  {
727
728
729
730
    FUNCNAME("MeshDistributor::fitElementToMeshCode()");


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

732
733
    ElInfo *elInfo = stack.getElInfo();
    if (!elInfo)
734
      return false;
735

736
737
738
739

    // === 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.                                               ===
740
741
742
743
744
745
746

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

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

748
      return false;
749
    }
750

751
752
753
754
755
756

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


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

758
    if (el->isLeaf()) {
759
760
      TEST_EXIT_DBG(elInfo->getLevel() < 255)("This should not happen!\n");

761
      el->setMark(1);
762
763
      refineManager->setMesh(el->getMesh());
      refineManager->setStack(&stack);
764
      refineManager->refineFunction(elInfo);
765
      meshChanged = true;
766
767
    }

768
769
770
771
772
773

    // === 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());
774
775
776
    Element *child0 = el->getFirstChild();
    Element *child1 = el->getSecondChild();
    if (reverseMode) {
777
      std::swap(s0, s1);
778
779
      std::swap(child0, child1);
    }
780

781
782
783
784
785
786
787
    
    // === Traverse left child. ===

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

788
      stack.traverseNext(elInfo);
789
      code.nextElement();
790
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s0, reverseMode);
791
792
      elInfo = stack.getElInfo();
    } else {
793
794
795
796
      // 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.

797
798
      do {
	elInfo = stack.traverseNext(elInfo);
799
800
801
      } while (elInfo && elInfo->getElement() != child1); 

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

804
805
806
807
808
809
810
811
812
813
    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.
814
815

      code.nextElement();
816
      meshChanged |= fitElementToMeshCode(code, stack, subObj, s1, reverseMode);
817
    } else {
818
819
820
821
      // 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.

822
      int level = elInfo->getLevel();
823

824
825
826
827
      do {
	elInfo = stack.traverseNext(elInfo);
      } while (elInfo && elInfo->getLevel() > level);
    }
828

829
830

    return meshChanged;
831
832
  }

833
  
834
  void MeshDistributor::serialize(std::ostream &out, DofContainer &data)
Thomas Witkowski's avatar
Thomas Witkowski committed
835
  {    
836
    int vecSize = data.size();
837
    SerUtil::serialize(out, vecSize);
838
839
    for (int i = 0; i < vecSize; i++) {
      int dofIndex = (*data[i]);
840
      SerUtil::serialize(out, dofIndex);
841
842
843
844
    }
  }


845
  void MeshDistributor::deserialize(std::istream &in, DofContainer &data,
846
				    std::map<int, const DegreeOfFreedom*> &dofMap)
847
  {
848
    FUNCNAME("MeshDistributor::deserialize()");
849
850

    int vecSize = 0;
851
    SerUtil::deserialize(in, vecSize);
852
    data.clear();
853
854
855
    data.resize(vecSize);
    for (int i = 0; i < vecSize; i++) {
      int dofIndex = 0;
856
      SerUtil::deserialize(in, dofIndex);
857
858
859
860
861
862
863
864
865

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

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


866
  void MeshDistributor::serialize(std::ostream &out, RankToDofContainer &data)
867
868
  {
    int mapSize = data.size();
869
    SerUtil::serialize(out, mapSize);
870
871
    for (RankToDofContainer::iterator it