MINSIZE
if (h->size < MINSIZE)
h->size = MINSIZE;
if (ns < MINSIZE)
ns = MINSIZE;
#ifndef MINSIZE
if (kval < (blkcnt_t)MINSIZE) {
").\n"), (ulong_t)MINSIZE, kval);
static TREE *List[MINSIZE/WORDSIZE-1]; /* lists of small blocks */
ASSERT((size + WORDSIZE) * NPS >= MINSIZE);
} else if (size >= MINSIZE && n > size) {
if (size < MINSIZE)
if ((n = (SIZE(sp) - size)) >= MINSIZE + WORDSIZE) {
if (size < MINSIZE || SIZE(tp) < MINSIZE) {
ASSERT(SIZE(np) >= MINSIZE);
if ((n = (SIZE(tp) - size)) >= MINSIZE + WORDSIZE) {
if (SIZE(tp) < MINSIZE) {
} else if (size < MINSIZE) { /* case 2. */
size = MINSIZE;
} else if (size < MINSIZE) { /* case 3. */
size = MINSIZE;
if (SIZE(tp) < MINSIZE) {
if (nbytes < MINSIZE)
nbytes = MINSIZE;
while (align < MINSIZE + WORDSIZE)
reqsize = nbytes + align + (MINSIZE + WORDSIZE);
if (frag_size < MINSIZE + WORDSIZE) {
if (frag_size >= MINSIZE + WORDSIZE) {
size = (size_t)MINSIZE << bucketnum;
if (size-- <= MINSIZE)
size = (size_t)MINSIZE << bucketnum;
size = (size_t)MINSIZE << bucketnum;
size = (size_t)MINSIZE << getbucketnum(size + sizeof (*ptr));
size = (size_t)MINSIZE << getbucketnum(size + sizeof (*ptr));
static long requestsize = MINSIZE; /* 9 pages per cache; tunable; 9 is min */
if (value >= MINSIZE && value <= MAXSIZE)
static TREE *List[MINSIZE/WORDSIZE-1];
static TREE *Last[MINSIZE/WORDSIZE-1];
if (nbytes < MINSIZE)
nbytes = MINSIZE;
while (align < MINSIZE + WORDSIZE)
reqsize = nbytes + align + (MINSIZE + WORDSIZE);
if (frag_size < MINSIZE + WORDSIZE) {
if (frag_size >= MINSIZE + WORDSIZE) {
ASSERT((size + WORDSIZE) * NPS >= MINSIZE);
if (size < MINSIZE)
if ((n = (SIZE(sp) - size)) >= MINSIZE + WORDSIZE) {
if (size < MINSIZE || SIZE(tp) < MINSIZE) {
ASSERT(SIZE(np) >= MINSIZE);
if ((n = (SIZE(tp) - size)) >= MINSIZE + WORDSIZE) {
if (SIZE(tp) < MINSIZE) {
} else if (size < MINSIZE) /* case 2. */ {
size = MINSIZE;
} else if (size < MINSIZE) /* case 3. */ {
size = MINSIZE;
if (SIZE(tp) < MINSIZE) {