Cross Reference: /bionic/libc/upstream-dlmalloc/malloc.c

Lines Matching defs:top
464   The maximum amount of unused top-most memory to keep before
2162      1. The special chunk `top' is the top-most available chunk (i.e.,
2167         the top chunk is treated as larger (and thus less well
2168         fitting) than any other available chunk.  The top chunk
2366   <= x < 0x140 for the top nose) in the left subtree and the larger
2417   top-most space. Segments also include flags holding properties of
2447   * New segments are only appended to old ones when holding top-most
2451   Except for the top-most segment of an mstate, each segment record
2493     space from the system.  The size at which to autotrim top is
2586   mchunkptr  top;
2638 #define is_initialized(M)  ((M)->top != 0)
3238 /* Check properties of top chunk */
3285   if (p != m->dv && p != m->top) {
3291       assert (next == m->top || is_inuse(next));
3447              q != m->top && q->head != FENCEPOST_HEAD) {
3485   if (m->top != 0) {   /* check top chunk */
3486     do_check_top_chunk(m, m->top);
3487     /*assert(m->topsize == chunksize(m->top)); redundant */
3489     assert(bin_find(m, m->top) == 0);
3507       size_t nfree = SIZE_T_ONE; /* top always free */
3514                q != m->top && q->head != FENCEPOST_HEAD) {
3558                q != m->top && q->head != FENCEPOST_HEAD) {
3909 /* Initialize top chunk and its size */
3916   m->top = p;
3946   m->top = m->dv = 0;
3968   if (oldfirst == m->top) {
3970     m->top = q;
3997   /* Determine locations and sizes of segment, fenceposts, old top */
3998   char* old_top = (char*)m->top;
4012   /* reset top to new space */
4036   /* Insert the rest of old top into a bin as an ordinary free chunk */
4045   check_top_chunk(m, m->top);
4108     msegmentptr ss = (m->top == 0)? 0 : segment_holding(m, (char*)m->top);
4129       /* Subtract out existing available top space from MORECORE request. */
4213         /* Offset top by embedded malloc_state */
4228           segment_holds(sp, m->top)) { /* append */
4230         init_top(m, m->top, m->topsize + tsize);
4251     if (nb < m->topsize) { /* Allocate from new or extended top space */
4253       mchunkptr p = m->top;
4254       mchunkptr r = m->top = chunk_plus_offset(p, nb);
4257       check_top_chunk(m, m->top);
4324       /* Shrink top space in granularity-size units, keeping at least one */
4328       msegmentptr sp = segment_holding(m, (char*)m->top);
4365         init_top(m, m->top, m->topsize - released);
4366         check_top_chunk(m, m->top);
4416       if (next == m->top) {
4418         m->top = p;
4577        4. If it is big enough, use the top chunk.
4583        3. If it is big enough, use the top chunk.
4680     else if (nb < gm->topsize) { /* Split top */
4682       mchunkptr p = gm->top;
4683       mchunkptr r = gm->top = chunk_plus_offset(p, nb);
4687       check_top_chunk(gm, gm->top);
4708      with special cases for top, dv, mmapped chunks, and usage errors.
4756             if (next == fm->top) {
4758               fm->top = p;
4853     else if (next == m->top) {  /* extend into top */
4860         m->top = newtop;
5170     mchunkptr top = m->top;
5194         if (q == top)
5442   check_top_chunk(m, m->top);
5616     else if (nb < ms->topsize) { /* Split top */
5618       mchunkptr p = ms->top;
5619       mchunkptr r = ms->top = chunk_plus_offset(p, nb);
5623       check_top_chunk(ms, ms->top);
5685             if (next == fm->top) {
5687               fm->top = p;
6177       * Fix freeing of old top non-contiguous chunk im sysmalloc.
6244       * Support another case of realloc via move into top