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