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 ? find_function_alias_target (msymbol)
1099 if (alias_target != NULL)
1101 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1103 (pstate, SYMBOL_BLOCK_VALUE (alias_target));
1104 write_exp_elt_sym (pstate, alias_target);
1105 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1108 write_exp_msymbol (pstate, msymbol);
1113 space_identifier : '@' NAME
1114 { insert_type_address_space (pstate, copy_name ($2.stoken)); }
1117 const_or_volatile: const_or_volatile_noopt
1121 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1124 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1125 | const_or_volatile_noopt
1128 const_or_volatile_or_space_identifier:
1129 const_or_volatile_or_space_identifier_noopt
1135 { insert_type (tp_pointer); }
1136 const_or_volatile_or_space_identifier
1138 { insert_type (tp_pointer); }
1139 const_or_volatile_or_space_identifier
1141 { insert_type (tp_reference); }
1143 { insert_type (tp_reference); }
1145 { insert_type (tp_rvalue_reference); }
1146 | ANDAND ptr_operator
1147 { insert_type (tp_rvalue_reference); }
1150 ptr_operator_ts: ptr_operator
1152 $$ = get_type_stack ();
1153 /* This cleanup is eventually run by
1155 make_cleanup (type_stack_cleanup, $$);
1159 abs_decl: ptr_operator_ts direct_abs_decl
1160 { $$ = append_type_stack ($2, $1); }
1165 direct_abs_decl: '(' abs_decl ')'
1167 | direct_abs_decl array_mod
1169 push_type_stack ($1);
1171 push_type (tp_array);
1172 $$ = get_type_stack ();
1177 push_type (tp_array);
1178 $$ = get_type_stack ();
1181 | direct_abs_decl func_mod
1183 push_type_stack ($1);
1185 $$ = get_type_stack ();
1190 $$ = get_type_stack ();
1200 | OBJC_LBRAC INT ']'
1206 | '(' parameter_typelist ')'
1210 /* We used to try to recognize pointer to member types here, but
1211 that didn't work (shift/reduce conflicts meant that these rules never
1212 got executed). The problem is that
1213 int (foo::bar::baz::bizzle)
1214 is a function type but
1215 int (foo::bar::baz::bizzle::*)
1216 is a pointer to member type. Stroustrup loses again! */
1221 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1225 { $$ = lookup_signed_typename (parse_language (pstate),
1226 parse_gdbarch (pstate),
1229 { $$ = lookup_signed_typename (parse_language (pstate),
1230 parse_gdbarch (pstate),
1233 { $$ = lookup_signed_typename (parse_language (pstate),
1234 parse_gdbarch (pstate),
1237 { $$ = lookup_signed_typename (parse_language (pstate),
1238 parse_gdbarch (pstate),
1240 | LONG SIGNED_KEYWORD INT_KEYWORD
1241 { $$ = lookup_signed_typename (parse_language (pstate),
1242 parse_gdbarch (pstate),
1244 | LONG SIGNED_KEYWORD
1245 { $$ = lookup_signed_typename (parse_language (pstate),
1246 parse_gdbarch (pstate),
1248 | SIGNED_KEYWORD LONG INT_KEYWORD
1249 { $$ = lookup_signed_typename (parse_language (pstate),
1250 parse_gdbarch (pstate),
1252 | UNSIGNED LONG INT_KEYWORD
1253 { $$ = lookup_unsigned_typename (parse_language (pstate),
1254 parse_gdbarch (pstate),
1256 | LONG UNSIGNED INT_KEYWORD
1257 { $$ = lookup_unsigned_typename (parse_language (pstate),
1258 parse_gdbarch (pstate),
1261 { $$ = lookup_unsigned_typename (parse_language (pstate),
1262 parse_gdbarch (pstate),
1265 { $$ = lookup_signed_typename (parse_language (pstate),
1266 parse_gdbarch (pstate),
1268 | LONG LONG INT_KEYWORD
1269 { $$ = lookup_signed_typename (parse_language (pstate),
1270 parse_gdbarch (pstate),
1272 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1273 { $$ = lookup_signed_typename (parse_language (pstate),
1274 parse_gdbarch (pstate),
1276 | LONG LONG SIGNED_KEYWORD
1277 { $$ = lookup_signed_typename (parse_language (pstate),
1278 parse_gdbarch (pstate),
1280 | SIGNED_KEYWORD LONG LONG
1281 { $$ = lookup_signed_typename (parse_language (pstate),
1282 parse_gdbarch (pstate),
1284 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1285 { $$ = lookup_signed_typename (parse_language (pstate),
1286 parse_gdbarch (pstate),
1288 | UNSIGNED LONG LONG
1289 { $$ = lookup_unsigned_typename (parse_language (pstate),
1290 parse_gdbarch (pstate),
1292 | UNSIGNED LONG LONG INT_KEYWORD
1293 { $$ = lookup_unsigned_typename (parse_language (pstate),
1294 parse_gdbarch (pstate),
1296 | LONG LONG UNSIGNED
1297 { $$ = lookup_unsigned_typename (parse_language (pstate),
1298 parse_gdbarch (pstate),
1300 | LONG LONG UNSIGNED INT_KEYWORD
1301 { $$ = lookup_unsigned_typename (parse_language (pstate),
1302 parse_gdbarch (pstate),
1305 { $$ = lookup_signed_typename (parse_language (pstate),
1306 parse_gdbarch (pstate),
1308 | SHORT SIGNED_KEYWORD INT_KEYWORD
1309 { $$ = lookup_signed_typename (parse_language (pstate),
1310 parse_gdbarch (pstate),
1312 | SHORT SIGNED_KEYWORD
1313 { $$ = lookup_signed_typename (parse_language (pstate),
1314 parse_gdbarch (pstate),
1316 | UNSIGNED SHORT INT_KEYWORD
1317 { $$ = lookup_unsigned_typename (parse_language (pstate),
1318 parse_gdbarch (pstate),
1321 { $$ = lookup_unsigned_typename (parse_language (pstate),
1322 parse_gdbarch (pstate),
1324 | SHORT UNSIGNED INT_KEYWORD
1325 { $$ = lookup_unsigned_typename (parse_language (pstate),
1326 parse_gdbarch (pstate),
1329 { $$ = lookup_typename (parse_language (pstate),
1330 parse_gdbarch (pstate),
1332 (struct block *) NULL,
1334 | LONG DOUBLE_KEYWORD
1335 { $$ = lookup_typename (parse_language (pstate),
1336 parse_gdbarch (pstate),
1338 (struct block *) NULL,
1341 { $$ = lookup_struct (copy_name ($2),
1342 expression_context_block); }
1345 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1348 | STRUCT name COMPLETE
1350 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1355 { $$ = lookup_struct (copy_name ($2),
1356 expression_context_block); }
1359 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1362 | CLASS name COMPLETE
1364 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1369 { $$ = lookup_union (copy_name ($2),
1370 expression_context_block); }
1373 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1376 | UNION name COMPLETE
1378 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1383 { $$ = lookup_enum (copy_name ($2),
1384 expression_context_block); }
1387 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1390 | ENUM name COMPLETE
1392 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1396 | UNSIGNED type_name
1397 { $$ = lookup_unsigned_typename (parse_language (pstate),
1398 parse_gdbarch (pstate),
1399 TYPE_NAME($2.type)); }
1401 { $$ = lookup_unsigned_typename (parse_language (pstate),
1402 parse_gdbarch (pstate),
1404 | SIGNED_KEYWORD type_name
1405 { $$ = lookup_signed_typename (parse_language (pstate),
1406 parse_gdbarch (pstate),
1407 TYPE_NAME($2.type)); }
1409 { $$ = lookup_signed_typename (parse_language (pstate),
1410 parse_gdbarch (pstate),
1412 /* It appears that this rule for templates is never
1413 reduced; template recognition happens by lookahead
1414 in the token processing code in yylex. */
1415 | TEMPLATE name '<' type '>'
1416 { $$ = lookup_template_type(copy_name($2), $4,
1417 expression_context_block);
1419 | const_or_volatile_or_space_identifier_noopt typebase
1420 { $$ = follow_types ($2); }
1421 | typebase const_or_volatile_or_space_identifier_noopt
1422 { $$ = follow_types ($1); }
1428 $$.stoken.ptr = "int";
1429 $$.stoken.length = 3;
1430 $$.type = lookup_signed_typename (parse_language (pstate),
1431 parse_gdbarch (pstate),
1436 $$.stoken.ptr = "long";
1437 $$.stoken.length = 4;
1438 $$.type = lookup_signed_typename (parse_language (pstate),
1439 parse_gdbarch (pstate),
1444 $$.stoken.ptr = "short";
1445 $$.stoken.length = 5;
1446 $$.type = lookup_signed_typename (parse_language (pstate),
1447 parse_gdbarch (pstate),
1454 { check_parameter_typelist ($1); }
1455 | nonempty_typelist ',' DOTDOTDOT
1457 VEC_safe_push (type_ptr, $1, NULL);
1458 check_parameter_typelist ($1);
1466 VEC (type_ptr) *typelist = NULL;
1467 VEC_safe_push (type_ptr, typelist, $1);
1470 | nonempty_typelist ',' type
1472 VEC_safe_push (type_ptr, $1, $3);
1480 push_type_stack ($2);
1481 $$ = follow_types ($1);
1485 conversion_type_id: typebase conversion_declarator
1486 { $$ = follow_types ($1); }
1489 conversion_declarator: /* Nothing. */
1490 | ptr_operator conversion_declarator
1493 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1494 | VOLATILE_KEYWORD CONST_KEYWORD
1497 const_or_volatile_noopt: const_and_volatile
1498 { insert_type (tp_const);
1499 insert_type (tp_volatile);
1502 { insert_type (tp_const); }
1504 { insert_type (tp_volatile); }
1508 { $$ = operator_stoken (" new"); }
1510 { $$ = operator_stoken (" delete"); }
1511 | OPERATOR NEW '[' ']'
1512 { $$ = operator_stoken (" new[]"); }
1513 | OPERATOR DELETE '[' ']'
1514 { $$ = operator_stoken (" delete[]"); }
1515 | OPERATOR NEW OBJC_LBRAC ']'
1516 { $$ = operator_stoken (" new[]"); }
1517 | OPERATOR DELETE OBJC_LBRAC ']'
1518 { $$ = operator_stoken (" delete[]"); }
1520 { $$ = operator_stoken ("+"); }
1522 { $$ = operator_stoken ("-"); }
1524 { $$ = operator_stoken ("*"); }
1526 { $$ = operator_stoken ("/"); }
1528 { $$ = operator_stoken ("%"); }
1530 { $$ = operator_stoken ("^"); }
1532 { $$ = operator_stoken ("&"); }
1534 { $$ = operator_stoken ("|"); }
1536 { $$ = operator_stoken ("~"); }
1538 { $$ = operator_stoken ("!"); }
1540 { $$ = operator_stoken ("="); }
1542 { $$ = operator_stoken ("<"); }
1544 { $$ = operator_stoken (">"); }
1545 | OPERATOR ASSIGN_MODIFY
1546 { const char *op = " unknown";
1570 case BINOP_BITWISE_IOR:
1573 case BINOP_BITWISE_AND:
1576 case BINOP_BITWISE_XOR:
1583 $$ = operator_stoken (op);
1586 { $$ = operator_stoken ("<<"); }
1588 { $$ = operator_stoken (">>"); }
1590 { $$ = operator_stoken ("=="); }
1592 { $$ = operator_stoken ("!="); }
1594 { $$ = operator_stoken ("<="); }
1596 { $$ = operator_stoken (">="); }
1598 { $$ = operator_stoken ("&&"); }
1600 { $$ = operator_stoken ("||"); }
1601 | OPERATOR INCREMENT
1602 { $$ = operator_stoken ("++"); }
1603 | OPERATOR DECREMENT
1604 { $$ = operator_stoken ("--"); }
1606 { $$ = operator_stoken (","); }
1607 | OPERATOR ARROW_STAR
1608 { $$ = operator_stoken ("->*"); }
1610 { $$ = operator_stoken ("->"); }
1612 { $$ = operator_stoken ("()"); }
1614 { $$ = operator_stoken ("[]"); }
1615 | OPERATOR OBJC_LBRAC ']'
1616 { $$ = operator_stoken ("[]"); }
1617 | OPERATOR conversion_type_id
1620 c_print_type ($2, NULL, &buf, -1, 0,
1621 &type_print_raw_options);
1623 /* This also needs canonicalization. */
1625 = cp_canonicalize_string (buf.c_str ());
1627 canon = std::move (buf.string ());
1628 $$ = operator_stoken ((" " + canon).c_str ());
1634 name : NAME { $$ = $1.stoken; }
1635 | BLOCKNAME { $$ = $1.stoken; }
1636 | TYPENAME { $$ = $1.stoken; }
1637 | NAME_OR_INT { $$ = $1.stoken; }
1638 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1642 name_not_typename : NAME
1644 /* These would be useful if name_not_typename was useful, but it is just
1645 a fake for "variable", so these cause reduce/reduce conflicts because
1646 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1647 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1648 context where only a name could occur, this might be useful.
1653 struct field_of_this_result is_a_field_of_this;
1656 $$.sym = lookup_symbol ($1.ptr,
1657 expression_context_block,
1659 &is_a_field_of_this);
1660 $$.is_a_field_of_this
1661 = is_a_field_of_this.type != NULL;
1668 /* Like write_exp_string, but prepends a '~'. */
1671 write_destructor_name (struct parser_state *par_state, struct stoken token)
1673 char *copy = (char *) alloca (token.length + 1);
1676 memcpy (©[1], token.ptr, token.length);
1681 write_exp_string (par_state, token);
1684 /* Returns a stoken of the operator name given by OP (which does not
1685 include the string "operator"). */
1687 static struct stoken
1688 operator_stoken (const char *op)
1690 struct stoken st = { NULL, 0 };
1693 st.length = CP_OPERATOR_LEN + strlen (op);
1694 buf = (char *) malloc (st.length + 1);
1695 strcpy (buf, CP_OPERATOR_STR);
1699 /* The toplevel (c_parse) will free the memory allocated here. */
1700 make_cleanup (free, buf);
1704 /* Return true if the type is aggregate-like. */
1707 type_aggregate_p (struct type *type)
1709 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1710 || TYPE_CODE (type) == TYPE_CODE_UNION
1711 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1712 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1713 && TYPE_DECLARED_CLASS (type)));
1716 /* Validate a parameter typelist. */
1719 check_parameter_typelist (VEC (type_ptr) *params)
1724 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1726 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1730 if (VEC_length (type_ptr, params) == 1)
1735 VEC_free (type_ptr, params);
1736 error (_("parameter types following 'void'"));
1740 VEC_free (type_ptr, params);
1741 error (_("'void' invalid as parameter type"));
1747 /* Take care of parsing a number (anything that starts with a digit).
1748 Set yylval and return the token type; update lexptr.
1749 LEN is the number of characters in it. */
1751 /*** Needs some error checking for the float case ***/
1754 parse_number (struct parser_state *par_state,
1755 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1757 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1758 here, and we do kind of silly things like cast to unsigned. */
1765 int base = input_radix;
1768 /* Number of "L" suffixes encountered. */
1771 /* We have found a "L" or "U" suffix. */
1772 int found_suffix = 0;
1775 struct type *signed_type;
1776 struct type *unsigned_type;
1779 p = (char *) alloca (len);
1780 memcpy (p, buf, len);
1784 /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */
1785 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1787 putithere->typed_val_float.type
1788 = parse_type (par_state)->builtin_decfloat;
1791 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1793 putithere->typed_val_float.type
1794 = parse_type (par_state)->builtin_decdouble;
1797 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1799 putithere->typed_val_float.type
1800 = parse_type (par_state)->builtin_declong;
1803 /* Handle suffixes: 'f' for float, 'l' for long double. */
1804 else if (len >= 1 && tolower (p[len - 1]) == 'f')
1806 putithere->typed_val_float.type
1807 = parse_type (par_state)->builtin_float;
1810 else if (len >= 1 && tolower (p[len - 1]) == 'l')
1812 putithere->typed_val_float.type
1813 = parse_type (par_state)->builtin_long_double;
1816 /* Default type for floating-point literals is double. */
1819 putithere->typed_val_float.type
1820 = parse_type (par_state)->builtin_double;
1823 if (!parse_float (p, len,
1824 putithere->typed_val_float.type,
1825 putithere->typed_val_float.val))
1830 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1831 if (p[0] == '0' && len > 1)
1874 if (c >= 'A' && c <= 'Z')
1876 if (c != 'l' && c != 'u')
1878 if (c >= '0' && c <= '9')
1886 if (base > 10 && c >= 'a' && c <= 'f')
1890 n += i = c - 'a' + 10;
1903 return ERROR; /* Char not a digit */
1906 return ERROR; /* Invalid digit in this base */
1908 /* Portably test for overflow (only works for nonzero values, so make
1909 a second check for zero). FIXME: Can't we just make n and prevn
1910 unsigned and avoid this? */
1911 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1912 unsigned_p = 1; /* Try something unsigned */
1914 /* Portably test for unsigned overflow.
1915 FIXME: This check is wrong; for example it doesn't find overflow
1916 on 0x123456789 when LONGEST is 32 bits. */
1917 if (c != 'l' && c != 'u' && n != 0)
1919 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1920 error (_("Numeric constant too large."));
1925 /* An integer constant is an int, a long, or a long long. An L
1926 suffix forces it to be long; an LL suffix forces it to be long
1927 long. If not forced to a larger size, it gets the first type of
1928 the above that it fits in. To figure out whether it fits, we
1929 shift it right and see whether anything remains. Note that we
1930 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1931 operation, because many compilers will warn about such a shift
1932 (which always produces a zero result). Sometimes gdbarch_int_bit
1933 or gdbarch_long_bit will be that big, sometimes not. To deal with
1934 the case where it is we just always shift the value more than
1935 once, with fewer bits each time. */
1937 un = (ULONGEST)n >> 2;
1939 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1942 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1944 /* A large decimal (not hex or octal) constant (between INT_MAX
1945 and UINT_MAX) is a long or unsigned long, according to ANSI,
1946 never an unsigned int, but this code treats it as unsigned
1947 int. This probably should be fixed. GCC gives a warning on
1950 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1951 signed_type = parse_type (par_state)->builtin_int;
1953 else if (long_p <= 1
1954 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1957 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1958 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1959 signed_type = parse_type (par_state)->builtin_long;
1964 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1965 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1966 /* A long long does not fit in a LONGEST. */
1967 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1969 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1970 high_bit = (ULONGEST) 1 << shift;
1971 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1972 signed_type = parse_type (par_state)->builtin_long_long;
1975 putithere->typed_val_int.val = n;
1977 /* If the high bit of the worked out type is set then this number
1978 has to be unsigned. */
1980 if (unsigned_p || (n & high_bit))
1982 putithere->typed_val_int.type = unsigned_type;
1986 putithere->typed_val_int.type = signed_type;
1992 /* Temporary obstack used for holding strings. */
1993 static struct obstack tempbuf;
1994 static int tempbuf_init;
1996 /* Parse a C escape sequence. The initial backslash of the sequence
1997 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1998 last character of the sequence. If OUTPUT is not NULL, the
1999 translated form of the escape sequence will be written there. If
2000 OUTPUT is NULL, no output is written and the call will only affect
2001 *PTR. If an escape sequence is expressed in target bytes, then the
2002 entire sequence will simply be copied to OUTPUT. Return 1 if any
2003 character was emitted, 0 otherwise. */
2006 c_parse_escape (const char **ptr, struct obstack *output)
2008 const char *tokptr = *ptr;
2011 /* Some escape sequences undergo character set conversion. Those we
2015 /* Hex escapes do not undergo character set conversion, so keep
2016 the escape sequence for later. */
2019 obstack_grow_str (output, "\\x");
2021 if (!isxdigit (*tokptr))
2022 error (_("\\x escape without a following hex digit"));
2023 while (isxdigit (*tokptr))
2026 obstack_1grow (output, *tokptr);
2031 /* Octal escapes do not undergo character set conversion, so
2032 keep the escape sequence for later. */
2044 obstack_grow_str (output, "\\");
2046 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
2050 obstack_1grow (output, *tokptr);
2056 /* We handle UCNs later. We could handle them here, but that
2057 would mean a spurious error in the case where the UCN could
2058 be converted to the target charset but not the host
2064 int i, len = c == 'U' ? 8 : 4;
2067 obstack_1grow (output, '\\');
2068 obstack_1grow (output, *tokptr);
2071 if (!isxdigit (*tokptr))
2072 error (_("\\%c escape without a following hex digit"), c);
2073 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2076 obstack_1grow (output, *tokptr);
2082 /* We must pass backslash through so that it does not
2083 cause quoting during the second expansion. */
2086 obstack_grow_str (output, "\\\\");
2090 /* Escapes which undergo conversion. */
2093 obstack_1grow (output, '\a');
2098 obstack_1grow (output, '\b');
2103 obstack_1grow (output, '\f');
2108 obstack_1grow (output, '\n');
2113 obstack_1grow (output, '\r');
2118 obstack_1grow (output, '\t');
2123 obstack_1grow (output, '\v');
2127 /* GCC extension. */
2130 obstack_1grow (output, HOST_ESCAPE_CHAR);
2134 /* Backslash-newline expands to nothing at all. */
2140 /* A few escapes just expand to the character itself. */
2144 /* GCC extensions. */
2149 /* Unrecognized escapes turn into the character itself. */
2152 obstack_1grow (output, *tokptr);
2160 /* Parse a string or character literal from TOKPTR. The string or
2161 character may be wide or unicode. *OUTPTR is set to just after the
2162 end of the literal in the input string. The resulting token is
2163 stored in VALUE. This returns a token value, either STRING or
2164 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2165 number of host characters in the literal. */
2168 parse_string_or_char (const char *tokptr, const char **outptr,
2169 struct typed_stoken *value, int *host_chars)
2175 /* Build the gdb internal form of the input string in tempbuf. Note
2176 that the buffer is null byte terminated *only* for the
2177 convenience of debugging gdb itself and printing the buffer
2178 contents when the buffer contains no embedded nulls. Gdb does
2179 not depend upon the buffer being null byte terminated, it uses
2180 the length string instead. This allows gdb to handle C strings
2181 (as well as strings in other languages) with embedded null
2187 obstack_free (&tempbuf, NULL);
2188 obstack_init (&tempbuf);
2190 /* Record the string type. */
2193 type = C_WIDE_STRING;
2196 else if (*tokptr == 'u')
2201 else if (*tokptr == 'U')
2206 else if (*tokptr == '@')
2208 /* An Objective C string. */
2216 /* Skip the quote. */
2230 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2232 else if (c == quote)
2236 obstack_1grow (&tempbuf, c);
2238 /* FIXME: this does the wrong thing with multi-byte host
2239 characters. We could use mbrlen here, but that would
2240 make "set host-charset" a bit less useful. */
2245 if (*tokptr != quote)
2248 error (_("Unterminated string in expression."));
2250 error (_("Unmatched single quote."));
2255 value->ptr = (char *) obstack_base (&tempbuf);
2256 value->length = obstack_object_size (&tempbuf);
2260 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2263 /* This is used to associate some attributes with a token. */
2267 /* If this bit is set, the token is C++-only. */
2271 /* If this bit is set, the token is conditional: if there is a
2272 symbol of the same name, then the token is a symbol; otherwise,
2273 the token is a keyword. */
2277 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2283 enum exp_opcode opcode;
2287 static const struct token tokentab3[] =
2289 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2290 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2291 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2292 {"...", DOTDOTDOT, BINOP_END, 0}
2295 static const struct token tokentab2[] =
2297 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2298 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2299 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2300 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2301 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2302 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2303 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2304 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2305 {"++", INCREMENT, BINOP_END, 0},
2306 {"--", DECREMENT, BINOP_END, 0},
2307 {"->", ARROW, BINOP_END, 0},
2308 {"&&", ANDAND, BINOP_END, 0},
2309 {"||", OROR, BINOP_END, 0},
2310 /* "::" is *not* only C++: gdb overrides its meaning in several
2311 different ways, e.g., 'filename'::func, function::variable. */
2312 {"::", COLONCOLON, BINOP_END, 0},
2313 {"<<", LSH, BINOP_END, 0},
2314 {">>", RSH, BINOP_END, 0},
2315 {"==", EQUAL, BINOP_END, 0},
2316 {"!=", NOTEQUAL, BINOP_END, 0},
2317 {"<=", LEQ, BINOP_END, 0},
2318 {">=", GEQ, BINOP_END, 0},
2319 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2322 /* Identifier-like tokens. */
2323 static const struct token ident_tokens[] =
2325 {"unsigned", UNSIGNED, OP_NULL, 0},
2326 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2327 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2328 {"struct", STRUCT, OP_NULL, 0},
2329 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2330 {"sizeof", SIZEOF, OP_NULL, 0},
2331 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2332 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2333 {"class", CLASS, OP_NULL, FLAG_CXX},
2334 {"union", UNION, OP_NULL, 0},
2335 {"short", SHORT, OP_NULL, 0},
2336 {"const", CONST_KEYWORD, OP_NULL, 0},
2337 {"enum", ENUM, OP_NULL, 0},
2338 {"long", LONG, OP_NULL, 0},
2339 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2340 {"int", INT_KEYWORD, OP_NULL, 0},
2341 {"new", NEW, OP_NULL, FLAG_CXX},
2342 {"delete", DELETE, OP_NULL, FLAG_CXX},
2343 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2345 {"and", ANDAND, BINOP_END, FLAG_CXX},
2346 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2347 {"bitand", '&', OP_NULL, FLAG_CXX},
2348 {"bitor", '|', OP_NULL, FLAG_CXX},
2349 {"compl", '~', OP_NULL, FLAG_CXX},
2350 {"not", '!', OP_NULL, FLAG_CXX},
2351 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2352 {"or", OROR, BINOP_END, FLAG_CXX},
2353 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2354 {"xor", '^', OP_NULL, FLAG_CXX},
2355 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2357 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2358 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2359 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2360 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2362 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2363 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2364 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2365 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2366 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2368 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2371 /* When we find that lexptr (the global var defined in parse.c) is
2372 pointing at a macro invocation, we expand the invocation, and call
2373 scan_macro_expansion to save the old lexptr here and point lexptr
2374 into the expanded text. When we reach the end of that, we call
2375 end_macro_expansion to pop back to the value we saved here. The
2376 macro expansion code promises to return only fully-expanded text,
2377 so we don't need to "push" more than one level.
2379 This is disgusting, of course. It would be cleaner to do all macro
2380 expansion beforehand, and then hand that to lexptr. But we don't
2381 really know where the expression ends. Remember, in a command like
2383 (gdb) break *ADDRESS if CONDITION
2385 we evaluate ADDRESS in the scope of the current frame, but we
2386 evaluate CONDITION in the scope of the breakpoint's location. So
2387 it's simply wrong to try to macro-expand the whole thing at once. */
2388 static const char *macro_original_text;
2390 /* We save all intermediate macro expansions on this obstack for the
2391 duration of a single parse. The expansion text may sometimes have
2392 to live past the end of the expansion, due to yacc lookahead.
2393 Rather than try to be clever about saving the data for a single
2394 token, we simply keep it all and delete it after parsing has
2396 static struct obstack expansion_obstack;
2399 scan_macro_expansion (char *expansion)
2403 /* We'd better not be trying to push the stack twice. */
2404 gdb_assert (! macro_original_text);
2406 /* Copy to the obstack, and then free the intermediate
2408 copy = (char *) obstack_copy0 (&expansion_obstack, expansion,
2409 strlen (expansion));
2412 /* Save the old lexptr value, so we can return to it when we're done
2413 parsing the expanded text. */
2414 macro_original_text = lexptr;
2419 scanning_macro_expansion (void)
2421 return macro_original_text != 0;
2425 finished_macro_expansion (void)
2427 /* There'd better be something to pop back to. */
2428 gdb_assert (macro_original_text);
2430 /* Pop back to the original text. */
2431 lexptr = macro_original_text;
2432 macro_original_text = 0;
2436 scan_macro_cleanup (void *dummy)
2438 if (macro_original_text)
2439 finished_macro_expansion ();
2441 obstack_free (&expansion_obstack, NULL);
2444 /* Return true iff the token represents a C++ cast operator. */
2447 is_cast_operator (const char *token, int len)
2449 return (! strncmp (token, "dynamic_cast", len)
2450 || ! strncmp (token, "static_cast", len)
2451 || ! strncmp (token, "reinterpret_cast", len)
2452 || ! strncmp (token, "const_cast", len));
2455 /* The scope used for macro expansion. */
2456 static struct macro_scope *expression_macro_scope;
2458 /* This is set if a NAME token appeared at the very end of the input
2459 string, with no whitespace separating the name from the EOF. This
2460 is used only when parsing to do field name completion. */
2461 static int saw_name_at_eof;
2463 /* This is set if the previously-returned token was a structure
2464 operator -- either '.' or ARROW. */
2465 static bool last_was_structop;
2467 /* Read one token, getting characters through lexptr. */
2470 lex_one_token (struct parser_state *par_state, bool *is_quoted_name)
2475 const char *tokstart;
2476 bool saw_structop = last_was_structop;
2479 last_was_structop = false;
2480 *is_quoted_name = false;
2484 /* Check if this is a macro invocation that we need to expand. */
2485 if (! scanning_macro_expansion ())
2487 char *expanded = macro_expand_next (&lexptr,
2488 standard_macro_lookup,
2489 expression_macro_scope);
2492 scan_macro_expansion (expanded);
2495 prev_lexptr = lexptr;
2498 /* See if it is a special token of length 3. */
2499 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2500 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2502 if ((tokentab3[i].flags & FLAG_CXX) != 0
2503 && parse_language (par_state)->la_language != language_cplus)
2507 yylval.opcode = tokentab3[i].opcode;
2508 return tokentab3[i].token;
2511 /* See if it is a special token of length 2. */
2512 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2513 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2515 if ((tokentab2[i].flags & FLAG_CXX) != 0
2516 && parse_language (par_state)->la_language != language_cplus)
2520 yylval.opcode = tokentab2[i].opcode;
2521 if (tokentab2[i].token == ARROW)
2522 last_was_structop = 1;
2523 return tokentab2[i].token;
2526 switch (c = *tokstart)
2529 /* If we were just scanning the result of a macro expansion,
2530 then we need to resume scanning the original text.
2531 If we're parsing for field name completion, and the previous
2532 token allows such completion, return a COMPLETE token.
2533 Otherwise, we were already scanning the original text, and
2534 we're really done. */
2535 if (scanning_macro_expansion ())
2537 finished_macro_expansion ();
2540 else if (saw_name_at_eof)
2542 saw_name_at_eof = 0;
2545 else if (parse_completion && saw_structop)
2560 if (parse_language (par_state)->la_language == language_objc
2567 if (paren_depth == 0)
2574 if (comma_terminates
2576 && ! scanning_macro_expansion ())
2582 /* Might be a floating point number. */
2583 if (lexptr[1] < '0' || lexptr[1] > '9')
2585 last_was_structop = true;
2586 goto symbol; /* Nope, must be a symbol. */
2588 /* FALL THRU into number case. */
2601 /* It's a number. */
2602 int got_dot = 0, got_e = 0, toktype;
2603 const char *p = tokstart;
2604 int hex = input_radix > 10;
2606 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2611 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2619 /* This test includes !hex because 'e' is a valid hex digit
2620 and thus does not indicate a floating point number when
2621 the radix is hex. */
2622 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2623 got_dot = got_e = 1;
2624 /* This test does not include !hex, because a '.' always indicates
2625 a decimal floating point number regardless of the radix. */
2626 else if (!got_dot && *p == '.')
2628 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2629 && (*p == '-' || *p == '+'))
2630 /* This is the sign of the exponent, not the end of the
2633 /* We will take any letters or digits. parse_number will
2634 complain if past the radix, or if L or U are not final. */
2635 else if ((*p < '0' || *p > '9')
2636 && ((*p < 'a' || *p > 'z')
2637 && (*p < 'A' || *p > 'Z')))
2640 toktype = parse_number (par_state, tokstart, p - tokstart,
2641 got_dot|got_e, &yylval);
2642 if (toktype == ERROR)
2644 char *err_copy = (char *) alloca (p - tokstart + 1);
2646 memcpy (err_copy, tokstart, p - tokstart);
2647 err_copy[p - tokstart] = 0;
2648 error (_("Invalid number \"%s\"."), err_copy);
2656 const char *p = &tokstart[1];
2657 size_t len = strlen ("entry");
2659 if (parse_language (par_state)->la_language == language_objc)
2661 size_t len = strlen ("selector");
2663 if (strncmp (p, "selector", len) == 0
2664 && (p[len] == '\0' || isspace (p[len])))
2673 while (isspace (*p))
2675 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2707 if (tokstart[1] != '"' && tokstart[1] != '\'')
2716 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2721 error (_("Empty character constant."));
2722 else if (host_len > 2 && c == '\'')
2725 namelen = lexptr - tokstart - 1;
2726 *is_quoted_name = true;
2730 else if (host_len > 1)
2731 error (_("Invalid character constant."));
2737 if (!(c == '_' || c == '$'
2738 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2739 /* We must have come across a bad character (e.g. ';'). */
2740 error (_("Invalid character '%c' in expression."), c);
2742 /* It's a name. See how long it is. */
2744 for (c = tokstart[namelen];
2745 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2746 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2748 /* Template parameter lists are part of the name.
2749 FIXME: This mishandles `print $a<4&&$a>3'. */
2753 if (! is_cast_operator (tokstart, namelen))
2755 /* Scan ahead to get rest of the template specification. Note
2756 that we look ahead only when the '<' adjoins non-whitespace
2757 characters; for comparison expressions, e.g. "a < b > c",
2758 there must be spaces before the '<', etc. */
2759 const char *p = find_template_name_end (tokstart + namelen);
2762 namelen = p - tokstart;
2766 c = tokstart[++namelen];
2769 /* The token "if" terminates the expression and is NOT removed from
2770 the input stream. It doesn't count if it appears in the
2771 expansion of a macro. */
2773 && tokstart[0] == 'i'
2774 && tokstart[1] == 'f'
2775 && ! scanning_macro_expansion ())
2780 /* For the same reason (breakpoint conditions), "thread N"
2781 terminates the expression. "thread" could be an identifier, but
2782 an identifier is never followed by a number without intervening
2783 punctuation. "task" is similar. Handle abbreviations of these,
2784 similarly to breakpoint.c:find_condition_and_thread. */
2786 && (strncmp (tokstart, "thread", namelen) == 0
2787 || strncmp (tokstart, "task", namelen) == 0)
2788 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2789 && ! scanning_macro_expansion ())
2791 const char *p = tokstart + namelen + 1;
2793 while (*p == ' ' || *p == '\t')
2795 if (*p >= '0' && *p <= '9')
2803 yylval.sval.ptr = tokstart;
2804 yylval.sval.length = namelen;
2806 /* Catch specific keywords. */
2807 copy = copy_name (yylval.sval);
2808 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2809 if (strcmp (copy, ident_tokens[i].oper) == 0)
2811 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2812 && parse_language (par_state)->la_language != language_cplus)
2815 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2817 struct field_of_this_result is_a_field_of_this;
2819 if (lookup_symbol (copy, expression_context_block,
2821 (parse_language (par_state)->la_language
2822 == language_cplus ? &is_a_field_of_this
2826 /* The keyword is shadowed. */
2831 /* It is ok to always set this, even though we don't always
2832 strictly need to. */
2833 yylval.opcode = ident_tokens[i].opcode;
2834 return ident_tokens[i].token;
2837 if (*tokstart == '$')
2840 if (parse_completion && *lexptr == '\0')
2841 saw_name_at_eof = 1;
2843 yylval.ssym.stoken = yylval.sval;
2844 yylval.ssym.sym.symbol = NULL;
2845 yylval.ssym.sym.block = NULL;
2846 yylval.ssym.is_a_field_of_this = 0;
2850 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2857 DEF_VEC_O (token_and_value);
2859 /* A FIFO of tokens that have been read but not yet returned to the
2861 static VEC (token_and_value) *token_fifo;
2863 /* Non-zero if the lexer should return tokens from the FIFO. */
2866 /* Temporary storage for c_lex; this holds symbol names as they are
2868 auto_obstack name_obstack;
2870 /* Classify a NAME token. The contents of the token are in `yylval'.
2871 Updates yylval and returns the new token type. BLOCK is the block
2872 in which lookups start; this can be NULL to mean the global scope.
2873 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2874 in single quotes. IS_AFTER_STRUCTOP is true if this name follows
2875 a structure operator -- either '.' or ARROW */
2878 classify_name (struct parser_state *par_state, const struct block *block,
2879 bool is_quoted_name, bool is_after_structop)
2881 struct block_symbol bsym;
2883 struct field_of_this_result is_a_field_of_this;
2885 copy = copy_name (yylval.sval);
2887 /* Initialize this in case we *don't* use it in this call; that way
2888 we can refer to it unconditionally below. */
2889 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2891 bsym = lookup_symbol (copy, block, VAR_DOMAIN,
2892 parse_language (par_state)->la_name_of_this
2893 ? &is_a_field_of_this : NULL);
2895 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2897 yylval.ssym.sym = bsym;
2898 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2901 else if (!bsym.symbol)
2903 /* If we found a field of 'this', we might have erroneously
2904 found a constructor where we wanted a type name. Handle this
2905 case by noticing that we found a constructor and then look up
2906 the type tag instead. */
2907 if (is_a_field_of_this.type != NULL
2908 && is_a_field_of_this.fn_field != NULL
2909 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2912 struct field_of_this_result inner_is_a_field_of_this;
2914 bsym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2915 &inner_is_a_field_of_this);
2916 if (bsym.symbol != NULL)
2918 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2923 /* If we found a field on the "this" object, or we are looking
2924 up a field on a struct, then we want to prefer it over a
2925 filename. However, if the name was quoted, then it is better
2926 to check for a filename or a block, since this is the only
2927 way the user has of requiring the extension to be used. */
2928 if ((is_a_field_of_this.type == NULL && !is_after_structop)
2931 /* See if it's a file name. */
2932 struct symtab *symtab;
2934 symtab = lookup_symtab (copy);
2937 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
2944 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
2946 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2950 /* See if it's an ObjC classname. */
2951 if (parse_language (par_state)->la_language == language_objc && !bsym.symbol)
2953 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2958 yylval.theclass.theclass = Class;
2959 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2961 yylval.theclass.type = SYMBOL_TYPE (sym);
2966 /* Input names that aren't symbols but ARE valid hex numbers, when
2967 the input radix permits them, can be names or numbers depending
2968 on the parse. Note we support radixes > 16 here. */
2970 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2971 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2973 YYSTYPE newlval; /* Its value is ignored. */
2974 int hextype = parse_number (par_state, copy, yylval.sval.length,
2979 yylval.ssym.sym = bsym;
2980 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2985 /* Any other kind of symbol */
2986 yylval.ssym.sym = bsym;
2987 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2989 if (bsym.symbol == NULL
2990 && parse_language (par_state)->la_language == language_cplus
2991 && is_a_field_of_this.type == NULL
2992 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
2993 return UNKNOWN_CPP_NAME;
2998 /* Like classify_name, but used by the inner loop of the lexer, when a
2999 name might have already been seen. CONTEXT is the context type, or
3000 NULL if this is the first component of a name. */
3003 classify_inner_name (struct parser_state *par_state,
3004 const struct block *block, struct type *context)
3009 if (context == NULL)
3010 return classify_name (par_state, block, false, false);
3012 type = check_typedef (context);
3013 if (!type_aggregate_p (type))
3016 copy = copy_name (yylval.ssym.stoken);
3017 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3018 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN);
3020 /* If no symbol was found, search for a matching base class named
3021 COPY. This will allow users to enter qualified names of class members
3022 relative to the `this' pointer. */
3023 if (yylval.ssym.sym.symbol == NULL)
3025 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3027 if (base_type != NULL)
3029 yylval.tsym.type = base_type;
3036 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
3040 /* cp_lookup_nested_symbol might have accidentally found a constructor
3041 named COPY when we really wanted a base class of the same name.
3042 Double-check this case by looking for a base class. */
3044 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3046 if (base_type != NULL)
3048 yylval.tsym.type = base_type;
3055 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3061 internal_error (__FILE__, __LINE__, _("not reached"));
3064 /* The outer level of a two-level lexer. This calls the inner lexer
3065 to return tokens. It then either returns these tokens, or
3066 aggregates them into a larger token. This lets us work around a
3067 problem in our parsing approach, where the parser could not
3068 distinguish between qualified names and qualified types at the
3071 This approach is still not ideal, because it mishandles template
3072 types. See the comment in lex_one_token for an example. However,
3073 this is still an improvement over the earlier approach, and will
3074 suffice until we move to better parsing technology. */
3079 token_and_value current;
3080 int first_was_coloncolon, last_was_coloncolon;
3081 struct type *context_type = NULL;
3082 int last_to_examine, next_to_examine, checkpoint;
3083 const struct block *search_block;
3084 bool is_quoted_name, last_lex_was_structop;
3086 if (popping && !VEC_empty (token_and_value, token_fifo))
3090 last_lex_was_structop = last_was_structop;
3092 /* Read the first token and decide what to do. Most of the
3093 subsequent code is C++-only; but also depends on seeing a "::" or
3095 current.token = lex_one_token (pstate, &is_quoted_name);
3096 if (current.token == NAME)
3097 current.token = classify_name (pstate, expression_context_block,
3098 is_quoted_name, last_lex_was_structop);
3099 if (parse_language (pstate)->la_language != language_cplus
3100 || (current.token != TYPENAME && current.token != COLONCOLON
3101 && current.token != FILENAME))
3102 return current.token;
3104 /* Read any sequence of alternating "::" and name-like tokens into
3106 current.value = yylval;
3107 VEC_safe_push (token_and_value, token_fifo, ¤t);
3108 last_was_coloncolon = current.token == COLONCOLON;
3113 /* We ignore quoted names other than the very first one.
3114 Subsequent ones do not have any special meaning. */
3115 current.token = lex_one_token (pstate, &ignore);
3116 current.value = yylval;
3117 VEC_safe_push (token_and_value, token_fifo, ¤t);
3119 if ((last_was_coloncolon && current.token != NAME)
3120 || (!last_was_coloncolon && current.token != COLONCOLON))
3122 last_was_coloncolon = !last_was_coloncolon;
3126 /* We always read one extra token, so compute the number of tokens
3127 to examine accordingly. */
3128 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3129 next_to_examine = 0;
3131 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3134 name_obstack.clear ();
3136 if (current.token == FILENAME)
3137 search_block = current.value.bval;
3138 else if (current.token == COLONCOLON)
3139 search_block = NULL;
3142 gdb_assert (current.token == TYPENAME);
3143 search_block = expression_context_block;
3144 obstack_grow (&name_obstack, current.value.sval.ptr,
3145 current.value.sval.length);
3146 context_type = current.value.tsym.type;
3150 first_was_coloncolon = current.token == COLONCOLON;
3151 last_was_coloncolon = first_was_coloncolon;
3153 while (next_to_examine <= last_to_examine)
3155 token_and_value *next;
3157 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3160 if (next->token == NAME && last_was_coloncolon)
3164 yylval = next->value;
3165 classification = classify_inner_name (pstate, search_block,
3167 /* We keep going until we either run out of names, or until
3168 we have a qualified name which is not a type. */
3169 if (classification != TYPENAME && classification != NAME)
3172 /* Accept up to this token. */
3173 checkpoint = next_to_examine;
3175 /* Update the partial name we are constructing. */
3176 if (context_type != NULL)
3178 /* We don't want to put a leading "::" into the name. */
3179 obstack_grow_str (&name_obstack, "::");
3181 obstack_grow (&name_obstack, next->value.sval.ptr,
3182 next->value.sval.length);
3184 yylval.sval.ptr = (const char *) obstack_base (&name_obstack);
3185 yylval.sval.length = obstack_object_size (&name_obstack);
3186 current.value = yylval;
3187 current.token = classification;
3189 last_was_coloncolon = 0;
3191 if (classification == NAME)
3194 context_type = yylval.tsym.type;
3196 else if (next->token == COLONCOLON && !last_was_coloncolon)
3197 last_was_coloncolon = 1;
3200 /* We've reached the end of the name. */
3205 /* If we have a replacement token, install it as the first token in
3206 the FIFO, and delete the other constituent tokens. */
3209 current.value.sval.ptr
3210 = (const char *) obstack_copy0 (&expansion_obstack,
3211 current.value.sval.ptr,
3212 current.value.sval.length);
3214 VEC_replace (token_and_value, token_fifo, 0, ¤t);
3216 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3220 current = *VEC_index (token_and_value, token_fifo, 0);
3221 VEC_ordered_remove (token_and_value, token_fifo, 0);
3222 yylval = current.value;
3223 return current.token;
3227 c_parse (struct parser_state *par_state)
3230 struct cleanup *back_to;
3232 /* Setting up the parser state. */
3233 scoped_restore pstate_restore = make_scoped_restore (&pstate);
3234 gdb_assert (par_state != NULL);
3237 gdb::unique_xmalloc_ptr<struct macro_scope> macro_scope;
3239 if (expression_context_block)
3240 macro_scope = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3242 macro_scope = default_macro_scope ();
3244 macro_scope = user_macro_scope ();
3246 scoped_restore restore_macro_scope
3247 = make_scoped_restore (&expression_macro_scope, macro_scope.get ());
3249 /* Initialize macro expansion code. */
3250 obstack_init (&expansion_obstack);
3251 gdb_assert (! macro_original_text);
3252 /* Note that parsing (within yyparse) freely installs cleanups
3253 assuming they'll be run here (below). */
3254 back_to = make_cleanup (scan_macro_cleanup, 0);
3256 scoped_restore restore_yydebug = make_scoped_restore (&yydebug,
3259 /* Initialize some state used by the lexer. */
3260 last_was_structop = false;
3261 saw_name_at_eof = 0;
3263 VEC_free (token_and_value, token_fifo);
3265 name_obstack.clear ();
3267 result = yyparse ();
3268 do_cleanups (back_to);
3275 /* This is called via the YYPRINT macro when parser debugging is
3276 enabled. It prints a token's value. */
3279 c_print_token (FILE *file, int type, YYSTYPE value)
3284 parser_fprintf (file, "typed_val_int<%s, %s>",
3285 TYPE_SAFE_NAME (value.typed_val_int.type),
3286 pulongest (value.typed_val_int.val));
3292 char *copy = (char *) alloca (value.tsval.length + 1);
3294 memcpy (copy, value.tsval.ptr, value.tsval.length);
3295 copy[value.tsval.length] = '\0';
3297 parser_fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3303 parser_fprintf (file, "sval<%s>", copy_name (value.sval));
3307 parser_fprintf (file, "tsym<type=%s, name=%s>",
3308 TYPE_SAFE_NAME (value.tsym.type),
3309 copy_name (value.tsym.stoken));
3313 case UNKNOWN_CPP_NAME:
3316 parser_fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3317 copy_name (value.ssym.stoken),
3318 (value.ssym.sym.symbol == NULL
3319 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym.symbol)),
3320 value.ssym.is_a_field_of_this);
3324 parser_fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3332 yyerror (const char *msg)
3335 lexptr = prev_lexptr;
3337 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);