Traverse.cc 32.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
	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
114
  int Traverse::recursive(ElInfoStack *elInfoStack)
115
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
116
    FUNCNAME("Traverse::recursive()");
117

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

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

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

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

    if (flag.isSet(Mesh::CALL_EL_LEVEL)) {
      if (elinfo->getLevel() == level) {
Thomas Witkowski's avatar
Thomas Witkowski committed
172
173
174
	if (NULL != el_fct) {
	  if (parametric) 
	    elinfo = parametric->addParametricInfo(elinfo);
175
	  elinfo->fillDetGrdLambda();
Thomas Witkowski's avatar
Thomas Witkowski committed
176
177
178
	  sum += el_fct(elinfo); 
	  if (parametric) 
	    elinfo = parametric->removeParametricInfo(elinfo);
179
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
180
      } else {
181
	if (elinfo->getLevel() > level){
Thomas Witkowski's avatar
Thomas Witkowski committed
182
183
184
185
186
187
188
189
	  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();
190
191
192
	}
      }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    int new_stack_size = stack_size + 10;
301
302

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

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

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

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

    stack_size = new_stack_size;    
  }

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

334
    Element *el = NULL;
335

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

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

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

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

353
354
      el = elinfo_stack[stack_used]->getElement();
      if ((el == NULL) || (el->getFirstChild() == NULL)) {
355
	return (elinfo_stack[stack_used]);
356
357
358
359
360
      }
    } else {
      el = elinfo_stack[stack_used]->getElement();
      
      /* go up in tree until we can go down again */
361
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
368
      
      /* goto next macro element */
      if (stack_used < 1) {
369
370
371
372
373
	do {	
	  currentMacro++;
	} while ((currentMacro != traverse_mesh->endOfMacroElements()) && 
		 ((*currentMacro)->getIndex() % maxThreads_ != myThreadId_));

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

401
      TEST_EXIT_DBG(stack_used < stack_size)
402
403
404
405
406
	("stack_size=%d too small, level=(%d,%d)\n",
	 stack_size, elinfo_stack[stack_used]->getLevel());
      
      info_stack[stack_used] = 0;
    }
407

408
409
410
411
412
    return elinfo_stack[stack_used];
  }

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

416
417
418
419
420
    return NULL;
  }

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

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

428
    return elInfo;
429
430
431
432
  }

  ElInfo* TraverseStack::traverseMultiGridLevel()
  {
433
    FUNCNAME("TraverseStack::traverseMultiGridLevel()");
434

435
436
437
438
439
440
441
442
443
444
445
446
447
448
    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]);
    }
449
  
450
    Element *el = elinfo_stack[stack_used]->getElement();
451
452

    /* go up in tree until we can go down again */
453
454
455
456
457
    while ((stack_used > 0) && 
	   ((info_stack[stack_used] >= 2) || (el->getFirstChild()==NULL))) {
      stack_used--;
      el = elinfo_stack[stack_used]->getElement();
    }
458
459
460
461
462


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

466
      traverse_mel = *currentMacro;
467
468
469
470
      stack_used = 1;
      elinfo_stack[stack_used]->fillMacroInfo(traverse_mel);
      info_stack[stack_used] = 0;

471
472
473
      if ((elinfo_stack[stack_used]->getLevel() == traverse_level) ||
	  (elinfo_stack[stack_used]->getLevel() < traverse_level && 
	   elinfo_stack[stack_used]->getElement()->isLeaf()))
474
475
476
477
478
479
	return(elinfo_stack[stack_used]);
    }


    /* go down tree */

480
481
482
483
    if (stack_used >= stack_size - 1) 
      enlargeTraverseStack();

    int i = info_stack[stack_used];
484
485
486
487
488
    info_stack[stack_used]++;

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

489
    TEST_EXIT_DBG(stack_used < stack_size)
490
491
492
493
494
      ("stack_size=%d too small, level=%d\n",
       stack_size, elinfo_stack[stack_used]->getLevel());

    info_stack[stack_used] = 0;
  
495
496
497
    if ((elinfo_stack[stack_used]->getLevel() == traverse_level) ||
	(elinfo_stack[stack_used]->getLevel() < traverse_level && 
	 elinfo_stack[stack_used]->getElement()->isLeaf()))
