PTR
zrealloc(PTR p, size_t old_size, size_t new_size)
{
register PTR q;
TRACE(("zrealloc %p %lu ->%lu\n", p, old_size, new_size));
if (new_size > (BlocksToBytes(POOLSZ)) &&
old_size > (BlocksToBytes(POOLSZ))) {
if (!(q = realloc(p, new_size))) {
out_of_mem();
}
FinishPtr(p, old_size);
RecordPtr(q, new_size);
#ifdef DEBUG_ZMALLOC
if (new_size > old_size) {
memset((char *) q + old_size, 0, new_size - old_size);
}
#endif
} else {
q = zmalloc(new_size);
memcpy(q, p, old_size < new_size ? old_size : new_size);
zfree(p, old_size);
}
return q;
}
PTR
zrealloc(PTR p, size_t old_size, size_t new_size)
{
register PTR q;
if (new_size > (BlocksToBytes(POOLSZ)) &&
old_size > (BlocksToBytes(POOLSZ))) {
if (!(q = realloc(p, new_size)))
out_of_mem();
} else {
q = zmalloc(new_size);
memcpy(q, p, old_size < new_size ? old_size : new_size);
zfree(p, old_size);
}
return q;
}
PTR
zmalloc(size_t size)
{
unsigned blocks = BytesToBlocks(size);
register ZBLOCK *p;
static unsigned amt_avail;
static ZBLOCK *avail;
if (blocks > POOLSZ) {
p = (ZBLOCK *) malloc((size_t) BlocksToBytes(blocks));
if (!p)
out_of_mem();
} else {
if ((p = pool[blocks - 1])) {
pool[blocks - 1] = p->link;
} else {
if (blocks > amt_avail) {
if (amt_avail != 0) /* free avail */
{
avail->link = pool[--amt_avail];
pool[amt_avail] = avail;
}
if (!(avail = (ZBLOCK *) malloc((size_t) (CHUNK * ZBLOCKSZ)))) {
/* if we get here, almost out of memory */
amt_avail = 0;
p = (ZBLOCK *) malloc((size_t) BlocksToBytes(blocks));
if (!p)
out_of_mem();
return (PTR) p;
} else
amt_avail = CHUNK;
}
/* get p from the avail pile */
p = avail;
avail += blocks;
amt_avail -= blocks;
}
}
return (PTR) p;
}
