Commit | Line | Data |
---|---|---|
de4f826b DC |
1 | /* Routines for name->symbol lookups in GDB. |
2 | ||
32d0add0 | 3 | Copyright (C) 2003-2015 Free Software Foundation, Inc. |
de4f826b DC |
4 | |
5 | Contributed by David Carlton <carlton@bactrian.org> and by Kealia, | |
6 | Inc. | |
7 | ||
8 | This file is part of GDB. | |
9 | ||
10 | This program is free software; you can redistribute it and/or modify | |
11 | it under the terms of the GNU General Public License as published by | |
a9762ec7 JB |
12 | the Free Software Foundation; either version 3 of the License, or |
13 | (at your option) any later version. | |
de4f826b | 14 | |
a9762ec7 JB |
15 | This program is distributed in the hope that it will be useful, |
16 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
17 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
18 | GNU General Public License for more details. | |
de4f826b DC |
19 | |
20 | You should have received a copy of the GNU General Public License | |
a9762ec7 | 21 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
de4f826b DC |
22 | |
23 | #include "defs.h" | |
c4d840bd | 24 | #include <ctype.h> |
de4f826b DC |
25 | #include "gdb_obstack.h" |
26 | #include "symtab.h" | |
27 | #include "buildsym.h" | |
de4f826b DC |
28 | #include "dictionary.h" |
29 | ||
30 | /* This file implements dictionaries, which are tables that associate | |
31 | symbols to names. They are represented by an opaque type 'struct | |
32 | dictionary'. That type has various internal implementations, which | |
33 | you can choose between depending on what properties you need | |
34 | (e.g. fast lookup, order-preserving, expandable). | |
35 | ||
36 | Each dictionary starts with a 'virtual function table' that | |
37 | contains the functions that actually implement the various | |
38 | operations that dictionaries provide. (Note, however, that, for | |
39 | the sake of client code, we also provide some functions that can be | |
40 | implemented generically in terms of the functions in the vtable.) | |
41 | ||
42 | To add a new dictionary implementation <impl>, what you should do | |
43 | is: | |
44 | ||
45 | * Add a new element DICT_<IMPL> to dict_type. | |
46 | ||
47 | * Create a new structure dictionary_<impl>. If your new | |
48 | implementation is a variant of an existing one, make sure that | |
49 | their structs have the same initial data members. Define accessor | |
50 | macros for your new data members. | |
51 | ||
52 | * Implement all the functions in dict_vector as static functions, | |
53 | whose name is the same as the corresponding member of dict_vector | |
54 | plus _<impl>. You don't have to do this for those members where | |
55 | you can reuse existing generic functions | |
56 | (e.g. add_symbol_nonexpandable, free_obstack) or in the case where | |
57 | your new implementation is a variant of an existing implementation | |
58 | and where the variant doesn't affect the member function in | |
59 | question. | |
60 | ||
61 | * Define a static const struct dict_vector dict_<impl>_vector. | |
62 | ||
63 | * Define a function dict_create_<impl> to create these | |
64 | gizmos. Add its declaration to dictionary.h. | |
65 | ||
66 | To add a new operation <op> on all existing implementations, what | |
67 | you should do is: | |
68 | ||
69 | * Add a new member <op> to struct dict_vector. | |
70 | ||
71 | * If there is useful generic behavior <op>, define a static | |
72 | function <op>_something_informative that implements that behavior. | |
73 | (E.g. add_symbol_nonexpandable, free_obstack.) | |
74 | ||
75 | * For every implementation <impl> that should have its own specific | |
76 | behavior for <op>, define a static function <op>_<impl> | |
77 | implementing it. | |
78 | ||
79 | * Modify all existing dict_vector_<impl>'s to include the appropriate | |
80 | member. | |
81 | ||
82 | * Define a function dict_<op> that looks up <op> in the dict_vector | |
83 | and calls the appropriate function. Add a declaration for | |
0963b4bd | 84 | dict_<op> to dictionary.h. */ |
de4f826b DC |
85 | |
86 | /* An enum representing the various implementations of dictionaries. | |
87 | Used only for debugging. */ | |
88 | ||
89 | enum dict_type | |
90 | { | |
91 | /* Symbols are stored in a fixed-size hash table. */ | |
92 | DICT_HASHED, | |
93 | /* Symbols are stored in an expandable hash table. */ | |
94 | DICT_HASHED_EXPANDABLE, | |
95 | /* Symbols are stored in a fixed-size array. */ | |
96 | DICT_LINEAR, | |
97 | /* Symbols are stored in an expandable array. */ | |
20605361 | 98 | DICT_LINEAR_EXPANDABLE |
de4f826b DC |
99 | }; |
100 | ||
101 | /* The virtual function table. */ | |
102 | ||
103 | struct dict_vector | |
104 | { | |
105 | /* The type of the dictionary. This is only here to make debugging | |
106 | a bit easier; it's not actually used. */ | |
107 | enum dict_type type; | |
108 | /* The function to free a dictionary. */ | |
109 | void (*free) (struct dictionary *dict); | |
110 | /* Add a symbol to a dictionary, if possible. */ | |
111 | void (*add_symbol) (struct dictionary *dict, struct symbol *sym); | |
112 | /* Iterator functions. */ | |
113 | struct symbol *(*iterator_first) (const struct dictionary *dict, | |
114 | struct dict_iterator *iterator); | |
115 | struct symbol *(*iterator_next) (struct dict_iterator *iterator); | |
116 | /* Functions to iterate over symbols with a given name. */ | |
c4d840bd | 117 | struct symbol *(*iter_match_first) (const struct dictionary *dict, |
2edb89d3 JK |
118 | const char *name, |
119 | symbol_compare_ftype *equiv, | |
120 | struct dict_iterator *iterator); | |
c4d840bd | 121 | struct symbol *(*iter_match_next) (const char *name, |
2edb89d3 | 122 | symbol_compare_ftype *equiv, |
de4f826b | 123 | struct dict_iterator *iterator); |
de4f826b DC |
124 | /* A size function, for maint print symtabs. */ |
125 | int (*size) (const struct dictionary *dict); | |
126 | }; | |
127 | ||
128 | /* Now comes the structs used to store the data for different | |
129 | implementations. If two implementations have data in common, put | |
130 | the common data at the top of their structs, ordered in the same | |
131 | way. */ | |
132 | ||
133 | struct dictionary_hashed | |
134 | { | |
135 | int nbuckets; | |
136 | struct symbol **buckets; | |
137 | }; | |
138 | ||
139 | struct dictionary_hashed_expandable | |
140 | { | |
141 | /* How many buckets we currently have. */ | |
142 | int nbuckets; | |
143 | struct symbol **buckets; | |
144 | /* How many syms we currently have; we need this so we will know | |
145 | when to add more buckets. */ | |
146 | int nsyms; | |
147 | }; | |
148 | ||
149 | struct dictionary_linear | |
150 | { | |
151 | int nsyms; | |
152 | struct symbol **syms; | |
153 | }; | |
154 | ||
155 | struct dictionary_linear_expandable | |
156 | { | |
157 | /* How many symbols we currently have. */ | |
158 | int nsyms; | |
159 | struct symbol **syms; | |
160 | /* How many symbols we can store before needing to reallocate. */ | |
161 | int capacity; | |
162 | }; | |
163 | ||
164 | /* And now, the star of our show. */ | |
165 | ||
166 | struct dictionary | |
167 | { | |
168 | const struct dict_vector *vector; | |
169 | union | |
170 | { | |
171 | struct dictionary_hashed hashed; | |
172 | struct dictionary_hashed_expandable hashed_expandable; | |
173 | struct dictionary_linear linear; | |
174 | struct dictionary_linear_expandable linear_expandable; | |
175 | } | |
176 | data; | |
177 | }; | |
178 | ||
179 | /* Accessor macros. */ | |
180 | ||
181 | #define DICT_VECTOR(d) (d)->vector | |
182 | ||
183 | /* These can be used for DICT_HASHED_EXPANDABLE, too. */ | |
184 | ||
185 | #define DICT_HASHED_NBUCKETS(d) (d)->data.hashed.nbuckets | |
186 | #define DICT_HASHED_BUCKETS(d) (d)->data.hashed.buckets | |
187 | #define DICT_HASHED_BUCKET(d,i) DICT_HASHED_BUCKETS (d) [i] | |
188 | ||
189 | #define DICT_HASHED_EXPANDABLE_NSYMS(d) (d)->data.hashed_expandable.nsyms | |
190 | ||
191 | /* These can be used for DICT_LINEAR_EXPANDABLEs, too. */ | |
192 | ||
193 | #define DICT_LINEAR_NSYMS(d) (d)->data.linear.nsyms | |
194 | #define DICT_LINEAR_SYMS(d) (d)->data.linear.syms | |
195 | #define DICT_LINEAR_SYM(d,i) DICT_LINEAR_SYMS (d) [i] | |
196 | ||
197 | #define DICT_LINEAR_EXPANDABLE_CAPACITY(d) \ | |
198 | (d)->data.linear_expandable.capacity | |
199 | ||
200 | /* The initial size of a DICT_*_EXPANDABLE dictionary. */ | |
201 | ||
202 | #define DICT_EXPANDABLE_INITIAL_CAPACITY 10 | |
203 | ||
204 | /* This calculates the number of buckets we'll use in a hashtable, | |
205 | given the number of symbols that it will contain. */ | |
206 | ||
207 | #define DICT_HASHTABLE_SIZE(n) ((n)/5 + 1) | |
208 | ||
209 | /* Accessor macros for dict_iterators; they're here rather than | |
210 | dictionary.h because code elsewhere should treat dict_iterators as | |
211 | opaque. */ | |
212 | ||
213 | /* The dictionary that the iterator is associated to. */ | |
214 | #define DICT_ITERATOR_DICT(iter) (iter)->dict | |
215 | /* For linear dictionaries, the index of the last symbol returned; for | |
216 | hashed dictionaries, the bucket of the last symbol returned. */ | |
217 | #define DICT_ITERATOR_INDEX(iter) (iter)->index | |
218 | /* For hashed dictionaries, this points to the last symbol returned; | |
219 | otherwise, this is unused. */ | |
220 | #define DICT_ITERATOR_CURRENT(iter) (iter)->current | |
221 | ||
222 | /* Declarations of functions for vectors. */ | |
223 | ||
224 | /* Functions that might work across a range of dictionary types. */ | |
225 | ||
226 | static void add_symbol_nonexpandable (struct dictionary *dict, | |
227 | struct symbol *sym); | |
228 | ||
229 | static void free_obstack (struct dictionary *dict); | |
230 | ||
231 | /* Functions for DICT_HASHED and DICT_HASHED_EXPANDABLE | |
232 | dictionaries. */ | |
233 | ||
234 | static struct symbol *iterator_first_hashed (const struct dictionary *dict, | |
235 | struct dict_iterator *iterator); | |
236 | ||
237 | static struct symbol *iterator_next_hashed (struct dict_iterator *iterator); | |
238 | ||
c4d840bd PH |
239 | static struct symbol *iter_match_first_hashed (const struct dictionary *dict, |
240 | const char *name, | |
2edb89d3 | 241 | symbol_compare_ftype *compare, |
de4f826b DC |
242 | struct dict_iterator *iterator); |
243 | ||
c4d840bd | 244 | static struct symbol *iter_match_next_hashed (const char *name, |
2edb89d3 | 245 | symbol_compare_ftype *compare, |
c4d840bd PH |
246 | struct dict_iterator *iterator); |
247 | ||
248 | static unsigned int dict_hash (const char *string); | |
de4f826b DC |
249 | |
250 | /* Functions only for DICT_HASHED. */ | |
251 | ||
252 | static int size_hashed (const struct dictionary *dict); | |
253 | ||
254 | /* Functions only for DICT_HASHED_EXPANDABLE. */ | |
255 | ||
256 | static void free_hashed_expandable (struct dictionary *dict); | |
257 | ||
258 | static void add_symbol_hashed_expandable (struct dictionary *dict, | |
259 | struct symbol *sym); | |
260 | ||
261 | static int size_hashed_expandable (const struct dictionary *dict); | |
262 | ||
263 | /* Functions for DICT_LINEAR and DICT_LINEAR_EXPANDABLE | |
264 | dictionaries. */ | |
265 | ||
266 | static struct symbol *iterator_first_linear (const struct dictionary *dict, | |
267 | struct dict_iterator *iterator); | |
268 | ||
269 | static struct symbol *iterator_next_linear (struct dict_iterator *iterator); | |
270 | ||
c4d840bd PH |
271 | static struct symbol *iter_match_first_linear (const struct dictionary *dict, |
272 | const char *name, | |
2edb89d3 | 273 | symbol_compare_ftype *compare, |
c4d840bd | 274 | struct dict_iterator *iterator); |
de4f826b | 275 | |
c4d840bd | 276 | static struct symbol *iter_match_next_linear (const char *name, |
2edb89d3 | 277 | symbol_compare_ftype *compare, |
c4d840bd | 278 | struct dict_iterator *iterator); |
de4f826b DC |
279 | |
280 | static int size_linear (const struct dictionary *dict); | |
281 | ||
282 | /* Functions only for DICT_LINEAR_EXPANDABLE. */ | |
283 | ||
284 | static void free_linear_expandable (struct dictionary *dict); | |
285 | ||
286 | static void add_symbol_linear_expandable (struct dictionary *dict, | |
287 | struct symbol *sym); | |
288 | ||
289 | /* Various vectors that we'll actually use. */ | |
290 | ||
291 | static const struct dict_vector dict_hashed_vector = | |
292 | { | |
293 | DICT_HASHED, /* type */ | |
294 | free_obstack, /* free */ | |
295 | add_symbol_nonexpandable, /* add_symbol */ | |
a11a1416 | 296 | iterator_first_hashed, /* iterator_first */ |
de4f826b | 297 | iterator_next_hashed, /* iterator_next */ |
c4d840bd PH |
298 | iter_match_first_hashed, /* iter_name_first */ |
299 | iter_match_next_hashed, /* iter_name_next */ | |
de4f826b DC |
300 | size_hashed, /* size */ |
301 | }; | |
302 | ||
303 | static const struct dict_vector dict_hashed_expandable_vector = | |
304 | { | |
305 | DICT_HASHED_EXPANDABLE, /* type */ | |
306 | free_hashed_expandable, /* free */ | |
307 | add_symbol_hashed_expandable, /* add_symbol */ | |
a11a1416 | 308 | iterator_first_hashed, /* iterator_first */ |
de4f826b | 309 | iterator_next_hashed, /* iterator_next */ |
c4d840bd PH |
310 | iter_match_first_hashed, /* iter_name_first */ |
311 | iter_match_next_hashed, /* iter_name_next */ | |
de4f826b DC |
312 | size_hashed_expandable, /* size */ |
313 | }; | |
314 | ||
315 | static const struct dict_vector dict_linear_vector = | |
316 | { | |
317 | DICT_LINEAR, /* type */ | |
318 | free_obstack, /* free */ | |
319 | add_symbol_nonexpandable, /* add_symbol */ | |
a11a1416 | 320 | iterator_first_linear, /* iterator_first */ |
de4f826b | 321 | iterator_next_linear, /* iterator_next */ |
c4d840bd PH |
322 | iter_match_first_linear, /* iter_name_first */ |
323 | iter_match_next_linear, /* iter_name_next */ | |
de4f826b DC |
324 | size_linear, /* size */ |
325 | }; | |
326 | ||
327 | static const struct dict_vector dict_linear_expandable_vector = | |
328 | { | |
329 | DICT_LINEAR_EXPANDABLE, /* type */ | |
330 | free_linear_expandable, /* free */ | |
331 | add_symbol_linear_expandable, /* add_symbol */ | |
a11a1416 | 332 | iterator_first_linear, /* iterator_first */ |
de4f826b | 333 | iterator_next_linear, /* iterator_next */ |
c4d840bd PH |
334 | iter_match_first_linear, /* iter_name_first */ |
335 | iter_match_next_linear, /* iter_name_next */ | |
de4f826b DC |
336 | size_linear, /* size */ |
337 | }; | |
338 | ||
339 | /* Declarations of helper functions (i.e. ones that don't go into | |
340 | vectors). */ | |
341 | ||
342 | static struct symbol *iterator_hashed_advance (struct dict_iterator *iter); | |
343 | ||
344 | static void insert_symbol_hashed (struct dictionary *dict, | |
345 | struct symbol *sym); | |
346 | ||
347 | static void expand_hashtable (struct dictionary *dict); | |
348 | ||
349 | /* The creation functions. */ | |
350 | ||
351 | /* Create a dictionary implemented via a fixed-size hashtable. All | |
352 | memory it uses is allocated on OBSTACK; the environment is | |
353 | initialized from SYMBOL_LIST. */ | |
354 | ||
355 | struct dictionary * | |
356 | dict_create_hashed (struct obstack *obstack, | |
357 | const struct pending *symbol_list) | |
358 | { | |
359 | struct dictionary *retval; | |
360 | int nsyms = 0, nbuckets, i; | |
361 | struct symbol **buckets; | |
362 | const struct pending *list_counter; | |
363 | ||
8d749320 | 364 | retval = XOBNEW (obstack, struct dictionary); |
de4f826b DC |
365 | DICT_VECTOR (retval) = &dict_hashed_vector; |
366 | ||
367 | /* Calculate the number of symbols, and allocate space for them. */ | |
368 | for (list_counter = symbol_list; | |
369 | list_counter != NULL; | |
370 | list_counter = list_counter->next) | |
371 | { | |
372 | nsyms += list_counter->nsyms; | |
373 | } | |
374 | nbuckets = DICT_HASHTABLE_SIZE (nsyms); | |
375 | DICT_HASHED_NBUCKETS (retval) = nbuckets; | |
8d749320 | 376 | buckets = XOBNEWVEC (obstack, struct symbol *, nbuckets); |
de4f826b DC |
377 | memset (buckets, 0, nbuckets * sizeof (struct symbol *)); |
378 | DICT_HASHED_BUCKETS (retval) = buckets; | |
379 | ||
380 | /* Now fill the buckets. */ | |
381 | for (list_counter = symbol_list; | |
382 | list_counter != NULL; | |
383 | list_counter = list_counter->next) | |
384 | { | |
385 | for (i = list_counter->nsyms - 1; i >= 0; --i) | |
386 | { | |
387 | insert_symbol_hashed (retval, list_counter->symbol[i]); | |
388 | } | |
389 | } | |
390 | ||
391 | return retval; | |
392 | } | |
393 | ||
394 | /* Create a dictionary implemented via a hashtable that grows as | |
395 | necessary. The dictionary is initially empty; to add symbols to | |
396 | it, call dict_add_symbol(). Call dict_free() when you're done with | |
397 | it. */ | |
398 | ||
399 | extern struct dictionary * | |
400 | dict_create_hashed_expandable (void) | |
401 | { | |
8d749320 | 402 | struct dictionary *retval = XNEW (struct dictionary); |
de4f826b | 403 | |
de4f826b DC |
404 | DICT_VECTOR (retval) = &dict_hashed_expandable_vector; |
405 | DICT_HASHED_NBUCKETS (retval) = DICT_EXPANDABLE_INITIAL_CAPACITY; | |
406 | DICT_HASHED_BUCKETS (retval) = xcalloc (DICT_EXPANDABLE_INITIAL_CAPACITY, | |
407 | sizeof (struct symbol *)); | |
408 | DICT_HASHED_EXPANDABLE_NSYMS (retval) = 0; | |
409 | ||
410 | return retval; | |
411 | } | |
412 | ||
413 | /* Create a dictionary implemented via a fixed-size array. All memory | |
414 | it uses is allocated on OBSTACK; the environment is initialized | |
415 | from the SYMBOL_LIST. The symbols are ordered in the same order | |
416 | that they're found in SYMBOL_LIST. */ | |
417 | ||
418 | struct dictionary * | |
419 | dict_create_linear (struct obstack *obstack, | |
420 | const struct pending *symbol_list) | |
421 | { | |
422 | struct dictionary *retval; | |
423 | int nsyms = 0, i, j; | |
424 | struct symbol **syms; | |
425 | const struct pending *list_counter; | |
426 | ||
8d749320 | 427 | retval = XOBNEW (obstack, struct dictionary); |
de4f826b DC |
428 | DICT_VECTOR (retval) = &dict_linear_vector; |
429 | ||
430 | /* Calculate the number of symbols, and allocate space for them. */ | |
431 | for (list_counter = symbol_list; | |
432 | list_counter != NULL; | |
433 | list_counter = list_counter->next) | |
434 | { | |
435 | nsyms += list_counter->nsyms; | |
436 | } | |
437 | DICT_LINEAR_NSYMS (retval) = nsyms; | |
8d749320 | 438 | syms = XOBNEWVEC (obstack, struct symbol *, nsyms ); |
de4f826b DC |
439 | DICT_LINEAR_SYMS (retval) = syms; |
440 | ||
441 | /* Now fill in the symbols. Start filling in from the back, so as | |
442 | to preserve the original order of the symbols. */ | |
443 | for (list_counter = symbol_list, j = nsyms - 1; | |
444 | list_counter != NULL; | |
445 | list_counter = list_counter->next) | |
446 | { | |
447 | for (i = list_counter->nsyms - 1; | |
448 | i >= 0; | |
449 | --i, --j) | |
450 | { | |
451 | syms[j] = list_counter->symbol[i]; | |
452 | } | |
453 | } | |
454 | ||
455 | return retval; | |
456 | } | |
457 | ||
458 | /* Create a dictionary implemented via an array that grows as | |
459 | necessary. The dictionary is initially empty; to add symbols to | |
460 | it, call dict_add_symbol(). Call dict_free() when you're done with | |
461 | it. */ | |
462 | ||
463 | struct dictionary * | |
464 | dict_create_linear_expandable (void) | |
465 | { | |
8d749320 | 466 | struct dictionary *retval = XNEW (struct dictionary); |
de4f826b | 467 | |
de4f826b DC |
468 | DICT_VECTOR (retval) = &dict_linear_expandable_vector; |
469 | DICT_LINEAR_NSYMS (retval) = 0; | |
470 | DICT_LINEAR_EXPANDABLE_CAPACITY (retval) | |
471 | = DICT_EXPANDABLE_INITIAL_CAPACITY; | |
472 | DICT_LINEAR_SYMS (retval) | |
473 | = xmalloc (DICT_LINEAR_EXPANDABLE_CAPACITY (retval) | |
474 | * sizeof (struct symbol *)); | |
475 | ||
476 | return retval; | |
477 | } | |
478 | ||
479 | /* The functions providing the dictionary interface. */ | |
480 | ||
481 | /* Free the memory used by a dictionary that's not on an obstack. (If | |
482 | any.) */ | |
483 | ||
484 | void | |
485 | dict_free (struct dictionary *dict) | |
486 | { | |
487 | (DICT_VECTOR (dict))->free (dict); | |
488 | } | |
489 | ||
490 | /* Add SYM to DICT. DICT had better be expandable. */ | |
491 | ||
492 | void | |
493 | dict_add_symbol (struct dictionary *dict, struct symbol *sym) | |
494 | { | |
495 | (DICT_VECTOR (dict))->add_symbol (dict, sym); | |
496 | } | |
497 | ||
0bfa869d DE |
498 | /* Utility to add a list of symbols to a dictionary. |
499 | DICT must be an expandable dictionary. */ | |
500 | ||
501 | void | |
502 | dict_add_pending (struct dictionary *dict, const struct pending *symbol_list) | |
503 | { | |
504 | const struct pending *list; | |
505 | int i; | |
506 | ||
507 | for (list = symbol_list; list != NULL; list = list->next) | |
508 | { | |
509 | for (i = 0; i < list->nsyms; ++i) | |
510 | dict_add_symbol (dict, list->symbol[i]); | |
511 | } | |
512 | } | |
513 | ||
de4f826b DC |
514 | /* Initialize ITERATOR to point at the first symbol in DICT, and |
515 | return that first symbol, or NULL if DICT is empty. */ | |
516 | ||
517 | struct symbol * | |
518 | dict_iterator_first (const struct dictionary *dict, | |
519 | struct dict_iterator *iterator) | |
520 | { | |
521 | return (DICT_VECTOR (dict))->iterator_first (dict, iterator); | |
522 | } | |
523 | ||
524 | /* Advance ITERATOR, and return the next symbol, or NULL if there are | |
525 | no more symbols. */ | |
526 | ||
527 | struct symbol * | |
528 | dict_iterator_next (struct dict_iterator *iterator) | |
529 | { | |
530 | return (DICT_VECTOR (DICT_ITERATOR_DICT (iterator))) | |
531 | ->iterator_next (iterator); | |
532 | } | |
533 | ||
534 | struct symbol * | |
535 | dict_iter_name_first (const struct dictionary *dict, | |
536 | const char *name, | |
537 | struct dict_iterator *iterator) | |
538 | { | |
c4d840bd | 539 | return dict_iter_match_first (dict, name, strcmp_iw, iterator); |
de4f826b DC |
540 | } |
541 | ||
542 | struct symbol * | |
543 | dict_iter_name_next (const char *name, struct dict_iterator *iterator) | |
c4d840bd PH |
544 | { |
545 | return dict_iter_match_next (name, strcmp_iw, iterator); | |
546 | } | |
547 | ||
548 | struct symbol * | |
549 | dict_iter_match_first (const struct dictionary *dict, | |
2edb89d3 | 550 | const char *name, symbol_compare_ftype *compare, |
c4d840bd PH |
551 | struct dict_iterator *iterator) |
552 | { | |
3e43a32a MS |
553 | return (DICT_VECTOR (dict))->iter_match_first (dict, name, |
554 | compare, iterator); | |
c4d840bd PH |
555 | } |
556 | ||
557 | struct symbol * | |
2edb89d3 | 558 | dict_iter_match_next (const char *name, symbol_compare_ftype *compare, |
c4d840bd | 559 | struct dict_iterator *iterator) |
de4f826b DC |
560 | { |
561 | return (DICT_VECTOR (DICT_ITERATOR_DICT (iterator))) | |
c4d840bd | 562 | ->iter_match_next (name, compare, iterator); |
de4f826b DC |
563 | } |
564 | ||
565 | int | |
566 | dict_size (const struct dictionary *dict) | |
567 | { | |
568 | return (DICT_VECTOR (dict))->size (dict); | |
569 | } | |
570 | ||
571 | /* Now come functions (well, one function, currently) that are | |
572 | implemented generically by means of the vtable. Typically, they're | |
573 | rarely used. */ | |
574 | ||
575 | /* Test to see if DICT is empty. */ | |
576 | ||
577 | int | |
578 | dict_empty (struct dictionary *dict) | |
579 | { | |
580 | struct dict_iterator iter; | |
581 | ||
582 | return (dict_iterator_first (dict, &iter) == NULL); | |
583 | } | |
584 | ||
585 | ||
586 | /* The functions implementing the dictionary interface. */ | |
587 | ||
588 | /* Generic functions, where appropriate. */ | |
589 | ||
590 | static void | |
591 | free_obstack (struct dictionary *dict) | |
592 | { | |
593 | /* Do nothing! */ | |
594 | } | |
595 | ||
596 | static void | |
597 | add_symbol_nonexpandable (struct dictionary *dict, struct symbol *sym) | |
598 | { | |
599 | internal_error (__FILE__, __LINE__, | |
e2e0b3e5 | 600 | _("dict_add_symbol: non-expandable dictionary")); |
de4f826b DC |
601 | } |
602 | ||
603 | /* Functions for DICT_HASHED and DICT_HASHED_EXPANDABLE. */ | |
604 | ||
605 | static struct symbol * | |
606 | iterator_first_hashed (const struct dictionary *dict, | |
607 | struct dict_iterator *iterator) | |
608 | { | |
609 | DICT_ITERATOR_DICT (iterator) = dict; | |
610 | DICT_ITERATOR_INDEX (iterator) = -1; | |
611 | return iterator_hashed_advance (iterator); | |
612 | } | |
613 | ||
614 | static struct symbol * | |
615 | iterator_next_hashed (struct dict_iterator *iterator) | |
616 | { | |
de4f826b DC |
617 | struct symbol *next; |
618 | ||
619 | next = DICT_ITERATOR_CURRENT (iterator)->hash_next; | |
620 | ||
621 | if (next == NULL) | |
622 | return iterator_hashed_advance (iterator); | |
623 | else | |
624 | { | |
625 | DICT_ITERATOR_CURRENT (iterator) = next; | |
626 | return next; | |
627 | } | |
628 | } | |
629 | ||
630 | static struct symbol * | |
631 | iterator_hashed_advance (struct dict_iterator *iterator) | |
632 | { | |
633 | const struct dictionary *dict = DICT_ITERATOR_DICT (iterator); | |
634 | int nbuckets = DICT_HASHED_NBUCKETS (dict); | |
635 | int i; | |
636 | ||
637 | for (i = DICT_ITERATOR_INDEX (iterator) + 1; i < nbuckets; ++i) | |
638 | { | |
639 | struct symbol *sym = DICT_HASHED_BUCKET (dict, i); | |
640 | ||
641 | if (sym != NULL) | |
642 | { | |
643 | DICT_ITERATOR_INDEX (iterator) = i; | |
644 | DICT_ITERATOR_CURRENT (iterator) = sym; | |
645 | return sym; | |
646 | } | |
647 | } | |
648 | ||
649 | return NULL; | |
650 | } | |
651 | ||
652 | static struct symbol * | |
2edb89d3 JK |
653 | iter_match_first_hashed (const struct dictionary *dict, const char *name, |
654 | symbol_compare_ftype *compare, | |
c4d840bd | 655 | struct dict_iterator *iterator) |
de4f826b | 656 | { |
c4d840bd | 657 | unsigned int hash_index = dict_hash (name) % DICT_HASHED_NBUCKETS (dict); |
de4f826b DC |
658 | struct symbol *sym; |
659 | ||
660 | DICT_ITERATOR_DICT (iterator) = dict; | |
661 | ||
662 | /* Loop through the symbols in the given bucket, breaking when SYM | |
663 | first matches. If SYM never matches, it will be set to NULL; | |
664 | either way, we have the right return value. */ | |
665 | ||
666 | for (sym = DICT_HASHED_BUCKET (dict, hash_index); | |
667 | sym != NULL; | |
668 | sym = sym->hash_next) | |
669 | { | |
c4d840bd PH |
670 | /* Warning: the order of arguments to compare matters! */ |
671 | if (compare (SYMBOL_SEARCH_NAME (sym), name) == 0) | |
de4f826b DC |
672 | { |
673 | break; | |
674 | } | |
675 | ||
676 | } | |
677 | ||
678 | DICT_ITERATOR_CURRENT (iterator) = sym; | |
679 | return sym; | |
680 | } | |
681 | ||
682 | static struct symbol * | |
2edb89d3 | 683 | iter_match_next_hashed (const char *name, symbol_compare_ftype *compare, |
c4d840bd | 684 | struct dict_iterator *iterator) |
de4f826b DC |
685 | { |
686 | struct symbol *next; | |
687 | ||
688 | for (next = DICT_ITERATOR_CURRENT (iterator)->hash_next; | |
689 | next != NULL; | |
690 | next = next->hash_next) | |
691 | { | |
c4d840bd | 692 | if (compare (SYMBOL_SEARCH_NAME (next), name) == 0) |
de4f826b DC |
693 | break; |
694 | } | |
695 | ||
696 | DICT_ITERATOR_CURRENT (iterator) = next; | |
697 | ||
698 | return next; | |
699 | } | |
700 | ||
701 | /* Insert SYM into DICT. */ | |
702 | ||
703 | static void | |
704 | insert_symbol_hashed (struct dictionary *dict, | |
705 | struct symbol *sym) | |
706 | { | |
707 | unsigned int hash_index; | |
708 | struct symbol **buckets = DICT_HASHED_BUCKETS (dict); | |
709 | ||
c4d840bd PH |
710 | hash_index = |
711 | dict_hash (SYMBOL_SEARCH_NAME (sym)) % DICT_HASHED_NBUCKETS (dict); | |
de4f826b DC |
712 | sym->hash_next = buckets[hash_index]; |
713 | buckets[hash_index] = sym; | |
714 | } | |
715 | ||
716 | static int | |
717 | size_hashed (const struct dictionary *dict) | |
718 | { | |
719 | return DICT_HASHED_NBUCKETS (dict); | |
720 | } | |
721 | ||
722 | /* Functions only for DICT_HASHED_EXPANDABLE. */ | |
723 | ||
724 | static void | |
725 | free_hashed_expandable (struct dictionary *dict) | |
726 | { | |
727 | xfree (DICT_HASHED_BUCKETS (dict)); | |
728 | xfree (dict); | |
729 | } | |
730 | ||
731 | static void | |
732 | add_symbol_hashed_expandable (struct dictionary *dict, | |
733 | struct symbol *sym) | |
734 | { | |
735 | int nsyms = ++DICT_HASHED_EXPANDABLE_NSYMS (dict); | |
736 | ||
737 | if (DICT_HASHTABLE_SIZE (nsyms) > DICT_HASHED_NBUCKETS (dict)) | |
738 | expand_hashtable (dict); | |
739 | ||
740 | insert_symbol_hashed (dict, sym); | |
741 | DICT_HASHED_EXPANDABLE_NSYMS (dict) = nsyms; | |
742 | } | |
743 | ||
744 | static int | |
745 | size_hashed_expandable (const struct dictionary *dict) | |
746 | { | |
747 | return DICT_HASHED_EXPANDABLE_NSYMS (dict); | |
748 | } | |
749 | ||
750 | static void | |
751 | expand_hashtable (struct dictionary *dict) | |
752 | { | |
753 | int old_nbuckets = DICT_HASHED_NBUCKETS (dict); | |
754 | struct symbol **old_buckets = DICT_HASHED_BUCKETS (dict); | |
755 | int new_nbuckets = 2*old_nbuckets + 1; | |
756 | struct symbol **new_buckets = xcalloc (new_nbuckets, | |
757 | sizeof (struct symbol *)); | |
758 | int i; | |
759 | ||
760 | DICT_HASHED_NBUCKETS (dict) = new_nbuckets; | |
761 | DICT_HASHED_BUCKETS (dict) = new_buckets; | |
762 | ||
6595d32b MS |
763 | for (i = 0; i < old_nbuckets; ++i) |
764 | { | |
765 | struct symbol *sym, *next_sym; | |
766 | ||
767 | sym = old_buckets[i]; | |
768 | if (sym != NULL) | |
769 | { | |
770 | for (next_sym = sym->hash_next; | |
771 | next_sym != NULL; | |
772 | next_sym = sym->hash_next) | |
773 | { | |
774 | insert_symbol_hashed (dict, sym); | |
775 | sym = next_sym; | |
776 | } | |
777 | ||
778 | insert_symbol_hashed (dict, sym); | |
779 | } | |
de4f826b | 780 | } |
de4f826b DC |
781 | |
782 | xfree (old_buckets); | |
783 | } | |
784 | ||
c4d840bd PH |
785 | /* Produce an unsigned hash value from STRING0 that is consistent |
786 | with strcmp_iw, strcmp, and, at least on Ada symbols, wild_match. | |
787 | That is, two identifiers equivalent according to any of those three | |
788 | comparison operators hash to the same value. */ | |
789 | ||
790 | static unsigned int | |
1d2a4540 | 791 | dict_hash (const char *string0) |
c4d840bd PH |
792 | { |
793 | /* The Ada-encoded version of a name P1.P2...Pn has either the form | |
794 | P1__P2__...Pn<suffix> or _ada_P1__P2__...Pn<suffix> (where the Pi | |
795 | are lower-cased identifiers). The <suffix> (which can be empty) | |
796 | encodes additional information about the denoted entity. This | |
797 | routine hashes such names to msymbol_hash_iw(Pn). It actually | |
798 | does this for a superset of both valid Pi and of <suffix>, but | |
799 | in other cases it simply returns msymbol_hash_iw(STRING0). */ | |
800 | ||
1d2a4540 | 801 | const char *string; |
c4d840bd | 802 | unsigned int hash; |
c4d840bd | 803 | |
1d2a4540 PH |
804 | string = string0; |
805 | if (*string == '_') | |
806 | { | |
61012eef | 807 | if (startswith (string, "_ada_")) |
1d2a4540 PH |
808 | string += 5; |
809 | else | |
810 | return msymbol_hash_iw (string0); | |
811 | } | |
c4d840bd PH |
812 | |
813 | hash = 0; | |
814 | while (*string) | |
815 | { | |
9ac7f98e JB |
816 | /* Ignore "TKB" suffixes. |
817 | ||
818 | These are used by Ada for subprograms implementing a task body. | |
819 | For instance for a task T inside package Pck, the name of the | |
820 | subprogram implementing T's body is `pck__tTKB'. We need to | |
821 | ignore the "TKB" suffix because searches for this task body | |
822 | subprogram are going to be performed using `pck__t' (the encoded | |
823 | version of the natural name `pck.t'). */ | |
824 | if (strcmp (string, "TKB") == 0) | |
825 | return hash; | |
826 | ||
c4d840bd PH |
827 | switch (*string) |
828 | { | |
829 | case '$': | |
830 | case '.': | |
831 | case 'X': | |
1d2a4540 PH |
832 | if (string0 == string) |
833 | return msymbol_hash_iw (string0); | |
834 | else | |
835 | return hash; | |
c4d840bd | 836 | case ' ': |
1d2a4540 PH |
837 | case '(': |
838 | return msymbol_hash_iw (string0); | |
c4d840bd | 839 | case '_': |
1d2a4540 | 840 | if (string[1] == '_' && string != string0) |
c4d840bd | 841 | { |
558b1900 JB |
842 | int c = string[2]; |
843 | ||
844 | if ((c < 'a' || c > 'z') && c != 'O') | |
c4d840bd PH |
845 | return hash; |
846 | hash = 0; | |
847 | string += 2; | |
848 | break; | |
849 | } | |
850 | /* FALL THROUGH */ | |
851 | default: | |
59d7bcaf | 852 | hash = SYMBOL_HASH_NEXT (hash, *string); |
c4d840bd PH |
853 | string += 1; |
854 | break; | |
855 | } | |
856 | } | |
857 | return hash; | |
858 | } | |
859 | ||
de4f826b DC |
860 | /* Functions for DICT_LINEAR and DICT_LINEAR_EXPANDABLE. */ |
861 | ||
862 | static struct symbol * | |
863 | iterator_first_linear (const struct dictionary *dict, | |
864 | struct dict_iterator *iterator) | |
865 | { | |
866 | DICT_ITERATOR_DICT (iterator) = dict; | |
867 | DICT_ITERATOR_INDEX (iterator) = 0; | |
868 | return DICT_LINEAR_NSYMS (dict) ? DICT_LINEAR_SYM (dict, 0) : NULL; | |
869 | } | |
870 | ||
871 | static struct symbol * | |
872 | iterator_next_linear (struct dict_iterator *iterator) | |
873 | { | |
874 | const struct dictionary *dict = DICT_ITERATOR_DICT (iterator); | |
875 | ||
876 | if (++DICT_ITERATOR_INDEX (iterator) >= DICT_LINEAR_NSYMS (dict)) | |
877 | return NULL; | |
878 | else | |
879 | return DICT_LINEAR_SYM (dict, DICT_ITERATOR_INDEX (iterator)); | |
880 | } | |
881 | ||
882 | static struct symbol * | |
c4d840bd | 883 | iter_match_first_linear (const struct dictionary *dict, |
2edb89d3 | 884 | const char *name, symbol_compare_ftype *compare, |
c4d840bd | 885 | struct dict_iterator *iterator) |
de4f826b DC |
886 | { |
887 | DICT_ITERATOR_DICT (iterator) = dict; | |
888 | DICT_ITERATOR_INDEX (iterator) = -1; | |
889 | ||
c4d840bd | 890 | return iter_match_next_linear (name, compare, iterator); |
de4f826b DC |
891 | } |
892 | ||
893 | static struct symbol * | |
2edb89d3 | 894 | iter_match_next_linear (const char *name, symbol_compare_ftype *compare, |
c4d840bd | 895 | struct dict_iterator *iterator) |
de4f826b DC |
896 | { |
897 | const struct dictionary *dict = DICT_ITERATOR_DICT (iterator); | |
898 | int i, nsyms = DICT_LINEAR_NSYMS (dict); | |
899 | struct symbol *sym, *retval = NULL; | |
900 | ||
901 | for (i = DICT_ITERATOR_INDEX (iterator) + 1; i < nsyms; ++i) | |
902 | { | |
903 | sym = DICT_LINEAR_SYM (dict, i); | |
c4d840bd | 904 | if (compare (SYMBOL_SEARCH_NAME (sym), name) == 0) |
de4f826b DC |
905 | { |
906 | retval = sym; | |
907 | break; | |
908 | } | |
909 | } | |
910 | ||
911 | DICT_ITERATOR_INDEX (iterator) = i; | |
912 | ||
913 | return retval; | |
914 | } | |
915 | ||
916 | static int | |
917 | size_linear (const struct dictionary *dict) | |
918 | { | |
919 | return DICT_LINEAR_NSYMS (dict); | |
920 | } | |
921 | ||
922 | /* Functions only for DICT_LINEAR_EXPANDABLE. */ | |
923 | ||
924 | static void | |
925 | free_linear_expandable (struct dictionary *dict) | |
926 | { | |
927 | xfree (DICT_LINEAR_SYMS (dict)); | |
928 | xfree (dict); | |
929 | } | |
930 | ||
931 | ||
932 | static void | |
933 | add_symbol_linear_expandable (struct dictionary *dict, | |
934 | struct symbol *sym) | |
935 | { | |
936 | int nsyms = ++DICT_LINEAR_NSYMS (dict); | |
937 | ||
938 | /* Do we have enough room? If not, grow it. */ | |
6595d32b MS |
939 | if (nsyms > DICT_LINEAR_EXPANDABLE_CAPACITY (dict)) |
940 | { | |
941 | DICT_LINEAR_EXPANDABLE_CAPACITY (dict) *= 2; | |
942 | DICT_LINEAR_SYMS (dict) | |
943 | = xrealloc (DICT_LINEAR_SYMS (dict), | |
944 | DICT_LINEAR_EXPANDABLE_CAPACITY (dict) | |
945 | * sizeof (struct symbol *)); | |
946 | } | |
de4f826b DC |
947 | |
948 | DICT_LINEAR_SYM (dict, nsyms - 1) = sym; | |
949 | } |