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 */
52 #include "user-regs.h"
54 #include "common/gdb_optional.h"
56 /* Standard set of definitions for printing, dumping, prefixifying,
57 * and evaluating expressions. */
59 const struct exp_descriptor exp_descriptor_standard
=
61 print_subexp_standard
,
62 operator_length_standard
,
63 operator_check_standard
,
65 dump_subexp_body_standard
,
66 evaluate_subexp_standard
69 /* Global variables declared in parser-defs.h (and commented there). */
70 const struct block
*expression_context_block
;
71 CORE_ADDR expression_context_pc
;
72 const struct block
*innermost_block
;
74 static struct type_stack type_stack
;
76 const char *prev_lexptr
;
80 /* True if parsing an expression to attempt completion. */
83 /* The index of the last struct expression directly before a '.' or
84 '->'. This is set when parsing and is only used when completing a
85 field name. It is -1 if no dereference operation was found. */
86 static int expout_last_struct
= -1;
88 /* If we are completing a tagged type name, this will be nonzero. */
89 static enum type_code expout_tag_completion_type
= TYPE_CODE_UNDEF
;
91 /* The token for tagged type name completion. */
92 static char *expout_completion_name
;
95 static unsigned int expressiondebug
= 0;
97 show_expressiondebug (struct ui_file
*file
, int from_tty
,
98 struct cmd_list_element
*c
, const char *value
)
100 fprintf_filtered (file
, _("Expression debugging is %s.\n"), value
);
104 /* Non-zero if an expression parser should set yydebug. */
108 show_parserdebug (struct ui_file
*file
, int from_tty
,
109 struct cmd_list_element
*c
, const char *value
)
111 fprintf_filtered (file
, _("Parser debugging is %s.\n"), value
);
115 static int prefixify_subexp (struct expression
*, struct expression
*, int,
118 static expression_up
parse_exp_in_context (const char **, CORE_ADDR
,
119 const struct block
*, int,
121 static expression_up
parse_exp_in_context_1 (const char **, CORE_ADDR
,
122 const struct block
*, int,
125 /* Data structure for saving values of arglist_len for function calls whose
126 arguments contain other function calls. */
128 static std::vector
<int> *funcall_chain
;
130 /* Begin counting arguments for a function call,
131 saving the data about any containing call. */
136 funcall_chain
->push_back (arglist_len
);
140 /* Return the number of arguments in a function call just terminated,
141 and restore the data for the containing function call. */
146 int val
= arglist_len
;
147 arglist_len
= funcall_chain
->back ();
148 funcall_chain
->pop_back ();
154 /* See definition in parser-defs.h. */
157 initialize_expout (struct parser_state
*ps
, size_t initial_size
,
158 const struct language_defn
*lang
,
159 struct gdbarch
*gdbarch
)
161 ps
->expout_size
= initial_size
;
164 = (struct expression
*) xmalloc (sizeof (struct expression
)
165 + EXP_ELEM_TO_BYTES (ps
->expout_size
));
166 ps
->expout
->language_defn
= lang
;
167 ps
->expout
->gdbarch
= gdbarch
;
170 /* See definition in parser-defs.h. */
173 reallocate_expout (struct parser_state
*ps
)
175 /* Record the actual number of expression elements, and then
176 reallocate the expression memory so that we free up any
179 ps
->expout
->nelts
= ps
->expout_ptr
;
180 ps
->expout
= (struct expression
*)
181 xrealloc (ps
->expout
,
182 sizeof (struct expression
)
183 + EXP_ELEM_TO_BYTES (ps
->expout_ptr
));
186 /* This page contains the functions for adding data to the struct expression
187 being constructed. */
189 /* Add one element to the end of the expression. */
191 /* To avoid a bug in the Sun 4 compiler, we pass things that can fit into
192 a register through here. */
195 write_exp_elt (struct parser_state
*ps
, const union exp_element
*expelt
)
197 if (ps
->expout_ptr
>= ps
->expout_size
)
199 ps
->expout_size
*= 2;
200 ps
->expout
= (struct expression
*)
201 xrealloc (ps
->expout
, sizeof (struct expression
)
202 + EXP_ELEM_TO_BYTES (ps
->expout_size
));
204 ps
->expout
->elts
[ps
->expout_ptr
++] = *expelt
;
208 write_exp_elt_opcode (struct parser_state
*ps
, enum exp_opcode expelt
)
210 union exp_element tmp
;
212 memset (&tmp
, 0, sizeof (union exp_element
));
214 write_exp_elt (ps
, &tmp
);
218 write_exp_elt_sym (struct parser_state
*ps
, struct symbol
*expelt
)
220 union exp_element tmp
;
222 memset (&tmp
, 0, sizeof (union exp_element
));
224 write_exp_elt (ps
, &tmp
);
228 write_exp_elt_msym (struct parser_state
*ps
, minimal_symbol
*expelt
)
230 union exp_element tmp
;
232 memset (&tmp
, 0, sizeof (union exp_element
));
233 tmp
.msymbol
= expelt
;
234 write_exp_elt (ps
, &tmp
);
238 write_exp_elt_block (struct parser_state
*ps
, const struct block
*b
)
240 union exp_element tmp
;
242 memset (&tmp
, 0, sizeof (union exp_element
));
244 write_exp_elt (ps
, &tmp
);
248 write_exp_elt_objfile (struct parser_state
*ps
, struct objfile
*objfile
)
250 union exp_element tmp
;
252 memset (&tmp
, 0, sizeof (union exp_element
));
253 tmp
.objfile
= objfile
;
254 write_exp_elt (ps
, &tmp
);
258 write_exp_elt_longcst (struct parser_state
*ps
, LONGEST expelt
)
260 union exp_element tmp
;
262 memset (&tmp
, 0, sizeof (union exp_element
));
263 tmp
.longconst
= expelt
;
264 write_exp_elt (ps
, &tmp
);
268 write_exp_elt_floatcst (struct parser_state
*ps
, const gdb_byte expelt
[16])
270 union exp_element tmp
;
273 for (index
= 0; index
< 16; index
++)
274 tmp
.floatconst
[index
] = expelt
[index
];
276 write_exp_elt (ps
, &tmp
);
280 write_exp_elt_type (struct parser_state
*ps
, struct type
*expelt
)
282 union exp_element tmp
;
284 memset (&tmp
, 0, sizeof (union exp_element
));
286 write_exp_elt (ps
, &tmp
);
290 write_exp_elt_intern (struct parser_state
*ps
, struct internalvar
*expelt
)
292 union exp_element tmp
;
294 memset (&tmp
, 0, sizeof (union exp_element
));
295 tmp
.internalvar
= expelt
;
296 write_exp_elt (ps
, &tmp
);
299 /* Add a string constant to the end of the expression.
301 String constants are stored by first writing an expression element
302 that contains the length of the string, then stuffing the string
303 constant itself into however many expression elements are needed
304 to hold it, and then writing another expression element that contains
305 the length of the string. I.e. an expression element at each end of
306 the string records the string length, so you can skip over the
307 expression elements containing the actual string bytes from either
308 end of the string. Note that this also allows gdb to handle
309 strings with embedded null bytes, as is required for some languages.
311 Don't be fooled by the fact that the string is null byte terminated,
312 this is strictly for the convenience of debugging gdb itself.
313 Gdb does not depend up the string being null terminated, since the
314 actual length is recorded in expression elements at each end of the
315 string. The null byte is taken into consideration when computing how
316 many expression elements are required to hold the string constant, of
321 write_exp_string (struct parser_state
*ps
, struct stoken str
)
323 int len
= str
.length
;
327 /* Compute the number of expression elements required to hold the string
328 (including a null byte terminator), along with one expression element
329 at each end to record the actual string length (not including the
330 null byte terminator). */
332 lenelt
= 2 + BYTES_TO_EXP_ELEM (len
+ 1);
334 increase_expout_size (ps
, lenelt
);
336 /* Write the leading length expression element (which advances the current
337 expression element index), then write the string constant followed by a
338 terminating null byte, and then write the trailing length expression
341 write_exp_elt_longcst (ps
, (LONGEST
) len
);
342 strdata
= (char *) &ps
->expout
->elts
[ps
->expout_ptr
];
343 memcpy (strdata
, str
.ptr
, len
);
344 *(strdata
+ len
) = '\0';
345 ps
->expout_ptr
+= lenelt
- 2;
346 write_exp_elt_longcst (ps
, (LONGEST
) len
);
349 /* Add a vector of string constants to the end of the expression.
351 This adds an OP_STRING operation, but encodes the contents
352 differently from write_exp_string. The language is expected to
353 handle evaluation of this expression itself.
355 After the usual OP_STRING header, TYPE is written into the
356 expression as a long constant. The interpretation of this field is
357 up to the language evaluator.
359 Next, each string in VEC is written. The length is written as a
360 long constant, followed by the contents of the string. */
363 write_exp_string_vector (struct parser_state
*ps
, int type
,
364 struct stoken_vector
*vec
)
369 /* Compute the size. We compute the size in number of slots to
370 avoid issues with string padding. */
372 for (i
= 0; i
< vec
->len
; ++i
)
374 /* One slot for the length of this element, plus the number of
375 slots needed for this string. */
376 n_slots
+= 1 + BYTES_TO_EXP_ELEM (vec
->tokens
[i
].length
);
379 /* One more slot for the type of the string. */
382 /* Now compute a phony string length. */
383 len
= EXP_ELEM_TO_BYTES (n_slots
) - 1;
386 increase_expout_size (ps
, n_slots
);
388 write_exp_elt_opcode (ps
, OP_STRING
);
389 write_exp_elt_longcst (ps
, len
);
390 write_exp_elt_longcst (ps
, type
);
392 for (i
= 0; i
< vec
->len
; ++i
)
394 write_exp_elt_longcst (ps
, vec
->tokens
[i
].length
);
395 memcpy (&ps
->expout
->elts
[ps
->expout_ptr
], vec
->tokens
[i
].ptr
,
396 vec
->tokens
[i
].length
);
397 ps
->expout_ptr
+= BYTES_TO_EXP_ELEM (vec
->tokens
[i
].length
);
400 write_exp_elt_longcst (ps
, len
);
401 write_exp_elt_opcode (ps
, OP_STRING
);
404 /* Add a bitstring constant to the end of the expression.
406 Bitstring constants are stored by first writing an expression element
407 that contains the length of the bitstring (in bits), then stuffing the
408 bitstring constant itself into however many expression elements are
409 needed to hold it, and then writing another expression element that
410 contains the length of the bitstring. I.e. an expression element at
411 each end of the bitstring records the bitstring length, so you can skip
412 over the expression elements containing the actual bitstring bytes from
413 either end of the bitstring. */
416 write_exp_bitstring (struct parser_state
*ps
, struct stoken str
)
418 int bits
= str
.length
; /* length in bits */
419 int len
= (bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
423 /* Compute the number of expression elements required to hold the bitstring,
424 along with one expression element at each end to record the actual
425 bitstring length in bits. */
427 lenelt
= 2 + BYTES_TO_EXP_ELEM (len
);
429 increase_expout_size (ps
, lenelt
);
431 /* Write the leading length expression element (which advances the current
432 expression element index), then write the bitstring constant, and then
433 write the trailing length expression element. */
435 write_exp_elt_longcst (ps
, (LONGEST
) bits
);
436 strdata
= (char *) &ps
->expout
->elts
[ps
->expout_ptr
];
437 memcpy (strdata
, str
.ptr
, len
);
438 ps
->expout_ptr
+= lenelt
- 2;
439 write_exp_elt_longcst (ps
, (LONGEST
) bits
);
442 /* Return the type of MSYMBOL, a minimal symbol of OBJFILE. If
443 ADDRESS_P is not NULL, set it to the MSYMBOL's resolved
447 find_minsym_type_and_address (minimal_symbol
*msymbol
,
448 struct objfile
*objfile
,
449 CORE_ADDR
*address_p
)
451 bound_minimal_symbol bound_msym
= {msymbol
, objfile
};
452 struct gdbarch
*gdbarch
= get_objfile_arch (objfile
);
453 struct obj_section
*section
= MSYMBOL_OBJ_SECTION (objfile
, msymbol
);
454 enum minimal_symbol_type type
= MSYMBOL_TYPE (msymbol
);
457 bool is_tls
= (section
!= NULL
458 && section
->the_bfd_section
->flags
& SEC_THREAD_LOCAL
);
460 /* Addresses of TLS symbols are really offsets into a
461 per-objfile/per-thread storage block. */
462 CORE_ADDR addr
= (is_tls
463 ? MSYMBOL_VALUE_RAW_ADDRESS (bound_msym
.minsym
)
464 : BMSYMBOL_VALUE_ADDRESS (bound_msym
));
466 /* The minimal symbol might point to a function descriptor;
467 resolve it to the actual code address instead. */
468 pc
= gdbarch_convert_from_func_ptr_addr (gdbarch
, addr
, ¤t_target
);
471 struct bound_minimal_symbol ifunc_msym
= lookup_minimal_symbol_by_pc (pc
);
473 /* In this case, assume we have a code symbol instead of
476 if (ifunc_msym
.minsym
!= NULL
477 && MSYMBOL_TYPE (ifunc_msym
.minsym
) == mst_text_gnu_ifunc
478 && BMSYMBOL_VALUE_ADDRESS (ifunc_msym
) == pc
)
480 /* A function descriptor has been resolved but PC is still in the
481 STT_GNU_IFUNC resolver body (such as because inferior does not
482 run to be able to call it). */
484 type
= mst_text_gnu_ifunc
;
492 if (overlay_debugging
)
493 addr
= symbol_overlayed_address (addr
, section
);
497 /* Skip translation if caller does not need the address. */
498 if (address_p
!= NULL
)
499 *address_p
= target_translate_tls_address (objfile
, addr
);
500 return objfile_type (objfile
)->nodebug_tls_symbol
;
503 if (address_p
!= NULL
)
506 struct type
*the_type
;
512 case mst_solib_trampoline
:
513 return objfile_type (objfile
)->nodebug_text_symbol
;
515 case mst_text_gnu_ifunc
:
516 return objfile_type (objfile
)->nodebug_text_gnu_ifunc_symbol
;
522 return objfile_type (objfile
)->nodebug_data_symbol
;
524 case mst_slot_got_plt
:
525 return objfile_type (objfile
)->nodebug_got_plt_symbol
;
528 return objfile_type (objfile
)->nodebug_unknown_symbol
;
532 /* Add the appropriate elements for a minimal symbol to the end of
536 write_exp_msymbol (struct parser_state
*ps
,
537 struct bound_minimal_symbol bound_msym
)
539 write_exp_elt_opcode (ps
, OP_VAR_MSYM_VALUE
);
540 write_exp_elt_objfile (ps
, bound_msym
.objfile
);
541 write_exp_elt_msym (ps
, bound_msym
.minsym
);
542 write_exp_elt_opcode (ps
, OP_VAR_MSYM_VALUE
);
545 /* Mark the current index as the starting location of a structure
546 expression. This is used when completing on field names. */
549 mark_struct_expression (struct parser_state
*ps
)
551 gdb_assert (parse_completion
552 && expout_tag_completion_type
== TYPE_CODE_UNDEF
);
553 expout_last_struct
= ps
->expout_ptr
;
556 /* Indicate that the current parser invocation is completing a tag.
557 TAG is the type code of the tag, and PTR and LENGTH represent the
558 start of the tag name. */
561 mark_completion_tag (enum type_code tag
, const char *ptr
, int length
)
563 gdb_assert (parse_completion
564 && expout_tag_completion_type
== TYPE_CODE_UNDEF
565 && expout_completion_name
== NULL
566 && expout_last_struct
== -1);
567 gdb_assert (tag
== TYPE_CODE_UNION
568 || tag
== TYPE_CODE_STRUCT
569 || tag
== TYPE_CODE_ENUM
);
570 expout_tag_completion_type
= tag
;
571 expout_completion_name
= (char *) xmalloc (length
+ 1);
572 memcpy (expout_completion_name
, ptr
, length
);
573 expout_completion_name
[length
] = '\0';
577 /* Recognize tokens that start with '$'. These include:
579 $regname A native register name or a "standard
582 $variable A convenience variable with a name chosen
585 $digits Value history with index <digits>, starting
586 from the first value which has index 1.
588 $$digits Value history with index <digits> relative
589 to the last value. I.e. $$0 is the last
590 value, $$1 is the one previous to that, $$2
591 is the one previous to $$1, etc.
593 $ | $0 | $$0 The last value in the value history.
595 $$ An abbreviation for the second to the last
596 value in the value history, I.e. $$1 */
599 write_dollar_variable (struct parser_state
*ps
, struct stoken str
)
601 struct block_symbol sym
;
602 struct bound_minimal_symbol msym
;
603 struct internalvar
*isym
= NULL
;
605 /* Handle the tokens $digits; also $ (short for $0) and $$ (short for $$1)
606 and $$digits (equivalent to $<-digits> if you could type that). */
610 /* Double dollar means negate the number and add -1 as well.
611 Thus $$ alone means -1. */
612 if (str
.length
>= 2 && str
.ptr
[1] == '$')
619 /* Just dollars (one or two). */
623 /* Is the rest of the token digits? */
624 for (; i
< str
.length
; i
++)
625 if (!(str
.ptr
[i
] >= '0' && str
.ptr
[i
] <= '9'))
629 i
= atoi (str
.ptr
+ 1 + negate
);
635 /* Handle tokens that refer to machine registers:
636 $ followed by a register name. */
637 i
= user_reg_map_name_to_regnum (parse_gdbarch (ps
),
638 str
.ptr
+ 1, str
.length
- 1);
640 goto handle_register
;
642 /* Any names starting with $ are probably debugger internal variables. */
644 isym
= lookup_only_internalvar (copy_name (str
) + 1);
647 write_exp_elt_opcode (ps
, OP_INTERNALVAR
);
648 write_exp_elt_intern (ps
, isym
);
649 write_exp_elt_opcode (ps
, OP_INTERNALVAR
);
653 /* On some systems, such as HP-UX and hppa-linux, certain system routines
654 have names beginning with $ or $$. Check for those, first. */
656 sym
= lookup_symbol (copy_name (str
), (struct block
*) NULL
,
660 write_exp_elt_opcode (ps
, OP_VAR_VALUE
);
661 write_exp_elt_block (ps
, sym
.block
);
662 write_exp_elt_sym (ps
, sym
.symbol
);
663 write_exp_elt_opcode (ps
, OP_VAR_VALUE
);
666 msym
= lookup_bound_minimal_symbol (copy_name (str
));
669 write_exp_msymbol (ps
, msym
);
673 /* Any other names are assumed to be debugger internal variables. */
675 write_exp_elt_opcode (ps
, OP_INTERNALVAR
);
676 write_exp_elt_intern (ps
, create_internalvar (copy_name (str
) + 1));
677 write_exp_elt_opcode (ps
, OP_INTERNALVAR
);
680 write_exp_elt_opcode (ps
, OP_LAST
);
681 write_exp_elt_longcst (ps
, (LONGEST
) i
);
682 write_exp_elt_opcode (ps
, OP_LAST
);
685 write_exp_elt_opcode (ps
, OP_REGISTER
);
688 write_exp_string (ps
, str
);
689 write_exp_elt_opcode (ps
, OP_REGISTER
);
695 find_template_name_end (const char *p
)
698 int just_seen_right
= 0;
699 int just_seen_colon
= 0;
700 int just_seen_space
= 0;
702 if (!p
|| (*p
!= '<'))
713 /* In future, may want to allow these?? */
716 depth
++; /* start nested template */
717 if (just_seen_colon
|| just_seen_right
|| just_seen_space
)
718 return 0; /* but not after : or :: or > or space */
721 if (just_seen_colon
|| just_seen_right
)
722 return 0; /* end a (nested?) template */
723 just_seen_right
= 1; /* but not after : or :: */
724 if (--depth
== 0) /* also disallow >>, insist on > > */
725 return ++p
; /* if outermost ended, return */
728 if (just_seen_space
|| (just_seen_colon
> 1))
729 return 0; /* nested class spec coming up */
730 just_seen_colon
++; /* we allow :: but not :::: */
735 if (!((*p
>= 'a' && *p
<= 'z') || /* allow token chars */
736 (*p
>= 'A' && *p
<= 'Z') ||
737 (*p
>= '0' && *p
<= '9') ||
738 (*p
== '_') || (*p
== ',') || /* commas for template args */
739 (*p
== '&') || (*p
== '*') || /* pointer and ref types */
740 (*p
== '(') || (*p
== ')') || /* function types */
741 (*p
== '[') || (*p
== ']'))) /* array types */
755 /* Return a null-terminated temporary copy of the name of a string token.
757 Tokens that refer to names do so with explicit pointer and length,
758 so they can share the storage that lexptr is parsing.
759 When it is necessary to pass a name to a function that expects
760 a null-terminated string, the substring is copied out
761 into a separate block of storage.
763 N.B. A single buffer is reused on each call. */
766 copy_name (struct stoken token
)
768 /* A temporary buffer for identifiers, so we can null-terminate them.
769 We allocate this with xrealloc. parse_exp_1 used to allocate with
770 alloca, using the size of the whole expression as a conservative
771 estimate of the space needed. However, macro expansion can
772 introduce names longer than the original expression; there's no
773 practical way to know beforehand how large that might be. */
774 static char *namecopy
;
775 static size_t namecopy_size
;
777 /* Make sure there's enough space for the token. */
778 if (namecopy_size
< token
.length
+ 1)
780 namecopy_size
= token
.length
+ 1;
781 namecopy
= (char *) xrealloc (namecopy
, token
.length
+ 1);
784 memcpy (namecopy
, token
.ptr
, token
.length
);
785 namecopy
[token
.length
] = 0;
791 /* See comments on parser-defs.h. */
794 prefixify_expression (struct expression
*expr
)
796 int len
= sizeof (struct expression
) + EXP_ELEM_TO_BYTES (expr
->nelts
);
797 struct expression
*temp
;
798 int inpos
= expr
->nelts
, outpos
= 0;
800 temp
= (struct expression
*) alloca (len
);
802 /* Copy the original expression into temp. */
803 memcpy (temp
, expr
, len
);
805 return prefixify_subexp (temp
, expr
, inpos
, outpos
);
808 /* Return the number of exp_elements in the postfix subexpression
809 of EXPR whose operator is at index ENDPOS - 1 in EXPR. */
812 length_of_subexp (struct expression
*expr
, int endpos
)
816 operator_length (expr
, endpos
, &oplen
, &args
);
820 oplen
+= length_of_subexp (expr
, endpos
- oplen
);
827 /* Sets *OPLENP to the length of the operator whose (last) index is
828 ENDPOS - 1 in EXPR, and sets *ARGSP to the number of arguments that
832 operator_length (const struct expression
*expr
, int endpos
, int *oplenp
,
835 expr
->language_defn
->la_exp_desc
->operator_length (expr
, endpos
,
839 /* Default value for operator_length in exp_descriptor vectors. */
842 operator_length_standard (const struct expression
*expr
, int endpos
,
843 int *oplenp
, int *argsp
)
847 enum range_type range_type
;
851 error (_("?error in operator_length_standard"));
853 i
= (int) expr
->elts
[endpos
- 1].opcode
;
859 oplen
= longest_to_int (expr
->elts
[endpos
- 2].longconst
);
860 oplen
= 5 + BYTES_TO_EXP_ELEM (oplen
+ 1);
866 case OP_VAR_MSYM_VALUE
:
870 case OP_FUNC_STATIC_VAR
:
871 oplen
= longest_to_int (expr
->elts
[endpos
- 2].longconst
);
872 oplen
= 4 + BYTES_TO_EXP_ELEM (oplen
+ 1);
880 case OP_VAR_ENTRY_VALUE
:
890 case OP_F77_UNDETERMINED_ARGLIST
:
892 args
= 1 + longest_to_int (expr
->elts
[endpos
- 2].longconst
);
896 oplen
= 5 + longest_to_int (expr
->elts
[endpos
- 2].longconst
);
900 case OP_OBJC_MSGCALL
: /* Objective C message (method) call. */
902 args
= 1 + longest_to_int (expr
->elts
[endpos
- 2].longconst
);
911 case UNOP_DYNAMIC_CAST
:
912 case UNOP_REINTERPRET_CAST
:
913 case UNOP_MEMVAL_TYPE
:
941 oplen
= longest_to_int (expr
->elts
[endpos
- 2].longconst
);
942 oplen
= 4 + BYTES_TO_EXP_ELEM (oplen
+ 1);
947 case STRUCTOP_STRUCT
:
954 case OP_OBJC_NSSTRING
: /* Objective C Foundation Class
955 NSString constant. */
956 case OP_OBJC_SELECTOR
: /* Objective C "@selector" pseudo-op. */
958 oplen
= longest_to_int (expr
->elts
[endpos
- 2].longconst
);
959 oplen
= 4 + BYTES_TO_EXP_ELEM (oplen
+ 1);
964 args
= longest_to_int (expr
->elts
[endpos
- 2].longconst
);
965 args
-= longest_to_int (expr
->elts
[endpos
- 3].longconst
);
975 case MULTI_SUBSCRIPT
:
977 args
= 1 + longest_to_int (expr
->elts
[endpos
- 2].longconst
);
980 case BINOP_ASSIGN_MODIFY
:
992 range_type
= (enum range_type
)
993 longest_to_int (expr
->elts
[endpos
- 2].longconst
);
997 case LOW_BOUND_DEFAULT
:
998 case HIGH_BOUND_DEFAULT
:
1001 case BOTH_BOUND_DEFAULT
:
1004 case NONE_BOUND_DEFAULT
:
1012 args
= 1 + (i
< (int) BINOP_END
);
1019 /* Copy the subexpression ending just before index INEND in INEXPR
1020 into OUTEXPR, starting at index OUTBEG.
1021 In the process, convert it from suffix to prefix form.
1022 If EXPOUT_LAST_STRUCT is -1, then this function always returns -1.
1023 Otherwise, it returns the index of the subexpression which is the
1024 left-hand-side of the expression at EXPOUT_LAST_STRUCT. */
1027 prefixify_subexp (struct expression
*inexpr
,
1028 struct expression
*outexpr
, int inend
, int outbeg
)
1036 operator_length (inexpr
, inend
, &oplen
, &args
);
1038 /* Copy the final operator itself, from the end of the input
1039 to the beginning of the output. */
1041 memcpy (&outexpr
->elts
[outbeg
], &inexpr
->elts
[inend
],
1042 EXP_ELEM_TO_BYTES (oplen
));
1045 if (expout_last_struct
== inend
)
1046 result
= outbeg
- oplen
;
1048 /* Find the lengths of the arg subexpressions. */
1049 arglens
= (int *) alloca (args
* sizeof (int));
1050 for (i
= args
- 1; i
>= 0; i
--)
1052 oplen
= length_of_subexp (inexpr
, inend
);
1057 /* Now copy each subexpression, preserving the order of
1058 the subexpressions, but prefixifying each one.
1059 In this loop, inend starts at the beginning of
1060 the expression this level is working on
1061 and marches forward over the arguments.
1062 outbeg does similarly in the output. */
1063 for (i
= 0; i
< args
; i
++)
1069 r
= prefixify_subexp (inexpr
, outexpr
, inend
, outbeg
);
1072 /* Return immediately. We probably have only parsed a
1073 partial expression, so we don't want to try to reverse
1074 the other operands. */
1083 /* Read an expression from the string *STRINGPTR points to,
1084 parse it, and return a pointer to a struct expression that we malloc.
1085 Use block BLOCK as the lexical context for variable names;
1086 if BLOCK is zero, use the block of the selected stack frame.
1087 Meanwhile, advance *STRINGPTR to point after the expression,
1088 at the first nonwhite character that is not part of the expression
1089 (possibly a null character).
1091 If COMMA is nonzero, stop if a comma is reached. */
1094 parse_exp_1 (const char **stringptr
, CORE_ADDR pc
, const struct block
*block
,
1097 return parse_exp_in_context (stringptr
, pc
, block
, comma
, 0, NULL
);
1100 static expression_up
1101 parse_exp_in_context (const char **stringptr
, CORE_ADDR pc
,
1102 const struct block
*block
,
1103 int comma
, int void_context_p
, int *out_subexp
)
1105 return parse_exp_in_context_1 (stringptr
, pc
, block
, comma
,
1106 void_context_p
, out_subexp
);
1109 /* As for parse_exp_1, except that if VOID_CONTEXT_P, then
1110 no value is expected from the expression.
1111 OUT_SUBEXP is set when attempting to complete a field name; in this
1112 case it is set to the index of the subexpression on the
1113 left-hand-side of the struct op. If not doing such completion, it
1114 is left untouched. */
1116 static expression_up
1117 parse_exp_in_context_1 (const char **stringptr
, CORE_ADDR pc
,
1118 const struct block
*block
,
1119 int comma
, int void_context_p
, int *out_subexp
)
1121 const struct language_defn
*lang
= NULL
;
1122 struct parser_state ps
;
1125 lexptr
= *stringptr
;
1129 type_stack
.depth
= 0;
1130 expout_last_struct
= -1;
1131 expout_tag_completion_type
= TYPE_CODE_UNDEF
;
1132 xfree (expout_completion_name
);
1133 expout_completion_name
= NULL
;
1135 comma_terminates
= comma
;
1137 if (lexptr
== 0 || *lexptr
== 0)
1138 error_no_arg (_("expression to compute"));
1140 std::vector
<int> funcalls
;
1141 scoped_restore save_funcall_chain
= make_scoped_restore (&funcall_chain
,
1144 expression_context_block
= block
;
1146 /* If no context specified, try using the current frame, if any. */
1147 if (!expression_context_block
)
1148 expression_context_block
= get_selected_block (&expression_context_pc
);
1150 expression_context_pc
= BLOCK_START (expression_context_block
);
1152 expression_context_pc
= pc
;
1154 /* Fall back to using the current source static context, if any. */
1156 if (!expression_context_block
)
1158 struct symtab_and_line cursal
= get_current_source_symtab_and_line ();
1160 expression_context_block
1161 = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (cursal
.symtab
),
1163 if (expression_context_block
)
1164 expression_context_pc
= BLOCK_START (expression_context_block
);
1167 if (language_mode
== language_mode_auto
&& block
!= NULL
)
1169 /* Find the language associated to the given context block.
1170 Default to the current language if it can not be determined.
1172 Note that using the language corresponding to the current frame
1173 can sometimes give unexpected results. For instance, this
1174 routine is often called several times during the inferior
1175 startup phase to re-parse breakpoint expressions after
1176 a new shared library has been loaded. The language associated
1177 to the current frame at this moment is not relevant for
1178 the breakpoint. Using it would therefore be silly, so it seems
1179 better to rely on the current language rather than relying on
1180 the current frame language to parse the expression. That's why
1181 we do the following language detection only if the context block
1182 has been specifically provided. */
1183 struct symbol
*func
= block_linkage_function (block
);
1186 lang
= language_def (SYMBOL_LANGUAGE (func
));
1187 if (lang
== NULL
|| lang
->la_language
== language_unknown
)
1188 lang
= current_language
;
1191 lang
= current_language
;
1193 /* get_current_arch may reset CURRENT_LANGUAGE via select_frame.
1194 While we need CURRENT_LANGUAGE to be set to LANG (for lookup_symbol
1195 and others called from *.y) ensure CURRENT_LANGUAGE gets restored
1196 to the value matching SELECTED_FRAME as set by get_current_arch. */
1198 initialize_expout (&ps
, 10, lang
, get_current_arch ());
1200 scoped_restore_current_language lang_saver
;
1201 set_language (lang
->la_language
);
1205 if (lang
->la_parser (&ps
))
1206 lang
->la_error (NULL
);
1208 CATCH (except
, RETURN_MASK_ALL
)
1210 if (! parse_completion
)
1213 throw_exception (except
);
1218 reallocate_expout (&ps
);
1220 /* Convert expression from postfix form as generated by yacc
1221 parser, to a prefix form. */
1223 if (expressiondebug
)
1224 dump_raw_expression (ps
.expout
, gdb_stdlog
,
1225 "before conversion to prefix form");
1227 subexp
= prefixify_expression (ps
.expout
);
1229 *out_subexp
= subexp
;
1231 lang
->la_post_parser (&ps
.expout
, void_context_p
);
1233 if (expressiondebug
)
1234 dump_prefix_expression (ps
.expout
, gdb_stdlog
);
1236 *stringptr
= lexptr
;
1237 return expression_up (ps
.expout
);
1240 /* Parse STRING as an expression, and complain if this fails
1241 to use up all of the contents of STRING. */
1244 parse_expression (const char *string
)
1246 expression_up exp
= parse_exp_1 (&string
, 0, 0, 0);
1248 error (_("Junk after end of expression."));
1252 /* Same as parse_expression, but using the given language (LANG)
1253 to parse the expression. */
1256 parse_expression_with_language (const char *string
, enum language lang
)
1258 gdb::optional
<scoped_restore_current_language
> lang_saver
;
1259 if (current_language
->la_language
!= lang
)
1261 lang_saver
.emplace ();
1262 set_language (lang
);
1265 return parse_expression (string
);
1268 /* Parse STRING as an expression. If parsing ends in the middle of a
1269 field reference, return the type of the left-hand-side of the
1270 reference; furthermore, if the parsing ends in the field name,
1271 return the field name in *NAME. If the parsing ends in the middle
1272 of a field reference, but the reference is somehow invalid, throw
1273 an exception. In all other cases, return NULL. Returned non-NULL
1274 *NAME must be freed by the caller. */
1277 parse_expression_for_completion (const char *string
, char **name
,
1278 enum type_code
*code
)
1286 parse_completion
= 1;
1287 exp
= parse_exp_in_context (&string
, 0, 0, 0, 0, &subexp
);
1289 CATCH (except
, RETURN_MASK_ERROR
)
1291 /* Nothing, EXP remains NULL. */
1295 parse_completion
= 0;
1299 if (expout_tag_completion_type
!= TYPE_CODE_UNDEF
)
1301 *code
= expout_tag_completion_type
;
1302 *name
= expout_completion_name
;
1303 expout_completion_name
= NULL
;
1307 if (expout_last_struct
== -1)
1310 *name
= extract_field_op (exp
.get (), &subexp
);
1314 /* This might throw an exception. If so, we want to let it
1316 val
= evaluate_subexpression_type (exp
.get (), subexp
);
1317 /* (*NAME) is a part of the EXP memory block freed below. */
1318 *name
= xstrdup (*name
);
1320 return value_type (val
);
1323 /* A post-parser that does nothing. */
1326 null_post_parser (struct expression
**exp
, int void_context_p
)
1330 /* Parse floating point value P of length LEN.
1331 Return false if invalid, true if valid.
1332 The successfully parsed number is stored in DATA in
1333 target format for floating-point type TYPE.
1335 NOTE: This accepts the floating point syntax that sscanf accepts. */
1338 parse_float (const char *p
, int len
,
1339 const struct type
*type
, gdb_byte
*data
)
1341 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
1342 return floatformat_from_string (floatformat_from_type (type
),
1343 data
, std::string (p
, len
));
1345 return decimal_from_string (data
, TYPE_LENGTH (type
),
1346 gdbarch_byte_order (get_type_arch (type
)),
1347 std::string (p
, len
));
1350 /* Stuff for maintaining a stack of types. Currently just used by C, but
1351 probably useful for any language which declares its types "backwards". */
1353 /* Ensure that there are HOWMUCH open slots on the type stack STACK. */
1356 type_stack_reserve (struct type_stack
*stack
, int howmuch
)
1358 if (stack
->depth
+ howmuch
>= stack
->size
)
1361 if (stack
->size
< howmuch
)
1362 stack
->size
= howmuch
;
1363 stack
->elements
= XRESIZEVEC (union type_stack_elt
, stack
->elements
,
1368 /* Ensure that there is a single open slot in the global type stack. */
1371 check_type_stack_depth (void)
1373 type_stack_reserve (&type_stack
, 1);
1376 /* A helper function for insert_type and insert_type_address_space.
1377 This does work of expanding the type stack and inserting the new
1378 element, ELEMENT, into the stack at location SLOT. */
1381 insert_into_type_stack (int slot
, union type_stack_elt element
)
1383 check_type_stack_depth ();
1385 if (slot
< type_stack
.depth
)
1386 memmove (&type_stack
.elements
[slot
+ 1], &type_stack
.elements
[slot
],
1387 (type_stack
.depth
- slot
) * sizeof (union type_stack_elt
));
1388 type_stack
.elements
[slot
] = element
;
1392 /* Insert a new type, TP, at the bottom of the type stack. If TP is
1393 tp_pointer, tp_reference or tp_rvalue_reference, it is inserted at the
1394 bottom. If TP is a qualifier, it is inserted at slot 1 (just above a
1395 previous tp_pointer) if there is anything on the stack, or simply pushed
1396 if the stack is empty. Other values for TP are invalid. */
1399 insert_type (enum type_pieces tp
)
1401 union type_stack_elt element
;
1404 gdb_assert (tp
== tp_pointer
|| tp
== tp_reference
1405 || tp
== tp_rvalue_reference
|| tp
== tp_const
1406 || tp
== tp_volatile
);
1408 /* If there is anything on the stack (we know it will be a
1409 tp_pointer), insert the qualifier above it. Otherwise, simply
1410 push this on the top of the stack. */
1411 if (type_stack
.depth
&& (tp
== tp_const
|| tp
== tp_volatile
))
1417 insert_into_type_stack (slot
, element
);
1421 push_type (enum type_pieces tp
)
1423 check_type_stack_depth ();
1424 type_stack
.elements
[type_stack
.depth
++].piece
= tp
;
1428 push_type_int (int n
)
1430 check_type_stack_depth ();
1431 type_stack
.elements
[type_stack
.depth
++].int_val
= n
;
1434 /* Insert a tp_space_identifier and the corresponding address space
1435 value into the stack. STRING is the name of an address space, as
1436 recognized by address_space_name_to_int. If the stack is empty,
1437 the new elements are simply pushed. If the stack is not empty,
1438 this function assumes that the first item on the stack is a
1439 tp_pointer, and the new values are inserted above the first
1443 insert_type_address_space (struct parser_state
*pstate
, char *string
)
1445 union type_stack_elt element
;
1448 /* If there is anything on the stack (we know it will be a
1449 tp_pointer), insert the address space qualifier above it.
1450 Otherwise, simply push this on the top of the stack. */
1451 if (type_stack
.depth
)
1456 element
.piece
= tp_space_identifier
;
1457 insert_into_type_stack (slot
, element
);
1458 element
.int_val
= address_space_name_to_int (parse_gdbarch (pstate
),
1460 insert_into_type_stack (slot
, element
);
1466 if (type_stack
.depth
)
1467 return type_stack
.elements
[--type_stack
.depth
].piece
;
1474 if (type_stack
.depth
)
1475 return type_stack
.elements
[--type_stack
.depth
].int_val
;
1476 /* "Can't happen". */
1480 /* Pop a type list element from the global type stack. */
1482 static VEC (type_ptr
) *
1485 gdb_assert (type_stack
.depth
);
1486 return type_stack
.elements
[--type_stack
.depth
].typelist_val
;
1489 /* Pop a type_stack element from the global type stack. */
1491 static struct type_stack
*
1492 pop_type_stack (void)
1494 gdb_assert (type_stack
.depth
);
1495 return type_stack
.elements
[--type_stack
.depth
].stack_val
;
1498 /* Append the elements of the type stack FROM to the type stack TO.
1499 Always returns TO. */
1502 append_type_stack (struct type_stack
*to
, struct type_stack
*from
)
1504 type_stack_reserve (to
, from
->depth
);
1506 memcpy (&to
->elements
[to
->depth
], &from
->elements
[0],
1507 from
->depth
* sizeof (union type_stack_elt
));
1508 to
->depth
+= from
->depth
;
1513 /* Push the type stack STACK as an element on the global type stack. */
1516 push_type_stack (struct type_stack
*stack
)
1518 check_type_stack_depth ();
1519 type_stack
.elements
[type_stack
.depth
++].stack_val
= stack
;
1520 push_type (tp_type_stack
);
1523 /* Copy the global type stack into a newly allocated type stack and
1524 return it. The global stack is cleared. The returned type stack
1525 must be freed with type_stack_cleanup. */
1528 get_type_stack (void)
1530 struct type_stack
*result
= XNEW (struct type_stack
);
1532 *result
= type_stack
;
1533 type_stack
.depth
= 0;
1534 type_stack
.size
= 0;
1535 type_stack
.elements
= NULL
;
1540 /* A cleanup function that destroys a single type stack. */
1543 type_stack_cleanup (void *arg
)
1545 struct type_stack
*stack
= (struct type_stack
*) arg
;
1547 xfree (stack
->elements
);
1551 /* Push a function type with arguments onto the global type stack.
1552 LIST holds the argument types. If the final item in LIST is NULL,
1553 then the function will be varargs. */
1556 push_typelist (VEC (type_ptr
) *list
)
1558 check_type_stack_depth ();
1559 type_stack
.elements
[type_stack
.depth
++].typelist_val
= list
;
1560 push_type (tp_function_with_arguments
);
1563 /* Pop the type stack and return a type_instance_flags that
1564 corresponds the const/volatile qualifiers on the stack. This is
1565 called by the C++ parser when parsing methods types, and as such no
1566 other kind of type in the type stack is expected. */
1569 follow_type_instance_flags ()
1571 type_instance_flags flags
= 0;
1574 switch (pop_type ())
1579 flags
|= TYPE_INSTANCE_FLAG_CONST
;
1582 flags
|= TYPE_INSTANCE_FLAG_VOLATILE
;
1585 gdb_assert_not_reached ("unrecognized tp_ value in follow_types");
1590 /* Pop the type stack and return the type which corresponds to FOLLOW_TYPE
1591 as modified by all the stuff on the stack. */
1593 follow_types (struct type
*follow_type
)
1597 int make_volatile
= 0;
1598 int make_addr_space
= 0;
1602 switch (pop_type ())
1607 follow_type
= make_cv_type (make_const
,
1608 TYPE_VOLATILE (follow_type
),
1611 follow_type
= make_cv_type (TYPE_CONST (follow_type
),
1614 if (make_addr_space
)
1615 follow_type
= make_type_with_address_space (follow_type
,
1617 make_const
= make_volatile
= 0;
1618 make_addr_space
= 0;
1626 case tp_space_identifier
:
1627 make_addr_space
= pop_type_int ();
1630 follow_type
= lookup_pointer_type (follow_type
);
1632 follow_type
= make_cv_type (make_const
,
1633 TYPE_VOLATILE (follow_type
),
1636 follow_type
= make_cv_type (TYPE_CONST (follow_type
),
1639 if (make_addr_space
)
1640 follow_type
= make_type_with_address_space (follow_type
,
1642 make_const
= make_volatile
= 0;
1643 make_addr_space
= 0;
1646 follow_type
= lookup_lvalue_reference_type (follow_type
);
1647 goto process_reference
;
1648 case tp_rvalue_reference
:
1649 follow_type
= lookup_rvalue_reference_type (follow_type
);
1652 follow_type
= make_cv_type (make_const
,
1653 TYPE_VOLATILE (follow_type
),
1656 follow_type
= make_cv_type (TYPE_CONST (follow_type
),
1659 if (make_addr_space
)
1660 follow_type
= make_type_with_address_space (follow_type
,
1662 make_const
= make_volatile
= 0;
1663 make_addr_space
= 0;
1666 array_size
= pop_type_int ();
1667 /* FIXME-type-allocation: need a way to free this type when we are
1670 lookup_array_range_type (follow_type
,
1671 0, array_size
>= 0 ? array_size
- 1 : 0);
1673 TYPE_HIGH_BOUND_KIND (TYPE_INDEX_TYPE (follow_type
))
1677 /* FIXME-type-allocation: need a way to free this type when we are
1679 follow_type
= lookup_function_type (follow_type
);
1682 case tp_function_with_arguments
:
1684 VEC (type_ptr
) *args
= pop_typelist ();
1687 = lookup_function_type_with_arguments (follow_type
,
1688 VEC_length (type_ptr
, args
),
1689 VEC_address (type_ptr
,
1691 VEC_free (type_ptr
, args
);
1697 struct type_stack
*stack
= pop_type_stack ();
1698 /* Sort of ugly, but not really much worse than the
1700 struct type_stack save
= type_stack
;
1702 type_stack
= *stack
;
1703 follow_type
= follow_types (follow_type
);
1704 gdb_assert (type_stack
.depth
== 0);
1710 gdb_assert_not_reached ("unrecognized tp_ value in follow_types");
1715 /* This function avoids direct calls to fprintf
1716 in the parser generated debug code. */
1718 parser_fprintf (FILE *x
, const char *y
, ...)
1724 vfprintf_unfiltered (gdb_stderr
, y
, args
);
1727 fprintf_unfiltered (gdb_stderr
, " Unknown FILE used.\n");
1728 vfprintf_unfiltered (gdb_stderr
, y
, args
);
1733 /* Implementation of the exp_descriptor method operator_check. */
1736 operator_check_standard (struct expression
*exp
, int pos
,
1737 int (*objfile_func
) (struct objfile
*objfile
,
1741 const union exp_element
*const elts
= exp
->elts
;
1742 struct type
*type
= NULL
;
1743 struct objfile
*objfile
= NULL
;
1745 /* Extended operators should have been already handled by exp_descriptor
1746 iterate method of its specific language. */
1747 gdb_assert (elts
[pos
].opcode
< OP_EXTENDED0
);
1749 /* Track the callers of write_exp_elt_type for this table. */
1751 switch (elts
[pos
].opcode
)
1763 type
= elts
[pos
+ 1].type
;
1768 LONGEST arg
, nargs
= elts
[pos
+ 2].longconst
;
1770 for (arg
= 0; arg
< nargs
; arg
++)
1772 struct type
*type
= elts
[pos
+ 3 + arg
].type
;
1773 struct objfile
*objfile
= TYPE_OBJFILE (type
);
1775 if (objfile
&& (*objfile_func
) (objfile
, data
))
1783 const struct block
*const block
= elts
[pos
+ 1].block
;
1784 const struct symbol
*const symbol
= elts
[pos
+ 2].symbol
;
1786 /* Check objfile where the variable itself is placed.
1787 SYMBOL_OBJ_SECTION (symbol) may be NULL. */
1788 if ((*objfile_func
) (symbol_objfile (symbol
), data
))
1791 /* Check objfile where is placed the code touching the variable. */
1792 objfile
= lookup_objfile_from_block (block
);
1794 type
= SYMBOL_TYPE (symbol
);
1797 case OP_VAR_MSYM_VALUE
:
1798 objfile
= elts
[pos
+ 1].objfile
;
1802 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
1804 if (type
&& TYPE_OBJFILE (type
)
1805 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
1807 if (objfile
&& (*objfile_func
) (objfile
, data
))
1813 /* Call OBJFILE_FUNC for any objfile found being referenced by EXP.
1814 OBJFILE_FUNC is never called with NULL OBJFILE. OBJFILE_FUNC get
1815 passed an arbitrary caller supplied DATA pointer. If OBJFILE_FUNC
1816 returns non-zero value then (any other) non-zero value is immediately
1817 returned to the caller. Otherwise zero is returned after iterating
1818 through whole EXP. */
1821 exp_iterate (struct expression
*exp
,
1822 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
1827 for (endpos
= exp
->nelts
; endpos
> 0; )
1829 int pos
, args
, oplen
= 0;
1831 operator_length (exp
, endpos
, &oplen
, &args
);
1832 gdb_assert (oplen
> 0);
1834 pos
= endpos
- oplen
;
1835 if (exp
->language_defn
->la_exp_desc
->operator_check (exp
, pos
,
1836 objfile_func
, data
))
1845 /* Helper for exp_uses_objfile. */
1848 exp_uses_objfile_iter (struct objfile
*exp_objfile
, void *objfile_voidp
)
1850 struct objfile
*objfile
= (struct objfile
*) objfile_voidp
;
1852 if (exp_objfile
->separate_debug_objfile_backlink
)
1853 exp_objfile
= exp_objfile
->separate_debug_objfile_backlink
;
1855 return exp_objfile
== objfile
;
1858 /* Return 1 if EXP uses OBJFILE (and will become dangling when OBJFILE
1859 is unloaded), otherwise return 0. OBJFILE must not be a separate debug info
1863 exp_uses_objfile (struct expression
*exp
, struct objfile
*objfile
)
1865 gdb_assert (objfile
->separate_debug_objfile_backlink
== NULL
);
1867 return exp_iterate (exp
, exp_uses_objfile_iter
, objfile
);
1870 /* See definition in parser-defs.h. */
1873 increase_expout_size (struct parser_state
*ps
, size_t lenelt
)
1875 if ((ps
->expout_ptr
+ lenelt
) >= ps
->expout_size
)
1877 ps
->expout_size
= std::max (ps
->expout_size
* 2,
1878 ps
->expout_ptr
+ lenelt
+ 10);
1879 ps
->expout
= (struct expression
*)
1880 xrealloc (ps
->expout
, (sizeof (struct expression
)
1881 + EXP_ELEM_TO_BYTES (ps
->expout_size
)));
1886 _initialize_parse (void)
1888 type_stack
.size
= 0;
1889 type_stack
.depth
= 0;
1890 type_stack
.elements
= NULL
;
1892 add_setshow_zuinteger_cmd ("expression", class_maintenance
,
1894 _("Set expression debugging."),
1895 _("Show expression debugging."),
1896 _("When non-zero, the internal representation "
1897 "of expressions will be printed."),
1899 show_expressiondebug
,
1900 &setdebuglist
, &showdebuglist
);
1901 add_setshow_boolean_cmd ("parser", class_maintenance
,
1903 _("Set parser debugging."),
1904 _("Show parser debugging."),
1905 _("When non-zero, expression parser "
1906 "tracing will be enabled."),
1909 &setdebuglist
, &showdebuglist
);