Lines Matching refs:chunksize
473 #define chunksize(p) ((p)->size & ~(SIZE_BITS)) macro
861 assert(chunksize(next) >= MINSIZE);
944 while (FD != BK && S < chunksize(FD)) FD = FD->fd; \
1046 INTERNAL_SIZE_T size = chunksize(p);
1073 INTERNAL_SIZE_T size = chunksize(p);
1126 INTERNAL_SIZE_T old_top_size = chunksize(old_top);
1347 victim_size = chunksize(victim);
1365 victim_size = chunksize(victim);
1392 victim_size = chunksize(victim);
1457 victim_size = chunksize(victim);
1520 if ( (remainder_size = chunksize(top) - nb) < (long)MINSIZE)
1533 if ( (remainder_size = chunksize(top) - nb) < (long)MINSIZE)
1615 nextsz = chunksize(next);
1760 newsize = oldsize = chunksize(oldp);
1794 nextsize = chunksize(next);
1832 prevsize = chunksize(prev);
1896 newsize += chunksize(newp);
2061 newsize = chunksize(p) - leadsize;
2086 remainder_size = chunksize(p) - nb;
2159 INTERNAL_SIZE_T oldtopsize = chunksize(top);
2185 csz = chunksize(p);
2259 top_size = chunksize(top);
2331 return chunksize(p) - SIZE_SZ;
2333 return chunksize(p) - 2*SIZE_SZ;
2352 INTERNAL_SIZE_T avail = chunksize(top); in malloc_update_mallinfo()
2363 q < top && inuse(q) && (long)(chunksize(q)) >= (long)MINSIZE; in malloc_update_mallinfo()
2367 avail += chunksize(p); in malloc_update_mallinfo()
2377 current_mallinfo.keepcost = chunksize(top); in malloc_update_mallinfo()