Am Montag, 13. Mai 2022, finden Wartungsarbeiten am Gitlab-Server (Update auf neue Version statt). Der Dienst wird daher am Montag für einige Zeit nicht verfügbar sein.
On Monday, May 13th 2022, the Gitlab server will be updated. The service will therefore not be accessible for some time on Monday.

Traverse.cc 33.5 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
#include "Traverse.h"
#include "Element.h"
#include "Line.h"
#include "Triangle.h"
#include "Tetrahedron.h"
#include "ElInfo.h"
#include "Mesh.h"
#include "Flag.h"
#include "MacroElement.h"
#include "FixVec.h"
#include "Parametric.h"
12
#include "OpenMP.h"
13
14
15
16
17
18

namespace AMDiS {

  ElInfo* TraverseStack::traverseFirst(Mesh *mesh, int level,
				       Flag fill_flag)
  {
19
    FUNCNAME("TraverseStack::traverseFirst()");
20

21
22
23
    traverse_mesh = mesh;
    traverse_level = level;
    traverse_fill_flag = fill_flag; 
24
25
26
27
28
29

    if (stack_size < 1)
      enlargeTraverseStack();

    Flag FILL_ANY = Mesh::getFillAnyFlag(mesh->getDim());

30
    for (int i = 0; i < stack_size; i++)
31
32
      elinfo_stack[i]->setFillFlag(fill_flag & FILL_ANY);

33

34
35
36
37
    elinfo_stack[0]->setMesh(mesh);
    elinfo_stack[1]->setMesh(mesh);

    if (fill_flag.isSet(Mesh::CALL_LEAF_EL_LEVEL)) {
38
      TEST_EXIT_DBG(level >= 0)("invalid level: %d\n", level);
39
40
41
    }

    traverse_mel = NULL;
42
    stack_used = 0;
43

44
45
46
47
48
    return(traverseNext(NULL));  
  }

