1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
/* objc-map.c -- Implementation of map data structures for ObjC compiler
Copyright (C) 2011-2013 Free Software Foundation, Inc.
Written by Nicola Pero <nicola.pero@meta-innovation.com>
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser Public License as published by the
Free Software Foundation; either version 3, or (at your option) any
later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser Public License for more details.
You should have received a copy of the GNU Lesser Public License
along with this program; if not, write to the Free Software
Foundation, 51 Franklin Street - Fifth Floor,
Boston, MA 02110-1301, USA. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tree.h"
#include "ggc.h"
#include "objc-map.h"
#define OUT_OF_MEMORY { fprintf (stderr, "Out of memory\n"); abort (); }
static
size_t
ATTRIBUTE_PURE
next_power_of_two (size_t x)
{
size_t result = 1;
if (x < 2)
return 2;
/* Avoid the long calculation if x is already a power of two. Since
we internally always increase/shrink tables by powers of 2, the
calculation should only be done once, when the table is first
set up. */
if ((x & (x - 1)) == 0)
return x;
/* Calculate log_2 by counting how many times we can divide by 2
before reaching 0. */
while (x > 0)
{
x = x >> 1;
result = result << 1;
}
return result;
}
objc_map_t
objc_map_alloc_ggc (size_t initial_capacity)
{
objc_map_t map = (objc_map_t) ggc_internal_cleared_vec_alloc (1, sizeof (struct objc_map_private));
if (map == NULL)
OUT_OF_MEMORY;
initial_capacity = next_power_of_two (initial_capacity);
map->number_of_slots = initial_capacity;
map->mask = initial_capacity - 1;
map->maximum_load_factor = 70;
map->max_number_of_non_empty_slots = (initial_capacity * map->maximum_load_factor) / 100;
map->slots = (tree *)ggc_internal_cleared_vec_alloc (initial_capacity, sizeof (tree));
map->values = (tree *)ggc_internal_cleared_vec_alloc (initial_capacity, sizeof (tree));
if (map->slots == NULL)
OUT_OF_MEMORY;
if (map->values == NULL)
OUT_OF_MEMORY;
return map;
}
void
objc_map_set_maximum_load_factor (objc_map_t map, int number_between_zero_and_one_hundred)
{
if (map->number_of_non_empty_slots != 0)
return;
map->maximum_load_factor = number_between_zero_and_one_hundred;
map->max_number_of_non_empty_slots = (map->number_of_slots * number_between_zero_and_one_hundred) / 100;
}
int
objc_map_maximum_load_factor (objc_map_t map)
{
return map->maximum_load_factor;
}
static void
objc_map_private_resize (objc_map_t map, size_t new_number_of_slots)
{
tree *old_slots = map->slots;
tree *old_values = map->values;
size_t i, old_number_of_slots = map->number_of_slots;
if (new_number_of_slots < (map->number_of_non_empty_slots))
new_number_of_slots = 2 * map->number_of_non_empty_slots;
new_number_of_slots = next_power_of_two (new_number_of_slots);
map->number_of_slots = new_number_of_slots;
map->mask = map->number_of_slots - 1;
map->max_number_of_non_empty_slots = (map->number_of_slots * map->maximum_load_factor) / 100;
map->slots = (tree *)ggc_internal_cleared_vec_alloc (map->number_of_slots, sizeof (tree));
map->values = (tree *)ggc_internal_cleared_vec_alloc (map->number_of_slots, sizeof (tree));
if (map->slots == NULL)
OUT_OF_MEMORY;
if (map->values == NULL)
OUT_OF_MEMORY;
for (i = 0; i < old_number_of_slots; i++)
if (old_slots[i] != OBJC_MAP_PRIVATE_EMPTY_SLOT)
{
size_t k = IDENTIFIER_HASH_VALUE (old_slots[i]) & map->mask;
if (map->slots[k] == OBJC_MAP_PRIVATE_EMPTY_SLOT)
{
map->slots[k] = old_slots[i];
map->values[k] = old_values[i];
}
else
{
size_t j = 1;
while (1)
{
k = (k + j) & map->mask;
if (map->slots[k] == OBJC_MAP_PRIVATE_EMPTY_SLOT)
{
map->slots[k] = old_slots[i];
map->values[k] = old_values[i];
break;
}
j++;
}
}
}
ggc_free (old_slots);
ggc_free (old_values);
}
void
objc_map_private_grow (struct objc_map_private *map)
{
objc_map_private_resize (map, map->number_of_slots * 2);
}
#include "gt-objc-objc-map.h"
|
