1 /* YACC parser for Pascal expressions, for GDB.
2 Copyright (C) 2000, 2006, 2007, 2008, 2009 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 /* This file is derived from c-exp.y */
21 /* Parse a Pascal 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. */
38 /* Known bugs or limitations:
39 - pascal string operations are not supported at all.
40 - there are some problems with boolean types.
41 - Pascal type hexadecimal constants are not supported
42 because they conflict with the internal variables format.
43 Probably also lots of other problems, less well defined PM */
47 #include "gdb_string.h"
49 #include "expression.h"
51 #include "parser-defs.h"
54 #include "bfd.h" /* Required by objfiles.h. */
55 #include "symfile.h" /* Required by objfiles.h. */
56 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
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 pascal_maxdepth
69 #define yyparse pascal_parse
70 #define yylex pascal_lex
71 #define yyerror pascal_error
72 #define yylval pascal_lval
73 #define yychar pascal_char
74 #define yydebug pascal_debug
75 #define yypact pascal_pact
76 #define yyr1 pascal_r1
77 #define yyr2 pascal_r2
78 #define yydef pascal_def
79 #define yychk pascal_chk
80 #define yypgo pascal_pgo
81 #define yyact pascal_act
82 #define yyexca pascal_exca
83 #define yyerrflag pascal_errflag
84 #define yynerrs pascal_nerrs
85 #define yyps pascal_ps
86 #define yypv pascal_pv
88 #define yy_yys pascal_yys
89 #define yystate pascal_state
90 #define yytmp pascal_tmp
92 #define yy_yyv pascal_yyv
93 #define yyval pascal_val
94 #define yylloc pascal_lloc
95 #define yyreds pascal_reds /* With YYDEBUG defined */
96 #define yytoks pascal_toks /* With YYDEBUG defined */
97 #define yyname pascal_name /* With YYDEBUG defined */
98 #define yyrule pascal_rule /* With YYDEBUG defined */
99 #define yylhs pascal_yylhs
100 #define yylen pascal_yylen
101 #define yydefred pascal_yydefred
102 #define yydgoto pascal_yydgoto
103 #define yysindex pascal_yysindex
104 #define yyrindex pascal_yyrindex
105 #define yygindex pascal_yygindex
106 #define yytable pascal_yytable
107 #define yycheck pascal_yycheck
110 #define YYDEBUG 1 /* Default to yydebug support */
113 #define YYFPRINTF parser_fprintf
117 static int yylex (void);
122 static char * uptok
(char *, int);
125 /* Although the yacc "value" of an expression is not used,
126 since the result is stored in the structure being created,
127 other node types do have values. */
144 struct symtoken ssym
;
147 enum exp_opcode opcode
;
148 struct internalvar
*ivar
;
155 /* YYSTYPE gets defined by %union */
157 parse_number
(char *, int, int, YYSTYPE *);
159 static struct type
*current_type
;
160 static int leftdiv_is_integer
;
161 static void push_current_type
(void);
162 static void pop_current_type
(void);
163 static int search_field
;
166 %type
<voidval
> exp exp1 type_exp start normal_start variable qualified_name
167 %type
<tval
> type typebase
168 /* %type <bval> block */
170 /* Fancy type parsing. */
173 %token
<typed_val_int
> INT
174 %token
<typed_val_float
> FLOAT
176 /* Both NAME and TYPENAME tokens represent symbols in the input,
177 and both convey their data as strings.
178 But a TYPENAME is a string that happens to be defined as a typedef
179 or builtin type name (such as int or char)
180 and a NAME is any other symbol.
181 Contexts where this distinction is not important can use the
182 nonterminal "name", which matches either NAME or TYPENAME. */
185 %token
<sval
> FIELDNAME
186 %token
<ssym
> NAME
/* BLOCKNAME defined below to give it higher precedence. */
187 %token
<tsym
> TYPENAME
189 %type
<ssym
> name_not_typename
191 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
192 but which would parse as a valid number in the current input radix.
193 E.g. "c" when input_radix==16. Depending on the parse, it will be
194 turned into a name or into a number. */
196 %token
<ssym
> NAME_OR_INT
198 %token STRUCT CLASS SIZEOF COLONCOLON
201 /* Special type cases, put in to allow the parser to distinguish different
204 %token
<voidval
> VARIABLE
209 %token
<lval
> TRUEKEYWORD FALSEKEYWORD
219 %left
'<' '>' LEQ GEQ
220 %left LSH RSH DIV MOD
224 %right UNARY INCREMENT DECREMENT
225 %right ARROW
'.' '[' '('
227 %token
<ssym
> BLOCKNAME
234 start
: { current_type
= NULL
;
236 leftdiv_is_integer
= 0;
247 { write_exp_elt_opcode
(OP_TYPE
);
248 write_exp_elt_type
($1);
249 write_exp_elt_opcode
(OP_TYPE
);
250 current_type
= $1; } ;
252 /* Expressions, including the comma operator. */
255 { write_exp_elt_opcode
(BINOP_COMMA
); }
258 /* Expressions, not including the comma operator. */
259 exp
: exp
'^' %prec UNARY
260 { write_exp_elt_opcode
(UNOP_IND
);
262 current_type
= TYPE_TARGET_TYPE
(current_type
); }
265 exp
: '@' exp %prec UNARY
266 { write_exp_elt_opcode
(UNOP_ADDR
);
268 current_type
= TYPE_POINTER_TYPE
(current_type
); }
271 exp
: '-' exp %prec UNARY
272 { write_exp_elt_opcode
(UNOP_NEG
); }
275 exp
: NOT exp %prec UNARY
276 { write_exp_elt_opcode
(UNOP_LOGICAL_NOT
); }
279 exp
: INCREMENT
'(' exp
')' %prec UNARY
280 { write_exp_elt_opcode
(UNOP_PREINCREMENT
); }
283 exp
: DECREMENT
'(' exp
')' %prec UNARY
284 { write_exp_elt_opcode
(UNOP_PREDECREMENT
); }
287 exp
: exp
'.' { search_field
= 1; }
290 { write_exp_elt_opcode
(STRUCTOP_STRUCT
);
291 write_exp_string
($4);
292 write_exp_elt_opcode
(STRUCTOP_STRUCT
);
295 { while
(TYPE_CODE
(current_type
) == TYPE_CODE_PTR
)
296 current_type
= TYPE_TARGET_TYPE
(current_type
);
297 current_type
= lookup_struct_elt_type
(
298 current_type
, $4.ptr
, 0); };
301 /* We need to save the current_type value */
304 arrayfieldindex
= is_pascal_string_type
(
305 current_type
, NULL
, NULL
,
306 NULL
, NULL
, &arrayname
);
309 struct stoken stringsval
;
310 stringsval.ptr
= alloca
(strlen
(arrayname
) + 1);
311 stringsval.length
= strlen
(arrayname
);
312 strcpy
(stringsval.ptr
, arrayname
);
313 current_type
= TYPE_FIELD_TYPE
(current_type
,
314 arrayfieldindex
- 1);
315 write_exp_elt_opcode
(STRUCTOP_STRUCT
);
316 write_exp_string
(stringsval
);
317 write_exp_elt_opcode
(STRUCTOP_STRUCT
);
319 push_current_type
(); }
321 { pop_current_type
();
322 write_exp_elt_opcode
(BINOP_SUBSCRIPT
);
324 current_type
= TYPE_TARGET_TYPE
(current_type
); }
328 /* This is to save the value of arglist_len
329 being accumulated by an outer function call. */
330 { push_current_type
();
332 arglist
')' %prec ARROW
333 { write_exp_elt_opcode
(OP_FUNCALL
);
334 write_exp_elt_longcst
((LONGEST
) end_arglist
());
335 write_exp_elt_opcode
(OP_FUNCALL
);
338 current_type
= TYPE_TARGET_TYPE
(current_type
);
345 | arglist
',' exp %prec ABOVE_COMMA
349 exp
: type
'(' exp
')' %prec UNARY
352 /* Allow automatic dereference of classes. */
353 if
((TYPE_CODE
(current_type
) == TYPE_CODE_PTR
)
354 && (TYPE_CODE
(TYPE_TARGET_TYPE
(current_type
)) == TYPE_CODE_CLASS
)
355 && (TYPE_CODE
($1) == TYPE_CODE_CLASS
))
356 write_exp_elt_opcode
(UNOP_IND
);
358 write_exp_elt_opcode
(UNOP_CAST
);
359 write_exp_elt_type
($1);
360 write_exp_elt_opcode
(UNOP_CAST
);
368 /* Binary operators in order of decreasing precedence. */
371 { write_exp_elt_opcode
(BINOP_MUL
); }
375 if
(current_type
&& is_integral_type
(current_type
))
376 leftdiv_is_integer
= 1;
380 if
(leftdiv_is_integer
&& current_type
381 && is_integral_type
(current_type
))
383 write_exp_elt_opcode
(UNOP_CAST
);
384 write_exp_elt_type
(parse_type
->builtin_long_double
);
385 current_type
= parse_type
->builtin_long_double
;
386 write_exp_elt_opcode
(UNOP_CAST
);
387 leftdiv_is_integer
= 0;
390 write_exp_elt_opcode
(BINOP_DIV
);
395 { write_exp_elt_opcode
(BINOP_INTDIV
); }
399 { write_exp_elt_opcode
(BINOP_REM
); }
403 { write_exp_elt_opcode
(BINOP_ADD
); }
407 { write_exp_elt_opcode
(BINOP_SUB
); }
411 { write_exp_elt_opcode
(BINOP_LSH
); }
415 { write_exp_elt_opcode
(BINOP_RSH
); }
419 { write_exp_elt_opcode
(BINOP_EQUAL
);
420 current_type
= parse_type
->builtin_bool
;
424 exp
: exp NOTEQUAL exp
425 { write_exp_elt_opcode
(BINOP_NOTEQUAL
);
426 current_type
= parse_type
->builtin_bool
;
431 { write_exp_elt_opcode
(BINOP_LEQ
);
432 current_type
= parse_type
->builtin_bool
;
437 { write_exp_elt_opcode
(BINOP_GEQ
);
438 current_type
= parse_type
->builtin_bool
;
443 { write_exp_elt_opcode
(BINOP_LESS
);
444 current_type
= parse_type
->builtin_bool
;
449 { write_exp_elt_opcode
(BINOP_GTR
);
450 current_type
= parse_type
->builtin_bool
;
455 { write_exp_elt_opcode
(BINOP_BITWISE_AND
); }
459 { write_exp_elt_opcode
(BINOP_BITWISE_XOR
); }
463 { write_exp_elt_opcode
(BINOP_BITWISE_IOR
); }
467 { write_exp_elt_opcode
(BINOP_ASSIGN
); }
471 { write_exp_elt_opcode
(OP_BOOL
);
472 write_exp_elt_longcst
((LONGEST
) $1);
473 current_type
= parse_type
->builtin_bool
;
474 write_exp_elt_opcode
(OP_BOOL
); }
478 { write_exp_elt_opcode
(OP_BOOL
);
479 write_exp_elt_longcst
((LONGEST
) $1);
480 current_type
= parse_type
->builtin_bool
;
481 write_exp_elt_opcode
(OP_BOOL
); }
485 { write_exp_elt_opcode
(OP_LONG
);
486 write_exp_elt_type
($1.type
);
487 current_type
= $1.type
;
488 write_exp_elt_longcst
((LONGEST
)($1.val
));
489 write_exp_elt_opcode
(OP_LONG
); }
494 parse_number
($1.stoken.ptr
, $1.stoken.length
, 0, &val
);
495 write_exp_elt_opcode
(OP_LONG
);
496 write_exp_elt_type
(val.typed_val_int.type
);
497 current_type
= val.typed_val_int.type
;
498 write_exp_elt_longcst
((LONGEST
)val.typed_val_int.val
);
499 write_exp_elt_opcode
(OP_LONG
);
505 { write_exp_elt_opcode
(OP_DOUBLE
);
506 write_exp_elt_type
($1.type
);
507 current_type
= $1.type
;
508 write_exp_elt_dblcst
($1.dval
);
509 write_exp_elt_opcode
(OP_DOUBLE
); }
516 /* Already written by write_dollar_variable. */
519 exp
: SIZEOF
'(' type
')' %prec UNARY
520 { write_exp_elt_opcode
(OP_LONG
);
521 write_exp_elt_type
(parse_type
->builtin_int
);
523 write_exp_elt_longcst
((LONGEST
) TYPE_LENGTH
($3));
524 write_exp_elt_opcode
(OP_LONG
); }
528 { /* C strings are converted into array constants with
529 an explicit null byte added at the end. Thus
530 the array upper bound is the string length.
531 There is no such thing in C as a completely empty
533 char *sp
= $1.ptr
; int count
= $1.length
;
536 write_exp_elt_opcode
(OP_LONG
);
537 write_exp_elt_type
(parse_type
->builtin_char
);
538 write_exp_elt_longcst
((LONGEST
)(*sp
++));
539 write_exp_elt_opcode
(OP_LONG
);
541 write_exp_elt_opcode
(OP_LONG
);
542 write_exp_elt_type
(parse_type
->builtin_char
);
543 write_exp_elt_longcst
((LONGEST
)'\0');
544 write_exp_elt_opcode
(OP_LONG
);
545 write_exp_elt_opcode
(OP_ARRAY
);
546 write_exp_elt_longcst
((LONGEST
) 0);
547 write_exp_elt_longcst
((LONGEST
) ($1.length
));
548 write_exp_elt_opcode
(OP_ARRAY
); }
554 struct value
* this_val
;
555 struct type
* this_type
;
556 write_exp_elt_opcode
(OP_THIS
);
557 write_exp_elt_opcode
(OP_THIS
);
558 /* we need type of this */
559 this_val
= value_of_this
(0);
561 this_type
= value_type
(this_val
);
566 if
(TYPE_CODE
(this_type
) == TYPE_CODE_PTR
)
568 this_type
= TYPE_TARGET_TYPE
(this_type
);
569 write_exp_elt_opcode
(UNOP_IND
);
573 current_type
= this_type
;
577 /* end of object pascal. */
582 $$
= SYMBOL_BLOCK_VALUE
($1.sym
);
586 lookup_symtab
(copy_name
($1.stoken
));
588 $$
= BLOCKVECTOR_BLOCK
(BLOCKVECTOR
(tem
), STATIC_BLOCK
);
590 error ("No file or function \"%s\".",
591 copy_name
($1.stoken
));
596 block
: block COLONCOLON name
598 = lookup_symbol
(copy_name
($3), $1,
599 VAR_DOMAIN
, (int *) NULL
);
600 if
(!tem || SYMBOL_CLASS
(tem
) != LOC_BLOCK
)
601 error ("No function \"%s\" in specified context.",
603 $$
= SYMBOL_BLOCK_VALUE
(tem
); }
606 variable: block COLONCOLON name
607 { struct symbol
*sym
;
608 sym
= lookup_symbol
(copy_name
($3), $1,
609 VAR_DOMAIN
, (int *) NULL
);
611 error ("No symbol \"%s\" in specified context.",
614 write_exp_elt_opcode
(OP_VAR_VALUE
);
615 /* block_found is set by lookup_symbol. */
616 write_exp_elt_block
(block_found
);
617 write_exp_elt_sym
(sym
);
618 write_exp_elt_opcode
(OP_VAR_VALUE
); }
621 qualified_name: typebase COLONCOLON name
623 struct type
*type
= $1;
624 if
(TYPE_CODE
(type
) != TYPE_CODE_STRUCT
625 && TYPE_CODE
(type
) != TYPE_CODE_UNION
)
626 error ("`%s' is not defined as an aggregate type.",
629 write_exp_elt_opcode
(OP_SCOPE
);
630 write_exp_elt_type
(type
);
631 write_exp_string
($3);
632 write_exp_elt_opcode
(OP_SCOPE
);
636 variable: qualified_name
639 char *name
= copy_name
($2);
641 struct minimal_symbol
*msymbol
;
644 lookup_symbol
(name
, (const struct block
*) NULL
,
645 VAR_DOMAIN
, (int *) NULL
);
648 write_exp_elt_opcode
(OP_VAR_VALUE
);
649 write_exp_elt_block
(NULL
);
650 write_exp_elt_sym
(sym
);
651 write_exp_elt_opcode
(OP_VAR_VALUE
);
655 msymbol
= lookup_minimal_symbol
(name
, NULL
, NULL
);
657 write_exp_msymbol
(msymbol
);
658 else if
(!have_full_symbols
() && !have_partial_symbols
())
659 error ("No symbol table is loaded. Use the \"file\" command.");
661 error ("No symbol \"%s\" in current context.", name
);
665 variable: name_not_typename
666 { struct symbol
*sym
= $1.sym
;
670 if
(symbol_read_needs_frame
(sym
))
672 if
(innermost_block
== 0
673 || contained_in
(block_found
,
675 innermost_block
= block_found
;
678 write_exp_elt_opcode
(OP_VAR_VALUE
);
679 /* We want to use the selected frame, not
680 another more inner frame which happens to
681 be in the same block. */
682 write_exp_elt_block
(NULL
);
683 write_exp_elt_sym
(sym
);
684 write_exp_elt_opcode
(OP_VAR_VALUE
);
685 current_type
= sym
->type
; }
686 else if
($1.is_a_field_of_this
)
688 struct value
* this_val
;
689 struct type
* this_type
;
690 /* Object pascal: it hangs off of `this'. Must
691 not inadvertently convert from a method call
693 if
(innermost_block
== 0
694 || contained_in
(block_found
,
696 innermost_block
= block_found
;
697 write_exp_elt_opcode
(OP_THIS
);
698 write_exp_elt_opcode
(OP_THIS
);
699 write_exp_elt_opcode
(STRUCTOP_PTR
);
700 write_exp_string
($1.stoken
);
701 write_exp_elt_opcode
(STRUCTOP_PTR
);
702 /* we need type of this */
703 this_val
= value_of_this
(0);
705 this_type
= value_type
(this_val
);
709 current_type
= lookup_struct_elt_type
(
711 copy_name
($1.stoken
), 0);
717 struct minimal_symbol
*msymbol
;
718 char *arg
= copy_name
($1.stoken
);
721 lookup_minimal_symbol
(arg
, NULL
, NULL
);
723 write_exp_msymbol
(msymbol
);
724 else if
(!have_full_symbols
() && !have_partial_symbols
())
725 error ("No symbol table is loaded. Use the \"file\" command.");
727 error ("No symbol \"%s\" in current context.",
728 copy_name
($1.stoken
));
737 /* We used to try to recognize more pointer to member types here, but
738 that didn't work (shift/reduce conflicts meant that these rules never
739 got executed). The problem is that
740 int (foo::bar::baz::bizzle)
741 is a function type but
742 int (foo::bar::baz::bizzle::*)
743 is a pointer to member type. Stroustrup loses again! */
748 typebase
/* Implements (approximately): (type-qualifier)* type-specifier */
750 { $$
= lookup_pointer_type
($2); }
754 { $$
= lookup_struct
(copy_name
($2),
755 expression_context_block
); }
757 { $$
= lookup_struct
(copy_name
($2),
758 expression_context_block
); }
759 /* "const" and "volatile" are curently ignored. A type qualifier
760 after the type is handled in the ptype rule. I think these could
764 name
: NAME
{ $$
= $1.stoken
; }
765 | BLOCKNAME
{ $$
= $1.stoken
; }
766 | TYPENAME
{ $$
= $1.stoken
; }
767 | NAME_OR_INT
{ $$
= $1.stoken
; }
770 name_not_typename
: NAME
772 /* These would be useful if name_not_typename was useful, but it is just
773 a fake for "variable", so these cause reduce/reduce conflicts because
774 the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable,
775 =exp) or just an exp. If name_not_typename was ever used in an lvalue
776 context where only a name could occur, this might be useful.
783 /* Take care of parsing a number (anything that starts with a digit).
784 Set yylval and return the token type; update lexptr.
785 LEN is the number of characters in it. */
787 /*** Needs some error checking for the float case ***/
790 parse_number
(p
, len
, parsed_float
, putithere
)
796 /* FIXME: Shouldn't these be unsigned? We don't deal with negative values
797 here, and we do kind of silly things like cast to unsigned. */
804 int base
= input_radix
;
807 /* Number of "L" suffixes encountered. */
810 /* We have found a "L" or "U" suffix. */
811 int found_suffix
= 0;
814 struct type
*signed_type
;
815 struct type
*unsigned_type
;
819 /* It's a float since it contains a point or an exponent. */
821 int num
= 0; /* number of tokens scanned by scanf */
822 char saved_char
= p
[len
];
824 p
[len
] = 0; /* null-terminate the token */
825 num
= sscanf
(p
, "%" DOUBLEST_SCAN_FORMAT
"%c",
826 &putithere
->typed_val_float.dval
, &c
);
827 p
[len
] = saved_char
; /* restore the input stream */
828 if
(num
!= 1) /* check scanf found ONLY a float ... */
830 /* See if it has `f' or `l' suffix (float or long double). */
832 c
= tolower
(p
[len
- 1]);
835 putithere
->typed_val_float.type
= parse_type
->builtin_float
;
837 putithere
->typed_val_float.type
= parse_type
->builtin_long_double
;
838 else if
(isdigit
(c
) || c
== '.')
839 putithere
->typed_val_float.type
= parse_type
->builtin_double
;
846 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
880 if
(c
>= 'A' && c
<= 'Z')
882 if
(c
!= 'l' && c
!= 'u')
884 if
(c
>= '0' && c
<= '9')
892 if
(base
> 10 && c
>= 'a' && c
<= 'f')
896 n
+= i
= c
- 'a' + 10;
909 return ERROR
; /* Char not a digit */
912 return ERROR
; /* Invalid digit in this base */
914 /* Portably test for overflow (only works for nonzero values, so make
915 a second check for zero). FIXME: Can't we just make n and prevn
916 unsigned and avoid this? */
917 if
(c
!= 'l' && c
!= 'u' && (prevn
>= n
) && n
!= 0)
918 unsigned_p
= 1; /* Try something unsigned */
920 /* Portably test for unsigned overflow.
921 FIXME: This check is wrong; for example it doesn't find overflow
922 on 0x123456789 when LONGEST is 32 bits. */
923 if
(c
!= 'l' && c
!= 'u' && n
!= 0)
925 if
((unsigned_p
&& (ULONGEST
) prevn
>= (ULONGEST
) n
))
926 error ("Numeric constant too large.");
931 /* An integer constant is an int, a long, or a long long. An L
932 suffix forces it to be long; an LL suffix forces it to be long
933 long. If not forced to a larger size, it gets the first type of
934 the above that it fits in. To figure out whether it fits, we
935 shift it right and see whether anything remains. Note that we
936 can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one
937 operation, because many compilers will warn about such a shift
938 (which always produces a zero result). Sometimes gdbarch_int_bit
939 or gdbarch_long_bit will be that big, sometimes not. To deal with
940 the case where it is we just always shift the value more than
941 once, with fewer bits each time. */
943 un
= (ULONGEST
)n
>> 2;
945 && (un
>> (gdbarch_int_bit
(parse_gdbarch
) - 2)) == 0)
947 high_bit
= ((ULONGEST
)1) << (gdbarch_int_bit
(parse_gdbarch
) - 1);
949 /* A large decimal (not hex or octal) constant (between INT_MAX
950 and UINT_MAX) is a long or unsigned long, according to ANSI,
951 never an unsigned int, but this code treats it as unsigned
952 int. This probably should be fixed. GCC gives a warning on
955 unsigned_type
= parse_type
->builtin_unsigned_int
;
956 signed_type
= parse_type
->builtin_int
;
959 && (un
>> (gdbarch_long_bit
(parse_gdbarch
) - 2)) == 0)
961 high_bit
= ((ULONGEST
)1) << (gdbarch_long_bit
(parse_gdbarch
) - 1);
962 unsigned_type
= parse_type
->builtin_unsigned_long
;
963 signed_type
= parse_type
->builtin_long
;
968 if
(sizeof
(ULONGEST
) * HOST_CHAR_BIT
969 < gdbarch_long_long_bit
(parse_gdbarch
))
970 /* A long long does not fit in a LONGEST. */
971 shift
= (sizeof
(ULONGEST
) * HOST_CHAR_BIT
- 1);
973 shift
= (gdbarch_long_long_bit
(parse_gdbarch
) - 1);
974 high_bit
= (ULONGEST
) 1 << shift
;
975 unsigned_type
= parse_type
->builtin_unsigned_long_long
;
976 signed_type
= parse_type
->builtin_long_long
;
979 putithere
->typed_val_int.val
= n
;
981 /* If the high bit of the worked out type is set then this number
982 has to be unsigned. */
984 if
(unsigned_p ||
(n
& high_bit
))
986 putithere
->typed_val_int.type
= unsigned_type
;
990 putithere
->typed_val_int.type
= signed_type
;
1000 struct type_push
*next
;
1003 static struct type_push
*tp_top
= NULL
;
1006 push_current_type
(void)
1008 struct type_push
*tpnew
;
1009 tpnew
= (struct type_push
*) malloc
(sizeof
(struct type_push
));
1010 tpnew
->next
= tp_top
;
1011 tpnew
->stored
= current_type
;
1012 current_type
= NULL
;
1017 pop_current_type
(void)
1019 struct type_push
*tp
= tp_top
;
1022 current_type
= tp
->stored
;
1032 enum exp_opcode opcode
;
1035 static const struct token tokentab3
[] =
1037 {"shr", RSH
, BINOP_END
},
1038 {"shl", LSH
, BINOP_END
},
1039 {"and", ANDAND
, BINOP_END
},
1040 {"div", DIV
, BINOP_END
},
1041 {"not", NOT
, BINOP_END
},
1042 {"mod", MOD
, BINOP_END
},
1043 {"inc", INCREMENT
, BINOP_END
},
1044 {"dec", DECREMENT
, BINOP_END
},
1045 {"xor", XOR
, BINOP_END
}
1048 static const struct token tokentab2
[] =
1050 {"or", OR
, BINOP_END
},
1051 {"<>", NOTEQUAL
, BINOP_END
},
1052 {"<=", LEQ
, BINOP_END
},
1053 {">=", GEQ
, BINOP_END
},
1054 {":=", ASSIGN
, BINOP_END
},
1055 {"::", COLONCOLON
, BINOP_END
} };
1057 /* Allocate uppercased var */
1058 /* make an uppercased copy of tokstart */
1059 static char * uptok
(tokstart
, namelen
)
1064 char *uptokstart
= (char *)malloc
(namelen
+1);
1065 for
(i
= 0;i
<= namelen
;i
++)
1067 if
((tokstart
[i
]>='a' && tokstart
[i
]<='z'))
1068 uptokstart
[i
] = tokstart
[i
]-('a'-'A');
1070 uptokstart
[i
] = tokstart
[i
];
1072 uptokstart
[namelen
]='\0';
1075 /* Read one token, getting characters through lexptr. */
1088 int explen
, tempbufindex
;
1089 static char *tempbuf
;
1090 static int tempbufsize
;
1094 prev_lexptr
= lexptr
;
1097 explen
= strlen
(lexptr
);
1098 /* See if it is a special token of length 3. */
1100 for
(i
= 0; i
< sizeof
(tokentab3
) / sizeof
(tokentab3
[0]); i
++)
1101 if
(strncasecmp
(tokstart
, tokentab3
[i
].operator
, 3) == 0
1102 && (!isalpha
(tokentab3
[i
].operator
[0]) || explen
== 3
1103 ||
(!isalpha
(tokstart
[3]) && !isdigit
(tokstart
[3]) && tokstart
[3] != '_')))
1106 yylval.opcode
= tokentab3
[i
].opcode
;
1107 return tokentab3
[i
].token
;
1110 /* See if it is a special token of length 2. */
1112 for
(i
= 0; i
< sizeof
(tokentab2
) / sizeof
(tokentab2
[0]); i
++)
1113 if
(strncasecmp
(tokstart
, tokentab2
[i
].operator
, 2) == 0
1114 && (!isalpha
(tokentab2
[i
].operator
[0]) || explen
== 2
1115 ||
(!isalpha
(tokstart
[2]) && !isdigit
(tokstart
[2]) && tokstart
[2] != '_')))
1118 yylval.opcode
= tokentab2
[i
].opcode
;
1119 return tokentab2
[i
].token
;
1122 switch
(c
= *tokstart
)
1134 /* We either have a character constant ('0' or '\177' for example)
1135 or we have a quoted symbol reference ('foo(int,int)' in object pascal
1140 c
= parse_escape
(&lexptr
);
1142 error ("Empty character constant.");
1144 yylval.typed_val_int.val
= c
;
1145 yylval.typed_val_int.type
= parse_type
->builtin_char
;
1150 namelen
= skip_quoted
(tokstart
) - tokstart
;
1153 lexptr
= tokstart
+ namelen
;
1154 if
(lexptr
[-1] != '\'')
1155 error ("Unmatched single quote.");
1158 uptokstart
= uptok
(tokstart
,namelen
);
1161 error ("Invalid character constant.");
1171 if
(paren_depth
== 0)
1178 if
(comma_terminates
&& paren_depth
== 0)
1184 /* Might be a floating point number. */
1185 if
(lexptr
[1] < '0' || lexptr
[1] > '9')
1186 goto symbol
; /* Nope, must be a symbol. */
1187 /* FALL THRU into number case. */
1200 /* It's a number. */
1201 int got_dot
= 0, got_e
= 0, toktype
;
1203 int hex
= input_radix
> 10;
1205 if
(c
== '0' && (p
[1] == 'x' || p
[1] == 'X'))
1210 else if
(c
== '0' && (p
[1]=='t' || p
[1]=='T' || p
[1]=='d' || p
[1]=='D'))
1218 /* This test includes !hex because 'e' is a valid hex digit
1219 and thus does not indicate a floating point number when
1220 the radix is hex. */
1221 if
(!hex
&& !got_e
&& (*p
== 'e' ||
*p
== 'E'))
1222 got_dot
= got_e
= 1;
1223 /* This test does not include !hex, because a '.' always indicates
1224 a decimal floating point number regardless of the radix. */
1225 else if
(!got_dot
&& *p
== '.')
1227 else if
(got_e
&& (p
[-1] == 'e' || p
[-1] == 'E')
1228 && (*p
== '-' ||
*p
== '+'))
1229 /* This is the sign of the exponent, not the end of the
1232 /* We will take any letters or digits. parse_number will
1233 complain if past the radix, or if L or U are not final. */
1234 else if
((*p
< '0' ||
*p
> '9')
1235 && ((*p
< 'a' ||
*p
> 'z')
1236 && (*p
< 'A' ||
*p
> 'Z')))
1239 toktype
= parse_number
(tokstart
, p
- tokstart
, got_dot|got_e
, &yylval);
1240 if
(toktype
== ERROR
)
1242 char *err_copy
= (char *) alloca
(p
- tokstart
+ 1);
1244 memcpy
(err_copy
, tokstart
, p
- tokstart
);
1245 err_copy
[p
- tokstart
] = 0;
1246 error ("Invalid number \"%s\".", err_copy
);
1277 /* Build the gdb internal form of the input string in tempbuf,
1278 translating any standard C escape forms seen. Note that the
1279 buffer is null byte terminated *only* for the convenience of
1280 debugging gdb itself and printing the buffer contents when
1281 the buffer contains no embedded nulls. Gdb does not depend
1282 upon the buffer being null byte terminated, it uses the length
1283 string instead. This allows gdb to handle C strings (as well
1284 as strings in other languages) with embedded null bytes */
1286 tokptr
= ++tokstart
;
1290 /* Grow the static temp buffer if necessary, including allocating
1291 the first one on demand. */
1292 if
(tempbufindex
+ 1 >= tempbufsize
)
1294 tempbuf
= (char *) realloc
(tempbuf
, tempbufsize
+= 64);
1301 /* Do nothing, loop will terminate. */
1305 c
= parse_escape
(&tokptr
);
1310 tempbuf
[tempbufindex
++] = c
;
1313 tempbuf
[tempbufindex
++] = *tokptr
++;
1316 } while
((*tokptr
!= '"') && (*tokptr
!= '\0'));
1317 if
(*tokptr
++ != '"')
1319 error ("Unterminated string in expression.");
1321 tempbuf
[tempbufindex
] = '\0'; /* See note above */
1322 yylval.sval.ptr
= tempbuf
;
1323 yylval.sval.length
= tempbufindex
;
1328 if
(!(c
== '_' || c
== '$'
1329 ||
(c
>= 'a' && c
<= 'z') ||
(c
>= 'A' && c
<= 'Z')))
1330 /* We must have come across a bad character (e.g. ';'). */
1331 error ("Invalid character '%c' in expression.", c
);
1333 /* It's a name. See how long it is. */
1335 for
(c
= tokstart
[namelen
];
1336 (c
== '_' || c
== '$' ||
(c
>= '0' && c
<= '9')
1337 ||
(c
>= 'a' && c
<= 'z') ||
(c
>= 'A' && c
<= 'Z') || c
== '<');)
1339 /* Template parameter lists are part of the name.
1340 FIXME: This mishandles `print $a<4&&$a>3'. */
1344 int nesting_level
= 1;
1345 while
(tokstart
[++i
])
1347 if
(tokstart
[i
] == '<')
1349 else if
(tokstart
[i
] == '>')
1351 if
(--nesting_level
== 0)
1355 if
(tokstart
[i
] == '>')
1361 /* do NOT uppercase internals because of registers !!! */
1362 c
= tokstart
[++namelen
];
1365 uptokstart
= uptok
(tokstart
,namelen
);
1367 /* The token "if" terminates the expression and is NOT
1368 removed from the input stream. */
1369 if
(namelen
== 2 && uptokstart
[0] == 'I' && uptokstart
[1] == 'F')
1379 /* Catch specific keywords. Should be done with a data structure. */
1383 if
(strcmp
(uptokstart
, "OBJECT") == 0)
1388 if
(strcmp
(uptokstart
, "RECORD") == 0)
1393 if
(strcmp
(uptokstart
, "SIZEOF") == 0)
1400 if
(strcmp
(uptokstart
, "CLASS") == 0)
1405 if
(strcmp
(uptokstart
, "FALSE") == 0)
1409 return FALSEKEYWORD
;
1413 if
(strcmp
(uptokstart
, "TRUE") == 0)
1419 if
(strcmp
(uptokstart
, "SELF") == 0)
1421 /* here we search for 'this' like
1422 inserted in FPC stabs debug info */
1423 static const char this_name
[] = "this";
1425 if
(lookup_symbol
(this_name
, expression_context_block
,
1426 VAR_DOMAIN
, (int *) NULL
))
1437 yylval.sval.ptr
= tokstart
;
1438 yylval.sval.length
= namelen
;
1440 if
(*tokstart
== '$')
1442 /* $ is the normal prefix for pascal hexadecimal values
1443 but this conflicts with the GDB use for debugger variables
1444 so in expression to enter hexadecimal values
1445 we still need to use C syntax with 0xff */
1446 write_dollar_variable
(yylval.sval
);
1451 /* Use token-type BLOCKNAME for symbols that happen to be defined as
1452 functions or symtabs. If this is not so, then ...
1453 Use token-type TYPENAME for symbols that happen to be defined
1454 currently as names of types; NAME for other symbols.
1455 The caller is not constrained to care about the distinction. */
1457 char *tmp
= copy_name
(yylval.sval
);
1459 int is_a_field_of_this
= 0;
1464 if
(search_field
&& current_type
)
1465 is_a_field
= (lookup_struct_elt_type
(current_type
, tmp
, 1) != NULL
);
1469 sym
= lookup_symbol
(tmp
, expression_context_block
,
1470 VAR_DOMAIN
, &is_a_field_of_this
);
1471 /* second chance uppercased (as Free Pascal does). */
1472 if
(!sym
&& !is_a_field_of_this
&& !is_a_field
)
1474 for
(i
= 0; i
<= namelen
; i
++)
1476 if
((tmp
[i
] >= 'a' && tmp
[i
] <= 'z'))
1477 tmp
[i
] -= ('a'-'A');
1479 if
(search_field
&& current_type
)
1480 is_a_field
= (lookup_struct_elt_type
(current_type
, tmp
, 1) != NULL
);
1484 sym
= lookup_symbol
(tmp
, expression_context_block
,
1485 VAR_DOMAIN
, &is_a_field_of_this
);
1486 if
(sym || is_a_field_of_this || is_a_field
)
1487 for
(i
= 0; i
<= namelen
; i
++)
1489 if
((tokstart
[i
] >= 'a' && tokstart
[i
] <= 'z'))
1490 tokstart
[i
] -= ('a'-'A');
1493 /* Third chance Capitalized (as GPC does). */
1494 if
(!sym
&& !is_a_field_of_this
&& !is_a_field
)
1496 for
(i
= 0; i
<= namelen
; i
++)
1500 if
((tmp
[i
] >= 'a' && tmp
[i
] <= 'z'))
1501 tmp
[i
] -= ('a'-'A');
1504 if
((tmp
[i
] >= 'A' && tmp
[i
] <= 'Z'))
1505 tmp
[i
] -= ('A'-'a');
1507 if
(search_field
&& current_type
)
1508 is_a_field
= (lookup_struct_elt_type
(current_type
, tmp
, 1) != NULL
);
1512 sym
= lookup_symbol
(tmp
, expression_context_block
,
1513 VAR_DOMAIN
, &is_a_field_of_this
);
1514 if
(sym || is_a_field_of_this || is_a_field
)
1515 for
(i
= 0; i
<= namelen
; i
++)
1519 if
((tokstart
[i
] >= 'a' && tokstart
[i
] <= 'z'))
1520 tokstart
[i
] -= ('a'-'A');
1523 if
((tokstart
[i
] >= 'A' && tokstart
[i
] <= 'Z'))
1524 tokstart
[i
] -= ('A'-'a');
1530 tempbuf
= (char *) realloc
(tempbuf
, namelen
+ 1);
1531 strncpy
(tempbuf
, tokstart
, namelen
); tempbuf
[namelen
] = 0;
1532 yylval.sval.ptr
= tempbuf
;
1533 yylval.sval.length
= namelen
;
1537 /* Call lookup_symtab, not lookup_partial_symtab, in case there are
1538 no psymtabs (coff, xcoff, or some future change to blow away the
1539 psymtabs once once symbols are read). */
1540 if
((sym
&& SYMBOL_CLASS
(sym
) == LOC_BLOCK
)
1541 || lookup_symtab
(tmp
))
1543 yylval.ssym.sym
= sym
;
1544 yylval.ssym.is_a_field_of_this
= is_a_field_of_this
;
1548 if
(sym
&& SYMBOL_CLASS
(sym
) == LOC_TYPEDEF
)
1551 /* Despite the following flaw, we need to keep this code enabled.
1552 Because we can get called from check_stub_method, if we don't
1553 handle nested types then it screws many operations in any
1554 program which uses nested types. */
1555 /* In "A::x", if x is a member function of A and there happens
1556 to be a type (nested or not, since the stabs don't make that
1557 distinction) named x, then this code incorrectly thinks we
1558 are dealing with nested types rather than a member function. */
1562 struct symbol
*best_sym
;
1564 /* Look ahead to detect nested types. This probably should be
1565 done in the grammar, but trying seemed to introduce a lot
1566 of shift/reduce and reduce/reduce conflicts. It's possible
1567 that it could be done, though. Or perhaps a non-grammar, but
1568 less ad hoc, approach would work well. */
1570 /* Since we do not currently have any way of distinguishing
1571 a nested type from a non-nested one (the stabs don't tell
1572 us whether a type is nested), we just ignore the
1579 /* Skip whitespace. */
1580 while
(*p
== ' ' ||
*p
== '\t' ||
*p
== '\n')
1582 if
(*p
== ':' && p
[1] == ':')
1584 /* Skip the `::'. */
1586 /* Skip whitespace. */
1587 while
(*p
== ' ' ||
*p
== '\t' ||
*p
== '\n')
1590 while
(*p
== '_' ||
*p
== '$' ||
(*p
>= '0' && *p
<= '9')
1591 ||
(*p
>= 'a' && *p
<= 'z')
1592 ||
(*p
>= 'A' && *p
<= 'Z'))
1596 struct symbol
*cur_sym
;
1597 /* As big as the whole rest of the expression, which is
1598 at least big enough. */
1599 char *ncopy
= alloca
(strlen
(tmp
)+strlen
(namestart
)+3);
1603 memcpy
(tmp1
, tmp
, strlen
(tmp
));
1604 tmp1
+= strlen
(tmp
);
1605 memcpy
(tmp1
, "::", 2);
1607 memcpy
(tmp1
, namestart
, p
- namestart
);
1608 tmp1
[p
- namestart
] = '\0';
1609 cur_sym
= lookup_symbol
(ncopy
, expression_context_block
,
1610 VAR_DOMAIN
, (int *) NULL
);
1613 if
(SYMBOL_CLASS
(cur_sym
) == LOC_TYPEDEF
)
1631 yylval.tsym.type
= SYMBOL_TYPE
(best_sym
);
1633 yylval.tsym.type
= SYMBOL_TYPE
(sym
);
1639 = language_lookup_primitive_type_by_name
(parse_language
,
1640 parse_gdbarch
, tmp
);
1641 if
(yylval.tsym.type
!= NULL
)
1647 /* Input names that aren't symbols but ARE valid hex numbers,
1648 when the input radix permits them, can be names or numbers
1649 depending on the parse. Note we support radixes > 16 here. */
1651 && ((tokstart
[0] >= 'a' && tokstart
[0] < 'a' + input_radix
- 10)
1652 ||
(tokstart
[0] >= 'A' && tokstart
[0] < 'A' + input_radix
- 10)))
1654 YYSTYPE newlval
; /* Its value is ignored. */
1655 hextype
= parse_number
(tokstart
, namelen
, 0, &newlval
);
1658 yylval.ssym.sym
= sym
;
1659 yylval.ssym.is_a_field_of_this
= is_a_field_of_this
;
1666 /* Any other kind of symbol */
1667 yylval.ssym.sym
= sym
;
1668 yylval.ssym.is_a_field_of_this
= is_a_field_of_this
;
1678 lexptr
= prev_lexptr
;
1680 error ("A %s in expression, near `%s'.", (msg ? msg
: "error"), lexptr
);