Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Parse expressions for GDB. |
c4a172b5 | 2 | |
6aba47ca | 3 | Copyright (C) 1986, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, |
4c38e0a4 | 4 | 1998, 1999, 2000, 2001, 2004, 2005, 2007, 2008, 2009, 2010 |
9b254dd1 | 5 | Free Software Foundation, Inc. |
c4a172b5 | 6 | |
c906108c SS |
7 | Modified from expread.y by the Department of Computer Science at the |
8 | State University of New York at Buffalo, 1991. | |
9 | ||
c5aa993b | 10 | This file is part of GDB. |
c906108c | 11 | |
c5aa993b JM |
12 | This program is free software; you can redistribute it and/or modify |
13 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 14 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 15 | (at your option) any later version. |
c906108c | 16 | |
c5aa993b JM |
17 | This program is distributed in the hope that it will be useful, |
18 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
19 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
20 | GNU General Public License for more details. | |
c906108c | 21 | |
c5aa993b | 22 | You should have received a copy of the GNU General Public License |
a9762ec7 | 23 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
24 | |
25 | /* Parse an expression from text in a string, | |
26 | and return the result as a struct expression pointer. | |
27 | That structure contains arithmetic operations in reverse polish, | |
28 | with constants represented by operations that are followed by special data. | |
29 | See expression.h for the details of the format. | |
30 | What is important here is that it can be built up sequentially | |
31 | during the process of parsing; the lower levels of the tree always | |
32 | come first in the result. */ | |
c5aa993b | 33 | |
c906108c | 34 | #include "defs.h" |
12c89474 | 35 | #include <ctype.h> |
e17c207e | 36 | #include "arch-utils.h" |
c906108c | 37 | #include "gdb_string.h" |
c906108c SS |
38 | #include "symtab.h" |
39 | #include "gdbtypes.h" | |
40 | #include "frame.h" | |
41 | #include "expression.h" | |
42 | #include "value.h" | |
43 | #include "command.h" | |
44 | #include "language.h" | |
0b4e1325 | 45 | #include "f-lang.h" |
c906108c SS |
46 | #include "parser-defs.h" |
47 | #include "gdbcmd.h" | |
c5aa993b | 48 | #include "symfile.h" /* for overlay functions */ |
f57d151a | 49 | #include "inferior.h" |
d16aafd8 | 50 | #include "doublest.h" |
0406ec40 | 51 | #include "gdb_assert.h" |
fe898f56 | 52 | #include "block.h" |
59f92a09 | 53 | #include "source.h" |
9e35dae4 | 54 | #include "objfiles.h" |
65d12d83 | 55 | #include "exceptions.h" |
029a67e4 | 56 | #include "user-regs.h" |
e2305d34 | 57 | |
5f9769d1 PH |
58 | /* Standard set of definitions for printing, dumping, prefixifying, |
59 | * and evaluating expressions. */ | |
60 | ||
61 | const struct exp_descriptor exp_descriptor_standard = | |
62 | { | |
63 | print_subexp_standard, | |
64 | operator_length_standard, | |
65 | op_name_standard, | |
66 | dump_subexp_body_standard, | |
67 | evaluate_subexp_standard | |
68 | }; | |
c906108c SS |
69 | \f |
70 | /* Global variables declared in parser-defs.h (and commented there). */ | |
71 | struct expression *expout; | |
72 | int expout_size; | |
73 | int expout_ptr; | |
74 | struct block *expression_context_block; | |
84f0252a | 75 | CORE_ADDR expression_context_pc; |
c906108c SS |
76 | struct block *innermost_block; |
77 | int arglist_len; | |
78 | union type_stack_elt *type_stack; | |
79 | int type_stack_depth, type_stack_size; | |
80 | char *lexptr; | |
665132f9 | 81 | char *prev_lexptr; |
c906108c SS |
82 | int paren_depth; |
83 | int comma_terminates; | |
3a913e29 | 84 | |
65d12d83 TT |
85 | /* True if parsing an expression to find a field reference. This is |
86 | only used by completion. */ | |
87 | int in_parse_field; | |
88 | ||
89 | /* The index of the last struct expression directly before a '.' or | |
90 | '->'. This is set when parsing and is only used when completing a | |
91 | field name. It is -1 if no dereference operation was found. */ | |
92 | static int expout_last_struct = -1; | |
93 | ||
3a913e29 JB |
94 | /* A temporary buffer for identifiers, so we can null-terminate them. |
95 | ||
96 | We allocate this with xrealloc. parse_exp_1 used to allocate with | |
97 | alloca, using the size of the whole expression as a conservative | |
98 | estimate of the space needed. However, macro expansion can | |
99 | introduce names longer than the original expression; there's no | |
100 | practical way to know beforehand how large that might be. */ | |
101 | char *namecopy; | |
102 | size_t namecopy_size; | |
c906108c | 103 | \f |
c906108c | 104 | static int expressiondebug = 0; |
920d2a44 AC |
105 | static void |
106 | show_expressiondebug (struct ui_file *file, int from_tty, | |
107 | struct cmd_list_element *c, const char *value) | |
108 | { | |
109 | fprintf_filtered (file, _("Expression debugging is %s.\n"), value); | |
110 | } | |
c906108c | 111 | |
92981e24 TT |
112 | |
113 | /* Non-zero if an expression parser should set yydebug. */ | |
114 | int parser_debug; | |
115 | ||
116 | static void | |
117 | show_parserdebug (struct ui_file *file, int from_tty, | |
118 | struct cmd_list_element *c, const char *value) | |
119 | { | |
120 | fprintf_filtered (file, _("Parser debugging is %s.\n"), value); | |
121 | } | |
122 | ||
123 | ||
74b7792f | 124 | static void free_funcalls (void *ignore); |
c906108c | 125 | |
65d12d83 | 126 | static int prefixify_expression (struct expression *); |
c906108c | 127 | |
65d12d83 TT |
128 | static int prefixify_subexp (struct expression *, struct expression *, int, |
129 | int); | |
c906108c | 130 | |
e85c3284 | 131 | static struct expression *parse_exp_in_context (char **, struct block *, int, |
65d12d83 | 132 | int, int *); |
e85c3284 | 133 | |
a14ed312 | 134 | void _initialize_parse (void); |
392a587b | 135 | |
c906108c SS |
136 | /* Data structure for saving values of arglist_len for function calls whose |
137 | arguments contain other function calls. */ | |
138 | ||
139 | struct funcall | |
140 | { | |
141 | struct funcall *next; | |
142 | int arglist_len; | |
143 | }; | |
144 | ||
145 | static struct funcall *funcall_chain; | |
146 | ||
c906108c SS |
147 | /* Begin counting arguments for a function call, |
148 | saving the data about any containing call. */ | |
149 | ||
150 | void | |
fba45db2 | 151 | start_arglist (void) |
c906108c | 152 | { |
f86f5ca3 | 153 | struct funcall *new; |
c906108c SS |
154 | |
155 | new = (struct funcall *) xmalloc (sizeof (struct funcall)); | |
156 | new->next = funcall_chain; | |
157 | new->arglist_len = arglist_len; | |
158 | arglist_len = 0; | |
159 | funcall_chain = new; | |
160 | } | |
161 | ||
162 | /* Return the number of arguments in a function call just terminated, | |
163 | and restore the data for the containing function call. */ | |
164 | ||
165 | int | |
fba45db2 | 166 | end_arglist (void) |
c906108c | 167 | { |
f86f5ca3 PH |
168 | int val = arglist_len; |
169 | struct funcall *call = funcall_chain; | |
c906108c SS |
170 | funcall_chain = call->next; |
171 | arglist_len = call->arglist_len; | |
b8c9b27d | 172 | xfree (call); |
c906108c SS |
173 | return val; |
174 | } | |
175 | ||
176 | /* Free everything in the funcall chain. | |
177 | Used when there is an error inside parsing. */ | |
178 | ||
179 | static void | |
74b7792f | 180 | free_funcalls (void *ignore) |
c906108c | 181 | { |
f86f5ca3 | 182 | struct funcall *call, *next; |
c906108c SS |
183 | |
184 | for (call = funcall_chain; call; call = next) | |
185 | { | |
186 | next = call->next; | |
b8c9b27d | 187 | xfree (call); |
c906108c SS |
188 | } |
189 | } | |
190 | \f | |
191 | /* This page contains the functions for adding data to the struct expression | |
192 | being constructed. */ | |
193 | ||
194 | /* Add one element to the end of the expression. */ | |
195 | ||
196 | /* To avoid a bug in the Sun 4 compiler, we pass things that can fit into | |
197 | a register through here */ | |
198 | ||
199 | void | |
fba45db2 | 200 | write_exp_elt (union exp_element expelt) |
c906108c SS |
201 | { |
202 | if (expout_ptr >= expout_size) | |
203 | { | |
204 | expout_size *= 2; | |
205 | expout = (struct expression *) | |
206 | xrealloc ((char *) expout, sizeof (struct expression) | |
207 | + EXP_ELEM_TO_BYTES (expout_size)); | |
208 | } | |
209 | expout->elts[expout_ptr++] = expelt; | |
210 | } | |
211 | ||
212 | void | |
fba45db2 | 213 | write_exp_elt_opcode (enum exp_opcode expelt) |
c906108c SS |
214 | { |
215 | union exp_element tmp; | |
09153d55 | 216 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c SS |
217 | |
218 | tmp.opcode = expelt; | |
219 | ||
220 | write_exp_elt (tmp); | |
221 | } | |
222 | ||
223 | void | |
fba45db2 | 224 | write_exp_elt_sym (struct symbol *expelt) |
c906108c SS |
225 | { |
226 | union exp_element tmp; | |
09153d55 | 227 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c SS |
228 | |
229 | tmp.symbol = expelt; | |
230 | ||
231 | write_exp_elt (tmp); | |
232 | } | |
233 | ||
234 | void | |
fba45db2 | 235 | write_exp_elt_block (struct block *b) |
c906108c SS |
236 | { |
237 | union exp_element tmp; | |
09153d55 | 238 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c SS |
239 | tmp.block = b; |
240 | write_exp_elt (tmp); | |
241 | } | |
242 | ||
9e35dae4 DJ |
243 | void |
244 | write_exp_elt_objfile (struct objfile *objfile) | |
245 | { | |
246 | union exp_element tmp; | |
247 | memset (&tmp, 0, sizeof (union exp_element)); | |
248 | tmp.objfile = objfile; | |
249 | write_exp_elt (tmp); | |
250 | } | |
251 | ||
c906108c | 252 | void |
fba45db2 | 253 | write_exp_elt_longcst (LONGEST expelt) |
c906108c SS |
254 | { |
255 | union exp_element tmp; | |
09153d55 | 256 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c SS |
257 | |
258 | tmp.longconst = expelt; | |
259 | ||
260 | write_exp_elt (tmp); | |
261 | } | |
262 | ||
263 | void | |
fba45db2 | 264 | write_exp_elt_dblcst (DOUBLEST expelt) |
c906108c SS |
265 | { |
266 | union exp_element tmp; | |
09153d55 | 267 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c SS |
268 | |
269 | tmp.doubleconst = expelt; | |
270 | ||
271 | write_exp_elt (tmp); | |
272 | } | |
273 | ||
27bc4d80 TJB |
274 | void |
275 | write_exp_elt_decfloatcst (gdb_byte expelt[16]) | |
276 | { | |
277 | union exp_element tmp; | |
278 | int index; | |
279 | ||
280 | for (index = 0; index < 16; index++) | |
281 | tmp.decfloatconst[index] = expelt[index]; | |
282 | ||
283 | write_exp_elt (tmp); | |
284 | } | |
285 | ||
c906108c | 286 | void |
fba45db2 | 287 | write_exp_elt_type (struct type *expelt) |
c906108c SS |
288 | { |
289 | union exp_element tmp; | |
09153d55 | 290 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c SS |
291 | |
292 | tmp.type = expelt; | |
293 | ||
294 | write_exp_elt (tmp); | |
295 | } | |
296 | ||
297 | void | |
fba45db2 | 298 | write_exp_elt_intern (struct internalvar *expelt) |
c906108c SS |
299 | { |
300 | union exp_element tmp; | |
09153d55 | 301 | memset (&tmp, 0, sizeof (union exp_element)); |
c906108c SS |
302 | |
303 | tmp.internalvar = expelt; | |
304 | ||
305 | write_exp_elt (tmp); | |
306 | } | |
307 | ||
308 | /* Add a string constant to the end of the expression. | |
309 | ||
310 | String constants are stored by first writing an expression element | |
311 | that contains the length of the string, then stuffing the string | |
312 | constant itself into however many expression elements are needed | |
313 | to hold it, and then writing another expression element that contains | |
314 | the length of the string. I.E. an expression element at each end of | |
315 | the string records the string length, so you can skip over the | |
316 | expression elements containing the actual string bytes from either | |
317 | end of the string. Note that this also allows gdb to handle | |
318 | strings with embedded null bytes, as is required for some languages. | |
319 | ||
320 | Don't be fooled by the fact that the string is null byte terminated, | |
bc3b79fd | 321 | this is strictly for the convenience of debugging gdb itself. |
c906108c SS |
322 | Gdb does not depend up the string being null terminated, since the |
323 | actual length is recorded in expression elements at each end of the | |
324 | string. The null byte is taken into consideration when computing how | |
325 | many expression elements are required to hold the string constant, of | |
326 | course. */ | |
327 | ||
328 | ||
329 | void | |
fba45db2 | 330 | write_exp_string (struct stoken str) |
c906108c | 331 | { |
f86f5ca3 PH |
332 | int len = str.length; |
333 | int lenelt; | |
334 | char *strdata; | |
c906108c SS |
335 | |
336 | /* Compute the number of expression elements required to hold the string | |
337 | (including a null byte terminator), along with one expression element | |
338 | at each end to record the actual string length (not including the | |
339 | null byte terminator). */ | |
340 | ||
341 | lenelt = 2 + BYTES_TO_EXP_ELEM (len + 1); | |
342 | ||
343 | /* Ensure that we have enough available expression elements to store | |
344 | everything. */ | |
345 | ||
346 | if ((expout_ptr + lenelt) >= expout_size) | |
347 | { | |
348 | expout_size = max (expout_size * 2, expout_ptr + lenelt + 10); | |
349 | expout = (struct expression *) | |
350 | xrealloc ((char *) expout, (sizeof (struct expression) | |
351 | + EXP_ELEM_TO_BYTES (expout_size))); | |
352 | } | |
353 | ||
354 | /* Write the leading length expression element (which advances the current | |
355 | expression element index), then write the string constant followed by a | |
356 | terminating null byte, and then write the trailing length expression | |
357 | element. */ | |
358 | ||
359 | write_exp_elt_longcst ((LONGEST) len); | |
360 | strdata = (char *) &expout->elts[expout_ptr]; | |
361 | memcpy (strdata, str.ptr, len); | |
362 | *(strdata + len) = '\0'; | |
363 | expout_ptr += lenelt - 2; | |
364 | write_exp_elt_longcst ((LONGEST) len); | |
365 | } | |
366 | ||
6c7a06a3 TT |
367 | /* Add a vector of string constants to the end of the expression. |
368 | ||
369 | This adds an OP_STRING operation, but encodes the contents | |
370 | differently from write_exp_string. The language is expected to | |
371 | handle evaluation of this expression itself. | |
372 | ||
373 | After the usual OP_STRING header, TYPE is written into the | |
374 | expression as a long constant. The interpretation of this field is | |
375 | up to the language evaluator. | |
376 | ||
377 | Next, each string in VEC is written. The length is written as a | |
378 | long constant, followed by the contents of the string. */ | |
379 | ||
380 | void | |
381 | write_exp_string_vector (int type, struct stoken_vector *vec) | |
382 | { | |
383 | int i, n_slots, len; | |
384 | ||
385 | /* Compute the size. We compute the size in number of slots to | |
386 | avoid issues with string padding. */ | |
387 | n_slots = 0; | |
388 | for (i = 0; i < vec->len; ++i) | |
389 | { | |
390 | /* One slot for the length of this element, plus the number of | |
391 | slots needed for this string. */ | |
392 | n_slots += 1 + BYTES_TO_EXP_ELEM (vec->tokens[i].length); | |
393 | } | |
394 | ||
395 | /* One more slot for the type of the string. */ | |
396 | ++n_slots; | |
397 | ||
398 | /* Now compute a phony string length. */ | |
399 | len = EXP_ELEM_TO_BYTES (n_slots) - 1; | |
400 | ||
401 | n_slots += 4; | |
402 | if ((expout_ptr + n_slots) >= expout_size) | |
403 | { | |
404 | expout_size = max (expout_size * 2, expout_ptr + n_slots + 10); | |
405 | expout = (struct expression *) | |
406 | xrealloc ((char *) expout, (sizeof (struct expression) | |
407 | + EXP_ELEM_TO_BYTES (expout_size))); | |
408 | } | |
409 | ||
410 | write_exp_elt_opcode (OP_STRING); | |
411 | write_exp_elt_longcst (len); | |
412 | write_exp_elt_longcst (type); | |
413 | ||
414 | for (i = 0; i < vec->len; ++i) | |
415 | { | |
416 | write_exp_elt_longcst (vec->tokens[i].length); | |
417 | memcpy (&expout->elts[expout_ptr], vec->tokens[i].ptr, | |
418 | vec->tokens[i].length); | |
419 | expout_ptr += BYTES_TO_EXP_ELEM (vec->tokens[i].length); | |
420 | } | |
421 | ||
422 | write_exp_elt_longcst (len); | |
423 | write_exp_elt_opcode (OP_STRING); | |
424 | } | |
425 | ||
c906108c SS |
426 | /* Add a bitstring constant to the end of the expression. |
427 | ||
428 | Bitstring constants are stored by first writing an expression element | |
429 | that contains the length of the bitstring (in bits), then stuffing the | |
430 | bitstring constant itself into however many expression elements are | |
431 | needed to hold it, and then writing another expression element that | |
432 | contains the length of the bitstring. I.E. an expression element at | |
433 | each end of the bitstring records the bitstring length, so you can skip | |
434 | over the expression elements containing the actual bitstring bytes from | |
435 | either end of the bitstring. */ | |
436 | ||
437 | void | |
fba45db2 | 438 | write_exp_bitstring (struct stoken str) |
c906108c | 439 | { |
f86f5ca3 PH |
440 | int bits = str.length; /* length in bits */ |
441 | int len = (bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; | |
442 | int lenelt; | |
443 | char *strdata; | |
c906108c SS |
444 | |
445 | /* Compute the number of expression elements required to hold the bitstring, | |
446 | along with one expression element at each end to record the actual | |
447 | bitstring length in bits. */ | |
448 | ||
449 | lenelt = 2 + BYTES_TO_EXP_ELEM (len); | |
450 | ||
451 | /* Ensure that we have enough available expression elements to store | |
452 | everything. */ | |
453 | ||
454 | if ((expout_ptr + lenelt) >= expout_size) | |
455 | { | |
456 | expout_size = max (expout_size * 2, expout_ptr + lenelt + 10); | |
457 | expout = (struct expression *) | |
458 | xrealloc ((char *) expout, (sizeof (struct expression) | |
459 | + EXP_ELEM_TO_BYTES (expout_size))); | |
460 | } | |
461 | ||
462 | /* Write the leading length expression element (which advances the current | |
463 | expression element index), then write the bitstring constant, and then | |
464 | write the trailing length expression element. */ | |
465 | ||
466 | write_exp_elt_longcst ((LONGEST) bits); | |
467 | strdata = (char *) &expout->elts[expout_ptr]; | |
468 | memcpy (strdata, str.ptr, len); | |
469 | expout_ptr += lenelt - 2; | |
470 | write_exp_elt_longcst ((LONGEST) bits); | |
471 | } | |
472 | ||
473 | /* Add the appropriate elements for a minimal symbol to the end of | |
c841afd5 | 474 | the expression. */ |
c906108c | 475 | |
c906108c | 476 | void |
c841afd5 | 477 | write_exp_msymbol (struct minimal_symbol *msymbol) |
c906108c | 478 | { |
bccdca4a UW |
479 | struct objfile *objfile = msymbol_objfile (msymbol); |
480 | struct gdbarch *gdbarch = get_objfile_arch (objfile); | |
481 | ||
482 | CORE_ADDR addr = SYMBOL_VALUE_ADDRESS (msymbol); | |
714835d5 | 483 | struct obj_section *section = SYMBOL_OBJ_SECTION (msymbol); |
712f90be | 484 | enum minimal_symbol_type type = MSYMBOL_TYPE (msymbol); |
bccdca4a UW |
485 | CORE_ADDR pc; |
486 | ||
487 | /* The minimal symbol might point to a function descriptor; | |
488 | resolve it to the actual code address instead. */ | |
489 | pc = gdbarch_convert_from_func_ptr_addr (gdbarch, addr, ¤t_target); | |
490 | if (pc != addr) | |
491 | { | |
492 | /* In this case, assume we have a code symbol instead of | |
493 | a data symbol. */ | |
494 | type = mst_text; | |
714835d5 | 495 | section = NULL; |
bccdca4a UW |
496 | addr = pc; |
497 | } | |
498 | ||
499 | if (overlay_debugging) | |
714835d5 | 500 | addr = symbol_overlayed_address (addr, section); |
c906108c SS |
501 | |
502 | write_exp_elt_opcode (OP_LONG); | |
a858089e | 503 | /* Let's make the type big enough to hold a 64-bit address. */ |
46bf5051 | 504 | write_exp_elt_type (objfile_type (objfile)->builtin_core_addr); |
c906108c | 505 | write_exp_elt_longcst ((LONGEST) addr); |
c906108c SS |
506 | write_exp_elt_opcode (OP_LONG); |
507 | ||
714835d5 | 508 | if (section && section->the_bfd_section->flags & SEC_THREAD_LOCAL) |
9e35dae4 | 509 | { |
9e35dae4 | 510 | write_exp_elt_opcode (UNOP_MEMVAL_TLS); |
bccdca4a | 511 | write_exp_elt_objfile (objfile); |
46bf5051 | 512 | write_exp_elt_type (objfile_type (objfile)->nodebug_tls_symbol); |
9e35dae4 DJ |
513 | write_exp_elt_opcode (UNOP_MEMVAL_TLS); |
514 | return; | |
515 | } | |
516 | ||
c906108c | 517 | write_exp_elt_opcode (UNOP_MEMVAL); |
bccdca4a | 518 | switch (type) |
c906108c SS |
519 | { |
520 | case mst_text: | |
521 | case mst_file_text: | |
522 | case mst_solib_trampoline: | |
46bf5051 | 523 | write_exp_elt_type (objfile_type (objfile)->nodebug_text_symbol); |
c906108c SS |
524 | break; |
525 | ||
526 | case mst_data: | |
527 | case mst_file_data: | |
528 | case mst_bss: | |
529 | case mst_file_bss: | |
46bf5051 | 530 | write_exp_elt_type (objfile_type (objfile)->nodebug_data_symbol); |
c906108c SS |
531 | break; |
532 | ||
533 | default: | |
46bf5051 | 534 | write_exp_elt_type (objfile_type (objfile)->nodebug_unknown_symbol); |
c906108c SS |
535 | break; |
536 | } | |
537 | write_exp_elt_opcode (UNOP_MEMVAL); | |
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 | |
544 | mark_struct_expression (void) | |
545 | { | |
546 | expout_last_struct = expout_ptr; | |
547 | } | |
548 | ||
c906108c SS |
549 | \f |
550 | /* Recognize tokens that start with '$'. These include: | |
551 | ||
c5aa993b JM |
552 | $regname A native register name or a "standard |
553 | register name". | |
c906108c | 554 | |
c5aa993b JM |
555 | $variable A convenience variable with a name chosen |
556 | by the user. | |
c906108c | 557 | |
c5aa993b JM |
558 | $digits Value history with index <digits>, starting |
559 | from the first value which has index 1. | |
c906108c | 560 | |
c5aa993b JM |
561 | $$digits Value history with index <digits> relative |
562 | to the last value. I.E. $$0 is the last | |
563 | value, $$1 is the one previous to that, $$2 | |
564 | is the one previous to $$1, etc. | |
c906108c | 565 | |
c5aa993b | 566 | $ | $0 | $$0 The last value in the value history. |
c906108c | 567 | |
c5aa993b JM |
568 | $$ An abbreviation for the second to the last |
569 | value in the value history, I.E. $$1 | |
c906108c | 570 | |
c5aa993b | 571 | */ |
c906108c SS |
572 | |
573 | void | |
fba45db2 | 574 | write_dollar_variable (struct stoken str) |
c906108c | 575 | { |
d7318818 RC |
576 | struct symbol *sym = NULL; |
577 | struct minimal_symbol *msym = NULL; | |
c4a3d09a | 578 | struct internalvar *isym = NULL; |
d7318818 | 579 | |
c906108c SS |
580 | /* Handle the tokens $digits; also $ (short for $0) and $$ (short for $$1) |
581 | and $$digits (equivalent to $<-digits> if you could type that). */ | |
582 | ||
c906108c SS |
583 | int negate = 0; |
584 | int i = 1; | |
585 | /* Double dollar means negate the number and add -1 as well. | |
586 | Thus $$ alone means -1. */ | |
587 | if (str.length >= 2 && str.ptr[1] == '$') | |
588 | { | |
589 | negate = 1; | |
590 | i = 2; | |
591 | } | |
592 | if (i == str.length) | |
593 | { | |
594 | /* Just dollars (one or two) */ | |
c5aa993b | 595 | i = -negate; |
c906108c SS |
596 | goto handle_last; |
597 | } | |
598 | /* Is the rest of the token digits? */ | |
599 | for (; i < str.length; i++) | |
600 | if (!(str.ptr[i] >= '0' && str.ptr[i] <= '9')) | |
601 | break; | |
602 | if (i == str.length) | |
603 | { | |
604 | i = atoi (str.ptr + 1 + negate); | |
605 | if (negate) | |
c5aa993b | 606 | i = -i; |
c906108c SS |
607 | goto handle_last; |
608 | } | |
c5aa993b | 609 | |
c906108c SS |
610 | /* Handle tokens that refer to machine registers: |
611 | $ followed by a register name. */ | |
d80b854b | 612 | i = user_reg_map_name_to_regnum (parse_gdbarch, |
029a67e4 | 613 | str.ptr + 1, str.length - 1); |
c5aa993b | 614 | if (i >= 0) |
c906108c SS |
615 | goto handle_register; |
616 | ||
c4a3d09a MF |
617 | /* Any names starting with $ are probably debugger internal variables. */ |
618 | ||
619 | isym = lookup_only_internalvar (copy_name (str) + 1); | |
620 | if (isym) | |
621 | { | |
622 | write_exp_elt_opcode (OP_INTERNALVAR); | |
623 | write_exp_elt_intern (isym); | |
624 | write_exp_elt_opcode (OP_INTERNALVAR); | |
625 | return; | |
626 | } | |
627 | ||
d7318818 RC |
628 | /* On some systems, such as HP-UX and hppa-linux, certain system routines |
629 | have names beginning with $ or $$. Check for those, first. */ | |
630 | ||
631 | sym = lookup_symbol (copy_name (str), (struct block *) NULL, | |
2570f2b7 | 632 | VAR_DOMAIN, (int *) NULL); |
d7318818 RC |
633 | if (sym) |
634 | { | |
635 | write_exp_elt_opcode (OP_VAR_VALUE); | |
636 | write_exp_elt_block (block_found); /* set by lookup_symbol */ | |
637 | write_exp_elt_sym (sym); | |
638 | write_exp_elt_opcode (OP_VAR_VALUE); | |
639 | return; | |
640 | } | |
641 | msym = lookup_minimal_symbol (copy_name (str), NULL, NULL); | |
642 | if (msym) | |
c906108c | 643 | { |
c841afd5 | 644 | write_exp_msymbol (msym); |
d7318818 | 645 | return; |
c906108c | 646 | } |
c5aa993b | 647 | |
c4a3d09a | 648 | /* Any other names are assumed to be debugger internal variables. */ |
c906108c SS |
649 | |
650 | write_exp_elt_opcode (OP_INTERNALVAR); | |
c4a3d09a | 651 | write_exp_elt_intern (create_internalvar (copy_name (str) + 1)); |
c5aa993b | 652 | write_exp_elt_opcode (OP_INTERNALVAR); |
c906108c | 653 | return; |
c5aa993b | 654 | handle_last: |
c906108c SS |
655 | write_exp_elt_opcode (OP_LAST); |
656 | write_exp_elt_longcst ((LONGEST) i); | |
657 | write_exp_elt_opcode (OP_LAST); | |
658 | return; | |
c5aa993b | 659 | handle_register: |
c906108c | 660 | write_exp_elt_opcode (OP_REGISTER); |
67f3407f DJ |
661 | str.length--; |
662 | str.ptr++; | |
663 | write_exp_string (str); | |
c5aa993b | 664 | write_exp_elt_opcode (OP_REGISTER); |
c906108c SS |
665 | return; |
666 | } | |
667 | ||
668 | ||
c906108c | 669 | char * |
fba45db2 | 670 | find_template_name_end (char *p) |
c906108c SS |
671 | { |
672 | int depth = 1; | |
673 | int just_seen_right = 0; | |
674 | int just_seen_colon = 0; | |
675 | int just_seen_space = 0; | |
c5aa993b | 676 | |
c906108c SS |
677 | if (!p || (*p != '<')) |
678 | return 0; | |
679 | ||
680 | while (*++p) | |
681 | { | |
682 | switch (*p) | |
c5aa993b JM |
683 | { |
684 | case '\'': | |
685 | case '\"': | |
686 | case '{': | |
687 | case '}': | |
688 | /* In future, may want to allow these?? */ | |
689 | return 0; | |
690 | case '<': | |
691 | depth++; /* start nested template */ | |
692 | if (just_seen_colon || just_seen_right || just_seen_space) | |
693 | return 0; /* but not after : or :: or > or space */ | |
694 | break; | |
695 | case '>': | |
696 | if (just_seen_colon || just_seen_right) | |
697 | return 0; /* end a (nested?) template */ | |
698 | just_seen_right = 1; /* but not after : or :: */ | |
699 | if (--depth == 0) /* also disallow >>, insist on > > */ | |
700 | return ++p; /* if outermost ended, return */ | |
701 | break; | |
702 | case ':': | |
703 | if (just_seen_space || (just_seen_colon > 1)) | |
704 | return 0; /* nested class spec coming up */ | |
705 | just_seen_colon++; /* we allow :: but not :::: */ | |
706 | break; | |
707 | case ' ': | |
708 | break; | |
709 | default: | |
710 | if (!((*p >= 'a' && *p <= 'z') || /* allow token chars */ | |
711 | (*p >= 'A' && *p <= 'Z') || | |
712 | (*p >= '0' && *p <= '9') || | |
713 | (*p == '_') || (*p == ',') || /* commas for template args */ | |
714 | (*p == '&') || (*p == '*') || /* pointer and ref types */ | |
715 | (*p == '(') || (*p == ')') || /* function types */ | |
716 | (*p == '[') || (*p == ']'))) /* array types */ | |
717 | return 0; | |
718 | } | |
c906108c | 719 | if (*p != ' ') |
c5aa993b | 720 | just_seen_space = 0; |
c906108c | 721 | if (*p != ':') |
c5aa993b | 722 | just_seen_colon = 0; |
c906108c | 723 | if (*p != '>') |
c5aa993b | 724 | just_seen_right = 0; |
c906108c SS |
725 | } |
726 | return 0; | |
727 | } | |
c5aa993b | 728 | \f |
c906108c SS |
729 | |
730 | ||
c906108c SS |
731 | /* Return a null-terminated temporary copy of the name |
732 | of a string token. */ | |
733 | ||
734 | char * | |
fba45db2 | 735 | copy_name (struct stoken token) |
c906108c | 736 | { |
3a913e29 JB |
737 | /* Make sure there's enough space for the token. */ |
738 | if (namecopy_size < token.length + 1) | |
739 | { | |
740 | namecopy_size = token.length + 1; | |
741 | namecopy = xrealloc (namecopy, token.length + 1); | |
742 | } | |
743 | ||
c906108c SS |
744 | memcpy (namecopy, token.ptr, token.length); |
745 | namecopy[token.length] = 0; | |
3a913e29 | 746 | |
c906108c SS |
747 | return namecopy; |
748 | } | |
749 | \f | |
750 | /* Reverse an expression from suffix form (in which it is constructed) | |
65d12d83 TT |
751 | to prefix form (in which we can conveniently print or execute it). |
752 | Ordinarily this always returns -1. However, if EXPOUT_LAST_STRUCT | |
753 | is not -1 (i.e., we are trying to complete a field name), it will | |
754 | return the index of the subexpression which is the left-hand-side | |
755 | of the struct operation at EXPOUT_LAST_STRUCT. */ | |
c906108c | 756 | |
65d12d83 | 757 | static int |
f86f5ca3 | 758 | prefixify_expression (struct expression *expr) |
c906108c | 759 | { |
df2a60d0 | 760 | int len = sizeof (struct expression) + EXP_ELEM_TO_BYTES (expr->nelts); |
f86f5ca3 PH |
761 | struct expression *temp; |
762 | int inpos = expr->nelts, outpos = 0; | |
c906108c SS |
763 | |
764 | temp = (struct expression *) alloca (len); | |
765 | ||
766 | /* Copy the original expression into temp. */ | |
767 | memcpy (temp, expr, len); | |
768 | ||
65d12d83 | 769 | return prefixify_subexp (temp, expr, inpos, outpos); |
c906108c SS |
770 | } |
771 | ||
24daaebc PH |
772 | /* Return the number of exp_elements in the postfix subexpression |
773 | of EXPR whose operator is at index ENDPOS - 1 in EXPR. */ | |
c906108c SS |
774 | |
775 | int | |
f86f5ca3 | 776 | length_of_subexp (struct expression *expr, int endpos) |
24daaebc PH |
777 | { |
778 | int oplen, args, i; | |
779 | ||
780 | operator_length (expr, endpos, &oplen, &args); | |
781 | ||
782 | while (args > 0) | |
783 | { | |
784 | oplen += length_of_subexp (expr, endpos - oplen); | |
785 | args--; | |
786 | } | |
787 | ||
788 | return oplen; | |
789 | } | |
790 | ||
791 | /* Sets *OPLENP to the length of the operator whose (last) index is | |
792 | ENDPOS - 1 in EXPR, and sets *ARGSP to the number of arguments that | |
793 | operator takes. */ | |
794 | ||
795 | void | |
796 | operator_length (struct expression *expr, int endpos, int *oplenp, int *argsp) | |
5f9769d1 PH |
797 | { |
798 | expr->language_defn->la_exp_desc->operator_length (expr, endpos, | |
799 | oplenp, argsp); | |
800 | } | |
801 | ||
802 | /* Default value for operator_length in exp_descriptor vectors. */ | |
803 | ||
804 | void | |
805 | operator_length_standard (struct expression *expr, int endpos, | |
806 | int *oplenp, int *argsp) | |
c906108c | 807 | { |
f86f5ca3 PH |
808 | int oplen = 1; |
809 | int args = 0; | |
0b4e1325 | 810 | enum f90_range_type range_type; |
f86f5ca3 | 811 | int i; |
c906108c SS |
812 | |
813 | if (endpos < 1) | |
8a3fe4f8 | 814 | error (_("?error in operator_length_standard")); |
c906108c SS |
815 | |
816 | i = (int) expr->elts[endpos - 1].opcode; | |
817 | ||
818 | switch (i) | |
819 | { | |
820 | /* C++ */ | |
821 | case OP_SCOPE: | |
822 | oplen = longest_to_int (expr->elts[endpos - 2].longconst); | |
823 | oplen = 5 + BYTES_TO_EXP_ELEM (oplen + 1); | |
824 | break; | |
825 | ||
826 | case OP_LONG: | |
827 | case OP_DOUBLE: | |
27bc4d80 | 828 | case OP_DECFLOAT: |
c906108c SS |
829 | case OP_VAR_VALUE: |
830 | oplen = 4; | |
831 | break; | |
832 | ||
833 | case OP_TYPE: | |
834 | case OP_BOOL: | |
835 | case OP_LAST: | |
c906108c SS |
836 | case OP_INTERNALVAR: |
837 | oplen = 3; | |
838 | break; | |
839 | ||
840 | case OP_COMPLEX: | |
c806c55a | 841 | oplen = 3; |
c906108c | 842 | args = 2; |
c5aa993b | 843 | break; |
c906108c SS |
844 | |
845 | case OP_FUNCALL: | |
846 | case OP_F77_UNDETERMINED_ARGLIST: | |
847 | oplen = 3; | |
848 | args = 1 + longest_to_int (expr->elts[endpos - 2].longconst); | |
849 | break; | |
850 | ||
072bba3b KS |
851 | case TYPE_INSTANCE: |
852 | oplen = 4 + longest_to_int (expr->elts[endpos - 2].longconst); | |
853 | args = 1; | |
854 | break; | |
855 | ||
646df18d | 856 | case OP_OBJC_MSGCALL: /* Objective C message (method) call */ |
53c551b7 AF |
857 | oplen = 4; |
858 | args = 1 + longest_to_int (expr->elts[endpos - 2].longconst); | |
859 | break; | |
860 | ||
c906108c SS |
861 | case UNOP_MAX: |
862 | case UNOP_MIN: | |
863 | oplen = 3; | |
864 | break; | |
865 | ||
c5aa993b JM |
866 | case BINOP_VAL: |
867 | case UNOP_CAST: | |
4e8f195d TT |
868 | case UNOP_DYNAMIC_CAST: |
869 | case UNOP_REINTERPRET_CAST: | |
c5aa993b | 870 | case UNOP_MEMVAL: |
c906108c SS |
871 | oplen = 3; |
872 | args = 1; | |
873 | break; | |
874 | ||
9e35dae4 DJ |
875 | case UNOP_MEMVAL_TLS: |
876 | oplen = 4; | |
877 | args = 1; | |
878 | break; | |
879 | ||
c906108c SS |
880 | case UNOP_ABS: |
881 | case UNOP_CAP: | |
882 | case UNOP_CHR: | |
883 | case UNOP_FLOAT: | |
884 | case UNOP_HIGH: | |
885 | case UNOP_ODD: | |
886 | case UNOP_ORD: | |
887 | case UNOP_TRUNC: | |
888 | oplen = 1; | |
889 | args = 1; | |
890 | break; | |
891 | ||
892 | case OP_LABELED: | |
893 | case STRUCTOP_STRUCT: | |
894 | case STRUCTOP_PTR: | |
895 | args = 1; | |
896 | /* fall through */ | |
67f3407f | 897 | case OP_REGISTER: |
c906108c SS |
898 | case OP_M2_STRING: |
899 | case OP_STRING: | |
646df18d AF |
900 | case OP_OBJC_NSSTRING: /* Objective C Foundation Class NSString constant */ |
901 | case OP_OBJC_SELECTOR: /* Objective C "@selector" pseudo-op */ | |
c906108c | 902 | case OP_NAME: |
c906108c SS |
903 | oplen = longest_to_int (expr->elts[endpos - 2].longconst); |
904 | oplen = 4 + BYTES_TO_EXP_ELEM (oplen + 1); | |
905 | break; | |
906 | ||
907 | case OP_BITSTRING: | |
908 | oplen = longest_to_int (expr->elts[endpos - 2].longconst); | |
909 | oplen = (oplen + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; | |
910 | oplen = 4 + BYTES_TO_EXP_ELEM (oplen); | |
911 | break; | |
912 | ||
913 | case OP_ARRAY: | |
914 | oplen = 4; | |
915 | args = longest_to_int (expr->elts[endpos - 2].longconst); | |
916 | args -= longest_to_int (expr->elts[endpos - 3].longconst); | |
917 | args += 1; | |
918 | break; | |
919 | ||
920 | case TERNOP_COND: | |
921 | case TERNOP_SLICE: | |
922 | case TERNOP_SLICE_COUNT: | |
923 | args = 3; | |
924 | break; | |
925 | ||
926 | /* Modula-2 */ | |
c5aa993b | 927 | case MULTI_SUBSCRIPT: |
c906108c | 928 | oplen = 3; |
c5aa993b | 929 | args = 1 + longest_to_int (expr->elts[endpos - 2].longconst); |
c906108c SS |
930 | break; |
931 | ||
932 | case BINOP_ASSIGN_MODIFY: | |
933 | oplen = 3; | |
934 | args = 2; | |
935 | break; | |
936 | ||
937 | /* C++ */ | |
938 | case OP_THIS: | |
646df18d | 939 | case OP_OBJC_SELF: |
c906108c SS |
940 | oplen = 2; |
941 | break; | |
942 | ||
0b4e1325 WZ |
943 | case OP_F90_RANGE: |
944 | oplen = 3; | |
945 | ||
946 | range_type = longest_to_int (expr->elts[endpos - 2].longconst); | |
947 | switch (range_type) | |
948 | { | |
949 | case LOW_BOUND_DEFAULT: | |
950 | case HIGH_BOUND_DEFAULT: | |
951 | args = 1; | |
952 | break; | |
953 | case BOTH_BOUND_DEFAULT: | |
954 | args = 0; | |
955 | break; | |
956 | case NONE_BOUND_DEFAULT: | |
957 | args = 2; | |
958 | break; | |
959 | } | |
960 | ||
961 | break; | |
962 | ||
c906108c SS |
963 | default: |
964 | args = 1 + (i < (int) BINOP_END); | |
965 | } | |
966 | ||
24daaebc PH |
967 | *oplenp = oplen; |
968 | *argsp = args; | |
c906108c SS |
969 | } |
970 | ||
971 | /* Copy the subexpression ending just before index INEND in INEXPR | |
972 | into OUTEXPR, starting at index OUTBEG. | |
65d12d83 TT |
973 | In the process, convert it from suffix to prefix form. |
974 | If EXPOUT_LAST_STRUCT is -1, then this function always returns -1. | |
975 | Otherwise, it returns the index of the subexpression which is the | |
976 | left-hand-side of the expression at EXPOUT_LAST_STRUCT. */ | |
c906108c | 977 | |
65d12d83 | 978 | static int |
f86f5ca3 PH |
979 | prefixify_subexp (struct expression *inexpr, |
980 | struct expression *outexpr, int inend, int outbeg) | |
c906108c | 981 | { |
24daaebc PH |
982 | int oplen; |
983 | int args; | |
f86f5ca3 | 984 | int i; |
c906108c SS |
985 | int *arglens; |
986 | enum exp_opcode opcode; | |
65d12d83 | 987 | int result = -1; |
c906108c | 988 | |
24daaebc | 989 | operator_length (inexpr, inend, &oplen, &args); |
c906108c SS |
990 | |
991 | /* Copy the final operator itself, from the end of the input | |
992 | to the beginning of the output. */ | |
993 | inend -= oplen; | |
994 | memcpy (&outexpr->elts[outbeg], &inexpr->elts[inend], | |
995 | EXP_ELEM_TO_BYTES (oplen)); | |
996 | outbeg += oplen; | |
997 | ||
65d12d83 TT |
998 | if (expout_last_struct == inend) |
999 | result = outbeg - oplen; | |
1000 | ||
c906108c SS |
1001 | /* Find the lengths of the arg subexpressions. */ |
1002 | arglens = (int *) alloca (args * sizeof (int)); | |
1003 | for (i = args - 1; i >= 0; i--) | |
1004 | { | |
1005 | oplen = length_of_subexp (inexpr, inend); | |
1006 | arglens[i] = oplen; | |
1007 | inend -= oplen; | |
1008 | } | |
1009 | ||
1010 | /* Now copy each subexpression, preserving the order of | |
1011 | the subexpressions, but prefixifying each one. | |
1012 | In this loop, inend starts at the beginning of | |
1013 | the expression this level is working on | |
1014 | and marches forward over the arguments. | |
1015 | outbeg does similarly in the output. */ | |
1016 | for (i = 0; i < args; i++) | |
1017 | { | |
65d12d83 | 1018 | int r; |
c906108c SS |
1019 | oplen = arglens[i]; |
1020 | inend += oplen; | |
65d12d83 TT |
1021 | r = prefixify_subexp (inexpr, outexpr, inend, outbeg); |
1022 | if (r != -1) | |
1023 | { | |
1024 | /* Return immediately. We probably have only parsed a | |
1025 | partial expression, so we don't want to try to reverse | |
1026 | the other operands. */ | |
1027 | return r; | |
1028 | } | |
c906108c SS |
1029 | outbeg += oplen; |
1030 | } | |
65d12d83 TT |
1031 | |
1032 | return result; | |
c906108c SS |
1033 | } |
1034 | \f | |
1035 | /* This page contains the two entry points to this file. */ | |
1036 | ||
1037 | /* Read an expression from the string *STRINGPTR points to, | |
1038 | parse it, and return a pointer to a struct expression that we malloc. | |
1039 | Use block BLOCK as the lexical context for variable names; | |
1040 | if BLOCK is zero, use the block of the selected stack frame. | |
1041 | Meanwhile, advance *STRINGPTR to point after the expression, | |
1042 | at the first nonwhite character that is not part of the expression | |
1043 | (possibly a null character). | |
1044 | ||
1045 | If COMMA is nonzero, stop if a comma is reached. */ | |
1046 | ||
1047 | struct expression * | |
fba45db2 | 1048 | parse_exp_1 (char **stringptr, struct block *block, int comma) |
e85c3284 | 1049 | { |
65d12d83 | 1050 | return parse_exp_in_context (stringptr, block, comma, 0, NULL); |
e85c3284 PH |
1051 | } |
1052 | ||
1053 | /* As for parse_exp_1, except that if VOID_CONTEXT_P, then | |
65d12d83 TT |
1054 | no value is expected from the expression. |
1055 | OUT_SUBEXP is set when attempting to complete a field name; in this | |
1056 | case it is set to the index of the subexpression on the | |
1057 | left-hand-side of the struct op. If not doing such completion, it | |
1058 | is left untouched. */ | |
e85c3284 PH |
1059 | |
1060 | static struct expression * | |
1061 | parse_exp_in_context (char **stringptr, struct block *block, int comma, | |
65d12d83 | 1062 | int void_context_p, int *out_subexp) |
c906108c | 1063 | { |
65d12d83 | 1064 | volatile struct gdb_exception except; |
c906108c | 1065 | struct cleanup *old_chain; |
65d12d83 | 1066 | int subexp; |
c906108c SS |
1067 | |
1068 | lexptr = *stringptr; | |
665132f9 | 1069 | prev_lexptr = NULL; |
c906108c SS |
1070 | |
1071 | paren_depth = 0; | |
1072 | type_stack_depth = 0; | |
65d12d83 | 1073 | expout_last_struct = -1; |
c906108c SS |
1074 | |
1075 | comma_terminates = comma; | |
1076 | ||
1077 | if (lexptr == 0 || *lexptr == 0) | |
e2e0b3e5 | 1078 | error_no_arg (_("expression to compute")); |
c906108c | 1079 | |
74b7792f | 1080 | old_chain = make_cleanup (free_funcalls, 0 /*ignore*/); |
c906108c SS |
1081 | funcall_chain = 0; |
1082 | ||
d705c43c | 1083 | expression_context_block = block; |
59f92a09 | 1084 | |
d705c43c PA |
1085 | /* If no context specified, try using the current frame, if any. */ |
1086 | if (!expression_context_block) | |
1087 | expression_context_block = get_selected_block (&expression_context_pc); | |
1088 | else | |
1089 | expression_context_pc = BLOCK_START (expression_context_block); | |
59f92a09 | 1090 | |
d705c43c | 1091 | /* Fall back to using the current source static context, if any. */ |
59f92a09 | 1092 | |
d705c43c | 1093 | if (!expression_context_block) |
59f92a09 FF |
1094 | { |
1095 | struct symtab_and_line cursal = get_current_source_symtab_and_line (); | |
1096 | if (cursal.symtab) | |
d705c43c PA |
1097 | expression_context_block |
1098 | = BLOCKVECTOR_BLOCK (BLOCKVECTOR (cursal.symtab), STATIC_BLOCK); | |
1099 | if (expression_context_block) | |
1100 | expression_context_pc = BLOCK_START (expression_context_block); | |
84f0252a | 1101 | } |
c906108c | 1102 | |
c906108c SS |
1103 | expout_size = 10; |
1104 | expout_ptr = 0; | |
1105 | expout = (struct expression *) | |
1106 | xmalloc (sizeof (struct expression) + EXP_ELEM_TO_BYTES (expout_size)); | |
1107 | expout->language_defn = current_language; | |
e17c207e | 1108 | expout->gdbarch = get_current_arch (); |
c906108c | 1109 | |
65d12d83 TT |
1110 | TRY_CATCH (except, RETURN_MASK_ALL) |
1111 | { | |
1112 | if (current_language->la_parser ()) | |
1113 | current_language->la_error (NULL); | |
1114 | } | |
1115 | if (except.reason < 0) | |
1116 | { | |
1117 | if (! in_parse_field) | |
1118 | { | |
1119 | xfree (expout); | |
1120 | throw_exception (except); | |
1121 | } | |
1122 | } | |
c906108c SS |
1123 | |
1124 | discard_cleanups (old_chain); | |
1125 | ||
1126 | /* Record the actual number of expression elements, and then | |
1127 | reallocate the expression memory so that we free up any | |
1128 | excess elements. */ | |
1129 | ||
1130 | expout->nelts = expout_ptr; | |
1131 | expout = (struct expression *) | |
1132 | xrealloc ((char *) expout, | |
1133 | sizeof (struct expression) + EXP_ELEM_TO_BYTES (expout_ptr));; | |
1134 | ||
1135 | /* Convert expression from postfix form as generated by yacc | |
1136 | parser, to a prefix form. */ | |
1137 | ||
c906108c | 1138 | if (expressiondebug) |
24daaebc PH |
1139 | dump_raw_expression (expout, gdb_stdlog, |
1140 | "before conversion to prefix form"); | |
c906108c | 1141 | |
65d12d83 TT |
1142 | subexp = prefixify_expression (expout); |
1143 | if (out_subexp) | |
1144 | *out_subexp = subexp; | |
c906108c | 1145 | |
e85c3284 PH |
1146 | current_language->la_post_parser (&expout, void_context_p); |
1147 | ||
c906108c | 1148 | if (expressiondebug) |
24daaebc | 1149 | dump_prefix_expression (expout, gdb_stdlog); |
c906108c SS |
1150 | |
1151 | *stringptr = lexptr; | |
1152 | return expout; | |
1153 | } | |
1154 | ||
1155 | /* Parse STRING as an expression, and complain if this fails | |
1156 | to use up all of the contents of STRING. */ | |
1157 | ||
1158 | struct expression * | |
fba45db2 | 1159 | parse_expression (char *string) |
c906108c | 1160 | { |
f86f5ca3 | 1161 | struct expression *exp; |
c906108c SS |
1162 | exp = parse_exp_1 (&string, 0, 0); |
1163 | if (*string) | |
8a3fe4f8 | 1164 | error (_("Junk after end of expression.")); |
c906108c SS |
1165 | return exp; |
1166 | } | |
e85c3284 | 1167 | |
65d12d83 TT |
1168 | /* Parse STRING as an expression. If parsing ends in the middle of a |
1169 | field reference, return the type of the left-hand-side of the | |
1170 | reference; furthermore, if the parsing ends in the field name, | |
a0b7aece JK |
1171 | return the field name in *NAME. In all other cases, return NULL. |
1172 | Returned non-NULL *NAME must be freed by the caller. */ | |
65d12d83 TT |
1173 | |
1174 | struct type * | |
1175 | parse_field_expression (char *string, char **name) | |
1176 | { | |
1177 | struct expression *exp = NULL; | |
1178 | struct value *val; | |
1179 | int subexp; | |
1180 | volatile struct gdb_exception except; | |
1181 | ||
1182 | TRY_CATCH (except, RETURN_MASK_ALL) | |
1183 | { | |
1184 | in_parse_field = 1; | |
1185 | exp = parse_exp_in_context (&string, 0, 0, 0, &subexp); | |
1186 | } | |
1187 | in_parse_field = 0; | |
1188 | if (except.reason < 0 || ! exp) | |
1189 | return NULL; | |
1190 | if (expout_last_struct == -1) | |
1191 | { | |
1192 | xfree (exp); | |
1193 | return NULL; | |
1194 | } | |
1195 | ||
1196 | *name = extract_field_op (exp, &subexp); | |
1197 | if (!*name) | |
1198 | { | |
1199 | xfree (exp); | |
1200 | return NULL; | |
1201 | } | |
a0b7aece JK |
1202 | /* (*NAME) is a part of the EXP memory block freed below. */ |
1203 | *name = xstrdup (*name); | |
1204 | ||
65d12d83 TT |
1205 | val = evaluate_subexpression_type (exp, subexp); |
1206 | xfree (exp); | |
1207 | ||
1208 | return value_type (val); | |
1209 | } | |
1210 | ||
e85c3284 PH |
1211 | /* A post-parser that does nothing */ |
1212 | ||
e85c3284 PH |
1213 | void |
1214 | null_post_parser (struct expression **exp, int void_context_p) | |
1215 | { | |
1216 | } | |
c906108c SS |
1217 | \f |
1218 | /* Stuff for maintaining a stack of types. Currently just used by C, but | |
1219 | probably useful for any language which declares its types "backwards". */ | |
1220 | ||
47663de5 MS |
1221 | static void |
1222 | check_type_stack_depth (void) | |
c906108c SS |
1223 | { |
1224 | if (type_stack_depth == type_stack_size) | |
1225 | { | |
1226 | type_stack_size *= 2; | |
1227 | type_stack = (union type_stack_elt *) | |
1228 | xrealloc ((char *) type_stack, type_stack_size * sizeof (*type_stack)); | |
1229 | } | |
47663de5 MS |
1230 | } |
1231 | ||
1232 | void | |
1233 | push_type (enum type_pieces tp) | |
1234 | { | |
1235 | check_type_stack_depth (); | |
c906108c SS |
1236 | type_stack[type_stack_depth++].piece = tp; |
1237 | } | |
1238 | ||
1239 | void | |
fba45db2 | 1240 | push_type_int (int n) |
c906108c | 1241 | { |
47663de5 | 1242 | check_type_stack_depth (); |
c906108c SS |
1243 | type_stack[type_stack_depth++].int_val = n; |
1244 | } | |
1245 | ||
47663de5 MS |
1246 | void |
1247 | push_type_address_space (char *string) | |
1248 | { | |
50810684 | 1249 | push_type_int (address_space_name_to_int (parse_gdbarch, string)); |
47663de5 MS |
1250 | } |
1251 | ||
c5aa993b | 1252 | enum type_pieces |
fba45db2 | 1253 | pop_type (void) |
c906108c SS |
1254 | { |
1255 | if (type_stack_depth) | |
1256 | return type_stack[--type_stack_depth].piece; | |
1257 | return tp_end; | |
1258 | } | |
1259 | ||
1260 | int | |
fba45db2 | 1261 | pop_type_int (void) |
c906108c SS |
1262 | { |
1263 | if (type_stack_depth) | |
1264 | return type_stack[--type_stack_depth].int_val; | |
1265 | /* "Can't happen". */ | |
1266 | return 0; | |
1267 | } | |
1268 | ||
1269 | /* Pop the type stack and return the type which corresponds to FOLLOW_TYPE | |
1270 | as modified by all the stuff on the stack. */ | |
1271 | struct type * | |
fba45db2 | 1272 | follow_types (struct type *follow_type) |
c906108c SS |
1273 | { |
1274 | int done = 0; | |
2e2394a0 MS |
1275 | int make_const = 0; |
1276 | int make_volatile = 0; | |
47663de5 | 1277 | int make_addr_space = 0; |
c906108c | 1278 | int array_size; |
c906108c SS |
1279 | |
1280 | while (!done) | |
1281 | switch (pop_type ()) | |
1282 | { | |
1283 | case tp_end: | |
1284 | done = 1; | |
2e2394a0 MS |
1285 | if (make_const) |
1286 | follow_type = make_cv_type (make_const, | |
1287 | TYPE_VOLATILE (follow_type), | |
1288 | follow_type, 0); | |
1289 | if (make_volatile) | |
1290 | follow_type = make_cv_type (TYPE_CONST (follow_type), | |
1291 | make_volatile, | |
1292 | follow_type, 0); | |
47663de5 MS |
1293 | if (make_addr_space) |
1294 | follow_type = make_type_with_address_space (follow_type, | |
1295 | make_addr_space); | |
1296 | make_const = make_volatile = 0; | |
1297 | make_addr_space = 0; | |
2e2394a0 MS |
1298 | break; |
1299 | case tp_const: | |
1300 | make_const = 1; | |
1301 | break; | |
1302 | case tp_volatile: | |
1303 | make_volatile = 1; | |
c906108c | 1304 | break; |
47663de5 MS |
1305 | case tp_space_identifier: |
1306 | make_addr_space = pop_type_int (); | |
1307 | break; | |
c906108c SS |
1308 | case tp_pointer: |
1309 | follow_type = lookup_pointer_type (follow_type); | |
2e2394a0 MS |
1310 | if (make_const) |
1311 | follow_type = make_cv_type (make_const, | |
1312 | TYPE_VOLATILE (follow_type), | |
1313 | follow_type, 0); | |
1314 | if (make_volatile) | |
1315 | follow_type = make_cv_type (TYPE_CONST (follow_type), | |
1316 | make_volatile, | |
1317 | follow_type, 0); | |
47663de5 MS |
1318 | if (make_addr_space) |
1319 | follow_type = make_type_with_address_space (follow_type, | |
1320 | make_addr_space); | |
2e2394a0 | 1321 | make_const = make_volatile = 0; |
47663de5 | 1322 | make_addr_space = 0; |
c906108c SS |
1323 | break; |
1324 | case tp_reference: | |
1325 | follow_type = lookup_reference_type (follow_type); | |
2e2394a0 | 1326 | if (make_const) |
47663de5 MS |
1327 | follow_type = make_cv_type (make_const, |
1328 | TYPE_VOLATILE (follow_type), | |
1329 | follow_type, 0); | |
2e2394a0 | 1330 | if (make_volatile) |
47663de5 MS |
1331 | follow_type = make_cv_type (TYPE_CONST (follow_type), |
1332 | make_volatile, | |
1333 | follow_type, 0); | |
1334 | if (make_addr_space) | |
1335 | follow_type = make_type_with_address_space (follow_type, | |
1336 | make_addr_space); | |
2e2394a0 | 1337 | make_const = make_volatile = 0; |
47663de5 | 1338 | make_addr_space = 0; |
c906108c SS |
1339 | break; |
1340 | case tp_array: | |
1341 | array_size = pop_type_int (); | |
1342 | /* FIXME-type-allocation: need a way to free this type when we are | |
1343 | done with it. */ | |
c906108c | 1344 | follow_type = |
e3506a9f UW |
1345 | lookup_array_range_type (follow_type, |
1346 | 0, array_size >= 0 ? array_size - 1 : 0); | |
c906108c | 1347 | if (array_size < 0) |
d78df370 | 1348 | TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (follow_type) = 1; |
c906108c SS |
1349 | break; |
1350 | case tp_function: | |
1351 | /* FIXME-type-allocation: need a way to free this type when we are | |
1352 | done with it. */ | |
1353 | follow_type = lookup_function_type (follow_type); | |
1354 | break; | |
1355 | } | |
1356 | return follow_type; | |
1357 | } | |
1358 | \f | |
f461f5cf PM |
1359 | /* This function avoids direct calls to fprintf |
1360 | in the parser generated debug code. */ | |
1361 | void | |
1362 | parser_fprintf (FILE *x, const char *y, ...) | |
1363 | { | |
1364 | va_list args; | |
1365 | va_start (args, y); | |
1366 | if (x == stderr) | |
1367 | vfprintf_unfiltered (gdb_stderr, y, args); | |
1368 | else | |
1369 | { | |
1370 | fprintf_unfiltered (gdb_stderr, " Unknown FILE used.\n"); | |
1371 | vfprintf_unfiltered (gdb_stderr, y, args); | |
1372 | } | |
1373 | va_end (args); | |
1374 | } | |
1375 | ||
ac9a91a7 | 1376 | void |
fba45db2 | 1377 | _initialize_parse (void) |
ac9a91a7 JM |
1378 | { |
1379 | type_stack_size = 80; | |
1380 | type_stack_depth = 0; | |
1381 | type_stack = (union type_stack_elt *) | |
1382 | xmalloc (type_stack_size * sizeof (*type_stack)); | |
1383 | ||
85c07804 AC |
1384 | add_setshow_zinteger_cmd ("expression", class_maintenance, |
1385 | &expressiondebug, _("\ | |
1386 | Set expression debugging."), _("\ | |
1387 | Show expression debugging."), _("\ | |
1388 | When non-zero, the internal representation of expressions will be printed."), | |
1389 | NULL, | |
920d2a44 | 1390 | show_expressiondebug, |
85c07804 | 1391 | &setdebuglist, &showdebuglist); |
92981e24 TT |
1392 | add_setshow_boolean_cmd ("parser", class_maintenance, |
1393 | &parser_debug, _("\ | |
1394 | Set parser debugging."), _("\ | |
1395 | Show parser debugging."), _("\ | |
1396 | When non-zero, expression parser tracing will be enabled."), | |
1397 | NULL, | |
1398 | show_parserdebug, | |
1399 | &setdebuglist, &showdebuglist); | |
c906108c | 1400 | } |