• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /freebsd-13-stable/sys/contrib/octeon-sdk/cvmx-malloc/

Lines Matching defs:top

1271   M_TRIM_THRESHOLD is the maximum amount of unused top-most memory
1340 * When sbrk is called to extend the top of the arena to satisfy
1735 1. The special chunk `top' doesn't bother using the
1737 that would have to index off it. After initialization, `top'
1965 The bins top out around 1MB because we expect to service large
2032 The top-most available chunk (i.e., the one bordering the end of
2036 M_TRIM_THRESHOLD). Because top initially
2047 /* Conveniently, the unsorted bin can be used as dummy top on first call */
2182 mchunkptr top;
2263 av->top = initial_top(av);
2323 char* max_address = (char*)(av->top) + chunksize(av->top);
2329 if (p != av->top) {
2332 assert(((char*)p + sz) <= ((char*)(av->top)));
2336 /* top size is always at least MINSIZE */
2338 /* top predecessor always marked inuse */
2346 if (contiguous(av) && av->top != initial_top(av)) {
2388 assert (next == av->top || inuse(next));
2432 if (next == av->top) {
2528 if (av->top == 0 || av->top == initial_top(av))
2593 (q != av->top && inuse(q) &&
2600 /* top chunk is OK */
2601 check_chunk(av, av->top);
3232 (held in av->top). Note that this is in accord with the best-fit
3233 search rule. In effect, av->top is treated as larger (and thus
3238 We require that av->top always exists (i.e., has size >=
3245 victim = av->top;
3251 av->top = remainder;
3315 bordering top into fastbins
3317 && (chunk_at_offset(p, size) != av->top)
3344 if (nextchunk != av->top) {
3376 consolidate into top
3382 av->top = p;
3389 threshold, ask malloc_trim to reduce top.
3392 bordering top, so we cannot tell for sure whether threshold
3483 if (nextchunk != av->top) {
3505 av->top = p;
3578 /* Try to expand forward into top */
3579 if (next == av->top &&
3583 av->top = chunk_at_offset(oldp, nb);
3584 set_head(av->top, (newsize - nb) | PREV_INUSE);
3591 else if (next != av->top &&
3897 if (av->top == 0) malloc_consolidate(av);
3901 /* Account for top */
3902 avail = chunksize(av->top);
3903 nblocks = 1; /* top always exists */
3933 mi.keepcost = chunksize(av->top);