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 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240
|
/******************************** -*- C -*- ****************************
*
* sbrk-like behavior for separate mmap'ed regions
*
*
***********************************************************************/
/***********************************************************************
*
* Copyright 2000, 2001, 2002, 2003, 2006 Free Software Foundation, Inc.
* Written by Paolo Bonzini (redisorganization of GNU mmalloc).
*
* This file is part of GNU Smalltalk.
*
* GNU Smalltalk is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2, or (at your option) any later
* version.
*
* Linking GNU Smalltalk statically or dynamically with other modules is
* making a combined work based on GNU Smalltalk. Thus, the terms and
* conditions of the GNU General Public License cover the whole
* combination.
*
* In addition, as a special exception, the Free Software Foundation
* give you permission to combine GNU Smalltalk with free software
* programs or libraries that are released under the GNU LGPL and with
* independent programs running under the GNU Smalltalk virtual machine.
*
* You may copy and distribute such a system following the terms of the
* GNU GPL for GNU Smalltalk and the licenses of the other code
* concerned, provided that you include the source code of that other
* code when and as the GNU GPL requires distribution of source code.
*
* Note that people who make modified versions of GNU Smalltalk are not
* obligated to grant this special exception for their modified
* versions; it is their choice whether to do so. The GNU General
* Public License gives permission to release a modified version without
* this exception; this exception also makes it possible to release a
* modified version which carries forward this exception.
*
* GNU Smalltalk is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along with
* GNU Smalltalk; see the file COPYING. If not, write to the Free Software
* Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
***********************************************************************/
#include "gstpriv.h"
struct heap;
/* Internal structure that defines the format of the heap descriptor.
This gets written to the base address of the region that we are
managing. */
struct heap
{
size_t areasize;
/* The base address of the memory region for this malloc heap. This
is the location where the bookkeeping data for mmap and for malloc
begins. */
char *base;
/* The current location in the memory region for this malloc heap
which represents the end of memory in use. */
char *breakval;
/* The end of the current memory region for this malloc heap. This
is the first location past the end of mapped memory. */
char *top;
};
/* This is the internal function for heap_sbrk which receives a struct
heap instead of the pointer to the base location available to
clients. */
static PTR heap_sbrk_internal (struct heap *hdp,
int size);
/* Cache pagesize-1 for the current host machine. Note that if the
host does not readily provide a getpagesize() function, we need to
emulate it elsewhere, not clutter up this file with lots of kluges
to try to figure it out. */
static size_t pageround, pagesize;
#ifndef HAVE_GETPAGESIZE
extern int getpagesize ();
#endif
#define PAGE_ALIGN(addr) ((PTR) (((intptr_t)(addr) + pageround) & ~pageround))
/* We allocate extra pages for the heap descriptor and answer an
address that is HEAP_DELTA bytes past the actual beginning of the
allocation. */
#define HEAP_DELTA ((intptr_t) PAGE_ALIGN(sizeof (struct heap)))
heap
_gst_heap_create (PTR address, int size)
{
struct heap mtemp;
struct heap *hdp;
heap hd;
if (!pageround)
{
pagesize = getpagesize ();
pageround = pagesize - 1;
}
if (address)
address = (char *) address - HEAP_DELTA;
/* We start off with the heap descriptor allocated on the stack,
until we build it up enough to call heap_sbrk_internal() to
allocate the first page of the region and copy it there. Ensure
that it is zero'd and then initialize the fields that we know
values for. */
hdp = &mtemp;
memzero ((char *) hdp, sizeof (mtemp));
hdp->areasize = size;
hdp->base = _gst_osmem_reserve (address, size);
if (!hdp->base)
return NULL;
/* Now try to map in the first page, copy the heap descriptor
structure there, and arrange to return a pointer to this new copy.
If the mapping fails, then close the file descriptor if it was
opened by us, and arrange to return a NULL. */
hdp->top = hdp->breakval = hdp->base;
if ((hdp = heap_sbrk_internal (hdp, HEAP_DELTA)) != NULL)
{
hd = ((char *) hdp) + HEAP_DELTA;
memcpy (hdp, &mtemp, sizeof (mtemp));
}
else
{
hd = NULL;
_gst_osmem_release (hdp->base, hdp->areasize);
}
return hd;
}
heap
_gst_heap_destroy (heap hd)
{
struct heap mtemp;
assert (hd);
/* The heap descriptor that we are using is currently located in
region we are about to unmap, so we first make a local copy of
it on the stack and use the copy. */
mtemp = *(struct heap *) (hd - HEAP_DELTA);
/* Now unmap all the pages associated with this region by asking
for a negative increment equal to the current size of the
region. */
if ((heap_sbrk_internal (&mtemp, mtemp.base - mtemp.top)) == NULL)
/* Update the original heap descriptor with any changes */
*(struct heap *) (hd - HEAP_DELTA) = mtemp;
else
{
_gst_osmem_release (mtemp.base, mtemp.areasize);
hd = NULL;
}
return (hd);
}
PTR
_gst_heap_sbrk (heap hd,
size_t size)
{
struct heap *hdp;
assert (hd);
hdp = (struct heap *) (hd - HEAP_DELTA);
return heap_sbrk_internal (hdp, size);
}
PTR
heap_sbrk_internal (struct heap * hdp,
int size)
{
char *result = NULL;
size_t mapbytes; /* Number of bytes to map */
char *moveto; /* Address where we wish to move "break
value" to */
char *mapto; /* Address we actually mapped to */
if (size == 0)
/* Just return the current "break" value. */
result = hdp->breakval;
else if (size < 0)
{
/* We are deallocating memory. If the amount requested would
cause us to try to deallocate back past the base of the mmap'd
region then do nothing, and return NULL. Otherwise,
deallocate the memory and return the old break value. */
if (hdp->breakval + size >= hdp->base)
{
result = (PTR) hdp->breakval;
hdp->breakval += size;
moveto = PAGE_ALIGN (hdp->breakval);
_gst_osmem_decommit (moveto, (size_t) (hdp->top - moveto));
hdp->top = moveto;
}
}
else if (hdp->breakval + size > hdp->top)
{
moveto = PAGE_ALIGN (hdp->breakval + size);
mapbytes = moveto - hdp->top;
mapto = _gst_osmem_commit (hdp->top, mapbytes);
if (!mapto)
errno = ENOMEM;
else
{
hdp->top = moveto;
result = (PTR) hdp->breakval;
hdp->breakval += size;
}
}
else
{
result = (PTR) hdp->breakval;
hdp->breakval += size;
}
return (result);
}
|