  ElInfo* TraverseStack::traverseNext(ElInfo* elinfo_old)
  {
49
    FUNCNAME("TraverseStack::traverseNext()");
50

51
    ElInfo *elinfo = NULL;
52
    ElInfo::traverseId[omp_get_thread_num()] = id;
53
54
55
56
57
58
    Parametric *parametric = traverse_mesh->getParametric();

    if (stack_used) {
      if (parametric) 
	elinfo_old = parametric->removeParametricInfo(elinfo_old);

59
      TEST_EXIT_DBG(elinfo_old == elinfo_stack[stack_used])("invalid old elinfo\n");
60
61
    }
    else {
62
      TEST_EXIT_DBG(elinfo_old == NULL)("invalid old elinfo != nil\n");
63
64
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
65
    if (traverse_fill_flag.isSet(Mesh::CALL_LEAF_EL)) {
66
      elinfo = traverseLeafElement();
Thomas Witkowski's avatar
Thomas Witkowski committed
67
    } else {
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
      if (traverse_fill_flag.isSet(Mesh::CALL_LEAF_EL_LEVEL))
	elinfo = traverseLeafElementLevel();
      else if (traverse_fill_flag.isSet(Mesh::CALL_EL_LEVEL))
	elinfo = traverseElementLevel();
      else if (traverse_fill_flag.isSet(Mesh::CALL_MG_LEVEL))
	elinfo = traverseMultiGridLevel();
      else
	if (traverse_fill_flag.isSet(Mesh::CALL_EVERY_EL_PREORDER))
	  elinfo = traverseEveryElementPreorder();
	else if (traverse_fill_flag.isSet(Mesh::CALL_EVERY_EL_INORDER))
	  elinfo = traverseEveryElementInorder();
	else if (traverse_fill_flag.isSet(Mesh::CALL_EVERY_EL_POSTORDER))
	  elinfo = traverseEveryElementPostorder();
	else
	  ERROR_EXIT("invalid traverse_flag\n");
Thomas Witkowski's avatar
Thomas Witkowski committed
83
    }
84

85
86
    if (elinfo) {
      if (parametric) {
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
	elinfo = parametric->addParametricInfo(elinfo);
      }
      elinfo->fillDetGrdLambda();
    }

    return(elinfo);
  }



  /****************************************************************************/
  /* common (static) traversal routines for 2d and 3d                         */
  /* to be #included in traverse_r.c                                          */
  /****************************************************************************/

  /* traverse hierarchical mesh,  call el_fct() for each/some element */

  /****************************************************************************/
  /*   recursive_traverse:                                		    */
  /*   -------------------                                		    */
  /*   recursively traverse the mesh hierarchy tree       		    */
  /*   call the routine traverse_info->el_fct(el_info) with    		    */
  /*    - all tree leaves                                 		    */
  /*    - all tree leaves at a special level              		    */
  /*    - all tree elements in pre-/in-/post-order        		    */
  /*   depending on the traverse_info->level variable     		    */
  /****************************************************************************/

Thomas Witkowski's avatar
Thomas Witkowski committed
115
  int Traverse::recursive(ElInfoStack *elInfoStack)
116
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
117
    FUNCNAME("Traverse::recursive()");
118

Thomas Witkowski's avatar
Thomas Witkowski committed
119
120
    ElInfo *elinfo = elInfoStack->getCurrentElement();

Thomas Witkowski's avatar
Thomas Witkowski committed
121
    Element *el = elinfo->getElement();
Thomas Witkowski's avatar
Thomas Witkowski committed
122
    int mg_level, sum = 0;
123
    Parametric *parametric = mesh->getParametric();
124
    ElInfo::traverseId[omp_get_thread_num()] = id;
125
126
127

    if (flag.isSet(Mesh::CALL_LEAF_EL)) {
      if (el->getFirstChild()) {
Thomas Witkowski's avatar
Thomas Witkowski committed
128
	ElInfo* elinfo_new = elInfoStack->getNextElement();
129
	elinfo_new->fillElInfo(0, elinfo);
Thomas Witkowski's avatar
Thomas Witkowski committed
130
	sum += recursive(elInfoStack);
131
	elinfo_new->fillElInfo(1, elinfo);
Thomas Witkowski's avatar
Thomas Witkowski committed
132
133
	sum += recursive(elInfoStack);
	elInfoStack->getBackElement();
134
135
136
137
      } else {
	if (el_fct != NULL) {
	  if (parametric) 
	    elinfo = parametric->addParametricInfo(elinfo);
138
	  elinfo->fillDetGrdLambda();
Thomas Witkowski's avatar
Thomas Witkowski committed
139
	  sum += el_fct(elinfo);
140
141
	  if (parametric) 
	    elinfo = parametric->removeParametricInfo(elinfo);
142
143
	}
      }
Thomas Witkowski's avatar
Thomas Witkowski committed
144
      return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;
145
146
147
148
149
    }

    if (flag.isSet(Mesh::CALL_LEAF_EL_LEVEL)) {
      if (el->getFirstChild()) {
	if ((elinfo->getLevel() >= level)) {
Thomas Witkowski's avatar
Thomas Witkowski committed
150
	  return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;
151
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
152
	ElInfo* elinfo_new = elInfoStack->getNextElement();
153
	elinfo_new->fillElInfo(0, elinfo);
Thomas Witkowski's avatar
Thomas Witkowski committed
154
	sum += recursive(elInfoStack);
155
	elinfo->fillElInfo(1, elinfo);
Thomas Witkowski's avatar
Thomas Witkowski committed
156
157
158
	sum += recursive(elInfoStack);
	elInfoStack->getBackElement();
      } else {
159
160
161
	if ((elinfo->getLevel() == level) && (el_fct!=NULL)) {
	  if (parametric) 
	    elinfo = parametric->addParametricInfo(elinfo);
162
	  elinfo->fillDetGrdLambda();
Thomas Witkowski's avatar
Thomas Witkowski committed
163
	  sum += el_fct(elinfo);
164
165
	  if (parametric) 
	    elinfo = parametric->removeParametricInfo(elinfo);
166
167
	}
      }
Thomas Witkowski's avatar
Thomas Witkowski committed
168
      return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;
169
170
171
172
    }

    if (flag.isSet(Mesh::CALL_EL_LEVEL)) {
      if (elinfo->getLevel() == level) {
Thomas Witkowski's avatar
Thomas Witkowski committed
173
174
175
	if (NULL != el_fct) {
	  if (parametric) 
	    elinfo = parametric->addParametricInfo(elinfo);
176
	  elinfo->fillDetGrdLambda();
Thomas Witkowski's avatar
Thomas Witkowski committed
177
178
179
	  sum += el_fct(elinfo); 
	  if (parametric) 
	    elinfo = parametric->removeParametricInfo(elinfo);
180
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
181
      } else {
182
	if (elinfo->getLevel() > level){
Thomas Witkowski's avatar
Thomas Witkowski committed
183
184
185
186
187
188
189
190
	  return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;
	} else if (el->getFirstChild()) {
	  ElInfo* elinfo_new = elInfoStack->getNextElement();
	  elinfo_new->fillElInfo(0, elinfo);
	  sum += recursive(elInfoStack);
	  elinfo_new->fillElInfo(1, elinfo);
	  sum += recursive(elInfoStack);
	  elInfoStack->getBackElement();
191
192
193
	}
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
194
      return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;
195
196
197
198
    }

    if (flag.isSet(Mesh::CALL_MG_LEVEL)) {

199
      mg_level = (elinfo->getLevel() + mesh->getDim() - 1) / mesh->getDim();
200

201
      if (mg_level > level)  {
202
203
204
205
	return 0;
      }

      if (!(el->getFirstChild())) {
Thomas Witkowski's avatar
Thomas Witkowski committed
206
207
208
	if (el_fct != NULL) {
	  if (parametric) 
	    elinfo = parametric->addParametricInfo(elinfo);
209
	  elinfo->fillDetGrdLambda();
Thomas Witkowski's avatar
Thomas Witkowski committed
210
211
212
	  sum += el_fct(elinfo);
	  if (parametric) 
	    elinfo = parametric->removeParametricInfo(elinfo);
213
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
214
	return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;
215
216
      }
    
Thomas Witkowski's avatar
Thomas Witkowski committed
217
218
219
220
221
222
223
224
      if ((mg_level == level) && ((elinfo->getLevel() % mesh->getDim()) == 0)) {
	if (el_fct != NULL) {
	  if (parametric) 
	    elinfo = parametric->addParametricInfo(elinfo);
	  elinfo->fillDetGrdLambda();
	  sum += el_fct(elinfo); 
	  if (parametric) 
	    elinfo = parametric->removeParametricInfo(elinfo);
225
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
226
227
	return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;
      }
228

Thomas Witkowski's avatar
Thomas Witkowski committed
229
      ElInfo* elinfo_new = elInfoStack->getNextElement();
230
231
 
      elinfo_new->fillElInfo(0, elinfo);
Thomas Witkowski's avatar
Thomas Witkowski committed
232
      sum += recursive(elInfoStack);
233
234

      elinfo_new->fillElInfo(1, elinfo);
Thomas Witkowski's avatar
Thomas Witkowski committed
235
      sum += recursive(elInfoStack);
236

Thomas Witkowski's avatar
Thomas Witkowski committed
237
238
239
      elInfoStack->getBackElement();

      return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;   
240
241
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
242
    if (flag.isSet(Mesh::CALL_EVERY_EL_PREORDER)) {
243
      if (el_fct != NULL) {
Thomas Witkowski's avatar
Thomas Witkowski committed
244
245
	if (parametric) 
	  elinfo = parametric->addParametricInfo(elinfo);
246
	elinfo->fillDetGrdLambda();
Thomas Witkowski's avatar
Thomas Witkowski committed
247
248
249
	sum += el_fct(elinfo);
	if (parametric) 
	  elinfo = parametric->removeParametricInfo(elinfo);
250
      }
Thomas Witkowski's avatar
Thomas Witkowski committed
251
    }
252

Thomas Witkowski's avatar
Thomas Witkowski committed
253
254
255
    if (el->getFirstChild()) {
      ElInfo* elinfo_new = elInfoStack->getNextElement();
   
256
      elinfo_new->fillElInfo(0, elinfo);
Thomas Witkowski's avatar
Thomas Witkowski committed
257
      sum += recursive(elInfoStack);
258
259
260

      if (flag.isSet(Mesh::CALL_EVERY_EL_INORDER)) 
	if (el_fct!=NULL) { 
Thomas Witkowski's avatar
Thomas Witkowski committed
261
262
	  if (parametric) 
	    elinfo = parametric->addParametricInfo(elinfo);
263
	  elinfo->fillDetGrdLambda();
Thomas Witkowski's avatar
Thomas Witkowski committed
264
265
266
	  sum += el_fct(elinfo);
	  if (parametric) 
	    elinfo = parametric->removeParametricInfo(elinfo);
267
268
	}
      elinfo_new->fillElInfo(1, elinfo);
Thomas Witkowski's avatar
Thomas Witkowski committed
269
      sum += recursive(elInfoStack);
270

Thomas Witkowski's avatar
Thomas Witkowski committed
271
272
      elInfoStack->getBackElement();
    } else {
273
      if (flag.isSet(Mesh::CALL_EVERY_EL_INORDER)) 
Thomas Witkowski's avatar
Thomas Witkowski committed
274
275
276
	if (el_fct != NULL) {
	  if (parametric) 
	    elinfo = parametric->addParametricInfo(elinfo);
277
	  elinfo->fillDetGrdLambda();
Thomas Witkowski's avatar
Thomas Witkowski committed
278
279
280
	  sum += el_fct(elinfo);
	  if (parametric) 
	    elinfo = parametric->removeParametricInfo(elinfo);
281
282
283
284
	}
    }

    if (flag.isSet(Mesh::CALL_EVERY_EL_POSTORDER)) 
Thomas Witkowski's avatar
Thomas Witkowski committed
285
286
287
      if (el_fct != NULL) {
	if (parametric) 
	  elinfo = parametric->addParametricInfo(elinfo);
288
	elinfo->fillDetGrdLambda();
Thomas Witkowski's avatar
Thomas Witkowski committed
289
290
291
	sum += el_fct(elinfo);
	if (parametric) 
	  elinfo = parametric->removeParametricInfo(elinfo);
292
293
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
294
    return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;
295
296
297
298
  }

  void TraverseStack::enlargeTraverseStack()
  {
299
300
301
    FUNCNAME("TraverseStack::enlargeTraverseStack()");

    int new_stack_size = stack_size + 10;
302
303

    elinfo_stack.resize(new_stack_size, NULL);
304
 
305
    // create new elinfos
306
307
    for (int i = stack_size; i < new_stack_size; i++) {
      TEST_EXIT_DBG(elinfo_stack[i] == NULL)("???\n");
308
309
310
      elinfo_stack[i] = traverse_mesh->createNewElInfo();
    }

311
312
313
314
315
    if (stack_size > 0) {
      for (int i = stack_size; i < new_stack_size; i++) {
	elinfo_stack[i]->setFillFlag(elinfo_stack[0]->getFillFlag());
      }
    }
316
317
318
319
320

    info_stack.resize(new_stack_size);
    save_elinfo_stack.resize(new_stack_size, NULL);

    // create new elinfos
321
322
    for (int i = stack_size; i < new_stack_size; i++) {
      TEST_EXIT_DBG(save_elinfo_stack[i] == NULL)("???\n");
323
324
325
326
327
328
329
330
331
332
      save_elinfo_stack[i] = traverse_mesh->createNewElInfo();
    }
    save_info_stack.resize(new_stack_size);

    stack_size = new_stack_size;    
  }

  
  ElInfo* TraverseStack::traverseLeafElement()
  {
333
    FUNCNAME("TraverseStack::traverseLeafElement()");
334

335
    Element *el = NULL;
336

337
338
    if (stack_used == 0) {   /* first call */
      currentMacro = traverse_mesh->firstMacroElement();
339
340
341
342
343
344

      while (((*currentMacro)->getIndex() % maxThreads_ != myThreadId_) &&
      	     (currentMacro != traverse_mesh->endOfMacroElements())) {
      	currentMacro++;
      }

345
      if (currentMacro == traverse_mesh->endOfMacroElements()) {
346
	return NULL;
347
      }
348

349
350
351
352
      traverse_mel = *currentMacro;
      stack_used = 1;
      elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
      info_stack[stack_used] = 0;
353

354
355
      el = elinfo_stack[stack_used]->getElement();
      if ((el == NULL) || (el->getFirstChild() == NULL)) {
356
	return (elinfo_stack[stack_used]);
357
358
359
360
361
      }
    } else {
      el = elinfo_stack[stack_used]->getElement();
      
      /* go up in tree until we can go down again */
362
363
364
365
      while ((stack_used > 0) && 
	     ((info_stack[stack_used] >= 2) || (el->getFirstChild() == NULL))) {
	stack_used--;
	el = elinfo_stack[stack_used]->getElement();
366
367

	if (calcDisplacement) {
368
	  displacementStack.pop();
369
	}
370
      }
371
372
373
      
      /* goto next macro element */
      if (stack_used < 1) {
374
375
376
377
378
	do {	
	  currentMacro++;
	} while ((currentMacro != traverse_mesh->endOfMacroElements()) && 
		 ((*currentMacro)->getIndex() % maxThreads_ != myThreadId_));

379
	if (currentMacro == traverse_mesh->endOfMacroElements()) {
380
	  return NULL;
381
	}
382
383
	traverse_mel = *currentMacro;
	
384
385
386
	stack_used = 1;
	elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
	info_stack[stack_used] = 0;
387
	
388
389
	el = elinfo_stack[stack_used]->getElement();
	if ((el == NULL) || (el->getFirstChild() == NULL)) {
390
	  return (elinfo_stack[stack_used]);
391
392
	}
      }
393
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
394
   
395
    /* go down tree until leaf */
396
    while (el->getFirstChild()) {
397
      if (stack_used >= stack_size - 1) 
398
399
400
	enlargeTraverseStack();
      
      int i = info_stack[stack_used];
401
      el = const_cast<Element*>(((i == 0) ? el->getFirstChild() : el->getSecondChild()));
402
403
404
      info_stack[stack_used]++;
      elinfo_stack[stack_used + 1]->fillElInfo(i, elinfo_stack[stack_used]);
      stack_used++;
405
406

      if (calcDisplacement) {
407
408
	if (i == 0) {
	  displacementStack.push(displacementStack.top() * 2);
409
	} else {
410
411
	  displacementStack.push(displacementStack.top() * 2 + 1);
	}	
412
      }
413
414
      
      
415
      TEST_EXIT_DBG(stack_used < stack_size)
416
417
418
419
420
	("stack_size=%d too small, level=(%d,%d)\n",
	 stack_size, elinfo_stack[stack_used]->getLevel());
      
      info_stack[stack_used] = 0;
    }
421
422

    if (calcDisplacement) {
423
      elinfo_stack[stack_used]->setDisplacement(displacementStack.top());
424
    }
425
426
427
428
429
430
    
    return elinfo_stack[stack_used];
  }

  ElInfo* TraverseStack::traverseLeafElementLevel()
  {
431
    FUNCNAME("TraverseStack::traverseLeafElementLevel()");
432
    ERROR_EXIT("not yet implemented\n");
433

434
435
436
437
438
    return NULL;
  }

  ElInfo* TraverseStack::traverseElementLevel()
  {
439
    FUNCNAME("TraverseStack::traverseElementLevel()");
440
441
442
443
444
445

    ElInfo *elInfo;
    do {
      elInfo = traverseEveryElementPreorder();
    } while (elInfo != NULL && elInfo->getLevel() != traverse_level);

446
    return elInfo;
447
448
449
450
  }

  ElInfo* TraverseStack::traverseMultiGridLevel()
  {
451
    FUNCNAME("TraverseStack::traverseMultiGridLevel()");
452

453
454
455
456
457
458
459
460
461
462
463
464
465
466
    if (stack_used == 0) {   /* first call */
      currentMacro = traverse_mesh->firstMacroElement();
      traverse_mel = *currentMacro;
      if (traverse_mel == NULL)  return NULL;
      
      stack_used = 1;
      elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
      info_stack[stack_used] = 0;
      
      if ((elinfo_stack[stack_used]->getLevel() == traverse_level) ||
	  (elinfo_stack[stack_used]->getLevel() < traverse_level && 
	   elinfo_stack[stack_used]->getElement()->isLeaf()))
	return(elinfo_stack[stack_used]);
    }
467
  
468
    Element *el = elinfo_stack[stack_used]->getElement();
469
470

    /* go up in tree until we can go down again */
471
472
473
474
475
    while ((stack_used > 0) && 
	   ((info_stack[stack_used] >= 2) || (el->getFirstChild()==NULL))) {
      stack_used--;
      el = elinfo_stack[stack_used]->getElement();
    }
476
477
478
479
480


    /* goto next macro element */
    if (stack_used < 1) {
      currentMacro++;
481
482
      if (currentMacro == traverse_mesh->endOfMacroElements()) 
	return(NULL);
483

484
      traverse_mel = *currentMacro;
485
486
487
488
      stack_used = 1;
      elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
      info_stack[stack_used] = 0;

489
490
491
      if ((elinfo_stack[stack_used]->getLevel() == traverse_level) ||
	  (elinfo_stack[stack_used]->getLevel() < traverse_level && 
	   elinfo_stack[stack_used]->getElement()->isLeaf()))
492
493
494
495
496
497
	return(elinfo_stack[stack_used]);
    }


    /* go down tree */

498
499
500
501
    if (stack_used >= stack_size - 1) 
      enlargeTraverseStack();

    int i = info_stack[stack_used];
502
503
504
505
506
    info_stack[stack_used]++;

    elinfo_stack[stack_used + 1]->fillElInfo(i, elinfo_stack[stack_used]);
    stack_used++;

507
    TEST_EXIT_DBG(stack_used < stack_size)
508
509
510
511
512
      ("stack_size=%d too small, level=%d\n",
       stack_size, elinfo_stack[stack_used]->getLevel());

    info_stack[stack_used] = 0;
  
513
514
515
    if ((elinfo_stack[stack_used]->getLevel() == traverse_level) ||
	(elinfo_stack[stack_used]->getLevel() < traverse_level && 
	 elinfo_stack[stack_used]->getElement()->isLeaf()))
516
517
518
519
520
521
522
      return(elinfo_stack[stack_used]);

    return traverseMultiGridLevel();
  }

  ElInfo* TraverseStack::traverseEveryElementPreorder()
  {
523
    FUNCNAME("TraverseStack::traverseEveryElementPreorder()");
524
525
526

    Element *el;

527
528
529
530
531
532
533
534
535
    if (stack_used == 0) {   /* first call */
      currentMacro = traverse_mesh->firstMacroElement();
      traverse_mel = *currentMacro;
      if (traverse_mel == NULL)  
	return NULL;
      
      stack_used = 1;
      elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
      info_stack[stack_used] = 0;
536

537
538
      return(elinfo_stack[stack_used]);
    }
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
  
    el = elinfo_stack[stack_used]->getElement();

    /* go up in tree until we can go down again */
    while((stack_used > 0) && 
	  ((info_stack[stack_used] >= 2) || (el->getFirstChild()==NULL)))
      {
	stack_used--;
	el = elinfo_stack[stack_used]->getElement();
      }


    /* goto next macro element */
    if (stack_used < 1) {
      currentMacro++;
554
555
      if (currentMacro == traverse_mesh->endOfMacroElements()) 
	return(NULL);
556
557
558
559
560
561
562
563
564
565
566
567
      traverse_mel = *currentMacro;

      stack_used = 1;
      elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
      info_stack[stack_used] = 0;

      return(elinfo_stack[stack_used]);
    }


    /* go down tree */

568
    if (stack_used >= stack_size - 1) 
569
570
571
      enlargeTraverseStack();

    int i = info_stack[stack_used];
572
573
574
575
576
    info_stack[stack_used]++;

    elinfo_stack[stack_used + 1]->fillElInfo(i, elinfo_stack[stack_used]);
    stack_used++;

577
    TEST_EXIT_DBG(stack_used < stack_size)
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
      ("stack_size=%d too small, level=%d\n",
       stack_size, elinfo_stack[stack_used]->getLevel());

    info_stack[stack_used] = 0;
  
    return(elinfo_stack[stack_used]);
  }

  ElInfo* TraverseStack::traverseEveryElementInorder()
  {
    FUNCNAME("TraverseStack::traverseEveryElementInorder");
    ERROR_EXIT("not yet implemented\n");
    return NULL;
  }

  ElInfo* TraverseStack::traverseEveryElementPostorder()
  {
    FUNCNAME("TraverseStack::traverseEveryElementPostorder");

    Element *el;
    int i;

    if (stack_used == 0)   /* first call */
      {
	currentMacro = traverse_mesh->firstMacroElement();
	if(currentMacro == traverse_mesh->endOfMacroElements()) return NULL;
	traverse_mel = *currentMacro;

	stack_used = 1;
	elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
	info_stack[stack_used] = 0;

	//return(elinfo_stack[stack_used]);
      }
    else { /* don't go up on first call */
  
      el = elinfo_stack[stack_used]->getElement();

      /* go up in tree until we can go down again */          /* postorder!!! */
      while((stack_used > 0) && 
	    ((info_stack[stack_used] >= 3) || (el->getFirstChild()==NULL)))
	{
	  stack_used--;
	  el = elinfo_stack[stack_used]->getElement();
	}


      /* goto next macro element */
      if (stack_used < 1) {
	currentMacro++;
	if(currentMacro == traverse_mesh->endOfMacroElements()) return NULL;
	traverse_mel = *currentMacro;

	stack_used = 1;
	elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
	info_stack[stack_used] = 0;

	/*    return(elinfo_stack+stack_used); */
      }
    }
    /* go down tree */

    while(elinfo_stack[stack_used]->getElement()->getFirstChild()
	  && (info_stack[stack_used] < 2)) {
642
643
644
      if (stack_used >= stack_size-1) 
	enlargeTraverseStack();

645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
      i = info_stack[stack_used];
      info_stack[stack_used]++;
      elinfo_stack[stack_used + 1]->fillElInfo(i, elinfo_stack[stack_used]);
      stack_used++;
      info_stack[stack_used] = 0;
    }
  
    info_stack[stack_used]++;      /* postorder!!! */

    return(elinfo_stack[stack_used]);
  }

  ElInfo* TraverseStack::traverseNeighbour(ElInfo* elinfo_old, int neighbour)
  {
    int dim = elinfo_old->getMesh()->getDim();
    switch(dim) {
    case 1:
      ERROR_EXIT("invalid dim\n");
      break;
    case 2:
      return traverseNeighbour2d(elinfo_old, neighbour);
      break;
    case 3:
      return traverseNeighbour3d(elinfo_old, neighbour);
      break;
    default: ERROR_EXIT("invalid dim\n");
    }
    return NULL;
  }

  ElInfo* TraverseStack::traverseNeighbour3d(ElInfo* elinfo_old, int neighbour)
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
677
678
    FUNCNAME("TraverseStackLLtraverseNeighbour3d()");

679
    Element *el2;
680
681
682
683
684
685
686
687
688
    ElInfo *old_elinfo, *elinfo, *elinfo2;
    const DegreeOfFreedom *dof;
    int i, nb, opp_vertex, stack2_used, typ = 0;
    int sav_index, sav_neighbour = neighbour;

    static int coarse_nb[3][3][4] = {{{-2,-2,-2,-2}, {-1,2,3,1}, {-1,3,2,0}},
				     {{-2,-2,-2,-2}, {-1,2,3,1}, {-1,2,3,0}},
				     {{-2,-2,-2,-2}, {-1,2,3,1}, {-1,2,3,0}}};

689
    TEST_EXIT_DBG(stack_used > 0)("no current element\n");
690
691
692

    Parametric *parametric = traverse_mesh->getParametric();

693
694
    if (parametric) 
      elinfo_old = parametric->removeParametricInfo(elinfo_old);
695

696
    TEST_EXIT_DBG(elinfo_old == elinfo_stack[stack_used])
697
698
      ("invalid old elinfo\n");

699
    TEST_EXIT_DBG(elinfo_stack[stack_used]->getFillFlag().isSet(Mesh::FILL_NEIGH))
700
      ("FILL_NEIGH not set");
701
    Element *el = elinfo_stack[stack_used]->getElement();
702
703
704
705
706
    sav_index = el->getIndex();

    /* first, goto to leaf level, if necessary... */
    if ((traverse_fill_flag & Mesh::CALL_LEAF_EL).isAnySet()) {
      if ((el->getChild(0)) && (neighbour < 2)) {
707
	if (stack_used >= stack_size - 1)
708
709
	  enlargeTraverseStack();
	i = 1 - neighbour;
710
711
	elinfo_stack[stack_used + 1]->fillElInfo(i, elinfo_stack[stack_used]);
	info_stack[stack_used] = i + 1;
712
713
714
715
716
717
718
719
720
	stack_used++;
	info_stack[stack_used] = 0;
	neighbour = 3;
      }
    }


    /* save information about current element and its position in the tree */
    save_traverse_mel = traverse_mel;
721
    save_stack_used = stack_used;
722
723
724

    nb = neighbour;

725
726
727
728
729
730
731
732
    while (stack_used > 1) { /* go up in tree until we can go down again */
      stack_used--;
      typ = dynamic_cast<ElInfo3d*>( elinfo_stack[stack_used])->getType();
      nb = coarse_nb[typ][info_stack[stack_used]][nb];
      if (nb == -1) 
	break;
      TEST_EXIT_DBG(nb >= 0)("invalid coarse_nb %d\n",nb);
    }
733
734
735

    /* save hierarchy information about current element */

736
737
    for (i = stack_used; i <= save_stack_used; i++) {
      save_info_stack[i] = info_stack[i];
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
      *(save_elinfo_stack[i]) = *(elinfo_stack[i]);
    }

    old_elinfo = save_elinfo_stack[save_stack_used];
    opp_vertex = old_elinfo->getOppVertex(neighbour);

    if (nb >= 0) {                           /* go to macro element neighbour */

      i = traverse_mel->getOppVertex(nb);
      traverse_mel = traverse_mel->getNeighbour(nb);
      if (traverse_mel == NULL)  return(NULL);
    
      if ((nb < 2) && (save_stack_used > 1)) {
	stack2_used = 2;                /* go down one level in OLD hierarchy */
      }
      else {
	stack2_used = 1;
      }
      elinfo2 = save_elinfo_stack[stack2_used];
      el2 = elinfo2->getElement();

      stack_used = 1;
      elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
      info_stack[stack_used] = 0;
      nb = i;
Thomas Witkowski's avatar
Thomas Witkowski committed
763
    } else {                                                /* goto other child */
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
      stack2_used = stack_used + 1;
      if (save_stack_used > stack2_used) {
	stack2_used++;                  /* go down one level in OLD hierarchy */
      }
      elinfo2 = save_elinfo_stack[stack2_used];
      el2 = elinfo2->getElement();

      if (stack_used >= stack_size-1)
	enlargeTraverseStack();
      i = 2 - info_stack[stack_used];
      info_stack[stack_used] = i+1;
      elinfo_stack[stack_used+1]->fillElInfo(i, elinfo_stack[stack_used]);
      stack_used++;
      info_stack[stack_used] = 0;
      nb = 0;

    }


    elinfo = elinfo_stack[stack_used];
    el = elinfo->getElement();

    while(el->getChild(0)) {
 
      if (nb < 2) {                         /* go down one level in hierarchy */
	if (stack_used >= stack_size-1)
	  enlargeTraverseStack();
	info_stack[stack_used] = 2-nb;
Thomas Witkowski's avatar
Thomas Witkowski committed
792
	elinfo_stack[stack_used+1]->fillElInfo(1 - nb, elinfo_stack[stack_used]);
793
794
795
796
797
798
799
800
	stack_used++;
	info_stack[stack_used] = 0;
	elinfo = elinfo_stack[stack_used];
	el = elinfo->getElement();
	nb = 3;
      }

      if (save_stack_used > stack2_used) { /* `refine' both el and el2 */
801
	TEST_EXIT_DBG(el->getChild(0))("invalid NEW refinement?\n");
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843

	if (el->getDOF(0) == el2->getDOF(0))
	  i = save_info_stack[stack2_used] - 1;
	else if (el->getDOF(1) == el2->getDOF(0))
	  i = 2 - save_info_stack[stack2_used];
	else {
	  if (traverse_mesh->associated(el->getDOF(0, 0), el2->getDOF(0, 0)))
	    i = save_info_stack[stack2_used] - 1;
	  else if (traverse_mesh->associated(el->getDOF(1, 0), el2->getDOF(0, 0)))
	    i = 2 - save_info_stack[stack2_used];
	  else {
	    ERROR_EXIT("no common refinement edge\n");
	  }
	}

	if (el->getChild(0)  &&  
	    (el->getChild(i)->getDOF(1) == el->getDOF(nb) ||
	     traverse_mesh->associated(el->getChild(i)->getDOF(1, 0), el->getDOF(nb, 0)))) 
	  {   /*  el->child[0]  Kuni  22.08.96  */
	    nb = 1;
	  }
	else {
	  nb = 2;
	}

	info_stack[stack_used] = i+1;
	if (stack_used >= stack_size-1)
	  enlargeTraverseStack();
	elinfo_stack[stack_used+1]->fillElInfo(i, elinfo_stack[stack_used]);
	stack_used++;
	info_stack[stack_used] = 0;

	elinfo = elinfo_stack[stack_used];
	el = elinfo->getElement();

	stack2_used++;
	elinfo2 = save_elinfo_stack[stack2_used];
	el2 = elinfo2->getElement();
	if (save_stack_used > stack2_used) {
	  dof = el2->getDOF(1);
	  if (dof != el->getDOF(1) && dof != el->getDOF(2) &&
	      !traverse_mesh->associated(dof[0], el->getDOF(1, 0)) &&
844
845
846
847
848
849
	      !traverse_mesh->associated(dof[0], el->getDOF(2, 0))) {
	  
	    stack2_used++;               /* go down one level in OLD hierarchy */
	    elinfo2 = save_elinfo_stack[stack2_used];
	    el2 = elinfo2->getElement();
	  } 
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
	}

      }
      else {   /* now we're done... */
	elinfo = elinfo_stack[stack_used];
	el = elinfo->getElement();
	break;
      }
    }


    if (elinfo->getNeighbour(opp_vertex) != old_elinfo->getElement()) {
      MSG(" looking for neighbour %d of element %d at %p\n",
	  neighbour, old_elinfo->getElement()->getIndex(), reinterpret_cast<void*>( old_elinfo->getElement()));
      MSG(" originally: neighbour %d of element %d at %p\n",
	  sav_neighbour, sav_index, reinterpret_cast<void*>( old_elinfo->getElement()));
      MSG(" got element %d at %p with opp_vertex %d neigh %d\n",
	  elinfo->getElement()->getIndex(), reinterpret_cast<void*>( elinfo->getElement()),
	  opp_vertex, (elinfo->getNeighbour(opp_vertex))?(elinfo->getNeighbour(opp_vertex))->getIndex():-1);
869
      TEST_EXIT_DBG(elinfo->getNeighbour(opp_vertex) == old_elinfo->getElement())
870
871
872
873
874
875
876
877
878
	("didn't succeed !?!?!?\n");
    }


    if ((traverse_fill_flag & Mesh::CALL_EVERY_EL_POSTORDER).isAnySet())
      info_stack[stack_used] = 3;
    else if ((traverse_fill_flag & Mesh::CALL_EVERY_EL_INORDER).isAnySet())
      info_stack[stack_used] = 1;  /* ??? */

879
880
881
    if (elinfo) {
      if (parametric) 
	elinfo = parametric->addParametricInfo(elinfo);
882
883
884
885
886
887
888
      elinfo->fillDetGrdLambda();
    }
    return(elinfo);
  }

  ElInfo* TraverseStack::traverseNeighbour2d(ElInfo* elinfo_old, int neighbour)
  {
889
890
891
    FUNCNAME("TraverseStack::traverseNeighbour2d()");

    Triangle *el, *el2, *sav_el;
892
    ElInfo *old_elinfo, *elinfo, *elinfo2;
893
    int i, nb, opp_vertex, stack2_used;
894
895
896
897

    static int coarse_nb[3][3] = {{-2,-2,-2}, {2,-1,1}, {-1,2,0}};
    /* father.neigh[coarse_nb[i][j]] == child[i-1].neigh[j] */

Thomas Witkowski's avatar
Thomas Witkowski committed
898
    int sav_index, sav_neighbour = neighbour;
899

900
901
    TEST_EXIT_DBG(stack_used > 0)("no current element");
    TEST_EXIT_DBG(traverse_fill_flag.isSet(Mesh::CALL_LEAF_EL))("invalid traverse_fill_flag");
902
903
904
905
906
907

    Parametric *parametric = traverse_mesh->getParametric();

    if (parametric) 
      elinfo_old = parametric->removeParametricInfo(elinfo_old);

908
    TEST_EXIT_DBG(elinfo_old == elinfo_stack[stack_used])("invalid old elinfo");
909
910
911
912

    elinfo_stack[stack_used]->testFlag(Mesh::FILL_NEIGH);
    el = dynamic_cast<Triangle*>(const_cast<Element*>( elinfo_stack[stack_used]->getElement()));
    sav_index = el->getIndex();
913
    sav_el = el;
914
915
916
917
918
919
920
921
922
923
924
925
926

    /* first, goto to leaf level, if necessary... */
    if (!(el->isLeaf()) && (neighbour < 2)) {
      if (stack_used >= static_cast<int>( elinfo_stack.size())-1) enlargeTraverseStack();
      i = 1 - neighbour;
      elinfo_stack[stack_used+1]->fillElInfo(i, elinfo_stack[stack_used]);
      info_stack[stack_used] = i + 1;
      stack_used++;
      neighbour = 2;
    }

    /* save information about current element and its position in the tree */
    save_traverse_mel = traverse_mel;
Thomas Witkowski's avatar
Thomas Witkowski committed
927
928
    save_stack_used = stack_used;
    for (i = 0; i<=stack_used; i++)
929
      save_info_stack[i] = info_stack[i];
Thomas Witkowski's avatar
Thomas Witkowski committed
930
    for (i = 0; i<=stack_used; i++)
931
932
933
934
935
936
937
938
939
940
941
942
943
944
      (*(save_elinfo_stack[i])) = (*(elinfo_stack[i]));
    old_elinfo = save_elinfo_stack[stack_used];
    opp_vertex = old_elinfo->getOppVertex(neighbour);


    /****************************************************************************/
    /* First phase: go up in tree until we can go down again.                   */
    /*                                                                          */
    /* During this first phase, nb is the neighbour index which points from an  */
    /* element of the OLD hierarchy branch to the NEW branch                    */
    /****************************************************************************/

    nb = neighbour;

945
946
947
948
949
950
951
952
    while (stack_used > 1) {
      stack_used--;
      nb = coarse_nb[info_stack[stack_used]][nb];
      if (nb == -1) 
	break;
      
      TEST_EXIT_DBG(nb >= 0)("invalid coarse_nb %d\n",nb);
    }
953
954
955
956
957
958
959
960
961
962
963

    /****************************************************************************/
    /* Now, goto neighbouring element at the local hierarchy entry              */
    /* This is either a macro element neighbour or the other child of parent.   */
    /* initialize nb for second phase (see below)                               */
    /****************************************************************************/

    if (nb >= 0) {                        /* go to macro element neighbour */

      if ((nb < 2) && (save_stack_used > 1)) {
	stack2_used = 2;           /* go down one level in OLD hierarchy */
964
      } else {
965
966
967
968
969
970
971
	stack2_used = 1;
      }
      elinfo2 = save_elinfo_stack[stack2_used];
      el2 = dynamic_cast<Triangle*>(const_cast<Element*>( elinfo2->getElement()));

      i = traverse_mel->getOppVertex(nb);
      traverse_mel = traverse_mel->getNeighbour(nb);
972
973
      if (traverse_mel == NULL)
	return NULL;
974
975
976
977
978
979
      nb = i;
    
      stack_used = 1;
      elinfo_stack[stack_used]->fillMacroInfo(const_cast<MacroElement*>( traverse_mel));
      info_stack[stack_used] = 0;
    
980
    } else {                                               /* goto other child */
981
982
983
984
985
986
987
988
989

      stack2_used = stack_used + 1;
      if (save_stack_used > stack2_used) {
	stack2_used++;               /* go down one level in OLD hierarchy */
      }
      elinfo2 = save_elinfo_stack[stack2_used];
      el2 = dynamic_cast<Triangle*>(const_cast<Element*>( elinfo2->getElement()));


990
      if (stack_used >= stack_size-1) {
991
	enlargeTraverseStack();
992
      }
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
      i = 2 - info_stack[stack_used];
      info_stack[stack_used] = i+1;
      elinfo_stack[stack_used+1]->fillElInfo(i, elinfo_stack[stack_used]);
      stack_used++;
      nb = 1-i;
    }

    /****************************************************************************/
    /* Second phase: go down in a new hierarchy branch until leaf level.        */
    /* Now, nb is the neighbour index which points from an element of the       */
    /* NEW hierarchy branch to the OLD branch.                                  */
    /****************************************************************************/

    elinfo = elinfo_stack[stack_used];
    el = dynamic_cast<Triangle*>(const_cast<Element*>( elinfo->getElement()));

1009
    while (el->getFirstChild()) {
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020

      if (nb < 2) {   /* go down one level in hierarchy */
	if (stack_used >= stack_size-1)
	  enlargeTraverseStack();
	elinfo_stack[stack_used+1]->fillElInfo(1-nb, elinfo_stack[stack_used]);
	info_stack[stack_used] = 2-nb;
	stack_used++;
	nb = 2;
      }

      if (save_stack_used > stack2_used) { /* `refine' both el and el2 */
1021
	TEST_EXIT_DBG(el->getFirstChild())("invalid NEW refinement?");
1022
1023
1024

	/* use child i, neighbour of el2->child[nb-1] */
	i = 2 - save_info_stack[stack2_used];
1025
	TEST_EXIT_DBG(i < 2)("invalid OLD refinement?");
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
	info_stack[stack_used] = i+1;
	elinfo_stack[stack_used+1]->fillElInfo(i, elinfo_stack[stack_used]);
	stack_used++;
	nb = i;

	elinfo = elinfo_stack[stack_used];
	el = dynamic_cast<Triangle*>(const_cast<Element*>( elinfo->getElement()));

	stack2_used++;
	if (save_stack_used > stack2_used) {
	  stack2_used++;                /* go down one level in OLD hierarchy */
	}
	elinfo2 = save_elinfo_stack[stack2_used];
	el2 = dynamic_cast<Triangle*>(const_cast<Element*>( elinfo2->getElement()));

      }
      else {   /* now we're done... */
	elinfo = elinfo_stack[stack_used];
	el = dynamic_cast<Triangle*>(const_cast<Element*>( elinfo->getElement()));
      }
    }


    if (elinfo->getNeighbour(opp_vertex) != old_elinfo->getElement()) {
      MSG(" looking for neighbour %d of element %d at %8X\n",
	  neighbour, old_elinfo->getElement()->getIndex(), old_elinfo->getElement());
      MSG(" originally: neighbour %d of element %d at %8X\n",
	  sav_neighbour, sav_index, sav_el);
      MSG(" got element %d at %8X with opp_vertex %d neigh %d\n",
	  elinfo->getElement()->getIndex(), elinfo->getElement(), opp_vertex,
	  elinfo->getNeighbour(opp_vertex)?elinfo->getNeighbour(opp_vertex)->getIndex():-1);
1057
      TEST_EXIT_DBG(elinfo->getNeighbour(opp_vertex) == old_elinfo->getElement())
1058
1059
	("didn't succeed !?!?!?");
    }
1060

1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
    if (elinfo->getElement()->getFirstChild()) {
      MSG(" looking for neighbour %d of element %d at %8X\n",
	  neighbour, old_elinfo->getElement()->getIndex(), old_elinfo->getElement());
      MSG(" originally: neighbour %d of element %d at %8X\n",
	  sav_neighbour, sav_index, sav_el);
      MSG(" got element %d at %8X with opp_vertex %d neigh %d\n",
	  elinfo->getElement()->getIndex(), elinfo->getElement(), opp_vertex,
	  elinfo->getNeighbour(opp_vertex)->getIndex());
      MSG("got no leaf element\n");
      WAIT_REALLY;
    }

    if (elinfo) {
      if (parametric) 
	elinfo = parametric->addParametricInfo(elinfo);
1076
1077
1078
1079
1080
1081
1082
1083
1084

      elinfo->fillDetGrdLambda();
    }

    return(elinfo);
  }

  void TraverseStack::update()
  {
1085
    FUNCNAME("TraverseStack::update()");
1086

1087
    TEST_EXIT_DBG(traverse_mesh->getDim() == 3)("update only in 3d\n");
1088

1089
    for (int i = stack_used; i > 0; i--) {
1090
      dynamic_cast<ElInfo3d*>(elinfo_stack[i])->update();
1091
1092
1093
    }
  }

1094
  void TraverseStack::getCoordsInElem(const ElInfo *upperElInfo, 
1095
				      DimMat<double> *coords)
1096
  {
1097
1098
    int levelDif = elinfo_stack[stack_used]->getLevel() - upperElInfo->getLevel();

1099
1100
    upperElInfo->getRefSimplexCoords(coords);
    
1101
1102
1103
    for (int i = 1; i <= levelDif; i++) {
      upperElInfo->getSubElementCoords(coords,
				       elinfo_stack[stack_used - levelDif + i]->getIChild());
1104
1105
    }
  }
1106
1107
1108
1109
1110

  void TraverseStack::startDisplacementCalculation(int level) 
  {
    calcDisplacement = true;

1111
1112
1113
    displacementStack.empty();
    for (int i = 0; i <= elinfo_stack[stack_used]->getLevel() - level; i++) {
      displacementStack.push(0);
1114
1115
1116
1117
1118
    }

    elinfo_stack[stack_used]->setDisplacement(0);
  }

1119
}