MacroReader.cc 44.8 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.


13
14
15
16
#include <string.h>
#include <map>
#include <iostream>
#include <fstream>
17
18
19
#include "MacroReader.h"
#include "MacroWriter.h"
#include "MacroElement.h"
20
#include "MacroInfo.h"
21
22
23
24
25
#include "Boundary.h"
#include "FiniteElemSpace.h"
#include "Mesh.h"
#include "FixVec.h"
#include "ElInfo.h"
26
#include "Initfile.h"
27
28
29
30
31
32
#include "DOFIterator.h"
#include "LeafData.h"
#include "VertexVector.h"

namespace AMDiS {

33
  MacroInfo* MacroReader::readMacro(std::string filename, 
34
				    Mesh* mesh,
35
				    std::string periodicFile,
36
37
				    int check)
  {
38
    FUNCNAME("MacroReader::readMacro()");
39

40
41
    TEST_EXIT(filename != "")("no file specified; filename NULL pointer\n");  

Thomas Witkowski's avatar
Thomas Witkowski committed
42
    MacroInfo *macroInfo = new MacroInfo();
43
44
    macroInfo->readAMDiSMacro(filename, mesh);

45
    std::deque<MacroElement*>::iterator mel = macroInfo->mel.begin();
46
47
48
    int **melVertex = macroInfo->mel_vertex;
    WorldVector<double> *coords = macroInfo->coords;
    DegreeOfFreedom **dof = macroInfo->dof;
49
50

    // === read periodic data =================================
51
    if (periodicFile != "") {   
52
53
      FILE *file = fopen(periodicFile.c_str(), "r");
      TEST_EXIT(file)("can't open file %s\n", periodicFile.c_str());
54
55
56
57
58

      int n;
      int dim = mesh->getDim();

      int el1, el2;
Thomas Witkowski's avatar
Thomas Witkowski committed
59
60
      int *verticesEl1 = new int[dim];
      int *verticesEl2 = new int[dim];
61
      int mode = -1; // 0: drop dofs, 1: associate dofs
62
      int result = 0;
63
      BoundaryType boundaryType;
64
      MacroReader::PeriodicMap periodicMap;
65

66
67
      result = fscanf(file, "%*s %d", &n);
      result = fscanf(file, "%*s %*s %*s %*s %*s %*s %*s %*s %*s %*s %*s");
68
   
69
      for (int i = 0; i < n; i++) {
70
71
	std::map<int, int> vertexMapEl1;
	std::map<int, int> vertexMapEl2;
72

73
74
	result = fscanf(file, "%d", &mode);
	TEST_EXIT(result == 1)("mode?\n");
75
      
76
77
	result = fscanf(file, "%d", &boundaryType);
	TEST_EXIT(result == 1)("boundaryType?\n");
78
      
79
80
81
	result = fscanf(file, "%d", &el1);
	TEST_EXIT(result == 1)("el1?\n");

82
	for (int j = 0; j < dim; j++) {
83
84
	  result = fscanf(file, "%d", &verticesEl1[j]);
	  TEST_EXIT(result == 1)("vertEl1[%d]\n", j);
85
	}
86
87
	result = fscanf(file, "%d", &el2);
	TEST_EXIT(result == 1)("el2?\n");
88
	for (int j = 0; j < dim; j++) {
89
90
	  result = fscanf(file, "%d", &verticesEl2[j]);
	  TEST_EXIT(result == 1)("vertEl2[%d]\n", j);
91
	}
92
	for (int j = 0; j < dim; j++) {
Thomas Witkowski's avatar
Thomas Witkowski committed
93
	  if (mode == 0)
94
	    periodicMap.setEntry(melVertex[el1][verticesEl1[j]], 
Thomas Witkowski's avatar
Thomas Witkowski committed
95
				 melVertex[el2][verticesEl2[j]]);	  
96
97
98
99
100
101
	  vertexMapEl1[verticesEl1[j]] = verticesEl2[j];
	  vertexMapEl2[verticesEl2[j]] = verticesEl1[j];
	}

	// calculate sides of periodic vertices
	int sideEl1 = 0, sideEl2 = 0;
102
	if (dim == 1) {
103
104
105
	  sideEl1 = verticesEl1[0];
	  sideEl2 = verticesEl2[0];
	} else {
106
	  for (int j = 0; j < dim + 1; j++) {
107
108
109
	    sideEl1 += j;
	    sideEl2 += j;
	  }
110
	  for (int j = 0; j < dim; j++) {
111
112
113
114
	    sideEl1 -= verticesEl1[j];
	    sideEl2 -= verticesEl2[j];
	  }
	}
115

116
	// create periodic info
117
118
	DimVec<WorldVector<double> > periodicCoordsEl1(dim - 1, NO_INIT);
	DimVec<WorldVector<double> > periodicCoordsEl2(dim - 1, NO_INIT);
119

120
121
	Element *element1 = const_cast<Element*>((*(mel + el1))->getElement());
	Element *element2 = const_cast<Element*>((*(mel + el2))->getElement());
122
     
123
	// for all vertices of this side
124
	for (int j = 0; j < dim; j++) {
125
126
	  periodicCoordsEl1[element1->getPositionOfVertex(sideEl1, verticesEl1[j])] = 
	    coords[melVertex[el2][vertexMapEl1[verticesEl1[j]]]];
127

128
129
130
	  periodicCoordsEl2[element2->getPositionOfVertex(sideEl2, verticesEl2[j])] =
	    coords[melVertex[el1][vertexMapEl2[verticesEl2[j]]]];
	}
131
	     
132
133
134
135
	// decorate leaf data
	ElementData *ld1 = element1->getElementData();
	ElementData *ld2 = element2->getElementData();

136
137
138
139
140
141
142
143
	TEST_EXIT_DBG(ld1)
	  ("Should not happen: no element data pointer in macro element %d!\n",
	   element1->getIndex());

	TEST_EXIT_DBG(ld2)
	  ("Should not happen: no element data pointer in macro element %d!\n",
	   element2->getIndex());

144
145
146
147
	LeafDataPeriodic *ldp1 = 
	  dynamic_cast<LeafDataPeriodic*>(ld1->getElementData(PERIODIC));
	LeafDataPeriodic *ldp2 = 
	  dynamic_cast<LeafDataPeriodic*>(ld2->getElementData(PERIODIC));
148
149

	if (!ldp1) {
Thomas Witkowski's avatar
Thomas Witkowski committed
150
	  ldp1 = new LeafDataPeriodic(ld1);
151
152
153
154
	  element1->setElementData(ldp1);
	}

	if (!ldp2) {
Thomas Witkowski's avatar
Thomas Witkowski committed
155
	  ldp2 = new LeafDataPeriodic(ld2);
156
157
158
	  element2->setElementData(ldp2);
	}

159
160
	ldp1->addPeriodicInfo(mode, boundaryType, sideEl1, &periodicCoordsEl1);
	ldp2->addPeriodicInfo(mode, boundaryType, sideEl2, &periodicCoordsEl2);
161
162
163

	if (mode != 0) {
	  VertexVector *associated = mesh->periodicAssociations[boundaryType];
164

165
	  if (!associated) {
Thomas Witkowski's avatar
Thomas Witkowski committed
166
	    associated = new VertexVector(mesh->getVertexAdmin(), "vertex vector");
167
168
	    mesh->periodicAssociations[boundaryType] = associated;
	    VertexVector::Iterator it(associated, ALL_DOFS);
169
	    for (it.reset2(); !it.end(); ++it)
170
171
172
	      *it = it.getDOFIndex();
	  }

173
	  for (int j = 0; j < dim; j++) {
174
175
176
177
178
179
180
181
	    (*associated)[melVertex[el1][verticesEl1[j]]] =
	      melVertex[el2][vertexMapEl1[verticesEl1[j]]];
	    (*associated)[melVertex[el2][verticesEl2[j]]] =
	      melVertex[el1][vertexMapEl2[verticesEl2[j]]];
	  }
	}
      }    

Thomas Witkowski's avatar
Thomas Witkowski committed
182
183
      delete [] verticesEl1;
      delete [] verticesEl2;
184
185

      // change periodic vertex dofs
186
      for (int i = 0; i < mesh->getNumberOfVertices(); i++) {
187
	if (periodicMap.getEntry(i) != -1) {
188
	  mesh->freeDof(dof[i], VERTEX);
189
190
	  dof[i] = dof[periodicMap.getEntry(i)];

191
192
	  std::map<BoundaryType, VertexVector*>::iterator assoc;
	  std::map<BoundaryType, VertexVector*>::iterator assocEnd =
193
	    mesh->periodicAssociations.end();
194

195
	  for (assoc = mesh->periodicAssociations.begin(); assoc != assocEnd; ++assoc) {
196
197
198
199
200

	    DegreeOfFreedom a = (*(assoc->second))[i];
	    if (a != i) {
	      (*(assoc->second))[i] = i;
	      (*(assoc->second))[a] = periodicMap.getEntry(i);
201
	    }
202
203
	  }

204
205
206
	}
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
207
#if (DEBUG != 0)
208
209
      std::map<BoundaryType, VertexVector*>::iterator assoc;
      std::map<BoundaryType, VertexVector*>::iterator assocEnd =
210
	mesh->periodicAssociations.end();
Thomas Witkowski's avatar
Thomas Witkowski committed
211
212
      for (assoc = mesh->periodicAssociations.begin(); 
	   assoc != assocEnd; ++assoc)
Thomas Witkowski's avatar
Thomas Witkowski committed
213
	for (int i = 0; i < mesh->getNumberOfVertices(); i++)
214
215
	  if (i != (*(assoc->second))[i])
	    MSG("association %d: vertex %d -> vertex %d\n", 
Thomas Witkowski's avatar
Thomas Witkowski committed
216
		assoc->first, i, (*(assoc->second))[i]);
217

218
219
220
221
      for (int i = 0; i < mesh->getNumberOfVertices(); i++)
	if (periodicMap.getEntry(i) != -1)
	  MSG("identification : vertex %d is now vertex %d\n", 
	      i, periodicMap.getEntry(i));
Thomas Witkowski's avatar
Thomas Witkowski committed
222
#endif
223
224
225

    } // periodicFile

226

227
228
    // =========================================================

229
230
231
    for (int i = 0; i < mesh->getNumberOfMacros(); i++) {
      for (int k = 0; k < mesh->getGeo(VERTEX); k++) {
	(*(mel + i))->setCoord(k, coords[melVertex[i][k]]);
232

233
	const_cast<Element*>((*(mel + i))->getElement())->
234
	  setDof(k, dof[melVertex[i][k]]);
235
      }
236
    }
237

238
    if (!macroInfo->neigh_set) {
239
      TEST_EXIT(periodicFile == "")
240
	("periodic boundary condition => element neighbours must be set\n");
241
      computeNeighbours(mesh);
242
    } else {
243
244
245
      /****************************************************************************/
      /* fill MEL oppVertex values when reading neighbour information form file  */
      /****************************************************************************/
246

247
248
249
250
251
      for (int i = 0; i < mesh->getNumberOfMacros(); i++) {
	for (int k = 0; k < mesh->getGeo(NEIGH); k++) {
	  MacroElement *neigh = const_cast<MacroElement*>(mel[i]->getNeighbour(k));

	  if (neigh) {
252
253
	    int j = 0;
	    for (; j < mesh->getGeo(NEIGH); j++)
254
255
	      if (neigh->getNeighbour(j) == *(mel + i))  
		break;
256
	
257
258
259
260
261
	    TEST_EXIT(j < mesh->getGeo(NEIGH))("el %d no neighbour of neighbour %d\n", 
					       mel[i]->getIndex(), neigh->getIndex());
	    mel[i]->setOppVertex(k, j);
	  } else {
	    mel[i]->setOppVertex(k, -1);
262
	  }
263
	}
264
      }
265
    }
266

267
268
    if (!macroInfo->bound_set)
      macroInfo->dirichletBoundary();    
269
  
270
    if (mesh->getDim() > 1)
271
272
273
274
275
276
      boundaryDOFs(mesh);

    // initial boundary projections
    int numFaces = mesh->getGeo(FACE);
    int dim = mesh->getDim();
    mel = mesh->firstMacroElement();
277
    for (int i = 0; i < mesh->getNumberOfLeaves(); i++) {
278
      MacroElement *macroEl = *(mel + i);
279
      Projection *projector = macroEl->getProjection(0);
280
      if (projector && projector->getType() == VOLUME_PROJECTION) {
Thomas Witkowski's avatar
Thomas Witkowski committed
281
282
	for (int j = 0; j <= dim; j++)
	  projector->project(macroEl->getCoord(j));	
283
      } else {
284
	for (int j = 0; j < mesh->getGeo(EDGE); j++) {
285
	  projector = macroEl->getProjection(numFaces + j);
286
	  if (projector) {
287
288
289
290
291
292
293
294
295
296
297
	    int vertex0 = Global::getReferenceElement(dim)->getVertexOfEdge(j, 0);
	    int vertex1 = Global::getReferenceElement(dim)->getVertexOfEdge(j, 1);
	    projector->project(macroEl->getCoord(vertex0));
	    projector->project(macroEl->getCoord(vertex1));
	  }
	}
      }
    }

    macroInfo->fillBoundaryInfo(mesh);

298
    if (mesh->getNumberOfDofs(CENTER)) {
299
      for (int i = 0; i < mesh->getNumberOfMacros(); i++)
300
	const_cast<Element*>(mel[i]->getElement())->
301
	  setDof(mesh->getNode(CENTER), mesh->getDof(CENTER));
302
303
    }

304
    // === Domain size ===
305

306
    WorldVector<double> x_min, x_max;
307

308
309
310
311
312
313
314
    for (int j = 0; j < Global::getGeo(WORLD); j++) {
      x_min[j] =  1.E30;
      x_max[j] = -1.E30;
    }

    for (int i = 0; i < mesh->getNumberOfVertices(); i++) {
      for (int j = 0; j < Global::getGeo(WORLD); j++) {
315
316
	x_min[j] = std::min(x_min[j], coords[i][j]);
	x_max[j] = std::max(x_max[j], coords[i][j]);
317
318
      }
    }
319

320
    for (int j = 0; j < Global::getGeo(WORLD); j++)
321
322
323
324
325
      mesh->setDiameter(j, x_max[j] - x_min[j]);

    if (check) {
      checkMesh(mesh);

Thomas Witkowski's avatar
Thomas Witkowski committed
326
327
      if (mesh->getDim() > 1)
	macroTest(mesh);
328
329
    }

330
    return macroInfo;
331
332
333
334
335
  }


  void MacroReader::computeNeighbours(Mesh *mesh)
  {
336
    FUNCNAME("MacroReader::computeNeighbours()");
337

338
    int dim = mesh->getDim();
339
    FixVec<DegreeOfFreedom*, DIMEN> dof(dim, NO_INIT);
340

341
342
343
344
    for (int i = 0; i < mesh->getNumberOfLeaves(); i++) {
      for (int k = 0; k < mesh->getGeo(NEIGH); k++) {
	mesh->getMacroElement(i)->setOppVertex(k, AMDIS_UNDEFINED);
	mesh->getMacroElement(i)->setNeighbour(k, NULL);
345
      }
346
    }
347

348
349
350
351
352
353
354
    for (int i = 0; i < mesh->getNumberOfLeaves(); i++) {
      for (int k = 0; k < mesh->getGeo(NEIGH); k++) {
	if (mesh->getMacroElement(i)->getBoundary(k) != INTERIOR) {
	  mesh->getMacroElement(i)->setNeighbour(k, NULL);
	  mesh->getMacroElement(i)->setOppVertex(k, -1);
	  continue;
	}
355

356
357
358
	if (mesh->getMacroElement(i)->getOppVertex(k) == AMDIS_UNDEFINED) {
	  if (dim == 1) {
	    dof[0] = const_cast<DegreeOfFreedom*>(mesh->getMacroElement(i)->
359
						  getElement()->getDof(k));
360
361
362
363
	  } else {
	    for (int l = 0; l < dim; l++)
	      dof[l] = const_cast<DegreeOfFreedom*>(mesh->getMacroElement(i)->
						    getElement()->
364
						    getDof((k + l + 1) % (dim + 1)));
365
	  }
366
367
368
369
370
371
372
373
374
375
376
377
378
	  
	  int j = 0;
	  for (j = i + 1; j < mesh->getNumberOfLeaves(); j++) {
	    int m = mesh->getMacroElement(j)->getElement()->oppVertex(dof);
	    if (m != -1) {
	      mesh->getMacroElement(i)->setNeighbour(k, mesh->getMacroElement(j));
	      mesh->getMacroElement(j)->setNeighbour(m, mesh->getMacroElement(i));
	      mesh->getMacroElement(i)->setOppVertex(k, m);
	      mesh->getMacroElement(j)->setOppVertex(m, k);
	      break;
	    }
	  }

379
380
381
382
383
384
385
	  if (j >= mesh->getNumberOfLeaves()) {
	    std::cout << "----------- ERROR ------------" << std::endl;
	    std::cout << "Cannot find neighbour " << k << " of element " << i << std::endl;
	    std::cout << "  dim = " << dim << std::endl;
	    std::cout << "  coords of element = ";
	    for (int l = 0; l <= dim; l++) {
	      std::cout << mesh->getMacroElement(i)->getCoord(l);
386
387
	      if (l < dim)
		std::cout << " / ";	      
388
389
390
	    }
	    std::cout << std::endl;
	    std::cout << "  dofs = ";
391
392
	    for (int l = 0; l < dim; l++)
	      std::cout << *(dof[l]) << " ";	    
393
394
395
396
	    std::cout << std::endl;

	    ERROR_EXIT("\n");
	  }    
397
	}
398
      }
399
    }
400
401
402
403
404
405
406
407
408
409
410
  }


  /****************************************************************************/
  /*  boundaryDOFs:                                                           */
  /*  adds dof's at the edges of a given macro triangulation and calculates   */
  /*  the number of edges                                                     */
  /****************************************************************************/

  void MacroReader::boundaryDOFs(Mesh *mesh)
  {
411
412
413
414
415
    FUNCNAME("Mesh::boundaryDOFs()");

    int lnode = mesh->getNode(EDGE);
    int k, lne = mesh->getNumberOfLeaves();
    int max_n_neigh = 0, n_neigh, ov;
416
    std::deque<MacroElement*>::iterator mel;
417
    const MacroElement* neigh;
418
    DegreeOfFreedom *dof;
419
420
421
422
423
424

    mesh->setNumberOfEdges(0);
    mesh->setNumberOfFaces(0);

    int dim = mesh->getDim();

Thomas Witkowski's avatar
Thomas Witkowski committed
425
    switch (dim) {
426
    case 2:
427
      for (mel = mesh->firstMacroElement(); mel != mesh->endOfMacroElements(); mel++) {
428
429
430
431
432
433
	// check for periodic boundary
	Element *el = const_cast<Element*>((*mel)->getElement());
	ElementData *ed = el->getElementData(PERIODIC);

	DimVec<bool> periodic(dim, DEFAULT_VALUE, false);

434
	if (ed) {
435
	  std::list<LeafDataPeriodic::PeriodicInfo> &periodicInfos = 
436
	    dynamic_cast<LeafDataPeriodic*>(ed)->getInfoList();
437
438
	  std::list<LeafDataPeriodic::PeriodicInfo>::iterator it;
	  std::list<LeafDataPeriodic::PeriodicInfo>::iterator end = periodicInfos.end();
Thomas Witkowski's avatar
Thomas Witkowski committed
439
440
	  for (it = periodicInfos.begin(); it != end; ++it)
	    if (it->type != 0)
441
442
443
	      periodic[it->elementSide] = true;
	}

444
	for (int i = 0; i < mesh->getGeo(NEIGH); i++) {
445
	  if (!(*mel)->getNeighbour(i) || 
446
447
448
449
	      ((*mel)->getNeighbour(i)->getIndex() < (*mel)->getIndex())) {

	    mesh->incrementNumberOfEdges(1);

450
	    if (mesh->getNumberOfDofs(EDGE)) {
451
452
	      dof = mesh->getDof(EDGE);
	      el->setDof(lnode + i, dof);
453
454
      
	      if ((*mel)->getNeighbour(i)) {
Thomas Witkowski's avatar
Thomas Witkowski committed
455
456
		Element *neigh = 
		  const_cast<Element*>((*mel)->getNeighbour(i)->getElement());
457

Thomas Witkowski's avatar
Thomas Witkowski committed
458
		if (periodic[i])
459
		  neigh->setDof(lnode + (*mel)->getOppVertex(i), mesh->getDof(EDGE));
Thomas Witkowski's avatar
Thomas Witkowski committed
460
		else
461
		  neigh->setDof(lnode + (*mel)->getOppVertex(i), dof);		
462
	      }
463
464
	    }
	  }  
465
466
467
468
469
470
	}
      }
      break;
    case 3:
      lnode = mesh->getNode(FACE);
      mel = mesh->firstMacroElement();
471
      for (int i = 0; i < lne; i++) {
472
473
474
475
476
477
478

	// check for periodic boundary
	Element *el = const_cast<Element*>((*(mel+i))->getElement());
	ElementData *ed = el->getElementData(PERIODIC);

	DimVec<bool> periodic(dim, DEFAULT_VALUE, false);
      
479
	if (ed) {
480
	  std::list<LeafDataPeriodic::PeriodicInfo> &periodicInfos = 
481
	    dynamic_cast<LeafDataPeriodic*>(ed)->getInfoList();
482
483
	  std::list<LeafDataPeriodic::PeriodicInfo>::iterator it;
	  std::list<LeafDataPeriodic::PeriodicInfo>::iterator end = periodicInfos.end();
484
485
	  for (it = periodicInfos.begin(); it != end; ++it)
	    if (it->type != 0)
486
487
488
	      periodic[it->elementSide] = true;
	}

489
490
	for (k = 0; k < mesh->getGeo(EDGE); k++) {
	  // === Check for not counted edges. ===
491
492
	  n_neigh = 1;

Thomas Witkowski's avatar
Thomas Witkowski committed
493
	  if (newEdge(mesh, (*(mel + i)), k, &n_neigh)) {
494
	    mesh->incrementNumberOfEdges(1);
495
	    max_n_neigh = std::max(max_n_neigh, n_neigh);
496
497
498
499
	  }
	}
      
	for (k = 0; k < mesh->getGeo(NEIGH); k++) {
Thomas Witkowski's avatar
Thomas Witkowski committed
500
	  neigh = (*(mel + i))->getNeighbour(k);
501
	  // === Face is counted and dof is added by the element with bigger index. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
502
503
	  if (neigh && (neigh->getIndex() > (*(mel + i))->getIndex()))  
	    continue;
504
505
506
	
	  mesh->incrementNumberOfFaces(1);
	
507
	  if (mesh->getNumberOfDofs(FACE)) {
508
	    TEST_EXIT(!(*(mel + i))->getElement()->getDof(lnode + k))
509
	      ("dof %d on element %d already set\n", 
Thomas Witkowski's avatar
Thomas Witkowski committed
510
	       lnode + k, (*(mel + i))->getIndex());
511
	  
512
	    const_cast<Element*>((*(mel + i))->getElement())->setDof(lnode + k,
513
								     mesh->getDof(FACE));
514
515

	    if (neigh) {
Thomas Witkowski's avatar
Thomas Witkowski committed
516
	      ov = (*(mel + i))->getOppVertex(k);
517
	      TEST_EXIT(!neigh->getElement()->getDof(lnode + ov))
518
		("dof %d on neighbour %d already set\n", 
Thomas Witkowski's avatar
Thomas Witkowski committed
519
		 lnode + ov, neigh->getIndex());
520
521
	    
	      Element *neighEl = 
Thomas Witkowski's avatar
Thomas Witkowski committed
522
		const_cast<Element*>((*(mel + i))->getNeighbour(k)->getElement());
523

Thomas Witkowski's avatar
Thomas Witkowski committed
524
	      if (periodic[k])
525
		neighEl->setDof(lnode+ov, mesh->getDof(FACE));
Thomas Witkowski's avatar
Thomas Witkowski committed
526
	      else
527
528
		neighEl->setDof(lnode+ov, const_cast<int*>((*(mel + i))->getElement()->
							   getDof(lnode + k)));	      
529
530
531
532
533
	    }
	  }
	}
      }
      break;
Thomas Witkowski's avatar
Thomas Witkowski committed
534
535
    default: 
      ERROR_EXIT("invalid dim\n");
536
537
    }
    
538
    if (3 == dim)
Thomas Witkowski's avatar
Thomas Witkowski committed
539
      mesh->setMaxEdgeNeigh(std::max(8, 2 * max_n_neigh));
540
    else
Thomas Witkowski's avatar
Thomas Witkowski committed
541
      mesh->setMaxEdgeNeigh(dim - 1);    
542
543
544
545
546
547
548
549
550
551
552
  }

  /* 
     testet mesh auf auftretende Zyklen
  
     wenn Zyklus auftritt:
     ordnet Eintraege in MacroElement-Struktur um, so dass kein Zyklus auftritt
     erzeugt neue Macro-Datei nameneu mit umgeordnetem Netz 
     (wenn nameneu=NULL wird keine MAcro-Datei erzeugt)
  */      

Thomas Witkowski's avatar
Thomas Witkowski committed
553
  void MacroReader::macroTest(Mesh *mesh)
554
  {
555
    FUNCNAME("MacroReader::macroTest()");
556
   
557
558
559
    int i = macrotest(mesh);

    if (i >= 0) {
Thomas Witkowski's avatar
Thomas Witkowski committed
560
561
      WARNING("There is a cycle beginning in macro element %d\n", i);
      WARNING("Entries in MacroElement structures get reordered\n");
562
563
      umb(NULL, mesh, umbVkantMacro);
    }
564
565
566
567
568
569
570
571
572
573
574
575
576
577
  }
  
  /****************************************************************************/
  /*  macro_test():                              Author: Thomas Kastl (1998)  */
  /****************************************************************************/
  /*
    testet mesh auf auftretende Zyklen
  
    wenn mesh zyklenfrei -> -1
    sonst ->  globaler Index des Macroelementes bei dem ein Zyklus beginnt 
  */

  int MacroReader::macrotest(Mesh *mesh)
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
578
579
    std::deque<MacroElement*>::const_iterator macro, mac;
    int flg = 0;
580
    int dim = mesh->getDim();
Thomas Witkowski's avatar
Thomas Witkowski committed
581
582
    int *test = new int[mesh->getNumberOfMacros()];
    int *zykl = new int[mesh->getNumberOfMacros()];
583
 
Thomas Witkowski's avatar
Thomas Witkowski committed
584
    for (int i = 0; i < mesh->getNumberOfMacros(); i++)
585
      test[i] = 0;
586

Thomas Witkowski's avatar
Thomas Witkowski committed
587
588
    int zykstart = -1;
    std::deque<MacroElement*>::const_iterator macrolfd = mesh->firstMacroElement();
589

590
591
592
593
    while (macrolfd != mesh->endOfMacroElements()) {
      if (test[(*macrolfd)->getIndex()] == 1) {
	macrolfd++;
      } else {
594
595
	for (int i = 0; i < mesh->getNumberOfMacros(); i++)
	  zykl[i] = 0;	
596
    
597
598
599
600
601
602
603
604
	macro = macrolfd;
	flg = 2;
	do {
	  if (zykl[(*macro)->getIndex()] == 1) {
	    flg = 0;
	    zykstart = (*macro)->getIndex();
	  } else {
	    zykl[(*macro)->getIndex()] = 1;
605
      
606
607
608
609
610
	    if (test[(*macro)->getIndex()] == 1) {
	      flg = 1;
	    } else if ((*macro)->getNeighbour(dim) == NULL) {
	      flg = 1;
	      test[(*macro)->getIndex()] = 1;
Thomas Witkowski's avatar
Thomas Witkowski committed
611
	    } else if ((*macro) == (*macro)->getNeighbour(dim)->getNeighbour(dim)) {
612
613
614
615
	      flg = 1;
	      test[(*macro)->getIndex()] = 1;
	      test[(*macro)->getNeighbour(dim)->getIndex()] = 1;
	    } else {
Thomas Witkowski's avatar
Thomas Witkowski committed
616
617
	      for (mac = mesh->firstMacroElement(); 
		   (*mac) != (*macro)->getNeighbour(dim); mac++);
618
619
620
621
	      macro = mac;
	    } 
	  }	  
	} while(flg == 2);
622
 
623
	if (flg == 1)
624
	  macrolfd++;
625
626
	else 
	  macrolfd=mesh->endOfMacroElements();	
627
      }
628
    }
629
  
Thomas Witkowski's avatar
Thomas Witkowski committed
630
631
    delete [] zykl;
    delete [] test;
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
 
    return zykstart;
  }

  //   waehlt geeignete Verfeinerungskanten, so dass kein Zyklus auftritt (recumb)

  //   ele     Integer-Vektor der Dimension Anzahl der Macro-Elemente
  //           zur Speicherung der neuen Verfeinerungskanten
  //           (wird nur benoetigt, wenn umbvk=umb_vkant_macrodat) 
  
  //   umbvk   Fkt. zur Neuordnung der Verfeinerungskanten
  //           = umb_vkant_macro :
  //               Eintraege in MacroElement-Struktur und Eintraege in macro->el
  //               werden tatsaechlich umgeordnet
  //               -> ALBERT-Routine write_macro kann zum erzeugen einer
  //                  neuen Macro-Datei angewendet werden 
  //           = umb_vkant_macrodat :
  //               Eintraege werden nicht veraendert, es werden nur die lokalen
  //               Indices der Kanten, die zu Verfeinerungskanten werden im
  //               Integer-Vektor ele abgespeichert
  //               -> print_Macrodat zur Erzeugung einer zyklenfreien neuen
  //                  Macro-Datei kann angewendet werden

  void MacroReader::umb(int *ele, Mesh *mesh,
Thomas Witkowski's avatar
Thomas Witkowski committed
656
			void (*umbvk)(Mesh*, MacroElement*, int, int*))
657
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
658
    int *test = new int[mesh->getNumberOfMacros()];
659
  
Thomas Witkowski's avatar
Thomas Witkowski committed
660
661
    for (int i = 0; i < static_cast<int>(mesh->getNumberOfMacros()); i++)
      test[i] = 0;
662

Thomas Witkowski's avatar
Thomas Witkowski committed
663
    recumb(mesh, (*mesh->firstMacroElement()), NULL, test, 0, 0, ele, umbvk);
664

Thomas Witkowski's avatar
Thomas Witkowski committed
665
    delete [] test;
666
667
668
669
670
  }

  bool MacroReader::newEdge(Mesh *mesh, MacroElement *mel,
			    int mel_edge_no, int *n_neigh)
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
671
672
    FUNCNAME("MacroElement::newEdge()"); 
    MacroElement *nei;
