DOFAdmin.cc 9.85 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <algorithm>

#include "QPsiPhi.h"
#include "BasisFunction.h"
#include "Boundary.h"
#include "DOFAdmin.h"
#include "ElInfo.h"
#include "Error.h"
#include "FiniteElemSpace.h"
#include "Mesh.h"
#include "DOFVector.h"
#include "DOFIterator.h"

namespace AMDiS {

  const int DOFAdmin::sizeIncrement = 10;

  DOFAdmin::DOFAdmin(Mesh* m) 
    : mesh(m), 
      nrDOF(mesh->getDim(), NO_INIT),
      nr0DOF(mesh->getDim(), NO_INIT)
Thomas Witkowski's avatar
Thomas Witkowski committed
22
23
24
  { 
    init(); 
  }
25

26
  DOFAdmin::DOFAdmin(Mesh* m,std::string aName) 
27
28
29
30
31
32
33
34
    : name(aName), 
      mesh(m), 
      nrDOF(mesh->getDim(), NO_INIT),
      nr0DOF(mesh->getDim(), NO_INIT)
  { 
    init(); 
  }

35
36
37
38
39
40
  void DOFAdmin::init()
  {
    firstHole = size = usedCount = holeCount = sizeUsed = 0;
    dofFree.clear();
  }

41
42
  DOFAdmin& DOFAdmin::operator=(const DOFAdmin& src) 
  {
43
44
45
46
47
48
49
50
51
52
53
    if (this != &src) { 
      mesh = src.mesh;
      name = src.name;
      dofFree = src.dofFree;
      firstHole = src.firstHole;
      size = src.size;
      usedCount = src.usedCount;
      holeCount = src.holeCount;
      sizeUsed = src.sizeUsed;
      for (int i = 0; i < 4; nrDOF[i] = src.nrDOF[i++]) {
	nr0DOF[i] = src.nr0DOF[i];
54
      };
55
56
      dofIndexedList = src.dofIndexedList;
      dofContainerList = src.dofContainerList;
57
58
59
60
61
62
63
64
65
66
    }
    return *this;
  }
  /****************************************************************************/
  /*      use a bit vector to indicate used/unused dofs			    */
  /*      storage needed: one bit per dof                     		    */
  /****************************************************************************/

  bool DOFAdmin::operator==(const DOFAdmin& ad) const
  {
67
68
69
70
71
    if (name != ad.name) 
      return false;
    if (mesh != ad.mesh) 
      return false;

72
73
74
75
76
    return true;
  }


  DOFAdmin::DOFAdmin(const DOFAdmin&)
77
78
  {
  }
79
80

  void DOFAdmin::freeDOFIndex(int dof) {
81
    FUNCNAME("DOFAdmin::freeDOFIndex()");
82

83
84
    TEST_EXIT_DBG(usedCount > 0)("no dofs in use\n");
    TEST_EXIT_DBG((dof >= 0) && (dof < size))("invalid dof index %d\n",dof);
85

86
87
    std::list<DOFIndexedBase*>::iterator di;
    std::list<DOFIndexedBase*>::iterator end = dofIndexedList.end();
88

89
    for (di = dofIndexedList.begin(); di != end; ++di) {
90
91
92
      (*di)->freeDOFContent(dof);
    }

93
94
    std::list<DOFContainer*>::iterator dc;
    std::list<DOFContainer*>::iterator dcend = dofContainerList.end();
95

96
    for (dc = dofContainerList.begin(); dc != dcend; ++dc) {
97
98
99
100
101
      (*dc)->freeDOFIndex(dof);
    }

    dofFree[dof] = true;

102
103
    if (static_cast<int>(firstHole) > dof) 
      firstHole = dof;
104
105
106
107
108
109
110
111
112

    usedCount--;
    holeCount++;
  }

  /****************************************************************************/

  int DOFAdmin::getDOFIndex()
  {
113
    FUNCNAME("DOFAdmin::getDOFIndex()");
114
    int dof = 0;
115
116
117

    // if there is a hole
    if (firstHole < static_cast<int>(dofFree.size())) {
118
      TEST_EXIT_DBG(dofFree[firstHole])("no hole at firstHole!\n");
119
120
121
122
123
      // its no longer a hole
      dofFree[firstHole] = false;
      dof = firstHole;
      // search new hole
      int dfsize = static_cast<int>(dofFree.size());
124
125
      int i = firstHole + 1;
      for (; i < dfsize; i++) {
126
127
128
129
130
	if (dofFree[i]) {
	  break;
	}
      }
      firstHole = i;
131
    } else {                    // if there is no hole
132
133
      // enlarge dof-list
      enlargeDOFLists(0);
134
      TEST_EXIT_DBG(firstHole < static_cast<int>(dofFree.size()))
135
	("no free entry after enlargeDOFLists\n");
136
      TEST_EXIT_DBG(dofFree[firstHole])
137
138
139
140
141
142
143
	("no free bit at firstHole\n");
      dofFree[firstHole] = false;
      dof = firstHole;
      firstHole++;
    }

    usedCount++;
144
145
146
    if (holeCount > 0) 
      holeCount--;
    sizeUsed = max(sizeUsed, dof + 1);
147
148
149
150
151
152
153
154
155

    return(dof);
  }


