Traverse.cc 32.9 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;
Thomas Witkowski's avatar
Thomas Witkowski committed
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
53
54
55
56
57
58
    ElInfo::traverseId = id;
    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
124
125
126
127
    Parametric *parametric = mesh->getParametric();
    ElInfo::traverseId = id;

    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)) {

Thomas Witkowski's avatar
Thomas Witkowski committed
199
200
      mg_level = (static_cast<int>(elinfo->getLevel()) + mesh->getDim() - 1) / 
	mesh->getDim();
201
202
203
204
205
206

      if (mg_level > static_cast<int>(level))  {
	return 0;
      }

      if (!(el->getFirstChild())) {
Thomas Witkowski's avatar
Thomas Witkowski committed
207
208
209
	if (el_fct != NULL) {
	  if (parametric) 
	    elinfo = parametric->addParametricInfo(elinfo);
210
	  elinfo->fillDetGrdLambda();
Thomas Witkowski's avatar
Thomas Witkowski committed
211
212
213
	  sum += el_fct(elinfo);
	  if (parametric) 
	    elinfo = parametric->removeParametricInfo(elinfo);
214
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
215
	return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;
216
217
      }
    
Thomas Witkowski's avatar
Thomas Witkowski committed
218
219
220
221
222
223
224
225
      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);
226
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
227
228
	return (flag.isSet(Mesh::FILL_ADD_ALL)) ? sum : 0;
      }
229

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

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

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

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

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

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

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

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

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

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

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

    int new_stack_size = stack_size + 10;
303
304

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

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

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

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

    stack_size = new_stack_size;    
  }

  
  ElInfo* TraverseStack::traverseLeafElement()
  {
334
    FUNCNAME("TraverseStack::traverseLeafElement()");
335
336
337

    Element *el;

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

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

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

349
350
351
352
353
      traverse_mel = *currentMacro;

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

355
356
      el = elinfo_stack[stack_used]->getElement();
      if ((el == NULL) || (el->getFirstChild() == NULL)) {
357
	return (elinfo_stack[stack_used]);
358
359
360
361
362
      }
    } else {
      el = elinfo_stack[stack_used]->getElement();
      
      /* go up in tree until we can go down again */
363
364
365
366
367
      while ((stack_used > 0) && 
	     ((info_stack[stack_used] >= 2) || (el->getFirstChild() == NULL))) {
	stack_used--;
	el = elinfo_stack[stack_used]->getElement();
      }
368
369
370
      
      /* goto next macro element */
      if (stack_used < 1) {
371
372
373
374
375
	do {	
	  currentMacro++;
	} while ((currentMacro != traverse_mesh->endOfMacroElements()) && 
		 ((*currentMacro)->getIndex() % maxThreads_ != myThreadId_));

376
377
378
379
	if (currentMacro == traverse_mesh->endOfMacroElements()) 
	  return NULL;
	traverse_mel = *currentMacro;
	
380
381
382
	stack_used = 1;
	elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
	info_stack[stack_used] = 0;
383
	
384
385
	el = elinfo_stack[stack_used]->getElement();
	if ((el == NULL) || (el->getFirstChild() == NULL)) {
386
	  return (elinfo_stack[stack_used]);
387
388
	}
      }
389
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
390
   
391
    /* go down tree until leaf */
392
393
394
395
396
397
398
399
400
401
402
    while (el->getFirstChild()) {
      if (stack_used >= stack_size-1) 
	enlargeTraverseStack();
      
      int i = info_stack[stack_used];
      el = const_cast<Element*>( ((i == 0) ? el->getFirstChild() : el->getSecondChild()));
      info_stack[stack_used]++;
      elinfo_stack[stack_used + 1]->fillElInfo(i, elinfo_stack[stack_used]);
      stack_used++;
      
      
403
      TEST_EXIT_DBG(stack_used < stack_size)
404
405
406
407
408
	("stack_size=%d too small, level=(%d,%d)\n",
	 stack_size, elinfo_stack[stack_used]->getLevel());
      
      info_stack[stack_used] = 0;
    }
409
410
411
412
413
414
    
    return elinfo_stack[stack_used];
  }

  ElInfo* TraverseStack::traverseLeafElementLevel()
  {
415
    FUNCNAME("TraverseStack::traverseLeafElementLevel()");
416
    ERROR_EXIT("not yet implemented\n");
417

418
419
420
421
422
    return NULL;
  }

  ElInfo* TraverseStack::traverseElementLevel()
  {
423
    FUNCNAME("TraverseStack::traverseElementLevel()");
424
425
426
427
428
429

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

430
    return elInfo;
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
  }

  ElInfo* TraverseStack::traverseMultiGridLevel()
  {
    FUNCNAME("TraverseStack::traverseMultiGridLevel");
    Element *el;
    int i;

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

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


    /* go down tree */

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

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

492
    TEST_EXIT_DBG(stack_used < stack_size)
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
      ("stack_size=%d too small, level=%d\n",
       stack_size, elinfo_stack[stack_used]->getLevel());

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

    return traverseMultiGridLevel();
  }

  ElInfo* TraverseStack::traverseEveryElementPreorder()
  {
508
    FUNCNAME("TraverseStack::traverseEveryElementPreorder()");
509
510
511

    Element *el;

512
513
514
515
516
517
518
519
520
    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;
521

522
523
      return(elinfo_stack[stack_used]);
    }
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
  
    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++;
