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