DualTraverse.cc 5.75 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
//
// Software License for AMDiS
//
// Copyright (c) 2010 Dresden University of Technology 
// All rights reserved.
// Authors: Simon Vey, Thomas Witkowski et al.
//
// This file is part of AMDiS
//
// See also license.opensource.txt in the distribution.


13
14
15
16
17
18
#include "DualTraverse.h"
#include "Mesh.h"
#include "ElInfo.h"

namespace AMDiS {

19
20
21
22
23
24
  bool DualTraverse::traverseFirst(Mesh *mesh1, 
				   Mesh *mesh2, 
				   int level1, 
				   int level2, 
				   Flag flag1,
				   Flag flag2,
25
26
27
28
29
				   ElInfo **elInfo1,
				   ElInfo **elInfo2,
				   ElInfo **elInfoSmall,
				   ElInfo **elInfoLarge)
  {
30
    FUNCNAME("DualTraverse::traverseFirst()");
31
    // replace CALL_EL_LEVEL by CALL_MG_LEVEL (covers whole domain)
32
    if (flag1.isSet(Mesh::CALL_EL_LEVEL)) {
33
34
35
36
37
38
39
      flag1 &= ~Mesh::CALL_EL_LEVEL;
      flag1 |= Mesh::CALL_MG_LEVEL;
      level1_ = level1;
    } else {
      level1_ = -1;
    }

40
    if (flag2.isSet(Mesh::CALL_EL_LEVEL)) {
41
42
43
44
45
46
47
48
      flag2 &= ~Mesh::CALL_EL_LEVEL;
      flag2 |= Mesh::CALL_MG_LEVEL;
      level2_ = level2;
    } else {
      level2_ = -1;
    }

    // replace CALL_LEAF_EL_LEVEL by CALL_MG_LEVEL (covers whole domain)
49
    if (flag1.isSet(Mesh::CALL_LEAF_EL_LEVEL)) {
50
51
52
53
54
55
56
57
58
      flag1 &= ~Mesh::CALL_LEAF_EL_LEVEL;
      flag1 |= Mesh::CALL_MG_LEVEL;
      level1_ = level1;
      callLeafElLevel1_ = true;
    } else {
      level1_ = -1;
      callLeafElLevel1_ = false;
    }

59
    if (flag2.isSet(Mesh::CALL_LEAF_EL_LEVEL)) {
60
61
62
63
64
65
66
67
68
69
70
      flag2 &= ~Mesh::CALL_LEAF_EL_LEVEL;
      flag2 |= Mesh::CALL_MG_LEVEL;
      level2_ = level2;
      callLeafElLevel2_ = true;
    } else {
      level2_ = -1;
      callLeafElLevel2_ = false;
    }

    // call standard traverse
    *elInfo1 = stack1.traverseFirst(mesh1, level1, flag1);
Naumann, Andreas's avatar
Naumann, Andreas committed
71
    while (*elInfo1 != NULL && skipEl1(*elInfo1)) {
72
      *elInfo1 = stack1.traverseNext(*elInfo1);
Naumann, Andreas's avatar
Naumann, Andreas committed
73
    }
74

75
    *elInfo2 = stack2.traverseFirst(mesh2, level2, flag2);
Naumann, Andreas's avatar
Naumann, Andreas committed
76
    while (*elInfo2 != NULL && skipEl2(*elInfo2)) {
77
      *elInfo2 = stack2.traverseNext(*elInfo2);
Naumann, Andreas's avatar
Naumann, Andreas committed
78
    }
79
 
80
    // finished ?
81
    if (*elInfo1 == NULL || *elInfo2 == NULL) {
82
      TEST_EXIT(*elInfo1 == *elInfo2)("invalid dual traverse\n");
83
84
85
      return false;
    }

86
    rest = 1.0;
87

88
    bool accepted = check(elInfo1, elInfo2, elInfoSmall, elInfoLarge);
89
90

    // check for non domain covering level traverse
91
92
93
94
95
96
97
    if (!accepted ||
	(level1_ != -1 && (*elInfo1)->getLevel() != level1_) ||
	(callLeafElLevel1_ && !(*elInfo1)->getElement()->isLeaf()) ||
	(level2_ != -1 && (*elInfo2)->getLevel() != level2_) ||
	(callLeafElLevel2_ && !(*elInfo2)->getElement()->isLeaf())) {
      return traverseNext(elInfo1, elInfo2, elInfoSmall, elInfoLarge);
    }
98

99
100
    fillSubElInfo(*elInfo1, *elInfo2, *elInfoSmall, *elInfoLarge);

101
102
103
    return true;
  }

104

105
106
107
108
109
  bool DualTraverse::traverseNext(ElInfo **elInfo1,
				  ElInfo **elInfo2,
				  ElInfo **elInfoSmall,
				  ElInfo **elInfoLarge)
  {
110
    FUNCNAME("DualTraverse::traverseNext()");
111
    // call standard traverse
112
113
114
115
116
117
118
119
120
121
    if (inc1) {
      do {
	*elInfo1 = stack1.traverseNext(*elInfo1);
      } while(*elInfo1 != NULL && skipEl1(*elInfo1));
    }
    if (inc2) {
      do {
	*elInfo2 = stack2.traverseNext(*elInfo2);
      } while (*elInfo2 != NULL && skipEl2(*elInfo2));
    }
Naumann, Andreas's avatar
Naumann, Andreas committed
122
123

    // finished ?
124
125
126
127
    if (*elInfo1 == NULL || *elInfo2 == NULL) {
      TEST_EXIT(*elInfo1 == *elInfo2)("invalid dual traverse\n");
      return false;
    }
128
129

    // finished ?
130
    if (*elInfo1 == NULL || *elInfo2 == NULL) {
131
      TEST_EXIT(*elInfo1 == *elInfo2)("invalid dual traverse\n");
132
133
134
      return false;
    }

135
    bool accepted = check(elInfo1, elInfo2, elInfoSmall, elInfoLarge);
136
137

    // check for non domain covering level traverse
138
139
140
141
142
143
144
    if (!accepted ||
	(level1_ != -1 && (*elInfo1)->getLevel() != level1_) ||
	(callLeafElLevel1_ && !(*elInfo1)->getElement()->isLeaf()) ||
	(level2_ != -1 && (*elInfo2)->getLevel() != level2_) ||
	(callLeafElLevel2_ && !(*elInfo2)->getElement()->isLeaf())) {
      return traverseNext(elInfo1, elInfo2, elInfoSmall, elInfoLarge);
    }
145
146
147

    fillSubElInfo(*elInfo1, *elInfo2, *elInfoSmall, *elInfoLarge);

148
149
150
    return true;
  }

151

152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
  void DualTraverse::prepareNextStep(ElInfo **elInfo1,
				     ElInfo **elInfo2,
				     ElInfo **elInfoSmall,
				     ElInfo **elInfoLarge)
  {
    // which is the smaller element ?
    *elInfoSmall = 
      (*elInfo1)->getLevel() > (*elInfo2)->getLevel() ?
      *elInfo1 :
      *elInfo2;
    *elInfoLarge = 
      (*elInfo1)->getLevel() <= (*elInfo2)->getLevel() ?
      *elInfo1 :
      *elInfo2;

    // update rest
168
    rest -= 1.0 / (1 << ((*elInfoSmall)->getLevel() - (*elInfoLarge)->getLevel()));
169

170
    if (rest < 1e-32) {
171
      // large element finished -> increment both elements
172
173
174
      rest = 1.0; 
      inc1 = true;
      inc2 = true;
175
176
    } else {
      // increment only small element
177
178
      inc1 = (*elInfo1 == *elInfoSmall) ? true : false;
      inc2 = (*elInfo2 == *elInfoSmall) ? true : false;
179
180
181
    }
  }

182

183
184
185
186
187
  void DualTraverse::fillSubElInfo(ElInfo *elInfo1, 
				   ElInfo *elInfo2,
				   ElInfo *elInfoSmall,
				   ElInfo *elInfoLarge)
  {
188
    if (!fillSubElemMat)
189
190
      return;

191
    if (elInfo1 == elInfoSmall)
192
      stack1.fillRefinementPath(*elInfoSmall, *elInfo2);
193
194
195
196
197
198
199
    else
      stack2.fillRefinementPath(*elInfoSmall, *elInfo1);    
  }


  int DualTraverse::getFace(DualElInfo *dualElInfo, int largeFace)
  {
200
    FUNCNAME_DBG("DualTraverse::getFace()");
201
202
203
204
205
206
207
208
209
210
211
212

    TEST_EXIT_DBG(dualElInfo)("No dual element info object!\n");

    ElInfo *largeElInfo = dualElInfo->largeElInfo;
    ElInfo *smallElInfo = dualElInfo->smallElInfo;

    TEST_EXIT_DBG(largeElInfo->getLevel() <= smallElInfo->getLevel())
      ("Should not happen!\n");

    if (largeElInfo->getLevel() == smallElInfo->getLevel())
      return largeFace;

213
    TEST_EXIT_DBG(smallElInfo->getRefinementPathLength() != 0)
214
215
216
      ("Refinement path is empty. This should not happen!\n");

    return -1;
217
  }
218
}