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) *);
171 static void c_print_token (FILE *file, int type, YYSTYPE value);
172 #define YYPRINT(FILE, TYPE, VALUE) c_print_token (FILE, TYPE, VALUE)
175 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly
177 %type <tval> type typebase
178 %type <tvec> nonempty_typelist func_mod parameter_typelist
179 /* %type <bval> block */
181 /* Fancy type parsing. */
183 %type <lval> array_mod
184 %type <tval> conversion_type_id
186 %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl
188 %token <typed_val_int> INT
189 %token <typed_val_float> FLOAT
190 %token <typed_val_decfloat> DECFLOAT
192 /* Both NAME and TYPENAME tokens represent symbols in the input,
193 and both convey their data as strings.
194 But a TYPENAME is a string that happens to be defined as a typedef
195 or builtin type name (such as int or char)
196 and a NAME is any other symbol.
197 Contexts where this distinction is not important can use the
198 nonterminal "name", which matches either NAME or TYPENAME. */
200 %token <tsval> STRING
201 %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */
202 %token SELECTOR /* ObjC "@selector" pseudo-operator */
204 %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */
205 %token <ssym> UNKNOWN_CPP_NAME
206 %token <voidval> COMPLETE
207 %token <tsym> TYPENAME
208 %token <class> CLASSNAME /* ObjC Class name */
210 %type <svec> string_exp
211 %type <ssym> name_not_typename
212 %type <tsym> typename
214 /* This is like a '[' token, but is only generated when parsing
215 Objective C. This lets us reuse the same parser without
216 erroneously parsing ObjC-specific expressions in C. */
219 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
220 but which would parse as a valid number in the current input radix.
221 E.g. "c" when input_radix==16. Depending on the parse, it will be
222 turned into a name or into a number. */
224 %token <ssym> NAME_OR_INT
227 %token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON
231 %type <sval> operator
232 %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST
237 /* Special type cases, put in to allow the parser to distinguish different
239 %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD
241 %token <sval> VARIABLE
243 %token <opcode> ASSIGN_MODIFY
252 %right '=' ASSIGN_MODIFY
260 %left '<' '>' LEQ GEQ
265 %right UNARY INCREMENT DECREMENT
266 %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '('
267 %token <ssym> BLOCKNAME
268 %token <bval> FILENAME
282 { write_exp_elt_opcode(OP_TYPE);
283 write_exp_elt_type($1);
284 write_exp_elt_opcode(OP_TYPE);}
287 write_exp_elt_opcode (OP_TYPEOF);
289 | TYPEOF '(' type ')'
291 write_exp_elt_opcode (OP_TYPE);
292 write_exp_elt_type ($3);
293 write_exp_elt_opcode (OP_TYPE);
295 | DECLTYPE '(' exp ')'
297 write_exp_elt_opcode (OP_DECLTYPE);
301 /* Expressions, including the comma operator. */
304 { write_exp_elt_opcode (BINOP_COMMA); }
307 /* Expressions, not including the comma operator. */
308 exp : '*' exp %prec UNARY
309 { write_exp_elt_opcode (UNOP_IND); }
312 exp : '&' exp %prec UNARY
313 { write_exp_elt_opcode (UNOP_ADDR); }
316 exp : '-' exp %prec UNARY
317 { write_exp_elt_opcode (UNOP_NEG); }
320 exp : '+' exp %prec UNARY
321 { write_exp_elt_opcode (UNOP_PLUS); }
324 exp : '!' exp %prec UNARY
325 { write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
328 exp : '~' exp %prec UNARY
329 { write_exp_elt_opcode (UNOP_COMPLEMENT); }
332 exp : INCREMENT exp %prec UNARY
333 { write_exp_elt_opcode (UNOP_PREINCREMENT); }
336 exp : DECREMENT exp %prec UNARY
337 { write_exp_elt_opcode (UNOP_PREDECREMENT); }
340 exp : exp INCREMENT %prec UNARY
341 { write_exp_elt_opcode (UNOP_POSTINCREMENT); }
344 exp : exp DECREMENT %prec UNARY
345 { write_exp_elt_opcode (UNOP_POSTDECREMENT); }
348 exp : SIZEOF exp %prec UNARY
349 { write_exp_elt_opcode (UNOP_SIZEOF); }
353 { write_exp_elt_opcode (STRUCTOP_PTR);
354 write_exp_string ($3);
355 write_exp_elt_opcode (STRUCTOP_PTR); }
358 exp : exp ARROW name COMPLETE
359 { mark_struct_expression ();
360 write_exp_elt_opcode (STRUCTOP_PTR);
361 write_exp_string ($3);
362 write_exp_elt_opcode (STRUCTOP_PTR); }
365 exp : exp ARROW COMPLETE
367 mark_struct_expression ();
368 write_exp_elt_opcode (STRUCTOP_PTR);
371 write_exp_string (s);
372 write_exp_elt_opcode (STRUCTOP_PTR); }
375 exp : exp ARROW qualified_name
376 { /* exp->type::name becomes exp->*(&type::name) */
377 /* Note: this doesn't work if name is a
378 static member! FIXME */
379 write_exp_elt_opcode (UNOP_ADDR);
380 write_exp_elt_opcode (STRUCTOP_MPTR); }
383 exp : exp ARROW_STAR exp
384 { write_exp_elt_opcode (STRUCTOP_MPTR); }
388 { write_exp_elt_opcode (STRUCTOP_STRUCT);
389 write_exp_string ($3);
390 write_exp_elt_opcode (STRUCTOP_STRUCT); }
393 exp : exp '.' name COMPLETE
394 { mark_struct_expression ();
395 write_exp_elt_opcode (STRUCTOP_STRUCT);
396 write_exp_string ($3);
397 write_exp_elt_opcode (STRUCTOP_STRUCT); }
400 exp : exp '.' COMPLETE
402 mark_struct_expression ();
403 write_exp_elt_opcode (STRUCTOP_STRUCT);
406 write_exp_string (s);
407 write_exp_elt_opcode (STRUCTOP_STRUCT); }
410 exp : exp '.' qualified_name
411 { /* exp.type::name becomes exp.*(&type::name) */
412 /* Note: this doesn't work if name is a
413 static member! FIXME */
414 write_exp_elt_opcode (UNOP_ADDR);
415 write_exp_elt_opcode (STRUCTOP_MEMBER); }
418 exp : exp DOT_STAR exp
419 { write_exp_elt_opcode (STRUCTOP_MEMBER); }
422 exp : exp '[' exp1 ']'
423 { write_exp_elt_opcode (BINOP_SUBSCRIPT); }
426 exp : exp OBJC_LBRAC exp1 ']'
427 { write_exp_elt_opcode (BINOP_SUBSCRIPT); }
431 * The rules below parse ObjC message calls of the form:
432 * '[' target selector {':' argument}* ']'
435 exp : OBJC_LBRAC TYPENAME
439 class = lookup_objc_class (parse_gdbarch,
440 copy_name ($2.stoken));
442 error (_("%s is not an ObjC Class"),
443 copy_name ($2.stoken));
444 write_exp_elt_opcode (OP_LONG);
445 write_exp_elt_type (parse_type->builtin_int);
446 write_exp_elt_longcst ((LONGEST) class);
447 write_exp_elt_opcode (OP_LONG);
451 { write_exp_elt_opcode (OP_OBJC_MSGCALL);
453 write_exp_elt_opcode (OP_OBJC_MSGCALL);
457 exp : OBJC_LBRAC CLASSNAME
459 write_exp_elt_opcode (OP_LONG);
460 write_exp_elt_type (parse_type->builtin_int);
461 write_exp_elt_longcst ((LONGEST) $2.class);
462 write_exp_elt_opcode (OP_LONG);
466 { write_exp_elt_opcode (OP_OBJC_MSGCALL);
468 write_exp_elt_opcode (OP_OBJC_MSGCALL);
475 { write_exp_elt_opcode (OP_OBJC_MSGCALL);
477 write_exp_elt_opcode (OP_OBJC_MSGCALL);
482 { add_msglist(&$1, 0); }
490 msgarg : name ':' exp
491 { add_msglist(&$1, 1); }
492 | ':' exp /* Unnamed arg. */
493 { add_msglist(0, 1); }
494 | ',' exp /* Variable number of args. */
495 { add_msglist(0, 0); }
499 /* This is to save the value of arglist_len
500 being accumulated by an outer function call. */
501 { start_arglist (); }
502 arglist ')' %prec ARROW
503 { write_exp_elt_opcode (OP_FUNCALL);
504 write_exp_elt_longcst ((LONGEST) end_arglist ());
505 write_exp_elt_opcode (OP_FUNCALL); }
508 exp : UNKNOWN_CPP_NAME '('
510 /* This could potentially be a an argument defined
511 lookup function (Koenig). */
512 write_exp_elt_opcode (OP_ADL_FUNC);
513 write_exp_elt_block (expression_context_block);
514 write_exp_elt_sym (NULL); /* Placeholder. */
515 write_exp_string ($1.stoken);
516 write_exp_elt_opcode (OP_ADL_FUNC);
518 /* This is to save the value of arglist_len
519 being accumulated by an outer function call. */
523 arglist ')' %prec ARROW
525 write_exp_elt_opcode (OP_FUNCALL);
526 write_exp_elt_longcst ((LONGEST) end_arglist ());
527 write_exp_elt_opcode (OP_FUNCALL);
532 { start_arglist (); }
542 arglist : arglist ',' exp %prec ABOVE_COMMA
546 exp : exp '(' parameter_typelist ')' const_or_volatile
548 VEC (type_ptr) *type_list = $3;
549 struct type *type_elt;
550 LONGEST len = VEC_length (type_ptr, type_list);
552 write_exp_elt_opcode (TYPE_INSTANCE);
553 write_exp_elt_longcst (len);
555 VEC_iterate (type_ptr, type_list, i, type_elt);
557 write_exp_elt_type (type_elt);
558 write_exp_elt_longcst(len);
559 write_exp_elt_opcode (TYPE_INSTANCE);
560 VEC_free (type_ptr, type_list);
565 { $$ = end_arglist () - 1; }
567 exp : lcurly arglist rcurly %prec ARROW
568 { write_exp_elt_opcode (OP_ARRAY);
569 write_exp_elt_longcst ((LONGEST) 0);
570 write_exp_elt_longcst ((LONGEST) $3);
571 write_exp_elt_opcode (OP_ARRAY); }
574 exp : lcurly type_exp rcurly exp %prec UNARY
575 { write_exp_elt_opcode (UNOP_MEMVAL_TYPE); }
578 exp : '(' type_exp ')' exp %prec UNARY
579 { write_exp_elt_opcode (UNOP_CAST_TYPE); }
586 /* Binary operators in order of decreasing precedence. */
589 { write_exp_elt_opcode (BINOP_REPEAT); }
593 { write_exp_elt_opcode (BINOP_MUL); }
597 { write_exp_elt_opcode (BINOP_DIV); }
601 { write_exp_elt_opcode (BINOP_REM); }
605 { write_exp_elt_opcode (BINOP_ADD); }
609 { write_exp_elt_opcode (BINOP_SUB); }
613 { write_exp_elt_opcode (BINOP_LSH); }
617 { write_exp_elt_opcode (BINOP_RSH); }
621 { write_exp_elt_opcode (BINOP_EQUAL); }
624 exp : exp NOTEQUAL exp
625 { write_exp_elt_opcode (BINOP_NOTEQUAL); }
629 { write_exp_elt_opcode (BINOP_LEQ); }
633 { write_exp_elt_opcode (BINOP_GEQ); }
637 { write_exp_elt_opcode (BINOP_LESS); }
641 { write_exp_elt_opcode (BINOP_GTR); }
645 { write_exp_elt_opcode (BINOP_BITWISE_AND); }
649 { write_exp_elt_opcode (BINOP_BITWISE_XOR); }
653 { write_exp_elt_opcode (BINOP_BITWISE_IOR); }
657 { write_exp_elt_opcode (BINOP_LOGICAL_AND); }
661 { write_exp_elt_opcode (BINOP_LOGICAL_OR); }
664 exp : exp '?' exp ':' exp %prec '?'
665 { write_exp_elt_opcode (TERNOP_COND); }
669 { write_exp_elt_opcode (BINOP_ASSIGN); }
672 exp : exp ASSIGN_MODIFY exp
673 { write_exp_elt_opcode (BINOP_ASSIGN_MODIFY);
674 write_exp_elt_opcode ($2);
675 write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); }
679 { write_exp_elt_opcode (OP_LONG);
680 write_exp_elt_type ($1.type);
681 write_exp_elt_longcst ((LONGEST)($1.val));
682 write_exp_elt_opcode (OP_LONG); }
687 struct stoken_vector vec;
690 write_exp_string_vector ($1.type, &vec);
696 parse_number ($1.stoken.ptr, $1.stoken.length, 0, &val);
697 write_exp_elt_opcode (OP_LONG);
698 write_exp_elt_type (val.typed_val_int.type);
699 write_exp_elt_longcst ((LONGEST)val.typed_val_int.val);
700 write_exp_elt_opcode (OP_LONG);
706 { write_exp_elt_opcode (OP_DOUBLE);
707 write_exp_elt_type ($1.type);
708 write_exp_elt_dblcst ($1.dval);
709 write_exp_elt_opcode (OP_DOUBLE); }
713 { write_exp_elt_opcode (OP_DECFLOAT);
714 write_exp_elt_type ($1.type);
715 write_exp_elt_decfloatcst ($1.val);
716 write_exp_elt_opcode (OP_DECFLOAT); }
724 write_dollar_variable ($1);
728 exp : SELECTOR '(' name ')'
730 write_exp_elt_opcode (OP_OBJC_SELECTOR);
731 write_exp_string ($3);
732 write_exp_elt_opcode (OP_OBJC_SELECTOR); }
735 exp : SIZEOF '(' type ')' %prec UNARY
736 { write_exp_elt_opcode (OP_LONG);
737 write_exp_elt_type (lookup_signed_typename
738 (parse_language, parse_gdbarch,
741 write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3));
742 write_exp_elt_opcode (OP_LONG); }
745 exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
746 { write_exp_elt_opcode (UNOP_REINTERPRET_CAST); }
749 exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
750 { write_exp_elt_opcode (UNOP_CAST_TYPE); }
753 exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
754 { write_exp_elt_opcode (UNOP_DYNAMIC_CAST); }
757 exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY
758 { /* We could do more error checking here, but
759 it doesn't seem worthwhile. */
760 write_exp_elt_opcode (UNOP_CAST_TYPE); }
766 /* We copy the string here, and not in the
767 lexer, to guarantee that we do not leak a
768 string. Note that we follow the
769 NUL-termination convention of the
771 struct typed_stoken *vec = XNEW (struct typed_stoken);
776 vec->length = $1.length;
777 vec->ptr = malloc ($1.length + 1);
778 memcpy (vec->ptr, $1.ptr, $1.length + 1);
783 /* Note that we NUL-terminate here, but just
787 $$.tokens = realloc ($$.tokens,
788 $$.len * sizeof (struct typed_stoken));
790 p = malloc ($2.length + 1);
791 memcpy (p, $2.ptr, $2.length + 1);
793 $$.tokens[$$.len - 1].type = $2.type;
794 $$.tokens[$$.len - 1].length = $2.length;
795 $$.tokens[$$.len - 1].ptr = p;
802 enum c_string_type type = C_STRING;
804 for (i = 0; i < $1.len; ++i)
806 switch ($1.tokens[i].type)
814 && type != $1.tokens[i].type)
815 error (_("Undefined string concatenation."));
816 type = $1.tokens[i].type;
820 internal_error (__FILE__, __LINE__,
821 "unrecognized type in string concatenation");
825 write_exp_string_vector (type, &$1);
826 for (i = 0; i < $1.len; ++i)
827 free ($1.tokens[i].ptr);
832 exp : NSSTRING /* ObjC NextStep NSString constant
833 * of the form '@' '"' string '"'.
835 { write_exp_elt_opcode (OP_OBJC_NSSTRING);
836 write_exp_string ($1);
837 write_exp_elt_opcode (OP_OBJC_NSSTRING); }
842 { write_exp_elt_opcode (OP_LONG);
843 write_exp_elt_type (parse_type->builtin_bool);
844 write_exp_elt_longcst ((LONGEST) 1);
845 write_exp_elt_opcode (OP_LONG); }
849 { write_exp_elt_opcode (OP_LONG);
850 write_exp_elt_type (parse_type->builtin_bool);
851 write_exp_elt_longcst ((LONGEST) 0);
852 write_exp_elt_opcode (OP_LONG); }
860 $$ = SYMBOL_BLOCK_VALUE ($1.sym);
862 error (_("No file or function \"%s\"."),
863 copy_name ($1.stoken));
871 block : block COLONCOLON name
873 = lookup_symbol (copy_name ($3), $1,
875 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
876 error (_("No function \"%s\" in specified context."),
878 $$ = SYMBOL_BLOCK_VALUE (tem); }
881 variable: name_not_typename ENTRY
882 { struct symbol *sym = $1.sym;
884 if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym)
885 || !symbol_read_needs_frame (sym))
886 error (_("@entry can be used only for function "
887 "parameters, not for \"%s\""),
888 copy_name ($1.stoken));
890 write_exp_elt_opcode (OP_VAR_ENTRY_VALUE);
891 write_exp_elt_sym (sym);
892 write_exp_elt_opcode (OP_VAR_ENTRY_VALUE);
896 variable: block COLONCOLON name
897 { struct symbol *sym;
898 sym = lookup_symbol (copy_name ($3), $1,
901 error (_("No symbol \"%s\" in specified context."),
903 if (symbol_read_needs_frame (sym))
905 if (innermost_block == 0
906 || contained_in (block_found,
908 innermost_block = block_found;
911 write_exp_elt_opcode (OP_VAR_VALUE);
912 /* block_found is set by lookup_symbol. */
913 write_exp_elt_block (block_found);
914 write_exp_elt_sym (sym);
915 write_exp_elt_opcode (OP_VAR_VALUE); }
918 qualified_name: TYPENAME COLONCOLON name
920 struct type *type = $1.type;
921 CHECK_TYPEDEF (type);
922 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
923 && TYPE_CODE (type) != TYPE_CODE_UNION
924 && TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
925 error (_("`%s' is not defined as an aggregate type."),
926 TYPE_SAFE_NAME (type));
928 write_exp_elt_opcode (OP_SCOPE);
929 write_exp_elt_type (type);
930 write_exp_string ($3);
931 write_exp_elt_opcode (OP_SCOPE);
933 | TYPENAME COLONCOLON '~' name
935 struct type *type = $1.type;
936 struct stoken tmp_token;
937 CHECK_TYPEDEF (type);
938 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
939 && TYPE_CODE (type) != TYPE_CODE_UNION
940 && TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
941 error (_("`%s' is not defined as an aggregate type."),
942 TYPE_SAFE_NAME (type));
944 tmp_token.ptr = (char*) alloca ($4.length + 2);
945 tmp_token.length = $4.length + 1;
946 tmp_token.ptr[0] = '~';
947 memcpy (tmp_token.ptr+1, $4.ptr, $4.length);
948 tmp_token.ptr[tmp_token.length] = 0;
950 /* Check for valid destructor name. */
951 destructor_name_p (tmp_token.ptr, $1.type);
952 write_exp_elt_opcode (OP_SCOPE);
953 write_exp_elt_type (type);
954 write_exp_string (tmp_token);
955 write_exp_elt_opcode (OP_SCOPE);
957 | TYPENAME COLONCOLON name COLONCOLON name
959 char *copy = copy_name ($3);
960 error (_("No type \"%s\" within class "
961 "or namespace \"%s\"."),
962 copy, TYPE_SAFE_NAME ($1.type));
966 variable: qualified_name
967 | COLONCOLON name_not_typename
969 char *name = copy_name ($2.stoken);
971 struct minimal_symbol *msymbol;
974 lookup_symbol (name, (const struct block *) NULL,
978 write_exp_elt_opcode (OP_VAR_VALUE);
979 write_exp_elt_block (NULL);
980 write_exp_elt_sym (sym);
981 write_exp_elt_opcode (OP_VAR_VALUE);
985 msymbol = lookup_minimal_symbol (name, NULL, NULL);
987 write_exp_msymbol (msymbol);
988 else if (!have_full_symbols () && !have_partial_symbols ())
989 error (_("No symbol table is loaded. Use the \"file\" command."));
991 error (_("No symbol \"%s\" in current context."), name);
995 variable: name_not_typename
996 { struct symbol *sym = $1.sym;
1000 if (symbol_read_needs_frame (sym))
1002 if (innermost_block == 0
1003 || contained_in (block_found,
1005 innermost_block = block_found;
1008 write_exp_elt_opcode (OP_VAR_VALUE);
1009 /* We want to use the selected frame, not
1010 another more inner frame which happens to
1011 be in the same block. */
1012 write_exp_elt_block (NULL);
1013 write_exp_elt_sym (sym);
1014 write_exp_elt_opcode (OP_VAR_VALUE);
1016 else if ($1.is_a_field_of_this)
1018 /* C++: it hangs off of `this'. Must
1019 not inadvertently convert from a method call
1021 if (innermost_block == 0
1022 || contained_in (block_found,
1024 innermost_block = block_found;
1025 write_exp_elt_opcode (OP_THIS);
1026 write_exp_elt_opcode (OP_THIS);
1027 write_exp_elt_opcode (STRUCTOP_PTR);
1028 write_exp_string ($1.stoken);
1029 write_exp_elt_opcode (STRUCTOP_PTR);
1033 struct minimal_symbol *msymbol;
1034 char *arg = copy_name ($1.stoken);
1037 lookup_minimal_symbol (arg, NULL, NULL);
1038 if (msymbol != NULL)
1039 write_exp_msymbol (msymbol);
1040 else if (!have_full_symbols () && !have_partial_symbols ())
1041 error (_("No symbol table is loaded. Use the \"file\" command."));
1043 error (_("No symbol \"%s\" in current context."),
1044 copy_name ($1.stoken));
1049 space_identifier : '@' NAME
1050 { insert_type_address_space (copy_name ($2.stoken)); }
1053 const_or_volatile: const_or_volatile_noopt
1057 cv_with_space_id : const_or_volatile space_identifier const_or_volatile
1060 const_or_volatile_or_space_identifier_noopt: cv_with_space_id
1061 | const_or_volatile_noopt
1064 const_or_volatile_or_space_identifier:
1065 const_or_volatile_or_space_identifier_noopt
1071 { insert_type (tp_pointer); }
1072 const_or_volatile_or_space_identifier
1074 { insert_type (tp_pointer); }
1075 const_or_volatile_or_space_identifier
1077 { insert_type (tp_reference); }
1079 { insert_type (tp_reference); }
1082 ptr_operator_ts: ptr_operator
1084 $$ = get_type_stack ();
1085 /* This cleanup is eventually run by
1087 make_cleanup (type_stack_cleanup, $$);
1091 abs_decl: ptr_operator_ts direct_abs_decl
1092 { $$ = append_type_stack ($2, $1); }
1097 direct_abs_decl: '(' abs_decl ')'
1099 | direct_abs_decl array_mod
1101 push_type_stack ($1);
1103 push_type (tp_array);
1104 $$ = get_type_stack ();
1109 push_type (tp_array);
1110 $$ = get_type_stack ();
1113 | direct_abs_decl func_mod
1115 push_type_stack ($1);
1117 $$ = get_type_stack ();
1122 $$ = get_type_stack ();
1132 | OBJC_LBRAC INT ']'
1138 | '(' parameter_typelist ')'
1142 /* We used to try to recognize pointer to member types here, but
1143 that didn't work (shift/reduce conflicts meant that these rules never
1144 got executed). The problem is that
1145 int (foo::bar::baz::bizzle)
1146 is a function type but
1147 int (foo::bar::baz::bizzle::*)
1148 is a pointer to member type. Stroustrup loses again! */
1153 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
1157 { $$ = lookup_signed_typename (parse_language,
1161 { $$ = lookup_signed_typename (parse_language,
1165 { $$ = lookup_signed_typename (parse_language,
1169 { $$ = lookup_signed_typename (parse_language,
1172 | LONG SIGNED_KEYWORD INT_KEYWORD
1173 { $$ = lookup_signed_typename (parse_language,
1176 | LONG SIGNED_KEYWORD
1177 { $$ = lookup_signed_typename (parse_language,
1180 | SIGNED_KEYWORD LONG INT_KEYWORD
1181 { $$ = lookup_signed_typename (parse_language,
1184 | UNSIGNED LONG INT_KEYWORD
1185 { $$ = lookup_unsigned_typename (parse_language,
1188 | LONG UNSIGNED INT_KEYWORD
1189 { $$ = lookup_unsigned_typename (parse_language,
1193 { $$ = lookup_unsigned_typename (parse_language,
1197 { $$ = lookup_signed_typename (parse_language,
1200 | LONG LONG INT_KEYWORD
1201 { $$ = lookup_signed_typename (parse_language,
1204 | LONG LONG SIGNED_KEYWORD INT_KEYWORD
1205 { $$ = lookup_signed_typename (parse_language,
1208 | LONG LONG SIGNED_KEYWORD
1209 { $$ = lookup_signed_typename (parse_language,
1212 | SIGNED_KEYWORD LONG LONG
1213 { $$ = lookup_signed_typename (parse_language,
1216 | SIGNED_KEYWORD LONG LONG INT_KEYWORD
1217 { $$ = lookup_signed_typename (parse_language,
1220 | UNSIGNED LONG LONG
1221 { $$ = lookup_unsigned_typename (parse_language,
1224 | UNSIGNED LONG LONG INT_KEYWORD
1225 { $$ = lookup_unsigned_typename (parse_language,
1228 | LONG LONG UNSIGNED
1229 { $$ = lookup_unsigned_typename (parse_language,
1232 | LONG LONG UNSIGNED INT_KEYWORD
1233 { $$ = lookup_unsigned_typename (parse_language,
1237 { $$ = lookup_signed_typename (parse_language,
1240 | SHORT SIGNED_KEYWORD INT_KEYWORD
1241 { $$ = lookup_signed_typename (parse_language,
1244 | SHORT SIGNED_KEYWORD
1245 { $$ = lookup_signed_typename (parse_language,
1248 | UNSIGNED SHORT INT_KEYWORD
1249 { $$ = lookup_unsigned_typename (parse_language,
1253 { $$ = lookup_unsigned_typename (parse_language,
1256 | SHORT UNSIGNED INT_KEYWORD
1257 { $$ = lookup_unsigned_typename (parse_language,
1261 { $$ = lookup_typename (parse_language, parse_gdbarch,
1262 "double", (struct block *) NULL,
1264 | LONG DOUBLE_KEYWORD
1265 { $$ = lookup_typename (parse_language, parse_gdbarch,
1267 (struct block *) NULL, 0); }
1269 { $$ = lookup_struct (copy_name ($2),
1270 expression_context_block); }
1273 mark_completion_tag (TYPE_CODE_STRUCT, "", 0);
1276 | STRUCT name COMPLETE
1278 mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr,
1283 { $$ = lookup_struct (copy_name ($2),
1284 expression_context_block); }
1287 mark_completion_tag (TYPE_CODE_CLASS, "", 0);
1290 | CLASS name COMPLETE
1292 mark_completion_tag (TYPE_CODE_CLASS, $2.ptr,
1297 { $$ = lookup_union (copy_name ($2),
1298 expression_context_block); }
1301 mark_completion_tag (TYPE_CODE_UNION, "", 0);
1304 | UNION name COMPLETE
1306 mark_completion_tag (TYPE_CODE_UNION, $2.ptr,
1311 { $$ = lookup_enum (copy_name ($2),
1312 expression_context_block); }
1315 mark_completion_tag (TYPE_CODE_ENUM, "", 0);
1318 | ENUM name COMPLETE
1320 mark_completion_tag (TYPE_CODE_ENUM, $2.ptr,
1325 { $$ = lookup_unsigned_typename (parse_language,
1327 TYPE_NAME($2.type)); }
1329 { $$ = lookup_unsigned_typename (parse_language,
1332 | SIGNED_KEYWORD typename
1333 { $$ = lookup_signed_typename (parse_language,
1335 TYPE_NAME($2.type)); }
1337 { $$ = lookup_signed_typename (parse_language,
1340 /* It appears that this rule for templates is never
1341 reduced; template recognition happens by lookahead
1342 in the token processing code in yylex. */
1343 | TEMPLATE name '<' type '>'
1344 { $$ = lookup_template_type(copy_name($2), $4,
1345 expression_context_block);
1347 | const_or_volatile_or_space_identifier_noopt typebase
1348 { $$ = follow_types ($2); }
1349 | typebase const_or_volatile_or_space_identifier_noopt
1350 { $$ = follow_types ($1); }
1356 $$.stoken.ptr = "int";
1357 $$.stoken.length = 3;
1358 $$.type = lookup_signed_typename (parse_language,
1364 $$.stoken.ptr = "long";
1365 $$.stoken.length = 4;
1366 $$.type = lookup_signed_typename (parse_language,
1372 $$.stoken.ptr = "short";
1373 $$.stoken.length = 5;
1374 $$.type = lookup_signed_typename (parse_language,
1382 { check_parameter_typelist ($1); }
1383 | nonempty_typelist ',' DOTDOTDOT
1385 VEC_safe_push (type_ptr, $1, NULL);
1386 check_parameter_typelist ($1);
1394 VEC (type_ptr) *typelist = NULL;
1395 VEC_safe_push (type_ptr, typelist, $1);
1398 | nonempty_typelist ',' type
1400 VEC_safe_push (type_ptr, $1, $3);
1408 push_type_stack ($2);
1409 $$ = follow_types ($1);
1413 conversion_type_id: typebase conversion_declarator
1414 { $$ = follow_types ($1); }
1417 conversion_declarator: /* Nothing. */
1418 | ptr_operator conversion_declarator
1421 const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD
1422 | VOLATILE_KEYWORD CONST_KEYWORD
1425 const_or_volatile_noopt: const_and_volatile
1426 { insert_type (tp_const);
1427 insert_type (tp_volatile);
1430 { insert_type (tp_const); }
1432 { insert_type (tp_volatile); }
1435 operator: OPERATOR NEW
1436 { $$ = operator_stoken (" new"); }
1438 { $$ = operator_stoken (" delete"); }
1439 | OPERATOR NEW '[' ']'
1440 { $$ = operator_stoken (" new[]"); }
1441 | OPERATOR DELETE '[' ']'
1442 { $$ = operator_stoken (" delete[]"); }
1443 | OPERATOR NEW OBJC_LBRAC ']'
1444 { $$ = operator_stoken (" new[]"); }
1445 | OPERATOR DELETE OBJC_LBRAC ']'
1446 { $$ = operator_stoken (" delete[]"); }
1448 { $$ = operator_stoken ("+"); }
1450 { $$ = operator_stoken ("-"); }
1452 { $$ = operator_stoken ("*"); }
1454 { $$ = operator_stoken ("/"); }
1456 { $$ = operator_stoken ("%"); }
1458 { $$ = operator_stoken ("^"); }
1460 { $$ = operator_stoken ("&"); }
1462 { $$ = operator_stoken ("|"); }
1464 { $$ = operator_stoken ("~"); }
1466 { $$ = operator_stoken ("!"); }
1468 { $$ = operator_stoken ("="); }
1470 { $$ = operator_stoken ("<"); }
1472 { $$ = operator_stoken (">"); }
1473 | OPERATOR ASSIGN_MODIFY
1474 { const char *op = "unknown";
1498 case BINOP_BITWISE_IOR:
1501 case BINOP_BITWISE_AND:
1504 case BINOP_BITWISE_XOR:
1511 $$ = operator_stoken (op);
1514 { $$ = operator_stoken ("<<"); }
1516 { $$ = operator_stoken (">>"); }
1518 { $$ = operator_stoken ("=="); }
1520 { $$ = operator_stoken ("!="); }
1522 { $$ = operator_stoken ("<="); }
1524 { $$ = operator_stoken (">="); }
1526 { $$ = operator_stoken ("&&"); }
1528 { $$ = operator_stoken ("||"); }
1529 | OPERATOR INCREMENT
1530 { $$ = operator_stoken ("++"); }
1531 | OPERATOR DECREMENT
1532 { $$ = operator_stoken ("--"); }
1534 { $$ = operator_stoken (","); }
1535 | OPERATOR ARROW_STAR
1536 { $$ = operator_stoken ("->*"); }
1538 { $$ = operator_stoken ("->"); }
1540 { $$ = operator_stoken ("()"); }
1542 { $$ = operator_stoken ("[]"); }
1543 | OPERATOR OBJC_LBRAC ']'
1544 { $$ = operator_stoken ("[]"); }
1545 | OPERATOR conversion_type_id
1548 struct ui_file *buf = mem_fileopen ();
1550 c_print_type ($2, NULL, buf, -1, 0,
1551 &type_print_raw_options);
1552 name = ui_file_xstrdup (buf, &length);
1553 ui_file_delete (buf);
1554 $$ = operator_stoken (name);
1561 name : NAME { $$ = $1.stoken; }
1562 | BLOCKNAME { $$ = $1.stoken; }
1563 | TYPENAME { $$ = $1.stoken; }
1564 | NAME_OR_INT { $$ = $1.stoken; }
1565 | UNKNOWN_CPP_NAME { $$ = $1.stoken; }
1566 | operator { $$ = $1; }
1569 name_not_typename : NAME
1571 /* These would be useful if name_not_typename was useful, but it is just
1572 a fake for "variable", so these cause reduce/reduce conflicts because
1573 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
1574 =exp) or just an exp. If name_not_typename was ever used in an lvalue
1575 context where only a name could occur, this might be useful.
1580 struct field_of_this_result is_a_field_of_this;
1583 $$.sym = lookup_symbol ($1.ptr,
1584 expression_context_block,
1586 &is_a_field_of_this);
1587 $$.is_a_field_of_this
1588 = is_a_field_of_this.type != NULL;
1595 /* Returns a stoken of the operator name given by OP (which does not
1596 include the string "operator"). */
1597 static struct stoken
1598 operator_stoken (const char *op)
1600 static const char *operator_string = "operator";
1601 struct stoken st = { NULL, 0 };
1602 st.length = strlen (operator_string) + strlen (op);
1603 st.ptr = malloc (st.length + 1);
1604 strcpy (st.ptr, operator_string);
1605 strcat (st.ptr, op);
1607 /* The toplevel (c_parse) will free the memory allocated here. */
1608 make_cleanup (free, st.ptr);
1612 /* Validate a parameter typelist. */
1615 check_parameter_typelist (VEC (type_ptr) *params)
1620 for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix)
1622 if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID)
1626 if (VEC_length (type_ptr, params) == 1)
1631 VEC_free (type_ptr, params);
1632 error (_("parameter types following 'void'"));
1636 VEC_free (type_ptr, params);
1637 error (_("'void' invalid as parameter type"));
1643 /* Take care of parsing a number (anything that starts with a digit).
1644 Set yylval and return the token type; update lexptr.
1645 LEN is the number of characters in it. */
1647 /*** Needs some error checking for the float case ***/
1650 parse_number (char *p, int len, int parsed_float, YYSTYPE *putithere)
1652 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
1653 here, and we do kind of silly things like cast to unsigned. */
1660 int base = input_radix;
1663 /* Number of "L" suffixes encountered. */
1666 /* We have found a "L" or "U" suffix. */
1667 int found_suffix = 0;
1670 struct type *signed_type;
1671 struct type *unsigned_type;
1675 /* If it ends at "df", "dd" or "dl", take it as type of decimal floating
1676 point. Return DECFLOAT. */
1678 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f')
1681 putithere->typed_val_decfloat.type
1682 = parse_type->builtin_decfloat;
1683 decimal_from_string (putithere->typed_val_decfloat.val, 4,
1684 gdbarch_byte_order (parse_gdbarch), p);
1689 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd')
1692 putithere->typed_val_decfloat.type
1693 = parse_type->builtin_decdouble;
1694 decimal_from_string (putithere->typed_val_decfloat.val, 8,
1695 gdbarch_byte_order (parse_gdbarch), p);
1700 if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l')
1703 putithere->typed_val_decfloat.type
1704 = parse_type->builtin_declong;
1705 decimal_from_string (putithere->typed_val_decfloat.val, 16,
1706 gdbarch_byte_order (parse_gdbarch), p);
1711 if (! parse_c_float (parse_gdbarch, p, len,
1712 &putithere->typed_val_float.dval,
1713 &putithere->typed_val_float.type))
1718 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
1762 if (c >= 'A' && c <= 'Z')
1764 if (c != 'l' && c != 'u')
1766 if (c >= '0' && c <= '9')
1774 if (base > 10 && c >= 'a' && c <= 'f')
1778 n += i = c - 'a' + 10;
1791 return ERROR; /* Char not a digit */
1794 return ERROR; /* Invalid digit in this base */
1796 /* Portably test for overflow (only works for nonzero values, so make
1797 a second check for zero). FIXME: Can't we just make n and prevn
1798 unsigned and avoid this? */
1799 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1800 unsigned_p = 1; /* Try something unsigned */
1802 /* Portably test for unsigned overflow.
1803 FIXME: This check is wrong; for example it doesn't find overflow
1804 on 0x123456789 when LONGEST is 32 bits. */
1805 if (c != 'l' && c != 'u' && n != 0)
1807 if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n))
1808 error (_("Numeric constant too large."));
1813 /* An integer constant is an int, a long, or a long long. An L
1814 suffix forces it to be long; an LL suffix forces it to be long
1815 long. If not forced to a larger size, it gets the first type of
1816 the above that it fits in. To figure out whether it fits, we
1817 shift it right and see whether anything remains. Note that we
1818 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1819 operation, because many compilers will warn about such a shift
1820 (which always produces a zero result). Sometimes gdbarch_int_bit
1821 or gdbarch_long_bit will be that big, sometimes not. To deal with
1822 the case where it is we just always shift the value more than
1823 once, with fewer bits each time. */
1825 un = (ULONGEST)n >> 2;
1827 && (un >> (gdbarch_int_bit (parse_gdbarch) - 2)) == 0)
1829 high_bit = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch) - 1);
1831 /* A large decimal (not hex or octal) constant (between INT_MAX
1832 and UINT_MAX) is a long or unsigned long, according to ANSI,
1833 never an unsigned int, but this code treats it as unsigned
1834 int. This probably should be fixed. GCC gives a warning on
1837 unsigned_type = parse_type->builtin_unsigned_int;
1838 signed_type = parse_type->builtin_int;
1840 else if (long_p <= 1
1841 && (un >> (gdbarch_long_bit (parse_gdbarch) - 2)) == 0)
1843 high_bit = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch) - 1);
1844 unsigned_type = parse_type->builtin_unsigned_long;
1845 signed_type = parse_type->builtin_long;
1850 if (sizeof (ULONGEST) * HOST_CHAR_BIT
1851 < gdbarch_long_long_bit (parse_gdbarch))
1852 /* A long long does not fit in a LONGEST. */
1853 shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1);
1855 shift = (gdbarch_long_long_bit (parse_gdbarch) - 1);
1856 high_bit = (ULONGEST) 1 << shift;
1857 unsigned_type = parse_type->builtin_unsigned_long_long;
1858 signed_type = parse_type->builtin_long_long;
1861 putithere->typed_val_int.val = n;
1863 /* If the high bit of the worked out type is set then this number
1864 has to be unsigned. */
1866 if (unsigned_p || (n & high_bit))
1868 putithere->typed_val_int.type = unsigned_type;
1872 putithere->typed_val_int.type = signed_type;
1878 /* Temporary obstack used for holding strings. */
1879 static struct obstack tempbuf;
1880 static int tempbuf_init;
1882 /* Parse a C escape sequence. The initial backslash of the sequence
1883 is at (*PTR)[-1]. *PTR will be updated to point to just after the
1884 last character of the sequence. If OUTPUT is not NULL, the
1885 translated form of the escape sequence will be written there. If
1886 OUTPUT is NULL, no output is written and the call will only affect
1887 *PTR. If an escape sequence is expressed in target bytes, then the
1888 entire sequence will simply be copied to OUTPUT. Return 1 if any
1889 character was emitted, 0 otherwise. */
1892 c_parse_escape (char **ptr, struct obstack *output)
1894 char *tokptr = *ptr;
1897 /* Some escape sequences undergo character set conversion. Those we
1901 /* Hex escapes do not undergo character set conversion, so keep
1902 the escape sequence for later. */
1905 obstack_grow_str (output, "\\x");
1907 if (!isxdigit (*tokptr))
1908 error (_("\\x escape without a following hex digit"));
1909 while (isxdigit (*tokptr))
1912 obstack_1grow (output, *tokptr);
1917 /* Octal escapes do not undergo character set conversion, so
1918 keep the escape sequence for later. */
1930 obstack_grow_str (output, "\\");
1932 i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9';
1936 obstack_1grow (output, *tokptr);
1942 /* We handle UCNs later. We could handle them here, but that
1943 would mean a spurious error in the case where the UCN could
1944 be converted to the target charset but not the host
1950 int i, len = c == 'U' ? 8 : 4;
1953 obstack_1grow (output, '\\');
1954 obstack_1grow (output, *tokptr);
1957 if (!isxdigit (*tokptr))
1958 error (_("\\%c escape without a following hex digit"), c);
1959 for (i = 0; i < len && isxdigit (*tokptr); ++i)
1962 obstack_1grow (output, *tokptr);
1968 /* We must pass backslash through so that it does not
1969 cause quoting during the second expansion. */
1972 obstack_grow_str (output, "\\\\");
1976 /* Escapes which undergo conversion. */
1979 obstack_1grow (output, '\a');
1984 obstack_1grow (output, '\b');
1989 obstack_1grow (output, '\f');
1994 obstack_1grow (output, '\n');
1999 obstack_1grow (output, '\r');
2004 obstack_1grow (output, '\t');
2009 obstack_1grow (output, '\v');
2013 /* GCC extension. */
2016 obstack_1grow (output, HOST_ESCAPE_CHAR);
2020 /* Backslash-newline expands to nothing at all. */
2026 /* A few escapes just expand to the character itself. */
2030 /* GCC extensions. */
2035 /* Unrecognized escapes turn into the character itself. */
2038 obstack_1grow (output, *tokptr);
2046 /* Parse a string or character literal from TOKPTR. The string or
2047 character may be wide or unicode. *OUTPTR is set to just after the
2048 end of the literal in the input string. The resulting token is
2049 stored in VALUE. This returns a token value, either STRING or
2050 CHAR, depending on what was parsed. *HOST_CHARS is set to the
2051 number of host characters in the literal. */
2053 parse_string_or_char (char *tokptr, char **outptr, struct typed_stoken *value,
2057 enum c_string_type type;
2060 /* Build the gdb internal form of the input string in tempbuf. Note
2061 that the buffer is null byte terminated *only* for the
2062 convenience of debugging gdb itself and printing the buffer
2063 contents when the buffer contains no embedded nulls. Gdb does
2064 not depend upon the buffer being null byte terminated, it uses
2065 the length string instead. This allows gdb to handle C strings
2066 (as well as strings in other languages) with embedded null
2072 obstack_free (&tempbuf, NULL);
2073 obstack_init (&tempbuf);
2075 /* Record the string type. */
2078 type = C_WIDE_STRING;
2081 else if (*tokptr == 'u')
2086 else if (*tokptr == 'U')
2091 else if (*tokptr == '@')
2093 /* An Objective C string. */
2101 /* Skip the quote. */
2115 *host_chars += c_parse_escape (&tokptr, &tempbuf);
2117 else if (c == quote)
2121 obstack_1grow (&tempbuf, c);
2123 /* FIXME: this does the wrong thing with multi-byte host
2124 characters. We could use mbrlen here, but that would
2125 make "set host-charset" a bit less useful. */
2130 if (*tokptr != quote)
2133 error (_("Unterminated string in expression."));
2135 error (_("Unmatched single quote."));
2140 value->ptr = obstack_base (&tempbuf);
2141 value->length = obstack_object_size (&tempbuf);
2145 return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR;
2148 /* This is used to associate some attributes with a token. */
2152 /* If this bit is set, the token is C++-only. */
2156 /* If this bit is set, the token is conditional: if there is a
2157 symbol of the same name, then the token is a symbol; otherwise,
2158 the token is a keyword. */
2167 enum exp_opcode opcode;
2168 enum token_flags flags;
2171 static const struct token tokentab3[] =
2173 {">>=", ASSIGN_MODIFY, BINOP_RSH, 0},
2174 {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0},
2175 {"->*", ARROW_STAR, BINOP_END, FLAG_CXX},
2176 {"...", DOTDOTDOT, BINOP_END, 0}
2179 static const struct token tokentab2[] =
2181 {"+=", ASSIGN_MODIFY, BINOP_ADD, 0},
2182 {"-=", ASSIGN_MODIFY, BINOP_SUB, 0},
2183 {"*=", ASSIGN_MODIFY, BINOP_MUL, 0},
2184 {"/=", ASSIGN_MODIFY, BINOP_DIV, 0},
2185 {"%=", ASSIGN_MODIFY, BINOP_REM, 0},
2186 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0},
2187 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0},
2188 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0},
2189 {"++", INCREMENT, BINOP_END, 0},
2190 {"--", DECREMENT, BINOP_END, 0},
2191 {"->", ARROW, BINOP_END, 0},
2192 {"&&", ANDAND, BINOP_END, 0},
2193 {"||", OROR, BINOP_END, 0},
2194 /* "::" is *not* only C++: gdb overrides its meaning in several
2195 different ways, e.g., 'filename'::func, function::variable. */
2196 {"::", COLONCOLON, BINOP_END, 0},
2197 {"<<", LSH, BINOP_END, 0},
2198 {">>", RSH, BINOP_END, 0},
2199 {"==", EQUAL, BINOP_END, 0},
2200 {"!=", NOTEQUAL, BINOP_END, 0},
2201 {"<=", LEQ, BINOP_END, 0},
2202 {">=", GEQ, BINOP_END, 0},
2203 {".*", DOT_STAR, BINOP_END, FLAG_CXX}
2206 /* Identifier-like tokens. */
2207 static const struct token ident_tokens[] =
2209 {"unsigned", UNSIGNED, OP_NULL, 0},
2210 {"template", TEMPLATE, OP_NULL, FLAG_CXX},
2211 {"volatile", VOLATILE_KEYWORD, OP_NULL, 0},
2212 {"struct", STRUCT, OP_NULL, 0},
2213 {"signed", SIGNED_KEYWORD, OP_NULL, 0},
2214 {"sizeof", SIZEOF, OP_NULL, 0},
2215 {"double", DOUBLE_KEYWORD, OP_NULL, 0},
2216 {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX},
2217 {"class", CLASS, OP_NULL, FLAG_CXX},
2218 {"union", UNION, OP_NULL, 0},
2219 {"short", SHORT, OP_NULL, 0},
2220 {"const", CONST_KEYWORD, OP_NULL, 0},
2221 {"enum", ENUM, OP_NULL, 0},
2222 {"long", LONG, OP_NULL, 0},
2223 {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX},
2224 {"int", INT_KEYWORD, OP_NULL, 0},
2225 {"new", NEW, OP_NULL, FLAG_CXX},
2226 {"delete", DELETE, OP_NULL, FLAG_CXX},
2227 {"operator", OPERATOR, OP_NULL, FLAG_CXX},
2229 {"and", ANDAND, BINOP_END, FLAG_CXX},
2230 {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX},
2231 {"bitand", '&', OP_NULL, FLAG_CXX},
2232 {"bitor", '|', OP_NULL, FLAG_CXX},
2233 {"compl", '~', OP_NULL, FLAG_CXX},
2234 {"not", '!', OP_NULL, FLAG_CXX},
2235 {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX},
2236 {"or", OROR, BINOP_END, FLAG_CXX},
2237 {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX},
2238 {"xor", '^', OP_NULL, FLAG_CXX},
2239 {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX},
2241 {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX },
2242 {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX },
2243 {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX },
2244 {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX },
2246 {"__typeof__", TYPEOF, OP_TYPEOF, 0 },
2247 {"__typeof", TYPEOF, OP_TYPEOF, 0 },
2248 {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW },
2249 {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX },
2250 {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW }
2253 /* When we find that lexptr (the global var defined in parse.c) is
2254 pointing at a macro invocation, we expand the invocation, and call
2255 scan_macro_expansion to save the old lexptr here and point lexptr
2256 into the expanded text. When we reach the end of that, we call
2257 end_macro_expansion to pop back to the value we saved here. The
2258 macro expansion code promises to return only fully-expanded text,
2259 so we don't need to "push" more than one level.
2261 This is disgusting, of course. It would be cleaner to do all macro
2262 expansion beforehand, and then hand that to lexptr. But we don't
2263 really know where the expression ends. Remember, in a command like
2265 (gdb) break *ADDRESS if CONDITION
2267 we evaluate ADDRESS in the scope of the current frame, but we
2268 evaluate CONDITION in the scope of the breakpoint's location. So
2269 it's simply wrong to try to macro-expand the whole thing at once. */
2270 static char *macro_original_text;
2272 /* We save all intermediate macro expansions on this obstack for the
2273 duration of a single parse. The expansion text may sometimes have
2274 to live past the end of the expansion, due to yacc lookahead.
2275 Rather than try to be clever about saving the data for a single
2276 token, we simply keep it all and delete it after parsing has
2278 static struct obstack expansion_obstack;
2281 scan_macro_expansion (char *expansion)
2285 /* We'd better not be trying to push the stack twice. */
2286 gdb_assert (! macro_original_text);
2288 /* Copy to the obstack, and then free the intermediate
2290 copy = obstack_copy0 (&expansion_obstack, expansion, strlen (expansion));
2293 /* Save the old lexptr value, so we can return to it when we're done
2294 parsing the expanded text. */
2295 macro_original_text = lexptr;
2301 scanning_macro_expansion (void)
2303 return macro_original_text != 0;
2308 finished_macro_expansion (void)
2310 /* There'd better be something to pop back to. */
2311 gdb_assert (macro_original_text);
2313 /* Pop back to the original text. */
2314 lexptr = macro_original_text;
2315 macro_original_text = 0;
2320 scan_macro_cleanup (void *dummy)
2322 if (macro_original_text)
2323 finished_macro_expansion ();
2325 obstack_free (&expansion_obstack, NULL);
2328 /* Return true iff the token represents a C++ cast operator. */
2331 is_cast_operator (const char *token, int len)
2333 return (! strncmp (token, "dynamic_cast", len)
2334 || ! strncmp (token, "static_cast", len)
2335 || ! strncmp (token, "reinterpret_cast", len)
2336 || ! strncmp (token, "const_cast", len));
2339 /* The scope used for macro expansion. */
2340 static struct macro_scope *expression_macro_scope;
2342 /* This is set if a NAME token appeared at the very end of the input
2343 string, with no whitespace separating the name from the EOF. This
2344 is used only when parsing to do field name completion. */
2345 static int saw_name_at_eof;
2347 /* This is set if the previously-returned token was a structure
2348 operator -- either '.' or ARROW. This is used only when parsing to
2349 do field name completion. */
2350 static int last_was_structop;
2352 /* Read one token, getting characters through lexptr. */
2355 lex_one_token (void)
2361 int saw_structop = last_was_structop;
2364 last_was_structop = 0;
2368 /* Check if this is a macro invocation that we need to expand. */
2369 if (! scanning_macro_expansion ())
2371 char *expanded = macro_expand_next (&lexptr,
2372 standard_macro_lookup,
2373 expression_macro_scope);
2376 scan_macro_expansion (expanded);
2379 prev_lexptr = lexptr;
2382 /* See if it is a special token of length 3. */
2383 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
2384 if (strncmp (tokstart, tokentab3[i].operator, 3) == 0)
2386 if ((tokentab3[i].flags & FLAG_CXX) != 0
2387 && parse_language->la_language != language_cplus)
2391 yylval.opcode = tokentab3[i].opcode;
2392 return tokentab3[i].token;
2395 /* See if it is a special token of length 2. */
2396 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
2397 if (strncmp (tokstart, tokentab2[i].operator, 2) == 0)
2399 if ((tokentab2[i].flags & FLAG_CXX) != 0
2400 && parse_language->la_language != language_cplus)
2404 yylval.opcode = tokentab2[i].opcode;
2405 if (parse_completion && tokentab2[i].token == ARROW)
2406 last_was_structop = 1;
2407 return tokentab2[i].token;
2410 switch (c = *tokstart)
2413 /* If we were just scanning the result of a macro expansion,
2414 then we need to resume scanning the original text.
2415 If we're parsing for field name completion, and the previous
2416 token allows such completion, return a COMPLETE token.
2417 Otherwise, we were already scanning the original text, and
2418 we're really done. */
2419 if (scanning_macro_expansion ())
2421 finished_macro_expansion ();
2424 else if (saw_name_at_eof)
2426 saw_name_at_eof = 0;
2429 else if (saw_structop)
2444 if (parse_language->la_language == language_objc && c == '[')
2450 if (paren_depth == 0)
2457 if (comma_terminates
2459 && ! scanning_macro_expansion ())
2465 /* Might be a floating point number. */
2466 if (lexptr[1] < '0' || lexptr[1] > '9')
2468 if (parse_completion)
2469 last_was_structop = 1;
2470 goto symbol; /* Nope, must be a symbol. */
2472 /* FALL THRU into number case. */
2485 /* It's a number. */
2486 int got_dot = 0, got_e = 0, toktype;
2488 int hex = input_radix > 10;
2490 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
2495 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
2503 /* This test includes !hex because 'e' is a valid hex digit
2504 and thus does not indicate a floating point number when
2505 the radix is hex. */
2506 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
2507 got_dot = got_e = 1;
2508 /* This test does not include !hex, because a '.' always indicates
2509 a decimal floating point number regardless of the radix. */
2510 else if (!got_dot && *p == '.')
2512 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
2513 && (*p == '-' || *p == '+'))
2514 /* This is the sign of the exponent, not the end of the
2517 /* We will take any letters or digits. parse_number will
2518 complain if past the radix, or if L or U are not final. */
2519 else if ((*p < '0' || *p > '9')
2520 && ((*p < 'a' || *p > 'z')
2521 && (*p < 'A' || *p > 'Z')))
2524 toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval);
2525 if (toktype == ERROR)
2527 char *err_copy = (char *) alloca (p - tokstart + 1);
2529 memcpy (err_copy, tokstart, p - tokstart);
2530 err_copy[p - tokstart] = 0;
2531 error (_("Invalid number \"%s\"."), err_copy);
2539 char *p = &tokstart[1];
2540 size_t len = strlen ("entry");
2542 if (parse_language->la_language == language_objc)
2544 size_t len = strlen ("selector");
2546 if (strncmp (p, "selector", len) == 0
2547 && (p[len] == '\0' || isspace (p[len])))
2556 while (isspace (*p))
2558 if (strncmp (p, "entry", len) == 0 && !isalnum (p[len])
2590 if (tokstart[1] != '"' && tokstart[1] != '\'')
2599 int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval,
2604 error (_("Empty character constant."));
2605 else if (host_len > 2 && c == '\'')
2608 namelen = lexptr - tokstart - 1;
2611 else if (host_len > 1)
2612 error (_("Invalid character constant."));
2618 if (!(c == '_' || c == '$'
2619 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
2620 /* We must have come across a bad character (e.g. ';'). */
2621 error (_("Invalid character '%c' in expression."), c);
2623 /* It's a name. See how long it is. */
2625 for (c = tokstart[namelen];
2626 (c == '_' || c == '$' || (c >= '0' && c <= '9')
2627 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
2629 /* Template parameter lists are part of the name.
2630 FIXME: This mishandles `print $a<4&&$a>3'. */
2634 if (! is_cast_operator (tokstart, namelen))
2636 /* Scan ahead to get rest of the template specification. Note
2637 that we look ahead only when the '<' adjoins non-whitespace
2638 characters; for comparison expressions, e.g. "a < b > c",
2639 there must be spaces before the '<', etc. */
2641 char * p = find_template_name_end (tokstart + namelen);
2643 namelen = p - tokstart;
2647 c = tokstart[++namelen];
2650 /* The token "if" terminates the expression and is NOT removed from
2651 the input stream. It doesn't count if it appears in the
2652 expansion of a macro. */
2654 && tokstart[0] == 'i'
2655 && tokstart[1] == 'f'
2656 && ! scanning_macro_expansion ())
2661 /* For the same reason (breakpoint conditions), "thread N"
2662 terminates the expression. "thread" could be an identifier, but
2663 an identifier is never followed by a number without intervening
2664 punctuation. "task" is similar. Handle abbreviations of these,
2665 similarly to breakpoint.c:find_condition_and_thread. */
2667 && (strncmp (tokstart, "thread", namelen) == 0
2668 || strncmp (tokstart, "task", namelen) == 0)
2669 && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t')
2670 && ! scanning_macro_expansion ())
2672 char *p = tokstart + namelen + 1;
2673 while (*p == ' ' || *p == '\t')
2675 if (*p >= '0' && *p <= '9')
2683 yylval.sval.ptr = tokstart;
2684 yylval.sval.length = namelen;
2686 /* Catch specific keywords. */
2687 copy = copy_name (yylval.sval);
2688 for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++)
2689 if (strcmp (copy, ident_tokens[i].operator) == 0)
2691 if ((ident_tokens[i].flags & FLAG_CXX) != 0
2692 && parse_language->la_language != language_cplus)
2695 if ((ident_tokens[i].flags & FLAG_SHADOW) != 0)
2697 struct field_of_this_result is_a_field_of_this;
2699 if (lookup_symbol (copy, expression_context_block,
2701 (parse_language->la_language == language_cplus
2702 ? &is_a_field_of_this
2706 /* The keyword is shadowed. */
2711 /* It is ok to always set this, even though we don't always
2712 strictly need to. */
2713 yylval.opcode = ident_tokens[i].opcode;
2714 return ident_tokens[i].token;
2717 if (*tokstart == '$')
2720 if (parse_completion && *lexptr == '\0')
2721 saw_name_at_eof = 1;
2723 yylval.ssym.stoken = yylval.sval;
2724 yylval.ssym.sym = NULL;
2725 yylval.ssym.is_a_field_of_this = 0;
2729 /* An object of this type is pushed on a FIFO by the "outer" lexer. */
2736 DEF_VEC_O (token_and_value);
2738 /* A FIFO of tokens that have been read but not yet returned to the
2740 static VEC (token_and_value) *token_fifo;
2742 /* Non-zero if the lexer should return tokens from the FIFO. */
2745 /* Temporary storage for c_lex; this holds symbol names as they are
2747 static struct obstack name_obstack;
2749 /* Classify a NAME token. The contents of the token are in `yylval'.
2750 Updates yylval and returns the new token type. BLOCK is the block
2751 in which lookups start; this can be NULL to mean the global
2754 classify_name (const struct block *block)
2758 struct field_of_this_result is_a_field_of_this;
2760 copy = copy_name (yylval.sval);
2762 /* Initialize this in case we *don't* use it in this call; that way
2763 we can refer to it unconditionally below. */
2764 memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this));
2766 sym = lookup_symbol (copy, block, VAR_DOMAIN,
2767 parse_language->la_name_of_this
2768 ? &is_a_field_of_this : NULL);
2770 if (sym && SYMBOL_CLASS (sym) == LOC_BLOCK)
2772 yylval.ssym.sym = sym;
2773 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2778 /* See if it's a file name. */
2779 struct symtab *symtab;
2781 symtab = lookup_symtab (copy);
2784 yylval.bval = BLOCKVECTOR_BLOCK (BLOCKVECTOR (symtab), STATIC_BLOCK);
2788 /* If we found a field of 'this', we might have erroneously
2789 found a constructor where we wanted a type name. Handle this
2790 case by noticing that we found a constructor and then look up
2791 the type tag instead. */
2792 if (is_a_field_of_this.type != NULL
2793 && is_a_field_of_this.fn_field != NULL
2794 && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields,
2797 struct field_of_this_result inner_is_a_field_of_this;
2799 sym = lookup_symbol (copy, block, STRUCT_DOMAIN,
2800 &inner_is_a_field_of_this);
2803 yylval.tsym.type = SYMBOL_TYPE (sym);
2809 if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
2811 yylval.tsym.type = SYMBOL_TYPE (sym);
2816 = language_lookup_primitive_type_by_name (parse_language,
2817 parse_gdbarch, copy);
2818 if (yylval.tsym.type != NULL)
2821 /* See if it's an ObjC classname. */
2822 if (parse_language->la_language == language_objc && !sym)
2824 CORE_ADDR Class = lookup_objc_class (parse_gdbarch, copy);
2827 yylval.class.class = Class;
2828 sym = lookup_struct_typedef (copy, expression_context_block, 1);
2830 yylval.class.type = SYMBOL_TYPE (sym);
2835 /* Input names that aren't symbols but ARE valid hex numbers, when
2836 the input radix permits them, can be names or numbers depending
2837 on the parse. Note we support radixes > 16 here. */
2839 && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10)
2840 || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10)))
2842 YYSTYPE newlval; /* Its value is ignored. */
2843 int hextype = parse_number (copy, yylval.sval.length, 0, &newlval);
2846 yylval.ssym.sym = sym;
2847 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2852 /* Any other kind of symbol */
2853 yylval.ssym.sym = sym;
2854 yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL;
2857 && parse_language->la_language == language_cplus
2858 && is_a_field_of_this.type == NULL
2859 && !lookup_minimal_symbol (copy, NULL, NULL))
2860 return UNKNOWN_CPP_NAME;
2865 /* Like classify_name, but used by the inner loop of the lexer, when a
2866 name might have already been seen. CONTEXT is the context type, or
2867 NULL if this is the first component of a name. */
2870 classify_inner_name (const struct block *block, struct type *context)
2875 if (context == NULL)
2876 return classify_name (block);
2878 type = check_typedef (context);
2879 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
2880 && TYPE_CODE (type) != TYPE_CODE_UNION
2881 && TYPE_CODE (type) != TYPE_CODE_NAMESPACE)
2884 copy = copy_name (yylval.ssym.stoken);
2885 yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block);
2886 if (yylval.ssym.sym == NULL)
2889 switch (SYMBOL_CLASS (yylval.ssym.sym))
2896 yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym);;
2902 internal_error (__FILE__, __LINE__, _("not reached"));
2905 /* The outer level of a two-level lexer. This calls the inner lexer
2906 to return tokens. It then either returns these tokens, or
2907 aggregates them into a larger token. This lets us work around a
2908 problem in our parsing approach, where the parser could not
2909 distinguish between qualified names and qualified types at the
2912 This approach is still not ideal, because it mishandles template
2913 types. See the comment in lex_one_token for an example. However,
2914 this is still an improvement over the earlier approach, and will
2915 suffice until we move to better parsing technology. */
2919 token_and_value current;
2920 int first_was_coloncolon, last_was_coloncolon;
2921 struct type *context_type = NULL;
2922 int last_to_examine, next_to_examine, checkpoint;
2923 const struct block *search_block;
2925 if (popping && !VEC_empty (token_and_value, token_fifo))
2929 /* Read the first token and decide what to do. Most of the
2930 subsequent code is C++-only; but also depends on seeing a "::" or
2932 current.token = lex_one_token ();
2933 if (current.token == NAME)
2934 current.token = classify_name (expression_context_block);
2935 if (parse_language->la_language != language_cplus
2936 || (current.token != TYPENAME && current.token != COLONCOLON
2937 && current.token != FILENAME))
2938 return current.token;
2940 /* Read any sequence of alternating "::" and name-like tokens into
2942 current.value = yylval;
2943 VEC_safe_push (token_and_value, token_fifo, ¤t);
2944 last_was_coloncolon = current.token == COLONCOLON;
2947 current.token = lex_one_token ();
2948 current.value = yylval;
2949 VEC_safe_push (token_and_value, token_fifo, ¤t);
2951 if ((last_was_coloncolon && current.token != NAME)
2952 || (!last_was_coloncolon && current.token != COLONCOLON))
2954 last_was_coloncolon = !last_was_coloncolon;
2958 /* We always read one extra token, so compute the number of tokens
2959 to examine accordingly. */
2960 last_to_examine = VEC_length (token_and_value, token_fifo) - 2;
2961 next_to_examine = 0;
2963 current = *VEC_index (token_and_value, token_fifo, next_to_examine);
2966 obstack_free (&name_obstack, obstack_base (&name_obstack));
2968 if (current.token == FILENAME)
2969 search_block = current.value.bval;
2970 else if (current.token == COLONCOLON)
2971 search_block = NULL;
2974 gdb_assert (current.token == TYPENAME);
2975 search_block = expression_context_block;
2976 obstack_grow (&name_obstack, current.value.sval.ptr,
2977 current.value.sval.length);
2978 context_type = current.value.tsym.type;
2982 first_was_coloncolon = current.token == COLONCOLON;
2983 last_was_coloncolon = first_was_coloncolon;
2985 while (next_to_examine <= last_to_examine)
2987 token_and_value *next;
2989 next = VEC_index (token_and_value, token_fifo, next_to_examine);
2992 if (next->token == NAME && last_was_coloncolon)
2996 yylval = next->value;
2997 classification = classify_inner_name (search_block, context_type);
2998 /* We keep going until we either run out of names, or until
2999 we have a qualified name which is not a type. */
3000 if (classification != TYPENAME && classification != NAME)
3003 /* Accept up to this token. */
3004 checkpoint = next_to_examine;
3006 /* Update the partial name we are constructing. */
3007 if (context_type != NULL)
3009 /* We don't want to put a leading "::" into the name. */
3010 obstack_grow_str (&name_obstack, "::");
3012 obstack_grow (&name_obstack, next->value.sval.ptr,
3013 next->value.sval.length);
3015 yylval.sval.ptr = obstack_base (&name_obstack);
3016 yylval.sval.length = obstack_object_size (&name_obstack);
3017 current.value = yylval;
3018 current.token = classification;
3020 last_was_coloncolon = 0;
3022 if (classification == NAME)
3025 context_type = yylval.tsym.type;
3027 else if (next->token == COLONCOLON && !last_was_coloncolon)
3028 last_was_coloncolon = 1;
3031 /* We've reached the end of the name. */
3036 /* If we have a replacement token, install it as the first token in
3037 the FIFO, and delete the other constituent tokens. */
3040 current.value.sval.ptr = obstack_copy0 (&expansion_obstack,
3041 current.value.sval.ptr,
3042 current.value.sval.length);
3044 VEC_replace (token_and_value, token_fifo, 0, ¤t);
3046 VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1);
3050 current = *VEC_index (token_and_value, token_fifo, 0);
3051 VEC_ordered_remove (token_and_value, token_fifo, 0);
3052 yylval = current.value;
3053 return current.token;
3060 struct cleanup *back_to = make_cleanup (free_current_contents,
3061 &expression_macro_scope);
3063 /* Set up the scope for macro expansion. */
3064 expression_macro_scope = NULL;
3066 if (expression_context_block)
3067 expression_macro_scope
3068 = sal_macro_scope (find_pc_line (expression_context_pc, 0));
3070 expression_macro_scope = default_macro_scope ();
3071 if (! expression_macro_scope)
3072 expression_macro_scope = user_macro_scope ();
3074 /* Initialize macro expansion code. */
3075 obstack_init (&expansion_obstack);
3076 gdb_assert (! macro_original_text);
3077 make_cleanup (scan_macro_cleanup, 0);
3079 make_cleanup_restore_integer (&yydebug);
3080 yydebug = parser_debug;
3082 /* Initialize some state used by the lexer. */
3083 last_was_structop = 0;
3084 saw_name_at_eof = 0;
3086 VEC_free (token_and_value, token_fifo);
3088 obstack_init (&name_obstack);
3089 make_cleanup_obstack_free (&name_obstack);
3091 result = yyparse ();
3092 do_cleanups (back_to);
3096 /* This is called via the YYPRINT macro when parser debugging is
3097 enabled. It prints a token's value. */
3100 c_print_token (FILE *file, int type, YYSTYPE value)
3105 fprintf (file, "typed_val_int<%s, %s>",
3106 TYPE_SAFE_NAME (value.typed_val_int.type),
3107 pulongest (value.typed_val_int.val));
3113 char *copy = alloca (value.tsval.length + 1);
3115 memcpy (copy, value.tsval.ptr, value.tsval.length);
3116 copy[value.tsval.length] = '\0';
3118 fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy);
3124 fprintf (file, "sval<%s>", copy_name (value.sval));
3128 fprintf (file, "tsym<type=%s, name=%s>",
3129 TYPE_SAFE_NAME (value.tsym.type),
3130 copy_name (value.tsym.stoken));
3134 case UNKNOWN_CPP_NAME:
3137 fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>",
3138 copy_name (value.ssym.stoken),
3139 (value.ssym.sym == NULL
3140 ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym)),
3141 value.ssym.is_a_field_of_this);
3145 fprintf (file, "bval<%s>", host_address_to_string (value.bval));
3154 lexptr = prev_lexptr;
3156 error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr);