Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Parse expressions for GDB. |
c4a172b5 | 2 | |
e2882c85 | 3 | Copyright (C) 1986-2018 Free Software Foundation, Inc. |
c4a172b5 | 4 | |
c906108c SS |
5 | Modified from expread.y by the Department of Computer Science at the |
6 | State University of New York at Buffalo, 1991. | |
7 | ||
c5aa993b | 8 | This file is part of GDB. |
c906108c | 9 | |
c5aa993b JM |
10 | This program is free software; you can redistribute it and/or modify |
11 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 12 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 13 | (at your option) any later version. |
c906108c | 14 | |
c5aa993b JM |
15 | This program is distributed in the hope that it will be useful, |
16 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
17 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
18 | GNU General Public License for more details. | |
c906108c | 19 | |
c5aa993b | 20 | You should have received a copy of the GNU General Public License |
a9762ec7 | 21 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
22 | |
23 | /* Parse an expression from text in a string, | |
ae0c443d | 24 | and return the result as a struct expression pointer. |
c906108c SS |
25 | That structure contains arithmetic operations in reverse polish, |
26 | with constants represented by operations that are followed by special data. | |
27 | See expression.h for the details of the format. | |
28 | What is important here is that it can be built up sequentially | |
29 | during the process of parsing; the lower levels of the tree always | |
30 | come first in the result. */ | |
c5aa993b | 31 | |
c906108c | 32 | #include "defs.h" |
12c89474 | 33 | #include <ctype.h> |
e17c207e | 34 | #include "arch-utils.h" |
c906108c SS |
35 | #include "symtab.h" |
36 | #include "gdbtypes.h" | |
37 | #include "frame.h" | |
38 | #include "expression.h" | |
39 | #include "value.h" | |
40 | #include "command.h" | |
41 | #include "language.h" | |
0b4e1325 | 42 | #include "f-lang.h" |
c906108c SS |
43 | #include "parser-defs.h" |
44 | #include "gdbcmd.h" | |
c5aa993b | 45 | #include "symfile.h" /* for overlay functions */ |
f57d151a | 46 | #include "inferior.h" |
f69fdf9b | 47 | #include "target-float.h" |
fe898f56 | 48 | #include "block.h" |
59f92a09 | 49 | #include "source.h" |
9e35dae4 | 50 | #include "objfiles.h" |
029a67e4 | 51 | #include "user-regs.h" |
325fac50 | 52 | #include <algorithm> |
e3ad2841 | 53 | #include "common/gdb_optional.h" |
e2305d34 | 54 | |
5f9769d1 PH |
55 | /* Standard set of definitions for printing, dumping, prefixifying, |
56 | * and evaluating expressions. */ | |
57 | ||
58 | const struct exp_descriptor exp_descriptor_standard = | |
59 | { | |
60 | print_subexp_standard, | |
61 | operator_length_standard, | |
c0201579 | 62 | operator_check_standard, |
5f9769d1 PH |
63 | op_name_standard, |
64 | dump_subexp_body_standard, | |
65 | evaluate_subexp_standard | |
66 | }; | |
c906108c SS |
67 | \f |
68 | /* Global variables declared in parser-defs.h (and commented there). */ | |
270140bd | 69 | const struct block *expression_context_block; |
84f0252a | 70 | CORE_ADDR expression_context_pc; |
270140bd | 71 | const struct block *innermost_block; |
c906108c | 72 | int arglist_len; |
1a7d0ce4 | 73 | static struct type_stack type_stack; |
d7561cbb KS |
74 | const char *lexptr; |
75 | const char *prev_lexptr; | |
c906108c SS |
76 | int paren_depth; |
77 | int comma_terminates; | |
3a913e29 | 78 | |
155da517 TT |
79 | /* True if parsing an expression to attempt completion. */ |
80 | int parse_completion; | |
65d12d83 TT |
81 | |
82 | /* The index of the last struct expression directly before a '.' or | |
83 | '->'. This is set when parsing and is only used when completing a | |
84 | field name. It is -1 if no dereference operation was found. */ | |
85 | static int expout_last_struct = -1; | |
2f68a895 TT |
86 | |
87 | /* If we are completing a tagged type name, this will be nonzero. */ | |
88 | static enum type_code expout_tag_completion_type = TYPE_CODE_UNDEF; | |
89 | ||
90 | /* The token for tagged type name completion. */ | |
91 | static char *expout_completion_name; | |
92 | ||
c906108c | 93 | \f |
ccce17b0 | 94 | static unsigned int expressiondebug = 0; |
920d2a44 AC |
95 | static void |
96 | show_expressiondebug (struct ui_file *file, int from_tty, | |
97 | struct cmd_list_element *c, const char *value) | |
98 | { | |
99 | fprintf_filtered (file, _("Expression debugging is %s.\n"), value); | |
100 | } | |
c906108c | 101 | |
92981e24 TT |
102 | |
103 | /* Non-zero if an expression parser should set yydebug. */ | |
104 | int parser_debug; | |
105 | ||
106 | static void | |
107 | show_parserdebug (struct ui_file *file, int from_tty, | |
108 | struct cmd_list_element *c, const char *value) | |
109 | { | |
110 | fprintf_filtered (file, _("Parser debugging is %s.\n"), value); | |
111 | } | |
112 | ||
113 | ||
65d12d83 TT |
114 | static int prefixify_subexp (struct expression *, struct expression *, int, |
115 | int); | |
c906108c | 116 | |
4d01a485 PA |
117 | static expression_up parse_exp_in_context (const char **, CORE_ADDR, |
118 | const struct block *, int, | |
119 | int, int *); | |
120 | static expression_up parse_exp_in_context_1 (const char **, CORE_ADDR, | |
121 | const struct block *, int, | |
122 | int, int *); | |
e85c3284 | 123 | |
c906108c SS |
124 | /* Data structure for saving values of arglist_len for function calls whose |
125 | arguments contain other function calls. */ | |
126 | ||
69c1e056 | 127 | static std::vector<int> *funcall_chain; |
c906108c | 128 | |
c906108c SS |
129 | /* Begin counting arguments for a function call, |
130 | saving the data about any containing call. */ | |
131 | ||
132 | void | |
fba45db2 | 133 | start_arglist (void) |
c906108c | 134 | { |
69c1e056 | 135 | funcall_chain->push_back (arglist_len); |
c906108c | 136 | arglist_len = 0; |
c906108c SS |
137 | } |
138 | ||
139 | /* Return the number of arguments in a function call just terminated, | |
140 | and restore the data for the containing function call. */ | |
141 | ||
142 | int | |
fba45db2 | 143 | end_arglist (void) |
c906108c | 144 | { |
f86f5ca3 | 145 | int val = arglist_len; |
69c1e056 TT |
146 | arglist_len = funcall_chain->back (); |
147 | funcall_chain->pop_back (); | |
c906108c SS |
148 | return val; |
149 | } | |
150 | ||
c906108c | 151 | \f |
c906108c | 152 | |
55aa24fb | 153 | /* See definition in parser-defs.h. */ |
2dbca4d6 | 154 | |
e9d9f57e TT |
155 | parser_state::parser_state (size_t initial_size, |
156 | const struct language_defn *lang, | |
157 | struct gdbarch *gdbarch) | |
158 | : expout_size (initial_size), | |
159 | expout (XNEWVAR (expression, | |
160 | (sizeof (expression) | |
161 | + EXP_ELEM_TO_BYTES (expout_size)))), | |
162 | expout_ptr (0) | |
2dbca4d6 | 163 | { |
e9d9f57e TT |
164 | expout->language_defn = lang; |
165 | expout->gdbarch = gdbarch; | |
2dbca4d6 SDJ |
166 | } |
167 | ||
e9d9f57e TT |
168 | expression_up |
169 | parser_state::release () | |
2dbca4d6 SDJ |
170 | { |
171 | /* Record the actual number of expression elements, and then | |
172 | reallocate the expression memory so that we free up any | |
173 | excess elements. */ | |
174 | ||
e9d9f57e TT |
175 | expout->nelts = expout_ptr; |
176 | expout.reset (XRESIZEVAR (expression, expout.release (), | |
177 | (sizeof (expression) | |
178 | + EXP_ELEM_TO_BYTES (expout_ptr)))); | |
179 | ||
180 | return std::move (expout); | |
2dbca4d6 SDJ |
181 | } |
182 | ||
410a0ff2 SDJ |
183 | /* This page contains the functions for adding data to the struct expression |
184 | being constructed. */ | |
185 | ||
c906108c SS |
186 | /* Add one element to the end of the expression. */ |
187 | ||
188 | /* To avoid a bug in the Sun 4 compiler, we pass things that can fit into | |
0df8b418 | 189 | a register through here. */ |
c906108c | 190 | |
ae0c443d | 191 | static void |
410a0ff2 | 192 | write_exp_elt (struct parser_state *ps, const union exp_element *expelt) |
c906108c | 193 | { |
410a0ff2 | 194 | if (ps->expout_ptr >= ps->expout_size) |
c906108c | 195 | { |
410a0ff2 | 196 | ps->expout_size *= 2; |
e9d9f57e TT |
197 | ps->expout.reset (XRESIZEVAR (expression, ps->expout.release (), |
198 | (sizeof (expression) | |
199 | + EXP_ELEM_TO_BYTES (ps->expout_size)))); | |
c906108c | 200 | } |
410a0ff2 | 201 | ps->expout->elts[ps->expout_ptr++] = *expelt; |
c906108c SS |
202 | } |
203 | ||
204 | void | |
410a0ff2 | 205 | write_exp_elt_opcode (struct parser_state *ps, enum exp_opcode expelt) |
c906108c SS |
206 | { |
207 | union exp_element tmp; | |
208 | ||
ad3bbd48 | 209 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c | 210 | tmp.opcode = expelt; |
410a0ff2 | 211 | write_exp_elt (ps, &tmp); |
c906108c SS |
212 | } |
213 | ||
214 | void | |
410a0ff2 | 215 | write_exp_elt_sym (struct parser_state *ps, struct symbol *expelt) |
c906108c SS |
216 | { |
217 | union exp_element tmp; | |
218 | ||
ad3bbd48 | 219 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c | 220 | tmp.symbol = expelt; |
410a0ff2 | 221 | write_exp_elt (ps, &tmp); |
c906108c SS |
222 | } |
223 | ||
74ea4be4 PA |
224 | void |
225 | write_exp_elt_msym (struct parser_state *ps, minimal_symbol *expelt) | |
226 | { | |
227 | union exp_element tmp; | |
228 | ||
229 | memset (&tmp, 0, sizeof (union exp_element)); | |
230 | tmp.msymbol = expelt; | |
231 | write_exp_elt (ps, &tmp); | |
232 | } | |
233 | ||
c906108c | 234 | void |
410a0ff2 | 235 | write_exp_elt_block (struct parser_state *ps, const struct block *b) |
c906108c SS |
236 | { |
237 | union exp_element tmp; | |
ad3bbd48 | 238 | |
09153d55 | 239 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c | 240 | tmp.block = b; |
410a0ff2 | 241 | write_exp_elt (ps, &tmp); |
c906108c SS |
242 | } |
243 | ||
9e35dae4 | 244 | void |
410a0ff2 | 245 | write_exp_elt_objfile (struct parser_state *ps, struct objfile *objfile) |
9e35dae4 DJ |
246 | { |
247 | union exp_element tmp; | |
ad3bbd48 | 248 | |
9e35dae4 DJ |
249 | memset (&tmp, 0, sizeof (union exp_element)); |
250 | tmp.objfile = objfile; | |
410a0ff2 | 251 | write_exp_elt (ps, &tmp); |
9e35dae4 DJ |
252 | } |
253 | ||
c906108c | 254 | void |
410a0ff2 | 255 | write_exp_elt_longcst (struct parser_state *ps, LONGEST expelt) |
c906108c SS |
256 | { |
257 | union exp_element tmp; | |
258 | ||
ad3bbd48 | 259 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c | 260 | tmp.longconst = expelt; |
410a0ff2 | 261 | write_exp_elt (ps, &tmp); |
c906108c SS |
262 | } |
263 | ||
264 | void | |
edd079d9 | 265 | write_exp_elt_floatcst (struct parser_state *ps, const gdb_byte expelt[16]) |
27bc4d80 TJB |
266 | { |
267 | union exp_element tmp; | |
268 | int index; | |
269 | ||
270 | for (index = 0; index < 16; index++) | |
edd079d9 | 271 | tmp.floatconst[index] = expelt[index]; |
27bc4d80 | 272 | |
410a0ff2 | 273 | write_exp_elt (ps, &tmp); |
27bc4d80 TJB |
274 | } |
275 | ||
c906108c | 276 | void |
410a0ff2 | 277 | write_exp_elt_type (struct parser_state *ps, struct type *expelt) |
c906108c SS |
278 | { |
279 | union exp_element tmp; | |
280 | ||
ad3bbd48 | 281 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c | 282 | tmp.type = expelt; |
410a0ff2 | 283 | write_exp_elt (ps, &tmp); |
c906108c SS |
284 | } |
285 | ||
286 | void | |
410a0ff2 | 287 | write_exp_elt_intern (struct parser_state *ps, struct internalvar *expelt) |
c906108c SS |
288 | { |
289 | union exp_element tmp; | |
290 | ||
ad3bbd48 | 291 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c | 292 | tmp.internalvar = expelt; |
410a0ff2 | 293 | write_exp_elt (ps, &tmp); |
c906108c SS |
294 | } |
295 | ||
296 | /* Add a string constant to the end of the expression. | |
297 | ||
298 | String constants are stored by first writing an expression element | |
299 | that contains the length of the string, then stuffing the string | |
300 | constant itself into however many expression elements are needed | |
301 | to hold it, and then writing another expression element that contains | |
0df8b418 | 302 | the length of the string. I.e. an expression element at each end of |
c906108c SS |
303 | the string records the string length, so you can skip over the |
304 | expression elements containing the actual string bytes from either | |
305 | end of the string. Note that this also allows gdb to handle | |
306 | strings with embedded null bytes, as is required for some languages. | |
307 | ||
308 | Don't be fooled by the fact that the string is null byte terminated, | |
bc3b79fd | 309 | this is strictly for the convenience of debugging gdb itself. |
c906108c SS |
310 | Gdb does not depend up the string being null terminated, since the |
311 | actual length is recorded in expression elements at each end of the | |
312 | string. The null byte is taken into consideration when computing how | |
313 | many expression elements are required to hold the string constant, of | |
0df8b418 | 314 | course. */ |
c906108c SS |
315 | |
316 | ||
317 | void | |
410a0ff2 | 318 | write_exp_string (struct parser_state *ps, struct stoken str) |
c906108c | 319 | { |
f86f5ca3 | 320 | int len = str.length; |
410a0ff2 | 321 | size_t lenelt; |
f86f5ca3 | 322 | char *strdata; |
c906108c SS |
323 | |
324 | /* Compute the number of expression elements required to hold the string | |
325 | (including a null byte terminator), along with one expression element | |
326 | at each end to record the actual string length (not including the | |
0df8b418 | 327 | null byte terminator). */ |
c906108c SS |
328 | |
329 | lenelt = 2 + BYTES_TO_EXP_ELEM (len + 1); | |
330 | ||
410a0ff2 | 331 | increase_expout_size (ps, lenelt); |
c906108c SS |
332 | |
333 | /* Write the leading length expression element (which advances the current | |
334 | expression element index), then write the string constant followed by a | |
335 | terminating null byte, and then write the trailing length expression | |
0df8b418 | 336 | element. */ |
c906108c | 337 | |
410a0ff2 SDJ |
338 | write_exp_elt_longcst (ps, (LONGEST) len); |
339 | strdata = (char *) &ps->expout->elts[ps->expout_ptr]; | |
c906108c SS |
340 | memcpy (strdata, str.ptr, len); |
341 | *(strdata + len) = '\0'; | |
410a0ff2 SDJ |
342 | ps->expout_ptr += lenelt - 2; |
343 | write_exp_elt_longcst (ps, (LONGEST) len); | |
c906108c SS |
344 | } |
345 | ||
6c7a06a3 TT |
346 | /* Add a vector of string constants to the end of the expression. |
347 | ||
348 | This adds an OP_STRING operation, but encodes the contents | |
349 | differently from write_exp_string. The language is expected to | |
350 | handle evaluation of this expression itself. | |
351 | ||
352 | After the usual OP_STRING header, TYPE is written into the | |
353 | expression as a long constant. The interpretation of this field is | |
354 | up to the language evaluator. | |
355 | ||
356 | Next, each string in VEC is written. The length is written as a | |
357 | long constant, followed by the contents of the string. */ | |
358 | ||
359 | void | |
410a0ff2 SDJ |
360 | write_exp_string_vector (struct parser_state *ps, int type, |
361 | struct stoken_vector *vec) | |
6c7a06a3 | 362 | { |
410a0ff2 SDJ |
363 | int i, len; |
364 | size_t n_slots; | |
6c7a06a3 TT |
365 | |
366 | /* Compute the size. We compute the size in number of slots to | |
367 | avoid issues with string padding. */ | |
368 | n_slots = 0; | |
369 | for (i = 0; i < vec->len; ++i) | |
370 | { | |
371 | /* One slot for the length of this element, plus the number of | |
372 | slots needed for this string. */ | |
373 | n_slots += 1 + BYTES_TO_EXP_ELEM (vec->tokens[i].length); | |
374 | } | |
375 | ||
376 | /* One more slot for the type of the string. */ | |
377 | ++n_slots; | |
378 | ||
379 | /* Now compute a phony string length. */ | |
380 | len = EXP_ELEM_TO_BYTES (n_slots) - 1; | |
381 | ||
382 | n_slots += 4; | |
410a0ff2 | 383 | increase_expout_size (ps, n_slots); |
6c7a06a3 | 384 | |
410a0ff2 SDJ |
385 | write_exp_elt_opcode (ps, OP_STRING); |
386 | write_exp_elt_longcst (ps, len); | |
387 | write_exp_elt_longcst (ps, type); | |
6c7a06a3 TT |
388 | |
389 | for (i = 0; i < vec->len; ++i) | |
390 | { | |
410a0ff2 SDJ |
391 | write_exp_elt_longcst (ps, vec->tokens[i].length); |
392 | memcpy (&ps->expout->elts[ps->expout_ptr], vec->tokens[i].ptr, | |
6c7a06a3 | 393 | vec->tokens[i].length); |
410a0ff2 | 394 | ps->expout_ptr += BYTES_TO_EXP_ELEM (vec->tokens[i].length); |
6c7a06a3 TT |
395 | } |
396 | ||
410a0ff2 SDJ |
397 | write_exp_elt_longcst (ps, len); |
398 | write_exp_elt_opcode (ps, OP_STRING); | |
6c7a06a3 TT |
399 | } |
400 | ||
c906108c SS |
401 | /* Add a bitstring constant to the end of the expression. |
402 | ||
403 | Bitstring constants are stored by first writing an expression element | |
404 | that contains the length of the bitstring (in bits), then stuffing the | |
405 | bitstring constant itself into however many expression elements are | |
406 | needed to hold it, and then writing another expression element that | |
0df8b418 | 407 | contains the length of the bitstring. I.e. an expression element at |
c906108c SS |
408 | each end of the bitstring records the bitstring length, so you can skip |
409 | over the expression elements containing the actual bitstring bytes from | |
0df8b418 | 410 | either end of the bitstring. */ |
c906108c SS |
411 | |
412 | void | |
410a0ff2 | 413 | write_exp_bitstring (struct parser_state *ps, struct stoken str) |
c906108c | 414 | { |
f86f5ca3 PH |
415 | int bits = str.length; /* length in bits */ |
416 | int len = (bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; | |
410a0ff2 | 417 | size_t lenelt; |
f86f5ca3 | 418 | char *strdata; |
c906108c SS |
419 | |
420 | /* Compute the number of expression elements required to hold the bitstring, | |
421 | along with one expression element at each end to record the actual | |
0df8b418 | 422 | bitstring length in bits. */ |
c906108c SS |
423 | |
424 | lenelt = 2 + BYTES_TO_EXP_ELEM (len); | |
425 | ||
410a0ff2 | 426 | increase_expout_size (ps, lenelt); |
c906108c SS |
427 | |
428 | /* Write the leading length expression element (which advances the current | |
429 | expression element index), then write the bitstring constant, and then | |
0df8b418 | 430 | write the trailing length expression element. */ |
c906108c | 431 | |
410a0ff2 SDJ |
432 | write_exp_elt_longcst (ps, (LONGEST) bits); |
433 | strdata = (char *) &ps->expout->elts[ps->expout_ptr]; | |
c906108c | 434 | memcpy (strdata, str.ptr, len); |
410a0ff2 SDJ |
435 | ps->expout_ptr += lenelt - 2; |
436 | write_exp_elt_longcst (ps, (LONGEST) bits); | |
c906108c SS |
437 | } |
438 | ||
74ea4be4 PA |
439 | /* Return the type of MSYMBOL, a minimal symbol of OBJFILE. If |
440 | ADDRESS_P is not NULL, set it to the MSYMBOL's resolved | |
441 | address. */ | |
c906108c | 442 | |
74ea4be4 PA |
443 | type * |
444 | find_minsym_type_and_address (minimal_symbol *msymbol, | |
445 | struct objfile *objfile, | |
446 | CORE_ADDR *address_p) | |
c906108c | 447 | { |
74ea4be4 | 448 | bound_minimal_symbol bound_msym = {msymbol, objfile}; |
bccdca4a | 449 | struct gdbarch *gdbarch = get_objfile_arch (objfile); |
efd66ac6 | 450 | struct obj_section *section = MSYMBOL_OBJ_SECTION (objfile, msymbol); |
712f90be | 451 | enum minimal_symbol_type type = MSYMBOL_TYPE (msymbol); |
bccdca4a UW |
452 | CORE_ADDR pc; |
453 | ||
fbd1b771 JK |
454 | bool is_tls = (section != NULL |
455 | && section->the_bfd_section->flags & SEC_THREAD_LOCAL); | |
456 | ||
457 | /* Addresses of TLS symbols are really offsets into a | |
458 | per-objfile/per-thread storage block. */ | |
459 | CORE_ADDR addr = (is_tls | |
460 | ? MSYMBOL_VALUE_RAW_ADDRESS (bound_msym.minsym) | |
461 | : BMSYMBOL_VALUE_ADDRESS (bound_msym)); | |
462 | ||
bccdca4a UW |
463 | /* The minimal symbol might point to a function descriptor; |
464 | resolve it to the actual code address instead. */ | |
465 | pc = gdbarch_convert_from_func_ptr_addr (gdbarch, addr, ¤t_target); | |
466 | if (pc != addr) | |
467 | { | |
7cbd4a93 | 468 | struct bound_minimal_symbol ifunc_msym = lookup_minimal_symbol_by_pc (pc); |
0875794a | 469 | |
bccdca4a UW |
470 | /* In this case, assume we have a code symbol instead of |
471 | a data symbol. */ | |
0875794a | 472 | |
7cbd4a93 TT |
473 | if (ifunc_msym.minsym != NULL |
474 | && MSYMBOL_TYPE (ifunc_msym.minsym) == mst_text_gnu_ifunc | |
77e371c0 | 475 | && BMSYMBOL_VALUE_ADDRESS (ifunc_msym) == pc) |
0875794a JK |
476 | { |
477 | /* A function descriptor has been resolved but PC is still in the | |
478 | STT_GNU_IFUNC resolver body (such as because inferior does not | |
479 | run to be able to call it). */ | |
480 | ||
481 | type = mst_text_gnu_ifunc; | |
482 | } | |
483 | else | |
484 | type = mst_text; | |
714835d5 | 485 | section = NULL; |
bccdca4a UW |
486 | addr = pc; |
487 | } | |
488 | ||
489 | if (overlay_debugging) | |
714835d5 | 490 | addr = symbol_overlayed_address (addr, section); |
c906108c | 491 | |
fbd1b771 | 492 | if (is_tls) |
9e35dae4 | 493 | { |
74ea4be4 PA |
494 | /* Skip translation if caller does not need the address. */ |
495 | if (address_p != NULL) | |
496 | *address_p = target_translate_tls_address (objfile, addr); | |
497 | return objfile_type (objfile)->nodebug_tls_symbol; | |
9e35dae4 DJ |
498 | } |
499 | ||
74ea4be4 PA |
500 | if (address_p != NULL) |
501 | *address_p = addr; | |
502 | ||
bccdca4a | 503 | switch (type) |
c906108c SS |
504 | { |
505 | case mst_text: | |
506 | case mst_file_text: | |
507 | case mst_solib_trampoline: | |
74ea4be4 | 508 | return objfile_type (objfile)->nodebug_text_symbol; |
c906108c | 509 | |
0875794a | 510 | case mst_text_gnu_ifunc: |
74ea4be4 | 511 | return objfile_type (objfile)->nodebug_text_gnu_ifunc_symbol; |
0875794a | 512 | |
c906108c SS |
513 | case mst_data: |
514 | case mst_file_data: | |
515 | case mst_bss: | |
516 | case mst_file_bss: | |
74ea4be4 | 517 | return objfile_type (objfile)->nodebug_data_symbol; |
c906108c | 518 | |
0875794a | 519 | case mst_slot_got_plt: |
74ea4be4 | 520 | return objfile_type (objfile)->nodebug_got_plt_symbol; |
0875794a | 521 | |
c906108c | 522 | default: |
74ea4be4 | 523 | return objfile_type (objfile)->nodebug_unknown_symbol; |
c906108c | 524 | } |
74ea4be4 PA |
525 | } |
526 | ||
527 | /* Add the appropriate elements for a minimal symbol to the end of | |
528 | the expression. */ | |
529 | ||
530 | void | |
531 | write_exp_msymbol (struct parser_state *ps, | |
532 | struct bound_minimal_symbol bound_msym) | |
533 | { | |
534 | write_exp_elt_opcode (ps, OP_VAR_MSYM_VALUE); | |
535 | write_exp_elt_objfile (ps, bound_msym.objfile); | |
536 | write_exp_elt_msym (ps, bound_msym.minsym); | |
537 | write_exp_elt_opcode (ps, OP_VAR_MSYM_VALUE); | |
c906108c | 538 | } |
65d12d83 TT |
539 | |
540 | /* Mark the current index as the starting location of a structure | |
541 | expression. This is used when completing on field names. */ | |
542 | ||
543 | void | |
410a0ff2 | 544 | mark_struct_expression (struct parser_state *ps) |
65d12d83 | 545 | { |
2f68a895 TT |
546 | gdb_assert (parse_completion |
547 | && expout_tag_completion_type == TYPE_CODE_UNDEF); | |
410a0ff2 | 548 | expout_last_struct = ps->expout_ptr; |
65d12d83 TT |
549 | } |
550 | ||
2f68a895 TT |
551 | /* Indicate that the current parser invocation is completing a tag. |
552 | TAG is the type code of the tag, and PTR and LENGTH represent the | |
553 | start of the tag name. */ | |
554 | ||
555 | void | |
556 | mark_completion_tag (enum type_code tag, const char *ptr, int length) | |
557 | { | |
558 | gdb_assert (parse_completion | |
559 | && expout_tag_completion_type == TYPE_CODE_UNDEF | |
560 | && expout_completion_name == NULL | |
561 | && expout_last_struct == -1); | |
562 | gdb_assert (tag == TYPE_CODE_UNION | |
563 | || tag == TYPE_CODE_STRUCT | |
2f68a895 TT |
564 | || tag == TYPE_CODE_ENUM); |
565 | expout_tag_completion_type = tag; | |
224c3ddb | 566 | expout_completion_name = (char *) xmalloc (length + 1); |
2f68a895 TT |
567 | memcpy (expout_completion_name, ptr, length); |
568 | expout_completion_name[length] = '\0'; | |
569 | } | |
570 | ||
c906108c SS |
571 | \f |
572 | /* Recognize tokens that start with '$'. These include: | |
573 | ||
c5aa993b JM |
574 | $regname A native register name or a "standard |
575 | register name". | |
c906108c | 576 | |
c5aa993b JM |
577 | $variable A convenience variable with a name chosen |
578 | by the user. | |
c906108c | 579 | |
c5aa993b JM |
580 | $digits Value history with index <digits>, starting |
581 | from the first value which has index 1. | |
c906108c | 582 | |
c5aa993b | 583 | $$digits Value history with index <digits> relative |
0df8b418 | 584 | to the last value. I.e. $$0 is the last |
c5aa993b JM |
585 | value, $$1 is the one previous to that, $$2 |
586 | is the one previous to $$1, etc. | |
c906108c | 587 | |
c5aa993b | 588 | $ | $0 | $$0 The last value in the value history. |
c906108c | 589 | |
c5aa993b | 590 | $$ An abbreviation for the second to the last |
0df8b418 | 591 | value in the value history, I.e. $$1 */ |
c906108c SS |
592 | |
593 | void | |
410a0ff2 | 594 | write_dollar_variable (struct parser_state *ps, struct stoken str) |
c906108c | 595 | { |
d12307c1 | 596 | struct block_symbol sym; |
7c7b6655 | 597 | struct bound_minimal_symbol msym; |
c4a3d09a | 598 | struct internalvar *isym = NULL; |
d7318818 | 599 | |
c906108c | 600 | /* Handle the tokens $digits; also $ (short for $0) and $$ (short for $$1) |
0df8b418 | 601 | and $$digits (equivalent to $<-digits> if you could type that). */ |
c906108c | 602 | |
c906108c SS |
603 | int negate = 0; |
604 | int i = 1; | |
605 | /* Double dollar means negate the number and add -1 as well. | |
606 | Thus $$ alone means -1. */ | |
607 | if (str.length >= 2 && str.ptr[1] == '$') | |
608 | { | |
609 | negate = 1; | |
610 | i = 2; | |
611 | } | |
612 | if (i == str.length) | |
613 | { | |
0df8b418 | 614 | /* Just dollars (one or two). */ |
c5aa993b | 615 | i = -negate; |
c906108c SS |
616 | goto handle_last; |
617 | } | |
618 | /* Is the rest of the token digits? */ | |
619 | for (; i < str.length; i++) | |
620 | if (!(str.ptr[i] >= '0' && str.ptr[i] <= '9')) | |
621 | break; | |
622 | if (i == str.length) | |
623 | { | |
624 | i = atoi (str.ptr + 1 + negate); | |
625 | if (negate) | |
c5aa993b | 626 | i = -i; |
c906108c SS |
627 | goto handle_last; |
628 | } | |
c5aa993b | 629 | |
c906108c SS |
630 | /* Handle tokens that refer to machine registers: |
631 | $ followed by a register name. */ | |
410a0ff2 | 632 | i = user_reg_map_name_to_regnum (parse_gdbarch (ps), |
029a67e4 | 633 | str.ptr + 1, str.length - 1); |
c5aa993b | 634 | if (i >= 0) |
c906108c SS |
635 | goto handle_register; |
636 | ||
c4a3d09a MF |
637 | /* Any names starting with $ are probably debugger internal variables. */ |
638 | ||
639 | isym = lookup_only_internalvar (copy_name (str) + 1); | |
640 | if (isym) | |
641 | { | |
410a0ff2 SDJ |
642 | write_exp_elt_opcode (ps, OP_INTERNALVAR); |
643 | write_exp_elt_intern (ps, isym); | |
644 | write_exp_elt_opcode (ps, OP_INTERNALVAR); | |
c4a3d09a MF |
645 | return; |
646 | } | |
647 | ||
d7318818 | 648 | /* On some systems, such as HP-UX and hppa-linux, certain system routines |
0df8b418 | 649 | have names beginning with $ or $$. Check for those, first. */ |
d7318818 RC |
650 | |
651 | sym = lookup_symbol (copy_name (str), (struct block *) NULL, | |
1993b719 | 652 | VAR_DOMAIN, NULL); |
d12307c1 | 653 | if (sym.symbol) |
d7318818 | 654 | { |
410a0ff2 | 655 | write_exp_elt_opcode (ps, OP_VAR_VALUE); |
d12307c1 PMR |
656 | write_exp_elt_block (ps, sym.block); |
657 | write_exp_elt_sym (ps, sym.symbol); | |
410a0ff2 | 658 | write_exp_elt_opcode (ps, OP_VAR_VALUE); |
d7318818 RC |
659 | return; |
660 | } | |
7c7b6655 TT |
661 | msym = lookup_bound_minimal_symbol (copy_name (str)); |
662 | if (msym.minsym) | |
c906108c | 663 | { |
410a0ff2 | 664 | write_exp_msymbol (ps, msym); |
d7318818 | 665 | return; |
c906108c | 666 | } |
c5aa993b | 667 | |
c4a3d09a | 668 | /* Any other names are assumed to be debugger internal variables. */ |
c906108c | 669 | |
410a0ff2 SDJ |
670 | write_exp_elt_opcode (ps, OP_INTERNALVAR); |
671 | write_exp_elt_intern (ps, create_internalvar (copy_name (str) + 1)); | |
672 | write_exp_elt_opcode (ps, OP_INTERNALVAR); | |
c906108c | 673 | return; |
c5aa993b | 674 | handle_last: |
410a0ff2 SDJ |
675 | write_exp_elt_opcode (ps, OP_LAST); |
676 | write_exp_elt_longcst (ps, (LONGEST) i); | |
677 | write_exp_elt_opcode (ps, OP_LAST); | |
c906108c | 678 | return; |
c5aa993b | 679 | handle_register: |
410a0ff2 | 680 | write_exp_elt_opcode (ps, OP_REGISTER); |
67f3407f DJ |
681 | str.length--; |
682 | str.ptr++; | |
410a0ff2 SDJ |
683 | write_exp_string (ps, str); |
684 | write_exp_elt_opcode (ps, OP_REGISTER); | |
c906108c SS |
685 | return; |
686 | } | |
687 | ||
688 | ||
d7561cbb KS |
689 | const char * |
690 | find_template_name_end (const char *p) | |
c906108c SS |
691 | { |
692 | int depth = 1; | |
693 | int just_seen_right = 0; | |
694 | int just_seen_colon = 0; | |
695 | int just_seen_space = 0; | |
c5aa993b | 696 | |
c906108c SS |
697 | if (!p || (*p != '<')) |
698 | return 0; | |
699 | ||
700 | while (*++p) | |
701 | { | |
702 | switch (*p) | |
c5aa993b JM |
703 | { |
704 | case '\'': | |
705 | case '\"': | |
706 | case '{': | |
707 | case '}': | |
0df8b418 | 708 | /* In future, may want to allow these?? */ |
c5aa993b JM |
709 | return 0; |
710 | case '<': | |
711 | depth++; /* start nested template */ | |
712 | if (just_seen_colon || just_seen_right || just_seen_space) | |
713 | return 0; /* but not after : or :: or > or space */ | |
714 | break; | |
715 | case '>': | |
716 | if (just_seen_colon || just_seen_right) | |
717 | return 0; /* end a (nested?) template */ | |
718 | just_seen_right = 1; /* but not after : or :: */ | |
719 | if (--depth == 0) /* also disallow >>, insist on > > */ | |
720 | return ++p; /* if outermost ended, return */ | |
721 | break; | |
722 | case ':': | |
723 | if (just_seen_space || (just_seen_colon > 1)) | |
724 | return 0; /* nested class spec coming up */ | |
725 | just_seen_colon++; /* we allow :: but not :::: */ | |
726 | break; | |
727 | case ' ': | |
728 | break; | |
729 | default: | |
730 | if (!((*p >= 'a' && *p <= 'z') || /* allow token chars */ | |
731 | (*p >= 'A' && *p <= 'Z') || | |
732 | (*p >= '0' && *p <= '9') || | |
733 | (*p == '_') || (*p == ',') || /* commas for template args */ | |
734 | (*p == '&') || (*p == '*') || /* pointer and ref types */ | |
735 | (*p == '(') || (*p == ')') || /* function types */ | |
736 | (*p == '[') || (*p == ']'))) /* array types */ | |
737 | return 0; | |
738 | } | |
c906108c | 739 | if (*p != ' ') |
c5aa993b | 740 | just_seen_space = 0; |
c906108c | 741 | if (*p != ':') |
c5aa993b | 742 | just_seen_colon = 0; |
c906108c | 743 | if (*p != '>') |
c5aa993b | 744 | just_seen_right = 0; |
c906108c SS |
745 | } |
746 | return 0; | |
747 | } | |
c5aa993b | 748 | \f |
c906108c | 749 | |
1a4eeb98 | 750 | /* Return a null-terminated temporary copy of the name of a string token. |
c906108c | 751 | |
1a4eeb98 DE |
752 | Tokens that refer to names do so with explicit pointer and length, |
753 | so they can share the storage that lexptr is parsing. | |
754 | When it is necessary to pass a name to a function that expects | |
755 | a null-terminated string, the substring is copied out | |
756 | into a separate block of storage. | |
757 | ||
758 | N.B. A single buffer is reused on each call. */ | |
c906108c SS |
759 | |
760 | char * | |
fba45db2 | 761 | copy_name (struct stoken token) |
c906108c | 762 | { |
1a4eeb98 DE |
763 | /* A temporary buffer for identifiers, so we can null-terminate them. |
764 | We allocate this with xrealloc. parse_exp_1 used to allocate with | |
765 | alloca, using the size of the whole expression as a conservative | |
766 | estimate of the space needed. However, macro expansion can | |
767 | introduce names longer than the original expression; there's no | |
768 | practical way to know beforehand how large that might be. */ | |
769 | static char *namecopy; | |
770 | static size_t namecopy_size; | |
771 | ||
3a913e29 JB |
772 | /* Make sure there's enough space for the token. */ |
773 | if (namecopy_size < token.length + 1) | |
774 | { | |
775 | namecopy_size = token.length + 1; | |
224c3ddb | 776 | namecopy = (char *) xrealloc (namecopy, token.length + 1); |
3a913e29 JB |
777 | } |
778 | ||
c906108c SS |
779 | memcpy (namecopy, token.ptr, token.length); |
780 | namecopy[token.length] = 0; | |
3a913e29 | 781 | |
c906108c SS |
782 | return namecopy; |
783 | } | |
784 | \f | |
55aa24fb SDJ |
785 | |
786 | /* See comments on parser-defs.h. */ | |
787 | ||
788 | int | |
f86f5ca3 | 789 | prefixify_expression (struct expression *expr) |
c906108c | 790 | { |
df2a60d0 | 791 | int len = sizeof (struct expression) + EXP_ELEM_TO_BYTES (expr->nelts); |
f86f5ca3 PH |
792 | struct expression *temp; |
793 | int inpos = expr->nelts, outpos = 0; | |
c906108c SS |
794 | |
795 | temp = (struct expression *) alloca (len); | |
796 | ||
797 | /* Copy the original expression into temp. */ | |
798 | memcpy (temp, expr, len); | |
799 | ||
65d12d83 | 800 | return prefixify_subexp (temp, expr, inpos, outpos); |
c906108c SS |
801 | } |
802 | ||
24daaebc PH |
803 | /* Return the number of exp_elements in the postfix subexpression |
804 | of EXPR whose operator is at index ENDPOS - 1 in EXPR. */ | |
c906108c | 805 | |
cf81cf60 | 806 | static int |
f86f5ca3 | 807 | length_of_subexp (struct expression *expr, int endpos) |
24daaebc | 808 | { |
6b4398f7 | 809 | int oplen, args; |
24daaebc PH |
810 | |
811 | operator_length (expr, endpos, &oplen, &args); | |
812 | ||
813 | while (args > 0) | |
814 | { | |
815 | oplen += length_of_subexp (expr, endpos - oplen); | |
816 | args--; | |
817 | } | |
818 | ||
819 | return oplen; | |
820 | } | |
821 | ||
822 | /* Sets *OPLENP to the length of the operator whose (last) index is | |
823 | ENDPOS - 1 in EXPR, and sets *ARGSP to the number of arguments that | |
824 | operator takes. */ | |
825 | ||
826 | void | |
554794dc SDJ |
827 | operator_length (const struct expression *expr, int endpos, int *oplenp, |
828 | int *argsp) | |
5f9769d1 PH |
829 | { |
830 | expr->language_defn->la_exp_desc->operator_length (expr, endpos, | |
831 | oplenp, argsp); | |
832 | } | |
833 | ||
834 | /* Default value for operator_length in exp_descriptor vectors. */ | |
835 | ||
836 | void | |
554794dc | 837 | operator_length_standard (const struct expression *expr, int endpos, |
5f9769d1 | 838 | int *oplenp, int *argsp) |
c906108c | 839 | { |
f86f5ca3 PH |
840 | int oplen = 1; |
841 | int args = 0; | |
01739a3b | 842 | enum range_type range_type; |
f86f5ca3 | 843 | int i; |
c906108c SS |
844 | |
845 | if (endpos < 1) | |
8a3fe4f8 | 846 | error (_("?error in operator_length_standard")); |
c906108c SS |
847 | |
848 | i = (int) expr->elts[endpos - 1].opcode; | |
849 | ||
850 | switch (i) | |
851 | { | |
852 | /* C++ */ | |
853 | case OP_SCOPE: | |
854 | oplen = longest_to_int (expr->elts[endpos - 2].longconst); | |
855 | oplen = 5 + BYTES_TO_EXP_ELEM (oplen + 1); | |
856 | break; | |
857 | ||
858 | case OP_LONG: | |
edd079d9 | 859 | case OP_FLOAT: |
c906108c | 860 | case OP_VAR_VALUE: |
74ea4be4 | 861 | case OP_VAR_MSYM_VALUE: |
c906108c SS |
862 | oplen = 4; |
863 | break; | |
864 | ||
858be34c PA |
865 | case OP_FUNC_STATIC_VAR: |
866 | oplen = longest_to_int (expr->elts[endpos - 2].longconst); | |
867 | oplen = 4 + BYTES_TO_EXP_ELEM (oplen + 1); | |
868 | args = 1; | |
869 | break; | |
870 | ||
c906108c SS |
871 | case OP_TYPE: |
872 | case OP_BOOL: | |
873 | case OP_LAST: | |
c906108c | 874 | case OP_INTERNALVAR: |
36b11add | 875 | case OP_VAR_ENTRY_VALUE: |
c906108c SS |
876 | oplen = 3; |
877 | break; | |
878 | ||
879 | case OP_COMPLEX: | |
c806c55a | 880 | oplen = 3; |
c906108c | 881 | args = 2; |
c5aa993b | 882 | break; |
c906108c SS |
883 | |
884 | case OP_FUNCALL: | |
885 | case OP_F77_UNDETERMINED_ARGLIST: | |
886 | oplen = 3; | |
887 | args = 1 + longest_to_int (expr->elts[endpos - 2].longconst); | |
888 | break; | |
889 | ||
072bba3b | 890 | case TYPE_INSTANCE: |
3693fdb3 | 891 | oplen = 5 + longest_to_int (expr->elts[endpos - 2].longconst); |
072bba3b KS |
892 | args = 1; |
893 | break; | |
894 | ||
0df8b418 | 895 | case OP_OBJC_MSGCALL: /* Objective C message (method) call. */ |
53c551b7 AF |
896 | oplen = 4; |
897 | args = 1 + longest_to_int (expr->elts[endpos - 2].longconst); | |
898 | break; | |
899 | ||
c906108c SS |
900 | case UNOP_MAX: |
901 | case UNOP_MIN: | |
902 | oplen = 3; | |
903 | break; | |
904 | ||
9eaf6705 | 905 | case UNOP_CAST_TYPE: |
4e8f195d TT |
906 | case UNOP_DYNAMIC_CAST: |
907 | case UNOP_REINTERPRET_CAST: | |
9eaf6705 TT |
908 | case UNOP_MEMVAL_TYPE: |
909 | oplen = 1; | |
910 | args = 2; | |
911 | break; | |
912 | ||
913 | case BINOP_VAL: | |
914 | case UNOP_CAST: | |
c5aa993b | 915 | case UNOP_MEMVAL: |
c906108c SS |
916 | oplen = 3; |
917 | args = 1; | |
918 | break; | |
919 | ||
920 | case UNOP_ABS: | |
921 | case UNOP_CAP: | |
922 | case UNOP_CHR: | |
923 | case UNOP_FLOAT: | |
924 | case UNOP_HIGH: | |
925 | case UNOP_ODD: | |
926 | case UNOP_ORD: | |
927 | case UNOP_TRUNC: | |
608b4967 TT |
928 | case OP_TYPEOF: |
929 | case OP_DECLTYPE: | |
6e72ca20 | 930 | case OP_TYPEID: |
c906108c SS |
931 | oplen = 1; |
932 | args = 1; | |
933 | break; | |
934 | ||
7322dca9 SW |
935 | case OP_ADL_FUNC: |
936 | oplen = longest_to_int (expr->elts[endpos - 2].longconst); | |
937 | oplen = 4 + BYTES_TO_EXP_ELEM (oplen + 1); | |
938 | oplen++; | |
939 | oplen++; | |
940 | break; | |
941 | ||
c906108c SS |
942 | case STRUCTOP_STRUCT: |
943 | case STRUCTOP_PTR: | |
944 | args = 1; | |
945 | /* fall through */ | |
67f3407f | 946 | case OP_REGISTER: |
c906108c SS |
947 | case OP_M2_STRING: |
948 | case OP_STRING: | |
3e43a32a | 949 | case OP_OBJC_NSSTRING: /* Objective C Foundation Class |
0df8b418 MS |
950 | NSString constant. */ |
951 | case OP_OBJC_SELECTOR: /* Objective C "@selector" pseudo-op. */ | |
c906108c | 952 | case OP_NAME: |
c906108c SS |
953 | oplen = longest_to_int (expr->elts[endpos - 2].longconst); |
954 | oplen = 4 + BYTES_TO_EXP_ELEM (oplen + 1); | |
955 | break; | |
956 | ||
c906108c SS |
957 | case OP_ARRAY: |
958 | oplen = 4; | |
959 | args = longest_to_int (expr->elts[endpos - 2].longconst); | |
960 | args -= longest_to_int (expr->elts[endpos - 3].longconst); | |
961 | args += 1; | |
962 | break; | |
963 | ||
964 | case TERNOP_COND: | |
965 | case TERNOP_SLICE: | |
c906108c SS |
966 | args = 3; |
967 | break; | |
968 | ||
969 | /* Modula-2 */ | |
c5aa993b | 970 | case MULTI_SUBSCRIPT: |
c906108c | 971 | oplen = 3; |
c5aa993b | 972 | args = 1 + longest_to_int (expr->elts[endpos - 2].longconst); |
c906108c SS |
973 | break; |
974 | ||
975 | case BINOP_ASSIGN_MODIFY: | |
976 | oplen = 3; | |
977 | args = 2; | |
978 | break; | |
979 | ||
980 | /* C++ */ | |
981 | case OP_THIS: | |
982 | oplen = 2; | |
983 | break; | |
984 | ||
01739a3b | 985 | case OP_RANGE: |
0b4e1325 | 986 | oplen = 3; |
01739a3b | 987 | range_type = (enum range_type) |
aead7601 | 988 | longest_to_int (expr->elts[endpos - 2].longconst); |
0b4e1325 | 989 | |
0b4e1325 WZ |
990 | switch (range_type) |
991 | { | |
992 | case LOW_BOUND_DEFAULT: | |
993 | case HIGH_BOUND_DEFAULT: | |
994 | args = 1; | |
995 | break; | |
996 | case BOTH_BOUND_DEFAULT: | |
997 | args = 0; | |
998 | break; | |
999 | case NONE_BOUND_DEFAULT: | |
1000 | args = 2; | |
1001 | break; | |
1002 | } | |
1003 | ||
1004 | break; | |
1005 | ||
c906108c SS |
1006 | default: |
1007 | args = 1 + (i < (int) BINOP_END); | |
1008 | } | |
1009 | ||
24daaebc PH |
1010 | *oplenp = oplen; |
1011 | *argsp = args; | |
c906108c SS |
1012 | } |
1013 | ||
1014 | /* Copy the subexpression ending just before index INEND in INEXPR | |
1015 | into OUTEXPR, starting at index OUTBEG. | |
65d12d83 TT |
1016 | In the process, convert it from suffix to prefix form. |
1017 | If EXPOUT_LAST_STRUCT is -1, then this function always returns -1. | |
1018 | Otherwise, it returns the index of the subexpression which is the | |
1019 | left-hand-side of the expression at EXPOUT_LAST_STRUCT. */ | |
c906108c | 1020 | |
65d12d83 | 1021 | static int |
f86f5ca3 PH |
1022 | prefixify_subexp (struct expression *inexpr, |
1023 | struct expression *outexpr, int inend, int outbeg) | |
c906108c | 1024 | { |
24daaebc PH |
1025 | int oplen; |
1026 | int args; | |
f86f5ca3 | 1027 | int i; |
c906108c | 1028 | int *arglens; |
65d12d83 | 1029 | int result = -1; |
c906108c | 1030 | |
24daaebc | 1031 | operator_length (inexpr, inend, &oplen, &args); |
c906108c SS |
1032 | |
1033 | /* Copy the final operator itself, from the end of the input | |
1034 | to the beginning of the output. */ | |
1035 | inend -= oplen; | |
1036 | memcpy (&outexpr->elts[outbeg], &inexpr->elts[inend], | |
1037 | EXP_ELEM_TO_BYTES (oplen)); | |
1038 | outbeg += oplen; | |
1039 | ||
65d12d83 TT |
1040 | if (expout_last_struct == inend) |
1041 | result = outbeg - oplen; | |
1042 | ||
c906108c SS |
1043 | /* Find the lengths of the arg subexpressions. */ |
1044 | arglens = (int *) alloca (args * sizeof (int)); | |
1045 | for (i = args - 1; i >= 0; i--) | |
1046 | { | |
1047 | oplen = length_of_subexp (inexpr, inend); | |
1048 | arglens[i] = oplen; | |
1049 | inend -= oplen; | |
1050 | } | |
1051 | ||
1052 | /* Now copy each subexpression, preserving the order of | |
1053 | the subexpressions, but prefixifying each one. | |
1054 | In this loop, inend starts at the beginning of | |
1055 | the expression this level is working on | |
1056 | and marches forward over the arguments. | |
1057 | outbeg does similarly in the output. */ | |
1058 | for (i = 0; i < args; i++) | |
1059 | { | |
65d12d83 | 1060 | int r; |
ad3bbd48 | 1061 | |
c906108c SS |
1062 | oplen = arglens[i]; |
1063 | inend += oplen; | |
65d12d83 TT |
1064 | r = prefixify_subexp (inexpr, outexpr, inend, outbeg); |
1065 | if (r != -1) | |
1066 | { | |
1067 | /* Return immediately. We probably have only parsed a | |
1068 | partial expression, so we don't want to try to reverse | |
1069 | the other operands. */ | |
1070 | return r; | |
1071 | } | |
c906108c SS |
1072 | outbeg += oplen; |
1073 | } | |
65d12d83 TT |
1074 | |
1075 | return result; | |
c906108c SS |
1076 | } |
1077 | \f | |
c906108c | 1078 | /* Read an expression from the string *STRINGPTR points to, |
ae0c443d | 1079 | parse it, and return a pointer to a struct expression that we malloc. |
c906108c SS |
1080 | Use block BLOCK as the lexical context for variable names; |
1081 | if BLOCK is zero, use the block of the selected stack frame. | |
1082 | Meanwhile, advance *STRINGPTR to point after the expression, | |
1083 | at the first nonwhite character that is not part of the expression | |
1084 | (possibly a null character). | |
1085 | ||
1086 | If COMMA is nonzero, stop if a comma is reached. */ | |
1087 | ||
4d01a485 | 1088 | expression_up |
bbc13ae3 | 1089 | parse_exp_1 (const char **stringptr, CORE_ADDR pc, const struct block *block, |
270140bd | 1090 | int comma) |
6f937416 PA |
1091 | { |
1092 | return parse_exp_in_context (stringptr, pc, block, comma, 0, NULL); | |
1093 | } | |
1094 | ||
4d01a485 | 1095 | static expression_up |
6f937416 PA |
1096 | parse_exp_in_context (const char **stringptr, CORE_ADDR pc, |
1097 | const struct block *block, | |
1098 | int comma, int void_context_p, int *out_subexp) | |
e85c3284 | 1099 | { |
d7561cbb | 1100 | return parse_exp_in_context_1 (stringptr, pc, block, comma, |
6f937416 | 1101 | void_context_p, out_subexp); |
e85c3284 PH |
1102 | } |
1103 | ||
1104 | /* As for parse_exp_1, except that if VOID_CONTEXT_P, then | |
65d12d83 TT |
1105 | no value is expected from the expression. |
1106 | OUT_SUBEXP is set when attempting to complete a field name; in this | |
1107 | case it is set to the index of the subexpression on the | |
1108 | left-hand-side of the struct op. If not doing such completion, it | |
1109 | is left untouched. */ | |
e85c3284 | 1110 | |
4d01a485 | 1111 | static expression_up |
d7561cbb | 1112 | parse_exp_in_context_1 (const char **stringptr, CORE_ADDR pc, |
6f937416 PA |
1113 | const struct block *block, |
1114 | int comma, int void_context_p, int *out_subexp) | |
c906108c | 1115 | { |
0cce5bd9 | 1116 | const struct language_defn *lang = NULL; |
65d12d83 | 1117 | int subexp; |
c906108c SS |
1118 | |
1119 | lexptr = *stringptr; | |
665132f9 | 1120 | prev_lexptr = NULL; |
c906108c SS |
1121 | |
1122 | paren_depth = 0; | |
1a7d0ce4 | 1123 | type_stack.depth = 0; |
65d12d83 | 1124 | expout_last_struct = -1; |
2f68a895 TT |
1125 | expout_tag_completion_type = TYPE_CODE_UNDEF; |
1126 | xfree (expout_completion_name); | |
1127 | expout_completion_name = NULL; | |
c906108c SS |
1128 | |
1129 | comma_terminates = comma; | |
1130 | ||
1131 | if (lexptr == 0 || *lexptr == 0) | |
e2e0b3e5 | 1132 | error_no_arg (_("expression to compute")); |
c906108c | 1133 | |
69c1e056 TT |
1134 | std::vector<int> funcalls; |
1135 | scoped_restore save_funcall_chain = make_scoped_restore (&funcall_chain, | |
1136 | &funcalls); | |
c906108c | 1137 | |
d705c43c | 1138 | expression_context_block = block; |
59f92a09 | 1139 | |
d705c43c PA |
1140 | /* If no context specified, try using the current frame, if any. */ |
1141 | if (!expression_context_block) | |
1142 | expression_context_block = get_selected_block (&expression_context_pc); | |
1bb9788d | 1143 | else if (pc == 0) |
d705c43c | 1144 | expression_context_pc = BLOCK_START (expression_context_block); |
1bb9788d TT |
1145 | else |
1146 | expression_context_pc = pc; | |
59f92a09 | 1147 | |
d705c43c | 1148 | /* Fall back to using the current source static context, if any. */ |
59f92a09 | 1149 | |
d705c43c | 1150 | if (!expression_context_block) |
59f92a09 FF |
1151 | { |
1152 | struct symtab_and_line cursal = get_current_source_symtab_and_line (); | |
1153 | if (cursal.symtab) | |
d705c43c | 1154 | expression_context_block |
439247b6 DE |
1155 | = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (cursal.symtab), |
1156 | STATIC_BLOCK); | |
d705c43c PA |
1157 | if (expression_context_block) |
1158 | expression_context_pc = BLOCK_START (expression_context_block); | |
84f0252a | 1159 | } |
c906108c | 1160 | |
0cce5bd9 JB |
1161 | if (language_mode == language_mode_auto && block != NULL) |
1162 | { | |
1163 | /* Find the language associated to the given context block. | |
1164 | Default to the current language if it can not be determined. | |
1165 | ||
1166 | Note that using the language corresponding to the current frame | |
1167 | can sometimes give unexpected results. For instance, this | |
1168 | routine is often called several times during the inferior | |
1169 | startup phase to re-parse breakpoint expressions after | |
1170 | a new shared library has been loaded. The language associated | |
1171 | to the current frame at this moment is not relevant for | |
0df8b418 | 1172 | the breakpoint. Using it would therefore be silly, so it seems |
0cce5bd9 | 1173 | better to rely on the current language rather than relying on |
0df8b418 | 1174 | the current frame language to parse the expression. That's why |
0cce5bd9 JB |
1175 | we do the following language detection only if the context block |
1176 | has been specifically provided. */ | |
1177 | struct symbol *func = block_linkage_function (block); | |
1178 | ||
1179 | if (func != NULL) | |
1180 | lang = language_def (SYMBOL_LANGUAGE (func)); | |
1181 | if (lang == NULL || lang->la_language == language_unknown) | |
1182 | lang = current_language; | |
1183 | } | |
1184 | else | |
1185 | lang = current_language; | |
1186 | ||
5b12a61c JK |
1187 | /* get_current_arch may reset CURRENT_LANGUAGE via select_frame. |
1188 | While we need CURRENT_LANGUAGE to be set to LANG (for lookup_symbol | |
1189 | and others called from *.y) ensure CURRENT_LANGUAGE gets restored | |
1190 | to the value matching SELECTED_FRAME as set by get_current_arch. */ | |
410a0ff2 | 1191 | |
e9d9f57e | 1192 | parser_state ps (10, lang, get_current_arch ()); |
e3ad2841 TT |
1193 | |
1194 | scoped_restore_current_language lang_saver; | |
5b12a61c | 1195 | set_language (lang->la_language); |
c906108c | 1196 | |
492d29ea | 1197 | TRY |
65d12d83 | 1198 | { |
410a0ff2 | 1199 | if (lang->la_parser (&ps)) |
0cce5bd9 | 1200 | lang->la_error (NULL); |
65d12d83 | 1201 | } |
492d29ea | 1202 | CATCH (except, RETURN_MASK_ALL) |
65d12d83 | 1203 | { |
155da517 | 1204 | if (! parse_completion) |
e9d9f57e | 1205 | throw_exception (except); |
65d12d83 | 1206 | } |
492d29ea | 1207 | END_CATCH |
c906108c | 1208 | |
e9d9f57e TT |
1209 | /* We have to operate on an "expression *", due to la_post_parser, |
1210 | which explains this funny-looking double release. */ | |
1211 | expression_up result = ps.release (); | |
c906108c SS |
1212 | |
1213 | /* Convert expression from postfix form as generated by yacc | |
0df8b418 | 1214 | parser, to a prefix form. */ |
c906108c | 1215 | |
c906108c | 1216 | if (expressiondebug) |
e9d9f57e | 1217 | dump_raw_expression (result.get (), gdb_stdlog, |
24daaebc | 1218 | "before conversion to prefix form"); |
c906108c | 1219 | |
e9d9f57e | 1220 | subexp = prefixify_expression (result.get ()); |
65d12d83 TT |
1221 | if (out_subexp) |
1222 | *out_subexp = subexp; | |
c906108c | 1223 | |
e9d9f57e | 1224 | lang->la_post_parser (&result, void_context_p); |
e85c3284 | 1225 | |
c906108c | 1226 | if (expressiondebug) |
e9d9f57e | 1227 | dump_prefix_expression (result.get (), gdb_stdlog); |
c906108c SS |
1228 | |
1229 | *stringptr = lexptr; | |
e9d9f57e | 1230 | return result; |
c906108c SS |
1231 | } |
1232 | ||
1233 | /* Parse STRING as an expression, and complain if this fails | |
1234 | to use up all of the contents of STRING. */ | |
1235 | ||
4d01a485 | 1236 | expression_up |
bbc13ae3 | 1237 | parse_expression (const char *string) |
c906108c | 1238 | { |
4d01a485 | 1239 | expression_up exp = parse_exp_1 (&string, 0, 0, 0); |
c906108c | 1240 | if (*string) |
8a3fe4f8 | 1241 | error (_("Junk after end of expression.")); |
c906108c SS |
1242 | return exp; |
1243 | } | |
e85c3284 | 1244 | |
429e1e81 JB |
1245 | /* Same as parse_expression, but using the given language (LANG) |
1246 | to parse the expression. */ | |
1247 | ||
4d01a485 | 1248 | expression_up |
429e1e81 JB |
1249 | parse_expression_with_language (const char *string, enum language lang) |
1250 | { | |
e3ad2841 | 1251 | gdb::optional<scoped_restore_current_language> lang_saver; |
429e1e81 JB |
1252 | if (current_language->la_language != lang) |
1253 | { | |
e3ad2841 | 1254 | lang_saver.emplace (); |
429e1e81 JB |
1255 | set_language (lang); |
1256 | } | |
1257 | ||
e3ad2841 | 1258 | return parse_expression (string); |
429e1e81 JB |
1259 | } |
1260 | ||
65d12d83 TT |
1261 | /* Parse STRING as an expression. If parsing ends in the middle of a |
1262 | field reference, return the type of the left-hand-side of the | |
1263 | reference; furthermore, if the parsing ends in the field name, | |
c92817ce TT |
1264 | return the field name in *NAME. If the parsing ends in the middle |
1265 | of a field reference, but the reference is somehow invalid, throw | |
1266 | an exception. In all other cases, return NULL. Returned non-NULL | |
1267 | *NAME must be freed by the caller. */ | |
65d12d83 TT |
1268 | |
1269 | struct type * | |
6f937416 | 1270 | parse_expression_for_completion (const char *string, char **name, |
2f68a895 | 1271 | enum type_code *code) |
65d12d83 | 1272 | { |
4d01a485 | 1273 | expression_up exp; |
65d12d83 TT |
1274 | struct value *val; |
1275 | int subexp; | |
65d12d83 | 1276 | |
492d29ea | 1277 | TRY |
65d12d83 | 1278 | { |
155da517 | 1279 | parse_completion = 1; |
036e657b | 1280 | exp = parse_exp_in_context (&string, 0, 0, 0, 0, &subexp); |
65d12d83 | 1281 | } |
492d29ea | 1282 | CATCH (except, RETURN_MASK_ERROR) |
7556d4a4 PA |
1283 | { |
1284 | /* Nothing, EXP remains NULL. */ | |
1285 | } | |
492d29ea | 1286 | END_CATCH |
7556d4a4 | 1287 | |
155da517 | 1288 | parse_completion = 0; |
7556d4a4 | 1289 | if (exp == NULL) |
65d12d83 | 1290 | return NULL; |
2f68a895 TT |
1291 | |
1292 | if (expout_tag_completion_type != TYPE_CODE_UNDEF) | |
1293 | { | |
1294 | *code = expout_tag_completion_type; | |
1295 | *name = expout_completion_name; | |
1296 | expout_completion_name = NULL; | |
1297 | return NULL; | |
1298 | } | |
1299 | ||
65d12d83 | 1300 | if (expout_last_struct == -1) |
4d01a485 | 1301 | return NULL; |
65d12d83 | 1302 | |
4d01a485 | 1303 | *name = extract_field_op (exp.get (), &subexp); |
65d12d83 | 1304 | if (!*name) |
4d01a485 | 1305 | return NULL; |
a0b7aece | 1306 | |
c92817ce TT |
1307 | /* This might throw an exception. If so, we want to let it |
1308 | propagate. */ | |
4d01a485 | 1309 | val = evaluate_subexpression_type (exp.get (), subexp); |
c92817ce TT |
1310 | /* (*NAME) is a part of the EXP memory block freed below. */ |
1311 | *name = xstrdup (*name); | |
65d12d83 TT |
1312 | |
1313 | return value_type (val); | |
1314 | } | |
1315 | ||
0df8b418 | 1316 | /* A post-parser that does nothing. */ |
e85c3284 | 1317 | |
e85c3284 | 1318 | void |
e9d9f57e | 1319 | null_post_parser (expression_up *exp, int void_context_p) |
e85c3284 PH |
1320 | { |
1321 | } | |
d30f5e1f DE |
1322 | |
1323 | /* Parse floating point value P of length LEN. | |
edd079d9 UW |
1324 | Return false if invalid, true if valid. |
1325 | The successfully parsed number is stored in DATA in | |
1326 | target format for floating-point type TYPE. | |
d30f5e1f DE |
1327 | |
1328 | NOTE: This accepts the floating point syntax that sscanf accepts. */ | |
1329 | ||
edd079d9 UW |
1330 | bool |
1331 | parse_float (const char *p, int len, | |
1332 | const struct type *type, gdb_byte *data) | |
d30f5e1f | 1333 | { |
f69fdf9b | 1334 | return target_float_from_string (data, type, std::string (p, len)); |
d30f5e1f | 1335 | } |
c906108c SS |
1336 | \f |
1337 | /* Stuff for maintaining a stack of types. Currently just used by C, but | |
1338 | probably useful for any language which declares its types "backwards". */ | |
1339 | ||
fcde5961 TT |
1340 | /* Ensure that there are HOWMUCH open slots on the type stack STACK. */ |
1341 | ||
47663de5 | 1342 | static void |
fcde5961 | 1343 | type_stack_reserve (struct type_stack *stack, int howmuch) |
c906108c | 1344 | { |
fcde5961 | 1345 | if (stack->depth + howmuch >= stack->size) |
c906108c | 1346 | { |
fcde5961 TT |
1347 | stack->size *= 2; |
1348 | if (stack->size < howmuch) | |
1349 | stack->size = howmuch; | |
224c3ddb SM |
1350 | stack->elements = XRESIZEVEC (union type_stack_elt, stack->elements, |
1351 | stack->size); | |
c906108c | 1352 | } |
47663de5 MS |
1353 | } |
1354 | ||
fcde5961 TT |
1355 | /* Ensure that there is a single open slot in the global type stack. */ |
1356 | ||
1357 | static void | |
1358 | check_type_stack_depth (void) | |
1359 | { | |
1360 | type_stack_reserve (&type_stack, 1); | |
1361 | } | |
1362 | ||
95c391b6 TT |
1363 | /* A helper function for insert_type and insert_type_address_space. |
1364 | This does work of expanding the type stack and inserting the new | |
1365 | element, ELEMENT, into the stack at location SLOT. */ | |
1366 | ||
1367 | static void | |
1368 | insert_into_type_stack (int slot, union type_stack_elt element) | |
1369 | { | |
1370 | check_type_stack_depth (); | |
1371 | ||
1a7d0ce4 TT |
1372 | if (slot < type_stack.depth) |
1373 | memmove (&type_stack.elements[slot + 1], &type_stack.elements[slot], | |
1374 | (type_stack.depth - slot) * sizeof (union type_stack_elt)); | |
1375 | type_stack.elements[slot] = element; | |
1376 | ++type_stack.depth; | |
95c391b6 TT |
1377 | } |
1378 | ||
1379 | /* Insert a new type, TP, at the bottom of the type stack. If TP is | |
53cc15f5 AV |
1380 | tp_pointer, tp_reference or tp_rvalue_reference, it is inserted at the |
1381 | bottom. If TP is a qualifier, it is inserted at slot 1 (just above a | |
1382 | previous tp_pointer) if there is anything on the stack, or simply pushed | |
1383 | if the stack is empty. Other values for TP are invalid. */ | |
95c391b6 TT |
1384 | |
1385 | void | |
1386 | insert_type (enum type_pieces tp) | |
1387 | { | |
1388 | union type_stack_elt element; | |
1389 | int slot; | |
1390 | ||
1391 | gdb_assert (tp == tp_pointer || tp == tp_reference | |
53cc15f5 AV |
1392 | || tp == tp_rvalue_reference || tp == tp_const |
1393 | || tp == tp_volatile); | |
95c391b6 TT |
1394 | |
1395 | /* If there is anything on the stack (we know it will be a | |
1396 | tp_pointer), insert the qualifier above it. Otherwise, simply | |
1397 | push this on the top of the stack. */ | |
1a7d0ce4 | 1398 | if (type_stack.depth && (tp == tp_const || tp == tp_volatile)) |
95c391b6 TT |
1399 | slot = 1; |
1400 | else | |
1401 | slot = 0; | |
1402 | ||
1403 | element.piece = tp; | |
1404 | insert_into_type_stack (slot, element); | |
1405 | } | |
1406 | ||
47663de5 MS |
1407 | void |
1408 | push_type (enum type_pieces tp) | |
1409 | { | |
1410 | check_type_stack_depth (); | |
1a7d0ce4 | 1411 | type_stack.elements[type_stack.depth++].piece = tp; |
c906108c SS |
1412 | } |
1413 | ||
1414 | void | |
fba45db2 | 1415 | push_type_int (int n) |
c906108c | 1416 | { |
47663de5 | 1417 | check_type_stack_depth (); |
1a7d0ce4 | 1418 | type_stack.elements[type_stack.depth++].int_val = n; |
c906108c SS |
1419 | } |
1420 | ||
95c391b6 TT |
1421 | /* Insert a tp_space_identifier and the corresponding address space |
1422 | value into the stack. STRING is the name of an address space, as | |
1423 | recognized by address_space_name_to_int. If the stack is empty, | |
1424 | the new elements are simply pushed. If the stack is not empty, | |
1425 | this function assumes that the first item on the stack is a | |
1426 | tp_pointer, and the new values are inserted above the first | |
1427 | item. */ | |
1428 | ||
47663de5 | 1429 | void |
410a0ff2 | 1430 | insert_type_address_space (struct parser_state *pstate, char *string) |
47663de5 | 1431 | { |
95c391b6 TT |
1432 | union type_stack_elt element; |
1433 | int slot; | |
1434 | ||
1435 | /* If there is anything on the stack (we know it will be a | |
1436 | tp_pointer), insert the address space qualifier above it. | |
1437 | Otherwise, simply push this on the top of the stack. */ | |
1a7d0ce4 | 1438 | if (type_stack.depth) |
95c391b6 TT |
1439 | slot = 1; |
1440 | else | |
1441 | slot = 0; | |
1442 | ||
1443 | element.piece = tp_space_identifier; | |
1444 | insert_into_type_stack (slot, element); | |
410a0ff2 SDJ |
1445 | element.int_val = address_space_name_to_int (parse_gdbarch (pstate), |
1446 | string); | |
95c391b6 | 1447 | insert_into_type_stack (slot, element); |
47663de5 MS |
1448 | } |
1449 | ||
c5aa993b | 1450 | enum type_pieces |
fba45db2 | 1451 | pop_type (void) |
c906108c | 1452 | { |
1a7d0ce4 TT |
1453 | if (type_stack.depth) |
1454 | return type_stack.elements[--type_stack.depth].piece; | |
c906108c SS |
1455 | return tp_end; |
1456 | } | |
1457 | ||
1458 | int | |
fba45db2 | 1459 | pop_type_int (void) |
c906108c | 1460 | { |
1a7d0ce4 TT |
1461 | if (type_stack.depth) |
1462 | return type_stack.elements[--type_stack.depth].int_val; | |
c906108c SS |
1463 | /* "Can't happen". */ |
1464 | return 0; | |
1465 | } | |
1466 | ||
71918a86 TT |
1467 | /* Pop a type list element from the global type stack. */ |
1468 | ||
1469 | static VEC (type_ptr) * | |
1470 | pop_typelist (void) | |
1471 | { | |
1472 | gdb_assert (type_stack.depth); | |
1473 | return type_stack.elements[--type_stack.depth].typelist_val; | |
1474 | } | |
1475 | ||
fcde5961 TT |
1476 | /* Pop a type_stack element from the global type stack. */ |
1477 | ||
1478 | static struct type_stack * | |
1479 | pop_type_stack (void) | |
1480 | { | |
1481 | gdb_assert (type_stack.depth); | |
1482 | return type_stack.elements[--type_stack.depth].stack_val; | |
1483 | } | |
1484 | ||
1485 | /* Append the elements of the type stack FROM to the type stack TO. | |
1486 | Always returns TO. */ | |
1487 | ||
1488 | struct type_stack * | |
1489 | append_type_stack (struct type_stack *to, struct type_stack *from) | |
1490 | { | |
1491 | type_stack_reserve (to, from->depth); | |
1492 | ||
1493 | memcpy (&to->elements[to->depth], &from->elements[0], | |
1494 | from->depth * sizeof (union type_stack_elt)); | |
1495 | to->depth += from->depth; | |
1496 | ||
1497 | return to; | |
1498 | } | |
1499 | ||
1500 | /* Push the type stack STACK as an element on the global type stack. */ | |
1501 | ||
1502 | void | |
1503 | push_type_stack (struct type_stack *stack) | |
1504 | { | |
1505 | check_type_stack_depth (); | |
1506 | type_stack.elements[type_stack.depth++].stack_val = stack; | |
1507 | push_type (tp_type_stack); | |
1508 | } | |
1509 | ||
1510 | /* Copy the global type stack into a newly allocated type stack and | |
1511 | return it. The global stack is cleared. The returned type stack | |
1512 | must be freed with type_stack_cleanup. */ | |
1513 | ||
1514 | struct type_stack * | |
1515 | get_type_stack (void) | |
1516 | { | |
1517 | struct type_stack *result = XNEW (struct type_stack); | |
1518 | ||
1519 | *result = type_stack; | |
1520 | type_stack.depth = 0; | |
1521 | type_stack.size = 0; | |
1522 | type_stack.elements = NULL; | |
1523 | ||
1524 | return result; | |
1525 | } | |
1526 | ||
1527 | /* A cleanup function that destroys a single type stack. */ | |
1528 | ||
1529 | void | |
1530 | type_stack_cleanup (void *arg) | |
1531 | { | |
19ba03f4 | 1532 | struct type_stack *stack = (struct type_stack *) arg; |
fcde5961 TT |
1533 | |
1534 | xfree (stack->elements); | |
1535 | xfree (stack); | |
1536 | } | |
1537 | ||
71918a86 | 1538 | /* Push a function type with arguments onto the global type stack. |
a6fb9c08 TT |
1539 | LIST holds the argument types. If the final item in LIST is NULL, |
1540 | then the function will be varargs. */ | |
71918a86 TT |
1541 | |
1542 | void | |
1543 | push_typelist (VEC (type_ptr) *list) | |
1544 | { | |
1545 | check_type_stack_depth (); | |
1546 | type_stack.elements[type_stack.depth++].typelist_val = list; | |
1547 | push_type (tp_function_with_arguments); | |
1548 | } | |
1549 | ||
3693fdb3 PA |
1550 | /* Pop the type stack and return a type_instance_flags that |
1551 | corresponds the const/volatile qualifiers on the stack. This is | |
1552 | called by the C++ parser when parsing methods types, and as such no | |
1553 | other kind of type in the type stack is expected. */ | |
1554 | ||
1555 | type_instance_flags | |
1556 | follow_type_instance_flags () | |
1557 | { | |
1558 | type_instance_flags flags = 0; | |
1559 | ||
1560 | for (;;) | |
1561 | switch (pop_type ()) | |
1562 | { | |
1563 | case tp_end: | |
1564 | return flags; | |
1565 | case tp_const: | |
1566 | flags |= TYPE_INSTANCE_FLAG_CONST; | |
1567 | break; | |
1568 | case tp_volatile: | |
1569 | flags |= TYPE_INSTANCE_FLAG_VOLATILE; | |
1570 | break; | |
1571 | default: | |
1572 | gdb_assert_not_reached ("unrecognized tp_ value in follow_types"); | |
1573 | } | |
1574 | } | |
1575 | ||
1576 | ||
c906108c SS |
1577 | /* Pop the type stack and return the type which corresponds to FOLLOW_TYPE |
1578 | as modified by all the stuff on the stack. */ | |
1579 | struct type * | |
fba45db2 | 1580 | follow_types (struct type *follow_type) |
c906108c SS |
1581 | { |
1582 | int done = 0; | |
2e2394a0 MS |
1583 | int make_const = 0; |
1584 | int make_volatile = 0; | |
47663de5 | 1585 | int make_addr_space = 0; |
c906108c | 1586 | int array_size; |
c906108c SS |
1587 | |
1588 | while (!done) | |
1589 | switch (pop_type ()) | |
1590 | { | |
1591 | case tp_end: | |
1592 | done = 1; | |
2e2394a0 MS |
1593 | if (make_const) |
1594 | follow_type = make_cv_type (make_const, | |
1595 | TYPE_VOLATILE (follow_type), | |
1596 | follow_type, 0); | |
1597 | if (make_volatile) | |
1598 | follow_type = make_cv_type (TYPE_CONST (follow_type), | |
1599 | make_volatile, | |
1600 | follow_type, 0); | |
47663de5 MS |
1601 | if (make_addr_space) |
1602 | follow_type = make_type_with_address_space (follow_type, | |
1603 | make_addr_space); | |
1604 | make_const = make_volatile = 0; | |
1605 | make_addr_space = 0; | |
2e2394a0 MS |
1606 | break; |
1607 | case tp_const: | |
1608 | make_const = 1; | |
1609 | break; | |
1610 | case tp_volatile: | |
1611 | make_volatile = 1; | |
c906108c | 1612 | break; |
47663de5 MS |
1613 | case tp_space_identifier: |
1614 | make_addr_space = pop_type_int (); | |
1615 | break; | |
c906108c SS |
1616 | case tp_pointer: |
1617 | follow_type = lookup_pointer_type (follow_type); | |
2e2394a0 MS |
1618 | if (make_const) |
1619 | follow_type = make_cv_type (make_const, | |
1620 | TYPE_VOLATILE (follow_type), | |
1621 | follow_type, 0); | |
1622 | if (make_volatile) | |
1623 | follow_type = make_cv_type (TYPE_CONST (follow_type), | |
1624 | make_volatile, | |
1625 | follow_type, 0); | |
47663de5 MS |
1626 | if (make_addr_space) |
1627 | follow_type = make_type_with_address_space (follow_type, | |
1628 | make_addr_space); | |
2e2394a0 | 1629 | make_const = make_volatile = 0; |
47663de5 | 1630 | make_addr_space = 0; |
c906108c SS |
1631 | break; |
1632 | case tp_reference: | |
53cc15f5 AV |
1633 | follow_type = lookup_lvalue_reference_type (follow_type); |
1634 | goto process_reference; | |
1635 | case tp_rvalue_reference: | |
1636 | follow_type = lookup_rvalue_reference_type (follow_type); | |
1637 | process_reference: | |
1638 | if (make_const) | |
1639 | follow_type = make_cv_type (make_const, | |
1640 | TYPE_VOLATILE (follow_type), | |
1641 | follow_type, 0); | |
1642 | if (make_volatile) | |
1643 | follow_type = make_cv_type (TYPE_CONST (follow_type), | |
1644 | make_volatile, | |
1645 | follow_type, 0); | |
1646 | if (make_addr_space) | |
1647 | follow_type = make_type_with_address_space (follow_type, | |
1648 | make_addr_space); | |
2e2394a0 | 1649 | make_const = make_volatile = 0; |
47663de5 | 1650 | make_addr_space = 0; |
c906108c SS |
1651 | break; |
1652 | case tp_array: | |
1653 | array_size = pop_type_int (); | |
1654 | /* FIXME-type-allocation: need a way to free this type when we are | |
1655 | done with it. */ | |
c906108c | 1656 | follow_type = |
e3506a9f UW |
1657 | lookup_array_range_type (follow_type, |
1658 | 0, array_size >= 0 ? array_size - 1 : 0); | |
c906108c | 1659 | if (array_size < 0) |
729efb13 SA |
1660 | TYPE_HIGH_BOUND_KIND (TYPE_INDEX_TYPE (follow_type)) |
1661 | = PROP_UNDEFINED; | |
c906108c SS |
1662 | break; |
1663 | case tp_function: | |
1664 | /* FIXME-type-allocation: need a way to free this type when we are | |
1665 | done with it. */ | |
1666 | follow_type = lookup_function_type (follow_type); | |
1667 | break; | |
fcde5961 | 1668 | |
71918a86 TT |
1669 | case tp_function_with_arguments: |
1670 | { | |
1671 | VEC (type_ptr) *args = pop_typelist (); | |
1672 | ||
1673 | follow_type | |
1674 | = lookup_function_type_with_arguments (follow_type, | |
1675 | VEC_length (type_ptr, args), | |
1676 | VEC_address (type_ptr, | |
1677 | args)); | |
1678 | VEC_free (type_ptr, args); | |
1679 | } | |
1680 | break; | |
1681 | ||
fcde5961 TT |
1682 | case tp_type_stack: |
1683 | { | |
1684 | struct type_stack *stack = pop_type_stack (); | |
1685 | /* Sort of ugly, but not really much worse than the | |
1686 | alternatives. */ | |
1687 | struct type_stack save = type_stack; | |
1688 | ||
1689 | type_stack = *stack; | |
1690 | follow_type = follow_types (follow_type); | |
1691 | gdb_assert (type_stack.depth == 0); | |
1692 | ||
1693 | type_stack = save; | |
1694 | } | |
1695 | break; | |
1696 | default: | |
1697 | gdb_assert_not_reached ("unrecognized tp_ value in follow_types"); | |
c906108c SS |
1698 | } |
1699 | return follow_type; | |
1700 | } | |
1701 | \f | |
f461f5cf PM |
1702 | /* This function avoids direct calls to fprintf |
1703 | in the parser generated debug code. */ | |
1704 | void | |
1705 | parser_fprintf (FILE *x, const char *y, ...) | |
1706 | { | |
1707 | va_list args; | |
ad3bbd48 | 1708 | |
f461f5cf PM |
1709 | va_start (args, y); |
1710 | if (x == stderr) | |
1711 | vfprintf_unfiltered (gdb_stderr, y, args); | |
1712 | else | |
1713 | { | |
1714 | fprintf_unfiltered (gdb_stderr, " Unknown FILE used.\n"); | |
1715 | vfprintf_unfiltered (gdb_stderr, y, args); | |
1716 | } | |
1717 | va_end (args); | |
1718 | } | |
1719 | ||
c0201579 JK |
1720 | /* Implementation of the exp_descriptor method operator_check. */ |
1721 | ||
1722 | int | |
1723 | operator_check_standard (struct expression *exp, int pos, | |
1724 | int (*objfile_func) (struct objfile *objfile, | |
1725 | void *data), | |
1726 | void *data) | |
1727 | { | |
1728 | const union exp_element *const elts = exp->elts; | |
1729 | struct type *type = NULL; | |
1730 | struct objfile *objfile = NULL; | |
1731 | ||
1732 | /* Extended operators should have been already handled by exp_descriptor | |
1733 | iterate method of its specific language. */ | |
1734 | gdb_assert (elts[pos].opcode < OP_EXTENDED0); | |
1735 | ||
1736 | /* Track the callers of write_exp_elt_type for this table. */ | |
1737 | ||
1738 | switch (elts[pos].opcode) | |
1739 | { | |
1740 | case BINOP_VAL: | |
1741 | case OP_COMPLEX: | |
edd079d9 | 1742 | case OP_FLOAT: |
c0201579 JK |
1743 | case OP_LONG: |
1744 | case OP_SCOPE: | |
1745 | case OP_TYPE: | |
1746 | case UNOP_CAST: | |
c0201579 JK |
1747 | case UNOP_MAX: |
1748 | case UNOP_MEMVAL: | |
1749 | case UNOP_MIN: | |
1750 | type = elts[pos + 1].type; | |
1751 | break; | |
1752 | ||
1753 | case TYPE_INSTANCE: | |
1754 | { | |
3693fdb3 | 1755 | LONGEST arg, nargs = elts[pos + 2].longconst; |
c0201579 JK |
1756 | |
1757 | for (arg = 0; arg < nargs; arg++) | |
1758 | { | |
3693fdb3 | 1759 | struct type *type = elts[pos + 3 + arg].type; |
c0201579 JK |
1760 | struct objfile *objfile = TYPE_OBJFILE (type); |
1761 | ||
1762 | if (objfile && (*objfile_func) (objfile, data)) | |
1763 | return 1; | |
1764 | } | |
1765 | } | |
1766 | break; | |
1767 | ||
c0201579 JK |
1768 | case OP_VAR_VALUE: |
1769 | { | |
1770 | const struct block *const block = elts[pos + 1].block; | |
1771 | const struct symbol *const symbol = elts[pos + 2].symbol; | |
1772 | ||
1773 | /* Check objfile where the variable itself is placed. | |
1774 | SYMBOL_OBJ_SECTION (symbol) may be NULL. */ | |
08be3fe3 | 1775 | if ((*objfile_func) (symbol_objfile (symbol), data)) |
c0201579 JK |
1776 | return 1; |
1777 | ||
1778 | /* Check objfile where is placed the code touching the variable. */ | |
1779 | objfile = lookup_objfile_from_block (block); | |
1780 | ||
1781 | type = SYMBOL_TYPE (symbol); | |
1782 | } | |
1783 | break; | |
74ea4be4 PA |
1784 | case OP_VAR_MSYM_VALUE: |
1785 | objfile = elts[pos + 1].objfile; | |
1786 | break; | |
c0201579 JK |
1787 | } |
1788 | ||
1789 | /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */ | |
1790 | ||
1791 | if (type && TYPE_OBJFILE (type) | |
1792 | && (*objfile_func) (TYPE_OBJFILE (type), data)) | |
1793 | return 1; | |
1794 | if (objfile && (*objfile_func) (objfile, data)) | |
1795 | return 1; | |
1796 | ||
1797 | return 0; | |
1798 | } | |
1799 | ||
a1c7835a YQ |
1800 | /* Call OBJFILE_FUNC for any objfile found being referenced by EXP. |
1801 | OBJFILE_FUNC is never called with NULL OBJFILE. OBJFILE_FUNC get | |
1802 | passed an arbitrary caller supplied DATA pointer. If OBJFILE_FUNC | |
1803 | returns non-zero value then (any other) non-zero value is immediately | |
1804 | returned to the caller. Otherwise zero is returned after iterating | |
1805 | through whole EXP. */ | |
c0201579 JK |
1806 | |
1807 | static int | |
1808 | exp_iterate (struct expression *exp, | |
1809 | int (*objfile_func) (struct objfile *objfile, void *data), | |
1810 | void *data) | |
1811 | { | |
1812 | int endpos; | |
c0201579 JK |
1813 | |
1814 | for (endpos = exp->nelts; endpos > 0; ) | |
1815 | { | |
1816 | int pos, args, oplen = 0; | |
1817 | ||
dc21167c | 1818 | operator_length (exp, endpos, &oplen, &args); |
c0201579 JK |
1819 | gdb_assert (oplen > 0); |
1820 | ||
1821 | pos = endpos - oplen; | |
1822 | if (exp->language_defn->la_exp_desc->operator_check (exp, pos, | |
1823 | objfile_func, data)) | |
1824 | return 1; | |
1825 | ||
1826 | endpos = pos; | |
1827 | } | |
1828 | ||
1829 | return 0; | |
1830 | } | |
1831 | ||
1832 | /* Helper for exp_uses_objfile. */ | |
1833 | ||
1834 | static int | |
1835 | exp_uses_objfile_iter (struct objfile *exp_objfile, void *objfile_voidp) | |
1836 | { | |
19ba03f4 | 1837 | struct objfile *objfile = (struct objfile *) objfile_voidp; |
c0201579 JK |
1838 | |
1839 | if (exp_objfile->separate_debug_objfile_backlink) | |
1840 | exp_objfile = exp_objfile->separate_debug_objfile_backlink; | |
1841 | ||
1842 | return exp_objfile == objfile; | |
1843 | } | |
1844 | ||
1845 | /* Return 1 if EXP uses OBJFILE (and will become dangling when OBJFILE | |
1846 | is unloaded), otherwise return 0. OBJFILE must not be a separate debug info | |
1847 | file. */ | |
1848 | ||
1849 | int | |
1850 | exp_uses_objfile (struct expression *exp, struct objfile *objfile) | |
1851 | { | |
1852 | gdb_assert (objfile->separate_debug_objfile_backlink == NULL); | |
1853 | ||
1854 | return exp_iterate (exp, exp_uses_objfile_iter, objfile); | |
1855 | } | |
1856 | ||
410a0ff2 SDJ |
1857 | /* See definition in parser-defs.h. */ |
1858 | ||
1859 | void | |
1860 | increase_expout_size (struct parser_state *ps, size_t lenelt) | |
1861 | { | |
1862 | if ((ps->expout_ptr + lenelt) >= ps->expout_size) | |
1863 | { | |
325fac50 | 1864 | ps->expout_size = std::max (ps->expout_size * 2, |
e9d9f57e TT |
1865 | ps->expout_ptr + lenelt + 10); |
1866 | ps->expout.reset (XRESIZEVAR (expression, | |
1867 | ps->expout.release (), | |
1868 | (sizeof (struct expression) | |
1869 | + EXP_ELEM_TO_BYTES (ps->expout_size)))); | |
410a0ff2 SDJ |
1870 | } |
1871 | } | |
1872 | ||
ac9a91a7 | 1873 | void |
fba45db2 | 1874 | _initialize_parse (void) |
ac9a91a7 | 1875 | { |
fcde5961 | 1876 | type_stack.size = 0; |
1a7d0ce4 | 1877 | type_stack.depth = 0; |
fcde5961 | 1878 | type_stack.elements = NULL; |
ac9a91a7 | 1879 | |
ccce17b0 YQ |
1880 | add_setshow_zuinteger_cmd ("expression", class_maintenance, |
1881 | &expressiondebug, | |
1882 | _("Set expression debugging."), | |
1883 | _("Show expression debugging."), | |
1884 | _("When non-zero, the internal representation " | |
1885 | "of expressions will be printed."), | |
1886 | NULL, | |
1887 | show_expressiondebug, | |
1888 | &setdebuglist, &showdebuglist); | |
92981e24 | 1889 | add_setshow_boolean_cmd ("parser", class_maintenance, |
3e43a32a MS |
1890 | &parser_debug, |
1891 | _("Set parser debugging."), | |
1892 | _("Show parser debugging."), | |
1893 | _("When non-zero, expression parser " | |
1894 | "tracing will be enabled."), | |
92981e24 TT |
1895 | NULL, |
1896 | show_parserdebug, | |
1897 | &setdebuglist, &showdebuglist); | |
c906108c | 1898 | } |