| 1 | /* YACC parser for C expressions, for GDB. |
| 2 | Copyright (C) 1986, 1989, 1990, 1991 Free Software Foundation, Inc. |
| 3 | |
| 4 | This file is part of GDB. |
| 5 | |
| 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 2 of the License, or |
| 9 | (at your option) any later version. |
| 10 | |
| 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. |
| 15 | |
| 16 | You should have received a copy of the GNU General Public License |
| 17 | along with this program; if not, write to the Free Software |
| 18 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ |
| 19 | |
| 20 | /* Parse a C expression from text in a string, |
| 21 | and return the result as a struct expression pointer. |
| 22 | That structure contains arithmetic operations in reverse polish, |
| 23 | with constants represented by operations that are followed by special data. |
| 24 | See expression.h for the details of the format. |
| 25 | What is important here is that it can be built up sequentially |
| 26 | during the process of parsing; the lower levels of the tree always |
| 27 | come first in the result. |
| 28 | |
| 29 | Note that malloc's and realloc's in this file are transformed to |
| 30 | xmalloc and xrealloc respectively by the same sed command in the |
| 31 | makefile that remaps any other malloc/realloc inserted by the parser |
| 32 | generator. Doing this with #defines and trying to control the interaction |
| 33 | with include files (<malloc.h> and <stdlib.h> for example) just became |
| 34 | too messy, particularly when such includes can be inserted at random |
| 35 | times by the parser generator. */ |
| 36 | |
| 37 | %{ |
| 38 | |
| 39 | #include "defs.h" |
| 40 | #include "expression.h" |
| 41 | #include "parser-defs.h" |
| 42 | #include "value.h" |
| 43 | #include "language.h" |
| 44 | #include "c-lang.h" |
| 45 | |
| 46 | /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc), |
| 47 | as well as gratuitiously global symbol names, so we can have multiple |
| 48 | yacc generated parsers in gdb. Note that these are only the variables |
| 49 | produced by yacc. If other parser generators (bison, byacc, etc) produce |
| 50 | additional global names that conflict at link time, then those parser |
| 51 | generators need to be fixed instead of adding those names to this list. */ |
| 52 | |
| 53 | #define yymaxdepth c_maxdepth |
| 54 | #define yyparse c_parse |
| 55 | #define yylex c_lex |
| 56 | #define yyerror c_error |
| 57 | #define yylval c_lval |
| 58 | #define yychar c_char |
| 59 | #define yydebug c_debug |
| 60 | #define yypact c_pact |
| 61 | #define yyr1 c_r1 |
| 62 | #define yyr2 c_r2 |
| 63 | #define yydef c_def |
| 64 | #define yychk c_chk |
| 65 | #define yypgo c_pgo |
| 66 | #define yyact c_act |
| 67 | #define yyexca c_exca |
| 68 | #define yyerrflag c_errflag |
| 69 | #define yynerrs c_nerrs |
| 70 | #define yyps c_ps |
| 71 | #define yypv c_pv |
| 72 | #define yys c_s |
| 73 | #define yy_yys c_yys |
| 74 | #define yystate c_state |
| 75 | #define yytmp c_tmp |
| 76 | #define yyv c_v |
| 77 | #define yy_yyv c_yyv |
| 78 | #define yyval c_val |
| 79 | #define yylloc c_lloc |
| 80 | #define yyreds c_reds /* With YYDEBUG defined */ |
| 81 | #define yytoks c_toks /* With YYDEBUG defined */ |
| 82 | |
| 83 | #ifndef YYDEBUG |
| 84 | #define YYDEBUG 0 /* Default to no yydebug support */ |
| 85 | #endif |
| 86 | |
| 87 | int |
| 88 | yyparse PARAMS ((void)); |
| 89 | |
| 90 | static int |
| 91 | yylex PARAMS ((void)); |
| 92 | |
| 93 | void |
| 94 | yyerror PARAMS ((char *)); |
| 95 | |
| 96 | %} |
| 97 | |
| 98 | /* Although the yacc "value" of an expression is not used, |
| 99 | since the result is stored in the structure being created, |
| 100 | other node types do have values. */ |
| 101 | |
| 102 | %union |
| 103 | { |
| 104 | LONGEST lval; |
| 105 | struct { |
| 106 | LONGEST val; |
| 107 | struct type *type; |
| 108 | } typed_val; |
| 109 | double dval; |
| 110 | struct symbol *sym; |
| 111 | struct type *tval; |
| 112 | struct stoken sval; |
| 113 | struct ttype tsym; |
| 114 | struct symtoken ssym; |
| 115 | int voidval; |
| 116 | struct block *bval; |
| 117 | enum exp_opcode opcode; |
| 118 | struct internalvar *ivar; |
| 119 | |
| 120 | struct type **tvec; |
| 121 | int *ivec; |
| 122 | } |
| 123 | |
| 124 | %{ |
| 125 | /* YYSTYPE gets defined by %union */ |
| 126 | static int |
| 127 | parse_number PARAMS ((char *, int, int, YYSTYPE *)); |
| 128 | %} |
| 129 | |
| 130 | %type <voidval> exp exp1 type_exp start variable qualified_name lcurly |
| 131 | %type <lval> rcurly |
| 132 | %type <tval> type typebase |
| 133 | %type <tvec> nonempty_typelist |
| 134 | /* %type <bval> block */ |
| 135 | |
| 136 | /* Fancy type parsing. */ |
| 137 | %type <voidval> func_mod direct_abs_decl abs_decl |
| 138 | %type <tval> ptype |
| 139 | %type <lval> array_mod |
| 140 | |
| 141 | %token <typed_val> INT |
| 142 | %token <dval> FLOAT |
| 143 | |
| 144 | /* Both NAME and TYPENAME tokens represent symbols in the input, |
| 145 | and both convey their data as strings. |
| 146 | But a TYPENAME is a string that happens to be defined as a typedef |
| 147 | or builtin type name (such as int or char) |
| 148 | and a NAME is any other symbol. |
| 149 | Contexts where this distinction is not important can use the |
| 150 | nonterminal "name", which matches either NAME or TYPENAME. */ |
| 151 | |
| 152 | %token <sval> STRING |
| 153 | %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */ |
| 154 | %token <tsym> TYPENAME |
| 155 | %type <sval> name |
| 156 | %type <ssym> name_not_typename |
| 157 | %type <tsym> typename |
| 158 | |
| 159 | /* A NAME_OR_INT is a symbol which is not known in the symbol table, |
| 160 | but which would parse as a valid number in the current input radix. |
| 161 | E.g. "c" when input_radix==16. Depending on the parse, it will be |
| 162 | turned into a name or into a number. */ |
| 163 | |
| 164 | %token <ssym> NAME_OR_INT |
| 165 | |
| 166 | %token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON |
| 167 | %token TEMPLATE |
| 168 | %token ERROR |
| 169 | |
| 170 | /* Special type cases, put in to allow the parser to distinguish different |
| 171 | legal basetypes. */ |
| 172 | %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD |
| 173 | %token <lval> LAST REGNAME |
| 174 | |
| 175 | %token <ivar> VARIABLE |
| 176 | |
| 177 | %token <opcode> ASSIGN_MODIFY |
| 178 | |
| 179 | /* C++ */ |
| 180 | %token THIS |
| 181 | |
| 182 | %left ',' |
| 183 | %left ABOVE_COMMA |
| 184 | %right '=' ASSIGN_MODIFY |
| 185 | %right '?' |
| 186 | %left OROR |
| 187 | %left ANDAND |
| 188 | %left '|' |
| 189 | %left '^' |
| 190 | %left '&' |
| 191 | %left EQUAL NOTEQUAL |
| 192 | %left '<' '>' LEQ GEQ |
| 193 | %left LSH RSH |
| 194 | %left '@' |
| 195 | %left '+' '-' |
| 196 | %left '*' '/' '%' |
| 197 | %right UNARY INCREMENT DECREMENT |
| 198 | %right ARROW '.' '[' '(' |
| 199 | %token <ssym> BLOCKNAME |
| 200 | %type <bval> block |
| 201 | %left COLONCOLON |
| 202 | |
| 203 | \f |
| 204 | %% |
| 205 | |
| 206 | start : exp1 |
| 207 | | type_exp |
| 208 | ; |
| 209 | |
| 210 | type_exp: type |
| 211 | { write_exp_elt_opcode(OP_TYPE); |
| 212 | write_exp_elt_type($1); |
| 213 | write_exp_elt_opcode(OP_TYPE);} |
| 214 | ; |
| 215 | |
| 216 | /* Expressions, including the comma operator. */ |
| 217 | exp1 : exp |
| 218 | | exp1 ',' exp |
| 219 | { write_exp_elt_opcode (BINOP_COMMA); } |
| 220 | ; |
| 221 | |
| 222 | /* Expressions, not including the comma operator. */ |
| 223 | exp : '*' exp %prec UNARY |
| 224 | { write_exp_elt_opcode (UNOP_IND); } |
| 225 | |
| 226 | exp : '&' exp %prec UNARY |
| 227 | { write_exp_elt_opcode (UNOP_ADDR); } |
| 228 | |
| 229 | exp : '-' exp %prec UNARY |
| 230 | { write_exp_elt_opcode (UNOP_NEG); } |
| 231 | ; |
| 232 | |
| 233 | exp : '!' exp %prec UNARY |
| 234 | { write_exp_elt_opcode (UNOP_LOGICAL_NOT); } |
| 235 | ; |
| 236 | |
| 237 | exp : '~' exp %prec UNARY |
| 238 | { write_exp_elt_opcode (UNOP_COMPLEMENT); } |
| 239 | ; |
| 240 | |
| 241 | exp : INCREMENT exp %prec UNARY |
| 242 | { write_exp_elt_opcode (UNOP_PREINCREMENT); } |
| 243 | ; |
| 244 | |
| 245 | exp : DECREMENT exp %prec UNARY |
| 246 | { write_exp_elt_opcode (UNOP_PREDECREMENT); } |
| 247 | ; |
| 248 | |
| 249 | exp : exp INCREMENT %prec UNARY |
| 250 | { write_exp_elt_opcode (UNOP_POSTINCREMENT); } |
| 251 | ; |
| 252 | |
| 253 | exp : exp DECREMENT %prec UNARY |
| 254 | { write_exp_elt_opcode (UNOP_POSTDECREMENT); } |
| 255 | ; |
| 256 | |
| 257 | exp : SIZEOF exp %prec UNARY |
| 258 | { write_exp_elt_opcode (UNOP_SIZEOF); } |
| 259 | ; |
| 260 | |
| 261 | exp : exp ARROW name |
| 262 | { write_exp_elt_opcode (STRUCTOP_PTR); |
| 263 | write_exp_string ($3); |
| 264 | write_exp_elt_opcode (STRUCTOP_PTR); } |
| 265 | ; |
| 266 | |
| 267 | exp : exp ARROW qualified_name |
| 268 | { /* exp->type::name becomes exp->*(&type::name) */ |
| 269 | /* Note: this doesn't work if name is a |
| 270 | static member! FIXME */ |
| 271 | write_exp_elt_opcode (UNOP_ADDR); |
| 272 | write_exp_elt_opcode (STRUCTOP_MPTR); } |
| 273 | ; |
| 274 | exp : exp ARROW '*' exp |
| 275 | { write_exp_elt_opcode (STRUCTOP_MPTR); } |
| 276 | ; |
| 277 | |
| 278 | exp : exp '.' name |
| 279 | { write_exp_elt_opcode (STRUCTOP_STRUCT); |
| 280 | write_exp_string ($3); |
| 281 | write_exp_elt_opcode (STRUCTOP_STRUCT); } |
| 282 | ; |
| 283 | |
| 284 | exp : exp '.' qualified_name |
| 285 | { /* exp.type::name becomes exp.*(&type::name) */ |
| 286 | /* Note: this doesn't work if name is a |
| 287 | static member! FIXME */ |
| 288 | write_exp_elt_opcode (UNOP_ADDR); |
| 289 | write_exp_elt_opcode (STRUCTOP_MEMBER); } |
| 290 | ; |
| 291 | |
| 292 | exp : exp '.' '*' exp |
| 293 | { write_exp_elt_opcode (STRUCTOP_MEMBER); } |
| 294 | ; |
| 295 | |
| 296 | exp : exp '[' exp1 ']' |
| 297 | { write_exp_elt_opcode (BINOP_SUBSCRIPT); } |
| 298 | ; |
| 299 | |
| 300 | exp : exp '(' |
| 301 | /* This is to save the value of arglist_len |
| 302 | being accumulated by an outer function call. */ |
| 303 | { start_arglist (); } |
| 304 | arglist ')' %prec ARROW |
| 305 | { write_exp_elt_opcode (OP_FUNCALL); |
| 306 | write_exp_elt_longcst ((LONGEST) end_arglist ()); |
| 307 | write_exp_elt_opcode (OP_FUNCALL); } |
| 308 | ; |
| 309 | |
| 310 | lcurly : '{' |
| 311 | { start_arglist (); } |
| 312 | ; |
| 313 | |
| 314 | arglist : |
| 315 | ; |
| 316 | |
| 317 | arglist : exp |
| 318 | { arglist_len = 1; } |
| 319 | ; |
| 320 | |
| 321 | arglist : arglist ',' exp %prec ABOVE_COMMA |
| 322 | { arglist_len++; } |
| 323 | ; |
| 324 | |
| 325 | rcurly : '}' |
| 326 | { $$ = end_arglist () - 1; } |
| 327 | ; |
| 328 | exp : lcurly arglist rcurly %prec ARROW |
| 329 | { write_exp_elt_opcode (OP_ARRAY); |
| 330 | write_exp_elt_longcst ((LONGEST) 0); |
| 331 | write_exp_elt_longcst ((LONGEST) $3); |
| 332 | write_exp_elt_opcode (OP_ARRAY); } |
| 333 | ; |
| 334 | |
| 335 | exp : lcurly type rcurly exp %prec UNARY |
| 336 | { write_exp_elt_opcode (UNOP_MEMVAL); |
| 337 | write_exp_elt_type ($2); |
| 338 | write_exp_elt_opcode (UNOP_MEMVAL); } |
| 339 | ; |
| 340 | |
| 341 | exp : '(' type ')' exp %prec UNARY |
| 342 | { write_exp_elt_opcode (UNOP_CAST); |
| 343 | write_exp_elt_type ($2); |
| 344 | write_exp_elt_opcode (UNOP_CAST); } |
| 345 | ; |
| 346 | |
| 347 | exp : '(' exp1 ')' |
| 348 | { } |
| 349 | ; |
| 350 | |
| 351 | /* Binary operators in order of decreasing precedence. */ |
| 352 | |
| 353 | exp : exp '@' exp |
| 354 | { write_exp_elt_opcode (BINOP_REPEAT); } |
| 355 | ; |
| 356 | |
| 357 | exp : exp '*' exp |
| 358 | { write_exp_elt_opcode (BINOP_MUL); } |
| 359 | ; |
| 360 | |
| 361 | exp : exp '/' exp |
| 362 | { write_exp_elt_opcode (BINOP_DIV); } |
| 363 | ; |
| 364 | |
| 365 | exp : exp '%' exp |
| 366 | { write_exp_elt_opcode (BINOP_REM); } |
| 367 | ; |
| 368 | |
| 369 | exp : exp '+' exp |
| 370 | { write_exp_elt_opcode (BINOP_ADD); } |
| 371 | ; |
| 372 | |
| 373 | exp : exp '-' exp |
| 374 | { write_exp_elt_opcode (BINOP_SUB); } |
| 375 | ; |
| 376 | |
| 377 | exp : exp LSH exp |
| 378 | { write_exp_elt_opcode (BINOP_LSH); } |
| 379 | ; |
| 380 | |
| 381 | exp : exp RSH exp |
| 382 | { write_exp_elt_opcode (BINOP_RSH); } |
| 383 | ; |
| 384 | |
| 385 | exp : exp EQUAL exp |
| 386 | { write_exp_elt_opcode (BINOP_EQUAL); } |
| 387 | ; |
| 388 | |
| 389 | exp : exp NOTEQUAL exp |
| 390 | { write_exp_elt_opcode (BINOP_NOTEQUAL); } |
| 391 | ; |
| 392 | |
| 393 | exp : exp LEQ exp |
| 394 | { write_exp_elt_opcode (BINOP_LEQ); } |
| 395 | ; |
| 396 | |
| 397 | exp : exp GEQ exp |
| 398 | { write_exp_elt_opcode (BINOP_GEQ); } |
| 399 | ; |
| 400 | |
| 401 | exp : exp '<' exp |
| 402 | { write_exp_elt_opcode (BINOP_LESS); } |
| 403 | ; |
| 404 | |
| 405 | exp : exp '>' exp |
| 406 | { write_exp_elt_opcode (BINOP_GTR); } |
| 407 | ; |
| 408 | |
| 409 | exp : exp '&' exp |
| 410 | { write_exp_elt_opcode (BINOP_BITWISE_AND); } |
| 411 | ; |
| 412 | |
| 413 | exp : exp '^' exp |
| 414 | { write_exp_elt_opcode (BINOP_BITWISE_XOR); } |
| 415 | ; |
| 416 | |
| 417 | exp : exp '|' exp |
| 418 | { write_exp_elt_opcode (BINOP_BITWISE_IOR); } |
| 419 | ; |
| 420 | |
| 421 | exp : exp ANDAND exp |
| 422 | { write_exp_elt_opcode (BINOP_LOGICAL_AND); } |
| 423 | ; |
| 424 | |
| 425 | exp : exp OROR exp |
| 426 | { write_exp_elt_opcode (BINOP_LOGICAL_OR); } |
| 427 | ; |
| 428 | |
| 429 | exp : exp '?' exp ':' exp %prec '?' |
| 430 | { write_exp_elt_opcode (TERNOP_COND); } |
| 431 | ; |
| 432 | |
| 433 | exp : exp '=' exp |
| 434 | { write_exp_elt_opcode (BINOP_ASSIGN); } |
| 435 | ; |
| 436 | |
| 437 | exp : exp ASSIGN_MODIFY exp |
| 438 | { write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); |
| 439 | write_exp_elt_opcode ($2); |
| 440 | write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); } |
| 441 | ; |
| 442 | |
| 443 | exp : INT |
| 444 | { write_exp_elt_opcode (OP_LONG); |
| 445 | write_exp_elt_type ($1.type); |
| 446 | write_exp_elt_longcst ((LONGEST)($1.val)); |
| 447 | write_exp_elt_opcode (OP_LONG); } |
| 448 | ; |
| 449 | |
| 450 | exp : NAME_OR_INT |
| 451 | { YYSTYPE val; |
| 452 | parse_number ($1.stoken.ptr, $1.stoken.length, 0, &val); |
| 453 | write_exp_elt_opcode (OP_LONG); |
| 454 | write_exp_elt_type (val.typed_val.type); |
| 455 | write_exp_elt_longcst ((LONGEST)val.typed_val.val); |
| 456 | write_exp_elt_opcode (OP_LONG); |
| 457 | } |
| 458 | ; |
| 459 | |
| 460 | |
| 461 | exp : FLOAT |
| 462 | { write_exp_elt_opcode (OP_DOUBLE); |
| 463 | write_exp_elt_type (builtin_type_double); |
| 464 | write_exp_elt_dblcst ($1); |
| 465 | write_exp_elt_opcode (OP_DOUBLE); } |
| 466 | ; |
| 467 | |
| 468 | exp : variable |
| 469 | ; |
| 470 | |
| 471 | exp : LAST |
| 472 | { write_exp_elt_opcode (OP_LAST); |
| 473 | write_exp_elt_longcst ((LONGEST) $1); |
| 474 | write_exp_elt_opcode (OP_LAST); } |
| 475 | ; |
| 476 | |
| 477 | exp : REGNAME |
| 478 | { write_exp_elt_opcode (OP_REGISTER); |
| 479 | write_exp_elt_longcst ((LONGEST) $1); |
| 480 | write_exp_elt_opcode (OP_REGISTER); } |
| 481 | ; |
| 482 | |
| 483 | exp : VARIABLE |
| 484 | { write_exp_elt_opcode (OP_INTERNALVAR); |
| 485 | write_exp_elt_intern ($1); |
| 486 | write_exp_elt_opcode (OP_INTERNALVAR); } |
| 487 | ; |
| 488 | |
| 489 | exp : SIZEOF '(' type ')' %prec UNARY |
| 490 | { write_exp_elt_opcode (OP_LONG); |
| 491 | write_exp_elt_type (builtin_type_int); |
| 492 | write_exp_elt_longcst ((LONGEST) TYPE_LENGTH ($3)); |
| 493 | write_exp_elt_opcode (OP_LONG); } |
| 494 | ; |
| 495 | |
| 496 | exp : STRING |
| 497 | { /* C strings are converted into array constants with |
| 498 | an explicit null byte added at the end. Thus |
| 499 | the array upper bound is the string length. |
| 500 | There is no such thing in C as a completely empty |
| 501 | string. */ |
| 502 | char *sp = $1.ptr; int count = $1.length; |
| 503 | while (count-- > 0) |
| 504 | { |
| 505 | write_exp_elt_opcode (OP_LONG); |
| 506 | write_exp_elt_type (builtin_type_char); |
| 507 | write_exp_elt_longcst ((LONGEST)(*sp++)); |
| 508 | write_exp_elt_opcode (OP_LONG); |
| 509 | } |
| 510 | write_exp_elt_opcode (OP_LONG); |
| 511 | write_exp_elt_type (builtin_type_char); |
| 512 | write_exp_elt_longcst ((LONGEST)'\0'); |
| 513 | write_exp_elt_opcode (OP_LONG); |
| 514 | write_exp_elt_opcode (OP_ARRAY); |
| 515 | write_exp_elt_longcst ((LONGEST) 0); |
| 516 | write_exp_elt_longcst ((LONGEST) ($1.length)); |
| 517 | write_exp_elt_opcode (OP_ARRAY); } |
| 518 | ; |
| 519 | |
| 520 | /* C++. */ |
| 521 | exp : THIS |
| 522 | { write_exp_elt_opcode (OP_THIS); |
| 523 | write_exp_elt_opcode (OP_THIS); } |
| 524 | ; |
| 525 | |
| 526 | /* end of C++. */ |
| 527 | |
| 528 | block : BLOCKNAME |
| 529 | { |
| 530 | if ($1.sym != 0) |
| 531 | $$ = SYMBOL_BLOCK_VALUE ($1.sym); |
| 532 | else |
| 533 | { |
| 534 | struct symtab *tem = |
| 535 | lookup_symtab (copy_name ($1.stoken)); |
| 536 | if (tem) |
| 537 | $$ = BLOCKVECTOR_BLOCK |
| 538 | (BLOCKVECTOR (tem), STATIC_BLOCK); |
| 539 | else |
| 540 | error ("No file or function \"%s\".", |
| 541 | copy_name ($1.stoken)); |
| 542 | } |
| 543 | } |
| 544 | ; |
| 545 | |
| 546 | block : block COLONCOLON name |
| 547 | { struct symbol *tem |
| 548 | = lookup_symbol (copy_name ($3), $1, |
| 549 | VAR_NAMESPACE, 0, NULL); |
| 550 | if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK) |
| 551 | error ("No function \"%s\" in specified context.", |
| 552 | copy_name ($3)); |
| 553 | $$ = SYMBOL_BLOCK_VALUE (tem); } |
| 554 | ; |
| 555 | |
| 556 | variable: block COLONCOLON name |
| 557 | { struct symbol *sym; |
| 558 | sym = lookup_symbol (copy_name ($3), $1, |
| 559 | VAR_NAMESPACE, 0, NULL); |
| 560 | if (sym == 0) |
| 561 | error ("No symbol \"%s\" in specified context.", |
| 562 | copy_name ($3)); |
| 563 | |
| 564 | write_exp_elt_opcode (OP_VAR_VALUE); |
| 565 | write_exp_elt_sym (sym); |
| 566 | write_exp_elt_opcode (OP_VAR_VALUE); } |
| 567 | ; |
| 568 | |
| 569 | qualified_name: typebase COLONCOLON name |
| 570 | { |
| 571 | struct type *type = $1; |
| 572 | if (TYPE_CODE (type) != TYPE_CODE_STRUCT |
| 573 | && TYPE_CODE (type) != TYPE_CODE_UNION) |
| 574 | error ("`%s' is not defined as an aggregate type.", |
| 575 | TYPE_NAME (type)); |
| 576 | |
| 577 | write_exp_elt_opcode (OP_SCOPE); |
| 578 | write_exp_elt_type (type); |
| 579 | write_exp_string ($3); |
| 580 | write_exp_elt_opcode (OP_SCOPE); |
| 581 | } |
| 582 | | typebase COLONCOLON '~' name |
| 583 | { |
| 584 | struct type *type = $1; |
| 585 | struct stoken tmp_token; |
| 586 | if (TYPE_CODE (type) != TYPE_CODE_STRUCT |
| 587 | && TYPE_CODE (type) != TYPE_CODE_UNION) |
| 588 | error ("`%s' is not defined as an aggregate type.", |
| 589 | TYPE_NAME (type)); |
| 590 | |
| 591 | if (!STREQ (type_name_no_tag (type), $4.ptr)) |
| 592 | error ("invalid destructor `%s::~%s'", |
| 593 | type_name_no_tag (type), $4.ptr); |
| 594 | |
| 595 | tmp_token.ptr = (char*) alloca ($4.length + 2); |
| 596 | tmp_token.length = $4.length + 1; |
| 597 | tmp_token.ptr[0] = '~'; |
| 598 | memcpy (tmp_token.ptr+1, $4.ptr, $4.length); |
| 599 | tmp_token.ptr[tmp_token.length] = 0; |
| 600 | write_exp_elt_opcode (OP_SCOPE); |
| 601 | write_exp_elt_type (type); |
| 602 | write_exp_string (tmp_token); |
| 603 | write_exp_elt_opcode (OP_SCOPE); |
| 604 | } |
| 605 | ; |
| 606 | |
| 607 | variable: qualified_name |
| 608 | | COLONCOLON name |
| 609 | { |
| 610 | char *name = copy_name ($2); |
| 611 | struct symbol *sym; |
| 612 | struct minimal_symbol *msymbol; |
| 613 | |
| 614 | sym = |
| 615 | lookup_symbol (name, 0, VAR_NAMESPACE, 0, NULL); |
| 616 | if (sym) |
| 617 | { |
| 618 | write_exp_elt_opcode (OP_VAR_VALUE); |
| 619 | write_exp_elt_sym (sym); |
| 620 | write_exp_elt_opcode (OP_VAR_VALUE); |
| 621 | break; |
| 622 | } |
| 623 | |
| 624 | msymbol = lookup_minimal_symbol (name, |
| 625 | (struct objfile *) NULL); |
| 626 | if (msymbol != NULL) |
| 627 | { |
| 628 | write_exp_elt_opcode (OP_LONG); |
| 629 | write_exp_elt_type (builtin_type_int); |
| 630 | write_exp_elt_longcst ((LONGEST) SYMBOL_VALUE_ADDRESS (msymbol)); |
| 631 | write_exp_elt_opcode (OP_LONG); |
| 632 | write_exp_elt_opcode (UNOP_MEMVAL); |
| 633 | if (msymbol -> type == mst_data || |
| 634 | msymbol -> type == mst_bss) |
| 635 | write_exp_elt_type (builtin_type_int); |
| 636 | else if (msymbol -> type == mst_text) |
| 637 | write_exp_elt_type (lookup_function_type (builtin_type_int)); |
| 638 | else |
| 639 | write_exp_elt_type (builtin_type_char); |
| 640 | write_exp_elt_opcode (UNOP_MEMVAL); |
| 641 | } |
| 642 | else |
| 643 | if (!have_full_symbols () && !have_partial_symbols ()) |
| 644 | error ("No symbol table is loaded. Use the \"file\" command."); |
| 645 | else |
| 646 | error ("No symbol \"%s\" in current context.", name); |
| 647 | } |
| 648 | ; |
| 649 | |
| 650 | variable: name_not_typename |
| 651 | { struct symbol *sym = $1.sym; |
| 652 | |
| 653 | if (sym) |
| 654 | { |
| 655 | switch (SYMBOL_CLASS (sym)) |
| 656 | { |
| 657 | case LOC_REGISTER: |
| 658 | case LOC_ARG: |
| 659 | case LOC_REF_ARG: |
| 660 | case LOC_REGPARM: |
| 661 | case LOC_LOCAL: |
| 662 | case LOC_LOCAL_ARG: |
| 663 | if (innermost_block == 0 || |
| 664 | contained_in (block_found, |
| 665 | innermost_block)) |
| 666 | innermost_block = block_found; |
| 667 | case LOC_UNDEF: |
| 668 | case LOC_CONST: |
| 669 | case LOC_STATIC: |
| 670 | case LOC_TYPEDEF: |
| 671 | case LOC_LABEL: |
| 672 | case LOC_BLOCK: |
| 673 | case LOC_CONST_BYTES: |
| 674 | case LOC_OPTIMIZED_OUT: |
| 675 | |
| 676 | /* In this case the expression can |
| 677 | be evaluated regardless of what |
| 678 | frame we are in, so there is no |
| 679 | need to check for the |
| 680 | innermost_block. These cases are |
| 681 | listed so that gcc -Wall will |
| 682 | report types that may not have |
| 683 | been considered. */ |
| 684 | |
| 685 | break; |
| 686 | } |
| 687 | write_exp_elt_opcode (OP_VAR_VALUE); |
| 688 | write_exp_elt_sym (sym); |
| 689 | write_exp_elt_opcode (OP_VAR_VALUE); |
| 690 | } |
| 691 | else if ($1.is_a_field_of_this) |
| 692 | { |
| 693 | /* C++: it hangs off of `this'. Must |
| 694 | not inadvertently convert from a method call |
| 695 | to data ref. */ |
| 696 | if (innermost_block == 0 || |
| 697 | contained_in (block_found, innermost_block)) |
| 698 | innermost_block = block_found; |
| 699 | write_exp_elt_opcode (OP_THIS); |
| 700 | write_exp_elt_opcode (OP_THIS); |
| 701 | write_exp_elt_opcode (STRUCTOP_PTR); |
| 702 | write_exp_string ($1.stoken); |
| 703 | write_exp_elt_opcode (STRUCTOP_PTR); |
| 704 | } |
| 705 | else |
| 706 | { |
| 707 | struct minimal_symbol *msymbol; |
| 708 | register char *arg = copy_name ($1.stoken); |
| 709 | |
| 710 | msymbol = lookup_minimal_symbol (arg, |
| 711 | (struct objfile *) NULL); |
| 712 | if (msymbol != NULL) |
| 713 | { |
| 714 | write_exp_elt_opcode (OP_LONG); |
| 715 | write_exp_elt_type (builtin_type_int); |
| 716 | write_exp_elt_longcst ((LONGEST) SYMBOL_VALUE_ADDRESS (msymbol)); |
| 717 | write_exp_elt_opcode (OP_LONG); |
| 718 | write_exp_elt_opcode (UNOP_MEMVAL); |
| 719 | if (msymbol -> type == mst_data || |
| 720 | msymbol -> type == mst_bss) |
| 721 | write_exp_elt_type (builtin_type_int); |
| 722 | else if (msymbol -> type == mst_text) |
| 723 | write_exp_elt_type (lookup_function_type (builtin_type_int)); |
| 724 | else |
| 725 | write_exp_elt_type (builtin_type_char); |
| 726 | write_exp_elt_opcode (UNOP_MEMVAL); |
| 727 | } |
| 728 | else if (!have_full_symbols () && !have_partial_symbols ()) |
| 729 | error ("No symbol table is loaded. Use the \"file\" command."); |
| 730 | else |
| 731 | error ("No symbol \"%s\" in current context.", |
| 732 | copy_name ($1.stoken)); |
| 733 | } |
| 734 | } |
| 735 | ; |
| 736 | |
| 737 | |
| 738 | ptype : typebase |
| 739 | | typebase abs_decl |
| 740 | { |
| 741 | /* This is where the interesting stuff happens. */ |
| 742 | int done = 0; |
| 743 | int array_size; |
| 744 | struct type *follow_type = $1; |
| 745 | struct type *range_type; |
| 746 | |
| 747 | while (!done) |
| 748 | switch (pop_type ()) |
| 749 | { |
| 750 | case tp_end: |
| 751 | done = 1; |
| 752 | break; |
| 753 | case tp_pointer: |
| 754 | follow_type = lookup_pointer_type (follow_type); |
| 755 | break; |
| 756 | case tp_reference: |
| 757 | follow_type = lookup_reference_type (follow_type); |
| 758 | break; |
| 759 | case tp_array: |
| 760 | array_size = pop_type_int (); |
| 761 | if (array_size != -1) |
| 762 | { |
| 763 | range_type = |
| 764 | create_range_type ((struct type *) NULL, |
| 765 | builtin_type_int, 0, |
| 766 | array_size - 1); |
| 767 | follow_type = |
| 768 | create_array_type ((struct type *) NULL, |
| 769 | follow_type, range_type); |
| 770 | } |
| 771 | else |
| 772 | follow_type = lookup_pointer_type (follow_type); |
| 773 | break; |
| 774 | case tp_function: |
| 775 | follow_type = lookup_function_type (follow_type); |
| 776 | break; |
| 777 | } |
| 778 | $$ = follow_type; |
| 779 | } |
| 780 | ; |
| 781 | |
| 782 | abs_decl: '*' |
| 783 | { push_type (tp_pointer); $$ = 0; } |
| 784 | | '*' abs_decl |
| 785 | { push_type (tp_pointer); $$ = $2; } |
| 786 | | '&' |
| 787 | { push_type (tp_reference); $$ = 0; } |
| 788 | | '&' abs_decl |
| 789 | { push_type (tp_reference); $$ = $2; } |
| 790 | | direct_abs_decl |
| 791 | ; |
| 792 | |
| 793 | direct_abs_decl: '(' abs_decl ')' |
| 794 | { $$ = $2; } |
| 795 | | direct_abs_decl array_mod |
| 796 | { |
| 797 | push_type_int ($2); |
| 798 | push_type (tp_array); |
| 799 | } |
| 800 | | array_mod |
| 801 | { |
| 802 | push_type_int ($1); |
| 803 | push_type (tp_array); |
| 804 | $$ = 0; |
| 805 | } |
| 806 | | direct_abs_decl func_mod |
| 807 | { push_type (tp_function); } |
| 808 | | func_mod |
| 809 | { push_type (tp_function); } |
| 810 | ; |
| 811 | |
| 812 | array_mod: '[' ']' |
| 813 | { $$ = -1; } |
| 814 | | '[' INT ']' |
| 815 | { $$ = $2.val; } |
| 816 | ; |
| 817 | |
| 818 | func_mod: '(' ')' |
| 819 | { $$ = 0; } |
| 820 | | '(' nonempty_typelist ')' |
| 821 | { free ((PTR)$2); $$ = 0; } |
| 822 | ; |
| 823 | |
| 824 | type : ptype |
| 825 | | typebase COLONCOLON '*' |
| 826 | { $$ = lookup_member_type (builtin_type_int, $1); } |
| 827 | | type '(' typebase COLONCOLON '*' ')' |
| 828 | { $$ = lookup_member_type ($1, $3); } |
| 829 | | type '(' typebase COLONCOLON '*' ')' '(' ')' |
| 830 | { $$ = lookup_member_type |
| 831 | (lookup_function_type ($1), $3); } |
| 832 | | type '(' typebase COLONCOLON '*' ')' '(' nonempty_typelist ')' |
| 833 | { $$ = lookup_member_type |
| 834 | (lookup_function_type ($1), $3); |
| 835 | free ((PTR)$8); } |
| 836 | ; |
| 837 | |
| 838 | typebase /* Implements (approximately): (type-qualifier)* type-specifier */ |
| 839 | : TYPENAME |
| 840 | { $$ = $1.type; } |
| 841 | | INT_KEYWORD |
| 842 | { $$ = builtin_type_int; } |
| 843 | | LONG |
| 844 | { $$ = builtin_type_long; } |
| 845 | | SHORT |
| 846 | { $$ = builtin_type_short; } |
| 847 | | LONG INT_KEYWORD |
| 848 | { $$ = builtin_type_long; } |
| 849 | | UNSIGNED LONG INT_KEYWORD |
| 850 | { $$ = builtin_type_unsigned_long; } |
| 851 | | LONG LONG |
| 852 | { $$ = builtin_type_long_long; } |
| 853 | | LONG LONG INT_KEYWORD |
| 854 | { $$ = builtin_type_long_long; } |
| 855 | | UNSIGNED LONG LONG |
| 856 | { $$ = builtin_type_unsigned_long_long; } |
| 857 | | UNSIGNED LONG LONG INT_KEYWORD |
| 858 | { $$ = builtin_type_unsigned_long_long; } |
| 859 | | SHORT INT_KEYWORD |
| 860 | { $$ = builtin_type_short; } |
| 861 | | UNSIGNED SHORT INT_KEYWORD |
| 862 | { $$ = builtin_type_unsigned_short; } |
| 863 | | STRUCT name |
| 864 | { $$ = lookup_struct (copy_name ($2), |
| 865 | expression_context_block); } |
| 866 | | CLASS name |
| 867 | { $$ = lookup_struct (copy_name ($2), |
| 868 | expression_context_block); } |
| 869 | | UNION name |
| 870 | { $$ = lookup_union (copy_name ($2), |
| 871 | expression_context_block); } |
| 872 | | ENUM name |
| 873 | { $$ = lookup_enum (copy_name ($2), |
| 874 | expression_context_block); } |
| 875 | | UNSIGNED typename |
| 876 | { $$ = lookup_unsigned_typename (TYPE_NAME($2.type)); } |
| 877 | | UNSIGNED |
| 878 | { $$ = builtin_type_unsigned_int; } |
| 879 | | SIGNED_KEYWORD typename |
| 880 | { $$ = lookup_signed_typename (TYPE_NAME($2.type)); } |
| 881 | | SIGNED_KEYWORD |
| 882 | { $$ = builtin_type_int; } |
| 883 | | TEMPLATE name '<' type '>' |
| 884 | { $$ = lookup_template_type(copy_name($2), $4, |
| 885 | expression_context_block); |
| 886 | } |
| 887 | /* "const" and "volatile" are curently ignored. */ |
| 888 | | CONST_KEYWORD typebase { $$ = $2; } |
| 889 | | VOLATILE_KEYWORD typebase { $$ = $2; } |
| 890 | ; |
| 891 | |
| 892 | typename: TYPENAME |
| 893 | | INT_KEYWORD |
| 894 | { |
| 895 | $$.stoken.ptr = "int"; |
| 896 | $$.stoken.length = 3; |
| 897 | $$.type = builtin_type_int; |
| 898 | } |
| 899 | | LONG |
| 900 | { |
| 901 | $$.stoken.ptr = "long"; |
| 902 | $$.stoken.length = 4; |
| 903 | $$.type = builtin_type_long; |
| 904 | } |
| 905 | | SHORT |
| 906 | { |
| 907 | $$.stoken.ptr = "short"; |
| 908 | $$.stoken.length = 5; |
| 909 | $$.type = builtin_type_short; |
| 910 | } |
| 911 | ; |
| 912 | |
| 913 | nonempty_typelist |
| 914 | : type |
| 915 | { $$ = (struct type **) malloc (sizeof (struct type *) * 2); |
| 916 | $<ivec>$[0] = 1; /* Number of types in vector */ |
| 917 | $$[1] = $1; |
| 918 | } |
| 919 | | nonempty_typelist ',' type |
| 920 | { int len = sizeof (struct type *) * (++($<ivec>1[0]) + 1); |
| 921 | $$ = (struct type **) realloc ((char *) $1, len); |
| 922 | $$[$<ivec>$[0]] = $3; |
| 923 | } |
| 924 | ; |
| 925 | |
| 926 | name : NAME { $$ = $1.stoken; } |
| 927 | | BLOCKNAME { $$ = $1.stoken; } |
| 928 | | TYPENAME { $$ = $1.stoken; } |
| 929 | | NAME_OR_INT { $$ = $1.stoken; } |
| 930 | ; |
| 931 | |
| 932 | name_not_typename : NAME |
| 933 | | BLOCKNAME |
| 934 | /* These would be useful if name_not_typename was useful, but it is just |
| 935 | a fake for "variable", so these cause reduce/reduce conflicts because |
| 936 | the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable, |
| 937 | =exp) or just an exp. If name_not_typename was ever used in an lvalue |
| 938 | context where only a name could occur, this might be useful. |
| 939 | | NAME_OR_INT |
| 940 | */ |
| 941 | ; |
| 942 | |
| 943 | %% |
| 944 | |
| 945 | /* Take care of parsing a number (anything that starts with a digit). |
| 946 | Set yylval and return the token type; update lexptr. |
| 947 | LEN is the number of characters in it. */ |
| 948 | |
| 949 | /*** Needs some error checking for the float case ***/ |
| 950 | |
| 951 | static int |
| 952 | parse_number (p, len, parsed_float, putithere) |
| 953 | register char *p; |
| 954 | register int len; |
| 955 | int parsed_float; |
| 956 | YYSTYPE *putithere; |
| 957 | { |
| 958 | register LONGEST n = 0; |
| 959 | register LONGEST prevn = 0; |
| 960 | register int i; |
| 961 | register int c; |
| 962 | register int base = input_radix; |
| 963 | int unsigned_p = 0; |
| 964 | int long_p = 0; |
| 965 | unsigned LONGEST high_bit; |
| 966 | struct type *signed_type; |
| 967 | struct type *unsigned_type; |
| 968 | |
| 969 | if (parsed_float) |
| 970 | { |
| 971 | /* It's a float since it contains a point or an exponent. */ |
| 972 | putithere->dval = atof (p); |
| 973 | return FLOAT; |
| 974 | } |
| 975 | |
| 976 | /* Handle base-switching prefixes 0x, 0t, 0d, 0 */ |
| 977 | if (p[0] == '0') |
| 978 | switch (p[1]) |
| 979 | { |
| 980 | case 'x': |
| 981 | case 'X': |
| 982 | if (len >= 3) |
| 983 | { |
| 984 | p += 2; |
| 985 | base = 16; |
| 986 | len -= 2; |
| 987 | } |
| 988 | break; |
| 989 | |
| 990 | case 't': |
| 991 | case 'T': |
| 992 | case 'd': |
| 993 | case 'D': |
| 994 | if (len >= 3) |
| 995 | { |
| 996 | p += 2; |
| 997 | base = 10; |
| 998 | len -= 2; |
| 999 | } |
| 1000 | break; |
| 1001 | |
| 1002 | default: |
| 1003 | base = 8; |
| 1004 | break; |
| 1005 | } |
| 1006 | |
| 1007 | while (len-- > 0) |
| 1008 | { |
| 1009 | c = *p++; |
| 1010 | if (c >= 'A' && c <= 'Z') |
| 1011 | c += 'a' - 'A'; |
| 1012 | if (c != 'l' && c != 'u') |
| 1013 | n *= base; |
| 1014 | if (c >= '0' && c <= '9') |
| 1015 | n += i = c - '0'; |
| 1016 | else |
| 1017 | { |
| 1018 | if (base > 10 && c >= 'a' && c <= 'f') |
| 1019 | n += i = c - 'a' + 10; |
| 1020 | else if (len == 0 && c == 'l') |
| 1021 | long_p = 1; |
| 1022 | else if (len == 0 && c == 'u') |
| 1023 | unsigned_p = 1; |
| 1024 | else |
| 1025 | return ERROR; /* Char not a digit */ |
| 1026 | } |
| 1027 | if (i >= base) |
| 1028 | return ERROR; /* Invalid digit in this base */ |
| 1029 | |
| 1030 | /* Portably test for overflow (only works for nonzero values, so make |
| 1031 | a second check for zero). */ |
| 1032 | if((prevn >= n) && n != 0) |
| 1033 | unsigned_p=1; /* Try something unsigned */ |
| 1034 | /* If range checking enabled, portably test for unsigned overflow. */ |
| 1035 | if(RANGE_CHECK && n!=0) |
| 1036 | { |
| 1037 | if((unsigned_p && (unsigned)prevn >= (unsigned)n)) |
| 1038 | range_error("Overflow on numeric constant."); |
| 1039 | } |
| 1040 | prevn=n; |
| 1041 | } |
| 1042 | |
| 1043 | /* If the number is too big to be an int, or it's got an l suffix |
| 1044 | then it's a long. Work out if this has to be a long by |
| 1045 | shifting right and and seeing if anything remains, and the |
| 1046 | target int size is different to the target long size. |
| 1047 | |
| 1048 | In the expression below, we could have tested |
| 1049 | (n >> TARGET_INT_BIT) |
| 1050 | to see if it was zero, |
| 1051 | but too many compilers warn about that, when ints and longs |
| 1052 | are the same size. So we shift it twice, with fewer bits |
| 1053 | each time, for the same result. */ |
| 1054 | |
| 1055 | if ( (TARGET_INT_BIT != TARGET_LONG_BIT |
| 1056 | && ((n >> 2) >> (TARGET_INT_BIT-2))) /* Avoid shift warning */ |
| 1057 | || long_p) |
| 1058 | { |
| 1059 | high_bit = ((unsigned LONGEST)1) << (TARGET_LONG_BIT-1); |
| 1060 | unsigned_type = builtin_type_unsigned_long; |
| 1061 | signed_type = builtin_type_long; |
| 1062 | } |
| 1063 | else |
| 1064 | { |
| 1065 | high_bit = ((unsigned LONGEST)1) << (TARGET_INT_BIT-1); |
| 1066 | unsigned_type = builtin_type_unsigned_int; |
| 1067 | signed_type = builtin_type_int; |
| 1068 | } |
| 1069 | |
| 1070 | putithere->typed_val.val = n; |
| 1071 | |
| 1072 | /* If the high bit of the worked out type is set then this number |
| 1073 | has to be unsigned. */ |
| 1074 | |
| 1075 | if (unsigned_p || (n & high_bit)) |
| 1076 | { |
| 1077 | putithere->typed_val.type = unsigned_type; |
| 1078 | } |
| 1079 | else |
| 1080 | { |
| 1081 | putithere->typed_val.type = signed_type; |
| 1082 | } |
| 1083 | |
| 1084 | return INT; |
| 1085 | } |
| 1086 | |
| 1087 | struct token |
| 1088 | { |
| 1089 | char *operator; |
| 1090 | int token; |
| 1091 | enum exp_opcode opcode; |
| 1092 | }; |
| 1093 | |
| 1094 | static const struct token tokentab3[] = |
| 1095 | { |
| 1096 | {">>=", ASSIGN_MODIFY, BINOP_RSH}, |
| 1097 | {"<<=", ASSIGN_MODIFY, BINOP_LSH} |
| 1098 | }; |
| 1099 | |
| 1100 | static const struct token tokentab2[] = |
| 1101 | { |
| 1102 | {"+=", ASSIGN_MODIFY, BINOP_ADD}, |
| 1103 | {"-=", ASSIGN_MODIFY, BINOP_SUB}, |
| 1104 | {"*=", ASSIGN_MODIFY, BINOP_MUL}, |
| 1105 | {"/=", ASSIGN_MODIFY, BINOP_DIV}, |
| 1106 | {"%=", ASSIGN_MODIFY, BINOP_REM}, |
| 1107 | {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR}, |
| 1108 | {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND}, |
| 1109 | {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR}, |
| 1110 | {"++", INCREMENT, BINOP_END}, |
| 1111 | {"--", DECREMENT, BINOP_END}, |
| 1112 | {"->", ARROW, BINOP_END}, |
| 1113 | {"&&", ANDAND, BINOP_END}, |
| 1114 | {"||", OROR, BINOP_END}, |
| 1115 | {"::", COLONCOLON, BINOP_END}, |
| 1116 | {"<<", LSH, BINOP_END}, |
| 1117 | {">>", RSH, BINOP_END}, |
| 1118 | {"==", EQUAL, BINOP_END}, |
| 1119 | {"!=", NOTEQUAL, BINOP_END}, |
| 1120 | {"<=", LEQ, BINOP_END}, |
| 1121 | {">=", GEQ, BINOP_END} |
| 1122 | }; |
| 1123 | |
| 1124 | /* Read one token, getting characters through lexptr. */ |
| 1125 | |
| 1126 | static int |
| 1127 | yylex () |
| 1128 | { |
| 1129 | int c; |
| 1130 | int namelen; |
| 1131 | unsigned int i; |
| 1132 | char *tokstart; |
| 1133 | char *tokptr; |
| 1134 | int tempbufindex; |
| 1135 | static char *tempbuf; |
| 1136 | static int tempbufsize; |
| 1137 | |
| 1138 | retry: |
| 1139 | |
| 1140 | tokstart = lexptr; |
| 1141 | /* See if it is a special token of length 3. */ |
| 1142 | for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++) |
| 1143 | if (STREQN (tokstart, tokentab3[i].operator, 3)) |
| 1144 | { |
| 1145 | lexptr += 3; |
| 1146 | yylval.opcode = tokentab3[i].opcode; |
| 1147 | return tokentab3[i].token; |
| 1148 | } |
| 1149 | |
| 1150 | /* See if it is a special token of length 2. */ |
| 1151 | for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++) |
| 1152 | if (STREQN (tokstart, tokentab2[i].operator, 2)) |
| 1153 | { |
| 1154 | lexptr += 2; |
| 1155 | yylval.opcode = tokentab2[i].opcode; |
| 1156 | return tokentab2[i].token; |
| 1157 | } |
| 1158 | |
| 1159 | switch (c = *tokstart) |
| 1160 | { |
| 1161 | case 0: |
| 1162 | return 0; |
| 1163 | |
| 1164 | case ' ': |
| 1165 | case '\t': |
| 1166 | case '\n': |
| 1167 | lexptr++; |
| 1168 | goto retry; |
| 1169 | |
| 1170 | case '\'': |
| 1171 | /* We either have a character constant ('0' or '\177' for example) |
| 1172 | or we have a quoted symbol reference ('foo(int,int)' in C++ |
| 1173 | for example). */ |
| 1174 | lexptr++; |
| 1175 | c = *lexptr++; |
| 1176 | if (c == '\\') |
| 1177 | c = parse_escape (&lexptr); |
| 1178 | |
| 1179 | yylval.typed_val.val = c; |
| 1180 | yylval.typed_val.type = builtin_type_char; |
| 1181 | |
| 1182 | c = *lexptr++; |
| 1183 | if (c != '\'') |
| 1184 | { |
| 1185 | namelen = skip_quoted (tokstart) - tokstart; |
| 1186 | if (namelen > 2) |
| 1187 | { |
| 1188 | lexptr = tokstart + namelen; |
| 1189 | if (lexptr[-1] != '\'') |
| 1190 | error ("Unmatched single quote."); |
| 1191 | namelen -= 2; |
| 1192 | tokstart++; |
| 1193 | goto tryname; |
| 1194 | } |
| 1195 | error ("Invalid character constant."); |
| 1196 | } |
| 1197 | return INT; |
| 1198 | |
| 1199 | case '(': |
| 1200 | paren_depth++; |
| 1201 | lexptr++; |
| 1202 | return c; |
| 1203 | |
| 1204 | case ')': |
| 1205 | if (paren_depth == 0) |
| 1206 | return 0; |
| 1207 | paren_depth--; |
| 1208 | lexptr++; |
| 1209 | return c; |
| 1210 | |
| 1211 | case ',': |
| 1212 | if (comma_terminates && paren_depth == 0) |
| 1213 | return 0; |
| 1214 | lexptr++; |
| 1215 | return c; |
| 1216 | |
| 1217 | case '.': |
| 1218 | /* Might be a floating point number. */ |
| 1219 | if (lexptr[1] < '0' || lexptr[1] > '9') |
| 1220 | goto symbol; /* Nope, must be a symbol. */ |
| 1221 | /* FALL THRU into number case. */ |
| 1222 | |
| 1223 | case '0': |
| 1224 | case '1': |
| 1225 | case '2': |
| 1226 | case '3': |
| 1227 | case '4': |
| 1228 | case '5': |
| 1229 | case '6': |
| 1230 | case '7': |
| 1231 | case '8': |
| 1232 | case '9': |
| 1233 | { |
| 1234 | /* It's a number. */ |
| 1235 | int got_dot = 0, got_e = 0, toktype; |
| 1236 | register char *p = tokstart; |
| 1237 | int hex = input_radix > 10; |
| 1238 | |
| 1239 | if (c == '0' && (p[1] == 'x' || p[1] == 'X')) |
| 1240 | { |
| 1241 | p += 2; |
| 1242 | hex = 1; |
| 1243 | } |
| 1244 | else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D')) |
| 1245 | { |
| 1246 | p += 2; |
| 1247 | hex = 0; |
| 1248 | } |
| 1249 | |
| 1250 | for (;; ++p) |
| 1251 | { |
| 1252 | /* This test includes !hex because 'e' is a valid hex digit |
| 1253 | and thus does not indicate a floating point number when |
| 1254 | the radix is hex. */ |
| 1255 | if (!hex && !got_e && (*p == 'e' || *p == 'E')) |
| 1256 | got_dot = got_e = 1; |
| 1257 | /* This test does not include !hex, because a '.' always indicates |
| 1258 | a decimal floating point number regardless of the radix. */ |
| 1259 | else if (!got_dot && *p == '.') |
| 1260 | got_dot = 1; |
| 1261 | else if (got_e && (p[-1] == 'e' || p[-1] == 'E') |
| 1262 | && (*p == '-' || *p == '+')) |
| 1263 | /* This is the sign of the exponent, not the end of the |
| 1264 | number. */ |
| 1265 | continue; |
| 1266 | /* We will take any letters or digits. parse_number will |
| 1267 | complain if past the radix, or if L or U are not final. */ |
| 1268 | else if ((*p < '0' || *p > '9') |
| 1269 | && ((*p < 'a' || *p > 'z') |
| 1270 | && (*p < 'A' || *p > 'Z'))) |
| 1271 | break; |
| 1272 | } |
| 1273 | toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval); |
| 1274 | if (toktype == ERROR) |
| 1275 | { |
| 1276 | char *err_copy = (char *) alloca (p - tokstart + 1); |
| 1277 | |
| 1278 | memcpy (err_copy, tokstart, p - tokstart); |
| 1279 | err_copy[p - tokstart] = 0; |
| 1280 | error ("Invalid number \"%s\".", err_copy); |
| 1281 | } |
| 1282 | lexptr = p; |
| 1283 | return toktype; |
| 1284 | } |
| 1285 | |
| 1286 | case '+': |
| 1287 | case '-': |
| 1288 | case '*': |
| 1289 | case '/': |
| 1290 | case '%': |
| 1291 | case '|': |
| 1292 | case '&': |
| 1293 | case '^': |
| 1294 | case '~': |
| 1295 | case '!': |
| 1296 | case '@': |
| 1297 | case '<': |
| 1298 | case '>': |
| 1299 | case '[': |
| 1300 | case ']': |
| 1301 | case '?': |
| 1302 | case ':': |
| 1303 | case '=': |
| 1304 | case '{': |
| 1305 | case '}': |
| 1306 | symbol: |
| 1307 | lexptr++; |
| 1308 | return c; |
| 1309 | |
| 1310 | case '"': |
| 1311 | |
| 1312 | /* Build the gdb internal form of the input string in tempbuf, |
| 1313 | translating any standard C escape forms seen. Note that the |
| 1314 | buffer is null byte terminated *only* for the convenience of |
| 1315 | debugging gdb itself and printing the buffer contents when |
| 1316 | the buffer contains no embedded nulls. Gdb does not depend |
| 1317 | upon the buffer being null byte terminated, it uses the length |
| 1318 | string instead. This allows gdb to handle C strings (as well |
| 1319 | as strings in other languages) with embedded null bytes */ |
| 1320 | |
| 1321 | tokptr = ++tokstart; |
| 1322 | tempbufindex = 0; |
| 1323 | |
| 1324 | do { |
| 1325 | /* Grow the static temp buffer if necessary, including allocating |
| 1326 | the first one on demand. */ |
| 1327 | if (tempbufindex + 1 >= tempbufsize) |
| 1328 | { |
| 1329 | tempbuf = (char *) realloc (tempbuf, tempbufsize += 64); |
| 1330 | } |
| 1331 | switch (*tokptr) |
| 1332 | { |
| 1333 | case '\0': |
| 1334 | case '"': |
| 1335 | /* Do nothing, loop will terminate. */ |
| 1336 | break; |
| 1337 | case '\\': |
| 1338 | tokptr++; |
| 1339 | c = parse_escape (&tokptr); |
| 1340 | if (c == -1) |
| 1341 | { |
| 1342 | continue; |
| 1343 | } |
| 1344 | tempbuf[tempbufindex++] = c; |
| 1345 | break; |
| 1346 | default: |
| 1347 | tempbuf[tempbufindex++] = *tokptr++; |
| 1348 | break; |
| 1349 | } |
| 1350 | } while ((*tokptr != '"') && (*tokptr != '\0')); |
| 1351 | if (*tokptr++ != '"') |
| 1352 | { |
| 1353 | error ("Unterminated string in expression."); |
| 1354 | } |
| 1355 | tempbuf[tempbufindex] = '\0'; /* See note above */ |
| 1356 | yylval.sval.ptr = tempbuf; |
| 1357 | yylval.sval.length = tempbufindex; |
| 1358 | lexptr = tokptr; |
| 1359 | return (STRING); |
| 1360 | } |
| 1361 | |
| 1362 | if (!(c == '_' || c == '$' |
| 1363 | || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))) |
| 1364 | /* We must have come across a bad character (e.g. ';'). */ |
| 1365 | error ("Invalid character '%c' in expression.", c); |
| 1366 | |
| 1367 | /* It's a name. See how long it is. */ |
| 1368 | namelen = 0; |
| 1369 | for (c = tokstart[namelen]; |
| 1370 | (c == '_' || c == '$' || (c >= '0' && c <= '9') |
| 1371 | || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')); |
| 1372 | c = tokstart[++namelen]) |
| 1373 | ; |
| 1374 | |
| 1375 | /* The token "if" terminates the expression and is NOT |
| 1376 | removed from the input stream. */ |
| 1377 | if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f') |
| 1378 | { |
| 1379 | return 0; |
| 1380 | } |
| 1381 | |
| 1382 | lexptr += namelen; |
| 1383 | |
| 1384 | /* Handle the tokens $digits; also $ (short for $0) and $$ (short for $$1) |
| 1385 | and $$digits (equivalent to $<-digits> if you could type that). |
| 1386 | Make token type LAST, and put the number (the digits) in yylval. */ |
| 1387 | |
| 1388 | tryname: |
| 1389 | if (*tokstart == '$') |
| 1390 | { |
| 1391 | register int negate = 0; |
| 1392 | c = 1; |
| 1393 | /* Double dollar means negate the number and add -1 as well. |
| 1394 | Thus $$ alone means -1. */ |
| 1395 | if (namelen >= 2 && tokstart[1] == '$') |
| 1396 | { |
| 1397 | negate = 1; |
| 1398 | c = 2; |
| 1399 | } |
| 1400 | if (c == namelen) |
| 1401 | { |
| 1402 | /* Just dollars (one or two) */ |
| 1403 | yylval.lval = - negate; |
| 1404 | return LAST; |
| 1405 | } |
| 1406 | /* Is the rest of the token digits? */ |
| 1407 | for (; c < namelen; c++) |
| 1408 | if (!(tokstart[c] >= '0' && tokstart[c] <= '9')) |
| 1409 | break; |
| 1410 | if (c == namelen) |
| 1411 | { |
| 1412 | yylval.lval = atoi (tokstart + 1 + negate); |
| 1413 | if (negate) |
| 1414 | yylval.lval = - yylval.lval; |
| 1415 | return LAST; |
| 1416 | } |
| 1417 | } |
| 1418 | |
| 1419 | /* Handle tokens that refer to machine registers: |
| 1420 | $ followed by a register name. */ |
| 1421 | |
| 1422 | if (*tokstart == '$') { |
| 1423 | for (c = 0; c < NUM_REGS; c++) |
| 1424 | if (namelen - 1 == strlen (reg_names[c]) |
| 1425 | && STREQN (tokstart + 1, reg_names[c], namelen - 1)) |
| 1426 | { |
| 1427 | yylval.lval = c; |
| 1428 | return REGNAME; |
| 1429 | } |
| 1430 | for (c = 0; c < num_std_regs; c++) |
| 1431 | if (namelen - 1 == strlen (std_regs[c].name) |
| 1432 | && STREQN (tokstart + 1, std_regs[c].name, namelen - 1)) |
| 1433 | { |
| 1434 | yylval.lval = std_regs[c].regnum; |
| 1435 | return REGNAME; |
| 1436 | } |
| 1437 | } |
| 1438 | /* Catch specific keywords. Should be done with a data structure. */ |
| 1439 | switch (namelen) |
| 1440 | { |
| 1441 | case 8: |
| 1442 | if (STREQN (tokstart, "unsigned", 8)) |
| 1443 | return UNSIGNED; |
| 1444 | if (current_language->la_language == language_cplus |
| 1445 | && STREQN (tokstart, "template", 8)) |
| 1446 | return TEMPLATE; |
| 1447 | if (STREQN (tokstart, "volatile", 8)) |
| 1448 | return VOLATILE_KEYWORD; |
| 1449 | break; |
| 1450 | case 6: |
| 1451 | if (STREQN (tokstart, "struct", 6)) |
| 1452 | return STRUCT; |
| 1453 | if (STREQN (tokstart, "signed", 6)) |
| 1454 | return SIGNED_KEYWORD; |
| 1455 | if (STREQN (tokstart, "sizeof", 6)) |
| 1456 | return SIZEOF; |
| 1457 | break; |
| 1458 | case 5: |
| 1459 | if (current_language->la_language == language_cplus |
| 1460 | && STREQN (tokstart, "class", 5)) |
| 1461 | return CLASS; |
| 1462 | if (STREQN (tokstart, "union", 5)) |
| 1463 | return UNION; |
| 1464 | if (STREQN (tokstart, "short", 5)) |
| 1465 | return SHORT; |
| 1466 | if (STREQN (tokstart, "const", 5)) |
| 1467 | return CONST_KEYWORD; |
| 1468 | break; |
| 1469 | case 4: |
| 1470 | if (STREQN (tokstart, "enum", 4)) |
| 1471 | return ENUM; |
| 1472 | if (STREQN (tokstart, "long", 4)) |
| 1473 | return LONG; |
| 1474 | if (current_language->la_language == language_cplus |
| 1475 | && STREQN (tokstart, "this", 4)) |
| 1476 | { |
| 1477 | static const char this_name[] = |
| 1478 | { CPLUS_MARKER, 't', 'h', 'i', 's', '\0' }; |
| 1479 | |
| 1480 | if (lookup_symbol (this_name, expression_context_block, |
| 1481 | VAR_NAMESPACE, 0, NULL)) |
| 1482 | return THIS; |
| 1483 | } |
| 1484 | break; |
| 1485 | case 3: |
| 1486 | if (STREQN (tokstart, "int", 3)) |
| 1487 | return INT_KEYWORD; |
| 1488 | break; |
| 1489 | default: |
| 1490 | break; |
| 1491 | } |
| 1492 | |
| 1493 | yylval.sval.ptr = tokstart; |
| 1494 | yylval.sval.length = namelen; |
| 1495 | |
| 1496 | /* Any other names starting in $ are debugger internal variables. */ |
| 1497 | |
| 1498 | if (*tokstart == '$') |
| 1499 | { |
| 1500 | yylval.ivar = lookup_internalvar (copy_name (yylval.sval) + 1); |
| 1501 | return VARIABLE; |
| 1502 | } |
| 1503 | |
| 1504 | /* Use token-type BLOCKNAME for symbols that happen to be defined as |
| 1505 | functions or symtabs. If this is not so, then ... |
| 1506 | Use token-type TYPENAME for symbols that happen to be defined |
| 1507 | currently as names of types; NAME for other symbols. |
| 1508 | The caller is not constrained to care about the distinction. */ |
| 1509 | { |
| 1510 | char *tmp = copy_name (yylval.sval); |
| 1511 | struct symbol *sym; |
| 1512 | int is_a_field_of_this = 0; |
| 1513 | int hextype; |
| 1514 | |
| 1515 | sym = lookup_symbol (tmp, expression_context_block, |
| 1516 | VAR_NAMESPACE, |
| 1517 | current_language->la_language == language_cplus |
| 1518 | ? &is_a_field_of_this : NULL, |
| 1519 | NULL); |
| 1520 | if ((sym && SYMBOL_CLASS (sym) == LOC_BLOCK) || |
| 1521 | lookup_partial_symtab (tmp)) |
| 1522 | { |
| 1523 | yylval.ssym.sym = sym; |
| 1524 | yylval.ssym.is_a_field_of_this = is_a_field_of_this; |
| 1525 | return BLOCKNAME; |
| 1526 | } |
| 1527 | if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF) |
| 1528 | { |
| 1529 | yylval.tsym.type = SYMBOL_TYPE (sym); |
| 1530 | return TYPENAME; |
| 1531 | } |
| 1532 | if ((yylval.tsym.type = lookup_primitive_typename (tmp)) != 0) |
| 1533 | return TYPENAME; |
| 1534 | |
| 1535 | /* Input names that aren't symbols but ARE valid hex numbers, |
| 1536 | when the input radix permits them, can be names or numbers |
| 1537 | depending on the parse. Note we support radixes > 16 here. */ |
| 1538 | if (!sym && |
| 1539 | ((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10) || |
| 1540 | (tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10))) |
| 1541 | { |
| 1542 | YYSTYPE newlval; /* Its value is ignored. */ |
| 1543 | hextype = parse_number (tokstart, namelen, 0, &newlval); |
| 1544 | if (hextype == INT) |
| 1545 | { |
| 1546 | yylval.ssym.sym = sym; |
| 1547 | yylval.ssym.is_a_field_of_this = is_a_field_of_this; |
| 1548 | return NAME_OR_INT; |
| 1549 | } |
| 1550 | } |
| 1551 | |
| 1552 | /* Any other kind of symbol */ |
| 1553 | yylval.ssym.sym = sym; |
| 1554 | yylval.ssym.is_a_field_of_this = is_a_field_of_this; |
| 1555 | return NAME; |
| 1556 | } |
| 1557 | } |
| 1558 | |
| 1559 | void |
| 1560 | yyerror (msg) |
| 1561 | char *msg; |
| 1562 | { |
| 1563 | error (msg ? msg : "Invalid syntax in expression."); |
| 1564 | } |