Lines Matching defs:bin
1576 specially. Top is never included in any bin, is used only if
1756 | bin index of this chunk |
1797 bins. Under current bin calculations, this ranges from 6 up to 21
1947 is not kept in a bin.
1950 An array of bin
1951 with sizes less than MIN_LARGE_SIZE bytes. Each bin contains
1953 use in double-linked lists, each bin header acts as a malloc_chunk
1962 from TREE_SHIFT to TREE_SHIFT+16. The last bin holds anything
1965 Bin maps
1967 treebins ("treemap). Each bin sets its bit when non-empty, and
1969 bin-by-bin searching -- nearly all "search" is done without ever
2002 /* Bin types, widths and sizes */
2280 /* The size of the smallest chunk held in bin with index i */
2286 /* ------------------------ Operations on bin maps ----------------------- */
2710 /* chunk belongs in bin */
2721 /* Find x in a bin. Used in other check functions. */
3112 /* Relays to large vs small bin operations */
3236 sbinptr bin = smallbin_at(m,i);
3237 bin->fd = bin->bk = bin;
3344 /* Insert the rest of old top into a bin as an ordinary free chunk */
3667 /* Traverse tree for this bin looking for node with size == nb */
4070 3. If one exists, split the smallest available chunk in a bin,
4097 idx += ~smallbits & 1; /* Uses next bin if idx empty */
4196 free chunks, if they exist, and then place in a bin. Intermixed
4504 idx += ~smallbits & 1; /* Uses next bin if idx empty */
4971 * Branch-free bin calculation
5070 bin strategy;
5073 * Use bin counts as a guide to preallocation
5074 * Occasionally bin return list chunks in first scan
5078 * faster bin computation & slightly different binning