  /****************************************************************************/

  void DOFAdmin::enlargeDOFLists(int minsize)
  {
156
    FUNCNAME("DOFAdmin::enlargeDOFLists()");
157
  
158
    int old = size;
159
160
161
162
    if (minsize > 0) {
      if (old > minsize) return;
    }
  
163
    int newval = max(minsize, static_cast<int>((dofFree.size() + sizeIncrement)));
164
165
166
167
168
169
170
171
172
173
174

    size = newval;
  
    // stl resizes dofFree to at least newval and sets all new values true
    dofFree.resize(newval, true);

    firstHole = old;
  
    // enlarge all vectors and matrices
    // but DOFVectors<int> don't have to be changed
  
175
176
    std::list<DOFIndexedBase*>::iterator di;
    std::list<DOFIndexedBase*>::iterator end = dofIndexedList.end();
177

178
179
    for (di = dofIndexedList.begin(); di != end; ++di) {
      if ((*di)->getSize() < newval) {
180
181
182
183
184
185
	(*di)->resize(newval);
      }
    }
  }

  void DOFAdmin::addDOFIndexed(DOFIndexedBase* dofIndexed) {
186
    FUNCNAME("DOFAdmin::addDOFIndexed()");
187

188
    TEST_EXIT(dofIndexed)("no dofIndexed\n");
189

190
191
192
193
194
195
196
197
198
199
#ifdef _OPENMP
#pragma omp critical (dofIndexAccess)
#endif
    {
      if (dofIndexed->getSize() < size) {
	dofIndexed->resize(size);
      }
      
      dofIndexedList.push_back(dofIndexed);
    }
200
201
202
203
  }

  void DOFAdmin::removeDOFIndexed(DOFIndexedBase* dofIndexed)
  {
204
205
    FUNCNAME("DOFAdmin::removeDOFIndexed()");

206
207
208
209
210
211
212
213
214
215
216
217
218
    bool removed = false;
#ifdef _OPENMP
#pragma omp critical (dofIndexAccess)
#endif
    {
      std::list<DOFIndexedBase*>::iterator it;
      std::list<DOFIndexedBase*>::iterator end = dofIndexedList.end();
      for (it = dofIndexedList.begin(); it != end; ++it) {
	if (*it == dofIndexed) {
	  dofIndexedList.erase(it);
	  removed = true;
	  break;
	}
219
220
      }
    }
221

222
    TEST_EXIT(removed)("DOFIndexed not in list\n");
223
224
225
226
  }

  void DOFAdmin::addDOFContainer(DOFContainer* cont)
  {
227
    FUNCNAME("DOFAdmin::addDOFContainer()");
228
    TEST_EXIT_DBG(cont)("no container\n");
229
230
231
232
233
    dofContainerList.push_back(cont);  
  }

  void DOFAdmin::removeDOFContainer(DOFContainer* cont)
  {
234
235
    FUNCNAME("DOFAdmin::removeDOFContainer()");

236
237
    std::list<DOFContainer*>::iterator it;
    std::list<DOFContainer*>::iterator end = dofContainerList.end();
238
239
    for (it = dofContainerList.begin(); it != end; ++it) {
      if (*it == cont) {
240
241
242
243
244
245
246
247
248
249
	dofContainerList.erase(it);
	return;
      }
    }
    ERROR("container not in list\n");
  }


