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 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293
|
/* big-objects.c
*
* COPYRIGHT (c) 1993 by AT&T Bell Laboratories.
*
* Code for managing big-object regions.
*/
#include "ml-base.h"
#include "memory.h"
#include "heap.h"
#include "heap-monitor.h"
#include <string.h>
#ifdef BO_DEBUG
/* PrintRegionMap:
*/
void PrintRegionMap (bigobj_region_t *r)
{
bigobj_desc_t *dp, *dq;
int i;
SayDebug ("[%d] %d/%d, @%#x: ", r->minGen, r->nFree, r->nPages, r->firstPage);
for (i = 0, dq = NIL(bigobj_desc_t *); i < r->nPages; i++) {
dp = r->objMap[i];
if (dp != dq) {
SayDebug ("|");
dq = dp;
}
if (BO_IS_FREE(dp))
SayDebug ("_");
else
SayDebug ("X");
}
SayDebug ("|\n");
} /* end of PrintRegionMap */
#endif
/* BO_AllocRegion:
*
* Allocate a big object region that is large enough to hold an object of at
* least szB bytes. It returns the descriptor for the free big-object that
* is the region.
* NOTE: it does not mark the BIBOP entries for the region; this should be
* done by the caller.
*/
bigobj_desc_t *BO_AllocRegion (heap_t *heap, Addr_t szB)
{
int npages, oldNpages, i;
Addr_t hdrSzB, memObjSzB;
bigobj_region_t *region;
mem_obj_t *memObj;
bigobj_desc_t *desc;
/* compute the memory object size.
* NOTE: there probably is a closed form for this, but I'm too lazy
* to try to figure it out.
*/
npages = ROUNDUP(szB, BIGOBJ_PAGE_SZB) >> BIGOBJ_PAGE_SHIFT;
do {
oldNpages = npages;
hdrSzB = ROUNDUP(BOREGION_HDR_SZB(npages), BIGOBJ_PAGE_SZB);
szB = (npages << BIGOBJ_PAGE_SHIFT);
memObjSzB = RND_MEMOBJ_SZB(hdrSzB+szB);
memObjSzB = (memObjSzB < MIN_BOREGION_SZB) ? MIN_BOREGION_SZB : memObjSzB;
npages = (memObjSzB - hdrSzB) >> BIGOBJ_PAGE_SHIFT;
} while (npages != oldNpages);
if ((memObj = MEM_AllocMemObj (memObjSzB)) == NIL(mem_obj_t *))
Die ("unable to allocate memory object for bigobject region");
region = (bigobj_region_t *)MEMOBJ_BASE(memObj);
if ((desc = NEW_OBJ(bigobj_desc_t)) == NIL(bigobj_desc_t *))
Die ("unable to allocate big-object descriptor");
/* initialize the region header */
region->firstPage = ((Addr_t)region + hdrSzB);
region->nPages = npages;
region->nFree = npages;
region->minGen = MAX_NUM_GENS;
region->memObj = memObj;
region->next = heap->bigRegions;
heap->bigRegions = region;
heap->numBORegions++;
for (i = 0; i < npages; i++)
region->objMap[i] = desc;
/* initialize the descriptor for the region's memory */
desc->obj = region->firstPage;
desc->sizeB = szB;
desc->state = BO_FREE;
desc->region = region;
#ifdef BO_DEBUG
SayDebug ("BO_AllocRegion: %d pages @ %#x\n", npages, region->firstPage);
#endif
return desc;
} /* end of BO_AllocRegion */
/* BO_Alloc:
*
* Allocate a big object of the given size.
*/
bigobj_desc_t *BO_Alloc (heap_t *heap, int gen, Addr_t objSzB)
{
bigobj_desc_t *hdr, *dp, *newObj;
bigobj_region_t *region;
Addr_t totSzB;
int i, npages, firstPage;
totSzB = ROUNDUP(objSzB, BIGOBJ_PAGE_SZB);
npages = (totSzB >> BIGOBJ_PAGE_SHIFT);
/* search for a free object that is big enough (first-fit) */
hdr = heap->freeBigObjs;
for (dp = hdr->next; (dp != hdr) && (dp->sizeB < totSzB); dp = dp->next)
continue;
if (dp == hdr) {
/* no free object fits, so allocate a new region */
dp = BO_AllocRegion (heap, totSzB);
region = dp->region;
if (dp->sizeB == totSzB)
/* allocate the whole region to the object */
newObj = dp;
else {
/* split the free object */
newObj = NEW_OBJ(bigobj_desc_t);
newObj->obj = dp->obj;
newObj->region = region;
dp->obj = (Addr_t)(dp->obj) + totSzB;
dp->sizeB -= totSzB;
ADD_BODESC(heap->freeBigObjs, dp);
firstPage = ADDR_TO_BOPAGE(region, newObj->obj);
for (i = 0; i < npages; i++)
region->objMap[firstPage+i] = newObj;
}
}
else if (dp->sizeB == totSzB) {
REMOVE_BODESC(dp);
newObj = dp;
region = dp->region;
}
else {
/* split the free object, leaving dp in the free list. */
region = dp->region;
newObj = NEW_OBJ(bigobj_desc_t);
newObj->obj = dp->obj;
newObj->region = region;
dp->obj = (Addr_t)(dp->obj) + totSzB;
dp->sizeB -= totSzB;
firstPage = ADDR_TO_BOPAGE(region, newObj->obj);
for (i = 0; i < npages; i++)
dp->region->objMap[firstPage+i] = newObj;
}
newObj->sizeB = objSzB;
newObj->state = BO_YOUNG;
newObj->gen = gen;
region->nFree -= npages;
if (region->minGen > gen) {
/* update the generation part of the descriptor */
region->minGen = gen;
MarkRegion (BIBOP, (ml_val_t *)region, MEMOBJ_SZB(region->memObj),
AID_BIGOBJ(gen));
BIBOP[BIBOP_ADDR_TO_INDEX(region)] = AID_BIGOBJ_HDR(gen);
}
#ifdef BO_DEBUG
SayDebug ("BO_Alloc: %d bytes @ %#x\n", objSzB, newObj->obj);
PrintRegionMap(region);
#endif
return newObj;
} /* end of BO_Alloc */
/* BO_Free:
*
* Mark a big object as free and add it to the free list.
*/
void BO_Free (heap_t *heap, bigobj_desc_t *desc)
{
bigobj_region_t *region = desc->region;
bigobj_desc_t *dp;
int firstPage, lastPage, i, j;
Addr_t totSzB = ROUNDUP(desc->sizeB, BIGOBJ_PAGE_SZB);
firstPage = ADDR_TO_BOPAGE(region, desc->obj);
lastPage = firstPage + (totSzB >> BIGOBJ_PAGE_SHIFT);
#ifdef BO_DEBUG
SayDebug ("BO_Free: @ %#x, bibop gen = %x, gen = %d, state = %d, pages=[%d..%d)\n",
desc->obj, (unsigned)EXTRACT_GEN(ADDR_TO_PAGEID(BIBOP, desc->obj)), desc->gen, desc->state, firstPage, lastPage);
PrintRegionMap(region);
#endif
if ((firstPage > 0) && BO_IS_FREE(region->objMap[firstPage-1])) {
/* coalesce with adjacent free object */
dp = region->objMap[firstPage-1];
REMOVE_BODESC(dp);
for (i = ADDR_TO_BOPAGE(region, dp->obj); i < firstPage; i++)
region->objMap[i] = desc;
desc->obj = dp->obj;
totSzB += dp->sizeB;
FREE (dp);
}
if ((lastPage < region->nPages) && BO_IS_FREE(region->objMap[lastPage])) {
/* coalesce with adjacent free object */
dp = region->objMap[lastPage];
REMOVE_BODESC(dp);
for (i = lastPage, j = i+(dp->sizeB >> BIGOBJ_PAGE_SHIFT); i < j; i++)
region->objMap[i] = desc;
totSzB += dp->sizeB;
FREE (dp);
}
desc->sizeB = totSzB;
desc->state = BO_FREE;
region->nFree += (lastPage - firstPage);
/** what if (region->nFree == region->nPages) ??? **/
/* add desc to the free list */
ADD_BODESC(heap->freeBigObjs, desc);
} /* end of BO_Free */
/* BO_GetDesc:
*
* Given an address into a big object, return the object's descriptor.
*/
bigobj_desc_t *BO_GetDesc (ml_val_t addr)
{
bibop_t bibop = BIBOP;
int i;
aid_t aid;
bigobj_region_t *rp;
for (i = BIBOP_ADDR_TO_INDEX(addr); !BO_IS_HDR(aid = bibop[i]); i--)
continue;
rp = (bigobj_region_t *)BIBOP_INDEX_TO_ADDR(i);
return ADDR_TO_BODESC(rp, addr);
} /* end of BO_GetDesc */
/* BO_AddrToCodeObjTag:
*
* Return the tag of the code object containing the given PC (or else
* NIL).
*/
char *BO_AddrToCodeObjTag (Word_t pc)
{
bigobj_region_t *region;
aid_t aid;
aid = ADDR_TO_PAGEID(BIBOP, pc);
if (IS_BIGOBJ_AID(aid)) {
int indx = BIBOP_ADDR_TO_INDEX(pc);
while (!BO_IS_HDR(aid))
aid = BIBOP[--indx];
region = (bigobj_region_t *)BIBOP_INDEX_TO_ADDR(indx);
return BO_GetCodeObjTag (ADDR_TO_BODESC(region, pc));
}
else
return NIL(char *);
} /* end of BO_AddrToCodeObjTag */
/* BO_GetCodeObjTag:
*
* Return the tag of the given code object.
*/
char *BO_GetCodeObjTag (bigobj_desc_t *bdp)
{
Byte_t *lastByte;
int kx;
lastByte = (Byte_t *)(bdp->obj) + bdp->sizeB - 1;
kx = *lastByte * WORD_SZB;
return lastByte - kx + 1;
} /* end of BO_GetCodeObjTag */
|