1 /* YACC parser for C expressions, for GDB.
2 Copyright (C) 1986, 1989, 1990, 1991, 1993, 1994
3 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
21 /* Parse a C expression from text in a string,
22 and return the result as a struct expression pointer.
23 That structure contains arithmetic operations in reverse polish,
24 with constants represented by operations that are followed by special data.
25 See expression.h for the details of the format.
26 What is important here is that it can be built up sequentially
27 during the process of parsing; the lower levels of the tree always
28 come first in the result.
30 Note that malloc's and realloc's in this file are transformed to
31 xmalloc and xrealloc respectively by the same sed command in the
32 makefile that remaps any other malloc/realloc inserted by the parser
33 generator. Doing this with #defines and trying to control the interaction
34 with include files (<malloc.h> and <stdlib.h> for example) just became
35 too messy, particularly when such includes can be inserted at random
36 times by the parser generator. */
42 #include "expression.h"
44 #include "parser-defs.h"
47 #include "bfd.h" /* Required by objfiles.h. */
48 #include "symfile.h" /* Required by objfiles.h. */
49 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
51 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
52 as well as gratuitiously global symbol names, so we can have multiple
53 yacc generated parsers in gdb. Note that these are only the variables
54 produced by yacc. If other parser generators (bison, byacc, etc) produce
55 additional global names that conflict at link time, then those parser
56 generators need to be fixed instead of adding those names to this list. */
58 #define yymaxdepth c_maxdepth
59 #define yyparse c_parse
61 #define yyerror c_error
64 #define yydebug c_debug
73 #define yyerrflag c_errflag
74 #define yynerrs c_nerrs
79 #define yystate c_state
85 #define yyreds c_reds /* With YYDEBUG defined */
86 #define yytoks c_toks /* With YYDEBUG defined */
89 #define yydefred c_yydefred
90 #define yydgoto c_yydgoto
91 #define yysindex c_yysindex
92 #define yyrindex c_yyrindex
93 #define yygindex c_yygindex
94 #define yytable c_yytable
95 #define yycheck c_yycheck
98 #define YYDEBUG 0 /* Default to no yydebug support */
102 yyparse PARAMS ((void));
105 yylex PARAMS ((void));
108 yyerror PARAMS ((char *));
112 /* Although the yacc "value" of an expression is not used,
113 since the result is stored in the structure being created,
114 other node types do have values. */
128 struct symtoken ssym;
131 enum exp_opcode opcode;
132 struct internalvar *ivar;
139 /* YYSTYPE gets defined by %union */
141 parse_number PARAMS ((char *, int, int, YYSTYPE *));
144 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly
146 %type <tval> type typebase
147 %type <tvec> nonempty_typelist
148 /* %type <bval> block */
150 /* Fancy type parsing. */
151 %type <voidval> func_mod direct_abs_decl abs_decl
153 %type <lval> array_mod
155 %token <typed_val> INT
158 /* Both NAME and TYPENAME tokens represent symbols in the input,
159 and both convey their data as strings.
160 But a TYPENAME is a string that happens to be defined as a typedef
161 or builtin type name (such as int or char)
162 and a NAME is any other symbol.
163 Contexts where this distinction is not important can use the
164 nonterminal "name", which matches either NAME or TYPENAME. */
167 %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */
168 %token <tsym> TYPENAME
170 %type <ssym> name_not_typename
171 %type <tsym> typename
173 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
174 but which would parse as a valid number in the current input radix.
175 E.g. "c" when input_radix==16. Depending on the parse, it will be
176 turned into a name or into a number. */
178 %token <ssym> NAME_OR_INT
180 %token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON
184 /* Special type cases, put in to allow the parser to distinguish different
186 %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD
188 %token <voidval> VARIABLE
190 %token <opcode> ASSIGN_MODIFY
197 %right '=' ASSIGN_MODIFY
205 %left '<' '>' LEQ GEQ
210 %right UNARY INCREMENT DECREMENT
211 %right ARROW '.' '[' '('
212 %token <ssym> BLOCKNAME
224 { write_exp_elt_opcode(OP_TYPE);
225 write_exp_elt_type($1);
226 write_exp_elt_opcode(OP_TYPE);}
229 /* Expressions, including the comma operator. */
232 { write_exp_elt_opcode (BINOP_COMMA); }
235 /* Expressions, not including the comma operator. */
236 exp : '*' exp %prec UNARY
237 { write_exp_elt_opcode (UNOP_IND); }
239 exp : '&' exp %prec UNARY
240 { write_exp_elt_opcode (UNOP_ADDR); }
242 exp : '-' exp %prec UNARY
243 { write_exp_elt_opcode (UNOP_NEG); }
246 exp : '!' exp %prec UNARY
247 { write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
250 exp : '~' exp %prec UNARY
251 { write_exp_elt_opcode (UNOP_COMPLEMENT); }
254 exp : INCREMENT exp %prec UNARY
255 { write_exp_elt_opcode (UNOP_PREINCREMENT); }
258 exp : DECREMENT exp %prec UNARY
259 { write_exp_elt_opcode (UNOP_PREDECREMENT); }
262 exp : exp INCREMENT %prec UNARY
263 { write_exp_elt_opcode (UNOP_POSTINCREMENT); }
266 exp : exp DECREMENT %prec UNARY
267 { write_exp_elt_opcode (UNOP_POSTDECREMENT); }
270 exp : SIZEOF exp %prec UNARY
271 { write_exp_elt_opcode (UNOP_SIZEOF); }
275 { write_exp_elt_opcode (STRUCTOP_PTR);
276 write_exp_string ($3);
277 write_exp_elt_opcode (STRUCTOP_PTR); }
280 exp : exp ARROW qualified_name
281 { /* exp->type::name becomes exp->*(&type::name) */
282 /* Note: this doesn't work if name is a
283 static member! FIXME */
284 write_exp_elt_opcode (UNOP_ADDR);
285 write_exp_elt_opcode (STRUCTOP_MPTR); }
287 exp : exp ARROW '*' exp
288 { write_exp_elt_opcode (STRUCTOP_MPTR); }
292 { write_exp_elt_opcode (STRUCTOP_STRUCT);
293 write_exp_string ($3);
294 write_exp_elt_opcode (STRUCTOP_STRUCT); }
298 Need to find a better way to do this...
300 { write_exp_elt_opcode (STRUCTOP_FIELD);
301 write_exp_string ($3);
302 write_exp_elt_opcode (STRUCTOP_FIELD);
306 exp : exp '.' qualified_name
307 { /* exp.type::name becomes exp.*(&type::name) */
308 /* Note: this doesn't work if name is a
309 static member! FIXME */
310 write_exp_elt_opcode (UNOP_ADDR);
311 write_exp_elt_opcode (STRUCTOP_MEMBER); }
314 exp : exp '.' '*' exp
315 { write_exp_elt_opcode (STRUCTOP_MEMBER); }
318 exp : exp '[' exp1 ']'
319 { write_exp_elt_opcode (BINOP_SUBSCRIPT); }
323 /* This is to save the value of arglist_len
324 being accumulated by an outer function call. */
325 { start_arglist (); }
326 arglist ')' %prec ARROW
327 { write_exp_elt_opcode (OP_FUNCALL);
328 write_exp_elt_longcst ((LONGEST) end_arglist ());
329 write_exp_elt_opcode (OP_FUNCALL); }
333 { start_arglist (); }
343 arglist : arglist ',' exp %prec ABOVE_COMMA
348 { $$ = end_arglist () - 1; }
350 exp : lcurly arglist rcurly %prec ARROW
351 { write_exp_elt_opcode (OP_ARRAY);
352 write_exp_elt_longcst ((LONGEST) 0);
353 write_exp_elt_longcst ((LONGEST) $3);
354 write_exp_elt_opcode (OP_ARRAY); }
357 exp : lcurly type rcurly exp %prec UNARY
358 { write_exp_elt_opcode (UNOP_MEMVAL);
359 write_exp_elt_type ($2);
360 write_exp_elt_opcode (UNOP_MEMVAL); }
363 exp : '(' type ')' exp %prec UNARY
364 { write_exp_elt_opcode (UNOP_CAST);
365 write_exp_elt_type ($2);
366 write_exp_elt_opcode (UNOP_CAST); }
373 /* Binary operators in order of decreasing precedence. */
376 { write_exp_elt_opcode (BINOP_REPEAT); }
380 { write_exp_elt_opcode (BINOP_MUL); }
384 { write_exp_elt_opcode (BINOP_DIV); }
388 { write_exp_elt_opcode (BINOP_REM); }
392 { write_exp_elt_opcode (BINOP_ADD); }
396 { write_exp_elt_opcode (BINOP_SUB); }
400 { write_exp_elt_opcode (BINOP_LSH); }
404 { write_exp_elt_opcode (BINOP_RSH); }
408 { write_exp_elt_opcode (BINOP_EQUAL); }
411 exp : exp NOTEQUAL exp
412 { write_exp_elt_opcode (BINOP_NOTEQUAL); }
416 { write_exp_elt_opcode (BINOP_LEQ); }
420 { write_exp_elt_opcode (BINOP_GEQ); }
424 { write_exp_elt_opcode (BINOP_LESS); }
428 { write_exp_elt_opcode (BINOP_GTR); }
432 { write_exp_elt_opcode (BINOP_BITWISE_AND); }
436 { write_exp_elt_opcode (BINOP_BITWISE_XOR); }
440 { write_exp_elt_opcode (BINOP_BITWISE_IOR); }
444 { write_exp_elt_opcode (BINOP_LOGICAL_AND); }
448 { write_exp_elt_opcode (BINOP_LOGICAL_OR); }
451 exp : exp '?' exp ':' exp %prec '?'
452 { write_exp_elt_opcode (TERNOP_COND); }
456 { write_exp_elt_opcode (BINOP_ASSIGN); }
459 exp : exp ASSIGN_MODIFY exp
460 { write_exp_elt_opcode (BINOP_ASSIGN_MODIFY);
461 write_exp_elt_opcode ($2);
462 write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); }
466 { write_exp_elt_opcode (OP_LONG);
467 write_exp_elt_type ($1.type);
468 write_exp_elt_longcst ((LONGEST)($1.val));
469 write_exp_elt_opcode (OP_LONG); }
474 parse_number ($1.stoken.ptr, $1.stoken.length, 0, &val);
475 write_exp_elt_opcode (OP_LONG);
476 write_exp_elt_type (val.typed_val.type);
477 write_exp_elt_longcst ((LONGEST)val.typed_val.val);
478 write_exp_elt_opcode (OP_LONG);
484 { write_exp_elt_opcode (OP_DOUBLE);
485 write_exp_elt_type (builtin_type_double);
486 write_exp_elt_dblcst ($1);
487 write_exp_elt_opcode (OP_DOUBLE); }
494 /* Already written by write_dollar_variable. */
497 exp : SIZEOF '(' type ')' %prec UNARY
498 { write_exp_elt_opcode (OP_LONG);
499 write_exp_elt_type (builtin_type_int);
500 write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3));
501 write_exp_elt_opcode (OP_LONG); }
505 { /* C strings are converted into array constants with
506 an explicit null byte added at the end. Thus
507 the array upper bound is the string length.
508 There is no such thing in C as a completely empty
510 char *sp = $1.ptr; int count = $1.length;
513 write_exp_elt_opcode (OP_LONG);
514 write_exp_elt_type (builtin_type_char);
515 write_exp_elt_longcst ((LONGEST)(*sp++));
516 write_exp_elt_opcode (OP_LONG);
518 write_exp_elt_opcode (OP_LONG);
519 write_exp_elt_type (builtin_type_char);
520 write_exp_elt_longcst ((LONGEST)'\0');
521 write_exp_elt_opcode (OP_LONG);
522 write_exp_elt_opcode (OP_ARRAY);
523 write_exp_elt_longcst ((LONGEST) 0);
524 write_exp_elt_longcst ((LONGEST) ($1.length));
525 write_exp_elt_opcode (OP_ARRAY); }
530 { write_exp_elt_opcode (OP_THIS);
531 write_exp_elt_opcode (OP_THIS); }
539 $$ = SYMBOL_BLOCK_VALUE ($1.sym);
543 lookup_symtab (copy_name ($1.stoken));
545 $$ = BLOCKVECTOR_BLOCK (BLOCKVECTOR (tem), STATIC_BLOCK);
547 error ("No file or function \"%s\".",
548 copy_name ($1.stoken));
553 block : block COLONCOLON name
555 = lookup_symbol (copy_name ($3), $1,
556 VAR_NAMESPACE, (int *) NULL,
557 (struct symtab **) NULL);
558 if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK)
559 error ("No function \"%s\" in specified context.",
561 $$ = SYMBOL_BLOCK_VALUE (tem); }
564 variable: block COLONCOLON name
565 { struct symbol *sym;
566 sym = lookup_symbol (copy_name ($3), $1,
567 VAR_NAMESPACE, (int *) NULL,
568 (struct symtab **) NULL);
570 error ("No symbol \"%s\" in specified context.",
573 write_exp_elt_opcode (OP_VAR_VALUE);
574 /* block_found is set by lookup_symbol. */
575 write_exp_elt_block (block_found);
576 write_exp_elt_sym (sym);
577 write_exp_elt_opcode (OP_VAR_VALUE); }
580 qualified_name: typebase COLONCOLON name
582 struct type *type = $1;
583 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
584 && TYPE_CODE (type) != TYPE_CODE_UNION)
585 error ("`%s' is not defined as an aggregate type.",
588 write_exp_elt_opcode (OP_SCOPE);
589 write_exp_elt_type (type);
590 write_exp_string ($3);
591 write_exp_elt_opcode (OP_SCOPE);
593 | typebase COLONCOLON '~' name
595 struct type *type = $1;
596 struct stoken tmp_token;
597 if (TYPE_CODE (type) != TYPE_CODE_STRUCT
598 && TYPE_CODE (type) != TYPE_CODE_UNION)
599 error ("`%s' is not defined as an aggregate type.",
602 if (!STREQ (type_name_no_tag (type), $4.ptr))
603 error ("invalid destructor `%s::~%s'",
604 type_name_no_tag (type), $4.ptr);
606 tmp_token.ptr = (char*) alloca ($4.length + 2);
607 tmp_token.length = $4.length + 1;
608 tmp_token.ptr[0] = '~';
609 memcpy (tmp_token.ptr+1, $4.ptr, $4.length);
610 tmp_token.ptr[tmp_token.length] = 0;
611 write_exp_elt_opcode (OP_SCOPE);
612 write_exp_elt_type (type);
613 write_exp_string (tmp_token);
614 write_exp_elt_opcode (OP_SCOPE);
618 variable: qualified_name
621 char *name = copy_name ($2);
623 struct minimal_symbol *msymbol;
626 lookup_symbol (name, (const struct block *) NULL,
627 VAR_NAMESPACE, (int *) NULL,
628 (struct symtab **) NULL);
631 write_exp_elt_opcode (OP_VAR_VALUE);
632 write_exp_elt_block (NULL);
633 write_exp_elt_sym (sym);
634 write_exp_elt_opcode (OP_VAR_VALUE);
638 msymbol = lookup_minimal_symbol (name, NULL, NULL);
641 write_exp_msymbol (msymbol,
642 lookup_function_type (builtin_type_int),
646 if (!have_full_symbols () && !have_partial_symbols ())
647 error ("No symbol table is loaded. Use the \"file\" command.");
649 error ("No symbol \"%s\" in current context.", name);
653 variable: name_not_typename
654 { struct symbol *sym = $1.sym;
658 if (symbol_read_needs_frame (sym))
660 if (innermost_block == 0 ||
661 contained_in (block_found,
663 innermost_block = block_found;
666 write_exp_elt_opcode (OP_VAR_VALUE);
667 /* We want to use the selected frame, not
668 another more inner frame which happens to
669 be in the same block. */
670 write_exp_elt_block (NULL);
671 write_exp_elt_sym (sym);
672 write_exp_elt_opcode (OP_VAR_VALUE);
674 else if ($1.is_a_field_of_this)
676 /* C++: it hangs off of `this'. Must
677 not inadvertently convert from a method call
679 if (innermost_block == 0 ||
680 contained_in (block_found, innermost_block))
681 innermost_block = block_found;
682 write_exp_elt_opcode (OP_THIS);
683 write_exp_elt_opcode (OP_THIS);
684 write_exp_elt_opcode (STRUCTOP_PTR);
685 write_exp_string ($1.stoken);
686 write_exp_elt_opcode (STRUCTOP_PTR);
690 struct minimal_symbol *msymbol;
691 register char *arg = copy_name ($1.stoken);
694 lookup_minimal_symbol (arg, NULL, NULL);
697 write_exp_msymbol (msymbol,
698 lookup_function_type (builtin_type_int),
701 else if (!have_full_symbols () && !have_partial_symbols ())
702 error ("No symbol table is loaded. Use the \"file\" command.");
704 error ("No symbol \"%s\" in current context.",
705 copy_name ($1.stoken));
712 /* "const" and "volatile" are curently ignored. A type qualifier
713 before the type is currently handled in the typebase rule.
714 The reason for recognizing these here (shift/reduce conflicts)
715 might be obsolete now that some pointer to member rules have
717 | typebase CONST_KEYWORD
718 | typebase VOLATILE_KEYWORD
720 { $$ = follow_types ($1); }
721 | typebase CONST_KEYWORD abs_decl
722 { $$ = follow_types ($1); }
723 | typebase VOLATILE_KEYWORD abs_decl
724 { $$ = follow_types ($1); }
728 { push_type (tp_pointer); $$ = 0; }
730 { push_type (tp_pointer); $$ = $2; }
732 { push_type (tp_reference); $$ = 0; }
734 { push_type (tp_reference); $$ = $2; }
738 direct_abs_decl: '(' abs_decl ')'
740 | direct_abs_decl array_mod
743 push_type (tp_array);
748 push_type (tp_array);
752 | direct_abs_decl func_mod
753 { push_type (tp_function); }
755 { push_type (tp_function); }
766 | '(' nonempty_typelist ')'
767 { free ((PTR)$2); $$ = 0; }
770 /* We used to try to recognize more pointer to member types here, but
771 that didn't work (shift/reduce conflicts meant that these rules never
772 got executed). The problem is that
773 int (foo::bar::baz::bizzle)
774 is a function type but
775 int (foo::bar::baz::bizzle::*)
776 is a pointer to member type. Stroustrup loses again! */
779 | typebase COLONCOLON '*'
780 { $$ = lookup_member_type (builtin_type_int, $1); }
783 typebase /* Implements (approximately): (type-qualifier)* type-specifier */
787 { $$ = builtin_type_int; }
789 { $$ = builtin_type_long; }
791 { $$ = builtin_type_short; }
793 { $$ = builtin_type_long; }
794 | UNSIGNED LONG INT_KEYWORD
795 { $$ = builtin_type_unsigned_long; }
797 { $$ = builtin_type_long_long; }
798 | LONG LONG INT_KEYWORD
799 { $$ = builtin_type_long_long; }
801 { $$ = builtin_type_unsigned_long_long; }
802 | UNSIGNED LONG LONG INT_KEYWORD
803 { $$ = builtin_type_unsigned_long_long; }
805 { $$ = builtin_type_short; }
806 | UNSIGNED SHORT INT_KEYWORD
807 { $$ = builtin_type_unsigned_short; }
809 { $$ = lookup_struct (copy_name ($2),
810 expression_context_block); }
812 { $$ = lookup_struct (copy_name ($2),
813 expression_context_block); }
815 { $$ = lookup_union (copy_name ($2),
816 expression_context_block); }
818 { $$ = lookup_enum (copy_name ($2),
819 expression_context_block); }
821 { $$ = lookup_unsigned_typename (TYPE_NAME($2.type)); }
823 { $$ = builtin_type_unsigned_int; }
824 | SIGNED_KEYWORD typename
825 { $$ = lookup_signed_typename (TYPE_NAME($2.type)); }
827 { $$ = builtin_type_int; }
828 | TEMPLATE name '<' type '>'
829 { $$ = lookup_template_type(copy_name($2), $4,
830 expression_context_block);
832 /* "const" and "volatile" are curently ignored. A type qualifier
833 after the type is handled in the ptype rule. I think these could
835 | CONST_KEYWORD typebase { $$ = $2; }
836 | VOLATILE_KEYWORD typebase { $$ = $2; }
842 $$.stoken.ptr = "int";
843 $$.stoken.length = 3;
844 $$.type = builtin_type_int;
848 $$.stoken.ptr = "long";
849 $$.stoken.length = 4;
850 $$.type = builtin_type_long;
854 $$.stoken.ptr = "short";
855 $$.stoken.length = 5;
856 $$.type = builtin_type_short;
862 { $$ = (struct type **) malloc (sizeof (struct type *) * 2);
863 $<ivec>$[0] = 1; /* Number of types in vector */
866 | nonempty_typelist ',' type
867 { int len = sizeof (struct type *) * (++($<ivec>1[0]) + 1);
868 $$ = (struct type **) realloc ((char *) $1, len);
869 $$[$<ivec>$[0]] = $3;
873 name : NAME { $$ = $1.stoken; }
874 | BLOCKNAME { $$ = $1.stoken; }
875 | TYPENAME { $$ = $1.stoken; }
876 | NAME_OR_INT { $$ = $1.stoken; }
879 name_not_typename : NAME
881 /* These would be useful if name_not_typename was useful, but it is just
882 a fake for "variable", so these cause reduce/reduce conflicts because
883 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
884 =exp) or just an exp. If name_not_typename was ever used in an lvalue
885 context where only a name could occur, this might be useful.
892 /* Take care of parsing a number (anything that starts with a digit).
893 Set yylval and return the token type; update lexptr.
894 LEN is the number of characters in it. */
896 /*** Needs some error checking for the float case ***/
899 parse_number (p, len, parsed_float, putithere)
905 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
906 here, and we do kind of silly things like cast to unsigned. */
907 register LONGEST n = 0;
908 register LONGEST prevn = 0;
913 register int base = input_radix;
916 /* Number of "L" suffixes encountered. */
919 /* We have found a "L" or "U" suffix. */
920 int found_suffix = 0;
922 unsigned LONGEST high_bit;
923 struct type *signed_type;
924 struct type *unsigned_type;
928 /* It's a float since it contains a point or an exponent. */
929 putithere->dval = atof (p);
933 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
967 if (c >= 'A' && c <= 'Z')
969 if (c != 'l' && c != 'u')
971 if (c >= '0' && c <= '9')
979 if (base > 10 && c >= 'a' && c <= 'f')
983 n += i = c - 'a' + 10;
996 return ERROR; /* Char not a digit */
999 return ERROR; /* Invalid digit in this base */
1001 /* Portably test for overflow (only works for nonzero values, so make
1002 a second check for zero). FIXME: Can't we just make n and prevn
1003 unsigned and avoid this? */
1004 if (c != 'l' && c != 'u' && (prevn >= n) && n != 0)
1005 unsigned_p = 1; /* Try something unsigned */
1007 /* Portably test for unsigned overflow.
1008 FIXME: This check is wrong; for example it doesn't find overflow
1009 on 0x123456789 when LONGEST is 32 bits. */
1010 if (c != 'l' && c != 'u' && n != 0)
1012 if ((unsigned_p && (unsigned LONGEST) prevn >= (unsigned LONGEST) n))
1013 error ("Numeric constant too large.");
1018 /* An integer constant is an int, a long, or a long long. An L
1019 suffix forces it to be long; an LL suffix forces it to be long
1020 long. If not forced to a larger size, it gets the first type of
1021 the above that it fits in. To figure out whether it fits, we
1022 shift it right and see whether anything remains. Note that we
1023 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
1024 operation, because many compilers will warn about such a shift
1025 (which always produces a zero result). Sometimes TARGET_INT_BIT
1026 or TARGET_LONG_BIT will be that big, sometimes not. To deal with
1027 the case where it is we just always shift the value more than
1028 once, with fewer bits each time. */
1030 un = (unsigned LONGEST)n >> 2;
1032 && (un >> (TARGET_INT_BIT - 2)) == 0)
1034 high_bit = ((unsigned LONGEST)1) << (TARGET_INT_BIT-1);
1036 /* A large decimal (not hex or octal) constant (between INT_MAX
1037 and UINT_MAX) is a long or unsigned long, according to ANSI,
1038 never an unsigned int, but this code treats it as unsigned
1039 int. This probably should be fixed. GCC gives a warning on
1042 unsigned_type = builtin_type_unsigned_int;
1043 signed_type = builtin_type_int;
1045 else if (long_p <= 1
1046 && (un >> (TARGET_LONG_BIT - 2)) == 0)
1048 high_bit = ((unsigned LONGEST)1) << (TARGET_LONG_BIT-1);
1049 unsigned_type = builtin_type_unsigned_long;
1050 signed_type = builtin_type_long;
1054 high_bit = (((unsigned LONGEST)1)
1055 << (TARGET_LONG_LONG_BIT - 32 - 1)
1059 /* A long long does not fit in a LONGEST. */
1061 (unsigned LONGEST)1 << (sizeof (LONGEST) * HOST_CHAR_BIT - 1);
1062 unsigned_type = builtin_type_unsigned_long_long;
1063 signed_type = builtin_type_long_long;
1066 putithere->typed_val.val = n;
1068 /* If the high bit of the worked out type is set then this number
1069 has to be unsigned. */
1071 if (unsigned_p || (n & high_bit))
1073 putithere->typed_val.type = unsigned_type;
1077 putithere->typed_val.type = signed_type;
1087 enum exp_opcode opcode;
1090 static const struct token tokentab3[] =
1092 {">>=", ASSIGN_MODIFY, BINOP_RSH},
1093 {"<<=", ASSIGN_MODIFY, BINOP_LSH}
1096 static const struct token tokentab2[] =
1098 {"+=", ASSIGN_MODIFY, BINOP_ADD},
1099 {"-=", ASSIGN_MODIFY, BINOP_SUB},
1100 {"*=", ASSIGN_MODIFY, BINOP_MUL},
1101 {"/=", ASSIGN_MODIFY, BINOP_DIV},
1102 {"%=", ASSIGN_MODIFY, BINOP_REM},
1103 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR},
1104 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND},
1105 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR},
1106 {"++", INCREMENT, BINOP_END},
1107 {"--", DECREMENT, BINOP_END},
1108 {"->", ARROW, BINOP_END},
1109 {"&&", ANDAND, BINOP_END},
1110 {"||", OROR, BINOP_END},
1111 {"::", COLONCOLON, BINOP_END},
1112 {"<<", LSH, BINOP_END},
1113 {">>", RSH, BINOP_END},
1114 {"==", EQUAL, BINOP_END},
1115 {"!=", NOTEQUAL, BINOP_END},
1116 {"<=", LEQ, BINOP_END},
1117 {">=", GEQ, BINOP_END}
1120 /* Read one token, getting characters through lexptr. */
1131 static char *tempbuf;
1132 static int tempbufsize;
1137 /* See if it is a special token of length 3. */
1138 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
1139 if (STREQN (tokstart, tokentab3[i].operator, 3))
1142 yylval.opcode = tokentab3[i].opcode;
1143 return tokentab3[i].token;
1146 /* See if it is a special token of length 2. */
1147 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
1148 if (STREQN (tokstart, tokentab2[i].operator, 2))
1151 yylval.opcode = tokentab2[i].opcode;
1152 return tokentab2[i].token;
1155 switch (c = *tokstart)
1167 /* We either have a character constant ('0' or '\177' for example)
1168 or we have a quoted symbol reference ('foo(int,int)' in C++
1173 c = parse_escape (&lexptr);
1175 error ("Empty character constant.");
1177 yylval.typed_val.val = c;
1178 yylval.typed_val.type = builtin_type_char;
1183 namelen = skip_quoted (tokstart) - tokstart;
1186 lexptr = tokstart + namelen;
1187 if (lexptr[-1] != '\'')
1188 error ("Unmatched single quote.");
1193 error ("Invalid character constant.");
1203 if (paren_depth == 0)
1210 if (comma_terminates && paren_depth == 0)
1216 /* Might be a floating point number. */
1217 if (lexptr[1] < '0' || lexptr[1] > '9')
1218 goto symbol; /* Nope, must be a symbol. */
1219 /* FALL THRU into number case. */
1232 /* It's a number. */
1233 int got_dot = 0, got_e = 0, toktype;
1234 register char *p = tokstart;
1235 int hex = input_radix > 10;
1237 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
1242 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
1250 /* This test includes !hex because 'e' is a valid hex digit
1251 and thus does not indicate a floating point number when
1252 the radix is hex. */
1253 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
1254 got_dot = got_e = 1;
1255 /* This test does not include !hex, because a '.' always indicates
1256 a decimal floating point number regardless of the radix. */
1257 else if (!got_dot && *p == '.')
1259 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
1260 && (*p == '-' || *p == '+'))
1261 /* This is the sign of the exponent, not the end of the
1264 /* We will take any letters or digits. parse_number will
1265 complain if past the radix, or if L or U are not final. */
1266 else if ((*p < '0' || *p > '9')
1267 && ((*p < 'a' || *p > 'z')
1268 && (*p < 'A' || *p > 'Z')))
1271 toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval);
1272 if (toktype == ERROR)
1274 char *err_copy = (char *) alloca (p - tokstart + 1);
1276 memcpy (err_copy, tokstart, p - tokstart);
1277 err_copy[p - tokstart] = 0;
1278 error ("Invalid number \"%s\".", err_copy);
1310 /* Build the gdb internal form of the input string in tempbuf,
1311 translating any standard C escape forms seen. Note that the
1312 buffer is null byte terminated *only* for the convenience of
1313 debugging gdb itself and printing the buffer contents when
1314 the buffer contains no embedded nulls. Gdb does not depend
1315 upon the buffer being null byte terminated, it uses the length
1316 string instead. This allows gdb to handle C strings (as well
1317 as strings in other languages) with embedded null bytes */
1319 tokptr = ++tokstart;
1323 /* Grow the static temp buffer if necessary, including allocating
1324 the first one on demand. */
1325 if (tempbufindex + 1 >= tempbufsize)
1327 tempbuf = (char *) realloc (tempbuf, tempbufsize += 64);
1333 /* Do nothing, loop will terminate. */
1337 c = parse_escape (&tokptr);
1342 tempbuf[tempbufindex++] = c;
1345 tempbuf[tempbufindex++] = *tokptr++;
1348 } while ((*tokptr != '"') && (*tokptr != '\0'));
1349 if (*tokptr++ != '"')
1351 error ("Unterminated string in expression.");
1353 tempbuf[tempbufindex] = '\0'; /* See note above */
1354 yylval.sval.ptr = tempbuf;
1355 yylval.sval.length = tempbufindex;
1360 if (!(c == '_' || c == '$'
1361 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
1362 /* We must have come across a bad character (e.g. ';'). */
1363 error ("Invalid character '%c' in expression.", c);
1365 /* It's a name. See how long it is. */
1367 for (c = tokstart[namelen];
1368 (c == '_' || c == '$' || (c >= '0' && c <= '9')
1369 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');)
1374 while (tokstart[++i] && tokstart[i] != '>');
1375 if (tokstart[i] == '>')
1378 c = tokstart[++namelen];
1381 /* The token "if" terminates the expression and is NOT
1382 removed from the input stream. */
1383 if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f')
1392 /* Catch specific keywords. Should be done with a data structure. */
1396 if (STREQN (tokstart, "unsigned", 8))
1398 if (current_language->la_language == language_cplus
1399 && STREQN (tokstart, "template", 8))
1401 if (STREQN (tokstart, "volatile", 8))
1402 return VOLATILE_KEYWORD;
1405 if (STREQN (tokstart, "struct", 6))
1407 if (STREQN (tokstart, "signed", 6))
1408 return SIGNED_KEYWORD;
1409 if (STREQN (tokstart, "sizeof", 6))
1413 if (current_language->la_language == language_cplus
1414 && STREQN (tokstart, "class", 5))
1416 if (STREQN (tokstart, "union", 5))
1418 if (STREQN (tokstart, "short", 5))
1420 if (STREQN (tokstart, "const", 5))
1421 return CONST_KEYWORD;
1424 if (STREQN (tokstart, "enum", 4))
1426 if (STREQN (tokstart, "long", 4))
1428 if (current_language->la_language == language_cplus
1429 && STREQN (tokstart, "this", 4))
1431 static const char this_name[] =
1432 { CPLUS_MARKER, 't', 'h', 'i', 's', '\0' };
1434 if (lookup_symbol (this_name, expression_context_block,
1435 VAR_NAMESPACE, (int *) NULL,
1436 (struct symtab **) NULL))
1441 if (STREQN (tokstart, "int", 3))
1448 yylval.sval.ptr = tokstart;
1449 yylval.sval.length = namelen;
1451 if (*tokstart == '$')
1453 write_dollar_variable (yylval.sval);
1457 /* Use token-type BLOCKNAME for symbols that happen to be defined as
1458 functions or symtabs. If this is not so, then ...
1459 Use token-type TYPENAME for symbols that happen to be defined
1460 currently as names of types; NAME for other symbols.
1461 The caller is not constrained to care about the distinction. */
1463 char *tmp = copy_name (yylval.sval);
1465 int is_a_field_of_this = 0;
1468 sym = lookup_symbol (tmp, expression_context_block,
1470 current_language->la_language == language_cplus
1471 ? &is_a_field_of_this : (int *) NULL,
1472 (struct symtab **) NULL);
1473 /* Call lookup_symtab, not lookup_partial_symtab, in case there are
1474 no psymtabs (coff, xcoff, or some future change to blow away the
1475 psymtabs once once symbols are read). */
1476 if ((sym && SYMBOL_CLASS (sym) == LOC_BLOCK) ||
1477 lookup_symtab (tmp))
1479 yylval.ssym.sym = sym;
1480 yylval.ssym.is_a_field_of_this = is_a_field_of_this;
1483 if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF)
1486 /* Despite the following flaw, we need to keep this code enabled.
1487 Because we can get called from check_stub_method, if we don't
1488 handle nested types then it screws many operations in any
1489 program which uses nested types. */
1490 /* In "A::x", if x is a member function of A and there happens
1491 to be a type (nested or not, since the stabs don't make that
1492 distinction) named x, then this code incorrectly thinks we
1493 are dealing with nested types rather than a member function. */
1497 struct symbol *best_sym;
1499 /* Look ahead to detect nested types. This probably should be
1500 done in the grammar, but trying seemed to introduce a lot
1501 of shift/reduce and reduce/reduce conflicts. It's possible
1502 that it could be done, though. Or perhaps a non-grammar, but
1503 less ad hoc, approach would work well. */
1505 /* Since we do not currently have any way of distinguishing
1506 a nested type from a non-nested one (the stabs don't tell
1507 us whether a type is nested), we just ignore the
1514 /* Skip whitespace. */
1515 while (*p == ' ' || *p == '\t' || *p == '\n')
1517 if (*p == ':' && p[1] == ':')
1519 /* Skip the `::'. */
1521 /* Skip whitespace. */
1522 while (*p == ' ' || *p == '\t' || *p == '\n')
1525 while (*p == '_' || *p == '$' || (*p >= '0' && *p <= '9')
1526 || (*p >= 'a' && *p <= 'z')
1527 || (*p >= 'A' && *p <= 'Z'))
1531 struct symbol *cur_sym;
1532 /* As big as the whole rest of the expression, which is
1533 at least big enough. */
1534 char *ncopy = alloca (strlen (tmp)+strlen (namestart)+3);
1538 memcpy (tmp1, tmp, strlen (tmp));
1539 tmp1 += strlen (tmp);
1540 memcpy (tmp1, "::", 2);
1542 memcpy (tmp1, namestart, p - namestart);
1543 tmp1[p - namestart] = '\0';
1544 cur_sym = lookup_symbol (ncopy, expression_context_block,
1545 VAR_NAMESPACE, (int *) NULL,
1546 (struct symtab **) NULL);
1549 if (SYMBOL_CLASS (cur_sym) == LOC_TYPEDEF)
1567 yylval.tsym.type = SYMBOL_TYPE (best_sym);
1569 yylval.tsym.type = SYMBOL_TYPE (sym);
1573 if ((yylval.tsym.type = lookup_primitive_typename (tmp)) != 0)
1576 /* Input names that aren't symbols but ARE valid hex numbers,
1577 when the input radix permits them, can be names or numbers
1578 depending on the parse. Note we support radixes > 16 here. */
1580 ((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10) ||
1581 (tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10)))
1583 YYSTYPE newlval; /* Its value is ignored. */
1584 hextype = parse_number (tokstart, namelen, 0, &newlval);
1587 yylval.ssym.sym = sym;
1588 yylval.ssym.is_a_field_of_this = is_a_field_of_this;
1593 /* Any other kind of symbol */
1594 yylval.ssym.sym = sym;
1595 yylval.ssym.is_a_field_of_this = is_a_field_of_this;
1604 error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr);