MacroReader.cc 45.1 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
      WARNING("Periodic boundaries may lead to errors in small meshes if element neighbours are not set!\n");
53
    
54
55
      FILE *file = fopen(periodicFile.c_str(), "r");
      TEST_EXIT(file)("can't open file %s\n", periodicFile.c_str());
56
57
58
59
60

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

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

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

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

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

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

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

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

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

138
139
140
141
142
143
144
145
	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());

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

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

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

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

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

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

175
	  for (int j = 0; j < dim; j++) {
176
177
178
179
180
181
182
183
	    (*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
184
185
      delete [] verticesEl1;
      delete [] verticesEl2;
186
187

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

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

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

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

206
207
208
	}
      }

209
210
      std::map<BoundaryType, VertexVector*>::iterator assoc;
      std::map<BoundaryType, VertexVector*>::iterator assocEnd =
211
	mesh->periodicAssociations.end();
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
222
      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));
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
326
      mesh->setDiameter(j, x_max[j] - x_min[j]);

    if (check) {
      checkMesh(mesh);

      if (mesh->getDim() > 1) {
327
	char filenew[128];
328
	strncpy(filenew, filename.c_str(), 128); 
329
330
331
	filenew[127] = 0;
	strncat(filenew, ".new", 128);   
	filenew[127] = 0;
332
333
334
335
	macroTest(mesh, filenew);
      }
    }

336
    return macroInfo;
337
338
339
340
341
  }


  void MacroReader::computeNeighbours(Mesh *mesh)
  {
342
    FUNCNAME("MacroReader::computeNeighbours()");
343

344
    int dim = mesh->getDim();
345
    FixVec<DegreeOfFreedom*, DIMEN> dof(dim, NO_INIT);
346

347
348
349
350
    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);
351
      }
352
    }
353

354
355
356
357
358
359
360
    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;
	}
361

362
363
364
	if (mesh->getMacroElement(i)->getOppVertex(k) == AMDIS_UNDEFINED) {
	  if (dim == 1) {
	    dof[0] = const_cast<DegreeOfFreedom*>(mesh->getMacroElement(i)->
365
						  getElement()->getDof(k));
366
367
368
369
	  } else {
	    for (int l = 0; l < dim; l++)
	      dof[l] = const_cast<DegreeOfFreedom*>(mesh->getMacroElement(i)->
						    getElement()->
370
						    getDof((k + l + 1) % (dim + 1)));
371
	  }
372
373
374
375
376
377
378
379
380
381
382
383
384
	  
	  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;
	    }
	  }

385
386
387
388
389
390
391
	  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);
392
393
	      if (l < dim)
		std::cout << " / ";	      
394
395
396
	    }
	    std::cout << std::endl;
	    std::cout << "  dofs = ";
397
398
	    for (int l = 0; l < dim; l++)
	      std::cout << *(dof[l]) << " ";	    
399
400
401
402
	    std::cout << std::endl;

	    ERROR_EXIT("\n");
	  }    
403
	}
404
      }
405
    }
