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