1 /* YACC parser for Java expressions, for GDB.
2 Copyright 1997, 1998, 1999, 2000
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 Java 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. Well, almost always; see ArrayAccess.
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. */
41 #include "gdb_string.h"
43 #include "expression.h"
45 #include "parser-defs.h"
48 #include "bfd.h" /* Required by objfiles.h. */
49 #include "symfile.h" /* Required by objfiles.h. */
50 #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */
51 #include "completer.h" /* For skip_quoted(). */
53 /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc),
54 as well as gratuitiously global symbol names, so we can have multiple
55 yacc generated parsers in gdb. Note that these are only the variables
56 produced by yacc. If other parser generators (bison, byacc, etc) produce
57 additional global names that conflict at link time, then those parser
58 generators need to be fixed instead of adding those names to this list. */
60 #define yymaxdepth java_maxdepth
61 #define yyparse java_parse
62 #define yylex java_lex
63 #define yyerror java_error
64 #define yylval java_lval
65 #define yychar java_char
66 #define yydebug java_debug
67 #define yypact java_pact
70 #define yydef java_def
71 #define yychk java_chk
72 #define yypgo java_pgo
73 #define yyact java_act
74 #define yyexca java_exca
75 #define yyerrflag java_errflag
76 #define yynerrs java_nerrs
80 #define yy_yys java_yys
81 #define yystate java_state
82 #define yytmp java_tmp
84 #define yy_yyv java_yyv
85 #define yyval java_val
86 #define yylloc java_lloc
87 #define yyreds java_reds /* With YYDEBUG defined */
88 #define yytoks java_toks /* With YYDEBUG defined */
89 #define yyname java_name /* With YYDEBUG defined */
90 #define yyrule java_rule /* With YYDEBUG defined */
91 #define yylhs java_yylhs
92 #define yylen java_yylen
93 #define yydefred java_yydefred
94 #define yydgoto java_yydgoto
95 #define yysindex java_yysindex
96 #define yyrindex java_yyrindex
97 #define yygindex java_yygindex
98 #define yytable java_yytable
99 #define yycheck java_yycheck
102 #define YYDEBUG 1 /* Default to yydebug support */
105 #define YYFPRINTF parser_fprintf
109 static int yylex (void);
111 void yyerror (char *);
113 static struct type *java_type_from_name (struct stoken);
114 static void push_expression_name (struct stoken);
115 static void push_fieldnames (struct stoken);
117 static struct expression *copy_exp (struct expression *, int);
118 static void insert_exp (int, struct expression *);
122 /* Although the yacc "value" of an expression is not used,
123 since the result is stored in the structure being created,
124 other node types do have values. */
141 struct symtoken ssym;
143 enum exp_opcode opcode;
144 struct internalvar *ivar;
149 /* YYSTYPE gets defined by %union */
150 static int parse_number (char *, int, int, YYSTYPE *);
153 %type <lval> rcurly Dims Dims_opt
154 %type <tval> ClassOrInterfaceType ClassType /* ReferenceType Type ArrayType */
155 %type <tval> IntegralType FloatingPointType NumericType PrimitiveType ArrayType PrimitiveOrArrayType
157 %token <typed_val_int> INTEGER_LITERAL
158 %token <typed_val_float> FLOATING_POINT_LITERAL
160 %token <sval> IDENTIFIER
161 %token <sval> STRING_LITERAL
162 %token <lval> BOOLEAN_LITERAL
163 %token <tsym> TYPENAME
164 %type <sval> Name SimpleName QualifiedName ForcedName
166 /* A NAME_OR_INT is a symbol which is not known in the symbol table,
167 but which would parse as a valid number in the current input radix.
168 E.g. "c" when input_radix==16. Depending on the parse, it will be
169 turned into a name or into a number. */
171 %token <sval> NAME_OR_INT
175 /* Special type cases, put in to allow the parser to distinguish different
177 %token LONG SHORT BYTE INT CHAR BOOLEAN DOUBLE FLOAT
181 %token <opcode> ASSIGN_MODIFY
183 %token THIS SUPER NEW
186 %right '=' ASSIGN_MODIFY
194 %left '<' '>' LEQ GEQ
198 %right INCREMENT DECREMENT
208 type_exp: PrimitiveOrArrayType
210 write_exp_elt_opcode(OP_TYPE);
211 write_exp_elt_type($1);
212 write_exp_elt_opcode(OP_TYPE);
216 PrimitiveOrArrayType:
224 write_exp_elt_opcode (OP_STRING);
225 write_exp_string ($1);
226 write_exp_elt_opcode (OP_STRING);
232 { write_exp_elt_opcode (OP_LONG);
233 write_exp_elt_type ($1.type);
234 write_exp_elt_longcst ((LONGEST)($1.val));
235 write_exp_elt_opcode (OP_LONG); }
238 parse_number ($1.ptr, $1.length, 0, &val);
239 write_exp_elt_opcode (OP_LONG);
240 write_exp_elt_type (val.typed_val_int.type);
241 write_exp_elt_longcst ((LONGEST)val.typed_val_int.val);
242 write_exp_elt_opcode (OP_LONG);
244 | FLOATING_POINT_LITERAL
245 { write_exp_elt_opcode (OP_DOUBLE);
246 write_exp_elt_type ($1.type);
247 write_exp_elt_dblcst ($1.dval);
248 write_exp_elt_opcode (OP_DOUBLE); }
250 { write_exp_elt_opcode (OP_LONG);
251 write_exp_elt_type (java_boolean_type);
252 write_exp_elt_longcst ((LONGEST)$1);
253 write_exp_elt_opcode (OP_LONG); }
267 { $$ = java_boolean_type; }
277 { $$ = java_byte_type; }
279 { $$ = java_short_type; }
281 { $$ = java_int_type; }
283 { $$ = java_long_type; }
285 { $$ = java_char_type; }
290 { $$ = java_float_type; }
292 { $$ = java_double_type; }
302 ClassOrInterfaceType:
304 { $$ = java_type_from_name ($1); }
313 { $$ = java_array_type ($1, $2); }
315 { $$ = java_array_type (java_type_from_name ($1), $2); }
335 { $$.length = $1.length + $3.length + 1;
336 if ($1.ptr + $1.length + 1 == $3.ptr
337 && $1.ptr[$1.length] == '.')
338 $$.ptr = $1.ptr; /* Optimization. */
341 $$.ptr = (char *) malloc ($$.length + 1);
342 make_cleanup (free, $$.ptr);
343 sprintf ($$.ptr, "%.*s.%.*s",
344 $1.length, $1.ptr, $3.length, $3.ptr);
350 { write_exp_elt_opcode(OP_TYPE);
351 write_exp_elt_type($1);
352 write_exp_elt_opcode(OP_TYPE);}
356 /* Expressions, including the comma operator. */
358 | exp1 ',' Expression
359 { write_exp_elt_opcode (BINOP_COMMA); }
364 | ArrayCreationExpression
370 { write_exp_elt_opcode (OP_THIS);
371 write_exp_elt_opcode (OP_THIS); }
373 | ClassInstanceCreationExpression
377 | lcurly ArgumentList rcurly
378 { write_exp_elt_opcode (OP_ARRAY);
379 write_exp_elt_longcst ((LONGEST) 0);
380 write_exp_elt_longcst ((LONGEST) $3);
381 write_exp_elt_opcode (OP_ARRAY); }
386 { start_arglist (); }
391 { $$ = end_arglist () - 1; }
394 ClassInstanceCreationExpression:
395 NEW ClassType '(' ArgumentList_opt ')'
396 { internal_error (__FILE__, __LINE__,
397 _("FIXME - ClassInstanceCreationExpression")); }
403 | ArgumentList ',' Expression
413 ArrayCreationExpression:
414 NEW PrimitiveType DimExprs Dims_opt
415 { internal_error (__FILE__, __LINE__,
416 _("FIXME - ArrayCreationExpression")); }
417 | NEW ClassOrInterfaceType DimExprs Dims_opt
418 { internal_error (__FILE__, __LINE__,
419 _("FIXME - ArrayCreationExpression")); }
445 Primary '.' SimpleName
446 { push_fieldnames ($3); }
447 | VARIABLE '.' SimpleName
448 { push_fieldnames ($3); }
449 /*| SUPER '.' SimpleName { FIXME } */
453 Name '(' ArgumentList_opt ')'
454 { error (_("Method invocation not implemented")); }
455 | Primary '.' SimpleName '(' ArgumentList_opt ')'
456 { error (_("Method invocation not implemented")); }
457 | SUPER '.' SimpleName '(' ArgumentList_opt ')'
458 { error (_("Method invocation not implemented")); }
462 Name '[' Expression ']'
464 /* Emit code for the Name now, then exchange it in the
465 expout array with the Expression's code. We could
466 introduce a OP_SWAP code or a reversed version of
467 BINOP_SUBSCRIPT, but that makes the rest of GDB pay
468 for our parsing kludges. */
469 struct expression *name_expr;
471 push_expression_name ($1);
472 name_expr = copy_exp (expout, expout_ptr);
473 expout_ptr -= name_expr->nelts;
474 insert_exp (expout_ptr-length_of_subexp (expout, expout_ptr),
477 write_exp_elt_opcode (BINOP_SUBSCRIPT);
479 | VARIABLE '[' Expression ']'
480 { write_exp_elt_opcode (BINOP_SUBSCRIPT); }
481 | PrimaryNoNewArray '[' Expression ']'
482 { write_exp_elt_opcode (BINOP_SUBSCRIPT); }
488 { push_expression_name ($1); }
490 /* Already written by write_dollar_variable. */
491 | PostIncrementExpression
492 | PostDecrementExpression
495 PostIncrementExpression:
496 PostfixExpression INCREMENT
497 { write_exp_elt_opcode (UNOP_POSTINCREMENT); }
500 PostDecrementExpression:
501 PostfixExpression DECREMENT
502 { write_exp_elt_opcode (UNOP_POSTDECREMENT); }
506 PreIncrementExpression
507 | PreDecrementExpression
508 | '+' UnaryExpression
509 | '-' UnaryExpression
510 { write_exp_elt_opcode (UNOP_NEG); }
511 | '*' UnaryExpression
512 { write_exp_elt_opcode (UNOP_IND); } /*FIXME not in Java */
513 | UnaryExpressionNotPlusMinus
516 PreIncrementExpression:
517 INCREMENT UnaryExpression
518 { write_exp_elt_opcode (UNOP_PREINCREMENT); }
521 PreDecrementExpression:
522 DECREMENT UnaryExpression
523 { write_exp_elt_opcode (UNOP_PREDECREMENT); }
526 UnaryExpressionNotPlusMinus:
528 | '~' UnaryExpression
529 { write_exp_elt_opcode (UNOP_COMPLEMENT); }
530 | '!' UnaryExpression
531 { write_exp_elt_opcode (UNOP_LOGICAL_NOT); }
536 '(' PrimitiveType Dims_opt ')' UnaryExpression
537 { write_exp_elt_opcode (UNOP_CAST);
538 write_exp_elt_type (java_array_type ($2, $3));
539 write_exp_elt_opcode (UNOP_CAST); }
540 | '(' Expression ')' UnaryExpressionNotPlusMinus
542 int exp_size = expout_ptr;
543 int last_exp_size = length_of_subexp(expout, expout_ptr);
546 int base = expout_ptr - last_exp_size - 3;
547 if (base < 0 || expout->elts[base+2].opcode != OP_TYPE)
548 error (_("Invalid cast expression"));
549 type = expout->elts[base+1].type;
550 /* Remove the 'Expression' and slide the
551 UnaryExpressionNotPlusMinus down to replace it. */
552 for (i = 0; i < last_exp_size; i++)
553 expout->elts[base + i] = expout->elts[base + i + 3];
555 if (TYPE_CODE (type) == TYPE_CODE_STRUCT)
556 type = lookup_pointer_type (type);
557 write_exp_elt_opcode (UNOP_CAST);
558 write_exp_elt_type (type);
559 write_exp_elt_opcode (UNOP_CAST);
561 | '(' Name Dims ')' UnaryExpressionNotPlusMinus
562 { write_exp_elt_opcode (UNOP_CAST);
563 write_exp_elt_type (java_array_type (java_type_from_name ($2), $3));
564 write_exp_elt_opcode (UNOP_CAST); }
568 MultiplicativeExpression:
570 | MultiplicativeExpression '*' UnaryExpression
571 { write_exp_elt_opcode (BINOP_MUL); }
572 | MultiplicativeExpression '/' UnaryExpression
573 { write_exp_elt_opcode (BINOP_DIV); }
574 | MultiplicativeExpression '%' UnaryExpression
575 { write_exp_elt_opcode (BINOP_REM); }
579 MultiplicativeExpression
580 | AdditiveExpression '+' MultiplicativeExpression
581 { write_exp_elt_opcode (BINOP_ADD); }
582 | AdditiveExpression '-' MultiplicativeExpression
583 { write_exp_elt_opcode (BINOP_SUB); }
588 | ShiftExpression LSH AdditiveExpression
589 { write_exp_elt_opcode (BINOP_LSH); }
590 | ShiftExpression RSH AdditiveExpression
591 { write_exp_elt_opcode (BINOP_RSH); }
592 /* | ShiftExpression >>> AdditiveExpression { FIXME } */
595 RelationalExpression:
597 | RelationalExpression '<' ShiftExpression
598 { write_exp_elt_opcode (BINOP_LESS); }
599 | RelationalExpression '>' ShiftExpression
600 { write_exp_elt_opcode (BINOP_GTR); }
601 | RelationalExpression LEQ ShiftExpression
602 { write_exp_elt_opcode (BINOP_LEQ); }
603 | RelationalExpression GEQ ShiftExpression
604 { write_exp_elt_opcode (BINOP_GEQ); }
605 /* | RelationalExpresion INSTANCEOF ReferenceType { FIXME } */
610 | EqualityExpression EQUAL RelationalExpression
611 { write_exp_elt_opcode (BINOP_EQUAL); }
612 | EqualityExpression NOTEQUAL RelationalExpression
613 { write_exp_elt_opcode (BINOP_NOTEQUAL); }
618 | AndExpression '&' EqualityExpression
619 { write_exp_elt_opcode (BINOP_BITWISE_AND); }
622 ExclusiveOrExpression:
624 | ExclusiveOrExpression '^' AndExpression
625 { write_exp_elt_opcode (BINOP_BITWISE_XOR); }
627 InclusiveOrExpression:
628 ExclusiveOrExpression
629 | InclusiveOrExpression '|' ExclusiveOrExpression
630 { write_exp_elt_opcode (BINOP_BITWISE_IOR); }
633 ConditionalAndExpression:
634 InclusiveOrExpression
635 | ConditionalAndExpression ANDAND InclusiveOrExpression
636 { write_exp_elt_opcode (BINOP_LOGICAL_AND); }
639 ConditionalOrExpression:
640 ConditionalAndExpression
641 | ConditionalOrExpression OROR ConditionalAndExpression
642 { write_exp_elt_opcode (BINOP_LOGICAL_OR); }
645 ConditionalExpression:
646 ConditionalOrExpression
647 | ConditionalOrExpression '?' Expression ':' ConditionalExpression
648 { write_exp_elt_opcode (TERNOP_COND); }
651 AssignmentExpression:
652 ConditionalExpression
657 LeftHandSide '=' ConditionalExpression
658 { write_exp_elt_opcode (BINOP_ASSIGN); }
659 | LeftHandSide ASSIGN_MODIFY ConditionalExpression
660 { write_exp_elt_opcode (BINOP_ASSIGN_MODIFY);
661 write_exp_elt_opcode ($2);
662 write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); }
667 { push_expression_name ($1); }
669 /* Already written by write_dollar_variable. */
680 /* Take care of parsing a number (anything that starts with a digit).
681 Set yylval and return the token type; update lexptr.
682 LEN is the number of characters in it. */
684 /*** Needs some error checking for the float case ***/
687 parse_number (p, len, parsed_float, putithere)
693 register ULONGEST n = 0;
694 ULONGEST limit, limit_div_base;
697 register int base = input_radix;
703 /* It's a float since it contains a point or an exponent. */
705 int num = 0; /* number of tokens scanned by scanf */
706 char saved_char = p[len];
708 p[len] = 0; /* null-terminate the token */
709 if (sizeof (putithere->typed_val_float.dval) <= sizeof (float))
710 num = sscanf (p, "%g%c", (float *) &putithere->typed_val_float.dval, &c);
711 else if (sizeof (putithere->typed_val_float.dval) <= sizeof (double))
712 num = sscanf (p, "%lg%c", (double *) &putithere->typed_val_float.dval, &c);
715 #ifdef SCANF_HAS_LONG_DOUBLE
716 num = sscanf (p, "%Lg%c", &putithere->typed_val_float.dval, &c);
718 /* Scan it into a double, then assign it to the long double.
719 This at least wins with values representable in the range
722 num = sscanf (p, "%lg%c", &temp, &c);
723 putithere->typed_val_float.dval = temp;
726 p[len] = saved_char; /* restore the input stream */
727 if (num != 1) /* check scanf found ONLY a float ... */
729 /* See if it has `f' or `d' suffix (float or double). */
731 c = tolower (p[len - 1]);
733 if (c == 'f' || c == 'F')
734 putithere->typed_val_float.type = builtin_type_float;
735 else if (isdigit (c) || c == '.' || c == 'd' || c == 'D')
736 putithere->typed_val_float.type = builtin_type_double;
740 return FLOATING_POINT_LITERAL;
743 /* Handle base-switching prefixes 0x, 0t, 0d, 0 */
775 /* A paranoid calculation of (1<<64)-1. */
776 limit = (ULONGEST)0xffffffff;
777 limit = ((limit << 16) << 16) | limit;
778 if (c == 'l' || c == 'L')
780 type = java_long_type;
785 type = java_int_type;
787 limit_div_base = limit / (ULONGEST) base;
792 if (c >= '0' && c <= '9')
794 else if (c >= 'A' && c <= 'Z')
796 else if (c >= 'a' && c <= 'z')
799 return ERROR; /* Char not a digit */
802 if (n > limit_div_base
803 || (n *= base) > limit - c)
804 error (_("Numeric constant too large"));
808 /* If the type is bigger than a 32-bit signed integer can be, implicitly
809 promote to long. Java does not do this, so mark it as builtin_type_uint64
810 rather than java_long_type. 0x80000000 will become -0x80000000 instead
811 of 0x80000000L, because we don't know the sign at this point.
813 if (type == java_int_type && n > (ULONGEST)0x80000000)
814 type = builtin_type_uint64;
816 putithere->typed_val_int.val = n;
817 putithere->typed_val_int.type = type;
819 return INTEGER_LITERAL;
826 enum exp_opcode opcode;
829 static const struct token tokentab3[] =
831 {">>=", ASSIGN_MODIFY, BINOP_RSH},
832 {"<<=", ASSIGN_MODIFY, BINOP_LSH}
835 static const struct token tokentab2[] =
837 {"+=", ASSIGN_MODIFY, BINOP_ADD},
838 {"-=", ASSIGN_MODIFY, BINOP_SUB},
839 {"*=", ASSIGN_MODIFY, BINOP_MUL},
840 {"/=", ASSIGN_MODIFY, BINOP_DIV},
841 {"%=", ASSIGN_MODIFY, BINOP_REM},
842 {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR},
843 {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND},
844 {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR},
845 {"++", INCREMENT, BINOP_END},
846 {"--", DECREMENT, BINOP_END},
847 {"&&", ANDAND, BINOP_END},
848 {"||", OROR, BINOP_END},
849 {"<<", LSH, BINOP_END},
850 {">>", RSH, BINOP_END},
851 {"==", EQUAL, BINOP_END},
852 {"!=", NOTEQUAL, BINOP_END},
853 {"<=", LEQ, BINOP_END},
854 {">=", GEQ, BINOP_END}
857 /* Read one token, getting characters through lexptr. */
868 static char *tempbuf;
869 static int tempbufsize;
873 prev_lexptr = lexptr;
876 /* See if it is a special token of length 3. */
877 for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++)
878 if (STREQN (tokstart, tokentab3[i].operator, 3))
881 yylval.opcode = tokentab3[i].opcode;
882 return tokentab3[i].token;
885 /* See if it is a special token of length 2. */
886 for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++)
887 if (STREQN (tokstart, tokentab2[i].operator, 2))
890 yylval.opcode = tokentab2[i].opcode;
891 return tokentab2[i].token;
894 switch (c = *tokstart)
906 /* We either have a character constant ('0' or '\177' for example)
907 or we have a quoted symbol reference ('foo(int,int)' in C++
912 c = parse_escape (&lexptr);
914 error (_("Empty character constant"));
916 yylval.typed_val_int.val = c;
917 yylval.typed_val_int.type = java_char_type;
922 namelen = skip_quoted (tokstart) - tokstart;
925 lexptr = tokstart + namelen;
926 if (lexptr[-1] != '\'')
927 error (_("Unmatched single quote"));
932 error (_("Invalid character constant"));
934 return INTEGER_LITERAL;
942 if (paren_depth == 0)
949 if (comma_terminates && paren_depth == 0)
955 /* Might be a floating point number. */
956 if (lexptr[1] < '0' || lexptr[1] > '9')
957 goto symbol; /* Nope, must be a symbol. */
958 /* FALL THRU into number case. */
972 int got_dot = 0, got_e = 0, toktype;
973 register char *p = tokstart;
974 int hex = input_radix > 10;
976 if (c == '0' && (p[1] == 'x' || p[1] == 'X'))
981 else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D'))
989 /* This test includes !hex because 'e' is a valid hex digit
990 and thus does not indicate a floating point number when
992 if (!hex && !got_e && (*p == 'e' || *p == 'E'))
994 /* This test does not include !hex, because a '.' always indicates
995 a decimal floating point number regardless of the radix. */
996 else if (!got_dot && *p == '.')
998 else if (got_e && (p[-1] == 'e' || p[-1] == 'E')
999 && (*p == '-' || *p == '+'))
1000 /* This is the sign of the exponent, not the end of the
1003 /* We will take any letters or digits. parse_number will
1004 complain if past the radix, or if L or U are not final. */
1005 else if ((*p < '0' || *p > '9')
1006 && ((*p < 'a' || *p > 'z')
1007 && (*p < 'A' || *p > 'Z')))
1010 toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval);
1011 if (toktype == ERROR)
1013 char *err_copy = (char *) alloca (p - tokstart + 1);
1015 memcpy (err_copy, tokstart, p - tokstart);
1016 err_copy[p - tokstart] = 0;
1017 error (_("Invalid number \"%s\""), err_copy);
1048 /* Build the gdb internal form of the input string in tempbuf,
1049 translating any standard C escape forms seen. Note that the
1050 buffer is null byte terminated *only* for the convenience of
1051 debugging gdb itself and printing the buffer contents when
1052 the buffer contains no embedded nulls. Gdb does not depend
1053 upon the buffer being null byte terminated, it uses the length
1054 string instead. This allows gdb to handle C strings (as well
1055 as strings in other languages) with embedded null bytes */
1057 tokptr = ++tokstart;
1061 /* Grow the static temp buffer if necessary, including allocating
1062 the first one on demand. */
1063 if (tempbufindex + 1 >= tempbufsize)
1065 tempbuf = (char *) realloc (tempbuf, tempbufsize += 64);
1071 /* Do nothing, loop will terminate. */
1075 c = parse_escape (&tokptr);
1080 tempbuf[tempbufindex++] = c;
1083 tempbuf[tempbufindex++] = *tokptr++;
1086 } while ((*tokptr != '"') && (*tokptr != '\0'));
1087 if (*tokptr++ != '"')
1089 error (_("Unterminated string in expression"));
1091 tempbuf[tempbufindex] = '\0'; /* See note above */
1092 yylval.sval.ptr = tempbuf;
1093 yylval.sval.length = tempbufindex;
1095 return (STRING_LITERAL);
1098 if (!(c == '_' || c == '$'
1099 || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')))
1100 /* We must have come across a bad character (e.g. ';'). */
1101 error (_("Invalid character '%c' in expression"), c);
1103 /* It's a name. See how long it is. */
1105 for (c = tokstart[namelen];
1108 || (c >= '0' && c <= '9')
1109 || (c >= 'a' && c <= 'z')
1110 || (c >= 'A' && c <= 'Z')
1117 while (tokstart[++i] && tokstart[i] != '>');
1118 if (tokstart[i] == '>')
1121 c = tokstart[++namelen];
1124 /* The token "if" terminates the expression and is NOT
1125 removed from the input stream. */
1126 if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f')
1135 /* Catch specific keywords. Should be done with a data structure. */
1139 if (STREQN (tokstart, "boolean", 7))
1143 if (STREQN (tokstart, "double", 6))
1147 if (STREQN (tokstart, "short", 5))
1149 if (STREQN (tokstart, "false", 5))
1152 return BOOLEAN_LITERAL;
1154 if (STREQN (tokstart, "super", 5))
1156 if (STREQN (tokstart, "float", 5))
1160 if (STREQN (tokstart, "long", 4))
1162 if (STREQN (tokstart, "byte", 4))
1164 if (STREQN (tokstart, "char", 4))
1166 if (STREQN (tokstart, "true", 4))
1169 return BOOLEAN_LITERAL;
1171 if (current_language->la_language == language_cplus
1172 && STREQN (tokstart, "this", 4))
1174 static const char this_name[] =
1175 { CPLUS_MARKER, 't', 'h', 'i', 's', '\0' };
1177 if (lookup_symbol (this_name, expression_context_block,
1178 VAR_NAMESPACE, (int *) NULL,
1179 (struct symtab **) NULL))
1184 if (STREQN (tokstart, "int", 3))
1186 if (STREQN (tokstart, "new", 3))
1193 yylval.sval.ptr = tokstart;
1194 yylval.sval.length = namelen;
1196 if (*tokstart == '$')
1198 write_dollar_variable (yylval.sval);
1202 /* Input names that aren't symbols but ARE valid hex numbers,
1203 when the input radix permits them, can be names or numbers
1204 depending on the parse. Note we support radixes > 16 here. */
1205 if (((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10) ||
1206 (tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10)))
1208 YYSTYPE newlval; /* Its value is ignored. */
1209 int hextype = parse_number (tokstart, namelen, 0, &newlval);
1210 if (hextype == INTEGER_LITERAL)
1221 lexptr = prev_lexptr;
1224 error (_("%s: near `%s'"), msg, lexptr);
1226 error (_("error in expression, near `%s'"), lexptr);
1229 static struct type *
1230 java_type_from_name (name)
1234 char *tmp = copy_name (name);
1235 struct type *typ = java_lookup_class (tmp);
1236 if (typ == NULL || TYPE_CODE (typ) != TYPE_CODE_STRUCT)
1237 error (_("No class named `%s'"), tmp);
1241 /* If NAME is a valid variable name in this scope, push it and return 1.
1242 Otherwise, return 0. */
1245 push_variable (name)
1249 char *tmp = copy_name (name);
1250 int is_a_field_of_this = 0;
1252 sym = lookup_symbol (tmp, expression_context_block, VAR_NAMESPACE,
1253 &is_a_field_of_this, (struct symtab **) NULL);
1254 if (sym && SYMBOL_CLASS (sym) != LOC_TYPEDEF)
1256 if (symbol_read_needs_frame (sym))
1258 if (innermost_block == 0 ||
1259 contained_in (block_found, innermost_block))
1260 innermost_block = block_found;
1263 write_exp_elt_opcode (OP_VAR_VALUE);
1264 /* We want to use the selected frame, not another more inner frame
1265 which happens to be in the same block. */
1266 write_exp_elt_block (NULL);
1267 write_exp_elt_sym (sym);
1268 write_exp_elt_opcode (OP_VAR_VALUE);
1271 if (is_a_field_of_this)
1273 /* it hangs off of `this'. Must not inadvertently convert from a
1274 method call to data ref. */
1275 if (innermost_block == 0 ||
1276 contained_in (block_found, innermost_block))
1277 innermost_block = block_found;
1278 write_exp_elt_opcode (OP_THIS);
1279 write_exp_elt_opcode (OP_THIS);
1280 write_exp_elt_opcode (STRUCTOP_PTR);
1281 write_exp_string (name);
1282 write_exp_elt_opcode (STRUCTOP_PTR);
1288 /* Assuming a reference expression has been pushed, emit the
1289 STRUCTOP_STRUCT ops to access the field named NAME. If NAME is a
1290 qualified name (has '.'), generate a field access for each part. */
1293 push_fieldnames (name)
1297 struct stoken token;
1298 token.ptr = name.ptr;
1301 if (i == name.length || name.ptr[i] == '.')
1303 /* token.ptr is start of current field name. */
1304 token.length = &name.ptr[i] - token.ptr;
1305 write_exp_elt_opcode (STRUCTOP_STRUCT);
1306 write_exp_string (token);
1307 write_exp_elt_opcode (STRUCTOP_STRUCT);
1308 token.ptr += token.length + 1;
1310 if (i >= name.length)
1315 /* Helper routine for push_expression_name.
1316 Handle a qualified name, where DOT_INDEX is the index of the first '.' */
1319 push_qualified_expression_name (name, dot_index)
1323 struct stoken token;
1327 token.ptr = name.ptr;
1328 token.length = dot_index;
1330 if (push_variable (token))
1332 token.ptr = name.ptr + dot_index + 1;
1333 token.length = name.length - dot_index - 1;
1334 push_fieldnames (token);
1338 token.ptr = name.ptr;
1341 token.length = dot_index;
1342 tmp = copy_name (token);
1343 typ = java_lookup_class (tmp);
1346 if (dot_index == name.length)
1348 write_exp_elt_opcode(OP_TYPE);
1349 write_exp_elt_type(typ);
1350 write_exp_elt_opcode(OP_TYPE);
1353 dot_index++; /* Skip '.' */
1354 name.ptr += dot_index;
1355 name.length -= dot_index;
1357 while (dot_index < name.length && name.ptr[dot_index] != '.')
1359 token.ptr = name.ptr;
1360 token.length = dot_index;
1361 write_exp_elt_opcode (OP_SCOPE);
1362 write_exp_elt_type (typ);
1363 write_exp_string (token);
1364 write_exp_elt_opcode (OP_SCOPE);
1365 if (dot_index < name.length)
1368 name.ptr += dot_index;
1369 name.length -= dot_index;
1370 push_fieldnames (name);
1374 else if (dot_index >= name.length)
1376 dot_index++; /* Skip '.' */
1377 while (dot_index < name.length && name.ptr[dot_index] != '.')
1380 error (_("unknown type `%.*s'"), name.length, name.ptr);
1383 /* Handle Name in an expression (or LHS).
1384 Handle VAR, TYPE, TYPE.FIELD1....FIELDN and VAR.FIELD1....FIELDN. */
1387 push_expression_name (name)
1395 for (i = 0; i < name.length; i++)
1397 if (name.ptr[i] == '.')
1399 /* It's a Qualified Expression Name. */
1400 push_qualified_expression_name (name, i);
1405 /* It's a Simple Expression Name. */
1407 if (push_variable (name))
1409 tmp = copy_name (name);
1410 typ = java_lookup_class (tmp);
1413 write_exp_elt_opcode(OP_TYPE);
1414 write_exp_elt_type(typ);
1415 write_exp_elt_opcode(OP_TYPE);
1419 struct minimal_symbol *msymbol;
1421 msymbol = lookup_minimal_symbol (tmp, NULL, NULL);
1422 if (msymbol != NULL)
1424 write_exp_msymbol (msymbol,
1425 lookup_function_type (builtin_type_int),
1428 else if (!have_full_symbols () && !have_partial_symbols ())
1429 error (_("No symbol table is loaded. Use the \"file\" command"));
1431 error (_("No symbol \"%s\" in current context"), tmp);
1437 /* The following two routines, copy_exp and insert_exp, aren't specific to
1438 Java, so they could go in parse.c, but their only purpose is to support
1439 the parsing kludges we use in this file, so maybe it's best to isolate
1442 /* Copy the expression whose last element is at index ENDPOS - 1 in EXPR
1443 into a freshly malloc'ed struct expression. Its language_defn is set
1445 static struct expression *
1446 copy_exp (expr, endpos)
1447 struct expression *expr;
1450 int len = length_of_subexp (expr, endpos);
1451 struct expression *new
1452 = (struct expression *) malloc (sizeof (*new) + EXP_ELEM_TO_BYTES (len));
1454 memcpy (new->elts, expr->elts + endpos - len, EXP_ELEM_TO_BYTES (len));
1455 new->language_defn = 0;
1460 /* Insert the expression NEW into the current expression (expout) at POS. */
1462 insert_exp (pos, new)
1464 struct expression *new;
1466 int newlen = new->nelts;
1468 /* Grow expout if necessary. In this function's only use at present,
1469 this should never be necessary. */
1470 if (expout_ptr + newlen > expout_size)
1472 expout_size = max (expout_size * 2, expout_ptr + newlen + 10);
1473 expout = (struct expression *)
1474 realloc ((char *) expout, (sizeof (struct expression)
1475 + EXP_ELEM_TO_BYTES (expout_size)));
1481 for (i = expout_ptr - 1; i >= pos; i--)
1482 expout->elts[i + newlen] = expout->elts[i];
1485 memcpy (expout->elts + pos, new->elts, EXP_ELEM_TO_BYTES (newlen));
1486 expout_ptr += newlen;