Lines Matching full:bins

316        chunks. Each bin is doubly linked.  The bins are approximately
317        proportionally (log) spaced.  There are a lot of these bins
321        bins are kept in size order, with ties going to the
325        size.  This is irrelevant for the small bins, which all contain
478    Bins
480     The bins, `av_' are an array of pairs of pointers serving as the
486     Bins for sizes < 512 bytes contain chunks of all the same size, spaced
487     8 bytes apart. Larger bins are approximately logarithmically
493     64 bins of size       8
494     32 bins of size      64
495     16 bins of size     512
496      8 bins of size    4096
497      4 bins of size   32768
498      2 bins of size  262144
504     The special chunks `top' and `last_remainder' get their own bins,
511 #define NAV             128   /* number of bins */
522    The first 2 bins are never indexed. The corresponding av_ cells are instead
540 /* Helper macro to initialize bins */
621   Indexing into bins
633   bins for chunks < 512 are all spaced 8 bytes apart, and hold
652     To help compensate for the large number of bins, a one-level index
654     one-word bitvector recording whether groups of BINBLOCKWIDTH bins
655     have any (possibly) non-empty bins, so they can be skipped over
657     cleared as soon as all bins in a block are empty, but instead only
661 #define BINBLOCKWIDTH     4   /* bins per block */
1200       3. Other bins are scanned in increasing size order, using a
1278     /* No traversal or size check necessary for small bins.  */
1298     idx += 2; /* Set for bin scan below. We've already scanned 2 bins. */
1364      search for best fitting chunk by scanning bins in blockwidth units.
1502 	  placed in corresponding bins. (This includes the case of
2428       * Pack bins using idea from  colin@nyx10.cs.du.edu
2429       * Use ordered bins instead of best-fit threshhold
2449       * No longer use return list or unconsolidated bins since
2469       * Try not to scavenge used bins