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 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); }
311 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
312 write_exp_string (pstate, $3);
313 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
316 exp : exp ARROW name COMPLETE
317 { mark_struct_expression (pstate);
318 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
319 write_exp_string (pstate, $3);
320 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
323 exp : exp ARROW COMPLETE
325 mark_struct_expression (pstate);
326 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
329 write_exp_string (pstate, s);
330 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
333 exp : exp ARROW '~' name
334 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
335 write_destructor_name (pstate, $4);
336 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
339 exp : exp ARROW '~' name COMPLETE
340 { mark_struct_expression (pstate);
341 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
342 write_destructor_name (pstate, $4);
343 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
346 exp : exp ARROW qualified_name
347 { /* exp->type::name becomes exp->*(&type::name) */
348 /* Note: this doesn't work if name is a
349 static member! FIXME */
350 write_exp_elt_opcode (pstate, UNOP_ADDR);
351 write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
354 exp : exp ARROW_STAR exp
355 { write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
359 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
360 write_exp_string (pstate, $3);
361 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
364 exp : exp '.' name COMPLETE
365 { mark_struct_expression (pstate);
366 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
367 write_exp_string (pstate, $3);
368 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
371 exp : exp '.' COMPLETE
373 mark_struct_expression (pstate);
374 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
377 write_exp_string (pstate, s);
378 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
381 exp : exp '.' '~' name
382 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
383 write_destructor_name (pstate, $4);
384 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
387 exp : exp '.' '~' name COMPLETE
388 { mark_struct_expression (pstate);
389 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
390 write_destructor_name (pstate, $4);
391 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
394 exp : exp '.' qualified_name
395 { /* exp.type::name becomes exp.*(&type::name) */
396 /* Note: this doesn't work if name is a
397 static member! FIXME */
398 write_exp_elt_opcode (pstate, UNOP_ADDR);
399 write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
402 exp : exp DOT_STAR exp
403 { write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
406 exp : exp '[' exp1 ']'
407 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
410 exp : exp OBJC_LBRAC exp1 ']'
411 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
415 * The rules below parse ObjC message calls of the form:
416 * '[' target selector {':' argument}* ']'
419 exp : OBJC_LBRAC TYPENAME
423 theclass = lookup_objc_class (parse_gdbarch (pstate),
424 copy_name ($2.stoken));
426 error (_("%s is not an ObjC Class"),
427 copy_name ($2.stoken));
428 write_exp_elt_opcode (pstate, OP_LONG);
429 write_exp_elt_type (pstate,
430 parse_type (pstate)->builtin_int);
431 write_exp_elt_longcst (pstate, (LONGEST) theclass);
432 write_exp_elt_opcode (pstate, OP_LONG);
436 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
437 end_msglist (pstate);
438 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
442 exp : OBJC_LBRAC CLASSNAME
444 write_exp_elt_opcode (pstate, OP_LONG);
445 write_exp_elt_type (pstate,
446 parse_type (pstate)->builtin_int);
447 write_exp_elt_longcst (pstate, (LONGEST) $2.theclass);
448 write_exp_elt_opcode (pstate, OP_LONG);
452 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
453 end_msglist (pstate);
454 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
461 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
462 end_msglist (pstate);
463 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
468 { add_msglist(&$1, 0); }
476 msgarg : name ':' exp
477 { add_msglist(&$1, 1); }
478 | ':' exp /* Unnamed arg. */
479 { add_msglist(0, 1); }
480 | ',' exp /* Variable number of args. */
481 { add_msglist(0, 0); }
485 /* This is to save the value of arglist_len
486 being accumulated by an outer function call. */
487 { start_arglist (); }
488 arglist ')' %prec ARROW
489 { write_exp_elt_opcode (pstate, OP_FUNCALL);
490 write_exp_elt_longcst (pstate,
491 (LONGEST) end_arglist ());
492 write_exp_elt_opcode (pstate, OP_FUNCALL); }
495 /* This is here to disambiguate with the production for
496 "func()::static_var" further below, which uses
497 function_method_void. */
498 exp : exp '(' ')' %prec ARROW
500 write_exp_elt_opcode (pstate, OP_FUNCALL);
501 write_exp_elt_longcst (pstate,
502 (LONGEST) end_arglist ());
503 write_exp_elt_opcode (pstate, OP_FUNCALL); }
507 exp : UNKNOWN_CPP_NAME '('
509 /* This could potentially be a an argument defined
510 lookup function (Koenig). */
511 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
512 write_exp_elt_block (pstate,
513 expression_context_block);
514 write_exp_elt_sym (pstate,
515 NULL); /* Placeholder. */
516 write_exp_string (pstate, $1.stoken);
517 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
519 /* This is to save the value of arglist_len
520 being accumulated by an outer function call. */
524 arglist ')' %prec ARROW
526 write_exp_elt_opcode (pstate, OP_FUNCALL);
527 write_exp_elt_longcst (pstate,
528 (LONGEST) end_arglist ());
529 write_exp_elt_opcode (pstate, OP_FUNCALL);
534 { start_arglist (); }
544 arglist : arglist ',' exp %prec ABOVE_COMMA
548 function_method: exp '(' parameter_typelist ')' const_or_volatile
550 VEC (type_ptr) *type_list = $3;
551 struct type *type_elt;
552 LONGEST len = VEC_length (type_ptr, type_list);
554 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
555 /* Save the const/volatile qualifiers as
556 recorded by the const_or_volatile
557 production's actions. */
558 write_exp_elt_longcst (pstate,
559 follow_type_instance_flags ());
560 write_exp_elt_longcst (pstate, len);
562 VEC_iterate (type_ptr, type_list, i, type_elt);
564 write_exp_elt_type (pstate, type_elt);
565 write_exp_elt_longcst(pstate, len);
566 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
567 VEC_free (type_ptr, type_list);
571 function_method_void: exp '(' ')' const_or_volatile
572 { write_exp_elt_opcode (pstate, TYPE_INSTANCE);
574 write_exp_elt_longcst (pstate,
575 follow_type_instance_flags ());
576 write_exp_elt_longcst (pstate, 0);
577 write_exp_elt_longcst (pstate, 0);
578 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
582 exp : function_method
585 /* Normally we must interpret "func()" as a function call, instead of
586 a type. The user needs to write func(void) to disambiguate.
587 However, in the "func()::static_var" case, there's no
589 function_method_void_or_typelist: function_method
590 | function_method_void
593 exp : function_method_void_or_typelist COLONCOLON name
595 write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR);
596 write_exp_string (pstate, $3);
597 write_exp_elt_opcode (pstate, OP_FUNC_STATIC_VAR);
602 { $$ = end_arglist () - 1; }
604 exp : lcurly arglist rcurly %prec ARROW
605 { write_exp_elt_opcode (pstate, OP_ARRAY);
606 write_exp_elt_longcst (pstate, (LONGEST) 0);
607 write_exp_elt_longcst (pstate, (LONGEST) $3);
608 write_exp_elt_opcode (pstate, OP_ARRAY); }
611 exp : lcurly type_exp rcurly exp %prec UNARY
612 { write_exp_elt_opcode (pstate, UNOP_MEMVAL_TYPE); }
615 exp : '(' type_exp ')' exp %prec UNARY
616 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
623 /* Binary operators in order of decreasing precedence. */
626 { write_exp_elt_opcode (pstate, BINOP_REPEAT); }
630 { write_exp_elt_opcode (pstate, BINOP_MUL); }
634 { write_exp_elt_opcode (pstate, BINOP_DIV); }
638 { write_exp_elt_opcode (pstate, BINOP_REM); }
642 { write_exp_elt_opcode (pstate, BINOP_ADD); }
646 { write_exp_elt_opcode (pstate, BINOP_SUB); }
650 { write_exp_elt_opcode (pstate, BINOP_LSH); }
654 { write_exp_elt_opcode (pstate, BINOP_RSH); }
658 { write_exp_elt_opcode (pstate, BINOP_EQUAL); }
661 exp : exp NOTEQUAL exp
662 { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); }
666 { write_exp_elt_opcode (pstate, BINOP_LEQ); }
670 { write_exp_elt_opcode (pstate, BINOP_GEQ); }
674 { write_exp_elt_opcode (pstate, BINOP_LESS); }
678 { write_exp_elt_opcode (pstate, BINOP_GTR); }
682 { write_exp_elt_opcode (pstate, BINOP_BITWISE_AND); }
686 { write_exp_elt_opcode (pstate, BINOP_BITWISE_XOR); }
690 { write_exp_elt_opcode (pstate, BINOP_BITWISE_IOR); }
694 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); }
698 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); }
701 exp : exp '?' exp ':' exp %prec '?'
702 { write_exp_elt_opcode (pstate, TERNOP_COND); }
706 { write_exp_elt_opcode (pstate, BINOP_ASSIGN); }
709 exp : exp ASSIGN_MODIFY exp
710 { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY);
711 write_exp_elt_opcode (pstate, $2);
712 write_exp_elt_opcode (pstate,
713 BINOP_ASSIGN_MODIFY); }
717 { write_exp_elt_opcode (pstate, OP_LONG);
718 write_exp_elt_type (pstate, $1.type);
719 write_exp_elt_longcst (pstate, (LONGEST) ($1.val));
720 write_exp_elt_opcode (pstate, OP_LONG); }
725 struct stoken_vector vec;
728 write_exp_string_vector (pstate, $1.type, &vec);
734 parse_number (pstate, $1.stoken.ptr,
735 $1.stoken.length, 0, &val);
736 write_exp_elt_opcode (pstate, OP_LONG);
737 write_exp_elt_type (pstate, val.typed_val_int.type);
738 write_exp_elt_longcst (pstate,
739 (LONGEST) val.typed_val_int.val);
740 write_exp_elt_opcode (pstate, OP_LONG);
746 { write_exp_elt_opcode (pstate, OP_FLOAT);
747 write_exp_elt_type (pstate, $1.type);
748 write_exp_elt_floatcst (pstate, $1.val);
749 write_exp_elt_opcode (pstate, OP_FLOAT); }
757 write_dollar_variable (pstate, $1);
761 exp : SELECTOR '(' name ')'
763 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR);
764 write_exp_string (pstate, $3);
765 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); }
768 exp : SIZEOF '(' type ')' %prec UNARY
769 { struct type *type = $3;
770 write_exp_elt_opcode (pstate, OP_LONG);
771 write_exp_elt_type (pstate, lookup_signed_typename
772 (parse_language (pstate),
773 parse_gdbarch (pstate),
775 type = check_typedef (type);
777 /* $5.3.3/2 of the C++ Standard (n3290 draft)
778 says of sizeof: "When applied to a reference
779 or a reference type, the result is the size of
780 the referenced type." */
781 if (TYPE_IS_REFERENCE (type))
782 type = check_typedef (TYPE_TARGET_TYPE (type));
783 write_exp_elt_longcst (pstate,
784 (LONGEST) TYPE_LENGTH (type));
785 write_exp_elt_opcode (pstate, OP_LONG); }
788 exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
789 { write_exp_elt_opcode (pstate,
790 UNOP_REINTERPRET_CAST); }
793 exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
794 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
797 exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
798 { write_exp_elt_opcode (pstate, UNOP_DYNAMIC_CAST); }
801 exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
802 { /* We could do more error checking here, but
803 it doesn't seem worthwhile. */
804 write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
810 /* We copy the string here, and not in the
811 lexer, to guarantee that we do not leak a
812 string. Note that we follow the
813 NUL-termination convention of the
815 struct typed_stoken *vec = XNEW (struct typed_stoken);
820 vec->length = $1.length;
821 vec->ptr = (char *) malloc ($1.length + 1);
822 memcpy (vec->ptr, $1.ptr, $1.length + 1);
827 /* Note that we NUL-terminate here, but just
831 $$.tokens = XRESIZEVEC (struct typed_stoken,
834 p = (char *) malloc ($2.length + 1);
835 memcpy (p, $2.ptr, $2.length + 1);
837 $$.tokens[$$.len - 1].type = $2.type;
838 $$.tokens[$$.len - 1].length = $2.length;
839 $$.tokens[$$.len - 1].ptr = p;
846 c_string_type type = C_STRING;
848 for (i = 0; i < $1.len; ++i)
850 switch ($1.tokens[i].type)
858 && type != $1.tokens[i].type)
859 error (_("Undefined string concatenation."));
860 type = (enum c_string_type_values) $1.tokens[i].type;
864 internal_error (__FILE__, __LINE__,
865 "unrecognized type in string concatenation");
869 write_exp_string_vector (pstate, type, &$1);
870 for (i = 0; i < $1.len; ++i)
871 free ($1.tokens[i].ptr);
876 exp : NSSTRING /* ObjC NextStep NSString constant
877 * of the form '@' '"' string '"'.
879 { write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING);
880 write_exp_string (pstate, $1);
881 write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); }
886 { write_exp_elt_opcode (pstate, OP_LONG);
887 write_exp_elt_type (pstate,
888 parse_type (pstate)->builtin_bool);
889 write_exp_elt_longcst (pstate, (LONGEST) 1);
890 write_exp_elt_opcode (pstate, OP_LONG); }
894 { write_exp_elt_opcode (pstate, OP_LONG);
895 write_exp_elt_type (pstate,
896 parse_type (pstate)->builtin_bool);
897 write_exp_elt_longcst (pstate, (LONGEST) 0);
898 write_exp_elt_opcode (pstate, OP_LONG); }
906 $$ = SYMBOL_BLOCK_VALUE ($1.sym.symbol);
908 error (_("No file or function \"%s\"."),
909 copy_name ($1.stoken));
917 block : block COLONCOLON name
919 = lookup_symbol (copy_name ($3), $1,
920 VAR_DOMAIN, NULL).symbol;
922 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
923 error (_("No function \"%s\" in specified context."),
925 $$ = SYMBOL_BLOCK_VALUE (tem); }
928 variable: name_not_typename ENTRY
929 { struct symbol *sym = $1.sym.symbol;
931 if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym)
932 || !symbol_read_needs_frame (sym))
933 error (_("@entry can be used only for function "
934 "parameters, not for \"%s\""),
935 copy_name ($1.stoken));
937 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
938 write_exp_elt_sym (pstate, sym);
939 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
943 variable: block COLONCOLON name
944 { struct block_symbol sym
945 = lookup_symbol (copy_name ($3), $1,
949 error (_("No symbol \"%s\" in specified context."),
951 if (symbol_read_needs_frame (sym.symbol))
953 innermost_block.update (sym);
955 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
956 write_exp_elt_block (pstate, sym.block);
957 write_exp_elt_sym (pstate, sym.symbol);
958 write_exp_elt_opcode (pstate, OP_VAR_VALUE); }
961 qualified_name: TYPENAME COLONCOLON name
963 struct type *type = $1.type;
964 type = check_typedef (type);
965 if (!type_aggregate_p (type))
966 error (_("`%s' is not defined as an aggregate type."),
967 TYPE_SAFE_NAME (type));
969 write_exp_elt_opcode (pstate, OP_SCOPE);
970 write_exp_elt_type (pstate, type);
971 write_exp_string (pstate, $3);
972 write_exp_elt_opcode (pstate, OP_SCOPE);
974 | TYPENAME COLONCOLON '~' name
976 struct type *type = $1.type;
977 struct stoken tmp_token;
980 type = check_typedef (type);
981 if (!type_aggregate_p (type))
982 error (_("`%s' is not defined as an aggregate type."),
983 TYPE_SAFE_NAME (type));
984 buf = (char *) alloca ($4.length + 2);
986 tmp_token.length = $4.length + 1;
988 memcpy (buf+1, $4.ptr, $4.length);
989 buf[tmp_token.length] = 0;
991 /* Check for valid destructor name. */
992 destructor_name_p (tmp_token.ptr, $1.type);
993 write_exp_elt_opcode (pstate, OP_SCOPE);
994 write_exp_elt_type (pstate, type);
995 write_exp_string (pstate, tmp_token);
996 write_exp_elt_opcode (pstate, OP_SCOPE);
998 | TYPENAME COLONCOLON name COLONCOLON name
1000 char *copy = copy_name ($3);
1001 error (_("No type \"%s\" within class "
1002 "or namespace \"%s\"."),
1003 copy, TYPE_SAFE_NAME ($1.type));
1007 variable: qualified_name
1008 | COLONCOLON name_not_typename
1010 char *name = copy_name ($2.stoken);
1012 struct bound_minimal_symbol msymbol;
1015 = lookup_symbol (name, (const struct block *) NULL,
1016 VAR_DOMAIN, NULL).symbol;
1019 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1020 write_exp_elt_block (pstate, NULL);
1021 write_exp_elt_sym (pstate, sym);
1022 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1026 msymbol = lookup_bound_minimal_symbol (name);
1027 if (msymbol.minsym != NULL)
1028 write_exp_msymbol (pstate, msymbol);
1029 else if (!have_full_symbols () && !have_partial_symbols ())
1030 error (_("No symbol table is loaded. Use the \"file\" command."));
1032 error (_("No symbol \"%s\" in current context."), name);
1036 variable: name_not_typename
1037 { struct block_symbol sym = $1.sym;
1041 if (symbol_read_needs_frame (sym.symbol))
1042 innermost_block.update (sym);
1044 /* If we found a function, see if it's
1045 an ifunc resolver that has the same
1046 address as the ifunc symbol itself.
1047 If so, prefer the ifunc symbol. */
1049 bound_minimal_symbol resolver
1050 = find_gnu_ifunc (sym.symbol);
1051 if (resolver.minsym != NULL)
1052 write_exp_msymbol (pstate, resolver);
1055 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1056 write_exp_elt_block (pstate, sym.block);
1057 write_exp_elt_sym (pstate, sym.symbol);
1058 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1061 else if ($1.is_a_field_of_this)
1063 /* C++: it hangs off of `this'. Must
1064 not inadvertently convert from a method call
1066 innermost_block.update (sym);
1067 write_exp_elt_opcode (pstate, OP_THIS);
1068 write_exp_elt_opcode (pstate, OP_THIS);
1069 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1070 write_exp_string (pstate, $1.stoken);
1071 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1075 char *arg = copy_name ($1.stoken);
1077 bound_minimal_symbol msymbol
1078 = lookup_bound_minimal_symbol (arg);
1079 if (msymbol.minsym == NULL)
1081 if (!have_full_symbols () && !have_partial_symbols ())
1082 error (_("No symbol table is loaded. Use the \"file\" command."));
1084 error (_("No symbol \"%s\" in current context."),
1085 copy_name ($1.stoken));
1088 /* This minsym might be an alias for
1089 another function. See if we can find
1090 the debug symbol for the target, and
1091 if so, use it instead, since it has
1092 return type / prototype info. This
1093 is important for example for "p
1094 *__errno_location()". */
1095 symbol *alias_target
1096 = ((msymbol.minsym->type != mst_text_gnu_ifunc
1097 && msymbol.minsym->type != mst_data_gnu_ifunc)
1098 ? find_function_alias_target (msymbol)
1100 if (alias_target != NULL)
1102 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1104 (pstate, SYMBOL_BLOCK_VALUE (alias_target));
1105 write_exp_elt_sym (pstate, alias_target);
1106 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1109 write_exp_msymbol (pstate, msymbol);
1114 space_identifier : '@' NAME
1115 { insert_type_address_space (pstate, copy_name ($2.stoken)); }
1118 const_or_volatile: const_or_volatile_noopt
1122 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1125 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1126 | const_or_volatile_noopt
1129 const_or_volatile_or_space_identifier:
1130 const_or_volatile_or_space_identifier_noopt
1136 { insert_type (tp_pointer); }
1137 const_or_volatile_or_space_identifier
1139 { insert_type (tp_pointer); }
1140 const_or_volatile_or_space_identifier
1142 { insert_type (tp_reference); }
1144 { insert_type (tp_reference); }
1146 { insert_type (tp_rvalue_reference); }
1147 | ANDAND ptr_operator
1148 { insert_type (tp_rvalue_reference); }
1151 ptr_operator_ts: ptr_operator
1153 $$ = get_type_stack ();
1154 /* This cleanup is eventually run by
1156 make_cleanup (type_stack_cleanup, $$);
1160 abs_decl: ptr_operator_ts direct_abs_decl
1161 { $$ = append_type_stack ($2, $1); }
1166 direct_abs_decl: '(' abs_decl ')'
1168 | direct_abs_decl array_mod
1170 push_type_stack ($1);
1172 push_type (tp_array);
1173 $$ = get_type_stack ();
1178 push_type (tp_array);
1179 $$ = get_type_stack ();
1182 | direct_abs_decl func_mod
1184 push_type_stack ($1);
1186 $$ = get_type_stack ();
1191 $$ = get_type_stack ();
1201 | OBJC_LBRAC INT ']'
1207 | '(' parameter_typelist ')'
1211 /* We used to try to recognize pointer to member types here, but
1212 that didn't work (shift/reduce conflicts meant that these rules never
1213 got executed). The problem is that
1214 int (foo::bar::baz::bizzle)
1215 is a function type but
1216 int (foo::bar::baz::bizzle::*)
1217 is a pointer to member type. Stroustrup loses again! */
1222 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1226 { $$ = lookup_signed_typename (parse_language (pstate),
1227 parse_gdbarch (pstate),
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),
1241 | LONG SIGNED_KEYWORD INT_KEYWORD
1242 { $$ = lookup_signed_typename (parse_language (pstate),
1243 parse_gdbarch (pstate),
1245 | LONG SIGNED_KEYWORD
1246 { $$ = lookup_signed_typename (parse_language (pstate),
1247 parse_gdbarch (pstate),
1249 | SIGNED_KEYWORD LONG INT_KEYWORD
1250 { $$ = lookup_signed_typename (parse_language (pstate),
1251 parse_gdbarch (pstate),
1253 | UNSIGNED LONG INT_KEYWORD
1254 { $$ = lookup_unsigned_typename (parse_language (pstate),
1255 parse_gdbarch (pstate),
1257 | LONG UNSIGNED INT_KEYWORD
1258 { $$ = lookup_unsigned_typename (parse_language (pstate),
1259 parse_gdbarch (pstate),
1262 { $$ = lookup_unsigned_typename (parse_language (pstate),
1263 parse_gdbarch (pstate),
1266 { $$ = lookup_signed_typename (parse_language (pstate),
1267 parse_gdbarch (pstate),
1269 | LONG LONG INT_KEYWORD
1270 { $$ = lookup_signed_typename (parse_language (pstate),
1271 parse_gdbarch (pstate),
1273 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1274 { $$ = lookup_signed_typename (parse_language (pstate),
1275 parse_gdbarch (pstate),
1277 | LONG LONG SIGNED_KEYWORD
1278 { $$ = lookup_signed_typename (parse_language (pstate),
1279 parse_gdbarch (pstate),
1281 | SIGNED_KEYWORD LONG LONG
1282 { $$ = lookup_signed_typename (parse_language (pstate),
1283 parse_gdbarch (pstate),
1285 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1286 { $$ = lookup_signed_typename (parse_language (pstate),
1287 parse_gdbarch (pstate),
1289 | UNSIGNED LONG LONG
1290 { $$ = lookup_unsigned_typename (parse_language (pstate),
1291 parse_gdbarch (pstate),
1293 | UNSIGNED LONG LONG INT_KEYWORD
1294 { $$ = lookup_unsigned_typename (parse_language (pstate),
1295 parse_gdbarch (pstate),
1297 | LONG LONG UNSIGNED
1298 { $$ = lookup_unsigned_typename (parse_language (pstate),
1299 parse_gdbarch (pstate),
1301 | LONG LONG UNSIGNED INT_KEYWORD
1302 { $$ = lookup_unsigned_typename (parse_language (pstate),
1303 parse_gdbarch (pstate),
1306 { $$ = lookup_signed_typename (parse_language (pstate),
1307 parse_gdbarch (pstate),
1309 | SHORT SIGNED_KEYWORD INT_KEYWORD
1310 { $$ = lookup_signed_typename (parse_language (pstate),
1311 parse_gdbarch (pstate),
1313 | SHORT SIGNED_KEYWORD
1314 { $$ = lookup_signed_typename (parse_language (pstate),
1315 parse_gdbarch (pstate),
1317 | UNSIGNED SHORT INT_KEYWORD
1318 { $$ = lookup_unsigned_typename (parse_language (pstate),
1319 parse_gdbarch (pstate),
1322 { $$ = lookup_unsigned_typename (parse_language (pstate),
1323 parse_gdbarch (pstate),
1325 | SHORT UNSIGNED INT_KEYWORD
1326 { $$ = lookup_unsigned_typename (parse_language (pstate),
1327 parse_gdbarch (pstate),
1330 { $$ = lookup_typename (parse_language (pstate),
1331 parse_gdbarch (pstate),
1333 (struct block *) NULL,
1335 | LONG DOUBLE_KEYWORD
1336 { $$ = lookup_typename (parse_language (pstate),
1337 parse_gdbarch (pstate),
1339 (struct block *) NULL,
1342 { $$ = lookup_struct (copy_name ($2),
1343 expression_context_block); }
1346 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1349 | STRUCT name COMPLETE
1351 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1356 { $$ = lookup_struct (copy_name ($2),
1357 expression_context_block); }
1360 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1363 | CLASS name COMPLETE
1365 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1370 { $$ = lookup_union (copy_name ($2),
1371 expression_context_block); }
1374 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1377 | UNION name COMPLETE
1379 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1384 { $$ = lookup_enum (copy_name ($2),
1385 expression_context_block); }
1388 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1391 | ENUM name COMPLETE
1393 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1397 | UNSIGNED type_name
1398 { $$ = lookup_unsigned_typename (parse_language (pstate),
1399 parse_gdbarch (pstate),
1400 TYPE_NAME($2.type)); }
1402 { $$ = lookup_unsigned_typename (parse_language (pstate),
1403 parse_gdbarch (pstate),
1405 | SIGNED_KEYWORD type_name
1406 { $$ = lookup_signed_typename (parse_language (pstate),
1407 parse_gdbarch (pstate),
1408 TYPE_NAME($2.type)); }
1410 { $$ = lookup_signed_typename (parse_language (pstate),
1411 parse_gdbarch (pstate),
1413 /* It appears that this rule for templates is never
1414 reduced; template recognition happens by lookahead
1415 in the token processing code in yylex. */
1416 | TEMPLATE name '<' type '>'
1417 { $$ = lookup_template_type(copy_name($2), $4,
1418 expression_context_block);
1420 | const_or_volatile_or_space_identifier_noopt typebase
1421 { $$ = follow_types ($2); }
1422 | typebase const_or_volatile_or_space_identifier_noopt
1423 { $$ = follow_types ($1); }
1429 $$.stoken.ptr = "int";
1430 $$.stoken.length = 3;
1431 $$.type = lookup_signed_typename (parse_language (pstate),
1432 parse_gdbarch (pstate),
1437 $$.stoken.ptr = "long";
1438 $$.stoken.length = 4;
1439 $$.type = lookup_signed_typename (parse_language (pstate),
1440 parse_gdbarch (pstate),
1445 $$.stoken.ptr = "short";
1446 $$.stoken.length = 5;
1447 $$.type = lookup_signed_typename (parse_language (pstate),
1448 parse_gdbarch (pstate),
1455 { check_parameter_typelist ($1); }
1456 | nonempty_typelist ',' DOTDOTDOT
1458 VEC_safe_push (type_ptr, $1, NULL);
1459 check_parameter_typelist ($1);
1467 VEC (type_ptr) *typelist = NULL;
1468 VEC_safe_push (type_ptr, typelist, $1);
1471 | nonempty_typelist ',' type
1473 VEC_safe_push (type_ptr, $1, $3);
1481 push_type_stack ($2);
1482 $$ = follow_types ($1);
1486 conversion_type_id: typebase conversion_declarator
1487 { $$ = follow_types ($1); }
1490 conversion_declarator: /* Nothing. */
1491 | ptr_operator conversion_declarator
1494 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1495 | VOLATILE_KEYWORD CONST_KEYWORD
1498 const_or_volatile_noopt: const_and_volatile
1499 { insert_type (tp_const);
1500 insert_type (tp_volatile);
1503 { insert_type (tp_const); }
1505 { insert_type (tp_volatile); }
1509 { $$ = operator_stoken (" new"); }
1511 { $$ = operator_stoken (" delete"); }
1512 | OPERATOR NEW '[' ']'
1513 { $$ = operator_stoken (" new[]"); }
1514 | OPERATOR DELETE '[' ']'
1515 { $$ = operator_stoken (" delete[]"); }
1516 | OPERATOR NEW OBJC_LBRAC ']'
1517 { $$ = operator_stoken (" new[]"); }
1518 | OPERATOR DELETE OBJC_LBRAC ']'
1519 { $$ = operator_stoken (" delete[]"); }
1521 { $$ = operator_stoken ("+"); }
1523 { $$ = operator_stoken ("-"); }
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 (">"); }
1546 | OPERATOR ASSIGN_MODIFY
1547 { const char *op = " unknown";
1571 case BINOP_BITWISE_IOR:
1574 case BINOP_BITWISE_AND:
1577 case BINOP_BITWISE_XOR:
1584 $$ = operator_stoken (op);
1587 { $$ = operator_stoken ("<<"); }
1589 { $$ = operator_stoken (">>"); }
1591 { $$ = operator_stoken ("=="); }
1593 { $$ = operator_stoken ("!="); }
1595 { $$ = operator_stoken ("<="); }
1597 { $$ = operator_stoken (">="); }
1599 { $$ = operator_stoken ("&&"); }
1601 { $$ = operator_stoken ("||"); }
1602 | OPERATOR INCREMENT
1603 { $$ = operator_stoken ("++"); }
1604 | OPERATOR DECREMENT
1605 { $$ = operator_stoken ("--"); }
1607 { $$ = operator_stoken (","); }
1608 | OPERATOR ARROW_STAR
1609 { $$ = operator_stoken ("->*"); }
1611 { $$ = operator_stoken ("->"); }
1613 { $$ = operator_stoken ("()"); }
1615 { $$ = operator_stoken ("[]"); }
1616 | OPERATOR OBJC_LBRAC ']'
1617 { $$ = operator_stoken ("[]"); }
1618 | OPERATOR conversion_type_id
1621 c_print_type ($2, NULL, &buf, -1, 0,
1622 &type_print_raw_options);
1624 /* This also needs canonicalization. */
1626 = cp_canonicalize_string (buf.c_str ());
1628 canon = std::move (buf.string ());
1629 $$ = operator_stoken ((" " + canon).c_str ());
1635 name : NAME { $$ = $1.stoken; }
1636 | BLOCKNAME { $$ = $1.stoken; }
1637 | TYPENAME { $$ = $1.stoken; }
1638 | NAME_OR_INT { $$ = $1.stoken; }
1639 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1643 name_not_typename : NAME
1645 /* These would be useful if name_not_typename was useful, but it is just
1646 a fake for "variable", so these cause reduce/reduce conflicts because
1647 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1648 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1649 context where only a name could occur, this might be useful.
1654 struct field_of_this_result is_a_field_of_this;
1657 $$.sym = lookup_symbol ($1.ptr,
1658 expression_context_block,
1660 &is_a_field_of_this);
1661 $$.is_a_field_of_this
1662 = is_a_field_of_this.type != NULL;
1669 /* Like write_exp_string, but prepends a '~'. */
1672 write_destructor_name (struct parser_state *par_state, struct stoken token)
1674 char *copy = (char *) alloca (token.length + 1);
1677 memcpy (©[1], token.ptr, token.length);
1682 write_exp_string (par_state, token);
1685 /* Returns a stoken of the operator name given by OP (which does not
1686 include the string "operator"). */
1688 static struct stoken
1689 operator_stoken (const char *op)
1691 struct stoken st = { NULL, 0 };
1694 st.length = CP_OPERATOR_LEN + strlen (op);
1695 buf = (char *) malloc (st.length + 1);
1696 strcpy (buf, CP_OPERATOR_STR);
1700 /* The toplevel (c_parse) will free the memory allocated here. */
1701 make_cleanup (free, buf);
1705 /* Return true if the type is aggregate-like. */
1708 type_aggregate_p (struct type *type)
1710 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1711 || TYPE_CODE (type) == TYPE_CODE_UNION
1712 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1713 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1714 && TYPE_DECLARED_CLASS (type)));
1717 /* Validate a parameter typelist. */
1720 check_parameter_typelist (VEC (type_ptr) *params)
1725 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1727 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1731 if (VEC_length (type_ptr, params) == 1)
1736 VEC_free (type_ptr, params);
1737 error (_("parameter types following 'void'"));
1741 VEC_free (type_ptr, params);
1742 error (_("'void' invalid as parameter type"));
1748 /* Take care of parsing a number (anything that starts with a digit).
1749 Set yylval and return the token type; update lexptr.
1750 LEN is the number of characters in it. */
1752 /*** Needs some error checking for the float case ***/
1755 parse_number (struct parser_state *par_state,
1756 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1758 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1759 here, and we do kind of silly things like cast to unsigned. */
1766 int base = input_radix;
1769 /* Number of "L" suffixes encountered. */
1772 /* We have found a "L" or "U" suffix. */
1773 int found_suffix = 0;
1776 struct type *signed_type;
1777 struct type *unsigned_type;
1780 p = (char *) alloca (len);
1781 memcpy (p, buf, len);
1785 /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */
1786 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1788 putithere->typed_val_float.type
1789 = parse_type (par_state)->builtin_decfloat;
1792 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1794 putithere->typed_val_float.type
1795 = parse_type (par_state)->builtin_decdouble;
1798 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1800 putithere->typed_val_float.type
1801 = parse_type (par_state)->builtin_declong;
1804 /* Handle suffixes: 'f' for float, 'l' for long double. */
1805 else if (len >= 1 && tolower (p[len - 1]) == 'f')
1807 putithere->typed_val_float.type
1808 = parse_type (par_state)->builtin_float;
1811 else if (len >= 1 && tolower (p[len - 1]) == 'l')
1813 putithere->typed_val_float.type
1814 = parse_type (par_state)->builtin_long_double;
1817 /* Default type for floating-point literals is double. */
1820 putithere->typed_val_float.type
1821 = parse_type (par_state)->builtin_double;
1824 if (!parse_float (p, len,
1825 putithere->typed_val_float.type,
1826 putithere->typed_val_float.val))
1831 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1832 if (p[0] == '0' && len > 1)
1875 if (c >= 'A' && c <= 'Z')
1877 if (c != 'l' && c != 'u')
1879 if (c >= '0' && c <= '9')
1887 if (base > 10 && c >= 'a' && c <= 'f')
1891 n += i = c - 'a' + 10;
1904 return ERROR; /* Char not a digit */
1907 return ERROR; /* Invalid digit in this base */
1909 /* Portably test for overflow (only works for nonzero values, so make
1910 a second check for zero). FIXME: Can't we just make n and prevn
1911 unsigned and avoid this? */
1912 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1913 unsigned_p = 1; /* Try something unsigned */
1915 /* Portably test for unsigned overflow.
1916 FIXME: This check is wrong; for example it doesn't find overflow
1917 on 0x123456789 when LONGEST is 32 bits. */
1918 if (c != 'l' && c != 'u' && n != 0)
1920 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1921 error (_("Numeric constant too large."));
1926 /* An integer constant is an int, a long, or a long long. An L
1927 suffix forces it to be long; an LL suffix forces it to be long
1928 long. If not forced to a larger size, it gets the first type of
1929 the above that it fits in. To figure out whether it fits, we
1930 shift it right and see whether anything remains. Note that we
1931 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1932 operation, because many compilers will warn about such a shift
1933 (which always produces a zero result). Sometimes gdbarch_int_bit
1934 or gdbarch_long_bit will be that big, sometimes not. To deal with
1935 the case where it is we just always shift the value more than
1936 once, with fewer bits each time. */
1938 un = (ULONGEST)n >> 2;
1940 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1943 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1945 /* A large decimal (not hex or octal) constant (between INT_MAX
1946 and UINT_MAX) is a long or unsigned long, according to ANSI,
1947 never an unsigned int, but this code treats it as unsigned
1948 int. This probably should be fixed. GCC gives a warning on
1951 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1952 signed_type = parse_type (par_state)->builtin_int;
1954 else if (long_p <= 1
1955 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1958 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1959 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1960 signed_type = parse_type (par_state)->builtin_long;
1965 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1966 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1967 /* A long long does not fit in a LONGEST. */
1968 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1970 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1971 high_bit = (ULONGEST) 1 << shift;
1972 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1973 signed_type = parse_type (par_state)->builtin_long_long;
1976 putithere->typed_val_int.val = n;
1978 /* If the high bit of the worked out type is set then this number
1979 has to be unsigned. */
1981 if (unsigned_p || (n & high_bit))
1983 putithere->typed_val_int.type = unsigned_type;
1987 putithere->typed_val_int.type = signed_type;
1993 /* Temporary obstack used for holding strings. */
1994 static struct obstack tempbuf;
1995 static int tempbuf_init;
1997 /* Parse a C escape sequence. The initial backslash of the sequence
1998 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1999 last character of the sequence. If OUTPUT is not NULL, the
2000 translated form of the escape sequence will be written there. If
2001 OUTPUT is NULL, no output is written and the call will only affect
2002 *PTR. If an escape sequence is expressed in target bytes, then the
2003 entire sequence will simply be copied to OUTPUT. Return 1 if any
2004 character was emitted, 0 otherwise. */
2007 c_parse_escape (const char **ptr, struct obstack *output)
2009 const char *tokptr = *ptr;
2012 /* Some escape sequences undergo character set conversion. Those we
2016 /* Hex escapes do not undergo character set conversion, so keep
2017 the escape sequence for later. */
2020 obstack_grow_str (output, "\\x");
2022 if (!isxdigit (*tokptr))
2023 error (_("\\x escape without a following hex digit"));
2024 while (isxdigit (*tokptr))
2027 obstack_1grow (output, *tokptr);
2032 /* Octal escapes do not undergo character set conversion, so
2033 keep the escape sequence for later. */
2045 obstack_grow_str (output, "\\");
2047 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
2051 obstack_1grow (output, *tokptr);
2057 /* We handle UCNs later. We could handle them here, but that
2058 would mean a spurious error in the case where the UCN could
2059 be converted to the target charset but not the host
2065 int i, len = c == 'U' ? 8 : 4;
2068 obstack_1grow (output, '\\');
2069 obstack_1grow (output, *tokptr);
2072 if (!isxdigit (*tokptr))
2073 error (_("\\%c escape without a following hex digit"), c);
2074 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2077 obstack_1grow (output, *tokptr);
2083 /* We must pass backslash through so that it does not
2084 cause quoting during the second expansion. */
2087 obstack_grow_str (output, "\\\\");
2091 /* Escapes which undergo conversion. */
2094 obstack_1grow (output, '\a');
2099 obstack_1grow (output, '\b');
2104 obstack_1grow (output, '\f');
2109 obstack_1grow (output, '\n');
2114 obstack_1grow (output, '\r');
2119 obstack_1grow (output, '\t');
2124 obstack_1grow (output, '\v');
2128 /* GCC extension. */
2131 obstack_1grow (output, HOST_ESCAPE_CHAR);
2135 /* Backslash-newline expands to nothing at all. */
2141 /* A few escapes just expand to the character itself. */
2145 /* GCC extensions. */
2150 /* Unrecognized escapes turn into the character itself. */
2153 obstack_1grow (output, *tokptr);
2161 /* Parse a string or character literal from TOKPTR. The string or
2162 character may be wide or unicode. *OUTPTR is set to just after the
2163 end of the literal in the input string. The resulting token is
2164 stored in VALUE. This returns a token value, either STRING or
2165 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2166 number of host characters in the literal. */
2169 parse_string_or_char (const char *tokptr, const char **outptr,
2170 struct typed_stoken *value, int *host_chars)
2176 /* Build the gdb internal form of the input string in tempbuf. Note
2177 that the buffer is null byte terminated *only* for the
2178 convenience of debugging gdb itself and printing the buffer
2179 contents when the buffer contains no embedded nulls. Gdb does
2180 not depend upon the buffer being null byte terminated, it uses
2181 the length string instead. This allows gdb to handle C strings
2182 (as well as strings in other languages) with embedded null
2188 obstack_free (&tempbuf, NULL);
2189 obstack_init (&tempbuf);
2191 /* Record the string type. */
2194 type = C_WIDE_STRING;
2197 else if (*tokptr == 'u')
2202 else if (*tokptr == 'U')
2207 else if (*tokptr == '@')
2209 /* An Objective C string. */
2217 /* Skip the quote. */
2231 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2233 else if (c == quote)
2237 obstack_1grow (&tempbuf, c);
2239 /* FIXME: this does the wrong thing with multi-byte host
2240 characters. We could use mbrlen here, but that would
2241 make "set host-charset" a bit less useful. */
2246 if (*tokptr != quote)
2249 error (_("Unterminated string in expression."));
2251 error (_("Unmatched single quote."));
2256 value->ptr = (char *) obstack_base (&tempbuf);
2257 value->length = obstack_object_size (&tempbuf);
2261 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2264 /* This is used to associate some attributes with a token. */
2268 /* If this bit is set, the token is C++-only. */
2272 /* If this bit is set, the token is conditional: if there is a
2273 symbol of the same name, then the token is a symbol; otherwise,
2274 the token is a keyword. */
2278 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2284 enum exp_opcode opcode;
2288 static const struct token tokentab3[] =
2290 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2291 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2292 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2293 {"...", DOTDOTDOT, BINOP_END, 0}
2296 static const struct token tokentab2[] =
2298 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2299 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2300 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2301 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2302 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2303 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2304 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2305 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2306 {"++", INCREMENT, BINOP_END, 0},
2307 {"--", DECREMENT, BINOP_END, 0},
2308 {"->", ARROW, BINOP_END, 0},
2309 {"&&", ANDAND, BINOP_END, 0},
2310 {"||", OROR, BINOP_END, 0},
2311 /* "::" is *not* only C++: gdb overrides its meaning in several
2312 different ways, e.g., 'filename'::func, function::variable. */
2313 {"::", COLONCOLON, BINOP_END, 0},
2314 {"<<", LSH, BINOP_END, 0},
2315 {">>", RSH, BINOP_END, 0},
2316 {"==", EQUAL, BINOP_END, 0},
2317 {"!=", NOTEQUAL, BINOP_END, 0},
2318 {"<=", LEQ, BINOP_END, 0},
2319 {">=", GEQ, BINOP_END, 0},
2320 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2323 /* Identifier-like tokens. */
2324 static const struct token ident_tokens[] =
2326 {"unsigned", UNSIGNED, OP_NULL, 0},
2327 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2328 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2329 {"struct", STRUCT, OP_NULL, 0},
2330 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2331 {"sizeof", SIZEOF, OP_NULL, 0},
2332 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2333 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2334 {"class", CLASS, OP_NULL, FLAG_CXX},
2335 {"union", UNION, OP_NULL, 0},
2336 {"short", SHORT, OP_NULL, 0},
2337 {"const", CONST_KEYWORD, OP_NULL, 0},
2338 {"enum", ENUM, OP_NULL, 0},
2339 {"long", LONG, OP_NULL, 0},
2340 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2341 {"int", INT_KEYWORD, OP_NULL, 0},
2342 {"new", NEW, OP_NULL, FLAG_CXX},
2343 {"delete", DELETE, OP_NULL, FLAG_CXX},
2344 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2346 {"and", ANDAND, BINOP_END, FLAG_CXX},
2347 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2348 {"bitand", '&', OP_NULL, FLAG_CXX},
2349 {"bitor", '|', OP_NULL, FLAG_CXX},
2350 {"compl", '~', OP_NULL, FLAG_CXX},
2351 {"not", '!', OP_NULL, FLAG_CXX},
2352 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2353 {"or", OROR, BINOP_END, FLAG_CXX},
2354 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2355 {"xor", '^', OP_NULL, FLAG_CXX},
2356 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2358 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2359 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2360 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2361 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2363 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2364 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2365 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2366 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2367 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2369 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2372 /* When we find that lexptr (the global var defined in parse.c) is
2373 pointing at a macro invocation, we expand the invocation, and call
2374 scan_macro_expansion to save the old lexptr here and point lexptr
2375 into the expanded text. When we reach the end of that, we call
2376 end_macro_expansion to pop back to the value we saved here. The
2377 macro expansion code promises to return only fully-expanded text,
2378 so we don't need to "push" more than one level.
2380 This is disgusting, of course. It would be cleaner to do all macro
2381 expansion beforehand, and then hand that to lexptr. But we don't
2382 really know where the expression ends. Remember, in a command like
2384 (gdb) break *ADDRESS if CONDITION
2386 we evaluate ADDRESS in the scope of the current frame, but we
2387 evaluate CONDITION in the scope of the breakpoint's location. So
2388 it's simply wrong to try to macro-expand the whole thing at once. */
2389 static const char *macro_original_text;
2391 /* We save all intermediate macro expansions on this obstack for the
2392 duration of a single parse. The expansion text may sometimes have
2393 to live past the end of the expansion, due to yacc lookahead.
2394 Rather than try to be clever about saving the data for a single
2395 token, we simply keep it all and delete it after parsing has
2397 static struct obstack expansion_obstack;
2400 scan_macro_expansion (char *expansion)
2404 /* We'd better not be trying to push the stack twice. */
2405 gdb_assert (! macro_original_text);
2407 /* Copy to the obstack, and then free the intermediate
2409 copy = (char *) obstack_copy0 (&expansion_obstack, expansion,
2410 strlen (expansion));
2413 /* Save the old lexptr value, so we can return to it when we're done
2414 parsing the expanded text. */
2415 macro_original_text = lexptr;
2420 scanning_macro_expansion (void)
2422 return macro_original_text != 0;
2426 finished_macro_expansion (void)
2428 /* There'd better be something to pop back to. */
2429 gdb_assert (macro_original_text);
2431 /* Pop back to the original text. */
2432 lexptr = macro_original_text;
2433 macro_original_text = 0;
2437 scan_macro_cleanup (void *dummy)
2439 if (macro_original_text)
2440 finished_macro_expansion ();
2442 obstack_free (&expansion_obstack, NULL);
2445 /* Return true iff the token represents a C++ cast operator. */
2448 is_cast_operator (const char *token, int len)
2450 return (! strncmp (token, "dynamic_cast", len)
2451 || ! strncmp (token, "static_cast", len)
2452 || ! strncmp (token, "reinterpret_cast", len)
2453 || ! strncmp (token, "const_cast", len));
2456 /* The scope used for macro expansion. */
2457 static struct macro_scope *expression_macro_scope;
2459 /* This is set if a NAME token appeared at the very end of the input
2460 string, with no whitespace separating the name from the EOF. This
2461 is used only when parsing to do field name completion. */
2462 static int saw_name_at_eof;
2464 /* This is set if the previously-returned token was a structure
2465 operator -- either '.' or ARROW. */
2466 static bool last_was_structop;
2468 /* Read one token, getting characters through lexptr. */
2471 lex_one_token (struct parser_state *par_state, bool *is_quoted_name)
2476 const char *tokstart;
2477 bool saw_structop = last_was_structop;
2480 last_was_structop = false;
2481 *is_quoted_name = false;
2485 /* Check if this is a macro invocation that we need to expand. */
2486 if (! scanning_macro_expansion ())
2488 char *expanded = macro_expand_next (&lexptr,
2489 standard_macro_lookup,
2490 expression_macro_scope);
2493 scan_macro_expansion (expanded);
2496 prev_lexptr = lexptr;
2499 /* See if it is a special token of length 3. */
2500 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2501 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2503 if ((tokentab3[i].flags & FLAG_CXX) != 0
2504 && parse_language (par_state)->la_language != language_cplus)
2508 yylval.opcode = tokentab3[i].opcode;
2509 return tokentab3[i].token;
2512 /* See if it is a special token of length 2. */
2513 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2514 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2516 if ((tokentab2[i].flags & FLAG_CXX) != 0
2517 && parse_language (par_state)->la_language != language_cplus)
2521 yylval.opcode = tokentab2[i].opcode;
2522 if (tokentab2[i].token == ARROW)
2523 last_was_structop = 1;
2524 return tokentab2[i].token;
2527 switch (c = *tokstart)
2530 /* If we were just scanning the result of a macro expansion,
2531 then we need to resume scanning the original text.
2532 If we're parsing for field name completion, and the previous
2533 token allows such completion, return a COMPLETE token.
2534 Otherwise, we were already scanning the original text, and
2535 we're really done. */
2536 if (scanning_macro_expansion ())
2538 finished_macro_expansion ();
2541 else if (saw_name_at_eof)
2543 saw_name_at_eof = 0;
2546 else if (parse_completion && saw_structop)
2561 if (parse_language (par_state)->la_language == language_objc
2568 if (paren_depth == 0)
2575 if (comma_terminates
2577 && ! scanning_macro_expansion ())
2583 /* Might be a floating point number. */
2584 if (lexptr[1] < '0' || lexptr[1] > '9')
2586 last_was_structop = true;
2587 goto symbol; /* Nope, must be a symbol. */
2589 /* FALL THRU into number case. */
2602 /* It's a number. */
2603 int got_dot = 0, got_e = 0, toktype;
2604 const char *p = tokstart;
2605 int hex = input_radix > 10;
2607 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2612 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2620 /* This test includes !hex because 'e' is a valid hex digit
2621 and thus does not indicate a floating point number when
2622 the radix is hex. */
2623 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2624 got_dot = got_e = 1;
2625 /* This test does not include !hex, because a '.' always indicates
2626 a decimal floating point number regardless of the radix. */
2627 else if (!got_dot && *p == '.')
2629 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2630 && (*p == '-' || *p == '+'))
2631 /* This is the sign of the exponent, not the end of the
2634 /* We will take any letters or digits. parse_number will
2635 complain if past the radix, or if L or U are not final. */
2636 else if ((*p < '0' || *p > '9')
2637 && ((*p < 'a' || *p > 'z')
2638 && (*p < 'A' || *p > 'Z')))
2641 toktype = parse_number (par_state, tokstart, p - tokstart,
2642 got_dot|got_e, &yylval);
2643 if (toktype == ERROR)
2645 char *err_copy = (char *) alloca (p - tokstart + 1);
2647 memcpy (err_copy, tokstart, p - tokstart);
2648 err_copy[p - tokstart] = 0;
2649 error (_("Invalid number \"%s\"."), err_copy);
2657 const char *p = &tokstart[1];
2658 size_t len = strlen ("entry");
2660 if (parse_language (par_state)->la_language == language_objc)
2662 size_t len = strlen ("selector");
2664 if (strncmp (p, "selector", len) == 0
2665 && (p[len] == '\0' || isspace (p[len])))
2674 while (isspace (*p))
2676 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2708 if (tokstart[1] != '"' && tokstart[1] != '\'')
2717 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2722 error (_("Empty character constant."));
2723 else if (host_len > 2 && c == '\'')
2726 namelen = lexptr - tokstart - 1;
2727 *is_quoted_name = true;
2731 else if (host_len > 1)
2732 error (_("Invalid character constant."));
2738 if (!(c == '_' || c == '$'
2739 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2740 /* We must have come across a bad character (e.g. ';'). */
2741 error (_("Invalid character '%c' in expression."), c);
2743 /* It's a name. See how long it is. */
2745 for (c = tokstart[namelen];
2746 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2747 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2749 /* Template parameter lists are part of the name.
2750 FIXME: This mishandles `print $a<4&&$a>3'. */
2754 if (! is_cast_operator (tokstart, namelen))
2756 /* Scan ahead to get rest of the template specification. Note
2757 that we look ahead only when the '<' adjoins non-whitespace
2758 characters; for comparison expressions, e.g. "a < b > c",
2759 there must be spaces before the '<', etc. */
2760 const char *p = find_template_name_end (tokstart + namelen);
2763 namelen = p - tokstart;
2767 c = tokstart[++namelen];
2770 /* The token "if" terminates the expression and is NOT removed from
2771 the input stream. It doesn't count if it appears in the
2772 expansion of a macro. */
2774 && tokstart[0] == 'i'
2775 && tokstart[1] == 'f'
2776 && ! scanning_macro_expansion ())
2781 /* For the same reason (breakpoint conditions), "thread N"
2782 terminates the expression. "thread" could be an identifier, but
2783 an identifier is never followed by a number without intervening
2784 punctuation. "task" is similar. Handle abbreviations of these,
2785 similarly to breakpoint.c:find_condition_and_thread. */
2787 && (strncmp (tokstart, "thread", namelen) == 0
2788 || strncmp (tokstart, "task", namelen) == 0)
2789 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2790 && ! scanning_macro_expansion ())
2792 const char *p = tokstart + namelen + 1;
2794 while (*p == ' ' || *p == '\t')
2796 if (*p >= '0' && *p <= '9')
2804 yylval.sval.ptr = tokstart;
2805 yylval.sval.length = namelen;
2807 /* Catch specific keywords. */
2808 copy = copy_name (yylval.sval);
2809 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2810 if (strcmp (copy, ident_tokens[i].oper) == 0)
2812 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2813 && parse_language (par_state)->la_language != language_cplus)
2816 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2818 struct field_of_this_result is_a_field_of_this;
2820 if (lookup_symbol (copy, expression_context_block,
2822 (parse_language (par_state)->la_language
2823 == language_cplus ? &is_a_field_of_this
2827 /* The keyword is shadowed. */
2832 /* It is ok to always set this, even though we don't always
2833 strictly need to. */
2834 yylval.opcode = ident_tokens[i].opcode;
2835 return ident_tokens[i].token;
2838 if (*tokstart == '$')
2841 if (parse_completion && *lexptr == '\0')
2842 saw_name_at_eof = 1;
2844 yylval.ssym.stoken = yylval.sval;
2845 yylval.ssym.sym.symbol = NULL;
2846 yylval.ssym.sym.block = NULL;
2847 yylval.ssym.is_a_field_of_this = 0;
2851 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2858 DEF_VEC_O (token_and_value);
2860 /* A FIFO of tokens that have been read but not yet returned to the
2862 static VEC (token_and_value) *token_fifo;
2864 /* Non-zero if the lexer should return tokens from the FIFO. */
2867 /* Temporary storage for c_lex; this holds symbol names as they are
2869 auto_obstack name_obstack;
2871 /* Classify a NAME token. The contents of the token are in `yylval'.
2872 Updates yylval and returns the new token type. BLOCK is the block
2873 in which lookups start; this can be NULL to mean the global scope.
2874 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2875 in single quotes. IS_AFTER_STRUCTOP is true if this name follows
2876 a structure operator -- either '.' or ARROW */
2879 classify_name (struct parser_state *par_state, const struct block *block,
2880 bool is_quoted_name, bool is_after_structop)
2882 struct block_symbol bsym;
2884 struct field_of_this_result is_a_field_of_this;
2886 copy = copy_name (yylval.sval);
2888 /* Initialize this in case we *don't* use it in this call; that way
2889 we can refer to it unconditionally below. */
2890 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2892 bsym = lookup_symbol (copy, block, VAR_DOMAIN,
2893 parse_language (par_state)->la_name_of_this
2894 ? &is_a_field_of_this : NULL);
2896 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2898 yylval.ssym.sym = bsym;
2899 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2902 else if (!bsym.symbol)
2904 /* If we found a field of 'this', we might have erroneously
2905 found a constructor where we wanted a type name. Handle this
2906 case by noticing that we found a constructor and then look up
2907 the type tag instead. */
2908 if (is_a_field_of_this.type != NULL
2909 && is_a_field_of_this.fn_field != NULL
2910 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2913 struct field_of_this_result inner_is_a_field_of_this;
2915 bsym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2916 &inner_is_a_field_of_this);
2917 if (bsym.symbol != NULL)
2919 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2924 /* If we found a field on the "this" object, or we are looking
2925 up a field on a struct, then we want to prefer it over a
2926 filename. However, if the name was quoted, then it is better
2927 to check for a filename or a block, since this is the only
2928 way the user has of requiring the extension to be used. */
2929 if ((is_a_field_of_this.type == NULL && !is_after_structop)
2932 /* See if it's a file name. */
2933 struct symtab *symtab;
2935 symtab = lookup_symtab (copy);
2938 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
2945 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
2947 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2951 /* See if it's an ObjC classname. */
2952 if (parse_language (par_state)->la_language == language_objc && !bsym.symbol)
2954 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2959 yylval.theclass.theclass = Class;
2960 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2962 yylval.theclass.type = SYMBOL_TYPE (sym);
2967 /* Input names that aren't symbols but ARE valid hex numbers, when
2968 the input radix permits them, can be names or numbers depending
2969 on the parse. Note we support radixes > 16 here. */
2971 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2972 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2974 YYSTYPE newlval; /* Its value is ignored. */
2975 int hextype = parse_number (par_state, copy, yylval.sval.length,
2980 yylval.ssym.sym = bsym;
2981 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2986 /* Any other kind of symbol */
2987 yylval.ssym.sym = bsym;
2988 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2990 if (bsym.symbol == NULL
2991 && parse_language (par_state)->la_language == language_cplus
2992 && is_a_field_of_this.type == NULL
2993 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
2994 return UNKNOWN_CPP_NAME;
2999 /* Like classify_name, but used by the inner loop of the lexer, when a
3000 name might have already been seen. CONTEXT is the context type, or
3001 NULL if this is the first component of a name. */
3004 classify_inner_name (struct parser_state *par_state,
3005 const struct block *block, struct type *context)
3010 if (context == NULL)
3011 return classify_name (par_state, block, false, false);
3013 type = check_typedef (context);
3014 if (!type_aggregate_p (type))
3017 copy = copy_name (yylval.ssym.stoken);
3018 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3019 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN);
3021 /* If no symbol was found, search for a matching base class named
3022 COPY. This will allow users to enter qualified names of class members
3023 relative to the `this' pointer. */
3024 if (yylval.ssym.sym.symbol == NULL)
3026 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3028 if (base_type != NULL)
3030 yylval.tsym.type = base_type;
3037 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
3041 /* cp_lookup_nested_symbol might have accidentally found a constructor
3042 named COPY when we really wanted a base class of the same name.
3043 Double-check this case by looking for a base class. */
3045 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3047 if (base_type != NULL)
3049 yylval.tsym.type = base_type;
3056 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3062 internal_error (__FILE__, __LINE__, _("not reached"));
3065 /* The outer level of a two-level lexer. This calls the inner lexer
3066 to return tokens. It then either returns these tokens, or
3067 aggregates them into a larger token. This lets us work around a
3068 problem in our parsing approach, where the parser could not
3069 distinguish between qualified names and qualified types at the
3072 This approach is still not ideal, because it mishandles template
3073 types. See the comment in lex_one_token for an example. However,
3074 this is still an improvement over the earlier approach, and will
3075 suffice until we move to better parsing technology. */
3080 token_and_value current;
3081 int first_was_coloncolon, last_was_coloncolon;
3082 struct type *context_type = NULL;
3083 int last_to_examine, next_to_examine, checkpoint;
3084 const struct block *search_block;
3085 bool is_quoted_name, last_lex_was_structop;
3087 if (popping && !VEC_empty (token_and_value, token_fifo))
3091 last_lex_was_structop = last_was_structop;
3093 /* Read the first token and decide what to do. Most of the
3094 subsequent code is C++-only; but also depends on seeing a "::" or
3096 current.token = lex_one_token (pstate, &is_quoted_name);
3097 if (current.token == NAME)
3098 current.token = classify_name (pstate, expression_context_block,
3099 is_quoted_name, last_lex_was_structop);
3100 if (parse_language (pstate)->la_language != language_cplus
3101 || (current.token != TYPENAME && current.token != COLONCOLON
3102 && current.token != FILENAME))
3103 return current.token;
3105 /* Read any sequence of alternating "::" and name-like tokens into
3107 current.value = yylval;
3108 VEC_safe_push (token_and_value, token_fifo, ¤t);
3109 last_was_coloncolon = current.token == COLONCOLON;
3114 /* We ignore quoted names other than the very first one.
3115 Subsequent ones do not have any special meaning. */
3116 current.token = lex_one_token (pstate, &ignore);
3117 current.value = yylval;
3118 VEC_safe_push (token_and_value, token_fifo, ¤t);
3120 if ((last_was_coloncolon && current.token != NAME)
3121 || (!last_was_coloncolon && current.token != COLONCOLON))
3123 last_was_coloncolon = !last_was_coloncolon;
3127 /* We always read one extra token, so compute the number of tokens
3128 to examine accordingly. */
3129 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3130 next_to_examine = 0;
3132 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3135 name_obstack.clear ();
3137 if (current.token == FILENAME)
3138 search_block = current.value.bval;
3139 else if (current.token == COLONCOLON)
3140 search_block = NULL;
3143 gdb_assert (current.token == TYPENAME);
3144 search_block = expression_context_block;
3145 obstack_grow (&name_obstack, current.value.sval.ptr,
3146 current.value.sval.length);
3147 context_type = current.value.tsym.type;
3151 first_was_coloncolon = current.token == COLONCOLON;
3152 last_was_coloncolon = first_was_coloncolon;
3154 while (next_to_examine <= last_to_examine)
3156 token_and_value *next;
3158 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3161 if (next->token == NAME && last_was_coloncolon)
3165 yylval = next->value;
3166 classification = classify_inner_name (pstate, search_block,
3168 /* We keep going until we either run out of names, or until
3169 we have a qualified name which is not a type. */
3170 if (classification != TYPENAME && classification != NAME)
3173 /* Accept up to this token. */
3174 checkpoint = next_to_examine;
3176 /* Update the partial name we are constructing. */
3177 if (context_type != NULL)
3179 /* We don't want to put a leading "::" into the name. */
3180 obstack_grow_str (&name_obstack, "::");
3182 obstack_grow (&name_obstack, next->value.sval.ptr,
3183 next->value.sval.length);
3185 yylval.sval.ptr = (const char *) obstack_base (&name_obstack);
3186 yylval.sval.length = obstack_object_size (&name_obstack);
3187 current.value = yylval;
3188 current.token = classification;
3190 last_was_coloncolon = 0;
3192 if (classification == NAME)
3195 context_type = yylval.tsym.type;
3197 else if (next->token == COLONCOLON && !last_was_coloncolon)
3198 last_was_coloncolon = 1;
3201 /* We've reached the end of the name. */
3206 /* If we have a replacement token, install it as the first token in
3207 the FIFO, and delete the other constituent tokens. */
3210 current.value.sval.ptr
3211 = (const char *) obstack_copy0 (&expansion_obstack,
3212 current.value.sval.ptr,
3213 current.value.sval.length);
3215 VEC_replace (token_and_value, token_fifo, 0, ¤t);
3217 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3221 current = *VEC_index (token_and_value, token_fifo, 0);
3222 VEC_ordered_remove (token_and_value, token_fifo, 0);
3223 yylval = current.value;
3224 return current.token;
3228 c_parse (struct parser_state *par_state)
3231 struct cleanup *back_to;
3233 /* Setting up the parser state. */
3234 scoped_restore pstate_restore = make_scoped_restore (&pstate);
3235 gdb_assert (par_state != NULL);
3238 gdb::unique_xmalloc_ptr<struct macro_scope> macro_scope;
3240 if (expression_context_block)
3241 macro_scope = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3243 macro_scope = default_macro_scope ();
3245 macro_scope = user_macro_scope ();
3247 scoped_restore restore_macro_scope
3248 = make_scoped_restore (&expression_macro_scope, macro_scope.get ());
3250 /* Initialize macro expansion code. */
3251 obstack_init (&expansion_obstack);
3252 gdb_assert (! macro_original_text);
3253 /* Note that parsing (within yyparse) freely installs cleanups
3254 assuming they'll be run here (below). */
3255 back_to = make_cleanup (scan_macro_cleanup, 0);
3257 scoped_restore restore_yydebug = make_scoped_restore (&yydebug,
3260 /* Initialize some state used by the lexer. */
3261 last_was_structop = false;
3262 saw_name_at_eof = 0;
3264 VEC_free (token_and_value, token_fifo);
3266 name_obstack.clear ();
3268 result = yyparse ();
3269 do_cleanups (back_to);
3276 /* This is called via the YYPRINT macro when parser debugging is
3277 enabled. It prints a token's value. */
3280 c_print_token (FILE *file, int type, YYSTYPE value)
3285 parser_fprintf (file, "typed_val_int<%s, %s>",
3286 TYPE_SAFE_NAME (value.typed_val_int.type),
3287 pulongest (value.typed_val_int.val));
3293 char *copy = (char *) alloca (value.tsval.length + 1);
3295 memcpy (copy, value.tsval.ptr, value.tsval.length);
3296 copy[value.tsval.length] = '\0';
3298 parser_fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3304 parser_fprintf (file, "sval<%s>", copy_name (value.sval));
3308 parser_fprintf (file, "tsym<type=%s, name=%s>",
3309 TYPE_SAFE_NAME (value.tsym.type),
3310 copy_name (value.tsym.stoken));
3314 case UNKNOWN_CPP_NAME:
3317 parser_fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3318 copy_name (value.ssym.stoken),
3319 (value.ssym.sym.symbol == NULL
3320 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym.symbol)),
3321 value.ssym.is_a_field_of_this);
3325 parser_fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3333 yyerror (const char *msg)
3336 lexptr = prev_lexptr;
3338 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);