Lines Matching defs:bin
170 /* Free bin information. These numbers may be in need of re-tuning.
174 /* FIXME: We can't use anything but MAX_ALIGNMENT for the bin size
393 /* The highest bin index which might be non-empty. It may turn out
975 size_t bin = 0;
977 bin = SIZE_BIN_DOWN (size);
978 gcc_assert (bin != 0);
979 if (bin > NUM_FREE_BINS)
981 bin = 0;
984 chunk->next_free = zone->free_chunks[bin];
991 chunk->next_free = zone->free_chunks[bin];
996 zone->free_chunks[bin] = chunk;
997 if (bin > zone->high_free_bin)
998 zone->high_free_bin = bin;
1009 size_t bin;
1036 free bin of the appropriate size for a small object. However,
1054 /* Next, try to find a free bin of the exactly correct size. */
1059 bin = SIZE_BIN_DOWN (size);
1061 if (bin <= NUM_FREE_BINS
1062 && (chunk = zone->free_chunks[bin]) != NULL)
1067 zone->free_chunks[bin] = chunk->next_free;
1074 may now be wrong, if this was the last chunk in the high bin.
1082 to split. We can find one in the too-big bin, or in the largest
1083 sized bin with a chunk in it. Try the largest normal-sized bin
1086 if (zone->high_free_bin > bin)
1088 /* Find the highest numbered free bin. It will be at or below
1090 while (zone->high_free_bin > bin
1094 if (zone->high_free_bin > bin)
1099 /* Remove the chunk from its previous bin. */
1110 zone->cached_free_size = (tbin - bin) * FREE_BIN_DELTA;
1117 chunk in the high bin. Rather than fixing it up now,
1136 /* Remove the chunk from its previous bin. */