1106 #define chunksize(p)          ((p)->size & ~(SIZE_BITS))  macro
1441     assert(chunksize(next) >= MINSIZE);  in do_check_inuse_chunk()
1520       while (FD != BK && S < chunksize(FD)) FD = FD->fd;                      \
1625   INTERNAL_SIZE_T size = chunksize(p);  in munmap_chunk()
1656   INTERNAL_SIZE_T size = chunksize(p);  in mremap_chunk()
1713   INTERNAL_SIZE_T old_top_size = chunksize(old_top);  in malloc_extend_top()
1945       victim_size = chunksize(victim);  in mALLOc()
1963       victim_size = chunksize(victim);  in mALLOc()
1990     victim_size = chunksize(victim);  in mALLOc()
2055           victim_size = chunksize(victim);  in mALLOc()
2125   remainder_size = long_sub_size_t(chunksize(top), nb);  in mALLOc()
2126   if (chunksize(top) < nb || remainder_size < (long)MINSIZE)  in mALLOc()
2141     remainder_size = long_sub_size_t(chunksize(top), nb);  in mALLOc()
2142     if (chunksize(top) < nb || remainder_size < (long)MINSIZE)  in mALLOc()
2226   nextsz = chunksize(next);  in fREe()
2375   newsize = oldsize = chunksize(oldp);  in rEALLOc()
2428       nextsize = chunksize(next);  in rEALLOc()
2463       prevsize = chunksize(prev);  in rEALLOc()
2527       newsize += chunksize(newp);  in rEALLOc()
2653     newsize = chunksize(p) - leadsize;  in mEMALIGn()
2678   remainder_size = long_sub_size_t(chunksize(p), nb);  in mEMALIGn()
2766   oldtopsize = chunksize(top);  in cALLOc()
2795     csz = chunksize(p);  in cALLOc()
2869   top_size = chunksize(top);  in malloc_trim()
2951       return chunksize(p) - SIZE_SZ;  in malloc_usable_size()
2953     return chunksize(p) - 2*SIZE_SZ;  in malloc_usable_size()
2975   INTERNAL_SIZE_T avail = chunksize(top);  in malloc_update_mallinfo()
2986            q < top && inuse(q) && (long)(chunksize(q)) >= (long)MINSIZE;  in malloc_update_mallinfo()
2990       avail += chunksize(p);  in malloc_update_mallinfo()
3002   current_mallinfo.keepcost = chunksize(top);  in malloc_update_mallinfo()