MeshDistributor.cc 63.3 KB
Newer Older
1
//
2
3
4
5
6
7
8
9
10
11
12
// Software License for AMDiS
//
// Copyright (c) 2010 Dresden University of Technology 
// All rights reserved.
// Authors: Simon Vey, Thomas Witkowski et al.
//
// This file is part of AMDiS
//
// See also license.opensource.txt in the distribution.


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

21
#include "parallel/MeshDistributor.h"
22
#include "parallel/MeshManipulation.h"
23
#include "parallel/ParallelDebug.h"
24
#include "parallel/StdMpi.h"
25
#include "parallel/MeshPartitioner.h"
26
#include "parallel/ParMetisPartitioner.h"
27
#include "parallel/ZoltanPartitioner.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
28
#include "parallel/SimplePartitioner.h"
29
#include "parallel/CheckerPartitioner.h"
30
#include "parallel/MpiHelper.h"
31
#include "parallel/DofComm.h"
32
33
#include "io/ElementFileWriter.h"
#include "io/MacroInfo.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
34
#include "io/MacroWriter.h"
35
#include "io/VtkWriter.h"
36
37
38
39
40
#include "Mesh.h"
#include "Traverse.h"
#include "ElInfo.h"
#include "Element.h"
#include "MacroElement.h"
41
42
#include "DOFMatrix.h"
#include "DOFVector.h"
43
#include "SystemVector.h"
44
#include "ElementDofIterator.h"
45
46
#include "ProblemStatBase.h"
#include "StandardProblemIteration.h"
47
#include "VertexVector.h"
48
#include "MeshStructure.h"
49
#include "ProblemStat.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
50
#include "ProblemInstat.h"
51
#include "RefinementManager3d.h"
52
#include "Debug.h"
53

