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