1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986-2015 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, etc),
60 as well as gratuitiously global symbol names, so we can have multiple
61 yacc generated parsers in gdb. Note that these are only the variables
62 produced by yacc. If other parser generators (bison, byacc, etc) produce
63 additional global names that conflict at link time, then those parser
64 generators need to be fixed instead of adding those names to this list. */
66 #define yymaxdepth c_maxdepth
67 #define yyparse c_parse_internal
69 #define yyerror c_error
72 #define yydebug c_debug
81 #define yyerrflag c_errflag
82 #define yynerrs c_nerrs
87 #define yystate c_state
93 #define yyreds c_reds /* With YYDEBUG defined */
94 #define yytoks c_toks /* With YYDEBUG defined */
95 #define yyname c_name /* With YYDEBUG defined */
96 #define yyrule c_rule /* With YYDEBUG defined */
99 #define yydefred c_yydefred
100 #define yydgoto c_yydgoto
101 #define yysindex c_yysindex
102 #define yyrindex c_yyrindex
103 #define yygindex c_yygindex
104 #define yytable c_yytable
105 #define yycheck c_yycheck
107 #define yysslim c_yysslim
108 #define yyssp c_yyssp
109 #define yystacksize c_yystacksize
111 #define yyvsp c_yyvsp
114 #define YYDEBUG 1 /* Default to yydebug support */
117 #define YYFPRINTF parser_fprintf
119 /* The state of the parser, used internally when we are parsing the
122 static struct parser_state *pstate = NULL;
126 static int yylex (void);
128 void yyerror (char *);
130 static int type_aggregate_p (struct type *);
134 /* Although the yacc "value" of an expression is not used,
135 since the result is stored in the structure being created,
136 other node types do have values. */
152 } typed_val_decfloat;
155 struct typed_stoken tsval;
157 struct symtoken ssym;
159 const struct block *bval;
160 enum exp_opcode opcode;
162 struct stoken_vector svec;
163 VEC (type_ptr) *tvec;
165 struct type_stack *type_stack;
167 struct objc_class_str theclass;
171 /* YYSTYPE gets defined by %union */
172 static int parse_number (struct parser_state *par_state,
173 const char *, int, int, YYSTYPE *);
174 static struct stoken operator_stoken (const char *);
175 static void check_parameter_typelist (VEC (type_ptr) *);
176 static void write_destructor_name (struct parser_state *par_state,
180 static void c_print_token (FILE *file, int type, YYSTYPE value);
181 #define YYPRINT(FILE, TYPE, VALUE) c_print_token (FILE, TYPE, VALUE)
185 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly
187 %type <tval> type typebase
188 %type <tvec> nonempty_typelist func_mod parameter_typelist
189 /* %type <bval> block */
191 /* Fancy type parsing. */
193 %type <lval> array_mod
194 %type <tval> conversion_type_id
196 %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl
198 %token <typed_val_int> INT
199 %token <typed_val_float> FLOAT
200 %token <typed_val_decfloat> DECFLOAT
202 /* Both NAME and TYPENAME tokens represent symbols in the input,
203 and both convey their data as strings.
204 But a TYPENAME is a string that happens to be defined as a typedef
205 or builtin type name (such as int or char)
206 and a NAME is any other symbol.
207 Contexts where this distinction is not important can use the
208 nonterminal "name", which matches either NAME or TYPENAME. */
210 %token <tsval> STRING
211 %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */
212 %token SELECTOR /* ObjC "@selector" pseudo-operator */
214 %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */
215 %token <ssym> UNKNOWN_CPP_NAME
216 %token <voidval> COMPLETE
217 %token <tsym> TYPENAME
218 %token <theclass> CLASSNAME /* ObjC Class name */
220 %type <svec> string_exp
221 %type <ssym> name_not_typename
222 %type <tsym> type_name
224 /* This is like a '[' token, but is only generated when parsing
225 Objective C. This lets us reuse the same parser without
226 erroneously parsing ObjC-specific expressions in C. */
229 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
230 but which would parse as a valid number in the current input radix.
231 E.g. "c" when input_radix==16. Depending on the parse, it will be
232 turned into a name or into a number. */
234 %token <ssym> NAME_OR_INT
237 %token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON
242 %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
248 /* Special type cases, put in to allow the parser to distinguish different
250 %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
252 %token <sval> VARIABLE
254 %token <opcode> ASSIGN_MODIFY
263 %right '=' ASSIGN_MODIFY
271 %left '<' '>' LEQ GEQ
276 %right UNARY INCREMENT DECREMENT
277 %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '('
278 %token <ssym> BLOCKNAME
279 %token <bval> FILENAME
293 { write_exp_elt_opcode(pstate, OP_TYPE);
294 write_exp_elt_type(pstate, $1);
295 write_exp_elt_opcode(pstate, OP_TYPE);}
298 write_exp_elt_opcode (pstate, OP_TYPEOF);
300 | TYPEOF '(' type ')'
302 write_exp_elt_opcode (pstate, OP_TYPE);
303 write_exp_elt_type (pstate, $3);
304 write_exp_elt_opcode (pstate, OP_TYPE);
306 | DECLTYPE '(' exp ')'
308 write_exp_elt_opcode (pstate, OP_DECLTYPE);
312 /* Expressions, including the comma operator. */
315 { write_exp_elt_opcode (pstate, BINOP_COMMA); }
318 /* Expressions, not including the comma operator. */
319 exp : '*' exp %prec UNARY
320 { write_exp_elt_opcode (pstate, UNOP_IND); }
323 exp : '&' exp %prec UNARY
324 { write_exp_elt_opcode (pstate, UNOP_ADDR); }
327 exp : '-' exp %prec UNARY
328 { write_exp_elt_opcode (pstate, UNOP_NEG); }
331 exp : '+' exp %prec UNARY
332 { write_exp_elt_opcode (pstate, UNOP_PLUS); }
335 exp : '!' exp %prec UNARY
336 { write_exp_elt_opcode (pstate, UNOP_LOGICAL_NOT); }
339 exp : '~' exp %prec UNARY
340 { write_exp_elt_opcode (pstate, UNOP_COMPLEMENT); }
343 exp : INCREMENT exp %prec UNARY
344 { write_exp_elt_opcode (pstate, UNOP_PREINCREMENT); }
347 exp : DECREMENT exp %prec UNARY
348 { write_exp_elt_opcode (pstate, UNOP_PREDECREMENT); }
351 exp : exp INCREMENT %prec UNARY
352 { write_exp_elt_opcode (pstate, UNOP_POSTINCREMENT); }
355 exp : exp DECREMENT %prec UNARY
356 { write_exp_elt_opcode (pstate, UNOP_POSTDECREMENT); }
359 exp : TYPEID '(' exp ')' %prec UNARY
360 { write_exp_elt_opcode (pstate, OP_TYPEID); }
363 exp : TYPEID '(' type_exp ')' %prec UNARY
364 { write_exp_elt_opcode (pstate, OP_TYPEID); }
367 exp : SIZEOF exp %prec UNARY
368 { write_exp_elt_opcode (pstate, UNOP_SIZEOF); }
372 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
373 write_exp_string (pstate, $3);
374 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
377 exp : exp ARROW name COMPLETE
378 { mark_struct_expression (pstate);
379 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
380 write_exp_string (pstate, $3);
381 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
384 exp : exp ARROW COMPLETE
386 mark_struct_expression (pstate);
387 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
390 write_exp_string (pstate, s);
391 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
394 exp : exp ARROW '~' name
395 { write_exp_elt_opcode (pstate, STRUCTOP_PTR);
396 write_destructor_name (pstate, $4);
397 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
400 exp : exp ARROW '~' name COMPLETE
401 { mark_struct_expression (pstate);
402 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
403 write_destructor_name (pstate, $4);
404 write_exp_elt_opcode (pstate, STRUCTOP_PTR); }
407 exp : exp ARROW qualified_name
408 { /* exp->type::name becomes exp->*(&type::name) */
409 /* Note: this doesn't work if name is a
410 static member! FIXME */
411 write_exp_elt_opcode (pstate, UNOP_ADDR);
412 write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
415 exp : exp ARROW_STAR exp
416 { write_exp_elt_opcode (pstate, STRUCTOP_MPTR); }
420 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
421 write_exp_string (pstate, $3);
422 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
425 exp : exp '.' name COMPLETE
426 { mark_struct_expression (pstate);
427 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
428 write_exp_string (pstate, $3);
429 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
432 exp : exp '.' COMPLETE
434 mark_struct_expression (pstate);
435 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
438 write_exp_string (pstate, s);
439 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
442 exp : exp '.' '~' name
443 { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
444 write_destructor_name (pstate, $4);
445 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
448 exp : exp '.' '~' name COMPLETE
449 { mark_struct_expression (pstate);
450 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT);
451 write_destructor_name (pstate, $4);
452 write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); }
455 exp : exp '.' qualified_name
456 { /* exp.type::name becomes exp.*(&type::name) */
457 /* Note: this doesn't work if name is a
458 static member! FIXME */
459 write_exp_elt_opcode (pstate, UNOP_ADDR);
460 write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
463 exp : exp DOT_STAR exp
464 { write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); }
467 exp : exp '[' exp1 ']'
468 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
471 exp : exp OBJC_LBRAC exp1 ']'
472 { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); }
476 * The rules below parse ObjC message calls of the form:
477 * '[' target selector {':' argument}* ']'
480 exp : OBJC_LBRAC TYPENAME
484 theclass = lookup_objc_class (parse_gdbarch (pstate),
485 copy_name ($2.stoken));
487 error (_("%s is not an ObjC Class"),
488 copy_name ($2.stoken));
489 write_exp_elt_opcode (pstate, OP_LONG);
490 write_exp_elt_type (pstate,
491 parse_type (pstate)->builtin_int);
492 write_exp_elt_longcst (pstate, (LONGEST) theclass);
493 write_exp_elt_opcode (pstate, OP_LONG);
497 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
498 end_msglist (pstate);
499 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
503 exp : OBJC_LBRAC CLASSNAME
505 write_exp_elt_opcode (pstate, OP_LONG);
506 write_exp_elt_type (pstate,
507 parse_type (pstate)->builtin_int);
508 write_exp_elt_longcst (pstate, (LONGEST) $2.theclass);
509 write_exp_elt_opcode (pstate, OP_LONG);
513 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
514 end_msglist (pstate);
515 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
522 { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
523 end_msglist (pstate);
524 write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL);
529 { add_msglist(&$1, 0); }
537 msgarg : name ':' exp
538 { add_msglist(&$1, 1); }
539 | ':' exp /* Unnamed arg. */
540 { add_msglist(0, 1); }
541 | ',' exp /* Variable number of args. */
542 { add_msglist(0, 0); }
546 /* This is to save the value of arglist_len
547 being accumulated by an outer function call. */
548 { start_arglist (); }
549 arglist ')' %prec ARROW
550 { write_exp_elt_opcode (pstate, OP_FUNCALL);
551 write_exp_elt_longcst (pstate,
552 (LONGEST) end_arglist ());
553 write_exp_elt_opcode (pstate, OP_FUNCALL); }
556 exp : UNKNOWN_CPP_NAME '('
558 /* This could potentially be a an argument defined
559 lookup function (Koenig). */
560 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
561 write_exp_elt_block (pstate,
562 expression_context_block);
563 write_exp_elt_sym (pstate,
564 NULL); /* Placeholder. */
565 write_exp_string (pstate, $1.stoken);
566 write_exp_elt_opcode (pstate, OP_ADL_FUNC);
568 /* This is to save the value of arglist_len
569 being accumulated by an outer function call. */
573 arglist ')' %prec ARROW
575 write_exp_elt_opcode (pstate, OP_FUNCALL);
576 write_exp_elt_longcst (pstate,
577 (LONGEST) end_arglist ());
578 write_exp_elt_opcode (pstate, OP_FUNCALL);
583 { start_arglist (); }
593 arglist : arglist ',' exp %prec ABOVE_COMMA
597 exp : exp '(' parameter_typelist ')' const_or_volatile
599 VEC (type_ptr) *type_list = $3;
600 struct type *type_elt;
601 LONGEST len = VEC_length (type_ptr, type_list);
603 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
604 write_exp_elt_longcst (pstate, len);
606 VEC_iterate (type_ptr, type_list, i, type_elt);
608 write_exp_elt_type (pstate, type_elt);
609 write_exp_elt_longcst(pstate, len);
610 write_exp_elt_opcode (pstate, TYPE_INSTANCE);
611 VEC_free (type_ptr, type_list);
616 { $$ = end_arglist () - 1; }
618 exp : lcurly arglist rcurly %prec ARROW
619 { write_exp_elt_opcode (pstate, OP_ARRAY);
620 write_exp_elt_longcst (pstate, (LONGEST) 0);
621 write_exp_elt_longcst (pstate, (LONGEST) $3);
622 write_exp_elt_opcode (pstate, OP_ARRAY); }
625 exp : lcurly type_exp rcurly exp %prec UNARY
626 { write_exp_elt_opcode (pstate, UNOP_MEMVAL_TYPE); }
629 exp : '(' type_exp ')' exp %prec UNARY
630 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
637 /* Binary operators in order of decreasing precedence. */
640 { write_exp_elt_opcode (pstate, BINOP_REPEAT); }
644 { write_exp_elt_opcode (pstate, BINOP_MUL); }
648 { write_exp_elt_opcode (pstate, BINOP_DIV); }
652 { write_exp_elt_opcode (pstate, BINOP_REM); }
656 { write_exp_elt_opcode (pstate, BINOP_ADD); }
660 { write_exp_elt_opcode (pstate, BINOP_SUB); }
664 { write_exp_elt_opcode (pstate, BINOP_LSH); }
668 { write_exp_elt_opcode (pstate, BINOP_RSH); }
672 { write_exp_elt_opcode (pstate, BINOP_EQUAL); }
675 exp : exp NOTEQUAL exp
676 { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); }
680 { write_exp_elt_opcode (pstate, BINOP_LEQ); }
684 { write_exp_elt_opcode (pstate, BINOP_GEQ); }
688 { write_exp_elt_opcode (pstate, BINOP_LESS); }
692 { write_exp_elt_opcode (pstate, BINOP_GTR); }
696 { write_exp_elt_opcode (pstate, BINOP_BITWISE_AND); }
700 { write_exp_elt_opcode (pstate, BINOP_BITWISE_XOR); }
704 { write_exp_elt_opcode (pstate, BINOP_BITWISE_IOR); }
708 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); }
712 { write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); }
715 exp : exp '?' exp ':' exp %prec '?'
716 { write_exp_elt_opcode (pstate, TERNOP_COND); }
720 { write_exp_elt_opcode (pstate, BINOP_ASSIGN); }
723 exp : exp ASSIGN_MODIFY exp
724 { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY);
725 write_exp_elt_opcode (pstate, $2);
726 write_exp_elt_opcode (pstate,
727 BINOP_ASSIGN_MODIFY); }
731 { write_exp_elt_opcode (pstate, OP_LONG);
732 write_exp_elt_type (pstate, $1.type);
733 write_exp_elt_longcst (pstate, (LONGEST) ($1.val));
734 write_exp_elt_opcode (pstate, OP_LONG); }
739 struct stoken_vector vec;
742 write_exp_string_vector (pstate, $1.type, &vec);
748 parse_number (pstate, $1.stoken.ptr,
749 $1.stoken.length, 0, &val);
750 write_exp_elt_opcode (pstate, OP_LONG);
751 write_exp_elt_type (pstate, val.typed_val_int.type);
752 write_exp_elt_longcst (pstate,
753 (LONGEST) val.typed_val_int.val);
754 write_exp_elt_opcode (pstate, OP_LONG);
760 { write_exp_elt_opcode (pstate, OP_DOUBLE);
761 write_exp_elt_type (pstate, $1.type);
762 write_exp_elt_dblcst (pstate, $1.dval);
763 write_exp_elt_opcode (pstate, OP_DOUBLE); }
767 { write_exp_elt_opcode (pstate, OP_DECFLOAT);
768 write_exp_elt_type (pstate, $1.type);
769 write_exp_elt_decfloatcst (pstate, $1.val);
770 write_exp_elt_opcode (pstate, OP_DECFLOAT); }
778 write_dollar_variable (pstate, $1);
782 exp : SELECTOR '(' name ')'
784 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR);
785 write_exp_string (pstate, $3);
786 write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); }
789 exp : SIZEOF '(' type ')' %prec UNARY
790 { struct type *type = $3;
791 write_exp_elt_opcode (pstate, OP_LONG);
792 write_exp_elt_type (pstate, lookup_signed_typename
793 (parse_language (pstate),
794 parse_gdbarch (pstate),
796 type = check_typedef (type);
798 /* $5.3.3/2 of the C++ Standard (n3290 draft)
799 says of sizeof: "When applied to a reference
800 or a reference type, the result is the size of
801 the referenced type." */
802 if (TYPE_CODE (type) == TYPE_CODE_REF)
803 type = check_typedef (TYPE_TARGET_TYPE (type));
804 write_exp_elt_longcst (pstate,
805 (LONGEST) TYPE_LENGTH (type));
806 write_exp_elt_opcode (pstate, OP_LONG); }
809 exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
810 { write_exp_elt_opcode (pstate,
811 UNOP_REINTERPRET_CAST); }
814 exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
815 { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
818 exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
819 { write_exp_elt_opcode (pstate, UNOP_DYNAMIC_CAST); }
822 exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
823 { /* We could do more error checking here, but
824 it doesn't seem worthwhile. */
825 write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); }
831 /* We copy the string here, and not in the
832 lexer, to guarantee that we do not leak a
833 string. Note that we follow the
834 NUL-termination convention of the
836 struct typed_stoken *vec = XNEW (struct typed_stoken);
841 vec->length = $1.length;
842 vec->ptr = malloc ($1.length + 1);
843 memcpy (vec->ptr, $1.ptr, $1.length + 1);
848 /* Note that we NUL-terminate here, but just
852 $$.tokens = realloc ($$.tokens,
853 $$.len * sizeof (struct typed_stoken));
855 p = malloc ($2.length + 1);
856 memcpy (p, $2.ptr, $2.length + 1);
858 $$.tokens[$$.len - 1].type = $2.type;
859 $$.tokens[$$.len - 1].length = $2.length;
860 $$.tokens[$$.len - 1].ptr = p;
867 enum c_string_type type = C_STRING;
869 for (i = 0; i < $1.len; ++i)
871 switch ($1.tokens[i].type)
879 && type != $1.tokens[i].type)
880 error (_("Undefined string concatenation."));
881 type = (enum c_string_type) $1.tokens[i].type;
885 internal_error (__FILE__, __LINE__,
886 "unrecognized type in string concatenation");
890 write_exp_string_vector (pstate, type, &$1);
891 for (i = 0; i < $1.len; ++i)
892 free ($1.tokens[i].ptr);
897 exp : NSSTRING /* ObjC NextStep NSString constant
898 * of the form '@' '"' string '"'.
900 { write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING);
901 write_exp_string (pstate, $1);
902 write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); }
907 { write_exp_elt_opcode (pstate, OP_LONG);
908 write_exp_elt_type (pstate,
909 parse_type (pstate)->builtin_bool);
910 write_exp_elt_longcst (pstate, (LONGEST) 1);
911 write_exp_elt_opcode (pstate, OP_LONG); }
915 { write_exp_elt_opcode (pstate, OP_LONG);
916 write_exp_elt_type (pstate,
917 parse_type (pstate)->builtin_bool);
918 write_exp_elt_longcst (pstate, (LONGEST) 0);
919 write_exp_elt_opcode (pstate, OP_LONG); }
927 $$ = SYMBOL_BLOCK_VALUE ($1.sym.symbol);
929 error (_("No file or function \"%s\"."),
930 copy_name ($1.stoken));
938 block : block COLONCOLON name
940 = lookup_symbol (copy_name ($3), $1,
941 VAR_DOMAIN, NULL).symbol;
943 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
944 error (_("No function \"%s\" in specified context."),
946 $$ = SYMBOL_BLOCK_VALUE (tem); }
949 variable: name_not_typename ENTRY
950 { struct symbol *sym = $1.sym.symbol;
952 if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym)
953 || !symbol_read_needs_frame (sym))
954 error (_("@entry can be used only for function "
955 "parameters, not for \"%s\""),
956 copy_name ($1.stoken));
958 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
959 write_exp_elt_sym (pstate, sym);
960 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
964 variable: block COLONCOLON name
965 { struct block_symbol sym
966 = lookup_symbol (copy_name ($3), $1,
970 error (_("No symbol \"%s\" in specified context."),
972 if (symbol_read_needs_frame (sym.symbol))
974 if (innermost_block == 0
975 || contained_in (sym.block,
977 innermost_block = sym.block;
980 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
981 write_exp_elt_block (pstate, sym.block);
982 write_exp_elt_sym (pstate, sym.symbol);
983 write_exp_elt_opcode (pstate, OP_VAR_VALUE); }
986 qualified_name: TYPENAME COLONCOLON name
988 struct type *type = $1.type;
989 type = check_typedef (type);
990 if (!type_aggregate_p (type))
991 error (_("`%s' is not defined as an aggregate type."),
992 TYPE_SAFE_NAME (type));
994 write_exp_elt_opcode (pstate, OP_SCOPE);
995 write_exp_elt_type (pstate, type);
996 write_exp_string (pstate, $3);
997 write_exp_elt_opcode (pstate, OP_SCOPE);
999 | TYPENAME COLONCOLON '~' name
1001 struct type *type = $1.type;
1002 struct stoken tmp_token;
1005 type = check_typedef (type);
1006 if (!type_aggregate_p (type))
1007 error (_("`%s' is not defined as an aggregate type."),
1008 TYPE_SAFE_NAME (type));
1009 buf = alloca ($4.length + 2);
1010 tmp_token.ptr = buf;
1011 tmp_token.length = $4.length + 1;
1013 memcpy (buf+1, $4.ptr, $4.length);
1014 buf[tmp_token.length] = 0;
1016 /* Check for valid destructor name. */
1017 destructor_name_p (tmp_token.ptr, $1.type);
1018 write_exp_elt_opcode (pstate, OP_SCOPE);
1019 write_exp_elt_type (pstate, type);
1020 write_exp_string (pstate, tmp_token);
1021 write_exp_elt_opcode (pstate, OP_SCOPE);
1023 | TYPENAME COLONCOLON name COLONCOLON name
1025 char *copy = copy_name ($3);
1026 error (_("No type \"%s\" within class "
1027 "or namespace \"%s\"."),
1028 copy, TYPE_SAFE_NAME ($1.type));
1032 variable: qualified_name
1033 | COLONCOLON name_not_typename
1035 char *name = copy_name ($2.stoken);
1037 struct bound_minimal_symbol msymbol;
1040 = lookup_symbol (name, (const struct block *) NULL,
1041 VAR_DOMAIN, NULL).symbol;
1044 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1045 write_exp_elt_block (pstate, NULL);
1046 write_exp_elt_sym (pstate, sym);
1047 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1051 msymbol = lookup_bound_minimal_symbol (name);
1052 if (msymbol.minsym != NULL)
1053 write_exp_msymbol (pstate, msymbol);
1054 else if (!have_full_symbols () && !have_partial_symbols ())
1055 error (_("No symbol table is loaded. Use the \"file\" command."));
1057 error (_("No symbol \"%s\" in current context."), name);
1061 variable: name_not_typename
1062 { struct block_symbol sym = $1.sym;
1066 if (symbol_read_needs_frame (sym.symbol))
1068 if (innermost_block == 0
1069 || contained_in (sym.block,
1071 innermost_block = sym.block;
1074 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1075 /* We want to use the selected frame, not
1076 another more inner frame which happens to
1077 be in the same block. */
1078 write_exp_elt_block (pstate, NULL);
1079 write_exp_elt_sym (pstate, sym.symbol);
1080 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1082 else if ($1.is_a_field_of_this)
1084 /* C++: it hangs off of `this'. Must
1085 not inadvertently convert from a method call
1087 if (innermost_block == 0
1088 || contained_in (sym.block,
1090 innermost_block = sym.block;
1091 write_exp_elt_opcode (pstate, OP_THIS);
1092 write_exp_elt_opcode (pstate, OP_THIS);
1093 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1094 write_exp_string (pstate, $1.stoken);
1095 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1099 struct bound_minimal_symbol msymbol;
1100 char *arg = copy_name ($1.stoken);
1103 lookup_bound_minimal_symbol (arg);
1104 if (msymbol.minsym != NULL)
1105 write_exp_msymbol (pstate, msymbol);
1106 else if (!have_full_symbols () && !have_partial_symbols ())
1107 error (_("No symbol table is loaded. Use the \"file\" command."));
1109 error (_("No symbol \"%s\" in current context."),
1110 copy_name ($1.stoken));
1115 space_identifier : '@' NAME
1116 { insert_type_address_space (pstate, copy_name ($2.stoken)); }
1119 const_or_volatile: const_or_volatile_noopt
1123 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1126 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1127 | const_or_volatile_noopt
1130 const_or_volatile_or_space_identifier:
1131 const_or_volatile_or_space_identifier_noopt
1137 { insert_type (tp_pointer); }
1138 const_or_volatile_or_space_identifier
1140 { insert_type (tp_pointer); }
1141 const_or_volatile_or_space_identifier
1143 { insert_type (tp_reference); }
1145 { insert_type (tp_reference); }
1148 ptr_operator_ts: ptr_operator
1150 $$ = get_type_stack ();
1151 /* This cleanup is eventually run by
1153 make_cleanup (type_stack_cleanup, $$);
1157 abs_decl: ptr_operator_ts direct_abs_decl
1158 { $$ = append_type_stack ($2, $1); }
1163 direct_abs_decl: '(' abs_decl ')'
1165 | direct_abs_decl array_mod
1167 push_type_stack ($1);
1169 push_type (tp_array);
1170 $$ = get_type_stack ();
1175 push_type (tp_array);
1176 $$ = get_type_stack ();
1179 | direct_abs_decl func_mod
1181 push_type_stack ($1);
1183 $$ = get_type_stack ();
1188 $$ = get_type_stack ();
1198 | OBJC_LBRAC INT ']'
1204 | '(' parameter_typelist ')'
1208 /* We used to try to recognize pointer to member types here, but
1209 that didn't work (shift/reduce conflicts meant that these rules never
1210 got executed). The problem is that
1211 int (foo::bar::baz::bizzle)
1212 is a function type but
1213 int (foo::bar::baz::bizzle::*)
1214 is a pointer to member type. Stroustrup loses again! */
1219 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1223 { $$ = lookup_signed_typename (parse_language (pstate),
1224 parse_gdbarch (pstate),
1227 { $$ = lookup_signed_typename (parse_language (pstate),
1228 parse_gdbarch (pstate),
1231 { $$ = lookup_signed_typename (parse_language (pstate),
1232 parse_gdbarch (pstate),
1235 { $$ = lookup_signed_typename (parse_language (pstate),
1236 parse_gdbarch (pstate),
1238 | LONG SIGNED_KEYWORD INT_KEYWORD
1239 { $$ = lookup_signed_typename (parse_language (pstate),
1240 parse_gdbarch (pstate),
1242 | LONG SIGNED_KEYWORD
1243 { $$ = lookup_signed_typename (parse_language (pstate),
1244 parse_gdbarch (pstate),
1246 | SIGNED_KEYWORD LONG INT_KEYWORD
1247 { $$ = lookup_signed_typename (parse_language (pstate),
1248 parse_gdbarch (pstate),
1250 | UNSIGNED LONG INT_KEYWORD
1251 { $$ = lookup_unsigned_typename (parse_language (pstate),
1252 parse_gdbarch (pstate),
1254 | LONG UNSIGNED INT_KEYWORD
1255 { $$ = lookup_unsigned_typename (parse_language (pstate),
1256 parse_gdbarch (pstate),
1259 { $$ = lookup_unsigned_typename (parse_language (pstate),
1260 parse_gdbarch (pstate),
1263 { $$ = lookup_signed_typename (parse_language (pstate),
1264 parse_gdbarch (pstate),
1266 | LONG LONG INT_KEYWORD
1267 { $$ = lookup_signed_typename (parse_language (pstate),
1268 parse_gdbarch (pstate),
1270 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1271 { $$ = lookup_signed_typename (parse_language (pstate),
1272 parse_gdbarch (pstate),
1274 | LONG LONG SIGNED_KEYWORD
1275 { $$ = lookup_signed_typename (parse_language (pstate),
1276 parse_gdbarch (pstate),
1278 | SIGNED_KEYWORD LONG LONG
1279 { $$ = lookup_signed_typename (parse_language (pstate),
1280 parse_gdbarch (pstate),
1282 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1283 { $$ = lookup_signed_typename (parse_language (pstate),
1284 parse_gdbarch (pstate),
1286 | UNSIGNED LONG LONG
1287 { $$ = lookup_unsigned_typename (parse_language (pstate),
1288 parse_gdbarch (pstate),
1290 | UNSIGNED LONG LONG INT_KEYWORD
1291 { $$ = lookup_unsigned_typename (parse_language (pstate),
1292 parse_gdbarch (pstate),
1294 | LONG LONG UNSIGNED
1295 { $$ = lookup_unsigned_typename (parse_language (pstate),
1296 parse_gdbarch (pstate),
1298 | LONG LONG UNSIGNED INT_KEYWORD
1299 { $$ = lookup_unsigned_typename (parse_language (pstate),
1300 parse_gdbarch (pstate),
1303 { $$ = lookup_signed_typename (parse_language (pstate),
1304 parse_gdbarch (pstate),
1306 | SHORT SIGNED_KEYWORD INT_KEYWORD
1307 { $$ = lookup_signed_typename (parse_language (pstate),
1308 parse_gdbarch (pstate),
1310 | SHORT SIGNED_KEYWORD
1311 { $$ = lookup_signed_typename (parse_language (pstate),
1312 parse_gdbarch (pstate),
1314 | UNSIGNED SHORT INT_KEYWORD
1315 { $$ = lookup_unsigned_typename (parse_language (pstate),
1316 parse_gdbarch (pstate),
1319 { $$ = lookup_unsigned_typename (parse_language (pstate),
1320 parse_gdbarch (pstate),
1322 | SHORT UNSIGNED INT_KEYWORD
1323 { $$ = lookup_unsigned_typename (parse_language (pstate),
1324 parse_gdbarch (pstate),
1327 { $$ = lookup_typename (parse_language (pstate),
1328 parse_gdbarch (pstate),
1330 (struct block *) NULL,
1332 | LONG DOUBLE_KEYWORD
1333 { $$ = lookup_typename (parse_language (pstate),
1334 parse_gdbarch (pstate),
1336 (struct block *) NULL,
1339 { $$ = lookup_struct (copy_name ($2),
1340 expression_context_block); }
1343 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1346 | STRUCT name COMPLETE
1348 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1353 { $$ = lookup_struct (copy_name ($2),
1354 expression_context_block); }
1357 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1360 | CLASS name COMPLETE
1362 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1367 { $$ = lookup_union (copy_name ($2),
1368 expression_context_block); }
1371 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1374 | UNION name COMPLETE
1376 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1381 { $$ = lookup_enum (copy_name ($2),
1382 expression_context_block); }
1385 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1388 | ENUM name COMPLETE
1390 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1394 | UNSIGNED type_name
1395 { $$ = lookup_unsigned_typename (parse_language (pstate),
1396 parse_gdbarch (pstate),
1397 TYPE_NAME($2.type)); }
1399 { $$ = lookup_unsigned_typename (parse_language (pstate),
1400 parse_gdbarch (pstate),
1402 | SIGNED_KEYWORD type_name
1403 { $$ = lookup_signed_typename (parse_language (pstate),
1404 parse_gdbarch (pstate),
1405 TYPE_NAME($2.type)); }
1407 { $$ = lookup_signed_typename (parse_language (pstate),
1408 parse_gdbarch (pstate),
1410 /* It appears that this rule for templates is never
1411 reduced; template recognition happens by lookahead
1412 in the token processing code in yylex. */
1413 | TEMPLATE name '<' type '>'
1414 { $$ = lookup_template_type(copy_name($2), $4,
1415 expression_context_block);
1417 | const_or_volatile_or_space_identifier_noopt typebase
1418 { $$ = follow_types ($2); }
1419 | typebase const_or_volatile_or_space_identifier_noopt
1420 { $$ = follow_types ($1); }
1426 $$.stoken.ptr = "int";
1427 $$.stoken.length = 3;
1428 $$.type = lookup_signed_typename (parse_language (pstate),
1429 parse_gdbarch (pstate),
1434 $$.stoken.ptr = "long";
1435 $$.stoken.length = 4;
1436 $$.type = lookup_signed_typename (parse_language (pstate),
1437 parse_gdbarch (pstate),
1442 $$.stoken.ptr = "short";
1443 $$.stoken.length = 5;
1444 $$.type = lookup_signed_typename (parse_language (pstate),
1445 parse_gdbarch (pstate),
1452 { check_parameter_typelist ($1); }
1453 | nonempty_typelist ',' DOTDOTDOT
1455 VEC_safe_push (type_ptr, $1, NULL);
1456 check_parameter_typelist ($1);
1464 VEC (type_ptr) *typelist = NULL;
1465 VEC_safe_push (type_ptr, typelist, $1);
1468 | nonempty_typelist ',' type
1470 VEC_safe_push (type_ptr, $1, $3);
1478 push_type_stack ($2);
1479 $$ = follow_types ($1);
1483 conversion_type_id: typebase conversion_declarator
1484 { $$ = follow_types ($1); }
1487 conversion_declarator: /* Nothing. */
1488 | ptr_operator conversion_declarator
1491 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1492 | VOLATILE_KEYWORD CONST_KEYWORD
1495 const_or_volatile_noopt: const_and_volatile
1496 { insert_type (tp_const);
1497 insert_type (tp_volatile);
1500 { insert_type (tp_const); }
1502 { insert_type (tp_volatile); }
1506 { $$ = operator_stoken (" new"); }
1508 { $$ = operator_stoken (" delete"); }
1509 | OPERATOR NEW '[' ']'
1510 { $$ = operator_stoken (" new[]"); }
1511 | OPERATOR DELETE '[' ']'
1512 { $$ = operator_stoken (" delete[]"); }
1513 | OPERATOR NEW OBJC_LBRAC ']'
1514 { $$ = operator_stoken (" new[]"); }
1515 | OPERATOR DELETE OBJC_LBRAC ']'
1516 { $$ = operator_stoken (" delete[]"); }
1518 { $$ = operator_stoken ("+"); }
1520 { $$ = operator_stoken ("-"); }
1522 { $$ = operator_stoken ("*"); }
1524 { $$ = operator_stoken ("/"); }
1526 { $$ = operator_stoken ("%"); }
1528 { $$ = operator_stoken ("^"); }
1530 { $$ = operator_stoken ("&"); }
1532 { $$ = operator_stoken ("|"); }
1534 { $$ = operator_stoken ("~"); }
1536 { $$ = operator_stoken ("!"); }
1538 { $$ = operator_stoken ("="); }
1540 { $$ = operator_stoken ("<"); }
1542 { $$ = operator_stoken (">"); }
1543 | OPERATOR ASSIGN_MODIFY
1544 { const char *op = "unknown";
1568 case BINOP_BITWISE_IOR:
1571 case BINOP_BITWISE_AND:
1574 case BINOP_BITWISE_XOR:
1581 $$ = operator_stoken (op);
1584 { $$ = operator_stoken ("<<"); }
1586 { $$ = operator_stoken (">>"); }
1588 { $$ = operator_stoken ("=="); }
1590 { $$ = operator_stoken ("!="); }
1592 { $$ = operator_stoken ("<="); }
1594 { $$ = operator_stoken (">="); }
1596 { $$ = operator_stoken ("&&"); }
1598 { $$ = operator_stoken ("||"); }
1599 | OPERATOR INCREMENT
1600 { $$ = operator_stoken ("++"); }
1601 | OPERATOR DECREMENT
1602 { $$ = operator_stoken ("--"); }
1604 { $$ = operator_stoken (","); }
1605 | OPERATOR ARROW_STAR
1606 { $$ = operator_stoken ("->*"); }
1608 { $$ = operator_stoken ("->"); }
1610 { $$ = operator_stoken ("()"); }
1612 { $$ = operator_stoken ("[]"); }
1613 | OPERATOR OBJC_LBRAC ']'
1614 { $$ = operator_stoken ("[]"); }
1615 | OPERATOR conversion_type_id
1618 struct ui_file *buf = mem_fileopen ();
1620 c_print_type ($2, NULL, buf, -1, 0,
1621 &type_print_raw_options);
1622 name = ui_file_xstrdup (buf, &length);
1623 ui_file_delete (buf);
1624 $$ = operator_stoken (name);
1631 name : NAME { $$ = $1.stoken; }
1632 | BLOCKNAME { $$ = $1.stoken; }
1633 | TYPENAME { $$ = $1.stoken; }
1634 | NAME_OR_INT { $$ = $1.stoken; }
1635 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1639 name_not_typename : NAME
1641 /* These would be useful if name_not_typename was useful, but it is just
1642 a fake for "variable", so these cause reduce/reduce conflicts because
1643 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1644 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1645 context where only a name could occur, this might be useful.
1650 struct field_of_this_result is_a_field_of_this;
1653 $$.sym = lookup_symbol ($1.ptr,
1654 expression_context_block,
1656 &is_a_field_of_this);
1657 $$.is_a_field_of_this
1658 = is_a_field_of_this.type != NULL;
1665 /* Like write_exp_string, but prepends a '~'. */
1668 write_destructor_name (struct parser_state *par_state, struct stoken token)
1670 char *copy = alloca (token.length + 1);
1673 memcpy (©[1], token.ptr, token.length);
1678 write_exp_string (par_state, token);
1681 /* Returns a stoken of the operator name given by OP (which does not
1682 include the string "operator"). */
1684 static struct stoken
1685 operator_stoken (const char *op)
1687 static const char *operator_string = "operator";
1688 struct stoken st = { NULL, 0 };
1691 st.length = strlen (operator_string) + strlen (op);
1692 buf = malloc (st.length + 1);
1693 strcpy (buf, operator_string);
1697 /* The toplevel (c_parse) will free the memory allocated here. */
1698 make_cleanup (free, buf);
1702 /* Return true if the type is aggregate-like. */
1705 type_aggregate_p (struct type *type)
1707 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1708 || TYPE_CODE (type) == TYPE_CODE_UNION
1709 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1710 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1711 && TYPE_DECLARED_CLASS (type)));
1714 /* Validate a parameter typelist. */
1717 check_parameter_typelist (VEC (type_ptr) *params)
1722 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1724 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1728 if (VEC_length (type_ptr, params) == 1)
1733 VEC_free (type_ptr, params);
1734 error (_("parameter types following 'void'"));
1738 VEC_free (type_ptr, params);
1739 error (_("'void' invalid as parameter type"));
1745 /* Take care of parsing a number (anything that starts with a digit).
1746 Set yylval and return the token type; update lexptr.
1747 LEN is the number of characters in it. */
1749 /*** Needs some error checking for the float case ***/
1752 parse_number (struct parser_state *par_state,
1753 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1755 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1756 here, and we do kind of silly things like cast to unsigned. */
1763 int base = input_radix;
1766 /* Number of "L" suffixes encountered. */
1769 /* We have found a "L" or "U" suffix. */
1770 int found_suffix = 0;
1773 struct type *signed_type;
1774 struct type *unsigned_type;
1778 memcpy (p, buf, len);
1782 /* If it ends at "df", "dd" or "dl", take it as type of decimal floating
1783 point. Return DECFLOAT. */
1785 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1788 putithere->typed_val_decfloat.type
1789 = parse_type (par_state)->builtin_decfloat;
1790 decimal_from_string (putithere->typed_val_decfloat.val, 4,
1791 gdbarch_byte_order (parse_gdbarch (par_state)),
1797 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1800 putithere->typed_val_decfloat.type
1801 = parse_type (par_state)->builtin_decdouble;
1802 decimal_from_string (putithere->typed_val_decfloat.val, 8,
1803 gdbarch_byte_order (parse_gdbarch (par_state)),
1809 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1812 putithere->typed_val_decfloat.type
1813 = parse_type (par_state)->builtin_declong;
1814 decimal_from_string (putithere->typed_val_decfloat.val, 16,
1815 gdbarch_byte_order (parse_gdbarch (par_state)),
1821 if (! parse_c_float (parse_gdbarch (par_state), p, len,
1822 &putithere->typed_val_float.dval,
1823 &putithere->typed_val_float.type))
1828 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1829 if (p[0] == '0' && len > 1)
1872 if (c >= 'A' && c <= 'Z')
1874 if (c != 'l' && c != 'u')
1876 if (c >= '0' && c <= '9')
1884 if (base > 10 && c >= 'a' && c <= 'f')
1888 n += i = c - 'a' + 10;
1901 return ERROR; /* Char not a digit */
1904 return ERROR; /* Invalid digit in this base */
1906 /* Portably test for overflow (only works for nonzero values, so make
1907 a second check for zero). FIXME: Can't we just make n and prevn
1908 unsigned and avoid this? */
1909 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1910 unsigned_p = 1; /* Try something unsigned */
1912 /* Portably test for unsigned overflow.
1913 FIXME: This check is wrong; for example it doesn't find overflow
1914 on 0x123456789 when LONGEST is 32 bits. */
1915 if (c != 'l' && c != 'u' && n != 0)
1917 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1918 error (_("Numeric constant too large."));
1923 /* An integer constant is an int, a long, or a long long. An L
1924 suffix forces it to be long; an LL suffix forces it to be long
1925 long. If not forced to a larger size, it gets the first type of
1926 the above that it fits in. To figure out whether it fits, we
1927 shift it right and see whether anything remains. Note that we
1928 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1929 operation, because many compilers will warn about such a shift
1930 (which always produces a zero result). Sometimes gdbarch_int_bit
1931 or gdbarch_long_bit will be that big, sometimes not. To deal with
1932 the case where it is we just always shift the value more than
1933 once, with fewer bits each time. */
1935 un = (ULONGEST)n >> 2;
1937 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1940 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1942 /* A large decimal (not hex or octal) constant (between INT_MAX
1943 and UINT_MAX) is a long or unsigned long, according to ANSI,
1944 never an unsigned int, but this code treats it as unsigned
1945 int. This probably should be fixed. GCC gives a warning on
1948 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1949 signed_type = parse_type (par_state)->builtin_int;
1951 else if (long_p <= 1
1952 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1955 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1956 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1957 signed_type = parse_type (par_state)->builtin_long;
1962 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1963 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1964 /* A long long does not fit in a LONGEST. */
1965 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1967 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1968 high_bit = (ULONGEST) 1 << shift;
1969 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1970 signed_type = parse_type (par_state)->builtin_long_long;
1973 putithere->typed_val_int.val = n;
1975 /* If the high bit of the worked out type is set then this number
1976 has to be unsigned. */
1978 if (unsigned_p || (n & high_bit))
1980 putithere->typed_val_int.type = unsigned_type;
1984 putithere->typed_val_int.type = signed_type;
1990 /* Temporary obstack used for holding strings. */
1991 static struct obstack tempbuf;
1992 static int tempbuf_init;
1994 /* Parse a C escape sequence. The initial backslash of the sequence
1995 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1996 last character of the sequence. If OUTPUT is not NULL, the
1997 translated form of the escape sequence will be written there. If
1998 OUTPUT is NULL, no output is written and the call will only affect
1999 *PTR. If an escape sequence is expressed in target bytes, then the
2000 entire sequence will simply be copied to OUTPUT. Return 1 if any
2001 character was emitted, 0 otherwise. */
2004 c_parse_escape (const char **ptr, struct obstack *output)
2006 const char *tokptr = *ptr;
2009 /* Some escape sequences undergo character set conversion. Those we
2013 /* Hex escapes do not undergo character set conversion, so keep
2014 the escape sequence for later. */
2017 obstack_grow_str (output, "\\x");
2019 if (!isxdigit (*tokptr))
2020 error (_("\\x escape without a following hex digit"));
2021 while (isxdigit (*tokptr))
2024 obstack_1grow (output, *tokptr);
2029 /* Octal escapes do not undergo character set conversion, so
2030 keep the escape sequence for later. */
2042 obstack_grow_str (output, "\\");
2044 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
2048 obstack_1grow (output, *tokptr);
2054 /* We handle UCNs later. We could handle them here, but that
2055 would mean a spurious error in the case where the UCN could
2056 be converted to the target charset but not the host
2062 int i, len = c == 'U' ? 8 : 4;
2065 obstack_1grow (output, '\\');
2066 obstack_1grow (output, *tokptr);
2069 if (!isxdigit (*tokptr))
2070 error (_("\\%c escape without a following hex digit"), c);
2071 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2074 obstack_1grow (output, *tokptr);
2080 /* We must pass backslash through so that it does not
2081 cause quoting during the second expansion. */
2084 obstack_grow_str (output, "\\\\");
2088 /* Escapes which undergo conversion. */
2091 obstack_1grow (output, '\a');
2096 obstack_1grow (output, '\b');
2101 obstack_1grow (output, '\f');
2106 obstack_1grow (output, '\n');
2111 obstack_1grow (output, '\r');
2116 obstack_1grow (output, '\t');
2121 obstack_1grow (output, '\v');
2125 /* GCC extension. */
2128 obstack_1grow (output, HOST_ESCAPE_CHAR);
2132 /* Backslash-newline expands to nothing at all. */
2138 /* A few escapes just expand to the character itself. */
2142 /* GCC extensions. */
2147 /* Unrecognized escapes turn into the character itself. */
2150 obstack_1grow (output, *tokptr);
2158 /* Parse a string or character literal from TOKPTR. The string or
2159 character may be wide or unicode. *OUTPTR is set to just after the
2160 end of the literal in the input string. The resulting token is
2161 stored in VALUE. This returns a token value, either STRING or
2162 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2163 number of host characters in the literal. */
2166 parse_string_or_char (const char *tokptr, const char **outptr,
2167 struct typed_stoken *value, int *host_chars)
2170 enum c_string_type type;
2173 /* Build the gdb internal form of the input string in tempbuf. Note
2174 that the buffer is null byte terminated *only* for the
2175 convenience of debugging gdb itself and printing the buffer
2176 contents when the buffer contains no embedded nulls. Gdb does
2177 not depend upon the buffer being null byte terminated, it uses
2178 the length string instead. This allows gdb to handle C strings
2179 (as well as strings in other languages) with embedded null
2185 obstack_free (&tempbuf, NULL);
2186 obstack_init (&tempbuf);
2188 /* Record the string type. */
2191 type = C_WIDE_STRING;
2194 else if (*tokptr == 'u')
2199 else if (*tokptr == 'U')
2204 else if (*tokptr == '@')
2206 /* An Objective C string. */
2214 /* Skip the quote. */
2228 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2230 else if (c == quote)
2234 obstack_1grow (&tempbuf, c);
2236 /* FIXME: this does the wrong thing with multi-byte host
2237 characters. We could use mbrlen here, but that would
2238 make "set host-charset" a bit less useful. */
2243 if (*tokptr != quote)
2246 error (_("Unterminated string in expression."));
2248 error (_("Unmatched single quote."));
2253 value->ptr = obstack_base (&tempbuf);
2254 value->length = obstack_object_size (&tempbuf);
2258 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2261 /* This is used to associate some attributes with a token. */
2265 /* If this bit is set, the token is C++-only. */
2269 /* If this bit is set, the token is conditional: if there is a
2270 symbol of the same name, then the token is a symbol; otherwise,
2271 the token is a keyword. */
2280 enum exp_opcode opcode;
2281 enum token_flags flags;
2284 static const struct token tokentab3[] =
2286 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2287 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2288 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2289 {"...", DOTDOTDOT, BINOP_END, 0}
2292 static const struct token tokentab2[] =
2294 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2295 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2296 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2297 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2298 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2299 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2300 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2301 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2302 {"++", INCREMENT, BINOP_END, 0},
2303 {"--", DECREMENT, BINOP_END, 0},
2304 {"->", ARROW, BINOP_END, 0},
2305 {"&&", ANDAND, BINOP_END, 0},
2306 {"||", OROR, BINOP_END, 0},
2307 /* "::" is *not* only C++: gdb overrides its meaning in several
2308 different ways, e.g., 'filename'::func, function::variable. */
2309 {"::", COLONCOLON, BINOP_END, 0},
2310 {"<<", LSH, BINOP_END, 0},
2311 {">>", RSH, BINOP_END, 0},
2312 {"==", EQUAL, BINOP_END, 0},
2313 {"!=", NOTEQUAL, BINOP_END, 0},
2314 {"<=", LEQ, BINOP_END, 0},
2315 {">=", GEQ, BINOP_END, 0},
2316 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2319 /* Identifier-like tokens. */
2320 static const struct token ident_tokens[] =
2322 {"unsigned", UNSIGNED, OP_NULL, 0},
2323 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2324 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2325 {"struct", STRUCT, OP_NULL, 0},
2326 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2327 {"sizeof", SIZEOF, OP_NULL, 0},
2328 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2329 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2330 {"class", CLASS, OP_NULL, FLAG_CXX},
2331 {"union", UNION, OP_NULL, 0},
2332 {"short", SHORT, OP_NULL, 0},
2333 {"const", CONST_KEYWORD, OP_NULL, 0},
2334 {"enum", ENUM, OP_NULL, 0},
2335 {"long", LONG, OP_NULL, 0},
2336 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2337 {"int", INT_KEYWORD, OP_NULL, 0},
2338 {"new", NEW, OP_NULL, FLAG_CXX},
2339 {"delete", DELETE, OP_NULL, FLAG_CXX},
2340 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2342 {"and", ANDAND, BINOP_END, FLAG_CXX},
2343 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2344 {"bitand", '&', OP_NULL, FLAG_CXX},
2345 {"bitor", '|', OP_NULL, FLAG_CXX},
2346 {"compl", '~', OP_NULL, FLAG_CXX},
2347 {"not", '!', OP_NULL, FLAG_CXX},
2348 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2349 {"or", OROR, BINOP_END, FLAG_CXX},
2350 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2351 {"xor", '^', OP_NULL, FLAG_CXX},
2352 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2354 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2355 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2356 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2357 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2359 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2360 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2361 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2362 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2363 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2365 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2368 /* When we find that lexptr (the global var defined in parse.c) is
2369 pointing at a macro invocation, we expand the invocation, and call
2370 scan_macro_expansion to save the old lexptr here and point lexptr
2371 into the expanded text. When we reach the end of that, we call
2372 end_macro_expansion to pop back to the value we saved here. The
2373 macro expansion code promises to return only fully-expanded text,
2374 so we don't need to "push" more than one level.
2376 This is disgusting, of course. It would be cleaner to do all macro
2377 expansion beforehand, and then hand that to lexptr. But we don't
2378 really know where the expression ends. Remember, in a command like
2380 (gdb) break *ADDRESS if CONDITION
2382 we evaluate ADDRESS in the scope of the current frame, but we
2383 evaluate CONDITION in the scope of the breakpoint's location. So
2384 it's simply wrong to try to macro-expand the whole thing at once. */
2385 static const char *macro_original_text;
2387 /* We save all intermediate macro expansions on this obstack for the
2388 duration of a single parse. The expansion text may sometimes have
2389 to live past the end of the expansion, due to yacc lookahead.
2390 Rather than try to be clever about saving the data for a single
2391 token, we simply keep it all and delete it after parsing has
2393 static struct obstack expansion_obstack;
2396 scan_macro_expansion (char *expansion)
2400 /* We'd better not be trying to push the stack twice. */
2401 gdb_assert (! macro_original_text);
2403 /* Copy to the obstack, and then free the intermediate
2405 copy = obstack_copy0 (&expansion_obstack, expansion, strlen (expansion));
2408 /* Save the old lexptr value, so we can return to it when we're done
2409 parsing the expanded text. */
2410 macro_original_text = lexptr;
2415 scanning_macro_expansion (void)
2417 return macro_original_text != 0;
2421 finished_macro_expansion (void)
2423 /* There'd better be something to pop back to. */
2424 gdb_assert (macro_original_text);
2426 /* Pop back to the original text. */
2427 lexptr = macro_original_text;
2428 macro_original_text = 0;
2432 scan_macro_cleanup (void *dummy)
2434 if (macro_original_text)
2435 finished_macro_expansion ();
2437 obstack_free (&expansion_obstack, NULL);
2440 /* Return true iff the token represents a C++ cast operator. */
2443 is_cast_operator (const char *token, int len)
2445 return (! strncmp (token, "dynamic_cast", len)
2446 || ! strncmp (token, "static_cast", len)
2447 || ! strncmp (token, "reinterpret_cast", len)
2448 || ! strncmp (token, "const_cast", len));
2451 /* The scope used for macro expansion. */
2452 static struct macro_scope *expression_macro_scope;
2454 /* This is set if a NAME token appeared at the very end of the input
2455 string, with no whitespace separating the name from the EOF. This
2456 is used only when parsing to do field name completion. */
2457 static int saw_name_at_eof;
2459 /* This is set if the previously-returned token was a structure
2460 operator -- either '.' or ARROW. This is used only when parsing to
2461 do field name completion. */
2462 static int last_was_structop;
2464 /* Read one token, getting characters through lexptr. */
2467 lex_one_token (struct parser_state *par_state, int *is_quoted_name)
2472 const char *tokstart;
2473 int saw_structop = last_was_structop;
2476 last_was_structop = 0;
2477 *is_quoted_name = 0;
2481 /* Check if this is a macro invocation that we need to expand. */
2482 if (! scanning_macro_expansion ())
2484 char *expanded = macro_expand_next (&lexptr,
2485 standard_macro_lookup,
2486 expression_macro_scope);
2489 scan_macro_expansion (expanded);
2492 prev_lexptr = lexptr;
2495 /* See if it is a special token of length 3. */
2496 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2497 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2499 if ((tokentab3[i].flags & FLAG_CXX) != 0
2500 && parse_language (par_state)->la_language != language_cplus)
2504 yylval.opcode = tokentab3[i].opcode;
2505 return tokentab3[i].token;
2508 /* See if it is a special token of length 2. */
2509 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2510 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2512 if ((tokentab2[i].flags & FLAG_CXX) != 0
2513 && parse_language (par_state)->la_language != language_cplus)
2517 yylval.opcode = tokentab2[i].opcode;
2518 if (parse_completion && tokentab2[i].token == ARROW)
2519 last_was_structop = 1;
2520 return tokentab2[i].token;
2523 switch (c = *tokstart)
2526 /* If we were just scanning the result of a macro expansion,
2527 then we need to resume scanning the original text.
2528 If we're parsing for field name completion, and the previous
2529 token allows such completion, return a COMPLETE token.
2530 Otherwise, we were already scanning the original text, and
2531 we're really done. */
2532 if (scanning_macro_expansion ())
2534 finished_macro_expansion ();
2537 else if (saw_name_at_eof)
2539 saw_name_at_eof = 0;
2542 else if (saw_structop)
2557 if (parse_language (par_state)->la_language == language_objc
2564 if (paren_depth == 0)
2571 if (comma_terminates
2573 && ! scanning_macro_expansion ())
2579 /* Might be a floating point number. */
2580 if (lexptr[1] < '0' || lexptr[1] > '9')
2582 if (parse_completion)
2583 last_was_structop = 1;
2584 goto symbol; /* Nope, must be a symbol. */
2586 /* FALL THRU into number case. */
2599 /* It's a number. */
2600 int got_dot = 0, got_e = 0, toktype;
2601 const char *p = tokstart;
2602 int hex = input_radix > 10;
2604 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2609 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2617 /* This test includes !hex because 'e' is a valid hex digit
2618 and thus does not indicate a floating point number when
2619 the radix is hex. */
2620 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2621 got_dot = got_e = 1;
2622 /* This test does not include !hex, because a '.' always indicates
2623 a decimal floating point number regardless of the radix. */
2624 else if (!got_dot && *p == '.')
2626 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2627 && (*p == '-' || *p == '+'))
2628 /* This is the sign of the exponent, not the end of the
2631 /* We will take any letters or digits. parse_number will
2632 complain if past the radix, or if L or U are not final. */
2633 else if ((*p < '0' || *p > '9')
2634 && ((*p < 'a' || *p > 'z')
2635 && (*p < 'A' || *p > 'Z')))
2638 toktype = parse_number (par_state, tokstart, p - tokstart,
2639 got_dot|got_e, &yylval);
2640 if (toktype == ERROR)
2642 char *err_copy = (char *) alloca (p - tokstart + 1);
2644 memcpy (err_copy, tokstart, p - tokstart);
2645 err_copy[p - tokstart] = 0;
2646 error (_("Invalid number \"%s\"."), err_copy);
2654 const char *p = &tokstart[1];
2655 size_t len = strlen ("entry");
2657 if (parse_language (par_state)->la_language == language_objc)
2659 size_t len = strlen ("selector");
2661 if (strncmp (p, "selector", len) == 0
2662 && (p[len] == '\0' || isspace (p[len])))
2671 while (isspace (*p))
2673 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2705 if (tokstart[1] != '"' && tokstart[1] != '\'')
2714 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2719 error (_("Empty character constant."));
2720 else if (host_len > 2 && c == '\'')
2723 namelen = lexptr - tokstart - 1;
2724 *is_quoted_name = 1;
2728 else if (host_len > 1)
2729 error (_("Invalid character constant."));
2735 if (!(c == '_' || c == '$'
2736 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2737 /* We must have come across a bad character (e.g. ';'). */
2738 error (_("Invalid character '%c' in expression."), c);
2740 /* It's a name. See how long it is. */
2742 for (c = tokstart[namelen];
2743 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2744 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2746 /* Template parameter lists are part of the name.
2747 FIXME: This mishandles `print $a<4&&$a>3'. */
2751 if (! is_cast_operator (tokstart, namelen))
2753 /* Scan ahead to get rest of the template specification. Note
2754 that we look ahead only when the '<' adjoins non-whitespace
2755 characters; for comparison expressions, e.g. "a < b > c",
2756 there must be spaces before the '<', etc. */
2757 const char *p = find_template_name_end (tokstart + namelen);
2760 namelen = p - tokstart;
2764 c = tokstart[++namelen];
2767 /* The token "if" terminates the expression and is NOT removed from
2768 the input stream. It doesn't count if it appears in the
2769 expansion of a macro. */
2771 && tokstart[0] == 'i'
2772 && tokstart[1] == 'f'
2773 && ! scanning_macro_expansion ())
2778 /* For the same reason (breakpoint conditions), "thread N"
2779 terminates the expression. "thread" could be an identifier, but
2780 an identifier is never followed by a number without intervening
2781 punctuation. "task" is similar. Handle abbreviations of these,
2782 similarly to breakpoint.c:find_condition_and_thread. */
2784 && (strncmp (tokstart, "thread", namelen) == 0
2785 || strncmp (tokstart, "task", namelen) == 0)
2786 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2787 && ! scanning_macro_expansion ())
2789 const char *p = tokstart + namelen + 1;
2791 while (*p == ' ' || *p == '\t')
2793 if (*p >= '0' && *p <= '9')
2801 yylval.sval.ptr = tokstart;
2802 yylval.sval.length = namelen;
2804 /* Catch specific keywords. */
2805 copy = copy_name (yylval.sval);
2806 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2807 if (strcmp (copy, ident_tokens[i].oper) == 0)
2809 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2810 && parse_language (par_state)->la_language != language_cplus)
2813 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2815 struct field_of_this_result is_a_field_of_this;
2817 if (lookup_symbol (copy, expression_context_block,
2819 (parse_language (par_state)->la_language
2820 == language_cplus ? &is_a_field_of_this
2824 /* The keyword is shadowed. */
2829 /* It is ok to always set this, even though we don't always
2830 strictly need to. */
2831 yylval.opcode = ident_tokens[i].opcode;
2832 return ident_tokens[i].token;
2835 if (*tokstart == '$')
2838 if (parse_completion && *lexptr == '\0')
2839 saw_name_at_eof = 1;
2841 yylval.ssym.stoken = yylval.sval;
2842 yylval.ssym.sym.symbol = NULL;
2843 yylval.ssym.sym.block = NULL;
2844 yylval.ssym.is_a_field_of_this = 0;
2848 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2855 DEF_VEC_O (token_and_value);
2857 /* A FIFO of tokens that have been read but not yet returned to the
2859 static VEC (token_and_value) *token_fifo;
2861 /* Non-zero if the lexer should return tokens from the FIFO. */
2864 /* Temporary storage for c_lex; this holds symbol names as they are
2866 static struct obstack name_obstack;
2868 /* Classify a NAME token. The contents of the token are in `yylval'.
2869 Updates yylval and returns the new token type. BLOCK is the block
2870 in which lookups start; this can be NULL to mean the global scope.
2871 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2872 in single quotes. */
2875 classify_name (struct parser_state *par_state, const struct block *block,
2878 struct block_symbol bsym;
2880 struct field_of_this_result is_a_field_of_this;
2882 copy = copy_name (yylval.sval);
2884 /* Initialize this in case we *don't* use it in this call; that way
2885 we can refer to it unconditionally below. */
2886 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2888 bsym = lookup_symbol (copy, block, VAR_DOMAIN,
2889 parse_language (par_state)->la_name_of_this
2890 ? &is_a_field_of_this : NULL);
2892 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2894 yylval.ssym.sym = bsym;
2895 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2898 else if (!bsym.symbol)
2900 /* If we found a field of 'this', we might have erroneously
2901 found a constructor where we wanted a type name. Handle this
2902 case by noticing that we found a constructor and then look up
2903 the type tag instead. */
2904 if (is_a_field_of_this.type != NULL
2905 && is_a_field_of_this.fn_field != NULL
2906 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2909 struct field_of_this_result inner_is_a_field_of_this;
2911 bsym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2912 &inner_is_a_field_of_this);
2913 if (bsym.symbol != NULL)
2915 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2920 /* If we found a field, then we want to prefer it over a
2921 filename. However, if the name was quoted, then it is better
2922 to check for a filename or a block, since this is the only
2923 way the user has of requiring the extension to be used. */
2924 if (is_a_field_of_this.type == NULL || is_quoted_name)
2926 /* See if it's a file name. */
2927 struct symtab *symtab;
2929 symtab = lookup_symtab (copy);
2932 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
2939 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
2941 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2945 /* See if it's an ObjC classname. */
2946 if (parse_language (par_state)->la_language == language_objc && !bsym.symbol)
2948 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2953 yylval.theclass.theclass = Class;
2954 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2956 yylval.theclass.type = SYMBOL_TYPE (sym);
2961 /* Input names that aren't symbols but ARE valid hex numbers, when
2962 the input radix permits them, can be names or numbers depending
2963 on the parse. Note we support radixes > 16 here. */
2965 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2966 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2968 YYSTYPE newlval; /* Its value is ignored. */
2969 int hextype = parse_number (par_state, copy, yylval.sval.length,
2974 yylval.ssym.sym = bsym;
2975 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2980 /* Any other kind of symbol */
2981 yylval.ssym.sym = bsym;
2982 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2984 if (bsym.symbol == NULL
2985 && parse_language (par_state)->la_language == language_cplus
2986 && is_a_field_of_this.type == NULL
2987 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
2988 return UNKNOWN_CPP_NAME;
2993 /* Like classify_name, but used by the inner loop of the lexer, when a
2994 name might have already been seen. CONTEXT is the context type, or
2995 NULL if this is the first component of a name. */
2998 classify_inner_name (struct parser_state *par_state,
2999 const struct block *block, struct type *context)
3004 if (context == NULL)
3005 return classify_name (par_state, block, 0);
3007 type = check_typedef (context);
3008 if (!type_aggregate_p (type))
3011 copy = copy_name (yylval.ssym.stoken);
3012 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3013 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN);
3015 /* If no symbol was found, search for a matching base class named
3016 COPY. This will allow users to enter qualified names of class members
3017 relative to the `this' pointer. */
3018 if (yylval.ssym.sym.symbol == NULL)
3020 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3022 if (base_type != NULL)
3024 yylval.tsym.type = base_type;
3031 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
3035 /* cp_lookup_nested_symbol might have accidentally found a constructor
3036 named COPY when we really wanted a base class of the same name.
3037 Double-check this case by looking for a base class. */
3039 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3041 if (base_type != NULL)
3043 yylval.tsym.type = base_type;
3050 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3056 internal_error (__FILE__, __LINE__, _("not reached"));
3059 /* The outer level of a two-level lexer. This calls the inner lexer
3060 to return tokens. It then either returns these tokens, or
3061 aggregates them into a larger token. This lets us work around a
3062 problem in our parsing approach, where the parser could not
3063 distinguish between qualified names and qualified types at the
3066 This approach is still not ideal, because it mishandles template
3067 types. See the comment in lex_one_token for an example. However,
3068 this is still an improvement over the earlier approach, and will
3069 suffice until we move to better parsing technology. */
3074 token_and_value current;
3075 int first_was_coloncolon, last_was_coloncolon;
3076 struct type *context_type = NULL;
3077 int last_to_examine, next_to_examine, checkpoint;
3078 const struct block *search_block;
3081 if (popping && !VEC_empty (token_and_value, token_fifo))
3085 /* Read the first token and decide what to do. Most of the
3086 subsequent code is C++-only; but also depends on seeing a "::" or
3088 current.token = lex_one_token (pstate, &is_quoted_name);
3089 if (current.token == NAME)
3090 current.token = classify_name (pstate, expression_context_block,
3092 if (parse_language (pstate)->la_language != language_cplus
3093 || (current.token != TYPENAME && current.token != COLONCOLON
3094 && current.token != FILENAME))
3095 return current.token;
3097 /* Read any sequence of alternating "::" and name-like tokens into
3099 current.value = yylval;
3100 VEC_safe_push (token_and_value, token_fifo, ¤t);
3101 last_was_coloncolon = current.token == COLONCOLON;
3106 /* We ignore quoted names other than the very first one.
3107 Subsequent ones do not have any special meaning. */
3108 current.token = lex_one_token (pstate, &ignore);
3109 current.value = yylval;
3110 VEC_safe_push (token_and_value, token_fifo, ¤t);
3112 if ((last_was_coloncolon && current.token != NAME)
3113 || (!last_was_coloncolon && current.token != COLONCOLON))
3115 last_was_coloncolon = !last_was_coloncolon;
3119 /* We always read one extra token, so compute the number of tokens
3120 to examine accordingly. */
3121 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3122 next_to_examine = 0;
3124 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3127 obstack_free (&name_obstack, obstack_base (&name_obstack));
3129 if (current.token == FILENAME)
3130 search_block = current.value.bval;
3131 else if (current.token == COLONCOLON)
3132 search_block = NULL;
3135 gdb_assert (current.token == TYPENAME);
3136 search_block = expression_context_block;
3137 obstack_grow (&name_obstack, current.value.sval.ptr,
3138 current.value.sval.length);
3139 context_type = current.value.tsym.type;
3143 first_was_coloncolon = current.token == COLONCOLON;
3144 last_was_coloncolon = first_was_coloncolon;
3146 while (next_to_examine <= last_to_examine)
3148 token_and_value *next;
3150 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3153 if (next->token == NAME && last_was_coloncolon)
3157 yylval = next->value;
3158 classification = classify_inner_name (pstate, search_block,
3160 /* We keep going until we either run out of names, or until
3161 we have a qualified name which is not a type. */
3162 if (classification != TYPENAME && classification != NAME)
3165 /* Accept up to this token. */
3166 checkpoint = next_to_examine;
3168 /* Update the partial name we are constructing. */
3169 if (context_type != NULL)
3171 /* We don't want to put a leading "::" into the name. */
3172 obstack_grow_str (&name_obstack, "::");
3174 obstack_grow (&name_obstack, next->value.sval.ptr,
3175 next->value.sval.length);
3177 yylval.sval.ptr = obstack_base (&name_obstack);
3178 yylval.sval.length = obstack_object_size (&name_obstack);
3179 current.value = yylval;
3180 current.token = classification;
3182 last_was_coloncolon = 0;
3184 if (classification == NAME)
3187 context_type = yylval.tsym.type;
3189 else if (next->token == COLONCOLON && !last_was_coloncolon)
3190 last_was_coloncolon = 1;
3193 /* We've reached the end of the name. */
3198 /* If we have a replacement token, install it as the first token in
3199 the FIFO, and delete the other constituent tokens. */
3202 current.value.sval.ptr = obstack_copy0 (&expansion_obstack,
3203 current.value.sval.ptr,
3204 current.value.sval.length);
3206 VEC_replace (token_and_value, token_fifo, 0, ¤t);
3208 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3212 current = *VEC_index (token_and_value, token_fifo, 0);
3213 VEC_ordered_remove (token_and_value, token_fifo, 0);
3214 yylval = current.value;
3215 return current.token;
3219 c_parse (struct parser_state *par_state)
3222 struct cleanup *back_to;
3224 /* Setting up the parser state. */
3225 gdb_assert (par_state != NULL);
3228 back_to = make_cleanup (free_current_contents, &expression_macro_scope);
3229 make_cleanup_clear_parser_state (&pstate);
3231 /* Set up the scope for macro expansion. */
3232 expression_macro_scope = NULL;
3234 if (expression_context_block)
3235 expression_macro_scope
3236 = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3238 expression_macro_scope = default_macro_scope ();
3239 if (! expression_macro_scope)
3240 expression_macro_scope = user_macro_scope ();
3242 /* Initialize macro expansion code. */
3243 obstack_init (&expansion_obstack);
3244 gdb_assert (! macro_original_text);
3245 make_cleanup (scan_macro_cleanup, 0);
3247 make_cleanup_restore_integer (&yydebug);
3248 yydebug = parser_debug;
3250 /* Initialize some state used by the lexer. */
3251 last_was_structop = 0;
3252 saw_name_at_eof = 0;
3254 VEC_free (token_and_value, token_fifo);
3256 obstack_init (&name_obstack);
3257 make_cleanup_obstack_free (&name_obstack);
3259 result = yyparse ();
3260 do_cleanups (back_to);
3267 /* This is called via the YYPRINT macro when parser debugging is
3268 enabled. It prints a token's value. */
3271 c_print_token (FILE *file, int type, YYSTYPE value)
3276 fprintf (file, "typed_val_int<%s, %s>",
3277 TYPE_SAFE_NAME (value.typed_val_int.type),
3278 pulongest (value.typed_val_int.val));
3284 char *copy = alloca (value.tsval.length + 1);
3286 memcpy (copy, value.tsval.ptr, value.tsval.length);
3287 copy[value.tsval.length] = '\0';
3289 fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3295 fprintf (file, "sval<%s>", copy_name (value.sval));
3299 fprintf (file, "tsym<type=%s, name=%s>",
3300 TYPE_SAFE_NAME (value.tsym.type),
3301 copy_name (value.tsym.stoken));
3305 case UNKNOWN_CPP_NAME:
3308 fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3309 copy_name (value.ssym.stoken),
3310 (value.ssym.sym.symbol == NULL
3311 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym.symbol)),
3312 value.ssym.is_a_field_of_this);
3316 fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3327 lexptr = prev_lexptr;
3329 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);