projects / deliverable / binutils-gdb.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Use ui_file_as_string in gdb/c-exp.y
[deliverable/binutils-gdb.git] / gdb / c-exp.y
1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986-2016 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 { struct ui_file *buf = mem_fileopen ();
1559
1560 c_print_type ($2, NULL, buf, -1, 0,
1561 &type_print_raw_options);
1562 std::string name = ui_file_as_string (buf);
1563 ui_file_delete (buf);
1564 $$ = operator_stoken (name.c_str ());
1565 }
1566 ;
1567
1568
1569
1570 name : NAME { $$ = $1.stoken; }
1571 | BLOCKNAME { $$ = $1.stoken; }
1572 | TYPENAME { $$ = $1.stoken; }
1573 | NAME_OR_INT { $$ = $1.stoken; }
1574 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1575 | oper { $$ = $1; }
1576 ;
1577
1578 name_not_typename : NAME
1579 | BLOCKNAME
1580 /* These would be useful if name_not_typename was useful, but it is just
1581 a fake for "variable", so these cause reduce/reduce conflicts because
1582 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1583 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1584 context where only a name could occur, this might be useful.
1585 | NAME_OR_INT
1586 */
1587 | oper
1588 {
1589 struct field_of_this_result is_a_field_of_this;
1590
1591 $$.stoken = $1;
1592 $$.sym = lookup_symbol ($1.ptr,
1593 expression_context_block,
1594 VAR_DOMAIN,
1595 &is_a_field_of_this);
1596 $$.is_a_field_of_this
1597 = is_a_field_of_this.type != NULL;
1598 }
1599 | UNKNOWN_CPP_NAME
1600 ;
1601
1602 %%
1603
1604 /* Like write_exp_string, but prepends a '~'. */
1605
1606 static void
1607 write_destructor_name (struct parser_state *par_state, struct stoken token)
1608 {
1609 char *copy = (char *) alloca (token.length + 1);
1610
1611 copy[0] = '~';
1612 memcpy (&copy[1], token.ptr, token.length);
1613
1614 token.ptr = copy;
1615 ++token.length;
1616
1617 write_exp_string (par_state, token);
1618 }
1619
1620 /* Returns a stoken of the operator name given by OP (which does not
1621 include the string "operator"). */
1622
1623 static struct stoken
1624 operator_stoken (const char *op)
1625 {
1626 static const char *operator_string = "operator";
1627 struct stoken st = { NULL, 0 };
1628 char *buf;
1629
1630 st.length = strlen (operator_string) + strlen (op);
1631 buf = (char *) malloc (st.length + 1);
1632 strcpy (buf, operator_string);
1633 strcat (buf, op);
1634 st.ptr = buf;
1635
1636 /* The toplevel (c_parse) will free the memory allocated here. */
1637 make_cleanup (free, buf);
1638 return st;
1639 };
1640
1641 /* Return true if the type is aggregate-like. */
1642
1643 static int
1644 type_aggregate_p (struct type *type)
1645 {
1646 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1647 || TYPE_CODE (type) == TYPE_CODE_UNION
1648 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1649 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1650 && TYPE_DECLARED_CLASS (type)));
1651 }
1652
1653 /* Validate a parameter typelist. */
1654
1655 static void
1656 check_parameter_typelist (VEC (type_ptr) *params)
1657 {
1658 struct type *type;
1659 int ix;
1660
1661 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1662 {
1663 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1664 {
1665 if (ix == 0)
1666 {
1667 if (VEC_length (type_ptr, params) == 1)
1668 {
1669 /* Ok. */
1670 break;
1671 }
1672 VEC_free (type_ptr, params);
1673 error (_("parameter types following 'void'"));
1674 }
1675 else
1676 {
1677 VEC_free (type_ptr, params);
1678 error (_("'void' invalid as parameter type"));
1679 }
1680 }
1681 }
1682 }
1683
1684 /* Take care of parsing a number (anything that starts with a digit).
1685 Set yylval and return the token type; update lexptr.
1686 LEN is the number of characters in it. */
1687
1688 /*** Needs some error checking for the float case ***/
1689
1690 static int
1691 parse_number (struct parser_state *par_state,
1692 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1693 {
1694 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1695 here, and we do kind of silly things like cast to unsigned. */
1696 LONGEST n = 0;
1697 LONGEST prevn = 0;
1698 ULONGEST un;
1699
1700 int i = 0;
1701 int c;
1702 int base = input_radix;
1703 int unsigned_p = 0;
1704
1705 /* Number of "L" suffixes encountered. */
1706 int long_p = 0;
1707
1708 /* We have found a "L" or "U" suffix. */
1709 int found_suffix = 0;
1710
1711 ULONGEST high_bit;
1712 struct type *signed_type;
1713 struct type *unsigned_type;
1714 char *p;
1715
1716 p = (char *) alloca (len);
1717 memcpy (p, buf, len);
1718
1719 if (parsed_float)
1720 {
1721 /* If it ends at "df", "dd" or "dl", take it as type of decimal floating
1722 point. Return DECFLOAT. */
1723
1724 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1725 {
1726 p[len - 2] = '\0';
1727 putithere->typed_val_decfloat.type
1728 = parse_type (par_state)->builtin_decfloat;
1729 decimal_from_string (putithere->typed_val_decfloat.val, 4,
1730 gdbarch_byte_order (parse_gdbarch (par_state)),
1731 p);
1732 p[len - 2] = 'd';
1733 return DECFLOAT;
1734 }
1735
1736 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1737 {
1738 p[len - 2] = '\0';
1739 putithere->typed_val_decfloat.type
1740 = parse_type (par_state)->builtin_decdouble;
1741 decimal_from_string (putithere->typed_val_decfloat.val, 8,
1742 gdbarch_byte_order (parse_gdbarch (par_state)),
1743 p);
1744 p[len - 2] = 'd';
1745 return DECFLOAT;
1746 }
1747
1748 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1749 {
1750 p[len - 2] = '\0';
1751 putithere->typed_val_decfloat.type
1752 = parse_type (par_state)->builtin_declong;
1753 decimal_from_string (putithere->typed_val_decfloat.val, 16,
1754 gdbarch_byte_order (parse_gdbarch (par_state)),
1755 p);
1756 p[len - 2] = 'd';
1757 return DECFLOAT;
1758 }
1759
1760 if (! parse_c_float (parse_gdbarch (par_state), p, len,
1761 &putithere->typed_val_float.dval,
1762 &putithere->typed_val_float.type))
1763 return ERROR;
1764 return FLOAT;
1765 }
1766
1767 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1768 if (p[0] == '0' && len > 1)
1769 switch (p[1])
1770 {
1771 case 'x':
1772 case 'X':
1773 if (len >= 3)
1774 {
1775 p += 2;
1776 base = 16;
1777 len -= 2;
1778 }
1779 break;
1780
1781 case 'b':
1782 case 'B':
1783 if (len >= 3)
1784 {
1785 p += 2;
1786 base = 2;
1787 len -= 2;
1788 }
1789 break;
1790
1791 case 't':
1792 case 'T':
1793 case 'd':
1794 case 'D':
1795 if (len >= 3)
1796 {
1797 p += 2;
1798 base = 10;
1799 len -= 2;
1800 }
1801 break;
1802
1803 default:
1804 base = 8;
1805 break;
1806 }
1807
1808 while (len-- > 0)
1809 {
1810 c = *p++;
1811 if (c >= 'A' && c <= 'Z')
1812 c += 'a' - 'A';
1813 if (c != 'l' && c != 'u')
1814 n *= base;
1815 if (c >= '0' && c <= '9')
1816 {
1817 if (found_suffix)
1818 return ERROR;
1819 n += i = c - '0';
1820 }
1821 else
1822 {
1823 if (base > 10 && c >= 'a' && c <= 'f')
1824 {
1825 if (found_suffix)
1826 return ERROR;
1827 n += i = c - 'a' + 10;
1828 }
1829 else if (c == 'l')
1830 {
1831 ++long_p;
1832 found_suffix = 1;
1833 }
1834 else if (c == 'u')
1835 {
1836 unsigned_p = 1;
1837 found_suffix = 1;
1838 }
1839 else
1840 return ERROR; /* Char not a digit */
1841 }
1842 if (i >= base)
1843 return ERROR; /* Invalid digit in this base */
1844
1845 /* Portably test for overflow (only works for nonzero values, so make
1846 a second check for zero). FIXME: Can't we just make n and prevn
1847 unsigned and avoid this? */
1848 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1849 unsigned_p = 1; /* Try something unsigned */
1850
1851 /* Portably test for unsigned overflow.
1852 FIXME: This check is wrong; for example it doesn't find overflow
1853 on 0x123456789 when LONGEST is 32 bits. */
1854 if (c != 'l' && c != 'u' && n != 0)
1855 {
1856 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1857 error (_("Numeric constant too large."));
1858 }
1859 prevn = n;
1860 }
1861
1862 /* An integer constant is an int, a long, or a long long. An L
1863 suffix forces it to be long; an LL suffix forces it to be long
1864 long. If not forced to a larger size, it gets the first type of
1865 the above that it fits in. To figure out whether it fits, we
1866 shift it right and see whether anything remains. Note that we
1867 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1868 operation, because many compilers will warn about such a shift
1869 (which always produces a zero result). Sometimes gdbarch_int_bit
1870 or gdbarch_long_bit will be that big, sometimes not. To deal with
1871 the case where it is we just always shift the value more than
1872 once, with fewer bits each time. */
1873
1874 un = (ULONGEST)n >> 2;
1875 if (long_p == 0
1876 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1877 {
1878 high_bit
1879 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1880
1881 /* A large decimal (not hex or octal) constant (between INT_MAX
1882 and UINT_MAX) is a long or unsigned long, according to ANSI,
1883 never an unsigned int, but this code treats it as unsigned
1884 int. This probably should be fixed. GCC gives a warning on
1885 such constants. */
1886
1887 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1888 signed_type = parse_type (par_state)->builtin_int;
1889 }
1890 else if (long_p <= 1
1891 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1892 {
1893 high_bit
1894 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1895 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1896 signed_type = parse_type (par_state)->builtin_long;
1897 }
1898 else
1899 {
1900 int shift;
1901 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1902 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1903 /* A long long does not fit in a LONGEST. */
1904 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1905 else
1906 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1907 high_bit = (ULONGEST) 1 << shift;
1908 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1909 signed_type = parse_type (par_state)->builtin_long_long;
1910 }
1911
1912 putithere->typed_val_int.val = n;
1913
1914 /* If the high bit of the worked out type is set then this number
1915 has to be unsigned. */
1916
1917 if (unsigned_p || (n & high_bit))
1918 {
1919 putithere->typed_val_int.type = unsigned_type;
1920 }
1921 else
1922 {
1923 putithere->typed_val_int.type = signed_type;
1924 }
1925
1926 return INT;
1927 }
1928
1929 /* Temporary obstack used for holding strings. */
1930 static struct obstack tempbuf;
1931 static int tempbuf_init;
1932
1933 /* Parse a C escape sequence. The initial backslash of the sequence
1934 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1935 last character of the sequence. If OUTPUT is not NULL, the
1936 translated form of the escape sequence will be written there. If
1937 OUTPUT is NULL, no output is written and the call will only affect
1938 *PTR. If an escape sequence is expressed in target bytes, then the
1939 entire sequence will simply be copied to OUTPUT. Return 1 if any
1940 character was emitted, 0 otherwise. */
1941
1942 int
1943 c_parse_escape (const char **ptr, struct obstack *output)
1944 {
1945 const char *tokptr = *ptr;
1946 int result = 1;
1947
1948 /* Some escape sequences undergo character set conversion. Those we
1949 translate here. */
1950 switch (*tokptr)
1951 {
1952 /* Hex escapes do not undergo character set conversion, so keep
1953 the escape sequence for later. */
1954 case 'x':
1955 if (output)
1956 obstack_grow_str (output, "\\x");
1957 ++tokptr;
1958 if (!isxdigit (*tokptr))
1959 error (_("\\x escape without a following hex digit"));
1960 while (isxdigit (*tokptr))
1961 {
1962 if (output)
1963 obstack_1grow (output, *tokptr);
1964 ++tokptr;
1965 }
1966 break;
1967
1968 /* Octal escapes do not undergo character set conversion, so
1969 keep the escape sequence for later. */
1970 case '0':
1971 case '1':
1972 case '2':
1973 case '3':
1974 case '4':
1975 case '5':
1976 case '6':
1977 case '7':
1978 {
1979 int i;
1980 if (output)
1981 obstack_grow_str (output, "\\");
1982 for (i = 0;
1983 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
1984 ++i)
1985 {
1986 if (output)
1987 obstack_1grow (output, *tokptr);
1988 ++tokptr;
1989 }
1990 }
1991 break;
1992
1993 /* We handle UCNs later. We could handle them here, but that
1994 would mean a spurious error in the case where the UCN could
1995 be converted to the target charset but not the host
1996 charset. */
1997 case 'u':
1998 case 'U':
1999 {
2000 char c = *tokptr;
2001 int i, len = c == 'U' ? 8 : 4;
2002 if (output)
2003 {
2004 obstack_1grow (output, '\\');
2005 obstack_1grow (output, *tokptr);
2006 }
2007 ++tokptr;
2008 if (!isxdigit (*tokptr))
2009 error (_("\\%c escape without a following hex digit"), c);
2010 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2011 {
2012 if (output)
2013 obstack_1grow (output, *tokptr);
2014 ++tokptr;
2015 }
2016 }
2017 break;
2018
2019 /* We must pass backslash through so that it does not
2020 cause quoting during the second expansion. */
2021 case '\\':
2022 if (output)
2023 obstack_grow_str (output, "\\\\");
2024 ++tokptr;
2025 break;
2026
2027 /* Escapes which undergo conversion. */
2028 case 'a':
2029 if (output)
2030 obstack_1grow (output, '\a');
2031 ++tokptr;
2032 break;
2033 case 'b':
2034 if (output)
2035 obstack_1grow (output, '\b');
2036 ++tokptr;
2037 break;
2038 case 'f':
2039 if (output)
2040 obstack_1grow (output, '\f');
2041 ++tokptr;
2042 break;
2043 case 'n':
2044 if (output)
2045 obstack_1grow (output, '\n');
2046 ++tokptr;
2047 break;
2048 case 'r':
2049 if (output)
2050 obstack_1grow (output, '\r');
2051 ++tokptr;
2052 break;
2053 case 't':
2054 if (output)
2055 obstack_1grow (output, '\t');
2056 ++tokptr;
2057 break;
2058 case 'v':
2059 if (output)
2060 obstack_1grow (output, '\v');
2061 ++tokptr;
2062 break;
2063
2064 /* GCC extension. */
2065 case 'e':
2066 if (output)
2067 obstack_1grow (output, HOST_ESCAPE_CHAR);
2068 ++tokptr;
2069 break;
2070
2071 /* Backslash-newline expands to nothing at all. */
2072 case '\n':
2073 ++tokptr;
2074 result = 0;
2075 break;
2076
2077 /* A few escapes just expand to the character itself. */
2078 case '\'':
2079 case '\"':
2080 case '?':
2081 /* GCC extensions. */
2082 case '(':
2083 case '{':
2084 case '[':
2085 case '%':
2086 /* Unrecognized escapes turn into the character itself. */
2087 default:
2088 if (output)
2089 obstack_1grow (output, *tokptr);
2090 ++tokptr;
2091 break;
2092 }
2093 *ptr = tokptr;
2094 return result;
2095 }
2096
2097 /* Parse a string or character literal from TOKPTR. The string or
2098 character may be wide or unicode. *OUTPTR is set to just after the
2099 end of the literal in the input string. The resulting token is
2100 stored in VALUE. This returns a token value, either STRING or
2101 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2102 number of host characters in the literal. */
2103
2104 static int
2105 parse_string_or_char (const char *tokptr, const char **outptr,
2106 struct typed_stoken *value, int *host_chars)
2107 {
2108 int quote;
2109 c_string_type type;
2110 int is_objc = 0;
2111
2112 /* Build the gdb internal form of the input string in tempbuf. Note
2113 that the buffer is null byte terminated *only* for the
2114 convenience of debugging gdb itself and printing the buffer
2115 contents when the buffer contains no embedded nulls. Gdb does
2116 not depend upon the buffer being null byte terminated, it uses
2117 the length string instead. This allows gdb to handle C strings
2118 (as well as strings in other languages) with embedded null
2119 bytes */
2120
2121 if (!tempbuf_init)
2122 tempbuf_init = 1;
2123 else
2124 obstack_free (&tempbuf, NULL);
2125 obstack_init (&tempbuf);
2126
2127 /* Record the string type. */
2128 if (*tokptr == 'L')
2129 {
2130 type = C_WIDE_STRING;
2131 ++tokptr;
2132 }
2133 else if (*tokptr == 'u')
2134 {
2135 type = C_STRING_16;
2136 ++tokptr;
2137 }
2138 else if (*tokptr == 'U')
2139 {
2140 type = C_STRING_32;
2141 ++tokptr;
2142 }
2143 else if (*tokptr == '@')
2144 {
2145 /* An Objective C string. */
2146 is_objc = 1;
2147 type = C_STRING;
2148 ++tokptr;
2149 }
2150 else
2151 type = C_STRING;
2152
2153 /* Skip the quote. */
2154 quote = *tokptr;
2155 if (quote == '\'')
2156 type |= C_CHAR;
2157 ++tokptr;
2158
2159 *host_chars = 0;
2160
2161 while (*tokptr)
2162 {
2163 char c = *tokptr;
2164 if (c == '\\')
2165 {
2166 ++tokptr;
2167 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2168 }
2169 else if (c == quote)
2170 break;
2171 else
2172 {
2173 obstack_1grow (&tempbuf, c);
2174 ++tokptr;
2175 /* FIXME: this does the wrong thing with multi-byte host
2176 characters. We could use mbrlen here, but that would
2177 make "set host-charset" a bit less useful. */
2178 ++*host_chars;
2179 }
2180 }
2181
2182 if (*tokptr != quote)
2183 {
2184 if (quote == '"')
2185 error (_("Unterminated string in expression."));
2186 else
2187 error (_("Unmatched single quote."));
2188 }
2189 ++tokptr;
2190
2191 value->type = type;
2192 value->ptr = (char *) obstack_base (&tempbuf);
2193 value->length = obstack_object_size (&tempbuf);
2194
2195 *outptr = tokptr;
2196
2197 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2198 }
2199
2200 /* This is used to associate some attributes with a token. */
2201
2202 enum token_flag
2203 {
2204 /* If this bit is set, the token is C++-only. */
2205
2206 FLAG_CXX = 1,
2207
2208 /* If this bit is set, the token is conditional: if there is a
2209 symbol of the same name, then the token is a symbol; otherwise,
2210 the token is a keyword. */
2211
2212 FLAG_SHADOW = 2
2213 };
2214 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2215
2216 struct token
2217 {
2218 char *oper;
2219 int token;
2220 enum exp_opcode opcode;
2221 token_flags flags;
2222 };
2223
2224 static const struct token tokentab3[] =
2225 {
2226 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2227 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2228 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2229 {"...", DOTDOTDOT, BINOP_END, 0}
2230 };
2231
2232 static const struct token tokentab2[] =
2233 {
2234 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2235 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2236 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2237 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2238 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2239 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2240 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2241 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2242 {"++", INCREMENT, BINOP_END, 0},
2243 {"--", DECREMENT, BINOP_END, 0},
2244 {"->", ARROW, BINOP_END, 0},
2245 {"&&", ANDAND, BINOP_END, 0},
2246 {"||", OROR, BINOP_END, 0},
2247 /* "::" is *not* only C++: gdb overrides its meaning in several
2248 different ways, e.g., 'filename'::func, function::variable. */
2249 {"::", COLONCOLON, BINOP_END, 0},
2250 {"<<", LSH, BINOP_END, 0},
2251 {">>", RSH, BINOP_END, 0},
2252 {"==", EQUAL, BINOP_END, 0},
2253 {"!=", NOTEQUAL, BINOP_END, 0},
2254 {"<=", LEQ, BINOP_END, 0},
2255 {">=", GEQ, BINOP_END, 0},
2256 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2257 };
2258
2259 /* Identifier-like tokens. */
2260 static const struct token ident_tokens[] =
2261 {
2262 {"unsigned", UNSIGNED, OP_NULL, 0},
2263 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2264 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2265 {"struct", STRUCT, OP_NULL, 0},
2266 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2267 {"sizeof", SIZEOF, OP_NULL, 0},
2268 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2269 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2270 {"class", CLASS, OP_NULL, FLAG_CXX},
2271 {"union", UNION, OP_NULL, 0},
2272 {"short", SHORT, OP_NULL, 0},
2273 {"const", CONST_KEYWORD, OP_NULL, 0},
2274 {"enum", ENUM, OP_NULL, 0},
2275 {"long", LONG, OP_NULL, 0},
2276 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2277 {"int", INT_KEYWORD, OP_NULL, 0},
2278 {"new", NEW, OP_NULL, FLAG_CXX},
2279 {"delete", DELETE, OP_NULL, FLAG_CXX},
2280 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2281
2282 {"and", ANDAND, BINOP_END, FLAG_CXX},
2283 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2284 {"bitand", '&', OP_NULL, FLAG_CXX},
2285 {"bitor", '|', OP_NULL, FLAG_CXX},
2286 {"compl", '~', OP_NULL, FLAG_CXX},
2287 {"not", '!', OP_NULL, FLAG_CXX},
2288 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2289 {"or", OROR, BINOP_END, FLAG_CXX},
2290 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2291 {"xor", '^', OP_NULL, FLAG_CXX},
2292 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2293
2294 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2295 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2296 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2297 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2298
2299 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2300 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2301 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2302 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2303 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2304
2305 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2306 };
2307
2308 /* When we find that lexptr (the global var defined in parse.c) is
2309 pointing at a macro invocation, we expand the invocation, and call
2310 scan_macro_expansion to save the old lexptr here and point lexptr
2311 into the expanded text. When we reach the end of that, we call
2312 end_macro_expansion to pop back to the value we saved here. The
2313 macro expansion code promises to return only fully-expanded text,
2314 so we don't need to "push" more than one level.
2315
2316 This is disgusting, of course. It would be cleaner to do all macro
2317 expansion beforehand, and then hand that to lexptr. But we don't
2318 really know where the expression ends. Remember, in a command like
2319
2320 (gdb) break *ADDRESS if CONDITION
2321
2322 we evaluate ADDRESS in the scope of the current frame, but we
2323 evaluate CONDITION in the scope of the breakpoint's location. So
2324 it's simply wrong to try to macro-expand the whole thing at once. */
2325 static const char *macro_original_text;
2326
2327 /* We save all intermediate macro expansions on this obstack for the
2328 duration of a single parse. The expansion text may sometimes have
2329 to live past the end of the expansion, due to yacc lookahead.
2330 Rather than try to be clever about saving the data for a single
2331 token, we simply keep it all and delete it after parsing has
2332 completed. */
2333 static struct obstack expansion_obstack;
2334
2335 static void
2336 scan_macro_expansion (char *expansion)
2337 {
2338 char *copy;
2339
2340 /* We'd better not be trying to push the stack twice. */
2341 gdb_assert (! macro_original_text);
2342
2343 /* Copy to the obstack, and then free the intermediate
2344 expansion. */
2345 copy = (char *) obstack_copy0 (&expansion_obstack, expansion,
2346 strlen (expansion));
2347 xfree (expansion);
2348
2349 /* Save the old lexptr value, so we can return to it when we're done
2350 parsing the expanded text. */
2351 macro_original_text = lexptr;
2352 lexptr = copy;
2353 }
2354
2355 static int
2356 scanning_macro_expansion (void)
2357 {
2358 return macro_original_text != 0;
2359 }
2360
2361 static void
2362 finished_macro_expansion (void)
2363 {
2364 /* There'd better be something to pop back to. */
2365 gdb_assert (macro_original_text);
2366
2367 /* Pop back to the original text. */
2368 lexptr = macro_original_text;
2369 macro_original_text = 0;
2370 }
2371
2372 static void
2373 scan_macro_cleanup (void *dummy)
2374 {
2375 if (macro_original_text)
2376 finished_macro_expansion ();
2377
2378 obstack_free (&expansion_obstack, NULL);
2379 }
2380
2381 /* Return true iff the token represents a C++ cast operator. */
2382
2383 static int
2384 is_cast_operator (const char *token, int len)
2385 {
2386 return (! strncmp (token, "dynamic_cast", len)
2387 || ! strncmp (token, "static_cast", len)
2388 || ! strncmp (token, "reinterpret_cast", len)
2389 || ! strncmp (token, "const_cast", len));
2390 }
2391
2392 /* The scope used for macro expansion. */
2393 static struct macro_scope *expression_macro_scope;
2394
2395 /* This is set if a NAME token appeared at the very end of the input
2396 string, with no whitespace separating the name from the EOF. This
2397 is used only when parsing to do field name completion. */
2398 static int saw_name_at_eof;
2399
2400 /* This is set if the previously-returned token was a structure
2401 operator -- either '.' or ARROW. This is used only when parsing to
2402 do field name completion. */
2403 static int last_was_structop;
2404
2405 /* Read one token, getting characters through lexptr. */
2406
2407 static int
2408 lex_one_token (struct parser_state *par_state, int *is_quoted_name)
2409 {
2410 int c;
2411 int namelen;
2412 unsigned int i;
2413 const char *tokstart;
2414 int saw_structop = last_was_structop;
2415 char *copy;
2416
2417 last_was_structop = 0;
2418 *is_quoted_name = 0;
2419
2420 retry:
2421
2422 /* Check if this is a macro invocation that we need to expand. */
2423 if (! scanning_macro_expansion ())
2424 {
2425 char *expanded = macro_expand_next (&lexptr,
2426 standard_macro_lookup,
2427 expression_macro_scope);
2428
2429 if (expanded)
2430 scan_macro_expansion (expanded);
2431 }
2432
2433 prev_lexptr = lexptr;
2434
2435 tokstart = lexptr;
2436 /* See if it is a special token of length 3. */
2437 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2438 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2439 {
2440 if ((tokentab3[i].flags & FLAG_CXX) != 0
2441 && parse_language (par_state)->la_language != language_cplus)
2442 break;
2443
2444 lexptr += 3;
2445 yylval.opcode = tokentab3[i].opcode;
2446 return tokentab3[i].token;
2447 }
2448
2449 /* See if it is a special token of length 2. */
2450 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2451 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2452 {
2453 if ((tokentab2[i].flags & FLAG_CXX) != 0
2454 && parse_language (par_state)->la_language != language_cplus)
2455 break;
2456
2457 lexptr += 2;
2458 yylval.opcode = tokentab2[i].opcode;
2459 if (parse_completion && tokentab2[i].token == ARROW)
2460 last_was_structop = 1;
2461 return tokentab2[i].token;
2462 }
2463
2464 switch (c = *tokstart)
2465 {
2466 case 0:
2467 /* If we were just scanning the result of a macro expansion,
2468 then we need to resume scanning the original text.
2469 If we're parsing for field name completion, and the previous
2470 token allows such completion, return a COMPLETE token.
2471 Otherwise, we were already scanning the original text, and
2472 we're really done. */
2473 if (scanning_macro_expansion ())
2474 {
2475 finished_macro_expansion ();
2476 goto retry;
2477 }
2478 else if (saw_name_at_eof)
2479 {
2480 saw_name_at_eof = 0;
2481 return COMPLETE;
2482 }
2483 else if (saw_structop)
2484 return COMPLETE;
2485 else
2486 return 0;
2487
2488 case ' ':
2489 case '\t':
2490 case '\n':
2491 lexptr++;
2492 goto retry;
2493
2494 case '[':
2495 case '(':
2496 paren_depth++;
2497 lexptr++;
2498 if (parse_language (par_state)->la_language == language_objc
2499 && c == '[')
2500 return OBJC_LBRAC;
2501 return c;
2502
2503 case ']':
2504 case ')':
2505 if (paren_depth == 0)
2506 return 0;
2507 paren_depth--;
2508 lexptr++;
2509 return c;
2510
2511 case ',':
2512 if (comma_terminates
2513 && paren_depth == 0
2514 && ! scanning_macro_expansion ())
2515 return 0;
2516 lexptr++;
2517 return c;
2518
2519 case '.':
2520 /* Might be a floating point number. */
2521 if (lexptr[1] < '0' || lexptr[1] > '9')
2522 {
2523 if (parse_completion)
2524 last_was_structop = 1;
2525 goto symbol; /* Nope, must be a symbol. */
2526 }
2527 /* FALL THRU into number case. */
2528
2529 case '0':
2530 case '1':
2531 case '2':
2532 case '3':
2533 case '4':
2534 case '5':
2535 case '6':
2536 case '7':
2537 case '8':
2538 case '9':
2539 {
2540 /* It's a number. */
2541 int got_dot = 0, got_e = 0, toktype;
2542 const char *p = tokstart;
2543 int hex = input_radix > 10;
2544
2545 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2546 {
2547 p += 2;
2548 hex = 1;
2549 }
2550 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2551 {
2552 p += 2;
2553 hex = 0;
2554 }
2555
2556 for (;; ++p)
2557 {
2558 /* This test includes !hex because 'e' is a valid hex digit
2559 and thus does not indicate a floating point number when
2560 the radix is hex. */
2561 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2562 got_dot = got_e = 1;
2563 /* This test does not include !hex, because a '.' always indicates
2564 a decimal floating point number regardless of the radix. */
2565 else if (!got_dot && *p == '.')
2566 got_dot = 1;
2567 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2568 && (*p == '-' || *p == '+'))
2569 /* This is the sign of the exponent, not the end of the
2570 number. */
2571 continue;
2572 /* We will take any letters or digits. parse_number will
2573 complain if past the radix, or if L or U are not final. */
2574 else if ((*p < '0' || *p > '9')
2575 && ((*p < 'a' || *p > 'z')
2576 && (*p < 'A' || *p > 'Z')))
2577 break;
2578 }
2579 toktype = parse_number (par_state, tokstart, p - tokstart,
2580 got_dot|got_e, &yylval);
2581 if (toktype == ERROR)
2582 {
2583 char *err_copy = (char *) alloca (p - tokstart + 1);
2584
2585 memcpy (err_copy, tokstart, p - tokstart);
2586 err_copy[p - tokstart] = 0;
2587 error (_("Invalid number \"%s\"."), err_copy);
2588 }
2589 lexptr = p;
2590 return toktype;
2591 }
2592
2593 case '@':
2594 {
2595 const char *p = &tokstart[1];
2596 size_t len = strlen ("entry");
2597
2598 if (parse_language (par_state)->la_language == language_objc)
2599 {
2600 size_t len = strlen ("selector");
2601
2602 if (strncmp (p, "selector", len) == 0
2603 && (p[len] == '\0' || isspace (p[len])))
2604 {
2605 lexptr = p + len;
2606 return SELECTOR;
2607 }
2608 else if (*p == '"')
2609 goto parse_string;
2610 }
2611
2612 while (isspace (*p))
2613 p++;
2614 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2615 && p[len] != '_')
2616 {
2617 lexptr = &p[len];
2618 return ENTRY;
2619 }
2620 }
2621 /* FALLTHRU */
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 case '{':
2638 case '}':
2639 symbol:
2640 lexptr++;
2641 return c;
2642
2643 case 'L':
2644 case 'u':
2645 case 'U':
2646 if (tokstart[1] != '"' && tokstart[1] != '\'')
2647 break;
2648 /* Fall through. */
2649 case '\'':
2650 case '"':
2651
2652 parse_string:
2653 {
2654 int host_len;
2655 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2656 &host_len);
2657 if (result == CHAR)
2658 {
2659 if (host_len == 0)
2660 error (_("Empty character constant."));
2661 else if (host_len > 2 && c == '\'')
2662 {
2663 ++tokstart;
2664 namelen = lexptr - tokstart - 1;
2665 *is_quoted_name = 1;
2666
2667 goto tryname;
2668 }
2669 else if (host_len > 1)
2670 error (_("Invalid character constant."));
2671 }
2672 return result;
2673 }
2674 }
2675
2676 if (!(c == '_' || c == '$'
2677 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2678 /* We must have come across a bad character (e.g. ';'). */
2679 error (_("Invalid character '%c' in expression."), c);
2680
2681 /* It's a name. See how long it is. */
2682 namelen = 0;
2683 for (c = tokstart[namelen];
2684 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2685 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2686 {
2687 /* Template parameter lists are part of the name.
2688 FIXME: This mishandles `print $a<4&&$a>3'. */
2689
2690 if (c == '<')
2691 {
2692 if (! is_cast_operator (tokstart, namelen))
2693 {
2694 /* Scan ahead to get rest of the template specification. Note
2695 that we look ahead only when the '<' adjoins non-whitespace
2696 characters; for comparison expressions, e.g. "a < b > c",
2697 there must be spaces before the '<', etc. */
2698 const char *p = find_template_name_end (tokstart + namelen);
2699
2700 if (p)
2701 namelen = p - tokstart;
2702 }
2703 break;
2704 }
2705 c = tokstart[++namelen];
2706 }
2707
2708 /* The token "if" terminates the expression and is NOT removed from
2709 the input stream. It doesn't count if it appears in the
2710 expansion of a macro. */
2711 if (namelen == 2
2712 && tokstart[0] == 'i'
2713 && tokstart[1] == 'f'
2714 && ! scanning_macro_expansion ())
2715 {
2716 return 0;
2717 }
2718
2719 /* For the same reason (breakpoint conditions), "thread N"
2720 terminates the expression. "thread" could be an identifier, but
2721 an identifier is never followed by a number without intervening
2722 punctuation. "task" is similar. Handle abbreviations of these,
2723 similarly to breakpoint.c:find_condition_and_thread. */
2724 if (namelen >= 1
2725 && (strncmp (tokstart, "thread", namelen) == 0
2726 || strncmp (tokstart, "task", namelen) == 0)
2727 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2728 && ! scanning_macro_expansion ())
2729 {
2730 const char *p = tokstart + namelen + 1;
2731
2732 while (*p == ' ' || *p == '\t')
2733 p++;
2734 if (*p >= '0' && *p <= '9')
2735 return 0;
2736 }
2737
2738 lexptr += namelen;
2739
2740 tryname:
2741
2742 yylval.sval.ptr = tokstart;
2743 yylval.sval.length = namelen;
2744
2745 /* Catch specific keywords. */
2746 copy = copy_name (yylval.sval);
2747 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2748 if (strcmp (copy, ident_tokens[i].oper) == 0)
2749 {
2750 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2751 && parse_language (par_state)->la_language != language_cplus)
2752 break;
2753
2754 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2755 {
2756 struct field_of_this_result is_a_field_of_this;
2757
2758 if (lookup_symbol (copy, expression_context_block,
2759 VAR_DOMAIN,
2760 (parse_language (par_state)->la_language
2761 == language_cplus ? &is_a_field_of_this
2762 : NULL)).symbol
2763 != NULL)
2764 {
2765 /* The keyword is shadowed. */
2766 break;
2767 }
2768 }
2769
2770 /* It is ok to always set this, even though we don't always
2771 strictly need to. */
2772 yylval.opcode = ident_tokens[i].opcode;
2773 return ident_tokens[i].token;
2774 }
2775
2776 if (*tokstart == '$')
2777 return VARIABLE;
2778
2779 if (parse_completion && *lexptr == '\0')
2780 saw_name_at_eof = 1;
2781
2782 yylval.ssym.stoken = yylval.sval;
2783 yylval.ssym.sym.symbol = NULL;
2784 yylval.ssym.sym.block = NULL;
2785 yylval.ssym.is_a_field_of_this = 0;
2786 return NAME;
2787 }
2788
2789 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2790 typedef struct
2791 {
2792 int token;
2793 YYSTYPE value;
2794 } token_and_value;
2795
2796 DEF_VEC_O (token_and_value);
2797
2798 /* A FIFO of tokens that have been read but not yet returned to the
2799 parser. */
2800 static VEC (token_and_value) *token_fifo;
2801
2802 /* Non-zero if the lexer should return tokens from the FIFO. */
2803 static int popping;
2804
2805 /* Temporary storage for c_lex; this holds symbol names as they are
2806 built up. */
2807 static struct obstack name_obstack;
2808
2809 /* Classify a NAME token. The contents of the token are in `yylval'.
2810 Updates yylval and returns the new token type. BLOCK is the block
2811 in which lookups start; this can be NULL to mean the global scope.
2812 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2813 in single quotes. */
2814
2815 static int
2816 classify_name (struct parser_state *par_state, const struct block *block,
2817 int is_quoted_name)
2818 {
2819 struct block_symbol bsym;
2820 char *copy;
2821 struct field_of_this_result is_a_field_of_this;
2822
2823 copy = copy_name (yylval.sval);
2824
2825 /* Initialize this in case we *don't* use it in this call; that way
2826 we can refer to it unconditionally below. */
2827 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2828
2829 bsym = lookup_symbol (copy, block, VAR_DOMAIN,
2830 parse_language (par_state)->la_name_of_this
2831 ? &is_a_field_of_this : NULL);
2832
2833 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2834 {
2835 yylval.ssym.sym = bsym;
2836 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2837 return BLOCKNAME;
2838 }
2839 else if (!bsym.symbol)
2840 {
2841 /* If we found a field of 'this', we might have erroneously
2842 found a constructor where we wanted a type name. Handle this
2843 case by noticing that we found a constructor and then look up
2844 the type tag instead. */
2845 if (is_a_field_of_this.type != NULL
2846 && is_a_field_of_this.fn_field != NULL
2847 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2848 0))
2849 {
2850 struct field_of_this_result inner_is_a_field_of_this;
2851
2852 bsym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2853 &inner_is_a_field_of_this);
2854 if (bsym.symbol != NULL)
2855 {
2856 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2857 return TYPENAME;
2858 }
2859 }
2860
2861 /* If we found a field, then we want to prefer it over a
2862 filename. However, if the name was quoted, then it is better
2863 to check for a filename or a block, since this is the only
2864 way the user has of requiring the extension to be used. */
2865 if (is_a_field_of_this.type == NULL || is_quoted_name)
2866 {
2867 /* See if it's a file name. */
2868 struct symtab *symtab;
2869
2870 symtab = lookup_symtab (copy);
2871 if (symtab)
2872 {
2873 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
2874 STATIC_BLOCK);
2875 return FILENAME;
2876 }
2877 }
2878 }
2879
2880 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
2881 {
2882 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2883 return TYPENAME;
2884 }
2885
2886 /* See if it's an ObjC classname. */
2887 if (parse_language (par_state)->la_language == language_objc && !bsym.symbol)
2888 {
2889 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2890 if (Class)
2891 {
2892 struct symbol *sym;
2893
2894 yylval.theclass.theclass = Class;
2895 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2896 if (sym)
2897 yylval.theclass.type = SYMBOL_TYPE (sym);
2898 return CLASSNAME;
2899 }
2900 }
2901
2902 /* Input names that aren't symbols but ARE valid hex numbers, when
2903 the input radix permits them, can be names or numbers depending
2904 on the parse. Note we support radixes > 16 here. */
2905 if (!bsym.symbol
2906 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2907 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2908 {
2909 YYSTYPE newlval; /* Its value is ignored. */
2910 int hextype = parse_number (par_state, copy, yylval.sval.length,
2911 0, &newlval);
2912
2913 if (hextype == INT)
2914 {
2915 yylval.ssym.sym = bsym;
2916 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2917 return NAME_OR_INT;
2918 }
2919 }
2920
2921 /* Any other kind of symbol */
2922 yylval.ssym.sym = bsym;
2923 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2924
2925 if (bsym.symbol == NULL
2926 && parse_language (par_state)->la_language == language_cplus
2927 && is_a_field_of_this.type == NULL
2928 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
2929 return UNKNOWN_CPP_NAME;
2930
2931 return NAME;
2932 }
2933
2934 /* Like classify_name, but used by the inner loop of the lexer, when a
2935 name might have already been seen. CONTEXT is the context type, or
2936 NULL if this is the first component of a name. */
2937
2938 static int
2939 classify_inner_name (struct parser_state *par_state,
2940 const struct block *block, struct type *context)
2941 {
2942 struct type *type;
2943 char *copy;
2944
2945 if (context == NULL)
2946 return classify_name (par_state, block, 0);
2947
2948 type = check_typedef (context);
2949 if (!type_aggregate_p (type))
2950 return ERROR;
2951
2952 copy = copy_name (yylval.ssym.stoken);
2953 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
2954 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN);
2955
2956 /* If no symbol was found, search for a matching base class named
2957 COPY. This will allow users to enter qualified names of class members
2958 relative to the `this' pointer. */
2959 if (yylval.ssym.sym.symbol == NULL)
2960 {
2961 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
2962
2963 if (base_type != NULL)
2964 {
2965 yylval.tsym.type = base_type;
2966 return TYPENAME;
2967 }
2968
2969 return ERROR;
2970 }
2971
2972 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
2973 {
2974 case LOC_BLOCK:
2975 case LOC_LABEL:
2976 /* cp_lookup_nested_symbol might have accidentally found a constructor
2977 named COPY when we really wanted a base class of the same name.
2978 Double-check this case by looking for a base class. */
2979 {
2980 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
2981
2982 if (base_type != NULL)
2983 {
2984 yylval.tsym.type = base_type;
2985 return TYPENAME;
2986 }
2987 }
2988 return ERROR;
2989
2990 case LOC_TYPEDEF:
2991 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
2992 return TYPENAME;
2993
2994 default:
2995 return NAME;
2996 }
2997 internal_error (__FILE__, __LINE__, _("not reached"));
2998 }
2999
3000 /* The outer level of a two-level lexer. This calls the inner lexer
3001 to return tokens. It then either returns these tokens, or
3002 aggregates them into a larger token. This lets us work around a
3003 problem in our parsing approach, where the parser could not
3004 distinguish between qualified names and qualified types at the
3005 right point.
3006
3007 This approach is still not ideal, because it mishandles template
3008 types. See the comment in lex_one_token for an example. However,
3009 this is still an improvement over the earlier approach, and will
3010 suffice until we move to better parsing technology. */
3011
3012 static int
3013 yylex (void)
3014 {
3015 token_and_value current;
3016 int first_was_coloncolon, last_was_coloncolon;
3017 struct type *context_type = NULL;
3018 int last_to_examine, next_to_examine, checkpoint;
3019 const struct block *search_block;
3020 int is_quoted_name;
3021
3022 if (popping && !VEC_empty (token_and_value, token_fifo))
3023 goto do_pop;
3024 popping = 0;
3025
3026 /* Read the first token and decide what to do. Most of the
3027 subsequent code is C++-only; but also depends on seeing a "::" or
3028 name-like token. */
3029 current.token = lex_one_token (pstate, &is_quoted_name);
3030 if (current.token == NAME)
3031 current.token = classify_name (pstate, expression_context_block,
3032 is_quoted_name);
3033 if (parse_language (pstate)->la_language != language_cplus
3034 || (current.token != TYPENAME && current.token != COLONCOLON
3035 && current.token != FILENAME))
3036 return current.token;
3037
3038 /* Read any sequence of alternating "::" and name-like tokens into
3039 the token FIFO. */
3040 current.value = yylval;
3041 VEC_safe_push (token_and_value, token_fifo, &current);
3042 last_was_coloncolon = current.token == COLONCOLON;
3043 while (1)
3044 {
3045 int ignore;
3046
3047 /* We ignore quoted names other than the very first one.
3048 Subsequent ones do not have any special meaning. */
3049 current.token = lex_one_token (pstate, &ignore);
3050 current.value = yylval;
3051 VEC_safe_push (token_and_value, token_fifo, &current);
3052
3053 if ((last_was_coloncolon && current.token != NAME)
3054 || (!last_was_coloncolon && current.token != COLONCOLON))
3055 break;
3056 last_was_coloncolon = !last_was_coloncolon;
3057 }
3058 popping = 1;
3059
3060 /* We always read one extra token, so compute the number of tokens
3061 to examine accordingly. */
3062 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3063 next_to_examine = 0;
3064
3065 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3066 ++next_to_examine;
3067
3068 obstack_free (&name_obstack, obstack_base (&name_obstack));
3069 checkpoint = 0;
3070 if (current.token == FILENAME)
3071 search_block = current.value.bval;
3072 else if (current.token == COLONCOLON)
3073 search_block = NULL;
3074 else
3075 {
3076 gdb_assert (current.token == TYPENAME);
3077 search_block = expression_context_block;
3078 obstack_grow (&name_obstack, current.value.sval.ptr,
3079 current.value.sval.length);
3080 context_type = current.value.tsym.type;
3081 checkpoint = 1;
3082 }
3083
3084 first_was_coloncolon = current.token == COLONCOLON;
3085 last_was_coloncolon = first_was_coloncolon;
3086
3087 while (next_to_examine <= last_to_examine)
3088 {
3089 token_and_value *next;
3090
3091 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3092 ++next_to_examine;
3093
3094 if (next->token == NAME && last_was_coloncolon)
3095 {
3096 int classification;
3097
3098 yylval = next->value;
3099 classification = classify_inner_name (pstate, search_block,
3100 context_type);
3101 /* We keep going until we either run out of names, or until
3102 we have a qualified name which is not a type. */
3103 if (classification != TYPENAME && classification != NAME)
3104 break;
3105
3106 /* Accept up to this token. */
3107 checkpoint = next_to_examine;
3108
3109 /* Update the partial name we are constructing. */
3110 if (context_type != NULL)
3111 {
3112 /* We don't want to put a leading "::" into the name. */
3113 obstack_grow_str (&name_obstack, "::");
3114 }
3115 obstack_grow (&name_obstack, next->value.sval.ptr,
3116 next->value.sval.length);
3117
3118 yylval.sval.ptr = (const char *) obstack_base (&name_obstack);
3119 yylval.sval.length = obstack_object_size (&name_obstack);
3120 current.value = yylval;
3121 current.token = classification;
3122
3123 last_was_coloncolon = 0;
3124
3125 if (classification == NAME)
3126 break;
3127
3128 context_type = yylval.tsym.type;
3129 }
3130 else if (next->token == COLONCOLON && !last_was_coloncolon)
3131 last_was_coloncolon = 1;
3132 else
3133 {
3134 /* We've reached the end of the name. */
3135 break;
3136 }
3137 }
3138
3139 /* If we have a replacement token, install it as the first token in
3140 the FIFO, and delete the other constituent tokens. */
3141 if (checkpoint > 0)
3142 {
3143 current.value.sval.ptr
3144 = (const char *) obstack_copy0 (&expansion_obstack,
3145 current.value.sval.ptr,
3146 current.value.sval.length);
3147
3148 VEC_replace (token_and_value, token_fifo, 0, &current);
3149 if (checkpoint > 1)
3150 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3151 }
3152
3153 do_pop:
3154 current = *VEC_index (token_and_value, token_fifo, 0);
3155 VEC_ordered_remove (token_and_value, token_fifo, 0);
3156 yylval = current.value;
3157 return current.token;
3158 }
3159
3160 int
3161 c_parse (struct parser_state *par_state)
3162 {
3163 int result;
3164 struct cleanup *back_to;
3165
3166 /* Setting up the parser state. */
3167 gdb_assert (par_state != NULL);
3168 pstate = par_state;
3169
3170 back_to = make_cleanup (free_current_contents, &expression_macro_scope);
3171 make_cleanup_clear_parser_state (&pstate);
3172
3173 /* Set up the scope for macro expansion. */
3174 expression_macro_scope = NULL;
3175
3176 if (expression_context_block)
3177 expression_macro_scope
3178 = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3179 else
3180 expression_macro_scope = default_macro_scope ();
3181 if (! expression_macro_scope)
3182 expression_macro_scope = user_macro_scope ();
3183
3184 /* Initialize macro expansion code. */
3185 obstack_init (&expansion_obstack);
3186 gdb_assert (! macro_original_text);
3187 make_cleanup (scan_macro_cleanup, 0);
3188
3189 make_cleanup_restore_integer (&yydebug);
3190 yydebug = parser_debug;
3191
3192 /* Initialize some state used by the lexer. */
3193 last_was_structop = 0;
3194 saw_name_at_eof = 0;
3195
3196 VEC_free (token_and_value, token_fifo);
3197 popping = 0;
3198 obstack_init (&name_obstack);
3199 make_cleanup_obstack_free (&name_obstack);
3200
3201 result = yyparse ();
3202 do_cleanups (back_to);
3203
3204 return result;
3205 }
3206
3207 #ifdef YYBISON
3208
3209 /* This is called via the YYPRINT macro when parser debugging is
3210 enabled. It prints a token's value. */
3211
3212 static void
3213 c_print_token (FILE *file, int type, YYSTYPE value)
3214 {
3215 switch (type)
3216 {
3217 case INT:
3218 fprintf (file, "typed_val_int<%s, %s>",
3219 TYPE_SAFE_NAME (value.typed_val_int.type),
3220 pulongest (value.typed_val_int.val));
3221 break;
3222
3223 case CHAR:
3224 case STRING:
3225 {
3226 char *copy = (char *) alloca (value.tsval.length + 1);
3227
3228 memcpy (copy, value.tsval.ptr, value.tsval.length);
3229 copy[value.tsval.length] = '\0';
3230
3231 fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3232 }
3233 break;
3234
3235 case NSSTRING:
3236 case VARIABLE:
3237 fprintf (file, "sval<%s>", copy_name (value.sval));
3238 break;
3239
3240 case TYPENAME:
3241 fprintf (file, "tsym<type=%s, name=%s>",
3242 TYPE_SAFE_NAME (value.tsym.type),
3243 copy_name (value.tsym.stoken));
3244 break;
3245
3246 case NAME:
3247 case UNKNOWN_CPP_NAME:
3248 case NAME_OR_INT:
3249 case BLOCKNAME:
3250 fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3251 copy_name (value.ssym.stoken),
3252 (value.ssym.sym.symbol == NULL
3253 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym.symbol)),
3254 value.ssym.is_a_field_of_this);
3255 break;
3256
3257 case FILENAME:
3258 fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3259 break;
3260 }
3261 }
3262
3263 #endif
3264
3265 void
3266 yyerror (char *msg)
3267 {
3268 if (prev_lexptr)
3269 lexptr = prev_lexptr;
3270
3271 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);
3272 }
GDB Binutils - Deliverables
This page took 0.128806 seconds and 5 git commands to generate.