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


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

namespace AMDiS {

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

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

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

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

    // === read periodic data =================================
52
    if (periodicFile != "") {
53
      WARNING("Periodic boundaries may lead to errors in small meshes if element neighbours are not set!\n");
54
    
55 56
      FILE *file = fopen(periodicFile.c_str(), "r");
      TEST_EXIT(file)("can't open file %s\n", periodicFile.c_str());
57 58 59 60 61

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

207 208 209
	}
      }

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

220 221 222 223
      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));
224 225 226

    } // periodicFile

227

228 229
    // =========================================================

230 231 232
    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]]);
233

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

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

248 249 250 251 252
      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) {
253 254
	    int j = 0;
	    for (; j < mesh->getGeo(NEIGH); j++)
255 256
	      if (neigh->getNeighbour(j) == *(mel + i))  
		break;
257
	
258 259 260 261 262
	    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);
263
	  }
264
	}
265
      }
266
    }
267

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

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

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

    /****************************************************************************/
    /* domain size                                                              */
    /****************************************************************************/

309
    WorldVector<double> x_min, x_max;
310

311 312 313 314 315 316 317
    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++) {
318 319
	x_min[j] = std::min(x_min[j], coords[i][j]);
	x_max[j] = std::max(x_max[j], coords[i][j]);
320 321
      }
    }
322

323
    for (int j = 0; j < Global::getGeo(WORLD); j++)
324 325 326 327 328 329
      mesh->setDiameter(j, x_max[j] - x_min[j]);

    if (check) {
      checkMesh(mesh);

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

339
    return macroInfo;
340 341 342 343 344
  }


  void MacroReader::computeNeighbours(Mesh *mesh)
  {
345
    FUNCNAME("MacroReader::computeNeighbours()");
346

347
    int dim = mesh->getDim();
348
    FixVec<DegreeOfFreedom*, DIMEN> dof(dim, NO_INIT);
349

350 351 352 353
    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);
354
      }
355
    }
356

357 358 359 360 361 362 363
    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;
	}
364

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

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

	    ERROR_EXIT("\n");
	  }    
406
	}
407
      }
408
    }
