Lines Matching refs:bin
1622 specially. Top is never included in any bin, is used only if
1802 | bin index of this chunk |
1843 bins. Under current bin calculations, this ranges from 6 up to 21
1957 is not kept in a bin.
1960 An array of bin headers for free chunks. These bins hold chunks
1961 bin contains
1963 use in double-linked lists, each bin header acts as a malloc_chunk
1972 from TREE_SHIFT to TREE_SHIFT+16. The last bin holds anything
1975 Bin maps
1977 treebins ("treemap). Each bin sets its bit when non-empty, and
1979 bin-by-bin searching -- nearly all "search" is done without ever
2012 /* Bin types, widths and sizes */
2290 /* The size of the smallest chunk held in bin with index i */
2296 /* ------------------------ Operations on bin maps ----------------------- */
2720 /* chunk belongs in bin */
2731 /* Find x in a bin. Used in other check functions. */
3124 /* Relays to large vs small bin operations */
3248 sbinptr bin = smallbin_at(m,i);
3249 bin->fd = bin->bk = bin;
3356 /* Insert the rest of old top into a bin as an ordinary free chunk */
3677 /* Traverse tree for this bin looking for node with size == nb */
4080 3. If one exists, split the smallest available chunk in a bin,
4107 idx += ~smallbits & 1; /* Uses next bin if idx empty */
4206 free chunks, if they exist, and then place in a bin. Intermixed
4514 idx += ~smallbits & 1; /* Uses next bin if idx empty */
4981 * Branch-free bin calculation
5080 * malloc: swap order of clean-bin strategy;
5083 bin counts as a guide to preallocation
5084 * Occasionally bin return list chunks in first scan
5088 * faster bin computation & slightly different binning
