Commit | Line | Data |
---|---|---|
50641945 | 1 | /* Parser for linespec for the GNU debugger, GDB. |
05ff989b | 2 | |
28e7fd62 | 3 | Copyright (C) 1986-2013 Free Software Foundation, Inc. |
50641945 FN |
4 | |
5 | This file is part of GDB. | |
6 | ||
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 |
50641945 FN |
10 | (at your option) any later version. |
11 | ||
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. | |
16 | ||
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/>. */ |
50641945 FN |
19 | |
20 | #include "defs.h" | |
21 | #include "symtab.h" | |
c5f0f3d0 FN |
22 | #include "frame.h" |
23 | #include "command.h" | |
50641945 FN |
24 | #include "symfile.h" |
25 | #include "objfiles.h" | |
0378c332 | 26 | #include "source.h" |
50641945 | 27 | #include "demangle.h" |
c5f0f3d0 FN |
28 | #include "value.h" |
29 | #include "completer.h" | |
015a42b4 | 30 | #include "cp-abi.h" |
12907978 | 31 | #include "cp-support.h" |
c38da1af | 32 | #include "parser-defs.h" |
fe898f56 | 33 | #include "block.h" |
d2630e69 | 34 | #include "objc-lang.h" |
b9362cc7 | 35 | #include "linespec.h" |
05ff989b | 36 | #include "exceptions.h" |
53c5240f | 37 | #include "language.h" |
dc67126b NR |
38 | #include "interps.h" |
39 | #include "mi/mi-cmds.h" | |
bccdca4a | 40 | #include "target.h" |
94af9270 | 41 | #include "arch-utils.h" |
c00f8484 KS |
42 | #include <ctype.h> |
43 | #include "cli/cli-utils.h" | |
731971ed | 44 | #include "filenames.h" |
f8eba3c6 | 45 | #include "ada-lang.h" |
39cf75f7 | 46 | #include "stack.h" |
f8eba3c6 | 47 | |
f8eba3c6 TT |
48 | typedef struct symbol *symbolp; |
49 | DEF_VEC_P (symbolp); | |
50 | ||
51 | typedef struct type *typep; | |
52 | DEF_VEC_P (typep); | |
53 | ||
54 | /* An address entry is used to ensure that any given location is only | |
55 | added to the result a single time. It holds an address and the | |
56 | program space from which the address came. */ | |
57 | ||
58 | struct address_entry | |
59 | { | |
60 | struct program_space *pspace; | |
61 | CORE_ADDR addr; | |
62 | }; | |
63 | ||
f60e2d5c | 64 | typedef struct bound_minimal_symbol bound_minimal_symbol_d; |
40e084e1 | 65 | |
f60e2d5c | 66 | DEF_VEC_O (bound_minimal_symbol_d); |
40e084e1 KS |
67 | |
68 | /* An enumeration of possible signs for a line offset. */ | |
69 | enum offset_relative_sign | |
70 | { | |
71 | /* No sign */ | |
72 | LINE_OFFSET_NONE, | |
73 | ||
74 | /* A plus sign ("+") */ | |
75 | LINE_OFFSET_PLUS, | |
76 | ||
77 | /* A minus sign ("-") */ | |
78 | LINE_OFFSET_MINUS, | |
79 | ||
80 | /* A special "sign" for unspecified offset. */ | |
81 | LINE_OFFSET_UNKNOWN | |
82 | }; | |
83 | ||
84 | /* A line offset in a linespec. */ | |
85 | ||
86 | struct line_offset | |
87 | { | |
88 | /* Line offset and any specified sign. */ | |
89 | int offset; | |
90 | enum offset_relative_sign sign; | |
91 | }; | |
92 | ||
93 | /* A linespec. Elements of this structure are filled in by a parser | |
94 | (either parse_linespec or some other function). The structure is | |
95 | then converted into SALs by convert_linespec_to_sals. */ | |
96 | ||
97 | struct linespec | |
98 | { | |
99 | /* An expression and the resulting PC. Specifying an expression | |
100 | currently precludes the use of other members. */ | |
101 | ||
102 | /* The expression entered by the user. */ | |
5d94e27b | 103 | const char *expression; |
40e084e1 KS |
104 | |
105 | /* The resulting PC expression derived from evaluating EXPRESSION. */ | |
106 | CORE_ADDR expr_pc; | |
107 | ||
108 | /* Any specified file symtabs. */ | |
109 | ||
110 | /* The user-supplied source filename or NULL if none was specified. */ | |
5d94e27b | 111 | const char *source_filename; |
40e084e1 KS |
112 | |
113 | /* The list of symtabs to search to which to limit the search. May not | |
114 | be NULL. If SOURCE_FILENAME is NULL (no user-specified filename), | |
115 | FILE_SYMTABS should contain one single NULL member. This will | |
116 | cause the code to use the default symtab. */ | |
ec94af83 | 117 | VEC (symtab_ptr) *file_symtabs; |
40e084e1 KS |
118 | |
119 | /* The name of a function or method and any matching symbols. */ | |
120 | ||
121 | /* The user-specified function name. If no function name was | |
122 | supplied, this may be NULL. */ | |
5d94e27b | 123 | const char *function_name; |
40e084e1 KS |
124 | |
125 | /* A list of matching function symbols and minimal symbols. Both lists | |
126 | may be NULL if no matching symbols were found. */ | |
127 | VEC (symbolp) *function_symbols; | |
f60e2d5c | 128 | VEC (bound_minimal_symbol_d) *minimal_symbols; |
40e084e1 KS |
129 | |
130 | /* The name of a label and matching symbols. */ | |
131 | ||
132 | /* The user-specified label name. */ | |
5d94e27b | 133 | const char *label_name; |
40e084e1 KS |
134 | |
135 | /* A structure of matching label symbols and the corresponding | |
136 | function symbol in which the label was found. Both may be NULL | |
137 | or both must be non-NULL. */ | |
138 | struct | |
139 | { | |
140 | VEC (symbolp) *label_symbols; | |
141 | VEC (symbolp) *function_symbols; | |
142 | } labels; | |
143 | ||
144 | /* Line offset. It may be LINE_OFFSET_UNKNOWN, meaning that no | |
145 | offset was specified. */ | |
146 | struct line_offset line_offset; | |
147 | }; | |
148 | typedef struct linespec *linespec_p; | |
149 | ||
33f448b1 JK |
150 | /* A canonical linespec represented as a symtab-related string. |
151 | ||
152 | Each entry represents the "SYMTAB:SUFFIX" linespec string. | |
153 | SYMTAB can be converted for example by symtab_to_fullname or | |
154 | symtab_to_filename_for_display as needed. */ | |
155 | ||
156 | struct linespec_canonical_name | |
157 | { | |
158 | /* Remaining text part of the linespec string. */ | |
159 | char *suffix; | |
160 | ||
161 | /* If NULL then SUFFIX is the whole linespec string. */ | |
162 | struct symtab *symtab; | |
163 | }; | |
164 | ||
f8eba3c6 TT |
165 | /* An instance of this is used to keep all state while linespec |
166 | operates. This instance is passed around as a 'this' pointer to | |
167 | the various implementation methods. */ | |
168 | ||
169 | struct linespec_state | |
170 | { | |
40e084e1 KS |
171 | /* The language in use during linespec processing. */ |
172 | const struct language_defn *language; | |
173 | ||
f8eba3c6 TT |
174 | /* The program space as seen when the module was entered. */ |
175 | struct program_space *program_space; | |
176 | ||
177 | /* The default symtab to use, if no other symtab is specified. */ | |
178 | struct symtab *default_symtab; | |
179 | ||
180 | /* The default line to use. */ | |
181 | int default_line; | |
182 | ||
f8eba3c6 TT |
183 | /* The 'funfirstline' value that was passed in to decode_line_1 or |
184 | decode_line_full. */ | |
185 | int funfirstline; | |
186 | ||
187 | /* Nonzero if we are running in 'list' mode; see decode_line_list. */ | |
188 | int list_mode; | |
189 | ||
190 | /* The 'canonical' value passed to decode_line_full, or NULL. */ | |
191 | struct linespec_result *canonical; | |
192 | ||
193 | /* Canonical strings that mirror the symtabs_and_lines result. */ | |
33f448b1 | 194 | struct linespec_canonical_name *canonical_names; |
f8eba3c6 TT |
195 | |
196 | /* This is a set of address_entry objects which is used to prevent | |
197 | duplicate symbols from being entered into the result. */ | |
198 | htab_t addr_set; | |
199 | }; | |
200 | ||
201 | /* This is a helper object that is used when collecting symbols into a | |
202 | result. */ | |
203 | ||
204 | struct collect_info | |
205 | { | |
206 | /* The linespec object in use. */ | |
207 | struct linespec_state *state; | |
208 | ||
40e084e1 | 209 | /* A list of symtabs to which to restrict matches. */ |
ec94af83 | 210 | VEC (symtab_ptr) *file_symtabs; |
40e084e1 | 211 | |
f8eba3c6 | 212 | /* The result being accumulated. */ |
40e084e1 KS |
213 | struct |
214 | { | |
215 | VEC (symbolp) *symbols; | |
f60e2d5c | 216 | VEC (bound_minimal_symbol_d) *minimal_symbols; |
40e084e1 | 217 | } result; |
f8eba3c6 | 218 | }; |
50641945 | 219 | |
40e084e1 | 220 | /* Token types */ |
50641945 | 221 | |
40e084e1 KS |
222 | enum ls_token_type |
223 | { | |
224 | /* A keyword */ | |
225 | LSTOKEN_KEYWORD = 0, | |
44fe14ab | 226 | |
40e084e1 KS |
227 | /* A colon "separator" */ |
228 | LSTOKEN_COLON, | |
44fe14ab | 229 | |
40e084e1 KS |
230 | /* A string */ |
231 | LSTOKEN_STRING, | |
0960f083 | 232 | |
40e084e1 KS |
233 | /* A number */ |
234 | LSTOKEN_NUMBER, | |
235 | ||
236 | /* A comma */ | |
237 | LSTOKEN_COMMA, | |
238 | ||
239 | /* EOI (end of input) */ | |
240 | LSTOKEN_EOI, | |
241 | ||
242 | /* Consumed token */ | |
243 | LSTOKEN_CONSUMED | |
244 | }; | |
245 | typedef enum ls_token_type linespec_token_type; | |
246 | ||
247 | /* List of keywords */ | |
248 | ||
249 | static const char * const linespec_keywords[] = { "if", "thread", "task" }; | |
250 | ||
251 | /* A token of the linespec lexer */ | |
252 | ||
253 | struct ls_token | |
254 | { | |
255 | /* The type of the token */ | |
256 | linespec_token_type type; | |
257 | ||
258 | /* Data for the token */ | |
259 | union | |
260 | { | |
261 | /* A string, given as a stoken */ | |
262 | struct stoken string; | |
263 | ||
264 | /* A keyword */ | |
265 | const char *keyword; | |
266 | } data; | |
267 | }; | |
268 | typedef struct ls_token linespec_token; | |
269 | ||
270 | #define LS_TOKEN_STOKEN(TOK) (TOK).data.string | |
271 | #define LS_TOKEN_KEYWORD(TOK) (TOK).data.keyword | |
272 | ||
273 | /* An instance of the linespec parser. */ | |
274 | ||
275 | struct ls_parser | |
276 | { | |
277 | /* Lexer internal data */ | |
278 | struct | |
279 | { | |
280 | /* Save head of input stream. */ | |
d7561cbb | 281 | const char *saved_arg; |
d2630e69 | 282 | |
40e084e1 | 283 | /* Head of the input stream. */ |
d7561cbb | 284 | const char **stream; |
40e084e1 | 285 | #define PARSER_STREAM(P) (*(P)->lexer.stream) |
614b3b14 | 286 | |
40e084e1 KS |
287 | /* The current token. */ |
288 | linespec_token current; | |
289 | } lexer; | |
93d91629 | 290 | |
40e084e1 KS |
291 | /* Is the entire linespec quote-enclosed? */ |
292 | int is_quote_enclosed; | |
293 | ||
7c09e5a0 DE |
294 | /* Is a keyword syntactically valid at this point? |
295 | In, e.g., "break thread thread 1", the leading "keyword" must not | |
296 | be interpreted as such. */ | |
297 | int keyword_ok; | |
298 | ||
40e084e1 KS |
299 | /* The state of the parse. */ |
300 | struct linespec_state state; | |
301 | #define PARSER_STATE(PPTR) (&(PPTR)->state) | |
4224873a | 302 | |
40e084e1 KS |
303 | /* The result of the parse. */ |
304 | struct linespec result; | |
305 | #define PARSER_RESULT(PPTR) (&(PPTR)->result) | |
306 | }; | |
307 | typedef struct ls_parser linespec_parser; | |
50641945 | 308 | |
40e084e1 | 309 | /* Prototypes for local functions. */ |
50641945 | 310 | |
4eeaa230 DE |
311 | static void iterate_over_file_blocks (struct symtab *symtab, |
312 | const char *name, domain_enum domain, | |
313 | symbol_found_callback_ftype *callback, | |
314 | void *data); | |
315 | ||
40e084e1 KS |
316 | static void initialize_defaults (struct symtab **default_symtab, |
317 | int *default_line); | |
50641945 | 318 | |
bbc13ae3 | 319 | static CORE_ADDR linespec_expression_to_pc (const char **exp_ptr); |
aee8d8ba | 320 | |
40e084e1 KS |
321 | static struct symtabs_and_lines decode_objc (struct linespec_state *self, |
322 | linespec_p ls, | |
d7561cbb | 323 | const char **argptr); |
aee8d8ba | 324 | |
ec94af83 | 325 | static VEC (symtab_ptr) *symtabs_from_filename (const char *); |
50641945 | 326 | |
40e084e1 KS |
327 | static VEC (symbolp) *find_label_symbols (struct linespec_state *self, |
328 | VEC (symbolp) *function_symbols, | |
329 | VEC (symbolp) **label_funcs_ret, | |
330 | const char *name); | |
50641945 | 331 | |
b1ae631a | 332 | static void find_linespec_symbols (struct linespec_state *self, |
ec94af83 | 333 | VEC (symtab_ptr) *file_symtabs, |
b1ae631a DE |
334 | const char *name, |
335 | VEC (symbolp) **symbols, | |
f60e2d5c | 336 | VEC (bound_minimal_symbol_d) **minsyms); |
f8eba3c6 | 337 | |
40e084e1 KS |
338 | static struct line_offset |
339 | linespec_parse_variable (struct linespec_state *self, | |
340 | const char *variable); | |
889f28e2 | 341 | |
f8eba3c6 TT |
342 | static int symbol_to_sal (struct symtab_and_line *result, |
343 | int funfirstline, struct symbol *sym); | |
50641945 | 344 | |
f8eba3c6 TT |
345 | static void add_matching_symbols_to_info (const char *name, |
346 | struct collect_info *info, | |
347 | struct program_space *pspace); | |
f3c39e76 | 348 | |
f8eba3c6 TT |
349 | static void add_all_symbol_names_from_pspace (struct collect_info *info, |
350 | struct program_space *pspace, | |
351 | VEC (const_char_ptr) *names); | |
9ef07c8c | 352 | |
ec94af83 | 353 | static VEC (symtab_ptr) *collect_symtabs_from_filename (const char *file); |
84fba31b | 354 | |
40e084e1 KS |
355 | static void decode_digits_ordinary (struct linespec_state *self, |
356 | linespec_p ls, | |
357 | int line, | |
358 | struct symtabs_and_lines *sals, | |
359 | struct linetable_entry **best_entry); | |
14e91ac5 | 360 | |
40e084e1 KS |
361 | static void decode_digits_list_mode (struct linespec_state *self, |
362 | linespec_p ls, | |
363 | struct symtabs_and_lines *values, | |
364 | struct symtab_and_line val); | |
0f5238ed | 365 | |
40e084e1 KS |
366 | static void minsym_found (struct linespec_state *self, struct objfile *objfile, |
367 | struct minimal_symbol *msymbol, | |
368 | struct symtabs_and_lines *result); | |
bca02a8a | 369 | |
40e084e1 | 370 | static int compare_symbols (const void *a, const void *b); |
413dad4d | 371 | |
40e084e1 | 372 | static int compare_msymbols (const void *a, const void *b); |
413dad4d | 373 | |
40e084e1 | 374 | static const char *find_toplevel_char (const char *s, char c); |
f8eba3c6 | 375 | |
40e084e1 KS |
376 | /* Permitted quote characters for the parser. This is different from the |
377 | completer's quote characters to allow backward compatibility with the | |
378 | previous parser. */ | |
379 | static const char *const linespec_quote_characters = "\"\'"; | |
f8eba3c6 | 380 | |
40e084e1 KS |
381 | /* Lexer functions. */ |
382 | ||
383 | /* Lex a number from the input in PARSER. This only supports | |
dd3818c8 KS |
384 | decimal numbers. |
385 | ||
d7cbec71 | 386 | Return true if input is decimal numbers. Return false if not. */ |
40e084e1 | 387 | |
d7cbec71 HZ |
388 | static int |
389 | linespec_lexer_lex_number (linespec_parser *parser, linespec_token *tokenp) | |
40e084e1 | 390 | { |
d7cbec71 HZ |
391 | tokenp->type = LSTOKEN_NUMBER; |
392 | LS_TOKEN_STOKEN (*tokenp).length = 0; | |
393 | LS_TOKEN_STOKEN (*tokenp).ptr = PARSER_STREAM (parser); | |
40e084e1 KS |
394 | |
395 | /* Keep any sign at the start of the stream. */ | |
396 | if (*PARSER_STREAM (parser) == '+' || *PARSER_STREAM (parser) == '-') | |
397 | { | |
d7cbec71 | 398 | ++LS_TOKEN_STOKEN (*tokenp).length; |
40e084e1 KS |
399 | ++(PARSER_STREAM (parser)); |
400 | } | |
401 | ||
402 | while (isdigit (*PARSER_STREAM (parser))) | |
403 | { | |
d7cbec71 | 404 | ++LS_TOKEN_STOKEN (*tokenp).length; |
40e084e1 | 405 | ++(PARSER_STREAM (parser)); |
f8eba3c6 | 406 | } |
40e084e1 | 407 | |
dd3818c8 | 408 | /* If the next character in the input buffer is not a space, comma, |
eff9c3e6 | 409 | quote, or colon, this input does not represent a number. */ |
dd3818c8 KS |
410 | if (*PARSER_STREAM (parser) != '\0' |
411 | && !isspace (*PARSER_STREAM (parser)) && *PARSER_STREAM (parser) != ',' | |
eff9c3e6 KS |
412 | && *PARSER_STREAM (parser) != ':' |
413 | && !strchr (linespec_quote_characters, *PARSER_STREAM (parser))) | |
d7cbec71 HZ |
414 | { |
415 | PARSER_STREAM (parser) = LS_TOKEN_STOKEN (*tokenp).ptr; | |
416 | return 0; | |
417 | } | |
418 | ||
419 | return 1; | |
f8eba3c6 TT |
420 | } |
421 | ||
40e084e1 KS |
422 | /* Does P represent one of the keywords? If so, return |
423 | the keyword. If not, return NULL. */ | |
f8eba3c6 | 424 | |
40e084e1 KS |
425 | static const char * |
426 | linespec_lexer_lex_keyword (const char *p) | |
f8eba3c6 | 427 | { |
40e084e1 | 428 | int i; |
f8eba3c6 | 429 | |
40e084e1 KS |
430 | if (p != NULL) |
431 | { | |
432 | for (i = 0; i < ARRAY_SIZE (linespec_keywords); ++i) | |
433 | { | |
434 | int len = strlen (linespec_keywords[i]); | |
435 | ||
436 | /* If P begins with one of the keywords and the next | |
437 | character is not a valid identifier character, | |
438 | we have found a keyword. */ | |
439 | if (strncmp (p, linespec_keywords[i], len) == 0 | |
440 | && !(isalnum (p[len]) || p[len] == '_')) | |
441 | return linespec_keywords[i]; | |
442 | } | |
443 | } | |
444 | ||
445 | return NULL; | |
f8eba3c6 TT |
446 | } |
447 | ||
40e084e1 KS |
448 | /* Does STRING represent an Ada operator? If so, return the length |
449 | of the decoded operator name. If not, return 0. */ | |
f8eba3c6 TT |
450 | |
451 | static int | |
40e084e1 | 452 | is_ada_operator (const char *string) |
f8eba3c6 | 453 | { |
40e084e1 | 454 | const struct ada_opname_map *mapping; |
f8eba3c6 | 455 | |
40e084e1 KS |
456 | for (mapping = ada_opname_table; |
457 | mapping->encoded != NULL | |
458 | && strncmp (mapping->decoded, string, | |
459 | strlen (mapping->decoded)) != 0; ++mapping) | |
460 | ; | |
461 | ||
462 | return mapping->decoded == NULL ? 0 : strlen (mapping->decoded); | |
f8eba3c6 TT |
463 | } |
464 | ||
40e084e1 KS |
465 | /* Find QUOTE_CHAR in STRING, accounting for the ':' terminal. Return |
466 | the location of QUOTE_CHAR, or NULL if not found. */ | |
f8eba3c6 | 467 | |
40e084e1 KS |
468 | static const char * |
469 | skip_quote_char (const char *string, char quote_char) | |
f8eba3c6 | 470 | { |
40e084e1 | 471 | const char *p, *last; |
f8eba3c6 | 472 | |
40e084e1 KS |
473 | p = last = find_toplevel_char (string, quote_char); |
474 | while (p && *p != '\0' && *p != ':') | |
475 | { | |
476 | p = find_toplevel_char (p, quote_char); | |
477 | if (p != NULL) | |
478 | last = p++; | |
479 | } | |
f8eba3c6 | 480 | |
40e084e1 | 481 | return last; |
f8eba3c6 | 482 | } |
50641945 | 483 | |
40e084e1 KS |
484 | /* Make a writable copy of the string given in TOKEN, trimming |
485 | any trailing whitespace. */ | |
50641945 | 486 | |
40e084e1 KS |
487 | static char * |
488 | copy_token_string (linespec_token token) | |
50641945 | 489 | { |
40e084e1 | 490 | char *str, *s; |
e0881a8e | 491 | |
40e084e1 KS |
492 | if (token.type == LSTOKEN_KEYWORD) |
493 | return xstrdup (LS_TOKEN_KEYWORD (token)); | |
255e7dbf | 494 | |
40e084e1 KS |
495 | str = savestring (LS_TOKEN_STOKEN (token).ptr, |
496 | LS_TOKEN_STOKEN (token).length); | |
497 | s = remove_trailing_whitespace (str, str + LS_TOKEN_STOKEN (token).length); | |
498 | *s = '\0'; | |
e0881a8e | 499 | |
40e084e1 KS |
500 | return str; |
501 | } | |
255e7dbf | 502 | |
40e084e1 | 503 | /* Does P represent the end of a quote-enclosed linespec? */ |
f3a5f1de | 504 | |
40e084e1 KS |
505 | static int |
506 | is_closing_quote_enclosed (const char *p) | |
507 | { | |
508 | if (strchr (linespec_quote_characters, *p)) | |
509 | ++p; | |
510 | p = skip_spaces ((char *) p); | |
511 | return (*p == '\0' || linespec_lexer_lex_keyword (p)); | |
50641945 FN |
512 | } |
513 | ||
40e084e1 KS |
514 | /* Find the end of the parameter list that starts with *INPUT. |
515 | This helper function assists with lexing string segments | |
516 | which might contain valid (non-terminating) commas. */ | |
481860b3 | 517 | |
d7561cbb KS |
518 | static const char * |
519 | find_parameter_list_end (const char *input) | |
481860b3 | 520 | { |
40e084e1 KS |
521 | char end_char, start_char; |
522 | int depth; | |
d7561cbb | 523 | const char *p; |
481860b3 | 524 | |
40e084e1 KS |
525 | start_char = *input; |
526 | if (start_char == '(') | |
527 | end_char = ')'; | |
528 | else if (start_char == '<') | |
529 | end_char = '>'; | |
530 | else | |
531 | return NULL; | |
481860b3 | 532 | |
40e084e1 KS |
533 | p = input; |
534 | depth = 0; | |
535 | while (*p) | |
481860b3 | 536 | { |
40e084e1 KS |
537 | if (*p == start_char) |
538 | ++depth; | |
539 | else if (*p == end_char) | |
540 | { | |
541 | if (--depth == 0) | |
542 | { | |
543 | ++p; | |
544 | break; | |
545 | } | |
546 | } | |
547 | ++p; | |
481860b3 | 548 | } |
40e084e1 KS |
549 | |
550 | return p; | |
481860b3 GB |
551 | } |
552 | ||
74ccd7f5 | 553 | |
40e084e1 KS |
554 | /* Lex a string from the input in PARSER. */ |
555 | ||
556 | static linespec_token | |
557 | linespec_lexer_lex_string (linespec_parser *parser) | |
74ccd7f5 | 558 | { |
40e084e1 | 559 | linespec_token token; |
d7561cbb | 560 | const char *start = PARSER_STREAM (parser); |
74ccd7f5 | 561 | |
40e084e1 | 562 | token.type = LSTOKEN_STRING; |
74ccd7f5 | 563 | |
40e084e1 KS |
564 | /* If the input stream starts with a quote character, skip to the next |
565 | quote character, regardless of the content. */ | |
566 | if (strchr (linespec_quote_characters, *PARSER_STREAM (parser))) | |
567 | { | |
568 | const char *end; | |
569 | char quote_char = *PARSER_STREAM (parser); | |
50641945 | 570 | |
40e084e1 KS |
571 | /* Special case: Ada operators. */ |
572 | if (PARSER_STATE (parser)->language->la_language == language_ada | |
573 | && quote_char == '\"') | |
574 | { | |
575 | int len = is_ada_operator (PARSER_STREAM (parser)); | |
50641945 | 576 | |
40e084e1 KS |
577 | if (len != 0) |
578 | { | |
579 | /* The input is an Ada operator. Return the quoted string | |
580 | as-is. */ | |
581 | LS_TOKEN_STOKEN (token).ptr = PARSER_STREAM (parser); | |
582 | LS_TOKEN_STOKEN (token).length = len; | |
583 | PARSER_STREAM (parser) += len; | |
584 | return token; | |
585 | } | |
f8eba3c6 | 586 | |
40e084e1 KS |
587 | /* The input does not represent an Ada operator -- fall through |
588 | to normal quoted string handling. */ | |
589 | } | |
f8eba3c6 | 590 | |
40e084e1 KS |
591 | /* Skip past the beginning quote. */ |
592 | ++(PARSER_STREAM (parser)); | |
74ccd7f5 | 593 | |
40e084e1 KS |
594 | /* Mark the start of the string. */ |
595 | LS_TOKEN_STOKEN (token).ptr = PARSER_STREAM (parser); | |
f8eba3c6 | 596 | |
40e084e1 KS |
597 | /* Skip to the ending quote. */ |
598 | end = skip_quote_char (PARSER_STREAM (parser), quote_char); | |
599 | ||
600 | /* Error if the input did not terminate properly. */ | |
601 | if (end == NULL) | |
602 | error (_("unmatched quote")); | |
603 | ||
604 | /* Skip over the ending quote and mark the length of the string. */ | |
605 | PARSER_STREAM (parser) = (char *) ++end; | |
606 | LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - 2 - start; | |
607 | } | |
608 | else | |
609 | { | |
d7561cbb | 610 | const char *p; |
40e084e1 KS |
611 | |
612 | /* Otherwise, only identifier characters are permitted. | |
613 | Spaces are the exception. In general, we keep spaces, | |
614 | but only if the next characters in the input do not resolve | |
615 | to one of the keywords. | |
616 | ||
617 | This allows users to forgo quoting CV-qualifiers, template arguments, | |
618 | and similar common language constructs. */ | |
619 | ||
620 | while (1) | |
621 | { | |
622 | if (isspace (*PARSER_STREAM (parser))) | |
623 | { | |
d7561cbb | 624 | p = skip_spaces_const (PARSER_STREAM (parser)); |
7c09e5a0 DE |
625 | /* When we get here we know we've found something followed by |
626 | a space (we skip over parens and templates below). | |
627 | So if we find a keyword now, we know it is a keyword and not, | |
628 | say, a function name. */ | |
40e084e1 KS |
629 | if (linespec_lexer_lex_keyword (p) != NULL) |
630 | { | |
631 | LS_TOKEN_STOKEN (token).ptr = start; | |
632 | LS_TOKEN_STOKEN (token).length | |
633 | = PARSER_STREAM (parser) - start; | |
634 | return token; | |
635 | } | |
636 | ||
637 | /* Advance past the whitespace. */ | |
638 | PARSER_STREAM (parser) = p; | |
639 | } | |
640 | ||
641 | /* If the next character is EOI or (single) ':', the | |
642 | string is complete; return the token. */ | |
643 | if (*PARSER_STREAM (parser) == 0) | |
644 | { | |
645 | LS_TOKEN_STOKEN (token).ptr = start; | |
646 | LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - start; | |
647 | return token; | |
648 | } | |
649 | else if (PARSER_STREAM (parser)[0] == ':') | |
650 | { | |
651 | /* Do not tokenize the C++ scope operator. */ | |
652 | if (PARSER_STREAM (parser)[1] == ':') | |
653 | ++(PARSER_STREAM (parser)); | |
654 | ||
655 | /* Do not tokenify if the input length so far is one | |
656 | (i.e, a single-letter drive name) and the next character | |
657 | is a directory separator. This allows Windows-style | |
658 | paths to be recognized as filenames without quoting it. */ | |
659 | else if ((PARSER_STREAM (parser) - start) != 1 | |
660 | || !IS_DIR_SEPARATOR (PARSER_STREAM (parser)[1])) | |
661 | { | |
662 | LS_TOKEN_STOKEN (token).ptr = start; | |
663 | LS_TOKEN_STOKEN (token).length | |
664 | = PARSER_STREAM (parser) - start; | |
665 | return token; | |
666 | } | |
667 | } | |
668 | /* Special case: permit quote-enclosed linespecs. */ | |
669 | else if (parser->is_quote_enclosed | |
670 | && strchr (linespec_quote_characters, | |
671 | *PARSER_STREAM (parser)) | |
672 | && is_closing_quote_enclosed (PARSER_STREAM (parser))) | |
673 | { | |
674 | LS_TOKEN_STOKEN (token).ptr = start; | |
675 | LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - start; | |
676 | return token; | |
677 | } | |
678 | /* Because commas may terminate a linespec and appear in | |
679 | the middle of valid string input, special cases for | |
680 | '<' and '(' are necessary. */ | |
681 | else if (*PARSER_STREAM (parser) == '<' | |
682 | || *PARSER_STREAM (parser) == '(') | |
683 | { | |
d7561cbb | 684 | const char *p; |
40e084e1 KS |
685 | |
686 | p = find_parameter_list_end (PARSER_STREAM (parser)); | |
687 | if (p != NULL) | |
688 | { | |
689 | PARSER_STREAM (parser) = p; | |
690 | continue; | |
691 | } | |
692 | } | |
693 | /* Commas are terminators, but not if they are part of an | |
694 | operator name. */ | |
695 | else if (*PARSER_STREAM (parser) == ',') | |
696 | { | |
697 | if ((PARSER_STATE (parser)->language->la_language | |
698 | == language_cplus) | |
699 | && (PARSER_STREAM (parser) - start) > 8 | |
700 | /* strlen ("operator") */) | |
701 | { | |
702 | char *p = strstr (start, "operator"); | |
703 | ||
704 | if (p != NULL && is_operator_name (p)) | |
705 | { | |
706 | /* This is an operator name. Keep going. */ | |
707 | ++(PARSER_STREAM (parser)); | |
708 | continue; | |
709 | } | |
710 | } | |
711 | ||
712 | /* Comma terminates the string. */ | |
713 | LS_TOKEN_STOKEN (token).ptr = start; | |
714 | LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - start; | |
715 | return token; | |
716 | } | |
717 | ||
718 | /* Advance the stream. */ | |
719 | ++(PARSER_STREAM (parser)); | |
720 | } | |
721 | } | |
722 | ||
723 | return token; | |
724 | } | |
725 | ||
726 | /* Lex a single linespec token from PARSER. */ | |
727 | ||
728 | static linespec_token | |
729 | linespec_lexer_lex_one (linespec_parser *parser) | |
730 | { | |
731 | const char *keyword; | |
732 | ||
733 | if (parser->lexer.current.type == LSTOKEN_CONSUMED) | |
734 | { | |
735 | /* Skip any whitespace. */ | |
d7561cbb | 736 | PARSER_STREAM (parser) = skip_spaces_const (PARSER_STREAM (parser)); |
40e084e1 | 737 | |
7c09e5a0 DE |
738 | /* Check for a keyword, they end the linespec. */ |
739 | keyword = NULL; | |
740 | if (parser->keyword_ok) | |
741 | keyword = linespec_lexer_lex_keyword (PARSER_STREAM (parser)); | |
40e084e1 KS |
742 | if (keyword != NULL) |
743 | { | |
744 | parser->lexer.current.type = LSTOKEN_KEYWORD; | |
745 | LS_TOKEN_KEYWORD (parser->lexer.current) = keyword; | |
746 | return parser->lexer.current; | |
747 | } | |
748 | ||
749 | /* Handle other tokens. */ | |
750 | switch (*PARSER_STREAM (parser)) | |
751 | { | |
752 | case 0: | |
753 | parser->lexer.current.type = LSTOKEN_EOI; | |
754 | break; | |
755 | ||
756 | case '+': case '-': | |
757 | case '0': case '1': case '2': case '3': case '4': | |
758 | case '5': case '6': case '7': case '8': case '9': | |
d7cbec71 HZ |
759 | if (!linespec_lexer_lex_number (parser, &(parser->lexer.current))) |
760 | parser->lexer.current = linespec_lexer_lex_string (parser); | |
40e084e1 KS |
761 | break; |
762 | ||
763 | case ':': | |
764 | /* If we have a scope operator, lex the input as a string. | |
765 | Otherwise, return LSTOKEN_COLON. */ | |
766 | if (PARSER_STREAM (parser)[1] == ':') | |
767 | parser->lexer.current = linespec_lexer_lex_string (parser); | |
768 | else | |
769 | { | |
770 | parser->lexer.current.type = LSTOKEN_COLON; | |
771 | ++(PARSER_STREAM (parser)); | |
772 | } | |
773 | break; | |
774 | ||
775 | case '\'': case '\"': | |
776 | /* Special case: permit quote-enclosed linespecs. */ | |
777 | if (parser->is_quote_enclosed | |
778 | && is_closing_quote_enclosed (PARSER_STREAM (parser))) | |
779 | { | |
780 | ++(PARSER_STREAM (parser)); | |
781 | parser->lexer.current.type = LSTOKEN_EOI; | |
782 | } | |
783 | else | |
784 | parser->lexer.current = linespec_lexer_lex_string (parser); | |
785 | break; | |
786 | ||
787 | case ',': | |
788 | parser->lexer.current.type = LSTOKEN_COMMA; | |
789 | LS_TOKEN_STOKEN (parser->lexer.current).ptr | |
790 | = PARSER_STREAM (parser); | |
791 | LS_TOKEN_STOKEN (parser->lexer.current).length = 1; | |
792 | ++(PARSER_STREAM (parser)); | |
793 | break; | |
794 | ||
795 | default: | |
796 | /* If the input is not a number, it must be a string. | |
797 | [Keywords were already considered above.] */ | |
798 | parser->lexer.current = linespec_lexer_lex_string (parser); | |
799 | break; | |
800 | } | |
801 | } | |
802 | ||
803 | return parser->lexer.current; | |
804 | } | |
805 | ||
806 | /* Consume the current token and return the next token in PARSER's | |
807 | input stream. */ | |
808 | ||
809 | static linespec_token | |
810 | linespec_lexer_consume_token (linespec_parser *parser) | |
811 | { | |
812 | parser->lexer.current.type = LSTOKEN_CONSUMED; | |
813 | return linespec_lexer_lex_one (parser); | |
814 | } | |
815 | ||
816 | /* Return the next token without consuming the current token. */ | |
817 | ||
818 | static linespec_token | |
819 | linespec_lexer_peek_token (linespec_parser *parser) | |
820 | { | |
821 | linespec_token next; | |
d7561cbb | 822 | const char *saved_stream = PARSER_STREAM (parser); |
40e084e1 KS |
823 | linespec_token saved_token = parser->lexer.current; |
824 | ||
825 | next = linespec_lexer_consume_token (parser); | |
826 | PARSER_STREAM (parser) = saved_stream; | |
827 | parser->lexer.current = saved_token; | |
828 | return next; | |
829 | } | |
830 | ||
831 | /* Helper functions. */ | |
832 | ||
833 | /* Add SAL to SALS. */ | |
834 | ||
835 | static void | |
836 | add_sal_to_sals_basic (struct symtabs_and_lines *sals, | |
837 | struct symtab_and_line *sal) | |
838 | { | |
839 | ++sals->nelts; | |
840 | sals->sals = xrealloc (sals->sals, sals->nelts * sizeof (sals->sals[0])); | |
841 | sals->sals[sals->nelts - 1] = *sal; | |
842 | } | |
843 | ||
844 | /* Add SAL to SALS, and also update SELF->CANONICAL_NAMES to reflect | |
845 | the new sal, if needed. If not NULL, SYMNAME is the name of the | |
66f1999b KS |
846 | symbol to use when constructing the new canonical name. |
847 | ||
848 | If LITERAL_CANONICAL is non-zero, SYMNAME will be used as the | |
849 | canonical name for the SAL. */ | |
40e084e1 KS |
850 | |
851 | static void | |
852 | add_sal_to_sals (struct linespec_state *self, | |
853 | struct symtabs_and_lines *sals, | |
854 | struct symtab_and_line *sal, | |
66f1999b | 855 | const char *symname, int literal_canonical) |
40e084e1 KS |
856 | { |
857 | add_sal_to_sals_basic (sals, sal); | |
858 | ||
859 | if (self->canonical) | |
860 | { | |
33f448b1 | 861 | struct linespec_canonical_name *canonical; |
40e084e1 KS |
862 | |
863 | self->canonical_names = xrealloc (self->canonical_names, | |
33f448b1 JK |
864 | (sals->nelts |
865 | * sizeof (*self->canonical_names))); | |
866 | canonical = &self->canonical_names[sals->nelts - 1]; | |
4e04028d | 867 | if (!literal_canonical && sal->symtab) |
40e084e1 | 868 | { |
05cba821 | 869 | const char *fullname = symtab_to_fullname (sal->symtab); |
40e084e1 KS |
870 | |
871 | /* Note that the filter doesn't have to be a valid linespec | |
872 | input. We only apply the ":LINE" treatment to Ada for | |
873 | the time being. */ | |
874 | if (symname != NULL && sal->line != 0 | |
875 | && self->language->la_language == language_ada) | |
33f448b1 | 876 | canonical->suffix = xstrprintf ("%s:%d", symname, sal->line); |
40e084e1 | 877 | else if (symname != NULL) |
33f448b1 | 878 | canonical->suffix = xstrdup (symname); |
40e084e1 | 879 | else |
33f448b1 JK |
880 | canonical->suffix = xstrprintf ("%d", sal->line); |
881 | canonical->symtab = sal->symtab; | |
882 | } | |
883 | else | |
884 | { | |
885 | if (symname != NULL) | |
886 | canonical->suffix = xstrdup (symname); | |
887 | else | |
888 | canonical->suffix = NULL; | |
889 | canonical->symtab = NULL; | |
40e084e1 | 890 | } |
40e084e1 KS |
891 | } |
892 | } | |
893 | ||
894 | /* A hash function for address_entry. */ | |
895 | ||
896 | static hashval_t | |
897 | hash_address_entry (const void *p) | |
898 | { | |
899 | const struct address_entry *aep = p; | |
900 | hashval_t hash; | |
901 | ||
902 | hash = iterative_hash_object (aep->pspace, 0); | |
903 | return iterative_hash_object (aep->addr, hash); | |
904 | } | |
905 | ||
906 | /* An equality function for address_entry. */ | |
907 | ||
908 | static int | |
909 | eq_address_entry (const void *a, const void *b) | |
910 | { | |
911 | const struct address_entry *aea = a; | |
912 | const struct address_entry *aeb = b; | |
913 | ||
914 | return aea->pspace == aeb->pspace && aea->addr == aeb->addr; | |
915 | } | |
916 | ||
917 | /* Check whether the address, represented by PSPACE and ADDR, is | |
918 | already in the set. If so, return 0. Otherwise, add it and return | |
919 | 1. */ | |
920 | ||
921 | static int | |
922 | maybe_add_address (htab_t set, struct program_space *pspace, CORE_ADDR addr) | |
923 | { | |
924 | struct address_entry e, *p; | |
925 | void **slot; | |
926 | ||
927 | e.pspace = pspace; | |
928 | e.addr = addr; | |
929 | slot = htab_find_slot (set, &e, INSERT); | |
930 | if (*slot) | |
931 | return 0; | |
932 | ||
933 | p = XNEW (struct address_entry); | |
934 | memcpy (p, &e, sizeof (struct address_entry)); | |
935 | *slot = p; | |
936 | ||
937 | return 1; | |
938 | } | |
939 | ||
940 | /* A callback function and the additional data to call it with. */ | |
941 | ||
942 | struct symbol_and_data_callback | |
943 | { | |
944 | /* The callback to use. */ | |
945 | symbol_found_callback_ftype *callback; | |
946 | ||
947 | /* Data to be passed to the callback. */ | |
948 | void *data; | |
949 | }; | |
950 | ||
951 | /* A helper for iterate_over_all_matching_symtabs that is used to | |
952 | restrict calls to another callback to symbols representing inline | |
953 | symbols only. */ | |
954 | ||
955 | static int | |
956 | iterate_inline_only (struct symbol *sym, void *d) | |
957 | { | |
958 | if (SYMBOL_INLINED (sym)) | |
959 | { | |
960 | struct symbol_and_data_callback *cad = d; | |
961 | ||
962 | return cad->callback (sym, cad->data); | |
963 | } | |
964 | return 1; /* Continue iterating. */ | |
965 | } | |
966 | ||
967 | /* Some data for the expand_symtabs_matching callback. */ | |
968 | ||
969 | struct symbol_matcher_data | |
970 | { | |
971 | /* The lookup name against which symbol name should be compared. */ | |
972 | const char *lookup_name; | |
973 | ||
974 | /* The routine to be used for comparison. */ | |
975 | symbol_name_cmp_ftype symbol_name_cmp; | |
976 | }; | |
977 | ||
978 | /* A helper for iterate_over_all_matching_symtabs that is passed as a | |
979 | callback to the expand_symtabs_matching method. */ | |
980 | ||
981 | static int | |
982 | iterate_name_matcher (const char *name, void *d) | |
983 | { | |
984 | const struct symbol_matcher_data *data = d; | |
985 | ||
986 | if (data->symbol_name_cmp (name, data->lookup_name) == 0) | |
987 | return 1; /* Expand this symbol's symbol table. */ | |
988 | return 0; /* Skip this symbol. */ | |
989 | } | |
990 | ||
991 | /* A helper that walks over all matching symtabs in all objfiles and | |
992 | calls CALLBACK for each symbol matching NAME. If SEARCH_PSPACE is | |
993 | not NULL, then the search is restricted to just that program | |
994 | space. If INCLUDE_INLINE is nonzero then symbols representing | |
995 | inlined instances of functions will be included in the result. */ | |
996 | ||
997 | static void | |
998 | iterate_over_all_matching_symtabs (struct linespec_state *state, | |
999 | const char *name, | |
1000 | const domain_enum domain, | |
1001 | symbol_found_callback_ftype *callback, | |
1002 | void *data, | |
1003 | struct program_space *search_pspace, | |
1004 | int include_inline) | |
1005 | { | |
1006 | struct objfile *objfile; | |
1007 | struct program_space *pspace; | |
1008 | struct symbol_matcher_data matcher_data; | |
1009 | ||
1010 | matcher_data.lookup_name = name; | |
1011 | matcher_data.symbol_name_cmp = | |
1012 | state->language->la_get_symbol_name_cmp != NULL | |
1013 | ? state->language->la_get_symbol_name_cmp (name) | |
1014 | : strcmp_iw; | |
1015 | ||
1016 | ALL_PSPACES (pspace) | |
1017 | { | |
1018 | if (search_pspace != NULL && search_pspace != pspace) | |
1019 | continue; | |
1020 | if (pspace->executing_startup) | |
f8eba3c6 TT |
1021 | continue; |
1022 | ||
1023 | set_current_program_space (pspace); | |
50641945 | 1024 | |
f8eba3c6 TT |
1025 | ALL_OBJFILES (objfile) |
1026 | { | |
1027 | struct symtab *symtab; | |
1028 | ||
1029 | if (objfile->sf) | |
1030 | objfile->sf->qf->expand_symtabs_matching (objfile, NULL, | |
1031 | iterate_name_matcher, | |
1032 | ALL_DOMAIN, | |
74ccd7f5 | 1033 | &matcher_data); |
f8eba3c6 | 1034 | |
d790cf0a | 1035 | ALL_OBJFILE_PRIMARY_SYMTABS (objfile, symtab) |
f8eba3c6 | 1036 | { |
4eeaa230 | 1037 | iterate_over_file_blocks (symtab, name, domain, callback, data); |
481860b3 | 1038 | |
d790cf0a DE |
1039 | if (include_inline) |
1040 | { | |
1041 | struct symbol_and_data_callback cad = { callback, data }; | |
4eeaa230 | 1042 | struct block *block; |
d790cf0a | 1043 | int i; |
481860b3 | 1044 | |
d790cf0a DE |
1045 | for (i = FIRST_LOCAL_BLOCK; |
1046 | i < BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (symtab)); i++) | |
1047 | { | |
1048 | block = BLOCKVECTOR_BLOCK (BLOCKVECTOR (symtab), i); | |
4ae24af0 JB |
1049 | state->language->la_iterate_over_symbols |
1050 | (block, name, domain, iterate_inline_only, &cad); | |
481860b3 | 1051 | } |
f8eba3c6 TT |
1052 | } |
1053 | } | |
1054 | } | |
1055 | } | |
50641945 FN |
1056 | } |
1057 | ||
4eeaa230 DE |
1058 | /* Returns the block to be used for symbol searches from |
1059 | the current location. */ | |
e8eb7bc5 KS |
1060 | |
1061 | static struct block * | |
e482a1a7 | 1062 | get_current_search_block (void) |
e8eb7bc5 KS |
1063 | { |
1064 | struct block *block; | |
4eeaa230 | 1065 | enum language save_language; |
e8eb7bc5 | 1066 | |
4eeaa230 DE |
1067 | /* get_selected_block can change the current language when there is |
1068 | no selected frame yet. */ | |
1069 | save_language = current_language->la_language; | |
1070 | block = get_selected_block (0); | |
1071 | set_language (save_language); | |
e8eb7bc5 KS |
1072 | |
1073 | return block; | |
1074 | } | |
1075 | ||
4eeaa230 DE |
1076 | /* Iterate over static and global blocks. */ |
1077 | ||
1078 | static void | |
1079 | iterate_over_file_blocks (struct symtab *symtab, | |
1080 | const char *name, domain_enum domain, | |
1081 | symbol_found_callback_ftype *callback, void *data) | |
1082 | { | |
1083 | struct block *block; | |
1084 | ||
1085 | for (block = BLOCKVECTOR_BLOCK (BLOCKVECTOR (symtab), STATIC_BLOCK); | |
1086 | block != NULL; | |
1087 | block = BLOCK_SUPERBLOCK (block)) | |
1088 | LA_ITERATE_OVER_SYMBOLS (block, name, domain, callback, data); | |
1089 | } | |
1090 | ||
f8eba3c6 | 1091 | /* A helper for find_method. This finds all methods in type T which |
40e084e1 | 1092 | match NAME. It adds matching symbol names to RESULT_NAMES, and |
f8eba3c6 | 1093 | adds T's direct superclasses to SUPERCLASSES. */ |
50641945 | 1094 | |
f8eba3c6 TT |
1095 | static void |
1096 | find_methods (struct type *t, const char *name, | |
1097 | VEC (const_char_ptr) **result_names, | |
1098 | VEC (typep) **superclasses) | |
50641945 | 1099 | { |
50641945 | 1100 | int ibase; |
0d5cff50 | 1101 | const char *class_name = type_name_no_tag (t); |
c00f8484 | 1102 | |
50641945 FN |
1103 | /* Ignore this class if it doesn't have a name. This is ugly, but |
1104 | unless we figure out how to get the physname without the name of | |
1105 | the class, then the loop can't do any good. */ | |
f8eba3c6 | 1106 | if (class_name) |
50641945 FN |
1107 | { |
1108 | int method_counter; | |
1109 | ||
8bd1f2c6 | 1110 | CHECK_TYPEDEF (t); |
50641945 FN |
1111 | |
1112 | /* Loop over each method name. At this level, all overloads of a name | |
1113 | are counted as a single name. There is an inner loop which loops over | |
1114 | each overload. */ | |
1115 | ||
1116 | for (method_counter = TYPE_NFN_FIELDS (t) - 1; | |
1117 | method_counter >= 0; | |
1118 | --method_counter) | |
1119 | { | |
0d5cff50 | 1120 | const char *method_name = TYPE_FN_FIELDLIST_NAME (t, method_counter); |
50641945 FN |
1121 | char dem_opname[64]; |
1122 | ||
1123 | if (strncmp (method_name, "__", 2) == 0 || | |
1124 | strncmp (method_name, "op", 2) == 0 || | |
1125 | strncmp (method_name, "type", 4) == 0) | |
1126 | { | |
1127 | if (cplus_demangle_opname (method_name, dem_opname, DMGL_ANSI)) | |
1128 | method_name = dem_opname; | |
1129 | else if (cplus_demangle_opname (method_name, dem_opname, 0)) | |
1130 | method_name = dem_opname; | |
1131 | } | |
1132 | ||
f8eba3c6 TT |
1133 | if (strcmp_iw (method_name, name) == 0) |
1134 | { | |
1135 | int field_counter; | |
aee8d8ba | 1136 | |
f8eba3c6 TT |
1137 | for (field_counter = (TYPE_FN_FIELDLIST_LENGTH (t, method_counter) |
1138 | - 1); | |
1139 | field_counter >= 0; | |
1140 | --field_counter) | |
1141 | { | |
1142 | struct fn_field *f; | |
1143 | const char *phys_name; | |
1144 | ||
1145 | f = TYPE_FN_FIELDLIST1 (t, method_counter); | |
1146 | if (TYPE_FN_FIELD_STUB (f, field_counter)) | |
1147 | continue; | |
1148 | phys_name = TYPE_FN_FIELD_PHYSNAME (f, field_counter); | |
1149 | VEC_safe_push (const_char_ptr, *result_names, phys_name); | |
1150 | } | |
1151 | } | |
aee8d8ba DC |
1152 | } |
1153 | } | |
1154 | ||
f8eba3c6 TT |
1155 | for (ibase = 0; ibase < TYPE_N_BASECLASSES (t); ibase++) |
1156 | VEC_safe_push (typep, *superclasses, TYPE_BASECLASS (t, ibase)); | |
50641945 FN |
1157 | } |
1158 | ||
50641945 FN |
1159 | /* Find an instance of the character C in the string S that is outside |
1160 | of all parenthesis pairs, single-quoted strings, and double-quoted | |
8120c9d5 EZ |
1161 | strings. Also, ignore the char within a template name, like a ',' |
1162 | within foo<int, int>. */ | |
1163 | ||
40e084e1 KS |
1164 | static const char * |
1165 | find_toplevel_char (const char *s, char c) | |
50641945 FN |
1166 | { |
1167 | int quoted = 0; /* zero if we're not in quotes; | |
1168 | '"' if we're in a double-quoted string; | |
1169 | '\'' if we're in a single-quoted string. */ | |
a04257e6 | 1170 | int depth = 0; /* Number of unclosed parens we've seen. */ |
40e084e1 | 1171 | const char *scan; |
50641945 FN |
1172 | |
1173 | for (scan = s; *scan; scan++) | |
1174 | { | |
1175 | if (quoted) | |
1176 | { | |
1177 | if (*scan == quoted) | |
1178 | quoted = 0; | |
1179 | else if (*scan == '\\' && *(scan + 1)) | |
1180 | scan++; | |
1181 | } | |
1182 | else if (*scan == c && ! quoted && depth == 0) | |
1183 | return scan; | |
1184 | else if (*scan == '"' || *scan == '\'') | |
1185 | quoted = *scan; | |
8120c9d5 | 1186 | else if (*scan == '(' || *scan == '<') |
50641945 | 1187 | depth++; |
8120c9d5 | 1188 | else if ((*scan == ')' || *scan == '>') && depth > 0) |
50641945 FN |
1189 | depth--; |
1190 | } | |
1191 | ||
1192 | return 0; | |
1193 | } | |
1194 | ||
40e084e1 KS |
1195 | /* The string equivalent of find_toplevel_char. Returns a pointer |
1196 | to the location of NEEDLE in HAYSTACK, ignoring any occurrences | |
1197 | inside "()" and "<>". Returns NULL if NEEDLE was not found. */ | |
889f28e2 | 1198 | |
40e084e1 KS |
1199 | static const char * |
1200 | find_toplevel_string (const char *haystack, const char *needle) | |
889f28e2 | 1201 | { |
40e084e1 KS |
1202 | const char *s = haystack; |
1203 | ||
1204 | do | |
1205 | { | |
1206 | s = find_toplevel_char (s, *needle); | |
1207 | ||
1208 | if (s != NULL) | |
1209 | { | |
1210 | /* Found first char in HAYSTACK; check rest of string. */ | |
1211 | if (strncmp (s, needle, strlen (needle)) == 0) | |
1212 | return s; | |
1213 | ||
1214 | /* Didn't find it; loop over HAYSTACK, looking for the next | |
1215 | instance of the first character of NEEDLE. */ | |
1216 | ++s; | |
1217 | } | |
1218 | } | |
1219 | while (s != NULL && *s != '\0'); | |
1220 | ||
1221 | /* NEEDLE was not found in HAYSTACK. */ | |
1222 | return NULL; | |
889f28e2 AF |
1223 | } |
1224 | ||
33f448b1 JK |
1225 | /* Convert CANONICAL to its string representation using |
1226 | symtab_to_fullname for SYMTAB. The caller must xfree the result. */ | |
1227 | ||
1228 | static char * | |
1229 | canonical_to_fullform (const struct linespec_canonical_name *canonical) | |
1230 | { | |
1231 | if (canonical->symtab == NULL) | |
1232 | return xstrdup (canonical->suffix); | |
1233 | else | |
1234 | return xstrprintf ("%s:%s", symtab_to_fullname (canonical->symtab), | |
1235 | canonical->suffix); | |
1236 | } | |
1237 | ||
f8eba3c6 TT |
1238 | /* Given FILTERS, a list of canonical names, filter the sals in RESULT |
1239 | and store the result in SELF->CANONICAL. */ | |
50641945 | 1240 | |
f8eba3c6 TT |
1241 | static void |
1242 | filter_results (struct linespec_state *self, | |
1243 | struct symtabs_and_lines *result, | |
1244 | VEC (const_char_ptr) *filters) | |
1245 | { | |
1246 | int i; | |
1247 | const char *name; | |
1248 | ||
1249 | for (i = 0; VEC_iterate (const_char_ptr, filters, i, name); ++i) | |
1250 | { | |
1251 | struct linespec_sals lsal; | |
1252 | int j; | |
1253 | ||
1254 | memset (&lsal, 0, sizeof (lsal)); | |
1255 | ||
1256 | for (j = 0; j < result->nelts; ++j) | |
1257 | { | |
33f448b1 JK |
1258 | const struct linespec_canonical_name *canonical; |
1259 | char *fullform; | |
1260 | struct cleanup *cleanup; | |
1261 | ||
1262 | canonical = &self->canonical_names[j]; | |
1263 | fullform = canonical_to_fullform (canonical); | |
1264 | cleanup = make_cleanup (xfree, fullform); | |
1265 | ||
1266 | if (strcmp (name, fullform) == 0) | |
f8eba3c6 | 1267 | add_sal_to_sals_basic (&lsal.sals, &result->sals[j]); |
33f448b1 JK |
1268 | |
1269 | do_cleanups (cleanup); | |
f8eba3c6 TT |
1270 | } |
1271 | ||
1272 | if (lsal.sals.nelts > 0) | |
1273 | { | |
1274 | lsal.canonical = xstrdup (name); | |
1275 | VEC_safe_push (linespec_sals, self->canonical->sals, &lsal); | |
1276 | } | |
1277 | } | |
1278 | ||
1279 | self->canonical->pre_expanded = 0; | |
1280 | } | |
1281 | ||
1282 | /* Store RESULT into SELF->CANONICAL. */ | |
1283 | ||
1284 | static void | |
1285 | convert_results_to_lsals (struct linespec_state *self, | |
1286 | struct symtabs_and_lines *result) | |
50641945 | 1287 | { |
f8eba3c6 TT |
1288 | struct linespec_sals lsal; |
1289 | ||
1290 | lsal.canonical = NULL; | |
1291 | lsal.sals = *result; | |
1292 | VEC_safe_push (linespec_sals, self->canonical->sals, &lsal); | |
1293 | } | |
1294 | ||
33f448b1 JK |
1295 | /* A structure that contains two string representations of a struct |
1296 | linespec_canonical_name: | |
1297 | - one where the the symtab's fullname is used; | |
1298 | - one where the filename followed the "set filename-display" | |
1299 | setting. */ | |
1300 | ||
1301 | struct decode_line_2_item | |
1302 | { | |
1303 | /* The form using symtab_to_fullname. | |
1304 | It must be xfree'ed after use. */ | |
1305 | char *fullform; | |
1306 | ||
1307 | /* The form using symtab_to_filename_for_display. | |
1308 | It must be xfree'ed after use. */ | |
1309 | char *displayform; | |
1310 | ||
1311 | /* Field is initialized to zero and it is set to one if the user | |
1312 | requested breakpoint for this entry. */ | |
1313 | unsigned int selected : 1; | |
1314 | }; | |
1315 | ||
1316 | /* Helper for qsort to sort decode_line_2_item entries by DISPLAYFORM and | |
1317 | secondarily by FULLFORM. */ | |
1318 | ||
1319 | static int | |
1320 | decode_line_2_compare_items (const void *ap, const void *bp) | |
1321 | { | |
1322 | const struct decode_line_2_item *a = ap; | |
1323 | const struct decode_line_2_item *b = bp; | |
1324 | int retval; | |
1325 | ||
1326 | retval = strcmp (a->displayform, b->displayform); | |
1327 | if (retval != 0) | |
1328 | return retval; | |
1329 | ||
1330 | return strcmp (a->fullform, b->fullform); | |
1331 | } | |
1332 | ||
f8eba3c6 TT |
1333 | /* Handle multiple results in RESULT depending on SELECT_MODE. This |
1334 | will either return normally, throw an exception on multiple | |
1335 | results, or present a menu to the user. On return, the SALS vector | |
1336 | in SELF->CANONICAL is set up properly. */ | |
1337 | ||
1338 | static void | |
1339 | decode_line_2 (struct linespec_state *self, | |
1340 | struct symtabs_and_lines *result, | |
1341 | const char *select_mode) | |
1342 | { | |
f8eba3c6 | 1343 | char *args, *prompt; |
50641945 | 1344 | int i; |
50641945 | 1345 | struct cleanup *old_chain; |
33f448b1 | 1346 | VEC (const_char_ptr) *filters = NULL; |
f8eba3c6 | 1347 | struct get_number_or_range_state state; |
33f448b1 JK |
1348 | struct decode_line_2_item *items; |
1349 | int items_count; | |
50641945 | 1350 | |
f8eba3c6 TT |
1351 | gdb_assert (select_mode != multiple_symbols_all); |
1352 | gdb_assert (self->canonical != NULL); | |
33f448b1 JK |
1353 | gdb_assert (result->nelts >= 1); |
1354 | ||
1355 | old_chain = make_cleanup (VEC_cleanup (const_char_ptr), &filters); | |
50641945 | 1356 | |
33f448b1 JK |
1357 | /* Prepare ITEMS array. */ |
1358 | items_count = result->nelts; | |
1359 | items = xmalloc (sizeof (*items) * items_count); | |
1360 | make_cleanup (xfree, items); | |
1361 | for (i = 0; i < items_count; ++i) | |
50641945 | 1362 | { |
33f448b1 JK |
1363 | const struct linespec_canonical_name *canonical; |
1364 | struct decode_line_2_item *item; | |
1365 | ||
1366 | canonical = &self->canonical_names[i]; | |
1367 | gdb_assert (canonical->suffix != NULL); | |
1368 | item = &items[i]; | |
f8eba3c6 | 1369 | |
33f448b1 JK |
1370 | item->fullform = canonical_to_fullform (canonical); |
1371 | make_cleanup (xfree, item->fullform); | |
1372 | ||
1373 | if (canonical->symtab == NULL) | |
1374 | item->displayform = canonical->suffix; | |
1375 | else | |
f8eba3c6 | 1376 | { |
33f448b1 JK |
1377 | const char *fn_for_display; |
1378 | ||
1379 | fn_for_display = symtab_to_filename_for_display (canonical->symtab); | |
1380 | item->displayform = xstrprintf ("%s:%s", fn_for_display, | |
1381 | canonical->suffix); | |
1382 | make_cleanup (xfree, item->displayform); | |
f8eba3c6 TT |
1383 | } |
1384 | ||
33f448b1 | 1385 | item->selected = 0; |
50641945 FN |
1386 | } |
1387 | ||
33f448b1 JK |
1388 | /* Sort the list of method names. */ |
1389 | qsort (items, items_count, sizeof (*items), decode_line_2_compare_items); | |
1390 | ||
1391 | /* Remove entries with the same FULLFORM. */ | |
1392 | if (items_count >= 2) | |
1393 | { | |
1394 | struct decode_line_2_item *dst, *src; | |
1395 | ||
1396 | dst = items; | |
1397 | for (src = &items[1]; src < &items[items_count]; src++) | |
1398 | if (strcmp (src->fullform, dst->fullform) != 0) | |
1399 | *++dst = *src; | |
1400 | items_count = dst + 1 - items; | |
1401 | } | |
1402 | ||
1403 | if (select_mode == multiple_symbols_cancel && items_count > 1) | |
f8eba3c6 TT |
1404 | error (_("canceled because the command is ambiguous\n" |
1405 | "See set/show multiple-symbol.")); | |
1406 | ||
33f448b1 | 1407 | if (select_mode == multiple_symbols_all || items_count == 1) |
50641945 | 1408 | { |
f8eba3c6 TT |
1409 | do_cleanups (old_chain); |
1410 | convert_results_to_lsals (self, result); | |
1411 | return; | |
50641945 FN |
1412 | } |
1413 | ||
f8eba3c6 | 1414 | printf_unfiltered (_("[0] cancel\n[1] all\n")); |
33f448b1 JK |
1415 | for (i = 0; i < items_count; i++) |
1416 | printf_unfiltered ("[%d] %s\n", i + 2, items[i].displayform); | |
f8eba3c6 TT |
1417 | |
1418 | prompt = getenv ("PS2"); | |
1419 | if (prompt == NULL) | |
50641945 | 1420 | { |
f8eba3c6 | 1421 | prompt = "> "; |
50641945 | 1422 | } |
f8eba3c6 | 1423 | args = command_line_input (prompt, 0, "overload-choice"); |
50641945 FN |
1424 | |
1425 | if (args == 0 || *args == 0) | |
e2e0b3e5 | 1426 | error_no_arg (_("one or more choice numbers")); |
50641945 | 1427 | |
f8eba3c6 TT |
1428 | init_number_or_range (&state, args); |
1429 | while (!state.finished) | |
50641945 FN |
1430 | { |
1431 | int num; | |
1432 | ||
f8eba3c6 | 1433 | num = get_number_or_range (&state); |
50641945 FN |
1434 | |
1435 | if (num == 0) | |
8a3fe4f8 | 1436 | error (_("canceled")); |
50641945 FN |
1437 | else if (num == 1) |
1438 | { | |
f8eba3c6 TT |
1439 | /* We intentionally make this result in a single breakpoint, |
1440 | contrary to what older versions of gdb did. The | |
1441 | rationale is that this lets a user get the | |
1442 | multiple_symbols_all behavior even with the 'ask' | |
1443 | setting; and he can get separate breakpoints by entering | |
1444 | "2-57" at the query. */ | |
1445 | do_cleanups (old_chain); | |
1446 | convert_results_to_lsals (self, result); | |
1447 | return; | |
50641945 FN |
1448 | } |
1449 | ||
f8eba3c6 | 1450 | num -= 2; |
33f448b1 | 1451 | if (num >= items_count) |
f8eba3c6 | 1452 | printf_unfiltered (_("No choice number %d.\n"), num); |
50641945 FN |
1453 | else |
1454 | { | |
33f448b1 | 1455 | struct decode_line_2_item *item = &items[num]; |
f8eba3c6 | 1456 | |
33f448b1 | 1457 | if (!item->selected) |
50641945 | 1458 | { |
33f448b1 JK |
1459 | VEC_safe_push (const_char_ptr, filters, item->fullform); |
1460 | item->selected = 1; | |
50641945 FN |
1461 | } |
1462 | else | |
1463 | { | |
3e43a32a | 1464 | printf_unfiltered (_("duplicate request for %d ignored.\n"), |
f6f99966 | 1465 | num + 2); |
50641945 FN |
1466 | } |
1467 | } | |
50641945 | 1468 | } |
f8eba3c6 TT |
1469 | |
1470 | filter_results (self, result, filters); | |
1471 | do_cleanups (old_chain); | |
50641945 | 1472 | } |
94af9270 | 1473 | |
40e084e1 | 1474 | \f |
3d50dd94 | 1475 | |
40e084e1 KS |
1476 | /* The parser of linespec itself. */ |
1477 | ||
1478 | /* Throw an appropriate error when SYMBOL is not found (optionally in | |
1479 | FILENAME). */ | |
1480 | ||
1481 | static void ATTRIBUTE_NORETURN | |
5d94e27b | 1482 | symbol_not_found_error (const char *symbol, const char *filename) |
3d50dd94 | 1483 | { |
40e084e1 KS |
1484 | if (symbol == NULL) |
1485 | symbol = ""; | |
1486 | ||
1487 | if (!have_full_symbols () | |
1488 | && !have_partial_symbols () | |
1489 | && !have_minimal_symbols ()) | |
1490 | throw_error (NOT_FOUND_ERROR, | |
1491 | _("No symbol table is loaded. Use the \"file\" command.")); | |
1492 | ||
1493 | /* If SYMBOL starts with '$', the user attempted to either lookup | |
1494 | a function/variable in his code starting with '$' or an internal | |
1495 | variable of that name. Since we do not know which, be concise and | |
1496 | explain both possibilities. */ | |
1497 | if (*symbol == '$') | |
1498 | { | |
1499 | if (filename) | |
1500 | throw_error (NOT_FOUND_ERROR, | |
1501 | _("Undefined convenience variable or function \"%s\" " | |
1502 | "not defined in \"%s\"."), symbol, filename); | |
1503 | else | |
1504 | throw_error (NOT_FOUND_ERROR, | |
1505 | _("Undefined convenience variable or function \"%s\" " | |
1506 | "not defined."), symbol); | |
1507 | } | |
1508 | else | |
1509 | { | |
1510 | if (filename) | |
1511 | throw_error (NOT_FOUND_ERROR, | |
1512 | _("Function \"%s\" not defined in \"%s\"."), | |
1513 | symbol, filename); | |
1514 | else | |
1515 | throw_error (NOT_FOUND_ERROR, | |
1516 | _("Function \"%s\" not defined."), symbol); | |
1517 | } | |
3d50dd94 JK |
1518 | } |
1519 | ||
40e084e1 KS |
1520 | /* Throw an appropriate error when an unexpected token is encountered |
1521 | in the input. */ | |
94af9270 | 1522 | |
40e084e1 KS |
1523 | static void ATTRIBUTE_NORETURN |
1524 | unexpected_linespec_error (linespec_parser *parser) | |
94af9270 | 1525 | { |
40e084e1 KS |
1526 | linespec_token token; |
1527 | static const char * token_type_strings[] | |
1528 | = {"keyword", "colon", "string", "number", "comma", "end of input"}; | |
94af9270 | 1529 | |
40e084e1 KS |
1530 | /* Get the token that generated the error. */ |
1531 | token = linespec_lexer_lex_one (parser); | |
94af9270 | 1532 | |
40e084e1 KS |
1533 | /* Finally, throw the error. */ |
1534 | if (token.type == LSTOKEN_STRING || token.type == LSTOKEN_NUMBER | |
1535 | || token.type == LSTOKEN_KEYWORD) | |
94af9270 | 1536 | { |
40e084e1 KS |
1537 | char *string; |
1538 | struct cleanup *cleanup; | |
1539 | ||
1540 | string = copy_token_string (token); | |
1541 | cleanup = make_cleanup (xfree, string); | |
1542 | throw_error (GENERIC_ERROR, | |
1543 | _("malformed linespec error: unexpected %s, \"%s\""), | |
1544 | token_type_strings[token.type], string); | |
1545 | } | |
1546 | else | |
1547 | throw_error (GENERIC_ERROR, | |
1548 | _("malformed linespec error: unexpected %s"), | |
1549 | token_type_strings[token.type]); | |
1550 | } | |
1551 | ||
1552 | /* Parse and return a line offset in STRING. */ | |
1553 | ||
1554 | static struct line_offset | |
09cf2b22 | 1555 | linespec_parse_line_offset (const char *string) |
40e084e1 KS |
1556 | { |
1557 | struct line_offset line_offset = {0, LINE_OFFSET_NONE}; | |
1558 | ||
1559 | if (*string == '+') | |
1560 | { | |
1561 | line_offset.sign = LINE_OFFSET_PLUS; | |
1562 | ++string; | |
1563 | } | |
1564 | else if (*string == '-') | |
1565 | { | |
1566 | line_offset.sign = LINE_OFFSET_MINUS; | |
1567 | ++string; | |
1568 | } | |
1569 | ||
1570 | /* Right now, we only allow base 10 for offsets. */ | |
1571 | line_offset.offset = atoi (string); | |
1572 | return line_offset; | |
1573 | } | |
1574 | ||
1575 | /* Parse the basic_spec in PARSER's input. */ | |
1576 | ||
1577 | static void | |
1578 | linespec_parse_basic (linespec_parser *parser) | |
1579 | { | |
1580 | char *name; | |
1581 | linespec_token token; | |
1582 | VEC (symbolp) *symbols, *labels; | |
f60e2d5c | 1583 | VEC (bound_minimal_symbol_d) *minimal_symbols; |
40e084e1 KS |
1584 | struct cleanup *cleanup; |
1585 | ||
1586 | /* Get the next token. */ | |
1587 | token = linespec_lexer_lex_one (parser); | |
1588 | ||
1589 | /* If it is EOI or KEYWORD, issue an error. */ | |
1590 | if (token.type == LSTOKEN_KEYWORD || token.type == LSTOKEN_EOI) | |
1591 | unexpected_linespec_error (parser); | |
1592 | /* If it is a LSTOKEN_NUMBER, we have an offset. */ | |
1593 | else if (token.type == LSTOKEN_NUMBER) | |
1594 | { | |
1595 | /* Record the line offset and get the next token. */ | |
1596 | name = copy_token_string (token); | |
1597 | cleanup = make_cleanup (xfree, name); | |
1598 | PARSER_RESULT (parser)->line_offset = linespec_parse_line_offset (name); | |
1599 | do_cleanups (cleanup); | |
1600 | ||
1601 | /* Get the next token. */ | |
1602 | token = linespec_lexer_consume_token (parser); | |
1603 | ||
1604 | /* If the next token is a comma, stop parsing and return. */ | |
1605 | if (token.type == LSTOKEN_COMMA) | |
1606 | return; | |
1607 | ||
1608 | /* If the next token is anything but EOI or KEYWORD, issue | |
1609 | an error. */ | |
1610 | if (token.type != LSTOKEN_KEYWORD && token.type != LSTOKEN_EOI) | |
1611 | unexpected_linespec_error (parser); | |
1612 | } | |
1613 | ||
1614 | if (token.type == LSTOKEN_KEYWORD || token.type == LSTOKEN_EOI) | |
1615 | return; | |
1616 | ||
1617 | /* Next token must be LSTOKEN_STRING. */ | |
1618 | if (token.type != LSTOKEN_STRING) | |
1619 | unexpected_linespec_error (parser); | |
1620 | ||
1621 | /* The current token will contain the name of a function, method, | |
1622 | or label. */ | |
1623 | name = copy_token_string (token); | |
1624 | cleanup = make_cleanup (xfree, name); | |
1625 | ||
1626 | /* Try looking it up as a function/method. */ | |
1627 | find_linespec_symbols (PARSER_STATE (parser), | |
1628 | PARSER_RESULT (parser)->file_symtabs, name, | |
1629 | &symbols, &minimal_symbols); | |
1630 | ||
1631 | if (symbols != NULL || minimal_symbols != NULL) | |
1632 | { | |
1633 | PARSER_RESULT (parser)->function_symbols = symbols; | |
1634 | PARSER_RESULT (parser)->minimal_symbols = minimal_symbols; | |
1635 | PARSER_RESULT (parser)->function_name = name; | |
1636 | symbols = NULL; | |
1637 | discard_cleanups (cleanup); | |
1638 | } | |
1639 | else | |
1640 | { | |
1641 | /* NAME was not a function or a method. So it must be a label | |
b4013987 | 1642 | name or user specified variable like "break foo.c:$zippo". */ |
40e084e1 KS |
1643 | labels = find_label_symbols (PARSER_STATE (parser), NULL, |
1644 | &symbols, name); | |
1645 | if (labels != NULL) | |
94af9270 | 1646 | { |
40e084e1 KS |
1647 | PARSER_RESULT (parser)->labels.label_symbols = labels; |
1648 | PARSER_RESULT (parser)->labels.function_symbols = symbols; | |
1649 | PARSER_RESULT (parser)->label_name = name; | |
1650 | symbols = NULL; | |
1651 | discard_cleanups (cleanup); | |
1652 | } | |
b4013987 AA |
1653 | else if (token.type == LSTOKEN_STRING |
1654 | && *LS_TOKEN_STOKEN (token).ptr == '$') | |
1655 | { | |
1656 | /* User specified a convenience variable or history value. */ | |
1657 | PARSER_RESULT (parser)->line_offset | |
1658 | = linespec_parse_variable (PARSER_STATE (parser), name); | |
1659 | ||
1660 | if (PARSER_RESULT (parser)->line_offset.sign == LINE_OFFSET_UNKNOWN) | |
1661 | { | |
1662 | /* The user-specified variable was not valid. Do not | |
1663 | throw an error here. parse_linespec will do it for us. */ | |
1664 | PARSER_RESULT (parser)->function_name = name; | |
1665 | discard_cleanups (cleanup); | |
1666 | return; | |
1667 | } | |
1668 | } | |
40e084e1 KS |
1669 | else |
1670 | { | |
1671 | /* The name is also not a label. Abort parsing. Do not throw | |
1672 | an error here. parse_linespec will do it for us. */ | |
1673 | ||
1674 | /* Save a copy of the name we were trying to lookup. */ | |
1675 | PARSER_RESULT (parser)->function_name = name; | |
1676 | discard_cleanups (cleanup); | |
1677 | return; | |
1678 | } | |
1679 | } | |
1680 | ||
1681 | /* Get the next token. */ | |
1682 | token = linespec_lexer_consume_token (parser); | |
1683 | ||
1684 | if (token.type == LSTOKEN_COLON) | |
1685 | { | |
1686 | /* User specified a label or a lineno. */ | |
1687 | token = linespec_lexer_consume_token (parser); | |
1688 | ||
1689 | if (token.type == LSTOKEN_NUMBER) | |
1690 | { | |
1691 | /* User specified an offset. Record the line offset and | |
1692 | get the next token. */ | |
1693 | name = copy_token_string (token); | |
1694 | cleanup = make_cleanup (xfree, name); | |
1695 | PARSER_RESULT (parser)->line_offset | |
1696 | = linespec_parse_line_offset (name); | |
1697 | do_cleanups (cleanup); | |
1698 | ||
1699 | /* Ge the next token. */ | |
1700 | token = linespec_lexer_consume_token (parser); | |
1701 | } | |
1702 | else if (token.type == LSTOKEN_STRING) | |
1703 | { | |
1704 | /* Grab a copy of the label's name and look it up. */ | |
1705 | name = copy_token_string (token); | |
1706 | cleanup = make_cleanup (xfree, name); | |
1707 | labels = find_label_symbols (PARSER_STATE (parser), | |
1708 | PARSER_RESULT (parser)->function_symbols, | |
1709 | &symbols, name); | |
1710 | ||
1711 | if (labels != NULL) | |
94af9270 | 1712 | { |
40e084e1 KS |
1713 | PARSER_RESULT (parser)->labels.label_symbols = labels; |
1714 | PARSER_RESULT (parser)->labels.function_symbols = symbols; | |
1715 | PARSER_RESULT (parser)->label_name = name; | |
1716 | symbols = NULL; | |
1717 | discard_cleanups (cleanup); | |
1718 | } | |
1719 | else | |
1720 | { | |
1721 | /* We don't know what it was, but it isn't a label. */ | |
1722 | throw_error (NOT_FOUND_ERROR, | |
1723 | _("No label \"%s\" defined in function \"%s\"."), | |
1724 | name, PARSER_RESULT (parser)->function_name); | |
1725 | } | |
1726 | ||
1727 | /* Check for a line offset. */ | |
1728 | token = linespec_lexer_consume_token (parser); | |
1729 | if (token.type == LSTOKEN_COLON) | |
1730 | { | |
1731 | /* Get the next token. */ | |
1732 | token = linespec_lexer_consume_token (parser); | |
1733 | ||
1734 | /* It must be a line offset. */ | |
1735 | if (token.type != LSTOKEN_NUMBER) | |
1736 | unexpected_linespec_error (parser); | |
1737 | ||
1738 | /* Record the lione offset and get the next token. */ | |
1739 | name = copy_token_string (token); | |
1740 | cleanup = make_cleanup (xfree, name); | |
1741 | ||
1742 | PARSER_RESULT (parser)->line_offset | |
1743 | = linespec_parse_line_offset (name); | |
1744 | do_cleanups (cleanup); | |
1745 | ||
1746 | /* Get the next token. */ | |
1747 | token = linespec_lexer_consume_token (parser); | |
94af9270 KS |
1748 | } |
1749 | } | |
40e084e1 KS |
1750 | else |
1751 | { | |
1752 | /* Trailing ':' in the input. Issue an error. */ | |
1753 | unexpected_linespec_error (parser); | |
1754 | } | |
94af9270 | 1755 | } |
40e084e1 | 1756 | } |
94af9270 | 1757 | |
40e084e1 KS |
1758 | /* Canonicalize the linespec contained in LS. The result is saved into |
1759 | STATE->canonical. */ | |
1760 | ||
1761 | static void | |
1762 | canonicalize_linespec (struct linespec_state *state, linespec_p ls) | |
1763 | { | |
1764 | /* If canonicalization was not requested, no need to do anything. */ | |
1765 | if (!state->canonical) | |
1766 | return; | |
1767 | ||
1768 | /* Shortcut expressions, which can only appear by themselves. */ | |
1769 | if (ls->expression != NULL) | |
1770 | state->canonical->addr_string = xstrdup (ls->expression); | |
1771 | else | |
1772 | { | |
1773 | struct ui_file *buf; | |
1774 | int need_colon = 0; | |
1775 | ||
1776 | buf = mem_fileopen (); | |
1777 | if (ls->source_filename) | |
1778 | { | |
1779 | fputs_unfiltered (ls->source_filename, buf); | |
1780 | need_colon = 1; | |
1781 | } | |
1782 | ||
1783 | if (ls->function_name) | |
1784 | { | |
1785 | if (need_colon) | |
1786 | fputc_unfiltered (':', buf); | |
1787 | fputs_unfiltered (ls->function_name, buf); | |
1788 | need_colon = 1; | |
1789 | } | |
1790 | ||
1791 | if (ls->label_name) | |
1792 | { | |
1793 | if (need_colon) | |
1794 | fputc_unfiltered (':', buf); | |
1795 | ||
1796 | if (ls->function_name == NULL) | |
1797 | { | |
1798 | struct symbol *s; | |
1799 | ||
1800 | /* No function was specified, so add the symbol name. */ | |
1801 | gdb_assert (ls->labels.function_symbols != NULL | |
1802 | && (VEC_length (symbolp, ls->labels.function_symbols) | |
1803 | == 1)); | |
1804 | s = VEC_index (symbolp, ls->labels.function_symbols, 0); | |
1805 | fputs_unfiltered (SYMBOL_NATURAL_NAME (s), buf); | |
1806 | fputc_unfiltered (':', buf); | |
1807 | } | |
1808 | ||
1809 | fputs_unfiltered (ls->label_name, buf); | |
1810 | need_colon = 1; | |
1811 | state->canonical->special_display = 1; | |
1812 | } | |
1813 | ||
1814 | if (ls->line_offset.sign != LINE_OFFSET_UNKNOWN) | |
1815 | { | |
1816 | if (need_colon) | |
1817 | fputc_unfiltered (':', buf); | |
1818 | fprintf_filtered (buf, "%s%d", | |
1819 | (ls->line_offset.sign == LINE_OFFSET_NONE ? "" | |
1820 | : (ls->line_offset.sign | |
1821 | == LINE_OFFSET_PLUS ? "+" : "-")), | |
1822 | ls->line_offset.offset); | |
1823 | } | |
1824 | ||
1825 | state->canonical->addr_string = ui_file_xstrdup (buf, NULL); | |
1826 | ui_file_delete (buf); | |
1827 | } | |
94af9270 | 1828 | } |
c00f8484 | 1829 | |
40e084e1 | 1830 | /* Given a line offset in LS, construct the relevant SALs. */ |
c00f8484 | 1831 | |
40e084e1 KS |
1832 | static struct symtabs_and_lines |
1833 | create_sals_line_offset (struct linespec_state *self, | |
1834 | linespec_p ls) | |
c00f8484 | 1835 | { |
40e084e1 KS |
1836 | struct symtabs_and_lines values; |
1837 | struct symtab_and_line val; | |
1838 | int use_default = 0; | |
c00f8484 | 1839 | |
40e084e1 KS |
1840 | init_sal (&val); |
1841 | values.sals = NULL; | |
1842 | values.nelts = 0; | |
1843 | ||
1844 | /* This is where we need to make sure we have good defaults. | |
1845 | We must guarantee that this section of code is never executed | |
2e47c6ca | 1846 | when we are called with just a function name, since |
40e084e1 KS |
1847 | set_default_source_symtab_and_line uses |
1848 | select_source_symtab that calls us with such an argument. */ | |
1849 | ||
ec94af83 DE |
1850 | if (VEC_length (symtab_ptr, ls->file_symtabs) == 1 |
1851 | && VEC_index (symtab_ptr, ls->file_symtabs, 0) == NULL) | |
3d50dd94 | 1852 | { |
05cba821 JK |
1853 | const char *fullname; |
1854 | ||
40e084e1 | 1855 | set_current_program_space (self->program_space); |
c00f8484 | 1856 | |
40e084e1 KS |
1857 | /* Make sure we have at least a default source line. */ |
1858 | set_default_source_symtab_and_line (); | |
1859 | initialize_defaults (&self->default_symtab, &self->default_line); | |
05cba821 | 1860 | fullname = symtab_to_fullname (self->default_symtab); |
ec94af83 DE |
1861 | VEC_pop (symtab_ptr, ls->file_symtabs); |
1862 | VEC_free (symtab_ptr, ls->file_symtabs); | |
05cba821 | 1863 | ls->file_symtabs = collect_symtabs_from_filename (fullname); |
40e084e1 KS |
1864 | use_default = 1; |
1865 | } | |
c00f8484 | 1866 | |
40e084e1 KS |
1867 | val.line = ls->line_offset.offset; |
1868 | switch (ls->line_offset.sign) | |
1869 | { | |
1870 | case LINE_OFFSET_PLUS: | |
1871 | if (ls->line_offset.offset == 0) | |
1872 | val.line = 5; | |
1873 | if (use_default) | |
1874 | val.line = self->default_line + val.line; | |
1875 | break; | |
1876 | ||
1877 | case LINE_OFFSET_MINUS: | |
1878 | if (ls->line_offset.offset == 0) | |
1879 | val.line = 15; | |
1880 | if (use_default) | |
1881 | val.line = self->default_line - val.line; | |
1882 | else | |
1883 | val.line = -val.line; | |
1884 | break; | |
1885 | ||
1886 | case LINE_OFFSET_NONE: | |
1887 | break; /* No need to adjust val.line. */ | |
1888 | } | |
1889 | ||
1890 | if (self->list_mode) | |
1891 | decode_digits_list_mode (self, ls, &values, val); | |
1892 | else | |
1893 | { | |
1894 | struct linetable_entry *best_entry = NULL; | |
1895 | int *filter; | |
1896 | struct block **blocks; | |
1897 | struct cleanup *cleanup; | |
1898 | struct symtabs_and_lines intermediate_results; | |
1899 | int i, j; | |
1900 | ||
1901 | intermediate_results.sals = NULL; | |
1902 | intermediate_results.nelts = 0; | |
1903 | ||
1904 | decode_digits_ordinary (self, ls, val.line, &intermediate_results, | |
1905 | &best_entry); | |
1906 | if (intermediate_results.nelts == 0 && best_entry != NULL) | |
1907 | decode_digits_ordinary (self, ls, best_entry->line, | |
1908 | &intermediate_results, &best_entry); | |
1909 | ||
1910 | cleanup = make_cleanup (xfree, intermediate_results.sals); | |
1911 | ||
1912 | /* For optimized code, the compiler can scatter one source line | |
1913 | across disjoint ranges of PC values, even when no duplicate | |
1914 | functions or inline functions are involved. For example, | |
1915 | 'for (;;)' inside a non-template, non-inline, and non-ctor-or-dtor | |
1916 | function can result in two PC ranges. In this case, we don't | |
1917 | want to set a breakpoint on the first PC of each range. To filter | |
1918 | such cases, we use containing blocks -- for each PC found | |
1919 | above, we see if there are other PCs that are in the same | |
1920 | block. If yes, the other PCs are filtered out. */ | |
1921 | ||
1922 | filter = XNEWVEC (int, intermediate_results.nelts); | |
1923 | make_cleanup (xfree, filter); | |
1924 | blocks = XNEWVEC (struct block *, intermediate_results.nelts); | |
1925 | make_cleanup (xfree, blocks); | |
1926 | ||
1927 | for (i = 0; i < intermediate_results.nelts; ++i) | |
3d50dd94 | 1928 | { |
40e084e1 | 1929 | set_current_program_space (intermediate_results.sals[i].pspace); |
c00f8484 | 1930 | |
40e084e1 KS |
1931 | filter[i] = 1; |
1932 | blocks[i] = block_for_pc_sect (intermediate_results.sals[i].pc, | |
1933 | intermediate_results.sals[i].section); | |
3d50dd94 | 1934 | } |
c00f8484 | 1935 | |
40e084e1 KS |
1936 | for (i = 0; i < intermediate_results.nelts; ++i) |
1937 | { | |
1938 | if (blocks[i] != NULL) | |
1939 | for (j = i + 1; j < intermediate_results.nelts; ++j) | |
1940 | { | |
1941 | if (blocks[j] == blocks[i]) | |
1942 | { | |
1943 | filter[j] = 0; | |
1944 | break; | |
1945 | } | |
1946 | } | |
1947 | } | |
c00f8484 | 1948 | |
40e084e1 KS |
1949 | for (i = 0; i < intermediate_results.nelts; ++i) |
1950 | if (filter[i]) | |
1951 | { | |
1952 | struct symbol *sym = (blocks[i] | |
1953 | ? block_containing_function (blocks[i]) | |
1954 | : NULL); | |
3d50dd94 | 1955 | |
40e084e1 KS |
1956 | if (self->funfirstline) |
1957 | skip_prologue_sal (&intermediate_results.sals[i]); | |
1958 | /* Make sure the line matches the request, not what was | |
1959 | found. */ | |
1960 | intermediate_results.sals[i].line = val.line; | |
1961 | add_sal_to_sals (self, &values, &intermediate_results.sals[i], | |
66f1999b | 1962 | sym ? SYMBOL_NATURAL_NAME (sym) : NULL, 0); |
40e084e1 | 1963 | } |
3d50dd94 | 1964 | |
40e084e1 | 1965 | do_cleanups (cleanup); |
f17170e5 | 1966 | } |
c00f8484 | 1967 | |
40e084e1 KS |
1968 | if (values.nelts == 0) |
1969 | { | |
1970 | if (ls->source_filename) | |
1971 | throw_error (NOT_FOUND_ERROR, _("No line %d in file \"%s\"."), | |
1972 | val.line, ls->source_filename); | |
1973 | else | |
1974 | throw_error (NOT_FOUND_ERROR, _("No line %d in the current file."), | |
1975 | val.line); | |
1976 | } | |
3d50dd94 | 1977 | |
40e084e1 | 1978 | return values; |
c00f8484 KS |
1979 | } |
1980 | ||
40e084e1 KS |
1981 | /* Create and return SALs from the linespec LS. */ |
1982 | ||
1983 | static struct symtabs_and_lines | |
1984 | convert_linespec_to_sals (struct linespec_state *state, linespec_p ls) | |
1985 | { | |
1986 | struct symtabs_and_lines sals = {NULL, 0}; | |
1987 | ||
1988 | if (ls->expression != NULL) | |
1989 | { | |
66f1999b KS |
1990 | struct symtab_and_line sal; |
1991 | ||
40e084e1 | 1992 | /* We have an expression. No other attribute is allowed. */ |
66f1999b KS |
1993 | sal = find_pc_line (ls->expr_pc, 0); |
1994 | sal.pc = ls->expr_pc; | |
1995 | sal.section = find_pc_overlay (ls->expr_pc); | |
1996 | sal.explicit_pc = 1; | |
1997 | add_sal_to_sals (state, &sals, &sal, ls->expression, 1); | |
40e084e1 KS |
1998 | } |
1999 | else if (ls->labels.label_symbols != NULL) | |
2000 | { | |
2001 | /* We have just a bunch of functions/methods or labels. */ | |
2002 | int i; | |
2003 | struct symtab_and_line sal; | |
2004 | struct symbol *sym; | |
2005 | ||
2006 | for (i = 0; VEC_iterate (symbolp, ls->labels.label_symbols, i, sym); ++i) | |
2007 | { | |
fdbb204b TT |
2008 | struct program_space *pspace = SYMTAB_PSPACE (SYMBOL_SYMTAB (sym)); |
2009 | ||
2010 | if (symbol_to_sal (&sal, state->funfirstline, sym) | |
2011 | && maybe_add_address (state->addr_set, pspace, sal.pc)) | |
64b92e45 KS |
2012 | add_sal_to_sals (state, &sals, &sal, |
2013 | SYMBOL_NATURAL_NAME (sym), 0); | |
40e084e1 KS |
2014 | } |
2015 | } | |
2016 | else if (ls->function_symbols != NULL || ls->minimal_symbols != NULL) | |
2017 | { | |
2018 | /* We have just a bunch of functions and/or methods. */ | |
2019 | int i; | |
2020 | struct symtab_and_line sal; | |
2021 | struct symbol *sym; | |
f60e2d5c | 2022 | bound_minimal_symbol_d *elem; |
40e084e1 KS |
2023 | struct program_space *pspace; |
2024 | ||
2025 | if (ls->function_symbols != NULL) | |
2026 | { | |
2027 | /* Sort symbols so that symbols with the same program space are next | |
2028 | to each other. */ | |
2029 | qsort (VEC_address (symbolp, ls->function_symbols), | |
2030 | VEC_length (symbolp, ls->function_symbols), | |
2031 | sizeof (symbolp), compare_symbols); | |
2032 | ||
2033 | for (i = 0; VEC_iterate (symbolp, ls->function_symbols, i, sym); ++i) | |
2034 | { | |
2035 | pspace = SYMTAB_PSPACE (SYMBOL_SYMTAB (sym)); | |
2036 | set_current_program_space (pspace); | |
64b92e45 KS |
2037 | if (symbol_to_sal (&sal, state->funfirstline, sym) |
2038 | && maybe_add_address (state->addr_set, pspace, sal.pc)) | |
66f1999b KS |
2039 | add_sal_to_sals (state, &sals, &sal, |
2040 | SYMBOL_NATURAL_NAME (sym), 0); | |
40e084e1 KS |
2041 | } |
2042 | } | |
2043 | ||
2044 | if (ls->minimal_symbols != NULL) | |
2045 | { | |
2046 | /* Sort minimal symbols by program space, too. */ | |
f60e2d5c TT |
2047 | qsort (VEC_address (bound_minimal_symbol_d, ls->minimal_symbols), |
2048 | VEC_length (bound_minimal_symbol_d, ls->minimal_symbols), | |
2049 | sizeof (bound_minimal_symbol_d), compare_msymbols); | |
40e084e1 KS |
2050 | |
2051 | for (i = 0; | |
f60e2d5c TT |
2052 | VEC_iterate (bound_minimal_symbol_d, ls->minimal_symbols, |
2053 | i, elem); | |
40e084e1 KS |
2054 | ++i) |
2055 | { | |
001822aa | 2056 | pspace = elem->objfile->pspace; |
40e084e1 KS |
2057 | set_current_program_space (pspace); |
2058 | minsym_found (state, elem->objfile, elem->minsym, &sals); | |
2059 | } | |
2060 | } | |
2061 | } | |
2062 | else if (ls->line_offset.sign != LINE_OFFSET_UNKNOWN) | |
2063 | { | |
2064 | /* Only an offset was specified. */ | |
2065 | sals = create_sals_line_offset (state, ls); | |
2066 | ||
2067 | /* Make sure we have a filename for canonicalization. */ | |
2068 | if (ls->source_filename == NULL) | |
05cba821 JK |
2069 | { |
2070 | const char *fullname = symtab_to_fullname (state->default_symtab); | |
2071 | ||
e93ba630 JK |
2072 | /* It may be more appropriate to keep DEFAULT_SYMTAB in its symtab |
2073 | form so that displaying SOURCE_FILENAME can follow the current | |
2074 | FILENAME_DISPLAY_STRING setting. But as it is used only rarely | |
2075 | it has been kept for code simplicity only in absolute form. */ | |
05cba821 JK |
2076 | ls->source_filename = xstrdup (fullname); |
2077 | } | |
40e084e1 KS |
2078 | } |
2079 | else | |
2080 | { | |
2081 | /* We haven't found any results... */ | |
2082 | return sals; | |
2083 | } | |
2084 | ||
2085 | canonicalize_linespec (state, ls); | |
2086 | ||
2087 | if (sals.nelts > 0 && state->canonical != NULL) | |
2088 | state->canonical->pre_expanded = 1; | |
2089 | ||
2090 | return sals; | |
2091 | } | |
50641945 | 2092 | |
40e084e1 | 2093 | /* Parse a string that specifies a linespec. |
50641945 FN |
2094 | Pass the address of a char * variable; that variable will be |
2095 | advanced over the characters actually parsed. | |
2096 | ||
40e084e1 | 2097 | The basic grammar of linespecs: |
50641945 | 2098 | |
40e084e1 KS |
2099 | linespec -> expr_spec | var_spec | basic_spec |
2100 | expr_spec -> '*' STRING | |
2101 | var_spec -> '$' (STRING | NUMBER) | |
50641945 | 2102 | |
40e084e1 KS |
2103 | basic_spec -> file_offset_spec | function_spec | label_spec |
2104 | file_offset_spec -> opt_file_spec offset_spec | |
2105 | function_spec -> opt_file_spec function_name_spec opt_label_spec | |
2106 | label_spec -> label_name_spec | |
50641945 | 2107 | |
40e084e1 KS |
2108 | opt_file_spec -> "" | file_name_spec ':' |
2109 | opt_label_spec -> "" | ':' label_name_spec | |
2110 | ||
2111 | file_name_spec -> STRING | |
2112 | function_name_spec -> STRING | |
2113 | label_name_spec -> STRING | |
2114 | function_name_spec -> STRING | |
2115 | offset_spec -> NUMBER | |
2116 | -> '+' NUMBER | |
2117 | -> '-' NUMBER | |
2118 | ||
2119 | This may all be followed by several keywords such as "if EXPR", | |
2120 | which we ignore. | |
2121 | ||
2122 | A comma will terminate parsing. | |
2123 | ||
2124 | The function may be an undebuggable function found in minimal symbol table. | |
50641945 FN |
2125 | |
2126 | If the argument FUNFIRSTLINE is nonzero, we want the first line | |
2127 | of real code inside a function when a function is specified, and it is | |
2128 | not OK to specify a variable or type to get its line number. | |
2129 | ||
2130 | DEFAULT_SYMTAB specifies the file to use if none is specified. | |
2131 | It defaults to current_source_symtab. | |
2132 | DEFAULT_LINE specifies the line number to use for relative | |
2133 | line numbers (that start with signs). Defaults to current_source_line. | |
2134 | If CANONICAL is non-NULL, store an array of strings containing the canonical | |
1777feb0 | 2135 | line specs there if necessary. Currently overloaded member functions and |
50641945 | 2136 | line numbers or static functions without a filename yield a canonical |
1777feb0 | 2137 | line spec. The array and the line spec strings are allocated on the heap, |
50641945 FN |
2138 | it is the callers responsibility to free them. |
2139 | ||
2140 | Note that it is possible to return zero for the symtab | |
2141 | if no file is validly specified. Callers must check that. | |
58438ac1 | 2142 | Also, the line number returned may be invalid. */ |
50641945 | 2143 | |
40e084e1 | 2144 | /* Parse the linespec in ARGPTR. */ |
50641945 | 2145 | |
ad32032e | 2146 | static struct symtabs_and_lines |
d7561cbb | 2147 | parse_linespec (linespec_parser *parser, const char **argptr) |
50641945 | 2148 | { |
40e084e1 KS |
2149 | linespec_token token; |
2150 | struct symtabs_and_lines values; | |
9ef07c8c | 2151 | volatile struct gdb_exception file_exception; |
40e084e1 KS |
2152 | struct cleanup *cleanup; |
2153 | ||
2154 | /* A special case to start. It has become quite popular for | |
2155 | IDEs to work around bugs in the previous parser by quoting | |
2156 | the entire linespec, so we attempt to deal with this nicely. */ | |
2157 | parser->is_quote_enclosed = 0; | |
2158 | if (!is_ada_operator (*argptr) | |
2159 | && strchr (linespec_quote_characters, **argptr) != NULL) | |
2160 | { | |
2161 | const char *end; | |
9ef07c8c | 2162 | |
40e084e1 KS |
2163 | end = skip_quote_char (*argptr + 1, **argptr); |
2164 | if (end != NULL && is_closing_quote_enclosed (end)) | |
136e1c30 | 2165 | { |
40e084e1 KS |
2166 | /* Here's the special case. Skip ARGPTR past the initial |
2167 | quote. */ | |
2168 | ++(*argptr); | |
2169 | parser->is_quote_enclosed = 1; | |
136e1c30 DE |
2170 | } |
2171 | } | |
e8eb7bc5 | 2172 | |
7c09e5a0 DE |
2173 | /* A keyword at the start cannot be interpreted as such. |
2174 | Consider "b thread thread 42". */ | |
2175 | parser->keyword_ok = 0; | |
2176 | ||
40e084e1 KS |
2177 | parser->lexer.saved_arg = *argptr; |
2178 | parser->lexer.stream = argptr; | |
2179 | file_exception.reason = 0; | |
d2630e69 | 2180 | |
40e084e1 KS |
2181 | /* Initialize the default symtab and line offset. */ |
2182 | initialize_defaults (&PARSER_STATE (parser)->default_symtab, | |
2183 | &PARSER_STATE (parser)->default_line); | |
d2630e69 | 2184 | |
40e084e1 KS |
2185 | /* Objective-C shortcut. */ |
2186 | values = decode_objc (PARSER_STATE (parser), PARSER_RESULT (parser), argptr); | |
2187 | if (values.sals != NULL) | |
2188 | return values; | |
e0881a8e | 2189 | |
40e084e1 | 2190 | /* Start parsing. */ |
d2630e69 | 2191 | |
40e084e1 KS |
2192 | /* Get the first token. */ |
2193 | token = linespec_lexer_lex_one (parser); | |
50641945 | 2194 | |
40e084e1 KS |
2195 | /* It must be either LSTOKEN_STRING or LSTOKEN_NUMBER. */ |
2196 | if (token.type == LSTOKEN_STRING && *LS_TOKEN_STOKEN (token).ptr == '*') | |
50641945 | 2197 | { |
bbc13ae3 KS |
2198 | char *expr; |
2199 | const char *copy; | |
94af9270 | 2200 | |
40e084e1 KS |
2201 | /* User specified an expression, *EXPR. */ |
2202 | copy = expr = copy_token_string (token); | |
2203 | cleanup = make_cleanup (xfree, expr); | |
2204 | PARSER_RESULT (parser)->expr_pc = linespec_expression_to_pc (©); | |
2205 | discard_cleanups (cleanup); | |
2206 | PARSER_RESULT (parser)->expression = expr; | |
dcf9f4ab | 2207 | |
40e084e1 KS |
2208 | /* This is a little hacky/tricky. If linespec_expression_to_pc |
2209 | did not evaluate the entire token, then we must find the | |
2210 | string COPY inside the original token buffer. */ | |
2211 | if (*copy != '\0') | |
2212 | { | |
2213 | PARSER_STREAM (parser) = strstr (parser->lexer.saved_arg, copy); | |
2214 | gdb_assert (PARSER_STREAM (parser) != NULL); | |
2215 | } | |
2f741504 | 2216 | |
40e084e1 KS |
2217 | /* Consume the token. */ |
2218 | linespec_lexer_consume_token (parser); | |
50641945 | 2219 | |
40e084e1 KS |
2220 | goto convert_to_sals; |
2221 | } | |
2222 | else if (token.type == LSTOKEN_STRING && *LS_TOKEN_STOKEN (token).ptr == '$') | |
2223 | { | |
2224 | char *var; | |
50641945 | 2225 | |
40e084e1 | 2226 | /* A NULL entry means to use GLOBAL_DEFAULT_SYMTAB. */ |
ec94af83 | 2227 | VEC_safe_push (symtab_ptr, PARSER_RESULT (parser)->file_symtabs, NULL); |
dcf9f4ab | 2228 | |
40e084e1 KS |
2229 | /* User specified a convenience variable or history value. */ |
2230 | var = copy_token_string (token); | |
2231 | cleanup = make_cleanup (xfree, var); | |
2232 | PARSER_RESULT (parser)->line_offset | |
2233 | = linespec_parse_variable (PARSER_STATE (parser), var); | |
cf4ded82 | 2234 | do_cleanups (cleanup); |
f8eba3c6 | 2235 | |
40e084e1 KS |
2236 | /* If a line_offset wasn't found (VAR is the name of a user |
2237 | variable/function), then skip to normal symbol processing. */ | |
2238 | if (PARSER_RESULT (parser)->line_offset.sign != LINE_OFFSET_UNKNOWN) | |
2239 | { | |
40e084e1 KS |
2240 | /* Consume this token. */ |
2241 | linespec_lexer_consume_token (parser); | |
dcf9f4ab | 2242 | |
40e084e1 | 2243 | goto convert_to_sals; |
50641945 | 2244 | } |
40e084e1 KS |
2245 | } |
2246 | else if (token.type != LSTOKEN_STRING && token.type != LSTOKEN_NUMBER) | |
2247 | unexpected_linespec_error (parser); | |
50641945 | 2248 | |
7c09e5a0 DE |
2249 | /* Now we can recognize keywords. */ |
2250 | parser->keyword_ok = 1; | |
2251 | ||
40e084e1 KS |
2252 | /* Shortcut: If the next token is not LSTOKEN_COLON, we know that |
2253 | this token cannot represent a filename. */ | |
2254 | token = linespec_lexer_peek_token (parser); | |
0e0b460e | 2255 | |
40e084e1 | 2256 | if (token.type == LSTOKEN_COLON) |
0e0b460e | 2257 | { |
40e084e1 | 2258 | char *user_filename; |
0e0b460e | 2259 | |
40e084e1 KS |
2260 | /* Get the current token again and extract the filename. */ |
2261 | token = linespec_lexer_lex_one (parser); | |
2262 | user_filename = copy_token_string (token); | |
50641945 | 2263 | |
40e084e1 KS |
2264 | /* Check if the input is a filename. */ |
2265 | TRY_CATCH (file_exception, RETURN_MASK_ERROR) | |
2266 | { | |
2267 | PARSER_RESULT (parser)->file_symtabs | |
2268 | = symtabs_from_filename (user_filename); | |
2269 | } | |
50641945 | 2270 | |
40e084e1 KS |
2271 | if (file_exception.reason >= 0) |
2272 | { | |
2273 | /* Symtabs were found for the file. Record the filename. */ | |
2274 | PARSER_RESULT (parser)->source_filename = user_filename; | |
f8eba3c6 | 2275 | |
40e084e1 KS |
2276 | /* Get the next token. */ |
2277 | token = linespec_lexer_consume_token (parser); | |
50641945 | 2278 | |
40e084e1 KS |
2279 | /* This is LSTOKEN_COLON; consume it. */ |
2280 | linespec_lexer_consume_token (parser); | |
2281 | } | |
2282 | else | |
2283 | { | |
2284 | /* No symtabs found -- discard user_filename. */ | |
2285 | xfree (user_filename); | |
50641945 | 2286 | |
40e084e1 | 2287 | /* A NULL entry means to use GLOBAL_DEFAULT_SYMTAB. */ |
ec94af83 | 2288 | VEC_safe_push (symtab_ptr, PARSER_RESULT (parser)->file_symtabs, NULL); |
40e084e1 | 2289 | } |
50641945 | 2290 | } |
40e084e1 KS |
2291 | /* If the next token is not EOI, KEYWORD, or COMMA, issue an error. */ |
2292 | else if (token.type != LSTOKEN_EOI && token.type != LSTOKEN_KEYWORD | |
2293 | && token.type != LSTOKEN_COMMA) | |
d2630e69 | 2294 | { |
40e084e1 KS |
2295 | /* TOKEN is the _next_ token, not the one currently in the parser. |
2296 | Consuming the token will give the correct error message. */ | |
2297 | linespec_lexer_consume_token (parser); | |
2298 | unexpected_linespec_error (parser); | |
d2630e69 | 2299 | } |
50641945 FN |
2300 | else |
2301 | { | |
40e084e1 | 2302 | /* A NULL entry means to use GLOBAL_DEFAULT_SYMTAB. */ |
ec94af83 | 2303 | VEC_safe_push (symtab_ptr, PARSER_RESULT (parser)->file_symtabs, NULL); |
50641945 | 2304 | } |
50641945 | 2305 | |
40e084e1 KS |
2306 | /* Parse the rest of the linespec. */ |
2307 | linespec_parse_basic (parser); | |
50641945 | 2308 | |
40e084e1 KS |
2309 | if (PARSER_RESULT (parser)->function_symbols == NULL |
2310 | && PARSER_RESULT (parser)->labels.label_symbols == NULL | |
2311 | && PARSER_RESULT (parser)->line_offset.sign == LINE_OFFSET_UNKNOWN | |
2312 | && PARSER_RESULT (parser)->minimal_symbols == NULL) | |
f8eba3c6 | 2313 | { |
40e084e1 KS |
2314 | /* The linespec didn't parse. Re-throw the file exception if |
2315 | there was one. */ | |
2316 | if (file_exception.reason < 0) | |
2317 | throw_exception (file_exception); | |
0f5238ed | 2318 | |
40e084e1 KS |
2319 | /* Otherwise, the symbol is not found. */ |
2320 | symbol_not_found_error (PARSER_RESULT (parser)->function_name, | |
2321 | PARSER_RESULT (parser)->source_filename); | |
0f5238ed TT |
2322 | } |
2323 | ||
40e084e1 | 2324 | convert_to_sals: |
9ef07c8c | 2325 | |
40e084e1 KS |
2326 | /* Get the last token and record how much of the input was parsed, |
2327 | if necessary. */ | |
2328 | token = linespec_lexer_lex_one (parser); | |
2329 | if (token.type != LSTOKEN_EOI && token.type != LSTOKEN_KEYWORD) | |
2330 | PARSER_STREAM (parser) = LS_TOKEN_STOKEN (token).ptr; | |
50641945 | 2331 | |
40e084e1 KS |
2332 | /* Convert the data in PARSER_RESULT to SALs. */ |
2333 | values = convert_linespec_to_sals (PARSER_STATE (parser), | |
2334 | PARSER_RESULT (parser)); | |
f8eba3c6 | 2335 | |
40e084e1 | 2336 | return values; |
413dad4d | 2337 | } |
50641945 | 2338 | |
40e084e1 | 2339 | |
f8eba3c6 | 2340 | /* A constructor for linespec_state. */ |
44fe14ab | 2341 | |
f8eba3c6 TT |
2342 | static void |
2343 | linespec_state_constructor (struct linespec_state *self, | |
40e084e1 | 2344 | int flags, const struct language_defn *language, |
f8eba3c6 TT |
2345 | struct symtab *default_symtab, |
2346 | int default_line, | |
2347 | struct linespec_result *canonical) | |
2348 | { | |
2349 | memset (self, 0, sizeof (*self)); | |
40e084e1 | 2350 | self->language = language; |
f8eba3c6 TT |
2351 | self->funfirstline = (flags & DECODE_LINE_FUNFIRSTLINE) ? 1 : 0; |
2352 | self->list_mode = (flags & DECODE_LINE_LIST_MODE) ? 1 : 0; | |
2353 | self->default_symtab = default_symtab; | |
2354 | self->default_line = default_line; | |
2355 | self->canonical = canonical; | |
2356 | self->program_space = current_program_space; | |
2357 | self->addr_set = htab_create_alloc (10, hash_address_entry, eq_address_entry, | |
2358 | xfree, xcalloc, xfree); | |
2359 | } | |
44fe14ab | 2360 | |
40e084e1 | 2361 | /* Initialize a new linespec parser. */ |
44fe14ab DC |
2362 | |
2363 | static void | |
40e084e1 KS |
2364 | linespec_parser_new (linespec_parser *parser, |
2365 | int flags, const struct language_defn *language, | |
2366 | struct symtab *default_symtab, | |
2367 | int default_line, | |
2368 | struct linespec_result *canonical) | |
44fe14ab | 2369 | { |
40e084e1 KS |
2370 | parser->lexer.current.type = LSTOKEN_CONSUMED; |
2371 | memset (PARSER_RESULT (parser), 0, sizeof (struct linespec)); | |
2372 | PARSER_RESULT (parser)->line_offset.sign = LINE_OFFSET_UNKNOWN; | |
2373 | linespec_state_constructor (PARSER_STATE (parser), flags, language, | |
2374 | default_symtab, default_line, canonical); | |
2375 | } | |
2376 | ||
2377 | /* A destructor for linespec_state. */ | |
44fe14ab | 2378 | |
40e084e1 KS |
2379 | static void |
2380 | linespec_state_destructor (struct linespec_state *self) | |
2381 | { | |
f8eba3c6 TT |
2382 | htab_delete (self->addr_set); |
2383 | } | |
44fe14ab | 2384 | |
40e084e1 KS |
2385 | /* Delete a linespec parser. */ |
2386 | ||
2387 | static void | |
2388 | linespec_parser_delete (void *arg) | |
2389 | { | |
2390 | linespec_parser *parser = (linespec_parser *) arg; | |
2391 | ||
5d94e27b KS |
2392 | xfree ((char *) PARSER_RESULT (parser)->expression); |
2393 | xfree ((char *) PARSER_RESULT (parser)->source_filename); | |
2394 | xfree ((char *) PARSER_RESULT (parser)->label_name); | |
2395 | xfree ((char *) PARSER_RESULT (parser)->function_name); | |
40e084e1 KS |
2396 | |
2397 | if (PARSER_RESULT (parser)->file_symtabs != NULL) | |
ec94af83 | 2398 | VEC_free (symtab_ptr, PARSER_RESULT (parser)->file_symtabs); |
40e084e1 KS |
2399 | |
2400 | if (PARSER_RESULT (parser)->function_symbols != NULL) | |
2401 | VEC_free (symbolp, PARSER_RESULT (parser)->function_symbols); | |
2402 | ||
2403 | if (PARSER_RESULT (parser)->minimal_symbols != NULL) | |
f60e2d5c | 2404 | VEC_free (bound_minimal_symbol_d, PARSER_RESULT (parser)->minimal_symbols); |
40e084e1 KS |
2405 | |
2406 | if (PARSER_RESULT (parser)->labels.label_symbols != NULL) | |
2407 | VEC_free (symbolp, PARSER_RESULT (parser)->labels.label_symbols); | |
2408 | ||
2409 | if (PARSER_RESULT (parser)->labels.function_symbols != NULL) | |
2410 | VEC_free (symbolp, PARSER_RESULT (parser)->labels.function_symbols); | |
2411 | ||
2412 | linespec_state_destructor (PARSER_STATE (parser)); | |
2413 | } | |
2414 | ||
f8eba3c6 | 2415 | /* See linespec.h. */ |
44fe14ab | 2416 | |
f8eba3c6 TT |
2417 | void |
2418 | decode_line_full (char **argptr, int flags, | |
2419 | struct symtab *default_symtab, | |
2420 | int default_line, struct linespec_result *canonical, | |
2421 | const char *select_mode, | |
2422 | const char *filter) | |
44fe14ab | 2423 | { |
f8eba3c6 | 2424 | struct symtabs_and_lines result; |
f8eba3c6 | 2425 | struct cleanup *cleanups; |
f8eba3c6 | 2426 | VEC (const_char_ptr) *filters = NULL; |
40e084e1 KS |
2427 | linespec_parser parser; |
2428 | struct linespec_state *state; | |
d7561cbb | 2429 | const char *copy, *orig; |
f8eba3c6 TT |
2430 | |
2431 | gdb_assert (canonical != NULL); | |
2432 | /* The filter only makes sense for 'all'. */ | |
2433 | gdb_assert (filter == NULL || select_mode == multiple_symbols_all); | |
2434 | gdb_assert (select_mode == NULL | |
2435 | || select_mode == multiple_symbols_all | |
2436 | || select_mode == multiple_symbols_ask | |
2437 | || select_mode == multiple_symbols_cancel); | |
2438 | gdb_assert ((flags & DECODE_LINE_LIST_MODE) == 0); | |
2439 | ||
40e084e1 KS |
2440 | linespec_parser_new (&parser, flags, current_language, default_symtab, |
2441 | default_line, canonical); | |
2442 | cleanups = make_cleanup (linespec_parser_delete, &parser); | |
f8eba3c6 TT |
2443 | save_current_program_space (); |
2444 | ||
d7561cbb KS |
2445 | orig = copy = *argptr; |
2446 | result = parse_linespec (&parser, ©); | |
2447 | *argptr += copy - orig; | |
40e084e1 | 2448 | state = PARSER_STATE (&parser); |
f8eba3c6 TT |
2449 | |
2450 | gdb_assert (result.nelts == 1 || canonical->pre_expanded); | |
2451 | gdb_assert (canonical->addr_string != NULL); | |
2452 | canonical->pre_expanded = 1; | |
2453 | ||
66f1999b | 2454 | /* Arrange for allocated canonical names to be freed. */ |
f8eba3c6 TT |
2455 | if (result.nelts > 0) |
2456 | { | |
2457 | int i; | |
2458 | ||
40e084e1 | 2459 | make_cleanup (xfree, state->canonical_names); |
f8eba3c6 TT |
2460 | for (i = 0; i < result.nelts; ++i) |
2461 | { | |
33f448b1 JK |
2462 | gdb_assert (state->canonical_names[i].suffix != NULL); |
2463 | make_cleanup (xfree, state->canonical_names[i].suffix); | |
f8eba3c6 TT |
2464 | } |
2465 | } | |
2466 | ||
2467 | if (select_mode == NULL) | |
2468 | { | |
2469 | if (ui_out_is_mi_like_p (interp_ui_out (top_level_interpreter ()))) | |
2470 | select_mode = multiple_symbols_all; | |
2471 | else | |
2472 | select_mode = multiple_symbols_select_mode (); | |
2473 | } | |
2474 | ||
2475 | if (select_mode == multiple_symbols_all) | |
2476 | { | |
2477 | if (filter != NULL) | |
2478 | { | |
2479 | make_cleanup (VEC_cleanup (const_char_ptr), &filters); | |
2480 | VEC_safe_push (const_char_ptr, filters, filter); | |
40e084e1 | 2481 | filter_results (state, &result, filters); |
f8eba3c6 TT |
2482 | } |
2483 | else | |
40e084e1 | 2484 | convert_results_to_lsals (state, &result); |
f8eba3c6 TT |
2485 | } |
2486 | else | |
40e084e1 | 2487 | decode_line_2 (state, &result, select_mode); |
f8eba3c6 TT |
2488 | |
2489 | do_cleanups (cleanups); | |
2490 | } | |
2491 | ||
39cf75f7 DE |
2492 | /* See linespec.h. */ |
2493 | ||
f8eba3c6 TT |
2494 | struct symtabs_and_lines |
2495 | decode_line_1 (char **argptr, int flags, | |
2496 | struct symtab *default_symtab, | |
2497 | int default_line) | |
2498 | { | |
2499 | struct symtabs_and_lines result; | |
40e084e1 | 2500 | linespec_parser parser; |
f8eba3c6 | 2501 | struct cleanup *cleanups; |
d7561cbb | 2502 | const char *copy, *orig; |
f8eba3c6 | 2503 | |
40e084e1 KS |
2504 | linespec_parser_new (&parser, flags, current_language, default_symtab, |
2505 | default_line, NULL); | |
2506 | cleanups = make_cleanup (linespec_parser_delete, &parser); | |
f8eba3c6 TT |
2507 | save_current_program_space (); |
2508 | ||
d7561cbb KS |
2509 | orig = copy = *argptr; |
2510 | result = parse_linespec (&parser, ©); | |
2511 | *argptr += copy - orig; | |
40e084e1 | 2512 | |
f8eba3c6 TT |
2513 | do_cleanups (cleanups); |
2514 | return result; | |
2515 | } | |
2516 | ||
39cf75f7 DE |
2517 | /* See linespec.h. */ |
2518 | ||
2519 | struct symtabs_and_lines | |
2520 | decode_line_with_current_source (char *string, int flags) | |
2521 | { | |
2522 | struct symtabs_and_lines sals; | |
2523 | struct symtab_and_line cursal; | |
2524 | ||
2525 | if (string == 0) | |
2526 | error (_("Empty line specification.")); | |
2527 | ||
2528 | /* We use whatever is set as the current source line. We do not try | |
2529 | and get a default source symtab+line or it will recursively call us! */ | |
2530 | cursal = get_current_source_symtab_and_line (); | |
2531 | ||
2532 | sals = decode_line_1 (&string, flags, | |
2533 | cursal.symtab, cursal.line); | |
2534 | ||
2535 | if (*string) | |
2536 | error (_("Junk at end of line specification: %s"), string); | |
2537 | return sals; | |
2538 | } | |
2539 | ||
2540 | /* See linespec.h. */ | |
2541 | ||
2542 | struct symtabs_and_lines | |
2543 | decode_line_with_last_displayed (char *string, int flags) | |
2544 | { | |
2545 | struct symtabs_and_lines sals; | |
2546 | ||
2547 | if (string == 0) | |
2548 | error (_("Empty line specification.")); | |
2549 | ||
2550 | if (last_displayed_sal_is_valid ()) | |
2551 | sals = decode_line_1 (&string, flags, | |
2552 | get_last_displayed_symtab (), | |
2553 | get_last_displayed_line ()); | |
2554 | else | |
2555 | sals = decode_line_1 (&string, flags, (struct symtab *) NULL, 0); | |
2556 | ||
2557 | if (*string) | |
2558 | error (_("Junk at end of line specification: %s"), string); | |
2559 | return sals; | |
2560 | } | |
2561 | ||
f8eba3c6 TT |
2562 | \f |
2563 | ||
2564 | /* First, some functions to initialize stuff at the beggining of the | |
2565 | function. */ | |
2566 | ||
2567 | static void | |
2568 | initialize_defaults (struct symtab **default_symtab, int *default_line) | |
2569 | { | |
2570 | if (*default_symtab == 0) | |
2571 | { | |
2572 | /* Use whatever we have for the default source line. We don't use | |
2573 | get_current_or_default_symtab_and_line as it can recurse and call | |
2574 | us back! */ | |
2575 | struct symtab_and_line cursal = | |
2576 | get_current_source_symtab_and_line (); | |
2577 | ||
2578 | *default_symtab = cursal.symtab; | |
2579 | *default_line = cursal.line; | |
2580 | } | |
2581 | } | |
2582 | ||
2583 | \f | |
2584 | ||
40e084e1 KS |
2585 | /* Evaluate the expression pointed to by EXP_PTR into a CORE_ADDR, |
2586 | advancing EXP_PTR past any parsed text. */ | |
f8eba3c6 | 2587 | |
40e084e1 | 2588 | static CORE_ADDR |
bbc13ae3 | 2589 | linespec_expression_to_pc (const char **exp_ptr) |
f8eba3c6 | 2590 | { |
f8eba3c6 TT |
2591 | if (current_program_space->executing_startup) |
2592 | /* The error message doesn't really matter, because this case | |
2593 | should only hit during breakpoint reset. */ | |
2594 | throw_error (NOT_FOUND_ERROR, _("cannot evaluate expressions while " | |
2595 | "program space is in startup")); | |
2596 | ||
40e084e1 KS |
2597 | (*exp_ptr)++; |
2598 | return value_as_address (parse_to_comma_and_eval (exp_ptr)); | |
0960f083 DC |
2599 | } |
2600 | ||
2601 | \f | |
2602 | ||
d2630e69 AF |
2603 | /* Here's where we recognise an Objective-C Selector. An Objective C |
2604 | selector may be implemented by more than one class, therefore it | |
2605 | may represent more than one method/function. This gives us a | |
2606 | situation somewhat analogous to C++ overloading. If there's more | |
2607 | than one method that could represent the selector, then use some of | |
2608 | the existing C++ code to let the user choose one. */ | |
2609 | ||
f8eba3c6 | 2610 | static struct symtabs_and_lines |
d7561cbb | 2611 | decode_objc (struct linespec_state *self, linespec_p ls, const char **argptr) |
d2630e69 | 2612 | { |
f8eba3c6 TT |
2613 | struct collect_info info; |
2614 | VEC (const_char_ptr) *symbol_names = NULL; | |
40e084e1 | 2615 | struct symtabs_and_lines values; |
d7561cbb | 2616 | const char *new_argptr; |
f8eba3c6 TT |
2617 | struct cleanup *cleanup = make_cleanup (VEC_cleanup (const_char_ptr), |
2618 | &symbol_names); | |
2619 | ||
2620 | info.state = self; | |
40e084e1 | 2621 | info.file_symtabs = NULL; |
ec94af83 DE |
2622 | VEC_safe_push (symtab_ptr, info.file_symtabs, NULL); |
2623 | make_cleanup (VEC_cleanup (symtab_ptr), &info.file_symtabs); | |
40e084e1 KS |
2624 | info.result.symbols = NULL; |
2625 | info.result.minimal_symbols = NULL; | |
2626 | values.nelts = 0; | |
2627 | values.sals = NULL; | |
f8eba3c6 TT |
2628 | |
2629 | new_argptr = find_imps (*argptr, &symbol_names); | |
2630 | if (VEC_empty (const_char_ptr, symbol_names)) | |
2631 | { | |
2632 | do_cleanups (cleanup); | |
40e084e1 | 2633 | return values; |
f8eba3c6 | 2634 | } |
d2630e69 | 2635 | |
f8eba3c6 | 2636 | add_all_symbol_names_from_pspace (&info, NULL, symbol_names); |
d2630e69 | 2637 | |
40e084e1 | 2638 | if (!VEC_empty (symbolp, info.result.symbols) |
f60e2d5c | 2639 | || !VEC_empty (bound_minimal_symbol_d, info.result.minimal_symbols)) |
d2630e69 | 2640 | { |
f8eba3c6 | 2641 | char *saved_arg; |
d2630e69 | 2642 | |
f8eba3c6 TT |
2643 | saved_arg = alloca (new_argptr - *argptr + 1); |
2644 | memcpy (saved_arg, *argptr, new_argptr - *argptr); | |
2645 | saved_arg[new_argptr - *argptr] = '\0'; | |
d2630e69 | 2646 | |
0f5f4ffe | 2647 | ls->function_name = xstrdup (saved_arg); |
40e084e1 KS |
2648 | ls->function_symbols = info.result.symbols; |
2649 | ls->minimal_symbols = info.result.minimal_symbols; | |
2650 | values = convert_linespec_to_sals (self, ls); | |
2651 | ||
f8eba3c6 | 2652 | if (self->canonical) |
d2630e69 | 2653 | { |
f8eba3c6 | 2654 | self->canonical->pre_expanded = 1; |
40e084e1 | 2655 | if (ls->source_filename) |
f8eba3c6 | 2656 | self->canonical->addr_string |
40e084e1 | 2657 | = xstrprintf ("%s:%s", ls->source_filename, saved_arg); |
f8eba3c6 TT |
2658 | else |
2659 | self->canonical->addr_string = xstrdup (saved_arg); | |
d2630e69 | 2660 | } |
d2630e69 AF |
2661 | } |
2662 | ||
f8eba3c6 | 2663 | *argptr = new_argptr; |
d2630e69 | 2664 | |
f8eba3c6 | 2665 | do_cleanups (cleanup); |
c00f8484 | 2666 | |
40e084e1 | 2667 | return values; |
f8eba3c6 | 2668 | } |
c00f8484 | 2669 | |
f8eba3c6 TT |
2670 | /* An instance of this type is used when collecting prefix symbols for |
2671 | decode_compound. */ | |
17763fd9 | 2672 | |
f8eba3c6 TT |
2673 | struct decode_compound_collector |
2674 | { | |
2675 | /* The result vector. */ | |
2676 | VEC (symbolp) *symbols; | |
3a93a0c2 | 2677 | |
f8eba3c6 TT |
2678 | /* A hash table of all symbols we found. We use this to avoid |
2679 | adding any symbol more than once. */ | |
2680 | htab_t unique_syms; | |
2681 | }; | |
3a93a0c2 | 2682 | |
f8eba3c6 TT |
2683 | /* A callback for iterate_over_symbols that is used by |
2684 | lookup_prefix_sym to collect type symbols. */ | |
c00f8484 | 2685 | |
f8eba3c6 TT |
2686 | static int |
2687 | collect_one_symbol (struct symbol *sym, void *d) | |
2688 | { | |
2689 | struct decode_compound_collector *collector = d; | |
2690 | void **slot; | |
2691 | struct type *t; | |
614b3b14 | 2692 | |
f8eba3c6 | 2693 | if (SYMBOL_CLASS (sym) != LOC_TYPEDEF) |
8e704927 | 2694 | return 1; /* Continue iterating. */ |
f8eba3c6 TT |
2695 | |
2696 | t = SYMBOL_TYPE (sym); | |
2697 | CHECK_TYPEDEF (t); | |
2698 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT | |
2699 | && TYPE_CODE (t) != TYPE_CODE_UNION | |
2700 | && TYPE_CODE (t) != TYPE_CODE_NAMESPACE) | |
8e704927 | 2701 | return 1; /* Continue iterating. */ |
614b3b14 | 2702 | |
f8eba3c6 TT |
2703 | slot = htab_find_slot (collector->unique_syms, sym, INSERT); |
2704 | if (!*slot) | |
2705 | { | |
2706 | *slot = sym; | |
2707 | VEC_safe_push (symbolp, collector->symbols, sym); | |
2708 | } | |
2709 | ||
8e704927 | 2710 | return 1; /* Continue iterating. */ |
f8eba3c6 | 2711 | } |
93d91629 | 2712 | |
40e084e1 | 2713 | /* Return any symbols corresponding to CLASS_NAME in FILE_SYMTABS. */ |
93d91629 | 2714 | |
f8eba3c6 | 2715 | static VEC (symbolp) * |
ec94af83 | 2716 | lookup_prefix_sym (struct linespec_state *state, VEC (symtab_ptr) *file_symtabs, |
40e084e1 | 2717 | const char *class_name) |
93d91629 | 2718 | { |
f8eba3c6 TT |
2719 | int ix; |
2720 | struct symtab *elt; | |
2721 | struct decode_compound_collector collector; | |
2722 | struct cleanup *outer; | |
2723 | struct cleanup *cleanup; | |
17763fd9 | 2724 | |
f8eba3c6 | 2725 | collector.symbols = NULL; |
40e084e1 | 2726 | outer = make_cleanup (VEC_cleanup (symbolp), &collector.symbols); |
e0881a8e | 2727 | |
f8eba3c6 TT |
2728 | collector.unique_syms = htab_create_alloc (1, htab_hash_pointer, |
2729 | htab_eq_pointer, NULL, | |
2730 | xcalloc, xfree); | |
2731 | cleanup = make_cleanup_htab_delete (collector.unique_syms); | |
e0881a8e | 2732 | |
ec94af83 | 2733 | for (ix = 0; VEC_iterate (symtab_ptr, file_symtabs, ix, elt); ++ix) |
f8eba3c6 TT |
2734 | { |
2735 | if (elt == NULL) | |
2736 | { | |
40e084e1 | 2737 | iterate_over_all_matching_symtabs (state, class_name, STRUCT_DOMAIN, |
f8eba3c6 | 2738 | collect_one_symbol, &collector, |
481860b3 | 2739 | NULL, 0); |
40e084e1 | 2740 | iterate_over_all_matching_symtabs (state, class_name, VAR_DOMAIN, |
f8eba3c6 | 2741 | collect_one_symbol, &collector, |
481860b3 | 2742 | NULL, 0); |
f8eba3c6 TT |
2743 | } |
2744 | else | |
2745 | { | |
f8eba3c6 TT |
2746 | /* Program spaces that are executing startup should have |
2747 | been filtered out earlier. */ | |
2748 | gdb_assert (!SYMTAB_PSPACE (elt)->executing_startup); | |
2749 | set_current_program_space (SYMTAB_PSPACE (elt)); | |
4eeaa230 DE |
2750 | iterate_over_file_blocks (elt, class_name, STRUCT_DOMAIN, |
2751 | collect_one_symbol, &collector); | |
2752 | iterate_over_file_blocks (elt, class_name, VAR_DOMAIN, | |
2753 | collect_one_symbol, &collector); | |
1e5a1abc KS |
2754 | } |
2755 | } | |
2756 | ||
f8eba3c6 TT |
2757 | do_cleanups (cleanup); |
2758 | discard_cleanups (outer); | |
2759 | return collector.symbols; | |
93d91629 DC |
2760 | } |
2761 | ||
40e084e1 KS |
2762 | /* A qsort comparison function for symbols. The resulting order does |
2763 | not actually matter; we just need to be able to sort them so that | |
2764 | symbols with the same program space end up next to each other. */ | |
2765 | ||
2766 | static int | |
2767 | compare_symbols (const void *a, const void *b) | |
2768 | { | |
2769 | struct symbol * const *sa = a; | |
2770 | struct symbol * const *sb = b; | |
2771 | uintptr_t uia, uib; | |
2772 | ||
2773 | uia = (uintptr_t) SYMTAB_PSPACE (SYMBOL_SYMTAB (*sa)); | |
2774 | uib = (uintptr_t) SYMTAB_PSPACE (SYMBOL_SYMTAB (*sb)); | |
2775 | ||
2776 | if (uia < uib) | |
2777 | return -1; | |
2778 | if (uia > uib) | |
2779 | return 1; | |
2780 | ||
2781 | uia = (uintptr_t) *sa; | |
2782 | uib = (uintptr_t) *sb; | |
2783 | ||
2784 | if (uia < uib) | |
2785 | return -1; | |
2786 | if (uia > uib) | |
2787 | return 1; | |
2788 | ||
2789 | return 0; | |
2790 | } | |
2791 | ||
2792 | /* Like compare_symbols but for minimal symbols. */ | |
4224873a | 2793 | |
f8eba3c6 | 2794 | static int |
40e084e1 | 2795 | compare_msymbols (const void *a, const void *b) |
4224873a | 2796 | { |
f60e2d5c TT |
2797 | const struct bound_minimal_symbol *sa = a; |
2798 | const struct bound_minimal_symbol *sb = b; | |
f8eba3c6 TT |
2799 | uintptr_t uia, uib; |
2800 | ||
001822aa TT |
2801 | uia = (uintptr_t) sa->objfile->pspace; |
2802 | uib = (uintptr_t) sa->objfile->pspace; | |
f8eba3c6 TT |
2803 | |
2804 | if (uia < uib) | |
2805 | return -1; | |
2806 | if (uia > uib) | |
2807 | return 1; | |
2808 | ||
001822aa TT |
2809 | uia = (uintptr_t) sa->minsym; |
2810 | uib = (uintptr_t) sb->minsym; | |
f8eba3c6 TT |
2811 | |
2812 | if (uia < uib) | |
2813 | return -1; | |
2814 | if (uia > uib) | |
2815 | return 1; | |
2816 | ||
2817 | return 0; | |
2818 | } | |
2819 | ||
2820 | /* Look for all the matching instances of each symbol in NAMES. Only | |
2821 | instances from PSPACE are considered; other program spaces are | |
2822 | handled by our caller. If PSPACE is NULL, then all program spaces | |
2823 | are considered. Results are stored into INFO. */ | |
2824 | ||
2825 | static void | |
2826 | add_all_symbol_names_from_pspace (struct collect_info *info, | |
2827 | struct program_space *pspace, | |
2828 | VEC (const_char_ptr) *names) | |
2829 | { | |
2830 | int ix; | |
2831 | const char *iter; | |
2832 | ||
2833 | for (ix = 0; VEC_iterate (const_char_ptr, names, ix, iter); ++ix) | |
2834 | add_matching_symbols_to_info (iter, info, pspace); | |
2835 | } | |
2836 | ||
2837 | static void | |
2838 | find_superclass_methods (VEC (typep) *superclasses, | |
2839 | const char *name, | |
2840 | VEC (const_char_ptr) **result_names) | |
2841 | { | |
2842 | int old_len = VEC_length (const_char_ptr, *result_names); | |
2843 | VEC (typep) *iter_classes; | |
2844 | struct cleanup *cleanup = make_cleanup (null_cleanup, NULL); | |
2845 | ||
2846 | iter_classes = superclasses; | |
2847 | while (1) | |
2848 | { | |
2849 | VEC (typep) *new_supers = NULL; | |
2850 | int ix; | |
2851 | struct type *t; | |
2852 | ||
2853 | make_cleanup (VEC_cleanup (typep), &new_supers); | |
2854 | for (ix = 0; VEC_iterate (typep, iter_classes, ix, t); ++ix) | |
2855 | find_methods (t, name, result_names, &new_supers); | |
2856 | ||
2857 | if (VEC_length (const_char_ptr, *result_names) != old_len | |
2858 | || VEC_empty (typep, new_supers)) | |
2859 | break; | |
4224873a | 2860 | |
f8eba3c6 TT |
2861 | iter_classes = new_supers; |
2862 | } | |
4224873a | 2863 | |
f8eba3c6 TT |
2864 | do_cleanups (cleanup); |
2865 | } | |
2866 | ||
40e084e1 KS |
2867 | /* This finds the method METHOD_NAME in the class CLASS_NAME whose type is |
2868 | given by one of the symbols in SYM_CLASSES. Matches are returned | |
2869 | in SYMBOLS (for debug symbols) and MINSYMS (for minimal symbols). */ | |
f8eba3c6 | 2870 | |
40e084e1 | 2871 | static void |
ec94af83 | 2872 | find_method (struct linespec_state *self, VEC (symtab_ptr) *file_symtabs, |
40e084e1 KS |
2873 | const char *class_name, const char *method_name, |
2874 | VEC (symbolp) *sym_classes, VEC (symbolp) **symbols, | |
f60e2d5c | 2875 | VEC (bound_minimal_symbol_d) **minsyms) |
f8eba3c6 | 2876 | { |
f8eba3c6 TT |
2877 | struct symbol *sym; |
2878 | struct cleanup *cleanup = make_cleanup (null_cleanup, NULL); | |
2879 | int ix; | |
2880 | int last_result_len; | |
2881 | VEC (typep) *superclass_vec; | |
2882 | VEC (const_char_ptr) *result_names; | |
2883 | struct collect_info info; | |
4224873a | 2884 | |
f8eba3c6 TT |
2885 | /* Sort symbols so that symbols with the same program space are next |
2886 | to each other. */ | |
2887 | qsort (VEC_address (symbolp, sym_classes), | |
2888 | VEC_length (symbolp, sym_classes), | |
2889 | sizeof (symbolp), | |
2890 | compare_symbols); | |
2891 | ||
2892 | info.state = self; | |
40e084e1 KS |
2893 | info.file_symtabs = file_symtabs; |
2894 | info.result.symbols = NULL; | |
2895 | info.result.minimal_symbols = NULL; | |
f8eba3c6 TT |
2896 | |
2897 | /* Iterate over all the types, looking for the names of existing | |
40e084e1 | 2898 | methods matching METHOD_NAME. If we cannot find a direct method in a |
f8eba3c6 TT |
2899 | given program space, then we consider inherited methods; this is |
2900 | not ideal (ideal would be to respect C++ hiding rules), but it | |
2901 | seems good enough and is what GDB has historically done. We only | |
2902 | need to collect the names because later we find all symbols with | |
2903 | those names. This loop is written in a somewhat funny way | |
2904 | because we collect data across the program space before deciding | |
2905 | what to do. */ | |
2906 | superclass_vec = NULL; | |
2907 | make_cleanup (VEC_cleanup (typep), &superclass_vec); | |
2908 | result_names = NULL; | |
2909 | make_cleanup (VEC_cleanup (const_char_ptr), &result_names); | |
2910 | last_result_len = 0; | |
2911 | for (ix = 0; VEC_iterate (symbolp, sym_classes, ix, sym); ++ix) | |
2912 | { | |
2913 | struct type *t; | |
2914 | struct program_space *pspace; | |
2915 | ||
2916 | /* Program spaces that are executing startup should have | |
2917 | been filtered out earlier. */ | |
2918 | gdb_assert (!SYMTAB_PSPACE (SYMBOL_SYMTAB (sym))->executing_startup); | |
2919 | pspace = SYMTAB_PSPACE (SYMBOL_SYMTAB (sym)); | |
2920 | set_current_program_space (pspace); | |
2921 | t = check_typedef (SYMBOL_TYPE (sym)); | |
40e084e1 | 2922 | find_methods (t, method_name, &result_names, &superclass_vec); |
f8eba3c6 TT |
2923 | |
2924 | /* Handle all items from a single program space at once; and be | |
2925 | sure not to miss the last batch. */ | |
2926 | if (ix == VEC_length (symbolp, sym_classes) - 1 | |
2927 | || (pspace | |
2928 | != SYMTAB_PSPACE (SYMBOL_SYMTAB (VEC_index (symbolp, sym_classes, | |
2929 | ix + 1))))) | |
4224873a | 2930 | { |
f8eba3c6 TT |
2931 | /* If we did not find a direct implementation anywhere in |
2932 | this program space, consider superclasses. */ | |
2933 | if (VEC_length (const_char_ptr, result_names) == last_result_len) | |
40e084e1 KS |
2934 | find_superclass_methods (superclass_vec, method_name, |
2935 | &result_names); | |
f8eba3c6 TT |
2936 | |
2937 | /* We have a list of candidate symbol names, so now we | |
2938 | iterate over the symbol tables looking for all | |
2939 | matches in this pspace. */ | |
2940 | add_all_symbol_names_from_pspace (&info, pspace, result_names); | |
2941 | ||
2942 | VEC_truncate (typep, superclass_vec, 0); | |
2943 | last_result_len = VEC_length (const_char_ptr, result_names); | |
4224873a | 2944 | } |
4224873a | 2945 | } |
f8eba3c6 | 2946 | |
40e084e1 | 2947 | if (!VEC_empty (symbolp, info.result.symbols) |
f60e2d5c | 2948 | || !VEC_empty (bound_minimal_symbol_d, info.result.minimal_symbols)) |
4224873a | 2949 | { |
40e084e1 KS |
2950 | *symbols = info.result.symbols; |
2951 | *minsyms = info.result.minimal_symbols; | |
f8eba3c6 | 2952 | do_cleanups (cleanup); |
40e084e1 | 2953 | return; |
4224873a | 2954 | } |
f8eba3c6 | 2955 | |
40e084e1 KS |
2956 | /* Throw an NOT_FOUND_ERROR. This will be caught by the caller |
2957 | and other attempts to locate the symbol will be made. */ | |
2958 | throw_error (NOT_FOUND_ERROR, _("see caller, this text doesn't matter")); | |
f8eba3c6 TT |
2959 | } |
2960 | ||
2961 | \f | |
2962 | ||
2963 | /* This object is used when collecting all matching symtabs. */ | |
2964 | ||
2965 | struct symtab_collector | |
2966 | { | |
2967 | /* The result vector of symtabs. */ | |
ec94af83 | 2968 | VEC (symtab_ptr) *symtabs; |
f8eba3c6 TT |
2969 | |
2970 | /* This is used to ensure the symtabs are unique. */ | |
2971 | htab_t symtab_table; | |
2972 | }; | |
2973 | ||
2974 | /* Callback for iterate_over_symtabs. */ | |
2975 | ||
2976 | static int | |
2977 | add_symtabs_to_list (struct symtab *symtab, void *d) | |
2978 | { | |
2979 | struct symtab_collector *data = d; | |
2980 | void **slot; | |
2981 | ||
2982 | slot = htab_find_slot (data->symtab_table, symtab, INSERT); | |
2983 | if (!*slot) | |
4224873a | 2984 | { |
f8eba3c6 | 2985 | *slot = symtab; |
ec94af83 | 2986 | VEC_safe_push (symtab_ptr, data->symtabs, symtab); |
4224873a | 2987 | } |
f8eba3c6 TT |
2988 | |
2989 | return 0; | |
4224873a DC |
2990 | } |
2991 | ||
f8eba3c6 TT |
2992 | /* Given a file name, return a VEC of all matching symtabs. */ |
2993 | ||
ec94af83 | 2994 | static VEC (symtab_ptr) * |
f8eba3c6 TT |
2995 | collect_symtabs_from_filename (const char *file) |
2996 | { | |
2997 | struct symtab_collector collector; | |
2998 | struct cleanup *cleanups; | |
2999 | struct program_space *pspace; | |
3000 | ||
3001 | collector.symtabs = NULL; | |
3002 | collector.symtab_table = htab_create (1, htab_hash_pointer, htab_eq_pointer, | |
3003 | NULL); | |
3004 | cleanups = make_cleanup_htab_delete (collector.symtab_table); | |
3005 | ||
3006 | /* Find that file's data. */ | |
3007 | ALL_PSPACES (pspace) | |
3008 | { | |
3009 | if (pspace->executing_startup) | |
3010 | continue; | |
3011 | ||
3012 | set_current_program_space (pspace); | |
3013 | iterate_over_symtabs (file, add_symtabs_to_list, &collector); | |
3014 | } | |
f3c39e76 | 3015 | |
f8eba3c6 TT |
3016 | do_cleanups (cleanups); |
3017 | return collector.symtabs; | |
3018 | } | |
3019 | ||
40e084e1 | 3020 | /* Return all the symtabs associated to the FILENAME. */ |
f8eba3c6 | 3021 | |
ec94af83 | 3022 | static VEC (symtab_ptr) * |
40e084e1 KS |
3023 | symtabs_from_filename (const char *filename) |
3024 | { | |
ec94af83 | 3025 | VEC (symtab_ptr) *result; |
40e084e1 KS |
3026 | |
3027 | result = collect_symtabs_from_filename (filename); | |
f8eba3c6 | 3028 | |
ec94af83 | 3029 | if (VEC_empty (symtab_ptr, result)) |
f8eba3c6 | 3030 | { |
40e084e1 KS |
3031 | if (!have_full_symbols () && !have_partial_symbols ()) |
3032 | throw_error (NOT_FOUND_ERROR, | |
3033 | _("No symbol table is loaded. " | |
3034 | "Use the \"file\" command.")); | |
3035 | throw_error (NOT_FOUND_ERROR, _("No source file named %s."), filename); | |
f8eba3c6 TT |
3036 | } |
3037 | ||
40e084e1 | 3038 | return result; |
84fba31b | 3039 | } |
f3c39e76 | 3040 | |
40e084e1 KS |
3041 | /* Look up a function symbol named NAME in symtabs FILE_SYMTABS. Matching |
3042 | debug symbols are returned in SYMBOLS. Matching minimal symbols are | |
3043 | returned in MINSYMS. */ | |
14e91ac5 | 3044 | |
40e084e1 KS |
3045 | static void |
3046 | find_function_symbols (struct linespec_state *state, | |
ec94af83 | 3047 | VEC (symtab_ptr) *file_symtabs, const char *name, |
40e084e1 | 3048 | VEC (symbolp) **symbols, |
f60e2d5c | 3049 | VEC (bound_minimal_symbol_d) **minsyms) |
14e91ac5 | 3050 | { |
40e084e1 KS |
3051 | struct collect_info info; |
3052 | VEC (const_char_ptr) *symbol_names = NULL; | |
3053 | struct cleanup *cleanup = make_cleanup (VEC_cleanup (const_char_ptr), | |
3054 | &symbol_names); | |
14e91ac5 | 3055 | |
40e084e1 KS |
3056 | info.state = state; |
3057 | info.result.symbols = NULL; | |
3058 | info.result.minimal_symbols = NULL; | |
3059 | info.file_symtabs = file_symtabs; | |
e0881a8e | 3060 | |
40e084e1 | 3061 | /* Try NAME as an Objective-C selector. */ |
d7561cbb | 3062 | find_imps (name, &symbol_names); |
40e084e1 KS |
3063 | if (!VEC_empty (const_char_ptr, symbol_names)) |
3064 | add_all_symbol_names_from_pspace (&info, NULL, symbol_names); | |
3065 | else | |
3066 | add_matching_symbols_to_info (name, &info, NULL); | |
3067 | ||
3068 | do_cleanups (cleanup); | |
3069 | ||
3070 | if (VEC_empty (symbolp, info.result.symbols)) | |
3071 | { | |
3072 | VEC_free (symbolp, info.result.symbols); | |
3073 | *symbols = NULL; | |
14e91ac5 DC |
3074 | } |
3075 | else | |
40e084e1 KS |
3076 | *symbols = info.result.symbols; |
3077 | ||
f60e2d5c | 3078 | if (VEC_empty (bound_minimal_symbol_d, info.result.minimal_symbols)) |
14e91ac5 | 3079 | { |
f60e2d5c | 3080 | VEC_free (bound_minimal_symbol_d, info.result.minimal_symbols); |
40e084e1 KS |
3081 | *minsyms = NULL; |
3082 | } | |
3083 | else | |
3084 | *minsyms = info.result.minimal_symbols; | |
3085 | } | |
3086 | ||
3087 | /* Find all symbols named NAME in FILE_SYMTABS, returning debug symbols | |
3088 | in SYMBOLS and minimal symbols in MINSYMS. */ | |
14e91ac5 | 3089 | |
b1ae631a | 3090 | static void |
40e084e1 | 3091 | find_linespec_symbols (struct linespec_state *state, |
ec94af83 | 3092 | VEC (symtab_ptr) *file_symtabs, |
40e084e1 KS |
3093 | const char *name, |
3094 | VEC (symbolp) **symbols, | |
f60e2d5c | 3095 | VEC (bound_minimal_symbol_d) **minsyms) |
40e084e1 | 3096 | { |
40e084e1 | 3097 | struct cleanup *cleanup; |
cc81e1c6 DE |
3098 | char *canon; |
3099 | const char *lookup_name; | |
40e084e1 | 3100 | volatile struct gdb_exception except; |
f8eba3c6 | 3101 | |
40e084e1 KS |
3102 | cleanup = demangle_for_lookup (name, state->language->la_language, |
3103 | &lookup_name); | |
3104 | if (state->language->la_language == language_ada) | |
3105 | { | |
3106 | /* In Ada, the symbol lookups are performed using the encoded | |
3107 | name rather than the demangled name. */ | |
3108 | lookup_name = ada_name_for_lookup (name); | |
3109 | make_cleanup (xfree, (void *) lookup_name); | |
3110 | } | |
31aba06f | 3111 | |
40e084e1 KS |
3112 | canon = cp_canonicalize_string_no_typedefs (lookup_name); |
3113 | if (canon != NULL) | |
3114 | { | |
3115 | lookup_name = canon; | |
e61727ab | 3116 | make_cleanup (xfree, canon); |
40e084e1 | 3117 | } |
f8eba3c6 | 3118 | |
cc81e1c6 DE |
3119 | /* It's important to not call expand_symtabs_matching unnecessarily |
3120 | as it can really slow things down (by unnecessarily expanding | |
3121 | potentially 1000s of symtabs, which when debugging some apps can | |
3122 | cost 100s of seconds). Avoid this to some extent by *first* calling | |
3123 | find_function_symbols, and only if that doesn't find anything | |
3124 | *then* call find_method. This handles two important cases: | |
3125 | 1) break (anonymous namespace)::foo | |
3126 | 2) break class::method where method is in class (and not a baseclass) */ | |
14e91ac5 | 3127 | |
cc81e1c6 DE |
3128 | find_function_symbols (state, file_symtabs, lookup_name, |
3129 | symbols, minsyms); | |
14e91ac5 | 3130 | |
cc81e1c6 DE |
3131 | /* If we were unable to locate a symbol of the same name, try dividing |
3132 | the name into class and method names and searching the class and its | |
3133 | baseclasses. */ | |
3134 | if (VEC_empty (symbolp, *symbols) | |
f60e2d5c | 3135 | && VEC_empty (bound_minimal_symbol_d, *minsyms)) |
40e084e1 | 3136 | { |
cc81e1c6 DE |
3137 | char *klass, *method; |
3138 | const char *last, *p, *scope_op; | |
3139 | VEC (symbolp) *classes; | |
14e91ac5 | 3140 | |
cc81e1c6 DE |
3141 | /* See if we can find a scope operator and break this symbol |
3142 | name into namespaces${SCOPE_OPERATOR}class_name and method_name. */ | |
3143 | scope_op = "::"; | |
3144 | p = find_toplevel_string (lookup_name, scope_op); | |
3145 | if (p == NULL) | |
3146 | { | |
3147 | /* No C++ scope operator. Try Java. */ | |
3148 | scope_op = "."; | |
3149 | p = find_toplevel_string (lookup_name, scope_op); | |
3150 | } | |
14e91ac5 | 3151 | |
cc81e1c6 DE |
3152 | last = NULL; |
3153 | while (p != NULL) | |
f8eba3c6 | 3154 | { |
cc81e1c6 DE |
3155 | last = p; |
3156 | p = find_toplevel_string (p + strlen (scope_op), scope_op); | |
f8eba3c6 | 3157 | } |
14e91ac5 | 3158 | |
cc81e1c6 DE |
3159 | /* If no scope operator was found, there is nothing more we can do; |
3160 | we already attempted to lookup the entire name as a symbol | |
3161 | and failed. */ | |
3162 | if (last == NULL) | |
40e084e1 KS |
3163 | { |
3164 | do_cleanups (cleanup); | |
3165 | return; | |
3166 | } | |
cc81e1c6 DE |
3167 | |
3168 | /* LOOKUP_NAME points to the class name. | |
3169 | LAST points to the method name. */ | |
3170 | klass = xmalloc ((last - lookup_name + 1) * sizeof (char)); | |
3171 | make_cleanup (xfree, klass); | |
3172 | strncpy (klass, lookup_name, last - lookup_name); | |
3173 | klass[last - lookup_name] = '\0'; | |
3174 | ||
3175 | /* Skip past the scope operator. */ | |
3176 | last += strlen (scope_op); | |
3177 | method = xmalloc ((strlen (last) + 1) * sizeof (char)); | |
3178 | make_cleanup (xfree, method); | |
3179 | strcpy (method, last); | |
3180 | ||
3181 | /* Find a list of classes named KLASS. */ | |
3182 | classes = lookup_prefix_sym (state, file_symtabs, klass); | |
3183 | make_cleanup (VEC_cleanup (symbolp), &classes); | |
3184 | ||
3185 | if (!VEC_empty (symbolp, classes)) | |
3186 | { | |
3187 | /* Now locate a list of suitable methods named METHOD. */ | |
3188 | TRY_CATCH (except, RETURN_MASK_ERROR) | |
3189 | { | |
3190 | find_method (state, file_symtabs, klass, method, classes, | |
3191 | symbols, minsyms); | |
3192 | } | |
3193 | ||
3194 | /* If successful, we're done. If NOT_FOUND_ERROR | |
3195 | was not thrown, rethrow the exception that we did get. */ | |
3196 | if (except.reason < 0 && except.error != NOT_FOUND_ERROR) | |
3197 | throw_exception (except); | |
3198 | } | |
f8eba3c6 | 3199 | } |
14e91ac5 | 3200 | |
cc81e1c6 | 3201 | do_cleanups (cleanup); |
14e91ac5 DC |
3202 | } |
3203 | ||
40e084e1 KS |
3204 | /* Return all labels named NAME in FUNCTION_SYMBOLS. Return the |
3205 | actual function symbol in which the label was found in LABEL_FUNC_RET. */ | |
0f5238ed | 3206 | |
40e084e1 KS |
3207 | static VEC (symbolp) * |
3208 | find_label_symbols (struct linespec_state *self, | |
3209 | VEC (symbolp) *function_symbols, | |
3210 | VEC (symbolp) **label_funcs_ret, const char *name) | |
0f5238ed | 3211 | { |
f8eba3c6 | 3212 | int ix; |
40e084e1 KS |
3213 | struct block *block; |
3214 | struct symbol *sym; | |
3215 | struct symbol *fn_sym; | |
3216 | VEC (symbolp) *result = NULL; | |
9ef07c8c | 3217 | |
f8eba3c6 | 3218 | if (function_symbols == NULL) |
9ef07c8c | 3219 | { |
f8eba3c6 | 3220 | set_current_program_space (self->program_space); |
4eeaa230 | 3221 | block = get_current_search_block (); |
f8eba3c6 | 3222 | |
9ef07c8c TT |
3223 | for (; |
3224 | block && !BLOCK_FUNCTION (block); | |
3225 | block = BLOCK_SUPERBLOCK (block)) | |
3226 | ; | |
3227 | if (!block) | |
40e084e1 | 3228 | return NULL; |
f8eba3c6 TT |
3229 | fn_sym = BLOCK_FUNCTION (block); |
3230 | ||
40e084e1 | 3231 | sym = lookup_symbol (name, block, LABEL_DOMAIN, 0); |
f8eba3c6 | 3232 | |
40e084e1 KS |
3233 | if (sym != NULL) |
3234 | { | |
3235 | VEC_safe_push (symbolp, result, sym); | |
3236 | VEC_safe_push (symbolp, *label_funcs_ret, fn_sym); | |
3237 | } | |
3238 | } | |
3239 | else | |
3240 | { | |
3241 | for (ix = 0; | |
3242 | VEC_iterate (symbolp, function_symbols, ix, fn_sym); ++ix) | |
f8eba3c6 | 3243 | { |
40e084e1 KS |
3244 | set_current_program_space (SYMTAB_PSPACE (SYMBOL_SYMTAB (fn_sym))); |
3245 | block = SYMBOL_BLOCK_VALUE (fn_sym); | |
3246 | sym = lookup_symbol (name, block, LABEL_DOMAIN, 0); | |
3247 | ||
3248 | if (sym != NULL) | |
3249 | { | |
3250 | VEC_safe_push (symbolp, result, sym); | |
3251 | VEC_safe_push (symbolp, *label_funcs_ret, fn_sym); | |
3252 | } | |
f8eba3c6 | 3253 | } |
40e084e1 | 3254 | } |
f8eba3c6 | 3255 | |
40e084e1 KS |
3256 | return result; |
3257 | } | |
f8eba3c6 | 3258 | |
40e084e1 KS |
3259 | \f |
3260 | ||
3261 | /* A helper for create_sals_line_offset that handles the 'list_mode' case. */ | |
3262 | ||
3263 | static void | |
3264 | decode_digits_list_mode (struct linespec_state *self, | |
3265 | linespec_p ls, | |
3266 | struct symtabs_and_lines *values, | |
3267 | struct symtab_and_line val) | |
3268 | { | |
3269 | int ix; | |
3270 | struct symtab *elt; | |
3271 | ||
3272 | gdb_assert (self->list_mode); | |
3273 | ||
ec94af83 | 3274 | for (ix = 0; VEC_iterate (symtab_ptr, ls->file_symtabs, ix, elt); |
40e084e1 KS |
3275 | ++ix) |
3276 | { | |
3277 | /* The logic above should ensure this. */ | |
3278 | gdb_assert (elt != NULL); | |
3279 | ||
3280 | set_current_program_space (SYMTAB_PSPACE (elt)); | |
3281 | ||
3282 | /* Simplistic search just for the list command. */ | |
3283 | val.symtab = find_line_symtab (elt, val.line, NULL, NULL); | |
3284 | if (val.symtab == NULL) | |
3285 | val.symtab = elt; | |
3286 | val.pspace = SYMTAB_PSPACE (elt); | |
3287 | val.pc = 0; | |
3288 | val.explicit_line = 1; | |
3289 | ||
66f1999b | 3290 | add_sal_to_sals (self, values, &val, NULL, 0); |
f8eba3c6 | 3291 | } |
40e084e1 | 3292 | } |
f8eba3c6 | 3293 | |
40e084e1 KS |
3294 | /* A helper for create_sals_line_offset that iterates over the symtabs, |
3295 | adding lines to the VEC. */ | |
3296 | ||
3297 | static void | |
3298 | decode_digits_ordinary (struct linespec_state *self, | |
3299 | linespec_p ls, | |
3300 | int line, | |
3301 | struct symtabs_and_lines *sals, | |
3302 | struct linetable_entry **best_entry) | |
3303 | { | |
3304 | int ix; | |
3305 | struct symtab *elt; | |
f8eba3c6 | 3306 | |
ec94af83 | 3307 | for (ix = 0; VEC_iterate (symtab_ptr, ls->file_symtabs, ix, elt); ++ix) |
f8eba3c6 | 3308 | { |
40e084e1 KS |
3309 | int i; |
3310 | VEC (CORE_ADDR) *pcs; | |
3311 | CORE_ADDR pc; | |
3312 | ||
3313 | /* The logic above should ensure this. */ | |
3314 | gdb_assert (elt != NULL); | |
f8eba3c6 | 3315 | |
40e084e1 | 3316 | set_current_program_space (SYMTAB_PSPACE (elt)); |
f8eba3c6 | 3317 | |
40e084e1 KS |
3318 | pcs = find_pcs_for_symtab_line (elt, line, best_entry); |
3319 | for (i = 0; VEC_iterate (CORE_ADDR, pcs, i, pc); ++i) | |
f8eba3c6 TT |
3320 | { |
3321 | struct symtab_and_line sal; | |
40e084e1 KS |
3322 | |
3323 | init_sal (&sal); | |
3324 | sal.pspace = SYMTAB_PSPACE (elt); | |
3325 | sal.symtab = elt; | |
3326 | sal.line = line; | |
3327 | sal.pc = pc; | |
3328 | add_sal_to_sals_basic (sals, &sal); | |
f8eba3c6 | 3329 | } |
40e084e1 KS |
3330 | |
3331 | VEC_free (CORE_ADDR, pcs); | |
f8eba3c6 | 3332 | } |
40e084e1 KS |
3333 | } |
3334 | ||
3335 | \f | |
3336 | ||
3337 | /* Return the line offset represented by VARIABLE. */ | |
3338 | ||
3339 | static struct line_offset | |
3340 | linespec_parse_variable (struct linespec_state *self, const char *variable) | |
3341 | { | |
3342 | int index = 0; | |
3343 | const char *p; | |
3344 | struct line_offset offset = {0, LINE_OFFSET_NONE}; | |
f8eba3c6 | 3345 | |
40e084e1 KS |
3346 | p = (variable[1] == '$') ? variable + 2 : variable + 1; |
3347 | if (*p == '$') | |
3348 | ++p; | |
3349 | while (*p >= '0' && *p <= '9') | |
3350 | ++p; | |
3351 | if (!*p) /* Reached end of token without hitting non-digit. */ | |
f8eba3c6 | 3352 | { |
40e084e1 KS |
3353 | /* We have a value history reference. */ |
3354 | struct value *val_history; | |
f8eba3c6 | 3355 | |
40e084e1 KS |
3356 | sscanf ((variable[1] == '$') ? variable + 2 : variable + 1, "%d", &index); |
3357 | val_history | |
3358 | = access_value_history ((variable[1] == '$') ? -index : index); | |
3359 | if (TYPE_CODE (value_type (val_history)) != TYPE_CODE_INT) | |
3360 | error (_("History values used in line " | |
3361 | "specs must have integer values.")); | |
3362 | offset.offset = value_as_long (val_history); | |
3363 | } | |
3364 | else | |
3365 | { | |
3366 | /* Not all digits -- may be user variable/function or a | |
3367 | convenience variable. */ | |
3368 | LONGEST valx; | |
3369 | struct internalvar *ivar; | |
3370 | ||
3371 | /* Try it as a convenience variable. If it is not a convenience | |
3372 | variable, return and allow normal symbol lookup to occur. */ | |
3373 | ivar = lookup_only_internalvar (variable + 1); | |
3374 | if (ivar == NULL) | |
3375 | /* No internal variable with that name. Mark the offset | |
3376 | as unknown to allow the name to be looked up as a symbol. */ | |
3377 | offset.sign = LINE_OFFSET_UNKNOWN; | |
3378 | else | |
3379 | { | |
3380 | /* We found a valid variable name. If it is not an integer, | |
3381 | throw an error. */ | |
3382 | if (!get_internalvar_integer (ivar, &valx)) | |
3383 | error (_("Convenience variables used in line " | |
3384 | "specs must have integer values.")); | |
3385 | else | |
3386 | offset.offset = valx; | |
3387 | } | |
f8eba3c6 TT |
3388 | } |
3389 | ||
40e084e1 | 3390 | return offset; |
f8eba3c6 | 3391 | } |
40e084e1 | 3392 | \f |
f8eba3c6 TT |
3393 | |
3394 | /* A callback used to possibly add a symbol to the results. */ | |
3395 | ||
3396 | static int | |
3397 | collect_symbols (struct symbol *sym, void *data) | |
3398 | { | |
3399 | struct collect_info *info = data; | |
f8eba3c6 | 3400 | |
40e084e1 KS |
3401 | /* In list mode, add all matching symbols, regardless of class. |
3402 | This allows the user to type "list a_global_variable". */ | |
3403 | if (SYMBOL_CLASS (sym) == LOC_BLOCK || info->state->list_mode) | |
3404 | VEC_safe_push (symbolp, info->result.symbols, sym); | |
8e704927 | 3405 | return 1; /* Continue iterating. */ |
f8eba3c6 TT |
3406 | } |
3407 | ||
40e084e1 KS |
3408 | /* We've found a minimal symbol MSYMBOL in OBJFILE to associate with our |
3409 | linespec; return the SAL in RESULT. */ | |
f8eba3c6 TT |
3410 | |
3411 | static void | |
3412 | minsym_found (struct linespec_state *self, struct objfile *objfile, | |
3413 | struct minimal_symbol *msymbol, | |
3414 | struct symtabs_and_lines *result) | |
3415 | { | |
3416 | struct gdbarch *gdbarch = get_objfile_arch (objfile); | |
3417 | CORE_ADDR pc; | |
3418 | struct symtab_and_line sal; | |
3419 | ||
3420 | sal = find_pc_sect_line (SYMBOL_VALUE_ADDRESS (msymbol), | |
3421 | (struct obj_section *) 0, 0); | |
e27d198c | 3422 | sal.section = SYMBOL_OBJ_SECTION (objfile, msymbol); |
f8eba3c6 TT |
3423 | |
3424 | /* The minimal symbol might point to a function descriptor; | |
3425 | resolve it to the actual code address instead. */ | |
3426 | pc = gdbarch_convert_from_func_ptr_addr (gdbarch, sal.pc, ¤t_target); | |
3427 | if (pc != sal.pc) | |
3428 | sal = find_pc_sect_line (pc, NULL, 0); | |
3429 | ||
3430 | if (self->funfirstline) | |
3431 | skip_prologue_sal (&sal); | |
3432 | ||
07fea4b4 | 3433 | if (maybe_add_address (self->addr_set, objfile->pspace, sal.pc)) |
66f1999b | 3434 | add_sal_to_sals (self, result, &sal, SYMBOL_NATURAL_NAME (msymbol), 0); |
f8eba3c6 TT |
3435 | } |
3436 | ||
39b856a4 TT |
3437 | /* A helper struct to pass some data through |
3438 | iterate_over_minimal_symbols. */ | |
3439 | ||
3440 | struct collect_minsyms | |
3441 | { | |
3442 | /* The objfile we're examining. */ | |
3443 | struct objfile *objfile; | |
3444 | ||
3445 | /* The funfirstline setting from the initial call. */ | |
3446 | int funfirstline; | |
3447 | ||
095bcf5e JB |
3448 | /* The list_mode setting from the initial call. */ |
3449 | int list_mode; | |
3450 | ||
39b856a4 | 3451 | /* The resulting symbols. */ |
f60e2d5c | 3452 | VEC (bound_minimal_symbol_d) *msyms; |
39b856a4 TT |
3453 | }; |
3454 | ||
3455 | /* A helper function to classify a minimal_symbol_type according to | |
3456 | priority. */ | |
3457 | ||
3458 | static int | |
3459 | classify_mtype (enum minimal_symbol_type t) | |
3460 | { | |
3461 | switch (t) | |
f8eba3c6 | 3462 | { |
39b856a4 TT |
3463 | case mst_file_text: |
3464 | case mst_file_data: | |
3465 | case mst_file_bss: | |
3466 | /* Intermediate priority. */ | |
3467 | return 1; | |
3468 | ||
3469 | case mst_solib_trampoline: | |
3470 | /* Lowest priority. */ | |
3471 | return 2; | |
3472 | ||
3473 | default: | |
3474 | /* Highest priority. */ | |
3475 | return 0; | |
f8eba3c6 | 3476 | } |
39b856a4 TT |
3477 | } |
3478 | ||
3479 | /* Callback for qsort that sorts symbols by priority. */ | |
3480 | ||
3481 | static int | |
3482 | compare_msyms (const void *a, const void *b) | |
3483 | { | |
f60e2d5c TT |
3484 | const bound_minimal_symbol_d *moa = a; |
3485 | const bound_minimal_symbol_d *mob = b; | |
39b856a4 TT |
3486 | enum minimal_symbol_type ta = MSYMBOL_TYPE (moa->minsym); |
3487 | enum minimal_symbol_type tb = MSYMBOL_TYPE (mob->minsym); | |
3488 | ||
3489 | return classify_mtype (ta) - classify_mtype (tb); | |
3490 | } | |
3491 | ||
3492 | /* Callback for iterate_over_minimal_symbols that adds the symbol to | |
3493 | the result. */ | |
3494 | ||
3495 | static void | |
3496 | add_minsym (struct minimal_symbol *minsym, void *d) | |
3497 | { | |
3498 | struct collect_minsyms *info = d; | |
f60e2d5c | 3499 | bound_minimal_symbol_d mo; |
39b856a4 | 3500 | |
095bcf5e JB |
3501 | /* Exclude data symbols when looking for breakpoint locations. */ |
3502 | if (!info->list_mode) | |
3503 | switch (minsym->type) | |
3504 | { | |
3505 | case mst_slot_got_plt: | |
3506 | case mst_data: | |
3507 | case mst_bss: | |
3508 | case mst_abs: | |
3509 | case mst_file_data: | |
3510 | case mst_file_bss: | |
1a2da5ee JB |
3511 | { |
3512 | /* Make sure this minsym is not a function descriptor | |
3513 | before we decide to discard it. */ | |
df6d5441 | 3514 | struct gdbarch *gdbarch = get_objfile_arch (info->objfile); |
1a2da5ee JB |
3515 | CORE_ADDR addr = gdbarch_convert_from_func_ptr_addr |
3516 | (gdbarch, SYMBOL_VALUE_ADDRESS (minsym), | |
3517 | ¤t_target); | |
3518 | ||
3519 | if (addr == SYMBOL_VALUE_ADDRESS (minsym)) | |
3520 | return; | |
3521 | } | |
095bcf5e JB |
3522 | } |
3523 | ||
39b856a4 TT |
3524 | mo.minsym = minsym; |
3525 | mo.objfile = info->objfile; | |
f60e2d5c | 3526 | VEC_safe_push (bound_minimal_symbol_d, info->msyms, &mo); |
f8eba3c6 TT |
3527 | } |
3528 | ||
3529 | /* Search minimal symbols in all objfiles for NAME. If SEARCH_PSPACE | |
3530 | is not NULL, the search is restricted to just that program | |
3531 | space. */ | |
3532 | ||
3533 | static void | |
3534 | search_minsyms_for_name (struct collect_info *info, const char *name, | |
3535 | struct program_space *search_pspace) | |
3536 | { | |
3537 | struct objfile *objfile; | |
3538 | struct program_space *pspace; | |
3539 | ||
3540 | ALL_PSPACES (pspace) | |
3541 | { | |
39b856a4 TT |
3542 | struct collect_minsyms local; |
3543 | struct cleanup *cleanup; | |
3544 | ||
f8eba3c6 TT |
3545 | if (search_pspace != NULL && search_pspace != pspace) |
3546 | continue; | |
3547 | if (pspace->executing_startup) | |
3548 | continue; | |
3549 | ||
3550 | set_current_program_space (pspace); | |
3551 | ||
39b856a4 TT |
3552 | memset (&local, 0, sizeof (local)); |
3553 | local.funfirstline = info->state->funfirstline; | |
095bcf5e | 3554 | local.list_mode = info->state->list_mode; |
39b856a4 | 3555 | |
f60e2d5c | 3556 | cleanup = make_cleanup (VEC_cleanup (bound_minimal_symbol_d), |
39b856a4 TT |
3557 | &local.msyms); |
3558 | ||
f8eba3c6 TT |
3559 | ALL_OBJFILES (objfile) |
3560 | { | |
39b856a4 TT |
3561 | local.objfile = objfile; |
3562 | iterate_over_minimal_symbols (objfile, name, add_minsym, &local); | |
9ef07c8c | 3563 | } |
39b856a4 | 3564 | |
f60e2d5c | 3565 | if (!VEC_empty (bound_minimal_symbol_d, local.msyms)) |
39b856a4 TT |
3566 | { |
3567 | int classification; | |
3568 | int ix; | |
f60e2d5c | 3569 | bound_minimal_symbol_d *item; |
39b856a4 | 3570 | |
f60e2d5c TT |
3571 | qsort (VEC_address (bound_minimal_symbol_d, local.msyms), |
3572 | VEC_length (bound_minimal_symbol_d, local.msyms), | |
3573 | sizeof (bound_minimal_symbol_d), | |
39b856a4 TT |
3574 | compare_msyms); |
3575 | ||
3576 | /* Now the minsyms are in classification order. So, we walk | |
3577 | over them and process just the minsyms with the same | |
3578 | classification as the very first minsym in the list. */ | |
f60e2d5c | 3579 | item = VEC_index (bound_minimal_symbol_d, local.msyms, 0); |
39b856a4 TT |
3580 | classification = classify_mtype (MSYMBOL_TYPE (item->minsym)); |
3581 | ||
3582 | for (ix = 0; | |
f60e2d5c | 3583 | VEC_iterate (bound_minimal_symbol_d, local.msyms, ix, item); |
39b856a4 TT |
3584 | ++ix) |
3585 | { | |
3586 | if (classify_mtype (MSYMBOL_TYPE (item->minsym)) != classification) | |
3587 | break; | |
3588 | ||
f60e2d5c | 3589 | VEC_safe_push (bound_minimal_symbol_d, |
40e084e1 | 3590 | info->result.minimal_symbols, item); |
39b856a4 TT |
3591 | } |
3592 | } | |
3593 | ||
3594 | do_cleanups (cleanup); | |
f8eba3c6 TT |
3595 | } |
3596 | } | |
3597 | ||
3598 | /* A helper function to add all symbols matching NAME to INFO. If | |
3599 | PSPACE is not NULL, the search is restricted to just that program | |
3600 | space. */ | |
0f5238ed | 3601 | |
f8eba3c6 TT |
3602 | static void |
3603 | add_matching_symbols_to_info (const char *name, | |
3604 | struct collect_info *info, | |
3605 | struct program_space *pspace) | |
3606 | { | |
3607 | int ix; | |
3608 | struct symtab *elt; | |
0f5238ed | 3609 | |
ec94af83 | 3610 | for (ix = 0; VEC_iterate (symtab_ptr, info->file_symtabs, ix, elt); ++ix) |
f8eba3c6 | 3611 | { |
f8eba3c6 TT |
3612 | if (elt == NULL) |
3613 | { | |
40e084e1 | 3614 | iterate_over_all_matching_symtabs (info->state, name, VAR_DOMAIN, |
f8eba3c6 | 3615 | collect_symbols, info, |
481860b3 | 3616 | pspace, 1); |
f8eba3c6 TT |
3617 | search_minsyms_for_name (info, name, pspace); |
3618 | } | |
3619 | else if (pspace == NULL || pspace == SYMTAB_PSPACE (elt)) | |
3620 | { | |
3621 | /* Program spaces that are executing startup should have | |
3622 | been filtered out earlier. */ | |
3623 | gdb_assert (!SYMTAB_PSPACE (elt)->executing_startup); | |
3624 | set_current_program_space (SYMTAB_PSPACE (elt)); | |
4eeaa230 DE |
3625 | iterate_over_file_blocks (elt, name, VAR_DOMAIN, |
3626 | collect_symbols, info); | |
f8eba3c6 TT |
3627 | } |
3628 | } | |
0f5238ed TT |
3629 | } |
3630 | ||
14e91ac5 DC |
3631 | \f |
3632 | ||
413dad4d DC |
3633 | /* Now come some functions that are called from multiple places within |
3634 | decode_line_1. */ | |
3635 | ||
f8eba3c6 TT |
3636 | static int |
3637 | symbol_to_sal (struct symtab_and_line *result, | |
3638 | int funfirstline, struct symbol *sym) | |
413dad4d | 3639 | { |
413dad4d | 3640 | if (SYMBOL_CLASS (sym) == LOC_BLOCK) |
50641945 | 3641 | { |
f8eba3c6 TT |
3642 | *result = find_function_start_sal (sym, funfirstline); |
3643 | return 1; | |
50641945 | 3644 | } |
413dad4d DC |
3645 | else |
3646 | { | |
62853458 | 3647 | if (SYMBOL_CLASS (sym) == LOC_LABEL && SYMBOL_VALUE_ADDRESS (sym) != 0) |
413dad4d | 3648 | { |
f8eba3c6 TT |
3649 | init_sal (result); |
3650 | result->symtab = SYMBOL_SYMTAB (sym); | |
3651 | result->line = SYMBOL_LINE (sym); | |
3652 | result->pc = SYMBOL_VALUE_ADDRESS (sym); | |
3653 | result->pspace = SYMTAB_PSPACE (SYMBOL_SYMTAB (sym)); | |
3654 | result->explicit_pc = 1; | |
3655 | return 1; | |
413dad4d | 3656 | } |
62853458 | 3657 | else if (funfirstline) |
dcf9f4ab | 3658 | { |
f8eba3c6 | 3659 | /* Nothing. */ |
dcf9f4ab | 3660 | } |
62853458 TT |
3661 | else if (SYMBOL_LINE (sym) != 0) |
3662 | { | |
3663 | /* We know its line number. */ | |
f8eba3c6 TT |
3664 | init_sal (result); |
3665 | result->symtab = SYMBOL_SYMTAB (sym); | |
3666 | result->line = SYMBOL_LINE (sym); | |
3667 | result->pspace = SYMTAB_PSPACE (SYMBOL_SYMTAB (sym)); | |
3668 | return 1; | |
62853458 | 3669 | } |
413dad4d | 3670 | } |
f8eba3c6 TT |
3671 | |
3672 | return 0; | |
413dad4d | 3673 | } |
50641945 | 3674 | |
f8eba3c6 | 3675 | /* See the comment in linespec.h. */ |
50641945 | 3676 | |
f8eba3c6 TT |
3677 | void |
3678 | init_linespec_result (struct linespec_result *lr) | |
413dad4d | 3679 | { |
f8eba3c6 TT |
3680 | memset (lr, 0, sizeof (*lr)); |
3681 | } | |
413dad4d | 3682 | |
f8eba3c6 | 3683 | /* See the comment in linespec.h. */ |
bccdca4a | 3684 | |
f8eba3c6 TT |
3685 | void |
3686 | destroy_linespec_result (struct linespec_result *ls) | |
3687 | { | |
3688 | int i; | |
3689 | struct linespec_sals *lsal; | |
bccdca4a | 3690 | |
f8eba3c6 TT |
3691 | xfree (ls->addr_string); |
3692 | for (i = 0; VEC_iterate (linespec_sals, ls->sals, i, lsal); ++i) | |
3693 | { | |
3694 | xfree (lsal->canonical); | |
3695 | xfree (lsal->sals.sals); | |
3696 | } | |
3697 | VEC_free (linespec_sals, ls->sals); | |
3698 | } | |
e48883f7 | 3699 | |
f8eba3c6 TT |
3700 | /* Cleanup function for a linespec_result. */ |
3701 | ||
3702 | static void | |
3703 | cleanup_linespec_result (void *a) | |
3704 | { | |
3705 | destroy_linespec_result (a); | |
50641945 | 3706 | } |
7efd8fc2 | 3707 | |
f8eba3c6 TT |
3708 | /* See the comment in linespec.h. */ |
3709 | ||
3710 | struct cleanup * | |
3711 | make_cleanup_destroy_linespec_result (struct linespec_result *ls) | |
7efd8fc2 | 3712 | { |
f8eba3c6 | 3713 | return make_cleanup (cleanup_linespec_result, ls); |
7efd8fc2 | 3714 | } |