Lines Matching full:bins
1231 chunks. Each bin is doubly linked. The bins are approximately
1232 proportionally (log) spaced. There are a lot of these bins
1236 bins are kept in size order, with ties going to the
1240 size. This is irrelevant for the small bins, which all contain
1397 Bins
1399 The bins, `av_' are an array of pairs of pointers serving as the
1405 Bins for sizes < 512 bytes contain chunks of all the same size, spaced
1406 8 bytes apart. Larger bins are approximately logarithmically
1412 64 bins of size 8
1413 32 bins of size 64
1414 16 bins of size 512
1415 8 bins of size 4096
1416 4 bins of size 32768
1417 2 bins of size 262144
1423 The special chunks `top' and `last_remainder' get their own bins,
1430 #define NAV 128 /* number of bins */
1441 The first 2 bins are never indexed. The corresponding av_ cells are instead
1459 /* Helper macro to initialize bins */
1491 Indexing into bins
1503 bins for chunks < 512 are all spaced 8 bytes apart, and hold
1522 To help compensate for the large number of bins, a one-level index
1524 one-word bitvector recording whether groups of BINBLOCKWIDTH bins
1525 have any (possibly) non-empty bins, so they can be skipped over
1527 cleared as soon as all bins in a block are empty, but instead only
1531 #define BINBLOCKWIDTH 4 /* bins per block */
2065 3. Other bins are scanned in increasing size order, using a
2132 /* No traversal or size check necessary for small bins. */
2152 idx += 2; /* Set for bin scan below. We've already scanned 2 bins. */
2218 search for best fitting chunk by scanning bins in blockwidth units.
2356 placed in corresponding bins. (This includes the case of
3197 * Pack bins using idea from colin@nyx10.cs.du.edu
3198 * Use ordered bins instead of best-fit threshhold
3218 * No longer use return list or unconsolidated bins since
3238 * Try not to scavenge used bins