406
407
408
409
410
411
412
413
414
415
416
  }


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

  void MacroReader::boundaryDOFs(Mesh *mesh)
  {
417
418
419
420
421
    FUNCNAME("Mesh::boundaryDOFs()");

    int lnode = mesh->getNode(EDGE);
    int k, lne = mesh->getNumberOfLeaves();
    int max_n_neigh = 0, n_neigh, ov;
422
    std::deque<MacroElement*>::iterator mel;
423
    const MacroElement* neigh;
424
    DegreeOfFreedom *dof;
425
426
427
428
429
430

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

    int dim = mesh->getDim();

Thomas Witkowski's avatar
Thomas Witkowski committed
431
    switch (dim) {
432
    case 2:
433
      for (mel = mesh->firstMacroElement(); mel != mesh->endOfMacroElements(); mel++) {
434
435
436
437
438
439
	// check for periodic boundary
	Element *el = const_cast<Element*>((*mel)->getElement());
	ElementData *ed = el->getElementData(PERIODIC);

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

440
	if (ed) {
441
	  std::list<LeafDataPeriodic::PeriodicInfo> &periodicInfos = 
442
	    dynamic_cast<LeafDataPeriodic*>(ed)->getInfoList();
443
444
	  std::list<LeafDataPeriodic::PeriodicInfo>::iterator it;
	  std::list<LeafDataPeriodic::PeriodicInfo>::iterator end = periodicInfos.end();
Thomas Witkowski's avatar
Thomas Witkowski committed
445
446
	  for (it = periodicInfos.begin(); it != end; ++it)
	    if (it->type != 0)
447
448
449
	      periodic[it->elementSide] = true;
	}

450
	for (int i = 0; i < mesh->getGeo(NEIGH); i++) {
451
	  if (!(*mel)->getNeighbour(i) || 
452
453
454
455
	      ((*mel)->getNeighbour(i)->getIndex() < (*mel)->getIndex())) {

	    mesh->incrementNumberOfEdges(1);

456
	    if (mesh->getNumberOfDofs(EDGE)) {
457
458
	      dof = mesh->getDof(EDGE);
	      el->setDof(lnode + i, dof);
459
460
      
	      if ((*mel)->getNeighbour(i)) {
Thomas Witkowski's avatar
Thomas Witkowski committed
461
462
		Element *neigh = 
		  const_cast<Element*>((*mel)->getNeighbour(i)->getElement());
463

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

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

	DimVec<bool> periodic(dim, DEFAULT_VALUE, false);
      
485
	if (ed) {
486
	  std::list<LeafDataPeriodic::PeriodicInfo> &periodicInfos = 
487
	    dynamic_cast<LeafDataPeriodic*>(ed)->getInfoList();
488
489
	  std::list<LeafDataPeriodic::PeriodicInfo>::iterator it;
	  std::list<LeafDataPeriodic::PeriodicInfo>::iterator end = periodicInfos.end();
490
491
	  for (it = periodicInfos.begin(); it != end; ++it)
	    if (it->type != 0)
492
493
494
	      periodic[it->elementSide] = true;
	}

495
496
	for (k = 0; k < mesh->getGeo(EDGE); k++) {
	  // === Check for not counted edges. ===
497
498
	  n_neigh = 1;

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

	    if (neigh) {
Thomas Witkowski's avatar
Thomas Witkowski committed
522
	      ov = (*(mel + i))->getOppVertex(k);
523
	      TEST_EXIT(!neigh->getElement()->getDof(lnode + ov))
524
		("dof %d on neighbour %d already set\n", 
Thomas Witkowski's avatar
Thomas Witkowski committed
525
		 lnode + ov, neigh->getIndex());
526
527
	    
	      Element *neighEl = 
Thomas Witkowski's avatar
Thomas Witkowski committed
528
		const_cast<Element*>((*(mel + i))->getNeighbour(k)->getElement());
529

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

  /* 
     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)
  */      

  void MacroReader::macroTest(Mesh *mesh, const char *nameneu)
  {
561
    FUNCNAME("MacroReader::macroTest()");
562
   
563
564
565
566
567
568
569
    int i = macrotest(mesh);

    if (i >= 0) {
      ERROR("There is a cycle beginning in macro element %d\n", i);
      ERROR("Entries in MacroElement structures get reordered\n");
      umb(NULL, mesh, umbVkantMacro);

Thomas Witkowski's avatar
Thomas Witkowski committed
570
      if (nameneu)
571
572
	ERROR_EXIT("mesh->feSpace\n");
    }
573
574
575
576
577
578
579
580
581
582
583
584
585
586
  }
  
  /****************************************************************************/
  /*  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)
  {
587
    FUNCNAME("MacroReader::macrotest()");
588

Thomas Witkowski's avatar
Thomas Witkowski committed
589
590
    std::deque<MacroElement*>::const_iterator macro, mac;
    int flg = 0;
591
    int dim = mesh->getDim();
Thomas Witkowski's avatar
Thomas Witkowski committed
592
593
    int *test = new int[mesh->getNumberOfMacros()];
    int *zykl = new int[mesh->getNumberOfMacros()];
594
 
Thomas Witkowski's avatar
Thomas Witkowski committed
595
    for (int i = 0; i < mesh->getNumberOfMacros(); i++)
596
      test[i] = 0;
597

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

601
602
603
604
    while (macrolfd != mesh->endOfMacroElements()) {
      if (test[(*macrolfd)->getIndex()] == 1) {
	macrolfd++;
      } else {
605
606
	for (int i = 0; i < mesh->getNumberOfMacros(); i++)
	  zykl[i] = 0;	
607
    
608
609
610
611
612
613
614
615
	macro = macrolfd;
	flg = 2;
	do {
	  if (zykl[(*macro)->getIndex()] == 1) {
	    flg = 0;
	    zykstart = (*macro)->getIndex();
	  } else {
	    zykl[(*macro)->getIndex()] = 1;
616
      
617
618
619
620
621
	    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
622
	    } else if ((*macro) == (*macro)->getNeighbour(dim)->getNeighbour(dim)) {
623
624
625
626
	      flg = 1;
	      test[(*macro)->getIndex()] = 1;
	      test[(*macro)->getNeighbour(dim)->getIndex()] = 1;
	    } else {
Thomas Witkowski's avatar
Thomas Witkowski committed
627
628
	      for (mac = mesh->firstMacroElement(); 
		   (*mac) != (*macro)->getNeighbour(dim); mac++);
629
630
631
632
	      macro = mac;
	    } 
	  }	  
	} while(flg == 2);
633
 
634
	if (flg == 1)
635
	  macrolfd++;
636
637
	else 
	  macrolfd=mesh->endOfMacroElements();	
638
      }
639
    }
640
  
Thomas Witkowski's avatar
Thomas Witkowski committed
641
642
    delete [] zykl;
    delete [] test;
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
 
    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
667
			void (*umbvk)(Mesh*, MacroElement*, int, int*))
668
669
670
  {
    FUNCNAME("MacroReader::umb");

Thomas Witkowski's avatar
Thomas Witkowski committed
671
    int *test = new int[mesh->getNumberOfMacros()];
672
  
Thomas Witkowski's avatar
Thomas Witkowski committed
673
674
    for (int i = 0; i < static_cast<int>(mesh->getNumberOfMacros()); i++)
      test[i] = 0;
675

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

Thomas Witkowski's avatar
Thomas Witkowski committed
678
    delete [] test;
679
680
681
682
683
  }

  bool MacroReader::newEdge(Mesh *mesh, MacroElement *mel,
			    int mel_edge_no, int *n_neigh)
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
684
685
    FUNCNAME("MacroElement::newEdge()"); 
    MacroElement *nei;
686
687
    const DegreeOfFreedom *dof[2];
    DegreeOfFreedom *edge_dof = NULL;
Thomas Witkowski's avatar
Thomas Witkowski committed
688
689
    int j, k, opp_v, node = 0;
    BoundaryType lbound = INTERIOR;
690
    Projection *lproject = NULL;
Thomas Witkowski's avatar
Thomas Witkowski committed
691
    const int max_no_list_el = 100;
692
693
694
695
    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
696
    static int next_el[6][2] = {{3,2},{1,3},{1,2},{0,3},{0,2},{0,1}};
697
698
    int vertices = mesh->getGeo(VERTEX);

Thomas Witkowski's avatar
Thomas Witkowski committed
699
    int mel_index = mel->getIndex();
700
701
702
703

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

704
    if (mesh->getNumberOfDofs(EDGE)) {
705
      node = mesh->getNode(EDGE);
706
      if (el->getDof(node+edge_no)) {
707
708
709
710
711
712
	/****************************************************************************/
	/*  edge was counted by another macro element and dof was added on the      */
	/*  complete patch                                                          */
	/****************************************************************************/
	return false;
      } else {
713
714
	edge_dof = mesh->getDof(EDGE);
	el->setDof(node+edge_no, edge_dof);
715
716
717
      }
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
718
    for (j = 0; j < 2; j++)
719
      dof[j] = el->getDof(el->getVertexOfEdge(edge_no, j));
Thomas Witkowski's avatar
Thomas Witkowski committed
720
    
721
722
723
724
725
726
727
728
729
730
731
732
    /****************************************************************************/
    /*  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]);


733
    if (mel->getBoundary(next_el[edge_no][0])) {
734
735
736
737
738
739
      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++)
740
	if (nei->getElement()->getDof(j) == dof[0])  break;
741
      for (k = 0; k < vertices; k++)
742
	if (nei->getElement()->getDof(k) == dof[1])  break;
743
744

      // check for periodic boundary
745
      if (j == 4 || k == 4) {
746
747
748
749
	nei = NULL;
	break;
      }

750
      if (mesh->getNumberOfDofs(EDGE)) {
751
752
	TEST_EXIT(nei->index > mel_index)
	  ("neighbour index %d < element index %d\n", nei->getIndex(), mel_index);
753
      }
754

755
      if (!mesh->getNumberOfDofs(EDGE) && nei->getIndex() < mel_index) 
756
	return false;
757
    
758
      edge_no = Tetrahedron::edgeOfDofs[j][k];
759
760
761
762
763
764
765
766
767
768

      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]);

769
      if (mesh->getNumberOfDofs(EDGE))
770
	nei->element->setDof(node+edge_no,edge_dof);      
771

772
      if (next_el[edge_no][0] != opp_v) {
773
	if (nei->getBoundary(next_el[edge_no][0])) {
774
775
776
777
778
779
	  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()))
780
781
782
	      lproject = neiProject;
	  }
	}
783
784
785
786
787
788
789
790
791
792
	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()))
793
794
795
	      lproject = neiProject;
	  }
	}
796
797
798
	opp_v = nei->getOppVertex(next_el[edge_no][1]);
	nei = nei->getNeighbour(next_el[edge_no][1]);
      }
799
800
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
    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++)
823
	  if (nei->getElement()->getDof(j) == dof[0])  break;
Thomas Witkowski's avatar
Thomas Witkowski committed
824
	for (k = 0; k < vertices; k++)
825
	  if (nei->getElement()->getDof(k) == dof[1])  break;
826
	
Thomas Witkowski's avatar
Thomas Witkowski committed
827
828
829
830
	// check for periodic boundary
	if (j == 4 || k == 4)
	  return false;
	
831
	if (mesh->getNumberOfDofs(EDGE)) {
Thomas Witkowski's avatar
Thomas Witkowski committed
832
833
834
	  TEST_EXIT(nei->getIndex() > mel_index)
	    ("neighbour index %d < element index %d\n", nei->getIndex(),
	     mel_index);
835
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
836
837
838
839
	
	if (nei->getIndex() < mel_index)  
	  return false;
	
840
	edge_no = Tetrahedron::edgeOfDofs[j][k];
Thomas Witkowski's avatar
Thomas Witkowski committed
841
842
843
844
845
	
	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]);
846

847
	if (mesh->getNumberOfDofs(EDGE)) {
848
	  TEST_EXIT(!nei->getElement()->getDof(node+edge_no))
Thomas Witkowski's avatar
Thomas Witkowski committed
849
850
851
	    ("dof %d on element %d is already set, but not on element %d\n",
	     node + edge_no, nei->getIndex(), mel_index);
	  
852
	  nei->element->setDof(node+edge_no, edge_dof);
Thomas Witkowski's avatar
Thomas Witkowski committed
853
	}
854

Thomas Witkowski's avatar
Thomas Witkowski committed
855
856
857
858
859
860
861
862
863
	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;	      
864
865
	    }
	  }
Thomas Witkowski's avatar
Thomas Witkowski committed
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
	  
	  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]);
	}
884
      }
Thomas Witkowski's avatar
Thomas Witkowski committed
885
886
    }
    
887
888
889
890
891
892
893
894
895
896
897
    for (j = 0; j < *n_neigh; j++) {
      *(list_bound[j]) = lbound;
      *(list_project[j]) = lproject;
    }
  
    return true;
  }

  void MacroReader::