Lines Matching defs:runs
44 * + Memory is managed in chunks and runs (chunks can be split into runs),
87 * Small : Each size class is segregated into its own set of runs. Each run
329 * RUN_MAX_OVRHD indicates maximum desired run header overhead. Runs are sized
331 * violating other constraints. The goal is to make runs as small as possible
339 * per object (plus a constant). This constraint is relaxed (ignored) for runs
380 /* Total number of runs created for this bin's size class. */
384 * Total number of runs reused by extracting them from the runs tree for
392 /* Current number of runs in this bin. */
476 * quickly coalesce free runs.
517 * free runs, only the map entries for the first and last pages are
518 * kept up to date, so that free runs can be quickly coalesced.
572 * Tree of non-full runs. This tree is used when looking for an
578 rb_tree_t runs;
1910 * No usable runs. Create a new chunk from which to allocate the run.
1953 /* Try to coalesce with neighboring runs. */
2008 if ((run = RB_TREE_MIN(&bin->runs)) != NULL) {
2010 rb_tree_remove_node(&bin->runs, run);
2016 /* No existing runs have any space available. */
2402 * We make no attempt to resize runs here, though it would be
2479 * never gets inserted into the non-full runs
2482 rb_tree_remove_node(&bin->runs, run);
2502 rb_tree_insert_node(&bin->runs, bin->runcur);
2506 rb_tree_insert_node(&bin->runs, run);
2557 rb_tree_init(&bin->runs, &arena_run_tree_ops);
2571 rb_tree_init(&bin->runs, &arena_run_tree_ops);
2588 rb_tree_init(&bin->runs, &arena_run_tree_ops);