]>
Commit | Line | Data |
---|---|---|
848205e6 | 1 | /* Virtual array support. |
6ff09968 | 2 | Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2006 |
2e1eedd6 | 3 | Free Software Foundation, Inc. |
848205e6 MM |
4 | Contributed by Cygnus Solutions. |
5 | ||
1322177d | 6 | This file is part of GCC. |
848205e6 | 7 | |
1322177d | 8 | GCC is free software; you can redistribute it and/or modify it |
848205e6 MM |
9 | under the terms of the GNU General Public License as published by |
10 | the Free Software Foundation; either version 2, or (at your option) | |
11 | any later version. | |
12 | ||
1322177d LB |
13 | GCC is distributed in the hope that it will be useful, but WITHOUT |
14 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY | |
15 | or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public | |
16 | License for more details. | |
848205e6 MM |
17 | |
18 | You should have received a copy of the GNU General Public License | |
1322177d | 19 | along with GCC; see the file COPYING. If not, write to the Free |
366ccddb KC |
20 | the Free Software Foundation, 51 Franklin Street, Fifth Floor, Boston, |
21 | MA 02110-1301, USA. */ | |
848205e6 MM |
22 | |
23 | #include "config.h" | |
24 | #include "system.h" | |
4977bab6 ZW |
25 | #include "coretypes.h" |
26 | #include "tm.h" | |
6ff09968 | 27 | #include "toplev.h" |
848205e6 | 28 | #include "varray.h" |
e2500fed | 29 | #include "ggc.h" |
9b57b627 | 30 | #include "hashtab.h" |
848205e6 MM |
31 | |
32 | #define VARRAY_HDR_SIZE (sizeof (struct varray_head_tag) - sizeof (varray_data)) | |
33 | ||
9b57b627 JH |
34 | #ifdef GATHER_STATISTICS |
35 | ||
1f52178b | 36 | /* Store information about each particular varray. */ |
9b57b627 JH |
37 | struct varray_descriptor |
38 | { | |
39 | const char *name; | |
40 | int allocated; | |
41 | int created; | |
42 | int resized; | |
43 | int copied; | |
44 | }; | |
45 | ||
46 | /* Hashtable mapping varray names to descriptors. */ | |
47 | static htab_t varray_hash; | |
48 | ||
49 | /* Hashtable helpers. */ | |
50 | static hashval_t | |
51 | hash_descriptor (const void *p) | |
52 | { | |
53 | const struct varray_descriptor *d = p; | |
54 | return htab_hash_pointer (d->name); | |
55 | } | |
56 | static int | |
57 | eq_descriptor (const void *p1, const void *p2) | |
58 | { | |
59 | const struct varray_descriptor *d = p1; | |
60 | return d->name == p2; | |
61 | } | |
62 | ||
63 | /* For given name, return descriptor, create new if needed. */ | |
64 | static struct varray_descriptor * | |
65 | varray_descriptor (const char *name) | |
66 | { | |
67 | struct varray_descriptor **slot; | |
68 | ||
69 | if (!varray_hash) | |
70 | varray_hash = htab_create (10, hash_descriptor, eq_descriptor, NULL); | |
71 | ||
72 | slot = (struct varray_descriptor **) | |
73 | htab_find_slot_with_hash (varray_hash, name, | |
74 | htab_hash_pointer (name), | |
75 | 1); | |
76 | if (*slot) | |
77 | return *slot; | |
78 | *slot = xcalloc (sizeof (**slot), 1); | |
79 | (*slot)->name = name; | |
80 | return *slot; | |
81 | } | |
82 | #endif | |
83 | ||
b604074c GK |
84 | /* Do not add any more non-GC items here. Please either remove or GC |
85 | those items that are not GCed. */ | |
19a7414e MS |
86 | |
87 | static const struct { | |
88 | unsigned char size; | |
89 | bool uses_ggc; | |
90 | } element[NUM_VARRAY_DATA] = { | |
91 | { sizeof (char), 1 }, | |
92 | { sizeof (unsigned char), 1 }, | |
93 | { sizeof (short), 1 }, | |
94 | { sizeof (unsigned short), 1 }, | |
95 | { sizeof (int), 1 }, | |
96 | { sizeof (unsigned int), 1 }, | |
97 | { sizeof (long), 1 }, | |
98 | { sizeof (unsigned long), 1 }, | |
99 | { sizeof (HOST_WIDE_INT), 1 }, | |
100 | { sizeof (unsigned HOST_WIDE_INT), 1 }, | |
b604074c | 101 | { sizeof (void *), 1 }, |
6de9cd9a | 102 | { sizeof (void *), 0 }, |
19a7414e MS |
103 | { sizeof (char *), 1 }, |
104 | { sizeof (struct rtx_def *), 1 }, | |
105 | { sizeof (struct rtvec_def *), 1 }, | |
106 | { sizeof (union tree_node *), 1 }, | |
107 | { sizeof (struct bitmap_head_def *), 1 }, | |
108 | { sizeof (struct reg_info_def *), 0 }, | |
6de9cd9a | 109 | { sizeof (struct basic_block_def *), 1 }, |
19a7414e | 110 | { sizeof (struct elt_list *), 1 }, |
6de9cd9a DN |
111 | { sizeof (struct edge_def *), 1 }, |
112 | { sizeof (tree *), 1 }, | |
e2500fed GK |
113 | }; |
114 | ||
848205e6 MM |
115 | /* Allocate a virtual array with NUM_ELEMENT elements, each of which is |
116 | ELEMENT_SIZE bytes long, named NAME. Array elements are zeroed. */ | |
117 | varray_type | |
2e1eedd6 AJ |
118 | varray_init (size_t num_elements, enum varray_data_enum element_kind, |
119 | const char *name) | |
848205e6 | 120 | { |
19a7414e | 121 | size_t data_size = num_elements * element[element_kind].size; |
e2500fed | 122 | varray_type ptr; |
9b57b627 JH |
123 | #ifdef GATHER_STATISTICS |
124 | struct varray_descriptor *desc = varray_descriptor (name); | |
125 | ||
126 | desc->created++; | |
127 | desc->allocated += data_size + VARRAY_HDR_SIZE; | |
128 | #endif | |
19a7414e | 129 | if (element[element_kind].uses_ggc) |
703ad42b | 130 | ptr = ggc_alloc_cleared (VARRAY_HDR_SIZE + data_size); |
e2500fed | 131 | else |
703ad42b | 132 | ptr = xcalloc (VARRAY_HDR_SIZE + data_size, 1); |
848205e6 MM |
133 | |
134 | ptr->num_elements = num_elements; | |
a6873608 | 135 | ptr->elements_used = 0; |
e2500fed | 136 | ptr->type = element_kind; |
a6873608 | 137 | ptr->name = name; |
848205e6 MM |
138 | return ptr; |
139 | } | |
140 | ||
141 | /* Grow/shrink the virtual array VA to N elements. Zero any new elements | |
142 | allocated. */ | |
143 | varray_type | |
2e1eedd6 | 144 | varray_grow (varray_type va, size_t n) |
848205e6 MM |
145 | { |
146 | size_t old_elements = va->num_elements; | |
848205e6 MM |
147 | if (n != old_elements) |
148 | { | |
19a7414e | 149 | size_t elem_size = element[va->type].size; |
e2500fed GK |
150 | size_t old_data_size = old_elements * elem_size; |
151 | size_t data_size = n * elem_size; | |
9b57b627 JH |
152 | #ifdef GATHER_STATISTICS |
153 | struct varray_descriptor *desc = varray_descriptor (va->name); | |
154 | varray_type oldva = va; | |
155 | ||
156 | if (data_size > old_data_size) | |
157 | desc->allocated += data_size - old_data_size; | |
158 | desc->resized ++; | |
159 | #endif | |
160 | ||
e2500fed | 161 | |
19a7414e | 162 | if (element[va->type].uses_ggc) |
703ad42b | 163 | va = ggc_realloc (va, VARRAY_HDR_SIZE + data_size); |
e2500fed | 164 | else |
703ad42b | 165 | va = xrealloc (va, VARRAY_HDR_SIZE + data_size); |
848205e6 MM |
166 | va->num_elements = n; |
167 | if (n > old_elements) | |
c981d223 | 168 | memset (&va->data.vdt_c[old_data_size], 0, data_size - old_data_size); |
9b57b627 JH |
169 | #ifdef GATHER_STATISTICS |
170 | if (oldva != va) | |
171 | desc->copied++; | |
172 | #endif | |
848205e6 MM |
173 | } |
174 | ||
175 | return va; | |
176 | } | |
987009bf | 177 | |
e2500fed GK |
178 | /* Reset a varray to its original state. */ |
179 | void | |
2e1eedd6 | 180 | varray_clear (varray_type va) |
e2500fed | 181 | { |
19a7414e | 182 | size_t data_size = element[va->type].size * va->num_elements; |
e2500fed | 183 | |
c981d223 | 184 | memset (va->data.vdt_c, 0, data_size); |
e2500fed GK |
185 | va->elements_used = 0; |
186 | } | |
187 | ||
987009bf ZW |
188 | /* Check the bounds of a varray access. */ |
189 | ||
6c9821b7 | 190 | #if defined ENABLE_CHECKING && (GCC_VERSION >= 2007) |
987009bf | 191 | |
987009bf | 192 | void |
2e1eedd6 AJ |
193 | varray_check_failed (varray_type va, size_t n, const char *file, int line, |
194 | const char *function) | |
987009bf | 195 | { |
12a08b40 ZW |
196 | internal_error ("virtual array %s[%lu]: element %lu out of bounds " |
197 | "in %s, at %s:%d", | |
9d99ca5b | 198 | va->name, (unsigned long) va->num_elements, (unsigned long) n, |
11dc5cc6 | 199 | function, trim_filename (file), line); |
987009bf ZW |
200 | } |
201 | ||
12a08b40 ZW |
202 | void |
203 | varray_underflow (varray_type va, const char *file, int line, | |
204 | const char *function) | |
205 | { | |
206 | internal_error ("underflowed virtual array %s in %s, at %s:%d", | |
207 | va->name, function, trim_filename (file), line); | |
208 | } | |
209 | ||
987009bf | 210 | #endif |
9b57b627 | 211 | |
6de9cd9a | 212 | |
9b57b627 JH |
213 | /* Output per-varray statistics. */ |
214 | #ifdef GATHER_STATISTICS | |
215 | ||
216 | /* Used to accumulate statistics about varray sizes. */ | |
217 | struct output_info | |
218 | { | |
219 | int count; | |
220 | int size; | |
221 | }; | |
222 | ||
223 | /* Called via htab_traverse. Output varray descriptor pointed out by SLOT | |
224 | and update statistics. */ | |
225 | static int | |
226 | print_statistics (void **slot, void *b) | |
227 | { | |
228 | struct varray_descriptor *d = (struct varray_descriptor *) *slot; | |
229 | struct output_info *i = (struct output_info *) b; | |
230 | ||
231 | if (d->allocated) | |
232 | { | |
233 | fprintf (stderr, "%-21s %6d %10d %7d %7d\n", d->name, | |
234 | d->created, d->allocated, d->resized, d->copied); | |
235 | i->size += d->allocated; | |
236 | i->count += d->created; | |
237 | } | |
238 | return 1; | |
239 | } | |
240 | #endif | |
241 | ||
242 | /* Output per-varray memory usage statistics. */ | |
83f676b3 RS |
243 | void |
244 | dump_varray_statistics (void) | |
9b57b627 JH |
245 | { |
246 | #ifdef GATHER_STATISTICS | |
247 | struct output_info info; | |
248 | ||
a5573239 JH |
249 | if (varray_hash) |
250 | { | |
251 | fprintf (stderr, "\nVARRAY Kind Count Bytes Resized copied\n"); | |
252 | fprintf (stderr, "-------------------------------------------------------\n"); | |
253 | info.count = 0; | |
254 | info.size = 0; | |
255 | htab_traverse (varray_hash, print_statistics, &info); | |
256 | fprintf (stderr, "-------------------------------------------------------\n"); | |
257 | fprintf (stderr, "%-20s %7d %10d\n", | |
258 | "Total", info.count, info.size); | |
259 | fprintf (stderr, "-------------------------------------------------------\n"); | |
260 | } | |
9b57b627 JH |
261 | #endif |
262 | } |