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