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 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1045 write_exp_elt_block (pstate, sym.block);
1046 write_exp_elt_sym (pstate, sym.symbol);
1047 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1049 else if ($1.is_a_field_of_this)
1051 /* C++: it hangs off of `this'. Must
1052 not inadvertently convert from a method call
1054 innermost_block.update (sym);
1055 write_exp_elt_opcode (pstate, OP_THIS);
1056 write_exp_elt_opcode (pstate, OP_THIS);
1057 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1058 write_exp_string (pstate, $1.stoken);
1059 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1063 char *arg = copy_name ($1.stoken);
1065 bound_minimal_symbol msymbol
1066 = lookup_bound_minimal_symbol (arg);
1067 if (msymbol.minsym == NULL)
1069 if (!have_full_symbols () && !have_partial_symbols ())
1070 error (_("No symbol table is loaded. Use the \"file\" command."));
1072 error (_("No symbol \"%s\" in current context."),
1073 copy_name ($1.stoken));
1076 /* This minsym might be an alias for
1077 another function. See if we can find
1078 the debug symbol for the target, and
1079 if so, use it instead, since it has
1080 return type / prototype info. This
1081 is important for example for "p
1082 *__errno_location()". */
1083 symbol *alias_target
1084 = find_function_alias_target (msymbol);
1085 if (alias_target != NULL)
1087 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1089 (pstate, SYMBOL_BLOCK_VALUE (alias_target));
1090 write_exp_elt_sym (pstate, alias_target);
1091 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1094 write_exp_msymbol (pstate, msymbol);
1099 space_identifier : '@' NAME
1100 { insert_type_address_space (pstate, copy_name ($2.stoken)); }
1103 const_or_volatile: const_or_volatile_noopt
1107 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1110 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1111 | const_or_volatile_noopt
1114 const_or_volatile_or_space_identifier:
1115 const_or_volatile_or_space_identifier_noopt
1121 { insert_type (tp_pointer); }
1122 const_or_volatile_or_space_identifier
1124 { insert_type (tp_pointer); }
1125 const_or_volatile_or_space_identifier
1127 { insert_type (tp_reference); }
1129 { insert_type (tp_reference); }
1131 { insert_type (tp_rvalue_reference); }
1132 | ANDAND ptr_operator
1133 { insert_type (tp_rvalue_reference); }
1136 ptr_operator_ts: ptr_operator
1138 $$ = get_type_stack ();
1139 /* This cleanup is eventually run by
1141 make_cleanup (type_stack_cleanup, $$);
1145 abs_decl: ptr_operator_ts direct_abs_decl
1146 { $$ = append_type_stack ($2, $1); }
1151 direct_abs_decl: '(' abs_decl ')'
1153 | direct_abs_decl array_mod
1155 push_type_stack ($1);
1157 push_type (tp_array);
1158 $$ = get_type_stack ();
1163 push_type (tp_array);
1164 $$ = get_type_stack ();
1167 | direct_abs_decl func_mod
1169 push_type_stack ($1);
1171 $$ = get_type_stack ();
1176 $$ = get_type_stack ();
1186 | OBJC_LBRAC INT ']'
1192 | '(' parameter_typelist ')'
1196 /* We used to try to recognize pointer to member types here, but
1197 that didn't work (shift/reduce conflicts meant that these rules never
1198 got executed). The problem is that
1199 int (foo::bar::baz::bizzle)
1200 is a function type but
1201 int (foo::bar::baz::bizzle::*)
1202 is a pointer to member type. Stroustrup loses again! */
1207 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1211 { $$ = lookup_signed_typename (parse_language (pstate),
1212 parse_gdbarch (pstate),
1215 { $$ = lookup_signed_typename (parse_language (pstate),
1216 parse_gdbarch (pstate),
1219 { $$ = lookup_signed_typename (parse_language (pstate),
1220 parse_gdbarch (pstate),
1223 { $$ = lookup_signed_typename (parse_language (pstate),
1224 parse_gdbarch (pstate),
1226 | LONG SIGNED_KEYWORD INT_KEYWORD
1227 { $$ = lookup_signed_typename (parse_language (pstate),
1228 parse_gdbarch (pstate),
1230 | LONG SIGNED_KEYWORD
1231 { $$ = lookup_signed_typename (parse_language (pstate),
1232 parse_gdbarch (pstate),
1234 | SIGNED_KEYWORD LONG INT_KEYWORD
1235 { $$ = lookup_signed_typename (parse_language (pstate),
1236 parse_gdbarch (pstate),
1238 | UNSIGNED LONG INT_KEYWORD
1239 { $$ = lookup_unsigned_typename (parse_language (pstate),
1240 parse_gdbarch (pstate),
1242 | LONG UNSIGNED INT_KEYWORD
1243 { $$ = lookup_unsigned_typename (parse_language (pstate),
1244 parse_gdbarch (pstate),
1247 { $$ = lookup_unsigned_typename (parse_language (pstate),
1248 parse_gdbarch (pstate),
1251 { $$ = lookup_signed_typename (parse_language (pstate),
1252 parse_gdbarch (pstate),
1254 | LONG LONG INT_KEYWORD
1255 { $$ = lookup_signed_typename (parse_language (pstate),
1256 parse_gdbarch (pstate),
1258 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1259 { $$ = lookup_signed_typename (parse_language (pstate),
1260 parse_gdbarch (pstate),
1262 | LONG LONG SIGNED_KEYWORD
1263 { $$ = lookup_signed_typename (parse_language (pstate),
1264 parse_gdbarch (pstate),
1266 | SIGNED_KEYWORD LONG LONG
1267 { $$ = lookup_signed_typename (parse_language (pstate),
1268 parse_gdbarch (pstate),
1270 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1271 { $$ = lookup_signed_typename (parse_language (pstate),
1272 parse_gdbarch (pstate),
1274 | UNSIGNED LONG LONG
1275 { $$ = lookup_unsigned_typename (parse_language (pstate),
1276 parse_gdbarch (pstate),
1278 | UNSIGNED LONG LONG INT_KEYWORD
1279 { $$ = lookup_unsigned_typename (parse_language (pstate),
1280 parse_gdbarch (pstate),
1282 | LONG LONG UNSIGNED
1283 { $$ = lookup_unsigned_typename (parse_language (pstate),
1284 parse_gdbarch (pstate),
1286 | LONG LONG UNSIGNED INT_KEYWORD
1287 { $$ = lookup_unsigned_typename (parse_language (pstate),
1288 parse_gdbarch (pstate),
1291 { $$ = lookup_signed_typename (parse_language (pstate),
1292 parse_gdbarch (pstate),
1294 | SHORT SIGNED_KEYWORD INT_KEYWORD
1295 { $$ = lookup_signed_typename (parse_language (pstate),
1296 parse_gdbarch (pstate),
1298 | SHORT SIGNED_KEYWORD
1299 { $$ = lookup_signed_typename (parse_language (pstate),
1300 parse_gdbarch (pstate),
1302 | UNSIGNED SHORT INT_KEYWORD
1303 { $$ = lookup_unsigned_typename (parse_language (pstate),
1304 parse_gdbarch (pstate),
1307 { $$ = lookup_unsigned_typename (parse_language (pstate),
1308 parse_gdbarch (pstate),
1310 | SHORT UNSIGNED INT_KEYWORD
1311 { $$ = lookup_unsigned_typename (parse_language (pstate),
1312 parse_gdbarch (pstate),
1315 { $$ = lookup_typename (parse_language (pstate),
1316 parse_gdbarch (pstate),
1318 (struct block *) NULL,
1320 | LONG DOUBLE_KEYWORD
1321 { $$ = lookup_typename (parse_language (pstate),
1322 parse_gdbarch (pstate),
1324 (struct block *) NULL,
1327 { $$ = lookup_struct (copy_name ($2),
1328 expression_context_block); }
1331 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1334 | STRUCT name COMPLETE
1336 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1341 { $$ = lookup_struct (copy_name ($2),
1342 expression_context_block); }
1345 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1348 | CLASS name COMPLETE
1350 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1355 { $$ = lookup_union (copy_name ($2),
1356 expression_context_block); }
1359 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1362 | UNION name COMPLETE
1364 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1369 { $$ = lookup_enum (copy_name ($2),
1370 expression_context_block); }
1373 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1376 | ENUM name COMPLETE
1378 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1382 | UNSIGNED type_name
1383 { $$ = lookup_unsigned_typename (parse_language (pstate),
1384 parse_gdbarch (pstate),
1385 TYPE_NAME($2.type)); }
1387 { $$ = lookup_unsigned_typename (parse_language (pstate),
1388 parse_gdbarch (pstate),
1390 | SIGNED_KEYWORD type_name
1391 { $$ = lookup_signed_typename (parse_language (pstate),
1392 parse_gdbarch (pstate),
1393 TYPE_NAME($2.type)); }
1395 { $$ = lookup_signed_typename (parse_language (pstate),
1396 parse_gdbarch (pstate),
1398 /* It appears that this rule for templates is never
1399 reduced; template recognition happens by lookahead
1400 in the token processing code in yylex. */
1401 | TEMPLATE name '<' type '>'
1402 { $$ = lookup_template_type(copy_name($2), $4,
1403 expression_context_block);
1405 | const_or_volatile_or_space_identifier_noopt typebase
1406 { $$ = follow_types ($2); }
1407 | typebase const_or_volatile_or_space_identifier_noopt
1408 { $$ = follow_types ($1); }
1414 $$.stoken.ptr = "int";
1415 $$.stoken.length = 3;
1416 $$.type = lookup_signed_typename (parse_language (pstate),
1417 parse_gdbarch (pstate),
1422 $$.stoken.ptr = "long";
1423 $$.stoken.length = 4;
1424 $$.type = lookup_signed_typename (parse_language (pstate),
1425 parse_gdbarch (pstate),
1430 $$.stoken.ptr = "short";
1431 $$.stoken.length = 5;
1432 $$.type = lookup_signed_typename (parse_language (pstate),
1433 parse_gdbarch (pstate),
1440 { check_parameter_typelist ($1); }
1441 | nonempty_typelist ',' DOTDOTDOT
1443 VEC_safe_push (type_ptr, $1, NULL);
1444 check_parameter_typelist ($1);
1452 VEC (type_ptr) *typelist = NULL;
1453 VEC_safe_push (type_ptr, typelist, $1);
1456 | nonempty_typelist ',' type
1458 VEC_safe_push (type_ptr, $1, $3);
1466 push_type_stack ($2);
1467 $$ = follow_types ($1);
1471 conversion_type_id: typebase conversion_declarator
1472 { $$ = follow_types ($1); }
1475 conversion_declarator: /* Nothing. */
1476 | ptr_operator conversion_declarator
1479 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1480 | VOLATILE_KEYWORD CONST_KEYWORD
1483 const_or_volatile_noopt: const_and_volatile
1484 { insert_type (tp_const);
1485 insert_type (tp_volatile);
1488 { insert_type (tp_const); }
1490 { insert_type (tp_volatile); }
1494 { $$ = operator_stoken (" new"); }
1496 { $$ = operator_stoken (" delete"); }
1497 | OPERATOR NEW '[' ']'
1498 { $$ = operator_stoken (" new[]"); }
1499 | OPERATOR DELETE '[' ']'
1500 { $$ = operator_stoken (" delete[]"); }
1501 | OPERATOR NEW OBJC_LBRAC ']'
1502 { $$ = operator_stoken (" new[]"); }
1503 | OPERATOR DELETE OBJC_LBRAC ']'
1504 { $$ = operator_stoken (" delete[]"); }
1506 { $$ = operator_stoken ("+"); }
1508 { $$ = operator_stoken ("-"); }
1510 { $$ = operator_stoken ("*"); }
1512 { $$ = operator_stoken ("/"); }
1514 { $$ = operator_stoken ("%"); }
1516 { $$ = operator_stoken ("^"); }
1518 { $$ = operator_stoken ("&"); }
1520 { $$ = operator_stoken ("|"); }
1522 { $$ = operator_stoken ("~"); }
1524 { $$ = operator_stoken ("!"); }
1526 { $$ = operator_stoken ("="); }
1528 { $$ = operator_stoken ("<"); }
1530 { $$ = operator_stoken (">"); }
1531 | OPERATOR ASSIGN_MODIFY
1532 { const char *op = " unknown";
1556 case BINOP_BITWISE_IOR:
1559 case BINOP_BITWISE_AND:
1562 case BINOP_BITWISE_XOR:
1569 $$ = operator_stoken (op);
1572 { $$ = operator_stoken ("<<"); }
1574 { $$ = operator_stoken (">>"); }
1576 { $$ = operator_stoken ("=="); }
1578 { $$ = operator_stoken ("!="); }
1580 { $$ = operator_stoken ("<="); }
1582 { $$ = operator_stoken (">="); }
1584 { $$ = operator_stoken ("&&"); }
1586 { $$ = operator_stoken ("||"); }
1587 | OPERATOR INCREMENT
1588 { $$ = operator_stoken ("++"); }
1589 | OPERATOR DECREMENT
1590 { $$ = operator_stoken ("--"); }
1592 { $$ = operator_stoken (","); }
1593 | OPERATOR ARROW_STAR
1594 { $$ = operator_stoken ("->*"); }
1596 { $$ = operator_stoken ("->"); }
1598 { $$ = operator_stoken ("()"); }
1600 { $$ = operator_stoken ("[]"); }
1601 | OPERATOR OBJC_LBRAC ']'
1602 { $$ = operator_stoken ("[]"); }
1603 | OPERATOR conversion_type_id
1606 c_print_type ($2, NULL, &buf, -1, 0,
1607 &type_print_raw_options);
1609 /* This also needs canonicalization. */
1611 = cp_canonicalize_string (buf.c_str ());
1613 canon = std::move (buf.string ());
1614 $$ = operator_stoken ((" " + canon).c_str ());
1620 name : NAME { $$ = $1.stoken; }
1621 | BLOCKNAME { $$ = $1.stoken; }
1622 | TYPENAME { $$ = $1.stoken; }
1623 | NAME_OR_INT { $$ = $1.stoken; }
1624 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1628 name_not_typename : NAME
1630 /* These would be useful if name_not_typename was useful, but it is just
1631 a fake for "variable", so these cause reduce/reduce conflicts because
1632 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1633 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1634 context where only a name could occur, this might be useful.
1639 struct field_of_this_result is_a_field_of_this;
1642 $$.sym = lookup_symbol ($1.ptr,
1643 expression_context_block,
1645 &is_a_field_of_this);
1646 $$.is_a_field_of_this
1647 = is_a_field_of_this.type != NULL;
1654 /* Like write_exp_string, but prepends a '~'. */
1657 write_destructor_name (struct parser_state *par_state, struct stoken token)
1659 char *copy = (char *) alloca (token.length + 1);
1662 memcpy (©[1], token.ptr, token.length);
1667 write_exp_string (par_state, token);
1670 /* Returns a stoken of the operator name given by OP (which does not
1671 include the string "operator"). */
1673 static struct stoken
1674 operator_stoken (const char *op)
1676 struct stoken st = { NULL, 0 };
1679 st.length = CP_OPERATOR_LEN + strlen (op);
1680 buf = (char *) malloc (st.length + 1);
1681 strcpy (buf, CP_OPERATOR_STR);
1685 /* The toplevel (c_parse) will free the memory allocated here. */
1686 make_cleanup (free, buf);
1690 /* Return true if the type is aggregate-like. */
1693 type_aggregate_p (struct type *type)
1695 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1696 || TYPE_CODE (type) == TYPE_CODE_UNION
1697 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1698 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1699 && TYPE_DECLARED_CLASS (type)));
1702 /* Validate a parameter typelist. */
1705 check_parameter_typelist (VEC (type_ptr) *params)
1710 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1712 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1716 if (VEC_length (type_ptr, params) == 1)
1721 VEC_free (type_ptr, params);
1722 error (_("parameter types following 'void'"));
1726 VEC_free (type_ptr, params);
1727 error (_("'void' invalid as parameter type"));
1733 /* Take care of parsing a number (anything that starts with a digit).
1734 Set yylval and return the token type; update lexptr.
1735 LEN is the number of characters in it. */
1737 /*** Needs some error checking for the float case ***/
1740 parse_number (struct parser_state *par_state,
1741 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1743 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1744 here, and we do kind of silly things like cast to unsigned. */
1751 int base = input_radix;
1754 /* Number of "L" suffixes encountered. */
1757 /* We have found a "L" or "U" suffix. */
1758 int found_suffix = 0;
1761 struct type *signed_type;
1762 struct type *unsigned_type;
1765 p = (char *) alloca (len);
1766 memcpy (p, buf, len);
1770 /* Handle suffixes for decimal floating-point: "df", "dd" or "dl". */
1771 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1773 putithere->typed_val_float.type
1774 = parse_type (par_state)->builtin_decfloat;
1777 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1779 putithere->typed_val_float.type
1780 = parse_type (par_state)->builtin_decdouble;
1783 else if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1785 putithere->typed_val_float.type
1786 = parse_type (par_state)->builtin_declong;
1789 /* Handle suffixes: 'f' for float, 'l' for long double. */
1790 else if (len >= 1 && tolower (p[len - 1]) == 'f')
1792 putithere->typed_val_float.type
1793 = parse_type (par_state)->builtin_float;
1796 else if (len >= 1 && tolower (p[len - 1]) == 'l')
1798 putithere->typed_val_float.type
1799 = parse_type (par_state)->builtin_long_double;
1802 /* Default type for floating-point literals is double. */
1805 putithere->typed_val_float.type
1806 = parse_type (par_state)->builtin_double;
1809 if (!parse_float (p, len,
1810 putithere->typed_val_float.type,
1811 putithere->typed_val_float.val))
1816 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1817 if (p[0] == '0' && len > 1)
1860 if (c >= 'A' && c <= 'Z')
1862 if (c != 'l' && c != 'u')
1864 if (c >= '0' && c <= '9')
1872 if (base > 10 && c >= 'a' && c <= 'f')
1876 n += i = c - 'a' + 10;
1889 return ERROR; /* Char not a digit */
1892 return ERROR; /* Invalid digit in this base */
1894 /* Portably test for overflow (only works for nonzero values, so make
1895 a second check for zero). FIXME: Can't we just make n and prevn
1896 unsigned and avoid this? */
1897 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1898 unsigned_p = 1; /* Try something unsigned */
1900 /* Portably test for unsigned overflow.
1901 FIXME: This check is wrong; for example it doesn't find overflow
1902 on 0x123456789 when LONGEST is 32 bits. */
1903 if (c != 'l' && c != 'u' && n != 0)
1905 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1906 error (_("Numeric constant too large."));
1911 /* An integer constant is an int, a long, or a long long. An L
1912 suffix forces it to be long; an LL suffix forces it to be long
1913 long. If not forced to a larger size, it gets the first type of
1914 the above that it fits in. To figure out whether it fits, we
1915 shift it right and see whether anything remains. Note that we
1916 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1917 operation, because many compilers will warn about such a shift
1918 (which always produces a zero result). Sometimes gdbarch_int_bit
1919 or gdbarch_long_bit will be that big, sometimes not. To deal with
1920 the case where it is we just always shift the value more than
1921 once, with fewer bits each time. */
1923 un = (ULONGEST)n >> 2;
1925 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1928 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1930 /* A large decimal (not hex or octal) constant (between INT_MAX
1931 and UINT_MAX) is a long or unsigned long, according to ANSI,
1932 never an unsigned int, but this code treats it as unsigned
1933 int. This probably should be fixed. GCC gives a warning on
1936 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1937 signed_type = parse_type (par_state)->builtin_int;
1939 else if (long_p <= 1
1940 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1943 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1944 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1945 signed_type = parse_type (par_state)->builtin_long;
1950 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1951 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1952 /* A long long does not fit in a LONGEST. */
1953 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1955 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1956 high_bit = (ULONGEST) 1 << shift;
1957 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1958 signed_type = parse_type (par_state)->builtin_long_long;
1961 putithere->typed_val_int.val = n;
1963 /* If the high bit of the worked out type is set then this number
1964 has to be unsigned. */
1966 if (unsigned_p || (n & high_bit))
1968 putithere->typed_val_int.type = unsigned_type;
1972 putithere->typed_val_int.type = signed_type;
1978 /* Temporary obstack used for holding strings. */
1979 static struct obstack tempbuf;
1980 static int tempbuf_init;
1982 /* Parse a C escape sequence. The initial backslash of the sequence
1983 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1984 last character of the sequence. If OUTPUT is not NULL, the
1985 translated form of the escape sequence will be written there. If
1986 OUTPUT is NULL, no output is written and the call will only affect
1987 *PTR. If an escape sequence is expressed in target bytes, then the
1988 entire sequence will simply be copied to OUTPUT. Return 1 if any
1989 character was emitted, 0 otherwise. */
1992 c_parse_escape (const char **ptr, struct obstack *output)
1994 const char *tokptr = *ptr;
1997 /* Some escape sequences undergo character set conversion. Those we
2001 /* Hex escapes do not undergo character set conversion, so keep
2002 the escape sequence for later. */
2005 obstack_grow_str (output, "\\x");
2007 if (!isxdigit (*tokptr))
2008 error (_("\\x escape without a following hex digit"));
2009 while (isxdigit (*tokptr))
2012 obstack_1grow (output, *tokptr);
2017 /* Octal escapes do not undergo character set conversion, so
2018 keep the escape sequence for later. */
2030 obstack_grow_str (output, "\\");
2032 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
2036 obstack_1grow (output, *tokptr);
2042 /* We handle UCNs later. We could handle them here, but that
2043 would mean a spurious error in the case where the UCN could
2044 be converted to the target charset but not the host
2050 int i, len = c == 'U' ? 8 : 4;
2053 obstack_1grow (output, '\\');
2054 obstack_1grow (output, *tokptr);
2057 if (!isxdigit (*tokptr))
2058 error (_("\\%c escape without a following hex digit"), c);
2059 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2062 obstack_1grow (output, *tokptr);
2068 /* We must pass backslash through so that it does not
2069 cause quoting during the second expansion. */
2072 obstack_grow_str (output, "\\\\");
2076 /* Escapes which undergo conversion. */
2079 obstack_1grow (output, '\a');
2084 obstack_1grow (output, '\b');
2089 obstack_1grow (output, '\f');
2094 obstack_1grow (output, '\n');
2099 obstack_1grow (output, '\r');
2104 obstack_1grow (output, '\t');
2109 obstack_1grow (output, '\v');
2113 /* GCC extension. */
2116 obstack_1grow (output, HOST_ESCAPE_CHAR);
2120 /* Backslash-newline expands to nothing at all. */
2126 /* A few escapes just expand to the character itself. */
2130 /* GCC extensions. */
2135 /* Unrecognized escapes turn into the character itself. */
2138 obstack_1grow (output, *tokptr);
2146 /* Parse a string or character literal from TOKPTR. The string or
2147 character may be wide or unicode. *OUTPTR is set to just after the
2148 end of the literal in the input string. The resulting token is
2149 stored in VALUE. This returns a token value, either STRING or
2150 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2151 number of host characters in the literal. */
2154 parse_string_or_char (const char *tokptr, const char **outptr,
2155 struct typed_stoken *value, int *host_chars)
2161 /* Build the gdb internal form of the input string in tempbuf. Note
2162 that the buffer is null byte terminated *only* for the
2163 convenience of debugging gdb itself and printing the buffer
2164 contents when the buffer contains no embedded nulls. Gdb does
2165 not depend upon the buffer being null byte terminated, it uses
2166 the length string instead. This allows gdb to handle C strings
2167 (as well as strings in other languages) with embedded null
2173 obstack_free (&tempbuf, NULL);
2174 obstack_init (&tempbuf);
2176 /* Record the string type. */
2179 type = C_WIDE_STRING;
2182 else if (*tokptr == 'u')
2187 else if (*tokptr == 'U')
2192 else if (*tokptr == '@')
2194 /* An Objective C string. */
2202 /* Skip the quote. */
2216 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2218 else if (c == quote)
2222 obstack_1grow (&tempbuf, c);
2224 /* FIXME: this does the wrong thing with multi-byte host
2225 characters. We could use mbrlen here, but that would
2226 make "set host-charset" a bit less useful. */
2231 if (*tokptr != quote)
2234 error (_("Unterminated string in expression."));
2236 error (_("Unmatched single quote."));
2241 value->ptr = (char *) obstack_base (&tempbuf);
2242 value->length = obstack_object_size (&tempbuf);
2246 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2249 /* This is used to associate some attributes with a token. */
2253 /* If this bit is set, the token is C++-only. */
2257 /* If this bit is set, the token is conditional: if there is a
2258 symbol of the same name, then the token is a symbol; otherwise,
2259 the token is a keyword. */
2263 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2269 enum exp_opcode opcode;
2273 static const struct token tokentab3[] =
2275 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2276 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2277 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2278 {"...", DOTDOTDOT, BINOP_END, 0}
2281 static const struct token tokentab2[] =
2283 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2284 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2285 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2286 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2287 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2288 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2289 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2290 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2291 {"++", INCREMENT, BINOP_END, 0},
2292 {"--", DECREMENT, BINOP_END, 0},
2293 {"->", ARROW, BINOP_END, 0},
2294 {"&&", ANDAND, BINOP_END, 0},
2295 {"||", OROR, BINOP_END, 0},
2296 /* "::" is *not* only C++: gdb overrides its meaning in several
2297 different ways, e.g., 'filename'::func, function::variable. */
2298 {"::", COLONCOLON, BINOP_END, 0},
2299 {"<<", LSH, BINOP_END, 0},
2300 {">>", RSH, BINOP_END, 0},
2301 {"==", EQUAL, BINOP_END, 0},
2302 {"!=", NOTEQUAL, BINOP_END, 0},
2303 {"<=", LEQ, BINOP_END, 0},
2304 {">=", GEQ, BINOP_END, 0},
2305 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2308 /* Identifier-like tokens. */
2309 static const struct token ident_tokens[] =
2311 {"unsigned", UNSIGNED, OP_NULL, 0},
2312 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2313 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2314 {"struct", STRUCT, OP_NULL, 0},
2315 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2316 {"sizeof", SIZEOF, OP_NULL, 0},
2317 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2318 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2319 {"class", CLASS, OP_NULL, FLAG_CXX},
2320 {"union", UNION, OP_NULL, 0},
2321 {"short", SHORT, OP_NULL, 0},
2322 {"const", CONST_KEYWORD, OP_NULL, 0},
2323 {"enum", ENUM, OP_NULL, 0},
2324 {"long", LONG, OP_NULL, 0},
2325 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2326 {"int", INT_KEYWORD, OP_NULL, 0},
2327 {"new", NEW, OP_NULL, FLAG_CXX},
2328 {"delete", DELETE, OP_NULL, FLAG_CXX},
2329 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2331 {"and", ANDAND, BINOP_END, FLAG_CXX},
2332 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2333 {"bitand", '&', OP_NULL, FLAG_CXX},
2334 {"bitor", '|', OP_NULL, FLAG_CXX},
2335 {"compl", '~', OP_NULL, FLAG_CXX},
2336 {"not", '!', OP_NULL, FLAG_CXX},
2337 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2338 {"or", OROR, BINOP_END, FLAG_CXX},
2339 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2340 {"xor", '^', OP_NULL, FLAG_CXX},
2341 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2343 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2344 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2345 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2346 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2348 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2349 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2350 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2351 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2352 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2354 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2357 /* When we find that lexptr (the global var defined in parse.c) is
2358 pointing at a macro invocation, we expand the invocation, and call
2359 scan_macro_expansion to save the old lexptr here and point lexptr
2360 into the expanded text. When we reach the end of that, we call
2361 end_macro_expansion to pop back to the value we saved here. The
2362 macro expansion code promises to return only fully-expanded text,
2363 so we don't need to "push" more than one level.
2365 This is disgusting, of course. It would be cleaner to do all macro
2366 expansion beforehand, and then hand that to lexptr. But we don't
2367 really know where the expression ends. Remember, in a command like
2369 (gdb) break *ADDRESS if CONDITION
2371 we evaluate ADDRESS in the scope of the current frame, but we
2372 evaluate CONDITION in the scope of the breakpoint's location. So
2373 it's simply wrong to try to macro-expand the whole thing at once. */
2374 static const char *macro_original_text;
2376 /* We save all intermediate macro expansions on this obstack for the
2377 duration of a single parse. The expansion text may sometimes have
2378 to live past the end of the expansion, due to yacc lookahead.
2379 Rather than try to be clever about saving the data for a single
2380 token, we simply keep it all and delete it after parsing has
2382 static struct obstack expansion_obstack;
2385 scan_macro_expansion (char *expansion)
2389 /* We'd better not be trying to push the stack twice. */
2390 gdb_assert (! macro_original_text);
2392 /* Copy to the obstack, and then free the intermediate
2394 copy = (char *) obstack_copy0 (&expansion_obstack, expansion,
2395 strlen (expansion));
2398 /* Save the old lexptr value, so we can return to it when we're done
2399 parsing the expanded text. */
2400 macro_original_text = lexptr;
2405 scanning_macro_expansion (void)
2407 return macro_original_text != 0;
2411 finished_macro_expansion (void)
2413 /* There'd better be something to pop back to. */
2414 gdb_assert (macro_original_text);
2416 /* Pop back to the original text. */
2417 lexptr = macro_original_text;
2418 macro_original_text = 0;
2422 scan_macro_cleanup (void *dummy)
2424 if (macro_original_text)
2425 finished_macro_expansion ();
2427 obstack_free (&expansion_obstack, NULL);
2430 /* Return true iff the token represents a C++ cast operator. */
2433 is_cast_operator (const char *token, int len)
2435 return (! strncmp (token, "dynamic_cast", len)
2436 || ! strncmp (token, "static_cast", len)
2437 || ! strncmp (token, "reinterpret_cast", len)
2438 || ! strncmp (token, "const_cast", len));
2441 /* The scope used for macro expansion. */
2442 static struct macro_scope *expression_macro_scope;
2444 /* This is set if a NAME token appeared at the very end of the input
2445 string, with no whitespace separating the name from the EOF. This
2446 is used only when parsing to do field name completion. */
2447 static int saw_name_at_eof;
2449 /* This is set if the previously-returned token was a structure
2450 operator -- either '.' or ARROW. This is used only when parsing to
2451 do field name completion. */
2452 static int last_was_structop;
2454 /* Read one token, getting characters through lexptr. */
2457 lex_one_token (struct parser_state *par_state, int *is_quoted_name)
2462 const char *tokstart;
2463 int saw_structop = last_was_structop;
2466 last_was_structop = 0;
2467 *is_quoted_name = 0;
2471 /* Check if this is a macro invocation that we need to expand. */
2472 if (! scanning_macro_expansion ())
2474 char *expanded = macro_expand_next (&lexptr,
2475 standard_macro_lookup,
2476 expression_macro_scope);
2479 scan_macro_expansion (expanded);
2482 prev_lexptr = lexptr;
2485 /* See if it is a special token of length 3. */
2486 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2487 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2489 if ((tokentab3[i].flags & FLAG_CXX) != 0
2490 && parse_language (par_state)->la_language != language_cplus)
2494 yylval.opcode = tokentab3[i].opcode;
2495 return tokentab3[i].token;
2498 /* See if it is a special token of length 2. */
2499 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2500 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2502 if ((tokentab2[i].flags & FLAG_CXX) != 0
2503 && parse_language (par_state)->la_language != language_cplus)
2507 yylval.opcode = tokentab2[i].opcode;
2508 if (parse_completion && tokentab2[i].token == ARROW)
2509 last_was_structop = 1;
2510 return tokentab2[i].token;
2513 switch (c = *tokstart)
2516 /* If we were just scanning the result of a macro expansion,
2517 then we need to resume scanning the original text.
2518 If we're parsing for field name completion, and the previous
2519 token allows such completion, return a COMPLETE token.
2520 Otherwise, we were already scanning the original text, and
2521 we're really done. */
2522 if (scanning_macro_expansion ())
2524 finished_macro_expansion ();
2527 else if (saw_name_at_eof)
2529 saw_name_at_eof = 0;
2532 else if (saw_structop)
2547 if (parse_language (par_state)->la_language == language_objc
2554 if (paren_depth == 0)
2561 if (comma_terminates
2563 && ! scanning_macro_expansion ())
2569 /* Might be a floating point number. */
2570 if (lexptr[1] < '0' || lexptr[1] > '9')
2572 if (parse_completion)
2573 last_was_structop = 1;
2574 goto symbol; /* Nope, must be a symbol. */
2576 /* FALL THRU into number case. */
2589 /* It's a number. */
2590 int got_dot = 0, got_e = 0, toktype;
2591 const char *p = tokstart;
2592 int hex = input_radix > 10;
2594 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2599 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2607 /* This test includes !hex because 'e' is a valid hex digit
2608 and thus does not indicate a floating point number when
2609 the radix is hex. */
2610 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2611 got_dot = got_e = 1;
2612 /* This test does not include !hex, because a '.' always indicates
2613 a decimal floating point number regardless of the radix. */
2614 else if (!got_dot && *p == '.')
2616 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2617 && (*p == '-' || *p == '+'))
2618 /* This is the sign of the exponent, not the end of the
2621 /* We will take any letters or digits. parse_number will
2622 complain if past the radix, or if L or U are not final. */
2623 else if ((*p < '0' || *p > '9')
2624 && ((*p < 'a' || *p > 'z')
2625 && (*p < 'A' || *p > 'Z')))
2628 toktype = parse_number (par_state, tokstart, p - tokstart,
2629 got_dot|got_e, &yylval);
2630 if (toktype == ERROR)
2632 char *err_copy = (char *) alloca (p - tokstart + 1);
2634 memcpy (err_copy, tokstart, p - tokstart);
2635 err_copy[p - tokstart] = 0;
2636 error (_("Invalid number \"%s\"."), err_copy);
2644 const char *p = &tokstart[1];
2645 size_t len = strlen ("entry");
2647 if (parse_language (par_state)->la_language == language_objc)
2649 size_t len = strlen ("selector");
2651 if (strncmp (p, "selector", len) == 0
2652 && (p[len] == '\0' || isspace (p[len])))
2661 while (isspace (*p))
2663 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2695 if (tokstart[1] != '"' && tokstart[1] != '\'')
2704 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2709 error (_("Empty character constant."));
2710 else if (host_len > 2 && c == '\'')
2713 namelen = lexptr - tokstart - 1;
2714 *is_quoted_name = 1;
2718 else if (host_len > 1)
2719 error (_("Invalid character constant."));
2725 if (!(c == '_' || c == '$'
2726 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2727 /* We must have come across a bad character (e.g. ';'). */
2728 error (_("Invalid character '%c' in expression."), c);
2730 /* It's a name. See how long it is. */
2732 for (c = tokstart[namelen];
2733 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2734 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2736 /* Template parameter lists are part of the name.
2737 FIXME: This mishandles `print $a<4&&$a>3'. */
2741 if (! is_cast_operator (tokstart, namelen))
2743 /* Scan ahead to get rest of the template specification. Note
2744 that we look ahead only when the '<' adjoins non-whitespace
2745 characters; for comparison expressions, e.g. "a < b > c",
2746 there must be spaces before the '<', etc. */
2747 const char *p = find_template_name_end (tokstart + namelen);
2750 namelen = p - tokstart;
2754 c = tokstart[++namelen];
2757 /* The token "if" terminates the expression and is NOT removed from
2758 the input stream. It doesn't count if it appears in the
2759 expansion of a macro. */
2761 && tokstart[0] == 'i'
2762 && tokstart[1] == 'f'
2763 && ! scanning_macro_expansion ())
2768 /* For the same reason (breakpoint conditions), "thread N"
2769 terminates the expression. "thread" could be an identifier, but
2770 an identifier is never followed by a number without intervening
2771 punctuation. "task" is similar. Handle abbreviations of these,
2772 similarly to breakpoint.c:find_condition_and_thread. */
2774 && (strncmp (tokstart, "thread", namelen) == 0
2775 || strncmp (tokstart, "task", namelen) == 0)
2776 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2777 && ! scanning_macro_expansion ())
2779 const char *p = tokstart + namelen + 1;
2781 while (*p == ' ' || *p == '\t')
2783 if (*p >= '0' && *p <= '9')
2791 yylval.sval.ptr = tokstart;
2792 yylval.sval.length = namelen;
2794 /* Catch specific keywords. */
2795 copy = copy_name (yylval.sval);
2796 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2797 if (strcmp (copy, ident_tokens[i].oper) == 0)
2799 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2800 && parse_language (par_state)->la_language != language_cplus)
2803 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2805 struct field_of_this_result is_a_field_of_this;
2807 if (lookup_symbol (copy, expression_context_block,
2809 (parse_language (par_state)->la_language
2810 == language_cplus ? &is_a_field_of_this
2814 /* The keyword is shadowed. */
2819 /* It is ok to always set this, even though we don't always
2820 strictly need to. */
2821 yylval.opcode = ident_tokens[i].opcode;
2822 return ident_tokens[i].token;
2825 if (*tokstart == '$')
2828 if (parse_completion && *lexptr == '\0')
2829 saw_name_at_eof = 1;
2831 yylval.ssym.stoken = yylval.sval;
2832 yylval.ssym.sym.symbol = NULL;
2833 yylval.ssym.sym.block = NULL;
2834 yylval.ssym.is_a_field_of_this = 0;
2838 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2845 DEF_VEC_O (token_and_value);
2847 /* A FIFO of tokens that have been read but not yet returned to the
2849 static VEC (token_and_value) *token_fifo;
2851 /* Non-zero if the lexer should return tokens from the FIFO. */
2854 /* Temporary storage for c_lex; this holds symbol names as they are
2856 auto_obstack name_obstack;
2858 /* Classify a NAME token. The contents of the token are in `yylval'.
2859 Updates yylval and returns the new token type. BLOCK is the block
2860 in which lookups start; this can be NULL to mean the global scope.
2861 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2862 in single quotes. */
2865 classify_name (struct parser_state *par_state, const struct block *block,
2868 struct block_symbol bsym;
2870 struct field_of_this_result is_a_field_of_this;
2872 copy = copy_name (yylval.sval);
2874 /* Initialize this in case we *don't* use it in this call; that way
2875 we can refer to it unconditionally below. */
2876 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2878 bsym = lookup_symbol (copy, block, VAR_DOMAIN,
2879 parse_language (par_state)->la_name_of_this
2880 ? &is_a_field_of_this : NULL);
2882 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2884 yylval.ssym.sym = bsym;
2885 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2888 else if (!bsym.symbol)
2890 /* If we found a field of 'this', we might have erroneously
2891 found a constructor where we wanted a type name. Handle this
2892 case by noticing that we found a constructor and then look up
2893 the type tag instead. */
2894 if (is_a_field_of_this.type != NULL
2895 && is_a_field_of_this.fn_field != NULL
2896 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2899 struct field_of_this_result inner_is_a_field_of_this;
2901 bsym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2902 &inner_is_a_field_of_this);
2903 if (bsym.symbol != NULL)
2905 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2910 /* If we found a field, then we want to prefer it over a
2911 filename. However, if the name was quoted, then it is better
2912 to check for a filename or a block, since this is the only
2913 way the user has of requiring the extension to be used. */
2914 if (is_a_field_of_this.type == NULL || is_quoted_name)
2916 /* See if it's a file name. */
2917 struct symtab *symtab;
2919 symtab = lookup_symtab (copy);
2922 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
2929 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
2931 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2935 /* See if it's an ObjC classname. */
2936 if (parse_language (par_state)->la_language == language_objc && !bsym.symbol)
2938 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2943 yylval.theclass.theclass = Class;
2944 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2946 yylval.theclass.type = SYMBOL_TYPE (sym);
2951 /* Input names that aren't symbols but ARE valid hex numbers, when
2952 the input radix permits them, can be names or numbers depending
2953 on the parse. Note we support radixes > 16 here. */
2955 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2956 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2958 YYSTYPE newlval; /* Its value is ignored. */
2959 int hextype = parse_number (par_state, copy, yylval.sval.length,
2964 yylval.ssym.sym = bsym;
2965 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2970 /* Any other kind of symbol */
2971 yylval.ssym.sym = bsym;
2972 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2974 if (bsym.symbol == NULL
2975 && parse_language (par_state)->la_language == language_cplus
2976 && is_a_field_of_this.type == NULL
2977 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
2978 return UNKNOWN_CPP_NAME;
2983 /* Like classify_name, but used by the inner loop of the lexer, when a
2984 name might have already been seen. CONTEXT is the context type, or
2985 NULL if this is the first component of a name. */
2988 classify_inner_name (struct parser_state *par_state,
2989 const struct block *block, struct type *context)
2994 if (context == NULL)
2995 return classify_name (par_state, block, 0);
2997 type = check_typedef (context);
2998 if (!type_aggregate_p (type))
3001 copy = copy_name (yylval.ssym.stoken);
3002 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3003 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN);
3005 /* If no symbol was found, search for a matching base class named
3006 COPY. This will allow users to enter qualified names of class members
3007 relative to the `this' pointer. */
3008 if (yylval.ssym.sym.symbol == NULL)
3010 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3012 if (base_type != NULL)
3014 yylval.tsym.type = base_type;
3021 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
3025 /* cp_lookup_nested_symbol might have accidentally found a constructor
3026 named COPY when we really wanted a base class of the same name.
3027 Double-check this case by looking for a base class. */
3029 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3031 if (base_type != NULL)
3033 yylval.tsym.type = base_type;
3040 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3046 internal_error (__FILE__, __LINE__, _("not reached"));
3049 /* The outer level of a two-level lexer. This calls the inner lexer
3050 to return tokens. It then either returns these tokens, or
3051 aggregates them into a larger token. This lets us work around a
3052 problem in our parsing approach, where the parser could not
3053 distinguish between qualified names and qualified types at the
3056 This approach is still not ideal, because it mishandles template
3057 types. See the comment in lex_one_token for an example. However,
3058 this is still an improvement over the earlier approach, and will
3059 suffice until we move to better parsing technology. */
3064 token_and_value current;
3065 int first_was_coloncolon, last_was_coloncolon;
3066 struct type *context_type = NULL;
3067 int last_to_examine, next_to_examine, checkpoint;
3068 const struct block *search_block;
3071 if (popping && !VEC_empty (token_and_value, token_fifo))
3075 /* Read the first token and decide what to do. Most of the
3076 subsequent code is C++-only; but also depends on seeing a "::" or
3078 current.token = lex_one_token (pstate, &is_quoted_name);
3079 if (current.token == NAME)
3080 current.token = classify_name (pstate, expression_context_block,
3082 if (parse_language (pstate)->la_language != language_cplus
3083 || (current.token != TYPENAME && current.token != COLONCOLON
3084 && current.token != FILENAME))
3085 return current.token;
3087 /* Read any sequence of alternating "::" and name-like tokens into
3089 current.value = yylval;
3090 VEC_safe_push (token_and_value, token_fifo, ¤t);
3091 last_was_coloncolon = current.token == COLONCOLON;
3096 /* We ignore quoted names other than the very first one.
3097 Subsequent ones do not have any special meaning. */
3098 current.token = lex_one_token (pstate, &ignore);
3099 current.value = yylval;
3100 VEC_safe_push (token_and_value, token_fifo, ¤t);
3102 if ((last_was_coloncolon && current.token != NAME)
3103 || (!last_was_coloncolon && current.token != COLONCOLON))
3105 last_was_coloncolon = !last_was_coloncolon;
3109 /* We always read one extra token, so compute the number of tokens
3110 to examine accordingly. */
3111 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3112 next_to_examine = 0;
3114 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3117 name_obstack.clear ();
3119 if (current.token == FILENAME)
3120 search_block = current.value.bval;
3121 else if (current.token == COLONCOLON)
3122 search_block = NULL;
3125 gdb_assert (current.token == TYPENAME);
3126 search_block = expression_context_block;
3127 obstack_grow (&name_obstack, current.value.sval.ptr,
3128 current.value.sval.length);
3129 context_type = current.value.tsym.type;
3133 first_was_coloncolon = current.token == COLONCOLON;
3134 last_was_coloncolon = first_was_coloncolon;
3136 while (next_to_examine <= last_to_examine)
3138 token_and_value *next;
3140 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3143 if (next->token == NAME && last_was_coloncolon)
3147 yylval = next->value;
3148 classification = classify_inner_name (pstate, search_block,
3150 /* We keep going until we either run out of names, or until
3151 we have a qualified name which is not a type. */
3152 if (classification != TYPENAME && classification != NAME)
3155 /* Accept up to this token. */
3156 checkpoint = next_to_examine;
3158 /* Update the partial name we are constructing. */
3159 if (context_type != NULL)
3161 /* We don't want to put a leading "::" into the name. */
3162 obstack_grow_str (&name_obstack, "::");
3164 obstack_grow (&name_obstack, next->value.sval.ptr,
3165 next->value.sval.length);
3167 yylval.sval.ptr = (const char *) obstack_base (&name_obstack);
3168 yylval.sval.length = obstack_object_size (&name_obstack);
3169 current.value = yylval;
3170 current.token = classification;
3172 last_was_coloncolon = 0;
3174 if (classification == NAME)
3177 context_type = yylval.tsym.type;
3179 else if (next->token == COLONCOLON && !last_was_coloncolon)
3180 last_was_coloncolon = 1;
3183 /* We've reached the end of the name. */
3188 /* If we have a replacement token, install it as the first token in
3189 the FIFO, and delete the other constituent tokens. */
3192 current.value.sval.ptr
3193 = (const char *) obstack_copy0 (&expansion_obstack,
3194 current.value.sval.ptr,
3195 current.value.sval.length);
3197 VEC_replace (token_and_value, token_fifo, 0, ¤t);
3199 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3203 current = *VEC_index (token_and_value, token_fifo, 0);
3204 VEC_ordered_remove (token_and_value, token_fifo, 0);
3205 yylval = current.value;
3206 return current.token;
3210 c_parse (struct parser_state *par_state)
3213 struct cleanup *back_to;
3215 /* Setting up the parser state. */
3216 scoped_restore pstate_restore = make_scoped_restore (&pstate);
3217 gdb_assert (par_state != NULL);
3220 /* Note that parsing (within yyparse) freely installs cleanups
3221 assuming they'll be run here (below). */
3223 back_to = make_cleanup (free_current_contents, &expression_macro_scope);
3225 /* Set up the scope for macro expansion. */
3226 expression_macro_scope = NULL;
3228 if (expression_context_block)
3229 expression_macro_scope
3230 = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3232 expression_macro_scope = default_macro_scope ();
3233 if (! expression_macro_scope)
3234 expression_macro_scope = user_macro_scope ();
3236 /* Initialize macro expansion code. */
3237 obstack_init (&expansion_obstack);
3238 gdb_assert (! macro_original_text);
3239 make_cleanup (scan_macro_cleanup, 0);
3241 scoped_restore restore_yydebug = make_scoped_restore (&yydebug,
3244 /* Initialize some state used by the lexer. */
3245 last_was_structop = 0;
3246 saw_name_at_eof = 0;
3248 VEC_free (token_and_value, token_fifo);
3250 name_obstack.clear ();
3252 result = yyparse ();
3253 do_cleanups (back_to);
3260 /* This is called via the YYPRINT macro when parser debugging is
3261 enabled. It prints a token's value. */
3264 c_print_token (FILE *file, int type, YYSTYPE value)
3269 parser_fprintf (file, "typed_val_int<%s, %s>",
3270 TYPE_SAFE_NAME (value.typed_val_int.type),
3271 pulongest (value.typed_val_int.val));
3277 char *copy = (char *) alloca (value.tsval.length + 1);
3279 memcpy (copy, value.tsval.ptr, value.tsval.length);
3280 copy[value.tsval.length] = '\0';
3282 parser_fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3288 parser_fprintf (file, "sval<%s>", copy_name (value.sval));
3292 parser_fprintf (file, "tsym<type=%s, name=%s>",
3293 TYPE_SAFE_NAME (value.tsym.type),
3294 copy_name (value.tsym.stoken));
3298 case UNKNOWN_CPP_NAME:
3301 parser_fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3302 copy_name (value.ssym.stoken),
3303 (value.ssym.sym.symbol == NULL
3304 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym.symbol)),
3305 value.ssym.is_a_field_of_this);
3309 parser_fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3317 yyerror (const char *msg)
3320 lexptr = prev_lexptr;
3322 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);