Commit | Line | Data |
---|---|---|
50641945 | 1 | /* Parser for linespec for the GNU debugger, GDB. |
05ff989b | 2 | |
e2882c85 | 3 | Copyright (C) 1986-2018 Free Software Foundation, Inc. |
50641945 FN |
4 | |
5 | This file is part of GDB. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
50641945 FN |
10 | (at your option) any later version. |
11 | ||
12 | This program is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
50641945 FN |
19 | |
20 | #include "defs.h" | |
21 | #include "symtab.h" | |
c5f0f3d0 FN |
22 | #include "frame.h" |
23 | #include "command.h" | |
50641945 FN |
24 | #include "symfile.h" |
25 | #include "objfiles.h" | |
0378c332 | 26 | #include "source.h" |
50641945 | 27 | #include "demangle.h" |
c5f0f3d0 FN |
28 | #include "value.h" |
29 | #include "completer.h" | |
015a42b4 | 30 | #include "cp-abi.h" |
12907978 | 31 | #include "cp-support.h" |
c38da1af | 32 | #include "parser-defs.h" |
fe898f56 | 33 | #include "block.h" |
d2630e69 | 34 | #include "objc-lang.h" |
b9362cc7 | 35 | #include "linespec.h" |
53c5240f | 36 | #include "language.h" |
dc67126b NR |
37 | #include "interps.h" |
38 | #include "mi/mi-cmds.h" | |
bccdca4a | 39 | #include "target.h" |
94af9270 | 40 | #include "arch-utils.h" |
c00f8484 KS |
41 | #include <ctype.h> |
42 | #include "cli/cli-utils.h" | |
731971ed | 43 | #include "filenames.h" |
f8eba3c6 | 44 | #include "ada-lang.h" |
39cf75f7 | 45 | #include "stack.h" |
f00aae0f | 46 | #include "location.h" |
14bc53a8 | 47 | #include "common/function-view.h" |
0fc21fd8 | 48 | #include "common/def-vector.h" |
41c1efc6 | 49 | #include <algorithm> |
f8eba3c6 | 50 | |
c45ec17c PA |
51 | /* An enumeration of the various things a user might attempt to |
52 | complete for a linespec location. */ | |
53 | ||
54 | enum class linespec_complete_what | |
55 | { | |
56 | /* Nothing, no possible completion. */ | |
57 | NOTHING, | |
58 | ||
59 | /* A function/method name. Due to ambiguity between | |
60 | ||
61 | (gdb) b source[TAB] | |
62 | source_file.c | |
63 | source_function | |
64 | ||
65 | this can also indicate a source filename, iff we haven't seen a | |
66 | separate source filename component, as in "b source.c:function". */ | |
67 | FUNCTION, | |
68 | ||
69 | /* A label symbol. E.g., break file.c:function:LABEL. */ | |
70 | LABEL, | |
71 | ||
72 | /* An expression. E.g., "break foo if EXPR", or "break *EXPR". */ | |
73 | EXPRESSION, | |
74 | ||
75 | /* A linespec keyword ("if"/"thread"/"task"). | |
76 | E.g., "break func threa<tab>". */ | |
77 | KEYWORD, | |
78 | }; | |
79 | ||
f8eba3c6 TT |
80 | /* An address entry is used to ensure that any given location is only |
81 | added to the result a single time. It holds an address and the | |
82 | program space from which the address came. */ | |
83 | ||
84 | struct address_entry | |
85 | { | |
86 | struct program_space *pspace; | |
87 | CORE_ADDR addr; | |
88 | }; | |
89 | ||
40e084e1 KS |
90 | /* A linespec. Elements of this structure are filled in by a parser |
91 | (either parse_linespec or some other function). The structure is | |
92 | then converted into SALs by convert_linespec_to_sals. */ | |
93 | ||
94 | struct linespec | |
95 | { | |
00e52e53 | 96 | /* An explicit location describing the SaLs. */ |
67994074 | 97 | struct explicit_location explicit_loc; |
40e084e1 KS |
98 | |
99 | /* The list of symtabs to search to which to limit the search. May not | |
00e52e53 KS |
100 | be NULL. If explicit.SOURCE_FILENAME is NULL (no user-specified |
101 | filename), FILE_SYMTABS should contain one single NULL member. This | |
102 | will cause the code to use the default symtab. */ | |
2a908241 | 103 | std::vector<symtab *> *file_symtabs; |
40e084e1 | 104 | |
40e084e1 | 105 | /* A list of matching function symbols and minimal symbols. Both lists |
7243d011 | 106 | may be NULL (or empty) if no matching symbols were found. */ |
7e41c8db | 107 | std::vector<block_symbol> *function_symbols; |
c2a031c5 | 108 | std::vector<bound_minimal_symbol> *minimal_symbols; |
40e084e1 | 109 | |
40e084e1 KS |
110 | /* A structure of matching label symbols and the corresponding |
111 | function symbol in which the label was found. Both may be NULL | |
112 | or both must be non-NULL. */ | |
113 | struct | |
114 | { | |
7e41c8db KS |
115 | std::vector<block_symbol> *label_symbols; |
116 | std::vector<block_symbol> *function_symbols; | |
40e084e1 | 117 | } labels; |
40e084e1 KS |
118 | }; |
119 | typedef struct linespec *linespec_p; | |
120 | ||
33f448b1 JK |
121 | /* A canonical linespec represented as a symtab-related string. |
122 | ||
123 | Each entry represents the "SYMTAB:SUFFIX" linespec string. | |
124 | SYMTAB can be converted for example by symtab_to_fullname or | |
125 | symtab_to_filename_for_display as needed. */ | |
126 | ||
127 | struct linespec_canonical_name | |
128 | { | |
129 | /* Remaining text part of the linespec string. */ | |
130 | char *suffix; | |
131 | ||
132 | /* If NULL then SUFFIX is the whole linespec string. */ | |
133 | struct symtab *symtab; | |
134 | }; | |
135 | ||
f8eba3c6 TT |
136 | /* An instance of this is used to keep all state while linespec |
137 | operates. This instance is passed around as a 'this' pointer to | |
138 | the various implementation methods. */ | |
139 | ||
140 | struct linespec_state | |
141 | { | |
40e084e1 KS |
142 | /* The language in use during linespec processing. */ |
143 | const struct language_defn *language; | |
144 | ||
f8eba3c6 TT |
145 | /* The program space as seen when the module was entered. */ |
146 | struct program_space *program_space; | |
147 | ||
c2f4122d PA |
148 | /* If not NULL, the search is restricted to just this program |
149 | space. */ | |
150 | struct program_space *search_pspace; | |
151 | ||
f8eba3c6 TT |
152 | /* The default symtab to use, if no other symtab is specified. */ |
153 | struct symtab *default_symtab; | |
154 | ||
155 | /* The default line to use. */ | |
156 | int default_line; | |
157 | ||
f8eba3c6 TT |
158 | /* The 'funfirstline' value that was passed in to decode_line_1 or |
159 | decode_line_full. */ | |
160 | int funfirstline; | |
161 | ||
162 | /* Nonzero if we are running in 'list' mode; see decode_line_list. */ | |
163 | int list_mode; | |
164 | ||
165 | /* The 'canonical' value passed to decode_line_full, or NULL. */ | |
166 | struct linespec_result *canonical; | |
167 | ||
6c5b2ebe | 168 | /* Canonical strings that mirror the std::vector<symtab_and_line> result. */ |
33f448b1 | 169 | struct linespec_canonical_name *canonical_names; |
f8eba3c6 TT |
170 | |
171 | /* This is a set of address_entry objects which is used to prevent | |
172 | duplicate symbols from being entered into the result. */ | |
173 | htab_t addr_set; | |
00e52e53 KS |
174 | |
175 | /* Are we building a linespec? */ | |
176 | int is_linespec; | |
f8eba3c6 TT |
177 | }; |
178 | ||
179 | /* This is a helper object that is used when collecting symbols into a | |
180 | result. */ | |
181 | ||
182 | struct collect_info | |
183 | { | |
184 | /* The linespec object in use. */ | |
185 | struct linespec_state *state; | |
186 | ||
40e084e1 | 187 | /* A list of symtabs to which to restrict matches. */ |
2a908241 | 188 | std::vector<symtab *> *file_symtabs; |
40e084e1 | 189 | |
f8eba3c6 | 190 | /* The result being accumulated. */ |
40e084e1 KS |
191 | struct |
192 | { | |
7e41c8db | 193 | std::vector<block_symbol> *symbols; |
c2a031c5 | 194 | std::vector<bound_minimal_symbol> *minimal_symbols; |
40e084e1 | 195 | } result; |
14bc53a8 PA |
196 | |
197 | /* Possibly add a symbol to the results. */ | |
fcaad03c | 198 | virtual bool add_symbol (block_symbol *bsym); |
f8eba3c6 | 199 | }; |
50641945 | 200 | |
14bc53a8 | 201 | bool |
7e41c8db | 202 | collect_info::add_symbol (block_symbol *bsym) |
14bc53a8 PA |
203 | { |
204 | /* In list mode, add all matching symbols, regardless of class. | |
205 | This allows the user to type "list a_global_variable". */ | |
7e41c8db KS |
206 | if (SYMBOL_CLASS (bsym->symbol) == LOC_BLOCK || this->state->list_mode) |
207 | this->result.symbols->push_back (*bsym); | |
14bc53a8 PA |
208 | |
209 | /* Continue iterating. */ | |
210 | return true; | |
211 | } | |
212 | ||
fcaad03c KS |
213 | /* Custom collect_info for symbol_searcher. */ |
214 | ||
215 | struct symbol_searcher_collect_info | |
216 | : collect_info | |
217 | { | |
218 | bool add_symbol (block_symbol *bsym) override | |
219 | { | |
220 | /* Add everything. */ | |
221 | this->result.symbols->push_back (*bsym); | |
222 | ||
223 | /* Continue iterating. */ | |
224 | return true; | |
225 | } | |
226 | }; | |
227 | ||
40e084e1 | 228 | /* Token types */ |
50641945 | 229 | |
40e084e1 KS |
230 | enum ls_token_type |
231 | { | |
232 | /* A keyword */ | |
233 | LSTOKEN_KEYWORD = 0, | |
44fe14ab | 234 | |
40e084e1 KS |
235 | /* A colon "separator" */ |
236 | LSTOKEN_COLON, | |
44fe14ab | 237 | |
40e084e1 KS |
238 | /* A string */ |
239 | LSTOKEN_STRING, | |
0960f083 | 240 | |
40e084e1 KS |
241 | /* A number */ |
242 | LSTOKEN_NUMBER, | |
243 | ||
244 | /* A comma */ | |
245 | LSTOKEN_COMMA, | |
246 | ||
247 | /* EOI (end of input) */ | |
248 | LSTOKEN_EOI, | |
249 | ||
250 | /* Consumed token */ | |
251 | LSTOKEN_CONSUMED | |
252 | }; | |
253 | typedef enum ls_token_type linespec_token_type; | |
254 | ||
c6756f62 PA |
255 | /* List of keywords. This is NULL-terminated so that it can be used |
256 | as enum completer. */ | |
257 | const char * const linespec_keywords[] = { "if", "thread", "task", NULL }; | |
0578b14e | 258 | #define IF_KEYWORD_INDEX 0 |
40e084e1 KS |
259 | |
260 | /* A token of the linespec lexer */ | |
261 | ||
262 | struct ls_token | |
263 | { | |
264 | /* The type of the token */ | |
265 | linespec_token_type type; | |
266 | ||
267 | /* Data for the token */ | |
268 | union | |
269 | { | |
270 | /* A string, given as a stoken */ | |
271 | struct stoken string; | |
272 | ||
273 | /* A keyword */ | |
274 | const char *keyword; | |
275 | } data; | |
276 | }; | |
277 | typedef struct ls_token linespec_token; | |
278 | ||
279 | #define LS_TOKEN_STOKEN(TOK) (TOK).data.string | |
280 | #define LS_TOKEN_KEYWORD(TOK) (TOK).data.keyword | |
281 | ||
282 | /* An instance of the linespec parser. */ | |
283 | ||
284 | struct ls_parser | |
285 | { | |
286 | /* Lexer internal data */ | |
287 | struct | |
288 | { | |
289 | /* Save head of input stream. */ | |
d7561cbb | 290 | const char *saved_arg; |
d2630e69 | 291 | |
40e084e1 | 292 | /* Head of the input stream. */ |
f00aae0f KS |
293 | const char *stream; |
294 | #define PARSER_STREAM(P) ((P)->lexer.stream) | |
614b3b14 | 295 | |
40e084e1 KS |
296 | /* The current token. */ |
297 | linespec_token current; | |
298 | } lexer; | |
93d91629 | 299 | |
40e084e1 KS |
300 | /* Is the entire linespec quote-enclosed? */ |
301 | int is_quote_enclosed; | |
302 | ||
303 | /* The state of the parse. */ | |
304 | struct linespec_state state; | |
305 | #define PARSER_STATE(PPTR) (&(PPTR)->state) | |
4224873a | 306 | |
40e084e1 KS |
307 | /* The result of the parse. */ |
308 | struct linespec result; | |
309 | #define PARSER_RESULT(PPTR) (&(PPTR)->result) | |
c45ec17c PA |
310 | |
311 | /* What the parser believes the current word point should complete | |
312 | to. */ | |
313 | linespec_complete_what complete_what; | |
314 | ||
315 | /* The completion word point. The parser advances this as it skips | |
316 | tokens. At some point the input string will end or parsing will | |
317 | fail, and then we attempt completion at the captured completion | |
318 | word point, interpreting the string at completion_word as | |
319 | COMPLETE_WHAT. */ | |
320 | const char *completion_word; | |
321 | ||
322 | /* If the current token was a quoted string, then this is the | |
323 | quoting character (either " or '). */ | |
324 | int completion_quote_char; | |
325 | ||
326 | /* If the current token was a quoted string, then this points at the | |
327 | end of the quoted string. */ | |
328 | const char *completion_quote_end; | |
329 | ||
330 | /* If parsing for completion, then this points at the completion | |
331 | tracker. Otherwise, this is NULL. */ | |
332 | struct completion_tracker *completion_tracker; | |
40e084e1 KS |
333 | }; |
334 | typedef struct ls_parser linespec_parser; | |
50641945 | 335 | |
00e52e53 KS |
336 | /* A convenience macro for accessing the explicit location result of |
337 | the parser. */ | |
67994074 | 338 | #define PARSER_EXPLICIT(PPTR) (&PARSER_RESULT ((PPTR))->explicit_loc) |
00e52e53 | 339 | |
40e084e1 | 340 | /* Prototypes for local functions. */ |
50641945 | 341 | |
14bc53a8 | 342 | static void iterate_over_file_blocks |
b5ec771e PA |
343 | (struct symtab *symtab, const lookup_name_info &name, |
344 | domain_enum domain, | |
14bc53a8 | 345 | gdb::function_view<symbol_found_callback_ftype> callback); |
4eeaa230 | 346 | |
40e084e1 KS |
347 | static void initialize_defaults (struct symtab **default_symtab, |
348 | int *default_line); | |
50641945 | 349 | |
a06efdd6 | 350 | CORE_ADDR linespec_expression_to_pc (const char **exp_ptr); |
aee8d8ba | 351 | |
6c5b2ebe PA |
352 | static std::vector<symtab_and_line> decode_objc (struct linespec_state *self, |
353 | linespec_p ls, | |
354 | const char *arg); | |
aee8d8ba | 355 | |
4717cec4 | 356 | static std::vector<symtab *> symtabs_from_filename |
2a908241 | 357 | (const char *, struct program_space *pspace); |
50641945 | 358 | |
7e41c8db KS |
359 | static std::vector<block_symbol> *find_label_symbols |
360 | (struct linespec_state *self, std::vector<block_symbol> *function_symbols, | |
361 | std::vector<block_symbol> *label_funcs_ret, const char *name, | |
7243d011 | 362 | bool completion_mode = false); |
50641945 | 363 | |
b1ae631a | 364 | static void find_linespec_symbols (struct linespec_state *self, |
2a908241 | 365 | std::vector<symtab *> *file_symtabs, |
b1ae631a | 366 | const char *name, |
a20714ff | 367 | symbol_name_match_type name_match_type, |
7e41c8db | 368 | std::vector<block_symbol> *symbols, |
c2a031c5 | 369 | std::vector<bound_minimal_symbol> *minsyms); |
f8eba3c6 | 370 | |
40e084e1 KS |
371 | static struct line_offset |
372 | linespec_parse_variable (struct linespec_state *self, | |
373 | const char *variable); | |
889f28e2 | 374 | |
f8eba3c6 TT |
375 | static int symbol_to_sal (struct symtab_and_line *result, |
376 | int funfirstline, struct symbol *sym); | |
50641945 | 377 | |
f8eba3c6 | 378 | static void add_matching_symbols_to_info (const char *name, |
b5ec771e | 379 | symbol_name_match_type name_match_type, |
56d87ef7 | 380 | enum search_domain search_domain, |
f8eba3c6 TT |
381 | struct collect_info *info, |
382 | struct program_space *pspace); | |
f3c39e76 | 383 | |
9b2f8581 TT |
384 | static void add_all_symbol_names_from_pspace |
385 | (struct collect_info *info, struct program_space *pspace, | |
386 | const std::vector<const char *> &names, enum search_domain search_domain); | |
9ef07c8c | 387 | |
4717cec4 | 388 | static std::vector<symtab *> |
c2f4122d PA |
389 | collect_symtabs_from_filename (const char *file, |
390 | struct program_space *pspace); | |
84fba31b | 391 | |
6c5b2ebe PA |
392 | static std::vector<symtab_and_line> decode_digits_ordinary |
393 | (struct linespec_state *self, | |
394 | linespec_p ls, | |
395 | int line, | |
396 | linetable_entry **best_entry); | |
14e91ac5 | 397 | |
6c5b2ebe PA |
398 | static std::vector<symtab_and_line> decode_digits_list_mode |
399 | (struct linespec_state *self, | |
400 | linespec_p ls, | |
401 | struct symtab_and_line val); | |
0f5238ed | 402 | |
40e084e1 KS |
403 | static void minsym_found (struct linespec_state *self, struct objfile *objfile, |
404 | struct minimal_symbol *msymbol, | |
6c5b2ebe | 405 | std::vector<symtab_and_line> *result); |
bca02a8a | 406 | |
7e41c8db | 407 | static bool compare_symbols (const block_symbol &a, const block_symbol &b); |
413dad4d | 408 | |
c2a031c5 KS |
409 | static bool compare_msymbols (const bound_minimal_symbol &a, |
410 | const bound_minimal_symbol &b); | |
413dad4d | 411 | |
40e084e1 KS |
412 | /* Permitted quote characters for the parser. This is different from the |
413 | completer's quote characters to allow backward compatibility with the | |
414 | previous parser. */ | |
415 | static const char *const linespec_quote_characters = "\"\'"; | |
f8eba3c6 | 416 | |
40e084e1 KS |
417 | /* Lexer functions. */ |
418 | ||
419 | /* Lex a number from the input in PARSER. This only supports | |
dd3818c8 KS |
420 | decimal numbers. |
421 | ||
d7cbec71 | 422 | Return true if input is decimal numbers. Return false if not. */ |
40e084e1 | 423 | |
d7cbec71 HZ |
424 | static int |
425 | linespec_lexer_lex_number (linespec_parser *parser, linespec_token *tokenp) | |
40e084e1 | 426 | { |
d7cbec71 HZ |
427 | tokenp->type = LSTOKEN_NUMBER; |
428 | LS_TOKEN_STOKEN (*tokenp).length = 0; | |
429 | LS_TOKEN_STOKEN (*tokenp).ptr = PARSER_STREAM (parser); | |
40e084e1 KS |
430 | |
431 | /* Keep any sign at the start of the stream. */ | |
432 | if (*PARSER_STREAM (parser) == '+' || *PARSER_STREAM (parser) == '-') | |
433 | { | |
d7cbec71 | 434 | ++LS_TOKEN_STOKEN (*tokenp).length; |
40e084e1 KS |
435 | ++(PARSER_STREAM (parser)); |
436 | } | |
437 | ||
438 | while (isdigit (*PARSER_STREAM (parser))) | |
439 | { | |
d7cbec71 | 440 | ++LS_TOKEN_STOKEN (*tokenp).length; |
40e084e1 | 441 | ++(PARSER_STREAM (parser)); |
f8eba3c6 | 442 | } |
40e084e1 | 443 | |
dd3818c8 | 444 | /* If the next character in the input buffer is not a space, comma, |
eff9c3e6 | 445 | quote, or colon, this input does not represent a number. */ |
dd3818c8 KS |
446 | if (*PARSER_STREAM (parser) != '\0' |
447 | && !isspace (*PARSER_STREAM (parser)) && *PARSER_STREAM (parser) != ',' | |
eff9c3e6 KS |
448 | && *PARSER_STREAM (parser) != ':' |
449 | && !strchr (linespec_quote_characters, *PARSER_STREAM (parser))) | |
d7cbec71 HZ |
450 | { |
451 | PARSER_STREAM (parser) = LS_TOKEN_STOKEN (*tokenp).ptr; | |
452 | return 0; | |
453 | } | |
454 | ||
455 | return 1; | |
f8eba3c6 TT |
456 | } |
457 | ||
32b40af9 | 458 | /* See linespec.h. */ |
f8eba3c6 | 459 | |
0578b14e | 460 | const char * |
40e084e1 | 461 | linespec_lexer_lex_keyword (const char *p) |
f8eba3c6 | 462 | { |
40e084e1 | 463 | int i; |
f8eba3c6 | 464 | |
40e084e1 KS |
465 | if (p != NULL) |
466 | { | |
c6756f62 | 467 | for (i = 0; linespec_keywords[i] != NULL; ++i) |
40e084e1 KS |
468 | { |
469 | int len = strlen (linespec_keywords[i]); | |
470 | ||
471 | /* If P begins with one of the keywords and the next | |
0578b14e KS |
472 | character is whitespace, we may have found a keyword. |
473 | It is only a keyword if it is not followed by another | |
474 | keyword. */ | |
40e084e1 | 475 | if (strncmp (p, linespec_keywords[i], len) == 0 |
0578b14e KS |
476 | && isspace (p[len])) |
477 | { | |
478 | int j; | |
479 | ||
480 | /* Special case: "if" ALWAYS stops the lexer, since it | |
481 | is not possible to predict what is going to appear in | |
482 | the condition, which can only be parsed after SaLs have | |
483 | been found. */ | |
484 | if (i != IF_KEYWORD_INDEX) | |
485 | { | |
486 | p += len; | |
f1735a53 | 487 | p = skip_spaces (p); |
c6756f62 | 488 | for (j = 0; linespec_keywords[j] != NULL; ++j) |
0578b14e KS |
489 | { |
490 | int nextlen = strlen (linespec_keywords[j]); | |
491 | ||
492 | if (strncmp (p, linespec_keywords[j], nextlen) == 0 | |
493 | && isspace (p[nextlen])) | |
494 | return NULL; | |
495 | } | |
496 | } | |
497 | ||
498 | return linespec_keywords[i]; | |
499 | } | |
40e084e1 KS |
500 | } |
501 | } | |
502 | ||
503 | return NULL; | |
f8eba3c6 TT |
504 | } |
505 | ||
87f0e720 | 506 | /* See description in linespec.h. */ |
f8eba3c6 | 507 | |
87f0e720 | 508 | int |
40e084e1 | 509 | is_ada_operator (const char *string) |
f8eba3c6 | 510 | { |
40e084e1 | 511 | const struct ada_opname_map *mapping; |
f8eba3c6 | 512 | |
40e084e1 KS |
513 | for (mapping = ada_opname_table; |
514 | mapping->encoded != NULL | |
61012eef | 515 | && !startswith (string, mapping->decoded); ++mapping) |
40e084e1 KS |
516 | ; |
517 | ||
518 | return mapping->decoded == NULL ? 0 : strlen (mapping->decoded); | |
f8eba3c6 TT |
519 | } |
520 | ||
40e084e1 KS |
521 | /* Find QUOTE_CHAR in STRING, accounting for the ':' terminal. Return |
522 | the location of QUOTE_CHAR, or NULL if not found. */ | |
f8eba3c6 | 523 | |
40e084e1 KS |
524 | static const char * |
525 | skip_quote_char (const char *string, char quote_char) | |
f8eba3c6 | 526 | { |
40e084e1 | 527 | const char *p, *last; |
f8eba3c6 | 528 | |
40e084e1 KS |
529 | p = last = find_toplevel_char (string, quote_char); |
530 | while (p && *p != '\0' && *p != ':') | |
531 | { | |
532 | p = find_toplevel_char (p, quote_char); | |
533 | if (p != NULL) | |
534 | last = p++; | |
535 | } | |
f8eba3c6 | 536 | |
40e084e1 | 537 | return last; |
f8eba3c6 | 538 | } |
50641945 | 539 | |
40e084e1 KS |
540 | /* Make a writable copy of the string given in TOKEN, trimming |
541 | any trailing whitespace. */ | |
50641945 | 542 | |
a5b5adf5 | 543 | static gdb::unique_xmalloc_ptr<char> |
40e084e1 | 544 | copy_token_string (linespec_token token) |
50641945 | 545 | { |
a5b5adf5 | 546 | const char *str, *s; |
e0881a8e | 547 | |
40e084e1 | 548 | if (token.type == LSTOKEN_KEYWORD) |
a5b5adf5 | 549 | return gdb::unique_xmalloc_ptr<char> (xstrdup (LS_TOKEN_KEYWORD (token))); |
255e7dbf | 550 | |
a5b5adf5 | 551 | str = LS_TOKEN_STOKEN (token).ptr; |
40e084e1 | 552 | s = remove_trailing_whitespace (str, str + LS_TOKEN_STOKEN (token).length); |
e0881a8e | 553 | |
a5b5adf5 | 554 | return gdb::unique_xmalloc_ptr<char> (savestring (str, s - str)); |
40e084e1 | 555 | } |
255e7dbf | 556 | |
40e084e1 | 557 | /* Does P represent the end of a quote-enclosed linespec? */ |
f3a5f1de | 558 | |
40e084e1 KS |
559 | static int |
560 | is_closing_quote_enclosed (const char *p) | |
561 | { | |
562 | if (strchr (linespec_quote_characters, *p)) | |
563 | ++p; | |
564 | p = skip_spaces ((char *) p); | |
565 | return (*p == '\0' || linespec_lexer_lex_keyword (p)); | |
50641945 FN |
566 | } |
567 | ||
40e084e1 KS |
568 | /* Find the end of the parameter list that starts with *INPUT. |
569 | This helper function assists with lexing string segments | |
570 | which might contain valid (non-terminating) commas. */ | |
481860b3 | 571 | |
d7561cbb KS |
572 | static const char * |
573 | find_parameter_list_end (const char *input) | |
481860b3 | 574 | { |
40e084e1 KS |
575 | char end_char, start_char; |
576 | int depth; | |
d7561cbb | 577 | const char *p; |
481860b3 | 578 | |
40e084e1 KS |
579 | start_char = *input; |
580 | if (start_char == '(') | |
581 | end_char = ')'; | |
582 | else if (start_char == '<') | |
583 | end_char = '>'; | |
584 | else | |
585 | return NULL; | |
481860b3 | 586 | |
40e084e1 KS |
587 | p = input; |
588 | depth = 0; | |
589 | while (*p) | |
481860b3 | 590 | { |
40e084e1 KS |
591 | if (*p == start_char) |
592 | ++depth; | |
593 | else if (*p == end_char) | |
594 | { | |
595 | if (--depth == 0) | |
596 | { | |
597 | ++p; | |
598 | break; | |
599 | } | |
600 | } | |
601 | ++p; | |
481860b3 | 602 | } |
40e084e1 KS |
603 | |
604 | return p; | |
481860b3 GB |
605 | } |
606 | ||
c45ec17c PA |
607 | /* If the [STRING, STRING_LEN) string ends with what looks like a |
608 | keyword, return the keyword start offset in STRING. Return -1 | |
609 | otherwise. */ | |
610 | ||
611 | static size_t | |
612 | string_find_incomplete_keyword_at_end (const char * const *keywords, | |
613 | const char *string, size_t string_len) | |
614 | { | |
615 | const char *end = string + string_len; | |
616 | const char *p = end; | |
617 | ||
618 | while (p > string && *p != ' ') | |
619 | --p; | |
620 | if (p > string) | |
621 | { | |
622 | p++; | |
623 | size_t len = end - p; | |
624 | for (size_t i = 0; keywords[i] != NULL; ++i) | |
625 | if (strncmp (keywords[i], p, len) == 0) | |
626 | return p - string; | |
627 | } | |
628 | ||
629 | return -1; | |
630 | } | |
74ccd7f5 | 631 | |
40e084e1 KS |
632 | /* Lex a string from the input in PARSER. */ |
633 | ||
634 | static linespec_token | |
635 | linespec_lexer_lex_string (linespec_parser *parser) | |
74ccd7f5 | 636 | { |
40e084e1 | 637 | linespec_token token; |
d7561cbb | 638 | const char *start = PARSER_STREAM (parser); |
74ccd7f5 | 639 | |
40e084e1 | 640 | token.type = LSTOKEN_STRING; |
74ccd7f5 | 641 | |
40e084e1 KS |
642 | /* If the input stream starts with a quote character, skip to the next |
643 | quote character, regardless of the content. */ | |
644 | if (strchr (linespec_quote_characters, *PARSER_STREAM (parser))) | |
645 | { | |
646 | const char *end; | |
647 | char quote_char = *PARSER_STREAM (parser); | |
50641945 | 648 | |
40e084e1 KS |
649 | /* Special case: Ada operators. */ |
650 | if (PARSER_STATE (parser)->language->la_language == language_ada | |
651 | && quote_char == '\"') | |
652 | { | |
653 | int len = is_ada_operator (PARSER_STREAM (parser)); | |
50641945 | 654 | |
40e084e1 KS |
655 | if (len != 0) |
656 | { | |
657 | /* The input is an Ada operator. Return the quoted string | |
658 | as-is. */ | |
659 | LS_TOKEN_STOKEN (token).ptr = PARSER_STREAM (parser); | |
660 | LS_TOKEN_STOKEN (token).length = len; | |
661 | PARSER_STREAM (parser) += len; | |
662 | return token; | |
663 | } | |
f8eba3c6 | 664 | |
40e084e1 KS |
665 | /* The input does not represent an Ada operator -- fall through |
666 | to normal quoted string handling. */ | |
667 | } | |
f8eba3c6 | 668 | |
40e084e1 KS |
669 | /* Skip past the beginning quote. */ |
670 | ++(PARSER_STREAM (parser)); | |
74ccd7f5 | 671 | |
40e084e1 KS |
672 | /* Mark the start of the string. */ |
673 | LS_TOKEN_STOKEN (token).ptr = PARSER_STREAM (parser); | |
f8eba3c6 | 674 | |
40e084e1 KS |
675 | /* Skip to the ending quote. */ |
676 | end = skip_quote_char (PARSER_STREAM (parser), quote_char); | |
677 | ||
c45ec17c PA |
678 | /* This helps the completer mode decide whether we have a |
679 | complete string. */ | |
680 | parser->completion_quote_char = quote_char; | |
681 | parser->completion_quote_end = end; | |
40e084e1 | 682 | |
c45ec17c PA |
683 | /* Error if the input did not terminate properly, unless in |
684 | completion mode. */ | |
685 | if (end == NULL) | |
686 | { | |
687 | if (parser->completion_tracker == NULL) | |
688 | error (_("unmatched quote")); | |
689 | ||
690 | /* In completion mode, we'll try to complete the incomplete | |
691 | token. */ | |
692 | token.type = LSTOKEN_STRING; | |
693 | while (*PARSER_STREAM (parser) != '\0') | |
694 | PARSER_STREAM (parser)++; | |
695 | LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - 1 - start; | |
696 | } | |
697 | else | |
698 | { | |
699 | /* Skip over the ending quote and mark the length of the string. */ | |
700 | PARSER_STREAM (parser) = (char *) ++end; | |
701 | LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - 2 - start; | |
702 | } | |
40e084e1 KS |
703 | } |
704 | else | |
705 | { | |
d7561cbb | 706 | const char *p; |
40e084e1 KS |
707 | |
708 | /* Otherwise, only identifier characters are permitted. | |
709 | Spaces are the exception. In general, we keep spaces, | |
710 | but only if the next characters in the input do not resolve | |
711 | to one of the keywords. | |
712 | ||
713 | This allows users to forgo quoting CV-qualifiers, template arguments, | |
714 | and similar common language constructs. */ | |
715 | ||
716 | while (1) | |
717 | { | |
718 | if (isspace (*PARSER_STREAM (parser))) | |
719 | { | |
f1735a53 | 720 | p = skip_spaces (PARSER_STREAM (parser)); |
7c09e5a0 DE |
721 | /* When we get here we know we've found something followed by |
722 | a space (we skip over parens and templates below). | |
723 | So if we find a keyword now, we know it is a keyword and not, | |
724 | say, a function name. */ | |
40e084e1 KS |
725 | if (linespec_lexer_lex_keyword (p) != NULL) |
726 | { | |
727 | LS_TOKEN_STOKEN (token).ptr = start; | |
728 | LS_TOKEN_STOKEN (token).length | |
729 | = PARSER_STREAM (parser) - start; | |
730 | return token; | |
731 | } | |
732 | ||
733 | /* Advance past the whitespace. */ | |
734 | PARSER_STREAM (parser) = p; | |
735 | } | |
736 | ||
737 | /* If the next character is EOI or (single) ':', the | |
738 | string is complete; return the token. */ | |
739 | if (*PARSER_STREAM (parser) == 0) | |
740 | { | |
741 | LS_TOKEN_STOKEN (token).ptr = start; | |
742 | LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - start; | |
743 | return token; | |
744 | } | |
745 | else if (PARSER_STREAM (parser)[0] == ':') | |
746 | { | |
747 | /* Do not tokenize the C++ scope operator. */ | |
748 | if (PARSER_STREAM (parser)[1] == ':') | |
749 | ++(PARSER_STREAM (parser)); | |
750 | ||
bd69330d PA |
751 | /* Do not tokenize ABI tags such as "[abi:cxx11]". */ |
752 | else if (PARSER_STREAM (parser) - start > 4 | |
753 | && startswith (PARSER_STREAM (parser) - 4, "[abi")) | |
754 | ++(PARSER_STREAM (parser)); | |
755 | ||
40e084e1 KS |
756 | /* Do not tokenify if the input length so far is one |
757 | (i.e, a single-letter drive name) and the next character | |
758 | is a directory separator. This allows Windows-style | |
759 | paths to be recognized as filenames without quoting it. */ | |
760 | else if ((PARSER_STREAM (parser) - start) != 1 | |
761 | || !IS_DIR_SEPARATOR (PARSER_STREAM (parser)[1])) | |
762 | { | |
763 | LS_TOKEN_STOKEN (token).ptr = start; | |
764 | LS_TOKEN_STOKEN (token).length | |
765 | = PARSER_STREAM (parser) - start; | |
766 | return token; | |
767 | } | |
768 | } | |
769 | /* Special case: permit quote-enclosed linespecs. */ | |
770 | else if (parser->is_quote_enclosed | |
771 | && strchr (linespec_quote_characters, | |
772 | *PARSER_STREAM (parser)) | |
773 | && is_closing_quote_enclosed (PARSER_STREAM (parser))) | |
774 | { | |
775 | LS_TOKEN_STOKEN (token).ptr = start; | |
776 | LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - start; | |
777 | return token; | |
778 | } | |
779 | /* Because commas may terminate a linespec and appear in | |
780 | the middle of valid string input, special cases for | |
781 | '<' and '(' are necessary. */ | |
782 | else if (*PARSER_STREAM (parser) == '<' | |
783 | || *PARSER_STREAM (parser) == '(') | |
784 | { | |
be966d42 PA |
785 | /* Don't interpret 'operator<' / 'operator<<' as a |
786 | template parameter list though. */ | |
787 | if (*PARSER_STREAM (parser) == '<' | |
788 | && (PARSER_STATE (parser)->language->la_language | |
789 | == language_cplus) | |
790 | && (PARSER_STREAM (parser) - start) >= CP_OPERATOR_LEN) | |
791 | { | |
b926417a | 792 | const char *op = PARSER_STREAM (parser); |
be966d42 | 793 | |
b926417a TT |
794 | while (op > start && isspace (op[-1])) |
795 | op--; | |
796 | if (op - start >= CP_OPERATOR_LEN) | |
be966d42 | 797 | { |
b926417a TT |
798 | op -= CP_OPERATOR_LEN; |
799 | if (strncmp (op, CP_OPERATOR_STR, CP_OPERATOR_LEN) == 0 | |
800 | && (op == start | |
801 | || !(isalnum (op[-1]) || op[-1] == '_'))) | |
be966d42 PA |
802 | { |
803 | /* This is an operator name. Keep going. */ | |
804 | ++(PARSER_STREAM (parser)); | |
805 | if (*PARSER_STREAM (parser) == '<') | |
806 | ++(PARSER_STREAM (parser)); | |
807 | continue; | |
808 | } | |
809 | } | |
810 | } | |
811 | ||
b926417a TT |
812 | const char *end = find_parameter_list_end (PARSER_STREAM (parser)); |
813 | PARSER_STREAM (parser) = end; | |
40e084e1 | 814 | |
be966d42 PA |
815 | /* Don't loop around to the normal \0 case above because |
816 | we don't want to misinterpret a potential keyword at | |
817 | the end of the token when the string isn't | |
818 | "()<>"-balanced. This handles "b | |
819 | function(thread<tab>" in completion mode. */ | |
b926417a | 820 | if (*end == '\0') |
40e084e1 | 821 | { |
be966d42 PA |
822 | LS_TOKEN_STOKEN (token).ptr = start; |
823 | LS_TOKEN_STOKEN (token).length | |
824 | = PARSER_STREAM (parser) - start; | |
825 | return token; | |
40e084e1 | 826 | } |
be966d42 PA |
827 | else |
828 | continue; | |
40e084e1 KS |
829 | } |
830 | /* Commas are terminators, but not if they are part of an | |
831 | operator name. */ | |
832 | else if (*PARSER_STREAM (parser) == ',') | |
833 | { | |
834 | if ((PARSER_STATE (parser)->language->la_language | |
835 | == language_cplus) | |
8090b426 | 836 | && (PARSER_STREAM (parser) - start) > CP_OPERATOR_LEN) |
40e084e1 | 837 | { |
b926417a | 838 | const char *op = strstr (start, CP_OPERATOR_STR); |
40e084e1 | 839 | |
b926417a | 840 | if (op != NULL && is_operator_name (op)) |
40e084e1 KS |
841 | { |
842 | /* This is an operator name. Keep going. */ | |
843 | ++(PARSER_STREAM (parser)); | |
844 | continue; | |
845 | } | |
846 | } | |
847 | ||
848 | /* Comma terminates the string. */ | |
849 | LS_TOKEN_STOKEN (token).ptr = start; | |
850 | LS_TOKEN_STOKEN (token).length = PARSER_STREAM (parser) - start; | |
851 | return token; | |
852 | } | |
853 | ||
854 | /* Advance the stream. */ | |
855 | ++(PARSER_STREAM (parser)); | |
856 | } | |
857 | } | |
858 | ||
859 | return token; | |
860 | } | |
861 | ||
862 | /* Lex a single linespec token from PARSER. */ | |
863 | ||
864 | static linespec_token | |
865 | linespec_lexer_lex_one (linespec_parser *parser) | |
866 | { | |
867 | const char *keyword; | |
868 | ||
869 | if (parser->lexer.current.type == LSTOKEN_CONSUMED) | |
870 | { | |
871 | /* Skip any whitespace. */ | |
f1735a53 | 872 | PARSER_STREAM (parser) = skip_spaces (PARSER_STREAM (parser)); |
40e084e1 | 873 | |
7c09e5a0 | 874 | /* Check for a keyword, they end the linespec. */ |
0578b14e | 875 | keyword = linespec_lexer_lex_keyword (PARSER_STREAM (parser)); |
40e084e1 KS |
876 | if (keyword != NULL) |
877 | { | |
878 | parser->lexer.current.type = LSTOKEN_KEYWORD; | |
879 | LS_TOKEN_KEYWORD (parser->lexer.current) = keyword; | |
0578b14e KS |
880 | /* We do not advance the stream here intentionally: |
881 | we would like lexing to stop when a keyword is seen. | |
882 | ||
883 | PARSER_STREAM (parser) += strlen (keyword); */ | |
884 | ||
40e084e1 KS |
885 | return parser->lexer.current; |
886 | } | |
887 | ||
888 | /* Handle other tokens. */ | |
889 | switch (*PARSER_STREAM (parser)) | |
890 | { | |
891 | case 0: | |
892 | parser->lexer.current.type = LSTOKEN_EOI; | |
893 | break; | |
894 | ||
895 | case '+': case '-': | |
896 | case '0': case '1': case '2': case '3': case '4': | |
897 | case '5': case '6': case '7': case '8': case '9': | |
d7cbec71 HZ |
898 | if (!linespec_lexer_lex_number (parser, &(parser->lexer.current))) |
899 | parser->lexer.current = linespec_lexer_lex_string (parser); | |
40e084e1 KS |
900 | break; |
901 | ||
902 | case ':': | |
903 | /* If we have a scope operator, lex the input as a string. | |
904 | Otherwise, return LSTOKEN_COLON. */ | |
905 | if (PARSER_STREAM (parser)[1] == ':') | |
906 | parser->lexer.current = linespec_lexer_lex_string (parser); | |
907 | else | |
908 | { | |
909 | parser->lexer.current.type = LSTOKEN_COLON; | |
910 | ++(PARSER_STREAM (parser)); | |
911 | } | |
912 | break; | |
913 | ||
914 | case '\'': case '\"': | |
915 | /* Special case: permit quote-enclosed linespecs. */ | |
916 | if (parser->is_quote_enclosed | |
917 | && is_closing_quote_enclosed (PARSER_STREAM (parser))) | |
918 | { | |
919 | ++(PARSER_STREAM (parser)); | |
920 | parser->lexer.current.type = LSTOKEN_EOI; | |
921 | } | |
922 | else | |
923 | parser->lexer.current = linespec_lexer_lex_string (parser); | |
924 | break; | |
925 | ||
926 | case ',': | |
927 | parser->lexer.current.type = LSTOKEN_COMMA; | |
928 | LS_TOKEN_STOKEN (parser->lexer.current).ptr | |
929 | = PARSER_STREAM (parser); | |
930 | LS_TOKEN_STOKEN (parser->lexer.current).length = 1; | |
931 | ++(PARSER_STREAM (parser)); | |
932 | break; | |
933 | ||
934 | default: | |
935 | /* If the input is not a number, it must be a string. | |
936 | [Keywords were already considered above.] */ | |
937 | parser->lexer.current = linespec_lexer_lex_string (parser); | |
938 | break; | |
939 | } | |
940 | } | |
941 | ||
942 | return parser->lexer.current; | |
943 | } | |
944 | ||
945 | /* Consume the current token and return the next token in PARSER's | |
c45ec17c PA |
946 | input stream. Also advance the completion word for completion |
947 | mode. */ | |
40e084e1 KS |
948 | |
949 | static linespec_token | |
950 | linespec_lexer_consume_token (linespec_parser *parser) | |
951 | { | |
c45ec17c PA |
952 | gdb_assert (parser->lexer.current.type != LSTOKEN_EOI); |
953 | ||
954 | bool advance_word = (parser->lexer.current.type != LSTOKEN_STRING | |
955 | || *PARSER_STREAM (parser) != '\0'); | |
956 | ||
957 | /* If we're moving past a string to some other token, it must be the | |
958 | quote was terminated. */ | |
959 | if (parser->completion_quote_char) | |
960 | { | |
961 | gdb_assert (parser->lexer.current.type == LSTOKEN_STRING); | |
962 | ||
963 | /* If the string was the last (non-EOI) token, we're past the | |
964 | quote, but remember that for later. */ | |
965 | if (*PARSER_STREAM (parser) != '\0') | |
966 | { | |
967 | parser->completion_quote_char = '\0'; | |
968 | parser->completion_quote_end = NULL;; | |
969 | } | |
970 | } | |
971 | ||
40e084e1 | 972 | parser->lexer.current.type = LSTOKEN_CONSUMED; |
c45ec17c PA |
973 | linespec_lexer_lex_one (parser); |
974 | ||
975 | if (parser->lexer.current.type == LSTOKEN_STRING) | |
976 | { | |
977 | /* Advance the completion word past a potential initial | |
978 | quote-char. */ | |
979 | parser->completion_word = LS_TOKEN_STOKEN (parser->lexer.current).ptr; | |
980 | } | |
981 | else if (advance_word) | |
982 | { | |
983 | /* Advance the completion word past any whitespace. */ | |
984 | parser->completion_word = PARSER_STREAM (parser); | |
985 | } | |
986 | ||
987 | return parser->lexer.current; | |
40e084e1 KS |
988 | } |
989 | ||
990 | /* Return the next token without consuming the current token. */ | |
991 | ||
992 | static linespec_token | |
993 | linespec_lexer_peek_token (linespec_parser *parser) | |
994 | { | |
995 | linespec_token next; | |
d7561cbb | 996 | const char *saved_stream = PARSER_STREAM (parser); |
40e084e1 | 997 | linespec_token saved_token = parser->lexer.current; |
c45ec17c PA |
998 | int saved_completion_quote_char = parser->completion_quote_char; |
999 | const char *saved_completion_quote_end = parser->completion_quote_end; | |
1000 | const char *saved_completion_word = parser->completion_word; | |
40e084e1 KS |
1001 | |
1002 | next = linespec_lexer_consume_token (parser); | |
1003 | PARSER_STREAM (parser) = saved_stream; | |
1004 | parser->lexer.current = saved_token; | |
c45ec17c PA |
1005 | parser->completion_quote_char = saved_completion_quote_char; |
1006 | parser->completion_quote_end = saved_completion_quote_end; | |
1007 | parser->completion_word = saved_completion_word; | |
40e084e1 KS |
1008 | return next; |
1009 | } | |
1010 | ||
1011 | /* Helper functions. */ | |
1012 | ||
40e084e1 KS |
1013 | /* Add SAL to SALS, and also update SELF->CANONICAL_NAMES to reflect |
1014 | the new sal, if needed. If not NULL, SYMNAME is the name of the | |
66f1999b KS |
1015 | symbol to use when constructing the new canonical name. |
1016 | ||
1017 | If LITERAL_CANONICAL is non-zero, SYMNAME will be used as the | |
1018 | canonical name for the SAL. */ | |
40e084e1 KS |
1019 | |
1020 | static void | |
1021 | add_sal_to_sals (struct linespec_state *self, | |
6c5b2ebe | 1022 | std::vector<symtab_and_line> *sals, |
40e084e1 | 1023 | struct symtab_and_line *sal, |
66f1999b | 1024 | const char *symname, int literal_canonical) |
40e084e1 | 1025 | { |
6c5b2ebe | 1026 | sals->push_back (*sal); |
40e084e1 KS |
1027 | |
1028 | if (self->canonical) | |
1029 | { | |
33f448b1 | 1030 | struct linespec_canonical_name *canonical; |
40e084e1 | 1031 | |
224c3ddb | 1032 | self->canonical_names = XRESIZEVEC (struct linespec_canonical_name, |
6c5b2ebe PA |
1033 | self->canonical_names, |
1034 | sals->size ()); | |
1035 | canonical = &self->canonical_names[sals->size () - 1]; | |
4e04028d | 1036 | if (!literal_canonical && sal->symtab) |
40e084e1 | 1037 | { |
df140a0b TS |
1038 | symtab_to_fullname (sal->symtab); |
1039 | ||
40e084e1 KS |
1040 | /* Note that the filter doesn't have to be a valid linespec |
1041 | input. We only apply the ":LINE" treatment to Ada for | |
1042 | the time being. */ | |
1043 | if (symname != NULL && sal->line != 0 | |
1044 | && self->language->la_language == language_ada) | |
33f448b1 | 1045 | canonical->suffix = xstrprintf ("%s:%d", symname, sal->line); |
40e084e1 | 1046 | else if (symname != NULL) |
33f448b1 | 1047 | canonical->suffix = xstrdup (symname); |
40e084e1 | 1048 | else |
33f448b1 JK |
1049 | canonical->suffix = xstrprintf ("%d", sal->line); |
1050 | canonical->symtab = sal->symtab; | |
1051 | } | |
1052 | else | |
1053 | { | |
1054 | if (symname != NULL) | |
1055 | canonical->suffix = xstrdup (symname); | |
1056 | else | |
e617b069 | 1057 | canonical->suffix = xstrdup ("<unknown>"); |
33f448b1 | 1058 | canonical->symtab = NULL; |
40e084e1 | 1059 | } |
40e084e1 KS |
1060 | } |
1061 | } | |
1062 | ||
1063 | /* A hash function for address_entry. */ | |
1064 | ||
1065 | static hashval_t | |
1066 | hash_address_entry (const void *p) | |
1067 | { | |
9a3c8263 | 1068 | const struct address_entry *aep = (const struct address_entry *) p; |
40e084e1 KS |
1069 | hashval_t hash; |
1070 | ||
1071 | hash = iterative_hash_object (aep->pspace, 0); | |
1072 | return iterative_hash_object (aep->addr, hash); | |
1073 | } | |
1074 | ||
1075 | /* An equality function for address_entry. */ | |
1076 | ||
1077 | static int | |
1078 | eq_address_entry (const void *a, const void *b) | |
1079 | { | |
9a3c8263 SM |
1080 | const struct address_entry *aea = (const struct address_entry *) a; |
1081 | const struct address_entry *aeb = (const struct address_entry *) b; | |
40e084e1 KS |
1082 | |
1083 | return aea->pspace == aeb->pspace && aea->addr == aeb->addr; | |
1084 | } | |
1085 | ||
1086 | /* Check whether the address, represented by PSPACE and ADDR, is | |
1087 | already in the set. If so, return 0. Otherwise, add it and return | |
1088 | 1. */ | |
1089 | ||
1090 | static int | |
1091 | maybe_add_address (htab_t set, struct program_space *pspace, CORE_ADDR addr) | |
1092 | { | |
1093 | struct address_entry e, *p; | |
1094 | void **slot; | |
1095 | ||
1096 | e.pspace = pspace; | |
1097 | e.addr = addr; | |
1098 | slot = htab_find_slot (set, &e, INSERT); | |
1099 | if (*slot) | |
1100 | return 0; | |
1101 | ||
1102 | p = XNEW (struct address_entry); | |
1103 | memcpy (p, &e, sizeof (struct address_entry)); | |
1104 | *slot = p; | |
1105 | ||
1106 | return 1; | |
1107 | } | |
1108 | ||
40e084e1 KS |
1109 | /* A helper that walks over all matching symtabs in all objfiles and |
1110 | calls CALLBACK for each symbol matching NAME. If SEARCH_PSPACE is | |
1111 | not NULL, then the search is restricted to just that program | |
14bc53a8 | 1112 | space. If INCLUDE_INLINE is true then symbols representing |
40e084e1 KS |
1113 | inlined instances of functions will be included in the result. */ |
1114 | ||
1115 | static void | |
14bc53a8 | 1116 | iterate_over_all_matching_symtabs |
b5ec771e PA |
1117 | (struct linespec_state *state, |
1118 | const lookup_name_info &lookup_name, | |
1119 | const domain_enum name_domain, | |
56d87ef7 | 1120 | enum search_domain search_domain, |
14bc53a8 PA |
1121 | struct program_space *search_pspace, bool include_inline, |
1122 | gdb::function_view<symbol_found_callback_ftype> callback) | |
40e084e1 KS |
1123 | { |
1124 | struct objfile *objfile; | |
1125 | struct program_space *pspace; | |
40e084e1 | 1126 | |
40e084e1 KS |
1127 | ALL_PSPACES (pspace) |
1128 | { | |
1129 | if (search_pspace != NULL && search_pspace != pspace) | |
1130 | continue; | |
1131 | if (pspace->executing_startup) | |
f8eba3c6 TT |
1132 | continue; |
1133 | ||
1134 | set_current_program_space (pspace); | |
50641945 | 1135 | |
f8eba3c6 TT |
1136 | ALL_OBJFILES (objfile) |
1137 | { | |
43f3e411 | 1138 | struct compunit_symtab *cu; |
f8eba3c6 TT |
1139 | |
1140 | if (objfile->sf) | |
b5ec771e PA |
1141 | objfile->sf->qf->expand_symtabs_matching (objfile, |
1142 | NULL, | |
1143 | lookup_name, | |
1144 | NULL, NULL, | |
56d87ef7 | 1145 | search_domain); |
f8eba3c6 | 1146 | |
43f3e411 | 1147 | ALL_OBJFILE_COMPUNITS (objfile, cu) |
f8eba3c6 | 1148 | { |
43f3e411 DE |
1149 | struct symtab *symtab = COMPUNIT_FILETABS (cu); |
1150 | ||
b5ec771e | 1151 | iterate_over_file_blocks (symtab, lookup_name, name_domain, callback); |
481860b3 | 1152 | |
d790cf0a DE |
1153 | if (include_inline) |
1154 | { | |
4eeaa230 | 1155 | struct block *block; |
d790cf0a | 1156 | int i; |
481860b3 | 1157 | |
d790cf0a | 1158 | for (i = FIRST_LOCAL_BLOCK; |
439247b6 DE |
1159 | i < BLOCKVECTOR_NBLOCKS (SYMTAB_BLOCKVECTOR (symtab)); |
1160 | i++) | |
d790cf0a | 1161 | { |
439247b6 | 1162 | block = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab), i); |
4ae24af0 | 1163 | state->language->la_iterate_over_symbols |
7e41c8db | 1164 | (block, lookup_name, name_domain, [&] (block_symbol *bsym) |
14bc53a8 PA |
1165 | { |
1166 | /* Restrict calls to CALLBACK to symbols | |
1167 | representing inline symbols only. */ | |
7e41c8db KS |
1168 | if (SYMBOL_INLINED (bsym->symbol)) |
1169 | return callback (bsym); | |
14bc53a8 PA |
1170 | return true; |
1171 | }); | |
481860b3 | 1172 | } |
f8eba3c6 TT |
1173 | } |
1174 | } | |
1175 | } | |
1176 | } | |
50641945 FN |
1177 | } |
1178 | ||
4eeaa230 DE |
1179 | /* Returns the block to be used for symbol searches from |
1180 | the current location. */ | |
e8eb7bc5 | 1181 | |
3977b71f | 1182 | static const struct block * |
e482a1a7 | 1183 | get_current_search_block (void) |
e8eb7bc5 | 1184 | { |
3977b71f | 1185 | const struct block *block; |
4eeaa230 | 1186 | enum language save_language; |
e8eb7bc5 | 1187 | |
4eeaa230 DE |
1188 | /* get_selected_block can change the current language when there is |
1189 | no selected frame yet. */ | |
1190 | save_language = current_language->la_language; | |
1191 | block = get_selected_block (0); | |
1192 | set_language (save_language); | |
e8eb7bc5 KS |
1193 | |
1194 | return block; | |
1195 | } | |
1196 | ||
4eeaa230 DE |
1197 | /* Iterate over static and global blocks. */ |
1198 | ||
1199 | static void | |
14bc53a8 | 1200 | iterate_over_file_blocks |
b5ec771e PA |
1201 | (struct symtab *symtab, const lookup_name_info &name, |
1202 | domain_enum domain, gdb::function_view<symbol_found_callback_ftype> callback) | |
4eeaa230 DE |
1203 | { |
1204 | struct block *block; | |
1205 | ||
439247b6 | 1206 | for (block = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab), STATIC_BLOCK); |
4eeaa230 DE |
1207 | block != NULL; |
1208 | block = BLOCK_SUPERBLOCK (block)) | |
14bc53a8 | 1209 | LA_ITERATE_OVER_SYMBOLS (block, name, domain, callback); |
4eeaa230 DE |
1210 | } |
1211 | ||
b5ec771e PA |
1212 | /* A helper for find_method. This finds all methods in type T of |
1213 | language T_LANG which match NAME. It adds matching symbol names to | |
1214 | RESULT_NAMES, and adds T's direct superclasses to SUPERCLASSES. */ | |
50641945 | 1215 | |
f8eba3c6 | 1216 | static void |
b5ec771e | 1217 | find_methods (struct type *t, enum language t_lang, const char *name, |
9b2f8581 | 1218 | std::vector<const char *> *result_names, |
8e8d776e | 1219 | std::vector<struct type *> *superclasses) |
50641945 | 1220 | { |
50641945 | 1221 | int ibase; |
a737d952 | 1222 | const char *class_name = TYPE_NAME (t); |
c00f8484 | 1223 | |
50641945 FN |
1224 | /* Ignore this class if it doesn't have a name. This is ugly, but |
1225 | unless we figure out how to get the physname without the name of | |
1226 | the class, then the loop can't do any good. */ | |
f8eba3c6 | 1227 | if (class_name) |
50641945 FN |
1228 | { |
1229 | int method_counter; | |
b5ec771e PA |
1230 | lookup_name_info lookup_name (name, symbol_name_match_type::FULL); |
1231 | symbol_name_matcher_ftype *symbol_name_compare | |
618daa93 | 1232 | = get_symbol_name_matcher (language_def (t_lang), lookup_name); |
50641945 | 1233 | |
f168693b | 1234 | t = check_typedef (t); |
50641945 FN |
1235 | |
1236 | /* Loop over each method name. At this level, all overloads of a name | |
1237 | are counted as a single name. There is an inner loop which loops over | |
1238 | each overload. */ | |
1239 | ||
1240 | for (method_counter = TYPE_NFN_FIELDS (t) - 1; | |
1241 | method_counter >= 0; | |
1242 | --method_counter) | |
1243 | { | |
0d5cff50 | 1244 | const char *method_name = TYPE_FN_FIELDLIST_NAME (t, method_counter); |
50641945 FN |
1245 | char dem_opname[64]; |
1246 | ||
61012eef GB |
1247 | if (startswith (method_name, "__") || |
1248 | startswith (method_name, "op") || | |
1249 | startswith (method_name, "type")) | |
50641945 FN |
1250 | { |
1251 | if (cplus_demangle_opname (method_name, dem_opname, DMGL_ANSI)) | |
1252 | method_name = dem_opname; | |
1253 | else if (cplus_demangle_opname (method_name, dem_opname, 0)) | |
1254 | method_name = dem_opname; | |
1255 | } | |
1256 | ||
b5ec771e | 1257 | if (symbol_name_compare (method_name, lookup_name, NULL)) |
f8eba3c6 TT |
1258 | { |
1259 | int field_counter; | |
aee8d8ba | 1260 | |
f8eba3c6 TT |
1261 | for (field_counter = (TYPE_FN_FIELDLIST_LENGTH (t, method_counter) |
1262 | - 1); | |
1263 | field_counter >= 0; | |
1264 | --field_counter) | |
1265 | { | |
1266 | struct fn_field *f; | |
1267 | const char *phys_name; | |
1268 | ||
1269 | f = TYPE_FN_FIELDLIST1 (t, method_counter); | |
1270 | if (TYPE_FN_FIELD_STUB (f, field_counter)) | |
1271 | continue; | |
1272 | phys_name = TYPE_FN_FIELD_PHYSNAME (f, field_counter); | |
9b2f8581 | 1273 | result_names->push_back (phys_name); |
f8eba3c6 TT |
1274 | } |
1275 | } | |
aee8d8ba DC |
1276 | } |
1277 | } | |
1278 | ||
f8eba3c6 | 1279 | for (ibase = 0; ibase < TYPE_N_BASECLASSES (t); ibase++) |
8e8d776e | 1280 | superclasses->push_back (TYPE_BASECLASS (t, ibase)); |
50641945 FN |
1281 | } |
1282 | ||
50641945 FN |
1283 | /* Find an instance of the character C in the string S that is outside |
1284 | of all parenthesis pairs, single-quoted strings, and double-quoted | |
8120c9d5 | 1285 | strings. Also, ignore the char within a template name, like a ',' |
be966d42 | 1286 | within foo<int, int>, while considering C++ operator</operator<<. */ |
8120c9d5 | 1287 | |
87f0e720 | 1288 | const char * |
40e084e1 | 1289 | find_toplevel_char (const char *s, char c) |
50641945 FN |
1290 | { |
1291 | int quoted = 0; /* zero if we're not in quotes; | |
1292 | '"' if we're in a double-quoted string; | |
1293 | '\'' if we're in a single-quoted string. */ | |
a04257e6 | 1294 | int depth = 0; /* Number of unclosed parens we've seen. */ |
40e084e1 | 1295 | const char *scan; |
50641945 FN |
1296 | |
1297 | for (scan = s; *scan; scan++) | |
1298 | { | |
1299 | if (quoted) | |
1300 | { | |
1301 | if (*scan == quoted) | |
1302 | quoted = 0; | |
1303 | else if (*scan == '\\' && *(scan + 1)) | |
1304 | scan++; | |
1305 | } | |
1306 | else if (*scan == c && ! quoted && depth == 0) | |
1307 | return scan; | |
1308 | else if (*scan == '"' || *scan == '\'') | |
1309 | quoted = *scan; | |
8120c9d5 | 1310 | else if (*scan == '(' || *scan == '<') |
50641945 | 1311 | depth++; |
8120c9d5 | 1312 | else if ((*scan == ')' || *scan == '>') && depth > 0) |
50641945 | 1313 | depth--; |
be966d42 PA |
1314 | else if (*scan == 'o' && !quoted && depth == 0) |
1315 | { | |
1316 | /* Handle C++ operator names. */ | |
1317 | if (strncmp (scan, CP_OPERATOR_STR, CP_OPERATOR_LEN) == 0) | |
1318 | { | |
1319 | scan += CP_OPERATOR_LEN; | |
1320 | if (*scan == c) | |
1321 | return scan; | |
1322 | while (isspace (*scan)) | |
1323 | { | |
1324 | ++scan; | |
1325 | if (*scan == c) | |
1326 | return scan; | |
1327 | } | |
1328 | if (*scan == '\0') | |
1329 | break; | |
1330 | ||
1331 | switch (*scan) | |
1332 | { | |
1333 | /* Skip over one less than the appropriate number of | |
1334 | characters: the for loop will skip over the last | |
1335 | one. */ | |
1336 | case '<': | |
1337 | if (scan[1] == '<') | |
1338 | { | |
1339 | scan++; | |
1340 | if (*scan == c) | |
1341 | return scan; | |
1342 | } | |
1343 | break; | |
1344 | case '>': | |
1345 | if (scan[1] == '>') | |
1346 | { | |
1347 | scan++; | |
1348 | if (*scan == c) | |
1349 | return scan; | |
1350 | } | |
1351 | break; | |
1352 | } | |
1353 | } | |
1354 | } | |
50641945 FN |
1355 | } |
1356 | ||
1357 | return 0; | |
1358 | } | |
1359 | ||
40e084e1 KS |
1360 | /* The string equivalent of find_toplevel_char. Returns a pointer |
1361 | to the location of NEEDLE in HAYSTACK, ignoring any occurrences | |
1362 | inside "()" and "<>". Returns NULL if NEEDLE was not found. */ | |
889f28e2 | 1363 | |
40e084e1 KS |
1364 | static const char * |
1365 | find_toplevel_string (const char *haystack, const char *needle) | |
889f28e2 | 1366 | { |
40e084e1 KS |
1367 | const char *s = haystack; |
1368 | ||
1369 | do | |
1370 | { | |
1371 | s = find_toplevel_char (s, *needle); | |
1372 | ||
1373 | if (s != NULL) | |
1374 | { | |
1375 | /* Found first char in HAYSTACK; check rest of string. */ | |
61012eef | 1376 | if (startswith (s, needle)) |
40e084e1 KS |
1377 | return s; |
1378 | ||
1379 | /* Didn't find it; loop over HAYSTACK, looking for the next | |
1380 | instance of the first character of NEEDLE. */ | |
1381 | ++s; | |
1382 | } | |
1383 | } | |
1384 | while (s != NULL && *s != '\0'); | |
1385 | ||
1386 | /* NEEDLE was not found in HAYSTACK. */ | |
1387 | return NULL; | |
889f28e2 AF |
1388 | } |
1389 | ||
33f448b1 | 1390 | /* Convert CANONICAL to its string representation using |
53a0f8a2 | 1391 | symtab_to_fullname for SYMTAB. */ |
33f448b1 | 1392 | |
53a0f8a2 | 1393 | static std::string |
33f448b1 JK |
1394 | canonical_to_fullform (const struct linespec_canonical_name *canonical) |
1395 | { | |
1396 | if (canonical->symtab == NULL) | |
53a0f8a2 | 1397 | return canonical->suffix; |
33f448b1 | 1398 | else |
53a0f8a2 TT |
1399 | return string_printf ("%s:%s", symtab_to_fullname (canonical->symtab), |
1400 | canonical->suffix); | |
33f448b1 JK |
1401 | } |
1402 | ||
f8eba3c6 TT |
1403 | /* Given FILTERS, a list of canonical names, filter the sals in RESULT |
1404 | and store the result in SELF->CANONICAL. */ | |
50641945 | 1405 | |
f8eba3c6 TT |
1406 | static void |
1407 | filter_results (struct linespec_state *self, | |
6c5b2ebe | 1408 | std::vector<symtab_and_line> *result, |
f73c6ece | 1409 | const std::vector<const char *> &filters) |
f8eba3c6 | 1410 | { |
f73c6ece | 1411 | for (const char *name : filters) |
f8eba3c6 | 1412 | { |
6c5b2ebe | 1413 | linespec_sals lsal; |
f8eba3c6 | 1414 | |
6c5b2ebe | 1415 | for (size_t j = 0; j < result->size (); ++j) |
f8eba3c6 | 1416 | { |
33f448b1 | 1417 | const struct linespec_canonical_name *canonical; |
33f448b1 JK |
1418 | |
1419 | canonical = &self->canonical_names[j]; | |
53a0f8a2 | 1420 | std::string fullform = canonical_to_fullform (canonical); |
33f448b1 | 1421 | |
53a0f8a2 | 1422 | if (name == fullform) |
6c5b2ebe | 1423 | lsal.sals.push_back ((*result)[j]); |
f8eba3c6 TT |
1424 | } |
1425 | ||
6c5b2ebe | 1426 | if (!lsal.sals.empty ()) |
f8eba3c6 TT |
1427 | { |
1428 | lsal.canonical = xstrdup (name); | |
6c5b2ebe | 1429 | self->canonical->lsals.push_back (std::move (lsal)); |
f8eba3c6 TT |
1430 | } |
1431 | } | |
1432 | ||
1433 | self->canonical->pre_expanded = 0; | |
1434 | } | |
1435 | ||
1436 | /* Store RESULT into SELF->CANONICAL. */ | |
1437 | ||
1438 | static void | |
1439 | convert_results_to_lsals (struct linespec_state *self, | |
6c5b2ebe | 1440 | std::vector<symtab_and_line> *result) |
50641945 | 1441 | { |
f8eba3c6 TT |
1442 | struct linespec_sals lsal; |
1443 | ||
1444 | lsal.canonical = NULL; | |
6c5b2ebe PA |
1445 | lsal.sals = std::move (*result); |
1446 | self->canonical->lsals.push_back (std::move (lsal)); | |
f8eba3c6 TT |
1447 | } |
1448 | ||
33f448b1 JK |
1449 | /* A structure that contains two string representations of a struct |
1450 | linespec_canonical_name: | |
1451 | - one where the the symtab's fullname is used; | |
1452 | - one where the filename followed the "set filename-display" | |
1453 | setting. */ | |
1454 | ||
1455 | struct decode_line_2_item | |
1456 | { | |
53a0f8a2 TT |
1457 | decode_line_2_item (std::string &&fullform_, std::string &&displayform_, |
1458 | bool selected_) | |
1459 | : fullform (std::move (fullform_)), | |
1460 | displayform (std::move (displayform_)), | |
1461 | selected (selected_) | |
1462 | { | |
1463 | } | |
33f448b1 | 1464 | |
53a0f8a2 TT |
1465 | /* The form using symtab_to_fullname. */ |
1466 | std::string fullform; | |
1467 | ||
1468 | /* The form using symtab_to_filename_for_display. */ | |
1469 | std::string displayform; | |
33f448b1 JK |
1470 | |
1471 | /* Field is initialized to zero and it is set to one if the user | |
1472 | requested breakpoint for this entry. */ | |
1473 | unsigned int selected : 1; | |
1474 | }; | |
1475 | ||
53a0f8a2 TT |
1476 | /* Helper for std::sort to sort decode_line_2_item entries by |
1477 | DISPLAYFORM and secondarily by FULLFORM. */ | |
33f448b1 | 1478 | |
53a0f8a2 TT |
1479 | static bool |
1480 | decode_line_2_compare_items (const decode_line_2_item &a, | |
1481 | const decode_line_2_item &b) | |
33f448b1 | 1482 | { |
53a0f8a2 TT |
1483 | if (a.displayform != b.displayform) |
1484 | return a.displayform < b.displayform; | |
1485 | return a.fullform < b.fullform; | |
33f448b1 JK |
1486 | } |
1487 | ||
f8eba3c6 TT |
1488 | /* Handle multiple results in RESULT depending on SELECT_MODE. This |
1489 | will either return normally, throw an exception on multiple | |
1490 | results, or present a menu to the user. On return, the SALS vector | |
1491 | in SELF->CANONICAL is set up properly. */ | |
1492 | ||
1493 | static void | |
1494 | decode_line_2 (struct linespec_state *self, | |
6c5b2ebe | 1495 | std::vector<symtab_and_line> *result, |
f8eba3c6 TT |
1496 | const char *select_mode) |
1497 | { | |
a121b7c1 PA |
1498 | char *args; |
1499 | const char *prompt; | |
50641945 | 1500 | int i; |
f73c6ece | 1501 | std::vector<const char *> filters; |
53a0f8a2 | 1502 | std::vector<struct decode_line_2_item> items; |
50641945 | 1503 | |
f8eba3c6 TT |
1504 | gdb_assert (select_mode != multiple_symbols_all); |
1505 | gdb_assert (self->canonical != NULL); | |
6c5b2ebe | 1506 | gdb_assert (!result->empty ()); |
33f448b1 | 1507 | |
33f448b1 | 1508 | /* Prepare ITEMS array. */ |
53a0f8a2 | 1509 | for (i = 0; i < result->size (); ++i) |
50641945 | 1510 | { |
33f448b1 | 1511 | const struct linespec_canonical_name *canonical; |
53a0f8a2 TT |
1512 | std::string displayform; |
1513 | ||
33f448b1 JK |
1514 | canonical = &self->canonical_names[i]; |
1515 | gdb_assert (canonical->suffix != NULL); | |
f8eba3c6 | 1516 | |
53a0f8a2 | 1517 | std::string fullform = canonical_to_fullform (canonical); |
33f448b1 JK |
1518 | |
1519 | if (canonical->symtab == NULL) | |
53a0f8a2 | 1520 | displayform = canonical->suffix; |
33f448b1 | 1521 | else |
f8eba3c6 | 1522 | { |
33f448b1 JK |
1523 | const char *fn_for_display; |
1524 | ||
1525 | fn_for_display = symtab_to_filename_for_display (canonical->symtab); | |
53a0f8a2 TT |
1526 | displayform = string_printf ("%s:%s", fn_for_display, |
1527 | canonical->suffix); | |
f8eba3c6 TT |
1528 | } |
1529 | ||
53a0f8a2 TT |
1530 | items.emplace_back (std::move (fullform), std::move (displayform), |
1531 | false); | |
50641945 FN |
1532 | } |
1533 | ||
33f448b1 | 1534 | /* Sort the list of method names. */ |
53a0f8a2 | 1535 | std::sort (items.begin (), items.end (), decode_line_2_compare_items); |
33f448b1 JK |
1536 | |
1537 | /* Remove entries with the same FULLFORM. */ | |
53a0f8a2 TT |
1538 | items.erase (std::unique (items.begin (), items.end (), |
1539 | [] (const struct decode_line_2_item &a, | |
1540 | const struct decode_line_2_item &b) | |
1541 | { | |
1542 | return a.fullform == b.fullform; | |
1543 | }), | |
1544 | items.end ()); | |
1545 | ||
1546 | if (select_mode == multiple_symbols_cancel && items.size () > 1) | |
f8eba3c6 TT |
1547 | error (_("canceled because the command is ambiguous\n" |
1548 | "See set/show multiple-symbol.")); | |
1549 | ||
53a0f8a2 | 1550 | if (select_mode == multiple_symbols_all || items.size () == 1) |
50641945 | 1551 | { |
f8eba3c6 TT |
1552 | convert_results_to_lsals (self, result); |
1553 | return; | |
50641945 FN |
1554 | } |
1555 | ||
f8eba3c6 | 1556 | printf_unfiltered (_("[0] cancel\n[1] all\n")); |
53a0f8a2 TT |
1557 | for (i = 0; i < items.size (); i++) |
1558 | printf_unfiltered ("[%d] %s\n", i + 2, items[i].displayform.c_str ()); | |
f8eba3c6 TT |
1559 | |
1560 | prompt = getenv ("PS2"); | |
1561 | if (prompt == NULL) | |
50641945 | 1562 | { |
f8eba3c6 | 1563 | prompt = "> "; |
50641945 | 1564 | } |
89fbedf3 | 1565 | args = command_line_input (prompt, "overload-choice"); |
50641945 FN |
1566 | |
1567 | if (args == 0 || *args == 0) | |
e2e0b3e5 | 1568 | error_no_arg (_("one or more choice numbers")); |
50641945 | 1569 | |
bfd28288 PA |
1570 | number_or_range_parser parser (args); |
1571 | while (!parser.finished ()) | |
50641945 | 1572 | { |
bfd28288 | 1573 | int num = parser.get_number (); |
50641945 FN |
1574 | |
1575 | if (num == 0) | |
8a3fe4f8 | 1576 | error (_("canceled")); |
50641945 FN |
1577 | else if (num == 1) |
1578 | { | |
f8eba3c6 TT |
1579 | /* We intentionally make this result in a single breakpoint, |
1580 | contrary to what older versions of gdb did. The | |
1581 | rationale is that this lets a user get the | |
1582 | multiple_symbols_all behavior even with the 'ask' | |
1583 | setting; and he can get separate breakpoints by entering | |
1584 | "2-57" at the query. */ | |
f8eba3c6 TT |
1585 | convert_results_to_lsals (self, result); |
1586 | return; | |
50641945 FN |
1587 | } |
1588 | ||
f8eba3c6 | 1589 | num -= 2; |
53a0f8a2 | 1590 | if (num >= items.size ()) |
f8eba3c6 | 1591 | printf_unfiltered (_("No choice number %d.\n"), num); |
50641945 FN |
1592 | else |
1593 | { | |
33f448b1 | 1594 | struct decode_line_2_item *item = &items[num]; |
f8eba3c6 | 1595 | |
33f448b1 | 1596 | if (!item->selected) |
50641945 | 1597 | { |
f73c6ece | 1598 | filters.push_back (item->fullform.c_str ()); |
33f448b1 | 1599 | item->selected = 1; |
50641945 FN |
1600 | } |
1601 | else | |
1602 | { | |
3e43a32a | 1603 | printf_unfiltered (_("duplicate request for %d ignored.\n"), |
f6f99966 | 1604 | num + 2); |
50641945 FN |
1605 | } |
1606 | } | |
50641945 | 1607 | } |
f8eba3c6 TT |
1608 | |
1609 | filter_results (self, result, filters); | |
50641945 | 1610 | } |
94af9270 | 1611 | |
40e084e1 | 1612 | \f |
3d50dd94 | 1613 | |
40e084e1 KS |
1614 | /* The parser of linespec itself. */ |
1615 | ||
1616 | /* Throw an appropriate error when SYMBOL is not found (optionally in | |
1617 | FILENAME). */ | |
1618 | ||
1619 | static void ATTRIBUTE_NORETURN | |
5d94e27b | 1620 | symbol_not_found_error (const char *symbol, const char *filename) |
3d50dd94 | 1621 | { |
40e084e1 KS |
1622 | if (symbol == NULL) |
1623 | symbol = ""; | |
1624 | ||
1625 | if (!have_full_symbols () | |
1626 | && !have_partial_symbols () | |
1627 | && !have_minimal_symbols ()) | |
1628 | throw_error (NOT_FOUND_ERROR, | |
1629 | _("No symbol table is loaded. Use the \"file\" command.")); | |
1630 | ||
1631 | /* If SYMBOL starts with '$', the user attempted to either lookup | |
1632 | a function/variable in his code starting with '$' or an internal | |
1633 | variable of that name. Since we do not know which, be concise and | |
1634 | explain both possibilities. */ | |
1635 | if (*symbol == '$') | |
1636 | { | |
1637 | if (filename) | |
1638 | throw_error (NOT_FOUND_ERROR, | |
1639 | _("Undefined convenience variable or function \"%s\" " | |
1640 | "not defined in \"%s\"."), symbol, filename); | |
1641 | else | |
1642 | throw_error (NOT_FOUND_ERROR, | |
1643 | _("Undefined convenience variable or function \"%s\" " | |
1644 | "not defined."), symbol); | |
1645 | } | |
1646 | else | |
1647 | { | |
1648 | if (filename) | |
1649 | throw_error (NOT_FOUND_ERROR, | |
1650 | _("Function \"%s\" not defined in \"%s\"."), | |
1651 | symbol, filename); | |
1652 | else | |
1653 | throw_error (NOT_FOUND_ERROR, | |
1654 | _("Function \"%s\" not defined."), symbol); | |
1655 | } | |
3d50dd94 JK |
1656 | } |
1657 | ||
40e084e1 KS |
1658 | /* Throw an appropriate error when an unexpected token is encountered |
1659 | in the input. */ | |
94af9270 | 1660 | |
40e084e1 KS |
1661 | static void ATTRIBUTE_NORETURN |
1662 | unexpected_linespec_error (linespec_parser *parser) | |
94af9270 | 1663 | { |
40e084e1 KS |
1664 | linespec_token token; |
1665 | static const char * token_type_strings[] | |
1666 | = {"keyword", "colon", "string", "number", "comma", "end of input"}; | |
94af9270 | 1667 | |
40e084e1 KS |
1668 | /* Get the token that generated the error. */ |
1669 | token = linespec_lexer_lex_one (parser); | |
94af9270 | 1670 | |
40e084e1 KS |
1671 | /* Finally, throw the error. */ |
1672 | if (token.type == LSTOKEN_STRING || token.type == LSTOKEN_NUMBER | |
1673 | || token.type == LSTOKEN_KEYWORD) | |
94af9270 | 1674 | { |
a5b5adf5 | 1675 | gdb::unique_xmalloc_ptr<char> string = copy_token_string (token); |
40e084e1 KS |
1676 | throw_error (GENERIC_ERROR, |
1677 | _("malformed linespec error: unexpected %s, \"%s\""), | |
a5b5adf5 | 1678 | token_type_strings[token.type], string.get ()); |
40e084e1 KS |
1679 | } |
1680 | else | |
1681 | throw_error (GENERIC_ERROR, | |
1682 | _("malformed linespec error: unexpected %s"), | |
1683 | token_type_strings[token.type]); | |
1684 | } | |
1685 | ||
00e52e53 KS |
1686 | /* Throw an undefined label error. */ |
1687 | ||
1688 | static void ATTRIBUTE_NORETURN | |
1689 | undefined_label_error (const char *function, const char *label) | |
1690 | { | |
1691 | if (function != NULL) | |
1692 | throw_error (NOT_FOUND_ERROR, | |
1693 | _("No label \"%s\" defined in function \"%s\"."), | |
1694 | label, function); | |
1695 | else | |
1696 | throw_error (NOT_FOUND_ERROR, | |
1697 | _("No label \"%s\" defined in current function."), | |
1698 | label); | |
1699 | } | |
1700 | ||
1701 | /* Throw a source file not found error. */ | |
1702 | ||
1703 | static void ATTRIBUTE_NORETURN | |
1704 | source_file_not_found_error (const char *name) | |
1705 | { | |
1706 | throw_error (NOT_FOUND_ERROR, _("No source file named %s."), name); | |
1707 | } | |
1708 | ||
c45ec17c PA |
1709 | /* Unless at EIO, save the current stream position as completion word |
1710 | point, and consume the next token. */ | |
1711 | ||
1712 | static linespec_token | |
1713 | save_stream_and_consume_token (linespec_parser *parser) | |
1714 | { | |
1715 | if (linespec_lexer_peek_token (parser).type != LSTOKEN_EOI) | |
1716 | parser->completion_word = PARSER_STREAM (parser); | |
1717 | return linespec_lexer_consume_token (parser); | |
1718 | } | |
1719 | ||
87f0e720 | 1720 | /* See description in linespec.h. */ |
40e084e1 | 1721 | |
87f0e720 | 1722 | struct line_offset |
09cf2b22 | 1723 | linespec_parse_line_offset (const char *string) |
40e084e1 | 1724 | { |
87f0e720 | 1725 | const char *start = string; |
40e084e1 KS |
1726 | struct line_offset line_offset = {0, LINE_OFFSET_NONE}; |
1727 | ||
1728 | if (*string == '+') | |
1729 | { | |
1730 | line_offset.sign = LINE_OFFSET_PLUS; | |
1731 | ++string; | |
1732 | } | |
1733 | else if (*string == '-') | |
1734 | { | |
1735 | line_offset.sign = LINE_OFFSET_MINUS; | |
1736 | ++string; | |
1737 | } | |
1738 | ||
87f0e720 KS |
1739 | if (*string != '\0' && !isdigit (*string)) |
1740 | error (_("malformed line offset: \"%s\""), start); | |
1741 | ||
40e084e1 KS |
1742 | /* Right now, we only allow base 10 for offsets. */ |
1743 | line_offset.offset = atoi (string); | |
1744 | return line_offset; | |
1745 | } | |
1746 | ||
c45ec17c PA |
1747 | /* In completion mode, if the user is still typing the number, there's |
1748 | no possible completion to offer. But if there's already input past | |
1749 | the number, setup to expect NEXT. */ | |
1750 | ||
1751 | static void | |
1752 | set_completion_after_number (linespec_parser *parser, | |
1753 | linespec_complete_what next) | |
1754 | { | |
1755 | if (*PARSER_STREAM (parser) == ' ') | |
1756 | { | |
f1735a53 | 1757 | parser->completion_word = skip_spaces (PARSER_STREAM (parser) + 1); |
c45ec17c PA |
1758 | parser->complete_what = next; |
1759 | } | |
1760 | else | |
1761 | { | |
1762 | parser->completion_word = PARSER_STREAM (parser); | |
1763 | parser->complete_what = linespec_complete_what::NOTHING; | |
1764 | } | |
1765 | } | |
1766 | ||
40e084e1 KS |
1767 | /* Parse the basic_spec in PARSER's input. */ |
1768 | ||
1769 | static void | |
1770 | linespec_parse_basic (linespec_parser *parser) | |
1771 | { | |
a5b5adf5 | 1772 | gdb::unique_xmalloc_ptr<char> name; |
40e084e1 | 1773 | linespec_token token; |
7e41c8db KS |
1774 | std::vector<block_symbol> symbols; |
1775 | std::vector<block_symbol> *labels; | |
c2a031c5 | 1776 | std::vector<bound_minimal_symbol> minimal_symbols; |
40e084e1 KS |
1777 | |
1778 | /* Get the next token. */ | |
1779 | token = linespec_lexer_lex_one (parser); | |
1780 | ||
1781 | /* If it is EOI or KEYWORD, issue an error. */ | |
c45ec17c PA |
1782 | if (token.type == LSTOKEN_KEYWORD) |
1783 | { | |
1784 | parser->complete_what = linespec_complete_what::NOTHING; | |
1785 | unexpected_linespec_error (parser); | |
1786 | } | |
1787 | else if (token.type == LSTOKEN_EOI) | |
1788 | { | |
1789 | unexpected_linespec_error (parser); | |
1790 | } | |
40e084e1 KS |
1791 | /* If it is a LSTOKEN_NUMBER, we have an offset. */ |
1792 | else if (token.type == LSTOKEN_NUMBER) | |
1793 | { | |
c45ec17c PA |
1794 | set_completion_after_number (parser, linespec_complete_what::KEYWORD); |
1795 | ||
40e084e1 KS |
1796 | /* Record the line offset and get the next token. */ |
1797 | name = copy_token_string (token); | |
a5b5adf5 TT |
1798 | PARSER_EXPLICIT (parser)->line_offset |
1799 | = linespec_parse_line_offset (name.get ()); | |
40e084e1 KS |
1800 | |
1801 | /* Get the next token. */ | |
1802 | token = linespec_lexer_consume_token (parser); | |
1803 | ||
1804 | /* If the next token is a comma, stop parsing and return. */ | |
1805 | if (token.type == LSTOKEN_COMMA) | |
c45ec17c PA |
1806 | { |
1807 | parser->complete_what = linespec_complete_what::NOTHING; | |
1808 | return; | |
1809 | } | |
40e084e1 KS |
1810 | |
1811 | /* If the next token is anything but EOI or KEYWORD, issue | |
1812 | an error. */ | |
1813 | if (token.type != LSTOKEN_KEYWORD && token.type != LSTOKEN_EOI) | |
1814 | unexpected_linespec_error (parser); | |
1815 | } | |
1816 | ||
1817 | if (token.type == LSTOKEN_KEYWORD || token.type == LSTOKEN_EOI) | |
1818 | return; | |
1819 | ||
1820 | /* Next token must be LSTOKEN_STRING. */ | |
1821 | if (token.type != LSTOKEN_STRING) | |
c45ec17c PA |
1822 | { |
1823 | parser->complete_what = linespec_complete_what::NOTHING; | |
1824 | unexpected_linespec_error (parser); | |
1825 | } | |
40e084e1 KS |
1826 | |
1827 | /* The current token will contain the name of a function, method, | |
1828 | or label. */ | |
c45ec17c | 1829 | name = copy_token_string (token); |
c45ec17c PA |
1830 | |
1831 | if (parser->completion_tracker != NULL) | |
1832 | { | |
1833 | /* If the function name ends with a ":", then this may be an | |
1834 | incomplete "::" scope operator instead of a label separator. | |
1835 | E.g., | |
1836 | "b klass:<tab>" | |
1837 | which should expand to: | |
1838 | "b klass::method()" | |
1839 | ||
1840 | Do a tentative completion assuming the later. If we find | |
1841 | completions, advance the stream past the colon token and make | |
1842 | it part of the function name/token. */ | |
1843 | ||
1844 | if (!parser->completion_quote_char | |
1845 | && strcmp (PARSER_STREAM (parser), ":") == 0) | |
1846 | { | |
1847 | completion_tracker tmp_tracker; | |
1848 | const char *source_filename | |
1849 | = PARSER_EXPLICIT (parser)->source_filename; | |
a20714ff PA |
1850 | symbol_name_match_type match_type |
1851 | = PARSER_EXPLICIT (parser)->func_name_match_type; | |
c45ec17c PA |
1852 | |
1853 | linespec_complete_function (tmp_tracker, | |
1854 | parser->completion_word, | |
a20714ff | 1855 | match_type, |
c45ec17c PA |
1856 | source_filename); |
1857 | ||
1858 | if (tmp_tracker.have_completions ()) | |
1859 | { | |
1860 | PARSER_STREAM (parser)++; | |
1861 | LS_TOKEN_STOKEN (token).length++; | |
1862 | ||
a5b5adf5 TT |
1863 | name.reset (savestring (parser->completion_word, |
1864 | (PARSER_STREAM (parser) | |
1865 | - parser->completion_word))); | |
c45ec17c PA |
1866 | } |
1867 | } | |
1868 | ||
a5b5adf5 | 1869 | PARSER_EXPLICIT (parser)->function_name = name.release (); |
c45ec17c PA |
1870 | } |
1871 | else | |
1872 | { | |
6a307fc5 TT |
1873 | /* Try looking it up as a function/method. */ |
1874 | find_linespec_symbols (PARSER_STATE (parser), | |
a5b5adf5 | 1875 | PARSER_RESULT (parser)->file_symtabs, name.get (), |
6a307fc5 TT |
1876 | PARSER_EXPLICIT (parser)->func_name_match_type, |
1877 | &symbols, &minimal_symbols); | |
40e084e1 | 1878 | |
c2a031c5 | 1879 | if (!symbols.empty () || !minimal_symbols.empty ()) |
94af9270 | 1880 | { |
7243d011 | 1881 | PARSER_RESULT (parser)->function_symbols |
7e41c8db | 1882 | = new std::vector<block_symbol> (std::move (symbols)); |
c2a031c5 KS |
1883 | PARSER_RESULT (parser)->minimal_symbols |
1884 | = new std::vector<bound_minimal_symbol> | |
1885 | (std::move (minimal_symbols)); | |
a5b5adf5 | 1886 | PARSER_EXPLICIT (parser)->function_name = name.release (); |
40e084e1 | 1887 | } |
6a307fc5 | 1888 | else |
b4013987 | 1889 | { |
6a307fc5 TT |
1890 | /* NAME was not a function or a method. So it must be a label |
1891 | name or user specified variable like "break foo.c:$zippo". */ | |
1892 | labels = find_label_symbols (PARSER_STATE (parser), NULL, | |
a5b5adf5 | 1893 | &symbols, name.get ()); |
6a307fc5 TT |
1894 | if (labels != NULL) |
1895 | { | |
1896 | PARSER_RESULT (parser)->labels.label_symbols = labels; | |
7243d011 | 1897 | PARSER_RESULT (parser)->labels.function_symbols |
7e41c8db | 1898 | = new std::vector<block_symbol> (std::move (symbols)); |
a5b5adf5 | 1899 | PARSER_EXPLICIT (parser)->label_name = name.release (); |
6a307fc5 TT |
1900 | } |
1901 | else if (token.type == LSTOKEN_STRING | |
1902 | && *LS_TOKEN_STOKEN (token).ptr == '$') | |
1903 | { | |
1904 | /* User specified a convenience variable or history value. */ | |
1905 | PARSER_EXPLICIT (parser)->line_offset | |
a5b5adf5 | 1906 | = linespec_parse_variable (PARSER_STATE (parser), name.get ()); |
b4013987 | 1907 | |
6a307fc5 TT |
1908 | if (PARSER_EXPLICIT (parser)->line_offset.sign == LINE_OFFSET_UNKNOWN) |
1909 | { | |
1910 | /* The user-specified variable was not valid. Do not | |
1911 | throw an error here. parse_linespec will do it for us. */ | |
a5b5adf5 | 1912 | PARSER_EXPLICIT (parser)->function_name = name.release (); |
6a307fc5 TT |
1913 | return; |
1914 | } | |
6a307fc5 TT |
1915 | } |
1916 | else | |
b4013987 | 1917 | { |
6a307fc5 TT |
1918 | /* The name is also not a label. Abort parsing. Do not throw |
1919 | an error here. parse_linespec will do it for us. */ | |
1920 | ||
1921 | /* Save a copy of the name we were trying to lookup. */ | |
a5b5adf5 | 1922 | PARSER_EXPLICIT (parser)->function_name = name.release (); |
b4013987 AA |
1923 | return; |
1924 | } | |
1925 | } | |
c45ec17c PA |
1926 | } |
1927 | ||
1928 | int previous_qc = parser->completion_quote_char; | |
40e084e1 KS |
1929 | |
1930 | /* Get the next token. */ | |
1931 | token = linespec_lexer_consume_token (parser); | |
1932 | ||
c45ec17c PA |
1933 | if (token.type == LSTOKEN_EOI) |
1934 | { | |
1935 | if (previous_qc && !parser->completion_quote_char) | |
1936 | parser->complete_what = linespec_complete_what::KEYWORD; | |
1937 | } | |
1938 | else if (token.type == LSTOKEN_COLON) | |
40e084e1 KS |
1939 | { |
1940 | /* User specified a label or a lineno. */ | |
1941 | token = linespec_lexer_consume_token (parser); | |
1942 | ||
1943 | if (token.type == LSTOKEN_NUMBER) | |
1944 | { | |
1945 | /* User specified an offset. Record the line offset and | |
1946 | get the next token. */ | |
c45ec17c PA |
1947 | set_completion_after_number (parser, linespec_complete_what::KEYWORD); |
1948 | ||
40e084e1 | 1949 | name = copy_token_string (token); |
00e52e53 | 1950 | PARSER_EXPLICIT (parser)->line_offset |
a5b5adf5 | 1951 | = linespec_parse_line_offset (name.get ()); |
40e084e1 | 1952 | |
c45ec17c | 1953 | /* Get the next token. */ |
40e084e1 KS |
1954 | token = linespec_lexer_consume_token (parser); |
1955 | } | |
c45ec17c PA |
1956 | else if (token.type == LSTOKEN_EOI && parser->completion_tracker != NULL) |
1957 | { | |
1958 | parser->complete_what = linespec_complete_what::LABEL; | |
1959 | } | |
40e084e1 KS |
1960 | else if (token.type == LSTOKEN_STRING) |
1961 | { | |
c45ec17c PA |
1962 | parser->complete_what = linespec_complete_what::LABEL; |
1963 | ||
1964 | /* If we have text after the label separated by whitespace | |
1965 | (e.g., "b func():lab i<tab>"), don't consider it part of | |
1966 | the label. In completion mode that should complete to | |
1967 | "if", in normal mode, the 'i' should be treated as | |
1968 | garbage. */ | |
1969 | if (parser->completion_quote_char == '\0') | |
1970 | { | |
1971 | const char *ptr = LS_TOKEN_STOKEN (token).ptr; | |
1972 | for (size_t i = 0; i < LS_TOKEN_STOKEN (token).length; i++) | |
1973 | { | |
1974 | if (ptr[i] == ' ') | |
1975 | { | |
1976 | LS_TOKEN_STOKEN (token).length = i; | |
f1735a53 | 1977 | PARSER_STREAM (parser) = skip_spaces (ptr + i + 1); |
c45ec17c PA |
1978 | break; |
1979 | } | |
1980 | } | |
1981 | } | |
1982 | ||
1983 | if (parser->completion_tracker != NULL) | |
1984 | { | |
1985 | if (PARSER_STREAM (parser)[-1] == ' ') | |
1986 | { | |
1987 | parser->completion_word = PARSER_STREAM (parser); | |
1988 | parser->complete_what = linespec_complete_what::KEYWORD; | |
1989 | } | |
1990 | } | |
1991 | else | |
1992 | { | |
6a307fc5 TT |
1993 | /* Grab a copy of the label's name and look it up. */ |
1994 | name = copy_token_string (token); | |
6a307fc5 TT |
1995 | labels |
1996 | = find_label_symbols (PARSER_STATE (parser), | |
1997 | PARSER_RESULT (parser)->function_symbols, | |
a5b5adf5 | 1998 | &symbols, name.get ()); |
40e084e1 | 1999 | |
6a307fc5 TT |
2000 | if (labels != NULL) |
2001 | { | |
2002 | PARSER_RESULT (parser)->labels.label_symbols = labels; | |
7243d011 | 2003 | PARSER_RESULT (parser)->labels.function_symbols |
7e41c8db | 2004 | = new std::vector<block_symbol> (std::move (symbols)); |
a5b5adf5 | 2005 | PARSER_EXPLICIT (parser)->label_name = name.release (); |
6a307fc5 TT |
2006 | } |
2007 | else | |
2008 | { | |
2009 | /* We don't know what it was, but it isn't a label. */ | |
2010 | undefined_label_error | |
a5b5adf5 | 2011 | (PARSER_EXPLICIT (parser)->function_name, name.get ()); |
6a307fc5 | 2012 | } |
40e084e1 | 2013 | |
c45ec17c PA |
2014 | } |
2015 | ||
40e084e1 | 2016 | /* Check for a line offset. */ |
c45ec17c | 2017 | token = save_stream_and_consume_token (parser); |
40e084e1 KS |
2018 | if (token.type == LSTOKEN_COLON) |
2019 | { | |
2020 | /* Get the next token. */ | |
2021 | token = linespec_lexer_consume_token (parser); | |
2022 | ||
2023 | /* It must be a line offset. */ | |
2024 | if (token.type != LSTOKEN_NUMBER) | |
2025 | unexpected_linespec_error (parser); | |
2026 | ||
c6756f62 | 2027 | /* Record the line offset and get the next token. */ |
40e084e1 | 2028 | name = copy_token_string (token); |
40e084e1 | 2029 | |
00e52e53 | 2030 | PARSER_EXPLICIT (parser)->line_offset |
a5b5adf5 | 2031 | = linespec_parse_line_offset (name.get ()); |
40e084e1 KS |
2032 | |
2033 | /* Get the next token. */ | |
2034 | token = linespec_lexer_consume_token (parser); | |
94af9270 KS |
2035 | } |
2036 | } | |
40e084e1 KS |
2037 | else |
2038 | { | |
2039 | /* Trailing ':' in the input. Issue an error. */ | |
2040 | unexpected_linespec_error (parser); | |
2041 | } | |
94af9270 | 2042 | } |
40e084e1 | 2043 | } |
94af9270 | 2044 | |
40e084e1 | 2045 | /* Canonicalize the linespec contained in LS. The result is saved into |
00e52e53 KS |
2046 | STATE->canonical. This function handles both linespec and explicit |
2047 | locations. */ | |
40e084e1 KS |
2048 | |
2049 | static void | |
f00aae0f | 2050 | canonicalize_linespec (struct linespec_state *state, const linespec_p ls) |
40e084e1 | 2051 | { |
00e52e53 | 2052 | struct event_location *canon; |
67994074 | 2053 | struct explicit_location *explicit_loc; |
f00aae0f | 2054 | |
40e084e1 KS |
2055 | /* If canonicalization was not requested, no need to do anything. */ |
2056 | if (!state->canonical) | |
2057 | return; | |
2058 | ||
00e52e53 | 2059 | /* Save everything as an explicit location. */ |
8e9e35b1 TT |
2060 | state->canonical->location |
2061 | = new_explicit_location (&ls->explicit_loc); | |
2062 | canon = state->canonical->location.get (); | |
67994074 | 2063 | explicit_loc = get_explicit_location (canon); |
40e084e1 | 2064 | |
67994074 | 2065 | if (explicit_loc->label_name != NULL) |
a06efdd6 | 2066 | { |
00e52e53 | 2067 | state->canonical->special_display = 1; |
40e084e1 | 2068 | |
67994074 | 2069 | if (explicit_loc->function_name == NULL) |
40e084e1 | 2070 | { |
a06efdd6 | 2071 | /* No function was specified, so add the symbol name. */ |
7243d011 KS |
2072 | gdb_assert (!ls->labels.function_symbols->empty () |
2073 | && (ls->labels.function_symbols->size () == 1)); | |
7e41c8db KS |
2074 | block_symbol s = ls->labels.function_symbols->front (); |
2075 | explicit_loc->function_name | |
2076 | = xstrdup (SYMBOL_NATURAL_NAME (s.symbol)); | |
40e084e1 | 2077 | } |
a06efdd6 | 2078 | } |
40e084e1 | 2079 | |
00e52e53 KS |
2080 | /* If this location originally came from a linespec, save a string |
2081 | representation of it for display and saving to file. */ | |
2082 | if (state->is_linespec) | |
a06efdd6 | 2083 | { |
67994074 | 2084 | char *linespec = explicit_location_to_linespec (explicit_loc); |
a06efdd6 | 2085 | |
00e52e53 KS |
2086 | set_event_location_string (canon, linespec); |
2087 | xfree (linespec); | |
2088 | } | |
94af9270 | 2089 | } |
c00f8484 | 2090 | |
40e084e1 | 2091 | /* Given a line offset in LS, construct the relevant SALs. */ |
c00f8484 | 2092 | |
6c5b2ebe | 2093 | static std::vector<symtab_and_line> |
40e084e1 KS |
2094 | create_sals_line_offset (struct linespec_state *self, |
2095 | linespec_p ls) | |
c00f8484 | 2096 | { |
40e084e1 | 2097 | int use_default = 0; |
c00f8484 | 2098 | |
40e084e1 KS |
2099 | /* This is where we need to make sure we have good defaults. |
2100 | We must guarantee that this section of code is never executed | |
2e47c6ca | 2101 | when we are called with just a function name, since |
40e084e1 KS |
2102 | set_default_source_symtab_and_line uses |
2103 | select_source_symtab that calls us with such an argument. */ | |
2104 | ||
2a908241 KS |
2105 | if (ls->file_symtabs->size () == 1 |
2106 | && ls->file_symtabs->front () == nullptr) | |
3d50dd94 | 2107 | { |
05cba821 JK |
2108 | const char *fullname; |
2109 | ||
40e084e1 | 2110 | set_current_program_space (self->program_space); |
c00f8484 | 2111 | |
40e084e1 KS |
2112 | /* Make sure we have at least a default source line. */ |
2113 | set_default_source_symtab_and_line (); | |
2114 | initialize_defaults (&self->default_symtab, &self->default_line); | |
05cba821 | 2115 | fullname = symtab_to_fullname (self->default_symtab); |
4717cec4 SM |
2116 | *ls->file_symtabs |
2117 | = collect_symtabs_from_filename (fullname, self->search_pspace); | |
40e084e1 KS |
2118 | use_default = 1; |
2119 | } | |
c00f8484 | 2120 | |
51abb421 | 2121 | symtab_and_line val; |
67994074 KS |
2122 | val.line = ls->explicit_loc.line_offset.offset; |
2123 | switch (ls->explicit_loc.line_offset.sign) | |
40e084e1 KS |
2124 | { |
2125 | case LINE_OFFSET_PLUS: | |
67994074 | 2126 | if (ls->explicit_loc.line_offset.offset == 0) |
40e084e1 KS |
2127 | val.line = 5; |
2128 | if (use_default) | |
2129 | val.line = self->default_line + val.line; | |
2130 | break; | |
2131 | ||
2132 | case LINE_OFFSET_MINUS: | |
67994074 | 2133 | if (ls->explicit_loc.line_offset.offset == 0) |
40e084e1 KS |
2134 | val.line = 15; |
2135 | if (use_default) | |
2136 | val.line = self->default_line - val.line; | |
2137 | else | |
2138 | val.line = -val.line; | |
2139 | break; | |
2140 | ||
2141 | case LINE_OFFSET_NONE: | |
2142 | break; /* No need to adjust val.line. */ | |
2143 | } | |
2144 | ||
6c5b2ebe | 2145 | std::vector<symtab_and_line> values; |
40e084e1 | 2146 | if (self->list_mode) |
6c5b2ebe | 2147 | values = decode_digits_list_mode (self, ls, val); |
40e084e1 KS |
2148 | else |
2149 | { | |
2150 | struct linetable_entry *best_entry = NULL; | |
40e084e1 KS |
2151 | int i, j; |
2152 | ||
6c5b2ebe PA |
2153 | std::vector<symtab_and_line> intermediate_results |
2154 | = decode_digits_ordinary (self, ls, val.line, &best_entry); | |
2155 | if (intermediate_results.empty () && best_entry != NULL) | |
2156 | intermediate_results = decode_digits_ordinary (self, ls, | |
2157 | best_entry->line, | |
2158 | &best_entry); | |
40e084e1 KS |
2159 | |
2160 | /* For optimized code, the compiler can scatter one source line | |
2161 | across disjoint ranges of PC values, even when no duplicate | |
2162 | functions or inline functions are involved. For example, | |
2163 | 'for (;;)' inside a non-template, non-inline, and non-ctor-or-dtor | |
2164 | function can result in two PC ranges. In this case, we don't | |
2165 | want to set a breakpoint on the first PC of each range. To filter | |
2166 | such cases, we use containing blocks -- for each PC found | |
2167 | above, we see if there are other PCs that are in the same | |
2168 | block. If yes, the other PCs are filtered out. */ | |
2169 | ||
0fc21fd8 TT |
2170 | gdb::def_vector<int> filter (intermediate_results.size ()); |
2171 | gdb::def_vector<const block *> blocks (intermediate_results.size ()); | |
40e084e1 | 2172 | |
6c5b2ebe | 2173 | for (i = 0; i < intermediate_results.size (); ++i) |
3d50dd94 | 2174 | { |
6c5b2ebe | 2175 | set_current_program_space (intermediate_results[i].pspace); |
c00f8484 | 2176 | |
40e084e1 | 2177 | filter[i] = 1; |
6c5b2ebe PA |
2178 | blocks[i] = block_for_pc_sect (intermediate_results[i].pc, |
2179 | intermediate_results[i].section); | |
3d50dd94 | 2180 | } |
c00f8484 | 2181 | |
6c5b2ebe | 2182 | for (i = 0; i < intermediate_results.size (); ++i) |
40e084e1 KS |
2183 | { |
2184 | if (blocks[i] != NULL) | |
6c5b2ebe | 2185 | for (j = i + 1; j < intermediate_results.size (); ++j) |
40e084e1 KS |
2186 | { |
2187 | if (blocks[j] == blocks[i]) | |
2188 | { | |
2189 | filter[j] = 0; | |
2190 | break; | |
2191 | } | |
2192 | } | |
2193 | } | |
c00f8484 | 2194 | |
6c5b2ebe | 2195 | for (i = 0; i < intermediate_results.size (); ++i) |
40e084e1 KS |
2196 | if (filter[i]) |
2197 | { | |
2198 | struct symbol *sym = (blocks[i] | |
2199 | ? block_containing_function (blocks[i]) | |
2200 | : NULL); | |
3d50dd94 | 2201 | |
40e084e1 | 2202 | if (self->funfirstline) |
6c5b2ebe | 2203 | skip_prologue_sal (&intermediate_results[i]); |
cd2bb709 | 2204 | intermediate_results[i].symbol = sym; |
6c5b2ebe | 2205 | add_sal_to_sals (self, &values, &intermediate_results[i], |
66f1999b | 2206 | sym ? SYMBOL_NATURAL_NAME (sym) : NULL, 0); |
40e084e1 | 2207 | } |
f17170e5 | 2208 | } |
c00f8484 | 2209 | |
6c5b2ebe | 2210 | if (values.empty ()) |
40e084e1 | 2211 | { |
67994074 | 2212 | if (ls->explicit_loc.source_filename) |
40e084e1 | 2213 | throw_error (NOT_FOUND_ERROR, _("No line %d in file \"%s\"."), |
67994074 | 2214 | val.line, ls->explicit_loc.source_filename); |
40e084e1 KS |
2215 | else |
2216 | throw_error (NOT_FOUND_ERROR, _("No line %d in the current file."), | |
2217 | val.line); | |
2218 | } | |
3d50dd94 | 2219 | |
40e084e1 | 2220 | return values; |
c00f8484 KS |
2221 | } |
2222 | ||
a06efdd6 KS |
2223 | /* Convert the given ADDRESS into SaLs. */ |
2224 | ||
6c5b2ebe | 2225 | static std::vector<symtab_and_line> |
a06efdd6 KS |
2226 | convert_address_location_to_sals (struct linespec_state *self, |
2227 | CORE_ADDR address) | |
2228 | { | |
6c5b2ebe | 2229 | symtab_and_line sal = find_pc_line (address, 0); |
a06efdd6 KS |
2230 | sal.pc = address; |
2231 | sal.section = find_pc_overlay (address); | |
2232 | sal.explicit_pc = 1; | |
cd2bb709 | 2233 | sal.symbol = find_pc_sect_containing_function (sal.pc, sal.section); |
6c5b2ebe PA |
2234 | |
2235 | std::vector<symtab_and_line> sals; | |
a06efdd6 KS |
2236 | add_sal_to_sals (self, &sals, &sal, core_addr_to_string (address), 1); |
2237 | ||
2238 | return sals; | |
2239 | } | |
2240 | ||
40e084e1 KS |
2241 | /* Create and return SALs from the linespec LS. */ |
2242 | ||
6c5b2ebe | 2243 | static std::vector<symtab_and_line> |
40e084e1 KS |
2244 | convert_linespec_to_sals (struct linespec_state *state, linespec_p ls) |
2245 | { | |
6c5b2ebe | 2246 | std::vector<symtab_and_line> sals; |
40e084e1 | 2247 | |
a06efdd6 | 2248 | if (ls->labels.label_symbols != NULL) |
40e084e1 KS |
2249 | { |
2250 | /* We have just a bunch of functions/methods or labels. */ | |
7e41c8db KS |
2251 | struct symtab_and_line sal; |
2252 | ||
3553eadc | 2253 | for (const auto &sym : *ls->labels.label_symbols) |
40e084e1 | 2254 | { |
7e41c8db KS |
2255 | struct program_space *pspace |
2256 | = SYMTAB_PSPACE (symbol_symtab (sym.symbol)); | |
fdbb204b | 2257 | |
7e41c8db | 2258 | if (symbol_to_sal (&sal, state->funfirstline, sym.symbol) |
fdbb204b | 2259 | && maybe_add_address (state->addr_set, pspace, sal.pc)) |
64b92e45 | 2260 | add_sal_to_sals (state, &sals, &sal, |
7e41c8db | 2261 | SYMBOL_NATURAL_NAME (sym.symbol), 0); |
40e084e1 KS |
2262 | } |
2263 | } | |
2264 | else if (ls->function_symbols != NULL || ls->minimal_symbols != NULL) | |
2265 | { | |
2266 | /* We have just a bunch of functions and/or methods. */ | |
40e084e1 KS |
2267 | if (ls->function_symbols != NULL) |
2268 | { | |
2269 | /* Sort symbols so that symbols with the same program space are next | |
2270 | to each other. */ | |
7243d011 KS |
2271 | std::sort (ls->function_symbols->begin (), |
2272 | ls->function_symbols->end (), | |
4dedf84d | 2273 | compare_symbols); |
40e084e1 | 2274 | |
7243d011 | 2275 | for (const auto &sym : *ls->function_symbols) |
40e084e1 | 2276 | { |
7e41c8db KS |
2277 | program_space *pspace |
2278 | = SYMTAB_PSPACE (symbol_symtab (sym.symbol)); | |
40e084e1 | 2279 | set_current_program_space (pspace); |
76af0f26 PA |
2280 | |
2281 | /* Don't skip to the first line of the function if we | |
2282 | had found an ifunc minimal symbol for this function, | |
2283 | because that means that this function is an ifunc | |
2284 | resolver with the same name as the ifunc itself. */ | |
2285 | bool found_ifunc = false; | |
2286 | ||
2287 | if (state->funfirstline | |
2288 | && ls->minimal_symbols != NULL | |
7e41c8db | 2289 | && SYMBOL_CLASS (sym.symbol) == LOC_BLOCK) |
76af0f26 PA |
2290 | { |
2291 | const CORE_ADDR addr | |
7e41c8db | 2292 | = BLOCK_ENTRY_PC (SYMBOL_BLOCK_VALUE (sym.symbol)); |
76af0f26 | 2293 | |
c2a031c5 | 2294 | for (const auto &elem : *ls->minimal_symbols) |
76af0f26 | 2295 | { |
c2a031c5 KS |
2296 | if (MSYMBOL_TYPE (elem.minsym) == mst_text_gnu_ifunc |
2297 | || MSYMBOL_TYPE (elem.minsym) == mst_data_gnu_ifunc) | |
76af0f26 | 2298 | { |
c2a031c5 KS |
2299 | CORE_ADDR msym_addr = BMSYMBOL_VALUE_ADDRESS (elem); |
2300 | if (MSYMBOL_TYPE (elem.minsym) == mst_data_gnu_ifunc) | |
f50776aa PA |
2301 | { |
2302 | struct gdbarch *gdbarch | |
c2a031c5 | 2303 | = get_objfile_arch (elem.objfile); |
f50776aa PA |
2304 | msym_addr |
2305 | = (gdbarch_convert_from_func_ptr_addr | |
2306 | (gdbarch, | |
2307 | msym_addr, | |
8b88a78e | 2308 | current_top_target ())); |
f50776aa PA |
2309 | } |
2310 | ||
2311 | if (msym_addr == addr) | |
2312 | { | |
2313 | found_ifunc = true; | |
2314 | break; | |
2315 | } | |
76af0f26 PA |
2316 | } |
2317 | } | |
2318 | } | |
2319 | ||
2320 | if (!found_ifunc) | |
2321 | { | |
2322 | symtab_and_line sal; | |
7e41c8db | 2323 | if (symbol_to_sal (&sal, state->funfirstline, sym.symbol) |
76af0f26 PA |
2324 | && maybe_add_address (state->addr_set, pspace, sal.pc)) |
2325 | add_sal_to_sals (state, &sals, &sal, | |
7e41c8db | 2326 | SYMBOL_NATURAL_NAME (sym.symbol), 0); |
76af0f26 | 2327 | } |
40e084e1 KS |
2328 | } |
2329 | } | |
2330 | ||
2331 | if (ls->minimal_symbols != NULL) | |
2332 | { | |
76af0f26 | 2333 | /* Sort minimal symbols by program space, too */ |
c2a031c5 KS |
2334 | std::sort (ls->minimal_symbols->begin (), |
2335 | ls->minimal_symbols->end (), | |
2336 | compare_msymbols); | |
40e084e1 | 2337 | |
c2a031c5 | 2338 | for (const auto &elem : *ls->minimal_symbols) |
40e084e1 | 2339 | { |
c2a031c5 | 2340 | program_space *pspace = elem.objfile->pspace; |
40e084e1 | 2341 | set_current_program_space (pspace); |
c2a031c5 | 2342 | minsym_found (state, elem.objfile, elem.minsym, &sals); |
40e084e1 KS |
2343 | } |
2344 | } | |
2345 | } | |
67994074 | 2346 | else if (ls->explicit_loc.line_offset.sign != LINE_OFFSET_UNKNOWN) |
40e084e1 KS |
2347 | { |
2348 | /* Only an offset was specified. */ | |
2349 | sals = create_sals_line_offset (state, ls); | |
2350 | ||
2351 | /* Make sure we have a filename for canonicalization. */ | |
67994074 | 2352 | if (ls->explicit_loc.source_filename == NULL) |
05cba821 JK |
2353 | { |
2354 | const char *fullname = symtab_to_fullname (state->default_symtab); | |
2355 | ||
e93ba630 JK |
2356 | /* It may be more appropriate to keep DEFAULT_SYMTAB in its symtab |
2357 | form so that displaying SOURCE_FILENAME can follow the current | |
2358 | FILENAME_DISPLAY_STRING setting. But as it is used only rarely | |
2359 | it has been kept for code simplicity only in absolute form. */ | |
67994074 | 2360 | ls->explicit_loc.source_filename = xstrdup (fullname); |
05cba821 | 2361 | } |
40e084e1 KS |
2362 | } |
2363 | else | |
2364 | { | |
2365 | /* We haven't found any results... */ | |
2366 | return sals; | |
2367 | } | |
2368 | ||
2369 | canonicalize_linespec (state, ls); | |
2370 | ||
6c5b2ebe | 2371 | if (!sals.empty () && state->canonical != NULL) |
40e084e1 KS |
2372 | state->canonical->pre_expanded = 1; |
2373 | ||
2374 | return sals; | |
2375 | } | |
50641945 | 2376 | |
a2459270 PA |
2377 | /* Build RESULT from the explicit location components SOURCE_FILENAME, |
2378 | FUNCTION_NAME, LABEL_NAME and LINE_OFFSET. */ | |
00e52e53 | 2379 | |
a2459270 PA |
2380 | static void |
2381 | convert_explicit_location_to_linespec (struct linespec_state *self, | |
2382 | linespec_p result, | |
2383 | const char *source_filename, | |
2384 | const char *function_name, | |
a20714ff | 2385 | symbol_name_match_type fname_match_type, |
a2459270 PA |
2386 | const char *label_name, |
2387 | struct line_offset line_offset) | |
00e52e53 | 2388 | { |
7e41c8db KS |
2389 | std::vector<block_symbol> symbols; |
2390 | std::vector<block_symbol> *labels; | |
c2a031c5 | 2391 | std::vector<bound_minimal_symbol> minimal_symbols; |
00e52e53 | 2392 | |
a20714ff PA |
2393 | result->explicit_loc.func_name_match_type = fname_match_type; |
2394 | ||
a2459270 | 2395 | if (source_filename != NULL) |
00e52e53 KS |
2396 | { |
2397 | TRY | |
2398 | { | |
4717cec4 SM |
2399 | *result->file_symtabs |
2400 | = symtabs_from_filename (source_filename, self->search_pspace); | |
00e52e53 KS |
2401 | } |
2402 | CATCH (except, RETURN_MASK_ERROR) | |
2403 | { | |
a2459270 | 2404 | source_file_not_found_error (source_filename); |
00e52e53 KS |
2405 | } |
2406 | END_CATCH | |
a2459270 | 2407 | result->explicit_loc.source_filename = xstrdup (source_filename); |
00e52e53 KS |
2408 | } |
2409 | else | |
2410 | { | |
2411 | /* A NULL entry means to use the default symtab. */ | |
2a908241 | 2412 | result->file_symtabs->push_back (nullptr); |
00e52e53 KS |
2413 | } |
2414 | ||
a2459270 | 2415 | if (function_name != NULL) |
00e52e53 KS |
2416 | { |
2417 | find_linespec_symbols (self, result->file_symtabs, | |
a20714ff PA |
2418 | function_name, fname_match_type, |
2419 | &symbols, &minimal_symbols); | |
00e52e53 | 2420 | |
c2a031c5 | 2421 | if (symbols.empty () && minimal_symbols.empty ()) |
a2459270 | 2422 | symbol_not_found_error (function_name, |
67994074 | 2423 | result->explicit_loc.source_filename); |
00e52e53 | 2424 | |
a2459270 | 2425 | result->explicit_loc.function_name = xstrdup (function_name); |
7243d011 | 2426 | result->function_symbols |
7e41c8db | 2427 | = new std::vector<block_symbol> (std::move (symbols)); |
c2a031c5 KS |
2428 | result->minimal_symbols |
2429 | = new std::vector<bound_minimal_symbol> (std::move (minimal_symbols)); | |
00e52e53 KS |
2430 | } |
2431 | ||
a2459270 | 2432 | if (label_name != NULL) |
00e52e53 | 2433 | { |
00e52e53 | 2434 | labels = find_label_symbols (self, result->function_symbols, |
a2459270 | 2435 | &symbols, label_name); |
00e52e53 KS |
2436 | |
2437 | if (labels == NULL) | |
67994074 | 2438 | undefined_label_error (result->explicit_loc.function_name, |
a2459270 | 2439 | label_name); |
00e52e53 | 2440 | |
a2459270 | 2441 | result->explicit_loc.label_name = xstrdup (label_name); |
00e52e53 | 2442 | result->labels.label_symbols = labels; |
7243d011 | 2443 | result->labels.function_symbols |
7e41c8db | 2444 | = new std::vector<block_symbol> (std::move (symbols)); |
00e52e53 KS |
2445 | } |
2446 | ||
a2459270 PA |
2447 | if (line_offset.sign != LINE_OFFSET_UNKNOWN) |
2448 | result->explicit_loc.line_offset = line_offset; | |
2449 | } | |
00e52e53 | 2450 | |
a2459270 PA |
2451 | /* Convert the explicit location EXPLICIT_LOC into SaLs. */ |
2452 | ||
6c5b2ebe | 2453 | static std::vector<symtab_and_line> |
a2459270 PA |
2454 | convert_explicit_location_to_sals (struct linespec_state *self, |
2455 | linespec_p result, | |
2456 | const struct explicit_location *explicit_loc) | |
2457 | { | |
2458 | convert_explicit_location_to_linespec (self, result, | |
2459 | explicit_loc->source_filename, | |
2460 | explicit_loc->function_name, | |
a20714ff | 2461 | explicit_loc->func_name_match_type, |
a2459270 PA |
2462 | explicit_loc->label_name, |
2463 | explicit_loc->line_offset); | |
2464 | return convert_linespec_to_sals (self, result); | |
00e52e53 KS |
2465 | } |
2466 | ||
40e084e1 | 2467 | /* Parse a string that specifies a linespec. |
50641945 | 2468 | |
40e084e1 | 2469 | The basic grammar of linespecs: |
50641945 | 2470 | |
a06efdd6 | 2471 | linespec -> var_spec | basic_spec |
40e084e1 | 2472 | var_spec -> '$' (STRING | NUMBER) |
50641945 | 2473 | |
40e084e1 KS |
2474 | basic_spec -> file_offset_spec | function_spec | label_spec |
2475 | file_offset_spec -> opt_file_spec offset_spec | |
2476 | function_spec -> opt_file_spec function_name_spec opt_label_spec | |
2477 | label_spec -> label_name_spec | |
50641945 | 2478 | |
40e084e1 KS |
2479 | opt_file_spec -> "" | file_name_spec ':' |
2480 | opt_label_spec -> "" | ':' label_name_spec | |
2481 | ||
2482 | file_name_spec -> STRING | |
2483 | function_name_spec -> STRING | |
2484 | label_name_spec -> STRING | |
2485 | function_name_spec -> STRING | |
2486 | offset_spec -> NUMBER | |
2487 | -> '+' NUMBER | |
2488 | -> '-' NUMBER | |
2489 | ||
2490 | This may all be followed by several keywords such as "if EXPR", | |
2491 | which we ignore. | |
2492 | ||
2493 | A comma will terminate parsing. | |
2494 | ||
2495 | The function may be an undebuggable function found in minimal symbol table. | |
50641945 FN |
2496 | |
2497 | If the argument FUNFIRSTLINE is nonzero, we want the first line | |
2498 | of real code inside a function when a function is specified, and it is | |
2499 | not OK to specify a variable or type to get its line number. | |
2500 | ||
2501 | DEFAULT_SYMTAB specifies the file to use if none is specified. | |
2502 | It defaults to current_source_symtab. | |
2503 | DEFAULT_LINE specifies the line number to use for relative | |
2504 | line numbers (that start with signs). Defaults to current_source_line. | |
2505 | If CANONICAL is non-NULL, store an array of strings containing the canonical | |
1777feb0 | 2506 | line specs there if necessary. Currently overloaded member functions and |
50641945 | 2507 | line numbers or static functions without a filename yield a canonical |
1777feb0 | 2508 | line spec. The array and the line spec strings are allocated on the heap, |
50641945 FN |
2509 | it is the callers responsibility to free them. |
2510 | ||
2511 | Note that it is possible to return zero for the symtab | |
2512 | if no file is validly specified. Callers must check that. | |
58438ac1 | 2513 | Also, the line number returned may be invalid. */ |
50641945 | 2514 | |
a20714ff PA |
2515 | /* Parse the linespec in ARG. MATCH_TYPE indicates how function names |
2516 | should be matched. */ | |
50641945 | 2517 | |
6c5b2ebe | 2518 | static std::vector<symtab_and_line> |
a20714ff PA |
2519 | parse_linespec (linespec_parser *parser, const char *arg, |
2520 | symbol_name_match_type match_type) | |
50641945 | 2521 | { |
40e084e1 | 2522 | linespec_token token; |
7556d4a4 | 2523 | struct gdb_exception file_exception = exception_none; |
40e084e1 KS |
2524 | |
2525 | /* A special case to start. It has become quite popular for | |
2526 | IDEs to work around bugs in the previous parser by quoting | |
2527 | the entire linespec, so we attempt to deal with this nicely. */ | |
2528 | parser->is_quote_enclosed = 0; | |
c45ec17c PA |
2529 | if (parser->completion_tracker == NULL |
2530 | && !is_ada_operator (arg) | |
f00aae0f | 2531 | && strchr (linespec_quote_characters, *arg) != NULL) |
40e084e1 KS |
2532 | { |
2533 | const char *end; | |
9ef07c8c | 2534 | |
f00aae0f | 2535 | end = skip_quote_char (arg + 1, *arg); |
40e084e1 | 2536 | if (end != NULL && is_closing_quote_enclosed (end)) |
136e1c30 | 2537 | { |
f00aae0f | 2538 | /* Here's the special case. Skip ARG past the initial |
40e084e1 | 2539 | quote. */ |
f00aae0f | 2540 | ++arg; |
40e084e1 | 2541 | parser->is_quote_enclosed = 1; |
136e1c30 DE |
2542 | } |
2543 | } | |
e8eb7bc5 | 2544 | |
f00aae0f KS |
2545 | parser->lexer.saved_arg = arg; |
2546 | parser->lexer.stream = arg; | |
c45ec17c PA |
2547 | parser->completion_word = arg; |
2548 | parser->complete_what = linespec_complete_what::FUNCTION; | |
a20714ff | 2549 | PARSER_EXPLICIT (parser)->func_name_match_type = match_type; |
d2630e69 | 2550 | |
40e084e1 KS |
2551 | /* Initialize the default symtab and line offset. */ |
2552 | initialize_defaults (&PARSER_STATE (parser)->default_symtab, | |
2553 | &PARSER_STATE (parser)->default_line); | |
d2630e69 | 2554 | |
40e084e1 | 2555 | /* Objective-C shortcut. */ |
c45ec17c PA |
2556 | if (parser->completion_tracker == NULL) |
2557 | { | |
6c5b2ebe PA |
2558 | std::vector<symtab_and_line> values |
2559 | = decode_objc (PARSER_STATE (parser), PARSER_RESULT (parser), arg); | |
2560 | if (!values.empty ()) | |
c45ec17c PA |
2561 | return values; |
2562 | } | |
2563 | else | |
2564 | { | |
2565 | /* "-"/"+" is either an objc selector, or a number. There's | |
2566 | nothing to complete the latter to, so just let the caller | |
2567 | complete on functions, which finds objc selectors, if there's | |
2568 | any. */ | |
2569 | if ((arg[0] == '-' || arg[0] == '+') && arg[1] == '\0') | |
2570 | return {}; | |
2571 | } | |
e0881a8e | 2572 | |
40e084e1 | 2573 | /* Start parsing. */ |
d2630e69 | 2574 | |
40e084e1 | 2575 | /* Get the first token. */ |
c45ec17c | 2576 | token = linespec_lexer_consume_token (parser); |
50641945 | 2577 | |
40e084e1 | 2578 | /* It must be either LSTOKEN_STRING or LSTOKEN_NUMBER. */ |
a06efdd6 | 2579 | if (token.type == LSTOKEN_STRING && *LS_TOKEN_STOKEN (token).ptr == '$') |
40e084e1 | 2580 | { |
40e084e1 | 2581 | /* A NULL entry means to use GLOBAL_DEFAULT_SYMTAB. */ |
c45ec17c | 2582 | if (parser->completion_tracker == NULL) |
2a908241 | 2583 | PARSER_RESULT (parser)->file_symtabs->push_back (nullptr); |
dcf9f4ab | 2584 | |
40e084e1 | 2585 | /* User specified a convenience variable or history value. */ |
a5b5adf5 | 2586 | gdb::unique_xmalloc_ptr<char> var = copy_token_string (token); |
00e52e53 | 2587 | PARSER_EXPLICIT (parser)->line_offset |
a5b5adf5 | 2588 | = linespec_parse_variable (PARSER_STATE (parser), var.get ()); |
f8eba3c6 | 2589 | |
40e084e1 KS |
2590 | /* If a line_offset wasn't found (VAR is the name of a user |
2591 | variable/function), then skip to normal symbol processing. */ | |
00e52e53 | 2592 | if (PARSER_EXPLICIT (parser)->line_offset.sign != LINE_OFFSET_UNKNOWN) |
40e084e1 | 2593 | { |
40e084e1 KS |
2594 | /* Consume this token. */ |
2595 | linespec_lexer_consume_token (parser); | |
dcf9f4ab | 2596 | |
40e084e1 | 2597 | goto convert_to_sals; |
50641945 | 2598 | } |
40e084e1 | 2599 | } |
c45ec17c PA |
2600 | else if (token.type == LSTOKEN_EOI && parser->completion_tracker != NULL) |
2601 | { | |
2602 | /* Let the default linespec_complete_what::FUNCTION kick in. */ | |
2603 | unexpected_linespec_error (parser); | |
2604 | } | |
40e084e1 | 2605 | else if (token.type != LSTOKEN_STRING && token.type != LSTOKEN_NUMBER) |
c45ec17c PA |
2606 | { |
2607 | parser->complete_what = linespec_complete_what::NOTHING; | |
2608 | unexpected_linespec_error (parser); | |
2609 | } | |
50641945 | 2610 | |
40e084e1 KS |
2611 | /* Shortcut: If the next token is not LSTOKEN_COLON, we know that |
2612 | this token cannot represent a filename. */ | |
2613 | token = linespec_lexer_peek_token (parser); | |
0e0b460e | 2614 | |
40e084e1 | 2615 | if (token.type == LSTOKEN_COLON) |
0e0b460e | 2616 | { |
40e084e1 KS |
2617 | /* Get the current token again and extract the filename. */ |
2618 | token = linespec_lexer_lex_one (parser); | |
a5b5adf5 | 2619 | gdb::unique_xmalloc_ptr<char> user_filename = copy_token_string (token); |
50641945 | 2620 | |
40e084e1 | 2621 | /* Check if the input is a filename. */ |
492d29ea | 2622 | TRY |
40e084e1 | 2623 | { |
4717cec4 | 2624 | *PARSER_RESULT (parser)->file_symtabs |
a5b5adf5 | 2625 | = symtabs_from_filename (user_filename.get (), |
c2f4122d | 2626 | PARSER_STATE (parser)->search_pspace); |
40e084e1 | 2627 | } |
492d29ea | 2628 | CATCH (ex, RETURN_MASK_ERROR) |
7556d4a4 PA |
2629 | { |
2630 | file_exception = ex; | |
2631 | } | |
492d29ea | 2632 | END_CATCH |
50641945 | 2633 | |
40e084e1 KS |
2634 | if (file_exception.reason >= 0) |
2635 | { | |
2636 | /* Symtabs were found for the file. Record the filename. */ | |
a5b5adf5 | 2637 | PARSER_EXPLICIT (parser)->source_filename = user_filename.release (); |
f8eba3c6 | 2638 | |
40e084e1 KS |
2639 | /* Get the next token. */ |
2640 | token = linespec_lexer_consume_token (parser); | |
50641945 | 2641 | |
40e084e1 KS |
2642 | /* This is LSTOKEN_COLON; consume it. */ |
2643 | linespec_lexer_consume_token (parser); | |
2644 | } | |
2645 | else | |
2646 | { | |
40e084e1 | 2647 | /* A NULL entry means to use GLOBAL_DEFAULT_SYMTAB. */ |
2a908241 | 2648 | PARSER_RESULT (parser)->file_symtabs->push_back (nullptr); |
40e084e1 | 2649 | } |
50641945 | 2650 | } |
40e084e1 | 2651 | /* If the next token is not EOI, KEYWORD, or COMMA, issue an error. */ |
c45ec17c PA |
2652 | else if (parser->completion_tracker == NULL |
2653 | && (token.type != LSTOKEN_EOI && token.type != LSTOKEN_KEYWORD | |
2654 | && token.type != LSTOKEN_COMMA)) | |
d2630e69 | 2655 | { |
40e084e1 KS |
2656 | /* TOKEN is the _next_ token, not the one currently in the parser. |
2657 | Consuming the token will give the correct error message. */ | |
2658 | linespec_lexer_consume_token (parser); | |
2659 | unexpected_linespec_error (parser); | |
d2630e69 | 2660 | } |
50641945 FN |
2661 | else |
2662 | { | |
40e084e1 | 2663 | /* A NULL entry means to use GLOBAL_DEFAULT_SYMTAB. */ |
2a908241 | 2664 | PARSER_RESULT (parser)->file_symtabs->push_back (nullptr); |
50641945 | 2665 | } |
50641945 | 2666 | |
40e084e1 KS |
2667 | /* Parse the rest of the linespec. */ |
2668 | linespec_parse_basic (parser); | |
50641945 | 2669 | |
c45ec17c PA |
2670 | if (parser->completion_tracker == NULL |
2671 | && PARSER_RESULT (parser)->function_symbols == NULL | |
40e084e1 | 2672 | && PARSER_RESULT (parser)->labels.label_symbols == NULL |
00e52e53 | 2673 | && PARSER_EXPLICIT (parser)->line_offset.sign == LINE_OFFSET_UNKNOWN |
40e084e1 | 2674 | && PARSER_RESULT (parser)->minimal_symbols == NULL) |
f8eba3c6 | 2675 | { |
40e084e1 KS |
2676 | /* The linespec didn't parse. Re-throw the file exception if |
2677 | there was one. */ | |
2678 | if (file_exception.reason < 0) | |
2679 | throw_exception (file_exception); | |
0f5238ed | 2680 | |
40e084e1 | 2681 | /* Otherwise, the symbol is not found. */ |
00e52e53 KS |
2682 | symbol_not_found_error (PARSER_EXPLICIT (parser)->function_name, |
2683 | PARSER_EXPLICIT (parser)->source_filename); | |
0f5238ed TT |
2684 | } |
2685 | ||
40e084e1 | 2686 | convert_to_sals: |
9ef07c8c | 2687 | |
40e084e1 KS |
2688 | /* Get the last token and record how much of the input was parsed, |
2689 | if necessary. */ | |
2690 | token = linespec_lexer_lex_one (parser); | |
2691 | if (token.type != LSTOKEN_EOI && token.type != LSTOKEN_KEYWORD) | |
c45ec17c PA |
2692 | unexpected_linespec_error (parser); |
2693 | else if (token.type == LSTOKEN_KEYWORD) | |
2694 | { | |
2695 | /* Setup the completion word past the keyword. Lexing never | |
2696 | advances past a keyword automatically, so skip it | |
2697 | manually. */ | |
2698 | parser->completion_word | |
f1735a53 | 2699 | = skip_spaces (skip_to_space (PARSER_STREAM (parser))); |
c45ec17c PA |
2700 | parser->complete_what = linespec_complete_what::EXPRESSION; |
2701 | } | |
50641945 | 2702 | |
40e084e1 | 2703 | /* Convert the data in PARSER_RESULT to SALs. */ |
c45ec17c | 2704 | if (parser->completion_tracker == NULL) |
6c5b2ebe PA |
2705 | return convert_linespec_to_sals (PARSER_STATE (parser), |
2706 | PARSER_RESULT (parser)); | |
f8eba3c6 | 2707 | |
6c5b2ebe | 2708 | return {}; |
413dad4d | 2709 | } |
50641945 | 2710 | |
40e084e1 | 2711 | |
f8eba3c6 | 2712 | /* A constructor for linespec_state. */ |
44fe14ab | 2713 | |
f8eba3c6 TT |
2714 | static void |
2715 | linespec_state_constructor (struct linespec_state *self, | |
40e084e1 | 2716 | int flags, const struct language_defn *language, |
c2f4122d | 2717 | struct program_space *search_pspace, |
f8eba3c6 TT |
2718 | struct symtab *default_symtab, |
2719 | int default_line, | |
2720 | struct linespec_result *canonical) | |
2721 | { | |
2722 | memset (self, 0, sizeof (*self)); | |
40e084e1 | 2723 | self->language = language; |
f8eba3c6 TT |
2724 | self->funfirstline = (flags & DECODE_LINE_FUNFIRSTLINE) ? 1 : 0; |
2725 | self->list_mode = (flags & DECODE_LINE_LIST_MODE) ? 1 : 0; | |
c2f4122d | 2726 | self->search_pspace = search_pspace; |
f8eba3c6 TT |
2727 | self->default_symtab = default_symtab; |
2728 | self->default_line = default_line; | |
2729 | self->canonical = canonical; | |
2730 | self->program_space = current_program_space; | |
2731 | self->addr_set = htab_create_alloc (10, hash_address_entry, eq_address_entry, | |
2732 | xfree, xcalloc, xfree); | |
00e52e53 | 2733 | self->is_linespec = 0; |
f8eba3c6 | 2734 | } |
44fe14ab | 2735 | |
40e084e1 | 2736 | /* Initialize a new linespec parser. */ |
44fe14ab DC |
2737 | |
2738 | static void | |
40e084e1 KS |
2739 | linespec_parser_new (linespec_parser *parser, |
2740 | int flags, const struct language_defn *language, | |
c2f4122d | 2741 | struct program_space *search_pspace, |
40e084e1 KS |
2742 | struct symtab *default_symtab, |
2743 | int default_line, | |
2744 | struct linespec_result *canonical) | |
44fe14ab | 2745 | { |
f00aae0f | 2746 | memset (parser, 0, sizeof (linespec_parser)); |
40e084e1 KS |
2747 | parser->lexer.current.type = LSTOKEN_CONSUMED; |
2748 | memset (PARSER_RESULT (parser), 0, sizeof (struct linespec)); | |
2a908241 | 2749 | PARSER_RESULT (parser)->file_symtabs = new std::vector<symtab *> (); |
a20714ff PA |
2750 | PARSER_EXPLICIT (parser)->func_name_match_type |
2751 | = symbol_name_match_type::WILD; | |
00e52e53 | 2752 | PARSER_EXPLICIT (parser)->line_offset.sign = LINE_OFFSET_UNKNOWN; |
40e084e1 | 2753 | linespec_state_constructor (PARSER_STATE (parser), flags, language, |
c2f4122d | 2754 | search_pspace, |
40e084e1 KS |
2755 | default_symtab, default_line, canonical); |
2756 | } | |
2757 | ||
2758 | /* A destructor for linespec_state. */ | |
44fe14ab | 2759 | |
40e084e1 KS |
2760 | static void |
2761 | linespec_state_destructor (struct linespec_state *self) | |
2762 | { | |
f8eba3c6 TT |
2763 | htab_delete (self->addr_set); |
2764 | } | |
44fe14ab | 2765 | |
40e084e1 KS |
2766 | /* Delete a linespec parser. */ |
2767 | ||
2768 | static void | |
2769 | linespec_parser_delete (void *arg) | |
2770 | { | |
2771 | linespec_parser *parser = (linespec_parser *) arg; | |
2772 | ||
00e52e53 KS |
2773 | xfree (PARSER_EXPLICIT (parser)->source_filename); |
2774 | xfree (PARSER_EXPLICIT (parser)->label_name); | |
2775 | xfree (PARSER_EXPLICIT (parser)->function_name); | |
40e084e1 | 2776 | |
2a908241 | 2777 | delete PARSER_RESULT (parser)->file_symtabs; |
7243d011 | 2778 | delete PARSER_RESULT (parser)->function_symbols; |
c2a031c5 | 2779 | delete PARSER_RESULT (parser)->minimal_symbols; |
3553eadc | 2780 | delete PARSER_RESULT (parser)->labels.label_symbols; |
7243d011 | 2781 | delete PARSER_RESULT (parser)->labels.function_symbols; |
40e084e1 KS |
2782 | |
2783 | linespec_state_destructor (PARSER_STATE (parser)); | |
2784 | } | |
2785 | ||
c7c1b3e9 KS |
2786 | /* See description in linespec.h. */ |
2787 | ||
2788 | void | |
f2fc3015 | 2789 | linespec_lex_to_end (const char **stringp) |
c7c1b3e9 KS |
2790 | { |
2791 | linespec_parser parser; | |
2792 | struct cleanup *cleanup; | |
2793 | linespec_token token; | |
c7c1b3e9 KS |
2794 | const char *orig; |
2795 | ||
2796 | if (stringp == NULL || *stringp == NULL) | |
2797 | return; | |
2798 | ||
c2f4122d | 2799 | linespec_parser_new (&parser, 0, current_language, NULL, NULL, 0, NULL); |
c7c1b3e9 KS |
2800 | cleanup = make_cleanup (linespec_parser_delete, &parser); |
2801 | parser.lexer.saved_arg = *stringp; | |
2802 | PARSER_STREAM (&parser) = orig = *stringp; | |
2803 | ||
2804 | do | |
2805 | { | |
2806 | /* Stop before any comma tokens; we need it to keep it | |
2807 | as the next token in the string. */ | |
2808 | token = linespec_lexer_peek_token (&parser); | |
2809 | if (token.type == LSTOKEN_COMMA) | |
2810 | break; | |
c7c1b3e9 KS |
2811 | token = linespec_lexer_consume_token (&parser); |
2812 | } | |
2813 | while (token.type != LSTOKEN_EOI && token.type != LSTOKEN_KEYWORD); | |
2814 | ||
2815 | *stringp += PARSER_STREAM (&parser) - orig; | |
2816 | do_cleanups (cleanup); | |
2817 | } | |
2818 | ||
c6756f62 PA |
2819 | /* See linespec.h. */ |
2820 | ||
2821 | void | |
2822 | linespec_complete_function (completion_tracker &tracker, | |
2823 | const char *function, | |
a20714ff | 2824 | symbol_name_match_type func_match_type, |
c6756f62 PA |
2825 | const char *source_filename) |
2826 | { | |
2827 | complete_symbol_mode mode = complete_symbol_mode::LINESPEC; | |
2828 | ||
2829 | if (source_filename != NULL) | |
2830 | { | |
b5ec771e PA |
2831 | collect_file_symbol_completion_matches (tracker, mode, func_match_type, |
2832 | function, function, source_filename); | |
c6756f62 PA |
2833 | } |
2834 | else | |
b5ec771e PA |
2835 | { |
2836 | collect_symbol_completion_matches (tracker, mode, func_match_type, | |
2837 | function, function); | |
2838 | ||
2839 | } | |
c6756f62 PA |
2840 | } |
2841 | ||
c45ec17c PA |
2842 | /* Helper for complete_linespec to simplify it. SOURCE_FILENAME is |
2843 | only meaningful if COMPONENT is FUNCTION. */ | |
2844 | ||
2845 | static void | |
2846 | complete_linespec_component (linespec_parser *parser, | |
2847 | completion_tracker &tracker, | |
2848 | const char *text, | |
2849 | linespec_complete_what component, | |
2850 | const char *source_filename) | |
2851 | { | |
2852 | if (component == linespec_complete_what::KEYWORD) | |
2853 | { | |
2854 | complete_on_enum (tracker, linespec_keywords, text, text); | |
2855 | } | |
2856 | else if (component == linespec_complete_what::EXPRESSION) | |
2857 | { | |
2858 | const char *word | |
2859 | = advance_to_expression_complete_word_point (tracker, text); | |
2860 | complete_expression (tracker, text, word); | |
2861 | } | |
2862 | else if (component == linespec_complete_what::FUNCTION) | |
2863 | { | |
2864 | completion_list fn_list; | |
2865 | ||
a20714ff PA |
2866 | symbol_name_match_type match_type |
2867 | = PARSER_EXPLICIT (parser)->func_name_match_type; | |
2868 | linespec_complete_function (tracker, text, match_type, source_filename); | |
c45ec17c PA |
2869 | if (source_filename == NULL) |
2870 | { | |
2871 | /* Haven't seen a source component, like in "b | |
2872 | file.c:function[TAB]". Maybe this wasn't a function, but | |
2873 | a filename instead, like "b file.[TAB]". */ | |
2874 | fn_list = complete_source_filenames (text); | |
2875 | } | |
2876 | ||
2877 | /* If we only have a single filename completion, append a ':' for | |
2878 | the user, since that's the only thing that can usefully follow | |
2879 | the filename. */ | |
2880 | if (fn_list.size () == 1 && !tracker.have_completions ()) | |
2881 | { | |
2882 | char *fn = fn_list[0].release (); | |
2883 | ||
2884 | /* If we also need to append a quote char, it needs to be | |
2885 | appended before the ':'. Append it now, and make ':' the | |
2886 | new "quote" char. */ | |
2887 | if (tracker.quote_char ()) | |
2888 | { | |
896a7aa6 | 2889 | char quote_char_str[2] = { (char) tracker.quote_char () }; |
c45ec17c PA |
2890 | |
2891 | fn = reconcat (fn, fn, quote_char_str, (char *) NULL); | |
2892 | tracker.set_quote_char (':'); | |
2893 | } | |
2894 | else | |
2895 | fn = reconcat (fn, fn, ":", (char *) NULL); | |
2896 | fn_list[0].reset (fn); | |
2897 | ||
2898 | /* Tell readline to skip appending a space. */ | |
2899 | tracker.set_suppress_append_ws (true); | |
2900 | } | |
2901 | tracker.add_completions (std::move (fn_list)); | |
2902 | } | |
2903 | } | |
2904 | ||
a2459270 PA |
2905 | /* Helper for linespec_complete_label. Find labels that match |
2906 | LABEL_NAME in the function symbols listed in the PARSER, and add | |
2907 | them to the tracker. */ | |
2908 | ||
2909 | static void | |
2910 | complete_label (completion_tracker &tracker, | |
2911 | linespec_parser *parser, | |
2912 | const char *label_name) | |
2913 | { | |
7e41c8db KS |
2914 | std::vector<block_symbol> label_function_symbols; |
2915 | std::vector<block_symbol> *labels | |
a2459270 PA |
2916 | = find_label_symbols (PARSER_STATE (parser), |
2917 | PARSER_RESULT (parser)->function_symbols, | |
2918 | &label_function_symbols, | |
2919 | label_name, true); | |
2920 | ||
3553eadc | 2921 | if (labels != nullptr) |
a2459270 | 2922 | { |
3553eadc KS |
2923 | for (const auto &label : *labels) |
2924 | { | |
7e41c8db | 2925 | char *match = xstrdup (SYMBOL_SEARCH_NAME (label.symbol)); |
3553eadc KS |
2926 | tracker.add_completion (gdb::unique_xmalloc_ptr<char> (match)); |
2927 | } | |
2928 | delete labels; | |
a2459270 | 2929 | } |
a2459270 PA |
2930 | } |
2931 | ||
2932 | /* See linespec.h. */ | |
2933 | ||
2934 | void | |
2935 | linespec_complete_label (completion_tracker &tracker, | |
2936 | const struct language_defn *language, | |
2937 | const char *source_filename, | |
2938 | const char *function_name, | |
a20714ff | 2939 | symbol_name_match_type func_name_match_type, |
a2459270 PA |
2940 | const char *label_name) |
2941 | { | |
2942 | linespec_parser parser; | |
2943 | struct cleanup *cleanup; | |
2944 | ||
2945 | linespec_parser_new (&parser, 0, language, NULL, NULL, 0, NULL); | |
2946 | cleanup = make_cleanup (linespec_parser_delete, &parser); | |
2947 | ||
2948 | line_offset unknown_offset = { 0, LINE_OFFSET_UNKNOWN }; | |
2949 | ||
2950 | TRY | |
2951 | { | |
2952 | convert_explicit_location_to_linespec (PARSER_STATE (&parser), | |
2953 | PARSER_RESULT (&parser), | |
2954 | source_filename, | |
2955 | function_name, | |
a20714ff | 2956 | func_name_match_type, |
a2459270 PA |
2957 | NULL, unknown_offset); |
2958 | } | |
2959 | CATCH (ex, RETURN_MASK_ERROR) | |
2960 | { | |
2961 | do_cleanups (cleanup); | |
2962 | return; | |
2963 | } | |
2964 | END_CATCH | |
2965 | ||
2966 | complete_label (tracker, &parser, label_name); | |
2967 | ||
2968 | do_cleanups (cleanup); | |
2969 | } | |
2970 | ||
c45ec17c PA |
2971 | /* See description in linespec.h. */ |
2972 | ||
2973 | void | |
a20714ff PA |
2974 | linespec_complete (completion_tracker &tracker, const char *text, |
2975 | symbol_name_match_type match_type) | |
c45ec17c PA |
2976 | { |
2977 | linespec_parser parser; | |
2978 | struct cleanup *cleanup; | |
2979 | const char *orig = text; | |
2980 | ||
2981 | linespec_parser_new (&parser, 0, current_language, NULL, NULL, 0, NULL); | |
2982 | cleanup = make_cleanup (linespec_parser_delete, &parser); | |
2983 | parser.lexer.saved_arg = text; | |
a20714ff | 2984 | PARSER_EXPLICIT (&parser)->func_name_match_type = match_type; |
c45ec17c PA |
2985 | PARSER_STREAM (&parser) = text; |
2986 | ||
2987 | parser.completion_tracker = &tracker; | |
2988 | PARSER_STATE (&parser)->is_linespec = 1; | |
2989 | ||
2990 | /* Parse as much as possible. parser.completion_word will hold | |
2991 | furthest completion point we managed to parse to. */ | |
2992 | TRY | |
2993 | { | |
a20714ff | 2994 | parse_linespec (&parser, text, match_type); |
c45ec17c PA |
2995 | } |
2996 | CATCH (except, RETURN_MASK_ERROR) | |
2997 | { | |
2998 | } | |
2999 | END_CATCH | |
3000 | ||
3001 | if (parser.completion_quote_char != '\0' | |
3002 | && parser.completion_quote_end != NULL | |
3003 | && parser.completion_quote_end[1] == '\0') | |
3004 | { | |
3005 | /* If completing a quoted string with the cursor right at | |
3006 | terminating quote char, complete the completion word without | |
3007 | interpretation, so that readline advances the cursor one | |
3008 | whitespace past the quote, even if there's no match. This | |
3009 | makes these cases behave the same: | |
3010 | ||
3011 | before: "b function()" | |
3012 | after: "b function() " | |
3013 | ||
3014 | before: "b 'function()'" | |
3015 | after: "b 'function()' " | |
3016 | ||
3017 | and trusts the user in this case: | |
3018 | ||
3019 | before: "b 'not_loaded_function_yet()'" | |
3020 | after: "b 'not_loaded_function_yet()' " | |
3021 | */ | |
3022 | parser.complete_what = linespec_complete_what::NOTHING; | |
3023 | parser.completion_quote_char = '\0'; | |
3024 | ||
3025 | gdb::unique_xmalloc_ptr<char> text_copy | |
3026 | (xstrdup (parser.completion_word)); | |
3027 | tracker.add_completion (std::move (text_copy)); | |
3028 | } | |
3029 | ||
3030 | tracker.set_quote_char (parser.completion_quote_char); | |
3031 | ||
3032 | if (parser.complete_what == linespec_complete_what::LABEL) | |
3033 | { | |
3034 | parser.complete_what = linespec_complete_what::NOTHING; | |
3035 | ||
3036 | const char *func_name = PARSER_EXPLICIT (&parser)->function_name; | |
3037 | ||
7e41c8db | 3038 | std::vector<block_symbol> function_symbols; |
c2a031c5 | 3039 | std::vector<bound_minimal_symbol> minimal_symbols; |
c45ec17c PA |
3040 | find_linespec_symbols (PARSER_STATE (&parser), |
3041 | PARSER_RESULT (&parser)->file_symtabs, | |
a20714ff | 3042 | func_name, match_type, |
c45ec17c PA |
3043 | &function_symbols, &minimal_symbols); |
3044 | ||
7243d011 | 3045 | PARSER_RESULT (&parser)->function_symbols |
7e41c8db | 3046 | = new std::vector<block_symbol> (std::move (function_symbols)); |
c2a031c5 KS |
3047 | PARSER_RESULT (&parser)->minimal_symbols |
3048 | = new std::vector<bound_minimal_symbol> (std::move (minimal_symbols)); | |
c45ec17c PA |
3049 | |
3050 | complete_label (tracker, &parser, parser.completion_word); | |
3051 | } | |
3052 | else if (parser.complete_what == linespec_complete_what::FUNCTION) | |
3053 | { | |
3054 | /* While parsing/lexing, we didn't know whether the completion | |
3055 | word completes to a unique function/source name already or | |
3056 | not. | |
3057 | ||
3058 | E.g.: | |
3059 | "b function() <tab>" | |
3060 | may need to complete either to: | |
3061 | "b function() const" | |
3062 | or to: | |
3063 | "b function() if/thread/task" | |
3064 | ||
3065 | Or, this: | |
3066 | "b foo t" | |
3067 | may need to complete either to: | |
3068 | "b foo template_fun<T>()" | |
3069 | with "foo" being the template function's return type, or to: | |
3070 | "b foo thread/task" | |
3071 | ||
3072 | Or, this: | |
3073 | "b file<TAB>" | |
3074 | may need to complete either to a source file name: | |
3075 | "b file.c" | |
3076 | or this, also a filename, but a unique completion: | |
3077 | "b file.c:" | |
3078 | or to a function name: | |
3079 | "b file_function" | |
3080 | ||
3081 | Address that by completing assuming source or function, and | |
3082 | seeing if we find a completion that matches exactly the | |
3083 | completion word. If so, then it must be a function (see note | |
3084 | below) and we advance the completion word to the end of input | |
3085 | and switch to KEYWORD completion mode. | |
3086 | ||
3087 | Note: if we find a unique completion for a source filename, | |
3088 | then it won't match the completion word, because the LCD will | |
3089 | contain a trailing ':'. And if we're completing at or after | |
3090 | the ':', then complete_linespec_component won't try to | |
3091 | complete on source filenames. */ | |
3092 | ||
c45ec17c PA |
3093 | const char *word = parser.completion_word; |
3094 | ||
3095 | complete_linespec_component (&parser, tracker, | |
3096 | parser.completion_word, | |
3097 | linespec_complete_what::FUNCTION, | |
3098 | PARSER_EXPLICIT (&parser)->source_filename); | |
3099 | ||
3100 | parser.complete_what = linespec_complete_what::NOTHING; | |
3101 | ||
3102 | if (tracker.quote_char ()) | |
3103 | { | |
3104 | /* The function/file name was not close-quoted, so this | |
3105 | can't be a keyword. Note: complete_linespec_component | |
3106 | may have swapped the original quote char for ':' when we | |
3107 | get here, but that still indicates the same. */ | |
3108 | } | |
3109 | else if (!tracker.have_completions ()) | |
3110 | { | |
3111 | size_t key_start; | |
3112 | size_t wordlen = strlen (parser.completion_word); | |
3113 | ||
3114 | key_start | |
3115 | = string_find_incomplete_keyword_at_end (linespec_keywords, | |
3116 | parser.completion_word, | |
3117 | wordlen); | |
3118 | ||
3119 | if (key_start != -1 | |
3120 | || (wordlen > 0 | |
3121 | && parser.completion_word[wordlen - 1] == ' ')) | |
3122 | { | |
3123 | parser.completion_word += key_start; | |
3124 | parser.complete_what = linespec_complete_what::KEYWORD; | |
3125 | } | |
3126 | } | |
3127 | else if (tracker.completes_to_completion_word (word)) | |
3128 | { | |
3129 | /* Skip the function and complete on keywords. */ | |
3130 | parser.completion_word += strlen (word); | |
3131 | parser.complete_what = linespec_complete_what::KEYWORD; | |
3132 | tracker.discard_completions (); | |
3133 | } | |
3134 | } | |
3135 | ||
3136 | tracker.advance_custom_word_point_by (parser.completion_word - orig); | |
3137 | ||
3138 | complete_linespec_component (&parser, tracker, | |
3139 | parser.completion_word, | |
3140 | parser.complete_what, | |
3141 | PARSER_EXPLICIT (&parser)->source_filename); | |
3142 | ||
3143 | /* If we're past the "filename:function:label:offset" linespec, and | |
3144 | didn't find any match, then assume the user might want to create | |
3145 | a pending breakpoint anyway and offer the keyword | |
3146 | completions. */ | |
3147 | if (!parser.completion_quote_char | |
3148 | && (parser.complete_what == linespec_complete_what::FUNCTION | |
3149 | || parser.complete_what == linespec_complete_what::LABEL | |
3150 | || parser.complete_what == linespec_complete_what::NOTHING) | |
3151 | && !tracker.have_completions ()) | |
3152 | { | |
3153 | const char *end | |
3154 | = parser.completion_word + strlen (parser.completion_word); | |
3155 | ||
3156 | if (end > orig && end[-1] == ' ') | |
3157 | { | |
3158 | tracker.advance_custom_word_point_by (end - parser.completion_word); | |
3159 | ||
3160 | complete_linespec_component (&parser, tracker, end, | |
3161 | linespec_complete_what::KEYWORD, | |
3162 | NULL); | |
3163 | } | |
3164 | } | |
3165 | ||
3166 | do_cleanups (cleanup); | |
3167 | } | |
3168 | ||
f00aae0f | 3169 | /* A helper function for decode_line_full and decode_line_1 to |
6c5b2ebe | 3170 | turn LOCATION into std::vector<symtab_and_line>. */ |
f00aae0f | 3171 | |
6c5b2ebe | 3172 | static std::vector<symtab_and_line> |
f00aae0f KS |
3173 | event_location_to_sals (linespec_parser *parser, |
3174 | const struct event_location *location) | |
3175 | { | |
6c5b2ebe | 3176 | std::vector<symtab_and_line> result; |
f00aae0f KS |
3177 | |
3178 | switch (event_location_type (location)) | |
3179 | { | |
3180 | case LINESPEC_LOCATION: | |
3181 | { | |
00e52e53 | 3182 | PARSER_STATE (parser)->is_linespec = 1; |
f00aae0f KS |
3183 | TRY |
3184 | { | |
a20714ff PA |
3185 | const linespec_location *ls = get_linespec_location (location); |
3186 | result = parse_linespec (parser, | |
3187 | ls->spec_string, ls->match_type); | |
f00aae0f KS |
3188 | } |
3189 | CATCH (except, RETURN_MASK_ERROR) | |
3190 | { | |
3191 | throw_exception (except); | |
3192 | } | |
3193 | END_CATCH | |
3194 | } | |
3195 | break; | |
3196 | ||
a06efdd6 | 3197 | case ADDRESS_LOCATION: |
305e13e6 JB |
3198 | { |
3199 | const char *addr_string = get_address_string_location (location); | |
3200 | CORE_ADDR addr = get_address_location (location); | |
3201 | ||
3202 | if (addr_string != NULL) | |
3203 | { | |
9be2c17a | 3204 | addr = linespec_expression_to_pc (&addr_string); |
305e13e6 JB |
3205 | if (PARSER_STATE (parser)->canonical != NULL) |
3206 | PARSER_STATE (parser)->canonical->location | |
8e9e35b1 | 3207 | = copy_event_location (location); |
305e13e6 JB |
3208 | } |
3209 | ||
3210 | result = convert_address_location_to_sals (PARSER_STATE (parser), | |
3211 | addr); | |
3212 | } | |
a06efdd6 KS |
3213 | break; |
3214 | ||
00e52e53 KS |
3215 | case EXPLICIT_LOCATION: |
3216 | { | |
67994074 | 3217 | const struct explicit_location *explicit_loc; |
00e52e53 | 3218 | |
67994074 | 3219 | explicit_loc = get_explicit_location_const (location); |
00e52e53 KS |
3220 | result = convert_explicit_location_to_sals (PARSER_STATE (parser), |
3221 | PARSER_RESULT (parser), | |
67994074 | 3222 | explicit_loc); |
00e52e53 KS |
3223 | } |
3224 | break; | |
3225 | ||
5b56227b KS |
3226 | case PROBE_LOCATION: |
3227 | /* Probes are handled by their own decoders. */ | |
3228 | gdb_assert_not_reached ("attempt to decode probe location"); | |
3229 | break; | |
3230 | ||
f00aae0f KS |
3231 | default: |
3232 | gdb_assert_not_reached ("unhandled event location type"); | |
3233 | } | |
3234 | ||
3235 | return result; | |
3236 | } | |
3237 | ||
f8eba3c6 | 3238 | /* See linespec.h. */ |
44fe14ab | 3239 | |
f8eba3c6 | 3240 | void |
f00aae0f | 3241 | decode_line_full (const struct event_location *location, int flags, |
c2f4122d | 3242 | struct program_space *search_pspace, |
f8eba3c6 TT |
3243 | struct symtab *default_symtab, |
3244 | int default_line, struct linespec_result *canonical, | |
3245 | const char *select_mode, | |
3246 | const char *filter) | |
44fe14ab | 3247 | { |
f8eba3c6 | 3248 | struct cleanup *cleanups; |
f73c6ece | 3249 | std::vector<const char *> filters; |
40e084e1 KS |
3250 | linespec_parser parser; |
3251 | struct linespec_state *state; | |
f8eba3c6 TT |
3252 | |
3253 | gdb_assert (canonical != NULL); | |
3254 | /* The filter only makes sense for 'all'. */ | |
3255 | gdb_assert (filter == NULL || select_mode == multiple_symbols_all); | |
3256 | gdb_assert (select_mode == NULL | |
3257 | || select_mode == multiple_symbols_all | |
3258 | || select_mode == multiple_symbols_ask | |
3259 | || select_mode == multiple_symbols_cancel); | |
3260 | gdb_assert ((flags & DECODE_LINE_LIST_MODE) == 0); | |
3261 | ||
c2f4122d PA |
3262 | linespec_parser_new (&parser, flags, current_language, |
3263 | search_pspace, default_symtab, | |
40e084e1 KS |
3264 | default_line, canonical); |
3265 | cleanups = make_cleanup (linespec_parser_delete, &parser); | |
5ed8105e PA |
3266 | |
3267 | scoped_restore_current_program_space restore_pspace; | |
f8eba3c6 | 3268 | |
6c5b2ebe PA |
3269 | std::vector<symtab_and_line> result = event_location_to_sals (&parser, |
3270 | location); | |
40e084e1 | 3271 | state = PARSER_STATE (&parser); |
f8eba3c6 | 3272 | |
6c5b2ebe | 3273 | gdb_assert (result.size () == 1 || canonical->pre_expanded); |
f8eba3c6 TT |
3274 | canonical->pre_expanded = 1; |
3275 | ||
66f1999b | 3276 | /* Arrange for allocated canonical names to be freed. */ |
6c5b2ebe | 3277 | if (!result.empty ()) |
f8eba3c6 TT |
3278 | { |
3279 | int i; | |
3280 | ||
40e084e1 | 3281 | make_cleanup (xfree, state->canonical_names); |
6c5b2ebe | 3282 | for (i = 0; i < result.size (); ++i) |
f8eba3c6 | 3283 | { |
33f448b1 JK |
3284 | gdb_assert (state->canonical_names[i].suffix != NULL); |
3285 | make_cleanup (xfree, state->canonical_names[i].suffix); | |
f8eba3c6 TT |
3286 | } |
3287 | } | |
3288 | ||
3289 | if (select_mode == NULL) | |
3290 | { | |
29f94340 | 3291 | if (top_level_interpreter ()->interp_ui_out ()->is_mi_like_p ()) |
f8eba3c6 TT |
3292 | select_mode = multiple_symbols_all; |
3293 | else | |
3294 | select_mode = multiple_symbols_select_mode (); | |
3295 | } | |
3296 | ||
3297 | if (select_mode == multiple_symbols_all) | |
3298 | { | |
3299 | if (filter != NULL) | |
3300 | { | |
f73c6ece | 3301 | filters.push_back (filter); |
40e084e1 | 3302 | filter_results (state, &result, filters); |
f8eba3c6 TT |
3303 | } |
3304 | else | |
40e084e1 | 3305 | convert_results_to_lsals (state, &result); |
f8eba3c6 TT |
3306 | } |
3307 | else | |
40e084e1 | 3308 | decode_line_2 (state, &result, select_mode); |
f8eba3c6 TT |
3309 | |
3310 | do_cleanups (cleanups); | |
3311 | } | |
3312 | ||
39cf75f7 DE |
3313 | /* See linespec.h. */ |
3314 | ||
6c5b2ebe | 3315 | std::vector<symtab_and_line> |
f00aae0f | 3316 | decode_line_1 (const struct event_location *location, int flags, |
c2f4122d | 3317 | struct program_space *search_pspace, |
f8eba3c6 TT |
3318 | struct symtab *default_symtab, |
3319 | int default_line) | |
3320 | { | |
40e084e1 | 3321 | linespec_parser parser; |
f8eba3c6 TT |
3322 | struct cleanup *cleanups; |
3323 | ||
c2f4122d PA |
3324 | linespec_parser_new (&parser, flags, current_language, |
3325 | search_pspace, default_symtab, | |
40e084e1 KS |
3326 | default_line, NULL); |
3327 | cleanups = make_cleanup (linespec_parser_delete, &parser); | |
5ed8105e PA |
3328 | |
3329 | scoped_restore_current_program_space restore_pspace; | |
f8eba3c6 | 3330 | |
6c5b2ebe PA |
3331 | std::vector<symtab_and_line> result = event_location_to_sals (&parser, |
3332 | location); | |
40e084e1 | 3333 | |
f8eba3c6 TT |
3334 | do_cleanups (cleanups); |
3335 | return result; | |
3336 | } | |
3337 | ||
39cf75f7 DE |
3338 | /* See linespec.h. */ |
3339 | ||
6c5b2ebe | 3340 | std::vector<symtab_and_line> |
f2fc3015 | 3341 | decode_line_with_current_source (const char *string, int flags) |
39cf75f7 | 3342 | { |
39cf75f7 DE |
3343 | if (string == 0) |
3344 | error (_("Empty line specification.")); | |
3345 | ||
3346 | /* We use whatever is set as the current source line. We do not try | |
3347 | and get a default source symtab+line or it will recursively call us! */ | |
6c5b2ebe | 3348 | symtab_and_line cursal = get_current_source_symtab_and_line (); |
39cf75f7 | 3349 | |
ffc2605c TT |
3350 | event_location_up location = string_to_event_location (&string, |
3351 | current_language); | |
6c5b2ebe PA |
3352 | std::vector<symtab_and_line> sals |
3353 | = decode_line_1 (location.get (), flags, NULL, cursal.symtab, cursal.line); | |
39cf75f7 DE |
3354 | |
3355 | if (*string) | |
3356 | error (_("Junk at end of line specification: %s"), string); | |
f00aae0f | 3357 | |
39cf75f7 DE |
3358 | return sals; |
3359 | } | |
3360 | ||
3361 | /* See linespec.h. */ | |
3362 | ||
6c5b2ebe | 3363 | std::vector<symtab_and_line> |
f2fc3015 | 3364 | decode_line_with_last_displayed (const char *string, int flags) |
39cf75f7 | 3365 | { |
39cf75f7 DE |
3366 | if (string == 0) |
3367 | error (_("Empty line specification.")); | |
3368 | ||
ffc2605c TT |
3369 | event_location_up location = string_to_event_location (&string, |
3370 | current_language); | |
6c5b2ebe PA |
3371 | std::vector<symtab_and_line> sals |
3372 | = (last_displayed_sal_is_valid () | |
3373 | ? decode_line_1 (location.get (), flags, NULL, | |
3374 | get_last_displayed_symtab (), | |
3375 | get_last_displayed_line ()) | |
3376 | : decode_line_1 (location.get (), flags, NULL, | |
3377 | (struct symtab *) NULL, 0)); | |
39cf75f7 DE |
3378 | |
3379 | if (*string) | |
3380 | error (_("Junk at end of line specification: %s"), string); | |
f00aae0f | 3381 | |
39cf75f7 DE |
3382 | return sals; |
3383 | } | |
3384 | ||
f8eba3c6 TT |
3385 | \f |
3386 | ||
3387 | /* First, some functions to initialize stuff at the beggining of the | |
3388 | function. */ | |
3389 | ||
3390 | static void | |
3391 | initialize_defaults (struct symtab **default_symtab, int *default_line) | |
3392 | { | |
3393 | if (*default_symtab == 0) | |
3394 | { | |
3395 | /* Use whatever we have for the default source line. We don't use | |
3396 | get_current_or_default_symtab_and_line as it can recurse and call | |
3397 | us back! */ | |
3398 | struct symtab_and_line cursal = | |
3399 | get_current_source_symtab_and_line (); | |
3400 | ||
3401 | *default_symtab = cursal.symtab; | |
3402 | *default_line = cursal.line; | |
3403 | } | |
3404 | } | |
3405 | ||
3406 | \f | |
3407 | ||
40e084e1 KS |
3408 | /* Evaluate the expression pointed to by EXP_PTR into a CORE_ADDR, |
3409 | advancing EXP_PTR past any parsed text. */ | |
f8eba3c6 | 3410 | |
a06efdd6 | 3411 | CORE_ADDR |
bbc13ae3 | 3412 | linespec_expression_to_pc (const char **exp_ptr) |
f8eba3c6 | 3413 | { |
f8eba3c6 TT |
3414 | if (current_program_space->executing_startup) |
3415 | /* The error message doesn't really matter, because this case | |
3416 | should only hit during breakpoint reset. */ | |
3417 | throw_error (NOT_FOUND_ERROR, _("cannot evaluate expressions while " | |
3418 | "program space is in startup")); | |
3419 | ||
40e084e1 KS |
3420 | (*exp_ptr)++; |
3421 | return value_as_address (parse_to_comma_and_eval (exp_ptr)); | |
0960f083 DC |
3422 | } |
3423 | ||
3424 | \f | |
3425 | ||
d2630e69 AF |
3426 | /* Here's where we recognise an Objective-C Selector. An Objective C |
3427 | selector may be implemented by more than one class, therefore it | |
3428 | may represent more than one method/function. This gives us a | |
3429 | situation somewhat analogous to C++ overloading. If there's more | |
3430 | than one method that could represent the selector, then use some of | |
3431 | the existing C++ code to let the user choose one. */ | |
3432 | ||
6c5b2ebe | 3433 | static std::vector<symtab_and_line> |
f00aae0f | 3434 | decode_objc (struct linespec_state *self, linespec_p ls, const char *arg) |
d2630e69 | 3435 | { |
f8eba3c6 | 3436 | struct collect_info info; |
9b2f8581 | 3437 | std::vector<const char *> symbol_names; |
d7561cbb | 3438 | const char *new_argptr; |
f8eba3c6 TT |
3439 | |
3440 | info.state = self; | |
2a908241 KS |
3441 | std::vector<symtab *> symtabs; |
3442 | symtabs.push_back (nullptr); | |
3443 | ||
3444 | info.file_symtabs = &symtabs; | |
7243d011 | 3445 | |
7e41c8db | 3446 | std::vector<block_symbol> symbols; |
7243d011 | 3447 | info.result.symbols = &symbols; |
c2a031c5 KS |
3448 | std::vector<bound_minimal_symbol> minimal_symbols; |
3449 | info.result.minimal_symbols = &minimal_symbols; | |
f8eba3c6 | 3450 | |
f00aae0f | 3451 | new_argptr = find_imps (arg, &symbol_names); |
9b2f8581 | 3452 | if (symbol_names.empty ()) |
2a908241 | 3453 | return {}; |
d2630e69 | 3454 | |
56d87ef7 PA |
3455 | add_all_symbol_names_from_pspace (&info, NULL, symbol_names, |
3456 | FUNCTIONS_DOMAIN); | |
d2630e69 | 3457 | |
6c5b2ebe | 3458 | std::vector<symtab_and_line> values; |
c2a031c5 | 3459 | if (!symbols.empty () || !minimal_symbols.empty ()) |
d2630e69 | 3460 | { |
f8eba3c6 | 3461 | char *saved_arg; |
d2630e69 | 3462 | |
224c3ddb | 3463 | saved_arg = (char *) alloca (new_argptr - arg + 1); |
f00aae0f KS |
3464 | memcpy (saved_arg, arg, new_argptr - arg); |
3465 | saved_arg[new_argptr - arg] = '\0'; | |
d2630e69 | 3466 | |
67994074 | 3467 | ls->explicit_loc.function_name = xstrdup (saved_arg); |
7e41c8db KS |
3468 | ls->function_symbols |
3469 | = new std::vector<block_symbol> (std::move (symbols)); | |
c2a031c5 KS |
3470 | ls->minimal_symbols |
3471 | = new std::vector<bound_minimal_symbol> (std::move (minimal_symbols)); | |
40e084e1 KS |
3472 | values = convert_linespec_to_sals (self, ls); |
3473 | ||
f8eba3c6 | 3474 | if (self->canonical) |
d2630e69 | 3475 | { |
f2fc3015 TT |
3476 | std::string holder; |
3477 | const char *str; | |
f00aae0f | 3478 | |
f8eba3c6 | 3479 | self->canonical->pre_expanded = 1; |
f00aae0f | 3480 | |
67994074 | 3481 | if (ls->explicit_loc.source_filename) |
f00aae0f | 3482 | { |
f2fc3015 TT |
3483 | holder = string_printf ("%s:%s", |
3484 | ls->explicit_loc.source_filename, | |
3485 | saved_arg); | |
3486 | str = holder.c_str (); | |
f00aae0f | 3487 | } |
f8eba3c6 | 3488 | else |
f2fc3015 | 3489 | str = saved_arg; |
f00aae0f | 3490 | |
a20714ff PA |
3491 | self->canonical->location |
3492 | = new_linespec_location (&str, symbol_name_match_type::FULL); | |
d2630e69 | 3493 | } |
d2630e69 AF |
3494 | } |
3495 | ||
40e084e1 | 3496 | return values; |
f8eba3c6 | 3497 | } |
c00f8484 | 3498 | |
ffdbe864 YQ |
3499 | namespace { |
3500 | ||
14bc53a8 PA |
3501 | /* A function object that serves as symbol_found_callback_ftype |
3502 | callback for iterate_over_symbols. This is used by | |
3503 | lookup_prefix_sym to collect type symbols. */ | |
3504 | class decode_compound_collector | |
f8eba3c6 | 3505 | { |
14bc53a8 | 3506 | public: |
fc4007c9 | 3507 | decode_compound_collector () |
fc4007c9 | 3508 | { |
14bc53a8 PA |
3509 | m_unique_syms = htab_create_alloc (1, htab_hash_pointer, |
3510 | htab_eq_pointer, NULL, | |
3511 | xcalloc, xfree); | |
fc4007c9 TT |
3512 | } |
3513 | ||
3514 | ~decode_compound_collector () | |
3515 | { | |
14bc53a8 PA |
3516 | if (m_unique_syms != NULL) |
3517 | htab_delete (m_unique_syms); | |
fc4007c9 | 3518 | } |
3a93a0c2 | 3519 | |
4dedf84d | 3520 | /* Return all symbols collected. */ |
7e41c8db | 3521 | std::vector<block_symbol> release_symbols () |
14bc53a8 | 3522 | { |
4dedf84d | 3523 | return std::move (m_symbols); |
14bc53a8 | 3524 | } |
c00f8484 | 3525 | |
14bc53a8 | 3526 | /* Callable as a symbol_found_callback_ftype callback. */ |
7e41c8db | 3527 | bool operator () (block_symbol *bsym); |
14bc53a8 PA |
3528 | |
3529 | private: | |
3530 | /* A hash table of all symbols we found. We use this to avoid | |
3531 | adding any symbol more than once. */ | |
3532 | htab_t m_unique_syms; | |
3533 | ||
3534 | /* The result vector. */ | |
7e41c8db | 3535 | std::vector<block_symbol> m_symbols; |
14bc53a8 PA |
3536 | }; |
3537 | ||
3538 | bool | |
7e41c8db | 3539 | decode_compound_collector::operator () (block_symbol *bsym) |
f8eba3c6 | 3540 | { |
f8eba3c6 TT |
3541 | void **slot; |
3542 | struct type *t; | |
7e41c8db | 3543 | struct symbol *sym = bsym->symbol; |
614b3b14 | 3544 | |
f8eba3c6 | 3545 | if (SYMBOL_CLASS (sym) != LOC_TYPEDEF) |
14bc53a8 | 3546 | return true; /* Continue iterating. */ |
f8eba3c6 TT |
3547 | |
3548 | t = SYMBOL_TYPE (sym); | |
f168693b | 3549 | t = check_typedef (t); |
f8eba3c6 TT |
3550 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
3551 | && TYPE_CODE (t) != TYPE_CODE_UNION | |
3552 | && TYPE_CODE (t) != TYPE_CODE_NAMESPACE) | |
14bc53a8 | 3553 | return true; /* Continue iterating. */ |
614b3b14 | 3554 | |
14bc53a8 | 3555 | slot = htab_find_slot (m_unique_syms, sym, INSERT); |
f8eba3c6 TT |
3556 | if (!*slot) |
3557 | { | |
3558 | *slot = sym; | |
7e41c8db | 3559 | m_symbols.push_back (*bsym); |
f8eba3c6 TT |
3560 | } |
3561 | ||
14bc53a8 | 3562 | return true; /* Continue iterating. */ |
f8eba3c6 | 3563 | } |
93d91629 | 3564 | |
ffdbe864 YQ |
3565 | } // namespace |
3566 | ||
40e084e1 | 3567 | /* Return any symbols corresponding to CLASS_NAME in FILE_SYMTABS. */ |
93d91629 | 3568 | |
7e41c8db | 3569 | static std::vector<block_symbol> |
2a908241 KS |
3570 | lookup_prefix_sym (struct linespec_state *state, |
3571 | std::vector<symtab *> *file_symtabs, | |
40e084e1 | 3572 | const char *class_name) |
93d91629 | 3573 | { |
14bc53a8 | 3574 | decode_compound_collector collector; |
e0881a8e | 3575 | |
b5ec771e PA |
3576 | lookup_name_info lookup_name (class_name, symbol_name_match_type::FULL); |
3577 | ||
2a908241 | 3578 | for (const auto &elt : *file_symtabs) |
f8eba3c6 | 3579 | { |
2a908241 | 3580 | if (elt == nullptr) |
f8eba3c6 | 3581 | { |
b5ec771e | 3582 | iterate_over_all_matching_symtabs (state, lookup_name, |
56d87ef7 PA |
3583 | STRUCT_DOMAIN, ALL_DOMAIN, |
3584 | NULL, false, collector); | |
b5ec771e | 3585 | iterate_over_all_matching_symtabs (state, lookup_name, |
56d87ef7 PA |
3586 | VAR_DOMAIN, ALL_DOMAIN, |
3587 | NULL, false, collector); | |
f8eba3c6 TT |
3588 | } |
3589 | else | |
3590 | { | |
f8eba3c6 TT |
3591 | /* Program spaces that are executing startup should have |
3592 | been filtered out earlier. */ | |
3593 | gdb_assert (!SYMTAB_PSPACE (elt)->executing_startup); | |
3594 | set_current_program_space (SYMTAB_PSPACE (elt)); | |
b5ec771e PA |
3595 | iterate_over_file_blocks (elt, lookup_name, STRUCT_DOMAIN, collector); |
3596 | iterate_over_file_blocks (elt, lookup_name, VAR_DOMAIN, collector); | |
1e5a1abc KS |
3597 | } |
3598 | } | |
3599 | ||
14bc53a8 | 3600 | return collector.release_symbols (); |
93d91629 DC |
3601 | } |
3602 | ||
7243d011 KS |
3603 | /* A std::sort comparison function for symbols. The resulting order does |
3604 | not actually matter; we just need to be able to sort them so that | |
3605 | symbols with the same program space end up next to each other. */ | |
3606 | ||
3607 | static bool | |
7e41c8db | 3608 | compare_symbols (const block_symbol &a, const block_symbol &b) |
7243d011 KS |
3609 | { |
3610 | uintptr_t uia, uib; | |
3611 | ||
7e41c8db KS |
3612 | uia = (uintptr_t) SYMTAB_PSPACE (symbol_symtab (a.symbol)); |
3613 | uib = (uintptr_t) SYMTAB_PSPACE (symbol_symtab (b.symbol)); | |
7243d011 KS |
3614 | |
3615 | if (uia < uib) | |
3616 | return true; | |
3617 | if (uia > uib) | |
3618 | return false; | |
3619 | ||
7e41c8db KS |
3620 | uia = (uintptr_t) a.symbol; |
3621 | uib = (uintptr_t) b.symbol; | |
7243d011 KS |
3622 | |
3623 | if (uia < uib) | |
3624 | return true; | |
3625 | ||
3626 | return false; | |
3627 | } | |
3628 | ||
40e084e1 | 3629 | /* Like compare_symbols but for minimal symbols. */ |
4224873a | 3630 | |
c2a031c5 KS |
3631 | static bool |
3632 | compare_msymbols (const bound_minimal_symbol &a, const bound_minimal_symbol &b) | |
4224873a | 3633 | { |
f8eba3c6 TT |
3634 | uintptr_t uia, uib; |
3635 | ||
c2a031c5 KS |
3636 | uia = (uintptr_t) a.objfile->pspace; |
3637 | uib = (uintptr_t) a.objfile->pspace; | |
f8eba3c6 TT |
3638 | |
3639 | if (uia < uib) | |
c2a031c5 | 3640 | return true; |
f8eba3c6 | 3641 | if (uia > uib) |
c2a031c5 | 3642 | return false; |
f8eba3c6 | 3643 | |
c2a031c5 KS |
3644 | uia = (uintptr_t) a.minsym; |
3645 | uib = (uintptr_t) b.minsym; | |
f8eba3c6 TT |
3646 | |
3647 | if (uia < uib) | |
c2a031c5 | 3648 | return true; |
f8eba3c6 | 3649 | |
c2a031c5 | 3650 | return false; |
f8eba3c6 TT |
3651 | } |
3652 | ||
3653 | /* Look for all the matching instances of each symbol in NAMES. Only | |
3654 | instances from PSPACE are considered; other program spaces are | |
3655 | handled by our caller. If PSPACE is NULL, then all program spaces | |
3656 | are considered. Results are stored into INFO. */ | |
3657 | ||
3658 | static void | |
3659 | add_all_symbol_names_from_pspace (struct collect_info *info, | |
3660 | struct program_space *pspace, | |
9b2f8581 | 3661 | const std::vector<const char *> &names, |
56d87ef7 | 3662 | enum search_domain search_domain) |
f8eba3c6 | 3663 | { |
9b2f8581 | 3664 | for (const char *iter : names) |
b5ec771e PA |
3665 | add_matching_symbols_to_info (iter, |
3666 | symbol_name_match_type::FULL, | |
56d87ef7 | 3667 | search_domain, info, pspace); |
f8eba3c6 TT |
3668 | } |
3669 | ||
3670 | static void | |
8e8d776e | 3671 | find_superclass_methods (std::vector<struct type *> &&superclasses, |
b5ec771e | 3672 | const char *name, enum language name_lang, |
9b2f8581 | 3673 | std::vector<const char *> *result_names) |
f8eba3c6 | 3674 | { |
9b2f8581 | 3675 | size_t old_len = result_names->size (); |
f8eba3c6 | 3676 | |
f8eba3c6 TT |
3677 | while (1) |
3678 | { | |
8e8d776e | 3679 | std::vector<struct type *> new_supers; |
f8eba3c6 | 3680 | |
52941706 | 3681 | for (type *t : superclasses) |
b5ec771e | 3682 | find_methods (t, name_lang, name, result_names, &new_supers); |
f8eba3c6 | 3683 | |
8e8d776e | 3684 | if (result_names->size () != old_len || new_supers.empty ()) |
f8eba3c6 | 3685 | break; |
4224873a | 3686 | |
8e8d776e | 3687 | superclasses = std::move (new_supers); |
f8eba3c6 | 3688 | } |
f8eba3c6 TT |
3689 | } |
3690 | ||
40e084e1 KS |
3691 | /* This finds the method METHOD_NAME in the class CLASS_NAME whose type is |
3692 | given by one of the symbols in SYM_CLASSES. Matches are returned | |
3693 | in SYMBOLS (for debug symbols) and MINSYMS (for minimal symbols). */ | |
f8eba3c6 | 3694 | |
40e084e1 | 3695 | static void |
2a908241 | 3696 | find_method (struct linespec_state *self, std::vector<symtab *> *file_symtabs, |
40e084e1 | 3697 | const char *class_name, const char *method_name, |
7e41c8db KS |
3698 | std::vector<block_symbol> *sym_classes, |
3699 | std::vector<block_symbol> *symbols, | |
c2a031c5 | 3700 | std::vector<bound_minimal_symbol> *minsyms) |
f8eba3c6 | 3701 | { |
9b2f8581 | 3702 | size_t last_result_len; |
8e8d776e | 3703 | std::vector<struct type *> superclass_vec; |
9b2f8581 | 3704 | std::vector<const char *> result_names; |
f8eba3c6 | 3705 | struct collect_info info; |
4224873a | 3706 | |
f8eba3c6 TT |
3707 | /* Sort symbols so that symbols with the same program space are next |
3708 | to each other. */ | |
4dedf84d KS |
3709 | std::sort (sym_classes->begin (), sym_classes->end (), |
3710 | compare_symbols); | |
f8eba3c6 TT |
3711 | |
3712 | info.state = self; | |
40e084e1 | 3713 | info.file_symtabs = file_symtabs; |
7243d011 | 3714 | info.result.symbols = symbols; |
c2a031c5 | 3715 | info.result.minimal_symbols = minsyms; |
f8eba3c6 TT |
3716 | |
3717 | /* Iterate over all the types, looking for the names of existing | |
40e084e1 | 3718 | methods matching METHOD_NAME. If we cannot find a direct method in a |
f8eba3c6 TT |
3719 | given program space, then we consider inherited methods; this is |
3720 | not ideal (ideal would be to respect C++ hiding rules), but it | |
3721 | seems good enough and is what GDB has historically done. We only | |
3722 | need to collect the names because later we find all symbols with | |
3723 | those names. This loop is written in a somewhat funny way | |
3724 | because we collect data across the program space before deciding | |
3725 | what to do. */ | |
f8eba3c6 | 3726 | last_result_len = 0; |
4dedf84d | 3727 | unsigned int ix = 0; |
7e41c8db | 3728 | for (const auto &elt : *sym_classes) |
f8eba3c6 TT |
3729 | { |
3730 | struct type *t; | |
3731 | struct program_space *pspace; | |
7e41c8db | 3732 | struct symbol *sym = elt.symbol; |
f8eba3c6 TT |
3733 | |
3734 | /* Program spaces that are executing startup should have | |
3735 | been filtered out earlier. */ | |
08be3fe3 DE |
3736 | pspace = SYMTAB_PSPACE (symbol_symtab (sym)); |
3737 | gdb_assert (!pspace->executing_startup); | |
f8eba3c6 TT |
3738 | set_current_program_space (pspace); |
3739 | t = check_typedef (SYMBOL_TYPE (sym)); | |
b5ec771e PA |
3740 | find_methods (t, SYMBOL_LANGUAGE (sym), |
3741 | method_name, &result_names, &superclass_vec); | |
f8eba3c6 TT |
3742 | |
3743 | /* Handle all items from a single program space at once; and be | |
3744 | sure not to miss the last batch. */ | |
4dedf84d | 3745 | if (ix == sym_classes->size () - 1 |
f8eba3c6 | 3746 | || (pspace |
7e41c8db | 3747 | != SYMTAB_PSPACE (symbol_symtab (sym_classes->at (ix + 1).symbol)))) |
4224873a | 3748 | { |
f8eba3c6 TT |
3749 | /* If we did not find a direct implementation anywhere in |
3750 | this program space, consider superclasses. */ | |
9b2f8581 | 3751 | if (result_names.size () == last_result_len) |
8e8d776e | 3752 | find_superclass_methods (std::move (superclass_vec), method_name, |
b5ec771e | 3753 | SYMBOL_LANGUAGE (sym), &result_names); |
f8eba3c6 TT |
3754 | |
3755 | /* We have a list of candidate symbol names, so now we | |
3756 | iterate over the symbol tables looking for all | |
3757 | matches in this pspace. */ | |
56d87ef7 PA |
3758 | add_all_symbol_names_from_pspace (&info, pspace, result_names, |
3759 | FUNCTIONS_DOMAIN); | |
f8eba3c6 | 3760 | |
8e8d776e | 3761 | superclass_vec.clear (); |
9b2f8581 | 3762 | last_result_len = result_names.size (); |
4dedf84d | 3763 | ++ix; |
4224873a | 3764 | } |
4224873a | 3765 | } |
f8eba3c6 | 3766 | |
c2a031c5 KS |
3767 | if (!symbols->empty () || !minsyms->empty ()) |
3768 | return; | |
f8eba3c6 | 3769 | |
40e084e1 KS |
3770 | /* Throw an NOT_FOUND_ERROR. This will be caught by the caller |
3771 | and other attempts to locate the symbol will be made. */ | |
3772 | throw_error (NOT_FOUND_ERROR, _("see caller, this text doesn't matter")); | |
f8eba3c6 TT |
3773 | } |
3774 | ||
3775 | \f | |
3776 | ||
ffdbe864 YQ |
3777 | namespace { |
3778 | ||
14bc53a8 PA |
3779 | /* This function object is a callback for iterate_over_symtabs, used |
3780 | when collecting all matching symtabs. */ | |
f8eba3c6 | 3781 | |
14bc53a8 | 3782 | class symtab_collector |
f8eba3c6 | 3783 | { |
14bc53a8 | 3784 | public: |
fc4007c9 | 3785 | symtab_collector () |
fc4007c9 | 3786 | { |
14bc53a8 PA |
3787 | m_symtab_table = htab_create (1, htab_hash_pointer, htab_eq_pointer, |
3788 | NULL); | |
fc4007c9 TT |
3789 | } |
3790 | ||
3791 | ~symtab_collector () | |
3792 | { | |
14bc53a8 PA |
3793 | if (m_symtab_table != NULL) |
3794 | htab_delete (m_symtab_table); | |
fc4007c9 | 3795 | } |
f8eba3c6 | 3796 | |
14bc53a8 PA |
3797 | /* Callable as a symbol_found_callback_ftype callback. */ |
3798 | bool operator () (symtab *sym); | |
f8eba3c6 | 3799 | |
4717cec4 SM |
3800 | /* Return an rvalue reference to the collected symtabs. */ |
3801 | std::vector<symtab *> &&release_symtabs () | |
14bc53a8 | 3802 | { |
2a908241 | 3803 | return std::move (m_symtabs); |
14bc53a8 PA |
3804 | } |
3805 | ||
3806 | private: | |
3807 | /* The result vector of symtabs. */ | |
4717cec4 | 3808 | std::vector<symtab *> m_symtabs; |
14bc53a8 PA |
3809 | |
3810 | /* This is used to ensure the symtabs are unique. */ | |
3811 | htab_t m_symtab_table; | |
3812 | }; | |
3813 | ||
3814 | bool | |
3815 | symtab_collector::operator () (struct symtab *symtab) | |
f8eba3c6 | 3816 | { |
f8eba3c6 TT |
3817 | void **slot; |
3818 | ||
14bc53a8 | 3819 | slot = htab_find_slot (m_symtab_table, symtab, INSERT); |
f8eba3c6 | 3820 | if (!*slot) |
4224873a | 3821 | { |
f8eba3c6 | 3822 | *slot = symtab; |
4717cec4 | 3823 | m_symtabs.push_back (symtab); |
4224873a | 3824 | } |
f8eba3c6 | 3825 | |
14bc53a8 | 3826 | return false; |
4224873a DC |
3827 | } |
3828 | ||
ffdbe864 YQ |
3829 | } // namespace |
3830 | ||
2a908241 | 3831 | /* Given a file name, return a list of all matching symtabs. If |
c2f4122d PA |
3832 | SEARCH_PSPACE is not NULL, the search is restricted to just that |
3833 | program space. */ | |
f8eba3c6 | 3834 | |
4717cec4 | 3835 | static std::vector<symtab *> |
c2f4122d PA |
3836 | collect_symtabs_from_filename (const char *file, |
3837 | struct program_space *search_pspace) | |
f8eba3c6 | 3838 | { |
14bc53a8 | 3839 | symtab_collector collector; |
f8eba3c6 TT |
3840 | |
3841 | /* Find that file's data. */ | |
c2f4122d PA |
3842 | if (search_pspace == NULL) |
3843 | { | |
14bc53a8 PA |
3844 | struct program_space *pspace; |
3845 | ||
c2f4122d PA |
3846 | ALL_PSPACES (pspace) |
3847 | { | |
3848 | if (pspace->executing_startup) | |
3849 | continue; | |
f8eba3c6 | 3850 | |
c2f4122d | 3851 | set_current_program_space (pspace); |
14bc53a8 | 3852 | iterate_over_symtabs (file, collector); |
c2f4122d PA |
3853 | } |
3854 | } | |
3855 | else | |
3856 | { | |
3857 | set_current_program_space (search_pspace); | |
14bc53a8 | 3858 | iterate_over_symtabs (file, collector); |
c2f4122d | 3859 | } |
f3c39e76 | 3860 | |
14bc53a8 | 3861 | return collector.release_symtabs (); |
f8eba3c6 TT |
3862 | } |
3863 | ||
c2f4122d PA |
3864 | /* Return all the symtabs associated to the FILENAME. If SEARCH_PSPACE is |
3865 | not NULL, the search is restricted to just that program space. */ | |
f8eba3c6 | 3866 | |
4717cec4 | 3867 | static std::vector<symtab *> |
c2f4122d PA |
3868 | symtabs_from_filename (const char *filename, |
3869 | struct program_space *search_pspace) | |
40e084e1 | 3870 | { |
4717cec4 | 3871 | std::vector<symtab *> result |
2a908241 | 3872 | = collect_symtabs_from_filename (filename, search_pspace); |
f8eba3c6 | 3873 | |
4717cec4 | 3874 | if (result.empty ()) |
f8eba3c6 | 3875 | { |
40e084e1 KS |
3876 | if (!have_full_symbols () && !have_partial_symbols ()) |
3877 | throw_error (NOT_FOUND_ERROR, | |
3878 | _("No symbol table is loaded. " | |
3879 | "Use the \"file\" command.")); | |
00e52e53 | 3880 | source_file_not_found_error (filename); |
f8eba3c6 TT |
3881 | } |
3882 | ||
40e084e1 | 3883 | return result; |
84fba31b | 3884 | } |
f3c39e76 | 3885 | |
fcaad03c KS |
3886 | /* See symtab.h. */ |
3887 | ||
3888 | void | |
3889 | symbol_searcher::find_all_symbols (const std::string &name, | |
3890 | const struct language_defn *language, | |
3891 | enum search_domain search_domain, | |
3892 | std::vector<symtab *> *search_symtabs, | |
3893 | struct program_space *search_pspace) | |
3894 | { | |
3895 | symbol_searcher_collect_info info; | |
3896 | struct linespec_state state; | |
3897 | ||
3898 | memset (&state, 0, sizeof (state)); | |
3899 | state.language = language; | |
3900 | info.state = &state; | |
3901 | ||
3902 | info.result.symbols = &m_symbols; | |
3903 | info.result.minimal_symbols = &m_minimal_symbols; | |
3904 | std::vector<symtab *> all_symtabs; | |
3905 | if (search_symtabs == nullptr) | |
3906 | { | |
3907 | all_symtabs.push_back (nullptr); | |
3908 | search_symtabs = &all_symtabs; | |
3909 | } | |
3910 | info.file_symtabs = search_symtabs; | |
3911 | ||
3912 | add_matching_symbols_to_info (name.c_str (), symbol_name_match_type::WILD, | |
3913 | search_domain, &info, search_pspace); | |
3914 | } | |
3915 | ||
40e084e1 KS |
3916 | /* Look up a function symbol named NAME in symtabs FILE_SYMTABS. Matching |
3917 | debug symbols are returned in SYMBOLS. Matching minimal symbols are | |
3918 | returned in MINSYMS. */ | |
14e91ac5 | 3919 | |
40e084e1 KS |
3920 | static void |
3921 | find_function_symbols (struct linespec_state *state, | |
2a908241 | 3922 | std::vector<symtab *> *file_symtabs, const char *name, |
a20714ff | 3923 | symbol_name_match_type name_match_type, |
7e41c8db | 3924 | std::vector<block_symbol> *symbols, |
c2a031c5 | 3925 | std::vector<bound_minimal_symbol> *minsyms) |
14e91ac5 | 3926 | { |
40e084e1 | 3927 | struct collect_info info; |
9b2f8581 | 3928 | std::vector<const char *> symbol_names; |
14e91ac5 | 3929 | |
40e084e1 | 3930 | info.state = state; |
7243d011 | 3931 | info.result.symbols = symbols; |
c2a031c5 | 3932 | info.result.minimal_symbols = minsyms; |
40e084e1 | 3933 | info.file_symtabs = file_symtabs; |
e0881a8e | 3934 | |
40e084e1 | 3935 | /* Try NAME as an Objective-C selector. */ |
d7561cbb | 3936 | find_imps (name, &symbol_names); |
9b2f8581 | 3937 | if (!symbol_names.empty ()) |
c2f4122d | 3938 | add_all_symbol_names_from_pspace (&info, state->search_pspace, |
56d87ef7 | 3939 | symbol_names, FUNCTIONS_DOMAIN); |
40e084e1 | 3940 | else |
a20714ff | 3941 | add_matching_symbols_to_info (name, name_match_type, FUNCTIONS_DOMAIN, |
b5ec771e | 3942 | &info, state->search_pspace); |
40e084e1 KS |
3943 | } |
3944 | ||
3945 | /* Find all symbols named NAME in FILE_SYMTABS, returning debug symbols | |
3946 | in SYMBOLS and minimal symbols in MINSYMS. */ | |
14e91ac5 | 3947 | |
b1ae631a | 3948 | static void |
40e084e1 | 3949 | find_linespec_symbols (struct linespec_state *state, |
2a908241 | 3950 | std::vector<symtab *> *file_symtabs, |
b5ec771e | 3951 | const char *lookup_name, |
a20714ff | 3952 | symbol_name_match_type name_match_type, |
7e41c8db | 3953 | std::vector <block_symbol> *symbols, |
c2a031c5 | 3954 | std::vector<bound_minimal_symbol> *minsyms) |
40e084e1 | 3955 | { |
2f408ecb PA |
3956 | std::string canon = cp_canonicalize_string_no_typedefs (lookup_name); |
3957 | if (!canon.empty ()) | |
3958 | lookup_name = canon.c_str (); | |
3959 | ||
cc81e1c6 DE |
3960 | /* It's important to not call expand_symtabs_matching unnecessarily |
3961 | as it can really slow things down (by unnecessarily expanding | |
3962 | potentially 1000s of symtabs, which when debugging some apps can | |
3963 | cost 100s of seconds). Avoid this to some extent by *first* calling | |
3964 | find_function_symbols, and only if that doesn't find anything | |
3965 | *then* call find_method. This handles two important cases: | |
3966 | 1) break (anonymous namespace)::foo | |
3967 | 2) break class::method where method is in class (and not a baseclass) */ | |
14e91ac5 | 3968 | |
cc81e1c6 | 3969 | find_function_symbols (state, file_symtabs, lookup_name, |
7243d011 | 3970 | name_match_type, symbols, minsyms); |
14e91ac5 | 3971 | |
cc81e1c6 DE |
3972 | /* If we were unable to locate a symbol of the same name, try dividing |
3973 | the name into class and method names and searching the class and its | |
3974 | baseclasses. */ | |
c2a031c5 | 3975 | if (symbols->empty () && minsyms->empty ()) |
40e084e1 | 3976 | { |
2f408ecb | 3977 | std::string klass, method; |
cc81e1c6 | 3978 | const char *last, *p, *scope_op; |
14e91ac5 | 3979 | |
cc81e1c6 DE |
3980 | /* See if we can find a scope operator and break this symbol |
3981 | name into namespaces${SCOPE_OPERATOR}class_name and method_name. */ | |
3982 | scope_op = "::"; | |
3983 | p = find_toplevel_string (lookup_name, scope_op); | |
14e91ac5 | 3984 | |
cc81e1c6 DE |
3985 | last = NULL; |
3986 | while (p != NULL) | |
f8eba3c6 | 3987 | { |
cc81e1c6 DE |
3988 | last = p; |
3989 | p = find_toplevel_string (p + strlen (scope_op), scope_op); | |
f8eba3c6 | 3990 | } |
14e91ac5 | 3991 | |
cc81e1c6 DE |
3992 | /* If no scope operator was found, there is nothing more we can do; |
3993 | we already attempted to lookup the entire name as a symbol | |
3994 | and failed. */ | |
3995 | if (last == NULL) | |
2f408ecb | 3996 | return; |
cc81e1c6 DE |
3997 | |
3998 | /* LOOKUP_NAME points to the class name. | |
3999 | LAST points to the method name. */ | |
2f408ecb | 4000 | klass = std::string (lookup_name, last - lookup_name); |
cc81e1c6 DE |
4001 | |
4002 | /* Skip past the scope operator. */ | |
4003 | last += strlen (scope_op); | |
2f408ecb | 4004 | method = last; |
cc81e1c6 DE |
4005 | |
4006 | /* Find a list of classes named KLASS. */ | |
7e41c8db | 4007 | std::vector<block_symbol> classes |
4dedf84d KS |
4008 | = lookup_prefix_sym (state, file_symtabs, klass.c_str ()); |
4009 | if (!classes.empty ()) | |
cc81e1c6 DE |
4010 | { |
4011 | /* Now locate a list of suitable methods named METHOD. */ | |
492d29ea | 4012 | TRY |
cc81e1c6 | 4013 | { |
2f408ecb PA |
4014 | find_method (state, file_symtabs, |
4015 | klass.c_str (), method.c_str (), | |
4dedf84d | 4016 | &classes, symbols, minsyms); |
cc81e1c6 DE |
4017 | } |
4018 | ||
4019 | /* If successful, we're done. If NOT_FOUND_ERROR | |
4020 | was not thrown, rethrow the exception that we did get. */ | |
492d29ea | 4021 | CATCH (except, RETURN_MASK_ERROR) |
7556d4a4 PA |
4022 | { |
4023 | if (except.error != NOT_FOUND_ERROR) | |
4024 | throw_exception (except); | |
4025 | } | |
492d29ea | 4026 | END_CATCH |
cc81e1c6 | 4027 | } |
2f408ecb | 4028 | } |
14e91ac5 DC |
4029 | } |
4030 | ||
a2459270 PA |
4031 | /* Helper for find_label_symbols. Find all labels that match name |
4032 | NAME in BLOCK. Return all labels that match in FUNCTION_SYMBOLS. | |
4033 | Return the actual function symbol in which the label was found in | |
4034 | LABEL_FUNC_RET. If COMPLETION_MODE is true, then NAME is | |
4035 | interpreted as a label name prefix. Otherwise, only a label named | |
4036 | exactly NAME match. */ | |
4037 | ||
4038 | static void | |
4039 | find_label_symbols_in_block (const struct block *block, | |
4040 | const char *name, struct symbol *fn_sym, | |
4041 | bool completion_mode, | |
7e41c8db KS |
4042 | std::vector<block_symbol> *result, |
4043 | std::vector<block_symbol> *label_funcs_ret) | |
a2459270 PA |
4044 | { |
4045 | if (completion_mode) | |
4046 | { | |
4047 | struct block_iterator iter; | |
4048 | struct symbol *sym; | |
4049 | size_t name_len = strlen (name); | |
4050 | ||
4051 | int (*cmp) (const char *, const char *, size_t); | |
4052 | cmp = case_sensitivity == case_sensitive_on ? strncmp : strncasecmp; | |
4053 | ||
4054 | ALL_BLOCK_SYMBOLS (block, iter, sym) | |
4055 | { | |
4056 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), | |
4057 | SYMBOL_DOMAIN (sym), LABEL_DOMAIN) | |
4058 | && cmp (SYMBOL_SEARCH_NAME (sym), name, name_len) == 0) | |
4059 | { | |
7e41c8db KS |
4060 | result->push_back ({sym, block}); |
4061 | label_funcs_ret->push_back ({fn_sym, block}); | |
a2459270 PA |
4062 | } |
4063 | } | |
4064 | } | |
4065 | else | |
4066 | { | |
7e41c8db KS |
4067 | struct block_symbol label_sym |
4068 | = lookup_symbol (name, block, LABEL_DOMAIN, 0); | |
a2459270 | 4069 | |
7e41c8db | 4070 | if (label_sym.symbol != NULL) |
a2459270 | 4071 | { |
7e41c8db KS |
4072 | result->push_back (label_sym); |
4073 | label_funcs_ret->push_back ({fn_sym, block}); | |
a2459270 PA |
4074 | } |
4075 | } | |
4076 | } | |
4077 | ||
3553eadc KS |
4078 | /* Return all labels that match name NAME in FUNCTION_SYMBOLS or NULL |
4079 | if no matches were found. | |
4080 | ||
4081 | Return the actual function symbol in which the label was found in | |
a2459270 PA |
4082 | LABEL_FUNC_RET. If COMPLETION_MODE is true, then NAME is |
4083 | interpreted as a label name prefix. Otherwise, only labels named | |
4084 | exactly NAME match. */ | |
0f5238ed | 4085 | |
7e41c8db KS |
4086 | |
4087 | static std::vector<block_symbol> * | |
40e084e1 | 4088 | find_label_symbols (struct linespec_state *self, |
7e41c8db KS |
4089 | std::vector<block_symbol> *function_symbols, |
4090 | std::vector<block_symbol> *label_funcs_ret, | |
4091 | const char *name, | |
a2459270 | 4092 | bool completion_mode) |
0f5238ed | 4093 | { |
3977b71f | 4094 | const struct block *block; |
40e084e1 | 4095 | struct symbol *fn_sym; |
7e41c8db | 4096 | std::vector<block_symbol> result; |
9ef07c8c | 4097 | |
f8eba3c6 | 4098 | if (function_symbols == NULL) |
9ef07c8c | 4099 | { |
f8eba3c6 | 4100 | set_current_program_space (self->program_space); |
4eeaa230 | 4101 | block = get_current_search_block (); |
f8eba3c6 | 4102 | |
9ef07c8c TT |
4103 | for (; |
4104 | block && !BLOCK_FUNCTION (block); | |
4105 | block = BLOCK_SUPERBLOCK (block)) | |
4106 | ; | |
4107 | if (!block) | |
40e084e1 | 4108 | return NULL; |
f8eba3c6 TT |
4109 | fn_sym = BLOCK_FUNCTION (block); |
4110 | ||
a2459270 PA |
4111 | find_label_symbols_in_block (block, name, fn_sym, completion_mode, |
4112 | &result, label_funcs_ret); | |
40e084e1 KS |
4113 | } |
4114 | else | |
4115 | { | |
7243d011 | 4116 | for (const auto &elt : *function_symbols) |
f8eba3c6 | 4117 | { |
7e41c8db KS |
4118 | fn_sym = elt.symbol; |
4119 | set_current_program_space (SYMTAB_PSPACE (symbol_symtab (fn_sym))); | |
4120 | block = SYMBOL_BLOCK_VALUE (fn_sym); | |
40e084e1 | 4121 | |
7e41c8db | 4122 | find_label_symbols_in_block (block, name, fn_sym, completion_mode, |
a2459270 | 4123 | &result, label_funcs_ret); |
f8eba3c6 | 4124 | } |
40e084e1 | 4125 | } |
f8eba3c6 | 4126 | |
3553eadc | 4127 | if (!result.empty ()) |
7e41c8db | 4128 | return new std::vector<block_symbol> (std::move (result)); |
3553eadc | 4129 | return nullptr; |
40e084e1 | 4130 | } |
f8eba3c6 | 4131 | |
40e084e1 KS |
4132 | \f |
4133 | ||
4134 | /* A helper for create_sals_line_offset that handles the 'list_mode' case. */ | |
4135 | ||
6c5b2ebe | 4136 | static std::vector<symtab_and_line> |
40e084e1 KS |
4137 | decode_digits_list_mode (struct linespec_state *self, |
4138 | linespec_p ls, | |
40e084e1 KS |
4139 | struct symtab_and_line val) |
4140 | { | |
40e084e1 KS |
4141 | gdb_assert (self->list_mode); |
4142 | ||
6c5b2ebe PA |
4143 | std::vector<symtab_and_line> values; |
4144 | ||
2a908241 | 4145 | for (const auto &elt : *ls->file_symtabs) |
40e084e1 KS |
4146 | { |
4147 | /* The logic above should ensure this. */ | |
4148 | gdb_assert (elt != NULL); | |
4149 | ||
4150 | set_current_program_space (SYMTAB_PSPACE (elt)); | |
4151 | ||
4152 | /* Simplistic search just for the list command. */ | |
4153 | val.symtab = find_line_symtab (elt, val.line, NULL, NULL); | |
4154 | if (val.symtab == NULL) | |
4155 | val.symtab = elt; | |
4156 | val.pspace = SYMTAB_PSPACE (elt); | |
4157 | val.pc = 0; | |
4158 | val.explicit_line = 1; | |
4159 | ||
6c5b2ebe | 4160 | add_sal_to_sals (self, &values, &val, NULL, 0); |
f8eba3c6 | 4161 | } |
6c5b2ebe PA |
4162 | |
4163 | return values; | |
40e084e1 | 4164 | } |
f8eba3c6 | 4165 | |
40e084e1 KS |
4166 | /* A helper for create_sals_line_offset that iterates over the symtabs, |
4167 | adding lines to the VEC. */ | |
4168 | ||
6c5b2ebe | 4169 | static std::vector<symtab_and_line> |
40e084e1 KS |
4170 | decode_digits_ordinary (struct linespec_state *self, |
4171 | linespec_p ls, | |
4172 | int line, | |
40e084e1 KS |
4173 | struct linetable_entry **best_entry) |
4174 | { | |
6c5b2ebe | 4175 | std::vector<symtab_and_line> sals; |
2a908241 | 4176 | for (const auto &elt : *ls->file_symtabs) |
f8eba3c6 | 4177 | { |
67d89901 | 4178 | std::vector<CORE_ADDR> pcs; |
40e084e1 KS |
4179 | |
4180 | /* The logic above should ensure this. */ | |
4181 | gdb_assert (elt != NULL); | |
f8eba3c6 | 4182 | |
40e084e1 | 4183 | set_current_program_space (SYMTAB_PSPACE (elt)); |
f8eba3c6 | 4184 | |
40e084e1 | 4185 | pcs = find_pcs_for_symtab_line (elt, line, best_entry); |
67d89901 | 4186 | for (CORE_ADDR pc : pcs) |
f8eba3c6 | 4187 | { |
51abb421 | 4188 | symtab_and_line sal; |
40e084e1 KS |
4189 | sal.pspace = SYMTAB_PSPACE (elt); |
4190 | sal.symtab = elt; | |
4191 | sal.line = line; | |
4192 | sal.pc = pc; | |
6c5b2ebe | 4193 | sals.push_back (std::move (sal)); |
f8eba3c6 TT |
4194 | } |
4195 | } | |
6c5b2ebe PA |
4196 | |
4197 | return sals; | |
40e084e1 KS |
4198 | } |
4199 | ||
4200 | \f | |
4201 | ||
4202 | /* Return the line offset represented by VARIABLE. */ | |
4203 | ||
4204 | static struct line_offset | |
4205 | linespec_parse_variable (struct linespec_state *self, const char *variable) | |
4206 | { | |
4207 | int index = 0; | |
4208 | const char *p; | |
4209 | struct line_offset offset = {0, LINE_OFFSET_NONE}; | |
f8eba3c6 | 4210 | |
40e084e1 KS |
4211 | p = (variable[1] == '$') ? variable + 2 : variable + 1; |
4212 | if (*p == '$') | |
4213 | ++p; | |
4214 | while (*p >= '0' && *p <= '9') | |
4215 | ++p; | |
4216 | if (!*p) /* Reached end of token without hitting non-digit. */ | |
f8eba3c6 | 4217 | { |
40e084e1 KS |
4218 | /* We have a value history reference. */ |
4219 | struct value *val_history; | |
f8eba3c6 | 4220 | |
40e084e1 KS |
4221 | sscanf ((variable[1] == '$') ? variable + 2 : variable + 1, "%d", &index); |
4222 | val_history | |
4223 | = access_value_history ((variable[1] == '$') ? -index : index); | |
4224 | if (TYPE_CODE (value_type (val_history)) != TYPE_CODE_INT) | |
4225 | error (_("History values used in line " | |
4226 | "specs must have integer values.")); | |
4227 | offset.offset = value_as_long (val_history); | |
4228 | } | |
4229 | else | |
4230 | { | |
4231 | /* Not all digits -- may be user variable/function or a | |
4232 | convenience variable. */ | |
4233 | LONGEST valx; | |
4234 | struct internalvar *ivar; | |
4235 | ||
4236 | /* Try it as a convenience variable. If it is not a convenience | |
4237 | variable, return and allow normal symbol lookup to occur. */ | |
4238 | ivar = lookup_only_internalvar (variable + 1); | |
4239 | if (ivar == NULL) | |
4240 | /* No internal variable with that name. Mark the offset | |
4241 | as unknown to allow the name to be looked up as a symbol. */ | |
4242 | offset.sign = LINE_OFFSET_UNKNOWN; | |
4243 | else | |
4244 | { | |
4245 | /* We found a valid variable name. If it is not an integer, | |
4246 | throw an error. */ | |
4247 | if (!get_internalvar_integer (ivar, &valx)) | |
4248 | error (_("Convenience variables used in line " | |
4249 | "specs must have integer values.")); | |
4250 | else | |
4251 | offset.offset = valx; | |
4252 | } | |
f8eba3c6 TT |
4253 | } |
4254 | ||
40e084e1 | 4255 | return offset; |
f8eba3c6 | 4256 | } |
40e084e1 | 4257 | \f |
f8eba3c6 | 4258 | |
40e084e1 | 4259 | /* We've found a minimal symbol MSYMBOL in OBJFILE to associate with our |
6e22494e JK |
4260 | linespec; return the SAL in RESULT. This function should return SALs |
4261 | matching those from find_function_start_sal, otherwise false | |
4262 | multiple-locations breakpoints could be placed. */ | |
f8eba3c6 TT |
4263 | |
4264 | static void | |
4265 | minsym_found (struct linespec_state *self, struct objfile *objfile, | |
4266 | struct minimal_symbol *msymbol, | |
6c5b2ebe | 4267 | std::vector<symtab_and_line> *result) |
f8eba3c6 | 4268 | { |
3467ec66 | 4269 | bool want_start_sal; |
f8eba3c6 | 4270 | |
4024cf2b | 4271 | CORE_ADDR func_addr; |
3467ec66 PA |
4272 | bool is_function = msymbol_is_function (objfile, msymbol, &func_addr); |
4273 | ||
4274 | if (is_function) | |
4275 | { | |
4276 | const char *msym_name = MSYMBOL_LINKAGE_NAME (msymbol); | |
4277 | ||
f50776aa PA |
4278 | if (MSYMBOL_TYPE (msymbol) == mst_text_gnu_ifunc |
4279 | || MSYMBOL_TYPE (msymbol) == mst_data_gnu_ifunc) | |
3467ec66 PA |
4280 | want_start_sal = gnu_ifunc_resolve_name (msym_name, &func_addr); |
4281 | else | |
4282 | want_start_sal = true; | |
4283 | } | |
4284 | ||
4285 | symtab_and_line sal; | |
4286 | ||
4287 | if (is_function && want_start_sal) | |
42ddae10 | 4288 | sal = find_function_start_sal (func_addr, NULL, self->funfirstline); |
e5f25bc5 PA |
4289 | else |
4290 | { | |
4291 | sal.objfile = objfile; | |
3467ec66 PA |
4292 | sal.msymbol = msymbol; |
4293 | /* Store func_addr, not the minsym's address in case this was an | |
4294 | ifunc that hasn't been resolved yet. */ | |
4295 | if (is_function) | |
4296 | sal.pc = func_addr; | |
4297 | else | |
4298 | sal.pc = MSYMBOL_VALUE_ADDRESS (objfile, msymbol); | |
e5f25bc5 | 4299 | sal.pspace = current_program_space; |
6e22494e | 4300 | } |
f8eba3c6 | 4301 | |
6b05c8bd YQ |
4302 | sal.section = MSYMBOL_OBJ_SECTION (objfile, msymbol); |
4303 | ||
07fea4b4 | 4304 | if (maybe_add_address (self->addr_set, objfile->pspace, sal.pc)) |
efd66ac6 | 4305 | add_sal_to_sals (self, result, &sal, MSYMBOL_NATURAL_NAME (msymbol), 0); |
f8eba3c6 TT |
4306 | } |
4307 | ||
39b856a4 TT |
4308 | /* A helper function to classify a minimal_symbol_type according to |
4309 | priority. */ | |
4310 | ||
4311 | static int | |
4312 | classify_mtype (enum minimal_symbol_type t) | |
4313 | { | |
4314 | switch (t) | |
f8eba3c6 | 4315 | { |
39b856a4 TT |
4316 | case mst_file_text: |
4317 | case mst_file_data: | |
4318 | case mst_file_bss: | |
4319 | /* Intermediate priority. */ | |
4320 | return 1; | |
4321 | ||
4322 | case mst_solib_trampoline: | |
4323 | /* Lowest priority. */ | |
4324 | return 2; | |
4325 | ||
4326 | default: | |
4327 | /* Highest priority. */ | |
4328 | return 0; | |
f8eba3c6 | 4329 | } |
39b856a4 TT |
4330 | } |
4331 | ||
41c1efc6 | 4332 | /* Callback for std::sort that sorts symbols by priority. */ |
39b856a4 | 4333 | |
41c1efc6 TT |
4334 | static bool |
4335 | compare_msyms (const bound_minimal_symbol &a, const bound_minimal_symbol &b) | |
39b856a4 | 4336 | { |
41c1efc6 TT |
4337 | enum minimal_symbol_type ta = MSYMBOL_TYPE (a.minsym); |
4338 | enum minimal_symbol_type tb = MSYMBOL_TYPE (b.minsym); | |
39b856a4 | 4339 | |
41c1efc6 | 4340 | return classify_mtype (ta) < classify_mtype (tb); |
39b856a4 TT |
4341 | } |
4342 | ||
41c1efc6 TT |
4343 | /* Helper for search_minsyms_for_name that adds the symbol to the |
4344 | result. */ | |
39b856a4 TT |
4345 | |
4346 | static void | |
41c1efc6 TT |
4347 | add_minsym (struct minimal_symbol *minsym, struct objfile *objfile, |
4348 | struct symtab *symtab, int list_mode, | |
4349 | std::vector<struct bound_minimal_symbol> *msyms) | |
39b856a4 | 4350 | { |
41c1efc6 | 4351 | if (symtab != NULL) |
87186c6a | 4352 | { |
4024cf2b PA |
4353 | /* We're looking for a label for which we don't have debug |
4354 | info. */ | |
4355 | CORE_ADDR func_addr; | |
41c1efc6 | 4356 | if (msymbol_is_function (objfile, minsym, &func_addr)) |
4024cf2b PA |
4357 | { |
4358 | symtab_and_line sal = find_pc_sect_line (func_addr, NULL, 0); | |
87186c6a | 4359 | |
41c1efc6 | 4360 | if (symtab != sal.symtab) |
4024cf2b PA |
4361 | return; |
4362 | } | |
87186c6a MMN |
4363 | } |
4364 | ||
4024cf2b | 4365 | /* Exclude data symbols when looking for breakpoint locations. */ |
41c1efc6 | 4366 | if (!list_mode && !msymbol_is_function (objfile, minsym)) |
4024cf2b | 4367 | return; |
095bcf5e | 4368 | |
41c1efc6 TT |
4369 | struct bound_minimal_symbol mo = {minsym, objfile}; |
4370 | msyms->push_back (mo); | |
ca31ab1d | 4371 | return; |
f8eba3c6 TT |
4372 | } |
4373 | ||
87186c6a | 4374 | /* Search for minimal symbols called NAME. If SEARCH_PSPACE |
f8eba3c6 | 4375 | is not NULL, the search is restricted to just that program |
87186c6a MMN |
4376 | space. |
4377 | ||
4378 | If SYMTAB is NULL, search all objfiles, otherwise | |
4379 | restrict results to the given SYMTAB. */ | |
f8eba3c6 TT |
4380 | |
4381 | static void | |
b5ec771e PA |
4382 | search_minsyms_for_name (struct collect_info *info, |
4383 | const lookup_name_info &name, | |
87186c6a MMN |
4384 | struct program_space *search_pspace, |
4385 | struct symtab *symtab) | |
f8eba3c6 | 4386 | { |
41c1efc6 | 4387 | std::vector<struct bound_minimal_symbol> minsyms; |
f8eba3c6 | 4388 | |
87186c6a MMN |
4389 | if (symtab == NULL) |
4390 | { | |
4391 | struct program_space *pspace; | |
f8eba3c6 | 4392 | |
87186c6a MMN |
4393 | ALL_PSPACES (pspace) |
4394 | { | |
4395 | struct objfile *objfile; | |
39b856a4 | 4396 | |
87186c6a MMN |
4397 | if (search_pspace != NULL && search_pspace != pspace) |
4398 | continue; | |
4399 | if (pspace->executing_startup) | |
4400 | continue; | |
39b856a4 | 4401 | |
87186c6a MMN |
4402 | set_current_program_space (pspace); |
4403 | ||
4404 | ALL_OBJFILES (objfile) | |
4405 | { | |
41c1efc6 TT |
4406 | iterate_over_minimal_symbols (objfile, name, |
4407 | [&] (struct minimal_symbol *msym) | |
4408 | { | |
4409 | add_minsym (msym, objfile, nullptr, | |
4410 | info->state->list_mode, | |
4411 | &minsyms); | |
ca31ab1d | 4412 | return false; |
41c1efc6 | 4413 | }); |
87186c6a MMN |
4414 | } |
4415 | } | |
4416 | } | |
4417 | else | |
f8eba3c6 | 4418 | { |
87186c6a MMN |
4419 | if (search_pspace == NULL || SYMTAB_PSPACE (symtab) == search_pspace) |
4420 | { | |
4421 | set_current_program_space (SYMTAB_PSPACE (symtab)); | |
41c1efc6 TT |
4422 | iterate_over_minimal_symbols |
4423 | (SYMTAB_OBJFILE (symtab), name, | |
4424 | [&] (struct minimal_symbol *msym) | |
4425 | { | |
4426 | add_minsym (msym, SYMTAB_OBJFILE (symtab), symtab, | |
4427 | info->state->list_mode, &minsyms); | |
ca31ab1d | 4428 | return false; |
41c1efc6 | 4429 | }); |
87186c6a | 4430 | } |
9ef07c8c | 4431 | } |
39b856a4 | 4432 | |
41c1efc6 TT |
4433 | if (!minsyms.empty ()) |
4434 | { | |
4435 | int classification; | |
39b856a4 | 4436 | |
41c1efc6 | 4437 | std::sort (minsyms.begin (), minsyms.end (), compare_msyms); |
39b856a4 | 4438 | |
41c1efc6 TT |
4439 | /* Now the minsyms are in classification order. So, we walk |
4440 | over them and process just the minsyms with the same | |
4441 | classification as the very first minsym in the list. */ | |
4442 | classification = classify_mtype (MSYMBOL_TYPE (minsyms[0].minsym)); | |
4443 | ||
52941706 | 4444 | for (const bound_minimal_symbol &item : minsyms) |
41c1efc6 TT |
4445 | { |
4446 | if (classify_mtype (MSYMBOL_TYPE (item.minsym)) != classification) | |
4447 | break; | |
4448 | ||
c2a031c5 | 4449 | info->result.minimal_symbols->push_back (item); |
41c1efc6 TT |
4450 | } |
4451 | } | |
f8eba3c6 TT |
4452 | } |
4453 | ||
4454 | /* A helper function to add all symbols matching NAME to INFO. If | |
4455 | PSPACE is not NULL, the search is restricted to just that program | |
4456 | space. */ | |
0f5238ed | 4457 | |
f8eba3c6 TT |
4458 | static void |
4459 | add_matching_symbols_to_info (const char *name, | |
b5ec771e | 4460 | symbol_name_match_type name_match_type, |
56d87ef7 | 4461 | enum search_domain search_domain, |
f8eba3c6 TT |
4462 | struct collect_info *info, |
4463 | struct program_space *pspace) | |
4464 | { | |
b5ec771e PA |
4465 | lookup_name_info lookup_name (name, name_match_type); |
4466 | ||
2a908241 | 4467 | for (const auto &elt : *info->file_symtabs) |
f8eba3c6 | 4468 | { |
2a908241 | 4469 | if (elt == nullptr) |
f8eba3c6 | 4470 | { |
b5ec771e | 4471 | iterate_over_all_matching_symtabs (info->state, lookup_name, |
56d87ef7 | 4472 | VAR_DOMAIN, search_domain, |
7e41c8db KS |
4473 | pspace, true, |
4474 | [&] (block_symbol *bsym) | |
4475 | { return info->add_symbol (bsym); }); | |
b5ec771e | 4476 | search_minsyms_for_name (info, lookup_name, pspace, NULL); |
f8eba3c6 TT |
4477 | } |
4478 | else if (pspace == NULL || pspace == SYMTAB_PSPACE (elt)) | |
4479 | { | |
7243d011 | 4480 | int prev_len = info->result.symbols->size (); |
87186c6a | 4481 | |
f8eba3c6 TT |
4482 | /* Program spaces that are executing startup should have |
4483 | been filtered out earlier. */ | |
4484 | gdb_assert (!SYMTAB_PSPACE (elt)->executing_startup); | |
4485 | set_current_program_space (SYMTAB_PSPACE (elt)); | |
b5ec771e | 4486 | iterate_over_file_blocks (elt, lookup_name, VAR_DOMAIN, |
7e41c8db KS |
4487 | [&] (block_symbol *bsym) |
4488 | { return info->add_symbol (bsym); }); | |
87186c6a MMN |
4489 | |
4490 | /* If no new symbols were found in this iteration and this symtab | |
4491 | is in assembler, we might actually be looking for a label for | |
4492 | which we don't have debug info. Check for a minimal symbol in | |
4493 | this case. */ | |
7243d011 | 4494 | if (prev_len == info->result.symbols->size () |
87186c6a | 4495 | && elt->language == language_asm) |
b5ec771e | 4496 | search_minsyms_for_name (info, lookup_name, pspace, elt); |
f8eba3c6 TT |
4497 | } |
4498 | } | |
0f5238ed TT |
4499 | } |
4500 | ||
14e91ac5 DC |
4501 | \f |
4502 | ||
413dad4d DC |
4503 | /* Now come some functions that are called from multiple places within |
4504 | decode_line_1. */ | |
4505 | ||
f8eba3c6 TT |
4506 | static int |
4507 | symbol_to_sal (struct symtab_and_line *result, | |
4508 | int funfirstline, struct symbol *sym) | |
413dad4d | 4509 | { |
413dad4d | 4510 | if (SYMBOL_CLASS (sym) == LOC_BLOCK) |
50641945 | 4511 | { |
f8eba3c6 TT |
4512 | *result = find_function_start_sal (sym, funfirstline); |
4513 | return 1; | |
50641945 | 4514 | } |
413dad4d DC |
4515 | else |
4516 | { | |
62853458 | 4517 | if (SYMBOL_CLASS (sym) == LOC_LABEL && SYMBOL_VALUE_ADDRESS (sym) != 0) |
413dad4d | 4518 | { |
51abb421 | 4519 | *result = {}; |
08be3fe3 | 4520 | result->symtab = symbol_symtab (sym); |
06871ae8 | 4521 | result->symbol = sym; |
f8eba3c6 TT |
4522 | result->line = SYMBOL_LINE (sym); |
4523 | result->pc = SYMBOL_VALUE_ADDRESS (sym); | |
08be3fe3 | 4524 | result->pspace = SYMTAB_PSPACE (result->symtab); |
f8eba3c6 TT |
4525 | result->explicit_pc = 1; |
4526 | return 1; | |
413dad4d | 4527 | } |
62853458 | 4528 | else if (funfirstline) |
dcf9f4ab | 4529 | { |
f8eba3c6 | 4530 | /* Nothing. */ |
dcf9f4ab | 4531 | } |
62853458 TT |
4532 | else if (SYMBOL_LINE (sym) != 0) |
4533 | { | |
4534 | /* We know its line number. */ | |
51abb421 | 4535 | *result = {}; |
08be3fe3 | 4536 | result->symtab = symbol_symtab (sym); |
06871ae8 | 4537 | result->symbol = sym; |
f8eba3c6 | 4538 | result->line = SYMBOL_LINE (sym); |
e5f25bc5 | 4539 | result->pc = SYMBOL_VALUE_ADDRESS (sym); |
08be3fe3 | 4540 | result->pspace = SYMTAB_PSPACE (result->symtab); |
f8eba3c6 | 4541 | return 1; |
62853458 | 4542 | } |
413dad4d | 4543 | } |
f8eba3c6 TT |
4544 | |
4545 | return 0; | |
413dad4d | 4546 | } |
50641945 | 4547 | |
16e802b9 | 4548 | linespec_result::~linespec_result () |
f8eba3c6 | 4549 | { |
6c5b2ebe PA |
4550 | for (linespec_sals &lsal : lsals) |
4551 | xfree (lsal.canonical); | |
7efd8fc2 | 4552 | } |
87f0e720 KS |
4553 | |
4554 | /* Return the quote characters permitted by the linespec parser. */ | |
4555 | ||
4556 | const char * | |
4557 | get_gdb_linespec_parser_quote_characters (void) | |
4558 | { | |
4559 | return linespec_quote_characters; | |
4560 | } |