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