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