| 1 | /* YACC parser for C expressions, for GDB. |
| 2 | Copyright (C) 1986-2015 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 3 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, see <http://www.gnu.org/licenses/>. */ |
| 18 | |
| 19 | /* Parse a C expression from text in a string, |
| 20 | and return the result as a struct expression pointer. |
| 21 | That structure contains arithmetic operations in reverse polish, |
| 22 | with constants represented by operations that are followed by special data. |
| 23 | See expression.h for the details of the format. |
| 24 | What is important here is that it can be built up sequentially |
| 25 | during the process of parsing; the lower levels of the tree always |
| 26 | come first in the result. |
| 27 | |
| 28 | Note that malloc's and realloc's in this file are transformed to |
| 29 | xmalloc and xrealloc respectively by the same sed command in the |
| 30 | makefile that remaps any other malloc/realloc inserted by the parser |
| 31 | generator. Doing this with #defines and trying to control the interaction |
| 32 | with include files (<malloc.h> and <stdlib.h> for example) just became |
| 33 | too messy, particularly when such includes can be inserted at random |
| 34 | times by the parser generator. */ |
| 35 | |
| 36 | %{ |
| 37 | |
| 38 | #include "defs.h" |
| 39 | #include <ctype.h> |
| 40 | #include "expression.h" |
| 41 | #include "value.h" |
| 42 | #include "parser-defs.h" |
| 43 | #include "language.h" |
| 44 | #include "c-lang.h" |
| 45 | #include "bfd.h" /* Required by objfiles.h. */ |
| 46 | #include "symfile.h" /* Required by objfiles.h. */ |
| 47 | #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */ |
| 48 | #include "charset.h" |
| 49 | #include "block.h" |
| 50 | #include "cp-support.h" |
| 51 | #include "dfp.h" |
| 52 | #include "macroscope.h" |
| 53 | #include "objc-lang.h" |
| 54 | #include "typeprint.h" |
| 55 | #include "cp-abi.h" |
| 56 | |
| 57 | #define parse_type(ps) builtin_type (parse_gdbarch (ps)) |
| 58 | |
| 59 | /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc), |
| 60 | as well as gratuitiously global symbol names, so we can have multiple |
| 61 | yacc generated parsers in gdb. Note that these are only the variables |
| 62 | produced by yacc. If other parser generators (bison, byacc, etc) produce |
| 63 | additional global names that conflict at link time, then those parser |
| 64 | generators need to be fixed instead of adding those names to this list. */ |
| 65 | |
| 66 | #define yymaxdepth c_maxdepth |
| 67 | #define yyparse c_parse_internal |
| 68 | #define yylex c_lex |
| 69 | #define yyerror c_error |
| 70 | #define yylval c_lval |
| 71 | #define yychar c_char |
| 72 | #define yydebug c_debug |
| 73 | #define yypact c_pact |
| 74 | #define yyr1 c_r1 |
| 75 | #define yyr2 c_r2 |
| 76 | #define yydef c_def |
| 77 | #define yychk c_chk |
| 78 | #define yypgo c_pgo |
| 79 | #define yyact c_act |
| 80 | #define yyexca c_exca |
| 81 | #define yyerrflag c_errflag |
| 82 | #define yynerrs c_nerrs |
| 83 | #define yyps c_ps |
| 84 | #define yypv c_pv |
| 85 | #define yys c_s |
| 86 | #define yy_yys c_yys |
| 87 | #define yystate c_state |
| 88 | #define yytmp c_tmp |
| 89 | #define yyv c_v |
| 90 | #define yy_yyv c_yyv |
| 91 | #define yyval c_val |
| 92 | #define yylloc c_lloc |
| 93 | #define yyreds c_reds /* With YYDEBUG defined */ |
| 94 | #define yytoks c_toks /* With YYDEBUG defined */ |
| 95 | #define yyname c_name /* With YYDEBUG defined */ |
| 96 | #define yyrule c_rule /* With YYDEBUG defined */ |
| 97 | #define yylhs c_yylhs |
| 98 | #define yylen c_yylen |
| 99 | #define yydefred c_yydefred |
| 100 | #define yydgoto c_yydgoto |
| 101 | #define yysindex c_yysindex |
| 102 | #define yyrindex c_yyrindex |
| 103 | #define yygindex c_yygindex |
| 104 | #define yytable c_yytable |
| 105 | #define yycheck c_yycheck |
| 106 | #define yyss c_yyss |
| 107 | #define yysslim c_yysslim |
| 108 | #define yyssp c_yyssp |
| 109 | #define yystacksize c_yystacksize |
| 110 | #define yyvs c_yyvs |
| 111 | #define yyvsp c_yyvsp |
| 112 | |
| 113 | #ifndef YYDEBUG |
| 114 | #define YYDEBUG 1 /* Default to yydebug support */ |
| 115 | #endif |
| 116 | |
| 117 | #define YYFPRINTF parser_fprintf |
| 118 | |
| 119 | /* The state of the parser, used internally when we are parsing the |
| 120 | expression. */ |
| 121 | |
| 122 | static struct parser_state *pstate = NULL; |
| 123 | |
| 124 | int yyparse (void); |
| 125 | |
| 126 | static int yylex (void); |
| 127 | |
| 128 | void yyerror (char *); |
| 129 | |
| 130 | static int type_aggregate_p (struct type *); |
| 131 | |
| 132 | %} |
| 133 | |
| 134 | /* Although the yacc "value" of an expression is not used, |
| 135 | since the result is stored in the structure being created, |
| 136 | other node types do have values. */ |
| 137 | |
| 138 | %union |
| 139 | { |
| 140 | LONGEST lval; |
| 141 | struct { |
| 142 | LONGEST val; |
| 143 | struct type *type; |
| 144 | } typed_val_int; |
| 145 | struct { |
| 146 | DOUBLEST dval; |
| 147 | struct type *type; |
| 148 | } typed_val_float; |
| 149 | struct { |
| 150 | gdb_byte val[16]; |
| 151 | struct type *type; |
| 152 | } typed_val_decfloat; |
| 153 | struct type *tval; |
| 154 | struct stoken sval; |
| 155 | struct typed_stoken tsval; |
| 156 | struct ttype tsym; |
| 157 | struct symtoken ssym; |
| 158 | int voidval; |
| 159 | const struct block *bval; |
| 160 | enum exp_opcode opcode; |
| 161 | |
| 162 | struct stoken_vector svec; |
| 163 | VEC (type_ptr) *tvec; |
| 164 | |
| 165 | struct type_stack *type_stack; |
| 166 | |
| 167 | struct objc_class_str theclass; |
| 168 | } |
| 169 | |
| 170 | %{ |
| 171 | /* YYSTYPE gets defined by %union */ |
| 172 | static int parse_number (struct parser_state *par_state, |
| 173 | const char *, int, int, YYSTYPE *); |
| 174 | static struct stoken operator_stoken (const char *); |
| 175 | static void check_parameter_typelist (VEC (type_ptr) *); |
| 176 | static void write_destructor_name (struct parser_state *par_state, |
| 177 | struct stoken); |
| 178 | |
| 179 | #ifdef YYBISON |
| 180 | static void c_print_token (FILE *file, int type, YYSTYPE value); |
| 181 | #define YYPRINT(FILE, TYPE, VALUE) c_print_token (FILE, TYPE, VALUE) |
| 182 | #endif |
| 183 | %} |
| 184 | |
| 185 | %type <voidval> exp exp1 type_exp start variable qualified_name lcurly |
| 186 | %type <lval> rcurly |
| 187 | %type <tval> type typebase |
| 188 | %type <tvec> nonempty_typelist func_mod parameter_typelist |
| 189 | /* %type <bval> block */ |
| 190 | |
| 191 | /* Fancy type parsing. */ |
| 192 | %type <tval> ptype |
| 193 | %type <lval> array_mod |
| 194 | %type <tval> conversion_type_id |
| 195 | |
| 196 | %type <type_stack> ptr_operator_ts abs_decl direct_abs_decl |
| 197 | |
| 198 | %token <typed_val_int> INT |
| 199 | %token <typed_val_float> FLOAT |
| 200 | %token <typed_val_decfloat> DECFLOAT |
| 201 | |
| 202 | /* Both NAME and TYPENAME tokens represent symbols in the input, |
| 203 | and both convey their data as strings. |
| 204 | But a TYPENAME is a string that happens to be defined as a typedef |
| 205 | or builtin type name (such as int or char) |
| 206 | and a NAME is any other symbol. |
| 207 | Contexts where this distinction is not important can use the |
| 208 | nonterminal "name", which matches either NAME or TYPENAME. */ |
| 209 | |
| 210 | %token <tsval> STRING |
| 211 | %token <sval> NSSTRING /* ObjC Foundation "NSString" literal */ |
| 212 | %token SELECTOR /* ObjC "@selector" pseudo-operator */ |
| 213 | %token <tsval> CHAR |
| 214 | %token <ssym> NAME /* BLOCKNAME defined below to give it higher precedence. */ |
| 215 | %token <ssym> UNKNOWN_CPP_NAME |
| 216 | %token <voidval> COMPLETE |
| 217 | %token <tsym> TYPENAME |
| 218 | %token <theclass> CLASSNAME /* ObjC Class name */ |
| 219 | %type <sval> name |
| 220 | %type <svec> string_exp |
| 221 | %type <ssym> name_not_typename |
| 222 | %type <tsym> type_name |
| 223 | |
| 224 | /* This is like a '[' token, but is only generated when parsing |
| 225 | Objective C. This lets us reuse the same parser without |
| 226 | erroneously parsing ObjC-specific expressions in C. */ |
| 227 | %token OBJC_LBRAC |
| 228 | |
| 229 | /* A NAME_OR_INT is a symbol which is not known in the symbol table, |
| 230 | but which would parse as a valid number in the current input radix. |
| 231 | E.g. "c" when input_radix==16. Depending on the parse, it will be |
| 232 | turned into a name or into a number. */ |
| 233 | |
| 234 | %token <ssym> NAME_OR_INT |
| 235 | |
| 236 | %token OPERATOR |
| 237 | %token STRUCT CLASS UNION ENUM SIZEOF UNSIGNED COLONCOLON |
| 238 | %token TEMPLATE |
| 239 | %token ERROR |
| 240 | %token NEW DELETE |
| 241 | %type <sval> oper |
| 242 | %token REINTERPRET_CAST DYNAMIC_CAST STATIC_CAST CONST_CAST |
| 243 | %token ENTRY |
| 244 | %token TYPEOF |
| 245 | %token DECLTYPE |
| 246 | %token TYPEID |
| 247 | |
| 248 | /* Special type cases, put in to allow the parser to distinguish different |
| 249 | legal basetypes. */ |
| 250 | %token SIGNED_KEYWORD LONG SHORT INT_KEYWORD CONST_KEYWORD VOLATILE_KEYWORD DOUBLE_KEYWORD |
| 251 | |
| 252 | %token <sval> VARIABLE |
| 253 | |
| 254 | %token <opcode> ASSIGN_MODIFY |
| 255 | |
| 256 | /* C++ */ |
| 257 | %token TRUEKEYWORD |
| 258 | %token FALSEKEYWORD |
| 259 | |
| 260 | |
| 261 | %left ',' |
| 262 | %left ABOVE_COMMA |
| 263 | %right '=' ASSIGN_MODIFY |
| 264 | %right '?' |
| 265 | %left OROR |
| 266 | %left ANDAND |
| 267 | %left '|' |
| 268 | %left '^' |
| 269 | %left '&' |
| 270 | %left EQUAL NOTEQUAL |
| 271 | %left '<' '>' LEQ GEQ |
| 272 | %left LSH RSH |
| 273 | %left '@' |
| 274 | %left '+' '-' |
| 275 | %left '*' '/' '%' |
| 276 | %right UNARY INCREMENT DECREMENT |
| 277 | %right ARROW ARROW_STAR '.' DOT_STAR '[' OBJC_LBRAC '(' |
| 278 | %token <ssym> BLOCKNAME |
| 279 | %token <bval> FILENAME |
| 280 | %type <bval> block |
| 281 | %left COLONCOLON |
| 282 | |
| 283 | %token DOTDOTDOT |
| 284 | |
| 285 | \f |
| 286 | %% |
| 287 | |
| 288 | start : exp1 |
| 289 | | type_exp |
| 290 | ; |
| 291 | |
| 292 | type_exp: type |
| 293 | { write_exp_elt_opcode(pstate, OP_TYPE); |
| 294 | write_exp_elt_type(pstate, $1); |
| 295 | write_exp_elt_opcode(pstate, OP_TYPE);} |
| 296 | | TYPEOF '(' exp ')' |
| 297 | { |
| 298 | write_exp_elt_opcode (pstate, OP_TYPEOF); |
| 299 | } |
| 300 | | TYPEOF '(' type ')' |
| 301 | { |
| 302 | write_exp_elt_opcode (pstate, OP_TYPE); |
| 303 | write_exp_elt_type (pstate, $3); |
| 304 | write_exp_elt_opcode (pstate, OP_TYPE); |
| 305 | } |
| 306 | | DECLTYPE '(' exp ')' |
| 307 | { |
| 308 | write_exp_elt_opcode (pstate, OP_DECLTYPE); |
| 309 | } |
| 310 | ; |
| 311 | |
| 312 | /* Expressions, including the comma operator. */ |
| 313 | exp1 : exp |
| 314 | | exp1 ',' exp |
| 315 | { write_exp_elt_opcode (pstate, BINOP_COMMA); } |
| 316 | ; |
| 317 | |
| 318 | /* Expressions, not including the comma operator. */ |
| 319 | exp : '*' exp %prec UNARY |
| 320 | { write_exp_elt_opcode (pstate, UNOP_IND); } |
| 321 | ; |
| 322 | |
| 323 | exp : '&' exp %prec UNARY |
| 324 | { write_exp_elt_opcode (pstate, UNOP_ADDR); } |
| 325 | ; |
| 326 | |
| 327 | exp : '-' exp %prec UNARY |
| 328 | { write_exp_elt_opcode (pstate, UNOP_NEG); } |
| 329 | ; |
| 330 | |
| 331 | exp : '+' exp %prec UNARY |
| 332 | { write_exp_elt_opcode (pstate, UNOP_PLUS); } |
| 333 | ; |
| 334 | |
| 335 | exp : '!' exp %prec UNARY |
| 336 | { write_exp_elt_opcode (pstate, UNOP_LOGICAL_NOT); } |
| 337 | ; |
| 338 | |
| 339 | exp : '~' exp %prec UNARY |
| 340 | { write_exp_elt_opcode (pstate, UNOP_COMPLEMENT); } |
| 341 | ; |
| 342 | |
| 343 | exp : INCREMENT exp %prec UNARY |
| 344 | { write_exp_elt_opcode (pstate, UNOP_PREINCREMENT); } |
| 345 | ; |
| 346 | |
| 347 | exp : DECREMENT exp %prec UNARY |
| 348 | { write_exp_elt_opcode (pstate, UNOP_PREDECREMENT); } |
| 349 | ; |
| 350 | |
| 351 | exp : exp INCREMENT %prec UNARY |
| 352 | { write_exp_elt_opcode (pstate, UNOP_POSTINCREMENT); } |
| 353 | ; |
| 354 | |
| 355 | exp : exp DECREMENT %prec UNARY |
| 356 | { write_exp_elt_opcode (pstate, UNOP_POSTDECREMENT); } |
| 357 | ; |
| 358 | |
| 359 | exp : TYPEID '(' exp ')' %prec UNARY |
| 360 | { write_exp_elt_opcode (pstate, OP_TYPEID); } |
| 361 | ; |
| 362 | |
| 363 | exp : TYPEID '(' type_exp ')' %prec UNARY |
| 364 | { write_exp_elt_opcode (pstate, OP_TYPEID); } |
| 365 | ; |
| 366 | |
| 367 | exp : SIZEOF exp %prec UNARY |
| 368 | { write_exp_elt_opcode (pstate, UNOP_SIZEOF); } |
| 369 | ; |
| 370 | |
| 371 | exp : exp ARROW name |
| 372 | { write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
| 373 | write_exp_string (pstate, $3); |
| 374 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); } |
| 375 | ; |
| 376 | |
| 377 | exp : exp ARROW name COMPLETE |
| 378 | { mark_struct_expression (pstate); |
| 379 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
| 380 | write_exp_string (pstate, $3); |
| 381 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); } |
| 382 | ; |
| 383 | |
| 384 | exp : exp ARROW COMPLETE |
| 385 | { struct stoken s; |
| 386 | mark_struct_expression (pstate); |
| 387 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
| 388 | s.ptr = ""; |
| 389 | s.length = 0; |
| 390 | write_exp_string (pstate, s); |
| 391 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); } |
| 392 | ; |
| 393 | |
| 394 | exp : exp ARROW '~' name |
| 395 | { write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
| 396 | write_destructor_name (pstate, $4); |
| 397 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); } |
| 398 | ; |
| 399 | |
| 400 | exp : exp ARROW '~' name COMPLETE |
| 401 | { mark_struct_expression (pstate); |
| 402 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
| 403 | write_destructor_name (pstate, $4); |
| 404 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); } |
| 405 | ; |
| 406 | |
| 407 | exp : exp ARROW qualified_name |
| 408 | { /* exp->type::name becomes exp->*(&type::name) */ |
| 409 | /* Note: this doesn't work if name is a |
| 410 | static member! FIXME */ |
| 411 | write_exp_elt_opcode (pstate, UNOP_ADDR); |
| 412 | write_exp_elt_opcode (pstate, STRUCTOP_MPTR); } |
| 413 | ; |
| 414 | |
| 415 | exp : exp ARROW_STAR exp |
| 416 | { write_exp_elt_opcode (pstate, STRUCTOP_MPTR); } |
| 417 | ; |
| 418 | |
| 419 | exp : exp '.' name |
| 420 | { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); |
| 421 | write_exp_string (pstate, $3); |
| 422 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); } |
| 423 | ; |
| 424 | |
| 425 | exp : exp '.' name COMPLETE |
| 426 | { mark_struct_expression (pstate); |
| 427 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); |
| 428 | write_exp_string (pstate, $3); |
| 429 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); } |
| 430 | ; |
| 431 | |
| 432 | exp : exp '.' COMPLETE |
| 433 | { struct stoken s; |
| 434 | mark_struct_expression (pstate); |
| 435 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); |
| 436 | s.ptr = ""; |
| 437 | s.length = 0; |
| 438 | write_exp_string (pstate, s); |
| 439 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); } |
| 440 | ; |
| 441 | |
| 442 | exp : exp '.' '~' name |
| 443 | { write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); |
| 444 | write_destructor_name (pstate, $4); |
| 445 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); } |
| 446 | ; |
| 447 | |
| 448 | exp : exp '.' '~' name COMPLETE |
| 449 | { mark_struct_expression (pstate); |
| 450 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); |
| 451 | write_destructor_name (pstate, $4); |
| 452 | write_exp_elt_opcode (pstate, STRUCTOP_STRUCT); } |
| 453 | ; |
| 454 | |
| 455 | exp : exp '.' qualified_name |
| 456 | { /* exp.type::name becomes exp.*(&type::name) */ |
| 457 | /* Note: this doesn't work if name is a |
| 458 | static member! FIXME */ |
| 459 | write_exp_elt_opcode (pstate, UNOP_ADDR); |
| 460 | write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); } |
| 461 | ; |
| 462 | |
| 463 | exp : exp DOT_STAR exp |
| 464 | { write_exp_elt_opcode (pstate, STRUCTOP_MEMBER); } |
| 465 | ; |
| 466 | |
| 467 | exp : exp '[' exp1 ']' |
| 468 | { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); } |
| 469 | ; |
| 470 | |
| 471 | exp : exp OBJC_LBRAC exp1 ']' |
| 472 | { write_exp_elt_opcode (pstate, BINOP_SUBSCRIPT); } |
| 473 | ; |
| 474 | |
| 475 | /* |
| 476 | * The rules below parse ObjC message calls of the form: |
| 477 | * '[' target selector {':' argument}* ']' |
| 478 | */ |
| 479 | |
| 480 | exp : OBJC_LBRAC TYPENAME |
| 481 | { |
| 482 | CORE_ADDR theclass; |
| 483 | |
| 484 | theclass = lookup_objc_class (parse_gdbarch (pstate), |
| 485 | copy_name ($2.stoken)); |
| 486 | if (theclass == 0) |
| 487 | error (_("%s is not an ObjC Class"), |
| 488 | copy_name ($2.stoken)); |
| 489 | write_exp_elt_opcode (pstate, OP_LONG); |
| 490 | write_exp_elt_type (pstate, |
| 491 | parse_type (pstate)->builtin_int); |
| 492 | write_exp_elt_longcst (pstate, (LONGEST) theclass); |
| 493 | write_exp_elt_opcode (pstate, OP_LONG); |
| 494 | start_msglist(); |
| 495 | } |
| 496 | msglist ']' |
| 497 | { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); |
| 498 | end_msglist (pstate); |
| 499 | write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); |
| 500 | } |
| 501 | ; |
| 502 | |
| 503 | exp : OBJC_LBRAC CLASSNAME |
| 504 | { |
| 505 | write_exp_elt_opcode (pstate, OP_LONG); |
| 506 | write_exp_elt_type (pstate, |
| 507 | parse_type (pstate)->builtin_int); |
| 508 | write_exp_elt_longcst (pstate, (LONGEST) $2.theclass); |
| 509 | write_exp_elt_opcode (pstate, OP_LONG); |
| 510 | start_msglist(); |
| 511 | } |
| 512 | msglist ']' |
| 513 | { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); |
| 514 | end_msglist (pstate); |
| 515 | write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); |
| 516 | } |
| 517 | ; |
| 518 | |
| 519 | exp : OBJC_LBRAC exp |
| 520 | { start_msglist(); } |
| 521 | msglist ']' |
| 522 | { write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); |
| 523 | end_msglist (pstate); |
| 524 | write_exp_elt_opcode (pstate, OP_OBJC_MSGCALL); |
| 525 | } |
| 526 | ; |
| 527 | |
| 528 | msglist : name |
| 529 | { add_msglist(&$1, 0); } |
| 530 | | msgarglist |
| 531 | ; |
| 532 | |
| 533 | msgarglist : msgarg |
| 534 | | msgarglist msgarg |
| 535 | ; |
| 536 | |
| 537 | msgarg : name ':' exp |
| 538 | { add_msglist(&$1, 1); } |
| 539 | | ':' exp /* Unnamed arg. */ |
| 540 | { add_msglist(0, 1); } |
| 541 | | ',' exp /* Variable number of args. */ |
| 542 | { add_msglist(0, 0); } |
| 543 | ; |
| 544 | |
| 545 | exp : exp '(' |
| 546 | /* This is to save the value of arglist_len |
| 547 | being accumulated by an outer function call. */ |
| 548 | { start_arglist (); } |
| 549 | arglist ')' %prec ARROW |
| 550 | { write_exp_elt_opcode (pstate, OP_FUNCALL); |
| 551 | write_exp_elt_longcst (pstate, |
| 552 | (LONGEST) end_arglist ()); |
| 553 | write_exp_elt_opcode (pstate, OP_FUNCALL); } |
| 554 | ; |
| 555 | |
| 556 | exp : UNKNOWN_CPP_NAME '(' |
| 557 | { |
| 558 | /* This could potentially be a an argument defined |
| 559 | lookup function (Koenig). */ |
| 560 | write_exp_elt_opcode (pstate, OP_ADL_FUNC); |
| 561 | write_exp_elt_block (pstate, |
| 562 | expression_context_block); |
| 563 | write_exp_elt_sym (pstate, |
| 564 | NULL); /* Placeholder. */ |
| 565 | write_exp_string (pstate, $1.stoken); |
| 566 | write_exp_elt_opcode (pstate, OP_ADL_FUNC); |
| 567 | |
| 568 | /* This is to save the value of arglist_len |
| 569 | being accumulated by an outer function call. */ |
| 570 | |
| 571 | start_arglist (); |
| 572 | } |
| 573 | arglist ')' %prec ARROW |
| 574 | { |
| 575 | write_exp_elt_opcode (pstate, OP_FUNCALL); |
| 576 | write_exp_elt_longcst (pstate, |
| 577 | (LONGEST) end_arglist ()); |
| 578 | write_exp_elt_opcode (pstate, OP_FUNCALL); |
| 579 | } |
| 580 | ; |
| 581 | |
| 582 | lcurly : '{' |
| 583 | { start_arglist (); } |
| 584 | ; |
| 585 | |
| 586 | arglist : |
| 587 | ; |
| 588 | |
| 589 | arglist : exp |
| 590 | { arglist_len = 1; } |
| 591 | ; |
| 592 | |
| 593 | arglist : arglist ',' exp %prec ABOVE_COMMA |
| 594 | { arglist_len++; } |
| 595 | ; |
| 596 | |
| 597 | exp : exp '(' parameter_typelist ')' const_or_volatile |
| 598 | { int i; |
| 599 | VEC (type_ptr) *type_list = $3; |
| 600 | struct type *type_elt; |
| 601 | LONGEST len = VEC_length (type_ptr, type_list); |
| 602 | |
| 603 | write_exp_elt_opcode (pstate, TYPE_INSTANCE); |
| 604 | write_exp_elt_longcst (pstate, len); |
| 605 | for (i = 0; |
| 606 | VEC_iterate (type_ptr, type_list, i, type_elt); |
| 607 | ++i) |
| 608 | write_exp_elt_type (pstate, type_elt); |
| 609 | write_exp_elt_longcst(pstate, len); |
| 610 | write_exp_elt_opcode (pstate, TYPE_INSTANCE); |
| 611 | VEC_free (type_ptr, type_list); |
| 612 | } |
| 613 | ; |
| 614 | |
| 615 | rcurly : '}' |
| 616 | { $$ = end_arglist () - 1; } |
| 617 | ; |
| 618 | exp : lcurly arglist rcurly %prec ARROW |
| 619 | { write_exp_elt_opcode (pstate, OP_ARRAY); |
| 620 | write_exp_elt_longcst (pstate, (LONGEST) 0); |
| 621 | write_exp_elt_longcst (pstate, (LONGEST) $3); |
| 622 | write_exp_elt_opcode (pstate, OP_ARRAY); } |
| 623 | ; |
| 624 | |
| 625 | exp : lcurly type_exp rcurly exp %prec UNARY |
| 626 | { write_exp_elt_opcode (pstate, UNOP_MEMVAL_TYPE); } |
| 627 | ; |
| 628 | |
| 629 | exp : '(' type_exp ')' exp %prec UNARY |
| 630 | { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); } |
| 631 | ; |
| 632 | |
| 633 | exp : '(' exp1 ')' |
| 634 | { } |
| 635 | ; |
| 636 | |
| 637 | /* Binary operators in order of decreasing precedence. */ |
| 638 | |
| 639 | exp : exp '@' exp |
| 640 | { write_exp_elt_opcode (pstate, BINOP_REPEAT); } |
| 641 | ; |
| 642 | |
| 643 | exp : exp '*' exp |
| 644 | { write_exp_elt_opcode (pstate, BINOP_MUL); } |
| 645 | ; |
| 646 | |
| 647 | exp : exp '/' exp |
| 648 | { write_exp_elt_opcode (pstate, BINOP_DIV); } |
| 649 | ; |
| 650 | |
| 651 | exp : exp '%' exp |
| 652 | { write_exp_elt_opcode (pstate, BINOP_REM); } |
| 653 | ; |
| 654 | |
| 655 | exp : exp '+' exp |
| 656 | { write_exp_elt_opcode (pstate, BINOP_ADD); } |
| 657 | ; |
| 658 | |
| 659 | exp : exp '-' exp |
| 660 | { write_exp_elt_opcode (pstate, BINOP_SUB); } |
| 661 | ; |
| 662 | |
| 663 | exp : exp LSH exp |
| 664 | { write_exp_elt_opcode (pstate, BINOP_LSH); } |
| 665 | ; |
| 666 | |
| 667 | exp : exp RSH exp |
| 668 | { write_exp_elt_opcode (pstate, BINOP_RSH); } |
| 669 | ; |
| 670 | |
| 671 | exp : exp EQUAL exp |
| 672 | { write_exp_elt_opcode (pstate, BINOP_EQUAL); } |
| 673 | ; |
| 674 | |
| 675 | exp : exp NOTEQUAL exp |
| 676 | { write_exp_elt_opcode (pstate, BINOP_NOTEQUAL); } |
| 677 | ; |
| 678 | |
| 679 | exp : exp LEQ exp |
| 680 | { write_exp_elt_opcode (pstate, BINOP_LEQ); } |
| 681 | ; |
| 682 | |
| 683 | exp : exp GEQ exp |
| 684 | { write_exp_elt_opcode (pstate, BINOP_GEQ); } |
| 685 | ; |
| 686 | |
| 687 | exp : exp '<' exp |
| 688 | { write_exp_elt_opcode (pstate, BINOP_LESS); } |
| 689 | ; |
| 690 | |
| 691 | exp : exp '>' exp |
| 692 | { write_exp_elt_opcode (pstate, BINOP_GTR); } |
| 693 | ; |
| 694 | |
| 695 | exp : exp '&' exp |
| 696 | { write_exp_elt_opcode (pstate, BINOP_BITWISE_AND); } |
| 697 | ; |
| 698 | |
| 699 | exp : exp '^' exp |
| 700 | { write_exp_elt_opcode (pstate, BINOP_BITWISE_XOR); } |
| 701 | ; |
| 702 | |
| 703 | exp : exp '|' exp |
| 704 | { write_exp_elt_opcode (pstate, BINOP_BITWISE_IOR); } |
| 705 | ; |
| 706 | |
| 707 | exp : exp ANDAND exp |
| 708 | { write_exp_elt_opcode (pstate, BINOP_LOGICAL_AND); } |
| 709 | ; |
| 710 | |
| 711 | exp : exp OROR exp |
| 712 | { write_exp_elt_opcode (pstate, BINOP_LOGICAL_OR); } |
| 713 | ; |
| 714 | |
| 715 | exp : exp '?' exp ':' exp %prec '?' |
| 716 | { write_exp_elt_opcode (pstate, TERNOP_COND); } |
| 717 | ; |
| 718 | |
| 719 | exp : exp '=' exp |
| 720 | { write_exp_elt_opcode (pstate, BINOP_ASSIGN); } |
| 721 | ; |
| 722 | |
| 723 | exp : exp ASSIGN_MODIFY exp |
| 724 | { write_exp_elt_opcode (pstate, BINOP_ASSIGN_MODIFY); |
| 725 | write_exp_elt_opcode (pstate, $2); |
| 726 | write_exp_elt_opcode (pstate, |
| 727 | BINOP_ASSIGN_MODIFY); } |
| 728 | ; |
| 729 | |
| 730 | exp : INT |
| 731 | { write_exp_elt_opcode (pstate, OP_LONG); |
| 732 | write_exp_elt_type (pstate, $1.type); |
| 733 | write_exp_elt_longcst (pstate, (LONGEST) ($1.val)); |
| 734 | write_exp_elt_opcode (pstate, OP_LONG); } |
| 735 | ; |
| 736 | |
| 737 | exp : CHAR |
| 738 | { |
| 739 | struct stoken_vector vec; |
| 740 | vec.len = 1; |
| 741 | vec.tokens = &$1; |
| 742 | write_exp_string_vector (pstate, $1.type, &vec); |
| 743 | } |
| 744 | ; |
| 745 | |
| 746 | exp : NAME_OR_INT |
| 747 | { YYSTYPE val; |
| 748 | parse_number (pstate, $1.stoken.ptr, |
| 749 | $1.stoken.length, 0, &val); |
| 750 | write_exp_elt_opcode (pstate, OP_LONG); |
| 751 | write_exp_elt_type (pstate, val.typed_val_int.type); |
| 752 | write_exp_elt_longcst (pstate, |
| 753 | (LONGEST) val.typed_val_int.val); |
| 754 | write_exp_elt_opcode (pstate, OP_LONG); |
| 755 | } |
| 756 | ; |
| 757 | |
| 758 | |
| 759 | exp : FLOAT |
| 760 | { write_exp_elt_opcode (pstate, OP_DOUBLE); |
| 761 | write_exp_elt_type (pstate, $1.type); |
| 762 | write_exp_elt_dblcst (pstate, $1.dval); |
| 763 | write_exp_elt_opcode (pstate, OP_DOUBLE); } |
| 764 | ; |
| 765 | |
| 766 | exp : DECFLOAT |
| 767 | { write_exp_elt_opcode (pstate, OP_DECFLOAT); |
| 768 | write_exp_elt_type (pstate, $1.type); |
| 769 | write_exp_elt_decfloatcst (pstate, $1.val); |
| 770 | write_exp_elt_opcode (pstate, OP_DECFLOAT); } |
| 771 | ; |
| 772 | |
| 773 | exp : variable |
| 774 | ; |
| 775 | |
| 776 | exp : VARIABLE |
| 777 | { |
| 778 | write_dollar_variable (pstate, $1); |
| 779 | } |
| 780 | ; |
| 781 | |
| 782 | exp : SELECTOR '(' name ')' |
| 783 | { |
| 784 | write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); |
| 785 | write_exp_string (pstate, $3); |
| 786 | write_exp_elt_opcode (pstate, OP_OBJC_SELECTOR); } |
| 787 | ; |
| 788 | |
| 789 | exp : SIZEOF '(' type ')' %prec UNARY |
| 790 | { struct type *type = $3; |
| 791 | write_exp_elt_opcode (pstate, OP_LONG); |
| 792 | write_exp_elt_type (pstate, lookup_signed_typename |
| 793 | (parse_language (pstate), |
| 794 | parse_gdbarch (pstate), |
| 795 | "int")); |
| 796 | type = check_typedef (type); |
| 797 | |
| 798 | /* $5.3.3/2 of the C++ Standard (n3290 draft) |
| 799 | says of sizeof: "When applied to a reference |
| 800 | or a reference type, the result is the size of |
| 801 | the referenced type." */ |
| 802 | if (TYPE_CODE (type) == TYPE_CODE_REF) |
| 803 | type = check_typedef (TYPE_TARGET_TYPE (type)); |
| 804 | write_exp_elt_longcst (pstate, |
| 805 | (LONGEST) TYPE_LENGTH (type)); |
| 806 | write_exp_elt_opcode (pstate, OP_LONG); } |
| 807 | ; |
| 808 | |
| 809 | exp : REINTERPRET_CAST '<' type_exp '>' '(' exp ')' %prec UNARY |
| 810 | { write_exp_elt_opcode (pstate, |
| 811 | UNOP_REINTERPRET_CAST); } |
| 812 | ; |
| 813 | |
| 814 | exp : STATIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY |
| 815 | { write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); } |
| 816 | ; |
| 817 | |
| 818 | exp : DYNAMIC_CAST '<' type_exp '>' '(' exp ')' %prec UNARY |
| 819 | { write_exp_elt_opcode (pstate, UNOP_DYNAMIC_CAST); } |
| 820 | ; |
| 821 | |
| 822 | exp : CONST_CAST '<' type_exp '>' '(' exp ')' %prec UNARY |
| 823 | { /* We could do more error checking here, but |
| 824 | it doesn't seem worthwhile. */ |
| 825 | write_exp_elt_opcode (pstate, UNOP_CAST_TYPE); } |
| 826 | ; |
| 827 | |
| 828 | string_exp: |
| 829 | STRING |
| 830 | { |
| 831 | /* We copy the string here, and not in the |
| 832 | lexer, to guarantee that we do not leak a |
| 833 | string. Note that we follow the |
| 834 | NUL-termination convention of the |
| 835 | lexer. */ |
| 836 | struct typed_stoken *vec = XNEW (struct typed_stoken); |
| 837 | $$.len = 1; |
| 838 | $$.tokens = vec; |
| 839 | |
| 840 | vec->type = $1.type; |
| 841 | vec->length = $1.length; |
| 842 | vec->ptr = malloc ($1.length + 1); |
| 843 | memcpy (vec->ptr, $1.ptr, $1.length + 1); |
| 844 | } |
| 845 | |
| 846 | | string_exp STRING |
| 847 | { |
| 848 | /* Note that we NUL-terminate here, but just |
| 849 | for convenience. */ |
| 850 | char *p; |
| 851 | ++$$.len; |
| 852 | $$.tokens = realloc ($$.tokens, |
| 853 | $$.len * sizeof (struct typed_stoken)); |
| 854 | |
| 855 | p = malloc ($2.length + 1); |
| 856 | memcpy (p, $2.ptr, $2.length + 1); |
| 857 | |
| 858 | $$.tokens[$$.len - 1].type = $2.type; |
| 859 | $$.tokens[$$.len - 1].length = $2.length; |
| 860 | $$.tokens[$$.len - 1].ptr = p; |
| 861 | } |
| 862 | ; |
| 863 | |
| 864 | exp : string_exp |
| 865 | { |
| 866 | int i; |
| 867 | enum c_string_type type = C_STRING; |
| 868 | |
| 869 | for (i = 0; i < $1.len; ++i) |
| 870 | { |
| 871 | switch ($1.tokens[i].type) |
| 872 | { |
| 873 | case C_STRING: |
| 874 | break; |
| 875 | case C_WIDE_STRING: |
| 876 | case C_STRING_16: |
| 877 | case C_STRING_32: |
| 878 | if (type != C_STRING |
| 879 | && type != $1.tokens[i].type) |
| 880 | error (_("Undefined string concatenation.")); |
| 881 | type = (enum c_string_type) $1.tokens[i].type; |
| 882 | break; |
| 883 | default: |
| 884 | /* internal error */ |
| 885 | internal_error (__FILE__, __LINE__, |
| 886 | "unrecognized type in string concatenation"); |
| 887 | } |
| 888 | } |
| 889 | |
| 890 | write_exp_string_vector (pstate, type, &$1); |
| 891 | for (i = 0; i < $1.len; ++i) |
| 892 | free ($1.tokens[i].ptr); |
| 893 | free ($1.tokens); |
| 894 | } |
| 895 | ; |
| 896 | |
| 897 | exp : NSSTRING /* ObjC NextStep NSString constant |
| 898 | * of the form '@' '"' string '"'. |
| 899 | */ |
| 900 | { write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); |
| 901 | write_exp_string (pstate, $1); |
| 902 | write_exp_elt_opcode (pstate, OP_OBJC_NSSTRING); } |
| 903 | ; |
| 904 | |
| 905 | /* C++. */ |
| 906 | exp : TRUEKEYWORD |
| 907 | { write_exp_elt_opcode (pstate, OP_LONG); |
| 908 | write_exp_elt_type (pstate, |
| 909 | parse_type (pstate)->builtin_bool); |
| 910 | write_exp_elt_longcst (pstate, (LONGEST) 1); |
| 911 | write_exp_elt_opcode (pstate, OP_LONG); } |
| 912 | ; |
| 913 | |
| 914 | exp : FALSEKEYWORD |
| 915 | { write_exp_elt_opcode (pstate, OP_LONG); |
| 916 | write_exp_elt_type (pstate, |
| 917 | parse_type (pstate)->builtin_bool); |
| 918 | write_exp_elt_longcst (pstate, (LONGEST) 0); |
| 919 | write_exp_elt_opcode (pstate, OP_LONG); } |
| 920 | ; |
| 921 | |
| 922 | /* end of C++. */ |
| 923 | |
| 924 | block : BLOCKNAME |
| 925 | { |
| 926 | if ($1.sym.symbol) |
| 927 | $$ = SYMBOL_BLOCK_VALUE ($1.sym.symbol); |
| 928 | else |
| 929 | error (_("No file or function \"%s\"."), |
| 930 | copy_name ($1.stoken)); |
| 931 | } |
| 932 | | FILENAME |
| 933 | { |
| 934 | $$ = $1; |
| 935 | } |
| 936 | ; |
| 937 | |
| 938 | block : block COLONCOLON name |
| 939 | { struct symbol *tem |
| 940 | = lookup_symbol (copy_name ($3), $1, |
| 941 | VAR_DOMAIN, NULL).symbol; |
| 942 | |
| 943 | if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK) |
| 944 | error (_("No function \"%s\" in specified context."), |
| 945 | copy_name ($3)); |
| 946 | $$ = SYMBOL_BLOCK_VALUE (tem); } |
| 947 | ; |
| 948 | |
| 949 | variable: name_not_typename ENTRY |
| 950 | { struct symbol *sym = $1.sym.symbol; |
| 951 | |
| 952 | if (sym == NULL || !SYMBOL_IS_ARGUMENT (sym) |
| 953 | || !symbol_read_needs_frame (sym)) |
| 954 | error (_("@entry can be used only for function " |
| 955 | "parameters, not for \"%s\""), |
| 956 | copy_name ($1.stoken)); |
| 957 | |
| 958 | write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE); |
| 959 | write_exp_elt_sym (pstate, sym); |
| 960 | write_exp_elt_opcode (pstate, OP_VAR_ENTRY_VALUE); |
| 961 | } |
| 962 | ; |
| 963 | |
| 964 | variable: block COLONCOLON name |
| 965 | { struct block_symbol sym |
| 966 | = lookup_symbol (copy_name ($3), $1, |
| 967 | VAR_DOMAIN, NULL); |
| 968 | |
| 969 | if (sym.symbol == 0) |
| 970 | error (_("No symbol \"%s\" in specified context."), |
| 971 | copy_name ($3)); |
| 972 | if (symbol_read_needs_frame (sym.symbol)) |
| 973 | { |
| 974 | if (innermost_block == 0 |
| 975 | || contained_in (sym.block, |
| 976 | innermost_block)) |
| 977 | innermost_block = sym.block; |
| 978 | } |
| 979 | |
| 980 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); |
| 981 | write_exp_elt_block (pstate, sym.block); |
| 982 | write_exp_elt_sym (pstate, sym.symbol); |
| 983 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); } |
| 984 | ; |
| 985 | |
| 986 | qualified_name: TYPENAME COLONCOLON name |
| 987 | { |
| 988 | struct type *type = $1.type; |
| 989 | type = check_typedef (type); |
| 990 | if (!type_aggregate_p (type)) |
| 991 | error (_("`%s' is not defined as an aggregate type."), |
| 992 | TYPE_SAFE_NAME (type)); |
| 993 | |
| 994 | write_exp_elt_opcode (pstate, OP_SCOPE); |
| 995 | write_exp_elt_type (pstate, type); |
| 996 | write_exp_string (pstate, $3); |
| 997 | write_exp_elt_opcode (pstate, OP_SCOPE); |
| 998 | } |
| 999 | | TYPENAME COLONCOLON '~' name |
| 1000 | { |
| 1001 | struct type *type = $1.type; |
| 1002 | struct stoken tmp_token; |
| 1003 | char *buf; |
| 1004 | |
| 1005 | type = check_typedef (type); |
| 1006 | if (!type_aggregate_p (type)) |
| 1007 | error (_("`%s' is not defined as an aggregate type."), |
| 1008 | TYPE_SAFE_NAME (type)); |
| 1009 | buf = alloca ($4.length + 2); |
| 1010 | tmp_token.ptr = buf; |
| 1011 | tmp_token.length = $4.length + 1; |
| 1012 | buf[0] = '~'; |
| 1013 | memcpy (buf+1, $4.ptr, $4.length); |
| 1014 | buf[tmp_token.length] = 0; |
| 1015 | |
| 1016 | /* Check for valid destructor name. */ |
| 1017 | destructor_name_p (tmp_token.ptr, $1.type); |
| 1018 | write_exp_elt_opcode (pstate, OP_SCOPE); |
| 1019 | write_exp_elt_type (pstate, type); |
| 1020 | write_exp_string (pstate, tmp_token); |
| 1021 | write_exp_elt_opcode (pstate, OP_SCOPE); |
| 1022 | } |
| 1023 | | TYPENAME COLONCOLON name COLONCOLON name |
| 1024 | { |
| 1025 | char *copy = copy_name ($3); |
| 1026 | error (_("No type \"%s\" within class " |
| 1027 | "or namespace \"%s\"."), |
| 1028 | copy, TYPE_SAFE_NAME ($1.type)); |
| 1029 | } |
| 1030 | ; |
| 1031 | |
| 1032 | variable: qualified_name |
| 1033 | | COLONCOLON name_not_typename |
| 1034 | { |
| 1035 | char *name = copy_name ($2.stoken); |
| 1036 | struct symbol *sym; |
| 1037 | struct bound_minimal_symbol msymbol; |
| 1038 | |
| 1039 | sym |
| 1040 | = lookup_symbol (name, (const struct block *) NULL, |
| 1041 | VAR_DOMAIN, NULL).symbol; |
| 1042 | if (sym) |
| 1043 | { |
| 1044 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); |
| 1045 | write_exp_elt_block (pstate, NULL); |
| 1046 | write_exp_elt_sym (pstate, sym); |
| 1047 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); |
| 1048 | break; |
| 1049 | } |
| 1050 | |
| 1051 | msymbol = lookup_bound_minimal_symbol (name); |
| 1052 | if (msymbol.minsym != NULL) |
| 1053 | write_exp_msymbol (pstate, msymbol); |
| 1054 | else if (!have_full_symbols () && !have_partial_symbols ()) |
| 1055 | error (_("No symbol table is loaded. Use the \"file\" command.")); |
| 1056 | else |
| 1057 | error (_("No symbol \"%s\" in current context."), name); |
| 1058 | } |
| 1059 | ; |
| 1060 | |
| 1061 | variable: name_not_typename |
| 1062 | { struct block_symbol sym = $1.sym; |
| 1063 | |
| 1064 | if (sym.symbol) |
| 1065 | { |
| 1066 | if (symbol_read_needs_frame (sym.symbol)) |
| 1067 | { |
| 1068 | if (innermost_block == 0 |
| 1069 | || contained_in (sym.block, |
| 1070 | innermost_block)) |
| 1071 | innermost_block = sym.block; |
| 1072 | } |
| 1073 | |
| 1074 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); |
| 1075 | write_exp_elt_block (pstate, sym.block); |
| 1076 | write_exp_elt_sym (pstate, sym.symbol); |
| 1077 | write_exp_elt_opcode (pstate, OP_VAR_VALUE); |
| 1078 | } |
| 1079 | else if ($1.is_a_field_of_this) |
| 1080 | { |
| 1081 | /* C++: it hangs off of `this'. Must |
| 1082 | not inadvertently convert from a method call |
| 1083 | to data ref. */ |
| 1084 | if (innermost_block == 0 |
| 1085 | || contained_in (sym.block, |
| 1086 | innermost_block)) |
| 1087 | innermost_block = sym.block; |
| 1088 | write_exp_elt_opcode (pstate, OP_THIS); |
| 1089 | write_exp_elt_opcode (pstate, OP_THIS); |
| 1090 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
| 1091 | write_exp_string (pstate, $1.stoken); |
| 1092 | write_exp_elt_opcode (pstate, STRUCTOP_PTR); |
| 1093 | } |
| 1094 | else |
| 1095 | { |
| 1096 | struct bound_minimal_symbol msymbol; |
| 1097 | char *arg = copy_name ($1.stoken); |
| 1098 | |
| 1099 | msymbol = |
| 1100 | lookup_bound_minimal_symbol (arg); |
| 1101 | if (msymbol.minsym != NULL) |
| 1102 | write_exp_msymbol (pstate, msymbol); |
| 1103 | else if (!have_full_symbols () && !have_partial_symbols ()) |
| 1104 | error (_("No symbol table is loaded. Use the \"file\" command.")); |
| 1105 | else |
| 1106 | error (_("No symbol \"%s\" in current context."), |
| 1107 | copy_name ($1.stoken)); |
| 1108 | } |
| 1109 | } |
| 1110 | ; |
| 1111 | |
| 1112 | space_identifier : '@' NAME |
| 1113 | { insert_type_address_space (pstate, copy_name ($2.stoken)); } |
| 1114 | ; |
| 1115 | |
| 1116 | const_or_volatile: const_or_volatile_noopt |
| 1117 | | |
| 1118 | ; |
| 1119 | |
| 1120 | cv_with_space_id : const_or_volatile space_identifier const_or_volatile |
| 1121 | ; |
| 1122 | |
| 1123 | const_or_volatile_or_space_identifier_noopt: cv_with_space_id |
| 1124 | | const_or_volatile_noopt |
| 1125 | ; |
| 1126 | |
| 1127 | const_or_volatile_or_space_identifier: |
| 1128 | const_or_volatile_or_space_identifier_noopt |
| 1129 | | |
| 1130 | ; |
| 1131 | |
| 1132 | ptr_operator: |
| 1133 | ptr_operator '*' |
| 1134 | { insert_type (tp_pointer); } |
| 1135 | const_or_volatile_or_space_identifier |
| 1136 | | '*' |
| 1137 | { insert_type (tp_pointer); } |
| 1138 | const_or_volatile_or_space_identifier |
| 1139 | | '&' |
| 1140 | { insert_type (tp_reference); } |
| 1141 | | '&' ptr_operator |
| 1142 | { insert_type (tp_reference); } |
| 1143 | ; |
| 1144 | |
| 1145 | ptr_operator_ts: ptr_operator |
| 1146 | { |
| 1147 | $$ = get_type_stack (); |
| 1148 | /* This cleanup is eventually run by |
| 1149 | c_parse. */ |
| 1150 | make_cleanup (type_stack_cleanup, $$); |
| 1151 | } |
| 1152 | ; |
| 1153 | |
| 1154 | abs_decl: ptr_operator_ts direct_abs_decl |
| 1155 | { $$ = append_type_stack ($2, $1); } |
| 1156 | | ptr_operator_ts |
| 1157 | | direct_abs_decl |
| 1158 | ; |
| 1159 | |
| 1160 | direct_abs_decl: '(' abs_decl ')' |
| 1161 | { $$ = $2; } |
| 1162 | | direct_abs_decl array_mod |
| 1163 | { |
| 1164 | push_type_stack ($1); |
| 1165 | push_type_int ($2); |
| 1166 | push_type (tp_array); |
| 1167 | $$ = get_type_stack (); |
| 1168 | } |
| 1169 | | array_mod |
| 1170 | { |
| 1171 | push_type_int ($1); |
| 1172 | push_type (tp_array); |
| 1173 | $$ = get_type_stack (); |
| 1174 | } |
| 1175 | |
| 1176 | | direct_abs_decl func_mod |
| 1177 | { |
| 1178 | push_type_stack ($1); |
| 1179 | push_typelist ($2); |
| 1180 | $$ = get_type_stack (); |
| 1181 | } |
| 1182 | | func_mod |
| 1183 | { |
| 1184 | push_typelist ($1); |
| 1185 | $$ = get_type_stack (); |
| 1186 | } |
| 1187 | ; |
| 1188 | |
| 1189 | array_mod: '[' ']' |
| 1190 | { $$ = -1; } |
| 1191 | | OBJC_LBRAC ']' |
| 1192 | { $$ = -1; } |
| 1193 | | '[' INT ']' |
| 1194 | { $$ = $2.val; } |
| 1195 | | OBJC_LBRAC INT ']' |
| 1196 | { $$ = $2.val; } |
| 1197 | ; |
| 1198 | |
| 1199 | func_mod: '(' ')' |
| 1200 | { $$ = NULL; } |
| 1201 | | '(' parameter_typelist ')' |
| 1202 | { $$ = $2; } |
| 1203 | ; |
| 1204 | |
| 1205 | /* We used to try to recognize pointer to member types here, but |
| 1206 | that didn't work (shift/reduce conflicts meant that these rules never |
| 1207 | got executed). The problem is that |
| 1208 | int (foo::bar::baz::bizzle) |
| 1209 | is a function type but |
| 1210 | int (foo::bar::baz::bizzle::*) |
| 1211 | is a pointer to member type. Stroustrup loses again! */ |
| 1212 | |
| 1213 | type : ptype |
| 1214 | ; |
| 1215 | |
| 1216 | typebase /* Implements (approximately): (type-qualifier)* type-specifier */ |
| 1217 | : TYPENAME |
| 1218 | { $$ = $1.type; } |
| 1219 | | INT_KEYWORD |
| 1220 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1221 | parse_gdbarch (pstate), |
| 1222 | "int"); } |
| 1223 | | LONG |
| 1224 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1225 | parse_gdbarch (pstate), |
| 1226 | "long"); } |
| 1227 | | SHORT |
| 1228 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1229 | parse_gdbarch (pstate), |
| 1230 | "short"); } |
| 1231 | | LONG INT_KEYWORD |
| 1232 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1233 | parse_gdbarch (pstate), |
| 1234 | "long"); } |
| 1235 | | LONG SIGNED_KEYWORD INT_KEYWORD |
| 1236 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1237 | parse_gdbarch (pstate), |
| 1238 | "long"); } |
| 1239 | | LONG SIGNED_KEYWORD |
| 1240 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1241 | parse_gdbarch (pstate), |
| 1242 | "long"); } |
| 1243 | | SIGNED_KEYWORD LONG INT_KEYWORD |
| 1244 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1245 | parse_gdbarch (pstate), |
| 1246 | "long"); } |
| 1247 | | UNSIGNED LONG INT_KEYWORD |
| 1248 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1249 | parse_gdbarch (pstate), |
| 1250 | "long"); } |
| 1251 | | LONG UNSIGNED INT_KEYWORD |
| 1252 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1253 | parse_gdbarch (pstate), |
| 1254 | "long"); } |
| 1255 | | LONG UNSIGNED |
| 1256 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1257 | parse_gdbarch (pstate), |
| 1258 | "long"); } |
| 1259 | | LONG LONG |
| 1260 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1261 | parse_gdbarch (pstate), |
| 1262 | "long long"); } |
| 1263 | | LONG LONG INT_KEYWORD |
| 1264 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1265 | parse_gdbarch (pstate), |
| 1266 | "long long"); } |
| 1267 | | LONG LONG SIGNED_KEYWORD INT_KEYWORD |
| 1268 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1269 | parse_gdbarch (pstate), |
| 1270 | "long long"); } |
| 1271 | | LONG LONG SIGNED_KEYWORD |
| 1272 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1273 | parse_gdbarch (pstate), |
| 1274 | "long long"); } |
| 1275 | | SIGNED_KEYWORD LONG LONG |
| 1276 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1277 | parse_gdbarch (pstate), |
| 1278 | "long long"); } |
| 1279 | | SIGNED_KEYWORD LONG LONG INT_KEYWORD |
| 1280 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1281 | parse_gdbarch (pstate), |
| 1282 | "long long"); } |
| 1283 | | UNSIGNED LONG LONG |
| 1284 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1285 | parse_gdbarch (pstate), |
| 1286 | "long long"); } |
| 1287 | | UNSIGNED LONG LONG INT_KEYWORD |
| 1288 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1289 | parse_gdbarch (pstate), |
| 1290 | "long long"); } |
| 1291 | | LONG LONG UNSIGNED |
| 1292 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1293 | parse_gdbarch (pstate), |
| 1294 | "long long"); } |
| 1295 | | LONG LONG UNSIGNED INT_KEYWORD |
| 1296 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1297 | parse_gdbarch (pstate), |
| 1298 | "long long"); } |
| 1299 | | SHORT INT_KEYWORD |
| 1300 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1301 | parse_gdbarch (pstate), |
| 1302 | "short"); } |
| 1303 | | SHORT SIGNED_KEYWORD INT_KEYWORD |
| 1304 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1305 | parse_gdbarch (pstate), |
| 1306 | "short"); } |
| 1307 | | SHORT SIGNED_KEYWORD |
| 1308 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1309 | parse_gdbarch (pstate), |
| 1310 | "short"); } |
| 1311 | | UNSIGNED SHORT INT_KEYWORD |
| 1312 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1313 | parse_gdbarch (pstate), |
| 1314 | "short"); } |
| 1315 | | SHORT UNSIGNED |
| 1316 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1317 | parse_gdbarch (pstate), |
| 1318 | "short"); } |
| 1319 | | SHORT UNSIGNED INT_KEYWORD |
| 1320 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1321 | parse_gdbarch (pstate), |
| 1322 | "short"); } |
| 1323 | | DOUBLE_KEYWORD |
| 1324 | { $$ = lookup_typename (parse_language (pstate), |
| 1325 | parse_gdbarch (pstate), |
| 1326 | "double", |
| 1327 | (struct block *) NULL, |
| 1328 | 0); } |
| 1329 | | LONG DOUBLE_KEYWORD |
| 1330 | { $$ = lookup_typename (parse_language (pstate), |
| 1331 | parse_gdbarch (pstate), |
| 1332 | "long double", |
| 1333 | (struct block *) NULL, |
| 1334 | 0); } |
| 1335 | | STRUCT name |
| 1336 | { $$ = lookup_struct (copy_name ($2), |
| 1337 | expression_context_block); } |
| 1338 | | STRUCT COMPLETE |
| 1339 | { |
| 1340 | mark_completion_tag (TYPE_CODE_STRUCT, "", 0); |
| 1341 | $$ = NULL; |
| 1342 | } |
| 1343 | | STRUCT name COMPLETE |
| 1344 | { |
| 1345 | mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr, |
| 1346 | $2.length); |
| 1347 | $$ = NULL; |
| 1348 | } |
| 1349 | | CLASS name |
| 1350 | { $$ = lookup_struct (copy_name ($2), |
| 1351 | expression_context_block); } |
| 1352 | | CLASS COMPLETE |
| 1353 | { |
| 1354 | mark_completion_tag (TYPE_CODE_STRUCT, "", 0); |
| 1355 | $$ = NULL; |
| 1356 | } |
| 1357 | | CLASS name COMPLETE |
| 1358 | { |
| 1359 | mark_completion_tag (TYPE_CODE_STRUCT, $2.ptr, |
| 1360 | $2.length); |
| 1361 | $$ = NULL; |
| 1362 | } |
| 1363 | | UNION name |
| 1364 | { $$ = lookup_union (copy_name ($2), |
| 1365 | expression_context_block); } |
| 1366 | | UNION COMPLETE |
| 1367 | { |
| 1368 | mark_completion_tag (TYPE_CODE_UNION, "", 0); |
| 1369 | $$ = NULL; |
| 1370 | } |
| 1371 | | UNION name COMPLETE |
| 1372 | { |
| 1373 | mark_completion_tag (TYPE_CODE_UNION, $2.ptr, |
| 1374 | $2.length); |
| 1375 | $$ = NULL; |
| 1376 | } |
| 1377 | | ENUM name |
| 1378 | { $$ = lookup_enum (copy_name ($2), |
| 1379 | expression_context_block); } |
| 1380 | | ENUM COMPLETE |
| 1381 | { |
| 1382 | mark_completion_tag (TYPE_CODE_ENUM, "", 0); |
| 1383 | $$ = NULL; |
| 1384 | } |
| 1385 | | ENUM name COMPLETE |
| 1386 | { |
| 1387 | mark_completion_tag (TYPE_CODE_ENUM, $2.ptr, |
| 1388 | $2.length); |
| 1389 | $$ = NULL; |
| 1390 | } |
| 1391 | | UNSIGNED type_name |
| 1392 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1393 | parse_gdbarch (pstate), |
| 1394 | TYPE_NAME($2.type)); } |
| 1395 | | UNSIGNED |
| 1396 | { $$ = lookup_unsigned_typename (parse_language (pstate), |
| 1397 | parse_gdbarch (pstate), |
| 1398 | "int"); } |
| 1399 | | SIGNED_KEYWORD type_name |
| 1400 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1401 | parse_gdbarch (pstate), |
| 1402 | TYPE_NAME($2.type)); } |
| 1403 | | SIGNED_KEYWORD |
| 1404 | { $$ = lookup_signed_typename (parse_language (pstate), |
| 1405 | parse_gdbarch (pstate), |
| 1406 | "int"); } |
| 1407 | /* It appears that this rule for templates is never |
| 1408 | reduced; template recognition happens by lookahead |
| 1409 | in the token processing code in yylex. */ |
| 1410 | | TEMPLATE name '<' type '>' |
| 1411 | { $$ = lookup_template_type(copy_name($2), $4, |
| 1412 | expression_context_block); |
| 1413 | } |
| 1414 | | const_or_volatile_or_space_identifier_noopt typebase |
| 1415 | { $$ = follow_types ($2); } |
| 1416 | | typebase const_or_volatile_or_space_identifier_noopt |
| 1417 | { $$ = follow_types ($1); } |
| 1418 | ; |
| 1419 | |
| 1420 | type_name: TYPENAME |
| 1421 | | INT_KEYWORD |
| 1422 | { |
| 1423 | $$.stoken.ptr = "int"; |
| 1424 | $$.stoken.length = 3; |
| 1425 | $$.type = lookup_signed_typename (parse_language (pstate), |
| 1426 | parse_gdbarch (pstate), |
| 1427 | "int"); |
| 1428 | } |
| 1429 | | LONG |
| 1430 | { |
| 1431 | $$.stoken.ptr = "long"; |
| 1432 | $$.stoken.length = 4; |
| 1433 | $$.type = lookup_signed_typename (parse_language (pstate), |
| 1434 | parse_gdbarch (pstate), |
| 1435 | "long"); |
| 1436 | } |
| 1437 | | SHORT |
| 1438 | { |
| 1439 | $$.stoken.ptr = "short"; |
| 1440 | $$.stoken.length = 5; |
| 1441 | $$.type = lookup_signed_typename (parse_language (pstate), |
| 1442 | parse_gdbarch (pstate), |
| 1443 | "short"); |
| 1444 | } |
| 1445 | ; |
| 1446 | |
| 1447 | parameter_typelist: |
| 1448 | nonempty_typelist |
| 1449 | { check_parameter_typelist ($1); } |
| 1450 | | nonempty_typelist ',' DOTDOTDOT |
| 1451 | { |
| 1452 | VEC_safe_push (type_ptr, $1, NULL); |
| 1453 | check_parameter_typelist ($1); |
| 1454 | $$ = $1; |
| 1455 | } |
| 1456 | ; |
| 1457 | |
| 1458 | nonempty_typelist |
| 1459 | : type |
| 1460 | { |
| 1461 | VEC (type_ptr) *typelist = NULL; |
| 1462 | VEC_safe_push (type_ptr, typelist, $1); |
| 1463 | $$ = typelist; |
| 1464 | } |
| 1465 | | nonempty_typelist ',' type |
| 1466 | { |
| 1467 | VEC_safe_push (type_ptr, $1, $3); |
| 1468 | $$ = $1; |
| 1469 | } |
| 1470 | ; |
| 1471 | |
| 1472 | ptype : typebase |
| 1473 | | ptype abs_decl |
| 1474 | { |
| 1475 | push_type_stack ($2); |
| 1476 | $$ = follow_types ($1); |
| 1477 | } |
| 1478 | ; |
| 1479 | |
| 1480 | conversion_type_id: typebase conversion_declarator |
| 1481 | { $$ = follow_types ($1); } |
| 1482 | ; |
| 1483 | |
| 1484 | conversion_declarator: /* Nothing. */ |
| 1485 | | ptr_operator conversion_declarator |
| 1486 | ; |
| 1487 | |
| 1488 | const_and_volatile: CONST_KEYWORD VOLATILE_KEYWORD |
| 1489 | | VOLATILE_KEYWORD CONST_KEYWORD |
| 1490 | ; |
| 1491 | |
| 1492 | const_or_volatile_noopt: const_and_volatile |
| 1493 | { insert_type (tp_const); |
| 1494 | insert_type (tp_volatile); |
| 1495 | } |
| 1496 | | CONST_KEYWORD |
| 1497 | { insert_type (tp_const); } |
| 1498 | | VOLATILE_KEYWORD |
| 1499 | { insert_type (tp_volatile); } |
| 1500 | ; |
| 1501 | |
| 1502 | oper: OPERATOR NEW |
| 1503 | { $$ = operator_stoken (" new"); } |
| 1504 | | OPERATOR DELETE |
| 1505 | { $$ = operator_stoken (" delete"); } |
| 1506 | | OPERATOR NEW '[' ']' |
| 1507 | { $$ = operator_stoken (" new[]"); } |
| 1508 | | OPERATOR DELETE '[' ']' |
| 1509 | { $$ = operator_stoken (" delete[]"); } |
| 1510 | | OPERATOR NEW OBJC_LBRAC ']' |
| 1511 | { $$ = operator_stoken (" new[]"); } |
| 1512 | | OPERATOR DELETE OBJC_LBRAC ']' |
| 1513 | { $$ = operator_stoken (" delete[]"); } |
| 1514 | | OPERATOR '+' |
| 1515 | { $$ = operator_stoken ("+"); } |
| 1516 | | OPERATOR '-' |
| 1517 | { $$ = operator_stoken ("-"); } |
| 1518 | | OPERATOR '*' |
| 1519 | { $$ = operator_stoken ("*"); } |
| 1520 | | OPERATOR '/' |
| 1521 | { $$ = operator_stoken ("/"); } |
| 1522 | | OPERATOR '%' |
| 1523 | { $$ = operator_stoken ("%"); } |
| 1524 | | OPERATOR '^' |
| 1525 | { $$ = operator_stoken ("^"); } |
| 1526 | | OPERATOR '&' |
| 1527 | { $$ = operator_stoken ("&"); } |
| 1528 | | OPERATOR '|' |
| 1529 | { $$ = operator_stoken ("|"); } |
| 1530 | | OPERATOR '~' |
| 1531 | { $$ = operator_stoken ("~"); } |
| 1532 | | OPERATOR '!' |
| 1533 | { $$ = operator_stoken ("!"); } |
| 1534 | | OPERATOR '=' |
| 1535 | { $$ = operator_stoken ("="); } |
| 1536 | | OPERATOR '<' |
| 1537 | { $$ = operator_stoken ("<"); } |
| 1538 | | OPERATOR '>' |
| 1539 | { $$ = operator_stoken (">"); } |
| 1540 | | OPERATOR ASSIGN_MODIFY |
| 1541 | { const char *op = "unknown"; |
| 1542 | switch ($2) |
| 1543 | { |
| 1544 | case BINOP_RSH: |
| 1545 | op = ">>="; |
| 1546 | break; |
| 1547 | case BINOP_LSH: |
| 1548 | op = "<<="; |
| 1549 | break; |
| 1550 | case BINOP_ADD: |
| 1551 | op = "+="; |
| 1552 | break; |
| 1553 | case BINOP_SUB: |
| 1554 | op = "-="; |
| 1555 | break; |
| 1556 | case BINOP_MUL: |
| 1557 | op = "*="; |
| 1558 | break; |
| 1559 | case BINOP_DIV: |
| 1560 | op = "/="; |
| 1561 | break; |
| 1562 | case BINOP_REM: |
| 1563 | op = "%="; |
| 1564 | break; |
| 1565 | case BINOP_BITWISE_IOR: |
| 1566 | op = "|="; |
| 1567 | break; |
| 1568 | case BINOP_BITWISE_AND: |
| 1569 | op = "&="; |
| 1570 | break; |
| 1571 | case BINOP_BITWISE_XOR: |
| 1572 | op = "^="; |
| 1573 | break; |
| 1574 | default: |
| 1575 | break; |
| 1576 | } |
| 1577 | |
| 1578 | $$ = operator_stoken (op); |
| 1579 | } |
| 1580 | | OPERATOR LSH |
| 1581 | { $$ = operator_stoken ("<<"); } |
| 1582 | | OPERATOR RSH |
| 1583 | { $$ = operator_stoken (">>"); } |
| 1584 | | OPERATOR EQUAL |
| 1585 | { $$ = operator_stoken ("=="); } |
| 1586 | | OPERATOR NOTEQUAL |
| 1587 | { $$ = operator_stoken ("!="); } |
| 1588 | | OPERATOR LEQ |
| 1589 | { $$ = operator_stoken ("<="); } |
| 1590 | | OPERATOR GEQ |
| 1591 | { $$ = operator_stoken (">="); } |
| 1592 | | OPERATOR ANDAND |
| 1593 | { $$ = operator_stoken ("&&"); } |
| 1594 | | OPERATOR OROR |
| 1595 | { $$ = operator_stoken ("||"); } |
| 1596 | | OPERATOR INCREMENT |
| 1597 | { $$ = operator_stoken ("++"); } |
| 1598 | | OPERATOR DECREMENT |
| 1599 | { $$ = operator_stoken ("--"); } |
| 1600 | | OPERATOR ',' |
| 1601 | { $$ = operator_stoken (","); } |
| 1602 | | OPERATOR ARROW_STAR |
| 1603 | { $$ = operator_stoken ("->*"); } |
| 1604 | | OPERATOR ARROW |
| 1605 | { $$ = operator_stoken ("->"); } |
| 1606 | | OPERATOR '(' ')' |
| 1607 | { $$ = operator_stoken ("()"); } |
| 1608 | | OPERATOR '[' ']' |
| 1609 | { $$ = operator_stoken ("[]"); } |
| 1610 | | OPERATOR OBJC_LBRAC ']' |
| 1611 | { $$ = operator_stoken ("[]"); } |
| 1612 | | OPERATOR conversion_type_id |
| 1613 | { char *name; |
| 1614 | long length; |
| 1615 | struct ui_file *buf = mem_fileopen (); |
| 1616 | |
| 1617 | c_print_type ($2, NULL, buf, -1, 0, |
| 1618 | &type_print_raw_options); |
| 1619 | name = ui_file_xstrdup (buf, &length); |
| 1620 | ui_file_delete (buf); |
| 1621 | $$ = operator_stoken (name); |
| 1622 | free (name); |
| 1623 | } |
| 1624 | ; |
| 1625 | |
| 1626 | |
| 1627 | |
| 1628 | name : NAME { $$ = $1.stoken; } |
| 1629 | | BLOCKNAME { $$ = $1.stoken; } |
| 1630 | | TYPENAME { $$ = $1.stoken; } |
| 1631 | | NAME_OR_INT { $$ = $1.stoken; } |
| 1632 | | UNKNOWN_CPP_NAME { $$ = $1.stoken; } |
| 1633 | | oper { $$ = $1; } |
| 1634 | ; |
| 1635 | |
| 1636 | name_not_typename : NAME |
| 1637 | | BLOCKNAME |
| 1638 | /* These would be useful if name_not_typename was useful, but it is just |
| 1639 | a fake for "variable", so these cause reduce/reduce conflicts because |
| 1640 | the parser can't tell whether NAME_OR_INT is a name_not_typename (=variable, |
| 1641 | =exp) or just an exp. If name_not_typename was ever used in an lvalue |
| 1642 | context where only a name could occur, this might be useful. |
| 1643 | | NAME_OR_INT |
| 1644 | */ |
| 1645 | | oper |
| 1646 | { |
| 1647 | struct field_of_this_result is_a_field_of_this; |
| 1648 | |
| 1649 | $$.stoken = $1; |
| 1650 | $$.sym = lookup_symbol ($1.ptr, |
| 1651 | expression_context_block, |
| 1652 | VAR_DOMAIN, |
| 1653 | &is_a_field_of_this); |
| 1654 | $$.is_a_field_of_this |
| 1655 | = is_a_field_of_this.type != NULL; |
| 1656 | } |
| 1657 | | UNKNOWN_CPP_NAME |
| 1658 | ; |
| 1659 | |
| 1660 | %% |
| 1661 | |
| 1662 | /* Like write_exp_string, but prepends a '~'. */ |
| 1663 | |
| 1664 | static void |
| 1665 | write_destructor_name (struct parser_state *par_state, struct stoken token) |
| 1666 | { |
| 1667 | char *copy = alloca (token.length + 1); |
| 1668 | |
| 1669 | copy[0] = '~'; |
| 1670 | memcpy (©[1], token.ptr, token.length); |
| 1671 | |
| 1672 | token.ptr = copy; |
| 1673 | ++token.length; |
| 1674 | |
| 1675 | write_exp_string (par_state, token); |
| 1676 | } |
| 1677 | |
| 1678 | /* Returns a stoken of the operator name given by OP (which does not |
| 1679 | include the string "operator"). */ |
| 1680 | |
| 1681 | static struct stoken |
| 1682 | operator_stoken (const char *op) |
| 1683 | { |
| 1684 | static const char *operator_string = "operator"; |
| 1685 | struct stoken st = { NULL, 0 }; |
| 1686 | char *buf; |
| 1687 | |
| 1688 | st.length = strlen (operator_string) + strlen (op); |
| 1689 | buf = malloc (st.length + 1); |
| 1690 | strcpy (buf, operator_string); |
| 1691 | strcat (buf, op); |
| 1692 | st.ptr = buf; |
| 1693 | |
| 1694 | /* The toplevel (c_parse) will free the memory allocated here. */ |
| 1695 | make_cleanup (free, buf); |
| 1696 | return st; |
| 1697 | }; |
| 1698 | |
| 1699 | /* Return true if the type is aggregate-like. */ |
| 1700 | |
| 1701 | static int |
| 1702 | type_aggregate_p (struct type *type) |
| 1703 | { |
| 1704 | return (TYPE_CODE (type) == TYPE_CODE_STRUCT |
| 1705 | || TYPE_CODE (type) == TYPE_CODE_UNION |
| 1706 | || TYPE_CODE (type) == TYPE_CODE_NAMESPACE |
| 1707 | || (TYPE_CODE (type) == TYPE_CODE_ENUM |
| 1708 | && TYPE_DECLARED_CLASS (type))); |
| 1709 | } |
| 1710 | |
| 1711 | /* Validate a parameter typelist. */ |
| 1712 | |
| 1713 | static void |
| 1714 | check_parameter_typelist (VEC (type_ptr) *params) |
| 1715 | { |
| 1716 | struct type *type; |
| 1717 | int ix; |
| 1718 | |
| 1719 | for (ix = 0; VEC_iterate (type_ptr, params, ix, type); ++ix) |
| 1720 | { |
| 1721 | if (type != NULL && TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID) |
| 1722 | { |
| 1723 | if (ix == 0) |
| 1724 | { |
| 1725 | if (VEC_length (type_ptr, params) == 1) |
| 1726 | { |
| 1727 | /* Ok. */ |
| 1728 | break; |
| 1729 | } |
| 1730 | VEC_free (type_ptr, params); |
| 1731 | error (_("parameter types following 'void'")); |
| 1732 | } |
| 1733 | else |
| 1734 | { |
| 1735 | VEC_free (type_ptr, params); |
| 1736 | error (_("'void' invalid as parameter type")); |
| 1737 | } |
| 1738 | } |
| 1739 | } |
| 1740 | } |
| 1741 | |
| 1742 | /* Take care of parsing a number (anything that starts with a digit). |
| 1743 | Set yylval and return the token type; update lexptr. |
| 1744 | LEN is the number of characters in it. */ |
| 1745 | |
| 1746 | /*** Needs some error checking for the float case ***/ |
| 1747 | |
| 1748 | static int |
| 1749 | parse_number (struct parser_state *par_state, |
| 1750 | const char *buf, int len, int parsed_float, YYSTYPE *putithere) |
| 1751 | { |
| 1752 | /* FIXME: Shouldn't these be unsigned? We don't deal with negative values |
| 1753 | here, and we do kind of silly things like cast to unsigned. */ |
| 1754 | LONGEST n = 0; |
| 1755 | LONGEST prevn = 0; |
| 1756 | ULONGEST un; |
| 1757 | |
| 1758 | int i = 0; |
| 1759 | int c; |
| 1760 | int base = input_radix; |
| 1761 | int unsigned_p = 0; |
| 1762 | |
| 1763 | /* Number of "L" suffixes encountered. */ |
| 1764 | int long_p = 0; |
| 1765 | |
| 1766 | /* We have found a "L" or "U" suffix. */ |
| 1767 | int found_suffix = 0; |
| 1768 | |
| 1769 | ULONGEST high_bit; |
| 1770 | struct type *signed_type; |
| 1771 | struct type *unsigned_type; |
| 1772 | char *p; |
| 1773 | |
| 1774 | p = alloca (len); |
| 1775 | memcpy (p, buf, len); |
| 1776 | |
| 1777 | if (parsed_float) |
| 1778 | { |
| 1779 | /* If it ends at "df", "dd" or "dl", take it as type of decimal floating |
| 1780 | point. Return DECFLOAT. */ |
| 1781 | |
| 1782 | if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'f') |
| 1783 | { |
| 1784 | p[len - 2] = '\0'; |
| 1785 | putithere->typed_val_decfloat.type |
| 1786 | = parse_type (par_state)->builtin_decfloat; |
| 1787 | decimal_from_string (putithere->typed_val_decfloat.val, 4, |
| 1788 | gdbarch_byte_order (parse_gdbarch (par_state)), |
| 1789 | p); |
| 1790 | p[len - 2] = 'd'; |
| 1791 | return DECFLOAT; |
| 1792 | } |
| 1793 | |
| 1794 | if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'd') |
| 1795 | { |
| 1796 | p[len - 2] = '\0'; |
| 1797 | putithere->typed_val_decfloat.type |
| 1798 | = parse_type (par_state)->builtin_decdouble; |
| 1799 | decimal_from_string (putithere->typed_val_decfloat.val, 8, |
| 1800 | gdbarch_byte_order (parse_gdbarch (par_state)), |
| 1801 | p); |
| 1802 | p[len - 2] = 'd'; |
| 1803 | return DECFLOAT; |
| 1804 | } |
| 1805 | |
| 1806 | if (len >= 2 && p[len - 2] == 'd' && p[len - 1] == 'l') |
| 1807 | { |
| 1808 | p[len - 2] = '\0'; |
| 1809 | putithere->typed_val_decfloat.type |
| 1810 | = parse_type (par_state)->builtin_declong; |
| 1811 | decimal_from_string (putithere->typed_val_decfloat.val, 16, |
| 1812 | gdbarch_byte_order (parse_gdbarch (par_state)), |
| 1813 | p); |
| 1814 | p[len - 2] = 'd'; |
| 1815 | return DECFLOAT; |
| 1816 | } |
| 1817 | |
| 1818 | if (! parse_c_float (parse_gdbarch (par_state), p, len, |
| 1819 | &putithere->typed_val_float.dval, |
| 1820 | &putithere->typed_val_float.type)) |
| 1821 | return ERROR; |
| 1822 | return FLOAT; |
| 1823 | } |
| 1824 | |
| 1825 | /* Handle base-switching prefixes 0x, 0t, 0d, 0 */ |
| 1826 | if (p[0] == '0' && len > 1) |
| 1827 | switch (p[1]) |
| 1828 | { |
| 1829 | case 'x': |
| 1830 | case 'X': |
| 1831 | if (len >= 3) |
| 1832 | { |
| 1833 | p += 2; |
| 1834 | base = 16; |
| 1835 | len -= 2; |
| 1836 | } |
| 1837 | break; |
| 1838 | |
| 1839 | case 'b': |
| 1840 | case 'B': |
| 1841 | if (len >= 3) |
| 1842 | { |
| 1843 | p += 2; |
| 1844 | base = 2; |
| 1845 | len -= 2; |
| 1846 | } |
| 1847 | break; |
| 1848 | |
| 1849 | case 't': |
| 1850 | case 'T': |
| 1851 | case 'd': |
| 1852 | case 'D': |
| 1853 | if (len >= 3) |
| 1854 | { |
| 1855 | p += 2; |
| 1856 | base = 10; |
| 1857 | len -= 2; |
| 1858 | } |
| 1859 | break; |
| 1860 | |
| 1861 | default: |
| 1862 | base = 8; |
| 1863 | break; |
| 1864 | } |
| 1865 | |
| 1866 | while (len-- > 0) |
| 1867 | { |
| 1868 | c = *p++; |
| 1869 | if (c >= 'A' && c <= 'Z') |
| 1870 | c += 'a' - 'A'; |
| 1871 | if (c != 'l' && c != 'u') |
| 1872 | n *= base; |
| 1873 | if (c >= '0' && c <= '9') |
| 1874 | { |
| 1875 | if (found_suffix) |
| 1876 | return ERROR; |
| 1877 | n += i = c - '0'; |
| 1878 | } |
| 1879 | else |
| 1880 | { |
| 1881 | if (base > 10 && c >= 'a' && c <= 'f') |
| 1882 | { |
| 1883 | if (found_suffix) |
| 1884 | return ERROR; |
| 1885 | n += i = c - 'a' + 10; |
| 1886 | } |
| 1887 | else if (c == 'l') |
| 1888 | { |
| 1889 | ++long_p; |
| 1890 | found_suffix = 1; |
| 1891 | } |
| 1892 | else if (c == 'u') |
| 1893 | { |
| 1894 | unsigned_p = 1; |
| 1895 | found_suffix = 1; |
| 1896 | } |
| 1897 | else |
| 1898 | return ERROR; /* Char not a digit */ |
| 1899 | } |
| 1900 | if (i >= base) |
| 1901 | return ERROR; /* Invalid digit in this base */ |
| 1902 | |
| 1903 | /* Portably test for overflow (only works for nonzero values, so make |
| 1904 | a second check for zero). FIXME: Can't we just make n and prevn |
| 1905 | unsigned and avoid this? */ |
| 1906 | if (c != 'l' && c != 'u' && (prevn >= n) && n != 0) |
| 1907 | unsigned_p = 1; /* Try something unsigned */ |
| 1908 | |
| 1909 | /* Portably test for unsigned overflow. |
| 1910 | FIXME: This check is wrong; for example it doesn't find overflow |
| 1911 | on 0x123456789 when LONGEST is 32 bits. */ |
| 1912 | if (c != 'l' && c != 'u' && n != 0) |
| 1913 | { |
| 1914 | if ((unsigned_p && (ULONGEST) prevn >= (ULONGEST) n)) |
| 1915 | error (_("Numeric constant too large.")); |
| 1916 | } |
| 1917 | prevn = n; |
| 1918 | } |
| 1919 | |
| 1920 | /* An integer constant is an int, a long, or a long long. An L |
| 1921 | suffix forces it to be long; an LL suffix forces it to be long |
| 1922 | long. If not forced to a larger size, it gets the first type of |
| 1923 | the above that it fits in. To figure out whether it fits, we |
| 1924 | shift it right and see whether anything remains. Note that we |
| 1925 | can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one |
| 1926 | operation, because many compilers will warn about such a shift |
| 1927 | (which always produces a zero result). Sometimes gdbarch_int_bit |
| 1928 | or gdbarch_long_bit will be that big, sometimes not. To deal with |
| 1929 | the case where it is we just always shift the value more than |
| 1930 | once, with fewer bits each time. */ |
| 1931 | |
| 1932 | un = (ULONGEST)n >> 2; |
| 1933 | if (long_p == 0 |
| 1934 | && (un >> (gdbarch_int_bit (parse_gdbarch (par_state)) - 2)) == 0) |
| 1935 | { |
| 1936 | high_bit |
| 1937 | = ((ULONGEST)1) << (gdbarch_int_bit (parse_gdbarch (par_state)) - 1); |
| 1938 | |
| 1939 | /* A large decimal (not hex or octal) constant (between INT_MAX |
| 1940 | and UINT_MAX) is a long or unsigned long, according to ANSI, |
| 1941 | never an unsigned int, but this code treats it as unsigned |
| 1942 | int. This probably should be fixed. GCC gives a warning on |
| 1943 | such constants. */ |
| 1944 | |
| 1945 | unsigned_type = parse_type (par_state)->builtin_unsigned_int; |
| 1946 | signed_type = parse_type (par_state)->builtin_int; |
| 1947 | } |
| 1948 | else if (long_p <= 1 |
| 1949 | && (un >> (gdbarch_long_bit (parse_gdbarch (par_state)) - 2)) == 0) |
| 1950 | { |
| 1951 | high_bit |
| 1952 | = ((ULONGEST)1) << (gdbarch_long_bit (parse_gdbarch (par_state)) - 1); |
| 1953 | unsigned_type = parse_type (par_state)->builtin_unsigned_long; |
| 1954 | signed_type = parse_type (par_state)->builtin_long; |
| 1955 | } |
| 1956 | else |
| 1957 | { |
| 1958 | int shift; |
| 1959 | if (sizeof (ULONGEST) * HOST_CHAR_BIT |
| 1960 | < gdbarch_long_long_bit (parse_gdbarch (par_state))) |
| 1961 | /* A long long does not fit in a LONGEST. */ |
| 1962 | shift = (sizeof (ULONGEST) * HOST_CHAR_BIT - 1); |
| 1963 | else |
| 1964 | shift = (gdbarch_long_long_bit (parse_gdbarch (par_state)) - 1); |
| 1965 | high_bit = (ULONGEST) 1 << shift; |
| 1966 | unsigned_type = parse_type (par_state)->builtin_unsigned_long_long; |
| 1967 | signed_type = parse_type (par_state)->builtin_long_long; |
| 1968 | } |
| 1969 | |
| 1970 | putithere->typed_val_int.val = n; |
| 1971 | |
| 1972 | /* If the high bit of the worked out type is set then this number |
| 1973 | has to be unsigned. */ |
| 1974 | |
| 1975 | if (unsigned_p || (n & high_bit)) |
| 1976 | { |
| 1977 | putithere->typed_val_int.type = unsigned_type; |
| 1978 | } |
| 1979 | else |
| 1980 | { |
| 1981 | putithere->typed_val_int.type = signed_type; |
| 1982 | } |
| 1983 | |
| 1984 | return INT; |
| 1985 | } |
| 1986 | |
| 1987 | /* Temporary obstack used for holding strings. */ |
| 1988 | static struct obstack tempbuf; |
| 1989 | static int tempbuf_init; |
| 1990 | |
| 1991 | /* Parse a C escape sequence. The initial backslash of the sequence |
| 1992 | is at (*PTR)[-1]. *PTR will be updated to point to just after the |
| 1993 | last character of the sequence. If OUTPUT is not NULL, the |
| 1994 | translated form of the escape sequence will be written there. If |
| 1995 | OUTPUT is NULL, no output is written and the call will only affect |
| 1996 | *PTR. If an escape sequence is expressed in target bytes, then the |
| 1997 | entire sequence will simply be copied to OUTPUT. Return 1 if any |
| 1998 | character was emitted, 0 otherwise. */ |
| 1999 | |
| 2000 | int |
| 2001 | c_parse_escape (const char **ptr, struct obstack *output) |
| 2002 | { |
| 2003 | const char *tokptr = *ptr; |
| 2004 | int result = 1; |
| 2005 | |
| 2006 | /* Some escape sequences undergo character set conversion. Those we |
| 2007 | translate here. */ |
| 2008 | switch (*tokptr) |
| 2009 | { |
| 2010 | /* Hex escapes do not undergo character set conversion, so keep |
| 2011 | the escape sequence for later. */ |
| 2012 | case 'x': |
| 2013 | if (output) |
| 2014 | obstack_grow_str (output, "\\x"); |
| 2015 | ++tokptr; |
| 2016 | if (!isxdigit (*tokptr)) |
| 2017 | error (_("\\x escape without a following hex digit")); |
| 2018 | while (isxdigit (*tokptr)) |
| 2019 | { |
| 2020 | if (output) |
| 2021 | obstack_1grow (output, *tokptr); |
| 2022 | ++tokptr; |
| 2023 | } |
| 2024 | break; |
| 2025 | |
| 2026 | /* Octal escapes do not undergo character set conversion, so |
| 2027 | keep the escape sequence for later. */ |
| 2028 | case '0': |
| 2029 | case '1': |
| 2030 | case '2': |
| 2031 | case '3': |
| 2032 | case '4': |
| 2033 | case '5': |
| 2034 | case '6': |
| 2035 | case '7': |
| 2036 | { |
| 2037 | int i; |
| 2038 | if (output) |
| 2039 | obstack_grow_str (output, "\\"); |
| 2040 | for (i = 0; |
| 2041 | i < 3 && isdigit (*tokptr) && *tokptr != '8' && *tokptr != '9'; |
| 2042 | ++i) |
| 2043 | { |
| 2044 | if (output) |
| 2045 | obstack_1grow (output, *tokptr); |
| 2046 | ++tokptr; |
| 2047 | } |
| 2048 | } |
| 2049 | break; |
| 2050 | |
| 2051 | /* We handle UCNs later. We could handle them here, but that |
| 2052 | would mean a spurious error in the case where the UCN could |
| 2053 | be converted to the target charset but not the host |
| 2054 | charset. */ |
| 2055 | case 'u': |
| 2056 | case 'U': |
| 2057 | { |
| 2058 | char c = *tokptr; |
| 2059 | int i, len = c == 'U' ? 8 : 4; |
| 2060 | if (output) |
| 2061 | { |
| 2062 | obstack_1grow (output, '\\'); |
| 2063 | obstack_1grow (output, *tokptr); |
| 2064 | } |
| 2065 | ++tokptr; |
| 2066 | if (!isxdigit (*tokptr)) |
| 2067 | error (_("\\%c escape without a following hex digit"), c); |
| 2068 | for (i = 0; i < len && isxdigit (*tokptr); ++i) |
| 2069 | { |
| 2070 | if (output) |
| 2071 | obstack_1grow (output, *tokptr); |
| 2072 | ++tokptr; |
| 2073 | } |
| 2074 | } |
| 2075 | break; |
| 2076 | |
| 2077 | /* We must pass backslash through so that it does not |
| 2078 | cause quoting during the second expansion. */ |
| 2079 | case '\\': |
| 2080 | if (output) |
| 2081 | obstack_grow_str (output, "\\\\"); |
| 2082 | ++tokptr; |
| 2083 | break; |
| 2084 | |
| 2085 | /* Escapes which undergo conversion. */ |
| 2086 | case 'a': |
| 2087 | if (output) |
| 2088 | obstack_1grow (output, '\a'); |
| 2089 | ++tokptr; |
| 2090 | break; |
| 2091 | case 'b': |
| 2092 | if (output) |
| 2093 | obstack_1grow (output, '\b'); |
| 2094 | ++tokptr; |
| 2095 | break; |
| 2096 | case 'f': |
| 2097 | if (output) |
| 2098 | obstack_1grow (output, '\f'); |
| 2099 | ++tokptr; |
| 2100 | break; |
| 2101 | case 'n': |
| 2102 | if (output) |
| 2103 | obstack_1grow (output, '\n'); |
| 2104 | ++tokptr; |
| 2105 | break; |
| 2106 | case 'r': |
| 2107 | if (output) |
| 2108 | obstack_1grow (output, '\r'); |
| 2109 | ++tokptr; |
| 2110 | break; |
| 2111 | case 't': |
| 2112 | if (output) |
| 2113 | obstack_1grow (output, '\t'); |
| 2114 | ++tokptr; |
| 2115 | break; |
| 2116 | case 'v': |
| 2117 | if (output) |
| 2118 | obstack_1grow (output, '\v'); |
| 2119 | ++tokptr; |
| 2120 | break; |
| 2121 | |
| 2122 | /* GCC extension. */ |
| 2123 | case 'e': |
| 2124 | if (output) |
| 2125 | obstack_1grow (output, HOST_ESCAPE_CHAR); |
| 2126 | ++tokptr; |
| 2127 | break; |
| 2128 | |
| 2129 | /* Backslash-newline expands to nothing at all. */ |
| 2130 | case '\n': |
| 2131 | ++tokptr; |
| 2132 | result = 0; |
| 2133 | break; |
| 2134 | |
| 2135 | /* A few escapes just expand to the character itself. */ |
| 2136 | case '\'': |
| 2137 | case '\"': |
| 2138 | case '?': |
| 2139 | /* GCC extensions. */ |
| 2140 | case '(': |
| 2141 | case '{': |
| 2142 | case '[': |
| 2143 | case '%': |
| 2144 | /* Unrecognized escapes turn into the character itself. */ |
| 2145 | default: |
| 2146 | if (output) |
| 2147 | obstack_1grow (output, *tokptr); |
| 2148 | ++tokptr; |
| 2149 | break; |
| 2150 | } |
| 2151 | *ptr = tokptr; |
| 2152 | return result; |
| 2153 | } |
| 2154 | |
| 2155 | /* Parse a string or character literal from TOKPTR. The string or |
| 2156 | character may be wide or unicode. *OUTPTR is set to just after the |
| 2157 | end of the literal in the input string. The resulting token is |
| 2158 | stored in VALUE. This returns a token value, either STRING or |
| 2159 | CHAR, depending on what was parsed. *HOST_CHARS is set to the |
| 2160 | number of host characters in the literal. */ |
| 2161 | |
| 2162 | static int |
| 2163 | parse_string_or_char (const char *tokptr, const char **outptr, |
| 2164 | struct typed_stoken *value, int *host_chars) |
| 2165 | { |
| 2166 | int quote; |
| 2167 | enum c_string_type type; |
| 2168 | int is_objc = 0; |
| 2169 | |
| 2170 | /* Build the gdb internal form of the input string in tempbuf. Note |
| 2171 | that the buffer is null byte terminated *only* for the |
| 2172 | convenience of debugging gdb itself and printing the buffer |
| 2173 | contents when the buffer contains no embedded nulls. Gdb does |
| 2174 | not depend upon the buffer being null byte terminated, it uses |
| 2175 | the length string instead. This allows gdb to handle C strings |
| 2176 | (as well as strings in other languages) with embedded null |
| 2177 | bytes */ |
| 2178 | |
| 2179 | if (!tempbuf_init) |
| 2180 | tempbuf_init = 1; |
| 2181 | else |
| 2182 | obstack_free (&tempbuf, NULL); |
| 2183 | obstack_init (&tempbuf); |
| 2184 | |
| 2185 | /* Record the string type. */ |
| 2186 | if (*tokptr == 'L') |
| 2187 | { |
| 2188 | type = C_WIDE_STRING; |
| 2189 | ++tokptr; |
| 2190 | } |
| 2191 | else if (*tokptr == 'u') |
| 2192 | { |
| 2193 | type = C_STRING_16; |
| 2194 | ++tokptr; |
| 2195 | } |
| 2196 | else if (*tokptr == 'U') |
| 2197 | { |
| 2198 | type = C_STRING_32; |
| 2199 | ++tokptr; |
| 2200 | } |
| 2201 | else if (*tokptr == '@') |
| 2202 | { |
| 2203 | /* An Objective C string. */ |
| 2204 | is_objc = 1; |
| 2205 | type = C_STRING; |
| 2206 | ++tokptr; |
| 2207 | } |
| 2208 | else |
| 2209 | type = C_STRING; |
| 2210 | |
| 2211 | /* Skip the quote. */ |
| 2212 | quote = *tokptr; |
| 2213 | if (quote == '\'') |
| 2214 | type |= C_CHAR; |
| 2215 | ++tokptr; |
| 2216 | |
| 2217 | *host_chars = 0; |
| 2218 | |
| 2219 | while (*tokptr) |
| 2220 | { |
| 2221 | char c = *tokptr; |
| 2222 | if (c == '\\') |
| 2223 | { |
| 2224 | ++tokptr; |
| 2225 | *host_chars += c_parse_escape (&tokptr, &tempbuf); |
| 2226 | } |
| 2227 | else if (c == quote) |
| 2228 | break; |
| 2229 | else |
| 2230 | { |
| 2231 | obstack_1grow (&tempbuf, c); |
| 2232 | ++tokptr; |
| 2233 | /* FIXME: this does the wrong thing with multi-byte host |
| 2234 | characters. We could use mbrlen here, but that would |
| 2235 | make "set host-charset" a bit less useful. */ |
| 2236 | ++*host_chars; |
| 2237 | } |
| 2238 | } |
| 2239 | |
| 2240 | if (*tokptr != quote) |
| 2241 | { |
| 2242 | if (quote == '"') |
| 2243 | error (_("Unterminated string in expression.")); |
| 2244 | else |
| 2245 | error (_("Unmatched single quote.")); |
| 2246 | } |
| 2247 | ++tokptr; |
| 2248 | |
| 2249 | value->type = type; |
| 2250 | value->ptr = obstack_base (&tempbuf); |
| 2251 | value->length = obstack_object_size (&tempbuf); |
| 2252 | |
| 2253 | *outptr = tokptr; |
| 2254 | |
| 2255 | return quote == '"' ? (is_objc ? NSSTRING : STRING) : CHAR; |
| 2256 | } |
| 2257 | |
| 2258 | /* This is used to associate some attributes with a token. */ |
| 2259 | |
| 2260 | enum token_flags |
| 2261 | { |
| 2262 | /* If this bit is set, the token is C++-only. */ |
| 2263 | |
| 2264 | FLAG_CXX = 1, |
| 2265 | |
| 2266 | /* If this bit is set, the token is conditional: if there is a |
| 2267 | symbol of the same name, then the token is a symbol; otherwise, |
| 2268 | the token is a keyword. */ |
| 2269 | |
| 2270 | FLAG_SHADOW = 2 |
| 2271 | }; |
| 2272 | |
| 2273 | struct token |
| 2274 | { |
| 2275 | char *oper; |
| 2276 | int token; |
| 2277 | enum exp_opcode opcode; |
| 2278 | enum token_flags flags; |
| 2279 | }; |
| 2280 | |
| 2281 | static const struct token tokentab3[] = |
| 2282 | { |
| 2283 | {">>=", ASSIGN_MODIFY, BINOP_RSH, 0}, |
| 2284 | {"<<=", ASSIGN_MODIFY, BINOP_LSH, 0}, |
| 2285 | {"->*", ARROW_STAR, BINOP_END, FLAG_CXX}, |
| 2286 | {"...", DOTDOTDOT, BINOP_END, 0} |
| 2287 | }; |
| 2288 | |
| 2289 | static const struct token tokentab2[] = |
| 2290 | { |
| 2291 | {"+=", ASSIGN_MODIFY, BINOP_ADD, 0}, |
| 2292 | {"-=", ASSIGN_MODIFY, BINOP_SUB, 0}, |
| 2293 | {"*=", ASSIGN_MODIFY, BINOP_MUL, 0}, |
| 2294 | {"/=", ASSIGN_MODIFY, BINOP_DIV, 0}, |
| 2295 | {"%=", ASSIGN_MODIFY, BINOP_REM, 0}, |
| 2296 | {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR, 0}, |
| 2297 | {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND, 0}, |
| 2298 | {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR, 0}, |
| 2299 | {"++", INCREMENT, BINOP_END, 0}, |
| 2300 | {"--", DECREMENT, BINOP_END, 0}, |
| 2301 | {"->", ARROW, BINOP_END, 0}, |
| 2302 | {"&&", ANDAND, BINOP_END, 0}, |
| 2303 | {"||", OROR, BINOP_END, 0}, |
| 2304 | /* "::" is *not* only C++: gdb overrides its meaning in several |
| 2305 | different ways, e.g., 'filename'::func, function::variable. */ |
| 2306 | {"::", COLONCOLON, BINOP_END, 0}, |
| 2307 | {"<<", LSH, BINOP_END, 0}, |
| 2308 | {">>", RSH, BINOP_END, 0}, |
| 2309 | {"==", EQUAL, BINOP_END, 0}, |
| 2310 | {"!=", NOTEQUAL, BINOP_END, 0}, |
| 2311 | {"<=", LEQ, BINOP_END, 0}, |
| 2312 | {">=", GEQ, BINOP_END, 0}, |
| 2313 | {".*", DOT_STAR, BINOP_END, FLAG_CXX} |
| 2314 | }; |
| 2315 | |
| 2316 | /* Identifier-like tokens. */ |
| 2317 | static const struct token ident_tokens[] = |
| 2318 | { |
| 2319 | {"unsigned", UNSIGNED, OP_NULL, 0}, |
| 2320 | {"template", TEMPLATE, OP_NULL, FLAG_CXX}, |
| 2321 | {"volatile", VOLATILE_KEYWORD, OP_NULL, 0}, |
| 2322 | {"struct", STRUCT, OP_NULL, 0}, |
| 2323 | {"signed", SIGNED_KEYWORD, OP_NULL, 0}, |
| 2324 | {"sizeof", SIZEOF, OP_NULL, 0}, |
| 2325 | {"double", DOUBLE_KEYWORD, OP_NULL, 0}, |
| 2326 | {"false", FALSEKEYWORD, OP_NULL, FLAG_CXX}, |
| 2327 | {"class", CLASS, OP_NULL, FLAG_CXX}, |
| 2328 | {"union", UNION, OP_NULL, 0}, |
| 2329 | {"short", SHORT, OP_NULL, 0}, |
| 2330 | {"const", CONST_KEYWORD, OP_NULL, 0}, |
| 2331 | {"enum", ENUM, OP_NULL, 0}, |
| 2332 | {"long", LONG, OP_NULL, 0}, |
| 2333 | {"true", TRUEKEYWORD, OP_NULL, FLAG_CXX}, |
| 2334 | {"int", INT_KEYWORD, OP_NULL, 0}, |
| 2335 | {"new", NEW, OP_NULL, FLAG_CXX}, |
| 2336 | {"delete", DELETE, OP_NULL, FLAG_CXX}, |
| 2337 | {"operator", OPERATOR, OP_NULL, FLAG_CXX}, |
| 2338 | |
| 2339 | {"and", ANDAND, BINOP_END, FLAG_CXX}, |
| 2340 | {"and_eq", ASSIGN_MODIFY, BINOP_BITWISE_AND, FLAG_CXX}, |
| 2341 | {"bitand", '&', OP_NULL, FLAG_CXX}, |
| 2342 | {"bitor", '|', OP_NULL, FLAG_CXX}, |
| 2343 | {"compl", '~', OP_NULL, FLAG_CXX}, |
| 2344 | {"not", '!', OP_NULL, FLAG_CXX}, |
| 2345 | {"not_eq", NOTEQUAL, BINOP_END, FLAG_CXX}, |
| 2346 | {"or", OROR, BINOP_END, FLAG_CXX}, |
| 2347 | {"or_eq", ASSIGN_MODIFY, BINOP_BITWISE_IOR, FLAG_CXX}, |
| 2348 | {"xor", '^', OP_NULL, FLAG_CXX}, |
| 2349 | {"xor_eq", ASSIGN_MODIFY, BINOP_BITWISE_XOR, FLAG_CXX}, |
| 2350 | |
| 2351 | {"const_cast", CONST_CAST, OP_NULL, FLAG_CXX }, |
| 2352 | {"dynamic_cast", DYNAMIC_CAST, OP_NULL, FLAG_CXX }, |
| 2353 | {"static_cast", STATIC_CAST, OP_NULL, FLAG_CXX }, |
| 2354 | {"reinterpret_cast", REINTERPRET_CAST, OP_NULL, FLAG_CXX }, |
| 2355 | |
| 2356 | {"__typeof__", TYPEOF, OP_TYPEOF, 0 }, |
| 2357 | {"__typeof", TYPEOF, OP_TYPEOF, 0 }, |
| 2358 | {"typeof", TYPEOF, OP_TYPEOF, FLAG_SHADOW }, |
| 2359 | {"__decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX }, |
| 2360 | {"decltype", DECLTYPE, OP_DECLTYPE, FLAG_CXX | FLAG_SHADOW }, |
| 2361 | |
| 2362 | {"typeid", TYPEID, OP_TYPEID, FLAG_CXX} |
| 2363 | }; |
| 2364 | |
| 2365 | /* When we find that lexptr (the global var defined in parse.c) is |
| 2366 | pointing at a macro invocation, we expand the invocation, and call |
| 2367 | scan_macro_expansion to save the old lexptr here and point lexptr |
| 2368 | into the expanded text. When we reach the end of that, we call |
| 2369 | end_macro_expansion to pop back to the value we saved here. The |
| 2370 | macro expansion code promises to return only fully-expanded text, |
| 2371 | so we don't need to "push" more than one level. |
| 2372 | |
| 2373 | This is disgusting, of course. It would be cleaner to do all macro |
| 2374 | expansion beforehand, and then hand that to lexptr. But we don't |
| 2375 | really know where the expression ends. Remember, in a command like |
| 2376 | |
| 2377 | (gdb) break *ADDRESS if CONDITION |
| 2378 | |
| 2379 | we evaluate ADDRESS in the scope of the current frame, but we |
| 2380 | evaluate CONDITION in the scope of the breakpoint's location. So |
| 2381 | it's simply wrong to try to macro-expand the whole thing at once. */ |
| 2382 | static const char *macro_original_text; |
| 2383 | |
| 2384 | /* We save all intermediate macro expansions on this obstack for the |
| 2385 | duration of a single parse. The expansion text may sometimes have |
| 2386 | to live past the end of the expansion, due to yacc lookahead. |
| 2387 | Rather than try to be clever about saving the data for a single |
| 2388 | token, we simply keep it all and delete it after parsing has |
| 2389 | completed. */ |
| 2390 | static struct obstack expansion_obstack; |
| 2391 | |
| 2392 | static void |
| 2393 | scan_macro_expansion (char *expansion) |
| 2394 | { |
| 2395 | char *copy; |
| 2396 | |
| 2397 | /* We'd better not be trying to push the stack twice. */ |
| 2398 | gdb_assert (! macro_original_text); |
| 2399 | |
| 2400 | /* Copy to the obstack, and then free the intermediate |
| 2401 | expansion. */ |
| 2402 | copy = obstack_copy0 (&expansion_obstack, expansion, strlen (expansion)); |
| 2403 | xfree (expansion); |
| 2404 | |
| 2405 | /* Save the old lexptr value, so we can return to it when we're done |
| 2406 | parsing the expanded text. */ |
| 2407 | macro_original_text = lexptr; |
| 2408 | lexptr = copy; |
| 2409 | } |
| 2410 | |
| 2411 | static int |
| 2412 | scanning_macro_expansion (void) |
| 2413 | { |
| 2414 | return macro_original_text != 0; |
| 2415 | } |
| 2416 | |
| 2417 | static void |
| 2418 | finished_macro_expansion (void) |
| 2419 | { |
| 2420 | /* There'd better be something to pop back to. */ |
| 2421 | gdb_assert (macro_original_text); |
| 2422 | |
| 2423 | /* Pop back to the original text. */ |
| 2424 | lexptr = macro_original_text; |
| 2425 | macro_original_text = 0; |
| 2426 | } |
| 2427 | |
| 2428 | static void |
| 2429 | scan_macro_cleanup (void *dummy) |
| 2430 | { |
| 2431 | if (macro_original_text) |
| 2432 | finished_macro_expansion (); |
| 2433 | |
| 2434 | obstack_free (&expansion_obstack, NULL); |
| 2435 | } |
| 2436 | |
| 2437 | /* Return true iff the token represents a C++ cast operator. */ |
| 2438 | |
| 2439 | static int |
| 2440 | is_cast_operator (const char *token, int len) |
| 2441 | { |
| 2442 | return (! strncmp (token, "dynamic_cast", len) |
| 2443 | || ! strncmp (token, "static_cast", len) |
| 2444 | || ! strncmp (token, "reinterpret_cast", len) |
| 2445 | || ! strncmp (token, "const_cast", len)); |
| 2446 | } |
| 2447 | |
| 2448 | /* The scope used for macro expansion. */ |
| 2449 | static struct macro_scope *expression_macro_scope; |
| 2450 | |
| 2451 | /* This is set if a NAME token appeared at the very end of the input |
| 2452 | string, with no whitespace separating the name from the EOF. This |
| 2453 | is used only when parsing to do field name completion. */ |
| 2454 | static int saw_name_at_eof; |
| 2455 | |
| 2456 | /* This is set if the previously-returned token was a structure |
| 2457 | operator -- either '.' or ARROW. This is used only when parsing to |
| 2458 | do field name completion. */ |
| 2459 | static int last_was_structop; |
| 2460 | |
| 2461 | /* Read one token, getting characters through lexptr. */ |
| 2462 | |
| 2463 | static int |
| 2464 | lex_one_token (struct parser_state *par_state, int *is_quoted_name) |
| 2465 | { |
| 2466 | int c; |
| 2467 | int namelen; |
| 2468 | unsigned int i; |
| 2469 | const char *tokstart; |
| 2470 | int saw_structop = last_was_structop; |
| 2471 | char *copy; |
| 2472 | |
| 2473 | last_was_structop = 0; |
| 2474 | *is_quoted_name = 0; |
| 2475 | |
| 2476 | retry: |
| 2477 | |
| 2478 | /* Check if this is a macro invocation that we need to expand. */ |
| 2479 | if (! scanning_macro_expansion ()) |
| 2480 | { |
| 2481 | char *expanded = macro_expand_next (&lexptr, |
| 2482 | standard_macro_lookup, |
| 2483 | expression_macro_scope); |
| 2484 | |
| 2485 | if (expanded) |
| 2486 | scan_macro_expansion (expanded); |
| 2487 | } |
| 2488 | |
| 2489 | prev_lexptr = lexptr; |
| 2490 | |
| 2491 | tokstart = lexptr; |
| 2492 | /* See if it is a special token of length 3. */ |
| 2493 | for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++) |
| 2494 | if (strncmp (tokstart, tokentab3[i].oper, 3) == 0) |
| 2495 | { |
| 2496 | if ((tokentab3[i].flags & FLAG_CXX) != 0 |
| 2497 | && parse_language (par_state)->la_language != language_cplus) |
| 2498 | break; |
| 2499 | |
| 2500 | lexptr += 3; |
| 2501 | yylval.opcode = tokentab3[i].opcode; |
| 2502 | return tokentab3[i].token; |
| 2503 | } |
| 2504 | |
| 2505 | /* See if it is a special token of length 2. */ |
| 2506 | for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++) |
| 2507 | if (strncmp (tokstart, tokentab2[i].oper, 2) == 0) |
| 2508 | { |
| 2509 | if ((tokentab2[i].flags & FLAG_CXX) != 0 |
| 2510 | && parse_language (par_state)->la_language != language_cplus) |
| 2511 | break; |
| 2512 | |
| 2513 | lexptr += 2; |
| 2514 | yylval.opcode = tokentab2[i].opcode; |
| 2515 | if (parse_completion && tokentab2[i].token == ARROW) |
| 2516 | last_was_structop = 1; |
| 2517 | return tokentab2[i].token; |
| 2518 | } |
| 2519 | |
| 2520 | switch (c = *tokstart) |
| 2521 | { |
| 2522 | case 0: |
| 2523 | /* If we were just scanning the result of a macro expansion, |
| 2524 | then we need to resume scanning the original text. |
| 2525 | If we're parsing for field name completion, and the previous |
| 2526 | token allows such completion, return a COMPLETE token. |
| 2527 | Otherwise, we were already scanning the original text, and |
| 2528 | we're really done. */ |
| 2529 | if (scanning_macro_expansion ()) |
| 2530 | { |
| 2531 | finished_macro_expansion (); |
| 2532 | goto retry; |
| 2533 | } |
| 2534 | else if (saw_name_at_eof) |
| 2535 | { |
| 2536 | saw_name_at_eof = 0; |
| 2537 | return COMPLETE; |
| 2538 | } |
| 2539 | else if (saw_structop) |
| 2540 | return COMPLETE; |
| 2541 | else |
| 2542 | return 0; |
| 2543 | |
| 2544 | case ' ': |
| 2545 | case '\t': |
| 2546 | case '\n': |
| 2547 | lexptr++; |
| 2548 | goto retry; |
| 2549 | |
| 2550 | case '[': |
| 2551 | case '(': |
| 2552 | paren_depth++; |
| 2553 | lexptr++; |
| 2554 | if (parse_language (par_state)->la_language == language_objc |
| 2555 | && c == '[') |
| 2556 | return OBJC_LBRAC; |
| 2557 | return c; |
| 2558 | |
| 2559 | case ']': |
| 2560 | case ')': |
| 2561 | if (paren_depth == 0) |
| 2562 | return 0; |
| 2563 | paren_depth--; |
| 2564 | lexptr++; |
| 2565 | return c; |
| 2566 | |
| 2567 | case ',': |
| 2568 | if (comma_terminates |
| 2569 | && paren_depth == 0 |
| 2570 | && ! scanning_macro_expansion ()) |
| 2571 | return 0; |
| 2572 | lexptr++; |
| 2573 | return c; |
| 2574 | |
| 2575 | case '.': |
| 2576 | /* Might be a floating point number. */ |
| 2577 | if (lexptr[1] < '0' || lexptr[1] > '9') |
| 2578 | { |
| 2579 | if (parse_completion) |
| 2580 | last_was_structop = 1; |
| 2581 | goto symbol; /* Nope, must be a symbol. */ |
| 2582 | } |
| 2583 | /* FALL THRU into number case. */ |
| 2584 | |
| 2585 | case '0': |
| 2586 | case '1': |
| 2587 | case '2': |
| 2588 | case '3': |
| 2589 | case '4': |
| 2590 | case '5': |
| 2591 | case '6': |
| 2592 | case '7': |
| 2593 | case '8': |
| 2594 | case '9': |
| 2595 | { |
| 2596 | /* It's a number. */ |
| 2597 | int got_dot = 0, got_e = 0, toktype; |
| 2598 | const char *p = tokstart; |
| 2599 | int hex = input_radix > 10; |
| 2600 | |
| 2601 | if (c == '0' && (p[1] == 'x' || p[1] == 'X')) |
| 2602 | { |
| 2603 | p += 2; |
| 2604 | hex = 1; |
| 2605 | } |
| 2606 | else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D')) |
| 2607 | { |
| 2608 | p += 2; |
| 2609 | hex = 0; |
| 2610 | } |
| 2611 | |
| 2612 | for (;; ++p) |
| 2613 | { |
| 2614 | /* This test includes !hex because 'e' is a valid hex digit |
| 2615 | and thus does not indicate a floating point number when |
| 2616 | the radix is hex. */ |
| 2617 | if (!hex && !got_e && (*p == 'e' || *p == 'E')) |
| 2618 | got_dot = got_e = 1; |
| 2619 | /* This test does not include !hex, because a '.' always indicates |
| 2620 | a decimal floating point number regardless of the radix. */ |
| 2621 | else if (!got_dot && *p == '.') |
| 2622 | got_dot = 1; |
| 2623 | else if (got_e && (p[-1] == 'e' || p[-1] == 'E') |
| 2624 | && (*p == '-' || *p == '+')) |
| 2625 | /* This is the sign of the exponent, not the end of the |
| 2626 | number. */ |
| 2627 | continue; |
| 2628 | /* We will take any letters or digits. parse_number will |
| 2629 | complain if past the radix, or if L or U are not final. */ |
| 2630 | else if ((*p < '0' || *p > '9') |
| 2631 | && ((*p < 'a' || *p > 'z') |
| 2632 | && (*p < 'A' || *p > 'Z'))) |
| 2633 | break; |
| 2634 | } |
| 2635 | toktype = parse_number (par_state, tokstart, p - tokstart, |
| 2636 | got_dot|got_e, &yylval); |
| 2637 | if (toktype == ERROR) |
| 2638 | { |
| 2639 | char *err_copy = (char *) alloca (p - tokstart + 1); |
| 2640 | |
| 2641 | memcpy (err_copy, tokstart, p - tokstart); |
| 2642 | err_copy[p - tokstart] = 0; |
| 2643 | error (_("Invalid number \"%s\"."), err_copy); |
| 2644 | } |
| 2645 | lexptr = p; |
| 2646 | return toktype; |
| 2647 | } |
| 2648 | |
| 2649 | case '@': |
| 2650 | { |
| 2651 | const char *p = &tokstart[1]; |
| 2652 | size_t len = strlen ("entry"); |
| 2653 | |
| 2654 | if (parse_language (par_state)->la_language == language_objc) |
| 2655 | { |
| 2656 | size_t len = strlen ("selector"); |
| 2657 | |
| 2658 | if (strncmp (p, "selector", len) == 0 |
| 2659 | && (p[len] == '\0' || isspace (p[len]))) |
| 2660 | { |
| 2661 | lexptr = p + len; |
| 2662 | return SELECTOR; |
| 2663 | } |
| 2664 | else if (*p == '"') |
| 2665 | goto parse_string; |
| 2666 | } |
| 2667 | |
| 2668 | while (isspace (*p)) |
| 2669 | p++; |
| 2670 | if (strncmp (p, "entry", len) == 0 && !isalnum (p[len]) |
| 2671 | && p[len] != '_') |
| 2672 | { |
| 2673 | lexptr = &p[len]; |
| 2674 | return ENTRY; |
| 2675 | } |
| 2676 | } |
| 2677 | /* FALLTHRU */ |
| 2678 | case '+': |
| 2679 | case '-': |
| 2680 | case '*': |
| 2681 | case '/': |
| 2682 | case '%': |
| 2683 | case '|': |
| 2684 | case '&': |
| 2685 | case '^': |
| 2686 | case '~': |
| 2687 | case '!': |
| 2688 | case '<': |
| 2689 | case '>': |
| 2690 | case '?': |
| 2691 | case ':': |
| 2692 | case '=': |
| 2693 | case '{': |
| 2694 | case '}': |
| 2695 | symbol: |
| 2696 | lexptr++; |
| 2697 | return c; |
| 2698 | |
| 2699 | case 'L': |
| 2700 | case 'u': |
| 2701 | case 'U': |
| 2702 | if (tokstart[1] != '"' && tokstart[1] != '\'') |
| 2703 | break; |
| 2704 | /* Fall through. */ |
| 2705 | case '\'': |
| 2706 | case '"': |
| 2707 | |
| 2708 | parse_string: |
| 2709 | { |
| 2710 | int host_len; |
| 2711 | int result = parse_string_or_char (tokstart, &lexptr, &yylval.tsval, |
| 2712 | &host_len); |
| 2713 | if (result == CHAR) |
| 2714 | { |
| 2715 | if (host_len == 0) |
| 2716 | error (_("Empty character constant.")); |
| 2717 | else if (host_len > 2 && c == '\'') |
| 2718 | { |
| 2719 | ++tokstart; |
| 2720 | namelen = lexptr - tokstart - 1; |
| 2721 | *is_quoted_name = 1; |
| 2722 | |
| 2723 | goto tryname; |
| 2724 | } |
| 2725 | else if (host_len > 1) |
| 2726 | error (_("Invalid character constant.")); |
| 2727 | } |
| 2728 | return result; |
| 2729 | } |
| 2730 | } |
| 2731 | |
| 2732 | if (!(c == '_' || c == '$' |
| 2733 | || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))) |
| 2734 | /* We must have come across a bad character (e.g. ';'). */ |
| 2735 | error (_("Invalid character '%c' in expression."), c); |
| 2736 | |
| 2737 | /* It's a name. See how long it is. */ |
| 2738 | namelen = 0; |
| 2739 | for (c = tokstart[namelen]; |
| 2740 | (c == '_' || c == '$' || (c >= '0' && c <= '9') |
| 2741 | || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');) |
| 2742 | { |
| 2743 | /* Template parameter lists are part of the name. |
| 2744 | FIXME: This mishandles `print $a<4&&$a>3'. */ |
| 2745 | |
| 2746 | if (c == '<') |
| 2747 | { |
| 2748 | if (! is_cast_operator (tokstart, namelen)) |
| 2749 | { |
| 2750 | /* Scan ahead to get rest of the template specification. Note |
| 2751 | that we look ahead only when the '<' adjoins non-whitespace |
| 2752 | characters; for comparison expressions, e.g. "a < b > c", |
| 2753 | there must be spaces before the '<', etc. */ |
| 2754 | const char *p = find_template_name_end (tokstart + namelen); |
| 2755 | |
| 2756 | if (p) |
| 2757 | namelen = p - tokstart; |
| 2758 | } |
| 2759 | break; |
| 2760 | } |
| 2761 | c = tokstart[++namelen]; |
| 2762 | } |
| 2763 | |
| 2764 | /* The token "if" terminates the expression and is NOT removed from |
| 2765 | the input stream. It doesn't count if it appears in the |
| 2766 | expansion of a macro. */ |
| 2767 | if (namelen == 2 |
| 2768 | && tokstart[0] == 'i' |
| 2769 | && tokstart[1] == 'f' |
| 2770 | && ! scanning_macro_expansion ()) |
| 2771 | { |
| 2772 | return 0; |
| 2773 | } |
| 2774 | |
| 2775 | /* For the same reason (breakpoint conditions), "thread N" |
| 2776 | terminates the expression. "thread" could be an identifier, but |
| 2777 | an identifier is never followed by a number without intervening |
| 2778 | punctuation. "task" is similar. Handle abbreviations of these, |
| 2779 | similarly to breakpoint.c:find_condition_and_thread. */ |
| 2780 | if (namelen >= 1 |
| 2781 | && (strncmp (tokstart, "thread", namelen) == 0 |
| 2782 | || strncmp (tokstart, "task", namelen) == 0) |
| 2783 | && (tokstart[namelen] == ' ' || tokstart[namelen] == '\t') |
| 2784 | && ! scanning_macro_expansion ()) |
| 2785 | { |
| 2786 | const char *p = tokstart + namelen + 1; |
| 2787 | |
| 2788 | while (*p == ' ' || *p == '\t') |
| 2789 | p++; |
| 2790 | if (*p >= '0' && *p <= '9') |
| 2791 | return 0; |
| 2792 | } |
| 2793 | |
| 2794 | lexptr += namelen; |
| 2795 | |
| 2796 | tryname: |
| 2797 | |
| 2798 | yylval.sval.ptr = tokstart; |
| 2799 | yylval.sval.length = namelen; |
| 2800 | |
| 2801 | /* Catch specific keywords. */ |
| 2802 | copy = copy_name (yylval.sval); |
| 2803 | for (i = 0; i < sizeof ident_tokens / sizeof ident_tokens[0]; i++) |
| 2804 | if (strcmp (copy, ident_tokens[i].oper) == 0) |
| 2805 | { |
| 2806 | if ((ident_tokens[i].flags & FLAG_CXX) != 0 |
| 2807 | && parse_language (par_state)->la_language != language_cplus) |
| 2808 | break; |
| 2809 | |
| 2810 | if ((ident_tokens[i].flags & FLAG_SHADOW) != 0) |
| 2811 | { |
| 2812 | struct field_of_this_result is_a_field_of_this; |
| 2813 | |
| 2814 | if (lookup_symbol (copy, expression_context_block, |
| 2815 | VAR_DOMAIN, |
| 2816 | (parse_language (par_state)->la_language |
| 2817 | == language_cplus ? &is_a_field_of_this |
| 2818 | : NULL)).symbol |
| 2819 | != NULL) |
| 2820 | { |
| 2821 | /* The keyword is shadowed. */ |
| 2822 | break; |
| 2823 | } |
| 2824 | } |
| 2825 | |
| 2826 | /* It is ok to always set this, even though we don't always |
| 2827 | strictly need to. */ |
| 2828 | yylval.opcode = ident_tokens[i].opcode; |
| 2829 | return ident_tokens[i].token; |
| 2830 | } |
| 2831 | |
| 2832 | if (*tokstart == '$') |
| 2833 | return VARIABLE; |
| 2834 | |
| 2835 | if (parse_completion && *lexptr == '\0') |
| 2836 | saw_name_at_eof = 1; |
| 2837 | |
| 2838 | yylval.ssym.stoken = yylval.sval; |
| 2839 | yylval.ssym.sym.symbol = NULL; |
| 2840 | yylval.ssym.sym.block = NULL; |
| 2841 | yylval.ssym.is_a_field_of_this = 0; |
| 2842 | return NAME; |
| 2843 | } |
| 2844 | |
| 2845 | /* An object of this type is pushed on a FIFO by the "outer" lexer. */ |
| 2846 | typedef struct |
| 2847 | { |
| 2848 | int token; |
| 2849 | YYSTYPE value; |
| 2850 | } token_and_value; |
| 2851 | |
| 2852 | DEF_VEC_O (token_and_value); |
| 2853 | |
| 2854 | /* A FIFO of tokens that have been read but not yet returned to the |
| 2855 | parser. */ |
| 2856 | static VEC (token_and_value) *token_fifo; |
| 2857 | |
| 2858 | /* Non-zero if the lexer should return tokens from the FIFO. */ |
| 2859 | static int popping; |
| 2860 | |
| 2861 | /* Temporary storage for c_lex; this holds symbol names as they are |
| 2862 | built up. */ |
| 2863 | static struct obstack name_obstack; |
| 2864 | |
| 2865 | /* Classify a NAME token. The contents of the token are in `yylval'. |
| 2866 | Updates yylval and returns the new token type. BLOCK is the block |
| 2867 | in which lookups start; this can be NULL to mean the global scope. |
| 2868 | IS_QUOTED_NAME is non-zero if the name token was originally quoted |
| 2869 | in single quotes. */ |
| 2870 | |
| 2871 | static int |
| 2872 | classify_name (struct parser_state *par_state, const struct block *block, |
| 2873 | int is_quoted_name) |
| 2874 | { |
| 2875 | struct block_symbol bsym; |
| 2876 | char *copy; |
| 2877 | struct field_of_this_result is_a_field_of_this; |
| 2878 | |
| 2879 | copy = copy_name (yylval.sval); |
| 2880 | |
| 2881 | /* Initialize this in case we *don't* use it in this call; that way |
| 2882 | we can refer to it unconditionally below. */ |
| 2883 | memset (&is_a_field_of_this, 0, sizeof (is_a_field_of_this)); |
| 2884 | |
| 2885 | bsym = lookup_symbol (copy, block, VAR_DOMAIN, |
| 2886 | parse_language (par_state)->la_name_of_this |
| 2887 | ? &is_a_field_of_this : NULL); |
| 2888 | |
| 2889 | if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_BLOCK) |
| 2890 | { |
| 2891 | yylval.ssym.sym = bsym; |
| 2892 | yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL; |
| 2893 | return BLOCKNAME; |
| 2894 | } |
| 2895 | else if (!bsym.symbol) |
| 2896 | { |
| 2897 | /* If we found a field of 'this', we might have erroneously |
| 2898 | found a constructor where we wanted a type name. Handle this |
| 2899 | case by noticing that we found a constructor and then look up |
| 2900 | the type tag instead. */ |
| 2901 | if (is_a_field_of_this.type != NULL |
| 2902 | && is_a_field_of_this.fn_field != NULL |
| 2903 | && TYPE_FN_FIELD_CONSTRUCTOR (is_a_field_of_this.fn_field->fn_fields, |
| 2904 | 0)) |
| 2905 | { |
| 2906 | struct field_of_this_result inner_is_a_field_of_this; |
| 2907 | |
| 2908 | bsym = lookup_symbol (copy, block, STRUCT_DOMAIN, |
| 2909 | &inner_is_a_field_of_this); |
| 2910 | if (bsym.symbol != NULL) |
| 2911 | { |
| 2912 | yylval.tsym.type = SYMBOL_TYPE (bsym.symbol); |
| 2913 | return TYPENAME; |
| 2914 | } |
| 2915 | } |
| 2916 | |
| 2917 | /* If we found a field, then we want to prefer it over a |
| 2918 | filename. However, if the name was quoted, then it is better |
| 2919 | to check for a filename or a block, since this is the only |
| 2920 | way the user has of requiring the extension to be used. */ |
| 2921 | if (is_a_field_of_this.type == NULL || is_quoted_name) |
| 2922 | { |
| 2923 | /* See if it's a file name. */ |
| 2924 | struct symtab *symtab; |
| 2925 | |
| 2926 | symtab = lookup_symtab (copy); |
| 2927 | if (symtab) |
| 2928 | { |
| 2929 | yylval.bval = BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symtab), |
| 2930 | STATIC_BLOCK); |
| 2931 | return FILENAME; |
| 2932 | } |
| 2933 | } |
| 2934 | } |
| 2935 | |
| 2936 | if (bsym.symbol && SYMBOL_CLASS (bsym.symbol) == LOC_TYPEDEF) |
| 2937 | { |
| 2938 | yylval.tsym.type = SYMBOL_TYPE (bsym.symbol); |
| 2939 | return TYPENAME; |
| 2940 | } |
| 2941 | |
| 2942 | /* See if it's an ObjC classname. */ |
| 2943 | if (parse_language (par_state)->la_language == language_objc && !bsym.symbol) |
| 2944 | { |
| 2945 | CORE_ADDR Class = lookup_objc_class (parse_gdbarch (par_state), copy); |
| 2946 | if (Class) |
| 2947 | { |
| 2948 | struct symbol *sym; |
| 2949 | |
| 2950 | yylval.theclass.theclass = Class; |
| 2951 | sym = lookup_struct_typedef (copy, expression_context_block, 1); |
| 2952 | if (sym) |
| 2953 | yylval.theclass.type = SYMBOL_TYPE (sym); |
| 2954 | return CLASSNAME; |
| 2955 | } |
| 2956 | } |
| 2957 | |
| 2958 | /* Input names that aren't symbols but ARE valid hex numbers, when |
| 2959 | the input radix permits them, can be names or numbers depending |
| 2960 | on the parse. Note we support radixes > 16 here. */ |
| 2961 | if (!bsym.symbol |
| 2962 | && ((copy[0] >= 'a' && copy[0] < 'a' + input_radix - 10) |
| 2963 | || (copy[0] >= 'A' && copy[0] < 'A' + input_radix - 10))) |
| 2964 | { |
| 2965 | YYSTYPE newlval; /* Its value is ignored. */ |
| 2966 | int hextype = parse_number (par_state, copy, yylval.sval.length, |
| 2967 | 0, &newlval); |
| 2968 | |
| 2969 | if (hextype == INT) |
| 2970 | { |
| 2971 | yylval.ssym.sym = bsym; |
| 2972 | yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL; |
| 2973 | return NAME_OR_INT; |
| 2974 | } |
| 2975 | } |
| 2976 | |
| 2977 | /* Any other kind of symbol */ |
| 2978 | yylval.ssym.sym = bsym; |
| 2979 | yylval.ssym.is_a_field_of_this = is_a_field_of_this.type != NULL; |
| 2980 | |
| 2981 | if (bsym.symbol == NULL |
| 2982 | && parse_language (par_state)->la_language == language_cplus |
| 2983 | && is_a_field_of_this.type == NULL |
| 2984 | && lookup_minimal_symbol (copy, NULL, NULL).minsym == NULL) |
| 2985 | return UNKNOWN_CPP_NAME; |
| 2986 | |
| 2987 | return NAME; |
| 2988 | } |
| 2989 | |
| 2990 | /* Like classify_name, but used by the inner loop of the lexer, when a |
| 2991 | name might have already been seen. CONTEXT is the context type, or |
| 2992 | NULL if this is the first component of a name. */ |
| 2993 | |
| 2994 | static int |
| 2995 | classify_inner_name (struct parser_state *par_state, |
| 2996 | const struct block *block, struct type *context) |
| 2997 | { |
| 2998 | struct type *type; |
| 2999 | char *copy; |
| 3000 | |
| 3001 | if (context == NULL) |
| 3002 | return classify_name (par_state, block, 0); |
| 3003 | |
| 3004 | type = check_typedef (context); |
| 3005 | if (!type_aggregate_p (type)) |
| 3006 | return ERROR; |
| 3007 | |
| 3008 | copy = copy_name (yylval.ssym.stoken); |
| 3009 | /* N.B. We assume the symbol can only be in VAR_DOMAIN. */ |
| 3010 | yylval.ssym.sym = cp_lookup_nested_symbol (type, copy, block, VAR_DOMAIN); |
| 3011 | |
| 3012 | /* If no symbol was found, search for a matching base class named |
| 3013 | COPY. This will allow users to enter qualified names of class members |
| 3014 | relative to the `this' pointer. */ |
| 3015 | if (yylval.ssym.sym.symbol == NULL) |
| 3016 | { |
| 3017 | struct type *base_type = cp_find_type_baseclass_by_name (type, copy); |
| 3018 | |
| 3019 | if (base_type != NULL) |
| 3020 | { |
| 3021 | yylval.tsym.type = base_type; |
| 3022 | return TYPENAME; |
| 3023 | } |
| 3024 | |
| 3025 | return ERROR; |
| 3026 | } |
| 3027 | |
| 3028 | switch (SYMBOL_CLASS (yylval.ssym.sym.symbol)) |
| 3029 | { |
| 3030 | case LOC_BLOCK: |
| 3031 | case LOC_LABEL: |
| 3032 | /* cp_lookup_nested_symbol might have accidentally found a constructor |
| 3033 | named COPY when we really wanted a base class of the same name. |
| 3034 | Double-check this case by looking for a base class. */ |
| 3035 | { |
| 3036 | struct type *base_type = cp_find_type_baseclass_by_name (type, copy); |
| 3037 | |
| 3038 | if (base_type != NULL) |
| 3039 | { |
| 3040 | yylval.tsym.type = base_type; |
| 3041 | return TYPENAME; |
| 3042 | } |
| 3043 | } |
| 3044 | return ERROR; |
| 3045 | |
| 3046 | case LOC_TYPEDEF: |
| 3047 | yylval.tsym.type = SYMBOL_TYPE (yylval.ssym.sym.symbol); |
| 3048 | return TYPENAME; |
| 3049 | |
| 3050 | default: |
| 3051 | return NAME; |
| 3052 | } |
| 3053 | internal_error (__FILE__, __LINE__, _("not reached")); |
| 3054 | } |
| 3055 | |
| 3056 | /* The outer level of a two-level lexer. This calls the inner lexer |
| 3057 | to return tokens. It then either returns these tokens, or |
| 3058 | aggregates them into a larger token. This lets us work around a |
| 3059 | problem in our parsing approach, where the parser could not |
| 3060 | distinguish between qualified names and qualified types at the |
| 3061 | right point. |
| 3062 | |
| 3063 | This approach is still not ideal, because it mishandles template |
| 3064 | types. See the comment in lex_one_token for an example. However, |
| 3065 | this is still an improvement over the earlier approach, and will |
| 3066 | suffice until we move to better parsing technology. */ |
| 3067 | |
| 3068 | static int |
| 3069 | yylex (void) |
| 3070 | { |
| 3071 | token_and_value current; |
| 3072 | int first_was_coloncolon, last_was_coloncolon; |
| 3073 | struct type *context_type = NULL; |
| 3074 | int last_to_examine, next_to_examine, checkpoint; |
| 3075 | const struct block *search_block; |
| 3076 | int is_quoted_name; |
| 3077 | |
| 3078 | if (popping && !VEC_empty (token_and_value, token_fifo)) |
| 3079 | goto do_pop; |
| 3080 | popping = 0; |
| 3081 | |
| 3082 | /* Read the first token and decide what to do. Most of the |
| 3083 | subsequent code is C++-only; but also depends on seeing a "::" or |
| 3084 | name-like token. */ |
| 3085 | current.token = lex_one_token (pstate, &is_quoted_name); |
| 3086 | if (current.token == NAME) |
| 3087 | current.token = classify_name (pstate, expression_context_block, |
| 3088 | is_quoted_name); |
| 3089 | if (parse_language (pstate)->la_language != language_cplus |
| 3090 | || (current.token != TYPENAME && current.token != COLONCOLON |
| 3091 | && current.token != FILENAME)) |
| 3092 | return current.token; |
| 3093 | |
| 3094 | /* Read any sequence of alternating "::" and name-like tokens into |
| 3095 | the token FIFO. */ |
| 3096 | current.value = yylval; |
| 3097 | VEC_safe_push (token_and_value, token_fifo, ¤t); |
| 3098 | last_was_coloncolon = current.token == COLONCOLON; |
| 3099 | while (1) |
| 3100 | { |
| 3101 | int ignore; |
| 3102 | |
| 3103 | /* We ignore quoted names other than the very first one. |
| 3104 | Subsequent ones do not have any special meaning. */ |
| 3105 | current.token = lex_one_token (pstate, &ignore); |
| 3106 | current.value = yylval; |
| 3107 | VEC_safe_push (token_and_value, token_fifo, ¤t); |
| 3108 | |
| 3109 | if ((last_was_coloncolon && current.token != NAME) |
| 3110 | || (!last_was_coloncolon && current.token != COLONCOLON)) |
| 3111 | break; |
| 3112 | last_was_coloncolon = !last_was_coloncolon; |
| 3113 | } |
| 3114 | popping = 1; |
| 3115 | |
| 3116 | /* We always read one extra token, so compute the number of tokens |
| 3117 | to examine accordingly. */ |
| 3118 | last_to_examine = VEC_length (token_and_value, token_fifo) - 2; |
| 3119 | next_to_examine = 0; |
| 3120 | |
| 3121 | current = *VEC_index (token_and_value, token_fifo, next_to_examine); |
| 3122 | ++next_to_examine; |
| 3123 | |
| 3124 | obstack_free (&name_obstack, obstack_base (&name_obstack)); |
| 3125 | checkpoint = 0; |
| 3126 | if (current.token == FILENAME) |
| 3127 | search_block = current.value.bval; |
| 3128 | else if (current.token == COLONCOLON) |
| 3129 | search_block = NULL; |
| 3130 | else |
| 3131 | { |
| 3132 | gdb_assert (current.token == TYPENAME); |
| 3133 | search_block = expression_context_block; |
| 3134 | obstack_grow (&name_obstack, current.value.sval.ptr, |
| 3135 | current.value.sval.length); |
| 3136 | context_type = current.value.tsym.type; |
| 3137 | checkpoint = 1; |
| 3138 | } |
| 3139 | |
| 3140 | first_was_coloncolon = current.token == COLONCOLON; |
| 3141 | last_was_coloncolon = first_was_coloncolon; |
| 3142 | |
| 3143 | while (next_to_examine <= last_to_examine) |
| 3144 | { |
| 3145 | token_and_value *next; |
| 3146 | |
| 3147 | next = VEC_index (token_and_value, token_fifo, next_to_examine); |
| 3148 | ++next_to_examine; |
| 3149 | |
| 3150 | if (next->token == NAME && last_was_coloncolon) |
| 3151 | { |
| 3152 | int classification; |
| 3153 | |
| 3154 | yylval = next->value; |
| 3155 | classification = classify_inner_name (pstate, search_block, |
| 3156 | context_type); |
| 3157 | /* We keep going until we either run out of names, or until |
| 3158 | we have a qualified name which is not a type. */ |
| 3159 | if (classification != TYPENAME && classification != NAME) |
| 3160 | break; |
| 3161 | |
| 3162 | /* Accept up to this token. */ |
| 3163 | checkpoint = next_to_examine; |
| 3164 | |
| 3165 | /* Update the partial name we are constructing. */ |
| 3166 | if (context_type != NULL) |
| 3167 | { |
| 3168 | /* We don't want to put a leading "::" into the name. */ |
| 3169 | obstack_grow_str (&name_obstack, "::"); |
| 3170 | } |
| 3171 | obstack_grow (&name_obstack, next->value.sval.ptr, |
| 3172 | next->value.sval.length); |
| 3173 | |
| 3174 | yylval.sval.ptr = obstack_base (&name_obstack); |
| 3175 | yylval.sval.length = obstack_object_size (&name_obstack); |
| 3176 | current.value = yylval; |
| 3177 | current.token = classification; |
| 3178 | |
| 3179 | last_was_coloncolon = 0; |
| 3180 | |
| 3181 | if (classification == NAME) |
| 3182 | break; |
| 3183 | |
| 3184 | context_type = yylval.tsym.type; |
| 3185 | } |
| 3186 | else if (next->token == COLONCOLON && !last_was_coloncolon) |
| 3187 | last_was_coloncolon = 1; |
| 3188 | else |
| 3189 | { |
| 3190 | /* We've reached the end of the name. */ |
| 3191 | break; |
| 3192 | } |
| 3193 | } |
| 3194 | |
| 3195 | /* If we have a replacement token, install it as the first token in |
| 3196 | the FIFO, and delete the other constituent tokens. */ |
| 3197 | if (checkpoint > 0) |
| 3198 | { |
| 3199 | current.value.sval.ptr = obstack_copy0 (&expansion_obstack, |
| 3200 | current.value.sval.ptr, |
| 3201 | current.value.sval.length); |
| 3202 | |
| 3203 | VEC_replace (token_and_value, token_fifo, 0, ¤t); |
| 3204 | if (checkpoint > 1) |
| 3205 | VEC_block_remove (token_and_value, token_fifo, 1, checkpoint - 1); |
| 3206 | } |
| 3207 | |
| 3208 | do_pop: |
| 3209 | current = *VEC_index (token_and_value, token_fifo, 0); |
| 3210 | VEC_ordered_remove (token_and_value, token_fifo, 0); |
| 3211 | yylval = current.value; |
| 3212 | return current.token; |
| 3213 | } |
| 3214 | |
| 3215 | int |
| 3216 | c_parse (struct parser_state *par_state) |
| 3217 | { |
| 3218 | int result; |
| 3219 | struct cleanup *back_to; |
| 3220 | |
| 3221 | /* Setting up the parser state. */ |
| 3222 | gdb_assert (par_state != NULL); |
| 3223 | pstate = par_state; |
| 3224 | |
| 3225 | back_to = make_cleanup (free_current_contents, &expression_macro_scope); |
| 3226 | make_cleanup_clear_parser_state (&pstate); |
| 3227 | |
| 3228 | /* Set up the scope for macro expansion. */ |
| 3229 | expression_macro_scope = NULL; |
| 3230 | |
| 3231 | if (expression_context_block) |
| 3232 | expression_macro_scope |
| 3233 | = sal_macro_scope (find_pc_line (expression_context_pc, 0)); |
| 3234 | else |
| 3235 | expression_macro_scope = default_macro_scope (); |
| 3236 | if (! expression_macro_scope) |
| 3237 | expression_macro_scope = user_macro_scope (); |
| 3238 | |
| 3239 | /* Initialize macro expansion code. */ |
| 3240 | obstack_init (&expansion_obstack); |
| 3241 | gdb_assert (! macro_original_text); |
| 3242 | make_cleanup (scan_macro_cleanup, 0); |
| 3243 | |
| 3244 | make_cleanup_restore_integer (&yydebug); |
| 3245 | yydebug = parser_debug; |
| 3246 | |
| 3247 | /* Initialize some state used by the lexer. */ |
| 3248 | last_was_structop = 0; |
| 3249 | saw_name_at_eof = 0; |
| 3250 | |
| 3251 | VEC_free (token_and_value, token_fifo); |
| 3252 | popping = 0; |
| 3253 | obstack_init (&name_obstack); |
| 3254 | make_cleanup_obstack_free (&name_obstack); |
| 3255 | |
| 3256 | result = yyparse (); |
| 3257 | do_cleanups (back_to); |
| 3258 | |
| 3259 | return result; |
| 3260 | } |
| 3261 | |
| 3262 | #ifdef YYBISON |
| 3263 | |
| 3264 | /* This is called via the YYPRINT macro when parser debugging is |
| 3265 | enabled. It prints a token's value. */ |
| 3266 | |
| 3267 | static void |
| 3268 | c_print_token (FILE *file, int type, YYSTYPE value) |
| 3269 | { |
| 3270 | switch (type) |
| 3271 | { |
| 3272 | case INT: |
| 3273 | fprintf (file, "typed_val_int<%s, %s>", |
| 3274 | TYPE_SAFE_NAME (value.typed_val_int.type), |
| 3275 | pulongest (value.typed_val_int.val)); |
| 3276 | break; |
| 3277 | |
| 3278 | case CHAR: |
| 3279 | case STRING: |
| 3280 | { |
| 3281 | char *copy = alloca (value.tsval.length + 1); |
| 3282 | |
| 3283 | memcpy (copy, value.tsval.ptr, value.tsval.length); |
| 3284 | copy[value.tsval.length] = '\0'; |
| 3285 | |
| 3286 | fprintf (file, "tsval<type=%d, %s>", value.tsval.type, copy); |
| 3287 | } |
| 3288 | break; |
| 3289 | |
| 3290 | case NSSTRING: |
| 3291 | case VARIABLE: |
| 3292 | fprintf (file, "sval<%s>", copy_name (value.sval)); |
| 3293 | break; |
| 3294 | |
| 3295 | case TYPENAME: |
| 3296 | fprintf (file, "tsym<type=%s, name=%s>", |
| 3297 | TYPE_SAFE_NAME (value.tsym.type), |
| 3298 | copy_name (value.tsym.stoken)); |
| 3299 | break; |
| 3300 | |
| 3301 | case NAME: |
| 3302 | case UNKNOWN_CPP_NAME: |
| 3303 | case NAME_OR_INT: |
| 3304 | case BLOCKNAME: |
| 3305 | fprintf (file, "ssym<name=%s, sym=%s, field_of_this=%d>", |
| 3306 | copy_name (value.ssym.stoken), |
| 3307 | (value.ssym.sym.symbol == NULL |
| 3308 | ? "(null)" : SYMBOL_PRINT_NAME (value.ssym.sym.symbol)), |
| 3309 | value.ssym.is_a_field_of_this); |
| 3310 | break; |
| 3311 | |
| 3312 | case FILENAME: |
| 3313 | fprintf (file, "bval<%s>", host_address_to_string (value.bval)); |
| 3314 | break; |
| 3315 | } |
| 3316 | } |
| 3317 | |
| 3318 | #endif |
| 3319 | |
| 3320 | void |
| 3321 | yyerror (char *msg) |
| 3322 | { |
| 3323 | if (prev_lexptr) |
| 3324 | lexptr = prev_lexptr; |
| 3325 | |
| 3326 | error (_("A %s in expression, near `%s'."), (msg ? msg : "error"), lexptr); |
| 3327 | } |