Liebe Gitlab-Nutzer, lieber Gitlab-Nutzer, es ist nun möglich sich mittels des ZIH-Logins/LDAP an unserem Dienst anzumelden. Ein Anmelden über dieses erzeugt ein neues Konto. Das alte Konto ist über den Reiter "Standard" erreichbar. Die Administratoren

Dear Gitlab user, it is now possible to log in to our service using the ZIH login/LDAP. Logging in via this will create a new account. The old account can be accessed via the "Standard" tab. The administrators

MacroReader.cc 45.1 KB
Newer Older
1 2 3
#include "MacroReader.h"
#include "MacroWriter.h"
#include "MacroElement.h"
4
#include "MacroInfo.h"
5 6 7
#include "Boundary.h"
#include "FiniteElemSpace.h"
#include "Mesh.h"
8
#include <string.h>
9 10 11 12 13 14 15 16 17 18 19 20 21
#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 {

22
  MacroInfo* MacroReader::readMacro(std::string filename, 
23
				    Mesh* mesh,
24
				    std::string periodicFile,
25 26
				    int check)
  {
27
    FUNCNAME("MacroReader::readMacro()");
28

29 30
    TEST_EXIT(filename != "")("no file specified; filename NULL pointer\n");  

Thomas Witkowski's avatar
Thomas Witkowski committed
31
    MacroInfo *macroInfo = new MacroInfo();
32 33
    macroInfo->readAMDiSMacro(filename, mesh);

34
    std::deque<MacroElement*>::iterator mel = macroInfo->mel.begin();
35 36 37
    int **melVertex = macroInfo->mel_vertex;
    WorldVector<double> *coords = macroInfo->coords;
    DegreeOfFreedom **dof = macroInfo->dof;
38 39

    // === read periodic data =================================
40
    if (periodicFile != "") {
41
      WARNING("Periodic boundaries may lead to errors in small meshes if element neighbours are not set!\n");
42
    
43 44
      FILE *file = fopen(periodicFile.c_str(), "r");
      TEST_EXIT(file)("can't open file %s\n", periodicFile.c_str());
45 46 47 48 49

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

      int el1, el2;
Thomas Witkowski's avatar
Thomas Witkowski committed
50 51
      int *verticesEl1 = new int[dim];
      int *verticesEl2 = new int[dim];
52
      int mode = -1; // 0: drop dofs, 1: associate dofs
53
      int result;
54
      BoundaryType boundaryType;
55
      PeriodicMap periodicMap;
56 57 58

      fscanf(file, "%*s %d", &n);
      fscanf(file, "%*s %*s %*s %*s %*s %*s %*s %*s %*s %*s %*s");
59
   
60
      for (int i = 0; i < n; i++) {
61 62
	std::map<int, int> vertexMapEl1;
	std::map<int, int> vertexMapEl2;
63

64 65
	result = fscanf(file, "%d", &mode);
	TEST_EXIT(result == 1)("mode?\n");
66
      
67 68
	result = fscanf(file, "%d", &boundaryType);
	TEST_EXIT(result == 1)("boundaryType?\n");
69
      
70 71 72
	result = fscanf(file, "%d", &el1);
	TEST_EXIT(result == 1)("el1?\n");

73
	for (int j = 0; j < dim; j++) {
74 75
	  result = fscanf(file, "%d", &verticesEl1[j]);
	  TEST_EXIT(result == 1)("vertEl1[%d]\n", j);
76
	}
77 78
	result = fscanf(file, "%d", &el2);
	TEST_EXIT(result == 1)("el2?\n");
79
	for (int j = 0; j < dim; j++) {
80 81
	  result = fscanf(file, "%d", &verticesEl2[j]);
	  TEST_EXIT(result == 1)("vertEl2[%d]\n", j);
82
	}
83
	for (int j = 0; j < dim; j++) {
Thomas Witkowski's avatar
Thomas Witkowski committed
84
	  if (mode == 0)
85
	    periodicMap.setEntry(melVertex[el1][verticesEl1[j]], 
Thomas Witkowski's avatar
Thomas Witkowski committed
86
				 melVertex[el2][verticesEl2[j]]);	  
87 88 89 90 91 92
	  vertexMapEl1[verticesEl1[j]] = verticesEl2[j];
	  vertexMapEl2[verticesEl2[j]] = verticesEl1[j];
	}

	// calculate sides of periodic vertices
	int sideEl1 = 0, sideEl2 = 0;
93
	if (dim == 1) {
94 95 96
	  sideEl1 = verticesEl1[0];
	  sideEl2 = verticesEl2[0];
	} else {
97
	  for (int j = 0; j < dim + 1; j++) {
98 99 100
	    sideEl1 += j;
	    sideEl2 += j;
	  }
101
	  for (int j = 0; j < dim; j++) {
102 103 104 105
	    sideEl1 -= verticesEl1[j];
	    sideEl2 -= verticesEl2[j];
	  }
	}
106

107
	// create periodic info
108 109
	DimVec<WorldVector<double> > periodicCoordsEl1(dim - 1, NO_INIT);
	DimVec<WorldVector<double> > periodicCoordsEl2(dim - 1, NO_INIT);
110

111 112
	Element *element1 = const_cast<Element*>((*(mel + el1))->getElement());
	Element *element2 = const_cast<Element*>((*(mel + el2))->getElement());
113
     
114
	// for all vertices of this side
115
	for (int j = 0; j < dim; j++) {
116 117
	  periodicCoordsEl1[element1->getPositionOfVertex(sideEl1, verticesEl1[j])] = 
	    coords[melVertex[el2][vertexMapEl1[verticesEl1[j]]]];
118

119 120 121
	  periodicCoordsEl2[element2->getPositionOfVertex(sideEl2, verticesEl2[j])] =
	    coords[melVertex[el1][vertexMapEl2[verticesEl2[j]]]];
	}
122
	     
123 124 125 126
	// decorate leaf data
	ElementData *ld1 = element1->getElementData();
	ElementData *ld2 = element2->getElementData();

127 128 129 130 131 132 133 134
	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());

135 136 137 138
	LeafDataPeriodic *ldp1 = 
	  dynamic_cast<LeafDataPeriodic*>(ld1->getElementData(PERIODIC));
	LeafDataPeriodic *ldp2 = 
	  dynamic_cast<LeafDataPeriodic*>(ld2->getElementData(PERIODIC));
139 140

	if (!ldp1) {
Thomas Witkowski's avatar
Thomas Witkowski committed
141
	  ldp1 = new LeafDataPeriodic(ld1);
142 143 144 145
	  element1->setElementData(ldp1);
	}

	if (!ldp2) {
Thomas Witkowski's avatar
Thomas Witkowski committed
146
	  ldp2 = new LeafDataPeriodic(ld2);
147 148 149
	  element2->setElementData(ldp2);
	}

150 151
	ldp1->addPeriodicInfo(mode, boundaryType, sideEl1, &periodicCoordsEl1);
	ldp2->addPeriodicInfo(mode, boundaryType, sideEl2, &periodicCoordsEl2);
152 153 154

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

156
	  if (!associated) {
Thomas Witkowski's avatar
Thomas Witkowski committed
157
	    associated = new VertexVector(mesh->getVertexAdmin(), "vertex vector");
158 159
	    mesh->periodicAssociations[boundaryType] = associated;
	    VertexVector::Iterator it(associated, ALL_DOFS);
160
	    for (it.reset2(); !it.end(); ++it)
161 162 163
	      *it = it.getDOFIndex();
	  }

164
	  for (int j = 0; j < dim; j++) {
165 166 167 168 169 170 171 172
	    (*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
173 174
      delete [] verticesEl1;
      delete [] verticesEl2;
175 176

      // change periodic vertex dofs
177
      for (int i = 0; i < mesh->getNumberOfVertices(); i++) {
178
	if (periodicMap.getEntry(i) != -1) {
179
	  mesh->freeDof(dof[i], VERTEX);
180 181
	  dof[i] = dof[periodicMap.getEntry(i)];

182 183
	  std::map<BoundaryType, VertexVector*>::iterator assoc;
	  std::map<BoundaryType, VertexVector*>::iterator assocEnd =
184
	    mesh->periodicAssociations.end();
185

186
	  for (assoc = mesh->periodicAssociations.begin(); assoc != assocEnd; ++assoc) {
187 188 189 190 191

	    DegreeOfFreedom a = (*(assoc->second))[i];
	    if (a != i) {
	      (*(assoc->second))[i] = i;
	      (*(assoc->second))[a] = periodicMap.getEntry(i);
192
	    }
193 194
	  }

195 196 197
	}
      }

198 199
      std::map<BoundaryType, VertexVector*>::iterator assoc;
      std::map<BoundaryType, VertexVector*>::iterator assocEnd =
200
	mesh->periodicAssociations.end();
201
      for (assoc = mesh->periodicAssociations.begin(); assoc != assocEnd; ++assoc) {
Thomas Witkowski's avatar
Thomas Witkowski committed
202
	for (int i = 0; i < mesh->getNumberOfVertices(); i++)
203 204
	  if (i != (*(assoc->second))[i])
	    MSG("association %d: vertex %d -> vertex %d\n", 
Thomas Witkowski's avatar
Thomas Witkowski committed
205
		assoc->first, i, (*(assoc->second))[i]);	
206 207
      }

208 209 210 211
      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));
212 213 214

    } // periodicFile

215

216 217
    // =========================================================

218 219 220
    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]]);
