/* A Bison parser, made from ./parse.y by GNU Bison version 1.25 */ #define YYBISON 1 /* Identify Bison output. */ #define yyparse java_parse #define yylex java_lex #define yyerror java_error #define yylval java_lval #define yychar java_char #define yydebug java_debug #define yynerrs java_nerrs #define PLUS_TK 258 #define MINUS_TK 259 #define MULT_TK 260 #define DIV_TK 261 #define REM_TK 262 #define LS_TK 263 #define SRS_TK 264 #define ZRS_TK 265 #define AND_TK 266 #define XOR_TK 267 #define OR_TK 268 #define BOOL_AND_TK 269 #define BOOL_OR_TK 270 #define EQ_TK 271 #define NEQ_TK 272 #define GT_TK 273 #define GTE_TK 274 #define LT_TK 275 #define LTE_TK 276 #define PLUS_ASSIGN_TK 277 #define MINUS_ASSIGN_TK 278 #define MULT_ASSIGN_TK 279 #define DIV_ASSIGN_TK 280 #define REM_ASSIGN_TK 281 #define LS_ASSIGN_TK 282 #define SRS_ASSIGN_TK 283 #define ZRS_ASSIGN_TK 284 #define AND_ASSIGN_TK 285 #define XOR_ASSIGN_TK 286 #define OR_ASSIGN_TK 287 #define PUBLIC_TK 288 #define PRIVATE_TK 289 #define PROTECTED_TK 290 #define STATIC_TK 291 #define FINAL_TK 292 #define SYNCHRONIZED_TK 293 #define VOLATILE_TK 294 #define TRANSIENT_TK 295 #define NATIVE_TK 296 #define PAD_TK 297 #define ABSTRACT_TK 298 #define MODIFIER_TK 299 #define DECR_TK 300 #define INCR_TK 301 #define DEFAULT_TK 302 #define IF_TK 303 #define THROW_TK 304 #define BOOLEAN_TK 305 #define DO_TK 306 #define IMPLEMENTS_TK 307 #define THROWS_TK 308 #define BREAK_TK 309 #define IMPORT_TK 310 #define ELSE_TK 311 #define INSTANCEOF_TK 312 #define RETURN_TK 313 #define VOID_TK 314 #define CATCH_TK 315 #define INTERFACE_TK 316 #define CASE_TK 317 #define EXTENDS_TK 318 #define FINALLY_TK 319 #define SUPER_TK 320 #define WHILE_TK 321 #define CLASS_TK 322 #define SWITCH_TK 323 #define CONST_TK 324 #define TRY_TK 325 #define FOR_TK 326 #define NEW_TK 327 #define CONTINUE_TK 328 #define GOTO_TK 329 #define PACKAGE_TK 330 #define THIS_TK 331 #define BYTE_TK 332 #define SHORT_TK 333 #define INT_TK 334 #define LONG_TK 335 #define CHAR_TK 336 #define INTEGRAL_TK 337 #define FLOAT_TK 338 #define DOUBLE_TK 339 #define FP_TK 340 #define ID_TK 341 #define REL_QM_TK 342 #define REL_CL_TK 343 #define NOT_TK 344 #define NEG_TK 345 #define ASSIGN_ANY_TK 346 #define ASSIGN_TK 347 #define OP_TK 348 #define CP_TK 349 #define OCB_TK 350 #define CCB_TK 351 #define OSB_TK 352 #define CSB_TK 353 #define SC_TK 354 #define C_TK 355 #define DOT_TK 356 #define STRING_LIT_TK 357 #define CHAR_LIT_TK 358 #define INT_LIT_TK 359 #define FP_LIT_TK 360 #define TRUE_TK 361 #define FALSE_TK 362 #define BOOL_LIT_TK 363 #define NULL_TK 364 #line 48 "./parse.y" #include #include #include #include #ifdef __STDC__ #include #else #include #endif #include "config.h" #include "tree.h" #include "rtl.h" #include "obstack.h" #include "toplev.h" #include "flags.h" #include "java-tree.h" #include "jcf.h" #include "lex.h" #include "parse.h" #include "zipfile.h" #include "convert.h" /* Number of error found so far. */ int java_error_count; /* Number of warning found so far. */ int java_warning_count; /* The current parser context */ static struct parser_ctxt *ctxp; /* List of things that were anlyzed for which code will be generated */ static struct parser_ctxt *ctxp_for_generation = NULL; /* binop_lookup maps token to tree_code. It is used where binary operations are involved and required by the parser. RDIV_EXPR covers both integral/floating point division. The code is changed once the type of both operator is worked out. */ static enum tree_code binop_lookup[19] = { PLUS_EXPR, MINUS_EXPR, MULT_EXPR, RDIV_EXPR, TRUNC_MOD_EXPR, LSHIFT_EXPR, RSHIFT_EXPR, URSHIFT_EXPR, BIT_AND_EXPR, BIT_XOR_EXPR, BIT_IOR_EXPR, TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR, EQ_EXPR, NE_EXPR, GT_EXPR, GE_EXPR, LT_EXPR, LE_EXPR, }; #define BINOP_LOOKUP(VALUE) \ binop_lookup [((VALUE) - PLUS_TK)% \ (sizeof (binop_lookup) / sizeof (binop_lookup[0]))] /* Fake WFL used to report error message. It is initialized once if needed and reused with it's location information is overriden. */ static tree wfl_operator = NULL_TREE; /* The "$L" identifier we use to create labels. */ static tree label_id = NULL_TREE; /* The "StringBuffer" identifier used for the String `+' operator. */ static tree wfl_string_buffer = NULL_TREE; /* The "append" identifier used for String `+' operator. */ static tree wfl_append = NULL_TREE; /* The "toString" identifier used for String `+' operator. */ static tree wfl_to_string = NULL_TREE; #line 117 "./parse.y" typedef union { tree node; int sub_token; struct { int token; int location; } operator; int value; } YYSTYPE; #ifndef YYDEBUG #define YYDEBUG 1 #endif #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 776 #define YYFLAG -32768 #define YYNTBASE 110 #define YYTRANSLATE(x) ((unsigned)(x) <= 364 ? yytranslate[x] : 265) 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, 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, 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, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 38, 42, 46, 50, 54, 56, 58, 60, 64, 66, 67, 69, 71, 73, 76, 79, 82, 86, 88, 91, 93, 96, 100, 103, 107, 109, 111, 115, 118, 122, 128, 133, 139, 141, 143, 145, 147, 149, 152, 153, 161, 162, 169, 173, 176, 180, 185, 186, 189, 193, 196, 197, 200, 203, 205, 209, 213, 216, 220, 222, 225, 227, 229, 231, 233, 235, 237, 239, 241, 245, 250, 252, 256, 260, 262, 266, 270, 275, 277, 281, 284, 288, 292, 294, 296, 297, 301, 304, 308, 312, 317, 322, 325, 329, 332, 336, 339, 343, 348, 352, 356, 360, 362, 366, 370, 373, 377, 380, 384, 385, 388, 391, 393, 397, 401, 403, 406, 408, 411, 415, 417, 418, 422, 425, 429, 433, 438, 441, 445, 449, 454, 459, 465, 473, 480, 482, 484, 485, 490, 491, 497, 498, 504, 505, 512, 516, 521, 524, 528, 531, 535, 538, 542, 544, 547, 549, 551, 553, 555, 557, 560, 563, 566, 570, 574, 579, 581, 585, 589, 592, 596, 598, 600, 602, 605, 607, 609, 611, 614, 617, 621, 623, 625, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 659, 661, 663, 665, 667, 670, 673, 676, 679, 682, 685, 688, 691, 695, 700, 705, 711, 716, 722, 729, 737, 744, 746, 748, 750, 752, 754, 756, 758, 764, 767, 771, 776, 784, 792, 795, 800, 803, 807, 813, 816, 820, 824, 829, 831, 834, 837, 839, 841, 844, 848, 851, 854, 858, 861, 866, 869, 872, 876, 881, 884, 886, 894, 902, 909, 913, 919, 924, 932, 939, 942, 945, 949, 952, 953, 955, 957, 960, 961, 963, 965, 969, 973, 976, 980, 983, 987, 990, 994, 997, 1001, 1004, 1008, 1011, 1015, 1019, 1022, 1026, 1032, 1038, 1041, 1046, 1050, 1052, 1056, 1060, 1065, 1068, 1070, 1073, 1076, 1081, 1084, 1088, 1093, 1096, 1099, 1101, 1103, 1105, 1107, 1111, 1113, 1115, 1117, 1119, 1123, 1127, 1131, 1135, 1139, 1143, 1147, 1151, 1157, 1162, 1169, 1175, 1180, 1186, 1192, 1199, 1203, 1207, 1212, 1218, 1221, 1225, 1229, 1233, 1235, 1239, 1243, 1247, 1251, 1256, 1261, 1266, 1271, 1275, 1279, 1281, 1284, 1288, 1292, 1295, 1298, 1302, 1306, 1310, 1314, 1317, 1321, 1326, 1332, 1339, 1345, 1352, 1357, 1362, 1367, 1372, 1376, 1381, 1385, 1390, 1392, 1394, 1396, 1398, 1401, 1404, 1406, 1408, 1411, 1414, 1416, 1419, 1422, 1425, 1428, 1431, 1434, 1436, 1439, 1442, 1444, 1447, 1450, 1456, 1461, 1466, 1472, 1477, 1480, 1486, 1491, 1497, 1499, 1503, 1507, 1511, 1515, 1519, 1523, 1525, 1529, 1533, 1537, 1541, 1543, 1547, 1551, 1555, 1559, 1563, 1567, 1569, 1573, 1577, 1581, 1585, 1589, 1593, 1597, 1601, 1605, 1609, 1611, 1615, 1619, 1623, 1627, 1629, 1633, 1637, 1639, 1643, 1647, 1649, 1653, 1657, 1659, 1663, 1667, 1669, 1673, 1677, 1679, 1685, 1690, 1694, 1700, 1702, 1704, 1708, 1712, 1714, 1716, 1718, 1720, 1722, 1724 }; static const short yyrhs[] = { 123, 0, 104, 0, 105, 0, 108, 0, 103, 0, 102, 0, 109, 0, 113, 0, 114, 0, 82, 0, 85, 0, 50, 0, 115, 0, 118, 0, 119, 0, 115, 0, 115, 0, 113, 97, 98, 0, 119, 97, 98, 0, 118, 97, 98, 0, 113, 97, 1, 0, 118, 97, 1, 0, 120, 0, 121, 0, 122, 0, 119, 101, 122, 0, 86, 0, 0, 126, 0, 124, 0, 125, 0, 126, 124, 0, 126, 125, 0, 124, 125, 0, 126, 124, 125, 0, 127, 0, 124, 127, 0, 130, 0, 125, 130, 0, 75, 119, 99, 0, 75, 1, 0, 75, 119, 1, 0, 128, 0, 129, 0, 55, 119, 99, 0, 55, 1, 0, 55, 119, 1, 0, 55, 119, 101, 5, 99, 0, 55, 119, 101, 1, 0, 55, 119, 101, 5, 1, 0, 132, 0, 165, 0, 99, 0, 1, 0, 44, 0, 131, 44, 0, 0, 131, 67, 122, 135, 136, 133, 138, 0, 0, 67, 122, 135, 136, 134, 138, 0, 131, 67, 1, 0, 67, 1, 0, 67, 122, 1, 0, 131, 67, 122, 1, 0, 0, 63, 116, 0, 63, 116, 1, 0, 63, 1, 0, 0, 52, 137, 0, 52, 1, 0, 117, 0, 137, 100, 117, 0, 137, 100, 1, 0, 95, 96, 0, 95, 139, 96, 0, 140, 0, 139, 140, 0, 141, 0, 156, 0, 158, 0, 178, 0, 142, 0, 147, 0, 132, 0, 165, 0, 112, 143, 99, 0, 131, 112, 143, 99, 0, 144, 0, 143, 100, 144, 0, 143, 100, 1, 0, 145, 0, 145, 92, 146, 0, 145, 92, 1, 0, 145, 92, 146, 1, 0, 122, 0, 145, 97, 98, 0, 122, 1, 0, 145, 97, 1, 0, 145, 98, 1, 0, 263, 0, 176, 0, 0, 149, 148, 155, 0, 149, 1, 0, 112, 150, 153, 0, 59, 150, 153, 0, 131, 112, 150, 153, 0, 131, 59, 150, 153, 0, 112, 1, 0, 131, 112, 1, 0, 59, 1, 0, 131, 59, 1, 0, 131, 1, 0, 122, 93, 94, 0, 122, 93, 151, 94, 0, 150, 97, 98, 0, 122, 93, 1, 0, 150, 97, 1, 0, 152, 0, 151, 100, 152, 0, 151, 100, 1, 0, 112, 145, 0, 131, 112, 145, 0, 112, 1, 0, 131, 112, 1, 0, 0, 53, 154, 0, 53, 1, 0, 116, 0, 154, 100, 116, 0, 154, 100, 1, 0, 178, 0, 178, 99, 0, 99, 0, 157, 178, 0, 157, 178, 99, 0, 44, 0, 0, 160, 159, 162, 0, 161, 153, 0, 131, 161, 153, 0, 120, 93, 94, 0, 120, 93, 151, 94, 0, 179, 180, 0, 179, 163, 180, 0, 179, 181, 180, 0, 179, 163, 181, 180, 0, 164, 93, 94, 99, 0, 164, 93, 232, 94, 99, 0, 119, 101, 65, 93, 232, 94, 99, 0, 119, 101, 65, 93, 94, 99, 0, 76, 0, 65, 0, 0, 61, 122, 166, 171, 0, 0, 131, 61, 122, 167, 171, 0, 0, 61, 122, 170, 168, 171, 0, 0, 131, 61, 122, 170, 169, 171, 0, 61, 122, 1, 0, 131, 61, 122, 1, 0, 63, 117, 0, 170, 100, 117, 0, 63, 1, 0, 170, 100, 1, 0, 95, 96, 0, 95, 172, 96, 0, 173, 0, 172, 173, 0, 174, 0, 175, 0, 132, 0, 165, 0, 142, 0, 149, 99, 0, 149, 1, 0, 95, 96, 0, 95, 177, 96, 0, 95, 100, 96, 0, 95, 177, 100, 96, 0, 146, 0, 177, 100, 146, 0, 177, 100, 1, 0, 95, 96, 0, 179, 181, 180, 0, 95, 0, 96, 0, 182, 0, 181, 182, 0, 183, 0, 185, 0, 132, 0, 184, 99, 0, 112, 143, 0, 131, 112, 143, 0, 187, 0, 190, 0, 194, 0, 195, 0, 206, 0, 210, 0, 187, 0, 191, 0, 196, 0, 207, 0, 211, 0, 178, 0, 188, 0, 192, 0, 197, 0, 209, 0, 217, 0, 218, 0, 219, 0, 221, 0, 220, 0, 223, 0, 99, 0, 122, 88, 0, 189, 185, 0, 122, 1, 0, 189, 186, 0, 193, 99, 0, 1, 99, 0, 1, 95, 0, 1, 96, 0, 164, 93, 1, 0, 164, 93, 94, 1, 0, 164, 93, 232, 1, 0, 164, 93, 232, 94, 1, 0, 119, 101, 65, 1, 0, 119, 101, 65, 93, 1, 0, 119, 101, 65, 93, 232, 1, 0, 119, 101, 65, 93, 232, 94, 1, 0, 119, 101, 65, 93, 94, 1, 0, 260, 0, 244, 0, 245, 0, 241, 0, 242, 0, 238, 0, 230, 0, 48, 93, 263, 94, 185, 0, 48, 1, 0, 48, 93, 1, 0, 48, 93, 263, 1, 0, 48, 93, 263, 94, 186, 56, 185, 0, 48, 93, 263, 94, 186, 56, 186, 0, 198, 199, 0, 68, 93, 263, 94, 0, 68, 1, 0, 68, 93, 1, 0, 68, 93, 263, 94, 1, 0, 95, 96, 0, 95, 203, 96, 0, 95, 200, 96, 0, 95, 200, 203, 96, 0, 201, 0, 200, 201, 0, 202, 181, 0, 203, 0, 204, 0, 203, 204, 0, 62, 264, 88, 0, 47, 88, 0, 62, 1, 0, 62, 264, 1, 0, 47, 1, 0, 66, 93, 263, 94, 0, 205, 185, 0, 66, 1, 0, 66, 93, 1, 0, 66, 93, 263, 1, 0, 205, 186, 0, 51, 0, 208, 185, 66, 93, 263, 94, 99, 0, 213, 99, 263, 99, 215, 94, 185, 0, 213, 99, 99, 215, 94, 185, 0, 213, 99, 1, 0, 213, 99, 263, 99, 1, 0, 213, 99, 99, 1, 0, 213, 99, 263, 99, 215, 94, 186, 0, 213, 99, 99, 215, 94, 186, 0, 71, 93, 0, 71, 1, 0, 71, 93, 1, 0, 212, 214, 0, 0, 216, 0, 184, 0, 216, 1, 0, 0, 216, 0, 193, 0, 216, 100, 193, 0, 216, 100, 1, 0, 54, 99, 0, 54, 122, 99, 0, 54, 1, 0, 54, 122, 1, 0, 73, 99, 0, 73, 122, 99, 0, 73, 1, 0, 73, 122, 1, 0, 58, 99, 0, 58, 263, 99, 0, 58, 1, 0, 58, 263, 1, 0, 49, 263, 99, 0, 49, 1, 0, 49, 263, 1, 0, 222, 93, 263, 94, 178, 0, 222, 93, 263, 94, 1, 0, 222, 1, 0, 222, 93, 1, 94, 0, 222, 93, 1, 0, 44, 0, 70, 178, 224, 0, 70, 178, 227, 0, 70, 178, 224, 227, 0, 70, 1, 0, 225, 0, 224, 225, 0, 226, 178, 0, 60, 93, 152, 94, 0, 60, 1, 0, 60, 93, 1, 0, 60, 93, 1, 94, 0, 64, 178, 0, 64, 1, 0, 229, 0, 233, 0, 111, 0, 76, 0, 93, 263, 94, 0, 230, 0, 237, 0, 238, 0, 239, 0, 119, 101, 67, 0, 113, 101, 67, 0, 59, 101, 67, 0, 119, 101, 76, 0, 93, 263, 1, 0, 119, 101, 1, 0, 113, 101, 1, 0, 59, 101, 1, 0, 72, 116, 93, 232, 94, 0, 72, 116, 93, 94, 0, 72, 116, 93, 232, 94, 138, 0, 72, 116, 93, 94, 138, 0, 231, 122, 93, 94, 0, 231, 122, 93, 94, 138, 0, 231, 122, 93, 232, 94, 0, 231, 122, 93, 232, 94, 138, 0, 72, 1, 99, 0, 72, 116, 1, 0, 72, 116, 93, 1, 0, 72, 116, 93, 232, 1, 0, 231, 1, 0, 231, 122, 1, 0, 119, 101, 72, 0, 228, 101, 72, 0, 263, 0, 232, 100, 263, 0, 232, 100, 1, 0, 72, 113, 234, 0, 72, 115, 234, 0, 72, 113, 234, 236, 0, 72, 115, 234, 236, 0, 72, 115, 236, 176, 0, 72, 113, 236, 176, 0, 72, 1, 98, 0, 72, 1, 97, 0, 235, 0, 234, 235, 0, 97, 263, 98, 0, 97, 263, 1, 0, 97, 1, 0, 97, 98, 0, 236, 97, 98, 0, 236, 97, 1, 0, 228, 101, 122, 0, 65, 101, 122, 0, 65, 1, 0, 119, 93, 94, 0, 119, 93, 232, 94, 0, 228, 101, 122, 93, 94, 0, 228, 101, 122, 93, 232, 94, 0, 65, 101, 122, 93, 94, 0, 65, 101, 122, 93, 232, 94, 0, 65, 101, 1, 94, 0, 65, 101, 1, 101, 0, 119, 97, 263, 98, 0, 229, 97, 263, 98, 0, 119, 97, 1, 0, 119, 97, 263, 1, 0, 229, 97, 1, 0, 229, 97, 263, 1, 0, 228, 0, 119, 0, 241, 0, 242, 0, 240, 46, 0, 240, 45, 0, 244, 0, 245, 0, 3, 243, 0, 4, 243, 0, 246, 0, 3, 1, 0, 4, 1, 0, 46, 243, 0, 46, 1, 0, 45, 243, 0, 45, 1, 0, 240, 0, 89, 243, 0, 90, 243, 0, 247, 0, 89, 1, 0, 90, 1, 0, 93, 113, 236, 94, 243, 0, 93, 113, 94, 243, 0, 93, 263, 94, 246, 0, 93, 119, 236, 94, 246, 0, 93, 113, 97, 1, 0, 93, 1, 0, 93, 113, 236, 94, 1, 0, 93, 113, 94, 1, 0, 93, 119, 236, 94, 1, 0, 243, 0, 248, 5, 243, 0, 248, 6, 243, 0, 248, 7, 243, 0, 248, 5, 1, 0, 248, 6, 1, 0, 248, 7, 1, 0, 248, 0, 249, 3, 248, 0, 249, 4, 248, 0, 249, 3, 1, 0, 249, 4, 1, 0, 249, 0, 250, 8, 249, 0, 250, 9, 249, 0, 250, 10, 249, 0, 250, 8, 1, 0, 250, 9, 1, 0, 250, 10, 1, 0, 250, 0, 251, 20, 250, 0, 251, 18, 250, 0, 251, 21, 250, 0, 251, 19, 250, 0, 251, 57, 114, 0, 251, 20, 1, 0, 251, 18, 1, 0, 251, 21, 1, 0, 251, 19, 1, 0, 251, 57, 1, 0, 251, 0, 252, 16, 251, 0, 252, 17, 251, 0, 252, 16, 1, 0, 252, 17, 1, 0, 252, 0, 253, 11, 252, 0, 253, 11, 1, 0, 253, 0, 254, 12, 253, 0, 254, 12, 1, 0, 254, 0, 255, 13, 254, 0, 255, 13, 1, 0, 255, 0, 256, 14, 255, 0, 256, 14, 1, 0, 256, 0, 257, 15, 256, 0, 257, 15, 1, 0, 257, 0, 257, 87, 263, 88, 258, 0, 257, 87, 88, 1, 0, 257, 87, 1, 0, 257, 87, 263, 88, 1, 0, 258, 0, 260, 0, 261, 262, 259, 0, 261, 262, 1, 0, 119, 0, 237, 0, 239, 0, 91, 0, 92, 0, 259, 0, 263, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 271, 277, 279, 280, 281, 282, 283, 287, 289, 292, 294, 295, 298, 300, 303, 307, 311, 315, 321, 323, 325, 327, 332, 334, 337, 341, 346, 351, 353, 354, 355, 356, 357, 358, 359, 362, 367, 373, 375, 378, 381, 383, 387, 389, 392, 419, 421, 425, 438, 440, 444, 451, 452, 454, 464, 469, 484, 488, 491, 494, 497, 499, 501, 503, 507, 509, 511, 513, 517, 519, 521, 528, 534, 539, 543, 546, 550, 552, 555, 557, 558, 559, 563, 565, 566, 568, 573, 576, 586, 589, 591, 595, 598, 605, 611, 619, 621, 623, 625, 627, 631, 633, 638, 645, 646, 650, 653, 655, 657, 659, 661, 663, 665, 667, 674, 677, 679, 684, 686, 690, 695, 700, 704, 709, 711, 713, 720, 722, 724, 728, 731, 733, 737, 739, 740, 745, 750, 756, 764, 771, 774, 777, 781, 784, 788, 797, 799, 801, 806, 813, 821, 823, 827, 835, 846, 850, 853, 856, 859, 862, 865, 868, 871, 873, 877, 883, 888, 890, 894, 897, 901, 903, 906, 908, 909, 911, 915, 919, 925, 930, 935, 939, 943, 949, 951, 952, 957, 960, 964, 969, 977, 979, 982, 984, 986, 990, 994, 997, 1001, 1003, 1004, 1005, 1006, 1007, 1017, 1019, 1020, 1021, 1022, 1025, 1027, 1028, 1029, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1039, 1044, 1055, 1062, 1066, 1077, 1087, 1093, 1099, 1105, 1107, 1113, 1115, 1121, 1123, 1125, 1127, 1129, 1133, 1135, 1136, 1137, 1138, 1139, 1140, 1143, 1146, 1148, 1150, 1154, 1159, 1164, 1172, 1178, 1180, 1182, 1186, 1189, 1191, 1193, 1202, 1204, 1211, 1216, 1225, 1227, 1234, 1240, 1245, 1247, 1249, 1253, 1261, 1264, 1266, 1268, 1272, 1277, 1286, 1291, 1294, 1301, 1303, 1305, 1309, 1312, 1321, 1328, 1330, 1334, 1347, 1349, 1355, 1361, 1365, 1367, 1371, 1374, 1376, 1380, 1383, 1385, 1387, 1391, 1394, 1396, 1398, 1402, 1405, 1407, 1409, 1413, 1419, 1421, 1425, 1432, 1434, 1436, 1438, 1442, 1450, 1453, 1455, 1457, 1461, 1463, 1470, 1478, 1495, 1497, 1499, 1503, 1509, 1514, 1516, 1519, 1521, 1523, 1525, 1526, 1527, 1528, 1532, 1534, 1536, 1541, 1543, 1545, 1547, 1549, 1553, 1556, 1561, 1563, 1568, 1569, 1570, 1571, 1572, 1574, 1576, 1578, 1580, 1582, 1586, 1588, 1591, 1597, 1602, 1606, 1609, 1611, 1613, 1617, 1619, 1621, 1623, 1627, 1630, 1634, 1640, 1642, 1650, 1653, 1655, 1659, 1662, 1670, 1674, 1677, 1679, 1690, 1701, 1706, 1715, 1717, 1721, 1724, 1726, 1731, 1736, 1741, 1748, 1750, 1751, 1752, 1755, 1760, 1765, 1767, 1768, 1770, 1772, 1773, 1775, 1779, 1782, 1786, 1789, 1793, 1795, 1797, 1799, 1800, 1802, 1806, 1814, 1816, 1818, 1830, 1832, 1838, 1840, 1842, 1846, 1848, 1853, 1858, 1863, 1865, 1867, 1871, 1873, 1878, 1883, 1885, 1889, 1891, 1896, 1901, 1906, 1908, 1910, 1914, 1916, 1921, 1926, 1931, 1936, 1938, 1940, 1942, 1944, 1946, 1950, 1952, 1957, 1962, 1964, 1968, 1970, 1975, 1979, 1981, 1986, 1990, 1992, 1997, 2001, 2003, 2008, 2012, 2014, 2019, 2023, 2025, 2030, 2036, 2038, 2042, 2044, 2047, 2050, 2058, 2060, 2061, 2064, 2066, 2069, 2073 }; #endif #if YYDEBUG != 0 || defined (YYERROR_VERBOSE) static const char * const yytname[] = { "$","error","$undefined.","PLUS_TK", "MINUS_TK","MULT_TK","DIV_TK","REM_TK","LS_TK","SRS_TK","ZRS_TK","AND_TK","XOR_TK", "OR_TK","BOOL_AND_TK","BOOL_OR_TK","EQ_TK","NEQ_TK","GT_TK","GTE_TK","LT_TK", "LTE_TK","PLUS_ASSIGN_TK","MINUS_ASSIGN_TK","MULT_ASSIGN_TK","DIV_ASSIGN_TK", "REM_ASSIGN_TK","LS_ASSIGN_TK","SRS_ASSIGN_TK","ZRS_ASSIGN_TK","AND_ASSIGN_TK", "XOR_ASSIGN_TK","OR_ASSIGN_TK","PUBLIC_TK","PRIVATE_TK","PROTECTED_TK","STATIC_TK", "FINAL_TK","SYNCHRONIZED_TK","VOLATILE_TK","TRANSIENT_TK","NATIVE_TK","PAD_TK", "ABSTRACT_TK","MODIFIER_TK","DECR_TK","INCR_TK","DEFAULT_TK","IF_TK","THROW_TK", "BOOLEAN_TK","DO_TK","IMPLEMENTS_TK","THROWS_TK","BREAK_TK","IMPORT_TK","ELSE_TK", "INSTANCEOF_TK","RETURN_TK","VOID_TK","CATCH_TK","INTERFACE_TK","CASE_TK","EXTENDS_TK", "FINALLY_TK","SUPER_TK","WHILE_TK","CLASS_TK","SWITCH_TK","CONST_TK","TRY_TK", "FOR_TK","NEW_TK","CONTINUE_TK","GOTO_TK","PACKAGE_TK","THIS_TK","BYTE_TK","SHORT_TK", "INT_TK","LONG_TK","CHAR_TK","INTEGRAL_TK","FLOAT_TK","DOUBLE_TK","FP_TK","ID_TK", "REL_QM_TK","REL_CL_TK","NOT_TK","NEG_TK","ASSIGN_ANY_TK","ASSIGN_TK","OP_TK", "CP_TK","OCB_TK","CCB_TK","OSB_TK","CSB_TK","SC_TK","C_TK","DOT_TK","STRING_LIT_TK", "CHAR_LIT_TK","INT_LIT_TK","FP_LIT_TK","TRUE_TK","FALSE_TK","BOOL_LIT_TK","NULL_TK", "goal","literal","type","primitive_type","reference_type","class_or_interface_type", "class_type","interface_type","array_type","name","simple_name","qualified_name", "identifier","compilation_unit","import_declarations","type_declarations","package_declaration", "import_declaration","single_type_import_declaration","type_import_on_demand_declaration", "type_declaration","modifiers","class_declaration","@1","@2","super","interfaces", "interface_type_list","class_body","class_body_declarations","class_body_declaration", "class_member_declaration","field_declaration","variable_declarators","variable_declarator", "variable_declarator_id","variable_initializer","method_declaration","@3","method_header", "method_declarator","formal_parameter_list","formal_parameter","throws","class_type_list", "method_body","static_initializer","static","constructor_declaration","@4","constructor_header", "constructor_declarator","constructor_body","explicit_constructor_invocation", "this_or_super","interface_declaration","@5","@6","@7","@8","extends_interfaces", "interface_body","interface_member_declarations","interface_member_declaration", "constant_declaration","abstract_method_declaration","array_initializer","variable_initializers", "block","block_begin","block_end","block_statements","block_statement","local_variable_declaration_statement", "local_variable_declaration","statement","statement_nsi","statement_without_trailing_substatement", "empty_statement","label_decl","labeled_statement","labeled_statement_nsi","expression_statement", "statement_expression","if_then_statement","if_then_else_statement","if_then_else_statement_nsi", "switch_statement","switch_expression","switch_block","switch_block_statement_groups", "switch_block_statement_group","group_of_labels","switch_labels","switch_label", "while_expression","while_statement","while_statement_nsi","do_statement_begin", "do_statement","for_statement","for_statement_nsi","for_header","for_begin", "for_init","for_update","statement_expression_list","break_statement","continue_statement", "return_statement","throw_statement","synchronized_statement","synchronized", "try_statement","catches","catch_clause","catch_clause_parameter","finally", "primary","primary_no_new_array","class_instance_creation_expression","something_dot_new", "argument_list","array_creation_expression","dim_exprs","dim_expr","dims","field_access", "method_invocation","array_access","postfix_expression","post_increment_expression", "post_decrement_expression","unary_expression","pre_increment_expression","pre_decrement_expression", "unary_expression_not_plus_minus","cast_expression","multiplicative_expression", "additive_expression","shift_expression","relational_expression","equality_expression", "and_expression","exclusive_or_expression","inclusive_or_expression","conditional_and_expression", "conditional_or_expression","conditional_expression","assignment_expression", "assignment","left_hand_side","assignment_operator","expression","constant_expression", NULL }; #endif static const short yyr1[] = { 0, 110, 111, 111, 111, 111, 111, 111, 112, 112, 113, 113, 113, 114, 114, 115, 116, 117, 118, 118, 118, 118, 118, 119, 119, 120, 121, 122, 123, 123, 123, 123, 123, 123, 123, 123, 124, 124, 125, 125, 126, 126, 126, 127, 127, 128, 128, 128, 129, 129, 129, 130, 130, 130, 130, 131, 131, 133, 132, 134, 132, 132, 132, 132, 132, 135, 135, 135, 135, 136, 136, 136, 137, 137, 137, 138, 138, 139, 139, 140, 140, 140, 140, 141, 141, 141, 141, 142, 142, 143, 143, 143, 144, 144, 144, 144, 145, 145, 145, 145, 145, 146, 146, 148, 147, 147, 149, 149, 149, 149, 149, 149, 149, 149, 149, 150, 150, 150, 150, 150, 151, 151, 151, 152, 152, 152, 152, 153, 153, 153, 154, 154, 154, 155, 155, 155, 156, 156, 157, 159, 158, 160, 160, 161, 161, 162, 162, 162, 162, 163, 163, 163, 163, 164, 164, 166, 165, 167, 165, 168, 165, 169, 165, 165, 165, 170, 170, 170, 170, 171, 171, 172, 172, 173, 173, 173, 173, 174, 175, 175, 176, 176, 176, 176, 177, 177, 177, 178, 178, 179, 180, 181, 181, 182, 182, 182, 183, 184, 184, 185, 185, 185, 185, 185, 185, 186, 186, 186, 186, 186, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 187, 188, 189, 190, 190, 191, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 192, 193, 193, 193, 193, 193, 193, 193, 194, 194, 194, 194, 195, 196, 197, 198, 198, 198, 198, 199, 199, 199, 199, 200, 200, 201, 202, 203, 203, 204, 204, 204, 204, 204, 205, 206, 206, 206, 206, 207, 208, 209, 210, 210, 210, 210, 210, 211, 211, 212, 212, 212, 213, 214, 214, 214, 214, 215, 215, 216, 216, 216, 217, 217, 217, 217, 218, 218, 218, 218, 219, 219, 219, 219, 220, 220, 220, 221, 221, 221, 221, 221, 222, 223, 223, 223, 223, 224, 224, 225, 226, 226, 226, 226, 227, 227, 228, 228, 229, 229, 229, 229, 229, 229, 229, 229, 229, 229, 229, 229, 229, 229, 229, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 230, 231, 231, 232, 232, 232, 233, 233, 233, 233, 233, 233, 233, 233, 234, 234, 235, 235, 235, 236, 236, 236, 237, 237, 237, 238, 238, 238, 238, 238, 238, 238, 238, 239, 239, 239, 239, 239, 239, 240, 240, 240, 240, 241, 242, 243, 243, 243, 243, 243, 243, 243, 244, 244, 245, 245, 246, 246, 246, 246, 246, 246, 247, 247, 247, 247, 247, 247, 247, 247, 247, 248, 248, 248, 248, 248, 248, 248, 249, 249, 249, 249, 249, 250, 250, 250, 250, 250, 250, 250, 251, 251, 251, 251, 251, 251, 251, 251, 251, 251, 251, 252, 252, 252, 252, 252, 253, 253, 253, 254, 254, 254, 255, 255, 255, 256, 256, 256, 257, 257, 257, 258, 258, 258, 258, 258, 259, 259, 260, 260, 261, 261, 261, 262, 262, 263, 264 }; static const short yyr2[] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 1, 1, 1, 3, 1, 0, 1, 1, 1, 2, 2, 2, 3, 1, 2, 1, 2, 3, 2, 3, 1, 1, 3, 2, 3, 5, 4, 5, 1, 1, 1, 1, 1, 2, 0, 7, 0, 6, 3, 2, 3, 4, 0, 2, 3, 2, 0, 2, 2, 1, 3, 3, 2, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 4, 1, 3, 3, 1, 3, 3, 4, 1, 3, 2, 3, 3, 1, 1, 0, 3, 2, 3, 3, 4, 4, 2, 3, 2, 3, 2, 3, 4, 3, 3, 3, 1, 3, 3, 2, 3, 2, 3, 0, 2, 2, 1, 3, 3, 1, 2, 1, 2, 3, 1, 0, 3, 2, 3, 3, 4, 2, 3, 3, 4, 4, 5, 7, 6, 1, 1, 0, 4, 0, 5, 0, 5, 0, 6, 3, 4, 2, 3, 2, 3, 2, 3, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 1, 3, 3, 2, 3, 1, 1, 1, 2, 1, 1, 1, 2, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 4, 4, 5, 4, 5, 6, 7, 6, 1, 1, 1, 1, 1, 1, 1, 5, 2, 3, 4, 7, 7, 2, 4, 2, 3, 5, 2, 3, 3, 4, 1, 2, 2, 1, 1, 2, 3, 2, 2, 3, 2, 4, 2, 2, 3, 4, 2, 1, 7, 7, 6, 3, 5, 4, 7, 6, 2, 2, 3, 2, 0, 1, 1, 2, 0, 1, 1, 3, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 3, 2, 3, 5, 5, 2, 4, 3, 1, 3, 3, 4, 2, 1, 2, 2, 4, 2, 3, 4, 2, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, 3, 3, 5, 4, 6, 5, 4, 5, 5, 6, 3, 3, 4, 5, 2, 3, 3, 3, 1, 3, 3, 3, 3, 4, 4, 4, 4, 3, 3, 1, 2, 3, 3, 2, 2, 3, 3, 3, 3, 2, 3, 4, 5, 6, 5, 6, 4, 4, 4, 4, 3, 4, 3, 4, 1, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 1, 2, 2, 5, 4, 4, 5, 4, 2, 5, 4, 5, 1, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 3, 3, 1, 5, 4, 3, 5, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1 }; static const short yydefact[] = { 0, 54, 55, 0, 0, 0, 0, 53, 1, 0, 0, 0, 36, 43, 44, 38, 0, 51, 52, 46, 27, 0, 23, 24, 25, 0, 62, 0, 41, 0, 0, 37, 39, 0, 0, 56, 0, 0, 47, 45, 0, 163, 0, 0, 159, 63, 0, 69, 42, 40, 0, 0, 0, 61, 0, 49, 0, 26, 167, 17, 165, 15, 0, 156, 0, 0, 68, 16, 0, 0, 59, 164, 0, 161, 64, 69, 50, 48, 12, 0, 10, 11, 169, 0, 8, 9, 13, 14, 15, 0, 175, 177, 0, 176, 0, 171, 173, 174, 168, 166, 160, 67, 71, 72, 70, 0, 158, 0, 57, 112, 0, 127, 110, 0, 0, 89, 92, 127, 0, 0, 0, 114, 0, 0, 179, 178, 170, 172, 0, 0, 60, 162, 0, 0, 0, 0, 107, 98, 87, 0, 0, 0, 0, 106, 21, 18, 22, 20, 19, 113, 127, 111, 0, 127, 74, 73, 55, 189, 75, 23, 0, 85, 0, 77, 79, 83, 84, 0, 80, 0, 81, 139, 127, 86, 82, 0, 58, 118, 115, 0, 0, 0, 120, 129, 130, 128, 119, 117, 91, 0, 90, 94, 0, 0, 0, 0, 0, 0, 0, 337, 0, 0, 0, 0, 6, 5, 2, 3, 4, 7, 336, 0, 404, 0, 102, 403, 334, 339, 0, 335, 340, 341, 342, 420, 405, 406, 435, 409, 410, 413, 423, 442, 447, 454, 465, 470, 473, 476, 479, 482, 485, 490, 499, 491, 0, 101, 99, 97, 100, 109, 88, 108, 187, 0, 127, 76, 78, 105, 0, 136, 0, 141, 0, 55, 0, 0, 278, 0, 0, 0, 0, 0, 0, 0, 0, 337, 0, 221, 0, 8, 404, 0, 0, 195, 0, 210, 0, 191, 193, 0, 194, 199, 211, 0, 200, 212, 0, 201, 202, 213, 0, 0, 203, 0, 214, 204, 291, 0, 215, 216, 217, 219, 218, 0, 220, 245, 244, 0, 242, 243, 240, 241, 239, 125, 123, 0, 116, 0, 0, 414, 404, 340, 342, 411, 415, 412, 419, 418, 417, 416, 0, 388, 0, 0, 0, 16, 0, 424, 421, 425, 422, 431, 0, 404, 0, 180, 0, 184, 0, 0, 0, 0, 0, 95, 0, 0, 363, 0, 408, 407, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 497, 498, 0, 143, 0, 142, 135, 104, 133, 137, 189, 140, 0, 228, 229, 227, 247, 0, 313, 0, 302, 300, 0, 310, 308, 0, 274, 0, 254, 0, 324, 0, 288, 0, 306, 304, 0, 0, 197, 0, 0, 224, 222, 0, 0, 190, 188, 192, 196, 320, 404, 223, 226, 0, 252, 273, 0, 404, 0, 293, 297, 290, 0, 0, 317, 0, 126, 124, 122, 121, 132, 131, 350, 345, 0, 387, 377, 376, 359, 0, 370, 378, 0, 371, 0, 360, 0, 0, 0, 0, 0, 0, 347, 338, 182, 181, 0, 349, 344, 389, 0, 367, 399, 0, 348, 343, 365, 346, 366, 386, 401, 0, 364, 0, 439, 436, 440, 437, 441, 438, 445, 443, 446, 444, 451, 448, 452, 449, 453, 450, 461, 456, 463, 458, 460, 455, 462, 457, 464, 0, 459, 468, 466, 469, 467, 472, 471, 475, 474, 478, 477, 481, 480, 484, 483, 488, 0, 0, 493, 492, 144, 134, 404, 0, 0, 145, 0, 248, 0, 314, 312, 303, 301, 311, 309, 275, 0, 255, 0, 0, 0, 321, 325, 0, 322, 289, 307, 305, 338, 0, 198, 230, 0, 0, 0, 0, 257, 0, 261, 0, 264, 265, 0, 294, 0, 282, 0, 0, 319, 0, 395, 396, 0, 382, 383, 0, 379, 372, 0, 375, 373, 374, 361, 352, 0, 433, 427, 430, 0, 0, 428, 186, 183, 185, 390, 0, 400, 397, 0, 402, 398, 355, 0, 487, 0, 0, 146, 0, 0, 147, 249, 0, 276, 272, 0, 329, 0, 333, 332, 326, 323, 327, 234, 0, 231, 232, 0, 271, 268, 269, 500, 0, 259, 262, 264, 0, 258, 266, 0, 299, 298, 284, 0, 296, 0, 318, 0, 393, 0, 381, 380, 385, 384, 354, 362, 351, 432, 426, 434, 429, 369, 368, 391, 0, 356, 357, 489, 486, 0, 148, 0, 0, 0, 246, 0, 199, 0, 206, 207, 0, 208, 209, 0, 256, 330, 0, 235, 0, 0, 233, 270, 267, 260, 0, 0, 283, 0, 316, 315, 394, 353, 392, 358, 0, 149, 0, 0, 0, 225, 277, 0, 331, 328, 238, 236, 0, 0, 281, 0, 0, 0, 150, 0, 250, 0, 0, 237, 279, 280, 152, 0, 0, 0, 0, 151, 0, 0, 0, 0, 286, 0, 251, 285, 0, 0, 0 }; static const short yydefgoto[] = { 774, 210, 278, 211, 85, 86, 68, 60, 87, 212, 22, 23, 24, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 132, 105, 47, 70, 104, 130, 162, 163, 164, 91, 114, 115, 116, 213, 166, 258, 92, 111, 181, 182, 136, 185, 398, 168, 169, 170, 260, 171, 172, 402, 554, 284, 18, 43, 72, 65, 107, 44, 63, 94, 95, 96, 97, 214, 358, 285, 175, 437, 286, 287, 288, 289, 290, 705, 291, 292, 293, 294, 708, 295, 296, 297, 298, 709, 299, 300, 445, 588, 589, 590, 591, 592, 301, 302, 711, 303, 304, 305, 712, 306, 307, 452, 673, 674, 308, 309, 310, 311, 312, 313, 314, 572, 573, 574, 575, 215, 216, 217, 218, 491, 219, 471, 472, 473, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 393, 492, 662 }; static const short yypact[] = { 466, -32768,-32768, 432, -55, 484, 498,-32768,-32768, 425, 21, 576,-32768,-32768,-32768,-32768, 594,-32768,-32768,-32768,-32768, 13,-32768,-32768,-32768, 348,-32768, 361,-32768, 28, 143, -32768,-32768, 592, 618,-32768, -55, 505,-32768,-32768, 478, -32768, 510, -46, -30,-32768, 514, 23,-32768,-32768, -55, 633, 360,-32768, 413,-32768, 95,-32768,-32768,-32768,-32768, -11, 1145,-32768, 521, -46,-32768,-32768, 67, 525,-32768, -32768, -46, -30,-32768, 23,-32768,-32768,-32768, 542,-32768, -32768,-32768, 554, 4,-32768,-32768, 48, 184, 791,-32768, -32768, 212,-32768, 1241,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768,-32768, 107, 126,-32768, -46,-32768,-32768, 156, 9,-32768, 235, 435,-32768, 790, 9, 34, 37, 182, -32768, 580, 582,-32768,-32768,-32768,-32768, 588, 861,-32768, -32768, 126, 434, 620, 56,-32768,-32768,-32768, 625, 1878, 72, 328,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 9, -32768, 448, 9,-32768,-32768, 311, 342,-32768, 384, 791, -32768, 1029,-32768,-32768,-32768,-32768, 174,-32768, 373,-32768, -32768, 437,-32768,-32768, 1600,-32768,-32768,-32768, 628, 901, -67,-32768,-32768,-32768, 395,-32768,-32768,-32768, 167,-32768, -32768, 2625, 2690, 2741, 2806, 489, 16, 572,-32768, 2857, 2922, 2973, 5113,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 500, 949, 49,-32768, 509, 461,-32768, 641,-32768, 810, -32768, 823, 881,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 995, 926, 1016, 918, 932, 613, 629, 637, 659, 10, -32768,-32768,-32768, 887,-32768,-32768,-32768,-32768,-32768,-32768, -32768,-32768, 839, 437,-32768,-32768,-32768, 341, 590, 586, -32768, 811, 305, 335, 3038,-32768, 141, 1929, 12, 352, 357, 98, 430, 255, 609, 5410,-32768, -55, 701, 902, 511, 873,-32768, 627,-32768, 1532,-32768,-32768, 649,-32768, -32768,-32768, 1673,-32768,-32768, 664,-32768,-32768,-32768, 674, 1673,-32768, 1673,-32768,-32768, 5461, 704,-32768,-32768,-32768, -32768,-32768, 447,-32768, 693, 834, 881, 939, 944,-32768, -32768,-32768,-32768, 899, 644,-32768, 692, 647,-32768, 416, -32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 27, -32768, 655, 954, 631, 631, 452,-32768,-32768,-32768,-32768, -32768, 624, 1046, 22,-32768, 717,-32768, 603, 31, 5178, 3089, 604,-32768, -8, 3154,-32768, 457,-32768,-32768, 3205, 3270, 3321, 3386, 3437, 3502, 3553, 3618, 3669, 3734, 3785, 3850, 760, 3901, 3966, 4017, 4082, 4133, 4198, 4249, 1994, -32768,-32768, 4314,-32768, 176,-32768,-32768,-32768, 718,-32768, -32768,-32768, 1532,-32768,-32768,-32768,-32768, 4365,-32768, 217, -32768,-32768, 219,-32768,-32768, 227,-32768, 4430,-32768, 4481, -32768, 751,-32768, 4895,-32768,-32768, 238, 59, 682, 2045, 686,-32768,-32768, -55, 2110,-32768,-32768,-32768,-32768,-32768, 1061,-32768,-32768, 602,-32768,-32768, 723, 1000, 901,-32768, -32768,-32768, 117, 2161,-32768, 4546,-32768, 899,-32768,-32768, -32768,-32768,-32768,-32768, 121, 738,-32768,-32768,-32768, 2226, 631,-32768, 362, 631, 362,-32768, 2277, 4597, 204, 690, 2342, 711,-32768, 973,-32768,-32768, 1813,-32768,-32768,-32768, 308,-32768,-32768, 240,-32768,-32768,-32768,-32768,-32768, 744, -32768, 244,-32768, 5229,-32768,-32768,-32768,-32768,-32768,-32768, -32768, 995,-32768, 995,-32768, 926,-32768, 926,-32768, 926, -32768, 1016,-32768, 1016,-32768, 1016,-32768, 1016,-32768, 4, -32768,-32768, 918,-32768, 918,-32768, 932,-32768, 613,-32768, 629,-32768, 637,-32768, 659,-32768, 846, 761,-32768,-32768, -32768,-32768, 1043, 1532, 758,-32768, 1532,-32768, 271,-32768, -32768,-32768,-32768,-32768,-32768,-32768, 316,-32768, 759, 460, 257, 751,-32768, 373,-32768,-32768,-32768,-32768,-32768, 469, 682,-32768, 868, 86, 205, 4662,-32768, 605,-32768, 1600, 635,-32768, 778,-32768, 5029,-32768, 4920, 775, 792, 796, -32768,-32768, 5294,-32768,-32768, 247,-32768, 787, 261,-32768, 787,-32768,-32768, 126, 88,-32768,-32768,-32768, 4713, 5071, -32768,-32768,-32768,-32768,-32768, 4778,-32768,-32768, 5345,-32768, -32768, 126, 474,-32768, 4829, 827,-32768, 1532, 2393,-32768, -32768, 1739,-32768,-32768, 294,-32768, 736,-32768,-32768,-32768, -32768,-32768,-32768, 2458,-32768,-32768, 894,-32768,-32768,-32768, -32768, 400,-32768,-32768, 713, 1441,-32768,-32768, 5410,-32768, -32768,-32768, 803, 812, 4962,-32768, 309,-32768, 515,-32768, -32768,-32768,-32768,-32768,-32768, 126,-32768,-32768,-32768,-32768, -32768,-32768,-32768, 584,-32768, 126,-32768,-32768, 486,-32768, 256, 102, 495,-32768, 863, 878, 1739,-32768,-32768, 1739, -32768,-32768, 843,-32768, 850, 858,-32768, 959, 135,-32768, -32768,-32768,-32768, 876, 1673,-32768, 888,-32768,-32768,-32768, -32768,-32768,-32768, 2509,-32768, 293, 4365, 1673,-32768,-32768, 2574,-32768,-32768,-32768,-32768, 961, 907,-32768, 1673, 296, 138,-32768, 322,-32768, 4920, 909,-32768,-32768,-32768,-32768, 300, 1739, 915, 4962,-32768, 911, 1739, 917, 1739,-32768, 1739,-32768,-32768, 1017, 1019,-32768 }; static const short yypgoto[] = {-32768, -32768, -22, -52, 634, 109, -119, 375,-32768, -3, 583, -32768, 129,-32768, 1011, 746,-32768, 663,-32768,-32768, 814, -53, -60,-32768,-32768, 977, 952,-32768, -125,-32768, 867, -32768, -99, -115, 895, -173, -191,-32768,-32768, 115, -39, 783, -326, -98,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 879,-32768,-32768, 640, -58,-32768,-32768,-32768,-32768, 996, 643,-32768, 960,-32768,-32768, 354,-32768, -111, 800, -383, -387, -275,-32768, 766, 63, 97, -586,-32768, -423,-32768, -32768,-32768, -282,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 476,-32768, 496, -565, -350,-32768,-32768,-32768,-32768,-32768, -32768,-32768, -320,-32768, -335, 768,-32768,-32768,-32768,-32768, -32768,-32768,-32768,-32768, 522,-32768, 523,-32768,-32768, -15, -32768, -340,-32768, 754, 386, -260, 975, 243, 1095, 266, 423, 490, -147, 513, 569, -479,-32768, 683, 729, 585, 685, 698, 714, 715, 719, 720,-32768, 477, 724, 668, -32768,-32768, 44,-32768 }; #define YYLAST 5570 static const short yytable[] = { 21, 460, 90, 29, 93, 621, 324, 176, 152, 89, 84, 438, 357, 341, 38, 184, 557, 341, 174, 143, 556, -31, 1, 483, 451, 389, 668, 326, 463, 48, 165, 20, 488, 327, 90, 144, 93, 84, 146, 61, 83, 89, 84, 61, 117, 333, 335, 337, 339, 62, 363, 174, 249, 348, 350, 251, 706, 186, 259, 88, 483, 61, 134, 165, 499, 2, 61, 123, 101, 161, 64, 173, 83, 246, 261, 69, 160, 84, 20, 346, 180, 84, 4, 150, 153, 475, 88, 656, 5, 685, 50, 88, 480, 482, 464, 584, 76, 390, 489, 421, 668, 118, 161, 656, 173, -154, 135, 83, 84, 160, 84, 179, 39, 342, 40, 283, 484, 342, 594, -66, 7, 706, 282, 279, 706, 61, 88, 49, 84, 50, 88, 61, 145, 25, 27, 147, 745, 615, 123, 745, 83, 690, 411, -34, 1, 119, 344, 399, -93, -93, 352, 59, 458, 579, 187, 67, 396, 88, 325, 88, 315, 422, -66, 429, 633, 52, 54, 638, 137, 57, 247, 637, 280, 59, 640, 257, 706, 88, 59, 57, 657, 706, 686, 706, 245, 706, 626, 2, 626, 330, 330, 330, 330, 157, 77, 61, 736, 330, 330, 353, 180, 84, 626, 666, 4, 618, 658, 128, 110, 462, 5, 608, 113, 124, 611, 601, -292, 595, 560, 707, 562, 129, 602, 506, 508, 510, 283, 20, 564, 746, 84, 179, 761, 282, 279, 626, 137, 59, 626, 577, 412, 627, 7, 67, 167, 630, 354, 245, 680, 133, 88, 110, 113, 449, 279, 700, 425, 655, 648, -96, 434, -96, 682, 679, -96, -96, -96, -96, 189, -103, 551, 315, 641, -103, 180, 84, 327, 167, 315, 88, 148, 120, 438, 280, 707, 50, 315, 707, 315, 694, 441, 315, 710, 659, 720, 714, 624, 744, 441, 702, 441, 757, 605, 448, 281, 179, -320, 345, 189, 410, 728, 125, 416, 671, 719, 451, 561, 643, 563, 581, 428, 716, 713, 641, 88, 61, 565, -96, 133, 248, 530, 617, -96, -96, -96, -96, 407, 578, 628, 707, 727, 20, 631, 283, 707, 681, 707, 367, 707, 41, 282, 279, 157, 417, 426, 735, 442, 710, 419, 683, 710, 71, 45, 438, 446, 642, 447, 330, 330, 330, 330, 330, 330, 330, 330, 330, 330, 330, 330, 88, 330, 330, 330, 330, 330, 330, 330, 713, 315, -253, 713, 438, 752, 451, 751, 760, 413, 84, -320, 765, 553, 721, 625, 427, 157, 494, -138, 189, 626, 502, 644, 42, 710, -65, 74, 281, 762, 710, 316, 710, 763, 710, 281, 42, 46, -30, 1, 434, 408, 768, 281, 423, 281, 19, 548, 177, 157, 67, 252, 99, 397, 317, 713, -155, 103, 418, 88, 713, 455, 713, 420, 713, 559, 476, 189, -157, -65, 203, 503, 609, 649, 646, 567, 652, 569, -65, -28, 1, 157, 2, 653, 466, 688, 451, 494, 330, 46, 253, 2, 55, 3, 330, 451, 56, 78, 26, 4, 653, 722, 684, 134, 57, 5, 500, 283, 328, 407, 283, 598, 28, 600, 282, 279, 155, 282, 279, 53, 695, -65, 360, 2, 58, 432, 361, 606, 66, 80, 362, 20, 81, 20, 3, 98, 424, 7, 494, 102, 4, 178, 316, 283, 245, 281, 5, 138, 139, 316, 282, 279, 315, 456, 6, 315, 109, 316, 477, 316, 250, 139, 316, 504, 280, 317, 647, 280, 112, -25, -25, 365, 317, 57, 731, 654, 189, 20, 7, 729, 317, 696, 317, 20, 733, 317, 343, 626, 315, -29, 1, 283, 734, 315, 149, 315, 151, 20, 282, 279, 280, 737, 154, 340, 20, -32, 1, 180, 84, 20, -25, 318, 433, 20, 359, -25, -25, -25, 495, 283, 20, -25, 730, 364, 20, -25, 282, 279, 626, 330, 330, -33, 1, 2, 183, 78, 315, 385, 179, 188, 315, 20, 323, 661, 3, 330, -35, 1, 280, 2, 4, 35, 441, 20, 386, 366, 5, 88, 457, 316, 3, 461, 585, 387, 315, 585, 4, 80, 36, 465, 81, 20, 5, 315, 37, 2, 280, 586, 319, 20, 586, 20, 317, 692, 496, 31, 388, 20, 7, 497, 2, 732, 4, 498, 401, 585, 281, 626, 5, 281, 495, 320, 400, 20, 7, 315, 459, 4, 315, 31, 586, 587, 486, 5, 663, -153, 487, 441, 704, 20, 441, 100, 318, 315, 20, 159, 724, 20, 106, 318, 7, 478, 281, 435, 479, 441, 315, 318, 359, 318, 20, 470, 318, 20, 667, 7, 20, 315, 441, 2, 715, -339, -339, 315, 20, 78, 159, 321, 159, 441, 315, 439, 315, 131, 580, 315, 496, 315, 30, 315, 34, 497, 441, 585, 529, 498, 443, 441, 57, 441, 281, 441, 444, 442, 281, 20, 446, 80, 586, 319, 81, 20, 51, 2, 753, 139, 319, 619, 756, 78, 609, 748, 593, -339, 319, 121, 319, -339, 281, 319, 316, 118, 320, 316, 754, 359, 454, 739, 620, 320, 740, 609, 723, 78, 570, 759, 485, 320, 571, 320, 552, 80, 320, 317, 81, 20, 317, 32, 704, 318, 610, 495, 612, 748, 603, 754, 316, 759, 35, 281, 629, 316, 281, 316, 78, 80, 322, 32, 81, 20, 634, 32, 635, 122, 639, 36, 645, 281, 321, 317, 607, 37, 766, 607, 317, 321, 317, 770, 32, 772, 281, 773, 655, 321, 669, 321, 80, 675, 321, 81, 20, 281, -341, -341, 316, 140, 2, 609, 316, 676, 141, 142, 78, 677, 281, 699, 319, 496, 720, 281, 725, 281, 497, 281, -495, -495, 498, 317, 156, 404, 405, 317, 316, 406, 78, 595, 20, -496, -496, 320, 35, 316, 738, 79, 80, 4, 78, 81, 20, 368, 369, 5, 373, 374, -341, 317, 394, -205, -341, 378, 379, 380, 381, 37, 317, 741, 80, 742, 35, 81, 20, 383, 384, 316, 78, 743, 316, 322, 80, 157, 158, 81, 20, 744, 322, 757, 522, 524, 526, 528, 769, 316, 322, 747, 322, 321, 317, 322, 382, 317, 318, 391, 392, 318, 316, 749, 80, -405, -405, 81, 20, -15, -406, -406, 317, 316, -494, -494, 360, 141, 142, 316, 430, 370, 371, 372, 431, 317, 316, 758, 316, 764, 767, 316, 771, 316, 318, 316, 317, 531, 775, 318, 776, 318, 317, 33, 78, 375, 376, 377, 108, 317, 256, 317, 75, 196, 317, 190, 317, 395, 317, 197, 254, -494, -494, 360, 555, 319, 198, 361, 319, 73, 199, 362, 467, 468, 469, 127, 80, 512, 514, 81, 20, 403, 318, 200, 201, 664, 318, 202, 320, 533, 535, 320, 322, 450, 156, 453, 204, 205, 206, 207, 78, 319, 208, 209, 537, 665, 319, -15, 319, 79, 318, 4, -494, -494, 360, 650, 651, 5, 430, 318, 474, 539, 362, 541, 320, 516, 518, 520, 543, 320, 545, 320, 80, 698, 0, 81, 20, 0, 550, 0, 0, 0, 0, 0, 321, 157, 255, 321, 0, 319, -15, 318, 0, 319, 318, -494, -494, 360, -494, -494, 360, 430, 0, 0, 481, 636, 0, 0, 362, 318, 0, 0, 320, -494, -494, 360, 320, 319, 0, 361, 321, 0, 318, 431, 0, 321, 319, 321, 331, 331, 331, 331, 0, 318, 0, 0, 331, 331, 0, 318, 320, 0, 0, 0, 0, 0, 318, 0, 318, 320, 2, 318, 0, 318, 0, 318, 78, 0, 319, 0, 0, 319, 0, 0, 0, 79, 0, 4, 321, 0, 0, 0, 321, 5, 0, 0, 319, 0, 0, 0, 0, 320, 0, 322, 320, 0, 322, 0, 80, 319, 0, 81, 20, 0, 0, 0, 321, 0, 0, 320, 319, 0, 82, 0, 0, 321, 319, 0, 0, 0, 0, 0, 320, 319, 0, 319, 0, 0, 319, 322, 319, 0, 319, 320, 322, 0, 322, 0, 0, 320, 0, 0, 0, 0, 0, 0, 320, 321, 320, 0, 321, 320, 0, 320, 0, 320, 2, 0, 332, 332, 332, 332, 78, 0, 0, 321, 332, 332, 0, 0, 0, 79, 0, 4, 0, 0, 0, 322, 321, 5, 0, 322, 0, 0, 0, 0, 0, 0, 0, 321, 0, 0, 0, 0, 80, 321, 0, 81, 20, 0, 0, 0, 321, 0, 321, 322, 0, 321, 126, 321, 0, 321, 0, 0, 322, 0, 331, 331, 331, 331, 331, 331, 331, 331, 331, 331, 331, 331, 0, 331, 331, 331, 331, 331, 331, 331, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 322, 0, 0, 322, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 322, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 322, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 322, 0, 0, 0, 0, 0, 322, 0, 0, 0, 0, 0, 0, 322, 0, 322, 0, 0, 322, 0, 322, 0, 322, 0, 0, 262, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 331, 0, 0, 0, 0, 0, 331, 0, 0, 0, 0, 0, 332, 332, 332, 332, 332, 332, 332, 332, 332, 332, 332, 332, 0, 332, 332, 332, 332, 332, 332, 332, 263, 194, 195, -263, 264, 265, 78, 266, 0, 0, 267, 0, 0, 0, 268, 196, 0, 0, -263, 0, 0, 269, 270, 5, 271, 0, 272, 273, 198, 274, 0, 0, 275, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 0, 0, 0, 262, 276, 0, 157, -263, 0, 0, 277, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 332, 0, 0, 263, 194, 195, 332, 264, 265, 78, 266, 0, 0, 267, 0, 0, 0, 268, 196, 0, 0, 331, 331, 0, 269, 270, 5, 271, 262, 272, 273, 198, 274, 0, 0, 275, 0, 331, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 0, 0, 0, 0, 276, 0, 157, 436, 0, 0, 277, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 0, 0, 263, 194, 195, 0, 264, 265, 78, 266, 0, 0, 267, 0, 0, 0, 268, 196, 0, 0, 0, 0, 0, 269, 270, 5, 271, 0, 272, 273, 198, 274, 262, 0, 275, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 0, 0, 0, 0, 276, 0, 157, 0, 0, 0, 277, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 0, 0, 0, 0, 332, 332, 0, 440, 194, 195, 0, 264, 265, 78, 266, 0, 0, 267, 0, 0, 332, 268, 196, 0, 0, 0, 0, 0, 269, 270, 262, 271, 0, 272, 273, 198, 274, 0, 0, 275, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 0, 0, 0, 0, 276, 0, 157, 0, 0, 0, 277, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 440, 194, 195, 0, 703, 265, 78, 266, 0, 0, 267, 0, 0, 0, 268, 196, 0, 0, 0, 0, 0, 269, 270, 0, 271, 0, 272, 273, 198, 274, 0, 622, 275, 192, 193, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 0, 0, 0, 0, 276, 0, 157, 0, 0, 0, 277, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 0, 0, 0, 0, 0, 0, 0, 0, 0, 194, 195, 0, 0, 0, 78, 0, 0, 0, 0, 0, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 191, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 203, 623, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 414, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 203, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 546, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 415, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 493, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 547, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 582, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 148, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 596, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 583, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 604, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 597, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 613, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 605, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 493, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 614, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 582, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 605, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 717, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 701, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 717, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 718, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 596, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 750, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 329, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 755, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 334, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 336, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 338, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 347, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 349, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 351, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 409, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 493, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 501, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 505, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 507, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 509, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 511, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 513, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 515, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 517, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 519, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 521, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 523, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 525, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 527, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 532, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 534, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 536, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 538, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 540, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 542, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 544, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 549, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 558, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 566, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 568, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 599, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 616, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 660, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 687, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 691, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 697, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 0, 576, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 672, 202, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, -287, -287, -287, 0, 0, 0, -287, 0, 0, 0, 0, 0, 0, 0, 0, -287, 0, 0, 0, 0, 0, -287, 0, 0, 726, 0, 194, 195, -287, 0, 0, 78, -287, 0, 0, 0, 0, 0, -287, 0, 196, -287, -287, 0, 0, 0, 197, 0, 0, -287, 0, 0, 0, 198, 0, -287, 0, 199, -287, -287, -287, -287, 0, 80, -287, -287, 81, 20, 194, 195, 0, 0, 0, 78, 276, -295, 0, 0, 0, 0, 0, 0, 196, 204, 205, 206, 207, 0, 197, 208, 209, 670, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 0, 0, 0, 0, 276, -295, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 689, 0, 194, 195, 0, 0, 0, 78, 0, 0, 0, 0, 0, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 192, 193, 0, 0, 0, 78, 276, 0, 0, 0, 0, 0, 0, 0, 196, 204, 205, 206, 207, 0, 197, 208, 209, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 194, 195, 200, 201, 0, 78, 202, 0, 0, 0, 0, 0, 0, 0, 196, 204, 205, 206, 207, 0, 197, 208, 209, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 203, 355, 0, 0, 0, 356, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 0, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 490, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 0, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 632, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 0, 0, 192, 193, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 678, 0, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 0, 0, 192, 193, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 693, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209, 194, 195, 0, 0, 0, 78, 0, 0, 0, 0, 0, 0, 0, 0, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 200, 201, 0, 0, 202, 0, 2, 194, 195, 0, 0, 0, 78, 204, 205, 206, 207, 0, 0, 208, 209, 196, 0, 0, 0, 0, 0, 197, 0, 0, 0, 0, 0, 0, 198, 0, 0, 0, 199, 0, 0, 0, 0, 0, 80, 0, 0, 81, 20, 0, 0, 0, 0, 0, 0, 276, 0, 0, 0, 0, 0, 0, 0, 0, 204, 205, 206, 207, 0, 0, 208, 209 }; static const short yycheck[] = { 3, 327, 62, 6, 62, 484, 179, 132, 123, 62, 62, 286, 203, 1, 1, 134, 403, 1, 129, 117, 403, 0, 1, 1, 306, 15, 591, 94, 1, 1, 129, 86, 1, 100, 94, 1, 94, 89, 1, 42, 62, 94, 94, 46, 83, 192, 193, 194, 195, 95, 1, 162, 150, 200, 201, 153, 642, 1, 169, 62, 1, 64, 53, 162, 72, 44, 69, 89, 1, 129, 100, 129, 94, 1, 172, 52, 129, 129, 86, 198, 133, 133, 61, 122, 123, 345, 89, 1, 67, 1, 101, 94, 352, 353, 67, 435, 1, 87, 67, 1, 665, 97, 162, 1, 162, 93, 97, 129, 160, 162, 162, 133, 99, 101, 101, 175, 94, 101, 1, 52, 99, 707, 175, 175, 710, 128, 129, 99, 180, 101, 133, 134, 98, 4, 5, 98, 1, 477, 160, 1, 162, 620, 1, 0, 1, 97, 198, 258, 99, 100, 202, 42, 325, 94, 98, 46, 254, 160, 180, 162, 175, 272, 95, 278, 504, 36, 37, 554, 1, 40, 98, 554, 175, 64, 557, 1, 762, 180, 69, 50, 94, 767, 94, 769, 140, 771, 100, 44, 100, 192, 193, 194, 195, 95, 99, 198, 94, 200, 201, 202, 253, 253, 100, 590, 61, 1, 1, 100, 79, 328, 67, 471, 83, 1, 474, 94, 99, 100, 1, 642, 1, 95, 101, 370, 371, 372, 286, 86, 1, 94, 282, 253, 94, 286, 286, 100, 1, 128, 100, 1, 99, 1, 99, 134, 129, 1, 202, 203, 1, 93, 253, 122, 123, 306, 306, 638, 1, 1, 1, 92, 282, 94, 1, 603, 97, 98, 99, 100, 139, 95, 94, 286, 1, 99, 327, 327, 100, 162, 293, 282, 98, 97, 557, 286, 707, 101, 301, 710, 303, 629, 293, 306, 642, 88, 1, 1, 487, 1, 301, 639, 303, 1, 98, 306, 175, 327, 1, 198, 179, 265, 1, 99, 268, 595, 654, 597, 99, 1, 99, 434, 276, 647, 642, 1, 327, 328, 99, 92, 93, 1, 382, 478, 97, 98, 99, 100, 1, 99, 98, 762, 675, 86, 98, 403, 767, 98, 769, 218, 771, 1, 403, 403, 95, 1, 99, 99, 293, 707, 1, 98, 710, 1, 1, 638, 301, 94, 303, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 707, 403, 95, 710, 666, 99, 675, 734, 99, 267, 449, 93, 99, 403, 1, 94, 274, 95, 361, 95, 278, 100, 365, 94, 63, 762, 52, 1, 286, 94, 767, 175, 769, 755, 771, 293, 63, 63, 0, 1, 449, 93, 764, 301, 1, 303, 1, 390, 1, 95, 328, 96, 64, 99, 175, 762, 95, 69, 93, 449, 767, 1, 769, 93, 771, 408, 1, 325, 95, 95, 95, 1, 97, 571, 1, 418, 574, 420, 52, 0, 1, 95, 44, 1, 342, 619, 755, 430, 478, 63, 93, 44, 1, 55, 484, 764, 5, 50, 1, 61, 1, 88, 614, 53, 362, 67, 364, 554, 100, 1, 557, 454, 1, 456, 554, 554, 128, 557, 557, 1, 632, 95, 93, 44, 1, 1, 97, 470, 1, 82, 101, 86, 85, 86, 55, 1, 93, 99, 481, 1, 61, 94, 286, 590, 487, 403, 67, 99, 100, 293, 590, 590, 554, 93, 75, 557, 1, 301, 93, 303, 99, 100, 306, 93, 554, 286, 93, 557, 1, 45, 46, 97, 293, 431, 686, 93, 434, 86, 99, 677, 301, 94, 303, 86, 696, 306, 1, 100, 590, 0, 1, 638, 93, 595, 1, 597, 1, 86, 638, 638, 590, 93, 1, 101, 86, 0, 1, 647, 647, 86, 86, 175, 88, 86, 101, 91, 92, 93, 1, 666, 86, 97, 94, 101, 86, 101, 666, 666, 100, 619, 620, 0, 1, 44, 1, 50, 638, 11, 647, 1, 642, 86, 1, 586, 55, 635, 0, 1, 638, 44, 61, 44, 642, 86, 12, 1, 67, 647, 1, 403, 55, 1, 47, 13, 666, 47, 61, 82, 61, 1, 85, 86, 67, 675, 67, 44, 666, 62, 175, 86, 62, 86, 403, 626, 67, 9, 14, 86, 99, 72, 44, 94, 61, 76, 95, 47, 554, 100, 67, 557, 1, 175, 99, 86, 99, 707, 1, 61, 710, 33, 62, 96, 96, 67, 96, 93, 100, 707, 642, 86, 710, 65, 286, 725, 86, 129, 669, 86, 72, 293, 99, 94, 590, 93, 97, 725, 738, 301, 101, 303, 86, 97, 306, 86, 96, 99, 86, 749, 738, 44, 1, 45, 46, 755, 86, 50, 160, 175, 162, 749, 762, 99, 764, 107, 65, 767, 67, 769, 9, 771, 11, 72, 762, 47, 1, 76, 99, 767, 636, 769, 638, 771, 95, 707, 642, 86, 710, 82, 62, 286, 85, 86, 33, 44, 737, 100, 293, 94, 741, 50, 97, 725, 66, 97, 301, 1, 303, 101, 666, 306, 554, 97, 286, 557, 738, 101, 99, 707, 94, 293, 710, 97, 96, 50, 60, 749, 96, 301, 64, 303, 99, 82, 306, 554, 85, 86, 557, 10, 762, 403, 473, 1, 475, 767, 93, 769, 590, 771, 44, 707, 93, 595, 710, 597, 50, 82, 175, 30, 85, 86, 1, 34, 88, 59, 93, 61, 94, 725, 286, 590, 471, 67, 762, 474, 595, 293, 597, 767, 51, 769, 738, 771, 1, 301, 93, 303, 82, 99, 306, 85, 86, 749, 45, 46, 638, 92, 44, 97, 642, 94, 97, 98, 50, 94, 762, 65, 403, 67, 1, 767, 94, 769, 72, 771, 91, 92, 76, 638, 44, 95, 96, 642, 666, 99, 50, 100, 86, 91, 92, 403, 44, 675, 56, 59, 82, 61, 50, 85, 86, 45, 46, 67, 3, 4, 97, 666, 94, 56, 101, 18, 19, 20, 21, 67, 675, 99, 82, 94, 44, 85, 86, 16, 17, 707, 50, 94, 710, 286, 82, 95, 96, 85, 86, 1, 293, 1, 378, 379, 380, 381, 56, 725, 301, 94, 303, 403, 707, 306, 57, 710, 554, 91, 92, 557, 738, 94, 82, 45, 46, 85, 86, 86, 45, 46, 725, 749, 91, 92, 93, 97, 98, 755, 97, 5, 6, 7, 101, 738, 762, 99, 764, 99, 94, 767, 94, 769, 590, 771, 749, 382, 0, 595, 0, 597, 755, 11, 50, 8, 9, 10, 75, 762, 162, 764, 54, 59, 767, 139, 769, 253, 771, 65, 160, 91, 92, 93, 403, 554, 72, 97, 557, 52, 76, 101, 97, 98, 99, 94, 82, 373, 374, 85, 86, 260, 638, 89, 90, 588, 642, 93, 554, 383, 384, 557, 403, 306, 44, 306, 102, 103, 104, 105, 50, 590, 108, 109, 385, 588, 595, 86, 597, 59, 666, 61, 91, 92, 93, 572, 572, 67, 97, 675, 345, 386, 101, 387, 590, 375, 376, 377, 388, 595, 389, 597, 82, 635, -1, 85, 86, -1, 393, -1, -1, -1, -1, -1, 554, 95, 96, 557, -1, 638, 86, 707, -1, 642, 710, 91, 92, 93, 91, 92, 93, 97, -1, -1, 97, 101, -1, -1, 101, 725, -1, -1, 638, 91, 92, 93, 642, 666, -1, 97, 590, -1, 738, 101, -1, 595, 675, 597, 192, 193, 194, 195, -1, 749, -1, -1, 200, 201, -1, 755, 666, -1, -1, -1, -1, -1, 762, -1, 764, 675, 44, 767, -1, 769, -1, 771, 50, -1, 707, -1, -1, 710, -1, -1, -1, 59, -1, 61, 638, -1, -1, -1, 642, 67, -1, -1, 725, -1, -1, -1, -1, 707, -1, 554, 710, -1, 557, -1, 82, 738, -1, 85, 86, -1, -1, -1, 666, -1, -1, 725, 749, -1, 96, -1, -1, 675, 755, -1, -1, -1, -1, -1, 738, 762, -1, 764, -1, -1, 767, 590, 769, -1, 771, 749, 595, -1, 597, -1, -1, 755, -1, -1, -1, -1, -1, -1, 762, 707, 764, -1, 710, 767, -1, 769, -1, 771, 44, -1, 192, 193, 194, 195, 50, -1, -1, 725, 200, 201, -1, -1, -1, 59, -1, 61, -1, -1, -1, 638, 738, 67, -1, 642, -1, -1, -1, -1, -1, -1, -1, 749, -1, -1, -1, -1, 82, 755, -1, 85, 86, -1, -1, -1, 762, -1, 764, 666, -1, 767, 96, 769, -1, 771, -1, -1, 675, -1, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, -1, 383, 384, 385, 386, 387, 388, 389, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 707, -1, -1, 710, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 725, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 738, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 749, -1, -1, -1, -1, -1, 755, -1, -1, -1, -1, -1, -1, 762, -1, 764, -1, -1, 767, -1, 769, -1, 771, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 478, -1, -1, -1, -1, -1, 484, -1, -1, -1, -1, -1, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, -1, 383, 384, 385, 386, 387, 388, 389, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, 54, -1, -1, -1, 58, 59, -1, -1, 62, -1, -1, 65, 66, 67, 68, -1, 70, 71, 72, 73, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, -1, -1, -1, 1, 93, -1, 95, 96, -1, -1, 99, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 478, -1, -1, 44, 45, 46, 484, 48, 49, 50, 51, -1, -1, 54, -1, -1, -1, 58, 59, -1, -1, 619, 620, -1, 65, 66, 67, 68, 1, 70, 71, 72, 73, -1, -1, 76, -1, 635, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, -1, -1, -1, -1, 93, -1, 95, 96, -1, -1, 99, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, -1, -1, 44, 45, 46, -1, 48, 49, 50, 51, -1, -1, 54, -1, -1, -1, 58, 59, -1, -1, -1, -1, -1, 65, 66, 67, 68, -1, 70, 71, 72, 73, 1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, -1, -1, -1, -1, 93, -1, 95, -1, -1, -1, 99, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, -1, -1, -1, -1, 619, 620, -1, 44, 45, 46, -1, 48, 49, 50, 51, -1, -1, 54, -1, -1, 635, 58, 59, -1, -1, -1, -1, -1, 65, 66, 1, 68, -1, 70, 71, 72, 73, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, -1, -1, -1, -1, 93, -1, 95, -1, -1, -1, 99, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 44, 45, 46, -1, 48, 49, 50, 51, -1, -1, 54, -1, -1, -1, 58, 59, -1, -1, -1, -1, -1, 65, 66, -1, 68, -1, 70, 71, 72, 73, -1, 1, 76, 3, 4, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, -1, -1, -1, -1, 93, -1, 95, -1, -1, -1, 99, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, -1, -1, -1, -1, -1, -1, -1, -1, -1, 45, 46, -1, -1, -1, 50, -1, -1, -1, -1, -1, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, 95, 96, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, 95, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, 99, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, 88, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, 98, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, 94, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, 99, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, 98, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, 94, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, 98, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, 94, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, 94, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, 94, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, 99, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, 1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, 1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, -1, 1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, 1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 44, 45, 46, -1, -1, -1, 50, -1, -1, -1, -1, -1, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, 1, -1, 45, 46, 72, -1, -1, 50, 76, -1, -1, -1, -1, -1, 82, -1, 59, 85, 86, -1, -1, -1, 65, -1, -1, 93, -1, -1, -1, 72, -1, 99, -1, 76, 102, 103, 104, 105, -1, 82, 108, 109, 85, 86, 45, 46, -1, -1, -1, 50, 93, 94, -1, -1, -1, -1, -1, -1, 59, 102, 103, 104, 105, -1, 65, 108, 109, 1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, -1, -1, -1, -1, 93, 94, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 1, -1, 45, 46, -1, -1, -1, 50, -1, -1, -1, -1, -1, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 3, 4, -1, -1, -1, 50, 93, -1, -1, -1, -1, -1, -1, -1, 59, 102, 103, 104, 105, -1, 65, 108, 109, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, 45, 46, 89, 90, -1, 50, 93, -1, -1, -1, -1, -1, -1, -1, 59, 102, 103, 104, 105, -1, 65, 108, 109, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, 95, 96, -1, -1, -1, 100, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, -1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, 94, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, -1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, 94, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, -1, -1, 3, 4, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, 94, -1, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, -1, -1, 3, 4, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, 94, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109, 45, 46, -1, -1, -1, 50, -1, -1, -1, -1, -1, -1, -1, -1, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, 89, 90, -1, -1, 93, -1, 44, 45, 46, -1, -1, -1, 50, 102, 103, 104, 105, -1, -1, 108, 109, 59, -1, -1, -1, -1, -1, 65, -1, -1, -1, -1, -1, -1, 72, -1, -1, -1, 76, -1, -1, -1, -1, -1, 82, -1, -1, 85, 86, -1, -1, -1, -1, -1, -1, 93, -1, -1, -1, -1, -1, -1, -1, -1, 102, 103, 104, 105, -1, -1, 108, 109 }; #define YYPURE 1 /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/cygnus/gnupro-98r1/share/bison.simple" /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc. 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 2, 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. */ /* As a special exception, when this file is copied by Bison into a Bison output file, you may use that output file without restriction. This special exception was added by the Free Software Foundation in version 1.24 of Bison. */ #ifndef alloca #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) #include #else /* not sparc */ #if defined (MSDOS) && !defined (__TURBOC__) #include #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) #include #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 #ifdef YYLEX_PARAM #define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) #else #define YYLEX yylex(&yylval, &yylloc) #endif #else /* not YYLSP_NEEDED */ #ifdef YYLEX_PARAM #define YYLEX yylex(&yylval, YYLEX_PARAM) #else #define YYLEX yylex(&yylval) #endif #endif /* not YYLSP_NEEDED */ #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_memcpy(TO,FROM,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_memcpy (to, from, count) char *to; char *from; 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_memcpy (char *to, char *from, int count) { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif #line 196 "/usr/cygnus/gnupro-98r1/share/bison.simple" /* The user can define YYPARSE_PARAM as the name of an argument to be passed into yyparse. The argument should have type void *. It should actually point to an object. Grammar actions can access the variable by casting it to the proper pointer type. */ #ifdef YYPARSE_PARAM #ifdef __cplusplus #define YYPARSE_PARAM_ARG void *YYPARSE_PARAM #define YYPARSE_PARAM_DECL #else /* not __cplusplus */ #define YYPARSE_PARAM_ARG YYPARSE_PARAM #define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; #endif /* not __cplusplus */ #else /* not YYPARSE_PARAM */ #define YYPARSE_PARAM_ARG #define YYPARSE_PARAM_DECL #endif /* not YYPARSE_PARAM */ int yyparse(YYPARSE_PARAM_ARG) YYPARSE_PARAM_DECL { 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 reallocate 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 reallocate 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_memcpy ((char *)yyss, (char *)yyss1, size * sizeof (*yyssp)); yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp)); __yy_memcpy ((char *)yyvs, (char *)yyvs1, size * sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp)); __yy_memcpy ((char *)yyls, (char *)yyls1, 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 1: #line 273 "./parse.y" {; break;} case 18: #line 317 "./parse.y" { yyval.node = build_java_array_type (yyvsp[-2].node, -1); CLASS_LOADED_P (yyval.node) = 1; ; break;} case 19: #line 322 "./parse.y" { yyval.node = build_unresolved_array_type (yyvsp[-2].node); ; break;} case 20: #line 324 "./parse.y" { yyval.node = build_unresolved_array_type (yyvsp[-2].node); ; break;} case 21: #line 326 "./parse.y" {RULE ("']' expected"); RECOVER;; break;} case 22: #line 328 "./parse.y" {RULE ("']' expected"); RECOVER;; break;} case 26: #line 343 "./parse.y" { yyval.node = make_qualified_name (yyvsp[-2].node, yyvsp[0].node, yyvsp[-1].operator.location); ; break;} case 28: #line 352 "./parse.y" {yyval.node = NULL;; break;} case 36: #line 364 "./parse.y" { yyval.node = NULL; ; break;} case 37: #line 368 "./parse.y" { yyval.node = NULL; ; break;} case 40: #line 380 "./parse.y" { ctxp->package = EXPR_WFL_NODE (yyvsp[-1].node); ; break;} case 41: #line 382 "./parse.y" {yyerror ("Missing name"); RECOVER;; break;} case 42: #line 384 "./parse.y" {yyerror ("';' expected"); RECOVER;; break;} case 45: #line 394 "./parse.y" { tree name = EXPR_WFL_NODE (yyvsp[-1].node), node, last_name; int i = IDENTIFIER_LENGTH (name)-1; char *last = &IDENTIFIER_POINTER (name)[i]; while (last != IDENTIFIER_POINTER (name)) { if (last [0] == '.') break; last--; } last_name = get_identifier (++last); if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (last_name)) { tree err = find_name_in_single_imports (last_name); if (err && err != name) parse_error_context (yyvsp[-1].node, "Ambiguous class: `%s' and `%s'", IDENTIFIER_POINTER (name), IDENTIFIER_POINTER (err)); else REGISTER_IMPORT (yyvsp[-1].node, last_name) } else REGISTER_IMPORT (yyvsp[-1].node, last_name); ; break;} case 46: #line 420 "./parse.y" {yyerror ("Missing name"); RECOVER;; break;} case 47: #line 422 "./parse.y" {yyerror ("';' expected"); RECOVER;; break;} case 48: #line 427 "./parse.y" { tree name = EXPR_WFL_NODE (yyvsp[-3].node); tree node = build_tree_list (yyvsp[-3].node, NULL_TREE); if (!IS_AN_IMPORT_ON_DEMAND_P (name)) { read_import_dir (yyvsp[-3].node); IS_AN_IMPORT_ON_DEMAND_P (name) = 1; } TREE_CHAIN (node) = ctxp->import_demand_list; ctxp->import_demand_list = node; ; break;} case 49: #line 439 "./parse.y" {yyerror ("'*' expected"); RECOVER;; break;} case 50: #line 441 "./parse.y" {yyerror ("';' expected"); RECOVER;; break;} case 51: #line 446 "./parse.y" { maybe_generate_clinit (); maybe_generate_finit (); yyval.node = yyvsp[0].node; ; break;} case 53: #line 453 "./parse.y" { yyval.node = NULL; ; break;} case 54: #line 455 "./parse.y" { YYERROR_NOW; yyerror ("Class or interface declaration expected"); ; break;} case 55: #line 466 "./parse.y" { yyval.value = (1 << yyvsp[0].value); ; break;} case 56: #line 470 "./parse.y" { int acc = (1 << yyvsp[0].value); if (yyval.value & acc) parse_error_context (ctxp->modifier_ctx [yyvsp[0].value], "Modifier `%s' declared twice", java_accstring_lookup (acc)); else { yyval.value |= acc; } ; break;} case 57: #line 486 "./parse.y" { create_class (yyvsp[-4].value, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ; break;} case 58: #line 488 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 59: #line 492 "./parse.y" { create_class (0, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ; break;} case 60: #line 494 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 61: #line 498 "./parse.y" {yyerror ("Missing class name"); RECOVER;; break;} case 62: #line 500 "./parse.y" {yyerror ("Missing class name"); RECOVER;; break;} case 63: #line 502 "./parse.y" {if (!ctxp->class_err) yyerror ("'{' expected"); DRECOVER(class1);; break;} case 64: #line 504 "./parse.y" {if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER;; break;} case 65: #line 508 "./parse.y" { yyval.node = NULL; ; break;} case 66: #line 510 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 67: #line 512 "./parse.y" {yyerror ("'{' expected"); ctxp->class_err=1;; break;} case 68: #line 514 "./parse.y" {yyerror ("Missing super class name"); ctxp->class_err=1;; break;} case 69: #line 518 "./parse.y" { yyval.node = NULL_TREE; ; break;} case 70: #line 520 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 71: #line 522 "./parse.y" { ctxp->class_err=1; yyerror ("Missing interface name"); ; break;} case 72: #line 530 "./parse.y" { ctxp->interface_number = 1; yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE); ; break;} case 73: #line 535 "./parse.y" { ctxp->interface_number++; yyval.node = chainon (yyvsp[-2].node, build_tree_list (yyvsp[0].node, NULL_TREE)); ; break;} case 74: #line 540 "./parse.y" {yyerror ("Missing interface name"); RECOVER;; break;} case 75: #line 545 "./parse.y" { yyval.node = ctxp->current_parsed_class; ; break;} case 76: #line 547 "./parse.y" { yyval.node = ctxp->current_parsed_class; ; break;} case 82: #line 560 "./parse.y" { yyval.node = parse_jdk1_1_error ("instance initializer"); ; break;} case 85: #line 567 "./parse.y" { yyval.node = parse_jdk1_1_error ("inner classe declaration"); ; break;} case 86: #line 569 "./parse.y" { yyval.node = parse_jdk1_1_error ("inner interface declaration"); ; break;} case 87: #line 575 "./parse.y" { register_fields (0, yyvsp[-2].node, yyvsp[-1].node); ; break;} case 88: #line 577 "./parse.y" { check_modifiers ("Illegal modifier `%s' for field declaration", yyvsp[-3].value, FIELD_MODIFIERS); check_modifiers_consistency (yyvsp[-3].value); register_fields (yyvsp[-3].value, yyvsp[-2].node, yyvsp[-1].node); ; break;} case 90: #line 590 "./parse.y" { yyval.node = chainon (yyvsp[-2].node, yyvsp[0].node); ; break;} case 91: #line 592 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 92: #line 597 "./parse.y" { yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE); ; break;} case 93: #line 599 "./parse.y" { if (java_error_count) yyvsp[0].node = NULL_TREE; yyval.node = build_tree_list (yyvsp[-2].node, build_assignment (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node)); ; break;} case 94: #line 606 "./parse.y" { yyerror ("Missing variable initializer"); yyval.node = build_tree_list (yyvsp[-2].node, NULL_TREE); RECOVER; ; break;} case 95: #line 612 "./parse.y" { yyerror ("';' expected"); yyval.node = build_tree_list (yyvsp[-3].node, NULL_TREE); RECOVER; ; break;} case 97: #line 622 "./parse.y" { yyval.node = build_unresolved_array_type (yyvsp[-2].node); ; break;} case 98: #line 624 "./parse.y" {yyerror ("Invalid declaration"); DRECOVER(vdi);; break;} case 99: #line 626 "./parse.y" {yyerror ("']' expected"); DRECOVER(vdi);; break;} case 100: #line 628 "./parse.y" {yyerror ("Unbalanced ']'"); DRECOVER(vdi);; break;} case 102: #line 634 "./parse.y" { yyval.node = NULL; ; break;} case 103: #line 640 "./parse.y" { current_function_decl = yyvsp[0].node; source_start_java_method (current_function_decl); ; break;} case 104: #line 645 "./parse.y" { complete_method_declaration (yyvsp[0].node); ; break;} case 105: #line 647 "./parse.y" {YYNOT_TWICE yyerror ("'{' expected"); RECOVER;; break;} case 106: #line 652 "./parse.y" { yyval.node = method_header (0, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ; break;} case 107: #line 654 "./parse.y" { yyval.node = method_header (0, void_type_node, yyvsp[-1].node, yyvsp[0].node); ; break;} case 108: #line 656 "./parse.y" { yyval.node = method_header (yyvsp[-3].value, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ; break;} case 109: #line 658 "./parse.y" { yyval.node = method_header (yyvsp[-3].value, void_type_node, yyvsp[-1].node, yyvsp[0].node); ; break;} case 110: #line 660 "./parse.y" {RECOVER;; break;} case 111: #line 662 "./parse.y" {RECOVER;; break;} case 112: #line 664 "./parse.y" {yyerror ("Identifier expected"); RECOVER;; break;} case 113: #line 666 "./parse.y" {yyerror ("Identifier expected"); RECOVER;; break;} case 114: #line 668 "./parse.y" { yyerror ("Invalid method declaration, return type required"); RECOVER; ; break;} case 115: #line 676 "./parse.y" { yyval.node = method_declarator (yyvsp[-2].node, NULL_TREE); ; break;} case 116: #line 678 "./parse.y" { yyval.node = method_declarator (yyvsp[-3].node, yyvsp[-1].node); ; break;} case 117: #line 680 "./parse.y" { /* Issue a warning here: obsolete declaration. FIXME */ yyval.node = NULL; /* FIXME */ ; break;} case 118: #line 685 "./parse.y" {yyerror ("')' expected"); DRECOVER(method_declarator);; break;} case 119: #line 687 "./parse.y" {yyerror ("']' expected"); RECOVER;; break;} case 120: #line 692 "./parse.y" { ctxp->formal_parameter_number = 1; ; break;} case 121: #line 696 "./parse.y" { ctxp->formal_parameter_number += 1; yyval.node = chainon (yyvsp[-2].node, yyvsp[0].node); ; break;} case 122: #line 701 "./parse.y" {yyerror ("Missing formal parameter term"); RECOVER;; break;} case 123: #line 706 "./parse.y" { yyval.node = build_tree_list (yyvsp[0].node, yyvsp[-1].node); ; break;} case 124: #line 710 "./parse.y" { yyval.node = parse_jdk1_1_error ("final local"); ; break;} case 125: #line 712 "./parse.y" {yyerror ("Missing identifier"); RECOVER;; break;} case 126: #line 714 "./parse.y" { SOURCE_FRONTEND_DEBUG (("Modifiers: %d", yyvsp[-2].value)); yyerror ("Missing identifier"); RECOVER; ; break;} case 127: #line 721 "./parse.y" { yyval.node = NULL_TREE; ; break;} case 128: #line 723 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 129: #line 725 "./parse.y" {yyerror ("Missing class type term"); RECOVER;; break;} case 130: #line 730 "./parse.y" { yyval.node = build_tree_list (NULL_TREE, yyvsp[0].node); ; break;} case 131: #line 732 "./parse.y" { yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, yyvsp[-2].node); ; break;} case 132: #line 734 "./parse.y" {yyerror ("Missing class type term"); RECOVER;; break;} case 135: #line 741 "./parse.y" { yyval.node = NULL_TREE; ; break;} case 136: #line 747 "./parse.y" { RULE ("STATIC_INITIALIZER"); ; break;} case 137: #line 751 "./parse.y" { RULE ("STATIC_INITIALIZER"); ; break;} case 138: #line 758 "./parse.y" { SOURCE_FRONTEND_DEBUG (("Modifiers: %d", yyvsp[0].value)); ; break;} case 139: #line 766 "./parse.y" { current_function_decl = yyvsp[0].node; source_start_java_method (current_function_decl); ; break;} case 140: #line 771 "./parse.y" { complete_method_declaration (yyvsp[0].node); ; break;} case 141: #line 776 "./parse.y" { yyval.node = method_header (0, NULL_TREE, yyvsp[-1].node, yyvsp[0].node); ; break;} case 142: #line 778 "./parse.y" { yyval.node = method_header (yyvsp[-2].value, NULL_TREE, yyvsp[-1].node, yyvsp[0].node); ; break;} case 143: #line 783 "./parse.y" { yyval.node = method_declarator (yyvsp[-2].node, NULL_TREE); ; break;} case 144: #line 785 "./parse.y" { yyval.node = method_declarator (yyvsp[-3].node, yyvsp[-1].node); ; break;} case 145: #line 793 "./parse.y" { BLOCK_EXPR_BODY (yyvsp[0].node) = size_zero_node; yyval.node = yyvsp[0].node; ; break;} case 146: #line 798 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 147: #line 800 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 148: #line 802 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 149: #line 808 "./parse.y" { yyval.node = build_method_invocation (yyvsp[-3].node, NULL_TREE); yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-3].node), yyval.node); yyval.node = java_method_add_stmt (current_function_decl, yyval.node); ; break;} case 150: #line 814 "./parse.y" { yyval.node = build_method_invocation (yyvsp[-4].node, yyvsp[-2].node); yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-4].node), yyval.node); yyval.node = java_method_add_stmt (current_function_decl, yyval.node); ; break;} case 151: #line 822 "./parse.y" {yyval.node = parse_jdk1_1_error ("explicit constructor invocation"); ; break;} case 152: #line 824 "./parse.y" {yyval.node = parse_jdk1_1_error ("explicit constructor invocation"); ; break;} case 153: #line 829 "./parse.y" { tree wfl = build_wfl_node (this_identifier_node, input_filename, 0, 0); EXPR_WFL_LINECOL (wfl) = yyvsp[0].operator.location; yyval.node = wfl; ; break;} case 154: #line 836 "./parse.y" { tree wfl = build_wfl_node (super_identifier_node, input_filename, 0, 0); EXPR_WFL_LINECOL (wfl) = yyvsp[0].operator.location; yyval.node = wfl; ; break;} case 155: #line 848 "./parse.y" { create_interface (0, yyvsp[0].node, NULL_TREE); ; break;} case 156: #line 850 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 157: #line 854 "./parse.y" { create_interface (yyvsp[-2].value, yyvsp[0].node, NULL_TREE); ; break;} case 158: #line 856 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 159: #line 860 "./parse.y" { create_interface (0, yyvsp[-1].node, yyvsp[0].node); ; break;} case 160: #line 862 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 161: #line 866 "./parse.y" { create_interface (yyvsp[-3].value, yyvsp[-1].node, yyvsp[0].node); ; break;} case 162: #line 868 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 163: #line 872 "./parse.y" {yyerror ("(here)'{' expected"); RECOVER;; break;} case 164: #line 874 "./parse.y" {yyerror ("(there)'{' expected"); RECOVER;; break;} case 165: #line 879 "./parse.y" { ctxp->interface_number = 1; yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE); ; break;} case 166: #line 884 "./parse.y" { ctxp->interface_number++; yyval.node = chainon (yyvsp[-2].node, build_tree_list (yyvsp[0].node, NULL_TREE)); ; break;} case 167: #line 889 "./parse.y" {yyerror ("Invalid interface type"); RECOVER;; break;} case 168: #line 891 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 169: #line 896 "./parse.y" { yyval.node = NULL_TREE; ; break;} case 170: #line 898 "./parse.y" { yyval.node = NULL_TREE; ; break;} case 175: #line 910 "./parse.y" { yyval.node = parse_jdk1_1_error ("inner class declaration"); ; break;} case 176: #line 912 "./parse.y" { yyval.node = parse_jdk1_1_error ("inner interface declaration"); ; break;} case 178: #line 921 "./parse.y" { check_abstract_method_header (yyvsp[-1].node); current_function_decl = NULL_TREE; /* FIXME ? */ ; break;} case 179: #line 926 "./parse.y" {yyerror ("';' expected"); RECOVER;; break;} case 180: #line 932 "./parse.y" { RULE ("ARRAY_INITIALIZER (empty)"); ; break;} case 181: #line 936 "./parse.y" { RULE ("ARRAY_INITIALIZER (variable)"); ; break;} case 182: #line 940 "./parse.y" { RULE ("ARRAY_INITIALIZER (,)"); ; break;} case 183: #line 944 "./parse.y" { RULE ("ARRAY_INITIALIZER (variable, ,)"); ; break;} case 186: #line 953 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 187: #line 959 "./parse.y" { yyval.node = size_zero_node; ; break;} case 188: #line 961 "./parse.y" { yyval.node = yyvsp[0].node; ; break;} case 189: #line 966 "./parse.y" { enter_block (); ; break;} case 190: #line 971 "./parse.y" { maybe_absorb_scoping_blocks (); yyval.node = exit_block (); ; break;} case 194: #line 985 "./parse.y" { yyval.node = java_method_add_stmt (current_function_decl, yyvsp[0].node); ; break;} case 195: #line 987 "./parse.y" { yyval.node = parse_jdk1_1_error ("inner class declaration"); ; break;} case 197: #line 996 "./parse.y" { declare_local_variables (0, yyvsp[-1].node, yyvsp[0].node); ; break;} case 198: #line 998 "./parse.y" { declare_local_variables (yyvsp[-2].value, yyvsp[-1].node, yyvsp[0].node); ; break;} case 204: #line 1008 "./parse.y" { /* If the for loop is unlabeled, we must return the block it was defined it. It our last chance to get a hold on it. */ if (!LOOP_HAS_LABEL_P (yyval.node)) yyval.node = exit_block (); ; break;} case 221: #line 1041 "./parse.y" { yyval.node = size_zero_node; ; break;} case 222: #line 1046 "./parse.y" { yyval.node = build_labeled_block (EXPR_WFL_LINECOL (yyvsp[-1].node), EXPR_WFL_NODE (yyvsp[-1].node)); pushlevel (2); push_labeled_block (yyval.node); PUSH_LABELED_BLOCK (yyval.node); ; break;} case 223: #line 1057 "./parse.y" { yyval.node = complete_labeled_statement (yyvsp[-1].node, yyvsp[0].node); pop_labeled_block (); POP_LABELED_BLOCK (); ; break;} case 224: #line 1063 "./parse.y" {yyerror ("':' expected"); RECOVER;; break;} case 225: #line 1068 "./parse.y" { yyval.node = complete_labeled_statement (yyvsp[-1].node, yyvsp[0].node); pop_labeled_block (); POP_LABELED_BLOCK (); ; break;} case 226: #line 1079 "./parse.y" { /* We have a statement. Generate a WFL around it so we can debug it */ yyval.node = build_expr_wfl (yyvsp[-1].node, input_filename, lineno, 0); /* We know we have a statement, so set the debug info to be eventually generate here. */ yyval.node = JAVA_MAYBE_GENERATE_DEBUG_INFO (yyval.node); ; break;} case 227: #line 1088 "./parse.y" { if (ctxp->prevent_ese != lineno) yyerror ("Invalid expression statement"); DRECOVER (expr_stmt); ; break;} case 228: #line 1094 "./parse.y" { if (ctxp->prevent_ese != lineno) yyerror ("Invalid expression statement"); DRECOVER (expr_stmt); ; break;} case 229: #line 1100 "./parse.y" { if (ctxp->prevent_ese != lineno) yyerror ("Invalid expression statement"); DRECOVER (expr_stmt); ; break;} case 230: #line 1106 "./parse.y" {yyerror ("')' expected"); RECOVER;; break;} case 231: #line 1108 "./parse.y" { yyerror ("Constructor invocation must be first " "thing in a constructor"); RECOVER; ; break;} case 232: #line 1114 "./parse.y" {yyerror ("')' expected"); RECOVER;; break;} case 233: #line 1116 "./parse.y" { yyerror ("Constructor invocation must be first " "thing in a constructor"); RECOVER; ; break;} case 234: #line 1122 "./parse.y" {yyerror ("'(' expected"); RECOVER;; break;} case 235: #line 1124 "./parse.y" {yyerror ("')' expected"); RECOVER;; break;} case 236: #line 1126 "./parse.y" {yyerror ("')' expected"); RECOVER;; break;} case 237: #line 1128 "./parse.y" {yyerror ("';' expected"); RECOVER;; break;} case 238: #line 1130 "./parse.y" {yyerror ("';' expected"); RECOVER;; break;} case 246: #line 1145 "./parse.y" { yyval.node = build_if_else_statement (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node, NULL_TREE); ; break;} case 247: #line 1147 "./parse.y" {yyerror ("'(' expected"); RECOVER;; break;} case 248: #line 1149 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 249: #line 1151 "./parse.y" {yyerror ("')' expected"); RECOVER;; break;} case 250: #line 1156 "./parse.y" { yyval.node = build_if_else_statement (yyvsp[-5].operator.location, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); ; break;} case 251: #line 1161 "./parse.y" { yyval.node = build_if_else_statement (yyvsp[-5].operator.location, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); ; break;} case 252: #line 1166 "./parse.y" { TREE_OPERAND (yyvsp[-1].node, 1) = yyvsp[0].node; yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-1].node), yyvsp[-1].node); ; break;} case 253: #line 1174 "./parse.y" { yyval.node = build (SWITCH_EXPR, NULL_TREE, yyvsp[-1].node, NULL_TREE); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-2].operator.location; ; break;} case 254: #line 1179 "./parse.y" {yyerror ("'(' expected"); RECOVER;; break;} case 255: #line 1181 "./parse.y" {yyerror ("Missing term or ')'"); DRECOVER(switch_statement);; break;} case 256: #line 1183 "./parse.y" {yyerror ("'{' expected"); RECOVER;; break;} case 257: #line 1188 "./parse.y" { yyval.node = NULL_TREE; ; break;} case 258: #line 1190 "./parse.y" { yyval.node = build_tree_list (yyvsp[-1].node, NULL_TREE); ; break;} case 259: #line 1192 "./parse.y" { yyval.node = yyvsp[-1].node; ; break;} case 260: #line 1194 "./parse.y" { /* Switch labels alone are empty switch statements */ tree sl = build_tree_list (yyvsp[-1].node, NULL_TREE); TREE_CHAIN (sl) = yyvsp[-2].node; yyval.node = sl; ; break;} case 262: #line 1205 "./parse.y" { TREE_CHAIN (yyvsp[0].node) = yyvsp[-1].node; yyval.node = yyvsp[0].node; ; break;} case 263: #line 1213 "./parse.y" { yyval.node = build_tree_list (yyvsp[-1].node, exit_block ()); ; break;} case 264: #line 1218 "./parse.y" { /* All statements attached to this group of cases will be stored in a block */ enter_block (); yyval.node = yyvsp[0].node; ; break;} case 266: #line 1228 "./parse.y" { TREE_CHAIN (yyvsp[0].node) = yyvsp[-1].node; yyval.node = yyvsp[0].node; ; break;} case 267: #line 1236 "./parse.y" { yyval.node = build1 (CASE_EXPR, NULL_TREE, yyvsp[-1].node); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-2].operator.location; ; break;} case 268: #line 1241 "./parse.y" { yyval.node = build1 (DEFAULT_EXPR, NULL_TREE, NULL_TREE); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-1].operator.location; ; break;} case 269: #line 1246 "./parse.y" {yyerror ("Missing or invalid constant expression"); RECOVER;; break;} case 270: #line 1248 "./parse.y" {yyerror ("':' expected"); RECOVER;; break;} case 271: #line 1250 "./parse.y" {yyerror ("':' expected"); RECOVER;; break;} case 272: #line 1255 "./parse.y" { tree body = build_loop_body (yyvsp[-2].operator.location, yyvsp[-1].node, 0); yyval.node = build_new_loop (body); ; break;} case 273: #line 1263 "./parse.y" { yyval.node = complete_loop_body (0, NULL_TREE, yyvsp[0].node, 0); ; break;} case 274: #line 1265 "./parse.y" {YYERROR_NOW; yyerror ("'(' expected"); RECOVER;; break;} case 275: #line 1267 "./parse.y" {yyerror ("Missing term and ')' expected"); RECOVER;; break;} case 276: #line 1269 "./parse.y" {yyerror ("')' expected"); RECOVER;; break;} case 277: #line 1274 "./parse.y" { yyval.node = complete_loop_body (0, NULL_TREE, yyvsp[0].node, 0); ; break;} case 278: #line 1279 "./parse.y" { tree body = build_loop_body (0, NULL_TREE, 1); yyval.node = build_new_loop (body); ; break;} case 279: #line 1288 "./parse.y" { yyval.node = complete_loop_body (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[-5].node, 1); ; break;} case 280: #line 1293 "./parse.y" { yyval.node = complete_for_loop (EXPR_WFL_LINECOL (yyvsp[-4].node), yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node);; break;} case 281: #line 1295 "./parse.y" { yyval.node = complete_for_loop (0, NULL_TREE, yyvsp[-2].node, yyvsp[0].node); /* We have not condition, so we get rid of the EXIT_EXPR */ LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY (yyval.node), 0) = size_zero_node; ; break;} case 282: #line 1302 "./parse.y" {yyerror ("Invalid control expression"); RECOVER;; break;} case 283: #line 1304 "./parse.y" {yyerror ("Invalid update expression"); RECOVER;; break;} case 284: #line 1306 "./parse.y" {yyerror ("Invalid update expression"); RECOVER;; break;} case 285: #line 1311 "./parse.y" { yyval.node = complete_for_loop (EXPR_WFL_LINECOL (yyvsp[-4].node), yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node);; break;} case 286: #line 1313 "./parse.y" { yyval.node = complete_for_loop (0, NULL_TREE, yyvsp[-2].node, yyvsp[0].node); /* We have not condition, so we get rid of the EXIT_EXPR */ LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY (yyval.node), 0) = size_zero_node; ; break;} case 287: #line 1323 "./parse.y" { /* This scope defined for local variable that may be defined within the scope of the for loop */ enter_block (); ; break;} case 288: #line 1329 "./parse.y" {yyerror ("'(' expected"); DRECOVER(for_1);; break;} case 289: #line 1331 "./parse.y" {yyerror ("Invalid init statement"); RECOVER;; break;} case 290: #line 1336 "./parse.y" { /* We now declare the loop body. The loop is declared as a for loop. */ tree body = build_loop_body (0, NULL_TREE, 0); yyval.node = build_new_loop (body); IS_FOR_LOOP_P (yyval.node) = 1; /* The loop is added to the current block the for statement is defined within */ java_method_add_stmt (current_function_decl, yyval.node); ; break;} case 291: #line 1348 "./parse.y" { yyval.node = size_zero_node; ; break;} case 292: #line 1350 "./parse.y" { /* Init statement recorded within the previously defined block scope */ yyval.node = java_method_add_stmt (current_function_decl, yyvsp[0].node); ; break;} case 293: #line 1356 "./parse.y" { /* Local variable are recorded within the previously defined block scope */ yyval.node = NULL_TREE; ; break;} case 294: #line 1362 "./parse.y" {yyerror ("';' expected"); DRECOVER(for_init_1);; break;} case 295: #line 1366 "./parse.y" {yyval.node = size_zero_node;; break;} case 296: #line 1368 "./parse.y" { yyval.node = build_debugable_stmt (BUILD_LOCATION (), yyvsp[0].node); ; break;} case 297: #line 1373 "./parse.y" { yyval.node = add_stmt_to_compound (NULL_TREE, NULL_TREE, yyvsp[0].node); ; break;} case 298: #line 1375 "./parse.y" { yyval.node = add_stmt_to_compound (yyvsp[-2].node, NULL_TREE, yyvsp[0].node); ; break;} case 299: #line 1377 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 300: #line 1382 "./parse.y" { yyval.node = build_bc_statement (yyvsp[-1].operator.location, 1, NULL_TREE); ; break;} case 301: #line 1384 "./parse.y" { yyval.node = build_bc_statement (yyvsp[-2].operator.location, 1, yyvsp[-1].node); ; break;} case 302: #line 1386 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 303: #line 1388 "./parse.y" {yyerror ("';' expected"); RECOVER;; break;} case 304: #line 1393 "./parse.y" { yyval.node = build_bc_statement (yyvsp[-1].operator.location, 0, NULL_TREE); ; break;} case 305: #line 1395 "./parse.y" { yyval.node = build_bc_statement (yyvsp[-2].operator.location, 0, yyvsp[-1].node); ; break;} case 306: #line 1397 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 307: #line 1399 "./parse.y" {yyerror ("';' expected"); RECOVER;; break;} case 308: #line 1404 "./parse.y" { yyval.node = build_return (yyvsp[-1].operator.location, NULL_TREE); ; break;} case 309: #line 1406 "./parse.y" { yyval.node = build_return (yyvsp[-2].operator.location, yyvsp[-1].node); ; break;} case 310: #line 1408 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 311: #line 1410 "./parse.y" {yyerror ("';' expected"); RECOVER;; break;} case 312: #line 1415 "./parse.y" { yyval.node = build1 (THROW_EXPR, NULL_TREE, yyvsp[-1].node); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-2].operator.location; ; break;} case 313: #line 1420 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 314: #line 1422 "./parse.y" {yyerror ("';' expected"); RECOVER;; break;} case 315: #line 1427 "./parse.y" { yyval.node = build (SYNCHRONIZED_EXPR, NULL_TREE, yyvsp[-2].node, yyvsp[0].node); EXPR_WFL_LINECOL (yyval.node) = EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK)); ; break;} case 316: #line 1433 "./parse.y" {yyerror ("'{' expected"); RECOVER;; break;} case 317: #line 1435 "./parse.y" {yyerror ("'(' expected"); RECOVER;; break;} case 318: #line 1437 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 319: #line 1439 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 320: #line 1444 "./parse.y" { if ((1 << yyvsp[0].value) != ACC_SYNCHRONIZED) fatal ("synchronized was '%d' - yyparse", (1 << yyvsp[0].value)); ; break;} case 321: #line 1452 "./parse.y" { yyval.node = build_try_statement (yyvsp[-2].operator.location, yyvsp[-1].node, yyvsp[0].node, NULL_TREE); ; break;} case 322: #line 1454 "./parse.y" { yyval.node = build_try_statement (yyvsp[-2].operator.location, yyvsp[-1].node, NULL_TREE, yyvsp[0].node); ; break;} case 323: #line 1456 "./parse.y" { yyval.node = build_try_statement (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ; break;} case 324: #line 1458 "./parse.y" {yyerror ("'{' expected"); DRECOVER (try_statement);; break;} case 326: #line 1464 "./parse.y" { TREE_CHAIN (yyvsp[0].node) = yyvsp[-1].node; yyval.node = yyvsp[0].node; ; break;} case 327: #line 1472 "./parse.y" { java_method_add_stmt (current_function_decl, yyvsp[0].node); exit_block (); yyval.node = yyvsp[-1].node; ; break;} case 328: #line 1480 "./parse.y" { /* We add a block to define a scope for formal_parameter (CCBP). The formal parameter is declared initialized by the appropriate function call */ tree ccpb = enter_block (); tree init = build_assignment (ASSIGN_TK, yyvsp[-2].operator.location, TREE_PURPOSE (yyvsp[-1].node), soft_exceptioninfo_call_node); declare_local_variables (0, TREE_VALUE (yyvsp[-1].node), build_tree_list (TREE_PURPOSE (yyvsp[-1].node), init)); yyval.node = build1 (CATCH_EXPR, NULL_TREE, ccpb); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-3].operator.location; ; break;} case 329: #line 1496 "./parse.y" {yyerror ("'(' expected"); RECOVER;; break;} case 330: #line 1498 "./parse.y" {yyerror ("Missing term or ')' expected"); DRECOVER (2);; break;} case 331: #line 1500 "./parse.y" {yyerror ("')' expected"); DRECOVER (1);; break;} case 332: #line 1505 "./parse.y" { yyval.node = build (FINALLY_EXPR, NULL_TREE, create_label_decl (generate_name ()), yyvsp[0].node); ; break;} case 333: #line 1510 "./parse.y" {yyerror ("'{' expected"); RECOVER; ; break;} case 337: #line 1522 "./parse.y" { yyval.node = build_this (yyvsp[0].operator.location); ; break;} case 338: #line 1524 "./parse.y" {yyval.node = yyvsp[-1].node;; break;} case 343: #line 1533 "./parse.y" { yyval.node = parse_jdk1_1_error ("class literals"); ; break;} case 344: #line 1535 "./parse.y" { yyval.node = parse_jdk1_1_error ("class literals"); ; break;} case 345: #line 1537 "./parse.y" { yyval.node = parse_jdk1_1_error ("class literals"); ; break;} case 346: #line 1542 "./parse.y" { yyval.node = parse_jdk1_1_error ("class literals"); ; break;} case 347: #line 1544 "./parse.y" {yyerror ("')' expected"); RECOVER;; break;} case 348: #line 1546 "./parse.y" {yyerror ("'class' or 'this' expected" ); RECOVER;; break;} case 349: #line 1548 "./parse.y" {yyerror ("'class' expected" ); RECOVER;; break;} case 350: #line 1550 "./parse.y" {yyerror ("'class' expected" ); RECOVER;; break;} case 351: #line 1555 "./parse.y" { yyval.node = build_new_invocation (yyvsp[-3].node, yyvsp[-1].node); ; break;} case 352: #line 1557 "./parse.y" { yyval.node = build_new_invocation (yyvsp[-2].node, NULL_TREE); ; break;} case 353: #line 1562 "./parse.y" { yyval.node = parse_jdk1_1_error ("inner class instance creation"); ; break;} case 354: #line 1564 "./parse.y" { yyval.node = parse_jdk1_1_error ("inner class instance creation"); ; break;} case 359: #line 1573 "./parse.y" {yyerror ("'(' expected"); DRECOVER(new_1);; break;} case 360: #line 1575 "./parse.y" {yyerror ("'(' expected"); RECOVER;; break;} case 361: #line 1577 "./parse.y" {yyerror ("')' or term expected"); RECOVER;; break;} case 362: #line 1579 "./parse.y" {yyerror ("')' expected"); RECOVER;; break;} case 363: #line 1581 "./parse.y" {YYERROR_NOW; yyerror ("Identifier expected"); RECOVER;; break;} case 364: #line 1583 "./parse.y" {yyerror ("'(' expected"); RECOVER;; break;} case 367: #line 1593 "./parse.y" { yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, NULL_TREE); ctxp->formal_parameter_number = 1; ; break;} case 368: #line 1598 "./parse.y" { ctxp->formal_parameter_number += 1; yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, yyvsp[-2].node); ; break;} case 369: #line 1603 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 370: #line 1608 "./parse.y" { yyval.node = build_newarray_node (yyvsp[-1].node, yyvsp[0].node, 0); ; break;} case 371: #line 1610 "./parse.y" { yyval.node = build_newarray_node (yyvsp[-1].node, yyvsp[0].node, 0); ; break;} case 372: #line 1612 "./parse.y" { yyval.node = build_newarray_node (yyvsp[-2].node, yyvsp[-1].node, ctxp->osb_number); ; break;} case 373: #line 1614 "./parse.y" { yyval.node = build_newarray_node (yyvsp[-2].node, yyvsp[-1].node, ctxp->osb_number); ; break;} case 374: #line 1618 "./parse.y" { yyval.node = parse_jdk1_1_error ("anonymous array"); ; break;} case 375: #line 1620 "./parse.y" { yyval.node = parse_jdk1_1_error ("anonymous array"); ; break;} case 376: #line 1622 "./parse.y" {yyerror ("'[' expected"); DRECOVER ("]");; break;} case 377: #line 1624 "./parse.y" {yyerror ("']' expected"); RECOVER;; break;} case 378: #line 1629 "./parse.y" { yyval.node = build_tree_list (NULL_TREE, yyvsp[0].node); ; break;} case 379: #line 1631 "./parse.y" { yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, yyval.node); ; break;} case 380: #line 1636 "./parse.y" { EXPR_WFL_LINECOL (yyvsp[-1].node) = yyvsp[-2].operator.location; yyval.node = yyvsp[-1].node; ; break;} case 381: #line 1641 "./parse.y" {yyerror ("']' expected"); RECOVER;; break;} case 382: #line 1643 "./parse.y" { yyerror ("Missing term"); yyerror ("']' expected"); RECOVER; ; break;} case 383: #line 1652 "./parse.y" { ctxp->osb_number = 1; ; break;} case 384: #line 1654 "./parse.y" { ctxp->osb_number++; ; break;} case 385: #line 1656 "./parse.y" { yyerror ("']' expected"); RECOVER;; break;} case 386: #line 1661 "./parse.y" { yyval.node = make_qualified_primary (yyvsp[-2].node, yyvsp[0].node, yyvsp[-1].operator.location); ; break;} case 387: #line 1663 "./parse.y" { tree super_wfl = build_wfl_node (super_identifier_node, input_filename, 0, 0); EXPR_WFL_LINECOL (super_wfl) = yyvsp[-2].operator.location; yyval.node = make_qualified_name (super_wfl, yyvsp[0].node, yyvsp[-1].operator.location); ; break;} case 388: #line 1671 "./parse.y" {yyerror ("Field expected"); DRECOVER (super_field_acces);; break;} case 389: #line 1676 "./parse.y" { yyval.node = build_method_invocation (yyvsp[-2].node, NULL_TREE); ; break;} case 390: #line 1678 "./parse.y" { yyval.node = build_method_invocation (yyvsp[-3].node, yyvsp[-1].node); ; break;} case 391: #line 1680 "./parse.y" { if (TREE_CODE (yyvsp[-4].node) == THIS_EXPR) yyval.node = build_this_super_qualified_invocation (1, yyvsp[-2].node, NULL_TREE, 0, yyvsp[-3].operator.location); else { tree invok = build_method_invocation (yyvsp[-2].node, NULL_TREE); yyval.node = make_qualified_primary (yyvsp[-4].node, invok, yyvsp[-3].operator.location); } ; break;} case 392: #line 1691 "./parse.y" { if (TREE_CODE (yyvsp[-5].node) == THIS_EXPR) yyval.node = build_this_super_qualified_invocation (1, yyvsp[-3].node, yyvsp[-1].node, 0, yyvsp[-4].operator.location); else { tree invok = build_method_invocation (yyvsp[-3].node, yyvsp[-1].node); yyval.node = make_qualified_primary (yyvsp[-5].node, invok, yyvsp[-4].operator.location); } ; break;} case 393: #line 1702 "./parse.y" { yyval.node = build_this_super_qualified_invocation (0, yyvsp[-2].node, NULL_TREE, yyvsp[-4].operator.location, yyvsp[-3].operator.location); ; break;} case 394: #line 1707 "./parse.y" { yyval.node = build_this_super_qualified_invocation (0, yyvsp[-3].node, yyvsp[-1].node, yyvsp[-5].operator.location, yyvsp[-4].operator.location); ; break;} case 395: #line 1716 "./parse.y" { yyerror ("'(' expected"); DRECOVER (method_invocation); ; break;} case 396: #line 1718 "./parse.y" { yyerror ("'(' expected"); DRECOVER (method_invocation); ; break;} case 397: #line 1723 "./parse.y" { yyval.node = build_array_ref (yyvsp[-2].operator.location, yyvsp[-3].node, yyvsp[-1].node); ; break;} case 398: #line 1725 "./parse.y" { yyval.node = build_array_ref (yyvsp[-2].operator.location, yyvsp[-3].node, yyvsp[-1].node); ; break;} case 399: #line 1727 "./parse.y" { yyerror ("Missing term and ']' expected"); DRECOVER(array_access); ; break;} case 400: #line 1732 "./parse.y" { yyerror ("']' expected"); DRECOVER(array_access); ; break;} case 401: #line 1737 "./parse.y" { yyerror ("Missing term and ']' expected"); DRECOVER(array_access); ; break;} case 402: #line 1742 "./parse.y" { yyerror ("']' expected"); DRECOVER(array_access); ; break;} case 407: #line 1757 "./parse.y" { yyval.node = build_incdec (yyvsp[0].operator.token, yyvsp[0].operator.location, yyvsp[-1].node, 1); ; break;} case 408: #line 1762 "./parse.y" { yyval.node = build_incdec (yyvsp[0].operator.token, yyvsp[0].operator.location, yyvsp[-1].node, 1); ; break;} case 411: #line 1769 "./parse.y" {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ; break;} case 412: #line 1771 "./parse.y" {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ; break;} case 414: #line 1774 "./parse.y" {yyerror ("Missing term"); RECOVER; break;} case 415: #line 1776 "./parse.y" {yyerror ("Missing term"); RECOVER; break;} case 416: #line 1781 "./parse.y" {yyval.node = build_incdec (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node, 0); ; break;} case 417: #line 1783 "./parse.y" {yyerror ("Missing term"); RECOVER; break;} case 418: #line 1788 "./parse.y" {yyval.node = build_incdec (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node, 0); ; break;} case 419: #line 1790 "./parse.y" {yyerror ("Missing term"); RECOVER; break;} case 421: #line 1796 "./parse.y" {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ; break;} case 422: #line 1798 "./parse.y" {yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ; break;} case 424: #line 1801 "./parse.y" {yyerror ("Missing term"); RECOVER; break;} case 425: #line 1803 "./parse.y" {yyerror ("Missing term"); RECOVER; break;} case 426: #line 1808 "./parse.y" { tree type = yyvsp[-3].node; while (ctxp->osb_number--) type = build_java_array_type (type, -1); yyval.node = build_cast (yyvsp[-4].operator.location, type, yyvsp[0].node); ; break;} case 427: #line 1815 "./parse.y" { yyval.node = build_cast (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 428: #line 1817 "./parse.y" { yyval.node = build_cast (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 429: #line 1819 "./parse.y" { char *ptr; while (ctxp->osb_number--) obstack_1grow (&temporary_obstack, '['); obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (EXPR_WFL_NODE (yyvsp[-3].node)), IDENTIFIER_LENGTH (EXPR_WFL_NODE (yyvsp[-3].node))); ptr = obstack_finish (&temporary_obstack); EXPR_WFL_NODE (yyvsp[-3].node) = get_identifier (ptr); yyval.node = build_cast (yyvsp[-4].operator.location, yyvsp[-3].node, yyvsp[0].node); ; break;} case 430: #line 1831 "./parse.y" {yyerror ("']' expected, invalid type expression");; break;} case 431: #line 1833 "./parse.y" { if (ctxp->prevent_ese != lineno) yyerror ("Invalid type expression"); RECOVER; RECOVER; ; break;} case 432: #line 1839 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 433: #line 1841 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 434: #line 1843 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 436: #line 1849 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 437: #line 1854 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 438: #line 1859 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 439: #line 1864 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 440: #line 1866 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 441: #line 1868 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 443: #line 1874 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 444: #line 1879 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 445: #line 1884 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 446: #line 1886 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 448: #line 1892 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 449: #line 1897 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 450: #line 1902 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 451: #line 1907 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 452: #line 1909 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 453: #line 1911 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 455: #line 1917 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 456: #line 1922 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 457: #line 1927 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 458: #line 1932 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 459: #line 1937 "./parse.y" { yyval.node = build_binop (INSTANCEOF_EXPR, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 460: #line 1939 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 461: #line 1941 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 462: #line 1943 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 463: #line 1945 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 464: #line 1947 "./parse.y" {yyerror ("Invalid reference type"); RECOVER;; break;} case 466: #line 1953 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 467: #line 1958 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 468: #line 1963 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 469: #line 1965 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 471: #line 1971 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 472: #line 1976 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 474: #line 1982 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 475: #line 1987 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 477: #line 1993 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 478: #line 1998 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 480: #line 2004 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 481: #line 2009 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 483: #line 2015 "./parse.y" { yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 484: #line 2020 "./parse.y" {yyerror ("Missing term"); RECOVER;; break;} case 486: #line 2026 "./parse.y" { yyval.node = build (CONDITIONAL_EXPR, NULL_TREE, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); EXPR_WFL_LINECOL (yyval.node) = yyvsp[-3].operator.location; ; break;} case 487: #line 2031 "./parse.y" { YYERROR_NOW; yyerror ("Missing term"); DRECOVER (1); ; break;} case 488: #line 2037 "./parse.y" {yyerror ("Missing term"); DRECOVER (2);; break;} case 489: #line 2039 "./parse.y" {yyerror ("Missing term"); DRECOVER (3);; break;} case 492: #line 2049 "./parse.y" { yyval.node = build_assignment (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ; break;} case 493: #line 2051 "./parse.y" { if (ctxp->prevent_ese != lineno) yyerror ("Missing term"); DRECOVER (assign); ; break;} } /* the action file gets copied in in place of this dollarsign */ #line 498 "/usr/cygnus/gnupro-98r1/share/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 *) malloc(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 2077 "./parse.y" #include "lex.c" /* Flag for the error report routine to issue the error the first time it's called (overriding the default behavior which is to drop the first invocation and honor the second one, taking advantage of a richer context. */ static int force_error = 0; /* Create a new parser context and make it the current one. */ void java_push_parser_context () { struct parser_ctxt *new = (struct parser_ctxt *)malloc(sizeof (struct parser_ctxt)); bzero (new, sizeof (struct parser_ctxt)); new->next = ctxp; ctxp = new; if (ctxp->next) { ctxp->incomplete_class = ctxp->next->incomplete_class; ctxp->gclass_list = ctxp->next->gclass_list; } } /* If the first file of a file list was a class file, no context exists for a source file to be parsed. This boolean remembers that java_parser_context_save_global might have created a dummy one, so that java_parser_context_restore_global can pop it. */ static int extra_ctxp_pushed_p = 0; void java_parser_context_save_global () { if (!ctxp) { java_push_parser_context (); extra_ctxp_pushed_p = 1; } ctxp->finput = finput; ctxp->lineno = lineno; ctxp->current_class = current_class; ctxp->filename = input_filename; ctxp->current_function_decl = current_function_decl; } void java_parser_context_restore_global () { finput = ctxp->finput; lineno = ctxp->lineno; current_class = ctxp->current_class; input_filename = ctxp->filename; current_function_decl = ctxp->current_function_decl; if (extra_ctxp_pushed_p) { java_pop_parser_context (0); extra_ctxp_pushed_p = 0; } } void java_pop_parser_context (generate) int generate; { tree current; struct parser_ctxt *toFree, *next; if (!ctxp) return; toFree = ctxp; next = ctxp->next; if (next) { next->incomplete_class = ctxp->incomplete_class; next->gclass_list = ctxp->gclass_list; lineno = ctxp->lineno; finput = ctxp->finput; current_class = ctxp->current_class; } /* Set the single import class file flag to 0 for the current list of imported things */ for (current = ctxp->import_list; current; current = TREE_CHAIN (current)) IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_PURPOSE (current)) = 0; /* And restore those of the previous context */ if ((ctxp = next)) /* Assignment is really meant here */ for (current = ctxp->import_list; current; current = TREE_CHAIN (current)) IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_PURPOSE (current)) = 1; if (generate) { toFree->next = ctxp_for_generation; ctxp_for_generation = toFree; } else free (toFree); } /* Reporting JDK1.1 features not implemented */ static tree parse_jdk1_1_error (msg) char *msg; { sorry (": `%s' JDK1.1(TM) feature", msg); java_error_count++; return size_zero_node; } static int do_warning = 0; void yyerror (msg) char *msg; { static java_lc elc; static int prev_lineno; static char *prev_msg; int save_lineno; char *remainder, *code_from_source; extern struct obstack temporary_obstack; if (!force_error && prev_lineno == lineno) return; /* Save current error location but report latter, when the context is richer. */ if (ctxp->java_error_flag == 0) { ctxp->java_error_flag = 1; elc = ctxp->elc; /* Do something to use the previous line if we're reaching the end of the file... */ #ifdef VERBOSE_SKELETON printf ("* Error detected (%s)\n", (msg ? msg : "(null)")); #endif return; } /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */ if (!force_error && msg == prev_msg && prev_lineno == elc.line) return; ctxp->java_error_flag = 0; if (do_warning) java_warning_count++; else java_error_count++; if (elc.col == 0 && msg[1] == ';') { elc.col = ctxp->p_line->char_col-1; elc.line = ctxp->p_line->lineno; } save_lineno = lineno; prev_lineno = lineno = elc.line; prev_msg = msg; code_from_source = java_get_line_col (ctxp->filename, elc.line, elc.col); obstack_grow0 (&temporary_obstack, code_from_source, strlen (code_from_source)); remainder = obstack_finish (&temporary_obstack); if (do_warning) warning ("%s.\n%s", msg, remainder); else error ("%s.\n%s", msg, remainder); /* This allow us to cheaply avoid an extra 'Invalid expression statement' error report when errors have been already reported on the same line. This occurs when we report an error but don't have a synchronization point other than ';', which expression_statement is the only one to take care of. */ ctxp->prevent_ese = lineno = save_lineno; } static void parse_error (msg) char *msg; { java_error (NULL); java_error (msg); } static void issue_warning_error_from_context (cl, msg) tree cl; char *msg; { char *saved; ctxp->elc.line = EXPR_WFL_LINENO (cl); ctxp->elc.col = (EXPR_WFL_COLNO (cl) == 0xfff ? -1 : EXPR_WFL_COLNO (cl)); /* We have a CL, that's a good reason for using it if it contains data */ saved = ctxp->filename; if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl)) ctxp->filename = EXPR_WFL_FILENAME (cl); parse_error (msg); ctxp->filename = saved; } /* Issue an error message at a current source line CL */ static void parse_error_context VPROTO ((tree cl, char *msg, ...)) { #ifndef __STDC__ tree cl; char *msg; #endif char buffer [4096]; va_list ap; VA_START (ap, msg); #ifndef __STDC__ cl = va_arg (ap, tree); msg = va_arg (ap, char *); #endif vsprintf (buffer, msg, ap); force_error = 1; issue_warning_error_from_context (cl, buffer); force_error = 0; } /* Issue a warning at a current source line CL */ static void parse_warning_context VPROTO ((tree cl, char *msg, ...)) { #ifndef __STDC__ tree cl; char *msg; #endif char buffer [4096]; va_list ap; VA_START (ap, msg); #ifndef __STDC__ cl = va_arg (ap, tree); msg = va_arg (ap, char *); #endif vsprintf (buffer, msg, ap); force_error = do_warning = 1; issue_warning_error_from_context (cl, buffer); do_warning = force_error = 0; } void java_report_errors () { if (java_error_count) fprintf (stderr, "%d error%s", java_error_count, (java_error_count == 1 ? "" : "s")); if (java_warning_count) fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""), java_warning_count, (java_warning_count == 1 ? "" : "s")); if (java_error_count || java_warning_count) putc ('\n', stderr); } static char * java_accstring_lookup (flags) int flags; { static char buffer [80]; #define COPY_RETURN(S) {strcpy (buffer, S); return buffer;} /* Access modifier looked-up first for easier report on forbidden access. */ if (flags & ACC_PUBLIC) COPY_RETURN ("public"); if (flags & ACC_PRIVATE) COPY_RETURN ("private"); if (flags & ACC_PROTECTED) COPY_RETURN ("protected"); if (flags & ACC_STATIC) COPY_RETURN ("static"); if (flags & ACC_FINAL) COPY_RETURN ("final"); if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized"); if (flags & ACC_VOLATILE) COPY_RETURN ("volatile"); if (flags & ACC_TRANSIENT) COPY_RETURN ("transient"); if (flags & ACC_NATIVE) COPY_RETURN ("native"); if (flags & ACC_INTERFACE) COPY_RETURN ("interface"); if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract"); buffer [0] = '\0'; return buffer; #undef COPY_RETURN } /* Issuing error messages upon redefinition of classes, interfaces or variables. */ static void classitf_redefinition_error (context, id, decl, cl) char *context; tree id, decl, cl; { parse_error_context (cl, "%s `%s' already defined in %s:%d", context, IDENTIFIER_POINTER (id), DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl)); /* Here we should point out where its redefined. It's a unicode. FIXME */ } static void variable_redefinition_error (context, name, type, line) tree context, name, type; int line; { char *type_name; /* Figure a proper name for type. We might haven't resolved it */ if (TREE_CODE (type) == TREE_LIST) type_name = IDENTIFIER_POINTER (TYPE_NAME (TREE_PURPOSE (type))); else type_name = lang_printable_name (type, 0); parse_error_context (context, "Variable `%s' is already defined in this method and " "was declared `%s %s' at line %d", IDENTIFIER_POINTER (name), type_name, IDENTIFIER_POINTER (name), line); } static tree build_array_from_name (type, type_wfl, name, ret_name) tree type, type_wfl, name, *ret_name; { int more_dims = 0; char *string; /* Eventually get more dims */ string = IDENTIFIER_POINTER (name); while (string [more_dims] == '[') more_dims++; /* If we have, then craft a new type for this variable */ if (more_dims) { name = get_identifier (&more_dims [string]); /* If type already is a reference on an array, get the base type */ if ((TREE_CODE (type) == POINTER_TYPE) && TYPE_ARRAY_P (TREE_TYPE (type))) type = TREE_TYPE (type); /* Building the first dimension of a primitive type uses this function */ if (JPRIMITIVE_TYPE_P (type)) { type = build_java_array_type (type, -1); CLASS_LOADED_P (type) = 1; more_dims--; } /* Otherwise, if we have a WFL for this type, use it (the type is already an array on an unresolved type, and we just keep on adding dimensions) */ else if (type_wfl) type = type_wfl; /* Add all the dimensions */ while (more_dims--) type = build_unresolved_array_type (type); /* The type may have been incomplete in the first place */ if (type_wfl) type = obtain_incomplete_type (type); } *ret_name = name; return type; } /* Build something that the type identifier resolver will identify as being an array to an unresolved type. TYPE_WFL is a WFL on a identifier. */ static tree build_unresolved_array_type (type_or_wfl) tree type_or_wfl; { char *ptr; /* TYPE_OR_WFL might be an array on a primitive type. In this case, just create a array type */ if (TREE_CODE (type_or_wfl) == RECORD_TYPE) { tree type = build_java_array_type (type_or_wfl, -1); CLASS_LOADED_P (type) = CLASS_LOADED_P (type_or_wfl); return type; } obstack_1grow (&temporary_obstack, '['); obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)), IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl))); ptr = obstack_finish (&temporary_obstack); return build_expr_wfl (get_identifier (ptr), EXPR_WFL_FILENAME (type_or_wfl), EXPR_WFL_LINENO (type_or_wfl), EXPR_WFL_COLNO (type_or_wfl)); } /* Check modifiers. If one doesn't fit, retrieve it in its declaration line and point it out. */ static void check_modifiers (message, value, mask) char *message; int value; int mask; { /* Should point out the one that don't fit. ASCII/unicode, going backward. FIXME */ if (value & ~mask) { int i, remainder = value & ~mask; for (i = 0; i <= 10; i++) if ((1 << i) & remainder) parse_error_context (ctxp->modifier_ctx [i], message, java_accstring_lookup (1 << i)); } } static void parser_add_interface (class_decl, interface_decl, wfl) tree class_decl, interface_decl, wfl; { if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl))) parse_error_context (wfl, "Interface `%s' repeated", IDENTIFIER_POINTER (DECL_NAME (interface_decl))); } /* Bulk of common class/interface checks. Return 1 if an error was encountered. TAG is 0 for a class, 1 for an interface. */ static int check_class_interface_creation (is_interface, flags, raw_name, qualified_name, decl, cl) int is_interface, flags; tree raw_name, qualified_name, decl, cl; { tree node; if (!quiet_flag) fprintf (stderr, " %s %s", (is_interface ? "interface" : "class"), IDENTIFIER_POINTER (qualified_name)); /* Scope of an interface/class type name: - Can't be imported by a single type import - Can't already exists in the package */ if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name) && (node = find_name_in_single_imports (raw_name))) { parse_error_context (cl, "%s name `%s' clashes with imported type `%s'", (is_interface ? "Interface" : "Class"), IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node)); return 1; } if (decl && CLASS_COMPLETE_P (decl)) { classitf_redefinition_error ((is_interface ? "Interface" : "Class"), qualified_name, decl, cl); return 1; } /* If public, file name should match class/interface name */ if (flags & ACC_PUBLIC) { char *f; /* Contains OS dependent assumption on path separator. FIXME */ for (f = &input_filename [strlen (input_filename)]; f != input_filename && f[0] != '/'; f--); if (f[0] == '/') f++; if (strncmp (IDENTIFIER_POINTER (raw_name), f , IDENTIFIER_LENGTH (raw_name)) || f [IDENTIFIER_LENGTH (raw_name)] != '.') parse_error_context (cl, "Public %s `%s' must be defined in a file " "called `%s.java'", (is_interface ? "interface" : "class"), IDENTIFIER_POINTER (qualified_name), IDENTIFIER_POINTER (raw_name)); } check_modifiers ((is_interface ? "Illegal modifier `%s' for interface declaration" : "Illegal modifier `%s' for class declaration"), flags, (is_interface ? INTERFACE_MODIFIERS : CLASS_MODIFIERS)); return 0; } /* If DECL is NULL, create and push a new DECL, record the current line CL and do other maintenance things. */ static tree maybe_create_class_interface_decl (decl, qualified_name, cl) tree decl, qualified_name, cl; { if (!decl) decl = push_class (make_class (), qualified_name); /* Take care of the file and line business */ DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl); DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl); CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1; CLASS_FROM_CURRENTLY_COMPILED_SOURCE_P (TREE_TYPE (decl)) = IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl)); ctxp->current_parsed_class = decl; /* Link the declaration to the already seen ones */ TREE_CHAIN (decl) = ctxp->class_list; ctxp->class_list = decl; /* Create a new node in the global list */ ctxp->gclass_list = tree_cons (NULL_TREE, decl, ctxp->gclass_list); /* Install a new dependency list element */ create_jdep_list (ctxp); SOURCE_FRONTEND_DEBUG (("Defining class/interface %s", IDENTIFIER_POINTER (qualified_name))); return decl; } static void add_superinterfaces (decl, interface_list) tree decl, interface_list; { tree node; /* Superinterface(s): if present and defined, parser_check_super_interface () takes care of ensuring that: - This is an accessible interface type, - Circularity detection. parser_add_interface is then called. If present but not defined, the check operation is delayed until the super interface gets defined. */ for (node = interface_list; node; node = TREE_CHAIN (node)) { tree current = TREE_PURPOSE (node); tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current)); if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl))) { if (!parser_check_super_interface (idecl, decl, current)) parser_add_interface (decl, idecl, current); } else register_incomplete_type (JDEP_INTERFACE, current, decl, NULL_TREE); } } /* Create an interface in pass1 and return its decl. Return the interface's decl in pass 2. */ static tree create_interface (flags, id, super) int flags; tree id, super; { tree raw_name = EXPR_WFL_NODE (id); tree q_name = parser_qualified_classname (id); tree decl = IDENTIFIER_CLASS_VALUE (q_name); EXPR_WFL_NODE (id) = q_name; /* Keep source location, even if refined. */ /* Basic checks: scope, redefinition, modifiers */ if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id)) return NULL_TREE; /* Interface modifiers check - public/abstract allowed (already done at that point) - abstract is obsolete (comes first, it's a warning, or should be) - Can't use twice the same (checked in the modifier rule) */ if (flags & ACC_ABSTRACT) parse_warning_context (MODIFIER_WFL (ABSTRACT_TK), "Obsolete use of `abstract' modifier. Interface `%s' is implicitely " "abstract", IDENTIFIER_POINTER (raw_name)); if (flags & ACC_PUBLIC && flags & ACC_ABSTRACT) parse_error_context (MODIFIER_WFL (ABSTRACT_TK), "Can't specify both `public' and `abstract' modifiers in the " "definition of interface `%s'", IDENTIFIER_POINTER (raw_name)); /* Create a new decl if DECL is NULL, otherwise fix it */ decl = maybe_create_class_interface_decl (decl, q_name, id); /* Set super info and mark the class a complete */ set_super_info (ACC_ABSTRACT | ACC_INTERFACE | flags, TREE_TYPE (decl), object_type_node, ctxp->interface_number); ctxp->interface_number = 0; CLASS_COMPLETE_P (decl) = 1; add_superinterfaces (decl, super); return decl; } /* Create an class in pass1 and return its decl. Return class interface's decl in pass 2. */ static tree create_class (flags, id, super, interfaces) int flags; tree id, super, interfaces; { tree raw_name = EXPR_WFL_NODE (id); tree class_id, decl; tree super_decl = NULL, super_decl_type; class_id = parser_qualified_classname (id); decl = IDENTIFIER_CLASS_VALUE (class_id); ctxp->current_parsed_class_un = EXPR_WFL_NODE (id); EXPR_WFL_NODE (id) = class_id; /* Basic check: scope, redefinition, modifiers */ if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id)) return NULL_TREE; /* Class modifier check: - Allowed modifier (already done at that point) - abstract AND final forbidden - Public classes defined in the correct file */ if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL)) parse_error_context (id, "Class `%s' can't be declared both abstract " "and final", IDENTIFIER_POINTER (raw_name)); /* Create a new decl if DECL is NULL, otherwise fix it */ decl = maybe_create_class_interface_decl (decl, class_id, id); /* If SUPER exists, use it, otherwise use Object */ if (super) { /* Can't extend java.lang.Object */ if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node) { parse_error_context (id, "Can't extend `java.lang.Object'"); return NULL_TREE; } /* The class is known and exists if there is a decl. Otherwise, postpone the operation and do it later. */ super_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (super)); if (super_decl) { parser_check_super (super_decl, decl, id); super_decl_type = TREE_TYPE (super_decl); } else super_decl_type = register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE); } else if (TREE_TYPE (decl) != object_type_node) super_decl_type = object_type_node; /* We're defining java.lang.Object */ else super_decl_type = NULL_TREE; /* Set super info and mark the class a complete */ set_super_info (flags, TREE_TYPE (decl), super_decl_type, ctxp->interface_number); ctxp->interface_number = 0; CLASS_COMPLETE_P (decl) = 1; add_superinterfaces (decl, interfaces); /* Eventually sets the @deprecated tag flag */ CHECK_DEPRECATED (decl); return decl; } /* Can't use lookup_field () since we don't want to load the class and can't set the CLASS_LOADED_P flag */ static tree find_field (class, name) tree class; tree name; { tree decl; for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl)) { if (DECL_NAME (decl) == name) return decl; } return NULL_TREE; } /* Wrap around lookup_field that doesn't potentially upset the value of CLASS */ static tree lookup_field_wrapper (class, name) tree class, name; { tree type = class; return lookup_field (&type, name); } /* Find duplicate field within the same class declarations and report the error. Returns 1 if a duplicated field was found, 0 otherwise. */ static int duplicate_declaration_error_p (new_field_name, new_type, cl) tree new_field_name, new_type, cl; { /* This might be modified to work with method decl as well */ tree decl = find_field (TREE_TYPE (ctxp->current_parsed_class), new_field_name); if (decl) { char *t1 = strdup (lang_printable_name (new_type, 1)); char *t2 = strdup ((TREE_CODE (TREE_TYPE (decl)) == TREE_LIST ? IDENTIFIER_POINTER (TYPE_NAME (TREE_PURPOSE (TREE_TYPE (decl)))) : lang_printable_name (TREE_TYPE (decl), 1))); parse_error_context (cl , "Duplicate variable declaration: `%s %s' was `%s %s' (%s:%d)", t1, IDENTIFIER_POINTER (new_field_name), t2, IDENTIFIER_POINTER (DECL_NAME (decl)), DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl)); free (t1); free (t2); return 1; } return 0; } /* Field registration routine. If TYPE doesn't exist, field declarations are linked to the undefined TYPE dependency list, to be later resolved in java_complete_class () */ static void register_fields (flags, type, variable_list) int flags; tree type, variable_list; { tree current, saved_type; tree class_type = TREE_TYPE (ctxp->current_parsed_class); int saved_lineno = lineno; int must_chain = 0; tree wfl = NULL_TREE; /* If we're adding fields to interfaces, those fields are public, static, final */ if (CLASS_INTERFACE (TYPE_NAME (class_type))) { OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK), flags, ACC_PUBLIC, "%s", "interface field(s)"); OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK), flags, ACC_STATIC, "%s", "interface field(s)"); OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK), flags, ACC_FINAL, "%s", "interface field(s)"); check_modifiers ("Illegal interface member modifier `%s'", flags, INTERFACE_FIELD_MODIFIERS); flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL); } /* Obtain a suitable type for resolution, if necessary */ SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain); /* If TYPE is fully resolved and we don't have a reference, make one */ if (!must_chain && TREE_CODE (type) == RECORD_TYPE) type = promote_type (type); for (current = variable_list, saved_type = type; current; current = TREE_CHAIN (current), type = saved_type) { tree field_decl; tree cl = TREE_PURPOSE (current); tree init = TREE_VALUE (current); tree current_name = EXPR_WFL_NODE (cl); /* Process NAME, as it may specify extra dimension(s) for it */ type = build_array_from_name (type, wfl, current_name, ¤t_name); /* Check for redeclarations */ if (duplicate_declaration_error_p (current_name, type, cl)) continue; /* Type adjustment. We may have just readjusted TYPE because the variable specified more dimensions. Make sure we have a reference if we can and don't have one already. Also change the name if we have an init. */ if (type != saved_type) { if (!must_chain && (TREE_CODE (type) == RECORD_TYPE)) type = promote_type (type); if (init) EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name; } /* Set lineno to the line the field was found and create a declaration for it. Eventually sets the @deprecated tag flag. */ lineno = EXPR_WFL_LINENO (cl); field_decl = add_field (class_type, current_name, type, flags); CHECK_DEPRECATED (field_decl); /* Check if we must chain. */ if (must_chain) register_incomplete_type (JDEP_FIELD, wfl, field_decl, type); /* Default value of a static field is 0 and it is considered initialized. */ if (flags & ACC_STATIC) INITIALIZED_P (field_decl) = 1; /* If we have an initialization value tied to the field */ if (init) { /* The field is declared static */ if (flags & ACC_STATIC) { if (flags & ACC_FINAL) { if (DECL_LANG_SPECIFIC (field_decl) == NULL) DECL_LANG_SPECIFIC (field_decl) = (struct lang_decl *) permalloc (sizeof (struct lang_decl_var)); DECL_LOCAL_STATIC_VALUE (field_decl) = TREE_OPERAND (init, 1); } /* Otherwise, the field should be initialized in . This field is remembered so we can generate later */ else { INITIALIZED_P (field_decl) = 1; TREE_CHAIN (init) = ctxp->static_initialized; ctxp->static_initialized = init; } } /* A non-static field declared with an immediate initialization is to be initialized in , if any. This field is remembered to be processed at the time of the generation of . */ else { INITIALIZED_P (field_decl) = 1; TREE_CHAIN (init) = ctxp->non_static_initialized; ctxp->non_static_initialized = init; } } } lineno = saved_lineno; } /* Generate the method that initializes fields initialized upon declaration. */ static void maybe_generate_finit () { tree mdecl, current; if (!ctxp->non_static_initialized || java_error_count) return; mdecl = create_artificial_method (TREE_TYPE (ctxp->current_parsed_class), ACC_PRIVATE|ACC_FINAL, void_type_node, finit_identifier_node, NULL_TREE); start_artificial_method_body (mdecl); ctxp->non_static_initialized = nreverse (ctxp->non_static_initialized); for (current = ctxp->non_static_initialized; current; current = TREE_CHAIN (current)) java_method_add_stmt (mdecl, build_debugable_stmt (EXPR_WFL_LINECOL (current), current)); end_artificial_method_body (mdecl); CLASS_HAS_FINIT_P (TREE_TYPE (ctxp->current_parsed_class)) = 1; ctxp->non_static_initialized = NULL_TREE; } /* Check whether it is necessary to generate a for the class we just parsed. */ static void maybe_generate_clinit () { tree mdecl, c; if (!ctxp->static_initialized || java_error_count) return; mdecl = create_artificial_method (TREE_TYPE (ctxp->current_parsed_class), ACC_STATIC, void_type_node, clinit_identifier_node, NULL_TREE); start_artificial_method_body (mdecl); /* Keep initialization in order to enforce 8.5 */ ctxp->static_initialized = nreverse (ctxp->static_initialized); /* We process the list of assignment we produced as the result of the declaration of initialized static field and add them as statement to the method. */ for (c = ctxp->static_initialized; c; c = TREE_CHAIN (c)) { /* We build the assignment expression that will initialize the field to its value. There are strict rules on static initializers (8.5). FIXME */ java_method_add_stmt (mdecl, build_debugable_stmt (EXPR_WFL_LINECOL (c), c)); } end_artificial_method_body (mdecl); ctxp->static_initialized = NULL_TREE; } /* Shared accros method_declarator and method_header to remember the patch stage that was reached during the declaration of the method. A method DECL is built differently is there is no patch (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN) pending on the currently defined method. */ static int patch_stage; /* Check the method declaration and add the method to its current class. If the argument list is known to contain incomplete types, the method is partially added and the registration will be resume once the method arguments resolved. If TYPE is NULL, we're dealing with a constructor. */ static tree method_header (flags, type, mdecl, throws) int flags; tree type, mdecl, throws; { tree meth = TREE_VALUE (mdecl); tree id = TREE_PURPOSE (mdecl); tree this_class = TREE_TYPE (ctxp->current_parsed_class); tree meth_name, returned_type, current, orig_arg; int saved_lineno; int constructor_ok = 0; check_modifiers_consistency (flags); /* There are some forbidden modifiers for an abstract method and its class must be abstract as well. */ if (type && (flags & ACC_ABSTRACT)) { ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private"); ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static"); ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final"); ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native"); ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED,id, "Synchronized"); if (!CLASS_ABSTRACT (TYPE_NAME (this_class))) parse_error_context (id, "Class `%s' must be declared abstract to define abstract " "method `%s'", IDENTIFIER_POINTER (DECL_NAME (ctxp->current_parsed_class)), IDENTIFIER_POINTER (EXPR_WFL_NODE (id))); } /* Things to be checked when declaring a constructor */ if (!type) { int ec = java_error_count; /* 8.6: Constructor declarations: we might be trying to define a method without specifying a return type. */ if (EXPR_WFL_NODE (id) != ctxp->current_parsed_class_un) parse_error_context (id, "Invalid method declaration, return type required"); /* 8.6.3: Constructor modifiers */ else { JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract"); JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static"); JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final"); JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native"); JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized"); } /* If we found error here, we don't consider it's OK to tread the method definition as a constructor, for the rest of this function */ if (ec == java_error_count) constructor_ok = 1; } /* Method declared within the scope of an interface are implicitly abstract and public. Conflicts with other erroneously provided modifiers are check right after. */ if (CLASS_INTERFACE (TYPE_NAME (this_class))) { /* If FLAGS isn't set because of a modifier, turn the corresponding modifier WFL to NULL so we issue a warning on the obsolete use of the modifier */ if (!(flags & ACC_PUBLIC)) MODIFIER_WFL (PUBLIC_TK) = NULL; if (!(flags & ACC_ABSTRACT)) MODIFIER_WFL (ABSTRACT_TK) = NULL; flags |= ACC_PUBLIC; flags |= ACC_ABSTRACT; } /* Modifiers context reset moved up, so abstract method declaration modifiers can be later checked. */ /* Set constructor returned type to void and method name to , unless we found an error identifier the constructor (in which case we retain the original name) */ if (!type) { type = void_type_node; if (constructor_ok) meth_name = init_identifier_node; } else meth_name = EXPR_WFL_NODE (id); if (unresolved_type_p (type, &returned_type)) { if (returned_type) TREE_TYPE (meth) = returned_type; else { patch_stage = JDEP_METHOD_RETURN; TREE_TYPE (meth) = register_incomplete_type (patch_stage, type, id, NULL_TREE); } } else { if (TREE_CODE (type) == RECORD_TYPE) type = promote_type (type); TREE_TYPE (meth) = type; } saved_lineno = lineno; /* When defining an abstract or interface method, the curly bracket at level 1 doesn't exist because there is no function body */ lineno = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 : EXPR_WFL_LINENO (id)); /* Remember the original argument list */ orig_arg = TYPE_ARG_TYPES (meth); if (patch_stage) /* includes ret type and/or all args */ { jdep *jdep; meth = add_method_1 (this_class, flags, meth_name, meth); /* Patch for the return type */ if (patch_stage == JDEP_METHOD_RETURN) { jdep = CLASSD_LAST (ctxp->classd_list); JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth)); } /* This is the stop JDEP. METH allows the function's signature to be computed. */ register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE); } else meth = add_method (this_class, flags, meth_name, build_java_signature (meth)); /* Fix the method argument list so we have the argument name information */ fix_method_argument_names (orig_arg, meth); /* Register the parameter number and re-install the current line number */ DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1; lineno = saved_lineno; /* Register exception specified by the `throws' keyword for resolution and set the method decl appropriate field to the list. Note: the grammar ensures that what we get here are class types. */ if (throws) { throws = nreverse (throws); for (current = throws; current; current = TREE_CHAIN (current)) { register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current), NULL_TREE, NULL_TREE); JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) = &TREE_VALUE (current); } DECL_FUNCTION_THROWS (meth) = throws; } /* We set the DECL_NAME to ID so we can track the location where the function was declared. This allow us to report redefinition error accurately. When method are verified, DECL_NAME is reinstalled properly (using the content of the WFL node ID) (see check_method_redefinition). We don't do that when Object is being defined. Constructor names will be reinstalled the same way. */ if (TREE_TYPE (ctxp->current_parsed_class) != object_type_node) DECL_NAME (meth) = id; /* Set the flag if we correctly processed a constructor */ if (constructor_ok) DECL_CONSTRUCTOR_P (meth) = 1; /* Eventually set the @deprecated tag flag */ CHECK_DEPRECATED (meth); return meth; } static void fix_method_argument_names (orig_arg, meth) tree orig_arg, meth; { tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth)); if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE) { TREE_PURPOSE (arg) = this_identifier_node; arg = TREE_CHAIN (arg); } while (orig_arg) { TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg); orig_arg = TREE_CHAIN (orig_arg); arg = TREE_CHAIN (arg); } } /* Complete the method declaration with METHOD_BODY. */ static void complete_method_declaration (method_body) tree method_body; { BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body; maybe_absorb_scoping_blocks (); /* Exit function's body */ exit_block (); /* Merge last line of the function with first line, directly in the function decl. It will be used to emit correct debug info. */ DECL_SOURCE_LINE_MERGE (current_function_decl, ctxp->last_ccb_indent1); } /* Build a an error message for constructor circularity errors. */ static char * constructor_circularity_msg (from, to) tree from, to; { static char string [4096]; char *t = strdup (lang_printable_name (from, 0)); sprintf (string, "`%s' invokes `%s'", t, lang_printable_name (to, 0)); free (t); return string; } /* Verify a circular call to METH. Return 1 if an error is found, 0 otherwise. */ static int verify_constructor_circularity (meth, current) tree meth, current; { static tree list = NULL_TREE; tree c; for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c)) { if (TREE_VALUE (c) == meth) { char *t; if (list) { tree liste; list = nreverse (list); for (liste = list; liste; liste = TREE_CHAIN (liste)) { parse_error_context (TREE_PURPOSE (TREE_PURPOSE (liste)), constructor_circularity_msg (TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste)))); java_error_count--; } } t = strdup (lang_printable_name (meth, 0)); parse_error_context (TREE_PURPOSE (c), "%s: recursive invocation of constructor `%s'", constructor_circularity_msg (current, meth), t); free (t); list = NULL_TREE; return 1; } } for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c)) { list = tree_cons (c, current, list); if (verify_constructor_circularity (meth, TREE_VALUE (c))) return 1; list = TREE_CHAIN (list); } return 0; } /* Check modifiers that can be declared but exclusively */ static void check_modifiers_consistency (flags) int flags; { int acc_count = 0; tree cl = NULL_TREE; THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, 0, acc_count, cl); THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, 1, acc_count, cl); THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, 2, acc_count, cl); if (acc_count > 1) parse_error_context (cl, "Inconsistent member declaration. At most one of `public', " "`private', or `protected' may be specified"); } /* Check the methode header METH for abstract specifics features */ static void check_abstract_method_header (meth) tree meth; { int flags = get_access_flags_from_decl (meth); /* DECL_NAME might still be a WFL node */ tree name = (TREE_CODE (DECL_NAME (meth)) == EXPR_WITH_FILE_LOCATION ? EXPR_WFL_NODE (DECL_NAME (meth)) : DECL_NAME (meth)); OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (ABSTRACT_TK), flags, ACC_ABSTRACT, "abstract method `%s'", IDENTIFIER_POINTER (name)); OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK), flags, ACC_PUBLIC, "abstract method `%s'", IDENTIFIER_POINTER (name)); check_modifiers ("Illegal modifier `%s' for interface method", flags, INTERFACE_METHOD_MODIFIERS); } /* Create a FUNCTION_TYPE node and start augmenting it with the declared function arguments. Arguments type that can't be resolved are left as they are, but the returned node is marked as containing incomplete types. */ static tree method_declarator (id, list) tree id, list; { tree arg_types = NULL_TREE, current, node; tree meth = make_node (FUNCTION_TYPE); jdep *jdep; patch_stage = JDEP_NO_PATCH; for (current = list; current; current = TREE_CHAIN (current)) { int must_chain = 0; tree wfl_name = TREE_PURPOSE (current); tree type = TREE_VALUE (current); tree name = EXPR_WFL_NODE (wfl_name); tree already, arg_node; tree type_wfl = NULL_TREE; /* Obtain a suitable type for resolution, if necessary */ SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain); /* Process NAME, as it may specify extra dimension(s) for it */ type = build_array_from_name (type, type_wfl, name, &name); EXPR_WFL_NODE (wfl_name) = name; if (TREE_CODE (type) == RECORD_TYPE) type = promote_type (type); /* Check redefinition */ for (already = arg_types; already; already = TREE_CHAIN (already)) if (TREE_PURPOSE (already) == name) { parse_error_context (wfl_name, "Variable `%s' is used more than once in the " "argument list of method `%s'", IDENTIFIER_POINTER (name), IDENTIFIER_POINTER (EXPR_WFL_NODE (id))); break; } /* If we've an incomplete argument type, we know there is a location to patch when the type get resolved, later. */ jdep = NULL; if (must_chain) { patch_stage = JDEP_METHOD; type = register_incomplete_type (patch_stage, type_wfl, wfl_name, type); jdep = CLASSD_LAST (ctxp->classd_list); JDEP_MISC (jdep) = id; } /* The argument node: a name and a (possibly) incomplete type */ arg_node = build_tree_list (name, type); if (jdep) JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node); TREE_CHAIN (arg_node) = arg_types; arg_types = arg_node; } TYPE_ARG_TYPES (meth) = nreverse (arg_types); node = build_tree_list (id, meth); return node; } static int unresolved_type_p (wfl, returned) tree wfl; tree *returned; { if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION) { tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl)); if (returned) *returned = (decl ? TREE_TYPE (decl) : NULL_TREE); return 1; } if (returned) *returned = wfl; return 0; } /* From NAME, build a qualified identifier node using the qualification from the current package definition. */ static tree parser_qualified_classname (name) tree name; { if (ctxp->package) return merge_qualified_name (ctxp->package, EXPR_WFL_NODE (name)); else return EXPR_WFL_NODE (name); } /* Called once the type a interface extends is resolved. Returns 0 if everything is OK. */ static int parser_check_super_interface (super_decl, this_decl, this_wfl) tree super_decl, this_decl, this_wfl; { tree super_type = TREE_TYPE (super_decl); /* Has to be an interface */ if (!CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (super_decl)))) { parse_error_context (this_wfl, "Can't use %s `%s' to implement/extend %s `%s'", (TYPE_ARRAY_P (super_type) ? "array" : "class"), IDENTIFIER_POINTER (DECL_NAME (super_decl)), (CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ? "interface" : "class"), IDENTIFIER_POINTER (DECL_NAME (this_decl))); return 1; } /* Check scope: same package OK, other package: OK if public */ if (check_pkg_class_access (DECL_NAME (super_decl), lookup_cl (this_decl))) return 1; SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s", IDENTIFIER_POINTER (DECL_NAME (this_decl)), IDENTIFIER_POINTER (DECL_NAME (super_decl)))); return 0; } /* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns 0 if everthing is OK. */ static int parser_check_super (super_decl, this_decl, wfl) tree super_decl, this_decl, wfl; { tree super_type = TREE_TYPE (super_decl); /* SUPER should be a CLASS (neither an array nor an interface) */ if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type))) { parse_error_context (wfl, "Class `%s' can't subclass %s `%s'", IDENTIFIER_POINTER (DECL_NAME (this_decl)), (CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"), IDENTIFIER_POINTER (DECL_NAME (super_decl))); return 1; } if (CLASS_FINAL (TYPE_NAME (super_type))) { parse_error_context (wfl, "Can't subclass final classes: %s", IDENTIFIER_POINTER (DECL_NAME (super_decl))); return 1; } /* Check scope: same package OK, other package: OK if public */ if (check_pkg_class_access (DECL_NAME (super_decl), wfl)) return 1; SOURCE_FRONTEND_DEBUG (("Completing class %s with %s", IDENTIFIER_POINTER (DECL_NAME (this_decl)), IDENTIFIER_POINTER (DECL_NAME (super_decl)))); return 0; } /* Create a new dependency list and link it (in a LIFO manner) to the CTXP list of type dependency list. */ static void create_jdep_list (ctxp) struct parser_ctxt *ctxp; { jdeplist *new = malloc (sizeof (jdeplist)); if (!new) fatal ("Can't alloc jdeplist - create_jdep_list"); new->first = new->last = NULL; new->next = ctxp->classd_list; ctxp->classd_list = new; } static jdeplist * reverse_jdep_list (ctxp) struct parser_ctxt *ctxp; { register jdeplist *prev = NULL, *current, *next; for (current = ctxp->classd_list; current; current = next) { next = current->next; current->next = prev; prev = current; } return prev; } /* Create a fake pointer based on the ID stored in the WFL */ static tree obtain_incomplete_type (wfl) tree wfl; { tree ptr; tree name = EXPR_WFL_NODE (wfl); for (ptr = ctxp->incomplete_class; ptr; ptr = TREE_CHAIN (ptr)) if (TYPE_NAME (TREE_PURPOSE (ptr)) == name) break; if (!ptr) { tree core; push_obstacks (&permanent_obstack, &permanent_obstack); BUILD_PTR_FROM_NAME (core, name); ptr = build_tree_list (core, NULL_TREE); pop_obstacks (); TREE_CHAIN (ptr) = ctxp->incomplete_class; ctxp->incomplete_class = ptr; } return ptr; } /* Register a incomplete type whose name is WFL. Reuse PTR if PTR is non NULL instead of computing a new fake type based on WFL. The new dependency is inserted in the current type dependency list, in FIFO manner. */ static tree register_incomplete_type (kind, wfl, decl, ptr) int kind; tree wfl, decl, ptr; { jdep *new = malloc (sizeof (jdep)); if (!new) fatal ("Can't allocate new jdep - register_incomplete_type"); if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */ ptr = obtain_incomplete_type (wfl); JDEP_KIND (new) = kind; JDEP_DECL (new) = decl; JDEP_SOLV (new) = ptr; JDEP_WFL (new) = wfl; JDEP_CHAIN (new) = NULL; JDEP_MISC (new) = NULL_TREE; JDEP_GET_PATCH (new) = (tree *)NULL; JDEP_INSERT (ctxp->classd_list, new); return ptr; } void java_check_circular_reference () { tree current; for (current = ctxp->class_list; current; current = TREE_CHAIN (current)) { tree type = TREE_TYPE (current); if (CLASS_INTERFACE (TYPE_NAME (type))) { /* Check all interfaces this class extends */ tree basetype_vec = TYPE_BINFO_BASETYPES (type); int n, i; if (!basetype_vec) return; n = TREE_VEC_LENGTH (basetype_vec); for (i = 0; i < n; i++) { tree vec_elt = TREE_VEC_ELT (basetype_vec, i); if (vec_elt && BINFO_TYPE (vec_elt) != object_type_node && interface_of_p (type, BINFO_TYPE (vec_elt))) parse_error_context (lookup_cl (current), "Cyclic interface inheritance"); } } else if (inherits_from_p (CLASSTYPE_SUPER (type), type)) parse_error_context (lookup_cl (current), "Cyclic class inheritance"); } } void safe_layout_class (class) tree class; { tree save_current_class = current_class; char *save_input_filename = input_filename; int save_lineno = lineno; push_obstacks (&permanent_obstack, &permanent_obstack); if (!CLASS_METHOD_CHECKED_P (class)) CHECK_METHODS (TYPE_NAME (class)); CLASS_METHOD_CHECKED_P (class) = 1; layout_class (class); pop_obstacks (); current_class = save_current_class; input_filename = save_input_filename; lineno = save_lineno; CLASS_LOADED_P (class) = 1; } static tree jdep_resolve_class (dep) jdep *dep; { tree decl; if (!JDEP_RESOLVED_P (dep)) { decl = resolve_class (JDEP_TO_RESOLVE (dep), JDEP_DECL (dep), JDEP_WFL (dep)); JDEP_RESOLVED (dep, decl); } else decl = JDEP_RESOLVED_DECL (dep); if (!decl) { complete_class_report_errors (dep); return NULL_TREE; } return decl; } /* Complete unsatisfied class declaration and their dependencies */ void java_complete_class () { tree cclass; jdeplist *cclassd; int error_found; tree type; push_obstacks (&permanent_obstack, &permanent_obstack); /* Process imports and reverse the import on demand list */ process_imports (); if (ctxp->import_demand_list) ctxp->import_demand_list = nreverse (ctxp->import_demand_list); /* Rever things so we have the right order */ ctxp->class_list = nreverse (ctxp->class_list); ctxp->classd_list = reverse_jdep_list (ctxp); for (cclassd = ctxp->classd_list, cclass = ctxp->class_list; cclass && cclassd; cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd)) { jdep *dep; for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep)) { tree decl; if (!(decl = jdep_resolve_class (dep))) continue; /* Now it's time to patch */ switch (JDEP_KIND (dep)) { case JDEP_SUPER: /* Simply patch super */ if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep))) continue; BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO (TREE_TYPE (JDEP_DECL (dep)))), 0)) = TREE_TYPE (decl); break; case JDEP_FIELD: { /* We do part of the job done in add_field */ tree field_decl = JDEP_DECL (dep); tree field_type = TREE_TYPE (decl); push_obstacks (&permanent_obstack, &permanent_obstack); if (TREE_CODE (field_type) == RECORD_TYPE) field_type = promote_type (field_type); pop_obstacks (); TREE_TYPE (field_decl) = field_type; DECL_ALIGN (field_decl) = 0; layout_decl (field_decl, 0); SOURCE_FRONTEND_DEBUG (("Completed field/var decl `%s' with `%s'", IDENTIFIER_POINTER (DECL_NAME (field_decl)), IDENTIFIER_POINTER (DECL_NAME (decl)))); break; } case JDEP_METHOD: /* We start patching a method */ case JDEP_METHOD_RETURN: error_found = 0; while (1) { if (decl) { type = TREE_TYPE(decl); if (TREE_CODE (type) == RECORD_TYPE) type = promote_type (type); JDEP_APPLY_PATCH (dep, type); SOURCE_FRONTEND_DEBUG (((JDEP_KIND (dep) == JDEP_METHOD_RETURN ? "Completing fct `%s' with ret type `%s'": "Completing arg `%s' with type `%s'"), IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))), IDENTIFIER_POINTER (DECL_NAME (decl)))); } else error_found = 1; dep = JDEP_CHAIN (dep); if (JDEP_KIND (dep) == JDEP_METHOD_END) break; else decl = jdep_resolve_class (dep); } if (!error_found) { tree mdecl = JDEP_DECL (dep), signature; push_obstacks (&permanent_obstack, &permanent_obstack); /* Recompute and reset the signature */ signature = build_java_signature (TREE_TYPE (mdecl)); set_java_signature (TREE_TYPE (mdecl), signature); pop_obstacks (); } else continue; break; case JDEP_INTERFACE: if (parser_check_super_interface (decl, JDEP_DECL (dep), JDEP_WFL (dep))) continue; parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep)); break; case JDEP_PARM: case JDEP_VARIABLE: type = TREE_TYPE(decl); if (TREE_CODE (type) == RECORD_TYPE) type = promote_type (type); JDEP_APPLY_PATCH (dep, type); break; case JDEP_TYPE: JDEP_APPLY_PATCH (dep, TREE_TYPE (decl)); SOURCE_FRONTEND_DEBUG (("Completing a random type dependency on a '%s' node", tree_code_name [TREE_CODE (JDEP_DECL (dep))])); break; case JDEP_EXCEPTION: /* Check for righteous inheritance here */ if (!inherits_from_p (TREE_TYPE (decl), throwable_type_node)) { parse_error_context (JDEP_WFL (dep), "Class `%s' in `throws' clause must be " "a subclass of class `java.lang.Throwable'", IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))); } else { JDEP_APPLY_PATCH (dep, TREE_TYPE (decl)); SOURCE_FRONTEND_DEBUG (("Completing `%s' `throws' argument node", IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))))); } break; default: fatal ("Can't handle patch code %d - java_complete_class", JDEP_KIND (dep)); } } } pop_obstacks (); return; } /* Resolve class CLASS_TYPE. Handle the case of trying to resolve an array. */ static tree resolve_class (class_type, decl, cl) tree class_type, decl, cl; { char *name = IDENTIFIER_POINTER (TYPE_NAME (class_type)); char *base = name; tree resolved_type, resolved_type_decl; /* 1- Check to see if we have an array. If true, find what we really want to resolve */ while (name[0] == '[') name++; if (base != name) TYPE_NAME (class_type) = get_identifier (name); /* 2- Resolve the bare type */ if (!(resolved_type_decl = do_resolve_class (class_type, decl, cl))) return NULL_TREE; resolved_type = TREE_TYPE (resolved_type_decl); /* 3- If we have and array, reconstruct the array down to its nesting */ if (base != name) { while (base != name) { if (TREE_CODE (resolved_type) == RECORD_TYPE) resolved_type = promote_type (resolved_type); resolved_type = build_java_array_type (resolved_type, -1); CLASS_LOADED_P (resolved_type) = 1; name--; } /* Build a fake decl for this, since this is what is expected to be returned. */ resolved_type_decl = build_decl (TYPE_DECL, TYPE_NAME (resolved_type), resolved_type); /* Figure how those two things are important for error report. FIXME */ DECL_SOURCE_LINE (resolved_type_decl) = 0; DECL_SOURCE_FILE (resolved_type_decl) = input_filename; } return resolved_type_decl; } /* Effectively perform the resolution of class CLASS_TYPE. DECL or CL are used to report error messages. */ static tree do_resolve_class (class_type, decl, cl) tree class_type; tree decl; tree cl; { tree new_class_decl; tree original_name = NULL_TREE; /* Do not try to replace TYPE_NAME (class_type) by a variable, since its is changed by find_in_imports{_on_demand} */ /* 1- Check for the type in single imports */ if (find_in_imports (class_type)) return NULL_TREE; /* 2- And check for the type in the current compilation unit. If it fails, try with a name qualified with the package name if appropriate. */ if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type)))) { if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)) && !CLASS_FROM_SOURCE_P (TREE_TYPE (new_class_decl))) load_class (TYPE_NAME (class_type), 0); return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type)); } original_name = TYPE_NAME (class_type); if (!QUALIFIED_P (TYPE_NAME (class_type)) && ctxp->package) TYPE_NAME (class_type) = merge_qualified_name (ctxp->package, TYPE_NAME (class_type)); if (!(new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type)))) load_class (TYPE_NAME (class_type), 0); if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type)))) { if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)) && !CLASS_FROM_SOURCE_P (TREE_TYPE (new_class_decl))) load_class (TYPE_NAME (class_type), 0); return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type)); } TYPE_NAME (class_type) = original_name; /* 3- Check an other compilation unit that bears the name of type */ load_class (TYPE_NAME (class_type), 0); if (check_pkg_class_access (TYPE_NAME (class_type), (cl ? cl : lookup_cl (decl)))) return NULL_TREE; if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type)))) return new_class_decl; /* 4- Check the import on demands. Don't allow bar.baz to be imported from foo.* */ if (!QUALIFIED_P (TYPE_NAME (class_type))) if (find_in_imports_on_demand (class_type)) return NULL_TREE; /* 5- Last call for a resolution */ return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type)); } /* Resolve NAME and lay it out (if not done and if not the current parsed class). Return a decl node. */ static tree resolve_and_layout (name, cl) tree name; tree cl; { tree decl = resolve_no_layout (name, cl); if (decl && TREE_TYPE (decl) != current_class && !CLASS_LOADED_P (TREE_TYPE (decl))) safe_layout_class (TREE_TYPE (decl)); return decl; } /* Resolve a class, returns its decl but doesn't perform any layout. The current parsing context is saved and restored */ static tree resolve_no_layout (name, cl) tree name, cl; { tree ptr, decl; BUILD_PTR_FROM_NAME (ptr, name); java_parser_context_save_global (); decl = resolve_class (ptr, NULL_TREE, cl); java_parser_context_restore_global (); return decl; } /* Called to report errors. Skip leader '[' in a complex array type description that failed to be resolved. */ static char * purify_type_name (name) char *name; { while (*name && *name == '[') name++; return name; } /* The type CURRENT refers to can't be found. We print error messages. */ static void complete_class_report_errors (dep) jdep *dep; { switch (JDEP_KIND (dep)) { case JDEP_SUPER: parse_error_context (JDEP_WFL (dep), "Superclass `%s' of class `%s' not found", IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))), IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep)))); break; case JDEP_FIELD: parse_error_context (JDEP_WFL (dep), "Type `%s' not found in declaration of field `%s'", IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))), IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep)))); break; case JDEP_METHOD: /* Covers arguments */ parse_error_context (JDEP_WFL (dep), "Type `%s' not found in the declaration of the " "argument `%s' of method `%s'", IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))), IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))), IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep)))); break; case JDEP_METHOD_RETURN: /* Covers return type */ parse_error_context (JDEP_WFL (dep), "Type `%s' not found in the declaration of the " "return type of method `%s'", IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))), IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep)))); break; case JDEP_INTERFACE: parse_error_context (JDEP_WFL (dep), "Superinterface `%s' of %s `%s' not found", IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))), (CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")), IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep)))); break; case JDEP_VARIABLE: parse_error_context (JDEP_WFL (dep), "Type `%s' not found in the declaration of the " "local variable `%s'", purify_type_name (IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))), IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep)))); break; case JDEP_EXCEPTION: /* As specified by `throws' */ parse_error_context (JDEP_WFL (dep), "Class `%s' not found in `throws'", IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))); break; default: /* Fix for -Wall. Just break doing nothing. The error will be caught later */ break; } } /* Check uninitialized final. */ void java_check_final () { } /* Return a static string containing the DECL prototype string. If DECL is a constructor, use the class name instead of the form */ static char * get_printable_method_name (decl) tree decl; { char *to_return; tree name; if (DECL_CONSTRUCTOR_P (decl)) { name = DECL_NAME (decl); DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl))); } to_return = lang_printable_name (decl, 0); if (DECL_CONSTRUCTOR_P (decl)) DECL_NAME (decl) = name; return to_return; } /* Reinstall the proper DECL_NAME on METHOD. Return 0 if the method nevertheless needs to be verfied, 1 otherwise. */ static int reset_method_name (method) tree method; { if (DECL_NAME (method) != clinit_identifier_node && DECL_NAME (method) != finit_identifier_node) { /* NAME is just the plain name when Object is being defined */ if (DECL_CONTEXT (method) != object_type_node) DECL_NAME (method) = (DECL_CONSTRUCTOR_P (method) ? init_identifier_node : (TREE_CODE (DECL_NAME (method)) == EXPR_WITH_FILE_LOCATION ? EXPR_WFL_NODE (DECL_NAME (method)) : DECL_NAME (method))); return 0; } else return 1; } /* Track method being redefined inside the same class. As a side effect, set DECL_NAME to an IDENTIFIER (prior entering this function it's a FWL, so we can track errors more accurately */ static int check_method_redefinition (class, method) tree class, method; { tree redef, name; tree cl = DECL_NAME (method); tree sig = TYPE_LANG_SPECIFIC (TREE_TYPE (method))->signature; /* decl name of artificial and doesn't need to be fixed and checked */ /* Reset the method name before running the check. If it returns 1, the method doesn't need to be verified with respect to method redeclaration and we return 0 */ if (reset_method_name (method)) return 0; name = DECL_NAME (method); for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef)) { struct lang_type *t = TYPE_LANG_SPECIFIC (TREE_TYPE (redef)); if (! t || (redef == method)) break; if (DECL_NAME (redef) == name && sig == t->signature) { parse_error_context (cl, "Duplicate %s declaration `%s'", (DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"), get_printable_method_name (redef)); return 1; } } return 0; } /* Check all the methods of CLASS. Methods are first completed then checked according to regular method existance rules. If no constructor were encountered, then build its declaration. */ static void java_check_regular_methods (class_decl) tree class_decl; { int saw_constructor = 0; tree method; tree class = CLASS_TO_HANDLE_TYPE (TREE_TYPE (class_decl)); tree super_class = CLASSTYPE_SUPER (class); tree saved_found_wfl = NULL_TREE, found = NULL_TREE; TYPE_METHODS (class) = nreverse (TYPE_METHODS (class)); /* Should take interfaces into account. FIXME */ for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method)) { tree sig; tree method_wfl = DECL_NAME (method); int aflags; /* If we previously found something and its name was saved, reinstall it now */ if (found && saved_found_wfl) DECL_NAME (found) = saved_found_wfl; /* Check for redefinitions */ if (check_method_redefinition (class, method)) continue; /* If we see one constructor a mark so we don't generate the default one. Also skip other verifications: constructors can't be inherited hence hiden or overriden */ if (DECL_CONSTRUCTOR_P (method)) { saw_constructor = 1; continue; } sig = build_java_argument_signature (TREE_TYPE (method)); found = lookup_argument_method (super_class, DECL_NAME (method), sig); /* Nothing overrides or it's a private method. */ if (!found || (found && METHOD_PRIVATE (found))) continue; /* If found wasn't verified, it's DECL_NAME won't be set properly. We set it temporarily for the sake of the error report. */ saved_found_wfl = DECL_NAME (found); reset_method_name (found); /* Can't override a method with the same name and different return types. */ if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method))) { char *t = strdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0)); parse_error_context (method_wfl, "Method `%s' was defined with return type `%s' in class `%s'", lang_printable_name (found, 0), t, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found))))); free (t); } /* Can't override final. Can't override static. */ if (METHOD_FINAL (found) || METHOD_STATIC (found)) { /* Static *can* override static */ if (METHOD_STATIC (found) && METHOD_STATIC (method)) continue; parse_error_context (method_wfl, "%s methods can't be overriden. Method `%s' is %s in class `%s'", (METHOD_FINAL (found) ? "Final" : "Static"), lang_printable_name (found, 0), (METHOD_FINAL (found) ? "final" : "static"), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found))))); continue; } /* Static method can't override instance method. */ if (METHOD_STATIC (method)) { parse_error_context (method_wfl, "Instance methods can't be overriden by a static method. Method " "`%s' is an instance method in class `%s'", lang_printable_name (found, 0), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found))))); continue; } aflags = get_access_flags_from_decl (found); /* - Overriding/hiding public must be public - Overriding/hiding protected must be protected or public - If the overriden or hidden method has default (package) access, then the overriding or hiding method must not be private; otherwise, a compile-time error occurs */ if ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method)) || (METHOD_PROTECTED (found) && !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method))) || (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC)) && METHOD_PRIVATE (method))) { parse_error_context (method_wfl, "Methods can't be overridden to be more private. Method `%s' is " "not %s in class `%s'", lang_printable_name (method, 0), (METHOD_PUBLIC (method) ? "public" : (METHOD_PRIVATE (method) ? "private" : "protected")), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found))))); continue; } /* Overriding methods must have compatible `throws' clauses on checked exceptions, if any */ check_throws_clauses (method, method_wfl, found); /* If the method has default access in an other package, then issue a warning that the current method doesn't override the one that was found elsewhere. Do not issue this warning when the match was found in java.lang.Object. */ if (DECL_CONTEXT (found) != object_type_node && (!aflags || (aflags > ACC_PROTECTED)) && !class_in_current_package (DECL_CONTEXT (found))) parse_warning_context (method_wfl, "Method `%s' in class `%s' does not " "override the corresponding method in class `%s', which is " "private to a different package", lang_printable_name (found, 0), IDENTIFIER_POINTER (DECL_NAME (class_decl)), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found))))); /* Inheriting multiple methods with the same signature. FIXME */ } /* Don't forget eventual pending found and saved_found_wfl. Take into account that we might have exited because we saw an aritifical method as the last entry. */ if (found && !DECL_ARTIFICIAL (found) && saved_found_wfl) DECL_NAME (found) = saved_found_wfl; TYPE_METHODS (class) = nreverse (TYPE_METHODS (class)); if (!saw_constructor) { /* No constructor seen, we craft one, at line 0 */ int flags; tree decl; /* If the class is declared PUBLIC, the default constructor is PUBLIC otherwise it has default access implied by no access modifiers. */ flags = (get_access_flags_from_decl (class_decl) & ACC_PUBLIC ? ACC_PUBLIC : 0); decl = create_artificial_method (class, flags, void_type_node, init_identifier_node, NULL_TREE); DECL_CONSTRUCTOR_P (decl) = 1; } } /* Return a non zero value if the `throws' clause of METHOD (if any) is incompatible with the `throws' clause of FOUND (if any). */ static void check_throws_clauses (method, method_wfl, found) tree method, method_wfl, found; { tree mthrows, fthrows; for (mthrows = DECL_FUNCTION_THROWS (method); mthrows; mthrows = TREE_CHAIN (mthrows)) { /* We don't verify unchecked expressions */ if (IS_UNCHECKED_EXPRESSION_P (TREE_VALUE (mthrows))) continue; /* Checked expression must be compatible */ for (fthrows = DECL_FUNCTION_THROWS (found); fthrows; fthrows = TREE_CHAIN (fthrows)) if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows))) break; if (!fthrows) { parse_error_context (method_wfl, "Invalid checked exception class `%s' in " "`throws' clause. The exception must be a subclass of an " "exception thrown by `%s' from class `%s'", IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))), lang_printable_name (found, 0), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found))))); } } } /* Check abstract method of interface INTERFACE */ static void java_check_abstract_methods (interface_decl) tree interface_decl; { int i, n; tree method, basetype_vec, found; tree interface = TREE_TYPE (interface_decl); for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method)) { tree method_wfl = DECL_NAME (method); /* 2- Check for double definition inside the defining interface */ if (check_method_redefinition (interface, method)) continue; /* 3- Overriding is OK as far as we preserve the return type and the thrown exceptions (FIXME) */ found = lookup_java_interface_method2 (interface, method); if (found) { char *t; tree saved_found_wfl = DECL_NAME (found); reset_method_name (found); t = strdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0)); parse_error_context (method_wfl, "Method `%s' was defined with return type `%s' in class `%s'", lang_printable_name (found, 0), t, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found))))); free (t); continue; DECL_NAME (found) = saved_found_wfl; } } /* 4- Inherited methods can't differ by their returned types */ if (!(basetype_vec = TYPE_BINFO_BASETYPES (interface))) return; n = TREE_VEC_LENGTH (basetype_vec); for (i = 0; i < n; i++) { tree sub_interface_method, sub_interface; tree vec_elt = TREE_VEC_ELT (basetype_vec, i); if (!vec_elt) continue; sub_interface = BINFO_TYPE (vec_elt); for (sub_interface_method = TYPE_METHODS (sub_interface); sub_interface_method; sub_interface_method = TREE_CHAIN (sub_interface_method)) { found = lookup_java_interface_method2 (interface, sub_interface_method); if (found && (found != sub_interface_method)) { tree saved_found_wfl = DECL_NAME (found); reset_method_name (found); parse_error_context (lookup_cl (sub_interface_method), "Interface `%s' inherits method `%s' from interface `%s'. " "This method is redefined with a different return type in " "interface `%s'", IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))), lang_printable_name (found, 0), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (sub_interface_method)))), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found))))); DECL_NAME (found) = saved_found_wfl; } } } } /* Check the method on all the defined classes. Process all the classes that we compiled from source code for this CU. */ void java_check_methods () { tree current; for (current = ctxp->gclass_list; current; current = TREE_CHAIN (current)) if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current)))) { CHECK_METHODS (TREE_VALUE (current)); CLASS_METHOD_CHECKED_P (TREE_TYPE (TREE_VALUE (current))) = 1; } } /* Lookup methods in interfaces using their name and partial signature. Return a matching method only if their types differ. */ static tree lookup_java_interface_method2 (class, method_decl) tree class, method_decl; { int i, n; tree basetype_vec = TYPE_BINFO_BASETYPES (class), to_return; if (!basetype_vec) return NULL_TREE; n = TREE_VEC_LENGTH (basetype_vec); for (i = 0; i < n; i++) { tree vec_elt = TREE_VEC_ELT (basetype_vec, i), to_return; if ((BINFO_TYPE (vec_elt) != object_type_node) && (to_return = lookup_java_method2 (BINFO_TYPE (vec_elt), method_decl, 1))) return to_return; } for (i = 0; i < n; i++) { to_return = lookup_java_interface_method2 (BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i)), method_decl); if (to_return) return to_return; } return NULL_TREE; } /* Lookup method using their name and partial signature. Return a matching method only if their types differ. */ static tree lookup_java_method2 (clas, method_decl, do_interface) tree clas, method_decl; int do_interface; { tree method, method_signature, method_name, method_type, name; method_signature = build_java_argument_signature (TREE_TYPE (method_decl)); name = DECL_NAME (method_decl); method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ? EXPR_WFL_NODE (name) : name); method_type = TREE_TYPE (TREE_TYPE (method_decl)); while (clas != NULL_TREE) { for (method = TYPE_METHODS (clas); method != NULL_TREE; method = TREE_CHAIN (method)) { tree method_sig = build_java_argument_signature (TREE_TYPE (method)); tree name = DECL_NAME (method); if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ? EXPR_WFL_NODE (name) : name) == method_name && method_sig == method_signature && TREE_TYPE (TREE_TYPE (method)) != method_type) return method; } clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas)); } return NULL_TREE; } /* Return the line that matches DECL line number. Used during error report */ static tree lookup_cl (decl) tree decl; { static tree cl = NULL_TREE; if (!decl) return NULL_TREE; if (cl == NULL_TREE) cl = build_expr_wfl (NULL_TREE, NULL, 0, 0); EXPR_WFL_FILENAME_NODE (cl) = get_identifier (DECL_SOURCE_FILE (decl)); EXPR_WFL_SET_LINECOL (cl, DECL_SOURCE_LINE_FIRST (decl), -1); return cl; } /* Look for a simple name in the single-type import list */ static tree find_name_in_single_imports (name) tree name; { tree node; for (node = ctxp->import_list; node; node = TREE_CHAIN (node)) if (TREE_VALUE (node) == name) return (EXPR_WFL_NODE (TREE_PURPOSE (node))); return NULL_TREE; } /* Process all single-type import. */ static int process_imports () { tree import; int error_found; for (import = ctxp->import_list; import; import = TREE_CHAIN (import)) { tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import)); /* Don't load twice something already defined. */ if (IDENTIFIER_CLASS_VALUE (to_be_found)) continue; QUALIFIED_P (to_be_found) = 1; load_class (to_be_found, 0); error_found = check_pkg_class_access (to_be_found, TREE_PURPOSE (import)); if (!IDENTIFIER_CLASS_VALUE (to_be_found)) { parse_error_context (TREE_PURPOSE (import), "Class or interface `%s' not found in import", IDENTIFIER_POINTER (to_be_found)); return 1; } if (error_found) return 1; } return 0; } /* Possibly find a class imported by a single-type import statement. Return 1 if an error occured, 0 otherwise. */ static int find_in_imports (class_type) tree class_type; { tree import; for (import = ctxp->import_list; import; import = TREE_CHAIN (import)) if (TREE_VALUE (import) == TYPE_NAME (class_type)) { TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import)); QUALIFIED_P (TYPE_NAME (class_type)) = 1; } return 0; } /* Process a import on demand statement (lazy) */ static int read_import_entry (jcf, dirp, returned_name) JCF *jcf; DIR *dirp; char **returned_name; { if (dirp) { struct dirent *direntp = readdir (dirp); if (!direntp) { *returned_name = NULL; return 0; } else { *returned_name = direntp->d_name; return (strlen (direntp->d_name)); } } else { int current_dir_len = strlen (jcf->classname); char *current_entry; int current_entry_len; /* Here we read a zip directory as a file directory. The files we're selecting must have the same root than the directory we're examining. */ ZipDirectory *zipd = (ZipDirectory *)jcf->zipd; while (zipd) { current_entry = ZIPDIR_FILENAME (zipd); current_entry_len = zipd->filename_length; while (current_entry_len && current_entry [current_entry_len] != '/') current_entry_len--; /* If the path of the current file doesn't match the directory we're scanning, that the end of the search */ current_entry_len++; if (strncmp (jcf->classname, current_entry, current_dir_len)) { *returned_name = NULL; return 0; } /* Ok, we have at least the same path. The position of the last '/' of the current file we're examining should match the size of name of the directory we're browsing, otherwise that an entry belonging to a sub directory, we want to skip it. */ if (current_entry_len != current_dir_len) zipd = ZIPDIR_NEXT (zipd); else { jcf->zipd = ZIPDIR_NEXT (zipd); /* Prepare next read */ *returned_name = ¤t_entry [current_entry_len]; return (zipd->filename_length - current_entry_len); } } *returned_name = NULL; return 0; } } /* Read a import directory, gathering potential match for further type references. Indifferently reads a filesystem or a ZIP archive directory. */ static void read_import_dir (wfl) tree wfl; { char *name = IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)); int name_len = IDENTIFIER_LENGTH (EXPR_WFL_NODE (wfl)), reclen; DIR *dirp = NULL; JCF jcfr, *jcf, *saved_jcf = current_jcf; char *founddirname, *d_name; jcf = &jcfr; if (!(founddirname = find_class (name, name_len, jcf, 0))) fatal ("Can't import `%s'", name); if (jcf->outofsynch) jcf_out_of_synch (jcf); if (jcf->seen_in_zip) jcf->zipd = ZIPDIR_NEXT ((ZipDirectory *)jcf->zipd); else if (founddirname) dirp = opendir (founddirname); if (!founddirname && !dirp) { static int first = 1; if (first) { char buffer [256]; sprintf (buffer, "Can't find default package `%s'. Check " "the CLASSPATH environment variable and the access to the " "archives.", name); error (buffer); java_error_count++; first = 0; } else parse_error_context (wfl, "Package `%s' not found in import", name); current_jcf = saved_jcf; return; } /* Here we should have a unified way of retrieving an entry, to be indexed. */ while ((reclen = read_import_entry (jcf, dirp, &d_name))) { int java_or_class = 0; int len; if ((reclen > 5) && !strcmp (&d_name [reclen-5], ".java")) { java_or_class = 1; len = reclen - 5; } if (!java_or_class && (reclen > 6) && !strcmp (&d_name [reclen-6], ".class")) { java_or_class = 2; len = reclen - 6; } if (java_or_class) { char *id_name; tree node; obstack_grow (&temporary_obstack, name, name_len); obstack_1grow (&temporary_obstack, '/'); obstack_grow0 (&temporary_obstack, d_name, len); id_name = obstack_finish (&temporary_obstack); node = get_identifier (id_name); IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */ QUALIFIED_P (node) = 1; /* As soon as we turn / into . */ } } if (dirp) closedir (dirp); current_jcf = saved_jcf; } /* Possibly find a type in the import on demands specified types. Returns 1 if an error occured, 0 otherwise. Run throught the entire list, to detected potential double definitions. */ static int find_in_imports_on_demand (class_type) tree class_type; { tree node, import, node_to_use; int seen_once = -1; tree cl; for (import = ctxp->import_demand_list; import; import = TREE_CHAIN (import)) { char *id_name; obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))), IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import)))); obstack_1grow (&temporary_obstack, '/'); obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (TYPE_NAME (class_type)), IDENTIFIER_LENGTH (TYPE_NAME (class_type))); id_name = obstack_finish (&temporary_obstack); node = maybe_get_identifier (id_name); if (node && IS_A_CLASSFILE_NAME (node)) { if (seen_once < 0) { cl = TREE_PURPOSE (import); seen_once = 1; node_to_use = node; } else { seen_once++; parse_error_context (import, "Type `%s' also potentially defined in package `%s'", IDENTIFIER_POINTER (TYPE_NAME (class_type)), IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import)))); } } } if (seen_once == 1) { /* Setup lineno so that it refers to the line of the import (in case we parse a class file and encounter errors */ tree decl; int saved_lineno = lineno; lineno = EXPR_WFL_LINENO (cl); TYPE_NAME (class_type) = ident_subst (IDENTIFIER_POINTER (node_to_use), IDENTIFIER_LENGTH (node_to_use), "", '/', '.', ""); QUALIFIED_P (TYPE_NAME (class_type)) = 1; decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type)); /* If there is no DECL set for the class or if the class isn't loaded and not seen in source yet, the load */ if (!decl || (!CLASS_LOADED_P (TREE_TYPE (decl)) && !CLASS_FROM_SOURCE_P (TREE_TYPE (decl)))) load_class (node_to_use, 0); lineno = saved_lineno; return check_pkg_class_access (TYPE_NAME (class_type), cl); } else return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */ } static tree resolve_package (pkg, next) tree pkg, *next; { tree type_name = NULL_TREE; char *name = IDENTIFIER_POINTER (EXPR_WFL_NODE (pkg)); /* The trick is to determine when the package name stops and were the name of something contained in the package starts. Then we return a fully qualified name of what we want to get. */ /* Do a quick search on well known package names */ if (!strncmp (name, "java.lang.reflect", 17)) { *next = TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (EXPR_WFL_QUALIFICATION (pkg)))); type_name = lookup_package_type (name, 17); } else if (!strncmp (name, "java.lang", 9)) { *next = TREE_CHAIN (TREE_CHAIN (EXPR_WFL_QUALIFICATION (pkg))); type_name = lookup_package_type (name, 9); } else return NULL_TREE; /* FIXME, search all imported packages. */ return type_name; } static tree lookup_package_type (name, from) char *name; int from; { char subname [128]; char *sub = &name[from+1]; while (*sub != '.' && *sub) sub++; strncpy (subname, name, sub-name); subname [sub-name] = '\0'; return get_identifier (subname); } /* Check that CLASS_NAME refers to a PUBLIC class. Return 0 if no access violations were found, 1 otherwise. */ static int check_pkg_class_access (class_name, cl) tree class_name; tree cl; { tree type; if (!QUALIFIED_P (class_name) || !IDENTIFIER_CLASS_VALUE (class_name)) return 0; if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name)))) return 0; if (!CLASS_PUBLIC (TYPE_NAME (type))) { parse_error_context (cl, "Can't access %s `%s'. Only public classes and interfaces in " "other packages can be accessed", (CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"), IDENTIFIER_POINTER (class_name)); return 1; } return 0; } /* Local variable declaration. */ static void declare_local_variables (modifier, type, vlist) int modifier; tree type; tree vlist; { tree decl, current, saved_type; tree type_wfl = NULL_TREE; int must_chain = 0; /* Push a new block if statement were seen between the last time we pushed a block and now. Keep a cound of block to close */ if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl))) { tree body = DECL_FUNCTION_BODY (current_function_decl); tree b = enter_block (); BLOCK_EXPR_ORIGIN(b) = body; } if (modifier) { int i; for (i = 0; i <= 10; i++) if (1 << i & modifier) break; parse_error_context (ctxp->modifier_ctx [i], (modifier == ACC_FINAL ? "Unsupported JDK1.1 `final' locals" : "Only `final' is allowed as a local variables modifier")); return; } /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will hold the TYPE value if a new incomplete has to be created (as opposed to being found already existing and reused). */ SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain); /* If TYPE is fully resolved and we don't have a reference, make one */ if (!must_chain && TREE_CODE (type) == RECORD_TYPE) type = promote_type (type); /* Go through all the declared variables */ for (current = vlist, saved_type = type; current; current = TREE_CHAIN (current), type = saved_type) { tree other; tree wfl = TREE_PURPOSE (current); tree name = EXPR_WFL_NODE (wfl); tree init = TREE_VALUE (current); /* Process NAME, as it may specify extra dimension(s) for it */ type = build_array_from_name (type, type_wfl, name, &name); /* Variable redefinition check */ if ((other = lookup_name_in_blocks (name))) { variable_redefinition_error (wfl, name, TREE_TYPE (other), DECL_SOURCE_LINE (other)); continue; } /* Type adjustment. We may have just readjusted TYPE because the variable specified more dimensions. Make sure we have a reference if we can and don't have one already. */ if (type != saved_type && !must_chain && (TREE_CODE (type) == RECORD_TYPE)) type = promote_type (type); /* Never layout this decl. This will be done when its scope will be entered */ decl = build_decl_no_layout (VAR_DECL, name, type); BLOCK_CHAIN_DECL (decl); /* Don't try to use an INIT statement when an error was found */ if (init && java_error_count) init = NULL_TREE; /* Add the initialization function to the current function's code */ if (init) { /* Name might have been readjusted */ EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name; MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1; java_method_add_stmt (current_function_decl, build_debugable_stmt (EXPR_WFL_LINECOL (init), init)); } /* Setup dependency the type of the decl */ if (must_chain) { jdep *dep; register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type); dep = CLASSD_LAST (ctxp->classd_list); JDEP_GET_PATCH (dep) = &TREE_TYPE (decl); } } SOURCE_FRONTEND_DEBUG (("Defined locals")); } /* Called during parsing. Build decls from argument list. */ static void source_start_java_method (fndecl) tree fndecl; { tree tem; tree parm_decl; int i; current_function_decl = fndecl; /* New scope for the function */ enter_block (); for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0; tem != NULL_TREE; tem = TREE_CHAIN (tem), i++) { tree type = TREE_VALUE (tem); tree name = TREE_PURPOSE (tem); /* If type is incomplete. Layout can't take place now. Create an incomplete decl and ask for the decl to be patched later */ if (INCOMPLETE_TYPE_P (type)) { jdep *jdep; parm_decl = build_decl_no_layout (PARM_DECL, name, type); register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type); jdep = CLASSD_LAST (ctxp->classd_list); JDEP_MISC (jdep) = name; JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl); } else parm_decl = build_decl (PARM_DECL, name, type); BLOCK_CHAIN_DECL (parm_decl); } tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)); BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) = nreverse (tem); DECL_ARG_SLOT_COUNT (current_function_decl) = i; } /* Called during parsing. Creates an artificial method declaration. */ static tree create_artificial_method (class, flags, type, name, args) tree class; int flags; tree type, name, args; { int saved_lineno = lineno; tree mdecl; lineno = 0; mdecl = make_node (FUNCTION_TYPE); TREE_TYPE (mdecl) = type; TYPE_ARG_TYPES (mdecl) = args; mdecl = add_method (class, flags, name, build_java_signature (mdecl)); lineno = saved_lineno; DECL_ARTIFICIAL (mdecl) = 1; return mdecl; } /* Starts the body if an artifical method. */ static void start_artificial_method_body (mdecl) tree mdecl; { DECL_SOURCE_LINE (mdecl) = 1; DECL_SOURCE_LINE_MERGE (mdecl, 1); source_start_java_method (mdecl); enter_block (); } static void end_artificial_method_body (mdecl) tree mdecl; { BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = exit_block (); exit_block (); } /* Called during expansion. Push decls formerly built from argument list so they're usable during expansion. */ static void expand_start_java_method (fndecl) tree fndecl; { tree tem, *ptr; current_function_decl = fndecl; announce_function (fndecl); pushlevel (1); /* Push parameters */ ptr = &DECL_ARGUMENTS (fndecl); tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)); while (tem) { tree next = TREE_CHAIN (tem); tree type = TREE_TYPE (tem); #ifdef PROMOTE_PROTOTYPES if (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node) && INTEGRAL_TYPE_P (type)) type = integer_type_node; #endif DECL_ARG_TYPE (tem) = type; layout_decl (tem, 0); pushdecl (tem); INITIALIZED_P (tem) = 1; /* Parms are initialized */ *ptr = tem; ptr = &TREE_CHAIN (tem); tem = next; } *ptr = NULL_TREE; pushdecl_force_head (DECL_ARGUMENTS (fndecl)); lineno = DECL_SOURCE_LINE_FIRST (fndecl); complete_start_java_method (fndecl); } /* Terminate a function and expand its body. */ static void source_end_java_method () { tree fndecl = current_function_decl; java_parser_context_save_global (); lineno = ctxp->last_ccb_indent1; /* Set EH language codes */ java_set_exception_lang_code (); /* Generate function's code */ if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)) && ! flag_emit_class_files) expand_expr_stmt (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))); /* pop out of its parameters */ pushdecl_force_head (DECL_ARGUMENTS (fndecl)); poplevel (1, 0, 1); BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl; /* Generate rtl for function exit. */ if (! flag_emit_class_files) { lineno = DECL_SOURCE_LINE_LAST (fndecl); /* Emit catch-finally clauses */ emit_handlers (); expand_function_end (input_filename, lineno, 0); /* Run the optimizers and output assembler code for this function. */ rest_of_compilation (fndecl); } current_function_decl = NULL_TREE; /* permanent_allocation (1); */ java_parser_context_restore_global (); } /* Record EXPR in the current function block. Complements compound expression second operand if necessary. */ tree java_method_add_stmt (fndecl, expr) tree fndecl, expr; { return add_stmt_to_block (DECL_FUNCTION_BODY (fndecl), NULL_TREE, expr); } static tree add_stmt_to_block (b, type, stmt) tree b, type, stmt; { tree body = BLOCK_EXPR_BODY (b), c; if (java_error_count) return body; if ((c = add_stmt_to_compound (body, type, stmt)) == body) return body; BLOCK_EXPR_BODY (b) = c; TREE_SIDE_EFFECTS (c) = 1; return c; } /* Add STMT to EXISTING if possible, otherwise create a new COMPOUND_EXPR and add STMT to it. */ static tree add_stmt_to_compound (existing, type, stmt) tree existing, type, stmt; { tree node; if (existing && (TREE_CODE (existing) == COMPOUND_EXPR) && TREE_OPERAND (existing, 1) == size_zero_node) { TREE_OPERAND (existing, 1) = stmt; TREE_TYPE (existing) = type; return existing; } else if (existing) node = build (COMPOUND_EXPR, type, existing, stmt); else node = build (COMPOUND_EXPR, type, stmt, size_zero_node); return node; } /* Hold THIS for the scope of the current public method decl. */ static tree current_this; /* Layout all class found during parsing. Also fixes the order of some lists. */ void java_layout_classes () { tree current; java_check_methods (); /* Error reported by the caller */ if (java_error_count) return; for (current = ctxp->gclass_list; current; current = TREE_CHAIN (current)) { current_class = TREE_TYPE (TREE_VALUE (current)); /* Reverse the fields if it's necessary (they've already reversed if the dummy field has been inserted at the beginning of the list */ if (TYPE_FIELDS (current_class) && !DECL_IGNORED_P (TYPE_FIELDS (current_class))) TYPE_FIELDS (current_class) = nreverse (TYPE_FIELDS (current_class)); /* Do a layout if necessary */ if (!TYPE_SIZE (current_class) || (current_class == object_type_node)) safe_layout_class (current_class); /* Error reported by the caller */ if (java_error_count) return; } } /* Expand all methods in all registered classes. */ void java_complete_expand_methods () { tree current; for (current = ctxp->class_list; current; current = TREE_CHAIN (current)) { tree class_type = CLASS_TO_HANDLE_TYPE (TREE_TYPE (current)); tree decl; current_class = TREE_TYPE (current); /* Initialize a new constant pool */ init_outgoing_cpool (); /* Don't process function bodies in interfaces */ if (!CLASS_INTERFACE (TYPE_NAME (current_class))) for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl)) { current_function_decl = decl; /* Don't generate debug info on line zero when expanding a generated constructor. */ if (DECL_CONSTRUCTOR_P (decl) && !DECL_FUNCTION_BODY (decl)) { /* If we found errors, it's too dangerous to try to generate and expand a constructor */ if (!java_error_count) { restore_line_number_status (1); java_complete_expand_method (decl); restore_line_number_status (0); } } else if (METHOD_ABSTRACT (decl) || METHOD_NATIVE (decl)) continue; else java_complete_expand_method (decl); } /* Now verify constructor circularity (stop after the first one we find) */ if (!CLASS_INTERFACE (TYPE_NAME (current_class))) for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl)) if (DECL_CONSTRUCTOR_P (decl) && verify_constructor_circularity (decl, decl)) break; /* Make the class data, register it and run the rest of decl compilation on it */ if (!java_error_count && ! flag_emit_class_files) { make_class_data (current_class); register_class (); rest_of_decl_compilation (TYPE_NAME (current_class), (char*) 0, 1, 0); } } } /* Hold a list of catch clauses list. The first element of this list is the list of the catch clauses of the currently analysed try block. */ static tree currently_caught_type_list; /* Complete and expand a method. */ static void java_complete_expand_method (mdecl) tree mdecl; { /* Fix constructors before expanding them */ if (DECL_CONSTRUCTOR_P (mdecl)) fix_constructors (mdecl); /* Expand functions that have a body */ if (DECL_FUNCTION_BODY (mdecl)) { expand_start_java_method (mdecl); current_this = (!METHOD_STATIC (mdecl) ? BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE); /* Purge the `throws' list of unchecked exceptions */ purge_unchecked_exceptions (mdecl); /* Install exceptions thrown with `throws' */ PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl)); if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl))) java_complete_tree (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl))); /* Don't go any further if we've found error(s) during the expansion */ if (!java_error_count) source_end_java_method (); else { pushdecl_force_head (DECL_ARGUMENTS (mdecl)); poplevel (1, 0, 1); } /* Pop the exceptions and sanity check */ POP_EXCEPTIONS(); if (currently_caught_type_list) fatal ("Exception list non empty - java_complete_expand_method"); } } /* Craft a body for default constructor. Patch existing constructor bodies with call to super() and field initialization statements if necessary. */ static void fix_constructors (mdecl) tree mdecl; { tree body = DECL_FUNCTION_BODY (mdecl); tree field_init; /* The constructor body must be crafted by hand. It's the constructor we defined when we realize we didn't have the CLASSNAME() constructor */ if (!body) { tree compound; /* It is an error for the compiler to generate a default constructor if the superclass doesn't have a constructor that takes no argument */ if (verify_constructor_super ()) { tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (current_class)); char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl)); parse_error_context (lookup_cl (TYPE_NAME (current_class)), "No constructor matching `%s()' found in " "class `%s'", n, n); } start_artificial_method_body (mdecl); /* We don't generate a super constructor invocation if we're compiling java.lang.Object. build_super_invocation takes care of that. */ compound = java_method_add_stmt (mdecl, build_super_invocation ()); /* Takes care of non static field initialization */ field_init = generate_field_initialization_code (current_class); if (field_init) compound = java_method_add_stmt (mdecl, field_init); end_artificial_method_body (mdecl); } /* Search for an explicit constructor invocation */ else { int found = 0; tree main_block = BLOCK_EXPR_BODY (body); tree compound = NULL_TREE; while (body) switch (TREE_CODE (body)) { case CALL_EXPR: found = CALL_EXPLICIT_CONSTRUCTOR_P (body); body = NULL_TREE; break; case COMPOUND_EXPR: case EXPR_WITH_FILE_LOCATION: body = TREE_OPERAND (body, 0); break; case BLOCK: body = BLOCK_EXPR_BODY (body); break; default: found = 0; body = NULL_TREE; } /* The constructor is missing an invocation of super() */ if (!found) compound = add_stmt_to_compound (compound, NULL_TREE, build_super_invocation ()); /* Also fix its initialized fields initialization */ field_init = generate_field_initialization_code (current_class); if (field_init) compound = add_stmt_to_compound (compound, NULL_TREE, field_init); /* Fix the constructor main block if we're adding extra stmts */ if (compound) { compound = add_stmt_to_compound (compound, NULL_TREE, BLOCK_EXPR_BODY (main_block)); BLOCK_EXPR_BODY (main_block) = compound; } } } /* Browse constructors in the super class, searching for a constructor that doesn't take any argument. Return 0 if one is found, 1 otherwise. */ static int verify_constructor_super () { tree class = CLASSTYPE_SUPER (current_class); if (!class) return 0; if (class) { tree mdecl; for (mdecl = TYPE_METHODS (class); mdecl; mdecl = TREE_CHAIN (mdecl)) { if (DECL_CONSTRUCTOR_P (mdecl) && !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (mdecl)))) return 0; } } return 1; } /* Generate the code used to initialize field declared with an initialization statement. For now, it returns a call the the artificial function , if required. Always returns NULL if nothing needs to be generated. */ static tree generate_field_initialization_code (class) tree class; { if (CLASS_HAS_FINIT_P (class)) return build_method_invocation (build_expr_wfl (finit_identifier_node, input_filename, 0, 0), NULL_TREE); else return NULL_TREE; } /* Expand finals. */ void java_expand_finals () { } /* Generate code for all context remembered for code generation. */ void java_expand_classes () { ctxp = ctxp_for_generation; /* If we found error earlier, we don't want to report then twice. */ if (java_error_count || !ctxp) return; java_layout_classes (); java_parse_abort_on_error (); for (; ctxp_for_generation; ctxp_for_generation = ctxp_for_generation->next) { ctxp = ctxp_for_generation; lang_init_source (2); /* Error msgs have method prototypes */ java_complete_expand_methods (); /* Complete and expand method bodies */ java_parse_abort_on_error (); java_expand_finals (); /* Expand and check the finals */ java_parse_abort_on_error (); java_check_final (); /* Check unitialized final */ java_parse_abort_on_error (); if (flag_emit_class_files) write_classfile (current_class); } } /* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to a tree list node containing RIGHT. Fore coming RIGHTs will be chained to this hook. LOCATION contains the location of the separating `.' operator. */ static tree make_qualified_primary (primary, right, location) tree primary, right; int location; { tree wfl; /* We want to process THIS . xxx symbolicaly, to keep it consistent with the way we're processing SUPER. A THIS from a primary as a different form than a SUPER. Turn THIS into something symbolic */ if (TREE_CODE (primary) == THIS_EXPR) { wfl = build_wfl_node (this_identifier_node, input_filename, 0, 0); EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (primary); wfl = make_qualified_name (wfl, right, location); PRIMARY_P (wfl) = 1; return wfl; } /* Other non WFL node are wrapped around a WFL */ else if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION) { wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0); EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (primary); EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (primary, NULL_TREE); } else { wfl = primary; if (!EXPR_WFL_QUALIFICATION (primary)) EXPR_WFL_QUALIFICATION (primary) = build_tree_list (primary, NULL_TREE); } EXPR_WFL_LINECOL (right) = location; chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE)); PRIMARY_P (wfl) = 1; return wfl; } /* Simple merge of two name separated by a `.' */ static tree merge_qualified_name (left, right) tree left, right; { tree node; obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left), IDENTIFIER_LENGTH (left)); obstack_1grow (&temporary_obstack, '.'); obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right), IDENTIFIER_LENGTH (right)); node = get_identifier (obstack_base (&temporary_obstack)); obstack_free (&temporary_obstack, obstack_base (&temporary_obstack)); QUALIFIED_P (node) = 1; return node; } /* Merge the two parts of a qualified name into LEFT. Set the location information of the resulting node to LOCATION, usually inherited from the location information of the `.' operator. */ static tree make_qualified_name (left, right, location) tree left, right; int location; { tree left_id = EXPR_WFL_NODE (left); tree right_id = EXPR_WFL_NODE (right); tree wfl, merge; merge = merge_qualified_name (left_id, right_id); /* Left wasn't qualified and is now qualified */ if (!QUALIFIED_P (left_id)) { tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0); EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left); EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE); } wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0); EXPR_WFL_LINECOL (wfl) = location; chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE)); EXPR_WFL_NODE (left) = merge; return left; } /* Extract the last identifier component of the qualified in WFL. The last identifier is removed from the linked list */ static tree cut_identifier_in_qualified (wfl) tree wfl; { tree q; tree previous = NULL_TREE; for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q)) if (!TREE_CHAIN (q)) { if (!previous) fatal ("Operating on a non qualified qualified WFL - " "cut_identifier_in_qualified"); TREE_CHAIN (previous) = NULL_TREE; return TREE_PURPOSE (q); } } /* Resolve the expression name NAME. Return its decl. */ static tree resolve_expression_name (id, orig) tree id; tree *orig; { tree name = EXPR_WFL_NODE (id); tree decl; /* 6.5.5.1: Simple expression names */ if (!PRIMARY_P (id) && !QUALIFIED_P (name)) { /* 15.13.1: NAME can appear within the scope of a local variable declaration */ if ((decl = IDENTIFIER_LOCAL_VALUE (name))) return decl; /* 15.13.1: NAME can appear within a class declaration */ else { decl = lookup_field_wrapper (current_class, name); if (decl) { tree value = NULL_TREE; int fs = FIELD_STATIC (decl); /* Instance variable (8.3.1.1) can't appear within static method, static initializer or initializer for a static variable. */ if (!fs && METHOD_STATIC (current_function_decl)) { parse_error_context (id, "Can't make a static reference to nonstatic variable " "`%s' in class `%s'", IDENTIFIER_POINTER (name), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)))); return error_mark_node; } /* Instance variables can't appear as an argument of an explicit constructor invocation */ if (!fs && ctxp->explicit_constructor_p) { parse_error_context (id, "Can't reference `%s' before the superclass " "constructor has been called", IDENTIFIER_POINTER (name)); return error_mark_node; } /* The field is final. We may use its value instead */ if (fs && FIELD_FINAL (decl)) value = java_complete_tree (DECL_LOCAL_STATIC_VALUE (decl)); /* Otherwise build what it takes to access the field */ decl = build_field_ref ((fs ? NULL_TREE : current_this), current_class, name); if (fs && !flag_emit_class_files) decl = build_class_init (current_class, decl); /* We may be asked to save the real field access node */ if (orig) *orig = decl; /* And we return what we got */ return (value ? value : decl); } /* Fall down to error report on undefined variable */ } } /* 6.5.5.2 Qualified Expression Names */ else { if (orig) *orig = NULL_TREE; qualify_ambiguous_name (id); /* 15.10.1 Field Access Using a Primary and/or Expression Name */ /* 15.10.2: Accessing Superclass Members using super */ return resolve_field_access (id, NULL, NULL); } /* We've got an error here */ parse_error_context (id, "Undefined variable `%s'", IDENTIFIER_POINTER (name)); return error_mark_node; } /* 15.10.1 Field Acess Using a Primary and/or Expression Name. We return something suitable to generate the field access. We also return the field decl in FIELD_DECL and its type in FIELD_TYPE. If recipient's address can be null. */ static tree resolve_field_access (qual_wfl, field_decl, field_type) tree qual_wfl; tree *field_decl, *field_type; { int is_static = 0; tree field_ref; tree decl, where_found, type_found; if (resolve_qualified_expression_name (qual_wfl, &decl, &where_found, &type_found)) return error_mark_node; /* Resolve the LENGTH field of an array here */ if (DECL_NAME (decl) == length_identifier_node && TYPE_ARRAY_P (type_found) && ! flag_emit_class_files) { tree length = build_java_array_length_access (where_found); field_ref = build_java_arraynull_check (type_found, length, int_type_node); } /* We might have been trying to resolve field.method(). In which case, the resolution is over and decl is the answer */ else if (DECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl) field_ref = decl; else if (DECL_P (decl)) { int static_final_found = 0; if (!type_found) type_found = DECL_CONTEXT (decl); is_static = DECL_P (decl) && FIELD_STATIC (decl); if (FIELD_FINAL (decl) && JPRIMITIVE_TYPE_P (TREE_TYPE (decl)) && DECL_LANG_SPECIFIC (decl) && DECL_LOCAL_STATIC_VALUE (decl)) { field_ref = java_complete_tree (DECL_LOCAL_STATIC_VALUE (decl)); static_final_found = 1; } else field_ref = build_field_ref ((is_static ? NULL_TREE : where_found), type_found, DECL_NAME (decl)); if (field_ref == error_mark_node) return error_mark_node; if (is_static && !static_final_found) { field_ref = build_class_init (type_found, field_ref); /* If the static field was identified by an expression that needs to be generated, make the field access a compound expression whose first part of the evaluation of the field selector part. */ if (where_found && TREE_CODE (where_found) != TYPE_DECL) { tree type = QUAL_DECL_TYPE (field_ref); field_ref = build (COMPOUND_EXPR, type, where_found, field_ref); } } } else field_ref = decl; if (field_decl) *field_decl = decl; if (field_type) *field_type = QUAL_DECL_TYPE (decl); return field_ref; } /* 6.5.5.2: Qualified Expression Names */ static int resolve_qualified_expression_name (wfl, found_decl, where_found, type_found) tree wfl; tree *found_decl, *type_found, *where_found; { int from_type = 0; /* Field search initiated from a type */ int from_super = 0, from_cast = 0; int previous_call_static = 0; int is_static; tree decl = NULL_TREE, type = NULL_TREE, q; *where_found = NULL_TREE; for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q)) { tree qual_wfl = QUAL_WFL (q); /* 15.10.1 Field Access Using a Primary */ switch (TREE_CODE (qual_wfl)) { case CALL_EXPR: case NEW_CLASS_EXPR: /* If the access to the function call is a non static field, build the code to access it. */ if (DECL_P (decl) && !FIELD_STATIC (decl)) { decl = maybe_access_field (decl, *where_found, type); if (decl == error_mark_node) return 1; } /* And code for the function call */ if (complete_function_arguments (qual_wfl)) return 1; *where_found = patch_method_invocation_stmt (qual_wfl, decl, type, &is_static, NULL, from_super); if (*where_found == error_mark_node) return 1; *type_found = type = QUAL_DECL_TYPE (*where_found); /* If the previous call was static and this one is too, build a compound expression to hold the two (because in that case, previous function calls aren't transported as forcoming function's argument. */ if (previous_call_static && is_static) { decl = build (COMPOUND_EXPR, type, decl, *where_found); TREE_SIDE_EFFECTS (decl) = 1; } else { previous_call_static = is_static; decl = *where_found; } continue; case CONVERT_EXPR: *where_found = decl = java_complete_tree (qual_wfl); if (decl == error_mark_node) return 1; *type_found = type = QUAL_DECL_TYPE (decl); from_cast = 1; continue; case CONDITIONAL_EXPR: case STRING_CST: *where_found = decl = java_complete_tree (qual_wfl); if (decl == error_mark_node) return 1; *type_found = type = QUAL_DECL_TYPE (decl); continue; case ARRAY_REF: /* If the access to the function call is a non static field, build the code to access it. */ if (DECL_P (decl) && !FIELD_STATIC (decl)) { decl = maybe_access_field (decl, *where_found, type); if (decl == error_mark_node) return 1; } /* And code for the array reference expression */ decl = java_complete_tree (qual_wfl); if (decl == error_mark_node) return 1; type = QUAL_DECL_TYPE (decl); continue; default: /* Fix for -Wall Just go to the next statement. Don't continue */ } /* If we fall here, we weren't processing a (static) function call. */ previous_call_static = 0; /* It can be the keyword THIS */ if (EXPR_WFL_NODE (qual_wfl) == this_identifier_node) { if (!current_this) { parse_error_context (wfl, "Keyword `this' used outside allowed context"); return 1; } /* We have to generate code for intermediate acess */ *where_found = decl = current_this; *type_found = type = QUAL_DECL_TYPE (decl); continue; } /* 15.10.2 Accessing Superclass Members using SUPER */ if (EXPR_WFL_NODE (qual_wfl) == super_identifier_node) { tree node; /* Check on the restricted use of SUPER */ if (METHOD_STATIC (current_function_decl) || current_class == object_type_node) { parse_error_context (wfl, "Keyword `super' used outside allowed context"); return 1; } /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */ node = build_cast (EXPR_WFL_LINECOL (qual_wfl), CLASSTYPE_SUPER (current_class), build_this (EXPR_WFL_LINECOL (qual_wfl))); *where_found = decl = java_complete_tree (node); if (decl == error_mark_node) return 1; *type_found = type = QUAL_DECL_TYPE (decl); from_super = from_type = 1; continue; } /* 15.13.1: Can't search for field name in packages, so we assume a variable/class name was meant. */ if (RESOLVE_PACKAGE_NAME_P (qual_wfl)) { tree name = resolve_package (wfl, &q); if (name) { *where_found = decl = resolve_no_layout (name, qual_wfl); /* We wan't to be absolutely that the class is laid out. We're going to search something inside it. */ *type_found = type = TREE_TYPE (decl); layout_class (type); from_type = 1; /* Should be a list, really. FIXME */ RESOLVE_EXPRESSION_NAME_P (QUAL_WFL (TREE_CHAIN (q))) = 1; RESOLVE_PACKAGE_NAME_P (QUAL_WFL (TREE_CHAIN (q))) = 0; } else { if (from_super || from_cast) parse_error_context ((from_cast ? qual_wfl : wfl), "No variable `%s' defined in class `%s'", IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)), lang_printable_name (type, 0)); else parse_error_context (qual_wfl, "Undefined variable or class name: `%s'", IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl))); return 1; } } /* We have a type name. It's been already resolved when the expression was qualified. */ else if (RESOLVE_TYPE_NAME_P (qual_wfl)) { if (!(decl = QUAL_RESOLUTION (q))) return 1; /* Error reported already */ if (not_accessible_p (TREE_TYPE (decl), decl, 0)) { parse_error_context (qual_wfl, "Can't access %s field `%s.%s' from `%s'", java_accstring_lookup (get_access_flags_from_decl (decl)), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))), IDENTIFIER_POINTER (DECL_NAME (decl)), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)))); return 1; } check_deprecation (qual_wfl, decl); type = TREE_TYPE (decl); from_type = 1; } /* We resolve and expression name */ else { tree field_decl; /* If there exists an early resolution, use it. That occurs only once and we know that there are more things to come. Don't do that when processing something after SUPER (we need more thing to be put in place below */ if (!from_super && QUAL_RESOLUTION (q)) { decl = QUAL_RESOLUTION (q); if (!type && !FIELD_STATIC (decl)) { *where_found = current_this; *type_found = type; } } /* We have to search for a field, knowing the type of its container. The flag FROM_TYPE indicates that we resolved the last member of the expression as a type name, which means that for the resolution of this field, we'll look for other errors than if it was resolved as a member of an other field. */ else { int is_static; tree field_decl_type; /* For layout */ if (!from_type && !JREFERENCE_TYPE_P (type)) { parse_error_context (qual_wfl, "Attempt to reference field `%s' in `%s %s'", IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)), lang_printable_name (type, 0), IDENTIFIER_POINTER (DECL_NAME (field_decl))); return 1; } if (!(field_decl = lookup_field_wrapper (type, EXPR_WFL_NODE (qual_wfl)))) { parse_error_context (qual_wfl, "No variable `%s' defined in class `%s'", IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)))); return 1; } /* Layout the type of field_decl, since we may need it. Don't do primitive types or loaded classes */ if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE) field_decl_type = TREE_TYPE (TREE_TYPE (field_decl)); else field_decl_type = TREE_TYPE (field_decl); if (!JPRIMITIVE_TYPE_P (field_decl_type) && !CLASS_LOADED_P (field_decl_type)) resolve_and_layout (DECL_NAME (TYPE_NAME (field_decl_type)), NULL_TREE); /* Check on accessibility here */ if (not_accessible_p (type, field_decl, from_super)) { parse_error_context (qual_wfl, "Can't access %s field `%s.%s' from `%s'", java_accstring_lookup (get_access_flags_from_decl (field_decl)), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))), IDENTIFIER_POINTER (DECL_NAME (field_decl)), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)))); return 1; } check_deprecation (qual_wfl, field_decl); /* There are things to check when fields are accessed from type. There are no restrictions on a static declaration of the field when it is accessed from an interface */ is_static = FIELD_STATIC (field_decl); if (!from_super && from_type && !TYPE_INTERFACE_P (type) && !is_static) { parse_error_context (qual_wfl, "Can't make a static reference to nonstatic " "variable `%s' in class `%s'", IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)))); return 1; } from_cast = from_super = 0; /* If we need to generate something to get a proper handle on what this field is accessed from, do it now. */ if (!is_static) { decl = maybe_access_field (decl, *where_found, *type_found); if (decl == error_mark_node) return 1; } /* We want to keep the location were found it, and the type we found. */ *where_found = decl; *type_found = type; /* This is the decl found and eventually the next one to search from */ decl = field_decl; } from_type = 0; type = QUAL_DECL_TYPE (decl); } } *found_decl = decl; return 0; } /* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl) can't be accessed from REFERENCE (a record type). */ int not_accessible_p (reference, member, from_super) tree reference, member; int from_super; { int access_flag = get_access_flags_from_decl (member); /* Access always granted for members declared public */ if (access_flag & ACC_PUBLIC) return 0; /* Check access on protected members */ if (access_flag & ACC_PROTECTED) { /* Access granted if it occurs from within the package containing the class in which the protected member is declared */ if (class_in_current_package (DECL_CONTEXT (member))) return 0; if (TREE_CODE (member) == FUNCTION_DECL && DECL_CONSTRUCTOR_P (member)) { /* Access from SUPER is granted */ if (from_super) return 0; /* Otherwise, access isn't granted */ return 1; } else { /* If accessed with the form `super.member', then access is granted */ if (from_super) return 0; /* Otherwise, access is granted if occuring from the class where member is declared or a subclass of it */ if (inherits_from_p (reference, current_class)) return 0; } return 1; } /* Check access on private members. Access is granted only if it occurs from within the class in witch it is declared*/ if (access_flag & ACC_PRIVATE) return (current_class == DECL_CONTEXT (member) ? 0 : 1); /* Default access are permitted only when occuring within the package in which the type (REFERENCE) is declared. In other words, REFERENCE is defined in the current package */ if (ctxp->package) return !class_in_current_package (reference); /* Otherwise, access is granted */ return 0; } /* Test deprecated decl access. */ static void check_deprecation (wfl, decl) tree wfl, decl; { char *file = DECL_SOURCE_FILE (decl); /* Complain if the field is deprecated and the file it was defined in isn't compiled at the same time the file which contains its use is */ if (DECL_DEPRECATED (decl) && !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file))) { char the [20]; switch (TREE_CODE (decl)) { case FUNCTION_DECL: strcpy (the, "method"); break; case FIELD_DECL: strcpy (the, "field"); break; case TYPE_DECL: strcpy (the, "class"); break; default: fatal ("unexpected DECL code - check_deprecation"); } parse_warning_context (wfl, "The %s `%s' in class `%s' has been deprecated", the, lang_printable_name (decl, 0), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl))))); } } /* Returns 1 if class was declared in the current package, 0 otherwise */ static int class_in_current_package (class) tree class; { static tree cache = NULL_TREE; int qualified_flag; tree left; if (cache == class) return 1; qualified_flag = QUALIFIED_P (DECL_NAME (TYPE_NAME (class))); /* If the current package is empty and the name of CLASS is qualified, class isn't in the current package. If there is a current package and the name of the CLASS is not qualified, class isn't in the current package */ if ((!ctxp->package && qualified_flag) || (ctxp->package && !qualified_flag)) return 0; /* If there is not package and the name of CLASS isn't qualified, they belong to the same unnamed package */ if (!ctxp->package && !qualified_flag) return 1; /* Compare the left part of the name of CLASS with the package name */ breakdown_qualified (&left, NULL, DECL_NAME (TYPE_NAME (class))); if (ctxp->package == left) { cache = class; return 1; } return 0; } /* This function may generate code to access DECL from WHERE. This is done only if certain conditions meet. */ static tree maybe_access_field (decl, where, type) tree decl, where, type; { if (TREE_CODE (decl) == FIELD_DECL && decl != current_this && !FIELD_STATIC (decl)) decl = build_field_ref (where ? where : current_this, (type ? type : DECL_CONTEXT (decl)), DECL_NAME (decl)); return decl; } /* Build a method invocation statement, by patching PATCH. If non NULL and according to the situation, PRIMARY and WHERE may be used. IS_STATIC is set to 1 if the invoked function is static. */ static tree patch_method_invocation_stmt (patch, primary, where, is_static, ret_decl, super) tree patch, primary, where; int *is_static; tree *ret_decl; int super; { tree wfl = TREE_OPERAND (patch, 0); tree args = TREE_OPERAND (patch, 1); tree name = EXPR_WFL_NODE (wfl); tree list; int is_static_flag = 0; /* Should be overriden if everything goes well. Otherwise, if something fails, it should keep this value. It stop the evaluation of a bogus assignment. See java_complete_tree, MODIFY_EXPR: for the reasons why we sometimes want to keep on evaluating an assignment */ TREE_TYPE (patch) = error_mark_node; /* Since lookup functions are messing with line numbers, save the context now. */ java_parser_context_save_global (); /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */ /* Resolution of qualified name, excluding constructors */ if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch)) { tree class_decl, identifier, identifier_wfl; /* Extract the last IDENTIFIER of the qualified expression. This is a wfl and we will use it's location data during error report. */ identifier_wfl = cut_identifier_in_qualified (wfl); identifier = EXPR_WFL_NODE (identifier_wfl); /* Given the context, IDENTIFIER is syntactically qualified as a MethodName. We need to qualify what's before */ qualify_ambiguous_name (wfl); /* Package resolution are erroneous */ if (RESOLVE_PACKAGE_NAME_P (wfl)) { tree remainder; breakdown_qualified (&remainder, NULL, EXPR_WFL_NODE (wfl)); parse_error_context (wfl, "Can't search method `%s' in package " "`%s'",IDENTIFIER_POINTER (identifier), IDENTIFIER_POINTER (remainder)); PATCH_METHOD_RETURN_ERROR (); } /* We're resolving a call from a type */ else if (RESOLVE_TYPE_NAME_P (wfl)) { tree decl = QUAL_RESOLUTION (EXPR_WFL_QUALIFICATION (wfl)); tree name = DECL_NAME (decl); tree type; class_decl = resolve_and_layout (name, wfl); if (CLASS_INTERFACE (decl)) { parse_error_context (identifier_wfl, "Can't make static reference to method " "`%s' in interface `%s'", IDENTIFIER_POINTER (identifier), IDENTIFIER_POINTER (name)); PATCH_METHOD_RETURN_ERROR (); } /* Look the method up in the type selector. The method ought to be static. */ type = TREE_TYPE (class_decl); list = lookup_method_invoke (0, wfl, type, identifier, args); if (list && !METHOD_STATIC (list)) { char *fct_name = strdup (lang_printable_name (list, 0)); parse_error_context (identifier_wfl, "Can't make static reference to method `%s %s' in class `%s'", lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0), fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)))); free (fct_name); PATCH_METHOD_RETURN_ERROR (); } args = nreverse (args); } /* We're resolving an expression name */ else { tree field, type; /* 1- Find the field to which the call applies */ field = resolve_field_access (wfl, NULL, &type); if (field == error_mark_node) PATCH_METHOD_RETURN_ERROR (); /* 2- Do the layout of the class where the last field was found, so we can search it. */ class_decl = resolve_and_layout (DECL_NAME (TYPE_NAME (type)), NULL_TREE); /* 3- Retrieve a filtered list of method matches, Refine if necessary. In any cases, point out errors. */ list = lookup_method_invoke (0, identifier_wfl, type, identifier, args); /* 4- Add the field as an argument */ args = tree_cons (NULL_TREE, field, nreverse (args)); } /* IDENTIFIER_WFL will be used to report any problem further */ wfl = identifier_wfl; } /* Resolution of simple names, names generated after a primary: or constructors */ else { tree class_to_search; int lc; /* Looking for Constructor */ /* We search constructor in their target class */ if (CALL_CONSTRUCTOR_P (patch)) { if (TREE_CODE (patch) == NEW_CLASS_EXPR) class_to_search = EXPR_WFL_NODE (wfl); else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) == this_identifier_node) class_to_search = NULL_TREE; else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) == super_identifier_node) { if (CLASSTYPE_SUPER (current_class)) class_to_search = DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class))); else { parse_error_context (wfl, "Can't invoke super constructor " "on java.lang.Object"); PATCH_METHOD_RETURN_ERROR (); } } /* Class to search is NULL if we're searching the current one */ if (class_to_search) { class_to_search = resolve_no_layout (class_to_search, NULL_TREE); if (!class_to_search) { parse_error_context (wfl, "Class `%s' not found in type declaration", IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl))); PATCH_METHOD_RETURN_ERROR (); } /* Can't instantiate an abstract class, but we can invoke it's constructor. It's use within the `new' context is denied here. */ if (CLASS_ABSTRACT (class_to_search) && TREE_CODE (patch) == NEW_CLASS_EXPR) { parse_error_context (wfl, "Class `%s' is an abstract class. It can't be " "instantiated", IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl))); PATCH_METHOD_RETURN_ERROR (); } class_to_search = TREE_TYPE (class_to_search); } else class_to_search = current_class; lc = 1; } /* This is a regular search in the local class, unless an alternate class is specified. */ else { class_to_search = (where ? where : current_class); lc = 0; } /* NAME is a simple identifier or comes from a primary. Search in the class whose declaration contain the method being invoked. */ list = lookup_method_invoke (lc, wfl, class_to_search, name, args); /* Don't continue if no method were found, as the next statement can't be executed then. */ if (!list) PATCH_METHOD_RETURN_ERROR (); /* Check for static reference if non static methods */ if (check_for_static_method_reference (wfl, patch, list, class_to_search, primary)) PATCH_METHOD_RETURN_ERROR (); /* Non static methods are called with the current object extra argument. If patch a `new TYPE()', the argument is the value returned by the object allocator. If method is resolved as a primary, use the primary otherwise use the current THIS. */ args = nreverse (args); if (!METHOD_STATIC (list) && TREE_CODE (patch) != NEW_CLASS_EXPR) args = tree_cons (NULL_TREE, primary ? primary : current_this, args); } /* Merge point of all resolution schemes. If we have nothing, this is an error, already signaled */ if (!list) PATCH_METHOD_RETURN_ERROR (); /* Check accessibility, position the is_static flag, build and return the call */ if (not_accessible_p (DECL_CONTEXT (list), list, 0)) { char *fct_name = strdup (lang_printable_name (list, 0)); parse_error_context (wfl, "Can't access %s method `%s %s.%s' from `%s'", java_accstring_lookup (get_access_flags_from_decl (list)), lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list)))), fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class)))); free (fct_name); PATCH_METHOD_RETURN_ERROR (); } check_deprecation (wfl, list); is_static_flag = METHOD_STATIC (list); /* In the context of an explicit constructor invocation, we can't invoke any method relying on `this' */ if (ctxp->explicit_constructor_p && !is_static_flag && (!primary || primary == current_this)) { parse_error_context (wfl, "Can't reference `this' before the superclass constructor has " "been called"); PATCH_METHOD_RETURN_ERROR (); } java_parser_context_restore_global (); if (is_static) *is_static = is_static_flag; /* Sometimes, we want the decl of the selected method. Such as for EH checking */ if (ret_decl) *ret_decl = list; return patch_invoke (patch, list, args, super); } /* Check that we're not trying to do a static reference to a method in non static method. Return 1 if it's the case, 0 otherwise. */ static int check_for_static_method_reference (wfl, node, method, where, primary) tree wfl, node, method, where, primary; { if (METHOD_STATIC (current_function_decl) && !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node)) { char *fct_name = strdup (lang_printable_name (method, 0)); parse_error_context (wfl, "Can't make static reference to method `%s %s' in class `%s'", lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where)))); free (fct_name); return 1; } return 0; } /* Patch an invoke expression METHOD and ARGS, based on its invocation mode. */ static tree patch_invoke (patch, method, args, from_super) tree patch, method, args; int from_super; { int im; tree dtable, func; tree signature = build_java_signature (TREE_TYPE (method)); tree original_call, t, ta; /* Last step for args: convert build-in types. If we're dealing with a new TYPE() type call, the first argument to the constructor isn't found in the incomming argument list, but delivered by `new' */ t = TYPE_ARG_TYPES (TREE_TYPE (method)); if (TREE_CODE (patch) == NEW_CLASS_EXPR) t = TREE_CHAIN (t); for (ta = args; t && ta; t = TREE_CHAIN (t), ta = TREE_CHAIN (ta)) if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) && TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t)) TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta)); switch ((im = invocation_mode (method, from_super))) { case INVOKE_VIRTUAL: dtable = invoke_build_dtable (0, args); func = build_invokevirtual (dtable, method); break; case INVOKE_SUPER: case INVOKE_STATIC: func = build_known_method_ref (method, TREE_TYPE (method), DECL_CONTEXT (method), signature, args); break; case INVOKE_INTERFACE: dtable = invoke_build_dtable (1, args); func = build_invokeinterface (dtable, DECL_NAME (method), signature); break; default: fatal ("Unknown invocation mode `%d' - build_invoke", im); return NULL_TREE; } /* Ensure self_type is initialized, (invokestatic). FIXME */ func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func); TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method)); TREE_OPERAND (patch, 0) = func; TREE_OPERAND (patch, 1) = args; original_call = patch; /* We're processing a `new TYPE ()' form. New is called an its returned value is the first argument to the constructor. We build a COMPOUND_EXPR and use saved expression so that the overall NEW expression value is a pointer to a newly created and initialized class. */ if (TREE_CODE (original_call) == NEW_CLASS_EXPR) { tree class = DECL_CONTEXT (method); tree c1, saved_new, size, new; if (!TYPE_SIZE (class)) safe_layout_class (class); size = size_in_bytes (class); new = build (CALL_EXPR, promote_type (class), build_address_of (alloc_object_node), tree_cons (NULL_TREE, build_class_ref (class), build_tree_list (NULL_TREE, size_in_bytes (class))), NULL_TREE); saved_new = save_expr (new); c1 = build_tree_list (NULL_TREE, saved_new); TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1); TREE_OPERAND (original_call, 1) = c1; TREE_SET_CODE (original_call, CALL_EXPR); patch = build (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new); } return patch; } static int invocation_mode (method, super) tree method; int super; { int access = get_access_flags_from_decl (method); if (super) return INVOKE_SUPER; if (access & ACC_STATIC || access & ACC_FINAL) return INVOKE_STATIC; if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method)))) return INVOKE_STATIC; if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method)))) return INVOKE_INTERFACE; if (DECL_CONSTRUCTOR_P (method)) return INVOKE_STATIC; return INVOKE_VIRTUAL; } /* Retrieve a refined list of matching methods. It covers the step 15.11.2 (Compile-Time Step 2) */ static tree lookup_method_invoke (lc, cl, class, name, arg_list) int lc; tree cl; tree class, name, arg_list; { tree method = make_node (FUNCTION_TYPE); tree atl = NULL_TREE; /* Arg Type List */ tree signature, list, node; char *candidates; /* Used for error report */ /* Fix the arguments */ for (node = arg_list; node; node = TREE_CHAIN (node)) { tree current_arg = TREE_TYPE (TREE_VALUE (node)); if (TREE_CODE (current_arg) == RECORD_TYPE) current_arg = promote_type (current_arg); atl = tree_cons (NULL_TREE, current_arg, atl); } TYPE_ARG_TYPES (method) = atl; /* Find all candidates and then refine the list, searching for the most specific method. */ list = find_applicable_accessible_methods_list (lc, class, name, atl); list = find_most_specific_methods_list (list); if (list && !TREE_CHAIN (list)) return TREE_VALUE (list); /* Issue an error. List candidates if any. Candidates are listed only if accessible (non accessible methods may end-up here for the sake of a better error report). */ candidates = NULL; if (list) { tree current; obstack_grow (&temporary_obstack, ". Candidates are:\n", 18); for (current = list; current; current = TREE_CHAIN (current)) { tree cm = TREE_VALUE (current); char string [4096]; if (!cm || not_accessible_p (class, cm, 0)) continue; sprintf (string, " `%s' in `%s'%s", get_printable_method_name (cm), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))), (TREE_CHAIN (current) ? "\n" : "")); obstack_grow (&temporary_obstack, string, strlen (string)); } obstack_1grow (&temporary_obstack, '\0'); candidates = obstack_finish (&temporary_obstack); } /* Issue the error message */ signature = build_java_argument_signature (method); parse_error_context (cl, "Can't find %s `%s(%s)' in class `%s'%s", (lc ? "constructor" : "method"), (lc ? IDENTIFIER_POINTER(DECL_NAME (TYPE_NAME (class))) : IDENTIFIER_POINTER (name)), IDENTIFIER_POINTER (signature), IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class))), (candidates ? candidates : "")); return NULL_TREE; } /* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1 when we're looking for a constructor. */ static tree find_applicable_accessible_methods_list (lc, class, name, arglist) int lc; tree class, name, arglist; { tree method; tree list = NULL_TREE, all_list = NULL_TREE; while (class != NULL_TREE) { for (method = TYPE_METHODS (class); method != NULL_TREE; method = TREE_CHAIN (method)) { if (lc && !DECL_CONSTRUCTOR_P (method)) continue; else if (!lc && (DECL_CONSTRUCTOR_P (method) || DECL_NAME (method) != name)) continue; if (argument_types_convertible (method, arglist)) { /* Retain accessible methods only */ if (!not_accessible_p (class, method, 0)) list = tree_cons (NULL_TREE, method, list); else /* Also retain all selected method here */ all_list = tree_cons (NULL_TREE, method, list); } } /* When dealing with constructor, stop here, otherwise search other classes */ class = (lc ? NULL_TREE : CLASSTYPE_SUPER (class)); } /* Either return the list obtained or all selected (but inaccessible) methods for better error report. */ return (!list ? all_list : list); } /* 15.11.2.2 Choose the Most Specific Method */ static tree find_most_specific_methods_list (list) tree list; { int max = 0; tree current, new_list = NULL_TREE; for (current = list; current; current = TREE_CHAIN (current)) { tree method; DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0; for (method = list; method; method = TREE_CHAIN (method)) { /* Don't test a method against itself */ if (method == current) continue; /* Compare arguments and location where method where declared */ if (argument_types_convertible (TREE_VALUE (method), TREE_VALUE (current)) && valid_method_invocation_conversion_p (DECL_CONTEXT (TREE_VALUE (method)), DECL_CONTEXT (TREE_VALUE (current)))) { int v = ++DECL_SPECIFIC_COUNT (TREE_VALUE (current)); max = (v > max ? v : max); } } } /* Review the list and select the maximally specific methods */ for (current = list; current; current = TREE_CHAIN (current)) if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max) new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list); /* If we can't find one, lower expectations and try to gather multiple maximally specific methods */ while (!new_list) { while (--max > 0) { if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max) new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list); } return new_list; } return new_list; } /* Make sure that the type of each M2_OR_ARGLIST arguments can be converted by method invocation conversion (5.3) to the type of the corresponding parameter of M1. Implementation expects M2_OR_ARGLIST to change less often than M1. */ static int argument_types_convertible (m1, m2_or_arglist) tree m1, m2_or_arglist; { static tree m2_arg_value = NULL_TREE; static tree m2_arg_cache = NULL_TREE; register tree m1_arg, m2_arg; m1_arg = TYPE_ARG_TYPES (TREE_TYPE (m1)); if (!METHOD_STATIC (m1)) m1_arg = TREE_CHAIN (m1_arg); if (m2_arg_value == m2_or_arglist) m2_arg = m2_arg_cache; else { /* M2_OR_ARGLIST can be a function DECL or a raw list of argument types */ if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL) { m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist)); if (!METHOD_STATIC (m2_or_arglist)) m2_arg = TREE_CHAIN (m2_arg); } else m2_arg = m2_or_arglist; m2_arg_value = m2_or_arglist; m2_arg_cache = m2_arg; } while (m1_arg && m2_arg) { if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg), TREE_VALUE (m2_arg))) break; m1_arg = TREE_CHAIN (m1_arg); m2_arg = TREE_CHAIN (m2_arg); } return (!m1_arg && !m2_arg ? 1 : 0); } /* Qualification routines */ static void qualify_ambiguous_name (id) tree id; { tree qual, qual_wfl, name, decl, ptr_type, saved_current_class; int again, super_found = 0, this_found = 0; /* We first qualify the first element, then derive qualification of others based on the first one. If the first element is qualified by a resolution (field or type), this resolution is stored in the QUAL_RESOLUTION of the qual element being examined. We need to save the current_class since the use of SUPER might change the its value. */ saved_current_class = current_class; qual = EXPR_WFL_QUALIFICATION (id); do { /* Simple qualified expression feature a qual_wfl that is a WFL. Expression derived from a primary feature more complicated things like a CALL_EXPR. Expression from primary need to be worked out to extract the part on which the qualification will take place. */ qual_wfl = QUAL_WFL (qual); switch (TREE_CODE (qual_wfl)) { case CALL_EXPR: qual_wfl = TREE_OPERAND (qual_wfl, 0); if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION) { qual = EXPR_WFL_QUALIFICATION (qual_wfl); qual_wfl = QUAL_WFL (qual); } break; case NEW_CLASS_EXPR: case CONVERT_EXPR: qual_wfl = TREE_OPERAND (qual_wfl, 0); break; case ARRAY_REF: while (TREE_CODE (qual_wfl) == ARRAY_REF) qual_wfl = TREE_OPERAND (qual_wfl, 0); break; default: /* Fix for -Wall. Just break doing nothing */ break; } name = EXPR_WFL_NODE (qual_wfl); ptr_type = current_class; again = 0; /* If we have a THIS (from a primary), we set the context accordingly */ if (name == this_identifier_node) { qual = TREE_CHAIN (qual); qual_wfl = QUAL_WFL (qual); if (TREE_CODE (qual_wfl) == CALL_EXPR) again = 1; else name = EXPR_WFL_NODE (qual_wfl); this_found = 1; } /* If we have a SUPER, we set the context accordingly */ if (name == super_identifier_node) { current_class = CLASSTYPE_SUPER (ptr_type); /* Check that there is such a thing as a super class. If not, return. The error will be caught later on, during the resolution */ if (!current_class) { current_class = saved_current_class; return; } qual = TREE_CHAIN (qual); /* Do one more interation to set things up */ super_found = again = 1; } /* Loop one more time if we're dealing with ?: or a string constant */ if (TREE_CODE (qual_wfl) == CONDITIONAL_EXPR || TREE_CODE (qual_wfl) == STRING_CST) { qual = TREE_CHAIN (qual); qual_wfl = QUAL_WFL (qual); again = 1; } } while (again); /* If name appears within the scope of a location variable declaration or parameter declaration, then it is an expression name. We don't carry this test out if we're in the context of the use of SUPER or THIS */ if (!this_found && !super_found && (decl = IDENTIFIER_LOCAL_VALUE (name))) { RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1; QUAL_RESOLUTION (qual) = decl; } /* If within the class/interface NAME was found to be used there exists a (possibly inherited) field named NAME, then this is an expression name. */ else if ((decl = lookup_field_wrapper (ptr_type, name))) { RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1; QUAL_RESOLUTION (qual) = decl; } /* We reclassify NAME as a type name if: - NAME is a class/interface declared within the compilation unit containing NAME, - NAME is imported via a single-type-import declaration, - NAME is declared in an another compilation unit of the package of the compilation unit containing NAME, - NAME is declared by exactly on type-import-on-demand declaration of the compilation unit containing NAME. */ else if ((decl = resolve_and_layout (name, NULL_TREE))) { RESOLVE_TYPE_NAME_P (qual_wfl) = 1; QUAL_RESOLUTION (qual) = decl; } /* Method call are expression name */ else if (TREE_CODE (QUAL_WFL (qual)) == CALL_EXPR) RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1; /* Check here that NAME isn't declared by more than one type-import-on-demand declaration of the compilation unit containing NAME. FIXME */ /* Otherwise, NAME is reclassified as a package name */ else RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1; /* Propagate the qualification accross other components of the qualified name */ for (qual = TREE_CHAIN (qual); qual; qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual)) { if (RESOLVE_PACKAGE_NAME_P (qual_wfl)) RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1; else RESOLVE_EXPRESSION_NAME_P (QUAL_WFL (qual)) = 1; } /* Store the global qualification for the ambiguous part of ID back into ID fields */ if (RESOLVE_EXPRESSION_NAME_P (qual_wfl)) RESOLVE_EXPRESSION_NAME_P (id) = 1; else if (RESOLVE_TYPE_NAME_P (qual_wfl)) RESOLVE_TYPE_NAME_P (id) = 1; else if (RESOLVE_PACKAGE_NAME_P (qual_wfl)) RESOLVE_PACKAGE_NAME_P (id) = 1; /* Restore the current class */ current_class = saved_current_class; } static int breakdown_qualified (left, right, source) tree *left, *right, source; { char *p = IDENTIFIER_POINTER (source), *base; int l = IDENTIFIER_LENGTH (source); /* Breakdown NAME into REMAINDER . IDENTIFIER */ base = p; p += (l-1); while (*p != '.' && p != base) p--; /* We didn't find a '.'. Return an error */ if (p == base) return 1; *p = '\0'; if (right) *right = get_identifier (p+1); *left = get_identifier (IDENTIFIER_POINTER (source)); *p = '.'; return 0; } static int not_initialized_as_it_should_p (decl) tree decl; { if (DECL_P (decl)) { if (FIELD_FINAL (decl)) return 0; if (TREE_CODE (decl) == FIELD_DECL && (METHOD_STATIC (current_function_decl))) return 0; return DECL_P (decl) && !INITIALIZED_P (decl); } return 0; } /* Patch tree nodes in a function body. When a BLOCK is found, push local variable decls if present. */ static tree java_complete_tree (node) tree node; { tree nn, cn, wfl_op1, wfl_op2, wfl_op3; int flag; /* CONVERT_EXPR always has its type set, even though it needs to be worked out. */ if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR) return node; /* The switch block implements cases processing container nodes first. Contained nodes are always written back. Leaves come next and return a value. */ switch (TREE_CODE (node)) { case BLOCK: /* 1- Block section. Set the local values on decl names so we can identify them faster when they're referenced. At that stage, identifiers are legal so we don't check for declaration errors. */ for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn)) { DECL_CONTEXT (cn) = current_function_decl; IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn; INITIALIZED_P (cn) = 0; } if (BLOCK_EXPR_BODY (node)) { BLOCK_EXPR_BODY (node) = java_complete_tree (BLOCK_EXPR_BODY (node)); if (BLOCK_EXPR_BODY (node) == error_mark_node) return error_mark_node; } /* Turn local bindings to null */ for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn)) IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE; TREE_TYPE (node) = void_type_node; break; /* 2- They are expressions but ultimately deal with statements */ case THROW_EXPR: wfl_op1 = TREE_OPERAND (node, 0); COMPLETE_CHECK_OP_0 (node); return patch_throw_statement (node, wfl_op1); case SYNCHRONIZED_EXPR: wfl_op1 = TREE_OPERAND (node, 0); COMPLETE_CHECK_OP_0 (node); COMPLETE_CHECK_OP_1 (node); return patch_synchronized_statement (node, wfl_op1); case TRY_EXPR: return patch_try_statement (node); case LABELED_BLOCK_EXPR: PUSH_LABELED_BLOCK (node); if (LABELED_BLOCK_BODY (node)) COMPLETE_CHECK_OP_1 (node); TREE_TYPE (node) = void_type_node; POP_LABELED_BLOCK (); return node; case EXIT_BLOCK_EXPR: /* We don't complete operand 1, because it's the return value of the EXIT_BLOCK_EXPR which doesn't exist it Java */ return patch_bc_statement (node); case SWITCH_EXPR: case LOOP_EXPR: PUSH_LOOP (node); /* Check whether the loop was enclosed in a labeled statement. If not, create one, insert the loop in it and return the node */ nn = patch_loop_statement (node); /* Anyways, walk the body of the loop */ if (TREE_CODE (node) == LOOP_EXPR) TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0)); /* Switch statement: walk the switch expression and the cases */ else node = patch_switch_statement (node); if (TREE_OPERAND (node, 0) == error_mark_node) return error_mark_node; TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node; /* If we returned something different, that's because we inserted a label. Pop the label too. */ if (nn != node) POP_LABELED_BLOCK (); POP_LOOP (); return nn; case EXIT_EXPR: TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0)); return patch_exit_expr (node); case COND_EXPR: /* Condition */ TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0)); if (TREE_OPERAND (node, 0) == error_mark_node) return error_mark_node; /* then-else branches */ TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1)); if (TREE_OPERAND (node, 1) == error_mark_node) return error_mark_node; TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2)); if (TREE_OPERAND (node, 2) == error_mark_node) return error_mark_node; return patch_if_else_statement (node); break; case CONDITIONAL_EXPR: /* Condition */ wfl_op1 = TREE_OPERAND (node, 0); COMPLETE_CHECK_OP_0 (node); wfl_op2 = TREE_OPERAND (node, 1); COMPLETE_CHECK_OP_1 (node); wfl_op3 = TREE_OPERAND (node, 2); COMPLETE_CHECK_OP_2 (node); return patch_conditional_expr (node, wfl_op1, wfl_op2); /* 3- Expression section */ case COMPOUND_EXPR: TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0)); TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1)); if (TREE_OPERAND (node, 1) == error_mark_node) return error_mark_node; TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1)); break; case RETURN_EXPR: return patch_return (node); case EXPR_WITH_FILE_LOCATION: if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */ || TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE) return resolve_expression_name (node, NULL); else { EXPR_WFL_NODE (node) = java_complete_tree (EXPR_WFL_NODE (node)); TREE_SIDE_EFFECTS (node) = 1; if (EXPR_WFL_NODE (node) == error_mark_node) { /* Its important for the evaluation of assignment that this mark on the TREE_TYPE is propagated. */ TREE_TYPE (node) = error_mark_node; return error_mark_node; } else TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node)); } break; case NEW_ARRAY_EXPR: /* Patch all the dimensions */ flag = 0; for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn)) { int location = EXPR_WFL_LINECOL (TREE_VALUE (cn)); tree dim = java_complete_tree (TREE_VALUE (cn)); if (dim == error_mark_node) { flag = 1; continue; } else { TREE_VALUE (cn) = dim; /* Setup the location of the current dimension, for later error report. */ TREE_PURPOSE (cn) = build_expr_wfl (NULL_TREE, input_filename, 0, 0); EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location; } } /* They complete the array creation expression, if no errors were found. */ return (flag ? error_mark_node : patch_newarray (node)); case NEW_CLASS_EXPR: case CALL_EXPR: /* Complete function's argument(s) first */ if (complete_function_arguments (node)) return error_mark_node; else { tree decl, wfl = TREE_OPERAND (node, 0); int in_this = CALL_THIS_CONSTRUCTOR_P (node); node = patch_method_invocation_stmt (node, NULL_TREE, NULL_TREE, 0, &decl, 0); if (node != error_mark_node) { check_thrown_exceptions (EXPR_WFL_LINECOL (node), decl); /* If we call this(...), register signature and positions */ if (in_this) DECL_CONSTRUCTOR_CALLS (current_function_decl) = tree_cons (wfl, decl, DECL_CONSTRUCTOR_CALLS (current_function_decl)); } return node; } case MODIFY_EXPR: /* Save potential wfls */ wfl_op1 = TREE_OPERAND (node, 0); wfl_op2 = TREE_OPERAND (node, 1); TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1); if (TREE_OPERAND (node, 0) == error_mark_node) return error_mark_node; if (COMPOUND_ASSIGN_P (wfl_op2)) { tree lvalue; tree other = java_complete_tree (TREE_OPERAND (wfl_op2, 0)); /* Hand stablize the lhs on both places */ lvalue = stabilize_reference (other); TREE_OPERAND (node, 0) = lvalue; TREE_OPERAND (TREE_OPERAND (node, 1), 0) = lvalue; } /* There are cases where the type of RHS is fixed. In those cases, if the evaluation of the RHS fails, we further the evaluation of the assignment to detect more errors. */ nn = java_complete_tree (TREE_OPERAND (node, 1)); if (nn == error_mark_node) { /* It's hopeless, but we can further things on to discover an error during the assignment. In any cases, the assignment operation fails. */ if (TREE_CODE (TREE_OPERAND (node, 1)) != EXPR_WITH_FILE_LOCATION && TREE_TYPE (TREE_OPERAND (node, 1)) != error_mark_node && TREE_TYPE (TREE_OPERAND (node, 1))) patch_assignment (node, wfl_op1, wfl_op2); /* Now, we still mark the lhs as initialized */ if (DECL_P (TREE_OPERAND (node, 0))) INITIALIZED_P (TREE_OPERAND (node, 0)) = 1; return error_mark_node; } TREE_OPERAND (node, 1) = nn; /* In case we're handling = with a String as a RHS, we need to produce a String out of the RHS (it might still be a STRING_CST or a StringBuffer at this stage */ if ((nn = patch_string (TREE_OPERAND (node, 1)))) TREE_OPERAND (node, 1) = nn; return patch_assignment (node, wfl_op1, wfl_op2); case MULT_EXPR: case PLUS_EXPR: case MINUS_EXPR: case LSHIFT_EXPR: case RSHIFT_EXPR: case URSHIFT_EXPR: case BIT_AND_EXPR: case BIT_XOR_EXPR: case BIT_IOR_EXPR: case TRUNC_MOD_EXPR: case RDIV_EXPR: case TRUTH_ANDIF_EXPR: case TRUTH_ORIF_EXPR: case EQ_EXPR: case NE_EXPR: case GT_EXPR: case GE_EXPR: case LT_EXPR: case LE_EXPR: /* Operands 0 and 1 are WFL in certain cases only. patch_binop knows how to handle those cases. */ wfl_op1 = TREE_OPERAND (node, 0); wfl_op2 = TREE_OPERAND (node, 1); /* Don't complete string nodes if dealing with the PLUS operand. */ if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1)) { TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1); if (TREE_OPERAND (node, 0) == error_mark_node) return error_mark_node; } if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2)) { TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2); if (TREE_OPERAND (node, 1) == error_mark_node) return error_mark_node; } return patch_binop (node, wfl_op1, wfl_op2); case INSTANCEOF_EXPR: wfl_op1 = TREE_OPERAND (node, 0); COMPLETE_CHECK_OP_0 (node); return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1)); case UNARY_PLUS_EXPR: case NEGATE_EXPR: case TRUTH_NOT_EXPR: case BIT_NOT_EXPR: case PREDECREMENT_EXPR: case PREINCREMENT_EXPR: case POSTDECREMENT_EXPR: case POSTINCREMENT_EXPR: case CONVERT_EXPR: /* There are cases were wfl_op1 is a WFL. patch_unaryop knows how to handle those cases. */ wfl_op1 = TREE_OPERAND (node, 0); TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1); if (TREE_OPERAND (node, 0) == error_mark_node) return error_mark_node; return patch_unaryop (node, wfl_op1); case ARRAY_REF: /* There are cases were wfl_op1 is a WFL. patch_array_ref knows how to handle those cases. */ wfl_op1 = TREE_OPERAND (node, 0); TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1); if (TREE_OPERAND (node, 0) == error_mark_node) return error_mark_node; if (!flag_emit_class_files) TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0)); /* The same applies to wfl_op2 */ wfl_op2 = TREE_OPERAND (node, 1); TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2); if (TREE_OPERAND (node, 1) == error_mark_node) return error_mark_node; if (!flag_emit_class_files) TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1)); return patch_array_ref (node, wfl_op1, wfl_op2); case THIS_EXPR: /* Can't use THIS in a static environment */ if (!current_this) { EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); parse_error_context (wfl_operator, "Keyword `this' used outside " "allowed context"); TREE_TYPE (node) = error_mark_node; return error_mark_node; } if (ctxp->explicit_constructor_p) { EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); parse_error_context (wfl_operator, "Can't reference `this' or `super' before the " "superclass constructor has been called"); TREE_TYPE (node) = error_mark_node; return error_mark_node; } return current_this; default: /* Ok: may be we have a STRING_CST or a crafted `StringBuffer' and it's time to turn it into the appropriate String object */ if ((node = patch_string (node))) return node; fatal ("No case for tree code `%s' - java_complete_tree\n", tree_code_name [TREE_CODE (node)]); } return node; } /* Complete function call's argument. Return a non zero value is an error was found. */ static int complete_function_arguments (node) tree node; { int flag = 0; tree cn; ctxp->explicit_constructor_p += (CALL_THIS_CONSTRUCTOR_P (node) ? 1 : 0); for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn)) { tree wfl = TREE_VALUE (cn), parm, temp; parm = java_complete_tree (wfl); if (parm == error_mark_node) { flag = 1; continue; } /* If have a string literal that we haven't transformed yet or a crafted string buffer, as a result of use of the the String `+' operator. Build `parm.toString()' and expand it. */ if ((temp = patch_string (parm))) parm = temp; /* Inline PRIMTYPE.TYPE read access */ parm = maybe_build_primttype_type_ref (parm, wfl); TREE_VALUE (cn) = parm; if (not_initialized_as_it_should_p (parm)) { ERROR_VARIABLE_NOT_INITIALIZED (wfl, EXPR_WFL_NODE (wfl)); INITIALIZED_P (parm) = 1; } } ctxp->explicit_constructor_p -= (CALL_THIS_CONSTRUCTOR_P (node) ? 1 : 0); return flag; } /* Sometimes (for loops and variable initialized during their declaration), we want to wrap a statement around a WFL and turn it debugable. */ static tree build_debugable_stmt (location, stmt) int location; tree stmt; { if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION) { stmt = build_expr_wfl (stmt, input_filename, 0, 0); EXPR_WFL_LINECOL (stmt) = location; } JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt); return stmt; } static tree build_expr_block (body, decls) tree body, decls; { tree node = make_node (BLOCK); BLOCK_EXPR_DECLS (node) = decls; BLOCK_EXPR_BODY (node) = body; if (body) TREE_TYPE (node) = TREE_TYPE (body); TREE_SIDE_EFFECTS (node) = 1; return node; } /* Create a new function block and link it approriately to current function block chain */ static tree enter_block () { return (enter_a_block (build_expr_block (NULL_TREE, NULL_TREE))); } /* Link block B supercontext to the previous block. The current function DECL is used as supercontext when enter_a_block is called for the first time for a given function. The current function body (DECL_FUNCTION_BODY) is set to be block B. */ static tree enter_a_block (b) tree b; { tree fndecl = current_function_decl; if (!DECL_FUNCTION_BODY (fndecl)) { BLOCK_SUPERCONTEXT (b) = fndecl; DECL_FUNCTION_BODY (fndecl) = b; } else { BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl); DECL_FUNCTION_BODY (fndecl) = b; } return b; } /* Exit a block by changing the current function body (DECL_FUNCTION_BODY) to the current block super context, only if the block being exited isn't the method's top level one. */ static tree exit_block () { tree b = DECL_FUNCTION_BODY (current_function_decl); if (BLOCK_SUPERCONTEXT (b) != current_function_decl) DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b); return b; } /* Lookup for NAME in the nested function's blocks, all the way up to the current toplevel one. It complies with Java's local variable scoping rules. */ static tree lookup_name_in_blocks (name) tree name; { tree b = DECL_FUNCTION_BODY (current_function_decl); while (b != current_function_decl) { tree current; /* Paranoid sanity check. To be removed */ if (TREE_CODE (b) != BLOCK) fatal ("non block expr function body - lookup_name_in_blocks"); for (current = BLOCK_EXPR_DECLS (b); current; current = TREE_CHAIN (current)) if (DECL_NAME (current) == name) return current; b = BLOCK_SUPERCONTEXT (b); } return NULL_TREE; } static void maybe_absorb_scoping_blocks () { while (BLOCK_EXPR_ORIGIN (DECL_FUNCTION_BODY (current_function_decl))) { tree b = exit_block (); java_method_add_stmt (current_function_decl, b); SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", lineno)); } } /* This section of the source is reserved to build_* functions that are building incomplete tree nodes and the patch_* functions that are completing them. */ /* Build a super() constructor invocation. Returns size_zero_node if we're currently dealing with the class java.lang.Object. */ static tree build_super_invocation () { if (current_class == object_type_node) return size_zero_node; else { tree super_wfl = build_wfl_node (super_identifier_node, input_filename, 0, 0); return build_method_invocation (super_wfl, NULL_TREE); } } /* Build a SUPER/THIS qualified method invocation. */ static tree build_this_super_qualified_invocation (use_this, name, args, lloc, rloc) int use_this; tree name, args; int lloc, rloc; { tree invok; tree wfl = build_wfl_node ((use_this ? this_identifier_node : super_identifier_node), input_filename, 0, 0); EXPR_WFL_LINECOL (wfl) = lloc; invok = build_method_invocation (name, args); return make_qualified_primary (wfl, invok, rloc); } /* Build an incomplete CALL_EXPR node. */ static tree build_method_invocation (name, args) tree name; tree args; { tree call = build (CALL_EXPR, NULL_TREE, name, args, NULL_TREE); TREE_SIDE_EFFECTS (call) = 1; EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name); return call; } /* Build an incomplete new xxx(...) node. */ static tree build_new_invocation (name, args) tree name, args; { tree call = build (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE); TREE_SIDE_EFFECTS (call) = 1; EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name); return call; } /* Build an incomplete assignment expression. */ static tree build_assignment (op, op_location, lhs, rhs) int op, op_location; tree lhs, rhs; { tree assignment; /* Build the corresponding binop if we deal with a Compound Assignment operator. Mark the binop sub-tree as part of a Compound Assignment expression */ if (op != ASSIGN_TK) { rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs); COMPOUND_ASSIGN_P (rhs) = 1; } assignment = build (MODIFY_EXPR, NULL_TREE, lhs, rhs); TREE_SIDE_EFFECTS (assignment) = 1; EXPR_WFL_LINECOL (assignment) = op_location; return assignment; } /* Print an INTEGER_CST node in a static buffer, and return the buffer. */ static char * print_int_node (node) tree node; { static char buffer [80]; if (TREE_CONSTANT_OVERFLOW (node)) sprintf (buffer, ""); if (TREE_INT_CST_HIGH (node) == 0) sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED, TREE_INT_CST_LOW (node)); else if (TREE_INT_CST_HIGH (node) == -1 && TREE_INT_CST_LOW (node) != 0) { buffer [0] = '-'; sprintf (&buffer [1], HOST_WIDE_INT_PRINT_UNSIGNED, -TREE_INT_CST_LOW (node)); } else sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX, TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node)); return buffer; } /* Return 1 if you an assignment of a FINAL is attempted */ static int check_final_assignment (lvalue, wfl) tree lvalue, wfl; { if (DECL_P (lvalue) && FIELD_FINAL (lvalue)) { parse_error_context (wfl, "Can't assign a value to the final variable `%s'", IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl))); return 1; } return 0; } /* Inline references to java.lang.PRIMTYPE.TYPE when accessed in read. This is needed to avoid circularities in the implementation of these fields in libjava. */ static tree maybe_build_primttype_type_ref (rhs, wfl) tree rhs, wfl; { tree to_return = NULL_TREE; tree rhs_type = TREE_TYPE (rhs); if (TREE_CODE (rhs) == COMPOUND_EXPR) { tree n = TREE_OPERAND (rhs, 1); if (TREE_CODE (n) == VAR_DECL && DECL_NAME (n) == TYPE_identifier_node && rhs_type == class_ptr_type) { char *self_name = IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)); if (!strncmp (self_name, "java.lang.", 10)) to_return = build_primtype_type_ref (self_name); } } return (to_return ? to_return : rhs ); } /* 15.25 Assignment operators. */ static tree patch_assignment (node, wfl_op1, wfl_op2) tree node; tree wfl_op1; tree wfl_op2; { tree rhs = TREE_OPERAND (node, 1); tree lvalue = TREE_OPERAND (node, 0), llvalue; tree lhs_type, rhs_type, new_rhs = NULL_TREE; int error_found = 0; int lvalue_from_array = 0; /* Can't assign to a final. */ if (check_final_assignment (lvalue, wfl_op1)) error_found = 1; EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); /* Lhs can be a named variable */ if (DECL_P (lvalue)) { INITIALIZED_P (lvalue) = 1; lhs_type = TREE_TYPE (lvalue); } /* Or Lhs can be a array acccess. Should that be lvalue ? FIXME + comment on reason why */ else if (TREE_CODE (wfl_op1) == ARRAY_REF) { lhs_type = TREE_TYPE (lvalue); lvalue_from_array = 1; } /* Or a field access */ else if (TREE_CODE (lvalue) == COMPONENT_REF) lhs_type = TREE_TYPE (lvalue); /* Or a function return slot */ else if (TREE_CODE (lvalue) == RESULT_DECL) lhs_type = TREE_TYPE (lvalue); /* Otherwise, we might want to try to write into an optimized static final, this is an of a different nature, reported further on. */ else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION && resolve_expression_name (wfl_op1, &llvalue) && check_final_assignment (llvalue, wfl_op1)) { error_found = 1; /* What we should do instead is resetting the all the flags previously set, exchange lvalue for llvalue and continue. */ return error_mark_node; } else { parse_error_context (wfl_op1, "Invalid left hand side of assignment"); error_found = 1; } rhs_type = TREE_TYPE (rhs); /* 5.1 Try the assignment conversion for builtin type. */ new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs); /* 5.2 If it failed, try a reference conversion */ if (!new_rhs && (new_rhs = try_reference_assignconv (lhs_type, rhs))) lhs_type = promote_type (rhs_type); /* 15.25.2 If we have a compound assignment, convert RHS into the type of the LHS */ else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1))) new_rhs = convert (lhs_type, rhs); /* Explicit cast required. This is an error */ if (!new_rhs) { char *t1 = strdup (lang_printable_name (TREE_TYPE (rhs), 0)); char *t2 = strdup (lang_printable_name (lhs_type, 0)); tree wfl; char operation [32]; /* Max size known */ /* If the assignment is part of a declaration, we use the WFL of the declared variable to point out the error and call it a declaration problem. If the assignment is a genuine = operator, we call is a operator `=' problem, otherwise we call it an assignment problem. In both of these last cases, we use the WFL of the operator to indicate the error. */ if (MODIFY_EXPR_FROM_INITIALIZATION_P (node)) { wfl = wfl_op1; strcpy (operation, "declaration"); } else { wfl = wfl_operator; if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1))) strcpy (operation, "assignment"); else if (TREE_CODE (TREE_OPERAND (node, 0)) == RESULT_DECL) strcpy (operation, "`return'"); else strcpy (operation, "`='"); } parse_error_context (wfl, (!valid_cast_to_p (rhs_type, lhs_type) ? "Incompatible type for %s. Can't convert `%s' to `%s'" : "Incompatible type for %s. Explicit cast " "needed to convert `%s' to `%s'"), operation, t1, t2); free (t1); free (t2); error_found = 1; } /* Before reporting type incompatibility errors, check that the rhs is initialized, if a variable */ if (not_initialized_as_it_should_p (rhs)) { ERROR_VARIABLE_NOT_INITIALIZED (wfl_op2, DECL_NAME (rhs)); INITIALIZED_P (rhs) = 1; } /* Inline read access to java.lang.PRIMTYPE.TYPE */ rhs = maybe_build_primttype_type_ref (rhs, wfl_op2); if (TREE_CODE (rhs) == COMPOUND_EXPR) { tree n = TREE_OPERAND (rhs, 1); if (TREE_CODE (n) == VAR_DECL && DECL_NAME (n) == TYPE_identifier_node && rhs_type == class_ptr_type) { char *self_name = IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl_op2)); if (!strncmp (self_name, "java.lang.", 10)) rhs = build_primtype_type_ref (self_name); } } if (error_found) return error_mark_node; /* If we built a compound expression as the result of a reference assignment into an array element, return it here. */ if (TREE_CODE (node) == COMPOUND_EXPR) return node; TREE_OPERAND (node, 0) = lvalue; TREE_OPERAND (node, 1) = new_rhs; TREE_TYPE (node) = lhs_type; return node; } /* Check that type SOURCE can be cast into type DEST. If the cast can't occur at all, return 0 otherwise 1. This function is used to produce accurate error messages on the reasons why an assignment failed. */ static tree try_reference_assignconv (lhs_type, rhs) tree lhs_type, rhs; { tree new_rhs = NULL_TREE; tree rhs_type = TREE_TYPE (rhs); if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type)) { /* `null' may be assigned to any reference type */ if (rhs == null_pointer_node) new_rhs = null_pointer_node; /* Try the reference assignment conversion */ else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0)) new_rhs = rhs; /* This is a magic assignment that we process differently */ else if (rhs == soft_exceptioninfo_call_node) new_rhs = rhs; } return new_rhs; } /* Check that RHS can be converted into LHS_TYPE by the assignment conversion (5.2), for the cases of RHS being a builtin type. Return NULL_TREE if the conversion fails or if because RHS isn't of a builtin type. Return a converted RHS if the conversion is possible. */ static tree try_builtin_assignconv (wfl_op1, lhs_type, rhs) tree wfl_op1, lhs_type, rhs; { tree new_rhs = NULL_TREE; tree rhs_type = TREE_TYPE (rhs); /* Zero accepted everywhere */ if (TREE_CODE (rhs) == INTEGER_CST && TREE_INT_CST_HIGH (rhs) == 0 && TREE_INT_CST_LOW (rhs) == 0 && JPRIMITIVE_TYPE_P (rhs_type)) new_rhs = convert (lhs_type, rhs); /* 5.1.1 Try Identity Conversion, 5.1.2 Try Widening Primitive Conversion */ else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type)) new_rhs = convert (lhs_type, rhs); /* Try a narrowing primitive conversion (5.1.3): - expression is a constant expression of type int AND - variable is byte, short or char AND - The value of the expression is representable in the type of the variable */ else if (rhs_type == int_type_node && TREE_CONSTANT (rhs) && (lhs_type == byte_type_node || lhs_type == char_type_node || lhs_type == short_type_node)) { if (int_fits_type_p (rhs, lhs_type)) new_rhs = convert (lhs_type, rhs); else if (wfl_op1) /* Might be called with a NULL */ parse_warning_context (wfl_op1, "Constant expression `%s' to wide for narrowing " "primitive conversion to `%s'", print_int_node (rhs), lang_printable_name (lhs_type, 0)); /* Reported a warning that will turn into an error further down, so we don't return */ } return new_rhs; } /* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity conversion (5.1.1) or widening primitve conversion (5.1.2). Return 0 is the conversion test fails. This implements parts the method invocation convertion (5.3). */ static int valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type) tree lhs_type, rhs_type; { int all_primitive; if (lhs_type == rhs_type) return 1; all_primitive = JPRIMITIVE_TYPE_P (lhs_type) && JPRIMITIVE_TYPE_P (rhs_type); if (!all_primitive) return 0; /* byte, even if it's smaller than a char can't be converted into a char. Short can't too, but the < test below takes care of that */ if (lhs_type == char_type_node && rhs_type == byte_type_node) return 0; /* Accept all promoted type here. Note, we can't use <= in the test below, because we still need to bounce out assignments of short to char and the likes */ if (lhs_type == int_type_node && (rhs_type == promoted_byte_type_node || rhs_type == promoted_short_type_node || rhs_type == promoted_char_type_node || rhs_type == promoted_boolean_type_node)) return 1; if (JINTEGRAL_TYPE_P (rhs_type) && ((TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)) || (JFLOAT_TYPE_P (lhs_type) && TYPE_PRECISION (rhs_type) == TYPE_PRECISION (lhs_type)))) return 1; else if (JFLOAT_TYPE_P (rhs_type) && (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type))) return 1; return 0; } /* Check that something of SOURCE type can be assigned or cast to something of DEST type at runtime. Return 1 if the operation is valid, 0 otherwise. If CAST is set to 1, we're treating the case were SOURCE is cast into DEST, which borrows a lot of the assignment check. */ static int valid_ref_assignconv_cast_p (source, dest, cast) tree source; tree dest; int cast; { if (JNULLP_TYPE_P (source)) return 1; if (TREE_CODE (source) == POINTER_TYPE) source = TREE_TYPE (source); if (TREE_CODE (dest) == POINTER_TYPE) dest = TREE_TYPE (dest); /* Case where SOURCE is a class type */ if (TYPE_CLASS_P (source)) { if (TYPE_CLASS_P (dest)) return source == dest || inherits_from_p (source, dest) || (cast && inherits_from_p (dest, source)); if (TYPE_INTERFACE_P (dest)) { /* If doing a cast and SOURCE is final, the operation is always correct a compile time (because even if SOURCE does not implement DEST, a subclass of SOURCE might). */ if (cast && !CLASS_FINAL (TYPE_NAME (source))) return 1; /* Otherwise, SOURCE must implement DEST */ return interface_of_p (dest, source); } /* DEST is an array, cast permited if SOURCE is of Object type */ return (cast && source == object_type_node ? 1 : 0); } if (TYPE_INTERFACE_P (source)) { if (TYPE_CLASS_P (dest)) { /* If not casting, DEST must be the Object type */ if (!cast) return dest == object_type_node; /* We're doing a cast. The cast is always valid is class DEST is not final, otherwise, DEST must implement SOURCE */ else if (!CLASS_FINAL (TYPE_NAME (dest))) return 1; else return interface_of_p (source, dest); } if (TYPE_INTERFACE_P (dest)) { /* If doing a cast, then if SOURCE and DEST contain method with the same signature but different return type, then this is a (compile time) error */ if (cast) { tree method_source, method_dest; tree source_type; tree source_sig; tree source_name; for (method_source = TYPE_METHODS (source); method_source; method_source = TREE_CHAIN (method_source)) { source_sig = build_java_argument_signature (TREE_TYPE (method_source)); source_type = TREE_TYPE (TREE_TYPE (method_source)); source_name = DECL_NAME (method_source); for (method_dest = TYPE_METHODS (dest); method_dest; method_dest = TREE_CHAIN (method_dest)) if (source_sig == build_java_argument_signature (TREE_TYPE (method_dest)) && source_name == DECL_NAME (method_dest) && source_type != TREE_TYPE (TREE_TYPE (method_dest))) return 0; } return 1; } else return source == dest || interface_of_p (dest, source); } else /* Array */ return 0; } if (TYPE_ARRAY_P (source)) { if (TYPE_CLASS_P (dest)) return dest == object_type_node; if (TYPE_INTERFACE_P (dest)) return 0; /* Install test on Clonable. FIXME */ else /* Arrays */ { tree source_element_type = TYPE_ARRAY_ELEMENT (source); tree dest_element_type = TYPE_ARRAY_ELEMENT (dest); /* In case of severe errors, they turn out null */ if (!dest_element_type || !source_element_type) return 0; if (source_element_type == dest_element_type) return 1; return valid_ref_assignconv_cast_p (source_element_type, dest_element_type, cast); } return 0; } return 0; } static int valid_cast_to_p (source, dest) tree source; tree dest; { if (TREE_CODE (source) == POINTER_TYPE) source = TREE_TYPE (source); if (TREE_CODE (dest) == POINTER_TYPE) dest = TREE_TYPE (dest); if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE) return valid_ref_assignconv_cast_p (source, dest, 1); else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest)) return 1; return 0; } /* Method invocation conversion test. Return 1 if type SOURCE can be converted to type DEST through the methond invocation conversion process (5.3) */ static int valid_method_invocation_conversion_p (dest, source) tree dest, source; { return ((JPRIMITIVE_TYPE_P (source) && JPRIMITIVE_TYPE_P (dest) && valid_builtin_assignconv_identity_widening_p (dest, source)) || ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source)) && (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest)) && valid_ref_assignconv_cast_p (source, dest, 0))); } /* Build an incomplete binop expression. */ static tree build_binop (op, op_location, op1, op2) enum tree_code op; int op_location; tree op1, op2; { tree binop = build (op, NULL_TREE, op1, op2); TREE_SIDE_EFFECTS (binop) = 1; /* Store the location of the operator, for better error report. The string of the operator will be rebuild based on the OP value. */ EXPR_WFL_LINECOL (binop) = op_location; return binop; } /* Build the string of the operator retained by NODE. If NODE is part of a compound expression, add an '=' at the end of the string. This function is called when an error needs to be reported on an operator. The string is returned as a pointer to a static character buffer. */ static char * operator_string (node) tree node; { #define BUILD_OPERATOR_STRING(S) \ { \ sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \ return buffer; \ } static char buffer [10]; switch (TREE_CODE (node)) { case MULT_EXPR: BUILD_OPERATOR_STRING ("*"); case RDIV_EXPR: BUILD_OPERATOR_STRING ("/"); case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%"); case PLUS_EXPR: BUILD_OPERATOR_STRING ("+"); case MINUS_EXPR: BUILD_OPERATOR_STRING ("-"); case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<"); case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>"); case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>"); case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&"); case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^"); case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|"); case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&"); case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||"); case EQ_EXPR: BUILD_OPERATOR_STRING ("=="); case NE_EXPR: BUILD_OPERATOR_STRING ("!="); case GT_EXPR: BUILD_OPERATOR_STRING (">"); case GE_EXPR: BUILD_OPERATOR_STRING (">="); case LT_EXPR: BUILD_OPERATOR_STRING ("<"); case LE_EXPR: BUILD_OPERATOR_STRING ("<="); case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+"); case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-"); case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!"); case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~"); case PREINCREMENT_EXPR: /* Fall through */ case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++"); case PREDECREMENT_EXPR: /* Fall through */ case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--"); default: fatal ("unregistered operator %s - operator_string", tree_code_name [TREE_CODE (node)]); } return NULL; #undef BUILD_OPERATOR_STRING } /* Binary operators (15.16 up to 15.18). We return error_mark_node on errors but we modify NODE so that it contains the type computed according to the expression, when it's fixed. Otherwise, we write error_mark_node as the type. It allows us to further the analysis of remaining nodes and detects more errors in certain cases. */ static tree patch_binop (node, wfl_op1, wfl_op2) tree node; tree wfl_op1; tree wfl_op2; { tree op1 = TREE_OPERAND (node, 0); tree op2 = TREE_OPERAND (node, 1); tree op1_type = TREE_TYPE (op1); tree op2_type = TREE_TYPE (op2); tree prom_type; int code = TREE_CODE (node); /* If 1, tell the routine that we have to return error_mark_node after checking for the initialization of the RHS */ int error_found = 0; /* Figure what is going to be checked first for initialization prior its use. If NODE is part of a compound assignment, we check the second operand first, otherwise the first one first. We also initialize the matching WFL for the error report. `cfi' stands for Check For Initialization */ tree cfi = (COMPOUND_ASSIGN_P (node) ? op2 : op1); tree cfi_wfl = (COMPOUND_ASSIGN_P (node) ? wfl_op2 : wfl_op1); EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); /* Check initialization of LHS first. We then silence further error message if the variable wasn't initialized */ if (not_initialized_as_it_should_p (cfi)) { ERROR_VARIABLE_NOT_INITIALIZED (cfi_wfl, DECL_NAME (cfi)); INITIALIZED_P (op1) = 1; } switch (code) { /* 15.16 Multiplicative operators */ case MULT_EXPR: /* 15.16.1 Multiplication Operator * */ case RDIV_EXPR: /* 15.16.2 Division Operator / */ case TRUNC_MOD_EXPR: /* 15.16.3 Remainder operator % */ if (!JPRIMITIVE_TYPE_P (op1_type) || !JPRIMITIVE_TYPE_P (op2_type)) { if (!JPRIMITIVE_TYPE_P (op1_type)) ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type); if (!JPRIMITIVE_TYPE_P (op2_type) && (op1_type != op2_type)) ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type); TREE_TYPE (node) = error_mark_node; error_found = 1; break; } prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2); /* Change the division operator if necessary */ if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE) TREE_SET_CODE (node, TRUNC_DIV_EXPR); /* This one is more complicated. FLOATs are processed by a function call to soft_fmod. */ if (code == TRUNC_MOD_EXPR) return build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2); break; /* 15.17 Additive Operators */ case PLUS_EXPR: /* 15.17.1 String Concatenation Operator + */ /* Operation is valid if either one argument is a string constant, a String object or a StringBuffer crafted for the purpose of the a previous usage of the String concatenation operator */ if (TREE_CODE (op1) == STRING_CST || TREE_CODE (op2) == STRING_CST || JSTRING_TYPE_P (op1_type) || JSTRING_TYPE_P (op2_type) || IS_CRAFTED_STRING_BUFFER_P (op1) || IS_CRAFTED_STRING_BUFFER_P (op2)) return build_string_concatenation (op1, op2); case MINUS_EXPR: /* 15.17.2 Additive Operators (+ and -) for Numeric Types */ if (!JPRIMITIVE_TYPE_P (op1_type) || !JPRIMITIVE_TYPE_P (op2_type)) { if (!JPRIMITIVE_TYPE_P (op1_type)) ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type); if (!JPRIMITIVE_TYPE_P (op2_type) && (op1_type != op2_type)) ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type); TREE_TYPE (node) = error_mark_node; error_found = 1; break; } prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2); break; /* 15.18 Shift Operators */ case LSHIFT_EXPR: case RSHIFT_EXPR: case URSHIFT_EXPR: if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type)) { if (!JINTEGRAL_TYPE_P (op1_type)) ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type); else parse_error_context (wfl_operator, (JPRIMITIVE_TYPE_P (op2_type) ? "Incompatible type for `%s'. Explicit cast needed to convert " "shift distance from `%s' to integral" : "Incompatible type for `%s'. Can't convert shift distance from " "`%s' to integral"), operator_string (node), lang_printable_name (op2_type, 0)); TREE_TYPE (node) = error_mark_node; error_found = 1; break; } /* Unary numeric promotion (5.6.1) is performed on each operand separatly */ op1 = convert (promote_type (op1_type), op1); op2 = convert (promote_type (op2_type), op2); /* The type of the shift expression is the type of the promoted type of the left-hand operand */ prom_type = TREE_TYPE (op1); /* Shift int only up to 0x1f and long up to 0x3f */ if (prom_type == int_type_node) op2 = fold (build (BIT_AND_EXPR, int_type_node, op2, build_int_2 (0x1f, 0))); else op2 = fold (build (BIT_AND_EXPR, int_type_node, op2, build_int_2 (0x3f, 0))); /* The >>> operator is a >> operating on unsigned quantities */ if (code == URSHIFT_EXPR) { op1 = convert (unsigned_type (prom_type), op1); TREE_SET_CODE (node, RSHIFT_EXPR); } break; /* 15.19.1 Type Comparison Operator instaceof */ case INSTANCEOF_EXPR: TREE_TYPE (node) = boolean_type_node; if (!(op2_type = resolve_type_during_patch (op2))) return error_mark_node; /* The first operand must be a reference type or the null type */ if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node) error_found = 1; /* Error reported further below */ /* The second operand must be a reference type */ if (!JREFERENCE_TYPE_P (op2_type)) { SET_WFL_OPERATOR (wfl_operator, node, wfl_op2); parse_error_context (wfl_operator, "Invalid argument `%s' for `instanceof'", lang_printable_name (op2_type, 0)); error_found = 1; } if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1)) { /* If the first operand is null, the result is always false */ if (op1 == null_pointer_node) return boolean_false_node; /* Otherwise we have to invoke instance of to figure it out */ else { tree call = build (CALL_EXPR, boolean_type_node, build_address_of (soft_instanceof_node), tree_cons (NULL_TREE, op1, build_tree_list (NULL_TREE, build_class_ref (op2_type))), NULL_TREE); TREE_SIDE_EFFECTS (call) = 1; return call; } } /* There is no way the expression operand can be an instance of the type operand. This is a compile time error. */ else { char *t1 = strdup (lang_printable_name (op1_type, 0)); SET_WFL_OPERATOR (wfl_operator, node, wfl_op1); parse_error_context (wfl_operator, "Impossible for `%s' to be instance of `%s'", t1, lang_printable_name (op2_type, 0)); free (t1); error_found = 1; } break; /* 15.21 Bitwise and Logical Operators */ case BIT_AND_EXPR: case BIT_XOR_EXPR: case BIT_IOR_EXPR: if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type)) /* Binary numeric promotion is performed on both operand and the expression retain that type */ prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2); else if (TREE_CODE (op1_type) == BOOLEAN_TYPE && TREE_CODE (op1_type) == BOOLEAN_TYPE) /* The type of the bitwise operator expression is BOOLEAN */ prom_type = boolean_type_node; else { if (!JINTEGRAL_TYPE_P (op1_type)) ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type); if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type)) ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type); TREE_TYPE (node) = error_mark_node; error_found = 1; /* Insert a break here if adding thing before the switch's break for this case */ } break; /* 15.22 Conditional-And Operator */ case TRUTH_ANDIF_EXPR: /* 15.23 Conditional-Or Operator */ case TRUTH_ORIF_EXPR: /* Operands must be of BOOLEAN type */ if (TREE_CODE (op1_type) != BOOLEAN_TYPE || TREE_CODE (op2_type) != BOOLEAN_TYPE) { if (TREE_CODE (op1_type) != BOOLEAN_TYPE) ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type); if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type)) ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type); TREE_TYPE (node) = boolean_type_node; error_found = 1; break; } /* The type of the conditional operators is BOOLEAN */ prom_type = boolean_type_node; break; /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */ case LT_EXPR: case GT_EXPR: case LE_EXPR: case GE_EXPR: /* The type of each of the operands must be a primitive numeric type */ if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type)) { if (!JNUMERIC_TYPE_P (op1_type)) ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type); if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type)) ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type); TREE_TYPE (node) = boolean_type_node; error_found = 1; break; } /* Binary numeric promotion is performed on the operands */ binary_numeric_promotion (op1_type, op2_type, &op1, &op2); /* The type of the relation expression is always BOOLEAN */ prom_type = boolean_type_node; break; /* 15.20 Equality Operator */ case EQ_EXPR: case NE_EXPR: /* 15.20.1 Numerical Equality Operators == and != */ /* Binary numeric promotion is performed on the operands */ if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type)) binary_numeric_promotion (op1_type, op2_type, &op1, &op2); /* 15.20.2 Boolean Equality Operators == and != */ else if (TREE_CODE (op1_type) == BOOLEAN_TYPE && TREE_CODE (op2_type) == BOOLEAN_TYPE) ; /* Nothing to do here */ /* 15.20.3 Reference Equality Operators == and != */ /* Types have to be either references or the null type. If they're references, it must be possible to convert either type to the other by casting conversion. */ else if (op1 == null_pointer_node || op2 == null_pointer_node || (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type) && (valid_ref_assignconv_cast_p (op1_type, op2_type, 1) || valid_ref_assignconv_cast_p (op2_type, op1_type, 1)))) ; /* Nothing to do here */ /* Else we have an error figure what can't be converted into what and report the error */ else { char *t1; t1 = strdup (lang_printable_name (op1_type, 0)); parse_error_context (wfl_operator, "Incompatible type for `%s'. Can't convert `%s' " "to `%s'", operator_string (node), t1, lang_printable_name (op2_type, 0)); free (t1); TREE_TYPE (node) = boolean_type_node; error_found = 1; break; } prom_type = boolean_type_node; break; } /* Then check the initialization of the RHS. We don't do that if we're dealing with a node that is part of a compound assignment. We then silence further error message if the variable wasn't initialized */ if (not_initialized_as_it_should_p (op2) && !COMPOUND_ASSIGN_P (node)) { ERROR_VARIABLE_NOT_INITIALIZED (wfl_op2, DECL_NAME (op2)); INITIALIZED_P (op2) = 1; } if (error_found) return error_mark_node; TREE_OPERAND (node, 0) = op1; TREE_OPERAND (node, 1) = op2; TREE_TYPE (node) = prom_type; return fold (node); } /* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non zero value, the value of CSTE comes after the valude of STRING */ static tree do_merge_string_cste (cste, string, string_len, after) tree cste; char *string; int string_len, after; { int len = TREE_STRING_LENGTH (cste) + string_len; char *old = TREE_STRING_POINTER (cste); TREE_STRING_LENGTH (cste) = len; TREE_STRING_POINTER (cste) = obstack_alloc (expression_obstack, len+1); if (after) { strcpy (TREE_STRING_POINTER (cste), string); strcat (TREE_STRING_POINTER (cste), old); } else { strcpy (TREE_STRING_POINTER (cste), old); strcat (TREE_STRING_POINTER (cste), string); } return cste; } /* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a new STRING_CST on success, NULL_TREE on failure */ static tree merge_string_cste (op1, op2, after) tree op1, op2; int after; { /* Handle two string constants right away */ if (TREE_CODE (op2) == STRING_CST) return do_merge_string_cste (op1, TREE_STRING_POINTER (op2), TREE_STRING_LENGTH (op2), after); /* Reasonable integer constant can be treated right away */ if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2)) { static char *boolean_true = "true"; static char *boolean_false = "false"; static char *null_pointer = "null"; char ch[3]; char *string; if (op2 == boolean_true_node) string = boolean_true; else if (op2 == boolean_false_node) string = boolean_false; else if (op2 == null_pointer_node) string = null_pointer; else if (TREE_TYPE (op2) == char_type_node) { ch[0] = (char )TREE_INT_CST_LOW (op2); ch[1] = '\0'; string = ch; } else string = print_int_node (op2); return do_merge_string_cste (op1, string, strlen (string), after); } return NULL_TREE; } /* Tries to statically concatenate OP1 and OP2 if possible. Either one has to be a STRING_CST and the other part must be a STRING_CST or a INTEGRAL constant. Return a new STRING_CST if the operation succeed, NULL_TREE otherwise. If the case we want to optimize for space, we might want to return NULL_TREE for each invocation of this routine. FIXME */ static tree string_constant_concatenation (op1, op2) tree op1, op2; { if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST)) { tree string, rest; int invert; string = (TREE_CODE (op1) == STRING_CST ? op1 : op2); rest = (string == op1 ? op2 : op1); invert = (string == op1 ? 0 : 1 ); /* Walk REST, only if it looks reasonable */ if (TREE_CODE (rest) != STRING_CST && !IS_CRAFTED_STRING_BUFFER_P (rest) && !JSTRING_TYPE_P (TREE_TYPE (rest)) && TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION) { rest = java_complete_tree (rest); if (rest == error_mark_node) return error_mark_node; rest = fold (rest); } return merge_string_cste (string, rest, invert); } return NULL_TREE; } /* Implement the `+' operator. Does static optimization if possible, otherwise create (if necessary) and append elements to a StringBuffer. The StringBuffer will be carried around until it is used for a function call or an assignment. Then toString() will be called on it to turn it into a String object. */ static tree build_string_concatenation (op1, op2) tree op1, op2; { tree result; /* Try to do some static optimization */ if ((result = string_constant_concatenation (op1, op2))) return result; /* If operands are string constant, turn then into object references */ if (TREE_CODE (op1) == STRING_CST) op1 = patch_string_cst (op1); if (TREE_CODE (op2) == STRING_CST) op2 = patch_string_cst (op2); /* If OP1 isn't already a StringBuffer, create and initialize a new one */ if (!IS_CRAFTED_STRING_BUFFER_P (op1)) { /* Two solutions here: 1) OP1 is a string reference, we call new StringBuffer(OP1) 2) Op2 is something else, we call new StringBuffer().append(OP1). */ if (JSTRING_TYPE_P (TREE_TYPE (op1))) op1 = BUILD_STRING_BUFFER (op1); else { tree aNew = BUILD_STRING_BUFFER (NULL_TREE); op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0); } } /* No longer the last node holding a crafted StringBuffer */ IS_CRAFTED_STRING_BUFFER_P (op1) = 0; /* Create a node for `{new...,xxx}.append (op2)' */ op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0); /* Mark the last node holding a crafted StringBuffer */ IS_CRAFTED_STRING_BUFFER_P (op1) = 1; return op1; } /* Patch the string node NODE. NODE can be a STRING_CST of a crafted StringBuffer. If no string were found to be patched, return NULL. */ static tree patch_string (node) tree node; { if (TREE_CODE (node) == STRING_CST) return patch_string_cst (node); else if (IS_CRAFTED_STRING_BUFFER_P (node)) { tree invoke = build_method_invocation (wfl_to_string, NULL_TREE); return java_complete_tree (make_qualified_primary (node, invoke, 0)); } return NULL_TREE; } /* Build the internal representation of a string constant. */ static tree patch_string_cst (node) tree node; { int location; push_obstacks (&permanent_obstack, &permanent_obstack); node = get_identifier (TREE_STRING_POINTER (node)); location = alloc_name_constant (CONSTANT_String, node); node = build_ref_from_constant_pool (location); TREE_TYPE (node) = promote_type (string_type_node); TREE_CONSTANT (node) = 1; return node; } /* Build an incomplete unary operator expression. */ static tree build_unaryop (op_token, op_location, op1) int op_token, op_location; tree op1; { enum tree_code op; tree unaryop; switch (op_token) { case PLUS_TK: op = UNARY_PLUS_EXPR; break; case MINUS_TK: op = NEGATE_EXPR; break; case NEG_TK: op = TRUTH_NOT_EXPR; break; case NOT_TK: op = BIT_NOT_EXPR; break; default: fatal ("Unknown token `%d' for unary operator - build_unaryop", op_token); } unaryop = build1 (op, NULL_TREE, op1); TREE_SIDE_EFFECTS (unaryop) = 1; /* Store the location of the operator, for better error report. The string of the operator will be rebuild based on the OP value. */ EXPR_WFL_LINECOL (unaryop) = op_location; return unaryop; } /* Special case for the ++/-- operators, since they require an extra argument to build, which is set to NULL and patched later. IS_POST_P is 1 if the operator, 0 otherwise. */ static tree build_incdec (op_token, op_location, op1, is_post_p) int op_token, op_location; tree op1; int is_post_p; { static enum tree_code lookup [2][2] = { { PREDECREMENT_EXPR, PREINCREMENT_EXPR, }, { POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, }, }; tree node = build (lookup [is_post_p][(op_token - DECR_TK)], NULL_TREE, op1, NULL_TREE); TREE_SIDE_EFFECTS (node) = 1; /* Store the location of the operator, for better error report. The string of the operator will be rebuild based on the OP value. */ EXPR_WFL_LINECOL (node) = op_location; return node; } /* Build an incomplete cast operator, based on the use of the CONVERT_EXPR. Note that TREE_TYPE of the constructed node is set. java_complete_tree is trained to walk a CONVERT_EXPR even though its type is already set. */ static tree build_cast (location, type, exp) int location; tree type, exp; { tree node = build1 (CONVERT_EXPR, type, exp); EXPR_WFL_LINECOL (node) = location; return node; } /* 15.14 Unary operators. We return error_mark_node in case of error, but preserve the type of NODE if the type is fixed. */ static tree patch_unaryop (node, wfl_op) tree node; tree wfl_op; { tree op = TREE_OPERAND (node, 0); tree op_type = TREE_TYPE (op); tree prom_type, value; int code = TREE_CODE (node); int error_found = 0; EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); switch (code) { /* 15.13.2 Postfix Increment Operator ++ */ case POSTINCREMENT_EXPR: /* 15.13.3 Postfix Increment Operator -- */ case POSTDECREMENT_EXPR: /* 15.14.1 Prefix Increment Operator ++ */ case PREINCREMENT_EXPR: /* 15.14.2 Prefix Decrement Operator -- */ case PREDECREMENT_EXPR: if (!DECL_P (op) && !((TREE_CODE (op) == INDIRECT_REF || TREE_CODE (op) == COMPONENT_REF) && JPRIMITIVE_TYPE_P (TREE_TYPE (op)))) { tree lvalue; /* Before screaming, check that we're not in fact trying to increment a optimized static final access, in which case we issue an different error message. */ if (!(TREE_CODE (wfl_op) == EXPR_WITH_FILE_LOCATION && resolve_expression_name (wfl_op, &lvalue) && check_final_assignment (lvalue, wfl_op))) parse_error_context (wfl_operator, "Invalid argument to `%s'", operator_string (node)); TREE_TYPE (node) = error_mark_node; error_found = 1; } else if (check_final_assignment (op, wfl_op)) error_found = 1; /* From now on, we know that op if a variable and that it has a valid wfl. We use wfl_op to locate errors related to the ++/-- operand. */ else if (!JNUMERIC_TYPE_P (op_type)) { parse_error_context (wfl_op, "Invalid argument type `%s' to `%s'", lang_printable_name (op_type, 0), operator_string (node)); TREE_TYPE (node) = error_mark_node; error_found = 1; } else { /* Before the addition, binary numeric promotion if performed on both operands */ value = integer_one_node; prom_type = binary_numeric_promotion (op_type, TREE_TYPE (value), &op, &value); /* And write the promoted increment back */ TREE_OPERAND (node, 1) = value; } break; /* 15.14.3 Unary Plus Operator + */ case UNARY_PLUS_EXPR: /* 15.14.4 Unary Minus Operator - */ case NEGATE_EXPR: if (!JNUMERIC_TYPE_P (op_type)) { ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type); TREE_TYPE (node) = error_mark_node; error_found = 1; } /* Unary numeric promotion is performed on operand */ else { prom_type = promote_type (op_type); op = convert (prom_type, op); if (code == UNARY_PLUS_EXPR) node = op; } break; /* 15.14.5 Bitwise Complement Operator ~ */ case BIT_NOT_EXPR: if (!JINTEGRAL_TYPE_P (op_type)) { ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type); TREE_TYPE (node) = error_mark_node; error_found = 1; } else { prom_type = promote_type (op_type); op = convert (prom_type, op); } break; /* 15.14.6 Logical Complement Operator ! */ case TRUTH_NOT_EXPR: if (TREE_CODE (op_type) != BOOLEAN_TYPE) { ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type); TREE_TYPE (node) = boolean_type_node; error_found = 1; } else prom_type = boolean_type_node; break; /* 15.15 Cast Expression */ case CONVERT_EXPR: value = patch_cast (node, wfl_operator); if (value == error_mark_node) { TREE_TYPE (node) = error_mark_node; error_found = 1; } else node = value; break; } /* Check variable initialization */ if (not_initialized_as_it_should_p (op)) { ERROR_VARIABLE_NOT_INITIALIZED (wfl_op, DECL_NAME (op)); INITIALIZED_P (op) = 1; } if (error_found) return error_mark_node; /* In the case of UNARY_PLUS_EXPR, we replaced NODE by a new one */ else if (code != UNARY_PLUS_EXPR && code != CONVERT_EXPR) { TREE_OPERAND (node, 0) = op; TREE_TYPE (node) = prom_type; } return fold (node); } /* Generic type resolution that sometimes takes place during node patching. Returned the resolved type or generate an error message. Return the resolved type or NULL_TREE. */ static tree resolve_type_during_patch (type) tree type; { if (unresolved_type_p (type, NULL)) { tree type_decl = resolve_no_layout (EXPR_WFL_NODE (type), NULL_TREE); if (!type_decl) { parse_error_context (type, "Class `%s' not found in type declaration", IDENTIFIER_POINTER (EXPR_WFL_NODE (type))); return NULL_TREE; } else { CLASS_LOADED_P (TREE_TYPE (type_decl)) = 1; return TREE_TYPE (type_decl); } } return type; } /* 5.5 Casting Conversion. error_mark_node is returned if an error is found. Otherwise NODE or something meant to replace it is returned. */ static tree patch_cast (node, wfl_operator) tree node; tree wfl_operator; { tree op = TREE_OPERAND (node, 0); tree op_type = TREE_TYPE (op); tree cast_type = TREE_TYPE (node); char *t1; /* First resolve OP_TYPE if unresolved */ if (!(cast_type = resolve_type_during_patch (cast_type))) return error_mark_node; /* Check on cast that are proven correct at compile time */ if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type)) { static tree convert_narrow (); /* Same type */ if (cast_type == op_type) return node; /* Try widening/narowwing convertion. Potentially, things need to be worked out in gcc so we implement the extreme cases correctly. fold_convert() needs to be fixed. */ return convert (cast_type, op); } /* null can be casted to references */ if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type)) return build_null_of_type (cast_type); /* The remaining legal casts involve conversion between reference types. Check for their compile time correctness. */ if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type) && valid_ref_assignconv_cast_p (cast_type, op_type, 1)) { TREE_TYPE (node) = promote_type (cast_type); /* Now, the case can be determined correct at compile time if OP_TYPE can be converted into CAST_TYPE by assignment conversion (5.2) */ if (valid_ref_assignconv_cast_p (op_type, cast_type, 0)) return node; /* The cast requires a run-time check */ return build (CALL_EXPR, promote_type (cast_type), build_address_of (soft_checkcast_node), tree_cons (NULL_TREE, build_class_ref (cast_type), build_tree_list (NULL_TREE, op)), NULL_TREE); } /* Any other casts are proven incorrect at compile time */ t1 = strdup (lang_printable_name (op_type, 0)); parse_error_context (wfl_operator, "Invalid cast from `%s' to `%s'", t1, lang_printable_name (cast_type, 0)); free (t1); return error_mark_node; } /* Build a null constant and give it the type TYPE. */ static tree build_null_of_type (type) tree type; { tree node = build_int_2 (0, 0); TREE_TYPE (node) = promote_type (type); return node; } /* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't a list of indices. */ static tree build_array_ref (location, array, index) int location; tree array, index; { tree node = build (ARRAY_REF, NULL_TREE, array, index); EXPR_WFL_LINECOL (node) = location; return node; } /* 15.12 Array Access Expression */ static tree patch_array_ref (node, wfl_array, wfl_index) tree node, wfl_array, wfl_index; { tree array = TREE_OPERAND (node, 0); tree array_type = TREE_TYPE (array); tree index = TREE_OPERAND (node, 1); tree index_type = TREE_TYPE (index); tree promoted_index_type; int error_found = 0; EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); if (not_initialized_as_it_should_p (array)) { ERROR_VARIABLE_NOT_INITIALIZED (wfl_array, DECL_NAME (array)); INITIALIZED_P (array) = 1; } if (TREE_CODE (array_type) == POINTER_TYPE) array_type = TREE_TYPE (array_type); /* The array reference must be an array */ if (!TYPE_ARRAY_P (array_type)) { parse_error_context (wfl_operator, "`[]' can only be applied to arrays. It can't be " "applied to `%s'", lang_printable_name (array_type, 0)); TREE_TYPE (node) = error_mark_node; error_found = 1; } /* The array index underdoes unary numeric promotion. The promoted type must be int */ promoted_index_type = promote_type (index_type); if (promoted_index_type != int_type_node) { int could_cast = valid_cast_to_p (index_type, int_type_node); parse_error_context (wfl_operator, (could_cast ? "Incompatible type for `[]'. Explicit cast needed to " "convert `%s' to `int'" : "Incompatible type for `[]'. " "Can't convert `%s' to `int'"), lang_printable_name (index_type, 0)); TREE_TYPE (node) = error_mark_node; error_found = 1; } /* Now if the index is a var/parm decl, check on its initialization */ if (not_initialized_as_it_should_p (index)) { ERROR_VARIABLE_NOT_INITIALIZED (wfl_index, DECL_NAME (index)); INITIALIZED_P (index) = 1; } if (error_found) return error_mark_node; index = convert (promoted_index_type, index); array_type = TYPE_ARRAY_ELEMENT (array_type); if (TREE_CODE (array_type) == RECORD_TYPE && !JPRIMITIVE_TYPE_P (TREE_TYPE (array_type))) array_type = promote_type (array_type); if (flag_emit_class_files) { TREE_OPERAND (node, 0)= array; TREE_OPERAND (node, 1)= index; } else node = build_java_arrayaccess (array, array_type, index); TREE_TYPE (node) = array_type; return node; } /* 15.9 Array Creation Expressions */ static tree build_newarray_node (type, dims, extra_dims) tree type; tree dims; int extra_dims; { tree node = build (NEW_ARRAY_EXPR, NULL_TREE, type, nreverse (dims), build_int_2 (extra_dims, 0)); return node; } static tree patch_newarray (node) tree node; { tree type = TREE_OPERAND (node, 0); tree dims = TREE_OPERAND (node, 1); tree cdim, array_type; int error_found = 0; int ndims = 0; int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2)); int total_dims; /* Dimension types are verified. It's better for the types to be verified in order. */ for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ ) { int dim_error = 0; tree dim = TREE_VALUE (cdim); /* Dim might have been saved during its evaluation */ dim = (TREE_CODE (dim) == SAVE_EXPR ? dim = TREE_OPERAND (dim, 0) : dim); /* The type of each specified dimension must be an integral type. */ if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim))) dim_error = 1; /* Each expression undergoes an unary numeric promotion (5.6.1) and the promoted type must be int. */ else { dim = convert (promote_type (TREE_TYPE (dim)), dim); if (TREE_TYPE (dim) != int_type_node) dim_error = 1; } /* Report errors on types here */ if (dim_error) { parse_error_context (TREE_PURPOSE (cdim), "Incompatible type for dimension in array creation expression. " "%s convert `%s' to `int'", (valid_cast_to_p (TREE_TYPE (dim), int_type_node) ? "Explicit cast needed to" : "Can't"), lang_printable_name (TREE_TYPE (dim), 0)); error_found = 1; } /* Check for uninitialized variables */ if (not_initialized_as_it_should_p (dim)) { ERROR_VARIABLE_NOT_INITIALIZED (TREE_PURPOSE (cdim), DECL_NAME (dim)); INITIALIZED_P (dim) = 1; error_found = 1; } TREE_PURPOSE (cdim) = NULL_TREE; } /* Resolve array base type if unresolved */ if (!(type = resolve_type_during_patch (type))) error_found = 1; if (error_found) { /* We don't want further evaluation of this bogus array creation operation */ TREE_TYPE (node) = error_mark_node; return error_mark_node; } /* The node is transformed into a function call. Things are done differently according to the number of dimensions. If the number of dimension is equal to 1, then the nature of the base type (primitive or not) matters. */ total_dims = xdims + ndims; if (total_dims == 1) { if (JPRIMITIVE_TYPE_P (type)) { int type_code; if (type == boolean_type_node) type_code = 4; else if (type == char_type_node) type_code = 5; else if (type == float_type_node) type_code = 6; else if (type == double_type_node) type_code = 7; else if (type == byte_type_node) type_code = 8; else if (type == short_type_node) type_code = 9; else if (type == int_type_node) type_code = 10; else if (type == long_type_node) type_code = 11; else fatal ("Can't compute type code - patch_newarray"); return build_newarray (type_code, TREE_VALUE (dims)); } else return build_anewarray (type, TREE_VALUE (dims)); } /* Add extra dimensions as unknown dimensions */ while (xdims--) dims = chainon (dims, build_tree_list (NULL_TREE, integer_negative_one_node)); dims = chainon (dims, build_tree_list (NULL_TREE, integer_zero_node)); /* Can't reuse what's already written in expr.c because it uses the JVM stack representation. Provide a build_multianewarray. FIXME */ array_type = type; for (cdim = TREE_CHAIN (dims); cdim; cdim = TREE_CHAIN (cdim)) array_type = build_java_array_type (promote_type (array_type), TREE_CODE (cdim) == INTEGER_CST ? TREE_INT_CST_LOW (cdim) : -1); return build (CALL_EXPR, promote_type (array_type), build_address_of (soft_multianewarray_node), tree_cons (NULL_TREE, build_class_ref (array_type), tree_cons (NULL_TREE, build_int_2 (total_dims, 0), dims )), NULL_TREE); } static tree build_this (location) int location; { tree node = build_wfl_node (this_identifier_node, input_filename, 0, 0); TREE_SET_CODE (node, THIS_EXPR); EXPR_WFL_LINECOL (node) = location; return node; } /* 14.15 The return statement. It builds a modify expression that assigns the returned value to the RESULT_DECL that hold the value to be returned. */ static tree build_return (location, op) int location; tree op; { tree node = build1 (RETURN_EXPR, NULL_TREE, op); EXPR_WFL_LINECOL (node) = location; node = build_debugable_stmt (location, node); return node; } static tree patch_return (node) tree node; { tree return_exp = TREE_OPERAND (node, 0); tree meth = current_function_decl; tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl)); int error_found = 0; TREE_TYPE (node) = error_mark_node; EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); /* It's invalid to have a return value within a function that is declared with the keyword void or that is a constructor */ if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth))) error_found = 1; /* It's invalid to have a no return value within a function that isn't declared with the keyword `void' */ if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth))) error_found = 2; if (error_found) { if (!DECL_CONSTRUCTOR_P (meth)) { char *t = strdup (lang_printable_name (mtype, 0)); parse_error_context (wfl_operator, "`return' with%s value from `%s %s'", (error_found == 1 ? "" : "out"), t, lang_printable_name (meth, 0)); free (t); } else parse_error_context (wfl_operator, "`return' with value from constructor `%s'", lang_printable_name (meth, 0)); return error_mark_node; } /* If we have a return_exp, build a modify expression and expand it. Note: at that point, the assignment is declared valid, but we may want to carry some more hacks */ if (return_exp) { tree exp = java_complete_tree (return_exp); tree modify, patched; /* If the function returned value and EXP are booleans, EXP has to be converted into the type of DECL_RESULT, which is integer (see complete_start_java_method) */ if (TREE_TYPE (exp) == boolean_type_node && TREE_TYPE (TREE_TYPE (meth)) == boolean_type_node) exp = convert_to_integer (TREE_TYPE (DECL_RESULT (meth)), exp); /* `null' can be assigned to a function returning a reference */ if (JREFERENCE_TYPE_P (TREE_TYPE (TREE_TYPE (meth))) && exp == null_pointer_node) exp = build_null_of_type (TREE_TYPE (TREE_TYPE (meth))); if ((patched = patch_string (exp))) exp = patched; modify = build (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp); EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node); modify = java_complete_tree (modify); if (modify != error_mark_node) { TREE_SIDE_EFFECTS (modify) = 1; TREE_OPERAND (node, 0) = modify; } else return error_mark_node; } TREE_TYPE (node) = void_type_node; TREE_SIDE_EFFECTS (node) = 1; return node; } /* 14.8 The if Statement */ static tree build_if_else_statement (location, expression, if_body, else_body) int location; tree expression, if_body, else_body; { tree node; /* FIXME: make else body be a void node, where this function is called */ if (!else_body) else_body = build (COMPOUND_EXPR, void_type_node, NULL_TREE, NULL_TREE); node = build (COND_EXPR, NULL_TREE, expression, if_body, else_body); EXPR_WFL_LINECOL (node) = location; node = build_debugable_stmt (location, node); return node; } static tree patch_if_else_statement (node) tree node; { tree expression = TREE_OPERAND (node, 0); TREE_TYPE (node) = error_mark_node; EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); /* The type of expression must be boolean */ if (TREE_TYPE (expression) != boolean_type_node && TREE_TYPE (expression) != promoted_boolean_type_node) { parse_error_context (wfl_operator, "Incompatible type for `if'. Can't convert `%s' to `boolean'", lang_printable_name (TREE_TYPE (expression), 0)); return error_mark_node; } TREE_TYPE (node) = void_type_node; TREE_SIDE_EFFECTS (node) = 1; return node; } /* 14.6 Labeled Statements */ /* Action taken when a lableled statement is parsed. a new LABELED_BLOCK_EXPR is created. No statement is attached to the label, yet. */ static tree build_labeled_block (location, label) int location; tree label; { tree label_name = merge_qualified_name (label_id, label); tree label_decl, node; /* Issue a warning if we try to reuse a label that was previously declared */ if (IDENTIFIER_LOCAL_VALUE (label_name)) { EXPR_WFL_LINECOL (wfl_operator) = location; parse_warning_context (wfl_operator, "Declaration of `%s' shadows " "a previous declaration", IDENTIFIER_POINTER (label)); EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name)); parse_warning_context (wfl_operator, "This is the location of the " "previous declaration of label `%s'", IDENTIFIER_POINTER (label)); java_warning_count--; } label_decl = create_label_decl (label_name); node = build (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE); EXPR_WFL_LINECOL (node) = location; TREE_SIDE_EFFECTS (node) = 1; return node; } /* Generate a label crafting a unique name for it. This is used to implicitely label loops that aren't the body part of labeled statement. */ static tree generate_labeled_block () { return build_labeled_block (0, generate_name ()); } /* A labeled statement LBE is attached a statement. */ static tree complete_labeled_statement (lbe, statement) tree lbe; /* Labeled block expr */ tree statement; { /* In anyways, tie the loop to its statement */ LABELED_BLOCK_BODY (lbe) = statement; /* Ok, if statement is a for loop, we have to attach the labeled statement to the block the for loop belongs to and return the block instead */ if (TREE_CODE (statement) == LOOP_EXPR && IS_FOR_LOOP_P (statement)) { java_method_add_stmt (current_function_decl, lbe); return exit_block (); } return lbe; } /* 14.10, 14.11, 14.12 Loop Statements */ /* Create an empty LOOP_EXPR and make it the last in the nested loop list. */ static tree build_new_loop (loop_body) tree loop_body; { tree loop = build (LOOP_EXPR, NULL_TREE, loop_body); TREE_SIDE_EFFECTS (loop) = 1; PUSH_LOOP (loop); return loop; } /* Create a loop body according to the following structure: COMPOUND_EXPR COMPOUND_EXPR (loop main body) EXIT_EXPR (this order is for while/for loops. LABELED_BLOCK_EXPR the order is reversed for do loops) LABEL_DECL (continue occurding here branche at the BODY end of this labeled block) INCREMENT (if any) REVERSED, if non zero, tells that the loop condition expr comes after the body, like in the do-while loop. To obtain a loop, the loop body structure described above is encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR: LABELED_BLOCK_EXPR LABEL_DECL (use this label to exit the loop) LOOP_EXPR */ static tree build_loop_body (location, condition, reversed) int location; tree condition; int reversed; { tree first, second, body; condition = build (EXIT_EXPR, NULL_TREE, condition); /* Force walk */ EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */ condition = build_debugable_stmt (location, condition); TREE_SIDE_EFFECTS (condition) = 1; body = generate_labeled_block (); first = (reversed ? body : condition); second = (reversed ? condition : body); return build (COMPOUND_EXPR, NULL_TREE, build (COMPOUND_EXPR, NULL_TREE, first, second), size_zero_node); } /* Install CONDITION (if any) and loop BODY (using REVERSED to tell their order) on the current loop. Unlink the current loop from the loop list. */ static tree complete_loop_body (location, condition, body, reversed) int location; tree condition, body; int reversed; { tree to_return = ctxp->current_loop; tree loop_body = LOOP_EXPR_BODY (to_return); if (condition) { tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed); /* We wrapped the EXIT_EXPR around a WFL so we can debug it. The real EXIT_EXPR is one operand further. */ EXPR_WFL_LINECOL (cnode) = location; /* This one is for accurate error reports */ EXPR_WFL_LINECOL (TREE_OPERAND (cnode, 0)) = location; TREE_OPERAND (TREE_OPERAND (cnode, 0), 0) = condition; } LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body; POP_LOOP (); return to_return; } /* Tailored version of complete_loop_body for FOR loops, when FOR loops feature the condition part */ static tree complete_for_loop (location, condition, update, body) int location; tree condition, update, body; { /* Put the condition and the loop body in place */ tree loop = complete_loop_body (location, condition, body, 0); /* LOOP is the current loop which has been now popped of the loop stack. Install the update block */ LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update; return loop; } /* If the loop isn't surrounded by a labeled statement, create one and insert LOOP as it's body. */ static tree patch_loop_statement (loop) tree loop; { tree loop_label, to_return_as_loop; if (LOOP_HAS_LABEL_P (loop)) { loop_label = ctxp->current_labeled_block; to_return_as_loop = loop; } else { loop_label = generate_labeled_block (); LABELED_BLOCK_BODY (loop_label) = loop; PUSH_LABELED_BLOCK (loop_label); to_return_as_loop = loop_label; } TREE_TYPE (to_return_as_loop) = void_type_node; return to_return_as_loop; } /* 14.13, 14.14: break and continue Statements */ /* Build a break or a continue statement. a null NAME indicates an unlabeled break/continue statement. */ static tree build_bc_statement (location, is_break, name) int location, is_break; tree name; { tree break_continue, label_block_expr = NULL_TREE; if (name) { if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE (merge_qualified_name (label_id, EXPR_WFL_NODE (name))))) /* Null means that we don't have a target for this named break/continue. In this case, we make the target to be the label name, so that the error can be reported accuratly in patch_bc_statement. */ label_block_expr = EXPR_WFL_NODE (name); } /* Unlabeled break/continue will be handled during the break/continue patch operation */ break_continue = build (EXIT_BLOCK_EXPR, NULL_TREE, label_block_expr, NULL_TREE); IS_BREAK_STMT_P (break_continue) = is_break; TREE_SIDE_EFFECTS (break_continue) = 1; EXPR_WFL_LINECOL (break_continue) = location; break_continue = build_debugable_stmt (location, break_continue); return break_continue; } /* Verification of a break/continue statement. */ static tree patch_bc_statement (node) tree node; { tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt; int is_unlabeled = 0; EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); /* Not having a target means that the break/continue statement is unlabeled. We try to find a decent label for it */ if (!bc_label) { is_unlabeled = 1; /* There should be a loop/switch to branch to */ if (ctxp->current_loop) { if (TREE_CODE (ctxp->current_loop) == LOOP_EXPR) { /* At that stage, we're in the loop body, which is encapsulated around a LABELED_BLOCK_EXPR. So searching the current loop label requires us to consider the labeled block before the current one. */ if (!LOOP_HAS_LABEL_SKIP_P (ctxp->current_loop)) fatal ("unlabeled loop has no installed label -- " "patch_bc_statement"); bc_label = TREE_CHAIN (ctxp->current_labeled_block); } /* For a SWITCH statement, this is the current one */ else bc_label = ctxp->current_labeled_block; } /* Not having a loop to break/continue to is an error */ else { parse_error_context (wfl_operator, "`%s' must be in loop%s", (IS_BREAK_STMT_P (node) ? "break" : "continue"), (IS_BREAK_STMT_P (node) ? " or switch" : "")); return error_mark_node; } } /* Having an identifier here means that the target is unknown. */ else if (TREE_CODE (bc_label) == IDENTIFIER_NODE) { parse_error_context (wfl_operator, "No label definition found for `%s'", IDENTIFIER_POINTER (bc_label)); return error_mark_node; } /* Find the statement we're targeting. */ target_stmt = LABELED_BLOCK_BODY (bc_label); /* 14.13 The break Statement */ if (IS_BREAK_STMT_P (node)) { /* Named break are always fine, as far as they have a target (already verified). Anonymous break need to target while/do/for/switch */ if (is_unlabeled && !(TREE_CODE (target_stmt) == LOOP_EXPR /* do/while/for */ || TREE_CODE (target_stmt) == SWITCH_EXPR)) /* switch FIXME */ { parse_error_context (wfl_operator, "`break' must be in loop or switch"); return error_mark_node; } /* If previously unlabeled, install the new found label */ if (is_unlabeled) EXIT_BLOCK_LABELED_BLOCK (node) = bc_label; } /* 14.14 The continue Statement */ /* The continue statement must always target a loop */ else { if (TREE_CODE (target_stmt) != LOOP_EXPR) /* do/while/for */ { parse_error_context (wfl_operator, "`continue' must be in loop"); return error_mark_node; } /* Everything looks good. We can fix the `continue' jump to go at the place in the loop were the continue is. The continue is the current labeled block, by construction. */ EXIT_BLOCK_LABELED_BLOCK (node) = ctxp->current_labeled_block; } /* Our break/continue don't return values. */ TREE_TYPE (node) = void_type_node; /* Encapsulate the break within a compound statement so that it's expanded all the times by expand_expr (and not clobered sometimes, like after a if statement) */ node = add_stmt_to_compound (NULL_TREE, void_type_node, node); TREE_SIDE_EFFECTS (node) = 1; return node; } /* Process the exit expression belonging to a loop. Its type must be boolean. */ static tree patch_exit_expr (node) tree node; { tree expression = TREE_OPERAND (node, 0); TREE_TYPE (node) = error_mark_node; EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); /* The type of expression must be boolean */ if (TREE_TYPE (expression) != boolean_type_node) { parse_error_context (wfl_operator, "Incompatible type for loop conditional. Can't convert `%s' to " "`boolean'", lang_printable_name (TREE_TYPE (expression), 0)); return error_mark_node; } /* Now we know things are allright, invert the condition, fold and return */ TREE_OPERAND (node, 0) = fold (build1 (TRUTH_NOT_EXPR, boolean_type_node, expression)); TREE_TYPE (node) = void_type_node; return node; } /* 14.9 Switch statement */ static tree patch_switch_statement (node) tree node; { int error_found = 0; tree se = TREE_OPERAND (node, 0), se_type, sb; tree default_found = NULL_TREE; /* Complete the switch expression */ se = TREE_OPERAND (node, 0) = java_complete_tree (se); se_type = TREE_TYPE (se); /* The type of the switch expression must be char, byte, short or int */ if (!JINTEGRAL_TYPE_P (se_type)) { EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node); parse_error_context (wfl_operator, "Incompatible type for `switch'. " "Can't convert `%s' to `int'", lang_printable_name (se_type, 0)); /* This is what java_complete_tree will check */ TREE_OPERAND (node, 0) = error_mark_node; return error_mark_node; } /* Process the switch body. We should have a list of TREE_LIST. The PURPOSE of each node should be a list of case values, VALUE should be the associated block. We try to process all cases and defaults before returning, possibly finding errors. */ TREE_OPERAND (node, 1) = nreverse (TREE_OPERAND (node, 1)); for (sb = TREE_OPERAND (node, 1); sb; sb = TREE_CHAIN (sb)) { tree label; /* If we don't have a TREE_LIST here, we have a statement inside the switch that isn't tied to a label. This error is caught by the parser and we don't have to report it here. */ TREE_PURPOSE (sb) = nreverse (TREE_PURPOSE (sb)); for (label = TREE_PURPOSE (sb); label; label = TREE_CHAIN (label)) { tree case_expr; /* Verification of the default label */ if (TREE_CODE (label) == DEFAULT_EXPR) { /* Only one default label is allowed per switch statement */ if (default_found) { EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (label); parse_error_context (wfl_operator, "Duplicate case label: `default'"); error_found = 1; } else default_found = label; continue; } /* Verification of case labels */ else { case_expr = java_complete_tree (TREE_OPERAND (label, 0)); if (case_expr == error_mark_node) continue; /* First, the case expression must be constant */ case_expr = fold (case_expr); if (!TREE_CONSTANT (case_expr)) { EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (label); parse_error_context (label, "Constant expression required"); error_found = 1; break; } /* It must be assignable to the type of the switch expression. */ if (!try_builtin_assignconv (NULL_TREE, se_type, case_expr)) { EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (label); parse_error_context (wfl_operator, "Incompatible type for case. Can't convert `%s' to `int'", lang_printable_name (TREE_TYPE (case_expr), 0)); error_found = 1; break; } /* Multiple instance of a case label bearing the same value is checked during code generation. The case expression is allright so far. */ TREE_OPERAND (label, 0) = case_expr; } } /* First TREE_VALUE should be the block tied to this list of cases. Check that this block exists and the walk it */ if (TREE_VALUE (sb)) { TREE_VALUE (sb) = java_complete_tree (TREE_VALUE (sb)); if (TREE_VALUE (sb) == error_mark_node) error_found = 1; } } /* Ready to return */ if (error_found) { TREE_TYPE (node) = error_mark_node; return error_mark_node; } TREE_TYPE (node) = void_type_node; TREE_SIDE_EFFECTS (node) = 1; return node; } /* Do the expansion of a Java switch. With Gcc, switches are front-end dependant things, but they rely on gcc routines. This function is placed here because it uses things defined locally in parse.y. */ static tree case_identity (t, v) tree t __attribute__ ((__unused__)); tree v; { return v; } void java_expand_switch (exp) tree exp; { tree sb; expand_start_case (0, TREE_OPERAND (exp, 0), int_type_node, "switch"); for (sb = TREE_OPERAND (exp, 1); sb; sb = TREE_CHAIN (sb)) { /* We have a list of TREE_LIST. PURPOSE is the case value, and when it exists, VALUE is the associated block */ /* The first CASE element should contain the associated block, if any. All other should be case statements related to the same block */ tree label; for (label = TREE_PURPOSE (sb); label; label = TREE_CHAIN (label)) { tree label_decl = build_decl (LABEL_DECL, NULL_TREE, NULL_TREE); if (TREE_CODE (label) == CASE_EXPR) { tree duplicate; if (pushcase (TREE_OPERAND (label, 0), case_identity, label_decl, &duplicate) == 2) { EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (label); parse_error_context (wfl_operator, "Duplicate case label: `%s'", print_int_node (TREE_OPERAND (label, 0))); } } else pushcase (NULL_TREE, 0, label_decl, NULL); } /* Expand the associated block, if any */ if (TREE_VALUE (sb)) expand_expr_stmt (TREE_VALUE (sb)); } expand_end_case (TREE_OPERAND (exp, 0)); } /* 14.18 The try statement */ /* Wrap BLOCK around a LABELED_BLOCK, set DECL to the newly generated exit labeld and issue a jump to FINALLY_LABEL: LABELED_BLOCK BLOCK DECL = &LABEL_DECL GOTO_EXPR FINALLY_LABEL LABEL_DECL */ static tree build_jump_to_finally (block, decl, finally_label, type) tree block, decl, finally_label, type; { tree stmt; tree new_block = build (LABELED_BLOCK_EXPR, type, create_label_decl (generate_name ()), block); stmt = build (MODIFY_EXPR, void_type_node, decl, build_address_of (LABELED_BLOCK_LABEL (new_block))); TREE_SIDE_EFFECTS (stmt) = 1; add_stmt_to_block (block, type, stmt); stmt = build (GOTO_EXPR, void_type_node, finally_label); TREE_SIDE_EFFECTS (stmt) = 1; add_stmt_to_block (block, type, stmt); return new_block; } static tree build_try_statement (location, try_block, catches, finally) int location; tree try_block, catches, finally; { tree node, rff; if (finally) { /* This block defines a scope for the entire try[-catch]-finally sequence. It hold a local variable used to return from the finally using a computed goto. We call it return_from_finally (RFF). */ rff = build_decl_no_layout (VAR_DECL, generate_name (), return_address_type_node); /* Modification of the try block. */ try_block = build_jump_to_finally (try_block, rff, FINALLY_EXPR_LABEL (finally), NULL_TREE); /* To the finally block: add the computed goto */ add_stmt_to_block (FINALLY_EXPR_BLOCK (finally), NULL_TREE, build (GOTO_EXPR, void_type_node, rff)); /* Modification of each catch blocks, if any */ if (catches) { tree catch, catch_decl, catch_block, stmt; for (catch = catches; catch; catch = TREE_CHAIN (catch)) TREE_OPERAND (catch, 0) = build_jump_to_finally (TREE_OPERAND (catch, 0), rff, FINALLY_EXPR_LABEL (finally), NULL_TREE); /* Plus, at the end of the list, we add the catch clause that will catch an uncaught exception, call finally and rethrow it: BLOCK void *exception_parameter; (catch_decl) LABELED_BLOCK BLOCK exception_parameter = _Jv_exception_info (); RFF = &LABEL_DECL; goto finally; LABEL_DECL; CALL_EXPR Jv_ReThrow exception_parameter */ catch_decl = build_decl_no_layout (VAR_DECL, generate_name (), ptr_type_node); BUILD_ASSIGN_EXCEPTION_INFO (stmt, catch_decl); catch_block = build_expr_block (stmt, NULL_TREE); catch_block = build_jump_to_finally (catch_block, rff, FINALLY_EXPR_LABEL (finally), void_type_node); BUILD_THROW (stmt, catch_decl); catch_block = build_expr_block (catch_block, catch_decl); add_stmt_to_block (catch_block, void_type_node, stmt); /* Link the new handler to the existing list as the first entry. It will be the last one to be generated. */ catch = build1 (CATCH_EXPR, void_type_node, catch_block); TREE_CHAIN (catch) = catches; catches = catch; } } node = build (TRY_EXPR, NULL_TREE, try_block, catches, finally); EXPR_WFL_LINECOL (node) = location; /* If we have a finally, surround this whole thing by a block where the RFF local variable is defined. */ return (finally ? build_expr_block (node, rff) : node); } /* Get the catch clause block from an element of the catch clause list. If depends on whether a finally clause exists or node (in which case the original catch clause was surrounded by a LABELED_BLOCK_EXPR. */ tree java_get_catch_block (node, finally_present_p) tree node; int finally_present_p; { return (CATCH_EXPR_GET_EXPR (TREE_OPERAND (node, 0), finally_present_p)); } static tree patch_try_statement (node) tree node; { int error_found = 0; tree try = TREE_OPERAND (node, 0); /* Exception handlers are considered in left to right order */ tree catch = nreverse (TREE_OPERAND (node, 1)); tree finally = TREE_OPERAND (node, 2); int finally_p = (finally ? 1 : 0); tree current, caught_type_list = NULL_TREE; /* Check catch clauses, if any. Every time we find an error, we try to process the next catch clause. We process the catch clause before the try block so that when processing the try block we can check thrown exceptions againts the caught type list. */ for (current = catch; current; current = TREE_CHAIN (current)) { tree carg_decl, carg_type; tree sub_current, catch_block, catch_clause; int unreachable; /* Always detect the last catch clause if a finally is present. This is the catch-all handler and it just needs to be walked. */ if (!TREE_CHAIN (current) && finally) { TREE_OPERAND (current, 0) = java_complete_tree (TREE_OPERAND (current, 0)); continue; } /* At this point, the structure of the catch clause is LABELED_BLOCK_EXPR (if we have a finally) CATCH_EXPR (catch node) BLOCK (with the decl of the parameter) COMPOUND_EXPR MODIFIY_EXPR (assignemnt of the catch parameter) BLOCK (catch clause block) LABEL_DECL (where to return after finally (if any)) Since the structure of the catch clause depends on the presence of a finally, we use a function call to get to the cath clause */ catch_clause = java_get_catch_block (current, finally_p); carg_decl = BLOCK_EXPR_DECLS (catch_clause); carg_type = TREE_TYPE (TREE_TYPE (carg_decl)); /* Catch clauses can't have more than one parameter declared, but it's already enforced by the grammar. Make sure that the only parameter of the clause statement in of class Throwable or a subclass of Throwable, but that was done earlier. The catch clause parameter type has also been resolved. */ /* Just make sure that the catch clause parameter type inherits from java.lang.Throwable */ if (!inherits_from_p (carg_type, throwable_type_node)) { EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current); parse_error_context (wfl_operator, "Can't catch class `%s'. Catch clause " "parameter type must be a subclass of " "class `java.lang.Throwable'", lang_printable_name (carg_type, 0)); error_found = 1; continue; } /* Partial check for unreachable catch statement: The catch clause is reachable iff is no earlier catch block A in the try statement such that the type of the catch clause's parameter is the same as or a subclass of the type of A's parameter */ unreachable = 0; for (sub_current = catch; sub_current != current; sub_current = TREE_CHAIN (sub_current)) { tree sub_catch_clause, decl; sub_catch_clause = java_get_catch_block (sub_current, finally_p); decl = BLOCK_EXPR_DECLS (sub_catch_clause); if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl)))) { EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current); parse_error_context (wfl_operator, "`catch' not reached because of the catch " "clause at line %d", EXPR_WFL_LINENO (sub_current)); unreachable = error_found = 1; break; } } if (unreachable) continue; /* Things to do here: the exception must be thrown */ /* Link this type to the caught type list */ caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list); /* Complete the catch clause block */ catch_block = java_complete_tree (TREE_OPERAND (current, 0)); if (catch_block == error_mark_node) { error_found = 1; continue; } TREE_OPERAND (current, 0) = catch_block; } PUSH_EXCEPTIONS (caught_type_list); if ((try = java_complete_tree (try)) == error_mark_node) error_found = 1; POP_EXCEPTIONS (); /* Process finally */ if (finally) { FINALLY_EXPR_BLOCK (finally) = java_complete_tree (FINALLY_EXPR_BLOCK (finally)); if (FINALLY_EXPR_BLOCK (finally) == error_mark_node) error_found = 1; } /* Verification ends here */ if (error_found) return error_mark_node; TREE_OPERAND (node, 0) = try; TREE_OPERAND (node, 1) = catch; TREE_OPERAND (node, 2) = finally; TREE_TYPE (node) = void_type_node; return node; } /* 14.17 The synchronized Statement */ static tree patch_synchronized_statement (node, wfl_op1) tree node, wfl_op1; { tree expr = TREE_OPERAND (node, 0); tree block = TREE_OPERAND (node, 1); tree try_block, catch_all, stmt, compound, decl; /* The TYPE of expr must be a reference type */ if (!JREFERENCE_TYPE_P (TREE_TYPE (TREE_OPERAND (node, 0)))) { SET_WFL_OPERATOR (wfl_operator, node, wfl_op1); parse_error_context (wfl_operator, "Incompatible type for `synchronized'" ". Can't convert `%s' to `java.lang.Object'", lang_printable_name (TREE_TYPE (expr), 0)); return error_mark_node; } /* Generate a try-finally for the synchronized statement, except that the handler that catches all throw exception calls _Jv_MonitorExit and then rethrow the exception. The synchronized statement is then implemented as: TRY { _Jv_MonitorEnter (expression) synchronized_block _Jv_MonitorExit (expression) } CATCH_ALL { e = _Jv_exception_info (); _Jv_MonitorExit (expression) Throw (e); } */ /* TRY block */ BUILD_MONITOR_ENTER (stmt, expr); compound = add_stmt_to_compound (NULL_TREE, int_type_node, stmt); compound = add_stmt_to_compound (compound, void_type_node, block); BUILD_MONITOR_EXIT (stmt, expr); compound = add_stmt_to_compound (compound, int_type_node, stmt); try_block = build_expr_block (compound, NULL_TREE); /* CATCH_ALL block */ decl = build_decl_no_layout (VAR_DECL, generate_name (), ptr_type_node); BUILD_ASSIGN_EXCEPTION_INFO (stmt, decl); compound = add_stmt_to_compound (NULL_TREE, void_type_node, stmt); BUILD_MONITOR_EXIT (stmt, expr); compound = add_stmt_to_compound (compound, int_type_node, stmt); BUILD_THROW (stmt, decl); compound = add_stmt_to_compound (compound, void_type_node, stmt); catch_all = build_expr_block (compound, decl); catch_all = build_expr_block (catch_all, NULL_TREE); catch_all = build1 (CATCH_EXPR, void_type_node, catch_all); /* TRY-CATCH statement */ return build (TRY_EXPR, void_type_node, try_block, catch_all, NULL_TREE); } /* 14.16 The throw Statement */ static tree patch_throw_statement (node, wfl_op1) tree node, wfl_op1; { tree expr = TREE_OPERAND (node, 0); tree type = TREE_TYPE (expr); int unchecked_ok = 0, tryblock_throws_ok = 0; /* Thrown expression must be assignable to java.lang.Throwable */ if (!try_reference_assignconv (throwable_type_node, expr)) { SET_WFL_OPERATOR (wfl_operator, node, wfl_op1); parse_error_context (wfl_operator, "Can't throw `%s'; it must be a " "subclass of class `java.lang.Throwable'", lang_printable_name (type, 0)); /* If the thrown expression was a reference, we further the compile-time check. */ if (!JREFERENCE_TYPE_P (type)) return error_mark_node; } /* At least one of the following must be true */ /* The type of the throw expression is a not checked exception, i.e. is a unchecked expression. */ unchecked_ok = IS_UNCHECKED_EXPRESSION_P (TREE_TYPE (type)); /* Throw is contained in a try statement and at least one catch clause can receive the thrown expression or the current method is declared to throw such an exception. Or, the throw statement is contained in a method or constructor declaration and the type of the Expression is assignable to at least one type listed in the throws clause the declaration. */ SET_WFL_OPERATOR (wfl_operator, node, wfl_op1); if (!unchecked_ok) tryblock_throws_ok = check_thrown_exceptions_do (TREE_TYPE (expr)); if (!(unchecked_ok || tryblock_throws_ok)) { /* If there is a surrounding try block that has no matching clatch clause, report it first. A surrounding try block exits only if there is something after the list of checked exception thrown by the current function (if any). */ if (IN_TRY_BLOCK_P ()) parse_error_context (wfl_operator, "Checked exception `%s' can't be " "caught by any of the catch clause(s) " "of the surrounding `try' block", lang_printable_name (type, 0)); /* If we have no surrounding try statement and the method doesn't have any throws, report it now. FIXME */ else if (!EXCEPTIONS_P (currently_caught_type_list) && !tryblock_throws_ok) parse_error_context (wfl_operator, "Checked exception `%s' isn't " "thrown from a `try' block", lang_printable_name (type, 0)); /* Otherwise, the current method doesn't have the appropriate throws declaration */ else parse_error_context (wfl_operator, "Checked exception `%s' doesn't " "match any of current method's `throws' " "declaration(s)", lang_printable_name (type, 0)); return error_mark_node; } /* If a throw statement is contained in a static initializer, then a compile-time check ensures that either its value is always an unchecked exception or its value is always caught by some try statement that contains it. FIXME, static initializer. */ BUILD_THROW (node, expr); return node; } /* Check that exception said to be thrown by method DECL can be effectively caught from where DECL is invoked. */ static void check_thrown_exceptions (location, decl) int location; tree decl; { tree throws; /* For all the unchecked exceptions thrown by DECL */ for (throws = DECL_FUNCTION_THROWS (decl); throws; throws = TREE_CHAIN (throws)) if (!check_thrown_exceptions_do (TREE_VALUE (throws))) { EXPR_WFL_LINECOL (wfl_operator) = location; parse_error_context (wfl_operator, "Exception `%s' must be caught, or it must be " "declared in the `throws' clause of `%s'", lang_printable_name (TREE_VALUE (throws), 0), IDENTIFIER_POINTER (DECL_NAME (current_function_decl))); } } /* Return 1 if EXCEPTION is caught at the current nesting level of try-catch blocks, OR is listed in the `throws' clause of the current method. */ static int check_thrown_exceptions_do (exception) tree exception; { tree list = currently_caught_type_list; /* First, all the nested try-catch-finally at that stage. The last element contains `throws' clause exceptions, if any. */ while (list) { tree caught; for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught)) if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0)) return 1; list = TREE_CHAIN (list); } return 0; } static void purge_unchecked_exceptions (mdecl) tree mdecl; { tree throws = DECL_FUNCTION_THROWS (mdecl); tree new = NULL_TREE; while (throws) { tree next = TREE_CHAIN (throws); if (!IS_UNCHECKED_EXPRESSION_P (TREE_VALUE (throws))) { TREE_CHAIN (throws) = new; new = throws; } throws = next; } /* List is inverted here, but it doesn't matter */ DECL_FUNCTION_THROWS (mdecl) = new; } /* 15.24 Conditional Operator ?: */ static tree patch_conditional_expr (node, wfl_cond, wfl_op1) tree node, wfl_cond, wfl_op1; { tree cond = TREE_OPERAND (node, 0); tree op1 = TREE_OPERAND (node, 1); tree op2 = TREE_OPERAND (node, 2); tree t1 = TREE_TYPE (op1); tree t2 = TREE_TYPE (op2); tree resulting_type = NULL_TREE; int error_found = 0; /* The first expression must be a boolean */ if (TREE_TYPE (cond) != boolean_type_node) { SET_WFL_OPERATOR (wfl_operator, node, wfl_cond); parse_error_context (wfl_operator, "Incompatible type for `?:'. Can't " "convert `%s' to `boolean'", lang_printable_name (TREE_TYPE (cond), 0)); error_found = 1; } /* Second and third can be numeric, boolean (i.e. primitive), references or null. Anything else results in an error */ if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2)) || ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node) && (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node)) || (t1 == boolean_type_node && t2 == boolean_type_node))) error_found = 1; /* Determine the type of the conditional expression. Same types are easy to deal with */ else if (t1 == t2) resulting_type = t1; /* There are different rules for numeric types */ else if (JNUMERIC_TYPE_P (t1)) { /* if byte/short found, the resulting type is short */ if ((t1 == byte_type_node && t2 == short_type_node) || (t1 == short_type_node && t2 == byte_type_node)) resulting_type = short_type_node; /* If t1 is a constant int and t2 is of type byte, short or char and t1's value fits in t2, then the resulting type is t2 */ else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1))) && JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2)) resulting_type = t2; /* If t2 is a constant int and t1 is of type byte, short or char and t2's value fits in t1, then the resulting type is t1 */ else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2))) && JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1)) resulting_type = t1; /* Otherwise, binary numeric promotion is applied and the resulting type is the promoted type of operand 1 and 2 */ else resulting_type = binary_numeric_promotion (t2, t2, &TREE_OPERAND (node, 1), &TREE_OPERAND (node, 2)); } /* Cases of a reference and a null type */ else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node) resulting_type = t1; else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node) resulting_type = t2; /* Last case: different reference types. If a type can be converted into the other one by assignment conversion, the latter determines the type of the expression */ else if ((resulting_type = try_reference_assignconv (t1, op2))) resulting_type = promote_type (t1); else if ((resulting_type = try_reference_assignconv (t2, op1))) resulting_type = promote_type (t2); /* If we don't have any resulting type, we're in trouble */ if (!resulting_type) { char *t = strdup (lang_printable_name (t1, 0)); SET_WFL_OPERATOR (wfl_operator, node, wfl_op1); parse_error_context (wfl_operator, "Incompatible type for `?:'. Can't " "convert `%s' to `%s'", t, lang_printable_name (t2, 0)); free (t); error_found = 1; } if (error_found) { TREE_TYPE (node) = error_mark_node; return error_mark_node; } TREE_TYPE (node) = resulting_type; TREE_SET_CODE (node, COND_EXPR); return node; }