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 "c-support.h"
46 #include "bfd.h" /* Required by objfiles.h. */
47 #include "symfile.h" /* Required by objfiles.h. */
48 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
51 #include "cp-support.h"
52 #include "macroscope.h"
53 #include "objc-lang.h"
54 #include "typeprint.h"
57 #define parse_type(ps) builtin_type (parse_gdbarch (ps))
59 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror,
61 #define GDB_YY_REMAP_PREFIX c_
64 /* The state of the parser, used internally when we are parsing the
67 static struct parser_state *pstate = NULL;
71 static int yylex (void);
73 static void yyerror (const char *);
75 static int type_aggregate_p (struct type *);
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. */
96 struct typed_stoken tsval;
100 const struct block *bval;
101 enum exp_opcode opcode;
103 struct stoken_vector svec;
104 VEC (type_ptr) *tvec;
106 struct type_stack *type_stack;
108 struct objc_class_str theclass;
112 /* YYSTYPE gets defined by %union */
113 static int parse_number (struct parser_state *par_state,
114 const char *, int, int, YYSTYPE *);
115 static struct stoken operator_stoken (const char *);
116 static void check_parameter_typelist (VEC (type_ptr) *);
117 static void write_destructor_name (struct parser_state *par_state,
121 static void c_print_token (FILE *file, int type, YYSTYPE value);
122 #define YYPRINT(FILE, TYPE, VALUE) c_print_token (FILE, TYPE, VALUE)
126 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly function_method
128 %type <tval> type typebase
129 %type <tvec> nonempty_typelist func_mod parameter_typelist
130 /* %type <bval> block */
132 /* Fancy type parsing. */
134 %type <lval> array_mod
135 %type <tval> conversion_type_id
137 %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl
139 %token <typed_val_int> INT
140 %token <typed_val_float> FLOAT
142 /* Both NAME and TYPENAME tokens represent symbols in the input,
143 and both convey their data as strings.
144 But a TYPENAME is a string that happens to be defined as a typedef
145 or builtin type name (such as int or char)
146 and a NAME is any other symbol.
147 Contexts where this distinction is not important can use the
148 nonterminal "name", which matches either NAME or TYPENAME. */
150 %token <tsval> STRING
151 %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */
152 %token SELECTOR /* ObjC "@selector" pseudo-operator */
154 %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */
155 %token <ssym> UNKNOWN_CPP_NAME
156 %token <voidval> COMPLETE
157 %token <tsym> TYPENAME
158 %token <theclass> CLASSNAME /* ObjC Class name */
159 %type <sval> name field_name
160 %type <svec> string_exp
161 %type <ssym> name_not_typename
162 %type <tsym> type_name
164 /* This is like a '[' token, but is only generated when parsing
165 Objective C. This lets us reuse the same parser without
166 erroneously parsing ObjC-specific expressions in C. */
169 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
170 but which would parse as a valid number in the current input radix.
171 E.g. "c" when input_radix==16. Depending on the parse, it will be
172 turned into a name or into a number. */
174 %token <ssym> NAME_OR_INT
177 %token STRUCT CLASS UNION ENUM SIZEOF ALIGNOF UNSIGNED COLONCOLON
182 %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
188 /* Special type cases, put in to allow the parser to distinguish different
190 %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
192 %token <sval> VARIABLE
194 %token <opcode> ASSIGN_MODIFY
203 %right '=' ASSIGN_MODIFY
211 %left '<' '>' LEQ GEQ
216 %right UNARY INCREMENT DECREMENT
217 %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '('
218 %token <ssym> BLOCKNAME
219 %token <bval> FILENAME
233 { write_exp_elt_opcode(pstate, OP_TYPE);
234 write_exp_elt_type(pstate, $1);
235 write_exp_elt_opcode(pstate, OP_TYPE);}
238 write_exp_elt_opcode (pstate, OP_TYPEOF);
240 | TYPEOF '(' type ')'
242 write_exp_elt_opcode (pstate, OP_TYPE);
243 write_exp_elt_type (pstate, $3);
244 write_exp_elt_opcode (pstate, OP_TYPE);
246 | DECLTYPE '(' exp ')'
248 write_exp_elt_opcode (pstate, OP_DECLTYPE);
252 /* Expressions, including the comma operator. */
255 { write_exp_elt_opcode (pstate, BINOP_COMMA); }
258 /* Expressions, not including the comma operator. */
259 exp : '*' exp %prec UNARY
260 { write_exp_elt_opcode (pstate, UNOP_IND); }
263 exp : '&' exp %prec UNARY
264 { write_exp_elt_opcode (pstate, UNOP_ADDR); }
267 exp : '-' exp %prec UNARY
268 { write_exp_elt_opcode (pstate, UNOP_NEG); }
271 exp : '+' exp %prec UNARY
272 { write_exp_elt_opcode (pstate, UNOP_PLUS); }
275 exp : '!' exp %prec UNARY
276 { write_exp_elt_opcode (pstate, UNOP_LOGICAL_NOT); }
279 exp : '~' exp %prec UNARY
280 { write_exp_elt_opcode (pstate, UNOP_COMPLEMENT); }
283 exp : INCREMENT exp %prec UNARY
284 { write_exp_elt_opcode (pstate, UNOP_PREINCREMENT); }
287 exp : DECREMENT exp %prec UNARY
288 { write_exp_elt_opcode (pstate, UNOP_PREDECREMENT); }
291 exp : exp INCREMENT %prec UNARY
292 { write_exp_elt_opcode (pstate, UNOP_POSTINCREMENT); }
295 exp : exp DECREMENT %prec UNARY
296 { write_exp_elt_opcode (pstate, UNOP_POSTDECREMENT); }
299 exp : TYPEID '(' exp ')' %prec UNARY
300 { write_exp_elt_opcode (pstate, OP_TYPEID); }
303 exp : TYPEID '(' type_exp ')' %prec UNARY
304 { write_exp_elt_opcode (pstate, OP_TYPEID); }
307 exp : SIZEOF exp %prec UNARY
308 { write_exp_elt_opcode (pstate, UNOP_SIZEOF); }
311 exp : ALIGNOF '(' type_exp ')' %prec UNARY
312 { write_exp_elt_opcode (pstate, UNOP_ALIGNOF); }
315 exp : exp ARROW field_name
316 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
317 write_exp_string (pstate, $3);
318 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
321 exp : exp ARROW field_name COMPLETE
322 { mark_struct_expression (pstate);
323 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
324 write_exp_string (pstate, $3);
325 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
328 exp : exp ARROW COMPLETE
330 mark_struct_expression (pstate);
331 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
334 write_exp_string (pstate, s);
335 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
338 exp : exp ARROW '~' name
339 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
340 write_destructor_name (pstate, $4);
341 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
344 exp : exp ARROW '~' name COMPLETE
345 { mark_struct_expression (pstate);
346 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
347 write_destructor_name (pstate, $4);
348 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
351 exp : exp ARROW qualified_name
352 { /* exp->type::name becomes exp->*(&type::name) */
353 /* Note: this doesn't work if name is a
354 static member! FIXME */
355 write_exp_elt_opcode (pstate, UNOP_ADDR);
356 write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
359 exp : exp ARROW_STAR exp
360 { write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
363 exp : exp '.' field_name
364 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
365 write_exp_string (pstate, $3);
366 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
369 exp : exp '.' field_name COMPLETE
370 { mark_struct_expression (pstate);
371 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
372 write_exp_string (pstate, $3);
373 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
376 exp : exp '.' COMPLETE
378 mark_struct_expression (pstate);
379 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
382 write_exp_string (pstate, s);
383 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
386 exp : exp '.' '~' name
387 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
388 write_destructor_name (pstate, $4);
389 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
392 exp : exp '.' '~' name COMPLETE
393 { mark_struct_expression (pstate);
394 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
395 write_destructor_name (pstate, $4);
396 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
399 exp : exp '.' qualified_name
400 { /* exp.type::name becomes exp.*(&type::name) */
401 /* Note: this doesn't work if name is a
402 static member! FIXME */
403 write_exp_elt_opcode (pstate, UNOP_ADDR);
404 write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
407 exp : exp DOT_STAR exp
408 { write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
411 exp : exp '[' exp1 ']'
412 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
415 exp : exp OBJC_LBRAC exp1 ']'
416 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
420 * The rules below parse ObjC message calls of the form:
421 * '[' target selector {':' argument}* ']'
424 exp : OBJC_LBRAC TYPENAME
428 theclass = lookup_objc_class (parse_gdbarch (pstate),
429 copy_name ($2.stoken));
431 error (_("%s is not an ObjC Class"),
432 copy_name ($2.stoken));
433 write_exp_elt_opcode (pstate, OP_LONG);
434 write_exp_elt_type (pstate,
435 parse_type (pstate)->builtin_int);
436 write_exp_elt_longcst (pstate, (LONGEST) theclass);
437 write_exp_elt_opcode (pstate, OP_LONG);
441 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
442 end_msglist (pstate);
443 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
447 exp : OBJC_LBRAC CLASSNAME
449 write_exp_elt_opcode (pstate, OP_LONG);
450 write_exp_elt_type (pstate,
451 parse_type (pstate)->builtin_int);
452 write_exp_elt_longcst (pstate, (LONGEST) $2.theclass);
453 write_exp_elt_opcode (pstate, OP_LONG);
457 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
458 end_msglist (pstate);
459 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
466 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
467 end_msglist (pstate);
468 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
473 { add_msglist(&$1, 0); }
481 msgarg : name ':' exp
482 { add_msglist(&$1, 1); }
483 | ':' exp /* Unnamed arg. */
484 { add_msglist(0, 1); }
485 | ',' exp /* Variable number of args. */
486 { add_msglist(0, 0); }
490 /* This is to save the value of arglist_len
491 being accumulated by an outer function call. */
492 { start_arglist (); }
493 arglist ')' %prec ARROW
494 { write_exp_elt_opcode (pstate, OP_FUNCALL);
495 write_exp_elt_longcst (pstate,
496 (LONGEST) end_arglist ());
497 write_exp_elt_opcode (pstate, OP_FUNCALL); }
500 /* This is here to disambiguate with the production for
501 "func()::static_var" further below, which uses
502 function_method_void. */
503 exp : exp '(' ')' %prec ARROW
505 write_exp_elt_opcode (pstate, OP_FUNCALL);
506 write_exp_elt_longcst (pstate,
507 (LONGEST) end_arglist ());
508 write_exp_elt_opcode (pstate, OP_FUNCALL); }
512 exp : UNKNOWN_CPP_NAME '('
514 /* This could potentially be a an argument defined
515 lookup function (Koenig). */
516 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
517 write_exp_elt_block (pstate,
518 expression_context_block);
519 write_exp_elt_sym (pstate,
520 NULL); /* Placeholder. */
521 write_exp_string (pstate, $1.stoken);
522 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
524 /* This is to save the value of arglist_len
525 being accumulated by an outer function call. */
529 arglist ')' %prec ARROW
531 write_exp_elt_opcode (pstate, OP_FUNCALL);
532 write_exp_elt_longcst (pstate,
533 (LONGEST) end_arglist ());
534 write_exp_elt_opcode (pstate, OP_FUNCALL);
539 { start_arglist (); }
549 arglist : arglist ',' exp %prec ABOVE_COMMA
553 function_method: exp '(' parameter_typelist ')' const_or_volatile
555 VEC (type_ptr) *type_list = $3;
556 struct type *type_elt;
557 LONGEST len = VEC_length (type_ptr, type_list);
559 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
560 /* Save the const/volatile qualifiers as
561 recorded by the const_or_volatile
562 production's actions. */
563 write_exp_elt_longcst (pstate,
564 follow_type_instance_flags ());
565 write_exp_elt_longcst (pstate, len);
567 VEC_iterate (type_ptr, type_list, i, type_elt);
569 write_exp_elt_type (pstate, type_elt);
570 write_exp_elt_longcst(pstate, len);
571 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
572 VEC_free (type_ptr, type_list);
576 function_method_void: exp '(' ')' const_or_volatile
577 { write_exp_elt_opcode (pstate, TYPE_INSTANCE);
579 write_exp_elt_longcst (pstate,
580 follow_type_instance_flags ());
581 write_exp_elt_longcst (pstate, 0);
582 write_exp_elt_longcst (pstate, 0);
583 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
587 exp : function_method
590 /* Normally we must interpret "func()" as a function call, instead of
591 a type. The user needs to write func(void) to disambiguate.
592 However, in the "func()::static_var" case, there's no
594 function_method_void_or_typelist: function_method
595 | function_method_void
598 exp : function_method_void_or_typelist COLONCOLON name
600 write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR);
601 write_exp_string (pstate, $3);
602 write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR);
607 { $$ = end_arglist () - 1; }
609 exp : lcurly arglist rcurly %prec ARROW
610 { write_exp_elt_opcode (pstate, OP_ARRAY);
611 write_exp_elt_longcst (pstate, (LONGEST) 0);
612 write_exp_elt_longcst (pstate, (LONGEST) $3);
613 write_exp_elt_opcode (pstate, OP_ARRAY); }
616 exp : lcurly type_exp rcurly exp %prec UNARY
617 { write_exp_elt_opcode (pstate, UNOP_MEMVAL_TYPE); }
620 exp : '(' type_exp ')' exp %prec UNARY
621 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
628 /* Binary operators in order of decreasing precedence. */
631 { write_exp_elt_opcode (pstate, BINOP_REPEAT); }
635 { write_exp_elt_opcode (pstate, BINOP_MUL); }
639 { write_exp_elt_opcode (pstate, BINOP_DIV); }
643 { write_exp_elt_opcode (pstate, BINOP_REM); }
647 { write_exp_elt_opcode (pstate, BINOP_ADD); }
651 { write_exp_elt_opcode (pstate, BINOP_SUB); }
655 { write_exp_elt_opcode (pstate, BINOP_LSH); }
659 { write_exp_elt_opcode (pstate, BINOP_RSH); }
663 { write_exp_elt_opcode (pstate, BINOP_EQUAL); }
666 exp : exp NOTEQUAL exp
667 { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); }
671 { write_exp_elt_opcode (pstate, BINOP_LEQ); }
675 { write_exp_elt_opcode (pstate, BINOP_GEQ); }
679 { write_exp_elt_opcode (pstate, BINOP_LESS); }
683 { write_exp_elt_opcode (pstate, BINOP_GTR); }
687 { write_exp_elt_opcode (pstate, BINOP_BITWISE_AND); }
691 { write_exp_elt_opcode (pstate, BINOP_BITWISE_XOR); }
695 { write_exp_elt_opcode (pstate, BINOP_BITWISE_IOR); }
699 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); }
703 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); }
706 exp : exp '?' exp ':' exp %prec '?'
707 { write_exp_elt_opcode (pstate, TERNOP_COND); }
711 { write_exp_elt_opcode (pstate, BINOP_ASSIGN); }
714 exp : exp ASSIGN_MODIFY exp
715 { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY);
716 write_exp_elt_opcode (pstate, $2);
717 write_exp_elt_opcode (pstate,
718 BINOP_ASSIGN_MODIFY); }
722 { write_exp_elt_opcode (pstate, OP_LONG);
723 write_exp_elt_type (pstate, $1.type);
724 write_exp_elt_longcst (pstate, (LONGEST) ($1.val));
725 write_exp_elt_opcode (pstate, OP_LONG); }
730 struct stoken_vector vec;
733 write_exp_string_vector (pstate, $1.type, &vec);
739 parse_number (pstate, $1.stoken.ptr,
740 $1.stoken.length, 0, &val);
741 write_exp_elt_opcode (pstate, OP_LONG);
742 write_exp_elt_type (pstate, val.typed_val_int.type);
743 write_exp_elt_longcst (pstate,
744 (LONGEST) val.typed_val_int.val);
745 write_exp_elt_opcode (pstate, OP_LONG);
751 { write_exp_elt_opcode (pstate, OP_FLOAT);
752 write_exp_elt_type (pstate, $1.type);
753 write_exp_elt_floatcst (pstate, $1.val);
754 write_exp_elt_opcode (pstate, OP_FLOAT); }
762 write_dollar_variable (pstate, $1);
766 exp : SELECTOR '(' name ')'
768 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR);
769 write_exp_string (pstate, $3);
770 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); }
773 exp : SIZEOF '(' type ')' %prec UNARY
774 { struct type *type = $3;
775 write_exp_elt_opcode (pstate, OP_LONG);
776 write_exp_elt_type (pstate, lookup_signed_typename
777 (parse_language (pstate),
778 parse_gdbarch (pstate),
780 type = check_typedef (type);
782 /* $5.3.3/2 of the C++ Standard (n3290 draft)
783 says of sizeof: "When applied to a reference
784 or a reference type, the result is the size of
785 the referenced type." */
786 if (TYPE_IS_REFERENCE (type))
787 type = check_typedef (TYPE_TARGET_TYPE (type));
788 write_exp_elt_longcst (pstate,
789 (LONGEST) TYPE_LENGTH (type));
790 write_exp_elt_opcode (pstate, OP_LONG); }
793 exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
794 { write_exp_elt_opcode (pstate,
795 UNOP_REINTERPRET_CAST); }
798 exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
799 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
802 exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
803 { write_exp_elt_opcode (pstate, UNOP_DYNAMIC_CAST); }
806 exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
807 { /* We could do more error checking here, but
808 it doesn't seem worthwhile. */
809 write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
815 /* We copy the string here, and not in the
816 lexer, to guarantee that we do not leak a
817 string. Note that we follow the
818 NUL-termination convention of the
820 struct typed_stoken *vec = XNEW (struct typed_stoken);
825 vec->length = $1.length;
826 vec->ptr = (char *) malloc ($1.length + 1);
827 memcpy (vec->ptr, $1.ptr, $1.length + 1);
832 /* Note that we NUL-terminate here, but just
836 $$.tokens = XRESIZEVEC (struct typed_stoken,
839 p = (char *) malloc ($2.length + 1);
840 memcpy (p, $2.ptr, $2.length + 1);
842 $$.tokens[$$.len - 1].type = $2.type;
843 $$.tokens[$$.len - 1].length = $2.length;
844 $$.tokens[$$.len - 1].ptr = p;
851 c_string_type type = C_STRING;
853 for (i = 0; i < $1.len; ++i)
855 switch ($1.tokens[i].type)
863 && type != $1.tokens[i].type)
864 error (_("Undefined string concatenation."));
865 type = (enum c_string_type_values) $1.tokens[i].type;
869 internal_error (__FILE__, __LINE__,
870 "unrecognized type in string concatenation");
874 write_exp_string_vector (pstate, type, &$1);
875 for (i = 0; i < $1.len; ++i)
876 free ($1.tokens[i].ptr);
881 exp : NSSTRING /* ObjC NextStep NSString constant
882 * of the form '@' '"' string '"'.
884 { write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING);
885 write_exp_string (pstate, $1);
886 write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); }
891 { write_exp_elt_opcode (pstate, OP_LONG);
892 write_exp_elt_type (pstate,
893 parse_type (pstate)->builtin_bool);
894 write_exp_elt_longcst (pstate, (LONGEST) 1);
895 write_exp_elt_opcode (pstate, OP_LONG); }
899 { write_exp_elt_opcode (pstate, OP_LONG);
900 write_exp_elt_type (pstate,
901 parse_type (pstate)->builtin_bool);
902 write_exp_elt_longcst (pstate, (LONGEST) 0);
903 write_exp_elt_opcode (pstate, OP_LONG); }
911 $$ = SYMBOL_BLOCK_VALUE ($1.sym.symbol);
913 error (_("No file or function \"%s\"."),
914 copy_name ($1.stoken));
922 block : block COLONCOLON name
924 = lookup_symbol (copy_name ($3), $1,
925 VAR_DOMAIN, NULL).symbol;
927 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
928 error (_("No function \"%s\" in specified context."),
930 $$ = SYMBOL_BLOCK_VALUE (tem); }
933 variable: name_not_typename ENTRY
934 { struct symbol *sym = $1.sym.symbol;
936 if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym)
937 || !symbol_read_needs_frame (sym))
938 error (_("@entry can be used only for function "
939 "parameters, not for \"%s\""),
940 copy_name ($1.stoken));
942 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
943 write_exp_elt_sym (pstate, sym);
944 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
948 variable: block COLONCOLON name
949 { struct block_symbol sym
950 = lookup_symbol (copy_name ($3), $1,
954 error (_("No symbol \"%s\" in specified context."),
956 if (symbol_read_needs_frame (sym.symbol))
958 innermost_block.update (sym);
960 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
961 write_exp_elt_block (pstate, sym.block);
962 write_exp_elt_sym (pstate, sym.symbol);
963 write_exp_elt_opcode (pstate, OP_VAR_VALUE); }
966 qualified_name: TYPENAME COLONCOLON name
968 struct type *type = $1.type;
969 type = check_typedef (type);
970 if (!type_aggregate_p (type))
971 error (_("`%s' is not defined as an aggregate type."),
972 TYPE_SAFE_NAME (type));
974 write_exp_elt_opcode (pstate, OP_SCOPE);
975 write_exp_elt_type (pstate, type);
976 write_exp_string (pstate, $3);
977 write_exp_elt_opcode (pstate, OP_SCOPE);
979 | TYPENAME COLONCOLON '~' name
981 struct type *type = $1.type;
982 struct stoken tmp_token;
985 type = check_typedef (type);
986 if (!type_aggregate_p (type))
987 error (_("`%s' is not defined as an aggregate type."),
988 TYPE_SAFE_NAME (type));
989 buf = (char *) alloca ($4.length + 2);
991 tmp_token.length = $4.length + 1;
993 memcpy (buf+1, $4.ptr, $4.length);
994 buf[tmp_token.length] = 0;
996 /* Check for valid destructor name. */
997 destructor_name_p (tmp_token.ptr, $1.type);
998 write_exp_elt_opcode (pstate, OP_SCOPE);
999 write_exp_elt_type (pstate, type);
1000 write_exp_string (pstate, tmp_token);
1001 write_exp_elt_opcode (pstate, OP_SCOPE);
1003 | TYPENAME COLONCOLON name COLONCOLON name
1005 char *copy = copy_name ($3);
1006 error (_("No type \"%s\" within class "
1007 "or namespace \"%s\"."),
1008 copy, TYPE_SAFE_NAME ($1.type));
1012 variable: qualified_name
1013 | COLONCOLON name_not_typename
1015 char *name = copy_name ($2.stoken);
1017 struct bound_minimal_symbol msymbol;
1020 = lookup_symbol (name, (const struct block *) NULL,
1021 VAR_DOMAIN, NULL).symbol;
1024 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1025 write_exp_elt_block (pstate, NULL);
1026 write_exp_elt_sym (pstate, sym);
1027 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1031 msymbol = lookup_bound_minimal_symbol (name);
1032 if (msymbol.minsym != NULL)
1033 write_exp_msymbol (pstate, msymbol);
1034 else if (!have_full_symbols () && !have_partial_symbols ())
1035 error (_("No symbol table is loaded. Use the \"file\" command."));
1037 error (_("No symbol \"%s\" in current context."), name);
1041 variable: name_not_typename
1042 { struct block_symbol sym = $1.sym;
1046 if (symbol_read_needs_frame (sym.symbol))
1047 innermost_block.update (sym);
1049 /* If we found a function, see if it's
1050 an ifunc resolver that has the same
1051 address as the ifunc symbol itself.
1052 If so, prefer the ifunc symbol. */
1054 bound_minimal_symbol resolver
1055 = find_gnu_ifunc (sym.symbol);
1056 if (resolver.minsym != NULL)
1057 write_exp_msymbol (pstate, resolver);
1060 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1061 write_exp_elt_block (pstate, sym.block);
1062 write_exp_elt_sym (pstate, sym.symbol);
1063 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1066 else if ($1.is_a_field_of_this)
1068 /* C++: it hangs off of `this'. Must
1069 not inadvertently convert from a method call
1071 innermost_block.update (sym);
1072 write_exp_elt_opcode (pstate, OP_THIS);
1073 write_exp_elt_opcode (pstate, OP_THIS);
1074 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1075 write_exp_string (pstate, $1.stoken);
1076 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1080 char *arg = copy_name ($1.stoken);
1082 bound_minimal_symbol msymbol
1083 = lookup_bound_minimal_symbol (arg);
1084 if (msymbol.minsym == NULL)
1086 if (!have_full_symbols () && !have_partial_symbols ())
1087 error (_("No symbol table is loaded. Use the \"file\" command."));
1089 error (_("No symbol \"%s\" in current context."),
1090 copy_name ($1.stoken));
1093 /* This minsym might be an alias for
1094 another function. See if we can find
1095 the debug symbol for the target, and
1096 if so, use it instead, since it has
1097 return type / prototype info. This
1098 is important for example for "p
1099 *__errno_location()". */
1100 symbol *alias_target
1101 = ((msymbol.minsym->type != mst_text_gnu_ifunc
1102 && msymbol.minsym->type != mst_data_gnu_ifunc)
1103 ? find_function_alias_target (msymbol)
1105 if (alias_target != NULL)
1107 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1109 (pstate, SYMBOL_BLOCK_VALUE (alias_target));
1110 write_exp_elt_sym (pstate, alias_target);
1111 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1114 write_exp_msymbol (pstate, msymbol);
1119 space_identifier : '@' NAME
1120 { insert_type_address_space (pstate, copy_name ($2.stoken)); }
1123 const_or_volatile: const_or_volatile_noopt
1127 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1130 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1131 | const_or_volatile_noopt
1134 const_or_volatile_or_space_identifier:
1135 const_or_volatile_or_space_identifier_noopt
1141 { insert_type (tp_pointer); }
1142 const_or_volatile_or_space_identifier
1144 { insert_type (tp_pointer); }
1145 const_or_volatile_or_space_identifier
1147 { insert_type (tp_reference); }
1149 { insert_type (tp_reference); }
1151 { insert_type (tp_rvalue_reference); }
1152 | ANDAND ptr_operator
1153 { insert_type (tp_rvalue_reference); }
1156 ptr_operator_ts: ptr_operator
1158 $$ = get_type_stack ();
1159 /* This cleanup is eventually run by
1161 make_cleanup (type_stack_cleanup, $$);
1165 abs_decl: ptr_operator_ts direct_abs_decl
1166 { $$ = append_type_stack ($2, $1); }
1171 direct_abs_decl: '(' abs_decl ')'
1173 | direct_abs_decl array_mod
1175 push_type_stack ($1);
1177 push_type (tp_array);
1178 $$ = get_type_stack ();
1183 push_type (tp_array);
1184 $$ = get_type_stack ();
1187 | direct_abs_decl func_mod
1189 push_type_stack ($1);
1191 $$ = get_type_stack ();
1196 $$ = get_type_stack ();
1206 | OBJC_LBRAC INT ']'
1212 | '(' parameter_typelist ')'
1216 /* We used to try to recognize pointer to member types here, but
1217 that didn't work (shift/reduce conflicts meant that these rules never
1218 got executed). The problem is that
1219 int (foo::bar::baz::bizzle)
1220 is a function type but
1221 int (foo::bar::baz::bizzle::*)
1222 is a pointer to member type. Stroustrup loses again! */
1227 /* Implements (approximately): (type-qualifier)* type-specifier.
1229 When type-specifier is only ever a single word, like 'float' then these
1230 arrive as pre-built TYPENAME tokens thanks to the classify_name
1231 function. However, when a type-specifier can contain multiple words,
1232 for example 'double' can appear as just 'double' or 'long double', and
1233 similarly 'long' can appear as just 'long' or in 'long double', then
1234 these type-specifiers are parsed into their own tokens in the function
1235 lex_one_token and the ident_tokens array. These separate tokens are all
1241 { $$ = lookup_signed_typename (parse_language (pstate),
1242 parse_gdbarch (pstate),
1245 { $$ = lookup_signed_typename (parse_language (pstate),
1246 parse_gdbarch (pstate),
1249 { $$ = lookup_signed_typename (parse_language (pstate),
1250 parse_gdbarch (pstate),
1253 { $$ = lookup_signed_typename (parse_language (pstate),
1254 parse_gdbarch (pstate),
1256 | LONG SIGNED_KEYWORD INT_KEYWORD
1257 { $$ = lookup_signed_typename (parse_language (pstate),
1258 parse_gdbarch (pstate),
1260 | LONG SIGNED_KEYWORD
1261 { $$ = lookup_signed_typename (parse_language (pstate),
1262 parse_gdbarch (pstate),
1264 | SIGNED_KEYWORD LONG INT_KEYWORD
1265 { $$ = lookup_signed_typename (parse_language (pstate),
1266 parse_gdbarch (pstate),
1268 | UNSIGNED LONG INT_KEYWORD
1269 { $$ = lookup_unsigned_typename (parse_language (pstate),
1270 parse_gdbarch (pstate),
1272 | LONG UNSIGNED INT_KEYWORD
1273 { $$ = lookup_unsigned_typename (parse_language (pstate),
1274 parse_gdbarch (pstate),
1277 { $$ = lookup_unsigned_typename (parse_language (pstate),
1278 parse_gdbarch (pstate),
1281 { $$ = lookup_signed_typename (parse_language (pstate),
1282 parse_gdbarch (pstate),
1284 | LONG LONG INT_KEYWORD
1285 { $$ = lookup_signed_typename (parse_language (pstate),
1286 parse_gdbarch (pstate),
1288 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1289 { $$ = lookup_signed_typename (parse_language (pstate),
1290 parse_gdbarch (pstate),
1292 | LONG LONG SIGNED_KEYWORD
1293 { $$ = lookup_signed_typename (parse_language (pstate),
1294 parse_gdbarch (pstate),
1296 | SIGNED_KEYWORD LONG LONG
1297 { $$ = lookup_signed_typename (parse_language (pstate),
1298 parse_gdbarch (pstate),
1300 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1301 { $$ = lookup_signed_typename (parse_language (pstate),
1302 parse_gdbarch (pstate),
1304 | UNSIGNED LONG LONG
1305 { $$ = lookup_unsigned_typename (parse_language (pstate),
1306 parse_gdbarch (pstate),
1308 | UNSIGNED LONG LONG INT_KEYWORD
1309 { $$ = lookup_unsigned_typename (parse_language (pstate),
1310 parse_gdbarch (pstate),
1312 | LONG LONG UNSIGNED
1313 { $$ = lookup_unsigned_typename (parse_language (pstate),
1314 parse_gdbarch (pstate),
1316 | LONG LONG UNSIGNED INT_KEYWORD
1317 { $$ = lookup_unsigned_typename (parse_language (pstate),
1318 parse_gdbarch (pstate),
1321 { $$ = lookup_signed_typename (parse_language (pstate),
1322 parse_gdbarch (pstate),
1324 | SHORT SIGNED_KEYWORD INT_KEYWORD
1325 { $$ = lookup_signed_typename (parse_language (pstate),
1326 parse_gdbarch (pstate),
1328 | SHORT SIGNED_KEYWORD
1329 { $$ = lookup_signed_typename (parse_language (pstate),
1330 parse_gdbarch (pstate),
1332 | UNSIGNED SHORT INT_KEYWORD
1333 { $$ = lookup_unsigned_typename (parse_language (pstate),
1334 parse_gdbarch (pstate),
1337 { $$ = lookup_unsigned_typename (parse_language (pstate),
1338 parse_gdbarch (pstate),
1340 | SHORT UNSIGNED INT_KEYWORD
1341 { $$ = lookup_unsigned_typename (parse_language (pstate),
1342 parse_gdbarch (pstate),
1345 { $$ = lookup_typename (parse_language (pstate),
1346 parse_gdbarch (pstate),
1348 (struct block *) NULL,
1350 | LONG DOUBLE_KEYWORD
1351 { $$ = lookup_typename (parse_language (pstate),
1352 parse_gdbarch (pstate),
1354 (struct block *) NULL,
1357 { $$ = lookup_struct (copy_name ($2),
1358 expression_context_block); }
1361 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1364 | STRUCT name COMPLETE
1366 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1371 { $$ = lookup_struct (copy_name ($2),
1372 expression_context_block); }
1375 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1378 | CLASS name COMPLETE
1380 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1385 { $$ = lookup_union (copy_name ($2),
1386 expression_context_block); }
1389 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1392 | UNION name COMPLETE
1394 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1399 { $$ = lookup_enum (copy_name ($2),
1400 expression_context_block); }
1403 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1406 | ENUM name COMPLETE
1408 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1412 | UNSIGNED type_name
1413 { $$ = lookup_unsigned_typename (parse_language (pstate),
1414 parse_gdbarch (pstate),
1415 TYPE_NAME($2.type)); }
1417 { $$ = lookup_unsigned_typename (parse_language (pstate),
1418 parse_gdbarch (pstate),
1420 | SIGNED_KEYWORD type_name
1421 { $$ = lookup_signed_typename (parse_language (pstate),
1422 parse_gdbarch (pstate),
1423 TYPE_NAME($2.type)); }
1425 { $$ = lookup_signed_typename (parse_language (pstate),
1426 parse_gdbarch (pstate),
1428 /* It appears that this rule for templates is never
1429 reduced; template recognition happens by lookahead
1430 in the token processing code in yylex. */
1431 | TEMPLATE name '<' type '>'
1432 { $$ = lookup_template_type(copy_name($2), $4,
1433 expression_context_block);
1435 | const_or_volatile_or_space_identifier_noopt typebase
1436 { $$ = follow_types ($2); }
1437 | typebase const_or_volatile_or_space_identifier_noopt
1438 { $$ = follow_types ($1); }
1444 $$.stoken.ptr = "int";
1445 $$.stoken.length = 3;
1446 $$.type = lookup_signed_typename (parse_language (pstate),
1447 parse_gdbarch (pstate),
1452 $$.stoken.ptr = "long";
1453 $$.stoken.length = 4;
1454 $$.type = lookup_signed_typename (parse_language (pstate),
1455 parse_gdbarch (pstate),
1460 $$.stoken.ptr = "short";
1461 $$.stoken.length = 5;
1462 $$.type = lookup_signed_typename (parse_language (pstate),
1463 parse_gdbarch (pstate),
1470 { check_parameter_typelist ($1); }
1471 | nonempty_typelist ',' DOTDOTDOT
1473 VEC_safe_push (type_ptr, $1, NULL);
1474 check_parameter_typelist ($1);
1482 VEC (type_ptr) *typelist = NULL;
1483 VEC_safe_push (type_ptr, typelist, $1);
1486 | nonempty_typelist ',' type
1488 VEC_safe_push (type_ptr, $1, $3);
1496 push_type_stack ($2);
1497 $$ = follow_types ($1);
1501 conversion_type_id: typebase conversion_declarator
1502 { $$ = follow_types ($1); }
1505 conversion_declarator: /* Nothing. */
1506 | ptr_operator conversion_declarator
1509 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1510 | VOLATILE_KEYWORD CONST_KEYWORD
1513 const_or_volatile_noopt: const_and_volatile
1514 { insert_type (tp_const);
1515 insert_type (tp_volatile);
1518 { insert_type (tp_const); }
1520 { insert_type (tp_volatile); }
1524 { $$ = operator_stoken (" new"); }
1526 { $$ = operator_stoken (" delete"); }
1527 | OPERATOR NEW '[' ']'
1528 { $$ = operator_stoken (" new[]"); }
1529 | OPERATOR DELETE '[' ']'
1530 { $$ = operator_stoken (" delete[]"); }
1531 | OPERATOR NEW OBJC_LBRAC ']'
1532 { $$ = operator_stoken (" new[]"); }
1533 | OPERATOR DELETE OBJC_LBRAC ']'
1534 { $$ = operator_stoken (" delete[]"); }
1536 { $$ = operator_stoken ("+"); }
1538 { $$ = operator_stoken ("-"); }
1540 { $$ = operator_stoken ("*"); }
1542 { $$ = operator_stoken ("/"); }
1544 { $$ = operator_stoken ("%"); }
1546 { $$ = operator_stoken ("^"); }
1548 { $$ = operator_stoken ("&"); }
1550 { $$ = operator_stoken ("|"); }
1552 { $$ = operator_stoken ("~"); }
1554 { $$ = operator_stoken ("!"); }
1556 { $$ = operator_stoken ("="); }
1558 { $$ = operator_stoken ("<"); }
1560 { $$ = operator_stoken (">"); }
1561 | OPERATOR ASSIGN_MODIFY
1562 { const char *op = " unknown";
1586 case BINOP_BITWISE_IOR:
1589 case BINOP_BITWISE_AND:
1592 case BINOP_BITWISE_XOR:
1599 $$ = operator_stoken (op);
1602 { $$ = operator_stoken ("<<"); }
1604 { $$ = operator_stoken (">>"); }
1606 { $$ = operator_stoken ("=="); }
1608 { $$ = operator_stoken ("!="); }
1610 { $$ = operator_stoken ("<="); }
1612 { $$ = operator_stoken (">="); }
1614 { $$ = operator_stoken ("&&"); }
1616 { $$ = operator_stoken ("||"); }
1617 | OPERATOR INCREMENT
1618 { $$ = operator_stoken ("++"); }
1619 | OPERATOR DECREMENT
1620 { $$ = operator_stoken ("--"); }
1622 { $$ = operator_stoken (","); }
1623 | OPERATOR ARROW_STAR
1624 { $$ = operator_stoken ("->*"); }
1626 { $$ = operator_stoken ("->"); }
1628 { $$ = operator_stoken ("()"); }
1630 { $$ = operator_stoken ("[]"); }
1631 | OPERATOR OBJC_LBRAC ']'
1632 { $$ = operator_stoken ("[]"); }
1633 | OPERATOR conversion_type_id
1636 c_print_type ($2, NULL, &buf, -1, 0,
1637 &type_print_raw_options);
1639 /* This also needs canonicalization. */
1641 = cp_canonicalize_string (buf.c_str ());
1643 canon = std::move (buf.string ());
1644 $$ = operator_stoken ((" " + canon).c_str ());
1653 name : NAME { $$ = $1.stoken; }
1654 | BLOCKNAME { $$ = $1.stoken; }
1655 | TYPENAME { $$ = $1.stoken; }
1656 | NAME_OR_INT { $$ = $1.stoken; }
1657 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1661 name_not_typename : NAME
1663 /* These would be useful if name_not_typename was useful, but it is just
1664 a fake for "variable", so these cause reduce/reduce conflicts because
1665 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1666 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1667 context where only a name could occur, this might be useful.
1672 struct field_of_this_result is_a_field_of_this;
1675 $$.sym = lookup_symbol ($1.ptr,
1676 expression_context_block,
1678 &is_a_field_of_this);
1679 $$.is_a_field_of_this
1680 = is_a_field_of_this.type != NULL;
1687 /* Like write_exp_string, but prepends a '~'. */
1690 write_destructor_name (struct parser_state *par_state, struct stoken token)
1692 char *copy = (char *) alloca (token.length + 1);
1695 memcpy (©[1], token.ptr, token.length);
1700 write_exp_string (par_state, token);
1703 /* Returns a stoken of the operator name given by OP (which does not
1704 include the string "operator"). */
1706 static struct stoken
1707 operator_stoken (const char *op)
1709 struct stoken st = { NULL, 0 };
1712 st.length = CP_OPERATOR_LEN + strlen (op);
1713 buf = (char *) malloc (st.length + 1);
1714 strcpy (buf, CP_OPERATOR_STR);
1718 /* The toplevel (c_parse) will free the memory allocated here. */
1719 make_cleanup (free, buf);
1723 /* Return true if the type is aggregate-like. */
1726 type_aggregate_p (struct type *type)
1728 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1729 || TYPE_CODE (type) == TYPE_CODE_UNION
1730 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1731 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1732 && TYPE_DECLARED_CLASS (type)));
1735 /* Validate a parameter typelist. */
1738 check_parameter_typelist (VEC (type_ptr) *params)
1743 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1745 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1749 if (VEC_length (type_ptr, params) == 1)
1754 VEC_free (type_ptr, params);
1755 error (_("parameter types following 'void'"));
1759 VEC_free (type_ptr, params);
1760 error (_("'void' invalid as parameter type"));
1766 /* Take care of parsing a number (anything that starts with a digit).
1767 Set yylval and return the token type; update lexptr.
1768 LEN is the number of characters in it. */
1770 /*** Needs some error checking for the float case ***/
1773 parse_number (struct parser_state *par_state,
1774 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1782 int base = input_radix;
1785 /* Number of "L" suffixes encountered. */
1788 /* We have found a "L" or "U" suffix. */
1789 int found_suffix = 0;
1792 struct type *signed_type;
1793 struct type *unsigned_type;
1796 p = (char *) alloca (len);
1797 memcpy (p, buf, len);
1801 /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */
1802 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1804 putithere->typed_val_float.type
1805 = parse_type (par_state)->builtin_decfloat;
1808 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1810 putithere->typed_val_float.type
1811 = parse_type (par_state)->builtin_decdouble;
1814 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1816 putithere->typed_val_float.type
1817 = parse_type (par_state)->builtin_declong;
1820 /* Handle suffixes: 'f' for float, 'l' for long double. */
1821 else if (len >= 1 && TOLOWER (p[len - 1]) == 'f')
1823 putithere->typed_val_float.type
1824 = parse_type (par_state)->builtin_float;
1827 else if (len >= 1 && TOLOWER (p[len - 1]) == 'l')
1829 putithere->typed_val_float.type
1830 = parse_type (par_state)->builtin_long_double;
1833 /* Default type for floating-point literals is double. */
1836 putithere->typed_val_float.type
1837 = parse_type (par_state)->builtin_double;
1840 if (!parse_float (p, len,
1841 putithere->typed_val_float.type,
1842 putithere->typed_val_float.val))
1847 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1848 if (p[0] == '0' && len > 1)
1891 if (c >= 'A' && c <= 'Z')
1893 if (c != 'l' && c != 'u')
1895 if (c >= '0' && c <= '9')
1903 if (base > 10 && c >= 'a' && c <= 'f')
1907 n += i = c - 'a' + 10;
1920 return ERROR; /* Char not a digit */
1923 return ERROR; /* Invalid digit in this base */
1925 /* Portably test for overflow (only works for nonzero values, so make
1926 a second check for zero). FIXME: Can't we just make n and prevn
1927 unsigned and avoid this? */
1928 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1929 unsigned_p = 1; /* Try something unsigned */
1931 /* Portably test for unsigned overflow.
1932 FIXME: This check is wrong; for example it doesn't find overflow
1933 on 0x123456789 when LONGEST is 32 bits. */
1934 if (c != 'l' && c != 'u' && n != 0)
1936 if (unsigned_p && prevn >= n)
1937 error (_("Numeric constant too large."));
1942 /* An integer constant is an int, a long, or a long long. An L
1943 suffix forces it to be long; an LL suffix forces it to be long
1944 long. If not forced to a larger size, it gets the first type of
1945 the above that it fits in. To figure out whether it fits, we
1946 shift it right and see whether anything remains. Note that we
1947 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1948 operation, because many compilers will warn about such a shift
1949 (which always produces a zero result). Sometimes gdbarch_int_bit
1950 or gdbarch_long_bit will be that big, sometimes not. To deal with
1951 the case where it is we just always shift the value more than
1952 once, with fewer bits each time. */
1956 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1959 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1961 /* A large decimal (not hex or octal) constant (between INT_MAX
1962 and UINT_MAX) is a long or unsigned long, according to ANSI,
1963 never an unsigned int, but this code treats it as unsigned
1964 int. This probably should be fixed. GCC gives a warning on
1967 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1968 signed_type = parse_type (par_state)->builtin_int;
1970 else if (long_p <= 1
1971 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1974 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1975 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1976 signed_type = parse_type (par_state)->builtin_long;
1981 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1982 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1983 /* A long long does not fit in a LONGEST. */
1984 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1986 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1987 high_bit = (ULONGEST) 1 << shift;
1988 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1989 signed_type = parse_type (par_state)->builtin_long_long;
1992 putithere->typed_val_int.val = n;
1994 /* If the high bit of the worked out type is set then this number
1995 has to be unsigned. */
1997 if (unsigned_p || (n & high_bit))
1999 putithere->typed_val_int.type = unsigned_type;
2003 putithere->typed_val_int.type = signed_type;
2009 /* Temporary obstack used for holding strings. */
2010 static struct obstack tempbuf;
2011 static int tempbuf_init;
2013 /* Parse a C escape sequence. The initial backslash of the sequence
2014 is at (*PTR)[-1]. *PTR will be updated to point to just after the
2015 last character of the sequence. If OUTPUT is not NULL, the
2016 translated form of the escape sequence will be written there. If
2017 OUTPUT is NULL, no output is written and the call will only affect
2018 *PTR. If an escape sequence is expressed in target bytes, then the
2019 entire sequence will simply be copied to OUTPUT. Return 1 if any
2020 character was emitted, 0 otherwise. */
2023 c_parse_escape (const char **ptr, struct obstack *output)
2025 const char *tokptr = *ptr;
2028 /* Some escape sequences undergo character set conversion. Those we
2032 /* Hex escapes do not undergo character set conversion, so keep
2033 the escape sequence for later. */
2036 obstack_grow_str (output, "\\x");
2038 if (!ISXDIGIT (*tokptr))
2039 error (_("\\x escape without a following hex digit"));
2040 while (ISXDIGIT (*tokptr))
2043 obstack_1grow (output, *tokptr);
2048 /* Octal escapes do not undergo character set conversion, so
2049 keep the escape sequence for later. */
2061 obstack_grow_str (output, "\\");
2063 i < 3 && ISDIGIT (*tokptr) && *tokptr != '8' && *tokptr != '9';
2067 obstack_1grow (output, *tokptr);
2073 /* We handle UCNs later. We could handle them here, but that
2074 would mean a spurious error in the case where the UCN could
2075 be converted to the target charset but not the host
2081 int i, len = c == 'U' ? 8 : 4;
2084 obstack_1grow (output, '\\');
2085 obstack_1grow (output, *tokptr);
2088 if (!ISXDIGIT (*tokptr))
2089 error (_("\\%c escape without a following hex digit"), c);
2090 for (i = 0; i < len && ISXDIGIT (*tokptr); ++i)
2093 obstack_1grow (output, *tokptr);
2099 /* We must pass backslash through so that it does not
2100 cause quoting during the second expansion. */
2103 obstack_grow_str (output, "\\\\");
2107 /* Escapes which undergo conversion. */
2110 obstack_1grow (output, '\a');
2115 obstack_1grow (output, '\b');
2120 obstack_1grow (output, '\f');
2125 obstack_1grow (output, '\n');
2130 obstack_1grow (output, '\r');
2135 obstack_1grow (output, '\t');
2140 obstack_1grow (output, '\v');
2144 /* GCC extension. */
2147 obstack_1grow (output, HOST_ESCAPE_CHAR);
2151 /* Backslash-newline expands to nothing at all. */
2157 /* A few escapes just expand to the character itself. */
2161 /* GCC extensions. */
2166 /* Unrecognized escapes turn into the character itself. */
2169 obstack_1grow (output, *tokptr);
2177 /* Parse a string or character literal from TOKPTR. The string or
2178 character may be wide or unicode. *OUTPTR is set to just after the
2179 end of the literal in the input string. The resulting token is
2180 stored in VALUE. This returns a token value, either STRING or
2181 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2182 number of host characters in the literal. */
2185 parse_string_or_char (const char *tokptr, const char **outptr,
2186 struct typed_stoken *value, int *host_chars)
2192 /* Build the gdb internal form of the input string in tempbuf. Note
2193 that the buffer is null byte terminated *only* for the
2194 convenience of debugging gdb itself and printing the buffer
2195 contents when the buffer contains no embedded nulls. Gdb does
2196 not depend upon the buffer being null byte terminated, it uses
2197 the length string instead. This allows gdb to handle C strings
2198 (as well as strings in other languages) with embedded null
2204 obstack_free (&tempbuf, NULL);
2205 obstack_init (&tempbuf);
2207 /* Record the string type. */
2210 type = C_WIDE_STRING;
2213 else if (*tokptr == 'u')
2218 else if (*tokptr == 'U')
2223 else if (*tokptr == '@')
2225 /* An Objective C string. */
2233 /* Skip the quote. */
2247 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2249 else if (c == quote)
2253 obstack_1grow (&tempbuf, c);
2255 /* FIXME: this does the wrong thing with multi-byte host
2256 characters. We could use mbrlen here, but that would
2257 make "set host-charset" a bit less useful. */
2262 if (*tokptr != quote)
2265 error (_("Unterminated string in expression."));
2267 error (_("Unmatched single quote."));
2272 value->ptr = (char *) obstack_base (&tempbuf);
2273 value->length = obstack_object_size (&tempbuf);
2277 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2280 /* This is used to associate some attributes with a token. */
2284 /* If this bit is set, the token is C++-only. */
2288 /* If this bit is set, the token is conditional: if there is a
2289 symbol of the same name, then the token is a symbol; otherwise,
2290 the token is a keyword. */
2294 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2300 enum exp_opcode opcode;
2304 static const struct token tokentab3[] =
2306 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2307 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2308 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2309 {"...", DOTDOTDOT, BINOP_END, 0}
2312 static const struct token tokentab2[] =
2314 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2315 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2316 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2317 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2318 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2319 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2320 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2321 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2322 {"++", INCREMENT, BINOP_END, 0},
2323 {"--", DECREMENT, BINOP_END, 0},
2324 {"->", ARROW, BINOP_END, 0},
2325 {"&&", ANDAND, BINOP_END, 0},
2326 {"||", OROR, BINOP_END, 0},
2327 /* "::" is *not* only C++: gdb overrides its meaning in several
2328 different ways, e.g., 'filename'::func, function::variable. */
2329 {"::", COLONCOLON, BINOP_END, 0},
2330 {"<<", LSH, BINOP_END, 0},
2331 {">>", RSH, BINOP_END, 0},
2332 {"==", EQUAL, BINOP_END, 0},
2333 {"!=", NOTEQUAL, BINOP_END, 0},
2334 {"<=", LEQ, BINOP_END, 0},
2335 {">=", GEQ, BINOP_END, 0},
2336 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2339 /* Identifier-like tokens. Only type-specifiers than can appear in
2340 multi-word type names (for example 'double' can appear in 'long
2341 double') need to be listed here. type-specifiers that are only ever
2342 single word (like 'float') are handled by the classify_name function. */
2343 static const struct token ident_tokens[] =
2345 {"unsigned", UNSIGNED, OP_NULL, 0},
2346 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2347 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2348 {"struct", STRUCT, OP_NULL, 0},
2349 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2350 {"sizeof", SIZEOF, OP_NULL, 0},
2351 {"_Alignof", ALIGNOF, OP_NULL, 0},
2352 {"alignof", ALIGNOF, OP_NULL, FLAG_CXX},
2353 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2354 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2355 {"class", CLASS, OP_NULL, FLAG_CXX},
2356 {"union", UNION, OP_NULL, 0},
2357 {"short", SHORT, OP_NULL, 0},
2358 {"const", CONST_KEYWORD, OP_NULL, 0},
2359 {"enum", ENUM, OP_NULL, 0},
2360 {"long", LONG, OP_NULL, 0},
2361 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2362 {"int", INT_KEYWORD, OP_NULL, 0},
2363 {"new", NEW, OP_NULL, FLAG_CXX},
2364 {"delete", DELETE, OP_NULL, FLAG_CXX},
2365 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2367 {"and", ANDAND, BINOP_END, FLAG_CXX},
2368 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2369 {"bitand", '&', OP_NULL, FLAG_CXX},
2370 {"bitor", '|', OP_NULL, FLAG_CXX},
2371 {"compl", '~', OP_NULL, FLAG_CXX},
2372 {"not", '!', OP_NULL, FLAG_CXX},
2373 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2374 {"or", OROR, BINOP_END, FLAG_CXX},
2375 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2376 {"xor", '^', OP_NULL, FLAG_CXX},
2377 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2379 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2380 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2381 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2382 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2384 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2385 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2386 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2387 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2388 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2390 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2393 /* When we find that lexptr (the global var defined in parse.c) is
2394 pointing at a macro invocation, we expand the invocation, and call
2395 scan_macro_expansion to save the old lexptr here and point lexptr
2396 into the expanded text. When we reach the end of that, we call
2397 end_macro_expansion to pop back to the value we saved here. The
2398 macro expansion code promises to return only fully-expanded text,
2399 so we don't need to "push" more than one level.
2401 This is disgusting, of course. It would be cleaner to do all macro
2402 expansion beforehand, and then hand that to lexptr. But we don't
2403 really know where the expression ends. Remember, in a command like
2405 (gdb) break *ADDRESS if CONDITION
2407 we evaluate ADDRESS in the scope of the current frame, but we
2408 evaluate CONDITION in the scope of the breakpoint's location. So
2409 it's simply wrong to try to macro-expand the whole thing at once. */
2410 static const char *macro_original_text;
2412 /* We save all intermediate macro expansions on this obstack for the
2413 duration of a single parse. The expansion text may sometimes have
2414 to live past the end of the expansion, due to yacc lookahead.
2415 Rather than try to be clever about saving the data for a single
2416 token, we simply keep it all and delete it after parsing has
2418 static struct obstack expansion_obstack;
2421 scan_macro_expansion (char *expansion)
2425 /* We'd better not be trying to push the stack twice. */
2426 gdb_assert (! macro_original_text);
2428 /* Copy to the obstack, and then free the intermediate
2430 copy = (char *) obstack_copy0 (&expansion_obstack, expansion,
2431 strlen (expansion));
2434 /* Save the old lexptr value, so we can return to it when we're done
2435 parsing the expanded text. */
2436 macro_original_text = lexptr;
2441 scanning_macro_expansion (void)
2443 return macro_original_text != 0;
2447 finished_macro_expansion (void)
2449 /* There'd better be something to pop back to. */
2450 gdb_assert (macro_original_text);
2452 /* Pop back to the original text. */
2453 lexptr = macro_original_text;
2454 macro_original_text = 0;
2458 scan_macro_cleanup (void *dummy)
2460 if (macro_original_text)
2461 finished_macro_expansion ();
2463 obstack_free (&expansion_obstack, NULL);
2466 /* Return true iff the token represents a C++ cast operator. */
2469 is_cast_operator (const char *token, int len)
2471 return (! strncmp (token, "dynamic_cast", len)
2472 || ! strncmp (token, "static_cast", len)
2473 || ! strncmp (token, "reinterpret_cast", len)
2474 || ! strncmp (token, "const_cast", len));
2477 /* The scope used for macro expansion. */
2478 static struct macro_scope *expression_macro_scope;
2480 /* This is set if a NAME token appeared at the very end of the input
2481 string, with no whitespace separating the name from the EOF. This
2482 is used only when parsing to do field name completion. */
2483 static int saw_name_at_eof;
2485 /* This is set if the previously-returned token was a structure
2486 operator -- either '.' or ARROW. */
2487 static bool last_was_structop;
2489 /* Read one token, getting characters through lexptr. */
2492 lex_one_token (struct parser_state *par_state, bool *is_quoted_name)
2497 const char *tokstart;
2498 bool saw_structop = last_was_structop;
2501 last_was_structop = false;
2502 *is_quoted_name = false;
2506 /* Check if this is a macro invocation that we need to expand. */
2507 if (! scanning_macro_expansion ())
2509 char *expanded = macro_expand_next (&lexptr,
2510 standard_macro_lookup,
2511 expression_macro_scope);
2514 scan_macro_expansion (expanded);
2517 prev_lexptr = lexptr;
2520 /* See if it is a special token of length 3. */
2521 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2522 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2524 if ((tokentab3[i].flags & FLAG_CXX) != 0
2525 && parse_language (par_state)->la_language != language_cplus)
2529 yylval.opcode = tokentab3[i].opcode;
2530 return tokentab3[i].token;
2533 /* See if it is a special token of length 2. */
2534 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2535 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2537 if ((tokentab2[i].flags & FLAG_CXX) != 0
2538 && parse_language (par_state)->la_language != language_cplus)
2542 yylval.opcode = tokentab2[i].opcode;
2543 if (tokentab2[i].token == ARROW)
2544 last_was_structop = 1;
2545 return tokentab2[i].token;
2548 switch (c = *tokstart)
2551 /* If we were just scanning the result of a macro expansion,
2552 then we need to resume scanning the original text.
2553 If we're parsing for field name completion, and the previous
2554 token allows such completion, return a COMPLETE token.
2555 Otherwise, we were already scanning the original text, and
2556 we're really done. */
2557 if (scanning_macro_expansion ())
2559 finished_macro_expansion ();
2562 else if (saw_name_at_eof)
2564 saw_name_at_eof = 0;
2567 else if (parse_completion && saw_structop)
2582 if (parse_language (par_state)->la_language == language_objc
2589 if (paren_depth == 0)
2596 if (comma_terminates
2598 && ! scanning_macro_expansion ())
2604 /* Might be a floating point number. */
2605 if (lexptr[1] < '0' || lexptr[1] > '9')
2607 last_was_structop = true;
2608 goto symbol; /* Nope, must be a symbol. */
2623 /* It's a number. */
2624 int got_dot = 0, got_e = 0, toktype;
2625 const char *p = tokstart;
2626 int hex = input_radix > 10;
2628 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2633 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2641 /* This test includes !hex because 'e' is a valid hex digit
2642 and thus does not indicate a floating point number when
2643 the radix is hex. */
2644 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2645 got_dot = got_e = 1;
2646 /* This test does not include !hex, because a '.' always indicates
2647 a decimal floating point number regardless of the radix. */
2648 else if (!got_dot && *p == '.')
2650 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2651 && (*p == '-' || *p == '+'))
2652 /* This is the sign of the exponent, not the end of the
2655 /* We will take any letters or digits. parse_number will
2656 complain if past the radix, or if L or U are not final. */
2657 else if ((*p < '0' || *p > '9')
2658 && ((*p < 'a' || *p > 'z')
2659 && (*p < 'A' || *p > 'Z')))
2662 toktype = parse_number (par_state, tokstart, p - tokstart,
2663 got_dot|got_e, &yylval);
2664 if (toktype == ERROR)
2666 char *err_copy = (char *) alloca (p - tokstart + 1);
2668 memcpy (err_copy, tokstart, p - tokstart);
2669 err_copy[p - tokstart] = 0;
2670 error (_("Invalid number \"%s\"."), err_copy);
2678 const char *p = &tokstart[1];
2680 if (parse_language (par_state)->la_language == language_objc)
2682 size_t len = strlen ("selector");
2684 if (strncmp (p, "selector", len) == 0
2685 && (p[len] == '\0' || ISSPACE (p[len])))
2694 while (ISSPACE (*p))
2696 size_t len = strlen ("entry");
2697 if (strncmp (p, "entry", len) == 0 && !c_ident_is_alnum (p[len])
2729 if (tokstart[1] != '"' && tokstart[1] != '\'')
2738 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2743 error (_("Empty character constant."));
2744 else if (host_len > 2 && c == '\'')
2747 namelen = lexptr - tokstart - 1;
2748 *is_quoted_name = true;
2752 else if (host_len > 1)
2753 error (_("Invalid character constant."));
2759 if (!(c == '_' || c == '$' || c_ident_is_alpha (c)))
2760 /* We must have come across a bad character (e.g. ';'). */
2761 error (_("Invalid character '%c' in expression."), c);
2763 /* It's a name. See how long it is. */
2765 for (c = tokstart[namelen];
2766 (c == '_' || c == '$' || c_ident_is_alnum (c) || c == '<');)
2768 /* Template parameter lists are part of the name.
2769 FIXME: This mishandles `print $a<4&&$a>3'. */
2773 if (! is_cast_operator (tokstart, namelen))
2775 /* Scan ahead to get rest of the template specification. Note
2776 that we look ahead only when the '<' adjoins non-whitespace
2777 characters; for comparison expressions, e.g. "a < b > c",
2778 there must be spaces before the '<', etc. */
2779 const char *p = find_template_name_end (tokstart + namelen);
2782 namelen = p - tokstart;
2786 c = tokstart[++namelen];
2789 /* The token "if" terminates the expression and is NOT removed from
2790 the input stream. It doesn't count if it appears in the
2791 expansion of a macro. */
2793 && tokstart[0] == 'i'
2794 && tokstart[1] == 'f'
2795 && ! scanning_macro_expansion ())
2800 /* For the same reason (breakpoint conditions), "thread N"
2801 terminates the expression. "thread" could be an identifier, but
2802 an identifier is never followed by a number without intervening
2803 punctuation. "task" is similar. Handle abbreviations of these,
2804 similarly to breakpoint.c:find_condition_and_thread. */
2806 && (strncmp (tokstart, "thread", namelen) == 0
2807 || strncmp (tokstart, "task", namelen) == 0)
2808 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2809 && ! scanning_macro_expansion ())
2811 const char *p = tokstart + namelen + 1;
2813 while (*p == ' ' || *p == '\t')
2815 if (*p >= '0' && *p <= '9')
2823 yylval.sval.ptr = tokstart;
2824 yylval.sval.length = namelen;
2826 /* Catch specific keywords. */
2827 copy = copy_name (yylval.sval);
2828 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2829 if (strcmp (copy, ident_tokens[i].oper) == 0)
2831 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2832 && parse_language (par_state)->la_language != language_cplus)
2835 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2837 struct field_of_this_result is_a_field_of_this;
2839 if (lookup_symbol (copy, expression_context_block,
2841 (parse_language (par_state)->la_language
2842 == language_cplus ? &is_a_field_of_this
2846 /* The keyword is shadowed. */
2851 /* It is ok to always set this, even though we don't always
2852 strictly need to. */
2853 yylval.opcode = ident_tokens[i].opcode;
2854 return ident_tokens[i].token;
2857 if (*tokstart == '$')
2860 if (parse_completion && *lexptr == '\0')
2861 saw_name_at_eof = 1;
2863 yylval.ssym.stoken = yylval.sval;
2864 yylval.ssym.sym.symbol = NULL;
2865 yylval.ssym.sym.block = NULL;
2866 yylval.ssym.is_a_field_of_this = 0;
2870 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2871 struct token_and_value
2877 /* A FIFO of tokens that have been read but not yet returned to the
2879 static std::vector<token_and_value> token_fifo;
2881 /* Non-zero if the lexer should return tokens from the FIFO. */
2884 /* Temporary storage for c_lex; this holds symbol names as they are
2886 auto_obstack name_obstack;
2888 /* Classify a NAME token. The contents of the token are in `yylval'.
2889 Updates yylval and returns the new token type. BLOCK is the block
2890 in which lookups start; this can be NULL to mean the global scope.
2891 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2892 in single quotes. IS_AFTER_STRUCTOP is true if this name follows
2893 a structure operator -- either '.' or ARROW */
2896 classify_name (struct parser_state *par_state, const struct block *block,
2897 bool is_quoted_name, bool is_after_structop)
2899 struct block_symbol bsym;
2901 struct field_of_this_result is_a_field_of_this;
2903 copy = copy_name (yylval.sval);
2905 /* Initialize this in case we *don't* use it in this call; that way
2906 we can refer to it unconditionally below. */
2907 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2909 bsym = lookup_symbol (copy, block, VAR_DOMAIN,
2910 parse_language (par_state)->la_name_of_this
2911 ? &is_a_field_of_this : NULL);
2913 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2915 yylval.ssym.sym = bsym;
2916 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2919 else if (!bsym.symbol)
2921 /* If we found a field of 'this', we might have erroneously
2922 found a constructor where we wanted a type name. Handle this
2923 case by noticing that we found a constructor and then look up
2924 the type tag instead. */
2925 if (is_a_field_of_this.type != NULL
2926 && is_a_field_of_this.fn_field != NULL
2927 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2930 struct field_of_this_result inner_is_a_field_of_this;
2932 bsym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2933 &inner_is_a_field_of_this);
2934 if (bsym.symbol != NULL)
2936 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2941 /* If we found a field on the "this" object, or we are looking
2942 up a field on a struct, then we want to prefer it over a
2943 filename. However, if the name was quoted, then it is better
2944 to check for a filename or a block, since this is the only
2945 way the user has of requiring the extension to be used. */
2946 if ((is_a_field_of_this.type == NULL && !is_after_structop)
2949 /* See if it's a file name. */
2950 struct symtab *symtab;
2952 symtab = lookup_symtab (copy);
2955 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
2962 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
2964 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2968 /* See if it's an ObjC classname. */
2969 if (parse_language (par_state)->la_language == language_objc && !bsym.symbol)
2971 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2976 yylval.theclass.theclass = Class;
2977 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2979 yylval.theclass.type = SYMBOL_TYPE (sym);
2984 /* Input names that aren't symbols but ARE valid hex numbers, when
2985 the input radix permits them, can be names or numbers depending
2986 on the parse. Note we support radixes > 16 here. */
2988 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2989 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2991 YYSTYPE newlval; /* Its value is ignored. */
2992 int hextype = parse_number (par_state, copy, yylval.sval.length,
2997 yylval.ssym.sym = bsym;
2998 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
3003 /* Any other kind of symbol */
3004 yylval.ssym.sym = bsym;
3005 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
3007 if (bsym.symbol == NULL
3008 && parse_language (par_state)->la_language == language_cplus
3009 && is_a_field_of_this.type == NULL
3010 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
3011 return UNKNOWN_CPP_NAME;
3016 /* Like classify_name, but used by the inner loop of the lexer, when a
3017 name might have already been seen. CONTEXT is the context type, or
3018 NULL if this is the first component of a name. */
3021 classify_inner_name (struct parser_state *par_state,
3022 const struct block *block, struct type *context)
3027 if (context == NULL)
3028 return classify_name (par_state, block, false, false);
3030 type = check_typedef (context);
3031 if (!type_aggregate_p (type))
3034 copy = copy_name (yylval.ssym.stoken);
3035 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3036 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN);
3038 /* If no symbol was found, search for a matching base class named
3039 COPY. This will allow users to enter qualified names of class members
3040 relative to the `this' pointer. */
3041 if (yylval.ssym.sym.symbol == NULL)
3043 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3045 if (base_type != NULL)
3047 yylval.tsym.type = base_type;
3054 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
3058 /* cp_lookup_nested_symbol might have accidentally found a constructor
3059 named COPY when we really wanted a base class of the same name.
3060 Double-check this case by looking for a base class. */
3062 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3064 if (base_type != NULL)
3066 yylval.tsym.type = base_type;
3073 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3079 internal_error (__FILE__, __LINE__, _("not reached"));
3082 /* The outer level of a two-level lexer. This calls the inner lexer
3083 to return tokens. It then either returns these tokens, or
3084 aggregates them into a larger token. This lets us work around a
3085 problem in our parsing approach, where the parser could not
3086 distinguish between qualified names and qualified types at the
3089 This approach is still not ideal, because it mishandles template
3090 types. See the comment in lex_one_token for an example. However,
3091 this is still an improvement over the earlier approach, and will
3092 suffice until we move to better parsing technology. */
3097 token_and_value current;
3098 int first_was_coloncolon, last_was_coloncolon;
3099 struct type *context_type = NULL;
3100 int last_to_examine, next_to_examine, checkpoint;
3101 const struct block *search_block;
3102 bool is_quoted_name, last_lex_was_structop;
3104 if (popping && !token_fifo.empty ())
3108 last_lex_was_structop = last_was_structop;
3110 /* Read the first token and decide what to do. Most of the
3111 subsequent code is C++-only; but also depends on seeing a "::" or
3113 current.token = lex_one_token (pstate, &is_quoted_name);
3114 if (current.token == NAME)
3115 current.token = classify_name (pstate, expression_context_block,
3116 is_quoted_name, last_lex_was_structop);
3117 if (parse_language (pstate)->la_language != language_cplus
3118 || (current.token != TYPENAME && current.token != COLONCOLON
3119 && current.token != FILENAME))
3120 return current.token;
3122 /* Read any sequence of alternating "::" and name-like tokens into
3124 current.value = yylval;
3125 token_fifo.push_back (current);
3126 last_was_coloncolon = current.token == COLONCOLON;
3131 /* We ignore quoted names other than the very first one.
3132 Subsequent ones do not have any special meaning. */
3133 current.token = lex_one_token (pstate, &ignore);
3134 current.value = yylval;
3135 token_fifo.push_back (current);
3137 if ((last_was_coloncolon && current.token != NAME)
3138 || (!last_was_coloncolon && current.token != COLONCOLON))
3140 last_was_coloncolon = !last_was_coloncolon;
3144 /* We always read one extra token, so compute the number of tokens
3145 to examine accordingly. */
3146 last_to_examine = token_fifo.size () - 2;
3147 next_to_examine = 0;
3149 current = token_fifo[next_to_examine];
3152 name_obstack.clear ();
3154 if (current.token == FILENAME)
3155 search_block = current.value.bval;
3156 else if (current.token == COLONCOLON)
3157 search_block = NULL;
3160 gdb_assert (current.token == TYPENAME);
3161 search_block = expression_context_block;
3162 obstack_grow (&name_obstack, current.value.sval.ptr,
3163 current.value.sval.length);
3164 context_type = current.value.tsym.type;
3168 first_was_coloncolon = current.token == COLONCOLON;
3169 last_was_coloncolon = first_was_coloncolon;
3171 while (next_to_examine <= last_to_examine)
3173 token_and_value next;
3175 next = token_fifo[next_to_examine];
3178 if (next.token == NAME && last_was_coloncolon)
3182 yylval = next.value;
3183 classification = classify_inner_name (pstate, search_block,
3185 /* We keep going until we either run out of names, or until
3186 we have a qualified name which is not a type. */
3187 if (classification != TYPENAME && classification != NAME)
3190 /* Accept up to this token. */
3191 checkpoint = next_to_examine;
3193 /* Update the partial name we are constructing. */
3194 if (context_type != NULL)
3196 /* We don't want to put a leading "::" into the name. */
3197 obstack_grow_str (&name_obstack, "::");
3199 obstack_grow (&name_obstack, next.value.sval.ptr,
3200 next.value.sval.length);
3202 yylval.sval.ptr = (const char *) obstack_base (&name_obstack);
3203 yylval.sval.length = obstack_object_size (&name_obstack);
3204 current.value = yylval;
3205 current.token = classification;
3207 last_was_coloncolon = 0;
3209 if (classification == NAME)
3212 context_type = yylval.tsym.type;
3214 else if (next.token == COLONCOLON && !last_was_coloncolon)
3215 last_was_coloncolon = 1;
3218 /* We've reached the end of the name. */
3223 /* If we have a replacement token, install it as the first token in
3224 the FIFO, and delete the other constituent tokens. */
3227 current.value.sval.ptr
3228 = (const char *) obstack_copy0 (&expansion_obstack,
3229 current.value.sval.ptr,
3230 current.value.sval.length);
3232 token_fifo[0] = current;
3234 token_fifo.erase (token_fifo.begin () + 1,
3235 token_fifo.begin () + checkpoint);
3239 current = token_fifo[0];
3240 token_fifo.erase (token_fifo.begin ());
3241 yylval = current.value;
3242 return current.token;
3246 c_parse (struct parser_state *par_state)
3249 struct cleanup *back_to;
3251 /* Setting up the parser state. */
3252 scoped_restore pstate_restore = make_scoped_restore (&pstate);
3253 gdb_assert (par_state != NULL);
3256 gdb::unique_xmalloc_ptr<struct macro_scope> macro_scope;
3258 if (expression_context_block)
3259 macro_scope = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3261 macro_scope = default_macro_scope ();
3263 macro_scope = user_macro_scope ();
3265 scoped_restore restore_macro_scope
3266 = make_scoped_restore (&expression_macro_scope, macro_scope.get ());
3268 /* Initialize macro expansion code. */
3269 obstack_init (&expansion_obstack);
3270 gdb_assert (! macro_original_text);
3271 /* Note that parsing (within yyparse) freely installs cleanups
3272 assuming they'll be run here (below). */
3273 back_to = make_cleanup (scan_macro_cleanup, 0);
3275 scoped_restore restore_yydebug = make_scoped_restore (&yydebug,
3278 /* Initialize some state used by the lexer. */
3279 last_was_structop = false;
3280 saw_name_at_eof = 0;
3282 token_fifo.clear ();
3284 name_obstack.clear ();
3286 result = yyparse ();
3287 do_cleanups (back_to);
3294 /* This is called via the YYPRINT macro when parser debugging is
3295 enabled. It prints a token's value. */
3298 c_print_token (FILE *file, int type, YYSTYPE value)
3303 parser_fprintf (file, "typed_val_int<%s, %s>",
3304 TYPE_SAFE_NAME (value.typed_val_int.type),
3305 pulongest (value.typed_val_int.val));
3311 char *copy = (char *) alloca (value.tsval.length + 1);
3313 memcpy (copy, value.tsval.ptr, value.tsval.length);
3314 copy[value.tsval.length] = '\0';
3316 parser_fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3322 parser_fprintf (file, "sval<%s>", copy_name (value.sval));
3326 parser_fprintf (file, "tsym<type=%s, name=%s>",
3327 TYPE_SAFE_NAME (value.tsym.type),
3328 copy_name (value.tsym.stoken));
3332 case UNKNOWN_CPP_NAME:
3335 parser_fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3336 copy_name (value.ssym.stoken),
3337 (value.ssym.sym.symbol == NULL
3338 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym.symbol)),
3339 value.ssym.is_a_field_of_this);
3343 parser_fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3351 yyerror (const char *msg)
3354 lexptr = prev_lexptr;
3356 error (_("A %s in expression, near `%s'."), msg, lexptr);