1 /* Parse expressions for GDB.
3 Copyright (C) 1986-2017 Free Software Foundation, Inc.
5 Modified from expread.y by the Department of Computer Science at the
6 State University of New York at Buffalo, 1991.
8 This file is part of GDB.
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
12 the Free Software Foundation; either version 3 of the License, or
13 (at your option) any later version.
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.
20 You should have received a copy of the GNU General Public License
21 along with this program. If not, see <http://www.gnu.org/licenses/>. */
23 /* Parse an expression from text in a string,
24 and return the result as a struct expression pointer.
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. */
34 #include "arch-utils.h"
38 #include "expression.h"
43 #include "parser-defs.h"
45 #include "symfile.h" /* for overlay functions */
47 #include "target-float.h"
51 #include "user-regs.h"
53 #include "common/gdb_optional.h"
55 /* Standard set of definitions for printing, dumping, prefixifying,
56 * and evaluating expressions. */
58 const struct exp_descriptor exp_descriptor_standard
=
60 print_subexp_standard
,
61 operator_length_standard
,
62 operator_check_standard
,
64 dump_subexp_body_standard
,
65 evaluate_subexp_standard
68 /* Global variables declared in parser-defs.h (and commented there). */
69 const struct block
*expression_context_block
;
70 CORE_ADDR expression_context_pc
;
71 const struct block
*innermost_block
;
73 static struct type_stack type_stack
;
75 const char *prev_lexptr
;
79 /* True if parsing an expression to attempt completion. */
82 /* The index of the last struct expression directly before a '.' or
83 '->'. This is set when parsing and is only used when completing a
84 field name. It is -1 if no dereference operation was found. */
85 static int expout_last_struct
= -1;
87 /* If we are completing a tagged type name, this will be nonzero. */
88 static enum type_code expout_tag_completion_type
= TYPE_CODE_UNDEF
;
90 /* The token for tagged type name completion. */
91 static char *expout_completion_name
;
94 static unsigned int expressiondebug
= 0;
96 show_expressiondebug (struct ui_file
*file
, int from_tty
,
97 struct cmd_list_element
*c
, const char *value
)
99 fprintf_filtered (file
, _("Expression debugging is %s.\n"), value
);
103 /* Non-zero if an expression parser should set yydebug. */
107 show_parserdebug (struct ui_file
*file
, int from_tty
,
108 struct cmd_list_element
*c
, const char *value
)
110 fprintf_filtered (file
, _("Parser debugging is %s.\n"), value
);
114 static int prefixify_subexp (struct expression
*, struct expression
*, int,
117 static expression_up
parse_exp_in_context (const char **, CORE_ADDR
,
118 const struct block
*, int,
120 static expression_up
parse_exp_in_context_1 (const char **, CORE_ADDR
,
121 const struct block
*, int,
124 /* Data structure for saving values of arglist_len for function calls whose
125 arguments contain other function calls. */
127 static std::vector
<int> *funcall_chain
;
129 /* Begin counting arguments for a function call,
130 saving the data about any containing call. */
135 funcall_chain
->push_back (arglist_len
);
139 /* Return the number of arguments in a function call just terminated,
140 and restore the data for the containing function call. */
145 int val
= arglist_len
;
146 arglist_len
= funcall_chain
->back ();
147 funcall_chain
->pop_back ();
153 /* See definition in parser-defs.h. */
155 parser_state::parser_state (size_t initial_size
,
156 const struct language_defn
*lang
,
157 struct gdbarch
*gdbarch
)
158 : expout_size (initial_size
),
159 expout (XNEWVAR (expression
,
161 + EXP_ELEM_TO_BYTES (expout_size
)))),
164 expout
->language_defn
= lang
;
165 expout
->gdbarch
= gdbarch
;
169 parser_state::release ()
171 /* Record the actual number of expression elements, and then
172 reallocate the expression memory so that we free up any
175 expout
->nelts
= expout_ptr
;
176 expout
.reset (XRESIZEVAR (expression
, expout
.release (),
178 + EXP_ELEM_TO_BYTES (expout_ptr
))));
180 return std::move (expout
);
183 /* This page contains the functions for adding data to the struct expression
184 being constructed. */
186 /* Add one element to the end of the expression. */
188 /* To avoid a bug in the Sun 4 compiler, we pass things that can fit into
189 a register through here. */
192 write_exp_elt (struct parser_state
*ps
, const union exp_element
*expelt
)
194 if (ps
->expout_ptr
>= ps
->expout_size
)
196 ps
->expout_size
*= 2;
197 ps
->expout
.reset (XRESIZEVAR (expression
, ps
->expout
.release (),
199 + EXP_ELEM_TO_BYTES (ps
->expout_size
))));
201 ps
->expout
->elts
[ps
->expout_ptr
++] = *expelt
;
205 write_exp_elt_opcode (struct parser_state
*ps
, enum exp_opcode expelt
)
207 union exp_element tmp
;
209 memset (&tmp
, 0, sizeof (union exp_element
));
211 write_exp_elt (ps
, &tmp
);
215 write_exp_elt_sym (struct parser_state
*ps
, struct symbol
*expelt
)
217 union exp_element tmp
;
219 memset (&tmp
, 0, sizeof (union exp_element
));
221 write_exp_elt (ps
, &tmp
);
225 write_exp_elt_msym (struct parser_state
*ps
, minimal_symbol
*expelt
)
227 union exp_element tmp
;
229 memset (&tmp
, 0, sizeof (union exp_element
));
230 tmp
.msymbol
= expelt
;
231 write_exp_elt (ps
, &tmp
);
235 write_exp_elt_block (struct parser_state
*ps
, const struct block
*b
)
237 union exp_element tmp
;
239 memset (&tmp
, 0, sizeof (union exp_element
));
241 write_exp_elt (ps
, &tmp
);
245 write_exp_elt_objfile (struct parser_state
*ps
, struct objfile
*objfile
)
247 union exp_element tmp
;
249 memset (&tmp
, 0, sizeof (union exp_element
));
250 tmp
.objfile
= objfile
;
251 write_exp_elt (ps
, &tmp
);
255 write_exp_elt_longcst (struct parser_state
*ps
, LONGEST expelt
)
257 union exp_element tmp
;
259 memset (&tmp
, 0, sizeof (union exp_element
));
260 tmp
.longconst
= expelt
;
261 write_exp_elt (ps
, &tmp
);
265 write_exp_elt_floatcst (struct parser_state
*ps
, const gdb_byte expelt
[16])
267 union exp_element tmp
;
270 for (index
= 0; index
< 16; index
++)
271 tmp
.floatconst
[index
] = expelt
[index
];
273 write_exp_elt (ps
, &tmp
);
277 write_exp_elt_type (struct parser_state
*ps
, struct type
*expelt
)
279 union exp_element tmp
;
281 memset (&tmp
, 0, sizeof (union exp_element
));
283 write_exp_elt (ps
, &tmp
);
287 write_exp_elt_intern (struct parser_state
*ps
, struct internalvar
*expelt
)
289 union exp_element tmp
;
291 memset (&tmp
, 0, sizeof (union exp_element
));
292 tmp
.internalvar
= expelt
;
293 write_exp_elt (ps
, &tmp
);
296 /* Add a string constant to the end of the expression.
298 String constants are stored by first writing an expression element
299 that contains the length of the string, then stuffing the string
300 constant itself into however many expression elements are needed
301 to hold it, and then writing another expression element that contains
302 the length of the string. I.e. an expression element at each end of
303 the string records the string length, so you can skip over the
304 expression elements containing the actual string bytes from either
305 end of the string. Note that this also allows gdb to handle
306 strings with embedded null bytes, as is required for some languages.
308 Don't be fooled by the fact that the string is null byte terminated,
309 this is strictly for the convenience of debugging gdb itself.
310 Gdb does not depend up the string being null terminated, since the
311 actual length is recorded in expression elements at each end of the
312 string. The null byte is taken into consideration when computing how
313 many expression elements are required to hold the string constant, of
318 write_exp_string (struct parser_state
*ps
, struct stoken str
)
320 int len
= str
.length
;
324 /* Compute the number of expression elements required to hold the string
325 (including a null byte terminator), along with one expression element
326 at each end to record the actual string length (not including the
327 null byte terminator). */
329 lenelt
= 2 + BYTES_TO_EXP_ELEM (len
+ 1);
331 increase_expout_size (ps
, lenelt
);
333 /* Write the leading length expression element (which advances the current
334 expression element index), then write the string constant followed by a
335 terminating null byte, and then write the trailing length expression
338 write_exp_elt_longcst (ps
, (LONGEST
) len
);
339 strdata
= (char *) &ps
->expout
->elts
[ps
->expout_ptr
];
340 memcpy (strdata
, str
.ptr
, len
);
341 *(strdata
+ len
) = '\0';
342 ps
->expout_ptr
+= lenelt
- 2;
343 write_exp_elt_longcst (ps
, (LONGEST
) len
);
346 /* Add a vector of string constants to the end of the expression.
348 This adds an OP_STRING operation, but encodes the contents
349 differently from write_exp_string. The language is expected to
350 handle evaluation of this expression itself.
352 After the usual OP_STRING header, TYPE is written into the
353 expression as a long constant. The interpretation of this field is
354 up to the language evaluator.
356 Next, each string in VEC is written. The length is written as a
357 long constant, followed by the contents of the string. */
360 write_exp_string_vector (struct parser_state
*ps
, int type
,
361 struct stoken_vector
*vec
)
366 /* Compute the size. We compute the size in number of slots to
367 avoid issues with string padding. */
369 for (i
= 0; i
< vec
->len
; ++i
)
371 /* One slot for the length of this element, plus the number of
372 slots needed for this string. */
373 n_slots
+= 1 + BYTES_TO_EXP_ELEM (vec
->tokens
[i
].length
);
376 /* One more slot for the type of the string. */
379 /* Now compute a phony string length. */
380 len
= EXP_ELEM_TO_BYTES (n_slots
) - 1;
383 increase_expout_size (ps
, n_slots
);
385 write_exp_elt_opcode (ps
, OP_STRING
);
386 write_exp_elt_longcst (ps
, len
);
387 write_exp_elt_longcst (ps
, type
);
389 for (i
= 0; i
< vec
->len
; ++i
)
391 write_exp_elt_longcst (ps
, vec
->tokens
[i
].length
);
392 memcpy (&ps
->expout
->elts
[ps
->expout_ptr
], vec
->tokens
[i
].ptr
,
393 vec
->tokens
[i
].length
);
394 ps
->expout_ptr
+= BYTES_TO_EXP_ELEM (vec
->tokens
[i
].length
);
397 write_exp_elt_longcst (ps
, len
);
398 write_exp_elt_opcode (ps
, OP_STRING
);
401 /* Add a bitstring constant to the end of the expression.
403 Bitstring constants are stored by first writing an expression element
404 that contains the length of the bitstring (in bits), then stuffing the
405 bitstring constant itself into however many expression elements are
406 needed to hold it, and then writing another expression element that
407 contains the length of the bitstring. I.e. an expression element at
408 each end of the bitstring records the bitstring length, so you can skip
409 over the expression elements containing the actual bitstring bytes from
410 either end of the bitstring. */
413 write_exp_bitstring (struct parser_state
*ps
, struct stoken str
)
415 int bits
= str
.length
; /* length in bits */
416 int len
= (bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
420 /* Compute the number of expression elements required to hold the bitstring,
421 along with one expression element at each end to record the actual
422 bitstring length in bits. */
424 lenelt
= 2 + BYTES_TO_EXP_ELEM (len
);
426 increase_expout_size (ps
, lenelt
);
428 /* Write the leading length expression element (which advances the current
429 expression element index), then write the bitstring constant, and then
430 write the trailing length expression element. */
432 write_exp_elt_longcst (ps
, (LONGEST
) bits
);
433 strdata
= (char *) &ps
->expout
->elts
[ps
->expout_ptr
];
434 memcpy (strdata
, str
.ptr
, len
);
435 ps
->expout_ptr
+= lenelt
- 2;
436 write_exp_elt_longcst (ps
, (LONGEST
) bits
);
439 /* Return the type of MSYMBOL, a minimal symbol of OBJFILE. If
440 ADDRESS_P is not NULL, set it to the MSYMBOL's resolved
444 find_minsym_type_and_address (minimal_symbol
*msymbol
,
445 struct objfile
*objfile
,
446 CORE_ADDR
*address_p
)
448 bound_minimal_symbol bound_msym
= {msymbol
, objfile
};
449 struct gdbarch
*gdbarch
= get_objfile_arch (objfile
);
450 struct obj_section
*section
= MSYMBOL_OBJ_SECTION (objfile
, msymbol
);
451 enum minimal_symbol_type type
= MSYMBOL_TYPE (msymbol
);
454 bool is_tls
= (section
!= NULL
455 && section
->the_bfd_section
->flags
& SEC_THREAD_LOCAL
);
457 /* Addresses of TLS symbols are really offsets into a
458 per-objfile/per-thread storage block. */
459 CORE_ADDR addr
= (is_tls
460 ? MSYMBOL_VALUE_RAW_ADDRESS (bound_msym
.minsym
)
461 : BMSYMBOL_VALUE_ADDRESS (bound_msym
));
463 /* The minimal symbol might point to a function descriptor;
464 resolve it to the actual code address instead. */
465 pc
= gdbarch_convert_from_func_ptr_addr (gdbarch
, addr
, ¤t_target
);
468 struct bound_minimal_symbol ifunc_msym
= lookup_minimal_symbol_by_pc (pc
);
470 /* In this case, assume we have a code symbol instead of
473 if (ifunc_msym
.minsym
!= NULL
474 && MSYMBOL_TYPE (ifunc_msym
.minsym
) == mst_text_gnu_ifunc
475 && BMSYMBOL_VALUE_ADDRESS (ifunc_msym
) == pc
)
477 /* A function descriptor has been resolved but PC is still in the
478 STT_GNU_IFUNC resolver body (such as because inferior does not
479 run to be able to call it). */
481 type
= mst_text_gnu_ifunc
;
489 if (overlay_debugging
)
490 addr
= symbol_overlayed_address (addr
, section
);
494 /* Skip translation if caller does not need the address. */
495 if (address_p
!= NULL
)
496 *address_p
= target_translate_tls_address (objfile
, addr
);
497 return objfile_type (objfile
)->nodebug_tls_symbol
;
500 if (address_p
!= NULL
)
507 case mst_solib_trampoline
:
508 return objfile_type (objfile
)->nodebug_text_symbol
;
510 case mst_text_gnu_ifunc
:
511 return objfile_type (objfile
)->nodebug_text_gnu_ifunc_symbol
;
517 return objfile_type (objfile
)->nodebug_data_symbol
;
519 case mst_slot_got_plt
:
520 return objfile_type (objfile
)->nodebug_got_plt_symbol
;
523 return objfile_type (objfile
)->nodebug_unknown_symbol
;
527 /* Add the appropriate elements for a minimal symbol to the end of
531 write_exp_msymbol (struct parser_state
*ps
,
532 struct bound_minimal_symbol bound_msym
)
534 write_exp_elt_opcode (ps
, OP_VAR_MSYM_VALUE
);
535 write_exp_elt_objfile (ps
, bound_msym
.objfile
);
536 write_exp_elt_msym (ps
, bound_msym
.minsym
);
537 write_exp_elt_opcode (ps
, OP_VAR_MSYM_VALUE
);
540 /* Mark the current index as the starting location of a structure
541 expression. This is used when completing on field names. */
544 mark_struct_expression (struct parser_state
*ps
)
546 gdb_assert (parse_completion
547 && expout_tag_completion_type
== TYPE_CODE_UNDEF
);
548 expout_last_struct
= ps
->expout_ptr
;
551 /* Indicate that the current parser invocation is completing a tag.
552 TAG is the type code of the tag, and PTR and LENGTH represent the
553 start of the tag name. */
556 mark_completion_tag (enum type_code tag
, const char *ptr
, int length
)
558 gdb_assert (parse_completion
559 && expout_tag_completion_type
== TYPE_CODE_UNDEF
560 && expout_completion_name
== NULL
561 && expout_last_struct
== -1);
562 gdb_assert (tag
== TYPE_CODE_UNION
563 || tag
== TYPE_CODE_STRUCT
564 || tag
== TYPE_CODE_ENUM
);
565 expout_tag_completion_type
= tag
;
566 expout_completion_name
= (char *) xmalloc (length
+ 1);
567 memcpy (expout_completion_name
, ptr
, length
);
568 expout_completion_name
[length
] = '\0';
572 /* Recognize tokens that start with '$'. These include:
574 $regname A native register name or a "standard
577 $variable A convenience variable with a name chosen
580 $digits Value history with index <digits>, starting
581 from the first value which has index 1.
583 $$digits Value history with index <digits> relative
584 to the last value. I.e. $$0 is the last
585 value, $$1 is the one previous to that, $$2
586 is the one previous to $$1, etc.
588 $ | $0 | $$0 The last value in the value history.
590 $$ An abbreviation for the second to the last
591 value in the value history, I.e. $$1 */
594 write_dollar_variable (struct parser_state
*ps
, struct stoken str
)
596 struct block_symbol sym
;
597 struct bound_minimal_symbol msym
;
598 struct internalvar
*isym
= NULL
;
600 /* Handle the tokens $digits; also $ (short for $0) and $$ (short for $$1)
601 and $$digits (equivalent to $<-digits> if you could type that). */
605 /* Double dollar means negate the number and add -1 as well.
606 Thus $$ alone means -1. */
607 if (str
.length
>= 2 && str
.ptr
[1] == '$')
614 /* Just dollars (one or two). */
618 /* Is the rest of the token digits? */
619 for (; i
< str
.length
; i
++)
620 if (!(str
.ptr
[i
] >= '0' && str
.ptr
[i
] <= '9'))
624 i
= atoi (str
.ptr
+ 1 + negate
);
630 /* Handle tokens that refer to machine registers:
631 $ followed by a register name. */
632 i
= user_reg_map_name_to_regnum (parse_gdbarch (ps
),
633 str
.ptr
+ 1, str
.length
- 1);
635 goto handle_register
;
637 /* Any names starting with $ are probably debugger internal variables. */
639 isym
= lookup_only_internalvar (copy_name (str
) + 1);
642 write_exp_elt_opcode (ps
, OP_INTERNALVAR
);
643 write_exp_elt_intern (ps
, isym
);
644 write_exp_elt_opcode (ps
, OP_INTERNALVAR
);
648 /* On some systems, such as HP-UX and hppa-linux, certain system routines
649 have names beginning with $ or $$. Check for those, first. */
651 sym
= lookup_symbol (copy_name (str
), (struct block
*) NULL
,
655 write_exp_elt_opcode (ps
, OP_VAR_VALUE
);
656 write_exp_elt_block (ps
, sym
.block
);
657 write_exp_elt_sym (ps
, sym
.symbol
);
658 write_exp_elt_opcode (ps
, OP_VAR_VALUE
);
661 msym
= lookup_bound_minimal_symbol (copy_name (str
));
664 write_exp_msymbol (ps
, msym
);
668 /* Any other names are assumed to be debugger internal variables. */
670 write_exp_elt_opcode (ps
, OP_INTERNALVAR
);
671 write_exp_elt_intern (ps
, create_internalvar (copy_name (str
) + 1));
672 write_exp_elt_opcode (ps
, OP_INTERNALVAR
);
675 write_exp_elt_opcode (ps
, OP_LAST
);
676 write_exp_elt_longcst (ps
, (LONGEST
) i
);
677 write_exp_elt_opcode (ps
, OP_LAST
);
680 write_exp_elt_opcode (ps
, OP_REGISTER
);
683 write_exp_string (ps
, str
);
684 write_exp_elt_opcode (ps
, OP_REGISTER
);
690 find_template_name_end (const char *p
)
693 int just_seen_right
= 0;
694 int just_seen_colon
= 0;
695 int just_seen_space
= 0;
697 if (!p
|| (*p
!= '<'))
708 /* In future, may want to allow these?? */
711 depth
++; /* start nested template */
712 if (just_seen_colon
|| just_seen_right
|| just_seen_space
)
713 return 0; /* but not after : or :: or > or space */
716 if (just_seen_colon
|| just_seen_right
)
717 return 0; /* end a (nested?) template */
718 just_seen_right
= 1; /* but not after : or :: */
719 if (--depth
== 0) /* also disallow >>, insist on > > */
720 return ++p
; /* if outermost ended, return */
723 if (just_seen_space
|| (just_seen_colon
> 1))
724 return 0; /* nested class spec coming up */
725 just_seen_colon
++; /* we allow :: but not :::: */
730 if (!((*p
>= 'a' && *p
<= 'z') || /* allow token chars */
731 (*p
>= 'A' && *p
<= 'Z') ||
732 (*p
>= '0' && *p
<= '9') ||
733 (*p
== '_') || (*p
== ',') || /* commas for template args */
734 (*p
== '&') || (*p
== '*') || /* pointer and ref types */
735 (*p
== '(') || (*p
== ')') || /* function types */
736 (*p
== '[') || (*p
== ']'))) /* array types */
750 /* Return a null-terminated temporary copy of the name of a string token.
752 Tokens that refer to names do so with explicit pointer and length,
753 so they can share the storage that lexptr is parsing.
754 When it is necessary to pass a name to a function that expects
755 a null-terminated string, the substring is copied out
756 into a separate block of storage.
758 N.B. A single buffer is reused on each call. */
761 copy_name (struct stoken token
)
763 /* A temporary buffer for identifiers, so we can null-terminate them.
764 We allocate this with xrealloc. parse_exp_1 used to allocate with
765 alloca, using the size of the whole expression as a conservative
766 estimate of the space needed. However, macro expansion can
767 introduce names longer than the original expression; there's no
768 practical way to know beforehand how large that might be. */
769 static char *namecopy
;
770 static size_t namecopy_size
;
772 /* Make sure there's enough space for the token. */
773 if (namecopy_size
< token
.length
+ 1)
775 namecopy_size
= token
.length
+ 1;
776 namecopy
= (char *) xrealloc (namecopy
, token
.length
+ 1);
779 memcpy (namecopy
, token
.ptr
, token
.length
);
780 namecopy
[token
.length
] = 0;
786 /* See comments on parser-defs.h. */
789 prefixify_expression (struct expression
*expr
)
791 int len
= sizeof (struct expression
) + EXP_ELEM_TO_BYTES (expr
->nelts
);
792 struct expression
*temp
;
793 int inpos
= expr
->nelts
, outpos
= 0;
795 temp
= (struct expression
*) alloca (len
);
797 /* Copy the original expression into temp. */
798 memcpy (temp
, expr
, len
);
800 return prefixify_subexp (temp
, expr
, inpos
, outpos
);
803 /* Return the number of exp_elements in the postfix subexpression
804 of EXPR whose operator is at index ENDPOS - 1 in EXPR. */
807 length_of_subexp (struct expression
*expr
, int endpos
)
811 operator_length (expr
, endpos
, &oplen
, &args
);
815 oplen
+= length_of_subexp (expr
, endpos
- oplen
);
822 /* Sets *OPLENP to the length of the operator whose (last) index is
823 ENDPOS - 1 in EXPR, and sets *ARGSP to the number of arguments that
827 operator_length (const struct expression
*expr
, int endpos
, int *oplenp
,
830 expr
->language_defn
->la_exp_desc
->operator_length (expr
, endpos
,
834 /* Default value for operator_length in exp_descriptor vectors. */
837 operator_length_standard (const struct expression
*expr
, int endpos
,
838 int *oplenp
, int *argsp
)
842 enum range_type range_type
;
846 error (_("?error in operator_length_standard"));
848 i
= (int) expr
->elts
[endpos
- 1].opcode
;
854 oplen
= longest_to_int (expr
->elts
[endpos
- 2].longconst
);
855 oplen
= 5 + BYTES_TO_EXP_ELEM (oplen
+ 1);
861 case OP_VAR_MSYM_VALUE
:
865 case OP_FUNC_STATIC_VAR
:
866 oplen
= longest_to_int (expr
->elts
[endpos
- 2].longconst
);
867 oplen
= 4 + BYTES_TO_EXP_ELEM (oplen
+ 1);
875 case OP_VAR_ENTRY_VALUE
:
885 case OP_F77_UNDETERMINED_ARGLIST
:
887 args
= 1 + longest_to_int (expr
->elts
[endpos
- 2].longconst
);
891 oplen
= 5 + longest_to_int (expr
->elts
[endpos
- 2].longconst
);
895 case OP_OBJC_MSGCALL
: /* Objective C message (method) call. */
897 args
= 1 + longest_to_int (expr
->elts
[endpos
- 2].longconst
);
906 case UNOP_DYNAMIC_CAST
:
907 case UNOP_REINTERPRET_CAST
:
908 case UNOP_MEMVAL_TYPE
:
936 oplen
= longest_to_int (expr
->elts
[endpos
- 2].longconst
);
937 oplen
= 4 + BYTES_TO_EXP_ELEM (oplen
+ 1);
942 case STRUCTOP_STRUCT
:
949 case OP_OBJC_NSSTRING
: /* Objective C Foundation Class
950 NSString constant. */
951 case OP_OBJC_SELECTOR
: /* Objective C "@selector" pseudo-op. */
953 oplen
= longest_to_int (expr
->elts
[endpos
- 2].longconst
);
954 oplen
= 4 + BYTES_TO_EXP_ELEM (oplen
+ 1);
959 args
= longest_to_int (expr
->elts
[endpos
- 2].longconst
);
960 args
-= longest_to_int (expr
->elts
[endpos
- 3].longconst
);
970 case MULTI_SUBSCRIPT
:
972 args
= 1 + longest_to_int (expr
->elts
[endpos
- 2].longconst
);
975 case BINOP_ASSIGN_MODIFY
:
987 range_type
= (enum range_type
)
988 longest_to_int (expr
->elts
[endpos
- 2].longconst
);
992 case LOW_BOUND_DEFAULT
:
993 case HIGH_BOUND_DEFAULT
:
996 case BOTH_BOUND_DEFAULT
:
999 case NONE_BOUND_DEFAULT
:
1007 args
= 1 + (i
< (int) BINOP_END
);
1014 /* Copy the subexpression ending just before index INEND in INEXPR
1015 into OUTEXPR, starting at index OUTBEG.
1016 In the process, convert it from suffix to prefix form.
1017 If EXPOUT_LAST_STRUCT is -1, then this function always returns -1.
1018 Otherwise, it returns the index of the subexpression which is the
1019 left-hand-side of the expression at EXPOUT_LAST_STRUCT. */
1022 prefixify_subexp (struct expression
*inexpr
,
1023 struct expression
*outexpr
, int inend
, int outbeg
)
1031 operator_length (inexpr
, inend
, &oplen
, &args
);
1033 /* Copy the final operator itself, from the end of the input
1034 to the beginning of the output. */
1036 memcpy (&outexpr
->elts
[outbeg
], &inexpr
->elts
[inend
],
1037 EXP_ELEM_TO_BYTES (oplen
));
1040 if (expout_last_struct
== inend
)
1041 result
= outbeg
- oplen
;
1043 /* Find the lengths of the arg subexpressions. */
1044 arglens
= (int *) alloca (args
* sizeof (int));
1045 for (i
= args
- 1; i
>= 0; i
--)
1047 oplen
= length_of_subexp (inexpr
, inend
);
1052 /* Now copy each subexpression, preserving the order of
1053 the subexpressions, but prefixifying each one.
1054 In this loop, inend starts at the beginning of
1055 the expression this level is working on
1056 and marches forward over the arguments.
1057 outbeg does similarly in the output. */
1058 for (i
= 0; i
< args
; i
++)
1064 r
= prefixify_subexp (inexpr
, outexpr
, inend
, outbeg
);
1067 /* Return immediately. We probably have only parsed a
1068 partial expression, so we don't want to try to reverse
1069 the other operands. */
1078 /* Read an expression from the string *STRINGPTR points to,
1079 parse it, and return a pointer to a struct expression that we malloc.
1080 Use block BLOCK as the lexical context for variable names;
1081 if BLOCK is zero, use the block of the selected stack frame.
1082 Meanwhile, advance *STRINGPTR to point after the expression,
1083 at the first nonwhite character that is not part of the expression
1084 (possibly a null character).
1086 If COMMA is nonzero, stop if a comma is reached. */
1089 parse_exp_1 (const char **stringptr
, CORE_ADDR pc
, const struct block
*block
,
1092 return parse_exp_in_context (stringptr
, pc
, block
, comma
, 0, NULL
);
1095 static expression_up
1096 parse_exp_in_context (const char **stringptr
, CORE_ADDR pc
,
1097 const struct block
*block
,
1098 int comma
, int void_context_p
, int *out_subexp
)
1100 return parse_exp_in_context_1 (stringptr
, pc
, block
, comma
,
1101 void_context_p
, out_subexp
);
1104 /* As for parse_exp_1, except that if VOID_CONTEXT_P, then
1105 no value is expected from the expression.
1106 OUT_SUBEXP is set when attempting to complete a field name; in this
1107 case it is set to the index of the subexpression on the
1108 left-hand-side of the struct op. If not doing such completion, it
1109 is left untouched. */
1111 static expression_up
1112 parse_exp_in_context_1 (const char **stringptr
, CORE_ADDR pc
,
1113 const struct block
*block
,
1114 int comma
, int void_context_p
, int *out_subexp
)
1116 const struct language_defn
*lang
= NULL
;
1119 lexptr
= *stringptr
;
1123 type_stack
.depth
= 0;
1124 expout_last_struct
= -1;
1125 expout_tag_completion_type
= TYPE_CODE_UNDEF
;
1126 xfree (expout_completion_name
);
1127 expout_completion_name
= NULL
;
1129 comma_terminates
= comma
;
1131 if (lexptr
== 0 || *lexptr
== 0)
1132 error_no_arg (_("expression to compute"));
1134 std::vector
<int> funcalls
;
1135 scoped_restore save_funcall_chain
= make_scoped_restore (&funcall_chain
,
1138 expression_context_block
= block
;
1140 /* If no context specified, try using the current frame, if any. */
1141 if (!expression_context_block
)
1142 expression_context_block
= get_selected_block (&expression_context_pc
);
1144 expression_context_pc
= BLOCK_START (expression_context_block
);
1146 expression_context_pc
= pc
;
1148 /* Fall back to using the current source static context, if any. */
1150 if (!expression_context_block
)
1152 struct symtab_and_line cursal
= get_current_source_symtab_and_line ();
1154 expression_context_block
1155 = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (cursal
.symtab
),
1157 if (expression_context_block
)
1158 expression_context_pc
= BLOCK_START (expression_context_block
);
1161 if (language_mode
== language_mode_auto
&& block
!= NULL
)
1163 /* Find the language associated to the given context block.
1164 Default to the current language if it can not be determined.
1166 Note that using the language corresponding to the current frame
1167 can sometimes give unexpected results. For instance, this
1168 routine is often called several times during the inferior
1169 startup phase to re-parse breakpoint expressions after
1170 a new shared library has been loaded. The language associated
1171 to the current frame at this moment is not relevant for
1172 the breakpoint. Using it would therefore be silly, so it seems
1173 better to rely on the current language rather than relying on
1174 the current frame language to parse the expression. That's why
1175 we do the following language detection only if the context block
1176 has been specifically provided. */
1177 struct symbol
*func
= block_linkage_function (block
);
1180 lang
= language_def (SYMBOL_LANGUAGE (func
));
1181 if (lang
== NULL
|| lang
->la_language
== language_unknown
)
1182 lang
= current_language
;
1185 lang
= current_language
;
1187 /* get_current_arch may reset CURRENT_LANGUAGE via select_frame.
1188 While we need CURRENT_LANGUAGE to be set to LANG (for lookup_symbol
1189 and others called from *.y) ensure CURRENT_LANGUAGE gets restored
1190 to the value matching SELECTED_FRAME as set by get_current_arch. */
1192 parser_state
ps (10, lang
, get_current_arch ());
1194 scoped_restore_current_language lang_saver
;
1195 set_language (lang
->la_language
);
1199 if (lang
->la_parser (&ps
))
1200 lang
->la_error (NULL
);
1202 CATCH (except
, RETURN_MASK_ALL
)
1204 if (! parse_completion
)
1205 throw_exception (except
);
1209 /* We have to operate on an "expression *", due to la_post_parser,
1210 which explains this funny-looking double release. */
1211 expression_up result
= ps
.release ();
1213 /* Convert expression from postfix form as generated by yacc
1214 parser, to a prefix form. */
1216 if (expressiondebug
)
1217 dump_raw_expression (result
.get (), gdb_stdlog
,
1218 "before conversion to prefix form");
1220 subexp
= prefixify_expression (result
.get ());
1222 *out_subexp
= subexp
;
1224 lang
->la_post_parser (&result
, void_context_p
);
1226 if (expressiondebug
)
1227 dump_prefix_expression (result
.get (), gdb_stdlog
);
1229 *stringptr
= lexptr
;
1233 /* Parse STRING as an expression, and complain if this fails
1234 to use up all of the contents of STRING. */
1237 parse_expression (const char *string
)
1239 expression_up exp
= parse_exp_1 (&string
, 0, 0, 0);
1241 error (_("Junk after end of expression."));
1245 /* Same as parse_expression, but using the given language (LANG)
1246 to parse the expression. */
1249 parse_expression_with_language (const char *string
, enum language lang
)
1251 gdb::optional
<scoped_restore_current_language
> lang_saver
;
1252 if (current_language
->la_language
!= lang
)
1254 lang_saver
.emplace ();
1255 set_language (lang
);
1258 return parse_expression (string
);
1261 /* Parse STRING as an expression. If parsing ends in the middle of a
1262 field reference, return the type of the left-hand-side of the
1263 reference; furthermore, if the parsing ends in the field name,
1264 return the field name in *NAME. If the parsing ends in the middle
1265 of a field reference, but the reference is somehow invalid, throw
1266 an exception. In all other cases, return NULL. Returned non-NULL
1267 *NAME must be freed by the caller. */
1270 parse_expression_for_completion (const char *string
, char **name
,
1271 enum type_code
*code
)
1279 parse_completion
= 1;
1280 exp
= parse_exp_in_context (&string
, 0, 0, 0, 0, &subexp
);
1282 CATCH (except
, RETURN_MASK_ERROR
)
1284 /* Nothing, EXP remains NULL. */
1288 parse_completion
= 0;
1292 if (expout_tag_completion_type
!= TYPE_CODE_UNDEF
)
1294 *code
= expout_tag_completion_type
;
1295 *name
= expout_completion_name
;
1296 expout_completion_name
= NULL
;
1300 if (expout_last_struct
== -1)
1303 *name
= extract_field_op (exp
.get (), &subexp
);
1307 /* This might throw an exception. If so, we want to let it
1309 val
= evaluate_subexpression_type (exp
.get (), subexp
);
1310 /* (*NAME) is a part of the EXP memory block freed below. */
1311 *name
= xstrdup (*name
);
1313 return value_type (val
);
1316 /* A post-parser that does nothing. */
1319 null_post_parser (expression_up
*exp
, int void_context_p
)
1323 /* Parse floating point value P of length LEN.
1324 Return false if invalid, true if valid.
1325 The successfully parsed number is stored in DATA in
1326 target format for floating-point type TYPE.
1328 NOTE: This accepts the floating point syntax that sscanf accepts. */
1331 parse_float (const char *p
, int len
,
1332 const struct type
*type
, gdb_byte
*data
)
1334 return target_float_from_string (data
, type
, std::string (p
, len
));
1337 /* Stuff for maintaining a stack of types. Currently just used by C, but
1338 probably useful for any language which declares its types "backwards". */
1340 /* Ensure that there are HOWMUCH open slots on the type stack STACK. */
1343 type_stack_reserve (struct type_stack
*stack
, int howmuch
)
1345 if (stack
->depth
+ howmuch
>= stack
->size
)
1348 if (stack
->size
< howmuch
)
1349 stack
->size
= howmuch
;
1350 stack
->elements
= XRESIZEVEC (union type_stack_elt
, stack
->elements
,
1355 /* Ensure that there is a single open slot in the global type stack. */
1358 check_type_stack_depth (void)
1360 type_stack_reserve (&type_stack
, 1);
1363 /* A helper function for insert_type and insert_type_address_space.
1364 This does work of expanding the type stack and inserting the new
1365 element, ELEMENT, into the stack at location SLOT. */
1368 insert_into_type_stack (int slot
, union type_stack_elt element
)
1370 check_type_stack_depth ();
1372 if (slot
< type_stack
.depth
)
1373 memmove (&type_stack
.elements
[slot
+ 1], &type_stack
.elements
[slot
],
1374 (type_stack
.depth
- slot
) * sizeof (union type_stack_elt
));
1375 type_stack
.elements
[slot
] = element
;
1379 /* Insert a new type, TP, at the bottom of the type stack. If TP is
1380 tp_pointer, tp_reference or tp_rvalue_reference, it is inserted at the
1381 bottom. If TP is a qualifier, it is inserted at slot 1 (just above a
1382 previous tp_pointer) if there is anything on the stack, or simply pushed
1383 if the stack is empty. Other values for TP are invalid. */
1386 insert_type (enum type_pieces tp
)
1388 union type_stack_elt element
;
1391 gdb_assert (tp
== tp_pointer
|| tp
== tp_reference
1392 || tp
== tp_rvalue_reference
|| tp
== tp_const
1393 || tp
== tp_volatile
);
1395 /* If there is anything on the stack (we know it will be a
1396 tp_pointer), insert the qualifier above it. Otherwise, simply
1397 push this on the top of the stack. */
1398 if (type_stack
.depth
&& (tp
== tp_const
|| tp
== tp_volatile
))
1404 insert_into_type_stack (slot
, element
);
1408 push_type (enum type_pieces tp
)
1410 check_type_stack_depth ();
1411 type_stack
.elements
[type_stack
.depth
++].piece
= tp
;
1415 push_type_int (int n
)
1417 check_type_stack_depth ();
1418 type_stack
.elements
[type_stack
.depth
++].int_val
= n
;
1421 /* Insert a tp_space_identifier and the corresponding address space
1422 value into the stack. STRING is the name of an address space, as
1423 recognized by address_space_name_to_int. If the stack is empty,
1424 the new elements are simply pushed. If the stack is not empty,
1425 this function assumes that the first item on the stack is a
1426 tp_pointer, and the new values are inserted above the first
1430 insert_type_address_space (struct parser_state
*pstate
, char *string
)
1432 union type_stack_elt element
;
1435 /* If there is anything on the stack (we know it will be a
1436 tp_pointer), insert the address space qualifier above it.
1437 Otherwise, simply push this on the top of the stack. */
1438 if (type_stack
.depth
)
1443 element
.piece
= tp_space_identifier
;
1444 insert_into_type_stack (slot
, element
);
1445 element
.int_val
= address_space_name_to_int (parse_gdbarch (pstate
),
1447 insert_into_type_stack (slot
, element
);
1453 if (type_stack
.depth
)
1454 return type_stack
.elements
[--type_stack
.depth
].piece
;
1461 if (type_stack
.depth
)
1462 return type_stack
.elements
[--type_stack
.depth
].int_val
;
1463 /* "Can't happen". */
1467 /* Pop a type list element from the global type stack. */
1469 static VEC (type_ptr
) *
1472 gdb_assert (type_stack
.depth
);
1473 return type_stack
.elements
[--type_stack
.depth
].typelist_val
;
1476 /* Pop a type_stack element from the global type stack. */
1478 static struct type_stack
*
1479 pop_type_stack (void)
1481 gdb_assert (type_stack
.depth
);
1482 return type_stack
.elements
[--type_stack
.depth
].stack_val
;
1485 /* Append the elements of the type stack FROM to the type stack TO.
1486 Always returns TO. */
1489 append_type_stack (struct type_stack
*to
, struct type_stack
*from
)
1491 type_stack_reserve (to
, from
->depth
);
1493 memcpy (&to
->elements
[to
->depth
], &from
->elements
[0],
1494 from
->depth
* sizeof (union type_stack_elt
));
1495 to
->depth
+= from
->depth
;
1500 /* Push the type stack STACK as an element on the global type stack. */
1503 push_type_stack (struct type_stack
*stack
)
1505 check_type_stack_depth ();
1506 type_stack
.elements
[type_stack
.depth
++].stack_val
= stack
;
1507 push_type (tp_type_stack
);
1510 /* Copy the global type stack into a newly allocated type stack and
1511 return it. The global stack is cleared. The returned type stack
1512 must be freed with type_stack_cleanup. */
1515 get_type_stack (void)
1517 struct type_stack
*result
= XNEW (struct type_stack
);
1519 *result
= type_stack
;
1520 type_stack
.depth
= 0;
1521 type_stack
.size
= 0;
1522 type_stack
.elements
= NULL
;
1527 /* A cleanup function that destroys a single type stack. */
1530 type_stack_cleanup (void *arg
)
1532 struct type_stack
*stack
= (struct type_stack
*) arg
;
1534 xfree (stack
->elements
);
1538 /* Push a function type with arguments onto the global type stack.
1539 LIST holds the argument types. If the final item in LIST is NULL,
1540 then the function will be varargs. */
1543 push_typelist (VEC (type_ptr
) *list
)
1545 check_type_stack_depth ();
1546 type_stack
.elements
[type_stack
.depth
++].typelist_val
= list
;
1547 push_type (tp_function_with_arguments
);
1550 /* Pop the type stack and return a type_instance_flags that
1551 corresponds the const/volatile qualifiers on the stack. This is
1552 called by the C++ parser when parsing methods types, and as such no
1553 other kind of type in the type stack is expected. */
1556 follow_type_instance_flags ()
1558 type_instance_flags flags
= 0;
1561 switch (pop_type ())
1566 flags
|= TYPE_INSTANCE_FLAG_CONST
;
1569 flags
|= TYPE_INSTANCE_FLAG_VOLATILE
;
1572 gdb_assert_not_reached ("unrecognized tp_ value in follow_types");
1577 /* Pop the type stack and return the type which corresponds to FOLLOW_TYPE
1578 as modified by all the stuff on the stack. */
1580 follow_types (struct type
*follow_type
)
1584 int make_volatile
= 0;
1585 int make_addr_space
= 0;
1589 switch (pop_type ())
1594 follow_type
= make_cv_type (make_const
,
1595 TYPE_VOLATILE (follow_type
),
1598 follow_type
= make_cv_type (TYPE_CONST (follow_type
),
1601 if (make_addr_space
)
1602 follow_type
= make_type_with_address_space (follow_type
,
1604 make_const
= make_volatile
= 0;
1605 make_addr_space
= 0;
1613 case tp_space_identifier
:
1614 make_addr_space
= pop_type_int ();
1617 follow_type
= lookup_pointer_type (follow_type
);
1619 follow_type
= make_cv_type (make_const
,
1620 TYPE_VOLATILE (follow_type
),
1623 follow_type
= make_cv_type (TYPE_CONST (follow_type
),
1626 if (make_addr_space
)
1627 follow_type
= make_type_with_address_space (follow_type
,
1629 make_const
= make_volatile
= 0;
1630 make_addr_space
= 0;
1633 follow_type
= lookup_lvalue_reference_type (follow_type
);
1634 goto process_reference
;
1635 case tp_rvalue_reference
:
1636 follow_type
= lookup_rvalue_reference_type (follow_type
);
1639 follow_type
= make_cv_type (make_const
,
1640 TYPE_VOLATILE (follow_type
),
1643 follow_type
= make_cv_type (TYPE_CONST (follow_type
),
1646 if (make_addr_space
)
1647 follow_type
= make_type_with_address_space (follow_type
,
1649 make_const
= make_volatile
= 0;
1650 make_addr_space
= 0;
1653 array_size
= pop_type_int ();
1654 /* FIXME-type-allocation: need a way to free this type when we are
1657 lookup_array_range_type (follow_type
,
1658 0, array_size
>= 0 ? array_size
- 1 : 0);
1660 TYPE_HIGH_BOUND_KIND (TYPE_INDEX_TYPE (follow_type
))
1664 /* FIXME-type-allocation: need a way to free this type when we are
1666 follow_type
= lookup_function_type (follow_type
);
1669 case tp_function_with_arguments
:
1671 VEC (type_ptr
) *args
= pop_typelist ();
1674 = lookup_function_type_with_arguments (follow_type
,
1675 VEC_length (type_ptr
, args
),
1676 VEC_address (type_ptr
,
1678 VEC_free (type_ptr
, args
);
1684 struct type_stack
*stack
= pop_type_stack ();
1685 /* Sort of ugly, but not really much worse than the
1687 struct type_stack save
= type_stack
;
1689 type_stack
= *stack
;
1690 follow_type
= follow_types (follow_type
);
1691 gdb_assert (type_stack
.depth
== 0);
1697 gdb_assert_not_reached ("unrecognized tp_ value in follow_types");
1702 /* This function avoids direct calls to fprintf
1703 in the parser generated debug code. */
1705 parser_fprintf (FILE *x
, const char *y
, ...)
1711 vfprintf_unfiltered (gdb_stderr
, y
, args
);
1714 fprintf_unfiltered (gdb_stderr
, " Unknown FILE used.\n");
1715 vfprintf_unfiltered (gdb_stderr
, y
, args
);
1720 /* Implementation of the exp_descriptor method operator_check. */
1723 operator_check_standard (struct expression
*exp
, int pos
,
1724 int (*objfile_func
) (struct objfile
*objfile
,
1728 const union exp_element
*const elts
= exp
->elts
;
1729 struct type
*type
= NULL
;
1730 struct objfile
*objfile
= NULL
;
1732 /* Extended operators should have been already handled by exp_descriptor
1733 iterate method of its specific language. */
1734 gdb_assert (elts
[pos
].opcode
< OP_EXTENDED0
);
1736 /* Track the callers of write_exp_elt_type for this table. */
1738 switch (elts
[pos
].opcode
)
1750 type
= elts
[pos
+ 1].type
;
1755 LONGEST arg
, nargs
= elts
[pos
+ 2].longconst
;
1757 for (arg
= 0; arg
< nargs
; arg
++)
1759 struct type
*type
= elts
[pos
+ 3 + arg
].type
;
1760 struct objfile
*objfile
= TYPE_OBJFILE (type
);
1762 if (objfile
&& (*objfile_func
) (objfile
, data
))
1770 const struct block
*const block
= elts
[pos
+ 1].block
;
1771 const struct symbol
*const symbol
= elts
[pos
+ 2].symbol
;
1773 /* Check objfile where the variable itself is placed.
1774 SYMBOL_OBJ_SECTION (symbol) may be NULL. */
1775 if ((*objfile_func
) (symbol_objfile (symbol
), data
))
1778 /* Check objfile where is placed the code touching the variable. */
1779 objfile
= lookup_objfile_from_block (block
);
1781 type
= SYMBOL_TYPE (symbol
);
1784 case OP_VAR_MSYM_VALUE
:
1785 objfile
= elts
[pos
+ 1].objfile
;
1789 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
1791 if (type
&& TYPE_OBJFILE (type
)
1792 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
1794 if (objfile
&& (*objfile_func
) (objfile
, data
))
1800 /* Call OBJFILE_FUNC for any objfile found being referenced by EXP.
1801 OBJFILE_FUNC is never called with NULL OBJFILE. OBJFILE_FUNC get
1802 passed an arbitrary caller supplied DATA pointer. If OBJFILE_FUNC
1803 returns non-zero value then (any other) non-zero value is immediately
1804 returned to the caller. Otherwise zero is returned after iterating
1805 through whole EXP. */
1808 exp_iterate (struct expression
*exp
,
1809 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
1814 for (endpos
= exp
->nelts
; endpos
> 0; )
1816 int pos
, args
, oplen
= 0;
1818 operator_length (exp
, endpos
, &oplen
, &args
);
1819 gdb_assert (oplen
> 0);
1821 pos
= endpos
- oplen
;
1822 if (exp
->language_defn
->la_exp_desc
->operator_check (exp
, pos
,
1823 objfile_func
, data
))
1832 /* Helper for exp_uses_objfile. */
1835 exp_uses_objfile_iter (struct objfile
*exp_objfile
, void *objfile_voidp
)
1837 struct objfile
*objfile
= (struct objfile
*) objfile_voidp
;
1839 if (exp_objfile
->separate_debug_objfile_backlink
)
1840 exp_objfile
= exp_objfile
->separate_debug_objfile_backlink
;
1842 return exp_objfile
== objfile
;
1845 /* Return 1 if EXP uses OBJFILE (and will become dangling when OBJFILE
1846 is unloaded), otherwise return 0. OBJFILE must not be a separate debug info
1850 exp_uses_objfile (struct expression
*exp
, struct objfile
*objfile
)
1852 gdb_assert (objfile
->separate_debug_objfile_backlink
== NULL
);
1854 return exp_iterate (exp
, exp_uses_objfile_iter
, objfile
);
1857 /* See definition in parser-defs.h. */
1860 increase_expout_size (struct parser_state
*ps
, size_t lenelt
)
1862 if ((ps
->expout_ptr
+ lenelt
) >= ps
->expout_size
)
1864 ps
->expout_size
= std::max (ps
->expout_size
* 2,
1865 ps
->expout_ptr
+ lenelt
+ 10);
1866 ps
->expout
.reset (XRESIZEVAR (expression
,
1867 ps
->expout
.release (),
1868 (sizeof (struct expression
)
1869 + EXP_ELEM_TO_BYTES (ps
->expout_size
))));
1874 _initialize_parse (void)
1876 type_stack
.size
= 0;
1877 type_stack
.depth
= 0;
1878 type_stack
.elements
= NULL
;
1880 add_setshow_zuinteger_cmd ("expression", class_maintenance
,
1882 _("Set expression debugging."),
1883 _("Show expression debugging."),
1884 _("When non-zero, the internal representation "
1885 "of expressions will be printed."),
1887 show_expressiondebug
,
1888 &setdebuglist
, &showdebuglist
);
1889 add_setshow_boolean_cmd ("parser", class_maintenance
,
1891 _("Set parser debugging."),
1892 _("Show parser debugging."),
1893 _("When non-zero, expression parser "
1894 "tracing will be enabled."),
1897 &setdebuglist
, &showdebuglist
);