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 = (char *) malloc ($1.length + 1);
843 memcpy (vec->ptr, $1.ptr, $1.length + 1);
848 /* Note that we NUL-terminate here, but just
852 $$.tokens = XRESIZEVEC (struct typed_stoken,
855 p = (char *) 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 = (char *) 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 write_exp_elt_block (pstate, sym.block);
1076 write_exp_elt_sym (pstate, sym.symbol);
1077 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1079 else if ($1.is_a_field_of_this)
1081 /* C++: it hangs off of `this'. Must
1082 not inadvertently convert from a method call
1084 if (innermost_block == 0
1085 || contained_in (sym.block,
1087 innermost_block = sym.block;
1088 write_exp_elt_opcode (pstate, OP_THIS);
1089 write_exp_elt_opcode (pstate, OP_THIS);
1090 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1091 write_exp_string (pstate, $1.stoken);
1092 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1096 struct bound_minimal_symbol msymbol;
1097 char *arg = copy_name ($1.stoken);
1100 lookup_bound_minimal_symbol (arg);
1101 if (msymbol.minsym != NULL)
1102 write_exp_msymbol (pstate, msymbol);
1103 else if (!have_full_symbols () && !have_partial_symbols ())
1104 error (_("No symbol table is loaded. Use the \"file\" command."));
1106 error (_("No symbol \"%s\" in current context."),
1107 copy_name ($1.stoken));
1112 space_identifier : '@' NAME
1113 { insert_type_address_space (pstate, copy_name ($2.stoken)); }
1116 const_or_volatile: const_or_volatile_noopt
1120 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1123 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1124 | const_or_volatile_noopt
1127 const_or_volatile_or_space_identifier:
1128 const_or_volatile_or_space_identifier_noopt
1134 { insert_type (tp_pointer); }
1135 const_or_volatile_or_space_identifier
1137 { insert_type (tp_pointer); }
1138 const_or_volatile_or_space_identifier
1140 { insert_type (tp_reference); }
1142 { insert_type (tp_reference); }
1145 ptr_operator_ts: ptr_operator
1147 $$ = get_type_stack ();
1148 /* This cleanup is eventually run by
1150 make_cleanup (type_stack_cleanup, $$);
1154 abs_decl: ptr_operator_ts direct_abs_decl
1155 { $$ = append_type_stack ($2, $1); }
1160 direct_abs_decl: '(' abs_decl ')'
1162 | direct_abs_decl array_mod
1164 push_type_stack ($1);
1166 push_type (tp_array);
1167 $$ = get_type_stack ();
1172 push_type (tp_array);
1173 $$ = get_type_stack ();
1176 | direct_abs_decl func_mod
1178 push_type_stack ($1);
1180 $$ = get_type_stack ();
1185 $$ = get_type_stack ();
1195 | OBJC_LBRAC INT ']'
1201 | '(' parameter_typelist ')'
1205 /* We used to try to recognize pointer to member types here, but
1206 that didn't work (shift/reduce conflicts meant that these rules never
1207 got executed). The problem is that
1208 int (foo::bar::baz::bizzle)
1209 is a function type but
1210 int (foo::bar::baz::bizzle::*)
1211 is a pointer to member type. Stroustrup loses again! */
1216 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1220 { $$ = lookup_signed_typename (parse_language (pstate),
1221 parse_gdbarch (pstate),
1224 { $$ = lookup_signed_typename (parse_language (pstate),
1225 parse_gdbarch (pstate),
1228 { $$ = lookup_signed_typename (parse_language (pstate),
1229 parse_gdbarch (pstate),
1232 { $$ = lookup_signed_typename (parse_language (pstate),
1233 parse_gdbarch (pstate),
1235 | LONG SIGNED_KEYWORD INT_KEYWORD
1236 { $$ = lookup_signed_typename (parse_language (pstate),
1237 parse_gdbarch (pstate),
1239 | LONG SIGNED_KEYWORD
1240 { $$ = lookup_signed_typename (parse_language (pstate),
1241 parse_gdbarch (pstate),
1243 | SIGNED_KEYWORD LONG INT_KEYWORD
1244 { $$ = lookup_signed_typename (parse_language (pstate),
1245 parse_gdbarch (pstate),
1247 | UNSIGNED LONG INT_KEYWORD
1248 { $$ = lookup_unsigned_typename (parse_language (pstate),
1249 parse_gdbarch (pstate),
1251 | LONG UNSIGNED INT_KEYWORD
1252 { $$ = lookup_unsigned_typename (parse_language (pstate),
1253 parse_gdbarch (pstate),
1256 { $$ = lookup_unsigned_typename (parse_language (pstate),
1257 parse_gdbarch (pstate),
1260 { $$ = lookup_signed_typename (parse_language (pstate),
1261 parse_gdbarch (pstate),
1263 | LONG LONG INT_KEYWORD
1264 { $$ = lookup_signed_typename (parse_language (pstate),
1265 parse_gdbarch (pstate),
1267 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1268 { $$ = lookup_signed_typename (parse_language (pstate),
1269 parse_gdbarch (pstate),
1271 | LONG LONG SIGNED_KEYWORD
1272 { $$ = lookup_signed_typename (parse_language (pstate),
1273 parse_gdbarch (pstate),
1275 | SIGNED_KEYWORD LONG LONG
1276 { $$ = lookup_signed_typename (parse_language (pstate),
1277 parse_gdbarch (pstate),
1279 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1280 { $$ = lookup_signed_typename (parse_language (pstate),
1281 parse_gdbarch (pstate),
1283 | UNSIGNED LONG LONG
1284 { $$ = lookup_unsigned_typename (parse_language (pstate),
1285 parse_gdbarch (pstate),
1287 | UNSIGNED LONG LONG INT_KEYWORD
1288 { $$ = lookup_unsigned_typename (parse_language (pstate),
1289 parse_gdbarch (pstate),
1291 | LONG LONG UNSIGNED
1292 { $$ = lookup_unsigned_typename (parse_language (pstate),
1293 parse_gdbarch (pstate),
1295 | LONG LONG UNSIGNED INT_KEYWORD
1296 { $$ = lookup_unsigned_typename (parse_language (pstate),
1297 parse_gdbarch (pstate),
1300 { $$ = lookup_signed_typename (parse_language (pstate),
1301 parse_gdbarch (pstate),
1303 | SHORT SIGNED_KEYWORD INT_KEYWORD
1304 { $$ = lookup_signed_typename (parse_language (pstate),
1305 parse_gdbarch (pstate),
1307 | SHORT SIGNED_KEYWORD
1308 { $$ = lookup_signed_typename (parse_language (pstate),
1309 parse_gdbarch (pstate),
1311 | UNSIGNED SHORT INT_KEYWORD
1312 { $$ = lookup_unsigned_typename (parse_language (pstate),
1313 parse_gdbarch (pstate),
1316 { $$ = lookup_unsigned_typename (parse_language (pstate),
1317 parse_gdbarch (pstate),
1319 | SHORT UNSIGNED INT_KEYWORD
1320 { $$ = lookup_unsigned_typename (parse_language (pstate),
1321 parse_gdbarch (pstate),
1324 { $$ = lookup_typename (parse_language (pstate),
1325 parse_gdbarch (pstate),
1327 (struct block *) NULL,
1329 | LONG DOUBLE_KEYWORD
1330 { $$ = lookup_typename (parse_language (pstate),
1331 parse_gdbarch (pstate),
1333 (struct block *) NULL,
1336 { $$ = lookup_struct (copy_name ($2),
1337 expression_context_block); }
1340 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1343 | STRUCT name COMPLETE
1345 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1350 { $$ = lookup_struct (copy_name ($2),
1351 expression_context_block); }
1354 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1357 | CLASS name COMPLETE
1359 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1364 { $$ = lookup_union (copy_name ($2),
1365 expression_context_block); }
1368 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1371 | UNION name COMPLETE
1373 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1378 { $$ = lookup_enum (copy_name ($2),
1379 expression_context_block); }
1382 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1385 | ENUM name COMPLETE
1387 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1391 | UNSIGNED type_name
1392 { $$ = lookup_unsigned_typename (parse_language (pstate),
1393 parse_gdbarch (pstate),
1394 TYPE_NAME($2.type)); }
1396 { $$ = lookup_unsigned_typename (parse_language (pstate),
1397 parse_gdbarch (pstate),
1399 | SIGNED_KEYWORD type_name
1400 { $$ = lookup_signed_typename (parse_language (pstate),
1401 parse_gdbarch (pstate),
1402 TYPE_NAME($2.type)); }
1404 { $$ = lookup_signed_typename (parse_language (pstate),
1405 parse_gdbarch (pstate),
1407 /* It appears that this rule for templates is never
1408 reduced; template recognition happens by lookahead
1409 in the token processing code in yylex. */
1410 | TEMPLATE name '<' type '>'
1411 { $$ = lookup_template_type(copy_name($2), $4,
1412 expression_context_block);
1414 | const_or_volatile_or_space_identifier_noopt typebase
1415 { $$ = follow_types ($2); }
1416 | typebase const_or_volatile_or_space_identifier_noopt
1417 { $$ = follow_types ($1); }
1423 $$.stoken.ptr = "int";
1424 $$.stoken.length = 3;
1425 $$.type = lookup_signed_typename (parse_language (pstate),
1426 parse_gdbarch (pstate),
1431 $$.stoken.ptr = "long";
1432 $$.stoken.length = 4;
1433 $$.type = lookup_signed_typename (parse_language (pstate),
1434 parse_gdbarch (pstate),
1439 $$.stoken.ptr = "short";
1440 $$.stoken.length = 5;
1441 $$.type = lookup_signed_typename (parse_language (pstate),
1442 parse_gdbarch (pstate),
1449 { check_parameter_typelist ($1); }
1450 | nonempty_typelist ',' DOTDOTDOT
1452 VEC_safe_push (type_ptr, $1, NULL);
1453 check_parameter_typelist ($1);
1461 VEC (type_ptr) *typelist = NULL;
1462 VEC_safe_push (type_ptr, typelist, $1);
1465 | nonempty_typelist ',' type
1467 VEC_safe_push (type_ptr, $1, $3);
1475 push_type_stack ($2);
1476 $$ = follow_types ($1);
1480 conversion_type_id: typebase conversion_declarator
1481 { $$ = follow_types ($1); }
1484 conversion_declarator: /* Nothing. */
1485 | ptr_operator conversion_declarator
1488 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1489 | VOLATILE_KEYWORD CONST_KEYWORD
1492 const_or_volatile_noopt: const_and_volatile
1493 { insert_type (tp_const);
1494 insert_type (tp_volatile);
1497 { insert_type (tp_const); }
1499 { insert_type (tp_volatile); }
1503 { $$ = operator_stoken (" new"); }
1505 { $$ = operator_stoken (" delete"); }
1506 | OPERATOR NEW '[' ']'
1507 { $$ = operator_stoken (" new[]"); }
1508 | OPERATOR DELETE '[' ']'
1509 { $$ = operator_stoken (" delete[]"); }
1510 | OPERATOR NEW OBJC_LBRAC ']'
1511 { $$ = operator_stoken (" new[]"); }
1512 | OPERATOR DELETE OBJC_LBRAC ']'
1513 { $$ = operator_stoken (" delete[]"); }
1515 { $$ = operator_stoken ("+"); }
1517 { $$ = operator_stoken ("-"); }
1519 { $$ = operator_stoken ("*"); }
1521 { $$ = operator_stoken ("/"); }
1523 { $$ = operator_stoken ("%"); }
1525 { $$ = operator_stoken ("^"); }
1527 { $$ = operator_stoken ("&"); }
1529 { $$ = operator_stoken ("|"); }
1531 { $$ = operator_stoken ("~"); }
1533 { $$ = operator_stoken ("!"); }
1535 { $$ = operator_stoken ("="); }
1537 { $$ = operator_stoken ("<"); }
1539 { $$ = operator_stoken (">"); }
1540 | OPERATOR ASSIGN_MODIFY
1541 { const char *op = "unknown";
1565 case BINOP_BITWISE_IOR:
1568 case BINOP_BITWISE_AND:
1571 case BINOP_BITWISE_XOR:
1578 $$ = operator_stoken (op);
1581 { $$ = operator_stoken ("<<"); }
1583 { $$ = operator_stoken (">>"); }
1585 { $$ = operator_stoken ("=="); }
1587 { $$ = operator_stoken ("!="); }
1589 { $$ = operator_stoken ("<="); }
1591 { $$ = operator_stoken (">="); }
1593 { $$ = operator_stoken ("&&"); }
1595 { $$ = operator_stoken ("||"); }
1596 | OPERATOR INCREMENT
1597 { $$ = operator_stoken ("++"); }
1598 | OPERATOR DECREMENT
1599 { $$ = operator_stoken ("--"); }
1601 { $$ = operator_stoken (","); }
1602 | OPERATOR ARROW_STAR
1603 { $$ = operator_stoken ("->*"); }
1605 { $$ = operator_stoken ("->"); }
1607 { $$ = operator_stoken ("()"); }
1609 { $$ = operator_stoken ("[]"); }
1610 | OPERATOR OBJC_LBRAC ']'
1611 { $$ = operator_stoken ("[]"); }
1612 | OPERATOR conversion_type_id
1615 struct ui_file *buf = mem_fileopen ();
1617 c_print_type ($2, NULL, buf, -1, 0,
1618 &type_print_raw_options);
1619 name = ui_file_xstrdup (buf, &length);
1620 ui_file_delete (buf);
1621 $$ = operator_stoken (name);
1628 name : NAME { $$ = $1.stoken; }
1629 | BLOCKNAME { $$ = $1.stoken; }
1630 | TYPENAME { $$ = $1.stoken; }
1631 | NAME_OR_INT { $$ = $1.stoken; }
1632 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1636 name_not_typename : NAME
1638 /* These would be useful if name_not_typename was useful, but it is just
1639 a fake for "variable", so these cause reduce/reduce conflicts because
1640 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1641 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1642 context where only a name could occur, this might be useful.
1647 struct field_of_this_result is_a_field_of_this;
1650 $$.sym = lookup_symbol ($1.ptr,
1651 expression_context_block,
1653 &is_a_field_of_this);
1654 $$.is_a_field_of_this
1655 = is_a_field_of_this.type != NULL;
1662 /* Like write_exp_string, but prepends a '~'. */
1665 write_destructor_name (struct parser_state *par_state, struct stoken token)
1667 char *copy = (char *) alloca (token.length + 1);
1670 memcpy (©[1], token.ptr, token.length);
1675 write_exp_string (par_state, token);
1678 /* Returns a stoken of the operator name given by OP (which does not
1679 include the string "operator"). */
1681 static struct stoken
1682 operator_stoken (const char *op)
1684 static const char *operator_string = "operator";
1685 struct stoken st = { NULL, 0 };
1688 st.length = strlen (operator_string) + strlen (op);
1689 buf = (char *) malloc (st.length + 1);
1690 strcpy (buf, operator_string);
1694 /* The toplevel (c_parse) will free the memory allocated here. */
1695 make_cleanup (free, buf);
1699 /* Return true if the type is aggregate-like. */
1702 type_aggregate_p (struct type *type)
1704 return (TYPE_CODE (type) == TYPE_CODE_STRUCT
1705 || TYPE_CODE (type) == TYPE_CODE_UNION
1706 || TYPE_CODE (type) == TYPE_CODE_NAMESPACE
1707 || (TYPE_CODE (type) == TYPE_CODE_ENUM
1708 && TYPE_DECLARED_CLASS (type)));
1711 /* Validate a parameter typelist. */
1714 check_parameter_typelist (VEC (type_ptr) *params)
1719 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1721 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1725 if (VEC_length (type_ptr, params) == 1)
1730 VEC_free (type_ptr, params);
1731 error (_("parameter types following 'void'"));
1735 VEC_free (type_ptr, params);
1736 error (_("'void' invalid as parameter type"));
1742 /* Take care of parsing a number (anything that starts with a digit).
1743 Set yylval and return the token type; update lexptr.
1744 LEN is the number of characters in it. */
1746 /*** Needs some error checking for the float case ***/
1749 parse_number (struct parser_state *par_state,
1750 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1752 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1753 here, and we do kind of silly things like cast to unsigned. */
1760 int base = input_radix;
1763 /* Number of "L" suffixes encountered. */
1766 /* We have found a "L" or "U" suffix. */
1767 int found_suffix = 0;
1770 struct type *signed_type;
1771 struct type *unsigned_type;
1774 p = (char *) alloca (len);
1775 memcpy (p, buf, len);
1779 /* If it ends at "df", "dd" or "dl", take it as type of decimal floating
1780 point. Return DECFLOAT. */
1782 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1785 putithere->typed_val_decfloat.type
1786 = parse_type (par_state)->builtin_decfloat;
1787 decimal_from_string (putithere->typed_val_decfloat.val, 4,
1788 gdbarch_byte_order (parse_gdbarch (par_state)),
1794 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1797 putithere->typed_val_decfloat.type
1798 = parse_type (par_state)->builtin_decdouble;
1799 decimal_from_string (putithere->typed_val_decfloat.val, 8,
1800 gdbarch_byte_order (parse_gdbarch (par_state)),
1806 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1809 putithere->typed_val_decfloat.type
1810 = parse_type (par_state)->builtin_declong;
1811 decimal_from_string (putithere->typed_val_decfloat.val, 16,
1812 gdbarch_byte_order (parse_gdbarch (par_state)),
1818 if (! parse_c_float (parse_gdbarch (par_state), p, len,
1819 &putithere->typed_val_float.dval,
1820 &putithere->typed_val_float.type))
1825 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1826 if (p[0] == '0' && len > 1)
1869 if (c >= 'A' && c <= 'Z')
1871 if (c != 'l' && c != 'u')
1873 if (c >= '0' && c <= '9')
1881 if (base > 10 && c >= 'a' && c <= 'f')
1885 n += i = c - 'a' + 10;
1898 return ERROR; /* Char not a digit */
1901 return ERROR; /* Invalid digit in this base */
1903 /* Portably test for overflow (only works for nonzero values, so make
1904 a second check for zero). FIXME: Can't we just make n and prevn
1905 unsigned and avoid this? */
1906 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1907 unsigned_p = 1; /* Try something unsigned */
1909 /* Portably test for unsigned overflow.
1910 FIXME: This check is wrong; for example it doesn't find overflow
1911 on 0x123456789 when LONGEST is 32 bits. */
1912 if (c != 'l' && c != 'u' && n != 0)
1914 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1915 error (_("Numeric constant too large."));
1920 /* An integer constant is an int, a long, or a long long. An L
1921 suffix forces it to be long; an LL suffix forces it to be long
1922 long. If not forced to a larger size, it gets the first type of
1923 the above that it fits in. To figure out whether it fits, we
1924 shift it right and see whether anything remains. Note that we
1925 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1926 operation, because many compilers will warn about such a shift
1927 (which always produces a zero result). Sometimes gdbarch_int_bit
1928 or gdbarch_long_bit will be that big, sometimes not. To deal with
1929 the case where it is we just always shift the value more than
1930 once, with fewer bits each time. */
1932 un = (ULONGEST)n >> 2;
1934 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1937 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1939 /* A large decimal (not hex or octal) constant (between INT_MAX
1940 and UINT_MAX) is a long or unsigned long, according to ANSI,
1941 never an unsigned int, but this code treats it as unsigned
1942 int. This probably should be fixed. GCC gives a warning on
1945 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1946 signed_type = parse_type (par_state)->builtin_int;
1948 else if (long_p <= 1
1949 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1952 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1953 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1954 signed_type = parse_type (par_state)->builtin_long;
1959 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1960 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1961 /* A long long does not fit in a LONGEST. */
1962 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1964 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1965 high_bit = (ULONGEST) 1 << shift;
1966 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1967 signed_type = parse_type (par_state)->builtin_long_long;
1970 putithere->typed_val_int.val = n;
1972 /* If the high bit of the worked out type is set then this number
1973 has to be unsigned. */
1975 if (unsigned_p || (n & high_bit))
1977 putithere->typed_val_int.type = unsigned_type;
1981 putithere->typed_val_int.type = signed_type;
1987 /* Temporary obstack used for holding strings. */
1988 static struct obstack tempbuf;
1989 static int tempbuf_init;
1991 /* Parse a C escape sequence. The initial backslash of the sequence
1992 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1993 last character of the sequence. If OUTPUT is not NULL, the
1994 translated form of the escape sequence will be written there. If
1995 OUTPUT is NULL, no output is written and the call will only affect
1996 *PTR. If an escape sequence is expressed in target bytes, then the
1997 entire sequence will simply be copied to OUTPUT. Return 1 if any
1998 character was emitted, 0 otherwise. */
2001 c_parse_escape (const char **ptr, struct obstack *output)
2003 const char *tokptr = *ptr;
2006 /* Some escape sequences undergo character set conversion. Those we
2010 /* Hex escapes do not undergo character set conversion, so keep
2011 the escape sequence for later. */
2014 obstack_grow_str (output, "\\x");
2016 if (!isxdigit (*tokptr))
2017 error (_("\\x escape without a following hex digit"));
2018 while (isxdigit (*tokptr))
2021 obstack_1grow (output, *tokptr);
2026 /* Octal escapes do not undergo character set conversion, so
2027 keep the escape sequence for later. */
2039 obstack_grow_str (output, "\\");
2041 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
2045 obstack_1grow (output, *tokptr);
2051 /* We handle UCNs later. We could handle them here, but that
2052 would mean a spurious error in the case where the UCN could
2053 be converted to the target charset but not the host
2059 int i, len = c == 'U' ? 8 : 4;
2062 obstack_1grow (output, '\\');
2063 obstack_1grow (output, *tokptr);
2066 if (!isxdigit (*tokptr))
2067 error (_("\\%c escape without a following hex digit"), c);
2068 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2071 obstack_1grow (output, *tokptr);
2077 /* We must pass backslash through so that it does not
2078 cause quoting during the second expansion. */
2081 obstack_grow_str (output, "\\\\");
2085 /* Escapes which undergo conversion. */
2088 obstack_1grow (output, '\a');
2093 obstack_1grow (output, '\b');
2098 obstack_1grow (output, '\f');
2103 obstack_1grow (output, '\n');
2108 obstack_1grow (output, '\r');
2113 obstack_1grow (output, '\t');
2118 obstack_1grow (output, '\v');
2122 /* GCC extension. */
2125 obstack_1grow (output, HOST_ESCAPE_CHAR);
2129 /* Backslash-newline expands to nothing at all. */
2135 /* A few escapes just expand to the character itself. */
2139 /* GCC extensions. */
2144 /* Unrecognized escapes turn into the character itself. */
2147 obstack_1grow (output, *tokptr);
2155 /* Parse a string or character literal from TOKPTR. The string or
2156 character may be wide or unicode. *OUTPTR is set to just after the
2157 end of the literal in the input string. The resulting token is
2158 stored in VALUE. This returns a token value, either STRING or
2159 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2160 number of host characters in the literal. */
2163 parse_string_or_char (const char *tokptr, const char **outptr,
2164 struct typed_stoken *value, int *host_chars)
2167 enum c_string_type type;
2170 /* Build the gdb internal form of the input string in tempbuf. Note
2171 that the buffer is null byte terminated *only* for the
2172 convenience of debugging gdb itself and printing the buffer
2173 contents when the buffer contains no embedded nulls. Gdb does
2174 not depend upon the buffer being null byte terminated, it uses
2175 the length string instead. This allows gdb to handle C strings
2176 (as well as strings in other languages) with embedded null
2182 obstack_free (&tempbuf, NULL);
2183 obstack_init (&tempbuf);
2185 /* Record the string type. */
2188 type = C_WIDE_STRING;
2191 else if (*tokptr == 'u')
2196 else if (*tokptr == 'U')
2201 else if (*tokptr == '@')
2203 /* An Objective C string. */
2211 /* Skip the quote. */
2225 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2227 else if (c == quote)
2231 obstack_1grow (&tempbuf, c);
2233 /* FIXME: this does the wrong thing with multi-byte host
2234 characters. We could use mbrlen here, but that would
2235 make "set host-charset" a bit less useful. */
2240 if (*tokptr != quote)
2243 error (_("Unterminated string in expression."));
2245 error (_("Unmatched single quote."));
2250 value->ptr = obstack_base (&tempbuf);
2251 value->length = obstack_object_size (&tempbuf);
2255 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2258 /* This is used to associate some attributes with a token. */
2262 /* If this bit is set, the token is C++-only. */
2266 /* If this bit is set, the token is conditional: if there is a
2267 symbol of the same name, then the token is a symbol; otherwise,
2268 the token is a keyword. */
2272 DEF_ENUM_FLAGS_TYPE (enum token_flag, token_flags);
2278 enum exp_opcode opcode;
2282 static const struct token tokentab3[] =
2284 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2285 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2286 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2287 {"...", DOTDOTDOT, BINOP_END, 0}
2290 static const struct token tokentab2[] =
2292 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2293 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2294 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2295 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2296 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2297 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2298 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2299 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2300 {"++", INCREMENT, BINOP_END, 0},
2301 {"--", DECREMENT, BINOP_END, 0},
2302 {"->", ARROW, BINOP_END, 0},
2303 {"&&", ANDAND, BINOP_END, 0},
2304 {"||", OROR, BINOP_END, 0},
2305 /* "::" is *not* only C++: gdb overrides its meaning in several
2306 different ways, e.g., 'filename'::func, function::variable. */
2307 {"::", COLONCOLON, BINOP_END, 0},
2308 {"<<", LSH, BINOP_END, 0},
2309 {">>", RSH, BINOP_END, 0},
2310 {"==", EQUAL, BINOP_END, 0},
2311 {"!=", NOTEQUAL, BINOP_END, 0},
2312 {"<=", LEQ, BINOP_END, 0},
2313 {">=", GEQ, BINOP_END, 0},
2314 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2317 /* Identifier-like tokens. */
2318 static const struct token ident_tokens[] =
2320 {"unsigned", UNSIGNED, OP_NULL, 0},
2321 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2322 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2323 {"struct", STRUCT, OP_NULL, 0},
2324 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2325 {"sizeof", SIZEOF, OP_NULL, 0},
2326 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2327 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2328 {"class", CLASS, OP_NULL, FLAG_CXX},
2329 {"union", UNION, OP_NULL, 0},
2330 {"short", SHORT, OP_NULL, 0},
2331 {"const", CONST_KEYWORD, OP_NULL, 0},
2332 {"enum", ENUM, OP_NULL, 0},
2333 {"long", LONG, OP_NULL, 0},
2334 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2335 {"int", INT_KEYWORD, OP_NULL, 0},
2336 {"new", NEW, OP_NULL, FLAG_CXX},
2337 {"delete", DELETE, OP_NULL, FLAG_CXX},
2338 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2340 {"and", ANDAND, BINOP_END, FLAG_CXX},
2341 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2342 {"bitand", '&', OP_NULL, FLAG_CXX},
2343 {"bitor", '|', OP_NULL, FLAG_CXX},
2344 {"compl", '~', OP_NULL, FLAG_CXX},
2345 {"not", '!', OP_NULL, FLAG_CXX},
2346 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2347 {"or", OROR, BINOP_END, FLAG_CXX},
2348 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2349 {"xor", '^', OP_NULL, FLAG_CXX},
2350 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2352 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2353 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2354 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2355 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2357 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2358 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2359 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2360 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2361 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2363 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2366 /* When we find that lexptr (the global var defined in parse.c) is
2367 pointing at a macro invocation, we expand the invocation, and call
2368 scan_macro_expansion to save the old lexptr here and point lexptr
2369 into the expanded text. When we reach the end of that, we call
2370 end_macro_expansion to pop back to the value we saved here. The
2371 macro expansion code promises to return only fully-expanded text,
2372 so we don't need to "push" more than one level.
2374 This is disgusting, of course. It would be cleaner to do all macro
2375 expansion beforehand, and then hand that to lexptr. But we don't
2376 really know where the expression ends. Remember, in a command like
2378 (gdb) break *ADDRESS if CONDITION
2380 we evaluate ADDRESS in the scope of the current frame, but we
2381 evaluate CONDITION in the scope of the breakpoint's location. So
2382 it's simply wrong to try to macro-expand the whole thing at once. */
2383 static const char *macro_original_text;
2385 /* We save all intermediate macro expansions on this obstack for the
2386 duration of a single parse. The expansion text may sometimes have
2387 to live past the end of the expansion, due to yacc lookahead.
2388 Rather than try to be clever about saving the data for a single
2389 token, we simply keep it all and delete it after parsing has
2391 static struct obstack expansion_obstack;
2394 scan_macro_expansion (char *expansion)
2398 /* We'd better not be trying to push the stack twice. */
2399 gdb_assert (! macro_original_text);
2401 /* Copy to the obstack, and then free the intermediate
2403 copy = (char *) obstack_copy0 (&expansion_obstack, expansion,
2404 strlen (expansion));
2407 /* Save the old lexptr value, so we can return to it when we're done
2408 parsing the expanded text. */
2409 macro_original_text = lexptr;
2414 scanning_macro_expansion (void)
2416 return macro_original_text != 0;
2420 finished_macro_expansion (void)
2422 /* There'd better be something to pop back to. */
2423 gdb_assert (macro_original_text);
2425 /* Pop back to the original text. */
2426 lexptr = macro_original_text;
2427 macro_original_text = 0;
2431 scan_macro_cleanup (void *dummy)
2433 if (macro_original_text)
2434 finished_macro_expansion ();
2436 obstack_free (&expansion_obstack, NULL);
2439 /* Return true iff the token represents a C++ cast operator. */
2442 is_cast_operator (const char *token, int len)
2444 return (! strncmp (token, "dynamic_cast", len)
2445 || ! strncmp (token, "static_cast", len)
2446 || ! strncmp (token, "reinterpret_cast", len)
2447 || ! strncmp (token, "const_cast", len));
2450 /* The scope used for macro expansion. */
2451 static struct macro_scope *expression_macro_scope;
2453 /* This is set if a NAME token appeared at the very end of the input
2454 string, with no whitespace separating the name from the EOF. This
2455 is used only when parsing to do field name completion. */
2456 static int saw_name_at_eof;
2458 /* This is set if the previously-returned token was a structure
2459 operator -- either '.' or ARROW. This is used only when parsing to
2460 do field name completion. */
2461 static int last_was_structop;
2463 /* Read one token, getting characters through lexptr. */
2466 lex_one_token (struct parser_state *par_state, int *is_quoted_name)
2471 const char *tokstart;
2472 int saw_structop = last_was_structop;
2475 last_was_structop = 0;
2476 *is_quoted_name = 0;
2480 /* Check if this is a macro invocation that we need to expand. */
2481 if (! scanning_macro_expansion ())
2483 char *expanded = macro_expand_next (&lexptr,
2484 standard_macro_lookup,
2485 expression_macro_scope);
2488 scan_macro_expansion (expanded);
2491 prev_lexptr = lexptr;
2494 /* See if it is a special token of length 3. */
2495 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2496 if (strncmp (tokstart, tokentab3[i].oper, 3) == 0)
2498 if ((tokentab3[i].flags & FLAG_CXX) != 0
2499 && parse_language (par_state)->la_language != language_cplus)
2503 yylval.opcode = tokentab3[i].opcode;
2504 return tokentab3[i].token;
2507 /* See if it is a special token of length 2. */
2508 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2509 if (strncmp (tokstart, tokentab2[i].oper, 2) == 0)
2511 if ((tokentab2[i].flags & FLAG_CXX) != 0
2512 && parse_language (par_state)->la_language != language_cplus)
2516 yylval.opcode = tokentab2[i].opcode;
2517 if (parse_completion && tokentab2[i].token == ARROW)
2518 last_was_structop = 1;
2519 return tokentab2[i].token;
2522 switch (c = *tokstart)
2525 /* If we were just scanning the result of a macro expansion,
2526 then we need to resume scanning the original text.
2527 If we're parsing for field name completion, and the previous
2528 token allows such completion, return a COMPLETE token.
2529 Otherwise, we were already scanning the original text, and
2530 we're really done. */
2531 if (scanning_macro_expansion ())
2533 finished_macro_expansion ();
2536 else if (saw_name_at_eof)
2538 saw_name_at_eof = 0;
2541 else if (saw_structop)
2556 if (parse_language (par_state)->la_language == language_objc
2563 if (paren_depth == 0)
2570 if (comma_terminates
2572 && ! scanning_macro_expansion ())
2578 /* Might be a floating point number. */
2579 if (lexptr[1] < '0' || lexptr[1] > '9')
2581 if (parse_completion)
2582 last_was_structop = 1;
2583 goto symbol; /* Nope, must be a symbol. */
2585 /* FALL THRU into number case. */
2598 /* It's a number. */
2599 int got_dot = 0, got_e = 0, toktype;
2600 const char *p = tokstart;
2601 int hex = input_radix > 10;
2603 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2608 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2616 /* This test includes !hex because 'e' is a valid hex digit
2617 and thus does not indicate a floating point number when
2618 the radix is hex. */
2619 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2620 got_dot = got_e = 1;
2621 /* This test does not include !hex, because a '.' always indicates
2622 a decimal floating point number regardless of the radix. */
2623 else if (!got_dot && *p == '.')
2625 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2626 && (*p == '-' || *p == '+'))
2627 /* This is the sign of the exponent, not the end of the
2630 /* We will take any letters or digits. parse_number will
2631 complain if past the radix, or if L or U are not final. */
2632 else if ((*p < '0' || *p > '9')
2633 && ((*p < 'a' || *p > 'z')
2634 && (*p < 'A' || *p > 'Z')))
2637 toktype = parse_number (par_state, tokstart, p - tokstart,
2638 got_dot|got_e, &yylval);
2639 if (toktype == ERROR)
2641 char *err_copy = (char *) alloca (p - tokstart + 1);
2643 memcpy (err_copy, tokstart, p - tokstart);
2644 err_copy[p - tokstart] = 0;
2645 error (_("Invalid number \"%s\"."), err_copy);
2653 const char *p = &tokstart[1];
2654 size_t len = strlen ("entry");
2656 if (parse_language (par_state)->la_language == language_objc)
2658 size_t len = strlen ("selector");
2660 if (strncmp (p, "selector", len) == 0
2661 && (p[len] == '\0' || isspace (p[len])))
2670 while (isspace (*p))
2672 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2704 if (tokstart[1] != '"' && tokstart[1] != '\'')
2713 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2718 error (_("Empty character constant."));
2719 else if (host_len > 2 && c == '\'')
2722 namelen = lexptr - tokstart - 1;
2723 *is_quoted_name = 1;
2727 else if (host_len > 1)
2728 error (_("Invalid character constant."));
2734 if (!(c == '_' || c == '$'
2735 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2736 /* We must have come across a bad character (e.g. ';'). */
2737 error (_("Invalid character '%c' in expression."), c);
2739 /* It's a name. See how long it is. */
2741 for (c = tokstart[namelen];
2742 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2743 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2745 /* Template parameter lists are part of the name.
2746 FIXME: This mishandles `print $a<4&&$a>3'. */
2750 if (! is_cast_operator (tokstart, namelen))
2752 /* Scan ahead to get rest of the template specification. Note
2753 that we look ahead only when the '<' adjoins non-whitespace
2754 characters; for comparison expressions, e.g. "a < b > c",
2755 there must be spaces before the '<', etc. */
2756 const char *p = find_template_name_end (tokstart + namelen);
2759 namelen = p - tokstart;
2763 c = tokstart[++namelen];
2766 /* The token "if" terminates the expression and is NOT removed from
2767 the input stream. It doesn't count if it appears in the
2768 expansion of a macro. */
2770 && tokstart[0] == 'i'
2771 && tokstart[1] == 'f'
2772 && ! scanning_macro_expansion ())
2777 /* For the same reason (breakpoint conditions), "thread N"
2778 terminates the expression. "thread" could be an identifier, but
2779 an identifier is never followed by a number without intervening
2780 punctuation. "task" is similar. Handle abbreviations of these,
2781 similarly to breakpoint.c:find_condition_and_thread. */
2783 && (strncmp (tokstart, "thread", namelen) == 0
2784 || strncmp (tokstart, "task", namelen) == 0)
2785 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2786 && ! scanning_macro_expansion ())
2788 const char *p = tokstart + namelen + 1;
2790 while (*p == ' ' || *p == '\t')
2792 if (*p >= '0' && *p <= '9')
2800 yylval.sval.ptr = tokstart;
2801 yylval.sval.length = namelen;
2803 /* Catch specific keywords. */
2804 copy = copy_name (yylval.sval);
2805 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2806 if (strcmp (copy, ident_tokens[i].oper) == 0)
2808 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2809 && parse_language (par_state)->la_language != language_cplus)
2812 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2814 struct field_of_this_result is_a_field_of_this;
2816 if (lookup_symbol (copy, expression_context_block,
2818 (parse_language (par_state)->la_language
2819 == language_cplus ? &is_a_field_of_this
2823 /* The keyword is shadowed. */
2828 /* It is ok to always set this, even though we don't always
2829 strictly need to. */
2830 yylval.opcode = ident_tokens[i].opcode;
2831 return ident_tokens[i].token;
2834 if (*tokstart == '$')
2837 if (parse_completion && *lexptr == '\0')
2838 saw_name_at_eof = 1;
2840 yylval.ssym.stoken = yylval.sval;
2841 yylval.ssym.sym.symbol = NULL;
2842 yylval.ssym.sym.block = NULL;
2843 yylval.ssym.is_a_field_of_this = 0;
2847 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2854 DEF_VEC_O (token_and_value);
2856 /* A FIFO of tokens that have been read but not yet returned to the
2858 static VEC (token_and_value) *token_fifo;
2860 /* Non-zero if the lexer should return tokens from the FIFO. */
2863 /* Temporary storage for c_lex; this holds symbol names as they are
2865 static struct obstack name_obstack;
2867 /* Classify a NAME token. The contents of the token are in `yylval'.
2868 Updates yylval and returns the new token type. BLOCK is the block
2869 in which lookups start; this can be NULL to mean the global scope.
2870 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2871 in single quotes. */
2874 classify_name (struct parser_state *par_state, const struct block *block,
2877 struct block_symbol bsym;
2879 struct field_of_this_result is_a_field_of_this;
2881 copy = copy_name (yylval.sval);
2883 /* Initialize this in case we *don't* use it in this call; that way
2884 we can refer to it unconditionally below. */
2885 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2887 bsym = lookup_symbol (copy, block, VAR_DOMAIN,
2888 parse_language (par_state)->la_name_of_this
2889 ? &is_a_field_of_this : NULL);
2891 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK)
2893 yylval.ssym.sym = bsym;
2894 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2897 else if (!bsym.symbol)
2899 /* If we found a field of 'this', we might have erroneously
2900 found a constructor where we wanted a type name. Handle this
2901 case by noticing that we found a constructor and then look up
2902 the type tag instead. */
2903 if (is_a_field_of_this.type != NULL
2904 && is_a_field_of_this.fn_field != NULL
2905 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2908 struct field_of_this_result inner_is_a_field_of_this;
2910 bsym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2911 &inner_is_a_field_of_this);
2912 if (bsym.symbol != NULL)
2914 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2919 /* If we found a field, then we want to prefer it over a
2920 filename. However, if the name was quoted, then it is better
2921 to check for a filename or a block, since this is the only
2922 way the user has of requiring the extension to be used. */
2923 if (is_a_field_of_this.type == NULL || is_quoted_name)
2925 /* See if it's a file name. */
2926 struct symtab *symtab;
2928 symtab = lookup_symtab (copy);
2931 yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab),
2938 if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF)
2940 yylval.tsym.type = SYMBOL_TYPE (bsym.symbol);
2944 /* See if it's an ObjC classname. */
2945 if (parse_language (par_state)->la_language == language_objc && !bsym.symbol)
2947 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2952 yylval.theclass.theclass = Class;
2953 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2955 yylval.theclass.type = SYMBOL_TYPE (sym);
2960 /* Input names that aren't symbols but ARE valid hex numbers, when
2961 the input radix permits them, can be names or numbers depending
2962 on the parse. Note we support radixes > 16 here. */
2964 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2965 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2967 YYSTYPE newlval; /* Its value is ignored. */
2968 int hextype = parse_number (par_state, copy, yylval.sval.length,
2973 yylval.ssym.sym = bsym;
2974 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2979 /* Any other kind of symbol */
2980 yylval.ssym.sym = bsym;
2981 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2983 if (bsym.symbol == NULL
2984 && parse_language (par_state)->la_language == language_cplus
2985 && is_a_field_of_this.type == NULL
2986 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
2987 return UNKNOWN_CPP_NAME;
2992 /* Like classify_name, but used by the inner loop of the lexer, when a
2993 name might have already been seen. CONTEXT is the context type, or
2994 NULL if this is the first component of a name. */
2997 classify_inner_name (struct parser_state *par_state,
2998 const struct block *block, struct type *context)
3003 if (context == NULL)
3004 return classify_name (par_state, block, 0);
3006 type = check_typedef (context);
3007 if (!type_aggregate_p (type))
3010 copy = copy_name (yylval.ssym.stoken);
3011 /* N.B. We assume the symbol can only be in VAR_DOMAIN. */
3012 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN);
3014 /* If no symbol was found, search for a matching base class named
3015 COPY. This will allow users to enter qualified names of class members
3016 relative to the `this' pointer. */
3017 if (yylval.ssym.sym.symbol == NULL)
3019 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3021 if (base_type != NULL)
3023 yylval.tsym.type = base_type;
3030 switch (SYMBOL_CLASS (yylval.ssym.sym.symbol))
3034 /* cp_lookup_nested_symbol might have accidentally found a constructor
3035 named COPY when we really wanted a base class of the same name.
3036 Double-check this case by looking for a base class. */
3038 struct type *base_type = cp_find_type_baseclass_by_name (type, copy);
3040 if (base_type != NULL)
3042 yylval.tsym.type = base_type;
3049 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol);
3055 internal_error (__FILE__, __LINE__, _("not reached"));
3058 /* The outer level of a two-level lexer. This calls the inner lexer
3059 to return tokens. It then either returns these tokens, or
3060 aggregates them into a larger token. This lets us work around a
3061 problem in our parsing approach, where the parser could not
3062 distinguish between qualified names and qualified types at the
3065 This approach is still not ideal, because it mishandles template
3066 types. See the comment in lex_one_token for an example. However,
3067 this is still an improvement over the earlier approach, and will
3068 suffice until we move to better parsing technology. */
3073 token_and_value current;
3074 int first_was_coloncolon, last_was_coloncolon;
3075 struct type *context_type = NULL;
3076 int last_to_examine, next_to_examine, checkpoint;
3077 const struct block *search_block;
3080 if (popping && !VEC_empty (token_and_value, token_fifo))
3084 /* Read the first token and decide what to do. Most of the
3085 subsequent code is C++-only; but also depends on seeing a "::" or
3087 current.token = lex_one_token (pstate, &is_quoted_name);
3088 if (current.token == NAME)
3089 current.token = classify_name (pstate, expression_context_block,
3091 if (parse_language (pstate)->la_language != language_cplus
3092 || (current.token != TYPENAME && current.token != COLONCOLON
3093 && current.token != FILENAME))
3094 return current.token;
3096 /* Read any sequence of alternating "::" and name-like tokens into
3098 current.value = yylval;
3099 VEC_safe_push (token_and_value, token_fifo, ¤t);
3100 last_was_coloncolon = current.token == COLONCOLON;
3105 /* We ignore quoted names other than the very first one.
3106 Subsequent ones do not have any special meaning. */
3107 current.token = lex_one_token (pstate, &ignore);
3108 current.value = yylval;
3109 VEC_safe_push (token_and_value, token_fifo, ¤t);
3111 if ((last_was_coloncolon && current.token != NAME)
3112 || (!last_was_coloncolon && current.token != COLONCOLON))
3114 last_was_coloncolon = !last_was_coloncolon;
3118 /* We always read one extra token, so compute the number of tokens
3119 to examine accordingly. */
3120 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3121 next_to_examine = 0;
3123 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3126 obstack_free (&name_obstack, obstack_base (&name_obstack));
3128 if (current.token == FILENAME)
3129 search_block = current.value.bval;
3130 else if (current.token == COLONCOLON)
3131 search_block = NULL;
3134 gdb_assert (current.token == TYPENAME);
3135 search_block = expression_context_block;
3136 obstack_grow (&name_obstack, current.value.sval.ptr,
3137 current.value.sval.length);
3138 context_type = current.value.tsym.type;
3142 first_was_coloncolon = current.token == COLONCOLON;
3143 last_was_coloncolon = first_was_coloncolon;
3145 while (next_to_examine <= last_to_examine)
3147 token_and_value *next;
3149 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3152 if (next->token == NAME && last_was_coloncolon)
3156 yylval = next->value;
3157 classification = classify_inner_name (pstate, search_block,
3159 /* We keep going until we either run out of names, or until
3160 we have a qualified name which is not a type. */
3161 if (classification != TYPENAME && classification != NAME)
3164 /* Accept up to this token. */
3165 checkpoint = next_to_examine;
3167 /* Update the partial name we are constructing. */
3168 if (context_type != NULL)
3170 /* We don't want to put a leading "::" into the name. */
3171 obstack_grow_str (&name_obstack, "::");
3173 obstack_grow (&name_obstack, next->value.sval.ptr,
3174 next->value.sval.length);
3176 yylval.sval.ptr = obstack_base (&name_obstack);
3177 yylval.sval.length = obstack_object_size (&name_obstack);
3178 current.value = yylval;
3179 current.token = classification;
3181 last_was_coloncolon = 0;
3183 if (classification == NAME)
3186 context_type = yylval.tsym.type;
3188 else if (next->token == COLONCOLON && !last_was_coloncolon)
3189 last_was_coloncolon = 1;
3192 /* We've reached the end of the name. */
3197 /* If we have a replacement token, install it as the first token in
3198 the FIFO, and delete the other constituent tokens. */
3201 current.value.sval.ptr
3202 = (const char *) 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 = (char *) 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);