| blob | b6054d418f7da7c8106d33f691bcf2cf75d36407 |
1 /* Source code parsing and tree node generation for the GNU compiler
2 for the Java(TM) language.
3 Copyright (C) 1997, 1998, 1999, 2000, 2001 Free Software Foundation, Inc.
4 Contributed by Alexandre Petit-Bianco (apbianco@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
11 any later version.
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA.
23 Java and all Java-based marks are trademarks or registered trademarks
24 of Sun Microsystems, Inc. in the United States and other countries.
25 The Free Software Foundation is independent of Sun Microsystems, Inc. */
27 /* This file parses java source code and issues a tree node image
28 suitable for code generation (byte code and targeted CPU assembly
29 language).
31 The grammar conforms to the Java grammar described in "The Java(TM)
32 Language Specification. J. Gosling, B. Joy, G. Steele. Addison Wesley
33 1996, ISBN 0-201-63451-1"
35 The following modifications were brought to the original grammar:
37 method_body: added the rule '| block SC_TK'
38 static_initializer: added the rule 'static block SC_TK'.
40 Note: All the extra rules described above should go away when the
41 empty_statement rule will work.
43 statement_nsi: 'nsi' should be read no_short_if.
45 Some rules have been modified to support JDK1.1 inner classes
46 definitions and other extensions. */
48 %{
51 #include <dirent.h>
69 #ifndef DIR_SEPARATOR
71 #endif
73 /* Local function prototypes */
94 ATTRIBUTE_PRINTF_2;
301 /* JDK 1.1 work. FIXME */
344 PTR));
346 PTR));
349 /* Number of error found so far. */
351 /* Number of warning found so far. */
353 /* Tell when not to fold, when doing xrefs */
355 /* Cyclic inheritance report, as it can be set by layout_class */
358 /* The current parser context */
361 /* List of things that were analyzed for which code will be generated */
364 /* binop_lookup maps token to tree_code. It is used where binary
365 operations are involved and required by the parser. RDIV_EXPR
366 covers both integral/floating point division. The code is changed
367 once the type of both operator is worked out. */
370 {
376 };
377 #define BINOP_LOOKUP(VALUE) \
380 /* This is the end index for binary operators that can also be used
381 in compound assignements. */
382 #define BINOP_COMPOUND_CANDIDATES 11
384 /* The "$L" identifier we use to create labels. */
387 /* The "StringBuffer" identifier used for the String `+' operator. */
390 /* The "append" identifier used for String `+' operator. */
393 /* The "toString" identifier used for String `+' operator. */
396 /* The "java.lang" import qualified name. */
399 /* The generated `inst$' identifier used for generated enclosing
400 instance/field access functions. */
403 /* The "java.lang.Cloneable" qualified name. */
406 /* The "java.io.Serializable" qualified name. */
409 /* Context and flag for static blocks */
412 /* The generated `write_parm_value$' identifier. */
415 /* The list of all packages we've seen so far */
418 /* Hold THIS for the scope of the current public method decl. */
421 /* Hold a list of catch clauses list. The first element of this list is
422 the list of the catch clauses of the currently analysed try block. */
427 /* All classes seen from source code */
428 #define gclass_list src_parse_roots[0]
430 /* Check modifiers. If one doesn't fit, retrieve it in its declaration
431 line and point it out. */
432 /* Should point out the one that don't fit. ASCII/unicode, going
433 backward. FIXME */
435 #define check_modifiers(__message, __value, __mask) do { \
437 { \
443 } \
446 %}
449 tree node;
456 }
458 %{
460 %}
462 %pure_parser
464 /* Things defined here have to match the order of what's in the
465 binop_lookup table. */
467 %token PLUS_TK MINUS_TK MULT_TK DIV_TK REM_TK
468 %token LS_TK SRS_TK ZRS_TK
469 %token AND_TK XOR_TK OR_TK
470 %token BOOL_AND_TK BOOL_OR_TK
471 %token EQ_TK NEQ_TK GT_TK GTE_TK LT_TK LTE_TK
473 /* This maps to the same binop_lookup entry than the token above */
475 %token PLUS_ASSIGN_TK MINUS_ASSIGN_TK MULT_ASSIGN_TK DIV_ASSIGN_TK
476 %token REM_ASSIGN_TK
477 %token LS_ASSIGN_TK SRS_ASSIGN_TK ZRS_ASSIGN_TK
478 %token AND_ASSIGN_TK XOR_ASSIGN_TK OR_ASSIGN_TK
481 /* Modifier TOKEN have to be kept in this order. Don't scramble it */
483 %token PUBLIC_TK PRIVATE_TK PROTECTED_TK
484 %token STATIC_TK FINAL_TK SYNCHRONIZED_TK
485 %token VOLATILE_TK TRANSIENT_TK NATIVE_TK
486 %token PAD_TK ABSTRACT_TK MODIFIER_TK
487 %token STRICT_TK
489 /* Keep those two in order, too */
490 %token DECR_TK INCR_TK
492 /* From now one, things can be in any order */
494 %token DEFAULT_TK IF_TK THROW_TK
495 %token BOOLEAN_TK DO_TK IMPLEMENTS_TK
496 %token THROWS_TK BREAK_TK IMPORT_TK
497 %token ELSE_TK INSTANCEOF_TK RETURN_TK
498 %token VOID_TK CATCH_TK INTERFACE_TK
499 %token CASE_TK EXTENDS_TK FINALLY_TK
500 %token SUPER_TK WHILE_TK CLASS_TK
501 %token SWITCH_TK CONST_TK TRY_TK
502 %token FOR_TK NEW_TK CONTINUE_TK
503 %token GOTO_TK PACKAGE_TK THIS_TK
505 %token BYTE_TK SHORT_TK INT_TK LONG_TK
506 %token CHAR_TK INTEGRAL_TK
508 %token FLOAT_TK DOUBLE_TK FP_TK
510 %token ID_TK
512 %token REL_QM_TK REL_CL_TK NOT_TK NEG_TK
514 %token ASSIGN_ANY_TK ASSIGN_TK
515 %token OP_TK CP_TK OCB_TK CCB_TK OSB_TK CSB_TK SC_TK C_TK DOT_TK
517 %token STRING_LIT_TK CHAR_LIT_TK INT_LIT_TK FP_LIT_TK
518 %token TRUE_TK FALSE_TK BOOL_LIT_TK NULL_TK
525 field_declaration method_declaration extends_interfaces
526 interfaces interface_type_list
527 class_member_declaration
528 import_declarations package_declaration
529 type_declarations interface_body
530 interface_member_declaration constant_declaration
531 interface_member_declarations interface_type
532 abstract_method_declaration interface_type_list
534 static_initializer constructor_declaration block
537 constructor_declarator explicit_constructor_invocation
541 variable_declarators variable_initializer
542 variable_initializers constructor_body
543 array_initializer
547 labeled_statement if_then_statement label_decl
548 if_then_else_statement while_statement for_statement
549 statement_nsi labeled_statement_nsi do_statement
550 if_then_else_statement_nsi while_statement_nsi
551 for_statement_nsi statement_expression_list for_init
552 for_update statement_expression expression_statement
553 primary_no_new_array expression primary
554 array_creation_expression array_type
555 class_instance_creation_expression field_access
556 method_invocation array_access something_dot_new
557 argument_list postfix_expression while_expression
558 post_increment_expression post_decrement_expression
559 unary_expression_not_plus_minus unary_expression
560 pre_increment_expression pre_decrement_expression
561 unary_expression_not_plus_minus cast_expression
562 multiplicative_expression additive_expression
563 shift_expression relational_expression
564 equality_expression and_expression
565 exclusive_or_expression inclusive_or_expression
566 conditional_and_expression conditional_or_expression
567 conditional_expression assignment_expression
568 left_hand_side assignment for_header for_begin
569 constant_expression do_statement_begin empty_statement
570 switch_statement synchronized_statement throw_statement
571 try_statement switch_expression switch_block
572 catches catch_clause catch_clause_parameter finally
573 anonymous_class_creation
593 STRING_LIT_TK NULL_TK VOID_TK
598 method_declarator method_header
601 BOOLEAN_TK INTEGRAL_TK FP_TK
603 /* Added or modified JDK 1.1 rule types */
606 %%
607 /* 19.2 Production from 2.3: The Syntactic Grammar */
608 goal:
609 {
610 /* Register static variables with the garbage
611 collector. */
627 mark_parser_ctxt);
630 mark_parser_ctxt);
631 }
632 compilation_unit
633 {}
634 ;
636 /* 19.3 Productions from 3: Lexical structure */
637 literal:
638 INT_LIT_TK
639 | FP_LIT_TK
640 | BOOL_LIT_TK
641 | CHAR_LIT_TK
642 | STRING_LIT_TK
643 | NULL_TK
644 ;
646 /* 19.4 Productions from 4: Types, Values and Variables */
647 type:
648 primitive_type
649 | reference_type
650 ;
652 primitive_type:
653 INTEGRAL_TK
654 | FP_TK
655 | BOOLEAN_TK
656 ;
658 reference_type:
659 class_or_interface_type
660 | array_type
661 ;
663 class_or_interface_type:
664 name
665 ;
667 class_type:
668 class_or_interface_type /* Default rule */
669 ;
671 interface_type:
672 class_or_interface_type
673 ;
675 array_type:
676 primitive_type dims
677 {
683 }
684 | name dims
685 {
691 }
692 ;
694 /* 19.5 Productions from 6: Names */
695 name:
696 simple_name /* Default rule */
697 | qualified_name /* Default rule */
698 ;
700 simple_name:
701 identifier /* Default rule */
702 ;
704 qualified_name:
705 name DOT_TK identifier
707 ;
709 identifier:
710 ID_TK
711 ;
713 /* 19.6: Production from 7: Packages */
714 compilation_unit:
716 | package_declaration
717 | import_declarations
718 | type_declarations
719 | package_declaration import_declarations
720 | package_declaration type_declarations
721 | import_declarations type_declarations
722 | package_declaration import_declarations type_declarations
723 ;
725 import_declarations:
726 import_declaration
727 {
729 }
730 | import_declarations import_declaration
731 {
733 }
734 ;
736 type_declarations:
737 type_declaration
738 | type_declarations type_declaration
739 ;
741 package_declaration:
742 PACKAGE_TK name SC_TK
743 {
746 }
747 | PACKAGE_TK error
749 | PACKAGE_TK name error
751 ;
753 import_declaration:
754 single_type_import_declaration
755 | type_import_on_demand_declaration
756 ;
758 single_type_import_declaration:
759 IMPORT_TK name SC_TK
760 {
765 {
767 break;
768 last--;
769 }
772 {
775 parse_error_context
779 else
781 }
782 else
784 }
785 | IMPORT_TK error
787 | IMPORT_TK name error
789 ;
791 type_import_on_demand_declaration:
792 IMPORT_TK name DOT_TK MULT_TK SC_TK
793 {
795 tree it;
796 /* Search for duplicates. */
799 break;
800 /* Don't import the same thing more than once, just ignore
801 duplicates (7.5.2) */
803 {
808 }
809 }
810 | IMPORT_TK name DOT_TK error
812 | IMPORT_TK name DOT_TK MULT_TK error
814 ;
816 type_declaration:
817 class_declaration
819 | interface_declaration
821 | empty_statement
822 | error
823 {
824 YYERROR_NOW;
826 }
827 ;
829 /* 19.7 Shortened from the original:
830 modifiers: modifier | modifiers modifier
831 modifier: any of public... */
832 modifiers:
833 MODIFIER_TK
834 {
836 }
837 | modifiers MODIFIER_TK
838 {
841 parse_error_context
844 else
845 {
847 }
848 }
849 ;
851 /* 19.8.1 Production from $8.1: Class Declaration */
852 class_declaration:
853 modifiers CLASS_TK identifier super interfaces
855 class_body
856 | CLASS_TK identifier super interfaces
858 class_body
859 | modifiers CLASS_TK error
861 | CLASS_TK error
863 | CLASS_TK identifier error
864 {
867 }
868 | modifiers CLASS_TK identifier error
870 ;
872 super:
874 | EXTENDS_TK class_type
876 | EXTENDS_TK class_type error
878 | EXTENDS_TK error
880 ;
882 interfaces:
884 | IMPLEMENTS_TK interface_type_list
886 | IMPLEMENTS_TK error
887 {
890 }
891 ;
893 interface_type_list:
894 interface_type
895 {
898 }
899 | interface_type_list C_TK interface_type
900 {
903 }
904 | interface_type_list C_TK error
906 ;
908 class_body:
909 OCB_TK CCB_TK
910 {
911 /* Store the location of the `}' when doing xrefs */
916 }
917 | OCB_TK class_body_declarations CCB_TK
918 {
919 /* Store the location of the `}' when doing xrefs */
924 }
925 ;
927 class_body_declarations:
928 class_body_declaration
929 | class_body_declarations class_body_declaration
930 ;
932 class_body_declaration:
933 class_member_declaration
934 | static_initializer
935 | constructor_declaration
936 | block /* Added, JDK1.1, instance initializer */
937 {
939 {
942 }
943 }
944 ;
946 class_member_declaration:
947 field_declaration
948 | method_declaration
949 | class_declaration /* Added, JDK1.1 inner classes */
951 | interface_declaration /* Added, JDK1.1 inner interfaces */
953 | empty_statement
954 ;
956 /* 19.8.2 Productions from 8.3: Field Declarations */
957 field_declaration:
958 type variable_declarators SC_TK
960 | modifiers type variable_declarators SC_TK
961 {
962 check_modifiers
967 }
968 ;
970 variable_declarators:
971 /* Should we use build_decl_list () instead ? FIXME */
972 variable_declarator /* Default rule */
973 | variable_declarators C_TK variable_declarator
975 | variable_declarators C_TK error
977 ;
979 variable_declarator:
980 variable_declarator_id
982 | variable_declarator_id ASSIGN_TK variable_initializer
983 {
986 $$ = build_tree_list
988 }
989 | variable_declarator_id ASSIGN_TK error
990 {
993 RECOVER;
994 }
995 | variable_declarator_id ASSIGN_TK variable_initializer error
996 {
999 RECOVER;
1000 }
1001 ;
1003 variable_declarator_id:
1004 identifier
1005 | variable_declarator_id OSB_TK CSB_TK
1007 | identifier error
1009 | variable_declarator_id OSB_TK error
1010 {
1015 else
1018 }
1019 | variable_declarator_id CSB_TK error
1021 ;
1023 variable_initializer:
1024 expression
1025 | array_initializer
1026 ;
1028 /* 19.8.3 Productions from 8.4: Method Declarations */
1029 method_declaration:
1030 method_header
1031 {
1033 if (current_function_decl
1036 else
1038 }
1039 method_body
1041 | method_header error
1043 ;
1045 method_header:
1046 type method_declarator throws
1048 | VOID_TK method_declarator throws
1050 | modifiers type method_declarator throws
1052 | modifiers VOID_TK method_declarator throws
1054 | type error
1055 {
1057 RECOVER;
1058 }
1059 | modifiers type error
1061 | VOID_TK error
1063 | modifiers VOID_TK error
1065 | modifiers error
1066 {
1068 RECOVER;
1069 }
1070 ;
1072 method_declarator:
1073 identifier OP_TK CP_TK
1074 {
1077 }
1078 | identifier OP_TK formal_parameter_list CP_TK
1080 | method_declarator OSB_TK CSB_TK
1081 {
1085 parse_warning_context
1088 }
1089 | identifier OP_TK error
1091 | method_declarator OSB_TK error
1093 ;
1095 formal_parameter_list:
1096 formal_parameter
1097 {
1099 }
1100 | formal_parameter_list C_TK formal_parameter
1101 {
1104 }
1105 | formal_parameter_list C_TK error
1107 ;
1109 formal_parameter:
1110 type variable_declarator_id
1111 {
1113 }
1114 | final type variable_declarator_id /* Added, JDK1.1 final parms */
1115 {
1118 }
1119 | type error
1120 {
1123 }
1124 | final type error
1125 {
1128 }
1129 ;
1131 final:
1132 modifiers
1133 {
1138 }
1139 ;
1141 throws:
1143 | THROWS_TK class_type_list
1145 | THROWS_TK error
1147 ;
1149 class_type_list:
1150 class_type
1152 | class_type_list C_TK class_type
1154 | class_type_list C_TK error
1156 ;
1158 method_body:
1159 block
1161 ;
1163 /* 19.8.4 Productions from 8.5: Static Initializers */
1164 static_initializer:
1165 static block
1166 {
1170 }
1171 ;
1174 modifiers
1175 {
1177 /* Can't have a static initializer in an innerclass */
1180 parse_error_context
1182 "Can't define static initializer in class `%s'. Static initializer can only be defined in top-level classes",
1185 }
1186 ;
1188 /* 19.8.5 Productions from 8.6: Constructor Declarations */
1189 constructor_declaration:
1190 constructor_header
1191 {
1194 }
1195 constructor_body
1197 ;
1199 constructor_header:
1200 constructor_declarator throws
1202 | modifiers constructor_declarator throws
1204 ;
1206 constructor_declarator:
1207 simple_name OP_TK CP_TK
1208 {
1211 }
1212 | simple_name OP_TK formal_parameter_list CP_TK
1214 ;
1216 constructor_body:
1217 /* Unlike regular method, we always need a complete (empty)
1218 body so we can safely perform all the required code
1219 addition (super invocation and field initialization) */
1220 block_begin constructor_block_end
1221 {
1224 }
1225 | block_begin explicit_constructor_invocation constructor_block_end
1227 | block_begin block_statements constructor_block_end
1229 | block_begin explicit_constructor_invocation block_statements constructor_block_end
1231 ;
1233 constructor_block_end:
1234 block_end
1235 ;
1237 /* Error recovery for that rule moved down expression_statement: rule. */
1238 explicit_constructor_invocation:
1239 this_or_super OP_TK CP_TK SC_TK
1240 {
1244 }
1245 | this_or_super OP_TK argument_list CP_TK SC_TK
1246 {
1250 }
1251 /* Added, JDK1.1 inner classes. Modified because the rule
1252 'primary' couldn't work. */
1253 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK SC_TK
1255 | name DOT_TK SUPER_TK OP_TK CP_TK SC_TK
1257 ;
1260 THIS_TK
1261 {
1265 }
1266 | SUPER_TK
1267 {
1271 }
1272 ;
1274 /* 19.9 Productions from 9: Interfaces */
1275 /* 19.9.1 Productions from 9.1: Interfaces Declarations */
1276 interface_declaration:
1277 INTERFACE_TK identifier
1279 interface_body
1280 | modifiers INTERFACE_TK identifier
1282 interface_body
1283 | INTERFACE_TK identifier extends_interfaces
1285 interface_body
1286 | modifiers INTERFACE_TK identifier extends_interfaces
1288 interface_body
1289 | INTERFACE_TK identifier error
1291 | modifiers INTERFACE_TK identifier error
1293 ;
1295 extends_interfaces:
1296 EXTENDS_TK interface_type
1297 {
1300 }
1301 | extends_interfaces C_TK interface_type
1302 {
1305 }
1306 | EXTENDS_TK error
1308 | extends_interfaces C_TK error
1310 ;
1312 interface_body:
1313 OCB_TK CCB_TK
1315 | OCB_TK interface_member_declarations CCB_TK
1317 ;
1319 interface_member_declarations:
1320 interface_member_declaration
1321 | interface_member_declarations interface_member_declaration
1322 ;
1324 interface_member_declaration:
1325 constant_declaration
1326 | abstract_method_declaration
1327 | class_declaration /* Added, JDK1.1 inner classes */
1329 | interface_declaration /* Added, JDK1.1 inner interfaces */
1331 ;
1333 constant_declaration:
1334 field_declaration
1335 ;
1337 abstract_method_declaration:
1338 method_header SC_TK
1339 {
1342 }
1343 | method_header error
1345 ;
1347 /* 19.10 Productions from 10: Arrays */
1348 array_initializer:
1349 OCB_TK CCB_TK
1351 | OCB_TK C_TK CCB_TK
1353 | OCB_TK variable_initializers CCB_TK
1355 | OCB_TK variable_initializers C_TK CCB_TK
1357 ;
1359 variable_initializers:
1360 variable_initializer
1361 {
1364 }
1365 | variable_initializers C_TK variable_initializer
1366 {
1368 }
1369 | variable_initializers C_TK error
1371 ;
1373 /* 19.11 Production from 14: Blocks and Statements */
1374 block:
1375 OCB_TK CCB_TK
1376 {
1377 /* Store the location of the `}' when doing xrefs */
1382 }
1383 | block_begin block_statements block_end
1385 ;
1387 block_begin:
1388 OCB_TK
1390 ;
1392 block_end:
1393 CCB_TK
1394 {
1395 maybe_absorb_scoping_blocks ();
1396 /* Store the location of the `}' when doing xrefs */
1403 }
1404 ;
1406 block_statements:
1407 block_statement
1408 | block_statements block_statement
1409 ;
1411 block_statement:
1412 local_variable_declaration_statement
1413 | statement
1415 | class_declaration /* Added, JDK1.1 local classes */
1416 {
1419 }
1420 ;
1422 local_variable_declaration_statement:
1423 local_variable_declaration SC_TK /* Can't catch missing ';' here */
1424 ;
1426 local_variable_declaration:
1427 type variable_declarators
1429 | final type variable_declarators /* Added, JDK1.1 final locals */
1431 ;
1433 statement:
1434 statement_without_trailing_substatement
1435 | labeled_statement
1436 | if_then_statement
1437 | if_then_else_statement
1438 | while_statement
1439 | for_statement
1441 ;
1443 statement_nsi:
1444 statement_without_trailing_substatement
1445 | labeled_statement_nsi
1446 | if_then_else_statement_nsi
1447 | while_statement_nsi
1448 | for_statement_nsi
1450 ;
1452 statement_without_trailing_substatement:
1453 block
1454 | empty_statement
1455 | expression_statement
1456 | switch_statement
1457 | do_statement
1458 | break_statement
1459 | continue_statement
1460 | return_statement
1461 | synchronized_statement
1462 | throw_statement
1463 | try_statement
1464 ;
1466 empty_statement:
1467 SC_TK
1468 {
1469 if (flag_extraneous_semicolon
1470 && ! current_static_block
1471 && (! current_function_decl ||
1472 /* Verify we're not in a inner class declaration */
1476 {
1478 parse_warning_context (wfl_operator, "An empty declaration is a deprecated feature that should not be used");
1479 }
1481 }
1482 ;
1484 label_decl:
1485 identifier REL_CL_TK
1486 {
1492 }
1493 ;
1495 labeled_statement:
1496 label_decl statement
1498 | identifier error
1500 ;
1502 labeled_statement_nsi:
1503 label_decl statement_nsi
1505 ;
1507 /* We concentrate here a bunch of error handling rules that we couldn't write
1508 earlier, because expression_statement catches a missing ';'. */
1509 expression_statement:
1510 statement_expression SC_TK
1511 {
1512 /* We have a statement. Generate a WFL around it so
1513 we can debug it */
1515 /* We know we have a statement, so set the debug
1516 info to be eventually generate here. */
1518 }
1519 | error SC_TK
1520 {
1523 }
1524 | error OCB_TK
1525 {
1528 }
1529 | error CCB_TK
1530 {
1533 }
1534 | this_or_super OP_TK error
1536 | this_or_super OP_TK CP_TK error
1537 {
1538 parse_ctor_invocation_error ();
1539 RECOVER;
1540 }
1541 | this_or_super OP_TK argument_list error
1543 | this_or_super OP_TK argument_list CP_TK error
1544 {
1545 parse_ctor_invocation_error ();
1546 RECOVER;
1547 }
1548 | name DOT_TK SUPER_TK error
1550 | name DOT_TK SUPER_TK OP_TK error
1552 | name DOT_TK SUPER_TK OP_TK argument_list error
1554 | name DOT_TK SUPER_TK OP_TK argument_list CP_TK error
1556 | name DOT_TK SUPER_TK OP_TK CP_TK error
1558 ;
1560 statement_expression:
1561 assignment
1562 | pre_increment_expression
1563 | pre_decrement_expression
1564 | post_increment_expression
1565 | post_decrement_expression
1566 | method_invocation
1567 | class_instance_creation_expression
1568 ;
1570 if_then_statement:
1571 IF_TK OP_TK expression CP_TK statement
1572 {
1575 }
1576 | IF_TK error
1578 | IF_TK OP_TK error
1580 | IF_TK OP_TK expression error
1582 ;
1584 if_then_else_statement:
1585 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement
1587 ;
1589 if_then_else_statement_nsi:
1590 IF_TK OP_TK expression CP_TK statement_nsi ELSE_TK statement_nsi
1592 ;
1594 switch_statement:
1595 switch_expression
1596 {
1597 enter_block ();
1598 }
1599 switch_block
1600 {
1601 /* Make into "proper list" of COMPOUND_EXPRs.
1602 I.e. make the last statment also have its own
1603 COMPOUND_EXPR. */
1604 maybe_absorb_scoping_blocks ();
1607 }
1608 ;
1610 switch_expression:
1611 SWITCH_TK OP_TK expression CP_TK
1612 {
1615 }
1616 | SWITCH_TK error
1618 | SWITCH_TK OP_TK error
1620 | SWITCH_TK OP_TK expression CP_TK error
1622 ;
1624 /* Default assignment is there to avoid type node on switch_block
1625 node. */
1627 switch_block:
1628 OCB_TK CCB_TK
1630 | OCB_TK switch_labels CCB_TK
1632 | OCB_TK switch_block_statement_groups CCB_TK
1634 | OCB_TK switch_block_statement_groups switch_labels CCB_TK
1636 ;
1638 switch_block_statement_groups:
1639 switch_block_statement_group
1640 | switch_block_statement_groups switch_block_statement_group
1641 ;
1643 switch_block_statement_group:
1644 switch_labels block_statements
1645 ;
1647 switch_labels:
1648 switch_label
1649 | switch_labels switch_label
1650 ;
1652 switch_label:
1653 CASE_TK constant_expression REL_CL_TK
1654 {
1658 }
1659 | DEFAULT_TK REL_CL_TK
1660 {
1664 }
1665 | CASE_TK error
1667 | CASE_TK constant_expression error
1669 | DEFAULT_TK error
1671 ;
1673 while_expression:
1674 WHILE_TK OP_TK expression CP_TK
1675 {
1678 }
1679 ;
1681 while_statement:
1682 while_expression statement
1684 | WHILE_TK error
1686 | WHILE_TK OP_TK error
1688 | WHILE_TK OP_TK expression error
1690 ;
1692 while_statement_nsi:
1693 while_expression statement_nsi
1695 ;
1697 do_statement_begin:
1698 DO_TK
1699 {
1702 }
1703 /* Need error handing here. FIXME */
1704 ;
1706 do_statement:
1707 do_statement_begin statement WHILE_TK OP_TK expression CP_TK SC_TK
1709 ;
1711 for_statement:
1712 for_begin SC_TK expression SC_TK for_update CP_TK statement
1713 {
1717 }
1718 | for_begin SC_TK SC_TK for_update CP_TK statement
1719 {
1721 /* We have not condition, so we get rid of the EXIT_EXPR */
1723 empty_stmt_node;
1724 }
1725 | for_begin SC_TK error
1727 | for_begin SC_TK expression SC_TK error
1729 | for_begin SC_TK SC_TK error
1731 ;
1733 for_statement_nsi:
1734 for_begin SC_TK expression SC_TK for_update CP_TK statement_nsi
1736 | for_begin SC_TK SC_TK for_update CP_TK statement_nsi
1737 {
1739 /* We have not condition, so we get rid of the EXIT_EXPR */
1741 empty_stmt_node;
1742 }
1743 ;
1745 for_header:
1746 FOR_TK OP_TK
1747 {
1748 /* This scope defined for local variable that may be
1749 defined within the scope of the for loop */
1750 enter_block ();
1751 }
1752 | FOR_TK error
1754 | FOR_TK OP_TK error
1756 ;
1758 for_begin:
1759 for_header for_init
1760 {
1761 /* We now declare the loop body. The loop is
1762 declared as a for loop. */
1766 /* The loop is added to the current block the for
1767 statement is defined within */
1769 }
1770 ;
1773 | statement_expression_list
1774 {
1775 /* Init statement recorded within the previously
1776 defined block scope */
1778 }
1779 | local_variable_declaration
1780 {
1781 /* Local variable are recorded within the previously
1782 defined block scope */
1784 }
1785 | statement_expression_list error
1787 ;
1791 | statement_expression_list
1793 ;
1795 statement_expression_list:
1796 statement_expression
1798 | statement_expression_list C_TK statement_expression
1800 | statement_expression_list C_TK error
1802 ;
1804 break_statement:
1805 BREAK_TK SC_TK
1807 | BREAK_TK identifier SC_TK
1809 | BREAK_TK error
1811 | BREAK_TK identifier error
1813 ;
1815 continue_statement:
1816 CONTINUE_TK SC_TK
1818 | CONTINUE_TK identifier SC_TK
1820 | CONTINUE_TK error
1822 | CONTINUE_TK identifier error
1824 ;
1826 return_statement:
1827 RETURN_TK SC_TK
1829 | RETURN_TK expression SC_TK
1831 | RETURN_TK error
1833 | RETURN_TK expression error
1835 ;
1837 throw_statement:
1838 THROW_TK expression SC_TK
1839 {
1842 }
1843 | THROW_TK error
1845 | THROW_TK expression error
1847 ;
1849 synchronized_statement:
1850 synchronized OP_TK expression CP_TK block
1851 {
1855 }
1856 | synchronized OP_TK expression CP_TK error
1858 | synchronized error
1860 | synchronized OP_TK error CP_TK
1862 | synchronized OP_TK error
1864 ;
1866 synchronized:
1867 modifiers
1868 {
1869 check_modifiers (
1875 }
1876 ;
1878 try_statement:
1879 TRY_TK block catches
1881 | TRY_TK block finally
1883 | TRY_TK block catches finally
1887 }
1888 | TRY_TK error
1890 ;
1892 catches:
1893 catch_clause
1894 | catches catch_clause
1895 {
1898 }
1899 ;
1901 catch_clause:
1902 catch_clause_parameter block
1903 {
1905 exit_block ();
1907 }
1909 catch_clause_parameter:
1910 CATCH_TK OP_TK formal_parameter CP_TK
1911 {
1912 /* We add a block to define a scope for
1913 formal_parameter (CCBP). The formal parameter is
1914 declared initialized by the appropriate function
1915 call */
1917 tree init = build_assignment
1922 init));
1925 }
1926 | CATCH_TK error
1928 | CATCH_TK OP_TK error
1929 {
1932 }
1935 ;
1937 finally:
1938 FINALLY_TK block
1940 | FINALLY_TK error
1942 ;
1944 /* 19.12 Production from 15: Expressions */
1945 primary:
1946 primary_no_new_array
1947 | array_creation_expression
1948 ;
1950 primary_no_new_array:
1951 literal
1952 | THIS_TK
1954 | OP_TK expression CP_TK
1956 | class_instance_creation_expression
1957 | field_access
1958 | method_invocation
1959 | array_access
1960 | type_literals
1961 /* Added, JDK1.1 inner classes. Documentation is wrong
1962 refering to a 'ClassName' (class_name) rule that doesn't
1963 exist. Used name: instead. */
1964 | name DOT_TK THIS_TK
1965 {
1968 }
1969 | OP_TK expression error
1971 | name DOT_TK error
1973 | primitive_type DOT_TK error
1975 | VOID_TK DOT_TK error
1977 ;
1979 type_literals:
1980 name DOT_TK CLASS_TK
1982 | array_type DOT_TK CLASS_TK
1984 | primitive_type DOT_TK CLASS_TK
1986 | VOID_TK DOT_TK CLASS_TK
1987 {
1989 void_type_node);
1990 }
1991 ;
1993 class_instance_creation_expression:
1994 NEW_TK class_type OP_TK argument_list CP_TK
1996 | NEW_TK class_type OP_TK CP_TK
1998 | anonymous_class_creation
1999 /* Added, JDK1.1 inner classes, modified to use name or
2000 primary instead of primary solely which couldn't work in
2001 all situations. */
2002 | something_dot_new identifier OP_TK CP_TK
2003 {
2007 }
2008 | something_dot_new identifier OP_TK CP_TK class_body
2009 | something_dot_new identifier OP_TK argument_list CP_TK
2010 {
2014 }
2015 | something_dot_new identifier OP_TK argument_list CP_TK class_body
2016 | NEW_TK error SC_TK
2018 | NEW_TK class_type error
2020 | NEW_TK class_type OP_TK error
2022 | NEW_TK class_type OP_TK argument_list error
2024 | something_dot_new error
2026 | something_dot_new identifier error
2028 ;
2030 /* Created after JDK1.1 rules originally added to
2031 class_instance_creation_expression, but modified to use
2032 'class_type' instead of 'TypeName' (type_name) which is mentionned
2033 in the documentation but doesn't exist. */
2035 anonymous_class_creation:
2036 NEW_TK class_type OP_TK argument_list CP_TK
2038 class_body
2039 {
2045 /* Now we can craft the new expression */
2048 /* Note that we can't possibly be here if
2049 `class_type' is an interface (in which case the
2050 anonymous class extends Object and implements
2051 `class_type', hence its constructor can't have
2052 arguments.) */
2054 /* Otherwise, the innerclass must feature a
2055 constructor matching `argument_list'. Anonymous
2056 classes are a bit special: it's impossible to
2057 define constructor for them, hence constructors
2058 must be generated following the hints provided by
2059 the `new' expression. Whether a super constructor
2060 of that nature exists or not is to be verified
2061 later on in verify_constructor_super.
2063 It's during the expansion of a `new' statement
2064 refering to an anonymous class that a ctor will
2065 be generated for the anonymous class, with the
2066 right arguments. */
2068 }
2069 | NEW_TK class_type OP_TK CP_TK
2071 class_body
2072 {
2078 /* Now we can craft the new expression. The
2079 statement doesn't need to be remember so that a
2080 constructor can be generated, since its signature
2081 is already known. */
2083 }
2084 ;
2087 name DOT_TK NEW_TK
2089 | primary DOT_TK NEW_TK
2091 ;
2093 argument_list:
2094 expression
2095 {
2098 }
2099 | argument_list C_TK expression
2100 {
2103 }
2104 | argument_list C_TK error
2106 ;
2108 array_creation_expression:
2109 NEW_TK primitive_type dim_exprs
2111 | NEW_TK class_or_interface_type dim_exprs
2113 | NEW_TK primitive_type dim_exprs dims
2115 | NEW_TK class_or_interface_type dim_exprs dims
2117 /* Added, JDK1.1 anonymous array. Initial documentation rule
2118 modified */
2119 | NEW_TK class_or_interface_type dims array_initializer
2120 {
2128 }
2129 | NEW_TK primitive_type dims array_initializer
2130 {
2137 }
2138 | NEW_TK error CSB_TK
2140 | NEW_TK error OSB_TK
2142 ;
2144 dim_exprs:
2145 dim_expr
2147 | dim_exprs dim_expr
2149 ;
2151 dim_expr:
2152 OSB_TK expression CSB_TK
2153 {
2155 {
2158 }
2161 }
2162 | OSB_TK expression error
2164 | OSB_TK error
2165 {
2168 RECOVER;
2169 }
2170 ;
2172 dims:
2173 OSB_TK CSB_TK
2174 {
2176 /* If not initialized, allocate memory for the osb
2177 numbers stack */
2179 {
2182 }
2183 /* If capacity overflown, reallocate a bigger chunk */
2188 {
2192 allocate);
2193 else
2195 }
2198 }
2199 | dims OSB_TK CSB_TK
2201 | dims OSB_TK error
2203 ;
2205 field_access:
2206 primary DOT_TK identifier
2208 /* FIXME - REWRITE TO:
2209 { $$ = build_binop (COMPONENT_REF, $2.location, $1, $3); } */
2210 | SUPER_TK DOT_TK identifier
2211 {
2215 }
2216 | SUPER_TK error
2218 ;
2220 method_invocation:
2221 name OP_TK CP_TK
2223 | name OP_TK argument_list CP_TK
2225 | primary DOT_TK identifier OP_TK CP_TK
2226 {
2228 $$ = build_this_super_qualified_invocation
2230 else
2231 {
2234 }
2235 }
2236 | primary DOT_TK identifier OP_TK argument_list CP_TK
2237 {
2239 $$ = build_this_super_qualified_invocation
2241 else
2242 {
2245 }
2246 }
2247 | SUPER_TK DOT_TK identifier OP_TK CP_TK
2248 {
2249 $$ = build_this_super_qualified_invocation
2251 }
2252 | SUPER_TK DOT_TK identifier OP_TK argument_list CP_TK
2253 {
2254 $$ = build_this_super_qualified_invocation
2256 }
2257 /* Screws up thing. I let it here until I'm convinced it can
2258 be removed. FIXME
2259 | primary DOT_TK error
2260 {yyerror ("'(' expected"); DRECOVER(bad);} */
2261 | SUPER_TK DOT_TK error CP_TK
2263 | SUPER_TK DOT_TK error DOT_TK
2265 ;
2267 array_access:
2268 name OSB_TK expression CSB_TK
2270 | primary_no_new_array OSB_TK expression CSB_TK
2272 | name OSB_TK error
2273 {
2276 }
2277 | name OSB_TK expression error
2278 {
2281 }
2282 | primary_no_new_array OSB_TK error
2283 {
2286 }
2287 | primary_no_new_array OSB_TK expression error
2288 {
2291 }
2292 ;
2294 postfix_expression:
2295 primary
2296 | name
2297 | post_increment_expression
2298 | post_decrement_expression
2299 ;
2301 post_increment_expression:
2302 postfix_expression INCR_TK
2304 ;
2306 post_decrement_expression:
2307 postfix_expression DECR_TK
2309 ;
2311 unary_expression:
2312 pre_increment_expression
2313 | pre_decrement_expression
2314 | PLUS_TK unary_expression
2316 | MINUS_TK unary_expression
2318 | unary_expression_not_plus_minus
2319 | PLUS_TK error
2321 | MINUS_TK error
2323 ;
2325 pre_increment_expression:
2326 INCR_TK unary_expression
2328 | INCR_TK error
2330 ;
2332 pre_decrement_expression:
2333 DECR_TK unary_expression
2335 | DECR_TK error
2337 ;
2339 unary_expression_not_plus_minus:
2340 postfix_expression
2341 | NOT_TK unary_expression
2343 | NEG_TK unary_expression
2345 | cast_expression
2346 | NOT_TK error
2348 | NEG_TK error
2350 ;
2353 OP_TK primitive_type dims CP_TK unary_expression
2354 {
2360 }
2361 | OP_TK primitive_type CP_TK unary_expression
2363 | OP_TK expression CP_TK unary_expression_not_plus_minus
2365 | OP_TK name dims CP_TK unary_expression_not_plus_minus
2366 {
2377 }
2378 | OP_TK primitive_type OSB_TK error
2380 | OP_TK error
2381 {
2383 RECOVER;
2384 }
2385 | OP_TK primitive_type dims CP_TK error
2387 | OP_TK primitive_type CP_TK error
2389 | OP_TK name dims CP_TK error
2391 ;
2393 multiplicative_expression:
2394 unary_expression
2395 | multiplicative_expression MULT_TK unary_expression
2396 {
2399 }
2400 | multiplicative_expression DIV_TK unary_expression
2401 {
2404 }
2405 | multiplicative_expression REM_TK unary_expression
2406 {
2409 }
2410 | multiplicative_expression MULT_TK error
2412 | multiplicative_expression DIV_TK error
2414 | multiplicative_expression REM_TK error
2416 ;
2418 additive_expression:
2419 multiplicative_expression
2420 | additive_expression PLUS_TK multiplicative_expression
2421 {
2424 }
2425 | additive_expression MINUS_TK multiplicative_expression
2426 {
2429 }
2430 | additive_expression PLUS_TK error
2432 | additive_expression MINUS_TK error
2434 ;
2436 shift_expression:
2437 additive_expression
2438 | shift_expression LS_TK additive_expression
2439 {
2442 }
2443 | shift_expression SRS_TK additive_expression
2444 {
2447 }
2448 | shift_expression ZRS_TK additive_expression
2449 {
2452 }
2453 | shift_expression LS_TK error
2455 | shift_expression SRS_TK error
2457 | shift_expression ZRS_TK error
2459 ;
2461 relational_expression:
2462 shift_expression
2463 | relational_expression LT_TK shift_expression
2464 {
2467 }
2468 | relational_expression GT_TK shift_expression
2469 {
2472 }
2473 | relational_expression LTE_TK shift_expression
2474 {
2477 }
2478 | relational_expression GTE_TK shift_expression
2479 {
2482 }
2483 | relational_expression INSTANCEOF_TK reference_type
2485 | relational_expression LT_TK error
2487 | relational_expression GT_TK error
2489 | relational_expression LTE_TK error
2491 | relational_expression GTE_TK error
2493 | relational_expression INSTANCEOF_TK error
2495 ;
2497 equality_expression:
2498 relational_expression
2499 | equality_expression EQ_TK relational_expression
2500 {
2503 }
2504 | equality_expression NEQ_TK relational_expression
2505 {
2508 }
2509 | equality_expression EQ_TK error
2511 | equality_expression NEQ_TK error
2513 ;
2515 and_expression:
2516 equality_expression
2517 | and_expression AND_TK equality_expression
2518 {
2521 }
2522 | and_expression AND_TK error
2524 ;
2526 exclusive_or_expression:
2527 and_expression
2528 | exclusive_or_expression XOR_TK and_expression
2529 {
2532 }
2533 | exclusive_or_expression XOR_TK error
2535 ;
2537 inclusive_or_expression:
2538 exclusive_or_expression
2539 | inclusive_or_expression OR_TK exclusive_or_expression
2540 {
2543 }
2544 | inclusive_or_expression OR_TK error
2546 ;
2548 conditional_and_expression:
2549 inclusive_or_expression
2550 | conditional_and_expression BOOL_AND_TK inclusive_or_expression
2551 {
2554 }
2555 | conditional_and_expression BOOL_AND_TK error
2557 ;
2559 conditional_or_expression:
2560 conditional_and_expression
2561 | conditional_or_expression BOOL_OR_TK conditional_and_expression
2562 {
2565 }
2566 | conditional_or_expression BOOL_OR_TK error
2568 ;
2571 conditional_or_expression
2572 | conditional_or_expression REL_QM_TK expression REL_CL_TK conditional_expression
2573 {
2576 }
2577 | conditional_or_expression REL_QM_TK REL_CL_TK error
2578 {
2579 YYERROR_NOW;
2582 }
2583 | conditional_or_expression REL_QM_TK error
2585 | conditional_or_expression REL_QM_TK expression REL_CL_TK error
2587 ;
2589 assignment_expression:
2590 conditional_expression
2591 | assignment
2592 ;
2594 assignment:
2595 left_hand_side assignment_operator assignment_expression
2597 | left_hand_side assignment_operator error
2598 {
2601 }
2602 ;
2604 left_hand_side:
2605 name
2606 | field_access
2607 | array_access
2608 ;
2610 assignment_operator:
2611 ASSIGN_ANY_TK
2612 | ASSIGN_TK
2613 ;
2615 expression:
2616 assignment_expression
2617 ;
2619 constant_expression:
2620 expression
2621 ;
2623 %%
2625 /* Helper function to retrieve an OSB count. Should be used when the
2626 `dims:' rule is being used. */
2628 static int
2631 {
2635 abort ();
2640 return to_return;
2641 }
2643 \f
2645 /* This section of the code deal with save/restoring parser contexts.
2646 Add mode documentation here. FIXME */
2648 /* Helper function. Create a new parser context. With
2649 COPY_FROM_PREVIOUS set to a non zero value, content of the previous
2650 context is copied, otherwise, the new context is zeroed. The newly
2651 created context becomes the current one. */
2653 static void
2656 {
2661 {
2664 }
2665 else
2670 }
2672 /* Create a new parser context and make it the current one. */
2674 void
2675 java_push_parser_context ()
2676 {
2678 }
2680 void
2683 {
2684 tree current;
2688 return;
2693 {
2696 }
2698 /* If the old and new lexers differ, then free the old one. */
2702 /* Set the single import class file flag to 0 for the current list
2703 of imported things */
2707 /* And restore those of the previous context */
2712 /* If we pushed a context to parse a class intended to be generated,
2713 we keep it so we can remember the class. What we could actually
2714 do is to just update a list of class names. */
2716 {
2719 }
2720 else
2722 }
2724 /* Create a parser context for the use of saving some global
2725 variables. */
2727 void
2728 java_parser_context_save_global ()
2729 {
2731 {
2732 java_push_parser_context ();
2734 }
2736 /* If this context already stores data, create a new one suitable
2737 for data storage. */
2746 }
2748 /* Restore some global variables from the previous context. Make the
2749 previous context the current one. */
2751 void
2752 java_parser_context_restore_global ()
2753 {
2758 {
2759 tree s;
2762 }
2767 }
2769 /* Suspend vital data for the current class/function being parsed so
2770 that an other class can be parsed. Used to let local/anonymous
2771 classes be parsed. */
2773 static void
2774 java_parser_context_suspend ()
2775 {
2776 /* This makes debugging through java_debug_context easier */
2779 /* Duplicate the previous context, use it to save the globals we're
2780 interested in */
2785 /* Then create a new context which inherits all data from the
2786 previous one. This will be the new current context */
2789 /* Help debugging */
2791 }
2793 /* Resume vital data for the current class/function being parsed so
2794 that an other class can be parsed. Used to let local/anonymous
2795 classes be parsed. The trick is the data storing file position
2796 informations must be restored to their current value, so parsing
2797 can resume as if no context was ever saved. */
2799 static void
2800 java_parser_context_resume ()
2801 {
2806 /* We need to inherit the list of classes to complete/generate */
2810 /* Restore the current class and function from the saver */
2814 /* Retrive the restored context */
2817 /* Re-installed the data for the parsing to carry on */
2821 /* Buffer context can now be discarded */
2824 }
2826 /* Add a new anchor node to which all statement(s) initializing static
2827 and non static initialized upon declaration field(s) will be
2828 linked. */
2830 static void
2831 java_parser_context_push_initialized_field ()
2832 {
2833 tree node;
2846 }
2848 /* Pop the lists of initialized field. If this lists aren't empty,
2849 remember them so we can use it to create and populate the finit$
2850 or <clinit> functions. */
2852 static void
2853 java_parser_context_pop_initialized_field ()
2854 {
2855 tree stmts;
2859 {
2864 }
2867 {
2871 /* Keep initialization in order to enforce 8.5 */
2874 }
2876 /* JDK 1.1 instance initializers */
2878 {
2884 }
2885 }
2887 static tree
2889 tree list;
2890 {
2891 /* We have to keep things in order. The alias initializer have to
2892 come first, then the initialized regular field, in reverse to
2893 keep them in lexical order. */
2898 break;
2900 /* No static initialized, the list is fine as is */
2904 /* No marker? reverse the whole list */
2908 /* Otherwise, reverse what's after the marker and the new reordered
2909 sublist will replace the marker. */
2910 else
2911 {
2915 }
2916 return list;
2917 }
2919 /* Helper functions to dump the parser context stack. */
2921 #define TAB_CONTEXT(C) \
2924 static void
2927 {
2930 {
2947 }
2948 }
2950 /* Dump the stacked up parser contexts. Intended to be called from a
2951 debugger. */
2953 void
2954 java_debug_context ()
2955 {
2957 }
2959 \f
2961 /* Flag for the error report routine to issue the error the first time
2962 it's called (overriding the default behavior which is to drop the
2963 first invocation and honor the second one, taking advantage of a
2964 richer context. */
2967 /* Reporting an constructor invocation error. */
2968 static void
2969 parse_ctor_invocation_error ()
2970 {
2973 else
2975 }
2977 /* Reporting JDK1.1 features not implemented. */
2979 static tree
2982 {
2984 java_error_count++;
2985 return empty_stmt_node;
2986 }
2990 void
2993 {
3002 return;
3004 /* Save current error location but report latter, when the context is
3005 richer. */
3007 {
3010 /* Do something to use the previous line if we're reaching the
3011 end of the file... */
3012 #ifdef VERBOSE_SKELETON
3014 #endif
3015 return;
3016 }
3018 /* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
3020 return;
3024 java_warning_count++;
3025 else
3026 java_error_count++;
3029 {
3032 }
3044 else
3047 /* This allow us to cheaply avoid an extra 'Invalid expression
3048 statement' error report when errors have been already reported on
3049 the same line. This occurs when we report an error but don't have
3050 a synchronization point other than ';', which
3051 expression_statement is the only one to take care of. */
3053 }
3055 static void
3057 tree cl;
3060 {
3070 /* We have a CL, that's a good reason for using it if it contains data */
3081 }
3083 /* Issue an error message at a current source line CL */
3085 void
3087 {
3088 #ifndef ANSI_PROTOTYPES
3089 tree cl;
3091 #endif
3095 #ifndef ANSI_PROTOTYPES
3098 #endif
3101 }
3103 /* Issue a warning at a current source line CL */
3105 static void
3107 {
3108 #ifndef ANSI_PROTOTYPES
3109 tree cl;
3111 #endif
3115 #ifndef ANSI_PROTOTYPES
3118 #endif
3124 }
3126 static tree
3128 tree node;
3129 {
3131 {
3133 tree to_return;
3136 {
3137 case BLOCK:
3139 continue;
3141 case COMPOUND_EXPR:
3144 return to_return;
3146 continue;
3148 case LOOP_EXPR:
3150 continue;
3152 case LABELED_BLOCK_EXPR:
3154 continue;
3156 default:
3160 return node;
3161 return NULL_TREE;
3162 }
3163 }
3164 return NULL_TREE;
3165 }
3167 /* Issue a missing return statement error. Uses METHOD to figure the
3168 last line of the method the error occurs in. */
3170 static void
3172 tree method;
3173 {
3176 }
3178 /* Issue an unreachable statement error. From NODE, find the next
3179 statement to report appropriately. */
3180 static void
3182 tree node;
3183 {
3184 /* Browse node to find the next expression node that has a WFL. Use
3185 the location to report the error */
3188 else
3192 {
3195 }
3196 else
3197 abort ();
3198 }
3200 int
3201 java_report_errors ()
3202 {
3211 return java_error_count;
3212 }
3217 {
3219 #define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
3221 /* Access modifier looked-up first for easier report on forbidden
3222 access. */
3236 return buffer;
3237 #undef COPY_RETURN
3238 }
3240 /* Issuing error messages upon redefinition of classes, interfaces or
3241 variables. */
3243 static void
3247 {
3251 /* Here we should point out where its redefined. It's a unicode. FIXME */
3252 }
3254 static void
3258 {
3261 /* Figure a proper name for type. We might haven't resolved it */
3264 else
3271 }
3273 static tree
3276 {
3280 /* Eventually get more dims */
3283 more_dims++;
3285 /* If we have, then craft a new type for this variable */
3287 {
3292 /* If we have a pointer, use its type */
3296 /* Building the first dimension of a primitive type uses this
3297 function */
3299 {
3301 more_dims--;
3302 }
3303 /* Otherwise, if we have a WFL for this type, use it (the type
3304 is already an array on an unresolved type, and we just keep
3305 on adding dimensions) */
3307 {
3314 }
3316 /* Add all the dimensions */
3320 /* The type may have been incomplete in the first place */
3323 }
3327 return type;
3328 }
3330 /* Build something that the type identifier resolver will identify as
3331 being an array to an unresolved type. TYPE_WFL is a WFL on a
3332 identifier. */
3334 static tree
3336 tree type_or_wfl;
3337 {
3339 tree wfl;
3341 /* TYPE_OR_WFL might be an array on a resolved type. In this case,
3342 just create a array type */
3355 /* Re-install the existing qualifications so that the type can be
3356 resolved properly. */
3358 return wfl;
3359 }
3361 static void
3364 {
3368 }
3370 /* Bulk of common class/interface checks. Return 1 if an error was
3371 encountered. TAG is 0 for a class, 1 for an interface. */
3373 static int
3377 {
3378 tree node;
3389 /* Scope of an interface/class type name:
3390 - Can't be imported by a single type import
3391 - Can't already exists in the package */
3395 {
3396 parse_error_context
3401 }
3403 {
3407 }
3412 /* If public, file name should match class/interface name, except
3413 when dealing with an inner class */
3415 {
3418 /* Contains OS dependent assumption on path separator. FIXME */
3421 f--)
3422 ;
3424 f++;
3428 parse_error_context
3433 }
3435 /* Static classes can be declared only in top level classes. Note:
3436 once static, a inner class is a top level class. */
3438 {
3439 /* Catch the specific error of declaring an class inner class
3440 with no toplevel enclosing class. Prevent check_modifiers from
3441 complaining a second time */
3443 {
3444 parse_error_context (cl, "Inner class `%s' can't be static. Static classes can only occur in interfaces and top-level classes",
3447 }
3448 /* Else, in the context of a top-level class declaration, let
3449 `check_modifiers' do its job, otherwise, give it a go */
3450 else
3452 }
3454 /* Inner classes can be declared private or protected
3455 within their enclosing classes. */
3457 {
3458 /* A class which is local to a block can't be public, private,
3459 protected or static. But it is created final, so allow this
3460 one. */
3463 else
3464 {
3469 }
3470 }
3473 {
3476 else
3481 }
3482 else
3483 check_modifiers ((current_function_decl ?
3488 }
3490 static void
3492 tree cpc_list;
3493 {
3494 tree name;
3497 return;
3498 else
3501 /* Pick the qualified name when dealing with the first upmost
3502 enclosing class */
3507 /* Why is NO_DOLLAR_IN_LABEL defined? */
3508 #if 0
3509 #ifdef NO_DOLLAR_IN_LABEL
3511 #endif
3512 #endif
3514 }
3516 /* Can't redefine a class already defined in an earlier scope. */
3518 static int
3521 {
3522 tree scope_list;
3527 {
3528 parse_error_context
3529 (cl, "The class name `%s' is already defined in this scope. An inner class may not have the same simple name as any of its enclosing classes",
3532 }
3534 }
3536 /* Tries to find a decl for CLASS_TYPE within ENCLOSING. If we fail,
3537 we remember ENCLOSING and SUPER. */
3539 static tree
3543 {
3548 {
3555 return decl;
3558 /* Explore enclosing contexts. */
3560 {
3563 return decl;
3564 }
3566 /* Now go to the upper classes, bail out if necessary. We will
3567 analyze the returned SUPER and act accordingly (see
3568 do_resolve_class.) */
3571 break;
3575 else
3578 /* We may not have checked for circular inheritance yet, so do so
3579 here to prevent an infinite loop. */
3582 {
3586 parse_error_context
3590 }
3591 else
3593 }
3595 /* We failed. Return LOCAL_SUPER and LOCAL_ENCLOSING. */
3599 return NULL_TREE;
3600 }
3602 /* Within ENCLOSING, find a decl for NAME and return it. NAME can be
3603 qualified. */
3605 static tree
3608 {
3611 return NULL_TREE;
3615 /* First search: within the scope of `enclosing', search for name */
3620 else
3624 return to_return;
3626 /* We're dealing with a qualified name. Try to resolve thing until
3627 we get something that is an enclosing class. */
3629 {
3634 {
3639 /* Don't try to resolve ACC as a class name if it follows
3640 the current package name. We don't want to pick something
3641 that's accidentally there: for example `a.b.c' in package
3642 `a.b' shouldn't trigger loading `a' if it's there by
3643 itself. */
3648 else
3650 }
3652 /* A NULL qual and a decl means that the search ended
3653 successfully?!? We have to do something then. FIXME */
3657 else
3659 }
3660 /* Otherwise, create a qual for the other part of the resolution. */
3661 else
3665 }
3667 /* We go inside the list of sub classes and try to find a way
3668 through. */
3670 static tree
3673 {
3675 return NULL_TREE;
3678 {
3681 tree inner_list;
3685 {
3687 {
3689 break;
3690 }
3691 }
3693 }
3696 }
3698 /* Reach all inner classes and tie their unqualified name to a
3699 DECL. */
3701 static void
3703 tree outer;
3705 {
3706 tree l;
3711 }
3713 static void
3714 link_nested_class_to_enclosing ()
3715 {
3717 {
3723 }
3724 }
3726 static tree
3728 tree name;
3729 {
3733 {
3741 }
3742 return id;
3743 }
3745 /* If DECL is NULL, create and push a new DECL, record the current
3746 line CL and do other maintenance things. */
3748 static tree
3751 {
3755 /* Take care of the file and line business */
3757 /* If we're emiting xrefs, store the line/col number information */
3760 else
3770 /* Link the declaration to the already seen ones */
3774 /* Create a new nodes in the global lists */
3778 /* Install a new dependency list element */
3783 return decl;
3784 }
3786 static void
3789 {
3790 tree node;
3791 /* Superinterface(s): if present and defined, parser_check_super_interface ()
3792 takes care of ensuring that:
3793 - This is an accessible interface type,
3794 - Circularity detection.
3795 parser_add_interface is then called. If present but not defined,
3796 the check operation is delayed until the super interface gets
3797 defined. */
3799 {
3803 {
3806 }
3807 else
3810 }
3811 }
3813 /* Create an interface in pass1 and return its decl. Return the
3814 interface's decl in pass 2. */
3816 static tree
3820 {
3825 /* Certain syntax errors are making SUPER be like ID. Avoid this
3826 case. */
3832 /* Basic checks: scope, redefinition, modifiers */
3834 {
3835 PUSH_ERROR ();
3836 return NULL_TREE;
3837 }
3839 /* Suspend the current parsing context if we're parsing an inner
3840 interface */
3842 {
3843 java_parser_context_suspend ();
3844 /* Interface members are public. */
3847 }
3849 /* Push a new context for (static) initialized upon declaration fields */
3850 java_parser_context_push_initialized_field ();
3852 /* Interface modifiers check
3853 - public/abstract allowed (already done at that point)
3854 - abstract is obsolete (comes first, it's a warning, or should be)
3855 - Can't use twice the same (checked in the modifier rule) */
3857 parse_warning_context
3859 "Redundant use of `abstract' modifier. Interface `%s' is implicitely abstract", IDENTIFIER_POINTER (raw_name));
3861 /* Create a new decl if DECL is NULL, otherwise fix it */
3864 /* Set super info and mark the class a complete */
3871 return decl;
3872 }
3874 /* Anonymous class counter. Will be reset to 1 every time a non
3875 anonymous class gets created. */
3878 /* Patch anonymous class CLASS, by either extending or implementing
3879 DEP. */
3881 static void
3884 {
3889 /* If it's an interface, implement it */
3891 {
3892 tree s_binfo;
3896 return;
3902 /* And add the interface */
3904 }
3905 /* Otherwise, it's a type we want to extend */
3906 else
3907 {
3909 return;
3911 }
3912 }
3914 static tree
3917 tree type_name;
3918 {
3923 /* The unqualified name of the anonymous class. It's just a number. */
3928 /* We know about the type to extend/implement. We go ahead */
3930 {
3931 /* Create a class which either implements on extends the designated
3932 class. The class bears an innacessible name. */
3934 {
3935 /* It's OK to modify it here. It's been already used and
3936 shouldn't be reused */
3938 /* Interfaces should presented as a list of WFLs */
3940 }
3941 else
3943 }
3947 /* We didn't know anything about the stuff. We register a dependence. */
3952 return class;
3953 }
3955 /* Create a class in pass1 and return its decl. Return class
3956 interface's decl in pass 2. */
3958 static tree
3962 {
3965 tree super_decl_type;
3967 /* Certain syntax errors are making SUPER be like ID. Avoid this
3968 case. */
3976 /* Basic check: scope, redefinition, modifiers */
3978 {
3979 PUSH_ERROR ();
3980 return NULL_TREE;
3981 }
3983 /* Suspend the current parsing context if we're parsing an inner
3984 class or an anonymous class. */
3986 {
3987 java_parser_context_suspend ();
3988 /* Interface members are public. */
3991 }
3993 /* Push a new context for (static) initialized upon declaration fields */
3994 java_parser_context_push_initialized_field ();
3996 /* Class modifier check:
3997 - Allowed modifier (already done at that point)
3998 - abstract AND final forbidden
3999 - Public classes defined in the correct file */
4001 parse_error_context
4005 /* Create a new decl if DECL is NULL, otherwise fix it */
4008 /* If SUPER exists, use it, otherwise use Object */
4010 {
4011 /* Can't extend java.lang.Object */
4013 {
4015 return NULL_TREE;
4016 }
4018 super_decl_type =
4020 }
4023 /* We're defining java.lang.Object */
4024 else
4027 /* A class nested in an interface is implicitly static. */
4030 {
4032 }
4034 /* Set super info and mark the class as complete. */
4041 /* Add the private this$<n> field, Replicate final locals still in
4042 scope as private final fields mangled like val$<local_name>.
4043 This doesn't not occur for top level (static) inner classes. */
4047 /* If doing xref, store the location at which the inherited class
4048 (if any) was seen. */
4052 /* Eventually sets the @deprecated tag flag */
4055 /* Reset the anonymous class counter when declaring non inner classes */
4059 return decl;
4060 }
4062 /* End a class declaration: register the statements used to create
4063 finit$ and <clinit>, pop the current class and resume the prior
4064 parser context if necessary. */
4066 static void
4069 {
4070 /* If an error occured, context weren't pushed and won't need to be
4071 popped by a resume. */
4074 java_parser_context_pop_initialized_field ();
4075 POP_CPC ();
4077 java_parser_context_resume ();
4079 /* We're ending a class declaration, this is a good time to reset
4080 the interface cout. Note that might have been already done in
4081 create_interface, but if at that time an inner class was being
4082 dealt with, the interface count was reset in a context created
4083 for the sake of handling inner classes declaration. */
4085 }
4087 static void
4089 tree class_decl;
4090 tree fct_decl;
4091 {
4097 ACC_PRIVATE);
4101 return;
4105 {
4106 tree decl;
4108 {
4112 /* Avoid non final arguments. */
4114 continue;
4120 /* Build an initialization for the field: it will be
4121 initialized by a parameter added to finit$, bearing a
4122 mangled name of the field itself (param$<n>.) The
4123 parameter is provided to finit$ by the constructor
4124 invoking it (hence the constructor will also feature a
4125 hidden parameter, set to the value of the outer context
4126 local at the time the inner class is created.)
4128 Note: we take into account all possible locals that can
4129 be accessed by the inner class. It's actually not trivial
4130 to minimize these aliases down to the ones really
4131 used. One way to do that would be to expand all regular
4132 methods first, then finit$ to get a picture of what's
4133 used. It works with the exception that we would have to
4134 go back on all constructor invoked in regular methods to
4135 have their invokation reworked (to include the right amount
4136 of alias initializer parameters.)
4138 The only real way around, I think, is a first pass to
4139 identify locals really used in the inner class. We leave
4140 the flag FIELD_LOCAL_ALIAS_USED around for that future
4141 use.
4143 On the other hand, it only affect local inner classes,
4144 whose constructors (and finit$ call) will be featuring
4145 unecessary arguments. It's easy for a developper to keep
4146 this number of parameter down by using the `final'
4147 keyword only when necessary. For the time being, we can
4148 issue a warning on unecessary finals. FIXME */
4152 /* Register the field. The TREE_LIST holding the part
4153 initialized/initializer will be marked ARG_FINAL_P so
4154 that the created field can be marked
4155 FIELD_LOCAL_ALIAS. */
4159 }
4160 }
4163 return;
4165 /* If we ever registered an alias field, insert and marker to
4166 remeber where the list ends. The second part of the list (the one
4167 featuring initialized fields) so it can be later reversed to
4168 enforce 8.5. The marker will be removed during that operation. */
4172 }
4174 /* Can't use lookup_field () since we don't want to load the class and
4175 can't set the CLASS_LOADED_P flag */
4177 static tree
4179 tree class;
4180 tree name;
4181 {
4182 tree decl;
4184 {
4186 return decl;
4187 }
4188 return NULL_TREE;
4189 }
4191 /* Wrap around lookup_field that doesn't potentially upset the value
4192 of CLASS */
4194 static tree
4197 {
4200 java_parser_context_save_global ();
4202 /* Last chance: if we're within the context of an inner class, we
4203 might be trying to access a local variable defined in an outer
4204 context. We try to look for it now. */
4206 {
4207 tree new_name;
4212 }
4214 {
4217 }
4219 java_parser_context_restore_global ();
4221 }
4223 /* Find duplicate field within the same class declarations and report
4224 the error. Returns 1 if a duplicated field was found, 0
4225 otherwise. */
4227 static int
4230 {
4231 /* This might be modified to work with method decl as well */
4234 {
4240 /* The type may not have been completed by the time we report
4241 the error */
4247 parse_error_context
4255 }
4257 }
4259 /* Field registration routine. If TYPE doesn't exist, field
4260 declarations are linked to the undefined TYPE dependency list, to
4261 be later resolved in java_complete_class () */
4263 static void
4267 {
4278 return;
4280 /* If we're adding fields to interfaces, those fields are public,
4281 static, final */
4283 {
4291 INTERFACE_FIELD_MODIFIERS);
4293 }
4295 /* Obtain a suitable type for resolution, if necessary */
4298 /* If TYPE is fully resolved and we don't have a reference, make one */
4303 {
4304 tree real_type;
4305 tree field_decl;
4310 /* Can't declare non-final static fields in inner classes */
4313 parse_error_context
4318 /* Process NAME, as it may specify extra dimension(s) for it */
4321 /* Type adjustment. We may have just readjusted TYPE because
4322 the variable specified more dimensions. Make sure we have
4323 a reference if we can and don't have one already. Also
4324 change the name if we have an init. */
4326 {
4330 }
4333 /* Check for redeclarations */
4335 continue;
4337 /* Set lineno to the line the field was found and create a
4338 declaration for it. Eventually sets the @deprecated tag flag. */
4341 else
4346 /* If the field denotes a final instance variable, then we
4347 allocate a LANG_DECL_SPECIFIC part to keep track of its
4348 initialization. We also mark whether the field was
4349 initialized upon it's declaration. We don't do that if the
4350 created field is an alias to a final local. */
4352 {
4357 }
4359 /* If the couple initializer/initialized is marked ARG_FINAL_P,
4360 we mark the created field FIELD_LOCAL_ALIAS, so that we can
4361 hide parameters to this inner class finit$ and
4362 constructors. It also means that the field isn't final per
4363 say. */
4365 {
4368 }
4370 /* Check if we must chain. */
4374 /* If we have an initialization value tied to the field */
4376 {
4377 /* The field is declared static */
4379 {
4380 /* We include the field and its initialization part into
4381 a list used to generate <clinit>. After <clinit> is
4382 walked, field initializations will be processed and
4383 fields initialized with known constants will be taken
4384 out of <clinit> and have their DECL_INITIAL set
4385 appropriately. */
4391 }
4392 /* A non-static field declared with an immediate initialization is
4393 to be initialized in <init>, if any. This field is remembered
4394 to be processed at the time of the generation of <init>. */
4395 else
4396 {
4399 }
4402 }
4403 }
4405 }
4407 /* Generate finit$, using the list of initialized fields to populate
4408 its body. finit$'s parameter(s) list is adjusted to include the
4409 one(s) used to initialized the field(s) caching outer context
4410 local(s). */
4412 static tree
4414 tree class_type;
4415 {
4435 current));
4437 return mdecl;
4438 }
4440 /* Generate a function to run the instance initialization code. The
4441 private method is called `instinit$'. Unless we're dealing with an
4442 anonymous class, we determine whether all ctors of CLASS_TYPE
4443 declare a checked exception in their `throws' clause in order to
4444 see whether it's necessary to encapsulate the instance initializer
4445 statements in a try/catch/rethrow sequence. */
4447 static tree
4449 tree class_type;
4450 {
4451 tree current;
4456 void_type_node,
4462 /* Gather all the statements in a compound */
4467 /* We need to encapsulate COMPOUND by a try/catch statement to
4468 rethrow exceptions that might occur in the instance initializer.
4469 We do that only if all ctors of CLASS_TYPE are set to catch a
4470 checked exception. This doesn't apply to anonymous classes (since
4471 they don't have declared ctors.) */
4474 {
4479 exception_type_node);
4480 }
4486 return mdecl;
4487 }
4489 /* FIXME */
4490 static tree
4492 tree class_type;
4493 {
4497 {
4500 to_return =
4502 parm);
4503 }
4504 return to_return;
4505 }
4507 /* Shared accros method_declarator and method_header to remember the
4508 patch stage that was reached during the declaration of the method.
4509 A method DECL is built differently is there is no patch
4510 (JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
4511 pending on the currently defined method. */
4515 /* Check the method declaration and add the method to its current
4516 class. If the argument list is known to contain incomplete types,
4517 the method is partially added and the registration will be resume
4518 once the method arguments resolved. If TYPE is NULL, we're dealing
4519 with a constructor. */
4521 static tree
4525 {
4535 return error_mark_node;
4545 return NULL_TREE;
4547 /* There are some forbidden modifiers for an abstract method and its
4548 class must be abstract as well. */
4550 {
4558 parse_error_context
4562 }
4564 /* Things to be checked when declaring a constructor */
4566 {
4568 /* 8.6: Constructor declarations: we might be trying to define a
4569 method without specifying a return type. */
4571 parse_error_context
4573 /* 8.6.3: Constructor modifiers */
4574 else
4575 {
4581 }
4582 /* If we found error here, we don't consider it's OK to tread
4583 the method definition as a constructor, for the rest of this
4584 function */
4587 }
4589 /* Method declared within the scope of an interface are implicitly
4590 abstract and public. Conflicts with other erroneously provided
4591 modifiers are checked right after. */
4594 {
4595 /* If FLAGS isn't set because of a modifier, turn the
4596 corresponding modifier WFL to NULL so we issue a warning on
4597 the obsolete use of the modifier */
4604 }
4606 /* Inner class can't declare static methods */
4608 {
4609 parse_error_context
4610 (id, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
4613 }
4615 /* Modifiers context reset moved up, so abstract method declaration
4616 modifiers can be later checked. */
4618 /* Set constructor returned type to void and method name to <init>,
4619 unless we found an error identifier the constructor (in which
4620 case we retain the original name) */
4622 {
4626 }
4627 else
4630 /* Do the returned type resolution and registration if necessary */
4639 {
4643 }
4644 else
4648 /* When defining an abstract or interface method, the curly
4649 bracket at level 1 doesn't exist because there is no function
4650 body */
4654 /* Remember the original argument list */
4658 {
4661 /* Patch for the return type */
4663 {
4666 }
4667 /* This is the stop JDEP. METH allows the function's signature
4668 to be computed. */
4670 }
4671 else
4675 /* Remember final parameters */
4678 /* Fix the method argument list so we have the argument name
4679 information */
4682 /* Register the parameter number and re-install the current line
4683 number */
4687 /* Register exception specified by the `throws' keyword for
4688 resolution and set the method decl appropriate field to the list.
4689 Note: the grammar ensures that what we get here are class
4690 types. */
4692 {
4695 {
4700 }
4702 }
4707 /* Set the flag if we correctly processed a constructor */
4709 {
4711 /* Compute and store the number of artificial parameters declared
4712 for this constructor */
4716 count++;
4718 }
4720 /* Eventually set the @deprecated tag flag */
4723 /* If doing xref, store column and line number information instead
4724 of the line number only. */
4728 return meth;
4729 }
4731 static void
4734 {
4737 {
4740 }
4742 {
4746 }
4747 }
4749 /* Complete the method declaration with METHOD_BODY. */
4751 static void
4753 tree method_body;
4754 {
4758 return;
4762 /* 8.4.5 Method Body */
4764 {
4772 }
4774 {
4776 parse_error_context
4781 }
4790 maybe_absorb_scoping_blocks ();
4791 /* Exit function's body */
4792 exit_block ();
4793 /* Merge last line of the function with first line, directly in the
4794 function decl. It will be used to emit correct debug info. */
4798 /* Since function's argument's list are shared, reset the
4799 ARG_FINAL_P parameter that might have been set on some of this
4800 function parameters. */
4803 /* So we don't have an irrelevant function declaration context for
4804 the next static block we'll see. */
4806 }
4808 /* Build a an error message for constructor circularity errors. */
4813 {
4819 }
4821 /* Verify a circular call to METH. Return 1 if an error is found, 0
4822 otherwise. */
4824 static int
4827 {
4830 tree c;
4832 /* If we haven't already registered LIST with the garbage collector,
4833 do so now. */
4835 {
4838 }
4841 {
4843 {
4846 {
4847 tree liste;
4850 {
4851 parse_error_context
4853 constructor_circularity_msg
4855 java_error_count--;
4856 }
4857 }
4865 }
4866 }
4868 {
4873 }
4875 }
4877 /* Check modifiers that can be declared but exclusively */
4879 static void
4882 {
4890 parse_error_context
4891 (cl, "Inconsistent member declaration. At most one of `public', `private', or `protected' may be specified");
4900 }
4902 /* Check the methode header METH for abstract specifics features */
4904 static void
4906 tree meth;
4907 {
4919 }
4921 /* Create a FUNCTION_TYPE node and start augmenting it with the
4922 declared function arguments. Arguments type that can't be resolved
4923 are left as they are, but the returned node is marked as containing
4924 incomplete types. */
4926 static tree
4929 {
4937 return error_mark_node;
4939 /* If we're dealing with an inner class constructor, we hide the
4940 this$<n> decl in the name field of its parameter declaration. We
4941 also might have to hide the outer context local alias
4942 initializers. Not done when the class is a toplevel class. */
4945 {
4947 /* First the aliases, linked to the regular parameters */
4948 aliases_list =
4954 /* Then this$<n> */
4958 list);
4959 }
4962 {
4969 tree real_type;
4971 /* Obtain a suitable type for resolution, if necessary */
4974 /* Process NAME, as it may specify extra dimension(s) for it */
4980 {
4984 }
4986 /* Check redefinition */
4989 {
4990 parse_error_context
4994 break;
4995 }
4997 /* If we've an incomplete argument type, we know there is a location
4998 to patch when the type get resolved, later. */
5001 {
5007 }
5009 /* The argument node: a name and a (possibly) incomplete type. */
5011 /* Remeber arguments declared final. */
5018 }
5021 return node;
5022 }
5024 static int
5026 tree wfl;
5029 {
5031 {
5033 {
5039 else
5041 }
5043 }
5047 }
5049 /* From NAME, build a qualified identifier node using the
5050 qualification from the current package definition. */
5052 static tree
5054 tree name;
5055 {
5056 tree nested_class_name;
5059 return nested_class_name;
5063 else
5064 return name;
5065 }
5067 /* Called once the type a interface extends is resolved. Returns 0 if
5068 everything is OK. */
5070 static int
5073 {
5076 /* Has to be an interface */
5078 {
5079 parse_error_context
5087 }
5089 /* Check top-level interface access. Inner classes are subject to member
5090 access rules (6.6.1). */
5099 }
5101 /* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
5102 0 if everthing is OK. */
5104 static int
5107 {
5110 /* SUPER should be a CLASS (neither an array nor an interface) */
5112 {
5113 parse_error_context
5119 }
5122 {
5126 }
5128 /* Check top-level class scope. Inner classes are subject to member access
5129 rules (6.6.1). */
5138 }
5140 /* Create a new dependency list and link it (in a LIFO manner) to the
5141 CTXP list of type dependency list. */
5143 static void
5146 {
5151 }
5156 {
5159 {
5163 }
5164 return prev;
5165 }
5167 /* Create a fake pointer based on the ID stored in
5168 TYPE_NAME. TYPE_NAME can be a WFL or a incomplete type asking to be
5169 registered again. */
5171 static tree
5173 tree type_name;
5174 {
5181 else
5182 abort ();
5187 return ptr;
5188 }
5190 /* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
5191 non NULL instead of computing a new fake type based on WFL. The new
5192 dependency is inserted in the current type dependency list, in FIFO
5193 manner. */
5195 static tree
5199 {
5211 /* For some dependencies, set the enclosing class of the current
5212 class to be the enclosing context */
5217 else
5223 return ptr;
5224 }
5226 /* This checks for circular references with innerclasses. We start
5227 from SOURCE and should never reach TARGET. Extended/implemented
5228 types in SOURCE have their enclosing context checked not to reach
5229 TARGET. When the last enclosing context of SOURCE is reached, its
5230 extended/implemented types are also checked not to reach TARGET.
5231 In case of error, WFL of the offending type is returned; NULL_TREE
5232 otherwise. */
5234 static tree
5236 tree source;
5237 tree target;
5238 {
5244 return NULL_TREE;
5247 {
5254 {
5255 /* An enclosing context shouldn't be TARGET */
5259 /* When we reach the enclosing last context, start a check
5260 on it, with the same target */
5263 return cl;
5264 }
5265 }
5266 return NULL_TREE;
5267 }
5269 /* Explore TYPE's `extends' clause member(s) and return the WFL of the
5270 offending type if a circularity is detected. NULL_TREE is returned
5271 otherwise. TYPE can be an interface or a class. */
5273 static tree
5275 tree type;
5276 {
5281 return NULL_TREE;
5284 {
5287 return NULL_TREE;
5288 }
5291 {
5296 }
5297 return NULL_TREE;
5298 }
5300 void
5301 java_check_circular_reference ()
5302 {
5303 tree current;
5305 {
5307 tree cl;
5314 (cyclic_inheritance_report ?
5316 }
5317 }
5319 /* Augment the parameter list PARM with parameters crafted to
5320 initialize outer context locals aliases. Through ARTIFICIAL, a
5321 count is kept of the number of crafted parameters. MODE governs
5322 what eventually gets created: something suitable for a function
5323 creation or a function invocation, either the constructor or
5324 finit$. */
5326 static tree
5331 {
5332 tree field;
5337 {
5340 tree mangled_id;
5343 {
5344 case AIPL_FUNCTION_DECLARATION:
5350 else
5352 break;
5354 case AIPL_FUNCTION_CREATION:
5358 break;
5360 case AIPL_FUNCTION_FINIT_INVOCATION:
5363 /* Now, this is wrong. purpose should always be the NAME
5364 of something and value its matching value (decl, type,
5365 etc...) FIXME -- but there is a lot to fix. */
5367 /* When invoked for this kind of operation, we already
5368 know whether a field is used or not. */
5371 break;
5373 case AIPL_FUNCTION_CTOR_INVOCATION:
5374 /* There are two case: the constructor invokation happends
5375 outside the local inner, in which case, locales from the outer
5376 context are directly used.
5378 Otherwise, we fold to using the alias directly. */
5381 else
5382 {
5385 }
5386 break;
5387 }
5391 }
5393 {
5398 }
5400 return parm;
5401 }
5403 /* Craft a constructor for CLASS_DECL -- what we should do when none
5404 where found. ARGS is non NULL when a special signature must be
5405 enforced. This is the case for anonymous classes. */
5407 static void
5410 {
5419 /* The constructor name is <init> unless we're dealing with an
5420 anonymous class, in which case the name will be fixed after having
5421 be expanded. */
5424 else
5427 /* If we're dealing with an inner class constructor, we hide the
5428 this$<n> decl in the name field of its parameter declaration. */
5430 {
5435 /* Some more arguments to be hidden here. The values of the local
5436 variables of the outer context that the inner class needs to see. */
5440 }
5442 /* Then if there are any args to be enforced, enforce them now */
5444 {
5447 }
5453 /* Now, mark the artificial parameters. */
5456 }
5459 /* Fix the constructors. This will be called right after circular
5460 references have been checked. It is necessary to fix constructors
5461 early even if no code generation will take place for that class:
5462 some generated constructor might be required by the class whose
5463 compilation triggered this one to be simply loaded. */
5465 void
5466 java_fix_constructors ()
5467 {
5468 tree current;
5471 {
5474 tree decl;
5477 continue;
5481 {
5483 {
5486 }
5487 }
5489 /* Anonymous class constructor can't be generated that early. */
5492 }
5493 }
5495 /* safe_layout_class just makes sure that we can load a class without
5496 disrupting the current_class, input_file, lineno, etc, information
5497 about the class processed currently. */
5499 void
5501 tree class;
5502 {
5512 }
5514 static tree
5517 {
5518 tree decl;
5522 else
5523 {
5527 }
5532 {
5535 {
5539 }
5541 }
5542 return decl;
5543 }
5545 /* Complete unsatisfied class declaration and their dependencies */
5547 void
5548 java_complete_class ()
5549 {
5550 tree cclass;
5553 tree type;
5555 /* Process imports */
5556 process_imports ();
5558 /* Rever things so we have the right order */
5565 {
5568 {
5569 tree decl;
5571 continue;
5573 /* Now it's time to patch */
5575 {
5576 case JDEP_SUPER:
5577 /* Simply patch super */
5579 continue;
5582 break;
5584 case JDEP_FIELD:
5585 {
5586 /* We do part of the job done in add_field */
5595 SOURCE_FRONTEND_DEBUG
5599 break;
5600 }
5602 case JDEP_METHOD_RETURN:
5605 {
5607 {
5612 SOURCE_FRONTEND_DEBUG
5616 IDENTIFIER_POINTER (EXPR_WFL_NODE
5619 }
5620 else
5624 break;
5625 else
5627 }
5629 {
5631 /* Recompute and reset the signature, check first that
5632 all types are now defined. If they're not,
5633 dont build the signature. */
5635 {
5638 }
5639 }
5640 else
5641 continue;
5642 break;
5644 case JDEP_INTERFACE:
5647 continue;
5649 break;
5651 case JDEP_PARM:
5652 case JDEP_VARIABLE:
5657 break;
5659 case JDEP_TYPE:
5661 SOURCE_FRONTEND_DEBUG
5664 break;
5666 case JDEP_EXCEPTION:
5668 SOURCE_FRONTEND_DEBUG
5671 break;
5673 case JDEP_ANONYMOUS:
5675 break;
5677 default:
5678 abort ();
5679 }
5680 }
5681 }
5682 return;
5683 }
5685 /* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
5686 array. */
5688 static tree
5691 {
5695 tree resolved_type_decl;
5698 {
5702 {
5705 resolved_type);
5706 }
5707 return resolved_type_decl;
5708 }
5710 /* 1- Check to see if we have an array. If true, find what we really
5711 want to resolve */
5713 name++;
5715 {
5718 }
5720 /* 2- Resolve the bare type */
5723 return NULL_TREE;
5726 /* 3- If we have and array, reconstruct the array down to its nesting */
5728 {
5730 {
5732 name--;
5733 }
5734 /* A TYPE_NAME that is a TYPE_DECL was set in
5735 build_java_array_type, return it. */
5737 }
5739 return resolved_type_decl;
5740 }
5742 /* Effectively perform the resolution of class CLASS_TYPE. DECL or CL
5743 are used to report error messages. Do not try to replace TYPE_NAME
5744 (class_type) by a variable, since it is changed by
5745 find_in_imports{_on_demand} and (but it doesn't really matter)
5746 qualify_and_find. */
5748 tree
5751 {
5755 /* This hash table is used to register the classes we're going
5756 through when searching the current class as an inner class, in
5757 order to detect circular references. Remember to free it before
5758 returning the section 0- of this function. */
5762 /* 0- Search in the current class as an inner class.
5763 Maybe some code here should be added to load the class or
5764 something, at least if the class isn't an inner class and ended
5765 being loaded from class file. FIXME. */
5767 {
5771 break;
5773 /* If we haven't found anything because SUPER reached Object and
5774 ENCLOSING happens to be an innerclass, try the enclosing context. */
5778 else
5780 }
5785 return new_class_decl;
5787 /* 1- Check for the type in single imports. This will change
5788 TYPE_NAME() if something relevant is found */
5791 /* 2- And check for the type in the current compilation unit */
5793 {
5798 }
5800 /* 3- Search according to the current package definition */
5802 {
5805 return new_class_decl;
5806 }
5808 /* 4- Check the import on demands. Don't allow bar.baz to be
5809 imported from foo.* */
5812 return NULL_TREE;
5814 /* If found in find_in_imports_on_demant, the type has already been
5815 loaded. */
5817 return new_class_decl;
5819 /* 5- Try with a name qualified with the package name we've seen so far */
5821 {
5822 tree package;
5824 /* If there is a current package (ctxp->package), it's the first
5825 element of package_list and we can skip it. */
5832 return new_class_decl;
5833 }
5835 /* 5- Check an other compilation unit that bears the name of type */
5841 /* If we don't have a value for CL, then we're being called recursively.
5842 We can't check package access just yet, but it will be taken care of
5843 by the caller. */
5845 {
5847 return NULL_TREE;
5848 }
5850 /* 6- Last call for a resolution */
5852 }
5854 static tree
5857 {
5859 tree new_class_decl;
5864 {
5870 }
5871 return NULL_TREE;
5872 }
5874 /* Resolve NAME and lay it out (if not done and if not the current
5875 parsed class). Return a decl node. This function is meant to be
5876 called when type resolution is necessary during the walk pass. */
5878 static tree
5880 tree something;
5881 tree cl;
5882 {
5885 /* Don't do that on the current class */
5889 /* Don't do anything for void and other primitive types */
5891 return NULL_TREE;
5893 /* Pointer types can be reall pointer types or fake pointers. When
5894 finding a real pointer, recheck for primitive types */
5896 {
5898 {
5901 return NULL_TREE;
5902 }
5903 else
5905 }
5907 /* Don't do anything for arrays of primitive types */
5910 return NULL_TREE;
5912 /* Something might be a WFL */
5916 /* Otherwise, if something is not and IDENTIFIER_NODE, it can be a a
5917 TYPE_DECL or a real TYPE */
5923 return NULL_TREE;
5925 /* Resolve and layout if necessary */
5928 /* Check methods */
5931 /* Layout the type if necessary */
5935 return decl;
5936 }
5938 /* Resolve a class, returns its decl but doesn't perform any
5939 layout. The current parsing context is saved and restored */
5941 static tree
5944 {
5947 java_parser_context_save_global ();
5949 java_parser_context_restore_global ();
5951 return decl;
5952 }
5954 /* Called when reporting errors. Skip leader '[' in a complex array
5955 type description that failed to be resolved. */
5960 {
5962 name++;
5963 return name;
5964 }
5966 /* The type CURRENT refers to can't be found. We print error messages. */
5968 static void
5971 {
5975 return;
5979 {
5980 case JDEP_SUPER:
5981 parse_error_context
5985 break;
5986 case JDEP_FIELD:
5987 parse_error_context
5991 break;
5993 parse_error_context
5998 break;
6000 parse_error_context
6004 break;
6005 case JDEP_INTERFACE:
6006 parse_error_context
6011 break;
6012 case JDEP_VARIABLE:
6013 parse_error_context
6015 purify_type_name (IDENTIFIER_POINTER
6018 break;
6020 parse_error_context
6023 break;
6024 default:
6025 /* Fix for -Wall. Just break doing nothing. The error will be
6026 caught later */
6027 break;
6028 }
6029 }
6031 /* Return a static string containing the DECL prototype string. If
6032 DECL is a constructor, use the class name instead of the form
6033 <init> */
6037 tree decl;
6038 {
6043 {
6046 }
6052 return to_return;
6053 }
6055 /* Track method being redefined inside the same class. As a side
6056 effect, set DECL_NAME to an IDENTIFIER (prior entering this
6057 function it's a FWL, so we can track errors more accurately.) */
6059 static int
6062 {
6065 /* There's no need to verify <clinit> and finit$ and instinit$ */
6072 {
6074 break;
6078 {
6079 parse_error_context
6084 }
6085 }
6087 }
6089 /* Return 1 if check went ok, 0 otherwise. */
6090 static int
6094 {
6101 {
6107 continue;
6109 /* Now verify that somewhere in between TYPE and CLASS,
6110 abstract method METHOD gets a non abstract definition
6111 that is inherited by CLASS. */
6119 do {
6123 /* Method search */
6126 {
6137 {
6139 break;
6140 }
6141 }
6145 /* Report that abstract METHOD didn't find an implementation
6146 that CLASS can use. */
6148 {
6153 parse_error_context
6155 "Class `%s' doesn't define the abstract method `%s %s' from %s `%s'. This method must be defined or %s `%s' must be declared abstract",
6165 }
6166 }
6169 {
6170 /* Check for implemented interfaces. */
6174 {
6177 }
6178 }
6180 return ok;
6181 }
6183 /* Check that CLASS_DECL somehow implements all inherited abstract
6184 methods. */
6186 static void
6188 tree class_decl;
6189 {
6195 return;
6197 /* Check for inherited types */
6199 do {
6204 /* Check for implemented interfaces. */
6207 {
6210 }
6211 }
6213 /* Check all the types method DECL uses and return 1 if all of them
6214 are now complete, 0 otherwise. This is used to check whether its
6215 safe to build a method signature or not. */
6217 static int
6219 tree decl;
6220 {
6222 tree args;
6235 }
6237 /* Visible interface to check methods contained in CLASS_DECL */
6239 void
6241 tree class_decl;
6242 {
6244 return;
6248 else
6252 }
6254 /* Check all the methods of CLASS_DECL. Methods are first completed
6255 then checked according to regular method existance rules. If no
6256 constructor for CLASS_DECL were encountered, then build its
6257 declaration. */
6259 static void
6261 tree class_decl;
6262 {
6264 tree method;
6267 tree mthrows;
6269 /* It is not necessary to check methods defined in java.lang.Object */
6271 return;
6276 /* Should take interfaces into account. FIXME */
6278 {
6279 tree sig;
6283 /* Check for redefinitions */
6285 continue;
6287 /* If we see one constructor a mark so we don't generate the
6288 default one. Also skip other verifications: constructors
6289 can't be inherited hence hiden or overriden */
6291 {
6293 continue;
6294 }
6296 /* We verify things thrown by the method. They must inherits from
6297 java.lang.Throwable */
6300 {
6302 parse_error_context
6303 (TREE_PURPOSE (mthrows), "Class `%s' in `throws' clause must be a subclass of class `java.lang.Throwable'",
6304 IDENTIFIER_POINTER
6306 }
6311 /* Inner class can't declare static methods */
6313 {
6315 parse_error_context
6316 (method_wfl, "Method `%s' can't be static in inner class `%s'. Only members of interfaces and top-level classes can be static",
6319 }
6321 /* Nothing overrides or it's a private method. */
6323 continue;
6325 {
6327 continue;
6328 }
6330 /* If `found' is declared in an interface, make sure the
6331 modifier matches. */
6335 {
6337 parse_error_context (method_wfl, "Class `%s' must override `%s' with a public method in order to implement interface `%s'",
6341 }
6343 /* Can't override a method with the same name and different return
6344 types. */
6346 {
6349 parse_error_context
6353 IDENTIFIER_POINTER
6356 }
6360 /* Can't override final. Can't override static. */
6362 {
6363 /* Static *can* override static */
6365 continue;
6366 parse_error_context
6372 IDENTIFIER_POINTER
6374 continue;
6375 }
6377 /* Static method can't override instance method. */
6379 {
6380 parse_error_context
6382 "Instance methods can't be overriden by a static method. Method `%s' is an instance method in class `%s'",
6384 IDENTIFIER_POINTER
6386 continue;
6387 }
6389 /* - Overriding/hiding public must be public
6390 - Overriding/hiding protected must be protected or public
6391 - If the overriden or hidden method has default (package)
6392 access, then the overriding or hiding method must not be
6393 private; otherwise, a compile-time error occurs. If
6394 `found' belongs to an interface, things have been already
6395 taken care of. */
6402 {
6403 parse_error_context
6405 "Methods can't be overridden to be more private. Method `%s' is not %s in class `%s'", lang_printable_name (method, 0),
6408 IDENTIFIER_POINTER (DECL_NAME
6410 continue;
6411 }
6413 /* Overriding methods must have compatible `throws' clauses on checked
6414 exceptions, if any */
6417 /* Inheriting multiple methods with the same signature. FIXME */
6418 }
6423 /* Search for inherited abstract method not yet implemented in this
6424 class. */
6428 abort ();
6429 }
6431 /* Return a non zero value if the `throws' clause of METHOD (if any)
6432 is incompatible with the `throws' clause of FOUND (if any). */
6434 static void
6437 {
6440 /* Can't check these things with class loaded from bytecode. FIXME */
6442 return;
6446 {
6447 /* We don't verify unchecked expressions */
6449 continue;
6450 /* Checked expression must be compatible */
6454 break;
6456 {
6457 parse_error_context
6458 (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'",
6461 IDENTIFIER_POINTER
6463 }
6464 }
6465 }
6467 /* Check abstract method of interface INTERFACE */
6469 static void
6471 tree interface_decl;
6472 {
6478 {
6479 /* 2- Check for double definition inside the defining interface */
6481 continue;
6483 /* 3- Overriding is OK as far as we preserve the return type and
6484 the thrown exceptions (FIXME) */
6487 {
6490 parse_error_context
6494 IDENTIFIER_POINTER
6497 continue;
6498 }
6499 }
6501 /* 4- Inherited methods can't differ by their returned types */
6503 return;
6506 {
6510 continue;
6513 sub_interface_method;
6515 {
6517 sub_interface_method);
6519 {
6520 parse_error_context
6522 "Interface `%s' inherits method `%s' from interface `%s'. This method is redefined with a different return type in interface `%s'",
6525 IDENTIFIER_POINTER
6528 IDENTIFIER_POINTER
6530 }
6531 }
6532 }
6533 }
6535 /* Lookup methods in interfaces using their name and partial
6536 signature. Return a matching method only if their types differ. */
6538 static tree
6541 {
6546 return NULL_TREE;
6550 {
6555 return to_return;
6556 }
6558 {
6559 to_return = lookup_java_interface_method2
6562 return to_return;
6563 }
6565 return NULL_TREE;
6566 }
6568 /* Lookup method using their name and partial signature. Return a
6569 matching method only if their types differ. */
6571 static tree
6575 {
6585 {
6588 {
6595 return method;
6596 }
6598 }
6599 return NULL_TREE;
6600 }
6602 /* Return the line that matches DECL line number, and try its best to
6603 position the column number. Used during error reports. */
6605 static tree
6607 tree decl;
6608 {
6613 return NULL_TREE;
6616 {
6619 }
6632 return cl;
6633 }
6635 /* Look for a simple name in the single-type import list */
6637 static tree
6639 tree name;
6640 {
6641 tree node;
6647 return NULL_TREE;
6648 }
6650 /* Process all single-type import. */
6652 static int
6653 process_imports ()
6654 {
6655 tree import;
6659 {
6668 /* Don't load twice something already defined. */
6670 continue;
6673 {
6674 tree left;
6678 error_found =
6681 /* We found it, we can bail out */
6683 break;
6685 /* We haven't found it. Maybe we're trying to access an
6686 inner class. The only way for us to know is to try again
6687 after having dropped a qualifier. If we can't break it further,
6688 we have an error. */
6690 break;
6693 }
6695 {
6698 original_name);
6700 }
6705 }
6707 }
6709 /* Possibly find and mark a class imported by a single-type import
6710 statement. */
6712 static void
6714 tree class_type;
6715 {
6716 tree import;
6720 {
6723 }
6724 }
6726 static int
6730 {
6731 tree node;
6736 else
6742 }
6744 /* Read a import directory, gathering potential match for further type
6745 references. Indifferently reads a filesystem or a ZIP archive
6746 directory. */
6748 static void
6750 tree wfl;
6751 {
6765 return;
6772 {
6776 {
6784 else
6785 {
6789 {
6792 }
6796 {
6803 continue;
6805 current_entry_len);
6806 }
6807 }
6808 }
6809 else
6810 {
6816 {
6819 }
6824 continue;
6826 for (;;)
6827 {
6832 break;
6839 }
6842 }
6843 }
6847 /* Here we should have a unified way of retrieving an entry, to be
6848 indexed. */
6850 {
6853 {
6854 error ("Can't find default package `%s'. Check the CLASSPATH environment variable and the access to the archives.", package_name);
6855 java_error_count++;
6857 }
6858 else
6860 package_name);
6862 return;
6863 }
6865 }
6867 /* Possibly find a type in the import on demands specified
6868 types. Returns 1 if an error occured, 0 otherwise. Run throught the
6869 entire list, to detected potential double definitions. */
6871 static int
6873 tree class_type;
6874 {
6880 {
6893 {
6895 {
6899 }
6900 else
6901 {
6902 seen_once++;
6903 parse_error_context
6908 }
6909 }
6910 }
6913 {
6914 /* Setup lineno so that it refers to the line of the import (in
6915 case we parse a class file and encounter errors */
6916 tree decl;
6922 /* If there is no DECL set for the class or if the class isn't
6923 loaded and not seen in source yet, the load */
6926 {
6929 }
6933 else
6934 /* 6.6.1: Inner classes are subject to member access rules. */
6936 }
6937 else
6939 }
6941 /* Add package NAME to the list of package encountered so far. To
6942 speed up class lookup in do_resolve_class, we make sure a
6943 particular package is added only once. */
6945 static void
6947 tree name;
6948 {
6952 {
6956 }
6959 {
6962 }
6963 }
6965 static tree
6968 {
6973 /* The trick is to determine when the package name stops and were
6974 the name of something contained in the package starts. Then we
6975 return a fully qualified name of what we want to get. */
6977 /* Do a quick search on well known package names */
6979 {
6983 }
6985 {
6988 }
6990 /* If we found something here, return */
6992 return type_name;
6996 /* Try to progressively construct a type name */
7000 {
7001 /* If we don't have what we're expecting, exit now. TYPE_NAME
7002 will be null and the error caught later. */
7004 break;
7007 {
7009 /* resolve_package should be used in a loop, hence we
7010 point at this one to naturally process the next one at
7011 the next iteration. */
7013 break;
7014 }
7015 }
7016 return type_name;
7017 }
7019 static tree
7023 {
7027 sub++;
7031 }
7033 /* Check accessibility of inner classes according to member access rules.
7034 DECL is the inner class, ENCLOSING_DECL is the class from which the
7035 access is being attempted. */
7037 static void
7040 {
7042 tree enclosing_decl_type;
7044 /* We don't issue an error message when CL is null. CL can be null
7045 as a result of processing a JDEP crafted by source_start_java_method
7046 for the purpose of patching its parm decl. But the error would
7047 have been already trapped when fixing the method's signature.
7048 DECL can also be NULL in case of earlier errors. */
7050 return;
7055 {
7056 /* Access is permitted only within the body of the top-level
7057 class in which DECL is declared. */
7064 return;
7066 }
7068 {
7069 tree decl_context;
7070 /* Access is permitted from within the same package... */
7072 return;
7074 /* ... or from within the body of a subtype of the context in which
7075 DECL is declared. */
7078 {
7080 {
7082 enclosing_decl_type))
7083 return;
7084 }
7085 else
7086 {
7087 /* Eww. The order of the arguments is different!! */
7090 return;
7091 }
7093 }
7095 }
7097 {
7098 /* Access is permitted only from within the same package as DECL. */
7100 return;
7102 }
7103 else
7104 /* Class is public. */
7105 return;
7110 }
7112 /* Accessibility check for top-level classes. If CLASS_NAME is in a foreign
7113 package, it must be PUBLIC. Return 0 if no access violations were found,
7114 1 otherwise. */
7116 static int
7118 tree class_name;
7119 tree cl;
7120 {
7121 tree type;
7130 {
7131 /* Access to a private class within the same package is
7132 allowed. */
7136 /* Both in the empty package. */
7139 /* Both in the same package. */
7142 parse_error_context
7143 (cl, "Can't access %s `%s'. Only public classes and interfaces in other packages can be accessed",
7147 }
7149 }
7151 /* Local variable declaration. */
7153 static void
7156 tree type;
7157 tree vlist;
7158 {
7164 /* Push a new block if statements were seen between the last time we
7165 pushed a block and now. Keep a count of blocks to close */
7167 {
7170 }
7173 {
7178 else
7179 {
7180 parse_error_context
7183 return;
7184 }
7185 }
7187 /* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
7188 hold the TYPE value if a new incomplete has to be created (as
7189 opposed to being found already existing and reused). */
7192 /* If TYPE is fully resolved and we don't have a reference, make one */
7195 /* Go through all the declared variables */
7198 {
7204 /* Process NAME, as it may specify extra dimension(s) for it */
7207 /* Variable redefinition check */
7209 {
7212 continue;
7213 }
7215 /* Type adjustment. We may have just readjusted TYPE because
7216 the variable specified more dimensions. Make sure we have
7217 a reference if we can and don't have one already. */
7221 /* Never layout this decl. This will be done when its scope
7222 will be entered */
7228 /* If doing xreferencing, replace the line number with the WFL
7229 compound value */
7233 /* Don't try to use an INIT statement when an error was found */
7237 /* Add the initialization function to the current function's code */
7239 {
7240 /* Name might have been readjusted */
7245 init));
7246 }
7248 /* Setup dependency the type of the decl */
7250 {
7255 }
7256 }
7258 }
7260 /* Called during parsing. Build decls from argument list. */
7262 static void
7264 tree fndecl;
7265 {
7266 tree tem;
7267 tree parm_decl;
7271 return;
7275 /* New scope for the function */
7276 enter_block ();
7279 {
7283 /* If type is incomplete. Create an incomplete decl and ask for
7284 the decl to be patched later */
7286 {
7295 }
7296 else
7299 /* Remember if a local variable was declared final (via its
7300 TREE_LIST of type/name.) Set LOCAL_FINAL accordingly. */
7302 {
7305 }
7308 }
7314 }
7316 /* Called during parsing. Creates an artificial method declaration. */
7318 static tree
7320 tree class;
7323 {
7324 tree mdecl;
7326 java_parser_context_save_global ();
7332 java_parser_context_restore_global ();
7334 return mdecl;
7335 }
7337 /* Starts the body if an artifical method. */
7339 static void
7341 tree mdecl;
7342 {
7346 enter_block ();
7347 }
7349 static void
7351 tree mdecl;
7352 {
7353 /* exit_block modifies DECL_FUNCTION_BODY (current_function_decl).
7354 It has to be evaluated first. (if mdecl is current_function_decl,
7355 we have an undefined behavior if no temporary variable is used.) */
7358 exit_block ();
7359 }
7361 /* Terminate a function and expand its body. */
7363 static void
7364 source_end_java_method ()
7365 {
7369 return;
7371 java_parser_context_save_global ();
7374 /* Turn function bodies with only a NOP expr null, so they don't get
7375 generated at all and we won't get warnings when using the -W
7376 -Wall flags. */
7380 /* Generate function's code */
7382 && ! flag_emit_class_files
7386 /* pop out of its parameters */
7391 /* Generate rtl for function exit. */
7393 {
7397 /* Run the optimizers and output assembler code for this function. */
7399 }
7402 java_parser_context_restore_global ();
7403 }
7405 /* Record EXPR in the current function block. Complements compound
7406 expression second operand if necessary. */
7408 tree
7411 {
7413 return NULL_TREE;
7415 }
7417 static tree
7420 {
7424 return body;
7427 return body;
7431 return c;
7432 }
7434 /* Add STMT to EXISTING if possible, otherwise create a new
7435 COMPOUND_EXPR and add STMT to it. */
7437 static tree
7440 {
7443 else
7444 return stmt;
7445 }
7448 {
7451 tree current;
7454 {
7460 {
7463 }
7464 else
7465 break;
7466 }
7467 }
7469 void
7470 java_reorder_fields ()
7471 {
7474 tree current;
7476 /* Register STOP_REORDERING with the garbage collector. */
7478 {
7481 }
7484 {
7488 break;
7490 /* Reverse the fields, but leave the dummy field in front.
7491 Fields are already ordered for Object and Class */
7494 {
7495 /* If the dummy field is there, reverse the right fields and
7496 just layout the type for proper fields offset */
7498 {
7502 }
7503 /* We don't have a dummy field, we need to layout the class,
7504 after having reversed the fields */
7505 else
7506 {
7510 }
7511 }
7512 }
7513 /* There are cases were gclass_list will be empty. */
7516 }
7518 /* Layout the methods of all classes loaded in one way or another.
7519 Check methods of source parsed classes. Then reorder the
7520 fields and layout the classes or the type of all source parsed
7521 classes */
7523 void
7524 java_layout_classes ()
7525 {
7526 tree current;
7529 /* Layout the methods of all classes seen so far */
7530 java_layout_seen_class_methods ();
7531 java_parse_abort_on_error ();
7534 /* Then check the methods of all parsed classes */
7538 java_parse_abort_on_error ();
7541 {
7545 /* Error reported by the caller */
7547 return;
7548 }
7550 /* We might have reloaded classes durign the process of laying out
7551 classes for code generation. We must layout the methods of those
7552 late additions, as constructor checks might use them */
7553 java_layout_seen_class_methods ();
7554 java_parse_abort_on_error ();
7555 }
7557 /* Expand methods in the current set of classes rememebered for
7558 generation. */
7560 static void
7561 java_complete_expand_classes ()
7562 {
7563 tree current;
7570 }
7572 /* Expand the methods found in OUTER, starting first by OUTER's inner
7573 classes, if any. */
7575 static void
7577 tree outer;
7578 {
7579 tree inner_list;
7583 /* We need to go after all inner classes and start expanding them,
7584 starting with most nested ones. We have to do that because nested
7585 classes might add functions to outer classes */
7593 }
7595 /* Expand methods registered in CLASS_DECL. The general idea is that
7596 we expand regular methods first. This allows us get an estimate on
7597 how outer context local alias fields are really used so we can add
7598 to the constructor just enough code to initialize them properly (it
7599 also lets us generate finit$ correctly.) Then we expand the
7600 constructors and then <clinit>. */
7602 static void
7604 tree class_decl;
7605 {
7610 /* Find whether the class has final variables */
7613 {
7615 break;
7616 }
7618 /* Initialize a new constant pool */
7619 init_outgoing_cpool ();
7621 /* Pre-expand <clinit> to figure whether we really need it or
7622 not. If we do need it, we pre-expand the static fields so they're
7623 ready to be used somewhere else. <clinit> will be fully expanded
7624 after we processed the constructors. */
7628 /* Then generate finit$ (if we need to) because constructors will
7629 try to use it.*/
7633 /* Then generate instinit$ (if we need to) because constructors will
7634 try to use it. */
7638 /* Now do the constructors */
7640 {
7644 continue;
7647 /* Don't generate debug info on line zero when expanding a
7648 generated constructor. */
7652 /* Reset the final local variable assignment flags */
7658 /* Check for missed out final variable assignment */
7664 }
7666 /* First, do the ordinary methods. */
7668 {
7669 /* Ctors aren't part of this batch. */
7671 continue;
7673 /* Skip abstract or native methods -- but do handle native
7674 methods when generating JNI stubs. */
7676 {
7678 continue;
7679 }
7682 {
7685 }
7688 }
7690 /* If there is indeed a <clinit>, fully expand it now */
7692 {
7693 /* Reset the final local variable assignment flags */
7696 /* Prevent the use of `this' inside <clinit> */
7700 /* Check for missed out static final variable assignment */
7704 }
7706 /* We might have generated a class$ that we now want to expand */
7710 /* Now verify constructor circularity (stop after the first one we
7711 prove wrong.) */
7716 break;
7718 /* Final check on the initialization of final variables. */
7720 {
7722 /* If we have an interface, check for uninitialized fields. */
7725 }
7727 /* Save the constant pool. We'll need to restore it later. */
7729 }
7731 /* Attempt to create <clinit>. Pre-expand static fields so they can be
7732 safely used in some other methods/constructors. */
7734 static tree
7736 tree class_type;
7737 {
7741 return NULL_TREE;
7743 /* Go through all static fields and pre expand them */
7749 /* Then build the <clinit> method */
7756 /* We process the list of assignment we produced as the result of
7757 the declaration of initialized static field and add them as
7758 statement to the <clinit> method. */
7761 {
7763 /* We build the assignment expression that will initialize the
7764 field to its value. There are strict rules on static
7765 initializers (8.5). FIXME */
7769 }
7773 /* Now we want to place <clinit> as the last method (because we need
7774 it at least for interface so that it doesn't interfere with the
7775 dispatch table based lookup. */
7777 {
7786 }
7788 return mdecl;
7789 }
7791 /* Analyzes a method body and look for something that isn't a
7792 MODIFY_EXPR with a constant value. */
7794 static int
7796 tree bbody;
7797 {
7800 {
7801 case BLOCK:
7803 break;
7805 case EXPR_WITH_FILE_LOCATION:
7807 break;
7809 case COMPOUND_EXPR:
7813 break;
7815 case MODIFY_EXPR:
7816 /* Return 0 if the operand is constant, 1 otherwise. */
7819 default:
7821 }
7823 }
7826 /* See whether we could get rid of <clinit>. Criteria are: all static
7827 final fields have constant initial values and the body of <clinit>
7828 is empty. Return 1 if <clinit> was discarded, 0 otherwise. */
7830 static int
7832 tree mdecl;
7833 {
7841 /* If the body isn't empty, then we keep <clinit>. Note that if
7842 we're emitting classfiles, this isn't enough not to rule it
7843 out. */
7848 else
7858 {
7859 tree f_init;
7861 /* We're not interested in non static field */
7863 continue;
7865 /* Anything that isn't String or a basic type is ruled out -- or
7866 if we know how to deal with it (when doing things natively) we
7867 should generated an empty <clinit> so that SUID are computed
7868 correctly. */
7871 break;
7874 /* If we're emitting native code, we want static final fields to
7875 have constant initializers. If we don't meet these
7876 conditions, we keep <clinit> */
7877 if (!flag_emit_class_files
7879 break;
7880 /* If we're emitting bytecode, we want static fields to have
7881 constant initializers or no initializer. If we don't meet
7882 these conditions, we keep <clinit> */
7884 break;
7885 }
7887 /* Now we analyze the method body and look for something that
7888 isn't a MODIFY_EXPR */
7891 else
7897 /* Get rid of <clinit> in the class' list of methods */
7900 else
7904 {
7906 break;
7907 }
7910 }
7912 /* Install the argument from MDECL. Suitable to completion and
7913 expansion of mdecl's body. */
7915 static void
7917 tree mdecl;
7918 {
7926 {
7929 if (PROMOTE_PROTOTYPES
7939 }
7944 }
7947 /* Complete and expand a method. */
7949 static void
7951 tree mdecl;
7952 {
7956 /* Fix constructors before expanding them */
7960 /* Expand functions that have a body */
7962 return;
7977 /* Prepare the function for tree completion */
7980 /* Install the current this */
7984 /* Purge the `throws' list of unchecked exceptions (we save a copy
7985 of the list and re-install it later.) */
7989 /* Install exceptions thrown with `throws' */
7993 {
7996 /* Before we check initialization, attached all class initialization
7997 variable to the block_body */
8002 {
8005 /* Go through all the flags marking the initialization of
8006 static variables and see whether they're definitively
8007 assigned, in which case the type is remembered as
8008 definitively initialized in MDECL. */
8010 {
8014 /* Always register the context as properly initialized in
8015 MDECL. This used with caution helps removing extra
8016 initialization of self. */
8021 }
8022 }
8024 }
8028 /* If we saw a return but couldn't evaluate it properly, we'll have
8029 an error_mark_node here. */
8036 /* See if we can get rid of <clinit> if MDECL happens to be <clinit> */
8039 /* Pop the current level, with special measures if we found errors. */
8044 /* Pop the exceptions and sanity check */
8045 POP_EXCEPTIONS();
8047 abort ();
8049 /* Restore the copy of the list of exceptions if emitting xrefs. */
8051 }
8053 /* For with each class for which there's code to generate. */
8055 static void
8057 tree class;
8058 {
8059 tree decl;
8061 {
8063 continue;
8067 /* It's time to assign the variable flagging static class
8068 initialization based on which classes invoked static methods
8069 are definitely initializing. This should be flagged. */
8074 /* Prepare the function for RTL expansion */
8077 /* Expand function start, generate initialization flag
8078 assignment, and handle synchronized methods. */
8081 /* Expand the rest of the function body and terminate
8082 expansion. */
8083 source_end_java_method ();
8084 }
8085 }
8087 \f
8089 /* This section of the code deals with accessing enclosing context
8090 fields either directly by using the relevant access to this$<n> or
8091 by invoking an access method crafted for that purpose. */
8093 /* Build the necessary access from an inner class to an outer
8094 class. This routine could be optimized to cache previous result
8095 (decl, current_class and returned access). When an access method
8096 needs to be generated, it always takes the form of a read. It might
8097 be later turned into a write by calling outer_field_access_fix. */
8099 static tree
8102 {
8107 /* If the immediate enclosing context of the current class is the
8108 field decl's class or inherits from it; build the access as
8109 `this$<n>.<field>'. Note that we will break the `private' barrier
8110 if we're not emitting bytecodes. */
8113 {
8117 }
8118 /* Otherwise, generate access methods to outer this and access the
8119 field (either using an access method or by direct access.) */
8120 else
8121 {
8124 /* Now we chain the required number of calls to the access$0 to
8125 get a hold to the enclosing instance we need, and then we
8126 build the field access. */
8129 /* If the field is private and we're generating bytecode, then
8130 we generate an access method */
8132 {
8136 }
8137 /* Otherwise we use `access$(this$<j>). ... access$(this$<i>).<field>'.
8138 Once again we break the `private' access rule from a foreign
8139 class. */
8140 else
8142 }
8144 }
8146 /* Return a non zero value if NODE describes an outer field inner
8147 access. */
8149 static int
8152 {
8158 /* If the inner class extends the declaration context of the field
8159 we're try to acces, then this isn't an outer field access */
8165 {
8170 {
8171 /* Before we give up, see whether the field is inherited from
8172 the enclosing context we're considering. */
8175 break;
8176 }
8177 }
8180 }
8182 /* Return a non zero value if NODE represents an outer field inner
8183 access that was been already expanded. As a side effect, it returns
8184 the name of the field being accessed and the argument passed to the
8185 access function, suitable for a regeneration of the access method
8186 call if necessary. */
8188 static int
8191 {
8197 /* Well, gcj generates slightly different tree nodes when compiling
8198 to native or bytecodes. It's the case for function calls. */
8200 if (flag_emit_class_files
8205 {
8210 {
8214 && (OUTER_FIELD_ACCESS_IDENTIFIER_P
8217 }
8218 }
8221 {
8226 }
8227 return identified;
8228 }
8230 /* Detect in NODE an outer field read access from an inner class and
8231 transform it into a write with RHS as an argument. This function is
8232 called from the java_complete_lhs when an assignment to a LHS can
8233 be identified. */
8235 static tree
8238 {
8242 {
8243 /* At any rate, check whether we're trying to assign a value to
8244 a final. */
8249 return error_mark_node;
8254 }
8255 return NULL_TREE;
8256 }
8258 /* Construct the expression that calls an access method:
8259 <type>.access$<n>(<arg1> [, <arg2>]);
8261 ARG2 can be NULL and will be omitted in that case. It will denote a
8262 read access. */
8264 static tree
8268 {
8281 }
8283 static tree
8284 build_new_access_id ()
8285 {
8291 }
8293 /* Create the static access functions for the outer field DECL. We define a
8294 read:
8295 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$) {
8296 return inst$.field;
8297 }
8298 and a write access:
8299 TREE_TYPE (<field>) access$<n> (DECL_CONTEXT (<field>) inst$,
8300 TREE_TYPE (<field>) value$) {
8301 return inst$.field = value$;
8302 }
8303 We should have a usage flags on the DECL so we can lazily turn the ones
8304 we're using for code generation. FIXME.
8305 */
8307 static tree
8309 tree decl;
8310 {
8318 /* Create the identifier and a function named after it. */
8321 /* The identifier is marked as bearing the name of a generated write
8322 access function for outer field accessed from inner classes. */
8325 /* Create the read access */
8335 /* Create the write access method. No write access for final variable */
8337 {
8349 }
8352 /* Return the access name */
8354 }
8356 /* Build an field access method NAME. */
8358 static tree
8361 {
8364 /* Create the method */
8369 /* Attach the method body. */
8376 return mdecl;
8377 }
8379 \f
8380 /* This section deals with building access function necessary for
8381 certain kinds of method invocation from inner classes. */
8383 static tree
8385 tree decl;
8386 {
8393 /* Test this abort with an access to a private field */
8395 abort ();
8397 /* Check the cache first */
8403 /* Obtain an access identifier and mark it */
8408 /* Create the arguments, as much as the original */
8411 {
8415 }
8418 /* Create the method */
8422 /* There is a potential bug here. We should be able to use
8423 fix_method_argument_names, but then arg names get mixed up and
8424 eventually a constructor will have its this$0 altered and the
8425 outer context won't be assignment properly. The test case is
8426 stub.java FIXME */
8429 /* Attach the method body. */
8433 /* The actual method invocation uses the same args. When invoking a
8434 static methods that way, we don't want to skip the first
8435 argument. */
8441 call_args);
8444 call_args);
8454 /* Back tag the access function so it know what it accesses */
8457 /* Tag the current method so it knows it has an access generated */
8459 }
8461 \f
8462 /* This section of the code deals with building expressions to access
8463 the enclosing instance of an inner class. The enclosing instance is
8464 kept in a generated field called this$<n>, with <n> being the
8465 inner class nesting level (starting from 0.) */
8467 /* Build an access to a given this$<n>, always chaining access call to
8468 others. Access methods to this$<n> are build on the fly if
8469 necessary. This CAN'T be used to solely access this$<n-1> from
8470 this$<n> (which alway yield to special cases and optimization, see
8471 for example build_outer_field_access). */
8473 static tree
8477 {
8481 {
8483 {
8486 }
8487 else
8488 {
8498 }
8500 /* if FROM isn't an inter class, that's fine, we've done
8501 enough. What we're looking for can be accessed from there. */
8504 break;
8506 }
8507 return access;
8508 }
8510 /* Build an access function to the this$<n> local to TYPE. NULL_TREE
8511 is returned if nothing needs to be generated. Otherwise, the method
8512 generated and a method decl is returned.
8514 NOTE: These generated methods should be declared in a class file
8515 attribute so that they can't be referred to directly. */
8517 static tree
8519 tree type;
8520 {
8522 tree saved_current_function_decl;
8524 /* If TYPE is a top-level class, no access method is required.
8525 If there already is such an access method, bail out. */
8527 return NULL_TREE;
8529 /* We generate the method. The method looks like:
8530 static <outer_of_type> access$0 (<type> inst$) { return inst$.this$<n>; }
8531 */
8552 return mdecl;
8553 }
8555 /* Craft an correctly numbered `this$<n>'string. this$0 is used for
8556 the first level of innerclassing. this$1 for the next one, etc...
8557 This function can be invoked with TYPE to NULL, available and then
8558 has to count the parser context. */
8560 static tree
8562 tree type;
8563 {
8569 tree decl;
8573 /* Register SAVED_THISN and SAVED_TYPE with the garbage collector. */
8575 {
8579 }
8582 {
8585 else
8586 {
8589 ;
8593 }
8594 }
8595 else
8599 return saved_thisn;
8604 return saved_thisn;
8605 }
8607 /* Return the assignement to the hidden enclosing context `this$<n>'
8608 by the second incoming parameter to the innerclass constructor. The
8609 form used is `this.this$<n> = this$<n>;'. */
8611 static tree
8612 build_thisn_assign ()
8613 {
8615 {
8622 }
8623 return NULL_TREE;
8624 }
8626 \f
8627 /* Building the synthetic `class$' used to implement the `.class' 1.1
8628 extension for non primitive types. This method looks like:
8630 static Class class$(String type) throws NoClassDefFoundError
8631 {
8632 try {return (java.lang.Class.forName (String));}
8633 catch (ClassNotFoundException e) {
8634 throw new NoClassDefFoundError(e.getMessage());}
8635 } */
8637 static tree
8639 tree class;
8640 {
8641 #define BWF(S) build_wfl_node (get_identifier ((S)))
8642 #define MQN(X,Y) make_qualified_name ((X), (Y), 0)
8649 {
8654 }
8656 /* Build the arguments */
8661 /* Build the qualified name java.lang.Class.forName */
8667 /* Create the "class$" function */
8674 /* We start by building the try block. We need to build:
8675 return (java.lang.Class.forName (type)); */
8680 /* Now onto the catch block. We start by building the expression
8681 throwing a new exception: throw new NoClassDefFoundError (_.getMessage) */
8686 /* Build new NoClassDefFoundError (_.getMessage) */
8687 throw_stmt = build_new_invocation
8691 /* Build the throw, (it's too early to use BUILD_THROW) */
8694 /* Encapsulate STMT in a try block. The catch clause executes THROW_STMT */
8707 return mdecl;
8708 }
8710 static tree
8712 tree type;
8713 {
8718 else
8721 /* Ensure that the proper name separator is used */
8729 }
8731 /* This section of the code deals with constructor. */
8733 /* Craft a body for default constructor. Patch existing constructor
8734 bodies with call to super() and field initialization statements if
8735 necessary. */
8737 static void
8739 tree mdecl;
8740 {
8747 return;
8751 {
8752 /* It is an error for the compiler to generate a default
8753 constructor if the superclass doesn't have a constructor that
8754 takes no argument, or the same args for an anonymous class */
8756 {
8761 parse_error_context
8766 }
8768 /* The constructor body must be crafted by hand. It's the
8769 constructor we defined when we realize we didn't have the
8770 CLASSNAME() constructor */
8773 /* Insert an assignment to the this$<n> hidden field, if
8774 necessary */
8778 /* We don't generate a super constructor invocation if we're
8779 compiling java.lang.Object. build_super_invocation takes care
8780 of that. */
8783 /* FIXME */
8788 }
8789 /* Search for an explicit constructor invocation */
8790 else
8791 {
8799 {
8800 case CALL_EXPR:
8805 break;
8806 case COMPOUND_EXPR:
8807 case EXPR_WITH_FILE_LOCATION:
8810 break;
8811 case BLOCK:
8814 break;
8815 default:
8818 }
8820 /* Generate the assignment to this$<n>, if necessary */
8824 /* The constructor is missing an invocation of super() */
8828 /* Explicit super() invokation should take place before the
8829 instance initializer blocks. */
8830 else
8831 {
8835 }
8837 /* Insert the instance initializer block right after. */
8841 /* Fix the constructor main block if we're adding extra stmts */
8843 {
8847 }
8848 }
8849 }
8851 /* Browse constructors in the super class, searching for a constructor
8852 that doesn't take any argument. Return 0 if one is found, 1
8853 otherwise. If the current class is an anonymous inner class, look
8854 for something that has the same signature. */
8856 static int
8858 tree mdecl;
8859 {
8862 tree sdecl;
8868 {
8869 tree mdecl_arg_type;
8873 {
8874 tree m_arg_type;
8883 if (!valid_method_invocation_conversion_p
8886 break;
8890 }
8891 }
8892 else
8893 {
8895 {
8901 }
8902 }
8904 }
8906 /* Generate code for all context remembered for code generation. */
8908 void
8909 java_expand_classes ()
8910 {
8914 java_parse_abort_on_error ();
8916 return;
8917 java_layout_classes ();
8918 java_parse_abort_on_error ();
8922 {
8927 java_parse_abort_on_error ();
8928 }
8931 /* Find anonymous classes and expand their constructor, now they
8932 have been fixed. */
8934 {
8935 tree current;
8938 {
8941 {
8942 tree d;
8944 {
8946 {
8951 }
8952 }
8953 }
8954 }
8955 }
8957 /* If we've found error at that stage, don't try to generate
8958 anything, unless we're emitting xrefs or checking the syntax only
8959 (but not using -fsyntax-only for the purpose of generating
8960 bytecode. */
8963 return;
8965 /* Now things are stable, go for generation of the class data. */
8967 {
8968 tree current;
8971 {
8979 {
8981 finish_class ();
8982 }
8983 }
8984 }
8985 }
8987 /* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
8988 a tree list node containing RIGHT. Fore coming RIGHTs will be
8989 chained to this hook. LOCATION contains the location of the
8990 separating `.' operator. */
8992 static tree
8996 {
8997 tree wfl;
9001 else
9002 {
9004 /* If wfl wasn't qualified, we build a first anchor */
9007 }
9009 /* And chain them */
9013 return wfl;
9014 }
9016 /* Simple merge of two name separated by a `.' */
9018 static tree
9021 {
9022 tree node;
9024 return NULL_TREE;
9027 return right;
9030 return left;
9040 return node;
9041 }
9043 /* Merge the two parts of a qualified name into LEFT. Set the
9044 location information of the resulting node to LOCATION, usually
9045 inherited from the location information of the `.' operator. */
9047 static tree
9051 {
9052 #ifdef USE_COMPONENT_REF
9055 return node;
9056 #else
9063 /* Left wasn't qualified and is now qualified */
9065 {
9069 }
9076 return left;
9077 #endif
9078 }
9080 /* Extract the last identifier component of the qualified in WFL. The
9081 last identifier is removed from the linked list */
9083 static tree
9085 tree wfl;
9086 {
9087 tree q;
9091 {
9093 /* Operating on a non qualified qualified WFL. */
9094 abort ();
9098 }
9099 }
9101 /* Resolve the expression name NAME. Return its decl. */
9103 static tree
9105 tree id;
9107 {
9109 tree decl;
9111 /* 6.5.5.1: Simple expression names */
9113 {
9114 /* 15.13.1: NAME can appear within the scope of a local variable
9115 declaration */
9117 return decl;
9119 /* 15.13.1: NAME can appear within a class declaration */
9120 else
9121 {
9124 {
9128 /* If we're accessing an outer scope local alias, make
9129 sure we change the name of the field we're going to
9130 build access to. */
9134 /* Instance variable (8.3.1.1) can't appear within
9135 static method, static initializer or initializer for
9136 a static variable. */
9138 {
9140 return error_mark_node;
9141 }
9142 /* Instance variables can't appear as an argument of
9143 an explicit constructor invocation */
9146 {
9147 parse_error_context
9148 (id, "Can't reference `%s' before the superclass constructor has been called", IDENTIFIER_POINTER (name));
9149 return error_mark_node;
9150 }
9152 /* If we're processing an inner class and we're trying
9153 to access a field belonging to an outer class, build
9154 the access to the field */
9156 {
9158 {
9160 return error_mark_node;
9161 }
9165 return access;
9166 }
9168 /* Otherwise build what it takes to access the field */
9173 /* We may be asked to save the real field access node */
9176 /* And we return what we got */
9177 return access;
9178 }
9179 /* Fall down to error report on undefined variable */
9180 }
9181 }
9182 /* 6.5.5.2 Qualified Expression Names */
9183 else
9184 {
9188 /* 15.10.1 Field Access Using a Primary and/or Expression Name */
9189 /* 15.10.2: Accessing Superclass Members using super */
9191 }
9193 /* We've got an error here */
9196 "Local variable `%s' can't be accessed from within the inner class `%s' unless it is declared final",
9198 IDENTIFIER_POINTER (DECL_NAME
9200 else
9204 return error_mark_node;
9205 }
9207 static void
9210 {
9211 parse_error_context
9216 }
9218 /* 15.10.1 Field Acess Using a Primary and/or Expression Name.
9219 We return something suitable to generate the field access. We also
9220 return the field decl in FIELD_DECL and its type in FIELD_TYPE. If
9221 recipient's address can be null. */
9223 static tree
9225 tree qual_wfl;
9227 {
9229 tree field_ref;
9234 return error_mark_node;
9236 /* Resolve the LENGTH field of an array here */
9240 {
9244 /* In case we're dealing with a static array, we need to
9245 initialize its class before the array length can be fetched.
9246 It's also a good time to create a DECL_RTL for the field if
9247 none already exists, otherwise if the field was declared in a
9248 class found in an external file and hasn't been (and won't
9249 be) accessed for its value, none will be created. */
9251 {
9254 }
9255 }
9256 /* We might have been trying to resolve field.method(). In which
9257 case, the resolution is over and decl is the answer */
9261 {
9269 return error_mark_node;
9272 }
9273 else
9281 return field_ref;
9282 }
9284 /* If NODE is an access to f static field, strip out the class
9285 initialization part and return the field decl, otherwise, return
9286 NODE. */
9288 static tree
9290 tree node;
9291 {
9293 {
9296 {
9303 }
9305 return op1;
9306 }
9307 return node;
9308 }
9310 /* 6.5.5.2: Qualified Expression Names */
9312 static int
9314 tree wfl;
9316 {
9322 /* For certain for of inner class instantiation */
9324 #define RESTORE_THIS_AND_CURRENT_CLASS \
9330 {
9335 /* 15.10.1 Field Access Using a Primary */
9337 {
9338 case CALL_EXPR:
9339 case NEW_CLASS_EXPR:
9340 /* If the access to the function call is a non static field,
9341 build the code to access it. */
9343 {
9348 }
9350 /* And code for the function call */
9354 /* We might have to setup a new current class and a new this
9355 for the search of an inner class, relative to the type of
9356 a expression resolved as `decl'. The current values are
9357 saved and restored shortly after */
9360 if (decl
9362 || from_qualified_this))
9363 {
9364 /* If we still have `from_qualified_this', we have the form
9365 <T>.this.f() and we need to build <T>.this */
9367 {
9371 }
9375 }
9382 from_super,
9385 {
9386 RESTORE_THIS_AND_CURRENT_CLASS;
9388 }
9391 /* If we're creating an inner class instance, check for that
9392 an enclosing instance is in scope */
9395 {
9396 parse_error_context
9401 RESTORE_THIS_AND_CURRENT_CLASS;
9403 }
9405 /* In case we had to change then to resolve a inner class
9406 instantiation using a primary qualified by a `new' */
9407 RESTORE_THIS_AND_CURRENT_CLASS;
9409 /* EH check. No check on access$<n> functions */
9410 if (location
9411 && !OUTER_FIELD_ACCESS_IDENTIFIER_P
9415 /* If the previous call was static and this one is too,
9416 build a compound expression to hold the two (because in
9417 that case, previous function calls aren't transported as
9418 forcoming function's argument. */
9420 {
9423 }
9424 else
9425 {
9428 }
9430 continue;
9432 case NEW_ARRAY_EXPR:
9433 case NEW_ANONYMOUS_ARRAY_EXPR:
9438 continue;
9440 case CONVERT_EXPR:
9446 continue;
9448 case CONDITIONAL_EXPR:
9449 case STRING_CST:
9450 case MODIFY_EXPR:
9455 continue;
9457 case ARRAY_REF:
9458 /* If the access to the function call is a non static field,
9459 build the code to access it. */
9461 {
9465 }
9466 /* And code for the array reference expression */
9471 continue;
9473 case PLUS_EXPR:
9480 break;
9482 case CLASS_LITERAL:
9487 break;
9489 default:
9490 /* Fix for -Wall Just go to the next statement. Don't
9491 continue */
9492 break;
9493 }
9495 /* If we fall here, we weren't processing a (static) function call. */
9498 /* It can be the keyword THIS */
9501 {
9503 {
9504 parse_error_context
9507 }
9510 {
9511 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
9513 }
9514 /* We have to generate code for intermediate acess */
9516 {
9519 }
9520 /* We're trying to access the this from somewhere else. Make sure
9521 it's allowed before doing so. */
9522 else
9523 {
9525 {
9527 parse_error_context (qual_wfl, "Can't use variable `%s.this': type `%s' isn't an outer type of type `%s'",
9532 }
9534 /* If there's nothing else after that, we need to
9535 produce something now, otherwise, the section of the
9536 code that needs to produce <T>.this will generate
9537 what is necessary. */
9539 {
9543 }
9544 }
9547 continue;
9548 }
9550 /* 15.10.2 Accessing Superclass Members using SUPER */
9553 {
9554 tree node;
9555 /* Check on the restricted use of SUPER */
9558 {
9559 parse_error_context
9562 }
9563 /* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
9572 continue;
9573 }
9575 /* 15.13.1: Can't search for field name in packages, so we
9576 assume a variable/class name was meant. */
9578 {
9581 {
9582 tree list;
9584 /* We want to be absolutely sure that the class is laid
9585 out. We're going to search something inside it. */
9590 /* Fix them all the way down, if any are left. */
9592 {
9595 {
9599 }
9600 }
9601 }
9602 else
9603 {
9605 parse_error_context
9610 else
9611 parse_error_context
9615 }
9616 }
9618 /* We have a type name. It's been already resolved when the
9619 expression was qualified. */
9621 {
9625 /* Sneak preview. If next we see a `new', we're facing a
9626 qualification with resulted in a type being selected
9627 instead of a field. Report the error */
9630 {
9634 }
9637 {
9638 parse_error_context
9645 }
9650 }
9651 /* We resolve and expression name */
9652 else
9653 {
9656 /* If there exists an early resolution, use it. That occurs
9657 only once and we know that there are more things to
9658 come. Don't do that when processing something after SUPER
9659 (we need more thing to be put in place below */
9661 {
9664 {
9666 {
9669 else
9670 {
9672 current_class);
9674 }
9677 }
9678 else
9679 {
9683 }
9684 }
9685 }
9687 /* We have to search for a field, knowing the type of its
9688 container. The flag FROM_TYPE indicates that we resolved
9689 the last member of the expression as a type name, which
9690 means that for the resolution of this field, we'll look
9691 for other errors than if it was resolved as a member of
9692 an other field. */
9693 else
9694 {
9699 {
9700 parse_error_context
9706 }
9711 /* Maybe what we're trying to access to is an inner
9712 class, only if decl is a TYPE_DECL. */
9714 {
9720 {
9725 continue;
9726 }
9727 }
9730 {
9731 parse_error_context
9736 }
9740 /* Layout the type of field_decl, since we may need
9741 it. Don't do primitive types or loaded classes. The
9742 situation of non primitive arrays may not handled
9743 properly here. FIXME */
9746 else
9753 /* Check on accessibility here */
9756 {
9757 parse_error_context
9760 java_accstring_lookup
9764 IDENTIFIER_POINTER
9767 }
9770 /* There are things to check when fields are accessed
9771 from type. There are no restrictions on a static
9772 declaration of the field when it is accessed from an
9773 interface */
9777 && !is_static
9778 && (current_function_decl
9780 {
9783 }
9786 /* It's an access from a type but it isn't static, we
9787 make it relative to `this'. */
9791 /* If we need to generate something to get a proper
9792 handle on what this field is accessed from, do it
9793 now. */
9795 {
9799 }
9801 /* We want to keep the location were found it, and the type
9802 we found. */
9806 /* Generate the correct expression for field access from
9807 qualified this */
9809 {
9812 }
9814 /* This is the decl found and eventually the next one to
9815 search from */
9817 }
9821 /* Sneak preview. If decl is qualified by a `new', report
9822 the error here to be accurate on the peculiar construct */
9826 {
9830 }
9831 }
9832 /* `q' might have changed due to a after package resolution
9833 re-qualification */
9835 break;
9836 }
9839 }
9841 /* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
9842 can't be accessed from REFERENCE (a record type). If MEMBER
9843 features a protected access, we then use WHERE which, if non null,
9844 holds the type of MEMBER's access that is checked against
9845 6.6.2.1. This function should be used when decl is a field or a
9846 method. */
9848 static int
9851 tree where;
9853 {
9856 /* Inner classes are processed by check_inner_class_access */
9860 /* Access always granted for members declared public */
9864 /* Check access on protected members */
9866 {
9867 /* Access granted if it occurs from within the package
9868 containing the class in which the protected member is
9869 declared */
9873 /* If accessed with the form `super.member', then access is granted */
9877 /* If where is active, access was made through a
9878 qualifier. Access is granted if the type of the qualifier is
9879 or is a sublass of the type the access made from (6.6.2.1.) */
9883 /* Otherwise, access is granted if occuring from the class where
9884 member is declared or a subclass of it. Find the right
9885 context to perform the check */
9887 {
9889 {
9893 }
9894 }
9898 }
9900 /* Check access on private members. Access is granted only if it
9901 occurs from within the class in which it is declared -- that does
9902 it for innerclasses too. */
9904 {
9910 }
9912 /* Default access are permitted only when occuring within the
9913 package in which the type (REFERENCE) is declared. In other words,
9914 REFERENCE is defined in the current package */
9918 /* Otherwise, access is granted */
9920 }
9922 /* Test deprecated decl access. */
9923 static void
9926 {
9928 /* Complain if the field is deprecated and the file it was defined
9929 in isn't compiled at the same time the file which contains its
9930 use is */
9933 {
9936 {
9937 case FUNCTION_DECL:
9939 break;
9940 case FIELD_DECL:
9942 break;
9943 case TYPE_DECL:
9945 break;
9946 default:
9947 abort ();
9948 }
9949 parse_warning_context
9953 }
9954 }
9956 /* Returns 1 if class was declared in the current package, 0 otherwise */
9958 static int
9960 tree class;
9961 {
9964 tree left;
9971 /* If the current package is empty and the name of CLASS is
9972 qualified, class isn't in the current package. If there is a
9973 current package and the name of the CLASS is not qualified, class
9974 isn't in the current package */
9978 /* If there is not package and the name of CLASS isn't qualified,
9979 they belong to the same unnamed package */
9983 /* Compare the left part of the name of CLASS with the package name */
9986 {
9988 /* Register CACHE with the garbage collector. */
9990 {
9993 }
9997 }
9999 }
10001 /* This function may generate code to access DECL from WHERE. This is
10002 done only if certain conditions meet. */
10004 static tree
10007 {
10013 return decl;
10014 }
10016 /* Build a method invocation, by patching PATCH. If non NULL
10017 and according to the situation, PRIMARY and WHERE may be
10018 used. IS_STATIC is set to 1 if the invoked function is static. */
10020 static tree
10027 {
10031 tree list;
10037 /* Should be overriden if everything goes well. Otherwise, if
10038 something fails, it should keep this value. It stop the
10039 evaluation of a bogus assignment. See java_complete_tree,
10040 MODIFY_EXPR: for the reasons why we sometimes want to keep on
10041 evaluating an assignment */
10044 /* Since lookup functions are messing with line numbers, save the
10045 context now. */
10046 java_parser_context_save_global ();
10048 /* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
10050 /* Resolution of qualified name, excluding constructors */
10052 {
10054 /* Extract the last IDENTIFIER of the qualified
10055 expression. This is a wfl and we will use it's location
10056 data during error report. */
10060 /* Given the context, IDENTIFIER is syntactically qualified
10061 as a MethodName. We need to qualify what's before */
10066 PATCH_METHOD_RETURN_ERROR ();
10072 {
10073 parse_error_context
10077 PATCH_METHOD_RETURN_ERROR ();
10078 }
10083 /* We're resolving a call from a type */
10085 {
10087 {
10088 parse_error_context
10093 PATCH_METHOD_RETURN_ERROR ();
10094 }
10096 {
10098 parse_error_context
10104 PATCH_METHOD_RETURN_ERROR ();
10105 }
10106 }
10107 else
10113 /* IDENTIFIER_WFL will be used to report any problem further */
10115 }
10116 /* Resolution of simple names, names generated after a primary: or
10117 constructors */
10118 else
10119 {
10123 /* We search constructor in their target class */
10125 {
10129 this_identifier_node)
10132 super_identifier_node)
10133 {
10136 class_to_search =
10138 else
10139 {
10141 PATCH_METHOD_RETURN_ERROR ();
10142 }
10143 }
10145 /* Class to search is NULL if we're searching the current one */
10147 {
10151 {
10152 parse_error_context
10155 PATCH_METHOD_RETURN_ERROR ();
10156 }
10158 /* Can't instantiate an abstract class, but we can
10159 invoke it's constructor. It's use within the `new'
10160 context is denied here. */
10163 {
10164 parse_error_context
10167 PATCH_METHOD_RETURN_ERROR ();
10168 }
10171 }
10172 else
10175 }
10176 /* This is a regular search in the local class, unless an
10177 alternate class is specified. */
10178 else
10179 {
10184 else
10185 {
10188 for (;;)
10189 {
10191 break;
10193 {
10197 PATCH_METHOD_RETURN_ERROR ();
10198 }
10199 class_to_search
10201 }
10202 }
10204 }
10206 /* NAME is a simple identifier or comes from a primary. Search
10207 in the class whose declaration contain the method being
10208 invoked. */
10212 /* Don't continue if no method were found, as the next statement
10213 can't be executed then. */
10215 PATCH_METHOD_RETURN_ERROR ();
10221 /* Check for static reference if non static methods */
10224 PATCH_METHOD_RETURN_ERROR ();
10226 /* Check for inner classes creation from illegal contexts */
10230 {
10231 parse_error_context
10236 PATCH_METHOD_RETURN_ERROR ();
10237 }
10239 /* Non static methods are called with the current object extra
10240 argument. If patch a `new TYPE()', the argument is the value
10241 returned by the object allocator. If method is resolved as a
10242 primary, use the primary otherwise use the current THIS. */
10245 {
10248 /* If we're using an access method, things are different.
10249 There are two familly of cases:
10251 1) We're not generating bytecodes:
10253 - LIST is non static. It's invocation is transformed from
10254 x(a1,...,an) into this$<n>.x(a1,....an).
10255 - LIST is static. It's invocation is transformed from
10256 x(a1,...,an) into TYPE_OF(this$<n>).x(a1,....an)
10258 2) We're generating bytecodes:
10260 - LIST is non static. It's invocation is transformed from
10261 x(a1,....,an) into access$<n>(this$<n>,a1,...,an).
10262 - LIST is static. It's invocation is transformed from
10263 x(a1,....,an) into TYPE_OF(this$<n>).x(a1,....an).
10265 Of course, this$<n> can be abitrary complex, ranging from
10266 this$0 (the immediate outer context) to
10267 access$0(access$0(...(this$0))).
10269 maybe_use_access_method returns a non zero value if the
10270 this_arg has to be moved into the (then generated) stub
10271 argument list. In the meantime, the selected function
10272 might have be replaced by a generated stub. */
10275 {
10278 }
10279 }
10280 }
10282 /* Merge point of all resolution schemes. If we have nothing, this
10283 is an error, already signaled */
10285 PATCH_METHOD_RETURN_ERROR ();
10287 /* Check accessibility, position the is_static flag, build and
10288 return the call */
10292 /* Calls to clone() on array types are permitted as a special-case. */
10294 {
10304 /* FIXME: WFL yields the wrong message here but I don't know
10305 what else to use. */
10309 PATCH_METHOD_RETURN_ERROR ();
10310 }
10313 /* If invoking a innerclass constructor, there are hidden parameters
10314 to pass */
10317 {
10318 /* And make sure we add the accessed local variables to be saved
10319 in field aliases. */
10320 args = build_alias_initializer_parameter_list
10323 /* Secretly pass the current_this/primary as a second argument */
10325 {
10326 tree extra_arg;
10327 tree this_type = (current_this ?
10329 /* Method's (list) enclosing context */
10331 /* If we have a primary, use it. */
10334 /* The current `this' is an inner class but isn't a direct
10335 enclosing context for the inner class we're trying to
10336 create. Build an access to the proper enclosing context
10337 and use it. */
10340 {
10345 }
10346 /* Otherwise, just use the current `this' as an enclosing
10347 context. */
10348 else
10351 }
10352 else
10354 }
10356 /* This handles the situation where a constructor invocation needs
10357 to have an enclosing context passed as a second parameter (the
10358 constructor is one of an inner class. We extract it from the
10359 current function. */
10360 if ((is_super_init ||
10363 {
10365 tree extra_arg;
10368 {
10371 }
10372 else
10373 {
10375 extra_arg =
10378 }
10380 }
10386 /* In the context of an explicit constructor invocation, we can't
10387 invoke any method relying on `this'. Exceptions are: we're
10388 invoking a static function, primary exists and is not the current
10389 this, we're creating a new object. */
10391 && !is_static_flag
10394 {
10395 parse_error_context (wfl, "Can't reference `this' before the superclass constructor has been called");
10396 PATCH_METHOD_RETURN_ERROR ();
10397 }
10398 java_parser_context_restore_global ();
10401 /* Sometimes, we want the decl of the selected method. Such as for
10402 EH checking */
10407 /* Now is a good time to insert the call to finit$ */
10409 {
10412 /* Prepare to pass hidden parameters to finit$, if any. */
10413 finit_parms = build_alias_initializer_parameter_list
10416 finit_call =
10418 finit_parms);
10420 /* Generate the code used to initialize fields declared with an
10421 initialization statement and build a compound statement along
10422 with the super constructor invocation. */
10426 }
10427 return patch;
10428 }
10430 /* Check that we're not trying to do a static reference to a method in
10431 non static method. Return 1 if it's the case, 0 otherwise. */
10433 static int
10436 {
10439 {
10441 parse_error_context
10447 }
10449 }
10451 /* Fix the invocation of *MDECL if necessary in the case of a
10452 invocation from an inner class. *THIS_ARG might be modified
10453 appropriately and an alternative access to *MDECL might be
10454 returned. */
10456 static int
10460 {
10461 tree ctx;
10466 if (is_super_init
10473 /* If we're calling a method found in an enclosing class, generate
10474 what it takes to retrieve the right this. Don't do that if we're
10475 invoking a static method. Note that if MD's type is unrelated to
10476 CURRENT_CLASS, then the current this can be used. */
10479 {
10482 {
10485 }
10486 else
10487 {
10490 {
10493 {
10495 break;
10496 }
10499 }
10500 }
10502 }
10504 /* We might have to use an access method to get to MD. We can
10505 break the method access rule as far as we're not generating
10506 bytecode */
10508 {
10511 }
10516 /* Returnin a non zero value indicates we were doing a non static
10517 method invokation that is now a static invocation. It will have
10518 callee displace `this' to insert it in the regular argument
10519 list. */
10521 }
10523 /* Patch an invoke expression METHOD and ARGS, based on its invocation
10524 mode. */
10526 static tree
10529 {
10534 /* Last step for args: convert build-in types. If we're dealing with
10535 a new TYPE() type call, the first argument to the constructor
10536 isn't found in the incoming argument list, but delivered by
10537 `new' */
10547 /* Resolve unresolved returned type isses */
10554 else
10555 {
10558 {
10559 case INVOKE_VIRTUAL:
10562 break;
10564 case INVOKE_NONVIRTUAL:
10565 /* If the object for the method call is null, we throw an
10566 exception. We don't do this if the object is the current
10567 method's `this'. In other cases we just rely on an
10568 optimization pass to eliminate redundant checks. */
10570 {
10571 /* We use a save_expr here to make sure we only evaluate
10572 the new `self' expression once. */
10576 }
10577 /* Fall through. */
10579 case INVOKE_SUPER:
10580 case INVOKE_STATIC:
10584 break;
10586 case INVOKE_INTERFACE:
10589 break;
10591 default:
10592 abort ();
10593 }
10595 /* Ensure self_type is initialized, (invokestatic). FIXME */
10597 }
10604 /* We're processing a `new TYPE ()' form. New is called and its
10605 returned value is the first argument to the constructor. We build
10606 a COMPOUND_EXPR and use saved expression so that the overall NEW
10607 expression value is a pointer to a newly created and initialized
10608 class. */
10610 {
10614 {
10616 return patch;
10617 }
10626 NULL_TREE);
10633 }
10635 /* If CHECK is set, then we are building a check to see if the object
10636 is NULL. */
10638 {
10641 }
10643 /* In order to be able to modify PATCH later, we SAVE_EXPR it and
10644 put it as the first expression of a COMPOUND_EXPR. The second
10645 expression being an empty statement to be later patched if
10646 necessary. We remember a TREE_LIST (the PURPOSE is the method,
10647 the VALUE is the compound) in a hashtable and return a
10648 COMPOUND_EXPR built so that the result of the evaluation of the
10649 original PATCH node is returned. */
10652 {
10653 tree list;
10665 }
10667 return patch;
10668 }
10670 static int
10672 tree method;
10674 {
10678 return INVOKE_SUPER;
10681 return INVOKE_STATIC;
10683 /* We have to look for a constructor before we handle nonvirtual
10684 calls; otherwise the constructor will look nonvirtual. */
10686 return INVOKE_STATIC;
10689 return INVOKE_NONVIRTUAL;
10692 return INVOKE_NONVIRTUAL;
10695 return INVOKE_INTERFACE;
10697 return INVOKE_VIRTUAL;
10698 }
10700 /* Retrieve a refined list of matching methods. It covers the step
10701 15.11.2 (Compile-Time Step 2) */
10703 static tree
10706 tree cl;
10708 {
10714 /* Fix the arguments */
10716 {
10718 /* Non primitive type may have to be resolved */
10721 /* And promoted */
10725 }
10727 /* Presto. If we're dealing with an anonymous class and a
10728 constructor call, generate the right constructor now, since we
10729 know the arguments' types. */
10734 /* Find all candidates and then refine the list, searching for the
10735 most specific method. */
10741 /* Issue an error. List candidates if any. Candidates are listed
10742 only if accessible (non accessible methods may end-up here for
10743 the sake of a better error report). */
10746 {
10747 tree current;
10750 {
10754 continue;
10755 sprintf
10761 }
10764 }
10765 /* Issue the error message */
10776 return NULL_TREE;
10777 }
10779 /* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
10780 when we're looking for a constructor. */
10782 static tree
10786 {
10791 /* Check the hash table to determine if this class has been searched
10792 already. */
10794 {
10797 return NULL;
10798 }
10799 else
10800 {
10802 java_hash_compare_tree_node);
10804 }
10806 search_not_done++;
10811 {
10814 }
10816 /* Search interfaces */
10819 {
10826 {
10828 tree rlist;
10831 arglist);
10833 }
10834 }
10835 /* Search classes */
10836 else
10837 {
10841 /* When looking finit$, class$ or instinit$, we turn LC to 1 so
10842 that we only search in class. Note that we should have found
10843 something at this point. */
10845 {
10848 abort ();
10849 }
10851 /* We must search all interfaces of this class */
10853 {
10857 {
10860 {
10861 tree rlist
10865 }
10866 }
10867 }
10869 /* Search superclass */
10871 {
10872 tree rlist;
10877 }
10878 }
10880 search_not_done--;
10882 /* We're done. Reset the searched classes list and finally search
10883 java.lang.Object if it wasn't searched already. */
10885 {
10886 if (!lc
10891 {
10895 }
10898 }
10900 /* Either return the list obtained or all selected (but
10901 inaccessible) methods for better error report. */
10903 }
10905 /* Effectively search for the appropriate method in method */
10907 static void
10912 {
10914 {
10915 /* When dealing with constructor, stop here, otherwise search
10916 other classes */
10918 continue;
10921 continue;
10924 {
10925 /* Retain accessible methods only */
10929 else
10930 /* Also retain all selected method here */
10932 }
10933 }
10934 }
10936 /* 15.11.2.2 Choose the Most Specific Method */
10938 static tree
10940 tree list;
10941 {
10946 {
10947 tree method;
10951 {
10953 /* Don't test a method against itself */
10955 continue;
10960 /* Compare arguments and location where methods where declared */
10962 {
10963 if (valid_method_invocation_conversion_p
10968 {
10972 }
10973 }
10974 }
10975 }
10977 /* Review the list and select the maximally specific methods */
10981 {
10984 candidates++;
10985 }
10987 /* If we have several and they're all abstract, just pick the
10988 closest one. */
10990 {
10993 }
10995 /* We have several (we couldn't find a most specific), all but one
10996 are abstract, we pick the only non abstract one. */
10998 {
11001 {
11004 }
11005 }
11007 /* If we can't find one, lower expectations and try to gather multiple
11008 maximally specific methods */
11010 {
11012 {
11015 }
11016 }
11018 return new_list;
11019 }
11021 /* Make sure that the type of each M2_OR_ARGLIST arguments can be
11022 converted by method invocation conversion (5.3) to the type of the
11023 corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
11024 to change less often than M1. */
11026 static int
11029 {
11036 /* Register M2_ARG_VALUE and M2_ARG_CACHE with the garbage
11037 collector. */
11039 {
11043 }
11049 else
11050 {
11051 /* M2_OR_ARGLIST can be a function DECL or a raw list of
11052 argument types */
11054 {
11058 }
11059 else
11064 }
11067 {
11071 break;
11074 }
11076 }
11078 /* Qualification routines */
11080 static void
11082 tree id;
11083 {
11085 saved_current_class;
11089 /* We first qualify the first element, then derive qualification of
11090 others based on the first one. If the first element is qualified
11091 by a resolution (field or type), this resolution is stored in the
11092 QUAL_RESOLUTION of the qual element being examined. We need to
11093 save the current_class since the use of SUPER might change the
11094 its value. */
11097 do {
11099 /* Simple qualified expression feature a qual_wfl that is a
11100 WFL. Expression derived from a primary feature more complicated
11101 things like a CALL_EXPR. Expression from primary need to be
11102 worked out to extract the part on which the qualification will
11103 take place. */
11106 {
11107 case CALL_EXPR:
11110 {
11113 }
11114 break;
11115 case NEW_ARRAY_EXPR:
11116 case NEW_ANONYMOUS_ARRAY_EXPR:
11119 continue;
11120 case CONVERT_EXPR:
11121 break;
11122 case NEW_CLASS_EXPR:
11124 break;
11125 case ARRAY_REF:
11128 break;
11129 case STRING_CST:
11132 break;
11133 case CLASS_LITERAL:
11136 break;
11137 default:
11138 /* Fix for -Wall. Just break doing nothing */
11139 break;
11140 }
11146 /* Pos evaluation: non WFL leading expression nodes */
11167 {
11171 }
11172 else
11173 {
11176 {
11179 }
11180 }
11182 /* If we have a THIS (from a primary), we set the context accordingly */
11184 {
11185 /* This isn't really elegant. One more added irregularity
11186 before I start using COMPONENT_REF (hopefully very soon.) */
11189 EXPR_WITH_FILE_LOCATION
11191 this_identifier_node)
11192 {
11195 }
11205 }
11206 /* If we have a SUPER, we set the context accordingly */
11208 {
11210 /* Check that there is such a thing as a super class. If not,
11211 return. The error will be caught later on, during the
11212 resolution */
11214 {
11216 return;
11217 }
11219 /* Do one more interation to set things up */
11221 }
11224 /* If name appears within the scope of a local variable declaration
11225 or parameter declaration, then it is an expression name. We don't
11226 carry this test out if we're in the context of the use of SUPER
11227 or THIS */
11231 {
11234 }
11236 /* If within the class/interface NAME was found to be used there
11237 exists a (possibly inherited) field named NAME, then this is an
11238 expression name. If we saw a NEW_ARRAY_EXPR before and want to
11239 address length, it is OK. */
11242 {
11245 }
11247 /* We reclassify NAME as yielding to a type name resolution if:
11248 - NAME is a class/interface declared within the compilation
11249 unit containing NAME,
11250 - NAME is imported via a single-type-import declaration,
11251 - NAME is declared in an another compilation unit of the package
11252 of the compilation unit containing NAME,
11253 - NAME is declared by exactly on type-import-on-demand declaration
11254 of the compilation unit containing NAME.
11255 - NAME is actually a STRING_CST.
11256 This can't happen if the expression was qualified by `this.' */
11261 {
11264 }
11266 /* Method call, array references and cast are expression name */
11273 /* Check here that NAME isn't declared by more than one
11274 type-import-on-demand declaration of the compilation unit
11275 containing NAME. FIXME */
11277 /* Otherwise, NAME is reclassified as a package name */
11278 else
11281 /* Propagate the qualification accross other components of the
11282 qualified name */
11285 {
11288 else
11290 }
11292 /* Store the global qualification for the ambiguous part of ID back
11293 into ID fields */
11301 /* Restore the current class */
11303 }
11305 static int
11308 {
11315 /* Breakdown NAME into REMAINDER . IDENTIFIER */
11318 p--;
11320 /* We didn't find a '.'. Return an error */
11330 }
11332 /* Return TRUE if two classes are from the same package. */
11334 static int
11337 {
11338 tree tmp;
11339 tree pkg1;
11340 tree pkg2;
11348 /* One in empty package. */
11352 /* Both in empty package. */
11359 }
11361 /* Patch tree nodes in a function body. When a BLOCK is found, push
11362 local variable decls if present.
11363 Same as java_complete_lhs, but does resolve static finals to values. */
11365 static tree
11367 tree node;
11368 {
11373 {
11379 {
11380 /* fold_constant_for_init sometimes widen the original type
11381 of the constant (i.e. byte to int.) It's not desirable,
11382 especially if NODE is a function argument. */
11386 else
11387 return value;
11388 }
11389 else
11391 }
11392 return node;
11393 }
11395 static tree
11397 tree node;
11398 {
11400 {
11405 return node;
11406 }
11408 }
11410 /* Patch tree nodes in a function body. When a BLOCK is found, push
11411 local variable decls if present.
11412 Same as java_complete_tree, but does not resolve static finals to values. */
11414 static tree
11416 tree node;
11417 {
11421 /* CONVERT_EXPR always has its type set, even though it needs to be
11422 worked out. */
11424 return node;
11426 /* The switch block implements cases processing container nodes
11427 first. Contained nodes are always written back. Leaves come
11428 next and return a value. */
11430 {
11431 case BLOCK:
11433 /* 1- Block section.
11434 Set the local values on decl names so we can identify them
11435 faster when they're referenced. At that stage, identifiers
11436 are legal so we don't check for declaration errors. */
11438 {
11441 }
11444 else
11445 {
11450 {
11451 /* Re-order from (((A; B); C); ...; Z) to
11452 (A; (B; (C ; (...; Z)))).
11453 This makes it easier to scan the statements left-to-right
11454 without using recursion (which might overflow the stack
11455 if the block has many statements. */
11456 for (;;)
11457 {
11460 break;
11464 }
11466 }
11468 /* Now do the actual complete, without deep recursion for
11469 long blocks. */
11473 {
11478 {
11479 /* Optimization; makes it easier to detect empty bodies.
11480 Most useful for <clinit> with all-constant initializer. */
11482 continue;
11483 }
11485 error_seen++;
11487 {
11489 for (;;)
11490 {
11495 else
11496 break;
11497 }
11501 }
11503 }
11507 return error_mark_node;
11509 }
11510 /* Turn local bindings to null */
11515 break;
11517 /* 2- They are expressions but ultimately deal with statements */
11519 case THROW_EXPR:
11522 /* 14.19 A throw statement cannot complete normally. */
11526 case SYNCHRONIZED_EXPR:
11530 case TRY_EXPR:
11533 case TRY_FINALLY_EXPR:
11544 return node;
11546 case CLEANUP_POINT_EXPR:
11551 return node;
11553 case WITH_CLEANUP_EXPR:
11559 return node;
11561 case LABELED_BLOCK_EXPR:
11566 POP_LABELED_BLOCK ();
11569 {
11572 }
11575 return node;
11577 case EXIT_BLOCK_EXPR:
11578 /* We don't complete operand 1, because it's the return value of
11579 the EXIT_BLOCK_EXPR which doesn't exist it Java */
11582 case CASE_EXPR:
11585 return cn;
11587 /* First, the case expression must be constant. Values of final
11588 fields are accepted. */
11594 {
11597 }
11600 {
11603 return error_mark_node;
11604 }
11608 /* It must be assignable to the type of the switch expression. */
11611 {
11613 parse_error_context
11617 return error_mark_node;
11618 }
11624 /* Multiple instance of a case label bearing the same
11625 value is checked during code generation. The case
11626 expression is allright so far. */
11633 break;
11635 case DEFAULT_EXPR:
11637 /* Only one default label is allowed per switch statement */
11639 {
11643 return error_mark_node;
11644 }
11645 else
11650 break;
11652 case SWITCH_EXPR:
11653 case LOOP_EXPR:
11655 /* Check whether the loop was enclosed in a labeled
11656 statement. If not, create one, insert the loop in it and
11657 return the node */
11660 /* Anyways, walk the body of the loop */
11663 /* Switch statement: walk the switch expression and the cases */
11664 else
11669 else
11670 {
11672 /* If we returned something different, that's because we
11673 inserted a label. Pop the label too. */
11675 {
11678 POP_LABELED_BLOCK ();
11679 }
11680 }
11681 POP_LOOP ();
11682 return nn;
11684 case EXIT_EXPR:
11688 case COND_EXPR:
11689 /* Condition */
11692 return error_mark_node;
11693 /* then-else branches */
11696 return error_mark_node;
11699 return error_mark_node;
11701 break;
11703 case CONDITIONAL_EXPR:
11704 /* Condition */
11713 /* 3- Expression section */
11714 case COMPOUND_EXPR:
11720 else
11721 {
11723 {
11724 /* An unreachable condition in a do-while statement
11725 is *not* (technically) an unreachable statement. */
11730 {
11733 }
11734 }
11737 return error_mark_node;
11740 }
11742 break;
11744 case RETURN_EXPR:
11745 /* CAN_COMPLETE_NORMALLY (node) = 0; */
11748 case EXPR_WITH_FILE_LOCATION:
11751 {
11755 return node;
11756 /* Keep line number information somewhere were it doesn't
11757 disrupt the completion process. */
11759 {
11762 }
11764 }
11765 else
11766 {
11767 tree body;
11776 {
11777 /* Makes it easier to constant fold, detect empty bodies. */
11778 return body;
11779 }
11781 {
11782 /* Its important for the evaluation of assignment that
11783 this mark on the TREE_TYPE is propagated. */
11785 return error_mark_node;
11786 }
11787 else
11790 }
11791 break;
11793 case NEW_ARRAY_EXPR:
11794 /* Patch all the dimensions */
11797 {
11802 {
11804 continue;
11805 }
11806 else
11807 {
11809 /* Setup the location of the current dimension, for
11810 later error report. */
11814 }
11815 }
11816 /* They complete the array creation expression, if no errors
11817 were found. */
11819 return (flag ? error_mark_node
11822 case NEW_ANONYMOUS_ARRAY_EXPR:
11823 /* Create the array type if necessary. */
11825 {
11828 return error_mark_node;
11832 }
11836 return error_mark_node;
11838 return node;
11840 case NEW_CLASS_EXPR:
11841 case CALL_EXPR:
11842 /* Complete function's argument(s) first */
11844 return error_mark_node;
11845 else
11846 {
11850 super_identifier_node);
11855 return error_mark_node;
11858 /* If we call this(...), register signature and positions */
11865 }
11867 case MODIFY_EXPR:
11868 /* Save potential wfls */
11875 {
11876 tree value;
11881 {
11885 return empty_stmt_node;
11886 }
11891 }
11895 return error_mark_node;
11899 {
11900 /* This might break when accessing outer field from inner
11901 class. TESTME, FIXME */
11904 /* Hand stabilize the lhs on both places */
11909 /* 15.25.2.a: Left hand is not an array access. FIXME */
11910 /* Now complete the RHS. We write it back later on. */
11916 /* The last part of the rewrite for E1 op= E2 is to have
11917 E1 = (T)(E1 op E2), with T being the type of E1. */
11921 /* If the assignment is compound and has reference type,
11922 then ensure the LHS has type String and nothing else. */
11929 /* 15.25.2.b: Left hand is an array access. FIXME */
11930 }
11932 /* If we're about to patch a NEW_ARRAY_INIT, we call a special
11933 function to complete this RHS. Note that a NEW_ARRAY_INIT
11934 might have been already fully expanded if created as a result
11935 of processing an anonymous array initializer. We avoid doing
11936 the operation twice by testing whether the node already bears
11937 a type. */
11941 /* Otherwise we simply complete the RHS */
11942 else
11946 return error_mark_node;
11948 /* Write back the RHS as we evaluated it. */
11951 /* In case we're handling = with a String as a RHS, we need to
11952 produce a String out of the RHS (it might still be a
11953 STRING_CST or a StringBuffer at this stage */
11959 {
11960 /* We return error_mark_node if outer_field_access_fix
11961 detects we write into a final. */
11963 return error_mark_node;
11965 }
11966 else
11967 {
11969 /* Reorganize the tree if necessary. */
11973 }
11976 return node;
11978 case MULT_EXPR:
11979 case PLUS_EXPR:
11980 case MINUS_EXPR:
11981 case LSHIFT_EXPR:
11982 case RSHIFT_EXPR:
11983 case URSHIFT_EXPR:
11984 case BIT_AND_EXPR:
11985 case BIT_XOR_EXPR:
11986 case BIT_IOR_EXPR:
11987 case TRUNC_MOD_EXPR:
11988 case TRUNC_DIV_EXPR:
11989 case RDIV_EXPR:
11990 case TRUTH_ANDIF_EXPR:
11991 case TRUTH_ORIF_EXPR:
11992 case EQ_EXPR:
11993 case NE_EXPR:
11994 case GT_EXPR:
11995 case GE_EXPR:
11996 case LT_EXPR:
11997 case LE_EXPR:
11998 /* Operands 0 and 1 are WFL in certain cases only. patch_binop
11999 knows how to handle those cases. */
12004 /* Don't complete string nodes if dealing with the PLUS operand. */
12006 {
12009 return error_mark_node;
12012 }
12014 {
12017 return error_mark_node;
12020 }
12023 case INSTANCEOF_EXPR:
12027 {
12029 return node;
12030 }
12033 case UNARY_PLUS_EXPR:
12034 case NEGATE_EXPR:
12035 case TRUTH_NOT_EXPR:
12036 case BIT_NOT_EXPR:
12037 case PREDECREMENT_EXPR:
12038 case PREINCREMENT_EXPR:
12039 case POSTDECREMENT_EXPR:
12040 case POSTINCREMENT_EXPR:
12041 case CONVERT_EXPR:
12042 /* There are cases were wfl_op1 is a WFL. patch_unaryop knows
12043 how to handle those cases. */
12048 return error_mark_node;
12051 break;
12053 case ARRAY_REF:
12054 /* There are cases were wfl_op1 is a WFL. patch_array_ref knows
12055 how to handle those cases. */
12059 return error_mark_node;
12062 /* The same applies to wfl_op2 */
12066 return error_mark_node;
12071 case RECORD_TYPE:
12072 return node;;
12074 case COMPONENT_REF:
12075 /* The first step in the re-write of qualified name handling. FIXME.
12076 So far, this is only to support PRIMTYPE.class -> PRIMCLASS.TYPE. */
12079 {
12083 {
12085 return error_mark_node;
12086 }
12088 {
12090 return error_mark_node;
12091 }
12092 return field;
12093 }
12094 else
12095 abort ();
12096 break;
12098 case THIS_EXPR:
12099 /* Can't use THIS in a static environment */
12101 {
12106 return error_mark_node;
12107 }
12109 {
12111 parse_error_context
12112 (wfl_operator, "Can't reference `this' or `super' before the superclass constructor has been called");
12114 return error_mark_node;
12115 }
12116 return current_this;
12118 case CLASS_LITERAL:
12122 return error_mark_node;
12123 break;
12125 default:
12127 /* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
12128 and it's time to turn it into the appropriate String object */
12131 else
12133 }
12134 return node;
12135 }
12137 /* Complete function call's argument. Return a non zero value is an
12138 error was found. */
12140 static int
12142 tree node;
12143 {
12145 tree cn;
12149 {
12154 {
12156 continue;
12157 }
12158 /* If have a string literal that we haven't transformed yet or a
12159 crafted string buffer, as a result of use of the the String
12160 `+' operator. Build `parm.toString()' and expand it. */
12163 /* Inline PRIMTYPE.TYPE read access */
12167 }
12169 return flag;
12170 }
12172 /* Sometimes (for loops and variable initialized during their
12173 declaration), we want to wrap a statement around a WFL and turn it
12174 debugable. */
12176 static tree
12179 tree stmt;
12180 {
12182 {
12185 }
12187 return stmt;
12188 }
12190 static tree
12193 {
12200 return node;
12201 }
12203 /* Create a new function block and link it approriately to current
12204 function block chain */
12206 static tree
12207 enter_block ()
12208 {
12211 /* Link block B supercontext to the previous block. The current
12212 function DECL is used as supercontext when enter_a_block is called
12213 for the first time for a given function. The current function body
12214 (DECL_FUNCTION_BODY) is set to be block B. */
12221 }
12224 {
12227 }
12228 else
12229 {
12232 }
12233 return b;
12234 }
12236 /* Exit a block by changing the current function body
12237 (DECL_FUNCTION_BODY) to the current block super context, only if
12238 the block being exited isn't the method's top level one. */
12240 static tree
12241 exit_block ()
12242 {
12243 tree b;
12245 {
12249 }
12250 else
12251 {
12256 }
12257 return b;
12258 }
12260 /* Lookup for NAME in the nested function's blocks, all the way up to
12261 the current toplevel one. It complies with Java's local variable
12262 scoping rules. */
12264 static tree
12266 tree name;
12267 {
12271 {
12272 tree current;
12274 /* Paranoid sanity check. To be removed */
12276 abort ();
12281 return current;
12283 }
12284 return NULL_TREE;
12285 }
12287 static void
12288 maybe_absorb_scoping_blocks ()
12289 {
12291 {
12295 }
12296 }
12298 \f
12299 /* This section of the source is reserved to build_* functions that
12300 are building incomplete tree nodes and the patch_* functions that
12301 are completing them. */
12303 /* Wrap a non WFL node around a WFL. */
12305 static tree
12307 tree node;
12309 {
12312 /* We want to process THIS . xxx symbolicaly, to keep it consistent
12313 with the way we're processing SUPER. A THIS from a primary as a
12314 different form than a SUPER. Turn THIS into something symbolic */
12317 else
12322 return wfl;
12323 }
12325 /* Build a super() constructor invocation. Returns empty_stmt_node if
12326 we're currently dealing with the class java.lang.Object. */
12328 static tree
12330 tree mdecl;
12331 {
12333 return empty_stmt_node;
12334 else
12335 {
12338 /* If we're dealing with an anonymous class, pass the arguments
12339 of the crafted constructor along. */
12341 {
12345 }
12347 }
12348 }
12350 /* Build a SUPER/THIS qualified method invocation. */
12352 static tree
12357 {
12358 tree invok;
12359 tree wfl =
12364 }
12366 /* Build an incomplete CALL_EXPR node. */
12368 static tree
12370 tree name;
12371 tree args;
12372 {
12376 return call;
12377 }
12379 /* Build an incomplete new xxx(...) node. */
12381 static tree
12384 {
12388 return call;
12389 }
12391 /* Build an incomplete assignment expression. */
12393 static tree
12397 {
12398 tree assignment;
12399 /* Build the corresponding binop if we deal with a Compound
12400 Assignment operator. Mark the binop sub-tree as part of a
12401 Compound Assignment expression */
12403 {
12406 }
12410 return assignment;
12411 }
12413 /* Print an INTEGER_CST node in a static buffer, and return the buffer. */
12417 tree node;
12418 {
12428 {
12432 }
12433 else
12437 return buffer;
12438 }
12440 \f
12442 /* This section of the code handle assignment check with FINAL
12443 variables. */
12445 static void
12447 tree class;
12448 {
12449 tree field;
12453 }
12455 /* Figure whether all final static variable have been initialized. */
12457 static void
12459 tree class;
12460 {
12461 tree field;
12466 parse_error_context
12470 }
12472 /* This function marks all final variable locally unassigned. */
12474 static void
12476 tree class;
12477 {
12478 tree field;
12482 }
12484 /* Figure whether all final variables have beem initialized in MDECL
12485 and mark MDECL accordingly. */
12487 static void
12489 tree class;
12490 tree mdecl;
12491 {
12492 tree field;
12497 return;
12499 /* First find out whether all final variables or no final variable
12500 are initialized in this ctor. We don't take into account final
12501 variable that have been initialized upon declaration. */
12504 {
12506 initialized++;
12507 else
12508 non_initialized++;
12509 }
12511 /* There were no non initialized variable and no initialized variable.
12512 This ctor is fine. */
12515 /* If no variables have been initialized, that fine. We'll check
12516 later whether this ctor calls a constructor which initializes
12517 them. We mark the ctor as not initializing all its finals. */
12520 /* If we have a mixed bag, then we have a problem. We need to report
12521 all the variables we're not initializing. */
12523 {
12528 {
12529 parse_error_context
12534 }
12535 }
12536 /* Otherwise we know this ctor is initializing all its final
12537 variable. We mark it so. */
12538 else
12540 }
12542 /* This function recurses in a simple what through STMT and stops when
12543 it finds a constructor call. It then verifies that the called
12544 constructor initialized its final properly. Return 1 upon success,
12545 0 or -1 otherwise. */
12547 static int
12549 tree stmt;
12550 {
12553 {
12554 case EXPR_WITH_FILE_LOCATION:
12556 case COMPOUND_EXPR:
12559 return res;
12561 case SAVE_EXPR:
12563 case CALL_EXPR:
12564 {
12566 tree fbody;
12571 abort ();
12581 }
12582 default:
12583 break;
12584 }
12586 }
12588 /* This is the last chance to catch a final variable initialization
12589 problem. This routine will report an error if a final variable was
12590 never (globally) initialized and never reported as not having been
12591 initialized properly. */
12593 static void
12595 tree class;
12596 {
12600 /* We go through all natural ctors and see whether they're
12601 initializing all their final variables or not. */
12605 {
12607 {
12608 /* It doesn't. Maybe it calls a constructor that initializes
12609 them. find out. */
12612 continue;
12615 {
12617 nnctor++;
12618 }
12619 else
12620 parse_error_context
12623 }
12624 else
12625 nnctor++;
12626 }
12628 /* Finally we catch final variables that never were initialized */
12631 /* If the field wasn't initialized upon declaration */
12633 /* There wasn't natural ctor in which the field could have been
12634 initialized */
12635 && !nnctor
12636 /* If we never reported a problem with this field */
12638 {
12640 parse_error_context
12644 }
12646 }
12648 /* Return 1 if an assignment to a FINAL is attempted in a non suitable
12649 context. */
12651 static int
12654 {
12665 /* Now the logic. We can modify a final VARIABLE:
12666 1) in finit$, (its declaration was followed by an initialization,)
12667 2) consistently in each natural ctor, if it wasn't initialized in
12668 finit$ or once in <clinit>. In any other cases, an error should be
12669 reported. */
12671 {
12674 }
12677 /* Only if it wasn't given a value upon initialization */
12679 /* If it was never assigned a value in this constructor */
12681 {
12682 /* Turn the locally assigned flag on, it will be checked later
12683 on to point out at discrepancies. */
12688 }
12690 /* Other problems should be reported right away. */
12691 parse_error_context
12696 /* Note that static field can be initialized once and only once. */
12701 }
12703 /* Inline references to java.lang.PRIMTYPE.TYPE when accessed in
12704 read. This is needed to avoid circularities in the implementation
12705 of these fields in libjava. */
12707 static tree
12710 {
12714 {
12721 {
12725 }
12726 }
12728 }
12730 /* 15.25 Assignment operators. */
12732 static tree
12734 tree node;
12735 tree wfl_op1;
12736 tree wfl_op2;
12737 {
12744 /* Can't assign to a (blank) final. */
12750 /* Lhs can be a named variable */
12752 {
12754 }
12755 /* Or Lhs can be a array acccess. Should that be lvalue ? FIXME +
12756 comment on reason why */
12758 {
12761 }
12762 /* Or a field access */
12765 /* Or a function return slot */
12768 /* Otherwise, we might want to try to write into an optimized static
12769 final, this is an of a different nature, reported further on. */
12772 {
12774 {
12775 /* What we should do instead is resetting the all the flags
12776 previously set, exchange lvalue for llvalue and continue. */
12778 return error_mark_node;
12779 }
12780 else
12782 }
12783 else
12784 {
12787 }
12790 /* 5.1 Try the assignment conversion for builtin type. */
12793 /* 5.2 If it failed, try a reference conversion */
12797 /* 15.25.2 If we have a compound assignment, convert RHS into the
12798 type of the LHS */
12802 /* Explicit cast required. This is an error */
12804 {
12807 tree wfl;
12810 /* If the assignment is part of a declaration, we use the WFL of
12811 the declared variable to point out the error and call it a
12812 declaration problem. If the assignment is a genuine =
12813 operator, we call is a operator `=' problem, otherwise we
12814 call it an assignment problem. In both of these last cases,
12815 we use the WFL of the operator to indicate the error. */
12818 {
12821 }
12822 else
12823 {
12829 else
12831 }
12834 parse_error_context
12837 else
12838 parse_error_context (wfl, "Incompatible type for %s. Explicit cast needed to convert `%s' to `%s'",
12842 }
12844 /* Inline read access to java.lang.PRIMTYPE.TYPE */
12849 return error_mark_node;
12851 /* 10.10: Array Store Exception runtime check */
12852 if (!flag_emit_class_files
12853 && !flag_emit_xref
12854 && lvalue_from_array
12856 {
12857 tree check;
12860 /* We need to retrieve the right argument for
12861 _Jv_CheckArrayStore. This is somewhat complicated by bounds
12862 and null pointer checks, both of which wrap the operand in
12863 one layer of COMPOUND_EXPR. */
12866 else
12867 {
12870 /* We can have a SAVE_EXPR here when doing String +=. */
12875 else
12877 }
12879 /* Build the invocation of _Jv_CheckArrayStore */
12885 NULL_TREE);
12888 /* We have to decide on an insertion point */
12890 {
12891 tree t;
12893 {
12897 }
12898 else
12901 }
12903 {
12909 {
12912 }
12914 /* Find the array bound check, hook the original array access. */
12918 /* Make sure the bound check will happen before the store check */
12919 new_compound =
12922 /* Re-assemble the augmented array access. */
12924 }
12925 else
12927 }
12929 /* Final locals can be used as case values in switch
12930 statement. Prepare them for this eventuality. */
12936 )
12937 {
12940 }
12945 return node;
12946 }
12948 /* Check that type SOURCE can be cast into type DEST. If the cast
12949 can't occur at all, return 0 otherwise 1. This function is used to
12950 produce accurate error messages on the reasons why an assignment
12951 failed. */
12953 static tree
12956 {
12961 {
12962 /* `null' may be assigned to any reference type */
12965 /* Try the reference assignment conversion */
12968 /* This is a magic assignment that we process differently */
12971 }
12972 return new_rhs;
12973 }
12975 /* Check that RHS can be converted into LHS_TYPE by the assignment
12976 conversion (5.2), for the cases of RHS being a builtin type. Return
12977 NULL_TREE if the conversion fails or if because RHS isn't of a
12978 builtin type. Return a converted RHS if the conversion is possible. */
12980 static tree
12983 {
12987 /* Handle boolean specially. */
12990 {
12994 }
12996 /* Zero accepted everywhere */
13002 /* 5.1.1 Try Identity Conversion,
13003 5.1.2 Try Widening Primitive Conversion */
13007 /* Try a narrowing primitive conversion (5.1.3):
13008 - expression is a constant expression of type int AND
13009 - variable is byte, short or char AND
13010 - The value of the expression is representable in the type of the
13011 variable */
13015 {
13019 parse_warning_context
13022 /* Reported a warning that will turn into an error further
13023 down, so we don't return */
13024 }
13026 return new_rhs;
13027 }
13029 /* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
13030 conversion (5.1.1) or widening primitive conversion (5.1.2). Return
13031 0 is the conversion test fails. This implements parts the method
13032 invocation convertion (5.3). */
13034 static int
13037 {
13038 /* 5.1.1: This is the identity conversion part. */
13042 /* Reject non primitive types and boolean conversions. */
13046 /* 5.1.2: widening primitive conversion. byte, even if it's smaller
13047 than a char can't be converted into a char. Short can't too, but
13048 the < test below takes care of that */
13052 /* Accept all promoted type here. Note, we can't use <= in the test
13053 below, because we still need to bounce out assignments of short
13054 to char and the likes */
13057 || rhs_type == promoted_short_type_node
13058 || rhs_type == promoted_char_type_node
13062 /* From here, an integral is widened if its precision is smaller
13063 than the precision of the LHS or if the LHS is a floating point
13064 type, or the RHS is a float and the RHS a double. */
13072 }
13074 /* Check that something of SOURCE type can be assigned or cast to
13075 something of DEST type at runtime. Return 1 if the operation is
13076 valid, 0 otherwise. If CAST is set to 1, we're treating the case
13077 were SOURCE is cast into DEST, which borrows a lot of the
13078 assignment check. */
13080 static int
13082 tree source;
13083 tree dest;
13085 {
13086 /* SOURCE or DEST might be null if not from a declared entity. */
13096 /* If source and dest are being compiled from bytecode, they may need to
13097 be loaded. */
13099 {
13102 }
13104 {
13107 }
13109 /* Case where SOURCE is a class type */
13111 {
13117 {
13118 /* If doing a cast and SOURCE is final, the operation is
13119 always correct a compile time (because even if SOURCE
13120 does not implement DEST, a subclass of SOURCE might). */
13123 /* Otherwise, SOURCE must implement DEST */
13125 }
13126 /* DEST is an array, cast permited if SOURCE is of Object type */
13128 }
13130 {
13132 {
13133 /* If not casting, DEST must be the Object type */
13136 /* We're doing a cast. The cast is always valid is class
13137 DEST is not final, otherwise, DEST must implement SOURCE */
13140 else
13142 }
13144 {
13145 /* If doing a cast, then if SOURCE and DEST contain method
13146 with the same signature but different return type, then
13147 this is a (compile time) error */
13149 {
13151 tree source_type;
13152 tree source_sig;
13153 tree source_name;
13156 {
13157 source_sig =
13168 }
13170 }
13171 else
13173 }
13174 else
13175 {
13176 /* Array */
13177 return (cast
13181 }
13182 }
13184 {
13187 /* Can't cast an array to an interface unless the interface is
13188 java.lang.Cloneable or java.io.Serializable. */
13192 else /* Arrays */
13193 {
13197 /* In case of severe errors, they turn out null */
13204 }
13206 }
13208 }
13210 static int
13212 tree source;
13213 tree dest;
13214 {
13231 }
13233 static tree
13235 tree arg;
13236 {
13241 return arg;
13242 }
13244 /* Return a non zero value if SOURCE can be converted into DEST using
13245 the method invocation conversion rule (5.3). */
13246 static int
13249 {
13255 }
13257 /* Build an incomplete binop expression. */
13259 static tree
13264 {
13267 /* Store the location of the operator, for better error report. The
13268 string of the operator will be rebuild based on the OP value. */
13270 return binop;
13271 }
13273 /* Build the string of the operator retained by NODE. If NODE is part
13274 of a compound expression, add an '=' at the end of the string. This
13275 function is called when an error needs to be reported on an
13276 operator. The string is returned as a pointer to a static character
13277 buffer. */
13281 tree node;
13282 {
13283 #define BUILD_OPERATOR_STRING(S) \
13284 { \
13286 return buffer; \
13287 }
13291 {
13319 default:
13322 }
13323 return NULL;
13324 #undef BUILD_OPERATOR_STRING
13325 }
13327 /* Return 1 if VAR_ACCESS1 is equivalent to VAR_ACCESS2. */
13329 static int
13332 {
13341 }
13343 /* Return a non zero value if CODE is one of the operators that can be
13344 used in conjunction with the `=' operator in a compound assignment. */
13346 static int
13349 {
13353 break;
13356 }
13358 /* Reorganize after a fold to get SAVE_EXPR to generate what we want. */
13360 static tree
13362 tree t;
13363 {
13367 return t;
13373 return t;
13375 /* Now the left branch of the binary operator. */
13379 return t;
13384 return t;
13388 /* It's got to be the an equivalent decl */
13390 {
13391 /* Shorten the NOP_EXPR/SAVE_EXPR path. */
13393 /* Substitute the COMPOUND_EXPR by the BINOP_EXPR */
13395 /* Change the right part of the BINOP_EXPR */
13397 }
13399 return t;
13400 }
13402 /* Binary operators (15.16 up to 15.18). We return error_mark_node on
13403 errors but we modify NODE so that it contains the type computed
13404 according to the expression, when it's fixed. Otherwise, we write
13405 error_mark_node as the type. It allows us to further the analysis
13406 of remaining nodes and detects more errors in certain cases. */
13408 static tree
13410 tree node;
13411 tree wfl_op1;
13412 tree wfl_op2;
13413 {
13421 /* If 1, tell the routine that we have to return error_mark_node
13422 after checking for the initialization of the RHS */
13427 /* If either op<n>_type are NULL, this might be early signs of an
13428 error situation, unless it's too early to tell (in case we're
13429 handling a `+', `==', `!=' or `instanceof'.) We want to set op<n>_type
13430 correctly so the error can be later on reported accurately. */
13433 {
13434 tree n;
13436 {
13439 }
13441 {
13444 }
13445 }
13448 {
13449 /* 15.16 Multiplicative operators */
13455 {
13462 break;
13463 }
13465 /* Change the division operator if necessary */
13470 && flag_use_divide_subroutine
13471 && ! flag_emit_class_files
13475 /* This one is more complicated. FLOATs are processed by a
13476 function call to soft_fmod. Duplicate the value of the
13477 COMPOUND_ASSIGN_P flag. */
13479 {
13484 return mod;
13485 }
13486 break;
13488 /* 15.17 Additive Operators */
13491 /* Operation is valid if either one argument is a string
13492 constant, a String object or a StringBuffer crafted for the
13493 purpose of the a previous usage of the String concatenation
13494 operator */
13505 Numeric Types */
13507 {
13514 break;
13515 }
13517 break;
13519 /* 15.18 Shift Operators */
13520 case LSHIFT_EXPR:
13521 case RSHIFT_EXPR:
13522 case URSHIFT_EXPR:
13524 {
13527 else
13528 {
13531 "Incompatible type for `%s'. Explicit cast needed to convert shift distance from `%s' to integral",
13534 else
13539 }
13542 break;
13543 }
13545 /* Unary numeric promotion (5.6.1) is performed on each operand
13546 separatly */
13550 /* The type of the shift expression is the type of the promoted
13551 type of the left-hand operand */
13554 /* Shift int only up to 0x1f and long up to 0x3f */
13558 else
13562 /* The >>> operator is a >> operating on unsigned quantities */
13564 {
13565 tree to_return;
13573 /* Copy the original value of the COMPOUND_ASSIGN_P flag */
13577 return to_return;
13578 }
13579 break;
13581 /* 15.19.1 Type Comparison Operator instaceof */
13582 case INSTANCEOF_EXPR:
13587 return error_mark_node;
13589 /* The first operand must be a reference type or the null type */
13593 /* The second operand must be a reference type */
13595 {
13597 parse_error_context
13601 }
13604 {
13605 /* If the first operand is null, the result is always false */
13607 return boolean_false_node;
13609 {
13612 return node;
13613 }
13614 /* Otherwise we have to invoke instance of to figure it out */
13615 else
13617 }
13618 /* There is no way the expression operand can be an instance of
13619 the type operand. This is a compile time error. */
13620 else
13621 {
13624 parse_error_context
13629 }
13631 break;
13633 /* 15.21 Bitwise and Logical Operators */
13634 case BIT_AND_EXPR:
13635 case BIT_XOR_EXPR:
13636 case BIT_IOR_EXPR:
13638 /* Binary numeric promotion is performed on both operand and the
13639 expression retain that type */
13644 /* The type of the bitwise operator expression is BOOLEAN */
13646 else
13647 {
13654 /* Insert a break here if adding thing before the switch's
13655 break for this case */
13656 }
13657 break;
13659 /* 15.22 Conditional-And Operator */
13660 case TRUTH_ANDIF_EXPR:
13661 /* 15.23 Conditional-Or Operator */
13662 case TRUTH_ORIF_EXPR:
13663 /* Operands must be of BOOLEAN type */
13666 {
13673 break;
13674 }
13675 /* The type of the conditional operators is BOOLEAN */
13677 break;
13679 /* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
13680 case LT_EXPR:
13681 case GT_EXPR:
13682 case LE_EXPR:
13683 case GE_EXPR:
13684 /* The type of each of the operands must be a primitive numeric
13685 type */
13687 {
13694 break;
13695 }
13696 /* Binary numeric promotion is performed on the operands */
13698 /* The type of the relation expression is always BOOLEAN */
13700 break;
13702 /* 15.20 Equality Operator */
13703 case EQ_EXPR:
13704 case NE_EXPR:
13705 /* It's time for us to patch the strings. */
13707 {
13710 }
13712 {
13715 }
13717 /* 15.20.1 Numerical Equality Operators == and != */
13718 /* Binary numeric promotion is performed on the operands */
13722 /* 15.20.2 Boolean Equality Operators == and != */
13727 /* 15.20.3 Reference Equality Operators == and != */
13728 /* Types have to be either references or the null type. If
13729 they're references, it must be possible to convert either
13730 type to the other by casting conversion. */
13738 /* Else we have an error figure what can't be converted into
13739 what and report the error */
13740 else
13741 {
13744 parse_error_context
13752 break;
13753 }
13755 break;
13756 }
13759 return error_mark_node;
13767 return node;
13769 /* fold does not respect side-effect order as required for Java but not C.
13770 * Also, it sometimes create SAVE_EXPRs which are bad when emitting
13771 * bytecode.
13772 */
13776 return node;
13777 }
13779 /* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
13780 zero value, the value of CSTE comes after the valude of STRING */
13782 static tree
13784 tree cste;
13787 {
13794 {
13797 }
13798 else
13799 {
13802 }
13805 }
13807 /* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
13808 new STRING_CST on success, NULL_TREE on failure */
13810 static tree
13814 {
13815 /* Handle two string constants right away */
13820 /* Reasonable integer constant can be treated right away */
13822 {
13836 {
13840 }
13841 else
13845 }
13846 return NULL_TREE;
13847 }
13849 /* Tries to statically concatenate OP1 and OP2 if possible. Either one
13850 has to be a STRING_CST and the other part must be a STRING_CST or a
13851 INTEGRAL constant. Return a new STRING_CST if the operation
13852 succeed, NULL_TREE otherwise.
13854 If the case we want to optimize for space, we might want to return
13855 NULL_TREE for each invocation of this routine. FIXME */
13857 static tree
13860 {
13862 {
13870 /* Walk REST, only if it looks reasonable */
13875 {
13878 return error_mark_node;
13880 }
13882 }
13883 return NULL_TREE;
13884 }
13886 /* Implement the `+' operator. Does static optimization if possible,
13887 otherwise create (if necessary) and append elements to a
13888 StringBuffer. The StringBuffer will be carried around until it is
13889 used for a function call or an assignment. Then toString() will be
13890 called on it to turn it into a String object. */
13892 static tree
13895 {
13896 tree result;
13902 /* Try to do some static optimization */
13904 return result;
13906 /* Discard empty strings on either side of the expression */
13908 {
13911 }
13915 /* If operands are string constant, turn then into object references */
13921 /* If either one of the constant is null and the other non null
13922 operand is a String object, return it. */
13924 return op1;
13926 /* If OP1 isn't already a StringBuffer, create and
13927 initialize a new one */
13929 {
13930 /* Two solutions here:
13931 1) OP1 is a constant string reference, we call new StringBuffer(OP1)
13932 2) OP1 is something else, we call new StringBuffer().append(OP1). */
13935 else
13936 {
13939 }
13940 }
13943 {
13944 /* OP1 is no longer the last node holding a crafted StringBuffer */
13946 /* Create a node for `{new...,xxx}.append (op2)' */
13949 }
13951 /* Mark the last node holding a crafted StringBuffer */
13955 return op1;
13956 }
13958 /* Patch the string node NODE. NODE can be a STRING_CST of a crafted
13959 StringBuffer. If no string were found to be patched, return
13960 NULL. */
13962 static tree
13964 tree node;
13965 {
13967 return error_mark_node;
13971 {
13974 tree ret;
13975 /* Temporary disable forbid the use of `this'. */
13978 /* String concatenation arguments must be evaluated in order too. */
13980 /* Restore it at its previous value */
13982 return ret;
13983 }
13984 return NULL_TREE;
13985 }
13987 /* Build the internal representation of a string constant. */
13989 static tree
13991 tree node;
13992 {
13995 {
13999 }
14002 return node;
14003 }
14005 /* Build an incomplete unary operator expression. */
14007 static tree
14010 tree op1;
14011 {
14013 tree unaryop;
14015 {
14021 }
14025 /* Store the location of the operator, for better error report. The
14026 string of the operator will be rebuild based on the OP value. */
14028 return unaryop;
14029 }
14031 /* Special case for the ++/-- operators, since they require an extra
14032 argument to build, which is set to NULL and patched
14033 later. IS_POST_P is 1 if the operator, 0 otherwise. */
14035 static tree
14038 tree op1;
14040 {
14042 {
14045 };
14049 /* Store the location of the operator, for better error report. The
14050 string of the operator will be rebuild based on the OP value. */
14052 return node;
14053 }
14055 /* Build an incomplete cast operator, based on the use of the
14056 CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
14057 set. java_complete_tree is trained to walk a CONVERT_EXPR even
14058 though its type is already set. */
14060 static tree
14064 {
14067 return node;
14068 }
14070 /* Build an incomplete class reference operator. */
14071 static tree
14074 tree class_name;
14075 {
14078 return node;
14079 }
14081 /* Complete an incomplete class reference operator. */
14082 static tree
14084 tree node;
14085 {
14087 tree ref_type;
14090 return error_mark_node;
14093 {
14095 /* A class referenced by `foo.class' is initialized. */
14099 }
14101 /* If we're emitting class files and we have to deal with non
14102 primitive types, we invoke (and consider generating) the
14103 synthetic static method `class$'. */
14108 }
14110 /* 15.14 Unary operators. We return error_mark_node in case of error,
14111 but preserve the type of NODE if the type is fixed. */
14113 static tree
14115 tree node;
14116 tree wfl_op;
14117 {
14128 {
14129 /* 15.13.2 Postfix Increment Operator ++ */
14130 case POSTINCREMENT_EXPR:
14131 /* 15.13.3 Postfix Increment Operator -- */
14132 case POSTDECREMENT_EXPR:
14133 /* 15.14.1 Prefix Increment Operator ++ */
14134 case PREINCREMENT_EXPR:
14135 /* 15.14.2 Prefix Decrement Operator -- */
14136 case PREDECREMENT_EXPR:
14139 /* We might be trying to change an outer field accessed using
14140 access method. */
14142 {
14143 /* Retrieve the decl of the field we're trying to access. We
14144 do that by first retrieving the function we would call to
14145 access the field. It has been already verified that this
14146 field isn't final */
14149 else
14152 }
14153 /* We really should have a JAVA_ARRAY_EXPR to avoid this */
14161 {
14162 tree lvalue;
14163 /* Before screaming, check that we're not in fact trying to
14164 increment a optimized static final access, in which case
14165 we issue an different error message. */
14173 }
14178 /* From now on, we know that op if a variable and that it has a
14179 valid wfl. We use wfl_op to locate errors related to the
14180 ++/-- operand. */
14182 {
14183 parse_error_context
14188 }
14189 else
14190 {
14191 /* Before the addition, binary numeric promotion is performed on
14192 both operands, if really necessary */
14194 {
14197 }
14198 else
14199 {
14204 }
14206 /* We remember we might be accessing an outer field */
14208 {
14209 /* We re-generate an access to the field */
14213 /* And we patch the original access$() into a write
14214 with plus_op as a rhs */
14216 }
14218 /* And write back into the node. */
14221 /* Convert the overall back into its original type, if
14222 necessary, and return */
14225 else
14227 }
14228 break;
14230 /* 15.14.3 Unary Plus Operator + */
14231 case UNARY_PLUS_EXPR:
14232 /* 15.14.4 Unary Minus Operator - */
14233 case NEGATE_EXPR:
14235 {
14239 }
14240 /* Unary numeric promotion is performed on operand */
14241 else
14242 {
14247 }
14248 break;
14250 /* 15.14.5 Bitwise Complement Operator ~ */
14251 case BIT_NOT_EXPR:
14253 {
14257 }
14258 else
14259 {
14262 }
14263 break;
14265 /* 15.14.6 Logical Complement Operator ! */
14266 case TRUTH_NOT_EXPR:
14268 {
14270 /* But the type is known. We will report an error if further
14271 attempt of a assignment is made with this rhs */
14274 }
14275 else
14277 break;
14279 /* 15.15 Cast Expression */
14280 case CONVERT_EXPR:
14283 {
14284 /* If this cast is part of an assignment, we tell the code
14285 that deals with it not to complain about a mismatch,
14286 because things have been cast, anyways */
14289 }
14290 else
14291 {
14294 return value;
14295 }
14296 break;
14297 }
14300 return error_mark_node;
14302 /* There are cases where node has been replaced by something else
14303 and we don't end up returning here: UNARY_PLUS_EXPR,
14304 CONVERT_EXPR, {POST,PRE}{INCR,DECR}EMENT_EXPR. */
14309 }
14311 /* Generic type resolution that sometimes takes place during node
14312 patching. Returned the resolved type or generate an error
14313 message. Return the resolved type or NULL_TREE. */
14315 static tree
14317 tree type;
14318 {
14320 {
14323 {
14327 return NULL_TREE;
14328 }
14330 }
14331 return type;
14332 }
14333 /* 5.5 Casting Conversion. error_mark_node is returned if an error is
14334 found. Otherwise NODE or something meant to replace it is returned. */
14336 static tree
14338 tree node;
14339 tree wfl_op;
14340 {
14346 /* First resolve OP_TYPE if unresolved */
14348 return error_mark_node;
14350 /* Check on cast that are proven correct at compile time */
14352 {
14353 /* Same type */
14355 return node;
14357 /* float and double type are converted to the original type main
14358 variant and then to the target type. */
14362 /* Try widening/narowwing convertion. Potentially, things need
14363 to be worked out in gcc so we implement the extreme cases
14364 correctly. fold_convert() needs to be fixed. */
14366 }
14368 /* It's also valid to cast a boolean into a boolean */
14370 return node;
14372 /* null can be casted to references */
14376 /* The remaining legal casts involve conversion between reference
14377 types. Check for their compile time correctness. */
14380 {
14382 /* Now, the case can be determined correct at compile time if
14383 OP_TYPE can be converted into CAST_TYPE by assignment
14384 conversion (5.2) */
14387 {
14389 return node;
14390 }
14393 {
14395 return node;
14396 }
14398 /* The cast requires a run-time check */
14403 NULL_TREE);
14404 }
14406 /* Any other casts are proven incorrect at compile time */
14411 return error_mark_node;
14412 }
14414 /* Build a null constant and give it the type TYPE. */
14416 static tree
14418 tree type;
14419 {
14422 return node;
14423 }
14425 /* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
14426 a list of indices. */
14427 static tree
14431 {
14434 return node;
14435 }
14437 /* 15.12 Array Access Expression */
14439 static tree
14441 tree node;
14442 {
14454 /* The array reference must be an array */
14456 {
14457 parse_error_context
14463 }
14465 /* The array index undergoes unary numeric promotion. The promoted
14466 type must be int */
14469 {
14474 else
14480 }
14483 return error_mark_node;
14488 {
14491 }
14492 else
14493 {
14494 /* The save_expr is for correct evaluation order. It would be cleaner
14495 to use force_evaluation_order (see comment there), but that is
14496 difficult when we also have to deal with bounds checking. */
14502 }
14504 return node;
14505 }
14507 /* 15.9 Array Creation Expressions */
14509 static tree
14511 tree type;
14512 tree dims;
14514 {
14515 tree node =
14518 return node;
14519 }
14521 static tree
14523 tree node;
14524 {
14532 /* Dimension types are verified. It's better for the types to be
14533 verified in order. */
14535 {
14539 /* Dim might have been saved during its evaluation */
14542 /* The type of each specified dimension must be an integral type. */
14546 /* Each expression undergoes an unary numeric promotion (5.6.1) and the
14547 promoted type must be int. */
14548 else
14549 {
14553 }
14555 /* Report errors on types here */
14557 {
14558 parse_error_context
14565 }
14568 }
14570 /* Resolve array base type if unresolved */
14575 {
14576 /* We don't want further evaluation of this bogus array creation
14577 operation */
14579 return error_mark_node;
14580 }
14582 /* Set array_type to the actual (promoted) array type of the result. */
14586 {
14588 }
14592 {
14594 array_type
14600 }
14603 /* The node is transformed into a function call. Things are done
14604 differently according to the number of dimensions. If the number
14605 of dimension is equal to 1, then the nature of the base type
14606 (primitive or not) matters. */
14610 /* Can't reuse what's already written in expr.c because it uses the
14611 JVM stack representation. Provide a build_multianewarray. FIXME */
14617 NULL_TREE);
14618 }
14620 /* 10.6 Array initializer. */
14622 /* Build a wfl for array element that don't have one, so we can
14623 pin-point errors. */
14625 static tree
14627 tree node;
14628 {
14632 else
14633 return NULL_TREE;
14634 }
14636 /* Build a NEW_ARRAY_INIT that features a CONSTRUCTOR node. This makes
14637 identification of initialized arrays easier to detect during walk
14638 and expansion. */
14640 static tree
14643 tree values;
14644 {
14648 return to_return;
14649 }
14651 /* Expand a NEW_ARRAY_INIT node. Return error_mark_node if an error
14652 occurred. Otherwise return NODE after having set its type
14653 appropriately. */
14655 static tree
14658 {
14661 HOST_WIDE_INT length;
14666 {
14670 return error_mark_node;
14671 }
14679 {
14682 {
14685 /* When compiling to native code, STRING_CST is converted to
14686 INDIRECT_REF, but still with a TREE_CONSTANT flag. */
14689 }
14690 else
14691 {
14695 }
14699 }
14702 return error_mark_node;
14704 /* Create a new type. We can't reuse the one we have here by
14705 patching its dimension because it originally is of dimension -1
14706 hence reused by gcc. This would prevent triangular arrays. */
14712 return node;
14713 }
14715 /* Verify that one entry of the initializer element list can be
14716 assigned to the array base type. Report 1 if an error occurred, 0
14717 otherwise. */
14719 static int
14722 {
14731 /* patch_string return error_mark_node if arg is error_mark_node */
14739 /* At anytime, try_builtin_assignconv can report a warning on
14740 constant overflow during narrowing. */
14746 /* Check and report errors */
14748 {
14753 parse_error_context
14757 }
14760 {
14763 }
14769 return error_seen;
14770 }
14772 static tree
14775 {
14779 return node;
14780 }
14782 /* 14.15 The return statement. It builds a modify expression that
14783 assigns the returned value to the RESULT_DECL that hold the value
14784 to be returned. */
14786 static tree
14789 tree op;
14790 {
14794 return node;
14795 }
14797 static tree
14799 tree node;
14800 {
14809 /* It's invalid to have a return value within a function that is
14810 declared with the keyword void or that is a constructor */
14814 /* It's invalid to use a return statement in a static block */
14818 /* It's invalid to have a no return value within a function that
14819 isn't declared with the keyword `void' */
14827 {
14837 {
14844 }
14845 else
14849 return error_mark_node;
14850 }
14852 /* If we have a return_exp, build a modify expression and expand
14853 it. Note: at that point, the assignment is declared valid, but we
14854 may want to carry some more hacks */
14856 {
14860 /* If the function returned value and EXP are booleans, EXP has
14861 to be converted into the type of DECL_RESULT, which is integer
14862 (see complete_start_java_method) */
14867 /* `null' can be assigned to a function returning a reference */
14880 {
14883 }
14884 else
14885 return error_mark_node;
14886 }
14889 return node;
14890 }
14892 /* 14.8 The if Statement */
14894 static tree
14898 {
14899 tree node;
14905 return node;
14906 }
14908 static tree
14910 tree node;
14911 {
14917 /* The type of expression must be boolean */
14920 {
14921 parse_error_context
14925 return error_mark_node;
14926 }
14933 return node;
14934 }
14936 /* 14.6 Labeled Statements */
14938 /* Action taken when a lableled statement is parsed. a new
14939 LABELED_BLOCK_EXPR is created. No statement is attached to the
14940 label, yet. LABEL can be NULL_TREE for artificially-generated blocks. */
14942 static tree
14945 tree label;
14946 {
14947 tree label_name ;
14951 else
14952 {
14954 /* Issue an error if we try to reuse a label that was previously
14955 declared */
14957 {
14967 java_error_count--;
14968 }
14969 }
14975 return node;
14976 }
14978 /* A labeled statement LBE is attached a statement. */
14980 static tree
14983 tree statement;
14984 {
14985 /* In anyways, tie the loop to its statement */
14987 pop_labeled_block ();
14988 POP_LABELED_BLOCK ();
14989 return lbe;
14990 }
14992 /* 14.10, 14.11, 14.12 Loop Statements */
14994 /* Create an empty LOOP_EXPR and make it the last in the nested loop
14995 list. */
14997 static tree
14999 tree loop_body;
15000 {
15004 return loop;
15005 }
15007 /* Create a loop body according to the following structure:
15008 COMPOUND_EXPR
15009 COMPOUND_EXPR (loop main body)
15010 EXIT_EXPR (this order is for while/for loops.
15011 LABELED_BLOCK_EXPR the order is reversed for do loops)
15012 LABEL_DECL (a continue occuring here branches at the
15013 BODY end of this labeled block)
15014 INCREMENT (if any)
15016 REVERSED, if non zero, tells that the loop condition expr comes
15017 after the body, like in the do-while loop.
15019 To obtain a loop, the loop body structure described above is
15020 encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
15022 LABELED_BLOCK_EXPR
15023 LABEL_DECL (use this label to exit the loop)
15024 LOOP_EXPR
15025 <structure described above> */
15027 static tree
15030 tree condition;
15032 {
15043 return
15046 }
15048 /* Install CONDITION (if any) and loop BODY (using REVERSED to tell
15049 their order) on the current loop. Unlink the current loop from the
15050 loop list. */
15052 static tree
15057 {
15061 {
15063 /* We wrapped the EXIT_EXPR around a WFL so we can debug it.
15064 The real EXIT_EXPR is one operand further. */
15066 /* This one is for accurate error reports */
15069 }
15071 POP_LOOP ();
15072 return to_return;
15073 }
15075 /* Tailored version of finish_loop_body for FOR loops, when FOR
15076 loops feature the condition part */
15078 static tree
15082 {
15083 /* Put the condition and the loop body in place */
15085 /* LOOP is the current loop which has been now popped of the loop
15086 stack. Install the update block */
15088 return loop;
15089 }
15091 /* Try to find the loop a block might be related to. This comprises
15092 the case where the LOOP_EXPR is found as the second operand of a
15093 COMPOUND_EXPR, because the loop happens to have an initialization
15094 part, then expressed as the first operand of the COMPOUND_EXPR. If
15095 the search finds something, 1 is returned. Otherwise, 0 is
15096 returned. The search is assumed to start from a
15097 LABELED_BLOCK_EXPR's block. */
15099 static tree
15101 tree statement;
15102 {
15104 return statement;
15108 else
15109 return NULL_TREE;
15117 }
15119 /* Return 1 if LOOP can be found in the labeled block BLOCK. 0 is
15120 returned otherwise. */
15122 static int
15125 {
15136 }
15138 /* If the loop isn't surrounded by a labeled statement, create one and
15139 insert LOOP as its body. */
15141 static tree
15143 tree loop;
15144 {
15145 tree loop_label;
15149 return loop;
15152 /* LOOP is an EXPR node, so it should have a valid EXPR_WFL_LINECOL
15153 that LOOP_LABEL could enquire about, for a better accuracy. FIXME */
15156 return loop_label;
15157 }
15159 /* 14.13, 14.14: break and continue Statements */
15161 /* Build a break or a continue statement. a null NAME indicates an
15162 unlabeled break/continue statement. */
15164 static tree
15167 tree name;
15168 {
15172 {
15175 /* Null means that we don't have a target for this named
15176 break/continue. In this case, we make the target to be the
15177 label name, so that the error can be reported accuratly in
15178 patch_bc_statement. */
15180 }
15181 /* Unlabeled break/continue will be handled during the
15182 break/continue patch operation */
15183 break_continue
15190 return break_continue;
15191 }
15193 /* Verification of a break/continue statement. */
15195 static tree
15197 tree node;
15198 {
15203 /* Having an identifier here means that the target is unknown. */
15205 {
15208 return error_mark_node;
15209 }
15211 {
15212 /* It's a continue statement. */
15214 {
15216 {
15220 else
15221 parse_error_context
15224 return error_mark_node;
15225 }
15230 {
15232 break;
15233 }
15234 }
15235 }
15237 {
15239 {
15241 {
15244 return error_mark_node;
15245 }
15249 {
15251 break;
15252 }
15253 }
15254 }
15259 /* Our break/continue don't return values. */
15261 /* Encapsulate the break within a compound statement so that it's
15262 expanded all the times by expand_expr (and not clobbered
15263 sometimes, like after a if statement) */
15266 return node;
15267 }
15269 /* Process the exit expression belonging to a loop. Its type must be
15270 boolean. */
15272 static tree
15274 tree node;
15275 {
15280 /* The type of expression must be boolean */
15282 {
15283 parse_error_context
15287 return error_mark_node;
15288 }
15289 /* Now we know things are allright, invert the condition, fold and
15290 return */
15303 return node;
15304 }
15306 /* 14.9 Switch statement */
15308 static tree
15310 tree node;
15311 {
15314 /* Complete the switch expression */
15317 /* The type of the switch expression must be char, byte, short or
15318 int */
15320 {
15325 /* This is what java_complete_tree will check */
15327 return error_mark_node;
15328 }
15332 /* Ready to return */
15334 {
15336 return error_mark_node;
15337 }
15343 return node;
15344 }
15346 /* 14.18 The try/catch statements */
15348 /* Encapsulate TRY_STMTS' in a try catch sequence. The catch clause
15349 catches TYPE and executes CATCH_STMTS. */
15351 static tree
15355 {
15358 /* First build a try block */
15361 /* Build a catch block: we need a catch clause parameter */
15364 /* And a block */
15367 /* Initialize the variable and store in the block */
15372 /* Add the catch statements */
15375 /* Now we can build a CATCH_EXPR */
15379 }
15381 static tree
15385 {
15388 return node;
15389 }
15391 static tree
15395 {
15398 return node;
15399 }
15401 static tree
15403 tree node;
15404 {
15407 /* Exception handlers are considered in left to right order */
15411 /* Check catch clauses, if any. Every time we find an error, we try
15412 to process the next catch clause. We process the catch clause before
15413 the try block so that when processing the try block we can check thrown
15414 exceptions againts the caught type list. */
15416 {
15421 /* At this point, the structure of the catch clause is
15422 CATCH_EXPR (catch node)
15423 BLOCK (with the decl of the parameter)
15424 COMPOUND_EXPR
15425 MODIFY_EXPR (assignment of the catch parameter)
15426 BLOCK (catch clause block)
15427 */
15432 /* Catch clauses can't have more than one parameter declared,
15433 but it's already enforced by the grammar. Make sure that the
15434 only parameter of the clause statement in of class Throwable
15435 or a subclass of Throwable, but that was done earlier. The
15436 catch clause parameter type has also been resolved. */
15438 /* Just make sure that the catch clause parameter type inherits
15439 from java.lang.Throwable */
15441 {
15444 "Can't catch class `%s'. Catch clause parameter type must be a subclass of class `java.lang.Throwable'",
15447 continue;
15448 }
15450 /* Partial check for unreachable catch statement: The catch
15451 clause is reachable iff is no earlier catch block A in
15452 the try statement such that the type of the catch
15453 clause's parameter is the same as or a subclass of the
15454 type of A's parameter */
15458 {
15464 {
15466 parse_error_context
15471 break;
15472 }
15473 }
15474 /* Complete the catch clause block */
15477 {
15479 continue;
15480 }
15486 continue;
15488 /* Things to do here: the exception must be thrown */
15490 /* Link this type to the caught type list */
15492 }
15499 POP_EXCEPTIONS ();
15501 /* Verification ends here */
15503 return error_mark_node;
15508 return node;
15509 }
15511 /* 14.17 The synchronized Statement */
15513 static tree
15516 {
15523 {
15525 return expr;
15526 }
15528 /* We might be trying to synchronize on a STRING_CST */
15532 /* The TYPE of expr must be a reference type */
15534 {
15536 parse_error_context (wfl_operator, "Incompatible type for `synchronized'. Can't convert `%s' to `java.lang.Object'",
15538 return error_mark_node;
15539 }
15542 {
15546 return node;
15547 }
15549 /* Generate a try-finally for the synchronized statement, except
15550 that the handler that catches all throw exception calls
15551 _Jv_MonitorExit and then rethrow the exception.
15552 The synchronized statement is then implemented as:
15553 TRY
15554 {
15555 _Jv_MonitorEnter (expression)
15556 synchronized_block
15557 _Jv_MonitorExit (expression)
15558 }
15559 CATCH_ALL
15560 {
15561 e = _Jv_exception_info ();
15562 _Jv_MonitorExit (expression)
15563 Throw (e);
15564 } */
15579 block));
15583 }
15585 /* 14.16 The throw Statement */
15587 static tree
15590 {
15595 /* Thrown expression must be assignable to java.lang.Throwable */
15597 {
15602 /* If the thrown expression was a reference, we further the
15603 compile-time check. */
15605 return error_mark_node;
15606 }
15608 /* At least one of the following must be true */
15610 /* The type of the throw expression is a not checked exception,
15611 i.e. is a unchecked expression. */
15615 /* An instance can't throw a checked exception unless that exception
15616 is explicitely declared in the `throws' clause of each
15617 constructor. This doesn't apply to anonymous classes, since they
15618 don't have declared constructors. */
15619 if (!unchecked_ok
15622 {
15623 tree current;
15628 {
15629 parse_error_context (wfl_operator, "Checked exception `%s' can't be thrown in instance initializer (not all declared constructor are declaring it in their `throws' clause)",
15631 return error_mark_node;
15632 }
15633 }
15635 /* Throw is contained in a try statement and at least one catch
15636 clause can receive the thrown expression or the current method is
15637 declared to throw such an exception. Or, the throw statement is
15638 contained in a method or constructor declaration and the type of
15639 the Expression is assignable to at least one type listed in the
15640 throws clause the declaration. */
15644 {
15645 /* If there is a surrounding try block that has no matching
15646 clatch clause, report it first. A surrounding try block exits
15647 only if there is something after the list of checked
15648 exception thrown by the current function (if any). */
15650 parse_error_context (wfl_operator, "Checked exception `%s' can't be caught by any of the catch clause(s) of the surrounding `try' block",
15652 /* If we have no surrounding try statement and the method doesn't have
15653 any throws, report it now. FIXME */
15655 /* We report that the exception can't be throw from a try block
15656 in all circumstances but when the `throw' is inside a static
15657 block. */
15660 {
15665 else
15669 }
15670 /* Otherwise, the current method doesn't have the appropriate
15671 throws declaration */
15672 else
15673 parse_error_context (wfl_operator, "Checked exception `%s' doesn't match any of current method's `throws' declaration(s)",
15675 return error_mark_node;
15676 }
15681 /* If doing xrefs, keep the location where the `throw' was seen. */
15684 return node;
15685 }
15687 /* Check that exception said to be thrown by method DECL can be
15688 effectively caught from where DECL is invoked. */
15690 static void
15693 tree decl;
15694 {
15695 tree throws;
15696 /* For all the unchecked exceptions thrown by DECL */
15700 {
15701 #if 1
15702 /* Temporary hack to suppresses errors about cloning arrays. FIXME */
15704 continue;
15705 #endif
15708 parse_error_context
15711 else
15712 {
15713 parse_error_context
15714 (wfl_operator, "Exception `%s' must be caught, or it must be declared in the `throws' clause of `%s'",
15719 }
15720 }
15721 }
15723 /* Return 1 if checked EXCEPTION is caught at the current nesting level of
15724 try-catch blocks, OR is listed in the `throws' clause of the
15725 current method. */
15727 static int
15729 tree exception;
15730 {
15733 /* First, all the nested try-catch-finally at that stage. The
15734 last element contains `throws' clause exceptions, if any. */
15738 {
15739 tree caught;
15744 }
15746 }
15748 static void
15750 tree mdecl;
15751 {
15756 {
15759 {
15762 }
15764 }
15765 /* List is inverted here, but it doesn't matter */
15767 }
15769 /* This function goes over all of CLASS_TYPE ctors and checks whether
15770 each of them features at least one unchecked exception in its
15771 `throws' clause. If it's the case, it returns `true', `false'
15772 otherwise. */
15774 static bool
15776 tree class_type;
15777 {
15778 tree current;
15782 {
15785 {
15786 tree throws;
15791 }
15792 /* We return false as we found one ctor that is unfit. */
15794 return false;
15795 }
15796 /* All ctors feature at least one unchecked exception in their
15797 `throws' clause. */
15798 return true;
15799 }
15801 /* 15.24 Conditional Operator ?: */
15803 static tree
15806 {
15814 /* Operands of ?: might be StringBuffers crafted as a result of a
15815 string concatenation. Obtain a descent operand here. */
15824 /* The first expression must be a boolean */
15826 {
15832 }
15834 /* Second and third can be numeric, boolean (i.e. primitive),
15835 references or null. Anything else results in an error */
15842 /* Determine the type of the conditional expression. Same types are
15843 easy to deal with */
15847 /* There are different rules for numeric types */
15849 {
15850 /* if byte/short found, the resulting type is short */
15855 /* If t1 is a constant int and t2 is of type byte, short or char
15856 and t1's value fits in t2, then the resulting type is t2 */
15861 /* If t2 is a constant int and t1 is of type byte, short or char
15862 and t2's value fits in t1, then the resulting type is t1 */
15867 /* Otherwise, binary numeric promotion is applied and the
15868 resulting type is the promoted type of operand 1 and 2 */
15869 else
15873 }
15875 /* Cases of a reference and a null type */
15882 /* Last case: different reference types. If a type can be converted
15883 into the other one by assignment conversion, the latter
15884 determines the type of the expression */
15891 /* If we don't have any resulting type, we're in trouble */
15893 {
15901 }
15904 {
15906 return error_mark_node;
15907 }
15912 return node;
15913 }
15915 /* Wrap EXPR with code to initialize DECL's class, if appropriate. */
15917 static tree
15920 {
15923 return expr;
15927 {
15932 return expr;
15933 }
15936 }
15938 /* Try to constant fold NODE.
15939 If NODE is not a constant expression, return NULL_EXPR.
15940 CONTEXT is a static final VAR_DECL whose initializer we are folding. */
15942 static tree
15944 tree node;
15945 tree context;
15946 {
15951 {
15952 case STRING_CST:
15953 case INTEGER_CST:
15954 case REAL_CST:
15955 return node;
15957 case PLUS_EXPR:
15958 case MINUS_EXPR:
15959 case MULT_EXPR:
15960 case TRUNC_MOD_EXPR:
15961 case RDIV_EXPR:
15962 case LSHIFT_EXPR:
15963 case RSHIFT_EXPR:
15964 case URSHIFT_EXPR:
15965 case BIT_AND_EXPR:
15966 case BIT_XOR_EXPR:
15967 case BIT_IOR_EXPR:
15968 case TRUTH_ANDIF_EXPR:
15969 case TRUTH_ORIF_EXPR:
15970 case EQ_EXPR:
15971 case NE_EXPR:
15972 case GT_EXPR:
15973 case GE_EXPR:
15974 case LT_EXPR:
15975 case LE_EXPR:
15980 return NULL_TREE;
15984 return NULL_TREE;
15988 case UNARY_PLUS_EXPR:
15989 case NEGATE_EXPR:
15990 case TRUTH_NOT_EXPR:
15991 case BIT_NOT_EXPR:
15992 case CONVERT_EXPR:
15996 return NULL_TREE;
15999 break;
16001 case COND_EXPR:
16004 return NULL_TREE;
16008 return NULL_TREE;
16012 return NULL_TREE;
16017 case VAR_DECL:
16018 case FIELD_DECL:
16021 return NULL_TREE;
16023 /* Guard against infinite recursion. */
16029 return val;
16031 case EXPR_WITH_FILE_LOCATION:
16032 /* Compare java_complete_tree and resolve_expression_name. */
16035 {
16037 tree decl;
16039 return NULL_TREE;
16041 {
16045 return NULL_TREE;
16047 }
16048 else
16049 {
16050 /* Wait until the USE_COMPONENT_REF re-write. FIXME. */
16055 return NULL_TREE;
16056 }
16057 }
16058 else
16059 {
16063 return NULL_TREE;
16065 return val;
16066 }
16068 #ifdef USE_COMPONENT_REF
16069 case IDENTIFIER:
16070 case COMPONENT_REF:
16071 ?;
16072 #endif
16074 default:
16075 return NULL_TREE;
16076 }
16077 }
16079 #ifdef USE_COMPONENT_REF
16080 /* Context is 'T' for TypeName, 'P' for PackageName,
16081 'M' for MethodName, 'E' for ExpressionName, and 'A' for AmbiguousName. */
16083 tree
16085 tree name;
16087 {
16088 }
16090 tree
16092 tree name;
16094 {
16095 }
16096 #endif
16098 /* Mark P, which is really a `struct parser_ctxt **' for GC. */
16100 static void
16103 {
16108 return;
16110 #ifndef JC1_LITE
16130 }
16132 void
16133 init_src_parse ()
16134 {
16135 /* Register roots with the garbage collector. */
16137 }
16139 \f
16141 /* This section deals with the functions that are called when tables
16142 recording class initialization information are traversed. */
16144 /* Attach to PTR (a block) the declaration found in ENTRY. */
16146 static bool
16149 PTR ptr;
16150 {
16156 return true;
16157 }
16159 /* This function is called for each statement calling a static
16160 function. ENTRY is a TREE_LIST whose PURPOSE is the called
16161 function and VALUE is a compound whose second operand can be
16162 patched with static class initialization flag assignments. */
16164 static bool
16167 PTR info ATTRIBUTE_UNUSED;
16168 {
16174 /* For each class definitely initialized in CALLED_METHOD, fill
16175 ASSIGNMENT_COMPOUND with assignment to the class initialization flag. */
16182 return true;
16183 }
16185 /* This function is called for each classes that is known definitely
16186 assigned when a given static method was called. This function
16187 augments a compound expression (INFO) storing all assignment to
16188 initialized static class flags if a flag already existed, otherwise
16189 a new one is created. */
16191 static bool
16194 PTR info;
16195 {
16203 /* If we haven't found a flag and we're dealing with self registered
16204 with current_function_decl, then don't do anything. Self is
16205 always added as definitely initialized but this information is
16206 valid only if used outside the current function. */
16208 {
16213 else
16214 return true;
16215 }
16217 /* If we don't have a variable, create one and install it. */
16219 {
16220 tree block;
16228 /* The trick is to find the right context for it. */
16233 }
16234 else
16237 /* Now simply augment the compound that holds all the assignments
16238 pertaining to this method invocation. */
16244 return true;
16245 }