?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
GAS: Add a return type tag to DWARF DIEs generated for function symbols.
[binutils-gdb.git] / gdb / c-exp.y
blob61a61fcba09cb8cf2a4a490b7c6df19952c7343e
1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986-2022 Free Software Foundation, Inc.
3
4 This file is part of GDB.
5
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.
10
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.
15
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/>. */
18
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.
27
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. */
35
36 %{
37
38 #include "defs.h"
39 #include <ctype.h>
40 #include "expression.h"
41 #include "value.h"
42 #include "parser-defs.h"
43 #include "language.h"
44 #include "c-lang.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 */
49 #include "charset.h"
50 #include "block.h"
51 #include "cp-support.h"
52 #include "macroscope.h"
53 #include "objc-lang.h"
54 #include "typeprint.h"
55 #include "cp-abi.h"
56 #include "type-stack.h"
57 #include "target-float.h"
58 #include "c-exp.h"
59
60 #define parse_type(ps) builtin_type (ps->gdbarch ())
61
62 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror,
63 etc). */
64 #define GDB_YY_REMAP_PREFIX c_
65 #include "yy-remap.h"
66
67 /* The state of the parser, used internally when we are parsing the
68 expression. */
69
70 static struct parser_state *pstate = NULL;
71
72 /* Data that must be held for the duration of a parse. */
73
74 struct c_parse_state
75 {
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;
80
81 /* Storage for some strings allocated during the parse. */
82 std::vector<gdb::unique_xmalloc_ptr<char>> strings;
83
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.
91
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
95
96 (gdb) break *ADDRESS if CONDITION
97
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;
102
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
108 completed. */
109 auto_obstack expansion_obstack;
110
111 /* The type stack. */
112 struct type_stack type_stack;
113 };
114
115 /* This is set and cleared in c_parse. */
116
117 static struct c_parse_state *cpstate;
118
119 int yyparse (void);
120
121 static int yylex (void);
122
123 static void yyerror (const char *);
124
125 static int type_aggregate_p (struct type *);
126
127 using namespace expr;
128 %}
129
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. */
133
134 %union
135 {
136 LONGEST lval;
137 struct {
138 LONGEST val;
139 struct type *type;
140 } typed_val_int;
141 struct {
142 gdb_byte val[16];
143 struct type *type;
144 } typed_val_float;
145 struct type *tval;
146 struct stoken sval;
147 struct typed_stoken tsval;
148 struct ttype tsym;
149 struct symtoken ssym;
150 int voidval;
151 const struct block *bval;
152 enum exp_opcode opcode;
153
154 struct stoken_vector svec;
155 std::vector<struct type *> *tvec;
156
157 struct type_stack *type_stack;
158
159 struct objc_class_str theclass;
160 }
161
162 %{
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 *> *);
169
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)
173 #endif
174 %}
175
176 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly function_method
177 %type <lval> rcurly
178 %type <tval> type typebase scalar_type
179 %type <tvec> nonempty_typelist func_mod parameter_typelist
180 /* %type <bval> block */
181
182 /* Fancy type parsing. */
183 %type <tval> ptype
184 %type <lval> array_mod
185 %type <tval> conversion_type_id
186
187 %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl
188
189 %token <typed_val_int> INT COMPLEX_INT
190 %token <typed_val_float> FLOAT COMPLEX_FLOAT
191
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. */
199
200 %token <tsval> STRING
201 %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */
202 %token SELECTOR /* ObjC "@selector" pseudo-operator */
203 %token <tsval> CHAR
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
213
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. */
217 %token OBJC_LBRAC
218
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. */
223
224 %token <ssym> NAME_OR_INT
225
226 %token OPERATOR
227 %token STRUCT CLASS UNION ENUM SIZEOF ALIGNOF UNSIGNED COLONCOLON
228 %token TEMPLATE
229 %token ERROR
230 %token NEW DELETE
231 %type <sval> oper
232 %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
233 %token ENTRY
234 %token TYPEOF
235 %token DECLTYPE
236 %token TYPEID
237
238 /* Special type cases, put in to allow the parser to distinguish different
239 legal basetypes. */
240 %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
241 %token RESTRICT ATOMIC
242 %token FLOAT_KEYWORD COMPLEX
243
244 %token <sval> DOLLAR_VARIABLE
245
246 %token <opcode> ASSIGN_MODIFY
247
248 /* C++ */
249 %token TRUEKEYWORD
250 %token FALSEKEYWORD
251
252
253 %left ','
254 %left ABOVE_COMMA
255 %right '=' ASSIGN_MODIFY
256 %right '?'
257 %left OROR
258 %left ANDAND
259 %left '|'
260 %left '^'
261 %left '&'
262 %left EQUAL NOTEQUAL
263 %left '<' '>' LEQ GEQ
264 %left LSH RSH
265 %left '@'
266 %left '+' '-'
267 %left '*' '/' '%'
268 %right UNARY INCREMENT DECREMENT
269 %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '('
270 %token <ssym> BLOCKNAME
271 %token <bval> FILENAME
272 %type <bval> block
273 %left COLONCOLON
274
275 %token DOTDOTDOT
276
277 \f
278 %%
279
280 start : exp1
281 | type_exp
282 ;
283
284 type_exp: type
285 {
286 pstate->push_new<type_operation> ($1);
287 }
288 | TYPEOF '(' exp ')'
289 {
290 pstate->wrap<typeof_operation> ();
291 }
292 | TYPEOF '(' type ')'
293 {
294 pstate->push_new<type_operation> ($3);
295 }
296 | DECLTYPE '(' exp ')'
297 {
298 pstate->wrap<decltype_operation> ();
299 }
300 ;
301
302 /* Expressions, including the comma operator. */
303 exp1 : exp
304 | exp1 ',' exp
305 { pstate->wrap2<comma_operation> (); }
306 ;
307
308 /* Expressions, not including the comma operator. */
309 exp : '*' exp %prec UNARY
310 { pstate->wrap<unop_ind_operation> (); }
311 ;
312
313 exp : '&' exp %prec UNARY
314 { pstate->wrap<unop_addr_operation> (); }
315 ;
316
317 exp : '-' exp %prec UNARY
318 { pstate->wrap<unary_neg_operation> (); }
319 ;
320
321 exp : '+' exp %prec UNARY
322 { pstate->wrap<unary_plus_operation> (); }
323 ;
324
325 exp : '!' exp %prec UNARY
326 {
327 if (pstate->language ()->la_language
328 == language_opencl)
329 pstate->wrap<opencl_not_operation> ();
330 else
331 pstate->wrap<unary_logical_not_operation> ();
332 }
333 ;
334
335 exp : '~' exp %prec UNARY
336 { pstate->wrap<unary_complement_operation> (); }
337 ;
338
339 exp : INCREMENT exp %prec UNARY
340 { pstate->wrap<preinc_operation> (); }
341 ;
342
343 exp : DECREMENT exp %prec UNARY
344 { pstate->wrap<predec_operation> (); }
345 ;
346
347 exp : exp INCREMENT %prec UNARY
348 { pstate->wrap<postinc_operation> (); }
349 ;
350
351 exp : exp DECREMENT %prec UNARY
352 { pstate->wrap<postdec_operation> (); }
353 ;
354
355 exp : TYPEID '(' exp ')' %prec UNARY
356 { pstate->wrap<typeid_operation> (); }
357 ;
358
359 exp : TYPEID '(' type_exp ')' %prec UNARY
360 { pstate->wrap<typeid_operation> (); }
361 ;
362
363 exp : SIZEOF exp %prec UNARY
364 { pstate->wrap<unop_sizeof_operation> (); }
365 ;
366
367 exp : ALIGNOF '(' type_exp ')' %prec UNARY
368 { pstate->wrap<unop_alignof_operation> (); }
369 ;
370
371 exp : exp ARROW field_name
372 {
373 pstate->push_new<structop_ptr_operation>
374 (pstate->pop (), copy_name ($3));
375 }
376 ;
377
378 exp : exp ARROW field_name COMPLETE
379 {
380 structop_base_operation *op
381 = new structop_ptr_operation (pstate->pop (),
382 copy_name ($3));
383 pstate->mark_struct_expression (op);
384 pstate->push (operation_up (op));
385 }
386 ;
387
388 exp : exp ARROW COMPLETE
389 {
390 structop_base_operation *op
391 = new structop_ptr_operation (pstate->pop (), "");
392 pstate->mark_struct_expression (op);
393 pstate->push (operation_up (op));
394 }
395 ;
396
397 exp : exp ARROW '~' name
398 {
399 pstate->push_new<structop_ptr_operation>
400 (pstate->pop (), "~" + copy_name ($4));
401 }
402 ;
403
404 exp : exp ARROW '~' name COMPLETE
405 {
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));
411 }
412 ;
413
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> (); }
420 ;
421
422 exp : exp ARROW_STAR exp
423 { pstate->wrap2<structop_mptr_operation> (); }
424 ;
425
426 exp : exp '.' field_name
427 {
428 if (pstate->language ()->la_language
429 == language_opencl)
430 pstate->push_new<opencl_structop_operation>
431 (pstate->pop (), copy_name ($3));
432 else
433 pstate->push_new<structop_operation>
434 (pstate->pop (), copy_name ($3));
435 }
436 ;
437
438 exp : exp '.' field_name COMPLETE
439 {
440 structop_base_operation *op
441 = new structop_operation (pstate->pop (),
442 copy_name ($3));
443 pstate->mark_struct_expression (op);
444 pstate->push (operation_up (op));
445 }
446 ;
447
448 exp : exp '.' COMPLETE
449 {
450 structop_base_operation *op
451 = new structop_operation (pstate->pop (), "");
452 pstate->mark_struct_expression (op);
453 pstate->push (operation_up (op));
454 }
455 ;
456
457 exp : exp '.' '~' name
458 {
459 pstate->push_new<structop_operation>
460 (pstate->pop (), "~" + copy_name ($4));
461 }
462 ;
463
464 exp : exp '.' '~' name COMPLETE
465 {
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));
471 }
472 ;
473
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> (); }
480 ;
481
482 exp : exp DOT_STAR exp
483 { pstate->wrap2<structop_member_operation> (); }
484 ;
485
486 exp : exp '[' exp1 ']'
487 { pstate->wrap2<subscript_operation> (); }
488 ;
489
490 exp : exp OBJC_LBRAC exp1 ']'
491 { pstate->wrap2<subscript_operation> (); }
492 ;
493
494 /*
495 * The rules below parse ObjC message calls of the form:
496 * '[' target selector {':' argument}* ']'
497 */
498
499 exp : OBJC_LBRAC TYPENAME
500 {
501 CORE_ADDR theclass;
502
503 std::string copy = copy_name ($2.stoken);
504 theclass = lookup_objc_class (pstate->gdbarch (),
505 copy.c_str ());
506 if (theclass == 0)
507 error (_("%s is not an ObjC Class"),
508 copy.c_str ());
509 pstate->push_new<long_const_operation>
510 (parse_type (pstate)->builtin_int,
511 (LONGEST) theclass);
512 start_msglist();
513 }
514 msglist ']'
515 { end_msglist (pstate); }
516 ;
517
518 exp : OBJC_LBRAC CLASSNAME
519 {
520 pstate->push_new<long_const_operation>
521 (parse_type (pstate)->builtin_int,
522 (LONGEST) $2.theclass);
523 start_msglist();
524 }
525 msglist ']'
526 { end_msglist (pstate); }
527 ;
528
529 exp : OBJC_LBRAC exp
530 { start_msglist(); }
531 msglist ']'
532 { end_msglist (pstate); }
533 ;
534
535 msglist : name
536 { add_msglist(&$1, 0); }
537 | msgarglist
538 ;
539
540 msgarglist : msgarg
541 | msgarglist msgarg
542 ;
543
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); }
550 ;
551
552 exp : exp '('
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
557 {
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));
562 }
563 ;
564
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
569 {
570 pstate->push_new<funcall_operation>
571 (pstate->pop (), std::vector<operation_up> ());
572 }
573 ;
574
575
576 exp : UNKNOWN_CPP_NAME '('
577 {
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 ();
583 }
584 arglist ')' %prec ARROW
585 {
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,
591 std::move (args));
592 }
593 ;
594
595 lcurly : '{'
596 { pstate->start_arglist (); }
597 ;
598
599 arglist :
600 ;
601
602 arglist : exp
603 { pstate->arglist_len = 1; }
604 ;
605
606 arglist : arglist ',' exp %prec ABOVE_COMMA
607 { pstate->arglist_len++; }
608 ;
609
610 function_method: exp '(' parameter_typelist ')' const_or_volatile
611 {
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),
621 pstate->pop ());
622 }
623 ;
624
625 function_method_void: exp '(' ')' const_or_volatile
626 {
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 ());
632 }
633 ;
634
635 exp : function_method
636 ;
637
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
641 ambiguity. */
642 function_method_void_or_typelist: function_method
643 | function_method_void
644 ;
645
646 exp : function_method_void_or_typelist COLONCOLON name
647 {
648 pstate->push_new<func_static_var_operation>
649 (pstate->pop (), copy_name ($3));
650 }
651 ;
652
653 rcurly : '}'
654 { $$ = pstate->end_arglist () - 1; }
655 ;
656 exp : lcurly arglist rcurly %prec ARROW
657 {
658 std::vector<operation_up> args
659 = pstate->pop_vector ($3 + 1);
660 pstate->push_new<array_operation> (0, $3,
661 std::move (args));
662 }
663 ;
664
665 exp : lcurly type_exp rcurly exp %prec UNARY
666 { pstate->wrap2<unop_memval_type_operation> (); }
667 ;
668
669 exp : '(' type_exp ')' exp %prec UNARY
670 {
671 if (pstate->language ()->la_language
672 == language_opencl)
673 pstate->wrap2<opencl_cast_type_operation> ();
674 else
675 pstate->wrap2<unop_cast_type_operation> ();
676 }
677 ;
678
679 exp : '(' exp1 ')'
680 { }
681 ;
682
683 /* Binary operators in order of decreasing precedence. */
684
685 exp : exp '@' exp
686 { pstate->wrap2<repeat_operation> (); }
687 ;
688
689 exp : exp '*' exp
690 { pstate->wrap2<mul_operation> (); }
691 ;
692
693 exp : exp '/' exp
694 { pstate->wrap2<div_operation> (); }
695 ;
696
697 exp : exp '%' exp
698 { pstate->wrap2<rem_operation> (); }
699 ;
700
701 exp : exp '+' exp
702 { pstate->wrap2<add_operation> (); }
703 ;
704
705 exp : exp '-' exp
706 { pstate->wrap2<sub_operation> (); }
707 ;
708
709 exp : exp LSH exp
710 { pstate->wrap2<lsh_operation> (); }
711 ;
712
713 exp : exp RSH exp
714 { pstate->wrap2<rsh_operation> (); }
715 ;
716
717 exp : exp EQUAL exp
718 {
719 if (pstate->language ()->la_language
720 == language_opencl)
721 pstate->wrap2<opencl_equal_operation> ();
722 else
723 pstate->wrap2<equal_operation> ();
724 }
725 ;
726
727 exp : exp NOTEQUAL exp
728 {
729 if (pstate->language ()->la_language
730 == language_opencl)
731 pstate->wrap2<opencl_notequal_operation> ();
732 else
733 pstate->wrap2<notequal_operation> ();
734 }
735 ;
736
737 exp : exp LEQ exp
738 {
739 if (pstate->language ()->la_language
740 == language_opencl)
741 pstate->wrap2<opencl_leq_operation> ();
742 else
743 pstate->wrap2<leq_operation> ();
744 }
745 ;
746
747 exp : exp GEQ exp
748 {
749 if (pstate->language ()->la_language
750 == language_opencl)
751 pstate->wrap2<opencl_geq_operation> ();
752 else
753 pstate->wrap2<geq_operation> ();
754 }
755 ;
756
757 exp : exp '<' exp
758 {
759 if (pstate->language ()->la_language
760 == language_opencl)
761 pstate->wrap2<opencl_less_operation> ();
762 else
763 pstate->wrap2<less_operation> ();
764 }
765 ;
766
767 exp : exp '>' exp
768 {
769 if (pstate->language ()->la_language
770 == language_opencl)
771 pstate->wrap2<opencl_gtr_operation> ();
772 else
773 pstate->wrap2<gtr_operation> ();
774 }
775 ;
776
777 exp : exp '&' exp
778 { pstate->wrap2<bitwise_and_operation> (); }
779 ;
780
781 exp : exp '^' exp
782 { pstate->wrap2<bitwise_xor_operation> (); }
783 ;
784
785 exp : exp '|' exp
786 { pstate->wrap2<bitwise_ior_operation> (); }
787 ;
788
789 exp : exp ANDAND exp
790 {
791 if (pstate->language ()->la_language
792 == language_opencl)
793 {
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),
798 std::move (rhs));
799 }
800 else
801 pstate->wrap2<logical_and_operation> ();
802 }
803 ;
804
805 exp : exp OROR exp
806 {
807 if (pstate->language ()->la_language
808 == language_opencl)
809 {
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),
814 std::move (rhs));
815 }
816 else
817 pstate->wrap2<logical_or_operation> ();
818 }
819 ;
820
821 exp : exp '?' exp ':' exp %prec '?'
822 {
823 operation_up last = pstate->pop ();
824 operation_up mid = pstate->pop ();
825 operation_up first = pstate->pop ();
826 if (pstate->language ()->la_language
827 == language_opencl)
828 pstate->push_new<opencl_ternop_cond_operation>
829 (std::move (first), std::move (mid),
830 std::move (last));
831 else
832 pstate->push_new<ternop_cond_operation>
833 (std::move (first), std::move (mid),
834 std::move (last));
835 }
836 ;
837
838 exp : exp '=' exp
839 {
840 if (pstate->language ()->la_language
841 == language_opencl)
842 pstate->wrap2<opencl_assign_operation> ();
843 else
844 pstate->wrap2<assign_operation> ();
845 }
846 ;
847
848 exp : exp ASSIGN_MODIFY exp
849 {
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));
854 }
855 ;
856
857 exp : INT
858 {
859 pstate->push_new<long_const_operation>
860 ($1.type, $1.val);
861 }
862 ;
863
864 exp : COMPLEX_INT
865 {
866 operation_up real
867 = (make_operation<long_const_operation>
868 (TYPE_TARGET_TYPE ($1.type), 0));
869 operation_up imag
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);
874 }
875 ;
876
877 exp : CHAR
878 {
879 struct stoken_vector vec;
880 vec.len = 1;
881 vec.tokens = &$1;
882 pstate->push_c_string ($1.type, &vec);
883 }
884 ;
885
886 exp : NAME_OR_INT
887 { YYSTYPE val;
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);
893 }
894 ;
895
896
897 exp : FLOAT
898 {
899 float_data data;
900 std::copy (std::begin ($1.val), std::end ($1.val),
901 std::begin (data));
902 pstate->push_new<float_const_operation> ($1.type, data);
903 }
904 ;
905
906 exp : COMPLEX_FLOAT
907 {
908 struct type *underlying
909 = TYPE_TARGET_TYPE ($1.type);
910
911 float_data val;
912 target_float_from_host_double (val.data (),
913 underlying, 0);
914 operation_up real
915 = (make_operation<float_const_operation>
916 (underlying, val));
917
918 std::copy (std::begin ($1.val), std::end ($1.val),
919 std::begin (val));
920 operation_up imag
921 = (make_operation<float_const_operation>
922 (underlying, val));
923
924 pstate->push_new<complex_operation>
925 (std::move (real), std::move (imag),
926 $1.type);
927 }
928 ;
929
930 exp : variable
931 ;
932
933 exp : DOLLAR_VARIABLE
934 {
935 pstate->push_dollar ($1);
936 }
937 ;
938
939 exp : SELECTOR '(' name ')'
940 {
941 pstate->push_new<objc_selector_operation>
942 (copy_name ($3));
943 }
944 ;
945
946 exp : SIZEOF '(' type ')' %prec UNARY
947 { struct type *type = $3;
948 struct type *int_type
949 = lookup_signed_typename (pstate->language (),
950 "int");
951 type = check_typedef (type);
952
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));
961 }
962 ;
963
964 exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
965 { pstate->wrap2<reinterpret_cast_operation> (); }
966 ;
967
968 exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
969 { pstate->wrap2<unop_cast_type_operation> (); }
970 ;
971
972 exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
973 { pstate->wrap2<dynamic_cast_operation> (); }
974 ;
975
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> (); }
980 ;
981
982 string_exp:
983 STRING
984 {
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
989 lexer. */
990 struct typed_stoken *vec = XNEW (struct typed_stoken);
991 $$.len = 1;
992 $$.tokens = vec;
993
994 vec->type = $1.type;
995 vec->length = $1.length;
996 vec->ptr = (char *) malloc ($1.length + 1);
997 memcpy (vec->ptr, $1.ptr, $1.length + 1);
998 }
999
1000 | string_exp STRING
1001 {
1002 /* Note that we NUL-terminate here, but just
1003 for convenience. */
1004 char *p;
1005 ++$$.len;
1006 $$.tokens = XRESIZEVEC (struct typed_stoken,
1007 $$.tokens, $$.len);
1008
1009 p = (char *) malloc ($2.length + 1);
1010 memcpy (p, $2.ptr, $2.length + 1);
1011
1012 $$.tokens[$$.len - 1].type = $2.type;
1013 $$.tokens[$$.len - 1].length = $2.length;
1014 $$.tokens[$$.len - 1].ptr = p;
1015 }
1016 ;
1017
1018 exp : string_exp
1019 {
1020 int i;
1021 c_string_type type = C_STRING;
1022
1023 for (i = 0; i < $1.len; ++i)
1024 {
1025 switch ($1.tokens[i].type)
1026 {
1027 case C_STRING:
1028 break;
1029 case C_WIDE_STRING:
1030 case C_STRING_16:
1031 case C_STRING_32:
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;
1036 break;
1037 default:
1038 /* internal error */
1039 internal_error (__FILE__, __LINE__,
1040 "unrecognized type in string concatenation");
1041 }
1042 }
1043
1044 pstate->push_c_string (type, &$1);
1045 for (i = 0; i < $1.len; ++i)
1046 free ($1.tokens[i].ptr);
1047 free ($1.tokens);
1048 }
1049 ;
1050
1051 exp : NSSTRING /* ObjC NextStep NSString constant
1052 * of the form '@' '"' string '"'.
1053 */
1054 {
1055 pstate->push_new<objc_nsstring_operation>
1056 (copy_name ($1));
1057 }
1058 ;
1059
1060 /* C++. */
1061 exp : TRUEKEYWORD
1062 { pstate->push_new<long_const_operation>
1063 (parse_type (pstate)->builtin_bool, 1);
1064 }
1065 ;
1066
1067 exp : FALSEKEYWORD
1068 { pstate->push_new<long_const_operation>
1069 (parse_type (pstate)->builtin_bool, 0);
1070 }
1071 ;
1072
1073 /* end of C++. */
1074
1075 block : BLOCKNAME
1076 {
1077 if ($1.sym.symbol)
1078 $$ = $1.sym.symbol->value_block ();
1079 else
1080 error (_("No file or function \"%s\"."),
1081 copy_name ($1.stoken).c_str ());
1082 }
1083 | FILENAME
1084 {
1085 $$ = $1;
1086 }
1087 ;
1088
1089 block : block COLONCOLON name
1090 {
1091 std::string copy = copy_name ($3);
1092 struct symbol *tem
1093 = lookup_symbol (copy.c_str (), $1,
1094 VAR_DOMAIN, NULL).symbol;
1095
1096 if (!tem || tem->aclass () != LOC_BLOCK)
1097 error (_("No function \"%s\" in specified context."),
1098 copy.c_str ());
1099 $$ = tem->value_block (); }
1100 ;
1101
1102 variable: name_not_typename ENTRY
1103 { struct symbol *sym = $1.sym.symbol;
1104
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 ());
1110
1111 pstate->push_new<var_entry_value_operation> (sym);
1112 }
1113 ;
1114
1115 variable: block COLONCOLON name
1116 {
1117 std::string copy = copy_name ($3);
1118 struct block_symbol sym
1119 = lookup_symbol (copy.c_str (), $1,
1120 VAR_DOMAIN, NULL);
1121
1122 if (sym.symbol == 0)
1123 error (_("No symbol \"%s\" in specified context."),
1124 copy.c_str ());
1125 if (symbol_read_needs_frame (sym.symbol))
1126 pstate->block_tracker->update (sym);
1127
1128 pstate->push_new<var_value_operation> (sym);
1129 }
1130 ;
1131
1132 qualified_name: TYPENAME COLONCOLON name
1133 {
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));
1139
1140 pstate->push_new<scope_operation> (type,
1141 copy_name ($3));
1142 }
1143 | TYPENAME COLONCOLON '~' name
1144 {
1145 struct type *type = $1.type;
1146
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,
1152 $4.length);
1153
1154 /* Check for valid destructor name. */
1155 destructor_name_p (name.c_str (), $1.type);
1156 pstate->push_new<scope_operation> (type,
1157 std::move (name));
1158 }
1159 | TYPENAME COLONCOLON name COLONCOLON name
1160 {
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));
1165 }
1166 ;
1167
1168 variable: qualified_name
1169 | COLONCOLON name_not_typename
1170 {
1171 std::string name = copy_name ($2.stoken);
1172 struct block_symbol sym
1173 = lookup_symbol (name.c_str (),
1174 (const struct block *) NULL,
1175 VAR_DOMAIN, NULL);
1176 pstate->push_symbol (name.c_str (), sym);
1177 }
1178 ;
1179
1180 variable: name_not_typename
1181 { struct block_symbol sym = $1.sym;
1182
1183 if (sym.symbol)
1184 {
1185 if (symbol_read_needs_frame (sym.symbol))
1186 pstate->block_tracker->update (sym);
1187
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. */
1192
1193 bound_minimal_symbol resolver
1194 = find_gnu_ifunc (sym.symbol);
1195 if (resolver.minsym != NULL)
1196 pstate->push_new<var_msym_value_operation>
1197 (resolver);
1198 else
1199 pstate->push_new<var_value_operation> (sym);
1200 }
1201 else if ($1.is_a_field_of_this)
1202 {
1203 /* C++: it hangs off of `this'. Must
1204 not inadvertently convert from a method call
1205 to data ref. */
1206 pstate->block_tracker->update (sym);
1207 operation_up thisop
1208 = make_operation<op_this_operation> ();
1209 pstate->push_new<structop_ptr_operation>
1210 (std::move (thisop), copy_name ($1.stoken));
1211 }
1212 else
1213 {
1214 std::string arg = copy_name ($1.stoken);
1215
1216 bound_minimal_symbol msymbol
1217 = lookup_bound_minimal_symbol (arg.c_str ());
1218 if (msymbol.minsym == NULL)
1219 {
1220 if (!have_full_symbols () && !have_partial_symbols ())
1221 error (_("No symbol table is loaded. Use the \"file\" command."));
1222 else
1223 error (_("No symbol \"%s\" in current context."),
1224 arg.c_str ());
1225 }
1226
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)
1238 : NULL);
1239 if (alias_target != NULL)
1240 {
1241 block_symbol bsym { alias_target,
1242 alias_target->value_block () };
1243 pstate->push_new<var_value_operation> (bsym);
1244 }
1245 else
1246 pstate->push_new<var_msym_value_operation>
1247 (msymbol);
1248 }
1249 }
1250 ;
1251
1252 const_or_volatile: const_or_volatile_noopt
1253 |
1254 ;
1255
1256 single_qualifier:
1257 CONST_KEYWORD
1258 { cpstate->type_stack.insert (tp_const); }
1259 | VOLATILE_KEYWORD
1260 { cpstate->type_stack.insert (tp_volatile); }
1261 | ATOMIC
1262 { cpstate->type_stack.insert (tp_atomic); }
1263 | RESTRICT
1264 { cpstate->type_stack.insert (tp_restrict); }
1265 | '@' NAME
1266 {
1267 cpstate->type_stack.insert (pstate,
1268 copy_name ($2.stoken).c_str ());
1269 }
1270 | '@' UNKNOWN_CPP_NAME
1271 {
1272 cpstate->type_stack.insert (pstate,
1273 copy_name ($2.stoken).c_str ());
1274 }
1275 ;
1276
1277 qualifier_seq_noopt:
1278 single_qualifier
1279 | qualifier_seq_noopt single_qualifier
1280 ;
1281
1282 qualifier_seq:
1283 qualifier_seq_noopt
1284 |
1285 ;
1286
1287 ptr_operator:
1288 ptr_operator '*'
1289 { cpstate->type_stack.insert (tp_pointer); }
1290 qualifier_seq
1291 | '*'
1292 { cpstate->type_stack.insert (tp_pointer); }
1293 qualifier_seq
1294 | '&'
1295 { cpstate->type_stack.insert (tp_reference); }
1296 | '&' ptr_operator
1297 { cpstate->type_stack.insert (tp_reference); }
1298 | ANDAND
1299 { cpstate->type_stack.insert (tp_rvalue_reference); }
1300 | ANDAND ptr_operator
1301 { cpstate->type_stack.insert (tp_rvalue_reference); }
1302 ;
1303
1304 ptr_operator_ts: ptr_operator
1305 {
1306 $$ = cpstate->type_stack.create ();
1307 cpstate->type_stacks.emplace_back ($$);
1308 }
1309 ;
1310
1311 abs_decl: ptr_operator_ts direct_abs_decl
1312 { $$ = $2->append ($1); }
1313 | ptr_operator_ts
1314 | direct_abs_decl
1315 ;
1316
1317 direct_abs_decl: '(' abs_decl ')'
1318 { $$ = $2; }
1319 | direct_abs_decl array_mod
1320 {
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 ($$);
1326 }
1327 | array_mod
1328 {
1329 cpstate->type_stack.push ($1);
1330 cpstate->type_stack.push (tp_array);
1331 $$ = cpstate->type_stack.create ();
1332 cpstate->type_stacks.emplace_back ($$);
1333 }
1334
1335 | direct_abs_decl func_mod
1336 {
1337 cpstate->type_stack.push ($1);
1338 cpstate->type_stack.push ($2);
1339 $$ = cpstate->type_stack.create ();
1340 cpstate->type_stacks.emplace_back ($$);
1341 }
1342 | func_mod
1343 {
1344 cpstate->type_stack.push ($1);
1345 $$ = cpstate->type_stack.create ();
1346 cpstate->type_stacks.emplace_back ($$);
1347 }
1348 ;
1349
1350 array_mod: '[' ']'
1351 { $$ = -1; }
1352 | OBJC_LBRAC ']'
1353 { $$ = -1; }
1354 | '[' INT ']'
1355 { $$ = $2.val; }
1356 | OBJC_LBRAC INT ']'
1357 { $$ = $2.val; }
1358 ;
1359
1360 func_mod: '(' ')'
1361 {
1362 $$ = new std::vector<struct type *>;
1363 cpstate->type_lists.emplace_back ($$);
1364 }
1365 | '(' parameter_typelist ')'
1366 { $$ = $2; }
1367 ;
1368
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! */
1376
1377 type : ptype
1378 ;
1379
1380 /* A helper production that recognizes scalar types that can validly
1381 be used with _Complex. */
1382
1383 scalar_type:
1384 INT_KEYWORD
1385 { $$ = lookup_signed_typename (pstate->language (),
1386 "int"); }
1387 | LONG
1388 { $$ = lookup_signed_typename (pstate->language (),
1389 "long"); }
1390 | SHORT
1391 { $$ = lookup_signed_typename (pstate->language (),
1392 "short"); }
1393 | LONG INT_KEYWORD
1394 { $$ = lookup_signed_typename (pstate->language (),
1395 "long"); }
1396 | LONG SIGNED_KEYWORD INT_KEYWORD
1397 { $$ = lookup_signed_typename (pstate->language (),
1398 "long"); }
1399 | LONG SIGNED_KEYWORD
1400 { $$ = lookup_signed_typename (pstate->language (),
1401 "long"); }
1402 | SIGNED_KEYWORD LONG INT_KEYWORD
1403 { $$ = lookup_signed_typename (pstate->language (),
1404 "long"); }
1405 | UNSIGNED LONG INT_KEYWORD
1406 { $$ = lookup_unsigned_typename (pstate->language (),
1407 "long"); }
1408 | LONG UNSIGNED INT_KEYWORD
1409 { $$ = lookup_unsigned_typename (pstate->language (),
1410 "long"); }
1411 | LONG UNSIGNED
1412 { $$ = lookup_unsigned_typename (pstate->language (),
1413 "long"); }
1414 | LONG LONG
1415 { $$ = lookup_signed_typename (pstate->language (),
1416 "long long"); }
1417 | LONG LONG INT_KEYWORD
1418 { $$ = lookup_signed_typename (pstate->language (),
1419 "long long"); }
1420 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1421 { $$ = lookup_signed_typename (pstate->language (),
1422 "long long"); }
1423 | LONG LONG SIGNED_KEYWORD
1424 { $$ = lookup_signed_typename (pstate->language (),
1425 "long long"); }
1426 | SIGNED_KEYWORD LONG LONG
1427 { $$ = lookup_signed_typename (pstate->language (),
1428 "long long"); }
1429 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1430 { $$ = lookup_signed_typename (pstate->language (),
1431 "long long"); }
1432 | UNSIGNED LONG LONG
1433 { $$ = lookup_unsigned_typename (pstate->language (),
1434 "long long"); }
1435 | UNSIGNED LONG LONG INT_KEYWORD
1436 { $$ = lookup_unsigned_typename (pstate->language (),
1437 "long long"); }
1438 | LONG LONG UNSIGNED
1439 { $$ = lookup_unsigned_typename (pstate->language (),
1440 "long long"); }
1441 | LONG LONG UNSIGNED INT_KEYWORD
1442 { $$ = lookup_unsigned_typename (pstate->language (),
1443 "long long"); }
1444 | SHORT INT_KEYWORD
1445 { $$ = lookup_signed_typename (pstate->language (),
1446 "short"); }
1447 | SHORT SIGNED_KEYWORD INT_KEYWORD
1448 { $$ = lookup_signed_typename (pstate->language (),
1449 "short"); }
1450 | SHORT SIGNED_KEYWORD
1451 { $$ = lookup_signed_typename (pstate->language (),
1452 "short"); }
1453 | UNSIGNED SHORT INT_KEYWORD
1454 { $$ = lookup_unsigned_typename (pstate->language (),
1455 "short"); }
1456 | SHORT UNSIGNED
1457 { $$ = lookup_unsigned_typename (pstate->language (),
1458 "short"); }
1459 | SHORT UNSIGNED INT_KEYWORD
1460 { $$ = lookup_unsigned_typename (pstate->language (),
1461 "short"); }
1462 | DOUBLE_KEYWORD
1463 { $$ = lookup_typename (pstate->language (),
1464 "double",
1465 NULL,
1466 0); }
1467 | FLOAT_KEYWORD
1468 { $$ = lookup_typename (pstate->language (),
1469 "float",
1470 NULL,
1471 0); }
1472 | LONG DOUBLE_KEYWORD
1473 { $$ = lookup_typename (pstate->language (),
1474 "long double",
1475 NULL,
1476 0); }
1477 | UNSIGNED type_name
1478 { $$ = lookup_unsigned_typename (pstate->language (),
1479 $2.type->name ()); }
1480 | UNSIGNED
1481 { $$ = lookup_unsigned_typename (pstate->language (),
1482 "int"); }
1483 | SIGNED_KEYWORD type_name
1484 { $$ = lookup_signed_typename (pstate->language (),
1485 $2.type->name ()); }
1486 | SIGNED_KEYWORD
1487 { $$ = lookup_signed_typename (pstate->language (),
1488 "int"); }
1489 ;
1490
1491 /* Implements (approximately): (type-qualifier)* type-specifier.
1492
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
1500 recognised here. */
1501 typebase
1502 : TYPENAME
1503 { $$ = $1.type; }
1504 | scalar_type
1505 { $$ = $1; }
1506 | COMPLEX scalar_type
1507 {
1508 $$ = init_complex_type (nullptr, $2);
1509 }
1510 | STRUCT name
1511 { $$
1512 = lookup_struct (copy_name ($2).c_str (),
1513 pstate->expression_context_block);
1514 }
1515 | STRUCT COMPLETE
1516 {
1517 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1518 "", 0);
1519 $$ = NULL;
1520 }
1521 | STRUCT name COMPLETE
1522 {
1523 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1524 $2.ptr, $2.length);
1525 $$ = NULL;
1526 }
1527 | CLASS name
1528 { $$ = lookup_struct
1529 (copy_name ($2).c_str (),
1530 pstate->expression_context_block);
1531 }
1532 | CLASS COMPLETE
1533 {
1534 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1535 "", 0);
1536 $$ = NULL;
1537 }
1538 | CLASS name COMPLETE
1539 {
1540 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1541 $2.ptr, $2.length);
1542 $$ = NULL;
1543 }
1544 | UNION name
1545 { $$
1546 = lookup_union (copy_name ($2).c_str (),
1547 pstate->expression_context_block);
1548 }
1549 | UNION COMPLETE
1550 {
1551 pstate->mark_completion_tag (TYPE_CODE_UNION,
1552 "", 0);
1553 $$ = NULL;
1554 }
1555 | UNION name COMPLETE
1556 {
1557 pstate->mark_completion_tag (TYPE_CODE_UNION,
1558 $2.ptr, $2.length);
1559 $$ = NULL;
1560 }
1561 | ENUM name
1562 { $$ = lookup_enum (copy_name ($2).c_str (),
1563 pstate->expression_context_block);
1564 }
1565 | ENUM COMPLETE
1566 {
1567 pstate->mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1568 $$ = NULL;
1569 }
1570 | ENUM name COMPLETE
1571 {
1572 pstate->mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1573 $2.length);
1574 $$ = NULL;
1575 }
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);
1583 }
1584 | qualifier_seq_noopt typebase
1585 { $$ = cpstate->type_stack.follow_types ($2); }
1586 | typebase qualifier_seq_noopt
1587 { $$ = cpstate->type_stack.follow_types ($1); }
1588 ;
1589
1590 type_name: TYPENAME
1591 | INT_KEYWORD
1592 {
1593 $$.stoken.ptr = "int";
1594 $$.stoken.length = 3;
1595 $$.type = lookup_signed_typename (pstate->language (),
1596 "int");
1597 }
1598 | LONG
1599 {
1600 $$.stoken.ptr = "long";
1601 $$.stoken.length = 4;
1602 $$.type = lookup_signed_typename (pstate->language (),
1603 "long");
1604 }
1605 | SHORT
1606 {
1607 $$.stoken.ptr = "short";
1608 $$.stoken.length = 5;
1609 $$.type = lookup_signed_typename (pstate->language (),
1610 "short");
1611 }
1612 ;
1613
1614 parameter_typelist:
1615 nonempty_typelist
1616 { check_parameter_typelist ($1); }
1617 | nonempty_typelist ',' DOTDOTDOT
1618 {
1619 $1->push_back (NULL);
1620 check_parameter_typelist ($1);
1621 $$ = $1;
1622 }
1623 ;
1624
1625 nonempty_typelist
1626 : type
1627 {
1628 std::vector<struct type *> *typelist
1629 = new std::vector<struct type *>;
1630 cpstate->type_lists.emplace_back (typelist);
1631
1632 typelist->push_back ($1);
1633 $$ = typelist;
1634 }
1635 | nonempty_typelist ',' type
1636 {
1637 $1->push_back ($3);
1638 $$ = $1;
1639 }
1640 ;
1641
1642 ptype : typebase
1643 | ptype abs_decl
1644 {
1645 cpstate->type_stack.push ($2);
1646 $$ = cpstate->type_stack.follow_types ($1);
1647 }
1648 ;
1649
1650 conversion_type_id: typebase conversion_declarator
1651 { $$ = cpstate->type_stack.follow_types ($1); }
1652 ;
1653
1654 conversion_declarator: /* Nothing. */
1655 | ptr_operator conversion_declarator
1656 ;
1657
1658 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1659 | VOLATILE_KEYWORD CONST_KEYWORD
1660 ;
1661
1662 const_or_volatile_noopt: const_and_volatile
1663 { cpstate->type_stack.insert (tp_const);
1664 cpstate->type_stack.insert (tp_volatile);
1665 }
1666 | CONST_KEYWORD
1667 { cpstate->type_stack.insert (tp_const); }
1668 | VOLATILE_KEYWORD
1669 { cpstate->type_stack.insert (tp_volatile); }
1670 ;
1671
1672 oper: OPERATOR NEW
1673 { $$ = operator_stoken (" new"); }
1674 | OPERATOR DELETE
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[]"); }
1684 | OPERATOR '+'
1685 { $$ = operator_stoken ("+"); }
1686 | OPERATOR '-'
1687 { $$ = operator_stoken ("-"); }
1688 | OPERATOR '*'
1689 { $$ = operator_stoken ("*"); }
1690 | OPERATOR '/'
1691 { $$ = operator_stoken ("/"); }
1692 | OPERATOR '%'
1693 { $$ = operator_stoken ("%"); }
1694 | OPERATOR '^'
1695 { $$ = operator_stoken ("^"); }
1696 | OPERATOR '&'
1697 { $$ = operator_stoken ("&"); }
1698 | OPERATOR '|'
1699 { $$ = operator_stoken ("|"); }
1700 | OPERATOR '~'
1701 { $$ = operator_stoken ("~"); }
1702 | OPERATOR '!'
1703 { $$ = operator_stoken ("!"); }
1704 | OPERATOR '='
1705 { $$ = operator_stoken ("="); }
1706 | OPERATOR '<'
1707 { $$ = operator_stoken ("<"); }
1708 | OPERATOR '>'
1709 { $$ = operator_stoken (">"); }
1710 | OPERATOR ASSIGN_MODIFY
1711 { const char *op = " unknown";
1712 switch ($2)
1713 {
1714 case BINOP_RSH:
1715 op = ">>=";
1716 break;
1717 case BINOP_LSH:
1718 op = "<<=";
1719 break;
1720 case BINOP_ADD:
1721 op = "+=";
1722 break;
1723 case BINOP_SUB:
1724 op = "-=";
1725 break;
1726 case BINOP_MUL:
1727 op = "*=";
1728 break;
1729 case BINOP_DIV:
1730 op = "/=";
1731 break;
1732 case BINOP_REM:
1733 op = "%=";
1734 break;
1735 case BINOP_BITWISE_IOR:
1736 op = "|=";
1737 break;
1738 case BINOP_BITWISE_AND:
1739 op = "&=";
1740 break;
1741 case BINOP_BITWISE_XOR:
1742 op = "^=";
1743 break;
1744 default:
1745 break;
1746 }
1747
1748 $$ = operator_stoken (op);
1749 }
1750 | OPERATOR LSH
1751 { $$ = operator_stoken ("<<"); }
1752 | OPERATOR RSH
1753 { $$ = operator_stoken (">>"); }
1754 | OPERATOR EQUAL
1755 { $$ = operator_stoken ("=="); }
1756 | OPERATOR NOTEQUAL
1757 { $$ = operator_stoken ("!="); }
1758 | OPERATOR LEQ
1759 { $$ = operator_stoken ("<="); }
1760 | OPERATOR GEQ
1761 { $$ = operator_stoken (">="); }
1762 | OPERATOR ANDAND
1763 { $$ = operator_stoken ("&&"); }
1764 | OPERATOR OROR
1765 { $$ = operator_stoken ("||"); }
1766 | OPERATOR INCREMENT
1767 { $$ = operator_stoken ("++"); }
1768 | OPERATOR DECREMENT
1769 { $$ = operator_stoken ("--"); }
1770 | OPERATOR ','
1771 { $$ = operator_stoken (","); }
1772 | OPERATOR ARROW_STAR
1773 { $$ = operator_stoken ("->*"); }
1774 | OPERATOR ARROW
1775 { $$ = operator_stoken ("->"); }
1776 | OPERATOR '(' ')'
1777 { $$ = operator_stoken ("()"); }
1778 | OPERATOR '[' ']'
1779 { $$ = operator_stoken ("[]"); }
1780 | OPERATOR OBJC_LBRAC ']'
1781 { $$ = operator_stoken ("[]"); }
1782 | OPERATOR conversion_type_id
1783 {
1784 string_file buf;
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 ();
1789
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 ());
1796 }
1797 ;
1798
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
1803 'double'. */
1804 field_name
1805 : name
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"); }
1813 ;
1814
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; }
1820 | oper { $$ = $1; }
1821 ;
1822
1823 name_not_typename : NAME
1824 | BLOCKNAME
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.
1830 | NAME_OR_INT
1831 */
1832 | oper
1833 {
1834 struct field_of_this_result is_a_field_of_this;
1835
1836 $$.stoken = $1;
1837 $$.sym
1838 = lookup_symbol ($1.ptr,
1839 pstate->expression_context_block,
1840 VAR_DOMAIN,
1841 &is_a_field_of_this);
1842 $$.is_a_field_of_this
1843 = is_a_field_of_this.type != NULL;
1844 }
1845 | UNKNOWN_CPP_NAME
1846 ;
1847
1848 %%
1849
1850 /* Returns a stoken of the operator name given by OP (which does not
1851 include the string "operator"). */
1852
1853 static struct stoken
1854 operator_stoken (const char *op)
1855 {
1856 struct stoken st = { NULL, 0 };
1857 char *buf;
1858
1859 st.length = CP_OPERATOR_LEN + strlen (op);
1860 buf = (char *) malloc (st.length + 1);
1861 strcpy (buf, CP_OPERATOR_STR);
1862 strcat (buf, op);
1863 st.ptr = buf;
1864
1865 /* The toplevel (c_parse) will free the memory allocated here. */
1866 cpstate->strings.emplace_back (buf);
1867 return st;
1868 };
1869
1870 /* Returns a stoken of the type named TYPE. */
1871
1872 static struct stoken
1873 typename_stoken (const char *type)
1874 {
1875 struct stoken st = { type, 0 };
1876 st.length = strlen (type);
1877 return st;
1878 };
1879
1880 /* Return true if the type is aggregate-like. */
1881
1882 static int
1883 type_aggregate_p (struct type *type)
1884 {
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 ()));
1890 }
1891
1892 /* Validate a parameter typelist. */
1893
1894 static void
1895 check_parameter_typelist (std::vector<struct type *> *params)
1896 {
1897 struct type *type;
1898 int ix;
1899
1900 for (ix = 0; ix < params->size (); ++ix)
1901 {
1902 type = (*params)[ix];
1903 if (type != NULL && check_typedef (type)->code () == TYPE_CODE_VOID)
1904 {
1905 if (ix == 0)
1906 {
1907 if (params->size () == 1)
1908 {
1909 /* Ok. */
1910 break;
1911 }
1912 error (_("parameter types following 'void'"));
1913 }
1914 else
1915 error (_("'void' invalid as parameter type"));
1916 }
1917 }
1918 }
1919
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. */
1923
1924 /*** Needs some error checking for the float case ***/
1925
1926 static int
1927 parse_number (struct parser_state *par_state,
1928 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1929 {
1930 ULONGEST n = 0;
1931 ULONGEST prevn = 0;
1932
1933 int i = 0;
1934 int c;
1935 int base = input_radix;
1936 int unsigned_p = 0;
1937
1938 /* Number of "L" suffixes encountered. */
1939 int long_p = 0;
1940
1941 /* Imaginary number. */
1942 bool imaginary_p = false;
1943
1944 /* We have found a "L" or "U" (or "i") suffix. */
1945 int found_suffix = 0;
1946
1947 char *p;
1948
1949 p = (char *) alloca (len);
1950 memcpy (p, buf, len);
1951
1952 if (parsed_float)
1953 {
1954 if (len >= 1 && p[len - 1] == 'i')
1955 {
1956 imaginary_p = true;
1957 --len;
1958 }
1959
1960 /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */
1961 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1962 {
1963 putithere->typed_val_float.type
1964 = parse_type (par_state)->builtin_decfloat;
1965 len -= 2;
1966 }
1967 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1968 {
1969 putithere->typed_val_float.type
1970 = parse_type (par_state)->builtin_decdouble;
1971 len -= 2;
1972 }
1973 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1974 {
1975 putithere->typed_val_float.type
1976 = parse_type (par_state)->builtin_declong;
1977 len -= 2;
1978 }
1979 /* Handle suffixes: 'f' for float, 'l' for long double. */
1980 else if (len >= 1 && TOLOWER (p[len - 1]) == 'f')
1981 {
1982 putithere->typed_val_float.type
1983 = parse_type (par_state)->builtin_float;
1984 len -= 1;
1985 }
1986 else if (len >= 1 && TOLOWER (p[len - 1]) == 'l')
1987 {
1988 putithere->typed_val_float.type
1989 = parse_type (par_state)->builtin_long_double;
1990 len -= 1;
1991 }
1992 /* Default type for floating-point literals is double. */
1993 else
1994 {
1995 putithere->typed_val_float.type
1996 = parse_type (par_state)->builtin_double;
1997 }
1998
1999 if (!parse_float (p, len,
2000 putithere->typed_val_float.type,
2001 putithere->typed_val_float.val))
2002 return ERROR;
2003
2004 if (imaginary_p)
2005 putithere->typed_val_float.type
2006 = init_complex_type (nullptr, putithere->typed_val_float.type);
2007
2008 return imaginary_p ? COMPLEX_FLOAT : FLOAT;
2009 }
2010
2011 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
2012 if (p[0] == '0' && len > 1)
2013 switch (p[1])
2014 {
2015 case 'x':
2016 case 'X':
2017 if (len >= 3)
2018 {
2019 p += 2;
2020 base = 16;
2021 len -= 2;
2022 }
2023 break;
2024
2025 case 'b':
2026 case 'B':
2027 if (len >= 3)
2028 {
2029 p += 2;
2030 base = 2;
2031 len -= 2;
2032 }
2033 break;
2034
2035 case 't':
2036 case 'T':
2037 case 'd':
2038 case 'D':
2039 if (len >= 3)
2040 {
2041 p += 2;
2042 base = 10;
2043 len -= 2;
2044 }
2045 break;
2046
2047 default:
2048 base = 8;
2049 break;
2050 }
2051
2052 while (len-- > 0)
2053 {
2054 c = *p++;
2055 if (c >= 'A' && c <= 'Z')
2056 c += 'a' - 'A';
2057 if (c != 'l' && c != 'u' && c != 'i')
2058 n *= base;
2059 if (c >= '0' && c <= '9')
2060 {
2061 if (found_suffix)
2062 return ERROR;
2063 n += i = c - '0';
2064 }
2065 else
2066 {
2067 if (base > 10 && c >= 'a' && c <= 'f')
2068 {
2069 if (found_suffix)
2070 return ERROR;
2071 n += i = c - 'a' + 10;
2072 }
2073 else if (c == 'l')
2074 {
2075 ++long_p;
2076 found_suffix = 1;
2077 }
2078 else if (c == 'u')
2079 {
2080 unsigned_p = 1;
2081 found_suffix = 1;
2082 }
2083 else if (c == 'i')
2084 {
2085 imaginary_p = true;
2086 found_suffix = 1;
2087 }
2088 else
2089 return ERROR; /* Char not a digit */
2090 }
2091 if (i >= base)
2092 return ERROR; /* Invalid digit in this base */
2093
2094 if (c != 'l' && c != 'u' && c != 'i')
2095 {
2096 /* Test for overflow. */
2097 if (prevn == 0 && n == 0)
2098 ;
2099 else if (prevn >= n)
2100 error (_("Numeric constant too large."));
2101 }
2102 prevn = n;
2103 }
2104
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 ());
2119 bool have_signed
2120 /* No 'u' suffix. */
2121 = !unsigned_p;
2122 bool have_unsigned
2123 = ((/* 'u' suffix. */
2124 unsigned_p)
2125 || (/* Not a decimal. */
2126 base != 10)
2127 || (/* Allowed as a convenience, in case decimal doesn't fit in largest
2128 signed type. */
2129 !fits_in_type (1, n, long_long_bits, true)));
2130 bool have_int
2131 /* No 'l' or 'll' suffix. */
2132 = long_p == 0;
2133 bool have_long
2134 /* No 'll' suffix. */
2135 = long_p <= 1;
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;
2152 else
2153 error (_("Numeric constant too large."));
2154 putithere->typed_val_int.val = n;
2155
2156 if (imaginary_p)
2157 putithere->typed_val_int.type
2158 = init_complex_type (nullptr, putithere->typed_val_int.type);
2159
2160 return imaginary_p ? COMPLEX_INT : INT;
2161 }
2162
2163 /* Temporary obstack used for holding strings. */
2164 static struct obstack tempbuf;
2165 static int tempbuf_init;
2166
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. */
2175
2176 int
2177 c_parse_escape (const char **ptr, struct obstack *output)
2178 {
2179 const char *tokptr = *ptr;
2180 int result = 1;
2181
2182 /* Some escape sequences undergo character set conversion. Those we
2183 translate here. */
2184 switch (*tokptr)
2185 {
2186 /* Hex escapes do not undergo character set conversion, so keep
2187 the escape sequence for later. */
2188 case 'x':
2189 if (output)
2190 obstack_grow_str (output, "\\x");
2191 ++tokptr;
2192 if (!ISXDIGIT (*tokptr))
2193 error (_("\\x escape without a following hex digit"));
2194 while (ISXDIGIT (*tokptr))
2195 {
2196 if (output)
2197 obstack_1grow (output, *tokptr);
2198 ++tokptr;
2199 }
2200 break;
2201
2202 /* Octal escapes do not undergo character set conversion, so
2203 keep the escape sequence for later. */
2204 case '0':
2205 case '1':
2206 case '2':
2207 case '3':
2208 case '4':
2209 case '5':
2210 case '6':
2211 case '7':
2212 {
2213 int i;
2214 if (output)
2215 obstack_grow_str (output, "\\");
2216 for (i = 0;
2217 i < 3 && ISDIGIT (*tokptr) && *tokptr != '8' && *tokptr != '9';
2218 ++i)
2219 {
2220 if (output)
2221 obstack_1grow (output, *tokptr);
2222 ++tokptr;
2223 }
2224 }
2225 break;
2226
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
2230 charset. */
2231 case 'u':
2232 case 'U':
2233 {
2234 char c = *tokptr;
2235 int i, len = c == 'U' ? 8 : 4;
2236 if (output)
2237 {
2238 obstack_1grow (output, '\\');
2239 obstack_1grow (output, *tokptr);
2240 }
2241 ++tokptr;
2242 if (!ISXDIGIT (*tokptr))
2243 error (_("\\%c escape without a following hex digit"), c);
2244 for (i = 0; i < len && ISXDIGIT (*tokptr); ++i)
2245 {
2246 if (output)
2247 obstack_1grow (output, *tokptr);
2248 ++tokptr;
2249 }
2250 }
2251 break;
2252
2253 /* We must pass backslash through so that it does not
2254 cause quoting during the second expansion. */
2255 case '\\':
2256 if (output)
2257 obstack_grow_str (output, "\\\\");
2258 ++tokptr;
2259 break;
2260
2261 /* Escapes which undergo conversion. */
2262 case 'a':
2263 if (output)
2264 obstack_1grow (output, '\a');
2265 ++tokptr;
2266 break;
2267 case 'b':
2268 if (output)
2269 obstack_1grow (output, '\b');
2270 ++tokptr;
2271 break;
2272 case 'f':
2273 if (output)
2274 obstack_1grow (output, '\f');
2275 ++tokptr;
2276 break;
2277 case 'n':
2278 if (output)
2279 obstack_1grow (output, '\n');
2280 ++tokptr;
2281 break;
2282 case 'r':
2283 if (output)
2284 obstack_1grow (output, '\r');
2285 ++tokptr;
2286 break;
2287 case 't':
2288 if (output)
2289 obstack_1grow (output, '\t');
2290 ++tokptr;
2291 break;
2292 case 'v':
2293 if (output)
2294 obstack_1grow (output, '\v');
2295 ++tokptr;
2296 break;
2297
2298 /* GCC extension. */
2299 case 'e':
2300 if (output)
2301 obstack_1grow (output, HOST_ESCAPE_CHAR);
2302 ++tokptr;
2303 break;
2304
2305 /* Backslash-newline expands to nothing at all. */
2306 case '\n':
2307 ++tokptr;
2308 result = 0;
2309 break;
2310
2311 /* A few escapes just expand to the character itself. */
2312 case '\'':
2313 case '\"':
2314 case '?':
2315 /* GCC extensions. */
2316 case '(':
2317 case '{':
2318 case '[':
2319 case '%':
2320 /* Unrecognized escapes turn into the character itself. */
2321 default:
2322 if (output)
2323 obstack_1grow (output, *tokptr);
2324 ++tokptr;
2325 break;
2326 }
2327 *ptr = tokptr;
2328 return result;
2329 }
2330
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. */
2337
2338 static int
2339 parse_string_or_char (const char *tokptr, const char **outptr,
2340 struct typed_stoken *value, int *host_chars)
2341 {
2342 int quote;
2343 c_string_type type;
2344 int is_objc = 0;
2345
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
2353 bytes */
2354
2355 if (!tempbuf_init)
2356 tempbuf_init = 1;
2357 else
2358 obstack_free (&tempbuf, NULL);
2359 obstack_init (&tempbuf);
2360
2361 /* Record the string type. */
2362 if (*tokptr == 'L')
2363 {
2364 type = C_WIDE_STRING;
2365 ++tokptr;
2366 }
2367 else if (*tokptr == 'u')
2368 {
2369 type = C_STRING_16;
2370 ++tokptr;
2371 }
2372 else if (*tokptr == 'U')
2373 {
2374 type = C_STRING_32;
2375 ++tokptr;
2376 }
2377 else if (*tokptr == '@')
2378 {
2379 /* An Objective C string. */
2380 is_objc = 1;
2381 type = C_STRING;
2382 ++tokptr;
2383 }
2384 else
2385 type = C_STRING;
2386
2387 /* Skip the quote. */
2388 quote = *tokptr;
2389 if (quote == '\'')
2390 type |= C_CHAR;
2391 ++tokptr;
2392
2393 *host_chars = 0;
2394
2395 while (*tokptr)
2396 {
2397 char c = *tokptr;
2398 if (c == '\\')
2399 {
2400 ++tokptr;
2401 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2402 }
2403 else if (c == quote)
2404 break;
2405 else
2406 {
2407 obstack_1grow (&tempbuf, c);
2408 ++tokptr;
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. */
2412 ++*host_chars;
2413 }
2414 }
2415
2416 if (*tokptr != quote)
2417 {
2418 if (quote == '"')
2419 error (_("Unterminated string in expression."));
2420 else
2421 error (_("Unmatched single quote."));
2422 }
2423 ++tokptr;
2424
2425 value->type = type;
2426 value->ptr = (char *) obstack_base (&tempbuf);
2427 value->length = obstack_object_size (&tempbuf);
2428
2429 *outptr = tokptr;
2430
2431 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2432 }
2433
2434 /* This is used to associate some attributes with a token. */
2435
2436 enum token_flag
2437 {
2438 /* If this bit is set, the token is C++-only. */
2439
2440 FLAG_CXX = 1,
2441
2442 /* If this bit is set, the token is C-only. */
2443
2444 FLAG_C = 2,
2445
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. */
2449
2450 FLAG_SHADOW = 4
2451 };
2452 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2453
2454 struct token
2455 {
2456 const char *oper;
2457 int token;
2458 enum exp_opcode opcode;
2459 token_flags flags;
2460 };
2461
2462 static const struct token tokentab3[] =
2463 {
2464 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2465 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2466 {"->*", ARROW_STAR, OP_NULL, FLAG_CXX},
2467 {"...", DOTDOTDOT, OP_NULL, 0}
2468 };
2469
2470 static const struct token tokentab2[] =
2471 {
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}
2495 };
2496
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[] =
2502 {
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},
2526
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},
2532
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},
2544
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 },
2549
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 },
2555
2556 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2557 };
2558
2559
2560 static void
2561 scan_macro_expansion (const char *expansion)
2562 {
2563 /* We'd better not be trying to push the stack twice. */
2564 gdb_assert (! cpstate->macro_original_text);
2565
2566 /* Copy to the obstack. */
2567 const char *copy = obstack_strdup (&cpstate->expansion_obstack, expansion);
2568
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;
2573 }
2574
2575 static int
2576 scanning_macro_expansion (void)
2577 {
2578 return cpstate->macro_original_text != 0;
2579 }
2580
2581 static void
2582 finished_macro_expansion (void)
2583 {
2584 /* There'd better be something to pop back to. */
2585 gdb_assert (cpstate->macro_original_text);
2586
2587 /* Pop back to the original text. */
2588 pstate->lexptr = cpstate->macro_original_text;
2589 cpstate->macro_original_text = 0;
2590 }
2591
2592 /* Return true iff the token represents a C++ cast operator. */
2593
2594 static int
2595 is_cast_operator (const char *token, int len)
2596 {
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));
2601 }
2602
2603 /* The scope used for macro expansion. */
2604 static struct macro_scope *expression_macro_scope;
2605
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;
2610
2611 /* This is set if the previously-returned token was a structure
2612 operator -- either '.' or ARROW. */
2613 static bool last_was_structop;
2614
2615 /* Depth of parentheses. */
2616 static int paren_depth;
2617
2618 /* Read one token, getting characters through lexptr. */
2619
2620 static int
2621 lex_one_token (struct parser_state *par_state, bool *is_quoted_name)
2622 {
2623 int c;
2624 int namelen;
2625 const char *tokstart;
2626 bool saw_structop = last_was_structop;
2627
2628 last_was_structop = false;
2629 *is_quoted_name = false;
2630
2631 retry:
2632
2633 /* Check if this is a macro invocation that we need to expand. */
2634 if (! scanning_macro_expansion ())
2635 {
2636 gdb::unique_xmalloc_ptr<char> expanded
2637 = macro_expand_next (&pstate->lexptr, *expression_macro_scope);
2638
2639 if (expanded != nullptr)
2640 scan_macro_expansion (expanded.get ());
2641 }
2642
2643 pstate->prev_lexptr = pstate->lexptr;
2644
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)
2649 {
2650 if ((token.flags & FLAG_CXX) != 0
2651 && par_state->language ()->la_language != language_cplus)
2652 break;
2653 gdb_assert ((token.flags & FLAG_C) == 0);
2654
2655 pstate->lexptr += 3;
2656 yylval.opcode = token.opcode;
2657 return token.token;
2658 }
2659
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)
2663 {
2664 if ((token.flags & FLAG_CXX) != 0
2665 && par_state->language ()->la_language != language_cplus)
2666 break;
2667 gdb_assert ((token.flags & FLAG_C) == 0);
2668
2669 pstate->lexptr += 2;
2670 yylval.opcode = token.opcode;
2671 if (token.token == ARROW)
2672 last_was_structop = 1;
2673 return token.token;
2674 }
2675
2676 switch (c = *tokstart)
2677 {
2678 case 0:
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 ())
2686 {
2687 finished_macro_expansion ();
2688 goto retry;
2689 }
2690 else if (saw_name_at_eof)
2691 {
2692 saw_name_at_eof = 0;
2693 return COMPLETE;
2694 }
2695 else if (par_state->parse_completion && saw_structop)
2696 return COMPLETE;
2697 else
2698 return 0;
2699
2700 case ' ':
2701 case '\t':
2702 case '\n':
2703 pstate->lexptr++;
2704 goto retry;
2705
2706 case '[':
2707 case '(':
2708 paren_depth++;
2709 pstate->lexptr++;
2710 if (par_state->language ()->la_language == language_objc
2711 && c == '[')
2712 return OBJC_LBRAC;
2713 return c;
2714
2715 case ']':
2716 case ')':
2717 if (paren_depth == 0)
2718 return 0;
2719 paren_depth--;
2720 pstate->lexptr++;
2721 return c;
2722
2723 case ',':
2724 if (pstate->comma_terminates
2725 && paren_depth == 0
2726 && ! scanning_macro_expansion ())
2727 return 0;
2728 pstate->lexptr++;
2729 return c;
2730
2731 case '.':
2732 /* Might be a floating point number. */
2733 if (pstate->lexptr[1] < '0' || pstate->lexptr[1] > '9')
2734 {
2735 last_was_structop = true;
2736 goto symbol; /* Nope, must be a symbol. */
2737 }
2738 /* FALL THRU. */
2739
2740 case '0':
2741 case '1':
2742 case '2':
2743 case '3':
2744 case '4':
2745 case '5':
2746 case '6':
2747 case '7':
2748 case '8':
2749 case '9':
2750 {
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;
2755
2756 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2757 {
2758 p += 2;
2759 hex = 1;
2760 }
2761 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2762 {
2763 p += 2;
2764 hex = 0;
2765 }
2766
2767 for (;; ++p)
2768 {
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 == '.')
2779 got_dot = 1;
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
2784 number. */
2785 continue;
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')))
2791 break;
2792 }
2793 toktype = parse_number (par_state, tokstart, p - tokstart,
2794 got_dot | got_e | got_p, &yylval);
2795 if (toktype == ERROR)
2796 {
2797 char *err_copy = (char *) alloca (p - tokstart + 1);
2798
2799 memcpy (err_copy, tokstart, p - tokstart);
2800 err_copy[p - tokstart] = 0;
2801 error (_("Invalid number \"%s\"."), err_copy);
2802 }
2803 pstate->lexptr = p;
2804 return toktype;
2805 }
2806
2807 case '@':
2808 {
2809 const char *p = &tokstart[1];
2810
2811 if (par_state->language ()->la_language == language_objc)
2812 {
2813 size_t len = strlen ("selector");
2814
2815 if (strncmp (p, "selector", len) == 0
2816 && (p[len] == '\0' || ISSPACE (p[len])))
2817 {
2818 pstate->lexptr = p + len;
2819 return SELECTOR;
2820 }
2821 else if (*p == '"')
2822 goto parse_string;
2823 }
2824
2825 while (ISSPACE (*p))
2826 p++;
2827 size_t len = strlen ("entry");
2828 if (strncmp (p, "entry", len) == 0 && !c_ident_is_alnum (p[len])
2829 && p[len] != '_')
2830 {
2831 pstate->lexptr = &p[len];
2832 return ENTRY;
2833 }
2834 }
2835 /* FALLTHRU */
2836 case '+':
2837 case '-':
2838 case '*':
2839 case '/':
2840 case '%':
2841 case '|':
2842 case '&':
2843 case '^':
2844 case '~':
2845 case '!':
2846 case '<':
2847 case '>':
2848 case '?':
2849 case ':':
2850 case '=':
2851 case '{':
2852 case '}':
2853 symbol:
2854 pstate->lexptr++;
2855 return c;
2856
2857 case 'L':
2858 case 'u':
2859 case 'U':
2860 if (tokstart[1] != '"' && tokstart[1] != '\'')
2861 break;
2862 /* Fall through. */
2863 case '\'':
2864 case '"':
2865
2866 parse_string:
2867 {
2868 int host_len;
2869 int result = parse_string_or_char (tokstart, &pstate->lexptr,
2870 &yylval.tsval, &host_len);
2871 if (result == CHAR)
2872 {
2873 if (host_len == 0)
2874 error (_("Empty character constant."));
2875 else if (host_len > 2 && c == '\'')
2876 {
2877 ++tokstart;
2878 namelen = pstate->lexptr - tokstart - 1;
2879 *is_quoted_name = true;
2880
2881 goto tryname;
2882 }
2883 else if (host_len > 1)
2884 error (_("Invalid character constant."));
2885 }
2886 return result;
2887 }
2888 }
2889
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);
2893
2894 /* It's a name. See how long it is. */
2895 namelen = 0;
2896 for (c = tokstart[namelen];
2897 (c == '_' || c == '$' || c_ident_is_alnum (c) || c == '<');)
2898 {
2899 /* Template parameter lists are part of the name.
2900 FIXME: This mishandles `print $a<4&&$a>3'. */
2901
2902 if (c == '<')
2903 {
2904 if (! is_cast_operator (tokstart, namelen))
2905 {
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);
2911
2912 if (p)
2913 namelen = p - tokstart;
2914 }
2915 break;
2916 }
2917 c = tokstart[++namelen];
2918 }
2919
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. */
2923 if (namelen == 2
2924 && tokstart[0] == 'i'
2925 && tokstart[1] == 'f'
2926 && ! scanning_macro_expansion ())
2927 {
2928 return 0;
2929 }
2930
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. */
2936 if (namelen >= 1
2937 && (strncmp (tokstart, "thread", namelen) == 0
2938 || strncmp (tokstart, "task", namelen) == 0)
2939 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2940 && ! scanning_macro_expansion ())
2941 {
2942 const char *p = tokstart + namelen + 1;
2943
2944 while (*p == ' ' || *p == '\t')
2945 p++;
2946 if (*p >= '0' && *p <= '9')
2947 return 0;
2948 }
2949
2950 pstate->lexptr += namelen;
2951
2952 tryname:
2953
2954 yylval.sval.ptr = tokstart;
2955 yylval.sval.length = namelen;
2956
2957 /* Catch specific keywords. */
2958 std::string copy = copy_name (yylval.sval);
2959 for (const auto &token : ident_tokens)
2960 if (copy == token.oper)
2961 {
2962 if ((token.flags & FLAG_CXX) != 0
2963 && par_state->language ()->la_language != language_cplus)
2964 break;
2965 if ((token.flags & FLAG_C) != 0
2966 && par_state->language ()->la_language != language_c
2967 && par_state->language ()->la_language != language_objc)
2968 break;
2969
2970 if ((token.flags & FLAG_SHADOW) != 0)
2971 {
2972 struct field_of_this_result is_a_field_of_this;
2973
2974 if (lookup_symbol (copy.c_str (),
2975 pstate->expression_context_block,
2976 VAR_DOMAIN,
2977 (par_state->language ()->la_language
2978 == language_cplus ? &is_a_field_of_this
2979 : NULL)).symbol
2980 != NULL)
2981 {
2982 /* The keyword is shadowed. */
2983 break;
2984 }
2985 }
2986
2987 /* It is ok to always set this, even though we don't always
2988 strictly need to. */
2989 yylval.opcode = token.opcode;
2990 return token.token;
2991 }
2992
2993 if (*tokstart == '$')
2994 return DOLLAR_VARIABLE;
2995
2996 if (pstate->parse_completion && *pstate->lexptr == '\0')
2997 saw_name_at_eof = 1;
2998
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;
3003 return NAME;
3004 }
3005
3006 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
3007 struct token_and_value
3008 {
3009 int token;
3010 YYSTYPE value;
3011 };
3012
3013 /* A FIFO of tokens that have been read but not yet returned to the
3014 parser. */
3015 static std::vector<token_and_value> token_fifo;
3016
3017 /* Non-zero if the lexer should return tokens from the FIFO. */
3018 static int popping;
3019
3020 /* Temporary storage for c_lex; this holds symbol names as they are
3021 built up. */
3022 static auto_obstack name_obstack;
3023
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 */
3030
3031 static int
3032 classify_name (struct parser_state *par_state, const struct block *block,
3033 bool is_quoted_name, bool is_after_structop)
3034 {
3035 struct block_symbol bsym;
3036 struct field_of_this_result is_a_field_of_this;
3037
3038 std::string copy = copy_name (yylval.sval);
3039
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));
3043
3044 bsym = lookup_symbol (copy.c_str (), block, VAR_DOMAIN,
3045 par_state->language ()->name_of_this ()
3046 ? &is_a_field_of_this : NULL);
3047
3048 if (bsym.symbol && bsym.symbol->aclass () == LOC_BLOCK)
3049 {
3050 yylval.ssym.sym = bsym;
3051 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
3052 return BLOCKNAME;
3053 }
3054 else if (!bsym.symbol)
3055 {
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,
3063 0))
3064 {
3065 struct field_of_this_result inner_is_a_field_of_this;
3066
3067 bsym = lookup_symbol (copy.c_str (), block, STRUCT_DOMAIN,
3068 &inner_is_a_field_of_this);
3069 if (bsym.symbol != NULL)
3070 {
3071 yylval.tsym.type = bsym.symbol->type ();
3072 return TYPENAME;
3073 }
3074 }
3075
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)
3082 || is_quoted_name)
3083 {
3084 /* See if it's a file name. */
3085 struct symtab *symtab;
3086
3087 symtab = lookup_symtab (copy.c_str ());
3088 if (symtab)
3089 {
3090 yylval.bval
3091 = symtab->compunit ()->blockvector ()->static_block ();
3092
3093 return FILENAME;
3094 }
3095 }
3096 }
3097
3098 if (bsym.symbol && bsym.symbol->aclass () == LOC_TYPEDEF)
3099 {
3100 yylval.tsym.type = bsym.symbol->type ();
3101 return TYPENAME;
3102 }
3103
3104 /* See if it's an ObjC classname. */
3105 if (par_state->language ()->la_language == language_objc && !bsym.symbol)
3106 {
3107 CORE_ADDR Class = lookup_objc_class (par_state->gdbarch (),
3108 copy.c_str ());
3109 if (Class)
3110 {
3111 struct symbol *sym;
3112
3113 yylval.theclass.theclass = Class;
3114 sym = lookup_struct_typedef (copy.c_str (),
3115 par_state->expression_context_block, 1);
3116 if (sym)
3117 yylval.theclass.type = sym->type ();
3118 return CLASSNAME;
3119 }
3120 }
3121
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. */
3125 if (!bsym.symbol
3126 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
3127 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
3128 {
3129 YYSTYPE newlval; /* Its value is ignored. */
3130 int hextype = parse_number (par_state, copy.c_str (), yylval.sval.length,
3131 0, &newlval);
3132
3133 if (hextype == INT)
3134 {
3135 yylval.ssym.sym = bsym;
3136 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
3137 return NAME_OR_INT;
3138 }
3139 }
3140
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;
3144
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;
3150
3151 return NAME;
3152 }
3153
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. */
3157
3158 static int
3159 classify_inner_name (struct parser_state *par_state,
3160 const struct block *block, struct type *context)
3161 {
3162 struct type *type;
3163
3164 if (context == NULL)
3165 return classify_name (par_state, block, false, false);
3166
3167 type = check_typedef (context);
3168 if (!type_aggregate_p (type))
3169 return ERROR;
3170
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,
3174 VAR_DOMAIN);
3175
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)
3180 {
3181 struct type *base_type = cp_find_type_baseclass_by_name (type,
3182 copy.c_str ());
3183
3184 if (base_type != NULL)
3185 {
3186 yylval.tsym.type = base_type;
3187 return TYPENAME;
3188 }
3189
3190 return ERROR;
3191 }
3192
3193 switch (yylval.ssym.sym.symbol->aclass ())
3194 {
3195 case LOC_BLOCK:
3196 case LOC_LABEL:
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. */
3200 {
3201 struct type *base_type
3202 = cp_find_type_baseclass_by_name (type, copy.c_str ());
3203
3204 if (base_type != NULL)
3205 {
3206 yylval.tsym.type = base_type;
3207 return TYPENAME;
3208 }
3209 }
3210 return ERROR;
3211
3212 case LOC_TYPEDEF:
3213 yylval.tsym.type = yylval.ssym.sym.symbol->type ();
3214 return TYPENAME;
3215
3216 default:
3217 return NAME;
3218 }
3219 internal_error (__FILE__, __LINE__, _("not reached"));
3220 }
3221
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
3227 right point.
3228
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. */
3233
3234 static int
3235 yylex (void)
3236 {
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;
3243
3244 if (popping && !token_fifo.empty ())
3245 goto do_pop;
3246 popping = 0;
3247
3248 last_lex_was_structop = last_was_structop;
3249
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
3252 name-like token. */
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;
3261
3262 /* Read any sequence of alternating "::" and name-like tokens into
3263 the token FIFO. */
3264 current.value = yylval;
3265 token_fifo.push_back (current);
3266 last_was_coloncolon = current.token == COLONCOLON;
3267 while (1)
3268 {
3269 bool ignore;
3270
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);
3276
3277 if ((last_was_coloncolon && current.token != NAME)
3278 || (!last_was_coloncolon && current.token != COLONCOLON))
3279 break;
3280 last_was_coloncolon = !last_was_coloncolon;
3281 }
3282 popping = 1;
3283
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;
3288
3289 current = token_fifo[next_to_examine];
3290 ++next_to_examine;
3291
3292 name_obstack.clear ();
3293 checkpoint = 0;
3294 if (current.token == FILENAME)
3295 search_block = current.value.bval;
3296 else if (current.token == COLONCOLON)
3297 search_block = NULL;
3298 else
3299 {
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;
3305 checkpoint = 1;
3306 }
3307
3308 first_was_coloncolon = current.token == COLONCOLON;
3309 last_was_coloncolon = first_was_coloncolon;
3310
3311 while (next_to_examine <= last_to_examine)
3312 {
3313 token_and_value next;
3314
3315 next = token_fifo[next_to_examine];
3316 ++next_to_examine;
3317
3318 if (next.token == NAME && last_was_coloncolon)
3319 {
3320 int classification;
3321
3322 yylval = next.value;
3323 classification = classify_inner_name (pstate, search_block,
3324 context_type);
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)
3328 break;
3329
3330 /* Accept up to this token. */
3331 checkpoint = next_to_examine;
3332
3333 /* Update the partial name we are constructing. */
3334 if (context_type != NULL)
3335 {
3336 /* We don't want to put a leading "::" into the name. */
3337 obstack_grow_str (&name_obstack, "::");
3338 }
3339 obstack_grow (&name_obstack, next.value.sval.ptr,
3340 next.value.sval.length);
3341
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;
3346
3347 last_was_coloncolon = 0;
3348
3349 if (classification == NAME)
3350 break;
3351
3352 context_type = yylval.tsym.type;
3353 }
3354 else if (next.token == COLONCOLON && !last_was_coloncolon)
3355 last_was_coloncolon = 1;
3356 else
3357 {
3358 /* We've reached the end of the name. */
3359 break;
3360 }
3361 }
3362
3363 /* If we have a replacement token, install it as the first token in
3364 the FIFO, and delete the other constituent tokens. */
3365 if (checkpoint > 0)
3366 {
3367 current.value.sval.ptr
3368 = obstack_strndup (&cpstate->expansion_obstack,
3369 current.value.sval.ptr,
3370 current.value.sval.length);
3371
3372 token_fifo[0] = current;
3373 if (checkpoint > 1)
3374 token_fifo.erase (token_fifo.begin () + 1,
3375 token_fifo.begin () + checkpoint);
3376 }
3377
3378 do_pop:
3379 current = token_fifo[0];
3380 token_fifo.erase (token_fifo.begin ());
3381 yylval = current.value;
3382 return current.token;
3383 }
3384
3385 int
3386 c_parse (struct parser_state *par_state)
3387 {
3388 /* Setting up the parser state. */
3389 scoped_restore pstate_restore = make_scoped_restore (&pstate);
3390 gdb_assert (par_state != NULL);
3391 pstate = par_state;
3392
3393 c_parse_state cstate;
3394 scoped_restore cstate_restore = make_scoped_restore (&cpstate, &cstate);
3395
3396 gdb::unique_xmalloc_ptr<struct macro_scope> macro_scope;
3397
3398 if (par_state->expression_context_block)
3399 macro_scope
3400 = sal_macro_scope (find_pc_line (par_state->expression_context_pc, 0));
3401 else
3402 macro_scope = default_macro_scope ();
3403 if (! macro_scope)
3404 macro_scope = user_macro_scope ();
3405
3406 scoped_restore restore_macro_scope
3407 = make_scoped_restore (&expression_macro_scope, macro_scope.get ());
3408
3409 scoped_restore restore_yydebug = make_scoped_restore (&yydebug,
3410 parser_debug);
3411
3412 /* Initialize some state used by the lexer. */
3413 last_was_structop = false;
3414 saw_name_at_eof = 0;
3415 paren_depth = 0;
3416
3417 token_fifo.clear ();
3418 popping = 0;
3419 name_obstack.clear ();
3420
3421 int result = yyparse ();
3422 if (!result)
3423 pstate->set_operation (pstate->pop ());
3424 return result;
3425 }
3426
3427 #if defined(YYBISON) && YYBISON < 30800
3428
3429
3430 /* This is called via the YYPRINT macro when parser debugging is
3431 enabled. It prints a token's value. */
3432
3433 static void
3434 c_print_token (FILE *file, int type, YYSTYPE value)
3435 {
3436 switch (type)
3437 {
3438 case INT:
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));
3442 break;
3443
3444 case CHAR:
3445 case STRING:
3446 {
3447 char *copy = (char *) alloca (value.tsval.length + 1);
3448
3449 memcpy (copy, value.tsval.ptr, value.tsval.length);
3450 copy[value.tsval.length] = '\0';
3451
3452 parser_fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3453 }
3454 break;
3455
3456 case NSSTRING:
3457 case DOLLAR_VARIABLE:
3458 parser_fprintf (file, "sval<%s>", copy_name (value.sval).c_str ());
3459 break;
3460
3461 case TYPENAME:
3462 parser_fprintf (file, "tsym<type=%s, name=%s>",
3463 TYPE_SAFE_NAME (value.tsym.type),
3464 copy_name (value.tsym.stoken).c_str ());
3465 break;
3466
3467 case NAME:
3468 case UNKNOWN_CPP_NAME:
3469 case NAME_OR_INT:
3470 case BLOCKNAME:
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);
3476 break;
3477
3478 case FILENAME:
3479 parser_fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3480 break;
3481 }
3482 }
3483
3484 #endif
3485
3486 static void
3487 yyerror (const char *msg)
3488 {
3489 if (pstate->prev_lexptr)
3490 pstate->lexptr = pstate->prev_lexptr;
3491
3492 error (_("A %s in expression, near `%s'."), msg, pstate->lexptr);
3493 }
The GNU Binutils are a collection of binary tools.