+2006-07-25 Nick Clifton <nickc@redhat.com>
+
+ * ggc-page.c (NUM_SIZE_LOOKUP): New constant - the length of the
+ size_lookup[] array.
+ (ggc_alloc_stat): Use NUM_SIZE_LOOKUP.
+ (ggc_pch_count_object): Likewise.
+ (ggc_pch_alloc_object): Likewise.
+ (ggc_pch_write_object): Likewise.
+ (init_ggc): Do not attempt to initialize entries in the
+ size_lookup[] array for objects whose size is greater than than
+ the length of the array.
+
2006-07-25 Daniel Jacobowitz <dan@codesourcery.com>
* dbxout.c (output_used_types_helper): Push queued types
/* This table provides a fast way to determine ceil(log_2(size)) for
allocation requests. The minimum allocation size is eight bytes. */
-
-static unsigned char size_lookup[512] =
+#define NUM_SIZE_LOOKUP 512
+static unsigned char size_lookup[NUM_SIZE_LOOKUP] =
{
3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4,
4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
struct page_entry *entry;
void *result;
- if (size < 512)
+ if (size < NUM_SIZE_LOOKUP)
{
order = size_lookup[size];
object_size = OBJECT_SIZE (order);
int o;
int i;
- o = size_lookup[OBJECT_SIZE (order)];
- for (i = OBJECT_SIZE (order); size_lookup [i] == o; --i)
+ i = OBJECT_SIZE (order);
+ if (i >= NUM_SIZE_LOOKUP)
+ continue;
+
+ for (o = size_lookup[i]; o == size_lookup [i]; --i)
size_lookup[i] = order;
}
{
unsigned order;
- if (size < 512)
+ if (size < NUM_SIZE_LOOKUP)
order = size_lookup[size];
else
{
unsigned order;
char *result;
- if (size < 512)
+ if (size < NUM_SIZE_LOOKUP)
order = size_lookup[size];
else
{
unsigned order;
static const char emptyBytes[256];
- if (size < 512)
+ if (size < NUM_SIZE_LOOKUP)
order = size_lookup[size];
else
{