1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986-2016 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"
52 #include "macroscope.h"
53 #include "objc-lang.h"
54 #include "typeprint.h"
57 #define parse_type(ps) builtin_type (parse_gdbarch (ps))
59 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror,
61 #define GDB_YY_REMAP_PREFIX c_
64 /* The state of the parser, used internally when we are parsing the
67 static struct parser_state *pstate = NULL;
71 static int yylex (void);
73 void yyerror (char *);
75 static int type_aggregate_p (struct type *);
79 /* Although the yacc "value" of an expression is not used,
80 since the result is stored in the structure being created,
81 other node types do have values. */
100 struct typed_stoken tsval;
102 struct symtoken ssym;
104 const struct block *bval;
105 enum exp_opcode opcode;
107 struct stoken_vector svec;
108 VEC (type_ptr) *tvec;
110 struct type_stack *type_stack;
112 struct objc_class_str theclass;
116 /* YYSTYPE gets defined by %union */
117 static int parse_number (struct parser_state *par_state,
118 const char *, int, int, YYSTYPE *);
119 static struct stoken operator_stoken (const char *);
120 static void check_parameter_typelist (VEC (type_ptr) *);
121 static void write_destructor_name (struct parser_state *par_state,
125 static void c_print_token (FILE *file, int type, YYSTYPE value);
126 #define YYPRINT(FILE, TYPE, VALUE) c_print_token (FILE, TYPE, VALUE)
130 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly
132 %type <tval> type typebase
133 %type <tvec> nonempty_typelist func_mod parameter_typelist
134 /* %type <bval> block */
136 /* Fancy type parsing. */
138 %type <lval> array_mod
139 %type <tval> conversion_type_id
141 %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl
143 %token <typed_val_int> INT
144 %token <typed_val_float> FLOAT
145 %token <typed_val_decfloat> DECFLOAT
147 /* Both NAME and TYPENAME tokens represent symbols in the input,
148 and both convey their data as strings.
149 But a TYPENAME is a string that happens to be defined as a typedef
150 or builtin type name (such as int or char)
151 and a NAME is any other symbol.
152 Contexts where this distinction is not important can use the
153 nonterminal "name", which matches either NAME or TYPENAME. */
155 %token <tsval> STRING
156 %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */
157 %token SELECTOR /* ObjC "@selector" pseudo-operator */
159 %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */
160 %token <ssym> UNKNOWN_CPP_NAME
161 %token <voidval> COMPLETE
162 %token <tsym> TYPENAME
163 %token <theclass> CLASSNAME /* ObjC Class name */
165 %type <svec> string_exp
166 %type <ssym> name_not_typename
167 %type <tsym> type_name
169 /* This is like a '[' token, but is only generated when parsing
170 Objective C. This lets us reuse the same parser without
171 erroneously parsing ObjC-specific expressions in C. */
174 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
175 but which would parse as a valid number in the current input radix.
176 E.g. "c" when input_radix==16. Depending on the parse, it will be
177 turned into a name or into a number. */
179 %token <ssym> NAME_OR_INT
182 %token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON
187 %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
193 /* Special type cases, put in to allow the parser to distinguish different
195 %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
197 %token <sval> VARIABLE
199 %token <opcode> ASSIGN_MODIFY
208 %right '=' ASSIGN_MODIFY
216 %left '<' '>' LEQ GEQ
221 %right UNARY INCREMENT DECREMENT
222 %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '('
223 %token <ssym> BLOCKNAME
224 %token <bval> FILENAME
238 { write_exp_elt_opcode(pstate, OP_TYPE);
239 write_exp_elt_type(pstate, $1);
240 write_exp_elt_opcode(pstate, OP_TYPE);}
243 write_exp_elt_opcode (pstate, OP_TYPEOF);
245 | TYPEOF '(' type ')'
247 write_exp_elt_opcode (pstate, OP_TYPE);
248 write_exp_elt_type (pstate, $3);
249 write_exp_elt_opcode (pstate, OP_TYPE);
251 | DECLTYPE '(' exp ')'
253 write_exp_elt_opcode (pstate, OP_DECLTYPE);
257 /* Expressions, including the comma operator. */
260 { write_exp_elt_opcode (pstate, BINOP_COMMA); }
263 /* Expressions, not including the comma operator. */
264 exp : '*' exp %prec UNARY
265 { write_exp_elt_opcode (pstate, UNOP_IND); }
268 exp : '&' exp %prec UNARY
269 { write_exp_elt_opcode (pstate, UNOP_ADDR); }
272 exp : '-' exp %prec UNARY
273 { write_exp_elt_opcode (pstate, UNOP_NEG); }
276 exp : '+' exp %prec UNARY
277 { write_exp_elt_opcode (pstate, UNOP_PLUS); }
280 exp : '!' exp %prec UNARY
281 { write_exp_elt_opcode (pstate, UNOP_LOGICAL_NOT); }
284 exp : '~' exp %prec UNARY
285 { write_exp_elt_opcode (pstate, UNOP_COMPLEMENT); }
288 exp : INCREMENT exp %prec UNARY
289 { write_exp_elt_opcode (pstate, UNOP_PREINCREMENT); }
292 exp : DECREMENT exp %prec UNARY
293 { write_exp_elt_opcode (pstate, UNOP_PREDECREMENT); }
296 exp : exp INCREMENT %prec UNARY
297 { write_exp_elt_opcode (pstate, UNOP_POSTINCREMENT); }
300 exp : exp DECREMENT %prec UNARY
301 { write_exp_elt_opcode (pstate, UNOP_POSTDECREMENT); }
304 exp : TYPEID '(' exp ')' %prec UNARY
305 { write_exp_elt_opcode (pstate, OP_TYPEID); }
308 exp : TYPEID '(' type_exp ')' %prec UNARY
309 { write_exp_elt_opcode (pstate, OP_TYPEID); }
312 exp : SIZEOF exp %prec UNARY
313 { write_exp_elt_opcode (pstate, UNOP_SIZEOF); }
317 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
318 write_exp_string (pstate, $3);
319 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
322 exp : exp ARROW name COMPLETE
323 { mark_struct_expression (pstate);
324 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
325 write_exp_string (pstate, $3);
326 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
329 exp : exp ARROW COMPLETE
331 mark_struct_expression (pstate);
332 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
335 write_exp_string (pstate, s);
336 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
339 exp : exp ARROW '~' name
340 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
341 write_destructor_name (pstate, $4);
342 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
345 exp : exp ARROW '~' name COMPLETE
346 { mark_struct_expression (pstate);
347 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
348 write_destructor_name (pstate, $4);
349 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
352 exp : exp ARROW qualified_name
353 { /* exp->type::name becomes exp->*(&type::name) */
354 /* Note: this doesn't work if name is a
355 static member! FIXME */
356 write_exp_elt_opcode (pstate, UNOP_ADDR);
357 write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
360 exp : exp ARROW_STAR exp
361 { write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
365 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
366 write_exp_string (pstate, $3);
367 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
370 exp : exp '.' name COMPLETE
371 { mark_struct_expression (pstate);
372 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
373 write_exp_string (pstate, $3);
374 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
377 exp : exp '.' COMPLETE
379 mark_struct_expression (pstate);
380 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
383 write_exp_string (pstate, s);
384 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
387 exp : exp '.' '~' name
388 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
389 write_destructor_name (pstate, $4);
390 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
393 exp : exp '.' '~' name COMPLETE
394 { mark_struct_expression (pstate);
395 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
396 write_destructor_name (pstate, $4);
397 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
400 exp : exp '.' qualified_name
401 { /* exp.type::name becomes exp.*(&type::name) */
402 /* Note: this doesn't work if name is a
403 static member! FIXME */
404 write_exp_elt_opcode (pstate, UNOP_ADDR);
405 write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
408 exp : exp DOT_STAR exp
409 { write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
412 exp : exp '[' exp1 ']'
413 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
416 exp : exp OBJC_LBRAC exp1 ']'
417 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
421 * The rules below parse ObjC message calls of the form:
422 * '[' target selector {':' argument}* ']'
425 exp : OBJC_LBRAC TYPENAME
429 theclass = lookup_objc_class (parse_gdbarch (pstate),
430 copy_name ($2.stoken));
432 error (_("%s is not an ObjC Class"),
433 copy_name ($2.stoken));
434 write_exp_elt_opcode (pstate, OP_LONG);
435 write_exp_elt_type (pstate,
436 parse_type (pstate)->builtin_int);
437 write_exp_elt_longcst (pstate, (LONGEST) theclass);
438 write_exp_elt_opcode (pstate, OP_LONG);
442 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
443 end_msglist (pstate);
444 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
448 exp : OBJC_LBRAC CLASSNAME
450 write_exp_elt_opcode (pstate, OP_LONG);
451 write_exp_elt_type (pstate,
452 parse_type (pstate)->builtin_int);
453 write_exp_elt_longcst (pstate, (LONGEST) $2.theclass);
454 write_exp_elt_opcode (pstate, OP_LONG);
458 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
459 end_msglist (pstate);
460 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
467 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
468 end_msglist (pstate);
469 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
474 { add_msglist(&$1, 0); }
482 msgarg : name ':' exp
483 { add_msglist(&$1, 1); }
484 | ':' exp /* Unnamed arg. */
485 { add_msglist(0, 1); }
486 | ',' exp /* Variable number of args. */
487 { add_msglist(0, 0); }
491 /* This is to save the value of arglist_len
492 being accumulated by an outer function call. */
493 { start_arglist (); }
494 arglist ')' %prec ARROW
495 { write_exp_elt_opcode (pstate, OP_FUNCALL);
496 write_exp_elt_longcst (pstate,
497 (LONGEST) end_arglist ());
498 write_exp_elt_opcode (pstate, OP_FUNCALL); }
501 exp : UNKNOWN_CPP_NAME '('
503 /* This could potentially be a an argument defined
504 lookup function (Koenig). */
505 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
506 write_exp_elt_block (pstate,
507 expression_context_block);
508 write_exp_elt_sym (pstate,
509 NULL); /* Placeholder. */
510 write_exp_string (pstate, $1.stoken);
511 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
513 /* This is to save the value of arglist_len
514 being accumulated by an outer function call. */
518 arglist ')' %prec ARROW
520 write_exp_elt_opcode (pstate, OP_FUNCALL);
521 write_exp_elt_longcst (pstate,
522 (LONGEST) end_arglist ());
523 write_exp_elt_opcode (pstate, OP_FUNCALL);
528 { start_arglist (); }
538 arglist : arglist ',' exp %prec ABOVE_COMMA
542 exp : exp '(' parameter_typelist ')' const_or_volatile
544 VEC (type_ptr) *type_list = $3;
545 struct type *type_elt;
546 LONGEST len = VEC_length (type_ptr, type_list);
548 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
549 write_exp_elt_longcst (pstate, len);
551 VEC_iterate (type_ptr, type_list, i, type_elt);
553 write_exp_elt_type (pstate, type_elt);
554 write_exp_elt_longcst(pstate, len);
555 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
556 VEC_free (type_ptr, type_list);
561 { $$ = end_arglist () - 1; }
563 exp : lcurly arglist rcurly %prec ARROW
564 { write_exp_elt_opcode (pstate, OP_ARRAY);
565 write_exp_elt_longcst (pstate, (LONGEST) 0);
566 write_exp_elt_longcst (pstate, (LONGEST) $3);
567 write_exp_elt_opcode (pstate, OP_ARRAY); }
570 exp : lcurly type_exp rcurly exp %prec UNARY
571 { write_exp_elt_opcode (pstate, UNOP_MEMVAL_TYPE); }
574 exp : '(' type_exp ')' exp %prec UNARY
575 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
582 /* Binary operators in order of decreasing precedence. */
585 { write_exp_elt_opcode (pstate, BINOP_REPEAT); }
589 { write_exp_elt_opcode (pstate, BINOP_MUL); }
593 { write_exp_elt_opcode (pstate, BINOP_DIV); }
597 { write_exp_elt_opcode (pstate, BINOP_REM); }
601 { write_exp_elt_opcode (pstate, BINOP_ADD); }
605 { write_exp_elt_opcode (pstate, BINOP_SUB); }
609 { write_exp_elt_opcode (pstate, BINOP_LSH); }
613 { write_exp_elt_opcode (pstate, BINOP_RSH); }
617 { write_exp_elt_opcode (pstate, BINOP_EQUAL); }
620 exp : exp NOTEQUAL exp
621 { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); }
625 { write_exp_elt_opcode (pstate, BINOP_LEQ); }
629 { write_exp_elt_opcode (pstate, BINOP_GEQ); }
633 { write_exp_elt_opcode (pstate, BINOP_LESS); }
637 { write_exp_elt_opcode (pstate, BINOP_GTR); }
641 { write_exp_elt_opcode (pstate, BINOP_BITWISE_AND); }
645 { write_exp_elt_opcode (pstate, BINOP_BITWISE_XOR); }
649 { write_exp_elt_opcode (pstate, BINOP_BITWISE_IOR); }
653 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); }
657 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); }
660 exp : exp '?' exp ':' exp %prec '?'
661 { write_exp_elt_opcode (pstate, TERNOP_COND); }
665 { write_exp_elt_opcode (pstate, BINOP_ASSIGN); }
668 exp : exp ASSIGN_MODIFY exp
669 { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY);
670 write_exp_elt_opcode (pstate, $2);
671 write_exp_elt_opcode (pstate,
672 BINOP_ASSIGN_MODIFY); }
676 { write_exp_elt_opcode (pstate, OP_LONG);
677 write_exp_elt_type (pstate, $1.type);
678 write_exp_elt_longcst (pstate, (LONGEST) ($1.val));
679 write_exp_elt_opcode (pstate, OP_LONG); }
684 struct stoken_vector vec;
687 write_exp_string_vector (pstate, $1.type, &vec);
693 parse_number (pstate, $1.stoken.ptr,
694 $1.stoken.length, 0, &val);
695 write_exp_elt_opcode (pstate, OP_LONG);
696 write_exp_elt_type (pstate, val.typed_val_int.type);
697 write_exp_elt_longcst (pstate,
698 (LONGEST) val.typed_val_int.val);
699 write_exp_elt_opcode (pstate, OP_LONG);
705 { write_exp_elt_opcode (pstate, OP_DOUBLE);
706 write_exp_elt_type (pstate, $1.type);
707 write_exp_elt_dblcst (pstate, $1.dval);
708 write_exp_elt_opcode (pstate, OP_DOUBLE); }
712 { write_exp_elt_opcode (pstate, OP_DECFLOAT);
713 write_exp_elt_type (pstate, $1.type);
714 write_exp_elt_decfloatcst (pstate, $1.val);
715 write_exp_elt_opcode (pstate, OP_DECFLOAT); }
723 write_dollar_variable (pstate, $1);
727 exp : SELECTOR '(' name ')'
729 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR);
730 write_exp_string (pstate, $3);
731 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); }
734 exp : SIZEOF '(' type ')' %prec UNARY
735 { struct type *type = $3;
736 write_exp_elt_opcode (pstate, OP_LONG);
737 write_exp_elt_type (pstate, lookup_signed_typename
738 (parse_language (pstate),
739 parse_gdbarch (pstate),
741 type = check_typedef (type);
743 /* $5.3.3/2 of the C++ Standard (n3290 draft)
744 says of sizeof: "When applied to a reference
745 or a reference type, the result is the size of
746 the referenced type." */
747 if (TYPE_CODE (type) == TYPE_CODE_REF)
748 type = check_typedef (TYPE_TARGET_TYPE (type));
749 write_exp_elt_longcst (pstate,
750 (LONGEST) TYPE_LENGTH (type));
751 write_exp_elt_opcode (pstate, OP_LONG); }
754 exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
755 { write_exp_elt_opcode (pstate,
756 UNOP_REINTERPRET_CAST); }
759 exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
760 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
763 exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
764 { write_exp_elt_opcode (pstate, UNOP_DYNAMIC_CAST); }
767 exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
768 { /* We could do more error checking here, but
769 it doesn't seem worthwhile. */
770 write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
776 /* We copy the string here, and not in the
777 lexer, to guarantee that we do not leak a
778 string. Note that we follow the
779 NUL-termination convention of the
781 struct typed_stoken *vec = XNEW (struct typed_stoken);
786 vec->length = $1.length;
787 vec->ptr = (char *) malloc ($1.length + 1);
788 memcpy (vec->ptr, $1.ptr, $1.length + 1);
793 /* Note that we NUL-terminate here, but just
797 $$.tokens = XRESIZEVEC (struct typed_stoken,
800 p = (char *) malloc ($2.length + 1);
801 memcpy (p, $2.ptr, $2.length + 1);
803 $$.tokens[$$.len - 1].type = $2.type;
804 $$.tokens[$$.len - 1].length = $2.length;
805 $$.tokens[$$.len - 1].ptr = p;
812 c_string_type type = C_STRING;
814 for (i = 0; i < $1.len; ++i)
816 switch ($1.tokens[i].type)
824 && type != $1.tokens[i].type)
825 error (_("Undefined string concatenation."));
826 type = (enum c_string_type_values) $1.tokens[i].type;
830 internal_error (__FILE__, __LINE__,
831 "unrecognized type in string concatenation");
835 write_exp_string_vector (pstate, type, &$1);
836 for (i = 0; i < $1.len; ++i)
837 free ($1.tokens[i].ptr);
842 exp : NSSTRING /* ObjC NextStep NSString constant
843 * of the form '@' '"' string '"'.
845 { write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING);
846 write_exp_string (pstate, $1);
847 write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); }
852 { write_exp_elt_opcode (pstate, OP_LONG);
853 write_exp_elt_type (pstate,
854 parse_type (pstate)->builtin_bool);
855 write_exp_elt_longcst (pstate, (LONGEST) 1);
856 write_exp_elt_opcode (pstate, OP_LONG); }
860 { write_exp_elt_opcode (pstate, OP_LONG);
861 write_exp_elt_type (pstate,
862 parse_type (pstate)->builtin_bool);
863 write_exp_elt_longcst (pstate, (LONGEST) 0);
864 write_exp_elt_opcode (pstate, OP_LONG); }
872 $$ = SYMBOL_BLOCK_VALUE ($1.sym.symbol);
874 error (_("No file or function \"%s\"."),
875 copy_name ($1.stoken));
883 block : block COLONCOLON name
885 = lookup_symbol (copy_name ($3), $1,
886 VAR_DOMAIN, NULL).symbol;
888 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
889 error (_("No function \"%s\" in specified context."),
891 $$ = SYMBOL_BLOCK_VALUE (tem); }
894 variable: name_not_typename ENTRY
895 { struct symbol *sym = $1.sym.symbol;
897 if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym)
898 || !symbol_read_needs_frame (sym))
899 error (_("@entry can be used only for function "
900 "parameters, not for \"%s\""),
901 copy_name ($1.stoken));
903 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
904 write_exp_elt_sym (pstate, sym);
905 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
909 variable: block COLONCOLON name
910 { struct block_symbol sym
911 = lookup_symbol (copy_name ($3), $1,
915 error (_("No symbol \"%s\" in specified context."),
917 if (symbol_read_needs_frame (sym.symbol))
919 if (innermost_block == 0
920 || contained_in (sym.block,
922 innermost_block = sym.block;
925 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
926 write_exp_elt_block (pstate, sym.block);
927 write_exp_elt_sym (pstate, sym.symbol);
928 write_exp_elt_opcode (pstate, OP_VAR_VALUE); }
931 qualified_name: TYPENAME COLONCOLON name
933 struct type *type = $1.type;
934 type = check_typedef (type);
935 if (!type_aggregate_p (type))
936 error (_("`%s' is not defined as an aggregate type."),
937 TYPE_SAFE_NAME (type));
939 write_exp_elt_opcode (pstate, OP_SCOPE);
940 write_exp_elt_type (pstate, type);
941 write_exp_string (pstate, $3);
942 write_exp_elt_opcode (pstate, OP_SCOPE);
944 | TYPENAME COLONCOLON '~' name
946 struct type *type = $1.type;
947 struct stoken tmp_token;
950 type = check_typedef (type);
951 if (!type_aggregate_p (type))
952 error (_("`%s' is not defined as an aggregate type."),
953 TYPE_SAFE_NAME (type));
954 buf = (char *) alloca ($4.length + 2);
956 tmp_token.length = $4.length + 1;
958 memcpy (buf+1, $4.ptr, $4.length);
959 buf[tmp_token.length] = 0;
961 /* Check for valid destructor name. */
962 destructor_name_p (tmp_token.ptr, $1.type);
963 write_exp_elt_opcode (pstate, OP_SCOPE);
964 write_exp_elt_type (pstate, type);
965 write_exp_string (pstate, tmp_token);
966 write_exp_elt_opcode (pstate, OP_SCOPE);
968 | TYPENAME COLONCOLON name COLONCOLON name
970 char *copy = copy_name ($3);
971 error (_("No type \"%s\" within class "
972 "or namespace \"%s\"."),
973 copy, TYPE_SAFE_NAME ($1.type));
977 variable: qualified_name
978 | COLONCOLON name_not_typename
980 char *name = copy_name ($2.stoken);
982 struct bound_minimal_symbol msymbol;
985 = lookup_symbol (name, (const struct block *) NULL,
986 VAR_DOMAIN, NULL).symbol;
989 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
990 write_exp_elt_block (pstate, NULL);
991 write_exp_elt_sym (pstate, sym);
992 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
996 msymbol = lookup_bound_minimal_symbol (name);
997 if (msymbol.minsym != NULL)
998 write_exp_msymbol (pstate, msymbol);
999 else if (!have_full_symbols () && !have_partial_symbols ())
1000 error (_("No symbol table is loaded. Use the \"file\" command."));
1002 error (_("No symbol \"%s\" in current context."), name);
1006 variable: name_not_typename
1007 { struct block_symbol sym = $1.sym;
1011 if (symbol_read_needs_frame (sym.symbol))
1013 if (innermost_block == 0
1014 || contained_in (sym.block,
1016 innermost_block = sym.block;
1019 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1020 write_exp_elt_block (pstate, sym.block);
1021 write_exp_elt_sym (pstate, sym.symbol);
1022 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1024 else if ($1.is_a_field_of_this)
1026 /* C++: it hangs off of `this'. Must
1027 not inadvertently convert from a method call
1029 if (innermost_block == 0
1030 || contained_in (sym.block,
1032 innermost_block = sym.block;
1033 write_exp_elt_opcode (pstate, OP_THIS);
1034 write_exp_elt_opcode (pstate, OP_THIS);
1035 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1036 write_exp_string (pstate, $1.stoken);
1037 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1041 struct bound_minimal_symbol msymbol;
1042 char *arg = copy_name ($1.stoken);
1045 lookup_bound_minimal_symbol (arg);
1046 if (msymbol.minsym != NULL)
1047 write_exp_msymbol (pstate, msymbol);
1048 else if (!have_full_symbols () && !have_partial_symbols ())
1049 error (_("No symbol table is loaded. Use the \"file\" command."));
1051 error (_("No symbol \"%s\" in current context."),
1052 copy_name ($1.stoken));
1057 space_identifier : '@' NAME
1058 { insert_type_address_space (pstate, copy_name ($2.stoken)); }
1061 const_or_volatile: const_or_volatile_noopt
1065 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1068 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1069 | const_or_volatile_noopt
1072 const_or_volatile_or_space_identifier:
1073 const_or_volatile_or_space_identifier_noopt
1079 { insert_type (tp_pointer); }
1080 const_or_volatile_or_space_identifier
1082 { insert_type (tp_pointer); }
1083 const_or_volatile_or_space_identifier
1085 { insert_type (tp_reference); }
1087 { insert_type (tp_reference); }
1090 ptr_operator_ts: ptr_operator
1092 $$ = get_type_stack ();
1093 /* This cleanup is eventually run by
1095 make_cleanup (type_stack_cleanup, $$);
1099 abs_decl: ptr_operator_ts direct_abs_decl
1100 { $$ = append_type_stack ($2, $1); }
1105 direct_abs_decl: '(' abs_decl ')'
1107 | direct_abs_decl array_mod
1109 push_type_stack ($1);
1111 push_type (tp_array);
1112 $$ = get_type_stack ();
1117 push_type (tp_array);
1118 $$ = get_type_stack ();
1121 | direct_abs_decl func_mod
1123 push_type_stack ($1);
1125 $$ = get_type_stack ();
1130 $$ = get_type_stack ();
1140 | OBJC_LBRAC INT ']'
1146 | '(' parameter_typelist ')'
1150 /* We used to try to recognize pointer to member types here, but
1151 that didn't work (shift/reduce conflicts meant that these rules never
1152 got executed). The problem is that
1153 int (foo::bar::baz::bizzle)
1154 is a function type but
1155 int (foo::bar::baz::bizzle::*)
1156 is a pointer to member type. Stroustrup loses again! */
1161 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1165 { $$ = lookup_signed_typename (parse_language (pstate),
1166 parse_gdbarch (pstate),
1169 { $$ = lookup_signed_typename (parse_language (pstate),
1170 parse_gdbarch (pstate),
1173 { $$ = lookup_signed_typename (parse_language (pstate),
1174 parse_gdbarch (pstate),
1177 { $$ = lookup_signed_typename (parse_language (pstate),
1178 parse_gdbarch (pstate),
1180 | LONG SIGNED_KEYWORD INT_KEYWORD
1181 { $$ = lookup_signed_typename (parse_language (pstate),
1182 parse_gdbarch (pstate),
1184 | LONG SIGNED_KEYWORD
1185 { $$ = lookup_signed_typename (parse_language (pstate),
1186 parse_gdbarch (pstate),
1188 | SIGNED_KEYWORD LONG INT_KEYWORD
1189 { $$ = lookup_signed_typename (parse_language (pstate),
1190 parse_gdbarch (pstate),
1192 | UNSIGNED LONG INT_KEYWORD
1193 { $$ = lookup_unsigned_typename (parse_language (pstate),
1194 parse_gdbarch (pstate),
1196 | LONG UNSIGNED INT_KEYWORD
1197 { $$ = lookup_unsigned_typename (parse_language (pstate),
1198 parse_gdbarch (pstate),
1201 { $$ = lookup_unsigned_typename (parse_language (pstate),
1202 parse_gdbarch (pstate),
1205 { $$ = lookup_signed_typename (parse_language (pstate),
1206 parse_gdbarch (pstate),
1208 | LONG LONG INT_KEYWORD
1209 { $$ = lookup_signed_typename (parse_language (pstate),
1210 parse_gdbarch (pstate),
1212 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1213 { $$ = lookup_signed_typename (parse_language (pstate),
1214 parse_gdbarch (pstate),
1216 | LONG LONG SIGNED_KEYWORD
1217 { $$ = lookup_signed_typename (parse_language (pstate),
1218 parse_gdbarch (pstate),
1220 | SIGNED_KEYWORD LONG LONG
1221 { $$ = lookup_signed_typename (parse_language (pstate),
1222 parse_gdbarch (pstate),
1224 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1225 { $$ = lookup_signed_typename (parse_language (pstate),
1226 parse_gdbarch (pstate),
1228 | UNSIGNED LONG LONG
1229 { $$ = lookup_unsigned_typename (parse_language (pstate),
1230 parse_gdbarch (pstate),
1232 | UNSIGNED LONG LONG INT_KEYWORD
1233 { $$ = lookup_unsigned_typename (parse_language (pstate),
1234 parse_gdbarch (pstate),
1236 | LONG LONG UNSIGNED
1237 { $$ = lookup_unsigned_typename (parse_language (pstate),
1238 parse_gdbarch (pstate),
1240 | LONG LONG UNSIGNED INT_KEYWORD
1241 { $$ = lookup_unsigned_typename (parse_language (pstate),
1242 parse_gdbarch (pstate),
1245 { $$ = lookup_signed_typename (parse_language (pstate),
1246 parse_gdbarch (pstate),
1248 | SHORT SIGNED_KEYWORD INT_KEYWORD
1249 { $$ = lookup_signed_typename (parse_language (pstate),
1250 parse_gdbarch (pstate),
1252 | SHORT SIGNED_KEYWORD
1253 { $$ = lookup_signed_typename (parse_language (pstate),
1254 parse_gdbarch (pstate),
1256 | UNSIGNED SHORT INT_KEYWORD
1257 { $$ = lookup_unsigned_typename (parse_language (pstate),
1258 parse_gdbarch (pstate),
1261 { $$ = lookup_unsigned_typename (parse_language (pstate),
1262 parse_gdbarch (pstate),
1264 | SHORT UNSIGNED INT_KEYWORD
1265 { $$ = lookup_unsigned_typename (parse_language (pstate),
1266 parse_gdbarch (pstate),
1269 { $$ = lookup_typename (parse_language (pstate),
1270 parse_gdbarch (pstate),
1272 (struct block *) NULL,
1274 | LONG DOUBLE_KEYWORD
1275 { $$ = lookup_typename (parse_language (pstate),
1276 parse_gdbarch (pstate),
1278 (struct block *) NULL,
1281 { $$ = lookup_struct (copy_name ($2),
1282 expression_context_block); }
1285 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1288 | STRUCT name COMPLETE
1290 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1295 { $$ = lookup_struct (copy_name ($2),
1296 expression_context_block); }
1299 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1302 | CLASS name COMPLETE
1304 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1309 { $$ = lookup_union (copy_name ($2),
1310 expression_context_block); }
1313 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1316 | UNION name COMPLETE
1318 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1323 { $$ = lookup_enum (copy_name ($2),
1324 expression_context_block); }
1327 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1330 | ENUM name COMPLETE
1332 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1336 | UNSIGNED type_name
1337 { $$ = lookup_unsigned_typename (parse_language (pstate),
1338 parse_gdbarch (pstate),
1339 TYPE_NAME($2.type)); }
1341 { $$ = lookup_unsigned_typename (parse_language (pstate),
1342 parse_gdbarch (pstate),
1344 | SIGNED_KEYWORD type_name
1345 { $$ = lookup_signed_typename (parse_language (pstate),
1346 parse_gdbarch (pstate),
1347 TYPE_NAME($2.type)); }
1349 { $$ = lookup_signed_typename (parse_language (pstate),
1350 parse_gdbarch (pstate),
1352 /* It appears that this rule for templates is never
1353 reduced; template recognition happens by lookahead
1354 in the token processing code in yylex. */
1355 | TEMPLATE name '<' type '>'
1356 { $$ = lookup_template_type(copy_name($2), $4,
1357 expression_context_block);
1359 | const_or_volatile_or_space_identifier_noopt typebase
1360 { $$ = follow_types ($2); }
1361 | typebase const_or_volatile_or_space_identifier_noopt
1362 { $$ = follow_types ($1); }
1368 $$.stoken.ptr = "int";
1369 $$.stoken.length = 3;
1370 $$.type = lookup_signed_typename (parse_language (pstate),
1371 parse_gdbarch (pstate),
1376 $$.stoken.ptr = "long";
1377 $$.stoken.length = 4;
1378 $$.type = lookup_signed_typename (parse_language (pstate),
1379 parse_gdbarch (pstate),
1384 $$.stoken.ptr = "short";
1385 $$.stoken.length = 5;
1386 $$.type = lookup_signed_typename (parse_language (pstate),
1387 parse_gdbarch (pstate),
1394 { check_parameter_typelist ($1); }
1395 | nonempty_typelist ',' DOTDOTDOT
1397 VEC_safe_push (type_ptr, $1, NULL);
1398 check_parameter_typelist ($1);
1406 VEC (type_ptr) *typelist = NULL;
1407 VEC_safe_push (type_ptr, typelist, $1);
1410 | nonempty_typelist ',' type
1412 VEC_safe_push (type_ptr, $1, $3);
1420 push_type_stack ($2);
1421 $$ = follow_types ($1);
1425 conversion_type_id: typebase conversion_declarator
1426 { $$ = follow_types ($1); }
1429 conversion_declarator: /* Nothing. */
1430 | ptr_operator conversion_declarator
1433 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1434 | VOLATILE_KEYWORD CONST_KEYWORD
1437 const_or_volatile_noopt: const_and_volatile
1438 { insert_type (tp_const);
1439 insert_type (tp_volatile);
1442 { insert_type (tp_const); }
1444 { insert_type (tp_volatile); }
1448 { $$ = operator_stoken (" new"); }
1450 { $$ = operator_stoken (" delete"); }
1451 | OPERATOR NEW '[' ']'
1452 { $$ = operator_stoken (" new[]"); }
1453 | OPERATOR DELETE '[' ']'
1454 { $$ = operator_stoken (" delete[]"); }
1455 | OPERATOR NEW OBJC_LBRAC ']'
1456 { $$ = operator_stoken (" new[]"); }
1457 | OPERATOR DELETE OBJC_LBRAC ']'
1458 { $$ = operator_stoken (" delete[]"); }
1460 { $$ = operator_stoken ("+"); }
1462 { $$ = operator_stoken ("-"); }
1464 { $$ = operator_stoken ("*"); }
1466 { $$ = operator_stoken ("/"); }
1468 { $$ = operator_stoken ("%"); }
1470 { $$ = operator_stoken ("^"); }
1472 { $$ = operator_stoken ("&"); }
1474 { $$ = operator_stoken ("|"); }
1476 { $$ = operator_stoken ("~"); }
1478 { $$ = operator_stoken ("!"); }
1480 { $$ = operator_stoken ("="); }
1482 { $$ = operator_stoken ("<"); }
1484 { $$ = operator_stoken (">"); }
1485 | OPERATOR ASSIGN_MODIFY
1486 { const char *op = "unknown";
1510 case BINOP_BITWISE_IOR:
1513 case BINOP_BITWISE_AND:
1516 case BINOP_BITWISE_XOR:
1523 $$ = operator_stoken (op);
1526 { $$ = operator_stoken ("<<"); }
1528 { $$ = operator_stoken (">>"); }
1530 { $$ = operator_stoken ("=="); }
1532 { $$ = operator_stoken ("!="); }
1534 { $$ = operator_stoken ("<="); }
1536 { $$ = operator_stoken (">="); }
1538 { $$ = operator_stoken ("&&"); }
1540 { $$ = operator_stoken ("||"); }
1541 | OPERATOR INCREMENT
1542 { $$ = operator_stoken ("++"); }
1543 | OPERATOR DECREMENT
1544 { $$ = operator_stoken ("--"); }
1546 { $$ = operator_stoken (","); }
1547 | OPERATOR ARROW_STAR
1548 { $$ = operator_stoken ("->*"); }
1550 { $$ = operator_stoken ("->"); }
1552 { $$ = operator_stoken ("()"); }
1554 { $$ = operator_stoken ("[]"); }
1555 | OPERATOR OBJC_LBRAC ']'
1556 { $$ = operator_stoken ("[]"); }
1557 | OPERATOR conversion_type_id
1560 struct ui_file *buf = mem_fileopen ();
1562 c_print_type ($2, NULL, buf, -1, 0,
1563 &type_print_raw_options);
1564 name = ui_file_xstrdup (buf, &length);
1565 ui_file_delete (buf);
1566 $$ = operator_stoken (name);
1573 name : NAME { $$ = $1.stoken; }
1574 | BLOCKNAME { $$ = $1.stoken; }
1575 | TYPENAME { $$ = $1.stoken; }
1576 | NAME_OR_INT { $$ = $1.stoken; }
1577 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1581 name_not_typename : NAME
1583 /* These would be useful if name_not_typename was useful, but it is just
1584 a fake for "variable", so these cause reduce/reduce conflicts because
1585 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1586 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1587 context where only a name could occur, this might be useful.
1592 struct field_of_this_result is_a_field_of_this;
1595 $$.sym = lookup_symbol ($1.ptr,
1596 expression_context_block,
1598 &is_a_field_of_this);
1599 $$.is_a_field_of_this
1600 = is_a_field_of_this.type != NULL;
1607 /* Like write_exp_string, but prepends a '~'. */
1610 write_destructor_name (struct parser_state *par_state, struct stoken token)
1612 char *copy = (char *) alloca (token.length + 1);
1615 memcpy (©[1], token.ptr, token.length);
1620 write_exp_string (par_state, token);
1623 /* Returns a stoken of the operator name given by OP (which does not
1624 include the string "operator"). */
1626 static struct stoken
1627 operator_stoken (const char *op)
1629 static const char *operator_string = "operator";
1630 struct stoken st = { NULL, 0 };
1633 st.length = strlen (operator_string) + strlen (op);
1634 buf = (char *) malloc (st.length + 1);
1635 strcpy (buf, operator_string);
1639 /* The toplevel (c_parse) will free the memory allocated here. */
1640 make_cleanup (free, buf);
1644 /* Return true if the type is aggregate-like. */
1647 type_aggregate_p (struct type *type)
1649 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1650 || TYPE_CODE (type) == TYPE_CODE_UNION
1651 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1652 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1653 && TYPE_DECLARED_CLASS (type)));
1656 /* Validate a parameter typelist. */
1659 check_parameter_typelist (VEC (type_ptr) *params)
1664 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1666 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1670 if (VEC_length (type_ptr, params) == 1)
1675 VEC_free (type_ptr, params);
1676 error (_("parameter types following 'void'"));
1680 VEC_free (type_ptr, params);
1681 error (_("'void' invalid as parameter type"));
1687 /* Take care of parsing a number (anything that starts with a digit).
1688 Set yylval and return the token type; update lexptr.
1689 LEN is the number of characters in it. */
1691 /*** Needs some error checking for the float case ***/
1694 parse_number (struct parser_state *par_state,
1695 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1697 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1698 here, and we do kind of silly things like cast to unsigned. */
1705 int base = input_radix;
1708 /* Number of "L" suffixes encountered. */
1711 /* We have found a "L" or "U" suffix. */
1712 int found_suffix = 0;
1715 struct type *signed_type;
1716 struct type *unsigned_type;
1719 p = (char *) alloca (len);
1720 memcpy (p, buf, len);
1724 /* If it ends at "df", "dd" or "dl", take it as type of decimal floating
1725 point. Return DECFLOAT. */
1727 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1730 putithere->typed_val_decfloat.type
1731 = parse_type (par_state)->builtin_decfloat;
1732 decimal_from_string (putithere->typed_val_decfloat.val, 4,
1733 gdbarch_byte_order (parse_gdbarch (par_state)),
1739 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1742 putithere->typed_val_decfloat.type
1743 = parse_type (par_state)->builtin_decdouble;
1744 decimal_from_string (putithere->typed_val_decfloat.val, 8,
1745 gdbarch_byte_order (parse_gdbarch (par_state)),
1751 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1754 putithere->typed_val_decfloat.type
1755 = parse_type (par_state)->builtin_declong;
1756 decimal_from_string (putithere->typed_val_decfloat.val, 16,
1757 gdbarch_byte_order (parse_gdbarch (par_state)),
1763 if (! parse_c_float (parse_gdbarch (par_state), p, len,
1764 &putithere->typed_val_float.dval,
1765 &putithere->typed_val_float.type))
1770 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1771 if (p[0] == '0' && len > 1)
1814 if (c >= 'A' && c <= 'Z')
1816 if (c != 'l' && c != 'u')
1818 if (c >= '0' && c <= '9')
1826 if (base > 10 && c >= 'a' && c <= 'f')
1830 n += i = c - 'a' + 10;
1843 return ERROR; /* Char not a digit */
1846 return ERROR; /* Invalid digit in this base */
1848 /* Portably test for overflow (only works for nonzero values, so make
1849 a second check for zero). FIXME: Can't we just make n and prevn
1850 unsigned and avoid this? */
1851 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1852 unsigned_p = 1; /* Try something unsigned */
1854 /* Portably test for unsigned overflow.
1855 FIXME: This check is wrong; for example it doesn't find overflow
1856 on 0x123456789 when LONGEST is 32 bits. */
1857 if (c != 'l' && c != 'u' && n != 0)
1859 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1860 error (_("Numeric constant too large."));
1865 /* An integer constant is an int, a long, or a long long. An L
1866 suffix forces it to be long; an LL suffix forces it to be long
1867 long. If not forced to a larger size, it gets the first type of
1868 the above that it fits in. To figure out whether it fits, we
1869 shift it right and see whether anything remains. Note that we
1870 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1871 operation, because many compilers will warn about such a shift
1872 (which always produces a zero result). Sometimes gdbarch_int_bit
1873 or gdbarch_long_bit will be that big, sometimes not. To deal with
1874 the case where it is we just always shift the value more than
1875 once, with fewer bits each time. */
1877 un = (ULONGEST)n >> 2;
1879 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1882 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1884 /* A large decimal (not hex or octal) constant (between INT_MAX
1885 and UINT_MAX) is a long or unsigned long, according to ANSI,
1886 never an unsigned int, but this code treats it as unsigned
1887 int. This probably should be fixed. GCC gives a warning on
1890 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1891 signed_type = parse_type (par_state)->builtin_int;
1893 else if (long_p <= 1
1894 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1897 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1898 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1899 signed_type = parse_type (par_state)->builtin_long;
1904 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1905 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1906 /* A long long does not fit in a LONGEST. */
1907 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1909 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1910 high_bit = (ULONGEST) 1 << shift;
1911 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1912 signed_type = parse_type (par_state)->builtin_long_long;
1915 putithere->typed_val_int.val = n;
1917 /* If the high bit of the worked out type is set then this number
1918 has to be unsigned. */
1920 if (unsigned_p || (n & high_bit))
1922 putithere->typed_val_int.type = unsigned_type;
1926 putithere->typed_val_int.type = signed_type;
1932 /* Temporary obstack used for holding strings. */
1933 static struct obstack tempbuf;
1934 static int tempbuf_init;
1936 /* Parse a C escape sequence. The initial backslash of the sequence
1937 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1938 last character of the sequence. If OUTPUT is not NULL, the
1939 translated form of the escape sequence will be written there. If
1940 OUTPUT is NULL, no output is written and the call will only affect
1941 *PTR. If an escape sequence is expressed in target bytes, then the
1942 entire sequence will simply be copied to OUTPUT. Return 1 if any
1943 character was emitted, 0 otherwise. */
1946 c_parse_escape (const char **ptr, struct obstack *output)
1948 const char *tokptr = *ptr;
1951 /* Some escape sequences undergo character set conversion. Those we
1955 /* Hex escapes do not undergo character set conversion, so keep
1956 the escape sequence for later. */
1959 obstack_grow_str (output, "\\x");
1961 if (!isxdigit (*tokptr))
1962 error (_("\\x escape without a following hex digit"));
1963 while (isxdigit (*tokptr))
1966 obstack_1grow (output, *tokptr);
1971 /* Octal escapes do not undergo character set conversion, so
1972 keep the escape sequence for later. */
1984 obstack_grow_str (output, "\\");
1986 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
1990 obstack_1grow (output, *tokptr);
1996 /* We handle UCNs later. We could handle them here, but that
1997 would mean a spurious error in the case where the UCN could
1998 be converted to the target charset but not the host
2004 int i, len = c == 'U' ? 8 : 4;
2007 obstack_1grow (output, '\\');
2008 obstack_1grow (output, *tokptr);
2011 if (!isxdigit (*tokptr))
2012 error (_("\\%c escape without a following hex digit"), c);
2013 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2016 obstack_1grow (output, *tokptr);
2022 /* We must pass backslash through so that it does not
2023 cause quoting during the second expansion. */
2026 obstack_grow_str (output, "\\\\");
2030 /* Escapes which undergo conversion. */
2033 obstack_1grow (output, '\a');
2038 obstack_1grow (output, '\b');
2043 obstack_1grow (output, '\f');
2048 obstack_1grow (output, '\n');
2053 obstack_1grow (output, '\r');
2058 obstack_1grow (output, '\t');
2063 obstack_1grow (output, '\v');
2067 /* GCC extension. */
2070 obstack_1grow (output, HOST_ESCAPE_CHAR);
2074 /* Backslash-newline expands to nothing at all. */
2080 /* A few escapes just expand to the character itself. */
2084 /* GCC extensions. */
2089 /* Unrecognized escapes turn into the character itself. */
2092 obstack_1grow (output, *tokptr);
2100 /* Parse a string or character literal from TOKPTR. The string or
2101 character may be wide or unicode. *OUTPTR is set to just after the
2102 end of the literal in the input string. The resulting token is
2103 stored in VALUE. This returns a token value, either STRING or
2104 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2105 number of host characters in the literal. */
2108 parse_string_or_char (const char *tokptr, const char **outptr,
2109 struct typed_stoken *value, int *host_chars)
2115 /* Build the gdb internal form of the input string in tempbuf. Note
2116 that the buffer is null byte terminated *only* for the
2117 convenience of debugging gdb itself and printing the buffer
2118 contents when the buffer contains no embedded nulls. Gdb does
2119 not depend upon the buffer being null byte terminated, it uses
2120 the length string instead. This allows gdb to handle C strings
2121 (as well as strings in other languages) with embedded null
2127 obstack_free (&tempbuf, NULL);
2128 obstack_init (&tempbuf);
2130 /* Record the string type. */
2133 type = C_WIDE_STRING;
2136 else if (*tokptr == 'u')
2141 else if (*tokptr == 'U')
2146 else if (*tokptr == '@')
2148 /* An Objective C string. */
2156 /* Skip the quote. */
2170 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2172 else if (c == quote)
2176 obstack_1grow (&tempbuf, c);
2178 /* FIXME: this does the wrong thing with multi-byte host
2179 characters. We could use mbrlen here, but that would
2180 make "set host-charset" a bit less useful. */
2185 if (*tokptr != quote)
2188 error (_("Unterminated string in expression."));
2190 error (_("Unmatched single quote."));
2195 value->ptr = (char *) obstack_base (&tempbuf);
2196 value->length = obstack_object_size (&tempbuf);
2200 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2203 /* This is used to associate some attributes with a token. */
2207 /* If this bit is set, the token is C++-only. */
2211 /* If this bit is set, the token is conditional: if there is a
2212 symbol of the same name, then the token is a symbol; otherwise,
2213 the token is a keyword. */
2217 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2223 enum exp_opcode opcode;
2227 static const struct token tokentab3[] =
2229 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2230 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2231 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2232 {"...", DOTDOTDOT, BINOP_END, 0}
2235 static const struct token tokentab2[] =
2237 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2238 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2239 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2240 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2241 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2242 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2243 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2244 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2245 {"++", INCREMENT, BINOP_END, 0},
2246 {"--", DECREMENT, BINOP_END, 0},
2247 {"->", ARROW, BINOP_END, 0},
2248 {"&&", ANDAND, BINOP_END, 0},
2249 {"||", OROR, BINOP_END, 0},
2250 /* "::" is *not* only C++: gdb overrides its meaning in several
2251 different ways, e.g., 'filename'::func, function::variable. */
2252 {"::", COLONCOLON, BINOP_END, 0},
2253 {"<<", LSH, BINOP_END, 0},
2254 {">>", RSH, BINOP_END, 0},
2255 {"==", EQUAL, BINOP_END, 0},
2256 {"!=", NOTEQUAL, BINOP_END, 0},
2257 {"<=", LEQ, BINOP_END, 0},
2258 {">=", GEQ, BINOP_END, 0},
2259 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2262 /* Identifier-like tokens. */
2263 static const struct token ident_tokens[] =
2265 {"unsigned", UNSIGNED, OP_NULL, 0},
2266 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2267 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2268 {"struct", STRUCT, OP_NULL, 0},
2269 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2270 {"sizeof", SIZEOF, OP_NULL, 0},
2271 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2272 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2273 {"class", CLASS, OP_NULL, FLAG_CXX},
2274 {"union", UNION, OP_NULL, 0},
2275 {"short", SHORT, OP_NULL, 0},
2276 {"const", CONST_KEYWORD, OP_NULL, 0},
2277 {"enum", ENUM, OP_NULL, 0},
2278 {"long", LONG, OP_NULL, 0},
2279 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2280 {"int", INT_KEYWORD, OP_NULL, 0},
2281 {"new", NEW, OP_NULL, FLAG_CXX},
2282 {"delete", DELETE, OP_NULL, FLAG_CXX},
2283 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2285 {"and", ANDAND, BINOP_END, FLAG_CXX},
2286 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2287 {"bitand", '&', OP_NULL, FLAG_CXX},
2288 {"bitor", '|', OP_NULL, FLAG_CXX},
2289 {"compl", '~', OP_NULL, FLAG_CXX},
2290 {"not", '!', OP_NULL, FLAG_CXX},
2291 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2292 {"or", OROR, BINOP_END, FLAG_CXX},
2293 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2294 {"xor", '^', OP_NULL, FLAG_CXX},
2295 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2297 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2298 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2299 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2300 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2302 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2303 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2304 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2305 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2306 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2308 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2311 /* When we find that lexptr (the global var defined in parse.c) is
2312 pointing at a macro invocation, we expand the invocation, and call
2313 scan_macro_expansion to save the old lexptr here and point lexptr
2314 into the expanded text. When we reach the end of that, we call
2315 end_macro_expansion to pop back to the value we saved here. The
2316 macro expansion code promises to return only fully-expanded text,
2317 so we don't need to "push" more than one level.
2319 This is disgusting, of course. It would be cleaner to do all macro
2320 expansion beforehand, and then hand that to lexptr. But we don't
2321 really know where the expression ends. Remember, in a command like
2323 (gdb) break *ADDRESS if CONDITION
2325 we evaluate ADDRESS in the scope of the current frame, but we
2326 evaluate CONDITION in the scope of the breakpoint's location. So
2327 it's simply wrong to try to macro-expand the whole thing at once. */
2328 static const char *macro_original_text;
2330 /* We save all intermediate macro expansions on this obstack for the
2331 duration of a single parse. The expansion text may sometimes have
2332 to live past the end of the expansion, due to yacc lookahead.
2333 Rather than try to be clever about saving the data for a single
2334 token, we simply keep it all and delete it after parsing has
2336 static struct obstack expansion_obstack;
2339 scan_macro_expansion (char *expansion)
2343 /* We'd better not be trying to push the stack twice. */
2344 gdb_assert (! macro_original_text);
2346 /* Copy to the obstack, and then free the intermediate
2348 copy = (char *) obstack_copy0 (&expansion_obstack, expansion,
2349 strlen (expansion));
2352 /* Save the old lexptr value, so we can return to it when we're done
2353 parsing the expanded text. */
2354 macro_original_text = lexptr;
2359 scanning_macro_expansion (void)
2361 return macro_original_text != 0;
2365 finished_macro_expansion (void)
2367 /* There'd better be something to pop back to. */
2368 gdb_assert (macro_original_text);
2370 /* Pop back to the original text. */
2371 lexptr = macro_original_text;
2372 macro_original_text = 0;
2376 scan_macro_cleanup (void *dummy)
2378 if (macro_original_text)
2379 finished_macro_expansion ();
2381 obstack_free (&expansion_obstack, NULL);
2384 /* Return true iff the token represents a C++ cast operator. */
2387 is_cast_operator (const char *token, int len)
2389 return (! strncmp (token, "dynamic_cast", len)
2390 || ! strncmp (token, "static_cast", len)
2391 || ! strncmp (token, "reinterpret_cast", len)
2392 || ! strncmp (token, "const_cast", len));
2395 /* The scope used for macro expansion. */
2396 static struct macro_scope *expression_macro_scope;
2398 /* This is set if a NAME token appeared at the very end of the input
2399 string, with no whitespace separating the name from the EOF. This
2400 is used only when parsing to do field name completion. */
2401 static int saw_name_at_eof;
2403 /* This is set if the previously-returned token was a structure
2404 operator -- either '.' or ARROW. This is used only when parsing to
2405 do field name completion. */
2406 static int last_was_structop;
2408 /* Read one token, getting characters through lexptr. */
2411 lex_one_token (struct parser_state *par_state, int *is_quoted_name)
2416 const char *tokstart;
2417 int saw_structop = last_was_structop;
2420 last_was_structop = 0;
2421 *is_quoted_name = 0;
2425 /* Check if this is a macro invocation that we need to expand. */
2426 if (! scanning_macro_expansion ())
2428 char *expanded = macro_expand_next (&lexptr,
2429 standard_macro_lookup,
2430 expression_macro_scope);
2433 scan_macro_expansion (expanded);
2436 prev_lexptr = lexptr;
2439 /* See if it is a special token of length 3. */
2440 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2441 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2443 if ((tokentab3[i].flags & FLAG_CXX) != 0
2444 && parse_language (par_state)->la_language != language_cplus)
2448 yylval.opcode = tokentab3[i].opcode;
2449 return tokentab3[i].token;
2452 /* See if it is a special token of length 2. */
2453 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2454 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2456 if ((tokentab2[i].flags & FLAG_CXX) != 0
2457 && parse_language (par_state)->la_language != language_cplus)
2461 yylval.opcode = tokentab2[i].opcode;
2462 if (parse_completion && tokentab2[i].token == ARROW)
2463 last_was_structop = 1;
2464 return tokentab2[i].token;
2467 switch (c = *tokstart)
2470 /* If we were just scanning the result of a macro expansion,
2471 then we need to resume scanning the original text.
2472 If we're parsing for field name completion, and the previous
2473 token allows such completion, return a COMPLETE token.
2474 Otherwise, we were already scanning the original text, and
2475 we're really done. */
2476 if (scanning_macro_expansion ())
2478 finished_macro_expansion ();
2481 else if (saw_name_at_eof)
2483 saw_name_at_eof = 0;
2486 else if (saw_structop)
2501 if (parse_language (par_state)->la_language == language_objc
2508 if (paren_depth == 0)
2515 if (comma_terminates
2517 && ! scanning_macro_expansion ())
2523 /* Might be a floating point number. */
2524 if (lexptr[1] < '0' || lexptr[1] > '9')
2526 if (parse_completion)
2527 last_was_structop = 1;
2528 goto symbol; /* Nope, must be a symbol. */
2530 /* FALL THRU into number case. */
2543 /* It's a number. */
2544 int got_dot = 0, got_e = 0, toktype;
2545 const char *p = tokstart;
2546 int hex = input_radix > 10;
2548 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2553 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2561 /* This test includes !hex because 'e' is a valid hex digit
2562 and thus does not indicate a floating point number when
2563 the radix is hex. */
2564 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2565 got_dot = got_e = 1;
2566 /* This test does not include !hex, because a '.' always indicates
2567 a decimal floating point number regardless of the radix. */
2568 else if (!got_dot && *p == '.')
2570 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2571 && (*p == '-' || *p == '+'))
2572 /* This is the sign of the exponent, not the end of the
2575 /* We will take any letters or digits. parse_number will
2576 complain if past the radix, or if L or U are not final. */
2577 else if ((*p < '0' || *p > '9')
2578 && ((*p < 'a' || *p > 'z')
2579 && (*p < 'A' || *p > 'Z')))
2582 toktype = parse_number (par_state, tokstart, p - tokstart,
2583 got_dot|got_e, &yylval);
2584 if (toktype == ERROR)
2586 char *err_copy = (char *) alloca (p - tokstart + 1);
2588 memcpy (err_copy, tokstart, p - tokstart);
2589 err_copy[p - tokstart] = 0;
2590 error (_("Invalid number \"%s\"."), err_copy);
2598 const char *p = &tokstart[1];
2599 size_t len = strlen ("entry");
2601 if (parse_language (par_state)->la_language == language_objc)
2603 size_t len = strlen ("selector");
2605 if (strncmp (p, "selector", len) == 0
2606 && (p[len] == '\0' || isspace (p[len])))
2615 while (isspace (*p))
2617 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2649 if (tokstart[1] != '"' && tokstart[1] != '\'')
2658 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2663 error (_("Empty character constant."));
2664 else if (host_len > 2 && c == '\'')
2667 namelen = lexptr - tokstart - 1;
2668 *is_quoted_name = 1;
2672 else if (host_len > 1)
2673 error (_("Invalid character constant."));
2679 if (!(c == '_' || c == '$'
2680 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2681 /* We must have come across a bad character (e.g. ';'). */
2682 error (_("Invalid character '%c' in expression."), c);
2684 /* It's a name. See how long it is. */
2686 for (c = tokstart[namelen];
2687 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2688 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2690 /* Template parameter lists are part of the name.
2691 FIXME: This mishandles `print $a<4&&$a>3'. */
2695 if (! is_cast_operator (tokstart, namelen))
2697 /* Scan ahead to get rest of the template specification. Note
2698 that we look ahead only when the '<' adjoins non-whitespace
2699 characters; for comparison expressions, e.g. "a < b > c",
2700 there must be spaces before the '<', etc. */
2701 const char *p = find_template_name_end (tokstart + namelen);
2704 namelen = p - tokstart;
2708 c = tokstart[++namelen];
2711 /* The token "if" terminates the expression and is NOT removed from
2712 the input stream. It doesn't count if it appears in the
2713 expansion of a macro. */
2715 && tokstart[0] == 'i'
2716 && tokstart[1] == 'f'
2717 && ! scanning_macro_expansion ())
2722 /* For the same reason (breakpoint conditions), "thread N"
2723 terminates the expression. "thread" could be an identifier, but
2724 an identifier is never followed by a number without intervening
2725 punctuation. "task" is similar. Handle abbreviations of these,
2726 similarly to breakpoint.c:find_condition_and_thread. */
2728 && (strncmp (tokstart, "thread", namelen) == 0
2729 || strncmp (tokstart, "task", namelen) == 0)
2730 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2731 && ! scanning_macro_expansion ())
2733 const char *p = tokstart + namelen + 1;
2735 while (*p == ' ' || *p == '\t')
2737 if (*p >= '0' && *p <= '9')
2745 yylval.sval.ptr = tokstart;
2746 yylval.sval.length = namelen;
2748 /* Catch specific keywords. */
2749 copy = copy_name (yylval.sval);
2750 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2751 if (strcmp (copy, ident_tokens[i].oper) == 0)
2753 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2754 && parse_language (par_state)->la_language != language_cplus)
2757 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2759 struct field_of_this_result is_a_field_of_this;
2761 if (lookup_symbol (copy, expression_context_block,
2763 (parse_language (par_state)->la_language
2764 == language_cplus ? &is_a_field_of_this
2768 /* The keyword is shadowed. */
2773 /* It is ok to always set this, even though we don't always
2774 strictly need to. */
2775 yylval.opcode = ident_tokens[i].opcode;
2776 return ident_tokens[i].token;
2779 if (*tokstart == '$')
2782 if (parse_completion && *lexptr == '\0')
2783 saw_name_at_eof = 1;
2785 yylval.ssym.stoken = yylval.sval;
2786 yylval.ssym.sym.symbol = NULL;
2787 yylval.ssym.sym.block = NULL;
2788 yylval.ssym.is_a_field_of_this = 0;
2792 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2799 DEF_VEC_O (token_and_value);
2801 /* A FIFO of tokens that have been read but not yet returned to the
2803 static VEC (token_and_value) *token_fifo;
2805 /* Non-zero if the lexer should return tokens from the FIFO. */
2808 /* Temporary storage for c_lex; this holds symbol names as they are
2810 static struct obstack name_obstack;
2812 /* Classify a NAME token. The contents of the token are in `yylval'.
2813 Updates yylval and returns the new token type. BLOCK is the block
2814 in which lookups start; this can be NULL to mean the global scope.
2815 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2816 in single quotes. */
2819 classify_name (struct parser_state *par_state, const struct block *block,
2822 struct block_symbol bsym;
2824 struct field_of_this_result is_a_field_of_this;
2826 copy = copy_name (yylval.sval);
2828 /* Initialize this in case we *don't* use it in this call; that way
2829 we can refer to it unconditionally below. */
2830 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2832 bsym = lookup_symbol (copy, block, VAR_DOMAIN,
2833 parse_language (par_state)->la_name_of_this
2834 ? &is_a_field_of_this : NULL);
2836 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2838 yylval.ssym.sym = bsym;
2839 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2842 else if (!bsym.symbol)
2844 /* If we found a field of 'this', we might have erroneously
2845 found a constructor where we wanted a type name. Handle this
2846 case by noticing that we found a constructor and then look up
2847 the type tag instead. */
2848 if (is_a_field_of_this.type != NULL
2849 && is_a_field_of_this.fn_field != NULL
2850 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2853 struct field_of_this_result inner_is_a_field_of_this;
2855 bsym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2856 &inner_is_a_field_of_this);
2857 if (bsym.symbol != NULL)
2859 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2864 /* If we found a field, then we want to prefer it over a
2865 filename. However, if the name was quoted, then it is better
2866 to check for a filename or a block, since this is the only
2867 way the user has of requiring the extension to be used. */
2868 if (is_a_field_of_this.type == NULL || is_quoted_name)
2870 /* See if it's a file name. */
2871 struct symtab *symtab;
2873 symtab = lookup_symtab (copy);
2876 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
2883 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
2885 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2889 /* See if it's an ObjC classname. */
2890 if (parse_language (par_state)->la_language == language_objc && !bsym.symbol)
2892 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2897 yylval.theclass.theclass = Class;
2898 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2900 yylval.theclass.type = SYMBOL_TYPE (sym);
2905 /* Input names that aren't symbols but ARE valid hex numbers, when
2906 the input radix permits them, can be names or numbers depending
2907 on the parse. Note we support radixes > 16 here. */
2909 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2910 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2912 YYSTYPE newlval; /* Its value is ignored. */
2913 int hextype = parse_number (par_state, copy, yylval.sval.length,
2918 yylval.ssym.sym = bsym;
2919 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2924 /* Any other kind of symbol */
2925 yylval.ssym.sym = bsym;
2926 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2928 if (bsym.symbol == NULL
2929 && parse_language (par_state)->la_language == language_cplus
2930 && is_a_field_of_this.type == NULL
2931 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
2932 return UNKNOWN_CPP_NAME;
2937 /* Like classify_name, but used by the inner loop of the lexer, when a
2938 name might have already been seen. CONTEXT is the context type, or
2939 NULL if this is the first component of a name. */
2942 classify_inner_name (struct parser_state *par_state,
2943 const struct block *block, struct type *context)
2948 if (context == NULL)
2949 return classify_name (par_state, block, 0);
2951 type = check_typedef (context);
2952 if (!type_aggregate_p (type))
2955 copy = copy_name (yylval.ssym.stoken);
2956 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
2957 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN);
2959 /* If no symbol was found, search for a matching base class named
2960 COPY. This will allow users to enter qualified names of class members
2961 relative to the `this' pointer. */
2962 if (yylval.ssym.sym.symbol == NULL)
2964 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
2966 if (base_type != NULL)
2968 yylval.tsym.type = base_type;
2975 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
2979 /* cp_lookup_nested_symbol might have accidentally found a constructor
2980 named COPY when we really wanted a base class of the same name.
2981 Double-check this case by looking for a base class. */
2983 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
2985 if (base_type != NULL)
2987 yylval.tsym.type = base_type;
2994 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3000 internal_error (__FILE__, __LINE__, _("not reached"));
3003 /* The outer level of a two-level lexer. This calls the inner lexer
3004 to return tokens. It then either returns these tokens, or
3005 aggregates them into a larger token. This lets us work around a
3006 problem in our parsing approach, where the parser could not
3007 distinguish between qualified names and qualified types at the
3010 This approach is still not ideal, because it mishandles template
3011 types. See the comment in lex_one_token for an example. However,
3012 this is still an improvement over the earlier approach, and will
3013 suffice until we move to better parsing technology. */
3018 token_and_value current;
3019 int first_was_coloncolon, last_was_coloncolon;
3020 struct type *context_type = NULL;
3021 int last_to_examine, next_to_examine, checkpoint;
3022 const struct block *search_block;
3025 if (popping && !VEC_empty (token_and_value, token_fifo))
3029 /* Read the first token and decide what to do. Most of the
3030 subsequent code is C++-only; but also depends on seeing a "::" or
3032 current.token = lex_one_token (pstate, &is_quoted_name);
3033 if (current.token == NAME)
3034 current.token = classify_name (pstate, expression_context_block,
3036 if (parse_language (pstate)->la_language != language_cplus
3037 || (current.token != TYPENAME && current.token != COLONCOLON
3038 && current.token != FILENAME))
3039 return current.token;
3041 /* Read any sequence of alternating "::" and name-like tokens into
3043 current.value = yylval;
3044 VEC_safe_push (token_and_value, token_fifo, ¤t);
3045 last_was_coloncolon = current.token == COLONCOLON;
3050 /* We ignore quoted names other than the very first one.
3051 Subsequent ones do not have any special meaning. */
3052 current.token = lex_one_token (pstate, &ignore);
3053 current.value = yylval;
3054 VEC_safe_push (token_and_value, token_fifo, ¤t);
3056 if ((last_was_coloncolon && current.token != NAME)
3057 || (!last_was_coloncolon && current.token != COLONCOLON))
3059 last_was_coloncolon = !last_was_coloncolon;
3063 /* We always read one extra token, so compute the number of tokens
3064 to examine accordingly. */
3065 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3066 next_to_examine = 0;
3068 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3071 obstack_free (&name_obstack, obstack_base (&name_obstack));
3073 if (current.token == FILENAME)
3074 search_block = current.value.bval;
3075 else if (current.token == COLONCOLON)
3076 search_block = NULL;
3079 gdb_assert (current.token == TYPENAME);
3080 search_block = expression_context_block;
3081 obstack_grow (&name_obstack, current.value.sval.ptr,
3082 current.value.sval.length);
3083 context_type = current.value.tsym.type;
3087 first_was_coloncolon = current.token == COLONCOLON;
3088 last_was_coloncolon = first_was_coloncolon;
3090 while (next_to_examine <= last_to_examine)
3092 token_and_value *next;
3094 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3097 if (next->token == NAME && last_was_coloncolon)
3101 yylval = next->value;
3102 classification = classify_inner_name (pstate, search_block,
3104 /* We keep going until we either run out of names, or until
3105 we have a qualified name which is not a type. */
3106 if (classification != TYPENAME && classification != NAME)
3109 /* Accept up to this token. */
3110 checkpoint = next_to_examine;
3112 /* Update the partial name we are constructing. */
3113 if (context_type != NULL)
3115 /* We don't want to put a leading "::" into the name. */
3116 obstack_grow_str (&name_obstack, "::");
3118 obstack_grow (&name_obstack, next->value.sval.ptr,
3119 next->value.sval.length);
3121 yylval.sval.ptr = (const char *) obstack_base (&name_obstack);
3122 yylval.sval.length = obstack_object_size (&name_obstack);
3123 current.value = yylval;
3124 current.token = classification;
3126 last_was_coloncolon = 0;
3128 if (classification == NAME)
3131 context_type = yylval.tsym.type;
3133 else if (next->token == COLONCOLON && !last_was_coloncolon)
3134 last_was_coloncolon = 1;
3137 /* We've reached the end of the name. */
3142 /* If we have a replacement token, install it as the first token in
3143 the FIFO, and delete the other constituent tokens. */
3146 current.value.sval.ptr
3147 = (const char *) obstack_copy0 (&expansion_obstack,
3148 current.value.sval.ptr,
3149 current.value.sval.length);
3151 VEC_replace (token_and_value, token_fifo, 0, ¤t);
3153 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3157 current = *VEC_index (token_and_value, token_fifo, 0);
3158 VEC_ordered_remove (token_and_value, token_fifo, 0);
3159 yylval = current.value;
3160 return current.token;
3164 c_parse (struct parser_state *par_state)
3167 struct cleanup *back_to;
3169 /* Setting up the parser state. */
3170 gdb_assert (par_state != NULL);
3173 back_to = make_cleanup (free_current_contents, &expression_macro_scope);
3174 make_cleanup_clear_parser_state (&pstate);
3176 /* Set up the scope for macro expansion. */
3177 expression_macro_scope = NULL;
3179 if (expression_context_block)
3180 expression_macro_scope
3181 = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3183 expression_macro_scope = default_macro_scope ();
3184 if (! expression_macro_scope)
3185 expression_macro_scope = user_macro_scope ();
3187 /* Initialize macro expansion code. */
3188 obstack_init (&expansion_obstack);
3189 gdb_assert (! macro_original_text);
3190 make_cleanup (scan_macro_cleanup, 0);
3192 make_cleanup_restore_integer (&yydebug);
3193 yydebug = parser_debug;
3195 /* Initialize some state used by the lexer. */
3196 last_was_structop = 0;
3197 saw_name_at_eof = 0;
3199 VEC_free (token_and_value, token_fifo);
3201 obstack_init (&name_obstack);
3202 make_cleanup_obstack_free (&name_obstack);
3204 result = yyparse ();
3205 do_cleanups (back_to);
3212 /* This is called via the YYPRINT macro when parser debugging is
3213 enabled. It prints a token's value. */
3216 c_print_token (FILE *file, int type, YYSTYPE value)
3221 fprintf (file, "typed_val_int<%s, %s>",
3222 TYPE_SAFE_NAME (value.typed_val_int.type),
3223 pulongest (value.typed_val_int.val));
3229 char *copy = (char *) alloca (value.tsval.length + 1);
3231 memcpy (copy, value.tsval.ptr, value.tsval.length);
3232 copy[value.tsval.length] = '\0';
3234 fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3240 fprintf (file, "sval<%s>", copy_name (value.sval));
3244 fprintf (file, "tsym<type=%s, name=%s>",
3245 TYPE_SAFE_NAME (value.tsym.type),
3246 copy_name (value.tsym.stoken));
3250 case UNKNOWN_CPP_NAME:
3253 fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3254 copy_name (value.ssym.stoken),
3255 (value.ssym.sym.symbol == NULL
3256 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym.symbol)),
3257 value.ssym.is_a_field_of_this);
3261 fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3272 lexptr = prev_lexptr;
3274 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);