54
55
namespace AMDiS {

Thomas Witkowski's avatar
Thomas Witkowski committed
56
  using boost::lexical_cast;
57
  using namespace boost::filesystem;
58
  using namespace std;
Thomas Witkowski's avatar
Thomas Witkowski committed
59

60
61
  MeshDistributor* MeshDistributor::globalMeshDistributor = NULL;

62
63
64
  const Flag MeshDistributor::BOUNDARY_SUBOBJ_SORTED              = 0X01L;
  const Flag MeshDistributor::BOUNDARY_FILL_INFO_SEND_DOFS        = 0X02L;
  const Flag MeshDistributor::BOUNDARY_FILL_INFO_RECV_DOFS        = 0X04L;
Thomas Witkowski's avatar
Thomas Witkowski committed
65

66
67
68
69
70
  inline bool cmpDofsByValue(const DegreeOfFreedom* dof1, const DegreeOfFreedom* dof2)
  {
    return (*dof1 < *dof2);
  }

71
  bool MeshDistributor::sebastianMode = false;
72

73
  MeshDistributor::MeshDistributor()
74
    : problemStat(0),
75
      initialized(false),
76
      name("parallel"),
77
      feSpaces(0),
78
79
80
81
      mesh(NULL),
      refineManager(NULL),
      info(10),
      partitioner(NULL),
82
      deserialized(false),
83
      writeSerializationFile(false),
84
      repartitioningAllowed(false),
85
      repartitionIthChange(20),
86
87
      nMeshChangesAfterLastRepartitioning(0),
      repartitioningCounter(0),
88
      repartitioningFailed(0),
89
      debugOutputDir(""),
Thomas Witkowski's avatar
Thomas Witkowski committed
90
      lastMeshChangeIndex(0),
91
      createBoundaryDofFlag(0),
92
      boundaryDofInfo(1)
93
  {
94
    FUNCNAME("MeshDistributor::ParalleDomainBase()");
Thomas Witkowski's avatar
Thomas Witkowski committed
95

96
    mpiComm = MPI::COMM_WORLD;
97
98
    mpiRank = mpiComm.Get_rank();
    mpiSize = mpiComm.Get_size();
99

100
    Parameters::get(name + "->repartitioning", repartitioningAllowed);
101
102
    Parameters::get(name + "->debug output dir", debugOutputDir);
    Parameters::get(name + "->repartition ith change", repartitionIthChange);
103
    Parameters::get(name + "->log main rank", Msg::outputMainRank);
104

105
    string partStr = "parmetis";
106
    Parameters::get(name + "->partitioner", partStr);
107
108
109
110

    if (partStr == "parmetis") 
      partitioner = new ParMetisPartitioner(&mpiComm);

Thomas Witkowski's avatar
Thomas Witkowski committed
111
112
    if (partStr == "zoltan") {
#ifdef HAVE_ZOLTAN
113
      partitioner = new ZoltanPartitioner(&mpiComm);
Thomas Witkowski's avatar
Thomas Witkowski committed
114
#else
Thomas Witkowski's avatar
Thomas Witkowski committed
115
      ERROR_EXIT("AMDiS was compiled without Zoltan support. Therefore you cannot make use of it!\n");
Thomas Witkowski's avatar
Thomas Witkowski committed
116
117
#endif
    }
118

119
120
121
    if (partStr == "checker")
      partitioner = new CheckerPartitioner(&mpiComm);

Thomas Witkowski's avatar
Thomas Witkowski committed
122
123
124
    if (partStr == "simple")
      partitioner = new SimplePartitioner(&mpiComm);

125
    int tmp = 0;
126
    Parameters::get(name + "->box partitioning", tmp);
Thomas Witkowski's avatar
Thomas Witkowski committed
127
128
    partitioner->setBoxPartitioning(static_cast<bool>(tmp));

129
    TEST_EXIT(partitioner)("Could not create partitioner \"%s\"!\n", partStr.c_str());
130
131
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
132

133
  void MeshDistributor::initParallelization()
134
  {
135
    FUNCNAME("MeshDistributor::initParallelization()");
136

137
138
139
    if (initialized)
      return;

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

143
144
    TEST_EXIT(feSpaces.size() > 0)
      ("No FE space has been defined for the mesh distributor!\n");
145
    TEST_EXIT(mesh)("No mesh has been defined for the mesh distributor!\n");
146

147
148
149
150
151
    // === Sort FE spaces with respect to the degree of the basis ===
    // === functions. Use stuiped bubble sort for this.           ===

    bool doNext = false;
    do {
152
153
      doNext = false;
      for (unsigned int i = 0; i < feSpaces.size() - 1; i++) {
154
155
156
157
158
159
160
	if (feSpaces[i]->getBasisFcts()->getDegree() >
	    feSpaces[i + 1]->getBasisFcts()->getDegree()) {
	  const FiniteElemSpace *tmp = feSpaces[i + 1];
	  feSpaces[i + 1] = feSpaces[i];
	  feSpaces[i] = tmp;
	  doNext = true;
	}
161
      }
162
163
    } while (doNext);

164
    elObjDb.setFeSpace(feSpaces[0]);
165

Thomas Witkowski's avatar
Thomas Witkowski committed
166
167
168
    // If required, create hierarchical mesh level structure.
    createMeshLevelStructure();

169
170
171
    // 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).
172
    if (deserialized) {
Thomas Witkowski's avatar
Thomas Witkowski committed
173
174
      createMeshLevelStructure();
      
175
176
      updateMacroElementInfo();

177
      removePeriodicBoundaryConditions();
178

179
      elObjDb.createMacroElementInfo(allMacroElements);
180

Thomas Witkowski's avatar
Thomas Witkowski committed
181
      updateLocalGlobalNumbering();
182

183
184
      setRankDofs();

Thomas Witkowski's avatar
Thomas Witkowski committed
185
186
      elObjDb.setData(partitionMap, levelData);

Thomas Witkowski's avatar
Thomas Witkowski committed
187
#if (DEBUG != 0)
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
188
189
      ParallelDebug::writeDebugFile(feSpaces[feSpaces.size() - 1], dofMap, 
				    debugOutputDir + "mpi-dbg", "dat");
Thomas Witkowski's avatar
Thomas Witkowski committed
190
#endif    
191
192

      initialized = true;
193
      return;
194
    }
195

196

197
198
199
    // 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.
200
201
    testForMacroMesh();

202
203
    // For later mesh repartitioning, we need to store some information about
    // the macro mesh.
204
205
    createMacroElementInfo();

206
    // create an initial partitioning of the mesh
207
    partitioner->createInitialPartitioning();
208

209
    // set the element weights, which are 1 at the very first begin
210
    setInitialElementWeights();
211
212

    // and now partition the mesh    
213
214
    bool partitioningSucceed = partitioner->partition(elemWeights, INITIAL);
    TEST_EXIT(partitioningSucceed)("Initial partitioning does not work!\n");
215
    partitioner->createPartitionMap(partitionMap);
216

217

218
#if (DEBUG != 0)    
219
220
    debug::ElementIdxToDofs elMap;
    debug::createSortedDofs(mesh, elMap);
221
222
#endif

223
    if (mpiRank == 0) {
224
#if (DEBUG != 0)    
225
      int writePartMesh = 1;
226
227
228
#else
      int writePartMesh = 0;
#endif
229
      Parameters::get("dbg->write part mesh", writePartMesh);
230

231
      if (writePartMesh > 0) {
232
	debug::writeElementIndexMesh(mesh, debugOutputDir + "elementIndex.vtu");
233
	ParallelDebug::writePartitioning(*this, debugOutputDir + "part.vtu");
234
      }
235
    }
236

237
    // Create interior boundary information.
238
    createInteriorBoundary(true);
Thomas Witkowski's avatar
Thomas Witkowski committed
239

240
241
    // === Remove neighbourhood relations due to periodic bounday conditions. ===

242
243
244
245
246
    for (deque<MacroElement*>::iterator it = mesh->firstMacroElement();
	 it != mesh->endOfMacroElements(); ++it) {
      for (int i = 0; i < mesh->getGeo(NEIGH); i++) {
	if ((*it)->getNeighbour(i) && 
	    mesh->isPeriodicAssociation((*it)->getBoundary(i))) {
247
248
249

	  int neighIndex = (*it)->getNeighbour(i)->getIndex();

250
251
252
253
254
	  (*it)->getNeighbour(i)->setNeighbour((*it)->getOppVertex(i), NULL);
	  (*it)->setNeighbour(i, NULL);
	  (*it)->setBoundary(i, 0);

	  macroElementNeighbours[(*it)->getIndex()][i] = -1;
255
	  macroElementNeighbours[neighIndex][(*it)->getOppVertex(i)] = -1;
256
257
258
259
260
261
262
263
264
	}
      }
    }

    for (vector<MacroElement*>::iterator it = allMacroElements.begin();
	 it != allMacroElements.end(); ++it) {
      for (int i = 0; i < mesh->getGeo(NEIGH); i++) {
	if ((*it)->getNeighbour(i) && 
	    mesh->isPeriodicAssociation((*it)->getBoundary(i))) {
265
266
267

	  int neighIndex = (*it)->getNeighbour(i)->getIndex();

268
269
270
271
272
	  (*it)->getNeighbour(i)->setNeighbour((*it)->getOppVertex(i), NULL);
	  (*it)->setNeighbour(i, NULL);
	  (*it)->setBoundary(i, 0);

	  macroElementNeighbours[(*it)->getIndex()][i] = -1;
273
	  macroElementNeighbours[neighIndex][(*it)->getOppVertex(i)] = -1;
274

275
276
277
	}
      }
    }
278

Thomas Witkowski's avatar
n    
Thomas Witkowski committed
279
280
281
    // === Remove all macro elements that are not part of the rank partition. ===

    removeMacroElements();
282

283
284
    // === Create new global and local DOF numbering. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
285

286
    // We have to remove the VertexVectors, which contain periodic assoiciations, 
287
288
    // because they are not valid anymore after some macro elements have been
    // removed and the corresponding DOFs were deleted.
289
    for (map<BoundaryType, VertexVector*>::iterator it = mesh->getPeriodicAssociations().begin();
290
291
	 it != mesh->getPeriodicAssociations().end(); ++it)
      const_cast<DOFAdmin&>(mesh->getDofAdmin(0)).removeDOFContainer(dynamic_cast<DOFContainer*>(it->second));
292

293
    updateLocalGlobalNumbering();
294

295
296
297
    // === In 3D we have to make some test, if the resulting mesh is valid.  ===
    // === If it is not valid, there is no possiblity yet to fix this        ===
    // === problem, just exit with an error message.                         ===
298
299
300
    
    check3dValidMesh();

301
302
    // === If in debug mode, make some tests. ===

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

306
    ParallelDebug::testAllElements(*this);
307
    debug::testSortedDofs(mesh, elMap);
308
    ParallelDebug::testInteriorBoundary(*this);
Thomas Witkowski's avatar
Thomas Witkowski committed
309
    ParallelDebug::followBoundary(*this);
Thomas Witkowski's avatar
Thomas Witkowski committed
310

311
    debug::writeMesh(feSpaces[0], -1, debugOutputDir + "macro_mesh");   
312
313

    MSG("Debug mode tests finished!\n");
314
#endif
315

316
    // Create periodic DOF mapping, if there are periodic boundaries.
317
    createPeriodicMap();
318

319
320
321
    // Remove periodic boundary conditions in sequential problem definition. 
    removePeriodicBoundaryConditions();

322
323
324
#if (DEBUG != 0)
    ParallelDebug::testPeriodicBoundary(*this);
#endif
325

326
    // === Global refinements. ===
327
    
Thomas Witkowski's avatar
Thomas Witkowski committed
328
    int globalRefinement = 0;
329
    Parameters::get(mesh->getName() + "->global refinements", globalRefinement);
330
    
Thomas Witkowski's avatar
Thomas Witkowski committed
331
    if (globalRefinement > 0) {
332
      refineManager->globalRefine(mesh, globalRefinement);
333

334
      updateLocalGlobalNumbering();
335

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

338
      createPeriodicMap();
339
340
341
#if (DEBUG != 0)
    ParallelDebug::testPeriodicBoundary(*this);
#endif
Thomas Witkowski's avatar
Thomas Witkowski committed
342
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
343

344
    // Set DOF rank information to all matrices and vectors.
345
    setRankDofs();
Thomas Witkowski's avatar
Thomas Witkowski committed
346

347
    initialized = true;
348
349
  }

350

351
  void MeshDistributor::addProblemStat(ProblemStatSeq *probStat)
352
  {
353
    FUNCNAME("MeshDistributor::addProblemStat()");
354

355
356
357
    TEST_EXIT_DBG(probStat->getFeSpaces().size())
      ("No FE spaces in stationary problem!\n");

358
359
360
361
362
363
364
365
366
367
    // === Add FE spaces from stationary problem to mesh distributor. ===

    for (unsigned int i = 0; i < probStat->getFeSpaces().size(); i++) {
      bool foundFeSpace = false;
      for (unsigned int j = 0; j < feSpaces.size(); j++) {
	if (feSpaces[j] == probStat->getFeSpaces()[i])
	  foundFeSpace = true;

	TEST_EXIT(feSpaces[j]->getMesh() == probStat->getFeSpaces()[i]->getMesh())
	  ("MeshDistributor does not yet support usage of different meshes!\n");
368
369
      }

370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
      if (!foundFeSpace)
	feSpaces.push_back(probStat->getFeSpaces()[i]);
    }

    TEST_EXIT(feSpaces.size() > 0)("Should not happen!\n");

    mesh = feSpaces[0]->getMesh();
    info = probStat->getInfo();
    
    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());
388
    }
389
390
391
    
    partitioner->setMesh(mesh);
    
392
393
394

    // Create parallel serialization file writer, if needed.
    int writeSerialization = 0;
395
    Parameters::get(probStat->getName() + "->output->write serialization",  
396
		    writeSerialization);
397
    if (writeSerialization && !writeSerializationFile) {
398
      string filename = "";
399
      Parameters::get(name + "->output->serialization filename", filename);
400
401
402
      
      TEST_EXIT(filename != "")
	("No filename defined for parallel serialization file!\n");
403
404

      int tsModulo = -1;
405
      Parameters::get(probStat->getName() + "->output->write every i-th timestep", 
406
		      tsModulo);
407
      
408
      probStat->getFileWriterList().push_back(new Serializer<MeshDistributor>(this, filename, tsModulo));
409
410
      writeSerializationFile = true;
    }    
411
412

    int readSerialization = 0;
413
    Parameters::get(probStat->getName() + "->input->read serialization", 
414
		    readSerialization);
415
    if (readSerialization) {
416
      string filename = "";
417
      Parameters::get(probStat->getName() + "->input->serialization filename", 
418
		      filename);
419
      filename += ".p" + lexical_cast<string>(mpiRank);
420
      MSG("Start deserialization with %s\n", filename.c_str());
421
      ifstream in(filename.c_str());
422
423
424
425

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

426
427
428
429
430
      // Read the revision number of the AMDiS version which was used to create 
      // the serialization file.
      int revNumber = -1;
      SerUtil::deserialize(in, revNumber);

431
      probStat->deserialize(in);
432
      in.close();
433
434
      MSG("Deserialization from file: %s\n", filename.c_str());

435
      filename = "";
436
      Parameters::get(name + "->input->serialization filename", filename);
437
438
439
440
      
      TEST_EXIT(filename != "")
	("No filename defined for parallel deserialization file!\n");
      
441
      string rankFilename = filename + ".p" + lexical_cast<string>(mpiRank);
442
443
444
445
      in.open(rankFilename.c_str());
      
      TEST_EXIT(!in.fail())("Could not open parallel deserialization file: %s\n",
			    filename.c_str());
446
447
448
449
450

      // Read the revision number of the AMDiS version which was used to create 
      // the serialization file.
      revNumber = -1;
      SerUtil::deserialize(in, revNumber);
451
452
453
454
455
      
      deserialize(in);
      in.close();
      MSG("Deserializtion of mesh distributor from file: %s\n", rankFilename.c_str());
      deserialized = true;
456
457
    }

458
    problemStat.push_back(probStat);
459

460
461
462
    // If the mesh distributor is already initialized, don't forget to set rank
    // DOFs object to the matrices and vectors of the added stationary problem,
    // and to remove the periodic boundary conditions on these objects.
463

464
    if (initialized) {
465
      setRankDofs(probStat);
466
467
      removePeriodicBoundaryConditions(probStat);
    }
468
469
470
  }


471
472
473
474
475
476
477
478
479
480
481
  void MeshDistributor::addProblemStatGlobal(ProblemStatSeq *probStat)
  {
    FUNCNAME("MeshDistributor::addProblemStatGlobal()");

    if (globalMeshDistributor == NULL)
      globalMeshDistributor = new MeshDistributor();

    globalMeshDistributor->addProblemStat(probStat);
  }


482
  void MeshDistributor::exitParallelization()
483
  {}
484

485
  
486
  void MeshDistributor::testForMacroMesh()
487
  {
488
    FUNCNAME("MeshDistributor::testForMacroMesh()");
489
490
491
492
493
494
495

    int nMacroElements = 0;

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

      TEST_EXIT(elInfo->getType() == 0)
	("Only macro elements with level 0 are supported!\n");
500
501
502
503
504
505
506
507
508
509
      
      nMacroElements++;

      elInfo = stack.traverseNext(elInfo);
    }

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

510

Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
511
  void MeshDistributor::synchVector(SystemVector &vec, int level)
Thomas Witkowski's avatar
Thomas Witkowski committed
512
  {
513
514
    FUNCNAME("MeshDistributor::synchVector()");

Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
515
    TEST_EXIT_DBG(level >= 0 && level <= 1)("Wrong level number!\n");
Thomas Witkowski's avatar
Thomas Witkowski committed
516

Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
517
518
519
520
521
522
    MPI::Intracomm &levelComm = levelData.getMpiComm(level);
    DofComm &dc = (level == 0 ? dofComm : dofCommSd);

    StdMpi<vector<double> > stdMpi(levelComm);

    for (DofComm::Iterator it(dc.getSendDofs()); 
523
	 !it.end(); it.nextRank()) {
524
      vector<double> dofs;
525

526
527
      for (int i = 0; i < vec.getSize(); i++) {
	DOFVector<double> &dofVec = *(vec.getDOFVector(i));
528

Thomas Witkowski's avatar
Thomas Witkowski committed
529
	for (it.beginDofIter(vec.getFeSpace(i)); !it.endDofIter(); it.nextDof())
530
531
	  dofs.push_back(dofVec[it.getDofIndex()]);
      }
532

Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
533
534
535
536
      int rank = it.getRank();
      if (level > 0)
	rank = levelData.mapRank(rank, 0, level);
      stdMpi.send(rank, dofs);
537
    }
538
	   
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
539
540
541
542
543
544
    for (DofComm::Iterator it(dc.getRecvDofs()); !it.end(); it.nextRank()) {
      int rank = it.getRank();
      if (level > 0)
	rank = levelData.mapRank(rank, 0, level);
      stdMpi.recv(rank);
    }
545

546
    stdMpi.startCommunication();
547

Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
548
549
550
551
    for (DofComm::Iterator it(dc.getRecvDofs()); !it.end(); it.nextRank()) {
      int rank = it.getRank();
      if (level > 0)
	rank = levelData.mapRank(rank, 0, level);
552
553

      int counter = 0;
554
      vector<double> &recvData =  stdMpi.getRecvData(rank);
555
556
557
558

      for (int i = 0; i < vec.getSize(); i++) {
	DOFVector<double> &dofVec = *(vec.getDOFVector(i));

559
560
561
562
563
	for (it.beginDofIter(vec.getFeSpace(i)); !it.endDofIter(); it.nextDof()) {
	  TEST_EXIT_DBG(counter < recvData.size())
	    ("Recv data from rank %d has only %d entries!\n", rank, recvData.size());
	  dofVec[it.getDofIndex()] = recvData[counter++];
	}
564
565
566
567
      }
    }
  }

568

569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
  void MeshDistributor::check3dValidMesh()
  {
    FUNCNAME("MeshDistributor::check3dValidMesh()");

    if (mesh->getDim() != 3)
      return;

    std::set<DofEdge> allEdges;
    std::set<int> rankMacroEls;

    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(mesh, 0, Mesh::CALL_EL_LEVEL);
    while (elInfo) {
      for (int i = 0; i < 4; i++) {
	ElementObjectData elData(elInfo->getElement()->getIndex(), i);
584
	allEdges.insert(elObjDb.getEdgeLocalMap(elData));
585
586
587
588
589
590
591
      }

      rankMacroEls.insert(elInfo->getElement()->getIndex());

      elInfo = stack.traverseNext(elInfo);
    }

592
593

    FixRefinementPatch::connectedEdges.clear();
594
    bool valid3dMesh = true;
595
596

    for (std::set<DofEdge>::iterator it = allEdges.begin(); it != allEdges.end(); ++it) {
597
      vector<ElementObjectData>& edgeEls = elObjDb.getElements(*it);
598
599
600
601
602

      TEST_EXIT_DBG(edgeEls.size() > 0)
	("No edge %d/%d in elObjDB!\n", it->first, it->second);

      std::set<int> el0, el1;
603
      map<int, int> edgeNoInEl;
604
605
606

      for (unsigned int i = 0; i < edgeEls.size(); i++) {
	if (rankMacroEls.count(edgeEls[i].elIndex)) {
607
608
609
610
	  if (el0.empty())
	    el0.insert(edgeEls[i].elIndex);
	  else
	    el1.insert(edgeEls[i].elIndex);
611
612
613
614

	  edgeNoInEl[edgeEls[i].elIndex] = edgeEls[i].ithObject;
	}
      }
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
            
      TEST_EXIT_DBG(!el0.empty())("Should not happen!\n");

      if (el1.empty())
	continue;
      
      bool found = false;      
      do {
	found = false;
	for (std::set<int>::iterator elIt = el0.begin(); elIt != el0.end(); ++elIt) {
	  for (int i = 0; i < 4; i++) {
	    int neighEl = macroElementNeighbours[*elIt][i];
	    if (neighEl != -1 && el1.count(neighEl)) {
	      el0.insert(neighEl);
	      el1.erase(neighEl);
	      found = true;
	    }
	  }
	  
	  if (found)
	    break;
	}
      } while (found);
      
      if (!el1.empty()) {
640
641
642
643
	valid3dMesh = false;

	MSG_DBG("Unvalid 3D mesh with %d (%d - %d) elements on this edge!\n", 
		edgeEls.size(), el0.size(), el1.size());
644

645
646
647
	for (std::set<int>::iterator elIt0 = el0.begin(); elIt0 != el0.end(); ++elIt0) {
	  for (std::set<int>::iterator elIt1 = el1.begin(); elIt1 != el1.end(); ++elIt1) {
	    pair<Element*, int> edge0 = 
648
	      make_pair(elObjDb.getElementPtr(*elIt0), edgeNoInEl[*elIt0]);
649
	    pair<Element*, int> edge1 = 
650
	      make_pair(elObjDb.getElementPtr(*elIt1), edgeNoInEl[*elIt1]);
651
652
653
654
655

	    DofEdge dofEdge0 = edge0.first->getEdge(edge0.second);
	    DofEdge dofEdge1 = edge1.first->getEdge(edge1.second);

	    WorldVector<double> c0, c1;
656
657
	    mesh->getDofIndexCoords(dofEdge0.first, feSpaces[0], c0);
	    mesh->getDofIndexCoords(dofEdge0.second, feSpaces[0], c1);
658

659
	    /*
660
661
662
663
	    MSG_DBG("FOUND EDGE: %d %d with coords %f %f %f   %f %f %f\n",
		    dofEdge0.first, dofEdge0.second, 
		    c0[0], c0[1], c0[2],
		    c1[0], c1[1], c1[2]);
664
	    */
665
666
667
668
669
670
671
672
673

	    TEST_EXIT_DBG(dofEdge0 == dofEdge1)("Should noth happen!\n");

	    FixRefinementPatch::connectedEdges.push_back(make_pair(edge0, edge1));
	    FixRefinementPatch::connectedEdges.push_back(make_pair(edge1, edge0));
	  }
	}
      }
    }
674
675

    MSG_DBG("Mesh is 3d valid mesh: %d\n", valid3dMesh);
676
677
678
  }


679
  void MeshDistributor::getAllBoundaryDofs(const FiniteElemSpace *feSpace,
680
					   int level,
681
					   DofContainer& dofs)
682
683
684
685
  {
    FUNCNAME("MeshDistributor::getAllBoundaryDofs()");

    DofContainerSet dofSet;
686
687
    for (DofComm::Iterator it(dofComm.getSendDofs(), level, feSpace); 
	 !it.end(); it.nextRank())
688
      dofSet.insert(it.getDofs().begin(), it.getDofs().end());
689
690
    for (DofComm::Iterator it(dofComm.getRecvDofs(), level, feSpace); 
	 !it.end(); it.nextRank())
691
      dofSet.insert(it.getDofs().begin(), it.getDofs().end());
692
693
694
695
696
697

    dofs.clear();
    dofs.insert(dofs.begin(), dofSet.begin(), dofSet.end());
  }


698
  void MeshDistributor::setRankDofs(ProblemStatSeq *probStat)
699
  {
700
701
    FUNCNAME("MeshDistributor::setRankDofs()");

702
    int nComponents = probStat->getNumComponents();
703
704
    for (int i = 0; i < nComponents; i++) {
      for (int j = 0; j < nComponents; j++)
705
706
707
708
709
710
711
	if (probStat->getSystemMatrix(i, j)) {
	  const FiniteElemSpace *rowFeSpace = 
	    probStat->getSystemMatrix(i, j)->getRowFeSpace();

	  TEST_EXIT(find(feSpaces.begin(), feSpaces.end(), rowFeSpace) != feSpaces.end())
	    ("Should not happen!\n");

Thomas Witkowski's avatar
Thomas Witkowski committed
712
	  probStat->getSystemMatrix(i, j)->setDofMap(dofMap[rowFeSpace]);
713
714
	}
    
715

716
      TEST_EXIT_DBG(probStat->getRhs()->getDOFVector(i))("No RHS vector!\n");
717
718
      TEST_EXIT_DBG(probStat->getSolution()->getDOFVector(i))
	("No solution vector!\n");
719
720
721
      TEST_EXIT_DBG(probStat->getRhsVector(i)->getFeSpace() ==
		    probStat->getSolution(i)->getFeSpace())
	("Should not happen!\n");
722
      
723
724
725
726
      const FiniteElemSpace *feSpace = probStat->getRhsVector(i)->getFeSpace();
      TEST_EXIT(find(feSpaces.begin(), feSpaces.end(), feSpace) != feSpaces.end())
	("Should not happen!\n");

Thomas Witkowski's avatar
Thomas Witkowski committed
727
728
      probStat->getRhsVector(i)->setDofMap(dofMap[feSpace]);
      probStat->getSolution(i)->setDofMap(dofMap[feSpace]);
729
730
731
732
    }    
  }


733
734
  void MeshDistributor::setRankDofs()
  {
735
736
    for (unsigned int i = 0; i < problemStat.size(); i++) 
      setRankDofs(problemStat[i]);
737
738
739
  }


740
741
  void MeshDistributor::removePeriodicBoundaryConditions()
  {
742
743
    FUNCNAME("MeshDistributor::removePeriodicBoundaryConditions()");

744
    // Remove periodic boundaries in boundary manager on matrices and vectors.
745
746
    for (unsigned int i = 0; i < problemStat.size(); i++)
      removePeriodicBoundaryConditions(problemStat[i]);
747
748
749

    // Remove periodic boundaries on elements in mesh.
    TraverseStack stack;
750
    ElInfo *elInfo = stack.traverseFirst(mesh, -1, Mesh::CALL_EVERY_EL_PREORDER);
751
752
753
754
    while (elInfo) {
      elInfo->getElement()->deleteElementData(PERIODIC);
      elInfo = stack.traverseNext(elInfo);
    }    
755
756
757

    // Remove periodic vertex associations
    mesh->getPeriodicAssociations().clear();
758
759
760
  }


761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
  void MeshDistributor::removePeriodicBoundaryConditions(ProblemStatSeq *probStat)
  {
    FUNCNAME("MeshDistributor::removePeriodicBoundaryConditions()");

    int nComponents = probStat->getNumComponents();

    for (int j = 0; j < nComponents; j++) {
      for (int k = 0; k < nComponents; k++) {
	DOFMatrix* mat = probStat->getSystemMatrix(j, k);
	if (mat && mat->getBoundaryManager())
	  removePeriodicBoundaryConditions(const_cast<BoundaryIndexMap&>(mat->getBoundaryManager()->getBoundaryConditionMap()));
      }
      
      if (probStat->getSolution()->getDOFVector(j)->getBoundaryManager())
	removePeriodicBoundaryConditions(const_cast<BoundaryIndexMap&>(probStat->getSolution()->getDOFVector(j)->getBoundaryManager()->getBoundaryConditionMap()));
      
      if (probStat->getRhs()->getDOFVector(j)->getBoundaryManager())
	removePeriodicBoundaryConditions(const_cast<BoundaryIndexMap&>(probStat->getRhs()->getDOFVector(j)->getBoundaryManager()->getBoundaryConditionMap()));
    }
  }


783
  void MeshDistributor::removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap)