  /****************************************************************************/

250
  void DOFAdmin::compress(std::vector<DegreeOfFreedom> &new_dof)
251
  {
252
    FUNCNAME("DOFAdmin::compress()");
253
254
255
256
257
258
259

    // nothing to do ?
    if (size < 1) return;
    if (usedCount < 1) return;
    if (holeCount < 1) return;

    // vector to mark used dofs
260
    for (int i = 0; i < size; i++) {
261
262
263
264
265
      new_dof[i] = -1;
    }

    // mark used dofs
    DOFIteratorBase it(this, USED_DOFS);
266
267
268
    for (it.reset(); !it.end(); ++it) {
      new_dof[it.getDOFIndex()] = 1;
    }
269
  
270
271
    int n = 0, last = 0;
    for (int i = 0; i < size; i++) {             /* create a MONOTONE compress */
272
273
274
275
276
277
      if (new_dof[i] == 1) {
	new_dof[i] = n++;
	last = i;
      }
    }
  
278
    TEST_EXIT_DBG(n == usedCount)("count %d != usedCount %d\n", n, usedCount);
279
280
  
    // mark used dofs in compressed dofFree
281
    for (int i = 0; i < n; i++) {
282
283
284
      dofFree[i] = false;
    }
    // mark unused dofs in compressed dofFree
285
    for (int i = n; i < size; i++) {
286
287
288
289
290
291
292
293
      dofFree[i] = true;
    }

    firstHole = n;  
    holeCount = 0;
    sizeUsed  = n;
  
    // get index of first changed dof
294
295
    int first = last;
    for (int i = 0; i<size; i++) {
296
297
298
299
300
301
      if ((new_dof[i] < i) && (new_dof[i] >= 0)) {
	first = i;
	break;
      }
    }

302
303
304
    std::list<DOFIndexedBase*>::iterator di;
    std::list<DOFIndexedBase*>::iterator end = dofIndexedList.end();
    for (di = dofIndexedList.begin(); di != end; ++di) {
305
306
307
308
      (*di)->compressDOFIndexed(first, last, new_dof);
    };

  
309
310
311
    std::list<DOFContainer*>::iterator dc;
    std::list<DOFContainer*>::iterator endc = dofContainerList.end();
    for (dc = dofContainerList.begin(); dc != endc; dc++) {
312
313
314
315
316
317
318
      (*dc)->compressDOFContainer(n, new_dof);
    };  

    return;
  }

  void DOFAdmin::setNumberOfDOFs(int i,int v) { 
319
    TEST_EXIT_DBG((0 <= i) && (4 > i))("");
320
321

    nrDOF[i] = v; 
322
323
324
  }

  void DOFAdmin::setNumberOfPreDOFs(int i, int v) { 
325
    TEST_EXIT_DBG((0 <= i) && (4 > i))(""); 
326
327

    nr0DOF[i] = v; 
328
329
330
  }

  DOFAdmin::~DOFAdmin()
331
332
  {
  }
333

334
  void DOFAdmin::serialize(std::ostream &out) 
335
336
  {
    // write name
Thomas Witkowski's avatar
Thomas Witkowski committed
337
    out << name << "\n";
338
339
340
341

    // write dofFree
    int s = static_cast<int>(dofFree.size());
    out.write(reinterpret_cast<const char*>(&s), sizeof(int));
342
    for (int i = 0; i < s; i++) {
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
      bool free = dofFree[i];
      out.write(reinterpret_cast<const char*>(&free), sizeof(bool));
    }

    // write firstHole
    out.write(reinterpret_cast<const char*>(&firstHole), sizeof(unsigned int));

    // write size
    out.write(reinterpret_cast<const char*>(&size), sizeof(int));

    // write usedCount
    out.write(reinterpret_cast<const char*>(&usedCount), sizeof(int));

    // write holeCount
    out.write(reinterpret_cast<const char*>(&holeCount), sizeof(int));

    // write sizeUsed
    out.write(reinterpret_cast<const char*>(&sizeUsed), sizeof(int));

    // write nrDOF
    nrDOF.serialize(out);

    // write nr0DOF
    nr0DOF.serialize(out);
}

369
  void DOFAdmin::deserialize(std::istream &in)
370
371
372
373
374
375
376
377
378
  {
    // read name
    in >> name;
    in.get();

    // read dofFree
    int s;
    in.read(reinterpret_cast<char*>(&s), sizeof(int));
    dofFree.resize(s);
379
    for (int i = 0; i < s; i++) {
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
      bool free;
      in.read(reinterpret_cast<char*>(&free), sizeof(bool));
      dofFree[i] = free;
    }

    // read firstHole
    in.read(reinterpret_cast<char*>(&firstHole), sizeof(unsigned int));

    // read size
    in.read(reinterpret_cast<char*>(&size), sizeof(int));

    // read usedCount
    in.read(reinterpret_cast<char*>(&usedCount), sizeof(int));

    // read holeCount
    in.read(reinterpret_cast<char*>(&holeCount), sizeof(int));

    // read sizeUsed
    in.read(reinterpret_cast<char*>(&sizeUsed), sizeof(int));

    // read nrDOF
    nrDOF.deserialize(in);

    // read nr0DOF
    nr0DOF.deserialize(in);

406
407
    std::list<DOFIndexedBase*>::iterator di;
    std::list<DOFIndexedBase*>::iterator end = dofIndexedList.end();
408

409
    for (di = dofIndexedList.begin(); di != end; ++di) {
410
411
412
413
414
      (*di)->resize(size);
    }
  }

}