539
540
      if (currentMacro == traverse_mesh->endOfMacroElements()) 
	return(NULL);
541
542
543
544
545
546
547
548
549
550
551
552
      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 */

553
    if (stack_used >= stack_size - 1) 
554
555
556
      enlargeTraverseStack();

    int i = info_stack[stack_used];
557
558
559
560
561
    info_stack[stack_used]++;

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

562
    TEST_EXIT_DBG(stack_used < stack_size)
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
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
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
      ("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)) {
      if (stack_used >= stack_size-1) enlargeTraverseStack();
      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
660
661
    FUNCNAME("TraverseStackLLtraverseNeighbour3d()");

662
    Element *el2;
663
664
665
666
667
668
669
670
671
    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}}};

672
    TEST_EXIT_DBG(stack_used > 0)("no current element\n");
673
674
675

    Parametric *parametric = traverse_mesh->getParametric();

676
677
    if (parametric) 
      elinfo_old = parametric->removeParametricInfo(elinfo_old);
678

679
    TEST_EXIT_DBG(elinfo_old == elinfo_stack[stack_used])
680
681
      ("invalid old elinfo\n");

682
    TEST_EXIT_DBG(elinfo_stack[stack_used]->getFillFlag().isSet(Mesh::FILL_NEIGH))
683
      ("FILL_NEIGH not set");
684
    Element *el = elinfo_stack[stack_used]->getElement();
685
686
687
688
689
    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)) {
690
	if (stack_used >= stack_size - 1)
691
692
	  enlargeTraverseStack();
	i = 1 - neighbour;
693
694
	elinfo_stack[stack_used + 1]->fillElInfo(i, elinfo_stack[stack_used]);
	info_stack[stack_used] = i + 1;
695
696
697
698
699
700
701
702
703
	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;
704
    save_stack_used = stack_used;
705
706
707

    nb = neighbour;

708
709
710
711
712
713
714
715
    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);
    }
716
717
718

    /* save hierarchy information about current element */

719
720
    for (i = stack_used; i <= save_stack_used; i++) {
      save_info_stack[i] = info_stack[i];
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
      *(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
746
    } else {                                                /* goto other child */
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
      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
775
	elinfo_stack[stack_used+1]->fillElInfo(1 - nb, elinfo_stack[stack_used]);
776
777
778
779
780
781
782
783
	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 */
784
	TEST_EXIT_DBG(el->getChild(0))("invalid NEW refinement?\n");
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
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

	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)) &&
827
828
829
830
831
832
	      !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();
	  } 
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
	}

      }
      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);
852
      TEST_EXIT_DBG(elinfo->getNeighbour(opp_vertex) == old_elinfo->getElement())
