DOFAdmin.cc 9.64 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
#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;

  void DOFAdmin::init()
  {
    firstHole = size = usedCount = holeCount = sizeUsed = 0;
    dofFree.clear();
  }


  DOFAdmin::DOFAdmin(Mesh* m) 
    : mesh(m), 
      nrDOF(mesh->getDim(), NO_INIT),
      nr0DOF(mesh->getDim(), NO_INIT)
Thomas Witkowski's avatar
Thomas Witkowski committed
29 30 31
  { 
    init(); 
  }
32

33
  DOFAdmin::DOFAdmin(Mesh* m,std::string aName) 
34 35 36 37 38 39 40 41 42 43
    : name(aName), 
      mesh(m), 
      nrDOF(mesh->getDim(), NO_INIT),
      nr0DOF(mesh->getDim(), NO_INIT)
  { 
    init(); 
  }

  DOFAdmin& DOFAdmin::operator=(const DOFAdmin& src) 
  {
44 45 46 47 48 49 50 51 52 53 54
    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];
55
      };
56 57
      dofIndexedList = src.dofIndexedList;
      dofContainerList = src.dofContainerList;
58 59 60 61 62 63 64 65 66 67
    }
    return *this;
  }
  /****************************************************************************/
  /*      use a bit vector to indicate used/unused dofs			    */
  /*      storage needed: one bit per dof                     		    */
  /****************************************************************************/

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

73 74 75 76 77 78 79 80
    return true;
  }


  DOFAdmin::DOFAdmin(const DOFAdmin&)
  {}

  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 187
    FUNCNAME("DOFAdmin::addDOFIndexed()");
    TEST_EXIT_DBG(dofIndexed)("no dofIndexed\n");
188

189
    if (dofIndexed->getSize() < size) {
190 191
      dofIndexed->resize(size);
    }
192

193 194 195 196 197
    dofIndexedList.push_back(dofIndexed);
  }

  void DOFAdmin::removeDOFIndexed(DOFIndexedBase* dofIndexed)
  {
198 199
    FUNCNAME("DOFAdmin::removeDOFIndexed()");

200 201
    std::list<DOFIndexedBase*>::iterator it;
    std::list<DOFIndexedBase*>::iterator end = dofIndexedList.end();
202 203
    for (it = dofIndexedList.begin(); it != end; ++it) {
      if (*it == dofIndexed) {
204 205 206 207
	dofIndexedList.erase(it);
	return;
      }
    }
208

209 210 211 212 213
    ERROR("DOFIndexed not in list\n");
  }

  void DOFAdmin::addDOFContainer(DOFContainer* cont)
  {
214
    FUNCNAME("DOFAdmin::addDOFContainer()");
215
    TEST_EXIT_DBG(cont)("no container\n");
216 217 218 219 220
    dofContainerList.push_back(cont);  
  }

  void DOFAdmin::removeDOFContainer(DOFContainer* cont)
  {
221 222
    FUNCNAME("DOFAdmin::removeDOFContainer()");

223 224
    std::list<DOFContainer*>::iterator it;
    std::list<DOFContainer*>::iterator end = dofContainerList.end();
225 226
    for (it = dofContainerList.begin(); it != end; ++it) {
      if (*it == cont) {
227 228 229 230 231 232 233 234 235 236
	dofContainerList.erase(it);
	return;
      }
    }
    ERROR("container not in list\n");
  }


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

237
  void DOFAdmin::compress(std::vector<DegreeOfFreedom> &new_dof)
238
  {
239
    FUNCNAME("DOFAdmin::compress()");
240 241 242 243 244 245 246

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

    // vector to mark used dofs
247
    for (int i = 0; i < size; i++) {
248 249 250 251 252
      new_dof[i] = -1;
    }

    // mark used dofs
    DOFIteratorBase it(this, USED_DOFS);
253 254 255
    for (it.reset(); !it.end(); ++it) {
      new_dof[it.getDOFIndex()] = 1;
    }
256
  
257 258
    int n = 0, last = 0;
    for (int i = 0; i < size; i++) {             /* create a MONOTONE compress */
259 260 261 262 263 264
      if (new_dof[i] == 1) {
	new_dof[i] = n++;
	last = i;
      }
    }
  
265
    TEST_EXIT_DBG(n == usedCount)("count %d != usedCount %d\n", n, usedCount);
266 267
  
    // mark used dofs in compressed dofFree
268
    for (int i = 0; i < n; i++) {
269 270 271
      dofFree[i] = false;
    }
    // mark unused dofs in compressed dofFree
272
    for (int i = n; i < size; i++) {
273 274 275 276 277 278 279 280
      dofFree[i] = true;
    }

    firstHole = n;  
    holeCount = 0;
    sizeUsed  = n;
  
    // get index of first changed dof
281 282
    int first = last;
    for (int i = 0; i<size; i++) {
283 284 285 286 287 288
      if ((new_dof[i] < i) && (new_dof[i] >= 0)) {
	first = i;
	break;
      }
    }

289 290 291
    std::list<DOFIndexedBase*>::iterator di;
    std::list<DOFIndexedBase*>::iterator end = dofIndexedList.end();
    for (di = dofIndexedList.begin(); di != end; ++di) {
292 293 294 295
      (*di)->compressDOFIndexed(first, last, new_dof);
    };

  
296 297 298
    std::list<DOFContainer*>::iterator dc;
    std::list<DOFContainer*>::iterator endc = dofContainerList.end();
    for (dc = dofContainerList.begin(); dc != endc; dc++) {
299 300 301 302 303 304 305
      (*dc)->compressDOFContainer(n, new_dof);
    };  

    return;
  }

  void DOFAdmin::setNumberOfDOFs(int i,int v) { 
306
    TEST_EXIT_DBG((0 <= i) && (4 > i))("");
307 308

    nrDOF[i] = v; 
309 310 311
  }

  void DOFAdmin::setNumberOfPreDOFs(int i, int v) { 
312
    TEST_EXIT_DBG((0 <= i) && (4 > i))(""); 
313 314

    nr0DOF[i] = v; 
315 316 317
  }

  DOFAdmin::~DOFAdmin()
318
  {}
319

320
  void DOFAdmin::serialize(std::ostream &out) 
321 322
  {
    // write name
Thomas Witkowski's avatar
Thomas Witkowski committed
323
    out << name << "\n";
324 325 326 327

    // write dofFree
    int s = static_cast<int>(dofFree.size());
    out.write(reinterpret_cast<const char*>(&s), sizeof(int));
328
    for (int i = 0; i < s; i++) {
329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354
      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);
}

355
  void DOFAdmin::deserialize(std::istream &in)
356 357 358 359 360 361 362 363 364
  {
    // read name
    in >> name;
    in.get();

    // read dofFree
    int s;
    in.read(reinterpret_cast<char*>(&s), sizeof(int));
    dofFree.resize(s);
365
    for (int i = 0; i < s; i++) {
366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391
      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);

392 393
    std::list<DOFIndexedBase*>::iterator di;
    std::list<DOFIndexedBase*>::iterator end = dofIndexedList.end();
394

395
    for (di = dofIndexedList.begin(); di != end; ++di) {
396 397 398 399 400
      (*di)->resize(size);
    }
  }

}