Lines Matching refs:MINSIZE

1220 	become less than MINSIZE bytes long, it is replenished via
1277 #define MINSIZE                (sizeof(struct malloc_chunk))
1288   (long)(MINSIZE + MALLOC_ALIGN_MASK)) ? MINSIZE : \
1629   if ((long)sz >= (long)MINSIZE)
1672     assert(chunksize(next) >= MINSIZE);
1691   assert((long)sz >= (long)MINSIZE);
1694   assert(room < (long)MINSIZE);
1945   INTERNAL_SIZE_T    sbrk_size     = nb + top_pad + MINSIZE;
2008       if (old_top_size < MINSIZE)
2022       if (old_top_size >= MINSIZE)
2048     MINSIZE (currently 16 bytes), the smallest allocatable size.
2049     (All fits are considered `exact' if they are within MINSIZE bytes.)
2137     /* Also scan the next one, since it would have a remainder < MINSIZE */
2165       if (remainder_size >= (long)MINSIZE) /* too big */
2191     if (remainder_size >= (long)MINSIZE) /* re-split */
2254 	  if (remainder_size >= (long)MINSIZE) /* split */
2312   if ( (remainder_size = chunksize(top) - nb) < (long)MINSIZE)
2324     if ( (remainder_size = chunksize(top) - nb) < (long)MINSIZE)
2569 	if ((long)(nextsize + newsize) >= (long)(nb + MINSIZE))
2607 	  if ((long)(nextsize + prevsize + newsize) >= (long)(nb + MINSIZE))
2672   if (newsize - nb >= MINSIZE) /* split off remainder */
2737   if (alignment <  MINSIZE) alignment = MINSIZE;
2742   m  = (char*)(mALLOc(nb + alignment + MINSIZE));
2760       least MINSIZE, if the first calculation places us at
2761       a spot with less than MINSIZE leader, we can move to the
2767     if ((long)(brk - (char*)(p)) < MINSIZE) brk = brk + alignment;
2797   if (remainder_size >= (long)MINSIZE)
2956   extra = ((top_size - pad - MINSIZE + (pagesz-1)) / pagesz - 1) * pagesz;
2977 	if (top_size >= (long)MINSIZE) /* if not, we are very very dead! */
3048   int   navail = ((long)(avail) >= (long)MINSIZE)? 1 : 0;
3058 	   q < top && inuse(q) && (long)(chunksize(q)) >= (long)MINSIZE;