Lines Matching refs:bin
2164 specially. Top is never included in any bin, is used only if
2347 | bin index of this chunk |
2388 bins. Under current bin calculations, this ranges from 6 up to 21
2502 is not kept in a bin.
2505 An array of bin headers for free chunks. These bins hold chunks
2506 with sizes less than MIN_LARGE_SIZE bytes. Each bin contains
2508 use in double-linked lists, each bin header acts as a malloc_chunk
2517 from TREE_SHIFT to TREE_SHIFT+16. The last bin holds anything
2520 Bin maps
2522 treebins ("treemap). Each bin sets its bit when non-empty, and
2524 bin-by-bin searching -- nearly all "search" is done without ever
2569 /* Bin types, widths and sizes */
2908 /* The size of the smallest chunk held in bin with index i */
2914 /* ------------------------ Operations on bin maps ----------------------- */
3389 /* chunk belongs in bin */
3400 /* Find x in a bin. Used in other check functions. */
3803 /* Relays to large vs small bin operations */
3931 sbinptr bin = smallbin_at(m,i);
3932 bin->fd = bin->bk = bin;
4038 /* Insert the rest of old top into a bin as an ordinary free chunk */
4384 /* Consolidate and bin a chunk. Differs from exported versions
4465 /* Traverse tree for this bin looking for node with size == nb */
4577 3. If one exists, split the smallest available chunk in a bin,
4608 idx += ~smallbits & 1; /* Uses next bin if idx empty */
4709 free chunks, if they exist, and then place in a bin. Intermixed
5551 idx += ~smallbits & 1; /* Uses next bin if idx empty */
6190 * Branch-free bin calculation
6289 * malloc: swap order of clean-bin strategy;
6292 * Use bin counts as a guide to preallocation
6293 * Occasionally bin return list chunks in first scan
6297 * faster bin computation & slightly different binning
