Lines Matching defs:MIN_CHUNK_SIZE
1673 #define MIN_CHUNK_SIZE\
1683 #define MAX_REQUEST ((-MIN_CHUNK_SIZE) << 2)
1684 #define MIN_REQUEST (MIN_CHUNK_SIZE - CHUNK_OVERHEAD - SIZE_T_ONE)
1692 (((req) < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(req))
2141 (align_offset(chunk2mem(0))+pad_request(sizeof(struct malloc_segment))+MIN_CHUNK_SIZE)
2240 #define MIN_SMALL_INDEX (small_index(MIN_CHUNK_SIZE))
2525 (MAX_SIZE_T < MIN_CHUNK_SIZE) ||
2617 if (sz >= MIN_CHUNK_SIZE) {
2638 assert(sz >= MIN_CHUNK_SIZE);
2640 /* unless mmapped, size is less than MIN_CHUNK_SIZE more than request */
2641 assert(is_mmapped(p) || sz < (s + MIN_CHUNK_SIZE));
2811 assert(m->dvsize >= MIN_CHUNK_SIZE);
2918 assert(S >= MIN_CHUNK_SIZE);\
3284 assert(qsize >= MIN_CHUNK_SIZE);
3325 char* csp = (asp < (old_top + MIN_CHUNK_SIZE))? old_top : asp;
3726 if (rsize < MIN_CHUNK_SIZE)
3765 if (rsize < MIN_CHUNK_SIZE)
3804 if (rsize >= MIN_CHUNK_SIZE) {
3856 if (alignment < MIN_CHUNK_SIZE) /* must be at least a minimum chunk size */
3857 alignment = MIN_CHUNK_SIZE;
3871 size_t req = nb + alignment + MIN_CHUNK_SIZE - CHUNK_OVERHEAD;
3882 back leading space in a chunk of at least MIN_CHUNK_SIZE, if
3884 MIN_CHUNK_SIZE leader, we can move to the next aligned spot.
3892 char* pos = ((size_t)(br - (char*)(p)) >= MIN_CHUNK_SIZE)?
3913 if (size > nb + MIN_CHUNK_SIZE) {
4101 nb = (bytes < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(bytes);
4132 if (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE)
4164 if (rsize >= MIN_CHUNK_SIZE) { /* split dv */
4508 nb = (bytes < MIN_REQUEST)? MIN_CHUNK_SIZE : pad_request(bytes);
4539 if (SIZE_T_SIZE != 4 && rsize < MIN_CHUNK_SIZE)
4571 if (rsize >= MIN_CHUNK_SIZE) { /* split dv */