projects / deliverable / binutils-gdb.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Fix assert in c-exp.y
[deliverable/binutils-gdb.git] / gdb / c-exp.y
1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986-2020 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
58 #define parse_type(ps) builtin_type (ps->gdbarch ())
59
60 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror,
61 etc). */
62 #define GDB_YY_REMAP_PREFIX c_
63 #include "yy-remap.h"
64
65 /* The state of the parser, used internally when we are parsing the
66 expression. */
67
68 static struct parser_state *pstate = NULL;
69
70 /* Data that must be held for the duration of a parse. */
71
72 struct c_parse_state
73 {
74 /* These are used to hold type lists and type stacks that are
75 allocated during the parse. */
76 std::vector<std::unique_ptr<std::vector<struct type *>>> type_lists;
77 std::vector<std::unique_ptr<struct type_stack>> type_stacks;
78
79 /* Storage for some strings allocated during the parse. */
80 std::vector<gdb::unique_xmalloc_ptr<char>> strings;
81
82 /* When we find that lexptr (the global var defined in parse.c) is
83 pointing at a macro invocation, we expand the invocation, and call
84 scan_macro_expansion to save the old lexptr here and point lexptr
85 into the expanded text. When we reach the end of that, we call
86 end_macro_expansion to pop back to the value we saved here. The
87 macro expansion code promises to return only fully-expanded text,
88 so we don't need to "push" more than one level.
89
90 This is disgusting, of course. It would be cleaner to do all macro
91 expansion beforehand, and then hand that to lexptr. But we don't
92 really know where the expression ends. Remember, in a command like
93
94 (gdb) break *ADDRESS if CONDITION
95
96 we evaluate ADDRESS in the scope of the current frame, but we
97 evaluate CONDITION in the scope of the breakpoint's location. So
98 it's simply wrong to try to macro-expand the whole thing at once. */
99 const char *macro_original_text = nullptr;
100
101 /* We save all intermediate macro expansions on this obstack for the
102 duration of a single parse. The expansion text may sometimes have
103 to live past the end of the expansion, due to yacc lookahead.
104 Rather than try to be clever about saving the data for a single
105 token, we simply keep it all and delete it after parsing has
106 completed. */
107 auto_obstack expansion_obstack;
108
109 /* The type stack. */
110 struct type_stack type_stack;
111 };
112
113 /* This is set and cleared in c_parse. */
114
115 static struct c_parse_state *cpstate;
116
117 int yyparse (void);
118
119 static int yylex (void);
120
121 static void yyerror (const char *);
122
123 static int type_aggregate_p (struct type *);
124
125 %}
126
127 /* Although the yacc "value" of an expression is not used,
128 since the result is stored in the structure being created,
129 other node types do have values. */
130
131 %union
132 {
133 LONGEST lval;
134 struct {
135 LONGEST val;
136 struct type *type;
137 } typed_val_int;
138 struct {
139 gdb_byte val[16];
140 struct type *type;
141 } typed_val_float;
142 struct type *tval;
143 struct stoken sval;
144 struct typed_stoken tsval;
145 struct ttype tsym;
146 struct symtoken ssym;
147 int voidval;
148 const struct block *bval;
149 enum exp_opcode opcode;
150
151 struct stoken_vector svec;
152 std::vector<struct type *> *tvec;
153
154 struct type_stack *type_stack;
155
156 struct objc_class_str theclass;
157 }
158
159 %{
160 /* YYSTYPE gets defined by %union */
161 static int parse_number (struct parser_state *par_state,
162 const char *, int, int, YYSTYPE *);
163 static struct stoken operator_stoken (const char *);
164 static struct stoken typename_stoken (const char *);
165 static void check_parameter_typelist (std::vector<struct type *> *);
166 static void write_destructor_name (struct parser_state *par_state,
167 struct stoken);
168
169 #ifdef YYBISON
170 static void c_print_token (FILE *file, int type, YYSTYPE value);
171 #define YYPRINT(FILE, TYPE, VALUE) c_print_token (FILE, TYPE, VALUE)
172 #endif
173 %}
174
175 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly function_method
176 %type <lval> rcurly
177 %type <tval> type typebase
178 %type <tvec> nonempty_typelist func_mod parameter_typelist
179 /* %type <bval> block */
180
181 /* Fancy type parsing. */
182 %type <tval> ptype
183 %type <lval> array_mod
184 %type <tval> conversion_type_id
185
186 %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl
187
188 %token <typed_val_int> INT
189 %token <typed_val_float> FLOAT
190
191 /* Both NAME and TYPENAME tokens represent symbols in the input,
192 and both convey their data as strings.
193 But a TYPENAME is a string that happens to be defined as a typedef
194 or builtin type name (such as int or char)
195 and a NAME is any other symbol.
196 Contexts where this distinction is not important can use the
197 nonterminal "name", which matches either NAME or TYPENAME. */
198
199 %token <tsval> STRING
200 %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */
201 %token SELECTOR /* ObjC "@selector" pseudo-operator */
202 %token <tsval> CHAR
203 %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */
204 %token <ssym> UNKNOWN_CPP_NAME
205 %token <voidval> COMPLETE
206 %token <tsym> TYPENAME
207 %token <theclass> CLASSNAME /* ObjC Class name */
208 %type <sval> name field_name
209 %type <svec> string_exp
210 %type <ssym> name_not_typename
211 %type <tsym> type_name
212
213 /* This is like a '[' token, but is only generated when parsing
214 Objective C. This lets us reuse the same parser without
215 erroneously parsing ObjC-specific expressions in C. */
216 %token OBJC_LBRAC
217
218 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
219 but which would parse as a valid number in the current input radix.
220 E.g. "c" when input_radix==16. Depending on the parse, it will be
221 turned into a name or into a number. */
222
223 %token <ssym> NAME_OR_INT
224
225 %token OPERATOR
226 %token STRUCT CLASS UNION ENUM SIZEOF ALIGNOF UNSIGNED COLONCOLON
227 %token TEMPLATE
228 %token ERROR
229 %token NEW DELETE
230 %type <sval> oper
231 %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
232 %token ENTRY
233 %token TYPEOF
234 %token DECLTYPE
235 %token TYPEID
236
237 /* Special type cases, put in to allow the parser to distinguish different
238 legal basetypes. */
239 %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
240 %token RESTRICT ATOMIC
241
242 %token <sval> DOLLAR_VARIABLE
243
244 %token <opcode> ASSIGN_MODIFY
245
246 /* C++ */
247 %token TRUEKEYWORD
248 %token FALSEKEYWORD
249
250
251 %left ','
252 %left ABOVE_COMMA
253 %right '=' ASSIGN_MODIFY
254 %right '?'
255 %left OROR
256 %left ANDAND
257 %left '|'
258 %left '^'
259 %left '&'
260 %left EQUAL NOTEQUAL
261 %left '<' '>' LEQ GEQ
262 %left LSH RSH
263 %left '@'
264 %left '+' '-'
265 %left '*' '/' '%'
266 %right UNARY INCREMENT DECREMENT
267 %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '('
268 %token <ssym> BLOCKNAME
269 %token <bval> FILENAME
270 %type <bval> block
271 %left COLONCOLON
272
273 %token DOTDOTDOT
274
275 \f
276 %%
277
278 start : exp1
279 | type_exp
280 ;
281
282 type_exp: type
283 { write_exp_elt_opcode(pstate, OP_TYPE);
284 write_exp_elt_type(pstate, $1);
285 write_exp_elt_opcode(pstate, OP_TYPE);}
286 | TYPEOF '(' exp ')'
287 {
288 write_exp_elt_opcode (pstate, OP_TYPEOF);
289 }
290 | TYPEOF '(' type ')'
291 {
292 write_exp_elt_opcode (pstate, OP_TYPE);
293 write_exp_elt_type (pstate, $3);
294 write_exp_elt_opcode (pstate, OP_TYPE);
295 }
296 | DECLTYPE '(' exp ')'
297 {
298 write_exp_elt_opcode (pstate, OP_DECLTYPE);
299 }
300 ;
301
302 /* Expressions, including the comma operator. */
303 exp1 : exp
304 | exp1 ',' exp
305 { write_exp_elt_opcode (pstate, BINOP_COMMA); }
306 ;
307
308 /* Expressions, not including the comma operator. */
309 exp : '*' exp %prec UNARY
310 { write_exp_elt_opcode (pstate, UNOP_IND); }
311 ;
312
313 exp : '&' exp %prec UNARY
314 { write_exp_elt_opcode (pstate, UNOP_ADDR); }
315 ;
316
317 exp : '-' exp %prec UNARY
318 { write_exp_elt_opcode (pstate, UNOP_NEG); }
319 ;
320
321 exp : '+' exp %prec UNARY
322 { write_exp_elt_opcode (pstate, UNOP_PLUS); }
323 ;
324
325 exp : '!' exp %prec UNARY
326 { write_exp_elt_opcode (pstate, UNOP_LOGICAL_NOT); }
327 ;
328
329 exp : '~' exp %prec UNARY
330 { write_exp_elt_opcode (pstate, UNOP_COMPLEMENT); }
331 ;
332
333 exp : INCREMENT exp %prec UNARY
334 { write_exp_elt_opcode (pstate, UNOP_PREINCREMENT); }
335 ;
336
337 exp : DECREMENT exp %prec UNARY
338 { write_exp_elt_opcode (pstate, UNOP_PREDECREMENT); }
339 ;
340
341 exp : exp INCREMENT %prec UNARY
342 { write_exp_elt_opcode (pstate, UNOP_POSTINCREMENT); }
343 ;
344
345 exp : exp DECREMENT %prec UNARY
346 { write_exp_elt_opcode (pstate, UNOP_POSTDECREMENT); }
347 ;
348
349 exp : TYPEID '(' exp ')' %prec UNARY
350 { write_exp_elt_opcode (pstate, OP_TYPEID); }
351 ;
352
353 exp : TYPEID '(' type_exp ')' %prec UNARY
354 { write_exp_elt_opcode (pstate, OP_TYPEID); }
355 ;
356
357 exp : SIZEOF exp %prec UNARY
358 { write_exp_elt_opcode (pstate, UNOP_SIZEOF); }
359 ;
360
361 exp : ALIGNOF '(' type_exp ')' %prec UNARY
362 { write_exp_elt_opcode (pstate, UNOP_ALIGNOF); }
363 ;
364
365 exp : exp ARROW field_name
366 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
367 write_exp_string (pstate, $3);
368 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
369 ;
370
371 exp : exp ARROW field_name COMPLETE
372 { pstate->mark_struct_expression ();
373 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
374 write_exp_string (pstate, $3);
375 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
376 ;
377
378 exp : exp ARROW COMPLETE
379 { struct stoken s;
380 pstate->mark_struct_expression ();
381 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
382 s.ptr = "";
383 s.length = 0;
384 write_exp_string (pstate, s);
385 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
386 ;
387
388 exp : exp ARROW '~' name
389 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
390 write_destructor_name (pstate, $4);
391 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
392 ;
393
394 exp : exp ARROW '~' name COMPLETE
395 { pstate->mark_struct_expression ();
396 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
397 write_destructor_name (pstate, $4);
398 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
399 ;
400
401 exp : exp ARROW qualified_name
402 { /* exp->type::name becomes exp->*(&type::name) */
403 /* Note: this doesn't work if name is a
404 static member! FIXME */
405 write_exp_elt_opcode (pstate, UNOP_ADDR);
406 write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
407 ;
408
409 exp : exp ARROW_STAR exp
410 { write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
411 ;
412
413 exp : exp '.' field_name
414 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
415 write_exp_string (pstate, $3);
416 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
417 ;
418
419 exp : exp '.' field_name COMPLETE
420 { pstate->mark_struct_expression ();
421 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
422 write_exp_string (pstate, $3);
423 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
424 ;
425
426 exp : exp '.' COMPLETE
427 { struct stoken s;
428 pstate->mark_struct_expression ();
429 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
430 s.ptr = "";
431 s.length = 0;
432 write_exp_string (pstate, s);
433 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
434 ;
435
436 exp : exp '.' '~' name
437 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
438 write_destructor_name (pstate, $4);
439 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
440 ;
441
442 exp : exp '.' '~' name COMPLETE
443 { pstate->mark_struct_expression ();
444 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
445 write_destructor_name (pstate, $4);
446 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
447 ;
448
449 exp : exp '.' qualified_name
450 { /* exp.type::name becomes exp.*(&type::name) */
451 /* Note: this doesn't work if name is a
452 static member! FIXME */
453 write_exp_elt_opcode (pstate, UNOP_ADDR);
454 write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
455 ;
456
457 exp : exp DOT_STAR exp
458 { write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
459 ;
460
461 exp : exp '[' exp1 ']'
462 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
463 ;
464
465 exp : exp OBJC_LBRAC exp1 ']'
466 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
467 ;
468
469 /*
470 * The rules below parse ObjC message calls of the form:
471 * '[' target selector {':' argument}* ']'
472 */
473
474 exp : OBJC_LBRAC TYPENAME
475 {
476 CORE_ADDR theclass;
477
478 std::string copy = copy_name ($2.stoken);
479 theclass = lookup_objc_class (pstate->gdbarch (),
480 copy.c_str ());
481 if (theclass == 0)
482 error (_("%s is not an ObjC Class"),
483 copy.c_str ());
484 write_exp_elt_opcode (pstate, OP_LONG);
485 write_exp_elt_type (pstate,
486 parse_type (pstate)->builtin_int);
487 write_exp_elt_longcst (pstate, (LONGEST) theclass);
488 write_exp_elt_opcode (pstate, OP_LONG);
489 start_msglist();
490 }
491 msglist ']'
492 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
493 end_msglist (pstate);
494 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
495 }
496 ;
497
498 exp : OBJC_LBRAC CLASSNAME
499 {
500 write_exp_elt_opcode (pstate, OP_LONG);
501 write_exp_elt_type (pstate,
502 parse_type (pstate)->builtin_int);
503 write_exp_elt_longcst (pstate, (LONGEST) $2.theclass);
504 write_exp_elt_opcode (pstate, OP_LONG);
505 start_msglist();
506 }
507 msglist ']'
508 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
509 end_msglist (pstate);
510 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
511 }
512 ;
513
514 exp : OBJC_LBRAC exp
515 { start_msglist(); }
516 msglist ']'
517 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
518 end_msglist (pstate);
519 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
520 }
521 ;
522
523 msglist : name
524 { add_msglist(&$1, 0); }
525 | msgarglist
526 ;
527
528 msgarglist : msgarg
529 | msgarglist msgarg
530 ;
531
532 msgarg : name ':' exp
533 { add_msglist(&$1, 1); }
534 | ':' exp /* Unnamed arg. */
535 { add_msglist(0, 1); }
536 | ',' exp /* Variable number of args. */
537 { add_msglist(0, 0); }
538 ;
539
540 exp : exp '('
541 /* This is to save the value of arglist_len
542 being accumulated by an outer function call. */
543 { pstate->start_arglist (); }
544 arglist ')' %prec ARROW
545 { write_exp_elt_opcode (pstate, OP_FUNCALL);
546 write_exp_elt_longcst (pstate,
547 pstate->end_arglist ());
548 write_exp_elt_opcode (pstate, OP_FUNCALL); }
549 ;
550
551 /* This is here to disambiguate with the production for
552 "func()::static_var" further below, which uses
553 function_method_void. */
554 exp : exp '(' ')' %prec ARROW
555 { pstate->start_arglist ();
556 write_exp_elt_opcode (pstate, OP_FUNCALL);
557 write_exp_elt_longcst (pstate,
558 pstate->end_arglist ());
559 write_exp_elt_opcode (pstate, OP_FUNCALL); }
560 ;
561
562
563 exp : UNKNOWN_CPP_NAME '('
564 {
565 /* This could potentially be a an argument defined
566 lookup function (Koenig). */
567 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
568 write_exp_elt_block
569 (pstate, pstate->expression_context_block);
570 write_exp_elt_sym (pstate,
571 NULL); /* Placeholder. */
572 write_exp_string (pstate, $1.stoken);
573 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
574
575 /* This is to save the value of arglist_len
576 being accumulated by an outer function call. */
577
578 pstate->start_arglist ();
579 }
580 arglist ')' %prec ARROW
581 {
582 write_exp_elt_opcode (pstate, OP_FUNCALL);
583 write_exp_elt_longcst (pstate,
584 pstate->end_arglist ());
585 write_exp_elt_opcode (pstate, OP_FUNCALL);
586 }
587 ;
588
589 lcurly : '{'
590 { pstate->start_arglist (); }
591 ;
592
593 arglist :
594 ;
595
596 arglist : exp
597 { pstate->arglist_len = 1; }
598 ;
599
600 arglist : arglist ',' exp %prec ABOVE_COMMA
601 { pstate->arglist_len++; }
602 ;
603
604 function_method: exp '(' parameter_typelist ')' const_or_volatile
605 {
606 std::vector<struct type *> *type_list = $3;
607 LONGEST len = type_list->size ();
608
609 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
610 /* Save the const/volatile qualifiers as
611 recorded by the const_or_volatile
612 production's actions. */
613 write_exp_elt_longcst
614 (pstate,
615 (cpstate->type_stack
616 .follow_type_instance_flags ()));
617 write_exp_elt_longcst (pstate, len);
618 for (type *type_elt : *type_list)
619 write_exp_elt_type (pstate, type_elt);
620 write_exp_elt_longcst(pstate, len);
621 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
622 }
623 ;
624
625 function_method_void: exp '(' ')' const_or_volatile
626 { write_exp_elt_opcode (pstate, TYPE_INSTANCE);
627 /* See above. */
628 write_exp_elt_longcst
629 (pstate,
630 cpstate->type_stack.follow_type_instance_flags ());
631 write_exp_elt_longcst (pstate, 0);
632 write_exp_elt_longcst (pstate, 0);
633 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
634 }
635 ;
636
637 exp : function_method
638 ;
639
640 /* Normally we must interpret "func()" as a function call, instead of
641 a type. The user needs to write func(void) to disambiguate.
642 However, in the "func()::static_var" case, there's no
643 ambiguity. */
644 function_method_void_or_typelist: function_method
645 | function_method_void
646 ;
647
648 exp : function_method_void_or_typelist COLONCOLON name
649 {
650 write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR);
651 write_exp_string (pstate, $3);
652 write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR);
653 }
654 ;
655
656 rcurly : '}'
657 { $$ = pstate->end_arglist () - 1; }
658 ;
659 exp : lcurly arglist rcurly %prec ARROW
660 { write_exp_elt_opcode (pstate, OP_ARRAY);
661 write_exp_elt_longcst (pstate, (LONGEST) 0);
662 write_exp_elt_longcst (pstate, (LONGEST) $3);
663 write_exp_elt_opcode (pstate, OP_ARRAY); }
664 ;
665
666 exp : lcurly type_exp rcurly exp %prec UNARY
667 { write_exp_elt_opcode (pstate, UNOP_MEMVAL_TYPE); }
668 ;
669
670 exp : '(' type_exp ')' exp %prec UNARY
671 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
672 ;
673
674 exp : '(' exp1 ')'
675 { }
676 ;
677
678 /* Binary operators in order of decreasing precedence. */
679
680 exp : exp '@' exp
681 { write_exp_elt_opcode (pstate, BINOP_REPEAT); }
682 ;
683
684 exp : exp '*' exp
685 { write_exp_elt_opcode (pstate, BINOP_MUL); }
686 ;
687
688 exp : exp '/' exp
689 { write_exp_elt_opcode (pstate, BINOP_DIV); }
690 ;
691
692 exp : exp '%' exp
693 { write_exp_elt_opcode (pstate, BINOP_REM); }
694 ;
695
696 exp : exp '+' exp
697 { write_exp_elt_opcode (pstate, BINOP_ADD); }
698 ;
699
700 exp : exp '-' exp
701 { write_exp_elt_opcode (pstate, BINOP_SUB); }
702 ;
703
704 exp : exp LSH exp
705 { write_exp_elt_opcode (pstate, BINOP_LSH); }
706 ;
707
708 exp : exp RSH exp
709 { write_exp_elt_opcode (pstate, BINOP_RSH); }
710 ;
711
712 exp : exp EQUAL exp
713 { write_exp_elt_opcode (pstate, BINOP_EQUAL); }
714 ;
715
716 exp : exp NOTEQUAL exp
717 { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); }
718 ;
719
720 exp : exp LEQ exp
721 { write_exp_elt_opcode (pstate, BINOP_LEQ); }
722 ;
723
724 exp : exp GEQ exp
725 { write_exp_elt_opcode (pstate, BINOP_GEQ); }
726 ;
727
728 exp : exp '<' exp
729 { write_exp_elt_opcode (pstate, BINOP_LESS); }
730 ;
731
732 exp : exp '>' exp
733 { write_exp_elt_opcode (pstate, BINOP_GTR); }
734 ;
735
736 exp : exp '&' exp
737 { write_exp_elt_opcode (pstate, BINOP_BITWISE_AND); }
738 ;
739
740 exp : exp '^' exp
741 { write_exp_elt_opcode (pstate, BINOP_BITWISE_XOR); }
742 ;
743
744 exp : exp '|' exp
745 { write_exp_elt_opcode (pstate, BINOP_BITWISE_IOR); }
746 ;
747
748 exp : exp ANDAND exp
749 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); }
750 ;
751
752 exp : exp OROR exp
753 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); }
754 ;
755
756 exp : exp '?' exp ':' exp %prec '?'
757 { write_exp_elt_opcode (pstate, TERNOP_COND); }
758 ;
759
760 exp : exp '=' exp
761 { write_exp_elt_opcode (pstate, BINOP_ASSIGN); }
762 ;
763
764 exp : exp ASSIGN_MODIFY exp
765 { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY);
766 write_exp_elt_opcode (pstate, $2);
767 write_exp_elt_opcode (pstate,
768 BINOP_ASSIGN_MODIFY); }
769 ;
770
771 exp : INT
772 { write_exp_elt_opcode (pstate, OP_LONG);
773 write_exp_elt_type (pstate, $1.type);
774 write_exp_elt_longcst (pstate, (LONGEST) ($1.val));
775 write_exp_elt_opcode (pstate, OP_LONG); }
776 ;
777
778 exp : CHAR
779 {
780 struct stoken_vector vec;
781 vec.len = 1;
782 vec.tokens = &$1;
783 write_exp_string_vector (pstate, $1.type, &vec);
784 }
785 ;
786
787 exp : NAME_OR_INT
788 { YYSTYPE val;
789 parse_number (pstate, $1.stoken.ptr,
790 $1.stoken.length, 0, &val);
791 write_exp_elt_opcode (pstate, OP_LONG);
792 write_exp_elt_type (pstate, val.typed_val_int.type);
793 write_exp_elt_longcst (pstate,
794 (LONGEST) val.typed_val_int.val);
795 write_exp_elt_opcode (pstate, OP_LONG);
796 }
797 ;
798
799
800 exp : FLOAT
801 { write_exp_elt_opcode (pstate, OP_FLOAT);
802 write_exp_elt_type (pstate, $1.type);
803 write_exp_elt_floatcst (pstate, $1.val);
804 write_exp_elt_opcode (pstate, OP_FLOAT); }
805 ;
806
807 exp : variable
808 ;
809
810 exp : DOLLAR_VARIABLE
811 {
812 write_dollar_variable (pstate, $1);
813 }
814 ;
815
816 exp : SELECTOR '(' name ')'
817 {
818 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR);
819 write_exp_string (pstate, $3);
820 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); }
821 ;
822
823 exp : SIZEOF '(' type ')' %prec UNARY
824 { struct type *type = $3;
825 write_exp_elt_opcode (pstate, OP_LONG);
826 write_exp_elt_type (pstate, lookup_signed_typename
827 (pstate->language (),
828 "int"));
829 type = check_typedef (type);
830
831 /* $5.3.3/2 of the C++ Standard (n3290 draft)
832 says of sizeof: "When applied to a reference
833 or a reference type, the result is the size of
834 the referenced type." */
835 if (TYPE_IS_REFERENCE (type))
836 type = check_typedef (TYPE_TARGET_TYPE (type));
837 write_exp_elt_longcst (pstate,
838 (LONGEST) TYPE_LENGTH (type));
839 write_exp_elt_opcode (pstate, OP_LONG); }
840 ;
841
842 exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
843 { write_exp_elt_opcode (pstate,
844 UNOP_REINTERPRET_CAST); }
845 ;
846
847 exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
848 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
849 ;
850
851 exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
852 { write_exp_elt_opcode (pstate, UNOP_DYNAMIC_CAST); }
853 ;
854
855 exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
856 { /* We could do more error checking here, but
857 it doesn't seem worthwhile. */
858 write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
859 ;
860
861 string_exp:
862 STRING
863 {
864 /* We copy the string here, and not in the
865 lexer, to guarantee that we do not leak a
866 string. Note that we follow the
867 NUL-termination convention of the
868 lexer. */
869 struct typed_stoken *vec = XNEW (struct typed_stoken);
870 $$.len = 1;
871 $$.tokens = vec;
872
873 vec->type = $1.type;
874 vec->length = $1.length;
875 vec->ptr = (char *) malloc ($1.length + 1);
876 memcpy (vec->ptr, $1.ptr, $1.length + 1);
877 }
878
879 | string_exp STRING
880 {
881 /* Note that we NUL-terminate here, but just
882 for convenience. */
883 char *p;
884 ++$$.len;
885 $$.tokens = XRESIZEVEC (struct typed_stoken,
886 $$.tokens, $$.len);
887
888 p = (char *) malloc ($2.length + 1);
889 memcpy (p, $2.ptr, $2.length + 1);
890
891 $$.tokens[$$.len - 1].type = $2.type;
892 $$.tokens[$$.len - 1].length = $2.length;
893 $$.tokens[$$.len - 1].ptr = p;
894 }
895 ;
896
897 exp : string_exp
898 {
899 int i;
900 c_string_type type = C_STRING;
901
902 for (i = 0; i < $1.len; ++i)
903 {
904 switch ($1.tokens[i].type)
905 {
906 case C_STRING:
907 break;
908 case C_WIDE_STRING:
909 case C_STRING_16:
910 case C_STRING_32:
911 if (type != C_STRING
912 && type != $1.tokens[i].type)
913 error (_("Undefined string concatenation."));
914 type = (enum c_string_type_values) $1.tokens[i].type;
915 break;
916 default:
917 /* internal error */
918 internal_error (__FILE__, __LINE__,
919 "unrecognized type in string concatenation");
920 }
921 }
922
923 write_exp_string_vector (pstate, type, &$1);
924 for (i = 0; i < $1.len; ++i)
925 free ($1.tokens[i].ptr);
926 free ($1.tokens);
927 }
928 ;
929
930 exp : NSSTRING /* ObjC NextStep NSString constant
931 * of the form '@' '"' string '"'.
932 */
933 { write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING);
934 write_exp_string (pstate, $1);
935 write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); }
936 ;
937
938 /* C++. */
939 exp : TRUEKEYWORD
940 { write_exp_elt_opcode (pstate, OP_LONG);
941 write_exp_elt_type (pstate,
942 parse_type (pstate)->builtin_bool);
943 write_exp_elt_longcst (pstate, (LONGEST) 1);
944 write_exp_elt_opcode (pstate, OP_LONG); }
945 ;
946
947 exp : FALSEKEYWORD
948 { write_exp_elt_opcode (pstate, OP_LONG);
949 write_exp_elt_type (pstate,
950 parse_type (pstate)->builtin_bool);
951 write_exp_elt_longcst (pstate, (LONGEST) 0);
952 write_exp_elt_opcode (pstate, OP_LONG); }
953 ;
954
955 /* end of C++. */
956
957 block : BLOCKNAME
958 {
959 if ($1.sym.symbol)
960 $$ = SYMBOL_BLOCK_VALUE ($1.sym.symbol);
961 else
962 error (_("No file or function \"%s\"."),
963 copy_name ($1.stoken).c_str ());
964 }
965 | FILENAME
966 {
967 $$ = $1;
968 }
969 ;
970
971 block : block COLONCOLON name
972 {
973 std::string copy = copy_name ($3);
974 struct symbol *tem
975 = lookup_symbol (copy.c_str (), $1,
976 VAR_DOMAIN, NULL).symbol;
977
978 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
979 error (_("No function \"%s\" in specified context."),
980 copy.c_str ());
981 $$ = SYMBOL_BLOCK_VALUE (tem); }
982 ;
983
984 variable: name_not_typename ENTRY
985 { struct symbol *sym = $1.sym.symbol;
986
987 if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym)
988 || !symbol_read_needs_frame (sym))
989 error (_("@entry can be used only for function "
990 "parameters, not for \"%s\""),
991 copy_name ($1.stoken).c_str ());
992
993 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
994 write_exp_elt_sym (pstate, sym);
995 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
996 }
997 ;
998
999 variable: block COLONCOLON name
1000 {
1001 std::string copy = copy_name ($3);
1002 struct block_symbol sym
1003 = lookup_symbol (copy.c_str (), $1,
1004 VAR_DOMAIN, NULL);
1005
1006 if (sym.symbol == 0)
1007 error (_("No symbol \"%s\" in specified context."),
1008 copy.c_str ());
1009 if (symbol_read_needs_frame (sym.symbol))
1010 pstate->block_tracker->update (sym);
1011
1012 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1013 write_exp_elt_block (pstate, sym.block);
1014 write_exp_elt_sym (pstate, sym.symbol);
1015 write_exp_elt_opcode (pstate, OP_VAR_VALUE); }
1016 ;
1017
1018 qualified_name: TYPENAME COLONCOLON name
1019 {
1020 struct type *type = $1.type;
1021 type = check_typedef (type);
1022 if (!type_aggregate_p (type))
1023 error (_("`%s' is not defined as an aggregate type."),
1024 TYPE_SAFE_NAME (type));
1025
1026 write_exp_elt_opcode (pstate, OP_SCOPE);
1027 write_exp_elt_type (pstate, type);
1028 write_exp_string (pstate, $3);
1029 write_exp_elt_opcode (pstate, OP_SCOPE);
1030 }
1031 | TYPENAME COLONCOLON '~' name
1032 {
1033 struct type *type = $1.type;
1034 struct stoken tmp_token;
1035 char *buf;
1036
1037 type = check_typedef (type);
1038 if (!type_aggregate_p (type))
1039 error (_("`%s' is not defined as an aggregate type."),
1040 TYPE_SAFE_NAME (type));
1041 buf = (char *) alloca ($4.length + 2);
1042 tmp_token.ptr = buf;
1043 tmp_token.length = $4.length + 1;
1044 buf[0] = '~';
1045 memcpy (buf+1, $4.ptr, $4.length);
1046 buf[tmp_token.length] = 0;
1047
1048 /* Check for valid destructor name. */
1049 destructor_name_p (tmp_token.ptr, $1.type);
1050 write_exp_elt_opcode (pstate, OP_SCOPE);
1051 write_exp_elt_type (pstate, type);
1052 write_exp_string (pstate, tmp_token);
1053 write_exp_elt_opcode (pstate, OP_SCOPE);
1054 }
1055 | TYPENAME COLONCOLON name COLONCOLON name
1056 {
1057 std::string copy = copy_name ($3);
1058 error (_("No type \"%s\" within class "
1059 "or namespace \"%s\"."),
1060 copy.c_str (), TYPE_SAFE_NAME ($1.type));
1061 }
1062 ;
1063
1064 variable: qualified_name
1065 | COLONCOLON name_not_typename
1066 {
1067 std::string name = copy_name ($2.stoken);
1068 struct symbol *sym;
1069 struct bound_minimal_symbol msymbol;
1070
1071 sym
1072 = lookup_symbol (name.c_str (),
1073 (const struct block *) NULL,
1074 VAR_DOMAIN, NULL).symbol;
1075 if (sym)
1076 {
1077 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1078 write_exp_elt_block (pstate, NULL);
1079 write_exp_elt_sym (pstate, sym);
1080 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1081 break;
1082 }
1083
1084 msymbol = lookup_bound_minimal_symbol (name.c_str ());
1085 if (msymbol.minsym != NULL)
1086 write_exp_msymbol (pstate, msymbol);
1087 else if (!have_full_symbols () && !have_partial_symbols ())
1088 error (_("No symbol table is loaded. Use the \"file\" command."));
1089 else
1090 error (_("No symbol \"%s\" in current context."),
1091 name.c_str ());
1092 }
1093 ;
1094
1095 variable: name_not_typename
1096 { struct block_symbol sym = $1.sym;
1097
1098 if (sym.symbol)
1099 {
1100 if (symbol_read_needs_frame (sym.symbol))
1101 pstate->block_tracker->update (sym);
1102
1103 /* If we found a function, see if it's
1104 an ifunc resolver that has the same
1105 address as the ifunc symbol itself.
1106 If so, prefer the ifunc symbol. */
1107
1108 bound_minimal_symbol resolver
1109 = find_gnu_ifunc (sym.symbol);
1110 if (resolver.minsym != NULL)
1111 write_exp_msymbol (pstate, resolver);
1112 else
1113 {
1114 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1115 write_exp_elt_block (pstate, sym.block);
1116 write_exp_elt_sym (pstate, sym.symbol);
1117 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1118 }
1119 }
1120 else if ($1.is_a_field_of_this)
1121 {
1122 /* C++: it hangs off of `this'. Must
1123 not inadvertently convert from a method call
1124 to data ref. */
1125 pstate->block_tracker->update (sym);
1126 write_exp_elt_opcode (pstate, OP_THIS);
1127 write_exp_elt_opcode (pstate, OP_THIS);
1128 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1129 write_exp_string (pstate, $1.stoken);
1130 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1131 }
1132 else
1133 {
1134 std::string arg = copy_name ($1.stoken);
1135
1136 bound_minimal_symbol msymbol
1137 = lookup_bound_minimal_symbol (arg.c_str ());
1138 if (msymbol.minsym == NULL)
1139 {
1140 if (!have_full_symbols () && !have_partial_symbols ())
1141 error (_("No symbol table is loaded. Use the \"file\" command."));
1142 else
1143 error (_("No symbol \"%s\" in current context."),
1144 arg.c_str ());
1145 }
1146
1147 /* This minsym might be an alias for
1148 another function. See if we can find
1149 the debug symbol for the target, and
1150 if so, use it instead, since it has
1151 return type / prototype info. This
1152 is important for example for "p
1153 *__errno_location()". */
1154 symbol *alias_target
1155 = ((msymbol.minsym->type != mst_text_gnu_ifunc
1156 && msymbol.minsym->type != mst_data_gnu_ifunc)
1157 ? find_function_alias_target (msymbol)
1158 : NULL);
1159 if (alias_target != NULL)
1160 {
1161 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1162 write_exp_elt_block
1163 (pstate, SYMBOL_BLOCK_VALUE (alias_target));
1164 write_exp_elt_sym (pstate, alias_target);
1165 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1166 }
1167 else
1168 write_exp_msymbol (pstate, msymbol);
1169 }
1170 }
1171 ;
1172
1173 const_or_volatile: const_or_volatile_noopt
1174 |
1175 ;
1176
1177 single_qualifier:
1178 CONST_KEYWORD
1179 { cpstate->type_stack.insert (tp_const); }
1180 | VOLATILE_KEYWORD
1181 { cpstate->type_stack.insert (tp_volatile); }
1182 | ATOMIC
1183 { cpstate->type_stack.insert (tp_atomic); }
1184 | RESTRICT
1185 { cpstate->type_stack.insert (tp_restrict); }
1186 | '@' NAME
1187 {
1188 cpstate->type_stack.insert (pstate,
1189 copy_name ($2.stoken).c_str ());
1190 }
1191 ;
1192
1193 qualifier_seq_noopt:
1194 single_qualifier
1195 | qualifier_seq single_qualifier
1196 ;
1197
1198 qualifier_seq:
1199 qualifier_seq_noopt
1200 |
1201 ;
1202
1203 ptr_operator:
1204 ptr_operator '*'
1205 { cpstate->type_stack.insert (tp_pointer); }
1206 qualifier_seq
1207 | '*'
1208 { cpstate->type_stack.insert (tp_pointer); }
1209 qualifier_seq
1210 | '&'
1211 { cpstate->type_stack.insert (tp_reference); }
1212 | '&' ptr_operator
1213 { cpstate->type_stack.insert (tp_reference); }
1214 | ANDAND
1215 { cpstate->type_stack.insert (tp_rvalue_reference); }
1216 | ANDAND ptr_operator
1217 { cpstate->type_stack.insert (tp_rvalue_reference); }
1218 ;
1219
1220 ptr_operator_ts: ptr_operator
1221 {
1222 $$ = cpstate->type_stack.create ();
1223 cpstate->type_stacks.emplace_back ($$);
1224 }
1225 ;
1226
1227 abs_decl: ptr_operator_ts direct_abs_decl
1228 { $$ = $2->append ($1); }
1229 | ptr_operator_ts
1230 | direct_abs_decl
1231 ;
1232
1233 direct_abs_decl: '(' abs_decl ')'
1234 { $$ = $2; }
1235 | direct_abs_decl array_mod
1236 {
1237 cpstate->type_stack.push ($1);
1238 cpstate->type_stack.push ($2);
1239 cpstate->type_stack.push (tp_array);
1240 $$ = cpstate->type_stack.create ();
1241 cpstate->type_stacks.emplace_back ($$);
1242 }
1243 | array_mod
1244 {
1245 cpstate->type_stack.push ($1);
1246 cpstate->type_stack.push (tp_array);
1247 $$ = cpstate->type_stack.create ();
1248 cpstate->type_stacks.emplace_back ($$);
1249 }
1250
1251 | direct_abs_decl func_mod
1252 {
1253 cpstate->type_stack.push ($1);
1254 cpstate->type_stack.push ($2);
1255 $$ = cpstate->type_stack.create ();
1256 cpstate->type_stacks.emplace_back ($$);
1257 }
1258 | func_mod
1259 {
1260 cpstate->type_stack.push ($1);
1261 $$ = cpstate->type_stack.create ();
1262 cpstate->type_stacks.emplace_back ($$);
1263 }
1264 ;
1265
1266 array_mod: '[' ']'
1267 { $$ = -1; }
1268 | OBJC_LBRAC ']'
1269 { $$ = -1; }
1270 | '[' INT ']'
1271 { $$ = $2.val; }
1272 | OBJC_LBRAC INT ']'
1273 { $$ = $2.val; }
1274 ;
1275
1276 func_mod: '(' ')'
1277 {
1278 $$ = new std::vector<struct type *>;
1279 cpstate->type_lists.emplace_back ($$);
1280 }
1281 | '(' parameter_typelist ')'
1282 { $$ = $2; }
1283 ;
1284
1285 /* We used to try to recognize pointer to member types here, but
1286 that didn't work (shift/reduce conflicts meant that these rules never
1287 got executed). The problem is that
1288 int (foo::bar::baz::bizzle)
1289 is a function type but
1290 int (foo::bar::baz::bizzle::*)
1291 is a pointer to member type. Stroustrup loses again! */
1292
1293 type : ptype
1294 ;
1295
1296 /* Implements (approximately): (type-qualifier)* type-specifier.
1297
1298 When type-specifier is only ever a single word, like 'float' then these
1299 arrive as pre-built TYPENAME tokens thanks to the classify_name
1300 function. However, when a type-specifier can contain multiple words,
1301 for example 'double' can appear as just 'double' or 'long double', and
1302 similarly 'long' can appear as just 'long' or in 'long double', then
1303 these type-specifiers are parsed into their own tokens in the function
1304 lex_one_token and the ident_tokens array. These separate tokens are all
1305 recognised here. */
1306 typebase
1307 : TYPENAME
1308 { $$ = $1.type; }
1309 | INT_KEYWORD
1310 { $$ = lookup_signed_typename (pstate->language (),
1311 "int"); }
1312 | LONG
1313 { $$ = lookup_signed_typename (pstate->language (),
1314 "long"); }
1315 | SHORT
1316 { $$ = lookup_signed_typename (pstate->language (),
1317 "short"); }
1318 | LONG INT_KEYWORD
1319 { $$ = lookup_signed_typename (pstate->language (),
1320 "long"); }
1321 | LONG SIGNED_KEYWORD INT_KEYWORD
1322 { $$ = lookup_signed_typename (pstate->language (),
1323 "long"); }
1324 | LONG SIGNED_KEYWORD
1325 { $$ = lookup_signed_typename (pstate->language (),
1326 "long"); }
1327 | SIGNED_KEYWORD LONG INT_KEYWORD
1328 { $$ = lookup_signed_typename (pstate->language (),
1329 "long"); }
1330 | UNSIGNED LONG INT_KEYWORD
1331 { $$ = lookup_unsigned_typename (pstate->language (),
1332 "long"); }
1333 | LONG UNSIGNED INT_KEYWORD
1334 { $$ = lookup_unsigned_typename (pstate->language (),
1335 "long"); }
1336 | LONG UNSIGNED
1337 { $$ = lookup_unsigned_typename (pstate->language (),
1338 "long"); }
1339 | LONG LONG
1340 { $$ = lookup_signed_typename (pstate->language (),
1341 "long long"); }
1342 | LONG LONG INT_KEYWORD
1343 { $$ = lookup_signed_typename (pstate->language (),
1344 "long long"); }
1345 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1346 { $$ = lookup_signed_typename (pstate->language (),
1347 "long long"); }
1348 | LONG LONG SIGNED_KEYWORD
1349 { $$ = lookup_signed_typename (pstate->language (),
1350 "long long"); }
1351 | SIGNED_KEYWORD LONG LONG
1352 { $$ = lookup_signed_typename (pstate->language (),
1353 "long long"); }
1354 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1355 { $$ = lookup_signed_typename (pstate->language (),
1356 "long long"); }
1357 | UNSIGNED LONG LONG
1358 { $$ = lookup_unsigned_typename (pstate->language (),
1359 "long long"); }
1360 | UNSIGNED LONG LONG INT_KEYWORD
1361 { $$ = lookup_unsigned_typename (pstate->language (),
1362 "long long"); }
1363 | LONG LONG UNSIGNED
1364 { $$ = lookup_unsigned_typename (pstate->language (),
1365 "long long"); }
1366 | LONG LONG UNSIGNED INT_KEYWORD
1367 { $$ = lookup_unsigned_typename (pstate->language (),
1368 "long long"); }
1369 | SHORT INT_KEYWORD
1370 { $$ = lookup_signed_typename (pstate->language (),
1371 "short"); }
1372 | SHORT SIGNED_KEYWORD INT_KEYWORD
1373 { $$ = lookup_signed_typename (pstate->language (),
1374 "short"); }
1375 | SHORT SIGNED_KEYWORD
1376 { $$ = lookup_signed_typename (pstate->language (),
1377 "short"); }
1378 | UNSIGNED SHORT INT_KEYWORD
1379 { $$ = lookup_unsigned_typename (pstate->language (),
1380 "short"); }
1381 | SHORT UNSIGNED
1382 { $$ = lookup_unsigned_typename (pstate->language (),
1383 "short"); }
1384 | SHORT UNSIGNED INT_KEYWORD
1385 { $$ = lookup_unsigned_typename (pstate->language (),
1386 "short"); }
1387 | DOUBLE_KEYWORD
1388 { $$ = lookup_typename (pstate->language (),
1389 "double",
1390 NULL,
1391 0); }
1392 | LONG DOUBLE_KEYWORD
1393 { $$ = lookup_typename (pstate->language (),
1394 "long double",
1395 NULL,
1396 0); }
1397 | STRUCT name
1398 { $$
1399 = lookup_struct (copy_name ($2).c_str (),
1400 pstate->expression_context_block);
1401 }
1402 | STRUCT COMPLETE
1403 {
1404 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1405 "", 0);
1406 $$ = NULL;
1407 }
1408 | STRUCT name COMPLETE
1409 {
1410 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1411 $2.ptr, $2.length);
1412 $$ = NULL;
1413 }
1414 | CLASS name
1415 { $$ = lookup_struct
1416 (copy_name ($2).c_str (),
1417 pstate->expression_context_block);
1418 }
1419 | CLASS COMPLETE
1420 {
1421 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1422 "", 0);
1423 $$ = NULL;
1424 }
1425 | CLASS name COMPLETE
1426 {
1427 pstate->mark_completion_tag (TYPE_CODE_STRUCT,
1428 $2.ptr, $2.length);
1429 $$ = NULL;
1430 }
1431 | UNION name
1432 { $$
1433 = lookup_union (copy_name ($2).c_str (),
1434 pstate->expression_context_block);
1435 }
1436 | UNION COMPLETE
1437 {
1438 pstate->mark_completion_tag (TYPE_CODE_UNION,
1439 "", 0);
1440 $$ = NULL;
1441 }
1442 | UNION name COMPLETE
1443 {
1444 pstate->mark_completion_tag (TYPE_CODE_UNION,
1445 $2.ptr, $2.length);
1446 $$ = NULL;
1447 }
1448 | ENUM name
1449 { $$ = lookup_enum (copy_name ($2).c_str (),
1450 pstate->expression_context_block);
1451 }
1452 | ENUM COMPLETE
1453 {
1454 pstate->mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1455 $$ = NULL;
1456 }
1457 | ENUM name COMPLETE
1458 {
1459 pstate->mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1460 $2.length);
1461 $$ = NULL;
1462 }
1463 | UNSIGNED type_name
1464 { $$ = lookup_unsigned_typename (pstate->language (),
1465 TYPE_NAME($2.type)); }
1466 | UNSIGNED
1467 { $$ = lookup_unsigned_typename (pstate->language (),
1468 "int"); }
1469 | SIGNED_KEYWORD type_name
1470 { $$ = lookup_signed_typename (pstate->language (),
1471 TYPE_NAME($2.type)); }
1472 | SIGNED_KEYWORD
1473 { $$ = lookup_signed_typename (pstate->language (),
1474 "int"); }
1475 /* It appears that this rule for templates is never
1476 reduced; template recognition happens by lookahead
1477 in the token processing code in yylex. */
1478 | TEMPLATE name '<' type '>'
1479 { $$ = lookup_template_type
1480 (copy_name($2).c_str (), $4,
1481 pstate->expression_context_block);
1482 }
1483 | qualifier_seq_noopt typebase
1484 { $$ = cpstate->type_stack.follow_types ($2); }
1485 | typebase qualifier_seq_noopt
1486 { $$ = cpstate->type_stack.follow_types ($1); }
1487 ;
1488
1489 type_name: TYPENAME
1490 | INT_KEYWORD
1491 {
1492 $$.stoken.ptr = "int";
1493 $$.stoken.length = 3;
1494 $$.type = lookup_signed_typename (pstate->language (),
1495 "int");
1496 }
1497 | LONG
1498 {
1499 $$.stoken.ptr = "long";
1500 $$.stoken.length = 4;
1501 $$.type = lookup_signed_typename (pstate->language (),
1502 "long");
1503 }
1504 | SHORT
1505 {
1506 $$.stoken.ptr = "short";
1507 $$.stoken.length = 5;
1508 $$.type = lookup_signed_typename (pstate->language (),
1509 "short");
1510 }
1511 ;
1512
1513 parameter_typelist:
1514 nonempty_typelist
1515 { check_parameter_typelist ($1); }
1516 | nonempty_typelist ',' DOTDOTDOT
1517 {
1518 $1->push_back (NULL);
1519 check_parameter_typelist ($1);
1520 $$ = $1;
1521 }
1522 ;
1523
1524 nonempty_typelist
1525 : type
1526 {
1527 std::vector<struct type *> *typelist
1528 = new std::vector<struct type *>;
1529 cpstate->type_lists.emplace_back (typelist);
1530
1531 typelist->push_back ($1);
1532 $$ = typelist;
1533 }
1534 | nonempty_typelist ',' type
1535 {
1536 $1->push_back ($3);
1537 $$ = $1;
1538 }
1539 ;
1540
1541 ptype : typebase
1542 | ptype abs_decl
1543 {
1544 cpstate->type_stack.push ($2);
1545 $$ = cpstate->type_stack.follow_types ($1);
1546 }
1547 ;
1548
1549 conversion_type_id: typebase conversion_declarator
1550 { $$ = cpstate->type_stack.follow_types ($1); }
1551 ;
1552
1553 conversion_declarator: /* Nothing. */
1554 | ptr_operator conversion_declarator
1555 ;
1556
1557 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1558 | VOLATILE_KEYWORD CONST_KEYWORD
1559 ;
1560
1561 const_or_volatile_noopt: const_and_volatile
1562 { cpstate->type_stack.insert (tp_const);
1563 cpstate->type_stack.insert (tp_volatile);
1564 }
1565 | CONST_KEYWORD
1566 { cpstate->type_stack.insert (tp_const); }
1567 | VOLATILE_KEYWORD
1568 { cpstate->type_stack.insert (tp_volatile); }
1569 ;
1570
1571 oper: OPERATOR NEW
1572 { $$ = operator_stoken (" new"); }
1573 | OPERATOR DELETE
1574 { $$ = operator_stoken (" delete"); }
1575 | OPERATOR NEW '[' ']'
1576 { $$ = operator_stoken (" new[]"); }
1577 | OPERATOR DELETE '[' ']'
1578 { $$ = operator_stoken (" delete[]"); }
1579 | OPERATOR NEW OBJC_LBRAC ']'
1580 { $$ = operator_stoken (" new[]"); }
1581 | OPERATOR DELETE OBJC_LBRAC ']'
1582 { $$ = operator_stoken (" delete[]"); }
1583 | OPERATOR '+'
1584 { $$ = operator_stoken ("+"); }
1585 | OPERATOR '-'
1586 { $$ = operator_stoken ("-"); }
1587 | OPERATOR '*'
1588 { $$ = operator_stoken ("*"); }
1589 | OPERATOR '/'
1590 { $$ = operator_stoken ("/"); }
1591 | OPERATOR '%'
1592 { $$ = operator_stoken ("%"); }
1593 | OPERATOR '^'
1594 { $$ = operator_stoken ("^"); }
1595 | OPERATOR '&'
1596 { $$ = operator_stoken ("&"); }
1597 | OPERATOR '|'
1598 { $$ = operator_stoken ("|"); }
1599 | OPERATOR '~'
1600 { $$ = operator_stoken ("~"); }
1601 | OPERATOR '!'
1602 { $$ = operator_stoken ("!"); }
1603 | OPERATOR '='
1604 { $$ = operator_stoken ("="); }
1605 | OPERATOR '<'
1606 { $$ = operator_stoken ("<"); }
1607 | OPERATOR '>'
1608 { $$ = operator_stoken (">"); }
1609 | OPERATOR ASSIGN_MODIFY
1610 { const char *op = " unknown";
1611 switch ($2)
1612 {
1613 case BINOP_RSH:
1614 op = ">>=";
1615 break;
1616 case BINOP_LSH:
1617 op = "<<=";
1618 break;
1619 case BINOP_ADD:
1620 op = "+=";
1621 break;
1622 case BINOP_SUB:
1623 op = "-=";
1624 break;
1625 case BINOP_MUL:
1626 op = "*=";
1627 break;
1628 case BINOP_DIV:
1629 op = "/=";
1630 break;
1631 case BINOP_REM:
1632 op = "%=";
1633 break;
1634 case BINOP_BITWISE_IOR:
1635 op = "|=";
1636 break;
1637 case BINOP_BITWISE_AND:
1638 op = "&=";
1639 break;
1640 case BINOP_BITWISE_XOR:
1641 op = "^=";
1642 break;
1643 default:
1644 break;
1645 }
1646
1647 $$ = operator_stoken (op);
1648 }
1649 | OPERATOR LSH
1650 { $$ = operator_stoken ("<<"); }
1651 | OPERATOR RSH
1652 { $$ = operator_stoken (">>"); }
1653 | OPERATOR EQUAL
1654 { $$ = operator_stoken ("=="); }
1655 | OPERATOR NOTEQUAL
1656 { $$ = operator_stoken ("!="); }
1657 | OPERATOR LEQ
1658 { $$ = operator_stoken ("<="); }
1659 | OPERATOR GEQ
1660 { $$ = operator_stoken (">="); }
1661 | OPERATOR ANDAND
1662 { $$ = operator_stoken ("&&"); }
1663 | OPERATOR OROR
1664 { $$ = operator_stoken ("||"); }
1665 | OPERATOR INCREMENT
1666 { $$ = operator_stoken ("++"); }
1667 | OPERATOR DECREMENT
1668 { $$ = operator_stoken ("--"); }
1669 | OPERATOR ','
1670 { $$ = operator_stoken (","); }
1671 | OPERATOR ARROW_STAR
1672 { $$ = operator_stoken ("->*"); }
1673 | OPERATOR ARROW
1674 { $$ = operator_stoken ("->"); }
1675 | OPERATOR '(' ')'
1676 { $$ = operator_stoken ("()"); }
1677 | OPERATOR '[' ']'
1678 { $$ = operator_stoken ("[]"); }
1679 | OPERATOR OBJC_LBRAC ']'
1680 { $$ = operator_stoken ("[]"); }
1681 | OPERATOR conversion_type_id
1682 { string_file buf;
1683
1684 c_print_type ($2, NULL, &buf, -1, 0,
1685 &type_print_raw_options);
1686
1687 /* This also needs canonicalization. */
1688 std::string canon
1689 = cp_canonicalize_string (buf.c_str ());
1690 if (canon.empty ())
1691 canon = std::move (buf.string ());
1692 $$ = operator_stoken ((" " + canon).c_str ());
1693 }
1694 ;
1695
1696 /* This rule exists in order to allow some tokens that would not normally
1697 match the 'name' rule to appear as fields within a struct. The example
1698 that initially motivated this was the RISC-V target which models the
1699 floating point registers as a union with fields called 'float' and
1700 'double'. The 'float' string becomes a TYPENAME token and can appear
1701 anywhere a 'name' can, however 'double' is its own token,
1702 DOUBLE_KEYWORD, and doesn't match the 'name' rule.*/
1703 field_name
1704 : name
1705 | DOUBLE_KEYWORD { $$ = typename_stoken ("double"); }
1706 | INT_KEYWORD { $$ = typename_stoken ("int"); }
1707 | LONG { $$ = typename_stoken ("long"); }
1708 | SHORT { $$ = typename_stoken ("short"); }
1709 | SIGNED_KEYWORD { $$ = typename_stoken ("signed"); }
1710 | UNSIGNED { $$ = typename_stoken ("unsigned"); }
1711 ;
1712
1713 name : NAME { $$ = $1.stoken; }
1714 | BLOCKNAME { $$ = $1.stoken; }
1715 | TYPENAME { $$ = $1.stoken; }
1716 | NAME_OR_INT { $$ = $1.stoken; }
1717 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1718 | oper { $$ = $1; }
1719 ;
1720
1721 name_not_typename : NAME
1722 | BLOCKNAME
1723 /* These would be useful if name_not_typename was useful, but it is just
1724 a fake for "variable", so these cause reduce/reduce conflicts because
1725 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1726 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1727 context where only a name could occur, this might be useful.
1728 | NAME_OR_INT
1729 */
1730 | oper
1731 {
1732 struct field_of_this_result is_a_field_of_this;
1733
1734 $$.stoken = $1;
1735 $$.sym
1736 = lookup_symbol ($1.ptr,
1737 pstate->expression_context_block,
1738 VAR_DOMAIN,
1739 &is_a_field_of_this);
1740 $$.is_a_field_of_this
1741 = is_a_field_of_this.type != NULL;
1742 }
1743 | UNKNOWN_CPP_NAME
1744 ;
1745
1746 %%
1747
1748 /* Like write_exp_string, but prepends a '~'. */
1749
1750 static void
1751 write_destructor_name (struct parser_state *par_state, struct stoken token)
1752 {
1753 char *copy = (char *) alloca (token.length + 1);
1754
1755 copy[0] = '~';
1756 memcpy (&copy[1], token.ptr, token.length);
1757
1758 token.ptr = copy;
1759 ++token.length;
1760
1761 write_exp_string (par_state, token);
1762 }
1763
1764 /* Returns a stoken of the operator name given by OP (which does not
1765 include the string "operator"). */
1766
1767 static struct stoken
1768 operator_stoken (const char *op)
1769 {
1770 struct stoken st = { NULL, 0 };
1771 char *buf;
1772
1773 st.length = CP_OPERATOR_LEN + strlen (op);
1774 buf = (char *) malloc (st.length + 1);
1775 strcpy (buf, CP_OPERATOR_STR);
1776 strcat (buf, op);
1777 st.ptr = buf;
1778
1779 /* The toplevel (c_parse) will free the memory allocated here. */
1780 cpstate->strings.emplace_back (buf);
1781 return st;
1782 };
1783
1784 /* Returns a stoken of the type named TYPE. */
1785
1786 static struct stoken
1787 typename_stoken (const char *type)
1788 {
1789 struct stoken st = { type, 0 };
1790 st.length = strlen (type);
1791 return st;
1792 };
1793
1794 /* Return true if the type is aggregate-like. */
1795
1796 static int
1797 type_aggregate_p (struct type *type)
1798 {
1799 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1800 || TYPE_CODE (type) == TYPE_CODE_UNION
1801 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1802 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1803 && TYPE_DECLARED_CLASS (type)));
1804 }
1805
1806 /* Validate a parameter typelist. */
1807
1808 static void
1809 check_parameter_typelist (std::vector<struct type *> *params)
1810 {
1811 struct type *type;
1812 int ix;
1813
1814 for (ix = 0; ix < params->size (); ++ix)
1815 {
1816 type = (*params)[ix];
1817 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1818 {
1819 if (ix == 0)
1820 {
1821 if (params->size () == 1)
1822 {
1823 /* Ok. */
1824 break;
1825 }
1826 error (_("parameter types following 'void'"));
1827 }
1828 else
1829 error (_("'void' invalid as parameter type"));
1830 }
1831 }
1832 }
1833
1834 /* Take care of parsing a number (anything that starts with a digit).
1835 Set yylval and return the token type; update lexptr.
1836 LEN is the number of characters in it. */
1837
1838 /*** Needs some error checking for the float case ***/
1839
1840 static int
1841 parse_number (struct parser_state *par_state,
1842 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1843 {
1844 ULONGEST n = 0;
1845 ULONGEST prevn = 0;
1846 ULONGEST un;
1847
1848 int i = 0;
1849 int c;
1850 int base = input_radix;
1851 int unsigned_p = 0;
1852
1853 /* Number of "L" suffixes encountered. */
1854 int long_p = 0;
1855
1856 /* We have found a "L" or "U" suffix. */
1857 int found_suffix = 0;
1858
1859 ULONGEST high_bit;
1860 struct type *signed_type;
1861 struct type *unsigned_type;
1862 char *p;
1863
1864 p = (char *) alloca (len);
1865 memcpy (p, buf, len);
1866
1867 if (parsed_float)
1868 {
1869 /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */
1870 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1871 {
1872 putithere->typed_val_float.type
1873 = parse_type (par_state)->builtin_decfloat;
1874 len -= 2;
1875 }
1876 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1877 {
1878 putithere->typed_val_float.type
1879 = parse_type (par_state)->builtin_decdouble;
1880 len -= 2;
1881 }
1882 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1883 {
1884 putithere->typed_val_float.type
1885 = parse_type (par_state)->builtin_declong;
1886 len -= 2;
1887 }
1888 /* Handle suffixes: 'f' for float, 'l' for long double. */
1889 else if (len >= 1 && TOLOWER (p[len - 1]) == 'f')
1890 {
1891 putithere->typed_val_float.type
1892 = parse_type (par_state)->builtin_float;
1893 len -= 1;
1894 }
1895 else if (len >= 1 && TOLOWER (p[len - 1]) == 'l')
1896 {
1897 putithere->typed_val_float.type
1898 = parse_type (par_state)->builtin_long_double;
1899 len -= 1;
1900 }
1901 /* Default type for floating-point literals is double. */
1902 else
1903 {
1904 putithere->typed_val_float.type
1905 = parse_type (par_state)->builtin_double;
1906 }
1907
1908 if (!parse_float (p, len,
1909 putithere->typed_val_float.type,
1910 putithere->typed_val_float.val))
1911 return ERROR;
1912 return FLOAT;
1913 }
1914
1915 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1916 if (p[0] == '0' && len > 1)
1917 switch (p[1])
1918 {
1919 case 'x':
1920 case 'X':
1921 if (len >= 3)
1922 {
1923 p += 2;
1924 base = 16;
1925 len -= 2;
1926 }
1927 break;
1928
1929 case 'b':
1930 case 'B':
1931 if (len >= 3)
1932 {
1933 p += 2;
1934 base = 2;
1935 len -= 2;
1936 }
1937 break;
1938
1939 case 't':
1940 case 'T':
1941 case 'd':
1942 case 'D':
1943 if (len >= 3)
1944 {
1945 p += 2;
1946 base = 10;
1947 len -= 2;
1948 }
1949 break;
1950
1951 default:
1952 base = 8;
1953 break;
1954 }
1955
1956 while (len-- > 0)
1957 {
1958 c = *p++;
1959 if (c >= 'A' && c <= 'Z')
1960 c += 'a' - 'A';
1961 if (c != 'l' && c != 'u')
1962 n *= base;
1963 if (c >= '0' && c <= '9')
1964 {
1965 if (found_suffix)
1966 return ERROR;
1967 n += i = c - '0';
1968 }
1969 else
1970 {
1971 if (base > 10 && c >= 'a' && c <= 'f')
1972 {
1973 if (found_suffix)
1974 return ERROR;
1975 n += i = c - 'a' + 10;
1976 }
1977 else if (c == 'l')
1978 {
1979 ++long_p;
1980 found_suffix = 1;
1981 }
1982 else if (c == 'u')
1983 {
1984 unsigned_p = 1;
1985 found_suffix = 1;
1986 }
1987 else
1988 return ERROR; /* Char not a digit */
1989 }
1990 if (i >= base)
1991 return ERROR; /* Invalid digit in this base */
1992
1993 /* Portably test for overflow (only works for nonzero values, so make
1994 a second check for zero). FIXME: Can't we just make n and prevn
1995 unsigned and avoid this? */
1996 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1997 unsigned_p = 1; /* Try something unsigned */
1998
1999 /* Portably test for unsigned overflow.
2000 FIXME: This check is wrong; for example it doesn't find overflow
2001 on 0x123456789 when LONGEST is 32 bits. */
2002 if (c != 'l' && c != 'u' && n != 0)
2003 {
2004 if (unsigned_p && prevn >= n)
2005 error (_("Numeric constant too large."));
2006 }
2007 prevn = n;
2008 }
2009
2010 /* An integer constant is an int, a long, or a long long. An L
2011 suffix forces it to be long; an LL suffix forces it to be long
2012 long. If not forced to a larger size, it gets the first type of
2013 the above that it fits in. To figure out whether it fits, we
2014 shift it right and see whether anything remains. Note that we
2015 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
2016 operation, because many compilers will warn about such a shift
2017 (which always produces a zero result). Sometimes gdbarch_int_bit
2018 or gdbarch_long_bit will be that big, sometimes not. To deal with
2019 the case where it is we just always shift the value more than
2020 once, with fewer bits each time. */
2021
2022 un = n >> 2;
2023 if (long_p == 0
2024 && (un >> (gdbarch_int_bit (par_state->gdbarch ()) - 2)) == 0)
2025 {
2026 high_bit
2027 = ((ULONGEST)1) << (gdbarch_int_bit (par_state->gdbarch ()) - 1);
2028
2029 /* A large decimal (not hex or octal) constant (between INT_MAX
2030 and UINT_MAX) is a long or unsigned long, according to ANSI,
2031 never an unsigned int, but this code treats it as unsigned
2032 int. This probably should be fixed. GCC gives a warning on
2033 such constants. */
2034
2035 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
2036 signed_type = parse_type (par_state)->builtin_int;
2037 }
2038 else if (long_p <= 1
2039 && (un >> (gdbarch_long_bit (par_state->gdbarch ()) - 2)) == 0)
2040 {
2041 high_bit
2042 = ((ULONGEST)1) << (gdbarch_long_bit (par_state->gdbarch ()) - 1);
2043 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
2044 signed_type = parse_type (par_state)->builtin_long;
2045 }
2046 else
2047 {
2048 int shift;
2049 if (sizeof (ULONGEST) * HOST_CHAR_BIT
2050 < gdbarch_long_long_bit (par_state->gdbarch ()))
2051 /* A long long does not fit in a LONGEST. */
2052 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
2053 else
2054 shift = (gdbarch_long_long_bit (par_state->gdbarch ()) - 1);
2055 high_bit = (ULONGEST) 1 << shift;
2056 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
2057 signed_type = parse_type (par_state)->builtin_long_long;
2058 }
2059
2060 putithere->typed_val_int.val = n;
2061
2062 /* If the high bit of the worked out type is set then this number
2063 has to be unsigned. */
2064
2065 if (unsigned_p || (n & high_bit))
2066 {
2067 putithere->typed_val_int.type = unsigned_type;
2068 }
2069 else
2070 {
2071 putithere->typed_val_int.type = signed_type;
2072 }
2073
2074 return INT;
2075 }
2076
2077 /* Temporary obstack used for holding strings. */
2078 static struct obstack tempbuf;
2079 static int tempbuf_init;
2080
2081 /* Parse a C escape sequence. The initial backslash of the sequence
2082 is at (*PTR)[-1]. *PTR will be updated to point to just after the
2083 last character of the sequence. If OUTPUT is not NULL, the
2084 translated form of the escape sequence will be written there. If
2085 OUTPUT is NULL, no output is written and the call will only affect
2086 *PTR. If an escape sequence is expressed in target bytes, then the
2087 entire sequence will simply be copied to OUTPUT. Return 1 if any
2088 character was emitted, 0 otherwise. */
2089
2090 int
2091 c_parse_escape (const char **ptr, struct obstack *output)
2092 {
2093 const char *tokptr = *ptr;
2094 int result = 1;
2095
2096 /* Some escape sequences undergo character set conversion. Those we
2097 translate here. */
2098 switch (*tokptr)
2099 {
2100 /* Hex escapes do not undergo character set conversion, so keep
2101 the escape sequence for later. */
2102 case 'x':
2103 if (output)
2104 obstack_grow_str (output, "\\x");
2105 ++tokptr;
2106 if (!ISXDIGIT (*tokptr))
2107 error (_("\\x escape without a following hex digit"));
2108 while (ISXDIGIT (*tokptr))
2109 {
2110 if (output)
2111 obstack_1grow (output, *tokptr);
2112 ++tokptr;
2113 }
2114 break;
2115
2116 /* Octal escapes do not undergo character set conversion, so
2117 keep the escape sequence for later. */
2118 case '0':
2119 case '1':
2120 case '2':
2121 case '3':
2122 case '4':
2123 case '5':
2124 case '6':
2125 case '7':
2126 {
2127 int i;
2128 if (output)
2129 obstack_grow_str (output, "\\");
2130 for (i = 0;
2131 i < 3 && ISDIGIT (*tokptr) && *tokptr != '8' && *tokptr != '9';
2132 ++i)
2133 {
2134 if (output)
2135 obstack_1grow (output, *tokptr);
2136 ++tokptr;
2137 }
2138 }
2139 break;
2140
2141 /* We handle UCNs later. We could handle them here, but that
2142 would mean a spurious error in the case where the UCN could
2143 be converted to the target charset but not the host
2144 charset. */
2145 case 'u':
2146 case 'U':
2147 {
2148 char c = *tokptr;
2149 int i, len = c == 'U' ? 8 : 4;
2150 if (output)
2151 {
2152 obstack_1grow (output, '\\');
2153 obstack_1grow (output, *tokptr);
2154 }
2155 ++tokptr;
2156 if (!ISXDIGIT (*tokptr))
2157 error (_("\\%c escape without a following hex digit"), c);
2158 for (i = 0; i < len && ISXDIGIT (*tokptr); ++i)
2159 {
2160 if (output)
2161 obstack_1grow (output, *tokptr);
2162 ++tokptr;
2163 }
2164 }
2165 break;
2166
2167 /* We must pass backslash through so that it does not
2168 cause quoting during the second expansion. */
2169 case '\\':
2170 if (output)
2171 obstack_grow_str (output, "\\\\");
2172 ++tokptr;
2173 break;
2174
2175 /* Escapes which undergo conversion. */
2176 case 'a':
2177 if (output)
2178 obstack_1grow (output, '\a');
2179 ++tokptr;
2180 break;
2181 case 'b':
2182 if (output)
2183 obstack_1grow (output, '\b');
2184 ++tokptr;
2185 break;
2186 case 'f':
2187 if (output)
2188 obstack_1grow (output, '\f');
2189 ++tokptr;
2190 break;
2191 case 'n':
2192 if (output)
2193 obstack_1grow (output, '\n');
2194 ++tokptr;
2195 break;
2196 case 'r':
2197 if (output)
2198 obstack_1grow (output, '\r');
2199 ++tokptr;
2200 break;
2201 case 't':
2202 if (output)
2203 obstack_1grow (output, '\t');
2204 ++tokptr;
2205 break;
2206 case 'v':
2207 if (output)
2208 obstack_1grow (output, '\v');
2209 ++tokptr;
2210 break;
2211
2212 /* GCC extension. */
2213 case 'e':
2214 if (output)
2215 obstack_1grow (output, HOST_ESCAPE_CHAR);
2216 ++tokptr;
2217 break;
2218
2219 /* Backslash-newline expands to nothing at all. */
2220 case '\n':
2221 ++tokptr;
2222 result = 0;
2223 break;
2224
2225 /* A few escapes just expand to the character itself. */
2226 case '\'':
2227 case '\"':
2228 case '?':
2229 /* GCC extensions. */
2230 case '(':
2231 case '{':
2232 case '[':
2233 case '%':
2234 /* Unrecognized escapes turn into the character itself. */
2235 default:
2236 if (output)
2237 obstack_1grow (output, *tokptr);
2238 ++tokptr;
2239 break;
2240 }
2241 *ptr = tokptr;
2242 return result;
2243 }
2244
2245 /* Parse a string or character literal from TOKPTR. The string or
2246 character may be wide or unicode. *OUTPTR is set to just after the
2247 end of the literal in the input string. The resulting token is
2248 stored in VALUE. This returns a token value, either STRING or
2249 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2250 number of host characters in the literal. */
2251
2252 static int
2253 parse_string_or_char (const char *tokptr, const char **outptr,
2254 struct typed_stoken *value, int *host_chars)
2255 {
2256 int quote;
2257 c_string_type type;
2258 int is_objc = 0;
2259
2260 /* Build the gdb internal form of the input string in tempbuf. Note
2261 that the buffer is null byte terminated *only* for the
2262 convenience of debugging gdb itself and printing the buffer
2263 contents when the buffer contains no embedded nulls. Gdb does
2264 not depend upon the buffer being null byte terminated, it uses
2265 the length string instead. This allows gdb to handle C strings
2266 (as well as strings in other languages) with embedded null
2267 bytes */
2268
2269 if (!tempbuf_init)
2270 tempbuf_init = 1;
2271 else
2272 obstack_free (&tempbuf, NULL);
2273 obstack_init (&tempbuf);
2274
2275 /* Record the string type. */
2276 if (*tokptr == 'L')
2277 {
2278 type = C_WIDE_STRING;
2279 ++tokptr;
2280 }
2281 else if (*tokptr == 'u')
2282 {
2283 type = C_STRING_16;
2284 ++tokptr;
2285 }
2286 else if (*tokptr == 'U')
2287 {
2288 type = C_STRING_32;
2289 ++tokptr;
2290 }
2291 else if (*tokptr == '@')
2292 {
2293 /* An Objective C string. */
2294 is_objc = 1;
2295 type = C_STRING;
2296 ++tokptr;
2297 }
2298 else
2299 type = C_STRING;
2300
2301 /* Skip the quote. */
2302 quote = *tokptr;
2303 if (quote == '\'')
2304 type |= C_CHAR;
2305 ++tokptr;
2306
2307 *host_chars = 0;
2308
2309 while (*tokptr)
2310 {
2311 char c = *tokptr;
2312 if (c == '\\')
2313 {
2314 ++tokptr;
2315 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2316 }
2317 else if (c == quote)
2318 break;
2319 else
2320 {
2321 obstack_1grow (&tempbuf, c);
2322 ++tokptr;
2323 /* FIXME: this does the wrong thing with multi-byte host
2324 characters. We could use mbrlen here, but that would
2325 make "set host-charset" a bit less useful. */
2326 ++*host_chars;
2327 }
2328 }
2329
2330 if (*tokptr != quote)
2331 {
2332 if (quote == '"')
2333 error (_("Unterminated string in expression."));
2334 else
2335 error (_("Unmatched single quote."));
2336 }
2337 ++tokptr;
2338
2339 value->type = type;
2340 value->ptr = (char *) obstack_base (&tempbuf);
2341 value->length = obstack_object_size (&tempbuf);
2342
2343 *outptr = tokptr;
2344
2345 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2346 }
2347
2348 /* This is used to associate some attributes with a token. */
2349
2350 enum token_flag
2351 {
2352 /* If this bit is set, the token is C++-only. */
2353
2354 FLAG_CXX = 1,
2355
2356 /* If this bit is set, the token is C-only. */
2357
2358 FLAG_C = 2,
2359
2360 /* If this bit is set, the token is conditional: if there is a
2361 symbol of the same name, then the token is a symbol; otherwise,
2362 the token is a keyword. */
2363
2364 FLAG_SHADOW = 4
2365 };
2366 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2367
2368 struct token
2369 {
2370 const char *oper;
2371 int token;
2372 enum exp_opcode opcode;
2373 token_flags flags;
2374 };
2375
2376 static const struct token tokentab3[] =
2377 {
2378 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2379 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2380 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2381 {"...", DOTDOTDOT, BINOP_END, 0}
2382 };
2383
2384 static const struct token tokentab2[] =
2385 {
2386 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2387 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2388 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2389 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2390 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2391 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2392 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2393 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2394 {"++", INCREMENT, BINOP_END, 0},
2395 {"--", DECREMENT, BINOP_END, 0},
2396 {"->", ARROW, BINOP_END, 0},
2397 {"&&", ANDAND, BINOP_END, 0},
2398 {"||", OROR, BINOP_END, 0},
2399 /* "::" is *not* only C++: gdb overrides its meaning in several
2400 different ways, e.g., 'filename'::func, function::variable. */
2401 {"::", COLONCOLON, BINOP_END, 0},
2402 {"<<", LSH, BINOP_END, 0},
2403 {">>", RSH, BINOP_END, 0},
2404 {"==", EQUAL, BINOP_END, 0},
2405 {"!=", NOTEQUAL, BINOP_END, 0},
2406 {"<=", LEQ, BINOP_END, 0},
2407 {">=", GEQ, BINOP_END, 0},
2408 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2409 };
2410
2411 /* Identifier-like tokens. Only type-specifiers than can appear in
2412 multi-word type names (for example 'double' can appear in 'long
2413 double') need to be listed here. type-specifiers that are only ever
2414 single word (like 'float') are handled by the classify_name function. */
2415 static const struct token ident_tokens[] =
2416 {
2417 {"unsigned", UNSIGNED, OP_NULL, 0},
2418 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2419 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2420 {"struct", STRUCT, OP_NULL, 0},
2421 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2422 {"sizeof", SIZEOF, OP_NULL, 0},
2423 {"_Alignof", ALIGNOF, OP_NULL, 0},
2424 {"alignof", ALIGNOF, OP_NULL, FLAG_CXX},
2425 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2426 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2427 {"class", CLASS, OP_NULL, FLAG_CXX},
2428 {"union", UNION, OP_NULL, 0},
2429 {"short", SHORT, OP_NULL, 0},
2430 {"const", CONST_KEYWORD, OP_NULL, 0},
2431 {"restrict", RESTRICT, OP_NULL, FLAG_C | FLAG_SHADOW},
2432 {"__restrict__", RESTRICT, OP_NULL, 0},
2433 {"__restrict", RESTRICT, OP_NULL, 0},
2434 {"_Atomic", ATOMIC, OP_NULL, 0},
2435 {"enum", ENUM, OP_NULL, 0},
2436 {"long", LONG, OP_NULL, 0},
2437 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2438 {"int", INT_KEYWORD, OP_NULL, 0},
2439 {"new", NEW, OP_NULL, FLAG_CXX},
2440 {"delete", DELETE, OP_NULL, FLAG_CXX},
2441 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2442
2443 {"and", ANDAND, BINOP_END, FLAG_CXX},
2444 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2445 {"bitand", '&', OP_NULL, FLAG_CXX},
2446 {"bitor", '|', OP_NULL, FLAG_CXX},
2447 {"compl", '~', OP_NULL, FLAG_CXX},
2448 {"not", '!', OP_NULL, FLAG_CXX},
2449 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2450 {"or", OROR, BINOP_END, FLAG_CXX},
2451 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2452 {"xor", '^', OP_NULL, FLAG_CXX},
2453 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2454
2455 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2456 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2457 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2458 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2459
2460 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2461 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2462 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2463 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2464 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2465
2466 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2467 };
2468
2469
2470 static void
2471 scan_macro_expansion (char *expansion)
2472 {
2473 const char *copy;
2474
2475 /* We'd better not be trying to push the stack twice. */
2476 gdb_assert (! cpstate->macro_original_text);
2477
2478 /* Copy to the obstack, and then free the intermediate
2479 expansion. */
2480 copy = obstack_strdup (&cpstate->expansion_obstack, expansion);
2481 xfree (expansion);
2482
2483 /* Save the old lexptr value, so we can return to it when we're done
2484 parsing the expanded text. */
2485 cpstate->macro_original_text = pstate->lexptr;
2486 pstate->lexptr = copy;
2487 }
2488
2489 static int
2490 scanning_macro_expansion (void)
2491 {
2492 return cpstate->macro_original_text != 0;
2493 }
2494
2495 static void
2496 finished_macro_expansion (void)
2497 {
2498 /* There'd better be something to pop back to. */
2499 gdb_assert (cpstate->macro_original_text);
2500
2501 /* Pop back to the original text. */
2502 pstate->lexptr = cpstate->macro_original_text;
2503 cpstate->macro_original_text = 0;
2504 }
2505
2506 /* Return true iff the token represents a C++ cast operator. */
2507
2508 static int
2509 is_cast_operator (const char *token, int len)
2510 {
2511 return (! strncmp (token, "dynamic_cast", len)
2512 || ! strncmp (token, "static_cast", len)
2513 || ! strncmp (token, "reinterpret_cast", len)
2514 || ! strncmp (token, "const_cast", len));
2515 }
2516
2517 /* The scope used for macro expansion. */
2518 static struct macro_scope *expression_macro_scope;
2519
2520 /* This is set if a NAME token appeared at the very end of the input
2521 string, with no whitespace separating the name from the EOF. This
2522 is used only when parsing to do field name completion. */
2523 static int saw_name_at_eof;
2524
2525 /* This is set if the previously-returned token was a structure
2526 operator -- either '.' or ARROW. */
2527 static bool last_was_structop;
2528
2529 /* Depth of parentheses. */
2530 static int paren_depth;
2531
2532 /* Read one token, getting characters through lexptr. */
2533
2534 static int
2535 lex_one_token (struct parser_state *par_state, bool *is_quoted_name)
2536 {
2537 int c;
2538 int namelen;
2539 unsigned int i;
2540 const char *tokstart;
2541 bool saw_structop = last_was_structop;
2542
2543 last_was_structop = false;
2544 *is_quoted_name = false;
2545
2546 retry:
2547
2548 /* Check if this is a macro invocation that we need to expand. */
2549 if (! scanning_macro_expansion ())
2550 {
2551 char *expanded = macro_expand_next (&pstate->lexptr,
2552 standard_macro_lookup,
2553 expression_macro_scope);
2554
2555 if (expanded)
2556 scan_macro_expansion (expanded);
2557 }
2558
2559 pstate->prev_lexptr = pstate->lexptr;
2560
2561 tokstart = pstate->lexptr;
2562 /* See if it is a special token of length 3. */
2563 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2564 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2565 {
2566 if ((tokentab3[i].flags & FLAG_CXX) != 0
2567 && par_state->language ()->la_language != language_cplus)
2568 break;
2569 gdb_assert ((tokentab3[i].flags & FLAG_C) == 0);
2570
2571 pstate->lexptr += 3;
2572 yylval.opcode = tokentab3[i].opcode;
2573 return tokentab3[i].token;
2574 }
2575
2576 /* See if it is a special token of length 2. */
2577 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2578 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2579 {
2580 if ((tokentab2[i].flags & FLAG_CXX) != 0
2581 && par_state->language ()->la_language != language_cplus)
2582 break;
2583 gdb_assert ((tokentab2[i].flags & FLAG_C) == 0);
2584
2585 pstate->lexptr += 2;
2586 yylval.opcode = tokentab2[i].opcode;
2587 if (tokentab2[i].token == ARROW)
2588 last_was_structop = 1;
2589 return tokentab2[i].token;
2590 }
2591
2592 switch (c = *tokstart)
2593 {
2594 case 0:
2595 /* If we were just scanning the result of a macro expansion,
2596 then we need to resume scanning the original text.
2597 If we're parsing for field name completion, and the previous
2598 token allows such completion, return a COMPLETE token.
2599 Otherwise, we were already scanning the original text, and
2600 we're really done. */
2601 if (scanning_macro_expansion ())
2602 {
2603 finished_macro_expansion ();
2604 goto retry;
2605 }
2606 else if (saw_name_at_eof)
2607 {
2608 saw_name_at_eof = 0;
2609 return COMPLETE;
2610 }
2611 else if (par_state->parse_completion && saw_structop)
2612 return COMPLETE;
2613 else
2614 return 0;
2615
2616 case ' ':
2617 case '\t':
2618 case '\n':
2619 pstate->lexptr++;
2620 goto retry;
2621
2622 case '[':
2623 case '(':
2624 paren_depth++;
2625 pstate->lexptr++;
2626 if (par_state->language ()->la_language == language_objc
2627 && c == '[')
2628 return OBJC_LBRAC;
2629 return c;
2630
2631 case ']':
2632 case ')':
2633 if (paren_depth == 0)
2634 return 0;
2635 paren_depth--;
2636 pstate->lexptr++;
2637 return c;
2638
2639 case ',':
2640 if (pstate->comma_terminates
2641 && paren_depth == 0
2642 && ! scanning_macro_expansion ())
2643 return 0;
2644 pstate->lexptr++;
2645 return c;
2646
2647 case '.':
2648 /* Might be a floating point number. */
2649 if (pstate->lexptr[1] < '0' || pstate->lexptr[1] > '9')
2650 {
2651 last_was_structop = true;
2652 goto symbol; /* Nope, must be a symbol. */
2653 }
2654 /* FALL THRU. */
2655
2656 case '0':
2657 case '1':
2658 case '2':
2659 case '3':
2660 case '4':
2661 case '5':
2662 case '6':
2663 case '7':
2664 case '8':
2665 case '9':
2666 {
2667 /* It's a number. */
2668 int got_dot = 0, got_e = 0, toktype;
2669 const char *p = tokstart;
2670 int hex = input_radix > 10;
2671
2672 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2673 {
2674 p += 2;
2675 hex = 1;
2676 }
2677 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2678 {
2679 p += 2;
2680 hex = 0;
2681 }
2682
2683 for (;; ++p)
2684 {
2685 /* This test includes !hex because 'e' is a valid hex digit
2686 and thus does not indicate a floating point number when
2687 the radix is hex. */
2688 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2689 got_dot = got_e = 1;
2690 /* This test does not include !hex, because a '.' always indicates
2691 a decimal floating point number regardless of the radix. */
2692 else if (!got_dot && *p == '.')
2693 got_dot = 1;
2694 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2695 && (*p == '-' || *p == '+'))
2696 /* This is the sign of the exponent, not the end of the
2697 number. */
2698 continue;
2699 /* We will take any letters or digits. parse_number will
2700 complain if past the radix, or if L or U are not final. */
2701 else if ((*p < '0' || *p > '9')
2702 && ((*p < 'a' || *p > 'z')
2703 && (*p < 'A' || *p > 'Z')))
2704 break;
2705 }
2706 toktype = parse_number (par_state, tokstart, p - tokstart,
2707 got_dot|got_e, &yylval);
2708 if (toktype == ERROR)
2709 {
2710 char *err_copy = (char *) alloca (p - tokstart + 1);
2711
2712 memcpy (err_copy, tokstart, p - tokstart);
2713 err_copy[p - tokstart] = 0;
2714 error (_("Invalid number \"%s\"."), err_copy);
2715 }
2716 pstate->lexptr = p;
2717 return toktype;
2718 }
2719
2720 case '@':
2721 {
2722 const char *p = &tokstart[1];
2723
2724 if (par_state->language ()->la_language == language_objc)
2725 {
2726 size_t len = strlen ("selector");
2727
2728 if (strncmp (p, "selector", len) == 0
2729 && (p[len] == '\0' || ISSPACE (p[len])))
2730 {
2731 pstate->lexptr = p + len;
2732 return SELECTOR;
2733 }
2734 else if (*p == '"')
2735 goto parse_string;
2736 }
2737
2738 while (ISSPACE (*p))
2739 p++;
2740 size_t len = strlen ("entry");
2741 if (strncmp (p, "entry", len) == 0 && !c_ident_is_alnum (p[len])
2742 && p[len] != '_')
2743 {
2744 pstate->lexptr = &p[len];
2745 return ENTRY;
2746 }
2747 }
2748 /* FALLTHRU */
2749 case '+':
2750 case '-':
2751 case '*':
2752 case '/':
2753 case '%':
2754 case '|':
2755 case '&':
2756 case '^':
2757 case '~':
2758 case '!':
2759 case '<':
2760 case '>':
2761 case '?':
2762 case ':':
2763 case '=':
2764 case '{':
2765 case '}':
2766 symbol:
2767 pstate->lexptr++;
2768 return c;
2769
2770 case 'L':
2771 case 'u':
2772 case 'U':
2773 if (tokstart[1] != '"' && tokstart[1] != '\'')
2774 break;
2775 /* Fall through. */
2776 case '\'':
2777 case '"':
2778
2779 parse_string:
2780 {
2781 int host_len;
2782 int result = parse_string_or_char (tokstart, &pstate->lexptr,
2783 &yylval.tsval, &host_len);
2784 if (result == CHAR)
2785 {
2786 if (host_len == 0)
2787 error (_("Empty character constant."));
2788 else if (host_len > 2 && c == '\'')
2789 {
2790 ++tokstart;
2791 namelen = pstate->lexptr - tokstart - 1;
2792 *is_quoted_name = true;
2793
2794 goto tryname;
2795 }
2796 else if (host_len > 1)
2797 error (_("Invalid character constant."));
2798 }
2799 return result;
2800 }
2801 }
2802
2803 if (!(c == '_' || c == '$' || c_ident_is_alpha (c)))
2804 /* We must have come across a bad character (e.g. ';'). */
2805 error (_("Invalid character '%c' in expression."), c);
2806
2807 /* It's a name. See how long it is. */
2808 namelen = 0;
2809 for (c = tokstart[namelen];
2810 (c == '_' || c == '$' || c_ident_is_alnum (c) || c == '<');)
2811 {
2812 /* Template parameter lists are part of the name.
2813 FIXME: This mishandles `print $a<4&&$a>3'. */
2814
2815 if (c == '<')
2816 {
2817 if (! is_cast_operator (tokstart, namelen))
2818 {
2819 /* Scan ahead to get rest of the template specification. Note
2820 that we look ahead only when the '<' adjoins non-whitespace
2821 characters; for comparison expressions, e.g. "a < b > c",
2822 there must be spaces before the '<', etc. */
2823 const char *p = find_template_name_end (tokstart + namelen);
2824
2825 if (p)
2826 namelen = p - tokstart;
2827 }
2828 break;
2829 }
2830 c = tokstart[++namelen];
2831 }
2832
2833 /* The token "if" terminates the expression and is NOT removed from
2834 the input stream. It doesn't count if it appears in the
2835 expansion of a macro. */
2836 if (namelen == 2
2837 && tokstart[0] == 'i'
2838 && tokstart[1] == 'f'
2839 && ! scanning_macro_expansion ())
2840 {
2841 return 0;
2842 }
2843
2844 /* For the same reason (breakpoint conditions), "thread N"
2845 terminates the expression. "thread" could be an identifier, but
2846 an identifier is never followed by a number without intervening
2847 punctuation. "task" is similar. Handle abbreviations of these,
2848 similarly to breakpoint.c:find_condition_and_thread. */
2849 if (namelen >= 1
2850 && (strncmp (tokstart, "thread", namelen) == 0
2851 || strncmp (tokstart, "task", namelen) == 0)
2852 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2853 && ! scanning_macro_expansion ())
2854 {
2855 const char *p = tokstart + namelen + 1;
2856
2857 while (*p == ' ' || *p == '\t')
2858 p++;
2859 if (*p >= '0' && *p <= '9')
2860 return 0;
2861 }
2862
2863 pstate->lexptr += namelen;
2864
2865 tryname:
2866
2867 yylval.sval.ptr = tokstart;
2868 yylval.sval.length = namelen;
2869
2870 /* Catch specific keywords. */
2871 std::string copy = copy_name (yylval.sval);
2872 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2873 if (copy == ident_tokens[i].oper)
2874 {
2875 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2876 && par_state->language ()->la_language != language_cplus)
2877 break;
2878 if ((ident_tokens[i].flags & FLAG_C) != 0
2879 && par_state->language ()->la_language != language_c
2880 && par_state->language ()->la_language != language_objc)
2881 break;
2882
2883 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2884 {
2885 struct field_of_this_result is_a_field_of_this;
2886
2887 if (lookup_symbol (copy.c_str (),
2888 pstate->expression_context_block,
2889 VAR_DOMAIN,
2890 (par_state->language ()->la_language
2891 == language_cplus ? &is_a_field_of_this
2892 : NULL)).symbol
2893 != NULL)
2894 {
2895 /* The keyword is shadowed. */
2896 break;
2897 }
2898 }
2899
2900 /* It is ok to always set this, even though we don't always
2901 strictly need to. */
2902 yylval.opcode = ident_tokens[i].opcode;
2903 return ident_tokens[i].token;
2904 }
2905
2906 if (*tokstart == '$')
2907 return DOLLAR_VARIABLE;
2908
2909 if (pstate->parse_completion && *pstate->lexptr == '\0')
2910 saw_name_at_eof = 1;
2911
2912 yylval.ssym.stoken = yylval.sval;
2913 yylval.ssym.sym.symbol = NULL;
2914 yylval.ssym.sym.block = NULL;
2915 yylval.ssym.is_a_field_of_this = 0;
2916 return NAME;
2917 }
2918
2919 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2920 struct token_and_value
2921 {
2922 int token;
2923 YYSTYPE value;
2924 };
2925
2926 /* A FIFO of tokens that have been read but not yet returned to the
2927 parser. */
2928 static std::vector<token_and_value> token_fifo;
2929
2930 /* Non-zero if the lexer should return tokens from the FIFO. */
2931 static int popping;
2932
2933 /* Temporary storage for c_lex; this holds symbol names as they are
2934 built up. */
2935 auto_obstack name_obstack;
2936
2937 /* Classify a NAME token. The contents of the token are in `yylval'.
2938 Updates yylval and returns the new token type. BLOCK is the block
2939 in which lookups start; this can be NULL to mean the global scope.
2940 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2941 in single quotes. IS_AFTER_STRUCTOP is true if this name follows
2942 a structure operator -- either '.' or ARROW */
2943
2944 static int
2945 classify_name (struct parser_state *par_state, const struct block *block,
2946 bool is_quoted_name, bool is_after_structop)
2947 {
2948 struct block_symbol bsym;
2949 struct field_of_this_result is_a_field_of_this;
2950
2951 std::string copy = copy_name (yylval.sval);
2952
2953 /* Initialize this in case we *don't* use it in this call; that way
2954 we can refer to it unconditionally below. */
2955 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2956
2957 bsym = lookup_symbol (copy.c_str (), block, VAR_DOMAIN,
2958 par_state->language ()->la_name_of_this
2959 ? &is_a_field_of_this : NULL);
2960
2961 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2962 {
2963 yylval.ssym.sym = bsym;
2964 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2965 return BLOCKNAME;
2966 }
2967 else if (!bsym.symbol)
2968 {
2969 /* If we found a field of 'this', we might have erroneously
2970 found a constructor where we wanted a type name. Handle this
2971 case by noticing that we found a constructor and then look up
2972 the type tag instead. */
2973 if (is_a_field_of_this.type != NULL
2974 && is_a_field_of_this.fn_field != NULL
2975 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2976 0))
2977 {
2978 struct field_of_this_result inner_is_a_field_of_this;
2979
2980 bsym = lookup_symbol (copy.c_str (), block, STRUCT_DOMAIN,
2981 &inner_is_a_field_of_this);
2982 if (bsym.symbol != NULL)
2983 {
2984 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2985 return TYPENAME;
2986 }
2987 }
2988
2989 /* If we found a field on the "this" object, or we are looking
2990 up a field on a struct, then we want to prefer it over a
2991 filename. However, if the name was quoted, then it is better
2992 to check for a filename or a block, since this is the only
2993 way the user has of requiring the extension to be used. */
2994 if ((is_a_field_of_this.type == NULL && !is_after_structop)
2995 || is_quoted_name)
2996 {
2997 /* See if it's a file name. */
2998 struct symtab *symtab;
2999
3000 symtab = lookup_symtab (copy.c_str ());
3001 if (symtab)
3002 {
3003 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
3004 STATIC_BLOCK);
3005 return FILENAME;
3006 }
3007 }
3008 }
3009
3010 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
3011 {
3012 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
3013 return TYPENAME;
3014 }
3015
3016 /* See if it's an ObjC classname. */
3017 if (par_state->language ()->la_language == language_objc && !bsym.symbol)
3018 {
3019 CORE_ADDR Class = lookup_objc_class (par_state->gdbarch (),
3020 copy.c_str ());
3021 if (Class)
3022 {
3023 struct symbol *sym;
3024
3025 yylval.theclass.theclass = Class;
3026 sym = lookup_struct_typedef (copy.c_str (),
3027 par_state->expression_context_block, 1);
3028 if (sym)
3029 yylval.theclass.type = SYMBOL_TYPE (sym);
3030 return CLASSNAME;
3031 }
3032 }
3033
3034 /* Input names that aren't symbols but ARE valid hex numbers, when
3035 the input radix permits them, can be names or numbers depending
3036 on the parse. Note we support radixes > 16 here. */
3037 if (!bsym.symbol
3038 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
3039 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
3040 {
3041 YYSTYPE newlval; /* Its value is ignored. */
3042 int hextype = parse_number (par_state, copy.c_str (), yylval.sval.length,
3043 0, &newlval);
3044
3045 if (hextype == INT)
3046 {
3047 yylval.ssym.sym = bsym;
3048 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
3049 return NAME_OR_INT;
3050 }
3051 }
3052
3053 /* Any other kind of symbol */
3054 yylval.ssym.sym = bsym;
3055 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
3056
3057 if (bsym.symbol == NULL
3058 && par_state->language ()->la_language == language_cplus
3059 && is_a_field_of_this.type == NULL
3060 && lookup_minimal_symbol (copy.c_str (), NULL, NULL).minsym == NULL)
3061 return UNKNOWN_CPP_NAME;
3062
3063 return NAME;
3064 }
3065
3066 /* Like classify_name, but used by the inner loop of the lexer, when a
3067 name might have already been seen. CONTEXT is the context type, or
3068 NULL if this is the first component of a name. */
3069
3070 static int
3071 classify_inner_name (struct parser_state *par_state,
3072 const struct block *block, struct type *context)
3073 {
3074 struct type *type;
3075
3076 if (context == NULL)
3077 return classify_name (par_state, block, false, false);
3078
3079 type = check_typedef (context);
3080 if (!type_aggregate_p (type))
3081 return ERROR;
3082
3083 std::string copy = copy_name (yylval.ssym.stoken);
3084 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3085 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy.c_str (), block,
3086 VAR_DOMAIN);
3087
3088 /* If no symbol was found, search for a matching base class named
3089 COPY. This will allow users to enter qualified names of class members
3090 relative to the `this' pointer. */
3091 if (yylval.ssym.sym.symbol == NULL)
3092 {
3093 struct type *base_type = cp_find_type_baseclass_by_name (type,
3094 copy.c_str ());
3095
3096 if (base_type != NULL)
3097 {
3098 yylval.tsym.type = base_type;
3099 return TYPENAME;
3100 }
3101
3102 return ERROR;
3103 }
3104
3105 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
3106 {
3107 case LOC_BLOCK:
3108 case LOC_LABEL:
3109 /* cp_lookup_nested_symbol might have accidentally found a constructor
3110 named COPY when we really wanted a base class of the same name.
3111 Double-check this case by looking for a base class. */
3112 {
3113 struct type *base_type
3114 = cp_find_type_baseclass_by_name (type, copy.c_str ());
3115
3116 if (base_type != NULL)
3117 {
3118 yylval.tsym.type = base_type;
3119 return TYPENAME;
3120 }
3121 }
3122 return ERROR;
3123
3124 case LOC_TYPEDEF:
3125 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3126 return TYPENAME;
3127
3128 default:
3129 return NAME;
3130 }
3131 internal_error (__FILE__, __LINE__, _("not reached"));
3132 }
3133
3134 /* The outer level of a two-level lexer. This calls the inner lexer
3135 to return tokens. It then either returns these tokens, or
3136 aggregates them into a larger token. This lets us work around a
3137 problem in our parsing approach, where the parser could not
3138 distinguish between qualified names and qualified types at the
3139 right point.
3140
3141 This approach is still not ideal, because it mishandles template
3142 types. See the comment in lex_one_token for an example. However,
3143 this is still an improvement over the earlier approach, and will
3144 suffice until we move to better parsing technology. */
3145
3146 static int
3147 yylex (void)
3148 {
3149 token_and_value current;
3150 int first_was_coloncolon, last_was_coloncolon;
3151 struct type *context_type = NULL;
3152 int last_to_examine, next_to_examine, checkpoint;
3153 const struct block *search_block;
3154 bool is_quoted_name, last_lex_was_structop;
3155
3156 if (popping && !token_fifo.empty ())
3157 goto do_pop;
3158 popping = 0;
3159
3160 last_lex_was_structop = last_was_structop;
3161
3162 /* Read the first token and decide what to do. Most of the
3163 subsequent code is C++-only; but also depends on seeing a "::" or
3164 name-like token. */
3165 current.token = lex_one_token (pstate, &is_quoted_name);
3166 if (current.token == NAME)
3167 current.token = classify_name (pstate, pstate->expression_context_block,
3168 is_quoted_name, last_lex_was_structop);
3169 if (pstate->language ()->la_language != language_cplus
3170 || (current.token != TYPENAME && current.token != COLONCOLON
3171 && current.token != FILENAME))
3172 return current.token;
3173
3174 /* Read any sequence of alternating "::" and name-like tokens into
3175 the token FIFO. */
3176 current.value = yylval;
3177 token_fifo.push_back (current);
3178 last_was_coloncolon = current.token == COLONCOLON;
3179 while (1)
3180 {
3181 bool ignore;
3182
3183 /* We ignore quoted names other than the very first one.
3184 Subsequent ones do not have any special meaning. */
3185 current.token = lex_one_token (pstate, &ignore);
3186 current.value = yylval;
3187 token_fifo.push_back (current);
3188
3189 if ((last_was_coloncolon && current.token != NAME)
3190 || (!last_was_coloncolon && current.token != COLONCOLON))
3191 break;
3192 last_was_coloncolon = !last_was_coloncolon;
3193 }
3194 popping = 1;
3195
3196 /* We always read one extra token, so compute the number of tokens
3197 to examine accordingly. */
3198 last_to_examine = token_fifo.size () - 2;
3199 next_to_examine = 0;
3200
3201 current = token_fifo[next_to_examine];
3202 ++next_to_examine;
3203
3204 name_obstack.clear ();
3205 checkpoint = 0;
3206 if (current.token == FILENAME)
3207 search_block = current.value.bval;
3208 else if (current.token == COLONCOLON)
3209 search_block = NULL;
3210 else
3211 {
3212 gdb_assert (current.token == TYPENAME);
3213 search_block = pstate->expression_context_block;
3214 obstack_grow (&name_obstack, current.value.sval.ptr,
3215 current.value.sval.length);
3216 context_type = current.value.tsym.type;
3217 checkpoint = 1;
3218 }
3219
3220 first_was_coloncolon = current.token == COLONCOLON;
3221 last_was_coloncolon = first_was_coloncolon;
3222
3223 while (next_to_examine <= last_to_examine)
3224 {
3225 token_and_value next;
3226
3227 next = token_fifo[next_to_examine];
3228 ++next_to_examine;
3229
3230 if (next.token == NAME && last_was_coloncolon)
3231 {
3232 int classification;
3233
3234 yylval = next.value;
3235 classification = classify_inner_name (pstate, search_block,
3236 context_type);
3237 /* We keep going until we either run out of names, or until
3238 we have a qualified name which is not a type. */
3239 if (classification != TYPENAME && classification != NAME)
3240 break;
3241
3242 /* Accept up to this token. */
3243 checkpoint = next_to_examine;
3244
3245 /* Update the partial name we are constructing. */
3246 if (context_type != NULL)
3247 {
3248 /* We don't want to put a leading "::" into the name. */
3249 obstack_grow_str (&name_obstack, "::");
3250 }
3251 obstack_grow (&name_obstack, next.value.sval.ptr,
3252 next.value.sval.length);
3253
3254 yylval.sval.ptr = (const char *) obstack_base (&name_obstack);
3255 yylval.sval.length = obstack_object_size (&name_obstack);
3256 current.value = yylval;
3257 current.token = classification;
3258
3259 last_was_coloncolon = 0;
3260
3261 if (classification == NAME)
3262 break;
3263
3264 context_type = yylval.tsym.type;
3265 }
3266 else if (next.token == COLONCOLON && !last_was_coloncolon)
3267 last_was_coloncolon = 1;
3268 else
3269 {
3270 /* We've reached the end of the name. */
3271 break;
3272 }
3273 }
3274
3275 /* If we have a replacement token, install it as the first token in
3276 the FIFO, and delete the other constituent tokens. */
3277 if (checkpoint > 0)
3278 {
3279 current.value.sval.ptr
3280 = obstack_strndup (&cpstate->expansion_obstack,
3281 current.value.sval.ptr,
3282 current.value.sval.length);
3283
3284 token_fifo[0] = current;
3285 if (checkpoint > 1)
3286 token_fifo.erase (token_fifo.begin () + 1,
3287 token_fifo.begin () + checkpoint);
3288 }
3289
3290 do_pop:
3291 current = token_fifo[0];
3292 token_fifo.erase (token_fifo.begin ());
3293 yylval = current.value;
3294 return current.token;
3295 }
3296
3297 int
3298 c_parse (struct parser_state *par_state)
3299 {
3300 /* Setting up the parser state. */
3301 scoped_restore pstate_restore = make_scoped_restore (&pstate);
3302 gdb_assert (par_state != NULL);
3303 pstate = par_state;
3304
3305 c_parse_state cstate;
3306 scoped_restore cstate_restore = make_scoped_restore (&cpstate, &cstate);
3307
3308 gdb::unique_xmalloc_ptr<struct macro_scope> macro_scope;
3309
3310 if (par_state->expression_context_block)
3311 macro_scope
3312 = sal_macro_scope (find_pc_line (par_state->expression_context_pc, 0));
3313 else
3314 macro_scope = default_macro_scope ();
3315 if (! macro_scope)
3316 macro_scope = user_macro_scope ();
3317
3318 scoped_restore restore_macro_scope
3319 = make_scoped_restore (&expression_macro_scope, macro_scope.get ());
3320
3321 scoped_restore restore_yydebug = make_scoped_restore (&yydebug,
3322 parser_debug);
3323
3324 /* Initialize some state used by the lexer. */
3325 last_was_structop = false;
3326 saw_name_at_eof = 0;
3327 paren_depth = 0;
3328
3329 token_fifo.clear ();
3330 popping = 0;
3331 name_obstack.clear ();
3332
3333 return yyparse ();
3334 }
3335
3336 #ifdef YYBISON
3337
3338 /* This is called via the YYPRINT macro when parser debugging is
3339 enabled. It prints a token's value. */
3340
3341 static void
3342 c_print_token (FILE *file, int type, YYSTYPE value)
3343 {
3344 switch (type)
3345 {
3346 case INT:
3347 parser_fprintf (file, "typed_val_int<%s, %s>",
3348 TYPE_SAFE_NAME (value.typed_val_int.type),
3349 pulongest (value.typed_val_int.val));
3350 break;
3351
3352 case CHAR:
3353 case STRING:
3354 {
3355 char *copy = (char *) alloca (value.tsval.length + 1);
3356
3357 memcpy (copy, value.tsval.ptr, value.tsval.length);
3358 copy[value.tsval.length] = '\0';
3359
3360 parser_fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3361 }
3362 break;
3363
3364 case NSSTRING:
3365 case DOLLAR_VARIABLE:
3366 parser_fprintf (file, "sval<%s>", copy_name (value.sval).c_str ());
3367 break;
3368
3369 case TYPENAME:
3370 parser_fprintf (file, "tsym<type=%s, name=%s>",
3371 TYPE_SAFE_NAME (value.tsym.type),
3372 copy_name (value.tsym.stoken).c_str ());
3373 break;
3374
3375 case NAME:
3376 case UNKNOWN_CPP_NAME:
3377 case NAME_OR_INT:
3378 case BLOCKNAME:
3379 parser_fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3380 copy_name (value.ssym.stoken).c_str (),
3381 (value.ssym.sym.symbol == NULL
3382 ? "(null)" : value.ssym.sym.symbol->print_name ()),
3383 value.ssym.is_a_field_of_this);
3384 break;
3385
3386 case FILENAME:
3387 parser_fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3388 break;
3389 }
3390 }
3391
3392 #endif
3393
3394 static void
3395 yyerror (const char *msg)
3396 {
3397 if (pstate->prev_lexptr)
3398 pstate->lexptr = pstate->prev_lexptr;
3399
3400 error (_("A %s in expression, near `%s'."), msg, pstate->lexptr);
3401 }
GDB Binutils - Deliverables
This page took 0.158025 seconds and 5 git commands to generate.