409 410 411 412 413 414 415 416 417 418 419
  }


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

  void MacroReader::boundaryDOFs(Mesh *mesh)
  {
420 421 422 423 424
    FUNCNAME("Mesh::boundaryDOFs()");

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

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

    int dim = mesh->getDim();

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

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

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

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

	    mesh->incrementNumberOfEdges(1);

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

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

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

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

	for (k = 0; k < mesh->getGeo(EDGE); k++) {      
	  /*********************************************************************/
	  /* check for not counted edges                                       */
	  /*********************************************************************/
	  n_neigh = 1;

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

	    if (neigh) {
Thomas Witkowski's avatar
Thomas Witkowski committed
529
	      ov = (*(mel + i))->getOppVertex(k);
530
	      TEST_EXIT(!neigh->getElement()->getDof(lnode + ov))
531
		("dof %d on neighbour %d already set\n", 
Thomas Witkowski's avatar
Thomas Witkowski committed
532
		 lnode + ov, neigh->getIndex());
533 534
	    
	      Element *neighEl = 
Thomas Witkowski's avatar
Thomas Witkowski committed
535
		const_cast<Element*>((*(mel + i))->getNeighbour(k)->getElement());
536

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

  /* 
     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)
  {
568
    FUNCNAME("MacroReader::macroTest()");
569
   
570 571 572 573 574 575 576
    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
577
      if (nameneu)
578 579
	ERROR_EXIT("mesh->feSpace\n");
    }
580 581 582 583 584 585 586 587 588 589 590 591 592 593
  }
  
  /****************************************************************************/
  /*  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)
  {
594
    FUNCNAME("MacroReader::macrotest()");
595

Thomas Witkowski's avatar
Thomas Witkowski committed
596 597
    std::deque<MacroElement*>::const_iterator macro, mac;
    int flg = 0;
598
    int dim = mesh->getDim();
Thomas Witkowski's avatar
Thomas Witkowski committed
599 600
    int *test = new int[mesh->getNumberOfMacros()];
    int *zykl = new int[mesh->getNumberOfMacros()];
601
 
Thomas Witkowski's avatar
Thomas Witkowski committed
602
    for (int i = 0; i < mesh->getNumberOfMacros(); i++)
603
      test[i] = 0;
604

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
678
    int *test = new int[mesh->getNumberOfMacros()];
679
  
Thomas Witkowski's avatar
Thomas Witkowski committed
680 681
    for (int i = 0; i < static_cast<int>(mesh->getNumberOfMacros()); i++)
      test[i] = 0;
682

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

Thomas Witkowski's avatar
Thomas Witkowski committed
685
    delete [] test;
686 687 688 689 690
  }

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

Thomas Witkowski's avatar
Thomas Witkowski committed
706
    int mel_index = mel->getIndex();
707 708 709 710

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

711
    if (mesh->getNumberOfDofs(EDGE)) {
712
      node = mesh->getNode(EDGE);
713
      if (el->getDof(node+edge_no)) {
714 715 716 717 718 719
	/****************************************************************************/
	/*  edge was counted by another macro element and dof was added on the      */
	/*  complete patch                                                          */
	/****************************************************************************/
	return false;
      } else {
720 721
	edge_dof = mesh->getDof(EDGE);
	el->setDof(node+edge_no, edge_dof);
722 723 724
      }
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
725
    for (j = 0; j < 2; j++)
726
      dof[j] = el->getDof(el->getVertexOfEdge(edge_no, j));
Thomas Witkowski's avatar
Thomas Witkowski committed
727
    
728 729 730 731 732 733 734 735 736 737 738 739
    /****************************************************************************/
    /*  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]);


740
    if (mel->getBoundary(next_el[edge_no][0])) {
741 742 743 744 745 746
      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++)
747
	if (nei->getElement()->getDof(j) == dof[0])  break;
748
      for (k = 0; k < vertices; k++)
749
	if (nei->getElement()->getDof(k) == dof[1])  break;
750 751

      // check for periodic boundary
752
      if (j == 4 || k == 4) {
753 754 755 756
	nei = NULL;
	break;
      }

757
      if (mesh->getNumberOfDofs(EDGE)) {
758 759
	TEST_EXIT(nei->index > mel_index)
	  ("neighbour index %d < element index %d\n", nei->getIndex(), mel_index);
760
      }
761

762
      if (!mesh->getNumberOfDofs(EDGE) && nei->getIndex() < mel_index) 
763
	return false;
764
    
765
      edge_no = Tetrahedron::edgeOfDofs[j][k];
766 767 768 769 770 771 772 773 774 775

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

776
      if (mesh->getNumberOfDofs(EDGE))
777
	nei->element->setDof(node+edge_no,edge_dof);      
778

779
      if (next_el[edge_no][0] != opp_v) {
780
	if (nei->getBoundary(next_el[edge_no][0])) {
781 782 783 784 785 786
	  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()))
787 788 789
	      lproject = neiProject;
	  }
	}
790 791 792 793 794 795 796 797 798 799
	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()))
800 801 802
	      lproject = neiProject;
	  }
	}
803 804 805
	opp_v = nei->getOppVertex(next_el[edge_no][1]);
	nei = nei->getNeighbour(next_el[edge_no][1]);
      }
806 807
    }

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

854
	if (mesh->getNumberOfDofs(EDGE)) {
855
	  TEST_EXIT(!nei->getElement()->getDof(node+edge_no))
Thomas Witkowski's avatar
Thomas Witkowski committed
856 857 858
	    ("dof %d on element %d is already set, but not on element %d\n",
	     node + edge_no, nei->getIndex(), mel_index);
	  
859
	  nei->element->setDof(node+edge_no, edge_dof);
Thomas Witkowski's avatar
Thomas Witkowski committed
860
	}
861

Thomas Witkowski's avatar
Thomas Witkowski committed
862 863 864 865 866 867 868 869 870
	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;	      
871 872
	    }
	  }
Thomas Witkowski's avatar
Thomas Witkowski committed
873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890
	  
	  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]);
	}
891
      }
Thomas Witkowski's avatar
Thomas Witkowski committed
892 893
    }
    
894 895 896 897 898 899 900 901 902 903 904
    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
905 906
    for (int i = 0; i < mesh->getGeo(NEIGH); i++)
      mel->boundary[i] = ind[i];        
907 908 909 910
  }


  void MacroReader::fillMelNeigh(MacroElement *mel,