projects / deliverable / binutils-gdb.git / blob
? search:


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