221

222
	const_cast<Element*>((*(mel + i))->getElement())->
223
	  setDof(k, dof[melVertex[i][k]]);
224
      }
225
    }
226

227
    if (!macroInfo->neigh_set) {
228
      TEST_EXIT(periodicFile == "")
229
	("periodic boundary condition => element neighbours must be set\n");
230
      computeNeighbours(mesh);
231
    } else {
232 233 234
      /****************************************************************************/
      /* fill MEL oppVertex values when reading neighbour information form file  */
      /****************************************************************************/
235

236 237 238 239 240
      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) {
241 242
	    int j = 0;
	    for (; j < mesh->getGeo(NEIGH); j++)
243 244
	      if (neigh->getNeighbour(j) == *(mel + i))  
		break;
245
	
246 247 248 249 250
	    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);
251
	  }
252
	}
253
      }
254
    }
255

256 257
    if (!macroInfo->bound_set)
      macroInfo->dirichletBoundary();    
258
  
259
    if (mesh->getDim() > 1)
260 261 262 263 264 265
      boundaryDOFs(mesh);

    // initial boundary projections
    int numFaces = mesh->getGeo(FACE);
    int dim = mesh->getDim();
    mel = mesh->firstMacroElement();
266
    for (int i = 0; i < mesh->getNumberOfLeaves(); i++) {
267
      MacroElement *macroEl = *(mel + i);
268
      Projection *projector = macroEl->getProjection(0);
269
      if (projector && projector->getType() == VOLUME_PROJECTION) {
Thomas Witkowski's avatar
Thomas Witkowski committed
270 271
	for (int j = 0; j <= dim; j++)
	  projector->project(macroEl->getCoord(j));	
272
      } else {
273
	for (int j = 0; j < mesh->getGeo(EDGE); j++) {
274
	  projector = macroEl->getProjection(numFaces + j);
275
	  if (projector) {
276 277 278 279 280 281 282 283 284 285 286
	    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);

287
    if (mesh->getNumberOfDofs(CENTER)) {
288
      for (int i = 0; i < mesh->getNumberOfMacros(); i++)
289
	const_cast<Element*>(mel[i]->getElement())->
290
	  setDof(mesh->getNode(CENTER), mesh->getDof(CENTER));
291 292 293 294 295 296
    }

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

297
    WorldVector<double> x_min, x_max;
298

299 300 301 302 303 304 305
    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++) {
306 307
	x_min[j] = std::min(x_min[j], coords[i][j]);
	x_max[j] = std::max(x_max[j], coords[i][j]);
308 309
      }
    }
310

311
    for (int j = 0; j < Global::getGeo(WORLD); j++)
312 313 314 315 316 317
      mesh->setDiameter(j, x_max[j] - x_min[j]);

    if (check) {
      checkMesh(mesh);

      if (mesh->getDim() > 1) {
318
	char filenew[128];
319
	strncpy(filenew, filename.c_str(), 128); 
320 321 322
	filenew[127] = 0;
	strncat(filenew, ".new", 128);   
	filenew[127] = 0;
323 324 325 326
	macroTest(mesh, filenew);
      }
    }

327
    return macroInfo;
328 329 330 331 332
  }


  void MacroReader::computeNeighbours(Mesh *mesh)
  {
333
    FUNCNAME("MacroReader::computeNeighbours()");
334

335
    int dim = mesh->getDim();
336
    FixVec<DegreeOfFreedom*, DIMEN> dof(dim, NO_INIT);
337

338 339 340 341
    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);
