Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Symbol table lookup for the GNU debugger, GDB. |
8926118c | 2 | |
618f726f | 3 | Copyright (C) 1986-2016 Free Software Foundation, Inc. |
c906108c | 4 | |
c5aa993b | 5 | This file is part of GDB. |
c906108c | 6 | |
c5aa993b JM |
7 | This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 10 | (at your option) any later version. |
c906108c | 11 | |
c5aa993b JM |
12 | This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
c906108c | 16 | |
c5aa993b | 17 | You should have received a copy of the GNU General Public License |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
19 | |
20 | #include "defs.h" | |
21 | #include "symtab.h" | |
22 | #include "gdbtypes.h" | |
23 | #include "gdbcore.h" | |
24 | #include "frame.h" | |
25 | #include "target.h" | |
26 | #include "value.h" | |
27 | #include "symfile.h" | |
28 | #include "objfiles.h" | |
29 | #include "gdbcmd.h" | |
88987551 | 30 | #include "gdb_regex.h" |
c906108c SS |
31 | #include "expression.h" |
32 | #include "language.h" | |
33 | #include "demangle.h" | |
34 | #include "inferior.h" | |
0378c332 | 35 | #include "source.h" |
a7fdf62f | 36 | #include "filenames.h" /* for FILENAME_CMP */ |
1bae87b9 | 37 | #include "objc-lang.h" |
6aecb9c2 | 38 | #include "d-lang.h" |
1f8173e6 | 39 | #include "ada-lang.h" |
a766d390 | 40 | #include "go-lang.h" |
cd6c7346 | 41 | #include "p-lang.h" |
ff013f42 | 42 | #include "addrmap.h" |
529480d0 | 43 | #include "cli/cli-utils.h" |
cce0e923 | 44 | #include "fnmatch.h" |
2de7ced7 DJ |
45 | #include "hashtab.h" |
46 | ||
04ea0df1 | 47 | #include "gdb_obstack.h" |
fe898f56 | 48 | #include "block.h" |
de4f826b | 49 | #include "dictionary.h" |
c906108c SS |
50 | |
51 | #include <sys/types.h> | |
52 | #include <fcntl.h> | |
53ce3c39 | 53 | #include <sys/stat.h> |
c906108c | 54 | #include <ctype.h> |
015a42b4 | 55 | #include "cp-abi.h" |
71c25dea | 56 | #include "cp-support.h" |
ea53e89f | 57 | #include "observer.h" |
3a40aaa0 | 58 | #include "solist.h" |
9a044a89 TT |
59 | #include "macrotab.h" |
60 | #include "macroscope.h" | |
c906108c | 61 | |
270140bd | 62 | #include "parser-defs.h" |
ef0b411a | 63 | #include "completer.h" |
ccefe4c4 | 64 | |
ff6c39cf | 65 | /* Forward declarations for local functions. */ |
c906108c | 66 | |
a14ed312 | 67 | static void rbreak_command (char *, int); |
c906108c | 68 | |
f8eba3c6 | 69 | static int find_line_common (struct linetable *, int, int *, int); |
c906108c | 70 | |
d12307c1 PMR |
71 | static struct block_symbol |
72 | lookup_symbol_aux (const char *name, | |
73 | const struct block *block, | |
74 | const domain_enum domain, | |
75 | enum language language, | |
76 | struct field_of_this_result *); | |
fba7f19c | 77 | |
e4051eeb | 78 | static |
d12307c1 PMR |
79 | struct block_symbol lookup_local_symbol (const char *name, |
80 | const struct block *block, | |
81 | const domain_enum domain, | |
82 | enum language language); | |
8155455b | 83 | |
d12307c1 | 84 | static struct block_symbol |
fe2a438d DE |
85 | lookup_symbol_in_objfile (struct objfile *objfile, int block_index, |
86 | const char *name, const domain_enum domain); | |
c906108c | 87 | |
b6b80672 PA |
88 | /* See symtab.h. */ |
89 | const struct block_symbol null_block_symbol = { NULL, NULL }; | |
90 | ||
ff6c39cf | 91 | extern initialize_file_ftype _initialize_symtab; |
c906108c | 92 | |
32ac0d11 TT |
93 | /* Program space key for finding name and language of "main". */ |
94 | ||
95 | static const struct program_space_data *main_progspace_key; | |
96 | ||
97 | /* Type of the data stored on the program space. */ | |
98 | ||
99 | struct main_info | |
100 | { | |
101 | /* Name of "main". */ | |
102 | ||
103 | char *name_of_main; | |
104 | ||
105 | /* Language of "main". */ | |
106 | ||
107 | enum language language_of_main; | |
108 | }; | |
109 | ||
f57d2163 DE |
110 | /* Program space key for finding its symbol cache. */ |
111 | ||
112 | static const struct program_space_data *symbol_cache_key; | |
113 | ||
114 | /* The default symbol cache size. | |
115 | There is no extra cpu cost for large N (except when flushing the cache, | |
116 | which is rare). The value here is just a first attempt. A better default | |
117 | value may be higher or lower. A prime number can make up for a bad hash | |
118 | computation, so that's why the number is what it is. */ | |
119 | #define DEFAULT_SYMBOL_CACHE_SIZE 1021 | |
120 | ||
121 | /* The maximum symbol cache size. | |
122 | There's no method to the decision of what value to use here, other than | |
123 | there's no point in allowing a user typo to make gdb consume all memory. */ | |
124 | #define MAX_SYMBOL_CACHE_SIZE (1024*1024) | |
125 | ||
126 | /* symbol_cache_lookup returns this if a previous lookup failed to find the | |
127 | symbol in any objfile. */ | |
d12307c1 PMR |
128 | #define SYMBOL_LOOKUP_FAILED \ |
129 | ((struct block_symbol) {(struct symbol *) 1, NULL}) | |
130 | #define SYMBOL_LOOKUP_FAILED_P(SIB) (SIB.symbol == (struct symbol *) 1) | |
f57d2163 DE |
131 | |
132 | /* Recording lookups that don't find the symbol is just as important, if not | |
133 | more so, than recording found symbols. */ | |
134 | ||
135 | enum symbol_cache_slot_state | |
136 | { | |
137 | SYMBOL_SLOT_UNUSED, | |
138 | SYMBOL_SLOT_NOT_FOUND, | |
139 | SYMBOL_SLOT_FOUND | |
140 | }; | |
141 | ||
52059ffd TT |
142 | struct symbol_cache_slot |
143 | { | |
144 | enum symbol_cache_slot_state state; | |
145 | ||
146 | /* The objfile that was current when the symbol was looked up. | |
147 | This is only needed for global blocks, but for simplicity's sake | |
148 | we allocate the space for both. If data shows the extra space used | |
149 | for static blocks is a problem, we can split things up then. | |
150 | ||
151 | Global blocks need cache lookup to include the objfile context because | |
152 | we need to account for gdbarch_iterate_over_objfiles_in_search_order | |
153 | which can traverse objfiles in, effectively, any order, depending on | |
154 | the current objfile, thus affecting which symbol is found. Normally, | |
155 | only the current objfile is searched first, and then the rest are | |
156 | searched in recorded order; but putting cache lookup inside | |
157 | gdbarch_iterate_over_objfiles_in_search_order would be awkward. | |
158 | Instead we just make the current objfile part of the context of | |
159 | cache lookup. This means we can record the same symbol multiple times, | |
160 | each with a different "current objfile" that was in effect when the | |
161 | lookup was saved in the cache, but cache space is pretty cheap. */ | |
162 | const struct objfile *objfile_context; | |
163 | ||
164 | union | |
165 | { | |
d12307c1 | 166 | struct block_symbol found; |
52059ffd TT |
167 | struct |
168 | { | |
169 | char *name; | |
170 | domain_enum domain; | |
171 | } not_found; | |
172 | } value; | |
173 | }; | |
174 | ||
f57d2163 DE |
175 | /* Symbols don't specify global vs static block. |
176 | So keep them in separate caches. */ | |
177 | ||
178 | struct block_symbol_cache | |
179 | { | |
180 | unsigned int hits; | |
181 | unsigned int misses; | |
182 | unsigned int collisions; | |
183 | ||
184 | /* SYMBOLS is a variable length array of this size. | |
185 | One can imagine that in general one cache (global/static) should be a | |
186 | fraction of the size of the other, but there's no data at the moment | |
187 | on which to decide. */ | |
188 | unsigned int size; | |
189 | ||
52059ffd | 190 | struct symbol_cache_slot symbols[1]; |
f57d2163 DE |
191 | }; |
192 | ||
193 | /* The symbol cache. | |
194 | ||
195 | Searching for symbols in the static and global blocks over multiple objfiles | |
196 | again and again can be slow, as can searching very big objfiles. This is a | |
197 | simple cache to improve symbol lookup performance, which is critical to | |
198 | overall gdb performance. | |
199 | ||
200 | Symbols are hashed on the name, its domain, and block. | |
201 | They are also hashed on their objfile for objfile-specific lookups. */ | |
202 | ||
203 | struct symbol_cache | |
204 | { | |
205 | struct block_symbol_cache *global_symbols; | |
206 | struct block_symbol_cache *static_symbols; | |
207 | }; | |
208 | ||
45cfd468 | 209 | /* When non-zero, print debugging messages related to symtab creation. */ |
db0fec5c | 210 | unsigned int symtab_create_debug = 0; |
45cfd468 | 211 | |
cc485e62 DE |
212 | /* When non-zero, print debugging messages related to symbol lookup. */ |
213 | unsigned int symbol_lookup_debug = 0; | |
214 | ||
f57d2163 DE |
215 | /* The size of the cache is staged here. */ |
216 | static unsigned int new_symbol_cache_size = DEFAULT_SYMBOL_CACHE_SIZE; | |
217 | ||
218 | /* The current value of the symbol cache size. | |
219 | This is saved so that if the user enters a value too big we can restore | |
220 | the original value from here. */ | |
221 | static unsigned int symbol_cache_size = DEFAULT_SYMBOL_CACHE_SIZE; | |
222 | ||
c011a4f4 DE |
223 | /* Non-zero if a file may be known by two different basenames. |
224 | This is the uncommon case, and significantly slows down gdb. | |
225 | Default set to "off" to not slow down the common case. */ | |
226 | int basenames_may_differ = 0; | |
227 | ||
717d2f5a JB |
228 | /* Allow the user to configure the debugger behavior with respect |
229 | to multiple-choice menus when more than one symbol matches during | |
230 | a symbol lookup. */ | |
231 | ||
7fc830e2 MK |
232 | const char multiple_symbols_ask[] = "ask"; |
233 | const char multiple_symbols_all[] = "all"; | |
234 | const char multiple_symbols_cancel[] = "cancel"; | |
40478521 | 235 | static const char *const multiple_symbols_modes[] = |
717d2f5a JB |
236 | { |
237 | multiple_symbols_ask, | |
238 | multiple_symbols_all, | |
239 | multiple_symbols_cancel, | |
240 | NULL | |
241 | }; | |
242 | static const char *multiple_symbols_mode = multiple_symbols_all; | |
243 | ||
244 | /* Read-only accessor to AUTO_SELECT_MODE. */ | |
245 | ||
246 | const char * | |
247 | multiple_symbols_select_mode (void) | |
248 | { | |
249 | return multiple_symbols_mode; | |
250 | } | |
251 | ||
20c681d1 DE |
252 | /* Return the name of a domain_enum. */ |
253 | ||
254 | const char * | |
255 | domain_name (domain_enum e) | |
256 | { | |
257 | switch (e) | |
258 | { | |
259 | case UNDEF_DOMAIN: return "UNDEF_DOMAIN"; | |
260 | case VAR_DOMAIN: return "VAR_DOMAIN"; | |
261 | case STRUCT_DOMAIN: return "STRUCT_DOMAIN"; | |
540feddf | 262 | case MODULE_DOMAIN: return "MODULE_DOMAIN"; |
20c681d1 DE |
263 | case LABEL_DOMAIN: return "LABEL_DOMAIN"; |
264 | case COMMON_BLOCK_DOMAIN: return "COMMON_BLOCK_DOMAIN"; | |
265 | default: gdb_assert_not_reached ("bad domain_enum"); | |
266 | } | |
267 | } | |
268 | ||
269 | /* Return the name of a search_domain . */ | |
270 | ||
271 | const char * | |
272 | search_domain_name (enum search_domain e) | |
273 | { | |
274 | switch (e) | |
275 | { | |
276 | case VARIABLES_DOMAIN: return "VARIABLES_DOMAIN"; | |
277 | case FUNCTIONS_DOMAIN: return "FUNCTIONS_DOMAIN"; | |
278 | case TYPES_DOMAIN: return "TYPES_DOMAIN"; | |
279 | case ALL_DOMAIN: return "ALL_DOMAIN"; | |
280 | default: gdb_assert_not_reached ("bad search_domain"); | |
281 | } | |
282 | } | |
283 | ||
43f3e411 | 284 | /* See symtab.h. */ |
db0fec5c | 285 | |
43f3e411 DE |
286 | struct symtab * |
287 | compunit_primary_filetab (const struct compunit_symtab *cust) | |
db0fec5c | 288 | { |
43f3e411 | 289 | gdb_assert (COMPUNIT_FILETABS (cust) != NULL); |
db0fec5c | 290 | |
43f3e411 DE |
291 | /* The primary file symtab is the first one in the list. */ |
292 | return COMPUNIT_FILETABS (cust); | |
293 | } | |
294 | ||
295 | /* See symtab.h. */ | |
296 | ||
297 | enum language | |
298 | compunit_language (const struct compunit_symtab *cust) | |
299 | { | |
300 | struct symtab *symtab = compunit_primary_filetab (cust); | |
301 | ||
302 | /* The language of the compunit symtab is the language of its primary | |
303 | source file. */ | |
304 | return SYMTAB_LANGUAGE (symtab); | |
db0fec5c DE |
305 | } |
306 | ||
4aac40c8 TT |
307 | /* See whether FILENAME matches SEARCH_NAME using the rule that we |
308 | advertise to the user. (The manual's description of linespecs | |
af529f8f JK |
309 | describes what we advertise). Returns true if they match, false |
310 | otherwise. */ | |
4aac40c8 TT |
311 | |
312 | int | |
b57a636e | 313 | compare_filenames_for_search (const char *filename, const char *search_name) |
4aac40c8 TT |
314 | { |
315 | int len = strlen (filename); | |
b57a636e | 316 | size_t search_len = strlen (search_name); |
4aac40c8 TT |
317 | |
318 | if (len < search_len) | |
319 | return 0; | |
320 | ||
321 | /* The tail of FILENAME must match. */ | |
322 | if (FILENAME_CMP (filename + len - search_len, search_name) != 0) | |
323 | return 0; | |
324 | ||
325 | /* Either the names must completely match, or the character | |
326 | preceding the trailing SEARCH_NAME segment of FILENAME must be a | |
d84fca2c JK |
327 | directory separator. |
328 | ||
af529f8f JK |
329 | The check !IS_ABSOLUTE_PATH ensures SEARCH_NAME "/dir/file.c" |
330 | cannot match FILENAME "/path//dir/file.c" - as user has requested | |
331 | absolute path. The sama applies for "c:\file.c" possibly | |
332 | incorrectly hypothetically matching "d:\dir\c:\file.c". | |
333 | ||
d84fca2c JK |
334 | The HAS_DRIVE_SPEC purpose is to make FILENAME "c:file.c" |
335 | compatible with SEARCH_NAME "file.c". In such case a compiler had | |
336 | to put the "c:file.c" name into debug info. Such compatibility | |
337 | works only on GDB built for DOS host. */ | |
4aac40c8 | 338 | return (len == search_len |
af529f8f JK |
339 | || (!IS_ABSOLUTE_PATH (search_name) |
340 | && IS_DIR_SEPARATOR (filename[len - search_len - 1])) | |
4aac40c8 TT |
341 | || (HAS_DRIVE_SPEC (filename) |
342 | && STRIP_DRIVE_SPEC (filename) == &filename[len - search_len])); | |
343 | } | |
344 | ||
cce0e923 DE |
345 | /* Same as compare_filenames_for_search, but for glob-style patterns. |
346 | Heads up on the order of the arguments. They match the order of | |
347 | compare_filenames_for_search, but it's the opposite of the order of | |
348 | arguments to gdb_filename_fnmatch. */ | |
349 | ||
350 | int | |
351 | compare_glob_filenames_for_search (const char *filename, | |
352 | const char *search_name) | |
353 | { | |
354 | /* We rely on the property of glob-style patterns with FNM_FILE_NAME that | |
355 | all /s have to be explicitly specified. */ | |
356 | int file_path_elements = count_path_elements (filename); | |
357 | int search_path_elements = count_path_elements (search_name); | |
358 | ||
359 | if (search_path_elements > file_path_elements) | |
360 | return 0; | |
361 | ||
362 | if (IS_ABSOLUTE_PATH (search_name)) | |
363 | { | |
364 | return (search_path_elements == file_path_elements | |
365 | && gdb_filename_fnmatch (search_name, filename, | |
366 | FNM_FILE_NAME | FNM_NOESCAPE) == 0); | |
367 | } | |
368 | ||
369 | { | |
370 | const char *file_to_compare | |
371 | = strip_leading_path_elements (filename, | |
372 | file_path_elements - search_path_elements); | |
373 | ||
374 | return gdb_filename_fnmatch (search_name, file_to_compare, | |
375 | FNM_FILE_NAME | FNM_NOESCAPE) == 0; | |
376 | } | |
377 | } | |
378 | ||
f8eba3c6 TT |
379 | /* Check for a symtab of a specific name by searching some symtabs. |
380 | This is a helper function for callbacks of iterate_over_symtabs. | |
c906108c | 381 | |
b2d23133 DE |
382 | If NAME is not absolute, then REAL_PATH is NULL |
383 | If NAME is absolute, then REAL_PATH is the gdb_realpath form of NAME. | |
384 | ||
f5b95b50 | 385 | The return value, NAME, REAL_PATH, CALLBACK, and DATA |
f8eba3c6 TT |
386 | are identical to the `map_symtabs_matching_filename' method of |
387 | quick_symbol_functions. | |
388 | ||
43f3e411 DE |
389 | FIRST and AFTER_LAST indicate the range of compunit symtabs to search. |
390 | Each symtab within the specified compunit symtab is also searched. | |
391 | AFTER_LAST is one past the last compunit symtab to search; NULL means to | |
f8eba3c6 TT |
392 | search until the end of the list. */ |
393 | ||
394 | int | |
395 | iterate_over_some_symtabs (const char *name, | |
f8eba3c6 TT |
396 | const char *real_path, |
397 | int (*callback) (struct symtab *symtab, | |
398 | void *data), | |
399 | void *data, | |
43f3e411 DE |
400 | struct compunit_symtab *first, |
401 | struct compunit_symtab *after_last) | |
c906108c | 402 | { |
43f3e411 DE |
403 | struct compunit_symtab *cust; |
404 | struct symtab *s; | |
c011a4f4 | 405 | const char* base_name = lbasename (name); |
1f84b619 | 406 | |
43f3e411 | 407 | for (cust = first; cust != NULL && cust != after_last; cust = cust->next) |
f079a2e5 | 408 | { |
43f3e411 | 409 | ALL_COMPUNIT_FILETABS (cust, s) |
a94e8645 | 410 | { |
43f3e411 DE |
411 | if (compare_filenames_for_search (s->filename, name)) |
412 | { | |
413 | if (callback (s, data)) | |
414 | return 1; | |
415 | continue; | |
416 | } | |
a94e8645 | 417 | |
43f3e411 DE |
418 | /* Before we invoke realpath, which can get expensive when many |
419 | files are involved, do a quick comparison of the basenames. */ | |
420 | if (! basenames_may_differ | |
421 | && FILENAME_CMP (base_name, lbasename (s->filename)) != 0) | |
422 | continue; | |
a94e8645 | 423 | |
43f3e411 | 424 | if (compare_filenames_for_search (symtab_to_fullname (s), name)) |
a94e8645 DE |
425 | { |
426 | if (callback (s, data)) | |
427 | return 1; | |
428 | continue; | |
429 | } | |
43f3e411 DE |
430 | |
431 | /* If the user gave us an absolute path, try to find the file in | |
432 | this symtab and use its absolute path. */ | |
433 | if (real_path != NULL) | |
434 | { | |
435 | const char *fullname = symtab_to_fullname (s); | |
436 | ||
437 | gdb_assert (IS_ABSOLUTE_PATH (real_path)); | |
438 | gdb_assert (IS_ABSOLUTE_PATH (name)); | |
439 | if (FILENAME_CMP (real_path, fullname) == 0) | |
440 | { | |
441 | if (callback (s, data)) | |
442 | return 1; | |
443 | continue; | |
444 | } | |
445 | } | |
a94e8645 | 446 | } |
f8eba3c6 | 447 | } |
58d370e0 | 448 | |
f8eba3c6 TT |
449 | return 0; |
450 | } | |
451 | ||
452 | /* Check for a symtab of a specific name; first in symtabs, then in | |
453 | psymtabs. *If* there is no '/' in the name, a match after a '/' | |
454 | in the symtab filename will also work. | |
455 | ||
456 | Calls CALLBACK with each symtab that is found and with the supplied | |
457 | DATA. If CALLBACK returns true, the search stops. */ | |
458 | ||
459 | void | |
460 | iterate_over_symtabs (const char *name, | |
461 | int (*callback) (struct symtab *symtab, | |
462 | void *data), | |
463 | void *data) | |
464 | { | |
f8eba3c6 TT |
465 | struct objfile *objfile; |
466 | char *real_path = NULL; | |
f8eba3c6 TT |
467 | struct cleanup *cleanups = make_cleanup (null_cleanup, NULL); |
468 | ||
469 | /* Here we are interested in canonicalizing an absolute path, not | |
470 | absolutizing a relative path. */ | |
471 | if (IS_ABSOLUTE_PATH (name)) | |
472 | { | |
f8eba3c6 TT |
473 | real_path = gdb_realpath (name); |
474 | make_cleanup (xfree, real_path); | |
af529f8f | 475 | gdb_assert (IS_ABSOLUTE_PATH (real_path)); |
f8eba3c6 TT |
476 | } |
477 | ||
478 | ALL_OBJFILES (objfile) | |
479 | { | |
f5b95b50 | 480 | if (iterate_over_some_symtabs (name, real_path, callback, data, |
43f3e411 | 481 | objfile->compunit_symtabs, NULL)) |
f8eba3c6 TT |
482 | { |
483 | do_cleanups (cleanups); | |
484 | return; | |
485 | } | |
486 | } | |
487 | ||
c906108c SS |
488 | /* Same search rules as above apply here, but now we look thru the |
489 | psymtabs. */ | |
490 | ||
ccefe4c4 TT |
491 | ALL_OBJFILES (objfile) |
492 | { | |
493 | if (objfile->sf | |
f8eba3c6 TT |
494 | && objfile->sf->qf->map_symtabs_matching_filename (objfile, |
495 | name, | |
f8eba3c6 TT |
496 | real_path, |
497 | callback, | |
498 | data)) | |
ccefe4c4 | 499 | { |
f8eba3c6 TT |
500 | do_cleanups (cleanups); |
501 | return; | |
ccefe4c4 TT |
502 | } |
503 | } | |
c906108c | 504 | |
f8eba3c6 TT |
505 | do_cleanups (cleanups); |
506 | } | |
507 | ||
508 | /* The callback function used by lookup_symtab. */ | |
509 | ||
510 | static int | |
511 | lookup_symtab_callback (struct symtab *symtab, void *data) | |
512 | { | |
19ba03f4 | 513 | struct symtab **result_ptr = (struct symtab **) data; |
c906108c | 514 | |
f8eba3c6 TT |
515 | *result_ptr = symtab; |
516 | return 1; | |
c906108c | 517 | } |
f8eba3c6 TT |
518 | |
519 | /* A wrapper for iterate_over_symtabs that returns the first matching | |
520 | symtab, or NULL. */ | |
521 | ||
522 | struct symtab * | |
523 | lookup_symtab (const char *name) | |
524 | { | |
525 | struct symtab *result = NULL; | |
526 | ||
527 | iterate_over_symtabs (name, lookup_symtab_callback, &result); | |
528 | return result; | |
529 | } | |
530 | ||
c906108c SS |
531 | \f |
532 | /* Mangle a GDB method stub type. This actually reassembles the pieces of the | |
533 | full method name, which consist of the class name (from T), the unadorned | |
534 | method name from METHOD_ID, and the signature for the specific overload, | |
c378eb4e | 535 | specified by SIGNATURE_ID. Note that this function is g++ specific. */ |
c906108c SS |
536 | |
537 | char * | |
fba45db2 | 538 | gdb_mangle_name (struct type *type, int method_id, int signature_id) |
c906108c SS |
539 | { |
540 | int mangled_name_len; | |
541 | char *mangled_name; | |
542 | struct fn_field *f = TYPE_FN_FIELDLIST1 (type, method_id); | |
543 | struct fn_field *method = &f[signature_id]; | |
0d5cff50 | 544 | const char *field_name = TYPE_FN_FIELDLIST_NAME (type, method_id); |
1d06ead6 | 545 | const char *physname = TYPE_FN_FIELD_PHYSNAME (f, signature_id); |
0d5cff50 | 546 | const char *newname = type_name_no_tag (type); |
c906108c SS |
547 | |
548 | /* Does the form of physname indicate that it is the full mangled name | |
549 | of a constructor (not just the args)? */ | |
550 | int is_full_physname_constructor; | |
551 | ||
552 | int is_constructor; | |
015a42b4 | 553 | int is_destructor = is_destructor_name (physname); |
c906108c | 554 | /* Need a new type prefix. */ |
e6a959d6 PA |
555 | const char *const_prefix = method->is_const ? "C" : ""; |
556 | const char *volatile_prefix = method->is_volatile ? "V" : ""; | |
c906108c SS |
557 | char buf[20]; |
558 | int len = (newname == NULL ? 0 : strlen (newname)); | |
559 | ||
43630227 PS |
560 | /* Nothing to do if physname already contains a fully mangled v3 abi name |
561 | or an operator name. */ | |
562 | if ((physname[0] == '_' && physname[1] == 'Z') | |
563 | || is_operator_name (field_name)) | |
235d1e03 EZ |
564 | return xstrdup (physname); |
565 | ||
015a42b4 | 566 | is_full_physname_constructor = is_constructor_name (physname); |
c906108c | 567 | |
3e43a32a MS |
568 | is_constructor = is_full_physname_constructor |
569 | || (newname && strcmp (field_name, newname) == 0); | |
c906108c SS |
570 | |
571 | if (!is_destructor) | |
61012eef | 572 | is_destructor = (startswith (physname, "__dt")); |
c906108c SS |
573 | |
574 | if (is_destructor || is_full_physname_constructor) | |
575 | { | |
c5aa993b JM |
576 | mangled_name = (char *) xmalloc (strlen (physname) + 1); |
577 | strcpy (mangled_name, physname); | |
c906108c SS |
578 | return mangled_name; |
579 | } | |
580 | ||
581 | if (len == 0) | |
582 | { | |
8c042590 | 583 | xsnprintf (buf, sizeof (buf), "__%s%s", const_prefix, volatile_prefix); |
c906108c SS |
584 | } |
585 | else if (physname[0] == 't' || physname[0] == 'Q') | |
586 | { | |
587 | /* The physname for template and qualified methods already includes | |
c5aa993b | 588 | the class name. */ |
8c042590 | 589 | xsnprintf (buf, sizeof (buf), "__%s%s", const_prefix, volatile_prefix); |
c906108c SS |
590 | newname = NULL; |
591 | len = 0; | |
592 | } | |
593 | else | |
594 | { | |
8c042590 PM |
595 | xsnprintf (buf, sizeof (buf), "__%s%s%d", const_prefix, |
596 | volatile_prefix, len); | |
c906108c SS |
597 | } |
598 | mangled_name_len = ((is_constructor ? 0 : strlen (field_name)) | |
235d1e03 | 599 | + strlen (buf) + len + strlen (physname) + 1); |
c906108c | 600 | |
433759f7 MS |
601 | mangled_name = (char *) xmalloc (mangled_name_len); |
602 | if (is_constructor) | |
603 | mangled_name[0] = '\0'; | |
604 | else | |
605 | strcpy (mangled_name, field_name); | |
606 | ||
c906108c SS |
607 | strcat (mangled_name, buf); |
608 | /* If the class doesn't have a name, i.e. newname NULL, then we just | |
609 | mangle it using 0 for the length of the class. Thus it gets mangled | |
c378eb4e | 610 | as something starting with `::' rather than `classname::'. */ |
c906108c SS |
611 | if (newname != NULL) |
612 | strcat (mangled_name, newname); | |
613 | ||
614 | strcat (mangled_name, physname); | |
615 | return (mangled_name); | |
616 | } | |
12af6855 | 617 | |
b250c185 | 618 | /* Set the demangled name of GSYMBOL to NAME. NAME must be already |
7c5fdd25 | 619 | correctly allocated. */ |
eca864fe | 620 | |
b250c185 SW |
621 | void |
622 | symbol_set_demangled_name (struct general_symbol_info *gsymbol, | |
cfc594ee | 623 | const char *name, |
ccde22c0 | 624 | struct obstack *obstack) |
b250c185 | 625 | { |
7c5fdd25 | 626 | if (gsymbol->language == language_ada) |
f85f34ed TT |
627 | { |
628 | if (name == NULL) | |
629 | { | |
630 | gsymbol->ada_mangled = 0; | |
631 | gsymbol->language_specific.obstack = obstack; | |
632 | } | |
633 | else | |
634 | { | |
635 | gsymbol->ada_mangled = 1; | |
615b3f62 | 636 | gsymbol->language_specific.demangled_name = name; |
f85f34ed TT |
637 | } |
638 | } | |
29df156d | 639 | else |
615b3f62 | 640 | gsymbol->language_specific.demangled_name = name; |
b250c185 SW |
641 | } |
642 | ||
643 | /* Return the demangled name of GSYMBOL. */ | |
eca864fe | 644 | |
0d5cff50 | 645 | const char * |
b250c185 SW |
646 | symbol_get_demangled_name (const struct general_symbol_info *gsymbol) |
647 | { | |
7c5fdd25 | 648 | if (gsymbol->language == language_ada) |
f85f34ed TT |
649 | { |
650 | if (!gsymbol->ada_mangled) | |
651 | return NULL; | |
652 | /* Fall through. */ | |
653 | } | |
654 | ||
615b3f62 | 655 | return gsymbol->language_specific.demangled_name; |
b250c185 SW |
656 | } |
657 | ||
12af6855 | 658 | \f |
89aad1f9 | 659 | /* Initialize the language dependent portion of a symbol |
c378eb4e | 660 | depending upon the language for the symbol. */ |
eca864fe | 661 | |
89aad1f9 | 662 | void |
33e5013e | 663 | symbol_set_language (struct general_symbol_info *gsymbol, |
f85f34ed TT |
664 | enum language language, |
665 | struct obstack *obstack) | |
89aad1f9 EZ |
666 | { |
667 | gsymbol->language = language; | |
7c5fdd25 DE |
668 | if (gsymbol->language == language_cplus |
669 | || gsymbol->language == language_d | |
a766d390 | 670 | || gsymbol->language == language_go |
5784d15e | 671 | || gsymbol->language == language_java |
f55ee35c JK |
672 | || gsymbol->language == language_objc |
673 | || gsymbol->language == language_fortran) | |
89aad1f9 | 674 | { |
f85f34ed TT |
675 | symbol_set_demangled_name (gsymbol, NULL, obstack); |
676 | } | |
677 | else if (gsymbol->language == language_ada) | |
678 | { | |
679 | gdb_assert (gsymbol->ada_mangled == 0); | |
680 | gsymbol->language_specific.obstack = obstack; | |
89aad1f9 | 681 | } |
89aad1f9 EZ |
682 | else |
683 | { | |
684 | memset (&gsymbol->language_specific, 0, | |
685 | sizeof (gsymbol->language_specific)); | |
686 | } | |
687 | } | |
688 | ||
2de7ced7 DJ |
689 | /* Functions to initialize a symbol's mangled name. */ |
690 | ||
04a679b8 TT |
691 | /* Objects of this type are stored in the demangled name hash table. */ |
692 | struct demangled_name_entry | |
693 | { | |
9d2ceabe | 694 | const char *mangled; |
04a679b8 TT |
695 | char demangled[1]; |
696 | }; | |
697 | ||
698 | /* Hash function for the demangled name hash. */ | |
eca864fe | 699 | |
04a679b8 TT |
700 | static hashval_t |
701 | hash_demangled_name_entry (const void *data) | |
702 | { | |
19ba03f4 SM |
703 | const struct demangled_name_entry *e |
704 | = (const struct demangled_name_entry *) data; | |
433759f7 | 705 | |
04a679b8 TT |
706 | return htab_hash_string (e->mangled); |
707 | } | |
708 | ||
709 | /* Equality function for the demangled name hash. */ | |
eca864fe | 710 | |
04a679b8 TT |
711 | static int |
712 | eq_demangled_name_entry (const void *a, const void *b) | |
713 | { | |
19ba03f4 SM |
714 | const struct demangled_name_entry *da |
715 | = (const struct demangled_name_entry *) a; | |
716 | const struct demangled_name_entry *db | |
717 | = (const struct demangled_name_entry *) b; | |
433759f7 | 718 | |
04a679b8 TT |
719 | return strcmp (da->mangled, db->mangled) == 0; |
720 | } | |
721 | ||
2de7ced7 DJ |
722 | /* Create the hash table used for demangled names. Each hash entry is |
723 | a pair of strings; one for the mangled name and one for the demangled | |
724 | name. The entry is hashed via just the mangled name. */ | |
725 | ||
726 | static void | |
727 | create_demangled_names_hash (struct objfile *objfile) | |
728 | { | |
729 | /* Choose 256 as the starting size of the hash table, somewhat arbitrarily. | |
9af17804 | 730 | The hash table code will round this up to the next prime number. |
2de7ced7 DJ |
731 | Choosing a much larger table size wastes memory, and saves only about |
732 | 1% in symbol reading. */ | |
733 | ||
84a1243b | 734 | objfile->per_bfd->demangled_names_hash = htab_create_alloc |
04a679b8 | 735 | (256, hash_demangled_name_entry, eq_demangled_name_entry, |
aa2ee5f6 | 736 | NULL, xcalloc, xfree); |
2de7ced7 | 737 | } |
12af6855 | 738 | |
2de7ced7 | 739 | /* Try to determine the demangled name for a symbol, based on the |
12af6855 JB |
740 | language of that symbol. If the language is set to language_auto, |
741 | it will attempt to find any demangling algorithm that works and | |
2de7ced7 DJ |
742 | then set the language appropriately. The returned name is allocated |
743 | by the demangler and should be xfree'd. */ | |
12af6855 | 744 | |
2de7ced7 DJ |
745 | static char * |
746 | symbol_find_demangled_name (struct general_symbol_info *gsymbol, | |
747 | const char *mangled) | |
12af6855 | 748 | { |
12af6855 | 749 | char *demangled = NULL; |
8b302db8 TT |
750 | int i; |
751 | int recognized; | |
12af6855 JB |
752 | |
753 | if (gsymbol->language == language_unknown) | |
754 | gsymbol->language = language_auto; | |
1bae87b9 | 755 | |
8b302db8 | 756 | if (gsymbol->language != language_auto) |
1bae87b9 | 757 | { |
8b302db8 TT |
758 | const struct language_defn *lang = language_def (gsymbol->language); |
759 | ||
760 | language_sniff_from_mangled_name (lang, mangled, &demangled); | |
761 | return demangled; | |
6aecb9c2 | 762 | } |
8b302db8 TT |
763 | |
764 | for (i = language_unknown; i < nr_languages; ++i) | |
a766d390 | 765 | { |
8b302db8 TT |
766 | enum language l = (enum language) i; |
767 | const struct language_defn *lang = language_def (l); | |
768 | ||
769 | if (language_sniff_from_mangled_name (lang, mangled, &demangled)) | |
a766d390 | 770 | { |
8b302db8 | 771 | gsymbol->language = l; |
a766d390 DE |
772 | return demangled; |
773 | } | |
774 | } | |
775 | ||
2de7ced7 DJ |
776 | return NULL; |
777 | } | |
778 | ||
980cae7a | 779 | /* Set both the mangled and demangled (if any) names for GSYMBOL based |
04a679b8 TT |
780 | on LINKAGE_NAME and LEN. Ordinarily, NAME is copied onto the |
781 | objfile's obstack; but if COPY_NAME is 0 and if NAME is | |
782 | NUL-terminated, then this function assumes that NAME is already | |
783 | correctly saved (either permanently or with a lifetime tied to the | |
784 | objfile), and it will not be copied. | |
785 | ||
786 | The hash table corresponding to OBJFILE is used, and the memory | |
84a1243b | 787 | comes from the per-BFD storage_obstack. LINKAGE_NAME is copied, |
04a679b8 | 788 | so the pointer can be discarded after calling this function. */ |
2de7ced7 | 789 | |
d2a52b27 DC |
790 | /* We have to be careful when dealing with Java names: when we run |
791 | into a Java minimal symbol, we don't know it's a Java symbol, so it | |
792 | gets demangled as a C++ name. This is unfortunate, but there's not | |
793 | much we can do about it: but when demangling partial symbols and | |
794 | regular symbols, we'd better not reuse the wrong demangled name. | |
795 | (See PR gdb/1039.) We solve this by putting a distinctive prefix | |
796 | on Java names when storing them in the hash table. */ | |
797 | ||
798 | /* FIXME: carlton/2003-03-13: This is an unfortunate situation. I | |
799 | don't mind the Java prefix so much: different languages have | |
800 | different demangling requirements, so it's only natural that we | |
801 | need to keep language data around in our demangling cache. But | |
802 | it's not good that the minimal symbol has the wrong demangled name. | |
803 | Unfortunately, I can't think of any easy solution to that | |
804 | problem. */ | |
805 | ||
806 | #define JAVA_PREFIX "##JAVA$$" | |
807 | #define JAVA_PREFIX_LEN 8 | |
808 | ||
2de7ced7 DJ |
809 | void |
810 | symbol_set_names (struct general_symbol_info *gsymbol, | |
04a679b8 TT |
811 | const char *linkage_name, int len, int copy_name, |
812 | struct objfile *objfile) | |
2de7ced7 | 813 | { |
04a679b8 | 814 | struct demangled_name_entry **slot; |
980cae7a DC |
815 | /* A 0-terminated copy of the linkage name. */ |
816 | const char *linkage_name_copy; | |
d2a52b27 DC |
817 | /* A copy of the linkage name that might have a special Java prefix |
818 | added to it, for use when looking names up in the hash table. */ | |
819 | const char *lookup_name; | |
820 | /* The length of lookup_name. */ | |
821 | int lookup_len; | |
04a679b8 | 822 | struct demangled_name_entry entry; |
84a1243b | 823 | struct objfile_per_bfd_storage *per_bfd = objfile->per_bfd; |
2de7ced7 | 824 | |
b06ead72 JB |
825 | if (gsymbol->language == language_ada) |
826 | { | |
827 | /* In Ada, we do the symbol lookups using the mangled name, so | |
828 | we can save some space by not storing the demangled name. | |
829 | ||
830 | As a side note, we have also observed some overlap between | |
831 | the C++ mangling and Ada mangling, similarly to what has | |
832 | been observed with Java. Because we don't store the demangled | |
833 | name with the symbol, we don't need to use the same trick | |
834 | as Java. */ | |
04a679b8 | 835 | if (!copy_name) |
0d5cff50 | 836 | gsymbol->name = linkage_name; |
04a679b8 TT |
837 | else |
838 | { | |
224c3ddb SM |
839 | char *name = (char *) obstack_alloc (&per_bfd->storage_obstack, |
840 | len + 1); | |
0d5cff50 DE |
841 | |
842 | memcpy (name, linkage_name, len); | |
843 | name[len] = '\0'; | |
844 | gsymbol->name = name; | |
04a679b8 | 845 | } |
84a1243b | 846 | symbol_set_demangled_name (gsymbol, NULL, &per_bfd->storage_obstack); |
b06ead72 JB |
847 | |
848 | return; | |
849 | } | |
850 | ||
84a1243b | 851 | if (per_bfd->demangled_names_hash == NULL) |
04a679b8 TT |
852 | create_demangled_names_hash (objfile); |
853 | ||
980cae7a DC |
854 | /* The stabs reader generally provides names that are not |
855 | NUL-terminated; most of the other readers don't do this, so we | |
d2a52b27 DC |
856 | can just use the given copy, unless we're in the Java case. */ |
857 | if (gsymbol->language == language_java) | |
858 | { | |
859 | char *alloc_name; | |
d2a52b27 | 860 | |
433759f7 | 861 | lookup_len = len + JAVA_PREFIX_LEN; |
224c3ddb | 862 | alloc_name = (char *) alloca (lookup_len + 1); |
d2a52b27 DC |
863 | memcpy (alloc_name, JAVA_PREFIX, JAVA_PREFIX_LEN); |
864 | memcpy (alloc_name + JAVA_PREFIX_LEN, linkage_name, len); | |
865 | alloc_name[lookup_len] = '\0'; | |
866 | ||
867 | lookup_name = alloc_name; | |
868 | linkage_name_copy = alloc_name + JAVA_PREFIX_LEN; | |
869 | } | |
870 | else if (linkage_name[len] != '\0') | |
2de7ced7 | 871 | { |
980cae7a DC |
872 | char *alloc_name; |
873 | ||
433759f7 | 874 | lookup_len = len; |
224c3ddb | 875 | alloc_name = (char *) alloca (lookup_len + 1); |
980cae7a | 876 | memcpy (alloc_name, linkage_name, len); |
d2a52b27 | 877 | alloc_name[lookup_len] = '\0'; |
980cae7a | 878 | |
d2a52b27 | 879 | lookup_name = alloc_name; |
980cae7a | 880 | linkage_name_copy = alloc_name; |
2de7ced7 DJ |
881 | } |
882 | else | |
980cae7a | 883 | { |
d2a52b27 DC |
884 | lookup_len = len; |
885 | lookup_name = linkage_name; | |
980cae7a DC |
886 | linkage_name_copy = linkage_name; |
887 | } | |
2de7ced7 | 888 | |
9d2ceabe | 889 | entry.mangled = lookup_name; |
04a679b8 | 890 | slot = ((struct demangled_name_entry **) |
84a1243b | 891 | htab_find_slot (per_bfd->demangled_names_hash, |
04a679b8 | 892 | &entry, INSERT)); |
2de7ced7 DJ |
893 | |
894 | /* If this name is not in the hash table, add it. */ | |
a766d390 DE |
895 | if (*slot == NULL |
896 | /* A C version of the symbol may have already snuck into the table. | |
897 | This happens to, e.g., main.init (__go_init_main). Cope. */ | |
898 | || (gsymbol->language == language_go | |
899 | && (*slot)->demangled[0] == '\0')) | |
2de7ced7 | 900 | { |
980cae7a DC |
901 | char *demangled_name = symbol_find_demangled_name (gsymbol, |
902 | linkage_name_copy); | |
2de7ced7 DJ |
903 | int demangled_len = demangled_name ? strlen (demangled_name) : 0; |
904 | ||
04a679b8 TT |
905 | /* Suppose we have demangled_name==NULL, copy_name==0, and |
906 | lookup_name==linkage_name. In this case, we already have the | |
907 | mangled name saved, and we don't have a demangled name. So, | |
908 | you might think we could save a little space by not recording | |
909 | this in the hash table at all. | |
910 | ||
911 | It turns out that it is actually important to still save such | |
912 | an entry in the hash table, because storing this name gives | |
705b5767 | 913 | us better bcache hit rates for partial symbols. */ |
04a679b8 TT |
914 | if (!copy_name && lookup_name == linkage_name) |
915 | { | |
224c3ddb SM |
916 | *slot |
917 | = ((struct demangled_name_entry *) | |
918 | obstack_alloc (&per_bfd->storage_obstack, | |
919 | offsetof (struct demangled_name_entry, demangled) | |
920 | + demangled_len + 1)); | |
9d2ceabe | 921 | (*slot)->mangled = lookup_name; |
04a679b8 TT |
922 | } |
923 | else | |
924 | { | |
9d2ceabe TT |
925 | char *mangled_ptr; |
926 | ||
04a679b8 TT |
927 | /* If we must copy the mangled name, put it directly after |
928 | the demangled name so we can have a single | |
929 | allocation. */ | |
224c3ddb SM |
930 | *slot |
931 | = ((struct demangled_name_entry *) | |
932 | obstack_alloc (&per_bfd->storage_obstack, | |
933 | offsetof (struct demangled_name_entry, demangled) | |
934 | + lookup_len + demangled_len + 2)); | |
9d2ceabe TT |
935 | mangled_ptr = &((*slot)->demangled[demangled_len + 1]); |
936 | strcpy (mangled_ptr, lookup_name); | |
937 | (*slot)->mangled = mangled_ptr; | |
04a679b8 TT |
938 | } |
939 | ||
980cae7a | 940 | if (demangled_name != NULL) |
2de7ced7 | 941 | { |
04a679b8 | 942 | strcpy ((*slot)->demangled, demangled_name); |
2de7ced7 DJ |
943 | xfree (demangled_name); |
944 | } | |
945 | else | |
04a679b8 | 946 | (*slot)->demangled[0] = '\0'; |
2de7ced7 DJ |
947 | } |
948 | ||
72dcaf82 | 949 | gsymbol->name = (*slot)->mangled + lookup_len - len; |
04a679b8 | 950 | if ((*slot)->demangled[0] != '\0') |
ccde22c0 | 951 | symbol_set_demangled_name (gsymbol, (*slot)->demangled, |
84a1243b | 952 | &per_bfd->storage_obstack); |
2de7ced7 | 953 | else |
84a1243b | 954 | symbol_set_demangled_name (gsymbol, NULL, &per_bfd->storage_obstack); |
2de7ced7 DJ |
955 | } |
956 | ||
22abf04a DC |
957 | /* Return the source code name of a symbol. In languages where |
958 | demangling is necessary, this is the demangled name. */ | |
959 | ||
0d5cff50 | 960 | const char * |
22abf04a DC |
961 | symbol_natural_name (const struct general_symbol_info *gsymbol) |
962 | { | |
9af17804 | 963 | switch (gsymbol->language) |
22abf04a | 964 | { |
1f8173e6 | 965 | case language_cplus: |
6aecb9c2 | 966 | case language_d: |
a766d390 | 967 | case language_go: |
1f8173e6 PH |
968 | case language_java: |
969 | case language_objc: | |
f55ee35c | 970 | case language_fortran: |
b250c185 SW |
971 | if (symbol_get_demangled_name (gsymbol) != NULL) |
972 | return symbol_get_demangled_name (gsymbol); | |
1f8173e6 PH |
973 | break; |
974 | case language_ada: | |
f85f34ed | 975 | return ada_decode_symbol (gsymbol); |
1f8173e6 PH |
976 | default: |
977 | break; | |
22abf04a | 978 | } |
1f8173e6 | 979 | return gsymbol->name; |
22abf04a DC |
980 | } |
981 | ||
9cc0d196 | 982 | /* Return the demangled name for a symbol based on the language for |
c378eb4e | 983 | that symbol. If no demangled name exists, return NULL. */ |
eca864fe | 984 | |
0d5cff50 | 985 | const char * |
df8a16a1 | 986 | symbol_demangled_name (const struct general_symbol_info *gsymbol) |
9cc0d196 | 987 | { |
c6e5ee5e SDJ |
988 | const char *dem_name = NULL; |
989 | ||
9af17804 | 990 | switch (gsymbol->language) |
1f8173e6 PH |
991 | { |
992 | case language_cplus: | |
6aecb9c2 | 993 | case language_d: |
a766d390 | 994 | case language_go: |
1f8173e6 PH |
995 | case language_java: |
996 | case language_objc: | |
f55ee35c | 997 | case language_fortran: |
c6e5ee5e | 998 | dem_name = symbol_get_demangled_name (gsymbol); |
1f8173e6 PH |
999 | break; |
1000 | case language_ada: | |
f85f34ed | 1001 | dem_name = ada_decode_symbol (gsymbol); |
1f8173e6 PH |
1002 | break; |
1003 | default: | |
1004 | break; | |
1005 | } | |
c6e5ee5e | 1006 | return dem_name; |
9cc0d196 | 1007 | } |
fe39c653 | 1008 | |
4725b721 PH |
1009 | /* Return the search name of a symbol---generally the demangled or |
1010 | linkage name of the symbol, depending on how it will be searched for. | |
9af17804 | 1011 | If there is no distinct demangled name, then returns the same value |
c378eb4e | 1012 | (same pointer) as SYMBOL_LINKAGE_NAME. */ |
eca864fe | 1013 | |
0d5cff50 | 1014 | const char * |
fc062ac6 JB |
1015 | symbol_search_name (const struct general_symbol_info *gsymbol) |
1016 | { | |
1f8173e6 PH |
1017 | if (gsymbol->language == language_ada) |
1018 | return gsymbol->name; | |
1019 | else | |
1020 | return symbol_natural_name (gsymbol); | |
4725b721 PH |
1021 | } |
1022 | ||
fe39c653 | 1023 | /* Initialize the structure fields to zero values. */ |
eca864fe | 1024 | |
fe39c653 EZ |
1025 | void |
1026 | init_sal (struct symtab_and_line *sal) | |
1027 | { | |
729662a5 | 1028 | memset (sal, 0, sizeof (*sal)); |
fe39c653 | 1029 | } |
c906108c SS |
1030 | \f |
1031 | ||
94277a38 DJ |
1032 | /* Return 1 if the two sections are the same, or if they could |
1033 | plausibly be copies of each other, one in an original object | |
1034 | file and another in a separated debug file. */ | |
1035 | ||
1036 | int | |
714835d5 UW |
1037 | matching_obj_sections (struct obj_section *obj_first, |
1038 | struct obj_section *obj_second) | |
94277a38 | 1039 | { |
714835d5 UW |
1040 | asection *first = obj_first? obj_first->the_bfd_section : NULL; |
1041 | asection *second = obj_second? obj_second->the_bfd_section : NULL; | |
94277a38 DJ |
1042 | struct objfile *obj; |
1043 | ||
1044 | /* If they're the same section, then they match. */ | |
1045 | if (first == second) | |
1046 | return 1; | |
1047 | ||
1048 | /* If either is NULL, give up. */ | |
1049 | if (first == NULL || second == NULL) | |
1050 | return 0; | |
1051 | ||
1052 | /* This doesn't apply to absolute symbols. */ | |
1053 | if (first->owner == NULL || second->owner == NULL) | |
1054 | return 0; | |
1055 | ||
1056 | /* If they're in the same object file, they must be different sections. */ | |
1057 | if (first->owner == second->owner) | |
1058 | return 0; | |
1059 | ||
1060 | /* Check whether the two sections are potentially corresponding. They must | |
1061 | have the same size, address, and name. We can't compare section indexes, | |
1062 | which would be more reliable, because some sections may have been | |
1063 | stripped. */ | |
1064 | if (bfd_get_section_size (first) != bfd_get_section_size (second)) | |
1065 | return 0; | |
1066 | ||
818f79f6 | 1067 | /* In-memory addresses may start at a different offset, relativize them. */ |
94277a38 | 1068 | if (bfd_get_section_vma (first->owner, first) |
818f79f6 DJ |
1069 | - bfd_get_start_address (first->owner) |
1070 | != bfd_get_section_vma (second->owner, second) | |
1071 | - bfd_get_start_address (second->owner)) | |
94277a38 DJ |
1072 | return 0; |
1073 | ||
1074 | if (bfd_get_section_name (first->owner, first) == NULL | |
1075 | || bfd_get_section_name (second->owner, second) == NULL | |
1076 | || strcmp (bfd_get_section_name (first->owner, first), | |
1077 | bfd_get_section_name (second->owner, second)) != 0) | |
1078 | return 0; | |
1079 | ||
1080 | /* Otherwise check that they are in corresponding objfiles. */ | |
1081 | ||
1082 | ALL_OBJFILES (obj) | |
1083 | if (obj->obfd == first->owner) | |
1084 | break; | |
1085 | gdb_assert (obj != NULL); | |
1086 | ||
1087 | if (obj->separate_debug_objfile != NULL | |
1088 | && obj->separate_debug_objfile->obfd == second->owner) | |
1089 | return 1; | |
1090 | if (obj->separate_debug_objfile_backlink != NULL | |
1091 | && obj->separate_debug_objfile_backlink->obfd == second->owner) | |
1092 | return 1; | |
1093 | ||
1094 | return 0; | |
1095 | } | |
c5aa993b | 1096 | |
2097ae25 DE |
1097 | /* See symtab.h. */ |
1098 | ||
1099 | void | |
1100 | expand_symtab_containing_pc (CORE_ADDR pc, struct obj_section *section) | |
c906108c | 1101 | { |
52f0bd74 | 1102 | struct objfile *objfile; |
77e371c0 | 1103 | struct bound_minimal_symbol msymbol; |
8a48e967 DJ |
1104 | |
1105 | /* If we know that this is not a text address, return failure. This is | |
1106 | necessary because we loop based on texthigh and textlow, which do | |
1107 | not include the data ranges. */ | |
77e371c0 TT |
1108 | msymbol = lookup_minimal_symbol_by_pc_section (pc, section); |
1109 | if (msymbol.minsym | |
1110 | && (MSYMBOL_TYPE (msymbol.minsym) == mst_data | |
1111 | || MSYMBOL_TYPE (msymbol.minsym) == mst_bss | |
1112 | || MSYMBOL_TYPE (msymbol.minsym) == mst_abs | |
1113 | || MSYMBOL_TYPE (msymbol.minsym) == mst_file_data | |
1114 | || MSYMBOL_TYPE (msymbol.minsym) == mst_file_bss)) | |
2097ae25 | 1115 | return; |
c906108c | 1116 | |
ff013f42 | 1117 | ALL_OBJFILES (objfile) |
ccefe4c4 | 1118 | { |
43f3e411 | 1119 | struct compunit_symtab *cust = NULL; |
433759f7 | 1120 | |
ccefe4c4 | 1121 | if (objfile->sf) |
43f3e411 DE |
1122 | cust = objfile->sf->qf->find_pc_sect_compunit_symtab (objfile, msymbol, |
1123 | pc, section, 0); | |
1124 | if (cust) | |
2097ae25 | 1125 | return; |
ccefe4c4 | 1126 | } |
c906108c | 1127 | } |
c906108c | 1128 | \f |
f57d2163 DE |
1129 | /* Hash function for the symbol cache. */ |
1130 | ||
1131 | static unsigned int | |
1132 | hash_symbol_entry (const struct objfile *objfile_context, | |
1133 | const char *name, domain_enum domain) | |
1134 | { | |
1135 | unsigned int hash = (uintptr_t) objfile_context; | |
1136 | ||
1137 | if (name != NULL) | |
1138 | hash += htab_hash_string (name); | |
1139 | ||
2c26b84f DE |
1140 | /* Because of symbol_matches_domain we need VAR_DOMAIN and STRUCT_DOMAIN |
1141 | to map to the same slot. */ | |
1142 | if (domain == STRUCT_DOMAIN) | |
1143 | hash += VAR_DOMAIN * 7; | |
1144 | else | |
1145 | hash += domain * 7; | |
f57d2163 DE |
1146 | |
1147 | return hash; | |
1148 | } | |
1149 | ||
1150 | /* Equality function for the symbol cache. */ | |
1151 | ||
1152 | static int | |
1153 | eq_symbol_entry (const struct symbol_cache_slot *slot, | |
1154 | const struct objfile *objfile_context, | |
1155 | const char *name, domain_enum domain) | |
1156 | { | |
1157 | const char *slot_name; | |
1158 | domain_enum slot_domain; | |
1159 | ||
1160 | if (slot->state == SYMBOL_SLOT_UNUSED) | |
1161 | return 0; | |
1162 | ||
1163 | if (slot->objfile_context != objfile_context) | |
1164 | return 0; | |
1165 | ||
1166 | if (slot->state == SYMBOL_SLOT_NOT_FOUND) | |
1167 | { | |
1168 | slot_name = slot->value.not_found.name; | |
1169 | slot_domain = slot->value.not_found.domain; | |
1170 | } | |
1171 | else | |
1172 | { | |
d12307c1 PMR |
1173 | slot_name = SYMBOL_SEARCH_NAME (slot->value.found.symbol); |
1174 | slot_domain = SYMBOL_DOMAIN (slot->value.found.symbol); | |
f57d2163 DE |
1175 | } |
1176 | ||
1177 | /* NULL names match. */ | |
1178 | if (slot_name == NULL && name == NULL) | |
1179 | { | |
1180 | /* But there's no point in calling symbol_matches_domain in the | |
1181 | SYMBOL_SLOT_FOUND case. */ | |
1182 | if (slot_domain != domain) | |
1183 | return 0; | |
1184 | } | |
1185 | else if (slot_name != NULL && name != NULL) | |
1186 | { | |
1187 | /* It's important that we use the same comparison that was done the | |
1188 | first time through. If the slot records a found symbol, then this | |
1189 | means using strcmp_iw on SYMBOL_SEARCH_NAME. See dictionary.c. | |
1190 | It also means using symbol_matches_domain for found symbols. | |
1191 | See block.c. | |
1192 | ||
1193 | If the slot records a not-found symbol, then require a precise match. | |
1194 | We could still be lax with whitespace like strcmp_iw though. */ | |
1195 | ||
1196 | if (slot->state == SYMBOL_SLOT_NOT_FOUND) | |
1197 | { | |
1198 | if (strcmp (slot_name, name) != 0) | |
1199 | return 0; | |
1200 | if (slot_domain != domain) | |
1201 | return 0; | |
1202 | } | |
1203 | else | |
1204 | { | |
d12307c1 | 1205 | struct symbol *sym = slot->value.found.symbol; |
f57d2163 DE |
1206 | |
1207 | if (strcmp_iw (slot_name, name) != 0) | |
1208 | return 0; | |
1209 | if (!symbol_matches_domain (SYMBOL_LANGUAGE (sym), | |
1210 | slot_domain, domain)) | |
1211 | return 0; | |
1212 | } | |
1213 | } | |
1214 | else | |
1215 | { | |
1216 | /* Only one name is NULL. */ | |
1217 | return 0; | |
1218 | } | |
1219 | ||
1220 | return 1; | |
1221 | } | |
1222 | ||
1223 | /* Given a cache of size SIZE, return the size of the struct (with variable | |
1224 | length array) in bytes. */ | |
1225 | ||
1226 | static size_t | |
1227 | symbol_cache_byte_size (unsigned int size) | |
1228 | { | |
1229 | return (sizeof (struct block_symbol_cache) | |
1230 | + ((size - 1) * sizeof (struct symbol_cache_slot))); | |
1231 | } | |
1232 | ||
1233 | /* Resize CACHE. */ | |
1234 | ||
1235 | static void | |
1236 | resize_symbol_cache (struct symbol_cache *cache, unsigned int new_size) | |
1237 | { | |
1238 | /* If there's no change in size, don't do anything. | |
1239 | All caches have the same size, so we can just compare with the size | |
1240 | of the global symbols cache. */ | |
1241 | if ((cache->global_symbols != NULL | |
1242 | && cache->global_symbols->size == new_size) | |
1243 | || (cache->global_symbols == NULL | |
1244 | && new_size == 0)) | |
1245 | return; | |
1246 | ||
1247 | xfree (cache->global_symbols); | |
1248 | xfree (cache->static_symbols); | |
1249 | ||
1250 | if (new_size == 0) | |
1251 | { | |
1252 | cache->global_symbols = NULL; | |
1253 | cache->static_symbols = NULL; | |
1254 | } | |
1255 | else | |
1256 | { | |
1257 | size_t total_size = symbol_cache_byte_size (new_size); | |
1258 | ||
224c3ddb SM |
1259 | cache->global_symbols |
1260 | = (struct block_symbol_cache *) xcalloc (1, total_size); | |
1261 | cache->static_symbols | |
1262 | = (struct block_symbol_cache *) xcalloc (1, total_size); | |
f57d2163 DE |
1263 | cache->global_symbols->size = new_size; |
1264 | cache->static_symbols->size = new_size; | |
1265 | } | |
1266 | } | |
1267 | ||
1268 | /* Make a symbol cache of size SIZE. */ | |
1269 | ||
1270 | static struct symbol_cache * | |
1271 | make_symbol_cache (unsigned int size) | |
1272 | { | |
1273 | struct symbol_cache *cache; | |
1274 | ||
1275 | cache = XCNEW (struct symbol_cache); | |
1276 | resize_symbol_cache (cache, symbol_cache_size); | |
1277 | return cache; | |
1278 | } | |
1279 | ||
1280 | /* Free the space used by CACHE. */ | |
1281 | ||
1282 | static void | |
1283 | free_symbol_cache (struct symbol_cache *cache) | |
1284 | { | |
1285 | xfree (cache->global_symbols); | |
1286 | xfree (cache->static_symbols); | |
1287 | xfree (cache); | |
1288 | } | |
1289 | ||
1290 | /* Return the symbol cache of PSPACE. | |
1291 | Create one if it doesn't exist yet. */ | |
1292 | ||
1293 | static struct symbol_cache * | |
1294 | get_symbol_cache (struct program_space *pspace) | |
1295 | { | |
19ba03f4 SM |
1296 | struct symbol_cache *cache |
1297 | = (struct symbol_cache *) program_space_data (pspace, symbol_cache_key); | |
f57d2163 DE |
1298 | |
1299 | if (cache == NULL) | |
1300 | { | |
1301 | cache = make_symbol_cache (symbol_cache_size); | |
1302 | set_program_space_data (pspace, symbol_cache_key, cache); | |
1303 | } | |
1304 | ||
1305 | return cache; | |
1306 | } | |
1307 | ||
1308 | /* Delete the symbol cache of PSPACE. | |
1309 | Called when PSPACE is destroyed. */ | |
1310 | ||
1311 | static void | |
1312 | symbol_cache_cleanup (struct program_space *pspace, void *data) | |
1313 | { | |
19ba03f4 | 1314 | struct symbol_cache *cache = (struct symbol_cache *) data; |
f57d2163 DE |
1315 | |
1316 | free_symbol_cache (cache); | |
1317 | } | |
1318 | ||
1319 | /* Set the size of the symbol cache in all program spaces. */ | |
1320 | ||
1321 | static void | |
1322 | set_symbol_cache_size (unsigned int new_size) | |
1323 | { | |
1324 | struct program_space *pspace; | |
1325 | ||
1326 | ALL_PSPACES (pspace) | |
1327 | { | |
1328 | struct symbol_cache *cache | |
19ba03f4 | 1329 | = (struct symbol_cache *) program_space_data (pspace, symbol_cache_key); |
f57d2163 DE |
1330 | |
1331 | /* The pspace could have been created but not have a cache yet. */ | |
1332 | if (cache != NULL) | |
1333 | resize_symbol_cache (cache, new_size); | |
1334 | } | |
1335 | } | |
1336 | ||
1337 | /* Called when symbol-cache-size is set. */ | |
1338 | ||
1339 | static void | |
1340 | set_symbol_cache_size_handler (char *args, int from_tty, | |
1341 | struct cmd_list_element *c) | |
1342 | { | |
1343 | if (new_symbol_cache_size > MAX_SYMBOL_CACHE_SIZE) | |
1344 | { | |
1345 | /* Restore the previous value. | |
1346 | This is the value the "show" command prints. */ | |
1347 | new_symbol_cache_size = symbol_cache_size; | |
1348 | ||
1349 | error (_("Symbol cache size is too large, max is %u."), | |
1350 | MAX_SYMBOL_CACHE_SIZE); | |
1351 | } | |
1352 | symbol_cache_size = new_symbol_cache_size; | |
1353 | ||
1354 | set_symbol_cache_size (symbol_cache_size); | |
1355 | } | |
1356 | ||
1357 | /* Lookup symbol NAME,DOMAIN in BLOCK in the symbol cache of PSPACE. | |
1358 | OBJFILE_CONTEXT is the current objfile, which may be NULL. | |
1359 | The result is the symbol if found, SYMBOL_LOOKUP_FAILED if a previous lookup | |
1360 | failed (and thus this one will too), or NULL if the symbol is not present | |
1361 | in the cache. | |
2c26b84f DE |
1362 | If the symbol is not present in the cache, then *BSC_PTR and *SLOT_PTR are |
1363 | set to the cache and slot of the symbol to save the result of a full lookup | |
1364 | attempt. */ | |
f57d2163 | 1365 | |
d12307c1 | 1366 | static struct block_symbol |
f57d2163 DE |
1367 | symbol_cache_lookup (struct symbol_cache *cache, |
1368 | struct objfile *objfile_context, int block, | |
1369 | const char *name, domain_enum domain, | |
1370 | struct block_symbol_cache **bsc_ptr, | |
1371 | struct symbol_cache_slot **slot_ptr) | |
1372 | { | |
1373 | struct block_symbol_cache *bsc; | |
1374 | unsigned int hash; | |
1375 | struct symbol_cache_slot *slot; | |
1376 | ||
1377 | if (block == GLOBAL_BLOCK) | |
1378 | bsc = cache->global_symbols; | |
1379 | else | |
1380 | bsc = cache->static_symbols; | |
1381 | if (bsc == NULL) | |
1382 | { | |
1383 | *bsc_ptr = NULL; | |
1384 | *slot_ptr = NULL; | |
d12307c1 | 1385 | return (struct block_symbol) {NULL, NULL}; |
f57d2163 DE |
1386 | } |
1387 | ||
1388 | hash = hash_symbol_entry (objfile_context, name, domain); | |
1389 | slot = bsc->symbols + hash % bsc->size; | |
f57d2163 DE |
1390 | |
1391 | if (eq_symbol_entry (slot, objfile_context, name, domain)) | |
1392 | { | |
1393 | if (symbol_lookup_debug) | |
1394 | fprintf_unfiltered (gdb_stdlog, | |
1395 | "%s block symbol cache hit%s for %s, %s\n", | |
1396 | block == GLOBAL_BLOCK ? "Global" : "Static", | |
1397 | slot->state == SYMBOL_SLOT_NOT_FOUND | |
1398 | ? " (not found)" : "", | |
1399 | name, domain_name (domain)); | |
1400 | ++bsc->hits; | |
1401 | if (slot->state == SYMBOL_SLOT_NOT_FOUND) | |
1402 | return SYMBOL_LOOKUP_FAILED; | |
1403 | return slot->value.found; | |
1404 | } | |
1405 | ||
2c26b84f DE |
1406 | /* Symbol is not present in the cache. */ |
1407 | ||
1408 | *bsc_ptr = bsc; | |
1409 | *slot_ptr = slot; | |
1410 | ||
f57d2163 DE |
1411 | if (symbol_lookup_debug) |
1412 | { | |
1413 | fprintf_unfiltered (gdb_stdlog, | |
1414 | "%s block symbol cache miss for %s, %s\n", | |
1415 | block == GLOBAL_BLOCK ? "Global" : "Static", | |
1416 | name, domain_name (domain)); | |
1417 | } | |
1418 | ++bsc->misses; | |
d12307c1 | 1419 | return (struct block_symbol) {NULL, NULL}; |
f57d2163 DE |
1420 | } |
1421 | ||
1422 | /* Clear out SLOT. */ | |
1423 | ||
1424 | static void | |
1425 | symbol_cache_clear_slot (struct symbol_cache_slot *slot) | |
1426 | { | |
1427 | if (slot->state == SYMBOL_SLOT_NOT_FOUND) | |
1428 | xfree (slot->value.not_found.name); | |
1429 | slot->state = SYMBOL_SLOT_UNUSED; | |
1430 | } | |
1431 | ||
1432 | /* Mark SYMBOL as found in SLOT. | |
1433 | OBJFILE_CONTEXT is the current objfile when the lookup was done, or NULL | |
1434 | if it's not needed to distinguish lookups (STATIC_BLOCK). It is *not* | |
1435 | necessarily the objfile the symbol was found in. */ | |
1436 | ||
1437 | static void | |
1438 | symbol_cache_mark_found (struct block_symbol_cache *bsc, | |
1439 | struct symbol_cache_slot *slot, | |
1440 | struct objfile *objfile_context, | |
d12307c1 PMR |
1441 | struct symbol *symbol, |
1442 | const struct block *block) | |
f57d2163 DE |
1443 | { |
1444 | if (bsc == NULL) | |
1445 | return; | |
1446 | if (slot->state != SYMBOL_SLOT_UNUSED) | |
1447 | { | |
1448 | ++bsc->collisions; | |
1449 | symbol_cache_clear_slot (slot); | |
1450 | } | |
1451 | slot->state = SYMBOL_SLOT_FOUND; | |
1452 | slot->objfile_context = objfile_context; | |
d12307c1 PMR |
1453 | slot->value.found.symbol = symbol; |
1454 | slot->value.found.block = block; | |
f57d2163 DE |
1455 | } |
1456 | ||
1457 | /* Mark symbol NAME, DOMAIN as not found in SLOT. | |
1458 | OBJFILE_CONTEXT is the current objfile when the lookup was done, or NULL | |
1459 | if it's not needed to distinguish lookups (STATIC_BLOCK). */ | |
1460 | ||
1461 | static void | |
1462 | symbol_cache_mark_not_found (struct block_symbol_cache *bsc, | |
1463 | struct symbol_cache_slot *slot, | |
1464 | struct objfile *objfile_context, | |
1465 | const char *name, domain_enum domain) | |
1466 | { | |
1467 | if (bsc == NULL) | |
1468 | return; | |
1469 | if (slot->state != SYMBOL_SLOT_UNUSED) | |
1470 | { | |
1471 | ++bsc->collisions; | |
1472 | symbol_cache_clear_slot (slot); | |
1473 | } | |
1474 | slot->state = SYMBOL_SLOT_NOT_FOUND; | |
1475 | slot->objfile_context = objfile_context; | |
1476 | slot->value.not_found.name = xstrdup (name); | |
1477 | slot->value.not_found.domain = domain; | |
1478 | } | |
1479 | ||
1480 | /* Flush the symbol cache of PSPACE. */ | |
1481 | ||
1482 | static void | |
1483 | symbol_cache_flush (struct program_space *pspace) | |
1484 | { | |
19ba03f4 SM |
1485 | struct symbol_cache *cache |
1486 | = (struct symbol_cache *) program_space_data (pspace, symbol_cache_key); | |
f57d2163 | 1487 | int pass; |
f57d2163 DE |
1488 | |
1489 | if (cache == NULL) | |
1490 | return; | |
1491 | if (cache->global_symbols == NULL) | |
1492 | { | |
1493 | gdb_assert (symbol_cache_size == 0); | |
1494 | gdb_assert (cache->static_symbols == NULL); | |
1495 | return; | |
1496 | } | |
1497 | ||
1498 | /* If the cache is untouched since the last flush, early exit. | |
1499 | This is important for performance during the startup of a program linked | |
1500 | with 100s (or 1000s) of shared libraries. */ | |
1501 | if (cache->global_symbols->misses == 0 | |
1502 | && cache->static_symbols->misses == 0) | |
1503 | return; | |
1504 | ||
1505 | gdb_assert (cache->global_symbols->size == symbol_cache_size); | |
1506 | gdb_assert (cache->static_symbols->size == symbol_cache_size); | |
1507 | ||
1508 | for (pass = 0; pass < 2; ++pass) | |
1509 | { | |
1510 | struct block_symbol_cache *bsc | |
1511 | = pass == 0 ? cache->global_symbols : cache->static_symbols; | |
1512 | unsigned int i; | |
1513 | ||
1514 | for (i = 0; i < bsc->size; ++i) | |
1515 | symbol_cache_clear_slot (&bsc->symbols[i]); | |
1516 | } | |
1517 | ||
1518 | cache->global_symbols->hits = 0; | |
1519 | cache->global_symbols->misses = 0; | |
1520 | cache->global_symbols->collisions = 0; | |
1521 | cache->static_symbols->hits = 0; | |
1522 | cache->static_symbols->misses = 0; | |
1523 | cache->static_symbols->collisions = 0; | |
1524 | } | |
1525 | ||
1526 | /* Dump CACHE. */ | |
1527 | ||
1528 | static void | |
1529 | symbol_cache_dump (const struct symbol_cache *cache) | |
1530 | { | |
1531 | int pass; | |
1532 | ||
1533 | if (cache->global_symbols == NULL) | |
1534 | { | |
1535 | printf_filtered (" <disabled>\n"); | |
1536 | return; | |
1537 | } | |
1538 | ||
1539 | for (pass = 0; pass < 2; ++pass) | |
1540 | { | |
1541 | const struct block_symbol_cache *bsc | |
1542 | = pass == 0 ? cache->global_symbols : cache->static_symbols; | |
1543 | unsigned int i; | |
1544 | ||
1545 | if (pass == 0) | |
1546 | printf_filtered ("Global symbols:\n"); | |
1547 | else | |
1548 | printf_filtered ("Static symbols:\n"); | |
1549 | ||
1550 | for (i = 0; i < bsc->size; ++i) | |
1551 | { | |
1552 | const struct symbol_cache_slot *slot = &bsc->symbols[i]; | |
1553 | ||
1554 | QUIT; | |
1555 | ||
1556 | switch (slot->state) | |
1557 | { | |
1558 | case SYMBOL_SLOT_UNUSED: | |
1559 | break; | |
1560 | case SYMBOL_SLOT_NOT_FOUND: | |
2c26b84f | 1561 | printf_filtered (" [%4u] = %s, %s %s (not found)\n", i, |
f57d2163 | 1562 | host_address_to_string (slot->objfile_context), |
2c26b84f DE |
1563 | slot->value.not_found.name, |
1564 | domain_name (slot->value.not_found.domain)); | |
f57d2163 DE |
1565 | break; |
1566 | case SYMBOL_SLOT_FOUND: | |
d12307c1 PMR |
1567 | { |
1568 | struct symbol *found = slot->value.found.symbol; | |
1569 | const struct objfile *context = slot->objfile_context; | |
1570 | ||
1571 | printf_filtered (" [%4u] = %s, %s %s\n", i, | |
1572 | host_address_to_string (context), | |
1573 | SYMBOL_PRINT_NAME (found), | |
1574 | domain_name (SYMBOL_DOMAIN (found))); | |
1575 | break; | |
1576 | } | |
f57d2163 DE |
1577 | } |
1578 | } | |
1579 | } | |
1580 | } | |
1581 | ||
1582 | /* The "mt print symbol-cache" command. */ | |
1583 | ||
1584 | static void | |
1585 | maintenance_print_symbol_cache (char *args, int from_tty) | |
1586 | { | |
1587 | struct program_space *pspace; | |
1588 | ||
1589 | ALL_PSPACES (pspace) | |
1590 | { | |
1591 | struct symbol_cache *cache; | |
1592 | ||
1593 | printf_filtered (_("Symbol cache for pspace %d\n%s:\n"), | |
1594 | pspace->num, | |
1595 | pspace->symfile_object_file != NULL | |
1596 | ? objfile_name (pspace->symfile_object_file) | |
1597 | : "(no object file)"); | |
1598 | ||
1599 | /* If the cache hasn't been created yet, avoid creating one. */ | |
19ba03f4 SM |
1600 | cache |
1601 | = (struct symbol_cache *) program_space_data (pspace, symbol_cache_key); | |
f57d2163 DE |
1602 | if (cache == NULL) |
1603 | printf_filtered (" <empty>\n"); | |
1604 | else | |
1605 | symbol_cache_dump (cache); | |
1606 | } | |
1607 | } | |
1608 | ||
1609 | /* The "mt flush-symbol-cache" command. */ | |
1610 | ||
1611 | static void | |
1612 | maintenance_flush_symbol_cache (char *args, int from_tty) | |
1613 | { | |
1614 | struct program_space *pspace; | |
1615 | ||
1616 | ALL_PSPACES (pspace) | |
1617 | { | |
1618 | symbol_cache_flush (pspace); | |
1619 | } | |
1620 | } | |
1621 | ||
1622 | /* Print usage statistics of CACHE. */ | |
1623 | ||
1624 | static void | |
1625 | symbol_cache_stats (struct symbol_cache *cache) | |
1626 | { | |
1627 | int pass; | |
1628 | ||
1629 | if (cache->global_symbols == NULL) | |
1630 | { | |
1631 | printf_filtered (" <disabled>\n"); | |
1632 | return; | |
1633 | } | |
1634 | ||
1635 | for (pass = 0; pass < 2; ++pass) | |
1636 | { | |
1637 | const struct block_symbol_cache *bsc | |
1638 | = pass == 0 ? cache->global_symbols : cache->static_symbols; | |
1639 | ||
1640 | QUIT; | |
1641 | ||
1642 | if (pass == 0) | |
1643 | printf_filtered ("Global block cache stats:\n"); | |
1644 | else | |
1645 | printf_filtered ("Static block cache stats:\n"); | |
1646 | ||
1647 | printf_filtered (" size: %u\n", bsc->size); | |
1648 | printf_filtered (" hits: %u\n", bsc->hits); | |
1649 | printf_filtered (" misses: %u\n", bsc->misses); | |
1650 | printf_filtered (" collisions: %u\n", bsc->collisions); | |
1651 | } | |
1652 | } | |
1653 | ||
1654 | /* The "mt print symbol-cache-statistics" command. */ | |
1655 | ||
1656 | static void | |
1657 | maintenance_print_symbol_cache_statistics (char *args, int from_tty) | |
1658 | { | |
1659 | struct program_space *pspace; | |
1660 | ||
1661 | ALL_PSPACES (pspace) | |
1662 | { | |
1663 | struct symbol_cache *cache; | |
1664 | ||
1665 | printf_filtered (_("Symbol cache statistics for pspace %d\n%s:\n"), | |
1666 | pspace->num, | |
1667 | pspace->symfile_object_file != NULL | |
1668 | ? objfile_name (pspace->symfile_object_file) | |
1669 | : "(no object file)"); | |
1670 | ||
1671 | /* If the cache hasn't been created yet, avoid creating one. */ | |
19ba03f4 SM |
1672 | cache |
1673 | = (struct symbol_cache *) program_space_data (pspace, symbol_cache_key); | |
f57d2163 DE |
1674 | if (cache == NULL) |
1675 | printf_filtered (" empty, no stats available\n"); | |
1676 | else | |
1677 | symbol_cache_stats (cache); | |
1678 | } | |
1679 | } | |
1680 | ||
1681 | /* This module's 'new_objfile' observer. */ | |
1682 | ||
1683 | static void | |
1684 | symtab_new_objfile_observer (struct objfile *objfile) | |
1685 | { | |
1686 | /* Ideally we'd use OBJFILE->pspace, but OBJFILE may be NULL. */ | |
1687 | symbol_cache_flush (current_program_space); | |
1688 | } | |
1689 | ||
1690 | /* This module's 'free_objfile' observer. */ | |
1691 | ||
1692 | static void | |
1693 | symtab_free_objfile_observer (struct objfile *objfile) | |
1694 | { | |
1695 | symbol_cache_flush (objfile->pspace); | |
1696 | } | |
1697 | \f | |
c906108c SS |
1698 | /* Debug symbols usually don't have section information. We need to dig that |
1699 | out of the minimal symbols and stash that in the debug symbol. */ | |
1700 | ||
ccefe4c4 | 1701 | void |
907fc202 UW |
1702 | fixup_section (struct general_symbol_info *ginfo, |
1703 | CORE_ADDR addr, struct objfile *objfile) | |
c906108c SS |
1704 | { |
1705 | struct minimal_symbol *msym; | |
c906108c | 1706 | |
bccdca4a UW |
1707 | /* First, check whether a minimal symbol with the same name exists |
1708 | and points to the same address. The address check is required | |
1709 | e.g. on PowerPC64, where the minimal symbol for a function will | |
1710 | point to the function descriptor, while the debug symbol will | |
1711 | point to the actual function code. */ | |
907fc202 UW |
1712 | msym = lookup_minimal_symbol_by_pc_name (addr, ginfo->name, objfile); |
1713 | if (msym) | |
efd66ac6 | 1714 | ginfo->section = MSYMBOL_SECTION (msym); |
907fc202 | 1715 | else |
19e2d14b KB |
1716 | { |
1717 | /* Static, function-local variables do appear in the linker | |
1718 | (minimal) symbols, but are frequently given names that won't | |
1719 | be found via lookup_minimal_symbol(). E.g., it has been | |
1720 | observed in frv-uclinux (ELF) executables that a static, | |
1721 | function-local variable named "foo" might appear in the | |
1722 | linker symbols as "foo.6" or "foo.3". Thus, there is no | |
1723 | point in attempting to extend the lookup-by-name mechanism to | |
1724 | handle this case due to the fact that there can be multiple | |
1725 | names. | |
9af17804 | 1726 | |
19e2d14b KB |
1727 | So, instead, search the section table when lookup by name has |
1728 | failed. The ``addr'' and ``endaddr'' fields may have already | |
1729 | been relocated. If so, the relocation offset (i.e. the | |
1730 | ANOFFSET value) needs to be subtracted from these values when | |
1731 | performing the comparison. We unconditionally subtract it, | |
1732 | because, when no relocation has been performed, the ANOFFSET | |
1733 | value will simply be zero. | |
9af17804 | 1734 | |
19e2d14b KB |
1735 | The address of the symbol whose section we're fixing up HAS |
1736 | NOT BEEN adjusted (relocated) yet. It can't have been since | |
1737 | the section isn't yet known and knowing the section is | |
1738 | necessary in order to add the correct relocation value. In | |
1739 | other words, we wouldn't even be in this function (attempting | |
1740 | to compute the section) if it were already known. | |
1741 | ||
1742 | Note that it is possible to search the minimal symbols | |
1743 | (subtracting the relocation value if necessary) to find the | |
1744 | matching minimal symbol, but this is overkill and much less | |
1745 | efficient. It is not necessary to find the matching minimal | |
9af17804 DE |
1746 | symbol, only its section. |
1747 | ||
19e2d14b KB |
1748 | Note that this technique (of doing a section table search) |
1749 | can fail when unrelocated section addresses overlap. For | |
1750 | this reason, we still attempt a lookup by name prior to doing | |
1751 | a search of the section table. */ | |
9af17804 | 1752 | |
19e2d14b | 1753 | struct obj_section *s; |
e27d198c | 1754 | int fallback = -1; |
433759f7 | 1755 | |
19e2d14b KB |
1756 | ALL_OBJFILE_OSECTIONS (objfile, s) |
1757 | { | |
65cf3563 | 1758 | int idx = s - objfile->sections; |
19e2d14b KB |
1759 | CORE_ADDR offset = ANOFFSET (objfile->section_offsets, idx); |
1760 | ||
e27d198c TT |
1761 | if (fallback == -1) |
1762 | fallback = idx; | |
1763 | ||
f1f6aadf PA |
1764 | if (obj_section_addr (s) - offset <= addr |
1765 | && addr < obj_section_endaddr (s) - offset) | |
19e2d14b | 1766 | { |
19e2d14b KB |
1767 | ginfo->section = idx; |
1768 | return; | |
1769 | } | |
1770 | } | |
e27d198c TT |
1771 | |
1772 | /* If we didn't find the section, assume it is in the first | |
1773 | section. If there is no allocated section, then it hardly | |
1774 | matters what we pick, so just pick zero. */ | |
1775 | if (fallback == -1) | |
1776 | ginfo->section = 0; | |
1777 | else | |
1778 | ginfo->section = fallback; | |
19e2d14b | 1779 | } |
c906108c SS |
1780 | } |
1781 | ||
1782 | struct symbol * | |
fba45db2 | 1783 | fixup_symbol_section (struct symbol *sym, struct objfile *objfile) |
c906108c | 1784 | { |
907fc202 UW |
1785 | CORE_ADDR addr; |
1786 | ||
c906108c SS |
1787 | if (!sym) |
1788 | return NULL; | |
1789 | ||
1994afbf DE |
1790 | if (!SYMBOL_OBJFILE_OWNED (sym)) |
1791 | return sym; | |
1792 | ||
907fc202 UW |
1793 | /* We either have an OBJFILE, or we can get at it from the sym's |
1794 | symtab. Anything else is a bug. */ | |
08be3fe3 | 1795 | gdb_assert (objfile || symbol_symtab (sym)); |
907fc202 UW |
1796 | |
1797 | if (objfile == NULL) | |
08be3fe3 | 1798 | objfile = symbol_objfile (sym); |
907fc202 | 1799 | |
e27d198c TT |
1800 | if (SYMBOL_OBJ_SECTION (objfile, sym)) |
1801 | return sym; | |
1802 | ||
907fc202 UW |
1803 | /* We should have an objfile by now. */ |
1804 | gdb_assert (objfile); | |
1805 | ||
1806 | switch (SYMBOL_CLASS (sym)) | |
1807 | { | |
1808 | case LOC_STATIC: | |
1809 | case LOC_LABEL: | |
907fc202 UW |
1810 | addr = SYMBOL_VALUE_ADDRESS (sym); |
1811 | break; | |
1812 | case LOC_BLOCK: | |
1813 | addr = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)); | |
1814 | break; | |
1815 | ||
1816 | default: | |
1817 | /* Nothing else will be listed in the minsyms -- no use looking | |
1818 | it up. */ | |
1819 | return sym; | |
1820 | } | |
1821 | ||
1822 | fixup_section (&sym->ginfo, addr, objfile); | |
c906108c SS |
1823 | |
1824 | return sym; | |
1825 | } | |
1826 | ||
f8eba3c6 TT |
1827 | /* Compute the demangled form of NAME as used by the various symbol |
1828 | lookup functions. The result is stored in *RESULT_NAME. Returns a | |
1829 | cleanup which can be used to clean up the result. | |
1830 | ||
1831 | For Ada, this function just sets *RESULT_NAME to NAME, unmodified. | |
1832 | Normally, Ada symbol lookups are performed using the encoded name | |
1833 | rather than the demangled name, and so it might seem to make sense | |
1834 | for this function to return an encoded version of NAME. | |
1835 | Unfortunately, we cannot do this, because this function is used in | |
1836 | circumstances where it is not appropriate to try to encode NAME. | |
1837 | For instance, when displaying the frame info, we demangle the name | |
1838 | of each parameter, and then perform a symbol lookup inside our | |
1839 | function using that demangled name. In Ada, certain functions | |
1840 | have internally-generated parameters whose name contain uppercase | |
1841 | characters. Encoding those name would result in those uppercase | |
1842 | characters to become lowercase, and thus cause the symbol lookup | |
1843 | to fail. */ | |
c906108c | 1844 | |
f8eba3c6 TT |
1845 | struct cleanup * |
1846 | demangle_for_lookup (const char *name, enum language lang, | |
1847 | const char **result_name) | |
c906108c | 1848 | { |
729051e6 DJ |
1849 | char *demangled_name = NULL; |
1850 | const char *modified_name = NULL; | |
9ee6bb93 | 1851 | struct cleanup *cleanup = make_cleanup (null_cleanup, 0); |
c906108c | 1852 | |
729051e6 DJ |
1853 | modified_name = name; |
1854 | ||
a766d390 | 1855 | /* If we are using C++, D, Go, or Java, demangle the name before doing a |
c378eb4e | 1856 | lookup, so we can always binary search. */ |
53c5240f | 1857 | if (lang == language_cplus) |
729051e6 | 1858 | { |
8de20a37 | 1859 | demangled_name = gdb_demangle (name, DMGL_ANSI | DMGL_PARAMS); |
729051e6 DJ |
1860 | if (demangled_name) |
1861 | { | |
729051e6 | 1862 | modified_name = demangled_name; |
9ee6bb93 | 1863 | make_cleanup (xfree, demangled_name); |
729051e6 | 1864 | } |
71c25dea TT |
1865 | else |
1866 | { | |
1867 | /* If we were given a non-mangled name, canonicalize it | |
1868 | according to the language (so far only for C++). */ | |
1869 | demangled_name = cp_canonicalize_string (name); | |
1870 | if (demangled_name) | |
1871 | { | |
1872 | modified_name = demangled_name; | |
1873 | make_cleanup (xfree, demangled_name); | |
1874 | } | |
1875 | } | |
729051e6 | 1876 | } |
53c5240f | 1877 | else if (lang == language_java) |
987504bb | 1878 | { |
8de20a37 TT |
1879 | demangled_name = gdb_demangle (name, |
1880 | DMGL_ANSI | DMGL_PARAMS | DMGL_JAVA); | |
987504bb JJ |
1881 | if (demangled_name) |
1882 | { | |
987504bb | 1883 | modified_name = demangled_name; |
9ee6bb93 | 1884 | make_cleanup (xfree, demangled_name); |
987504bb JJ |
1885 | } |
1886 | } | |
6aecb9c2 JB |
1887 | else if (lang == language_d) |
1888 | { | |
1889 | demangled_name = d_demangle (name, 0); | |
1890 | if (demangled_name) | |
1891 | { | |
1892 | modified_name = demangled_name; | |
1893 | make_cleanup (xfree, demangled_name); | |
1894 | } | |
1895 | } | |
a766d390 DE |
1896 | else if (lang == language_go) |
1897 | { | |
1898 | demangled_name = go_demangle (name, 0); | |
1899 | if (demangled_name) | |
1900 | { | |
1901 | modified_name = demangled_name; | |
1902 | make_cleanup (xfree, demangled_name); | |
1903 | } | |
1904 | } | |
729051e6 | 1905 | |
f8eba3c6 TT |
1906 | *result_name = modified_name; |
1907 | return cleanup; | |
1908 | } | |
1909 | ||
cf901d3b | 1910 | /* See symtab.h. |
f8eba3c6 | 1911 | |
cf901d3b | 1912 | This function (or rather its subordinates) have a bunch of loops and |
7e082072 DE |
1913 | it would seem to be attractive to put in some QUIT's (though I'm not really |
1914 | sure whether it can run long enough to be really important). But there | |
f8eba3c6 | 1915 | are a few calls for which it would appear to be bad news to quit |
7e082072 | 1916 | out of here: e.g., find_proc_desc in alpha-mdebug-tdep.c. (Note |
f8eba3c6 TT |
1917 | that there is C++ code below which can error(), but that probably |
1918 | doesn't affect these calls since they are looking for a known | |
1919 | variable and thus can probably assume it will never hit the C++ | |
1920 | code). */ | |
1921 | ||
d12307c1 | 1922 | struct block_symbol |
f8eba3c6 TT |
1923 | lookup_symbol_in_language (const char *name, const struct block *block, |
1924 | const domain_enum domain, enum language lang, | |
1993b719 | 1925 | struct field_of_this_result *is_a_field_of_this) |
f8eba3c6 TT |
1926 | { |
1927 | const char *modified_name; | |
d12307c1 | 1928 | struct block_symbol returnval; |
f8eba3c6 TT |
1929 | struct cleanup *cleanup = demangle_for_lookup (name, lang, &modified_name); |
1930 | ||
94af9270 | 1931 | returnval = lookup_symbol_aux (modified_name, block, domain, lang, |
774b6a14 | 1932 | is_a_field_of_this); |
9ee6bb93 | 1933 | do_cleanups (cleanup); |
fba7f19c | 1934 | |
9af17804 | 1935 | return returnval; |
fba7f19c EZ |
1936 | } |
1937 | ||
cf901d3b | 1938 | /* See symtab.h. */ |
53c5240f | 1939 | |
d12307c1 | 1940 | struct block_symbol |
53c5240f | 1941 | lookup_symbol (const char *name, const struct block *block, |
1993b719 TT |
1942 | domain_enum domain, |
1943 | struct field_of_this_result *is_a_field_of_this) | |
53c5240f PA |
1944 | { |
1945 | return lookup_symbol_in_language (name, block, domain, | |
1946 | current_language->la_language, | |
2570f2b7 | 1947 | is_a_field_of_this); |
53c5240f PA |
1948 | } |
1949 | ||
cf901d3b | 1950 | /* See symtab.h. */ |
66a17cb6 | 1951 | |
d12307c1 | 1952 | struct block_symbol |
66a17cb6 TT |
1953 | lookup_language_this (const struct language_defn *lang, |
1954 | const struct block *block) | |
1955 | { | |
1956 | if (lang->la_name_of_this == NULL || block == NULL) | |
d12307c1 | 1957 | return (struct block_symbol) {NULL, NULL}; |
66a17cb6 | 1958 | |
cc485e62 DE |
1959 | if (symbol_lookup_debug > 1) |
1960 | { | |
1961 | struct objfile *objfile = lookup_objfile_from_block (block); | |
1962 | ||
1963 | fprintf_unfiltered (gdb_stdlog, | |
1964 | "lookup_language_this (%s, %s (objfile %s))", | |
1965 | lang->la_name, host_address_to_string (block), | |
1966 | objfile_debug_name (objfile)); | |
1967 | } | |
1968 | ||
03de6823 | 1969 | while (block) |
66a17cb6 TT |
1970 | { |
1971 | struct symbol *sym; | |
1972 | ||
16b2eaa1 | 1973 | sym = block_lookup_symbol (block, lang->la_name_of_this, VAR_DOMAIN); |
66a17cb6 | 1974 | if (sym != NULL) |
f149aabd | 1975 | { |
cc485e62 DE |
1976 | if (symbol_lookup_debug > 1) |
1977 | { | |
1978 | fprintf_unfiltered (gdb_stdlog, " = %s (%s, block %s)\n", | |
1979 | SYMBOL_PRINT_NAME (sym), | |
1980 | host_address_to_string (sym), | |
1981 | host_address_to_string (block)); | |
1982 | } | |
d12307c1 | 1983 | return (struct block_symbol) {sym, block}; |
f149aabd | 1984 | } |
66a17cb6 | 1985 | if (BLOCK_FUNCTION (block)) |
03de6823 | 1986 | break; |
66a17cb6 TT |
1987 | block = BLOCK_SUPERBLOCK (block); |
1988 | } | |
03de6823 | 1989 | |
cc485e62 DE |
1990 | if (symbol_lookup_debug > 1) |
1991 | fprintf_unfiltered (gdb_stdlog, " = NULL\n"); | |
d12307c1 | 1992 | return (struct block_symbol) {NULL, NULL}; |
66a17cb6 TT |
1993 | } |
1994 | ||
2dc3df72 TT |
1995 | /* Given TYPE, a structure/union, |
1996 | return 1 if the component named NAME from the ultimate target | |
1997 | structure/union is defined, otherwise, return 0. */ | |
1998 | ||
1999 | static int | |
1993b719 TT |
2000 | check_field (struct type *type, const char *name, |
2001 | struct field_of_this_result *is_a_field_of_this) | |
2dc3df72 TT |
2002 | { |
2003 | int i; | |
2004 | ||
2005 | /* The type may be a stub. */ | |
f168693b | 2006 | type = check_typedef (type); |
2dc3df72 TT |
2007 | |
2008 | for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--) | |
2009 | { | |
2010 | const char *t_field_name = TYPE_FIELD_NAME (type, i); | |
2011 | ||
2012 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) | |
1993b719 TT |
2013 | { |
2014 | is_a_field_of_this->type = type; | |
2015 | is_a_field_of_this->field = &TYPE_FIELD (type, i); | |
2016 | return 1; | |
2017 | } | |
2dc3df72 TT |
2018 | } |
2019 | ||
2020 | /* C++: If it was not found as a data field, then try to return it | |
2021 | as a pointer to a method. */ | |
2022 | ||
2023 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i) | |
2024 | { | |
2025 | if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0) | |
1993b719 TT |
2026 | { |
2027 | is_a_field_of_this->type = type; | |
2028 | is_a_field_of_this->fn_field = &TYPE_FN_FIELDLIST (type, i); | |
2029 | return 1; | |
2030 | } | |
2dc3df72 TT |
2031 | } |
2032 | ||
2033 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) | |
1993b719 | 2034 | if (check_field (TYPE_BASECLASS (type, i), name, is_a_field_of_this)) |
2dc3df72 TT |
2035 | return 1; |
2036 | ||
2037 | return 0; | |
2038 | } | |
2039 | ||
53c5240f | 2040 | /* Behave like lookup_symbol except that NAME is the natural name |
7e082072 | 2041 | (e.g., demangled name) of the symbol that we're looking for. */ |
5ad1c190 | 2042 | |
d12307c1 | 2043 | static struct block_symbol |
94af9270 KS |
2044 | lookup_symbol_aux (const char *name, const struct block *block, |
2045 | const domain_enum domain, enum language language, | |
1993b719 | 2046 | struct field_of_this_result *is_a_field_of_this) |
fba7f19c | 2047 | { |
d12307c1 | 2048 | struct block_symbol result; |
53c5240f | 2049 | const struct language_defn *langdef; |
406bc4de | 2050 | |
cc485e62 DE |
2051 | if (symbol_lookup_debug) |
2052 | { | |
2053 | struct objfile *objfile = lookup_objfile_from_block (block); | |
2054 | ||
2055 | fprintf_unfiltered (gdb_stdlog, | |
2056 | "lookup_symbol_aux (%s, %s (objfile %s), %s, %s)\n", | |
2057 | name, host_address_to_string (block), | |
2058 | objfile != NULL | |
2059 | ? objfile_debug_name (objfile) : "NULL", | |
2060 | domain_name (domain), language_str (language)); | |
2061 | } | |
2062 | ||
9a146a11 EZ |
2063 | /* Make sure we do something sensible with is_a_field_of_this, since |
2064 | the callers that set this parameter to some non-null value will | |
1993b719 TT |
2065 | certainly use it later. If we don't set it, the contents of |
2066 | is_a_field_of_this are undefined. */ | |
9a146a11 | 2067 | if (is_a_field_of_this != NULL) |
1993b719 | 2068 | memset (is_a_field_of_this, 0, sizeof (*is_a_field_of_this)); |
9a146a11 | 2069 | |
e4051eeb DC |
2070 | /* Search specified block and its superiors. Don't search |
2071 | STATIC_BLOCK or GLOBAL_BLOCK. */ | |
c906108c | 2072 | |
d12307c1 PMR |
2073 | result = lookup_local_symbol (name, block, domain, language); |
2074 | if (result.symbol != NULL) | |
cc485e62 DE |
2075 | { |
2076 | if (symbol_lookup_debug) | |
2077 | { | |
2078 | fprintf_unfiltered (gdb_stdlog, "lookup_symbol_aux (...) = %s\n", | |
d12307c1 | 2079 | host_address_to_string (result.symbol)); |
cc485e62 | 2080 | } |
d12307c1 | 2081 | return result; |
cc485e62 | 2082 | } |
c906108c | 2083 | |
53c5240f | 2084 | /* If requested to do so by the caller and if appropriate for LANGUAGE, |
13387711 | 2085 | check to see if NAME is a field of `this'. */ |
53c5240f PA |
2086 | |
2087 | langdef = language_def (language); | |
5f9a71c3 | 2088 | |
6592e36f TT |
2089 | /* Don't do this check if we are searching for a struct. It will |
2090 | not be found by check_field, but will be found by other | |
2091 | means. */ | |
2092 | if (is_a_field_of_this != NULL && domain != STRUCT_DOMAIN) | |
c906108c | 2093 | { |
d12307c1 | 2094 | result = lookup_language_this (langdef, block); |
2b2d9e11 | 2095 | |
d12307c1 | 2096 | if (result.symbol) |
c906108c | 2097 | { |
d12307c1 | 2098 | struct type *t = result.symbol->type; |
9af17804 | 2099 | |
2b2d9e11 VP |
2100 | /* I'm not really sure that type of this can ever |
2101 | be typedefed; just be safe. */ | |
f168693b | 2102 | t = check_typedef (t); |
2b2d9e11 VP |
2103 | if (TYPE_CODE (t) == TYPE_CODE_PTR |
2104 | || TYPE_CODE (t) == TYPE_CODE_REF) | |
2105 | t = TYPE_TARGET_TYPE (t); | |
9af17804 | 2106 | |
2b2d9e11 VP |
2107 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
2108 | && TYPE_CODE (t) != TYPE_CODE_UNION) | |
9af17804 | 2109 | error (_("Internal error: `%s' is not an aggregate"), |
2b2d9e11 | 2110 | langdef->la_name_of_this); |
9af17804 | 2111 | |
1993b719 | 2112 | if (check_field (t, name, is_a_field_of_this)) |
cc485e62 DE |
2113 | { |
2114 | if (symbol_lookup_debug) | |
2115 | { | |
2116 | fprintf_unfiltered (gdb_stdlog, | |
2117 | "lookup_symbol_aux (...) = NULL\n"); | |
2118 | } | |
d12307c1 | 2119 | return (struct block_symbol) {NULL, NULL}; |
cc485e62 | 2120 | } |
c906108c SS |
2121 | } |
2122 | } | |
2123 | ||
53c5240f | 2124 | /* Now do whatever is appropriate for LANGUAGE to look |
774b6a14 | 2125 | up static and global variables. */ |
c906108c | 2126 | |
d12307c1 PMR |
2127 | result = langdef->la_lookup_symbol_nonlocal (langdef, name, block, domain); |
2128 | if (result.symbol != NULL) | |
cc485e62 DE |
2129 | { |
2130 | if (symbol_lookup_debug) | |
2131 | { | |
2132 | fprintf_unfiltered (gdb_stdlog, "lookup_symbol_aux (...) = %s\n", | |
d12307c1 | 2133 | host_address_to_string (result.symbol)); |
cc485e62 | 2134 | } |
d12307c1 | 2135 | return result; |
cc485e62 | 2136 | } |
c906108c | 2137 | |
774b6a14 TT |
2138 | /* Now search all static file-level symbols. Not strictly correct, |
2139 | but more useful than an error. */ | |
41f62f39 | 2140 | |
d12307c1 | 2141 | result = lookup_static_symbol (name, domain); |
cc485e62 DE |
2142 | if (symbol_lookup_debug) |
2143 | { | |
2144 | fprintf_unfiltered (gdb_stdlog, "lookup_symbol_aux (...) = %s\n", | |
d12307c1 PMR |
2145 | result.symbol != NULL |
2146 | ? host_address_to_string (result.symbol) | |
2147 | : "NULL"); | |
cc485e62 | 2148 | } |
d12307c1 | 2149 | return result; |
41f62f39 JK |
2150 | } |
2151 | ||
e4051eeb | 2152 | /* Check to see if the symbol is defined in BLOCK or its superiors. |
89a9d1b1 | 2153 | Don't search STATIC_BLOCK or GLOBAL_BLOCK. */ |
8155455b | 2154 | |
d12307c1 | 2155 | static struct block_symbol |
74016e12 DE |
2156 | lookup_local_symbol (const char *name, const struct block *block, |
2157 | const domain_enum domain, | |
2158 | enum language language) | |
8155455b DC |
2159 | { |
2160 | struct symbol *sym; | |
89a9d1b1 | 2161 | const struct block *static_block = block_static_block (block); |
13387711 SW |
2162 | const char *scope = block_scope (block); |
2163 | ||
e4051eeb DC |
2164 | /* Check if either no block is specified or it's a global block. */ |
2165 | ||
89a9d1b1 | 2166 | if (static_block == NULL) |
d12307c1 | 2167 | return (struct block_symbol) {NULL, NULL}; |
e4051eeb | 2168 | |
89a9d1b1 | 2169 | while (block != static_block) |
f61e8913 | 2170 | { |
d1a2d36d | 2171 | sym = lookup_symbol_in_block (name, block, domain); |
f61e8913 | 2172 | if (sym != NULL) |
d12307c1 | 2173 | return (struct block_symbol) {sym, block}; |
edb3359d | 2174 | |
f55ee35c | 2175 | if (language == language_cplus || language == language_fortran) |
13387711 | 2176 | { |
d12307c1 PMR |
2177 | struct block_symbol sym |
2178 | = cp_lookup_symbol_imports_or_template (scope, name, block, | |
2179 | domain); | |
2180 | ||
2181 | if (sym.symbol != NULL) | |
13387711 SW |
2182 | return sym; |
2183 | } | |
2184 | ||
edb3359d DJ |
2185 | if (BLOCK_FUNCTION (block) != NULL && block_inlined_p (block)) |
2186 | break; | |
f61e8913 DC |
2187 | block = BLOCK_SUPERBLOCK (block); |
2188 | } | |
2189 | ||
3aee438b | 2190 | /* We've reached the end of the function without finding a result. */ |
e4051eeb | 2191 | |
d12307c1 | 2192 | return (struct block_symbol) {NULL, NULL}; |
f61e8913 DC |
2193 | } |
2194 | ||
cf901d3b | 2195 | /* See symtab.h. */ |
3a40aaa0 | 2196 | |
c0201579 | 2197 | struct objfile * |
3a40aaa0 UW |
2198 | lookup_objfile_from_block (const struct block *block) |
2199 | { | |
2200 | struct objfile *obj; | |
43f3e411 | 2201 | struct compunit_symtab *cust; |
3a40aaa0 UW |
2202 | |
2203 | if (block == NULL) | |
2204 | return NULL; | |
2205 | ||
2206 | block = block_global_block (block); | |
43f3e411 DE |
2207 | /* Look through all blockvectors. */ |
2208 | ALL_COMPUNITS (obj, cust) | |
2209 | if (block == BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cust), | |
2210 | GLOBAL_BLOCK)) | |
61f0d762 JK |
2211 | { |
2212 | if (obj->separate_debug_objfile_backlink) | |
2213 | obj = obj->separate_debug_objfile_backlink; | |
2214 | ||
2215 | return obj; | |
2216 | } | |
3a40aaa0 UW |
2217 | |
2218 | return NULL; | |
2219 | } | |
2220 | ||
cf901d3b | 2221 | /* See symtab.h. */ |
f61e8913 | 2222 | |
5f9a71c3 | 2223 | struct symbol * |
d1a2d36d DE |
2224 | lookup_symbol_in_block (const char *name, const struct block *block, |
2225 | const domain_enum domain) | |
f61e8913 DC |
2226 | { |
2227 | struct symbol *sym; | |
f61e8913 | 2228 | |
cc485e62 DE |
2229 | if (symbol_lookup_debug > 1) |
2230 | { | |
2231 | struct objfile *objfile = lookup_objfile_from_block (block); | |
2232 | ||
2233 | fprintf_unfiltered (gdb_stdlog, | |
2234 | "lookup_symbol_in_block (%s, %s (objfile %s), %s)", | |
2235 | name, host_address_to_string (block), | |
2236 | objfile_debug_name (objfile), | |
2237 | domain_name (domain)); | |
2238 | } | |
2239 | ||
16b2eaa1 | 2240 | sym = block_lookup_symbol (block, name, domain); |
f61e8913 | 2241 | if (sym) |
8155455b | 2242 | { |
cc485e62 DE |
2243 | if (symbol_lookup_debug > 1) |
2244 | { | |
2245 | fprintf_unfiltered (gdb_stdlog, " = %s\n", | |
2246 | host_address_to_string (sym)); | |
2247 | } | |
21b556f4 | 2248 | return fixup_symbol_section (sym, NULL); |
8155455b DC |
2249 | } |
2250 | ||
cc485e62 DE |
2251 | if (symbol_lookup_debug > 1) |
2252 | fprintf_unfiltered (gdb_stdlog, " = NULL\n"); | |
8155455b DC |
2253 | return NULL; |
2254 | } | |
2255 | ||
cf901d3b | 2256 | /* See symtab.h. */ |
3a40aaa0 | 2257 | |
d12307c1 | 2258 | struct block_symbol |
efad9b6a | 2259 | lookup_global_symbol_from_objfile (struct objfile *main_objfile, |
3a40aaa0 | 2260 | const char *name, |
21b556f4 | 2261 | const domain_enum domain) |
3a40aaa0 | 2262 | { |
efad9b6a | 2263 | struct objfile *objfile; |
3a40aaa0 | 2264 | |
15d123c9 TG |
2265 | for (objfile = main_objfile; |
2266 | objfile; | |
2267 | objfile = objfile_separate_debug_iterate (main_objfile, objfile)) | |
2268 | { | |
d12307c1 PMR |
2269 | struct block_symbol result |
2270 | = lookup_symbol_in_objfile (objfile, GLOBAL_BLOCK, name, domain); | |
15d123c9 | 2271 | |
d12307c1 PMR |
2272 | if (result.symbol != NULL) |
2273 | return result; | |
15d123c9 | 2274 | } |
56e3f43c | 2275 | |
d12307c1 | 2276 | return (struct block_symbol) {NULL, NULL}; |
3a40aaa0 UW |
2277 | } |
2278 | ||
19630284 JB |
2279 | /* Check to see if the symbol is defined in one of the OBJFILE's |
2280 | symtabs. BLOCK_INDEX should be either GLOBAL_BLOCK or STATIC_BLOCK, | |
8155455b DC |
2281 | depending on whether or not we want to search global symbols or |
2282 | static symbols. */ | |
2283 | ||
d12307c1 | 2284 | static struct block_symbol |
74016e12 DE |
2285 | lookup_symbol_in_objfile_symtabs (struct objfile *objfile, int block_index, |
2286 | const char *name, const domain_enum domain) | |
19630284 | 2287 | { |
43f3e411 | 2288 | struct compunit_symtab *cust; |
19630284 | 2289 | |
ba715d7f JK |
2290 | gdb_assert (block_index == GLOBAL_BLOCK || block_index == STATIC_BLOCK); |
2291 | ||
cc485e62 DE |
2292 | if (symbol_lookup_debug > 1) |
2293 | { | |
2294 | fprintf_unfiltered (gdb_stdlog, | |
2295 | "lookup_symbol_in_objfile_symtabs (%s, %s, %s, %s)", | |
2296 | objfile_debug_name (objfile), | |
2297 | block_index == GLOBAL_BLOCK | |
2298 | ? "GLOBAL_BLOCK" : "STATIC_BLOCK", | |
2299 | name, domain_name (domain)); | |
2300 | } | |
2301 | ||
43f3e411 | 2302 | ALL_OBJFILE_COMPUNITS (objfile, cust) |
a743abeb | 2303 | { |
43f3e411 DE |
2304 | const struct blockvector *bv; |
2305 | const struct block *block; | |
d12307c1 | 2306 | struct block_symbol result; |
43f3e411 DE |
2307 | |
2308 | bv = COMPUNIT_BLOCKVECTOR (cust); | |
a743abeb | 2309 | block = BLOCKVECTOR_BLOCK (bv, block_index); |
d12307c1 PMR |
2310 | result.symbol = block_lookup_symbol_primary (block, name, domain); |
2311 | result.block = block; | |
2312 | if (result.symbol != NULL) | |
a743abeb | 2313 | { |
cc485e62 DE |
2314 | if (symbol_lookup_debug > 1) |
2315 | { | |
2316 | fprintf_unfiltered (gdb_stdlog, " = %s (block %s)\n", | |
d12307c1 | 2317 | host_address_to_string (result.symbol), |
cc485e62 DE |
2318 | host_address_to_string (block)); |
2319 | } | |
d12307c1 PMR |
2320 | result.symbol = fixup_symbol_section (result.symbol, objfile); |
2321 | return result; | |
2322 | ||
a743abeb DE |
2323 | } |
2324 | } | |
19630284 | 2325 | |
cc485e62 DE |
2326 | if (symbol_lookup_debug > 1) |
2327 | fprintf_unfiltered (gdb_stdlog, " = NULL\n"); | |
d12307c1 | 2328 | return (struct block_symbol) {NULL, NULL}; |
19630284 JB |
2329 | } |
2330 | ||
74016e12 | 2331 | /* Wrapper around lookup_symbol_in_objfile_symtabs for search_symbols. |
422d65e7 | 2332 | Look up LINKAGE_NAME in DOMAIN in the global and static blocks of OBJFILE |
01465b56 DE |
2333 | and all associated separate debug objfiles. |
2334 | ||
2335 | Normally we only look in OBJFILE, and not any separate debug objfiles | |
2336 | because the outer loop will cause them to be searched too. This case is | |
2337 | different. Here we're called from search_symbols where it will only | |
2338 | call us for the the objfile that contains a matching minsym. */ | |
422d65e7 | 2339 | |
d12307c1 | 2340 | static struct block_symbol |
422d65e7 DE |
2341 | lookup_symbol_in_objfile_from_linkage_name (struct objfile *objfile, |
2342 | const char *linkage_name, | |
2343 | domain_enum domain) | |
2344 | { | |
2345 | enum language lang = current_language->la_language; | |
2346 | const char *modified_name; | |
2347 | struct cleanup *cleanup = demangle_for_lookup (linkage_name, lang, | |
2348 | &modified_name); | |
2349 | struct objfile *main_objfile, *cur_objfile; | |
2350 | ||
2351 | if (objfile->separate_debug_objfile_backlink) | |
2352 | main_objfile = objfile->separate_debug_objfile_backlink; | |
2353 | else | |
2354 | main_objfile = objfile; | |
2355 | ||
2356 | for (cur_objfile = main_objfile; | |
2357 | cur_objfile; | |
2358 | cur_objfile = objfile_separate_debug_iterate (main_objfile, cur_objfile)) | |
2359 | { | |
d12307c1 PMR |
2360 | struct block_symbol result; |
2361 | ||
2362 | result = lookup_symbol_in_objfile_symtabs (cur_objfile, GLOBAL_BLOCK, | |
2363 | modified_name, domain); | |
2364 | if (result.symbol == NULL) | |
2365 | result = lookup_symbol_in_objfile_symtabs (cur_objfile, STATIC_BLOCK, | |
2366 | modified_name, domain); | |
2367 | if (result.symbol != NULL) | |
422d65e7 DE |
2368 | { |
2369 | do_cleanups (cleanup); | |
d12307c1 | 2370 | return result; |
422d65e7 DE |
2371 | } |
2372 | } | |
2373 | ||
2374 | do_cleanups (cleanup); | |
d12307c1 | 2375 | return (struct block_symbol) {NULL, NULL}; |
422d65e7 DE |
2376 | } |
2377 | ||
08c23b0d TT |
2378 | /* A helper function that throws an exception when a symbol was found |
2379 | in a psymtab but not in a symtab. */ | |
2380 | ||
2381 | static void ATTRIBUTE_NORETURN | |
f88cb4b6 | 2382 | error_in_psymtab_expansion (int block_index, const char *name, |
43f3e411 | 2383 | struct compunit_symtab *cust) |
08c23b0d TT |
2384 | { |
2385 | error (_("\ | |
2386 | Internal: %s symbol `%s' found in %s psymtab but not in symtab.\n\ | |
2387 | %s may be an inlined function, or may be a template function\n \ | |
2388 | (if a template, try specifying an instantiation: %s<type>)."), | |
f88cb4b6 | 2389 | block_index == GLOBAL_BLOCK ? "global" : "static", |
43f3e411 DE |
2390 | name, |
2391 | symtab_to_filename_for_display (compunit_primary_filetab (cust)), | |
2392 | name, name); | |
08c23b0d TT |
2393 | } |
2394 | ||
74016e12 DE |
2395 | /* A helper function for various lookup routines that interfaces with |
2396 | the "quick" symbol table functions. */ | |
8155455b | 2397 | |
d12307c1 | 2398 | static struct block_symbol |
74016e12 DE |
2399 | lookup_symbol_via_quick_fns (struct objfile *objfile, int block_index, |
2400 | const char *name, const domain_enum domain) | |
8155455b | 2401 | { |
43f3e411 | 2402 | struct compunit_symtab *cust; |
346d1dfe | 2403 | const struct blockvector *bv; |
8155455b | 2404 | const struct block *block; |
d12307c1 | 2405 | struct block_symbol result; |
8155455b | 2406 | |
ccefe4c4 | 2407 | if (!objfile->sf) |
d12307c1 | 2408 | return (struct block_symbol) {NULL, NULL}; |
cc485e62 DE |
2409 | |
2410 | if (symbol_lookup_debug > 1) | |
2411 | { | |
2412 | fprintf_unfiltered (gdb_stdlog, | |
2413 | "lookup_symbol_via_quick_fns (%s, %s, %s, %s)\n", | |
2414 | objfile_debug_name (objfile), | |
2415 | block_index == GLOBAL_BLOCK | |
2416 | ? "GLOBAL_BLOCK" : "STATIC_BLOCK", | |
2417 | name, domain_name (domain)); | |
2418 | } | |
2419 | ||
43f3e411 DE |
2420 | cust = objfile->sf->qf->lookup_symbol (objfile, block_index, name, domain); |
2421 | if (cust == NULL) | |
cc485e62 DE |
2422 | { |
2423 | if (symbol_lookup_debug > 1) | |
2424 | { | |
2425 | fprintf_unfiltered (gdb_stdlog, | |
2426 | "lookup_symbol_via_quick_fns (...) = NULL\n"); | |
2427 | } | |
d12307c1 | 2428 | return (struct block_symbol) {NULL, NULL}; |
cc485e62 | 2429 | } |
8155455b | 2430 | |
43f3e411 | 2431 | bv = COMPUNIT_BLOCKVECTOR (cust); |
f88cb4b6 | 2432 | block = BLOCKVECTOR_BLOCK (bv, block_index); |
d12307c1 PMR |
2433 | result.symbol = block_lookup_symbol (block, name, domain); |
2434 | if (result.symbol == NULL) | |
43f3e411 | 2435 | error_in_psymtab_expansion (block_index, name, cust); |
cc485e62 DE |
2436 | |
2437 | if (symbol_lookup_debug > 1) | |
2438 | { | |
2439 | fprintf_unfiltered (gdb_stdlog, | |
2440 | "lookup_symbol_via_quick_fns (...) = %s (block %s)\n", | |
d12307c1 | 2441 | host_address_to_string (result.symbol), |
cc485e62 DE |
2442 | host_address_to_string (block)); |
2443 | } | |
2444 | ||
d12307c1 PMR |
2445 | result.symbol = fixup_symbol_section (result.symbol, objfile); |
2446 | result.block = block; | |
2447 | return result; | |
8155455b DC |
2448 | } |
2449 | ||
cf901d3b | 2450 | /* See symtab.h. */ |
5f9a71c3 | 2451 | |
d12307c1 | 2452 | struct block_symbol |
f606139a DE |
2453 | basic_lookup_symbol_nonlocal (const struct language_defn *langdef, |
2454 | const char *name, | |
5f9a71c3 | 2455 | const struct block *block, |
21b556f4 | 2456 | const domain_enum domain) |
5f9a71c3 | 2457 | { |
d12307c1 | 2458 | struct block_symbol result; |
5f9a71c3 DC |
2459 | |
2460 | /* NOTE: carlton/2003-05-19: The comments below were written when | |
2461 | this (or what turned into this) was part of lookup_symbol_aux; | |
2462 | I'm much less worried about these questions now, since these | |
2463 | decisions have turned out well, but I leave these comments here | |
2464 | for posterity. */ | |
2465 | ||
2466 | /* NOTE: carlton/2002-12-05: There is a question as to whether or | |
2467 | not it would be appropriate to search the current global block | |
2468 | here as well. (That's what this code used to do before the | |
2469 | is_a_field_of_this check was moved up.) On the one hand, it's | |
af3768e9 | 2470 | redundant with the lookup in all objfiles search that happens |
5f9a71c3 DC |
2471 | next. On the other hand, if decode_line_1 is passed an argument |
2472 | like filename:var, then the user presumably wants 'var' to be | |
2473 | searched for in filename. On the third hand, there shouldn't be | |
2474 | multiple global variables all of which are named 'var', and it's | |
2475 | not like decode_line_1 has ever restricted its search to only | |
2476 | global variables in a single filename. All in all, only | |
2477 | searching the static block here seems best: it's correct and it's | |
2478 | cleanest. */ | |
2479 | ||
2480 | /* NOTE: carlton/2002-12-05: There's also a possible performance | |
2481 | issue here: if you usually search for global symbols in the | |
2482 | current file, then it would be slightly better to search the | |
2483 | current global block before searching all the symtabs. But there | |
2484 | are other factors that have a much greater effect on performance | |
2485 | than that one, so I don't think we should worry about that for | |
2486 | now. */ | |
2487 | ||
d9060ba6 DE |
2488 | /* NOTE: dje/2014-10-26: The lookup in all objfiles search could skip |
2489 | the current objfile. Searching the current objfile first is useful | |
2490 | for both matching user expectations as well as performance. */ | |
2491 | ||
d12307c1 PMR |
2492 | result = lookup_symbol_in_static_block (name, block, domain); |
2493 | if (result.symbol != NULL) | |
2494 | return result; | |
5f9a71c3 | 2495 | |
1994afbf DE |
2496 | /* If we didn't find a definition for a builtin type in the static block, |
2497 | search for it now. This is actually the right thing to do and can be | |
2498 | a massive performance win. E.g., when debugging a program with lots of | |
2499 | shared libraries we could search all of them only to find out the | |
2500 | builtin type isn't defined in any of them. This is common for types | |
2501 | like "void". */ | |
2502 | if (domain == VAR_DOMAIN) | |
2503 | { | |
2504 | struct gdbarch *gdbarch; | |
2505 | ||
2506 | if (block == NULL) | |
2507 | gdbarch = target_gdbarch (); | |
2508 | else | |
2509 | gdbarch = block_gdbarch (block); | |
d12307c1 PMR |
2510 | result.symbol = language_lookup_primitive_type_as_symbol (langdef, |
2511 | gdbarch, name); | |
2512 | result.block = NULL; | |
2513 | if (result.symbol != NULL) | |
2514 | return result; | |
1994afbf DE |
2515 | } |
2516 | ||
08724ab7 | 2517 | return lookup_global_symbol (name, block, domain); |
5f9a71c3 DC |
2518 | } |
2519 | ||
cf901d3b | 2520 | /* See symtab.h. */ |
5f9a71c3 | 2521 | |
d12307c1 | 2522 | struct block_symbol |
24d864bb DE |
2523 | lookup_symbol_in_static_block (const char *name, |
2524 | const struct block *block, | |
2525 | const domain_enum domain) | |
5f9a71c3 DC |
2526 | { |
2527 | const struct block *static_block = block_static_block (block); | |
cc485e62 | 2528 | struct symbol *sym; |
5f9a71c3 | 2529 | |
cc485e62 | 2530 | if (static_block == NULL) |
d12307c1 | 2531 | return (struct block_symbol) {NULL, NULL}; |
cc485e62 DE |
2532 | |
2533 | if (symbol_lookup_debug) | |
2534 | { | |
2535 | struct objfile *objfile = lookup_objfile_from_block (static_block); | |
2536 | ||
2537 | fprintf_unfiltered (gdb_stdlog, | |
2538 | "lookup_symbol_in_static_block (%s, %s (objfile %s)," | |
2539 | " %s)\n", | |
2540 | name, | |
2541 | host_address_to_string (block), | |
2542 | objfile_debug_name (objfile), | |
2543 | domain_name (domain)); | |
2544 | } | |
2545 | ||
2546 | sym = lookup_symbol_in_block (name, static_block, domain); | |
2547 | if (symbol_lookup_debug) | |
2548 | { | |
2549 | fprintf_unfiltered (gdb_stdlog, | |
2550 | "lookup_symbol_in_static_block (...) = %s\n", | |
2551 | sym != NULL ? host_address_to_string (sym) : "NULL"); | |
2552 | } | |
d12307c1 | 2553 | return (struct block_symbol) {sym, static_block}; |
5f9a71c3 DC |
2554 | } |
2555 | ||
af3768e9 DE |
2556 | /* Perform the standard symbol lookup of NAME in OBJFILE: |
2557 | 1) First search expanded symtabs, and if not found | |
2558 | 2) Search the "quick" symtabs (partial or .gdb_index). | |
2559 | BLOCK_INDEX is one of GLOBAL_BLOCK or STATIC_BLOCK. */ | |
2560 | ||
d12307c1 | 2561 | static struct block_symbol |
af3768e9 DE |
2562 | lookup_symbol_in_objfile (struct objfile *objfile, int block_index, |
2563 | const char *name, const domain_enum domain) | |
2564 | { | |
d12307c1 | 2565 | struct block_symbol result; |
af3768e9 | 2566 | |
cc485e62 DE |
2567 | if (symbol_lookup_debug) |
2568 | { | |
2569 | fprintf_unfiltered (gdb_stdlog, | |
2570 | "lookup_symbol_in_objfile (%s, %s, %s, %s)\n", | |
2571 | objfile_debug_name (objfile), | |
2572 | block_index == GLOBAL_BLOCK | |
2573 | ? "GLOBAL_BLOCK" : "STATIC_BLOCK", | |
2574 | name, domain_name (domain)); | |
2575 | } | |
2576 | ||
af3768e9 DE |
2577 | result = lookup_symbol_in_objfile_symtabs (objfile, block_index, |
2578 | name, domain); | |
d12307c1 | 2579 | if (result.symbol != NULL) |
af3768e9 | 2580 | { |
cc485e62 DE |
2581 | if (symbol_lookup_debug) |
2582 | { | |
2583 | fprintf_unfiltered (gdb_stdlog, | |
2584 | "lookup_symbol_in_objfile (...) = %s" | |
2585 | " (in symtabs)\n", | |
d12307c1 | 2586 | host_address_to_string (result.symbol)); |
cc485e62 DE |
2587 | } |
2588 | return result; | |
af3768e9 DE |
2589 | } |
2590 | ||
cc485e62 DE |
2591 | result = lookup_symbol_via_quick_fns (objfile, block_index, |
2592 | name, domain); | |
2593 | if (symbol_lookup_debug) | |
2594 | { | |
2595 | fprintf_unfiltered (gdb_stdlog, | |
2596 | "lookup_symbol_in_objfile (...) = %s%s\n", | |
d12307c1 PMR |
2597 | result.symbol != NULL |
2598 | ? host_address_to_string (result.symbol) | |
cc485e62 | 2599 | : "NULL", |
d12307c1 | 2600 | result.symbol != NULL ? " (via quick fns)" : ""); |
cc485e62 | 2601 | } |
af3768e9 DE |
2602 | return result; |
2603 | } | |
2604 | ||
2605 | /* See symtab.h. */ | |
2606 | ||
d12307c1 | 2607 | struct block_symbol |
af3768e9 DE |
2608 | lookup_static_symbol (const char *name, const domain_enum domain) |
2609 | { | |
f57d2163 | 2610 | struct symbol_cache *cache = get_symbol_cache (current_program_space); |
af3768e9 | 2611 | struct objfile *objfile; |
d12307c1 | 2612 | struct block_symbol result; |
f57d2163 DE |
2613 | struct block_symbol_cache *bsc; |
2614 | struct symbol_cache_slot *slot; | |
2615 | ||
2616 | /* Lookup in STATIC_BLOCK is not current-objfile-dependent, so just pass | |
2617 | NULL for OBJFILE_CONTEXT. */ | |
2618 | result = symbol_cache_lookup (cache, NULL, STATIC_BLOCK, name, domain, | |
2619 | &bsc, &slot); | |
d12307c1 | 2620 | if (result.symbol != NULL) |
f57d2163 | 2621 | { |
d12307c1 PMR |
2622 | if (SYMBOL_LOOKUP_FAILED_P (result)) |
2623 | return (struct block_symbol) {NULL, NULL}; | |
f57d2163 DE |
2624 | return result; |
2625 | } | |
af3768e9 DE |
2626 | |
2627 | ALL_OBJFILES (objfile) | |
2628 | { | |
2629 | result = lookup_symbol_in_objfile (objfile, STATIC_BLOCK, name, domain); | |
d12307c1 | 2630 | if (result.symbol != NULL) |
f57d2163 DE |
2631 | { |
2632 | /* Still pass NULL for OBJFILE_CONTEXT here. */ | |
d12307c1 PMR |
2633 | symbol_cache_mark_found (bsc, slot, NULL, result.symbol, |
2634 | result.block); | |
f57d2163 DE |
2635 | return result; |
2636 | } | |
af3768e9 DE |
2637 | } |
2638 | ||
f57d2163 DE |
2639 | /* Still pass NULL for OBJFILE_CONTEXT here. */ |
2640 | symbol_cache_mark_not_found (bsc, slot, NULL, name, domain); | |
d12307c1 | 2641 | return (struct block_symbol) {NULL, NULL}; |
af3768e9 DE |
2642 | } |
2643 | ||
19630284 JB |
2644 | /* Private data to be used with lookup_symbol_global_iterator_cb. */ |
2645 | ||
2646 | struct global_sym_lookup_data | |
2647 | { | |
2648 | /* The name of the symbol we are searching for. */ | |
2649 | const char *name; | |
2650 | ||
2651 | /* The domain to use for our search. */ | |
2652 | domain_enum domain; | |
2653 | ||
2654 | /* The field where the callback should store the symbol if found. | |
d12307c1 PMR |
2655 | It should be initialized to {NULL, NULL} before the search is started. */ |
2656 | struct block_symbol result; | |
19630284 JB |
2657 | }; |
2658 | ||
2659 | /* A callback function for gdbarch_iterate_over_objfiles_in_search_order. | |
2660 | It searches by name for a symbol in the GLOBAL_BLOCK of the given | |
2661 | OBJFILE. The arguments for the search are passed via CB_DATA, | |
2662 | which in reality is a pointer to struct global_sym_lookup_data. */ | |
2663 | ||
2664 | static int | |
2665 | lookup_symbol_global_iterator_cb (struct objfile *objfile, | |
2666 | void *cb_data) | |
2667 | { | |
2668 | struct global_sym_lookup_data *data = | |
2669 | (struct global_sym_lookup_data *) cb_data; | |
2670 | ||
d12307c1 PMR |
2671 | gdb_assert (data->result.symbol == NULL |
2672 | && data->result.block == NULL); | |
19630284 | 2673 | |
af3768e9 DE |
2674 | data->result = lookup_symbol_in_objfile (objfile, GLOBAL_BLOCK, |
2675 | data->name, data->domain); | |
19630284 JB |
2676 | |
2677 | /* If we found a match, tell the iterator to stop. Otherwise, | |
2678 | keep going. */ | |
d12307c1 | 2679 | return (data->result.symbol != NULL); |
19630284 JB |
2680 | } |
2681 | ||
cf901d3b | 2682 | /* See symtab.h. */ |
5f9a71c3 | 2683 | |
d12307c1 | 2684 | struct block_symbol |
08724ab7 | 2685 | lookup_global_symbol (const char *name, |
3a40aaa0 | 2686 | const struct block *block, |
21b556f4 | 2687 | const domain_enum domain) |
5f9a71c3 | 2688 | { |
f57d2163 | 2689 | struct symbol_cache *cache = get_symbol_cache (current_program_space); |
d12307c1 | 2690 | struct block_symbol result; |
f57d2163 | 2691 | struct objfile *objfile; |
19630284 | 2692 | struct global_sym_lookup_data lookup_data; |
f57d2163 DE |
2693 | struct block_symbol_cache *bsc; |
2694 | struct symbol_cache_slot *slot; | |
b2fb95e0 | 2695 | |
6a3ca067 | 2696 | objfile = lookup_objfile_from_block (block); |
f57d2163 DE |
2697 | |
2698 | /* First see if we can find the symbol in the cache. | |
2699 | This works because we use the current objfile to qualify the lookup. */ | |
d12307c1 PMR |
2700 | result = symbol_cache_lookup (cache, objfile, GLOBAL_BLOCK, name, domain, |
2701 | &bsc, &slot); | |
2702 | if (result.symbol != NULL) | |
f57d2163 | 2703 | { |
d12307c1 PMR |
2704 | if (SYMBOL_LOOKUP_FAILED_P (result)) |
2705 | return (struct block_symbol) {NULL, NULL}; | |
2706 | return result; | |
f57d2163 DE |
2707 | } |
2708 | ||
2709 | /* Call library-specific lookup procedure. */ | |
67ff19f7 | 2710 | if (objfile != NULL) |
d12307c1 | 2711 | result = solib_global_lookup (objfile, name, domain); |
b2fb95e0 | 2712 | |
f57d2163 | 2713 | /* If that didn't work go a global search (of global blocks, heh). */ |
d12307c1 | 2714 | if (result.symbol == NULL) |
f57d2163 DE |
2715 | { |
2716 | memset (&lookup_data, 0, sizeof (lookup_data)); | |
2717 | lookup_data.name = name; | |
2718 | lookup_data.domain = domain; | |
2719 | gdbarch_iterate_over_objfiles_in_search_order | |
2720 | (objfile != NULL ? get_objfile_arch (objfile) : target_gdbarch (), | |
2721 | lookup_symbol_global_iterator_cb, &lookup_data, objfile); | |
d12307c1 | 2722 | result = lookup_data.result; |
f57d2163 | 2723 | } |
6a3ca067 | 2724 | |
d12307c1 PMR |
2725 | if (result.symbol != NULL) |
2726 | symbol_cache_mark_found (bsc, slot, objfile, result.symbol, result.block); | |
f57d2163 DE |
2727 | else |
2728 | symbol_cache_mark_not_found (bsc, slot, objfile, name, domain); | |
2729 | ||
d12307c1 | 2730 | return result; |
5f9a71c3 DC |
2731 | } |
2732 | ||
4186eb54 KS |
2733 | int |
2734 | symbol_matches_domain (enum language symbol_language, | |
2735 | domain_enum symbol_domain, | |
2736 | domain_enum domain) | |
2737 | { | |
2738 | /* For C++ "struct foo { ... }" also defines a typedef for "foo". | |
2739 | A Java class declaration also defines a typedef for the class. | |
2740 | Similarly, any Ada type declaration implicitly defines a typedef. */ | |
2741 | if (symbol_language == language_cplus | |
2742 | || symbol_language == language_d | |
2743 | || symbol_language == language_java | |
2744 | || symbol_language == language_ada) | |
2745 | { | |
2746 | if ((domain == VAR_DOMAIN || domain == STRUCT_DOMAIN) | |
2747 | && symbol_domain == STRUCT_DOMAIN) | |
2748 | return 1; | |
2749 | } | |
2750 | /* For all other languages, strict match is required. */ | |
2751 | return (symbol_domain == domain); | |
2752 | } | |
2753 | ||
cf901d3b | 2754 | /* See symtab.h. */ |
c906108c | 2755 | |
ccefe4c4 TT |
2756 | struct type * |
2757 | lookup_transparent_type (const char *name) | |
c906108c | 2758 | { |
ccefe4c4 TT |
2759 | return current_language->la_lookup_transparent_type (name); |
2760 | } | |
9af17804 | 2761 | |
ccefe4c4 TT |
2762 | /* A helper for basic_lookup_transparent_type that interfaces with the |
2763 | "quick" symbol table functions. */ | |
357e46e7 | 2764 | |
ccefe4c4 | 2765 | static struct type * |
f88cb4b6 | 2766 | basic_lookup_transparent_type_quick (struct objfile *objfile, int block_index, |
ccefe4c4 TT |
2767 | const char *name) |
2768 | { | |
43f3e411 | 2769 | struct compunit_symtab *cust; |
346d1dfe | 2770 | const struct blockvector *bv; |
ccefe4c4 TT |
2771 | struct block *block; |
2772 | struct symbol *sym; | |
c906108c | 2773 | |
ccefe4c4 TT |
2774 | if (!objfile->sf) |
2775 | return NULL; | |
43f3e411 DE |
2776 | cust = objfile->sf->qf->lookup_symbol (objfile, block_index, name, |
2777 | STRUCT_DOMAIN); | |
2778 | if (cust == NULL) | |
ccefe4c4 | 2779 | return NULL; |
c906108c | 2780 | |
43f3e411 | 2781 | bv = COMPUNIT_BLOCKVECTOR (cust); |
f88cb4b6 | 2782 | block = BLOCKVECTOR_BLOCK (bv, block_index); |
b2e2f908 DE |
2783 | sym = block_find_symbol (block, name, STRUCT_DOMAIN, |
2784 | block_find_non_opaque_type, NULL); | |
2785 | if (sym == NULL) | |
43f3e411 | 2786 | error_in_psymtab_expansion (block_index, name, cust); |
b2e2f908 DE |
2787 | gdb_assert (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))); |
2788 | return SYMBOL_TYPE (sym); | |
2789 | } | |
08c23b0d | 2790 | |
b2e2f908 DE |
2791 | /* Subroutine of basic_lookup_transparent_type to simplify it. |
2792 | Look up the non-opaque definition of NAME in BLOCK_INDEX of OBJFILE. | |
2793 | BLOCK_INDEX is either GLOBAL_BLOCK or STATIC_BLOCK. */ | |
2794 | ||
2795 | static struct type * | |
2796 | basic_lookup_transparent_type_1 (struct objfile *objfile, int block_index, | |
2797 | const char *name) | |
2798 | { | |
2799 | const struct compunit_symtab *cust; | |
2800 | const struct blockvector *bv; | |
2801 | const struct block *block; | |
2802 | const struct symbol *sym; | |
2803 | ||
2804 | ALL_OBJFILE_COMPUNITS (objfile, cust) | |
2805 | { | |
2806 | bv = COMPUNIT_BLOCKVECTOR (cust); | |
2807 | block = BLOCKVECTOR_BLOCK (bv, block_index); | |
2808 | sym = block_find_symbol (block, name, STRUCT_DOMAIN, | |
2809 | block_find_non_opaque_type, NULL); | |
2810 | if (sym != NULL) | |
2811 | { | |
2812 | gdb_assert (!TYPE_IS_OPAQUE (SYMBOL_TYPE (sym))); | |
2813 | return SYMBOL_TYPE (sym); | |
2814 | } | |
2815 | } | |
c906108c | 2816 | |
ccefe4c4 | 2817 | return NULL; |
b368761e | 2818 | } |
c906108c | 2819 | |
b368761e DC |
2820 | /* The standard implementation of lookup_transparent_type. This code |
2821 | was modeled on lookup_symbol -- the parts not relevant to looking | |
2822 | up types were just left out. In particular it's assumed here that | |
cf901d3b | 2823 | types are available in STRUCT_DOMAIN and only in file-static or |
b368761e | 2824 | global blocks. */ |
c906108c SS |
2825 | |
2826 | struct type * | |
b368761e | 2827 | basic_lookup_transparent_type (const char *name) |
c906108c | 2828 | { |
52f0bd74 | 2829 | struct objfile *objfile; |
ccefe4c4 | 2830 | struct type *t; |
c906108c SS |
2831 | |
2832 | /* Now search all the global symbols. Do the symtab's first, then | |
c378eb4e | 2833 | check the psymtab's. If a psymtab indicates the existence |
c906108c SS |
2834 | of the desired name as a global, then do psymtab-to-symtab |
2835 | conversion on the fly and return the found symbol. */ | |
c5aa993b | 2836 | |
58b6ab13 | 2837 | ALL_OBJFILES (objfile) |
c5aa993b | 2838 | { |
b2e2f908 DE |
2839 | t = basic_lookup_transparent_type_1 (objfile, GLOBAL_BLOCK, name); |
2840 | if (t) | |
2841 | return t; | |
c5aa993b | 2842 | } |
c906108c | 2843 | |
ccefe4c4 | 2844 | ALL_OBJFILES (objfile) |
c5aa993b | 2845 | { |
ccefe4c4 TT |
2846 | t = basic_lookup_transparent_type_quick (objfile, GLOBAL_BLOCK, name); |
2847 | if (t) | |
2848 | return t; | |
c5aa993b | 2849 | } |
c906108c SS |
2850 | |
2851 | /* Now search the static file-level symbols. | |
2852 | Not strictly correct, but more useful than an error. | |
2853 | Do the symtab's first, then | |
c378eb4e | 2854 | check the psymtab's. If a psymtab indicates the existence |
c906108c | 2855 | of the desired name as a file-level static, then do psymtab-to-symtab |
c378eb4e | 2856 | conversion on the fly and return the found symbol. */ |
c906108c | 2857 | |
54ec275a | 2858 | ALL_OBJFILES (objfile) |
c5aa993b | 2859 | { |
b2e2f908 DE |
2860 | t = basic_lookup_transparent_type_1 (objfile, STATIC_BLOCK, name); |
2861 | if (t) | |
2862 | return t; | |
c5aa993b | 2863 | } |
c906108c | 2864 | |
ccefe4c4 | 2865 | ALL_OBJFILES (objfile) |
c5aa993b | 2866 | { |
ccefe4c4 TT |
2867 | t = basic_lookup_transparent_type_quick (objfile, STATIC_BLOCK, name); |
2868 | if (t) | |
2869 | return t; | |
c5aa993b | 2870 | } |
ccefe4c4 | 2871 | |
c906108c SS |
2872 | return (struct type *) 0; |
2873 | } | |
2874 | ||
4eeaa230 | 2875 | /* Iterate over the symbols named NAME, matching DOMAIN, in BLOCK. |
f8eba3c6 TT |
2876 | |
2877 | For each symbol that matches, CALLBACK is called. The symbol and | |
2878 | DATA are passed to the callback. | |
2879 | ||
2880 | If CALLBACK returns zero, the iteration ends. Otherwise, the | |
4eeaa230 | 2881 | search continues. */ |
f8eba3c6 TT |
2882 | |
2883 | void | |
2884 | iterate_over_symbols (const struct block *block, const char *name, | |
2885 | const domain_enum domain, | |
8e704927 | 2886 | symbol_found_callback_ftype *callback, |
f8eba3c6 TT |
2887 | void *data) |
2888 | { | |
4eeaa230 DE |
2889 | struct block_iterator iter; |
2890 | struct symbol *sym; | |
f8eba3c6 | 2891 | |
358d6ab3 | 2892 | ALL_BLOCK_SYMBOLS_WITH_NAME (block, name, iter, sym) |
4eeaa230 | 2893 | { |
4186eb54 KS |
2894 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
2895 | SYMBOL_DOMAIN (sym), domain)) | |
f8eba3c6 | 2896 | { |
4eeaa230 DE |
2897 | if (!callback (sym, data)) |
2898 | return; | |
f8eba3c6 | 2899 | } |
f8eba3c6 TT |
2900 | } |
2901 | } | |
2902 | ||
43f3e411 DE |
2903 | /* Find the compunit symtab associated with PC and SECTION. |
2904 | This will read in debug info as necessary. */ | |
c906108c | 2905 | |
43f3e411 DE |
2906 | struct compunit_symtab * |
2907 | find_pc_sect_compunit_symtab (CORE_ADDR pc, struct obj_section *section) | |
c906108c | 2908 | { |
43f3e411 DE |
2909 | struct compunit_symtab *cust; |
2910 | struct compunit_symtab *best_cust = NULL; | |
52f0bd74 | 2911 | struct objfile *objfile; |
c906108c | 2912 | CORE_ADDR distance = 0; |
77e371c0 | 2913 | struct bound_minimal_symbol msymbol; |
8a48e967 DJ |
2914 | |
2915 | /* If we know that this is not a text address, return failure. This is | |
2916 | necessary because we loop based on the block's high and low code | |
2917 | addresses, which do not include the data ranges, and because | |
2918 | we call find_pc_sect_psymtab which has a similar restriction based | |
2919 | on the partial_symtab's texthigh and textlow. */ | |
77e371c0 TT |
2920 | msymbol = lookup_minimal_symbol_by_pc_section (pc, section); |
2921 | if (msymbol.minsym | |
2922 | && (MSYMBOL_TYPE (msymbol.minsym) == mst_data | |
2923 | || MSYMBOL_TYPE (msymbol.minsym) == mst_bss | |
2924 | || MSYMBOL_TYPE (msymbol.minsym) == mst_abs | |
2925 | || MSYMBOL_TYPE (msymbol.minsym) == mst_file_data | |
2926 | || MSYMBOL_TYPE (msymbol.minsym) == mst_file_bss)) | |
8a48e967 | 2927 | return NULL; |
c906108c SS |
2928 | |
2929 | /* Search all symtabs for the one whose file contains our address, and which | |
2930 | is the smallest of all the ones containing the address. This is designed | |
2931 | to deal with a case like symtab a is at 0x1000-0x2000 and 0x3000-0x4000 | |
2932 | and symtab b is at 0x2000-0x3000. So the GLOBAL_BLOCK for a is from | |
2933 | 0x1000-0x4000, but for address 0x2345 we want to return symtab b. | |
2934 | ||
2935 | This happens for native ecoff format, where code from included files | |
c378eb4e | 2936 | gets its own symtab. The symtab for the included file should have |
c906108c SS |
2937 | been read in already via the dependency mechanism. |
2938 | It might be swifter to create several symtabs with the same name | |
2939 | like xcoff does (I'm not sure). | |
2940 | ||
2941 | It also happens for objfiles that have their functions reordered. | |
2942 | For these, the symtab we are looking for is not necessarily read in. */ | |
2943 | ||
43f3e411 | 2944 | ALL_COMPUNITS (objfile, cust) |
c5aa993b | 2945 | { |
43f3e411 DE |
2946 | struct block *b; |
2947 | const struct blockvector *bv; | |
2948 | ||
2949 | bv = COMPUNIT_BLOCKVECTOR (cust); | |
c5aa993b | 2950 | b = BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK); |
c906108c | 2951 | |
c5aa993b | 2952 | if (BLOCK_START (b) <= pc |
c5aa993b | 2953 | && BLOCK_END (b) > pc |
c5aa993b JM |
2954 | && (distance == 0 |
2955 | || BLOCK_END (b) - BLOCK_START (b) < distance)) | |
2956 | { | |
2957 | /* For an objfile that has its functions reordered, | |
2958 | find_pc_psymtab will find the proper partial symbol table | |
2959 | and we simply return its corresponding symtab. */ | |
2960 | /* In order to better support objfiles that contain both | |
2961 | stabs and coff debugging info, we continue on if a psymtab | |
c378eb4e | 2962 | can't be found. */ |
ccefe4c4 | 2963 | if ((objfile->flags & OBJF_REORDERED) && objfile->sf) |
c5aa993b | 2964 | { |
43f3e411 | 2965 | struct compunit_symtab *result; |
433759f7 | 2966 | |
ccefe4c4 | 2967 | result |
43f3e411 DE |
2968 | = objfile->sf->qf->find_pc_sect_compunit_symtab (objfile, |
2969 | msymbol, | |
2970 | pc, section, | |
2971 | 0); | |
2972 | if (result != NULL) | |
ccefe4c4 | 2973 | return result; |
c5aa993b JM |
2974 | } |
2975 | if (section != 0) | |
2976 | { | |
8157b174 | 2977 | struct block_iterator iter; |
261397f8 | 2978 | struct symbol *sym = NULL; |
c906108c | 2979 | |
de4f826b | 2980 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c5aa993b | 2981 | { |
261397f8 | 2982 | fixup_symbol_section (sym, objfile); |
e27d198c TT |
2983 | if (matching_obj_sections (SYMBOL_OBJ_SECTION (objfile, sym), |
2984 | section)) | |
c5aa993b JM |
2985 | break; |
2986 | } | |
de4f826b | 2987 | if (sym == NULL) |
c378eb4e MS |
2988 | continue; /* No symbol in this symtab matches |
2989 | section. */ | |
c5aa993b JM |
2990 | } |
2991 | distance = BLOCK_END (b) - BLOCK_START (b); | |
43f3e411 | 2992 | best_cust = cust; |
c5aa993b JM |
2993 | } |
2994 | } | |
c906108c | 2995 | |
43f3e411 DE |
2996 | if (best_cust != NULL) |
2997 | return best_cust; | |
c906108c | 2998 | |
072cabfe DE |
2999 | /* Not found in symtabs, search the "quick" symtabs (e.g. psymtabs). */ |
3000 | ||
ccefe4c4 TT |
3001 | ALL_OBJFILES (objfile) |
3002 | { | |
43f3e411 | 3003 | struct compunit_symtab *result; |
433759f7 | 3004 | |
ccefe4c4 TT |
3005 | if (!objfile->sf) |
3006 | continue; | |
43f3e411 DE |
3007 | result = objfile->sf->qf->find_pc_sect_compunit_symtab (objfile, |
3008 | msymbol, | |
3009 | pc, section, | |
3010 | 1); | |
3011 | if (result != NULL) | |
ccefe4c4 TT |
3012 | return result; |
3013 | } | |
3014 | ||
3015 | return NULL; | |
c906108c SS |
3016 | } |
3017 | ||
43f3e411 DE |
3018 | /* Find the compunit symtab associated with PC. |
3019 | This will read in debug info as necessary. | |
3020 | Backward compatibility, no section. */ | |
c906108c | 3021 | |
43f3e411 DE |
3022 | struct compunit_symtab * |
3023 | find_pc_compunit_symtab (CORE_ADDR pc) | |
c906108c | 3024 | { |
43f3e411 | 3025 | return find_pc_sect_compunit_symtab (pc, find_pc_mapped_section (pc)); |
c906108c | 3026 | } |
c906108c | 3027 | \f |
c5aa993b | 3028 | |
7e73cedf | 3029 | /* Find the source file and line number for a given PC value and SECTION. |
c906108c SS |
3030 | Return a structure containing a symtab pointer, a line number, |
3031 | and a pc range for the entire source line. | |
3032 | The value's .pc field is NOT the specified pc. | |
3033 | NOTCURRENT nonzero means, if specified pc is on a line boundary, | |
3034 | use the line that ends there. Otherwise, in that case, the line | |
3035 | that begins there is used. */ | |
3036 | ||
3037 | /* The big complication here is that a line may start in one file, and end just | |
3038 | before the start of another file. This usually occurs when you #include | |
3039 | code in the middle of a subroutine. To properly find the end of a line's PC | |
3040 | range, we must search all symtabs associated with this compilation unit, and | |
3041 | find the one whose first PC is closer than that of the next line in this | |
3042 | symtab. */ | |
3043 | ||
3044 | /* If it's worth the effort, we could be using a binary search. */ | |
3045 | ||
3046 | struct symtab_and_line | |
714835d5 | 3047 | find_pc_sect_line (CORE_ADDR pc, struct obj_section *section, int notcurrent) |
c906108c | 3048 | { |
43f3e411 DE |
3049 | struct compunit_symtab *cust; |
3050 | struct symtab *iter_s; | |
52f0bd74 AC |
3051 | struct linetable *l; |
3052 | int len; | |
3053 | int i; | |
3054 | struct linetable_entry *item; | |
c906108c | 3055 | struct symtab_and_line val; |
346d1dfe | 3056 | const struct blockvector *bv; |
7cbd4a93 | 3057 | struct bound_minimal_symbol msymbol; |
c906108c SS |
3058 | |
3059 | /* Info on best line seen so far, and where it starts, and its file. */ | |
3060 | ||
3061 | struct linetable_entry *best = NULL; | |
3062 | CORE_ADDR best_end = 0; | |
3063 | struct symtab *best_symtab = 0; | |
3064 | ||
3065 | /* Store here the first line number | |
3066 | of a file which contains the line at the smallest pc after PC. | |
3067 | If we don't find a line whose range contains PC, | |
3068 | we will use a line one less than this, | |
3069 | with a range from the start of that file to the first line's pc. */ | |
3070 | struct linetable_entry *alt = NULL; | |
c906108c SS |
3071 | |
3072 | /* Info on best line seen in this file. */ | |
3073 | ||
3074 | struct linetable_entry *prev; | |
3075 | ||
3076 | /* If this pc is not from the current frame, | |
3077 | it is the address of the end of a call instruction. | |
3078 | Quite likely that is the start of the following statement. | |
3079 | But what we want is the statement containing the instruction. | |
3080 | Fudge the pc to make sure we get that. */ | |
3081 | ||
fe39c653 | 3082 | init_sal (&val); /* initialize to zeroes */ |
c906108c | 3083 | |
6c95b8df PA |
3084 | val.pspace = current_program_space; |
3085 | ||
b77b1eb7 JB |
3086 | /* It's tempting to assume that, if we can't find debugging info for |
3087 | any function enclosing PC, that we shouldn't search for line | |
3088 | number info, either. However, GAS can emit line number info for | |
3089 | assembly files --- very helpful when debugging hand-written | |
3090 | assembly code. In such a case, we'd have no debug info for the | |
3091 | function, but we would have line info. */ | |
648f4f79 | 3092 | |
c906108c SS |
3093 | if (notcurrent) |
3094 | pc -= 1; | |
3095 | ||
c5aa993b | 3096 | /* elz: added this because this function returned the wrong |
c906108c | 3097 | information if the pc belongs to a stub (import/export) |
c378eb4e | 3098 | to call a shlib function. This stub would be anywhere between |
9af17804 | 3099 | two functions in the target, and the line info was erroneously |
c378eb4e MS |
3100 | taken to be the one of the line before the pc. */ |
3101 | ||
c906108c | 3102 | /* RT: Further explanation: |
c5aa993b | 3103 | |
c906108c SS |
3104 | * We have stubs (trampolines) inserted between procedures. |
3105 | * | |
3106 | * Example: "shr1" exists in a shared library, and a "shr1" stub also | |
3107 | * exists in the main image. | |
3108 | * | |
3109 | * In the minimal symbol table, we have a bunch of symbols | |
c378eb4e | 3110 | * sorted by start address. The stubs are marked as "trampoline", |
c906108c SS |
3111 | * the others appear as text. E.g.: |
3112 | * | |
9af17804 | 3113 | * Minimal symbol table for main image |
c906108c SS |
3114 | * main: code for main (text symbol) |
3115 | * shr1: stub (trampoline symbol) | |
3116 | * foo: code for foo (text symbol) | |
3117 | * ... | |
3118 | * Minimal symbol table for "shr1" image: | |
3119 | * ... | |
3120 | * shr1: code for shr1 (text symbol) | |
3121 | * ... | |
3122 | * | |
3123 | * So the code below is trying to detect if we are in the stub | |
3124 | * ("shr1" stub), and if so, find the real code ("shr1" trampoline), | |
3125 | * and if found, do the symbolization from the real-code address | |
3126 | * rather than the stub address. | |
3127 | * | |
3128 | * Assumptions being made about the minimal symbol table: | |
3129 | * 1. lookup_minimal_symbol_by_pc() will return a trampoline only | |
c378eb4e | 3130 | * if we're really in the trampoline.s If we're beyond it (say |
9af17804 | 3131 | * we're in "foo" in the above example), it'll have a closer |
c906108c SS |
3132 | * symbol (the "foo" text symbol for example) and will not |
3133 | * return the trampoline. | |
3134 | * 2. lookup_minimal_symbol_text() will find a real text symbol | |
3135 | * corresponding to the trampoline, and whose address will | |
c378eb4e | 3136 | * be different than the trampoline address. I put in a sanity |
c906108c SS |
3137 | * check for the address being the same, to avoid an |
3138 | * infinite recursion. | |
3139 | */ | |
c5aa993b | 3140 | msymbol = lookup_minimal_symbol_by_pc (pc); |
7cbd4a93 TT |
3141 | if (msymbol.minsym != NULL) |
3142 | if (MSYMBOL_TYPE (msymbol.minsym) == mst_solib_trampoline) | |
c5aa993b | 3143 | { |
77e371c0 | 3144 | struct bound_minimal_symbol mfunsym |
efd66ac6 | 3145 | = lookup_minimal_symbol_text (MSYMBOL_LINKAGE_NAME (msymbol.minsym), |
77e371c0 TT |
3146 | NULL); |
3147 | ||
3148 | if (mfunsym.minsym == NULL) | |
c5aa993b JM |
3149 | /* I eliminated this warning since it is coming out |
3150 | * in the following situation: | |
3151 | * gdb shmain // test program with shared libraries | |
3152 | * (gdb) break shr1 // function in shared lib | |
3153 | * Warning: In stub for ... | |
9af17804 | 3154 | * In the above situation, the shared lib is not loaded yet, |
c5aa993b JM |
3155 | * so of course we can't find the real func/line info, |
3156 | * but the "break" still works, and the warning is annoying. | |
c378eb4e | 3157 | * So I commented out the warning. RT */ |
3e43a32a | 3158 | /* warning ("In stub for %s; unable to find real function/line info", |
c378eb4e MS |
3159 | SYMBOL_LINKAGE_NAME (msymbol)); */ |
3160 | ; | |
c5aa993b | 3161 | /* fall through */ |
77e371c0 TT |
3162 | else if (BMSYMBOL_VALUE_ADDRESS (mfunsym) |
3163 | == BMSYMBOL_VALUE_ADDRESS (msymbol)) | |
c5aa993b | 3164 | /* Avoid infinite recursion */ |
c378eb4e | 3165 | /* See above comment about why warning is commented out. */ |
3e43a32a | 3166 | /* warning ("In stub for %s; unable to find real function/line info", |
c378eb4e MS |
3167 | SYMBOL_LINKAGE_NAME (msymbol)); */ |
3168 | ; | |
c5aa993b JM |
3169 | /* fall through */ |
3170 | else | |
77e371c0 | 3171 | return find_pc_line (BMSYMBOL_VALUE_ADDRESS (mfunsym), 0); |
c5aa993b | 3172 | } |
c906108c SS |
3173 | |
3174 | ||
43f3e411 DE |
3175 | cust = find_pc_sect_compunit_symtab (pc, section); |
3176 | if (cust == NULL) | |
c906108c | 3177 | { |
c378eb4e | 3178 | /* If no symbol information, return previous pc. */ |
c906108c SS |
3179 | if (notcurrent) |
3180 | pc++; | |
3181 | val.pc = pc; | |
3182 | return val; | |
3183 | } | |
3184 | ||
43f3e411 | 3185 | bv = COMPUNIT_BLOCKVECTOR (cust); |
c906108c SS |
3186 | |
3187 | /* Look at all the symtabs that share this blockvector. | |
3188 | They all have the same apriori range, that we found was right; | |
3189 | but they have different line tables. */ | |
3190 | ||
43f3e411 | 3191 | ALL_COMPUNIT_FILETABS (cust, iter_s) |
c906108c SS |
3192 | { |
3193 | /* Find the best line in this symtab. */ | |
43f3e411 | 3194 | l = SYMTAB_LINETABLE (iter_s); |
c906108c | 3195 | if (!l) |
c5aa993b | 3196 | continue; |
c906108c SS |
3197 | len = l->nitems; |
3198 | if (len <= 0) | |
3199 | { | |
3200 | /* I think len can be zero if the symtab lacks line numbers | |
3201 | (e.g. gcc -g1). (Either that or the LINETABLE is NULL; | |
3202 | I'm not sure which, and maybe it depends on the symbol | |
3203 | reader). */ | |
3204 | continue; | |
3205 | } | |
3206 | ||
3207 | prev = NULL; | |
c378eb4e | 3208 | item = l->item; /* Get first line info. */ |
c906108c SS |
3209 | |
3210 | /* Is this file's first line closer than the first lines of other files? | |
c5aa993b | 3211 | If so, record this file, and its first line, as best alternate. */ |
c906108c | 3212 | if (item->pc > pc && (!alt || item->pc < alt->pc)) |
c656bca5 | 3213 | alt = item; |
c906108c SS |
3214 | |
3215 | for (i = 0; i < len; i++, item++) | |
3216 | { | |
3217 | /* Leave prev pointing to the linetable entry for the last line | |
3218 | that started at or before PC. */ | |
3219 | if (item->pc > pc) | |
3220 | break; | |
3221 | ||
3222 | prev = item; | |
3223 | } | |
3224 | ||
3225 | /* At this point, prev points at the line whose start addr is <= pc, and | |
c5aa993b JM |
3226 | item points at the next line. If we ran off the end of the linetable |
3227 | (pc >= start of the last line), then prev == item. If pc < start of | |
3228 | the first line, prev will not be set. */ | |
c906108c SS |
3229 | |
3230 | /* Is this file's best line closer than the best in the other files? | |
083ae935 DJ |
3231 | If so, record this file, and its best line, as best so far. Don't |
3232 | save prev if it represents the end of a function (i.e. line number | |
3233 | 0) instead of a real line. */ | |
c906108c | 3234 | |
083ae935 | 3235 | if (prev && prev->line && (!best || prev->pc > best->pc)) |
c906108c SS |
3236 | { |
3237 | best = prev; | |
43f3e411 | 3238 | best_symtab = iter_s; |
25d53da1 KB |
3239 | |
3240 | /* Discard BEST_END if it's before the PC of the current BEST. */ | |
3241 | if (best_end <= best->pc) | |
3242 | best_end = 0; | |
c906108c | 3243 | } |
25d53da1 KB |
3244 | |
3245 | /* If another line (denoted by ITEM) is in the linetable and its | |
3246 | PC is after BEST's PC, but before the current BEST_END, then | |
3247 | use ITEM's PC as the new best_end. */ | |
3248 | if (best && i < len && item->pc > best->pc | |
3249 | && (best_end == 0 || best_end > item->pc)) | |
3250 | best_end = item->pc; | |
c906108c SS |
3251 | } |
3252 | ||
3253 | if (!best_symtab) | |
3254 | { | |
e86e87f7 DJ |
3255 | /* If we didn't find any line number info, just return zeros. |
3256 | We used to return alt->line - 1 here, but that could be | |
3257 | anywhere; if we don't have line number info for this PC, | |
3258 | don't make some up. */ | |
3259 | val.pc = pc; | |
c906108c | 3260 | } |
e8717518 FF |
3261 | else if (best->line == 0) |
3262 | { | |
3263 | /* If our best fit is in a range of PC's for which no line | |
3264 | number info is available (line number is zero) then we didn't | |
c378eb4e | 3265 | find any valid line information. */ |
e8717518 FF |
3266 | val.pc = pc; |
3267 | } | |
c906108c SS |
3268 | else |
3269 | { | |
3270 | val.symtab = best_symtab; | |
3271 | val.line = best->line; | |
3272 | val.pc = best->pc; | |
3273 | if (best_end && (!alt || best_end < alt->pc)) | |
3274 | val.end = best_end; | |
3275 | else if (alt) | |
3276 | val.end = alt->pc; | |
3277 | else | |
3278 | val.end = BLOCK_END (BLOCKVECTOR_BLOCK (bv, GLOBAL_BLOCK)); | |
3279 | } | |
3280 | val.section = section; | |
3281 | return val; | |
3282 | } | |
3283 | ||
c378eb4e | 3284 | /* Backward compatibility (no section). */ |
c906108c SS |
3285 | |
3286 | struct symtab_and_line | |
fba45db2 | 3287 | find_pc_line (CORE_ADDR pc, int notcurrent) |
c906108c | 3288 | { |
714835d5 | 3289 | struct obj_section *section; |
c906108c SS |
3290 | |
3291 | section = find_pc_overlay (pc); | |
3292 | if (pc_in_unmapped_range (pc, section)) | |
3293 | pc = overlay_mapped_address (pc, section); | |
3294 | return find_pc_sect_line (pc, section, notcurrent); | |
3295 | } | |
34248c3a DE |
3296 | |
3297 | /* See symtab.h. */ | |
3298 | ||
3299 | struct symtab * | |
3300 | find_pc_line_symtab (CORE_ADDR pc) | |
3301 | { | |
3302 | struct symtab_and_line sal; | |
3303 | ||
3304 | /* This always passes zero for NOTCURRENT to find_pc_line. | |
3305 | There are currently no callers that ever pass non-zero. */ | |
3306 | sal = find_pc_line (pc, 0); | |
3307 | return sal.symtab; | |
3308 | } | |
c906108c | 3309 | \f |
c906108c SS |
3310 | /* Find line number LINE in any symtab whose name is the same as |
3311 | SYMTAB. | |
3312 | ||
3313 | If found, return the symtab that contains the linetable in which it was | |
3314 | found, set *INDEX to the index in the linetable of the best entry | |
3315 | found, and set *EXACT_MATCH nonzero if the value returned is an | |
3316 | exact match. | |
3317 | ||
3318 | If not found, return NULL. */ | |
3319 | ||
50641945 | 3320 | struct symtab * |
433759f7 MS |
3321 | find_line_symtab (struct symtab *symtab, int line, |
3322 | int *index, int *exact_match) | |
c906108c | 3323 | { |
6f43c46f | 3324 | int exact = 0; /* Initialized here to avoid a compiler warning. */ |
c906108c SS |
3325 | |
3326 | /* BEST_INDEX and BEST_LINETABLE identify the smallest linenumber > LINE | |
3327 | so far seen. */ | |
3328 | ||
3329 | int best_index; | |
3330 | struct linetable *best_linetable; | |
3331 | struct symtab *best_symtab; | |
3332 | ||
3333 | /* First try looking it up in the given symtab. */ | |
8435453b | 3334 | best_linetable = SYMTAB_LINETABLE (symtab); |
c906108c | 3335 | best_symtab = symtab; |
f8eba3c6 | 3336 | best_index = find_line_common (best_linetable, line, &exact, 0); |
c906108c SS |
3337 | if (best_index < 0 || !exact) |
3338 | { | |
3339 | /* Didn't find an exact match. So we better keep looking for | |
c5aa993b JM |
3340 | another symtab with the same name. In the case of xcoff, |
3341 | multiple csects for one source file (produced by IBM's FORTRAN | |
3342 | compiler) produce multiple symtabs (this is unavoidable | |
3343 | assuming csects can be at arbitrary places in memory and that | |
3344 | the GLOBAL_BLOCK of a symtab has a begin and end address). */ | |
c906108c SS |
3345 | |
3346 | /* BEST is the smallest linenumber > LINE so far seen, | |
c5aa993b JM |
3347 | or 0 if none has been seen so far. |
3348 | BEST_INDEX and BEST_LINETABLE identify the item for it. */ | |
c906108c SS |
3349 | int best; |
3350 | ||
3351 | struct objfile *objfile; | |
43f3e411 | 3352 | struct compunit_symtab *cu; |
c906108c SS |
3353 | struct symtab *s; |
3354 | ||
3355 | if (best_index >= 0) | |
3356 | best = best_linetable->item[best_index].line; | |
3357 | else | |
3358 | best = 0; | |
3359 | ||
ccefe4c4 | 3360 | ALL_OBJFILES (objfile) |
51432cca | 3361 | { |
ccefe4c4 | 3362 | if (objfile->sf) |
652a8996 | 3363 | objfile->sf->qf->expand_symtabs_with_fullname (objfile, |
05cba821 | 3364 | symtab_to_fullname (symtab)); |
51432cca CES |
3365 | } |
3366 | ||
43f3e411 | 3367 | ALL_FILETABS (objfile, cu, s) |
c5aa993b JM |
3368 | { |
3369 | struct linetable *l; | |
3370 | int ind; | |
c906108c | 3371 | |
3ffc00b8 | 3372 | if (FILENAME_CMP (symtab->filename, s->filename) != 0) |
c5aa993b | 3373 | continue; |
d180bcbd JK |
3374 | if (FILENAME_CMP (symtab_to_fullname (symtab), |
3375 | symtab_to_fullname (s)) != 0) | |
3ffc00b8 | 3376 | continue; |
8435453b | 3377 | l = SYMTAB_LINETABLE (s); |
f8eba3c6 | 3378 | ind = find_line_common (l, line, &exact, 0); |
c5aa993b JM |
3379 | if (ind >= 0) |
3380 | { | |
3381 | if (exact) | |
3382 | { | |
3383 | best_index = ind; | |
3384 | best_linetable = l; | |
3385 | best_symtab = s; | |
3386 | goto done; | |
3387 | } | |
3388 | if (best == 0 || l->item[ind].line < best) | |
3389 | { | |
3390 | best = l->item[ind].line; | |
3391 | best_index = ind; | |
3392 | best_linetable = l; | |
3393 | best_symtab = s; | |
3394 | } | |
3395 | } | |
3396 | } | |
c906108c | 3397 | } |
c5aa993b | 3398 | done: |
c906108c SS |
3399 | if (best_index < 0) |
3400 | return NULL; | |
3401 | ||
3402 | if (index) | |
3403 | *index = best_index; | |
3404 | if (exact_match) | |
3405 | *exact_match = exact; | |
3406 | ||
3407 | return best_symtab; | |
3408 | } | |
f8eba3c6 TT |
3409 | |
3410 | /* Given SYMTAB, returns all the PCs function in the symtab that | |
3411 | exactly match LINE. Returns NULL if there are no exact matches, | |
3412 | but updates BEST_ITEM in this case. */ | |
3413 | ||
3414 | VEC (CORE_ADDR) * | |
3415 | find_pcs_for_symtab_line (struct symtab *symtab, int line, | |
3416 | struct linetable_entry **best_item) | |
3417 | { | |
c656bca5 | 3418 | int start = 0; |
f8eba3c6 TT |
3419 | VEC (CORE_ADDR) *result = NULL; |
3420 | ||
3421 | /* First, collect all the PCs that are at this line. */ | |
3422 | while (1) | |
3423 | { | |
3424 | int was_exact; | |
3425 | int idx; | |
3426 | ||
8435453b DE |
3427 | idx = find_line_common (SYMTAB_LINETABLE (symtab), line, &was_exact, |
3428 | start); | |
f8eba3c6 TT |
3429 | if (idx < 0) |
3430 | break; | |
3431 | ||
3432 | if (!was_exact) | |
3433 | { | |
8435453b | 3434 | struct linetable_entry *item = &SYMTAB_LINETABLE (symtab)->item[idx]; |
f8eba3c6 TT |
3435 | |
3436 | if (*best_item == NULL || item->line < (*best_item)->line) | |
3437 | *best_item = item; | |
3438 | ||
3439 | break; | |
3440 | } | |
3441 | ||
8435453b DE |
3442 | VEC_safe_push (CORE_ADDR, result, |
3443 | SYMTAB_LINETABLE (symtab)->item[idx].pc); | |
f8eba3c6 TT |
3444 | start = idx + 1; |
3445 | } | |
3446 | ||
3447 | return result; | |
3448 | } | |
3449 | ||
c906108c SS |
3450 | \f |
3451 | /* Set the PC value for a given source file and line number and return true. | |
3452 | Returns zero for invalid line number (and sets the PC to 0). | |
3453 | The source file is specified with a struct symtab. */ | |
3454 | ||
3455 | int | |
fba45db2 | 3456 | find_line_pc (struct symtab *symtab, int line, CORE_ADDR *pc) |
c906108c SS |
3457 | { |
3458 | struct linetable *l; | |
3459 | int ind; | |
3460 | ||
3461 | *pc = 0; | |
3462 | if (symtab == 0) | |
3463 | return 0; | |
3464 | ||
3465 | symtab = find_line_symtab (symtab, line, &ind, NULL); | |
3466 | if (symtab != NULL) | |
3467 | { | |
8435453b | 3468 | l = SYMTAB_LINETABLE (symtab); |
c906108c SS |
3469 | *pc = l->item[ind].pc; |
3470 | return 1; | |
3471 | } | |
3472 | else | |
3473 | return 0; | |
3474 | } | |
3475 | ||
3476 | /* Find the range of pc values in a line. | |
3477 | Store the starting pc of the line into *STARTPTR | |
3478 | and the ending pc (start of next line) into *ENDPTR. | |
3479 | Returns 1 to indicate success. | |
3480 | Returns 0 if could not find the specified line. */ | |
3481 | ||
3482 | int | |
fba45db2 KB |
3483 | find_line_pc_range (struct symtab_and_line sal, CORE_ADDR *startptr, |
3484 | CORE_ADDR *endptr) | |
c906108c SS |
3485 | { |
3486 | CORE_ADDR startaddr; | |
3487 | struct symtab_and_line found_sal; | |
3488 | ||
3489 | startaddr = sal.pc; | |
c5aa993b | 3490 | if (startaddr == 0 && !find_line_pc (sal.symtab, sal.line, &startaddr)) |
c906108c SS |
3491 | return 0; |
3492 | ||
3493 | /* This whole function is based on address. For example, if line 10 has | |
3494 | two parts, one from 0x100 to 0x200 and one from 0x300 to 0x400, then | |
3495 | "info line *0x123" should say the line goes from 0x100 to 0x200 | |
3496 | and "info line *0x355" should say the line goes from 0x300 to 0x400. | |
3497 | This also insures that we never give a range like "starts at 0x134 | |
3498 | and ends at 0x12c". */ | |
3499 | ||
3500 | found_sal = find_pc_sect_line (startaddr, sal.section, 0); | |
3501 | if (found_sal.line != sal.line) | |
3502 | { | |
3503 | /* The specified line (sal) has zero bytes. */ | |
3504 | *startptr = found_sal.pc; | |
3505 | *endptr = found_sal.pc; | |
3506 | } | |
3507 | else | |
3508 | { | |
3509 | *startptr = found_sal.pc; | |
3510 | *endptr = found_sal.end; | |
3511 | } | |
3512 | return 1; | |
3513 | } | |
3514 | ||
3515 | /* Given a line table and a line number, return the index into the line | |
3516 | table for the pc of the nearest line whose number is >= the specified one. | |
3517 | Return -1 if none is found. The value is >= 0 if it is an index. | |
f8eba3c6 | 3518 | START is the index at which to start searching the line table. |
c906108c SS |
3519 | |
3520 | Set *EXACT_MATCH nonzero if the value returned is an exact match. */ | |
3521 | ||
3522 | static int | |
aa1ee363 | 3523 | find_line_common (struct linetable *l, int lineno, |
f8eba3c6 | 3524 | int *exact_match, int start) |
c906108c | 3525 | { |
52f0bd74 AC |
3526 | int i; |
3527 | int len; | |
c906108c SS |
3528 | |
3529 | /* BEST is the smallest linenumber > LINENO so far seen, | |
3530 | or 0 if none has been seen so far. | |
3531 | BEST_INDEX identifies the item for it. */ | |
3532 | ||
3533 | int best_index = -1; | |
3534 | int best = 0; | |
3535 | ||
b7589f7d DJ |
3536 | *exact_match = 0; |
3537 | ||
c906108c SS |
3538 | if (lineno <= 0) |
3539 | return -1; | |
3540 | if (l == 0) | |
3541 | return -1; | |
3542 | ||
3543 | len = l->nitems; | |
f8eba3c6 | 3544 | for (i = start; i < len; i++) |
c906108c | 3545 | { |
aa1ee363 | 3546 | struct linetable_entry *item = &(l->item[i]); |
c906108c SS |
3547 | |
3548 | if (item->line == lineno) | |
3549 | { | |
3550 | /* Return the first (lowest address) entry which matches. */ | |
3551 | *exact_match = 1; | |
3552 | return i; | |
3553 | } | |
3554 | ||
3555 | if (item->line > lineno && (best == 0 || item->line < best)) | |
3556 | { | |
3557 | best = item->line; | |
3558 | best_index = i; | |
3559 | } | |
3560 | } | |
3561 | ||
3562 | /* If we got here, we didn't get an exact match. */ | |
c906108c SS |
3563 | return best_index; |
3564 | } | |
3565 | ||
3566 | int | |
fba45db2 | 3567 | find_pc_line_pc_range (CORE_ADDR pc, CORE_ADDR *startptr, CORE_ADDR *endptr) |
c906108c SS |
3568 | { |
3569 | struct symtab_and_line sal; | |
433759f7 | 3570 | |
c906108c SS |
3571 | sal = find_pc_line (pc, 0); |
3572 | *startptr = sal.pc; | |
3573 | *endptr = sal.end; | |
3574 | return sal.symtab != 0; | |
3575 | } | |
3576 | ||
aab2f208 DE |
3577 | /* Given a function symbol SYM, find the symtab and line for the start |
3578 | of the function. | |
3579 | If the argument FUNFIRSTLINE is nonzero, we want the first line | |
6e22494e JK |
3580 | of real code inside the function. |
3581 | This function should return SALs matching those from minsym_found, | |
3582 | otherwise false multiple-locations breakpoints could be placed. */ | |
aab2f208 DE |
3583 | |
3584 | struct symtab_and_line | |
3585 | find_function_start_sal (struct symbol *sym, int funfirstline) | |
3586 | { | |
3587 | struct symtab_and_line sal; | |
08be3fe3 | 3588 | struct obj_section *section; |
aab2f208 DE |
3589 | |
3590 | fixup_symbol_section (sym, NULL); | |
08be3fe3 DE |
3591 | section = SYMBOL_OBJ_SECTION (symbol_objfile (sym), sym); |
3592 | sal = find_pc_sect_line (BLOCK_START (SYMBOL_BLOCK_VALUE (sym)), section, 0); | |
aab2f208 | 3593 | |
6e22494e JK |
3594 | if (funfirstline && sal.symtab != NULL |
3595 | && (COMPUNIT_LOCATIONS_VALID (SYMTAB_COMPUNIT (sal.symtab)) | |
3596 | || SYMTAB_LANGUAGE (sal.symtab) == language_asm)) | |
3597 | { | |
141c5cc4 JK |
3598 | struct gdbarch *gdbarch = symbol_arch (sym); |
3599 | ||
6e22494e | 3600 | sal.pc = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)); |
141c5cc4 JK |
3601 | if (gdbarch_skip_entrypoint_p (gdbarch)) |
3602 | sal.pc = gdbarch_skip_entrypoint (gdbarch, sal.pc); | |
6e22494e JK |
3603 | return sal; |
3604 | } | |
3605 | ||
aab2f208 DE |
3606 | /* We always should have a line for the function start address. |
3607 | If we don't, something is odd. Create a plain SAL refering | |
3608 | just the PC and hope that skip_prologue_sal (if requested) | |
3609 | can find a line number for after the prologue. */ | |
3610 | if (sal.pc < BLOCK_START (SYMBOL_BLOCK_VALUE (sym))) | |
3611 | { | |
3612 | init_sal (&sal); | |
3613 | sal.pspace = current_program_space; | |
3614 | sal.pc = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)); | |
08be3fe3 | 3615 | sal.section = section; |
aab2f208 DE |
3616 | } |
3617 | ||
3618 | if (funfirstline) | |
3619 | skip_prologue_sal (&sal); | |
3620 | ||
3621 | return sal; | |
3622 | } | |
3623 | ||
8c7a1ee8 EZ |
3624 | /* Given a function start address FUNC_ADDR and SYMTAB, find the first |
3625 | address for that function that has an entry in SYMTAB's line info | |
3626 | table. If such an entry cannot be found, return FUNC_ADDR | |
3627 | unaltered. */ | |
eca864fe | 3628 | |
70221824 | 3629 | static CORE_ADDR |
8c7a1ee8 EZ |
3630 | skip_prologue_using_lineinfo (CORE_ADDR func_addr, struct symtab *symtab) |
3631 | { | |
3632 | CORE_ADDR func_start, func_end; | |
3633 | struct linetable *l; | |
952a6d41 | 3634 | int i; |
8c7a1ee8 EZ |
3635 | |
3636 | /* Give up if this symbol has no lineinfo table. */ | |
8435453b | 3637 | l = SYMTAB_LINETABLE (symtab); |
8c7a1ee8 EZ |
3638 | if (l == NULL) |
3639 | return func_addr; | |
3640 | ||
3641 | /* Get the range for the function's PC values, or give up if we | |
3642 | cannot, for some reason. */ | |
3643 | if (!find_pc_partial_function (func_addr, NULL, &func_start, &func_end)) | |
3644 | return func_addr; | |
3645 | ||
3646 | /* Linetable entries are ordered by PC values, see the commentary in | |
3647 | symtab.h where `struct linetable' is defined. Thus, the first | |
3648 | entry whose PC is in the range [FUNC_START..FUNC_END[ is the | |
3649 | address we are looking for. */ | |
3650 | for (i = 0; i < l->nitems; i++) | |
3651 | { | |
3652 | struct linetable_entry *item = &(l->item[i]); | |
3653 | ||
3654 | /* Don't use line numbers of zero, they mark special entries in | |
3655 | the table. See the commentary on symtab.h before the | |
3656 | definition of struct linetable. */ | |
3657 | if (item->line > 0 && func_start <= item->pc && item->pc < func_end) | |
3658 | return item->pc; | |
3659 | } | |
3660 | ||
3661 | return func_addr; | |
3662 | } | |
3663 | ||
059acae7 UW |
3664 | /* Adjust SAL to the first instruction past the function prologue. |
3665 | If the PC was explicitly specified, the SAL is not changed. | |
3666 | If the line number was explicitly specified, at most the SAL's PC | |
3667 | is updated. If SAL is already past the prologue, then do nothing. */ | |
eca864fe | 3668 | |
059acae7 UW |
3669 | void |
3670 | skip_prologue_sal (struct symtab_and_line *sal) | |
3671 | { | |
3672 | struct symbol *sym; | |
3673 | struct symtab_and_line start_sal; | |
3674 | struct cleanup *old_chain; | |
8be455d7 | 3675 | CORE_ADDR pc, saved_pc; |
059acae7 UW |
3676 | struct obj_section *section; |
3677 | const char *name; | |
3678 | struct objfile *objfile; | |
3679 | struct gdbarch *gdbarch; | |
3977b71f | 3680 | const struct block *b, *function_block; |
8be455d7 | 3681 | int force_skip, skip; |
c906108c | 3682 | |
a4b411d6 | 3683 | /* Do not change the SAL if PC was specified explicitly. */ |
059acae7 UW |
3684 | if (sal->explicit_pc) |
3685 | return; | |
6c95b8df PA |
3686 | |
3687 | old_chain = save_current_space_and_thread (); | |
059acae7 | 3688 | switch_to_program_space_and_thread (sal->pspace); |
6c95b8df | 3689 | |
059acae7 UW |
3690 | sym = find_pc_sect_function (sal->pc, sal->section); |
3691 | if (sym != NULL) | |
bccdca4a | 3692 | { |
059acae7 UW |
3693 | fixup_symbol_section (sym, NULL); |
3694 | ||
08be3fe3 | 3695 | objfile = symbol_objfile (sym); |
059acae7 | 3696 | pc = BLOCK_START (SYMBOL_BLOCK_VALUE (sym)); |
08be3fe3 | 3697 | section = SYMBOL_OBJ_SECTION (objfile, sym); |
059acae7 | 3698 | name = SYMBOL_LINKAGE_NAME (sym); |
c906108c | 3699 | } |
059acae7 UW |
3700 | else |
3701 | { | |
7c7b6655 TT |
3702 | struct bound_minimal_symbol msymbol |
3703 | = lookup_minimal_symbol_by_pc_section (sal->pc, sal->section); | |
433759f7 | 3704 | |
7c7b6655 | 3705 | if (msymbol.minsym == NULL) |
059acae7 UW |
3706 | { |
3707 | do_cleanups (old_chain); | |
3708 | return; | |
3709 | } | |
3710 | ||
7c7b6655 | 3711 | objfile = msymbol.objfile; |
77e371c0 | 3712 | pc = BMSYMBOL_VALUE_ADDRESS (msymbol); |
efd66ac6 TT |
3713 | section = MSYMBOL_OBJ_SECTION (objfile, msymbol.minsym); |
3714 | name = MSYMBOL_LINKAGE_NAME (msymbol.minsym); | |
059acae7 UW |
3715 | } |
3716 | ||
3717 | gdbarch = get_objfile_arch (objfile); | |
3718 | ||
8be455d7 JK |
3719 | /* Process the prologue in two passes. In the first pass try to skip the |
3720 | prologue (SKIP is true) and verify there is a real need for it (indicated | |
3721 | by FORCE_SKIP). If no such reason was found run a second pass where the | |
3722 | prologue is not skipped (SKIP is false). */ | |
059acae7 | 3723 | |
8be455d7 JK |
3724 | skip = 1; |
3725 | force_skip = 1; | |
059acae7 | 3726 | |
8be455d7 JK |
3727 | /* Be conservative - allow direct PC (without skipping prologue) only if we |
3728 | have proven the CU (Compilation Unit) supports it. sal->SYMTAB does not | |
3729 | have to be set by the caller so we use SYM instead. */ | |
08be3fe3 DE |
3730 | if (sym != NULL |
3731 | && COMPUNIT_LOCATIONS_VALID (SYMTAB_COMPUNIT (symbol_symtab (sym)))) | |
8be455d7 | 3732 | force_skip = 0; |
059acae7 | 3733 | |
8be455d7 JK |
3734 | saved_pc = pc; |
3735 | do | |
c906108c | 3736 | { |
8be455d7 | 3737 | pc = saved_pc; |
4309257c | 3738 | |
8be455d7 JK |
3739 | /* If the function is in an unmapped overlay, use its unmapped LMA address, |
3740 | so that gdbarch_skip_prologue has something unique to work on. */ | |
3741 | if (section_is_overlay (section) && !section_is_mapped (section)) | |
3742 | pc = overlay_unmapped_address (pc, section); | |
3743 | ||
3744 | /* Skip "first line" of function (which is actually its prologue). */ | |
3745 | pc += gdbarch_deprecated_function_start_offset (gdbarch); | |
591a12a1 UW |
3746 | if (gdbarch_skip_entrypoint_p (gdbarch)) |
3747 | pc = gdbarch_skip_entrypoint (gdbarch, pc); | |
8be455d7 JK |
3748 | if (skip) |
3749 | pc = gdbarch_skip_prologue (gdbarch, pc); | |
3750 | ||
3751 | /* For overlays, map pc back into its mapped VMA range. */ | |
3752 | pc = overlay_mapped_address (pc, section); | |
3753 | ||
3754 | /* Calculate line number. */ | |
059acae7 | 3755 | start_sal = find_pc_sect_line (pc, section, 0); |
8be455d7 JK |
3756 | |
3757 | /* Check if gdbarch_skip_prologue left us in mid-line, and the next | |
3758 | line is still part of the same function. */ | |
3759 | if (skip && start_sal.pc != pc | |
b1d96efd JK |
3760 | && (sym ? (BLOCK_START (SYMBOL_BLOCK_VALUE (sym)) <= start_sal.end |
3761 | && start_sal.end < BLOCK_END (SYMBOL_BLOCK_VALUE (sym))) | |
7cbd4a93 TT |
3762 | : (lookup_minimal_symbol_by_pc_section (start_sal.end, section).minsym |
3763 | == lookup_minimal_symbol_by_pc_section (pc, section).minsym))) | |
8be455d7 JK |
3764 | { |
3765 | /* First pc of next line */ | |
3766 | pc = start_sal.end; | |
3767 | /* Recalculate the line number (might not be N+1). */ | |
3768 | start_sal = find_pc_sect_line (pc, section, 0); | |
3769 | } | |
3770 | ||
3771 | /* On targets with executable formats that don't have a concept of | |
3772 | constructors (ELF with .init has, PE doesn't), gcc emits a call | |
3773 | to `__main' in `main' between the prologue and before user | |
3774 | code. */ | |
3775 | if (gdbarch_skip_main_prologue_p (gdbarch) | |
7ccffd7c | 3776 | && name && strcmp_iw (name, "main") == 0) |
8be455d7 JK |
3777 | { |
3778 | pc = gdbarch_skip_main_prologue (gdbarch, pc); | |
3779 | /* Recalculate the line number (might not be N+1). */ | |
3780 | start_sal = find_pc_sect_line (pc, section, 0); | |
3781 | force_skip = 1; | |
3782 | } | |
4309257c | 3783 | } |
8be455d7 | 3784 | while (!force_skip && skip--); |
4309257c | 3785 | |
8c7a1ee8 EZ |
3786 | /* If we still don't have a valid source line, try to find the first |
3787 | PC in the lineinfo table that belongs to the same function. This | |
3788 | happens with COFF debug info, which does not seem to have an | |
3789 | entry in lineinfo table for the code after the prologue which has | |
3790 | no direct relation to source. For example, this was found to be | |
3791 | the case with the DJGPP target using "gcc -gcoff" when the | |
3792 | compiler inserted code after the prologue to make sure the stack | |
3793 | is aligned. */ | |
8be455d7 | 3794 | if (!force_skip && sym && start_sal.symtab == NULL) |
8c7a1ee8 | 3795 | { |
08be3fe3 | 3796 | pc = skip_prologue_using_lineinfo (pc, symbol_symtab (sym)); |
8c7a1ee8 | 3797 | /* Recalculate the line number. */ |
059acae7 | 3798 | start_sal = find_pc_sect_line (pc, section, 0); |
8c7a1ee8 EZ |
3799 | } |
3800 | ||
059acae7 UW |
3801 | do_cleanups (old_chain); |
3802 | ||
3803 | /* If we're already past the prologue, leave SAL unchanged. Otherwise | |
3804 | forward SAL to the end of the prologue. */ | |
3805 | if (sal->pc >= pc) | |
3806 | return; | |
3807 | ||
3808 | sal->pc = pc; | |
3809 | sal->section = section; | |
3810 | ||
3811 | /* Unless the explicit_line flag was set, update the SAL line | |
3812 | and symtab to correspond to the modified PC location. */ | |
3813 | if (sal->explicit_line) | |
3814 | return; | |
3815 | ||
3816 | sal->symtab = start_sal.symtab; | |
3817 | sal->line = start_sal.line; | |
3818 | sal->end = start_sal.end; | |
c906108c | 3819 | |
edb3359d DJ |
3820 | /* Check if we are now inside an inlined function. If we can, |
3821 | use the call site of the function instead. */ | |
059acae7 | 3822 | b = block_for_pc_sect (sal->pc, sal->section); |
edb3359d DJ |
3823 | function_block = NULL; |
3824 | while (b != NULL) | |
3825 | { | |
3826 | if (BLOCK_FUNCTION (b) != NULL && block_inlined_p (b)) | |
3827 | function_block = b; | |
3828 | else if (BLOCK_FUNCTION (b) != NULL) | |
3829 | break; | |
3830 | b = BLOCK_SUPERBLOCK (b); | |
3831 | } | |
3832 | if (function_block != NULL | |
3833 | && SYMBOL_LINE (BLOCK_FUNCTION (function_block)) != 0) | |
3834 | { | |
059acae7 | 3835 | sal->line = SYMBOL_LINE (BLOCK_FUNCTION (function_block)); |
08be3fe3 | 3836 | sal->symtab = symbol_symtab (BLOCK_FUNCTION (function_block)); |
edb3359d | 3837 | } |
c906108c | 3838 | } |
50641945 | 3839 | |
f1f58506 DE |
3840 | /* Given PC at the function's start address, attempt to find the |
3841 | prologue end using SAL information. Return zero if the skip fails. | |
3842 | ||
3843 | A non-optimized prologue traditionally has one SAL for the function | |
3844 | and a second for the function body. A single line function has | |
3845 | them both pointing at the same line. | |
3846 | ||
3847 | An optimized prologue is similar but the prologue may contain | |
3848 | instructions (SALs) from the instruction body. Need to skip those | |
3849 | while not getting into the function body. | |
3850 | ||
3851 | The functions end point and an increasing SAL line are used as | |
3852 | indicators of the prologue's endpoint. | |
3853 | ||
3854 | This code is based on the function refine_prologue_limit | |
3855 | (found in ia64). */ | |
3856 | ||
3857 | CORE_ADDR | |
3858 | skip_prologue_using_sal (struct gdbarch *gdbarch, CORE_ADDR func_addr) | |
3859 | { | |
3860 | struct symtab_and_line prologue_sal; | |
3861 | CORE_ADDR start_pc; | |
3862 | CORE_ADDR end_pc; | |
3863 | const struct block *bl; | |
3864 | ||
3865 | /* Get an initial range for the function. */ | |
3866 | find_pc_partial_function (func_addr, NULL, &start_pc, &end_pc); | |
3867 | start_pc += gdbarch_deprecated_function_start_offset (gdbarch); | |
3868 | ||
3869 | prologue_sal = find_pc_line (start_pc, 0); | |
3870 | if (prologue_sal.line != 0) | |
3871 | { | |
3872 | /* For languages other than assembly, treat two consecutive line | |
3873 | entries at the same address as a zero-instruction prologue. | |
3874 | The GNU assembler emits separate line notes for each instruction | |
3875 | in a multi-instruction macro, but compilers generally will not | |
3876 | do this. */ | |
3877 | if (prologue_sal.symtab->language != language_asm) | |
3878 | { | |
8435453b | 3879 | struct linetable *linetable = SYMTAB_LINETABLE (prologue_sal.symtab); |
f1f58506 DE |
3880 | int idx = 0; |
3881 | ||
3882 | /* Skip any earlier lines, and any end-of-sequence marker | |
3883 | from a previous function. */ | |
3884 | while (linetable->item[idx].pc != prologue_sal.pc | |
3885 | || linetable->item[idx].line == 0) | |
3886 | idx++; | |
3887 | ||
3888 | if (idx+1 < linetable->nitems | |
3889 | && linetable->item[idx+1].line != 0 | |
3890 | && linetable->item[idx+1].pc == start_pc) | |
3891 | return start_pc; | |
3892 | } | |
3893 | ||
3894 | /* If there is only one sal that covers the entire function, | |
3895 | then it is probably a single line function, like | |
3896 | "foo(){}". */ | |
3897 | if (prologue_sal.end >= end_pc) | |
3898 | return 0; | |
3899 | ||
3900 | while (prologue_sal.end < end_pc) | |
3901 | { | |
3902 | struct symtab_and_line sal; | |
3903 | ||
3904 | sal = find_pc_line (prologue_sal.end, 0); | |
3905 | if (sal.line == 0) | |
3906 | break; | |
3907 | /* Assume that a consecutive SAL for the same (or larger) | |
3908 | line mark the prologue -> body transition. */ | |
3909 | if (sal.line >= prologue_sal.line) | |
3910 | break; | |
3911 | /* Likewise if we are in a different symtab altogether | |
3912 | (e.g. within a file included via #include). */ | |
3913 | if (sal.symtab != prologue_sal.symtab) | |
3914 | break; | |
3915 | ||
3916 | /* The line number is smaller. Check that it's from the | |
3917 | same function, not something inlined. If it's inlined, | |
3918 | then there is no point comparing the line numbers. */ | |
3919 | bl = block_for_pc (prologue_sal.end); | |
3920 | while (bl) | |
3921 | { | |
3922 | if (block_inlined_p (bl)) | |
3923 | break; | |
3924 | if (BLOCK_FUNCTION (bl)) | |
3925 | { | |
3926 | bl = NULL; | |
3927 | break; | |
3928 | } | |
3929 | bl = BLOCK_SUPERBLOCK (bl); | |
3930 | } | |
3931 | if (bl != NULL) | |
3932 | break; | |
3933 | ||
3934 | /* The case in which compiler's optimizer/scheduler has | |
3935 | moved instructions into the prologue. We look ahead in | |
3936 | the function looking for address ranges whose | |
3937 | corresponding line number is less the first one that we | |
3938 | found for the function. This is more conservative then | |
3939 | refine_prologue_limit which scans a large number of SALs | |
3940 | looking for any in the prologue. */ | |
3941 | prologue_sal = sal; | |
3942 | } | |
3943 | } | |
3944 | ||
3945 | if (prologue_sal.end < end_pc) | |
3946 | /* Return the end of this line, or zero if we could not find a | |
3947 | line. */ | |
3948 | return prologue_sal.end; | |
3949 | else | |
3950 | /* Don't return END_PC, which is past the end of the function. */ | |
3951 | return prologue_sal.pc; | |
3952 | } | |
3953 | \f | |
c906108c SS |
3954 | /* If P is of the form "operator[ \t]+..." where `...' is |
3955 | some legitimate operator text, return a pointer to the | |
3956 | beginning of the substring of the operator text. | |
3957 | Otherwise, return "". */ | |
eca864fe | 3958 | |
96142726 TT |
3959 | static const char * |
3960 | operator_chars (const char *p, const char **end) | |
c906108c SS |
3961 | { |
3962 | *end = ""; | |
61012eef | 3963 | if (!startswith (p, "operator")) |
c906108c SS |
3964 | return *end; |
3965 | p += 8; | |
3966 | ||
3967 | /* Don't get faked out by `operator' being part of a longer | |
3968 | identifier. */ | |
c5aa993b | 3969 | if (isalpha (*p) || *p == '_' || *p == '$' || *p == '\0') |
c906108c SS |
3970 | return *end; |
3971 | ||
3972 | /* Allow some whitespace between `operator' and the operator symbol. */ | |
3973 | while (*p == ' ' || *p == '\t') | |
3974 | p++; | |
3975 | ||
c378eb4e | 3976 | /* Recognize 'operator TYPENAME'. */ |
c906108c | 3977 | |
c5aa993b | 3978 | if (isalpha (*p) || *p == '_' || *p == '$') |
c906108c | 3979 | { |
96142726 | 3980 | const char *q = p + 1; |
433759f7 | 3981 | |
c5aa993b | 3982 | while (isalnum (*q) || *q == '_' || *q == '$') |
c906108c SS |
3983 | q++; |
3984 | *end = q; | |
3985 | return p; | |
3986 | } | |
3987 | ||
53e8ad3d MS |
3988 | while (*p) |
3989 | switch (*p) | |
3990 | { | |
3991 | case '\\': /* regexp quoting */ | |
3992 | if (p[1] == '*') | |
3993 | { | |
3e43a32a | 3994 | if (p[2] == '=') /* 'operator\*=' */ |
53e8ad3d MS |
3995 | *end = p + 3; |
3996 | else /* 'operator\*' */ | |
3997 | *end = p + 2; | |
3998 | return p; | |
3999 | } | |
4000 | else if (p[1] == '[') | |
4001 | { | |
4002 | if (p[2] == ']') | |
3e43a32a MS |
4003 | error (_("mismatched quoting on brackets, " |
4004 | "try 'operator\\[\\]'")); | |
53e8ad3d MS |
4005 | else if (p[2] == '\\' && p[3] == ']') |
4006 | { | |
4007 | *end = p + 4; /* 'operator\[\]' */ | |
4008 | return p; | |
4009 | } | |
4010 | else | |
8a3fe4f8 | 4011 | error (_("nothing is allowed between '[' and ']'")); |
53e8ad3d | 4012 | } |
9af17804 | 4013 | else |
53e8ad3d | 4014 | { |
c378eb4e | 4015 | /* Gratuitous qoute: skip it and move on. */ |
53e8ad3d MS |
4016 | p++; |
4017 | continue; | |
4018 | } | |
4019 | break; | |
4020 | case '!': | |
4021 | case '=': | |
4022 | case '*': | |
4023 | case '/': | |
4024 | case '%': | |
4025 | case '^': | |
4026 | if (p[1] == '=') | |
4027 | *end = p + 2; | |
4028 | else | |
4029 | *end = p + 1; | |
4030 | return p; | |
4031 | case '<': | |
4032 | case '>': | |
4033 | case '+': | |
4034 | case '-': | |
4035 | case '&': | |
4036 | case '|': | |
4037 | if (p[0] == '-' && p[1] == '>') | |
4038 | { | |
c378eb4e | 4039 | /* Struct pointer member operator 'operator->'. */ |
53e8ad3d MS |
4040 | if (p[2] == '*') |
4041 | { | |
4042 | *end = p + 3; /* 'operator->*' */ | |
4043 | return p; | |
4044 | } | |
4045 | else if (p[2] == '\\') | |
4046 | { | |
4047 | *end = p + 4; /* Hopefully 'operator->\*' */ | |
4048 | return p; | |
4049 | } | |
4050 | else | |
4051 | { | |
4052 | *end = p + 2; /* 'operator->' */ | |
4053 | return p; | |
4054 | } | |
4055 | } | |
4056 | if (p[1] == '=' || p[1] == p[0]) | |
4057 | *end = p + 2; | |
4058 | else | |
4059 | *end = p + 1; | |
4060 | return p; | |
4061 | case '~': | |
4062 | case ',': | |
c5aa993b | 4063 | *end = p + 1; |
53e8ad3d MS |
4064 | return p; |
4065 | case '(': | |
4066 | if (p[1] != ')') | |
3e43a32a MS |
4067 | error (_("`operator ()' must be specified " |
4068 | "without whitespace in `()'")); | |
c5aa993b | 4069 | *end = p + 2; |
53e8ad3d MS |
4070 | return p; |
4071 | case '?': | |
4072 | if (p[1] != ':') | |
3e43a32a MS |
4073 | error (_("`operator ?:' must be specified " |
4074 | "without whitespace in `?:'")); | |
53e8ad3d MS |
4075 | *end = p + 2; |
4076 | return p; | |
4077 | case '[': | |
4078 | if (p[1] != ']') | |
3e43a32a MS |
4079 | error (_("`operator []' must be specified " |
4080 | "without whitespace in `[]'")); | |
53e8ad3d MS |
4081 | *end = p + 2; |
4082 | return p; | |
4083 | default: | |
8a3fe4f8 | 4084 | error (_("`operator %s' not supported"), p); |
53e8ad3d MS |
4085 | break; |
4086 | } | |
4087 | ||
c906108c SS |
4088 | *end = ""; |
4089 | return *end; | |
4090 | } | |
c906108c | 4091 | \f |
c5aa993b | 4092 | |
9fdc877b DE |
4093 | /* Cache to watch for file names already seen by filename_seen. */ |
4094 | ||
4095 | struct filename_seen_cache | |
4096 | { | |
4097 | /* Table of files seen so far. */ | |
2908cac6 DE |
4098 | htab_t tab; |
4099 | /* Initial size of the table. It automagically grows from here. */ | |
9fdc877b | 4100 | #define INITIAL_FILENAME_SEEN_CACHE_SIZE 100 |
9fdc877b DE |
4101 | }; |
4102 | ||
4103 | /* filename_seen_cache constructor. */ | |
4104 | ||
4105 | static struct filename_seen_cache * | |
4106 | create_filename_seen_cache (void) | |
4107 | { | |
8d749320 | 4108 | struct filename_seen_cache *cache = XNEW (struct filename_seen_cache); |
9fdc877b | 4109 | |
2908cac6 DE |
4110 | cache->tab = htab_create_alloc (INITIAL_FILENAME_SEEN_CACHE_SIZE, |
4111 | filename_hash, filename_eq, | |
4112 | NULL, xcalloc, xfree); | |
9fdc877b DE |
4113 | |
4114 | return cache; | |
4115 | } | |
4116 | ||
4117 | /* Empty the cache, but do not delete it. */ | |
4118 | ||
4119 | static void | |
2908cac6 | 4120 | clear_filename_seen_cache (struct filename_seen_cache *cache) |
9fdc877b | 4121 | { |
2908cac6 | 4122 | htab_empty (cache->tab); |
9fdc877b DE |
4123 | } |
4124 | ||
4125 | /* filename_seen_cache destructor. | |
4126 | This takes a void * argument as it is generally used as a cleanup. */ | |
4127 | ||
4128 | static void | |
4129 | delete_filename_seen_cache (void *ptr) | |
4130 | { | |
19ba03f4 | 4131 | struct filename_seen_cache *cache = (struct filename_seen_cache *) ptr; |
9fdc877b | 4132 | |
2908cac6 | 4133 | htab_delete (cache->tab); |
9fdc877b DE |
4134 | xfree (cache); |
4135 | } | |
4136 | ||
a2b6eff5 | 4137 | /* If FILE is not already in the table of files in CACHE, return zero; |
c94fdfd0 | 4138 | otherwise return non-zero. Optionally add FILE to the table if ADD |
2908cac6 DE |
4139 | is non-zero. |
4140 | ||
4141 | NOTE: We don't manage space for FILE, we assume FILE lives as long | |
4142 | as the caller needs. */ | |
eca864fe | 4143 | |
c94fdfd0 | 4144 | static int |
9fdc877b | 4145 | filename_seen (struct filename_seen_cache *cache, const char *file, int add) |
c906108c | 4146 | { |
2908cac6 | 4147 | void **slot; |
c906108c | 4148 | |
c94fdfd0 | 4149 | /* Is FILE in tab? */ |
2908cac6 DE |
4150 | slot = htab_find_slot (cache->tab, file, add ? INSERT : NO_INSERT); |
4151 | if (*slot != NULL) | |
4152 | return 1; | |
c94fdfd0 EZ |
4153 | |
4154 | /* No; maybe add it to tab. */ | |
4155 | if (add) | |
2908cac6 | 4156 | *slot = (char *) file; |
c906108c | 4157 | |
c94fdfd0 EZ |
4158 | return 0; |
4159 | } | |
4160 | ||
9fdc877b DE |
4161 | /* Data structure to maintain printing state for output_source_filename. */ |
4162 | ||
4163 | struct output_source_filename_data | |
4164 | { | |
4165 | /* Cache of what we've seen so far. */ | |
4166 | struct filename_seen_cache *filename_seen_cache; | |
4167 | ||
4168 | /* Flag of whether we're printing the first one. */ | |
4169 | int first; | |
4170 | }; | |
4171 | ||
c94fdfd0 | 4172 | /* Slave routine for sources_info. Force line breaks at ,'s. |
9fdc877b DE |
4173 | NAME is the name to print. |
4174 | DATA contains the state for printing and watching for duplicates. */ | |
eca864fe | 4175 | |
c94fdfd0 | 4176 | static void |
9fdc877b DE |
4177 | output_source_filename (const char *name, |
4178 | struct output_source_filename_data *data) | |
c94fdfd0 EZ |
4179 | { |
4180 | /* Since a single source file can result in several partial symbol | |
4181 | tables, we need to avoid printing it more than once. Note: if | |
4182 | some of the psymtabs are read in and some are not, it gets | |
4183 | printed both under "Source files for which symbols have been | |
4184 | read" and "Source files for which symbols will be read in on | |
4185 | demand". I consider this a reasonable way to deal with the | |
4186 | situation. I'm not sure whether this can also happen for | |
4187 | symtabs; it doesn't hurt to check. */ | |
4188 | ||
4189 | /* Was NAME already seen? */ | |
9fdc877b | 4190 | if (filename_seen (data->filename_seen_cache, name, 1)) |
c94fdfd0 EZ |
4191 | { |
4192 | /* Yes; don't print it again. */ | |
4193 | return; | |
4194 | } | |
9fdc877b | 4195 | |
c94fdfd0 | 4196 | /* No; print it and reset *FIRST. */ |
9fdc877b DE |
4197 | if (! data->first) |
4198 | printf_filtered (", "); | |
4199 | data->first = 0; | |
c906108c SS |
4200 | |
4201 | wrap_here (""); | |
4202 | fputs_filtered (name, gdb_stdout); | |
c5aa993b | 4203 | } |
c906108c | 4204 | |
ccefe4c4 | 4205 | /* A callback for map_partial_symbol_filenames. */ |
eca864fe | 4206 | |
ccefe4c4 | 4207 | static void |
533a737e | 4208 | output_partial_symbol_filename (const char *filename, const char *fullname, |
ccefe4c4 TT |
4209 | void *data) |
4210 | { | |
19ba03f4 SM |
4211 | output_source_filename (fullname ? fullname : filename, |
4212 | (struct output_source_filename_data *) data); | |
ccefe4c4 TT |
4213 | } |
4214 | ||
c906108c | 4215 | static void |
fba45db2 | 4216 | sources_info (char *ignore, int from_tty) |
c906108c | 4217 | { |
43f3e411 | 4218 | struct compunit_symtab *cu; |
52f0bd74 | 4219 | struct symtab *s; |
52f0bd74 | 4220 | struct objfile *objfile; |
9fdc877b DE |
4221 | struct output_source_filename_data data; |
4222 | struct cleanup *cleanups; | |
c5aa993b | 4223 | |
c906108c SS |
4224 | if (!have_full_symbols () && !have_partial_symbols ()) |
4225 | { | |
8a3fe4f8 | 4226 | error (_("No symbol table is loaded. Use the \"file\" command.")); |
c906108c | 4227 | } |
c5aa993b | 4228 | |
9fdc877b DE |
4229 | data.filename_seen_cache = create_filename_seen_cache (); |
4230 | cleanups = make_cleanup (delete_filename_seen_cache, | |
4231 | data.filename_seen_cache); | |
4232 | ||
c906108c SS |
4233 | printf_filtered ("Source files for which symbols have been read in:\n\n"); |
4234 | ||
9fdc877b | 4235 | data.first = 1; |
43f3e411 | 4236 | ALL_FILETABS (objfile, cu, s) |
c5aa993b | 4237 | { |
d092d1a2 | 4238 | const char *fullname = symtab_to_fullname (s); |
433759f7 | 4239 | |
f35a17b5 | 4240 | output_source_filename (fullname, &data); |
c5aa993b | 4241 | } |
c906108c | 4242 | printf_filtered ("\n\n"); |
c5aa993b | 4243 | |
3e43a32a MS |
4244 | printf_filtered ("Source files for which symbols " |
4245 | "will be read in on demand:\n\n"); | |
c906108c | 4246 | |
9fdc877b DE |
4247 | clear_filename_seen_cache (data.filename_seen_cache); |
4248 | data.first = 1; | |
bb4142cf DE |
4249 | map_symbol_filenames (output_partial_symbol_filename, &data, |
4250 | 1 /*need_fullname*/); | |
c906108c | 4251 | printf_filtered ("\n"); |
9fdc877b DE |
4252 | |
4253 | do_cleanups (cleanups); | |
c906108c SS |
4254 | } |
4255 | ||
fbd9ab74 JK |
4256 | /* Compare FILE against all the NFILES entries of FILES. If BASENAMES is |
4257 | non-zero compare only lbasename of FILES. */ | |
4258 | ||
c906108c | 4259 | static int |
96142726 | 4260 | file_matches (const char *file, const char *files[], int nfiles, int basenames) |
c906108c SS |
4261 | { |
4262 | int i; | |
4263 | ||
4264 | if (file != NULL && nfiles != 0) | |
4265 | { | |
4266 | for (i = 0; i < nfiles; i++) | |
c5aa993b | 4267 | { |
fbd9ab74 JK |
4268 | if (compare_filenames_for_search (file, (basenames |
4269 | ? lbasename (files[i]) | |
4270 | : files[i]))) | |
c5aa993b JM |
4271 | return 1; |
4272 | } | |
c906108c SS |
4273 | } |
4274 | else if (nfiles == 0) | |
4275 | return 1; | |
4276 | return 0; | |
4277 | } | |
4278 | ||
c378eb4e | 4279 | /* Free any memory associated with a search. */ |
eca864fe | 4280 | |
c906108c | 4281 | void |
fba45db2 | 4282 | free_search_symbols (struct symbol_search *symbols) |
c906108c SS |
4283 | { |
4284 | struct symbol_search *p; | |
4285 | struct symbol_search *next; | |
4286 | ||
4287 | for (p = symbols; p != NULL; p = next) | |
4288 | { | |
4289 | next = p->next; | |
b8c9b27d | 4290 | xfree (p); |
c906108c SS |
4291 | } |
4292 | } | |
4293 | ||
5bd98722 | 4294 | static void |
b52109bc | 4295 | do_free_search_symbols_cleanup (void *symbolsp) |
5bd98722 | 4296 | { |
b52109bc DE |
4297 | struct symbol_search *symbols = *(struct symbol_search **) symbolsp; |
4298 | ||
5bd98722 AC |
4299 | free_search_symbols (symbols); |
4300 | } | |
4301 | ||
4302 | struct cleanup * | |
b52109bc | 4303 | make_cleanup_free_search_symbols (struct symbol_search **symbolsp) |
5bd98722 | 4304 | { |
b52109bc | 4305 | return make_cleanup (do_free_search_symbols_cleanup, symbolsp); |
5bd98722 AC |
4306 | } |
4307 | ||
b52109bc | 4308 | /* Helper function for sort_search_symbols_remove_dups and qsort. Can only |
434d2d4f | 4309 | sort symbols, not minimal symbols. */ |
eca864fe | 4310 | |
434d2d4f DJ |
4311 | static int |
4312 | compare_search_syms (const void *sa, const void *sb) | |
4313 | { | |
b52109bc DE |
4314 | struct symbol_search *sym_a = *(struct symbol_search **) sa; |
4315 | struct symbol_search *sym_b = *(struct symbol_search **) sb; | |
4316 | int c; | |
4317 | ||
08be3fe3 DE |
4318 | c = FILENAME_CMP (symbol_symtab (sym_a->symbol)->filename, |
4319 | symbol_symtab (sym_b->symbol)->filename); | |
b52109bc DE |
4320 | if (c != 0) |
4321 | return c; | |
434d2d4f | 4322 | |
b52109bc DE |
4323 | if (sym_a->block != sym_b->block) |
4324 | return sym_a->block - sym_b->block; | |
4325 | ||
4326 | return strcmp (SYMBOL_PRINT_NAME (sym_a->symbol), | |
4327 | SYMBOL_PRINT_NAME (sym_b->symbol)); | |
434d2d4f DJ |
4328 | } |
4329 | ||
b52109bc DE |
4330 | /* Sort the NFOUND symbols in list FOUND and remove duplicates. |
4331 | The duplicates are freed, and the new list is returned in | |
4332 | *NEW_HEAD, *NEW_TAIL. */ | |
4333 | ||
4334 | static void | |
4335 | sort_search_symbols_remove_dups (struct symbol_search *found, int nfound, | |
4336 | struct symbol_search **new_head, | |
4337 | struct symbol_search **new_tail) | |
434d2d4f | 4338 | { |
870f88f7 | 4339 | struct symbol_search **symbols, *symp; |
b52109bc | 4340 | int i, j, nunique; |
434d2d4f | 4341 | |
b52109bc DE |
4342 | gdb_assert (found != NULL && nfound > 0); |
4343 | ||
4344 | /* Build an array out of the list so we can easily sort them. */ | |
8d749320 SM |
4345 | symbols = XNEWVEC (struct symbol_search *, nfound); |
4346 | ||
b52109bc | 4347 | symp = found; |
434d2d4f DJ |
4348 | for (i = 0; i < nfound; i++) |
4349 | { | |
b52109bc DE |
4350 | gdb_assert (symp != NULL); |
4351 | gdb_assert (symp->block >= 0 && symp->block <= 1); | |
434d2d4f DJ |
4352 | symbols[i] = symp; |
4353 | symp = symp->next; | |
4354 | } | |
b52109bc | 4355 | gdb_assert (symp == NULL); |
434d2d4f DJ |
4356 | |
4357 | qsort (symbols, nfound, sizeof (struct symbol_search *), | |
4358 | compare_search_syms); | |
4359 | ||
b52109bc DE |
4360 | /* Collapse out the dups. */ |
4361 | for (i = 1, j = 1; i < nfound; ++i) | |
434d2d4f | 4362 | { |
6b9780fb | 4363 | if (compare_search_syms (&symbols[j - 1], &symbols[i]) != 0) |
b52109bc DE |
4364 | symbols[j++] = symbols[i]; |
4365 | else | |
4366 | xfree (symbols[i]); | |
434d2d4f | 4367 | } |
b52109bc DE |
4368 | nunique = j; |
4369 | symbols[j - 1]->next = NULL; | |
4370 | ||
4371 | /* Rebuild the linked list. */ | |
4372 | for (i = 0; i < nunique - 1; i++) | |
4373 | symbols[i]->next = symbols[i + 1]; | |
4374 | symbols[nunique - 1]->next = NULL; | |
434d2d4f | 4375 | |
b52109bc DE |
4376 | *new_head = symbols[0]; |
4377 | *new_tail = symbols[nunique - 1]; | |
8ed32cc0 | 4378 | xfree (symbols); |
434d2d4f | 4379 | } |
5bd98722 | 4380 | |
ccefe4c4 TT |
4381 | /* An object of this type is passed as the user_data to the |
4382 | expand_symtabs_matching method. */ | |
4383 | struct search_symbols_data | |
4384 | { | |
4385 | int nfiles; | |
96142726 | 4386 | const char **files; |
681bf369 JK |
4387 | |
4388 | /* It is true if PREG contains valid data, false otherwise. */ | |
4389 | unsigned preg_p : 1; | |
4390 | regex_t preg; | |
ccefe4c4 TT |
4391 | }; |
4392 | ||
4393 | /* A callback for expand_symtabs_matching. */ | |
eca864fe | 4394 | |
ccefe4c4 | 4395 | static int |
fbd9ab74 JK |
4396 | search_symbols_file_matches (const char *filename, void *user_data, |
4397 | int basenames) | |
ccefe4c4 | 4398 | { |
19ba03f4 | 4399 | struct search_symbols_data *data = (struct search_symbols_data *) user_data; |
433759f7 | 4400 | |
fbd9ab74 | 4401 | return file_matches (filename, data->files, data->nfiles, basenames); |
ccefe4c4 TT |
4402 | } |
4403 | ||
4404 | /* A callback for expand_symtabs_matching. */ | |
eca864fe | 4405 | |
ccefe4c4 | 4406 | static int |
e078317b | 4407 | search_symbols_name_matches (const char *symname, void *user_data) |
ccefe4c4 | 4408 | { |
19ba03f4 | 4409 | struct search_symbols_data *data = (struct search_symbols_data *) user_data; |
433759f7 | 4410 | |
681bf369 | 4411 | return !data->preg_p || regexec (&data->preg, symname, 0, NULL, 0) == 0; |
ccefe4c4 TT |
4412 | } |
4413 | ||
c906108c SS |
4414 | /* Search the symbol table for matches to the regular expression REGEXP, |
4415 | returning the results in *MATCHES. | |
4416 | ||
4417 | Only symbols of KIND are searched: | |
e8930875 JK |
4418 | VARIABLES_DOMAIN - search all symbols, excluding functions, type names, |
4419 | and constants (enums) | |
176620f1 EZ |
4420 | FUNCTIONS_DOMAIN - search all functions |
4421 | TYPES_DOMAIN - search all type names | |
7b08b9eb | 4422 | ALL_DOMAIN - an internal error for this function |
c906108c SS |
4423 | |
4424 | free_search_symbols should be called when *MATCHES is no longer needed. | |
434d2d4f | 4425 | |
b52109bc DE |
4426 | Within each file the results are sorted locally; each symtab's global and |
4427 | static blocks are separately alphabetized. | |
4428 | Duplicate entries are removed. */ | |
c378eb4e | 4429 | |
c906108c | 4430 | void |
96142726 TT |
4431 | search_symbols (const char *regexp, enum search_domain kind, |
4432 | int nfiles, const char *files[], | |
fd118b61 | 4433 | struct symbol_search **matches) |
c906108c | 4434 | { |
43f3e411 | 4435 | struct compunit_symtab *cust; |
346d1dfe | 4436 | const struct blockvector *bv; |
52f0bd74 AC |
4437 | struct block *b; |
4438 | int i = 0; | |
8157b174 | 4439 | struct block_iterator iter; |
52f0bd74 | 4440 | struct symbol *sym; |
c906108c SS |
4441 | struct objfile *objfile; |
4442 | struct minimal_symbol *msymbol; | |
c906108c | 4443 | int found_misc = 0; |
bc043ef3 | 4444 | static const enum minimal_symbol_type types[] |
e8930875 | 4445 | = {mst_data, mst_text, mst_abs}; |
bc043ef3 | 4446 | static const enum minimal_symbol_type types2[] |
e8930875 | 4447 | = {mst_bss, mst_file_text, mst_abs}; |
bc043ef3 | 4448 | static const enum minimal_symbol_type types3[] |
e8930875 | 4449 | = {mst_file_data, mst_solib_trampoline, mst_abs}; |
bc043ef3 | 4450 | static const enum minimal_symbol_type types4[] |
e8930875 | 4451 | = {mst_file_bss, mst_text_gnu_ifunc, mst_abs}; |
c906108c SS |
4452 | enum minimal_symbol_type ourtype; |
4453 | enum minimal_symbol_type ourtype2; | |
4454 | enum minimal_symbol_type ourtype3; | |
4455 | enum minimal_symbol_type ourtype4; | |
b52109bc | 4456 | struct symbol_search *found; |
c906108c | 4457 | struct symbol_search *tail; |
ccefe4c4 | 4458 | struct search_symbols_data datum; |
b52109bc | 4459 | int nfound; |
c906108c | 4460 | |
681bf369 JK |
4461 | /* OLD_CHAIN .. RETVAL_CHAIN is always freed, RETVAL_CHAIN .. current |
4462 | CLEANUP_CHAIN is freed only in the case of an error. */ | |
4463 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); | |
4464 | struct cleanup *retval_chain; | |
4465 | ||
e8930875 JK |
4466 | gdb_assert (kind <= TYPES_DOMAIN); |
4467 | ||
8903c50d TT |
4468 | ourtype = types[kind]; |
4469 | ourtype2 = types2[kind]; | |
4470 | ourtype3 = types3[kind]; | |
4471 | ourtype4 = types4[kind]; | |
c906108c | 4472 | |
b52109bc | 4473 | *matches = NULL; |
681bf369 | 4474 | datum.preg_p = 0; |
c906108c SS |
4475 | |
4476 | if (regexp != NULL) | |
4477 | { | |
4478 | /* Make sure spacing is right for C++ operators. | |
4479 | This is just a courtesy to make the matching less sensitive | |
4480 | to how many spaces the user leaves between 'operator' | |
c378eb4e | 4481 | and <TYPENAME> or <OPERATOR>. */ |
96142726 TT |
4482 | const char *opend; |
4483 | const char *opname = operator_chars (regexp, &opend); | |
681bf369 | 4484 | int errcode; |
433759f7 | 4485 | |
c906108c | 4486 | if (*opname) |
c5aa993b | 4487 | { |
3e43a32a MS |
4488 | int fix = -1; /* -1 means ok; otherwise number of |
4489 | spaces needed. */ | |
433759f7 | 4490 | |
c5aa993b JM |
4491 | if (isalpha (*opname) || *opname == '_' || *opname == '$') |
4492 | { | |
c378eb4e | 4493 | /* There should 1 space between 'operator' and 'TYPENAME'. */ |
c5aa993b JM |
4494 | if (opname[-1] != ' ' || opname[-2] == ' ') |
4495 | fix = 1; | |
4496 | } | |
4497 | else | |
4498 | { | |
c378eb4e | 4499 | /* There should 0 spaces between 'operator' and 'OPERATOR'. */ |
c5aa993b JM |
4500 | if (opname[-1] == ' ') |
4501 | fix = 0; | |
4502 | } | |
c378eb4e | 4503 | /* If wrong number of spaces, fix it. */ |
c5aa993b JM |
4504 | if (fix >= 0) |
4505 | { | |
045f55a6 | 4506 | char *tmp = (char *) alloca (8 + fix + strlen (opname) + 1); |
433759f7 | 4507 | |
c5aa993b JM |
4508 | sprintf (tmp, "operator%.*s%s", fix, " ", opname); |
4509 | regexp = tmp; | |
4510 | } | |
4511 | } | |
4512 | ||
559a7a62 JK |
4513 | errcode = regcomp (&datum.preg, regexp, |
4514 | REG_NOSUB | (case_sensitivity == case_sensitive_off | |
4515 | ? REG_ICASE : 0)); | |
681bf369 JK |
4516 | if (errcode != 0) |
4517 | { | |
4518 | char *err = get_regcomp_error (errcode, &datum.preg); | |
4519 | ||
4520 | make_cleanup (xfree, err); | |
4521 | error (_("Invalid regexp (%s): %s"), err, regexp); | |
4522 | } | |
4523 | datum.preg_p = 1; | |
4524 | make_regfree_cleanup (&datum.preg); | |
c906108c SS |
4525 | } |
4526 | ||
4527 | /* Search through the partial symtabs *first* for all symbols | |
4528 | matching the regexp. That way we don't have to reproduce all of | |
c378eb4e | 4529 | the machinery below. */ |
c906108c | 4530 | |
ccefe4c4 TT |
4531 | datum.nfiles = nfiles; |
4532 | datum.files = files; | |
bb4142cf DE |
4533 | expand_symtabs_matching ((nfiles == 0 |
4534 | ? NULL | |
4535 | : search_symbols_file_matches), | |
4536 | search_symbols_name_matches, | |
276d885b | 4537 | NULL, kind, &datum); |
c906108c SS |
4538 | |
4539 | /* Here, we search through the minimal symbol tables for functions | |
4540 | and variables that match, and force their symbols to be read. | |
4541 | This is in particular necessary for demangled variable names, | |
4542 | which are no longer put into the partial symbol tables. | |
4543 | The symbol will then be found during the scan of symtabs below. | |
4544 | ||
4545 | For functions, find_pc_symtab should succeed if we have debug info | |
422d65e7 DE |
4546 | for the function, for variables we have to call |
4547 | lookup_symbol_in_objfile_from_linkage_name to determine if the variable | |
4548 | has debug info. | |
c906108c | 4549 | If the lookup fails, set found_misc so that we will rescan to print |
422d65e7 DE |
4550 | any matching symbols without debug info. |
4551 | We only search the objfile the msymbol came from, we no longer search | |
4552 | all objfiles. In large programs (1000s of shared libs) searching all | |
4553 | objfiles is not worth the pain. */ | |
c906108c | 4554 | |
176620f1 | 4555 | if (nfiles == 0 && (kind == VARIABLES_DOMAIN || kind == FUNCTIONS_DOMAIN)) |
c906108c SS |
4556 | { |
4557 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b | 4558 | { |
89295b4d PP |
4559 | QUIT; |
4560 | ||
422d65e7 DE |
4561 | if (msymbol->created_by_gdb) |
4562 | continue; | |
4563 | ||
d50bd42b DE |
4564 | if (MSYMBOL_TYPE (msymbol) == ourtype |
4565 | || MSYMBOL_TYPE (msymbol) == ourtype2 | |
4566 | || MSYMBOL_TYPE (msymbol) == ourtype3 | |
4567 | || MSYMBOL_TYPE (msymbol) == ourtype4) | |
c5aa993b | 4568 | { |
681bf369 | 4569 | if (!datum.preg_p |
efd66ac6 | 4570 | || regexec (&datum.preg, MSYMBOL_NATURAL_NAME (msymbol), 0, |
681bf369 | 4571 | NULL, 0) == 0) |
c5aa993b | 4572 | { |
422d65e7 DE |
4573 | /* Note: An important side-effect of these lookup functions |
4574 | is to expand the symbol table if msymbol is found, for the | |
43f3e411 | 4575 | benefit of the next loop on ALL_COMPUNITS. */ |
422d65e7 | 4576 | if (kind == FUNCTIONS_DOMAIN |
43f3e411 DE |
4577 | ? (find_pc_compunit_symtab |
4578 | (MSYMBOL_VALUE_ADDRESS (objfile, msymbol)) == NULL) | |
422d65e7 | 4579 | : (lookup_symbol_in_objfile_from_linkage_name |
efd66ac6 | 4580 | (objfile, MSYMBOL_LINKAGE_NAME (msymbol), VAR_DOMAIN) |
d12307c1 | 4581 | .symbol == NULL)) |
422d65e7 | 4582 | found_misc = 1; |
c5aa993b JM |
4583 | } |
4584 | } | |
4585 | } | |
c906108c SS |
4586 | } |
4587 | ||
b52109bc DE |
4588 | found = NULL; |
4589 | tail = NULL; | |
4590 | nfound = 0; | |
4591 | retval_chain = make_cleanup_free_search_symbols (&found); | |
4592 | ||
43f3e411 | 4593 | ALL_COMPUNITS (objfile, cust) |
c5aa993b | 4594 | { |
43f3e411 | 4595 | bv = COMPUNIT_BLOCKVECTOR (cust); |
d50bd42b DE |
4596 | for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++) |
4597 | { | |
d50bd42b DE |
4598 | b = BLOCKVECTOR_BLOCK (bv, i); |
4599 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
4600 | { | |
08be3fe3 | 4601 | struct symtab *real_symtab = symbol_symtab (sym); |
d50bd42b DE |
4602 | |
4603 | QUIT; | |
4604 | ||
fbd9ab74 JK |
4605 | /* Check first sole REAL_SYMTAB->FILENAME. It does not need to be |
4606 | a substring of symtab_to_fullname as it may contain "./" etc. */ | |
4607 | if ((file_matches (real_symtab->filename, files, nfiles, 0) | |
4608 | || ((basenames_may_differ | |
4609 | || file_matches (lbasename (real_symtab->filename), | |
4610 | files, nfiles, 1)) | |
4611 | && file_matches (symtab_to_fullname (real_symtab), | |
4612 | files, nfiles, 0))) | |
d50bd42b DE |
4613 | && ((!datum.preg_p |
4614 | || regexec (&datum.preg, SYMBOL_NATURAL_NAME (sym), 0, | |
4615 | NULL, 0) == 0) | |
4616 | && ((kind == VARIABLES_DOMAIN | |
4617 | && SYMBOL_CLASS (sym) != LOC_TYPEDEF | |
4618 | && SYMBOL_CLASS (sym) != LOC_UNRESOLVED | |
4619 | && SYMBOL_CLASS (sym) != LOC_BLOCK | |
4620 | /* LOC_CONST can be used for more than just enums, | |
4621 | e.g., c++ static const members. | |
4622 | We only want to skip enums here. */ | |
4623 | && !(SYMBOL_CLASS (sym) == LOC_CONST | |
01465b56 DE |
4624 | && (TYPE_CODE (SYMBOL_TYPE (sym)) |
4625 | == TYPE_CODE_ENUM))) | |
d50bd42b DE |
4626 | || (kind == FUNCTIONS_DOMAIN |
4627 | && SYMBOL_CLASS (sym) == LOC_BLOCK) | |
4628 | || (kind == TYPES_DOMAIN | |
4629 | && SYMBOL_CLASS (sym) == LOC_TYPEDEF)))) | |
4630 | { | |
4631 | /* match */ | |
8d749320 SM |
4632 | struct symbol_search *psr = XCNEW (struct symbol_search); |
4633 | ||
d50bd42b | 4634 | psr->block = i; |
d50bd42b | 4635 | psr->symbol = sym; |
d50bd42b DE |
4636 | psr->next = NULL; |
4637 | if (tail == NULL) | |
b52109bc | 4638 | found = psr; |
d50bd42b DE |
4639 | else |
4640 | tail->next = psr; | |
4641 | tail = psr; | |
4642 | nfound ++; | |
4643 | } | |
4644 | } | |
d50bd42b | 4645 | } |
c5aa993b | 4646 | } |
c906108c | 4647 | |
b52109bc DE |
4648 | if (found != NULL) |
4649 | { | |
4650 | sort_search_symbols_remove_dups (found, nfound, &found, &tail); | |
4651 | /* Note: nfound is no longer useful beyond this point. */ | |
4652 | } | |
4653 | ||
c906108c | 4654 | /* If there are no eyes, avoid all contact. I mean, if there are |
01465b56 | 4655 | no debug symbols, then add matching minsyms. */ |
c906108c | 4656 | |
422d65e7 | 4657 | if (found_misc || (nfiles == 0 && kind != FUNCTIONS_DOMAIN)) |
c906108c SS |
4658 | { |
4659 | ALL_MSYMBOLS (objfile, msymbol) | |
c5aa993b | 4660 | { |
89295b4d PP |
4661 | QUIT; |
4662 | ||
422d65e7 DE |
4663 | if (msymbol->created_by_gdb) |
4664 | continue; | |
4665 | ||
d50bd42b DE |
4666 | if (MSYMBOL_TYPE (msymbol) == ourtype |
4667 | || MSYMBOL_TYPE (msymbol) == ourtype2 | |
4668 | || MSYMBOL_TYPE (msymbol) == ourtype3 | |
4669 | || MSYMBOL_TYPE (msymbol) == ourtype4) | |
c5aa993b | 4670 | { |
681bf369 | 4671 | if (!datum.preg_p |
efd66ac6 | 4672 | || regexec (&datum.preg, MSYMBOL_NATURAL_NAME (msymbol), 0, |
681bf369 | 4673 | NULL, 0) == 0) |
c5aa993b | 4674 | { |
422d65e7 DE |
4675 | /* For functions we can do a quick check of whether the |
4676 | symbol might be found via find_pc_symtab. */ | |
4677 | if (kind != FUNCTIONS_DOMAIN | |
43f3e411 DE |
4678 | || (find_pc_compunit_symtab |
4679 | (MSYMBOL_VALUE_ADDRESS (objfile, msymbol)) == NULL)) | |
c5aa993b | 4680 | { |
422d65e7 | 4681 | if (lookup_symbol_in_objfile_from_linkage_name |
efd66ac6 | 4682 | (objfile, MSYMBOL_LINKAGE_NAME (msymbol), VAR_DOMAIN) |
d12307c1 | 4683 | .symbol == NULL) |
c5aa993b JM |
4684 | { |
4685 | /* match */ | |
8d749320 | 4686 | struct symbol_search *psr = XNEW (struct symbol_search); |
c5aa993b | 4687 | psr->block = i; |
7c7b6655 TT |
4688 | psr->msymbol.minsym = msymbol; |
4689 | psr->msymbol.objfile = objfile; | |
c5aa993b JM |
4690 | psr->symbol = NULL; |
4691 | psr->next = NULL; | |
4692 | if (tail == NULL) | |
b52109bc | 4693 | found = psr; |
c5aa993b JM |
4694 | else |
4695 | tail->next = psr; | |
4696 | tail = psr; | |
4697 | } | |
4698 | } | |
4699 | } | |
4700 | } | |
4701 | } | |
c906108c SS |
4702 | } |
4703 | ||
681bf369 JK |
4704 | discard_cleanups (retval_chain); |
4705 | do_cleanups (old_chain); | |
b52109bc | 4706 | *matches = found; |
c906108c SS |
4707 | } |
4708 | ||
4709 | /* Helper function for symtab_symbol_info, this function uses | |
4710 | the data returned from search_symbols() to print information | |
c378eb4e MS |
4711 | regarding the match to gdb_stdout. */ |
4712 | ||
c906108c | 4713 | static void |
8903c50d | 4714 | print_symbol_info (enum search_domain kind, |
d01060f0 | 4715 | struct symbol *sym, |
05cba821 | 4716 | int block, const char *last) |
c906108c | 4717 | { |
08be3fe3 | 4718 | struct symtab *s = symbol_symtab (sym); |
05cba821 JK |
4719 | const char *s_filename = symtab_to_filename_for_display (s); |
4720 | ||
4721 | if (last == NULL || filename_cmp (last, s_filename) != 0) | |
c906108c SS |
4722 | { |
4723 | fputs_filtered ("\nFile ", gdb_stdout); | |
05cba821 | 4724 | fputs_filtered (s_filename, gdb_stdout); |
c906108c SS |
4725 | fputs_filtered (":\n", gdb_stdout); |
4726 | } | |
4727 | ||
176620f1 | 4728 | if (kind != TYPES_DOMAIN && block == STATIC_BLOCK) |
c906108c | 4729 | printf_filtered ("static "); |
c5aa993b | 4730 | |
c378eb4e | 4731 | /* Typedef that is not a C++ class. */ |
176620f1 EZ |
4732 | if (kind == TYPES_DOMAIN |
4733 | && SYMBOL_DOMAIN (sym) != STRUCT_DOMAIN) | |
a5238fbc | 4734 | typedef_print (SYMBOL_TYPE (sym), sym, gdb_stdout); |
c378eb4e | 4735 | /* variable, func, or typedef-that-is-c++-class. */ |
d50bd42b DE |
4736 | else if (kind < TYPES_DOMAIN |
4737 | || (kind == TYPES_DOMAIN | |
4738 | && SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN)) | |
c906108c SS |
4739 | { |
4740 | type_print (SYMBOL_TYPE (sym), | |
c5aa993b | 4741 | (SYMBOL_CLASS (sym) == LOC_TYPEDEF |
de5ad195 | 4742 | ? "" : SYMBOL_PRINT_NAME (sym)), |
c5aa993b | 4743 | gdb_stdout, 0); |
c906108c SS |
4744 | |
4745 | printf_filtered (";\n"); | |
4746 | } | |
c906108c SS |
4747 | } |
4748 | ||
4749 | /* This help function for symtab_symbol_info() prints information | |
c378eb4e MS |
4750 | for non-debugging symbols to gdb_stdout. */ |
4751 | ||
c906108c | 4752 | static void |
7c7b6655 | 4753 | print_msymbol_info (struct bound_minimal_symbol msymbol) |
c906108c | 4754 | { |
7c7b6655 | 4755 | struct gdbarch *gdbarch = get_objfile_arch (msymbol.objfile); |
3ac4495a MS |
4756 | char *tmp; |
4757 | ||
d80b854b | 4758 | if (gdbarch_addr_bit (gdbarch) <= 32) |
77e371c0 | 4759 | tmp = hex_string_custom (BMSYMBOL_VALUE_ADDRESS (msymbol) |
bb599908 PH |
4760 | & (CORE_ADDR) 0xffffffff, |
4761 | 8); | |
3ac4495a | 4762 | else |
77e371c0 | 4763 | tmp = hex_string_custom (BMSYMBOL_VALUE_ADDRESS (msymbol), |
bb599908 | 4764 | 16); |
3ac4495a | 4765 | printf_filtered ("%s %s\n", |
efd66ac6 | 4766 | tmp, MSYMBOL_PRINT_NAME (msymbol.minsym)); |
c906108c SS |
4767 | } |
4768 | ||
4769 | /* This is the guts of the commands "info functions", "info types", and | |
c378eb4e | 4770 | "info variables". It calls search_symbols to find all matches and then |
c906108c | 4771 | print_[m]symbol_info to print out some useful information about the |
c378eb4e MS |
4772 | matches. */ |
4773 | ||
c906108c | 4774 | static void |
8903c50d | 4775 | symtab_symbol_info (char *regexp, enum search_domain kind, int from_tty) |
c906108c | 4776 | { |
bc043ef3 | 4777 | static const char * const classnames[] = |
e8930875 | 4778 | {"variable", "function", "type"}; |
c906108c SS |
4779 | struct symbol_search *symbols; |
4780 | struct symbol_search *p; | |
4781 | struct cleanup *old_chain; | |
05cba821 | 4782 | const char *last_filename = NULL; |
c906108c SS |
4783 | int first = 1; |
4784 | ||
e8930875 JK |
4785 | gdb_assert (kind <= TYPES_DOMAIN); |
4786 | ||
c378eb4e | 4787 | /* Must make sure that if we're interrupted, symbols gets freed. */ |
96142726 | 4788 | search_symbols (regexp, kind, 0, NULL, &symbols); |
b52109bc | 4789 | old_chain = make_cleanup_free_search_symbols (&symbols); |
c906108c | 4790 | |
ca242aad YQ |
4791 | if (regexp != NULL) |
4792 | printf_filtered (_("All %ss matching regular expression \"%s\":\n"), | |
4793 | classnames[kind], regexp); | |
4794 | else | |
4795 | printf_filtered (_("All defined %ss:\n"), classnames[kind]); | |
c906108c SS |
4796 | |
4797 | for (p = symbols; p != NULL; p = p->next) | |
4798 | { | |
4799 | QUIT; | |
4800 | ||
7c7b6655 | 4801 | if (p->msymbol.minsym != NULL) |
c5aa993b JM |
4802 | { |
4803 | if (first) | |
4804 | { | |
ca242aad | 4805 | printf_filtered (_("\nNon-debugging symbols:\n")); |
c5aa993b JM |
4806 | first = 0; |
4807 | } | |
4808 | print_msymbol_info (p->msymbol); | |
4809 | } | |
c906108c | 4810 | else |
c5aa993b JM |
4811 | { |
4812 | print_symbol_info (kind, | |
c5aa993b JM |
4813 | p->symbol, |
4814 | p->block, | |
4815 | last_filename); | |
d01060f0 | 4816 | last_filename |
08be3fe3 | 4817 | = symtab_to_filename_for_display (symbol_symtab (p->symbol)); |
c5aa993b | 4818 | } |
c906108c SS |
4819 | } |
4820 | ||
4821 | do_cleanups (old_chain); | |
4822 | } | |
4823 | ||
4824 | static void | |
fba45db2 | 4825 | variables_info (char *regexp, int from_tty) |
c906108c | 4826 | { |
176620f1 | 4827 | symtab_symbol_info (regexp, VARIABLES_DOMAIN, from_tty); |
c906108c SS |
4828 | } |
4829 | ||
4830 | static void | |
fba45db2 | 4831 | functions_info (char *regexp, int from_tty) |
c906108c | 4832 | { |
176620f1 | 4833 | symtab_symbol_info (regexp, FUNCTIONS_DOMAIN, from_tty); |
c906108c SS |
4834 | } |
4835 | ||
357e46e7 | 4836 | |
c906108c | 4837 | static void |
fba45db2 | 4838 | types_info (char *regexp, int from_tty) |
c906108c | 4839 | { |
176620f1 | 4840 | symtab_symbol_info (regexp, TYPES_DOMAIN, from_tty); |
c906108c SS |
4841 | } |
4842 | ||
c378eb4e | 4843 | /* Breakpoint all functions matching regular expression. */ |
8926118c | 4844 | |
8b93c638 | 4845 | void |
fba45db2 | 4846 | rbreak_command_wrapper (char *regexp, int from_tty) |
8b93c638 JM |
4847 | { |
4848 | rbreak_command (regexp, from_tty); | |
4849 | } | |
8926118c | 4850 | |
95a42b64 TT |
4851 | /* A cleanup function that calls end_rbreak_breakpoints. */ |
4852 | ||
4853 | static void | |
4854 | do_end_rbreak_breakpoints (void *ignore) | |
4855 | { | |
4856 | end_rbreak_breakpoints (); | |
4857 | } | |
4858 | ||
c906108c | 4859 | static void |
fba45db2 | 4860 | rbreak_command (char *regexp, int from_tty) |
c906108c SS |
4861 | { |
4862 | struct symbol_search *ss; | |
4863 | struct symbol_search *p; | |
4864 | struct cleanup *old_chain; | |
95a42b64 TT |
4865 | char *string = NULL; |
4866 | int len = 0; | |
96142726 TT |
4867 | const char **files = NULL; |
4868 | const char *file_name; | |
8bd10a10 | 4869 | int nfiles = 0; |
c906108c | 4870 | |
8bd10a10 CM |
4871 | if (regexp) |
4872 | { | |
4873 | char *colon = strchr (regexp, ':'); | |
433759f7 | 4874 | |
8bd10a10 CM |
4875 | if (colon && *(colon + 1) != ':') |
4876 | { | |
4877 | int colon_index; | |
96142726 | 4878 | char *local_name; |
8bd10a10 CM |
4879 | |
4880 | colon_index = colon - regexp; | |
224c3ddb | 4881 | local_name = (char *) alloca (colon_index + 1); |
96142726 TT |
4882 | memcpy (local_name, regexp, colon_index); |
4883 | local_name[colon_index--] = 0; | |
4884 | while (isspace (local_name[colon_index])) | |
4885 | local_name[colon_index--] = 0; | |
4886 | file_name = local_name; | |
8bd10a10 CM |
4887 | files = &file_name; |
4888 | nfiles = 1; | |
529480d0 | 4889 | regexp = skip_spaces (colon + 1); |
8bd10a10 CM |
4890 | } |
4891 | } | |
4892 | ||
4893 | search_symbols (regexp, FUNCTIONS_DOMAIN, nfiles, files, &ss); | |
b52109bc | 4894 | old_chain = make_cleanup_free_search_symbols (&ss); |
95a42b64 | 4895 | make_cleanup (free_current_contents, &string); |
c906108c | 4896 | |
95a42b64 TT |
4897 | start_rbreak_breakpoints (); |
4898 | make_cleanup (do_end_rbreak_breakpoints, NULL); | |
c906108c SS |
4899 | for (p = ss; p != NULL; p = p->next) |
4900 | { | |
7c7b6655 | 4901 | if (p->msymbol.minsym == NULL) |
c5aa993b | 4902 | { |
08be3fe3 | 4903 | struct symtab *symtab = symbol_symtab (p->symbol); |
d01060f0 | 4904 | const char *fullname = symtab_to_fullname (symtab); |
05cba821 JK |
4905 | |
4906 | int newlen = (strlen (fullname) | |
95a42b64 TT |
4907 | + strlen (SYMBOL_LINKAGE_NAME (p->symbol)) |
4908 | + 4); | |
433759f7 | 4909 | |
95a42b64 TT |
4910 | if (newlen > len) |
4911 | { | |
224c3ddb | 4912 | string = (char *) xrealloc (string, newlen); |
95a42b64 TT |
4913 | len = newlen; |
4914 | } | |
05cba821 | 4915 | strcpy (string, fullname); |
c5aa993b | 4916 | strcat (string, ":'"); |
2335f48e | 4917 | strcat (string, SYMBOL_LINKAGE_NAME (p->symbol)); |
c5aa993b JM |
4918 | strcat (string, "'"); |
4919 | break_command (string, from_tty); | |
176620f1 | 4920 | print_symbol_info (FUNCTIONS_DOMAIN, |
c5aa993b JM |
4921 | p->symbol, |
4922 | p->block, | |
d01060f0 | 4923 | symtab_to_filename_for_display (symtab)); |
c5aa993b | 4924 | } |
c906108c | 4925 | else |
c5aa993b | 4926 | { |
efd66ac6 | 4927 | int newlen = (strlen (MSYMBOL_LINKAGE_NAME (p->msymbol.minsym)) + 3); |
433759f7 | 4928 | |
95a42b64 TT |
4929 | if (newlen > len) |
4930 | { | |
224c3ddb | 4931 | string = (char *) xrealloc (string, newlen); |
95a42b64 TT |
4932 | len = newlen; |
4933 | } | |
6214f497 | 4934 | strcpy (string, "'"); |
efd66ac6 | 4935 | strcat (string, MSYMBOL_LINKAGE_NAME (p->msymbol.minsym)); |
6214f497 DJ |
4936 | strcat (string, "'"); |
4937 | ||
4938 | break_command (string, from_tty); | |
c5aa993b | 4939 | printf_filtered ("<function, no debug info> %s;\n", |
efd66ac6 | 4940 | MSYMBOL_PRINT_NAME (p->msymbol.minsym)); |
c5aa993b | 4941 | } |
c906108c SS |
4942 | } |
4943 | ||
4944 | do_cleanups (old_chain); | |
4945 | } | |
c906108c | 4946 | \f |
c5aa993b | 4947 | |
1976171a JK |
4948 | /* Evaluate if NAME matches SYM_TEXT and SYM_TEXT_LEN. |
4949 | ||
4950 | Either sym_text[sym_text_len] != '(' and then we search for any | |
4951 | symbol starting with SYM_TEXT text. | |
4952 | ||
4953 | Otherwise sym_text[sym_text_len] == '(' and then we require symbol name to | |
4954 | be terminated at that point. Partial symbol tables do not have parameters | |
4955 | information. */ | |
4956 | ||
4957 | static int | |
4958 | compare_symbol_name (const char *name, const char *sym_text, int sym_text_len) | |
4959 | { | |
4960 | int (*ncmp) (const char *, const char *, size_t); | |
4961 | ||
4962 | ncmp = (case_sensitivity == case_sensitive_on ? strncmp : strncasecmp); | |
4963 | ||
4964 | if (ncmp (name, sym_text, sym_text_len) != 0) | |
4965 | return 0; | |
4966 | ||
4967 | if (sym_text[sym_text_len] == '(') | |
4968 | { | |
4969 | /* User searches for `name(someth...'. Require NAME to be terminated. | |
4970 | Normally psymtabs and gdbindex have no parameter types so '\0' will be | |
4971 | present but accept even parameters presence. In this case this | |
4972 | function is in fact strcmp_iw but whitespace skipping is not supported | |
4973 | for tab completion. */ | |
4974 | ||
4975 | if (name[sym_text_len] != '\0' && name[sym_text_len] != '(') | |
4976 | return 0; | |
4977 | } | |
4978 | ||
4979 | return 1; | |
4980 | } | |
4981 | ||
821296b7 SA |
4982 | /* Free any memory associated with a completion list. */ |
4983 | ||
4984 | static void | |
49c4e619 | 4985 | free_completion_list (VEC (char_ptr) **list_ptr) |
821296b7 | 4986 | { |
49c4e619 TT |
4987 | int i; |
4988 | char *p; | |
821296b7 | 4989 | |
49c4e619 TT |
4990 | for (i = 0; VEC_iterate (char_ptr, *list_ptr, i, p); ++i) |
4991 | xfree (p); | |
4992 | VEC_free (char_ptr, *list_ptr); | |
821296b7 SA |
4993 | } |
4994 | ||
4995 | /* Callback for make_cleanup. */ | |
4996 | ||
4997 | static void | |
4998 | do_free_completion_list (void *list) | |
4999 | { | |
19ba03f4 | 5000 | free_completion_list ((VEC (char_ptr) **) list); |
821296b7 SA |
5001 | } |
5002 | ||
c906108c SS |
5003 | /* Helper routine for make_symbol_completion_list. */ |
5004 | ||
49c4e619 | 5005 | static VEC (char_ptr) *return_val; |
c906108c SS |
5006 | |
5007 | #define COMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \ | |
c906108c | 5008 | completion_list_add_name \ |
2335f48e | 5009 | (SYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word)) |
c906108c | 5010 | |
efd66ac6 TT |
5011 | #define MCOMPLETION_LIST_ADD_SYMBOL(symbol, sym_text, len, text, word) \ |
5012 | completion_list_add_name \ | |
5013 | (MSYMBOL_NATURAL_NAME (symbol), (sym_text), (len), (text), (word)) | |
5014 | ||
ef0b411a GB |
5015 | /* Tracker for how many unique completions have been generated. Used |
5016 | to terminate completion list generation early if the list has grown | |
5017 | to a size so large as to be useless. This helps avoid GDB seeming | |
5018 | to lock up in the event the user requests to complete on something | |
5019 | vague that necessitates the time consuming expansion of many symbol | |
5020 | tables. */ | |
5021 | ||
5022 | static completion_tracker_t completion_tracker; | |
5023 | ||
c906108c | 5024 | /* Test to see if the symbol specified by SYMNAME (which is already |
c5aa993b | 5025 | demangled for C++ symbols) matches SYM_TEXT in the first SYM_TEXT_LEN |
c378eb4e | 5026 | characters. If so, add it to the current completion list. */ |
c906108c SS |
5027 | |
5028 | static void | |
0d5cff50 DE |
5029 | completion_list_add_name (const char *symname, |
5030 | const char *sym_text, int sym_text_len, | |
5031 | const char *text, const char *word) | |
c906108c | 5032 | { |
c378eb4e | 5033 | /* Clip symbols that cannot match. */ |
1976171a JK |
5034 | if (!compare_symbol_name (symname, sym_text, sym_text_len)) |
5035 | return; | |
c906108c | 5036 | |
c906108c | 5037 | /* We have a match for a completion, so add SYMNAME to the current list |
c378eb4e | 5038 | of matches. Note that the name is moved to freshly malloc'd space. */ |
c906108c SS |
5039 | |
5040 | { | |
fe978cb0 | 5041 | char *newobj; |
ef0b411a | 5042 | enum maybe_add_completion_enum add_status; |
433759f7 | 5043 | |
c906108c SS |
5044 | if (word == sym_text) |
5045 | { | |
224c3ddb | 5046 | newobj = (char *) xmalloc (strlen (symname) + 5); |
fe978cb0 | 5047 | strcpy (newobj, symname); |
c906108c SS |
5048 | } |
5049 | else if (word > sym_text) | |
5050 | { | |
5051 | /* Return some portion of symname. */ | |
224c3ddb | 5052 | newobj = (char *) xmalloc (strlen (symname) + 5); |
fe978cb0 | 5053 | strcpy (newobj, symname + (word - sym_text)); |
c906108c SS |
5054 | } |
5055 | else | |
5056 | { | |
5057 | /* Return some of SYM_TEXT plus symname. */ | |
224c3ddb | 5058 | newobj = (char *) xmalloc (strlen (symname) + (sym_text - word) + 5); |
fe978cb0 PA |
5059 | strncpy (newobj, word, sym_text - word); |
5060 | newobj[sym_text - word] = '\0'; | |
5061 | strcat (newobj, symname); | |
c906108c SS |
5062 | } |
5063 | ||
fe978cb0 | 5064 | add_status = maybe_add_completion (completion_tracker, newobj); |
ef0b411a GB |
5065 | |
5066 | switch (add_status) | |
5067 | { | |
5068 | case MAYBE_ADD_COMPLETION_OK: | |
fe978cb0 | 5069 | VEC_safe_push (char_ptr, return_val, newobj); |
ef0b411a GB |
5070 | break; |
5071 | case MAYBE_ADD_COMPLETION_OK_MAX_REACHED: | |
fe978cb0 | 5072 | VEC_safe_push (char_ptr, return_val, newobj); |
ef0b411a GB |
5073 | throw_max_completions_reached_error (); |
5074 | case MAYBE_ADD_COMPLETION_MAX_REACHED: | |
fe978cb0 | 5075 | xfree (newobj); |
ef0b411a GB |
5076 | throw_max_completions_reached_error (); |
5077 | case MAYBE_ADD_COMPLETION_DUPLICATE: | |
fe978cb0 | 5078 | xfree (newobj); |
ef0b411a GB |
5079 | break; |
5080 | } | |
c906108c SS |
5081 | } |
5082 | } | |
5083 | ||
69636828 AF |
5084 | /* ObjC: In case we are completing on a selector, look as the msymbol |
5085 | again and feed all the selectors into the mill. */ | |
5086 | ||
5087 | static void | |
0d5cff50 DE |
5088 | completion_list_objc_symbol (struct minimal_symbol *msymbol, |
5089 | const char *sym_text, int sym_text_len, | |
5090 | const char *text, const char *word) | |
69636828 AF |
5091 | { |
5092 | static char *tmp = NULL; | |
5093 | static unsigned int tmplen = 0; | |
9af17804 | 5094 | |
0d5cff50 | 5095 | const char *method, *category, *selector; |
69636828 | 5096 | char *tmp2 = NULL; |
9af17804 | 5097 | |
efd66ac6 | 5098 | method = MSYMBOL_NATURAL_NAME (msymbol); |
69636828 AF |
5099 | |
5100 | /* Is it a method? */ | |
5101 | if ((method[0] != '-') && (method[0] != '+')) | |
5102 | return; | |
5103 | ||
5104 | if (sym_text[0] == '[') | |
5105 | /* Complete on shortened method method. */ | |
5106 | completion_list_add_name (method + 1, sym_text, sym_text_len, text, word); | |
9af17804 | 5107 | |
69636828 AF |
5108 | while ((strlen (method) + 1) >= tmplen) |
5109 | { | |
5110 | if (tmplen == 0) | |
5111 | tmplen = 1024; | |
5112 | else | |
5113 | tmplen *= 2; | |
224c3ddb | 5114 | tmp = (char *) xrealloc (tmp, tmplen); |
69636828 AF |
5115 | } |
5116 | selector = strchr (method, ' '); | |
5117 | if (selector != NULL) | |
5118 | selector++; | |
9af17804 | 5119 | |
69636828 | 5120 | category = strchr (method, '('); |
9af17804 | 5121 | |
69636828 AF |
5122 | if ((category != NULL) && (selector != NULL)) |
5123 | { | |
5124 | memcpy (tmp, method, (category - method)); | |
5125 | tmp[category - method] = ' '; | |
5126 | memcpy (tmp + (category - method) + 1, selector, strlen (selector) + 1); | |
5127 | completion_list_add_name (tmp, sym_text, sym_text_len, text, word); | |
5128 | if (sym_text[0] == '[') | |
5129 | completion_list_add_name (tmp + 1, sym_text, sym_text_len, text, word); | |
5130 | } | |
9af17804 | 5131 | |
69636828 AF |
5132 | if (selector != NULL) |
5133 | { | |
5134 | /* Complete on selector only. */ | |
5135 | strcpy (tmp, selector); | |
5136 | tmp2 = strchr (tmp, ']'); | |
5137 | if (tmp2 != NULL) | |
5138 | *tmp2 = '\0'; | |
9af17804 | 5139 | |
69636828 AF |
5140 | completion_list_add_name (tmp, sym_text, sym_text_len, text, word); |
5141 | } | |
5142 | } | |
5143 | ||
5144 | /* Break the non-quoted text based on the characters which are in | |
c378eb4e | 5145 | symbols. FIXME: This should probably be language-specific. */ |
69636828 | 5146 | |
6f937416 PA |
5147 | static const char * |
5148 | language_search_unquoted_string (const char *text, const char *p) | |
69636828 AF |
5149 | { |
5150 | for (; p > text; --p) | |
5151 | { | |
5152 | if (isalnum (p[-1]) || p[-1] == '_' || p[-1] == '\0') | |
5153 | continue; | |
5154 | else | |
5155 | { | |
5156 | if ((current_language->la_language == language_objc)) | |
5157 | { | |
c378eb4e | 5158 | if (p[-1] == ':') /* Might be part of a method name. */ |
69636828 AF |
5159 | continue; |
5160 | else if (p[-1] == '[' && (p[-2] == '-' || p[-2] == '+')) | |
c378eb4e | 5161 | p -= 2; /* Beginning of a method name. */ |
69636828 | 5162 | else if (p[-1] == ' ' || p[-1] == '(' || p[-1] == ')') |
c378eb4e | 5163 | { /* Might be part of a method name. */ |
6f937416 | 5164 | const char *t = p; |
69636828 AF |
5165 | |
5166 | /* Seeing a ' ' or a '(' is not conclusive evidence | |
5167 | that we are in the middle of a method name. However, | |
5168 | finding "-[" or "+[" should be pretty un-ambiguous. | |
5169 | Unfortunately we have to find it now to decide. */ | |
5170 | ||
5171 | while (t > text) | |
5172 | if (isalnum (t[-1]) || t[-1] == '_' || | |
5173 | t[-1] == ' ' || t[-1] == ':' || | |
5174 | t[-1] == '(' || t[-1] == ')') | |
5175 | --t; | |
5176 | else | |
5177 | break; | |
5178 | ||
5179 | if (t[-1] == '[' && (t[-2] == '-' || t[-2] == '+')) | |
c378eb4e MS |
5180 | p = t - 2; /* Method name detected. */ |
5181 | /* Else we leave with p unchanged. */ | |
69636828 AF |
5182 | } |
5183 | } | |
5184 | break; | |
5185 | } | |
5186 | } | |
5187 | return p; | |
5188 | } | |
5189 | ||
edb3359d | 5190 | static void |
6f937416 PA |
5191 | completion_list_add_fields (struct symbol *sym, const char *sym_text, |
5192 | int sym_text_len, const char *text, | |
5193 | const char *word) | |
edb3359d DJ |
5194 | { |
5195 | if (SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
5196 | { | |
5197 | struct type *t = SYMBOL_TYPE (sym); | |
5198 | enum type_code c = TYPE_CODE (t); | |
5199 | int j; | |
5200 | ||
5201 | if (c == TYPE_CODE_UNION || c == TYPE_CODE_STRUCT) | |
5202 | for (j = TYPE_N_BASECLASSES (t); j < TYPE_NFIELDS (t); j++) | |
5203 | if (TYPE_FIELD_NAME (t, j)) | |
5204 | completion_list_add_name (TYPE_FIELD_NAME (t, j), | |
5205 | sym_text, sym_text_len, text, word); | |
5206 | } | |
5207 | } | |
5208 | ||
e11c72c7 GB |
5209 | /* Type of the user_data argument passed to add_macro_name, |
5210 | symbol_completion_matcher and symtab_expansion_callback. */ | |
5211 | ||
ccefe4c4 | 5212 | struct add_name_data |
9a044a89 | 5213 | { |
e11c72c7 | 5214 | /* Arguments required by completion_list_add_name. */ |
6f937416 | 5215 | const char *sym_text; |
9a044a89 | 5216 | int sym_text_len; |
6f937416 PA |
5217 | const char *text; |
5218 | const char *word; | |
e11c72c7 GB |
5219 | |
5220 | /* Extra argument required for add_symtab_completions. */ | |
5221 | enum type_code code; | |
9a044a89 TT |
5222 | }; |
5223 | ||
5224 | /* A callback used with macro_for_each and macro_for_each_in_scope. | |
5225 | This adds a macro's name to the current completion list. */ | |
eca864fe | 5226 | |
9a044a89 TT |
5227 | static void |
5228 | add_macro_name (const char *name, const struct macro_definition *ignore, | |
9b158ba0 | 5229 | struct macro_source_file *ignore2, int ignore3, |
9a044a89 TT |
5230 | void *user_data) |
5231 | { | |
ccefe4c4 | 5232 | struct add_name_data *datum = (struct add_name_data *) user_data; |
433759f7 | 5233 | |
ac1a991b | 5234 | completion_list_add_name (name, |
ccefe4c4 TT |
5235 | datum->sym_text, datum->sym_text_len, |
5236 | datum->text, datum->word); | |
5237 | } | |
5238 | ||
bb4142cf | 5239 | /* A callback for expand_symtabs_matching. */ |
eca864fe | 5240 | |
7b08b9eb | 5241 | static int |
bb4142cf | 5242 | symbol_completion_matcher (const char *name, void *user_data) |
ccefe4c4 TT |
5243 | { |
5244 | struct add_name_data *datum = (struct add_name_data *) user_data; | |
165195f4 | 5245 | |
1976171a | 5246 | return compare_symbol_name (name, datum->sym_text, datum->sym_text_len); |
9a044a89 TT |
5247 | } |
5248 | ||
e11c72c7 GB |
5249 | /* Add matching symbols from SYMTAB to the current completion list. */ |
5250 | ||
5251 | static void | |
5252 | add_symtab_completions (struct compunit_symtab *cust, | |
5253 | const char *sym_text, int sym_text_len, | |
5254 | const char *text, const char *word, | |
5255 | enum type_code code) | |
5256 | { | |
5257 | struct symbol *sym; | |
5258 | const struct block *b; | |
5259 | struct block_iterator iter; | |
5260 | int i; | |
5261 | ||
5262 | for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++) | |
5263 | { | |
5264 | QUIT; | |
5265 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cust), i); | |
5266 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
5267 | { | |
5268 | if (code == TYPE_CODE_UNDEF | |
5269 | || (SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN | |
5270 | && TYPE_CODE (SYMBOL_TYPE (sym)) == code)) | |
5271 | COMPLETION_LIST_ADD_SYMBOL (sym, | |
5272 | sym_text, sym_text_len, | |
5273 | text, word); | |
5274 | } | |
5275 | } | |
5276 | } | |
5277 | ||
5278 | /* Callback to add completions to the current list when symbol tables | |
5279 | are expanded during completion list generation. */ | |
5280 | ||
5281 | static void | |
5282 | symtab_expansion_callback (struct compunit_symtab *symtab, | |
5283 | void *user_data) | |
5284 | { | |
5285 | struct add_name_data *datum = (struct add_name_data *) user_data; | |
5286 | ||
5287 | add_symtab_completions (symtab, | |
5288 | datum->sym_text, datum->sym_text_len, | |
5289 | datum->text, datum->word, | |
5290 | datum->code); | |
5291 | } | |
5292 | ||
ef0b411a GB |
5293 | static void |
5294 | default_make_symbol_completion_list_break_on_1 (const char *text, | |
5295 | const char *word, | |
5296 | const char *break_on, | |
5297 | enum type_code code) | |
c906108c | 5298 | { |
41d27058 JB |
5299 | /* Problem: All of the symbols have to be copied because readline |
5300 | frees them. I'm not going to worry about this; hopefully there | |
5301 | won't be that many. */ | |
5302 | ||
de4f826b | 5303 | struct symbol *sym; |
43f3e411 | 5304 | struct compunit_symtab *cust; |
de4f826b DC |
5305 | struct minimal_symbol *msymbol; |
5306 | struct objfile *objfile; | |
3977b71f | 5307 | const struct block *b; |
edb3359d | 5308 | const struct block *surrounding_static_block, *surrounding_global_block; |
8157b174 | 5309 | struct block_iterator iter; |
c906108c | 5310 | /* The symbol we are completing on. Points in same buffer as text. */ |
6f937416 | 5311 | const char *sym_text; |
c906108c SS |
5312 | /* Length of sym_text. */ |
5313 | int sym_text_len; | |
ccefe4c4 | 5314 | struct add_name_data datum; |
ef0b411a | 5315 | struct cleanup *cleanups; |
c906108c | 5316 | |
41d27058 | 5317 | /* Now look for the symbol we are supposed to complete on. */ |
c906108c | 5318 | { |
6f937416 | 5319 | const char *p; |
c906108c | 5320 | char quote_found; |
6f937416 | 5321 | const char *quote_pos = NULL; |
c906108c SS |
5322 | |
5323 | /* First see if this is a quoted string. */ | |
5324 | quote_found = '\0'; | |
5325 | for (p = text; *p != '\0'; ++p) | |
5326 | { | |
5327 | if (quote_found != '\0') | |
5328 | { | |
5329 | if (*p == quote_found) | |
5330 | /* Found close quote. */ | |
5331 | quote_found = '\0'; | |
5332 | else if (*p == '\\' && p[1] == quote_found) | |
5333 | /* A backslash followed by the quote character | |
c5aa993b | 5334 | doesn't end the string. */ |
c906108c SS |
5335 | ++p; |
5336 | } | |
5337 | else if (*p == '\'' || *p == '"') | |
5338 | { | |
5339 | quote_found = *p; | |
5340 | quote_pos = p; | |
5341 | } | |
5342 | } | |
5343 | if (quote_found == '\'') | |
5344 | /* A string within single quotes can be a symbol, so complete on it. */ | |
5345 | sym_text = quote_pos + 1; | |
5346 | else if (quote_found == '"') | |
5347 | /* A double-quoted string is never a symbol, nor does it make sense | |
c5aa993b | 5348 | to complete it any other way. */ |
c94fdfd0 | 5349 | { |
ef0b411a | 5350 | return; |
c94fdfd0 | 5351 | } |
c906108c SS |
5352 | else |
5353 | { | |
5354 | /* It is not a quoted string. Break it based on the characters | |
5355 | which are in symbols. */ | |
5356 | while (p > text) | |
5357 | { | |
95699ff0 | 5358 | if (isalnum (p[-1]) || p[-1] == '_' || p[-1] == '\0' |
f55ee35c | 5359 | || p[-1] == ':' || strchr (break_on, p[-1]) != NULL) |
c906108c SS |
5360 | --p; |
5361 | else | |
5362 | break; | |
5363 | } | |
5364 | sym_text = p; | |
5365 | } | |
5366 | } | |
5367 | ||
5368 | sym_text_len = strlen (sym_text); | |
5369 | ||
1976171a JK |
5370 | /* Prepare SYM_TEXT_LEN for compare_symbol_name. */ |
5371 | ||
5372 | if (current_language->la_language == language_cplus | |
5373 | || current_language->la_language == language_java | |
5374 | || current_language->la_language == language_fortran) | |
5375 | { | |
5376 | /* These languages may have parameters entered by user but they are never | |
5377 | present in the partial symbol tables. */ | |
5378 | ||
585a269a | 5379 | const char *cs = (const char *) memchr (sym_text, '(', sym_text_len); |
1976171a JK |
5380 | |
5381 | if (cs) | |
5382 | sym_text_len = cs - sym_text; | |
5383 | } | |
5384 | gdb_assert (sym_text[sym_text_len] == '\0' || sym_text[sym_text_len] == '('); | |
5385 | ||
ef0b411a GB |
5386 | completion_tracker = new_completion_tracker (); |
5387 | cleanups = make_cleanup_free_completion_tracker (&completion_tracker); | |
c906108c | 5388 | |
ccefe4c4 TT |
5389 | datum.sym_text = sym_text; |
5390 | datum.sym_text_len = sym_text_len; | |
5391 | datum.text = text; | |
5392 | datum.word = word; | |
e11c72c7 | 5393 | datum.code = code; |
c906108c SS |
5394 | |
5395 | /* At this point scan through the misc symbol vectors and add each | |
5396 | symbol you find to the list. Eventually we want to ignore | |
5397 | anything that isn't a text symbol (everything else will be | |
e11c72c7 | 5398 | handled by the psymtab code below). */ |
c906108c | 5399 | |
2f68a895 TT |
5400 | if (code == TYPE_CODE_UNDEF) |
5401 | { | |
5402 | ALL_MSYMBOLS (objfile, msymbol) | |
5403 | { | |
5404 | QUIT; | |
efd66ac6 TT |
5405 | MCOMPLETION_LIST_ADD_SYMBOL (msymbol, sym_text, sym_text_len, text, |
5406 | word); | |
9af17804 | 5407 | |
2f68a895 TT |
5408 | completion_list_objc_symbol (msymbol, sym_text, sym_text_len, text, |
5409 | word); | |
5410 | } | |
5411 | } | |
c906108c | 5412 | |
e11c72c7 GB |
5413 | /* Add completions for all currently loaded symbol tables. */ |
5414 | ALL_COMPUNITS (objfile, cust) | |
5415 | add_symtab_completions (cust, sym_text, sym_text_len, text, word, | |
5416 | code); | |
5417 | ||
5418 | /* Look through the partial symtabs for all symbols which begin | |
5419 | by matching SYM_TEXT. Expand all CUs that you find to the list. | |
5420 | symtab_expansion_callback is called for each expanded symtab, | |
5421 | causing those symtab's completions to be added to the list too. */ | |
5422 | expand_symtabs_matching (NULL, symbol_completion_matcher, | |
5423 | symtab_expansion_callback, ALL_DOMAIN, | |
5424 | &datum); | |
5425 | ||
c906108c | 5426 | /* Search upwards from currently selected frame (so that we can |
edb3359d DJ |
5427 | complete on local vars). Also catch fields of types defined in |
5428 | this places which match our text string. Only complete on types | |
c378eb4e | 5429 | visible from current context. */ |
edb3359d DJ |
5430 | |
5431 | b = get_selected_block (0); | |
5432 | surrounding_static_block = block_static_block (b); | |
5433 | surrounding_global_block = block_global_block (b); | |
5434 | if (surrounding_static_block != NULL) | |
5435 | while (b != surrounding_static_block) | |
5436 | { | |
5437 | QUIT; | |
c906108c | 5438 | |
edb3359d DJ |
5439 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
5440 | { | |
2f68a895 TT |
5441 | if (code == TYPE_CODE_UNDEF) |
5442 | { | |
5443 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, | |
5444 | word); | |
5445 | completion_list_add_fields (sym, sym_text, sym_text_len, text, | |
5446 | word); | |
5447 | } | |
5448 | else if (SYMBOL_DOMAIN (sym) == STRUCT_DOMAIN | |
5449 | && TYPE_CODE (SYMBOL_TYPE (sym)) == code) | |
5450 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, | |
5451 | word); | |
edb3359d | 5452 | } |
c5aa993b | 5453 | |
edb3359d DJ |
5454 | /* Stop when we encounter an enclosing function. Do not stop for |
5455 | non-inlined functions - the locals of the enclosing function | |
5456 | are in scope for a nested function. */ | |
5457 | if (BLOCK_FUNCTION (b) != NULL && block_inlined_p (b)) | |
5458 | break; | |
5459 | b = BLOCK_SUPERBLOCK (b); | |
5460 | } | |
c906108c | 5461 | |
edb3359d | 5462 | /* Add fields from the file's types; symbols will be added below. */ |
c906108c | 5463 | |
2f68a895 TT |
5464 | if (code == TYPE_CODE_UNDEF) |
5465 | { | |
5466 | if (surrounding_static_block != NULL) | |
5467 | ALL_BLOCK_SYMBOLS (surrounding_static_block, iter, sym) | |
5468 | completion_list_add_fields (sym, sym_text, sym_text_len, text, word); | |
edb3359d | 5469 | |
2f68a895 TT |
5470 | if (surrounding_global_block != NULL) |
5471 | ALL_BLOCK_SYMBOLS (surrounding_global_block, iter, sym) | |
5472 | completion_list_add_fields (sym, sym_text, sym_text_len, text, word); | |
5473 | } | |
c906108c | 5474 | |
2f68a895 TT |
5475 | /* Skip macros if we are completing a struct tag -- arguable but |
5476 | usually what is expected. */ | |
5477 | if (current_language->la_macro_expansion == macro_expansion_c | |
5478 | && code == TYPE_CODE_UNDEF) | |
9a044a89 TT |
5479 | { |
5480 | struct macro_scope *scope; | |
9a044a89 TT |
5481 | |
5482 | /* Add any macros visible in the default scope. Note that this | |
5483 | may yield the occasional wrong result, because an expression | |
5484 | might be evaluated in a scope other than the default. For | |
5485 | example, if the user types "break file:line if <TAB>", the | |
5486 | resulting expression will be evaluated at "file:line" -- but | |
5487 | at there does not seem to be a way to detect this at | |
5488 | completion time. */ | |
5489 | scope = default_macro_scope (); | |
5490 | if (scope) | |
5491 | { | |
5492 | macro_for_each_in_scope (scope->file, scope->line, | |
5493 | add_macro_name, &datum); | |
5494 | xfree (scope); | |
5495 | } | |
5496 | ||
5497 | /* User-defined macros are always visible. */ | |
5498 | macro_for_each (macro_user_macros, add_macro_name, &datum); | |
5499 | } | |
5500 | ||
ef0b411a GB |
5501 | do_cleanups (cleanups); |
5502 | } | |
5503 | ||
5504 | VEC (char_ptr) * | |
5505 | default_make_symbol_completion_list_break_on (const char *text, | |
5506 | const char *word, | |
5507 | const char *break_on, | |
5508 | enum type_code code) | |
5509 | { | |
5510 | struct cleanup *back_to; | |
ef0b411a GB |
5511 | |
5512 | return_val = NULL; | |
5513 | back_to = make_cleanup (do_free_completion_list, &return_val); | |
5514 | ||
492d29ea | 5515 | TRY |
ef0b411a GB |
5516 | { |
5517 | default_make_symbol_completion_list_break_on_1 (text, word, | |
5518 | break_on, code); | |
5519 | } | |
492d29ea | 5520 | CATCH (except, RETURN_MASK_ERROR) |
ef0b411a GB |
5521 | { |
5522 | if (except.error != MAX_COMPLETIONS_REACHED_ERROR) | |
5523 | throw_exception (except); | |
5524 | } | |
492d29ea | 5525 | END_CATCH |
ef0b411a | 5526 | |
821296b7 | 5527 | discard_cleanups (back_to); |
ef0b411a | 5528 | return return_val; |
c906108c SS |
5529 | } |
5530 | ||
49c4e619 | 5531 | VEC (char_ptr) * |
6f937416 | 5532 | default_make_symbol_completion_list (const char *text, const char *word, |
2f68a895 | 5533 | enum type_code code) |
f55ee35c | 5534 | { |
2f68a895 | 5535 | return default_make_symbol_completion_list_break_on (text, word, "", code); |
f55ee35c JK |
5536 | } |
5537 | ||
49c4e619 TT |
5538 | /* Return a vector of all symbols (regardless of class) which begin by |
5539 | matching TEXT. If the answer is no symbols, then the return value | |
5540 | is NULL. */ | |
41d27058 | 5541 | |
49c4e619 | 5542 | VEC (char_ptr) * |
6f937416 | 5543 | make_symbol_completion_list (const char *text, const char *word) |
41d27058 | 5544 | { |
2f68a895 TT |
5545 | return current_language->la_make_symbol_completion_list (text, word, |
5546 | TYPE_CODE_UNDEF); | |
5547 | } | |
5548 | ||
5549 | /* Like make_symbol_completion_list, but only return STRUCT_DOMAIN | |
5550 | symbols whose type code is CODE. */ | |
5551 | ||
5552 | VEC (char_ptr) * | |
6f937416 PA |
5553 | make_symbol_completion_type (const char *text, const char *word, |
5554 | enum type_code code) | |
2f68a895 TT |
5555 | { |
5556 | gdb_assert (code == TYPE_CODE_UNION | |
5557 | || code == TYPE_CODE_STRUCT | |
2f68a895 TT |
5558 | || code == TYPE_CODE_ENUM); |
5559 | return current_language->la_make_symbol_completion_list (text, word, code); | |
41d27058 JB |
5560 | } |
5561 | ||
d8906c6f TJB |
5562 | /* Like make_symbol_completion_list, but suitable for use as a |
5563 | completion function. */ | |
5564 | ||
49c4e619 | 5565 | VEC (char_ptr) * |
d8906c6f | 5566 | make_symbol_completion_list_fn (struct cmd_list_element *ignore, |
6f937416 | 5567 | const char *text, const char *word) |
d8906c6f TJB |
5568 | { |
5569 | return make_symbol_completion_list (text, word); | |
5570 | } | |
5571 | ||
c94fdfd0 EZ |
5572 | /* Like make_symbol_completion_list, but returns a list of symbols |
5573 | defined in a source file FILE. */ | |
5574 | ||
e27852be DE |
5575 | static VEC (char_ptr) * |
5576 | make_file_symbol_completion_list_1 (const char *text, const char *word, | |
5577 | const char *srcfile) | |
c94fdfd0 | 5578 | { |
52f0bd74 AC |
5579 | struct symbol *sym; |
5580 | struct symtab *s; | |
5581 | struct block *b; | |
8157b174 | 5582 | struct block_iterator iter; |
c94fdfd0 | 5583 | /* The symbol we are completing on. Points in same buffer as text. */ |
6f937416 | 5584 | const char *sym_text; |
c94fdfd0 EZ |
5585 | /* Length of sym_text. */ |
5586 | int sym_text_len; | |
5587 | ||
5588 | /* Now look for the symbol we are supposed to complete on. | |
5589 | FIXME: This should be language-specific. */ | |
5590 | { | |
6f937416 | 5591 | const char *p; |
c94fdfd0 | 5592 | char quote_found; |
6f937416 | 5593 | const char *quote_pos = NULL; |
c94fdfd0 EZ |
5594 | |
5595 | /* First see if this is a quoted string. */ | |
5596 | quote_found = '\0'; | |
5597 | for (p = text; *p != '\0'; ++p) | |
5598 | { | |
5599 | if (quote_found != '\0') | |
5600 | { | |
5601 | if (*p == quote_found) | |
5602 | /* Found close quote. */ | |
5603 | quote_found = '\0'; | |
5604 | else if (*p == '\\' && p[1] == quote_found) | |
5605 | /* A backslash followed by the quote character | |
5606 | doesn't end the string. */ | |
5607 | ++p; | |
5608 | } | |
5609 | else if (*p == '\'' || *p == '"') | |
5610 | { | |
5611 | quote_found = *p; | |
5612 | quote_pos = p; | |
5613 | } | |
5614 | } | |
5615 | if (quote_found == '\'') | |
5616 | /* A string within single quotes can be a symbol, so complete on it. */ | |
5617 | sym_text = quote_pos + 1; | |
5618 | else if (quote_found == '"') | |
5619 | /* A double-quoted string is never a symbol, nor does it make sense | |
5620 | to complete it any other way. */ | |
5621 | { | |
49c4e619 | 5622 | return NULL; |
c94fdfd0 EZ |
5623 | } |
5624 | else | |
5625 | { | |
69636828 AF |
5626 | /* Not a quoted string. */ |
5627 | sym_text = language_search_unquoted_string (text, p); | |
c94fdfd0 EZ |
5628 | } |
5629 | } | |
5630 | ||
5631 | sym_text_len = strlen (sym_text); | |
5632 | ||
c94fdfd0 EZ |
5633 | /* Find the symtab for SRCFILE (this loads it if it was not yet read |
5634 | in). */ | |
5635 | s = lookup_symtab (srcfile); | |
5636 | if (s == NULL) | |
5637 | { | |
5638 | /* Maybe they typed the file with leading directories, while the | |
5639 | symbol tables record only its basename. */ | |
31889e00 | 5640 | const char *tail = lbasename (srcfile); |
c94fdfd0 EZ |
5641 | |
5642 | if (tail > srcfile) | |
5643 | s = lookup_symtab (tail); | |
5644 | } | |
5645 | ||
5646 | /* If we have no symtab for that file, return an empty list. */ | |
5647 | if (s == NULL) | |
5648 | return (return_val); | |
5649 | ||
5650 | /* Go through this symtab and check the externs and statics for | |
5651 | symbols which match. */ | |
5652 | ||
439247b6 | 5653 | b = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (s), GLOBAL_BLOCK); |
de4f826b | 5654 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c94fdfd0 | 5655 | { |
c94fdfd0 EZ |
5656 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
5657 | } | |
5658 | ||
439247b6 | 5659 | b = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (s), STATIC_BLOCK); |
de4f826b | 5660 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
c94fdfd0 | 5661 | { |
c94fdfd0 EZ |
5662 | COMPLETION_LIST_ADD_SYMBOL (sym, sym_text, sym_text_len, text, word); |
5663 | } | |
5664 | ||
5665 | return (return_val); | |
5666 | } | |
5667 | ||
e27852be DE |
5668 | /* Wrapper around make_file_symbol_completion_list_1 |
5669 | to handle MAX_COMPLETIONS_REACHED_ERROR. */ | |
5670 | ||
5671 | VEC (char_ptr) * | |
5672 | make_file_symbol_completion_list (const char *text, const char *word, | |
5673 | const char *srcfile) | |
5674 | { | |
5675 | struct cleanup *back_to, *cleanups; | |
5676 | ||
5677 | completion_tracker = new_completion_tracker (); | |
5678 | cleanups = make_cleanup_free_completion_tracker (&completion_tracker); | |
5679 | return_val = NULL; | |
5680 | back_to = make_cleanup (do_free_completion_list, &return_val); | |
5681 | ||
5682 | TRY | |
5683 | { | |
5684 | make_file_symbol_completion_list_1 (text, word, srcfile); | |
5685 | } | |
5686 | CATCH (except, RETURN_MASK_ERROR) | |
5687 | { | |
5688 | if (except.error != MAX_COMPLETIONS_REACHED_ERROR) | |
5689 | throw_exception (except); | |
5690 | } | |
5691 | END_CATCH | |
5692 | ||
5693 | discard_cleanups (back_to); | |
5694 | do_cleanups (cleanups); | |
5695 | return return_val; | |
5696 | } | |
5697 | ||
c94fdfd0 EZ |
5698 | /* A helper function for make_source_files_completion_list. It adds |
5699 | another file name to a list of possible completions, growing the | |
5700 | list as necessary. */ | |
5701 | ||
5702 | static void | |
6f937416 | 5703 | add_filename_to_list (const char *fname, const char *text, const char *word, |
49c4e619 | 5704 | VEC (char_ptr) **list) |
c94fdfd0 | 5705 | { |
fe978cb0 | 5706 | char *newobj; |
c94fdfd0 EZ |
5707 | size_t fnlen = strlen (fname); |
5708 | ||
c94fdfd0 EZ |
5709 | if (word == text) |
5710 | { | |
5711 | /* Return exactly fname. */ | |
224c3ddb | 5712 | newobj = (char *) xmalloc (fnlen + 5); |
fe978cb0 | 5713 | strcpy (newobj, fname); |
c94fdfd0 EZ |
5714 | } |
5715 | else if (word > text) | |
5716 | { | |
5717 | /* Return some portion of fname. */ | |
224c3ddb | 5718 | newobj = (char *) xmalloc (fnlen + 5); |
fe978cb0 | 5719 | strcpy (newobj, fname + (word - text)); |
c94fdfd0 EZ |
5720 | } |
5721 | else | |
5722 | { | |
5723 | /* Return some of TEXT plus fname. */ | |
224c3ddb | 5724 | newobj = (char *) xmalloc (fnlen + (text - word) + 5); |
fe978cb0 PA |
5725 | strncpy (newobj, word, text - word); |
5726 | newobj[text - word] = '\0'; | |
5727 | strcat (newobj, fname); | |
c94fdfd0 | 5728 | } |
fe978cb0 | 5729 | VEC_safe_push (char_ptr, *list, newobj); |
c94fdfd0 EZ |
5730 | } |
5731 | ||
5732 | static int | |
5733 | not_interesting_fname (const char *fname) | |
5734 | { | |
5735 | static const char *illegal_aliens[] = { | |
5736 | "_globals_", /* inserted by coff_symtab_read */ | |
5737 | NULL | |
5738 | }; | |
5739 | int i; | |
5740 | ||
5741 | for (i = 0; illegal_aliens[i]; i++) | |
5742 | { | |
0ba1096a | 5743 | if (filename_cmp (fname, illegal_aliens[i]) == 0) |
c94fdfd0 EZ |
5744 | return 1; |
5745 | } | |
5746 | return 0; | |
5747 | } | |
5748 | ||
ccefe4c4 TT |
5749 | /* An object of this type is passed as the user_data argument to |
5750 | map_partial_symbol_filenames. */ | |
5751 | struct add_partial_filename_data | |
5752 | { | |
9fdc877b | 5753 | struct filename_seen_cache *filename_seen_cache; |
6f937416 PA |
5754 | const char *text; |
5755 | const char *word; | |
ccefe4c4 | 5756 | int text_len; |
49c4e619 | 5757 | VEC (char_ptr) **list; |
ccefe4c4 TT |
5758 | }; |
5759 | ||
5760 | /* A callback for map_partial_symbol_filenames. */ | |
eca864fe | 5761 | |
ccefe4c4 | 5762 | static void |
2837d59e | 5763 | maybe_add_partial_symtab_filename (const char *filename, const char *fullname, |
ccefe4c4 TT |
5764 | void *user_data) |
5765 | { | |
19ba03f4 SM |
5766 | struct add_partial_filename_data *data |
5767 | = (struct add_partial_filename_data *) user_data; | |
ccefe4c4 TT |
5768 | |
5769 | if (not_interesting_fname (filename)) | |
5770 | return; | |
9fdc877b | 5771 | if (!filename_seen (data->filename_seen_cache, filename, 1) |
0ba1096a | 5772 | && filename_ncmp (filename, data->text, data->text_len) == 0) |
ccefe4c4 TT |
5773 | { |
5774 | /* This file matches for a completion; add it to the | |
5775 | current list of matches. */ | |
49c4e619 | 5776 | add_filename_to_list (filename, data->text, data->word, data->list); |
ccefe4c4 TT |
5777 | } |
5778 | else | |
5779 | { | |
5780 | const char *base_name = lbasename (filename); | |
433759f7 | 5781 | |
ccefe4c4 | 5782 | if (base_name != filename |
9fdc877b | 5783 | && !filename_seen (data->filename_seen_cache, base_name, 1) |
0ba1096a | 5784 | && filename_ncmp (base_name, data->text, data->text_len) == 0) |
49c4e619 | 5785 | add_filename_to_list (base_name, data->text, data->word, data->list); |
ccefe4c4 TT |
5786 | } |
5787 | } | |
5788 | ||
49c4e619 TT |
5789 | /* Return a vector of all source files whose names begin with matching |
5790 | TEXT. The file names are looked up in the symbol tables of this | |
5791 | program. If the answer is no matchess, then the return value is | |
5792 | NULL. */ | |
c94fdfd0 | 5793 | |
49c4e619 | 5794 | VEC (char_ptr) * |
6f937416 | 5795 | make_source_files_completion_list (const char *text, const char *word) |
c94fdfd0 | 5796 | { |
43f3e411 | 5797 | struct compunit_symtab *cu; |
52f0bd74 | 5798 | struct symtab *s; |
52f0bd74 | 5799 | struct objfile *objfile; |
c94fdfd0 | 5800 | size_t text_len = strlen (text); |
49c4e619 | 5801 | VEC (char_ptr) *list = NULL; |
31889e00 | 5802 | const char *base_name; |
ccefe4c4 | 5803 | struct add_partial_filename_data datum; |
9fdc877b DE |
5804 | struct filename_seen_cache *filename_seen_cache; |
5805 | struct cleanup *back_to, *cache_cleanup; | |
c94fdfd0 | 5806 | |
c94fdfd0 EZ |
5807 | if (!have_full_symbols () && !have_partial_symbols ()) |
5808 | return list; | |
5809 | ||
821296b7 SA |
5810 | back_to = make_cleanup (do_free_completion_list, &list); |
5811 | ||
9fdc877b DE |
5812 | filename_seen_cache = create_filename_seen_cache (); |
5813 | cache_cleanup = make_cleanup (delete_filename_seen_cache, | |
5814 | filename_seen_cache); | |
5815 | ||
43f3e411 | 5816 | ALL_FILETABS (objfile, cu, s) |
c94fdfd0 EZ |
5817 | { |
5818 | if (not_interesting_fname (s->filename)) | |
5819 | continue; | |
9fdc877b | 5820 | if (!filename_seen (filename_seen_cache, s->filename, 1) |
0ba1096a | 5821 | && filename_ncmp (s->filename, text, text_len) == 0) |
c94fdfd0 EZ |
5822 | { |
5823 | /* This file matches for a completion; add it to the current | |
5824 | list of matches. */ | |
49c4e619 | 5825 | add_filename_to_list (s->filename, text, word, &list); |
c94fdfd0 EZ |
5826 | } |
5827 | else | |
5828 | { | |
5829 | /* NOTE: We allow the user to type a base name when the | |
5830 | debug info records leading directories, but not the other | |
5831 | way around. This is what subroutines of breakpoint | |
5832 | command do when they parse file names. */ | |
31889e00 | 5833 | base_name = lbasename (s->filename); |
c94fdfd0 | 5834 | if (base_name != s->filename |
9fdc877b | 5835 | && !filename_seen (filename_seen_cache, base_name, 1) |
0ba1096a | 5836 | && filename_ncmp (base_name, text, text_len) == 0) |
49c4e619 | 5837 | add_filename_to_list (base_name, text, word, &list); |
c94fdfd0 EZ |
5838 | } |
5839 | } | |
5840 | ||
9fdc877b | 5841 | datum.filename_seen_cache = filename_seen_cache; |
ccefe4c4 TT |
5842 | datum.text = text; |
5843 | datum.word = word; | |
5844 | datum.text_len = text_len; | |
5845 | datum.list = &list; | |
bb4142cf DE |
5846 | map_symbol_filenames (maybe_add_partial_symtab_filename, &datum, |
5847 | 0 /*need_fullname*/); | |
9fdc877b DE |
5848 | |
5849 | do_cleanups (cache_cleanup); | |
821296b7 | 5850 | discard_cleanups (back_to); |
c94fdfd0 EZ |
5851 | |
5852 | return list; | |
5853 | } | |
c906108c | 5854 | \f |
51cc5b07 | 5855 | /* Track MAIN */ |
32ac0d11 TT |
5856 | |
5857 | /* Return the "main_info" object for the current program space. If | |
5858 | the object has not yet been created, create it and fill in some | |
5859 | default values. */ | |
5860 | ||
5861 | static struct main_info * | |
5862 | get_main_info (void) | |
5863 | { | |
19ba03f4 SM |
5864 | struct main_info *info |
5865 | = (struct main_info *) program_space_data (current_program_space, | |
32ac0d11 TT |
5866 | main_progspace_key); |
5867 | ||
5868 | if (info == NULL) | |
5869 | { | |
3d548a53 TT |
5870 | /* It may seem strange to store the main name in the progspace |
5871 | and also in whatever objfile happens to see a main name in | |
5872 | its debug info. The reason for this is mainly historical: | |
5873 | gdb returned "main" as the name even if no function named | |
5874 | "main" was defined the program; and this approach lets us | |
5875 | keep compatibility. */ | |
32ac0d11 TT |
5876 | info = XCNEW (struct main_info); |
5877 | info->language_of_main = language_unknown; | |
5878 | set_program_space_data (current_program_space, main_progspace_key, | |
5879 | info); | |
5880 | } | |
5881 | ||
5882 | return info; | |
5883 | } | |
5884 | ||
5885 | /* A cleanup to destroy a struct main_info when a progspace is | |
5886 | destroyed. */ | |
5887 | ||
5888 | static void | |
5889 | main_info_cleanup (struct program_space *pspace, void *data) | |
5890 | { | |
19ba03f4 | 5891 | struct main_info *info = (struct main_info *) data; |
32ac0d11 TT |
5892 | |
5893 | if (info != NULL) | |
5894 | xfree (info->name_of_main); | |
5895 | xfree (info); | |
5896 | } | |
51cc5b07 | 5897 | |
3d548a53 | 5898 | static void |
9e6c82ad | 5899 | set_main_name (const char *name, enum language lang) |
51cc5b07 | 5900 | { |
32ac0d11 TT |
5901 | struct main_info *info = get_main_info (); |
5902 | ||
5903 | if (info->name_of_main != NULL) | |
51cc5b07 | 5904 | { |
32ac0d11 TT |
5905 | xfree (info->name_of_main); |
5906 | info->name_of_main = NULL; | |
5907 | info->language_of_main = language_unknown; | |
51cc5b07 AC |
5908 | } |
5909 | if (name != NULL) | |
5910 | { | |
32ac0d11 TT |
5911 | info->name_of_main = xstrdup (name); |
5912 | info->language_of_main = lang; | |
51cc5b07 AC |
5913 | } |
5914 | } | |
5915 | ||
ea53e89f JB |
5916 | /* Deduce the name of the main procedure, and set NAME_OF_MAIN |
5917 | accordingly. */ | |
5918 | ||
5919 | static void | |
5920 | find_main_name (void) | |
5921 | { | |
cd6c7346 | 5922 | const char *new_main_name; |
3d548a53 TT |
5923 | struct objfile *objfile; |
5924 | ||
5925 | /* First check the objfiles to see whether a debuginfo reader has | |
5926 | picked up the appropriate main name. Historically the main name | |
5927 | was found in a more or less random way; this approach instead | |
5928 | relies on the order of objfile creation -- which still isn't | |
5929 | guaranteed to get the correct answer, but is just probably more | |
5930 | accurate. */ | |
5931 | ALL_OBJFILES (objfile) | |
5932 | { | |
5933 | if (objfile->per_bfd->name_of_main != NULL) | |
5934 | { | |
5935 | set_main_name (objfile->per_bfd->name_of_main, | |
5936 | objfile->per_bfd->language_of_main); | |
5937 | return; | |
5938 | } | |
5939 | } | |
ea53e89f JB |
5940 | |
5941 | /* Try to see if the main procedure is in Ada. */ | |
5942 | /* FIXME: brobecker/2005-03-07: Another way of doing this would | |
5943 | be to add a new method in the language vector, and call this | |
5944 | method for each language until one of them returns a non-empty | |
5945 | name. This would allow us to remove this hard-coded call to | |
5946 | an Ada function. It is not clear that this is a better approach | |
5947 | at this point, because all methods need to be written in a way | |
c378eb4e | 5948 | such that false positives never be returned. For instance, it is |
ea53e89f JB |
5949 | important that a method does not return a wrong name for the main |
5950 | procedure if the main procedure is actually written in a different | |
5951 | language. It is easy to guaranty this with Ada, since we use a | |
5952 | special symbol generated only when the main in Ada to find the name | |
c378eb4e | 5953 | of the main procedure. It is difficult however to see how this can |
ea53e89f JB |
5954 | be guarantied for languages such as C, for instance. This suggests |
5955 | that order of call for these methods becomes important, which means | |
5956 | a more complicated approach. */ | |
5957 | new_main_name = ada_main_name (); | |
5958 | if (new_main_name != NULL) | |
9af17804 | 5959 | { |
9e6c82ad | 5960 | set_main_name (new_main_name, language_ada); |
ea53e89f JB |
5961 | return; |
5962 | } | |
5963 | ||
63778547 IB |
5964 | new_main_name = d_main_name (); |
5965 | if (new_main_name != NULL) | |
5966 | { | |
5967 | set_main_name (new_main_name, language_d); | |
5968 | return; | |
5969 | } | |
5970 | ||
a766d390 DE |
5971 | new_main_name = go_main_name (); |
5972 | if (new_main_name != NULL) | |
5973 | { | |
9e6c82ad | 5974 | set_main_name (new_main_name, language_go); |
a766d390 DE |
5975 | return; |
5976 | } | |
5977 | ||
cd6c7346 PM |
5978 | new_main_name = pascal_main_name (); |
5979 | if (new_main_name != NULL) | |
9af17804 | 5980 | { |
9e6c82ad | 5981 | set_main_name (new_main_name, language_pascal); |
cd6c7346 PM |
5982 | return; |
5983 | } | |
5984 | ||
ea53e89f JB |
5985 | /* The languages above didn't identify the name of the main procedure. |
5986 | Fallback to "main". */ | |
9e6c82ad | 5987 | set_main_name ("main", language_unknown); |
ea53e89f JB |
5988 | } |
5989 | ||
51cc5b07 AC |
5990 | char * |
5991 | main_name (void) | |
5992 | { | |
32ac0d11 TT |
5993 | struct main_info *info = get_main_info (); |
5994 | ||
5995 | if (info->name_of_main == NULL) | |
ea53e89f JB |
5996 | find_main_name (); |
5997 | ||
32ac0d11 | 5998 | return info->name_of_main; |
51cc5b07 AC |
5999 | } |
6000 | ||
9e6c82ad TT |
6001 | /* Return the language of the main function. If it is not known, |
6002 | return language_unknown. */ | |
6003 | ||
6004 | enum language | |
6005 | main_language (void) | |
6006 | { | |
32ac0d11 TT |
6007 | struct main_info *info = get_main_info (); |
6008 | ||
6009 | if (info->name_of_main == NULL) | |
6010 | find_main_name (); | |
6011 | ||
6012 | return info->language_of_main; | |
9e6c82ad TT |
6013 | } |
6014 | ||
ea53e89f JB |
6015 | /* Handle ``executable_changed'' events for the symtab module. */ |
6016 | ||
6017 | static void | |
781b42b0 | 6018 | symtab_observer_executable_changed (void) |
ea53e89f JB |
6019 | { |
6020 | /* NAME_OF_MAIN may no longer be the same, so reset it for now. */ | |
9e6c82ad | 6021 | set_main_name (NULL, language_unknown); |
ea53e89f | 6022 | } |
51cc5b07 | 6023 | |
a6c727b2 DJ |
6024 | /* Return 1 if the supplied producer string matches the ARM RealView |
6025 | compiler (armcc). */ | |
6026 | ||
6027 | int | |
6028 | producer_is_realview (const char *producer) | |
6029 | { | |
6030 | static const char *const arm_idents[] = { | |
6031 | "ARM C Compiler, ADS", | |
6032 | "Thumb C Compiler, ADS", | |
6033 | "ARM C++ Compiler, ADS", | |
6034 | "Thumb C++ Compiler, ADS", | |
6035 | "ARM/Thumb C/C++ Compiler, RVCT", | |
6036 | "ARM C/C++ Compiler, RVCT" | |
6037 | }; | |
6038 | int i; | |
6039 | ||
6040 | if (producer == NULL) | |
6041 | return 0; | |
6042 | ||
6043 | for (i = 0; i < ARRAY_SIZE (arm_idents); i++) | |
61012eef | 6044 | if (startswith (producer, arm_idents[i])) |
a6c727b2 DJ |
6045 | return 1; |
6046 | ||
6047 | return 0; | |
6048 | } | |
ed0616c6 | 6049 | |
f1e6e072 TT |
6050 | \f |
6051 | ||
6052 | /* The next index to hand out in response to a registration request. */ | |
6053 | ||
6054 | static int next_aclass_value = LOC_FINAL_VALUE; | |
6055 | ||
6056 | /* The maximum number of "aclass" registrations we support. This is | |
6057 | constant for convenience. */ | |
6058 | #define MAX_SYMBOL_IMPLS (LOC_FINAL_VALUE + 10) | |
6059 | ||
6060 | /* The objects representing the various "aclass" values. The elements | |
6061 | from 0 up to LOC_FINAL_VALUE-1 represent themselves, and subsequent | |
6062 | elements are those registered at gdb initialization time. */ | |
6063 | ||
6064 | static struct symbol_impl symbol_impl[MAX_SYMBOL_IMPLS]; | |
6065 | ||
6066 | /* The globally visible pointer. This is separate from 'symbol_impl' | |
6067 | so that it can be const. */ | |
6068 | ||
6069 | const struct symbol_impl *symbol_impls = &symbol_impl[0]; | |
6070 | ||
6071 | /* Make sure we saved enough room in struct symbol. */ | |
6072 | ||
6073 | gdb_static_assert (MAX_SYMBOL_IMPLS <= (1 << SYMBOL_ACLASS_BITS)); | |
6074 | ||
6075 | /* Register a computed symbol type. ACLASS must be LOC_COMPUTED. OPS | |
6076 | is the ops vector associated with this index. This returns the new | |
6077 | index, which should be used as the aclass_index field for symbols | |
6078 | of this type. */ | |
6079 | ||
6080 | int | |
6081 | register_symbol_computed_impl (enum address_class aclass, | |
6082 | const struct symbol_computed_ops *ops) | |
6083 | { | |
6084 | int result = next_aclass_value++; | |
6085 | ||
6086 | gdb_assert (aclass == LOC_COMPUTED); | |
6087 | gdb_assert (result < MAX_SYMBOL_IMPLS); | |
6088 | symbol_impl[result].aclass = aclass; | |
6089 | symbol_impl[result].ops_computed = ops; | |
6090 | ||
24d6c2a0 TT |
6091 | /* Sanity check OPS. */ |
6092 | gdb_assert (ops != NULL); | |
6093 | gdb_assert (ops->tracepoint_var_ref != NULL); | |
6094 | gdb_assert (ops->describe_location != NULL); | |
6095 | gdb_assert (ops->read_needs_frame != NULL); | |
6096 | gdb_assert (ops->read_variable != NULL); | |
6097 | ||
f1e6e072 TT |
6098 | return result; |
6099 | } | |
6100 | ||
6101 | /* Register a function with frame base type. ACLASS must be LOC_BLOCK. | |
6102 | OPS is the ops vector associated with this index. This returns the | |
6103 | new index, which should be used as the aclass_index field for symbols | |
6104 | of this type. */ | |
6105 | ||
6106 | int | |
6107 | register_symbol_block_impl (enum address_class aclass, | |
6108 | const struct symbol_block_ops *ops) | |
6109 | { | |
6110 | int result = next_aclass_value++; | |
6111 | ||
6112 | gdb_assert (aclass == LOC_BLOCK); | |
6113 | gdb_assert (result < MAX_SYMBOL_IMPLS); | |
6114 | symbol_impl[result].aclass = aclass; | |
6115 | symbol_impl[result].ops_block = ops; | |
6116 | ||
6117 | /* Sanity check OPS. */ | |
6118 | gdb_assert (ops != NULL); | |
6119 | gdb_assert (ops->find_frame_base_location != NULL); | |
6120 | ||
6121 | return result; | |
6122 | } | |
6123 | ||
6124 | /* Register a register symbol type. ACLASS must be LOC_REGISTER or | |
6125 | LOC_REGPARM_ADDR. OPS is the register ops vector associated with | |
6126 | this index. This returns the new index, which should be used as | |
6127 | the aclass_index field for symbols of this type. */ | |
6128 | ||
6129 | int | |
6130 | register_symbol_register_impl (enum address_class aclass, | |
6131 | const struct symbol_register_ops *ops) | |
6132 | { | |
6133 | int result = next_aclass_value++; | |
6134 | ||
6135 | gdb_assert (aclass == LOC_REGISTER || aclass == LOC_REGPARM_ADDR); | |
6136 | gdb_assert (result < MAX_SYMBOL_IMPLS); | |
6137 | symbol_impl[result].aclass = aclass; | |
6138 | symbol_impl[result].ops_register = ops; | |
6139 | ||
6140 | return result; | |
6141 | } | |
6142 | ||
6143 | /* Initialize elements of 'symbol_impl' for the constants in enum | |
6144 | address_class. */ | |
6145 | ||
6146 | static void | |
6147 | initialize_ordinary_address_classes (void) | |
6148 | { | |
6149 | int i; | |
6150 | ||
6151 | for (i = 0; i < LOC_FINAL_VALUE; ++i) | |
aead7601 | 6152 | symbol_impl[i].aclass = (enum address_class) i; |
f1e6e072 TT |
6153 | } |
6154 | ||
6155 | \f | |
6156 | ||
1994afbf DE |
6157 | /* Helper function to initialize the fields of an objfile-owned symbol. |
6158 | It assumed that *SYM is already all zeroes. */ | |
6159 | ||
6160 | static void | |
6161 | initialize_objfile_symbol_1 (struct symbol *sym) | |
6162 | { | |
6163 | SYMBOL_OBJFILE_OWNED (sym) = 1; | |
6164 | SYMBOL_SECTION (sym) = -1; | |
6165 | } | |
6166 | ||
6167 | /* Initialize the symbol SYM, and mark it as being owned by an objfile. */ | |
e623cf5d TT |
6168 | |
6169 | void | |
38bf1463 | 6170 | initialize_objfile_symbol (struct symbol *sym) |
e623cf5d TT |
6171 | { |
6172 | memset (sym, 0, sizeof (*sym)); | |
1994afbf | 6173 | initialize_objfile_symbol_1 (sym); |
e623cf5d TT |
6174 | } |
6175 | ||
6176 | /* Allocate and initialize a new 'struct symbol' on OBJFILE's | |
6177 | obstack. */ | |
6178 | ||
6179 | struct symbol * | |
6180 | allocate_symbol (struct objfile *objfile) | |
6181 | { | |
6182 | struct symbol *result; | |
6183 | ||
6184 | result = OBSTACK_ZALLOC (&objfile->objfile_obstack, struct symbol); | |
1994afbf | 6185 | initialize_objfile_symbol_1 (result); |
e623cf5d TT |
6186 | |
6187 | return result; | |
6188 | } | |
6189 | ||
6190 | /* Allocate and initialize a new 'struct template_symbol' on OBJFILE's | |
6191 | obstack. */ | |
6192 | ||
6193 | struct template_symbol * | |
6194 | allocate_template_symbol (struct objfile *objfile) | |
6195 | { | |
6196 | struct template_symbol *result; | |
6197 | ||
6198 | result = OBSTACK_ZALLOC (&objfile->objfile_obstack, struct template_symbol); | |
1994afbf | 6199 | initialize_objfile_symbol_1 (&result->base); |
e623cf5d TT |
6200 | |
6201 | return result; | |
6202 | } | |
6203 | ||
08be3fe3 DE |
6204 | /* See symtab.h. */ |
6205 | ||
6206 | struct objfile * | |
6207 | symbol_objfile (const struct symbol *symbol) | |
6208 | { | |
1994afbf DE |
6209 | gdb_assert (SYMBOL_OBJFILE_OWNED (symbol)); |
6210 | return SYMTAB_OBJFILE (symbol->owner.symtab); | |
08be3fe3 DE |
6211 | } |
6212 | ||
6213 | /* See symtab.h. */ | |
6214 | ||
6215 | struct gdbarch * | |
6216 | symbol_arch (const struct symbol *symbol) | |
6217 | { | |
1994afbf DE |
6218 | if (!SYMBOL_OBJFILE_OWNED (symbol)) |
6219 | return symbol->owner.arch; | |
6220 | return get_objfile_arch (SYMTAB_OBJFILE (symbol->owner.symtab)); | |
08be3fe3 DE |
6221 | } |
6222 | ||
6223 | /* See symtab.h. */ | |
6224 | ||
6225 | struct symtab * | |
6226 | symbol_symtab (const struct symbol *symbol) | |
6227 | { | |
1994afbf DE |
6228 | gdb_assert (SYMBOL_OBJFILE_OWNED (symbol)); |
6229 | return symbol->owner.symtab; | |
08be3fe3 DE |
6230 | } |
6231 | ||
6232 | /* See symtab.h. */ | |
6233 | ||
6234 | void | |
6235 | symbol_set_symtab (struct symbol *symbol, struct symtab *symtab) | |
6236 | { | |
1994afbf DE |
6237 | gdb_assert (SYMBOL_OBJFILE_OWNED (symbol)); |
6238 | symbol->owner.symtab = symtab; | |
08be3fe3 DE |
6239 | } |
6240 | ||
e623cf5d TT |
6241 | \f |
6242 | ||
c906108c | 6243 | void |
fba45db2 | 6244 | _initialize_symtab (void) |
c906108c | 6245 | { |
f1e6e072 TT |
6246 | initialize_ordinary_address_classes (); |
6247 | ||
32ac0d11 TT |
6248 | main_progspace_key |
6249 | = register_program_space_data_with_cleanup (NULL, main_info_cleanup); | |
6250 | ||
f57d2163 DE |
6251 | symbol_cache_key |
6252 | = register_program_space_data_with_cleanup (NULL, symbol_cache_cleanup); | |
6253 | ||
1bedd215 AC |
6254 | add_info ("variables", variables_info, _("\ |
6255 | All global and static variable names, or those matching REGEXP.")); | |
c906108c | 6256 | if (dbx_commands) |
1bedd215 AC |
6257 | add_com ("whereis", class_info, variables_info, _("\ |
6258 | All global and static variable names, or those matching REGEXP.")); | |
c906108c SS |
6259 | |
6260 | add_info ("functions", functions_info, | |
1bedd215 | 6261 | _("All function names, or those matching REGEXP.")); |
c906108c SS |
6262 | |
6263 | /* FIXME: This command has at least the following problems: | |
6264 | 1. It prints builtin types (in a very strange and confusing fashion). | |
6265 | 2. It doesn't print right, e.g. with | |
c5aa993b JM |
6266 | typedef struct foo *FOO |
6267 | type_print prints "FOO" when we want to make it (in this situation) | |
6268 | print "struct foo *". | |
c906108c SS |
6269 | I also think "ptype" or "whatis" is more likely to be useful (but if |
6270 | there is much disagreement "info types" can be fixed). */ | |
6271 | add_info ("types", types_info, | |
1bedd215 | 6272 | _("All type names, or those matching REGEXP.")); |
c906108c | 6273 | |
c906108c | 6274 | add_info ("sources", sources_info, |
1bedd215 | 6275 | _("Source files in the program.")); |
c906108c SS |
6276 | |
6277 | add_com ("rbreak", class_breakpoint, rbreak_command, | |
1bedd215 | 6278 | _("Set a breakpoint for all functions matching REGEXP.")); |
c906108c | 6279 | |
717d2f5a JB |
6280 | add_setshow_enum_cmd ("multiple-symbols", no_class, |
6281 | multiple_symbols_modes, &multiple_symbols_mode, | |
6282 | _("\ | |
6283 | Set the debugger behavior when more than one symbol are possible matches\n\ | |
6284 | in an expression."), _("\ | |
6285 | Show how the debugger handles ambiguities in expressions."), _("\ | |
6286 | Valid values are \"ask\", \"all\", \"cancel\", and the default is \"all\"."), | |
6287 | NULL, NULL, &setlist, &showlist); | |
6288 | ||
c011a4f4 DE |
6289 | add_setshow_boolean_cmd ("basenames-may-differ", class_obscure, |
6290 | &basenames_may_differ, _("\ | |
6291 | Set whether a source file may have multiple base names."), _("\ | |
6292 | Show whether a source file may have multiple base names."), _("\ | |
6293 | (A \"base name\" is the name of a file with the directory part removed.\n\ | |
6294 | Example: The base name of \"/home/user/hello.c\" is \"hello.c\".)\n\ | |
6295 | If set, GDB will canonicalize file names (e.g., expand symlinks)\n\ | |
6296 | before comparing them. Canonicalization is an expensive operation,\n\ | |
6297 | but it allows the same file be known by more than one base name.\n\ | |
6298 | If not set (the default), all source files are assumed to have just\n\ | |
6299 | one base name, and gdb will do file name comparisons more efficiently."), | |
6300 | NULL, NULL, | |
6301 | &setlist, &showlist); | |
6302 | ||
db0fec5c DE |
6303 | add_setshow_zuinteger_cmd ("symtab-create", no_class, &symtab_create_debug, |
6304 | _("Set debugging of symbol table creation."), | |
6305 | _("Show debugging of symbol table creation."), _("\ | |
6306 | When enabled (non-zero), debugging messages are printed when building\n\ | |
6307 | symbol tables. A value of 1 (one) normally provides enough information.\n\ | |
6308 | A value greater than 1 provides more verbose information."), | |
6309 | NULL, | |
6310 | NULL, | |
6311 | &setdebuglist, &showdebuglist); | |
45cfd468 | 6312 | |
cc485e62 DE |
6313 | add_setshow_zuinteger_cmd ("symbol-lookup", no_class, &symbol_lookup_debug, |
6314 | _("\ | |
6315 | Set debugging of symbol lookup."), _("\ | |
6316 | Show debugging of symbol lookup."), _("\ | |
6317 | When enabled (non-zero), symbol lookups are logged."), | |
6318 | NULL, NULL, | |
6319 | &setdebuglist, &showdebuglist); | |
6320 | ||
f57d2163 DE |
6321 | add_setshow_zuinteger_cmd ("symbol-cache-size", no_class, |
6322 | &new_symbol_cache_size, | |
6323 | _("Set the size of the symbol cache."), | |
6324 | _("Show the size of the symbol cache."), _("\ | |
6325 | The size of the symbol cache.\n\ | |
6326 | If zero then the symbol cache is disabled."), | |
6327 | set_symbol_cache_size_handler, NULL, | |
6328 | &maintenance_set_cmdlist, | |
6329 | &maintenance_show_cmdlist); | |
6330 | ||
6331 | add_cmd ("symbol-cache", class_maintenance, maintenance_print_symbol_cache, | |
6332 | _("Dump the symbol cache for each program space."), | |
6333 | &maintenanceprintlist); | |
6334 | ||
6335 | add_cmd ("symbol-cache-statistics", class_maintenance, | |
6336 | maintenance_print_symbol_cache_statistics, | |
6337 | _("Print symbol cache statistics for each program space."), | |
6338 | &maintenanceprintlist); | |
6339 | ||
6340 | add_cmd ("flush-symbol-cache", class_maintenance, | |
6341 | maintenance_flush_symbol_cache, | |
6342 | _("Flush the symbol cache for each program space."), | |
6343 | &maintenancelist); | |
6344 | ||
ea53e89f | 6345 | observer_attach_executable_changed (symtab_observer_executable_changed); |
f57d2163 DE |
6346 | observer_attach_new_objfile (symtab_new_objfile_observer); |
6347 | observer_attach_free_objfile (symtab_free_objfile_observer); | |
c906108c | 6348 | } |