Lines Matching refs:Top
4092 " int keepcost; /* top-most, releasable (via malloc_trim) space */\n" +
4541 " M_TRIM_THRESHOLD is the maximum amount of unused top-most memory\n" +
4610 " * When sbrk is called to extend the top of the arena to satisfy\n" +
5207 " 1. The special chunk `top' doesn't bother using the\n" +
5209 " that would have to index off it. After initialization, `top'\n" +
5426 " The bins top out around 1MB because we expect to service large\n" +
5521 " Top\n" +
5523 " The top-most available chunk (i.e., the one bordering the end of\n" +
5527 " M_TRIM_THRESHOLD). Because top initially\n" +
5538 "/* Conveniently, the unsorted bin can be used as dummy top on first call */\n" +
5678 " mchunkptr top;\n" +
5774 " av->top = initial_top(av);\n" +
5837 " char* max_address = (char*)(av->top) + chunksize(av->top);\n" +
5843 " if (p != av->top) {\n" +
5846 " assert(((char*)p + sz) <= ((char*)(av->top)));\n" +
5850 " /* top size is always at least MINSIZE */\n" +
5852 " /* top predecessor always marked inuse */\n" +
5860 " if (contiguous(av) && av->top != initial_top(av)) {\n" +
5904 " assert (next == av->top || inuse(next));\n" +
5948 " if (next == av->top) {\n" +
6039 " if (av->top == 0 || av->top == initial_top(av))\n" +
6107 " (q != av->top && inuse(q) &&\n" +
6114 " /* top chunk is OK */\n" +
6115 " check_chunk(av->top);\n" +
6139 " On entry, it is assumed that av->top does not have enough\n" +
6140 " space to service request for nb bytes, thus requiring that av->top\n" +
6150 " mchunkptr old_top; /* incoming value of av->top */\n" +
6193 " rather than expanding top.\n" +
6257 " /* Record incoming configuration of top */\n" +
6259 " old_top = av->top;\n" +
6325 " /* Cannot merge with old top, so add its size back in */\n" +
6359 " If MORECORE extends previous space, we can likewise extend top size.\n" +
6424 " prev_inuse of av->top (and any chunk created from its start)\n" +
6486 " /* Adjust top based on results of second sbrk */\n" +
6488 " av->top = (mchunkptr)aligned_brk;\n" +
6489 " set_head(av->top, (snd_brk - aligned_brk + correction) | PREV_INUSE);\n" +
6549 " p = av->top;\n" +
6556 " av->top = remainder;\n" +
6577 " automatically by free() when top space exceeds the trim\n" +
6590 " long top_size; /* Amount of top-most memory */\n" +
6598 " top_size = chunksize(av->top);\n" +
6610 " if (current_brk == (char*)(av->top) + top_size) {\n" +
6629 " /* Success. Adjust top. */\n" +
6631 " set_head(av->top, (top_size - released) | PREV_INUSE);\n" +
6966 " (held in av->top). Note that this is in accord with the best-fit\n" +
6967 " search rule. In effect, av->top is treated as larger (and thus\n" +
6972 " We require that av->top always exists (i.e., has size >=\n" +
6979 " victim = av->top;\n" +
6985 " av->top = remainder;\n" +
6994 " If no space in top, relay to handle system-dependent cases\n" +
7039 " bordering top into fastbins\n" +
7041 " && (chunk_at_offset(p, size) != av->top)\n" +
7069 " if (nextchunk != av->top) {\n" +
7101 " consolidate into top\n" +
7107 " av->top = p;\n" +
7114 " threshold, ask malloc_trim to reduce top.\n" +
7117 " bordering top, so we cannot tell for sure whether threshold\n" +
7129 " if ((CHUNK_SIZE_T)(chunksize(av->top)) >=\n" +
7235 " if (nextchunk != av->top) {\n" +
7257 " av->top = p;\n" +
7336 " /* Try to expand forward into top */\n" +
7337 " if (next == av->top &&\n" +
7341 " av->top = chunk_at_offset(oldp, nb);\n" +
7342 " set_head(av->top, (newsize - nb) | PREV_INUSE);\n" +
7347 " else if (next != av->top &&\n" +
7947 " if (av->top == 0) malloc_consolidate(av);\n" +
7951 " /* Account for top */\n" +
7952 " avail = chunksize(av->top);\n" +
7953 " nblocks = 1; /* top always exists */\n" +
7985 " mi.keepcost = chunksize(av->top);\n" +
8394 " /* Adjust the regions commit top */\n" +
8409 " /* Start with the current region's top */\n" +
8469 " /* Adjust the regions allocation top */\n" +
8502 " /* Adjust the regions commit top */\n" +
8506 " /* Adjust the regions allocation top */\n" +
8558 " /* Adjust deallocation size and regions commit and allocate top */\n" +
8564 " /* Adjust regions allocate top */\n" +
8569 " /* Adjust regions allocate top */\n" +
