1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986-2022 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"
60 #define parse_type(ps) builtin_type (ps->gdbarch ())
62 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror,
64 #define GDB_YY_REMAP_PREFIX c_
67 /* The state of the parser, used internally when we are parsing the
70 static struct parser_state
*pstate
= NULL
;
72 /* Data that must be held for the duration of a parse. */
76 /* These are used to hold type lists and type stacks that are
77 allocated during the parse. */
78 std
::vector
<std
::unique_ptr
<std
::vector
<struct type
*>>> type_lists
;
79 std
::vector
<std
::unique_ptr
<struct type_stack
>> type_stacks
;
81 /* Storage for some strings allocated during the parse. */
82 std
::vector
<gdb
::unique_xmalloc_ptr
<char>> strings
;
84 /* When we find that lexptr (the global var defined in parse.c) is
85 pointing at a macro invocation, we expand the invocation, and call
86 scan_macro_expansion to save the old lexptr here and point lexptr
87 into the expanded text. When we reach the end of that, we call
88 end_macro_expansion to pop back to the value we saved here. The
89 macro expansion code promises to return only fully-expanded text,
90 so we don't need to "push" more than one level.
92 This is disgusting, of course. It would be cleaner to do all macro
93 expansion beforehand, and then hand that to lexptr. But we don't
94 really know where the expression ends. Remember, in a command like
96 (gdb) break *ADDRESS if CONDITION
98 we evaluate ADDRESS in the scope of the current frame, but we
99 evaluate CONDITION in the scope of the breakpoint's location. So
100 it's simply wrong to try to macro-expand the whole thing at once. */
101 const char *macro_original_text
= nullptr
;
103 /* We save all intermediate macro expansions on this obstack for the
104 duration of a single parse. The expansion text may sometimes have
105 to live past the end of the expansion, due to yacc lookahead.
106 Rather than try to be clever about saving the data for a single
107 token, we simply keep it all and delete it after parsing has
109 auto_obstack expansion_obstack
;
111 /* The type stack. */
112 struct type_stack type_stack
;
115 /* This is set and cleared in c_parse. */
117 static struct c_parse_state
*cpstate
;
121 static int yylex (void);
123 static void yyerror (const char *);
125 static int type_aggregate_p
(struct type
*);
127 using namespace expr
;
130 /* Although the yacc "value" of an expression is not used,
131 since the result is stored in the structure being created,
132 other node types do have values. */
147 struct typed_stoken tsval
;
149 struct symtoken ssym
;
151 const struct block
*bval
;
152 enum exp_opcode opcode
;
154 struct stoken_vector svec
;
155 std
::vector
<struct type
*> *tvec
;
157 struct type_stack
*type_stack
;
159 struct objc_class_str theclass
;
163 /* YYSTYPE gets defined by %union */
164 static int parse_number
(struct parser_state
*par_state
,
165 const char *, int, int, YYSTYPE *);
166 static struct stoken operator_stoken
(const char *);
167 static struct stoken typename_stoken
(const char *);
168 static void check_parameter_typelist
(std
::vector
<struct type
*> *);
170 #if defined(YYBISON) && YYBISON < 30800
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
286 pstate
->push_new
<type_operation
> ($1);
290 pstate
->wrap
<typeof_operation
> ();
292 | TYPEOF
'(' type
')'
294 pstate
->push_new
<type_operation
> ($3);
296 | DECLTYPE
'(' exp
')'
298 pstate
->wrap
<decltype_operation
> ();
302 /* Expressions, including the comma operator. */
305 { pstate
->wrap2
<comma_operation
> (); }
308 /* Expressions, not including the comma operator. */
309 exp
: '*' exp %prec UNARY
310 { pstate
->wrap
<unop_ind_operation
> (); }
313 exp
: '&' exp %prec UNARY
314 { pstate
->wrap
<unop_addr_operation
> (); }
317 exp
: '-' exp %prec UNARY
318 { pstate
->wrap
<unary_neg_operation
> (); }
321 exp
: '+' exp %prec UNARY
322 { pstate
->wrap
<unary_plus_operation
> (); }
325 exp
: '!' exp %prec UNARY
327 if
(pstate
->language
()->la_language
329 pstate
->wrap
<opencl_not_operation
> ();
331 pstate
->wrap
<unary_logical_not_operation
> ();
335 exp
: '~' exp %prec UNARY
336 { pstate
->wrap
<unary_complement_operation
> (); }
339 exp
: INCREMENT exp %prec UNARY
340 { pstate
->wrap
<preinc_operation
> (); }
343 exp
: DECREMENT exp %prec UNARY
344 { pstate
->wrap
<predec_operation
> (); }
347 exp
: exp INCREMENT %prec UNARY
348 { pstate
->wrap
<postinc_operation
> (); }
351 exp
: exp DECREMENT %prec UNARY
352 { pstate
->wrap
<postdec_operation
> (); }
355 exp
: TYPEID
'(' exp
')' %prec UNARY
356 { pstate
->wrap
<typeid_operation
> (); }
359 exp
: TYPEID
'(' type_exp
')' %prec UNARY
360 { pstate
->wrap
<typeid_operation
> (); }
363 exp
: SIZEOF exp %prec UNARY
364 { pstate
->wrap
<unop_sizeof_operation
> (); }
367 exp
: ALIGNOF
'(' type_exp
')' %prec UNARY
368 { pstate
->wrap
<unop_alignof_operation
> (); }
371 exp
: exp ARROW field_name
373 pstate
->push_new
<structop_ptr_operation
>
374 (pstate
->pop
(), copy_name
($3));
378 exp
: exp ARROW field_name COMPLETE
380 structop_base_operation
*op
381 = new structop_ptr_operation
(pstate
->pop
(),
383 pstate
->mark_struct_expression
(op
);
384 pstate
->push
(operation_up
(op
));
388 exp
: exp ARROW COMPLETE
390 structop_base_operation
*op
391 = new structop_ptr_operation
(pstate
->pop
(), "");
392 pstate
->mark_struct_expression
(op
);
393 pstate
->push
(operation_up
(op
));
397 exp
: exp ARROW
'~' name
399 pstate
->push_new
<structop_ptr_operation
>
400 (pstate
->pop
(), "~" + copy_name
($4));
404 exp
: exp ARROW
'~' name COMPLETE
406 structop_base_operation
*op
407 = new structop_ptr_operation
(pstate
->pop
(),
408 "~" + copy_name
($4));
409 pstate
->mark_struct_expression
(op
);
410 pstate
->push
(operation_up
(op
));
414 exp
: exp ARROW qualified_name
415 { /* exp->type::name becomes exp->*(&type::name) */
416 /* Note: this doesn't work if name is a
417 static member! FIXME */
418 pstate
->wrap
<unop_addr_operation
> ();
419 pstate
->wrap2
<structop_mptr_operation
> (); }
422 exp
: exp ARROW_STAR exp
423 { pstate
->wrap2
<structop_mptr_operation
> (); }
426 exp
: exp
'.' field_name
428 if
(pstate
->language
()->la_language
430 pstate
->push_new
<opencl_structop_operation
>
431 (pstate
->pop
(), copy_name
($3));
433 pstate
->push_new
<structop_operation
>
434 (pstate
->pop
(), copy_name
($3));
438 exp
: exp
'.' field_name COMPLETE
440 structop_base_operation
*op
441 = new structop_operation
(pstate
->pop
(),
443 pstate
->mark_struct_expression
(op
);
444 pstate
->push
(operation_up
(op
));
448 exp
: exp
'.' COMPLETE
450 structop_base_operation
*op
451 = new structop_operation
(pstate
->pop
(), "");
452 pstate
->mark_struct_expression
(op
);
453 pstate
->push
(operation_up
(op
));
457 exp
: exp
'.' '~' name
459 pstate
->push_new
<structop_operation
>
460 (pstate
->pop
(), "~" + copy_name
($4));
464 exp
: exp
'.' '~' name COMPLETE
466 structop_base_operation
*op
467 = new structop_operation
(pstate
->pop
(),
468 "~" + copy_name
($4));
469 pstate
->mark_struct_expression
(op
);
470 pstate
->push
(operation_up
(op
));
474 exp
: exp
'.' qualified_name
475 { /* exp.type::name becomes exp.*(&type::name) */
476 /* Note: this doesn't work if name is a
477 static member! FIXME */
478 pstate
->wrap
<unop_addr_operation
> ();
479 pstate
->wrap2
<structop_member_operation
> (); }
482 exp
: exp DOT_STAR exp
483 { pstate
->wrap2
<structop_member_operation
> (); }
486 exp
: exp
'[' exp1
']'
487 { pstate
->wrap2
<subscript_operation
> (); }
490 exp
: exp OBJC_LBRAC exp1
']'
491 { pstate
->wrap2
<subscript_operation
> (); }
495 * The rules below parse ObjC message calls of the form:
496 * '[' target selector {':' argument}* ']'
499 exp
: OBJC_LBRAC TYPENAME
503 std
::string copy
= copy_name
($2.stoken
);
504 theclass
= lookup_objc_class
(pstate
->gdbarch
(),
507 error (_
("%s is not an ObjC Class"),
509 pstate
->push_new
<long_const_operation
>
510 (parse_type
(pstate
)->builtin_int
,
515 { end_msglist
(pstate
); }
518 exp
: OBJC_LBRAC CLASSNAME
520 pstate
->push_new
<long_const_operation
>
521 (parse_type
(pstate
)->builtin_int
,
522 (LONGEST
) $2.theclass
);
526 { end_msglist
(pstate
); }
532 { end_msglist
(pstate
); }
536 { add_msglist
(&$1, 0); }
544 msgarg
: name
':' exp
545 { add_msglist
(&$1, 1); }
546 |
':' exp
/* Unnamed arg. */
547 { add_msglist
(0, 1); }
548 |
',' exp
/* Variable number of args. */
549 { add_msglist
(0, 0); }
553 /* This is to save the value of arglist_len
554 being accumulated by an outer function call. */
555 { pstate
->start_arglist
(); }
556 arglist
')' %prec ARROW
558 std
::vector
<operation_up
> args
559 = pstate
->pop_vector
(pstate
->end_arglist
());
560 pstate
->push_new
<funcall_operation
>
561 (pstate
->pop
(), std
::move
(args
));
565 /* This is here to disambiguate with the production for
566 "func()::static_var" further below, which uses
567 function_method_void. */
568 exp
: exp
'(' ')' %prec ARROW
570 pstate
->push_new
<funcall_operation
>
571 (pstate
->pop
(), std
::vector
<operation_up
> ());
576 exp
: UNKNOWN_CPP_NAME
'('
578 /* This could potentially be a an argument defined
579 lookup function (Koenig). */
580 /* This is to save the value of arglist_len
581 being accumulated by an outer function call. */
582 pstate
->start_arglist
();
584 arglist
')' %prec ARROW
586 std
::vector
<operation_up
> args
587 = pstate
->pop_vector
(pstate
->end_arglist
());
588 pstate
->push_new
<adl_func_operation
>
589 (copy_name
($1.stoken
),
590 pstate
->expression_context_block
,
596 { pstate
->start_arglist
(); }
603 { pstate
->arglist_len
= 1; }
606 arglist
: arglist
',' exp %prec ABOVE_COMMA
607 { pstate
->arglist_len
++; }
610 function_method: exp
'(' parameter_typelist
')' const_or_volatile
612 std
::vector
<struct type
*> *type_list
= $3;
613 /* Save the const/volatile qualifiers as
614 recorded by the const_or_volatile
615 production's actions. */
616 type_instance_flags flags
617 = (cpstate
->type_stack
618 .follow_type_instance_flags
());
619 pstate
->push_new
<type_instance_operation
>
620 (flags
, std
::move
(*type_list
),
625 function_method_void: exp
'(' ')' const_or_volatile
627 type_instance_flags flags
628 = (cpstate
->type_stack
629 .follow_type_instance_flags
());
630 pstate
->push_new
<type_instance_operation
>
631 (flags
, std
::vector
<type
*> (), pstate
->pop
());
635 exp
: function_method
638 /* Normally we must interpret "func()" as a function call, instead of
639 a type. The user needs to write func(void) to disambiguate.
640 However, in the "func()::static_var" case, there's no
642 function_method_void_or_typelist: function_method
643 | function_method_void
646 exp
: function_method_void_or_typelist COLONCOLON name
648 pstate
->push_new
<func_static_var_operation
>
649 (pstate
->pop
(), copy_name
($3));
654 { $$
= pstate
->end_arglist
() - 1; }
656 exp
: lcurly arglist rcurly %prec ARROW
658 std
::vector
<operation_up
> args
659 = pstate
->pop_vector
($3 + 1);
660 pstate
->push_new
<array_operation
> (0, $3,
665 exp
: lcurly type_exp rcurly exp %prec UNARY
666 { pstate
->wrap2
<unop_memval_type_operation
> (); }
669 exp
: '(' type_exp
')' exp %prec UNARY
671 if
(pstate
->language
()->la_language
673 pstate
->wrap2
<opencl_cast_type_operation
> ();
675 pstate
->wrap2
<unop_cast_type_operation
> ();
683 /* Binary operators in order of decreasing precedence. */
686 { pstate
->wrap2
<repeat_operation
> (); }
690 { pstate
->wrap2
<mul_operation
> (); }
694 { pstate
->wrap2
<div_operation
> (); }
698 { pstate
->wrap2
<rem_operation
> (); }
702 { pstate
->wrap2
<add_operation
> (); }
706 { pstate
->wrap2
<sub_operation
> (); }
710 { pstate
->wrap2
<lsh_operation
> (); }
714 { pstate
->wrap2
<rsh_operation
> (); }
719 if
(pstate
->language
()->la_language
721 pstate
->wrap2
<opencl_equal_operation
> ();
723 pstate
->wrap2
<equal_operation
> ();
727 exp
: exp NOTEQUAL exp
729 if
(pstate
->language
()->la_language
731 pstate
->wrap2
<opencl_notequal_operation
> ();
733 pstate
->wrap2
<notequal_operation
> ();
739 if
(pstate
->language
()->la_language
741 pstate
->wrap2
<opencl_leq_operation
> ();
743 pstate
->wrap2
<leq_operation
> ();
749 if
(pstate
->language
()->la_language
751 pstate
->wrap2
<opencl_geq_operation
> ();
753 pstate
->wrap2
<geq_operation
> ();
759 if
(pstate
->language
()->la_language
761 pstate
->wrap2
<opencl_less_operation
> ();
763 pstate
->wrap2
<less_operation
> ();
769 if
(pstate
->language
()->la_language
771 pstate
->wrap2
<opencl_gtr_operation
> ();
773 pstate
->wrap2
<gtr_operation
> ();
778 { pstate
->wrap2
<bitwise_and_operation
> (); }
782 { pstate
->wrap2
<bitwise_xor_operation
> (); }
786 { pstate
->wrap2
<bitwise_ior_operation
> (); }
791 if
(pstate
->language
()->la_language
794 operation_up rhs
= pstate
->pop
();
795 operation_up lhs
= pstate
->pop
();
796 pstate
->push_new
<opencl_logical_binop_operation
>
797 (BINOP_LOGICAL_AND
, std
::move
(lhs
),
801 pstate
->wrap2
<logical_and_operation
> ();
807 if
(pstate
->language
()->la_language
810 operation_up rhs
= pstate
->pop
();
811 operation_up lhs
= pstate
->pop
();
812 pstate
->push_new
<opencl_logical_binop_operation
>
813 (BINOP_LOGICAL_OR
, std
::move
(lhs
),
817 pstate
->wrap2
<logical_or_operation
> ();
821 exp
: exp
'?' exp
':' exp %prec
'?'
823 operation_up last
= pstate
->pop
();
824 operation_up mid
= pstate
->pop
();
825 operation_up first
= pstate
->pop
();
826 if
(pstate
->language
()->la_language
828 pstate
->push_new
<opencl_ternop_cond_operation
>
829 (std
::move
(first
), std
::move
(mid
),
832 pstate
->push_new
<ternop_cond_operation
>
833 (std
::move
(first
), std
::move
(mid
),
840 if
(pstate
->language
()->la_language
842 pstate
->wrap2
<opencl_assign_operation
> ();
844 pstate
->wrap2
<assign_operation
> ();
848 exp
: exp ASSIGN_MODIFY exp
850 operation_up rhs
= pstate
->pop
();
851 operation_up lhs
= pstate
->pop
();
852 pstate
->push_new
<assign_modify_operation
>
853 ($2, std
::move
(lhs
), std
::move
(rhs
));
859 pstate
->push_new
<long_const_operation
>
867 = (make_operation
<long_const_operation
>
868 (TYPE_TARGET_TYPE
($1.type
), 0));
870 = (make_operation
<long_const_operation
>
871 (TYPE_TARGET_TYPE
($1.type
), $1.val
));
872 pstate
->push_new
<complex_operation
>
873 (std
::move
(real
), std
::move
(imag
), $1.type
);
879 struct stoken_vector vec
;
882 pstate
->push_c_string
($1.type
, &vec
);
888 parse_number
(pstate
, $1.stoken.ptr
,
889 $1.stoken.length
, 0, &val
);
890 pstate
->push_new
<long_const_operation
>
891 (val.typed_val_int.type
,
892 val.typed_val_int.val
);
900 std
::copy
(std
::begin
($1.val
), std
::end
($1.val
),
902 pstate
->push_new
<float_const_operation
> ($1.type
, data
);
908 struct type
*underlying
909 = TYPE_TARGET_TYPE
($1.type
);
912 target_float_from_host_double
(val.data
(),
915 = (make_operation
<float_const_operation
>
918 std
::copy
(std
::begin
($1.val
), std
::end
($1.val
),
921 = (make_operation
<float_const_operation
>
924 pstate
->push_new
<complex_operation
>
925 (std
::move
(real
), std
::move
(imag
),
933 exp
: DOLLAR_VARIABLE
935 pstate
->push_dollar
($1);
939 exp
: SELECTOR
'(' name
')'
941 pstate
->push_new
<objc_selector_operation
>
946 exp
: SIZEOF
'(' type
')' %prec UNARY
947 { struct type
*type
= $3;
948 struct type
*int_type
949 = lookup_signed_typename
(pstate
->language
(),
951 type
= check_typedef
(type
);
953 /* $5.3.3/2 of the C++ Standard (n3290 draft)
954 says of sizeof: "When applied to a reference
955 or a reference type, the result is the size of
956 the referenced type." */
957 if
(TYPE_IS_REFERENCE
(type
))
958 type
= check_typedef
(TYPE_TARGET_TYPE
(type
));
959 pstate
->push_new
<long_const_operation
>
960 (int_type
, TYPE_LENGTH
(type
));
964 exp
: REINTERPRET_CAST
'<' type_exp
'>' '(' exp
')' %prec UNARY
965 { pstate
->wrap2
<reinterpret_cast_operation
> (); }
968 exp
: STATIC_CAST
'<' type_exp
'>' '(' exp
')' %prec UNARY
969 { pstate
->wrap2
<unop_cast_type_operation
> (); }
972 exp
: DYNAMIC_CAST
'<' type_exp
'>' '(' exp
')' %prec UNARY
973 { pstate
->wrap2
<dynamic_cast_operation
> (); }
976 exp
: CONST_CAST
'<' type_exp
'>' '(' exp
')' %prec UNARY
977 { /* We could do more error checking here, but
978 it doesn't seem worthwhile. */
979 pstate
->wrap2
<unop_cast_type_operation
> (); }
985 /* We copy the string here, and not in the
986 lexer, to guarantee that we do not leak a
987 string. Note that we follow the
988 NUL-termination convention of the
990 struct typed_stoken
*vec
= XNEW
(struct typed_stoken
);
995 vec
->length
= $1.length
;
996 vec
->ptr
= (char *) malloc
($1.length
+ 1);
997 memcpy
(vec
->ptr
, $1.ptr
, $1.length
+ 1);
1002 /* Note that we NUL-terminate here, but just
1006 $$.tokens
= XRESIZEVEC
(struct typed_stoken
,
1009 p
= (char *) malloc
($2.length
+ 1);
1010 memcpy
(p
, $2.ptr
, $2.length
+ 1);
1012 $$.tokens
[$$.len
- 1].type
= $2.type
;
1013 $$.tokens
[$$.len
- 1].length
= $2.length
;
1014 $$.tokens
[$$.len
- 1].ptr
= p
;
1021 c_string_type type
= C_STRING
;
1023 for
(i
= 0; i
< $1.len
; ++i
)
1025 switch
($1.tokens
[i
].type
)
1032 if
(type
!= C_STRING
1033 && type
!= $1.tokens
[i
].type
)
1034 error (_
("Undefined string concatenation."));
1035 type
= (enum c_string_type_values
) $1.tokens
[i
].type
;
1038 /* internal error */
1039 internal_error
(__FILE__
, __LINE__
,
1040 "unrecognized type in string concatenation");
1044 pstate
->push_c_string
(type
, &$1);
1045 for
(i
= 0; i
< $1.len
; ++i
)
1046 free
($1.tokens
[i
].ptr
);
1051 exp
: NSSTRING
/* ObjC NextStep NSString constant
1052 * of the form '@' '"' string '"'.
1055 pstate
->push_new
<objc_nsstring_operation
>
1062 { pstate
->push_new
<long_const_operation
>
1063 (parse_type
(pstate
)->builtin_bool
, 1);
1068 { pstate
->push_new
<long_const_operation
>
1069 (parse_type
(pstate
)->builtin_bool
, 0);
1078 $$
= $1.sym.symbol
->value_block
();
1080 error (_
("No file or function \"%s\"."),
1081 copy_name
($1.stoken
).c_str
());
1089 block
: block COLONCOLON name
1091 std
::string copy
= copy_name
($3);
1093 = lookup_symbol
(copy.c_str
(), $1,
1094 VAR_DOMAIN
, NULL
).symbol
;
1096 if
(!tem || tem
->aclass
() != LOC_BLOCK
)
1097 error (_
("No function \"%s\" in specified context."),
1099 $$
= tem
->value_block
(); }
1102 variable: name_not_typename ENTRY
1103 { struct symbol
*sym
= $1.sym.symbol
;
1105 if
(sym
== NULL ||
!sym
->is_argument
()
1106 ||
!symbol_read_needs_frame
(sym
))
1107 error (_
("@entry can be used only for function "
1108 "parameters, not for \"%s\""),
1109 copy_name
($1.stoken
).c_str
());
1111 pstate
->push_new
<var_entry_value_operation
> (sym
);
1115 variable: block COLONCOLON name
1117 std
::string copy
= copy_name
($3);
1118 struct block_symbol sym
1119 = lookup_symbol
(copy.c_str
(), $1,
1122 if
(sym.symbol
== 0)
1123 error (_
("No symbol \"%s\" in specified context."),
1125 if
(symbol_read_needs_frame
(sym.symbol
))
1126 pstate
->block_tracker
->update
(sym
);
1128 pstate
->push_new
<var_value_operation
> (sym
);
1132 qualified_name: TYPENAME COLONCOLON name
1134 struct type
*type
= $1.type
;
1135 type
= check_typedef
(type
);
1136 if
(!type_aggregate_p
(type
))
1137 error (_
("`%s' is not defined as an aggregate type."),
1138 TYPE_SAFE_NAME
(type
));
1140 pstate
->push_new
<scope_operation
> (type
,
1143 | TYPENAME COLONCOLON
'~' name
1145 struct type
*type
= $1.type
;
1147 type
= check_typedef
(type
);
1148 if
(!type_aggregate_p
(type
))
1149 error (_
("`%s' is not defined as an aggregate type."),
1150 TYPE_SAFE_NAME
(type
));
1151 std
::string name
= "~" + std
::string ($4.ptr
,
1154 /* Check for valid destructor name. */
1155 destructor_name_p
(name.c_str
(), $1.type
);
1156 pstate
->push_new
<scope_operation
> (type
,
1159 | TYPENAME COLONCOLON name COLONCOLON name
1161 std
::string copy
= copy_name
($3);
1162 error (_
("No type \"%s\" within class "
1163 "or namespace \"%s\"."),
1164 copy.c_str
(), TYPE_SAFE_NAME
($1.type
));
1168 variable: qualified_name
1169 | COLONCOLON name_not_typename
1171 std
::string name
= copy_name
($2.stoken
);
1172 struct block_symbol sym
1173 = lookup_symbol
(name.c_str
(),
1174 (const struct block
*) NULL
,
1176 pstate
->push_symbol
(name.c_str
(), sym
);
1180 variable: name_not_typename
1181 { struct block_symbol sym
= $1.sym
;
1185 if
(symbol_read_needs_frame
(sym.symbol
))
1186 pstate
->block_tracker
->update
(sym
);
1188 /* If we found a function, see if it's
1189 an ifunc resolver that has the same
1190 address as the ifunc symbol itself.
1191 If so, prefer the ifunc symbol. */
1193 bound_minimal_symbol resolver
1194 = find_gnu_ifunc
(sym.symbol
);
1195 if
(resolver.minsym
!= NULL
)
1196 pstate
->push_new
<var_msym_value_operation
>
1199 pstate
->push_new
<var_value_operation
> (sym
);
1201 else if
($1.is_a_field_of_this
)
1203 /* C++: it hangs off of `this'. Must
1204 not inadvertently convert from a method call
1206 pstate
->block_tracker
->update
(sym
);
1208 = make_operation
<op_this_operation
> ();
1209 pstate
->push_new
<structop_ptr_operation
>
1210 (std
::move
(thisop
), copy_name
($1.stoken
));
1214 std
::string arg
= copy_name
($1.stoken
);
1216 bound_minimal_symbol msymbol
1217 = lookup_bound_minimal_symbol
(arg.c_str
());
1218 if
(msymbol.minsym
== NULL
)
1220 if
(!have_full_symbols
() && !have_partial_symbols
())
1221 error (_
("No symbol table is loaded. Use the \"file\" command."));
1223 error (_
("No symbol \"%s\" in current context."),
1227 /* This minsym might be an alias for
1228 another function. See if we can find
1229 the debug symbol for the target, and
1230 if so, use it instead, since it has
1231 return type / prototype info. This
1232 is important for example for "p
1233 *__errno_location()". */
1234 symbol
*alias_target
1235 = ((msymbol.minsym
->type
() != mst_text_gnu_ifunc
1236 && msymbol.minsym
->type
() != mst_data_gnu_ifunc
)
1237 ? find_function_alias_target
(msymbol
)
1239 if
(alias_target
!= NULL
)
1241 block_symbol bsym
{ alias_target
,
1242 alias_target
->value_block
() };
1243 pstate
->push_new
<var_value_operation
> (bsym
);
1246 pstate
->push_new
<var_msym_value_operation
>
1252 const_or_volatile: const_or_volatile_noopt
1258 { cpstate
->type_stack.insert
(tp_const
); }
1260 { cpstate
->type_stack.insert
(tp_volatile
); }
1262 { cpstate
->type_stack.insert
(tp_atomic
); }
1264 { cpstate
->type_stack.insert
(tp_restrict
); }
1267 cpstate
->type_stack.insert
(pstate
,
1268 copy_name
($2.stoken
).c_str
());
1270 |
'@' UNKNOWN_CPP_NAME
1272 cpstate
->type_stack.insert
(pstate
,
1273 copy_name
($2.stoken
).c_str
());
1277 qualifier_seq_noopt:
1279 | qualifier_seq_noopt single_qualifier
1289 { cpstate
->type_stack.insert
(tp_pointer
); }
1292 { cpstate
->type_stack.insert
(tp_pointer
); }
1295 { cpstate
->type_stack.insert
(tp_reference
); }
1297 { cpstate
->type_stack.insert
(tp_reference
); }
1299 { cpstate
->type_stack.insert
(tp_rvalue_reference
); }
1300 | ANDAND ptr_operator
1301 { cpstate
->type_stack.insert
(tp_rvalue_reference
); }
1304 ptr_operator_ts: ptr_operator
1306 $$
= cpstate
->type_stack.create
();
1307 cpstate
->type_stacks.emplace_back
($$
);
1311 abs_decl: ptr_operator_ts direct_abs_decl
1312 { $$
= $2->append
($1); }
1317 direct_abs_decl: '(' abs_decl
')'
1319 | direct_abs_decl array_mod
1321 cpstate
->type_stack.push
($1);
1322 cpstate
->type_stack.push
($2);
1323 cpstate
->type_stack.push
(tp_array
);
1324 $$
= cpstate
->type_stack.create
();
1325 cpstate
->type_stacks.emplace_back
($$
);
1329 cpstate
->type_stack.push
($1);
1330 cpstate
->type_stack.push
(tp_array
);
1331 $$
= cpstate
->type_stack.create
();
1332 cpstate
->type_stacks.emplace_back
($$
);
1335 | direct_abs_decl func_mod
1337 cpstate
->type_stack.push
($1);
1338 cpstate
->type_stack.push
($2);
1339 $$
= cpstate
->type_stack.create
();
1340 cpstate
->type_stacks.emplace_back
($$
);
1344 cpstate
->type_stack.push
($1);
1345 $$
= cpstate
->type_stack.create
();
1346 cpstate
->type_stacks.emplace_back
($$
);
1356 | OBJC_LBRAC INT
']'
1362 $$
= new std
::vector
<struct type
*>;
1363 cpstate
->type_lists.emplace_back
($$
);
1365 |
'(' parameter_typelist
')'
1369 /* We used to try to recognize pointer to member types here, but
1370 that didn't work (shift/reduce conflicts meant that these rules never
1371 got executed). The problem is that
1372 int (foo::bar::baz::bizzle)
1373 is a function type but
1374 int (foo::bar::baz::bizzle::*)
1375 is a pointer to member type. Stroustrup loses again! */
1380 /* A helper production that recognizes scalar types that can validly
1381 be used with _Complex. */
1385 { $$
= lookup_signed_typename
(pstate
->language
(),
1388 { $$
= lookup_signed_typename
(pstate
->language
(),
1391 { $$
= lookup_signed_typename
(pstate
->language
(),
1394 { $$
= lookup_signed_typename
(pstate
->language
(),
1396 | LONG SIGNED_KEYWORD INT_KEYWORD
1397 { $$
= lookup_signed_typename
(pstate
->language
(),
1399 | LONG SIGNED_KEYWORD
1400 { $$
= lookup_signed_typename
(pstate
->language
(),
1402 | SIGNED_KEYWORD LONG INT_KEYWORD
1403 { $$
= lookup_signed_typename
(pstate
->language
(),
1405 | UNSIGNED LONG INT_KEYWORD
1406 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1408 | LONG UNSIGNED INT_KEYWORD
1409 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1412 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1415 { $$
= lookup_signed_typename
(pstate
->language
(),
1417 | LONG LONG INT_KEYWORD
1418 { $$
= lookup_signed_typename
(pstate
->language
(),
1420 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1421 { $$
= lookup_signed_typename
(pstate
->language
(),
1423 | LONG LONG SIGNED_KEYWORD
1424 { $$
= lookup_signed_typename
(pstate
->language
(),
1426 | SIGNED_KEYWORD LONG LONG
1427 { $$
= lookup_signed_typename
(pstate
->language
(),
1429 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1430 { $$
= lookup_signed_typename
(pstate
->language
(),
1432 | UNSIGNED LONG LONG
1433 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1435 | UNSIGNED LONG LONG INT_KEYWORD
1436 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1438 | LONG LONG UNSIGNED
1439 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1441 | LONG LONG UNSIGNED INT_KEYWORD
1442 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1445 { $$
= lookup_signed_typename
(pstate
->language
(),
1447 | SHORT SIGNED_KEYWORD INT_KEYWORD
1448 { $$
= lookup_signed_typename
(pstate
->language
(),
1450 | SHORT SIGNED_KEYWORD
1451 { $$
= lookup_signed_typename
(pstate
->language
(),
1453 | UNSIGNED SHORT INT_KEYWORD
1454 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1457 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1459 | SHORT UNSIGNED INT_KEYWORD
1460 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1463 { $$
= lookup_typename
(pstate
->language
(),
1468 { $$
= lookup_typename
(pstate
->language
(),
1472 | LONG DOUBLE_KEYWORD
1473 { $$
= lookup_typename
(pstate
->language
(),
1477 | UNSIGNED type_name
1478 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1479 $2.type
->name
()); }
1481 { $$
= lookup_unsigned_typename
(pstate
->language
(),
1483 | SIGNED_KEYWORD type_name
1484 { $$
= lookup_signed_typename
(pstate
->language
(),
1485 $2.type
->name
()); }
1487 { $$
= lookup_signed_typename
(pstate
->language
(),
1491 /* Implements (approximately): (type-qualifier)* type-specifier.
1493 When type-specifier is only ever a single word, like 'float' then these
1494 arrive as pre-built TYPENAME tokens thanks to the classify_name
1495 function. However, when a type-specifier can contain multiple words,
1496 for example 'double' can appear as just 'double' or 'long double', and
1497 similarly 'long' can appear as just 'long' or in 'long double', then
1498 these type-specifiers are parsed into their own tokens in the function
1499 lex_one_token and the ident_tokens array. These separate tokens are all
1506 | COMPLEX scalar_type
1508 $$
= init_complex_type
(nullptr
, $2);
1512 = lookup_struct
(copy_name
($2).c_str
(),
1513 pstate
->expression_context_block
);
1517 pstate
->mark_completion_tag
(TYPE_CODE_STRUCT
,
1521 | STRUCT name COMPLETE
1523 pstate
->mark_completion_tag
(TYPE_CODE_STRUCT
,
1528 { $$
= lookup_struct
1529 (copy_name
($2).c_str
(),
1530 pstate
->expression_context_block
);
1534 pstate
->mark_completion_tag
(TYPE_CODE_STRUCT
,
1538 | CLASS name COMPLETE
1540 pstate
->mark_completion_tag
(TYPE_CODE_STRUCT
,
1546 = lookup_union
(copy_name
($2).c_str
(),
1547 pstate
->expression_context_block
);
1551 pstate
->mark_completion_tag
(TYPE_CODE_UNION
,
1555 | UNION name COMPLETE
1557 pstate
->mark_completion_tag
(TYPE_CODE_UNION
,
1562 { $$
= lookup_enum
(copy_name
($2).c_str
(),
1563 pstate
->expression_context_block
);
1567 pstate
->mark_completion_tag
(TYPE_CODE_ENUM
, "", 0);
1570 | ENUM name COMPLETE
1572 pstate
->mark_completion_tag
(TYPE_CODE_ENUM
, $2.ptr
,
1576 /* It appears that this rule for templates is never
1577 reduced; template recognition happens by lookahead
1578 in the token processing code in yylex. */
1579 | TEMPLATE name
'<' type
'>'
1580 { $$
= lookup_template_type
1581 (copy_name
($2).c_str
(), $4,
1582 pstate
->expression_context_block
);
1584 | qualifier_seq_noopt typebase
1585 { $$
= cpstate
->type_stack.follow_types
($2); }
1586 | typebase qualifier_seq_noopt
1587 { $$
= cpstate
->type_stack.follow_types
($1); }
1593 $$.stoken.ptr
= "int";
1594 $$.stoken.length
= 3;
1595 $$.type
= lookup_signed_typename
(pstate
->language
(),
1600 $$.stoken.ptr
= "long";
1601 $$.stoken.length
= 4;
1602 $$.type
= lookup_signed_typename
(pstate
->language
(),
1607 $$.stoken.ptr
= "short";
1608 $$.stoken.length
= 5;
1609 $$.type
= lookup_signed_typename
(pstate
->language
(),
1616 { check_parameter_typelist
($1); }
1617 | nonempty_typelist
',' DOTDOTDOT
1619 $1->push_back
(NULL
);
1620 check_parameter_typelist
($1);
1628 std
::vector
<struct type
*> *typelist
1629 = new std
::vector
<struct type
*>;
1630 cpstate
->type_lists.emplace_back
(typelist
);
1632 typelist
->push_back
($1);
1635 | nonempty_typelist
',' type
1645 cpstate
->type_stack.push
($2);
1646 $$
= cpstate
->type_stack.follow_types
($1);
1650 conversion_type_id: typebase conversion_declarator
1651 { $$
= cpstate
->type_stack.follow_types
($1); }
1654 conversion_declarator: /* Nothing. */
1655 | ptr_operator conversion_declarator
1658 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1659 | VOLATILE_KEYWORD CONST_KEYWORD
1662 const_or_volatile_noopt: const_and_volatile
1663 { cpstate
->type_stack.insert
(tp_const
);
1664 cpstate
->type_stack.insert
(tp_volatile
);
1667 { cpstate
->type_stack.insert
(tp_const
); }
1669 { cpstate
->type_stack.insert
(tp_volatile
); }
1673 { $$
= operator_stoken
(" new"); }
1675 { $$
= operator_stoken
(" delete"); }
1676 | OPERATOR NEW
'[' ']'
1677 { $$
= operator_stoken
(" new[]"); }
1678 | OPERATOR DELETE
'[' ']'
1679 { $$
= operator_stoken
(" delete[]"); }
1680 | OPERATOR NEW OBJC_LBRAC
']'
1681 { $$
= operator_stoken
(" new[]"); }
1682 | OPERATOR DELETE OBJC_LBRAC
']'
1683 { $$
= operator_stoken
(" delete[]"); }
1685 { $$
= operator_stoken
("+"); }
1687 { $$
= operator_stoken
("-"); }
1689 { $$
= operator_stoken
("*"); }
1691 { $$
= operator_stoken
("/"); }
1693 { $$
= operator_stoken
("%"); }
1695 { $$
= operator_stoken
("^"); }
1697 { $$
= operator_stoken
("&"); }
1699 { $$
= operator_stoken
("|"); }
1701 { $$
= operator_stoken
("~"); }
1703 { $$
= operator_stoken
("!"); }
1705 { $$
= operator_stoken
("="); }
1707 { $$
= operator_stoken
("<"); }
1709 { $$
= operator_stoken
(">"); }
1710 | OPERATOR ASSIGN_MODIFY
1711 { const char *op
= " unknown";
1735 case BINOP_BITWISE_IOR
:
1738 case BINOP_BITWISE_AND
:
1741 case BINOP_BITWISE_XOR
:
1748 $$
= operator_stoken
(op
);
1751 { $$
= operator_stoken
("<<"); }
1753 { $$
= operator_stoken
(">>"); }
1755 { $$
= operator_stoken
("=="); }
1757 { $$
= operator_stoken
("!="); }
1759 { $$
= operator_stoken
("<="); }
1761 { $$
= operator_stoken
(">="); }
1763 { $$
= operator_stoken
("&&"); }
1765 { $$
= operator_stoken
("||"); }
1766 | OPERATOR INCREMENT
1767 { $$
= operator_stoken
("++"); }
1768 | OPERATOR DECREMENT
1769 { $$
= operator_stoken
("--"); }
1771 { $$
= operator_stoken
(","); }
1772 | OPERATOR ARROW_STAR
1773 { $$
= operator_stoken
("->*"); }
1775 { $$
= operator_stoken
("->"); }
1777 { $$
= operator_stoken
("()"); }
1779 { $$
= operator_stoken
("[]"); }
1780 | OPERATOR OBJC_LBRAC
']'
1781 { $$
= operator_stoken
("[]"); }
1782 | OPERATOR conversion_type_id
1785 c_print_type
($2, NULL
, &buf
, -1, 0,
1786 pstate
->language
()->la_language
,
1787 &type_print_raw_options
);
1788 std
::string name
= buf.release
();
1790 /* This also needs canonicalization. */
1791 gdb
::unique_xmalloc_ptr
<char> canon
1792 = cp_canonicalize_string
(name.c_str
());
1793 if
(canon
!= nullptr
)
1794 name
= canon.get
();
1795 $$
= operator_stoken
((" " + name
).c_str
());
1799 /* This rule exists in order to allow some tokens that would not normally
1800 match the 'name' rule to appear as fields within a struct. The example
1801 that initially motivated this was the RISC-V target which models the
1802 floating point registers as a union with fields called 'float' and
1806 | DOUBLE_KEYWORD
{ $$
= typename_stoken
("double"); }
1807 | FLOAT_KEYWORD
{ $$
= typename_stoken
("float"); }
1808 | INT_KEYWORD
{ $$
= typename_stoken
("int"); }
1809 | LONG
{ $$
= typename_stoken
("long"); }
1810 | SHORT
{ $$
= typename_stoken
("short"); }
1811 | SIGNED_KEYWORD
{ $$
= typename_stoken
("signed"); }
1812 | UNSIGNED
{ $$
= typename_stoken
("unsigned"); }
1815 name
: NAME
{ $$
= $1.stoken
; }
1816 | BLOCKNAME
{ $$
= $1.stoken
; }
1817 | TYPENAME
{ $$
= $1.stoken
; }
1818 | NAME_OR_INT
{ $$
= $1.stoken
; }
1819 | UNKNOWN_CPP_NAME
{ $$
= $1.stoken
; }
1823 name_not_typename
: NAME
1825 /* These would be useful if name_not_typename was useful, but it is just
1826 a fake for "variable", so these cause reduce/reduce conflicts because
1827 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1828 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1829 context where only a name could occur, this might be useful.
1834 struct field_of_this_result is_a_field_of_this
;
1838 = lookup_symbol
($1.ptr
,
1839 pstate
->expression_context_block
,
1841 &is_a_field_of_this
);
1842 $$.is_a_field_of_this
1843 = is_a_field_of_this.type
!= NULL
;
1850 /* Returns a stoken of the operator name given by OP (which does not
1851 include the string "operator"). */
1853 static struct stoken
1854 operator_stoken
(const char *op
)
1856 struct stoken st
= { NULL
, 0 };
1859 st.length
= CP_OPERATOR_LEN
+ strlen
(op
);
1860 buf
= (char *) malloc
(st.length
+ 1);
1861 strcpy
(buf
, CP_OPERATOR_STR
);
1865 /* The toplevel (c_parse) will free the memory allocated here. */
1866 cpstate
->strings.emplace_back
(buf
);
1870 /* Returns a stoken of the type named TYPE. */
1872 static struct stoken
1873 typename_stoken
(const char *type
)
1875 struct stoken st
= { type
, 0 };
1876 st.length
= strlen
(type
);
1880 /* Return true if the type is aggregate-like. */
1883 type_aggregate_p
(struct type
*type
)
1885 return
(type
->code
() == TYPE_CODE_STRUCT
1886 || type
->code
() == TYPE_CODE_UNION
1887 || type
->code
() == TYPE_CODE_NAMESPACE
1888 ||
(type
->code
() == TYPE_CODE_ENUM
1889 && type
->is_declared_class
()));
1892 /* Validate a parameter typelist. */
1895 check_parameter_typelist
(std
::vector
<struct type
*> *params
)
1900 for
(ix
= 0; ix
< params
->size
(); ++ix
)
1902 type
= (*params
)[ix
];
1903 if
(type
!= NULL
&& check_typedef
(type
)->code
() == TYPE_CODE_VOID
)
1907 if
(params
->size
() == 1)
1912 error (_
("parameter types following 'void'"));
1915 error (_
("'void' invalid as parameter type"));
1920 /* Take care of parsing a number (anything that starts with a digit).
1921 Set yylval and return the token type; update lexptr.
1922 LEN is the number of characters in it. */
1924 /*** Needs some error checking for the float case ***/
1927 parse_number
(struct parser_state
*par_state
,
1928 const char *buf
, int len
, int parsed_float
, YYSTYPE *putithere
)
1935 int base
= input_radix
;
1938 /* Number of "L" suffixes encountered. */
1941 /* Imaginary number. */
1942 bool imaginary_p
= false
;
1944 /* We have found a "L" or "U" (or "i") suffix. */
1945 int found_suffix
= 0;
1949 p
= (char *) alloca
(len
);
1950 memcpy
(p
, buf
, len
);
1954 if
(len
>= 1 && p
[len
- 1] == 'i')
1960 /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */
1961 if
(len
>= 2 && p
[len
- 2] == 'd' && p
[len
- 1] == 'f')
1963 putithere
->typed_val_float.type
1964 = parse_type
(par_state
)->builtin_decfloat
;
1967 else if
(len
>= 2 && p
[len
- 2] == 'd' && p
[len
- 1] == 'd')
1969 putithere
->typed_val_float.type
1970 = parse_type
(par_state
)->builtin_decdouble
;
1973 else if
(len
>= 2 && p
[len
- 2] == 'd' && p
[len
- 1] == 'l')
1975 putithere
->typed_val_float.type
1976 = parse_type
(par_state
)->builtin_declong
;
1979 /* Handle suffixes: 'f' for float, 'l' for long double. */
1980 else if
(len
>= 1 && TOLOWER
(p
[len
- 1]) == 'f')
1982 putithere
->typed_val_float.type
1983 = parse_type
(par_state
)->builtin_float
;
1986 else if
(len
>= 1 && TOLOWER
(p
[len
- 1]) == 'l')
1988 putithere
->typed_val_float.type
1989 = parse_type
(par_state
)->builtin_long_double
;
1992 /* Default type for floating-point literals is double. */
1995 putithere
->typed_val_float.type
1996 = parse_type
(par_state
)->builtin_double
;
1999 if
(!parse_float
(p
, len
,
2000 putithere
->typed_val_float.type
,
2001 putithere
->typed_val_float.val
))
2005 putithere
->typed_val_float.type
2006 = init_complex_type
(nullptr
, putithere
->typed_val_float.type
);
2008 return imaginary_p ? COMPLEX_FLOAT
: FLOAT
;
2011 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
2012 if
(p
[0] == '0' && len
> 1)
2055 if
(c
>= 'A' && c
<= 'Z')
2057 if
(c
!= 'l' && c
!= 'u' && c
!= 'i')
2059 if
(c
>= '0' && c
<= '9')
2067 if
(base
> 10 && c
>= 'a' && c
<= 'f')
2071 n
+= i
= c
- 'a' + 10;
2089 return ERROR
; /* Char not a digit */
2092 return ERROR
; /* Invalid digit in this base */
2094 if
(c
!= 'l' && c
!= 'u' && c
!= 'i')
2096 /* Test for overflow. */
2097 if
(prevn
== 0 && n
== 0)
2099 else if
(prevn
>= n
)
2100 error (_
("Numeric constant too large."));
2105 /* An integer constant is an int, a long, or a long long. An L
2106 suffix forces it to be long; an LL suffix forces it to be long
2107 long. If not forced to a larger size, it gets the first type of
2108 the above that it fits in. To figure out whether it fits, we
2109 shift it right and see whether anything remains. Note that we
2110 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
2111 operation, because many compilers will warn about such a shift
2112 (which always produces a zero result). Sometimes gdbarch_int_bit
2113 or gdbarch_long_bit will be that big, sometimes not. To deal with
2114 the case where it is we just always shift the value more than
2115 once, with fewer bits each time. */
2116 int int_bits
= gdbarch_int_bit
(par_state
->gdbarch
());
2117 int long_bits
= gdbarch_long_bit
(par_state
->gdbarch
());
2118 int long_long_bits
= gdbarch_long_long_bit
(par_state
->gdbarch
());
2120 /* No 'u' suffix. */
2123 = ((/* 'u' suffix. */
2125 ||
(/* Not a decimal. */
2127 ||
(/* Allowed as a convenience, in case decimal doesn't fit in largest
2129 !fits_in_type
(1, n
, long_long_bits
, true
)));
2131 /* No 'l' or 'll' suffix. */
2134 /* No 'll' suffix. */
2136 if
(have_int
&& have_signed
&& fits_in_type
(1, n
, int_bits
, true
))
2137 putithere
->typed_val_int.type
= parse_type
(par_state
)->builtin_int
;
2138 else if
(have_int
&& have_unsigned
&& fits_in_type
(1, n
, int_bits
, false
))
2139 putithere
->typed_val_int.type
2140 = parse_type
(par_state
)->builtin_unsigned_int
;
2141 else if
(have_long
&& have_signed
&& fits_in_type
(1, n
, long_bits
, true
))
2142 putithere
->typed_val_int.type
= parse_type
(par_state
)->builtin_long
;
2143 else if
(have_long
&& have_unsigned
&& fits_in_type
(1, n
, long_bits
, false
))
2144 putithere
->typed_val_int.type
2145 = parse_type
(par_state
)->builtin_unsigned_long
;
2146 else if
(have_signed
&& fits_in_type
(1, n
, long_long_bits
, true
))
2147 putithere
->typed_val_int.type
2148 = parse_type
(par_state
)->builtin_long_long
;
2149 else if
(have_unsigned
&& fits_in_type
(1, n
, long_long_bits
, false
))
2150 putithere
->typed_val_int.type
2151 = parse_type
(par_state
)->builtin_unsigned_long_long
;
2153 error (_
("Numeric constant too large."));
2154 putithere
->typed_val_int.val
= n
;
2157 putithere
->typed_val_int.type
2158 = init_complex_type
(nullptr
, putithere
->typed_val_int.type
);
2160 return imaginary_p ? COMPLEX_INT
: INT
;
2163 /* Temporary obstack used for holding strings. */
2164 static struct obstack tempbuf
;
2165 static int tempbuf_init
;
2167 /* Parse a C escape sequence. The initial backslash of the sequence
2168 is at (*PTR)[-1]. *PTR will be updated to point to just after the
2169 last character of the sequence. If OUTPUT is not NULL, the
2170 translated form of the escape sequence will be written there. If
2171 OUTPUT is NULL, no output is written and the call will only affect
2172 *PTR. If an escape sequence is expressed in target bytes, then the
2173 entire sequence will simply be copied to OUTPUT. Return 1 if any
2174 character was emitted, 0 otherwise. */
2177 c_parse_escape
(const char **ptr
, struct obstack
*output
)
2179 const char *tokptr
= *ptr
;
2182 /* Some escape sequences undergo character set conversion. Those we
2186 /* Hex escapes do not undergo character set conversion, so keep
2187 the escape sequence for later. */
2190 obstack_grow_str
(output
, "\\x");
2192 if
(!ISXDIGIT
(*tokptr
))
2193 error (_
("\\x escape without a following hex digit"));
2194 while
(ISXDIGIT
(*tokptr
))
2197 obstack_1grow
(output
, *tokptr
);
2202 /* Octal escapes do not undergo character set conversion, so
2203 keep the escape sequence for later. */
2215 obstack_grow_str
(output
, "\\");
2217 i
< 3 && ISDIGIT
(*tokptr
) && *tokptr
!= '8' && *tokptr
!= '9';
2221 obstack_1grow
(output
, *tokptr
);
2227 /* We handle UCNs later. We could handle them here, but that
2228 would mean a spurious error in the case where the UCN could
2229 be converted to the target charset but not the host
2235 int i
, len
= c
== 'U' ?
8 : 4;
2238 obstack_1grow
(output
, '\\');
2239 obstack_1grow
(output
, *tokptr
);
2242 if
(!ISXDIGIT
(*tokptr
))
2243 error (_
("\\%c escape without a following hex digit"), c
);
2244 for
(i
= 0; i
< len
&& ISXDIGIT
(*tokptr
); ++i
)
2247 obstack_1grow
(output
, *tokptr
);
2253 /* We must pass backslash through so that it does not
2254 cause quoting during the second expansion. */
2257 obstack_grow_str
(output
, "\\\\");
2261 /* Escapes which undergo conversion. */
2264 obstack_1grow
(output
, '\a');
2269 obstack_1grow
(output
, '\b');
2274 obstack_1grow
(output
, '\f');
2279 obstack_1grow
(output
, '\n');
2284 obstack_1grow
(output
, '\r');
2289 obstack_1grow
(output
, '\t');
2294 obstack_1grow
(output
, '\v');
2298 /* GCC extension. */
2301 obstack_1grow
(output
, HOST_ESCAPE_CHAR
);
2305 /* Backslash-newline expands to nothing at all. */
2311 /* A few escapes just expand to the character itself. */
2315 /* GCC extensions. */
2320 /* Unrecognized escapes turn into the character itself. */
2323 obstack_1grow
(output
, *tokptr
);
2331 /* Parse a string or character literal from TOKPTR. The string or
2332 character may be wide or unicode. *OUTPTR is set to just after the
2333 end of the literal in the input string. The resulting token is
2334 stored in VALUE. This returns a token value, either STRING or
2335 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2336 number of host characters in the literal. */
2339 parse_string_or_char
(const char *tokptr
, const char **outptr
,
2340 struct typed_stoken
*value
, int *host_chars
)
2346 /* Build the gdb internal form of the input string in tempbuf. Note
2347 that the buffer is null byte terminated *only* for the
2348 convenience of debugging gdb itself and printing the buffer
2349 contents when the buffer contains no embedded nulls. Gdb does
2350 not depend upon the buffer being null byte terminated, it uses
2351 the length string instead. This allows gdb to handle C strings
2352 (as well as strings in other languages) with embedded null
2358 obstack_free
(&tempbuf
, NULL
);
2359 obstack_init
(&tempbuf
);
2361 /* Record the string type. */
2364 type
= C_WIDE_STRING
;
2367 else if
(*tokptr
== 'u')
2372 else if
(*tokptr
== 'U')
2377 else if
(*tokptr
== '@')
2379 /* An Objective C string. */
2387 /* Skip the quote. */
2401 *host_chars
+= c_parse_escape
(&tokptr
, &tempbuf
);
2403 else if
(c
== quote
)
2407 obstack_1grow
(&tempbuf
, c
);
2409 /* FIXME: this does the wrong thing with multi-byte host
2410 characters. We could use mbrlen here, but that would
2411 make "set host-charset" a bit less useful. */
2416 if
(*tokptr
!= quote
)
2419 error (_
("Unterminated string in expression."));
2421 error (_
("Unmatched single quote."));
2426 value
->ptr
= (char *) obstack_base
(&tempbuf
);
2427 value
->length
= obstack_object_size
(&tempbuf
);
2431 return quote
== '"' ?
(is_objc ? NSSTRING
: STRING
) : CHAR
;
2434 /* This is used to associate some attributes with a token. */
2438 /* If this bit is set, the token is C++-only. */
2442 /* If this bit is set, the token is C-only. */
2446 /* If this bit is set, the token is conditional: if there is a
2447 symbol of the same name, then the token is a symbol; otherwise,
2448 the token is a keyword. */
2452 DEF_ENUM_FLAGS_TYPE
(enum token_flag
, token_flags
);
2458 enum exp_opcode opcode
;
2462 static const struct token tokentab3
[] =
2464 {">>=", ASSIGN_MODIFY
, BINOP_RSH
, 0},
2465 {"<<=", ASSIGN_MODIFY
, BINOP_LSH
, 0},
2466 {"->*", ARROW_STAR
, OP_NULL
, FLAG_CXX
},
2467 {"...", DOTDOTDOT
, OP_NULL
, 0}
2470 static const struct token tokentab2
[] =
2472 {"+=", ASSIGN_MODIFY
, BINOP_ADD
, 0},
2473 {"-=", ASSIGN_MODIFY
, BINOP_SUB
, 0},
2474 {"*=", ASSIGN_MODIFY
, BINOP_MUL
, 0},
2475 {"/=", ASSIGN_MODIFY
, BINOP_DIV
, 0},
2476 {"%=", ASSIGN_MODIFY
, BINOP_REM
, 0},
2477 {"|=", ASSIGN_MODIFY
, BINOP_BITWISE_IOR
, 0},
2478 {"&=", ASSIGN_MODIFY
, BINOP_BITWISE_AND
, 0},
2479 {"^=", ASSIGN_MODIFY
, BINOP_BITWISE_XOR
, 0},
2480 {"++", INCREMENT
, OP_NULL
, 0},
2481 {"--", DECREMENT
, OP_NULL
, 0},
2482 {"->", ARROW
, OP_NULL
, 0},
2483 {"&&", ANDAND
, OP_NULL
, 0},
2484 {"||", OROR
, OP_NULL
, 0},
2485 /* "::" is *not* only C++: gdb overrides its meaning in several
2486 different ways, e.g., 'filename'::func, function::variable. */
2487 {"::", COLONCOLON
, OP_NULL
, 0},
2488 {"<<", LSH
, OP_NULL
, 0},
2489 {">>", RSH
, OP_NULL
, 0},
2490 {"==", EQUAL
, OP_NULL
, 0},
2491 {"!=", NOTEQUAL
, OP_NULL
, 0},
2492 {"<=", LEQ
, OP_NULL
, 0},
2493 {">=", GEQ
, OP_NULL
, 0},
2494 {".*", DOT_STAR
, OP_NULL
, FLAG_CXX
}
2497 /* Identifier-like tokens. Only type-specifiers than can appear in
2498 multi-word type names (for example 'double' can appear in 'long
2499 double') need to be listed here. type-specifiers that are only ever
2500 single word (like 'char') are handled by the classify_name function. */
2501 static const struct token ident_tokens
[] =
2503 {"unsigned", UNSIGNED
, OP_NULL
, 0},
2504 {"template", TEMPLATE
, OP_NULL
, FLAG_CXX
},
2505 {"volatile", VOLATILE_KEYWORD
, OP_NULL
, 0},
2506 {"struct", STRUCT
, OP_NULL
, 0},
2507 {"signed", SIGNED_KEYWORD
, OP_NULL
, 0},
2508 {"sizeof", SIZEOF
, OP_NULL
, 0},
2509 {"_Alignof", ALIGNOF
, OP_NULL
, 0},
2510 {"alignof", ALIGNOF
, OP_NULL
, FLAG_CXX
},
2511 {"double", DOUBLE_KEYWORD
, OP_NULL
, 0},
2512 {"float", FLOAT_KEYWORD
, OP_NULL
, 0},
2513 {"false", FALSEKEYWORD
, OP_NULL
, FLAG_CXX
},
2514 {"class", CLASS
, OP_NULL
, FLAG_CXX
},
2515 {"union", UNION
, OP_NULL
, 0},
2516 {"short", SHORT
, OP_NULL
, 0},
2517 {"const", CONST_KEYWORD
, OP_NULL
, 0},
2518 {"restrict", RESTRICT
, OP_NULL
, FLAG_C | FLAG_SHADOW
},
2519 {"__restrict__", RESTRICT
, OP_NULL
, 0},
2520 {"__restrict", RESTRICT
, OP_NULL
, 0},
2521 {"_Atomic", ATOMIC
, OP_NULL
, 0},
2522 {"enum", ENUM
, OP_NULL
, 0},
2523 {"long", LONG
, OP_NULL
, 0},
2524 {"_Complex", COMPLEX
, OP_NULL
, 0},
2525 {"__complex__", COMPLEX
, OP_NULL
, 0},
2527 {"true", TRUEKEYWORD
, OP_NULL
, FLAG_CXX
},
2528 {"int", INT_KEYWORD
, OP_NULL
, 0},
2529 {"new", NEW
, OP_NULL
, FLAG_CXX
},
2530 {"delete", DELETE
, OP_NULL
, FLAG_CXX
},
2531 {"operator", OPERATOR
, OP_NULL
, FLAG_CXX
},
2533 {"and", ANDAND
, OP_NULL
, FLAG_CXX
},
2534 {"and_eq", ASSIGN_MODIFY
, BINOP_BITWISE_AND
, FLAG_CXX
},
2535 {"bitand", '&', OP_NULL
, FLAG_CXX
},
2536 {"bitor", '|', OP_NULL
, FLAG_CXX
},
2537 {"compl", '~', OP_NULL
, FLAG_CXX
},
2538 {"not", '!', OP_NULL
, FLAG_CXX
},
2539 {"not_eq", NOTEQUAL
, OP_NULL
, FLAG_CXX
},
2540 {"or", OROR
, OP_NULL
, FLAG_CXX
},
2541 {"or_eq", ASSIGN_MODIFY
, BINOP_BITWISE_IOR
, FLAG_CXX
},
2542 {"xor", '^', OP_NULL
, FLAG_CXX
},
2543 {"xor_eq", ASSIGN_MODIFY
, BINOP_BITWISE_XOR
, FLAG_CXX
},
2545 {"const_cast", CONST_CAST
, OP_NULL
, FLAG_CXX
},
2546 {"dynamic_cast", DYNAMIC_CAST
, OP_NULL
, FLAG_CXX
},
2547 {"static_cast", STATIC_CAST
, OP_NULL
, FLAG_CXX
},
2548 {"reinterpret_cast", REINTERPRET_CAST
, OP_NULL
, FLAG_CXX
},
2550 {"__typeof__", TYPEOF
, OP_TYPEOF
, 0 },
2551 {"__typeof", TYPEOF
, OP_TYPEOF
, 0 },
2552 {"typeof", TYPEOF
, OP_TYPEOF
, FLAG_SHADOW
},
2553 {"__decltype", DECLTYPE
, OP_DECLTYPE
, FLAG_CXX
},
2554 {"decltype", DECLTYPE
, OP_DECLTYPE
, FLAG_CXX | FLAG_SHADOW
},
2556 {"typeid", TYPEID
, OP_TYPEID
, FLAG_CXX
}
2561 scan_macro_expansion
(const char *expansion
)
2563 /* We'd better not be trying to push the stack twice. */
2564 gdb_assert
(! cpstate
->macro_original_text
);
2566 /* Copy to the obstack. */
2567 const char *copy
= obstack_strdup
(&cpstate
->expansion_obstack
, expansion
);
2569 /* Save the old lexptr value, so we can return to it when we're done
2570 parsing the expanded text. */
2571 cpstate
->macro_original_text
= pstate
->lexptr
;
2572 pstate
->lexptr
= copy
;
2576 scanning_macro_expansion
(void)
2578 return cpstate
->macro_original_text
!= 0;
2582 finished_macro_expansion
(void)
2584 /* There'd better be something to pop back to. */
2585 gdb_assert
(cpstate
->macro_original_text
);
2587 /* Pop back to the original text. */
2588 pstate
->lexptr
= cpstate
->macro_original_text
;
2589 cpstate
->macro_original_text
= 0;
2592 /* Return true iff the token represents a C++ cast operator. */
2595 is_cast_operator
(const char *token
, int len
)
2597 return
(! strncmp
(token
, "dynamic_cast", len
)
2598 ||
! strncmp
(token
, "static_cast", len
)
2599 ||
! strncmp
(token
, "reinterpret_cast", len
)
2600 ||
! strncmp
(token
, "const_cast", len
));
2603 /* The scope used for macro expansion. */
2604 static struct macro_scope
*expression_macro_scope
;
2606 /* This is set if a NAME token appeared at the very end of the input
2607 string, with no whitespace separating the name from the EOF. This
2608 is used only when parsing to do field name completion. */
2609 static int saw_name_at_eof
;
2611 /* This is set if the previously-returned token was a structure
2612 operator -- either '.' or ARROW. */
2613 static bool last_was_structop
;
2615 /* Depth of parentheses. */
2616 static int paren_depth
;
2618 /* Read one token, getting characters through lexptr. */
2621 lex_one_token
(struct parser_state
*par_state
, bool *is_quoted_name
)
2625 const char *tokstart
;
2626 bool saw_structop
= last_was_structop
;
2628 last_was_structop
= false
;
2629 *is_quoted_name
= false
;
2633 /* Check if this is a macro invocation that we need to expand. */
2634 if
(! scanning_macro_expansion
())
2636 gdb
::unique_xmalloc_ptr
<char> expanded
2637 = macro_expand_next
(&pstate
->lexptr
, *expression_macro_scope
);
2639 if
(expanded
!= nullptr
)
2640 scan_macro_expansion
(expanded.get
());
2643 pstate
->prev_lexptr
= pstate
->lexptr
;
2645 tokstart
= pstate
->lexptr
;
2646 /* See if it is a special token of length 3. */
2647 for
(const auto
&token
: tokentab3
)
2648 if
(strncmp
(tokstart
, token.oper
, 3) == 0)
2650 if
((token.flags
& FLAG_CXX
) != 0
2651 && par_state
->language
()->la_language
!= language_cplus
)
2653 gdb_assert
((token.flags
& FLAG_C
) == 0);
2655 pstate
->lexptr
+= 3;
2656 yylval.opcode
= token.opcode
;
2660 /* See if it is a special token of length 2. */
2661 for
(const auto
&token
: tokentab2
)
2662 if
(strncmp
(tokstart
, token.oper
, 2) == 0)
2664 if
((token.flags
& FLAG_CXX
) != 0
2665 && par_state
->language
()->la_language
!= language_cplus
)
2667 gdb_assert
((token.flags
& FLAG_C
) == 0);
2669 pstate
->lexptr
+= 2;
2670 yylval.opcode
= token.opcode
;
2671 if
(token.token
== ARROW
)
2672 last_was_structop
= 1;
2676 switch
(c
= *tokstart
)
2679 /* If we were just scanning the result of a macro expansion,
2680 then we need to resume scanning the original text.
2681 If we're parsing for field name completion, and the previous
2682 token allows such completion, return a COMPLETE token.
2683 Otherwise, we were already scanning the original text, and
2684 we're really done. */
2685 if
(scanning_macro_expansion
())
2687 finished_macro_expansion
();
2690 else if
(saw_name_at_eof
)
2692 saw_name_at_eof
= 0;
2695 else if
(par_state
->parse_completion
&& saw_structop
)
2710 if
(par_state
->language
()->la_language
== language_objc
2717 if
(paren_depth
== 0)
2724 if
(pstate
->comma_terminates
2726 && ! scanning_macro_expansion
())
2732 /* Might be a floating point number. */
2733 if
(pstate
->lexptr
[1] < '0' || pstate
->lexptr
[1] > '9')
2735 last_was_structop
= true
;
2736 goto symbol
; /* Nope, must be a symbol. */
2751 /* It's a number. */
2752 int got_dot
= 0, got_e
= 0, got_p
= 0, toktype
;
2753 const char *p
= tokstart
;
2754 int hex
= input_radix
> 10;
2756 if
(c
== '0' && (p
[1] == 'x' || p
[1] == 'X'))
2761 else if
(c
== '0' && (p
[1]=='t' || p
[1]=='T' || p
[1]=='d' || p
[1]=='D'))
2769 /* This test includes !hex because 'e' is a valid hex digit
2770 and thus does not indicate a floating point number when
2771 the radix is hex. */
2772 if
(!hex
&& !got_e
&& !got_p
&& (*p
== 'e' ||
*p
== 'E'))
2773 got_dot
= got_e
= 1;
2774 else if
(!got_e
&& !got_p
&& (*p
== 'p' ||
*p
== 'P'))
2775 got_dot
= got_p
= 1;
2776 /* This test does not include !hex, because a '.' always indicates
2777 a decimal floating point number regardless of the radix. */
2778 else if
(!got_dot
&& *p
== '.')
2780 else if
(((got_e
&& (p
[-1] == 'e' || p
[-1] == 'E'))
2781 ||
(got_p
&& (p
[-1] == 'p' || p
[-1] == 'P')))
2782 && (*p
== '-' ||
*p
== '+'))
2783 /* This is the sign of the exponent, not the end of the
2786 /* We will take any letters or digits. parse_number will
2787 complain if past the radix, or if L or U are not final. */
2788 else if
((*p
< '0' ||
*p
> '9')
2789 && ((*p
< 'a' ||
*p
> 'z')
2790 && (*p
< 'A' ||
*p
> 'Z')))
2793 toktype
= parse_number
(par_state
, tokstart
, p
- tokstart
,
2794 got_dot | got_e | got_p
, &yylval);
2795 if
(toktype
== ERROR
)
2797 char *err_copy
= (char *) alloca
(p
- tokstart
+ 1);
2799 memcpy
(err_copy
, tokstart
, p
- tokstart
);
2800 err_copy
[p
- tokstart
] = 0;
2801 error (_
("Invalid number \"%s\"."), err_copy
);
2809 const char *p
= &tokstart
[1];
2811 if
(par_state
->language
()->la_language
== language_objc
)
2813 size_t len
= strlen
("selector");
2815 if
(strncmp
(p
, "selector", len
) == 0
2816 && (p
[len
] == '\0' || ISSPACE
(p
[len
])))
2818 pstate
->lexptr
= p
+ len
;
2825 while
(ISSPACE
(*p
))
2827 size_t len
= strlen
("entry");
2828 if
(strncmp
(p
, "entry", len
) == 0 && !c_ident_is_alnum
(p
[len
])
2831 pstate
->lexptr
= &p
[len
];
2860 if
(tokstart
[1] != '"' && tokstart
[1] != '\'')
2869 int result
= parse_string_or_char
(tokstart
, &pstate
->lexptr
,
2870 &yylval.tsval
, &host_len
);
2874 error (_
("Empty character constant."));
2875 else if
(host_len
> 2 && c
== '\'')
2878 namelen
= pstate
->lexptr
- tokstart
- 1;
2879 *is_quoted_name
= true
;
2883 else if
(host_len
> 1)
2884 error (_
("Invalid character constant."));
2890 if
(!(c
== '_' || c
== '$' || c_ident_is_alpha
(c
)))
2891 /* We must have come across a bad character (e.g. ';'). */
2892 error (_
("Invalid character '%c' in expression."), c
);
2894 /* It's a name. See how long it is. */
2896 for
(c
= tokstart
[namelen
];
2897 (c
== '_' || c
== '$' || c_ident_is_alnum
(c
) || c
== '<');)
2899 /* Template parameter lists are part of the name.
2900 FIXME: This mishandles `print $a<4&&$a>3'. */
2904 if
(! is_cast_operator
(tokstart
, namelen
))
2906 /* Scan ahead to get rest of the template specification. Note
2907 that we look ahead only when the '<' adjoins non-whitespace
2908 characters; for comparison expressions, e.g. "a < b > c",
2909 there must be spaces before the '<', etc. */
2910 const char *p
= find_template_name_end
(tokstart
+ namelen
);
2913 namelen
= p
- tokstart
;
2917 c
= tokstart
[++namelen
];
2920 /* The token "if" terminates the expression and is NOT removed from
2921 the input stream. It doesn't count if it appears in the
2922 expansion of a macro. */
2924 && tokstart
[0] == 'i'
2925 && tokstart
[1] == 'f'
2926 && ! scanning_macro_expansion
())
2931 /* For the same reason (breakpoint conditions), "thread N"
2932 terminates the expression. "thread" could be an identifier, but
2933 an identifier is never followed by a number without intervening
2934 punctuation. "task" is similar. Handle abbreviations of these,
2935 similarly to breakpoint.c:find_condition_and_thread. */
2937 && (strncmp
(tokstart
, "thread", namelen
) == 0
2938 || strncmp
(tokstart
, "task", namelen
) == 0)
2939 && (tokstart
[namelen
] == ' ' || tokstart
[namelen
] == '\t')
2940 && ! scanning_macro_expansion
())
2942 const char *p
= tokstart
+ namelen
+ 1;
2944 while
(*p
== ' ' ||
*p
== '\t')
2946 if
(*p
>= '0' && *p
<= '9')
2950 pstate
->lexptr
+= namelen
;
2954 yylval.sval.ptr
= tokstart
;
2955 yylval.sval.length
= namelen
;
2957 /* Catch specific keywords. */
2958 std
::string copy
= copy_name
(yylval.sval
);
2959 for
(const auto
&token
: ident_tokens
)
2960 if
(copy
== token.oper
)
2962 if
((token.flags
& FLAG_CXX
) != 0
2963 && par_state
->language
()->la_language
!= language_cplus
)
2965 if
((token.flags
& FLAG_C
) != 0
2966 && par_state
->language
()->la_language
!= language_c
2967 && par_state
->language
()->la_language
!= language_objc
)
2970 if
((token.flags
& FLAG_SHADOW
) != 0)
2972 struct field_of_this_result is_a_field_of_this
;
2974 if
(lookup_symbol
(copy.c_str
(),
2975 pstate
->expression_context_block
,
2977 (par_state
->language
()->la_language
2978 == language_cplus ?
&is_a_field_of_this
2982 /* The keyword is shadowed. */
2987 /* It is ok to always set this, even though we don't always
2988 strictly need to. */
2989 yylval.opcode
= token.opcode
;
2993 if
(*tokstart
== '$')
2994 return DOLLAR_VARIABLE
;
2996 if
(pstate
->parse_completion
&& *pstate
->lexptr
== '\0')
2997 saw_name_at_eof
= 1;
2999 yylval.ssym.stoken
= yylval.sval
;
3000 yylval.ssym.sym.symbol
= NULL
;
3001 yylval.ssym.sym.block
= NULL
;
3002 yylval.ssym.is_a_field_of_this
= 0;
3006 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
3007 struct token_and_value
3013 /* A FIFO of tokens that have been read but not yet returned to the
3015 static std
::vector
<token_and_value
> token_fifo
;
3017 /* Non-zero if the lexer should return tokens from the FIFO. */
3020 /* Temporary storage for c_lex; this holds symbol names as they are
3022 static auto_obstack name_obstack
;
3024 /* Classify a NAME token. The contents of the token are in `yylval'.
3025 Updates yylval and returns the new token type. BLOCK is the block
3026 in which lookups start; this can be NULL to mean the global scope.
3027 IS_QUOTED_NAME is non-zero if the name token was originally quoted
3028 in single quotes. IS_AFTER_STRUCTOP is true if this name follows
3029 a structure operator -- either '.' or ARROW */
3032 classify_name
(struct parser_state
*par_state
, const struct block
*block
,
3033 bool is_quoted_name
, bool is_after_structop
)
3035 struct block_symbol bsym
;
3036 struct field_of_this_result is_a_field_of_this
;
3038 std
::string copy
= copy_name
(yylval.sval
);
3040 /* Initialize this in case we *don't* use it in this call; that way
3041 we can refer to it unconditionally below. */
3042 memset
(&is_a_field_of_this
, 0, sizeof
(is_a_field_of_this
));
3044 bsym
= lookup_symbol
(copy.c_str
(), block
, VAR_DOMAIN
,
3045 par_state
->language
()->name_of_this
()
3046 ?
&is_a_field_of_this
: NULL
);
3048 if
(bsym.symbol
&& bsym.symbol
->aclass
() == LOC_BLOCK
)
3050 yylval.ssym.sym
= bsym
;
3051 yylval.ssym.is_a_field_of_this
= is_a_field_of_this.type
!= NULL
;
3054 else if
(!bsym.symbol
)
3056 /* If we found a field of 'this', we might have erroneously
3057 found a constructor where we wanted a type name. Handle this
3058 case by noticing that we found a constructor and then look up
3059 the type tag instead. */
3060 if
(is_a_field_of_this.type
!= NULL
3061 && is_a_field_of_this.fn_field
!= NULL
3062 && TYPE_FN_FIELD_CONSTRUCTOR
(is_a_field_of_this.fn_field
->fn_fields
,
3065 struct field_of_this_result inner_is_a_field_of_this
;
3067 bsym
= lookup_symbol
(copy.c_str
(), block
, STRUCT_DOMAIN
,
3068 &inner_is_a_field_of_this
);
3069 if
(bsym.symbol
!= NULL
)
3071 yylval.tsym.type
= bsym.symbol
->type
();
3076 /* If we found a field on the "this" object, or we are looking
3077 up a field on a struct, then we want to prefer it over a
3078 filename. However, if the name was quoted, then it is better
3079 to check for a filename or a block, since this is the only
3080 way the user has of requiring the extension to be used. */
3081 if
((is_a_field_of_this.type
== NULL
&& !is_after_structop
)
3084 /* See if it's a file name. */
3085 struct symtab
*symtab
;
3087 symtab
= lookup_symtab
(copy.c_str
());
3091 = symtab
->compunit
()->blockvector
()->static_block
();
3098 if
(bsym.symbol
&& bsym.symbol
->aclass
() == LOC_TYPEDEF
)
3100 yylval.tsym.type
= bsym.symbol
->type
();
3104 /* See if it's an ObjC classname. */
3105 if
(par_state
->language
()->la_language
== language_objc
&& !bsym.symbol
)
3107 CORE_ADDR Class
= lookup_objc_class
(par_state
->gdbarch
(),
3113 yylval.theclass.theclass
= Class
;
3114 sym
= lookup_struct_typedef
(copy.c_str
(),
3115 par_state
->expression_context_block
, 1);
3117 yylval.theclass.type
= sym
->type
();
3122 /* Input names that aren't symbols but ARE valid hex numbers, when
3123 the input radix permits them, can be names or numbers depending
3124 on the parse. Note we support radixes > 16 here. */
3126 && ((copy
[0] >= 'a' && copy
[0] < 'a' + input_radix
- 10)
3127 ||
(copy
[0] >= 'A' && copy
[0] < 'A' + input_radix
- 10)))
3129 YYSTYPE newlval
; /* Its value is ignored. */
3130 int hextype
= parse_number
(par_state
, copy.c_str
(), yylval.sval.length
,
3135 yylval.ssym.sym
= bsym
;
3136 yylval.ssym.is_a_field_of_this
= is_a_field_of_this.type
!= NULL
;
3141 /* Any other kind of symbol */
3142 yylval.ssym.sym
= bsym
;
3143 yylval.ssym.is_a_field_of_this
= is_a_field_of_this.type
!= NULL
;
3145 if
(bsym.symbol
== NULL
3146 && par_state
->language
()->la_language
== language_cplus
3147 && is_a_field_of_this.type
== NULL
3148 && lookup_minimal_symbol
(copy.c_str
(), NULL
, NULL
).minsym
== NULL
)
3149 return UNKNOWN_CPP_NAME
;
3154 /* Like classify_name, but used by the inner loop of the lexer, when a
3155 name might have already been seen. CONTEXT is the context type, or
3156 NULL if this is the first component of a name. */
3159 classify_inner_name
(struct parser_state
*par_state
,
3160 const struct block
*block
, struct type
*context
)
3164 if
(context
== NULL
)
3165 return classify_name
(par_state
, block
, false
, false
);
3167 type
= check_typedef
(context
);
3168 if
(!type_aggregate_p
(type
))
3171 std
::string copy
= copy_name
(yylval.ssym.stoken
);
3172 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3173 yylval.ssym.sym
= cp_lookup_nested_symbol
(type
, copy.c_str
(), block
,
3176 /* If no symbol was found, search for a matching base class named
3177 COPY. This will allow users to enter qualified names of class members
3178 relative to the `this' pointer. */
3179 if
(yylval.ssym.sym.symbol
== NULL
)
3181 struct type
*base_type
= cp_find_type_baseclass_by_name
(type
,
3184 if
(base_type
!= NULL
)
3186 yylval.tsym.type
= base_type
;
3193 switch
(yylval.ssym.sym.symbol
->aclass
())
3197 /* cp_lookup_nested_symbol might have accidentally found a constructor
3198 named COPY when we really wanted a base class of the same name.
3199 Double-check this case by looking for a base class. */
3201 struct type
*base_type
3202 = cp_find_type_baseclass_by_name
(type
, copy.c_str
());
3204 if
(base_type
!= NULL
)
3206 yylval.tsym.type
= base_type
;
3213 yylval.tsym.type
= yylval.ssym.sym.symbol
->type
();
3219 internal_error
(__FILE__
, __LINE__
, _
("not reached"));
3222 /* The outer level of a two-level lexer. This calls the inner lexer
3223 to return tokens. It then either returns these tokens, or
3224 aggregates them into a larger token. This lets us work around a
3225 problem in our parsing approach, where the parser could not
3226 distinguish between qualified names and qualified types at the
3229 This approach is still not ideal, because it mishandles template
3230 types. See the comment in lex_one_token for an example. However,
3231 this is still an improvement over the earlier approach, and will
3232 suffice until we move to better parsing technology. */
3237 token_and_value current
;
3238 int first_was_coloncolon
, last_was_coloncolon
;
3239 struct type
*context_type
= NULL
;
3240 int last_to_examine
, next_to_examine
, checkpoint
;
3241 const struct block
*search_block
;
3242 bool is_quoted_name
, last_lex_was_structop
;
3244 if
(popping
&& !token_fifo.empty
())
3248 last_lex_was_structop
= last_was_structop
;
3250 /* Read the first token and decide what to do. Most of the
3251 subsequent code is C++-only; but also depends on seeing a "::" or
3253 current.token
= lex_one_token
(pstate
, &is_quoted_name
);
3254 if
(current.token
== NAME
)
3255 current.token
= classify_name
(pstate
, pstate
->expression_context_block
,
3256 is_quoted_name
, last_lex_was_structop
);
3257 if
(pstate
->language
()->la_language
!= language_cplus
3258 ||
(current.token
!= TYPENAME
&& current.token
!= COLONCOLON
3259 && current.token
!= FILENAME
))
3260 return current.token
;
3262 /* Read any sequence of alternating "::" and name-like tokens into
3264 current.value
= yylval;
3265 token_fifo.push_back
(current
);
3266 last_was_coloncolon
= current.token
== COLONCOLON
;
3271 /* We ignore quoted names other than the very first one.
3272 Subsequent ones do not have any special meaning. */
3273 current.token
= lex_one_token
(pstate
, &ignore
);
3274 current.value
= yylval;
3275 token_fifo.push_back
(current
);
3277 if
((last_was_coloncolon
&& current.token
!= NAME
)
3278 ||
(!last_was_coloncolon
&& current.token
!= COLONCOLON
))
3280 last_was_coloncolon
= !last_was_coloncolon
;
3284 /* We always read one extra token, so compute the number of tokens
3285 to examine accordingly. */
3286 last_to_examine
= token_fifo.size
() - 2;
3287 next_to_examine
= 0;
3289 current
= token_fifo
[next_to_examine
];
3292 name_obstack.clear
();
3294 if
(current.token
== FILENAME
)
3295 search_block
= current.value.bval
;
3296 else if
(current.token
== COLONCOLON
)
3297 search_block
= NULL
;
3300 gdb_assert
(current.token
== TYPENAME
);
3301 search_block
= pstate
->expression_context_block
;
3302 obstack_grow
(&name_obstack
, current.value.sval.ptr
,
3303 current.value.sval.length
);
3304 context_type
= current.value.tsym.type
;
3308 first_was_coloncolon
= current.token
== COLONCOLON
;
3309 last_was_coloncolon
= first_was_coloncolon
;
3311 while
(next_to_examine
<= last_to_examine
)
3313 token_and_value next
;
3315 next
= token_fifo
[next_to_examine
];
3318 if
(next.token
== NAME
&& last_was_coloncolon
)
3322 yylval = next.value
;
3323 classification
= classify_inner_name
(pstate
, search_block
,
3325 /* We keep going until we either run out of names, or until
3326 we have a qualified name which is not a type. */
3327 if
(classification
!= TYPENAME
&& classification
!= NAME
)
3330 /* Accept up to this token. */
3331 checkpoint
= next_to_examine
;
3333 /* Update the partial name we are constructing. */
3334 if
(context_type
!= NULL
)
3336 /* We don't want to put a leading "::" into the name. */
3337 obstack_grow_str
(&name_obstack
, "::");
3339 obstack_grow
(&name_obstack
, next.value.sval.ptr
,
3340 next.value.sval.length
);
3342 yylval.sval.ptr
= (const char *) obstack_base
(&name_obstack
);
3343 yylval.sval.length
= obstack_object_size
(&name_obstack
);
3344 current.value
= yylval;
3345 current.token
= classification
;
3347 last_was_coloncolon
= 0;
3349 if
(classification
== NAME
)
3352 context_type
= yylval.tsym.type
;
3354 else if
(next.token
== COLONCOLON
&& !last_was_coloncolon
)
3355 last_was_coloncolon
= 1;
3358 /* We've reached the end of the name. */
3363 /* If we have a replacement token, install it as the first token in
3364 the FIFO, and delete the other constituent tokens. */
3367 current.value.sval.ptr
3368 = obstack_strndup
(&cpstate
->expansion_obstack
,
3369 current.value.sval.ptr
,
3370 current.value.sval.length
);
3372 token_fifo
[0] = current
;
3374 token_fifo.erase
(token_fifo.begin
() + 1,
3375 token_fifo.begin
() + checkpoint
);
3379 current
= token_fifo
[0];
3380 token_fifo.erase
(token_fifo.begin
());
3381 yylval = current.value
;
3382 return current.token
;
3386 c_parse
(struct parser_state
*par_state
)
3388 /* Setting up the parser state. */
3389 scoped_restore pstate_restore
= make_scoped_restore
(&pstate
);
3390 gdb_assert
(par_state
!= NULL
);
3393 c_parse_state cstate
;
3394 scoped_restore cstate_restore
= make_scoped_restore
(&cpstate
, &cstate
);
3396 gdb
::unique_xmalloc_ptr
<struct macro_scope
> macro_scope
;
3398 if
(par_state
->expression_context_block
)
3400 = sal_macro_scope
(find_pc_line
(par_state
->expression_context_pc
, 0));
3402 macro_scope
= default_macro_scope
();
3404 macro_scope
= user_macro_scope
();
3406 scoped_restore restore_macro_scope
3407 = make_scoped_restore
(&expression_macro_scope
, macro_scope.get
());
3409 scoped_restore restore_yydebug
= make_scoped_restore
(&yydebug,
3412 /* Initialize some state used by the lexer. */
3413 last_was_structop
= false
;
3414 saw_name_at_eof
= 0;
3417 token_fifo.clear
();
3419 name_obstack.clear
();
3421 int result
= yyparse ();
3423 pstate
->set_operation
(pstate
->pop
());
3427 #if defined(YYBISON) && YYBISON < 30800
3430 /* This is called via the YYPRINT macro when parser debugging is
3431 enabled. It prints a token's value. */
3434 c_print_token
(FILE *file
, int type
, YYSTYPE value
)
3439 parser_fprintf
(file
, "typed_val_int<%s, %s>",
3440 TYPE_SAFE_NAME
(value.typed_val_int.type
),
3441 pulongest
(value.typed_val_int.val
));
3447 char *copy
= (char *) alloca
(value.tsval.length
+ 1);
3449 memcpy
(copy
, value.tsval.ptr
, value.tsval.length
);
3450 copy
[value.tsval.length
] = '\0';
3452 parser_fprintf
(file
, "tsval<type=%d, %s>", value.tsval.type
, copy
);
3457 case DOLLAR_VARIABLE
:
3458 parser_fprintf
(file
, "sval<%s>", copy_name
(value.sval
).c_str
());
3462 parser_fprintf
(file
, "tsym<type=%s, name=%s>",
3463 TYPE_SAFE_NAME
(value.tsym.type
),
3464 copy_name
(value.tsym.stoken
).c_str
());
3468 case UNKNOWN_CPP_NAME
:
3471 parser_fprintf
(file
, "ssym<name=%s, sym=%s, field_of_this=%d>",
3472 copy_name
(value.ssym.stoken
).c_str
(),
3473 (value.ssym.sym.symbol
== NULL
3474 ?
"(null)" : value.ssym.sym.symbol
->print_name
()),
3475 value.ssym.is_a_field_of_this
);
3479 parser_fprintf
(file
, "bval<%s>", host_address_to_string
(value.bval
));
3487 yyerror (const char *msg
)
3489 if
(pstate
->prev_lexptr
)
3490 pstate
->lexptr
= pstate
->prev_lexptr
;
3492 error (_
("A %s in expression, near `%s'."), msg
, pstate
->lexptr
);