Generated on Tue Apr 18 10:22:06 2017 for Gecode by doxygen 1.6.3

region.cpp

Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
00002 /*
00003  *  Main authors:
00004  *     Christian Schulte <schulte@gecode.org>
00005  *
00006  *  Copyright:
00007  *     Christian Schulte, 2008
00008  *
00009  *  Last modified:
00010  *     $Date: 2016-08-12 15:03:01 +0200 (Fri, 12 Aug 2016) $ by $Author: schulte $
00011  *     $Revision: 15150 $
00012  *
00013  *  This file is part of Gecode, the generic constraint
00014  *  development environment:
00015  *     http://www.gecode.org
00016  *
00017  *  Permission is hereby granted, free of charge, to any person obtaining
00018  *  a copy of this software and associated documentation files (the
00019  *  "Software"), to deal in the Software without restriction, including
00020  *  without limitation the rights to use, copy, modify, merge, publish,
00021  *  distribute, sublicense, and/or sell copies of the Software, and to
00022  *  permit persons to whom the Software is furnished to do so, subject to
00023  *  the following conditions:
00024  *
00025  *  The above copyright notice and this permission notice shall be
00026  *  included in all copies or substantial portions of the Software.
00027  *
00028  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00029  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00030  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00031  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00032  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00033  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00034  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00035  *
00036  */
00037 
00038 #include <gecode/kernel.hh>
00039 
00040 namespace Gecode {
00041 
00042   void*
00043   Region::heap_alloc(size_t s) {
00044     void* p = heap.ralloc(s);
00045     if (hi == NULL) {
00046       hi = p;
00047       assert(!Support::marked(hi));
00048     } else if (!Support::marked(hi)) {
00049       HeapInfo* h = static_cast<HeapInfo*>
00050         (heap.ralloc(sizeof(HeapInfo)+(4-1)*sizeof(void*)));
00051       h->n=2; h->size=4;
00052       h->blocks[0]=hi; h->blocks[1]=p;
00053       hi = Support::mark(h);
00054     } else {
00055       HeapInfo* h = static_cast<HeapInfo*>(Support::unmark(hi));
00056       if (h->n == h->size) {
00057         HeapInfo* n = static_cast<HeapInfo*>
00058           (heap.ralloc(sizeof(HeapInfo)+(2*h->n-1)*sizeof(void*)));
00059         n->size = 2*h->n;
00060         n->n = h->n;
00061         memcpy(&n->blocks[0], &h->blocks[0], h->n*sizeof(void*));
00062         hi = Support::mark(n);
00063         heap.rfree(h);
00064         h = n;
00065       }
00066       h->blocks[h->n++] = p;
00067     }
00068     return p;
00069   }
00070 
00071   void
00072   Region::heap_free(void) {
00073     assert(hi != NULL);
00074     if (Support::marked(hi)) {
00075       HeapInfo* h = static_cast<HeapInfo*>(Support::unmark(hi));
00076       for (unsigned int i=h->n; i--; )
00077         heap.rfree(h->blocks[i]);
00078       heap.rfree(h);
00079     } else {
00080       heap.rfree(hi);
00081     }
00082   }
00083 
00084 }
00085 
00086 // STATISTICS: kernel-memory