498
499
500
501
502
503
504
      return(elinfo_stack[stack_used]);

    return traverseMultiGridLevel();
  }

  ElInfo* TraverseStack::traverseEveryElementPreorder()
  {
505
    FUNCNAME("TraverseStack::traverseEveryElementPreorder()");
506
507
508

    Element *el;

509
510
511
512
513
514
515
516
517
    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;
518

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

550
    if (stack_used >= stack_size - 1) 
551
552
553
      enlargeTraverseStack();

    int i = info_stack[stack_used];
554
555
556
557
558
    info_stack[stack_used]++;

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

559
    TEST_EXIT_DBG(stack_used < stack_size)
560
561
562
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
      ("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)) {
624
625
626
      if (stack_used >= stack_size-1) 
	enlargeTraverseStack();

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
      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
659
660
    FUNCNAME("TraverseStackLLtraverseNeighbour3d()");

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

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

    Parametric *parametric = traverse_mesh->getParametric();

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

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

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

    nb = neighbour;

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

    /* save hierarchy information about current element */

718
719
    for (i = stack_used; i <= save_stack_used; i++) {
      save_info_stack[i] = info_stack[i];
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
      *(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
745
    } else {                                                /* goto other child */
746
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
      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
774
	elinfo_stack[stack_used+1]->fillElInfo(1 - nb, elinfo_stack[stack_used]);
775
776
777
778
779
780
781
782
	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 */
783
	TEST_EXIT_DBG(el->getChild(0))("invalid NEW refinement?\n");
784
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

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

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

861
862
863
    if (elinfo) {
      if (parametric) 
	elinfo = parametric->addParametricInfo(elinfo);
864
865
866
867
868
869
870
      elinfo->fillDetGrdLambda();
    }
    return(elinfo);
  }

  ElInfo* TraverseStack::traverseNeighbour2d(ElInfo* elinfo_old, int neighbour)
  {
871
872
    FUNCNAME("TraverseStack::traverseNeighbour2d()");

873
    Element *el, *el2, *sav_el;
874
    ElInfo *old_elinfo, *elinfo, *elinfo2;
875
    int i, nb, opp_vertex, stack2_used;
876
877
878
879

    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
880
    int sav_index, sav_neighbour = neighbour;
881

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

    elinfo_stack[stack_used]->testFlag(Mesh::FILL_NEIGH);
893
    el = elinfo_stack[stack_used]->getElement();
894
    sav_index = el->getIndex();
895
    sav_el = el;
896
897
898
899
900
901
902
903
904
905
906
907
908

    /* 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
909
910
    save_stack_used = stack_used;
    for (i = 0; i<=stack_used; i++)
911
      save_info_stack[i] = info_stack[i];
Thomas Witkowski's avatar
Thomas Witkowski committed
912
    for (i = 0; i<=stack_used; i++)
913
914
915
916
917
918
919
920
921
922
923
924
925
926
      (*(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;

927
928
929
930
931
932
933
934
    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);
    }
935
936
937
938
939
940
941
942
943
944
945

    /****************************************************************************/
    /* 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 */
946
      } else {
947
948
949
	stack2_used = 1;
      }
      elinfo2 = save_elinfo_stack[stack2_used];
950
      el2 = elinfo2->getElement();
951
952
953

      i = traverse_mel->getOppVertex(nb);
      traverse_mel = traverse_mel->getNeighbour(nb);
954
955
      if (traverse_mel == NULL)
	return NULL;
956
957
958
959
960
961
      nb = i;
    
      stack_used = 1;
      elinfo_stack[stack_used]->fillMacroInfo(const_cast<MacroElement*>( traverse_mel));
      info_stack[stack_used] = 0;
    
962
    } else {                                               /* goto other child */
963
964
965
966
967
968

      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];
969
      el2 = elinfo2->getElement();
970
971


972
      if (stack_used >= stack_size - 1) {
973
	enlargeTraverseStack();
974
      }
975
      i = 2 - info_stack[stack_used];
976
977
      info_stack[stack_used] = i + 1;
      elinfo_stack[stack_used + 1]->fillElInfo(i, elinfo_stack[stack_used]);
978
      stack_used++;
979
      nb = 1 - i;
980
981
982
983
984
985
986
987
988
    }

    /****************************************************************************/
    /* 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];
989
    el = elinfo->getElement();
990

991
    while (el->getFirstChild()) {
992
993

      if (nb < 2) {   /* go down one level in hierarchy */
994
	if (stack_used >= stack_size - 1)
995
	  enlargeTraverseStack();
996
997
	elinfo_stack[stack_used + 1]->fillElInfo(1 - nb, elinfo_stack[stack_used]);
	info_stack[stack_used] = 2 - nb;
998
999
1000
1001
1002
	stack_used++;
	nb = 2;
      }

      if (save_stack_used > stack2_used) { /* `refine' both el and el2 */
1003
	TEST_EXIT_DBG(el->getFirstChild())("invalid NEW refinement?");
1004
1005
1006

	/* use child i, neighbour of el2->child[nb-1] */
	i = 2 - save_info_stack[stack2_used];
1007
	TEST_EXIT_DBG(i < 2)("invalid OLD refinement?");
1008
1009
	info_stack[stack_used] = i + 1;
	elinfo_stack[stack_used + 1]->fillElInfo(i, elinfo_stack[stack_used]);
1010
1011
1012
1013
	stack_used++;
	nb = i;

	elinfo = elinfo_stack[stack_used];
1014
	el = elinfo->getElement();
1015
1016
1017
1018
1019
1020

	stack2_used++;
	if (save_stack_used > stack2_used) {
	  stack2_used++;                /* go down one level in OLD hierarchy */
	}
	elinfo2 = save_elinfo_stack[stack2_used];
1021
	el2 = elinfo2->getElement();
1022

1023
      } else {   /* now we're done... */
1024
	elinfo = elinfo_stack[stack_used];
1025
	el = elinfo->getElement();
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
      }
    }


    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);
1038
      TEST_EXIT_DBG(elinfo->getNeighbour(opp_vertex) == old_elinfo->getElement())
1039
1040
	("didn't succeed !?!?!?");
    }
1041

1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
    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);
1057
1058
1059
1060

      elinfo->fillDetGrdLambda();
    }

1061
    return elinfo;
1062
1063
1064
1065
  }

  void TraverseStack::update()
  {
1066
    FUNCNAME("TraverseStack::update()");
1067

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

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

1075
  void TraverseStack::getCoordsInElem(const ElInfo *upperElInfo, 
1076
				      DimMat<double> *coords)
1077
  {
1078
1079
    int levelDif = elinfo_stack[stack_used]->getLevel() - upperElInfo->getLevel();

1080
1081
    upperElInfo->getRefSimplexCoords(coords);
    
1082
1083
1084
    for (int i = 1; i <= levelDif; i++) {
      upperElInfo->getSubElementCoords(coords,
				       elinfo_stack[stack_used - levelDif + i]->getIChild());
1085
1086
    }
  }
1087
}