Fresh Fish 9

home *** CD-ROM | disk | FTP | other *** search

/ Fresh Fish 9 / FreshFishVol9-CD2.bin / bbs / gnu / gdb-4.14-src.lha / gdb-4.14 / gdb / c-exp.tab.c < prev next >

Wrap

C/C++ Source or Header | 1995-03-04 | 79.9 KB | 2,685 lines

/* A Bison parser, made from ./c-exp.y with Bison version GNU Bison version 1.22 */ #define YYBISON 1 /* Identify Bison output. */ #define INT 258 #define FLOAT 259 #define STRING 260 #define NAME 261 #define TYPENAME 262 #define NAME_OR_INT 263 #define STRUCT 264 #define CLASS 265 #define UNION 266 #define ENUM 267 #define SIZEOF 268 #define UNSIGNED 269 #define COLONCOLON 270 #define TEMPLATE 271 #define ERROR 272 #define SIGNED_KEYWORD 273 #define LONG 274 #define SHORT 275 #define INT_KEYWORD 276 #define CONST_KEYWORD 277 #define VOLATILE_KEYWORD 278 #define LAST 279 #define REGNAME 280 #define VARIABLE 281 #define ASSIGN_MODIFY 282 #define THIS 283 #define ABOVE_COMMA 284 #define OROR 285 #define ANDAND 286 #define EQUAL 287 #define NOTEQUAL 288 #define LEQ 289 #define GEQ 290 #define LSH 291 #define RSH 292 #define UNARY 293 #define INCREMENT 294 #define DECREMENT 295 #define ARROW 296 #define BLOCKNAME 297 #line 38 "./c-exp.y" #include "defs.h" #include <string.h> #include "expression.h" #include "value.h" #include "parser-defs.h" #include "language.h" #include "c-lang.h" #include "bfd.h" /* Required by objfiles.h. */ #include "symfile.h" /* Required by objfiles.h. */ #include "objfiles.h" /* For have_full_symbols and have_partial_symbols */ /* Remap normal yacc parser interface names (yyparse, yylex, yyerror, etc), as well as gratuitiously global symbol names, so we can have multiple yacc generated parsers in gdb. Note that these are only the variables produced by yacc. If other parser generators (bison, byacc, etc) produce additional global names that conflict at link time, then those parser generators need to be fixed instead of adding those names to this list. */ #define yymaxdepth c_maxdepth #define yyparse c_parse #define yylex c_lex #define yyerror c_error #define yylval c_lval #define yychar c_char #define yydebug c_debug #define yypact c_pact #define yyr1 c_r1 #define yyr2 c_r2 #define yydef c_def #define yychk c_chk #define yypgo c_pgo #define yyact c_act #define yyexca c_exca #define yyerrflag c_errflag #define yynerrs c_nerrs #define yyps c_ps #define yypv c_pv #define yys c_s #define yy_yys c_yys #define yystate c_state #define yytmp c_tmp #define yyv c_v #define yy_yyv c_yyv #define yyval c_val #define yylloc c_lloc #define yyreds c_reds /* With YYDEBUG defined */ #define yytoks c_toks /* With YYDEBUG defined */ #ifndef YYDEBUG #define YYDEBUG 0 /* Default to no yydebug support */ #endif int yyparse PARAMS ((void)); static int yylex PARAMS ((void)); void yyerror PARAMS ((char *)); #line 107 "./c-exp.y" typedef union { LONGEST lval; struct { LONGEST val; struct type *type; } typed_val; double dval; struct symbol *sym; struct type *tval; struct stoken sval; struct ttype tsym; struct symtoken ssym; int voidval; struct block *bval; enum exp_opcode opcode; struct internalvar *ivar; struct type **tvec; int *ivec; } YYSTYPE; #line 129 "./c-exp.y" /* YYSTYPE gets defined by %union */ static int parse_number PARAMS ((char *, int, int, YYSTYPE *)); #ifndef YYLTYPE typedef struct yyltype { int timestamp; int first_line; int first_column; int last_line; int last_column; char *text; } yyltype; #define YYLTYPE yyltype #endif #include <stdio.h> #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 211 #define YYFLAG -32768 #define YYNTBASE 67 #define YYTRANSLATE(x) ((unsigned)(x) <= 297 ? yytranslate[x] : 89) static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 60, 2, 2, 2, 51, 37, 2, 58, 63, 49, 47, 29, 48, 56, 50, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 66, 2, 40, 31, 41, 32, 46, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 57, 2, 62, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 64, 35, 65, 61, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 30, 33, 34, 38, 39, 42, 43, 44, 45, 52, 53, 54, 55, 59 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 2, 4, 6, 8, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 46, 50, 55, 59, 63, 68, 73, 74, 80, 82, 83, 85, 89, 91, 95, 100, 105, 109, 113, 117, 121, 125, 129, 133, 137, 141, 145, 149, 153, 157, 161, 165, 169, 173, 177, 181, 185, 191, 195, 199, 201, 203, 205, 207, 209, 211, 213, 218, 220, 222, 224, 228, 232, 236, 241, 243, 246, 248, 250, 253, 256, 259, 263, 267, 269, 272, 274, 277, 279, 283, 286, 288, 291, 293, 296, 300, 303, 307, 309, 313, 315, 317, 319, 321, 324, 328, 331, 335, 339, 344, 347, 351, 354, 357, 360, 363, 366, 368, 371, 373, 379, 382, 385, 387, 389, 391, 393, 395, 399, 401, 403, 405, 407, 409 }; static const short yyrhs[] = { 69, 0, 68, 0, 83, 0, 70, 0, 69, 29, 70, 0, 49, 70, 0, 37, 70, 0, 48, 70, 0, 60, 70, 0, 61, 70, 0, 53, 70, 0, 54, 70, 0, 70, 53, 0, 70, 54, 0, 13, 70, 0, 70, 55, 87, 0, 70, 55, 77, 0, 70, 55, 49, 70, 0, 70, 56, 87, 0, 70, 56, 77, 0, 70, 56, 49, 70, 0, 70, 57, 69, 62, 0, 0, 70, 58, 71, 73, 63, 0, 64, 0, 0, 70, 0, 73, 29, 70, 0, 65, 0, 72, 73, 74, 0, 72, 83, 74, 70, 0, 58, 83, 63, 70, 0, 58, 69, 63, 0, 70, 46, 70, 0, 70, 49, 70, 0, 70, 50, 70, 0, 70, 51, 70, 0, 70, 47, 70, 0, 70, 48, 70, 0, 70, 44, 70, 0, 70, 45, 70, 0, 70, 38, 70, 0, 70, 39, 70, 0, 70, 42, 70, 0, 70, 43, 70, 0, 70, 40, 70, 0, 70, 41, 70, 0, 70, 37, 70, 0, 70, 36, 70, 0, 70, 35, 70, 0, 70, 34, 70, 0, 70, 33, 70, 0, 70, 32, 70, 66, 70, 0, 70, 31, 70, 0, 70, 27, 70, 0, 3, 0, 8, 0, 4, 0, 76, 0, 24, 0, 25, 0, 26, 0, 13, 58, 83, 63, 0, 5, 0, 28, 0, 59, 0, 75, 15, 87, 0, 75, 15, 87, 0, 84, 15, 87, 0, 84, 15, 61, 87, 0, 77, 0, 15, 87, 0, 88, 0, 84, 0, 84, 22, 0, 84, 23, 0, 84, 79, 0, 84, 22, 79, 0, 84, 23, 79, 0, 49, 0, 49, 79, 0, 37, 0, 37, 79, 0, 80, 0, 58, 79, 63, 0, 80, 81, 0, 81, 0, 80, 82, 0, 82, 0, 57, 62, 0, 57, 3, 62, 0, 58, 63, 0, 58, 86, 63, 0, 78, 0, 84, 15, 49, 0, 7, 0, 21, 0, 19, 0, 20, 0, 19, 21, 0, 14, 19, 21, 0, 19, 19, 0, 19, 19, 21, 0, 14, 19, 19, 0, 14, 19, 19, 21, 0, 20, 21, 0, 14, 20, 21, 0, 9, 87, 0, 10, 87, 0, 11, 87, 0, 12, 87, 0, 14, 85, 0, 14, 0, 18, 85, 0, 18, 0, 16, 87, 40, 83, 41, 0, 22, 84, 0, 23, 84, 0, 7, 0, 21, 0, 19, 0, 20, 0, 83, 0, 86, 29, 83, 0, 6, 0, 59, 0, 7, 0, 8, 0, 6, 0, 59, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 211, 212, 215, 222, 223, 228, 231, 234, 238, 242, 246, 250, 254, 258, 262, 266, 272, 279, 283, 289, 297, 301, 305, 309, 315, 319, 322, 326, 330, 333, 340, 346, 352, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 402, 406, 410, 414, 418, 422, 426, 430, 434, 438, 442, 448, 455, 466, 473, 476, 482, 488, 494, 501, 526, 533, 551, 562, 578, 591, 616, 617, 651, 709, 715, 716, 717, 719, 721, 725, 727, 729, 731, 733, 736, 738, 743, 750, 752, 756, 758, 762, 764, 776, 777, 782, 784, 786, 788, 790, 792, 794, 796, 798, 800, 802, 804, 806, 809, 812, 815, 818, 820, 822, 824, 826, 833, 834, 837, 838, 844, 850, 859, 864, 871, 872, 873, 874, 877, 878 }; static const char * const yytname[] = { "$","error","$illegal.","INT","FLOAT", "STRING","NAME","TYPENAME","NAME_OR_INT","STRUCT","CLASS","UNION","ENUM","SIZEOF", "UNSIGNED","COLONCOLON","TEMPLATE","ERROR","SIGNED_KEYWORD","LONG","SHORT","INT_KEYWORD", "CONST_KEYWORD","VOLATILE_KEYWORD","LAST","REGNAME","VARIABLE","ASSIGN_MODIFY", "THIS","','","ABOVE_COMMA","'='","'?'","OROR","ANDAND","'|'","'^'","'&'","EQUAL", "NOTEQUAL","'<'","'>'","LEQ","GEQ","LSH","RSH","'@'","'+'","'-'","'*'","'/'", "'%'","UNARY","INCREMENT","DECREMENT","ARROW","'.'","'['","'('","BLOCKNAME", "'!'","'~'","']'","')'","'{'","'}'","':'","start","type_exp","exp1","exp","@1", "lcurly","arglist","rcurly","block","variable","qualified_name","ptype","abs_decl", "direct_abs_decl","array_mod","func_mod","type","typebase","typename","nonempty_typelist", "name","name_not_typename","" }; #endif static const short yyr1[] = { 0, 67, 67, 68, 69, 69, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 71, 70, 72, 73, 73, 73, 74, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 75, 75, 76, 77, 77, 76, 76, 76, 78, 78, 78, 78, 78, 78, 79, 79, 79, 79, 79, 80, 80, 80, 80, 80, 81, 81, 82, 82, 83, 83, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 85, 85, 85, 85, 86, 86, 87, 87, 87, 87, 88, 88 }; static const short yyr2[] = { 0, 1, 1, 1, 1, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 4, 3, 3, 4, 4, 0, 5, 1, 0, 1, 3, 1, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 3, 3, 3, 4, 1, 2, 1, 1, 2, 2, 2, 3, 3, 1, 2, 1, 2, 1, 3, 2, 1, 2, 1, 2, 3, 2, 3, 1, 3, 1, 1, 1, 1, 2, 3, 2, 3, 3, 4, 2, 3, 2, 2, 2, 2, 2, 1, 2, 1, 5, 2, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1 }; static const short yydefact[] = { 0, 56, 58, 64, 129, 96, 57, 0, 0, 0, 0, 0, 113, 0, 0, 115, 98, 99, 97, 0, 0, 60, 61, 62, 65, 0, 0, 0, 0, 0, 0, 130, 0, 0, 25, 2, 1, 4, 26, 0, 59, 71, 94, 3, 74, 73, 125, 127, 128, 126, 108, 109, 110, 111, 0, 15, 0, 119, 121, 122, 120, 112, 72, 0, 121, 122, 114, 102, 100, 106, 117, 118, 7, 8, 6, 11, 12, 0, 0, 9, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 14, 0, 0, 0, 23, 27, 0, 0, 0, 0, 75, 76, 82, 80, 0, 0, 77, 84, 87, 89, 0, 0, 104, 101, 107, 0, 103, 33, 0, 5, 55, 54, 0, 52, 51, 50, 49, 48, 42, 43, 46, 47, 44, 45, 40, 41, 34, 38, 39, 35, 36, 37, 127, 0, 17, 16, 0, 20, 19, 0, 26, 0, 29, 30, 0, 68, 95, 0, 69, 78, 79, 83, 81, 0, 90, 92, 0, 123, 74, 0, 0, 86, 88, 63, 105, 0, 32, 0, 18, 21, 22, 0, 28, 31, 70, 91, 85, 0, 0, 93, 116, 53, 24, 124, 0, 0, 0 }; static const short yydefgoto[] = { 209, 35, 77, 37, 165, 38, 111, 168, 39, 40, 41, 42, 121, 122, 123, 124, 182, 56, 61, 184, 173, 45 }; static const short yypact[] = { 202, -32768,-32768,-32768,-32768,-32768,-32768, 8, 8, 8, 8, 264, 29, 8, 8, 103, 14, -8,-32768, 222, 222, -32768,-32768,-32768,-32768, 202, 202, 202, 202, 202, 202, 11, 202, 202,-32768,-32768, 3, 466, 202, 22,-32768, -32768,-32768,-32768, 373,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768, 202, -13, 38,-32768, 98, 44,-32768, -32768,-32768, 36,-32768,-32768,-32768, 79,-32768,-32768,-32768, -32768, -13, -13, -13, -13, -13, -17, 58, -13, -13, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202, 202,-32768,-32768, 349, 393, 202,-32768, 466, -18, 42, 8, 97, 69, 69, 69, 69, 7, 129, -32768, 55,-32768,-32768, 62, 50, 95,-32768,-32768, 222, -32768,-32768, 202, 466, 466, 466, 430, 518, 542, 565, 587, 608, 627, 627, 249, 249, 249, 249, 640, 640, 652, 119, 119, -13, -13, -13, 113, 202,-32768,-32768, 202,-32768,-32768, -2, 202, 202,-32768,-32768, 202, 127, -32768, 8,-32768,-32768,-32768,-32768,-32768, 82,-32768,-32768, 90,-32768, 402, -12, 52,-32768,-32768, 326,-32768, 114, -13, 202, -13, -13,-32768, -11, 466, -13,-32768,-32768, -32768, 115, 222,-32768,-32768, 493,-32768,-32768, 163, 171, -32768 }; static const short yypgoto[] = {-32768, -32768, 6, -4,-32768,-32768, 15, 67,-32768,-32768, 53, -32768, 17,-32768, 59, 60, 1, 0, 168,-32768, -5, -32768 }; #define YYLAST 710 static const short yytable[] = { 44, 43, 50, 51, 52, 53, 36, 55, 62, 63, 178, 166, 81, 69, 46, 47, 48, 203, 166, 70, 71, 72, 73, 74, 75, 76, -66, 81, 79, 80, 44, 78, 81, 67, 110, 68, 57, 113, 44, 112, 104, 105, 106, 107, 108, 109, 132, 167, 58, 59, 60, 204, 207, 126, 44, 125, 46, 47, 48, 5, 195, 7, 8, 9, 10, 129, 12, 49, 14, 179, 15, 16, 17, 18, 19, 20, 130, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 131, 160, 163, 46, 47, 48, 117, 167, 170, 49, 57, 172, 119, 185, 164, 180, 189, 127, 118, 128, 183, 133, 64, 65, 60, 188, 119, 120, -96, 191, 183, 190, 174, 175, 176, 177, 5, 181, 7, 8, 9, 10, -67, 12, 200, 14, 171, 15, 16, 17, 18, 19, 20, 201, 193, 205, 49, 194, 172, 159, 162, 110, 197, 210, 171, 198, 117, 199, 101, 102, 103, 211, 104, 105, 106, 107, 108, 109, 118, 169, 196, 186, 187, 66, 191, 183, 119, 120, 206, 0, 0, 0, 180, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 183, 208, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 0, 15, 16, 17, 18, 19, 20, 21, 22, 23, 5, 24, 7, 8, 9, 10, 0, 12, 0, 14, 25, 15, 16, 17, 18, 19, 20, 0, 0, 0, 0, 26, 27, 0, 0, 0, 28, 29, 0, 0, 0, 30, 31, 32, 33, 0, 0, 34, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 0, 15, 16, 17, 18, 19, 20, 21, 22, 23, 0, 24, 96, 97, 98, 99, 100, 101, 102, 103, 25, 104, 105, 106, 107, 108, 109, 0, 0, 0, 0, 26, 27, 0, 0, 0, 28, 29, 0, 0, 0, 54, 31, 32, 33, 0, 0, 34, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 0, 15, 16, 17, 18, 19, 20, 21, 22, 23, 0, 24, 46, 157, 48, 7, 8, 9, 10, 0, 12, 0, 14, 0, 15, 16, 17, 18, 19, 20, 0, 0, 0, 0, 0, 0, 28, 29, 0, 0, 0, 30, 31, 32, 33, 114, 0, 34, 0, 0, 0, 0, 115, 116, 0, 158, 46, 157, 48, 7, 8, 9, 10, 0, 12, 49, 14, 117, 15, 16, 17, 18, 19, 20, 202, 0, 0, 0, 0, 118, 0, 115, 116, 0, 0, 0, 0, 119, 120, 0, 0, 0, 0, 0, 0, 0, 117, 0, 0, 161, 0, 0, 0, 0, 0, 0, 0, 0, 118, 49, 0, 0, 0, 0, 82, 0, 119, 120, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109, 0, 0, 0, 0, 82, 0, 0, 192, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109, 98, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109, 99, 100, 101, 102, 103, 0, 104, 105, 106, 107, 108, 109 }; static const short yycheck[] = { 0, 0, 7, 8, 9, 10, 0, 11, 13, 14, 3, 29, 29, 21, 6, 7, 8, 29, 29, 19, 20, 25, 26, 27, 28, 29, 15, 29, 32, 33, 30, 30, 29, 19, 38, 21, 7, 15, 38, 38, 53, 54, 55, 56, 57, 58, 63, 65, 19, 20, 21, 63, 63, 15, 54, 54, 6, 7, 8, 7, 62, 9, 10, 11, 12, 21, 14, 59, 16, 62, 18, 19, 20, 21, 22, 23, 40, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 21, 106, 107, 6, 7, 8, 37, 65, 113, 59, 7, 61, 57, 58, 108, 63, 21, 19, 49, 21, 120, 63, 19, 20, 21, 63, 57, 58, 15, 133, 130, 130, 115, 116, 117, 118, 7, 120, 9, 10, 11, 12, 15, 14, 62, 16, 49, 18, 19, 20, 21, 22, 23, 63, 158, 41, 59, 161, 61, 106, 107, 165, 166, 0, 49, 169, 37, 172, 49, 50, 51, 0, 53, 54, 55, 56, 57, 58, 49, 112, 165, 122, 122, 15, 188, 185, 57, 58, 192, -1, -1, -1, 63, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 203, 203, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, -1, 18, 19, 20, 21, 22, 23, 24, 25, 26, 7, 28, 9, 10, 11, 12, -1, 14, -1, 16, 37, 18, 19, 20, 21, 22, 23, -1, -1, -1, -1, 48, 49, -1, -1, -1, 53, 54, -1, -1, -1, 58, 59, 60, 61, -1, -1, 64, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, -1, 18, 19, 20, 21, 22, 23, 24, 25, 26, -1, 28, 44, 45, 46, 47, 48, 49, 50, 51, 37, 53, 54, 55, 56, 57, 58, -1, -1, -1, -1, 48, 49, -1, -1, -1, 53, 54, -1, -1, -1, 58, 59, 60, 61, -1, -1, 64, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, -1, 18, 19, 20, 21, 22, 23, 24, 25, 26, -1, 28, 6, 7, 8, 9, 10, 11, 12, -1, 14, -1, 16, -1, 18, 19, 20, 21, 22, 23, -1, -1, -1, -1, -1, -1, 53, 54, -1, -1, -1, 58, 59, 60, 61, 15, -1, 64, -1, -1, -1, -1, 22, 23, -1, 49, 6, 7, 8, 9, 10, 11, 12, -1, 14, 59, 16, 37, 18, 19, 20, 21, 22, 23, 15, -1, -1, -1, -1, 49, -1, 22, 23, -1, -1, -1, -1, 57, 58, -1, -1, -1, -1, -1, -1, -1, 37, -1, -1, 49, -1, -1, -1, -1, -1, -1, -1, -1, 49, 59, -1, -1, -1, -1, 27, -1, 57, 58, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58, -1, -1, -1, -1, 27, -1, -1, 66, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58, 46, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58, 47, 48, 49, 50, 51, -1, 53, 54, 55, 56, 57, 58 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/unsupported/lib/bison.simple" /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef alloca #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) #include <alloca.h> #else /* not sparc */ #if defined (MSDOS) && !defined (__TURBOC__) #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) #pragma alloca #else /* not MSDOS, __TURBOC__, or _AIX */ #ifdef __hpux #ifdef __cplusplus extern "C" { void *alloca (unsigned int); }; #else /* not __cplusplus */ void *alloca (); #endif /* not __cplusplus */ #endif /* __hpux */ #endif /* not _AIX */ #endif /* not MSDOS, or __TURBOC__ */ #endif /* not sparc. */ #endif /* not GNU C. */ #endif /* alloca not defined. */ /* This is the parser code that is written into each bison parser when the %semantic_parser declaration is not specified in the grammar. It was written by Richard Stallman by simplifying the hairy parser used when %semantic_parser is specified. */ /* Note: there must be only one dollar sign in this file. It is replaced by the list of actions, each action as one case of the switch. */ #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT return(0) #define YYABORT return(1) #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(token, value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { yychar = (token), yylval = (value); \ yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { yyerror ("syntax error: cannot back up"); YYERROR; } \ while (0) #define YYTERROR 1 #define YYERRCODE 256 #ifndef YYPURE #define YYLEX yylex() #endif #ifdef YYPURE #ifdef YYLSP_NEEDED #define YYLEX yylex(&yylval, &yylloc) #else #define YYLEX yylex(&yylval) #endif #endif /* If nonreentrant, generate the variables here */ #ifndef YYPURE int yychar; /* the lookahead symbol */ YYSTYPE yylval; /* the semantic value of the */ /* lookahead symbol */ #ifdef YYLSP_NEEDED YYLTYPE yylloc; /* location data for the lookahead */ /* symbol */ #endif int yynerrs; /* number of parse errors so far */ #endif /* not YYPURE */ #if YYDEBUG != 0 int yydebug; /* nonzero means print parse trace */ /* Since this is uninitialized, it does not stop multiple parsers from coexisting. */ #endif /* YYINITDEPTH indicates the initial size of the parser's stacks */ #ifndef YYINITDEPTH #define YYINITDEPTH 200 #endif /* YYMAXDEPTH is the maximum size the stacks can grow to (effective only if the built-in stack extension method is used). */ #if YYMAXDEPTH == 0 #undef YYMAXDEPTH #endif #ifndef YYMAXDEPTH #define YYMAXDEPTH 10000 #endif /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ int yyparse (void); #endif #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ #define __yy_bcopy(FROM,TO,COUNT) __builtin_memcpy(TO,FROM,COUNT) #else /* not GNU C or C++ */ #ifndef __cplusplus /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_bcopy (from, to, count) char *from; char *to; int count; { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #else /* __cplusplus */ /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_bcopy (char *from, char *to, int count) { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif #line 184 "/usr/unsupported/lib/bison.simple" int yyparse() { register int yystate; register int yyn; register short *yyssp; register YYSTYPE *yyvsp; int yyerrstatus; /* number of tokens to shift before error messages enabled */ int yychar1 = 0; /* lookahead token as an internal (translated) token number */ short yyssa[YYINITDEPTH]; /* the state stack */ YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ short *yyss = yyssa; /* refer to the stacks thru separate pointers */ YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to xreallocate them elsewhere */ #ifdef YYLSP_NEEDED YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ YYLTYPE *yyls = yylsa; YYLTYPE *yylsp; #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) #else #define YYPOPSTACK (yyvsp--, yyssp--) #endif int yystacksize = YYINITDEPTH; #ifdef YYPURE int yychar; YYSTYPE yylval; int yynerrs; #ifdef YYLSP_NEEDED YYLTYPE yylloc; #endif #endif YYSTYPE yyval; /* the variable used to return */ /* semantic values from the action */ /* routines */ int yylen; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Starting parse\n"); #endif yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ /* Initialize stack pointers. Waste one element of value and location stack so that they stay on the same level as the state stack. The wasted elements are never initialized. */ yyssp = yyss - 1; yyvsp = yyvs; #ifdef YYLSP_NEEDED yylsp = yyls; #endif /* Push a new state, which is found in yystate . */ /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ yynewstate: *++yyssp = yystate; if (yyssp >= yyss + yystacksize - 1) { /* Give user a chance to xreallocate the stack */ /* Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; #ifdef YYLSP_NEEDED YYLTYPE *yyls1 = yyls; #endif /* Get the current used size of the three stacks, in elements. */ int size = yyssp - yyss + 1; #ifdef yyoverflow /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. */ #ifdef YYLSP_NEEDED /* This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yyls1, size * sizeof (*yylsp), &yystacksize); #else yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yystacksize); #endif yyss = yyss1; yyvs = yyvs1; #ifdef YYLSP_NEEDED yyls = yyls1; #endif #else /* no yyoverflow */ /* Extend the stack our own way. */ if (yystacksize >= YYMAXDEPTH) { yyerror("parser stack overflow"); return 2; } yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; yyss = (short *) alloca (yystacksize * sizeof (*yyssp)); __yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp)); yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp)); __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp)); __yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp)); #endif #endif /* no yyoverflow */ yyssp = yyss + size - 1; yyvsp = yyvs + size - 1; #ifdef YYLSP_NEEDED yylsp = yyls + size - 1; #endif #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Stack size increased to %d\n", yystacksize); #endif if (yyssp >= yyss + yystacksize - 1) YYABORT; } #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Entering state %d\n", yystate); #endif goto yybackup; yybackup: /* Do appropriate processing given the current state. */ /* Read a lookahead token if we need one and don't already have one. */ /* yyresume: */ /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* yychar is either YYEMPTY or YYEOF or a valid token in external form. */ if (yychar == YYEMPTY) { #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Reading a token: "); #endif yychar = YYLEX; } /* Convert token to internal form (in yychar1) for indexing tables with */ if (yychar <= 0) /* This means end of input. */ { yychar1 = 0; yychar = YYEOF; /* Don't call YYLEX any more */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Now at end of input.\n"); #endif } else { yychar1 = YYTRANSLATE(yychar); #if YYDEBUG != 0 if (yydebug) { fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); /* Give the individual parser a way to print the precise meaning of a token, for further debugging info. */ #ifdef YYPRINT YYPRINT (stderr, yychar, yylval); #endif fprintf (stderr, ")\n"); } #endif } yyn += yychar1; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; yyn = yytable[yyn]; /* yyn is what to do for this token type in this state. Negative => reduce, -yyn is rule number. Positive => shift, yyn is new state. New state is final state => don't bother to shift, just return success. 0, or most negative number => error. */ if (yyn < 0) { if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); #endif /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif /* count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; yystate = yyn; goto yynewstate; /* Do the default action for the current state. */ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; /* Do a reduction. yyn is the number of a rule to reduce with. */ yyreduce: yylen = yyr2[yyn]; if (yylen > 0) yyval = yyvsp[1-yylen]; /* implement default value of the action */ #if YYDEBUG != 0 if (yydebug) { int i; fprintf (stderr, "Reducing via rule %d (line %d), ", yyn, yyrline[yyn]); /* Print the symbols being reduced, and their result. */ for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) fprintf (stderr, "%s ", yytname[yyrhs[i]]); fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); } #endif switch (yyn) { case 3: #line 216 "./c-exp.y" { write_exp_elt_opcode(OP_TYPE); write_exp_elt_type(yyvsp[0].tval); write_exp_elt_opcode(OP_TYPE);; break;} case 5: #line 224 "./c-exp.y" { write_exp_elt_opcode (BINOP_COMMA); ; break;} case 6: #line 229 "./c-exp.y" { write_exp_elt_opcode (UNOP_IND); ; break;} case 7: #line 232 "./c-exp.y" { write_exp_elt_opcode (UNOP_ADDR); ; break;} case 8: #line 235 "./c-exp.y" { write_exp_elt_opcode (UNOP_NEG); ; break;} case 9: #line 239 "./c-exp.y" { write_exp_elt_opcode (UNOP_LOGICAL_NOT); ; break;} case 10: #line 243 "./c-exp.y" { write_exp_elt_opcode (UNOP_COMPLEMENT); ; break;} case 11: #line 247 "./c-exp.y" { write_exp_elt_opcode (UNOP_PREINCREMENT); ; break;} case 12: #line 251 "./c-exp.y" { write_exp_elt_opcode (UNOP_PREDECREMENT); ; break;} case 13: #line 255 "./c-exp.y" { write_exp_elt_opcode (UNOP_POSTINCREMENT); ; break;} case 14: #line 259 "./c-exp.y" { write_exp_elt_opcode (UNOP_POSTDECREMENT); ; break;} case 15: #line 263 "./c-exp.y" { write_exp_elt_opcode (UNOP_SIZEOF); ; break;} case 16: #line 267 "./c-exp.y" { write_exp_elt_opcode (STRUCTOP_PTR); write_exp_string (yyvsp[0].sval); write_exp_elt_opcode (STRUCTOP_PTR); ; break;} case 17: #line 273 "./c-exp.y" { /* exp->type::name becomes exp->*(&type::name) */ /* Note: this doesn't work if name is a static member! FIXME */ write_exp_elt_opcode (UNOP_ADDR); write_exp_elt_opcode (STRUCTOP_MPTR); ; break;} case 18: #line 280 "./c-exp.y" { write_exp_elt_opcode (STRUCTOP_MPTR); ; break;} case 19: #line 284 "./c-exp.y" { write_exp_elt_opcode (STRUCTOP_STRUCT); write_exp_string (yyvsp[0].sval); write_exp_elt_opcode (STRUCTOP_STRUCT); ; break;} case 20: #line 290 "./c-exp.y" { /* exp.type::name becomes exp.*(&type::name) */ /* Note: this doesn't work if name is a static member! FIXME */ write_exp_elt_opcode (UNOP_ADDR); write_exp_elt_opcode (STRUCTOP_MEMBER); ; break;} case 21: #line 298 "./c-exp.y" { write_exp_elt_opcode (STRUCTOP_MEMBER); ; break;} case 22: #line 302 "./c-exp.y" { write_exp_elt_opcode (BINOP_SUBSCRIPT); ; break;} case 23: #line 308 "./c-exp.y" { start_arglist (); ; break;} case 24: #line 310 "./c-exp.y" { write_exp_elt_opcode (OP_FUNCALL); write_exp_elt_longcst ((LONGEST) end_arglist ()); write_exp_elt_opcode (OP_FUNCALL); ; break;} case 25: #line 316 "./c-exp.y" { start_arglist (); ; break;} case 27: #line 323 "./c-exp.y" { arglist_len = 1; ; break;} case 28: #line 327 "./c-exp.y" { arglist_len++; ; break;} case 29: #line 331 "./c-exp.y" { yyval.lval = end_arglist () - 1; ; break;} case 30: #line 334 "./c-exp.y" { write_exp_elt_opcode (OP_ARRAY); write_exp_elt_longcst ((LONGEST) 0); write_exp_elt_longcst ((LONGEST) yyvsp[0].lval); write_exp_elt_opcode (OP_ARRAY); ; break;} case 31: #line 341 "./c-exp.y" { write_exp_elt_opcode (UNOP_MEMVAL); write_exp_elt_type (yyvsp[-2].tval); write_exp_elt_opcode (UNOP_MEMVAL); ; break;} case 32: #line 347 "./c-exp.y" { write_exp_elt_opcode (UNOP_CAST); write_exp_elt_type (yyvsp[-2].tval); write_exp_elt_opcode (UNOP_CAST); ; break;} case 33: #line 353 "./c-exp.y" { ; break;} case 34: #line 359 "./c-exp.y" { write_exp_elt_opcode (BINOP_REPEAT); ; break;} case 35: #line 363 "./c-exp.y" { write_exp_elt_opcode (BINOP_MUL); ; break;} case 36: #line 367 "./c-exp.y" { write_exp_elt_opcode (BINOP_DIV); ; break;} case 37: #line 371 "./c-exp.y" { write_exp_elt_opcode (BINOP_REM); ; break;} case 38: #line 375 "./c-exp.y" { write_exp_elt_opcode (BINOP_ADD); ; break;} case 39: #line 379 "./c-exp.y" { write_exp_elt_opcode (BINOP_SUB); ; break;} case 40: #line 383 "./c-exp.y" { write_exp_elt_opcode (BINOP_LSH); ; break;} case 41: #line 387 "./c-exp.y" { write_exp_elt_opcode (BINOP_RSH); ; break;} case 42: #line 391 "./c-exp.y" { write_exp_elt_opcode (BINOP_EQUAL); ; break;} case 43: #line 395 "./c-exp.y" { write_exp_elt_opcode (BINOP_NOTEQUAL); ; break;} case 44: #line 399 "./c-exp.y" { write_exp_elt_opcode (BINOP_LEQ); ; break;} case 45: #line 403 "./c-exp.y" { write_exp_elt_opcode (BINOP_GEQ); ; break;} case 46: #line 407 "./c-exp.y" { write_exp_elt_opcode (BINOP_LESS); ; break;} case 47: #line 411 "./c-exp.y" { write_exp_elt_opcode (BINOP_GTR); ; break;} case 48: #line 415 "./c-exp.y" { write_exp_elt_opcode (BINOP_BITWISE_AND); ; break;} case 49: #line 419 "./c-exp.y" { write_exp_elt_opcode (BINOP_BITWISE_XOR); ; break;} case 50: #line 423 "./c-exp.y" { write_exp_elt_opcode (BINOP_BITWISE_IOR); ; break;} case 51: #line 427 "./c-exp.y" { write_exp_elt_opcode (BINOP_LOGICAL_AND); ; break;} case 52: #line 431 "./c-exp.y" { write_exp_elt_opcode (BINOP_LOGICAL_OR); ; break;} case 53: #line 435 "./c-exp.y" { write_exp_elt_opcode (TERNOP_COND); ; break;} case 54: #line 439 "./c-exp.y" { write_exp_elt_opcode (BINOP_ASSIGN); ; break;} case 55: #line 443 "./c-exp.y" { write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); write_exp_elt_opcode (yyvsp[-1].opcode); write_exp_elt_opcode (BINOP_ASSIGN_MODIFY); ; break;} case 56: #line 449 "./c-exp.y" { write_exp_elt_opcode (OP_LONG); write_exp_elt_type (yyvsp[0].typed_val.type); write_exp_elt_longcst ((LONGEST)(yyvsp[0].typed_val.val)); write_exp_elt_opcode (OP_LONG); ; break;} case 57: #line 456 "./c-exp.y" { YYSTYPE val; parse_number (yyvsp[0].ssym.stoken.ptr, yyvsp[0].ssym.stoken.length, 0, &val); write_exp_elt_opcode (OP_LONG); write_exp_elt_type (val.typed_val.type); write_exp_elt_longcst ((LONGEST)val.typed_val.val); write_exp_elt_opcode (OP_LONG); ; break;} case 58: #line 467 "./c-exp.y" { write_exp_elt_opcode (OP_DOUBLE); write_exp_elt_type (builtin_type_double); write_exp_elt_dblcst (yyvsp[0].dval); write_exp_elt_opcode (OP_DOUBLE); ; break;} case 60: #line 477 "./c-exp.y" { write_exp_elt_opcode (OP_LAST); write_exp_elt_longcst ((LONGEST) yyvsp[0].lval); write_exp_elt_opcode (OP_LAST); ; break;} case 61: #line 483 "./c-exp.y" { write_exp_elt_opcode (OP_REGISTER); write_exp_elt_longcst ((LONGEST) yyvsp[0].lval); write_exp_elt_opcode (OP_REGISTER); ; break;} case 62: #line 489 "./c-exp.y" { write_exp_elt_opcode (OP_INTERNALVAR); write_exp_elt_intern (yyvsp[0].ivar); write_exp_elt_opcode (OP_INTERNALVAR); ; break;} case 63: #line 495 "./c-exp.y" { write_exp_elt_opcode (OP_LONG); write_exp_elt_type (builtin_type_int); write_exp_elt_longcst ((LONGEST) TYPE_LENGTH (yyvsp[-1].tval)); write_exp_elt_opcode (OP_LONG); ; break;} case 64: #line 502 "./c-exp.y" { /* C strings are converted into array constants with an explicit null byte added at the end. Thus the array upper bound is the string length. There is no such thing in C as a completely empty string. */ char *sp = yyvsp[0].sval.ptr; int count = yyvsp[0].sval.length; while (count-- > 0) { write_exp_elt_opcode (OP_LONG); write_exp_elt_type (builtin_type_char); write_exp_elt_longcst ((LONGEST)(*sp++)); write_exp_elt_opcode (OP_LONG); } write_exp_elt_opcode (OP_LONG); write_exp_elt_type (builtin_type_char); write_exp_elt_longcst ((LONGEST)'\0'); write_exp_elt_opcode (OP_LONG); write_exp_elt_opcode (OP_ARRAY); write_exp_elt_longcst ((LONGEST) 0); write_exp_elt_longcst ((LONGEST) (yyvsp[0].sval.length)); write_exp_elt_opcode (OP_ARRAY); ; break;} case 65: #line 527 "./c-exp.y" { write_exp_elt_opcode (OP_THIS); write_exp_elt_opcode (OP_THIS); ; break;} case 66: #line 534 "./c-exp.y" { if (yyvsp[0].ssym.sym != 0) yyval.bval = SYMBOL_BLOCK_VALUE (yyvsp[0].ssym.sym); else { struct symtab *tem = lookup_symtab (copy_name (yyvsp[0].ssym.stoken)); if (tem) yyval.bval = BLOCKVECTOR_BLOCK (BLOCKVECTOR (tem), STATIC_BLOCK); else error ("No file or function \"%s\".", copy_name (yyvsp[0].ssym.stoken)); } ; break;} case 67: #line 552 "./c-exp.y" { struct symbol *tem = lookup_symbol (copy_name (yyvsp[0].sval), yyvsp[-2].bval, VAR_NAMESPACE, (int *) NULL, (struct symtab **) NULL); if (!tem || SYMBOL_CLASS (tem) != LOC_BLOCK) error ("No function \"%s\" in specified context.", copy_name (yyvsp[0].sval)); yyval.bval = SYMBOL_BLOCK_VALUE (tem); ; break;} case 68: #line 563 "./c-exp.y" { struct symbol *sym; sym = lookup_symbol (copy_name (yyvsp[0].sval), yyvsp[-2].bval, VAR_NAMESPACE, (int *) NULL, (struct symtab **) NULL); if (sym == 0) error ("No symbol \"%s\" in specified context.", copy_name (yyvsp[0].sval)); write_exp_elt_opcode (OP_VAR_VALUE); /* block_found is set by lookup_symbol. */ write_exp_elt_block (block_found); write_exp_elt_sym (sym); write_exp_elt_opcode (OP_VAR_VALUE); ; break;} case 69: #line 579 "./c-exp.y" { struct type *type = yyvsp[-2].tval; if (TYPE_CODE (type) != TYPE_CODE_STRUCT && TYPE_CODE (type) != TYPE_CODE_UNION) error ("`%s' is not defined as an aggregate type.", TYPE_NAME (type)); write_exp_elt_opcode (OP_SCOPE); write_exp_elt_type (type); write_exp_string (yyvsp[0].sval); write_exp_elt_opcode (OP_SCOPE); ; break;} case 70: #line 592 "./c-exp.y" { struct type *type = yyvsp[-3].tval; struct stoken tmp_token; if (TYPE_CODE (type) != TYPE_CODE_STRUCT && TYPE_CODE (type) != TYPE_CODE_UNION) error ("`%s' is not defined as an aggregate type.", TYPE_NAME (type)); if (!STREQ (type_name_no_tag (type), yyvsp[0].sval.ptr)) error ("invalid destructor `%s::~%s'", type_name_no_tag (type), yyvsp[0].sval.ptr); tmp_token.ptr = (char*) alloca (yyvsp[0].sval.length + 2); tmp_token.length = yyvsp[0].sval.length + 1; tmp_token.ptr[0] = '~'; memcpy (tmp_token.ptr+1, yyvsp[0].sval.ptr, yyvsp[0].sval.length); tmp_token.ptr[tmp_token.length] = 0; write_exp_elt_opcode (OP_SCOPE); write_exp_elt_type (type); write_exp_string (tmp_token); write_exp_elt_opcode (OP_SCOPE); ; break;} case 72: #line 618 "./c-exp.y" { char *name = copy_name (yyvsp[0].sval); struct symbol *sym; struct minimal_symbol *msymbol; sym = lookup_symbol (name, (const struct block *) NULL, VAR_NAMESPACE, (int *) NULL, (struct symtab **) NULL); if (sym) { write_exp_elt_opcode (OP_VAR_VALUE); write_exp_elt_block (NULL); write_exp_elt_sym (sym); write_exp_elt_opcode (OP_VAR_VALUE); break; } msymbol = lookup_minimal_symbol (name, NULL, NULL); if (msymbol != NULL) { write_exp_msymbol (msymbol, lookup_function_type (builtin_type_int), builtin_type_int); } else if (!have_full_symbols () && !have_partial_symbols ()) error ("No symbol table is loaded. Use the \"file\" command."); else error ("No symbol \"%s\" in current context.", name); ; break;} case 73: #line 652 "./c-exp.y" { struct symbol *sym = yyvsp[0].ssym.sym; if (sym) { if (symbol_read_needs_frame (sym)) { if (innermost_block == 0 || contained_in (block_found, innermost_block)) innermost_block = block_found; } write_exp_elt_opcode (OP_VAR_VALUE); /* We want to use the selected frame, not another more inner frame which happens to be in the same block. */ write_exp_elt_block (NULL); write_exp_elt_sym (sym); write_exp_elt_opcode (OP_VAR_VALUE); } else if (yyvsp[0].ssym.is_a_field_of_this) { /* C++: it hangs off of `this'. Must not inadvertently convert from a method call to data ref. */ if (innermost_block == 0 || contained_in (block_found, innermost_block)) innermost_block = block_found; write_exp_elt_opcode (OP_THIS); write_exp_elt_opcode (OP_THIS); write_exp_elt_opcode (STRUCTOP_PTR); write_exp_string (yyvsp[0].ssym.stoken); write_exp_elt_opcode (STRUCTOP_PTR); } else { struct minimal_symbol *msymbol; register char *arg = copy_name (yyvsp[0].ssym.stoken); msymbol = lookup_minimal_symbol (arg, NULL, NULL); if (msymbol != NULL) { write_exp_msymbol (msymbol, lookup_function_type (builtin_type_int), builtin_type_int); } else if (!have_full_symbols () && !have_partial_symbols ()) error ("No symbol table is loaded. Use the \"file\" command."); else error ("No symbol \"%s\" in current context.", copy_name (yyvsp[0].ssym.stoken)); } ; break;} case 77: #line 718 "./c-exp.y" { yyval.tval = follow_types (yyvsp[-1].tval); ; break;} case 78: #line 720 "./c-exp.y" { yyval.tval = follow_types (yyvsp[-2].tval); ; break;} case 79: #line 722 "./c-exp.y" { yyval.tval = follow_types (yyvsp[-2].tval); ; break;} case 80: #line 726 "./c-exp.y" { push_type (tp_pointer); yyval.voidval = 0; ; break;} case 81: #line 728 "./c-exp.y" { push_type (tp_pointer); yyval.voidval = yyvsp[0].voidval; ; break;} case 82: #line 730 "./c-exp.y" { push_type (tp_reference); yyval.voidval = 0; ; break;} case 83: #line 732 "./c-exp.y" { push_type (tp_reference); yyval.voidval = yyvsp[0].voidval; ; break;} case 85: #line 737 "./c-exp.y" { yyval.voidval = yyvsp[-1].voidval; ; break;} case 86: #line 739 "./c-exp.y" { push_type_int (yyvsp[0].lval); push_type (tp_array); ; break;} case 87: #line 744 "./c-exp.y" { push_type_int (yyvsp[0].lval); push_type (tp_array); yyval.voidval = 0; ; break;} case 88: #line 751 "./c-exp.y" { push_type (tp_function); ; break;} case 89: #line 753 "./c-exp.y" { push_type (tp_function); ; break;} case 90: #line 757 "./c-exp.y" { yyval.lval = -1; ; break;} case 91: #line 759 "./c-exp.y" { yyval.lval = yyvsp[-1].typed_val.val; ; break;} case 92: #line 763 "./c-exp.y" { yyval.voidval = 0; ; break;} case 93: #line 765 "./c-exp.y" { free ((PTR)yyvsp[-1].tvec); yyval.voidval = 0; ; break;} case 95: #line 778 "./c-exp.y" { yyval.tval = lookup_member_type (builtin_type_int, yyvsp[-2].tval); ; break;} case 96: #line 783 "./c-exp.y" { yyval.tval = yyvsp[0].tsym.type; ; break;} case 97: #line 785 "./c-exp.y" { yyval.tval = builtin_type_int; ; break;} case 98: #line 787 "./c-exp.y" { yyval.tval = builtin_type_long; ; break;} case 99: #line 789 "./c-exp.y" { yyval.tval = builtin_type_short; ; break;} case 100: #line 791 "./c-exp.y" { yyval.tval = builtin_type_long; ; break;} case 101: #line 793 "./c-exp.y" { yyval.tval = builtin_type_unsigned_long; ; break;} case 102: #line 795 "./c-exp.y" { yyval.tval = builtin_type_long_long; ; break;} case 103: #line 797 "./c-exp.y" { yyval.tval = builtin_type_long_long; ; break;} case 104: #line 799 "./c-exp.y" { yyval.tval = builtin_type_unsigned_long_long; ; break;} case 105: #line 801 "./c-exp.y" { yyval.tval = builtin_type_unsigned_long_long; ; break;} case 106: #line 803 "./c-exp.y" { yyval.tval = builtin_type_short; ; break;} case 107: #line 805 "./c-exp.y" { yyval.tval = builtin_type_unsigned_short; ; break;} case 108: #line 807 "./c-exp.y" { yyval.tval = lookup_struct (copy_name (yyvsp[0].sval), expression_context_block); ; break;} case 109: #line 810 "./c-exp.y" { yyval.tval = lookup_struct (copy_name (yyvsp[0].sval), expression_context_block); ; break;} case 110: #line 813 "./c-exp.y" { yyval.tval = lookup_union (copy_name (yyvsp[0].sval), expression_context_block); ; break;} case 111: #line 816 "./c-exp.y" { yyval.tval = lookup_enum (copy_name (yyvsp[0].sval), expression_context_block); ; break;} case 112: #line 819 "./c-exp.y" { yyval.tval = lookup_unsigned_typename (TYPE_NAME(yyvsp[0].tsym.type)); ; break;} case 113: #line 821 "./c-exp.y" { yyval.tval = builtin_type_unsigned_int; ; break;} case 114: #line 823 "./c-exp.y" { yyval.tval = lookup_signed_typename (TYPE_NAME(yyvsp[0].tsym.type)); ; break;} case 115: #line 825 "./c-exp.y" { yyval.tval = builtin_type_int; ; break;} case 116: #line 827 "./c-exp.y" { yyval.tval = lookup_template_type(copy_name(yyvsp[-3].sval), yyvsp[-1].tval, expression_context_block); ; break;} case 117: #line 833 "./c-exp.y" { yyval.tval = yyvsp[0].tval; ; break;} case 118: #line 834 "./c-exp.y" { yyval.tval = yyvsp[0].tval; ; break;} case 120: #line 839 "./c-exp.y" { yyval.tsym.stoken.ptr = "int"; yyval.tsym.stoken.length = 3; yyval.tsym.type = builtin_type_int; ; break;} case 121: #line 845 "./c-exp.y" { yyval.tsym.stoken.ptr = "long"; yyval.tsym.stoken.length = 4; yyval.tsym.type = builtin_type_long; ; break;} case 122: #line 851 "./c-exp.y" { yyval.tsym.stoken.ptr = "short"; yyval.tsym.stoken.length = 5; yyval.tsym.type = builtin_type_short; ; break;} case 123: #line 860 "./c-exp.y" { yyval.tvec = (struct type **) xmalloc (sizeof (struct type *) * 2); yyval.ivec[0] = 1; /* Number of types in vector */ yyval.tvec[1] = yyvsp[0].tval; ; break;} case 124: #line 865 "./c-exp.y" { int len = sizeof (struct type *) * (++(yyvsp[-2].ivec[0]) + 1); yyval.tvec = (struct type **) xrealloc ((char *) yyvsp[-2].tvec, len); yyval.tvec[yyval.ivec[0]] = yyvsp[0].tval; ; break;} case 125: #line 871 "./c-exp.y" { yyval.sval = yyvsp[0].ssym.stoken; ; break;} case 126: #line 872 "./c-exp.y" { yyval.sval = yyvsp[0].ssym.stoken; ; break;} case 127: #line 873 "./c-exp.y" { yyval.sval = yyvsp[0].tsym.stoken; ; break;} case 128: #line 874 "./c-exp.y" { yyval.sval = yyvsp[0].ssym.stoken; ; break;} } /* the action file gets copied in in place of this dollarsign */ #line 465 "/usr/unsupported/lib/bison.simple" yyvsp -= yylen; yyssp -= yylen; #ifdef YYLSP_NEEDED yylsp -= yylen; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif *++yyvsp = yyval; #ifdef YYLSP_NEEDED yylsp++; if (yylen == 0) { yylsp->first_line = yylloc.first_line; yylsp->first_column = yylloc.first_column; yylsp->last_line = (yylsp-1)->last_line; yylsp->last_column = (yylsp-1)->last_column; yylsp->text = 0; } else { yylsp->last_line = (yylsp+yylen-1)->last_line; yylsp->last_column = (yylsp+yylen-1)->last_column; } #endif /* Now "shift" the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ yyn = yyr1[yyn]; yystate = yypgoto[yyn - YYNTBASE] + *yyssp; if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; yyerrlab: /* here on detecting error */ if (! yyerrstatus) /* If not already recovering from an error, report this error. */ { ++yynerrs; #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; if (yyn > YYFLAG && yyn < YYLAST) { int size = 0; char *msg; int x, count; count = 0; /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) size += strlen(yytname[x]) + 15, count++; msg = (char *) xmalloc(size + 15); if (msg != 0) { strcpy(msg, "parse error"); if (count < 5) { count = 0; for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) { strcat(msg, count == 0 ? ", expecting `" : " or `"); strcat(msg, yytname[x]); strcat(msg, "'"); count++; } } yyerror(msg); free(msg); } else yyerror ("parse error; also virtual memory exceeded"); } else #endif /* YYERROR_VERBOSE */ yyerror("parse error"); } goto yyerrlab1; yyerrlab1: /* here on error raised explicitly by an action */ if (yyerrstatus == 3) { /* if just tried and failed to reuse lookahead token after an error, discard it. */ /* return failure if at end of input */ if (yychar == YYEOF) YYABORT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); #endif yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ yyerrstatus = 3; /* Each real token shifted decrements this */ goto yyerrhandle; yyerrdefault: /* current state does not do anything special for the error token. */ #if 0 /* This is wrong; only states that explicitly want error tokens should shift them. */ yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ if (yyn) goto yydefault; #endif yyerrpop: /* pop the current state because it cannot handle the error token */ if (yyssp == yyss) YYABORT; yyvsp--; yystate = *--yyssp; #ifdef YYLSP_NEEDED yylsp--; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "Error: state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif yyerrhandle: yyn = yypact[yystate]; if (yyn == YYFLAG) goto yyerrdefault; yyn += YYTERROR; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) goto yyerrdefault; yyn = yytable[yyn]; if (yyn < 0) { if (yyn == YYFLAG) goto yyerrpop; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting error token, "); #endif *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif yystate = yyn; goto yynewstate; } #line 888 "./c-exp.y" /* Take care of parsing a number (anything that starts with a digit). Set yylval and return the token type; update lexptr. LEN is the number of characters in it. */ /*** Needs some error checking for the float case ***/ static int parse_number (p, len, parsed_float, putithere) register char *p; register int len; int parsed_float; YYSTYPE *putithere; { /* FIXME: Shouldn't these be unsigned? We don't deal with negative values here, and we do kind of silly things like cast to unsigned. */ register LONGEST n = 0; register LONGEST prevn = 0; unsigned LONGEST un; register int i = 0; register int c; register int base = input_radix; int unsigned_p = 0; /* Number of "L" suffixes encountered. */ int long_p = 0; /* We have found a "L" or "U" suffix. */ int found_suffix = 0; unsigned LONGEST high_bit; struct type *signed_type; struct type *unsigned_type; if (parsed_float) { /* It's a float since it contains a point or an exponent. */ putithere->dval = atof (p); return FLOAT; } /* Handle base-switching prefixes 0x, 0t, 0d, 0 */ if (p[0] == '0') switch (p[1]) { case 'x': case 'X': if (len >= 3) { p += 2; base = 16; len -= 2; } break; case 't': case 'T': case 'd': case 'D': if (len >= 3) { p += 2; base = 10; len -= 2; } break; default: base = 8; break; } while (len-- > 0) { c = *p++; if (c >= 'A' && c <= 'Z') c += 'a' - 'A'; if (c != 'l' && c != 'u') n *= base; if (c >= '0' && c <= '9') { if (found_suffix) return ERROR; n += i = c - '0'; } else { if (base > 10 && c >= 'a' && c <= 'f') { if (found_suffix) return ERROR; n += i = c - 'a' + 10; } else if (c == 'l') { ++long_p; found_suffix = 1; } else if (c == 'u') { unsigned_p = 1; found_suffix = 1; } else return ERROR; /* Char not a digit */ } if (i >= base) return ERROR; /* Invalid digit in this base */ /* Portably test for overflow (only works for nonzero values, so make a second check for zero). FIXME: Can't we just make n and prevn unsigned and avoid this? */ if (c != 'l' && c != 'u' && (prevn >= n) && n != 0) unsigned_p = 1; /* Try something unsigned */ /* Portably test for unsigned overflow. FIXME: This check is wrong; for example it doesn't find overflow on 0x123456789 when LONGEST is 32 bits. */ if (c != 'l' && c != 'u' && n != 0) { if ((unsigned_p && (unsigned LONGEST) prevn >= (unsigned LONGEST) n)) error ("Numeric constant too large."); } prevn = n; } /* An integer constant is an int, a long, or a long long. An L suffix forces it to be long; an LL suffix forces it to be long long. If not forced to a larger size, it gets the first type of the above that it fits in. To figure out whether it fits, we shift it right and see whether anything remains. Note that we can't shift sizeof (LONGEST) * HOST_CHAR_BIT bits or more in one operation, because many compilers will warn about such a shift (which always produces a zero result). Sometimes TARGET_INT_BIT or TARGET_LONG_BIT will be that big, sometimes not. To deal with the case where it is we just always shift the value more than once, with fewer bits each time. */ un = (unsigned LONGEST)n >> 2; if (long_p == 0 && (un >> (TARGET_INT_BIT - 2)) == 0) { high_bit = ((unsigned LONGEST)1) << (TARGET_INT_BIT-1); /* A large decimal (not hex or octal) constant (between INT_MAX and UINT_MAX) is a long or unsigned long, according to ANSI, never an unsigned int, but this code treats it as unsigned int. This probably should be fixed. GCC gives a warning on such constants. */ unsigned_type = builtin_type_unsigned_int; signed_type = builtin_type_int; } else if (long_p <= 1 && (un >> (TARGET_LONG_BIT - 2)) == 0) { high_bit = ((unsigned LONGEST)1) << (TARGET_LONG_BIT-1); unsigned_type = builtin_type_unsigned_long; signed_type = builtin_type_long; } else { high_bit = (((unsigned LONGEST)1) << (TARGET_LONG_LONG_BIT - 32 - 1) << 16 << 16); if (high_bit == 0) /* A long long does not fit in a LONGEST. */ high_bit = (unsigned LONGEST)1 << (sizeof (LONGEST) * HOST_CHAR_BIT - 1); unsigned_type = builtin_type_unsigned_long_long; signed_type = builtin_type_long_long; } putithere->typed_val.val = n; /* If the high bit of the worked out type is set then this number has to be unsigned. */ if (unsigned_p || (n & high_bit)) { putithere->typed_val.type = unsigned_type; } else { putithere->typed_val.type = signed_type; } return INT; } struct token { char *operator; int token; enum exp_opcode opcode; }; static const struct token tokentab3[] = { {">>=", ASSIGN_MODIFY, BINOP_RSH}, {"<<=", ASSIGN_MODIFY, BINOP_LSH} }; static const struct token tokentab2[] = { {"+=", ASSIGN_MODIFY, BINOP_ADD}, {"-=", ASSIGN_MODIFY, BINOP_SUB}, {"*=", ASSIGN_MODIFY, BINOP_MUL}, {"/=", ASSIGN_MODIFY, BINOP_DIV}, {"%=", ASSIGN_MODIFY, BINOP_REM}, {"|=", ASSIGN_MODIFY, BINOP_BITWISE_IOR}, {"&=", ASSIGN_MODIFY, BINOP_BITWISE_AND}, {"^=", ASSIGN_MODIFY, BINOP_BITWISE_XOR}, {"++", INCREMENT, BINOP_END}, {"--", DECREMENT, BINOP_END}, {"->", ARROW, BINOP_END}, {"&&", ANDAND, BINOP_END}, {"||", OROR, BINOP_END}, {"::", COLONCOLON, BINOP_END}, {"<<", LSH, BINOP_END}, {">>", RSH, BINOP_END}, {"==", EQUAL, BINOP_END}, {"!=", NOTEQUAL, BINOP_END}, {"<=", LEQ, BINOP_END}, {">=", GEQ, BINOP_END} }; /* Read one token, getting characters through lexptr. */ static int yylex () { int c; int namelen; unsigned int i; char *tokstart; char *tokptr; int tempbufindex; static char *tempbuf; static int tempbufsize; retry: tokstart = lexptr; /* See if it is a special token of length 3. */ for (i = 0; i < sizeof tokentab3 / sizeof tokentab3[0]; i++) if (STREQN (tokstart, tokentab3[i].operator, 3)) { lexptr += 3; yylval.opcode = tokentab3[i].opcode; return tokentab3[i].token; } /* See if it is a special token of length 2. */ for (i = 0; i < sizeof tokentab2 / sizeof tokentab2[0]; i++) if (STREQN (tokstart, tokentab2[i].operator, 2)) { lexptr += 2; yylval.opcode = tokentab2[i].opcode; return tokentab2[i].token; } switch (c = *tokstart) { case 0: return 0; case ' ': case '\t': case '\n': lexptr++; goto retry; case '\'': /* We either have a character constant ('0' or '\177' for example) or we have a quoted symbol reference ('foo(int,int)' in C++ for example). */ lexptr++; c = *lexptr++; if (c == '\\') c = parse_escape (&lexptr); yylval.typed_val.val = c; yylval.typed_val.type = builtin_type_char; c = *lexptr++; if (c != '\'') { namelen = skip_quoted (tokstart) - tokstart; if (namelen > 2) { lexptr = tokstart + namelen; if (lexptr[-1] != '\'') error ("Unmatched single quote."); namelen -= 2; tokstart++; goto tryname; } error ("Invalid character constant."); } return INT; case '(': paren_depth++; lexptr++; return c; case ')': if (paren_depth == 0) return 0; paren_depth--; lexptr++; return c; case ',': if (comma_terminates && paren_depth == 0) return 0; lexptr++; return c; case '.': /* Might be a floating point number. */ if (lexptr[1] < '0' || lexptr[1] > '9') goto symbol; /* Nope, must be a symbol. */ /* FALL THRU into number case. */ case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': { /* It's a number. */ int got_dot = 0, got_e = 0, toktype; register char *p = tokstart; int hex = input_radix > 10; if (c == '0' && (p[1] == 'x' || p[1] == 'X')) { p += 2; hex = 1; } else if (c == '0' && (p[1]=='t' || p[1]=='T' || p[1]=='d' || p[1]=='D')) { p += 2; hex = 0; } for (;; ++p) { /* This test includes !hex because 'e' is a valid hex digit and thus does not indicate a floating point number when the radix is hex. */ if (!hex && !got_e && (*p == 'e' || *p == 'E')) got_dot = got_e = 1; /* This test does not include !hex, because a '.' always indicates a decimal floating point number regardless of the radix. */ else if (!got_dot && *p == '.') got_dot = 1; else if (got_e && (p[-1] == 'e' || p[-1] == 'E') && (*p == '-' || *p == '+')) /* This is the sign of the exponent, not the end of the number. */ continue; /* We will take any letters or digits. parse_number will complain if past the radix, or if L or U are not final. */ else if ((*p < '0' || *p > '9') && ((*p < 'a' || *p > 'z') && (*p < 'A' || *p > 'Z'))) break; } toktype = parse_number (tokstart, p - tokstart, got_dot|got_e, &yylval); if (toktype == ERROR) { char *err_copy = (char *) alloca (p - tokstart + 1); memcpy (err_copy, tokstart, p - tokstart); err_copy[p - tokstart] = 0; error ("Invalid number \"%s\".", err_copy); } lexptr = p; return toktype; } case '+': case '-': case '*': case '/': case '%': case '|': case '&': case '^': case '~': case '!': case '@': case '<': case '>': case '[': case ']': case '?': case ':': case '=': case '{': case '}': symbol: lexptr++; return c; case '"': /* Build the gdb internal form of the input string in tempbuf, translating any standard C escape forms seen. Note that the buffer is null byte terminated *only* for the convenience of debugging gdb itself and printing the buffer contents when the buffer contains no embedded nulls. Gdb does not depend upon the buffer being null byte terminated, it uses the length string instead. This allows gdb to handle C strings (as well as strings in other languages) with embedded null bytes */ tokptr = ++tokstart; tempbufindex = 0; do { /* Grow the static temp buffer if necessary, including allocating the first one on demand. */ if (tempbufindex + 1 >= tempbufsize) { tempbuf = (char *) xrealloc (tempbuf, tempbufsize += 64); } switch (*tokptr) { case '\0': case '"': /* Do nothing, loop will terminate. */ break; case '\\': tokptr++; c = parse_escape (&tokptr); if (c == -1) { continue; } tempbuf[tempbufindex++] = c; break; default: tempbuf[tempbufindex++] = *tokptr++; break; } } while ((*tokptr != '"') && (*tokptr != '\0')); if (*tokptr++ != '"') { error ("Unterminated string in expression."); } tempbuf[tempbufindex] = '\0'; /* See note above */ yylval.sval.ptr = tempbuf; yylval.sval.length = tempbufindex; lexptr = tokptr; return (STRING); } if (!(c == '_' || c == '$' || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))) /* We must have come across a bad character (e.g. ';'). */ error ("Invalid character '%c' in expression.", c); /* It's a name. See how long it is. */ namelen = 0; for (c = tokstart[namelen]; (c == '_' || c == '$' || (c >= '0' && c <= '9') || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '<');) { if (c == '<') { int i = namelen; while (tokstart[++i] && tokstart[i] != '>'); if (tokstart[i] == '>') namelen = i; } c = tokstart[++namelen]; } /* The token "if" terminates the expression and is NOT removed from the input stream. */ if (namelen == 2 && tokstart[0] == 'i' && tokstart[1] == 'f') { return 0; } lexptr += namelen; /* Handle the tokens $digits; also $ (short for $0) and $$ (short for $$1) and $$digits (equivalent to $<-digits> if you could type that). Make token type LAST, and put the number (the digits) in yylval. */ tryname: if (*tokstart == '$') { register int negate = 0; c = 1; /* Double dollar means negate the number and add -1 as well. Thus $$ alone means -1. */ if (namelen >= 2 && tokstart[1] == '$') { negate = 1; c = 2; } if (c == namelen) { /* Just dollars (one or two) */ yylval.lval = - negate; return LAST; } /* Is the rest of the token digits? */ for (; c < namelen; c++) if (!(tokstart[c] >= '0' && tokstart[c] <= '9')) break; if (c == namelen) { yylval.lval = atoi (tokstart + 1 + negate); if (negate) yylval.lval = - yylval.lval; return LAST; } } /* Handle tokens that refer to machine registers: $ followed by a register name. */ if (*tokstart == '$') { for (c = 0; c < NUM_REGS; c++) if (namelen - 1 == strlen (reg_names[c]) && STREQN (tokstart + 1, reg_names[c], namelen - 1)) { yylval.lval = c; return REGNAME; } for (c = 0; c < num_std_regs; c++) if (namelen - 1 == strlen (std_regs[c].name) && STREQN (tokstart + 1, std_regs[c].name, namelen - 1)) { yylval.lval = std_regs[c].regnum; return REGNAME; } } /* Catch specific keywords. Should be done with a data structure. */ switch (namelen) { case 8: if (STREQN (tokstart, "unsigned", 8)) return UNSIGNED; if (current_language->la_language == language_cplus && STREQN (tokstart, "template", 8)) return TEMPLATE; if (STREQN (tokstart, "volatile", 8)) return VOLATILE_KEYWORD; break; case 6: if (STREQN (tokstart, "struct", 6)) return STRUCT; if (STREQN (tokstart, "signed", 6)) return SIGNED_KEYWORD; if (STREQN (tokstart, "sizeof", 6)) return SIZEOF; break; case 5: if (current_language->la_language == language_cplus && STREQN (tokstart, "class", 5)) return CLASS; if (STREQN (tokstart, "union", 5)) return UNION; if (STREQN (tokstart, "short", 5)) return SHORT; if (STREQN (tokstart, "const", 5)) return CONST_KEYWORD; break; case 4: if (STREQN (tokstart, "enum", 4)) return ENUM; if (STREQN (tokstart, "long", 4)) return LONG; if (current_language->la_language == language_cplus && STREQN (tokstart, "this", 4)) { static const char this_name[] = { CPLUS_MARKER, 't', 'h', 'i', 's', '\0' }; if (lookup_symbol (this_name, expression_context_block, VAR_NAMESPACE, (int *) NULL, (struct symtab **) NULL)) return THIS; } break; case 3: if (STREQN (tokstart, "int", 3)) return INT_KEYWORD; break; default: break; } yylval.sval.ptr = tokstart; yylval.sval.length = namelen; /* Any other names starting in $ are debugger internal variables. */ if (*tokstart == '$') { yylval.ivar = lookup_internalvar (copy_name (yylval.sval) + 1); return VARIABLE; } /* Use token-type BLOCKNAME for symbols that happen to be defined as functions or symtabs. If this is not so, then ... Use token-type TYPENAME for symbols that happen to be defined currently as names of types; NAME for other symbols. The caller is not constrained to care about the distinction. */ { char *tmp = copy_name (yylval.sval); struct symbol *sym; int is_a_field_of_this = 0; int hextype; sym = lookup_symbol (tmp, expression_context_block, VAR_NAMESPACE, current_language->la_language == language_cplus ? &is_a_field_of_this : (int *) NULL, (struct symtab **) NULL); /* Call lookup_symtab, not lookup_partial_symtab, in case there are no psymtabs (coff, xcoff, or some future change to blow away the psymtabs once once symbols are read). */ if ((sym && SYMBOL_CLASS (sym) == LOC_BLOCK) || lookup_symtab (tmp)) { yylval.ssym.sym = sym; yylval.ssym.is_a_field_of_this = is_a_field_of_this; return BLOCKNAME; } if (sym && SYMBOL_CLASS (sym) == LOC_TYPEDEF) { #if 1 /* Despite the following flaw, we need to keep this code enabled. Because we can get called from check_stub_method, if we don't handle nested types then it screws many operations in any program which uses nested types. */ /* In "A::x", if x is a member function of A and there happens to be a type (nested or not, since the stabs don't make that distinction) named x, then this code incorrectly thinks we are dealing with nested types rather than a member function. */ char *p; char *namestart; struct symbol *best_sym; /* Look ahead to detect nested types. This probably should be done in the grammar, but trying seemed to introduce a lot of shift/reduce and reduce/reduce conflicts. It's possible that it could be done, though. Or perhaps a non-grammar, but less ad hoc, approach would work well. */ /* Since we do not currently have any way of distinguishing a nested type from a non-nested one (the stabs don't tell us whether a type is nested), we just ignore the containing type. */ p = lexptr; best_sym = sym; while (1) { /* Skip whitespace. */ while (*p == ' ' || *p == '\t' || *p == '\n') ++p; if (*p == ':' && p[1] == ':') { /* Skip the `::'. */ p += 2; /* Skip whitespace. */ while (*p == ' ' || *p == '\t' || *p == '\n') ++p; namestart = p; while (*p == '_' || *p == '$' || (*p >= '0' && *p <= '9') || (*p >= 'a' && *p <= 'z') || (*p >= 'A' && *p <= 'Z')) ++p; if (p != namestart) { struct symbol *cur_sym; /* As big as the whole rest of the expression, which is at least big enough. */ char *ncopy = alloca (strlen (tmp)+strlen (namestart)+3); char *tmp1; tmp1 = ncopy; memcpy (tmp1, tmp, strlen (tmp)); tmp1 += strlen (tmp); memcpy (tmp1, "::", 2); tmp1 += 2; memcpy (tmp1, namestart, p - namestart); tmp1[p - namestart] = '\0'; cur_sym = lookup_symbol (ncopy, expression_context_block, VAR_NAMESPACE, (int *) NULL, (struct symtab **) NULL); if (cur_sym) { if (SYMBOL_CLASS (cur_sym) == LOC_TYPEDEF) { best_sym = cur_sym; lexptr = p; } else break; } else break; } else break; } else break; } yylval.tsym.type = SYMBOL_TYPE (best_sym); #else /* not 0 */ yylval.tsym.type = SYMBOL_TYPE (sym); #endif /* not 0 */ return TYPENAME; } if ((yylval.tsym.type = lookup_primitive_typename (tmp)) != 0) return TYPENAME; /* Input names that aren't symbols but ARE valid hex numbers, when the input radix permits them, can be names or numbers depending on the parse. Note we support radixes > 16 here. */ if (!sym && ((tokstart[0] >= 'a' && tokstart[0] < 'a' + input_radix - 10) || (tokstart[0] >= 'A' && tokstart[0] < 'A' + input_radix - 10))) { YYSTYPE newlval; /* Its value is ignored. */ hextype = parse_number (tokstart, namelen, 0, &newlval); if (hextype == INT) { yylval.ssym.sym = sym; yylval.ssym.is_a_field_of_this = is_a_field_of_this; return NAME_OR_INT; } } /* Any other kind of symbol */ yylval.ssym.sym = sym; yylval.ssym.is_a_field_of_this = is_a_field_of_this; return NAME; } } void yyerror (msg) char *msg; { error ("A %s in expression, near `%s'.", (msg ? msg : "error"), lexptr); }