Thomas Witkowski's avatar
Thomas Witkowski committed
784
  {
785
786
    FUNCNAME("MeshDistributor::removePeriodicBoundaryConditions()");

Thomas Witkowski's avatar
Thomas Witkowski committed
787
788
    BoundaryIndexMap::iterator it = boundaryMap.begin();
    while (it != boundaryMap.end()) {
789
      if (it->second->isPeriodic())
Thomas Witkowski's avatar
Thomas Witkowski committed
790
	boundaryMap.erase(it++);
791
      else
Thomas Witkowski's avatar
Thomas Witkowski committed
792
793
794
795
796
	++it;      
    }    
  }


797
798
799
800
  void MeshDistributor::createMeshLevelStructure()
  {
    FUNCNAME("MeshDistributor::createMeshLevelStructure()");

801
802
803
    if (mpiSize != 16)
      return;

804
    std::set<int> neighbours;
805
806
    switch (mpiRank) {
    case 0:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
807
      neighbours.insert(1); neighbours.insert(2); neighbours.insert(3);
808
809
      break;
    case 1:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
810
      neighbours.insert(0); neighbours.insert(4); neighbours.insert(2); neighbours.insert(3); neighbours.insert(6);
811
812
      break;
    case 2:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
813
      neighbours.insert(0); neighbours.insert(1); neighbours.insert(3); neighbours.insert(8); neighbours.insert(9);
814
815
      break;
    case 3:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
816
817
818
      neighbours.insert(0); neighbours.insert(1); neighbours.insert(4); 
      neighbours.insert(2); neighbours.insert(6);
      neighbours.insert(8); neighbours.insert(9); neighbours.insert(12); 
819
820
      break;
    case 4:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
821
      neighbours.insert(1); neighbours.insert(3); neighbours.insert(6); neighbours.insert(7); neighbours.insert(5);
822
823
      break;
    case 5:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
824
      neighbours.insert(4); neighbours.insert(6); neighbours.insert(7);
825
826
      break;
    case 6:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
827
828
829
      neighbours.insert(1); neighbours.insert(4); neighbours.insert(5); 
      neighbours.insert(3); neighbours.insert(7);
      neighbours.insert(9); neighbours.insert(12); neighbours.insert(13); 
830
831
      break;
    case 7:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
832
      neighbours.insert(4); neighbours.insert(5); neighbours.insert(6);  neighbours.insert(12); neighbours.insert(13);
833
834
      break;
    case 8:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
835
      neighbours.insert(2); neighbours.insert(3); neighbours.insert(9);  neighbours.insert(10); neighbours.insert(11);
836
837
      break;
    case 9:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
838
839
840
      neighbours.insert(2); neighbours.insert(3); neighbours.insert(6); 
      neighbours.insert(8); neighbours.insert(12);
      neighbours.insert(10); neighbours.insert(11); neighbours.insert(14); 
841
842
      break;
    case 10:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
843
      neighbours.insert(8); neighbours.insert(9); neighbours.insert(11);
844
845
      break;
    case 11:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
846
      neighbours.insert(8); neighbours.insert(9); neighbours.insert(12);  neighbours.insert(10); neighbours.insert(14);
847
848
      break;
    case 12:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
849
850
851
      neighbours.insert(3); neighbours.insert(6); neighbours.insert(7); 
      neighbours.insert(9); neighbours.insert(13);
      neighbours.insert(11); neighbours.insert(14); neighbours.insert(15); 
852
853
      break;
    case 13:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
854
      neighbours.insert(6); neighbours.insert(7); neighbours.insert(12);  neighbours.insert(14); neighbours.insert(15);
855
856
      break;
    case 14:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
857
      neighbours.insert(9); neighbours.insert(12); neighbours.insert(13);  neighbours.insert(11); neighbours.insert(15);
858
859
      break;
    case 15:
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
860
      neighbours.insert(12); neighbours.insert(13); neighbours.insert(14);
861
862
      break;
    }    
863

864
    TEST_EXIT(neighbours.size() > 0)("Should not happen!\n");
865
866
867

    levelData.init(neighbours);

868
869
    MSG("INIT MESH LEVEL %d\n", levelData.getLevelNumber());

870
871
872
873
    bool multiLevelTest = false;
    Parameters::get("parallel->multi level test", multiLevelTest);
    if (multiLevelTest) {
      switch (mpiRank) {
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
874
      case 0: case 1: case 2: case 3:
875
876
	{
	  std::set<int> m;
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
877
	  m.insert(0); m.insert(1); m.insert(2); m.insert(3);
878
	  levelData.addLevel(m, 0);
Thomas Witkowski's avatar
A