342
      }
343
    }
344

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

353 354 355
	if (mesh->getMacroElement(i)->getOppVertex(k) == AMDIS_UNDEFINED) {
	  if (dim == 1) {
	    dof[0] = const_cast<DegreeOfFreedom*>(mesh->getMacroElement(i)->
356
						  getElement()->getDof(k));
357 358 359 360
	  } else {
	    for (int l = 0; l < dim; l++)
	      dof[l] = const_cast<DegreeOfFreedom*>(mesh->getMacroElement(i)->
						    getElement()->
361
						    getDof((k + l + 1) % (dim + 1)));
362
	  }
363 364 365 366 367 368 369 370 371 372 373 374 375
	  
	  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;
	    }
	  }

376 377 378 379 380 381 382
	  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);
383 384
	      if (l < dim)
		std::cout << " / ";	      
385 386 387
	    }
	    std::cout << std::endl;
	    std::cout << "  dofs = ";
388 389
	    for (int l = 0; l < dim; l++)
	      std::cout << *(dof[l]) << " ";	    
390 391 392 393
	    std::cout << std::endl;

	    ERROR_EXIT("\n");
	  }    
394
	}
395
      }
396
    }
397 398 399 400 401 402 403 404 405 406 407
  }


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

  void MacroReader::boundaryDOFs(Mesh *mesh)
  {
408 409 410 411 412
    FUNCNAME("Mesh::boundaryDOFs()");

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

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

    int dim = mesh->getDim();

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

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

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

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

	    mesh->incrementNumberOfEdges(1);

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

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

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

	DimVec<bool> periodic(dim, DEFAULT_VALUE, false);
      
476
	if (ed) {
477
	  std::list<LeafDataPeriodic::PeriodicInfo> &periodicInfos = 
478
	    dynamic_cast<LeafDataPeriodic*>(ed)->getInfoList();
479 480
	  std::list<LeafDataPeriodic::PeriodicInfo>::iterator it;
	  std::list<LeafDataPeriodic::PeriodicInfo>::iterator end = periodicInfos.end();
481 482
	  for (it = periodicInfos.begin(); it != end; ++it)
	    if (it->type != 0)
483 484 485 486 487 488 489 490 491
	      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
492
	  if (newEdge(mesh, (*(mel + i)), k, &n_neigh)) {
493 494 495 496 497 498
	    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
499
	  neigh = (*(mel + i))->getNeighbour(k);
500 501 502
	  /*********************************************************************/
	  /* face is counted and dof is added by the element with bigger index */
	  /*********************************************************************/
Thomas Witkowski's avatar
Thomas Witkowski committed
503 504
	  if (neigh && (neigh->getIndex() > (*(mel + i))->getIndex()))  
	    continue;
505 506 507
	
	  mesh->incrementNumberOfFaces(1);
	
508
	  if (mesh->getNumberOfDofs(FACE)) {
509
	    TEST_EXIT(!(*(mel + i))->getElement()->getDof(lnode + k))
510
	      ("dof %d on element %d already set\n", 
Thomas Witkowski's avatar
Thomas Witkowski committed
511
	       lnode + k, (*(mel + i))->getIndex());
512
	  
513
	    const_cast<Element*>((*(mel + i))->getElement())->setDof(lnode + k,
514
								     mesh->getDof(FACE));
515 516

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

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

  /* 
     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)
  {
556
    FUNCNAME("MacroReader::macroTest()");
557
   
558 559 560 561 562 563 564
    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
565
      if (nameneu)
566 567
	ERROR_EXIT("mesh->feSpace\n");
    }
568 569 570 571 572 573 574 575 576 577 578 579 580 581
  }
  
  /****************************************************************************/
  /*  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)
  {
582
    FUNCNAME("MacroReader::macrotest()");
583

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

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
666
    int *test = new int[mesh->getNumberOfMacros()];
667
  
Thomas Witkowski's avatar
Thomas Witkowski committed
668 669
    for (int i = 0; i < static_cast<int>(mesh->getNumberOfMacros()); i++)
      test[i] = 0;
670

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

Thomas Witkowski's avatar
Thomas Witkowski committed
673
    delete [] test;
674 675 676 677 678
  }

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

Thomas Witkowski's avatar
Thomas Witkowski committed
694
    int mel_index = mel->getIndex();
695 696 697 698

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

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

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


728
    if (mel->getBoundary(next_el[edge_no][0])) {
729 730 731 732 733 734
      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++)
735
	if (nei->getElement()->getDof(j) == dof[0])  break;
736
      for (k = 0; k < vertices; k++)
737
	if (nei->getElement()->getDof(k) == dof[1])  break;
738 739

      // check for periodic boundary
740
      if (j == 4 || k == 4) {
741 742 743 744
	nei = NULL;
	break;
      }

745
      if (mesh->getNumberOfDofs(EDGE)) {
746 747
	TEST_EXIT(nei->index > mel_index)
	  ("neighbour index %d < element index %d\n", nei->getIndex(), mel_index);
748
      }
749

750
      if (!mesh->getNumberOfDofs(EDGE) && nei->getIndex() < mel_index) 
751
	return false;
752
    
753
      edge_no = Tetrahedron::edgeOfDofs[j][k];
754 755 756 757 758 759 760 761 762 763

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

764
      if (mesh->getNumberOfDofs(EDGE))
765
	nei->element->setDof(node+edge_no,edge_dof);      
766

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

Thomas Witkowski's avatar
Thomas Witkowski committed
796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817
    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++)
818
	  if (nei->getElement()->getDof(j) == dof[0])  break;
Thomas Witkowski's avatar
Thomas Witkowski committed
819
	for (k = 0; k < vertices; k++)
820
	  if (nei->getElement()->getDof(k) == dof[1])  break;
821
	
Thomas Witkowski's avatar
Thomas Witkowski committed
822 823 824 825
	// check for periodic boundary
	if (j == 4 || k == 4)
	  return false;
	
826
	if (mesh->getNumberOfDofs(EDGE)) {