1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986-2018 Free Software Foundation, Inc.
4 This file is part of GDB.
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.
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.
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/>. */
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.
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. */
40 #include "expression.h"
42 #include "parser-defs.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 */
50 #include "cp-support.h"
51 #include "macroscope.h"
52 #include "objc-lang.h"
53 #include "typeprint.h"
56 #define parse_type(ps) builtin_type (parse_gdbarch (ps))
58 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror,
60 #define GDB_YY_REMAP_PREFIX c_
63 /* The state of the parser, used internally when we are parsing the
66 static struct parser_state *pstate = NULL;
70 static int yylex (void);
72 void yyerror (const char *);
74 static int type_aggregate_p (struct type *);
78 /* Although the yacc "value" of an expression is not used,
79 since the result is stored in the structure being created,
80 other node types do have values. */
95 struct typed_stoken tsval;
99 const struct block *bval;
100 enum exp_opcode opcode;
102 struct stoken_vector svec;
103 VEC (type_ptr) *tvec;
105 struct type_stack *type_stack;
107 struct objc_class_str theclass;
111 /* YYSTYPE gets defined by %union */
112 static int parse_number (struct parser_state *par_state,
113 const char *, int, int, YYSTYPE *);
114 static struct stoken operator_stoken (const char *);
115 static void check_parameter_typelist (VEC (type_ptr) *);
116 static void write_destructor_name (struct parser_state *par_state,
120 static void c_print_token (FILE *file, int type, YYSTYPE value);
121 #define YYPRINT(FILE, TYPE, VALUE) c_print_token (FILE, TYPE, VALUE)
125 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly function_method
127 %type <tval> type typebase
128 %type <tvec> nonempty_typelist func_mod parameter_typelist
129 /* %type <bval> block */
131 /* Fancy type parsing. */
133 %type <lval> array_mod
134 %type <tval> conversion_type_id
136 %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl
138 %token <typed_val_int> INT
139 %token <typed_val_float> FLOAT
141 /* Both NAME and TYPENAME tokens represent symbols in the input,
142 and both convey their data as strings.
143 But a TYPENAME is a string that happens to be defined as a typedef
144 or builtin type name (such as int or char)
145 and a NAME is any other symbol.
146 Contexts where this distinction is not important can use the
147 nonterminal "name", which matches either NAME or TYPENAME. */
149 %token <tsval> STRING
150 %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */
151 %token SELECTOR /* ObjC "@selector" pseudo-operator */
153 %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */
154 %token <ssym> UNKNOWN_CPP_NAME
155 %token <voidval> COMPLETE
156 %token <tsym> TYPENAME
157 %token <theclass> CLASSNAME /* ObjC Class name */
159 %type <svec> string_exp
160 %type <ssym> name_not_typename
161 %type <tsym> type_name
163 /* This is like a '[' token, but is only generated when parsing
164 Objective C. This lets us reuse the same parser without
165 erroneously parsing ObjC-specific expressions in C. */
168 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
169 but which would parse as a valid number in the current input radix.
170 E.g. "c" when input_radix==16. Depending on the parse, it will be
171 turned into a name or into a number. */
173 %token <ssym> NAME_OR_INT
176 %token STRUCT CLASS UNION ENUM SIZEOF ALIGNOF UNSIGNED COLONCOLON
181 %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
187 /* Special type cases, put in to allow the parser to distinguish different
189 %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
191 %token <sval> VARIABLE
193 %token <opcode> ASSIGN_MODIFY
202 %right '=' ASSIGN_MODIFY
210 %left '<' '>' LEQ GEQ
215 %right UNARY INCREMENT DECREMENT
216 %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '('
217 %token <ssym> BLOCKNAME
218 %token <bval> FILENAME
232 { write_exp_elt_opcode(pstate, OP_TYPE);
233 write_exp_elt_type(pstate, $1);
234 write_exp_elt_opcode(pstate, OP_TYPE);}
237 write_exp_elt_opcode (pstate, OP_TYPEOF);
239 | TYPEOF '(' type ')'
241 write_exp_elt_opcode (pstate, OP_TYPE);
242 write_exp_elt_type (pstate, $3);
243 write_exp_elt_opcode (pstate, OP_TYPE);
245 | DECLTYPE '(' exp ')'
247 write_exp_elt_opcode (pstate, OP_DECLTYPE);
251 /* Expressions, including the comma operator. */
254 { write_exp_elt_opcode (pstate, BINOP_COMMA); }
257 /* Expressions, not including the comma operator. */
258 exp : '*' exp %prec UNARY
259 { write_exp_elt_opcode (pstate, UNOP_IND); }
262 exp : '&' exp %prec UNARY
263 { write_exp_elt_opcode (pstate, UNOP_ADDR); }
266 exp : '-' exp %prec UNARY
267 { write_exp_elt_opcode (pstate, UNOP_NEG); }
270 exp : '+' exp %prec UNARY
271 { write_exp_elt_opcode (pstate, UNOP_PLUS); }
274 exp : '!' exp %prec UNARY
275 { write_exp_elt_opcode (pstate, UNOP_LOGICAL_NOT); }
278 exp : '~' exp %prec UNARY
279 { write_exp_elt_opcode (pstate, UNOP_COMPLEMENT); }
282 exp : INCREMENT exp %prec UNARY
283 { write_exp_elt_opcode (pstate, UNOP_PREINCREMENT); }
286 exp : DECREMENT exp %prec UNARY
287 { write_exp_elt_opcode (pstate, UNOP_PREDECREMENT); }
290 exp : exp INCREMENT %prec UNARY
291 { write_exp_elt_opcode (pstate, UNOP_POSTINCREMENT); }
294 exp : exp DECREMENT %prec UNARY
295 { write_exp_elt_opcode (pstate, UNOP_POSTDECREMENT); }
298 exp : TYPEID '(' exp ')' %prec UNARY
299 { write_exp_elt_opcode (pstate, OP_TYPEID); }
302 exp : TYPEID '(' type_exp ')' %prec UNARY
303 { write_exp_elt_opcode (pstate, OP_TYPEID); }
306 exp : SIZEOF exp %prec UNARY
307 { write_exp_elt_opcode (pstate, UNOP_SIZEOF); }
310 exp : ALIGNOF '(' type_exp ')' %prec UNARY
311 { write_exp_elt_opcode (pstate, UNOP_ALIGNOF); }
315 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
316 write_exp_string (pstate, $3);
317 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
320 exp : exp ARROW name COMPLETE
321 { mark_struct_expression (pstate);
322 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
323 write_exp_string (pstate, $3);
324 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
327 exp : exp ARROW COMPLETE
329 mark_struct_expression (pstate);
330 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
333 write_exp_string (pstate, s);
334 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
337 exp : exp ARROW '~' name
338 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
339 write_destructor_name (pstate, $4);
340 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
343 exp : exp ARROW '~' name COMPLETE
344 { mark_struct_expression (pstate);
345 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
346 write_destructor_name (pstate, $4);
347 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
350 exp : exp ARROW qualified_name
351 { /* exp->type::name becomes exp->*(&type::name) */
352 /* Note: this doesn't work if name is a
353 static member! FIXME */
354 write_exp_elt_opcode (pstate, UNOP_ADDR);
355 write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
358 exp : exp ARROW_STAR exp
359 { write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
363 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
364 write_exp_string (pstate, $3);
365 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
368 exp : exp '.' name COMPLETE
369 { mark_struct_expression (pstate);
370 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
371 write_exp_string (pstate, $3);
372 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
375 exp : exp '.' COMPLETE
377 mark_struct_expression (pstate);
378 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
381 write_exp_string (pstate, s);
382 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
385 exp : exp '.' '~' name
386 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
387 write_destructor_name (pstate, $4);
388 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
391 exp : exp '.' '~' name COMPLETE
392 { mark_struct_expression (pstate);
393 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
394 write_destructor_name (pstate, $4);
395 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
398 exp : exp '.' qualified_name
399 { /* exp.type::name becomes exp.*(&type::name) */
400 /* Note: this doesn't work if name is a
401 static member! FIXME */
402 write_exp_elt_opcode (pstate, UNOP_ADDR);
403 write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
406 exp : exp DOT_STAR exp
407 { write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
410 exp : exp '[' exp1 ']'
411 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
414 exp : exp OBJC_LBRAC exp1 ']'
415 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
419 * The rules below parse ObjC message calls of the form:
420 * '[' target selector {':' argument}* ']'
423 exp : OBJC_LBRAC TYPENAME
427 theclass = lookup_objc_class (parse_gdbarch (pstate),
428 copy_name ($2.stoken));
430 error (_("%s is not an ObjC Class"),
431 copy_name ($2.stoken));
432 write_exp_elt_opcode (pstate, OP_LONG);
433 write_exp_elt_type (pstate,
434 parse_type (pstate)->builtin_int);
435 write_exp_elt_longcst (pstate, (LONGEST) theclass);
436 write_exp_elt_opcode (pstate, OP_LONG);
440 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
441 end_msglist (pstate);
442 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
446 exp : OBJC_LBRAC CLASSNAME
448 write_exp_elt_opcode (pstate, OP_LONG);
449 write_exp_elt_type (pstate,
450 parse_type (pstate)->builtin_int);
451 write_exp_elt_longcst (pstate, (LONGEST) $2.theclass);
452 write_exp_elt_opcode (pstate, OP_LONG);
456 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
457 end_msglist (pstate);
458 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
465 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
466 end_msglist (pstate);
467 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
472 { add_msglist(&$1, 0); }
480 msgarg : name ':' exp
481 { add_msglist(&$1, 1); }
482 | ':' exp /* Unnamed arg. */
483 { add_msglist(0, 1); }
484 | ',' exp /* Variable number of args. */
485 { add_msglist(0, 0); }
489 /* This is to save the value of arglist_len
490 being accumulated by an outer function call. */
491 { start_arglist (); }
492 arglist ')' %prec ARROW
493 { write_exp_elt_opcode (pstate, OP_FUNCALL);
494 write_exp_elt_longcst (pstate,
495 (LONGEST) end_arglist ());
496 write_exp_elt_opcode (pstate, OP_FUNCALL); }
499 /* This is here to disambiguate with the production for
500 "func()::static_var" further below, which uses
501 function_method_void. */
502 exp : exp '(' ')' %prec ARROW
504 write_exp_elt_opcode (pstate, OP_FUNCALL);
505 write_exp_elt_longcst (pstate,
506 (LONGEST) end_arglist ());
507 write_exp_elt_opcode (pstate, OP_FUNCALL); }
511 exp : UNKNOWN_CPP_NAME '('
513 /* This could potentially be a an argument defined
514 lookup function (Koenig). */
515 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
516 write_exp_elt_block (pstate,
517 expression_context_block);
518 write_exp_elt_sym (pstate,
519 NULL); /* Placeholder. */
520 write_exp_string (pstate, $1.stoken);
521 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
523 /* This is to save the value of arglist_len
524 being accumulated by an outer function call. */
528 arglist ')' %prec ARROW
530 write_exp_elt_opcode (pstate, OP_FUNCALL);
531 write_exp_elt_longcst (pstate,
532 (LONGEST) end_arglist ());
533 write_exp_elt_opcode (pstate, OP_FUNCALL);
538 { start_arglist (); }
548 arglist : arglist ',' exp %prec ABOVE_COMMA
552 function_method: exp '(' parameter_typelist ')' const_or_volatile
554 VEC (type_ptr) *type_list = $3;
555 struct type *type_elt;
556 LONGEST len = VEC_length (type_ptr, type_list);
558 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
559 /* Save the const/volatile qualifiers as
560 recorded by the const_or_volatile
561 production's actions. */
562 write_exp_elt_longcst (pstate,
563 follow_type_instance_flags ());
564 write_exp_elt_longcst (pstate, len);
566 VEC_iterate (type_ptr, type_list, i, type_elt);
568 write_exp_elt_type (pstate, type_elt);
569 write_exp_elt_longcst(pstate, len);
570 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
571 VEC_free (type_ptr, type_list);
575 function_method_void: exp '(' ')' const_or_volatile
576 { write_exp_elt_opcode (pstate, TYPE_INSTANCE);
578 write_exp_elt_longcst (pstate,
579 follow_type_instance_flags ());
580 write_exp_elt_longcst (pstate, 0);
581 write_exp_elt_longcst (pstate, 0);
582 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
586 exp : function_method
589 /* Normally we must interpret "func()" as a function call, instead of
590 a type. The user needs to write func(void) to disambiguate.
591 However, in the "func()::static_var" case, there's no
593 function_method_void_or_typelist: function_method
594 | function_method_void
597 exp : function_method_void_or_typelist COLONCOLON name
599 write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR);
600 write_exp_string (pstate, $3);
601 write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR);
606 { $$ = end_arglist () - 1; }
608 exp : lcurly arglist rcurly %prec ARROW
609 { write_exp_elt_opcode (pstate, OP_ARRAY);
610 write_exp_elt_longcst (pstate, (LONGEST) 0);
611 write_exp_elt_longcst (pstate, (LONGEST) $3);
612 write_exp_elt_opcode (pstate, OP_ARRAY); }
615 exp : lcurly type_exp rcurly exp %prec UNARY
616 { write_exp_elt_opcode (pstate, UNOP_MEMVAL_TYPE); }
619 exp : '(' type_exp ')' exp %prec UNARY
620 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
627 /* Binary operators in order of decreasing precedence. */
630 { write_exp_elt_opcode (pstate, BINOP_REPEAT); }
634 { write_exp_elt_opcode (pstate, BINOP_MUL); }
638 { write_exp_elt_opcode (pstate, BINOP_DIV); }
642 { write_exp_elt_opcode (pstate, BINOP_REM); }
646 { write_exp_elt_opcode (pstate, BINOP_ADD); }
650 { write_exp_elt_opcode (pstate, BINOP_SUB); }
654 { write_exp_elt_opcode (pstate, BINOP_LSH); }
658 { write_exp_elt_opcode (pstate, BINOP_RSH); }
662 { write_exp_elt_opcode (pstate, BINOP_EQUAL); }
665 exp : exp NOTEQUAL exp
666 { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); }
670 { write_exp_elt_opcode (pstate, BINOP_LEQ); }
674 { write_exp_elt_opcode (pstate, BINOP_GEQ); }
678 { write_exp_elt_opcode (pstate, BINOP_LESS); }
682 { write_exp_elt_opcode (pstate, BINOP_GTR); }
686 { write_exp_elt_opcode (pstate, BINOP_BITWISE_AND); }
690 { write_exp_elt_opcode (pstate, BINOP_BITWISE_XOR); }
694 { write_exp_elt_opcode (pstate, BINOP_BITWISE_IOR); }
698 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); }
702 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); }
705 exp : exp '?' exp ':' exp %prec '?'
706 { write_exp_elt_opcode (pstate, TERNOP_COND); }
710 { write_exp_elt_opcode (pstate, BINOP_ASSIGN); }
713 exp : exp ASSIGN_MODIFY exp
714 { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY);
715 write_exp_elt_opcode (pstate, $2);
716 write_exp_elt_opcode (pstate,
717 BINOP_ASSIGN_MODIFY); }
721 { write_exp_elt_opcode (pstate, OP_LONG);
722 write_exp_elt_type (pstate, $1.type);
723 write_exp_elt_longcst (pstate, (LONGEST) ($1.val));
724 write_exp_elt_opcode (pstate, OP_LONG); }
729 struct stoken_vector vec;
732 write_exp_string_vector (pstate, $1.type, &vec);
738 parse_number (pstate, $1.stoken.ptr,
739 $1.stoken.length, 0, &val);
740 write_exp_elt_opcode (pstate, OP_LONG);
741 write_exp_elt_type (pstate, val.typed_val_int.type);
742 write_exp_elt_longcst (pstate,
743 (LONGEST) val.typed_val_int.val);
744 write_exp_elt_opcode (pstate, OP_LONG);
750 { write_exp_elt_opcode (pstate, OP_FLOAT);
751 write_exp_elt_type (pstate, $1.type);
752 write_exp_elt_floatcst (pstate, $1.val);
753 write_exp_elt_opcode (pstate, OP_FLOAT); }
761 write_dollar_variable (pstate, $1);
765 exp : SELECTOR '(' name ')'
767 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR);
768 write_exp_string (pstate, $3);
769 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); }
772 exp : SIZEOF '(' type ')' %prec UNARY
773 { struct type *type = $3;
774 write_exp_elt_opcode (pstate, OP_LONG);
775 write_exp_elt_type (pstate, lookup_signed_typename
776 (parse_language (pstate),
777 parse_gdbarch (pstate),
779 type = check_typedef (type);
781 /* $5.3.3/2 of the C++ Standard (n3290 draft)
782 says of sizeof: "When applied to a reference
783 or a reference type, the result is the size of
784 the referenced type." */
785 if (TYPE_IS_REFERENCE (type))
786 type = check_typedef (TYPE_TARGET_TYPE (type));
787 write_exp_elt_longcst (pstate,
788 (LONGEST) TYPE_LENGTH (type));
789 write_exp_elt_opcode (pstate, OP_LONG); }
792 exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
793 { write_exp_elt_opcode (pstate,
794 UNOP_REINTERPRET_CAST); }
797 exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
798 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
801 exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
802 { write_exp_elt_opcode (pstate, UNOP_DYNAMIC_CAST); }
805 exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
806 { /* We could do more error checking here, but
807 it doesn't seem worthwhile. */
808 write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
814 /* We copy the string here, and not in the
815 lexer, to guarantee that we do not leak a
816 string. Note that we follow the
817 NUL-termination convention of the
819 struct typed_stoken *vec = XNEW (struct typed_stoken);
824 vec->length = $1.length;
825 vec->ptr = (char *) malloc ($1.length + 1);
826 memcpy (vec->ptr, $1.ptr, $1.length + 1);
831 /* Note that we NUL-terminate here, but just
835 $$.tokens = XRESIZEVEC (struct typed_stoken,
838 p = (char *) malloc ($2.length + 1);
839 memcpy (p, $2.ptr, $2.length + 1);
841 $$.tokens[$$.len - 1].type = $2.type;
842 $$.tokens[$$.len - 1].length = $2.length;
843 $$.tokens[$$.len - 1].ptr = p;
850 c_string_type type = C_STRING;
852 for (i = 0; i < $1.len; ++i)
854 switch ($1.tokens[i].type)
862 && type != $1.tokens[i].type)
863 error (_("Undefined string concatenation."));
864 type = (enum c_string_type_values) $1.tokens[i].type;
868 internal_error (__FILE__, __LINE__,
869 "unrecognized type in string concatenation");
873 write_exp_string_vector (pstate, type, &$1);
874 for (i = 0; i < $1.len; ++i)
875 free ($1.tokens[i].ptr);
880 exp : NSSTRING /* ObjC NextStep NSString constant
881 * of the form '@' '"' string '"'.
883 { write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING);
884 write_exp_string (pstate, $1);
885 write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); }
890 { write_exp_elt_opcode (pstate, OP_LONG);
891 write_exp_elt_type (pstate,
892 parse_type (pstate)->builtin_bool);
893 write_exp_elt_longcst (pstate, (LONGEST) 1);
894 write_exp_elt_opcode (pstate, OP_LONG); }
898 { write_exp_elt_opcode (pstate, OP_LONG);
899 write_exp_elt_type (pstate,
900 parse_type (pstate)->builtin_bool);
901 write_exp_elt_longcst (pstate, (LONGEST) 0);
902 write_exp_elt_opcode (pstate, OP_LONG); }
910 $$ = SYMBOL_BLOCK_VALUE ($1.sym.symbol);
912 error (_("No file or function \"%s\"."),
913 copy_name ($1.stoken));
921 block : block COLONCOLON name
923 = lookup_symbol (copy_name ($3), $1,
924 VAR_DOMAIN, NULL).symbol;
926 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
927 error (_("No function \"%s\" in specified context."),
929 $$ = SYMBOL_BLOCK_VALUE (tem); }
932 variable: name_not_typename ENTRY
933 { struct symbol *sym = $1.sym.symbol;
935 if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym)
936 || !symbol_read_needs_frame (sym))
937 error (_("@entry can be used only for function "
938 "parameters, not for \"%s\""),
939 copy_name ($1.stoken));
941 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
942 write_exp_elt_sym (pstate, sym);
943 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
947 variable: block COLONCOLON name
948 { struct block_symbol sym
949 = lookup_symbol (copy_name ($3), $1,
953 error (_("No symbol \"%s\" in specified context."),
955 if (symbol_read_needs_frame (sym.symbol))
957 innermost_block.update (sym);
959 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
960 write_exp_elt_block (pstate, sym.block);
961 write_exp_elt_sym (pstate, sym.symbol);
962 write_exp_elt_opcode (pstate, OP_VAR_VALUE); }
965 qualified_name: TYPENAME COLONCOLON name
967 struct type *type = $1.type;
968 type = check_typedef (type);
969 if (!type_aggregate_p (type))
970 error (_("`%s' is not defined as an aggregate type."),
971 TYPE_SAFE_NAME (type));
973 write_exp_elt_opcode (pstate, OP_SCOPE);
974 write_exp_elt_type (pstate, type);
975 write_exp_string (pstate, $3);
976 write_exp_elt_opcode (pstate, OP_SCOPE);
978 | TYPENAME COLONCOLON '~' name
980 struct type *type = $1.type;
981 struct stoken tmp_token;
984 type = check_typedef (type);
985 if (!type_aggregate_p (type))
986 error (_("`%s' is not defined as an aggregate type."),
987 TYPE_SAFE_NAME (type));
988 buf = (char *) alloca ($4.length + 2);
990 tmp_token.length = $4.length + 1;
992 memcpy (buf+1, $4.ptr, $4.length);
993 buf[tmp_token.length] = 0;
995 /* Check for valid destructor name. */
996 destructor_name_p (tmp_token.ptr, $1.type);
997 write_exp_elt_opcode (pstate, OP_SCOPE);
998 write_exp_elt_type (pstate, type);
999 write_exp_string (pstate, tmp_token);
1000 write_exp_elt_opcode (pstate, OP_SCOPE);
1002 | TYPENAME COLONCOLON name COLONCOLON name
1004 char *copy = copy_name ($3);
1005 error (_("No type \"%s\" within class "
1006 "or namespace \"%s\"."),
1007 copy, TYPE_SAFE_NAME ($1.type));
1011 variable: qualified_name
1012 | COLONCOLON name_not_typename
1014 char *name = copy_name ($2.stoken);
1016 struct bound_minimal_symbol msymbol;
1019 = lookup_symbol (name, (const struct block *) NULL,
1020 VAR_DOMAIN, NULL).symbol;
1023 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1024 write_exp_elt_block (pstate, NULL);
1025 write_exp_elt_sym (pstate, sym);
1026 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1030 msymbol = lookup_bound_minimal_symbol (name);
1031 if (msymbol.minsym != NULL)
1032 write_exp_msymbol (pstate, msymbol);
1033 else if (!have_full_symbols () && !have_partial_symbols ())
1034 error (_("No symbol table is loaded. Use the \"file\" command."));
1036 error (_("No symbol \"%s\" in current context."), name);
1040 variable: name_not_typename
1041 { struct block_symbol sym = $1.sym;
1045 if (symbol_read_needs_frame (sym.symbol))
1046 innermost_block.update (sym);
1048 /* If we found a function, see if it's
1049 an ifunc resolver that has the same
1050 address as the ifunc symbol itself.
1051 If so, prefer the ifunc symbol. */
1053 bound_minimal_symbol resolver
1054 = find_gnu_ifunc (sym.symbol);
1055 if (resolver.minsym != NULL)
1056 write_exp_msymbol (pstate, resolver);
1059 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1060 write_exp_elt_block (pstate, sym.block);
1061 write_exp_elt_sym (pstate, sym.symbol);
1062 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1065 else if ($1.is_a_field_of_this)
1067 /* C++: it hangs off of `this'. Must
1068 not inadvertently convert from a method call
1070 innermost_block.update (sym);
1071 write_exp_elt_opcode (pstate, OP_THIS);
1072 write_exp_elt_opcode (pstate, OP_THIS);
1073 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1074 write_exp_string (pstate, $1.stoken);
1075 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1079 char *arg = copy_name ($1.stoken);
1081 bound_minimal_symbol msymbol
1082 = lookup_bound_minimal_symbol (arg);
1083 if (msymbol.minsym == NULL)
1085 if (!have_full_symbols () && !have_partial_symbols ())
1086 error (_("No symbol table is loaded. Use the \"file\" command."));
1088 error (_("No symbol \"%s\" in current context."),
1089 copy_name ($1.stoken));
1092 /* This minsym might be an alias for
1093 another function. See if we can find
1094 the debug symbol for the target, and
1095 if so, use it instead, since it has
1096 return type / prototype info. This
1097 is important for example for "p
1098 *__errno_location()". */
1099 symbol *alias_target
1100 = ((msymbol.minsym->type != mst_text_gnu_ifunc
1101 && msymbol.minsym->type != mst_data_gnu_ifunc)
1102 ? find_function_alias_target (msymbol)
1104 if (alias_target != NULL)
1106 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1108 (pstate, SYMBOL_BLOCK_VALUE (alias_target));
1109 write_exp_elt_sym (pstate, alias_target);
1110 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1113 write_exp_msymbol (pstate, msymbol);
1118 space_identifier : '@' NAME
1119 { insert_type_address_space (pstate, copy_name ($2.stoken)); }
1122 const_or_volatile: const_or_volatile_noopt
1126 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1129 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1130 | const_or_volatile_noopt
1133 const_or_volatile_or_space_identifier:
1134 const_or_volatile_or_space_identifier_noopt
1140 { insert_type (tp_pointer); }
1141 const_or_volatile_or_space_identifier
1143 { insert_type (tp_pointer); }
1144 const_or_volatile_or_space_identifier
1146 { insert_type (tp_reference); }
1148 { insert_type (tp_reference); }
1150 { insert_type (tp_rvalue_reference); }
1151 | ANDAND ptr_operator
1152 { insert_type (tp_rvalue_reference); }
1155 ptr_operator_ts: ptr_operator
1157 $$ = get_type_stack ();
1158 /* This cleanup is eventually run by
1160 make_cleanup (type_stack_cleanup, $$);
1164 abs_decl: ptr_operator_ts direct_abs_decl
1165 { $$ = append_type_stack ($2, $1); }
1170 direct_abs_decl: '(' abs_decl ')'
1172 | direct_abs_decl array_mod
1174 push_type_stack ($1);
1176 push_type (tp_array);
1177 $$ = get_type_stack ();
1182 push_type (tp_array);
1183 $$ = get_type_stack ();
1186 | direct_abs_decl func_mod
1188 push_type_stack ($1);
1190 $$ = get_type_stack ();
1195 $$ = get_type_stack ();
1205 | OBJC_LBRAC INT ']'
1211 | '(' parameter_typelist ')'
1215 /* We used to try to recognize pointer to member types here, but
1216 that didn't work (shift/reduce conflicts meant that these rules never
1217 got executed). The problem is that
1218 int (foo::bar::baz::bizzle)
1219 is a function type but
1220 int (foo::bar::baz::bizzle::*)
1221 is a pointer to member type. Stroustrup loses again! */
1226 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1230 { $$ = lookup_signed_typename (parse_language (pstate),
1231 parse_gdbarch (pstate),
1234 { $$ = lookup_signed_typename (parse_language (pstate),
1235 parse_gdbarch (pstate),
1238 { $$ = lookup_signed_typename (parse_language (pstate),
1239 parse_gdbarch (pstate),
1242 { $$ = lookup_signed_typename (parse_language (pstate),
1243 parse_gdbarch (pstate),
1245 | LONG SIGNED_KEYWORD INT_KEYWORD
1246 { $$ = lookup_signed_typename (parse_language (pstate),
1247 parse_gdbarch (pstate),
1249 | LONG SIGNED_KEYWORD
1250 { $$ = lookup_signed_typename (parse_language (pstate),
1251 parse_gdbarch (pstate),
1253 | SIGNED_KEYWORD LONG INT_KEYWORD
1254 { $$ = lookup_signed_typename (parse_language (pstate),
1255 parse_gdbarch (pstate),
1257 | UNSIGNED LONG INT_KEYWORD
1258 { $$ = lookup_unsigned_typename (parse_language (pstate),
1259 parse_gdbarch (pstate),
1261 | LONG UNSIGNED INT_KEYWORD
1262 { $$ = lookup_unsigned_typename (parse_language (pstate),
1263 parse_gdbarch (pstate),
1266 { $$ = lookup_unsigned_typename (parse_language (pstate),
1267 parse_gdbarch (pstate),
1270 { $$ = lookup_signed_typename (parse_language (pstate),
1271 parse_gdbarch (pstate),
1273 | LONG LONG INT_KEYWORD
1274 { $$ = lookup_signed_typename (parse_language (pstate),
1275 parse_gdbarch (pstate),
1277 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1278 { $$ = lookup_signed_typename (parse_language (pstate),
1279 parse_gdbarch (pstate),
1281 | LONG LONG SIGNED_KEYWORD
1282 { $$ = lookup_signed_typename (parse_language (pstate),
1283 parse_gdbarch (pstate),
1285 | SIGNED_KEYWORD LONG LONG
1286 { $$ = lookup_signed_typename (parse_language (pstate),
1287 parse_gdbarch (pstate),
1289 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1290 { $$ = lookup_signed_typename (parse_language (pstate),
1291 parse_gdbarch (pstate),
1293 | UNSIGNED LONG LONG
1294 { $$ = lookup_unsigned_typename (parse_language (pstate),
1295 parse_gdbarch (pstate),
1297 | UNSIGNED LONG LONG INT_KEYWORD
1298 { $$ = lookup_unsigned_typename (parse_language (pstate),
1299 parse_gdbarch (pstate),
1301 | LONG LONG UNSIGNED
1302 { $$ = lookup_unsigned_typename (parse_language (pstate),
1303 parse_gdbarch (pstate),
1305 | LONG LONG UNSIGNED INT_KEYWORD
1306 { $$ = lookup_unsigned_typename (parse_language (pstate),
1307 parse_gdbarch (pstate),
1310 { $$ = lookup_signed_typename (parse_language (pstate),
1311 parse_gdbarch (pstate),
1313 | SHORT SIGNED_KEYWORD INT_KEYWORD
1314 { $$ = lookup_signed_typename (parse_language (pstate),
1315 parse_gdbarch (pstate),
1317 | SHORT SIGNED_KEYWORD
1318 { $$ = lookup_signed_typename (parse_language (pstate),
1319 parse_gdbarch (pstate),
1321 | UNSIGNED SHORT INT_KEYWORD
1322 { $$ = lookup_unsigned_typename (parse_language (pstate),
1323 parse_gdbarch (pstate),
1326 { $$ = lookup_unsigned_typename (parse_language (pstate),
1327 parse_gdbarch (pstate),
1329 | SHORT UNSIGNED INT_KEYWORD
1330 { $$ = lookup_unsigned_typename (parse_language (pstate),
1331 parse_gdbarch (pstate),
1334 { $$ = lookup_typename (parse_language (pstate),
1335 parse_gdbarch (pstate),
1337 (struct block *) NULL,
1339 | LONG DOUBLE_KEYWORD
1340 { $$ = lookup_typename (parse_language (pstate),
1341 parse_gdbarch (pstate),
1343 (struct block *) NULL,
1346 { $$ = lookup_struct (copy_name ($2),
1347 expression_context_block); }
1350 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1353 | STRUCT name COMPLETE
1355 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1360 { $$ = lookup_struct (copy_name ($2),
1361 expression_context_block); }
1364 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1367 | CLASS name COMPLETE
1369 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1374 { $$ = lookup_union (copy_name ($2),
1375 expression_context_block); }
1378 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1381 | UNION name COMPLETE
1383 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1388 { $$ = lookup_enum (copy_name ($2),
1389 expression_context_block); }
1392 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1395 | ENUM name COMPLETE
1397 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1401 | UNSIGNED type_name
1402 { $$ = lookup_unsigned_typename (parse_language (pstate),
1403 parse_gdbarch (pstate),
1404 TYPE_NAME($2.type)); }
1406 { $$ = lookup_unsigned_typename (parse_language (pstate),
1407 parse_gdbarch (pstate),
1409 | SIGNED_KEYWORD type_name
1410 { $$ = lookup_signed_typename (parse_language (pstate),
1411 parse_gdbarch (pstate),
1412 TYPE_NAME($2.type)); }
1414 { $$ = lookup_signed_typename (parse_language (pstate),
1415 parse_gdbarch (pstate),
1417 /* It appears that this rule for templates is never
1418 reduced; template recognition happens by lookahead
1419 in the token processing code in yylex. */
1420 | TEMPLATE name '<' type '>'
1421 { $$ = lookup_template_type(copy_name($2), $4,
1422 expression_context_block);
1424 | const_or_volatile_or_space_identifier_noopt typebase
1425 { $$ = follow_types ($2); }
1426 | typebase const_or_volatile_or_space_identifier_noopt
1427 { $$ = follow_types ($1); }
1433 $$.stoken.ptr = "int";
1434 $$.stoken.length = 3;
1435 $$.type = lookup_signed_typename (parse_language (pstate),
1436 parse_gdbarch (pstate),
1441 $$.stoken.ptr = "long";
1442 $$.stoken.length = 4;
1443 $$.type = lookup_signed_typename (parse_language (pstate),
1444 parse_gdbarch (pstate),
1449 $$.stoken.ptr = "short";
1450 $$.stoken.length = 5;
1451 $$.type = lookup_signed_typename (parse_language (pstate),
1452 parse_gdbarch (pstate),
1459 { check_parameter_typelist ($1); }
1460 | nonempty_typelist ',' DOTDOTDOT
1462 VEC_safe_push (type_ptr, $1, NULL);
1463 check_parameter_typelist ($1);
1471 VEC (type_ptr) *typelist = NULL;
1472 VEC_safe_push (type_ptr, typelist, $1);
1475 | nonempty_typelist ',' type
1477 VEC_safe_push (type_ptr, $1, $3);
1485 push_type_stack ($2);
1486 $$ = follow_types ($1);
1490 conversion_type_id: typebase conversion_declarator
1491 { $$ = follow_types ($1); }
1494 conversion_declarator: /* Nothing. */
1495 | ptr_operator conversion_declarator
1498 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1499 | VOLATILE_KEYWORD CONST_KEYWORD
1502 const_or_volatile_noopt: const_and_volatile
1503 { insert_type (tp_const);
1504 insert_type (tp_volatile);
1507 { insert_type (tp_const); }
1509 { insert_type (tp_volatile); }
1513 { $$ = operator_stoken (" new"); }
1515 { $$ = operator_stoken (" delete"); }
1516 | OPERATOR NEW '[' ']'
1517 { $$ = operator_stoken (" new[]"); }
1518 | OPERATOR DELETE '[' ']'
1519 { $$ = operator_stoken (" delete[]"); }
1520 | OPERATOR NEW OBJC_LBRAC ']'
1521 { $$ = operator_stoken (" new[]"); }
1522 | OPERATOR DELETE OBJC_LBRAC ']'
1523 { $$ = operator_stoken (" delete[]"); }
1525 { $$ = operator_stoken ("+"); }
1527 { $$ = operator_stoken ("-"); }
1529 { $$ = operator_stoken ("*"); }
1531 { $$ = operator_stoken ("/"); }
1533 { $$ = operator_stoken ("%"); }
1535 { $$ = operator_stoken ("^"); }
1537 { $$ = operator_stoken ("&"); }
1539 { $$ = operator_stoken ("|"); }
1541 { $$ = operator_stoken ("~"); }
1543 { $$ = operator_stoken ("!"); }
1545 { $$ = operator_stoken ("="); }
1547 { $$ = operator_stoken ("<"); }
1549 { $$ = operator_stoken (">"); }
1550 | OPERATOR ASSIGN_MODIFY
1551 { const char *op = " unknown";
1575 case BINOP_BITWISE_IOR:
1578 case BINOP_BITWISE_AND:
1581 case BINOP_BITWISE_XOR:
1588 $$ = operator_stoken (op);
1591 { $$ = operator_stoken ("<<"); }
1593 { $$ = operator_stoken (">>"); }
1595 { $$ = operator_stoken ("=="); }
1597 { $$ = operator_stoken ("!="); }
1599 { $$ = operator_stoken ("<="); }
1601 { $$ = operator_stoken (">="); }
1603 { $$ = operator_stoken ("&&"); }
1605 { $$ = operator_stoken ("||"); }
1606 | OPERATOR INCREMENT
1607 { $$ = operator_stoken ("++"); }
1608 | OPERATOR DECREMENT
1609 { $$ = operator_stoken ("--"); }
1611 { $$ = operator_stoken (","); }
1612 | OPERATOR ARROW_STAR
1613 { $$ = operator_stoken ("->*"); }
1615 { $$ = operator_stoken ("->"); }
1617 { $$ = operator_stoken ("()"); }
1619 { $$ = operator_stoken ("[]"); }
1620 | OPERATOR OBJC_LBRAC ']'
1621 { $$ = operator_stoken ("[]"); }
1622 | OPERATOR conversion_type_id
1625 c_print_type ($2, NULL, &buf, -1, 0,
1626 &type_print_raw_options);
1628 /* This also needs canonicalization. */
1630 = cp_canonicalize_string (buf.c_str ());
1632 canon = std::move (buf.string ());
1633 $$ = operator_stoken ((" " + canon).c_str ());
1639 name : NAME { $$ = $1.stoken; }
1640 | BLOCKNAME { $$ = $1.stoken; }
1641 | TYPENAME { $$ = $1.stoken; }
1642 | NAME_OR_INT { $$ = $1.stoken; }
1643 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1647 name_not_typename : NAME
1649 /* These would be useful if name_not_typename was useful, but it is just
1650 a fake for "variable", so these cause reduce/reduce conflicts because
1651 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1652 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1653 context where only a name could occur, this might be useful.
1658 struct field_of_this_result is_a_field_of_this;
1661 $$.sym = lookup_symbol ($1.ptr,
1662 expression_context_block,
1664 &is_a_field_of_this);
1665 $$.is_a_field_of_this
1666 = is_a_field_of_this.type != NULL;
1673 /* Like write_exp_string, but prepends a '~'. */
1676 write_destructor_name (struct parser_state *par_state, struct stoken token)
1678 char *copy = (char *) alloca (token.length + 1);
1681 memcpy (©[1], token.ptr, token.length);
1686 write_exp_string (par_state, token);
1689 /* Returns a stoken of the operator name given by OP (which does not
1690 include the string "operator"). */
1692 static struct stoken
1693 operator_stoken (const char *op)
1695 struct stoken st = { NULL, 0 };
1698 st.length = CP_OPERATOR_LEN + strlen (op);
1699 buf = (char *) malloc (st.length + 1);
1700 strcpy (buf, CP_OPERATOR_STR);
1704 /* The toplevel (c_parse) will free the memory allocated here. */
1705 make_cleanup (free, buf);
1709 /* Return true if the type is aggregate-like. */
1712 type_aggregate_p (struct type *type)
1714 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1715 || TYPE_CODE (type) == TYPE_CODE_UNION
1716 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1717 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1718 && TYPE_DECLARED_CLASS (type)));
1721 /* Validate a parameter typelist. */
1724 check_parameter_typelist (VEC (type_ptr) *params)
1729 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1731 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1735 if (VEC_length (type_ptr, params) == 1)
1740 VEC_free (type_ptr, params);
1741 error (_("parameter types following 'void'"));
1745 VEC_free (type_ptr, params);
1746 error (_("'void' invalid as parameter type"));
1752 /* Take care of parsing a number (anything that starts with a digit).
1753 Set yylval and return the token type; update lexptr.
1754 LEN is the number of characters in it. */
1756 /*** Needs some error checking for the float case ***/
1759 parse_number (struct parser_state *par_state,
1760 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1762 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1763 here, and we do kind of silly things like cast to unsigned. */
1770 int base = input_radix;
1773 /* Number of "L" suffixes encountered. */
1776 /* We have found a "L" or "U" suffix. */
1777 int found_suffix = 0;
1780 struct type *signed_type;
1781 struct type *unsigned_type;
1784 p = (char *) alloca (len);
1785 memcpy (p, buf, len);
1789 /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */
1790 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1792 putithere->typed_val_float.type
1793 = parse_type (par_state)->builtin_decfloat;
1796 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1798 putithere->typed_val_float.type
1799 = parse_type (par_state)->builtin_decdouble;
1802 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1804 putithere->typed_val_float.type
1805 = parse_type (par_state)->builtin_declong;
1808 /* Handle suffixes: 'f' for float, 'l' for long double. */
1809 else if (len >= 1 && tolower (p[len - 1]) == 'f')
1811 putithere->typed_val_float.type
1812 = parse_type (par_state)->builtin_float;
1815 else if (len >= 1 && tolower (p[len - 1]) == 'l')
1817 putithere->typed_val_float.type
1818 = parse_type (par_state)->builtin_long_double;
1821 /* Default type for floating-point literals is double. */
1824 putithere->typed_val_float.type
1825 = parse_type (par_state)->builtin_double;
1828 if (!parse_float (p, len,
1829 putithere->typed_val_float.type,
1830 putithere->typed_val_float.val))
1835 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1836 if (p[0] == '0' && len > 1)
1879 if (c >= 'A' && c <= 'Z')
1881 if (c != 'l' && c != 'u')
1883 if (c >= '0' && c <= '9')
1891 if (base > 10 && c >= 'a' && c <= 'f')
1895 n += i = c - 'a' + 10;
1908 return ERROR; /* Char not a digit */
1911 return ERROR; /* Invalid digit in this base */
1913 /* Portably test for overflow (only works for nonzero values, so make
1914 a second check for zero). FIXME: Can't we just make n and prevn
1915 unsigned and avoid this? */
1916 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1917 unsigned_p = 1; /* Try something unsigned */
1919 /* Portably test for unsigned overflow.
1920 FIXME: This check is wrong; for example it doesn't find overflow
1921 on 0x123456789 when LONGEST is 32 bits. */
1922 if (c != 'l' && c != 'u' && n != 0)
1924 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1925 error (_("Numeric constant too large."));
1930 /* An integer constant is an int, a long, or a long long. An L
1931 suffix forces it to be long; an LL suffix forces it to be long
1932 long. If not forced to a larger size, it gets the first type of
1933 the above that it fits in. To figure out whether it fits, we
1934 shift it right and see whether anything remains. Note that we
1935 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1936 operation, because many compilers will warn about such a shift
1937 (which always produces a zero result). Sometimes gdbarch_int_bit
1938 or gdbarch_long_bit will be that big, sometimes not. To deal with
1939 the case where it is we just always shift the value more than
1940 once, with fewer bits each time. */
1942 un = (ULONGEST)n >> 2;
1944 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1947 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1949 /* A large decimal (not hex or octal) constant (between INT_MAX
1950 and UINT_MAX) is a long or unsigned long, according to ANSI,
1951 never an unsigned int, but this code treats it as unsigned
1952 int. This probably should be fixed. GCC gives a warning on
1955 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1956 signed_type = parse_type (par_state)->builtin_int;
1958 else if (long_p <= 1
1959 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1962 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1963 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1964 signed_type = parse_type (par_state)->builtin_long;
1969 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1970 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1971 /* A long long does not fit in a LONGEST. */
1972 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1974 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1975 high_bit = (ULONGEST) 1 << shift;
1976 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1977 signed_type = parse_type (par_state)->builtin_long_long;
1980 putithere->typed_val_int.val = n;
1982 /* If the high bit of the worked out type is set then this number
1983 has to be unsigned. */
1985 if (unsigned_p || (n & high_bit))
1987 putithere->typed_val_int.type = unsigned_type;
1991 putithere->typed_val_int.type = signed_type;
1997 /* Temporary obstack used for holding strings. */
1998 static struct obstack tempbuf;
1999 static int tempbuf_init;
2001 /* Parse a C escape sequence. The initial backslash of the sequence
2002 is at (*PTR)[-1]. *PTR will be updated to point to just after the
2003 last character of the sequence. If OUTPUT is not NULL, the
2004 translated form of the escape sequence will be written there. If
2005 OUTPUT is NULL, no output is written and the call will only affect
2006 *PTR. If an escape sequence is expressed in target bytes, then the
2007 entire sequence will simply be copied to OUTPUT. Return 1 if any
2008 character was emitted, 0 otherwise. */
2011 c_parse_escape (const char **ptr, struct obstack *output)
2013 const char *tokptr = *ptr;
2016 /* Some escape sequences undergo character set conversion. Those we
2020 /* Hex escapes do not undergo character set conversion, so keep
2021 the escape sequence for later. */
2024 obstack_grow_str (output, "\\x");
2026 if (!isxdigit (*tokptr))
2027 error (_("\\x escape without a following hex digit"));
2028 while (isxdigit (*tokptr))
2031 obstack_1grow (output, *tokptr);
2036 /* Octal escapes do not undergo character set conversion, so
2037 keep the escape sequence for later. */
2049 obstack_grow_str (output, "\\");
2051 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
2055 obstack_1grow (output, *tokptr);
2061 /* We handle UCNs later. We could handle them here, but that
2062 would mean a spurious error in the case where the UCN could
2063 be converted to the target charset but not the host
2069 int i, len = c == 'U' ? 8 : 4;
2072 obstack_1grow (output, '\\');
2073 obstack_1grow (output, *tokptr);
2076 if (!isxdigit (*tokptr))
2077 error (_("\\%c escape without a following hex digit"), c);
2078 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2081 obstack_1grow (output, *tokptr);
2087 /* We must pass backslash through so that it does not
2088 cause quoting during the second expansion. */
2091 obstack_grow_str (output, "\\\\");
2095 /* Escapes which undergo conversion. */
2098 obstack_1grow (output, '\a');
2103 obstack_1grow (output, '\b');
2108 obstack_1grow (output, '\f');
2113 obstack_1grow (output, '\n');
2118 obstack_1grow (output, '\r');
2123 obstack_1grow (output, '\t');
2128 obstack_1grow (output, '\v');
2132 /* GCC extension. */
2135 obstack_1grow (output, HOST_ESCAPE_CHAR);
2139 /* Backslash-newline expands to nothing at all. */
2145 /* A few escapes just expand to the character itself. */
2149 /* GCC extensions. */
2154 /* Unrecognized escapes turn into the character itself. */
2157 obstack_1grow (output, *tokptr);
2165 /* Parse a string or character literal from TOKPTR. The string or
2166 character may be wide or unicode. *OUTPTR is set to just after the
2167 end of the literal in the input string. The resulting token is
2168 stored in VALUE. This returns a token value, either STRING or
2169 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2170 number of host characters in the literal. */
2173 parse_string_or_char (const char *tokptr, const char **outptr,
2174 struct typed_stoken *value, int *host_chars)
2180 /* Build the gdb internal form of the input string in tempbuf. Note
2181 that the buffer is null byte terminated *only* for the
2182 convenience of debugging gdb itself and printing the buffer
2183 contents when the buffer contains no embedded nulls. Gdb does
2184 not depend upon the buffer being null byte terminated, it uses
2185 the length string instead. This allows gdb to handle C strings
2186 (as well as strings in other languages) with embedded null
2192 obstack_free (&tempbuf, NULL);
2193 obstack_init (&tempbuf);
2195 /* Record the string type. */
2198 type = C_WIDE_STRING;
2201 else if (*tokptr == 'u')
2206 else if (*tokptr == 'U')
2211 else if (*tokptr == '@')
2213 /* An Objective C string. */
2221 /* Skip the quote. */
2235 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2237 else if (c == quote)
2241 obstack_1grow (&tempbuf, c);
2243 /* FIXME: this does the wrong thing with multi-byte host
2244 characters. We could use mbrlen here, but that would
2245 make "set host-charset" a bit less useful. */
2250 if (*tokptr != quote)
2253 error (_("Unterminated string in expression."));
2255 error (_("Unmatched single quote."));
2260 value->ptr = (char *) obstack_base (&tempbuf);
2261 value->length = obstack_object_size (&tempbuf);
2265 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2268 /* This is used to associate some attributes with a token. */
2272 /* If this bit is set, the token is C++-only. */
2276 /* If this bit is set, the token is conditional: if there is a
2277 symbol of the same name, then the token is a symbol; otherwise,
2278 the token is a keyword. */
2282 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2288 enum exp_opcode opcode;
2292 static const struct token tokentab3[] =
2294 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2295 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2296 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2297 {"...", DOTDOTDOT, BINOP_END, 0}
2300 static const struct token tokentab2[] =
2302 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2303 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2304 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2305 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2306 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2307 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2308 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2309 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2310 {"++", INCREMENT, BINOP_END, 0},
2311 {"--", DECREMENT, BINOP_END, 0},
2312 {"->", ARROW, BINOP_END, 0},
2313 {"&&", ANDAND, BINOP_END, 0},
2314 {"||", OROR, BINOP_END, 0},
2315 /* "::" is *not* only C++: gdb overrides its meaning in several
2316 different ways, e.g., 'filename'::func, function::variable. */
2317 {"::", COLONCOLON, BINOP_END, 0},
2318 {"<<", LSH, BINOP_END, 0},
2319 {">>", RSH, BINOP_END, 0},
2320 {"==", EQUAL, BINOP_END, 0},
2321 {"!=", NOTEQUAL, BINOP_END, 0},
2322 {"<=", LEQ, BINOP_END, 0},
2323 {">=", GEQ, BINOP_END, 0},
2324 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2327 /* Identifier-like tokens. */
2328 static const struct token ident_tokens[] =
2330 {"unsigned", UNSIGNED, OP_NULL, 0},
2331 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2332 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2333 {"struct", STRUCT, OP_NULL, 0},
2334 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2335 {"sizeof", SIZEOF, OP_NULL, 0},
2336 {"_Alignof", ALIGNOF, OP_NULL, 0},
2337 {"alignof", ALIGNOF, OP_NULL, FLAG_CXX},
2338 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2339 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2340 {"class", CLASS, OP_NULL, FLAG_CXX},
2341 {"union", UNION, OP_NULL, 0},
2342 {"short", SHORT, OP_NULL, 0},
2343 {"const", CONST_KEYWORD, OP_NULL, 0},
2344 {"enum", ENUM, OP_NULL, 0},
2345 {"long", LONG, OP_NULL, 0},
2346 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2347 {"int", INT_KEYWORD, OP_NULL, 0},
2348 {"new", NEW, OP_NULL, FLAG_CXX},
2349 {"delete", DELETE, OP_NULL, FLAG_CXX},
2350 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2352 {"and", ANDAND, BINOP_END, FLAG_CXX},
2353 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2354 {"bitand", '&', OP_NULL, FLAG_CXX},
2355 {"bitor", '|', OP_NULL, FLAG_CXX},
2356 {"compl", '~', OP_NULL, FLAG_CXX},
2357 {"not", '!', OP_NULL, FLAG_CXX},
2358 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2359 {"or", OROR, BINOP_END, FLAG_CXX},
2360 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2361 {"xor", '^', OP_NULL, FLAG_CXX},
2362 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2364 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2365 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2366 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2367 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2369 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2370 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2371 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2372 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2373 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2375 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2378 /* When we find that lexptr (the global var defined in parse.c) is
2379 pointing at a macro invocation, we expand the invocation, and call
2380 scan_macro_expansion to save the old lexptr here and point lexptr
2381 into the expanded text. When we reach the end of that, we call
2382 end_macro_expansion to pop back to the value we saved here. The
2383 macro expansion code promises to return only fully-expanded text,
2384 so we don't need to "push" more than one level.
2386 This is disgusting, of course. It would be cleaner to do all macro
2387 expansion beforehand, and then hand that to lexptr. But we don't
2388 really know where the expression ends. Remember, in a command like
2390 (gdb) break *ADDRESS if CONDITION
2392 we evaluate ADDRESS in the scope of the current frame, but we
2393 evaluate CONDITION in the scope of the breakpoint's location. So
2394 it's simply wrong to try to macro-expand the whole thing at once. */
2395 static const char *macro_original_text;
2397 /* We save all intermediate macro expansions on this obstack for the
2398 duration of a single parse. The expansion text may sometimes have
2399 to live past the end of the expansion, due to yacc lookahead.
2400 Rather than try to be clever about saving the data for a single
2401 token, we simply keep it all and delete it after parsing has
2403 static struct obstack expansion_obstack;
2406 scan_macro_expansion (char *expansion)
2410 /* We'd better not be trying to push the stack twice. */
2411 gdb_assert (! macro_original_text);
2413 /* Copy to the obstack, and then free the intermediate
2415 copy = (char *) obstack_copy0 (&expansion_obstack, expansion,
2416 strlen (expansion));
2419 /* Save the old lexptr value, so we can return to it when we're done
2420 parsing the expanded text. */
2421 macro_original_text = lexptr;
2426 scanning_macro_expansion (void)
2428 return macro_original_text != 0;
2432 finished_macro_expansion (void)
2434 /* There'd better be something to pop back to. */
2435 gdb_assert (macro_original_text);
2437 /* Pop back to the original text. */
2438 lexptr = macro_original_text;
2439 macro_original_text = 0;
2443 scan_macro_cleanup (void *dummy)
2445 if (macro_original_text)
2446 finished_macro_expansion ();
2448 obstack_free (&expansion_obstack, NULL);
2451 /* Return true iff the token represents a C++ cast operator. */
2454 is_cast_operator (const char *token, int len)
2456 return (! strncmp (token, "dynamic_cast", len)
2457 || ! strncmp (token, "static_cast", len)
2458 || ! strncmp (token, "reinterpret_cast", len)
2459 || ! strncmp (token, "const_cast", len));
2462 /* The scope used for macro expansion. */
2463 static struct macro_scope *expression_macro_scope;
2465 /* This is set if a NAME token appeared at the very end of the input
2466 string, with no whitespace separating the name from the EOF. This
2467 is used only when parsing to do field name completion. */
2468 static int saw_name_at_eof;
2470 /* This is set if the previously-returned token was a structure
2471 operator -- either '.' or ARROW. */
2472 static bool last_was_structop;
2474 /* Read one token, getting characters through lexptr. */
2477 lex_one_token (struct parser_state *par_state, bool *is_quoted_name)
2482 const char *tokstart;
2483 bool saw_structop = last_was_structop;
2486 last_was_structop = false;
2487 *is_quoted_name = false;
2491 /* Check if this is a macro invocation that we need to expand. */
2492 if (! scanning_macro_expansion ())
2494 char *expanded = macro_expand_next (&lexptr,
2495 standard_macro_lookup,
2496 expression_macro_scope);
2499 scan_macro_expansion (expanded);
2502 prev_lexptr = lexptr;
2505 /* See if it is a special token of length 3. */
2506 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2507 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2509 if ((tokentab3[i].flags & FLAG_CXX) != 0
2510 && parse_language (par_state)->la_language != language_cplus)
2514 yylval.opcode = tokentab3[i].opcode;
2515 return tokentab3[i].token;
2518 /* See if it is a special token of length 2. */
2519 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2520 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2522 if ((tokentab2[i].flags & FLAG_CXX) != 0
2523 && parse_language (par_state)->la_language != language_cplus)
2527 yylval.opcode = tokentab2[i].opcode;
2528 if (tokentab2[i].token == ARROW)
2529 last_was_structop = 1;
2530 return tokentab2[i].token;
2533 switch (c = *tokstart)
2536 /* If we were just scanning the result of a macro expansion,
2537 then we need to resume scanning the original text.
2538 If we're parsing for field name completion, and the previous
2539 token allows such completion, return a COMPLETE token.
2540 Otherwise, we were already scanning the original text, and
2541 we're really done. */
2542 if (scanning_macro_expansion ())
2544 finished_macro_expansion ();
2547 else if (saw_name_at_eof)
2549 saw_name_at_eof = 0;
2552 else if (parse_completion && saw_structop)
2567 if (parse_language (par_state)->la_language == language_objc
2574 if (paren_depth == 0)
2581 if (comma_terminates
2583 && ! scanning_macro_expansion ())
2589 /* Might be a floating point number. */
2590 if (lexptr[1] < '0' || lexptr[1] > '9')
2592 last_was_structop = true;
2593 goto symbol; /* Nope, must be a symbol. */
2595 /* FALL THRU into number case. */
2608 /* It's a number. */
2609 int got_dot = 0, got_e = 0, toktype;
2610 const char *p = tokstart;
2611 int hex = input_radix > 10;
2613 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2618 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2626 /* This test includes !hex because 'e' is a valid hex digit
2627 and thus does not indicate a floating point number when
2628 the radix is hex. */
2629 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2630 got_dot = got_e = 1;
2631 /* This test does not include !hex, because a '.' always indicates
2632 a decimal floating point number regardless of the radix. */
2633 else if (!got_dot && *p == '.')
2635 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2636 && (*p == '-' || *p == '+'))
2637 /* This is the sign of the exponent, not the end of the
2640 /* We will take any letters or digits. parse_number will
2641 complain if past the radix, or if L or U are not final. */
2642 else if ((*p < '0' || *p > '9')
2643 && ((*p < 'a' || *p > 'z')
2644 && (*p < 'A' || *p > 'Z')))
2647 toktype = parse_number (par_state, tokstart, p - tokstart,
2648 got_dot|got_e, &yylval);
2649 if (toktype == ERROR)
2651 char *err_copy = (char *) alloca (p - tokstart + 1);
2653 memcpy (err_copy, tokstart, p - tokstart);
2654 err_copy[p - tokstart] = 0;
2655 error (_("Invalid number \"%s\"."), err_copy);
2663 const char *p = &tokstart[1];
2664 size_t len = strlen ("entry");
2666 if (parse_language (par_state)->la_language == language_objc)
2668 size_t len = strlen ("selector");
2670 if (strncmp (p, "selector", len) == 0
2671 && (p[len] == '\0' || isspace (p[len])))
2680 while (isspace (*p))
2682 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2714 if (tokstart[1] != '"' && tokstart[1] != '\'')
2723 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2728 error (_("Empty character constant."));
2729 else if (host_len > 2 && c == '\'')
2732 namelen = lexptr - tokstart - 1;
2733 *is_quoted_name = true;
2737 else if (host_len > 1)
2738 error (_("Invalid character constant."));
2744 if (!(c == '_' || c == '$'
2745 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2746 /* We must have come across a bad character (e.g. ';'). */
2747 error (_("Invalid character '%c' in expression."), c);
2749 /* It's a name. See how long it is. */
2751 for (c = tokstart[namelen];
2752 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2753 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2755 /* Template parameter lists are part of the name.
2756 FIXME: This mishandles `print $a<4&&$a>3'. */
2760 if (! is_cast_operator (tokstart, namelen))
2762 /* Scan ahead to get rest of the template specification. Note
2763 that we look ahead only when the '<' adjoins non-whitespace
2764 characters; for comparison expressions, e.g. "a < b > c",
2765 there must be spaces before the '<', etc. */
2766 const char *p = find_template_name_end (tokstart + namelen);
2769 namelen = p - tokstart;
2773 c = tokstart[++namelen];
2776 /* The token "if" terminates the expression and is NOT removed from
2777 the input stream. It doesn't count if it appears in the
2778 expansion of a macro. */
2780 && tokstart[0] == 'i'
2781 && tokstart[1] == 'f'
2782 && ! scanning_macro_expansion ())
2787 /* For the same reason (breakpoint conditions), "thread N"
2788 terminates the expression. "thread" could be an identifier, but
2789 an identifier is never followed by a number without intervening
2790 punctuation. "task" is similar. Handle abbreviations of these,
2791 similarly to breakpoint.c:find_condition_and_thread. */
2793 && (strncmp (tokstart, "thread", namelen) == 0
2794 || strncmp (tokstart, "task", namelen) == 0)
2795 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2796 && ! scanning_macro_expansion ())
2798 const char *p = tokstart + namelen + 1;
2800 while (*p == ' ' || *p == '\t')
2802 if (*p >= '0' && *p <= '9')
2810 yylval.sval.ptr = tokstart;
2811 yylval.sval.length = namelen;
2813 /* Catch specific keywords. */
2814 copy = copy_name (yylval.sval);
2815 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2816 if (strcmp (copy, ident_tokens[i].oper) == 0)
2818 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2819 && parse_language (par_state)->la_language != language_cplus)
2822 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2824 struct field_of_this_result is_a_field_of_this;
2826 if (lookup_symbol (copy, expression_context_block,
2828 (parse_language (par_state)->la_language
2829 == language_cplus ? &is_a_field_of_this
2833 /* The keyword is shadowed. */
2838 /* It is ok to always set this, even though we don't always
2839 strictly need to. */
2840 yylval.opcode = ident_tokens[i].opcode;
2841 return ident_tokens[i].token;
2844 if (*tokstart == '$')
2847 if (parse_completion && *lexptr == '\0')
2848 saw_name_at_eof = 1;
2850 yylval.ssym.stoken = yylval.sval;
2851 yylval.ssym.sym.symbol = NULL;
2852 yylval.ssym.sym.block = NULL;
2853 yylval.ssym.is_a_field_of_this = 0;
2857 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2864 DEF_VEC_O (token_and_value);
2866 /* A FIFO of tokens that have been read but not yet returned to the
2868 static VEC (token_and_value) *token_fifo;
2870 /* Non-zero if the lexer should return tokens from the FIFO. */
2873 /* Temporary storage for c_lex; this holds symbol names as they are
2875 auto_obstack name_obstack;
2877 /* Classify a NAME token. The contents of the token are in `yylval'.
2878 Updates yylval and returns the new token type. BLOCK is the block
2879 in which lookups start; this can be NULL to mean the global scope.
2880 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2881 in single quotes. IS_AFTER_STRUCTOP is true if this name follows
2882 a structure operator -- either '.' or ARROW */
2885 classify_name (struct parser_state *par_state, const struct block *block,
2886 bool is_quoted_name, bool is_after_structop)
2888 struct block_symbol bsym;
2890 struct field_of_this_result is_a_field_of_this;
2892 copy = copy_name (yylval.sval);
2894 /* Initialize this in case we *don't* use it in this call; that way
2895 we can refer to it unconditionally below. */
2896 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2898 bsym = lookup_symbol (copy, block, VAR_DOMAIN,
2899 parse_language (par_state)->la_name_of_this
2900 ? &is_a_field_of_this : NULL);
2902 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2904 yylval.ssym.sym = bsym;
2905 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2908 else if (!bsym.symbol)
2910 /* If we found a field of 'this', we might have erroneously
2911 found a constructor where we wanted a type name. Handle this
2912 case by noticing that we found a constructor and then look up
2913 the type tag instead. */
2914 if (is_a_field_of_this.type != NULL
2915 && is_a_field_of_this.fn_field != NULL
2916 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2919 struct field_of_this_result inner_is_a_field_of_this;
2921 bsym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2922 &inner_is_a_field_of_this);
2923 if (bsym.symbol != NULL)
2925 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2930 /* If we found a field on the "this" object, or we are looking
2931 up a field on a struct, then we want to prefer it over a
2932 filename. However, if the name was quoted, then it is better
2933 to check for a filename or a block, since this is the only
2934 way the user has of requiring the extension to be used. */
2935 if ((is_a_field_of_this.type == NULL && !is_after_structop)
2938 /* See if it's a file name. */
2939 struct symtab *symtab;
2941 symtab = lookup_symtab (copy);
2944 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
2951 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
2953 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2957 /* See if it's an ObjC classname. */
2958 if (parse_language (par_state)->la_language == language_objc && !bsym.symbol)
2960 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2965 yylval.theclass.theclass = Class;
2966 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2968 yylval.theclass.type = SYMBOL_TYPE (sym);
2973 /* Input names that aren't symbols but ARE valid hex numbers, when
2974 the input radix permits them, can be names or numbers depending
2975 on the parse. Note we support radixes > 16 here. */
2977 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2978 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2980 YYSTYPE newlval; /* Its value is ignored. */
2981 int hextype = parse_number (par_state, copy, yylval.sval.length,
2986 yylval.ssym.sym = bsym;
2987 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2992 /* Any other kind of symbol */
2993 yylval.ssym.sym = bsym;
2994 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2996 if (bsym.symbol == NULL
2997 && parse_language (par_state)->la_language == language_cplus
2998 && is_a_field_of_this.type == NULL
2999 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
3000 return UNKNOWN_CPP_NAME;
3005 /* Like classify_name, but used by the inner loop of the lexer, when a
3006 name might have already been seen. CONTEXT is the context type, or
3007 NULL if this is the first component of a name. */
3010 classify_inner_name (struct parser_state *par_state,
3011 const struct block *block, struct type *context)
3016 if (context == NULL)
3017 return classify_name (par_state, block, false, false);
3019 type = check_typedef (context);
3020 if (!type_aggregate_p (type))
3023 copy = copy_name (yylval.ssym.stoken);
3024 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3025 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN);
3027 /* If no symbol was found, search for a matching base class named
3028 COPY. This will allow users to enter qualified names of class members
3029 relative to the `this' pointer. */
3030 if (yylval.ssym.sym.symbol == NULL)
3032 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3034 if (base_type != NULL)
3036 yylval.tsym.type = base_type;
3043 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
3047 /* cp_lookup_nested_symbol might have accidentally found a constructor
3048 named COPY when we really wanted a base class of the same name.
3049 Double-check this case by looking for a base class. */
3051 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3053 if (base_type != NULL)
3055 yylval.tsym.type = base_type;
3062 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3068 internal_error (__FILE__, __LINE__, _("not reached"));
3071 /* The outer level of a two-level lexer. This calls the inner lexer
3072 to return tokens. It then either returns these tokens, or
3073 aggregates them into a larger token. This lets us work around a
3074 problem in our parsing approach, where the parser could not
3075 distinguish between qualified names and qualified types at the
3078 This approach is still not ideal, because it mishandles template
3079 types. See the comment in lex_one_token for an example. However,
3080 this is still an improvement over the earlier approach, and will
3081 suffice until we move to better parsing technology. */
3086 token_and_value current;
3087 int first_was_coloncolon, last_was_coloncolon;
3088 struct type *context_type = NULL;
3089 int last_to_examine, next_to_examine, checkpoint;
3090 const struct block *search_block;
3091 bool is_quoted_name, last_lex_was_structop;
3093 if (popping && !VEC_empty (token_and_value, token_fifo))
3097 last_lex_was_structop = last_was_structop;
3099 /* Read the first token and decide what to do. Most of the
3100 subsequent code is C++-only; but also depends on seeing a "::" or
3102 current.token = lex_one_token (pstate, &is_quoted_name);
3103 if (current.token == NAME)
3104 current.token = classify_name (pstate, expression_context_block,
3105 is_quoted_name, last_lex_was_structop);
3106 if (parse_language (pstate)->la_language != language_cplus
3107 || (current.token != TYPENAME && current.token != COLONCOLON
3108 && current.token != FILENAME))
3109 return current.token;
3111 /* Read any sequence of alternating "::" and name-like tokens into
3113 current.value = yylval;
3114 VEC_safe_push (token_and_value, token_fifo, ¤t);
3115 last_was_coloncolon = current.token == COLONCOLON;
3120 /* We ignore quoted names other than the very first one.
3121 Subsequent ones do not have any special meaning. */
3122 current.token = lex_one_token (pstate, &ignore);
3123 current.value = yylval;
3124 VEC_safe_push (token_and_value, token_fifo, ¤t);
3126 if ((last_was_coloncolon && current.token != NAME)
3127 || (!last_was_coloncolon && current.token != COLONCOLON))
3129 last_was_coloncolon = !last_was_coloncolon;
3133 /* We always read one extra token, so compute the number of tokens
3134 to examine accordingly. */
3135 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3136 next_to_examine = 0;
3138 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3141 name_obstack.clear ();
3143 if (current.token == FILENAME)
3144 search_block = current.value.bval;
3145 else if (current.token == COLONCOLON)
3146 search_block = NULL;
3149 gdb_assert (current.token == TYPENAME);
3150 search_block = expression_context_block;
3151 obstack_grow (&name_obstack, current.value.sval.ptr,
3152 current.value.sval.length);
3153 context_type = current.value.tsym.type;
3157 first_was_coloncolon = current.token == COLONCOLON;
3158 last_was_coloncolon = first_was_coloncolon;
3160 while (next_to_examine <= last_to_examine)
3162 token_and_value *next;
3164 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3167 if (next->token == NAME && last_was_coloncolon)
3171 yylval = next->value;
3172 classification = classify_inner_name (pstate, search_block,
3174 /* We keep going until we either run out of names, or until
3175 we have a qualified name which is not a type. */
3176 if (classification != TYPENAME && classification != NAME)
3179 /* Accept up to this token. */
3180 checkpoint = next_to_examine;
3182 /* Update the partial name we are constructing. */
3183 if (context_type != NULL)
3185 /* We don't want to put a leading "::" into the name. */
3186 obstack_grow_str (&name_obstack, "::");
3188 obstack_grow (&name_obstack, next->value.sval.ptr,
3189 next->value.sval.length);
3191 yylval.sval.ptr = (const char *) obstack_base (&name_obstack);
3192 yylval.sval.length = obstack_object_size (&name_obstack);
3193 current.value = yylval;
3194 current.token = classification;
3196 last_was_coloncolon = 0;
3198 if (classification == NAME)
3201 context_type = yylval.tsym.type;
3203 else if (next->token == COLONCOLON && !last_was_coloncolon)
3204 last_was_coloncolon = 1;
3207 /* We've reached the end of the name. */
3212 /* If we have a replacement token, install it as the first token in
3213 the FIFO, and delete the other constituent tokens. */
3216 current.value.sval.ptr
3217 = (const char *) obstack_copy0 (&expansion_obstack,
3218 current.value.sval.ptr,
3219 current.value.sval.length);
3221 VEC_replace (token_and_value, token_fifo, 0, ¤t);
3223 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3227 current = *VEC_index (token_and_value, token_fifo, 0);
3228 VEC_ordered_remove (token_and_value, token_fifo, 0);
3229 yylval = current.value;
3230 return current.token;
3234 c_parse (struct parser_state *par_state)
3237 struct cleanup *back_to;
3239 /* Setting up the parser state. */
3240 scoped_restore pstate_restore = make_scoped_restore (&pstate);
3241 gdb_assert (par_state != NULL);
3244 gdb::unique_xmalloc_ptr<struct macro_scope> macro_scope;
3246 if (expression_context_block)
3247 macro_scope = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3249 macro_scope = default_macro_scope ();
3251 macro_scope = user_macro_scope ();
3253 scoped_restore restore_macro_scope
3254 = make_scoped_restore (&expression_macro_scope, macro_scope.get ());
3256 /* Initialize macro expansion code. */
3257 obstack_init (&expansion_obstack);
3258 gdb_assert (! macro_original_text);
3259 /* Note that parsing (within yyparse) freely installs cleanups
3260 assuming they'll be run here (below). */
3261 back_to = make_cleanup (scan_macro_cleanup, 0);
3263 scoped_restore restore_yydebug = make_scoped_restore (&yydebug,
3266 /* Initialize some state used by the lexer. */
3267 last_was_structop = false;
3268 saw_name_at_eof = 0;
3270 VEC_free (token_and_value, token_fifo);
3272 name_obstack.clear ();
3274 result = yyparse ();
3275 do_cleanups (back_to);
3282 /* This is called via the YYPRINT macro when parser debugging is
3283 enabled. It prints a token's value. */
3286 c_print_token (FILE *file, int type, YYSTYPE value)
3291 parser_fprintf (file, "typed_val_int<%s, %s>",
3292 TYPE_SAFE_NAME (value.typed_val_int.type),
3293 pulongest (value.typed_val_int.val));
3299 char *copy = (char *) alloca (value.tsval.length + 1);
3301 memcpy (copy, value.tsval.ptr, value.tsval.length);
3302 copy[value.tsval.length] = '\0';
3304 parser_fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3310 parser_fprintf (file, "sval<%s>", copy_name (value.sval));
3314 parser_fprintf (file, "tsym<type=%s, name=%s>",
3315 TYPE_SAFE_NAME (value.tsym.type),
3316 copy_name (value.tsym.stoken));
3320 case UNKNOWN_CPP_NAME:
3323 parser_fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3324 copy_name (value.ssym.stoken),
3325 (value.ssym.sym.symbol == NULL
3326 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym.symbol)),
3327 value.ssym.is_a_field_of_this);
3331 parser_fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3339 yyerror (const char *msg)
3342 lexptr = prev_lexptr;
3344 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);