projects / deliverable / binutils-gdb.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Do not classify C struct members as a filename
[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 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1045 write_exp_elt_block (pstate, sym.block);
1046 write_exp_elt_sym (pstate, sym.symbol);
1047 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1048 }
1049 else if ($1.is_a_field_of_this)
1050 {
1051 /* C++: it hangs off of `this'. Must
1052 not inadvertently convert from a method call
1053 to data ref. */
1054 innermost_block.update (sym);
1055 write_exp_elt_opcode (pstate, OP_THIS);
1056 write_exp_elt_opcode (pstate, OP_THIS);
1057 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1058 write_exp_string (pstate, $1.stoken);
1059 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1060 }
1061 else
1062 {
1063 char *arg = copy_name ($1.stoken);
1064
1065 bound_minimal_symbol msymbol
1066 = lookup_bound_minimal_symbol (arg);
1067 if (msymbol.minsym == NULL)
1068 {
1069 if (!have_full_symbols () && !have_partial_symbols ())
1070 error (_("No symbol table is loaded. Use the \"file\" command."));
1071 else
1072 error (_("No symbol \"%s\" in current context."),
1073 copy_name ($1.stoken));
1074 }
1075
1076 /* This minsym might be an alias for
1077 another function. See if we can find
1078 the debug symbol for the target, and
1079 if so, use it instead, since it has
1080 return type / prototype info. This
1081 is important for example for "p
1082 *__errno_location()". */
1083 symbol *alias_target
1084 = find_function_alias_target (msymbol);
1085 if (alias_target != NULL)
1086 {
1087 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1088 write_exp_elt_block
1089 (pstate, SYMBOL_BLOCK_VALUE (alias_target));
1090 write_exp_elt_sym (pstate, alias_target);
1091 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1092 }
1093 else
1094 write_exp_msymbol (pstate, msymbol);
1095 }
1096 }
1097 ;
1098
1099 space_identifier : '@' NAME
1100 { insert_type_address_space (pstate, copy_name ($2.stoken)); }
1101 ;
1102
1103 const_or_volatile: const_or_volatile_noopt
1104 |
1105 ;
1106
1107 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1108 ;
1109
1110 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1111 | const_or_volatile_noopt
1112 ;
1113
1114 const_or_volatile_or_space_identifier:
1115 const_or_volatile_or_space_identifier_noopt
1116 |
1117 ;
1118
1119 ptr_operator:
1120 ptr_operator '*'
1121 { insert_type (tp_pointer); }
1122 const_or_volatile_or_space_identifier
1123 | '*'
1124 { insert_type (tp_pointer); }
1125 const_or_volatile_or_space_identifier
1126 | '&'
1127 { insert_type (tp_reference); }
1128 | '&' ptr_operator
1129 { insert_type (tp_reference); }
1130 | ANDAND
1131 { insert_type (tp_rvalue_reference); }
1132 | ANDAND ptr_operator
1133 { insert_type (tp_rvalue_reference); }
1134 ;
1135
1136 ptr_operator_ts: ptr_operator
1137 {
1138 $$ = get_type_stack ();
1139 /* This cleanup is eventually run by
1140 c_parse. */
1141 make_cleanup (type_stack_cleanup, $$);
1142 }
1143 ;
1144
1145 abs_decl: ptr_operator_ts direct_abs_decl
1146 { $$ = append_type_stack ($2, $1); }
1147 | ptr_operator_ts
1148 | direct_abs_decl
1149 ;
1150
1151 direct_abs_decl: '(' abs_decl ')'
1152 { $$ = $2; }
1153 | direct_abs_decl array_mod
1154 {
1155 push_type_stack ($1);
1156 push_type_int ($2);
1157 push_type (tp_array);
1158 $$ = get_type_stack ();
1159 }
1160 | array_mod
1161 {
1162 push_type_int ($1);
1163 push_type (tp_array);
1164 $$ = get_type_stack ();
1165 }
1166
1167 | direct_abs_decl func_mod
1168 {
1169 push_type_stack ($1);
1170 push_typelist ($2);
1171 $$ = get_type_stack ();
1172 }
1173 | func_mod
1174 {
1175 push_typelist ($1);
1176 $$ = get_type_stack ();
1177 }
1178 ;
1179
1180 array_mod: '[' ']'
1181 { $$ = -1; }
1182 | OBJC_LBRAC ']'
1183 { $$ = -1; }
1184 | '[' INT ']'
1185 { $$ = $2.val; }
1186 | OBJC_LBRAC INT ']'
1187 { $$ = $2.val; }
1188 ;
1189
1190 func_mod: '(' ')'
1191 { $$ = NULL; }
1192 | '(' parameter_typelist ')'
1193 { $$ = $2; }
1194 ;
1195
1196 /* We used to try to recognize pointer to member types here, but
1197 that didn't work (shift/reduce conflicts meant that these rules never
1198 got executed). The problem is that
1199 int (foo::bar::baz::bizzle)
1200 is a function type but
1201 int (foo::bar::baz::bizzle::*)
1202 is a pointer to member type. Stroustrup loses again! */
1203
1204 type : ptype
1205 ;
1206
1207 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1208 : TYPENAME
1209 { $$ = $1.type; }
1210 | INT_KEYWORD
1211 { $$ = lookup_signed_typename (parse_language (pstate),
1212 parse_gdbarch (pstate),
1213 "int"); }
1214 | LONG
1215 { $$ = lookup_signed_typename (parse_language (pstate),
1216 parse_gdbarch (pstate),
1217 "long"); }
1218 | SHORT
1219 { $$ = lookup_signed_typename (parse_language (pstate),
1220 parse_gdbarch (pstate),
1221 "short"); }
1222 | LONG INT_KEYWORD
1223 { $$ = lookup_signed_typename (parse_language (pstate),
1224 parse_gdbarch (pstate),
1225 "long"); }
1226 | LONG SIGNED_KEYWORD INT_KEYWORD
1227 { $$ = lookup_signed_typename (parse_language (pstate),
1228 parse_gdbarch (pstate),
1229 "long"); }
1230 | LONG SIGNED_KEYWORD
1231 { $$ = lookup_signed_typename (parse_language (pstate),
1232 parse_gdbarch (pstate),
1233 "long"); }
1234 | SIGNED_KEYWORD LONG INT_KEYWORD
1235 { $$ = lookup_signed_typename (parse_language (pstate),
1236 parse_gdbarch (pstate),
1237 "long"); }
1238 | UNSIGNED LONG INT_KEYWORD
1239 { $$ = lookup_unsigned_typename (parse_language (pstate),
1240 parse_gdbarch (pstate),
1241 "long"); }
1242 | LONG UNSIGNED INT_KEYWORD
1243 { $$ = lookup_unsigned_typename (parse_language (pstate),
1244 parse_gdbarch (pstate),
1245 "long"); }
1246 | LONG UNSIGNED
1247 { $$ = lookup_unsigned_typename (parse_language (pstate),
1248 parse_gdbarch (pstate),
1249 "long"); }
1250 | LONG LONG
1251 { $$ = lookup_signed_typename (parse_language (pstate),
1252 parse_gdbarch (pstate),
1253 "long long"); }
1254 | LONG LONG INT_KEYWORD
1255 { $$ = lookup_signed_typename (parse_language (pstate),
1256 parse_gdbarch (pstate),
1257 "long long"); }
1258 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1259 { $$ = lookup_signed_typename (parse_language (pstate),
1260 parse_gdbarch (pstate),
1261 "long long"); }
1262 | LONG LONG SIGNED_KEYWORD
1263 { $$ = lookup_signed_typename (parse_language (pstate),
1264 parse_gdbarch (pstate),
1265 "long long"); }
1266 | SIGNED_KEYWORD LONG LONG
1267 { $$ = lookup_signed_typename (parse_language (pstate),
1268 parse_gdbarch (pstate),
1269 "long long"); }
1270 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1271 { $$ = lookup_signed_typename (parse_language (pstate),
1272 parse_gdbarch (pstate),
1273 "long long"); }
1274 | UNSIGNED LONG LONG
1275 { $$ = lookup_unsigned_typename (parse_language (pstate),
1276 parse_gdbarch (pstate),
1277 "long long"); }
1278 | UNSIGNED LONG LONG INT_KEYWORD
1279 { $$ = lookup_unsigned_typename (parse_language (pstate),
1280 parse_gdbarch (pstate),
1281 "long long"); }
1282 | LONG LONG UNSIGNED
1283 { $$ = lookup_unsigned_typename (parse_language (pstate),
1284 parse_gdbarch (pstate),
1285 "long long"); }
1286 | LONG LONG UNSIGNED INT_KEYWORD
1287 { $$ = lookup_unsigned_typename (parse_language (pstate),
1288 parse_gdbarch (pstate),
1289 "long long"); }
1290 | SHORT INT_KEYWORD
1291 { $$ = lookup_signed_typename (parse_language (pstate),
1292 parse_gdbarch (pstate),
1293 "short"); }
1294 | SHORT SIGNED_KEYWORD INT_KEYWORD
1295 { $$ = lookup_signed_typename (parse_language (pstate),
1296 parse_gdbarch (pstate),
1297 "short"); }
1298 | SHORT SIGNED_KEYWORD
1299 { $$ = lookup_signed_typename (parse_language (pstate),
1300 parse_gdbarch (pstate),
1301 "short"); }
1302 | UNSIGNED SHORT INT_KEYWORD
1303 { $$ = lookup_unsigned_typename (parse_language (pstate),
1304 parse_gdbarch (pstate),
1305 "short"); }
1306 | SHORT UNSIGNED
1307 { $$ = lookup_unsigned_typename (parse_language (pstate),
1308 parse_gdbarch (pstate),
1309 "short"); }
1310 | SHORT UNSIGNED INT_KEYWORD
1311 { $$ = lookup_unsigned_typename (parse_language (pstate),
1312 parse_gdbarch (pstate),
1313 "short"); }
1314 | DOUBLE_KEYWORD
1315 { $$ = lookup_typename (parse_language (pstate),
1316 parse_gdbarch (pstate),
1317 "double",
1318 (struct block *) NULL,
1319 0); }
1320 | LONG DOUBLE_KEYWORD
1321 { $$ = lookup_typename (parse_language (pstate),
1322 parse_gdbarch (pstate),
1323 "long double",
1324 (struct block *) NULL,
1325 0); }
1326 | STRUCT name
1327 { $$ = lookup_struct (copy_name ($2),
1328 expression_context_block); }
1329 | STRUCT COMPLETE
1330 {
1331 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1332 $$ = NULL;
1333 }
1334 | STRUCT name COMPLETE
1335 {
1336 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1337 $2.length);
1338 $$ = NULL;
1339 }
1340 | CLASS name
1341 { $$ = lookup_struct (copy_name ($2),
1342 expression_context_block); }
1343 | CLASS COMPLETE
1344 {
1345 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1346 $$ = NULL;
1347 }
1348 | CLASS name COMPLETE
1349 {
1350 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1351 $2.length);
1352 $$ = NULL;
1353 }
1354 | UNION name
1355 { $$ = lookup_union (copy_name ($2),
1356 expression_context_block); }
1357 | UNION COMPLETE
1358 {
1359 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1360 $$ = NULL;
1361 }
1362 | UNION name COMPLETE
1363 {
1364 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1365 $2.length);
1366 $$ = NULL;
1367 }
1368 | ENUM name
1369 { $$ = lookup_enum (copy_name ($2),
1370 expression_context_block); }
1371 | ENUM COMPLETE
1372 {
1373 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1374 $$ = NULL;
1375 }
1376 | ENUM name COMPLETE
1377 {
1378 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1379 $2.length);
1380 $$ = NULL;
1381 }
1382 | UNSIGNED type_name
1383 { $$ = lookup_unsigned_typename (parse_language (pstate),
1384 parse_gdbarch (pstate),
1385 TYPE_NAME($2.type)); }
1386 | UNSIGNED
1387 { $$ = lookup_unsigned_typename (parse_language (pstate),
1388 parse_gdbarch (pstate),
1389 "int"); }
1390 | SIGNED_KEYWORD type_name
1391 { $$ = lookup_signed_typename (parse_language (pstate),
1392 parse_gdbarch (pstate),
1393 TYPE_NAME($2.type)); }
1394 | SIGNED_KEYWORD
1395 { $$ = lookup_signed_typename (parse_language (pstate),
1396 parse_gdbarch (pstate),
1397 "int"); }
1398 /* It appears that this rule for templates is never
1399 reduced; template recognition happens by lookahead
1400 in the token processing code in yylex. */
1401 | TEMPLATE name '<' type '>'
1402 { $$ = lookup_template_type(copy_name($2), $4,
1403 expression_context_block);
1404 }
1405 | const_or_volatile_or_space_identifier_noopt typebase
1406 { $$ = follow_types ($2); }
1407 | typebase const_or_volatile_or_space_identifier_noopt
1408 { $$ = follow_types ($1); }
1409 ;
1410
1411 type_name: TYPENAME
1412 | INT_KEYWORD
1413 {
1414 $$.stoken.ptr = "int";
1415 $$.stoken.length = 3;
1416 $$.type = lookup_signed_typename (parse_language (pstate),
1417 parse_gdbarch (pstate),
1418 "int");
1419 }
1420 | LONG
1421 {
1422 $$.stoken.ptr = "long";
1423 $$.stoken.length = 4;
1424 $$.type = lookup_signed_typename (parse_language (pstate),
1425 parse_gdbarch (pstate),
1426 "long");
1427 }
1428 | SHORT
1429 {
1430 $$.stoken.ptr = "short";
1431 $$.stoken.length = 5;
1432 $$.type = lookup_signed_typename (parse_language (pstate),
1433 parse_gdbarch (pstate),
1434 "short");
1435 }
1436 ;
1437
1438 parameter_typelist:
1439 nonempty_typelist
1440 { check_parameter_typelist ($1); }
1441 | nonempty_typelist ',' DOTDOTDOT
1442 {
1443 VEC_safe_push (type_ptr, $1, NULL);
1444 check_parameter_typelist ($1);
1445 $$ = $1;
1446 }
1447 ;
1448
1449 nonempty_typelist
1450 : type
1451 {
1452 VEC (type_ptr) *typelist = NULL;
1453 VEC_safe_push (type_ptr, typelist, $1);
1454 $$ = typelist;
1455 }
1456 | nonempty_typelist ',' type
1457 {
1458 VEC_safe_push (type_ptr, $1, $3);
1459 $$ = $1;
1460 }
1461 ;
1462
1463 ptype : typebase
1464 | ptype abs_decl
1465 {
1466 push_type_stack ($2);
1467 $$ = follow_types ($1);
1468 }
1469 ;
1470
1471 conversion_type_id: typebase conversion_declarator
1472 { $$ = follow_types ($1); }
1473 ;
1474
1475 conversion_declarator: /* Nothing. */
1476 | ptr_operator conversion_declarator
1477 ;
1478
1479 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1480 | VOLATILE_KEYWORD CONST_KEYWORD
1481 ;
1482
1483 const_or_volatile_noopt: const_and_volatile
1484 { insert_type (tp_const);
1485 insert_type (tp_volatile);
1486 }
1487 | CONST_KEYWORD
1488 { insert_type (tp_const); }
1489 | VOLATILE_KEYWORD
1490 { insert_type (tp_volatile); }
1491 ;
1492
1493 oper: OPERATOR NEW
1494 { $$ = operator_stoken (" new"); }
1495 | OPERATOR DELETE
1496 { $$ = operator_stoken (" delete"); }
1497 | OPERATOR NEW '[' ']'
1498 { $$ = operator_stoken (" new[]"); }
1499 | OPERATOR DELETE '[' ']'
1500 { $$ = operator_stoken (" delete[]"); }
1501 | OPERATOR NEW OBJC_LBRAC ']'
1502 { $$ = operator_stoken (" new[]"); }
1503 | OPERATOR DELETE OBJC_LBRAC ']'
1504 { $$ = operator_stoken (" delete[]"); }
1505 | OPERATOR '+'
1506 { $$ = operator_stoken ("+"); }
1507 | OPERATOR '-'
1508 { $$ = operator_stoken ("-"); }
1509 | OPERATOR '*'
1510 { $$ = operator_stoken ("*"); }
1511 | OPERATOR '/'
1512 { $$ = operator_stoken ("/"); }
1513 | OPERATOR '%'
1514 { $$ = operator_stoken ("%"); }
1515 | OPERATOR '^'
1516 { $$ = operator_stoken ("^"); }
1517 | OPERATOR '&'
1518 { $$ = operator_stoken ("&"); }
1519 | OPERATOR '|'
1520 { $$ = operator_stoken ("|"); }
1521 | OPERATOR '~'
1522 { $$ = operator_stoken ("~"); }
1523 | OPERATOR '!'
1524 { $$ = operator_stoken ("!"); }
1525 | OPERATOR '='
1526 { $$ = operator_stoken ("="); }
1527 | OPERATOR '<'
1528 { $$ = operator_stoken ("<"); }
1529 | OPERATOR '>'
1530 { $$ = operator_stoken (">"); }
1531 | OPERATOR ASSIGN_MODIFY
1532 { const char *op = " unknown";
1533 switch ($2)
1534 {
1535 case BINOP_RSH:
1536 op = ">>=";
1537 break;
1538 case BINOP_LSH:
1539 op = "<<=";
1540 break;
1541 case BINOP_ADD:
1542 op = "+=";
1543 break;
1544 case BINOP_SUB:
1545 op = "-=";
1546 break;
1547 case BINOP_MUL:
1548 op = "*=";
1549 break;
1550 case BINOP_DIV:
1551 op = "/=";
1552 break;
1553 case BINOP_REM:
1554 op = "%=";
1555 break;
1556 case BINOP_BITWISE_IOR:
1557 op = "|=";
1558 break;
1559 case BINOP_BITWISE_AND:
1560 op = "&=";
1561 break;
1562 case BINOP_BITWISE_XOR:
1563 op = "^=";
1564 break;
1565 default:
1566 break;
1567 }
1568
1569 $$ = operator_stoken (op);
1570 }
1571 | OPERATOR LSH
1572 { $$ = operator_stoken ("<<"); }
1573 | OPERATOR RSH
1574 { $$ = operator_stoken (">>"); }
1575 | OPERATOR EQUAL
1576 { $$ = operator_stoken ("=="); }
1577 | OPERATOR NOTEQUAL
1578 { $$ = operator_stoken ("!="); }
1579 | OPERATOR LEQ
1580 { $$ = operator_stoken ("<="); }
1581 | OPERATOR GEQ
1582 { $$ = operator_stoken (">="); }
1583 | OPERATOR ANDAND
1584 { $$ = operator_stoken ("&&"); }
1585 | OPERATOR OROR
1586 { $$ = operator_stoken ("||"); }
1587 | OPERATOR INCREMENT
1588 { $$ = operator_stoken ("++"); }
1589 | OPERATOR DECREMENT
1590 { $$ = operator_stoken ("--"); }
1591 | OPERATOR ','
1592 { $$ = operator_stoken (","); }
1593 | OPERATOR ARROW_STAR
1594 { $$ = operator_stoken ("->*"); }
1595 | OPERATOR ARROW
1596 { $$ = operator_stoken ("->"); }
1597 | OPERATOR '(' ')'
1598 { $$ = operator_stoken ("()"); }
1599 | OPERATOR '[' ']'
1600 { $$ = operator_stoken ("[]"); }
1601 | OPERATOR OBJC_LBRAC ']'
1602 { $$ = operator_stoken ("[]"); }
1603 | OPERATOR conversion_type_id
1604 { string_file buf;
1605
1606 c_print_type ($2, NULL, &buf, -1, 0,
1607 &type_print_raw_options);
1608
1609 /* This also needs canonicalization. */
1610 std::string canon
1611 = cp_canonicalize_string (buf.c_str ());
1612 if (canon.empty ())
1613 canon = std::move (buf.string ());
1614 $$ = operator_stoken ((" " + canon).c_str ());
1615 }
1616 ;
1617
1618
1619
1620 name : NAME { $$ = $1.stoken; }
1621 | BLOCKNAME { $$ = $1.stoken; }
1622 | TYPENAME { $$ = $1.stoken; }
1623 | NAME_OR_INT { $$ = $1.stoken; }
1624 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1625 | oper { $$ = $1; }
1626 ;
1627
1628 name_not_typename : NAME
1629 | BLOCKNAME
1630 /* These would be useful if name_not_typename was useful, but it is just
1631 a fake for "variable", so these cause reduce/reduce conflicts because
1632 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1633 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1634 context where only a name could occur, this might be useful.
1635 | NAME_OR_INT
1636 */
1637 | oper
1638 {
1639 struct field_of_this_result is_a_field_of_this;
1640
1641 $$.stoken = $1;
1642 $$.sym = lookup_symbol ($1.ptr,
1643 expression_context_block,
1644 VAR_DOMAIN,
1645 &is_a_field_of_this);
1646 $$.is_a_field_of_this
1647 = is_a_field_of_this.type != NULL;
1648 }
1649 | UNKNOWN_CPP_NAME
1650 ;
1651
1652 %%
1653
1654 /* Like write_exp_string, but prepends a '~'. */
1655
1656 static void
1657 write_destructor_name (struct parser_state *par_state, struct stoken token)
1658 {
1659 char *copy = (char *) alloca (token.length + 1);
1660
1661 copy[0] = '~';
1662 memcpy (&copy[1], token.ptr, token.length);
1663
1664 token.ptr = copy;
1665 ++token.length;
1666
1667 write_exp_string (par_state, token);
1668 }
1669
1670 /* Returns a stoken of the operator name given by OP (which does not
1671 include the string "operator"). */
1672
1673 static struct stoken
1674 operator_stoken (const char *op)
1675 {
1676 struct stoken st = { NULL, 0 };
1677 char *buf;
1678
1679 st.length = CP_OPERATOR_LEN + strlen (op);
1680 buf = (char *) malloc (st.length + 1);
1681 strcpy (buf, CP_OPERATOR_STR);
1682 strcat (buf, op);
1683 st.ptr = buf;
1684
1685 /* The toplevel (c_parse) will free the memory allocated here. */
1686 make_cleanup (free, buf);
1687 return st;
1688 };
1689
1690 /* Return true if the type is aggregate-like. */
1691
1692 static int
1693 type_aggregate_p (struct type *type)
1694 {
1695 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1696 || TYPE_CODE (type) == TYPE_CODE_UNION
1697 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1698 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1699 && TYPE_DECLARED_CLASS (type)));
1700 }
1701
1702 /* Validate a parameter typelist. */
1703
1704 static void
1705 check_parameter_typelist (VEC (type_ptr) *params)
1706 {
1707 struct type *type;
1708 int ix;
1709
1710 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1711 {
1712 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1713 {
1714 if (ix == 0)
1715 {
1716 if (VEC_length (type_ptr, params) == 1)
1717 {
1718 /* Ok. */
1719 break;
1720 }
1721 VEC_free (type_ptr, params);
1722 error (_("parameter types following 'void'"));
1723 }
1724 else
1725 {
1726 VEC_free (type_ptr, params);
1727 error (_("'void' invalid as parameter type"));
1728 }
1729 }
1730 }
1731 }
1732
1733 /* Take care of parsing a number (anything that starts with a digit).
1734 Set yylval and return the token type; update lexptr.
1735 LEN is the number of characters in it. */
1736
1737 /*** Needs some error checking for the float case ***/
1738
1739 static int
1740 parse_number (struct parser_state *par_state,
1741 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1742 {
1743 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1744 here, and we do kind of silly things like cast to unsigned. */
1745 LONGEST n = 0;
1746 LONGEST prevn = 0;
1747 ULONGEST un;
1748
1749 int i = 0;
1750 int c;
1751 int base = input_radix;
1752 int unsigned_p = 0;
1753
1754 /* Number of "L" suffixes encountered. */
1755 int long_p = 0;
1756
1757 /* We have found a "L" or "U" suffix. */
1758 int found_suffix = 0;
1759
1760 ULONGEST high_bit;
1761 struct type *signed_type;
1762 struct type *unsigned_type;
1763 char *p;
1764
1765 p = (char *) alloca (len);
1766 memcpy (p, buf, len);
1767
1768 if (parsed_float)
1769 {
1770 /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */
1771 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1772 {
1773 putithere->typed_val_float.type
1774 = parse_type (par_state)->builtin_decfloat;
1775 len -= 2;
1776 }
1777 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1778 {
1779 putithere->typed_val_float.type
1780 = parse_type (par_state)->builtin_decdouble;
1781 len -= 2;
1782 }
1783 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1784 {
1785 putithere->typed_val_float.type
1786 = parse_type (par_state)->builtin_declong;
1787 len -= 2;
1788 }
1789 /* Handle suffixes: 'f' for float, 'l' for long double. */
1790 else if (len >= 1 && tolower (p[len - 1]) == 'f')
1791 {
1792 putithere->typed_val_float.type
1793 = parse_type (par_state)->builtin_float;
1794 len -= 1;
1795 }
1796 else if (len >= 1 && tolower (p[len - 1]) == 'l')
1797 {
1798 putithere->typed_val_float.type
1799 = parse_type (par_state)->builtin_long_double;
1800 len -= 1;
1801 }
1802 /* Default type for floating-point literals is double. */
1803 else
1804 {
1805 putithere->typed_val_float.type
1806 = parse_type (par_state)->builtin_double;
1807 }
1808
1809 if (!parse_float (p, len,
1810 putithere->typed_val_float.type,
1811 putithere->typed_val_float.val))
1812 return ERROR;
1813 return FLOAT;
1814 }
1815
1816 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1817 if (p[0] == '0' && len > 1)
1818 switch (p[1])
1819 {
1820 case 'x':
1821 case 'X':
1822 if (len >= 3)
1823 {
1824 p += 2;
1825 base = 16;
1826 len -= 2;
1827 }
1828 break;
1829
1830 case 'b':
1831 case 'B':
1832 if (len >= 3)
1833 {
1834 p += 2;
1835 base = 2;
1836 len -= 2;
1837 }
1838 break;
1839
1840 case 't':
1841 case 'T':
1842 case 'd':
1843 case 'D':
1844 if (len >= 3)
1845 {
1846 p += 2;
1847 base = 10;
1848 len -= 2;
1849 }
1850 break;
1851
1852 default:
1853 base = 8;
1854 break;
1855 }
1856
1857 while (len-- > 0)
1858 {
1859 c = *p++;
1860 if (c >= 'A' && c <= 'Z')
1861 c += 'a' - 'A';
1862 if (c != 'l' && c != 'u')
1863 n *= base;
1864 if (c >= '0' && c <= '9')
1865 {
1866 if (found_suffix)
1867 return ERROR;
1868 n += i = c - '0';
1869 }
1870 else
1871 {
1872 if (base > 10 && c >= 'a' && c <= 'f')
1873 {
1874 if (found_suffix)
1875 return ERROR;
1876 n += i = c - 'a' + 10;
1877 }
1878 else if (c == 'l')
1879 {
1880 ++long_p;
1881 found_suffix = 1;
1882 }
1883 else if (c == 'u')
1884 {
1885 unsigned_p = 1;
1886 found_suffix = 1;
1887 }
1888 else
1889 return ERROR; /* Char not a digit */
1890 }
1891 if (i >= base)
1892 return ERROR; /* Invalid digit in this base */
1893
1894 /* Portably test for overflow (only works for nonzero values, so make
1895 a second check for zero). FIXME: Can't we just make n and prevn
1896 unsigned and avoid this? */
1897 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1898 unsigned_p = 1; /* Try something unsigned */
1899
1900 /* Portably test for unsigned overflow.
1901 FIXME: This check is wrong; for example it doesn't find overflow
1902 on 0x123456789 when LONGEST is 32 bits. */
1903 if (c != 'l' && c != 'u' && n != 0)
1904 {
1905 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1906 error (_("Numeric constant too large."));
1907 }
1908 prevn = n;
1909 }
1910
1911 /* An integer constant is an int, a long, or a long long. An L
1912 suffix forces it to be long; an LL suffix forces it to be long
1913 long. If not forced to a larger size, it gets the first type of
1914 the above that it fits in. To figure out whether it fits, we
1915 shift it right and see whether anything remains. Note that we
1916 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1917 operation, because many compilers will warn about such a shift
1918 (which always produces a zero result). Sometimes gdbarch_int_bit
1919 or gdbarch_long_bit will be that big, sometimes not. To deal with
1920 the case where it is we just always shift the value more than
1921 once, with fewer bits each time. */
1922
1923 un = (ULONGEST)n >> 2;
1924 if (long_p == 0
1925 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1926 {
1927 high_bit
1928 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1929
1930 /* A large decimal (not hex or octal) constant (between INT_MAX
1931 and UINT_MAX) is a long or unsigned long, according to ANSI,
1932 never an unsigned int, but this code treats it as unsigned
1933 int. This probably should be fixed. GCC gives a warning on
1934 such constants. */
1935
1936 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1937 signed_type = parse_type (par_state)->builtin_int;
1938 }
1939 else if (long_p <= 1
1940 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1941 {
1942 high_bit
1943 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1944 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1945 signed_type = parse_type (par_state)->builtin_long;
1946 }
1947 else
1948 {
1949 int shift;
1950 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1951 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1952 /* A long long does not fit in a LONGEST. */
1953 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1954 else
1955 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1956 high_bit = (ULONGEST) 1 << shift;
1957 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1958 signed_type = parse_type (par_state)->builtin_long_long;
1959 }
1960
1961 putithere->typed_val_int.val = n;
1962
1963 /* If the high bit of the worked out type is set then this number
1964 has to be unsigned. */
1965
1966 if (unsigned_p || (n & high_bit))
1967 {
1968 putithere->typed_val_int.type = unsigned_type;
1969 }
1970 else
1971 {
1972 putithere->typed_val_int.type = signed_type;
1973 }
1974
1975 return INT;
1976 }
1977
1978 /* Temporary obstack used for holding strings. */
1979 static struct obstack tempbuf;
1980 static int tempbuf_init;
1981
1982 /* Parse a C escape sequence. The initial backslash of the sequence
1983 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1984 last character of the sequence. If OUTPUT is not NULL, the
1985 translated form of the escape sequence will be written there. If
1986 OUTPUT is NULL, no output is written and the call will only affect
1987 *PTR. If an escape sequence is expressed in target bytes, then the
1988 entire sequence will simply be copied to OUTPUT. Return 1 if any
1989 character was emitted, 0 otherwise. */
1990
1991 int
1992 c_parse_escape (const char **ptr, struct obstack *output)
1993 {
1994 const char *tokptr = *ptr;
1995 int result = 1;
1996
1997 /* Some escape sequences undergo character set conversion. Those we
1998 translate here. */
1999 switch (*tokptr)
2000 {
2001 /* Hex escapes do not undergo character set conversion, so keep
2002 the escape sequence for later. */
2003 case 'x':
2004 if (output)
2005 obstack_grow_str (output, "\\x");
2006 ++tokptr;
2007 if (!isxdigit (*tokptr))
2008 error (_("\\x escape without a following hex digit"));
2009 while (isxdigit (*tokptr))
2010 {
2011 if (output)
2012 obstack_1grow (output, *tokptr);
2013 ++tokptr;
2014 }
2015 break;
2016
2017 /* Octal escapes do not undergo character set conversion, so
2018 keep the escape sequence for later. */
2019 case '0':
2020 case '1':
2021 case '2':
2022 case '3':
2023 case '4':
2024 case '5':
2025 case '6':
2026 case '7':
2027 {
2028 int i;
2029 if (output)
2030 obstack_grow_str (output, "\\");
2031 for (i = 0;
2032 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
2033 ++i)
2034 {
2035 if (output)
2036 obstack_1grow (output, *tokptr);
2037 ++tokptr;
2038 }
2039 }
2040 break;
2041
2042 /* We handle UCNs later. We could handle them here, but that
2043 would mean a spurious error in the case where the UCN could
2044 be converted to the target charset but not the host
2045 charset. */
2046 case 'u':
2047 case 'U':
2048 {
2049 char c = *tokptr;
2050 int i, len = c == 'U' ? 8 : 4;
2051 if (output)
2052 {
2053 obstack_1grow (output, '\\');
2054 obstack_1grow (output, *tokptr);
2055 }
2056 ++tokptr;
2057 if (!isxdigit (*tokptr))
2058 error (_("\\%c escape without a following hex digit"), c);
2059 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2060 {
2061 if (output)
2062 obstack_1grow (output, *tokptr);
2063 ++tokptr;
2064 }
2065 }
2066 break;
2067
2068 /* We must pass backslash through so that it does not
2069 cause quoting during the second expansion. */
2070 case '\\':
2071 if (output)
2072 obstack_grow_str (output, "\\\\");
2073 ++tokptr;
2074 break;
2075
2076 /* Escapes which undergo conversion. */
2077 case 'a':
2078 if (output)
2079 obstack_1grow (output, '\a');
2080 ++tokptr;
2081 break;
2082 case 'b':
2083 if (output)
2084 obstack_1grow (output, '\b');
2085 ++tokptr;
2086 break;
2087 case 'f':
2088 if (output)
2089 obstack_1grow (output, '\f');
2090 ++tokptr;
2091 break;
2092 case 'n':
2093 if (output)
2094 obstack_1grow (output, '\n');
2095 ++tokptr;
2096 break;
2097 case 'r':
2098 if (output)
2099 obstack_1grow (output, '\r');
2100 ++tokptr;
2101 break;
2102 case 't':
2103 if (output)
2104 obstack_1grow (output, '\t');
2105 ++tokptr;
2106 break;
2107 case 'v':
2108 if (output)
2109 obstack_1grow (output, '\v');
2110 ++tokptr;
2111 break;
2112
2113 /* GCC extension. */
2114 case 'e':
2115 if (output)
2116 obstack_1grow (output, HOST_ESCAPE_CHAR);
2117 ++tokptr;
2118 break;
2119
2120 /* Backslash-newline expands to nothing at all. */
2121 case '\n':
2122 ++tokptr;
2123 result = 0;
2124 break;
2125
2126 /* A few escapes just expand to the character itself. */
2127 case '\'':
2128 case '\"':
2129 case '?':
2130 /* GCC extensions. */
2131 case '(':
2132 case '{':
2133 case '[':
2134 case '%':
2135 /* Unrecognized escapes turn into the character itself. */
2136 default:
2137 if (output)
2138 obstack_1grow (output, *tokptr);
2139 ++tokptr;
2140 break;
2141 }
2142 *ptr = tokptr;
2143 return result;
2144 }
2145
2146 /* Parse a string or character literal from TOKPTR. The string or
2147 character may be wide or unicode. *OUTPTR is set to just after the
2148 end of the literal in the input string. The resulting token is
2149 stored in VALUE. This returns a token value, either STRING or
2150 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2151 number of host characters in the literal. */
2152
2153 static int
2154 parse_string_or_char (const char *tokptr, const char **outptr,
2155 struct typed_stoken *value, int *host_chars)
2156 {
2157 int quote;
2158 c_string_type type;
2159 int is_objc = 0;
2160
2161 /* Build the gdb internal form of the input string in tempbuf. Note
2162 that the buffer is null byte terminated *only* for the
2163 convenience of debugging gdb itself and printing the buffer
2164 contents when the buffer contains no embedded nulls. Gdb does
2165 not depend upon the buffer being null byte terminated, it uses
2166 the length string instead. This allows gdb to handle C strings
2167 (as well as strings in other languages) with embedded null
2168 bytes */
2169
2170 if (!tempbuf_init)
2171 tempbuf_init = 1;
2172 else
2173 obstack_free (&tempbuf, NULL);
2174 obstack_init (&tempbuf);
2175
2176 /* Record the string type. */
2177 if (*tokptr == 'L')
2178 {
2179 type = C_WIDE_STRING;
2180 ++tokptr;
2181 }
2182 else if (*tokptr == 'u')
2183 {
2184 type = C_STRING_16;
2185 ++tokptr;
2186 }
2187 else if (*tokptr == 'U')
2188 {
2189 type = C_STRING_32;
2190 ++tokptr;
2191 }
2192 else if (*tokptr == '@')
2193 {
2194 /* An Objective C string. */
2195 is_objc = 1;
2196 type = C_STRING;
2197 ++tokptr;
2198 }
2199 else
2200 type = C_STRING;
2201
2202 /* Skip the quote. */
2203 quote = *tokptr;
2204 if (quote == '\'')
2205 type |= C_CHAR;
2206 ++tokptr;
2207
2208 *host_chars = 0;
2209
2210 while (*tokptr)
2211 {
2212 char c = *tokptr;
2213 if (c == '\\')
2214 {
2215 ++tokptr;
2216 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2217 }
2218 else if (c == quote)
2219 break;
2220 else
2221 {
2222 obstack_1grow (&tempbuf, c);
2223 ++tokptr;
2224 /* FIXME: this does the wrong thing with multi-byte host
2225 characters. We could use mbrlen here, but that would
2226 make "set host-charset" a bit less useful. */
2227 ++*host_chars;
2228 }
2229 }
2230
2231 if (*tokptr != quote)
2232 {
2233 if (quote == '"')
2234 error (_("Unterminated string in expression."));
2235 else
2236 error (_("Unmatched single quote."));
2237 }
2238 ++tokptr;
2239
2240 value->type = type;
2241 value->ptr = (char *) obstack_base (&tempbuf);
2242 value->length = obstack_object_size (&tempbuf);
2243
2244 *outptr = tokptr;
2245
2246 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2247 }
2248
2249 /* This is used to associate some attributes with a token. */
2250
2251 enum token_flag
2252 {
2253 /* If this bit is set, the token is C++-only. */
2254
2255 FLAG_CXX = 1,
2256
2257 /* If this bit is set, the token is conditional: if there is a
2258 symbol of the same name, then the token is a symbol; otherwise,
2259 the token is a keyword. */
2260
2261 FLAG_SHADOW = 2
2262 };
2263 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2264
2265 struct token
2266 {
2267 const char *oper;
2268 int token;
2269 enum exp_opcode opcode;
2270 token_flags flags;
2271 };
2272
2273 static const struct token tokentab3[] =
2274 {
2275 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2276 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2277 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2278 {"...", DOTDOTDOT, BINOP_END, 0}
2279 };
2280
2281 static const struct token tokentab2[] =
2282 {
2283 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2284 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2285 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2286 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2287 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2288 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2289 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2290 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2291 {"++", INCREMENT, BINOP_END, 0},
2292 {"--", DECREMENT, BINOP_END, 0},
2293 {"->", ARROW, BINOP_END, 0},
2294 {"&&", ANDAND, BINOP_END, 0},
2295 {"||", OROR, BINOP_END, 0},
2296 /* "::" is *not* only C++: gdb overrides its meaning in several
2297 different ways, e.g., 'filename'::func, function::variable. */
2298 {"::", COLONCOLON, BINOP_END, 0},
2299 {"<<", LSH, BINOP_END, 0},
2300 {">>", RSH, BINOP_END, 0},
2301 {"==", EQUAL, BINOP_END, 0},
2302 {"!=", NOTEQUAL, BINOP_END, 0},
2303 {"<=", LEQ, BINOP_END, 0},
2304 {">=", GEQ, BINOP_END, 0},
2305 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2306 };
2307
2308 /* Identifier-like tokens. */
2309 static const struct token ident_tokens[] =
2310 {
2311 {"unsigned", UNSIGNED, OP_NULL, 0},
2312 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2313 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2314 {"struct", STRUCT, OP_NULL, 0},
2315 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2316 {"sizeof", SIZEOF, OP_NULL, 0},
2317 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2318 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2319 {"class", CLASS, OP_NULL, FLAG_CXX},
2320 {"union", UNION, OP_NULL, 0},
2321 {"short", SHORT, OP_NULL, 0},
2322 {"const", CONST_KEYWORD, OP_NULL, 0},
2323 {"enum", ENUM, OP_NULL, 0},
2324 {"long", LONG, OP_NULL, 0},
2325 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2326 {"int", INT_KEYWORD, OP_NULL, 0},
2327 {"new", NEW, OP_NULL, FLAG_CXX},
2328 {"delete", DELETE, OP_NULL, FLAG_CXX},
2329 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2330
2331 {"and", ANDAND, BINOP_END, FLAG_CXX},
2332 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2333 {"bitand", '&', OP_NULL, FLAG_CXX},
2334 {"bitor", '|', OP_NULL, FLAG_CXX},
2335 {"compl", '~', OP_NULL, FLAG_CXX},
2336 {"not", '!', OP_NULL, FLAG_CXX},
2337 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2338 {"or", OROR, BINOP_END, FLAG_CXX},
2339 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2340 {"xor", '^', OP_NULL, FLAG_CXX},
2341 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2342
2343 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2344 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2345 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2346 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2347
2348 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2349 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2350 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2351 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2352 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2353
2354 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2355 };
2356
2357 /* When we find that lexptr (the global var defined in parse.c) is
2358 pointing at a macro invocation, we expand the invocation, and call
2359 scan_macro_expansion to save the old lexptr here and point lexptr
2360 into the expanded text. When we reach the end of that, we call
2361 end_macro_expansion to pop back to the value we saved here. The
2362 macro expansion code promises to return only fully-expanded text,
2363 so we don't need to "push" more than one level.
2364
2365 This is disgusting, of course. It would be cleaner to do all macro
2366 expansion beforehand, and then hand that to lexptr. But we don't
2367 really know where the expression ends. Remember, in a command like
2368
2369 (gdb) break *ADDRESS if CONDITION
2370
2371 we evaluate ADDRESS in the scope of the current frame, but we
2372 evaluate CONDITION in the scope of the breakpoint's location. So
2373 it's simply wrong to try to macro-expand the whole thing at once. */
2374 static const char *macro_original_text;
2375
2376 /* We save all intermediate macro expansions on this obstack for the
2377 duration of a single parse. The expansion text may sometimes have
2378 to live past the end of the expansion, due to yacc lookahead.
2379 Rather than try to be clever about saving the data for a single
2380 token, we simply keep it all and delete it after parsing has
2381 completed. */
2382 static struct obstack expansion_obstack;
2383
2384 static void
2385 scan_macro_expansion (char *expansion)
2386 {
2387 char *copy;
2388
2389 /* We'd better not be trying to push the stack twice. */
2390 gdb_assert (! macro_original_text);
2391
2392 /* Copy to the obstack, and then free the intermediate
2393 expansion. */
2394 copy = (char *) obstack_copy0 (&expansion_obstack, expansion,
2395 strlen (expansion));
2396 xfree (expansion);
2397
2398 /* Save the old lexptr value, so we can return to it when we're done
2399 parsing the expanded text. */
2400 macro_original_text = lexptr;
2401 lexptr = copy;
2402 }
2403
2404 static int
2405 scanning_macro_expansion (void)
2406 {
2407 return macro_original_text != 0;
2408 }
2409
2410 static void
2411 finished_macro_expansion (void)
2412 {
2413 /* There'd better be something to pop back to. */
2414 gdb_assert (macro_original_text);
2415
2416 /* Pop back to the original text. */
2417 lexptr = macro_original_text;
2418 macro_original_text = 0;
2419 }
2420
2421 static void
2422 scan_macro_cleanup (void *dummy)
2423 {
2424 if (macro_original_text)
2425 finished_macro_expansion ();
2426
2427 obstack_free (&expansion_obstack, NULL);
2428 }
2429
2430 /* Return true iff the token represents a C++ cast operator. */
2431
2432 static int
2433 is_cast_operator (const char *token, int len)
2434 {
2435 return (! strncmp (token, "dynamic_cast", len)
2436 || ! strncmp (token, "static_cast", len)
2437 || ! strncmp (token, "reinterpret_cast", len)
2438 || ! strncmp (token, "const_cast", len));
2439 }
2440
2441 /* The scope used for macro expansion. */
2442 static struct macro_scope *expression_macro_scope;
2443
2444 /* This is set if a NAME token appeared at the very end of the input
2445 string, with no whitespace separating the name from the EOF. This
2446 is used only when parsing to do field name completion. */
2447 static int saw_name_at_eof;
2448
2449 /* This is set if the previously-returned token was a structure
2450 operator -- either '.' or ARROW. */
2451 static bool last_was_structop;
2452
2453 /* Read one token, getting characters through lexptr. */
2454
2455 static int
2456 lex_one_token (struct parser_state *par_state, bool *is_quoted_name)
2457 {
2458 int c;
2459 int namelen;
2460 unsigned int i;
2461 const char *tokstart;
2462 bool saw_structop = last_was_structop;
2463 char *copy;
2464
2465 last_was_structop = false;
2466 *is_quoted_name = false;
2467
2468 retry:
2469
2470 /* Check if this is a macro invocation that we need to expand. */
2471 if (! scanning_macro_expansion ())
2472 {
2473 char *expanded = macro_expand_next (&lexptr,
2474 standard_macro_lookup,
2475 expression_macro_scope);
2476
2477 if (expanded)
2478 scan_macro_expansion (expanded);
2479 }
2480
2481 prev_lexptr = lexptr;
2482
2483 tokstart = lexptr;
2484 /* See if it is a special token of length 3. */
2485 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2486 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2487 {
2488 if ((tokentab3[i].flags & FLAG_CXX) != 0
2489 && parse_language (par_state)->la_language != language_cplus)
2490 break;
2491
2492 lexptr += 3;
2493 yylval.opcode = tokentab3[i].opcode;
2494 return tokentab3[i].token;
2495 }
2496
2497 /* See if it is a special token of length 2. */
2498 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2499 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2500 {
2501 if ((tokentab2[i].flags & FLAG_CXX) != 0
2502 && parse_language (par_state)->la_language != language_cplus)
2503 break;
2504
2505 lexptr += 2;
2506 yylval.opcode = tokentab2[i].opcode;
2507 if (tokentab2[i].token == ARROW)
2508 last_was_structop = 1;
2509 return tokentab2[i].token;
2510 }
2511
2512 switch (c = *tokstart)
2513 {
2514 case 0:
2515 /* If we were just scanning the result of a macro expansion,
2516 then we need to resume scanning the original text.
2517 If we're parsing for field name completion, and the previous
2518 token allows such completion, return a COMPLETE token.
2519 Otherwise, we were already scanning the original text, and
2520 we're really done. */
2521 if (scanning_macro_expansion ())
2522 {
2523 finished_macro_expansion ();
2524 goto retry;
2525 }
2526 else if (saw_name_at_eof)
2527 {
2528 saw_name_at_eof = 0;
2529 return COMPLETE;
2530 }
2531 else if (parse_completion && saw_structop)
2532 return COMPLETE;
2533 else
2534 return 0;
2535
2536 case ' ':
2537 case '\t':
2538 case '\n':
2539 lexptr++;
2540 goto retry;
2541
2542 case '[':
2543 case '(':
2544 paren_depth++;
2545 lexptr++;
2546 if (parse_language (par_state)->la_language == language_objc
2547 && c == '[')
2548 return OBJC_LBRAC;
2549 return c;
2550
2551 case ']':
2552 case ')':
2553 if (paren_depth == 0)
2554 return 0;
2555 paren_depth--;
2556 lexptr++;
2557 return c;
2558
2559 case ',':
2560 if (comma_terminates
2561 && paren_depth == 0
2562 && ! scanning_macro_expansion ())
2563 return 0;
2564 lexptr++;
2565 return c;
2566
2567 case '.':
2568 /* Might be a floating point number. */
2569 if (lexptr[1] < '0' || lexptr[1] > '9')
2570 {
2571 last_was_structop = true;
2572 goto symbol; /* Nope, must be a symbol. */
2573 }
2574 /* FALL THRU into number case. */
2575
2576 case '0':
2577 case '1':
2578 case '2':
2579 case '3':
2580 case '4':
2581 case '5':
2582 case '6':
2583 case '7':
2584 case '8':
2585 case '9':
2586 {
2587 /* It's a number. */
2588 int got_dot = 0, got_e = 0, toktype;
2589 const char *p = tokstart;
2590 int hex = input_radix > 10;
2591
2592 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2593 {
2594 p += 2;
2595 hex = 1;
2596 }
2597 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2598 {
2599 p += 2;
2600 hex = 0;
2601 }
2602
2603 for (;; ++p)
2604 {
2605 /* This test includes !hex because 'e' is a valid hex digit
2606 and thus does not indicate a floating point number when
2607 the radix is hex. */
2608 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2609 got_dot = got_e = 1;
2610 /* This test does not include !hex, because a '.' always indicates
2611 a decimal floating point number regardless of the radix. */
2612 else if (!got_dot && *p == '.')
2613 got_dot = 1;
2614 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2615 && (*p == '-' || *p == '+'))
2616 /* This is the sign of the exponent, not the end of the
2617 number. */
2618 continue;
2619 /* We will take any letters or digits. parse_number will
2620 complain if past the radix, or if L or U are not final. */
2621 else if ((*p < '0' || *p > '9')
2622 && ((*p < 'a' || *p > 'z')
2623 && (*p < 'A' || *p > 'Z')))
2624 break;
2625 }
2626 toktype = parse_number (par_state, tokstart, p - tokstart,
2627 got_dot|got_e, &yylval);
2628 if (toktype == ERROR)
2629 {
2630 char *err_copy = (char *) alloca (p - tokstart + 1);
2631
2632 memcpy (err_copy, tokstart, p - tokstart);
2633 err_copy[p - tokstart] = 0;
2634 error (_("Invalid number \"%s\"."), err_copy);
2635 }
2636 lexptr = p;
2637 return toktype;
2638 }
2639
2640 case '@':
2641 {
2642 const char *p = &tokstart[1];
2643 size_t len = strlen ("entry");
2644
2645 if (parse_language (par_state)->la_language == language_objc)
2646 {
2647 size_t len = strlen ("selector");
2648
2649 if (strncmp (p, "selector", len) == 0
2650 && (p[len] == '\0' || isspace (p[len])))
2651 {
2652 lexptr = p + len;
2653 return SELECTOR;
2654 }
2655 else if (*p == '"')
2656 goto parse_string;
2657 }
2658
2659 while (isspace (*p))
2660 p++;
2661 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2662 && p[len] != '_')
2663 {
2664 lexptr = &p[len];
2665 return ENTRY;
2666 }
2667 }
2668 /* FALLTHRU */
2669 case '+':
2670 case '-':
2671 case '*':
2672 case '/':
2673 case '%':
2674 case '|':
2675 case '&':
2676 case '^':
2677 case '~':
2678 case '!':
2679 case '<':
2680 case '>':
2681 case '?':
2682 case ':':
2683 case '=':
2684 case '{':
2685 case '}':
2686 symbol:
2687 lexptr++;
2688 return c;
2689
2690 case 'L':
2691 case 'u':
2692 case 'U':
2693 if (tokstart[1] != '"' && tokstart[1] != '\'')
2694 break;
2695 /* Fall through. */
2696 case '\'':
2697 case '"':
2698
2699 parse_string:
2700 {
2701 int host_len;
2702 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2703 &host_len);
2704 if (result == CHAR)
2705 {
2706 if (host_len == 0)
2707 error (_("Empty character constant."));
2708 else if (host_len > 2 && c == '\'')
2709 {
2710 ++tokstart;
2711 namelen = lexptr - tokstart - 1;
2712 *is_quoted_name = true;
2713
2714 goto tryname;
2715 }
2716 else if (host_len > 1)
2717 error (_("Invalid character constant."));
2718 }
2719 return result;
2720 }
2721 }
2722
2723 if (!(c == '_' || c == '$'
2724 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2725 /* We must have come across a bad character (e.g. ';'). */
2726 error (_("Invalid character '%c' in expression."), c);
2727
2728 /* It's a name. See how long it is. */
2729 namelen = 0;
2730 for (c = tokstart[namelen];
2731 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2732 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2733 {
2734 /* Template parameter lists are part of the name.
2735 FIXME: This mishandles `print $a<4&&$a>3'. */
2736
2737 if (c == '<')
2738 {
2739 if (! is_cast_operator (tokstart, namelen))
2740 {
2741 /* Scan ahead to get rest of the template specification. Note
2742 that we look ahead only when the '<' adjoins non-whitespace
2743 characters; for comparison expressions, e.g. "a < b > c",
2744 there must be spaces before the '<', etc. */
2745 const char *p = find_template_name_end (tokstart + namelen);
2746
2747 if (p)
2748 namelen = p - tokstart;
2749 }
2750 break;
2751 }
2752 c = tokstart[++namelen];
2753 }
2754
2755 /* The token "if" terminates the expression and is NOT removed from
2756 the input stream. It doesn't count if it appears in the
2757 expansion of a macro. */
2758 if (namelen == 2
2759 && tokstart[0] == 'i'
2760 && tokstart[1] == 'f'
2761 && ! scanning_macro_expansion ())
2762 {
2763 return 0;
2764 }
2765
2766 /* For the same reason (breakpoint conditions), "thread N"
2767 terminates the expression. "thread" could be an identifier, but
2768 an identifier is never followed by a number without intervening
2769 punctuation. "task" is similar. Handle abbreviations of these,
2770 similarly to breakpoint.c:find_condition_and_thread. */
2771 if (namelen >= 1
2772 && (strncmp (tokstart, "thread", namelen) == 0
2773 || strncmp (tokstart, "task", namelen) == 0)
2774 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2775 && ! scanning_macro_expansion ())
2776 {
2777 const char *p = tokstart + namelen + 1;
2778
2779 while (*p == ' ' || *p == '\t')
2780 p++;
2781 if (*p >= '0' && *p <= '9')
2782 return 0;
2783 }
2784
2785 lexptr += namelen;
2786
2787 tryname:
2788
2789 yylval.sval.ptr = tokstart;
2790 yylval.sval.length = namelen;
2791
2792 /* Catch specific keywords. */
2793 copy = copy_name (yylval.sval);
2794 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2795 if (strcmp (copy, ident_tokens[i].oper) == 0)
2796 {
2797 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2798 && parse_language (par_state)->la_language != language_cplus)
2799 break;
2800
2801 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2802 {
2803 struct field_of_this_result is_a_field_of_this;
2804
2805 if (lookup_symbol (copy, expression_context_block,
2806 VAR_DOMAIN,
2807 (parse_language (par_state)->la_language
2808 == language_cplus ? &is_a_field_of_this
2809 : NULL)).symbol
2810 != NULL)
2811 {
2812 /* The keyword is shadowed. */
2813 break;
2814 }
2815 }
2816
2817 /* It is ok to always set this, even though we don't always
2818 strictly need to. */
2819 yylval.opcode = ident_tokens[i].opcode;
2820 return ident_tokens[i].token;
2821 }
2822
2823 if (*tokstart == '$')
2824 return VARIABLE;
2825
2826 if (parse_completion && *lexptr == '\0')
2827 saw_name_at_eof = 1;
2828
2829 yylval.ssym.stoken = yylval.sval;
2830 yylval.ssym.sym.symbol = NULL;
2831 yylval.ssym.sym.block = NULL;
2832 yylval.ssym.is_a_field_of_this = 0;
2833 return NAME;
2834 }
2835
2836 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2837 typedef struct
2838 {
2839 int token;
2840 YYSTYPE value;
2841 } token_and_value;
2842
2843 DEF_VEC_O (token_and_value);
2844
2845 /* A FIFO of tokens that have been read but not yet returned to the
2846 parser. */
2847 static VEC (token_and_value) *token_fifo;
2848
2849 /* Non-zero if the lexer should return tokens from the FIFO. */
2850 static int popping;
2851
2852 /* Temporary storage for c_lex; this holds symbol names as they are
2853 built up. */
2854 auto_obstack name_obstack;
2855
2856 /* Classify a NAME token. The contents of the token are in `yylval'.
2857 Updates yylval and returns the new token type. BLOCK is the block
2858 in which lookups start; this can be NULL to mean the global scope.
2859 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2860 in single quotes. IS_AFTER_STRUCTOP is true if this name follows
2861 a structure operator -- either '.' or ARROW */
2862
2863 static int
2864 classify_name (struct parser_state *par_state, const struct block *block,
2865 bool is_quoted_name, bool is_after_structop)
2866 {
2867 struct block_symbol bsym;
2868 char *copy;
2869 struct field_of_this_result is_a_field_of_this;
2870
2871 copy = copy_name (yylval.sval);
2872
2873 /* Initialize this in case we *don't* use it in this call; that way
2874 we can refer to it unconditionally below. */
2875 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2876
2877 bsym = lookup_symbol (copy, block, VAR_DOMAIN,
2878 parse_language (par_state)->la_name_of_this
2879 ? &is_a_field_of_this : NULL);
2880
2881 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2882 {
2883 yylval.ssym.sym = bsym;
2884 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2885 return BLOCKNAME;
2886 }
2887 else if (!bsym.symbol)
2888 {
2889 /* If we found a field of 'this', we might have erroneously
2890 found a constructor where we wanted a type name. Handle this
2891 case by noticing that we found a constructor and then look up
2892 the type tag instead. */
2893 if (is_a_field_of_this.type != NULL
2894 && is_a_field_of_this.fn_field != NULL
2895 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2896 0))
2897 {
2898 struct field_of_this_result inner_is_a_field_of_this;
2899
2900 bsym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2901 &inner_is_a_field_of_this);
2902 if (bsym.symbol != NULL)
2903 {
2904 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2905 return TYPENAME;
2906 }
2907 }
2908
2909 /* If we found a field on the "this" object, or we are looking
2910 up a field on a struct, then we want to prefer it over a
2911 filename. However, if the name was quoted, then it is better
2912 to check for a filename or a block, since this is the only
2913 way the user has of requiring the extension to be used. */
2914 if ((is_a_field_of_this.type == NULL && !is_after_structop)
2915 || is_quoted_name)
2916 {
2917 /* See if it's a file name. */
2918 struct symtab *symtab;
2919
2920 symtab = lookup_symtab (copy);
2921 if (symtab)
2922 {
2923 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
2924 STATIC_BLOCK);
2925 return FILENAME;
2926 }
2927 }
2928 }
2929
2930 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
2931 {
2932 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2933 return TYPENAME;
2934 }
2935
2936 /* See if it's an ObjC classname. */
2937 if (parse_language (par_state)->la_language == language_objc && !bsym.symbol)
2938 {
2939 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2940 if (Class)
2941 {
2942 struct symbol *sym;
2943
2944 yylval.theclass.theclass = Class;
2945 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2946 if (sym)
2947 yylval.theclass.type = SYMBOL_TYPE (sym);
2948 return CLASSNAME;
2949 }
2950 }
2951
2952 /* Input names that aren't symbols but ARE valid hex numbers, when
2953 the input radix permits them, can be names or numbers depending
2954 on the parse. Note we support radixes > 16 here. */
2955 if (!bsym.symbol
2956 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2957 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2958 {
2959 YYSTYPE newlval; /* Its value is ignored. */
2960 int hextype = parse_number (par_state, copy, yylval.sval.length,
2961 0, &newlval);
2962
2963 if (hextype == INT)
2964 {
2965 yylval.ssym.sym = bsym;
2966 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2967 return NAME_OR_INT;
2968 }
2969 }
2970
2971 /* Any other kind of symbol */
2972 yylval.ssym.sym = bsym;
2973 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2974
2975 if (bsym.symbol == NULL
2976 && parse_language (par_state)->la_language == language_cplus
2977 && is_a_field_of_this.type == NULL
2978 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
2979 return UNKNOWN_CPP_NAME;
2980
2981 return NAME;
2982 }
2983
2984 /* Like classify_name, but used by the inner loop of the lexer, when a
2985 name might have already been seen. CONTEXT is the context type, or
2986 NULL if this is the first component of a name. */
2987
2988 static int
2989 classify_inner_name (struct parser_state *par_state,
2990 const struct block *block, struct type *context)
2991 {
2992 struct type *type;
2993 char *copy;
2994
2995 if (context == NULL)
2996 return classify_name (par_state, block, false, false);
2997
2998 type = check_typedef (context);
2999 if (!type_aggregate_p (type))
3000 return ERROR;
3001
3002 copy = copy_name (yylval.ssym.stoken);
3003 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3004 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN);
3005
3006 /* If no symbol was found, search for a matching base class named
3007 COPY. This will allow users to enter qualified names of class members
3008 relative to the `this' pointer. */
3009 if (yylval.ssym.sym.symbol == NULL)
3010 {
3011 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3012
3013 if (base_type != NULL)
3014 {
3015 yylval.tsym.type = base_type;
3016 return TYPENAME;
3017 }
3018
3019 return ERROR;
3020 }
3021
3022 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
3023 {
3024 case LOC_BLOCK:
3025 case LOC_LABEL:
3026 /* cp_lookup_nested_symbol might have accidentally found a constructor
3027 named COPY when we really wanted a base class of the same name.
3028 Double-check this case by looking for a base class. */
3029 {
3030 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3031
3032 if (base_type != NULL)
3033 {
3034 yylval.tsym.type = base_type;
3035 return TYPENAME;
3036 }
3037 }
3038 return ERROR;
3039
3040 case LOC_TYPEDEF:
3041 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3042 return TYPENAME;
3043
3044 default:
3045 return NAME;
3046 }
3047 internal_error (__FILE__, __LINE__, _("not reached"));
3048 }
3049
3050 /* The outer level of a two-level lexer. This calls the inner lexer
3051 to return tokens. It then either returns these tokens, or
3052 aggregates them into a larger token. This lets us work around a
3053 problem in our parsing approach, where the parser could not
3054 distinguish between qualified names and qualified types at the
3055 right point.
3056
3057 This approach is still not ideal, because it mishandles template
3058 types. See the comment in lex_one_token for an example. However,
3059 this is still an improvement over the earlier approach, and will
3060 suffice until we move to better parsing technology. */
3061
3062 static int
3063 yylex (void)
3064 {
3065 token_and_value current;
3066 int first_was_coloncolon, last_was_coloncolon;
3067 struct type *context_type = NULL;
3068 int last_to_examine, next_to_examine, checkpoint;
3069 const struct block *search_block;
3070 bool is_quoted_name, last_lex_was_structop;
3071
3072 if (popping && !VEC_empty (token_and_value, token_fifo))
3073 goto do_pop;
3074 popping = 0;
3075
3076 last_lex_was_structop = last_was_structop;
3077
3078 /* Read the first token and decide what to do. Most of the
3079 subsequent code is C++-only; but also depends on seeing a "::" or
3080 name-like token. */
3081 current.token = lex_one_token (pstate, &is_quoted_name);
3082 if (current.token == NAME)
3083 current.token = classify_name (pstate, expression_context_block,
3084 is_quoted_name, last_lex_was_structop);
3085 if (parse_language (pstate)->la_language != language_cplus
3086 || (current.token != TYPENAME && current.token != COLONCOLON
3087 && current.token != FILENAME))
3088 return current.token;
3089
3090 /* Read any sequence of alternating "::" and name-like tokens into
3091 the token FIFO. */
3092 current.value = yylval;
3093 VEC_safe_push (token_and_value, token_fifo, &current);
3094 last_was_coloncolon = current.token == COLONCOLON;
3095 while (1)
3096 {
3097 bool ignore;
3098
3099 /* We ignore quoted names other than the very first one.
3100 Subsequent ones do not have any special meaning. */
3101 current.token = lex_one_token (pstate, &ignore);
3102 current.value = yylval;
3103 VEC_safe_push (token_and_value, token_fifo, &current);
3104
3105 if ((last_was_coloncolon && current.token != NAME)
3106 || (!last_was_coloncolon && current.token != COLONCOLON))
3107 break;
3108 last_was_coloncolon = !last_was_coloncolon;
3109 }
3110 popping = 1;
3111
3112 /* We always read one extra token, so compute the number of tokens
3113 to examine accordingly. */
3114 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3115 next_to_examine = 0;
3116
3117 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3118 ++next_to_examine;
3119
3120 name_obstack.clear ();
3121 checkpoint = 0;
3122 if (current.token == FILENAME)
3123 search_block = current.value.bval;
3124 else if (current.token == COLONCOLON)
3125 search_block = NULL;
3126 else
3127 {
3128 gdb_assert (current.token == TYPENAME);
3129 search_block = expression_context_block;
3130 obstack_grow (&name_obstack, current.value.sval.ptr,
3131 current.value.sval.length);
3132 context_type = current.value.tsym.type;
3133 checkpoint = 1;
3134 }
3135
3136 first_was_coloncolon = current.token == COLONCOLON;
3137 last_was_coloncolon = first_was_coloncolon;
3138
3139 while (next_to_examine <= last_to_examine)
3140 {
3141 token_and_value *next;
3142
3143 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3144 ++next_to_examine;
3145
3146 if (next->token == NAME && last_was_coloncolon)
3147 {
3148 int classification;
3149
3150 yylval = next->value;
3151 classification = classify_inner_name (pstate, search_block,
3152 context_type);
3153 /* We keep going until we either run out of names, or until
3154 we have a qualified name which is not a type. */
3155 if (classification != TYPENAME && classification != NAME)
3156 break;
3157
3158 /* Accept up to this token. */
3159 checkpoint = next_to_examine;
3160
3161 /* Update the partial name we are constructing. */
3162 if (context_type != NULL)
3163 {
3164 /* We don't want to put a leading "::" into the name. */
3165 obstack_grow_str (&name_obstack, "::");
3166 }
3167 obstack_grow (&name_obstack, next->value.sval.ptr,
3168 next->value.sval.length);
3169
3170 yylval.sval.ptr = (const char *) obstack_base (&name_obstack);
3171 yylval.sval.length = obstack_object_size (&name_obstack);
3172 current.value = yylval;
3173 current.token = classification;
3174
3175 last_was_coloncolon = 0;
3176
3177 if (classification == NAME)
3178 break;
3179
3180 context_type = yylval.tsym.type;
3181 }
3182 else if (next->token == COLONCOLON && !last_was_coloncolon)
3183 last_was_coloncolon = 1;
3184 else
3185 {
3186 /* We've reached the end of the name. */
3187 break;
3188 }
3189 }
3190
3191 /* If we have a replacement token, install it as the first token in
3192 the FIFO, and delete the other constituent tokens. */
3193 if (checkpoint > 0)
3194 {
3195 current.value.sval.ptr
3196 = (const char *) obstack_copy0 (&expansion_obstack,
3197 current.value.sval.ptr,
3198 current.value.sval.length);
3199
3200 VEC_replace (token_and_value, token_fifo, 0, &current);
3201 if (checkpoint > 1)
3202 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3203 }
3204
3205 do_pop:
3206 current = *VEC_index (token_and_value, token_fifo, 0);
3207 VEC_ordered_remove (token_and_value, token_fifo, 0);
3208 yylval = current.value;
3209 return current.token;
3210 }
3211
3212 int
3213 c_parse (struct parser_state *par_state)
3214 {
3215 int result;
3216 struct cleanup *back_to;
3217
3218 /* Setting up the parser state. */
3219 scoped_restore pstate_restore = make_scoped_restore (&pstate);
3220 gdb_assert (par_state != NULL);
3221 pstate = par_state;
3222
3223 /* Note that parsing (within yyparse) freely installs cleanups
3224 assuming they'll be run here (below). */
3225
3226 back_to = make_cleanup (free_current_contents, &expression_macro_scope);
3227
3228 /* Set up the scope for macro expansion. */
3229 expression_macro_scope = NULL;
3230
3231 if (expression_context_block)
3232 expression_macro_scope
3233 = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3234 else
3235 expression_macro_scope = default_macro_scope ();
3236 if (! expression_macro_scope)
3237 expression_macro_scope = user_macro_scope ();
3238
3239 /* Initialize macro expansion code. */
3240 obstack_init (&expansion_obstack);
3241 gdb_assert (! macro_original_text);
3242 make_cleanup (scan_macro_cleanup, 0);
3243
3244 scoped_restore restore_yydebug = make_scoped_restore (&yydebug,
3245 parser_debug);
3246
3247 /* Initialize some state used by the lexer. */
3248 last_was_structop = false;
3249 saw_name_at_eof = 0;
3250
3251 VEC_free (token_and_value, token_fifo);
3252 popping = 0;
3253 name_obstack.clear ();
3254
3255 result = yyparse ();
3256 do_cleanups (back_to);
3257
3258 return result;
3259 }
3260
3261 #ifdef YYBISON
3262
3263 /* This is called via the YYPRINT macro when parser debugging is
3264 enabled. It prints a token's value. */
3265
3266 static void
3267 c_print_token (FILE *file, int type, YYSTYPE value)
3268 {
3269 switch (type)
3270 {
3271 case INT:
3272 parser_fprintf (file, "typed_val_int<%s, %s>",
3273 TYPE_SAFE_NAME (value.typed_val_int.type),
3274 pulongest (value.typed_val_int.val));
3275 break;
3276
3277 case CHAR:
3278 case STRING:
3279 {
3280 char *copy = (char *) alloca (value.tsval.length + 1);
3281
3282 memcpy (copy, value.tsval.ptr, value.tsval.length);
3283 copy[value.tsval.length] = '\0';
3284
3285 parser_fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3286 }
3287 break;
3288
3289 case NSSTRING:
3290 case VARIABLE:
3291 parser_fprintf (file, "sval<%s>", copy_name (value.sval));
3292 break;
3293
3294 case TYPENAME:
3295 parser_fprintf (file, "tsym<type=%s, name=%s>",
3296 TYPE_SAFE_NAME (value.tsym.type),
3297 copy_name (value.tsym.stoken));
3298 break;
3299
3300 case NAME:
3301 case UNKNOWN_CPP_NAME:
3302 case NAME_OR_INT:
3303 case BLOCKNAME:
3304 parser_fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3305 copy_name (value.ssym.stoken),
3306 (value.ssym.sym.symbol == NULL
3307 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym.symbol)),
3308 value.ssym.is_a_field_of_this);
3309 break;
3310
3311 case FILENAME:
3312 parser_fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3313 break;
3314 }
3315 }
3316
3317 #endif
3318
3319 void
3320 yyerror (const char *msg)
3321 {
3322 if (prev_lexptr)
3323 lexptr = prev_lexptr;
3324
3325 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);
3326 }
GDB Binutils - Deliverables
This page took 0.097992 seconds and 4 git commands to generate.