Lines Matching defs:MINSIZE

1680         MINSIZE bytes long, it is replenished.
1705 #define MINSIZE ((MIN_CHUNK_SIZE+MALLOC_ALIGN_MASK) & ~MALLOC_ALIGN_MASK)
1725 (((req) + SIZE_SZ + MALLOC_ALIGN_MASK < MINSIZE) ? \
1726 MINSIZE : \
2317 /* top size is always at least MINSIZE */
2318 assert((long)(sz) >= (long)(MINSIZE));
2367 if ((unsigned long)sz >= (unsigned long)MINSIZE)
2421 assert(chunksize(next) >= MINSIZE);
2445 assert((long)sz - (long)MINSIZE >= 0);
2447 assert((long)sz - (long)(s + MINSIZE) < 0);
2572 q != av->top && inuse(q) && (long)(chunksize(q)) >= (long)MINSIZE;
2721 at least MINSIZE and to have prev_inuse set.
2725 ((unsigned long) (old_size) >= (unsigned long)(MINSIZE) &&
2731 size = nb + av->top_pad + MINSIZE;
2941 old_size was previously MINSIZE. This is intentional. We
2951 if (old_size >= MINSIZE)
2977 if (remainder_size >= (long)MINSIZE) {
3023 extra = ((top_size - pad - MINSIZE + (pagesz-1)) / pagesz - 1) * pagesz;
3106 alignment and/or to obtain a size of at least MINSIZE, the
3202 (remainder_size = (long)size - (long)nb) >= (long)MINSIZE) {
3289 if (remainder_size < (long)MINSIZE) {
3377 if (remainder_size < (long)MINSIZE) {
3409 We require that "top" always exists (i.e., has size >= MINSIZE)
3412 ensuring it exists is that we may need MINSIZE space to put in
3420 if (remainder_size >= (long)MINSIZE) {
3829 if ((unsigned long)(newsize) >= (unsigned long)(nb + MINSIZE)) {
3840 if ((unsigned long)(newsize) >= (unsigned long)(nb + MINSIZE)) {
3951 if (remainder_size >= (long)MINSIZE) { /* split remainder */
4076 if (alignment < MINSIZE) alignment = MINSIZE;
4078 /* Make sure alignment is power of 2 (in case MINSIZE is not). */
4089 m = (char*)(mALLOc(nb + alignment + MINSIZE));
4099 leading space in a chunk of at least MINSIZE, if the first
4100 calculation places us at a spot with less than MINSIZE leader,
4107 if ((long)(brk - (char*)(p)) < (long)MINSIZE)
4138 if (remainder_size >= (long)MINSIZE) {