1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986-2014 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. */
41 #include "expression.h"
43 #include "parser-defs.h"
46 #include "bfd.h" /* Required by objfiles.h. */
47 #include "symfile.h" /* Required by objfiles.h. */
48 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
51 #include "cp-support.h"
53 #include "gdb_assert.h"
54 #include "macroscope.h"
55 #include "objc-lang.h"
56 #include "typeprint.h"
59 #define parse_type(ps) builtin_type (parse_gdbarch (ps))
61 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
62 as well as gratuitiously global symbol names, so we can have multiple
63 yacc generated parsers in gdb. Note that these are only the variables
64 produced by yacc. If other parser generators (bison, byacc, etc) produce
65 additional global names that conflict at link time, then those parser
66 generators need to be fixed instead of adding those names to this list. */
68 #define yymaxdepth c_maxdepth
69 #define yyparse c_parse_internal
71 #define yyerror c_error
74 #define yydebug c_debug
83 #define yyerrflag c_errflag
84 #define yynerrs c_nerrs
89 #define yystate c_state
95 #define yyreds c_reds /* With YYDEBUG defined */
96 #define yytoks c_toks /* With YYDEBUG defined */
97 #define yyname c_name /* With YYDEBUG defined */
98 #define yyrule c_rule /* With YYDEBUG defined */
100 #define yylen c_yylen
101 #define yydefred c_yydefred
102 #define yydgoto c_yydgoto
103 #define yysindex c_yysindex
104 #define yyrindex c_yyrindex
105 #define yygindex c_yygindex
106 #define yytable c_yytable
107 #define yycheck c_yycheck
109 #define yysslim c_yysslim
110 #define yyssp c_yyssp
111 #define yystacksize c_yystacksize
113 #define yyvsp c_yyvsp
116 #define YYDEBUG 1 /* Default to yydebug support */
119 #define YYFPRINTF parser_fprintf
121 /* The state of the parser, used internally when we are parsing the
124 static struct parser_state *pstate = NULL;
128 static int yylex (void);
130 void yyerror (char *);
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;
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 class;
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 <class> CLASSNAME /* ObjC Class name */
220 %type <svec> string_exp
221 %type <ssym> name_not_typename
222 %type <tsym> typename
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
241 %type <sval> operator
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 class = 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) class);
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.class);
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 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 = $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);
929 error (_("No file or function \"%s\"."),
930 copy_name ($1.stoken));
938 block : block COLONCOLON name
940 = lookup_symbol (copy_name ($3), $1,
942 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
943 error (_("No function \"%s\" in specified context."),
945 $$ = SYMBOL_BLOCK_VALUE (tem); }
948 variable: name_not_typename ENTRY
949 { struct symbol *sym = $1.sym;
951 if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym)
952 || !symbol_read_needs_frame (sym))
953 error (_("@entry can be used only for function "
954 "parameters, not for \"%s\""),
955 copy_name ($1.stoken));
957 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
958 write_exp_elt_sym (pstate, sym);
959 write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE);
963 variable: block COLONCOLON name
964 { struct symbol *sym;
965 sym = lookup_symbol (copy_name ($3), $1,
968 error (_("No symbol \"%s\" in specified context."),
970 if (symbol_read_needs_frame (sym))
972 if (innermost_block == 0
973 || contained_in (block_found,
975 innermost_block = block_found;
978 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
979 /* block_found is set by lookup_symbol. */
980 write_exp_elt_block (pstate, block_found);
981 write_exp_elt_sym (pstate, sym);
982 write_exp_elt_opcode (pstate, OP_VAR_VALUE); }
985 qualified_name: TYPENAME COLONCOLON name
987 struct type *type = $1.type;
988 CHECK_TYPEDEF (type);
989 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
990 && TYPE_CODE (type) != TYPE_CODE_UNION
991 && TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
992 error (_("`%s' is not defined as an aggregate type."),
993 TYPE_SAFE_NAME (type));
995 write_exp_elt_opcode (pstate, OP_SCOPE);
996 write_exp_elt_type (pstate, type);
997 write_exp_string (pstate, $3);
998 write_exp_elt_opcode (pstate, OP_SCOPE);
1000 | TYPENAME COLONCOLON '~' name
1002 struct type *type = $1.type;
1003 struct stoken tmp_token;
1006 CHECK_TYPEDEF (type);
1007 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
1008 && TYPE_CODE (type) != TYPE_CODE_UNION
1009 && TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
1010 error (_("`%s' is not defined as an aggregate type."),
1011 TYPE_SAFE_NAME (type));
1012 buf = alloca ($4.length + 2);
1013 tmp_token.ptr = buf;
1014 tmp_token.length = $4.length + 1;
1016 memcpy (buf+1, $4.ptr, $4.length);
1017 buf[tmp_token.length] = 0;
1019 /* Check for valid destructor name. */
1020 destructor_name_p (tmp_token.ptr, $1.type);
1021 write_exp_elt_opcode (pstate, OP_SCOPE);
1022 write_exp_elt_type (pstate, type);
1023 write_exp_string (pstate, tmp_token);
1024 write_exp_elt_opcode (pstate, OP_SCOPE);
1026 | TYPENAME COLONCOLON name COLONCOLON name
1028 char *copy = copy_name ($3);
1029 error (_("No type \"%s\" within class "
1030 "or namespace \"%s\"."),
1031 copy, TYPE_SAFE_NAME ($1.type));
1035 variable: qualified_name
1036 | COLONCOLON name_not_typename
1038 char *name = copy_name ($2.stoken);
1040 struct bound_minimal_symbol msymbol;
1043 lookup_symbol (name, (const struct block *) NULL,
1047 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1048 write_exp_elt_block (pstate, NULL);
1049 write_exp_elt_sym (pstate, sym);
1050 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1054 msymbol = lookup_bound_minimal_symbol (name);
1055 if (msymbol.minsym != NULL)
1056 write_exp_msymbol (pstate, msymbol);
1057 else if (!have_full_symbols () && !have_partial_symbols ())
1058 error (_("No symbol table is loaded. Use the \"file\" command."));
1060 error (_("No symbol \"%s\" in current context."), name);
1064 variable: name_not_typename
1065 { struct symbol *sym = $1.sym;
1069 if (symbol_read_needs_frame (sym))
1071 if (innermost_block == 0
1072 || contained_in (block_found,
1074 innermost_block = block_found;
1077 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1078 /* We want to use the selected frame, not
1079 another more inner frame which happens to
1080 be in the same block. */
1081 write_exp_elt_block (pstate, NULL);
1082 write_exp_elt_sym (pstate, sym);
1083 write_exp_elt_opcode (pstate, OP_VAR_VALUE);
1085 else if ($1.is_a_field_of_this)
1087 /* C++: it hangs off of `this'. Must
1088 not inadvertently convert from a method call
1090 if (innermost_block == 0
1091 || contained_in (block_found,
1093 innermost_block = block_found;
1094 write_exp_elt_opcode (pstate, OP_THIS);
1095 write_exp_elt_opcode (pstate, OP_THIS);
1096 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1097 write_exp_string (pstate, $1.stoken);
1098 write_exp_elt_opcode (pstate, STRUCTOP_PTR);
1102 struct bound_minimal_symbol msymbol;
1103 char *arg = copy_name ($1.stoken);
1106 lookup_bound_minimal_symbol (arg);
1107 if (msymbol.minsym != NULL)
1108 write_exp_msymbol (pstate, msymbol);
1109 else if (!have_full_symbols () && !have_partial_symbols ())
1110 error (_("No symbol table is loaded. Use the \"file\" command."));
1112 error (_("No symbol \"%s\" in current context."),
1113 copy_name ($1.stoken));
1118 space_identifier : '@' NAME
1119 { insert_type_address_space (pstate, copy_name ($2.stoken)); }
1122 const_or_volatile: const_or_volatile_noopt
1126 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1129 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1130 | const_or_volatile_noopt
1133 const_or_volatile_or_space_identifier:
1134 const_or_volatile_or_space_identifier_noopt
1140 { insert_type (tp_pointer); }
1141 const_or_volatile_or_space_identifier
1143 { insert_type (tp_pointer); }
1144 const_or_volatile_or_space_identifier
1146 { insert_type (tp_reference); }
1148 { insert_type (tp_reference); }
1151 ptr_operator_ts: ptr_operator
1153 $$ = get_type_stack ();
1154 /* This cleanup is eventually run by
1156 make_cleanup (type_stack_cleanup, $$);
1160 abs_decl: ptr_operator_ts direct_abs_decl
1161 { $$ = append_type_stack ($2, $1); }
1166 direct_abs_decl: '(' abs_decl ')'
1168 | direct_abs_decl array_mod
1170 push_type_stack ($1);
1172 push_type (tp_array);
1173 $$ = get_type_stack ();
1178 push_type (tp_array);
1179 $$ = get_type_stack ();
1182 | direct_abs_decl func_mod
1184 push_type_stack ($1);
1186 $$ = get_type_stack ();
1191 $$ = get_type_stack ();
1201 | OBJC_LBRAC INT ']'
1207 | '(' parameter_typelist ')'
1211 /* We used to try to recognize pointer to member types here, but
1212 that didn't work (shift/reduce conflicts meant that these rules never
1213 got executed). The problem is that
1214 int (foo::bar::baz::bizzle)
1215 is a function type but
1216 int (foo::bar::baz::bizzle::*)
1217 is a pointer to member type. Stroustrup loses again! */
1222 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1226 { $$ = lookup_signed_typename (parse_language (pstate),
1227 parse_gdbarch (pstate),
1230 { $$ = lookup_signed_typename (parse_language (pstate),
1231 parse_gdbarch (pstate),
1234 { $$ = lookup_signed_typename (parse_language (pstate),
1235 parse_gdbarch (pstate),
1238 { $$ = lookup_signed_typename (parse_language (pstate),
1239 parse_gdbarch (pstate),
1241 | LONG SIGNED_KEYWORD INT_KEYWORD
1242 { $$ = lookup_signed_typename (parse_language (pstate),
1243 parse_gdbarch (pstate),
1245 | LONG SIGNED_KEYWORD
1246 { $$ = lookup_signed_typename (parse_language (pstate),
1247 parse_gdbarch (pstate),
1249 | SIGNED_KEYWORD LONG INT_KEYWORD
1250 { $$ = lookup_signed_typename (parse_language (pstate),
1251 parse_gdbarch (pstate),
1253 | UNSIGNED LONG INT_KEYWORD
1254 { $$ = lookup_unsigned_typename (parse_language (pstate),
1255 parse_gdbarch (pstate),
1257 | LONG UNSIGNED INT_KEYWORD
1258 { $$ = lookup_unsigned_typename (parse_language (pstate),
1259 parse_gdbarch (pstate),
1262 { $$ = lookup_unsigned_typename (parse_language (pstate),
1263 parse_gdbarch (pstate),
1266 { $$ = lookup_signed_typename (parse_language (pstate),
1267 parse_gdbarch (pstate),
1269 | LONG LONG INT_KEYWORD
1270 { $$ = lookup_signed_typename (parse_language (pstate),
1271 parse_gdbarch (pstate),
1273 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1274 { $$ = lookup_signed_typename (parse_language (pstate),
1275 parse_gdbarch (pstate),
1277 | LONG LONG SIGNED_KEYWORD
1278 { $$ = lookup_signed_typename (parse_language (pstate),
1279 parse_gdbarch (pstate),
1281 | SIGNED_KEYWORD LONG LONG
1282 { $$ = lookup_signed_typename (parse_language (pstate),
1283 parse_gdbarch (pstate),
1285 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1286 { $$ = lookup_signed_typename (parse_language (pstate),
1287 parse_gdbarch (pstate),
1289 | UNSIGNED LONG LONG
1290 { $$ = lookup_unsigned_typename (parse_language (pstate),
1291 parse_gdbarch (pstate),
1293 | UNSIGNED LONG LONG INT_KEYWORD
1294 { $$ = lookup_unsigned_typename (parse_language (pstate),
1295 parse_gdbarch (pstate),
1297 | LONG LONG UNSIGNED
1298 { $$ = lookup_unsigned_typename (parse_language (pstate),
1299 parse_gdbarch (pstate),
1301 | LONG LONG UNSIGNED INT_KEYWORD
1302 { $$ = lookup_unsigned_typename (parse_language (pstate),
1303 parse_gdbarch (pstate),
1306 { $$ = lookup_signed_typename (parse_language (pstate),
1307 parse_gdbarch (pstate),
1309 | SHORT SIGNED_KEYWORD INT_KEYWORD
1310 { $$ = lookup_signed_typename (parse_language (pstate),
1311 parse_gdbarch (pstate),
1313 | SHORT SIGNED_KEYWORD
1314 { $$ = lookup_signed_typename (parse_language (pstate),
1315 parse_gdbarch (pstate),
1317 | UNSIGNED SHORT INT_KEYWORD
1318 { $$ = lookup_unsigned_typename (parse_language (pstate),
1319 parse_gdbarch (pstate),
1322 { $$ = lookup_unsigned_typename (parse_language (pstate),
1323 parse_gdbarch (pstate),
1325 | SHORT UNSIGNED INT_KEYWORD
1326 { $$ = lookup_unsigned_typename (parse_language (pstate),
1327 parse_gdbarch (pstate),
1330 { $$ = lookup_typename (parse_language (pstate),
1331 parse_gdbarch (pstate),
1333 (struct block *) NULL,
1335 | LONG DOUBLE_KEYWORD
1336 { $$ = lookup_typename (parse_language (pstate),
1337 parse_gdbarch (pstate),
1339 (struct block *) NULL,
1342 { $$ = lookup_struct (copy_name ($2),
1343 expression_context_block); }
1346 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1349 | STRUCT name COMPLETE
1351 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1356 { $$ = lookup_struct (copy_name ($2),
1357 expression_context_block); }
1360 mark_completion_tag (TYPE_CODE_CLASS, "", 0);
1363 | CLASS name COMPLETE
1365 mark_completion_tag (TYPE_CODE_CLASS, $2.ptr,
1370 { $$ = lookup_union (copy_name ($2),
1371 expression_context_block); }
1374 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1377 | UNION name COMPLETE
1379 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1384 { $$ = lookup_enum (copy_name ($2),
1385 expression_context_block); }
1388 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1391 | ENUM name COMPLETE
1393 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1398 { $$ = lookup_unsigned_typename (parse_language (pstate),
1399 parse_gdbarch (pstate),
1400 TYPE_NAME($2.type)); }
1402 { $$ = lookup_unsigned_typename (parse_language (pstate),
1403 parse_gdbarch (pstate),
1405 | SIGNED_KEYWORD typename
1406 { $$ = lookup_signed_typename (parse_language (pstate),
1407 parse_gdbarch (pstate),
1408 TYPE_NAME($2.type)); }
1410 { $$ = lookup_signed_typename (parse_language (pstate),
1411 parse_gdbarch (pstate),
1413 /* It appears that this rule for templates is never
1414 reduced; template recognition happens by lookahead
1415 in the token processing code in yylex. */
1416 | TEMPLATE name '<' type '>'
1417 { $$ = lookup_template_type(copy_name($2), $4,
1418 expression_context_block);
1420 | const_or_volatile_or_space_identifier_noopt typebase
1421 { $$ = follow_types ($2); }
1422 | typebase const_or_volatile_or_space_identifier_noopt
1423 { $$ = follow_types ($1); }
1429 $$.stoken.ptr = "int";
1430 $$.stoken.length = 3;
1431 $$.type = lookup_signed_typename (parse_language (pstate),
1432 parse_gdbarch (pstate),
1437 $$.stoken.ptr = "long";
1438 $$.stoken.length = 4;
1439 $$.type = lookup_signed_typename (parse_language (pstate),
1440 parse_gdbarch (pstate),
1445 $$.stoken.ptr = "short";
1446 $$.stoken.length = 5;
1447 $$.type = lookup_signed_typename (parse_language (pstate),
1448 parse_gdbarch (pstate),
1455 { check_parameter_typelist ($1); }
1456 | nonempty_typelist ',' DOTDOTDOT
1458 VEC_safe_push (type_ptr, $1, NULL);
1459 check_parameter_typelist ($1);
1467 VEC (type_ptr) *typelist = NULL;
1468 VEC_safe_push (type_ptr, typelist, $1);
1471 | nonempty_typelist ',' type
1473 VEC_safe_push (type_ptr, $1, $3);
1481 push_type_stack ($2);
1482 $$ = follow_types ($1);
1486 conversion_type_id: typebase conversion_declarator
1487 { $$ = follow_types ($1); }
1490 conversion_declarator: /* Nothing. */
1491 | ptr_operator conversion_declarator
1494 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1495 | VOLATILE_KEYWORD CONST_KEYWORD
1498 const_or_volatile_noopt: const_and_volatile
1499 { insert_type (tp_const);
1500 insert_type (tp_volatile);
1503 { insert_type (tp_const); }
1505 { insert_type (tp_volatile); }
1508 operator: OPERATOR NEW
1509 { $$ = operator_stoken (" new"); }
1511 { $$ = operator_stoken (" delete"); }
1512 | OPERATOR NEW '[' ']'
1513 { $$ = operator_stoken (" new[]"); }
1514 | OPERATOR DELETE '[' ']'
1515 { $$ = operator_stoken (" delete[]"); }
1516 | OPERATOR NEW OBJC_LBRAC ']'
1517 { $$ = operator_stoken (" new[]"); }
1518 | OPERATOR DELETE OBJC_LBRAC ']'
1519 { $$ = operator_stoken (" delete[]"); }
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 ("!"); }
1541 { $$ = operator_stoken ("="); }
1543 { $$ = operator_stoken ("<"); }
1545 { $$ = operator_stoken (">"); }
1546 | OPERATOR ASSIGN_MODIFY
1547 { const char *op = "unknown";
1571 case BINOP_BITWISE_IOR:
1574 case BINOP_BITWISE_AND:
1577 case BINOP_BITWISE_XOR:
1584 $$ = operator_stoken (op);
1587 { $$ = operator_stoken ("<<"); }
1589 { $$ = operator_stoken (">>"); }
1591 { $$ = operator_stoken ("=="); }
1593 { $$ = operator_stoken ("!="); }
1595 { $$ = operator_stoken ("<="); }
1597 { $$ = operator_stoken (">="); }
1599 { $$ = operator_stoken ("&&"); }
1601 { $$ = operator_stoken ("||"); }
1602 | OPERATOR INCREMENT
1603 { $$ = operator_stoken ("++"); }
1604 | OPERATOR DECREMENT
1605 { $$ = operator_stoken ("--"); }
1607 { $$ = operator_stoken (","); }
1608 | OPERATOR ARROW_STAR
1609 { $$ = operator_stoken ("->*"); }
1611 { $$ = operator_stoken ("->"); }
1613 { $$ = operator_stoken ("()"); }
1615 { $$ = operator_stoken ("[]"); }
1616 | OPERATOR OBJC_LBRAC ']'
1617 { $$ = operator_stoken ("[]"); }
1618 | OPERATOR conversion_type_id
1621 struct ui_file *buf = mem_fileopen ();
1623 c_print_type ($2, NULL, buf, -1, 0,
1624 &type_print_raw_options);
1625 name = ui_file_xstrdup (buf, &length);
1626 ui_file_delete (buf);
1627 $$ = operator_stoken (name);
1634 name : NAME { $$ = $1.stoken; }
1635 | BLOCKNAME { $$ = $1.stoken; }
1636 | TYPENAME { $$ = $1.stoken; }
1637 | NAME_OR_INT { $$ = $1.stoken; }
1638 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1639 | operator { $$ = $1; }
1642 name_not_typename : NAME
1644 /* These would be useful if name_not_typename was useful, but it is just
1645 a fake for "variable", so these cause reduce/reduce conflicts because
1646 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1647 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1648 context where only a name could occur, this might be useful.
1653 struct field_of_this_result is_a_field_of_this;
1656 $$.sym = lookup_symbol ($1.ptr,
1657 expression_context_block,
1659 &is_a_field_of_this);
1660 $$.is_a_field_of_this
1661 = is_a_field_of_this.type != NULL;
1668 /* Like write_exp_string, but prepends a '~'. */
1671 write_destructor_name (struct parser_state *par_state, struct stoken token)
1673 char *copy = alloca (token.length + 1);
1676 memcpy (©[1], token.ptr, token.length);
1681 write_exp_string (par_state, token);
1684 /* Returns a stoken of the operator name given by OP (which does not
1685 include the string "operator"). */
1686 static struct stoken
1687 operator_stoken (const char *op)
1689 static const char *operator_string = "operator";
1690 struct stoken st = { NULL, 0 };
1693 st.length = strlen (operator_string) + strlen (op);
1694 buf = malloc (st.length + 1);
1695 strcpy (buf, operator_string);
1699 /* The toplevel (c_parse) will free the memory allocated here. */
1700 make_cleanup (free, buf);
1704 /* Validate a parameter typelist. */
1707 check_parameter_typelist (VEC (type_ptr) *params)
1712 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1714 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1718 if (VEC_length (type_ptr, params) == 1)
1723 VEC_free (type_ptr, params);
1724 error (_("parameter types following 'void'"));
1728 VEC_free (type_ptr, params);
1729 error (_("'void' invalid as parameter type"));
1735 /* Take care of parsing a number (anything that starts with a digit).
1736 Set yylval and return the token type; update lexptr.
1737 LEN is the number of characters in it. */
1739 /*** Needs some error checking for the float case ***/
1742 parse_number (struct parser_state *par_state,
1743 const char *buf, int len, int parsed_float, YYSTYPE *putithere)
1745 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1746 here, and we do kind of silly things like cast to unsigned. */
1753 int base = input_radix;
1756 /* Number of "L" suffixes encountered. */
1759 /* We have found a "L" or "U" suffix. */
1760 int found_suffix = 0;
1763 struct type *signed_type;
1764 struct type *unsigned_type;
1768 memcpy (p, buf, len);
1772 /* If it ends at "df", "dd" or "dl", take it as type of decimal floating
1773 point. Return DECFLOAT. */
1775 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1778 putithere->typed_val_decfloat.type
1779 = parse_type (par_state)->builtin_decfloat;
1780 decimal_from_string (putithere->typed_val_decfloat.val, 4,
1781 gdbarch_byte_order (parse_gdbarch (par_state)),
1787 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1790 putithere->typed_val_decfloat.type
1791 = parse_type (par_state)->builtin_decdouble;
1792 decimal_from_string (putithere->typed_val_decfloat.val, 8,
1793 gdbarch_byte_order (parse_gdbarch (par_state)),
1799 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1802 putithere->typed_val_decfloat.type
1803 = parse_type (par_state)->builtin_declong;
1804 decimal_from_string (putithere->typed_val_decfloat.val, 16,
1805 gdbarch_byte_order (parse_gdbarch (par_state)),
1811 if (! parse_c_float (parse_gdbarch (par_state), p, len,
1812 &putithere->typed_val_float.dval,
1813 &putithere->typed_val_float.type))
1818 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1862 if (c >= 'A' && c <= 'Z')
1864 if (c != 'l' && c != 'u')
1866 if (c >= '0' && c <= '9')
1874 if (base > 10 && c >= 'a' && c <= 'f')
1878 n += i = c - 'a' + 10;
1891 return ERROR; /* Char not a digit */
1894 return ERROR; /* Invalid digit in this base */
1896 /* Portably test for overflow (only works for nonzero values, so make
1897 a second check for zero). FIXME: Can't we just make n and prevn
1898 unsigned and avoid this? */
1899 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1900 unsigned_p = 1; /* Try something unsigned */
1902 /* Portably test for unsigned overflow.
1903 FIXME: This check is wrong; for example it doesn't find overflow
1904 on 0x123456789 when LONGEST is 32 bits. */
1905 if (c != 'l' && c != 'u' && n != 0)
1907 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1908 error (_("Numeric constant too large."));
1913 /* An integer constant is an int, a long, or a long long. An L
1914 suffix forces it to be long; an LL suffix forces it to be long
1915 long. If not forced to a larger size, it gets the first type of
1916 the above that it fits in. To figure out whether it fits, we
1917 shift it right and see whether anything remains. Note that we
1918 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1919 operation, because many compilers will warn about such a shift
1920 (which always produces a zero result). Sometimes gdbarch_int_bit
1921 or gdbarch_long_bit will be that big, sometimes not. To deal with
1922 the case where it is we just always shift the value more than
1923 once, with fewer bits each time. */
1925 un = (ULONGEST)n >> 2;
1927 && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0)
1930 = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1);
1932 /* A large decimal (not hex or octal) constant (between INT_MAX
1933 and UINT_MAX) is a long or unsigned long, according to ANSI,
1934 never an unsigned int, but this code treats it as unsigned
1935 int. This probably should be fixed. GCC gives a warning on
1938 unsigned_type = parse_type (par_state)->builtin_unsigned_int;
1939 signed_type = parse_type (par_state)->builtin_int;
1941 else if (long_p <= 1
1942 && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0)
1945 = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1);
1946 unsigned_type = parse_type (par_state)->builtin_unsigned_long;
1947 signed_type = parse_type (par_state)->builtin_long;
1952 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1953 < gdbarch_long_long_bit (parse_gdbarch (par_state)))
1954 /* A long long does not fit in a LONGEST. */
1955 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1957 shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1);
1958 high_bit = (ULONGEST) 1 << shift;
1959 unsigned_type = parse_type (par_state)->builtin_unsigned_long_long;
1960 signed_type = parse_type (par_state)->builtin_long_long;
1963 putithere->typed_val_int.val = n;
1965 /* If the high bit of the worked out type is set then this number
1966 has to be unsigned. */
1968 if (unsigned_p || (n & high_bit))
1970 putithere->typed_val_int.type = unsigned_type;
1974 putithere->typed_val_int.type = signed_type;
1980 /* Temporary obstack used for holding strings. */
1981 static struct obstack tempbuf;
1982 static int tempbuf_init;
1984 /* Parse a C escape sequence. The initial backslash of the sequence
1985 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1986 last character of the sequence. If OUTPUT is not NULL, the
1987 translated form of the escape sequence will be written there. If
1988 OUTPUT is NULL, no output is written and the call will only affect
1989 *PTR. If an escape sequence is expressed in target bytes, then the
1990 entire sequence will simply be copied to OUTPUT. Return 1 if any
1991 character was emitted, 0 otherwise. */
1994 c_parse_escape (const char **ptr, struct obstack *output)
1996 const char *tokptr = *ptr;
1999 /* Some escape sequences undergo character set conversion. Those we
2003 /* Hex escapes do not undergo character set conversion, so keep
2004 the escape sequence for later. */
2007 obstack_grow_str (output, "\\x");
2009 if (!isxdigit (*tokptr))
2010 error (_("\\x escape without a following hex digit"));
2011 while (isxdigit (*tokptr))
2014 obstack_1grow (output, *tokptr);
2019 /* Octal escapes do not undergo character set conversion, so
2020 keep the escape sequence for later. */
2032 obstack_grow_str (output, "\\");
2034 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
2038 obstack_1grow (output, *tokptr);
2044 /* We handle UCNs later. We could handle them here, but that
2045 would mean a spurious error in the case where the UCN could
2046 be converted to the target charset but not the host
2052 int i, len = c == 'U' ? 8 : 4;
2055 obstack_1grow (output, '\\');
2056 obstack_1grow (output, *tokptr);
2059 if (!isxdigit (*tokptr))
2060 error (_("\\%c escape without a following hex digit"), c);
2061 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2064 obstack_1grow (output, *tokptr);
2070 /* We must pass backslash through so that it does not
2071 cause quoting during the second expansion. */
2074 obstack_grow_str (output, "\\\\");
2078 /* Escapes which undergo conversion. */
2081 obstack_1grow (output, '\a');
2086 obstack_1grow (output, '\b');
2091 obstack_1grow (output, '\f');
2096 obstack_1grow (output, '\n');
2101 obstack_1grow (output, '\r');
2106 obstack_1grow (output, '\t');
2111 obstack_1grow (output, '\v');
2115 /* GCC extension. */
2118 obstack_1grow (output, HOST_ESCAPE_CHAR);
2122 /* Backslash-newline expands to nothing at all. */
2128 /* A few escapes just expand to the character itself. */
2132 /* GCC extensions. */
2137 /* Unrecognized escapes turn into the character itself. */
2140 obstack_1grow (output, *tokptr);
2148 /* Parse a string or character literal from TOKPTR. The string or
2149 character may be wide or unicode. *OUTPTR is set to just after the
2150 end of the literal in the input string. The resulting token is
2151 stored in VALUE. This returns a token value, either STRING or
2152 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2153 number of host characters in the literal. */
2155 parse_string_or_char (const char *tokptr, const char **outptr,
2156 struct typed_stoken *value, int *host_chars)
2159 enum c_string_type type;
2162 /* Build the gdb internal form of the input string in tempbuf. Note
2163 that the buffer is null byte terminated *only* for the
2164 convenience of debugging gdb itself and printing the buffer
2165 contents when the buffer contains no embedded nulls. Gdb does
2166 not depend upon the buffer being null byte terminated, it uses
2167 the length string instead. This allows gdb to handle C strings
2168 (as well as strings in other languages) with embedded null
2174 obstack_free (&tempbuf, NULL);
2175 obstack_init (&tempbuf);
2177 /* Record the string type. */
2180 type = C_WIDE_STRING;
2183 else if (*tokptr == 'u')
2188 else if (*tokptr == 'U')
2193 else if (*tokptr == '@')
2195 /* An Objective C string. */
2203 /* Skip the quote. */
2217 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2219 else if (c == quote)
2223 obstack_1grow (&tempbuf, c);
2225 /* FIXME: this does the wrong thing with multi-byte host
2226 characters. We could use mbrlen here, but that would
2227 make "set host-charset" a bit less useful. */
2232 if (*tokptr != quote)
2235 error (_("Unterminated string in expression."));
2237 error (_("Unmatched single quote."));
2242 value->ptr = obstack_base (&tempbuf);
2243 value->length = obstack_object_size (&tempbuf);
2247 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2250 /* This is used to associate some attributes with a token. */
2254 /* If this bit is set, the token is C++-only. */
2258 /* If this bit is set, the token is conditional: if there is a
2259 symbol of the same name, then the token is a symbol; otherwise,
2260 the token is a keyword. */
2269 enum exp_opcode opcode;
2270 enum token_flags flags;
2273 static const struct token tokentab3[] =
2275 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2276 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2277 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2278 {"...", DOTDOTDOT, BINOP_END, 0}
2281 static const struct token tokentab2[] =
2283 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2284 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2285 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2286 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2287 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2288 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2289 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2290 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2291 {"++", INCREMENT, BINOP_END, 0},
2292 {"--", DECREMENT, BINOP_END, 0},
2293 {"->", ARROW, BINOP_END, 0},
2294 {"&&", ANDAND, BINOP_END, 0},
2295 {"||", OROR, BINOP_END, 0},
2296 /* "::" is *not* only C++: gdb overrides its meaning in several
2297 different ways, e.g., 'filename'::func, function::variable. */
2298 {"::", COLONCOLON, BINOP_END, 0},
2299 {"<<", LSH, BINOP_END, 0},
2300 {">>", RSH, BINOP_END, 0},
2301 {"==", EQUAL, BINOP_END, 0},
2302 {"!=", NOTEQUAL, BINOP_END, 0},
2303 {"<=", LEQ, BINOP_END, 0},
2304 {">=", GEQ, BINOP_END, 0},
2305 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2308 /* Identifier-like tokens. */
2309 static const struct token ident_tokens[] =
2311 {"unsigned", UNSIGNED, OP_NULL, 0},
2312 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2313 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2314 {"struct", STRUCT, OP_NULL, 0},
2315 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2316 {"sizeof", SIZEOF, OP_NULL, 0},
2317 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2318 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2319 {"class", CLASS, OP_NULL, FLAG_CXX},
2320 {"union", UNION, OP_NULL, 0},
2321 {"short", SHORT, OP_NULL, 0},
2322 {"const", CONST_KEYWORD, OP_NULL, 0},
2323 {"enum", ENUM, OP_NULL, 0},
2324 {"long", LONG, OP_NULL, 0},
2325 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2326 {"int", INT_KEYWORD, OP_NULL, 0},
2327 {"new", NEW, OP_NULL, FLAG_CXX},
2328 {"delete", DELETE, OP_NULL, FLAG_CXX},
2329 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2331 {"and", ANDAND, BINOP_END, FLAG_CXX},
2332 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2333 {"bitand", '&', OP_NULL, FLAG_CXX},
2334 {"bitor", '|', OP_NULL, FLAG_CXX},
2335 {"compl", '~', OP_NULL, FLAG_CXX},
2336 {"not", '!', OP_NULL, FLAG_CXX},
2337 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2338 {"or", OROR, BINOP_END, FLAG_CXX},
2339 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2340 {"xor", '^', OP_NULL, FLAG_CXX},
2341 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2343 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2344 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2345 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2346 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2348 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2349 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2350 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2351 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2352 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2354 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2357 /* When we find that lexptr (the global var defined in parse.c) is
2358 pointing at a macro invocation, we expand the invocation, and call
2359 scan_macro_expansion to save the old lexptr here and point lexptr
2360 into the expanded text. When we reach the end of that, we call
2361 end_macro_expansion to pop back to the value we saved here. The
2362 macro expansion code promises to return only fully-expanded text,
2363 so we don't need to "push" more than one level.
2365 This is disgusting, of course. It would be cleaner to do all macro
2366 expansion beforehand, and then hand that to lexptr. But we don't
2367 really know where the expression ends. Remember, in a command like
2369 (gdb) break *ADDRESS if CONDITION
2371 we evaluate ADDRESS in the scope of the current frame, but we
2372 evaluate CONDITION in the scope of the breakpoint's location. So
2373 it's simply wrong to try to macro-expand the whole thing at once. */
2374 static const char *macro_original_text;
2376 /* We save all intermediate macro expansions on this obstack for the
2377 duration of a single parse. The expansion text may sometimes have
2378 to live past the end of the expansion, due to yacc lookahead.
2379 Rather than try to be clever about saving the data for a single
2380 token, we simply keep it all and delete it after parsing has
2382 static struct obstack expansion_obstack;
2385 scan_macro_expansion (char *expansion)
2389 /* We'd better not be trying to push the stack twice. */
2390 gdb_assert (! macro_original_text);
2392 /* Copy to the obstack, and then free the intermediate
2394 copy = obstack_copy0 (&expansion_obstack, expansion, strlen (expansion));
2397 /* Save the old lexptr value, so we can return to it when we're done
2398 parsing the expanded text. */
2399 macro_original_text = lexptr;
2405 scanning_macro_expansion (void)
2407 return macro_original_text != 0;
2412 finished_macro_expansion (void)
2414 /* There'd better be something to pop back to. */
2415 gdb_assert (macro_original_text);
2417 /* Pop back to the original text. */
2418 lexptr = macro_original_text;
2419 macro_original_text = 0;
2424 scan_macro_cleanup (void *dummy)
2426 if (macro_original_text)
2427 finished_macro_expansion ();
2429 obstack_free (&expansion_obstack, NULL);
2432 /* Return true iff the token represents a C++ cast operator. */
2435 is_cast_operator (const char *token, int len)
2437 return (! strncmp (token, "dynamic_cast", len)
2438 || ! strncmp (token, "static_cast", len)
2439 || ! strncmp (token, "reinterpret_cast", len)
2440 || ! strncmp (token, "const_cast", len));
2443 /* The scope used for macro expansion. */
2444 static struct macro_scope *expression_macro_scope;
2446 /* This is set if a NAME token appeared at the very end of the input
2447 string, with no whitespace separating the name from the EOF. This
2448 is used only when parsing to do field name completion. */
2449 static int saw_name_at_eof;
2451 /* This is set if the previously-returned token was a structure
2452 operator -- either '.' or ARROW. This is used only when parsing to
2453 do field name completion. */
2454 static int last_was_structop;
2456 /* Read one token, getting characters through lexptr. */
2459 lex_one_token (struct parser_state *par_state, int *is_quoted_name)
2464 const char *tokstart;
2465 int saw_structop = last_was_structop;
2468 last_was_structop = 0;
2469 *is_quoted_name = 0;
2473 /* Check if this is a macro invocation that we need to expand. */
2474 if (! scanning_macro_expansion ())
2476 char *expanded = macro_expand_next (&lexptr,
2477 standard_macro_lookup,
2478 expression_macro_scope);
2481 scan_macro_expansion (expanded);
2484 prev_lexptr = lexptr;
2487 /* See if it is a special token of length 3. */
2488 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2489 if (strncmp (tokstart, tokentab3[i].operator, 3) == 0)
2491 if ((tokentab3[i].flags & FLAG_CXX) != 0
2492 && parse_language (par_state)->la_language != language_cplus)
2496 yylval.opcode = tokentab3[i].opcode;
2497 return tokentab3[i].token;
2500 /* See if it is a special token of length 2. */
2501 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2502 if (strncmp (tokstart, tokentab2[i].operator, 2) == 0)
2504 if ((tokentab2[i].flags & FLAG_CXX) != 0
2505 && parse_language (par_state)->la_language != language_cplus)
2509 yylval.opcode = tokentab2[i].opcode;
2510 if (parse_completion && tokentab2[i].token == ARROW)
2511 last_was_structop = 1;
2512 return tokentab2[i].token;
2515 switch (c = *tokstart)
2518 /* If we were just scanning the result of a macro expansion,
2519 then we need to resume scanning the original text.
2520 If we're parsing for field name completion, and the previous
2521 token allows such completion, return a COMPLETE token.
2522 Otherwise, we were already scanning the original text, and
2523 we're really done. */
2524 if (scanning_macro_expansion ())
2526 finished_macro_expansion ();
2529 else if (saw_name_at_eof)
2531 saw_name_at_eof = 0;
2534 else if (saw_structop)
2549 if (parse_language (par_state)->la_language == language_objc
2556 if (paren_depth == 0)
2563 if (comma_terminates
2565 && ! scanning_macro_expansion ())
2571 /* Might be a floating point number. */
2572 if (lexptr[1] < '0' || lexptr[1] > '9')
2574 if (parse_completion)
2575 last_was_structop = 1;
2576 goto symbol; /* Nope, must be a symbol. */
2578 /* FALL THRU into number case. */
2591 /* It's a number. */
2592 int got_dot = 0, got_e = 0, toktype;
2593 const char *p = tokstart;
2594 int hex = input_radix > 10;
2596 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2601 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2609 /* This test includes !hex because 'e' is a valid hex digit
2610 and thus does not indicate a floating point number when
2611 the radix is hex. */
2612 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2613 got_dot = got_e = 1;
2614 /* This test does not include !hex, because a '.' always indicates
2615 a decimal floating point number regardless of the radix. */
2616 else if (!got_dot && *p == '.')
2618 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2619 && (*p == '-' || *p == '+'))
2620 /* This is the sign of the exponent, not the end of the
2623 /* We will take any letters or digits. parse_number will
2624 complain if past the radix, or if L or U are not final. */
2625 else if ((*p < '0' || *p > '9')
2626 && ((*p < 'a' || *p > 'z')
2627 && (*p < 'A' || *p > 'Z')))
2630 toktype = parse_number (par_state, tokstart, p - tokstart,
2631 got_dot|got_e, &yylval);
2632 if (toktype == ERROR)
2634 char *err_copy = (char *) alloca (p - tokstart + 1);
2636 memcpy (err_copy, tokstart, p - tokstart);
2637 err_copy[p - tokstart] = 0;
2638 error (_("Invalid number \"%s\"."), err_copy);
2646 const char *p = &tokstart[1];
2647 size_t len = strlen ("entry");
2649 if (parse_language (par_state)->la_language == language_objc)
2651 size_t len = strlen ("selector");
2653 if (strncmp (p, "selector", len) == 0
2654 && (p[len] == '\0' || isspace (p[len])))
2663 while (isspace (*p))
2665 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2697 if (tokstart[1] != '"' && tokstart[1] != '\'')
2706 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2711 error (_("Empty character constant."));
2712 else if (host_len > 2 && c == '\'')
2715 namelen = lexptr - tokstart - 1;
2716 *is_quoted_name = 1;
2720 else if (host_len > 1)
2721 error (_("Invalid character constant."));
2727 if (!(c == '_' || c == '$'
2728 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2729 /* We must have come across a bad character (e.g. ';'). */
2730 error (_("Invalid character '%c' in expression."), c);
2732 /* It's a name. See how long it is. */
2734 for (c = tokstart[namelen];
2735 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2736 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2738 /* Template parameter lists are part of the name.
2739 FIXME: This mishandles `print $a<4&&$a>3'. */
2743 if (! is_cast_operator (tokstart, namelen))
2745 /* Scan ahead to get rest of the template specification. Note
2746 that we look ahead only when the '<' adjoins non-whitespace
2747 characters; for comparison expressions, e.g. "a < b > c",
2748 there must be spaces before the '<', etc. */
2750 const char *p = find_template_name_end (tokstart + namelen);
2753 namelen = p - tokstart;
2757 c = tokstart[++namelen];
2760 /* The token "if" terminates the expression and is NOT removed from
2761 the input stream. It doesn't count if it appears in the
2762 expansion of a macro. */
2764 && tokstart[0] == 'i'
2765 && tokstart[1] == 'f'
2766 && ! scanning_macro_expansion ())
2771 /* For the same reason (breakpoint conditions), "thread N"
2772 terminates the expression. "thread" could be an identifier, but
2773 an identifier is never followed by a number without intervening
2774 punctuation. "task" is similar. Handle abbreviations of these,
2775 similarly to breakpoint.c:find_condition_and_thread. */
2777 && (strncmp (tokstart, "thread", namelen) == 0
2778 || strncmp (tokstart, "task", namelen) == 0)
2779 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2780 && ! scanning_macro_expansion ())
2782 const char *p = tokstart + namelen + 1;
2784 while (*p == ' ' || *p == '\t')
2786 if (*p >= '0' && *p <= '9')
2794 yylval.sval.ptr = tokstart;
2795 yylval.sval.length = namelen;
2797 /* Catch specific keywords. */
2798 copy = copy_name (yylval.sval);
2799 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2800 if (strcmp (copy, ident_tokens[i].operator) == 0)
2802 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2803 && parse_language (par_state)->la_language != language_cplus)
2806 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2808 struct field_of_this_result is_a_field_of_this;
2810 if (lookup_symbol (copy, expression_context_block,
2812 (parse_language (par_state)->la_language
2813 == language_cplus ? &is_a_field_of_this
2817 /* The keyword is shadowed. */
2822 /* It is ok to always set this, even though we don't always
2823 strictly need to. */
2824 yylval.opcode = ident_tokens[i].opcode;
2825 return ident_tokens[i].token;
2828 if (*tokstart == '$')
2831 if (parse_completion && *lexptr == '\0')
2832 saw_name_at_eof = 1;
2834 yylval.ssym.stoken = yylval.sval;
2835 yylval.ssym.sym = NULL;
2836 yylval.ssym.is_a_field_of_this = 0;
2840 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2847 DEF_VEC_O (token_and_value);
2849 /* A FIFO of tokens that have been read but not yet returned to the
2851 static VEC (token_and_value) *token_fifo;
2853 /* Non-zero if the lexer should return tokens from the FIFO. */
2856 /* Temporary storage for c_lex; this holds symbol names as they are
2858 static struct obstack name_obstack;
2860 /* Classify a NAME token. The contents of the token are in `yylval'.
2861 Updates yylval and returns the new token type. BLOCK is the block
2862 in which lookups start; this can be NULL to mean the global scope.
2863 IS_QUOTED_NAME is non-zero if the name token was originally quoted
2864 in single quotes. */
2866 classify_name (struct parser_state *par_state, const struct block *block,
2871 struct field_of_this_result is_a_field_of_this;
2873 copy = copy_name (yylval.sval);
2875 /* Initialize this in case we *don't* use it in this call; that way
2876 we can refer to it unconditionally below. */
2877 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2879 sym = lookup_symbol (copy, block, VAR_DOMAIN,
2880 parse_language (par_state)->la_name_of_this
2881 ? &is_a_field_of_this : NULL);
2883 if (sym && SYMBOL_CLASS (sym) == LOC_BLOCK)
2885 yylval.ssym.sym = sym;
2886 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2891 /* If we found a field of 'this', we might have erroneously
2892 found a constructor where we wanted a type name. Handle this
2893 case by noticing that we found a constructor and then look up
2894 the type tag instead. */
2895 if (is_a_field_of_this.type != NULL
2896 && is_a_field_of_this.fn_field != NULL
2897 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2900 struct field_of_this_result inner_is_a_field_of_this;
2902 sym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2903 &inner_is_a_field_of_this);
2906 yylval.tsym.type = SYMBOL_TYPE (sym);
2911 /* If we found a field, then we want to prefer it over a
2912 filename. However, if the name was quoted, then it is better
2913 to check for a filename or a block, since this is the only
2914 way the user has of requiring the extension to be used. */
2915 if (is_a_field_of_this.type == NULL || is_quoted_name)
2917 /* See if it's a file name. */
2918 struct symtab *symtab;
2920 symtab = lookup_symtab (copy);
2923 yylval.bval = BLOCKVECTOR_BLOCK (BLOCKVECTOR (symtab),
2930 if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
2932 yylval.tsym.type = SYMBOL_TYPE (sym);
2937 = language_lookup_primitive_type_by_name (parse_language (par_state),
2938 parse_gdbarch (par_state),
2940 if (yylval.tsym.type != NULL)
2943 /* See if it's an ObjC classname. */
2944 if (parse_language (par_state)->la_language == language_objc && !sym)
2946 CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy);
2949 yylval.class.class = Class;
2950 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2952 yylval.class.type = SYMBOL_TYPE (sym);
2957 /* Input names that aren't symbols but ARE valid hex numbers, when
2958 the input radix permits them, can be names or numbers depending
2959 on the parse. Note we support radixes > 16 here. */
2961 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2962 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2964 YYSTYPE newlval; /* Its value is ignored. */
2965 int hextype = parse_number (par_state, copy, yylval.sval.length,
2969 yylval.ssym.sym = sym;
2970 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2975 /* Any other kind of symbol */
2976 yylval.ssym.sym = sym;
2977 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2980 && parse_language (par_state)->la_language == language_cplus
2981 && is_a_field_of_this.type == NULL
2982 && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL)
2983 return UNKNOWN_CPP_NAME;
2988 /* Like classify_name, but used by the inner loop of the lexer, when a
2989 name might have already been seen. CONTEXT is the context type, or
2990 NULL if this is the first component of a name. */
2993 classify_inner_name (struct parser_state *par_state,
2994 const struct block *block, struct type *context)
2999 if (context == NULL)
3000 return classify_name (par_state, block, 0);
3002 type = check_typedef (context);
3003 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
3004 && TYPE_CODE (type) != TYPE_CODE_UNION
3005 && TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
3008 copy = copy_name (yylval.ssym.stoken);
3009 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block);
3011 /* If no symbol was found, search for a matching base class named
3012 COPY. This will allow users to enter qualified names of class members
3013 relative to the `this' pointer. */
3014 if (yylval.ssym.sym == NULL)
3016 struct type *base_type = find_type_baseclass_by_name (type, copy);
3018 if (base_type != NULL)
3020 yylval.tsym.type = base_type;
3027 switch (SYMBOL_CLASS (yylval.ssym.sym))
3031 /* cp_lookup_nested_symbol might have accidentally found a constructor
3032 named COPY when we really wanted a base class of the same name.
3033 Double-check this case by looking for a base class. */
3035 struct type *base_type = find_type_baseclass_by_name (type, copy);
3037 if (base_type != NULL)
3039 yylval.tsym.type = base_type;
3046 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym);;
3052 internal_error (__FILE__, __LINE__, _("not reached"));
3055 /* The outer level of a two-level lexer. This calls the inner lexer
3056 to return tokens. It then either returns these tokens, or
3057 aggregates them into a larger token. This lets us work around a
3058 problem in our parsing approach, where the parser could not
3059 distinguish between qualified names and qualified types at the
3062 This approach is still not ideal, because it mishandles template
3063 types. See the comment in lex_one_token for an example. However,
3064 this is still an improvement over the earlier approach, and will
3065 suffice until we move to better parsing technology. */
3069 token_and_value current;
3070 int first_was_coloncolon, last_was_coloncolon;
3071 struct type *context_type = NULL;
3072 int last_to_examine, next_to_examine, checkpoint;
3073 const struct block *search_block;
3076 if (popping && !VEC_empty (token_and_value, token_fifo))
3080 /* Read the first token and decide what to do. Most of the
3081 subsequent code is C++-only; but also depends on seeing a "::" or
3083 current.token = lex_one_token (pstate, &is_quoted_name);
3084 if (current.token == NAME)
3085 current.token = classify_name (pstate, expression_context_block,
3087 if (parse_language (pstate)->la_language != language_cplus
3088 || (current.token != TYPENAME && current.token != COLONCOLON
3089 && current.token != FILENAME))
3090 return current.token;
3092 /* Read any sequence of alternating "::" and name-like tokens into
3094 current.value = yylval;
3095 VEC_safe_push (token_and_value, token_fifo, ¤t);
3096 last_was_coloncolon = current.token == COLONCOLON;
3101 /* We ignore quoted names other than the very first one.
3102 Subsequent ones do not have any special meaning. */
3103 current.token = lex_one_token (pstate, &ignore);
3104 current.value = yylval;
3105 VEC_safe_push (token_and_value, token_fifo, ¤t);
3107 if ((last_was_coloncolon && current.token != NAME)
3108 || (!last_was_coloncolon && current.token != COLONCOLON))
3110 last_was_coloncolon = !last_was_coloncolon;
3114 /* We always read one extra token, so compute the number of tokens
3115 to examine accordingly. */
3116 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3117 next_to_examine = 0;
3119 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3122 obstack_free (&name_obstack, obstack_base (&name_obstack));
3124 if (current.token == FILENAME)
3125 search_block = current.value.bval;
3126 else if (current.token == COLONCOLON)
3127 search_block = NULL;
3130 gdb_assert (current.token == TYPENAME);
3131 search_block = expression_context_block;
3132 obstack_grow (&name_obstack, current.value.sval.ptr,
3133 current.value.sval.length);
3134 context_type = current.value.tsym.type;
3138 first_was_coloncolon = current.token == COLONCOLON;
3139 last_was_coloncolon = first_was_coloncolon;
3141 while (next_to_examine <= last_to_examine)
3143 token_and_value *next;
3145 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3148 if (next->token == NAME && last_was_coloncolon)
3152 yylval = next->value;
3153 classification = classify_inner_name (pstate, search_block,
3155 /* We keep going until we either run out of names, or until
3156 we have a qualified name which is not a type. */
3157 if (classification != TYPENAME && classification != NAME)
3160 /* Accept up to this token. */
3161 checkpoint = next_to_examine;
3163 /* Update the partial name we are constructing. */
3164 if (context_type != NULL)
3166 /* We don't want to put a leading "::" into the name. */
3167 obstack_grow_str (&name_obstack, "::");
3169 obstack_grow (&name_obstack, next->value.sval.ptr,
3170 next->value.sval.length);
3172 yylval.sval.ptr = obstack_base (&name_obstack);
3173 yylval.sval.length = obstack_object_size (&name_obstack);
3174 current.value = yylval;
3175 current.token = classification;
3177 last_was_coloncolon = 0;
3179 if (classification == NAME)
3182 context_type = yylval.tsym.type;
3184 else if (next->token == COLONCOLON && !last_was_coloncolon)
3185 last_was_coloncolon = 1;
3188 /* We've reached the end of the name. */
3193 /* If we have a replacement token, install it as the first token in
3194 the FIFO, and delete the other constituent tokens. */
3197 current.value.sval.ptr = obstack_copy0 (&expansion_obstack,
3198 current.value.sval.ptr,
3199 current.value.sval.length);
3201 VEC_replace (token_and_value, token_fifo, 0, ¤t);
3203 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3207 current = *VEC_index (token_and_value, token_fifo, 0);
3208 VEC_ordered_remove (token_and_value, token_fifo, 0);
3209 yylval = current.value;
3210 return current.token;
3214 c_parse (struct parser_state *par_state)
3217 struct cleanup *back_to;
3219 /* Setting up the parser state. */
3220 gdb_assert (par_state != NULL);
3223 back_to = make_cleanup (free_current_contents, &expression_macro_scope);
3224 make_cleanup_clear_parser_state (&pstate);
3226 /* Set up the scope for macro expansion. */
3227 expression_macro_scope = NULL;
3229 if (expression_context_block)
3230 expression_macro_scope
3231 = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3233 expression_macro_scope = default_macro_scope ();
3234 if (! expression_macro_scope)
3235 expression_macro_scope = user_macro_scope ();
3237 /* Initialize macro expansion code. */
3238 obstack_init (&expansion_obstack);
3239 gdb_assert (! macro_original_text);
3240 make_cleanup (scan_macro_cleanup, 0);
3242 make_cleanup_restore_integer (&yydebug);
3243 yydebug = parser_debug;
3245 /* Initialize some state used by the lexer. */
3246 last_was_structop = 0;
3247 saw_name_at_eof = 0;
3249 VEC_free (token_and_value, token_fifo);
3251 obstack_init (&name_obstack);
3252 make_cleanup_obstack_free (&name_obstack);
3254 result = yyparse ();
3255 do_cleanups (back_to);
3262 /* This is called via the YYPRINT macro when parser debugging is
3263 enabled. It prints a token's value. */
3266 c_print_token (FILE *file, int type, YYSTYPE value)
3271 fprintf (file, "typed_val_int<%s, %s>",
3272 TYPE_SAFE_NAME (value.typed_val_int.type),
3273 pulongest (value.typed_val_int.val));
3279 char *copy = alloca (value.tsval.length + 1);
3281 memcpy (copy, value.tsval.ptr, value.tsval.length);
3282 copy[value.tsval.length] = '\0';
3284 fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3290 fprintf (file, "sval<%s>", copy_name (value.sval));
3294 fprintf (file, "tsym<type=%s, name=%s>",
3295 TYPE_SAFE_NAME (value.tsym.type),
3296 copy_name (value.tsym.stoken));
3300 case UNKNOWN_CPP_NAME:
3303 fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3304 copy_name (value.ssym.stoken),
3305 (value.ssym.sym == NULL
3306 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym)),
3307 value.ssym.is_a_field_of_this);
3311 fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3322 lexptr = prev_lexptr;
3324 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);