853
854
855
856
857
858
859
860
861
	("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;  /* ??? */

862
863
864
    if (elinfo) {
      if (parametric) 
	elinfo = parametric->addParametricInfo(elinfo);
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
      elinfo->fillDetGrdLambda();
    }
    return(elinfo);
  }

  ElInfo* TraverseStack::traverseNeighbour2d(ElInfo* elinfo_old, int neighbour)
  {
    FUNCNAME("TraverseStack::traverseNeighbour2d");
    Triangle   *el, *el2, *sav_el;
    ElInfo *old_elinfo, *elinfo, *elinfo2;
    int     i, nb, opp_vertex, stack2_used;

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

    int     sav_index, sav_neighbour = neighbour;

882
883
    TEST_EXIT_DBG(stack_used > 0)("no current element");
    TEST_EXIT_DBG(traverse_fill_flag.isSet(Mesh::CALL_LEAF_EL))("invalid traverse_fill_flag");
884
885
886
887
888
889

    Parametric *parametric = traverse_mesh->getParametric();

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

890
    TEST_EXIT_DBG(elinfo_old == elinfo_stack[stack_used])("invalid old elinfo");
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931

    elinfo_stack[stack_used]->testFlag(Mesh::FILL_NEIGH);
    el = dynamic_cast<Triangle*>(const_cast<Element*>( elinfo_stack[stack_used]->getElement()));
    sav_index = el->getIndex();
    sav_el    = el;

    /* 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;
    save_stack_used   = stack_used;
    for (i=0; i<=stack_used; i++)
      save_info_stack[i] = info_stack[i];
    for (i=0; i<=stack_used; i++)
      (*(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;

    while (stack_used > 1)
      {
	stack_used--;
	nb = coarse_nb[info_stack[stack_used]][nb];
	if (nb == -1) break;
932
	TEST_EXIT_DBG(nb >= 0)("invalid coarse_nb %d\n",nb);
933
934
935
936
937
938
939
940
941
942
943
944
      }

    /****************************************************************************/
    /* 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 */
945
      } else {
946
947
948
949
950
951
952
	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);
953
954
      if (traverse_mel == NULL)
	return NULL;
955
956
957
958
959
960
      nb = i;
    
      stack_used = 1;
      elinfo_stack[stack_used]->fillMacroInfo(const_cast<MacroElement*>( traverse_mel));
      info_stack[stack_used] = 0;
    
961
    } else {                                               /* goto other child */
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000

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


      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++;
      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()));

    while(el->getFirstChild()) {

      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 */
1001
	TEST_EXIT_DBG(el->getFirstChild())("invalid NEW refinement?");
1002
1003
1004

	/* use child i, neighbour of el2->child[nb-1] */
	i = 2 - save_info_stack[stack2_used];
1005
	TEST_EXIT_DBG(i < 2)("invalid OLD refinement?");
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
	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);
1037
      TEST_EXIT_DBG(elinfo->getNeighbour(opp_vertex) == old_elinfo->getElement())
1038
1039
	("didn't succeed !?!?!?");
    }
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
    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);
1055
1056
1057
1058
1059
1060
1061
1062
1063

      elinfo->fillDetGrdLambda();
    }

    return(elinfo);
  }

  void TraverseStack::update()
  {
1064
    FUNCNAME("TraverseStack::update()");
1065

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

1068
    for (int i = stack_used; i > 0; i--) {
1069
1070
1071
1072
      dynamic_cast<ElInfo3d*>( elinfo_stack[i])->update();
    }
  }

1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
  void TraverseStack::getCoordsInElem(const ElInfo *upperElInfo, 
				      VectorOfFixVecs<DimVec<double> > *coords)
  {
    int upperLevel = static_cast<int>(upperElInfo->getLevel());
    int lowerLevel = static_cast<int>(elinfo_stack[stack_used]->getLevel());
    int stackPos = stack_used;
    upperElInfo->getRefSimplexCoords(coords);
    
    while (lowerLevel > upperLevel) {
      upperElInfo->getSubElementCoords(coords, elinfo_stack[stackPos]->getIChild());
      stackPos--;
      lowerLevel--;
    }
  }
1087
}