673
674
    const DegreeOfFreedom *dof[2];
    DegreeOfFreedom *edge_dof = NULL;
Thomas Witkowski's avatar
Thomas Witkowski committed
675
676
    int j, k, opp_v, node = 0;
    BoundaryType lbound = INTERIOR;
677
    Projection *lproject = NULL;
Thomas Witkowski's avatar
Thomas Witkowski committed
678
    const int max_no_list_el = 100;
679
680
681
682
    BoundaryType *list_bound[100];
    Projection **list_project[100];
    Element *el = const_cast<Element*>(mel->getElement());
    int edge_no = mel_edge_no;
Thomas Witkowski's avatar
Thomas Witkowski committed
683
    static int next_el[6][2] = {{3,2},{1,3},{1,2},{0,3},{0,2},{0,1}};
684
685
    int vertices = mesh->getGeo(VERTEX);

Thomas Witkowski's avatar
Thomas Witkowski committed
686
    int mel_index = mel->getIndex();
687
688
689
690

    list_bound[0] = &(mel->boundary[mesh->getGeo(FACE)+edge_no]);
    list_project[0] = &(mel->projection[mesh->getGeo(FACE)+edge_no]);

691
    if (mesh->getNumberOfDofs(EDGE)) {
692
      node = mesh->getNode(EDGE);
693
      if (el->getDof(node+edge_no)) {
694
695
696
697
698
699
	/****************************************************************************/
	/*  edge was counted by another macro element and dof was added on the      */
	/*  complete patch                                                          */
	/****************************************************************************/
	return false;
      } else {
700
701
	edge_dof = mesh->getDof(EDGE);
	el->setDof(node+edge_no, edge_dof);
702
703
704
      }
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
705
    for (j = 0; j < 2; j++)
706
      dof[j] = el->getDof(el->getVertexOfEdge(edge_no, j));
Thomas Witkowski's avatar
Thomas Witkowski committed
707
    
708
709
710
711
712
713
714
715
716
717
718
719
    /****************************************************************************/
    /*  first look for all neighbours in one direction until a boundary is      */
    /*  reached :-( or we are back to mel :-)                                   */
    /*  if the index of a neighbour is smaller than the element index, the edge */
    /*  is counted by this neighbour, return 0.                                 */
    /*  If we are back to element, return 1, to count the edge                  */
    /****************************************************************************/

    nei = mel->getNeighbour(next_el[edge_no][0]);
    opp_v = mel->getOppVertex(next_el[edge_no][0]);


720
    if (mel->getBoundary(next_el[edge_no][0])) {
721
722
723
724
725
726
      lbound = newBound(mel->getBoundary(next_el[edge_no][0]), lbound);
      lproject = mel->getProjection(next_el[edge_no][0]);
    }

    while (nei  &&  nei != mel) {
      for (j = 0; j < vertices; j++)
727
	if (nei->getElement()->getDof(j) == dof[0])  break;
728
      for (k = 0; k < vertices; k++)
729
	if (nei->getElement()->getDof(k) == dof[1])  break;
730
731

      // check for periodic boundary
732
      if (j == 4 || k == 4) {
733
734
735
736
	nei = NULL;
	break;
      }

737
      if (mesh->getNumberOfDofs(EDGE)) {
738
739
	TEST_EXIT(nei->index > mel_index)
	  ("neighbour index %d < element index %d\n", nei->getIndex(), mel_index);
740
      }
741

742
      if (!mesh->getNumberOfDofs(EDGE) && nei->getIndex() < mel_index) 
743
	return false;
744
    
745
      edge_no = Tetrahedron::edgeOfDofs[j][k];
746
747
748
749
750
751
752
753
754
755

      TEST_EXIT(*n_neigh < max_no_list_el)
	("too many neigbours for local list\n");

      list_bound[(*n_neigh)] = 
	&(nei->boundary[mesh->getGeo(FACE)+edge_no]);

      list_project[(*n_neigh)++] = 
	&(nei->projection[mesh->getGeo(FACE)+edge_no]);

756
      if (mesh->getNumberOfDofs(EDGE))
757
	nei->element->setDof(node+edge_no,edge_dof);      
758

759
      if (next_el[edge_no][0] != opp_v) {
760
	if (nei->getBoundary(next_el[edge_no][0])) {
761
762
763
764
765
766
	  lbound = newBound(nei->getBoundary(next_el[edge_no][0]), lbound);
	  Projection *neiProject = nei->getProjection(next_el[edge_no][0]);
	  if (!lproject) {
	    lproject = neiProject;
	  } else {
	    if (neiProject && (lproject->getID() < neiProject->getID()))
767
768
769
	      lproject = neiProject;
	  }
	}
770
771
772
773
774
775
776
777
778
779
	opp_v = nei->getOppVertex(next_el[edge_no][0]);
	nei = nei->getNeighbour(next_el[edge_no][0]);
      } else {
	if (nei->getBoundary(next_el[edge_no][1])) {
	  lbound = newBound(nei->getBoundary(next_el[edge_no][1]), lbound);
	  Projection *neiProject = nei->getProjection(next_el[edge_no][1]);	
	  if (!lproject) {
	    lproject = neiProject;
	  } else {
	    if (neiProject && (lproject->getID() < neiProject->getID()))
780
781
782
	      lproject = neiProject;
	  }
	}
783
784
785
	opp_v = nei->getOppVertex(next_el[edge_no][1]);
	nei = nei->getNeighbour(next_el[edge_no][1]);
      }
786
787
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
    if (!nei) {
      /****************************************************************************/
      /*  while looping around the edge the domain's boundary was reached. Now,   */
      /*  loop in the other direction to the domain's boundary		    */
      /****************************************************************************/
      edge_no = mel_edge_no;
      
      nei = mel->getNeighbour(next_el[edge_no][1]);
      opp_v = mel->getOppVertex(next_el[edge_no][1]);
      if (mel->getBoundary(next_el[edge_no][1])) {
	lbound = newBound(mel->getBoundary(next_el[edge_no][1]), lbound); 
	Projection *neiProject =  mel->getProjection(next_el[edge_no][1]);
	if (!lproject) {
	  lproject = neiProject;
	} else {
	  if (neiProject && (lproject->getID() < neiProject->getID()))
	    lproject = neiProject;	  
	}
      }
      
      while (nei) {
	for (j = 0; j < vertices; j++)
810
	  if (nei->getElement()->getDof(j) == dof[0])  break;
Thomas Witkowski's avatar
Thomas Witkowski committed
811
	for (k = 0; k < vertices; k++)
812
	  if (nei->getElement()->getDof(k) == dof[1])  break;
813
	
Thomas Witkowski's avatar
Thomas Witkowski committed
814
815
816
817
	// check for periodic boundary
	if (j == 4 || k == 4)
	  return false;
	
818
	if (mesh->getNumberOfDofs(EDGE)) {
Thomas Witkowski's avatar
Thomas Witkowski committed
819
820
821
	  TEST_EXIT(nei->getIndex() > mel_index)
	    ("neighbour index %d < element index %d\n", nei->getIndex(),
	     mel_index);
822
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
823
824
825
826
	
	if (nei->getIndex() < mel_index)  
	  return false;
	
827
	edge_no = Tetrahedron::edgeOfDofs[j][k];
Thomas Witkowski's avatar
Thomas Witkowski committed
828
829
830
831
832
	
	TEST_EXIT(*n_neigh < max_no_list_el)("too many neigbours for local list\n");
	
	list_bound[(*n_neigh)] = &(nei->boundary[mesh->getGeo(FACE) + edge_no]);
	list_project[(*n_neigh)++] = &(nei->projection[mesh->getGeo(FACE) + edge_no]);
833

834
	if (mesh->getNumberOfDofs(EDGE)) {
835
	  TEST_EXIT(!nei->getElement()->getDof(node+edge_no))
Thomas Witkowski's avatar
Thomas Witkowski committed
836
837
838
	    ("dof %d on element %d is already set, but not on element %d\n",
	     node + edge_no, nei->getIndex(), mel_index);
	  
839
	  nei->element->setDof(node+edge_no, edge_dof);
Thomas Witkowski's avatar
Thomas Witkowski committed
840
	}
841

Thomas Witkowski's avatar
Thomas Witkowski committed
842
843
844
845
846
847
848
849
850
	if (next_el[edge_no][0] != opp_v) {
	  if (nei->getBoundary(next_el[edge_no][0])) {
	    lbound = newBound(nei->getBoundary(next_el[edge_no][0]), lbound);
	    Projection *neiProject = nei->getProjection(next_el[edge_no][0]);
	    if (!lproject) {
	      lproject = neiProject;
	    } else {
	      if (neiProject &&( lproject->getID() < neiProject->getID()))
		lproject = neiProject;	      
851
852
	    }
	  }
Thomas Witkowski's avatar
Thomas Witkowski committed
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
	  
	  opp_v = nei->getOppVertex(next_el[edge_no][0]);
	  nei = nei->getNeighbour(next_el[edge_no][0]);
	} else {
	  if (nei->getBoundary(next_el[edge_no][1])) {
	    lbound = newBound(nei->getBoundary(next_el[edge_no][1]), lbound); 
	    Projection *neiProject = nei->getProjection(next_el[edge_no][1]);
	    if (!lproject) {
	      lproject = neiProject;
	    } else {
	      if (neiProject && (lproject->getID() < neiProject->getID()))
		lproject = neiProject;	      
	    }
	  }
	  
	  opp_v = nei->getOppVertex(next_el[edge_no][1]);
	  nei = nei->getNeighbour(next_el[edge_no][1]);
	}
871
      }
Thomas Witkowski's avatar
Thomas Witkowski committed
872
873
    }
    
874
875
876
877
878
879
880
881
882
883
884
    for (j = 0; j < *n_neigh; j++) {
      *(list_bound[j]) = lbound;
      *(list_project[j]) = lproject;
    }
  
    return true;
  }

  void MacroReader::fillMelBoundary(Mesh *mesh, MacroElement *mel, 
				    FixVec<BoundaryType ,NEIGH> ind)
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
885
886
    for (int i = 0; i < mesh->getGeo(NEIGH); i++)
      mel->boundary[i] = ind[i];        
887
888
889
890
  }


  void MacroReader::fillMelNeigh(MacroElement *mel,
Thomas Witkowski's avatar