1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986-2013 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. */
39 #include "gdb_string.h"
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 builtin_type (parse_gdbarch)
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
123 static int yylex (void);
125 void yyerror (char *);
129 /* Although the yacc "value" of an expression is not used,
130 since the result is stored in the structure being created,
131 other node types do have values. */
147 } typed_val_decfloat;
150 struct typed_stoken tsval;
152 struct symtoken ssym;
155 enum exp_opcode opcode;
157 struct stoken_vector svec;
158 VEC (type_ptr) *tvec;
160 struct type_stack *type_stack;
162 struct objc_class_str class;
166 /* YYSTYPE gets defined by %union */
167 static int parse_number (char *, int, int, YYSTYPE *);
168 static struct stoken operator_stoken (const char *);
169 static void check_parameter_typelist (VEC (type_ptr) *);
170 static void write_destructor_name (struct stoken);
172 static void c_print_token (FILE *file, int type, YYSTYPE value);
173 #define YYPRINT(FILE, TYPE, VALUE) c_print_token (FILE, TYPE, VALUE)
176 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly
178 %type <tval> type typebase
179 %type <tvec> nonempty_typelist func_mod parameter_typelist
180 /* %type <bval> block */
182 /* Fancy type parsing. */
184 %type <lval> array_mod
185 %type <tval> conversion_type_id
187 %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl
189 %token <typed_val_int> INT
190 %token <typed_val_float> FLOAT
191 %token <typed_val_decfloat> DECFLOAT
193 /* Both NAME and TYPENAME tokens represent symbols in the input,
194 and both convey their data as strings.
195 But a TYPENAME is a string that happens to be defined as a typedef
196 or builtin type name (such as int or char)
197 and a NAME is any other symbol.
198 Contexts where this distinction is not important can use the
199 nonterminal "name", which matches either NAME or TYPENAME. */
201 %token <tsval> STRING
202 %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */
203 %token SELECTOR /* ObjC "@selector" pseudo-operator */
205 %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */
206 %token <ssym> UNKNOWN_CPP_NAME
207 %token <voidval> COMPLETE
208 %token <tsym> TYPENAME
209 %token <class> CLASSNAME /* ObjC Class name */
211 %type <svec> string_exp
212 %type <ssym> name_not_typename
213 %type <tsym> typename
215 /* This is like a '[' token, but is only generated when parsing
216 Objective C. This lets us reuse the same parser without
217 erroneously parsing ObjC-specific expressions in C. */
220 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
221 but which would parse as a valid number in the current input radix.
222 E.g. "c" when input_radix==16. Depending on the parse, it will be
223 turned into a name or into a number. */
225 %token <ssym> NAME_OR_INT
228 %token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON
232 %type <sval> operator
233 %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
239 /* Special type cases, put in to allow the parser to distinguish different
241 %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
243 %token <sval> VARIABLE
245 %token <opcode> ASSIGN_MODIFY
254 %right '=' ASSIGN_MODIFY
262 %left '<' '>' LEQ GEQ
267 %right UNARY INCREMENT DECREMENT
268 %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '('
269 %token <ssym> BLOCKNAME
270 %token <bval> FILENAME
284 { write_exp_elt_opcode(OP_TYPE);
285 write_exp_elt_type($1);
286 write_exp_elt_opcode(OP_TYPE);}
289 write_exp_elt_opcode (OP_TYPEOF);
291 | TYPEOF '(' type ')'
293 write_exp_elt_opcode (OP_TYPE);
294 write_exp_elt_type ($3);
295 write_exp_elt_opcode (OP_TYPE);
297 | DECLTYPE '(' exp ')'
299 write_exp_elt_opcode (OP_DECLTYPE);
303 /* Expressions, including the comma operator. */
306 { write_exp_elt_opcode (BINOP_COMMA); }
309 /* Expressions, not including the comma operator. */
310 exp : '*' exp %prec UNARY
311 { write_exp_elt_opcode (UNOP_IND); }
314 exp : '&' exp %prec UNARY
315 { write_exp_elt_opcode (UNOP_ADDR); }
318 exp : '-' exp %prec UNARY
319 { write_exp_elt_opcode (UNOP_NEG); }
322 exp : '+' exp %prec UNARY
323 { write_exp_elt_opcode (UNOP_PLUS); }
326 exp : '!' exp %prec UNARY
327 { write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
330 exp : '~' exp %prec UNARY
331 { write_exp_elt_opcode (UNOP_COMPLEMENT); }
334 exp : INCREMENT exp %prec UNARY
335 { write_exp_elt_opcode (UNOP_PREINCREMENT); }
338 exp : DECREMENT exp %prec UNARY
339 { write_exp_elt_opcode (UNOP_PREDECREMENT); }
342 exp : exp INCREMENT %prec UNARY
343 { write_exp_elt_opcode (UNOP_POSTINCREMENT); }
346 exp : exp DECREMENT %prec UNARY
347 { write_exp_elt_opcode (UNOP_POSTDECREMENT); }
350 exp : TYPEID '(' exp ')' %prec UNARY
351 { write_exp_elt_opcode (OP_TYPEID); }
354 exp : TYPEID '(' type_exp ')' %prec UNARY
355 { write_exp_elt_opcode (OP_TYPEID); }
358 exp : SIZEOF exp %prec UNARY
359 { write_exp_elt_opcode (UNOP_SIZEOF); }
363 { write_exp_elt_opcode (STRUCTOP_PTR);
364 write_exp_string ($3);
365 write_exp_elt_opcode (STRUCTOP_PTR); }
368 exp : exp ARROW name COMPLETE
369 { mark_struct_expression ();
370 write_exp_elt_opcode (STRUCTOP_PTR);
371 write_exp_string ($3);
372 write_exp_elt_opcode (STRUCTOP_PTR); }
375 exp : exp ARROW COMPLETE
377 mark_struct_expression ();
378 write_exp_elt_opcode (STRUCTOP_PTR);
381 write_exp_string (s);
382 write_exp_elt_opcode (STRUCTOP_PTR); }
385 exp : exp ARROW '~' name
386 { write_exp_elt_opcode (STRUCTOP_PTR);
387 write_destructor_name ($4);
388 write_exp_elt_opcode (STRUCTOP_PTR); }
391 exp : exp ARROW '~' name COMPLETE
392 { mark_struct_expression ();
393 write_exp_elt_opcode (STRUCTOP_PTR);
394 write_destructor_name ($4);
395 write_exp_elt_opcode (STRUCTOP_PTR); }
398 exp : exp ARROW qualified_name
399 { /* exp->type::name becomes exp->*(&type::name) */
400 /* Note: this doesn't work if name is a
401 static member! FIXME */
402 write_exp_elt_opcode (UNOP_ADDR);
403 write_exp_elt_opcode (STRUCTOP_MPTR); }
406 exp : exp ARROW_STAR exp
407 { write_exp_elt_opcode (STRUCTOP_MPTR); }
411 { write_exp_elt_opcode (STRUCTOP_STRUCT);
412 write_exp_string ($3);
413 write_exp_elt_opcode (STRUCTOP_STRUCT); }
416 exp : exp '.' name COMPLETE
417 { mark_struct_expression ();
418 write_exp_elt_opcode (STRUCTOP_STRUCT);
419 write_exp_string ($3);
420 write_exp_elt_opcode (STRUCTOP_STRUCT); }
423 exp : exp '.' COMPLETE
425 mark_struct_expression ();
426 write_exp_elt_opcode (STRUCTOP_STRUCT);
429 write_exp_string (s);
430 write_exp_elt_opcode (STRUCTOP_STRUCT); }
433 exp : exp '.' '~' name
434 { write_exp_elt_opcode (STRUCTOP_STRUCT);
435 write_destructor_name ($4);
436 write_exp_elt_opcode (STRUCTOP_STRUCT); }
439 exp : exp '.' '~' name COMPLETE
440 { mark_struct_expression ();
441 write_exp_elt_opcode (STRUCTOP_STRUCT);
442 write_destructor_name ($4);
443 write_exp_elt_opcode (STRUCTOP_STRUCT); }
446 exp : exp '.' qualified_name
447 { /* exp.type::name becomes exp.*(&type::name) */
448 /* Note: this doesn't work if name is a
449 static member! FIXME */
450 write_exp_elt_opcode (UNOP_ADDR);
451 write_exp_elt_opcode (STRUCTOP_MEMBER); }
454 exp : exp DOT_STAR exp
455 { write_exp_elt_opcode (STRUCTOP_MEMBER); }
458 exp : exp '[' exp1 ']'
459 { write_exp_elt_opcode (BINOP_SUBSCRIPT); }
462 exp : exp OBJC_LBRAC exp1 ']'
463 { write_exp_elt_opcode (BINOP_SUBSCRIPT); }
467 * The rules below parse ObjC message calls of the form:
468 * '[' target selector {':' argument}* ']'
471 exp : OBJC_LBRAC TYPENAME
475 class = lookup_objc_class (parse_gdbarch,
476 copy_name ($2.stoken));
478 error (_("%s is not an ObjC Class"),
479 copy_name ($2.stoken));
480 write_exp_elt_opcode (OP_LONG);
481 write_exp_elt_type (parse_type->builtin_int);
482 write_exp_elt_longcst ((LONGEST) class);
483 write_exp_elt_opcode (OP_LONG);
487 { write_exp_elt_opcode (OP_OBJC_MSGCALL);
489 write_exp_elt_opcode (OP_OBJC_MSGCALL);
493 exp : OBJC_LBRAC CLASSNAME
495 write_exp_elt_opcode (OP_LONG);
496 write_exp_elt_type (parse_type->builtin_int);
497 write_exp_elt_longcst ((LONGEST) $2.class);
498 write_exp_elt_opcode (OP_LONG);
502 { write_exp_elt_opcode (OP_OBJC_MSGCALL);
504 write_exp_elt_opcode (OP_OBJC_MSGCALL);
511 { write_exp_elt_opcode (OP_OBJC_MSGCALL);
513 write_exp_elt_opcode (OP_OBJC_MSGCALL);
518 { add_msglist(&$1, 0); }
526 msgarg : name ':' exp
527 { add_msglist(&$1, 1); }
528 | ':' exp /* Unnamed arg. */
529 { add_msglist(0, 1); }
530 | ',' exp /* Variable number of args. */
531 { add_msglist(0, 0); }
535 /* This is to save the value of arglist_len
536 being accumulated by an outer function call. */
537 { start_arglist (); }
538 arglist ')' %prec ARROW
539 { write_exp_elt_opcode (OP_FUNCALL);
540 write_exp_elt_longcst ((LONGEST) end_arglist ());
541 write_exp_elt_opcode (OP_FUNCALL); }
544 exp : UNKNOWN_CPP_NAME '('
546 /* This could potentially be a an argument defined
547 lookup function (Koenig). */
548 write_exp_elt_opcode (OP_ADL_FUNC);
549 write_exp_elt_block (expression_context_block);
550 write_exp_elt_sym (NULL); /* Placeholder. */
551 write_exp_string ($1.stoken);
552 write_exp_elt_opcode (OP_ADL_FUNC);
554 /* This is to save the value of arglist_len
555 being accumulated by an outer function call. */
559 arglist ')' %prec ARROW
561 write_exp_elt_opcode (OP_FUNCALL);
562 write_exp_elt_longcst ((LONGEST) end_arglist ());
563 write_exp_elt_opcode (OP_FUNCALL);
568 { start_arglist (); }
578 arglist : arglist ',' exp %prec ABOVE_COMMA
582 exp : exp '(' parameter_typelist ')' const_or_volatile
584 VEC (type_ptr) *type_list = $3;
585 struct type *type_elt;
586 LONGEST len = VEC_length (type_ptr, type_list);
588 write_exp_elt_opcode (TYPE_INSTANCE);
589 write_exp_elt_longcst (len);
591 VEC_iterate (type_ptr, type_list, i, type_elt);
593 write_exp_elt_type (type_elt);
594 write_exp_elt_longcst(len);
595 write_exp_elt_opcode (TYPE_INSTANCE);
596 VEC_free (type_ptr, type_list);
601 { $$ = end_arglist () - 1; }
603 exp : lcurly arglist rcurly %prec ARROW
604 { write_exp_elt_opcode (OP_ARRAY);
605 write_exp_elt_longcst ((LONGEST) 0);
606 write_exp_elt_longcst ((LONGEST) $3);
607 write_exp_elt_opcode (OP_ARRAY); }
610 exp : lcurly type_exp rcurly exp %prec UNARY
611 { write_exp_elt_opcode (UNOP_MEMVAL_TYPE); }
614 exp : '(' type_exp ')' exp %prec UNARY
615 { write_exp_elt_opcode (UNOP_CAST_TYPE); }
622 /* Binary operators in order of decreasing precedence. */
625 { write_exp_elt_opcode (BINOP_REPEAT); }
629 { write_exp_elt_opcode (BINOP_MUL); }
633 { write_exp_elt_opcode (BINOP_DIV); }
637 { write_exp_elt_opcode (BINOP_REM); }
641 { write_exp_elt_opcode (BINOP_ADD); }
645 { write_exp_elt_opcode (BINOP_SUB); }
649 { write_exp_elt_opcode (BINOP_LSH); }
653 { write_exp_elt_opcode (BINOP_RSH); }
657 { write_exp_elt_opcode (BINOP_EQUAL); }
660 exp : exp NOTEQUAL exp
661 { write_exp_elt_opcode (BINOP_NOTEQUAL); }
665 { write_exp_elt_opcode (BINOP_LEQ); }
669 { write_exp_elt_opcode (BINOP_GEQ); }
673 { write_exp_elt_opcode (BINOP_LESS); }
677 { write_exp_elt_opcode (BINOP_GTR); }
681 { write_exp_elt_opcode (BINOP_BITWISE_AND); }
685 { write_exp_elt_opcode (BINOP_BITWISE_XOR); }
689 { write_exp_elt_opcode (BINOP_BITWISE_IOR); }
693 { write_exp_elt_opcode (BINOP_LOGICAL_AND); }
697 { write_exp_elt_opcode (BINOP_LOGICAL_OR); }
700 exp : exp '?' exp ':' exp %prec '?'
701 { write_exp_elt_opcode (TERNOP_COND); }
705 { write_exp_elt_opcode (BINOP_ASSIGN); }
708 exp : exp ASSIGN_MODIFY exp
709 { write_exp_elt_opcode (BINOP_ASSIGN_MODIFY);
710 write_exp_elt_opcode ($2);
711 write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); }
715 { write_exp_elt_opcode (OP_LONG);
716 write_exp_elt_type ($1.type);
717 write_exp_elt_longcst ((LONGEST)($1.val));
718 write_exp_elt_opcode (OP_LONG); }
723 struct stoken_vector vec;
726 write_exp_string_vector ($1.type, &vec);
732 parse_number ($1.stoken.ptr, $1.stoken.length, 0, &val);
733 write_exp_elt_opcode (OP_LONG);
734 write_exp_elt_type (val.typed_val_int.type);
735 write_exp_elt_longcst ((LONGEST)val.typed_val_int.val);
736 write_exp_elt_opcode (OP_LONG);
742 { write_exp_elt_opcode (OP_DOUBLE);
743 write_exp_elt_type ($1.type);
744 write_exp_elt_dblcst ($1.dval);
745 write_exp_elt_opcode (OP_DOUBLE); }
749 { write_exp_elt_opcode (OP_DECFLOAT);
750 write_exp_elt_type ($1.type);
751 write_exp_elt_decfloatcst ($1.val);
752 write_exp_elt_opcode (OP_DECFLOAT); }
760 write_dollar_variable ($1);
764 exp : SELECTOR '(' name ')'
766 write_exp_elt_opcode (OP_OBJC_SELECTOR);
767 write_exp_string ($3);
768 write_exp_elt_opcode (OP_OBJC_SELECTOR); }
771 exp : SIZEOF '(' type ')' %prec UNARY
772 { write_exp_elt_opcode (OP_LONG);
773 write_exp_elt_type (lookup_signed_typename
774 (parse_language, parse_gdbarch,
777 write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3));
778 write_exp_elt_opcode (OP_LONG); }
781 exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
782 { write_exp_elt_opcode (UNOP_REINTERPRET_CAST); }
785 exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
786 { write_exp_elt_opcode (UNOP_CAST_TYPE); }
789 exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
790 { write_exp_elt_opcode (UNOP_DYNAMIC_CAST); }
793 exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
794 { /* We could do more error checking here, but
795 it doesn't seem worthwhile. */
796 write_exp_elt_opcode (UNOP_CAST_TYPE); }
802 /* We copy the string here, and not in the
803 lexer, to guarantee that we do not leak a
804 string. Note that we follow the
805 NUL-termination convention of the
807 struct typed_stoken *vec = XNEW (struct typed_stoken);
812 vec->length = $1.length;
813 vec->ptr = malloc ($1.length + 1);
814 memcpy (vec->ptr, $1.ptr, $1.length + 1);
819 /* Note that we NUL-terminate here, but just
823 $$.tokens = realloc ($$.tokens,
824 $$.len * sizeof (struct typed_stoken));
826 p = malloc ($2.length + 1);
827 memcpy (p, $2.ptr, $2.length + 1);
829 $$.tokens[$$.len - 1].type = $2.type;
830 $$.tokens[$$.len - 1].length = $2.length;
831 $$.tokens[$$.len - 1].ptr = p;
838 enum c_string_type type = C_STRING;
840 for (i = 0; i < $1.len; ++i)
842 switch ($1.tokens[i].type)
850 && type != $1.tokens[i].type)
851 error (_("Undefined string concatenation."));
852 type = $1.tokens[i].type;
856 internal_error (__FILE__, __LINE__,
857 "unrecognized type in string concatenation");
861 write_exp_string_vector (type, &$1);
862 for (i = 0; i < $1.len; ++i)
863 free ($1.tokens[i].ptr);
868 exp : NSSTRING /* ObjC NextStep NSString constant
869 * of the form '@' '"' string '"'.
871 { write_exp_elt_opcode (OP_OBJC_NSSTRING);
872 write_exp_string ($1);
873 write_exp_elt_opcode (OP_OBJC_NSSTRING); }
878 { write_exp_elt_opcode (OP_LONG);
879 write_exp_elt_type (parse_type->builtin_bool);
880 write_exp_elt_longcst ((LONGEST) 1);
881 write_exp_elt_opcode (OP_LONG); }
885 { write_exp_elt_opcode (OP_LONG);
886 write_exp_elt_type (parse_type->builtin_bool);
887 write_exp_elt_longcst ((LONGEST) 0);
888 write_exp_elt_opcode (OP_LONG); }
896 $$ = SYMBOL_BLOCK_VALUE ($1.sym);
898 error (_("No file or function \"%s\"."),
899 copy_name ($1.stoken));
907 block : block COLONCOLON name
909 = lookup_symbol (copy_name ($3), $1,
911 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
912 error (_("No function \"%s\" in specified context."),
914 $$ = SYMBOL_BLOCK_VALUE (tem); }
917 variable: name_not_typename ENTRY
918 { struct symbol *sym = $1.sym;
920 if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym)
921 || !symbol_read_needs_frame (sym))
922 error (_("@entry can be used only for function "
923 "parameters, not for \"%s\""),
924 copy_name ($1.stoken));
926 write_exp_elt_opcode (OP_VAR_ENTRY_VALUE);
927 write_exp_elt_sym (sym);
928 write_exp_elt_opcode (OP_VAR_ENTRY_VALUE);
932 variable: block COLONCOLON name
933 { struct symbol *sym;
934 sym = lookup_symbol (copy_name ($3), $1,
937 error (_("No symbol \"%s\" in specified context."),
939 if (symbol_read_needs_frame (sym))
941 if (innermost_block == 0
942 || contained_in (block_found,
944 innermost_block = block_found;
947 write_exp_elt_opcode (OP_VAR_VALUE);
948 /* block_found is set by lookup_symbol. */
949 write_exp_elt_block (block_found);
950 write_exp_elt_sym (sym);
951 write_exp_elt_opcode (OP_VAR_VALUE); }
954 qualified_name: TYPENAME COLONCOLON name
956 struct type *type = $1.type;
957 CHECK_TYPEDEF (type);
958 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
959 && TYPE_CODE (type) != TYPE_CODE_UNION
960 && TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
961 error (_("`%s' is not defined as an aggregate type."),
962 TYPE_SAFE_NAME (type));
964 write_exp_elt_opcode (OP_SCOPE);
965 write_exp_elt_type (type);
966 write_exp_string ($3);
967 write_exp_elt_opcode (OP_SCOPE);
969 | TYPENAME COLONCOLON '~' name
971 struct type *type = $1.type;
972 struct stoken tmp_token;
973 CHECK_TYPEDEF (type);
974 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
975 && TYPE_CODE (type) != TYPE_CODE_UNION
976 && TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
977 error (_("`%s' is not defined as an aggregate type."),
978 TYPE_SAFE_NAME (type));
980 tmp_token.ptr = (char*) alloca ($4.length + 2);
981 tmp_token.length = $4.length + 1;
982 tmp_token.ptr[0] = '~';
983 memcpy (tmp_token.ptr+1, $4.ptr, $4.length);
984 tmp_token.ptr[tmp_token.length] = 0;
986 /* Check for valid destructor name. */
987 destructor_name_p (tmp_token.ptr, $1.type);
988 write_exp_elt_opcode (OP_SCOPE);
989 write_exp_elt_type (type);
990 write_exp_string (tmp_token);
991 write_exp_elt_opcode (OP_SCOPE);
993 | TYPENAME COLONCOLON name COLONCOLON name
995 char *copy = copy_name ($3);
996 error (_("No type \"%s\" within class "
997 "or namespace \"%s\"."),
998 copy, TYPE_SAFE_NAME ($1.type));
1002 variable: qualified_name
1003 | COLONCOLON name_not_typename
1005 char *name = copy_name ($2.stoken);
1007 struct minimal_symbol *msymbol;
1010 lookup_symbol (name, (const struct block *) NULL,
1014 write_exp_elt_opcode (OP_VAR_VALUE);
1015 write_exp_elt_block (NULL);
1016 write_exp_elt_sym (sym);
1017 write_exp_elt_opcode (OP_VAR_VALUE);
1021 msymbol = lookup_minimal_symbol (name, NULL, NULL);
1022 if (msymbol != NULL)
1023 write_exp_msymbol (msymbol);
1024 else if (!have_full_symbols () && !have_partial_symbols ())
1025 error (_("No symbol table is loaded. Use the \"file\" command."));
1027 error (_("No symbol \"%s\" in current context."), name);
1031 variable: name_not_typename
1032 { struct symbol *sym = $1.sym;
1036 if (symbol_read_needs_frame (sym))
1038 if (innermost_block == 0
1039 || contained_in (block_found,
1041 innermost_block = block_found;
1044 write_exp_elt_opcode (OP_VAR_VALUE);
1045 /* We want to use the selected frame, not
1046 another more inner frame which happens to
1047 be in the same block. */
1048 write_exp_elt_block (NULL);
1049 write_exp_elt_sym (sym);
1050 write_exp_elt_opcode (OP_VAR_VALUE);
1052 else if ($1.is_a_field_of_this)
1054 /* C++: it hangs off of `this'. Must
1055 not inadvertently convert from a method call
1057 if (innermost_block == 0
1058 || contained_in (block_found,
1060 innermost_block = block_found;
1061 write_exp_elt_opcode (OP_THIS);
1062 write_exp_elt_opcode (OP_THIS);
1063 write_exp_elt_opcode (STRUCTOP_PTR);
1064 write_exp_string ($1.stoken);
1065 write_exp_elt_opcode (STRUCTOP_PTR);
1069 struct minimal_symbol *msymbol;
1070 char *arg = copy_name ($1.stoken);
1073 lookup_minimal_symbol (arg, NULL, NULL);
1074 if (msymbol != NULL)
1075 write_exp_msymbol (msymbol);
1076 else if (!have_full_symbols () && !have_partial_symbols ())
1077 error (_("No symbol table is loaded. Use the \"file\" command."));
1079 error (_("No symbol \"%s\" in current context."),
1080 copy_name ($1.stoken));
1085 space_identifier : '@' NAME
1086 { insert_type_address_space (copy_name ($2.stoken)); }
1089 const_or_volatile: const_or_volatile_noopt
1093 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1096 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1097 | const_or_volatile_noopt
1100 const_or_volatile_or_space_identifier:
1101 const_or_volatile_or_space_identifier_noopt
1107 { insert_type (tp_pointer); }
1108 const_or_volatile_or_space_identifier
1110 { insert_type (tp_pointer); }
1111 const_or_volatile_or_space_identifier
1113 { insert_type (tp_reference); }
1115 { insert_type (tp_reference); }
1118 ptr_operator_ts: ptr_operator
1120 $$ = get_type_stack ();
1121 /* This cleanup is eventually run by
1123 make_cleanup (type_stack_cleanup, $$);
1127 abs_decl: ptr_operator_ts direct_abs_decl
1128 { $$ = append_type_stack ($2, $1); }
1133 direct_abs_decl: '(' abs_decl ')'
1135 | direct_abs_decl array_mod
1137 push_type_stack ($1);
1139 push_type (tp_array);
1140 $$ = get_type_stack ();
1145 push_type (tp_array);
1146 $$ = get_type_stack ();
1149 | direct_abs_decl func_mod
1151 push_type_stack ($1);
1153 $$ = get_type_stack ();
1158 $$ = get_type_stack ();
1168 | OBJC_LBRAC INT ']'
1174 | '(' parameter_typelist ')'
1178 /* We used to try to recognize pointer to member types here, but
1179 that didn't work (shift/reduce conflicts meant that these rules never
1180 got executed). The problem is that
1181 int (foo::bar::baz::bizzle)
1182 is a function type but
1183 int (foo::bar::baz::bizzle::*)
1184 is a pointer to member type. Stroustrup loses again! */
1189 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1193 { $$ = lookup_signed_typename (parse_language,
1197 { $$ = lookup_signed_typename (parse_language,
1201 { $$ = lookup_signed_typename (parse_language,
1205 { $$ = lookup_signed_typename (parse_language,
1208 | LONG SIGNED_KEYWORD INT_KEYWORD
1209 { $$ = lookup_signed_typename (parse_language,
1212 | LONG SIGNED_KEYWORD
1213 { $$ = lookup_signed_typename (parse_language,
1216 | SIGNED_KEYWORD LONG INT_KEYWORD
1217 { $$ = lookup_signed_typename (parse_language,
1220 | UNSIGNED LONG INT_KEYWORD
1221 { $$ = lookup_unsigned_typename (parse_language,
1224 | LONG UNSIGNED INT_KEYWORD
1225 { $$ = lookup_unsigned_typename (parse_language,
1229 { $$ = lookup_unsigned_typename (parse_language,
1233 { $$ = lookup_signed_typename (parse_language,
1236 | LONG LONG INT_KEYWORD
1237 { $$ = lookup_signed_typename (parse_language,
1240 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1241 { $$ = lookup_signed_typename (parse_language,
1244 | LONG LONG SIGNED_KEYWORD
1245 { $$ = lookup_signed_typename (parse_language,
1248 | SIGNED_KEYWORD LONG LONG
1249 { $$ = lookup_signed_typename (parse_language,
1252 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1253 { $$ = lookup_signed_typename (parse_language,
1256 | UNSIGNED LONG LONG
1257 { $$ = lookup_unsigned_typename (parse_language,
1260 | UNSIGNED LONG LONG INT_KEYWORD
1261 { $$ = lookup_unsigned_typename (parse_language,
1264 | LONG LONG UNSIGNED
1265 { $$ = lookup_unsigned_typename (parse_language,
1268 | LONG LONG UNSIGNED INT_KEYWORD
1269 { $$ = lookup_unsigned_typename (parse_language,
1273 { $$ = lookup_signed_typename (parse_language,
1276 | SHORT SIGNED_KEYWORD INT_KEYWORD
1277 { $$ = lookup_signed_typename (parse_language,
1280 | SHORT SIGNED_KEYWORD
1281 { $$ = lookup_signed_typename (parse_language,
1284 | UNSIGNED SHORT INT_KEYWORD
1285 { $$ = lookup_unsigned_typename (parse_language,
1289 { $$ = lookup_unsigned_typename (parse_language,
1292 | SHORT UNSIGNED INT_KEYWORD
1293 { $$ = lookup_unsigned_typename (parse_language,
1297 { $$ = lookup_typename (parse_language, parse_gdbarch,
1298 "double", (struct block *) NULL,
1300 | LONG DOUBLE_KEYWORD
1301 { $$ = lookup_typename (parse_language, parse_gdbarch,
1303 (struct block *) NULL, 0); }
1305 { $$ = lookup_struct (copy_name ($2),
1306 expression_context_block); }
1309 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1312 | STRUCT name COMPLETE
1314 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1319 { $$ = lookup_struct (copy_name ($2),
1320 expression_context_block); }
1323 mark_completion_tag (TYPE_CODE_CLASS, "", 0);
1326 | CLASS name COMPLETE
1328 mark_completion_tag (TYPE_CODE_CLASS, $2.ptr,
1333 { $$ = lookup_union (copy_name ($2),
1334 expression_context_block); }
1337 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1340 | UNION name COMPLETE
1342 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1347 { $$ = lookup_enum (copy_name ($2),
1348 expression_context_block); }
1351 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1354 | ENUM name COMPLETE
1356 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1361 { $$ = lookup_unsigned_typename (parse_language,
1363 TYPE_NAME($2.type)); }
1365 { $$ = lookup_unsigned_typename (parse_language,
1368 | SIGNED_KEYWORD typename
1369 { $$ = lookup_signed_typename (parse_language,
1371 TYPE_NAME($2.type)); }
1373 { $$ = lookup_signed_typename (parse_language,
1376 /* It appears that this rule for templates is never
1377 reduced; template recognition happens by lookahead
1378 in the token processing code in yylex. */
1379 | TEMPLATE name '<' type '>'
1380 { $$ = lookup_template_type(copy_name($2), $4,
1381 expression_context_block);
1383 | const_or_volatile_or_space_identifier_noopt typebase
1384 { $$ = follow_types ($2); }
1385 | typebase const_or_volatile_or_space_identifier_noopt
1386 { $$ = follow_types ($1); }
1392 $$.stoken.ptr = "int";
1393 $$.stoken.length = 3;
1394 $$.type = lookup_signed_typename (parse_language,
1400 $$.stoken.ptr = "long";
1401 $$.stoken.length = 4;
1402 $$.type = lookup_signed_typename (parse_language,
1408 $$.stoken.ptr = "short";
1409 $$.stoken.length = 5;
1410 $$.type = lookup_signed_typename (parse_language,
1418 { check_parameter_typelist ($1); }
1419 | nonempty_typelist ',' DOTDOTDOT
1421 VEC_safe_push (type_ptr, $1, NULL);
1422 check_parameter_typelist ($1);
1430 VEC (type_ptr) *typelist = NULL;
1431 VEC_safe_push (type_ptr, typelist, $1);
1434 | nonempty_typelist ',' type
1436 VEC_safe_push (type_ptr, $1, $3);
1444 push_type_stack ($2);
1445 $$ = follow_types ($1);
1449 conversion_type_id: typebase conversion_declarator
1450 { $$ = follow_types ($1); }
1453 conversion_declarator: /* Nothing. */
1454 | ptr_operator conversion_declarator
1457 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1458 | VOLATILE_KEYWORD CONST_KEYWORD
1461 const_or_volatile_noopt: const_and_volatile
1462 { insert_type (tp_const);
1463 insert_type (tp_volatile);
1466 { insert_type (tp_const); }
1468 { insert_type (tp_volatile); }
1471 operator: OPERATOR NEW
1472 { $$ = operator_stoken (" new"); }
1474 { $$ = operator_stoken (" delete"); }
1475 | OPERATOR NEW '[' ']'
1476 { $$ = operator_stoken (" new[]"); }
1477 | OPERATOR DELETE '[' ']'
1478 { $$ = operator_stoken (" delete[]"); }
1479 | OPERATOR NEW OBJC_LBRAC ']'
1480 { $$ = operator_stoken (" new[]"); }
1481 | OPERATOR DELETE OBJC_LBRAC ']'
1482 { $$ = operator_stoken (" delete[]"); }
1484 { $$ = operator_stoken ("+"); }
1486 { $$ = operator_stoken ("-"); }
1488 { $$ = operator_stoken ("*"); }
1490 { $$ = operator_stoken ("/"); }
1492 { $$ = operator_stoken ("%"); }
1494 { $$ = operator_stoken ("^"); }
1496 { $$ = operator_stoken ("&"); }
1498 { $$ = operator_stoken ("|"); }
1500 { $$ = operator_stoken ("~"); }
1502 { $$ = operator_stoken ("!"); }
1504 { $$ = operator_stoken ("="); }
1506 { $$ = operator_stoken ("<"); }
1508 { $$ = operator_stoken (">"); }
1509 | OPERATOR ASSIGN_MODIFY
1510 { const char *op = "unknown";
1534 case BINOP_BITWISE_IOR:
1537 case BINOP_BITWISE_AND:
1540 case BINOP_BITWISE_XOR:
1547 $$ = operator_stoken (op);
1550 { $$ = operator_stoken ("<<"); }
1552 { $$ = operator_stoken (">>"); }
1554 { $$ = operator_stoken ("=="); }
1556 { $$ = operator_stoken ("!="); }
1558 { $$ = operator_stoken ("<="); }
1560 { $$ = operator_stoken (">="); }
1562 { $$ = operator_stoken ("&&"); }
1564 { $$ = operator_stoken ("||"); }
1565 | OPERATOR INCREMENT
1566 { $$ = operator_stoken ("++"); }
1567 | OPERATOR DECREMENT
1568 { $$ = operator_stoken ("--"); }
1570 { $$ = operator_stoken (","); }
1571 | OPERATOR ARROW_STAR
1572 { $$ = operator_stoken ("->*"); }
1574 { $$ = operator_stoken ("->"); }
1576 { $$ = operator_stoken ("()"); }
1578 { $$ = operator_stoken ("[]"); }
1579 | OPERATOR OBJC_LBRAC ']'
1580 { $$ = operator_stoken ("[]"); }
1581 | OPERATOR conversion_type_id
1584 struct ui_file *buf = mem_fileopen ();
1586 c_print_type ($2, NULL, buf, -1, 0,
1587 &type_print_raw_options);
1588 name = ui_file_xstrdup (buf, &length);
1589 ui_file_delete (buf);
1590 $$ = operator_stoken (name);
1597 name : NAME { $$ = $1.stoken; }
1598 | BLOCKNAME { $$ = $1.stoken; }
1599 | TYPENAME { $$ = $1.stoken; }
1600 | NAME_OR_INT { $$ = $1.stoken; }
1601 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1602 | operator { $$ = $1; }
1605 name_not_typename : NAME
1607 /* These would be useful if name_not_typename was useful, but it is just
1608 a fake for "variable", so these cause reduce/reduce conflicts because
1609 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1610 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1611 context where only a name could occur, this might be useful.
1616 struct field_of_this_result is_a_field_of_this;
1619 $$.sym = lookup_symbol ($1.ptr,
1620 expression_context_block,
1622 &is_a_field_of_this);
1623 $$.is_a_field_of_this
1624 = is_a_field_of_this.type != NULL;
1631 /* Like write_exp_string, but prepends a '~'. */
1634 write_destructor_name (struct stoken token)
1636 char *copy = alloca (token.length + 1);
1639 memcpy (©[1], token.ptr, token.length);
1644 write_exp_string (token);
1647 /* Returns a stoken of the operator name given by OP (which does not
1648 include the string "operator"). */
1649 static struct stoken
1650 operator_stoken (const char *op)
1652 static const char *operator_string = "operator";
1653 struct stoken st = { NULL, 0 };
1654 st.length = strlen (operator_string) + strlen (op);
1655 st.ptr = malloc (st.length + 1);
1656 strcpy (st.ptr, operator_string);
1657 strcat (st.ptr, op);
1659 /* The toplevel (c_parse) will free the memory allocated here. */
1660 make_cleanup (free, st.ptr);
1664 /* Validate a parameter typelist. */
1667 check_parameter_typelist (VEC (type_ptr) *params)
1672 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1674 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1678 if (VEC_length (type_ptr, params) == 1)
1683 VEC_free (type_ptr, params);
1684 error (_("parameter types following 'void'"));
1688 VEC_free (type_ptr, params);
1689 error (_("'void' invalid as parameter type"));
1695 /* Take care of parsing a number (anything that starts with a digit).
1696 Set yylval and return the token type; update lexptr.
1697 LEN is the number of characters in it. */
1699 /*** Needs some error checking for the float case ***/
1702 parse_number (char *p, int len, int parsed_float, YYSTYPE *putithere)
1704 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1705 here, and we do kind of silly things like cast to unsigned. */
1712 int base = input_radix;
1715 /* Number of "L" suffixes encountered. */
1718 /* We have found a "L" or "U" suffix. */
1719 int found_suffix = 0;
1722 struct type *signed_type;
1723 struct type *unsigned_type;
1727 /* If it ends at "df", "dd" or "dl", take it as type of decimal floating
1728 point. Return DECFLOAT. */
1730 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1733 putithere->typed_val_decfloat.type
1734 = parse_type->builtin_decfloat;
1735 decimal_from_string (putithere->typed_val_decfloat.val, 4,
1736 gdbarch_byte_order (parse_gdbarch), p);
1741 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1744 putithere->typed_val_decfloat.type
1745 = parse_type->builtin_decdouble;
1746 decimal_from_string (putithere->typed_val_decfloat.val, 8,
1747 gdbarch_byte_order (parse_gdbarch), p);
1752 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1755 putithere->typed_val_decfloat.type
1756 = parse_type->builtin_declong;
1757 decimal_from_string (putithere->typed_val_decfloat.val, 16,
1758 gdbarch_byte_order (parse_gdbarch), p);
1763 if (! parse_c_float (parse_gdbarch, p, len,
1764 &putithere->typed_val_float.dval,
1765 &putithere->typed_val_float.type))
1770 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1814 if (c >= 'A' && c <= 'Z')
1816 if (c != 'l' && c != 'u')
1818 if (c >= '0' && c <= '9')
1826 if (base > 10 && c >= 'a' && c <= 'f')
1830 n += i = c - 'a' + 10;
1843 return ERROR; /* Char not a digit */
1846 return ERROR; /* Invalid digit in this base */
1848 /* Portably test for overflow (only works for nonzero values, so make
1849 a second check for zero). FIXME: Can't we just make n and prevn
1850 unsigned and avoid this? */
1851 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1852 unsigned_p = 1; /* Try something unsigned */
1854 /* Portably test for unsigned overflow.
1855 FIXME: This check is wrong; for example it doesn't find overflow
1856 on 0x123456789 when LONGEST is 32 bits. */
1857 if (c != 'l' && c != 'u' && n != 0)
1859 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1860 error (_("Numeric constant too large."));
1865 /* An integer constant is an int, a long, or a long long. An L
1866 suffix forces it to be long; an LL suffix forces it to be long
1867 long. If not forced to a larger size, it gets the first type of
1868 the above that it fits in. To figure out whether it fits, we
1869 shift it right and see whether anything remains. Note that we
1870 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1871 operation, because many compilers will warn about such a shift
1872 (which always produces a zero result). Sometimes gdbarch_int_bit
1873 or gdbarch_long_bit will be that big, sometimes not. To deal with
1874 the case where it is we just always shift the value more than
1875 once, with fewer bits each time. */
1877 un = (ULONGEST)n >> 2;
1879 && (un >> (gdbarch_int_bit (parse_gdbarch) - 2)) == 0)
1881 high_bit = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch) - 1);
1883 /* A large decimal (not hex or octal) constant (between INT_MAX
1884 and UINT_MAX) is a long or unsigned long, according to ANSI,
1885 never an unsigned int, but this code treats it as unsigned
1886 int. This probably should be fixed. GCC gives a warning on
1889 unsigned_type = parse_type->builtin_unsigned_int;
1890 signed_type = parse_type->builtin_int;
1892 else if (long_p <= 1
1893 && (un >> (gdbarch_long_bit (parse_gdbarch) - 2)) == 0)
1895 high_bit = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch) - 1);
1896 unsigned_type = parse_type->builtin_unsigned_long;
1897 signed_type = parse_type->builtin_long;
1902 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1903 < gdbarch_long_long_bit (parse_gdbarch))
1904 /* A long long does not fit in a LONGEST. */
1905 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1907 shift = (gdbarch_long_long_bit (parse_gdbarch) - 1);
1908 high_bit = (ULONGEST) 1 << shift;
1909 unsigned_type = parse_type->builtin_unsigned_long_long;
1910 signed_type = parse_type->builtin_long_long;
1913 putithere->typed_val_int.val = n;
1915 /* If the high bit of the worked out type is set then this number
1916 has to be unsigned. */
1918 if (unsigned_p || (n & high_bit))
1920 putithere->typed_val_int.type = unsigned_type;
1924 putithere->typed_val_int.type = signed_type;
1930 /* Temporary obstack used for holding strings. */
1931 static struct obstack tempbuf;
1932 static int tempbuf_init;
1934 /* Parse a C escape sequence. The initial backslash of the sequence
1935 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1936 last character of the sequence. If OUTPUT is not NULL, the
1937 translated form of the escape sequence will be written there. If
1938 OUTPUT is NULL, no output is written and the call will only affect
1939 *PTR. If an escape sequence is expressed in target bytes, then the
1940 entire sequence will simply be copied to OUTPUT. Return 1 if any
1941 character was emitted, 0 otherwise. */
1944 c_parse_escape (char **ptr, struct obstack *output)
1946 char *tokptr = *ptr;
1949 /* Some escape sequences undergo character set conversion. Those we
1953 /* Hex escapes do not undergo character set conversion, so keep
1954 the escape sequence for later. */
1957 obstack_grow_str (output, "\\x");
1959 if (!isxdigit (*tokptr))
1960 error (_("\\x escape without a following hex digit"));
1961 while (isxdigit (*tokptr))
1964 obstack_1grow (output, *tokptr);
1969 /* Octal escapes do not undergo character set conversion, so
1970 keep the escape sequence for later. */
1982 obstack_grow_str (output, "\\");
1984 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
1988 obstack_1grow (output, *tokptr);
1994 /* We handle UCNs later. We could handle them here, but that
1995 would mean a spurious error in the case where the UCN could
1996 be converted to the target charset but not the host
2002 int i, len = c == 'U' ? 8 : 4;
2005 obstack_1grow (output, '\\');
2006 obstack_1grow (output, *tokptr);
2009 if (!isxdigit (*tokptr))
2010 error (_("\\%c escape without a following hex digit"), c);
2011 for (i = 0; i < len && isxdigit (*tokptr); ++i)
2014 obstack_1grow (output, *tokptr);
2020 /* We must pass backslash through so that it does not
2021 cause quoting during the second expansion. */
2024 obstack_grow_str (output, "\\\\");
2028 /* Escapes which undergo conversion. */
2031 obstack_1grow (output, '\a');
2036 obstack_1grow (output, '\b');
2041 obstack_1grow (output, '\f');
2046 obstack_1grow (output, '\n');
2051 obstack_1grow (output, '\r');
2056 obstack_1grow (output, '\t');
2061 obstack_1grow (output, '\v');
2065 /* GCC extension. */
2068 obstack_1grow (output, HOST_ESCAPE_CHAR);
2072 /* Backslash-newline expands to nothing at all. */
2078 /* A few escapes just expand to the character itself. */
2082 /* GCC extensions. */
2087 /* Unrecognized escapes turn into the character itself. */
2090 obstack_1grow (output, *tokptr);
2098 /* Parse a string or character literal from TOKPTR. The string or
2099 character may be wide or unicode. *OUTPTR is set to just after the
2100 end of the literal in the input string. The resulting token is
2101 stored in VALUE. This returns a token value, either STRING or
2102 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2103 number of host characters in the literal. */
2105 parse_string_or_char (char *tokptr, char **outptr, struct typed_stoken *value,
2109 enum c_string_type type;
2112 /* Build the gdb internal form of the input string in tempbuf. Note
2113 that the buffer is null byte terminated *only* for the
2114 convenience of debugging gdb itself and printing the buffer
2115 contents when the buffer contains no embedded nulls. Gdb does
2116 not depend upon the buffer being null byte terminated, it uses
2117 the length string instead. This allows gdb to handle C strings
2118 (as well as strings in other languages) with embedded null
2124 obstack_free (&tempbuf, NULL);
2125 obstack_init (&tempbuf);
2127 /* Record the string type. */
2130 type = C_WIDE_STRING;
2133 else if (*tokptr == 'u')
2138 else if (*tokptr == 'U')
2143 else if (*tokptr == '@')
2145 /* An Objective C string. */
2153 /* Skip the quote. */
2167 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2169 else if (c == quote)
2173 obstack_1grow (&tempbuf, c);
2175 /* FIXME: this does the wrong thing with multi-byte host
2176 characters. We could use mbrlen here, but that would
2177 make "set host-charset" a bit less useful. */
2182 if (*tokptr != quote)
2185 error (_("Unterminated string in expression."));
2187 error (_("Unmatched single quote."));
2192 value->ptr = obstack_base (&tempbuf);
2193 value->length = obstack_object_size (&tempbuf);
2197 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2200 /* This is used to associate some attributes with a token. */
2204 /* If this bit is set, the token is C++-only. */
2208 /* If this bit is set, the token is conditional: if there is a
2209 symbol of the same name, then the token is a symbol; otherwise,
2210 the token is a keyword. */
2219 enum exp_opcode opcode;
2220 enum token_flags flags;
2223 static const struct token tokentab3[] =
2225 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2226 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2227 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2228 {"...", DOTDOTDOT, BINOP_END, 0}
2231 static const struct token tokentab2[] =
2233 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2234 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2235 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2236 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2237 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2238 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2239 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2240 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2241 {"++", INCREMENT, BINOP_END, 0},
2242 {"--", DECREMENT, BINOP_END, 0},
2243 {"->", ARROW, BINOP_END, 0},
2244 {"&&", ANDAND, BINOP_END, 0},
2245 {"||", OROR, BINOP_END, 0},
2246 /* "::" is *not* only C++: gdb overrides its meaning in several
2247 different ways, e.g., 'filename'::func, function::variable. */
2248 {"::", COLONCOLON, BINOP_END, 0},
2249 {"<<", LSH, BINOP_END, 0},
2250 {">>", RSH, BINOP_END, 0},
2251 {"==", EQUAL, BINOP_END, 0},
2252 {"!=", NOTEQUAL, BINOP_END, 0},
2253 {"<=", LEQ, BINOP_END, 0},
2254 {">=", GEQ, BINOP_END, 0},
2255 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2258 /* Identifier-like tokens. */
2259 static const struct token ident_tokens[] =
2261 {"unsigned", UNSIGNED, OP_NULL, 0},
2262 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2263 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2264 {"struct", STRUCT, OP_NULL, 0},
2265 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2266 {"sizeof", SIZEOF, OP_NULL, 0},
2267 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2268 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2269 {"class", CLASS, OP_NULL, FLAG_CXX},
2270 {"union", UNION, OP_NULL, 0},
2271 {"short", SHORT, OP_NULL, 0},
2272 {"const", CONST_KEYWORD, OP_NULL, 0},
2273 {"enum", ENUM, OP_NULL, 0},
2274 {"long", LONG, OP_NULL, 0},
2275 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2276 {"int", INT_KEYWORD, OP_NULL, 0},
2277 {"new", NEW, OP_NULL, FLAG_CXX},
2278 {"delete", DELETE, OP_NULL, FLAG_CXX},
2279 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2281 {"and", ANDAND, BINOP_END, FLAG_CXX},
2282 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2283 {"bitand", '&', OP_NULL, FLAG_CXX},
2284 {"bitor", '|', OP_NULL, FLAG_CXX},
2285 {"compl", '~', OP_NULL, FLAG_CXX},
2286 {"not", '!', OP_NULL, FLAG_CXX},
2287 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2288 {"or", OROR, BINOP_END, FLAG_CXX},
2289 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2290 {"xor", '^', OP_NULL, FLAG_CXX},
2291 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2293 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2294 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2295 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2296 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2298 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2299 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2300 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2301 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2302 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW },
2304 {"typeid", TYPEID, OP_TYPEID, FLAG_CXX}
2307 /* When we find that lexptr (the global var defined in parse.c) is
2308 pointing at a macro invocation, we expand the invocation, and call
2309 scan_macro_expansion to save the old lexptr here and point lexptr
2310 into the expanded text. When we reach the end of that, we call
2311 end_macro_expansion to pop back to the value we saved here. The
2312 macro expansion code promises to return only fully-expanded text,
2313 so we don't need to "push" more than one level.
2315 This is disgusting, of course. It would be cleaner to do all macro
2316 expansion beforehand, and then hand that to lexptr. But we don't
2317 really know where the expression ends. Remember, in a command like
2319 (gdb) break *ADDRESS if CONDITION
2321 we evaluate ADDRESS in the scope of the current frame, but we
2322 evaluate CONDITION in the scope of the breakpoint's location. So
2323 it's simply wrong to try to macro-expand the whole thing at once. */
2324 static char *macro_original_text;
2326 /* We save all intermediate macro expansions on this obstack for the
2327 duration of a single parse. The expansion text may sometimes have
2328 to live past the end of the expansion, due to yacc lookahead.
2329 Rather than try to be clever about saving the data for a single
2330 token, we simply keep it all and delete it after parsing has
2332 static struct obstack expansion_obstack;
2335 scan_macro_expansion (char *expansion)
2339 /* We'd better not be trying to push the stack twice. */
2340 gdb_assert (! macro_original_text);
2342 /* Copy to the obstack, and then free the intermediate
2344 copy = obstack_copy0 (&expansion_obstack, expansion, strlen (expansion));
2347 /* Save the old lexptr value, so we can return to it when we're done
2348 parsing the expanded text. */
2349 macro_original_text = lexptr;
2355 scanning_macro_expansion (void)
2357 return macro_original_text != 0;
2362 finished_macro_expansion (void)
2364 /* There'd better be something to pop back to. */
2365 gdb_assert (macro_original_text);
2367 /* Pop back to the original text. */
2368 lexptr = macro_original_text;
2369 macro_original_text = 0;
2374 scan_macro_cleanup (void *dummy)
2376 if (macro_original_text)
2377 finished_macro_expansion ();
2379 obstack_free (&expansion_obstack, NULL);
2382 /* Return true iff the token represents a C++ cast operator. */
2385 is_cast_operator (const char *token, int len)
2387 return (! strncmp (token, "dynamic_cast", len)
2388 || ! strncmp (token, "static_cast", len)
2389 || ! strncmp (token, "reinterpret_cast", len)
2390 || ! strncmp (token, "const_cast", len));
2393 /* The scope used for macro expansion. */
2394 static struct macro_scope *expression_macro_scope;
2396 /* This is set if a NAME token appeared at the very end of the input
2397 string, with no whitespace separating the name from the EOF. This
2398 is used only when parsing to do field name completion. */
2399 static int saw_name_at_eof;
2401 /* This is set if the previously-returned token was a structure
2402 operator -- either '.' or ARROW. This is used only when parsing to
2403 do field name completion. */
2404 static int last_was_structop;
2406 /* Read one token, getting characters through lexptr. */
2409 lex_one_token (void)
2415 int saw_structop = last_was_structop;
2418 last_was_structop = 0;
2422 /* Check if this is a macro invocation that we need to expand. */
2423 if (! scanning_macro_expansion ())
2425 char *expanded = macro_expand_next (&lexptr,
2426 standard_macro_lookup,
2427 expression_macro_scope);
2430 scan_macro_expansion (expanded);
2433 prev_lexptr = lexptr;
2436 /* See if it is a special token of length 3. */
2437 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2438 if (strncmp (tokstart, tokentab3[i].operator, 3) == 0)
2440 if ((tokentab3[i].flags & FLAG_CXX) != 0
2441 && parse_language->la_language != language_cplus)
2445 yylval.opcode = tokentab3[i].opcode;
2446 return tokentab3[i].token;
2449 /* See if it is a special token of length 2. */
2450 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2451 if (strncmp (tokstart, tokentab2[i].operator, 2) == 0)
2453 if ((tokentab2[i].flags & FLAG_CXX) != 0
2454 && parse_language->la_language != language_cplus)
2458 yylval.opcode = tokentab2[i].opcode;
2459 if (parse_completion && tokentab2[i].token == ARROW)
2460 last_was_structop = 1;
2461 return tokentab2[i].token;
2464 switch (c = *tokstart)
2467 /* If we were just scanning the result of a macro expansion,
2468 then we need to resume scanning the original text.
2469 If we're parsing for field name completion, and the previous
2470 token allows such completion, return a COMPLETE token.
2471 Otherwise, we were already scanning the original text, and
2472 we're really done. */
2473 if (scanning_macro_expansion ())
2475 finished_macro_expansion ();
2478 else if (saw_name_at_eof)
2480 saw_name_at_eof = 0;
2483 else if (saw_structop)
2498 if (parse_language->la_language == language_objc && c == '[')
2504 if (paren_depth == 0)
2511 if (comma_terminates
2513 && ! scanning_macro_expansion ())
2519 /* Might be a floating point number. */
2520 if (lexptr[1] < '0' || lexptr[1] > '9')
2522 if (parse_completion)
2523 last_was_structop = 1;
2524 goto symbol; /* Nope, must be a symbol. */
2526 /* FALL THRU into number case. */
2539 /* It's a number. */
2540 int got_dot = 0, got_e = 0, toktype;
2542 int hex = input_radix > 10;
2544 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2549 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2557 /* This test includes !hex because 'e' is a valid hex digit
2558 and thus does not indicate a floating point number when
2559 the radix is hex. */
2560 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2561 got_dot = got_e = 1;
2562 /* This test does not include !hex, because a '.' always indicates
2563 a decimal floating point number regardless of the radix. */
2564 else if (!got_dot && *p == '.')
2566 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2567 && (*p == '-' || *p == '+'))
2568 /* This is the sign of the exponent, not the end of the
2571 /* We will take any letters or digits. parse_number will
2572 complain if past the radix, or if L or U are not final. */
2573 else if ((*p < '0' || *p > '9')
2574 && ((*p < 'a' || *p > 'z')
2575 && (*p < 'A' || *p > 'Z')))
2578 toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval);
2579 if (toktype == ERROR)
2581 char *err_copy = (char *) alloca (p - tokstart + 1);
2583 memcpy (err_copy, tokstart, p - tokstart);
2584 err_copy[p - tokstart] = 0;
2585 error (_("Invalid number \"%s\"."), err_copy);
2593 char *p = &tokstart[1];
2594 size_t len = strlen ("entry");
2596 if (parse_language->la_language == language_objc)
2598 size_t len = strlen ("selector");
2600 if (strncmp (p, "selector", len) == 0
2601 && (p[len] == '\0' || isspace (p[len])))
2610 while (isspace (*p))
2612 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2644 if (tokstart[1] != '"' && tokstart[1] != '\'')
2653 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2658 error (_("Empty character constant."));
2659 else if (host_len > 2 && c == '\'')
2662 namelen = lexptr - tokstart - 1;
2665 else if (host_len > 1)
2666 error (_("Invalid character constant."));
2672 if (!(c == '_' || c == '$'
2673 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2674 /* We must have come across a bad character (e.g. ';'). */
2675 error (_("Invalid character '%c' in expression."), c);
2677 /* It's a name. See how long it is. */
2679 for (c = tokstart[namelen];
2680 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2681 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2683 /* Template parameter lists are part of the name.
2684 FIXME: This mishandles `print $a<4&&$a>3'. */
2688 if (! is_cast_operator (tokstart, namelen))
2690 /* Scan ahead to get rest of the template specification. Note
2691 that we look ahead only when the '<' adjoins non-whitespace
2692 characters; for comparison expressions, e.g. "a < b > c",
2693 there must be spaces before the '<', etc. */
2695 char * p = find_template_name_end (tokstart + namelen);
2697 namelen = p - tokstart;
2701 c = tokstart[++namelen];
2704 /* The token "if" terminates the expression and is NOT removed from
2705 the input stream. It doesn't count if it appears in the
2706 expansion of a macro. */
2708 && tokstart[0] == 'i'
2709 && tokstart[1] == 'f'
2710 && ! scanning_macro_expansion ())
2715 /* For the same reason (breakpoint conditions), "thread N"
2716 terminates the expression. "thread" could be an identifier, but
2717 an identifier is never followed by a number without intervening
2718 punctuation. "task" is similar. Handle abbreviations of these,
2719 similarly to breakpoint.c:find_condition_and_thread. */
2721 && (strncmp (tokstart, "thread", namelen) == 0
2722 || strncmp (tokstart, "task", namelen) == 0)
2723 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2724 && ! scanning_macro_expansion ())
2726 char *p = tokstart + namelen + 1;
2727 while (*p == ' ' || *p == '\t')
2729 if (*p >= '0' && *p <= '9')
2737 yylval.sval.ptr = tokstart;
2738 yylval.sval.length = namelen;
2740 /* Catch specific keywords. */
2741 copy = copy_name (yylval.sval);
2742 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2743 if (strcmp (copy, ident_tokens[i].operator) == 0)
2745 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2746 && parse_language->la_language != language_cplus)
2749 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2751 struct field_of_this_result is_a_field_of_this;
2753 if (lookup_symbol (copy, expression_context_block,
2755 (parse_language->la_language == language_cplus
2756 ? &is_a_field_of_this
2760 /* The keyword is shadowed. */
2765 /* It is ok to always set this, even though we don't always
2766 strictly need to. */
2767 yylval.opcode = ident_tokens[i].opcode;
2768 return ident_tokens[i].token;
2771 if (*tokstart == '$')
2774 if (parse_completion && *lexptr == '\0')
2775 saw_name_at_eof = 1;
2777 yylval.ssym.stoken = yylval.sval;
2778 yylval.ssym.sym = NULL;
2779 yylval.ssym.is_a_field_of_this = 0;
2783 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2790 DEF_VEC_O (token_and_value);
2792 /* A FIFO of tokens that have been read but not yet returned to the
2794 static VEC (token_and_value) *token_fifo;
2796 /* Non-zero if the lexer should return tokens from the FIFO. */
2799 /* Temporary storage for c_lex; this holds symbol names as they are
2801 static struct obstack name_obstack;
2803 /* Classify a NAME token. The contents of the token are in `yylval'.
2804 Updates yylval and returns the new token type. BLOCK is the block
2805 in which lookups start; this can be NULL to mean the global
2808 classify_name (const struct block *block)
2812 struct field_of_this_result is_a_field_of_this;
2814 copy = copy_name (yylval.sval);
2816 /* Initialize this in case we *don't* use it in this call; that way
2817 we can refer to it unconditionally below. */
2818 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2820 sym = lookup_symbol (copy, block, VAR_DOMAIN,
2821 parse_language->la_name_of_this
2822 ? &is_a_field_of_this : NULL);
2824 if (sym && SYMBOL_CLASS (sym) == LOC_BLOCK)
2826 yylval.ssym.sym = sym;
2827 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2832 /* See if it's a file name. */
2833 struct symtab *symtab;
2835 symtab = lookup_symtab (copy);
2838 yylval.bval = BLOCKVECTOR_BLOCK (BLOCKVECTOR (symtab), STATIC_BLOCK);
2842 /* If we found a field of 'this', we might have erroneously
2843 found a constructor where we wanted a type name. Handle this
2844 case by noticing that we found a constructor and then look up
2845 the type tag instead. */
2846 if (is_a_field_of_this.type != NULL
2847 && is_a_field_of_this.fn_field != NULL
2848 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2851 struct field_of_this_result inner_is_a_field_of_this;
2853 sym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2854 &inner_is_a_field_of_this);
2857 yylval.tsym.type = SYMBOL_TYPE (sym);
2863 if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
2865 yylval.tsym.type = SYMBOL_TYPE (sym);
2870 = language_lookup_primitive_type_by_name (parse_language,
2871 parse_gdbarch, copy);
2872 if (yylval.tsym.type != NULL)
2875 /* See if it's an ObjC classname. */
2876 if (parse_language->la_language == language_objc && !sym)
2878 CORE_ADDR Class = lookup_objc_class (parse_gdbarch, copy);
2881 yylval.class.class = Class;
2882 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2884 yylval.class.type = SYMBOL_TYPE (sym);
2889 /* Input names that aren't symbols but ARE valid hex numbers, when
2890 the input radix permits them, can be names or numbers depending
2891 on the parse. Note we support radixes > 16 here. */
2893 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2894 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2896 YYSTYPE newlval; /* Its value is ignored. */
2897 int hextype = parse_number (copy, yylval.sval.length, 0, &newlval);
2900 yylval.ssym.sym = sym;
2901 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2906 /* Any other kind of symbol */
2907 yylval.ssym.sym = sym;
2908 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2911 && parse_language->la_language == language_cplus
2912 && is_a_field_of_this.type == NULL
2913 && !lookup_minimal_symbol (copy, NULL, NULL))
2914 return UNKNOWN_CPP_NAME;
2919 /* Like classify_name, but used by the inner loop of the lexer, when a
2920 name might have already been seen. CONTEXT is the context type, or
2921 NULL if this is the first component of a name. */
2924 classify_inner_name (const struct block *block, struct type *context)
2929 if (context == NULL)
2930 return classify_name (block);
2932 type = check_typedef (context);
2933 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
2934 && TYPE_CODE (type) != TYPE_CODE_UNION
2935 && TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
2938 copy = copy_name (yylval.ssym.stoken);
2939 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block);
2940 if (yylval.ssym.sym == NULL)
2943 switch (SYMBOL_CLASS (yylval.ssym.sym))
2950 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym);;
2956 internal_error (__FILE__, __LINE__, _("not reached"));
2959 /* The outer level of a two-level lexer. This calls the inner lexer
2960 to return tokens. It then either returns these tokens, or
2961 aggregates them into a larger token. This lets us work around a
2962 problem in our parsing approach, where the parser could not
2963 distinguish between qualified names and qualified types at the
2966 This approach is still not ideal, because it mishandles template
2967 types. See the comment in lex_one_token for an example. However,
2968 this is still an improvement over the earlier approach, and will
2969 suffice until we move to better parsing technology. */
2973 token_and_value current;
2974 int first_was_coloncolon, last_was_coloncolon;
2975 struct type *context_type = NULL;
2976 int last_to_examine, next_to_examine, checkpoint;
2977 const struct block *search_block;
2979 if (popping && !VEC_empty (token_and_value, token_fifo))
2983 /* Read the first token and decide what to do. Most of the
2984 subsequent code is C++-only; but also depends on seeing a "::" or
2986 current.token = lex_one_token ();
2987 if (current.token == NAME)
2988 current.token = classify_name (expression_context_block);
2989 if (parse_language->la_language != language_cplus
2990 || (current.token != TYPENAME && current.token != COLONCOLON
2991 && current.token != FILENAME))
2992 return current.token;
2994 /* Read any sequence of alternating "::" and name-like tokens into
2996 current.value = yylval;
2997 VEC_safe_push (token_and_value, token_fifo, ¤t);
2998 last_was_coloncolon = current.token == COLONCOLON;
3001 current.token = lex_one_token ();
3002 current.value = yylval;
3003 VEC_safe_push (token_and_value, token_fifo, ¤t);
3005 if ((last_was_coloncolon && current.token != NAME)
3006 || (!last_was_coloncolon && current.token != COLONCOLON))
3008 last_was_coloncolon = !last_was_coloncolon;
3012 /* We always read one extra token, so compute the number of tokens
3013 to examine accordingly. */
3014 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
3015 next_to_examine = 0;
3017 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
3020 obstack_free (&name_obstack, obstack_base (&name_obstack));
3022 if (current.token == FILENAME)
3023 search_block = current.value.bval;
3024 else if (current.token == COLONCOLON)
3025 search_block = NULL;
3028 gdb_assert (current.token == TYPENAME);
3029 search_block = expression_context_block;
3030 obstack_grow (&name_obstack, current.value.sval.ptr,
3031 current.value.sval.length);
3032 context_type = current.value.tsym.type;
3036 first_was_coloncolon = current.token == COLONCOLON;
3037 last_was_coloncolon = first_was_coloncolon;
3039 while (next_to_examine <= last_to_examine)
3041 token_and_value *next;
3043 next = VEC_index (token_and_value, token_fifo, next_to_examine);
3046 if (next->token == NAME && last_was_coloncolon)
3050 yylval = next->value;
3051 classification = classify_inner_name (search_block, context_type);
3052 /* We keep going until we either run out of names, or until
3053 we have a qualified name which is not a type. */
3054 if (classification != TYPENAME && classification != NAME)
3057 /* Accept up to this token. */
3058 checkpoint = next_to_examine;
3060 /* Update the partial name we are constructing. */
3061 if (context_type != NULL)
3063 /* We don't want to put a leading "::" into the name. */
3064 obstack_grow_str (&name_obstack, "::");
3066 obstack_grow (&name_obstack, next->value.sval.ptr,
3067 next->value.sval.length);
3069 yylval.sval.ptr = obstack_base (&name_obstack);
3070 yylval.sval.length = obstack_object_size (&name_obstack);
3071 current.value = yylval;
3072 current.token = classification;
3074 last_was_coloncolon = 0;
3076 if (classification == NAME)
3079 context_type = yylval.tsym.type;
3081 else if (next->token == COLONCOLON && !last_was_coloncolon)
3082 last_was_coloncolon = 1;
3085 /* We've reached the end of the name. */
3090 /* If we have a replacement token, install it as the first token in
3091 the FIFO, and delete the other constituent tokens. */
3094 current.value.sval.ptr = obstack_copy0 (&expansion_obstack,
3095 current.value.sval.ptr,
3096 current.value.sval.length);
3098 VEC_replace (token_and_value, token_fifo, 0, ¤t);
3100 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3104 current = *VEC_index (token_and_value, token_fifo, 0);
3105 VEC_ordered_remove (token_and_value, token_fifo, 0);
3106 yylval = current.value;
3107 return current.token;
3114 struct cleanup *back_to = make_cleanup (free_current_contents,
3115 &expression_macro_scope);
3117 /* Set up the scope for macro expansion. */
3118 expression_macro_scope = NULL;
3120 if (expression_context_block)
3121 expression_macro_scope
3122 = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3124 expression_macro_scope = default_macro_scope ();
3125 if (! expression_macro_scope)
3126 expression_macro_scope = user_macro_scope ();
3128 /* Initialize macro expansion code. */
3129 obstack_init (&expansion_obstack);
3130 gdb_assert (! macro_original_text);
3131 make_cleanup (scan_macro_cleanup, 0);
3133 make_cleanup_restore_integer (&yydebug);
3134 yydebug = parser_debug;
3136 /* Initialize some state used by the lexer. */
3137 last_was_structop = 0;
3138 saw_name_at_eof = 0;
3140 VEC_free (token_and_value, token_fifo);
3142 obstack_init (&name_obstack);
3143 make_cleanup_obstack_free (&name_obstack);
3145 result = yyparse ();
3146 do_cleanups (back_to);
3150 /* This is called via the YYPRINT macro when parser debugging is
3151 enabled. It prints a token's value. */
3154 c_print_token (FILE *file, int type, YYSTYPE value)
3159 fprintf (file, "typed_val_int<%s, %s>",
3160 TYPE_SAFE_NAME (value.typed_val_int.type),
3161 pulongest (value.typed_val_int.val));
3167 char *copy = alloca (value.tsval.length + 1);
3169 memcpy (copy, value.tsval.ptr, value.tsval.length);
3170 copy[value.tsval.length] = '\0';
3172 fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3178 fprintf (file, "sval<%s>", copy_name (value.sval));
3182 fprintf (file, "tsym<type=%s, name=%s>",
3183 TYPE_SAFE_NAME (value.tsym.type),
3184 copy_name (value.tsym.stoken));
3188 case UNKNOWN_CPP_NAME:
3191 fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3192 copy_name (value.ssym.stoken),
3193 (value.ssym.sym == NULL
3194 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym)),
3195 value.ssym.is_a_field_of_this);
3199 fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3208 lexptr = prev_lexptr;
3210 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);