Lines Matching refs:top
394 The maximum amount of unused top-most memory to keep before
1574 1. The special chunk `top' is the top-most available chunk (i.e.,
1576 specially. Top is never included in any bin, is used only if
1579 the top chunk is treated as larger (and thus less well
1580 fitting) than any other available chunk. The top chunk
1775 <= x < 0x140 for the top nose) in the left subtree and the larger
1826 top-most space. Segments also include flags holding properties of
1856 * New segments are only appended to old ones when holding top-most
1860 Except for the top-most segment of an mstate, each segment record
1933 Top
1938 space from the system. The size at which to autotrim top is
2019 mchunkptr top;
2058 #define is_initialized(M) ((M)->top != 0)
2559 /* Check properties of top chunk */
2606 if (p != m->dv && p != m->top) {
2612 assert (next == m->top || cinuse(next));
2768 q != m->top && q->head != FENCEPOST_HEAD) {
2805 if (m->top != 0) { /* check top chunk */
2806 do_check_top_chunk(m, m->top);
2807 assert(m->topsize == chunksize(m->top));
2809 assert(bin_find(m, m->top) == 0);
2826 size_t nfree = SIZE_T_ONE; /* top always free */
2833 q != m->top && q->head != FENCEPOST_HEAD) {
2875 q != m->top && q->head != FENCEPOST_HEAD) {
3216 /* Initialize top chunk and its size */
3223 m->top = p;
3253 m->top = m->dv = 0;
3275 if (oldfirst == m->top) {
3277 m->top = q;
3305 /* Determine locations and sizes of segment, fenceposts, old top */
3306 char* old_top = (char*)m->top;
3320 /* reset top to new space */
3344 /* Insert the rest of old top into a bin as an ordinary free chunk */
3353 check_top_chunk(m, m->top);
3392 msegmentptr ss = (m->top == 0)? 0 : segment_holding(m, (char*)m->top);
3412 /* Subtract out existing available top space from MORECORE request. */
3495 /* Offset top by embedded malloc_state */
3510 segment_holds(sp, m->top)) { /* append */
3512 init_top(m, m->top, m->topsize + tsize);
3534 if (nb < m->topsize) { /* Allocate from new or extended top space */
3536 mchunkptr p = m->top;
3537 mchunkptr r = m->top = chunk_plus_offset(p, nb);
3540 check_top_chunk(m, m->top);
3599 /* Shrink top space in granularity-size units, keeping at least one */
3603 msegmentptr sp = segment_holding(m, (char*)m->top);
3639 init_top(m, m->top, m->topsize - released);
3640 check_top_chunk(m, m->top);
3784 /* Try to either shrink or extend into top. Else malloc-copy-free */
3801 else if (next == m->top && oldsize + m->topsize > nb) {
3802 /* Expand into top */
3808 m->top = newtop;
4072 4. If it is big enough, use the top chunk.
4078 3. If it is big enough, use the top chunk.
4171 else if (nb < gm->topsize) { /* Split top */
4173 mchunkptr p = gm->top;
4174 mchunkptr r = gm->top = chunk_plus_offset(p, nb);
4178 check_top_chunk(gm, gm->top);
4197 with special cases for top, dv, mmapped chunks, and usage errors.
4246 if (next == fm->top) {
4248 fm->top = p;
4422 check_top_chunk(m, m->top);
4578 else if (nb < ms->topsize) { /* Split top */
4580 mchunkptr p = ms->top;
4581 mchunkptr r = ms->top = chunk_plus_offset(p, nb);
4585 check_top_chunk(ms, ms->top);
4647 if (next == fm->top) {
4649 fm->top = p;
4967 * Fix freeing of old top non-contiguous chunk im sysmalloc.
5034 * Support another case of realloc via move into top
