Generated on Sat Feb 7 2015 02:01:28 for Gecode by doxygen 1.8.9.1
region.cpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2008
8  *
9  * Last modified:
10  * $Date: 2013-02-20 18:27:38 +0100 (Wed, 20 Feb 2013) $ by $Author: schulte $
11  * $Revision: 13347 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include <gecode/kernel.hh>
39 
40 namespace Gecode {
41 
42  void*
43  Region::heap_alloc(size_t s) {
44  void* p = heap.ralloc(s);
45  if (hi == NULL) {
46  hi = p;
47  assert(!Support::marked(hi));
48  } else if (!Support::marked(hi)) {
49  HeapInfo* h = static_cast<HeapInfo*>
50  (heap.ralloc(sizeof(HeapInfo)+(4-1)*sizeof(void*)));
51  h->n=2; h->size=4;
52  h->blocks[0]=hi; h->blocks[1]=p;
53  hi = Support::mark(h);
54  } else {
55  HeapInfo* h = static_cast<HeapInfo*>(Support::unmark(hi));
56  if (h->n == h->size) {
57  HeapInfo* n = static_cast<HeapInfo*>
58  (heap.ralloc(sizeof(HeapInfo)+(2*h->n-1)*sizeof(void*)));
59  n->size = 2*h->n;
60  n->n = h->n;
61  memcpy(&n->blocks[0], &h->blocks[0], h->n*sizeof(void*));
62  hi = Support::mark(n);
63  h = n;
64  }
65  h->blocks[h->n++] = p;
66  }
67  return p;
68  }
69 
70  void
71  Region::heap_free(void) {
72  assert(hi != NULL);
73  if (Support::marked(hi)) {
74  HeapInfo* h = static_cast<HeapInfo*>(Support::unmark(hi));
75  for (unsigned int i=h->n; i--; )
76  heap.rfree(h->blocks[i]);
77  heap.rfree(h);
78  } else {
79  heap.rfree(hi);
80  }
81  }
82 
83 }
84 
85 // STATISTICS: kernel-memory
bool marked(void *p)
Check whether p is marked.
void rfree(void *p)
Free memory block starting at p.
Definition: heap.hpp:355
void * ralloc(size_t s)
Allocate s bytes from heap.
Definition: heap.hpp:341
void * mark(void *p)
Return marked pointer for p.
Heap heap
The single global heap.
Definition: heap.cpp:49
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:238
void * unmark(void *p)
Return unmarked pointer for a marked pointer p.
int n
Number of elements.
Definition: array.hpp:524
Gecode toplevel namespace