1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986-2020 Free Software Foundation, Inc.
4 This file is part of GDB.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>. */
19 /* Parse a C expression from text in a string,
20 and return the result as a struct expression pointer.
21 That structure contains arithmetic operations in reverse polish,
22 with constants represented by operations that are followed by special data.
23 See expression.h for the details of the format.
24 What is important here is that it can be built up sequentially
25 during the process of parsing; the lower levels of the tree always
26 come first in the result.
28 Note that malloc's and realloc's in this file are transformed to
29 xmalloc and xrealloc respectively by the same sed command in the
30 makefile that remaps any other malloc/realloc inserted by the parser
31 generator. Doing this with #defines and trying to control the interaction
32 with include files (<malloc.h> and <stdlib.h> for example) just became
33 too messy, particularly when such includes can be inserted at random
34 times by the parser generator. */
40 #include "expression.h"
42 #include "parser-defs.h"
45 #include "c-support.h"
46 #include "bfd.h" /* Required by objfiles.h. */
47 #include "symfile.h" /* Required by objfiles.h. */
48 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
51 #include "cp-support.h"
52 #include "macroscope.h"
53 #include "objc-lang.h"
54 #include "typeprint.h"
56 #include "type-stack.h"
57 #include "target-float.h"
59 #define parse_type(ps) builtin_type (ps->gdbarch ())
61 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror,
63 #define GDB_YY_REMAP_PREFIX c_
66 /* The state of the parser, used internally when we are parsing the
69 static struct parser_state *pstate = NULL;
71 /* Data that must be held for the duration of a parse. */
75 /* These are used to hold type lists and type stacks that are
76 allocated during the parse. */
77 std::vector<std::unique_ptr<std::vector<struct type *>>> type_lists;
78 std::vector<std::unique_ptr<struct type_stack>> type_stacks;
80 /* Storage for some strings allocated during the parse. */
81 std::vector<gdb::unique_xmalloc_ptr<char>> strings;
83 /* When we find that lexptr (the global var defined in parse.c) is
84 pointing at a macro invocation, we expand the invocation, and call
85 scan_macro_expansion to save the old lexptr here and point lexptr
86 into the expanded text. When we reach the end of that, we call
87 end_macro_expansion to pop back to the value we saved here. The
88 macro expansion code promises to return only fully-expanded text,
89 so we don't need to "push" more than one level.
91 This is disgusting, of course. It would be cleaner to do all macro
92 expansion beforehand, and then hand that to lexptr. But we don't
93 really know where the expression ends. Remember, in a command like
95 (gdb) break *ADDRESS if CONDITION
97 we evaluate ADDRESS in the scope of the current frame, but we
98 evaluate CONDITION in the scope of the breakpoint's location. So
99 it's simply wrong to try to macro-expand the whole thing at once. */
100 const char *macro_original_text = nullptr;
102 /* We save all intermediate macro expansions on this obstack for the
103 duration of a single parse. The expansion text may sometimes have
104 to live past the end of the expansion, due to yacc lookahead.
105 Rather than try to be clever about saving the data for a single
106 token, we simply keep it all and delete it after parsing has
108 auto_obstack expansion_obstack;
110 /* The type stack. */
111 struct type_stack type_stack;
114 /* This is set and cleared in c_parse. */
116 static struct c_parse_state *cpstate;
120 static int yylex (void);
122 static void yyerror (const char *);
124 static int type_aggregate_p (struct type *);
128 /* Although the yacc "value" of an expression is not used,
129 since the result is stored in the structure being created,
130 other node types do have values. */
145 struct typed_stoken tsval;
147 struct symtoken ssym;
149 const struct block *bval;
150 enum exp_opcode opcode;
152 struct stoken_vector svec;
153 std::vector<struct type *> *tvec;
155 struct type_stack *type_stack;
157 struct objc_class_str theclass;
161 /* YYSTYPE gets defined by %union */
162 static int parse_number (struct parser_state *par_state,
163 const char *, int, int, YYSTYPE *);
164 static struct stoken operator_stoken (const char *);
165 static struct stoken typename_stoken (const char *);
166 static void check_parameter_typelist (std::vector<struct type *> *);
167 static void write_destructor_name (struct parser_state *par_state,
171 static void c_print_token (FILE *file, int type, YYSTYPE value);
172 #define YYPRINT(FILE, TYPE, VALUE) c_print_token (FILE, TYPE, VALUE)
176 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly function_method
178 %type <tval> type typebase scalar_type
179 %type <tvec> nonempty_typelist func_mod parameter_typelist
180 /* %type <bval> block */
182 /* Fancy type parsing. */
184 %type <lval> array_mod
185 %type <tval> conversion_type_id
187 %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl
189 %token <typed_val_int> INT COMPLEX_INT
190 %token <typed_val_float> FLOAT COMPLEX_FLOAT
192 /* Both NAME and TYPENAME tokens represent symbols in the input,
193 and both convey their data as strings.
194 But a TYPENAME is a string that happens to be defined as a typedef
195 or builtin type name (such as int or char)
196 and a NAME is any other symbol.
197 Contexts where this distinction is not important can use the
198 nonterminal "name", which matches either NAME or TYPENAME. */
200 %token <tsval> STRING
201 %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */
202 %token SELECTOR /* ObjC "@selector" pseudo-operator */
204 %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */
205 %token <ssym> UNKNOWN_CPP_NAME
206 %token <voidval> COMPLETE
207 %token <tsym> TYPENAME
208 %token <theclass> CLASSNAME /* ObjC Class name */
209 %type <sval> name field_name
210 %type <svec> string_exp
211 %type <ssym> name_not_typename
212 %type <tsym> type_name
214 /* This is like a '[' token, but is only generated when parsing
215 Objective C. This lets us reuse the same parser without
216 erroneously parsing ObjC-specific expressions in C. */
219 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
220 but which would parse as a valid number in the current input radix.
221 E.g. "c" when input_radix==16. Depending on the parse, it will be
222 turned into a name or into a number. */
224 %token <ssym> NAME_OR_INT
227 %token STRUCT CLASS UNION ENUM SIZEOF ALIGNOF UNSIGNED COLONCOLON
232 %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
238 /* Special type cases, put in to allow the parser to distinguish different
240 %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
241 %token RESTRICT ATOMIC
242 %token FLOAT_KEYWORD COMPLEX
244 %token <sval> DOLLAR_VARIABLE
246 %token <opcode> ASSIGN_MODIFY
255 %right '=' ASSIGN_MODIFY
263 %left '<' '>' LEQ GEQ
268 %right UNARY INCREMENT DECREMENT
269 %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '('
270 %token <ssym> BLOCKNAME
271 %token <bval> FILENAME
285 { write_exp_elt_opcode(pstate, OP_TYPE);
286 write_exp_elt_type(pstate, $1);
287 write_exp_elt_opcode(pstate, OP_TYPE);}
290 write_exp_elt_opcode (pstate, OP_TYPEOF);
292 | TYPEOF '(' type ')'
294 write_exp_elt_opcode (pstate, OP_TYPE);
295 write_exp_elt_type (pstate, $3);
296 write_exp_elt_opcode (pstate, OP_TYPE);
298 | DECLTYPE '(' exp ')'
300 write_exp_elt_opcode (pstate, OP_DECLTYPE);
304 /* Expressions, including the comma operator. */
307 { write_exp_elt_opcode (pstate, BINOP_COMMA); }
310 /* Expressions, not including the comma operator. */
311 exp : '*' exp %prec UNARY
312 { write_exp_elt_opcode (pstate, UNOP_IND); }
315 exp : '&' exp %prec UNARY
316 { write_exp_elt_opcode (pstate, UNOP_ADDR); }
319 exp : '-' exp %prec UNARY
320 { write_exp_elt_opcode (pstate, UNOP_NEG); }
323 exp : '+' exp %prec UNARY
324 { write_exp_elt_opcode (pstate, UNOP_PLUS); }
327 exp : '!' exp %prec UNARY
328 { write_exp_elt_opcode (pstate, UNOP_LOGICAL_NOT); }
331 exp : '~' exp %prec UNARY
332 { write_exp_elt_opcode (pstate, UNOP_COMPLEMENT); }
335 exp : INCREMENT exp %prec UNARY
336 { write_exp_elt_opcode (pstate, UNOP_PREINCREMENT); }
339 exp : DECREMENT exp %prec UNARY
340 { write_exp_elt_opcode (pstate, UNOP_PREDECREMENT); }
343 exp : exp INCREMENT %prec UNARY
344 { write_exp_elt_opcode (pstate, UNOP_POSTINCREMENT); }
347 exp : exp DECREMENT %prec UNARY
348 { write_exp_elt_opcode (pstate, UNOP_POSTDECREMENT); }
351 exp : TYPEID '(' exp ')' %prec UNARY
352 { write_exp_elt_opcode (pstate, OP_TYPEID); }
355 exp : TYPEID '(' type_exp ')' %prec UNARY
356 { write_exp_elt_opcode (pstate, OP_TYPEID); }
359 exp : SIZEOF exp %prec UNARY
360 { write_exp_elt_opcode (pstate, UNOP_SIZEOF); }
363 exp : ALIGNOF '(' type_exp ')' %prec UNARY
364 { write_exp_elt_opcode (pstate, UNOP_ALIGNOF); }
367 exp : exp ARROW field_name
368 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
369 write_exp_string (pstate, $3);
370 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
373 exp : exp ARROW field_name COMPLETE
374 { pstate->mark_struct_expression ();
375 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
376 write_exp_string (pstate, $3);
377 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
380 exp : exp ARROW COMPLETE
382 pstate->mark_struct_expression ();
383 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
386 write_exp_string (pstate, s);
387 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
390 exp : exp ARROW '~' name
391 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
392 write_destructor_name (pstate, $4);
393 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
396 exp : exp ARROW '~' name COMPLETE
397 { pstate->mark_struct_expression ();
398 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
399 write_destructor_name (pstate, $4);
400 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
403 exp : exp ARROW qualified_name
404 { /* exp->type::name becomes exp->*(&type::name) */
405 /* Note: this doesn't work if name is a
406 static member! FIXME */
407 write_exp_elt_opcode (pstate, UNOP_ADDR);
408 write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
411 exp : exp ARROW_STAR exp
412 { write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
415 exp : exp '.' field_name
416 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
417 write_exp_string (pstate, $3);
418 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
421 exp : exp '.' field_name COMPLETE
422 { pstate->mark_struct_expression ();
423 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
424 write_exp_string (pstate, $3);
425 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
428 exp : exp '.' COMPLETE
430 pstate->mark_struct_expression ();
431 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
434 write_exp_string (pstate, s);
435 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
438 exp : exp '.' '~' name
439 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
440 write_destructor_name (pstate, $4);
441 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
444 exp : exp '.' '~' name COMPLETE
445 { pstate->mark_struct_expression ();
446 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
447 write_destructor_name (pstate, $4);
448 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
451 exp : exp '.' qualified_name
452 { /* exp.type::name becomes exp.*(&type::name) */
453 /* Note: this doesn't work if name is a
454 static member! FIXME */
455 write_exp_elt_opcode (pstate, UNOP_ADDR);
456 write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
459 exp : exp DOT_STAR exp
460 { write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
463 exp : exp '[' exp1 ']'
464 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
467 exp : exp OBJC_LBRAC exp1 ']'
468 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
472 * The rules below parse ObjC message calls of the form:
473 * '[' target selector {':' argument}* ']'
476 exp : OBJC_LBRAC TYPENAME
480 std::string copy = copy_name ($2.stoken);
481 theclass = lookup_objc_class (pstate->gdbarch (),
484 error (_("%s is not an ObjC Class"),
486 write_exp_elt_opcode (pstate, OP_LONG);
487 write_exp_elt_type (pstate,
488 parse_type (pstate)->builtin_int);
489 write_exp_elt_longcst (pstate, (LONGEST) theclass);
490 write_exp_elt_opcode (pstate, OP_LONG);
494 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
495 end_msglist (pstate);
496 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
500 exp : OBJC_LBRAC CLASSNAME
502 write_exp_elt_opcode (pstate, OP_LONG);
503 write_exp_elt_type (pstate,
504 parse_type (pstate)->builtin_int);
505 write_exp_elt_longcst (pstate, (LONGEST) $2.theclass);
506 write_exp_elt_opcode (pstate, OP_LONG);
510 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
511 end_msglist (pstate);
512 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
519 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
520 end_msglist (pstate);
521 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
526 { add_msglist(&$1, 0); }
534 msgarg : name ':' exp
535 { add_msglist(&$1, 1); }
536 | ':' exp /* Unnamed arg. */
537 { add_msglist(0, 1); }
538 | ',' exp /* Variable number of args. */
539 { add_msglist(0, 0); }
543 /* This is to save the value of arglist_len
544 being accumulated by an outer function call. */
545 { pstate->start_arglist (); }
546 arglist ')' %prec ARROW
547 { write_exp_elt_opcode (pstate, OP_FUNCALL);
548 write_exp_elt_longcst (pstate,
549 pstate->end_arglist ());
550 write_exp_elt_opcode (pstate, OP_FUNCALL); }
553 /* This is here to disambiguate with the production for
554 "func()::static_var" further below, which uses
555 function_method_void. */
556 exp : exp '(' ')' %prec ARROW
557 { pstate->start_arglist ();
558 write_exp_elt_opcode (pstate, OP_FUNCALL);
559 write_exp_elt_longcst (pstate,
560 pstate->end_arglist ());
561 write_exp_elt_opcode (pstate, OP_FUNCALL); }
565 exp : UNKNOWN_CPP_NAME '('
567 /* This could potentially be a an argument defined
568 lookup function (Koenig). */
569 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
571 (pstate, pstate->expression_context_block);
572 write_exp_elt_sym (pstate,
573 NULL); /* Placeholder. */
574 write_exp_string (pstate, $1.stoken);
575 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
577 /* This is to save the value of arglist_len
578 being accumulated by an outer function call. */
580 pstate->start_arglist ();
582 arglist ')' %prec ARROW
584 write_exp_elt_opcode (pstate, OP_FUNCALL);
585 write_exp_elt_longcst (pstate,
586 pstate->end_arglist ());
587 write_exp_elt_opcode (pstate, OP_FUNCALL);
592 { pstate->start_arglist (); }
599 { pstate->arglist_len = 1; }
602 arglist : arglist ',' exp %prec ABOVE_COMMA
603 { pstate->arglist_len++; }
606 function_method: exp '(' parameter_typelist ')' const_or_volatile
608 std::vector<struct type *> *type_list = $3;
609 LONGEST len = type_list->size ();
611 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
612 /* Save the const/volatile qualifiers as
613 recorded by the const_or_volatile
614 production's actions. */
615 write_exp_elt_longcst
618 .follow_type_instance_flags ()));
619 write_exp_elt_longcst (pstate, len);
620 for (type *type_elt : *type_list)
621 write_exp_elt_type (pstate, type_elt);
622 write_exp_elt_longcst(pstate, len);
623 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
627 function_method_void: exp '(' ')' const_or_volatile
628 { write_exp_elt_opcode (pstate, TYPE_INSTANCE);
630 write_exp_elt_longcst
632 cpstate->type_stack.follow_type_instance_flags ());
633 write_exp_elt_longcst (pstate, 0);
634 write_exp_elt_longcst (pstate, 0);
635 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
639 exp : function_method
642 /* Normally we must interpret "func()" as a function call, instead of
643 a type. The user needs to write func(void) to disambiguate.
644 However, in the "func()::static_var" case, there's no
646 function_method_void_or_typelist: function_method
647 | function_method_void
650 exp : function_method_void_or_typelist COLONCOLON name
652 write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR);
653 write_exp_string (pstate, $3);
654 write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR);
659 { $$ = pstate->end_arglist () - 1; }
661 exp : lcurly arglist rcurly %prec ARROW
662 { write_exp_elt_opcode (pstate, OP_ARRAY);
663 write_exp_elt_longcst (pstate, (LONGEST) 0);
664 write_exp_elt_longcst (pstate, (LONGEST) $3);
665 write_exp_elt_opcode (pstate, OP_ARRAY); }
668 exp : lcurly type_exp rcurly exp %prec UNARY
669 { write_exp_elt_opcode (pstate, UNOP_MEMVAL_TYPE); }
672 exp : '(' type_exp ')' exp %prec UNARY
673 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
680 /* Binary operators in order of decreasing precedence. */
683 { write_exp_elt_opcode (pstate, BINOP_REPEAT); }
687 { write_exp_elt_opcode (pstate, BINOP_MUL); }
691 { write_exp_elt_opcode (pstate, BINOP_DIV); }
695 { write_exp_elt_opcode (pstate, BINOP_REM); }
699 { write_exp_elt_opcode (pstate, BINOP_ADD); }
703 { write_exp_elt_opcode (pstate, BINOP_SUB); }
707 { write_exp_elt_opcode (pstate, BINOP_LSH); }
711 { write_exp_elt_opcode (pstate, BINOP_RSH); }
715 { write_exp_elt_opcode (pstate, BINOP_EQUAL); }
718 exp : exp NOTEQUAL exp
719 { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); }
723 { write_exp_elt_opcode (pstate, BINOP_LEQ); }
727 { write_exp_elt_opcode (pstate, BINOP_GEQ); }
731 { write_exp_elt_opcode (pstate, BINOP_LESS); }
735 { write_exp_elt_opcode (pstate, BINOP_GTR); }
739 { write_exp_elt_opcode (pstate, BINOP_BITWISE_AND); }
743 { write_exp_elt_opcode (pstate, BINOP_BITWISE_XOR); }
747 { write_exp_elt_opcode (pstate, BINOP_BITWISE_IOR); }
751 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); }
755 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); }
758 exp : exp '?' exp ':' exp %prec '?'
759 { write_exp_elt_opcode (pstate, TERNOP_COND); }
763 { write_exp_elt_opcode (pstate, BINOP_ASSIGN); }
766 exp : exp ASSIGN_MODIFY exp
767 { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY);
768 write_exp_elt_opcode (pstate, $2);
769 write_exp_elt_opcode (pstate,
770 BINOP_ASSIGN_MODIFY); }
774 { write_exp_elt_opcode (pstate, OP_LONG);
775 write_exp_elt_type (pstate, $1.type);
776 write_exp_elt_longcst (pstate, (LONGEST) ($1.val));
777 write_exp_elt_opcode (pstate, OP_LONG); }
782 write_exp_elt_opcode (pstate, OP_LONG);
783 write_exp_elt_type (pstate, TYPE_TARGET_TYPE ($1.type));
784 write_exp_elt_longcst (pstate, 0);
785 write_exp_elt_opcode (pstate, OP_LONG);
786 write_exp_elt_opcode (pstate, OP_LONG);
787 write_exp_elt_type (pstate, TYPE_TARGET_TYPE ($1.type));
788 write_exp_elt_longcst (pstate, (LONGEST) ($1.val));
789 write_exp_elt_opcode (pstate, OP_LONG);
790 write_exp_elt_opcode (pstate, OP_COMPLEX);
791 write_exp_elt_type (pstate, $1.type);
792 write_exp_elt_opcode (pstate, OP_COMPLEX);
798 struct stoken_vector vec;
801 write_exp_string_vector (pstate, $1.type, &vec);
807 parse_number (pstate, $1.stoken.ptr,
808 $1.stoken.length, 0, &val);
809 write_exp_elt_opcode (pstate, OP_LONG);
810 write_exp_elt_type (pstate, val.typed_val_int.type);
811 write_exp_elt_longcst (pstate,
812 (LONGEST) val.typed_val_int.val);
813 write_exp_elt_opcode (pstate, OP_LONG);
819 { write_exp_elt_opcode (pstate, OP_FLOAT);
820 write_exp_elt_type (pstate, $1.type);
821 write_exp_elt_floatcst (pstate, $1.val);
822 write_exp_elt_opcode (pstate, OP_FLOAT); }
827 struct type *underlying
828 = TYPE_TARGET_TYPE ($1.type);
830 write_exp_elt_opcode (pstate, OP_FLOAT);
831 write_exp_elt_type (pstate, underlying);
833 target_float_from_host_double (val, underlying, 0);
834 write_exp_elt_floatcst (pstate, val);
835 write_exp_elt_opcode (pstate, OP_FLOAT);
836 write_exp_elt_opcode (pstate, OP_FLOAT);
837 write_exp_elt_type (pstate, underlying);
838 write_exp_elt_floatcst (pstate, $1.val);
839 write_exp_elt_opcode (pstate, OP_FLOAT);
840 write_exp_elt_opcode (pstate, OP_COMPLEX);
841 write_exp_elt_type (pstate, $1.type);
842 write_exp_elt_opcode (pstate, OP_COMPLEX);
849 exp : DOLLAR_VARIABLE
851 write_dollar_variable (pstate, $1);
855 exp : SELECTOR '(' name ')'
857 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR);
858 write_exp_string (pstate, $3);
859 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); }
862 exp : SIZEOF '(' type ')' %prec UNARY
863 { struct type *type = $3;
864 write_exp_elt_opcode (pstate, OP_LONG);
865 write_exp_elt_type (pstate, lookup_signed_typename
866 (pstate->language (),
868 type = check_typedef (type);
870 /* $5.3.3/2 of the C++ Standard (n3290 draft)
871 says of sizeof: "When applied to a reference
872 or a reference type, the result is the size of
873 the referenced type." */
874 if (TYPE_IS_REFERENCE (type))
875 type = check_typedef (TYPE_TARGET_TYPE (type));
876 write_exp_elt_longcst (pstate,
877 (LONGEST) TYPE_LENGTH (type));
878 write_exp_elt_opcode (pstate, OP_LONG); }
881 exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
882 { write_exp_elt_opcode (pstate,
883 UNOP_REINTERPRET_CAST); }
886 exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
887 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
890 exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
891 { write_exp_elt_opcode (pstate, UNOP_DYNAMIC_CAST); }
894 exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
895 { /* We could do more error checking here, but
896 it doesn't seem worthwhile. */
897 write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
903 /* We copy the string here, and not in the
904 lexer, to guarantee that we do not leak a
905 string. Note that we follow the
906 NUL-termination convention of the
908 struct typed_stoken *vec = XNEW (struct typed_stoken);
913 vec->length = $1.length;
914 vec->ptr = (char *) malloc ($1.length + 1);
915 memcpy (vec->ptr, $1.ptr, $1.length + 1);
920 /* Note that we NUL-terminate here, but just
924 $$.tokens = XRESIZEVEC (struct typed_stoken,
927 p = (char *) malloc ($2.length + 1);
928 memcpy (p, $2.ptr, $2.length + 1);
930 $$.tokens[$$.len - 1].type = $2.type;
931 $$.tokens[$$.len - 1].length = $2.length;
932 $$.tokens[$$.len - 1].ptr = p;
939 c_string_type type = C_STRING;
941 for (i = 0; i < $1.len; ++i)
943 switch ($1.tokens[i].type)
951 && type != $1.tokens[i].type)
952 error (_("Undefined string concatenation."));
953 type = (enum c_string_type_values) $1.tokens[i].type;
957 internal_error (__FILE__, __LINE__,
958 "unrecognized type in string concatenation");
962 write_exp_string_vector (pstate, type, &$1);
963 for (i = 0; i < $1.len; ++i)
964 free ($1.tokens[i].ptr);
969 exp : NSSTRING /* ObjC NextStep NSString constant
970 * of the form '@' '"' string '"'.
972 { write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING);
973 write_exp_string (pstate, $1);
974 write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); }
979 { write_exp_elt_opcode (pstate, OP_LONG);
980 write_exp_elt_type (pstate,
981 parse_type (pstate)->builtin_bool);
982 write_exp_elt_longcst (pstate, (LONGEST) 1);
983 write_exp_elt_opcode (pstate, OP_LONG); }
987 { write_exp_elt_opcode (pstate, OP_LONG);
988 write_exp_elt_type (pstate,
989 parse_type (pstate)->builtin_bool);
990 write_exp_elt_longcst (pstate, (LONGEST) 0);
991 write_exp_elt_opcode (pstate, OP_LONG); }
999 $$ = SYMBOL_BLOCK_VALUE ($1.sym.symbol);
1001 error (_("No file or function \"%s\"."),
1002 copy_name ($1.stoken).c_str ());
1010 block : block COLONCOLON name
1012 std::string copy = copy_name ($3);
1014 = lookup_symbol (copy.c_str (), $1,
1015 VAR_DOMAIN, NULL).symbol;
1017 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
1018 error (_("No function \"%s\" in specified context."),
1020 $$ = SYMBOL_BLOCK_VALUE (tem); }
1023 variable: name_not_typename ENTRY
1024 { struct symbol *sym = $1.sym.symbol;
1026 if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym)
1027 || !symbol_read_needs_frame (sym))
1028 error (_("@entry can be used only for function "
1029 "parameters, not for \"%s\""),
1030 copy_name ($1.stoken).c_str ());
1032 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
1033 write_exp_elt_sym (pstate, sym);
1034 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
1038 variable: block COLONCOLON name
1040 std::string copy = copy_name ($3);
1041 struct block_symbol sym
1042 = lookup_symbol (copy.c_str (), $1,
1045 if (sym.symbol == 0)
1046 error (_("No symbol \"%s\" in specified context."),
1048 if (symbol_read_needs_frame (sym.symbol))
1049 pstate->block_tracker->update (sym);
1051 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1052 write_exp_elt_block (pstate, sym.block);
1053 write_exp_elt_sym (pstate, sym.symbol);
1054 write_exp_elt_opcode (pstate, OP_VAR_VALUE); }
1057 qualified_name: TYPENAME COLONCOLON name
1059 struct type *type = $1.type;
1060 type = check_typedef (type);
1061 if (!type_aggregate_p (type))
1062 error (_("`%s' is not defined as an aggregate type."),
1063 TYPE_SAFE_NAME (type));
1065 write_exp_elt_opcode (pstate, OP_SCOPE);
1066 write_exp_elt_type (pstate, type);
1067 write_exp_string (pstate, $3);
1068 write_exp_elt_opcode (pstate, OP_SCOPE);
1070 | TYPENAME COLONCOLON '~' name
1072 struct type *type = $1.type;
1073 struct stoken tmp_token;
1076 type = check_typedef (type);
1077 if (!type_aggregate_p (type))
1078 error (_("`%s' is not defined as an aggregate type."),
1079 TYPE_SAFE_NAME (type));
1080 buf = (char *) alloca ($4.length + 2);
1081 tmp_token.ptr = buf;
1082 tmp_token.length = $4.length + 1;
1084 memcpy (buf+1, $4.ptr, $4.length);
1085 buf[tmp_token.length] = 0;
1087 /* Check for valid destructor name. */
1088 destructor_name_p (tmp_token.ptr, $1.type);
1089 write_exp_elt_opcode (pstate, OP_SCOPE);
1090 write_exp_elt_type (pstate, type);
1091 write_exp_string (pstate, tmp_token);
1092 write_exp_elt_opcode (pstate, OP_SCOPE);
1094 | TYPENAME COLONCOLON name COLONCOLON name
1096 std::string copy = copy_name ($3);
1097 error (_("No type \"%s\" within class "
1098 "or namespace \"%s\"."),
1099 copy.c_str (), TYPE_SAFE_NAME ($1.type));
1103 variable: qualified_name
1104 | COLONCOLON name_not_typename
1106 std::string name = copy_name ($2.stoken);
1108 struct bound_minimal_symbol msymbol;
1111 = lookup_symbol (name.c_str (),
1112 (const struct block *) NULL,
1113 VAR_DOMAIN, NULL).symbol;
1116 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1117 write_exp_elt_block (pstate, NULL);
1118 write_exp_elt_sym (pstate, sym);
1119 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1123 msymbol = lookup_bound_minimal_symbol (name.c_str ());
1124 if (msymbol.minsym != NULL)
1125 write_exp_msymbol (pstate, msymbol);
1126 else if (!have_full_symbols () && !have_partial_symbols ())
1127 error (_("No symbol table is loaded. Use the \"file\" command."));
1129 error (_("No symbol \"%s\" in current context."),
1134 variable: name_not_typename
1135 { struct block_symbol sym = $1.sym;
1139 if (symbol_read_needs_frame (sym.symbol))
1140 pstate->block_tracker->update (sym);
1142 /* If we found a function, see if it's
1143 an ifunc resolver that has the same
1144 address as the ifunc symbol itself.
1145 If so, prefer the ifunc symbol. */
1147 bound_minimal_symbol resolver
1148 = find_gnu_ifunc (sym.symbol);
1149 if (resolver.minsym != NULL)
1150 write_exp_msymbol (pstate, resolver);
1153 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1154 write_exp_elt_block (pstate, sym.block);
1155 write_exp_elt_sym (pstate, sym.symbol);
1156 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1159 else if ($1.is_a_field_of_this)
1161 /* C++: it hangs off of `this'. Must
1162 not inadvertently convert from a method call
1164 pstate->block_tracker->update (sym);
1165 write_exp_elt_opcode (pstate, OP_THIS);
1166 write_exp_elt_opcode (pstate, OP_THIS);
1167 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1168 write_exp_string (pstate, $1.stoken);
1169 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1173 std::string arg = copy_name ($1.stoken);
1175 bound_minimal_symbol msymbol
1176 = lookup_bound_minimal_symbol (arg.c_str ());
1177 if (msymbol.minsym == NULL)
1179 if (!have_full_symbols () && !have_partial_symbols ())
1180 error (_("No symbol table is loaded. Use the \"file\" command."));
1182 error (_("No symbol \"%s\" in current context."),
1186 /* This minsym might be an alias for
1187 another function. See if we can find
1188 the debug symbol for the target, and
1189 if so, use it instead, since it has
1190 return type / prototype info. This
1191 is important for example for "p
1192 *__errno_location()". */
1193 symbol *alias_target
1194 = ((msymbol.minsym->type != mst_text_gnu_ifunc
1195 && msymbol.minsym->type != mst_data_gnu_ifunc)
1196 ? find_function_alias_target (msymbol)
1198 if (alias_target != NULL)
1200 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1202 (pstate, SYMBOL_BLOCK_VALUE (alias_target));
1203 write_exp_elt_sym (pstate, alias_target);
1204 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1207 write_exp_msymbol (pstate, msymbol);
1212 const_or_volatile: const_or_volatile_noopt
1218 { cpstate->type_stack.insert (tp_const); }
1220 { cpstate->type_stack.insert (tp_volatile); }
1222 { cpstate->type_stack.insert (tp_atomic); }
1224 { cpstate->type_stack.insert (tp_restrict); }
1227 cpstate->type_stack.insert (pstate,
1228 copy_name ($2.stoken).c_str ());
1232 qualifier_seq_noopt:
1234 | qualifier_seq single_qualifier
1244 { cpstate->type_stack.insert (tp_pointer); }
1247 { cpstate->type_stack.insert (tp_pointer); }
1250 { cpstate->type_stack.insert (tp_reference); }
1252 { cpstate->type_stack.insert (tp_reference); }
1254 { cpstate->type_stack.insert (tp_rvalue_reference); }
1255 | ANDAND ptr_operator
1256 { cpstate->type_stack.insert (tp_rvalue_reference); }
1259 ptr_operator_ts: ptr_operator
1261 $$ = cpstate->type_stack.create ();
1262 cpstate->type_stacks.emplace_back ($$);
1266 abs_decl: ptr_operator_ts direct_abs_decl
1267 { $$ = $2->append ($1); }
1272 direct_abs_decl: '(' abs_decl ')'
1274 | direct_abs_decl array_mod
1276 cpstate->type_stack.push ($1);
1277 cpstate->type_stack.push ($2);
1278 cpstate->type_stack.push (tp_array);
1279 $$ = cpstate->type_stack.create ();
1280 cpstate->type_stacks.emplace_back ($$);
1284 cpstate->type_stack.push ($1);
1285 cpstate->type_stack.push (tp_array);
1286 $$ = cpstate->type_stack.create ();
1287 cpstate->type_stacks.emplace_back ($$);
1290 | direct_abs_decl func_mod
1292 cpstate->type_stack.push ($1);
1293 cpstate->type_stack.push ($2);
1294 $$ = cpstate->type_stack.create ();
1295 cpstate->type_stacks.emplace_back ($$);
1299 cpstate->type_stack.push ($1);
1300 $$ = cpstate->type_stack.create ();
1301 cpstate->type_stacks.emplace_back ($$);
1311 | OBJC_LBRAC INT ']'
1317 $$ = new std::vector<struct type *>;
1318 cpstate->type_lists.emplace_back ($$);
1320 | '(' parameter_typelist ')'
1324 /* We used to try to recognize pointer to member types here, but
1325 that didn't work (shift/reduce conflicts meant that these rules never
1326 got executed). The problem is that
1327 int (foo::bar::baz::bizzle)
1328 is a function type but
1329 int (foo::bar::baz::bizzle::*)
1330 is a pointer to member type. Stroustrup loses again! */
1335 /* A helper production that recognizes scalar types that can validly
1336 be used with _Complex. */
1340 { $$ = lookup_signed_typename (pstate->language (),
1343 { $$ = lookup_signed_typename (pstate->language (),
1346 { $$ = lookup_signed_typename (pstate->language (),
1349 { $$ = lookup_signed_typename (pstate->language (),
1351 | LONG SIGNED_KEYWORD INT_KEYWORD
1352 { $$ = lookup_signed_typename (pstate->language (),
1354 | LONG SIGNED_KEYWORD
1355 { $$ = lookup_signed_typename (pstate->language (),
1357 | SIGNED_KEYWORD LONG INT_KEYWORD
1358 { $$ = lookup_signed_typename (pstate->language (),
1360 | UNSIGNED LONG INT_KEYWORD
1361 { $$ = lookup_unsigned_typename (pstate->language (),
1363 | LONG UNSIGNED INT_KEYWORD
1364 { $$ = lookup_unsigned_typename (pstate->language (),
1367 { $$ = lookup_unsigned_typename (pstate->language (),
1370 { $$ = lookup_signed_typename (pstate->language (),
1372 | LONG LONG INT_KEYWORD
1373 { $$ = lookup_signed_typename (pstate->language (),
1375 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1376 { $$ = lookup_signed_typename (pstate->language (),
1378 | LONG LONG SIGNED_KEYWORD
1379 { $$ = lookup_signed_typename (pstate->language (),
1381 | SIGNED_KEYWORD LONG LONG
1382 { $$ = lookup_signed_typename (pstate->language (),
1384 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1385 { $$ = lookup_signed_typename (pstate->language (),
1387 | UNSIGNED LONG LONG
1388 { $$ = lookup_unsigned_typename (pstate->language (),
1390 | UNSIGNED LONG LONG INT_KEYWORD
1391 { $$ = lookup_unsigned_typename (pstate->language (),
1393 | LONG LONG UNSIGNED
1394 { $$ = lookup_unsigned_typename (pstate->language (),
1396 | LONG LONG UNSIGNED INT_KEYWORD
1397 { $$ = lookup_unsigned_typename (pstate->language (),
1400 { $$ = lookup_signed_typename (pstate->language (),
1402 | SHORT SIGNED_KEYWORD INT_KEYWORD
1403 { $$ = lookup_signed_typename (pstate->language (),
1405 | SHORT SIGNED_KEYWORD
1406 { $$ = lookup_signed_typename (pstate->language (),
1408 | UNSIGNED SHORT INT_KEYWORD
1409 { $$ = lookup_unsigned_typename (pstate->language (),
1412 { $$ = lookup_unsigned_typename (pstate->language (),
1414 | SHORT UNSIGNED INT_KEYWORD
1415 { $$ = lookup_unsigned_typename (pstate->language (),
1418 { $$ = lookup_typename (pstate->language (),
1423 { $$ = lookup_typename (pstate->language (),
1427 | LONG DOUBLE_KEYWORD
1428 { $$ = lookup_typename (pstate->language (),
1432 | UNSIGNED type_name
1433 { $$ = lookup_unsigned_typename (pstate->language (),
1434 $2.type->name ()); }
1436 { $$ = lookup_unsigned_typename (pstate->language (),
1438 | SIGNED_KEYWORD type_name
1439 { $$ = lookup_signed_typename (pstate->language (),
1440 $2.type->name ()); }
1442 { $$ = lookup_signed_typename (pstate->language (),
1446 /* Implements (approximately): (type-qualifier)* type-specifier.
1448 When type-specifier is only ever a single word, like 'float' then these
1449 arrive as pre-built TYPENAME tokens thanks to the classify_name
1450 function. However, when a type-specifier can contain multiple words,
1451 for example 'double' can appear as just 'double' or 'long double', and
1452 similarly 'long' can appear as just 'long' or in 'long double', then
1453 these type-specifiers are parsed into their own tokens in the function
1454 lex_one_token and the ident_tokens array. These separate tokens are all
1461 | COMPLEX scalar_type
1463 $$ = init_complex_type (nullptr, $2);
1467 = lookup_struct (copy_name ($2).c_str (),
1468 pstate->expression_context_block);
1472 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1476 | STRUCT name COMPLETE
1478 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1483 { $$ = lookup_struct
1484 (copy_name ($2).c_str (),
1485 pstate->expression_context_block);
1489 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1493 | CLASS name COMPLETE
1495 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1501 = lookup_union (copy_name ($2).c_str (),
1502 pstate->expression_context_block);
1506 pstate->mark_completion_tag (TYPE_CODE_UNION,
1510 | UNION name COMPLETE
1512 pstate->mark_completion_tag (TYPE_CODE_UNION,
1517 { $$ = lookup_enum (copy_name ($2).c_str (),
1518 pstate->expression_context_block);
1522 pstate->mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1525 | ENUM name COMPLETE
1527 pstate->mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1531 /* It appears that this rule for templates is never
1532 reduced; template recognition happens by lookahead
1533 in the token processing code in yylex. */
1534 | TEMPLATE name '<' type '>'
1535 { $$ = lookup_template_type
1536 (copy_name($2).c_str (), $4,
1537 pstate->expression_context_block);
1539 | qualifier_seq_noopt typebase
1540 { $$ = cpstate->type_stack.follow_types ($2); }
1541 | typebase qualifier_seq_noopt
1542 { $$ = cpstate->type_stack.follow_types ($1); }
1548 $$.stoken.ptr = "int";
1549 $$.stoken.length = 3;
1550 $$.type = lookup_signed_typename (pstate->language (),
1555 $$.stoken.ptr = "long";
1556 $$.stoken.length = 4;
1557 $$.type = lookup_signed_typename (pstate->language (),
1562 $$.stoken.ptr = "short";
1563 $$.stoken.length = 5;
1564 $$.type = lookup_signed_typename (pstate->language (),
1571 { check_parameter_typelist ($1); }
1572 | nonempty_typelist ',' DOTDOTDOT
1574 $1->push_back (NULL);
1575 check_parameter_typelist ($1);
1583 std::vector<struct type *> *typelist
1584 = new std::vector<struct type *>;
1585 cpstate->type_lists.emplace_back (typelist);
1587 typelist->push_back ($1);
1590 | nonempty_typelist ',' type
1600 cpstate->type_stack.push ($2);
1601 $$ = cpstate->type_stack.follow_types ($1);
1605 conversion_type_id: typebase conversion_declarator
1606 { $$ = cpstate->type_stack.follow_types ($1); }
1609 conversion_declarator: /* Nothing. */
1610 | ptr_operator conversion_declarator
1613 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1614 | VOLATILE_KEYWORD CONST_KEYWORD
1617 const_or_volatile_noopt: const_and_volatile
1618 { cpstate->type_stack.insert (tp_const);
1619 cpstate->type_stack.insert (tp_volatile);
1622 { cpstate->type_stack.insert (tp_const); }
1624 { cpstate->type_stack.insert (tp_volatile); }
1628 { $$ = operator_stoken (" new"); }
1630 { $$ = operator_stoken (" delete"); }
1631 | OPERATOR NEW '[' ']'
1632 { $$ = operator_stoken (" new[]"); }
1633 | OPERATOR DELETE '[' ']'
1634 { $$ = operator_stoken (" delete[]"); }
1635 | OPERATOR NEW OBJC_LBRAC ']'
1636 { $$ = operator_stoken (" new[]"); }
1637 | OPERATOR DELETE OBJC_LBRAC ']'
1638 { $$ = operator_stoken (" delete[]"); }
1640 { $$ = operator_stoken ("+"); }
1642 { $$ = operator_stoken ("-"); }
1644 { $$ = operator_stoken ("*"); }
1646 { $$ = operator_stoken ("/"); }
1648 { $$ = operator_stoken ("%"); }
1650 { $$ = operator_stoken ("^"); }
1652 { $$ = operator_stoken ("&"); }
1654 { $$ = operator_stoken ("|"); }
1656 { $$ = operator_stoken ("~"); }
1658 { $$ = operator_stoken ("!"); }
1660 { $$ = operator_stoken ("="); }
1662 { $$ = operator_stoken ("<"); }
1664 { $$ = operator_stoken (">"); }
1665 | OPERATOR ASSIGN_MODIFY
1666 { const char *op = " unknown";
1690 case BINOP_BITWISE_IOR:
1693 case BINOP_BITWISE_AND:
1696 case BINOP_BITWISE_XOR:
1703 $$ = operator_stoken (op);
1706 { $$ = operator_stoken ("<<"); }
1708 { $$ = operator_stoken (">>"); }
1710 { $$ = operator_stoken ("=="); }
1712 { $$ = operator_stoken ("!="); }
1714 { $$ = operator_stoken ("<="); }
1716 { $$ = operator_stoken (">="); }
1718 { $$ = operator_stoken ("&&"); }
1720 { $$ = operator_stoken ("||"); }
1721 | OPERATOR INCREMENT
1722 { $$ = operator_stoken ("++"); }
1723 | OPERATOR DECREMENT
1724 { $$ = operator_stoken ("--"); }
1726 { $$ = operator_stoken (","); }
1727 | OPERATOR ARROW_STAR
1728 { $$ = operator_stoken ("->*"); }
1730 { $$ = operator_stoken ("->"); }
1732 { $$ = operator_stoken ("()"); }
1734 { $$ = operator_stoken ("[]"); }
1735 | OPERATOR OBJC_LBRAC ']'
1736 { $$ = operator_stoken ("[]"); }
1737 | OPERATOR conversion_type_id
1740 c_print_type ($2, NULL, &buf, -1, 0,
1741 &type_print_raw_options);
1742 std::string name = std::move (buf.string ());
1744 /* This also needs canonicalization. */
1745 gdb::unique_xmalloc_ptr<char> canon
1746 = cp_canonicalize_string (name.c_str ());
1747 if (canon != nullptr)
1748 name = canon.get ();
1749 $$ = operator_stoken ((" " + name).c_str ());
1753 /* This rule exists in order to allow some tokens that would not normally
1754 match the 'name' rule to appear as fields within a struct. The example
1755 that initially motivated this was the RISC-V target which models the
1756 floating point registers as a union with fields called 'float' and
1760 | DOUBLE_KEYWORD { $$ = typename_stoken ("double"); }
1761 | FLOAT_KEYWORD { $$ = typename_stoken ("float"); }
1762 | INT_KEYWORD { $$ = typename_stoken ("int"); }
1763 | LONG { $$ = typename_stoken ("long"); }
1764 | SHORT { $$ = typename_stoken ("short"); }
1765 | SIGNED_KEYWORD { $$ = typename_stoken ("signed"); }
1766 | UNSIGNED { $$ = typename_stoken ("unsigned"); }
1769 name : NAME { $$ = $1.stoken; }
1770 | BLOCKNAME { $$ = $1.stoken; }
1771 | TYPENAME { $$ = $1.stoken; }
1772 | NAME_OR_INT { $$ = $1.stoken; }
1773 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1777 name_not_typename : NAME
1779 /* These would be useful if name_not_typename was useful, but it is just
1780 a fake for "variable", so these cause reduce/reduce conflicts because
1781 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1782 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1783 context where only a name could occur, this might be useful.
1788 struct field_of_this_result is_a_field_of_this;
1792 = lookup_symbol ($1.ptr,
1793 pstate->expression_context_block,
1795 &is_a_field_of_this);
1796 $$.is_a_field_of_this
1797 = is_a_field_of_this.type != NULL;
1804 /* Like write_exp_string, but prepends a '~'. */
1807 write_destructor_name (struct parser_state *par_state, struct stoken token)
1809 char *copy = (char *) alloca (token.length + 1);
1812 memcpy (©[1], token.ptr, token.length);
1817 write_exp_string (par_state, token);
1820 /* Returns a stoken of the operator name given by OP (which does not
1821 include the string "operator"). */
1823 static struct stoken
1824 operator_stoken (const char *op)
1826 struct stoken st = { NULL, 0 };
1829 st.length = CP_OPERATOR_LEN + strlen (op);
1830 buf = (char *) malloc (st.length + 1);
1831 strcpy (buf, CP_OPERATOR_STR);
1835 /* The toplevel (c_parse) will free the memory allocated here. */
1836 cpstate->strings.emplace_back (buf);
1840 /* Returns a stoken of the type named TYPE. */
1842 static struct stoken
1843 typename_stoken (const char *type)
1845 struct stoken st = { type, 0 };
1846 st.length = strlen (type);
1850 /* Return true if the type is aggregate-like. */
1853 type_aggregate_p (struct type *type)
1855 return (type->code () == TYPE_CODE_STRUCT
1856 || type->code () == TYPE_CODE_UNION
1857 || type->code () == TYPE_CODE_NAMESPACE
1858 || (type->code () == TYPE_CODE_ENUM
1859 && TYPE_DECLARED_CLASS (type)));
1862 /* Validate a parameter typelist. */
1865 check_parameter_typelist (std::vector<struct type *> *params)
1870 for (ix = 0; ix < params->size (); ++ix)
1872 type = (*params)[ix];
1873 if (type != NULL && check_typedef (type)->code () == TYPE_CODE_VOID)
1877 if (params->size () == 1)
1882 error (_("parameter types following 'void'"));
1885 error (_("'void' invalid as parameter type"));
1890 /* Take care of parsing a number (anything that starts with a digit).
1891 Set yylval and return the token type; update lexptr.
1892 LEN is the number of characters in it. */
1894 /*** Needs some error checking for the float case ***/
1897 parse_number (struct parser_state *par_state,
1898 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1906 int base = input_radix;
1909 /* Number of "L" suffixes encountered. */
1912 /* Imaginary number. */
1913 bool imaginary_p = false;
1915 /* We have found a "L" or "U" (or "i") suffix. */
1916 int found_suffix = 0;
1919 struct type *signed_type;
1920 struct type *unsigned_type;
1923 p = (char *) alloca (len);
1924 memcpy (p, buf, len);
1928 if (len >= 1 && p[len - 1] == 'i')
1934 /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */
1935 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1937 putithere->typed_val_float.type
1938 = parse_type (par_state)->builtin_decfloat;
1941 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1943 putithere->typed_val_float.type
1944 = parse_type (par_state)->builtin_decdouble;
1947 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1949 putithere->typed_val_float.type
1950 = parse_type (par_state)->builtin_declong;
1953 /* Handle suffixes: 'f' for float, 'l' for long double. */
1954 else if (len >= 1 && TOLOWER (p[len - 1]) == 'f')
1956 putithere->typed_val_float.type
1957 = parse_type (par_state)->builtin_float;
1960 else if (len >= 1 && TOLOWER (p[len - 1]) == 'l')
1962 putithere->typed_val_float.type
1963 = parse_type (par_state)->builtin_long_double;
1966 /* Default type for floating-point literals is double. */
1969 putithere->typed_val_float.type
1970 = parse_type (par_state)->builtin_double;
1973 if (!parse_float (p, len,
1974 putithere->typed_val_float.type,
1975 putithere->typed_val_float.val))
1979 putithere->typed_val_float.type
1980 = init_complex_type (nullptr, putithere->typed_val_float.type);
1982 return imaginary_p ? COMPLEX_FLOAT : FLOAT;
1985 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1986 if (p[0] == '0' && len > 1)
2029 if (c >= 'A' && c <= 'Z')
2031 if (c != 'l' && c != 'u' && c != 'i')
2033 if (c >= '0' && c <= '9')
2041 if (base > 10 && c >= 'a' && c <= 'f')
2045 n += i = c - 'a' + 10;
2063 return ERROR; /* Char not a digit */
2066 return ERROR; /* Invalid digit in this base */
2068 /* Portably test for overflow (only works for nonzero values, so make
2069 a second check for zero). FIXME: Can't we just make n and prevn
2070 unsigned and avoid this? */
2071 if (c != 'l' && c != 'u' && c != 'i' && (prevn >= n) && n != 0)
2072 unsigned_p = 1; /* Try something unsigned */
2074 /* Portably test for unsigned overflow.
2075 FIXME: This check is wrong; for example it doesn't find overflow
2076 on 0x123456789 when LONGEST is 32 bits. */
2077 if (c != 'l' && c != 'u' && c != 'i' && n != 0)
2079 if (unsigned_p && prevn >= n)
2080 error (_("Numeric constant too large."));
2085 /* An integer constant is an int, a long, or a long long. An L
2086 suffix forces it to be long; an LL suffix forces it to be long
2087 long. If not forced to a larger size, it gets the first type of
2088 the above that it fits in. To figure out whether it fits, we
2089 shift it right and see whether anything remains. Note that we
2090 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
2091 operation, because many compilers will warn about such a shift
2092 (which always produces a zero result). Sometimes gdbarch_int_bit
2093 or gdbarch_long_bit will be that big, sometimes not. To deal with
2094 the case where it is we just always shift the value more than
2095 once, with fewer bits each time. */
2099 && (un >> (gdbarch_int_bit (par_state->gdbarch ()) - 2)) == 0)
2102 = ((ULONGEST)1) << (gdbarch_int_bit (par_state->gdbarch ()) - 1);
2104 /* A large decimal (not hex or octal) constant (between INT_MAX
2105 and UINT_MAX) is a long or unsigned long, according to ANSI,
2106 never an unsigned int, but this code treats it as unsigned
2107 int. This probably should be fixed. GCC gives a warning on
2110 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
2111 signed_type = parse_type (par_state)->builtin_int;
2113 else if (long_p <= 1
2114 && (un >> (gdbarch_long_bit (par_state->gdbarch ()) - 2)) == 0)
2117 = ((ULONGEST)1) << (gdbarch_long_bit (par_state->gdbarch ()) - 1);
2118 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
2119 signed_type = parse_type (par_state)->builtin_long;
2124 if (sizeof (ULONGEST) * HOST_CHAR_BIT
2125 < gdbarch_long_long_bit (par_state->gdbarch ()))
2126 /* A long long does not fit in a LONGEST. */
2127 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
2129 shift = (gdbarch_long_long_bit (par_state->gdbarch ()) - 1);
2130 high_bit = (ULONGEST) 1 << shift;
2131 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
2132 signed_type = parse_type (par_state)->builtin_long_long;
2135 putithere->typed_val_int.val = n;
2137 /* If the high bit of the worked out type is set then this number
2138 has to be unsigned. */
2140 if (unsigned_p || (n & high_bit))
2142 putithere->typed_val_int.type = unsigned_type;
2146 putithere->typed_val_int.type = signed_type;
2150 putithere->typed_val_int.type
2151 = init_complex_type (nullptr, putithere->typed_val_int.type);
2153 return imaginary_p ? COMPLEX_INT : INT;
2156 /* Temporary obstack used for holding strings. */
2157 static struct obstack tempbuf;
2158 static int tempbuf_init;
2160 /* Parse a C escape sequence. The initial backslash of the sequence
2161 is at (*PTR)[-1]. *PTR will be updated to point to just after the
2162 last character of the sequence. If OUTPUT is not NULL, the
2163 translated form of the escape sequence will be written there. If
2164 OUTPUT is NULL, no output is written and the call will only affect
2165 *PTR. If an escape sequence is expressed in target bytes, then the
2166 entire sequence will simply be copied to OUTPUT. Return 1 if any
2167 character was emitted, 0 otherwise. */
2170 c_parse_escape (const char **ptr, struct obstack *output)
2172 const char *tokptr = *ptr;
2175 /* Some escape sequences undergo character set conversion. Those we
2179 /* Hex escapes do not undergo character set conversion, so keep
2180 the escape sequence for later. */
2183 obstack_grow_str (output, "\\x");
2185 if (!ISXDIGIT (*tokptr))
2186 error (_("\\x escape without a following hex digit"));
2187 while (ISXDIGIT (*tokptr))
2190 obstack_1grow (output, *tokptr);
2195 /* Octal escapes do not undergo character set conversion, so
2196 keep the escape sequence for later. */
2208 obstack_grow_str (output, "\\");
2210 i < 3 && ISDIGIT (*tokptr) && *tokptr != '8' && *tokptr != '9';
2214 obstack_1grow (output, *tokptr);
2220 /* We handle UCNs later. We could handle them here, but that
2221 would mean a spurious error in the case where the UCN could
2222 be converted to the target charset but not the host
2228 int i, len = c == 'U' ? 8 : 4;
2231 obstack_1grow (output, '\\');
2232 obstack_1grow (output, *tokptr);
2235 if (!ISXDIGIT (*tokptr))
2236 error (_("\\%c escape without a following hex digit"), c);
2237 for (i = 0; i < len && ISXDIGIT (*tokptr); ++i)
2240 obstack_1grow (output, *tokptr);
2246 /* We must pass backslash through so that it does not
2247 cause quoting during the second expansion. */
2250 obstack_grow_str (output, "\\\\");
2254 /* Escapes which undergo conversion. */
2257 obstack_1grow (output, '\a');
2262 obstack_1grow (output, '\b');
2267 obstack_1grow (output, '\f');
2272 obstack_1grow (output, '\n');
2277 obstack_1grow (output, '\r');
2282 obstack_1grow (output, '\t');
2287 obstack_1grow (output, '\v');
2291 /* GCC extension. */
2294 obstack_1grow (output, HOST_ESCAPE_CHAR);
2298 /* Backslash-newline expands to nothing at all. */
2304 /* A few escapes just expand to the character itself. */
2308 /* GCC extensions. */
2313 /* Unrecognized escapes turn into the character itself. */
2316 obstack_1grow (output, *tokptr);
2324 /* Parse a string or character literal from TOKPTR. The string or
2325 character may be wide or unicode. *OUTPTR is set to just after the
2326 end of the literal in the input string. The resulting token is
2327 stored in VALUE. This returns a token value, either STRING or
2328 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2329 number of host characters in the literal. */
2332 parse_string_or_char (const char *tokptr, const char **outptr,
2333 struct typed_stoken *value, int *host_chars)
2339 /* Build the gdb internal form of the input string in tempbuf. Note
2340 that the buffer is null byte terminated *only* for the
2341 convenience of debugging gdb itself and printing the buffer
2342 contents when the buffer contains no embedded nulls. Gdb does
2343 not depend upon the buffer being null byte terminated, it uses
2344 the length string instead. This allows gdb to handle C strings
2345 (as well as strings in other languages) with embedded null
2351 obstack_free (&tempbuf, NULL);
2352 obstack_init (&tempbuf);
2354 /* Record the string type. */
2357 type = C_WIDE_STRING;
2360 else if (*tokptr == 'u')
2365 else if (*tokptr == 'U')
2370 else if (*tokptr == '@')
2372 /* An Objective C string. */
2380 /* Skip the quote. */
2394 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2396 else if (c == quote)
2400 obstack_1grow (&tempbuf, c);
2402 /* FIXME: this does the wrong thing with multi-byte host
2403 characters. We could use mbrlen here, but that would
2404 make "set host-charset" a bit less useful. */
2409 if (*tokptr != quote)
2412 error (_("Unterminated string in expression."));
2414 error (_("Unmatched single quote."));
2419 value->ptr = (char *) obstack_base (&tempbuf);
2420 value->length = obstack_object_size (&tempbuf);
2424 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2427 /* This is used to associate some attributes with a token. */
2431 /* If this bit is set, the token is C++-only. */
2435 /* If this bit is set, the token is C-only. */
2439 /* If this bit is set, the token is conditional: if there is a
2440 symbol of the same name, then the token is a symbol; otherwise,
2441 the token is a keyword. */
2445 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2451 enum exp_opcode opcode;
2455 static const struct token tokentab3[] =
2457 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2458 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2459 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2460 {"...", DOTDOTDOT, BINOP_END, 0}
2463 static const struct token tokentab2[] =
2465 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2466 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2467 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2468 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2469 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2470 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2471 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2472 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2473 {"++", INCREMENT, BINOP_END, 0},
2474 {"--", DECREMENT, BINOP_END, 0},
2475 {"->", ARROW, BINOP_END, 0},
2476 {"&&", ANDAND, BINOP_END, 0},
2477 {"||", OROR, BINOP_END, 0},
2478 /* "::" is *not* only C++: gdb overrides its meaning in several
2479 different ways, e.g., 'filename'::func, function::variable. */
2480 {"::", COLONCOLON, BINOP_END, 0},
2481 {"<<", LSH, BINOP_END, 0},
2482 {">>", RSH, BINOP_END, 0},
2483 {"==", EQUAL, BINOP_END, 0},
2484 {"!=", NOTEQUAL, BINOP_END, 0},
2485 {"<=", LEQ, BINOP_END, 0},
2486 {">=", GEQ, BINOP_END, 0},
2487 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2490 /* Identifier-like tokens. Only type-specifiers than can appear in
2491 multi-word type names (for example 'double' can appear in 'long
2492 double') need to be listed here. type-specifiers that are only ever
2493 single word (like 'char') are handled by the classify_name function. */
2494 static const struct token ident_tokens[] =
2496 {"unsigned", UNSIGNED, OP_NULL, 0},
2497 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2498 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2499 {"struct", STRUCT, OP_NULL, 0},
2500 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2501 {"sizeof", SIZEOF, OP_NULL, 0},
2502 {"_Alignof", ALIGNOF, OP_NULL, 0},
2503 {"alignof", ALIGNOF, OP_NULL, FLAG_CXX},
2504 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2505 {"float", FLOAT_KEYWORD, OP_NULL, 0},
2506 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2507 {"class", CLASS, OP_NULL, FLAG_CXX},
2508 {"union", UNION, OP_NULL, 0},
2509 {"short", SHORT, OP_NULL, 0},
2510 {"const", CONST_KEYWORD, OP_NULL, 0},
2511 {"restrict", RESTRICT, OP_NULL, FLAG_C | FLAG_SHADOW},
2512 {"__restrict__", RESTRICT, OP_NULL, 0},
2513 {"__restrict", RESTRICT, OP_NULL, 0},
2514 {"_Atomic", ATOMIC, OP_NULL, 0},
2515 {"enum", ENUM, OP_NULL, 0},
2516 {"long", LONG, OP_NULL, 0},
2517 {"_Complex", COMPLEX, OP_NULL, 0},
2518 {"__complex__", COMPLEX, OP_NULL, 0},
2520 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2521 {"int", INT_KEYWORD, OP_NULL, 0},
2522 {"new", NEW, OP_NULL, FLAG_CXX},
2523 {"delete", DELETE, OP_NULL, FLAG_CXX},
2524 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2526 {"and", ANDAND, BINOP_END, FLAG_CXX},
2527 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2528 {"bitand", '&', OP_NULL, FLAG_CXX},
2529 {"bitor", '|', OP_NULL, FLAG_CXX},
2530 {"compl", '~', OP_NULL, FLAG_CXX},
2531 {"not", '!', OP_NULL, FLAG_CXX},
2532 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2533 {"or", OROR, BINOP_END, FLAG_CXX},
2534 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2535 {"xor", '^', OP_NULL, FLAG_CXX},
2536 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2538 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2539 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2540 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2541 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2543 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2544 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2545 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2546 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2547 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2549 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2554 scan_macro_expansion (const char *expansion)
2556 /* We'd better not be trying to push the stack twice. */
2557 gdb_assert (! cpstate->macro_original_text);
2559 /* Copy to the obstack. */
2560 const char *copy = obstack_strdup (&cpstate->expansion_obstack, expansion);
2562 /* Save the old lexptr value, so we can return to it when we're done
2563 parsing the expanded text. */
2564 cpstate->macro_original_text = pstate->lexptr;
2565 pstate->lexptr = copy;
2569 scanning_macro_expansion (void)
2571 return cpstate->macro_original_text != 0;
2575 finished_macro_expansion (void)
2577 /* There'd better be something to pop back to. */
2578 gdb_assert (cpstate->macro_original_text);
2580 /* Pop back to the original text. */
2581 pstate->lexptr = cpstate->macro_original_text;
2582 cpstate->macro_original_text = 0;
2585 /* Return true iff the token represents a C++ cast operator. */
2588 is_cast_operator (const char *token, int len)
2590 return (! strncmp (token, "dynamic_cast", len)
2591 || ! strncmp (token, "static_cast", len)
2592 || ! strncmp (token, "reinterpret_cast", len)
2593 || ! strncmp (token, "const_cast", len));
2596 /* The scope used for macro expansion. */
2597 static struct macro_scope *expression_macro_scope;
2599 /* This is set if a NAME token appeared at the very end of the input
2600 string, with no whitespace separating the name from the EOF. This
2601 is used only when parsing to do field name completion. */
2602 static int saw_name_at_eof;
2604 /* This is set if the previously-returned token was a structure
2605 operator -- either '.' or ARROW. */
2606 static bool last_was_structop;
2608 /* Depth of parentheses. */
2609 static int paren_depth;
2611 /* Read one token, getting characters through lexptr. */
2614 lex_one_token (struct parser_state *par_state, bool *is_quoted_name)
2619 const char *tokstart;
2620 bool saw_structop = last_was_structop;
2622 last_was_structop = false;
2623 *is_quoted_name = false;
2627 /* Check if this is a macro invocation that we need to expand. */
2628 if (! scanning_macro_expansion ())
2630 gdb::unique_xmalloc_ptr<char> expanded
2631 = macro_expand_next (&pstate->lexptr, *expression_macro_scope);
2633 if (expanded != nullptr)
2634 scan_macro_expansion (expanded.get ());
2637 pstate->prev_lexptr = pstate->lexptr;
2639 tokstart = pstate->lexptr;
2640 /* See if it is a special token of length 3. */
2641 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2642 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2644 if ((tokentab3[i].flags & FLAG_CXX) != 0
2645 && par_state->language ()->la_language != language_cplus)
2647 gdb_assert ((tokentab3[i].flags & FLAG_C) == 0);
2649 pstate->lexptr += 3;
2650 yylval.opcode = tokentab3[i].opcode;
2651 return tokentab3[i].token;
2654 /* See if it is a special token of length 2. */
2655 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2656 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2658 if ((tokentab2[i].flags & FLAG_CXX) != 0
2659 && par_state->language ()->la_language != language_cplus)
2661 gdb_assert ((tokentab2[i].flags & FLAG_C) == 0);
2663 pstate->lexptr += 2;
2664 yylval.opcode = tokentab2[i].opcode;
2665 if (tokentab2[i].token == ARROW)
2666 last_was_structop = 1;
2667 return tokentab2[i].token;
2670 switch (c = *tokstart)
2673 /* If we were just scanning the result of a macro expansion,
2674 then we need to resume scanning the original text.
2675 If we're parsing for field name completion, and the previous
2676 token allows such completion, return a COMPLETE token.
2677 Otherwise, we were already scanning the original text, and
2678 we're really done. */
2679 if (scanning_macro_expansion ())
2681 finished_macro_expansion ();
2684 else if (saw_name_at_eof)
2686 saw_name_at_eof = 0;
2689 else if (par_state->parse_completion && saw_structop)
2704 if (par_state->language ()->la_language == language_objc
2711 if (paren_depth == 0)
2718 if (pstate->comma_terminates
2720 && ! scanning_macro_expansion ())
2726 /* Might be a floating point number. */
2727 if (pstate->lexptr[1] < '0' || pstate->lexptr[1] > '9')
2729 last_was_structop = true;
2730 goto symbol; /* Nope, must be a symbol. */
2745 /* It's a number. */
2746 int got_dot = 0, got_e = 0, got_p = 0, toktype;
2747 const char *p = tokstart;
2748 int hex = input_radix > 10;
2750 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2755 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2763 /* This test includes !hex because 'e' is a valid hex digit
2764 and thus does not indicate a floating point number when
2765 the radix is hex. */
2766 if (!hex && !got_e && !got_p && (*p == 'e' || *p == 'E'))
2767 got_dot = got_e = 1;
2768 else if (!got_e && !got_p && (*p == 'p' || *p == 'P'))
2769 got_dot = got_p = 1;
2770 /* This test does not include !hex, because a '.' always indicates
2771 a decimal floating point number regardless of the radix. */
2772 else if (!got_dot && *p == '.')
2774 else if (((got_e && (p[-1] == 'e' || p[-1] == 'E'))
2775 || (got_p && (p[-1] == 'p' || p[-1] == 'P')))
2776 && (*p == '-' || *p == '+'))
2777 /* This is the sign of the exponent, not the end of the
2780 /* We will take any letters or digits. parse_number will
2781 complain if past the radix, or if L or U are not final. */
2782 else if ((*p < '0' || *p > '9')
2783 && ((*p < 'a' || *p > 'z')
2784 && (*p < 'A' || *p > 'Z')))
2787 toktype = parse_number (par_state, tokstart, p - tokstart,
2788 got_dot | got_e | got_p, &yylval);
2789 if (toktype == ERROR)
2791 char *err_copy = (char *) alloca (p - tokstart + 1);
2793 memcpy (err_copy, tokstart, p - tokstart);
2794 err_copy[p - tokstart] = 0;
2795 error (_("Invalid number \"%s\"."), err_copy);
2803 const char *p = &tokstart[1];
2805 if (par_state->language ()->la_language == language_objc)
2807 size_t len = strlen ("selector");
2809 if (strncmp (p, "selector", len) == 0
2810 && (p[len] == '\0' || ISSPACE (p[len])))
2812 pstate->lexptr = p + len;
2819 while (ISSPACE (*p))
2821 size_t len = strlen ("entry");
2822 if (strncmp (p, "entry", len) == 0 && !c_ident_is_alnum (p[len])
2825 pstate->lexptr = &p[len];
2854 if (tokstart[1] != '"' && tokstart[1] != '\'')
2863 int result = parse_string_or_char (tokstart, &pstate->lexptr,
2864 &yylval.tsval, &host_len);
2868 error (_("Empty character constant."));
2869 else if (host_len > 2 && c == '\'')
2872 namelen = pstate->lexptr - tokstart - 1;
2873 *is_quoted_name = true;
2877 else if (host_len > 1)
2878 error (_("Invalid character constant."));
2884 if (!(c == '_' || c == '$' || c_ident_is_alpha (c)))
2885 /* We must have come across a bad character (e.g. ';'). */
2886 error (_("Invalid character '%c' in expression."), c);
2888 /* It's a name. See how long it is. */
2890 for (c = tokstart[namelen];
2891 (c == '_' || c == '$' || c_ident_is_alnum (c) || c == '<');)
2893 /* Template parameter lists are part of the name.
2894 FIXME: This mishandles `print $a<4&&$a>3'. */
2898 if (! is_cast_operator (tokstart, namelen))
2900 /* Scan ahead to get rest of the template specification. Note
2901 that we look ahead only when the '<' adjoins non-whitespace
2902 characters; for comparison expressions, e.g. "a < b > c",
2903 there must be spaces before the '<', etc. */
2904 const char *p = find_template_name_end (tokstart + namelen);
2907 namelen = p - tokstart;
2911 c = tokstart[++namelen];
2914 /* The token "if" terminates the expression and is NOT removed from
2915 the input stream. It doesn't count if it appears in the
2916 expansion of a macro. */
2918 && tokstart[0] == 'i'
2919 && tokstart[1] == 'f'
2920 && ! scanning_macro_expansion ())
2925 /* For the same reason (breakpoint conditions), "thread N"
2926 terminates the expression. "thread" could be an identifier, but
2927 an identifier is never followed by a number without intervening
2928 punctuation. "task" is similar. Handle abbreviations of these,
2929 similarly to breakpoint.c:find_condition_and_thread. */
2931 && (strncmp (tokstart, "thread", namelen) == 0
2932 || strncmp (tokstart, "task", namelen) == 0)
2933 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2934 && ! scanning_macro_expansion ())
2936 const char *p = tokstart + namelen + 1;
2938 while (*p == ' ' || *p == '\t')
2940 if (*p >= '0' && *p <= '9')
2944 pstate->lexptr += namelen;
2948 yylval.sval.ptr = tokstart;
2949 yylval.sval.length = namelen;
2951 /* Catch specific keywords. */
2952 std::string copy = copy_name (yylval.sval);
2953 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2954 if (copy == ident_tokens[i].oper)
2956 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2957 && par_state->language ()->la_language != language_cplus)
2959 if ((ident_tokens[i].flags & FLAG_C) != 0
2960 && par_state->language ()->la_language != language_c
2961 && par_state->language ()->la_language != language_objc)
2964 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2966 struct field_of_this_result is_a_field_of_this;
2968 if (lookup_symbol (copy.c_str (),
2969 pstate->expression_context_block,
2971 (par_state->language ()->la_language
2972 == language_cplus ? &is_a_field_of_this
2976 /* The keyword is shadowed. */
2981 /* It is ok to always set this, even though we don't always
2982 strictly need to. */
2983 yylval.opcode = ident_tokens[i].opcode;
2984 return ident_tokens[i].token;
2987 if (*tokstart == '$')
2988 return DOLLAR_VARIABLE;
2990 if (pstate->parse_completion && *pstate->lexptr == '\0')
2991 saw_name_at_eof = 1;
2993 yylval.ssym.stoken = yylval.sval;
2994 yylval.ssym.sym.symbol = NULL;
2995 yylval.ssym.sym.block = NULL;
2996 yylval.ssym.is_a_field_of_this = 0;
3000 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
3001 struct token_and_value
3007 /* A FIFO of tokens that have been read but not yet returned to the
3009 static std::vector<token_and_value> token_fifo;
3011 /* Non-zero if the lexer should return tokens from the FIFO. */
3014 /* Temporary storage for c_lex; this holds symbol names as they are
3016 auto_obstack name_obstack;
3018 /* Classify a NAME token. The contents of the token are in `yylval'.
3019 Updates yylval and returns the new token type. BLOCK is the block
3020 in which lookups start; this can be NULL to mean the global scope.
3021 IS_QUOTED_NAME is non-zero if the name token was originally quoted
3022 in single quotes. IS_AFTER_STRUCTOP is true if this name follows
3023 a structure operator -- either '.' or ARROW */
3026 classify_name (struct parser_state *par_state, const struct block *block,
3027 bool is_quoted_name, bool is_after_structop)
3029 struct block_symbol bsym;
3030 struct field_of_this_result is_a_field_of_this;
3032 std::string copy = copy_name (yylval.sval);
3034 /* Initialize this in case we *don't* use it in this call; that way
3035 we can refer to it unconditionally below. */
3036 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
3038 bsym = lookup_symbol (copy.c_str (), block, VAR_DOMAIN,
3039 par_state->language ()->name_of_this ()
3040 ? &is_a_field_of_this : NULL);
3042 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
3044 yylval.ssym.sym = bsym;
3045 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
3048 else if (!bsym.symbol)
3050 /* If we found a field of 'this', we might have erroneously
3051 found a constructor where we wanted a type name. Handle this
3052 case by noticing that we found a constructor and then look up
3053 the type tag instead. */
3054 if (is_a_field_of_this.type != NULL
3055 && is_a_field_of_this.fn_field != NULL
3056 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
3059 struct field_of_this_result inner_is_a_field_of_this;
3061 bsym = lookup_symbol (copy.c_str (), block, STRUCT_DOMAIN,
3062 &inner_is_a_field_of_this);
3063 if (bsym.symbol != NULL)
3065 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
3070 /* If we found a field on the "this" object, or we are looking
3071 up a field on a struct, then we want to prefer it over a
3072 filename. However, if the name was quoted, then it is better
3073 to check for a filename or a block, since this is the only
3074 way the user has of requiring the extension to be used. */
3075 if ((is_a_field_of_this.type == NULL && !is_after_structop)
3078 /* See if it's a file name. */
3079 struct symtab *symtab;
3081 symtab = lookup_symtab (copy.c_str ());
3084 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
3091 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
3093 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
3097 /* See if it's an ObjC classname. */
3098 if (par_state->language ()->la_language == language_objc && !bsym.symbol)
3100 CORE_ADDR Class = lookup_objc_class (par_state->gdbarch (),
3106 yylval.theclass.theclass = Class;
3107 sym = lookup_struct_typedef (copy.c_str (),
3108 par_state->expression_context_block, 1);
3110 yylval.theclass.type = SYMBOL_TYPE (sym);
3115 /* Input names that aren't symbols but ARE valid hex numbers, when
3116 the input radix permits them, can be names or numbers depending
3117 on the parse. Note we support radixes > 16 here. */
3119 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
3120 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
3122 YYSTYPE newlval; /* Its value is ignored. */
3123 int hextype = parse_number (par_state, copy.c_str (), yylval.sval.length,
3128 yylval.ssym.sym = bsym;
3129 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
3134 /* Any other kind of symbol */
3135 yylval.ssym.sym = bsym;
3136 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
3138 if (bsym.symbol == NULL
3139 && par_state->language ()->la_language == language_cplus
3140 && is_a_field_of_this.type == NULL
3141 && lookup_minimal_symbol (copy.c_str (), NULL, NULL).minsym == NULL)
3142 return UNKNOWN_CPP_NAME;
3147 /* Like classify_name, but used by the inner loop of the lexer, when a
3148 name might have already been seen. CONTEXT is the context type, or
3149 NULL if this is the first component of a name. */
3152 classify_inner_name (struct parser_state *par_state,
3153 const struct block *block, struct type *context)
3157 if (context == NULL)
3158 return classify_name (par_state, block, false, false);
3160 type = check_typedef (context);
3161 if (!type_aggregate_p (type))
3164 std::string copy = copy_name (yylval.ssym.stoken);
3165 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3166 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy.c_str (), block,
3169 /* If no symbol was found, search for a matching base class named
3170 COPY. This will allow users to enter qualified names of class members
3171 relative to the `this' pointer. */
3172 if (yylval.ssym.sym.symbol == NULL)
3174 struct type *base_type = cp_find_type_baseclass_by_name (type,
3177 if (base_type != NULL)
3179 yylval.tsym.type = base_type;
3186 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
3190 /* cp_lookup_nested_symbol might have accidentally found a constructor
3191 named COPY when we really wanted a base class of the same name.
3192 Double-check this case by looking for a base class. */
3194 struct type *base_type
3195 = cp_find_type_baseclass_by_name (type, copy.c_str ());
3197 if (base_type != NULL)
3199 yylval.tsym.type = base_type;
3206 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3212 internal_error (__FILE__, __LINE__, _("not reached"));
3215 /* The outer level of a two-level lexer. This calls the inner lexer
3216 to return tokens. It then either returns these tokens, or
3217 aggregates them into a larger token. This lets us work around a
3218 problem in our parsing approach, where the parser could not
3219 distinguish between qualified names and qualified types at the
3222 This approach is still not ideal, because it mishandles template
3223 types. See the comment in lex_one_token for an example. However,
3224 this is still an improvement over the earlier approach, and will
3225 suffice until we move to better parsing technology. */
3230 token_and_value current;
3231 int first_was_coloncolon, last_was_coloncolon;
3232 struct type *context_type = NULL;
3233 int last_to_examine, next_to_examine, checkpoint;
3234 const struct block *search_block;
3235 bool is_quoted_name, last_lex_was_structop;
3237 if (popping && !token_fifo.empty ())
3241 last_lex_was_structop = last_was_structop;
3243 /* Read the first token and decide what to do. Most of the
3244 subsequent code is C++-only; but also depends on seeing a "::" or
3246 current.token = lex_one_token (pstate, &is_quoted_name);
3247 if (current.token == NAME)
3248 current.token = classify_name (pstate, pstate->expression_context_block,
3249 is_quoted_name, last_lex_was_structop);
3250 if (pstate->language ()->la_language != language_cplus
3251 || (current.token != TYPENAME && current.token != COLONCOLON
3252 && current.token != FILENAME))
3253 return current.token;
3255 /* Read any sequence of alternating "::" and name-like tokens into
3257 current.value = yylval;
3258 token_fifo.push_back (current);
3259 last_was_coloncolon = current.token == COLONCOLON;
3264 /* We ignore quoted names other than the very first one.
3265 Subsequent ones do not have any special meaning. */
3266 current.token = lex_one_token (pstate, &ignore);
3267 current.value = yylval;
3268 token_fifo.push_back (current);
3270 if ((last_was_coloncolon && current.token != NAME)
3271 || (!last_was_coloncolon && current.token != COLONCOLON))
3273 last_was_coloncolon = !last_was_coloncolon;
3277 /* We always read one extra token, so compute the number of tokens
3278 to examine accordingly. */
3279 last_to_examine = token_fifo.size () - 2;
3280 next_to_examine = 0;
3282 current = token_fifo[next_to_examine];
3285 name_obstack.clear ();
3287 if (current.token == FILENAME)
3288 search_block = current.value.bval;
3289 else if (current.token == COLONCOLON)
3290 search_block = NULL;
3293 gdb_assert (current.token == TYPENAME);
3294 search_block = pstate->expression_context_block;
3295 obstack_grow (&name_obstack, current.value.sval.ptr,
3296 current.value.sval.length);
3297 context_type = current.value.tsym.type;
3301 first_was_coloncolon = current.token == COLONCOLON;
3302 last_was_coloncolon = first_was_coloncolon;
3304 while (next_to_examine <= last_to_examine)
3306 token_and_value next;
3308 next = token_fifo[next_to_examine];
3311 if (next.token == NAME && last_was_coloncolon)
3315 yylval = next.value;
3316 classification = classify_inner_name (pstate, search_block,
3318 /* We keep going until we either run out of names, or until
3319 we have a qualified name which is not a type. */
3320 if (classification != TYPENAME && classification != NAME)
3323 /* Accept up to this token. */
3324 checkpoint = next_to_examine;
3326 /* Update the partial name we are constructing. */
3327 if (context_type != NULL)
3329 /* We don't want to put a leading "::" into the name. */
3330 obstack_grow_str (&name_obstack, "::");
3332 obstack_grow (&name_obstack, next.value.sval.ptr,
3333 next.value.sval.length);
3335 yylval.sval.ptr = (const char *) obstack_base (&name_obstack);
3336 yylval.sval.length = obstack_object_size (&name_obstack);
3337 current.value = yylval;
3338 current.token = classification;
3340 last_was_coloncolon = 0;
3342 if (classification == NAME)
3345 context_type = yylval.tsym.type;
3347 else if (next.token == COLONCOLON && !last_was_coloncolon)
3348 last_was_coloncolon = 1;
3351 /* We've reached the end of the name. */
3356 /* If we have a replacement token, install it as the first token in
3357 the FIFO, and delete the other constituent tokens. */
3360 current.value.sval.ptr
3361 = obstack_strndup (&cpstate->expansion_obstack,
3362 current.value.sval.ptr,
3363 current.value.sval.length);
3365 token_fifo[0] = current;
3367 token_fifo.erase (token_fifo.begin () + 1,
3368 token_fifo.begin () + checkpoint);
3372 current = token_fifo[0];
3373 token_fifo.erase (token_fifo.begin ());
3374 yylval = current.value;
3375 return current.token;
3379 c_parse (struct parser_state *par_state)
3381 /* Setting up the parser state. */
3382 scoped_restore pstate_restore = make_scoped_restore (&pstate);
3383 gdb_assert (par_state != NULL);
3386 c_parse_state cstate;
3387 scoped_restore cstate_restore = make_scoped_restore (&cpstate, &cstate);
3389 gdb::unique_xmalloc_ptr<struct macro_scope> macro_scope;
3391 if (par_state->expression_context_block)
3393 = sal_macro_scope (find_pc_line (par_state->expression_context_pc, 0));
3395 macro_scope = default_macro_scope ();
3397 macro_scope = user_macro_scope ();
3399 scoped_restore restore_macro_scope
3400 = make_scoped_restore (&expression_macro_scope, macro_scope.get ());
3402 scoped_restore restore_yydebug = make_scoped_restore (&yydebug,
3405 /* Initialize some state used by the lexer. */
3406 last_was_structop = false;
3407 saw_name_at_eof = 0;
3410 token_fifo.clear ();
3412 name_obstack.clear ();
3419 /* This is called via the YYPRINT macro when parser debugging is
3420 enabled. It prints a token's value. */
3423 c_print_token (FILE *file, int type, YYSTYPE value)
3428 parser_fprintf (file, "typed_val_int<%s, %s>",
3429 TYPE_SAFE_NAME (value.typed_val_int.type),
3430 pulongest (value.typed_val_int.val));
3436 char *copy = (char *) alloca (value.tsval.length + 1);
3438 memcpy (copy, value.tsval.ptr, value.tsval.length);
3439 copy[value.tsval.length] = '\0';
3441 parser_fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3446 case DOLLAR_VARIABLE:
3447 parser_fprintf (file, "sval<%s>", copy_name (value.sval).c_str ());
3451 parser_fprintf (file, "tsym<type=%s, name=%s>",
3452 TYPE_SAFE_NAME (value.tsym.type),
3453 copy_name (value.tsym.stoken).c_str ());
3457 case UNKNOWN_CPP_NAME:
3460 parser_fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3461 copy_name (value.ssym.stoken).c_str (),
3462 (value.ssym.sym.symbol == NULL
3463 ? "(null)" : value.ssym.sym.symbol->print_name ()),
3464 value.ssym.is_a_field_of_this);
3468 parser_fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3476 yyerror (const char *msg)
3478 if (pstate->prev_lexptr)
3479 pstate->lexptr = pstate->prev_lexptr;
3481 error (_("A %s in expression, near `%s'."), msg, pstate->lexptr);