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