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