Lines Matching refs:top
430 The maximum amount of unused top-most memory to keep before
1620 1. The special chunk `top' is the top-most available chunk (i.e.,
1622 specially. Top is never included in any bin, is used only if
1625 the top chunk is treated as larger (and thus less well
1626 fitting) than any other available chunk. The top chunk
1821 <= x < 0x140 for the top nose) in the left subtree and the larger
1872 top-most space. Segments also include flags holding properties of
1902 * New segments are only appended to old ones when holding top-most
1906 Except for the top-most segment of an mstate, each segment record
1943 Top
1948 space from the system. The size at which to autotrim top is
2029 mchunkptr top;
2068 #define is_initialized(M) ((M)->top != 0)
2569 /* Check properties of top chunk */
2616 if (p != m->dv && p != m->top) {
2622 assert (next == m->top || cinuse(next));
2778 q != m->top && q->head != FENCEPOST_HEAD) {
2815 if (m->top != 0) { /* check top chunk */
2816 do_check_top_chunk(m, m->top);
2817 assert(m->topsize == chunksize(m->top));
2819 assert(bin_find(m, m->top) == 0);
2836 size_t nfree = SIZE_T_ONE; /* top always free */
2843 q != m->top && q->head != FENCEPOST_HEAD) {
2885 q != m->top && q->head != FENCEPOST_HEAD) {
3228 /* Initialize top chunk and its size */
3235 m->top = p;
3265 m->top = m->dv = 0;
3287 if (oldfirst == m->top) {
3289 m->top = q;
3317 /* Determine locations and sizes of segment, fenceposts, old top */
3318 char* old_top = (char*)m->top;
3332 /* reset top to new space */
3356 /* Insert the rest of old top into a bin as an ordinary free chunk */
3365 check_top_chunk(m, m->top);
3404 msegmentptr ss = (m->top == 0)? 0 : segment_holding(m, (char*)m->top);
3424 /* Subtract out existing available top space from MORECORE request. */
3507 /* Offset top by embedded malloc_state */
3521 segment_holds(sp, m->top)) { /* append */
3523 init_top(m, m->top, m->topsize + tsize);
3544 if (nb < m->topsize) { /* Allocate from new or extended top space */
3546 mchunkptr p = m->top;
3547 mchunkptr r = m->top = chunk_plus_offset(p, nb);
3550 check_top_chunk(m, m->top);
3609 /* Shrink top space in granularity-size units, keeping at least one */
3613 msegmentptr sp = segment_holding(m, (char*)m->top);
3649 init_top(m, m->top, m->topsize - released);
3650 check_top_chunk(m, m->top);
3794 /* Try to either shrink or extend into top. Else malloc-copy-free */
3811 else if (next == m->top && oldsize + m->topsize > nb) {
3812 /* Expand into top */
3818 m->top = newtop;
4082 4. If it is big enough, use the top chunk.
4088 3. If it is big enough, use the top chunk.
4181 else if (nb < gm->topsize) { /* Split top */
4183 mchunkptr p = gm->top;
4184 mchunkptr r = gm->top = chunk_plus_offset(p, nb);
4188 check_top_chunk(gm, gm->top);
4207 with special cases for top, dv, mmapped chunks, and usage errors.
4256 if (next == fm->top) {
4258 fm->top = p;
4432 check_top_chunk(m, m->top);
4588 else if (nb < ms->topsize) { /* Split top */
4590 mchunkptr p = ms->top;
4591 mchunkptr r = ms->top = chunk_plus_offset(p, nb);
4595 check_top_chunk(ms, ms->top);
4657 if (next == fm->top) {
4659 fm->top = p;
4977 * Fix freeing of old top non-contiguous chunk im sysmalloc.
5044 * Support another case of realloc via move into top
