1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
6359
6360
6361
6362
6363
6364
6365
6366
6367
6368
6369
6370
6371
6372
6373
6374
6375
6376
6377
6378
6379
6380
6381
6382
6383
6384
6385
6386
6387
6388
6389
6390
6391
6392
6393
6394
6395
6396
6397
6398
6399
6400
6401
6402
6403
6404
6405
6406
6407
6408
6409
6410
6411
6412
6413
6414
6415
6416
6417
6418
6419
6420
6421
6422
6423
6424
6425
6426
6427
6428
6429
6430
6431
6432
6433
6434
6435
6436
6437
6438
6439
6440
6441
6442
6443
6444
6445
6446
6447
6448
6449
6450
6451
6452
6453
6454
6455
6456
6457
6458
6459
6460
6461
6462
6463
6464
6465
6466
6467
6468
6469
6470
6471
6472
6473
6474
6475
6476
6477
6478
6479
6480
6481
6482
6483
6484
6485
6486
6487
6488
6489
6490
6491
6492
6493
6494
6495
6496
6497
6498
6499
6500
6501
6502
6503
6504
6505
6506
6507
6508
6509
6510
6511
6512
6513
6514
6515
6516
6517
6518
6519
6520
6521
6522
6523
6524
6525
6526
6527
6528
6529
6530
6531
6532
6533
6534
6535
6536
6537
6538
6539
6540
6541
6542
6543
6544
6545
6546
6547
6548
6549
6550
6551
6552
6553
6554
6555
6556
6557
6558
6559
6560
6561
6562
6563
6564
6565
6566
6567
6568
6569
6570
6571
6572
6573
6574
6575
6576
6577
6578
6579
6580
6581
6582
6583
6584
6585
6586
6587
6588
6589
6590
6591
6592
6593
6594
6595
6596
6597
6598
6599
6600
6601
6602
6603
6604
6605
6606
6607
6608
6609
6610
6611
6612
6613
6614
6615
6616
6617
6618
6619
6620
6621
6622
6623
6624
6625
6626
6627
6628
6629
6630
6631
6632
6633
6634
6635
6636
6637
6638
6639
6640
6641
6642
6643
6644
6645
6646
6647
6648
6649
6650
6651
6652
6653
6654
6655
6656
6657
6658
6659
6660
6661
6662
6663
6664
6665
6666
6667
6668
6669
6670
6671
6672
6673
6674
6675
6676
6677
6678
6679
6680
6681
6682
6683
6684
6685
6686
6687
6688
6689
6690
6691
6692
6693
6694
6695
6696
6697
6698
6699
6700
6701
6702
6703
6704
6705
6706
6707
6708
6709
6710
6711
6712
6713
6714
6715
6716
6717
6718
6719
6720
6721
6722
6723
6724
6725
6726
6727
6728
6729
6730
6731
6732
6733
6734
6735
6736
6737
6738
6739
6740
6741
6742
6743
6744
6745
6746
6747
6748
6749
6750
6751
6752
6753
6754
6755
6756
6757
6758
6759
6760
6761
6762
6763
6764
6765
6766
6767
6768
6769
6770
6771
6772
6773
6774
6775
6776
6777
6778
6779
6780
6781
6782
6783
6784
6785
6786
6787
6788
6789
6790
6791
6792
6793
6794
6795
6796
6797
6798
6799
6800
6801
6802
6803
6804
6805
6806
6807
6808
6809
6810
6811
6812
6813
6814
6815
6816
6817
6818
6819
6820
6821
6822
6823
6824
6825
6826
6827
6828
6829
6830
6831
6832
6833
6834
6835
6836
6837
6838
6839
6840
6841
6842
6843
6844
6845
6846
6847
6848
6849
6850
6851
6852
6853
6854
6855
6856
6857
6858
6859
6860
6861
6862
6863
6864
6865
6866
6867
6868
6869
6870
6871
6872
6873
6874
6875
6876
6877
6878
6879
6880
6881
6882
6883
6884
6885
6886
6887
6888
6889
6890
6891
6892
6893
6894
6895
6896
6897
6898
6899
6900
6901
6902
6903
6904
6905
6906
6907
6908
6909
6910
6911
6912
6913
6914
6915
6916
6917
6918
6919
6920
6921
6922
6923
6924
6925
6926
6927
6928
6929
6930
6931
6932
6933
6934
6935
6936
6937
6938
6939
6940
6941
6942
6943
6944
6945
6946
6947
6948
6949
6950
6951
6952
6953
6954
6955
6956
6957
6958
6959
6960
6961
6962
6963
6964
6965
6966
6967
6968
6969
6970
6971
6972
6973
6974
6975
6976
6977
6978
6979
6980
6981
6982
6983
6984
6985
6986
6987
6988
6989
6990
6991
6992
6993
6994
6995
6996
6997
6998
6999
7000
7001
7002
7003
7004
7005
7006
7007
7008
7009
7010
7011
7012
7013
7014
7015
7016
7017
7018
7019
7020
7021
7022
7023
7024
7025
7026
7027
7028
7029
7030
7031
7032
7033
7034
7035
7036
7037
7038
7039
7040
7041
7042
7043
7044
7045
7046
7047
7048
7049
7050
7051
7052
7053
7054
7055
7056
7057
7058
7059
7060
7061
7062
7063
7064
7065
7066
7067
7068
7069
7070
7071
7072
7073
7074
7075
7076
7077
7078
7079
7080
7081
7082
7083
7084
7085
7086
7087
7088
7089
7090
7091
7092
7093
7094
7095
7096
7097
7098
7099
7100
7101
7102
7103
7104
7105
7106
7107
7108
7109
7110
7111
7112
7113
7114
7115
7116
7117
7118
7119
7120
7121
7122
7123
7124
7125
7126
7127
7128
7129
7130
7131
7132
7133
7134
7135
7136
7137
7138
7139
7140
7141
7142
7143
7144
7145
7146
7147
7148
7149
7150
7151
7152
7153
7154
7155
7156
7157
7158
7159
7160
7161
7162
7163
7164
7165
7166
7167
7168
7169
7170
7171
7172
7173
7174
7175
7176
7177
7178
7179
7180
7181
7182
7183
7184
7185
7186
7187
7188
7189
7190
7191
7192
7193
7194
7195
7196
7197
7198
7199
7200
7201
7202
7203
7204
7205
7206
7207
7208
7209
7210
7211
7212
7213
7214
7215
7216
7217
7218
7219
7220
7221
7222
7223
7224
7225
7226
7227
7228
7229
7230
7231
7232
7233
7234
7235
7236
7237
7238
7239
7240
7241
7242
7243
7244
7245
7246
7247
7248
7249
7250
7251
7252
7253
7254
7255
7256
7257
7258
7259
7260
7261
7262
7263
7264
7265
7266
7267
7268
7269
7270
7271
7272
7273
7274
7275
7276
7277
7278
7279
7280
7281
7282
7283
7284
7285
7286
7287
7288
7289
7290
7291
7292
7293
7294
7295
7296
7297
7298
7299
7300
7301
7302
7303
7304
7305
7306
7307
7308
7309
7310
7311
7312
7313
7314
7315
7316
7317
7318
7319
7320
7321
7322
7323
7324
7325
7326
7327
7328
7329
7330
7331
7332
7333
7334
7335
7336
7337
7338
7339
7340
7341
7342
7343
7344
7345
7346
7347
7348
7349
7350
7351
7352
7353
7354
7355
7356
7357
7358
7359
7360
7361
7362
7363
7364
7365
7366
7367
7368
7369
7370
7371
7372
7373
7374
7375
7376
7377
7378
7379
7380
7381
7382
7383
7384
7385
7386
7387
7388
7389
7390
7391
7392
7393
7394
7395
7396
7397
7398
7399
7400
7401
7402
7403
7404
7405
7406
7407
7408
7409
7410
7411
7412
7413
7414
7415
7416
7417
7418
7419
7420
7421
7422
7423
7424
7425
7426
7427
7428
7429
7430
7431
7432
7433
7434
7435
7436
7437
7438
7439
7440
7441
7442
7443
7444
7445
7446
7447
7448
7449
7450
7451
7452
7453
7454
7455
7456
7457
7458
7459
7460
7461
7462
7463
7464
7465
7466
7467
7468
7469
7470
7471
7472
7473
7474
7475
7476
7477
7478
7479
7480
7481
7482
7483
7484
7485
7486
7487
7488
7489
7490
7491
7492
7493
7494
7495
7496
7497
7498
7499
7500
7501
7502
7503
7504
7505
7506
7507
7508
7509
7510
7511
7512
7513
7514
7515
7516
7517
7518
7519
7520
7521
7522
7523
7524
7525
7526
7527
7528
7529
7530
7531
7532
7533
7534
7535
7536
7537
7538
7539
7540
7541
7542
7543
7544
7545
7546
7547
7548
7549
7550
7551
7552
7553
7554
7555
7556
7557
7558
7559
7560
7561
7562
7563
7564
7565
7566
7567
7568
7569
7570
7571
7572
7573
7574
7575
7576
7577
7578
7579
7580
7581
7582
7583
7584
7585
7586
7587
7588
7589
7590
7591
7592
7593
7594
7595
7596
7597
7598
7599
7600
7601
7602
7603
7604
7605
7606
7607
7608
7609
7610
7611
7612
7613
7614
7615
7616
7617
7618
7619
7620
7621
7622
7623
7624
7625
7626
7627
7628
7629
7630
7631
7632
7633
7634
7635
7636
7637
7638
7639
7640
7641
7642
7643
7644
7645
7646
7647
7648
7649
7650
7651
7652
7653
7654
7655
7656
7657
7658
7659
7660
7661
7662
7663
7664
7665
7666
7667
7668
7669
7670
7671
7672
7673
7674
7675
7676
7677
7678
7679
7680
7681
7682
7683
7684
7685
7686
7687
7688
7689
7690
7691
7692
7693
7694
7695
7696
7697
7698
7699
7700
7701
7702
7703
7704
7705
7706
7707
7708
7709
7710
7711
7712
7713
7714
7715
7716
7717
7718
7719
7720
7721
7722
7723
7724
7725
7726
7727
7728
7729
7730
7731
7732
7733
7734
7735
7736
7737
7738
7739
7740
7741
7742
7743
7744
7745
7746
7747
7748
7749
7750
7751
7752
7753
7754
7755
7756
7757
7758
7759
7760
7761
7762
7763
7764
7765
7766
7767
7768
7769
7770
7771
7772
7773
7774
7775
7776
7777
7778
7779
7780
7781
7782
7783
7784
7785
7786
7787
7788
7789
7790
7791
7792
7793
7794
7795
7796
7797
7798
7799
7800
7801
7802
7803
7804
7805
7806
7807
7808
7809
7810
7811
7812
7813
7814
7815
7816
7817
7818
7819
7820
7821
7822
7823
7824
7825
7826
7827
7828
7829
7830
7831
7832
7833
7834
7835
7836
7837
7838
7839
7840
7841
7842
7843
7844
7845
7846
7847
7848
7849
7850
7851
7852
7853
7854
7855
7856
7857
7858
7859
7860
7861
7862
7863
7864
7865
7866
7867
7868
7869
7870
7871
7872
7873
7874
7875
7876
7877
7878
7879
7880
7881
7882
7883
7884
7885
7886
7887
7888
7889
7890
7891
7892
7893
7894
7895
7896
7897
7898
7899
7900
7901
7902
7903
7904
7905
7906
7907
7908
7909
7910
7911
7912
7913
7914
7915
7916
7917
7918
7919
7920
7921
7922
7923
7924
7925
7926
7927
7928
7929
7930
7931
7932
7933
7934
7935
7936
7937
7938
7939
7940
7941
7942
7943
7944
7945
7946
7947
7948
7949
7950
7951
7952
7953
7954
7955
7956
7957
7958
7959
7960
7961
7962
7963
7964
7965
7966
7967
7968
7969
7970
7971
7972
7973
7974
7975
7976
7977
7978
7979
7980
7981
7982
7983
7984
7985
7986
7987
7988
7989
7990
7991
7992
7993
7994
7995
7996
7997
7998
7999
8000
8001
8002
8003
8004
8005
8006
8007
8008
8009
8010
8011
8012
8013
8014
8015
8016
8017
8018
8019
8020
8021
8022
8023
8024
8025
8026
8027
8028
8029
8030
8031
8032
8033
8034
8035
8036
8037
8038
8039
8040
8041
8042
8043
8044
8045
8046
8047
8048
8049
8050
8051
8052
8053
8054
8055
8056
8057
8058
8059
8060
8061
8062
8063
8064
8065
8066
8067
8068
8069
8070
8071
8072
8073
8074
8075
8076
8077
8078
8079
8080
8081
8082
8083
8084
8085
8086
8087
8088
8089
8090
8091
8092
8093
8094
8095
8096
8097
8098
8099
8100
8101
8102
8103
8104
8105
8106
8107
8108
8109
8110
8111
8112
8113
8114
8115
8116
8117
8118
8119
8120
8121
8122
8123
8124
8125
8126
8127
8128
8129
8130
8131
8132
8133
8134
8135
8136
8137
8138
8139
8140
8141
8142
8143
8144
8145
8146
8147
8148
8149
8150
8151
8152
8153
8154
8155
8156
8157
8158
8159
8160
8161
8162
8163
8164
8165
8166
8167
8168
8169
8170
8171
8172
8173
8174
8175
8176
8177
8178
8179
8180
8181
8182
8183
8184
8185
8186
8187
8188
8189
8190
8191
8192
8193
8194
8195
8196
8197
8198
8199
8200
8201
8202
8203
8204
8205
8206
8207
8208
8209
8210
8211
8212
8213
8214
8215
8216
8217
8218
8219
8220
8221
8222
8223
8224
8225
8226
8227
8228
8229
8230
8231
8232
8233
8234
8235
8236
8237
8238
8239
8240
8241
8242
8243
8244
8245
8246
8247
8248
8249
8250
8251
8252
8253
8254
8255
8256
8257
8258
8259
8260
8261
8262
8263
8264
8265
8266
8267
8268
8269
8270
8271
8272
8273
8274
8275
8276
8277
8278
8279
8280
8281
8282
8283
8284
8285
8286
8287
8288
8289
8290
8291
8292
8293
8294
8295
8296
8297
8298
8299
8300
8301
8302
8303
8304
8305
8306
8307
8308
8309
8310
8311
8312
8313
8314
8315
8316
8317
8318
8319
8320
8321
8322
8323
8324
8325
8326
8327
8328
8329
8330
8331
8332
8333
8334
8335
8336
8337
8338
8339
8340
8341
8342
8343
8344
8345
8346
8347
8348
8349
8350
8351
8352
8353
8354
8355
8356
8357
8358
8359
8360
8361
8362
8363
8364
8365
8366
8367
8368
8369
8370
8371
8372
8373
8374
8375
8376
8377
8378
8379
8380
8381
8382
8383
8384
8385
8386
8387
8388
8389
8390
8391
8392
8393
8394
8395
8396
8397
8398
8399
8400
8401
8402
8403
8404
8405
8406
8407
8408
8409
8410
8411
8412
8413
8414
8415
8416
8417
8418
8419
8420
8421
8422
8423
8424
8425
8426
8427
8428
8429
8430
8431
8432
8433
8434
8435
8436
8437
8438
8439
8440
8441
8442
8443
8444
8445
8446
8447
8448
8449
8450
8451
8452
8453
8454
8455
8456
8457
8458
8459
8460
8461
8462
8463
8464
8465
8466
8467
8468
8469
8470
8471
8472
8473
8474
8475
8476
8477
8478
8479
8480
8481
8482
8483
8484
8485
8486
8487
8488
8489
8490
8491
8492
8493
8494
8495
8496
8497
8498
8499
8500
8501
8502
8503
8504
8505
8506
8507
8508
8509
8510
8511
8512
8513
8514
8515
8516
8517
8518
8519
8520
8521
8522
8523
8524
8525
8526
8527
8528
8529
8530
8531
8532
8533
8534
8535
8536
8537
8538
8539
8540
8541
8542
8543
8544
8545
8546
8547
8548
8549
8550
8551
8552
8553
8554
8555
8556
8557
8558
8559
8560
8561
8562
8563
8564
8565
8566
8567
8568
8569
8570
8571
8572
8573
8574
8575
8576
8577
8578
8579
8580
8581
8582
8583
8584
8585
8586
8587
8588
8589
8590
8591
8592
8593
8594
8595
8596
8597
8598
8599
8600
8601
8602
8603
8604
8605
8606
8607
8608
8609
8610
8611
8612
8613
8614
8615
8616
8617
8618
8619
8620
8621
8622
8623
8624
8625
8626
8627
8628
8629
8630
8631
8632
8633
8634
8635
8636
8637
8638
8639
8640
8641
8642
8643
8644
8645
8646
8647
8648
8649
8650
8651
8652
8653
8654
8655
8656
8657
8658
8659
8660
8661
8662
8663
8664
8665
8666
8667
8668
8669
8670
8671
8672
8673
8674
8675
8676
8677
8678
8679
8680
8681
8682
8683
8684
8685
8686
8687
8688
8689
8690
8691
8692
8693
8694
8695
8696
8697
8698
8699
8700
8701
8702
8703
8704
8705
8706
8707
8708
8709
8710
8711
8712
8713
8714
8715
8716
8717
8718
8719
8720
8721
8722
8723
8724
8725
8726
8727
8728
8729
8730
8731
8732
8733
8734
8735
8736
8737
8738
8739
8740
8741
8742
8743
8744
8745
8746
8747
8748
8749
8750
8751
8752
8753
8754
8755
8756
8757
8758
8759
8760
8761
8762
8763
8764
8765
8766
8767
8768
8769
8770
8771
8772
8773
8774
8775
8776
8777
8778
8779
8780
8781
8782
8783
8784
8785
8786
8787
8788
8789
8790
8791
8792
8793
8794
8795
8796
8797
8798
8799
8800
8801
8802
8803
8804
8805
8806
8807
8808
8809
8810
8811
8812
8813
8814
8815
8816
8817
8818
8819
8820
8821
8822
8823
8824
8825
8826
8827
8828
8829
8830
8831
8832
8833
8834
8835
8836
8837
8838
8839
8840
8841
8842
8843
8844
8845
8846
8847
8848
8849
8850
8851
8852
8853
8854
8855
8856
8857
8858
8859
8860
8861
8862
8863
8864
8865
8866
8867
8868
8869
8870
8871
8872
8873
8874
8875
8876
8877
8878
8879
8880
8881
8882
8883
8884
8885
8886
8887
8888
8889
8890
8891
8892
8893
8894
8895
8896
8897
8898
8899
8900
8901
8902
8903
8904
8905
8906
8907
8908
8909
8910
8911
8912
8913
8914
8915
8916
8917
8918
8919
8920
8921
8922
8923
8924
8925
8926
8927
8928
8929
8930
8931
8932
8933
8934
8935
8936
8937
8938
8939
8940
8941
8942
8943
8944
8945
8946
8947
8948
8949
8950
8951
8952
8953
8954
8955
8956
8957
8958
8959
8960
8961
8962
8963
8964
8965
8966
8967
8968
8969
8970
8971
8972
8973
8974
8975
8976
8977
8978
8979
8980
8981
8982
8983
8984
8985
8986
8987
8988
8989
8990
8991
8992
8993
8994
8995
8996
8997
8998
8999
9000
9001
9002
9003
9004
9005
9006
9007
9008
9009
9010
9011
9012
9013
9014
9015
9016
9017
9018
9019
9020
9021
9022
9023
9024
9025
9026
9027
9028
9029
9030
9031
9032
9033
9034
9035
9036
9037
9038
9039
9040
9041
9042
9043
9044
9045
9046
9047
9048
9049
9050
9051
9052
9053
9054
9055
9056
9057
9058
9059
9060
9061
9062
9063
9064
9065
9066
9067
9068
9069
9070
9071
9072
9073
9074
9075
9076
9077
9078
9079
9080
9081
9082
9083
9084
9085
9086
9087
9088
9089
9090
9091
9092
9093
9094
9095
9096
9097
9098
9099
9100
9101
9102
9103
9104
9105
9106
9107
9108
9109
9110
9111
9112
9113
9114
9115
9116
9117
9118
9119
9120
9121
9122
9123
9124
9125
9126
9127
9128
9129
9130
9131
9132
9133
9134
9135
9136
9137
9138
9139
9140
9141
9142
9143
9144
9145
9146
9147
9148
9149
9150
9151
9152
9153
9154
9155
9156
9157
9158
9159
9160
9161
9162
9163
9164
9165
9166
9167
9168
9169
9170
9171
9172
9173
9174
9175
9176
9177
9178
9179
9180
9181
9182
9183
9184
9185
9186
9187
9188
9189
9190
9191
9192
9193
9194
9195
9196
9197
9198
9199
9200
9201
9202
9203
9204
9205
9206
9207
9208
9209
9210
9211
9212
9213
9214
9215
9216
9217
9218
9219
9220
9221
9222
9223
9224
9225
9226
9227
9228
9229
9230
9231
9232
9233
9234
9235
9236
9237
9238
9239
9240
9241
9242
9243
9244
9245
9246
9247
9248
9249
9250
9251
9252
9253
9254
9255
9256
9257
9258
9259
9260
9261
9262
9263
9264
9265
9266
9267
9268
9269
9270
9271
9272
9273
9274
9275
9276
9277
9278
9279
9280
9281
9282
9283
9284
9285
9286
9287
9288
9289
9290
9291
9292
9293
9294
9295
9296
9297
9298
9299
9300
9301
9302
9303
9304
9305
9306
9307
9308
9309
9310
9311
9312
9313
9314
9315
9316
9317
9318
9319
9320
9321
9322
9323
9324
9325
9326
9327
9328
9329
9330
9331
9332
9333
9334
9335
9336
9337
9338
9339
9340
9341
9342
9343
9344
9345
9346
9347
9348
9349
9350
9351
9352
9353
9354
9355
9356
9357
9358
9359
9360
9361
9362
9363
9364
9365
9366
9367
9368
9369
9370
9371
9372
9373
9374
9375
9376
9377
9378
9379
9380
9381
9382
9383
9384
9385
9386
9387
9388
9389
9390
9391
9392
9393
9394
9395
9396
9397
9398
9399
9400
9401
9402
9403
9404
9405
9406
9407
9408
9409
9410
9411
9412
9413
9414
9415
9416
9417
9418
9419
9420
9421
9422
9423
9424
9425
9426
9427
9428
9429
9430
9431
9432
9433
9434
9435
9436
9437
9438
9439
9440
9441
9442
9443
9444
9445
9446
9447
9448
9449
9450
9451
9452
9453
9454
9455
9456
9457
9458
9459
9460
9461
9462
9463
9464
9465
9466
9467
9468
9469
9470
9471
9472
9473
9474
9475
9476
9477
9478
9479
9480
9481
9482
9483
9484
9485
9486
9487
9488
9489
9490
9491
9492
9493
9494
9495
9496
9497
9498
9499
9500
9501
9502
9503
9504
9505
9506
9507
9508
9509
9510
9511
9512
9513
9514
9515
9516
9517
9518
9519
9520
9521
9522
9523
9524
9525
9526
9527
9528
9529
9530
9531
9532
9533
9534
9535
9536
9537
9538
9539
9540
9541
9542
9543
9544
9545
9546
9547
9548
9549
9550
9551
9552
9553
9554
9555
9556
9557
9558
9559
9560
9561
9562
9563
9564
9565
9566
9567
9568
9569
9570
9571
9572
9573
9574
9575
9576
9577
9578
9579
9580
9581
9582
9583
9584
9585
9586
9587
9588
9589
9590
9591
9592
9593
9594
9595
9596
9597
9598
9599
9600
9601
9602
9603
9604
9605
9606
9607
9608
9609
9610
9611
9612
9613
9614
9615
9616
9617
9618
9619
9620
9621
9622
9623
9624
9625
9626
9627
9628
9629
9630
9631
9632
9633
9634
9635
9636
9637
9638
9639
9640
9641
9642
9643
9644
9645
9646
9647
9648
9649
9650
9651
9652
9653
9654
9655
9656
9657
9658
9659
9660
9661
9662
9663
9664
9665
9666
9667
9668
9669
9670
9671
9672
9673
9674
9675
9676
9677
9678
9679
9680
9681
9682
9683
9684
9685
9686
9687
9688
9689
9690
9691
9692
9693
9694
9695
9696
9697
9698
9699
9700
9701
9702
9703
9704
9705
9706
9707
9708
9709
9710
9711
9712
9713
9714
9715
9716
9717
9718
9719
9720
9721
9722
9723
9724
9725
9726
9727
9728
9729
9730
9731
9732
9733
9734
9735
9736
9737
9738
9739
9740
9741
9742
9743
9744
9745
9746
9747
9748
9749
9750
9751
9752
9753
9754
9755
9756
9757
9758
9759
9760
9761
9762
9763
9764
9765
9766
9767
9768
9769
9770
9771
9772
9773
9774
9775
9776
9777
9778
9779
9780
9781
9782
9783
9784
9785
9786
9787
9788
9789
9790
9791
9792
9793
9794
9795
9796
9797
9798
9799
9800
9801
9802
9803
9804
9805
9806
9807
9808
9809
9810
9811
9812
9813
9814
9815
9816
9817
9818
9819
9820
9821
9822
9823
9824
9825
9826
9827
9828
9829
9830
9831
9832
9833
9834
9835
9836
9837
9838
9839
9840
9841
9842
9843
9844
9845
9846
9847
9848
9849
9850
9851
9852
9853
9854
9855
9856
9857
9858
9859
9860
9861
9862
9863
9864
9865
9866
9867
9868
9869
9870
9871
9872
9873
9874
9875
9876
9877
9878
9879
9880
9881
9882
9883
9884
9885
9886
9887
9888
9889
9890
9891
9892
9893
9894
9895
9896
9897
9898
9899
9900
9901
9902
9903
9904
9905
9906
9907
9908
9909
9910
9911
9912
9913
9914
9915
9916
9917
9918
9919
9920
9921
9922
9923
9924
9925
9926
9927
9928
9929
9930
9931
9932
9933
9934
9935
9936
9937
9938
9939
9940
9941
9942
9943
9944
9945
9946
9947
9948
9949
9950
9951
9952
9953
9954
9955
9956
9957
9958
9959
9960
9961
9962
9963
9964
9965
9966
9967
9968
9969
9970
9971
9972
9973
9974
9975
9976
9977
9978
9979
9980
9981
9982
9983
9984
9985
9986
9987
9988
9989
9990
9991
9992
9993
9994
9995
9996
9997
9998
9999
10000
10001
10002
10003
10004
10005
10006
10007
10008
10009
10010
10011
10012
10013
10014
10015
10016
10017
10018
10019
10020
10021
10022
10023
10024
10025
10026
10027
10028
10029
10030
10031
10032
10033
10034
10035
10036
10037
10038
10039
10040
10041
10042
10043
10044
10045
10046
10047
10048
10049
10050
10051
10052
10053
10054
10055
10056
10057
10058
10059
10060
10061
10062
10063
10064
10065
10066
10067
10068
10069
10070
10071
10072
10073
10074
10075
10076
10077
10078
10079
10080
10081
10082
10083
10084
10085
10086
10087
10088
10089
10090
10091
10092
10093
10094
10095
10096
10097
10098
10099
10100
10101
10102
10103
10104
10105
10106
10107
10108
10109
10110
10111
10112
10113
10114
10115
10116
10117
10118
10119
10120
10121
10122
10123
10124
10125
10126
10127
10128
10129
10130
10131
10132
10133
10134
10135
10136
10137
10138
10139
10140
10141
10142
10143
10144
10145
10146
10147
10148
10149
10150
10151
10152
10153
10154
10155
10156
10157
10158
10159
10160
10161
10162
10163
10164
10165
10166
10167
10168
10169
10170
10171
10172
10173
10174
10175
10176
10177
10178
10179
10180
10181
10182
10183
10184
10185
10186
10187
10188
10189
10190
10191
10192
10193
10194
10195
10196
10197
10198
10199
10200
10201
10202
10203
10204
10205
10206
10207
10208
10209
10210
10211
10212
10213
10214
10215
10216
10217
10218
10219
10220
10221
10222
10223
10224
10225
10226
10227
10228
10229
10230
10231
10232
10233
10234
10235
10236
10237
10238
10239
10240
10241
10242
10243
10244
10245
10246
10247
10248
10249
10250
10251
10252
10253
10254
10255
10256
10257
10258
10259
10260
10261
10262
10263
10264
10265
10266
10267
10268
10269
10270
10271
10272
10273
10274
10275
10276
10277
10278
10279
10280
10281
10282
10283
10284
10285
10286
10287
10288
10289
10290
10291
10292
10293
10294
10295
10296
10297
10298
10299
10300
10301
10302
10303
10304
10305
10306
10307
10308
10309
10310
10311
10312
10313
10314
10315
10316
10317
10318
10319
10320
10321
10322
10323
10324
10325
10326
10327
10328
10329
10330
10331
10332
10333
10334
10335
10336
10337
10338
10339
10340
10341
10342
10343
10344
10345
10346
10347
10348
10349
10350
10351
10352
10353
10354
10355
10356
10357
10358
10359
10360
10361
10362
10363
10364
10365
10366
10367
10368
10369
10370
10371
10372
10373
10374
10375
10376
10377
10378
10379
10380
10381
10382
10383
10384
10385
10386
10387
10388
10389
10390
10391
10392
10393
10394
10395
10396
10397
10398
10399
10400
10401
10402
10403
10404
10405
10406
10407
10408
10409
10410
10411
10412
10413
10414
10415
10416
10417
10418
10419
10420
10421
10422
10423
10424
10425
10426
10427
10428
10429
10430
10431
10432
10433
10434
10435
10436
10437
10438
10439
10440
10441
10442
10443
10444
10445
10446
10447
10448
10449
10450
10451
10452
10453
10454
10455
10456
10457
10458
10459
10460
10461
10462
10463
10464
10465
10466
10467
10468
10469
10470
10471
10472
10473
10474
10475
10476
10477
10478
10479
10480
10481
10482
10483
10484
10485
10486
10487
10488
10489
10490
10491
10492
10493
10494
10495
10496
10497
10498
10499
10500
10501
10502
10503
10504
10505
10506
10507
10508
10509
10510
10511
10512
10513
10514
10515
10516
10517
10518
10519
10520
10521
10522
10523
10524
10525
10526
10527
10528
10529
10530
10531
10532
10533
10534
10535
10536
10537
10538
10539
10540
10541
10542
10543
10544
10545
10546
10547
10548
10549
10550
10551
10552
10553
10554
10555
10556
10557
10558
10559
10560
10561
10562
10563
10564
10565
10566
10567
10568
10569
10570
10571
10572
10573
10574
10575
10576
10577
10578
10579
10580
10581
10582
10583
10584
10585
10586
10587
10588
10589
10590
10591
10592
10593
10594
10595
10596
10597
10598
10599
10600
10601
10602
10603
10604
10605
10606
10607
10608
10609
10610
10611
10612
10613
10614
10615
10616
10617
10618
10619
10620
10621
10622
10623
10624
10625
10626
10627
10628
10629
10630
10631
10632
10633
10634
10635
10636
10637
10638
10639
10640
10641
10642
10643
10644
10645
10646
10647
10648
10649
10650
10651
10652
10653
10654
10655
10656
10657
10658
10659
10660
10661
10662
10663
10664
10665
10666
10667
10668
10669
10670
10671
10672
10673
10674
10675
10676
10677
10678
10679
10680
10681
10682
10683
10684
10685
10686
10687
10688
10689
10690
10691
10692
10693
10694
10695
10696
10697
10698
10699
10700
10701
10702
10703
10704
10705
10706
10707
10708
10709
10710
10711
10712
10713
10714
10715
10716
10717
10718
10719
10720
10721
10722
10723
10724
10725
10726
10727
10728
10729
10730
10731
10732
10733
10734
10735
10736
10737
10738
10739
10740
10741
10742
10743
10744
10745
10746
10747
10748
10749
10750
10751
10752
10753
10754
10755
10756
10757
10758
10759
10760
10761
10762
10763
10764
10765
10766
10767
10768
10769
10770
10771
10772
10773
10774
10775
10776
10777
10778
10779
10780
10781
10782
10783
10784
10785
10786
10787
10788
10789
10790
10791
10792
10793
10794
10795
10796
10797
10798
10799
10800
10801
10802
10803
10804
10805
10806
10807
10808
10809
10810
10811
10812
10813
10814
10815
10816
10817
10818
10819
10820
10821
10822
10823
10824
10825
10826
10827
10828
10829
10830
10831
10832
10833
10834
10835
10836
10837
10838
10839
10840
10841
10842
10843
10844
10845
10846
10847
10848
10849
10850
10851
10852
10853
10854
10855
10856
10857
10858
10859
10860
10861
10862
10863
10864
10865
10866
10867
10868
10869
10870
10871
10872
10873
10874
10875
10876
10877
10878
10879
10880
10881
10882
10883
10884
10885
10886
10887
10888
10889
10890
10891
10892
10893
10894
10895
10896
10897
10898
10899
10900
10901
10902
10903
10904
10905
10906
10907
10908
10909
10910
10911
10912
10913
10914
10915
10916
10917
10918
10919
10920
10921
10922
10923
10924
10925
10926
10927
10928
10929
10930
10931
10932
10933
10934
10935
10936
10937
10938
10939
10940
10941
10942
10943
10944
10945
10946
10947
10948
10949
10950
10951
10952
10953
10954
10955
10956
10957
10958
10959
10960
10961
10962
10963
10964
10965
10966
10967
10968
10969
10970
10971
10972
10973
10974
10975
10976
10977
10978
10979
10980
10981
10982
10983
10984
10985
10986
10987
10988
10989
10990
10991
10992
10993
10994
10995
10996
10997
10998
10999
11000
11001
11002
11003
11004
11005
11006
11007
11008
11009
11010
11011
11012
11013
11014
11015
11016
11017
11018
11019
11020
11021
11022
11023
11024
11025
11026
11027
11028
11029
11030
11031
11032
11033
11034
11035
11036
11037
11038
11039
11040
11041
11042
11043
11044
11045
11046
11047
11048
11049
11050
11051
11052
11053
11054
11055
11056
11057
11058
11059
11060
11061
11062
11063
11064
11065
11066
11067
11068
11069
11070
11071
11072
11073
11074
11075
11076
11077
11078
11079
11080
11081
11082
11083
11084
11085
11086
11087
11088
11089
11090
11091
11092
11093
11094
11095
11096
11097
11098
11099
11100
11101
11102
11103
11104
11105
11106
11107
11108
11109
11110
11111
11112
11113
11114
11115
11116
11117
11118
11119
11120
11121
11122
11123
11124
11125
11126
11127
11128
11129
11130
11131
11132
11133
11134
11135
11136
11137
11138
11139
11140
11141
11142
11143
11144
11145
11146
11147
11148
11149
11150
11151
11152
11153
11154
11155
11156
11157
11158
11159
11160
11161
11162
11163
11164
11165
11166
11167
11168
11169
11170
11171
11172
11173
11174
11175
11176
11177
11178
11179
11180
11181
11182
11183
11184
11185
11186
11187
11188
11189
11190
11191
11192
11193
11194
11195
11196
11197
11198
11199
11200
11201
11202
11203
11204
11205
11206
11207
11208
11209
11210
11211
11212
11213
11214
11215
11216
11217
11218
11219
11220
11221
11222
11223
11224
11225
11226
11227
11228
11229
11230
11231
11232
11233
11234
11235
11236
11237
11238
11239
11240
11241
11242
11243
11244
11245
11246
11247
11248
11249
11250
11251
11252
11253
11254
11255
11256
11257
11258
11259
11260
11261
11262
11263
11264
11265
11266
11267
11268
11269
11270
11271
11272
11273
11274
11275
11276
11277
11278
11279
11280
11281
11282
11283
11284
11285
11286
11287
11288
11289
11290
11291
11292
11293
11294
11295
11296
11297
11298
11299
11300
11301
11302
11303
11304
11305
11306
11307
11308
11309
11310
11311
11312
11313
11314
11315
11316
11317
11318
11319
11320
11321
11322
11323
11324
11325
11326
11327
11328
11329
11330
11331
11332
11333
11334
11335
11336
11337
11338
11339
11340
11341
11342
11343
11344
11345
11346
11347
11348
11349
11350
11351
11352
11353
11354
11355
11356
11357
11358
11359
11360
11361
11362
11363
11364
11365
11366
11367
11368
11369
11370
11371
11372
11373
11374
11375
11376
11377
11378
11379
11380
11381
11382
11383
11384
11385
11386
11387
11388
11389
11390
11391
11392
11393
11394
11395
11396
11397
11398
11399
11400
11401
11402
11403
11404
11405
11406
11407
11408
11409
11410
11411
11412
11413
11414
11415
11416
11417
11418
11419
11420
11421
11422
11423
11424
11425
11426
11427
11428
11429
11430
11431
11432
11433
11434
11435
11436
11437
11438
11439
11440
11441
11442
11443
11444
11445
11446
11447
11448
11449
11450
11451
11452
11453
11454
11455
11456
11457
11458
11459
11460
11461
11462
11463
11464
11465
11466
11467
11468
11469
11470
11471
11472
11473
11474
11475
11476
11477
11478
11479
11480
11481
11482
11483
11484
11485
11486
11487
11488
11489
11490
11491
11492
11493
11494
11495
11496
11497
11498
11499
11500
11501
11502
11503
11504
11505
11506
11507
11508
11509
11510
11511
11512
11513
11514
11515
11516
11517
11518
11519
11520
11521
11522
11523
11524
11525
11526
11527
11528
11529
11530
11531
11532
11533
11534
11535
11536
11537
11538
11539
11540
11541
11542
11543
11544
11545
11546
11547
11548
11549
11550
11551
11552
11553
11554
11555
11556
11557
11558
11559
11560
11561
11562
11563
11564
11565
11566
11567
11568
11569
11570
11571
11572
11573
11574
11575
11576
11577
11578
11579
11580
11581
11582
11583
11584
11585
11586
11587
11588
11589
11590
11591
11592
11593
11594
11595
11596
11597
11598
11599
11600
11601
11602
11603
11604
11605
11606
11607
11608
11609
11610
11611
11612
11613
11614
11615
11616
11617
11618
11619
11620
11621
11622
11623
11624
11625
11626
11627
11628
11629
11630
11631
11632
11633
11634
11635
11636
11637
11638
11639
11640
11641
11642
11643
11644
11645
11646
11647
11648
11649
11650
11651
11652
11653
11654
11655
11656
11657
11658
11659
11660
11661
11662
11663
11664
11665
11666
11667
11668
11669
11670
11671
11672
11673
11674
11675
11676
11677
11678
11679
11680
11681
11682
11683
11684
11685
11686
11687
11688
11689
11690
11691
11692
11693
11694
11695
11696
11697
11698
11699
11700
11701
11702
11703
11704
11705
11706
11707
11708
11709
11710
11711
11712
11713
11714
11715
11716
11717
11718
11719
11720
11721
11722
11723
11724
11725
11726
11727
11728
11729
11730
11731
11732
11733
11734
11735
11736
11737
11738
11739
11740
11741
11742
11743
11744
11745
11746
11747
11748
11749
11750
11751
11752
11753
11754
11755
11756
11757
11758
11759
11760
11761
11762
11763
11764
11765
11766
11767
11768
11769
11770
11771
11772
11773
11774
11775
11776
11777
11778
11779
11780
11781
11782
11783
11784
11785
11786
11787
11788
11789
11790
11791
11792
11793
11794
11795
11796
11797
11798
11799
11800
11801
11802
11803
11804
11805
11806
11807
11808
11809
11810
11811
11812
11813
11814
11815
11816
11817
11818
11819
11820
11821
11822
11823
11824
11825
11826
11827
11828
11829
11830
11831
11832
11833
11834
11835
11836
11837
11838
11839
11840
11841
11842
11843
11844
11845
11846
11847
11848
11849
11850
11851
11852
11853
11854
11855
11856
11857
11858
11859
11860
11861
11862
11863
11864
11865
11866
11867
11868
11869
11870
11871
11872
11873
11874
11875
11876
11877
11878
11879
11880
11881
11882
11883
11884
11885
11886
11887
11888
11889
11890
11891
11892
11893
11894
11895
11896
11897
11898
11899
11900
11901
11902
11903
11904
11905
11906
11907
11908
11909
11910
11911
11912
11913
11914
11915
11916
11917
11918
11919
11920
11921
11922
11923
11924
11925
11926
11927
11928
11929
11930
11931
11932
11933
11934
11935
11936
11937
11938
11939
11940
11941
11942
11943
11944
11945
11946
11947
11948
11949
11950
11951
11952
11953
11954
11955
11956
11957
11958
11959
11960
11961
11962
11963
11964
11965
11966
11967
11968
11969
11970
11971
11972
11973
11974
11975
11976
11977
11978
11979
11980
11981
11982
11983
11984
11985
11986
11987
11988
11989
11990
11991
11992
11993
11994
11995
11996
11997
11998
11999
12000
12001
12002
12003
12004
12005
12006
12007
12008
12009
12010
12011
12012
12013
12014
12015
12016
12017
12018
12019
12020
12021
12022
12023
12024
12025
12026
12027
12028
12029
12030
12031
12032
12033
12034
12035
12036
12037
12038
12039
12040
12041
12042
12043
12044
12045
12046
12047
12048
12049
12050
12051
12052
12053
12054
12055
12056
12057
12058
12059
12060
12061
12062
12063
12064
12065
12066
12067
12068
12069
12070
12071
12072
12073
12074
12075
12076
12077
12078
12079
12080
12081
12082
12083
12084
12085
12086
12087
12088
12089
12090
12091
12092
12093
12094
12095
12096
12097
12098
12099
12100
12101
12102
12103
12104
12105
12106
12107
12108
12109
12110
12111
12112
12113
12114
12115
12116
12117
12118
12119
12120
12121
12122
12123
12124
12125
12126
12127
12128
12129
12130
12131
12132
12133
12134
12135
12136
12137
12138
12139
12140
12141
12142
12143
12144
12145
12146
12147
12148
12149
12150
12151
12152
12153
12154
12155
12156
12157
12158
12159
12160
12161
12162
12163
12164
12165
12166
12167
12168
12169
12170
12171
12172
12173
12174
12175
12176
12177
12178
12179
12180
12181
12182
12183
12184
12185
12186
12187
12188
12189
12190
12191
12192
12193
12194
12195
12196
12197
12198
12199
12200
12201
12202
12203
12204
12205
12206
12207
12208
12209
12210
12211
12212
12213
12214
12215
12216
12217
12218
12219
12220
12221
12222
12223
12224
12225
12226
12227
12228
12229
12230
12231
12232
12233
12234
12235
12236
12237
12238
12239
12240
12241
12242
12243
12244
12245
12246
12247
12248
12249
12250
12251
12252
12253
12254
12255
12256
12257
12258
12259
12260
12261
12262
12263
12264
12265
12266
12267
12268
12269
12270
12271
12272
12273
12274
12275
12276
12277
12278
12279
12280
12281
12282
12283
12284
12285
12286
12287
12288
12289
12290
12291
12292
12293
12294
12295
12296
12297
12298
12299
12300
12301
12302
12303
12304
12305
12306
12307
12308
12309
12310
12311
12312
12313
12314
12315
12316
12317
12318
12319
12320
12321
12322
12323
12324
12325
12326
12327
12328
12329
12330
12331
12332
12333
12334
12335
12336
12337
12338
12339
12340
12341
12342
12343
12344
12345
12346
12347
12348
12349
12350
12351
12352
12353
12354
12355
12356
12357
12358
12359
12360
12361
12362
12363
12364
12365
12366
12367
12368
12369
12370
12371
12372
12373
12374
12375
12376
12377
12378
12379
12380
12381
12382
12383
12384
12385
12386
12387
12388
12389
12390
12391
12392
12393
12394
12395
12396
12397
12398
12399
12400
12401
12402
12403
12404
12405
12406
12407
12408
12409
12410
12411
12412
12413
12414
12415
12416
12417
12418
12419
12420
12421
12422
12423
12424
12425
12426
12427
12428
12429
12430
12431
12432
12433
12434
12435
12436
12437
12438
12439
12440
12441
12442
12443
12444
12445
12446
12447
12448
12449
12450
12451
12452
12453
12454
12455
12456
12457
12458
12459
12460
12461
12462
12463
12464
12465
12466
12467
12468
12469
12470
12471
12472
12473
12474
12475
12476
12477
12478
12479
12480
12481
12482
12483
12484
12485
12486
12487
12488
12489
12490
12491
12492
12493
12494
12495
12496
12497
12498
12499
12500
12501
12502
12503
12504
12505
12506
12507
12508
12509
12510
12511
12512
12513
12514
12515
12516
12517
12518
12519
12520
12521
12522
12523
12524
12525
12526
12527
12528
12529
12530
12531
12532
12533
12534
12535
12536
12537
12538
12539
12540
12541
12542
12543
12544
12545
12546
12547
12548
12549
12550
12551
12552
12553
12554
12555
12556
12557
12558
12559
12560
12561
12562
12563
12564
12565
12566
12567
12568
12569
12570
12571
12572
12573
12574
12575
12576
12577
12578
12579
12580
12581
12582
12583
12584
12585
12586
12587
12588
12589
12590
12591
12592
12593
12594
12595
12596
12597
12598
12599
12600
12601
12602
12603
12604
12605
12606
12607
12608
12609
12610
12611
12612
12613
12614
12615
12616
12617
12618
12619
12620
12621
12622
12623
12624
12625
12626
12627
12628
12629
12630
12631
12632
12633
12634
12635
12636
12637
12638
12639
12640
12641
12642
12643
12644
12645
12646
12647
12648
12649
12650
12651
12652
12653
12654
12655
12656
12657
12658
12659
12660
12661
12662
12663
12664
12665
12666
12667
12668
12669
12670
12671
12672
12673
12674
12675
12676
12677
12678
12679
12680
12681
12682
12683
12684
12685
12686
12687
12688
12689
12690
12691
12692
12693
12694
12695
12696
12697
12698
12699
12700
12701
12702
12703
12704
12705
12706
12707
12708
12709
12710
12711
12712
12713
12714
12715
12716
12717
12718
12719
12720
12721
12722
12723
12724
12725
12726
12727
12728
12729
12730
12731
12732
12733
12734
12735
12736
12737
12738
12739
12740
12741
12742
12743
12744
12745
12746
12747
12748
12749
12750
12751
12752
12753
12754
12755
12756
12757
12758
12759
12760
12761
12762
12763
12764
12765
12766
12767
12768
12769
12770
12771
12772
12773
12774
12775
12776
12777
12778
12779
12780
12781
12782
12783
12784
12785
12786
12787
12788
12789
12790
12791
12792
12793
12794
12795
12796
12797
12798
12799
12800
12801
12802
12803
12804
12805
12806
12807
12808
12809
12810
12811
12812
12813
12814
12815
12816
12817
12818
12819
12820
12821
12822
12823
12824
12825
12826
12827
12828
12829
12830
12831
12832
12833
12834
12835
12836
12837
12838
12839
12840
12841
12842
12843
12844
12845
12846
12847
12848
12849
12850
12851
12852
12853
12854
12855
12856
12857
12858
12859
12860
12861
12862
12863
12864
12865
12866
12867
12868
12869
12870
12871
12872
12873
12874
12875
12876
12877
12878
12879
12880
12881
12882
12883
12884
12885
12886
12887
12888
12889
12890
12891
12892
12893
12894
12895
12896
12897
12898
12899
12900
12901
12902
12903
12904
12905
12906
12907
12908
12909
12910
12911
12912
12913
12914
12915
12916
12917
12918
12919
12920
12921
12922
12923
12924
12925
12926
12927
12928
12929
12930
12931
12932
12933
12934
12935
12936
12937
12938
12939
12940
12941
12942
12943
12944
12945
12946
12947
12948
12949
12950
12951
12952
12953
12954
12955
12956
12957
12958
12959
12960
12961
12962
12963
12964
12965
12966
12967
12968
12969
12970
12971
12972
12973
12974
12975
12976
12977
12978
12979
12980
12981
12982
12983
12984
12985
12986
12987
12988
12989
12990
12991
12992
12993
12994
12995
12996
12997
12998
12999
13000
13001
13002
13003
13004
13005
13006
13007
13008
13009
13010
13011
13012
13013
13014
13015
13016
13017
13018
13019
13020
13021
13022
13023
13024
13025
13026
13027
13028
13029
13030
13031
13032
13033
13034
13035
13036
13037
13038
13039
13040
13041
13042
13043
13044
13045
13046
13047
13048
13049
13050
13051
13052
13053
13054
13055
13056
13057
13058
13059
13060
13061
13062
13063
13064
13065
13066
13067
13068
13069
13070
13071
13072
13073
13074
13075
13076
13077
13078
13079
13080
13081
13082
13083
13084
13085
13086
13087
13088
13089
13090
13091
13092
13093
13094
13095
13096
13097
13098
13099
13100
13101
13102
13103
13104
13105
13106
13107
13108
13109
13110
13111
13112
|
/* A Bison parser, made from ./parse.y
by GNU Bison version 1.25
*/
#define YYBISON 1 /* Identify Bison output. */
#define yyparse java_parse
#define yylex java_lex
#define yyerror java_error
#define yylval java_lval
#define yychar java_char
#define yydebug java_debug
#define yynerrs java_nerrs
#define PLUS_TK 258
#define MINUS_TK 259
#define MULT_TK 260
#define DIV_TK 261
#define REM_TK 262
#define LS_TK 263
#define SRS_TK 264
#define ZRS_TK 265
#define AND_TK 266
#define XOR_TK 267
#define OR_TK 268
#define BOOL_AND_TK 269
#define BOOL_OR_TK 270
#define EQ_TK 271
#define NEQ_TK 272
#define GT_TK 273
#define GTE_TK 274
#define LT_TK 275
#define LTE_TK 276
#define PLUS_ASSIGN_TK 277
#define MINUS_ASSIGN_TK 278
#define MULT_ASSIGN_TK 279
#define DIV_ASSIGN_TK 280
#define REM_ASSIGN_TK 281
#define LS_ASSIGN_TK 282
#define SRS_ASSIGN_TK 283
#define ZRS_ASSIGN_TK 284
#define AND_ASSIGN_TK 285
#define XOR_ASSIGN_TK 286
#define OR_ASSIGN_TK 287
#define PUBLIC_TK 288
#define PRIVATE_TK 289
#define PROTECTED_TK 290
#define STATIC_TK 291
#define FINAL_TK 292
#define SYNCHRONIZED_TK 293
#define VOLATILE_TK 294
#define TRANSIENT_TK 295
#define NATIVE_TK 296
#define PAD_TK 297
#define ABSTRACT_TK 298
#define MODIFIER_TK 299
#define DECR_TK 300
#define INCR_TK 301
#define DEFAULT_TK 302
#define IF_TK 303
#define THROW_TK 304
#define BOOLEAN_TK 305
#define DO_TK 306
#define IMPLEMENTS_TK 307
#define THROWS_TK 308
#define BREAK_TK 309
#define IMPORT_TK 310
#define ELSE_TK 311
#define INSTANCEOF_TK 312
#define RETURN_TK 313
#define VOID_TK 314
#define CATCH_TK 315
#define INTERFACE_TK 316
#define CASE_TK 317
#define EXTENDS_TK 318
#define FINALLY_TK 319
#define SUPER_TK 320
#define WHILE_TK 321
#define CLASS_TK 322
#define SWITCH_TK 323
#define CONST_TK 324
#define TRY_TK 325
#define FOR_TK 326
#define NEW_TK 327
#define CONTINUE_TK 328
#define GOTO_TK 329
#define PACKAGE_TK 330
#define THIS_TK 331
#define BYTE_TK 332
#define SHORT_TK 333
#define INT_TK 334
#define LONG_TK 335
#define CHAR_TK 336
#define INTEGRAL_TK 337
#define FLOAT_TK 338
#define DOUBLE_TK 339
#define FP_TK 340
#define ID_TK 341
#define REL_QM_TK 342
#define REL_CL_TK 343
#define NOT_TK 344
#define NEG_TK 345
#define ASSIGN_ANY_TK 346
#define ASSIGN_TK 347
#define OP_TK 348
#define CP_TK 349
#define OCB_TK 350
#define CCB_TK 351
#define OSB_TK 352
#define CSB_TK 353
#define SC_TK 354
#define C_TK 355
#define DOT_TK 356
#define STRING_LIT_TK 357
#define CHAR_LIT_TK 358
#define INT_LIT_TK 359
#define FP_LIT_TK 360
#define TRUE_TK 361
#define FALSE_TK 362
#define BOOL_LIT_TK 363
#define NULL_TK 364
#line 48 "./parse.y"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <dirent.h>
#ifdef __STDC__
#include <stdarg.h>
#else
#include <varargs.h>
#endif
#include "config.h"
#include "tree.h"
#include "rtl.h"
#include "obstack.h"
#include "toplev.h"
#include "flags.h"
#include "java-tree.h"
#include "jcf.h"
#include "lex.h"
#include "parse.h"
#include "zipfile.h"
#include "convert.h"
/* Number of error found so far. */
int java_error_count;
/* Number of warning found so far. */
int java_warning_count;
/* The current parser context */
static struct parser_ctxt *ctxp;
/* List of things that were anlyzed for which code will be generated */
static struct parser_ctxt *ctxp_for_generation = NULL;
/* binop_lookup maps token to tree_code. It is used where binary
operations are involved and required by the parser. RDIV_EXPR
covers both integral/floating point division. The code is changed
once the type of both operator is worked out. */
static enum tree_code binop_lookup[19] =
{
PLUS_EXPR, MINUS_EXPR, MULT_EXPR, RDIV_EXPR, TRUNC_MOD_EXPR,
LSHIFT_EXPR, RSHIFT_EXPR, URSHIFT_EXPR,
BIT_AND_EXPR, BIT_XOR_EXPR, BIT_IOR_EXPR,
TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR,
EQ_EXPR, NE_EXPR, GT_EXPR, GE_EXPR, LT_EXPR, LE_EXPR,
};
#define BINOP_LOOKUP(VALUE) \
binop_lookup [((VALUE) - PLUS_TK)% \
(sizeof (binop_lookup) / sizeof (binop_lookup[0]))]
/* Fake WFL used to report error message. It is initialized once if
needed and reused with it's location information is overriden. */
tree wfl_operator = NULL_TREE;
/* The "$L" identifier we use to create labels. */
static tree label_id = NULL_TREE;
/* The "StringBuffer" identifier used for the String `+' operator. */
static tree wfl_string_buffer = NULL_TREE;
/* The "append" identifier used for String `+' operator. */
static tree wfl_append = NULL_TREE;
/* The "toString" identifier used for String `+' operator. */
static tree wfl_to_string = NULL_TREE;
#line 117 "./parse.y"
typedef union {
tree node;
int sub_token;
struct {
int token;
int location;
} operator;
int value;
} YYSTYPE;
#ifndef YYDEBUG
#define YYDEBUG 1
#endif
#include <stdio.h>
#ifndef __cplusplus
#ifndef __STDC__
#define const
#endif
#endif
#define YYFINAL 776
#define YYFLAG -32768
#define YYNTBASE 110
#define YYTRANSLATE(x) ((unsigned)(x) <= 364 ? yytranslate[x] : 265)
static const char yytranslate[] = { 0,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 1, 2, 3, 4, 5,
6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
16, 17, 18, 19, 20, 21, 22, 23, 24, 25,
26, 27, 28, 29, 30, 31, 32, 33, 34, 35,
36, 37, 38, 39, 40, 41, 42, 43, 44, 45,
46, 47, 48, 49, 50, 51, 52, 53, 54, 55,
56, 57, 58, 59, 60, 61, 62, 63, 64, 65,
66, 67, 68, 69, 70, 71, 72, 73, 74, 75,
76, 77, 78, 79, 80, 81, 82, 83, 84, 85,
86, 87, 88, 89, 90, 91, 92, 93, 94, 95,
96, 97, 98, 99, 100, 101, 102, 103, 104, 105,
106, 107, 108, 109
};
#if YYDEBUG != 0
static const short yyprhs[] = { 0,
0, 2, 4, 6, 8, 10, 12, 14, 16, 18,
20, 22, 24, 26, 28, 30, 32, 34, 38, 42,
46, 50, 54, 56, 58, 60, 64, 66, 67, 69,
71, 73, 76, 79, 82, 86, 88, 91, 93, 96,
100, 103, 107, 109, 111, 115, 118, 122, 128, 133,
139, 141, 143, 145, 147, 149, 152, 153, 161, 162,
169, 173, 176, 180, 185, 186, 189, 193, 196, 197,
200, 203, 205, 209, 213, 216, 220, 222, 225, 227,
229, 231, 233, 235, 237, 239, 241, 245, 250, 252,
256, 260, 262, 266, 270, 275, 277, 281, 284, 288,
292, 294, 296, 297, 301, 304, 308, 312, 317, 322,
325, 329, 332, 336, 339, 343, 348, 352, 356, 360,
362, 366, 370, 373, 377, 380, 384, 385, 388, 391,
393, 397, 401, 403, 406, 408, 411, 415, 417, 418,
422, 425, 429, 433, 438, 441, 445, 449, 454, 459,
465, 473, 480, 482, 484, 485, 490, 491, 497, 498,
504, 505, 512, 516, 521, 524, 528, 531, 535, 538,
542, 544, 547, 549, 551, 553, 555, 557, 560, 563,
566, 570, 574, 579, 581, 585, 589, 592, 596, 598,
600, 602, 605, 607, 609, 611, 614, 617, 621, 623,
625, 627, 629, 631, 633, 635, 637, 639, 641, 643,
645, 647, 649, 651, 653, 655, 657, 659, 661, 663,
665, 667, 670, 673, 676, 679, 682, 685, 688, 691,
695, 700, 705, 711, 716, 722, 729, 737, 744, 746,
748, 750, 752, 754, 756, 758, 764, 767, 771, 776,
784, 792, 793, 797, 802, 805, 809, 815, 818, 822,
826, 831, 833, 836, 839, 841, 844, 848, 851, 854,
858, 861, 866, 869, 872, 876, 881, 884, 886, 894,
902, 909, 913, 919, 924, 932, 939, 942, 945, 949,
952, 953, 955, 957, 960, 961, 963, 965, 969, 973,
976, 980, 983, 987, 990, 994, 997, 1001, 1004, 1008,
1011, 1015, 1019, 1022, 1026, 1032, 1038, 1041, 1046, 1050,
1052, 1056, 1060, 1065, 1068, 1070, 1073, 1076, 1081, 1084,
1088, 1093, 1096, 1099, 1101, 1103, 1105, 1107, 1111, 1113,
1115, 1117, 1119, 1123, 1127, 1131, 1135, 1139, 1143, 1147,
1151, 1157, 1162, 1169, 1175, 1180, 1186, 1192, 1199, 1203,
1207, 1212, 1218, 1221, 1225, 1229, 1233, 1235, 1239, 1243,
1247, 1251, 1256, 1261, 1266, 1271, 1275, 1279, 1281, 1284,
1288, 1292, 1295, 1298, 1302, 1306, 1310, 1314, 1317, 1321,
1326, 1332, 1339, 1345, 1352, 1357, 1362, 1367, 1372, 1376,
1381, 1385, 1390, 1392, 1394, 1396, 1398, 1401, 1404, 1406,
1408, 1411, 1414, 1416, 1419, 1422, 1425, 1428, 1431, 1434,
1436, 1439, 1442, 1444, 1447, 1450, 1456, 1461, 1466, 1472,
1477, 1480, 1486, 1491, 1497, 1499, 1503, 1507, 1511, 1515,
1519, 1523, 1525, 1529, 1533, 1537, 1541, 1543, 1547, 1551,
1555, 1559, 1563, 1567, 1569, 1573, 1577, 1581, 1585, 1589,
1593, 1597, 1601, 1605, 1609, 1611, 1615, 1619, 1623, 1627,
1629, 1633, 1637, 1639, 1643, 1647, 1649, 1653, 1657, 1659,
1663, 1667, 1669, 1673, 1677, 1679, 1685, 1690, 1694, 1700,
1702, 1704, 1708, 1712, 1714, 1716, 1718, 1720, 1722, 1724
};
static const short yyrhs[] = { 123,
0, 104, 0, 105, 0, 108, 0, 103, 0, 102,
0, 109, 0, 113, 0, 114, 0, 82, 0, 85,
0, 50, 0, 115, 0, 118, 0, 119, 0, 115,
0, 115, 0, 113, 97, 98, 0, 119, 97, 98,
0, 118, 97, 98, 0, 113, 97, 1, 0, 118,
97, 1, 0, 120, 0, 121, 0, 122, 0, 119,
101, 122, 0, 86, 0, 0, 126, 0, 124, 0,
125, 0, 126, 124, 0, 126, 125, 0, 124, 125,
0, 126, 124, 125, 0, 127, 0, 124, 127, 0,
130, 0, 125, 130, 0, 75, 119, 99, 0, 75,
1, 0, 75, 119, 1, 0, 128, 0, 129, 0,
55, 119, 99, 0, 55, 1, 0, 55, 119, 1,
0, 55, 119, 101, 5, 99, 0, 55, 119, 101,
1, 0, 55, 119, 101, 5, 1, 0, 132, 0,
165, 0, 99, 0, 1, 0, 44, 0, 131, 44,
0, 0, 131, 67, 122, 135, 136, 133, 138, 0,
0, 67, 122, 135, 136, 134, 138, 0, 131, 67,
1, 0, 67, 1, 0, 67, 122, 1, 0, 131,
67, 122, 1, 0, 0, 63, 116, 0, 63, 116,
1, 0, 63, 1, 0, 0, 52, 137, 0, 52,
1, 0, 117, 0, 137, 100, 117, 0, 137, 100,
1, 0, 95, 96, 0, 95, 139, 96, 0, 140,
0, 139, 140, 0, 141, 0, 156, 0, 158, 0,
178, 0, 142, 0, 147, 0, 132, 0, 165, 0,
112, 143, 99, 0, 131, 112, 143, 99, 0, 144,
0, 143, 100, 144, 0, 143, 100, 1, 0, 145,
0, 145, 92, 146, 0, 145, 92, 1, 0, 145,
92, 146, 1, 0, 122, 0, 145, 97, 98, 0,
122, 1, 0, 145, 97, 1, 0, 145, 98, 1,
0, 263, 0, 176, 0, 0, 149, 148, 155, 0,
149, 1, 0, 112, 150, 153, 0, 59, 150, 153,
0, 131, 112, 150, 153, 0, 131, 59, 150, 153,
0, 112, 1, 0, 131, 112, 1, 0, 59, 1,
0, 131, 59, 1, 0, 131, 1, 0, 122, 93,
94, 0, 122, 93, 151, 94, 0, 150, 97, 98,
0, 122, 93, 1, 0, 150, 97, 1, 0, 152,
0, 151, 100, 152, 0, 151, 100, 1, 0, 112,
145, 0, 131, 112, 145, 0, 112, 1, 0, 131,
112, 1, 0, 0, 53, 154, 0, 53, 1, 0,
116, 0, 154, 100, 116, 0, 154, 100, 1, 0,
178, 0, 178, 99, 0, 99, 0, 157, 178, 0,
157, 178, 99, 0, 44, 0, 0, 160, 159, 162,
0, 161, 153, 0, 131, 161, 153, 0, 120, 93,
94, 0, 120, 93, 151, 94, 0, 179, 180, 0,
179, 163, 180, 0, 179, 181, 180, 0, 179, 163,
181, 180, 0, 164, 93, 94, 99, 0, 164, 93,
232, 94, 99, 0, 119, 101, 65, 93, 232, 94,
99, 0, 119, 101, 65, 93, 94, 99, 0, 76,
0, 65, 0, 0, 61, 122, 166, 171, 0, 0,
131, 61, 122, 167, 171, 0, 0, 61, 122, 170,
168, 171, 0, 0, 131, 61, 122, 170, 169, 171,
0, 61, 122, 1, 0, 131, 61, 122, 1, 0,
63, 117, 0, 170, 100, 117, 0, 63, 1, 0,
170, 100, 1, 0, 95, 96, 0, 95, 172, 96,
0, 173, 0, 172, 173, 0, 174, 0, 175, 0,
132, 0, 165, 0, 142, 0, 149, 99, 0, 149,
1, 0, 95, 96, 0, 95, 177, 96, 0, 95,
100, 96, 0, 95, 177, 100, 96, 0, 146, 0,
177, 100, 146, 0, 177, 100, 1, 0, 95, 96,
0, 179, 181, 180, 0, 95, 0, 96, 0, 182,
0, 181, 182, 0, 183, 0, 185, 0, 132, 0,
184, 99, 0, 112, 143, 0, 131, 112, 143, 0,
187, 0, 190, 0, 194, 0, 195, 0, 206, 0,
210, 0, 187, 0, 191, 0, 196, 0, 207, 0,
211, 0, 178, 0, 188, 0, 192, 0, 197, 0,
209, 0, 217, 0, 218, 0, 219, 0, 221, 0,
220, 0, 223, 0, 99, 0, 122, 88, 0, 189,
185, 0, 122, 1, 0, 189, 186, 0, 193, 99,
0, 1, 99, 0, 1, 95, 0, 1, 96, 0,
164, 93, 1, 0, 164, 93, 94, 1, 0, 164,
93, 232, 1, 0, 164, 93, 232, 94, 1, 0,
119, 101, 65, 1, 0, 119, 101, 65, 93, 1,
0, 119, 101, 65, 93, 232, 1, 0, 119, 101,
65, 93, 232, 94, 1, 0, 119, 101, 65, 93,
94, 1, 0, 260, 0, 244, 0, 245, 0, 241,
0, 242, 0, 238, 0, 230, 0, 48, 93, 263,
94, 185, 0, 48, 1, 0, 48, 93, 1, 0,
48, 93, 263, 1, 0, 48, 93, 263, 94, 186,
56, 185, 0, 48, 93, 263, 94, 186, 56, 186,
0, 0, 199, 198, 200, 0, 68, 93, 263, 94,
0, 68, 1, 0, 68, 93, 1, 0, 68, 93,
263, 94, 1, 0, 95, 96, 0, 95, 203, 96,
0, 95, 201, 96, 0, 95, 201, 203, 96, 0,
202, 0, 201, 202, 0, 203, 181, 0, 204, 0,
203, 204, 0, 62, 264, 88, 0, 47, 88, 0,
62, 1, 0, 62, 264, 1, 0, 47, 1, 0,
66, 93, 263, 94, 0, 205, 185, 0, 66, 1,
0, 66, 93, 1, 0, 66, 93, 263, 1, 0,
205, 186, 0, 51, 0, 208, 185, 66, 93, 263,
94, 99, 0, 213, 99, 263, 99, 215, 94, 185,
0, 213, 99, 99, 215, 94, 185, 0, 213, 99,
1, 0, 213, 99, 263, 99, 1, 0, 213, 99,
99, 1, 0, 213, 99, 263, 99, 215, 94, 186,
0, 213, 99, 99, 215, 94, 186, 0, 71, 93,
0, 71, 1, 0, 71, 93, 1, 0, 212, 214,
0, 0, 216, 0, 184, 0, 216, 1, 0, 0,
216, 0, 193, 0, 216, 100, 193, 0, 216, 100,
1, 0, 54, 99, 0, 54, 122, 99, 0, 54,
1, 0, 54, 122, 1, 0, 73, 99, 0, 73,
122, 99, 0, 73, 1, 0, 73, 122, 1, 0,
58, 99, 0, 58, 263, 99, 0, 58, 1, 0,
58, 263, 1, 0, 49, 263, 99, 0, 49, 1,
0, 49, 263, 1, 0, 222, 93, 263, 94, 178,
0, 222, 93, 263, 94, 1, 0, 222, 1, 0,
222, 93, 1, 94, 0, 222, 93, 1, 0, 44,
0, 70, 178, 224, 0, 70, 178, 227, 0, 70,
178, 224, 227, 0, 70, 1, 0, 225, 0, 224,
225, 0, 226, 178, 0, 60, 93, 152, 94, 0,
60, 1, 0, 60, 93, 1, 0, 60, 93, 1,
94, 0, 64, 178, 0, 64, 1, 0, 229, 0,
233, 0, 111, 0, 76, 0, 93, 263, 94, 0,
230, 0, 237, 0, 238, 0, 239, 0, 119, 101,
67, 0, 113, 101, 67, 0, 59, 101, 67, 0,
119, 101, 76, 0, 93, 263, 1, 0, 119, 101,
1, 0, 113, 101, 1, 0, 59, 101, 1, 0,
72, 116, 93, 232, 94, 0, 72, 116, 93, 94,
0, 72, 116, 93, 232, 94, 138, 0, 72, 116,
93, 94, 138, 0, 231, 122, 93, 94, 0, 231,
122, 93, 94, 138, 0, 231, 122, 93, 232, 94,
0, 231, 122, 93, 232, 94, 138, 0, 72, 1,
99, 0, 72, 116, 1, 0, 72, 116, 93, 1,
0, 72, 116, 93, 232, 1, 0, 231, 1, 0,
231, 122, 1, 0, 119, 101, 72, 0, 228, 101,
72, 0, 263, 0, 232, 100, 263, 0, 232, 100,
1, 0, 72, 113, 234, 0, 72, 115, 234, 0,
72, 113, 234, 236, 0, 72, 115, 234, 236, 0,
72, 115, 236, 176, 0, 72, 113, 236, 176, 0,
72, 1, 98, 0, 72, 1, 97, 0, 235, 0,
234, 235, 0, 97, 263, 98, 0, 97, 263, 1,
0, 97, 1, 0, 97, 98, 0, 236, 97, 98,
0, 236, 97, 1, 0, 228, 101, 122, 0, 65,
101, 122, 0, 65, 1, 0, 119, 93, 94, 0,
119, 93, 232, 94, 0, 228, 101, 122, 93, 94,
0, 228, 101, 122, 93, 232, 94, 0, 65, 101,
122, 93, 94, 0, 65, 101, 122, 93, 232, 94,
0, 65, 101, 1, 94, 0, 65, 101, 1, 101,
0, 119, 97, 263, 98, 0, 229, 97, 263, 98,
0, 119, 97, 1, 0, 119, 97, 263, 1, 0,
229, 97, 1, 0, 229, 97, 263, 1, 0, 228,
0, 119, 0, 241, 0, 242, 0, 240, 46, 0,
240, 45, 0, 244, 0, 245, 0, 3, 243, 0,
4, 243, 0, 246, 0, 3, 1, 0, 4, 1,
0, 46, 243, 0, 46, 1, 0, 45, 243, 0,
45, 1, 0, 240, 0, 89, 243, 0, 90, 243,
0, 247, 0, 89, 1, 0, 90, 1, 0, 93,
113, 236, 94, 243, 0, 93, 113, 94, 243, 0,
93, 263, 94, 246, 0, 93, 119, 236, 94, 246,
0, 93, 113, 97, 1, 0, 93, 1, 0, 93,
113, 236, 94, 1, 0, 93, 113, 94, 1, 0,
93, 119, 236, 94, 1, 0, 243, 0, 248, 5,
243, 0, 248, 6, 243, 0, 248, 7, 243, 0,
248, 5, 1, 0, 248, 6, 1, 0, 248, 7,
1, 0, 248, 0, 249, 3, 248, 0, 249, 4,
248, 0, 249, 3, 1, 0, 249, 4, 1, 0,
249, 0, 250, 8, 249, 0, 250, 9, 249, 0,
250, 10, 249, 0, 250, 8, 1, 0, 250, 9,
1, 0, 250, 10, 1, 0, 250, 0, 251, 20,
250, 0, 251, 18, 250, 0, 251, 21, 250, 0,
251, 19, 250, 0, 251, 57, 114, 0, 251, 20,
1, 0, 251, 18, 1, 0, 251, 21, 1, 0,
251, 19, 1, 0, 251, 57, 1, 0, 251, 0,
252, 16, 251, 0, 252, 17, 251, 0, 252, 16,
1, 0, 252, 17, 1, 0, 252, 0, 253, 11,
252, 0, 253, 11, 1, 0, 253, 0, 254, 12,
253, 0, 254, 12, 1, 0, 254, 0, 255, 13,
254, 0, 255, 13, 1, 0, 255, 0, 256, 14,
255, 0, 256, 14, 1, 0, 256, 0, 257, 15,
256, 0, 257, 15, 1, 0, 257, 0, 257, 87,
263, 88, 258, 0, 257, 87, 88, 1, 0, 257,
87, 1, 0, 257, 87, 263, 88, 1, 0, 258,
0, 260, 0, 261, 262, 259, 0, 261, 262, 1,
0, 119, 0, 237, 0, 239, 0, 91, 0, 92,
0, 259, 0, 263, 0
};
#endif
#if YYDEBUG != 0
static const short yyrline[] = { 0,
266, 272, 274, 275, 276, 277, 278, 282, 284, 287,
289, 290, 293, 295, 298, 302, 306, 310, 316, 318,
320, 322, 327, 329, 332, 336, 341, 346, 348, 349,
350, 351, 352, 353, 354, 357, 362, 368, 370, 373,
376, 378, 382, 384, 387, 414, 416, 420, 433, 435,
439, 446, 447, 449, 459, 464, 479, 483, 486, 489,
492, 494, 496, 498, 502, 504, 506, 508, 512, 514,
516, 523, 529, 534, 538, 541, 545, 547, 550, 552,
553, 554, 558, 560, 561, 563, 568, 571, 581, 584,
586, 590, 593, 600, 606, 614, 616, 618, 620, 622,
626, 628, 633, 640, 641, 645, 648, 650, 652, 654,
656, 658, 660, 662, 669, 672, 674, 679, 681, 685,
690, 695, 699, 704, 706, 708, 715, 717, 719, 723,
726, 728, 732, 734, 735, 740, 745, 751, 759, 766,
769, 772, 776, 779, 783, 792, 794, 796, 801, 808,
816, 818, 822, 830, 841, 845, 848, 851, 854, 857,
860, 863, 866, 868, 872, 878, 883, 885, 889, 892,
896, 898, 901, 903, 904, 906, 910, 914, 920, 925,
930, 934, 938, 944, 946, 947, 952, 955, 959, 964,
972, 974, 977, 979, 981, 985, 989, 992, 996, 998,
999, 1000, 1001, 1002, 1012, 1014, 1015, 1016, 1017, 1020,
1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031,
1034, 1039, 1050, 1057, 1061, 1072, 1082, 1088, 1094, 1100,
1102, 1108, 1110, 1116, 1118, 1120, 1122, 1124, 1128, 1130,
1131, 1132, 1133, 1134, 1135, 1138, 1141, 1143, 1145, 1149,
1154, 1159, 1165, 1174, 1180, 1182, 1184, 1188, 1190, 1191,
1192, 1195, 1197, 1200, 1204, 1206, 1209, 1216, 1222, 1224,
1226, 1230, 1238, 1241, 1243, 1245, 1249, 1254, 1263, 1268,
1271, 1278, 1280, 1282, 1286, 1289, 1298, 1305, 1307, 1311,
1324, 1326, 1332, 1338, 1342, 1344, 1348, 1351, 1353, 1357,
1360, 1362, 1364, 1368, 1371, 1373, 1375, 1379, 1382, 1384,
1386, 1390, 1396, 1398, 1402, 1409, 1411, 1413, 1415, 1419,
1427, 1430, 1432, 1434, 1438, 1440, 1447, 1455, 1472, 1474,
1476, 1480, 1486, 1491, 1493, 1496, 1498, 1500, 1502, 1503,
1504, 1505, 1509, 1511, 1513, 1518, 1520, 1522, 1524, 1526,
1530, 1533, 1538, 1540, 1545, 1546, 1547, 1548, 1549, 1551,
1553, 1555, 1557, 1559, 1563, 1565, 1568, 1574, 1579, 1583,
1586, 1588, 1590, 1594, 1596, 1598, 1600, 1604, 1607, 1611,
1617, 1619, 1627, 1630, 1632, 1636, 1641, 1649, 1653, 1656,
1658, 1669, 1680, 1685, 1694, 1696, 1700, 1703, 1705, 1710,
1715, 1720, 1727, 1729, 1730, 1731, 1734, 1739, 1744, 1746,
1747, 1749, 1751, 1752, 1754, 1758, 1761, 1765, 1768, 1772,
1774, 1776, 1778, 1779, 1781, 1785, 1793, 1795, 1797, 1809,
1811, 1817, 1819, 1821, 1825, 1827, 1832, 1837, 1842, 1844,
1846, 1850, 1852, 1857, 1862, 1864, 1868, 1870, 1875, 1880,
1885, 1887, 1889, 1893, 1895, 1900, 1905, 1910, 1915, 1917,
1919, 1921, 1923, 1925, 1929, 1931, 1936, 1941, 1943, 1947,
1949, 1954, 1958, 1960, 1965, 1969, 1971, 1976, 1980, 1982,
1987, 1991, 1993, 1998, 2002, 2004, 2009, 2015, 2017, 2021,
2023, 2026, 2029, 2037, 2039, 2040, 2043, 2045, 2048, 2052
};
#endif
#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
static const char * const yytname[] = { "$","error","$undefined.","PLUS_TK",
"MINUS_TK","MULT_TK","DIV_TK","REM_TK","LS_TK","SRS_TK","ZRS_TK","AND_TK","XOR_TK",
"OR_TK","BOOL_AND_TK","BOOL_OR_TK","EQ_TK","NEQ_TK","GT_TK","GTE_TK","LT_TK",
"LTE_TK","PLUS_ASSIGN_TK","MINUS_ASSIGN_TK","MULT_ASSIGN_TK","DIV_ASSIGN_TK",
"REM_ASSIGN_TK","LS_ASSIGN_TK","SRS_ASSIGN_TK","ZRS_ASSIGN_TK","AND_ASSIGN_TK",
"XOR_ASSIGN_TK","OR_ASSIGN_TK","PUBLIC_TK","PRIVATE_TK","PROTECTED_TK","STATIC_TK",
"FINAL_TK","SYNCHRONIZED_TK","VOLATILE_TK","TRANSIENT_TK","NATIVE_TK","PAD_TK",
"ABSTRACT_TK","MODIFIER_TK","DECR_TK","INCR_TK","DEFAULT_TK","IF_TK","THROW_TK",
"BOOLEAN_TK","DO_TK","IMPLEMENTS_TK","THROWS_TK","BREAK_TK","IMPORT_TK","ELSE_TK",
"INSTANCEOF_TK","RETURN_TK","VOID_TK","CATCH_TK","INTERFACE_TK","CASE_TK","EXTENDS_TK",
"FINALLY_TK","SUPER_TK","WHILE_TK","CLASS_TK","SWITCH_TK","CONST_TK","TRY_TK",
"FOR_TK","NEW_TK","CONTINUE_TK","GOTO_TK","PACKAGE_TK","THIS_TK","BYTE_TK","SHORT_TK",
"INT_TK","LONG_TK","CHAR_TK","INTEGRAL_TK","FLOAT_TK","DOUBLE_TK","FP_TK","ID_TK",
"REL_QM_TK","REL_CL_TK","NOT_TK","NEG_TK","ASSIGN_ANY_TK","ASSIGN_TK","OP_TK",
"CP_TK","OCB_TK","CCB_TK","OSB_TK","CSB_TK","SC_TK","C_TK","DOT_TK","STRING_LIT_TK",
"CHAR_LIT_TK","INT_LIT_TK","FP_LIT_TK","TRUE_TK","FALSE_TK","BOOL_LIT_TK","NULL_TK",
"goal","literal","type","primitive_type","reference_type","class_or_interface_type",
"class_type","interface_type","array_type","name","simple_name","qualified_name",
"identifier","compilation_unit","import_declarations","type_declarations","package_declaration",
"import_declaration","single_type_import_declaration","type_import_on_demand_declaration",
"type_declaration","modifiers","class_declaration","@1","@2","super","interfaces",
"interface_type_list","class_body","class_body_declarations","class_body_declaration",
"class_member_declaration","field_declaration","variable_declarators","variable_declarator",
"variable_declarator_id","variable_initializer","method_declaration","@3","method_header",
"method_declarator","formal_parameter_list","formal_parameter","throws","class_type_list",
"method_body","static_initializer","static","constructor_declaration","@4","constructor_header",
"constructor_declarator","constructor_body","explicit_constructor_invocation",
"this_or_super","interface_declaration","@5","@6","@7","@8","extends_interfaces",
"interface_body","interface_member_declarations","interface_member_declaration",
"constant_declaration","abstract_method_declaration","array_initializer","variable_initializers",
"block","block_begin","block_end","block_statements","block_statement","local_variable_declaration_statement",
"local_variable_declaration","statement","statement_nsi","statement_without_trailing_substatement",
"empty_statement","label_decl","labeled_statement","labeled_statement_nsi","expression_statement",
"statement_expression","if_then_statement","if_then_else_statement","if_then_else_statement_nsi",
"switch_statement","@9","switch_expression","switch_block","switch_block_statement_groups",
"switch_block_statement_group","switch_labels","switch_label","while_expression",
"while_statement","while_statement_nsi","do_statement_begin","do_statement",
"for_statement","for_statement_nsi","for_header","for_begin","for_init","for_update",
"statement_expression_list","break_statement","continue_statement","return_statement",
"throw_statement","synchronized_statement","synchronized","try_statement","catches",
"catch_clause","catch_clause_parameter","finally","primary","primary_no_new_array",
"class_instance_creation_expression","something_dot_new","argument_list","array_creation_expression",
"dim_exprs","dim_expr","dims","field_access","method_invocation","array_access",
"postfix_expression","post_increment_expression","post_decrement_expression",
"unary_expression","pre_increment_expression","pre_decrement_expression","unary_expression_not_plus_minus",
"cast_expression","multiplicative_expression","additive_expression","shift_expression",
"relational_expression","equality_expression","and_expression","exclusive_or_expression",
"inclusive_or_expression","conditional_and_expression","conditional_or_expression",
"conditional_expression","assignment_expression","assignment","left_hand_side",
"assignment_operator","expression","constant_expression", NULL
};
#endif
static const short yyr1[] = { 0,
110, 111, 111, 111, 111, 111, 111, 112, 112, 113,
113, 113, 114, 114, 115, 116, 117, 118, 118, 118,
118, 118, 119, 119, 120, 121, 122, 123, 123, 123,
123, 123, 123, 123, 123, 124, 124, 125, 125, 126,
126, 126, 127, 127, 128, 128, 128, 129, 129, 129,
130, 130, 130, 130, 131, 131, 133, 132, 134, 132,
132, 132, 132, 132, 135, 135, 135, 135, 136, 136,
136, 137, 137, 137, 138, 138, 139, 139, 140, 140,
140, 140, 141, 141, 141, 141, 142, 142, 143, 143,
143, 144, 144, 144, 144, 145, 145, 145, 145, 145,
146, 146, 148, 147, 147, 149, 149, 149, 149, 149,
149, 149, 149, 149, 150, 150, 150, 150, 150, 151,
151, 151, 152, 152, 152, 152, 153, 153, 153, 154,
154, 154, 155, 155, 155, 156, 156, 157, 159, 158,
160, 160, 161, 161, 162, 162, 162, 162, 163, 163,
163, 163, 164, 164, 166, 165, 167, 165, 168, 165,
169, 165, 165, 165, 170, 170, 170, 170, 171, 171,
172, 172, 173, 173, 173, 173, 174, 175, 175, 176,
176, 176, 176, 177, 177, 177, 178, 178, 179, 180,
181, 181, 182, 182, 182, 183, 184, 184, 185, 185,
185, 185, 185, 185, 186, 186, 186, 186, 186, 187,
187, 187, 187, 187, 187, 187, 187, 187, 187, 187,
188, 189, 190, 190, 191, 192, 192, 192, 192, 192,
192, 192, 192, 192, 192, 192, 192, 192, 193, 193,
193, 193, 193, 193, 193, 194, 194, 194, 194, 195,
196, 198, 197, 199, 199, 199, 199, 200, 200, 200,
200, 201, 201, 202, 203, 203, 204, 204, 204, 204,
204, 205, 206, 206, 206, 206, 207, 208, 209, 210,
210, 210, 210, 210, 211, 211, 212, 212, 212, 213,
214, 214, 214, 214, 215, 215, 216, 216, 216, 217,
217, 217, 217, 218, 218, 218, 218, 219, 219, 219,
219, 220, 220, 220, 221, 221, 221, 221, 221, 222,
223, 223, 223, 223, 224, 224, 225, 226, 226, 226,
226, 227, 227, 228, 228, 229, 229, 229, 229, 229,
229, 229, 229, 229, 229, 229, 229, 229, 229, 229,
230, 230, 230, 230, 230, 230, 230, 230, 230, 230,
230, 230, 230, 230, 231, 231, 232, 232, 232, 233,
233, 233, 233, 233, 233, 233, 233, 234, 234, 235,
235, 235, 236, 236, 236, 237, 237, 237, 238, 238,
238, 238, 238, 238, 238, 238, 239, 239, 239, 239,
239, 239, 240, 240, 240, 240, 241, 242, 243, 243,
243, 243, 243, 243, 243, 244, 244, 245, 245, 246,
246, 246, 246, 246, 246, 247, 247, 247, 247, 247,
247, 247, 247, 247, 248, 248, 248, 248, 248, 248,
248, 249, 249, 249, 249, 249, 250, 250, 250, 250,
250, 250, 250, 251, 251, 251, 251, 251, 251, 251,
251, 251, 251, 251, 252, 252, 252, 252, 252, 253,
253, 253, 254, 254, 254, 255, 255, 255, 256, 256,
256, 257, 257, 257, 258, 258, 258, 258, 258, 259,
259, 260, 260, 261, 261, 261, 262, 262, 263, 264
};
static const short yyr2[] = { 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 3, 3, 3,
3, 3, 1, 1, 1, 3, 1, 0, 1, 1,
1, 2, 2, 2, 3, 1, 2, 1, 2, 3,
2, 3, 1, 1, 3, 2, 3, 5, 4, 5,
1, 1, 1, 1, 1, 2, 0, 7, 0, 6,
3, 2, 3, 4, 0, 2, 3, 2, 0, 2,
2, 1, 3, 3, 2, 3, 1, 2, 1, 1,
1, 1, 1, 1, 1, 1, 3, 4, 1, 3,
3, 1, 3, 3, 4, 1, 3, 2, 3, 3,
1, 1, 0, 3, 2, 3, 3, 4, 4, 2,
3, 2, 3, 2, 3, 4, 3, 3, 3, 1,
3, 3, 2, 3, 2, 3, 0, 2, 2, 1,
3, 3, 1, 2, 1, 2, 3, 1, 0, 3,
2, 3, 3, 4, 2, 3, 3, 4, 4, 5,
7, 6, 1, 1, 0, 4, 0, 5, 0, 5,
0, 6, 3, 4, 2, 3, 2, 3, 2, 3,
1, 2, 1, 1, 1, 1, 1, 2, 2, 2,
3, 3, 4, 1, 3, 3, 2, 3, 1, 1,
1, 2, 1, 1, 1, 2, 2, 3, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 2, 2, 2, 2, 2, 2, 2, 3,
4, 4, 5, 4, 5, 6, 7, 6, 1, 1,
1, 1, 1, 1, 1, 5, 2, 3, 4, 7,
7, 0, 3, 4, 2, 3, 5, 2, 3, 3,
4, 1, 2, 2, 1, 2, 3, 2, 2, 3,
2, 4, 2, 2, 3, 4, 2, 1, 7, 7,
6, 3, 5, 4, 7, 6, 2, 2, 3, 2,
0, 1, 1, 2, 0, 1, 1, 3, 3, 2,
3, 2, 3, 2, 3, 2, 3, 2, 3, 2,
3, 3, 2, 3, 5, 5, 2, 4, 3, 1,
3, 3, 4, 2, 1, 2, 2, 4, 2, 3,
4, 2, 2, 1, 1, 1, 1, 3, 1, 1,
1, 1, 3, 3, 3, 3, 3, 3, 3, 3,
5, 4, 6, 5, 4, 5, 5, 6, 3, 3,
4, 5, 2, 3, 3, 3, 1, 3, 3, 3,
3, 4, 4, 4, 4, 3, 3, 1, 2, 3,
3, 2, 2, 3, 3, 3, 3, 2, 3, 4,
5, 6, 5, 6, 4, 4, 4, 4, 3, 4,
3, 4, 1, 1, 1, 1, 2, 2, 1, 1,
2, 2, 1, 2, 2, 2, 2, 2, 2, 1,
2, 2, 1, 2, 2, 5, 4, 4, 5, 4,
2, 5, 4, 5, 1, 3, 3, 3, 3, 3,
3, 1, 3, 3, 3, 3, 1, 3, 3, 3,
3, 3, 3, 1, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 1, 3, 3, 3, 3, 1,
3, 3, 1, 3, 3, 1, 3, 3, 1, 3,
3, 1, 3, 3, 1, 5, 4, 3, 5, 1,
1, 3, 3, 1, 1, 1, 1, 1, 1, 1
};
static const short yydefact[] = { 0,
54, 55, 0, 0, 0, 0, 53, 1, 0, 0,
0, 36, 43, 44, 38, 0, 51, 52, 46, 27,
0, 23, 24, 25, 0, 62, 0, 41, 0, 0,
37, 39, 0, 0, 56, 0, 0, 47, 45, 0,
163, 0, 0, 159, 63, 0, 69, 42, 40, 0,
0, 0, 61, 0, 49, 0, 26, 167, 17, 165,
15, 0, 156, 0, 0, 68, 16, 0, 0, 59,
164, 0, 161, 64, 69, 50, 48, 12, 0, 10,
11, 169, 0, 8, 9, 13, 14, 15, 0, 175,
177, 0, 176, 0, 171, 173, 174, 168, 166, 160,
67, 71, 72, 70, 0, 158, 0, 57, 112, 0,
127, 110, 0, 0, 89, 92, 127, 0, 0, 0,
114, 0, 0, 179, 178, 170, 172, 0, 0, 60,
162, 0, 0, 0, 0, 107, 98, 87, 0, 0,
0, 0, 106, 21, 18, 22, 20, 19, 113, 127,
111, 0, 127, 74, 73, 55, 189, 75, 23, 0,
85, 0, 77, 79, 83, 84, 0, 80, 0, 81,
139, 127, 86, 82, 0, 58, 118, 115, 0, 0,
0, 120, 129, 130, 128, 119, 117, 91, 0, 90,
94, 0, 0, 0, 0, 0, 0, 0, 337, 0,
0, 0, 0, 6, 5, 2, 3, 4, 7, 336,
0, 404, 0, 102, 403, 334, 339, 0, 335, 340,
341, 342, 420, 405, 406, 435, 409, 410, 413, 423,
442, 447, 454, 465, 470, 473, 476, 479, 482, 485,
490, 499, 491, 0, 101, 99, 97, 100, 109, 88,
108, 187, 0, 127, 76, 78, 105, 0, 136, 0,
141, 0, 55, 0, 0, 278, 0, 0, 0, 0,
0, 0, 0, 0, 337, 0, 221, 0, 8, 404,
0, 0, 195, 0, 210, 0, 191, 193, 0, 194,
199, 211, 0, 200, 212, 0, 201, 202, 213, 252,
0, 203, 0, 214, 204, 291, 0, 215, 216, 217,
219, 218, 0, 220, 245, 244, 0, 242, 243, 240,
241, 239, 125, 123, 0, 116, 0, 0, 414, 404,
340, 342, 411, 415, 412, 419, 418, 417, 416, 0,
388, 0, 0, 0, 16, 0, 424, 421, 425, 422,
431, 0, 404, 0, 180, 0, 184, 0, 0, 0,
0, 0, 95, 0, 0, 363, 0, 408, 407, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
497, 498, 0, 143, 0, 142, 135, 104, 133, 137,
189, 140, 0, 228, 229, 227, 247, 0, 313, 0,
302, 300, 0, 310, 308, 0, 274, 0, 255, 0,
324, 0, 288, 0, 306, 304, 0, 0, 197, 0,
0, 224, 222, 0, 0, 190, 188, 192, 196, 320,
404, 223, 226, 0, 273, 0, 404, 0, 293, 297,
290, 0, 0, 317, 0, 126, 124, 122, 121, 132,
131, 350, 345, 0, 387, 377, 376, 359, 0, 370,
378, 0, 371, 0, 360, 0, 0, 0, 0, 0,
0, 347, 338, 182, 181, 0, 349, 344, 389, 0,
367, 399, 0, 348, 343, 365, 346, 366, 386, 401,
0, 364, 0, 439, 436, 440, 437, 441, 438, 445,
443, 446, 444, 451, 448, 452, 449, 453, 450, 461,
456, 463, 458, 460, 455, 462, 457, 464, 0, 459,
468, 466, 469, 467, 472, 471, 475, 474, 478, 477,
481, 480, 484, 483, 488, 0, 0, 493, 492, 144,
134, 404, 0, 0, 145, 0, 248, 0, 314, 312,
303, 301, 311, 309, 275, 0, 256, 0, 0, 0,
321, 325, 0, 322, 289, 307, 305, 338, 0, 198,
230, 0, 0, 0, 253, 0, 294, 0, 282, 0,
0, 319, 0, 395, 396, 0, 382, 383, 0, 379,
372, 0, 375, 373, 374, 361, 352, 0, 433, 427,
430, 0, 0, 428, 186, 183, 185, 390, 0, 400,
397, 0, 402, 398, 355, 0, 487, 0, 0, 146,
0, 0, 147, 249, 0, 276, 272, 0, 329, 0,
333, 332, 326, 323, 327, 234, 0, 231, 232, 0,
0, 0, 258, 0, 262, 0, 265, 0, 299, 298,
284, 0, 296, 0, 318, 0, 393, 0, 381, 380,
385, 384, 354, 362, 351, 432, 426, 434, 429, 369,
368, 391, 0, 356, 357, 489, 486, 0, 148, 0,
0, 0, 246, 0, 199, 0, 206, 207, 0, 208,
209, 0, 257, 330, 0, 235, 0, 0, 233, 271,
268, 269, 500, 0, 260, 263, 0, 259, 0, 266,
0, 0, 283, 0, 316, 315, 394, 353, 392, 358,
0, 149, 0, 0, 0, 225, 277, 0, 331, 328,
238, 236, 0, 270, 267, 261, 0, 281, 0, 0,
0, 150, 0, 250, 0, 0, 237, 279, 280, 152,
0, 0, 0, 0, 151, 0, 0, 0, 0, 286,
0, 251, 285, 0, 0, 0
};
static const short yydefgoto[] = { 774,
210, 278, 211, 85, 86, 68, 60, 87, 212, 22,
23, 24, 8, 9, 10, 11, 12, 13, 14, 15,
282, 283, 132, 105, 47, 70, 104, 130, 162, 163,
164, 91, 114, 115, 116, 213, 166, 258, 92, 111,
181, 182, 136, 185, 398, 168, 169, 170, 260, 171,
172, 402, 553, 284, 18, 43, 72, 65, 107, 44,
63, 94, 95, 96, 97, 214, 358, 285, 175, 437,
719, 287, 288, 289, 290, 694, 291, 292, 293, 294,
697, 295, 296, 297, 298, 698, 299, 444, 300, 585,
654, 655, 656, 657, 301, 302, 700, 303, 304, 305,
701, 306, 307, 451, 662, 663, 308, 309, 310, 311,
312, 313, 314, 571, 572, 573, 574, 215, 216, 217,
218, 490, 219, 470, 471, 472, 220, 221, 222, 223,
224, 225, 226, 227, 228, 229, 230, 231, 232, 233,
234, 235, 236, 237, 238, 239, 240, 241, 242, 243,
244, 393, 491, 714
};
static const short yypact[] = { 465,
-32768,-32768, 172, -63, 391, 416,-32768,-32768, 463, 205,
546,-32768,-32768,-32768,-32768, 535,-32768,-32768,-32768,-32768,
11,-32768,-32768,-32768, 295,-32768, 353,-32768, 15, 560,
-32768,-32768, 551, 630,-32768, -63, 443,-32768,-32768, 500,
-32768, 450, -51, -27,-32768, 453, 40,-32768,-32768, -63,
654, 395,-32768, 358,-32768, 24,-32768,-32768,-32768,-32768,
167, 921,-32768, 486, -51,-32768,-32768, 247, 512,-32768,
-32768, -51, -27,-32768, 40,-32768,-32768,-32768, 554,-32768,
-32768,-32768, 556, 150,-32768,-32768, 187, -44, 741,-32768,
-32768, 29,-32768, 1997,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768, 220, 262,-32768, -51,-32768,-32768, 313,
5,-32768, 484, 679,-32768, 570, 5, 66, 88, 325,
-32768, 562, 566,-32768,-32768,-32768,-32768, 637, 1188,-32768,
-32768, 262, 707, 657, 210,-32768,-32768,-32768, 662, 2015,
242, 446,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 5,
-32768, 732, 5,-32768,-32768, 366, 372,-32768, 411, 741,
-32768, 1592,-32768,-32768,-32768,-32768, 59,-32768, 448,-32768,
-32768, 466,-32768,-32768, 1807,-32768,-32768,-32768, 674, 775,
-22,-32768,-32768,-32768, 469,-32768,-32768,-32768, 579,-32768,
-32768, 2762, 2827, 2878, 2943, 473, 18, 685,-32768, 2994,
3059, 3110, 5187,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
522, 908, 81,-32768, 534, 547,-32768, 688,-32768, 621,
-32768, 743, 813,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
885, 860, 949, 891, 857, 635, 671, 656, 703, 194,
-32768,-32768,-32768, 786,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768, 843, 466,-32768,-32768,-32768, 357, 625, 650,
-32768, 449, 162, 219, 3175,-32768, 177, 2066, 20, 294,
364, 73, 390, 207, 665, 5484,-32768, -63, 378, 869,
424, 954,-32768, 706,-32768, 1739,-32768,-32768, 651,-32768,
-32768,-32768, 1875,-32768,-32768, 684,-32768,-32768,-32768,-32768,
1875,-32768, 1875,-32768,-32768, 5535, 730,-32768,-32768,-32768,
-32768,-32768, 396,-32768, 716, 751, 813, 849, 852,-32768,
-32768,-32768,-32768, 829, 691,-32768, 754, 698,-32768, 434,
-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 21,
-32768, 708, 876, 710, 710, 401,-32768,-32768,-32768,-32768,
-32768, 609, 956, 268,-32768, 719,-32768, 470, 32, 5252,
3226, 584,-32768, -40, 3291,-32768, 413,-32768,-32768, 3342,
3407, 3458, 3523, 3574, 3639, 3690, 3755, 3806, 3871, 3922,
3987, 736, 4038, 4103, 4154, 4219, 4270, 4335, 4386, 2131,
-32768,-32768, 4451,-32768, 0,-32768,-32768,-32768, 744,-32768,
-32768,-32768, 1739,-32768,-32768,-32768,-32768, 4502,-32768, 36,
-32768,-32768, 48,-32768,-32768, 89,-32768, 4567,-32768, 4618,
-32768, 641,-32768, 1328,-32768,-32768, 94, 300, 737, 2182,
557,-32768,-32768, -63, 2247,-32768,-32768,-32768,-32768,-32768,
979,-32768,-32768, 755,-32768, 780, 893, 775,-32768,-32768,
-32768, 119, 2298,-32768, 4683,-32768, 829,-32768,-32768,-32768,
-32768,-32768,-32768, 130, 761,-32768,-32768,-32768, 2363, 710,
-32768, 139, 710, 139,-32768, 2414, 4734, 250, -42, 2479,
628,-32768, 5560,-32768,-32768, 1126,-32768,-32768,-32768, 514,
-32768,-32768, 251,-32768,-32768,-32768,-32768,-32768, 773,-32768,
253,-32768, 5303,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
885,-32768, 885,-32768, 860,-32768, 860,-32768, 860,-32768,
949,-32768, 949,-32768, 949,-32768, 949,-32768, 150,-32768,
-32768, 891,-32768, 891,-32768, 857,-32768, 635,-32768, 671,
-32768, 656,-32768, 703,-32768, 867, 797,-32768,-32768,-32768,
-32768, 933, 1739, 789,-32768, 1739,-32768, 304,-32768,-32768,
-32768,-32768,-32768,-32768,-32768, 345,-32768, 806, 421, 202,
641,-32768, 448,-32768,-32768,-32768,-32768,-32768, 430, 737,
-32768, 917, 116, 371,-32768, 831,-32768, 5075,-32768, 5008,
823, 836, 839,-32768,-32768, 5368,-32768,-32768, 263,-32768,
848, 266,-32768, 848,-32768,-32768, 262, 222,-32768,-32768,
-32768, 4799, 5122,-32768,-32768,-32768,-32768,-32768, 4850,-32768,
-32768, 5419,-32768,-32768, 262, 517,-32768, 4915, 738,-32768,
1739, 2530,-32768,-32768, 1941,-32768,-32768, 231,-32768, 794,
-32768,-32768,-32768,-32768,-32768,-32768, 2595,-32768,-32768, 935,
30, 4966,-32768, 509,-32768, 1489,-32768, 5484,-32768,-32768,
-32768, 859, 846, 5033,-32768, 237,-32768, 633,-32768,-32768,
-32768,-32768,-32768,-32768, 262,-32768,-32768,-32768,-32768,-32768,
-32768,-32768, 687,-32768, 262,-32768,-32768, 440,-32768, 97,
227, 441,-32768, 907, 931, 1941,-32768,-32768, 1941,-32768,
-32768, 878,-32768, 914, 918,-32768, 1001, 236,-32768,-32768,
-32768,-32768,-32768, 342,-32768,-32768, 1562,-32768, 1671,-32768,
926, 1875,-32768, 928,-32768,-32768,-32768,-32768,-32768,-32768,
2646,-32768, 105, 4502, 1875,-32768,-32768, 2711,-32768,-32768,
-32768,-32768, 1010,-32768,-32768,-32768, 924,-32768, 1875, 136,
245,-32768, 398,-32768, 5008, 929,-32768,-32768,-32768,-32768,
160, 1941, 939, 5033,-32768, 971, 1941, 943, 1941,-32768,
1941,-32768,-32768, 1038, 1041,-32768
};
static const short yypgoto[] = {-32768,
-32768, 7, -53, 660, 87, -121, -35,-32768, -3, -75,
-32768, 134,-32768, 1033, 582,-32768, 9,-32768,-32768, 837,
17, 132,-32768,-32768, 992, 976,-32768, -126,-32768, 892,
-32768, 153, -103, 920, -172, -199,-32768,-32768, 311, 689,
808, -326, -69,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
902,-32768,-32768, 661, -54,-32768,-32768,-32768,-32768, 1014,
623,-32768, 975,-32768,-32768, 120,-32768, -124, 814, -401,
-164, -276,-32768, 767, 296, 146, -434,-32768, -358,-32768,
-32768,-32768, -271,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768, 423, 429, -442, -343,-32768,-32768,-32768,-32768,-32768,
-32768,-32768, -333,-32768, -640, 781,-32768,-32768,-32768,-32768,
-32768,-32768,-32768,-32768, 508,-32768, 519,-32768,-32768, -15,
-32768, -420,-32768, 746, 336, -248, 1100, 185, 1122, 333,
379, 425, -130, 569, 613, -469,-32768, 565, 709, 563,
567, 714, 717, 705, 718, 720,-32768, 477, 701, 690,
-32768,-32768, 42,-32768
};
#define YYLAST 5669
static const short yytable[] = { 21,
459, 555, 29, 357, 174, 176, 324, 93, 84, 438,
286, 38, 184, 614, 583, 48, 16, 31, 341, 152,
341, 462, 20, 724, 76, 16, 16, 16, 99, 124,
710, 498, 487, 103, 450, 84, 559, 174, 61, 93,
84, 31, 61, 62, 259, 20, 16, 143, 561, 16,
16, 612, 120, 159, 602, 608, 50, 134, 88, 257,
61, 333, 335, 337, 339, 61, 144, 16, 83, 348,
350, 326, 64, 421, 173, 84, 346, 327, 89, 84,
249, 363, 626, 251, 159, 88, 159, 463, 146, 563,
88, 69, 155, 550, 576, 123, 474, 648, 488, 327,
83, 135, 261, 479, 481, 709, 84, 173, 84, 39,
89, 40, -154, 49, 763, 50, 649, 711, 342, 587,
342, 279, 77, 768, 61, 88, 84, 125, 59, 88,
61, 17, 67, 399, 560, 83, 741, 25, 27, 179,
17, 17, 17, 679, 344, 160, 562, 422, 352, 180,
59, 630, 457, -103, 633, 59, 88, -103, 88, 315,
757, 17, -320, 145, 17, 17, 123, 157, 83, 52,
54, 280, 19, 57, 429, 668, 88, 411, 160, -93,
-93, 245, 17, 57, 396, 147, 325, 564, 330, 330,
330, 330, 577, 90, 61, 732, 330, 330, 353, 84,
695, 683, 641, 752, -31, 1, 461, 425, 389, 650,
186, 691, 110, 720, 59, 619, 113, -292, 588, 407,
67, 601, 674, 594, 604, 90, 708, 649, 84, 689,
595, 703, 279, 203, 760, 602, 742, 725, 556, 505,
507, 509, 246, 354, 245, 742, 118, 101, 2, 88,
611, 620, 279, 623, -320, 110, 113, 20, 765, 179,
161, 695, 20, 669, 695, 4, 671, 50, 482, 180,
315, 5, 189, 84, 720, 412, 696, 315, 88, 438,
390, 165, 280, 119, 345, 315, 617, 315, 434, 441,
315, 699, 20, 161, 417, 41, 157, 441, -66, 441,
482, 702, 447, 7, 634, 426, 410, 187, 281, 416,
751, 408, 189, 705, 165, 675, 660, 428, 450, 128,
733, 619, 448, 88, 61, -254, 619, 695, 529, 743,
580, 157, 695, 179, 695, 619, 695, 696, 761, 247,
696, -66, 744, 180, 619, 636, 610, 598, 621, 279,
624, 367, 699, 45, 438, 699, 129, 42, 74, 316,
670, 483, 702, 672, 419, 702, 330, 330, 330, 330,
330, 330, 330, 330, 330, 330, 330, 330, 88, 330,
330, 330, 330, 330, 330, 330, 418, 315, 631, -155,
423, 26, 450, 578, 84, 71, 454, 635, 634, 552,
413, 475, 493, 696, -65, 133, 501, 427, 696, -65,
696, 189, 696, 502, 67, 46, 28, 651, 699, 281,
46, 639, 148, 699, 432, 699, 281, 699, 702, 745,
646, 547, 652, 702, 281, 702, 281, 702, 637, 167,
646, 407, 438, 53, 88, 642, 248, -65, 645, 558,
58, 157, -65, 66, 434, 397, 420, 42, 189, 566,
-138, 568, -30, 1, -28, 1, 653, 252, -25, -25,
316, 493, 167, 330, 118, 465, 20, 316, 359, 330,
673, 677, 424, 450, 137, 316, 98, 316, 455, -157,
316, 762, 450, 476, 591, 57, 593, 499, 684, 279,
55, 20, 279, 253, 56, 503, 2, 317, 2, -25,
599, 433, 102, 640, -25, -25, -25, 3, 134, 3,
-25, 493, 647, 4, -25, 4, 360, 245, 20, 5,
361, 5, 731, 734, 362, 20, 281, 315, 20, 6,
315, 726, 157, 404, 405, -29, 1, 406, 728, 280,
-32, 1, 280, 318, 109, 651, 112, 494, 730, -34,
1, 7, 149, 7, 57, 485, 151, 189, 328, 486,
652, 20, 315, 340, 315, -96, 133, 279, 35, 137,
-96, -96, -96, -96, 494, 20, 84, 316, 442, 2,
30, 603, 34, 605, 2, 36, 445, 20, 446, 319,
3, 37, 279, 2, 715, 3, 4, 618, 330, 330,
685, 4, 5, 619, 51, 315, 619, 5, 317, 315,
4, 579, 359, 495, 330, 317, 5, 280, 496, -33,
1, 441, 497, 317, 364, 317, 88, 154, 317, 20,
315, 20, 20, 365, 7, 385, 179, 20, 315, 7,
495, 20, 280, -35, 1, 496, 180, 183, 7, 497,
681, 140, 188, 279, 318, 279, 141, 142, 387, 20,
-96, 318, -96, 2, 323, -96, -96, -96, -96, 318,
315, 318, 386, 315, 318, 343, 281, 100, 366, 281,
4, 456, 441, 713, 106, 441, 5, 2, 460, 721,
569, 315, 477, 315, 570, 478, 315, 177, 464, 359,
319, -495, -495, 280, 4, 280, 388, 319, 441, 315,
5, 613, 20, 400, 602, 319, 727, 319, 7, 131,
319, 441, 619, 315, 78, 317, 528, 316, 494, 315,
316, 121, 20, 320, 401, 441, 315, 20, 315, 439,
2, 315, 7, 315, 458, 315, 78, -153, 441, 20,
-339, -339, 57, 441, 281, 441, 80, 441, 281, 81,
20, 117, 316, 20, 316, 753, 20, 138, 139, 756,
729, 318, 443, 20, 35, 78, 619, 321, 80, 281,
78, 81, 20, 20, 704, -341, -341, 2, 435, 122,
178, 36, 688, 78, 495, 600, 469, 37, 600, 496,
150, 153, -339, 497, 484, 316, -339, 80, 35, 316,
81, 20, 80, 20, 78, 81, 20, 319, 453, 281,
250, 139, 281, -496, -496, 80, 139, 2, 81, 20,
316, 736, 551, 78, 737, 586, 32, -341, 316, 584,
281, -341, 281, 596, 320, 281, 80, 368, 369, 81,
20, 320, 373, 374, 322, 622, 32, 627, 281, 320,
32, 320, 383, 384, 320, 80, 391, 392, 81, 20,
316, 632, 281, 316, 628, 317, 2, 32, 317, 370,
371, 372, 78, -405, -405, 281, -406, -406, 321, 638,
281, 316, 281, 316, 281, 321, 316, 766, 378, 379,
380, 381, 770, 321, 772, 321, 773, 648, 321, 316,
317, 664, 317, 658, 80, 141, 142, 81, 20, 665,
693, 318, 666, 316, 318, 709, 394, 511, 513, 316,
521, 523, 525, 527, 602, 588, 316, 382, 316, 532,
534, 316, 722, 316, -15, 316, 375, 376, 377, -494,
-494, 360, 735, 317, 2, 430, 318, 317, 318, 431,
78, 320, 466, 467, 468, 322, 738, 319, -15, 79,
319, 4, 322, -494, -494, 360, -205, 5, 317, 430,
322, 442, 322, 362, 445, 322, 317, 35, -494, -494,
360, 741, 80, 78, 361, 81, 20, 739, 362, 318,
757, 740, 319, 318, 319, 321, 82, 748, -15, 747,
37, 749, 758, -494, -494, 360, 769, 764, 317, 430,
754, 317, 767, 629, 318, 80, 771, 775, 81, 20,
776, 530, 318, 33, 759, 75, -494, -494, 360, 317,
108, 317, 480, 256, 317, 319, 362, 693, 190, 319,
395, 254, 748, 554, 754, 73, 759, 317, 127, -494,
-494, 360, 449, 403, 318, 361, 716, 318, 643, 431,
319, 317, 717, 515, 517, 519, 452, 317, 319, 644,
473, 540, 322, 549, 317, 318, 317, 318, 536, 317,
318, 317, 538, 317, 687, 542, 0, 0, 544, 0,
0, 0, 0, 318, 0, 0, 0, 0, 0, 0,
319, 320, 0, 319, 320, 0, 615, 318, 192, 193,
0, 0, 0, 318, 0, 0, 0, 0, 0, 0,
318, 319, 318, 319, 0, 318, 319, 318, 0, 318,
0, 0, 0, 0, 0, 0, 320, 0, 320, 319,
0, 0, 0, 0, 0, 321, 0, 0, 321, 0,
194, 195, 0, 319, 0, 78, 0, 0, 0, 319,
0, 0, 0, 0, 196, 0, 319, 0, 319, 0,
197, 319, 0, 319, 0, 319, 0, 198, 0, 320,
321, 199, 321, 320, 0, 0, 0, 80, 0, 0,
81, 20, 0, 0, 200, 201, 0, 0, 202, 0,
203, 616, 0, 0, 320, 0, 0, 204, 205, 206,
207, 156, 320, 208, 209, 0, 0, 78, 0, 0,
0, 0, 322, 321, 0, 322, 79, 321, 4, 0,
0, 0, 0, 0, 5, 0, 0, 0, 0, 0,
0, 0, 0, 0, 320, 0, 0, 320, 321, 80,
0, 0, 81, 20, 0, 0, 321, 322, 0, 322,
0, 0, 157, 158, 0, 320, 0, 320, 0, 0,
320, 331, 331, 331, 331, 0, 0, 0, 0, 331,
331, 0, 0, 320, 0, 0, 0, 0, 321, 0,
0, 321, 0, 332, 332, 332, 332, 320, 0, 0,
322, 332, 332, 320, 322, 0, 0, 0, 575, 321,
320, 321, 320, 0, 321, 320, 0, 320, 0, 320,
0, 0, 0, 0, 0, 322, 0, 321, 0, 0,
0, 0, 0, 322, 0, 0, 0, 0, 0, 0,
0, 321, 0, 0, 0, 0, 0, 321, 0, 0,
0, -287, -287, -287, 321, 0, 321, -287, 0, 321,
0, 321, 0, 321, 0, 322, -287, 0, 322, 0,
0, 0, -287, 0, 0, 0, 0, 0, 0, -287,
0, 0, 0, -287, 0, 0, 322, 0, 322, -287,
0, 322, -287, -287, 0, 0, 0, 0, 0, 0,
-287, 0, 0, 0, 322, 0, -287, 0, 0, -287,
-287, -287, -287, 0, 0, -287, -287, 0, 322, 0,
0, 0, 0, 0, 322, 0, 0, 0, 0, 0,
0, 322, 0, 322, 0, 0, 322, 0, 322, 0,
322, 0, 0, 0, 0, 0, 0, 0, 0, 331,
331, 331, 331, 331, 331, 331, 331, 331, 331, 331,
331, 0, 331, 331, 331, 331, 331, 331, 331, 262,
0, 332, 332, 332, 332, 332, 332, 332, 332, 332,
332, 332, 332, 0, 332, 332, 332, 332, 332, 332,
332, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 263, 194, 195, 651, 264, 265, 78, 266,
0, 0, 267, 0, 0, 0, 268, 196, 0, 0,
652, 0, 0, 269, 270, 5, 271, 0, 272, 273,
198, 274, 262, 0, 275, 0, 0, 0, 0, 0,
80, 0, 0, 81, 20, 0, 331, 0, 0, 0,
0, 276, 331, 157, 718, 0, 0, 277, 0, 0,
204, 205, 206, 207, 0, 0, 208, 209, 332, 0,
0, 0, 0, 0, 332, 263, 194, 195, 651, 264,
265, 78, 266, 0, 0, 267, 0, 0, 0, 268,
196, 0, 0, 652, 0, 0, 269, 270, 5, 271,
0, 272, 273, 198, 274, 156, 0, 275, 0, 0,
0, 78, 0, 80, 0, 0, 81, 20, 0, 0,
79, 0, 4, 0, 276, 0, 157, 746, 5, 0,
277, 0, 0, 204, 205, 206, 207, 0, 0, 208,
209, 262, 0, 80, 0, 0, 81, 20, 0, 0,
0, 0, 0, 0, 0, 0, 157, 255, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 331, 331, 0, 263, 194, 195, -264, 264, 265,
78, 266, 0, 0, 267, 0, 0, 331, 268, 196,
0, 0, -264, 332, 332, 269, 270, 5, 271, 262,
272, 273, 198, 274, 0, 0, 275, 0, 0, 332,
0, 0, 80, 0, 0, 81, 20, 0, 0, 0,
0, 0, 0, 276, 0, 157, -264, 0, 0, 277,
0, 0, 204, 205, 206, 207, 0, 0, 208, 209,
0, 0, 263, 194, 195, 0, 264, 265, 78, 266,
0, 0, 267, 0, 0, 0, 268, 196, 0, 0,
0, 0, 0, 269, 270, 5, 271, 262, 272, 273,
198, 274, 0, 0, 275, 0, 0, 0, 0, 0,
80, 0, 0, 81, 20, 0, 0, 0, 0, 0,
0, 276, 0, 157, 436, 0, 0, 277, 0, 0,
204, 205, 206, 207, 0, 0, 208, 209, 0, 0,
263, 194, 195, 0, 264, 265, 78, 266, 0, 0,
267, 0, 0, 0, 268, 196, 0, 0, 0, 0,
0, 269, 270, 5, 271, 262, 272, 273, 198, 274,
0, 0, 275, 0, 0, 0, 0, 0, 80, 0,
0, 81, 20, 0, 0, 0, 0, 0, 0, 276,
0, 157, 0, 0, 0, 277, 0, 0, 204, 205,
206, 207, 0, 0, 208, 209, 0, 0, 440, 194,
195, 0, 264, 265, 78, 266, 0, 0, 267, 0,
0, 0, 268, 196, 0, 0, 0, 0, 0, 269,
270, 262, 271, 0, 272, 273, 198, 274, 0, 0,
275, 0, 0, 0, 0, 0, 80, 0, 0, 81,
20, 0, 0, 0, 0, 0, 0, 276, 0, 157,
0, 0, 0, 277, 0, 0, 204, 205, 206, 207,
0, 0, 208, 209, 440, 194, 195, 0, 692, 265,
78, 266, 0, 0, 267, 0, 0, 0, 268, 196,
0, 0, 0, 0, 0, 269, 270, 0, 271, 0,
272, 273, 198, 274, 0, 191, 275, 192, 193, 0,
0, 0, 80, 0, 0, 81, 20, 0, 0, 0,
0, 0, 0, 276, 0, 157, 0, 0, 0, 277,
2, 0, 204, 205, 206, 207, 78, 0, 208, 209,
0, 0, 0, 0, 0, 79, 0, 4, 0, 194,
195, 0, 0, 5, 78, 0, 414, 0, 192, 193,
0, 0, 0, 196, 0, 0, 0, 0, 80, 197,
0, 81, 20, 0, 0, 0, 198, 0, 0, 0,
199, 0, 126, 0, 0, 0, 80, 0, 0, 81,
20, 0, 0, 200, 201, 0, 0, 202, 0, 203,
194, 195, 0, 0, 0, 78, 204, 205, 206, 207,
0, 0, 208, 209, 196, 0, 0, 0, 0, 0,
197, 545, 0, 192, 193, 0, 0, 198, 0, 0,
0, 199, 0, 0, 0, 0, 0, 80, 0, 0,
81, 20, 0, 0, 200, 201, 0, 0, 202, 0,
0, 0, 0, 0, 415, 0, 0, 204, 205, 206,
207, 0, 0, 208, 209, 194, 195, 0, 0, 0,
78, 0, 492, 0, 192, 193, 0, 0, 0, 196,
0, 0, 0, 0, 0, 197, 0, 0, 0, 0,
0, 0, 198, 0, 0, 0, 199, 0, 0, 0,
0, 0, 80, 0, 0, 81, 20, 0, 546, 200,
201, 0, 0, 202, 0, 0, 194, 195, 0, 0,
0, 78, 204, 205, 206, 207, 0, 0, 208, 209,
196, 0, 0, 0, 0, 0, 197, 581, 0, 192,
193, 0, 0, 198, 0, 0, 0, 199, 0, 0,
0, 0, 0, 80, 0, 0, 81, 20, 0, 0,
200, 201, 0, 0, 202, 0, 0, 0, 0, 148,
0, 0, 0, 204, 205, 206, 207, 0, 0, 208,
209, 194, 195, 0, 0, 0, 78, 0, 589, 0,
192, 193, 0, 0, 0, 196, 0, 0, 0, 0,
0, 197, 0, 0, 0, 0, 0, 0, 198, 0,
0, 0, 199, 0, 0, 0, 0, 0, 80, 0,
0, 81, 20, 0, 0, 200, 201, 0, 0, 202,
582, 0, 194, 195, 0, 0, 0, 78, 204, 205,
206, 207, 0, 0, 208, 209, 196, 0, 0, 0,
0, 0, 197, 597, 0, 192, 193, 0, 0, 198,
0, 0, 0, 199, 0, 0, 0, 0, 0, 80,
0, 0, 81, 20, 0, 0, 200, 201, 0, 0,
202, 0, 0, 0, 0, 0, 590, 0, 0, 204,
205, 206, 207, 0, 0, 208, 209, 194, 195, 0,
0, 0, 78, 0, 606, 0, 192, 193, 0, 0,
0, 196, 0, 0, 0, 0, 0, 197, 0, 0,
0, 0, 0, 0, 198, 0, 0, 0, 199, 0,
0, 0, 0, 0, 80, 0, 0, 81, 20, 0,
0, 200, 201, 0, 0, 202, 0, 0, 194, 195,
598, 0, 0, 78, 204, 205, 206, 207, 0, 0,
208, 209, 196, 0, 0, 0, 0, 0, 197, 492,
0, 192, 193, 0, 0, 198, 0, 0, 0, 199,
0, 0, 0, 0, 0, 80, 0, 0, 81, 20,
0, 0, 200, 201, 0, 0, 202, 607, 0, 0,
0, 0, 0, 0, 0, 204, 205, 206, 207, 0,
0, 208, 209, 194, 195, 0, 0, 0, 78, 0,
581, 0, 192, 193, 0, 0, 0, 196, 0, 0,
0, 0, 0, 197, 0, 0, 0, 0, 0, 0,
198, 0, 0, 0, 199, 0, 0, 0, 0, 0,
80, 0, 0, 81, 20, 0, 0, 200, 201, 0,
0, 202, 0, 0, 194, 195, 598, 0, 0, 78,
204, 205, 206, 207, 0, 0, 208, 209, 196, 0,
0, 0, 0, 0, 197, 706, 0, 192, 193, 0,
0, 198, 0, 0, 0, 199, 0, 0, 0, 0,
0, 80, 0, 0, 81, 20, 0, 0, 200, 201,
0, 0, 202, 690, 0, 0, 0, 0, 0, 0,
0, 204, 205, 206, 207, 0, 0, 208, 209, 194,
195, 0, 0, 0, 78, 0, 706, 0, 192, 193,
0, 0, 0, 196, 0, 0, 0, 0, 0, 197,
0, 0, 0, 0, 0, 0, 198, 0, 0, 0,
199, 0, 0, 0, 0, 0, 80, 0, 0, 81,
20, 0, 0, 200, 201, 0, 0, 202, 707, 0,
194, 195, 0, 0, 0, 78, 204, 205, 206, 207,
0, 0, 208, 209, 196, 0, 0, 0, 0, 0,
197, 589, 0, 192, 193, 0, 0, 198, 0, 0,
0, 199, 0, 0, 0, 0, 0, 80, 0, 0,
81, 20, 0, 0, 200, 201, 0, 0, 202, 750,
0, 0, 0, 0, 0, 0, 0, 204, 205, 206,
207, 0, 0, 208, 209, 194, 195, 0, 0, 0,
78, 0, 329, 0, 192, 193, 0, 0, 0, 196,
0, 0, 0, 0, 0, 197, 0, 0, 0, 0,
0, 0, 198, 0, 0, 0, 199, 0, 0, 0,
0, 0, 80, 0, 0, 81, 20, 0, 0, 200,
201, 0, 0, 202, 0, 0, 194, 195, 0, 755,
0, 78, 204, 205, 206, 207, 0, 0, 208, 209,
196, 0, 0, 0, 0, 0, 197, 334, 0, 192,
193, 0, 0, 198, 0, 0, 0, 199, 0, 0,
0, 0, 0, 80, 0, 0, 81, 20, 0, 0,
200, 201, 0, 0, 202, 0, 0, 0, 0, 0,
0, 0, 0, 204, 205, 206, 207, 0, 0, 208,
209, 194, 195, 0, 0, 0, 78, 0, 336, 0,
192, 193, 0, 0, 0, 196, 0, 0, 0, 0,
0, 197, 0, 0, 0, 0, 0, 0, 198, 0,
0, 0, 199, 0, 0, 0, 0, 0, 80, 0,
0, 81, 20, 0, 0, 200, 201, 0, 0, 202,
0, 0, 194, 195, 0, 0, 0, 78, 204, 205,
206, 207, 0, 0, 208, 209, 196, 0, 0, 0,
0, 0, 197, 338, 0, 192, 193, 0, 0, 198,
0, 0, 0, 199, 0, 0, 0, 0, 0, 80,
0, 0, 81, 20, 0, 0, 200, 201, 0, 0,
202, 0, 0, 0, 0, 0, 0, 0, 0, 204,
205, 206, 207, 0, 0, 208, 209, 194, 195, 0,
0, 0, 78, 0, 347, 0, 192, 193, 0, 0,
0, 196, 0, 0, 0, 0, 0, 197, 0, 0,
0, 0, 0, 0, 198, 0, 0, 0, 199, 0,
0, 0, 0, 0, 80, 0, 0, 81, 20, 0,
0, 200, 201, 0, 0, 202, 0, 0, 194, 195,
0, 0, 0, 78, 204, 205, 206, 207, 0, 0,
208, 209, 196, 0, 0, 0, 0, 0, 197, 349,
0, 192, 193, 0, 0, 198, 0, 0, 0, 199,
0, 0, 0, 0, 0, 80, 0, 0, 81, 20,
0, 0, 200, 201, 0, 0, 202, 0, 0, 0,
0, 0, 0, 0, 0, 204, 205, 206, 207, 0,
0, 208, 209, 194, 195, 0, 0, 0, 78, 0,
351, 0, 192, 193, 0, 0, 0, 196, 0, 0,
0, 0, 0, 197, 0, 0, 0, 0, 0, 0,
198, 0, 0, 0, 199, 0, 0, 0, 0, 0,
80, 0, 0, 81, 20, 0, 0, 200, 201, 0,
0, 202, 0, 0, 194, 195, 0, 0, 0, 78,
204, 205, 206, 207, 0, 0, 208, 209, 196, 0,
0, 0, 0, 0, 197, 409, 0, 192, 193, 0,
0, 198, 0, 0, 0, 199, 0, 0, 0, 0,
0, 80, 0, 0, 81, 20, 0, 0, 200, 201,
0, 0, 202, 0, 0, 0, 0, 0, 0, 0,
0, 204, 205, 206, 207, 0, 0, 208, 209, 194,
195, 0, 0, 0, 78, 0, 492, 0, 192, 193,
0, 0, 0, 196, 0, 0, 0, 0, 0, 197,
0, 0, 0, 0, 0, 0, 198, 0, 0, 0,
199, 0, 0, 0, 0, 0, 80, 0, 0, 81,
20, 0, 0, 200, 201, 0, 0, 202, 0, 0,
194, 195, 0, 0, 0, 78, 204, 205, 206, 207,
0, 0, 208, 209, 196, 0, 0, 0, 0, 0,
197, 500, 0, 192, 193, 0, 0, 198, 0, 0,
0, 199, 0, 0, 0, 0, 0, 80, 0, 0,
81, 20, 0, 0, 200, 201, 0, 0, 202, 0,
0, 0, 0, 0, 0, 0, 0, 204, 205, 206,
207, 0, 0, 208, 209, 194, 195, 0, 0, 0,
78, 0, 504, 0, 192, 193, 0, 0, 0, 196,
0, 0, 0, 0, 0, 197, 0, 0, 0, 0,
0, 0, 198, 0, 0, 0, 199, 0, 0, 0,
0, 0, 80, 0, 0, 81, 20, 0, 0, 200,
201, 0, 0, 202, 0, 0, 194, 195, 0, 0,
0, 78, 204, 205, 206, 207, 0, 0, 208, 209,
196, 0, 0, 0, 0, 0, 197, 506, 0, 192,
193, 0, 0, 198, 0, 0, 0, 199, 0, 0,
0, 0, 0, 80, 0, 0, 81, 20, 0, 0,
200, 201, 0, 0, 202, 0, 0, 0, 0, 0,
0, 0, 0, 204, 205, 206, 207, 0, 0, 208,
209, 194, 195, 0, 0, 0, 78, 0, 508, 0,
192, 193, 0, 0, 0, 196, 0, 0, 0, 0,
0, 197, 0, 0, 0, 0, 0, 0, 198, 0,
0, 0, 199, 0, 0, 0, 0, 0, 80, 0,
0, 81, 20, 0, 0, 200, 201, 0, 0, 202,
0, 0, 194, 195, 0, 0, 0, 78, 204, 205,
206, 207, 0, 0, 208, 209, 196, 0, 0, 0,
0, 0, 197, 510, 0, 192, 193, 0, 0, 198,
0, 0, 0, 199, 0, 0, 0, 0, 0, 80,
0, 0, 81, 20, 0, 0, 200, 201, 0, 0,
202, 0, 0, 0, 0, 0, 0, 0, 0, 204,
205, 206, 207, 0, 0, 208, 209, 194, 195, 0,
0, 0, 78, 0, 512, 0, 192, 193, 0, 0,
0, 196, 0, 0, 0, 0, 0, 197, 0, 0,
0, 0, 0, 0, 198, 0, 0, 0, 199, 0,
0, 0, 0, 0, 80, 0, 0, 81, 20, 0,
0, 200, 201, 0, 0, 202, 0, 0, 194, 195,
0, 0, 0, 78, 204, 205, 206, 207, 0, 0,
208, 209, 196, 0, 0, 0, 0, 0, 197, 514,
0, 192, 193, 0, 0, 198, 0, 0, 0, 199,
0, 0, 0, 0, 0, 80, 0, 0, 81, 20,
0, 0, 200, 201, 0, 0, 202, 0, 0, 0,
0, 0, 0, 0, 0, 204, 205, 206, 207, 0,
0, 208, 209, 194, 195, 0, 0, 0, 78, 0,
516, 0, 192, 193, 0, 0, 0, 196, 0, 0,
0, 0, 0, 197, 0, 0, 0, 0, 0, 0,
198, 0, 0, 0, 199, 0, 0, 0, 0, 0,
80, 0, 0, 81, 20, 0, 0, 200, 201, 0,
0, 202, 0, 0, 194, 195, 0, 0, 0, 78,
204, 205, 206, 207, 0, 0, 208, 209, 196, 0,
0, 0, 0, 0, 197, 518, 0, 192, 193, 0,
0, 198, 0, 0, 0, 199, 0, 0, 0, 0,
0, 80, 0, 0, 81, 20, 0, 0, 200, 201,
0, 0, 202, 0, 0, 0, 0, 0, 0, 0,
0, 204, 205, 206, 207, 0, 0, 208, 209, 194,
195, 0, 0, 0, 78, 0, 520, 0, 192, 193,
0, 0, 0, 196, 0, 0, 0, 0, 0, 197,
0, 0, 0, 0, 0, 0, 198, 0, 0, 0,
199, 0, 0, 0, 0, 0, 80, 0, 0, 81,
20, 0, 0, 200, 201, 0, 0, 202, 0, 0,
194, 195, 0, 0, 0, 78, 204, 205, 206, 207,
0, 0, 208, 209, 196, 0, 0, 0, 0, 0,
197, 522, 0, 192, 193, 0, 0, 198, 0, 0,
0, 199, 0, 0, 0, 0, 0, 80, 0, 0,
81, 20, 0, 0, 200, 201, 0, 0, 202, 0,
0, 0, 0, 0, 0, 0, 0, 204, 205, 206,
207, 0, 0, 208, 209, 194, 195, 0, 0, 0,
78, 0, 524, 0, 192, 193, 0, 0, 0, 196,
0, 0, 0, 0, 0, 197, 0, 0, 0, 0,
0, 0, 198, 0, 0, 0, 199, 0, 0, 0,
0, 0, 80, 0, 0, 81, 20, 0, 0, 200,
201, 0, 0, 202, 0, 0, 194, 195, 0, 0,
0, 78, 204, 205, 206, 207, 0, 0, 208, 209,
196, 0, 0, 0, 0, 0, 197, 526, 0, 192,
193, 0, 0, 198, 0, 0, 0, 199, 0, 0,
0, 0, 0, 80, 0, 0, 81, 20, 0, 0,
200, 201, 0, 0, 202, 0, 0, 0, 0, 0,
0, 0, 0, 204, 205, 206, 207, 0, 0, 208,
209, 194, 195, 0, 0, 0, 78, 0, 531, 0,
192, 193, 0, 0, 0, 196, 0, 0, 0, 0,
0, 197, 0, 0, 0, 0, 0, 0, 198, 0,
0, 0, 199, 0, 0, 0, 0, 0, 80, 0,
0, 81, 20, 0, 0, 200, 201, 0, 0, 202,
0, 0, 194, 195, 0, 0, 0, 78, 204, 205,
206, 207, 0, 0, 208, 209, 196, 0, 0, 0,
0, 0, 197, 533, 0, 192, 193, 0, 0, 198,
0, 0, 0, 199, 0, 0, 0, 0, 0, 80,
0, 0, 81, 20, 0, 0, 200, 201, 0, 0,
202, 0, 0, 0, 0, 0, 0, 0, 0, 204,
205, 206, 207, 0, 0, 208, 209, 194, 195, 0,
0, 0, 78, 0, 535, 0, 192, 193, 0, 0,
0, 196, 0, 0, 0, 0, 0, 197, 0, 0,
0, 0, 0, 0, 198, 0, 0, 0, 199, 0,
0, 0, 0, 0, 80, 0, 0, 81, 20, 0,
0, 200, 201, 0, 0, 202, 0, 0, 194, 195,
0, 0, 0, 78, 204, 205, 206, 207, 0, 0,
208, 209, 196, 0, 0, 0, 0, 0, 197, 537,
0, 192, 193, 0, 0, 198, 0, 0, 0, 199,
0, 0, 0, 0, 0, 80, 0, 0, 81, 20,
0, 0, 200, 201, 0, 0, 202, 0, 0, 0,
0, 0, 0, 0, 0, 204, 205, 206, 207, 0,
0, 208, 209, 194, 195, 0, 0, 0, 78, 0,
539, 0, 192, 193, 0, 0, 0, 196, 0, 0,
0, 0, 0, 197, 0, 0, 0, 0, 0, 0,
198, 0, 0, 0, 199, 0, 0, 0, 0, 0,
80, 0, 0, 81, 20, 0, 0, 200, 201, 0,
0, 202, 0, 0, 194, 195, 0, 0, 0, 78,
204, 205, 206, 207, 0, 0, 208, 209, 196, 0,
0, 0, 0, 0, 197, 541, 0, 192, 193, 0,
0, 198, 0, 0, 0, 199, 0, 0, 0, 0,
0, 80, 0, 0, 81, 20, 0, 0, 200, 201,
0, 0, 202, 0, 0, 0, 0, 0, 0, 0,
0, 204, 205, 206, 207, 0, 0, 208, 209, 194,
195, 0, 0, 0, 78, 0, 543, 0, 192, 193,
0, 0, 0, 196, 0, 0, 0, 0, 0, 197,
0, 0, 0, 0, 0, 0, 198, 0, 0, 0,
199, 0, 0, 0, 0, 0, 80, 0, 0, 81,
20, 0, 0, 200, 201, 0, 0, 202, 0, 0,
194, 195, 0, 0, 0, 78, 204, 205, 206, 207,
0, 0, 208, 209, 196, 0, 0, 0, 0, 0,
197, 548, 0, 192, 193, 0, 0, 198, 0, 0,
0, 199, 0, 0, 0, 0, 0, 80, 0, 0,
81, 20, 0, 0, 200, 201, 0, 0, 202, 0,
0, 0, 0, 0, 0, 0, 0, 204, 205, 206,
207, 0, 0, 208, 209, 194, 195, 0, 0, 0,
78, 0, 557, 0, 192, 193, 0, 0, 0, 196,
0, 0, 0, 0, 0, 197, 0, 0, 0, 0,
0, 0, 198, 0, 0, 0, 199, 0, 0, 0,
0, 0, 80, 0, 0, 81, 20, 0, 0, 200,
201, 0, 0, 202, 0, 0, 194, 195, 0, 0,
0, 78, 204, 205, 206, 207, 0, 0, 208, 209,
196, 0, 0, 0, 0, 0, 197, 565, 0, 192,
193, 0, 0, 198, 0, 0, 0, 199, 0, 0,
0, 0, 0, 80, 0, 0, 81, 20, 0, 0,
200, 201, 0, 0, 202, 0, 0, 0, 0, 0,
0, 0, 0, 204, 205, 206, 207, 0, 0, 208,
209, 194, 195, 0, 0, 0, 78, 0, 567, 0,
192, 193, 0, 0, 0, 196, 0, 0, 0, 0,
0, 197, 0, 0, 0, 0, 0, 0, 198, 0,
0, 0, 199, 0, 0, 0, 0, 0, 80, 0,
0, 81, 20, 0, 0, 200, 201, 0, 0, 202,
0, 0, 194, 195, 0, 0, 0, 78, 204, 205,
206, 207, 0, 0, 208, 209, 196, 0, 0, 0,
0, 0, 197, 592, 0, 192, 193, 0, 0, 198,
0, 0, 0, 199, 0, 0, 0, 0, 0, 80,
0, 0, 81, 20, 0, 0, 200, 201, 0, 0,
202, 0, 0, 0, 0, 0, 0, 0, 0, 204,
205, 206, 207, 0, 0, 208, 209, 194, 195, 0,
0, 0, 78, 0, 609, 0, 192, 193, 0, 0,
0, 196, 0, 0, 0, 0, 0, 197, 0, 0,
0, 0, 0, 0, 198, 0, 0, 0, 199, 0,
0, 0, 0, 0, 80, 0, 0, 81, 20, 0,
0, 200, 201, 0, 0, 202, 0, 0, 194, 195,
0, 0, 0, 78, 204, 205, 206, 207, 0, 0,
208, 209, 196, 0, 0, 0, 0, 0, 197, 676,
0, 192, 193, 0, 0, 198, 0, 0, 0, 199,
0, 0, 0, 0, 0, 80, 0, 0, 81, 20,
0, 0, 200, 201, 0, 0, 202, 0, 0, 0,
0, 0, 0, 0, 0, 204, 205, 206, 207, 0,
0, 208, 209, 194, 195, 0, 0, 0, 78, 0,
680, 0, 192, 193, 0, 0, 0, 196, 0, 0,
0, 0, 0, 197, 0, 0, 0, 0, 0, 0,
198, 0, 0, 0, 199, 0, 0, 0, 0, 0,
80, 0, 0, 81, 20, 0, 0, 200, 201, 0,
0, 202, 0, 0, 194, 195, 0, 0, 0, 78,
204, 205, 206, 207, 0, 0, 208, 209, 196, 0,
0, 0, 0, 0, 197, 686, 0, 192, 193, 0,
0, 198, 0, 0, 0, 199, 0, 0, 0, 0,
0, 80, 0, 0, 81, 20, 0, 0, 200, 201,
0, 0, 202, 0, 0, 0, 0, 0, 0, 0,
0, 204, 205, 206, 207, 0, 0, 208, 209, 194,
195, 0, 0, 0, 78, 0, 712, 0, 192, 193,
0, 0, 0, 196, 0, 0, 0, 0, 0, 197,
0, 0, 0, 0, 0, 0, 198, 0, 0, 0,
199, 0, 0, 0, 0, 0, 80, 0, 0, 81,
20, 0, 0, 200, 201, 0, 0, 202, 661, 0,
194, 195, 0, 0, 0, 78, 204, 205, 206, 207,
0, 0, 208, 209, 196, 0, 0, 0, 0, 0,
197, 0, 0, 723, 0, 0, 0, 198, 0, 0,
0, 199, 0, 0, 0, 0, 0, 80, 0, 0,
81, 20, 194, 195, 200, 201, 0, 78, 202, 0,
0, 0, 0, 0, 0, 0, 196, 204, 205, 206,
207, 0, 197, 208, 209, 659, 0, 194, 195, 198,
0, 0, 78, 199, 0, 0, 0, 0, 0, 80,
0, 196, 81, 20, 0, 0, 0, 197, 0, 0,
276, -295, 0, 0, 198, 0, 0, 0, 199, 204,
205, 206, 207, 0, 80, 208, 209, 81, 20, 194,
195, 0, 678, 0, 78, 276, -295, 0, 0, 0,
0, 0, 0, 196, 204, 205, 206, 207, 0, 197,
208, 209, 0, 0, 0, 0, 198, 0, 0, 0,
199, 0, 0, 0, 0, 0, 80, 0, 0, 81,
20, 0, 0, 0, 0, 0, 0, 276, 0, 0,
0, 78, 0, 0, 0, 0, 204, 205, 206, 207,
196, 0, 208, 209, 0, 0, 197, 0, 0, 192,
193, 0, 0, 198, 0, 0, 0, 199, 0, 0,
0, 0, 0, 80, 0, 0, 81, 20, 0, 0,
200, 201, 0, 0, 202, 0, 0, 0, 0, 0,
0, 0, 0, 204, 205, 206, 207, 0, 0, 208,
209, 194, 195, 0, 0, 0, 78, 0, 0, 0,
0, 0, 0, 0, 0, 196, 0, 0, 0, 0,
0, 197, 0, 0, 192, 193, 0, 0, 198, 0,
0, 0, 199, 0, 0, 0, 0, 0, 80, 0,
0, 81, 20, 0, 0, 200, 201, 0, 0, 202,
0, 203, 355, 0, 0, 0, 356, 0, 204, 205,
206, 207, 0, 0, 208, 209, 194, 195, 0, 0,
0, 78, 0, 0, 0, 192, 193, 0, 0, 0,
196, 0, 0, 0, 0, 0, 197, 0, 0, 0,
0, 0, 0, 198, 0, 0, 0, 199, 0, 0,
0, 0, 0, 80, 0, 0, 81, 20, 0, 0,
200, 201, 0, 0, 202, 489, 0, 194, 195, 0,
0, 0, 78, 204, 205, 206, 207, 0, 0, 208,
209, 196, 0, 0, 0, 0, 0, 197, 0, 0,
192, 193, 0, 0, 198, 0, 0, 0, 199, 0,
0, 0, 0, 0, 80, 0, 0, 81, 20, 0,
0, 200, 201, 0, 0, 202, 625, 0, 0, 0,
0, 0, 0, 0, 204, 205, 206, 207, 0, 0,
208, 209, 194, 195, 0, 0, 0, 78, 0, 0,
0, 192, 193, 0, 0, 0, 196, 0, 0, 0,
0, 0, 197, 0, 0, 0, 0, 0, 0, 198,
0, 0, 0, 199, 0, 0, 0, 0, 0, 80,
0, 0, 81, 20, 0, 0, 200, 201, 0, 0,
202, 667, 0, 194, 195, 0, 0, 0, 78, 204,
205, 206, 207, 0, 0, 208, 209, 196, 0, 0,
0, 0, 0, 197, 0, 0, 192, 193, 0, 0,
198, 0, 0, 0, 199, 0, 0, 0, 0, 0,
80, 0, 0, 81, 20, 0, 0, 200, 201, 0,
0, 202, 682, 0, 0, 0, 0, 0, 0, 0,
204, 205, 206, 207, 0, 0, 208, 209, 194, 195,
0, 0, 0, 78, 0, 0, 0, 0, 0, 0,
0, 0, 196, 0, 0, 0, 0, 0, 197, 0,
0, 0, 0, 0, 0, 198, 0, 0, 0, 199,
0, 0, 0, 0, 0, 80, 0, 0, 81, 20,
0, 0, 200, 201, 0, 0, 202, 0, 2, 194,
195, 0, 0, 0, 78, 204, 205, 206, 207, 0,
0, 208, 209, 196, 0, 0, 0, 0, 0, 197,
0, 0, 0, 0, 0, 0, 198, 0, 0, 78,
199, 0, 0, 0, 0, 0, 80, 0, 196, 81,
20, 0, 0, 0, 197, 0, 0, 276, 0, 0,
0, 198, 0, 0, 0, 199, 204, 205, 206, 207,
0, 80, 208, 209, 81, 20, 0, 0, 200, 201,
0, 0, 202, 0, 0, 0, 0, 0, 0, 0,
0, 204, 205, 206, 207, 0, 0, 208, 209
};
static const short yycheck[] = { 3,
327, 403, 6, 203, 129, 132, 179, 62, 62, 286,
175, 1, 134, 483, 435, 1, 0, 9, 1, 123,
1, 1, 86, 664, 1, 9, 10, 11, 64, 1,
1, 72, 1, 69, 306, 89, 1, 162, 42, 94,
94, 33, 46, 95, 169, 86, 30, 117, 1, 33,
34, 94, 97, 129, 97, 476, 101, 53, 62, 1,
64, 192, 193, 194, 195, 69, 1, 51, 62, 200,
201, 94, 100, 1, 129, 129, 198, 100, 62, 133,
150, 1, 503, 153, 160, 89, 162, 67, 1, 1,
94, 52, 128, 94, 1, 89, 345, 1, 67, 100,
94, 97, 172, 352, 353, 1, 160, 162, 162, 99,
94, 101, 93, 99, 755, 101, 1, 88, 101, 1,
101, 175, 99, 764, 128, 129, 180, 99, 42, 133,
134, 0, 46, 258, 99, 129, 1, 4, 5, 133,
9, 10, 11, 613, 198, 129, 99, 272, 202, 133,
64, 553, 325, 95, 556, 69, 160, 99, 162, 175,
1, 30, 1, 98, 33, 34, 160, 95, 162, 36,
37, 175, 1, 40, 278, 596, 180, 1, 162, 99,
100, 140, 51, 50, 254, 98, 180, 99, 192, 193,
194, 195, 99, 62, 198, 99, 200, 201, 202, 253,
635, 622, 1, 99, 0, 1, 328, 1, 15, 94,
1, 632, 79, 656, 128, 100, 83, 99, 100, 1,
134, 470, 1, 94, 473, 94, 647, 1, 282, 631,
101, 1, 286, 95, 99, 97, 1, 1, 403, 370,
371, 372, 1, 202, 203, 1, 97, 1, 44, 253,
1, 1, 306, 1, 93, 122, 123, 86, 99, 253,
129, 696, 86, 1, 699, 61, 1, 101, 1, 253,
286, 67, 139, 327, 717, 99, 635, 293, 282, 556,
87, 129, 286, 97, 198, 301, 486, 303, 282, 293,
306, 635, 86, 162, 1, 1, 95, 301, 52, 303,
1, 635, 306, 99, 1, 99, 265, 98, 175, 268,
731, 93, 179, 640, 162, 94, 588, 276, 590, 100,
94, 100, 306, 327, 328, 95, 100, 762, 382, 94,
434, 95, 767, 327, 769, 100, 771, 696, 94, 98,
699, 95, 1, 327, 100, 1, 477, 98, 98, 403,
98, 218, 696, 1, 631, 699, 95, 63, 1, 175,
98, 94, 696, 98, 1, 699, 370, 371, 372, 373,
374, 375, 376, 377, 378, 379, 380, 381, 382, 383,
384, 385, 386, 387, 388, 389, 93, 403, 553, 95,
1, 1, 664, 94, 448, 1, 1, 94, 1, 403,
267, 1, 361, 762, 52, 93, 365, 274, 767, 52,
769, 278, 771, 1, 328, 63, 1, 47, 762, 286,
63, 1, 98, 767, 1, 769, 293, 771, 762, 88,
1, 390, 62, 767, 301, 769, 303, 771, 94, 129,
1, 1, 719, 1, 448, 570, 1, 95, 573, 408,
1, 95, 95, 1, 448, 99, 93, 63, 325, 418,
95, 420, 0, 1, 0, 1, 96, 96, 45, 46,
286, 430, 162, 477, 97, 342, 86, 293, 101, 483,
607, 612, 93, 755, 1, 301, 1, 303, 93, 95,
306, 94, 764, 93, 453, 362, 455, 364, 625, 553,
1, 86, 556, 93, 5, 93, 44, 175, 44, 86,
469, 88, 1, 93, 91, 92, 93, 55, 53, 55,
97, 480, 93, 61, 101, 61, 93, 486, 86, 67,
97, 67, 93, 93, 101, 86, 403, 553, 86, 75,
556, 666, 95, 95, 96, 0, 1, 99, 675, 553,
0, 1, 556, 175, 1, 47, 1, 1, 685, 0,
1, 99, 1, 99, 431, 96, 1, 434, 100, 100,
62, 86, 588, 101, 590, 92, 93, 631, 44, 1,
97, 98, 99, 100, 1, 86, 640, 403, 293, 44,
9, 472, 11, 474, 44, 61, 301, 86, 303, 175,
55, 67, 656, 44, 96, 55, 61, 94, 612, 613,
94, 61, 67, 100, 33, 631, 100, 67, 286, 635,
61, 65, 101, 67, 628, 293, 67, 631, 72, 0,
1, 635, 76, 301, 101, 303, 640, 1, 306, 86,
656, 86, 86, 97, 99, 11, 640, 86, 664, 99,
67, 86, 656, 0, 1, 72, 640, 1, 99, 76,
619, 92, 1, 717, 286, 719, 97, 98, 13, 86,
92, 293, 94, 44, 1, 97, 98, 99, 100, 301,
696, 303, 12, 699, 306, 1, 553, 65, 1, 556,
61, 1, 696, 652, 72, 699, 67, 44, 1, 658,
60, 717, 94, 719, 64, 97, 722, 1, 1, 101,
286, 91, 92, 717, 61, 719, 14, 293, 722, 735,
67, 94, 86, 99, 97, 301, 94, 303, 99, 107,
306, 735, 100, 749, 50, 403, 1, 553, 1, 755,
556, 1, 86, 175, 95, 749, 762, 86, 764, 99,
44, 767, 99, 769, 1, 771, 50, 93, 762, 86,
45, 46, 629, 767, 631, 769, 82, 771, 635, 85,
86, 83, 588, 86, 590, 734, 86, 99, 100, 738,
94, 403, 99, 86, 44, 50, 100, 175, 82, 656,
50, 85, 86, 86, 1, 45, 46, 44, 93, 59,
94, 61, 65, 50, 67, 470, 97, 67, 473, 72,
122, 123, 97, 76, 96, 631, 101, 82, 44, 635,
85, 86, 82, 86, 50, 85, 86, 403, 99, 696,
99, 100, 699, 91, 92, 82, 100, 44, 85, 86,
656, 696, 99, 50, 699, 66, 10, 97, 664, 95,
717, 101, 719, 93, 286, 722, 82, 45, 46, 85,
86, 293, 3, 4, 175, 93, 30, 1, 735, 301,
34, 303, 16, 17, 306, 82, 91, 92, 85, 86,
696, 93, 749, 699, 88, 553, 44, 51, 556, 5,
6, 7, 50, 45, 46, 762, 45, 46, 286, 94,
767, 717, 769, 719, 771, 293, 722, 762, 18, 19,
20, 21, 767, 301, 769, 303, 771, 1, 306, 735,
588, 99, 590, 93, 82, 97, 98, 85, 86, 94,
635, 553, 94, 749, 556, 1, 94, 373, 374, 755,
378, 379, 380, 381, 97, 100, 762, 57, 764, 383,
384, 767, 94, 769, 86, 771, 8, 9, 10, 91,
92, 93, 56, 631, 44, 97, 588, 635, 590, 101,
50, 403, 97, 98, 99, 286, 99, 553, 86, 59,
556, 61, 293, 91, 92, 93, 56, 67, 656, 97,
301, 696, 303, 101, 699, 306, 664, 44, 91, 92,
93, 1, 82, 50, 97, 85, 86, 94, 101, 631,
1, 94, 588, 635, 590, 403, 96, 722, 86, 94,
67, 94, 99, 91, 92, 93, 56, 99, 696, 97,
735, 699, 94, 101, 656, 82, 94, 0, 85, 86,
0, 382, 664, 11, 749, 54, 91, 92, 93, 717,
75, 719, 97, 162, 722, 631, 101, 762, 139, 635,
253, 160, 767, 403, 769, 52, 771, 735, 94, 91,
92, 93, 306, 260, 696, 97, 654, 699, 571, 101,
656, 749, 654, 375, 376, 377, 306, 755, 664, 571,
345, 387, 403, 393, 762, 717, 764, 719, 385, 767,
722, 769, 386, 771, 628, 388, -1, -1, 389, -1,
-1, -1, -1, 735, -1, -1, -1, -1, -1, -1,
696, 553, -1, 699, 556, -1, 1, 749, 3, 4,
-1, -1, -1, 755, -1, -1, -1, -1, -1, -1,
762, 717, 764, 719, -1, 767, 722, 769, -1, 771,
-1, -1, -1, -1, -1, -1, 588, -1, 590, 735,
-1, -1, -1, -1, -1, 553, -1, -1, 556, -1,
45, 46, -1, 749, -1, 50, -1, -1, -1, 755,
-1, -1, -1, -1, 59, -1, 762, -1, 764, -1,
65, 767, -1, 769, -1, 771, -1, 72, -1, 631,
588, 76, 590, 635, -1, -1, -1, 82, -1, -1,
85, 86, -1, -1, 89, 90, -1, -1, 93, -1,
95, 96, -1, -1, 656, -1, -1, 102, 103, 104,
105, 44, 664, 108, 109, -1, -1, 50, -1, -1,
-1, -1, 553, 631, -1, 556, 59, 635, 61, -1,
-1, -1, -1, -1, 67, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 696, -1, -1, 699, 656, 82,
-1, -1, 85, 86, -1, -1, 664, 588, -1, 590,
-1, -1, 95, 96, -1, 717, -1, 719, -1, -1,
722, 192, 193, 194, 195, -1, -1, -1, -1, 200,
201, -1, -1, 735, -1, -1, -1, -1, 696, -1,
-1, 699, -1, 192, 193, 194, 195, 749, -1, -1,
631, 200, 201, 755, 635, -1, -1, -1, 1, 717,
762, 719, 764, -1, 722, 767, -1, 769, -1, 771,
-1, -1, -1, -1, -1, 656, -1, 735, -1, -1,
-1, -1, -1, 664, -1, -1, -1, -1, -1, -1,
-1, 749, -1, -1, -1, -1, -1, 755, -1, -1,
-1, 44, 45, 46, 762, -1, 764, 50, -1, 767,
-1, 769, -1, 771, -1, 696, 59, -1, 699, -1,
-1, -1, 65, -1, -1, -1, -1, -1, -1, 72,
-1, -1, -1, 76, -1, -1, 717, -1, 719, 82,
-1, 722, 85, 86, -1, -1, -1, -1, -1, -1,
93, -1, -1, -1, 735, -1, 99, -1, -1, 102,
103, 104, 105, -1, -1, 108, 109, -1, 749, -1,
-1, -1, -1, -1, 755, -1, -1, -1, -1, -1,
-1, 762, -1, 764, -1, -1, 767, -1, 769, -1,
771, -1, -1, -1, -1, -1, -1, -1, -1, 370,
371, 372, 373, 374, 375, 376, 377, 378, 379, 380,
381, -1, 383, 384, 385, 386, 387, 388, 389, 1,
-1, 370, 371, 372, 373, 374, 375, 376, 377, 378,
379, 380, 381, -1, 383, 384, 385, 386, 387, 388,
389, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, 44, 45, 46, 47, 48, 49, 50, 51,
-1, -1, 54, -1, -1, -1, 58, 59, -1, -1,
62, -1, -1, 65, 66, 67, 68, -1, 70, 71,
72, 73, 1, -1, 76, -1, -1, -1, -1, -1,
82, -1, -1, 85, 86, -1, 477, -1, -1, -1,
-1, 93, 483, 95, 96, -1, -1, 99, -1, -1,
102, 103, 104, 105, -1, -1, 108, 109, 477, -1,
-1, -1, -1, -1, 483, 44, 45, 46, 47, 48,
49, 50, 51, -1, -1, 54, -1, -1, -1, 58,
59, -1, -1, 62, -1, -1, 65, 66, 67, 68,
-1, 70, 71, 72, 73, 44, -1, 76, -1, -1,
-1, 50, -1, 82, -1, -1, 85, 86, -1, -1,
59, -1, 61, -1, 93, -1, 95, 96, 67, -1,
99, -1, -1, 102, 103, 104, 105, -1, -1, 108,
109, 1, -1, 82, -1, -1, 85, 86, -1, -1,
-1, -1, -1, -1, -1, -1, 95, 96, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-1, 612, 613, -1, 44, 45, 46, 47, 48, 49,
50, 51, -1, -1, 54, -1, -1, 628, 58, 59,
-1, -1, 62, 612, 613, 65, 66, 67, 68, 1,
70, 71, 72, 73, -1, -1, 76, -1, -1, 628,
-1, -1, 82, -1, -1, 85, 86, -1, -1, -1,
-1, -1, -1, 93, -1, 95, 96, -1, -1, 99,
-1, -1, 102, 103, 104, 105, -1, -1, 108, 109,
-1, -1, 44, 45, 46, -1, 48, 49, 50, 51,
-1, -1, 54, -1, -1, -1, 58, 59, -1, -1,
-1, -1, -1, 65, 66, 67, 68, 1, 70, 71,
72, 73, -1, -1, 76, -1, -1, -1, -1, -1,
82, -1, -1, 85, 86, -1, -1, -1, -1, -1,
-1, 93, -1, 95, 96, -1, -1, 99, -1, -1,
102, 103, 104, 105, -1, -1, 108, 109, -1, -1,
44, 45, 46, -1, 48, 49, 50, 51, -1, -1,
54, -1, -1, -1, 58, 59, -1, -1, -1, -1,
-1, 65, 66, 67, 68, 1, 70, 71, 72, 73,
-1, -1, 76, -1, -1, -1, -1, -1, 82, -1,
-1, 85, 86, -1, -1, -1, -1, -1, -1, 93,
-1, 95, -1, -1, -1, 99, -1, -1, 102, 103,
104, 105, -1, -1, 108, 109, -1, -1, 44, 45,
46, -1, 48, 49, 50, 51, -1, -1, 54, -1,
-1, -1, 58, 59, -1, -1, -1, -1, -1, 65,
66, 1, 68, -1, 70, 71, 72, 73, -1, -1,
76, -1, -1, -1, -1, -1, 82, -1, -1, 85,
86, -1, -1, -1, -1, -1, -1, 93, -1, 95,
-1, -1, -1, 99, -1, -1, 102, 103, 104, 105,
-1, -1, 108, 109, 44, 45, 46, -1, 48, 49,
50, 51, -1, -1, 54, -1, -1, -1, 58, 59,
-1, -1, -1, -1, -1, 65, 66, -1, 68, -1,
70, 71, 72, 73, -1, 1, 76, 3, 4, -1,
-1, -1, 82, -1, -1, 85, 86, -1, -1, -1,
-1, -1, -1, 93, -1, 95, -1, -1, -1, 99,
44, -1, 102, 103, 104, 105, 50, -1, 108, 109,
-1, -1, -1, -1, -1, 59, -1, 61, -1, 45,
46, -1, -1, 67, 50, -1, 1, -1, 3, 4,
-1, -1, -1, 59, -1, -1, -1, -1, 82, 65,
-1, 85, 86, -1, -1, -1, 72, -1, -1, -1,
76, -1, 96, -1, -1, -1, 82, -1, -1, 85,
86, -1, -1, 89, 90, -1, -1, 93, -1, 95,
45, 46, -1, -1, -1, 50, 102, 103, 104, 105,
-1, -1, 108, 109, 59, -1, -1, -1, -1, -1,
65, 1, -1, 3, 4, -1, -1, 72, -1, -1,
-1, 76, -1, -1, -1, -1, -1, 82, -1, -1,
85, 86, -1, -1, 89, 90, -1, -1, 93, -1,
-1, -1, -1, -1, 99, -1, -1, 102, 103, 104,
105, -1, -1, 108, 109, 45, 46, -1, -1, -1,
50, -1, 1, -1, 3, 4, -1, -1, -1, 59,
-1, -1, -1, -1, -1, 65, -1, -1, -1, -1,
-1, -1, 72, -1, -1, -1, 76, -1, -1, -1,
-1, -1, 82, -1, -1, 85, 86, -1, 88, 89,
90, -1, -1, 93, -1, -1, 45, 46, -1, -1,
-1, 50, 102, 103, 104, 105, -1, -1, 108, 109,
59, -1, -1, -1, -1, -1, 65, 1, -1, 3,
4, -1, -1, 72, -1, -1, -1, 76, -1, -1,
-1, -1, -1, 82, -1, -1, 85, 86, -1, -1,
89, 90, -1, -1, 93, -1, -1, -1, -1, 98,
-1, -1, -1, 102, 103, 104, 105, -1, -1, 108,
109, 45, 46, -1, -1, -1, 50, -1, 1, -1,
3, 4, -1, -1, -1, 59, -1, -1, -1, -1,
-1, 65, -1, -1, -1, -1, -1, -1, 72, -1,
-1, -1, 76, -1, -1, -1, -1, -1, 82, -1,
-1, 85, 86, -1, -1, 89, 90, -1, -1, 93,
94, -1, 45, 46, -1, -1, -1, 50, 102, 103,
104, 105, -1, -1, 108, 109, 59, -1, -1, -1,
-1, -1, 65, 1, -1, 3, 4, -1, -1, 72,
-1, -1, -1, 76, -1, -1, -1, -1, -1, 82,
-1, -1, 85, 86, -1, -1, 89, 90, -1, -1,
93, -1, -1, -1, -1, -1, 99, -1, -1, 102,
103, 104, 105, -1, -1, 108, 109, 45, 46, -1,
-1, -1, 50, -1, 1, -1, 3, 4, -1, -1,
-1, 59, -1, -1, -1, -1, -1, 65, -1, -1,
-1, -1, -1, -1, 72, -1, -1, -1, 76, -1,
-1, -1, -1, -1, 82, -1, -1, 85, 86, -1,
-1, 89, 90, -1, -1, 93, -1, -1, 45, 46,
98, -1, -1, 50, 102, 103, 104, 105, -1, -1,
108, 109, 59, -1, -1, -1, -1, -1, 65, 1,
-1, 3, 4, -1, -1, 72, -1, -1, -1, 76,
-1, -1, -1, -1, -1, 82, -1, -1, 85, 86,
-1, -1, 89, 90, -1, -1, 93, 94, -1, -1,
-1, -1, -1, -1, -1, 102, 103, 104, 105, -1,
-1, 108, 109, 45, 46, -1, -1, -1, 50, -1,
1, -1, 3, 4, -1, -1, -1, 59, -1, -1,
-1, -1, -1, 65, -1, -1, -1, -1, -1, -1,
72, -1, -1, -1, 76, -1, -1, -1, -1, -1,
82, -1, -1, 85, 86, -1, -1, 89, 90, -1,
-1, 93, -1, -1, 45, 46, 98, -1, -1, 50,
102, 103, 104, 105, -1, -1, 108, 109, 59, -1,
-1, -1, -1, -1, 65, 1, -1, 3, 4, -1,
-1, 72, -1, -1, -1, 76, -1, -1, -1, -1,
-1, 82, -1, -1, 85, 86, -1, -1, 89, 90,
-1, -1, 93, 94, -1, -1, -1, -1, -1, -1,
-1, 102, 103, 104, 105, -1, -1, 108, 109, 45,
46, -1, -1, -1, 50, -1, 1, -1, 3, 4,
-1, -1, -1, 59, -1, -1, -1, -1, -1, 65,
-1, -1, -1, -1, -1, -1, 72, -1, -1, -1,
76, -1, -1, -1, -1, -1, 82, -1, -1, 85,
86, -1, -1, 89, 90, -1, -1, 93, 94, -1,
45, 46, -1, -1, -1, 50, 102, 103, 104, 105,
-1, -1, 108, 109, 59, -1, -1, -1, -1, -1,
65, 1, -1, 3, 4, -1, -1, 72, -1, -1,
-1, 76, -1, -1, -1, -1, -1, 82, -1, -1,
85, 86, -1, -1, 89, 90, -1, -1, 93, 94,
-1, -1, -1, -1, -1, -1, -1, 102, 103, 104,
105, -1, -1, 108, 109, 45, 46, -1, -1, -1,
50, -1, 1, -1, 3, 4, -1, -1, -1, 59,
-1, -1, -1, -1, -1, 65, -1, -1, -1, -1,
-1, -1, 72, -1, -1, -1, 76, -1, -1, -1,
-1, -1, 82, -1, -1, 85, 86, -1, -1, 89,
90, -1, -1, 93, -1, -1, 45, 46, -1, 99,
-1, 50, 102, 103, 104, 105, -1, -1, 108, 109,
59, -1, -1, -1, -1, -1, 65, 1, -1, 3,
4, -1, -1, 72, -1, -1, -1, 76, -1, -1,
-1, -1, -1, 82, -1, -1, 85, 86, -1, -1,
89, 90, -1, -1, 93, -1, -1, -1, -1, -1,
-1, -1, -1, 102, 103, 104, 105, -1, -1, 108,
109, 45, 46, -1, -1, -1, 50, -1, 1, -1,
3, 4, -1, -1, -1, 59, -1, -1, -1, -1,
-1, 65, -1, -1, -1, -1, -1, -1, 72, -1,
-1, -1, 76, -1, -1, -1, -1, -1, 82, -1,
-1, 85, 86, -1, -1, 89, 90, -1, -1, 93,
-1, -1, 45, 46, -1, -1, -1, 50, 102, 103,
104, 105, -1, -1, 108, 109, 59, -1, -1, -1,
-1, -1, 65, 1, -1, 3, 4, -1, -1, 72,
-1, -1, -1, 76, -1, -1, -1, -1, -1, 82,
-1, -1, 85, 86, -1, -1, 89, 90, -1, -1,
93, -1, -1, -1, -1, -1, -1, -1, -1, 102,
103, 104, 105, -1, -1, 108, 109, 45, 46, -1,
-1, -1, 50, -1, 1, -1, 3, 4, -1, -1,
-1, 59, -1, -1, -1, -1, -1, 65, -1, -1,
-1, -1, -1, -1, 72, -1, -1, -1, 76, -1,
-1, -1, -1, -1, 82, -1, -1, 85, 86, -1,
-1, 89, 90, -1, -1, 93, -1, -1, 45, 46,
-1, -1, -1, 50, 102, 103, 104, 105, -1, -1,
108, 109, 59, -1, -1, -1, -1, -1, 65, 1,
-1, 3, 4, -1, -1, 72, -1, -1, -1, 76,
-1, -1, -1, -1, -1, 82, -1, -1, 85, 86,
-1, -1, 89, 90, -1, -1, 93, -1, -1, -1,
-1, -1, -1, -1, -1, 102, 103, 104, 105, -1,
-1, 108, 109, 45, 46, -1, -1, -1, 50, -1,
1, -1, 3, 4, -1, -1, -1, 59, -1, -1,
-1, -1, -1, 65, -1, -1, -1, -1, -1, -1,
72, -1, -1, -1, 76, -1, -1, -1, -1, -1,
82, -1, -1, 85, 86, -1, -1, 89, 90, -1,
-1, 93, -1, -1, 45, 46, -1, -1, -1, 50,
102, 103, 104, 105, -1, -1, 108, 109, 59, -1,
-1, -1, -1, -1, 65, 1, -1, 3, 4, -1,
-1, 72, -1, -1, -1, 76, -1, -1, -1, -1,
-1, 82, -1, -1, 85, 86, -1, -1, 89, 90,
-1, -1, 93, -1, -1, -1, -1, -1, -1, -1,
-1, 102, 103, 104, 105, -1, -1, 108, 109, 45,
46, -1, -1, -1, 50, -1, 1, -1, 3, 4,
-1, -1, -1, 59, -1, -1, -1, -1, -1, 65,
-1, -1, -1, -1, -1, -1, 72, -1, -1, -1,
76, -1, -1, -1, -1, -1, 82, -1, -1, 85,
86, -1, -1, 89, 90, -1, -1, 93, -1, -1,
45, 46, -1, -1, -1, 50, 102, 103, 104, 105,
-1, -1, 108, 109, 59, -1, -1, -1, -1, -1,
65, 1, -1, 3, 4, -1, -1, 72, -1, -1,
-1, 76, -1, -1, -1, -1, -1, 82, -1, -1,
85, 86, -1, -1, 89, 90, -1, -1, 93, -1,
-1, -1, -1, -1, -1, -1, -1, 102, 103, 104,
105, -1, -1, 108, 109, 45, 46, -1, -1, -1,
50, -1, 1, -1, 3, 4, -1, -1, -1, 59,
-1, -1, -1, -1, -1, 65, -1, -1, -1, -1,
-1, -1, 72, -1, -1, -1, 76, -1, -1, -1,
-1, -1, 82, -1, -1, 85, 86, -1, -1, 89,
90, -1, -1, 93, -1, -1, 45, 46, -1, -1,
-1, 50, 102, 103, 104, 105, -1, -1, 108, 109,
59, -1, -1, -1, -1, -1, 65, 1, -1, 3,
4, -1, -1, 72, -1, -1, -1, 76, -1, -1,
-1, -1, -1, 82, -1, -1, 85, 86, -1, -1,
89, 90, -1, -1, 93, -1, -1, -1, -1, -1,
-1, -1, -1, 102, 103, 104, 105, -1, -1, 108,
109, 45, 46, -1, -1, -1, 50, -1, 1, -1,
3, 4, -1, -1, -1, 59, -1, -1, -1, -1,
-1, 65, -1, -1, -1, -1, -1, -1, 72, -1,
-1, -1, 76, -1, -1, -1, -1, -1, 82, -1,
-1, 85, 86, -1, -1, 89, 90, -1, -1, 93,
-1, -1, 45, 46, -1, -1, -1, 50, 102, 103,
104, 105, -1, -1, 108, 109, 59, -1, -1, -1,
-1, -1, 65, 1, -1, 3, 4, -1, -1, 72,
-1, -1, -1, 76, -1, -1, -1, -1, -1, 82,
-1, -1, 85, 86, -1, -1, 89, 90, -1, -1,
93, -1, -1, -1, -1, -1, -1, -1, -1, 102,
103, 104, 105, -1, -1, 108, 109, 45, 46, -1,
-1, -1, 50, -1, 1, -1, 3, 4, -1, -1,
-1, 59, -1, -1, -1, -1, -1, 65, -1, -1,
-1, -1, -1, -1, 72, -1, -1, -1, 76, -1,
-1, -1, -1, -1, 82, -1, -1, 85, 86, -1,
-1, 89, 90, -1, -1, 93, -1, -1, 45, 46,
-1, -1, -1, 50, 102, 103, 104, 105, -1, -1,
108, 109, 59, -1, -1, -1, -1, -1, 65, 1,
-1, 3, 4, -1, -1, 72, -1, -1, -1, 76,
-1, -1, -1, -1, -1, 82, -1, -1, 85, 86,
-1, -1, 89, 90, -1, -1, 93, -1, -1, -1,
-1, -1, -1, -1, -1, 102, 103, 104, 105, -1,
-1, 108, 109, 45, 46, -1, -1, -1, 50, -1,
1, -1, 3, 4, -1, -1, -1, 59, -1, -1,
-1, -1, -1, 65, -1, -1, -1, -1, -1, -1,
72, -1, -1, -1, 76, -1, -1, -1, -1, -1,
82, -1, -1, 85, 86, -1, -1, 89, 90, -1,
-1, 93, -1, -1, 45, 46, -1, -1, -1, 50,
102, 103, 104, 105, -1, -1, 108, 109, 59, -1,
-1, -1, -1, -1, 65, 1, -1, 3, 4, -1,
-1, 72, -1, -1, -1, 76, -1, -1, -1, -1,
-1, 82, -1, -1, 85, 86, -1, -1, 89, 90,
-1, -1, 93, -1, -1, -1, -1, -1, -1, -1,
-1, 102, 103, 104, 105, -1, -1, 108, 109, 45,
46, -1, -1, -1, 50, -1, 1, -1, 3, 4,
-1, -1, -1, 59, -1, -1, -1, -1, -1, 65,
-1, -1, -1, -1, -1, -1, 72, -1, -1, -1,
76, -1, -1, -1, -1, -1, 82, -1, -1, 85,
86, -1, -1, 89, 90, -1, -1, 93, -1, -1,
45, 46, -1, -1, -1, 50, 102, 103, 104, 105,
-1, -1, 108, 109, 59, -1, -1, -1, -1, -1,
65, 1, -1, 3, 4, -1, -1, 72, -1, -1,
-1, 76, -1, -1, -1, -1, -1, 82, -1, -1,
85, 86, -1, -1, 89, 90, -1, -1, 93, -1,
-1, -1, -1, -1, -1, -1, -1, 102, 103, 104,
105, -1, -1, 108, 109, 45, 46, -1, -1, -1,
50, -1, 1, -1, 3, 4, -1, -1, -1, 59,
-1, -1, -1, -1, -1, 65, -1, -1, -1, -1,
-1, -1, 72, -1, -1, -1, 76, -1, -1, -1,
-1, -1, 82, -1, -1, 85, 86, -1, -1, 89,
90, -1, -1, 93, -1, -1, 45, 46, -1, -1,
-1, 50, 102, 103, 104, 105, -1, -1, 108, 109,
59, -1, -1, -1, -1, -1, 65, 1, -1, 3,
4, -1, -1, 72, -1, -1, -1, 76, -1, -1,
-1, -1, -1, 82, -1, -1, 85, 86, -1, -1,
89, 90, -1, -1, 93, -1, -1, -1, -1, -1,
-1, -1, -1, 102, 103, 104, 105, -1, -1, 108,
109, 45, 46, -1, -1, -1, 50, -1, 1, -1,
3, 4, -1, -1, -1, 59, -1, -1, -1, -1,
-1, 65, -1, -1, -1, -1, -1, -1, 72, -1,
-1, -1, 76, -1, -1, -1, -1, -1, 82, -1,
-1, 85, 86, -1, -1, 89, 90, -1, -1, 93,
-1, -1, 45, 46, -1, -1, -1, 50, 102, 103,
104, 105, -1, -1, 108, 109, 59, -1, -1, -1,
-1, -1, 65, 1, -1, 3, 4, -1, -1, 72,
-1, -1, -1, 76, -1, -1, -1, -1, -1, 82,
-1, -1, 85, 86, -1, -1, 89, 90, -1, -1,
93, -1, -1, -1, -1, -1, -1, -1, -1, 102,
103, 104, 105, -1, -1, 108, 109, 45, 46, -1,
-1, -1, 50, -1, 1, -1, 3, 4, -1, -1,
-1, 59, -1, -1, -1, -1, -1, 65, -1, -1,
-1, -1, -1, -1, 72, -1, -1, -1, 76, -1,
-1, -1, -1, -1, 82, -1, -1, 85, 86, -1,
-1, 89, 90, -1, -1, 93, -1, -1, 45, 46,
-1, -1, -1, 50, 102, 103, 104, 105, -1, -1,
108, 109, 59, -1, -1, -1, -1, -1, 65, 1,
-1, 3, 4, -1, -1, 72, -1, -1, -1, 76,
-1, -1, -1, -1, -1, 82, -1, -1, 85, 86,
-1, -1, 89, 90, -1, -1, 93, -1, -1, -1,
-1, -1, -1, -1, -1, 102, 103, 104, 105, -1,
-1, 108, 109, 45, 46, -1, -1, -1, 50, -1,
1, -1, 3, 4, -1, -1, -1, 59, -1, -1,
-1, -1, -1, 65, -1, -1, -1, -1, -1, -1,
72, -1, -1, -1, 76, -1, -1, -1, -1, -1,
82, -1, -1, 85, 86, -1, -1, 89, 90, -1,
-1, 93, -1, -1, 45, 46, -1, -1, -1, 50,
102, 103, 104, 105, -1, -1, 108, 109, 59, -1,
-1, -1, -1, -1, 65, 1, -1, 3, 4, -1,
-1, 72, -1, -1, -1, 76, -1, -1, -1, -1,
-1, 82, -1, -1, 85, 86, -1, -1, 89, 90,
-1, -1, 93, -1, -1, -1, -1, -1, -1, -1,
-1, 102, 103, 104, 105, -1, -1, 108, 109, 45,
46, -1, -1, -1, 50, -1, 1, -1, 3, 4,
-1, -1, -1, 59, -1, -1, -1, -1, -1, 65,
-1, -1, -1, -1, -1, -1, 72, -1, -1, -1,
76, -1, -1, -1, -1, -1, 82, -1, -1, 85,
86, -1, -1, 89, 90, -1, -1, 93, -1, -1,
45, 46, -1, -1, -1, 50, 102, 103, 104, 105,
-1, -1, 108, 109, 59, -1, -1, -1, -1, -1,
65, 1, -1, 3, 4, -1, -1, 72, -1, -1,
-1, 76, -1, -1, -1, -1, -1, 82, -1, -1,
85, 86, -1, -1, 89, 90, -1, -1, 93, -1,
-1, -1, -1, -1, -1, -1, -1, 102, 103, 104,
105, -1, -1, 108, 109, 45, 46, -1, -1, -1,
50, -1, 1, -1, 3, 4, -1, -1, -1, 59,
-1, -1, -1, -1, -1, 65, -1, -1, -1, -1,
-1, -1, 72, -1, -1, -1, 76, -1, -1, -1,
-1, -1, 82, -1, -1, 85, 86, -1, -1, 89,
90, -1, -1, 93, -1, -1, 45, 46, -1, -1,
-1, 50, 102, 103, 104, 105, -1, -1, 108, 109,
59, -1, -1, -1, -1, -1, 65, 1, -1, 3,
4, -1, -1, 72, -1, -1, -1, 76, -1, -1,
-1, -1, -1, 82, -1, -1, 85, 86, -1, -1,
89, 90, -1, -1, 93, -1, -1, -1, -1, -1,
-1, -1, -1, 102, 103, 104, 105, -1, -1, 108,
109, 45, 46, -1, -1, -1, 50, -1, 1, -1,
3, 4, -1, -1, -1, 59, -1, -1, -1, -1,
-1, 65, -1, -1, -1, -1, -1, -1, 72, -1,
-1, -1, 76, -1, -1, -1, -1, -1, 82, -1,
-1, 85, 86, -1, -1, 89, 90, -1, -1, 93,
-1, -1, 45, 46, -1, -1, -1, 50, 102, 103,
104, 105, -1, -1, 108, 109, 59, -1, -1, -1,
-1, -1, 65, 1, -1, 3, 4, -1, -1, 72,
-1, -1, -1, 76, -1, -1, -1, -1, -1, 82,
-1, -1, 85, 86, -1, -1, 89, 90, -1, -1,
93, -1, -1, -1, -1, -1, -1, -1, -1, 102,
103, 104, 105, -1, -1, 108, 109, 45, 46, -1,
-1, -1, 50, -1, 1, -1, 3, 4, -1, -1,
-1, 59, -1, -1, -1, -1, -1, 65, -1, -1,
-1, -1, -1, -1, 72, -1, -1, -1, 76, -1,
-1, -1, -1, -1, 82, -1, -1, 85, 86, -1,
-1, 89, 90, -1, -1, 93, -1, -1, 45, 46,
-1, -1, -1, 50, 102, 103, 104, 105, -1, -1,
108, 109, 59, -1, -1, -1, -1, -1, 65, 1,
-1, 3, 4, -1, -1, 72, -1, -1, -1, 76,
-1, -1, -1, -1, -1, 82, -1, -1, 85, 86,
-1, -1, 89, 90, -1, -1, 93, -1, -1, -1,
-1, -1, -1, -1, -1, 102, 103, 104, 105, -1,
-1, 108, 109, 45, 46, -1, -1, -1, 50, -1,
1, -1, 3, 4, -1, -1, -1, 59, -1, -1,
-1, -1, -1, 65, -1, -1, -1, -1, -1, -1,
72, -1, -1, -1, 76, -1, -1, -1, -1, -1,
82, -1, -1, 85, 86, -1, -1, 89, 90, -1,
-1, 93, -1, -1, 45, 46, -1, -1, -1, 50,
102, 103, 104, 105, -1, -1, 108, 109, 59, -1,
-1, -1, -1, -1, 65, 1, -1, 3, 4, -1,
-1, 72, -1, -1, -1, 76, -1, -1, -1, -1,
-1, 82, -1, -1, 85, 86, -1, -1, 89, 90,
-1, -1, 93, -1, -1, -1, -1, -1, -1, -1,
-1, 102, 103, 104, 105, -1, -1, 108, 109, 45,
46, -1, -1, -1, 50, -1, 1, -1, 3, 4,
-1, -1, -1, 59, -1, -1, -1, -1, -1, 65,
-1, -1, -1, -1, -1, -1, 72, -1, -1, -1,
76, -1, -1, -1, -1, -1, 82, -1, -1, 85,
86, -1, -1, 89, 90, -1, -1, 93, 1, -1,
45, 46, -1, -1, -1, 50, 102, 103, 104, 105,
-1, -1, 108, 109, 59, -1, -1, -1, -1, -1,
65, -1, -1, 1, -1, -1, -1, 72, -1, -1,
-1, 76, -1, -1, -1, -1, -1, 82, -1, -1,
85, 86, 45, 46, 89, 90, -1, 50, 93, -1,
-1, -1, -1, -1, -1, -1, 59, 102, 103, 104,
105, -1, 65, 108, 109, 1, -1, 45, 46, 72,
-1, -1, 50, 76, -1, -1, -1, -1, -1, 82,
-1, 59, 85, 86, -1, -1, -1, 65, -1, -1,
93, 94, -1, -1, 72, -1, -1, -1, 76, 102,
103, 104, 105, -1, 82, 108, 109, 85, 86, 45,
46, -1, 1, -1, 50, 93, 94, -1, -1, -1,
-1, -1, -1, 59, 102, 103, 104, 105, -1, 65,
108, 109, -1, -1, -1, -1, 72, -1, -1, -1,
76, -1, -1, -1, -1, -1, 82, -1, -1, 85,
86, -1, -1, -1, -1, -1, -1, 93, -1, -1,
-1, 50, -1, -1, -1, -1, 102, 103, 104, 105,
59, -1, 108, 109, -1, -1, 65, -1, -1, 3,
4, -1, -1, 72, -1, -1, -1, 76, -1, -1,
-1, -1, -1, 82, -1, -1, 85, 86, -1, -1,
89, 90, -1, -1, 93, -1, -1, -1, -1, -1,
-1, -1, -1, 102, 103, 104, 105, -1, -1, 108,
109, 45, 46, -1, -1, -1, 50, -1, -1, -1,
-1, -1, -1, -1, -1, 59, -1, -1, -1, -1,
-1, 65, -1, -1, 3, 4, -1, -1, 72, -1,
-1, -1, 76, -1, -1, -1, -1, -1, 82, -1,
-1, 85, 86, -1, -1, 89, 90, -1, -1, 93,
-1, 95, 96, -1, -1, -1, 100, -1, 102, 103,
104, 105, -1, -1, 108, 109, 45, 46, -1, -1,
-1, 50, -1, -1, -1, 3, 4, -1, -1, -1,
59, -1, -1, -1, -1, -1, 65, -1, -1, -1,
-1, -1, -1, 72, -1, -1, -1, 76, -1, -1,
-1, -1, -1, 82, -1, -1, 85, 86, -1, -1,
89, 90, -1, -1, 93, 94, -1, 45, 46, -1,
-1, -1, 50, 102, 103, 104, 105, -1, -1, 108,
109, 59, -1, -1, -1, -1, -1, 65, -1, -1,
3, 4, -1, -1, 72, -1, -1, -1, 76, -1,
-1, -1, -1, -1, 82, -1, -1, 85, 86, -1,
-1, 89, 90, -1, -1, 93, 94, -1, -1, -1,
-1, -1, -1, -1, 102, 103, 104, 105, -1, -1,
108, 109, 45, 46, -1, -1, -1, 50, -1, -1,
-1, 3, 4, -1, -1, -1, 59, -1, -1, -1,
-1, -1, 65, -1, -1, -1, -1, -1, -1, 72,
-1, -1, -1, 76, -1, -1, -1, -1, -1, 82,
-1, -1, 85, 86, -1, -1, 89, 90, -1, -1,
93, 94, -1, 45, 46, -1, -1, -1, 50, 102,
103, 104, 105, -1, -1, 108, 109, 59, -1, -1,
-1, -1, -1, 65, -1, -1, 3, 4, -1, -1,
72, -1, -1, -1, 76, -1, -1, -1, -1, -1,
82, -1, -1, 85, 86, -1, -1, 89, 90, -1,
-1, 93, 94, -1, -1, -1, -1, -1, -1, -1,
102, 103, 104, 105, -1, -1, 108, 109, 45, 46,
-1, -1, -1, 50, -1, -1, -1, -1, -1, -1,
-1, -1, 59, -1, -1, -1, -1, -1, 65, -1,
-1, -1, -1, -1, -1, 72, -1, -1, -1, 76,
-1, -1, -1, -1, -1, 82, -1, -1, 85, 86,
-1, -1, 89, 90, -1, -1, 93, -1, 44, 45,
46, -1, -1, -1, 50, 102, 103, 104, 105, -1,
-1, 108, 109, 59, -1, -1, -1, -1, -1, 65,
-1, -1, -1, -1, -1, -1, 72, -1, -1, 50,
76, -1, -1, -1, -1, -1, 82, -1, 59, 85,
86, -1, -1, -1, 65, -1, -1, 93, -1, -1,
-1, 72, -1, -1, -1, 76, 102, 103, 104, 105,
-1, 82, 108, 109, 85, 86, -1, -1, 89, 90,
-1, -1, 93, -1, -1, -1, -1, -1, -1, -1,
-1, 102, 103, 104, 105, -1, -1, 108, 109
};
#define YYPURE 1
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
#line 3 "/usr/cygnus/gnupro-98r1/share/bison.simple"
/* Skeleton output parser for bison,
Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
/* As a special exception, when this file is copied by Bison into a
Bison output file, you may use that output file without restriction.
This special exception was added by the Free Software Foundation
in version 1.24 of Bison. */
#ifndef alloca
#ifdef __GNUC__
#define alloca __builtin_alloca
#else /* not GNU C. */
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
#include <alloca.h>
#else /* not sparc */
#if defined (MSDOS) && !defined (__TURBOC__)
#include <malloc.h>
#else /* not MSDOS, or __TURBOC__ */
#if defined(_AIX)
#include <malloc.h>
#pragma alloca
#else /* not MSDOS, __TURBOC__, or _AIX */
#ifdef __hpux
#ifdef __cplusplus
extern "C" {
void *alloca (unsigned int);
};
#else /* not __cplusplus */
void *alloca ();
#endif /* not __cplusplus */
#endif /* __hpux */
#endif /* not _AIX */
#endif /* not MSDOS, or __TURBOC__ */
#endif /* not sparc. */
#endif /* not GNU C. */
#endif /* alloca not defined. */
/* This is the parser code that is written into each bison parser
when the %semantic_parser declaration is not specified in the grammar.
It was written by Richard Stallman by simplifying the hairy parser
used when %semantic_parser is specified. */
/* Note: there must be only one dollar sign in this file.
It is replaced by the list of actions, each action
as one case of the switch. */
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY -2
#define YYEOF 0
#define YYACCEPT return(0)
#define YYABORT return(1)
#define YYERROR goto yyerrlab1
/* Like YYERROR except do call yyerror.
This remains here temporarily to ease the
transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
#define YYFAIL goto yyerrlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(token, value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
{ yychar = (token), yylval = (value); \
yychar1 = YYTRANSLATE (yychar); \
YYPOPSTACK; \
goto yybackup; \
} \
else \
{ yyerror ("syntax error: cannot back up"); YYERROR; } \
while (0)
#define YYTERROR 1
#define YYERRCODE 256
#ifndef YYPURE
#define YYLEX yylex()
#endif
#ifdef YYPURE
#ifdef YYLSP_NEEDED
#ifdef YYLEX_PARAM
#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
#else
#define YYLEX yylex(&yylval, &yylloc)
#endif
#else /* not YYLSP_NEEDED */
#ifdef YYLEX_PARAM
#define YYLEX yylex(&yylval, YYLEX_PARAM)
#else
#define YYLEX yylex(&yylval)
#endif
#endif /* not YYLSP_NEEDED */
#endif
/* If nonreentrant, generate the variables here */
#ifndef YYPURE
int yychar; /* the lookahead symbol */
YYSTYPE yylval; /* the semantic value of the */
/* lookahead symbol */
#ifdef YYLSP_NEEDED
YYLTYPE yylloc; /* location data for the lookahead */
/* symbol */
#endif
int yynerrs; /* number of parse errors so far */
#endif /* not YYPURE */
#if YYDEBUG != 0
int yydebug; /* nonzero means print parse trace */
/* Since this is uninitialized, it does not stop multiple parsers
from coexisting. */
#endif
/* YYINITDEPTH indicates the initial size of the parser's stacks */
#ifndef YYINITDEPTH
#define YYINITDEPTH 200
#endif
/* YYMAXDEPTH is the maximum size the stacks can grow to
(effective only if the built-in stack extension method is used). */
#if YYMAXDEPTH == 0
#undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
#define YYMAXDEPTH 10000
#endif
/* Prevent warning if -Wstrict-prototypes. */
#ifdef __GNUC__
int yyparse (void);
#endif
#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
#else /* not GNU C or C++ */
#ifndef __cplusplus
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_memcpy (to, from, count)
char *to;
char *from;
int count;
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#else /* __cplusplus */
/* This is the most reliable way to avoid incompatibilities
in available built-in functions on various systems. */
static void
__yy_memcpy (char *to, char *from, int count)
{
register char *f = from;
register char *t = to;
register int i = count;
while (i-- > 0)
*t++ = *f++;
}
#endif
#endif
#line 196 "/usr/cygnus/gnupro-98r1/share/bison.simple"
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
into yyparse. The argument should have type void *.
It should actually point to an object.
Grammar actions can access the variable by casting it
to the proper pointer type. */
#ifdef YYPARSE_PARAM
#ifdef __cplusplus
#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
#define YYPARSE_PARAM_DECL
#else /* not __cplusplus */
#define YYPARSE_PARAM_ARG YYPARSE_PARAM
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
#endif /* not __cplusplus */
#else /* not YYPARSE_PARAM */
#define YYPARSE_PARAM_ARG
#define YYPARSE_PARAM_DECL
#endif /* not YYPARSE_PARAM */
int
yyparse(YYPARSE_PARAM_ARG)
YYPARSE_PARAM_DECL
{
register int yystate;
register int yyn;
register short *yyssp;
register YYSTYPE *yyvsp;
int yyerrstatus; /* number of tokens to shift before error messages enabled */
int yychar1 = 0; /* lookahead token as an internal (translated) token number */
short yyssa[YYINITDEPTH]; /* the state stack */
YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
short *yyss = yyssa; /* refer to the stacks thru separate pointers */
YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
#ifdef YYLSP_NEEDED
YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
#else
#define YYPOPSTACK (yyvsp--, yyssp--)
#endif
int yystacksize = YYINITDEPTH;
#ifdef YYPURE
int yychar;
YYSTYPE yylval;
int yynerrs;
#ifdef YYLSP_NEEDED
YYLTYPE yylloc;
#endif
#endif
YYSTYPE yyval; /* the variable used to return */
/* semantic values from the action */
/* routines */
int yylen;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Starting parse\n");
#endif
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
/* Initialize stack pointers.
Waste one element of value and location stack
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
yyssp = yyss - 1;
yyvsp = yyvs;
#ifdef YYLSP_NEEDED
yylsp = yyls;
#endif
/* Push a new state, which is found in yystate . */
/* In all cases, when you get here, the value and location stacks
have just been pushed. so pushing a state here evens the stacks. */
yynewstate:
*++yyssp = yystate;
if (yyssp >= yyss + yystacksize - 1)
{
/* Give user a chance to reallocate the stack */
/* Use copies of these so that the &'s don't force the real ones into memory. */
YYSTYPE *yyvs1 = yyvs;
short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
#endif
/* Get the current used size of the three stacks, in elements. */
int size = yyssp - yyss + 1;
#ifdef yyoverflow
/* Each stack pointer address is followed by the size of
the data in use in that stack, in bytes. */
#ifdef YYLSP_NEEDED
/* This used to be a conditional around just the two extra args,
but that might be undefined if yyoverflow is a macro. */
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yyls1, size * sizeof (*yylsp),
&yystacksize);
#else
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yystacksize);
#endif
yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
yyls = yyls1;
#endif
#else /* no yyoverflow */
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
{
yyerror("parser stack overflow");
return 2;
}
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
__yy_memcpy ((char *)yyss, (char *)yyss1, size * sizeof (*yyssp));
yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
__yy_memcpy ((char *)yyvs, (char *)yyvs1, size * sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
__yy_memcpy ((char *)yyls, (char *)yyls1, size * sizeof (*yylsp));
#endif
#endif /* no yyoverflow */
yyssp = yyss + size - 1;
yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
yylsp = yyls + size - 1;
#endif
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Entering state %d\n", yystate);
#endif
goto yybackup;
yybackup:
/* Do appropriate processing given the current state. */
/* Read a lookahead token if we need one and don't already have one. */
/* yyresume: */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* yychar is either YYEMPTY or YYEOF
or a valid token in external form. */
if (yychar == YYEMPTY)
{
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Reading a token: ");
#endif
yychar = YYLEX;
}
/* Convert token to internal form (in yychar1) for indexing tables with */
if (yychar <= 0) /* This means end of input. */
{
yychar1 = 0;
yychar = YYEOF; /* Don't call YYLEX any more */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Now at end of input.\n");
#endif
}
else
{
yychar1 = YYTRANSLATE(yychar);
#if YYDEBUG != 0
if (yydebug)
{
fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
/* Give the individual parser a way to print the precise meaning
of a token, for further debugging info. */
#ifdef YYPRINT
YYPRINT (stderr, yychar, yylval);
#endif
fprintf (stderr, ")\n");
}
#endif
}
yyn += yychar1;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
goto yydefault;
yyn = yytable[yyn];
/* yyn is what to do for this token type in this state.
Negative => reduce, -yyn is rule number.
Positive => shift, yyn is new state.
New state is final state => don't bother to shift,
just return success.
0, or most negative number => error. */
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrlab;
if (yyn == YYFINAL)
YYACCEPT;
/* Shift the lookahead token. */
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
#endif
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
/* count tokens shifted since error; after three, turn off error status. */
if (yyerrstatus) yyerrstatus--;
yystate = yyn;
goto yynewstate;
/* Do the default action for the current state. */
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
/* Do a reduction. yyn is the number of a rule to reduce with. */
yyreduce:
yylen = yyr2[yyn];
if (yylen > 0)
yyval = yyvsp[1-yylen]; /* implement default value of the action */
#if YYDEBUG != 0
if (yydebug)
{
int i;
fprintf (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn) {
case 1:
#line 268 "./parse.y"
{;
break;}
case 18:
#line 312 "./parse.y"
{
yyval.node = build_java_array_type (yyvsp[-2].node, -1);
CLASS_LOADED_P (yyval.node) = 1;
;
break;}
case 19:
#line 317 "./parse.y"
{ yyval.node = build_unresolved_array_type (yyvsp[-2].node); ;
break;}
case 20:
#line 319 "./parse.y"
{ yyval.node = build_unresolved_array_type (yyvsp[-2].node); ;
break;}
case 21:
#line 321 "./parse.y"
{RULE ("']' expected"); RECOVER;;
break;}
case 22:
#line 323 "./parse.y"
{RULE ("']' expected"); RECOVER;;
break;}
case 26:
#line 338 "./parse.y"
{ yyval.node = make_qualified_name (yyvsp[-2].node, yyvsp[0].node, yyvsp[-1].operator.location); ;
break;}
case 28:
#line 347 "./parse.y"
{yyval.node = NULL;;
break;}
case 36:
#line 359 "./parse.y"
{
yyval.node = NULL;
;
break;}
case 37:
#line 363 "./parse.y"
{
yyval.node = NULL;
;
break;}
case 40:
#line 375 "./parse.y"
{ ctxp->package = EXPR_WFL_NODE (yyvsp[-1].node); ;
break;}
case 41:
#line 377 "./parse.y"
{yyerror ("Missing name"); RECOVER;;
break;}
case 42:
#line 379 "./parse.y"
{yyerror ("';' expected"); RECOVER;;
break;}
case 45:
#line 389 "./parse.y"
{
tree name = EXPR_WFL_NODE (yyvsp[-1].node), node, last_name;
int i = IDENTIFIER_LENGTH (name)-1;
char *last = &IDENTIFIER_POINTER (name)[i];
while (last != IDENTIFIER_POINTER (name))
{
if (last [0] == '.')
break;
last--;
}
last_name = get_identifier (++last);
if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (last_name))
{
tree err = find_name_in_single_imports (last_name);
if (err && err != name)
parse_error_context
(yyvsp[-1].node, "Ambiguous class: `%s' and `%s'",
IDENTIFIER_POINTER (name),
IDENTIFIER_POINTER (err));
else
REGISTER_IMPORT (yyvsp[-1].node, last_name)
}
else
REGISTER_IMPORT (yyvsp[-1].node, last_name);
;
break;}
case 46:
#line 415 "./parse.y"
{yyerror ("Missing name"); RECOVER;;
break;}
case 47:
#line 417 "./parse.y"
{yyerror ("';' expected"); RECOVER;;
break;}
case 48:
#line 422 "./parse.y"
{
tree name = EXPR_WFL_NODE (yyvsp[-3].node);
tree node = build_tree_list (yyvsp[-3].node, NULL_TREE);
if (!IS_AN_IMPORT_ON_DEMAND_P (name))
{
read_import_dir (yyvsp[-3].node);
IS_AN_IMPORT_ON_DEMAND_P (name) = 1;
}
TREE_CHAIN (node) = ctxp->import_demand_list;
ctxp->import_demand_list = node;
;
break;}
case 49:
#line 434 "./parse.y"
{yyerror ("'*' expected"); RECOVER;;
break;}
case 50:
#line 436 "./parse.y"
{yyerror ("';' expected"); RECOVER;;
break;}
case 51:
#line 441 "./parse.y"
{
maybe_generate_clinit ();
maybe_generate_finit ();
yyval.node = yyvsp[0].node;
;
break;}
case 53:
#line 448 "./parse.y"
{ yyval.node = NULL; ;
break;}
case 54:
#line 450 "./parse.y"
{
YYERROR_NOW;
yyerror ("Class or interface declaration expected");
;
break;}
case 55:
#line 461 "./parse.y"
{
yyval.value = (1 << yyvsp[0].value);
;
break;}
case 56:
#line 465 "./parse.y"
{
int acc = (1 << yyvsp[0].value);
if (yyval.value & acc)
parse_error_context
(ctxp->modifier_ctx [yyvsp[0].value], "Modifier `%s' declared twice",
java_accstring_lookup (acc));
else
{
yyval.value |= acc;
}
;
break;}
case 57:
#line 481 "./parse.y"
{ create_class (yyvsp[-4].value, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 58:
#line 483 "./parse.y"
{
yyval.node = yyvsp[0].node;
;
break;}
case 59:
#line 487 "./parse.y"
{ create_class (0, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 60:
#line 489 "./parse.y"
{
yyval.node = yyvsp[0].node;
;
break;}
case 61:
#line 493 "./parse.y"
{yyerror ("Missing class name"); RECOVER;;
break;}
case 62:
#line 495 "./parse.y"
{yyerror ("Missing class name"); RECOVER;;
break;}
case 63:
#line 497 "./parse.y"
{if (!ctxp->class_err) yyerror ("'{' expected"); DRECOVER(class1);;
break;}
case 64:
#line 499 "./parse.y"
{if (!ctxp->class_err) yyerror ("'{' expected"); RECOVER;;
break;}
case 65:
#line 503 "./parse.y"
{ yyval.node = NULL; ;
break;}
case 66:
#line 505 "./parse.y"
{ yyval.node = yyvsp[0].node; ;
break;}
case 67:
#line 507 "./parse.y"
{yyerror ("'{' expected"); ctxp->class_err=1;;
break;}
case 68:
#line 509 "./parse.y"
{yyerror ("Missing super class name"); ctxp->class_err=1;;
break;}
case 69:
#line 513 "./parse.y"
{ yyval.node = NULL_TREE; ;
break;}
case 70:
#line 515 "./parse.y"
{ yyval.node = yyvsp[0].node; ;
break;}
case 71:
#line 517 "./parse.y"
{
ctxp->class_err=1;
yyerror ("Missing interface name");
;
break;}
case 72:
#line 525 "./parse.y"
{
ctxp->interface_number = 1;
yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE);
;
break;}
case 73:
#line 530 "./parse.y"
{
ctxp->interface_number++;
yyval.node = chainon (yyvsp[-2].node, build_tree_list (yyvsp[0].node, NULL_TREE));
;
break;}
case 74:
#line 535 "./parse.y"
{yyerror ("Missing interface name"); RECOVER;;
break;}
case 75:
#line 540 "./parse.y"
{ yyval.node = ctxp->current_parsed_class; ;
break;}
case 76:
#line 542 "./parse.y"
{ yyval.node = ctxp->current_parsed_class; ;
break;}
case 82:
#line 555 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("instance initializer"); ;
break;}
case 85:
#line 562 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("inner classe declaration"); ;
break;}
case 86:
#line 564 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("inner interface declaration"); ;
break;}
case 87:
#line 570 "./parse.y"
{ register_fields (0, yyvsp[-2].node, yyvsp[-1].node); ;
break;}
case 88:
#line 572 "./parse.y"
{
check_modifiers
("Illegal modifier `%s' for field declaration",
yyvsp[-3].value, FIELD_MODIFIERS);
check_modifiers_consistency (yyvsp[-3].value);
register_fields (yyvsp[-3].value, yyvsp[-2].node, yyvsp[-1].node);
;
break;}
case 90:
#line 585 "./parse.y"
{ yyval.node = chainon (yyvsp[-2].node, yyvsp[0].node); ;
break;}
case 91:
#line 587 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 92:
#line 592 "./parse.y"
{ yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE); ;
break;}
case 93:
#line 594 "./parse.y"
{
if (java_error_count)
yyvsp[0].node = NULL_TREE;
yyval.node = build_tree_list
(yyvsp[-2].node, build_assignment (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node));
;
break;}
case 94:
#line 601 "./parse.y"
{
yyerror ("Missing variable initializer");
yyval.node = build_tree_list (yyvsp[-2].node, NULL_TREE);
RECOVER;
;
break;}
case 95:
#line 607 "./parse.y"
{
yyerror ("';' expected");
yyval.node = build_tree_list (yyvsp[-3].node, NULL_TREE);
RECOVER;
;
break;}
case 97:
#line 617 "./parse.y"
{ yyval.node = build_unresolved_array_type (yyvsp[-2].node); ;
break;}
case 98:
#line 619 "./parse.y"
{yyerror ("Invalid declaration"); DRECOVER(vdi);;
break;}
case 99:
#line 621 "./parse.y"
{yyerror ("']' expected"); DRECOVER(vdi);;
break;}
case 100:
#line 623 "./parse.y"
{yyerror ("Unbalanced ']'"); DRECOVER(vdi);;
break;}
case 102:
#line 629 "./parse.y"
{ yyval.node = NULL; ;
break;}
case 103:
#line 635 "./parse.y"
{
current_function_decl = yyvsp[0].node;
source_start_java_method (current_function_decl);
;
break;}
case 104:
#line 640 "./parse.y"
{ complete_method_declaration (yyvsp[0].node); ;
break;}
case 105:
#line 642 "./parse.y"
{YYNOT_TWICE yyerror ("'{' expected"); RECOVER;;
break;}
case 106:
#line 647 "./parse.y"
{ yyval.node = method_header (0, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 107:
#line 649 "./parse.y"
{ yyval.node = method_header (0, void_type_node, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 108:
#line 651 "./parse.y"
{ yyval.node = method_header (yyvsp[-3].value, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 109:
#line 653 "./parse.y"
{ yyval.node = method_header (yyvsp[-3].value, void_type_node, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 110:
#line 655 "./parse.y"
{RECOVER;;
break;}
case 111:
#line 657 "./parse.y"
{RECOVER;;
break;}
case 112:
#line 659 "./parse.y"
{yyerror ("Identifier expected"); RECOVER;;
break;}
case 113:
#line 661 "./parse.y"
{yyerror ("Identifier expected"); RECOVER;;
break;}
case 114:
#line 663 "./parse.y"
{
yyerror ("Invalid method declaration, return type required");
RECOVER;
;
break;}
case 115:
#line 671 "./parse.y"
{ yyval.node = method_declarator (yyvsp[-2].node, NULL_TREE); ;
break;}
case 116:
#line 673 "./parse.y"
{ yyval.node = method_declarator (yyvsp[-3].node, yyvsp[-1].node); ;
break;}
case 117:
#line 675 "./parse.y"
{
/* Issue a warning here: obsolete declaration. FIXME */
yyval.node = NULL; /* FIXME */
;
break;}
case 118:
#line 680 "./parse.y"
{yyerror ("')' expected"); DRECOVER(method_declarator);;
break;}
case 119:
#line 682 "./parse.y"
{yyerror ("']' expected"); RECOVER;;
break;}
case 120:
#line 687 "./parse.y"
{
ctxp->formal_parameter_number = 1;
;
break;}
case 121:
#line 691 "./parse.y"
{
ctxp->formal_parameter_number += 1;
yyval.node = chainon (yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 122:
#line 696 "./parse.y"
{yyerror ("Missing formal parameter term"); RECOVER;;
break;}
case 123:
#line 701 "./parse.y"
{
yyval.node = build_tree_list (yyvsp[0].node, yyvsp[-1].node);
;
break;}
case 124:
#line 705 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("final parameters"); ;
break;}
case 125:
#line 707 "./parse.y"
{yyerror ("Missing identifier"); RECOVER;;
break;}
case 126:
#line 709 "./parse.y"
{
SOURCE_FRONTEND_DEBUG (("Modifiers: %d", yyvsp[-2].value));
yyerror ("Missing identifier"); RECOVER;
;
break;}
case 127:
#line 716 "./parse.y"
{ yyval.node = NULL_TREE; ;
break;}
case 128:
#line 718 "./parse.y"
{ yyval.node = yyvsp[0].node; ;
break;}
case 129:
#line 720 "./parse.y"
{yyerror ("Missing class type term"); RECOVER;;
break;}
case 130:
#line 725 "./parse.y"
{ yyval.node = build_tree_list (yyvsp[0].node, yyvsp[0].node); ;
break;}
case 131:
#line 727 "./parse.y"
{ yyval.node = tree_cons (yyvsp[0].node, yyvsp[0].node, yyvsp[-2].node); ;
break;}
case 132:
#line 729 "./parse.y"
{yyerror ("Missing class type term"); RECOVER;;
break;}
case 135:
#line 736 "./parse.y"
{ yyval.node = NULL_TREE; ;
break;}
case 136:
#line 742 "./parse.y"
{
RULE ("STATIC_INITIALIZER");
;
break;}
case 137:
#line 746 "./parse.y"
{
RULE ("STATIC_INITIALIZER");
;
break;}
case 138:
#line 753 "./parse.y"
{
SOURCE_FRONTEND_DEBUG (("Modifiers: %d", yyvsp[0].value));
;
break;}
case 139:
#line 761 "./parse.y"
{
current_function_decl = yyvsp[0].node;
source_start_java_method (current_function_decl);
;
break;}
case 140:
#line 766 "./parse.y"
{ complete_method_declaration (yyvsp[0].node); ;
break;}
case 141:
#line 771 "./parse.y"
{ yyval.node = method_header (0, NULL_TREE, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 142:
#line 773 "./parse.y"
{ yyval.node = method_header (yyvsp[-2].value, NULL_TREE, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 143:
#line 778 "./parse.y"
{ yyval.node = method_declarator (yyvsp[-2].node, NULL_TREE); ;
break;}
case 144:
#line 780 "./parse.y"
{ yyval.node = method_declarator (yyvsp[-3].node, yyvsp[-1].node); ;
break;}
case 145:
#line 788 "./parse.y"
{
BLOCK_EXPR_BODY (yyvsp[0].node) = empty_stmt_node;
yyval.node = yyvsp[0].node;
;
break;}
case 146:
#line 793 "./parse.y"
{ yyval.node = yyvsp[0].node; ;
break;}
case 147:
#line 795 "./parse.y"
{ yyval.node = yyvsp[0].node; ;
break;}
case 148:
#line 797 "./parse.y"
{ yyval.node = yyvsp[0].node; ;
break;}
case 149:
#line 803 "./parse.y"
{
yyval.node = build_method_invocation (yyvsp[-3].node, NULL_TREE);
yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-3].node), yyval.node);
yyval.node = java_method_add_stmt (current_function_decl, yyval.node);
;
break;}
case 150:
#line 809 "./parse.y"
{
yyval.node = build_method_invocation (yyvsp[-4].node, yyvsp[-2].node);
yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-4].node), yyval.node);
yyval.node = java_method_add_stmt (current_function_decl, yyval.node);
;
break;}
case 151:
#line 817 "./parse.y"
{yyval.node = parse_jdk1_1_error ("explicit constructor invocation"); ;
break;}
case 152:
#line 819 "./parse.y"
{yyval.node = parse_jdk1_1_error ("explicit constructor invocation"); ;
break;}
case 153:
#line 824 "./parse.y"
{
tree wfl = build_wfl_node (this_identifier_node,
input_filename, 0, 0);
EXPR_WFL_LINECOL (wfl) = yyvsp[0].operator.location;
yyval.node = wfl;
;
break;}
case 154:
#line 831 "./parse.y"
{
tree wfl = build_wfl_node (super_identifier_node,
input_filename, 0, 0);
EXPR_WFL_LINECOL (wfl) = yyvsp[0].operator.location;
yyval.node = wfl;
;
break;}
case 155:
#line 843 "./parse.y"
{ create_interface (0, yyvsp[0].node, NULL_TREE); ;
break;}
case 156:
#line 845 "./parse.y"
{
yyval.node = yyvsp[0].node;
;
break;}
case 157:
#line 849 "./parse.y"
{ create_interface (yyvsp[-2].value, yyvsp[0].node, NULL_TREE); ;
break;}
case 158:
#line 851 "./parse.y"
{
yyval.node = yyvsp[0].node;
;
break;}
case 159:
#line 855 "./parse.y"
{ create_interface (0, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 160:
#line 857 "./parse.y"
{
yyval.node = yyvsp[0].node;
;
break;}
case 161:
#line 861 "./parse.y"
{ create_interface (yyvsp[-3].value, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 162:
#line 863 "./parse.y"
{
yyval.node = yyvsp[0].node;
;
break;}
case 163:
#line 867 "./parse.y"
{yyerror ("(here)'{' expected"); RECOVER;;
break;}
case 164:
#line 869 "./parse.y"
{yyerror ("(there)'{' expected"); RECOVER;;
break;}
case 165:
#line 874 "./parse.y"
{
ctxp->interface_number = 1;
yyval.node = build_tree_list (yyvsp[0].node, NULL_TREE);
;
break;}
case 166:
#line 879 "./parse.y"
{
ctxp->interface_number++;
yyval.node = chainon (yyvsp[-2].node, build_tree_list (yyvsp[0].node, NULL_TREE));
;
break;}
case 167:
#line 884 "./parse.y"
{yyerror ("Invalid interface type"); RECOVER;;
break;}
case 168:
#line 886 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 169:
#line 891 "./parse.y"
{ yyval.node = NULL_TREE; ;
break;}
case 170:
#line 893 "./parse.y"
{ yyval.node = NULL_TREE; ;
break;}
case 175:
#line 905 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("inner class declaration"); ;
break;}
case 176:
#line 907 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("inner interface declaration"); ;
break;}
case 178:
#line 916 "./parse.y"
{
check_abstract_method_header (yyvsp[-1].node);
current_function_decl = NULL_TREE; /* FIXME ? */
;
break;}
case 179:
#line 921 "./parse.y"
{yyerror ("';' expected"); RECOVER;;
break;}
case 180:
#line 927 "./parse.y"
{
RULE ("ARRAY_INITIALIZER (empty)");
;
break;}
case 181:
#line 931 "./parse.y"
{
RULE ("ARRAY_INITIALIZER (variable)");
;
break;}
case 182:
#line 935 "./parse.y"
{
RULE ("ARRAY_INITIALIZER (,)");
;
break;}
case 183:
#line 939 "./parse.y"
{
RULE ("ARRAY_INITIALIZER (variable, ,)");
;
break;}
case 186:
#line 948 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 187:
#line 954 "./parse.y"
{ yyval.node = empty_stmt_node; ;
break;}
case 188:
#line 956 "./parse.y"
{ yyval.node = yyvsp[0].node; ;
break;}
case 189:
#line 961 "./parse.y"
{ enter_block (); ;
break;}
case 190:
#line 966 "./parse.y"
{
maybe_absorb_scoping_blocks ();
yyval.node = exit_block ();
;
break;}
case 194:
#line 980 "./parse.y"
{ java_method_add_stmt (current_function_decl, yyvsp[0].node); ;
break;}
case 195:
#line 982 "./parse.y"
{ parse_jdk1_1_error ("inner class declaration"); ;
break;}
case 197:
#line 991 "./parse.y"
{ declare_local_variables (0, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 198:
#line 993 "./parse.y"
{ declare_local_variables (yyvsp[-2].value, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 204:
#line 1003 "./parse.y"
{
/* If the for loop is unlabeled, we must return the
block it was defined it. It our last chance to
get a hold on it. */
if (!LOOP_HAS_LABEL_P (yyval.node))
yyval.node = exit_block ();
;
break;}
case 221:
#line 1036 "./parse.y"
{ yyval.node = empty_stmt_node; ;
break;}
case 222:
#line 1041 "./parse.y"
{
yyval.node = build_labeled_block (EXPR_WFL_LINECOL (yyvsp[-1].node),
EXPR_WFL_NODE (yyvsp[-1].node));
pushlevel (2);
push_labeled_block (yyval.node);
PUSH_LABELED_BLOCK (yyval.node);
;
break;}
case 223:
#line 1052 "./parse.y"
{
yyval.node = complete_labeled_statement (yyvsp[-1].node, yyvsp[0].node);
pop_labeled_block ();
POP_LABELED_BLOCK ();
;
break;}
case 224:
#line 1058 "./parse.y"
{yyerror ("':' expected"); RECOVER;;
break;}
case 225:
#line 1063 "./parse.y"
{
yyval.node = complete_labeled_statement (yyvsp[-1].node, yyvsp[0].node);
pop_labeled_block ();
POP_LABELED_BLOCK ();
;
break;}
case 226:
#line 1074 "./parse.y"
{
/* We have a statement. Generate a WFL around it so
we can debug it */
yyval.node = build_expr_wfl (yyvsp[-1].node, input_filename, lineno, 0);
/* We know we have a statement, so set the debug
info to be eventually generate here. */
yyval.node = JAVA_MAYBE_GENERATE_DEBUG_INFO (yyval.node);
;
break;}
case 227:
#line 1083 "./parse.y"
{
if (ctxp->prevent_ese != lineno)
yyerror ("Invalid expression statement");
DRECOVER (expr_stmt);
;
break;}
case 228:
#line 1089 "./parse.y"
{
if (ctxp->prevent_ese != lineno)
yyerror ("Invalid expression statement");
DRECOVER (expr_stmt);
;
break;}
case 229:
#line 1095 "./parse.y"
{
if (ctxp->prevent_ese != lineno)
yyerror ("Invalid expression statement");
DRECOVER (expr_stmt);
;
break;}
case 230:
#line 1101 "./parse.y"
{yyerror ("')' expected"); RECOVER;;
break;}
case 231:
#line 1103 "./parse.y"
{
yyerror ("Constructor invocation must be first "
"thing in a constructor");
RECOVER;
;
break;}
case 232:
#line 1109 "./parse.y"
{yyerror ("')' expected"); RECOVER;;
break;}
case 233:
#line 1111 "./parse.y"
{
yyerror ("Constructor invocation must be first "
"thing in a constructor");
RECOVER;
;
break;}
case 234:
#line 1117 "./parse.y"
{yyerror ("'(' expected"); RECOVER;;
break;}
case 235:
#line 1119 "./parse.y"
{yyerror ("')' expected"); RECOVER;;
break;}
case 236:
#line 1121 "./parse.y"
{yyerror ("')' expected"); RECOVER;;
break;}
case 237:
#line 1123 "./parse.y"
{yyerror ("';' expected"); RECOVER;;
break;}
case 238:
#line 1125 "./parse.y"
{yyerror ("';' expected"); RECOVER;;
break;}
case 246:
#line 1140 "./parse.y"
{ yyval.node = build_if_else_statement (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node, NULL_TREE); ;
break;}
case 247:
#line 1142 "./parse.y"
{yyerror ("'(' expected"); RECOVER;;
break;}
case 248:
#line 1144 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 249:
#line 1146 "./parse.y"
{yyerror ("')' expected"); RECOVER;;
break;}
case 250:
#line 1151 "./parse.y"
{ yyval.node = build_if_else_statement (yyvsp[-5].operator.location, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); ;
break;}
case 251:
#line 1156 "./parse.y"
{ yyval.node = build_if_else_statement (yyvsp[-5].operator.location, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node); ;
break;}
case 252:
#line 1161 "./parse.y"
{
enter_block ();
;
break;}
case 253:
#line 1165 "./parse.y"
{
/* Make into "proper list" of COMPOUND_EXPRs.
I.e. make the last statment also have its own COMPOUND_EXPR. */
maybe_absorb_scoping_blocks ();
TREE_OPERAND (yyvsp[-2].node, 1) = exit_block ();
yyval.node = build_debugable_stmt (EXPR_WFL_LINECOL (yyvsp[-2].node), yyvsp[-2].node);
;
break;}
case 254:
#line 1176 "./parse.y"
{
yyval.node = build (SWITCH_EXPR, NULL_TREE, yyvsp[-1].node, NULL_TREE);
EXPR_WFL_LINECOL (yyval.node) = yyvsp[-2].operator.location;
;
break;}
case 255:
#line 1181 "./parse.y"
{yyerror ("'(' expected"); RECOVER;;
break;}
case 256:
#line 1183 "./parse.y"
{yyerror ("Missing term or ')'"); DRECOVER(switch_statement);;
break;}
case 257:
#line 1185 "./parse.y"
{yyerror ("'{' expected"); RECOVER;;
break;}
case 267:
#line 1211 "./parse.y"
{
tree lab = build1 (CASE_EXPR, NULL_TREE, yyvsp[-1].node);
EXPR_WFL_LINECOL (lab) = yyvsp[-2].operator.location;
java_method_add_stmt (current_function_decl, lab);
;
break;}
case 268:
#line 1217 "./parse.y"
{
tree lab = build1 (DEFAULT_EXPR, NULL_TREE, NULL_TREE);
EXPR_WFL_LINECOL (lab) = yyvsp[-1].operator.location;
java_method_add_stmt (current_function_decl, lab);
;
break;}
case 269:
#line 1223 "./parse.y"
{yyerror ("Missing or invalid constant expression"); RECOVER;;
break;}
case 270:
#line 1225 "./parse.y"
{yyerror ("':' expected"); RECOVER;;
break;}
case 271:
#line 1227 "./parse.y"
{yyerror ("':' expected"); RECOVER;;
break;}
case 272:
#line 1232 "./parse.y"
{
tree body = build_loop_body (yyvsp[-2].operator.location, yyvsp[-1].node, 0);
yyval.node = build_new_loop (body);
;
break;}
case 273:
#line 1240 "./parse.y"
{ yyval.node = complete_loop_body (0, NULL_TREE, yyvsp[0].node, 0); ;
break;}
case 274:
#line 1242 "./parse.y"
{YYERROR_NOW; yyerror ("'(' expected"); RECOVER;;
break;}
case 275:
#line 1244 "./parse.y"
{yyerror ("Missing term and ')' expected"); RECOVER;;
break;}
case 276:
#line 1246 "./parse.y"
{yyerror ("')' expected"); RECOVER;;
break;}
case 277:
#line 1251 "./parse.y"
{ yyval.node = complete_loop_body (0, NULL_TREE, yyvsp[0].node, 0); ;
break;}
case 278:
#line 1256 "./parse.y"
{
tree body = build_loop_body (0, NULL_TREE, 1);
yyval.node = build_new_loop (body);
;
break;}
case 279:
#line 1265 "./parse.y"
{ yyval.node = complete_loop_body (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[-5].node, 1); ;
break;}
case 280:
#line 1270 "./parse.y"
{ yyval.node = complete_for_loop (EXPR_WFL_LINECOL (yyvsp[-4].node), yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node);;
break;}
case 281:
#line 1272 "./parse.y"
{
yyval.node = complete_for_loop (0, NULL_TREE, yyvsp[-2].node, yyvsp[0].node);
/* We have not condition, so we get rid of the EXIT_EXPR */
LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY (yyval.node), 0) =
empty_stmt_node;
;
break;}
case 282:
#line 1279 "./parse.y"
{yyerror ("Invalid control expression"); RECOVER;;
break;}
case 283:
#line 1281 "./parse.y"
{yyerror ("Invalid update expression"); RECOVER;;
break;}
case 284:
#line 1283 "./parse.y"
{yyerror ("Invalid update expression"); RECOVER;;
break;}
case 285:
#line 1288 "./parse.y"
{ yyval.node = complete_for_loop (EXPR_WFL_LINECOL (yyvsp[-4].node), yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node);;
break;}
case 286:
#line 1290 "./parse.y"
{
yyval.node = complete_for_loop (0, NULL_TREE, yyvsp[-2].node, yyvsp[0].node);
/* We have not condition, so we get rid of the EXIT_EXPR */
LOOP_EXPR_BODY_CONDITION_EXPR (LOOP_EXPR_BODY (yyval.node), 0) =
empty_stmt_node;
;
break;}
case 287:
#line 1300 "./parse.y"
{
/* This scope defined for local variable that may be
defined within the scope of the for loop */
enter_block ();
;
break;}
case 288:
#line 1306 "./parse.y"
{yyerror ("'(' expected"); DRECOVER(for_1);;
break;}
case 289:
#line 1308 "./parse.y"
{yyerror ("Invalid init statement"); RECOVER;;
break;}
case 290:
#line 1313 "./parse.y"
{
/* We now declare the loop body. The loop is
declared as a for loop. */
tree body = build_loop_body (0, NULL_TREE, 0);
yyval.node = build_new_loop (body);
IS_FOR_LOOP_P (yyval.node) = 1;
/* The loop is added to the current block the for
statement is defined within */
java_method_add_stmt (current_function_decl, yyval.node);
;
break;}
case 291:
#line 1325 "./parse.y"
{ yyval.node = empty_stmt_node; ;
break;}
case 292:
#line 1327 "./parse.y"
{
/* Init statement recorded within the previously
defined block scope */
yyval.node = java_method_add_stmt (current_function_decl, yyvsp[0].node);
;
break;}
case 293:
#line 1333 "./parse.y"
{
/* Local variable are recorded within the previously
defined block scope */
yyval.node = NULL_TREE;
;
break;}
case 294:
#line 1339 "./parse.y"
{yyerror ("';' expected"); DRECOVER(for_init_1);;
break;}
case 295:
#line 1343 "./parse.y"
{yyval.node = empty_stmt_node;;
break;}
case 296:
#line 1345 "./parse.y"
{ yyval.node = build_debugable_stmt (BUILD_LOCATION (), yyvsp[0].node); ;
break;}
case 297:
#line 1350 "./parse.y"
{ yyval.node = add_stmt_to_compound (NULL_TREE, NULL_TREE, yyvsp[0].node); ;
break;}
case 298:
#line 1352 "./parse.y"
{ yyval.node = add_stmt_to_compound (yyvsp[-2].node, NULL_TREE, yyvsp[0].node); ;
break;}
case 299:
#line 1354 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 300:
#line 1359 "./parse.y"
{ yyval.node = build_bc_statement (yyvsp[-1].operator.location, 1, NULL_TREE); ;
break;}
case 301:
#line 1361 "./parse.y"
{ yyval.node = build_bc_statement (yyvsp[-2].operator.location, 1, yyvsp[-1].node); ;
break;}
case 302:
#line 1363 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 303:
#line 1365 "./parse.y"
{yyerror ("';' expected"); RECOVER;;
break;}
case 304:
#line 1370 "./parse.y"
{ yyval.node = build_bc_statement (yyvsp[-1].operator.location, 0, NULL_TREE); ;
break;}
case 305:
#line 1372 "./parse.y"
{ yyval.node = build_bc_statement (yyvsp[-2].operator.location, 0, yyvsp[-1].node); ;
break;}
case 306:
#line 1374 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 307:
#line 1376 "./parse.y"
{yyerror ("';' expected"); RECOVER;;
break;}
case 308:
#line 1381 "./parse.y"
{ yyval.node = build_return (yyvsp[-1].operator.location, NULL_TREE); ;
break;}
case 309:
#line 1383 "./parse.y"
{ yyval.node = build_return (yyvsp[-2].operator.location, yyvsp[-1].node); ;
break;}
case 310:
#line 1385 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 311:
#line 1387 "./parse.y"
{yyerror ("';' expected"); RECOVER;;
break;}
case 312:
#line 1392 "./parse.y"
{
yyval.node = build1 (THROW_EXPR, NULL_TREE, yyvsp[-1].node);
EXPR_WFL_LINECOL (yyval.node) = yyvsp[-2].operator.location;
;
break;}
case 313:
#line 1397 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 314:
#line 1399 "./parse.y"
{yyerror ("';' expected"); RECOVER;;
break;}
case 315:
#line 1404 "./parse.y"
{
yyval.node = build (SYNCHRONIZED_EXPR, NULL_TREE, yyvsp[-2].node, yyvsp[0].node);
EXPR_WFL_LINECOL (yyval.node) =
EXPR_WFL_LINECOL (MODIFIER_WFL (SYNCHRONIZED_TK));
;
break;}
case 316:
#line 1410 "./parse.y"
{yyerror ("'{' expected"); RECOVER;;
break;}
case 317:
#line 1412 "./parse.y"
{yyerror ("'(' expected"); RECOVER;;
break;}
case 318:
#line 1414 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 319:
#line 1416 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 320:
#line 1421 "./parse.y"
{
if ((1 << yyvsp[0].value) != ACC_SYNCHRONIZED)
fatal ("synchronized was '%d' - yyparse", (1 << yyvsp[0].value));
;
break;}
case 321:
#line 1429 "./parse.y"
{ yyval.node = build_try_statement (yyvsp[-2].operator.location, yyvsp[-1].node, yyvsp[0].node, NULL_TREE); ;
break;}
case 322:
#line 1431 "./parse.y"
{ yyval.node = build_try_statement (yyvsp[-2].operator.location, yyvsp[-1].node, NULL_TREE, yyvsp[0].node); ;
break;}
case 323:
#line 1433 "./parse.y"
{ yyval.node = build_try_statement (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[-1].node, yyvsp[0].node); ;
break;}
case 324:
#line 1435 "./parse.y"
{yyerror ("'{' expected"); DRECOVER (try_statement);;
break;}
case 326:
#line 1441 "./parse.y"
{
TREE_CHAIN (yyvsp[0].node) = yyvsp[-1].node;
yyval.node = yyvsp[0].node;
;
break;}
case 327:
#line 1449 "./parse.y"
{
java_method_add_stmt (current_function_decl, yyvsp[0].node);
exit_block ();
yyval.node = yyvsp[-1].node;
;
break;}
case 328:
#line 1457 "./parse.y"
{
/* We add a block to define a scope for
formal_parameter (CCBP). The formal parameter is
declared initialized by the appropriate function
call */
tree ccpb = enter_block ();
tree init = build_assignment (ASSIGN_TK, yyvsp[-2].operator.location,
TREE_PURPOSE (yyvsp[-1].node),
soft_exceptioninfo_call_node);
declare_local_variables (0, TREE_VALUE (yyvsp[-1].node),
build_tree_list (TREE_PURPOSE (yyvsp[-1].node),
init));
yyval.node = build1 (CATCH_EXPR, NULL_TREE, ccpb);
EXPR_WFL_LINECOL (yyval.node) = yyvsp[-3].operator.location;
;
break;}
case 329:
#line 1473 "./parse.y"
{yyerror ("'(' expected"); RECOVER;;
break;}
case 330:
#line 1475 "./parse.y"
{yyerror ("Missing term or ')' expected"); DRECOVER (2);;
break;}
case 331:
#line 1477 "./parse.y"
{yyerror ("')' expected"); DRECOVER (1);;
break;}
case 332:
#line 1482 "./parse.y"
{
yyval.node = build (FINALLY_EXPR, NULL_TREE,
create_label_decl (generate_name ()), yyvsp[0].node);
;
break;}
case 333:
#line 1487 "./parse.y"
{yyerror ("'{' expected"); RECOVER; ;
break;}
case 337:
#line 1499 "./parse.y"
{ yyval.node = build_this (yyvsp[0].operator.location); ;
break;}
case 338:
#line 1501 "./parse.y"
{yyval.node = yyvsp[-1].node;;
break;}
case 343:
#line 1510 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("named class literals"); ;
break;}
case 344:
#line 1512 "./parse.y"
{ yyval.node = build_class_ref (yyvsp[-2].node); ;
break;}
case 345:
#line 1514 "./parse.y"
{ yyval.node = build_class_ref (void_type_node); ;
break;}
case 346:
#line 1519 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("class literals"); ;
break;}
case 347:
#line 1521 "./parse.y"
{yyerror ("')' expected"); RECOVER;;
break;}
case 348:
#line 1523 "./parse.y"
{yyerror ("'class' or 'this' expected" ); RECOVER;;
break;}
case 349:
#line 1525 "./parse.y"
{yyerror ("'class' expected" ); RECOVER;;
break;}
case 350:
#line 1527 "./parse.y"
{yyerror ("'class' expected" ); RECOVER;;
break;}
case 351:
#line 1532 "./parse.y"
{ yyval.node = build_new_invocation (yyvsp[-3].node, yyvsp[-1].node); ;
break;}
case 352:
#line 1534 "./parse.y"
{ yyval.node = build_new_invocation (yyvsp[-2].node, NULL_TREE); ;
break;}
case 353:
#line 1539 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("inner class instance creation"); ;
break;}
case 354:
#line 1541 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("inner class instance creation"); ;
break;}
case 359:
#line 1550 "./parse.y"
{yyerror ("'(' expected"); DRECOVER(new_1);;
break;}
case 360:
#line 1552 "./parse.y"
{yyerror ("'(' expected"); RECOVER;;
break;}
case 361:
#line 1554 "./parse.y"
{yyerror ("')' or term expected"); RECOVER;;
break;}
case 362:
#line 1556 "./parse.y"
{yyerror ("')' expected"); RECOVER;;
break;}
case 363:
#line 1558 "./parse.y"
{YYERROR_NOW; yyerror ("Identifier expected"); RECOVER;;
break;}
case 364:
#line 1560 "./parse.y"
{yyerror ("'(' expected"); RECOVER;;
break;}
case 367:
#line 1570 "./parse.y"
{
yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, NULL_TREE);
ctxp->formal_parameter_number = 1;
;
break;}
case 368:
#line 1575 "./parse.y"
{
ctxp->formal_parameter_number += 1;
yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, yyvsp[-2].node);
;
break;}
case 369:
#line 1580 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 370:
#line 1585 "./parse.y"
{ yyval.node = build_newarray_node (yyvsp[-1].node, yyvsp[0].node, 0); ;
break;}
case 371:
#line 1587 "./parse.y"
{ yyval.node = build_newarray_node (yyvsp[-1].node, yyvsp[0].node, 0); ;
break;}
case 372:
#line 1589 "./parse.y"
{ yyval.node = build_newarray_node (yyvsp[-2].node, yyvsp[-1].node, ctxp->osb_number); ;
break;}
case 373:
#line 1591 "./parse.y"
{ yyval.node = build_newarray_node (yyvsp[-2].node, yyvsp[-1].node, ctxp->osb_number); ;
break;}
case 374:
#line 1595 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("anonymous array"); ;
break;}
case 375:
#line 1597 "./parse.y"
{ yyval.node = parse_jdk1_1_error ("anonymous array"); ;
break;}
case 376:
#line 1599 "./parse.y"
{yyerror ("'[' expected"); DRECOVER ("]");;
break;}
case 377:
#line 1601 "./parse.y"
{yyerror ("']' expected"); RECOVER;;
break;}
case 378:
#line 1606 "./parse.y"
{ yyval.node = build_tree_list (NULL_TREE, yyvsp[0].node); ;
break;}
case 379:
#line 1608 "./parse.y"
{ yyval.node = tree_cons (NULL_TREE, yyvsp[0].node, yyval.node); ;
break;}
case 380:
#line 1613 "./parse.y"
{
EXPR_WFL_LINECOL (yyvsp[-1].node) = yyvsp[-2].operator.location;
yyval.node = yyvsp[-1].node;
;
break;}
case 381:
#line 1618 "./parse.y"
{yyerror ("']' expected"); RECOVER;;
break;}
case 382:
#line 1620 "./parse.y"
{
yyerror ("Missing term");
yyerror ("']' expected");
RECOVER;
;
break;}
case 383:
#line 1629 "./parse.y"
{ ctxp->osb_number = 1; ;
break;}
case 384:
#line 1631 "./parse.y"
{ ctxp->osb_number++; ;
break;}
case 385:
#line 1633 "./parse.y"
{ yyerror ("']' expected"); RECOVER;;
break;}
case 386:
#line 1638 "./parse.y"
{ yyval.node = make_qualified_primary (yyvsp[-2].node, yyvsp[0].node, yyvsp[-1].operator.location); ;
break;}
case 387:
#line 1642 "./parse.y"
{
tree super_wfl =
build_wfl_node (super_identifier_node,
input_filename, 0, 0);
EXPR_WFL_LINECOL (super_wfl) = yyvsp[-2].operator.location;
yyval.node = make_qualified_name (super_wfl, yyvsp[0].node, yyvsp[-1].operator.location);
;
break;}
case 388:
#line 1650 "./parse.y"
{yyerror ("Field expected"); DRECOVER (super_field_acces);;
break;}
case 389:
#line 1655 "./parse.y"
{ yyval.node = build_method_invocation (yyvsp[-2].node, NULL_TREE); ;
break;}
case 390:
#line 1657 "./parse.y"
{ yyval.node = build_method_invocation (yyvsp[-3].node, yyvsp[-1].node); ;
break;}
case 391:
#line 1659 "./parse.y"
{
if (TREE_CODE (yyvsp[-4].node) == THIS_EXPR)
yyval.node = build_this_super_qualified_invocation
(1, yyvsp[-2].node, NULL_TREE, 0, yyvsp[-3].operator.location);
else
{
tree invok = build_method_invocation (yyvsp[-2].node, NULL_TREE);
yyval.node = make_qualified_primary (yyvsp[-4].node, invok, yyvsp[-3].operator.location);
}
;
break;}
case 392:
#line 1670 "./parse.y"
{
if (TREE_CODE (yyvsp[-5].node) == THIS_EXPR)
yyval.node = build_this_super_qualified_invocation
(1, yyvsp[-3].node, yyvsp[-1].node, 0, yyvsp[-4].operator.location);
else
{
tree invok = build_method_invocation (yyvsp[-3].node, yyvsp[-1].node);
yyval.node = make_qualified_primary (yyvsp[-5].node, invok, yyvsp[-4].operator.location);
}
;
break;}
case 393:
#line 1681 "./parse.y"
{
yyval.node = build_this_super_qualified_invocation
(0, yyvsp[-2].node, NULL_TREE, yyvsp[-4].operator.location, yyvsp[-3].operator.location);
;
break;}
case 394:
#line 1686 "./parse.y"
{
yyval.node = build_this_super_qualified_invocation
(0, yyvsp[-3].node, yyvsp[-1].node, yyvsp[-5].operator.location, yyvsp[-4].operator.location);
;
break;}
case 395:
#line 1695 "./parse.y"
{ yyerror ("'(' expected"); DRECOVER (method_invocation); ;
break;}
case 396:
#line 1697 "./parse.y"
{ yyerror ("'(' expected"); DRECOVER (method_invocation); ;
break;}
case 397:
#line 1702 "./parse.y"
{ yyval.node = build_array_ref (yyvsp[-2].operator.location, yyvsp[-3].node, yyvsp[-1].node); ;
break;}
case 398:
#line 1704 "./parse.y"
{ yyval.node = build_array_ref (yyvsp[-2].operator.location, yyvsp[-3].node, yyvsp[-1].node); ;
break;}
case 399:
#line 1706 "./parse.y"
{
yyerror ("Missing term and ']' expected");
DRECOVER(array_access);
;
break;}
case 400:
#line 1711 "./parse.y"
{
yyerror ("']' expected");
DRECOVER(array_access);
;
break;}
case 401:
#line 1716 "./parse.y"
{
yyerror ("Missing term and ']' expected");
DRECOVER(array_access);
;
break;}
case 402:
#line 1721 "./parse.y"
{
yyerror ("']' expected");
DRECOVER(array_access);
;
break;}
case 407:
#line 1736 "./parse.y"
{ yyval.node = build_incdec (yyvsp[0].operator.token, yyvsp[0].operator.location, yyvsp[-1].node, 1); ;
break;}
case 408:
#line 1741 "./parse.y"
{ yyval.node = build_incdec (yyvsp[0].operator.token, yyvsp[0].operator.location, yyvsp[-1].node, 1); ;
break;}
case 411:
#line 1748 "./parse.y"
{yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ;
break;}
case 412:
#line 1750 "./parse.y"
{yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ;
break;}
case 414:
#line 1753 "./parse.y"
{yyerror ("Missing term"); RECOVER;
break;}
case 415:
#line 1755 "./parse.y"
{yyerror ("Missing term"); RECOVER;
break;}
case 416:
#line 1760 "./parse.y"
{yyval.node = build_incdec (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node, 0); ;
break;}
case 417:
#line 1762 "./parse.y"
{yyerror ("Missing term"); RECOVER;
break;}
case 418:
#line 1767 "./parse.y"
{yyval.node = build_incdec (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node, 0); ;
break;}
case 419:
#line 1769 "./parse.y"
{yyerror ("Missing term"); RECOVER;
break;}
case 421:
#line 1775 "./parse.y"
{yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ;
break;}
case 422:
#line 1777 "./parse.y"
{yyval.node = build_unaryop (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[0].node); ;
break;}
case 424:
#line 1780 "./parse.y"
{yyerror ("Missing term"); RECOVER;
break;}
case 425:
#line 1782 "./parse.y"
{yyerror ("Missing term"); RECOVER;
break;}
case 426:
#line 1787 "./parse.y"
{
tree type = yyvsp[-3].node;
while (ctxp->osb_number--)
type = build_java_array_type (type, -1);
yyval.node = build_cast (yyvsp[-4].operator.location, type, yyvsp[0].node);
;
break;}
case 427:
#line 1794 "./parse.y"
{ yyval.node = build_cast (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node); ;
break;}
case 428:
#line 1796 "./parse.y"
{ yyval.node = build_cast (yyvsp[-3].operator.location, yyvsp[-2].node, yyvsp[0].node); ;
break;}
case 429:
#line 1798 "./parse.y"
{
char *ptr;
while (ctxp->osb_number--)
obstack_1grow (&temporary_obstack, '[');
obstack_grow0 (&temporary_obstack,
IDENTIFIER_POINTER (EXPR_WFL_NODE (yyvsp[-3].node)),
IDENTIFIER_LENGTH (EXPR_WFL_NODE (yyvsp[-3].node)));
ptr = obstack_finish (&temporary_obstack);
EXPR_WFL_NODE (yyvsp[-3].node) = get_identifier (ptr);
yyval.node = build_cast (yyvsp[-4].operator.location, yyvsp[-3].node, yyvsp[0].node);
;
break;}
case 430:
#line 1810 "./parse.y"
{yyerror ("']' expected, invalid type expression");;
break;}
case 431:
#line 1812 "./parse.y"
{
if (ctxp->prevent_ese != lineno)
yyerror ("Invalid type expression"); RECOVER;
RECOVER;
;
break;}
case 432:
#line 1818 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 433:
#line 1820 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 434:
#line 1822 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 436:
#line 1828 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token),
yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 437:
#line 1833 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 438:
#line 1838 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 439:
#line 1843 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 440:
#line 1845 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 441:
#line 1847 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 443:
#line 1853 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 444:
#line 1858 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 445:
#line 1863 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 446:
#line 1865 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 448:
#line 1871 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 449:
#line 1876 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 450:
#line 1881 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 451:
#line 1886 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 452:
#line 1888 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 453:
#line 1890 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 455:
#line 1896 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 456:
#line 1901 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 457:
#line 1906 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 458:
#line 1911 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 459:
#line 1916 "./parse.y"
{ yyval.node = build_binop (INSTANCEOF_EXPR, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ;
break;}
case 460:
#line 1918 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 461:
#line 1920 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 462:
#line 1922 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 463:
#line 1924 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 464:
#line 1926 "./parse.y"
{yyerror ("Invalid reference type"); RECOVER;;
break;}
case 466:
#line 1932 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 467:
#line 1937 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 468:
#line 1942 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 469:
#line 1944 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 471:
#line 1950 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 472:
#line 1955 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 474:
#line 1961 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 475:
#line 1966 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 477:
#line 1972 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 478:
#line 1977 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 480:
#line 1983 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 481:
#line 1988 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 483:
#line 1994 "./parse.y"
{
yyval.node = build_binop (BINOP_LOOKUP (yyvsp[-1].operator.token), yyvsp[-1].operator.location,
yyvsp[-2].node, yyvsp[0].node);
;
break;}
case 484:
#line 1999 "./parse.y"
{yyerror ("Missing term"); RECOVER;;
break;}
case 486:
#line 2005 "./parse.y"
{
yyval.node = build (CONDITIONAL_EXPR, NULL_TREE, yyvsp[-4].node, yyvsp[-2].node, yyvsp[0].node);
EXPR_WFL_LINECOL (yyval.node) = yyvsp[-3].operator.location;
;
break;}
case 487:
#line 2010 "./parse.y"
{
YYERROR_NOW;
yyerror ("Missing term");
DRECOVER (1);
;
break;}
case 488:
#line 2016 "./parse.y"
{yyerror ("Missing term"); DRECOVER (2);;
break;}
case 489:
#line 2018 "./parse.y"
{yyerror ("Missing term"); DRECOVER (3);;
break;}
case 492:
#line 2028 "./parse.y"
{ yyval.node = build_assignment (yyvsp[-1].operator.token, yyvsp[-1].operator.location, yyvsp[-2].node, yyvsp[0].node); ;
break;}
case 493:
#line 2030 "./parse.y"
{
if (ctxp->prevent_ese != lineno)
yyerror ("Missing term");
DRECOVER (assign);
;
break;}
}
/* the action file gets copied in in place of this dollarsign */
#line 498 "/usr/cygnus/gnupro-98r1/share/bison.simple"
yyvsp -= yylen;
yyssp -= yylen;
#ifdef YYLSP_NEEDED
yylsp -= yylen;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
*++yyvsp = yyval;
#ifdef YYLSP_NEEDED
yylsp++;
if (yylen == 0)
{
yylsp->first_line = yylloc.first_line;
yylsp->first_column = yylloc.first_column;
yylsp->last_line = (yylsp-1)->last_line;
yylsp->last_column = (yylsp-1)->last_column;
yylsp->text = 0;
}
else
{
yylsp->last_line = (yylsp+yylen-1)->last_line;
yylsp->last_column = (yylsp+yylen-1)->last_column;
}
#endif
/* Now "shift" the result of the reduction.
Determine what state that goes to,
based on the state we popped back to
and the rule number reduced by. */
yyn = yyr1[yyn];
yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
yystate = yydefgoto[yyn - YYNTBASE];
goto yynewstate;
yyerrlab: /* here on detecting error */
if (! yyerrstatus)
/* If not already recovering from an error, report this error. */
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
int size = 0;
char *msg;
int x, count;
count = 0;
/* Start X at -yyn if nec to avoid negative indexes in yycheck. */
for (x = (yyn < 0 ? -yyn : 0);
x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
size += strlen(yytname[x]) + 15, count++;
msg = (char *) malloc(size + 15);
if (msg != 0)
{
strcpy(msg, "parse error");
if (count < 5)
{
count = 0;
for (x = (yyn < 0 ? -yyn : 0);
x < (sizeof(yytname) / sizeof(char *)); x++)
if (yycheck[x + yyn] == x)
{
strcat(msg, count == 0 ? ", expecting `" : " or `");
strcat(msg, yytname[x]);
strcat(msg, "'");
count++;
}
}
yyerror(msg);
free(msg);
}
else
yyerror ("parse error; also virtual memory exceeded");
}
else
#endif /* YYERROR_VERBOSE */
yyerror("parse error");
}
goto yyerrlab1;
yyerrlab1: /* here on error raised explicitly by an action */
if (yyerrstatus == 3)
{
/* if just tried and failed to reuse lookahead token after an error, discard it. */
/* return failure if at end of input */
if (yychar == YYEOF)
YYABORT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
#endif
yychar = YYEMPTY;
}
/* Else will try to reuse lookahead token
after shifting the error token. */
yyerrstatus = 3; /* Each real token shifted decrements this */
goto yyerrhandle;
yyerrdefault: /* current state does not do anything special for the error token. */
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
if (yyn) goto yydefault;
#endif
yyerrpop: /* pop the current state because it cannot handle the error token */
if (yyssp == yyss) YYABORT;
yyvsp--;
yystate = *--yyssp;
#ifdef YYLSP_NEEDED
yylsp--;
#endif
#if YYDEBUG != 0
if (yydebug)
{
short *ssp1 = yyss - 1;
fprintf (stderr, "Error: state stack now");
while (ssp1 != yyssp)
fprintf (stderr, " %d", *++ssp1);
fprintf (stderr, "\n");
}
#endif
yyerrhandle:
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yyerrdefault;
yyn += YYTERROR;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
goto yyerrdefault;
yyn = yytable[yyn];
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrpop;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrpop;
if (yyn == YYFINAL)
YYACCEPT;
#if YYDEBUG != 0
if (yydebug)
fprintf(stderr, "Shifting error token, ");
#endif
*++yyvsp = yylval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
yystate = yyn;
goto yynewstate;
}
#line 2056 "./parse.y"
#include "lex.c"
/* Flag for the error report routine to issue the error the first time
it's called (overriding the default behavior which is to drop the
first invocation and honor the second one, taking advantage of a
richer context. */
static int force_error = 0;
/* Create a new parser context and make it the current one. */
void
java_push_parser_context ()
{
struct parser_ctxt *new =
(struct parser_ctxt *)malloc(sizeof (struct parser_ctxt));
bzero (new, sizeof (struct parser_ctxt));
new->next = ctxp;
ctxp = new;
if (ctxp->next)
{
ctxp->incomplete_class = ctxp->next->incomplete_class;
ctxp->gclass_list = ctxp->next->gclass_list;
}
}
/* If the first file of a file list was a class file, no context
exists for a source file to be parsed. This boolean remembers that
java_parser_context_save_global might have created a dummy one, so
that java_parser_context_restore_global can pop it. */
static int extra_ctxp_pushed_p = 0;
void
java_parser_context_save_global ()
{
if (!ctxp)
{
java_push_parser_context ();
extra_ctxp_pushed_p = 1;
}
ctxp->finput = finput;
ctxp->lineno = lineno;
ctxp->current_class = current_class;
ctxp->filename = input_filename;
ctxp->current_function_decl = current_function_decl;
}
void
java_parser_context_restore_global ()
{
finput = ctxp->finput;
lineno = ctxp->lineno;
current_class = ctxp->current_class;
input_filename = ctxp->filename;
current_function_decl = ctxp->current_function_decl;
if (extra_ctxp_pushed_p)
{
java_pop_parser_context (0);
extra_ctxp_pushed_p = 0;
}
}
void
java_pop_parser_context (generate)
int generate;
{
tree current;
struct parser_ctxt *toFree, *next;
if (!ctxp)
return;
toFree = ctxp;
next = ctxp->next;
if (next)
{
next->incomplete_class = ctxp->incomplete_class;
next->gclass_list = ctxp->gclass_list;
lineno = ctxp->lineno;
finput = ctxp->finput;
current_class = ctxp->current_class;
}
/* Set the single import class file flag to 0 for the current list
of imported things */
for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_PURPOSE (current)) = 0;
/* And restore those of the previous context */
if ((ctxp = next)) /* Assignment is really meant here */
for (current = ctxp->import_list; current; current = TREE_CHAIN (current))
IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (TREE_PURPOSE (current)) = 1;
if (generate)
{
toFree->next = ctxp_for_generation;
ctxp_for_generation = toFree;
}
else
free (toFree);
}
/* Reporting JDK1.1 features not implemented */
static tree
parse_jdk1_1_error (msg)
char *msg;
{
sorry (": `%s' JDK1.1(TM) feature", msg);
java_error_count++;
return empty_stmt_node;
}
static int do_warning = 0;
void
yyerror (msg)
char *msg;
{
static java_lc elc;
static int prev_lineno;
static char *prev_msg;
int save_lineno;
char *remainder, *code_from_source;
extern struct obstack temporary_obstack;
if (!force_error && prev_lineno == lineno)
return;
/* Save current error location but report latter, when the context is
richer. */
if (ctxp->java_error_flag == 0)
{
ctxp->java_error_flag = 1;
elc = ctxp->elc;
/* Do something to use the previous line if we're reaching the
end of the file... */
#ifdef VERBOSE_SKELETON
printf ("* Error detected (%s)\n", (msg ? msg : "(null)"));
#endif
return;
}
/* Ignore duplicate message on the same line. BTW, this is dubious. FIXME */
if (!force_error && msg == prev_msg && prev_lineno == elc.line)
return;
ctxp->java_error_flag = 0;
if (do_warning)
java_warning_count++;
else
java_error_count++;
if (elc.col == 0 && msg[1] == ';')
{
elc.col = ctxp->p_line->char_col-1;
elc.line = ctxp->p_line->lineno;
}
save_lineno = lineno;
prev_lineno = lineno = elc.line;
prev_msg = msg;
code_from_source = java_get_line_col (ctxp->filename, elc.line, elc.col);
obstack_grow0 (&temporary_obstack,
code_from_source, strlen (code_from_source));
remainder = obstack_finish (&temporary_obstack);
if (do_warning)
warning ("%s.\n%s", msg, remainder);
else
error ("%s.\n%s", msg, remainder);
/* This allow us to cheaply avoid an extra 'Invalid expression
statement' error report when errors have been already reported on
the same line. This occurs when we report an error but don't have
a synchronization point other than ';', which
expression_statement is the only one to take care of. */
ctxp->prevent_ese = lineno = save_lineno;
}
static void
issue_warning_error_from_context (cl, msg, ap)
tree cl;
char *msg;
va_list ap;
{
char *saved;
char buffer [4096];
vsprintf (buffer, msg, ap);
force_error = 1;
ctxp->elc.line = EXPR_WFL_LINENO (cl);
ctxp->elc.col = (EXPR_WFL_COLNO (cl) == 0xfff ? -1 : EXPR_WFL_COLNO (cl));
/* We have a CL, that's a good reason for using it if it contains data */
saved = ctxp->filename;
if (TREE_CODE (cl) == EXPR_WITH_FILE_LOCATION && EXPR_WFL_FILENAME_NODE (cl))
ctxp->filename = EXPR_WFL_FILENAME (cl);
java_error (NULL);
java_error (buffer);
ctxp->filename = saved;
force_error = 0;
}
/* Issue an error message at a current source line CL */
void
parse_error_context VPROTO ((tree cl, char *msg, ...))
{
#ifndef __STDC__
tree cl;
char *msg;
#endif
va_list ap;
VA_START (ap, msg);
#ifndef __STDC__
cl = va_arg (ap, tree);
msg = va_arg (ap, char *);
#endif
issue_warning_error_from_context (cl, msg, ap);
va_end (ap);
}
/* Issue a warning at a current source line CL */
static void
parse_warning_context VPROTO ((tree cl, char *msg, ...))
{
#ifndef __STDC__
tree cl;
char *msg;
#endif
va_list ap;
VA_START (ap, msg);
#ifndef __STDC__
cl = va_arg (ap, tree);
msg = va_arg (ap, char *);
#endif
force_error = do_warning = 1;
issue_warning_error_from_context (cl, msg, ap);
do_warning = force_error = 0;
va_end (ap);
}
int
java_report_errors ()
{
if (java_error_count)
fprintf (stderr, "%d error%s",
java_error_count, (java_error_count == 1 ? "" : "s"));
if (java_warning_count)
fprintf (stderr, "%s%d warning%s", (java_error_count ? ", " : ""),
java_warning_count, (java_warning_count == 1 ? "" : "s"));
if (java_error_count || java_warning_count)
putc ('\n', stderr);
return java_error_count;
}
static char *
java_accstring_lookup (flags)
int flags;
{
static char buffer [80];
#define COPY_RETURN(S) {strcpy (buffer, S); return buffer;}
/* Access modifier looked-up first for easier report on forbidden
access. */
if (flags & ACC_PUBLIC) COPY_RETURN ("public");
if (flags & ACC_PRIVATE) COPY_RETURN ("private");
if (flags & ACC_PROTECTED) COPY_RETURN ("protected");
if (flags & ACC_STATIC) COPY_RETURN ("static");
if (flags & ACC_FINAL) COPY_RETURN ("final");
if (flags & ACC_SYNCHRONIZED) COPY_RETURN ("synchronized");
if (flags & ACC_VOLATILE) COPY_RETURN ("volatile");
if (flags & ACC_TRANSIENT) COPY_RETURN ("transient");
if (flags & ACC_NATIVE) COPY_RETURN ("native");
if (flags & ACC_INTERFACE) COPY_RETURN ("interface");
if (flags & ACC_ABSTRACT) COPY_RETURN ("abstract");
buffer [0] = '\0';
return buffer;
#undef COPY_RETURN
}
/* Issuing error messages upon redefinition of classes, interfaces or
variables. */
static void
classitf_redefinition_error (context, id, decl, cl)
char *context;
tree id, decl, cl;
{
parse_error_context (cl, "%s `%s' already defined in %s:%d",
context, IDENTIFIER_POINTER (id),
DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
/* Here we should point out where its redefined. It's a unicode. FIXME */
}
static void
variable_redefinition_error (context, name, type, line)
tree context, name, type;
int line;
{
char *type_name;
/* Figure a proper name for type. We might haven't resolved it */
if (TREE_CODE (type) == POINTER_TYPE && !TREE_TYPE (type))
type_name = IDENTIFIER_POINTER (TYPE_NAME (type));
else
type_name = lang_printable_name (type, 0);
parse_error_context (context,
"Variable `%s' is already defined in this method and "
"was declared `%s %s' at line %d",
IDENTIFIER_POINTER (name),
type_name, IDENTIFIER_POINTER (name), line);
}
static tree
build_array_from_name (type, type_wfl, name, ret_name)
tree type, type_wfl, name, *ret_name;
{
int more_dims = 0;
char *string;
/* Eventually get more dims */
string = IDENTIFIER_POINTER (name);
while (string [more_dims] == '[')
more_dims++;
/* If we have, then craft a new type for this variable */
if (more_dims)
{
name = get_identifier (&more_dims [string]);
/* If type already is a reference on an array, get the base type */
if ((TREE_CODE (type) == POINTER_TYPE) &&
TYPE_ARRAY_P (TREE_TYPE (type)))
type = TREE_TYPE (type);
/* Building the first dimension of a primitive type uses this
function */
if (JPRIMITIVE_TYPE_P (type))
{
type = build_java_array_type (type, -1);
CLASS_LOADED_P (type) = 1;
more_dims--;
}
/* Otherwise, if we have a WFL for this type, use it (the type
is already an array on an unresolved type, and we just keep
on adding dimensions) */
else if (type_wfl)
type = type_wfl;
/* Add all the dimensions */
while (more_dims--)
type = build_unresolved_array_type (type);
/* The type may have been incomplete in the first place */
if (type_wfl)
type = obtain_incomplete_type (type);
}
*ret_name = name;
return type;
}
/* Build something that the type identifier resolver will identify as
being an array to an unresolved type. TYPE_WFL is a WFL on a
identifier. */
static tree
build_unresolved_array_type (type_or_wfl)
tree type_or_wfl;
{
char *ptr;
/* TYPE_OR_WFL might be an array on a primitive type. In this case,
just create a array type */
if (TREE_CODE (type_or_wfl) == RECORD_TYPE)
{
tree type = build_java_array_type (type_or_wfl, -1);
CLASS_LOADED_P (type) = CLASS_LOADED_P (type_or_wfl);
return type;
}
obstack_1grow (&temporary_obstack, '[');
obstack_grow0 (&temporary_obstack,
IDENTIFIER_POINTER (EXPR_WFL_NODE (type_or_wfl)),
IDENTIFIER_LENGTH (EXPR_WFL_NODE (type_or_wfl)));
ptr = obstack_finish (&temporary_obstack);
return build_expr_wfl (get_identifier (ptr),
EXPR_WFL_FILENAME (type_or_wfl),
EXPR_WFL_LINENO (type_or_wfl),
EXPR_WFL_COLNO (type_or_wfl));
}
/* Check modifiers. If one doesn't fit, retrieve it in its declaration line
and point it out. */
static void
check_modifiers (message, value, mask)
char *message;
int value;
int mask;
{
/* Should point out the one that don't fit. ASCII/unicode,
going backward. FIXME */
if (value & ~mask)
{
int i, remainder = value & ~mask;
for (i = 0; i <= 10; i++)
if ((1 << i) & remainder)
parse_error_context (ctxp->modifier_ctx [i], message,
java_accstring_lookup (1 << i));
}
}
static void
parser_add_interface (class_decl, interface_decl, wfl)
tree class_decl, interface_decl, wfl;
{
if (maybe_add_interface (TREE_TYPE (class_decl), TREE_TYPE (interface_decl)))
parse_error_context (wfl, "Interface `%s' repeated",
IDENTIFIER_POINTER (DECL_NAME (interface_decl)));
}
/* Bulk of common class/interface checks. Return 1 if an error was
encountered. TAG is 0 for a class, 1 for an interface. */
static int
check_class_interface_creation (is_interface, flags, raw_name, qualified_name, decl, cl)
int is_interface, flags;
tree raw_name, qualified_name, decl, cl;
{
tree node;
if (!quiet_flag)
fprintf (stderr, " %s %s", (is_interface ? "interface" : "class"),
IDENTIFIER_POINTER (qualified_name));
/* Scope of an interface/class type name:
- Can't be imported by a single type import
- Can't already exists in the package */
if (IS_A_SINGLE_IMPORT_CLASSFILE_NAME_P (raw_name)
&& (node = find_name_in_single_imports (raw_name)))
{
parse_error_context
(cl, "%s name `%s' clashes with imported type `%s'",
(is_interface ? "Interface" : "Class"),
IDENTIFIER_POINTER (raw_name), IDENTIFIER_POINTER (node));
return 1;
}
if (decl && CLASS_COMPLETE_P (decl))
{
classitf_redefinition_error ((is_interface ? "Interface" : "Class"),
qualified_name, decl, cl);
return 1;
}
/* If public, file name should match class/interface name */
if (flags & ACC_PUBLIC)
{
char *f;
/* Contains OS dependent assumption on path separator. FIXME */
for (f = &input_filename [strlen (input_filename)];
f != input_filename && f[0] != '/'; f--);
if (f[0] == '/')
f++;
if (strncmp (IDENTIFIER_POINTER (raw_name),
f , IDENTIFIER_LENGTH (raw_name)) ||
f [IDENTIFIER_LENGTH (raw_name)] != '.')
parse_error_context (cl, "Public %s `%s' must be defined in a file "
"called `%s.java'",
(is_interface ? "interface" : "class"),
IDENTIFIER_POINTER (qualified_name),
IDENTIFIER_POINTER (raw_name));
}
check_modifiers ((is_interface ?
"Illegal modifier `%s' for interface declaration" :
"Illegal modifier `%s' for class declaration"), flags,
(is_interface ? INTERFACE_MODIFIERS : CLASS_MODIFIERS));
return 0;
}
/* If DECL is NULL, create and push a new DECL, record the current
line CL and do other maintenance things. */
static tree
maybe_create_class_interface_decl (decl, qualified_name, cl)
tree decl, qualified_name, cl;
{
if (!decl)
decl = push_class (make_class (), qualified_name);
/* Take care of the file and line business */
DECL_SOURCE_FILE (decl) = EXPR_WFL_FILENAME (cl);
DECL_SOURCE_LINE (decl) = EXPR_WFL_LINENO (cl);
CLASS_FROM_SOURCE_P (TREE_TYPE (decl)) = 1;
CLASS_FROM_CURRENTLY_COMPILED_SOURCE_P (TREE_TYPE (decl)) =
IS_A_COMMAND_LINE_FILENAME_P (EXPR_WFL_FILENAME_NODE (cl));
ctxp->current_parsed_class = decl;
/* Link the declaration to the already seen ones */
TREE_CHAIN (decl) = ctxp->class_list;
ctxp->class_list = decl;
/* Create a new node in the global list */
ctxp->gclass_list = tree_cons (NULL_TREE, decl, ctxp->gclass_list);
/* Install a new dependency list element */
create_jdep_list (ctxp);
SOURCE_FRONTEND_DEBUG (("Defining class/interface %s",
IDENTIFIER_POINTER (qualified_name)));
return decl;
}
static void
add_superinterfaces (decl, interface_list)
tree decl, interface_list;
{
tree node;
/* Superinterface(s): if present and defined, parser_check_super_interface ()
takes care of ensuring that:
- This is an accessible interface type,
- Circularity detection.
parser_add_interface is then called. If present but not defined,
the check operation is delayed until the super interface gets
defined. */
for (node = interface_list; node; node = TREE_CHAIN (node))
{
tree current = TREE_PURPOSE (node);
tree idecl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (current));
if (idecl && CLASS_LOADED_P (TREE_TYPE (idecl)))
{
if (!parser_check_super_interface (idecl, decl, current))
parser_add_interface (decl, idecl, current);
}
else
register_incomplete_type (JDEP_INTERFACE,
current, decl, NULL_TREE);
}
}
/* Create an interface in pass1 and return its decl. Return the
interface's decl in pass 2. */
static tree
create_interface (flags, id, super)
int flags;
tree id, super;
{
tree raw_name = EXPR_WFL_NODE (id);
tree q_name = parser_qualified_classname (id);
tree decl = IDENTIFIER_CLASS_VALUE (q_name);
EXPR_WFL_NODE (id) = q_name; /* Keep source location, even if refined. */
/* Basic checks: scope, redefinition, modifiers */
if (check_class_interface_creation (1, flags, raw_name, q_name, decl, id))
return NULL_TREE;
/* Interface modifiers check
- public/abstract allowed (already done at that point)
- abstract is obsolete (comes first, it's a warning, or should be)
- Can't use twice the same (checked in the modifier rule) */
if ((flags & ACC_ABSTRACT) && flag_redundant)
parse_warning_context
(MODIFIER_WFL (ABSTRACT_TK),
"Redundant use of `abstract' modifier. Interface `%s' is implicitely "
"abstract", IDENTIFIER_POINTER (raw_name));
if (flags & ACC_PUBLIC && flags & ACC_ABSTRACT)
parse_error_context
(MODIFIER_WFL (ABSTRACT_TK),
"Can't specify both `public' and `abstract' modifiers in the "
"definition of interface `%s'", IDENTIFIER_POINTER (raw_name));
/* Create a new decl if DECL is NULL, otherwise fix it */
decl = maybe_create_class_interface_decl (decl, q_name, id);
/* Set super info and mark the class a complete */
set_super_info (ACC_ABSTRACT | ACC_INTERFACE | flags, TREE_TYPE (decl),
object_type_node, ctxp->interface_number);
ctxp->interface_number = 0;
CLASS_COMPLETE_P (decl) = 1;
add_superinterfaces (decl, super);
return decl;
}
/* Create an class in pass1 and return its decl. Return class
interface's decl in pass 2. */
static tree
create_class (flags, id, super, interfaces)
int flags;
tree id, super, interfaces;
{
tree raw_name = EXPR_WFL_NODE (id);
tree class_id, decl;
tree super_decl = NULL, super_decl_type;
class_id = parser_qualified_classname (id);
decl = IDENTIFIER_CLASS_VALUE (class_id);
ctxp->current_parsed_class_un = EXPR_WFL_NODE (id);
EXPR_WFL_NODE (id) = class_id;
/* Basic check: scope, redefinition, modifiers */
if (check_class_interface_creation (0, flags, raw_name, class_id, decl, id))
return NULL_TREE;
/* Class modifier check:
- Allowed modifier (already done at that point)
- abstract AND final forbidden
- Public classes defined in the correct file */
if ((flags & ACC_ABSTRACT) && (flags & ACC_FINAL))
parse_error_context (id, "Class `%s' can't be declared both abstract "
"and final", IDENTIFIER_POINTER (raw_name));
/* Create a new decl if DECL is NULL, otherwise fix it */
decl = maybe_create_class_interface_decl (decl, class_id, id);
/* If SUPER exists, use it, otherwise use Object */
if (super)
{
/* Can't extend java.lang.Object */
if (TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_id)) == object_type_node)
{
parse_error_context (id, "Can't extend `java.lang.Object'");
return NULL_TREE;
}
/* The class is known and exists if there is a decl. Otherwise,
postpone the operation and do it later. */
super_decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (super));
if (super_decl)
{
parser_check_super (super_decl, decl, id);
super_decl_type = TREE_TYPE (super_decl);
}
else
super_decl_type =
register_incomplete_type (JDEP_SUPER, super, decl, NULL_TREE);
}
else if (TREE_TYPE (decl) != object_type_node)
super_decl_type = object_type_node;
/* We're defining java.lang.Object */
else
super_decl_type = NULL_TREE;
/* Set super info and mark the class a complete */
set_super_info (flags, TREE_TYPE (decl), super_decl_type,
ctxp->interface_number);
ctxp->interface_number = 0;
CLASS_COMPLETE_P (decl) = 1;
add_superinterfaces (decl, interfaces);
/* Eventually sets the @deprecated tag flag */
CHECK_DEPRECATED (decl);
return decl;
}
/* Can't use lookup_field () since we don't want to load the class and
can't set the CLASS_LOADED_P flag */
static tree
find_field (class, name)
tree class;
tree name;
{
tree decl;
for (decl = TYPE_FIELDS (class); decl; decl = TREE_CHAIN (decl))
{
if (DECL_NAME (decl) == name)
return decl;
}
return NULL_TREE;
}
/* Wrap around lookup_field that doesn't potentially upset the value
of CLASS */
static tree
lookup_field_wrapper (class, name)
tree class, name;
{
tree type = class;
java_parser_context_save_global ();
return lookup_field (&type, name);
java_parser_context_restore_global ();
}
/* Find duplicate field within the same class declarations and report
the error. Returns 1 if a duplicated field was found, 0
otherwise. */
static int
duplicate_declaration_error_p (new_field_name, new_type, cl)
tree new_field_name, new_type, cl;
{
/* This might be modified to work with method decl as well */
tree decl = find_field (TREE_TYPE (ctxp->current_parsed_class),
new_field_name);
if (decl)
{
char *t1 = strdup (lang_printable_name (new_type, 1));
/* The type may not have been completed by the time we report
the error */
char *t2 = strdup (((TREE_CODE (TREE_TYPE (decl)) == POINTER_TYPE
&& TREE_TYPE (TREE_TYPE (decl)) == NULL_TREE) ?
IDENTIFIER_POINTER (TYPE_NAME (TREE_TYPE (decl))) :
lang_printable_name (TREE_TYPE (decl), 1)));
parse_error_context
(cl , "Duplicate variable declaration: `%s %s' was `%s %s' (%s:%d)",
t1, IDENTIFIER_POINTER (new_field_name),
t2, IDENTIFIER_POINTER (DECL_NAME (decl)),
DECL_SOURCE_FILE (decl), DECL_SOURCE_LINE (decl));
free (t1);
free (t2);
return 1;
}
return 0;
}
/* Field registration routine. If TYPE doesn't exist, field
declarations are linked to the undefined TYPE dependency list, to
be later resolved in java_complete_class () */
static void
register_fields (flags, type, variable_list)
int flags;
tree type, variable_list;
{
tree current, saved_type;
tree class_type = TREE_TYPE (ctxp->current_parsed_class);
int saved_lineno = lineno;
int must_chain = 0;
tree wfl = NULL_TREE;
/* If we're adding fields to interfaces, those fields are public,
static, final */
if (CLASS_INTERFACE (TYPE_NAME (class_type)))
{
OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK),
flags, ACC_PUBLIC,
"%s", "interface field(s)");
OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (STATIC_TK),
flags, ACC_STATIC,
"%s", "interface field(s)");
OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (FINAL_TK),
flags, ACC_FINAL, "%s", "interface field(s)");
check_modifiers ("Illegal interface member modifier `%s'", flags,
INTERFACE_FIELD_MODIFIERS);
flags |= (ACC_PUBLIC | ACC_STATIC | ACC_FINAL);
}
/* Obtain a suitable type for resolution, if necessary */
SET_TYPE_FOR_RESOLUTION (type, wfl, must_chain);
/* If TYPE is fully resolved and we don't have a reference, make one */
if (!must_chain && TREE_CODE (type) == RECORD_TYPE)
type = promote_type (type);
for (current = variable_list, saved_type = type; current;
current = TREE_CHAIN (current), type = saved_type)
{
tree real_type;
tree field_decl;
tree cl = TREE_PURPOSE (current);
tree init = TREE_VALUE (current);
tree current_name = EXPR_WFL_NODE (cl);
/* Process NAME, as it may specify extra dimension(s) for it */
type = build_array_from_name (type, wfl, current_name, ¤t_name);
/* Type adjustment. We may have just readjusted TYPE because
the variable specified more dimensions. Make sure we have
a reference if we can and don't have one already. Also
change the name if we have an init. */
if (type != saved_type)
{
if (!must_chain && (TREE_CODE (type) == RECORD_TYPE))
type = promote_type (type);
if (init)
EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = current_name;
}
real_type = GET_REAL_TYPE (type);
/* Check for redeclarations */
if (duplicate_declaration_error_p (current_name, real_type, cl))
continue;
/* Set lineno to the line the field was found and create a
declaration for it. Eventually sets the @deprecated tag flag. */
lineno = EXPR_WFL_LINENO (cl);
field_decl = add_field (class_type, current_name, real_type, flags);
CHECK_DEPRECATED (field_decl);
/* Check if we must chain. */
if (must_chain)
register_incomplete_type (JDEP_FIELD, wfl, field_decl, type);
/* Default value of a static field is 0 and it is considered
initialized. */
if (flags & ACC_STATIC)
INITIALIZED_P (field_decl) = 1;
/* If we have an initialization value tied to the field */
if (init)
{
/* The field is declared static */
if (flags & ACC_STATIC)
{
if (flags & ACC_FINAL)
{
if (DECL_LANG_SPECIFIC (field_decl) == NULL)
DECL_LANG_SPECIFIC (field_decl) = (struct lang_decl *)
permalloc (sizeof (struct lang_decl_var));
DECL_LOCAL_STATIC_VALUE (field_decl) =
TREE_OPERAND (init, 1);
if (TREE_CONSTANT (TREE_OPERAND (init, 1)))
DECL_INITIAL (field_decl) = TREE_OPERAND (init, 1);
}
/* Otherwise, the field should be initialized in <clinit>.
This field is remembered so we can generate <clinit> later */
else
{
INITIALIZED_P (field_decl) = 1;
TREE_CHAIN (init) = ctxp->static_initialized;
ctxp->static_initialized = init;
}
}
/* A non-static field declared with an immediate initialization is
to be initialized in <init>, if any. This field is remembered
to be processed at the time of the generation of <init>. */
else
{
INITIALIZED_P (field_decl) = 1;
TREE_CHAIN (init) = ctxp->non_static_initialized;
ctxp->non_static_initialized = init;
}
}
}
lineno = saved_lineno;
}
/* Generate the method <finit> that initializes fields initialized
upon declaration. */
static void
maybe_generate_finit ()
{
tree mdecl, current;
if (!ctxp->non_static_initialized || java_error_count)
return;
mdecl = create_artificial_method (TREE_TYPE (ctxp->current_parsed_class),
ACC_PRIVATE|ACC_FINAL, void_type_node,
finit_identifier_node, NULL_TREE);
start_artificial_method_body (mdecl);
ctxp->non_static_initialized = nreverse (ctxp->non_static_initialized);
for (current = ctxp->non_static_initialized; current;
current = TREE_CHAIN (current))
java_method_add_stmt (mdecl,
build_debugable_stmt (EXPR_WFL_LINECOL (current),
current));
end_artificial_method_body (mdecl);
CLASS_HAS_FINIT_P (TREE_TYPE (ctxp->current_parsed_class)) = 1;
ctxp->non_static_initialized = NULL_TREE;
}
/* Check whether it is necessary to generate a <clinit> for the class
we just parsed. */
static void
maybe_generate_clinit ()
{
tree mdecl, c;
if (!ctxp->static_initialized || java_error_count)
return;
mdecl = create_artificial_method (TREE_TYPE (ctxp->current_parsed_class),
ACC_STATIC, void_type_node,
clinit_identifier_node, NULL_TREE);
start_artificial_method_body (mdecl);
/* Keep initialization in order to enforce 8.5 */
ctxp->static_initialized = nreverse (ctxp->static_initialized);
/* We process the list of assignment we produced as the result of
the declaration of initialized static field and add them as
statement to the <clinit> method. */
for (c = ctxp->static_initialized; c; c = TREE_CHAIN (c))
{
/* We build the assignment expression that will initialize the
field to its value. There are strict rules on static
initializers (8.5). FIXME */
java_method_add_stmt (mdecl,
build_debugable_stmt (EXPR_WFL_LINECOL (c), c));
}
end_artificial_method_body (mdecl);
ctxp->static_initialized = NULL_TREE;
}
/* Shared accros method_declarator and method_header to remember the
patch stage that was reached during the declaration of the method.
A method DECL is built differently is there is no patch
(JDEP_NO_PATCH) or a patch (JDEP_METHOD or JDEP_METHOD_RETURN)
pending on the currently defined method. */
static int patch_stage;
/* Check the method declaration and add the method to its current
class. If the argument list is known to contain incomplete types,
the method is partially added and the registration will be resume
once the method arguments resolved. If TYPE is NULL, we're dealing
with a constructor. */
static tree
method_header (flags, type, mdecl, throws)
int flags;
tree type, mdecl, throws;
{
tree meth = TREE_VALUE (mdecl);
tree id = TREE_PURPOSE (mdecl);
tree this_class = TREE_TYPE (ctxp->current_parsed_class);
tree meth_name, returned_type, current, orig_arg;
int saved_lineno;
int constructor_ok = 0;
check_modifiers_consistency (flags);
/* There are some forbidden modifiers for an abstract method and its
class must be abstract as well. */
if (type && (flags & ACC_ABSTRACT))
{
ABSTRACT_CHECK (flags, ACC_PRIVATE, id, "Private");
ABSTRACT_CHECK (flags, ACC_STATIC, id, "Static");
ABSTRACT_CHECK (flags, ACC_FINAL, id, "Final");
ABSTRACT_CHECK (flags, ACC_NATIVE, id, "Native");
ABSTRACT_CHECK (flags, ACC_SYNCHRONIZED,id, "Synchronized");
if (!CLASS_ABSTRACT (TYPE_NAME (this_class)))
parse_error_context
(id, "Class `%s' must be declared abstract to define abstract "
"method `%s'",
IDENTIFIER_POINTER (DECL_NAME (ctxp->current_parsed_class)),
IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
}
/* Things to be checked when declaring a constructor */
if (!type)
{
int ec = java_error_count;
/* 8.6: Constructor declarations: we might be trying to define a
method without specifying a return type. */
if (EXPR_WFL_NODE (id) != ctxp->current_parsed_class_un)
parse_error_context
(id, "Invalid method declaration, return type required");
/* 8.6.3: Constructor modifiers */
else
{
JCONSTRUCTOR_CHECK (flags, ACC_ABSTRACT, id, "abstract");
JCONSTRUCTOR_CHECK (flags, ACC_STATIC, id, "static");
JCONSTRUCTOR_CHECK (flags, ACC_FINAL, id, "final");
JCONSTRUCTOR_CHECK (flags, ACC_NATIVE, id, "native");
JCONSTRUCTOR_CHECK (flags, ACC_SYNCHRONIZED, id, "synchronized");
}
/* If we found error here, we don't consider it's OK to tread
the method definition as a constructor, for the rest of this
function */
if (ec == java_error_count)
constructor_ok = 1;
}
/* Method declared within the scope of an interface are implicitly
abstract and public. Conflicts with other erroneously provided
modifiers are check right after. */
if (CLASS_INTERFACE (TYPE_NAME (this_class)))
{
/* If FLAGS isn't set because of a modifier, turn the
corresponding modifier WFL to NULL so we issue a warning on
the obsolete use of the modifier */
if (!(flags & ACC_PUBLIC))
MODIFIER_WFL (PUBLIC_TK) = NULL;
if (!(flags & ACC_ABSTRACT))
MODIFIER_WFL (ABSTRACT_TK) = NULL;
flags |= ACC_PUBLIC;
flags |= ACC_ABSTRACT;
}
/* Modifiers context reset moved up, so abstract method declaration
modifiers can be later checked. */
/* Set constructor returned type to void and method name to <init>,
unless we found an error identifier the constructor (in which
case we retain the original name) */
if (!type)
{
type = void_type_node;
if (constructor_ok)
meth_name = init_identifier_node;
}
else
meth_name = EXPR_WFL_NODE (id);
if (unresolved_type_p (type, &returned_type))
{
if (returned_type)
TREE_TYPE (meth) = returned_type;
else
{
tree itype;
patch_stage = JDEP_METHOD_RETURN;
itype = register_incomplete_type (patch_stage, type, id, NULL_TREE);
TREE_TYPE (meth) = (TREE_CODE (itype) == TREE_LIST ?
TREE_PURPOSE (itype) : itype);
}
}
else
{
if (TREE_CODE (type) == RECORD_TYPE)
type = promote_type (type);
TREE_TYPE (meth) = type;
}
saved_lineno = lineno;
/* When defining an abstract or interface method, the curly
bracket at level 1 doesn't exist because there is no function
body */
lineno = (ctxp->first_ccb_indent1 ? ctxp->first_ccb_indent1 :
EXPR_WFL_LINENO (id));
/* Remember the original argument list */
orig_arg = TYPE_ARG_TYPES (meth);
if (patch_stage) /* includes ret type and/or all args */
{
jdep *jdep;
meth = add_method_1 (this_class, flags, meth_name, meth);
/* Patch for the return type */
if (patch_stage == JDEP_METHOD_RETURN)
{
jdep = CLASSD_LAST (ctxp->classd_list);
JDEP_GET_PATCH (jdep) = &TREE_TYPE (TREE_TYPE (meth));
}
/* This is the stop JDEP. METH allows the function's signature
to be computed. */
register_incomplete_type (JDEP_METHOD_END, NULL_TREE, meth, NULL_TREE);
}
else
meth = add_method (this_class, flags, meth_name,
build_java_signature (meth));
/* Fix the method argument list so we have the argument name
information */
fix_method_argument_names (orig_arg, meth);
/* Register the parameter number and re-install the current line
number */
DECL_MAX_LOCALS (meth) = ctxp->formal_parameter_number+1;
lineno = saved_lineno;
/* Register exception specified by the `throws' keyword for
resolution and set the method decl appropriate field to the list.
Note: the grammar ensures that what we get here are class
types. */
if (throws)
{
throws = nreverse (throws);
for (current = throws; current; current = TREE_CHAIN (current))
{
register_incomplete_type (JDEP_EXCEPTION, TREE_VALUE (current),
NULL_TREE, NULL_TREE);
JDEP_GET_PATCH (CLASSD_LAST (ctxp->classd_list)) =
&TREE_VALUE (current);
}
DECL_FUNCTION_THROWS (meth) = throws;
}
/* We set the DECL_NAME to ID so we can track the location where
the function was declared. This allow us to report
redefinition error accurately. When method are verified,
DECL_NAME is reinstalled properly (using the content of the
WFL node ID) (see check_method_redefinition). We don't do that
when Object is being defined. Constructor <init> names will be
reinstalled the same way. */
if (TREE_TYPE (ctxp->current_parsed_class) != object_type_node)
DECL_NAME (meth) = id;
/* Set the flag if we correctly processed a constructor */
if (constructor_ok)
DECL_CONSTRUCTOR_P (meth) = 1;
/* Eventually set the @deprecated tag flag */
CHECK_DEPRECATED (meth);
return meth;
}
static void
fix_method_argument_names (orig_arg, meth)
tree orig_arg, meth;
{
tree arg = TYPE_ARG_TYPES (TREE_TYPE (meth));
if (TREE_CODE (TREE_TYPE (meth)) == METHOD_TYPE)
{
TREE_PURPOSE (arg) = this_identifier_node;
arg = TREE_CHAIN (arg);
}
while (orig_arg)
{
TREE_PURPOSE (arg) = TREE_PURPOSE (orig_arg);
orig_arg = TREE_CHAIN (orig_arg);
arg = TREE_CHAIN (arg);
}
}
/* Complete the method declaration with METHOD_BODY. */
static void
complete_method_declaration (method_body)
tree method_body;
{
BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)) = method_body;
maybe_absorb_scoping_blocks ();
/* Exit function's body */
exit_block ();
/* Merge last line of the function with first line, directly in the
function decl. It will be used to emit correct debug info. */
DECL_SOURCE_LINE_MERGE (current_function_decl, ctxp->last_ccb_indent1);
}
/* Build a an error message for constructor circularity errors. */
static char *
constructor_circularity_msg (from, to)
tree from, to;
{
static char string [4096];
char *t = strdup (lang_printable_name (from, 0));
sprintf (string, "`%s' invokes `%s'", t, lang_printable_name (to, 0));
free (t);
return string;
}
/* Verify a circular call to METH. Return 1 if an error is found, 0
otherwise. */
static int
verify_constructor_circularity (meth, current)
tree meth, current;
{
static tree list = NULL_TREE;
tree c;
for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
{
if (TREE_VALUE (c) == meth)
{
char *t;
if (list)
{
tree liste;
list = nreverse (list);
for (liste = list; liste; liste = TREE_CHAIN (liste))
{
parse_error_context
(TREE_PURPOSE (TREE_PURPOSE (liste)),
constructor_circularity_msg
(TREE_VALUE (liste), TREE_VALUE (TREE_PURPOSE (liste))));
java_error_count--;
}
}
t = strdup (lang_printable_name (meth, 0));
parse_error_context (TREE_PURPOSE (c),
"%s: recursive invocation of constructor `%s'",
constructor_circularity_msg (current, meth), t);
free (t);
list = NULL_TREE;
return 1;
}
}
for (c = DECL_CONSTRUCTOR_CALLS (current); c; c = TREE_CHAIN (c))
{
list = tree_cons (c, current, list);
if (verify_constructor_circularity (meth, TREE_VALUE (c)))
return 1;
list = TREE_CHAIN (list);
}
return 0;
}
/* Check modifiers that can be declared but exclusively */
static void
check_modifiers_consistency (flags)
int flags;
{
int acc_count = 0;
tree cl = NULL_TREE;
THIS_MODIFIER_ONLY (flags, ACC_PUBLIC, 0, acc_count, cl);
THIS_MODIFIER_ONLY (flags, ACC_PRIVATE, 1, acc_count, cl);
THIS_MODIFIER_ONLY (flags, ACC_PROTECTED, 2, acc_count, cl);
if (acc_count > 1)
parse_error_context
(cl, "Inconsistent member declaration. At most one of `public', "
"`private', or `protected' may be specified");
}
/* Check the methode header METH for abstract specifics features */
static void
check_abstract_method_header (meth)
tree meth;
{
int flags = get_access_flags_from_decl (meth);
/* DECL_NAME might still be a WFL node */
tree name = GET_METHOD_NAME (meth);
OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (ABSTRACT_TK), flags,
ACC_ABSTRACT, "abstract method `%s'",
IDENTIFIER_POINTER (name));
OBSOLETE_MODIFIER_WARNING (MODIFIER_WFL (PUBLIC_TK), flags,
ACC_PUBLIC, "abstract method `%s'",
IDENTIFIER_POINTER (name));
check_modifiers ("Illegal modifier `%s' for interface method",
flags, INTERFACE_METHOD_MODIFIERS);
}
/* Create a FUNCTION_TYPE node and start augmenting it with the
declared function arguments. Arguments type that can't be resolved
are left as they are, but the returned node is marked as containing
incomplete types. */
static tree
method_declarator (id, list)
tree id, list;
{
tree arg_types = NULL_TREE, current, node;
tree meth = make_node (FUNCTION_TYPE);
jdep *jdep;
patch_stage = JDEP_NO_PATCH;
for (current = list; current; current = TREE_CHAIN (current))
{
int must_chain = 0;
tree wfl_name = TREE_PURPOSE (current);
tree type = TREE_VALUE (current);
tree name = EXPR_WFL_NODE (wfl_name);
tree already, arg_node;
tree type_wfl = NULL_TREE;
/* Obtain a suitable type for resolution, if necessary */
SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
/* Process NAME, as it may specify extra dimension(s) for it */
type = build_array_from_name (type, type_wfl, name, &name);
EXPR_WFL_NODE (wfl_name) = name;
if (TREE_CODE (type) == RECORD_TYPE)
type = promote_type (type);
/* Check redefinition */
for (already = arg_types; already; already = TREE_CHAIN (already))
if (TREE_PURPOSE (already) == name)
{
parse_error_context
(wfl_name, "Variable `%s' is used more than once in the "
"argument list of method `%s'", IDENTIFIER_POINTER (name),
IDENTIFIER_POINTER (EXPR_WFL_NODE (id)));
break;
}
/* If we've an incomplete argument type, we know there is a location
to patch when the type get resolved, later. */
jdep = NULL;
if (must_chain)
{
patch_stage = JDEP_METHOD;
type = register_incomplete_type (patch_stage,
type_wfl, wfl_name, type);
jdep = CLASSD_LAST (ctxp->classd_list);
JDEP_MISC (jdep) = id;
}
/* The argument node: a name and a (possibly) incomplete type */
arg_node = build_tree_list (name, type);
if (jdep)
JDEP_GET_PATCH (jdep) = &TREE_VALUE (arg_node);
TREE_CHAIN (arg_node) = arg_types;
arg_types = arg_node;
}
TYPE_ARG_TYPES (meth) = nreverse (arg_types);
node = build_tree_list (id, meth);
return node;
}
static int
unresolved_type_p (wfl, returned)
tree wfl;
tree *returned;
{
if (TREE_CODE (wfl) == EXPR_WITH_FILE_LOCATION)
{
tree decl = IDENTIFIER_CLASS_VALUE (EXPR_WFL_NODE (wfl));
if (returned)
*returned = (decl ? TREE_TYPE (decl) : NULL_TREE);
return 1;
}
if (returned)
*returned = wfl;
return 0;
}
/* From NAME, build a qualified identifier node using the
qualification from the current package definition. */
static tree
parser_qualified_classname (name)
tree name;
{
if (ctxp->package)
return merge_qualified_name (ctxp->package, EXPR_WFL_NODE (name));
else
return EXPR_WFL_NODE (name);
}
/* Called once the type a interface extends is resolved. Returns 0 if
everything is OK. */
static int
parser_check_super_interface (super_decl, this_decl, this_wfl)
tree super_decl, this_decl, this_wfl;
{
tree super_type = TREE_TYPE (super_decl);
/* Has to be an interface */
if (!CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (super_decl))))
{
parse_error_context
(this_wfl, "Can't use %s `%s' to implement/extend %s `%s'",
(TYPE_ARRAY_P (super_type) ? "array" : "class"),
IDENTIFIER_POINTER (DECL_NAME (super_decl)),
(CLASS_INTERFACE (TYPE_NAME (TREE_TYPE (this_decl))) ?
"interface" : "class"),
IDENTIFIER_POINTER (DECL_NAME (this_decl)));
return 1;
}
/* Check scope: same package OK, other package: OK if public */
if (check_pkg_class_access (DECL_NAME (super_decl), lookup_cl (this_decl)))
return 1;
SOURCE_FRONTEND_DEBUG (("Completing interface %s with %s",
IDENTIFIER_POINTER (DECL_NAME (this_decl)),
IDENTIFIER_POINTER (DECL_NAME (super_decl))));
return 0;
}
/* Makes sure that SUPER_DECL is suitable to extend THIS_DECL. Returns
0 if everthing is OK. */
static int
parser_check_super (super_decl, this_decl, wfl)
tree super_decl, this_decl, wfl;
{
tree super_type = TREE_TYPE (super_decl);
/* SUPER should be a CLASS (neither an array nor an interface) */
if (TYPE_ARRAY_P (super_type) || CLASS_INTERFACE (TYPE_NAME (super_type)))
{
parse_error_context
(wfl, "Class `%s' can't subclass %s `%s'",
IDENTIFIER_POINTER (DECL_NAME (this_decl)),
(CLASS_INTERFACE (TYPE_NAME (super_type)) ? "interface" : "array"),
IDENTIFIER_POINTER (DECL_NAME (super_decl)));
return 1;
}
if (CLASS_FINAL (TYPE_NAME (super_type)))
{
parse_error_context (wfl, "Can't subclass final classes: %s",
IDENTIFIER_POINTER (DECL_NAME (super_decl)));
return 1;
}
/* Check scope: same package OK, other package: OK if public */
if (check_pkg_class_access (DECL_NAME (super_decl), wfl))
return 1;
SOURCE_FRONTEND_DEBUG (("Completing class %s with %s",
IDENTIFIER_POINTER (DECL_NAME (this_decl)),
IDENTIFIER_POINTER (DECL_NAME (super_decl))));
return 0;
}
/* Create a new dependency list and link it (in a LIFO manner) to the
CTXP list of type dependency list. */
static void
create_jdep_list (ctxp)
struct parser_ctxt *ctxp;
{
jdeplist *new = malloc (sizeof (jdeplist));
if (!new)
fatal ("Can't alloc jdeplist - create_jdep_list");
new->first = new->last = NULL;
new->next = ctxp->classd_list;
ctxp->classd_list = new;
}
static jdeplist *
reverse_jdep_list (ctxp)
struct parser_ctxt *ctxp;
{
register jdeplist *prev = NULL, *current, *next;
for (current = ctxp->classd_list; current; current = next)
{
next = current->next;
current->next = prev;
prev = current;
}
return prev;
}
/* Create a fake pointer based on the ID stored in the WFL */
static tree
obtain_incomplete_type (wfl)
tree wfl;
{
tree ptr;
tree name = EXPR_WFL_NODE (wfl);
for (ptr = ctxp->incomplete_class; ptr; ptr = TREE_CHAIN (ptr))
if (TYPE_NAME (TREE_PURPOSE (ptr)) == name)
break;
if (!ptr)
{
tree core;
push_obstacks (&permanent_obstack, &permanent_obstack);
BUILD_PTR_FROM_NAME (core, name);
layout_type (core);
ptr = build_tree_list (core, NULL_TREE);
pop_obstacks ();
TREE_CHAIN (ptr) = ctxp->incomplete_class;
ctxp->incomplete_class = ptr;
}
return ptr;
}
/* Register a incomplete type whose name is WFL. Reuse PTR if PTR is
non NULL instead of computing a new fake type based on WFL. The new
dependency is inserted in the current type dependency list, in FIFO
manner. */
static tree
register_incomplete_type (kind, wfl, decl, ptr)
int kind;
tree wfl, decl, ptr;
{
jdep *new = malloc (sizeof (jdep));
if (!new)
fatal ("Can't allocate new jdep - register_incomplete_type");
if (!ptr && kind != JDEP_METHOD_END) /* JDEP_METHOD_END is a mere marker */
ptr = obtain_incomplete_type (wfl);
JDEP_KIND (new) = kind;
JDEP_DECL (new) = decl;
JDEP_SOLV (new) = ptr;
JDEP_WFL (new) = wfl;
JDEP_CHAIN (new) = NULL;
JDEP_MISC (new) = NULL_TREE;
JDEP_GET_PATCH (new) = (tree *)NULL;
JDEP_INSERT (ctxp->classd_list, new);
return ptr;
}
void
java_check_circular_reference ()
{
tree current;
for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
{
tree type = TREE_TYPE (current);
if (CLASS_INTERFACE (TYPE_NAME (type)))
{
/* Check all interfaces this class extends */
tree basetype_vec = TYPE_BINFO_BASETYPES (type);
int n, i;
if (!basetype_vec)
return;
n = TREE_VEC_LENGTH (basetype_vec);
for (i = 0; i < n; i++)
{
tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
if (vec_elt && BINFO_TYPE (vec_elt) != object_type_node
&& interface_of_p (type, BINFO_TYPE (vec_elt)))
parse_error_context (lookup_cl (current),
"Cyclic interface inheritance");
}
}
else
if (inherits_from_p (CLASSTYPE_SUPER (type), type))
parse_error_context (lookup_cl (current),
"Cyclic class inheritance");
}
}
void
safe_layout_class (class)
tree class;
{
tree save_current_class = current_class;
char *save_input_filename = input_filename;
int save_lineno = lineno;
push_obstacks (&permanent_obstack, &permanent_obstack);
layout_class (class);
pop_obstacks ();
current_class = save_current_class;
input_filename = save_input_filename;
lineno = save_lineno;
CLASS_LOADED_P (class) = 1;
}
static tree
jdep_resolve_class (dep)
jdep *dep;
{
tree decl;
if (!JDEP_RESOLVED_P (dep))
{
decl =
resolve_class (JDEP_TO_RESOLVE (dep), JDEP_DECL (dep), JDEP_WFL (dep));
JDEP_RESOLVED (dep, decl);
}
else
decl = JDEP_RESOLVED_DECL (dep);
if (!decl)
{
complete_class_report_errors (dep);
return NULL_TREE;
}
return decl;
}
/* Complete unsatisfied class declaration and their dependencies */
void
java_complete_class ()
{
tree cclass;
jdeplist *cclassd;
int error_found;
tree type;
push_obstacks (&permanent_obstack, &permanent_obstack);
/* Process imports and reverse the import on demand list */
process_imports ();
if (ctxp->import_demand_list)
ctxp->import_demand_list = nreverse (ctxp->import_demand_list);
/* Rever things so we have the right order */
ctxp->class_list = nreverse (ctxp->class_list);
ctxp->classd_list = reverse_jdep_list (ctxp);
for (cclassd = ctxp->classd_list, cclass = ctxp->class_list;
cclass && cclassd;
cclass = TREE_CHAIN (cclass), cclassd = CLASSD_CHAIN (cclassd))
{
jdep *dep;
for (dep = CLASSD_FIRST (cclassd); dep; dep = JDEP_CHAIN (dep))
{
tree decl;
if (!(decl = jdep_resolve_class (dep)))
continue;
/* Now it's time to patch */
switch (JDEP_KIND (dep))
{
case JDEP_SUPER:
/* Simply patch super */
if (parser_check_super (decl, JDEP_DECL (dep), JDEP_WFL (dep)))
continue;
BINFO_TYPE (TREE_VEC_ELT (BINFO_BASETYPES (TYPE_BINFO
(TREE_TYPE (JDEP_DECL (dep)))), 0)) = TREE_TYPE (decl);
break;
case JDEP_FIELD:
{
/* We do part of the job done in add_field */
tree field_decl = JDEP_DECL (dep);
tree field_type = TREE_TYPE (decl);
push_obstacks (&permanent_obstack, &permanent_obstack);
if (TREE_CODE (field_type) == RECORD_TYPE)
field_type = promote_type (field_type);
pop_obstacks ();
TREE_TYPE (field_decl) = field_type;
DECL_ALIGN (field_decl) = 0;
layout_decl (field_decl, 0);
SOURCE_FRONTEND_DEBUG
(("Completed field/var decl `%s' with `%s'",
IDENTIFIER_POINTER (DECL_NAME (field_decl)),
IDENTIFIER_POINTER (DECL_NAME (decl))));
break;
}
case JDEP_METHOD: /* We start patching a method */
case JDEP_METHOD_RETURN:
error_found = 0;
while (1)
{
if (decl)
{
type = TREE_TYPE(decl);
if (TREE_CODE (type) == RECORD_TYPE)
type = promote_type (type);
JDEP_APPLY_PATCH (dep, type);
SOURCE_FRONTEND_DEBUG
(((JDEP_KIND (dep) == JDEP_METHOD_RETURN ?
"Completing fct `%s' with ret type `%s'":
"Completing arg `%s' with type `%s'"),
IDENTIFIER_POINTER (EXPR_WFL_NODE
(JDEP_DECL_WFL (dep))),
IDENTIFIER_POINTER (DECL_NAME (decl))));
}
else
error_found = 1;
dep = JDEP_CHAIN (dep);
if (JDEP_KIND (dep) == JDEP_METHOD_END)
break;
else
decl = jdep_resolve_class (dep);
}
if (!error_found)
{
tree mdecl = JDEP_DECL (dep), signature;
push_obstacks (&permanent_obstack, &permanent_obstack);
/* Recompute and reset the signature */
signature = build_java_signature (TREE_TYPE (mdecl));
set_java_signature (TREE_TYPE (mdecl), signature);
pop_obstacks ();
}
else
continue;
break;
case JDEP_INTERFACE:
if (parser_check_super_interface (decl, JDEP_DECL (dep),
JDEP_WFL (dep)))
continue;
parser_add_interface (JDEP_DECL (dep), decl, JDEP_WFL (dep));
break;
case JDEP_PARM:
case JDEP_VARIABLE:
type = TREE_TYPE(decl);
if (TREE_CODE (type) == RECORD_TYPE)
type = promote_type (type);
JDEP_APPLY_PATCH (dep, type);
break;
case JDEP_TYPE:
JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
SOURCE_FRONTEND_DEBUG
(("Completing a random type dependency on a '%s' node",
tree_code_name [TREE_CODE (JDEP_DECL (dep))]));
break;
case JDEP_EXCEPTION:
JDEP_APPLY_PATCH (dep, TREE_TYPE (decl));
SOURCE_FRONTEND_DEBUG
(("Completing `%s' `throws' argument node",
IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep)))));
break;
default:
fatal ("Can't handle patch code %d - java_complete_class",
JDEP_KIND (dep));
}
}
}
pop_obstacks ();
return;
}
/* Resolve class CLASS_TYPE. Handle the case of trying to resolve an
array. */
static tree
resolve_class (class_type, decl, cl)
tree class_type, decl, cl;
{
char *name = IDENTIFIER_POINTER (TYPE_NAME (class_type));
char *base = name;
tree resolved_type, resolved_type_decl;
/* 1- Check to see if we have an array. If true, find what we really
want to resolve */
while (name[0] == '[')
name++;
if (base != name)
TYPE_NAME (class_type) = get_identifier (name);
/* 2- Resolve the bare type */
if (!(resolved_type_decl = do_resolve_class (class_type, decl, cl)))
return NULL_TREE;
resolved_type = TREE_TYPE (resolved_type_decl);
/* 3- If we have and array, reconstruct the array down to its nesting */
if (base != name)
{
while (base != name)
{
if (TREE_CODE (resolved_type) == RECORD_TYPE)
resolved_type = promote_type (resolved_type);
resolved_type = build_java_array_type (resolved_type, -1);
CLASS_LOADED_P (resolved_type) = 1;
name--;
}
/* Build a fake decl for this, since this is what is expected to
be returned. */
resolved_type_decl =
build_decl (TYPE_DECL, TYPE_NAME (resolved_type), resolved_type);
/* Figure how those two things are important for error report. FIXME */
DECL_SOURCE_LINE (resolved_type_decl) = 0;
DECL_SOURCE_FILE (resolved_type_decl) = input_filename;
}
return resolved_type_decl;
}
/* Effectively perform the resolution of class CLASS_TYPE. DECL or CL
are used to report error messages. */
static tree
do_resolve_class (class_type, decl, cl)
tree class_type;
tree decl;
tree cl;
{
tree new_class_decl;
tree original_name = NULL_TREE;
/* Do not try to replace TYPE_NAME (class_type) by a variable, since
its is changed by find_in_imports{_on_demand} */
/* 1- Check for the type in single imports */
if (find_in_imports (class_type))
return NULL_TREE;
/* 2- And check for the type in the current compilation unit. If it fails,
try with a name qualified with the package name if appropriate. */
if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
{
if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)) &&
!CLASS_FROM_SOURCE_P (TREE_TYPE (new_class_decl)))
load_class (TYPE_NAME (class_type), 0);
return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
}
original_name = TYPE_NAME (class_type);
if (!QUALIFIED_P (TYPE_NAME (class_type)) && ctxp->package)
TYPE_NAME (class_type) = merge_qualified_name (ctxp->package,
TYPE_NAME (class_type));
if (!(new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
load_class (TYPE_NAME (class_type), 0);
if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
{
if (!CLASS_LOADED_P (TREE_TYPE (new_class_decl)) &&
!CLASS_FROM_SOURCE_P (TREE_TYPE (new_class_decl)))
load_class (TYPE_NAME (class_type), 0);
return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
}
TYPE_NAME (class_type) = original_name;
/* 3- Check an other compilation unit that bears the name of type */
load_class (TYPE_NAME (class_type), 0);
if (check_pkg_class_access (TYPE_NAME (class_type),
(cl ? cl : lookup_cl (decl))))
return NULL_TREE;
if ((new_class_decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type))))
return new_class_decl;
/* 4- Check the import on demands. Don't allow bar.baz to be
imported from foo.* */
if (!QUALIFIED_P (TYPE_NAME (class_type)))
if (find_in_imports_on_demand (class_type))
return NULL_TREE;
/* 5- Last call for a resolution */
return IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
}
/* Resolve NAME and lay it out (if not done and if not the current
parsed class). Return a decl node. */
static tree
resolve_and_layout (something, cl)
tree something;
tree cl;
{
tree decl;
if (TREE_CODE (something) == POINTER_TYPE)
something = TREE_TYPE (something);
if (JPRIMITIVE_TYPE_P (something) || something == void_type_node)
return NULL_TREE;
if (TREE_CODE (something) != IDENTIFIER_NODE)
something = (TREE_CODE (TYPE_NAME (something)) == TYPE_DECL ?
DECL_NAME (TYPE_NAME (something)) : TYPE_NAME (something));
decl = resolve_no_layout (something, cl);
if (decl && TREE_TYPE (decl) != current_class
&& !CLASS_LOADED_P (TREE_TYPE (decl)))
safe_layout_class (TREE_TYPE (decl));
return decl;
}
/* Resolve a class, returns its decl but doesn't perform any
layout. The current parsing context is saved and restored */
static tree
resolve_no_layout (name, cl)
tree name, cl;
{
tree ptr, decl;
BUILD_PTR_FROM_NAME (ptr, name);
java_parser_context_save_global ();
decl = resolve_class (ptr, NULL_TREE, cl);
java_parser_context_restore_global ();
return decl;
}
/* Called to report errors. Skip leader '[' in a complex array type
description that failed to be resolved. */
static char *
purify_type_name (name)
char *name;
{
while (*name && *name == '[')
name++;
return name;
}
/* The type CURRENT refers to can't be found. We print error messages. */
static void
complete_class_report_errors (dep)
jdep *dep;
{
switch (JDEP_KIND (dep))
{
case JDEP_SUPER:
parse_error_context
(JDEP_WFL (dep), "Superclass `%s' of class `%s' not found",
IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
break;
case JDEP_FIELD:
parse_error_context
(JDEP_WFL (dep), "Type `%s' not found in declaration of field `%s'",
IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
break;
case JDEP_METHOD: /* Covers arguments */
parse_error_context
(JDEP_WFL (dep), "Type `%s' not found in the declaration of the "
"argument `%s' of method `%s'",
IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))),
IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_MISC (dep))));
break;
case JDEP_METHOD_RETURN: /* Covers return type */
parse_error_context
(JDEP_WFL (dep), "Type `%s' not found in the declaration of the "
"return type of method `%s'",
IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_DECL_WFL (dep))));
break;
case JDEP_INTERFACE:
parse_error_context
(JDEP_WFL (dep), "Superinterface `%s' of %s `%s' not found",
IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))),
(CLASS_OR_INTERFACE (JDEP_DECL (dep), "class", "interface")),
IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
break;
case JDEP_VARIABLE:
parse_error_context
(JDEP_WFL (dep), "Type `%s' not found in the declaration of the "
"local variable `%s'",
purify_type_name (IDENTIFIER_POINTER
(EXPR_WFL_NODE (JDEP_WFL (dep)))),
IDENTIFIER_POINTER (DECL_NAME (JDEP_DECL (dep))));
break;
case JDEP_EXCEPTION: /* As specified by `throws' */
parse_error_context
(JDEP_WFL (dep), "Class `%s' not found in `throws'",
IDENTIFIER_POINTER (EXPR_WFL_NODE (JDEP_WFL (dep))));
break;
default:
/* Fix for -Wall. Just break doing nothing. The error will be
caught later */
break;
}
}
/* Check uninitialized final. */
void
java_check_final ()
{
}
/* Return a static string containing the DECL prototype string. If
DECL is a constructor, use the class name instead of the form
<init> */
static char *
get_printable_method_name (decl)
tree decl;
{
char *to_return;
tree name;
if (DECL_CONSTRUCTOR_P (decl))
{
name = DECL_NAME (decl);
DECL_NAME (decl) = DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)));
}
to_return = lang_printable_name (decl, 0);
if (DECL_CONSTRUCTOR_P (decl))
DECL_NAME (decl) = name;
return to_return;
}
/* Reinstall the proper DECL_NAME on METHOD. Return 0 if the method
nevertheless needs to be verfied, 1 otherwise. */
static int
reset_method_name (method)
tree method;
{
if (DECL_NAME (method) != clinit_identifier_node
&& DECL_NAME (method) != finit_identifier_node)
{
/* NAME is just the plain name when Object is being defined */
if (DECL_CONTEXT (method) != object_type_node)
DECL_NAME (method) = (DECL_CONSTRUCTOR_P (method) ?
init_identifier_node : GET_METHOD_NAME (method));
return 0;
}
else
return 1;
}
/* Return the name of METHOD_DECL, when DECL_NAME is a WFL */
tree
java_get_real_method_name (method_decl)
tree method_decl;
{
tree method_name = DECL_NAME (method_decl);
if (DECL_CONSTRUCTOR_P (method_decl))
return init_identifier_node;
else if (ctxp
&& ctxp->current_parsed_class_un == EXPR_WFL_NODE (method_name))
return init_identifier_node;
else
return EXPR_WFL_NODE (method_name);
}
/* Track method being redefined inside the same class. As a side
effect, set DECL_NAME to an IDENTIFIER (prior entering this
function it's a FWL, so we can track errors more accurately */
static int
check_method_redefinition (class, method)
tree class, method;
{
tree redef, name;
tree cl = DECL_NAME (method);
tree sig = TYPE_LANG_SPECIFIC (TREE_TYPE (method))->signature;
/* decl name of artificial <clinit> and <finit> doesn't need to be fixed and
checked */
/* Reset the method name before running the check. If it returns 1,
the method doesn't need to be verified with respect to method
redeclaration and we return 0 */
if (reset_method_name (method))
return 0;
name = DECL_NAME (method);
for (redef = TYPE_METHODS (class); redef; redef = TREE_CHAIN (redef))
{
struct lang_type *t = TYPE_LANG_SPECIFIC (TREE_TYPE (redef));
if (! t || (redef == method))
break;
if (DECL_NAME (redef) == name && sig == t->signature)
{
parse_error_context
(cl, "Duplicate %s declaration `%s'",
(DECL_CONSTRUCTOR_P (redef) ? "constructor" : "method"),
get_printable_method_name (redef));
return 1;
}
}
return 0;
}
/* Check all the methods of CLASS. Methods are first completed then
checked according to regular method existance rules.
If no constructor were encountered, then build its declaration. */
static void
java_check_regular_methods (class_decl)
tree class_decl;
{
int saw_constructor = 0;
tree method;
tree class = CLASS_TO_HANDLE_TYPE (TREE_TYPE (class_decl));
tree super_class = CLASSTYPE_SUPER (class);
tree saved_found_wfl = NULL_TREE, found = NULL_TREE;
tree mthrows;
/* It is not necessary to check methods defined in java.lang.Object */
if (class == object_type_node)
return;
TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
/* Should take interfaces into account. FIXME */
for (method = TYPE_METHODS (class); method; method = TREE_CHAIN (method))
{
tree sig;
tree method_wfl = DECL_NAME (method);
int aflags;
/* If we previously found something and its name was saved,
reinstall it now */
if (found && saved_found_wfl)
DECL_NAME (found) = saved_found_wfl;
/* Check for redefinitions */
if (check_method_redefinition (class, method))
continue;
/* If we see one constructor a mark so we don't generate the
default one. Also skip other verifications: constructors
can't be inherited hence hiden or overriden */
if (DECL_CONSTRUCTOR_P (method))
{
saw_constructor = 1;
continue;
}
/* We verify things thrown by the method. They must inherits from
java.lang.Throwable */
for (mthrows = DECL_FUNCTION_THROWS (method);
mthrows; mthrows = TREE_CHAIN (mthrows))
{
if (!inherits_from_p (TREE_VALUE (mthrows), throwable_type_node))
parse_error_context
(TREE_PURPOSE (mthrows), "Class `%s' in `throws' clause must be "
"a subclass of class `java.lang.Throwable'",
IDENTIFIER_POINTER
(DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))));
}
sig = build_java_argument_signature (TREE_TYPE (method));
found = lookup_argument_method (super_class, DECL_NAME (method), sig);
/* Nothing overrides or it's a private method. */
if (!found || (found && METHOD_PRIVATE (found)))
continue;
/* If found wasn't verified, it's DECL_NAME won't be set properly.
We set it temporarily for the sake of the error report. */
saved_found_wfl = DECL_NAME (found);
reset_method_name (found);
/* Can't override a method with the same name and different return
types. */
if (TREE_TYPE (TREE_TYPE (found)) != TREE_TYPE (TREE_TYPE (method)))
{
char *t = strdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)),
0));
parse_error_context
(method_wfl,
"Method `%s' was defined with return type `%s' in class `%s'",
lang_printable_name (found, 0), t,
IDENTIFIER_POINTER
(DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
free (t);
}
/* Can't override final. Can't override static. */
if (METHOD_FINAL (found) || METHOD_STATIC (found))
{
/* Static *can* override static */
if (METHOD_STATIC (found) && METHOD_STATIC (method))
continue;
parse_error_context
(method_wfl,
"%s methods can't be overriden. Method `%s' is %s in class `%s'",
(METHOD_FINAL (found) ? "Final" : "Static"),
lang_printable_name (found, 0),
(METHOD_FINAL (found) ? "final" : "static"),
IDENTIFIER_POINTER
(DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
continue;
}
/* Static method can't override instance method. */
if (METHOD_STATIC (method))
{
parse_error_context
(method_wfl,
"Instance methods can't be overriden by a static method. Method "
"`%s' is an instance method in class `%s'",
lang_printable_name (found, 0),
IDENTIFIER_POINTER
(DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
continue;
}
aflags = get_access_flags_from_decl (found);
/* - Overriding/hiding public must be public
- Overriding/hiding protected must be protected or public
- If the overriden or hidden method has default (package)
access, then the overriding or hiding method must not be
private; otherwise, a compile-time error occurs */
if ((METHOD_PUBLIC (found) && !METHOD_PUBLIC (method))
|| (METHOD_PROTECTED (found)
&& !(METHOD_PUBLIC (method) || METHOD_PROTECTED (method)))
|| (!(aflags & (ACC_PUBLIC | ACC_PRIVATE | ACC_STATIC))
&& METHOD_PRIVATE (method)))
{
parse_error_context
(method_wfl,
"Methods can't be overridden to be more private. Method `%s' is "
"not %s in class `%s'", lang_printable_name (method, 0),
(METHOD_PUBLIC (method) ? "public" :
(METHOD_PRIVATE (method) ? "private" : "protected")),
IDENTIFIER_POINTER (DECL_NAME
(TYPE_NAME (DECL_CONTEXT (found)))));
continue;
}
/* Overriding methods must have compatible `throws' clauses on checked
exceptions, if any */
check_throws_clauses (method, method_wfl, found);
/* If the method has default access in an other package, then
issue a warning that the current method doesn't override the
one that was found elsewhere. Do not issue this warning when
the match was found in java.lang.Object. */
if (DECL_CONTEXT (found) != object_type_node
&& (!aflags || (aflags > ACC_PROTECTED))
&& !class_in_current_package (DECL_CONTEXT (found))
&& flag_not_overriding)
parse_warning_context
(method_wfl, "Method `%s' in class `%s' does not "
"override the corresponding method in class `%s', which is "
"private to a different package",
lang_printable_name (found, 0),
IDENTIFIER_POINTER (DECL_NAME (class_decl)),
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
/* Inheriting multiple methods with the same signature. FIXME */
}
/* Don't forget eventual pending found and saved_found_wfl. Take
into account that we might have exited because we saw an
aritifical method as the last entry. */
if (found && !DECL_ARTIFICIAL (found) && saved_found_wfl)
DECL_NAME (found) = saved_found_wfl;
TYPE_METHODS (class) = nreverse (TYPE_METHODS (class));
if (!saw_constructor)
{
/* No constructor seen, we craft one, at line 0 */
int flags;
tree decl;
/* If the class is declared PUBLIC, the default constructor is
PUBLIC otherwise it has default access implied by no access
modifiers. */
flags = (get_access_flags_from_decl (class_decl) & ACC_PUBLIC ?
ACC_PUBLIC : 0);
decl = create_artificial_method (class, flags, void_type_node,
init_identifier_node, NULL_TREE);
DECL_CONSTRUCTOR_P (decl) = 1;
}
}
/* Return a non zero value if the `throws' clause of METHOD (if any)
is incompatible with the `throws' clause of FOUND (if any). */
static void
check_throws_clauses (method, method_wfl, found)
tree method, method_wfl, found;
{
tree mthrows, fthrows;
/* Can't check these things with class loaded from bytecode. FIXME */
if (!CLASS_FROM_SOURCE_P (DECL_CONTEXT (found)))
return;
for (mthrows = DECL_FUNCTION_THROWS (method);
mthrows; mthrows = TREE_CHAIN (mthrows))
{
/* We don't verify unchecked expressions */
if (IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (mthrows)))
continue;
/* Checked expression must be compatible */
for (fthrows = DECL_FUNCTION_THROWS (found);
fthrows; fthrows = TREE_CHAIN (fthrows))
if (inherits_from_p (TREE_VALUE (mthrows), TREE_VALUE (fthrows)))
break;
if (!fthrows)
{
parse_error_context
(method_wfl, "Invalid checked exception class `%s' in "
"`throws' clause. The exception must be a subclass of an "
"exception thrown by `%s' from class `%s'",
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (TREE_VALUE (mthrows)))),
lang_printable_name (found, 0),
IDENTIFIER_POINTER
(DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
}
}
}
/* Check abstract method of interface INTERFACE */
static void
java_check_abstract_methods (interface_decl)
tree interface_decl;
{
int i, n;
tree method, basetype_vec, found;
tree interface = TREE_TYPE (interface_decl);
for (method = TYPE_METHODS (interface); method; method = TREE_CHAIN (method))
{
tree method_wfl = DECL_NAME (method);
/* 2- Check for double definition inside the defining interface */
if (check_method_redefinition (interface, method))
continue;
/* 3- Overriding is OK as far as we preserve the return type and
the thrown exceptions (FIXME) */
found = lookup_java_interface_method2 (interface, method);
if (found)
{
char *t;
tree saved_found_wfl = DECL_NAME (found);
reset_method_name (found);
t = strdup (lang_printable_name (TREE_TYPE (TREE_TYPE (found)), 0));
parse_error_context
(method_wfl,
"Method `%s' was defined with return type `%s' in class `%s'",
lang_printable_name (found, 0), t,
IDENTIFIER_POINTER
(DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
free (t);
continue;
DECL_NAME (found) = saved_found_wfl;
}
}
/* 4- Inherited methods can't differ by their returned types */
if (!(basetype_vec = TYPE_BINFO_BASETYPES (interface)))
return;
n = TREE_VEC_LENGTH (basetype_vec);
for (i = 0; i < n; i++)
{
tree sub_interface_method, sub_interface;
tree vec_elt = TREE_VEC_ELT (basetype_vec, i);
if (!vec_elt)
continue;
sub_interface = BINFO_TYPE (vec_elt);
for (sub_interface_method = TYPE_METHODS (sub_interface);
sub_interface_method;
sub_interface_method = TREE_CHAIN (sub_interface_method))
{
found = lookup_java_interface_method2 (interface,
sub_interface_method);
if (found && (found != sub_interface_method))
{
tree saved_found_wfl = DECL_NAME (found);
reset_method_name (found);
parse_error_context
(lookup_cl (sub_interface_method),
"Interface `%s' inherits method `%s' from interface `%s'. "
"This method is redefined with a different return type in "
"interface `%s'",
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (interface))),
lang_printable_name (found, 0),
IDENTIFIER_POINTER
(DECL_NAME (TYPE_NAME
(DECL_CONTEXT (sub_interface_method)))),
IDENTIFIER_POINTER
(DECL_NAME (TYPE_NAME (DECL_CONTEXT (found)))));
DECL_NAME (found) = saved_found_wfl;
}
}
}
}
/* Check the method on all the defined classes. Process all the
classes that we compiled from source code for this CU. */
void
java_check_methods ()
{
tree current;
for (current = ctxp->gclass_list; current; current = TREE_CHAIN (current))
if (CLASS_FROM_SOURCE_P (TREE_TYPE (TREE_VALUE (current))))
CHECK_METHODS (TREE_VALUE (current));
}
/* Lookup methods in interfaces using their name and partial
signature. Return a matching method only if their types differ. */
static tree
lookup_java_interface_method2 (class, method_decl)
tree class, method_decl;
{
int i, n;
tree basetype_vec = TYPE_BINFO_BASETYPES (class), to_return;
if (!basetype_vec)
return NULL_TREE;
n = TREE_VEC_LENGTH (basetype_vec);
for (i = 0; i < n; i++)
{
tree vec_elt = TREE_VEC_ELT (basetype_vec, i), to_return;
if ((BINFO_TYPE (vec_elt) != object_type_node)
&& (to_return =
lookup_java_method2 (BINFO_TYPE (vec_elt), method_decl, 1)))
return to_return;
}
for (i = 0; i < n; i++)
{
to_return = lookup_java_interface_method2
(BINFO_TYPE (TREE_VEC_ELT (basetype_vec, i)), method_decl);
if (to_return)
return to_return;
}
return NULL_TREE;
}
/* Lookup method using their name and partial signature. Return a
matching method only if their types differ. */
static tree
lookup_java_method2 (clas, method_decl, do_interface)
tree clas, method_decl;
int do_interface;
{
tree method, method_signature, method_name, method_type, name;
method_signature = build_java_argument_signature (TREE_TYPE (method_decl));
name = DECL_NAME (method_decl);
method_name = (TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
EXPR_WFL_NODE (name) : name);
method_type = TREE_TYPE (TREE_TYPE (method_decl));
while (clas != NULL_TREE)
{
for (method = TYPE_METHODS (clas);
method != NULL_TREE; method = TREE_CHAIN (method))
{
tree method_sig = build_java_argument_signature (TREE_TYPE (method));
tree name = DECL_NAME (method);
if ((TREE_CODE (name) == EXPR_WITH_FILE_LOCATION ?
EXPR_WFL_NODE (name) : name) == method_name
&& method_sig == method_signature
&& TREE_TYPE (TREE_TYPE (method)) != method_type)
return method;
}
clas = (do_interface ? NULL_TREE : CLASSTYPE_SUPER (clas));
}
return NULL_TREE;
}
/* Return the line that matches DECL line number. Used during error
report */
static tree
lookup_cl (decl)
tree decl;
{
static tree cl = NULL_TREE;
if (!decl)
return NULL_TREE;
if (cl == NULL_TREE)
cl = build_expr_wfl (NULL_TREE, NULL, 0, 0);
EXPR_WFL_FILENAME_NODE (cl) = get_identifier (DECL_SOURCE_FILE (decl));
EXPR_WFL_SET_LINECOL (cl, DECL_SOURCE_LINE_FIRST (decl), -1);
return cl;
}
/* Look for a simple name in the single-type import list */
static tree
find_name_in_single_imports (name)
tree name;
{
tree node;
for (node = ctxp->import_list; node; node = TREE_CHAIN (node))
if (TREE_VALUE (node) == name)
return (EXPR_WFL_NODE (TREE_PURPOSE (node)));
return NULL_TREE;
}
/* Process all single-type import. */
static int
process_imports ()
{
tree import;
int error_found;
for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
{
tree to_be_found = EXPR_WFL_NODE (TREE_PURPOSE (import));
/* Don't load twice something already defined. */
if (IDENTIFIER_CLASS_VALUE (to_be_found))
continue;
QUALIFIED_P (to_be_found) = 1;
load_class (to_be_found, 0);
error_found =
check_pkg_class_access (to_be_found, TREE_PURPOSE (import));
if (!IDENTIFIER_CLASS_VALUE (to_be_found))
{
parse_error_context (TREE_PURPOSE (import),
"Class or interface `%s' not found in import",
IDENTIFIER_POINTER (to_be_found));
return 1;
}
if (error_found)
return 1;
}
return 0;
}
/* Possibly find a class imported by a single-type import statement. Return
1 if an error occured, 0 otherwise. */
static int
find_in_imports (class_type)
tree class_type;
{
tree import;
for (import = ctxp->import_list; import; import = TREE_CHAIN (import))
if (TREE_VALUE (import) == TYPE_NAME (class_type))
{
TYPE_NAME (class_type) = EXPR_WFL_NODE (TREE_PURPOSE (import));
QUALIFIED_P (TYPE_NAME (class_type)) = 1;
}
return 0;
}
/* Process a import on demand statement (lazy) */
static int
read_import_entry (jcf, dirp, returned_name)
JCF *jcf;
DIR *dirp;
char **returned_name;
{
if (dirp)
{
struct dirent *direntp = readdir (dirp);
if (!direntp)
{
*returned_name = NULL;
return 0;
}
else
{
*returned_name = direntp->d_name;
return (strlen (direntp->d_name));
}
}
else
{
int current_dir_len = strlen (jcf->classname);
char *current_entry;
int current_entry_len;
/* Here we read a zip directory as a file directory. The files
we're selecting must have the same root than the directory
we're examining. */
ZipDirectory *zipd = (ZipDirectory *)jcf->zipd;
while (zipd)
{
current_entry = ZIPDIR_FILENAME (zipd);
current_entry_len = zipd->filename_length;
while (current_entry_len && current_entry [current_entry_len] != '/')
current_entry_len--;
/* If the path of the current file doesn't match the directory we're
scanning, that the end of the search */
current_entry_len++;
if (strncmp (jcf->classname, current_entry, current_dir_len))
{
*returned_name = NULL;
return 0;
}
/* Ok, we have at least the same path. The position of the last '/'
of the current file we're examining should match the size of
name of the directory we're browsing, otherwise that an entry
belonging to a sub directory, we want to skip it. */
if (current_entry_len != current_dir_len)
zipd = ZIPDIR_NEXT (zipd);
else
{
jcf->zipd = ZIPDIR_NEXT (zipd); /* Prepare next read */
*returned_name = ¤t_entry [current_entry_len];
return (zipd->filename_length - current_entry_len);
}
}
*returned_name = NULL;
return 0;
}
}
/* Read a import directory, gathering potential match for further type
references. Indifferently reads a filesystem or a ZIP archive
directory. */
static void
read_import_dir (wfl)
tree wfl;
{
char *name = IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl));
int name_len = IDENTIFIER_LENGTH (EXPR_WFL_NODE (wfl)), reclen;
DIR *dirp = NULL;
JCF jcfr, *jcf, *saved_jcf = current_jcf;
char *founddirname, *d_name;
jcf = &jcfr;
if (!(founddirname = find_class (name, name_len, jcf, 0)))
fatal ("Can't import `%s'", name);
if (jcf->outofsynch)
jcf_out_of_synch (jcf);
if (jcf->seen_in_zip)
jcf->zipd = ZIPDIR_NEXT ((ZipDirectory *)jcf->zipd);
else if (founddirname)
dirp = opendir (founddirname);
if (!founddirname && !dirp)
{
static int first = 1;
if (first)
{
char buffer [256];
sprintf (buffer, "Can't find default package `%s'. Check "
"the CLASSPATH environment variable and the access to the "
"archives.", name);
error (buffer);
java_error_count++;
first = 0;
}
else
parse_error_context (wfl, "Package `%s' not found in import", name);
current_jcf = saved_jcf;
return;
}
/* Here we should have a unified way of retrieving an entry, to be
indexed. */
while ((reclen = read_import_entry (jcf, dirp, &d_name)))
{
int java_or_class = 0;
int len;
if ((reclen > 5)
&& !strcmp (&d_name [reclen-5], ".java"))
{
java_or_class = 1;
len = reclen - 5;
}
if (!java_or_class && (reclen > 6) &&
!strcmp (&d_name [reclen-6], ".class"))
{
java_or_class = 2;
len = reclen - 6;
}
if (java_or_class)
{
char *id_name;
tree node;
obstack_grow (&temporary_obstack, name, name_len);
obstack_1grow (&temporary_obstack, '/');
obstack_grow0 (&temporary_obstack, d_name, len);
id_name = obstack_finish (&temporary_obstack);
node = get_identifier (id_name);
IS_A_CLASSFILE_NAME (node) = 1; /* Or soon to be */
QUALIFIED_P (node) = 1; /* As soon as we turn / into . */
}
}
if (dirp)
closedir (dirp);
current_jcf = saved_jcf;
}
/* Possibly find a type in the import on demands specified
types. Returns 1 if an error occured, 0 otherwise. Run throught the
entire list, to detected potential double definitions. */
static int
find_in_imports_on_demand (class_type)
tree class_type;
{
tree node, import, node_to_use;
int seen_once = -1;
tree cl;
for (import = ctxp->import_demand_list; import; import = TREE_CHAIN (import))
{
char *id_name;
obstack_grow (&temporary_obstack,
IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))),
IDENTIFIER_LENGTH (EXPR_WFL_NODE (TREE_PURPOSE (import))));
obstack_1grow (&temporary_obstack, '/');
obstack_grow0 (&temporary_obstack,
IDENTIFIER_POINTER (TYPE_NAME (class_type)),
IDENTIFIER_LENGTH (TYPE_NAME (class_type)));
id_name = obstack_finish (&temporary_obstack);
node = maybe_get_identifier (id_name);
if (node && IS_A_CLASSFILE_NAME (node))
{
if (seen_once < 0)
{
cl = TREE_PURPOSE (import);
seen_once = 1;
node_to_use = node;
}
else
{
seen_once++;
parse_error_context
(import, "Type `%s' also potentially defined in package `%s'",
IDENTIFIER_POINTER (TYPE_NAME (class_type)),
IDENTIFIER_POINTER (EXPR_WFL_NODE (TREE_PURPOSE (import))));
}
}
}
if (seen_once == 1)
{
/* Setup lineno so that it refers to the line of the import (in
case we parse a class file and encounter errors */
tree decl;
int saved_lineno = lineno;
lineno = EXPR_WFL_LINENO (cl);
TYPE_NAME (class_type) = ident_subst (IDENTIFIER_POINTER (node_to_use),
IDENTIFIER_LENGTH (node_to_use),
"", '/', '.', "");
QUALIFIED_P (TYPE_NAME (class_type)) = 1;
decl = IDENTIFIER_CLASS_VALUE (TYPE_NAME (class_type));
/* If there is no DECL set for the class or if the class isn't
loaded and not seen in source yet, the load */
if (!decl || (!CLASS_LOADED_P (TREE_TYPE (decl))
&& !CLASS_FROM_SOURCE_P (TREE_TYPE (decl))))
load_class (node_to_use, 0);
lineno = saved_lineno;
return check_pkg_class_access (TYPE_NAME (class_type), cl);
}
else
return (seen_once < 0 ? 0 : seen_once); /* It's ok not to have found */
}
static tree
resolve_package (pkg, next)
tree pkg, *next;
{
tree type_name = NULL_TREE;
char *name = IDENTIFIER_POINTER (EXPR_WFL_NODE (pkg));
/* The trick is to determine when the package name stops and were
the name of something contained in the package starts. Then we
return a fully qualified name of what we want to get. */
/* Do a quick search on well known package names */
if (!strncmp (name, "java.lang.reflect", 17))
{
*next =
TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (EXPR_WFL_QUALIFICATION (pkg))));
type_name = lookup_package_type (name, 17);
}
else if (!strncmp (name, "java.lang", 9))
{
*next = TREE_CHAIN (TREE_CHAIN (EXPR_WFL_QUALIFICATION (pkg)));
type_name = lookup_package_type (name, 9);
}
else
return NULL_TREE; /* FIXME, search all imported packages. */
return type_name;
}
static tree
lookup_package_type (name, from)
char *name;
int from;
{
char subname [128];
char *sub = &name[from+1];
while (*sub != '.' && *sub)
sub++;
strncpy (subname, name, sub-name);
subname [sub-name] = '\0';
return get_identifier (subname);
}
/* Check that CLASS_NAME refers to a PUBLIC class. Return 0 if no
access violations were found, 1 otherwise. */
static int
check_pkg_class_access (class_name, cl)
tree class_name;
tree cl;
{
tree type;
if (!QUALIFIED_P (class_name) || !IDENTIFIER_CLASS_VALUE (class_name))
return 0;
if (!(type = TREE_TYPE (IDENTIFIER_CLASS_VALUE (class_name))))
return 0;
if (!CLASS_PUBLIC (TYPE_NAME (type)))
{
parse_error_context
(cl, "Can't access %s `%s'. Only public classes and interfaces in "
"other packages can be accessed",
(CLASS_INTERFACE (TYPE_NAME (type)) ? "interface" : "class"),
IDENTIFIER_POINTER (class_name));
return 1;
}
return 0;
}
/* Local variable declaration. */
static void
declare_local_variables (modifier, type, vlist)
int modifier;
tree type;
tree vlist;
{
tree decl, current, saved_type;
tree type_wfl = NULL_TREE;
int must_chain = 0;
/* Push a new block if statement were seen between the last time we
pushed a block and now. Keep a cound of block to close */
if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (current_function_decl)))
{
tree body = DECL_FUNCTION_BODY (current_function_decl);
tree b = enter_block ();
BLOCK_EXPR_ORIGIN(b) = body;
}
if (modifier)
{
int i;
for (i = 0; i <= 10; i++) if (1 << i & modifier) break;
if (modifier == ACC_FINAL)
{
if (flag_static_local_jdk1_1)
parse_warning_context (ctxp->modifier_ctx [i],
"Unsupported JDK1.1 `final' local variable "
"(treated as non final)");
}
else
{
parse_error_context
(ctxp->modifier_ctx [i],
"Only `final' is allowed as a local variables modifier");
return;
}
}
/* Obtain an incomplete type if TYPE is not complete. TYPE_WFL will
hold the TYPE value if a new incomplete has to be created (as
opposed to being found already existing and reused). */
SET_TYPE_FOR_RESOLUTION (type, type_wfl, must_chain);
/* If TYPE is fully resolved and we don't have a reference, make one */
if (!must_chain && TREE_CODE (type) == RECORD_TYPE)
type = promote_type (type);
/* Go through all the declared variables */
for (current = vlist, saved_type = type; current;
current = TREE_CHAIN (current), type = saved_type)
{
tree other, real_type;
tree wfl = TREE_PURPOSE (current);
tree name = EXPR_WFL_NODE (wfl);
tree init = TREE_VALUE (current);
/* Process NAME, as it may specify extra dimension(s) for it */
type = build_array_from_name (type, type_wfl, name, &name);
/* Variable redefinition check */
if ((other = lookup_name_in_blocks (name)))
{
variable_redefinition_error (wfl, name, TREE_TYPE (other),
DECL_SOURCE_LINE (other));
continue;
}
/* Type adjustment. We may have just readjusted TYPE because
the variable specified more dimensions. Make sure we have
a reference if we can and don't have one already. */
if (type != saved_type && !must_chain
&& (TREE_CODE (type) == RECORD_TYPE))
type = promote_type (type);
real_type = GET_REAL_TYPE (type);
/* Never layout this decl. This will be done when its scope
will be entered */
decl = build_decl (VAR_DECL, name, real_type);
BLOCK_CHAIN_DECL (decl);
/* Don't try to use an INIT statement when an error was found */
if (init && java_error_count)
init = NULL_TREE;
/* Add the initialization function to the current function's code */
if (init)
{
/* Name might have been readjusted */
EXPR_WFL_NODE (TREE_OPERAND (init, 0)) = name;
MODIFY_EXPR_FROM_INITIALIZATION_P (init) = 1;
java_method_add_stmt (current_function_decl,
build_debugable_stmt (EXPR_WFL_LINECOL (init),
init));
}
/* Setup dependency the type of the decl */
if (must_chain)
{
jdep *dep;
register_incomplete_type (JDEP_VARIABLE, type_wfl, decl, type);
dep = CLASSD_LAST (ctxp->classd_list);
JDEP_GET_PATCH (dep) = &TREE_TYPE (decl);
}
}
SOURCE_FRONTEND_DEBUG (("Defined locals"));
}
/* Called during parsing. Build decls from argument list. */
static void
source_start_java_method (fndecl)
tree fndecl;
{
tree tem;
tree parm_decl;
int i;
current_function_decl = fndecl;
/* New scope for the function */
enter_block ();
for (tem = TYPE_ARG_TYPES (TREE_TYPE (fndecl)), i = 0;
tem != NULL_TREE; tem = TREE_CHAIN (tem), i++)
{
tree type = TREE_VALUE (tem);
tree name = TREE_PURPOSE (tem);
/* If type is incomplete. Layout can't take place
now. Create an incomplete decl and ask for the decl to be
patched later */
if (INCOMPLETE_TYPE_P (type))
{
jdep *jdep;
tree real_type = GET_REAL_TYPE (type);
parm_decl = build_decl (PARM_DECL, name, real_type);
register_incomplete_type (JDEP_PARM, NULL_TREE, NULL_TREE, type);
jdep = CLASSD_LAST (ctxp->classd_list);
JDEP_MISC (jdep) = name;
JDEP_GET_PATCH (jdep) = &TREE_TYPE (parm_decl);
}
else
parm_decl = build_decl (PARM_DECL, name, type);
BLOCK_CHAIN_DECL (parm_decl);
}
tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl)) =
nreverse (tem);
DECL_ARG_SLOT_COUNT (current_function_decl) = i;
}
/* Called during parsing. Creates an artificial method declaration. */
static tree
create_artificial_method (class, flags, type, name, args)
tree class;
int flags;
tree type, name, args;
{
int saved_lineno = lineno;
tree mdecl;
lineno = 0;
mdecl = make_node (FUNCTION_TYPE);
TREE_TYPE (mdecl) = type;
TYPE_ARG_TYPES (mdecl) = args;
mdecl = add_method (class, flags, name, build_java_signature (mdecl));
lineno = saved_lineno;
DECL_ARTIFICIAL (mdecl) = 1;
return mdecl;
}
/* Starts the body if an artifical method. */
static void
start_artificial_method_body (mdecl)
tree mdecl;
{
DECL_SOURCE_LINE (mdecl) = 1;
DECL_SOURCE_LINE_MERGE (mdecl, 1);
source_start_java_method (mdecl);
enter_block ();
}
static void
end_artificial_method_body (mdecl)
tree mdecl;
{
BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (mdecl)) = exit_block ();
exit_block ();
}
/* Called during expansion. Push decls formerly built from argument
list so they're usable during expansion. */
static void
expand_start_java_method (fndecl)
tree fndecl;
{
tree tem, *ptr;
current_function_decl = fndecl;
announce_function (fndecl);
pushlevel (1); /* Push parameters */
ptr = &DECL_ARGUMENTS (fndecl);
tem = BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (current_function_decl));
while (tem)
{
tree next = TREE_CHAIN (tem);
tree type = TREE_TYPE (tem);
#ifdef PROMOTE_PROTOTYPES
if (TYPE_PRECISION (type) < TYPE_PRECISION (integer_type_node)
&& INTEGRAL_TYPE_P (type))
type = integer_type_node;
#endif
DECL_ARG_TYPE (tem) = type;
layout_decl (tem, 0);
pushdecl (tem);
INITIALIZED_P (tem) = 1; /* Parms are initialized */
*ptr = tem;
ptr = &TREE_CHAIN (tem);
tem = next;
}
*ptr = NULL_TREE;
pushdecl_force_head (DECL_ARGUMENTS (fndecl));
lineno = DECL_SOURCE_LINE_FIRST (fndecl);
complete_start_java_method (fndecl);
}
/* Terminate a function and expand its body. */
static void
source_end_java_method ()
{
tree fndecl = current_function_decl;
java_parser_context_save_global ();
lineno = ctxp->last_ccb_indent1;
/* Set EH language codes */
java_set_exception_lang_code ();
/* Generate function's code */
if (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl))
&& ! flag_emit_class_files)
expand_expr_stmt (BLOCK_EXPR_BODY (DECL_FUNCTION_BODY (fndecl)));
/* pop out of its parameters */
pushdecl_force_head (DECL_ARGUMENTS (fndecl));
poplevel (1, 0, 1);
BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
/* Generate rtl for function exit. */
if (! flag_emit_class_files)
{
lineno = DECL_SOURCE_LINE_LAST (fndecl);
/* Emit catch-finally clauses */
emit_handlers ();
expand_function_end (input_filename, lineno, 0);
/* Run the optimizers and output assembler code for this function. */
rest_of_compilation (fndecl);
}
current_function_decl = NULL_TREE;
/* permanent_allocation (1); */
java_parser_context_restore_global ();
}
/* Record EXPR in the current function block. Complements compound
expression second operand if necessary. */
tree
java_method_add_stmt (fndecl, expr)
tree fndecl, expr;
{
return add_stmt_to_block (DECL_FUNCTION_BODY (fndecl), NULL_TREE, expr);
}
static tree
add_stmt_to_block (b, type, stmt)
tree b, type, stmt;
{
tree body = BLOCK_EXPR_BODY (b), c;
if (java_error_count)
return body;
if ((c = add_stmt_to_compound (body, type, stmt)) == body)
return body;
BLOCK_EXPR_BODY (b) = c;
TREE_SIDE_EFFECTS (c) = 1;
return c;
}
/* Add STMT to EXISTING if possible, otherwise create a new
COMPOUND_EXPR and add STMT to it. */
static tree
add_stmt_to_compound (existing, type, stmt)
tree existing, type, stmt;
{
if (existing)
return build (COMPOUND_EXPR, type, existing, stmt);
else
return stmt;
}
/* Hold THIS for the scope of the current public method decl. */
static tree current_this;
/* Layout all class found during parsing. Also fixes the order of some
lists. */
void
java_layout_classes ()
{
tree current;
java_check_methods ();
/* Error reported by the caller */
if (java_error_count)
return;
for (current = ctxp->gclass_list; current; current = TREE_CHAIN (current))
{
current_class = TREE_TYPE (TREE_VALUE (current));
/* Reverse the fields, but leave the dummy field in front.
Fields are already ordered for Object and Class */
if (TYPE_FIELDS (current_class) && current_class != object_type_node
&& current_class != class_type_node)
{
/* Always leave the dummy field in front if its already there,
and layout the class for proper field offets. */
if (!DECL_NAME (TYPE_FIELDS (current_class)))
{
tree fields = TYPE_FIELDS (current_class);
TREE_CHAIN (fields) = nreverse (TREE_CHAIN (fields));
TYPE_SIZE (current_class) = NULL_TREE;
layout_type (current_class);
}
/* It's time to layout the class */
else
{
TYPE_FIELDS (current_class) =
nreverse (TYPE_FIELDS (current_class));
TYPE_SIZE (current_class) = NULL_TREE;
layout_class (current_class);
}
}
/* Do a layout if necessary */
if (!TYPE_SIZE (current_class)
|| (current_class == object_type_node)
|| current_class == class_type_node)
safe_layout_class (current_class);
/* From now on, the class is considered completely loaded */
CLASS_LOADED_P (current_class) = 1;
/* Error reported by the caller */
if (java_error_count)
return;
}
}
/* Expand all methods in all registered classes. */
void
java_complete_expand_methods ()
{
tree current;
for (current = ctxp->class_list; current; current = TREE_CHAIN (current))
{
tree class_type = CLASS_TO_HANDLE_TYPE (TREE_TYPE (current));
tree decl;
current_class = TREE_TYPE (current);
/* Initialize a new constant pool */
init_outgoing_cpool ();
/* Don't process function bodies in interfaces */
if (!CLASS_INTERFACE (TYPE_NAME (current_class)))
for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
{
current_function_decl = decl;
/* Don't generate debug info on line zero when expanding a
generated constructor. */
if (DECL_CONSTRUCTOR_P (decl) && !DECL_FUNCTION_BODY (decl))
{
/* If we found errors, it's too dangerous to try to generate
and expand a constructor */
if (!java_error_count)
{
restore_line_number_status (1);
java_complete_expand_method (decl);
restore_line_number_status (0);
}
}
else if (METHOD_ABSTRACT (decl) || METHOD_NATIVE (decl))
continue;
else
java_complete_expand_method (decl);
}
/* Now verify constructor circularity (stop after the first one
we find) */
if (!CLASS_INTERFACE (TYPE_NAME (current_class)))
for (decl = TYPE_METHODS (class_type); decl; decl = TREE_CHAIN (decl))
if (DECL_CONSTRUCTOR_P (decl) &&
verify_constructor_circularity (decl, decl))
break;
/* Make the class data, register it and run the rest of decl
compilation on it */
if (!java_error_count && ! flag_emit_class_files)
{
make_class_data (current_class);
register_class ();
rest_of_decl_compilation (TYPE_NAME (current_class),
(char*) 0, 1, 0);
}
}
}
/* Hold a list of catch clauses list. The first element of this list is
the list of the catch clauses of the currently analysed try block. */
static tree currently_caught_type_list;
/* Complete and expand a method. */
static void
java_complete_expand_method (mdecl)
tree mdecl;
{
/* Fix constructors before expanding them */
if (DECL_CONSTRUCTOR_P (mdecl))
fix_constructors (mdecl);
/* Expand functions that have a body */
if (DECL_FUNCTION_BODY (mdecl))
{
tree fbody = DECL_FUNCTION_BODY (mdecl);
tree block_body = BLOCK_EXPR_BODY (fbody);
expand_start_java_method (mdecl);
current_this
= (!METHOD_STATIC (mdecl) ?
BLOCK_EXPR_DECLS (DECL_FUNCTION_BODY (mdecl)) : NULL_TREE);
/* Purge the `throws' list of unchecked exceptions */
purge_unchecked_exceptions (mdecl);
/* Install exceptions thrown with `throws' */
PUSH_EXCEPTIONS (DECL_FUNCTION_THROWS (mdecl));
if (block_body != NULL_TREE)
block_body = java_complete_tree (block_body);
BLOCK_EXPR_BODY (fbody) = block_body;
if ((block_body == NULL_TREE || CAN_COMPLETE_NORMALLY (block_body))
&& TREE_CODE (TREE_TYPE (TREE_TYPE (mdecl))) != VOID_TYPE)
{
parse_error_context (fbody, "Missing return statement");
}
/* Don't go any further if we've found error(s) during the
expansion */
if (!java_error_count)
source_end_java_method ();
else
{
pushdecl_force_head (DECL_ARGUMENTS (mdecl));
poplevel (1, 0, 1);
}
/* Pop the exceptions and sanity check */
POP_EXCEPTIONS();
if (currently_caught_type_list)
fatal ("Exception list non empty - java_complete_expand_method");
}
}
/* Craft a body for default constructor. Patch existing constructor
bodies with call to super() and field initialization statements if
necessary. */
static void
fix_constructors (mdecl)
tree mdecl;
{
tree body = DECL_FUNCTION_BODY (mdecl);
tree field_init;
/* The constructor body must be crafted by hand. It's the
constructor we defined when we realize we didn't have the
CLASSNAME() constructor */
if (!body)
{
tree compound;
/* It is an error for the compiler to generate a default
constructor if the superclass doesn't have a constructor that
takes no argument */
if (verify_constructor_super ())
{
tree sclass_decl = TYPE_NAME (CLASSTYPE_SUPER (current_class));
char *n = IDENTIFIER_POINTER (DECL_NAME (sclass_decl));
parse_error_context (lookup_cl (TYPE_NAME (current_class)),
"No constructor matching `%s()' found in "
"class `%s'", n, n);
}
start_artificial_method_body (mdecl);
/* We don't generate a super constructor invocation if we're
compiling java.lang.Object. build_super_invocation takes care
of that. */
compound = java_method_add_stmt (mdecl, build_super_invocation ());
/* Takes care of non static field initialization */
field_init = generate_field_initialization_code (current_class);
if (field_init)
compound = java_method_add_stmt (mdecl, field_init);
end_artificial_method_body (mdecl);
}
/* Search for an explicit constructor invocation */
else
{
int found = 0;
tree main_block = BLOCK_EXPR_BODY (body);
tree compound = NULL_TREE;
while (body)
switch (TREE_CODE (body))
{
case CALL_EXPR:
found = CALL_EXPLICIT_CONSTRUCTOR_P (body);
body = NULL_TREE;
break;
case COMPOUND_EXPR:
case EXPR_WITH_FILE_LOCATION:
body = TREE_OPERAND (body, 0);
break;
case BLOCK:
body = BLOCK_EXPR_BODY (body);
break;
default:
found = 0;
body = NULL_TREE;
}
/* The constructor is missing an invocation of super() */
if (!found)
compound = add_stmt_to_compound (compound, NULL_TREE,
build_super_invocation ());
/* Also fix its initialized fields initialization */
field_init = generate_field_initialization_code (current_class);
if (field_init)
compound = add_stmt_to_compound (compound, NULL_TREE, field_init);
/* Fix the constructor main block if we're adding extra stmts */
if (compound)
{
compound = add_stmt_to_compound (compound, NULL_TREE,
BLOCK_EXPR_BODY (main_block));
BLOCK_EXPR_BODY (main_block) = compound;
}
}
}
/* Browse constructors in the super class, searching for a constructor
that doesn't take any argument. Return 0 if one is found, 1
otherwise. */
static int
verify_constructor_super ()
{
tree class = CLASSTYPE_SUPER (current_class);
if (!class)
return 0;
if (class)
{
tree mdecl;
for (mdecl = TYPE_METHODS (class); mdecl; mdecl = TREE_CHAIN (mdecl))
{
if (DECL_CONSTRUCTOR_P (mdecl)
&& !TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (mdecl))))
return 0;
}
}
return 1;
}
/* Generate the code used to initialize field declared with an
initialization statement. For now, it returns a call the the
artificial function <finit>, if required. Always returns NULL if
nothing needs to be generated. */
static tree
generate_field_initialization_code (class)
tree class;
{
if (CLASS_HAS_FINIT_P (class))
return build_method_invocation (build_expr_wfl (finit_identifier_node,
input_filename, 0, 0),
NULL_TREE);
else
return NULL_TREE;
}
/* Expand finals. */
void
java_expand_finals ()
{
}
/* Generate code for all context remembered for code generation. */
void
java_expand_classes ()
{
ctxp = ctxp_for_generation;
/* If we found error earlier, we don't want to report then twice. */
if (java_error_count || !ctxp)
return;
java_layout_classes ();
java_parse_abort_on_error ();
for (; ctxp_for_generation; ctxp_for_generation = ctxp_for_generation->next)
{
ctxp = ctxp_for_generation;
lang_init_source (2); /* Error msgs have method prototypes */
java_complete_expand_methods (); /* Complete and expand method bodies */
java_parse_abort_on_error ();
java_expand_finals (); /* Expand and check the finals */
java_parse_abort_on_error ();
java_check_final (); /* Check unitialized final */
java_parse_abort_on_error ();
if (flag_emit_class_files)
write_classfile (current_class);
}
}
/* Wrap non WFL PRIMARY around a WFL and set EXPR_WFL_QUALIFICATION to
a tree list node containing RIGHT. Fore coming RIGHTs will be
chained to this hook. LOCATION contains the location of the
separating `.' operator. */
static tree
make_qualified_primary (primary, right, location)
tree primary, right;
int location;
{
tree wfl;
/* We want to process THIS . xxx symbolicaly, to keep it consistent
with the way we're processing SUPER. A THIS from a primary as a
different form than a SUPER. Turn THIS into something symbolic */
if (TREE_CODE (primary) == THIS_EXPR)
{
wfl = build_wfl_node (this_identifier_node, input_filename, 0, 0);
EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (primary);
wfl = make_qualified_name (wfl, right, location);
PRIMARY_P (wfl) = 1;
return wfl;
}
/* Other non WFL node are wrapped around a WFL */
else if (TREE_CODE (primary) != EXPR_WITH_FILE_LOCATION)
{
wfl = build_expr_wfl (NULL_TREE, ctxp->filename, 0, 0);
EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (primary);
EXPR_WFL_QUALIFICATION (wfl) = build_tree_list (primary, NULL_TREE);
}
else
{
wfl = primary;
if (!EXPR_WFL_QUALIFICATION (primary))
EXPR_WFL_QUALIFICATION (primary) =
build_tree_list (primary, NULL_TREE);
}
EXPR_WFL_LINECOL (right) = location;
chainon (EXPR_WFL_QUALIFICATION (wfl), build_tree_list (right, NULL_TREE));
PRIMARY_P (wfl) = 1;
return wfl;
}
/* Simple merge of two name separated by a `.' */
static tree
merge_qualified_name (left, right)
tree left, right;
{
tree node;
obstack_grow (&temporary_obstack, IDENTIFIER_POINTER (left),
IDENTIFIER_LENGTH (left));
obstack_1grow (&temporary_obstack, '.');
obstack_grow0 (&temporary_obstack, IDENTIFIER_POINTER (right),
IDENTIFIER_LENGTH (right));
node = get_identifier (obstack_base (&temporary_obstack));
obstack_free (&temporary_obstack, obstack_base (&temporary_obstack));
QUALIFIED_P (node) = 1;
return node;
}
/* Merge the two parts of a qualified name into LEFT. Set the
location information of the resulting node to LOCATION, usually
inherited from the location information of the `.' operator. */
static tree
make_qualified_name (left, right, location)
tree left, right;
int location;
{
tree left_id = EXPR_WFL_NODE (left);
tree right_id = EXPR_WFL_NODE (right);
tree wfl, merge;
merge = merge_qualified_name (left_id, right_id);
/* Left wasn't qualified and is now qualified */
if (!QUALIFIED_P (left_id))
{
tree wfl = build_expr_wfl (left_id, ctxp->filename, 0, 0);
EXPR_WFL_LINECOL (wfl) = EXPR_WFL_LINECOL (left);
EXPR_WFL_QUALIFICATION (left) = build_tree_list (wfl, NULL_TREE);
}
wfl = build_expr_wfl (right_id, ctxp->filename, 0, 0);
EXPR_WFL_LINECOL (wfl) = location;
chainon (EXPR_WFL_QUALIFICATION (left), build_tree_list (wfl, NULL_TREE));
EXPR_WFL_NODE (left) = merge;
return left;
}
/* Extract the last identifier component of the qualified in WFL. The
last identifier is removed from the linked list */
static tree
cut_identifier_in_qualified (wfl)
tree wfl;
{
tree q;
tree previous = NULL_TREE;
for (q = EXPR_WFL_QUALIFICATION (wfl); ; previous = q, q = TREE_CHAIN (q))
if (!TREE_CHAIN (q))
{
if (!previous)
fatal ("Operating on a non qualified qualified WFL - "
"cut_identifier_in_qualified");
TREE_CHAIN (previous) = NULL_TREE;
return TREE_PURPOSE (q);
}
}
/* Resolve the expression name NAME. Return its decl. */
static tree
resolve_expression_name (id, orig)
tree id;
tree *orig;
{
tree name = EXPR_WFL_NODE (id);
tree decl;
/* 6.5.5.1: Simple expression names */
if (!PRIMARY_P (id) && !QUALIFIED_P (name))
{
/* 15.13.1: NAME can appear within the scope of a local variable
declaration */
if ((decl = IDENTIFIER_LOCAL_VALUE (name)))
return decl;
/* 15.13.1: NAME can appear within a class declaration */
else
{
decl = lookup_field_wrapper (current_class, name);
if (decl)
{
tree value = NULL_TREE;
int fs = FIELD_STATIC (decl);
/* Instance variable (8.3.1.1) can't appear within
static method, static initializer or initializer for
a static variable. */
if (!fs && METHOD_STATIC (current_function_decl))
{
parse_error_context
(id, "Can't make a static reference to nonstatic variable "
"`%s' in class `%s'",
IDENTIFIER_POINTER (name),
IDENTIFIER_POINTER (DECL_NAME
(TYPE_NAME (current_class))));
return error_mark_node;
}
/* Instance variables can't appear as an argument of
an explicit constructor invocation */
if (!fs && ctxp->explicit_constructor_p)
{
parse_error_context
(id, "Can't reference `%s' before the superclass "
"constructor has been called", IDENTIFIER_POINTER (name));
return error_mark_node;
}
/* The field is final. We may use its value instead */
if (fs && FIELD_FINAL (decl))
value = java_complete_tree (DECL_LOCAL_STATIC_VALUE (decl));
/* Otherwise build what it takes to access the field */
decl = build_field_ref ((fs ? NULL_TREE : current_this),
current_class, name);
if (fs && !flag_emit_class_files)
decl = build_class_init (current_class, decl);
/* We may be asked to save the real field access node */
if (orig)
*orig = decl;
/* And we return what we got */
return (value ? value : decl);
}
/* Fall down to error report on undefined variable */
}
}
/* 6.5.5.2 Qualified Expression Names */
else
{
if (orig)
*orig = NULL_TREE;
qualify_ambiguous_name (id);
/* 15.10.1 Field Access Using a Primary and/or Expression Name */
/* 15.10.2: Accessing Superclass Members using super */
return resolve_field_access (id, NULL, NULL);
}
/* We've got an error here */
parse_error_context (id, "Undefined variable `%s'",
IDENTIFIER_POINTER (name));
return error_mark_node;
}
/* 15.10.1 Field Acess Using a Primary and/or Expression Name.
We return something suitable to generate the field access. We also
return the field decl in FIELD_DECL and its type in FIELD_TYPE. If
recipient's address can be null. */
static tree
resolve_field_access (qual_wfl, field_decl, field_type)
tree qual_wfl;
tree *field_decl, *field_type;
{
int is_static = 0;
tree field_ref;
tree decl, where_found, type_found;
if (resolve_qualified_expression_name (qual_wfl, &decl,
&where_found, &type_found))
return error_mark_node;
/* Resolve the LENGTH field of an array here */
if (DECL_NAME (decl) == length_identifier_node && TYPE_ARRAY_P (type_found)
&& ! flag_emit_class_files)
{
tree length = build_java_array_length_access (where_found);
field_ref =
build_java_arraynull_check (type_found, length, int_type_node);
}
/* We might have been trying to resolve field.method(). In which
case, the resolution is over and decl is the answer */
else if (DECL_P (decl) && IDENTIFIER_LOCAL_VALUE (DECL_NAME (decl)) == decl)
field_ref = decl;
else if (DECL_P (decl))
{
int static_final_found = 0;
if (!type_found)
type_found = DECL_CONTEXT (decl);
is_static = DECL_P (decl) && FIELD_STATIC (decl);
if (FIELD_FINAL (decl)
&& JPRIMITIVE_TYPE_P (TREE_TYPE (decl))
&& DECL_LANG_SPECIFIC (decl)
&& DECL_LOCAL_STATIC_VALUE (decl))
{
field_ref = java_complete_tree (DECL_LOCAL_STATIC_VALUE (decl));
static_final_found = 1;
}
else
field_ref = build_field_ref ((is_static ? NULL_TREE : where_found),
type_found, DECL_NAME (decl));
if (field_ref == error_mark_node)
return error_mark_node;
if (is_static && !static_final_found && !flag_emit_class_files)
{
field_ref = build_class_init (type_found, field_ref);
/* If the static field was identified by an expression that
needs to be generated, make the field access a compound
expression whose first part of the evaluation of the
field selector part. */
if (where_found && TREE_CODE (where_found) != TYPE_DECL
&& TREE_CODE (where_found) != RECORD_TYPE)
{
tree type = QUAL_DECL_TYPE (field_ref);
field_ref = build (COMPOUND_EXPR, type, where_found, field_ref);
}
}
}
else
field_ref = decl;
if (field_decl)
*field_decl = decl;
if (field_type)
*field_type = (QUAL_DECL_TYPE (decl) ?
QUAL_DECL_TYPE (decl) : TREE_TYPE (decl));
return field_ref;
}
/* 6.5.5.2: Qualified Expression Names */
static int
resolve_qualified_expression_name (wfl, found_decl, where_found, type_found)
tree wfl;
tree *found_decl, *type_found, *where_found;
{
int from_type = 0; /* Field search initiated from a type */
int from_super = 0, from_cast = 0;
int previous_call_static = 0;
int is_static;
tree decl = NULL_TREE, type = NULL_TREE, q;
*type_found = *where_found = NULL_TREE;
for (q = EXPR_WFL_QUALIFICATION (wfl); q; q = TREE_CHAIN (q))
{
tree qual_wfl = QUAL_WFL (q);
/* 15.10.1 Field Access Using a Primary */
switch (TREE_CODE (qual_wfl))
{
case CALL_EXPR:
case NEW_CLASS_EXPR:
/* If the access to the function call is a non static field,
build the code to access it. */
if (DECL_P (decl) && !FIELD_STATIC (decl))
{
decl = maybe_access_field (decl, *where_found, type);
if (decl == error_mark_node)
return 1;
}
/* And code for the function call */
if (complete_function_arguments (qual_wfl))
return 1;
*where_found =
patch_method_invocation (qual_wfl, decl, type,
&is_static, NULL, from_super);
if (*where_found == error_mark_node)
return 1;
*type_found = type = QUAL_DECL_TYPE (*where_found);
/* If the previous call was static and this one is too,
build a compound expression to hold the two (because in
that case, previous function calls aren't transported as
forcoming function's argument. */
if (previous_call_static && is_static)
{
decl = build (COMPOUND_EXPR, type, decl, *where_found);
TREE_SIDE_EFFECTS (decl) = 1;
}
else
{
previous_call_static = is_static;
decl = *where_found;
}
continue;
case CONVERT_EXPR:
*where_found = decl = java_complete_tree (qual_wfl);
if (decl == error_mark_node)
return 1;
*type_found = type = QUAL_DECL_TYPE (decl);
from_cast = 1;
continue;
case CONDITIONAL_EXPR:
case STRING_CST:
*where_found = decl = java_complete_tree (qual_wfl);
if (decl == error_mark_node)
return 1;
*type_found = type = QUAL_DECL_TYPE (decl);
continue;
case ARRAY_REF:
/* If the access to the function call is a non static field,
build the code to access it. */
if (DECL_P (decl) && !FIELD_STATIC (decl))
{
decl = maybe_access_field (decl, *where_found, type);
if (decl == error_mark_node)
return 1;
}
/* And code for the array reference expression */
decl = java_complete_tree (qual_wfl);
if (decl == error_mark_node)
return 1;
type = QUAL_DECL_TYPE (decl);
continue;
default:
/* Fix for -Wall Just go to the next statement. Don't
continue */
}
/* If we fall here, we weren't processing a (static) function call. */
previous_call_static = 0;
/* It can be the keyword THIS */
if (EXPR_WFL_NODE (qual_wfl) == this_identifier_node)
{
if (!current_this)
{
parse_error_context
(wfl, "Keyword `this' used outside allowed context");
return 1;
}
/* We have to generate code for intermediate acess */
*where_found = decl = current_this;
*type_found = type = QUAL_DECL_TYPE (decl);
continue;
}
/* 15.10.2 Accessing Superclass Members using SUPER */
if (EXPR_WFL_NODE (qual_wfl) == super_identifier_node)
{
tree node;
/* Check on the restricted use of SUPER */
if (METHOD_STATIC (current_function_decl)
|| current_class == object_type_node)
{
parse_error_context
(wfl, "Keyword `super' used outside allowed context");
return 1;
}
/* Otherwise, treat SUPER as (SUPER_CLASS)THIS */
node = build_cast (EXPR_WFL_LINECOL (qual_wfl),
CLASSTYPE_SUPER (current_class),
build_this (EXPR_WFL_LINECOL (qual_wfl)));
*where_found = decl = java_complete_tree (node);
if (decl == error_mark_node)
return 1;
*type_found = type = QUAL_DECL_TYPE (decl);
from_super = from_type = 1;
continue;
}
/* 15.13.1: Can't search for field name in packages, so we
assume a variable/class name was meant. */
if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
{
tree name = resolve_package (wfl, &q);
if (name)
{
*where_found = decl = resolve_no_layout (name, qual_wfl);
/* We wan't to be absolutely that the class is laid
out. We're going to search something inside it. */
*type_found = type = TREE_TYPE (decl);
layout_class (type);
from_type = 1;
/* Should be a list, really. FIXME */
RESOLVE_EXPRESSION_NAME_P (QUAL_WFL (TREE_CHAIN (q))) = 1;
RESOLVE_PACKAGE_NAME_P (QUAL_WFL (TREE_CHAIN (q))) = 0;
}
else
{
if (from_super || from_cast)
parse_error_context
((from_cast ? qual_wfl : wfl),
"No variable `%s' defined in class `%s'",
IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
lang_printable_name (type, 0));
else
parse_error_context
(qual_wfl, "Undefined variable or class name: `%s'",
IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)));
return 1;
}
}
/* We have a type name. It's been already resolved when the
expression was qualified. */
else if (RESOLVE_TYPE_NAME_P (qual_wfl))
{
if (!(decl = QUAL_RESOLUTION (q)))
return 1; /* Error reported already */
if (not_accessible_p (TREE_TYPE (decl), decl, 0))
{
parse_error_context
(qual_wfl, "Can't access %s field `%s.%s' from `%s'",
java_accstring_lookup (get_access_flags_from_decl (decl)),
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))),
IDENTIFIER_POINTER (DECL_NAME (decl)),
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
return 1;
}
check_deprecation (qual_wfl, decl);
type = TREE_TYPE (decl);
from_type = 1;
}
/* We resolve and expression name */
else
{
tree field_decl;
/* If there exists an early resolution, use it. That occurs
only once and we know that there are more things to
come. Don't do that when processing something after SUPER
(we need more thing to be put in place below */
if (!from_super && QUAL_RESOLUTION (q))
{
decl = QUAL_RESOLUTION (q);
if (!type)
{
if (!FIELD_STATIC (decl))
*where_found = current_this;
else
{
*where_found = TREE_TYPE (decl);
if (TREE_CODE (*where_found) == POINTER_TYPE)
*where_found = TREE_TYPE (*where_found);
}
}
}
/* We have to search for a field, knowing the type of its
container. The flag FROM_TYPE indicates that we resolved
the last member of the expression as a type name, which
means that for the resolution of this field, we'll look
for other errors than if it was resolved as a member of
an other field. */
else
{
int is_static;
tree field_decl_type; /* For layout */
if (!from_type && !JREFERENCE_TYPE_P (type))
{
parse_error_context
(qual_wfl, "Attempt to reference field `%s' in `%s %s'",
IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
lang_printable_name (type, 0),
IDENTIFIER_POINTER (DECL_NAME (field_decl)));
return 1;
}
if (!(field_decl =
lookup_field_wrapper (type, EXPR_WFL_NODE (qual_wfl))))
{
parse_error_context
(qual_wfl, "No variable `%s' defined in class `%s'",
IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
return 1;
}
/* Layout the type of field_decl, since we may need
it. Don't do primitive types or loaded classes. The
situation of non primitive arrays may not handled
properly here. FIXME */
if (TREE_CODE (TREE_TYPE (field_decl)) == POINTER_TYPE)
field_decl_type = TREE_TYPE (TREE_TYPE (field_decl));
else
field_decl_type = TREE_TYPE (field_decl);
if (!JPRIMITIVE_TYPE_P (field_decl_type)
&& !CLASS_LOADED_P (field_decl_type)
&& !TYPE_ARRAY_P (field_decl_type))
resolve_and_layout (field_decl_type, NULL_TREE);
if (TYPE_ARRAY_P (field_decl_type))
CLASS_LOADED_P (field_decl_type) = 1;
/* Check on accessibility here */
if (not_accessible_p (type, field_decl, from_super))
{
parse_error_context
(qual_wfl,
"Can't access %s field `%s.%s' from `%s'",
java_accstring_lookup
(get_access_flags_from_decl (field_decl)),
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))),
IDENTIFIER_POINTER (DECL_NAME (field_decl)),
IDENTIFIER_POINTER
(DECL_NAME (TYPE_NAME (current_class))));
return 1;
}
check_deprecation (qual_wfl, field_decl);
/* There are things to check when fields are accessed
from type. There are no restrictions on a static
declaration of the field when it is accessed from an
interface */
is_static = FIELD_STATIC (field_decl);
if (!from_super && from_type
&& !TYPE_INTERFACE_P (type) && !is_static)
{
parse_error_context
(qual_wfl, "Can't make a static reference to nonstatic "
"variable `%s' in class `%s'",
IDENTIFIER_POINTER (EXPR_WFL_NODE (qual_wfl)),
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
return 1;
}
from_cast = from_super = 0;
/* If we need to generate something to get a proper
handle on what this field is accessed from, do it
now. */
if (!is_static)
{
decl = maybe_access_field (decl, *where_found, *type_found);
if (decl == error_mark_node)
return 1;
}
/* We want to keep the location were found it, and the type
we found. */
*where_found = decl;
*type_found = type;
/* This is the decl found and eventually the next one to
search from */
decl = field_decl;
}
from_type = 0;
type = QUAL_DECL_TYPE (decl);
}
}
*found_decl = decl;
return 0;
}
/* 6.6 Qualified name and access control. Returns 1 if MEMBER (a decl)
can't be accessed from REFERENCE (a record type). */
int not_accessible_p (reference, member, from_super)
tree reference, member;
int from_super;
{
int access_flag = get_access_flags_from_decl (member);
/* Access always granted for members declared public */
if (access_flag & ACC_PUBLIC)
return 0;
/* Check access on protected members */
if (access_flag & ACC_PROTECTED)
{
/* Access granted if it occurs from within the package
containing the class in which the protected member is
declared */
if (class_in_current_package (DECL_CONTEXT (member)))
return 0;
/* If accessed with the form `super.member', then access is granted */
if (from_super)
return 0;
/* Otherwise, access is granted if occuring from the class where
member is declared or a subclass of it */
if (inherits_from_p (reference, current_class))
return 0;
return 1;
}
/* Check access on private members. Access is granted only if it
occurs from within the class in witch it is declared */
if (access_flag & ACC_PRIVATE)
return (current_class == DECL_CONTEXT (member) ? 0 : 1);
/* Default access are permitted only when occuring within the
package in which the type (REFERENCE) is declared. In other words,
REFERENCE is defined in the current package */
if (ctxp->package)
return !class_in_current_package (reference);
/* Otherwise, access is granted */
return 0;
}
/* Test deprecated decl access. */
static void
check_deprecation (wfl, decl)
tree wfl, decl;
{
char *file = DECL_SOURCE_FILE (decl);
/* Complain if the field is deprecated and the file it was defined
in isn't compiled at the same time the file which contains its
use is */
if (DECL_DEPRECATED (decl)
&& !IS_A_COMMAND_LINE_FILENAME_P (get_identifier (file)))
{
char the [20];
switch (TREE_CODE (decl))
{
case FUNCTION_DECL:
strcpy (the, "method");
break;
case FIELD_DECL:
strcpy (the, "field");
break;
case TYPE_DECL:
strcpy (the, "class");
break;
default:
fatal ("unexpected DECL code - check_deprecation");
}
parse_warning_context
(wfl, "The %s `%s' in class `%s' has been deprecated",
the, lang_printable_name (decl, 0),
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl)))));
}
}
/* Returns 1 if class was declared in the current package, 0 otherwise */
static int
class_in_current_package (class)
tree class;
{
static tree cache = NULL_TREE;
int qualified_flag;
tree left;
if (cache == class)
return 1;
qualified_flag = QUALIFIED_P (DECL_NAME (TYPE_NAME (class)));
/* If the current package is empty and the name of CLASS is
qualified, class isn't in the current package. If there is a
current package and the name of the CLASS is not qualified, class
isn't in the current package */
if ((!ctxp->package && qualified_flag) || (ctxp->package && !qualified_flag))
return 0;
/* If there is not package and the name of CLASS isn't qualified,
they belong to the same unnamed package */
if (!ctxp->package && !qualified_flag)
return 1;
/* Compare the left part of the name of CLASS with the package name */
breakdown_qualified (&left, NULL, DECL_NAME (TYPE_NAME (class)));
if (ctxp->package == left)
{
cache = class;
return 1;
}
return 0;
}
/* This function may generate code to access DECL from WHERE. This is
done only if certain conditions meet. */
static tree
maybe_access_field (decl, where, type)
tree decl, where, type;
{
if (TREE_CODE (decl) == FIELD_DECL && decl != current_this
&& !FIELD_STATIC (decl))
decl = build_field_ref (where ? where : current_this,
(type ? type : DECL_CONTEXT (decl)),
DECL_NAME (decl));
return decl;
}
/* Build a method invocation, by patching PATCH. If non NULL
and according to the situation, PRIMARY and WHERE may be
used. IS_STATIC is set to 1 if the invoked function is static. */
static tree
patch_method_invocation (patch, primary, where, is_static, ret_decl, super)
tree patch, primary, where;
int *is_static;
tree *ret_decl;
int super;
{
tree wfl = TREE_OPERAND (patch, 0);
tree args = TREE_OPERAND (patch, 1);
tree name = EXPR_WFL_NODE (wfl);
tree list;
int is_static_flag = 0;
/* Should be overriden if everything goes well. Otherwise, if
something fails, it should keep this value. It stop the
evaluation of a bogus assignment. See java_complete_tree,
MODIFY_EXPR: for the reasons why we sometimes want to keep on
evaluating an assignment */
TREE_TYPE (patch) = error_mark_node;
/* Since lookup functions are messing with line numbers, save the
context now. */
java_parser_context_save_global ();
/* 15.11.1: Compile-Time Step 1: Determine Class or Interface to Search */
/* Resolution of qualified name, excluding constructors */
if (QUALIFIED_P (name) && !CALL_CONSTRUCTOR_P (patch))
{
tree class_decl, identifier, identifier_wfl;
/* Extract the last IDENTIFIER of the qualified
expression. This is a wfl and we will use it's location
data during error report. */
identifier_wfl = cut_identifier_in_qualified (wfl);
identifier = EXPR_WFL_NODE (identifier_wfl);
/* Given the context, IDENTIFIER is syntactically qualified
as a MethodName. We need to qualify what's before */
qualify_ambiguous_name (wfl);
/* Package resolution are erroneous */
if (RESOLVE_PACKAGE_NAME_P (wfl))
{
tree remainder;
breakdown_qualified (&remainder, NULL, EXPR_WFL_NODE (wfl));
parse_error_context (wfl, "Can't search method `%s' in package "
"`%s'",IDENTIFIER_POINTER (identifier),
IDENTIFIER_POINTER (remainder));
PATCH_METHOD_RETURN_ERROR ();
}
/* We're resolving a call from a type */
else if (RESOLVE_TYPE_NAME_P (wfl))
{
tree decl = QUAL_RESOLUTION (EXPR_WFL_QUALIFICATION (wfl));
tree name = DECL_NAME (decl);
tree type;
class_decl = resolve_and_layout (name, wfl);
if (CLASS_INTERFACE (decl))
{
parse_error_context
(identifier_wfl, "Can't make static reference to method "
"`%s' in interface `%s'", IDENTIFIER_POINTER (identifier),
IDENTIFIER_POINTER (name));
PATCH_METHOD_RETURN_ERROR ();
}
/* Look the method up in the type selector. The method ought
to be static. */
type = TREE_TYPE (class_decl);
list = lookup_method_invoke (0, wfl, type, identifier, args);
if (list && !METHOD_STATIC (list))
{
char *fct_name = strdup (lang_printable_name (list, 0));
parse_error_context
(identifier_wfl,
"Can't make static reference to method `%s %s' in class `%s'",
lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type))));
free (fct_name);
PATCH_METHOD_RETURN_ERROR ();
}
args = nreverse (args);
}
/* We're resolving an expression name */
else
{
tree field, type;
/* 1- Find the field to which the call applies */
field = resolve_field_access (wfl, NULL, &type);
if (field == error_mark_node)
PATCH_METHOD_RETURN_ERROR ();
/* 2- Do the layout of the class where the last field
was found, so we can search it. */
class_decl = resolve_and_layout (type, NULL_TREE);
type = TREE_TYPE (class_decl);
/* 3- Retrieve a filtered list of method matches, Refine
if necessary. In any cases, point out errors. */
list = lookup_method_invoke (0, identifier_wfl, type,
identifier, args);
/* 4- Add the field as an argument */
args = tree_cons (NULL_TREE, field, nreverse (args));
}
/* IDENTIFIER_WFL will be used to report any problem further */
wfl = identifier_wfl;
}
/* Resolution of simple names, names generated after a primary: or
constructors */
else
{
tree class_to_search;
int lc; /* Looking for Constructor */
/* We search constructor in their target class */
if (CALL_CONSTRUCTOR_P (patch))
{
if (TREE_CODE (patch) == NEW_CLASS_EXPR)
class_to_search = EXPR_WFL_NODE (wfl);
else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
this_identifier_node)
class_to_search = NULL_TREE;
else if (EXPR_WFL_NODE (TREE_OPERAND (patch, 0)) ==
super_identifier_node)
{
if (CLASSTYPE_SUPER (current_class))
class_to_search =
DECL_NAME (TYPE_NAME (CLASSTYPE_SUPER (current_class)));
else
{
parse_error_context (wfl, "Can't invoke super constructor "
"on java.lang.Object");
PATCH_METHOD_RETURN_ERROR ();
}
}
/* Class to search is NULL if we're searching the current one */
if (class_to_search)
{
class_to_search = resolve_no_layout (class_to_search, NULL_TREE);
if (!class_to_search)
{
parse_error_context
(wfl, "Class `%s' not found in type declaration",
IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
PATCH_METHOD_RETURN_ERROR ();
}
/* Can't instantiate an abstract class, but we can
invoke it's constructor. It's use within the `new'
context is denied here. */
if (CLASS_ABSTRACT (class_to_search)
&& TREE_CODE (patch) == NEW_CLASS_EXPR)
{
parse_error_context
(wfl, "Class `%s' is an abstract class. It can't be "
"instantiated", IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
PATCH_METHOD_RETURN_ERROR ();
}
class_to_search = TREE_TYPE (class_to_search);
}
else
class_to_search = current_class;
lc = 1;
}
/* This is a regular search in the local class, unless an
alternate class is specified. */
else
{
class_to_search = (where ? where : current_class);
lc = 0;
}
/* NAME is a simple identifier or comes from a primary. Search
in the class whose declaration contain the method being
invoked. */
resolve_and_layout (class_to_search, NULL_TREE);
list = lookup_method_invoke (lc, wfl, class_to_search, name, args);
/* Don't continue if no method were found, as the next statement
can't be executed then. */
if (!list)
PATCH_METHOD_RETURN_ERROR ();
/* Check for static reference if non static methods */
if (check_for_static_method_reference (wfl, patch, list,
class_to_search, primary))
PATCH_METHOD_RETURN_ERROR ();
/* Non static methods are called with the current object extra
argument. If patch a `new TYPE()', the argument is the value
returned by the object allocator. If method is resolved as a
primary, use the primary otherwise use the current THIS. */
args = nreverse (args);
if (!METHOD_STATIC (list) && TREE_CODE (patch) != NEW_CLASS_EXPR)
args = tree_cons (NULL_TREE, primary ? primary : current_this, args);
}
/* Merge point of all resolution schemes. If we have nothing, this
is an error, already signaled */
if (!list)
PATCH_METHOD_RETURN_ERROR ();
/* Check accessibility, position the is_static flag, build and
return the call */
if (not_accessible_p (DECL_CONTEXT (current_function_decl), list, 0))
{
char *fct_name = strdup (lang_printable_name (list, 0));
parse_error_context
(wfl, "Can't access %s method `%s %s.%s' from `%s'",
java_accstring_lookup (get_access_flags_from_decl (list)),
lang_printable_name (TREE_TYPE (TREE_TYPE (list)), 0),
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (list)))),
fct_name, IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (current_class))));
free (fct_name);
PATCH_METHOD_RETURN_ERROR ();
}
check_deprecation (wfl, list);
is_static_flag = METHOD_STATIC (list);
/* In the context of an explicit constructor invocation, we can't invoke
any method relying on `this' */
if (ctxp->explicit_constructor_p
&& !is_static_flag && (!primary || primary == current_this))
{
parse_error_context
(wfl, "Can't reference `this' before the superclass constructor has "
"been called");
PATCH_METHOD_RETURN_ERROR ();
}
java_parser_context_restore_global ();
if (is_static)
*is_static = is_static_flag;
/* Sometimes, we want the decl of the selected method. Such as for
EH checking */
if (ret_decl)
*ret_decl = list;
return patch_invoke (patch, list, args, super);
}
/* Check that we're not trying to do a static reference to a method in
non static method. Return 1 if it's the case, 0 otherwise. */
static int
check_for_static_method_reference (wfl, node, method, where, primary)
tree wfl, node, method, where, primary;
{
if (METHOD_STATIC (current_function_decl)
&& !METHOD_STATIC (method) && !primary && !CALL_CONSTRUCTOR_P (node))
{
char *fct_name = strdup (lang_printable_name (method, 0));
parse_error_context
(wfl, "Can't make static reference to method `%s %s' in class `%s'",
lang_printable_name (TREE_TYPE (TREE_TYPE (method)), 0), fct_name,
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (where))));
free (fct_name);
return 1;
}
return 0;
}
/* Patch an invoke expression METHOD and ARGS, based on its invocation
mode. */
static tree
patch_invoke (patch, method, args, from_super)
tree patch, method, args;
int from_super;
{
int im;
tree dtable, func;
tree original_call, t, ta;
/* Last step for args: convert build-in types. If we're dealing with
a new TYPE() type call, the first argument to the constructor
isn't found in the incomming argument list, but delivered by
`new' */
t = TYPE_ARG_TYPES (TREE_TYPE (method));
if (TREE_CODE (patch) == NEW_CLASS_EXPR)
t = TREE_CHAIN (t);
for (ta = args; t && ta; t = TREE_CHAIN (t), ta = TREE_CHAIN (ta))
if (JPRIMITIVE_TYPE_P (TREE_TYPE (TREE_VALUE (ta))) &&
TREE_TYPE (TREE_VALUE (ta)) != TREE_VALUE (t))
TREE_VALUE (ta) = convert (TREE_VALUE (t), TREE_VALUE (ta));
if (flag_emit_class_files)
func = method;
else
{
tree signature = build_java_signature (TREE_TYPE (method));
switch ((im = invocation_mode (method, from_super)))
{
case INVOKE_VIRTUAL:
dtable = invoke_build_dtable (0, args);
func = build_invokevirtual (dtable, method);
break;
case INVOKE_SUPER:
case INVOKE_STATIC:
func = build_known_method_ref (method, TREE_TYPE (method),
DECL_CONTEXT (method),
signature, args);
break;
case INVOKE_INTERFACE:
dtable = invoke_build_dtable (1, args);
func = build_invokeinterface (dtable, DECL_NAME (method), signature);
break;
default:
fatal ("Unknown invocation mode `%d' - build_invoke", im);
return NULL_TREE;
}
/* Ensure self_type is initialized, (invokestatic). FIXME */
func = build1 (NOP_EXPR, build_pointer_type (TREE_TYPE (method)), func);
}
TREE_TYPE (patch) = TREE_TYPE (TREE_TYPE (method));
TREE_OPERAND (patch, 0) = func;
TREE_OPERAND (patch, 1) = args;
original_call = patch;
/* We're processing a `new TYPE ()' form. New is called an its
returned value is the first argument to the constructor. We build
a COMPOUND_EXPR and use saved expression so that the overall NEW
expression value is a pointer to a newly created and initialized
class. */
if (TREE_CODE (original_call) == NEW_CLASS_EXPR)
{
tree class = DECL_CONTEXT (method);
tree c1, saved_new, size, new;
if (flag_emit_class_files)
{
TREE_TYPE (patch) = build_pointer_type (class);
return patch;
}
if (!TYPE_SIZE (class))
safe_layout_class (class);
size = size_in_bytes (class);
new = build (CALL_EXPR, promote_type (class),
build_address_of (alloc_object_node),
tree_cons (NULL_TREE, build_class_ref (class),
build_tree_list (NULL_TREE,
size_in_bytes (class))),
NULL_TREE);
saved_new = save_expr (new);
c1 = build_tree_list (NULL_TREE, saved_new);
TREE_CHAIN (c1) = TREE_OPERAND (original_call, 1);
TREE_OPERAND (original_call, 1) = c1;
TREE_SET_CODE (original_call, CALL_EXPR);
patch = build (COMPOUND_EXPR, TREE_TYPE (new), patch, saved_new);
}
return patch;
}
static int
invocation_mode (method, super)
tree method;
int super;
{
int access = get_access_flags_from_decl (method);
if (super)
return INVOKE_SUPER;
if (access & ACC_STATIC || access & ACC_FINAL)
return INVOKE_STATIC;
if (CLASS_FINAL (TYPE_NAME (DECL_CONTEXT (method))))
return INVOKE_STATIC;
if (CLASS_INTERFACE (TYPE_NAME (DECL_CONTEXT (method))))
return INVOKE_INTERFACE;
if (DECL_CONSTRUCTOR_P (method))
return INVOKE_STATIC;
return INVOKE_VIRTUAL;
}
/* Retrieve a refined list of matching methods. It covers the step
15.11.2 (Compile-Time Step 2) */
static tree
lookup_method_invoke (lc, cl, class, name, arg_list)
int lc;
tree cl;
tree class, name, arg_list;
{
tree atl = NULL_TREE; /* Arg Type List */
tree method, signature, list, node;
char *candidates; /* Used for error report */
/* Fix the arguments */
for (node = arg_list; node; node = TREE_CHAIN (node))
{
tree current_arg = TREE_VALUE (node);
/* Integer constant 0 passed as itself, not as a type */
if (current_arg != integer_zero_node)
current_arg = TREE_TYPE (TREE_VALUE (node));
/* Non primitive type may have to be resolved */
if (current_arg != integer_zero_node
&& !JPRIMITIVE_TYPE_P (current_arg))
resolve_and_layout (current_arg, NULL_TREE);
/* And promoted */
if (TREE_CODE (current_arg) == RECORD_TYPE)
current_arg = promote_type (current_arg);
atl = tree_cons (NULL_TREE, current_arg, atl);
}
/* Find all candidates and then refine the list, searching for the
most specific method. */
list = find_applicable_accessible_methods_list (lc, class, name, atl);
list = find_most_specific_methods_list (list);
if (list && !TREE_CHAIN (list))
return TREE_VALUE (list);
/* Issue an error. List candidates if any. Candidates are listed
only if accessible (non accessible methods may end-up here for
the sake of a better error report). */
candidates = NULL;
if (list)
{
tree current;
obstack_grow (&temporary_obstack, ". Candidates are:\n", 18);
for (current = list; current; current = TREE_CHAIN (current))
{
tree cm = TREE_VALUE (current);
char string [4096];
if (!cm || not_accessible_p (class, cm, 0))
continue;
sprintf
(string, " `%s' in `%s'%s",
get_printable_method_name (cm),
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (DECL_CONTEXT (cm)))),
(TREE_CHAIN (current) ? "\n" : ""));
obstack_grow (&temporary_obstack, string, strlen (string));
}
obstack_1grow (&temporary_obstack, '\0');
candidates = obstack_finish (&temporary_obstack);
}
/* Issue the error message */
for (node = atl; node; node = TREE_CHAIN (node))
if (TREE_VALUE (node) == integer_zero_node)
TREE_VALUE (node) = long_type_node;
method = make_node (FUNCTION_TYPE);
TYPE_ARG_TYPES (method) = atl;
signature = build_java_argument_signature (method);
parse_error_context (cl, "Can't find %s `%s(%s)' in class `%s'%s",
(lc ? "constructor" : "method"),
(lc ?
IDENTIFIER_POINTER(DECL_NAME (TYPE_NAME (class))) :
IDENTIFIER_POINTER (name)),
IDENTIFIER_POINTER (signature),
IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (class))),
(candidates ? candidates : ""));
return NULL_TREE;
}
/* 15.11.2.1: Find Methods that are Applicable and Accessible. LC is 1
when we're looking for a constructor. */
static tree
find_applicable_accessible_methods_list (lc, class, name, arglist)
int lc;
tree class, name, arglist;
{
tree method;
tree list = NULL_TREE, all_list = NULL_TREE;
while (class != NULL_TREE)
{
for (method = TYPE_METHODS (class);
method != NULL_TREE; method = TREE_CHAIN (method))
{
if (lc && !DECL_CONSTRUCTOR_P (method))
continue;
else if (!lc && (DECL_CONSTRUCTOR_P (method)
|| (GET_METHOD_NAME (method) != name)))
continue;
if (argument_types_convertible (method, arglist))
{
/* Retain accessible methods only */
if (!not_accessible_p (DECL_CONTEXT (current_function_decl),
method, 0))
list = tree_cons (NULL_TREE, method, list);
else
/* Also retain all selected method here */
all_list = tree_cons (NULL_TREE, method, list);
}
}
/* When dealing with constructor, stop here, otherwise search
other classes */
class = (lc ? NULL_TREE : CLASSTYPE_SUPER (class));
}
/* Either return the list obtained or all selected (but
inaccessible) methods for better error report. */
return (!list ? all_list : list);
}
/* 15.11.2.2 Choose the Most Specific Method */
static tree
find_most_specific_methods_list (list)
tree list;
{
int max = 0;
tree current, new_list = NULL_TREE;
for (current = list; current; current = TREE_CHAIN (current))
{
tree method;
DECL_SPECIFIC_COUNT (TREE_VALUE (current)) = 0;
for (method = list; method; method = TREE_CHAIN (method))
{
/* Don't test a method against itself */
if (method == current)
continue;
/* Compare arguments and location where method where declared */
if (argument_types_convertible (TREE_VALUE (method),
TREE_VALUE (current))
&& valid_method_invocation_conversion_p
(DECL_CONTEXT (TREE_VALUE (method)),
DECL_CONTEXT (TREE_VALUE (current))))
{
int v = ++DECL_SPECIFIC_COUNT (TREE_VALUE (current));
max = (v > max ? v : max);
}
}
}
/* Review the list and select the maximally specific methods */
for (current = list; current; current = TREE_CHAIN (current))
if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
/* If we can't find one, lower expectations and try to gather multiple
maximally specific methods */
while (!new_list)
{
while (--max > 0)
{
if (DECL_SPECIFIC_COUNT (TREE_VALUE (current)) == max)
new_list = tree_cons (NULL_TREE, TREE_VALUE (current), new_list);
}
return new_list;
}
return new_list;
}
/* Make sure that the type of each M2_OR_ARGLIST arguments can be
converted by method invocation conversion (5.3) to the type of the
corresponding parameter of M1. Implementation expects M2_OR_ARGLIST
to change less often than M1. */
static int
argument_types_convertible (m1, m2_or_arglist)
tree m1, m2_or_arglist;
{
static tree m2_arg_value = NULL_TREE;
static tree m2_arg_cache = NULL_TREE;
register tree m1_arg, m2_arg;
m1_arg = TYPE_ARG_TYPES (TREE_TYPE (m1));
if (!METHOD_STATIC (m1))
m1_arg = TREE_CHAIN (m1_arg);
if (m2_arg_value == m2_or_arglist)
m2_arg = m2_arg_cache;
else
{
/* M2_OR_ARGLIST can be a function DECL or a raw list of
argument types */
if (m2_or_arglist && TREE_CODE (m2_or_arglist) == FUNCTION_DECL)
{
m2_arg = TYPE_ARG_TYPES (TREE_TYPE (m2_or_arglist));
if (!METHOD_STATIC (m2_or_arglist))
m2_arg = TREE_CHAIN (m2_arg);
}
else
m2_arg = m2_or_arglist;
m2_arg_value = m2_or_arglist;
m2_arg_cache = m2_arg;
}
while (m1_arg && m2_arg)
{
resolve_and_layout (TREE_VALUE (m1_arg), NULL_TREE);
if (!valid_method_invocation_conversion_p (TREE_VALUE (m1_arg),
TREE_VALUE (m2_arg)))
break;
m1_arg = TREE_CHAIN (m1_arg);
m2_arg = TREE_CHAIN (m2_arg);
}
return (!m1_arg && !m2_arg ? 1 : 0);
}
/* Qualification routines */
static void
qualify_ambiguous_name (id)
tree id;
{
tree qual, qual_wfl, name, decl, ptr_type, saved_current_class;
int again, super_found = 0, this_found = 0;
/* We first qualify the first element, then derive qualification of
others based on the first one. If the first element is qualified
by a resolution (field or type), this resolution is stored in the
QUAL_RESOLUTION of the qual element being examined. We need to
save the current_class since the use of SUPER might change the
its value. */
saved_current_class = current_class;
qual = EXPR_WFL_QUALIFICATION (id);
do {
/* Simple qualified expression feature a qual_wfl that is a
WFL. Expression derived from a primary feature more complicated
things like a CALL_EXPR. Expression from primary need to be
worked out to extract the part on which the qualification will
take place. */
qual_wfl = QUAL_WFL (qual);
switch (TREE_CODE (qual_wfl))
{
case CALL_EXPR:
qual_wfl = TREE_OPERAND (qual_wfl, 0);
if (TREE_CODE (qual_wfl) != EXPR_WITH_FILE_LOCATION)
{
qual = EXPR_WFL_QUALIFICATION (qual_wfl);
qual_wfl = QUAL_WFL (qual);
}
break;
case NEW_CLASS_EXPR:
case CONVERT_EXPR:
qual_wfl = TREE_OPERAND (qual_wfl, 0);
break;
case ARRAY_REF:
while (TREE_CODE (qual_wfl) == ARRAY_REF)
qual_wfl = TREE_OPERAND (qual_wfl, 0);
break;
default:
/* Fix for -Wall. Just break doing nothing */
break;
}
name = EXPR_WFL_NODE (qual_wfl);
ptr_type = current_class;
again = 0;
/* If we have a THIS (from a primary), we set the context accordingly */
if (name == this_identifier_node)
{
qual = TREE_CHAIN (qual);
qual_wfl = QUAL_WFL (qual);
if (TREE_CODE (qual_wfl) == CALL_EXPR)
again = 1;
else
name = EXPR_WFL_NODE (qual_wfl);
this_found = 1;
}
/* If we have a SUPER, we set the context accordingly */
if (name == super_identifier_node)
{
current_class = CLASSTYPE_SUPER (ptr_type);
/* Check that there is such a thing as a super class. If not,
return. The error will be caught later on, during the
resolution */
if (!current_class)
{
current_class = saved_current_class;
return;
}
qual = TREE_CHAIN (qual);
/* Do one more interation to set things up */
super_found = again = 1;
}
/* Loop one more time if we're dealing with ?: or a string constant */
if (TREE_CODE (qual_wfl) == CONDITIONAL_EXPR
|| TREE_CODE (qual_wfl) == STRING_CST)
{
qual = TREE_CHAIN (qual);
qual_wfl = QUAL_WFL (qual);
again = 1;
}
} while (again);
/* If name appears within the scope of a location variable
declaration or parameter declaration, then it is an expression
name. We don't carry this test out if we're in the context of the
use of SUPER or THIS */
if (!this_found && !super_found && (decl = IDENTIFIER_LOCAL_VALUE (name)))
{
RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1;
QUAL_RESOLUTION (qual) = decl;
}
/* If within the class/interface NAME was found to be used there
exists a (possibly inherited) field named NAME, then this is an
expression name. */
else if ((decl = lookup_field_wrapper (ptr_type, name)))
{
RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1;
QUAL_RESOLUTION (qual) = decl;
}
/* We reclassify NAME as a type name if:
- NAME is a class/interface declared within the compilation
unit containing NAME,
- NAME is imported via a single-type-import declaration,
- NAME is declared in an another compilation unit of the package
of the compilation unit containing NAME,
- NAME is declared by exactly on type-import-on-demand declaration
of the compilation unit containing NAME. */
else if ((decl = resolve_and_layout (name, NULL_TREE)))
{
RESOLVE_TYPE_NAME_P (qual_wfl) = 1;
QUAL_RESOLUTION (qual) = decl;
}
/* Method call are expression name */
else if (TREE_CODE (QUAL_WFL (qual)) == CALL_EXPR
|| TREE_CODE (QUAL_WFL (qual)) == ARRAY_REF)
RESOLVE_EXPRESSION_NAME_P (qual_wfl) = 1;
/* Check here that NAME isn't declared by more than one
type-import-on-demand declaration of the compilation unit
containing NAME. FIXME */
/* Otherwise, NAME is reclassified as a package name */
else
RESOLVE_PACKAGE_NAME_P (qual_wfl) = 1;
/* Propagate the qualification accross other components of the
qualified name */
for (qual = TREE_CHAIN (qual); qual;
qual_wfl = QUAL_WFL (qual), qual = TREE_CHAIN (qual))
{
if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
RESOLVE_PACKAGE_NAME_P (QUAL_WFL (qual)) = 1;
else
RESOLVE_EXPRESSION_NAME_P (QUAL_WFL (qual)) = 1;
}
/* Store the global qualification for the ambiguous part of ID back
into ID fields */
if (RESOLVE_EXPRESSION_NAME_P (qual_wfl))
RESOLVE_EXPRESSION_NAME_P (id) = 1;
else if (RESOLVE_TYPE_NAME_P (qual_wfl))
RESOLVE_TYPE_NAME_P (id) = 1;
else if (RESOLVE_PACKAGE_NAME_P (qual_wfl))
RESOLVE_PACKAGE_NAME_P (id) = 1;
/* Restore the current class */
current_class = saved_current_class;
}
static int
breakdown_qualified (left, right, source)
tree *left, *right, source;
{
char *p = IDENTIFIER_POINTER (source), *base;
int l = IDENTIFIER_LENGTH (source);
/* Breakdown NAME into REMAINDER . IDENTIFIER */
base = p;
p += (l-1);
while (*p != '.' && p != base)
p--;
/* We didn't find a '.'. Return an error */
if (p == base)
return 1;
*p = '\0';
if (right)
*right = get_identifier (p+1);
*left = get_identifier (IDENTIFIER_POINTER (source));
*p = '.';
return 0;
}
/* Patch tree nodes in a function body. When a BLOCK is found, push
local variable decls if present. */
static tree
java_complete_tree (node)
tree node;
{
tree nn, cn, wfl_op1, wfl_op2, wfl_op3;
int flag;
/* CONVERT_EXPR always has its type set, even though it needs to be
worked out. */
if (TREE_TYPE (node) && TREE_CODE (node) != CONVERT_EXPR)
return node;
/* The switch block implements cases processing container nodes
first. Contained nodes are always written back. Leaves come
next and return a value. */
switch (TREE_CODE (node))
{
case BLOCK:
/* 1- Block section.
Set the local values on decl names so we can identify them
faster when they're referenced. At that stage, identifiers
are legal so we don't check for declaration errors. */
for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
{
DECL_CONTEXT (cn) = current_function_decl;
IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = cn;
INITIALIZED_P (cn) = 0;
}
if (BLOCK_EXPR_BODY (node) == NULL_TREE)
CAN_COMPLETE_NORMALLY (node) = 1;
else
{
tree stmt = BLOCK_EXPR_BODY (node);
tree *ptr;
int error_seen = 0;
if (TREE_CODE (stmt) == COMPOUND_EXPR)
{
/* Re-order from (((A; B); C); ...; Z) to
(A; (B; (C ; (...; Z)))).
This makes it easier to scan the statements left-to-right
without using recursion (which might overflow the stack
if the block has many statements. */
for (;;)
{
tree left = TREE_OPERAND (stmt, 0);
if (TREE_CODE (left) != COMPOUND_EXPR)
break;
TREE_OPERAND (stmt, 0) = TREE_OPERAND (left, 1);
TREE_OPERAND (left, 1) = stmt;
stmt = left;
}
BLOCK_EXPR_BODY (node) = stmt;
}
/* Now do the actual complete, without deep recursion for
long blocks. */
ptr = &BLOCK_EXPR_BODY (node);
while (TREE_CODE (*ptr) == COMPOUND_EXPR)
{
tree cur = java_complete_tree (TREE_OPERAND (*ptr, 0));
tree *next = &TREE_OPERAND (*ptr, 1);
TREE_OPERAND (*ptr, 0) = cur;
if (TREE_CODE (cur) == ERROR_MARK)
error_seen++;
else if (! CAN_COMPLETE_NORMALLY (cur))
{
wfl_op2 = *next;
for (;;)
{
if (TREE_CODE (wfl_op2) == BLOCK)
wfl_op2 = BLOCK_EXPR_BODY (wfl_op2);
else if (TREE_CODE (wfl_op2) == COMPOUND_EXPR)
wfl_op2 = TREE_OPERAND (wfl_op2, 0);
else
break;
}
if (TREE_CODE (wfl_op2) != CASE_EXPR
&& TREE_CODE (wfl_op2) != DEFAULT_EXPR)
{
SET_WFL_OPERATOR (wfl_operator, *ptr, wfl_op2);
parse_error_context (wfl_operator,
"Unreachable statement");
}
}
ptr = next;
}
*ptr = java_complete_tree (*ptr);
if (TREE_CODE (*ptr) == ERROR_MARK || error_seen > 0)
return error_mark_node;
CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (*ptr);
}
/* Turn local bindings to null */
for (cn = BLOCK_EXPR_DECLS (node); cn; cn = TREE_CHAIN (cn))
IDENTIFIER_LOCAL_VALUE (DECL_NAME (cn)) = NULL_TREE;
TREE_TYPE (node) = void_type_node;
break;
/* 2- They are expressions but ultimately deal with statements */
case THROW_EXPR:
wfl_op1 = TREE_OPERAND (node, 0);
COMPLETE_CHECK_OP_0 (node);
/* CAN_COMPLETE_NORMALLY (node) = 0; */
return patch_throw_statement (node, wfl_op1);
case SYNCHRONIZED_EXPR:
wfl_op1 = TREE_OPERAND (node, 0);
COMPLETE_CHECK_OP_0 (node);
COMPLETE_CHECK_OP_1 (node);
return patch_synchronized_statement (node, wfl_op1);
case TRY_EXPR:
return patch_try_statement (node);
case LABELED_BLOCK_EXPR:
PUSH_LABELED_BLOCK (node);
if (LABELED_BLOCK_BODY (node))
COMPLETE_CHECK_OP_1 (node);
TREE_TYPE (node) = void_type_node;
POP_LABELED_BLOCK ();
if (CAN_COMPLETE_NORMALLY (LABELED_BLOCK_BODY (node)))
CAN_COMPLETE_NORMALLY (node) = 1;
return node;
case EXIT_BLOCK_EXPR:
/* We don't complete operand 1, because it's the return value of
the EXIT_BLOCK_EXPR which doesn't exist it Java */
return patch_bc_statement (node);
case CASE_EXPR:
cn = java_complete_tree (TREE_OPERAND (node, 0));
if (cn == error_mark_node)
return cn;
/* First, the case expression must be constant */
cn = fold (cn);
if (!TREE_CONSTANT (cn))
{
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
parse_error_context (node, "Constant expression required");
return error_mark_node;
}
nn = ctxp->current_loop;
/* It must be assignable to the type of the switch expression. */
if (!try_builtin_assignconv (NULL_TREE,
TREE_TYPE (TREE_OPERAND (nn, 0)), cn))
{
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
parse_error_context
(wfl_operator,
"Incompatible type for case. Can't convert `%s' to `int'",
lang_printable_name (TREE_TYPE (cn), 0));
return error_mark_node;
}
cn = fold (convert (int_type_node, cn));
/* Multiple instance of a case label bearing the same
value is checked during code generation. The case
expression is allright so far. */
TREE_OPERAND (node, 0) = cn;
TREE_TYPE (node) = void_type_node;
CAN_COMPLETE_NORMALLY (node) = 1;
break;
case DEFAULT_EXPR:
nn = ctxp->current_loop;
/* Only one default label is allowed per switch statement */
if (SWITCH_HAS_DEFAULT (nn))
{
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
parse_error_context (wfl_operator,
"Duplicate case label: `default'");
return error_mark_node;
}
else
SWITCH_HAS_DEFAULT (nn) = 1;
TREE_TYPE (node) = void_type_node;
CAN_COMPLETE_NORMALLY (node) = 1;
break;
case SWITCH_EXPR:
case LOOP_EXPR:
PUSH_LOOP (node);
/* Check whether the loop was enclosed in a labeled
statement. If not, create one, insert the loop in it and
return the node */
nn = patch_loop_statement (node);
/* Anyways, walk the body of the loop */
if (TREE_CODE (node) == LOOP_EXPR)
TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
/* Switch statement: walk the switch expression and the cases */
else
node = patch_switch_statement (node);
if (TREE_OPERAND (node, 0) == error_mark_node)
return error_mark_node;
TREE_TYPE (nn) = TREE_TYPE (node) = void_type_node;
/* If we returned something different, that's because we
inserted a label. Pop the label too. */
if (nn != node)
{
if (CAN_COMPLETE_NORMALLY (node))
CAN_COMPLETE_NORMALLY (nn) = 1;
POP_LABELED_BLOCK ();
}
POP_LOOP ();
return nn;
case EXIT_EXPR:
TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
return patch_exit_expr (node);
case COND_EXPR:
/* Condition */
TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
if (TREE_OPERAND (node, 0) == error_mark_node)
return error_mark_node;
/* then-else branches */
TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
if (TREE_OPERAND (node, 1) == error_mark_node)
return error_mark_node;
TREE_OPERAND (node, 2) = java_complete_tree (TREE_OPERAND (node, 2));
if (TREE_OPERAND (node, 2) == error_mark_node)
return error_mark_node;
return patch_if_else_statement (node);
break;
case CONDITIONAL_EXPR:
/* Condition */
wfl_op1 = TREE_OPERAND (node, 0);
COMPLETE_CHECK_OP_0 (node);
wfl_op2 = TREE_OPERAND (node, 1);
COMPLETE_CHECK_OP_1 (node);
wfl_op3 = TREE_OPERAND (node, 2);
COMPLETE_CHECK_OP_2 (node);
return patch_conditional_expr (node, wfl_op1, wfl_op2);
/* 3- Expression section */
case COMPOUND_EXPR:
wfl_op2 = TREE_OPERAND (node, 1);
TREE_OPERAND (node, 0) = nn = java_complete_tree (TREE_OPERAND (node, 0));
if (! CAN_COMPLETE_NORMALLY (nn) && TREE_CODE (nn) != ERROR_MARK)
{
SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
parse_error_context (wfl_operator, "Unreachable statement");
}
TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
if (TREE_OPERAND (node, 1) == error_mark_node)
return error_mark_node;
TREE_TYPE (node) = TREE_TYPE (TREE_OPERAND (node, 1));
CAN_COMPLETE_NORMALLY (node)
= CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1));
break;
case RETURN_EXPR:
/* CAN_COMPLETE_NORMALLY (node) = 0; */
return patch_return (node);
case EXPR_WITH_FILE_LOCATION:
if (!EXPR_WFL_NODE (node) /* Or a PRIMARY flag ? */
|| TREE_CODE (EXPR_WFL_NODE (node)) == IDENTIFIER_NODE)
{
node = resolve_expression_name (node, NULL);
CAN_COMPLETE_NORMALLY (node) = 1;
}
else
{
tree body = java_complete_tree (EXPR_WFL_NODE (node));
EXPR_WFL_NODE (node) = body;
TREE_SIDE_EFFECTS (node) = 1;
CAN_COMPLETE_NORMALLY (node) = CAN_COMPLETE_NORMALLY (body);
if (EXPR_WFL_NODE (node) == error_mark_node)
{
/* Its important for the evaluation of assignment that
this mark on the TREE_TYPE is propagated. */
TREE_TYPE (node) = error_mark_node;
return error_mark_node;
}
else
TREE_TYPE (node) = TREE_TYPE (EXPR_WFL_NODE (node));
}
break;
case NEW_ARRAY_EXPR:
/* Patch all the dimensions */
flag = 0;
for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
{
int location = EXPR_WFL_LINECOL (TREE_VALUE (cn));
tree dim = java_complete_tree (TREE_VALUE (cn));
if (dim == error_mark_node)
{
flag = 1;
continue;
}
else
{
TREE_VALUE (cn) = dim;
/* Setup the location of the current dimension, for
later error report. */
TREE_PURPOSE (cn) =
build_expr_wfl (NULL_TREE, input_filename, 0, 0);
EXPR_WFL_LINECOL (TREE_PURPOSE (cn)) = location;
}
}
/* They complete the array creation expression, if no errors
were found. */
CAN_COMPLETE_NORMALLY (node) = 1;
return (flag ? error_mark_node : patch_newarray (node));
case NEW_CLASS_EXPR:
case CALL_EXPR:
CAN_COMPLETE_NORMALLY (node) = 1;
/* Complete function's argument(s) first */
if (complete_function_arguments (node))
return error_mark_node;
else
{
tree decl, wfl = TREE_OPERAND (node, 0);
int in_this = CALL_THIS_CONSTRUCTOR_P (node);
node = patch_method_invocation (node, NULL_TREE,
NULL_TREE, 0, &decl, 0);
if (node == error_mark_node)
return error_mark_node;
check_thrown_exceptions (EXPR_WFL_LINECOL (node), decl);
/* If we call this(...), register signature and positions */
if (in_this)
DECL_CONSTRUCTOR_CALLS (current_function_decl) =
tree_cons (wfl, decl,
DECL_CONSTRUCTOR_CALLS (current_function_decl));
return node;
}
case MODIFY_EXPR:
/* Save potential wfls */
wfl_op1 = TREE_OPERAND (node, 0);
wfl_op2 = TREE_OPERAND (node, 1);
TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
if (TREE_OPERAND (node, 0) == error_mark_node)
return error_mark_node;
if (COMPOUND_ASSIGN_P (wfl_op2))
{
tree lvalue;
tree other =
java_complete_tree (TREE_OPERAND (wfl_op2, 0));
/* Hand stablize the lhs on both places */
lvalue = stabilize_reference (other);
TREE_OPERAND (node, 0) = lvalue;
TREE_OPERAND (TREE_OPERAND (node, 1), 0) = lvalue;
}
/* There are cases where the type of RHS is fixed. In those
cases, if the evaluation of the RHS fails, we further the
evaluation of the assignment to detect more errors. */
nn = java_complete_tree (TREE_OPERAND (node, 1));
if (nn == error_mark_node)
{
/* It's hopeless, but we can further things on to discover
an error during the assignment. In any cases, the
assignment operation fails. */
if (TREE_CODE (TREE_OPERAND (node, 1)) != EXPR_WITH_FILE_LOCATION
&& TREE_TYPE (TREE_OPERAND (node, 1)) != error_mark_node)
patch_assignment (node, wfl_op1, wfl_op2);
/* Now, we still mark the lhs as initialized */
if (DECL_P (TREE_OPERAND (node, 0)))
INITIALIZED_P (TREE_OPERAND (node, 0)) = 1;
return error_mark_node;
}
TREE_OPERAND (node, 1) = nn;
/* In case we're handling = with a String as a RHS, we need to
produce a String out of the RHS (it might still be a
STRING_CST or a StringBuffer at this stage */
if ((nn = patch_string (TREE_OPERAND (node, 1))))
TREE_OPERAND (node, 1) = nn;
node = patch_assignment (node, wfl_op1, wfl_op2);
CAN_COMPLETE_NORMALLY (node) = 1;
return node;
case MULT_EXPR:
case PLUS_EXPR:
case MINUS_EXPR:
case LSHIFT_EXPR:
case RSHIFT_EXPR:
case URSHIFT_EXPR:
case BIT_AND_EXPR:
case BIT_XOR_EXPR:
case BIT_IOR_EXPR:
case TRUNC_MOD_EXPR:
case RDIV_EXPR:
case TRUTH_ANDIF_EXPR:
case TRUTH_ORIF_EXPR:
case EQ_EXPR:
case NE_EXPR:
case GT_EXPR:
case GE_EXPR:
case LT_EXPR:
case LE_EXPR:
/* Operands 0 and 1 are WFL in certain cases only. patch_binop
knows how to handle those cases. */
wfl_op1 = TREE_OPERAND (node, 0);
wfl_op2 = TREE_OPERAND (node, 1);
CAN_COMPLETE_NORMALLY (node) = 1;
/* Don't complete string nodes if dealing with the PLUS operand. */
if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op1))
{
TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
if (TREE_OPERAND (node, 0) == error_mark_node)
return error_mark_node;
}
if (TREE_CODE (node) != PLUS_EXPR || !JSTRING_P (wfl_op2))
{
TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
if (TREE_OPERAND (node, 1) == error_mark_node)
return error_mark_node;
}
return patch_binop (node, wfl_op1, wfl_op2);
case INSTANCEOF_EXPR:
wfl_op1 = TREE_OPERAND (node, 0);
COMPLETE_CHECK_OP_0 (node);
return patch_binop (node, wfl_op1, TREE_OPERAND (node, 1));
case UNARY_PLUS_EXPR:
case NEGATE_EXPR:
case TRUTH_NOT_EXPR:
case BIT_NOT_EXPR:
case PREDECREMENT_EXPR:
case PREINCREMENT_EXPR:
case POSTDECREMENT_EXPR:
case POSTINCREMENT_EXPR:
case CONVERT_EXPR:
/* There are cases were wfl_op1 is a WFL. patch_unaryop knows
how to handle those cases. */
wfl_op1 = TREE_OPERAND (node, 0);
CAN_COMPLETE_NORMALLY (node) = 1;
TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
if (TREE_OPERAND (node, 0) == error_mark_node)
return error_mark_node;
return patch_unaryop (node, wfl_op1);
case ARRAY_REF:
/* There are cases were wfl_op1 is a WFL. patch_array_ref knows
how to handle those cases. */
wfl_op1 = TREE_OPERAND (node, 0);
TREE_OPERAND (node, 0) = java_complete_tree (wfl_op1);
if (TREE_OPERAND (node, 0) == error_mark_node)
return error_mark_node;
if (!flag_emit_class_files)
TREE_OPERAND (node, 0) = save_expr (TREE_OPERAND (node, 0));
/* The same applies to wfl_op2 */
wfl_op2 = TREE_OPERAND (node, 1);
TREE_OPERAND (node, 1) = java_complete_tree (wfl_op2);
if (TREE_OPERAND (node, 1) == error_mark_node)
return error_mark_node;
if (!flag_emit_class_files)
TREE_OPERAND (node, 1) = save_expr (TREE_OPERAND (node, 1));
return patch_array_ref (node);
#if 0
COMPONENT_REF:
/* Planned re-write FIXME */
TREE_OPERAND (node, 0) = java_complete_tree (TREE_OPERAND (node, 0));
break;
#endif
case THIS_EXPR:
/* Can't use THIS in a static environment */
if (!current_this)
{
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
parse_error_context (wfl_operator, "Keyword `this' used outside "
"allowed context");
TREE_TYPE (node) = error_mark_node;
return error_mark_node;
}
if (ctxp->explicit_constructor_p)
{
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
parse_error_context
(wfl_operator, "Can't reference `this' or `super' before the "
"superclass constructor has been called");
TREE_TYPE (node) = error_mark_node;
return error_mark_node;
}
return current_this;
default:
CAN_COMPLETE_NORMALLY (node) = 1;
/* Ok: may be we have a STRING_CST or a crafted `StringBuffer'
and it's time to turn it into the appropriate String object
*/
if ((node = patch_string (node)))
return node;
fatal ("No case for tree code `%s' - java_complete_tree\n",
tree_code_name [TREE_CODE (node)]);
}
return node;
}
/* Complete function call's argument. Return a non zero value is an
error was found. */
static int
complete_function_arguments (node)
tree node;
{
int flag = 0;
tree cn;
ctxp->explicit_constructor_p += (CALL_THIS_CONSTRUCTOR_P (node) ? 1 : 0);
for (cn = TREE_OPERAND (node, 1); cn; cn = TREE_CHAIN (cn))
{
tree wfl = TREE_VALUE (cn), parm, temp;
parm = java_complete_tree (wfl);
if (parm == error_mark_node)
{
flag = 1;
continue;
}
/* If have a string literal that we haven't transformed yet or a
crafted string buffer, as a result of use of the the String
`+' operator. Build `parm.toString()' and expand it. */
if ((temp = patch_string (parm)))
parm = temp;
/* Inline PRIMTYPE.TYPE read access */
parm = maybe_build_primttype_type_ref (parm, wfl);
TREE_VALUE (cn) = parm;
}
ctxp->explicit_constructor_p -= (CALL_THIS_CONSTRUCTOR_P (node) ? 1 : 0);
return flag;
}
/* Sometimes (for loops and variable initialized during their
declaration), we want to wrap a statement around a WFL and turn it
debugable. */
static tree
build_debugable_stmt (location, stmt)
int location;
tree stmt;
{
if (TREE_CODE (stmt) != EXPR_WITH_FILE_LOCATION)
{
stmt = build_expr_wfl (stmt, input_filename, 0, 0);
EXPR_WFL_LINECOL (stmt) = location;
}
JAVA_MAYBE_GENERATE_DEBUG_INFO (stmt);
return stmt;
}
static tree
build_expr_block (body, decls)
tree body, decls;
{
tree node = make_node (BLOCK);
BLOCK_EXPR_DECLS (node) = decls;
BLOCK_EXPR_BODY (node) = body;
if (body)
TREE_TYPE (node) = TREE_TYPE (body);
TREE_SIDE_EFFECTS (node) = 1;
return node;
}
/* Create a new function block and link it approriately to current
function block chain */
static tree
enter_block ()
{
return (enter_a_block (build_expr_block (NULL_TREE, NULL_TREE)));
}
/* Link block B supercontext to the previous block. The current
function DECL is used as supercontext when enter_a_block is called
for the first time for a given function. The current function body
(DECL_FUNCTION_BODY) is set to be block B. */
static tree
enter_a_block (b)
tree b;
{
tree fndecl = current_function_decl;
if (!DECL_FUNCTION_BODY (fndecl))
{
BLOCK_SUPERCONTEXT (b) = fndecl;
DECL_FUNCTION_BODY (fndecl) = b;
}
else
{
BLOCK_SUPERCONTEXT (b) = DECL_FUNCTION_BODY (fndecl);
DECL_FUNCTION_BODY (fndecl) = b;
}
return b;
}
/* Exit a block by changing the current function body
(DECL_FUNCTION_BODY) to the current block super context, only if
the block being exited isn't the method's top level one. */
static tree
exit_block ()
{
tree b = DECL_FUNCTION_BODY (current_function_decl);
if (BLOCK_SUPERCONTEXT (b) != current_function_decl)
DECL_FUNCTION_BODY (current_function_decl) = BLOCK_SUPERCONTEXT (b);
return b;
}
/* Lookup for NAME in the nested function's blocks, all the way up to
the current toplevel one. It complies with Java's local variable
scoping rules. */
static tree
lookup_name_in_blocks (name)
tree name;
{
tree b = DECL_FUNCTION_BODY (current_function_decl);
while (b != current_function_decl)
{
tree current;
/* Paranoid sanity check. To be removed */
if (TREE_CODE (b) != BLOCK)
fatal ("non block expr function body - lookup_name_in_blocks");
for (current = BLOCK_EXPR_DECLS (b); current;
current = TREE_CHAIN (current))
if (DECL_NAME (current) == name)
return current;
b = BLOCK_SUPERCONTEXT (b);
}
return NULL_TREE;
}
static void
maybe_absorb_scoping_blocks ()
{
while (BLOCK_EXPR_ORIGIN (DECL_FUNCTION_BODY (current_function_decl)))
{
tree b = exit_block ();
java_method_add_stmt (current_function_decl, b);
SOURCE_FRONTEND_DEBUG (("Absorbing scoping block at line %d", lineno));
}
}
/* This section of the source is reserved to build_* functions that
are building incomplete tree nodes and the patch_* functions that
are completing them. */
/* Build a super() constructor invocation. Returns empty_stmt_node if
we're currently dealing with the class java.lang.Object. */
static tree
build_super_invocation ()
{
if (current_class == object_type_node)
return empty_stmt_node;
else
{
tree super_wfl = build_wfl_node (super_identifier_node,
input_filename, 0, 0);
return build_method_invocation (super_wfl, NULL_TREE);
}
}
/* Build a SUPER/THIS qualified method invocation. */
static tree
build_this_super_qualified_invocation (use_this, name, args, lloc, rloc)
int use_this;
tree name, args;
int lloc, rloc;
{
tree invok;
tree wfl =
build_wfl_node ((use_this ? this_identifier_node : super_identifier_node),
input_filename, 0, 0);
EXPR_WFL_LINECOL (wfl) = lloc;
invok = build_method_invocation (name, args);
return make_qualified_primary (wfl, invok, rloc);
}
/* Build an incomplete CALL_EXPR node. */
static tree
build_method_invocation (name, args)
tree name;
tree args;
{
tree call = build (CALL_EXPR, NULL_TREE, name, args, NULL_TREE);
TREE_SIDE_EFFECTS (call) = 1;
EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
return call;
}
/* Build an incomplete new xxx(...) node. */
static tree
build_new_invocation (name, args)
tree name, args;
{
tree call = build (NEW_CLASS_EXPR, NULL_TREE, name, args, NULL_TREE);
TREE_SIDE_EFFECTS (call) = 1;
EXPR_WFL_LINECOL (call) = EXPR_WFL_LINECOL (name);
return call;
}
/* Build an incomplete assignment expression. */
static tree
build_assignment (op, op_location, lhs, rhs)
int op, op_location;
tree lhs, rhs;
{
tree assignment;
/* Build the corresponding binop if we deal with a Compound
Assignment operator. Mark the binop sub-tree as part of a
Compound Assignment expression */
if (op != ASSIGN_TK)
{
rhs = build_binop (BINOP_LOOKUP (op), op_location, lhs, rhs);
COMPOUND_ASSIGN_P (rhs) = 1;
}
assignment = build (MODIFY_EXPR, NULL_TREE, lhs, rhs);
TREE_SIDE_EFFECTS (assignment) = 1;
EXPR_WFL_LINECOL (assignment) = op_location;
return assignment;
}
/* Print an INTEGER_CST node in a static buffer, and return the buffer. */
char *
print_int_node (node)
tree node;
{
static char buffer [80];
if (TREE_CONSTANT_OVERFLOW (node))
sprintf (buffer, "<overflow>");
if (TREE_INT_CST_HIGH (node) == 0)
sprintf (buffer, HOST_WIDE_INT_PRINT_UNSIGNED,
TREE_INT_CST_LOW (node));
else if (TREE_INT_CST_HIGH (node) == -1
&& TREE_INT_CST_LOW (node) != 0)
{
buffer [0] = '-';
sprintf (&buffer [1], HOST_WIDE_INT_PRINT_UNSIGNED,
-TREE_INT_CST_LOW (node));
}
else
sprintf (buffer, HOST_WIDE_INT_PRINT_DOUBLE_HEX,
TREE_INT_CST_HIGH (node), TREE_INT_CST_LOW (node));
return buffer;
}
/* Return 1 if you an assignment of a FINAL is attempted */
static int
check_final_assignment (lvalue, wfl)
tree lvalue, wfl;
{
if (DECL_P (lvalue) && FIELD_FINAL (lvalue))
{
parse_error_context
(wfl, "Can't assign a value to the final variable `%s'",
IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl)));
return 1;
}
return 0;
}
/* Inline references to java.lang.PRIMTYPE.TYPE when accessed in
read. This is needed to avoid circularities in the implementation
of these fields in libjava. */
static tree
maybe_build_primttype_type_ref (rhs, wfl)
tree rhs, wfl;
{
tree to_return = NULL_TREE;
tree rhs_type = TREE_TYPE (rhs);
if (TREE_CODE (rhs) == COMPOUND_EXPR)
{
tree n = TREE_OPERAND (rhs, 1);
if (TREE_CODE (n) == VAR_DECL
&& DECL_NAME (n) == TYPE_identifier_node
&& rhs_type == class_ptr_type)
{
char *self_name = IDENTIFIER_POINTER (EXPR_WFL_NODE (wfl));
if (!strncmp (self_name, "java.lang.", 10))
to_return = build_primtype_type_ref (self_name);
}
}
return (to_return ? to_return : rhs );
}
/* 15.25 Assignment operators. */
static tree
patch_assignment (node, wfl_op1, wfl_op2)
tree node;
tree wfl_op1;
tree wfl_op2;
{
tree rhs = TREE_OPERAND (node, 1);
tree lvalue = TREE_OPERAND (node, 0), llvalue;
tree lhs_type, rhs_type, new_rhs = NULL_TREE;
int error_found = 0;
int lvalue_from_array = 0;
/* Can't assign to a final. */
if (check_final_assignment (lvalue, wfl_op1))
error_found = 1;
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
/* Lhs can be a named variable */
if (DECL_P (lvalue))
{
INITIALIZED_P (lvalue) = 1;
lhs_type = TREE_TYPE (lvalue);
}
/* Or Lhs can be a array acccess. Should that be lvalue ? FIXME +
comment on reason why */
else if (TREE_CODE (wfl_op1) == ARRAY_REF)
{
lhs_type = TREE_TYPE (lvalue);
lvalue_from_array = 1;
}
/* Or a field access */
else if (TREE_CODE (lvalue) == COMPONENT_REF)
lhs_type = TREE_TYPE (lvalue);
/* Or a function return slot */
else if (TREE_CODE (lvalue) == RESULT_DECL)
lhs_type = TREE_TYPE (lvalue);
/* Otherwise, we might want to try to write into an optimized static
final, this is an of a different nature, reported further on. */
else if (TREE_CODE (wfl_op1) == EXPR_WITH_FILE_LOCATION
&& resolve_expression_name (wfl_op1, &llvalue)
&& check_final_assignment (llvalue, wfl_op1))
{
error_found = 1;
/* What we should do instead is resetting the all the flags
previously set, exchange lvalue for llvalue and continue. */
return error_mark_node;
}
else
{
parse_error_context (wfl_op1, "Invalid left hand side of assignment");
error_found = 1;
}
rhs_type = TREE_TYPE (rhs);
/* 5.1 Try the assignment conversion for builtin type. */
new_rhs = try_builtin_assignconv (wfl_op1, lhs_type, rhs);
/* 5.2 If it failed, try a reference conversion */
if (!new_rhs && (new_rhs = try_reference_assignconv (lhs_type, rhs)))
lhs_type = promote_type (rhs_type);
/* 15.25.2 If we have a compound assignment, convert RHS into the
type of the LHS */
else if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
new_rhs = convert (lhs_type, rhs);
/* Explicit cast required. This is an error */
if (!new_rhs)
{
char *t1 = strdup (lang_printable_name (TREE_TYPE (rhs), 0));
char *t2 = strdup (lang_printable_name (lhs_type, 0));
tree wfl;
char operation [32]; /* Max size known */
/* If the assignment is part of a declaration, we use the WFL of
the declared variable to point out the error and call it a
declaration problem. If the assignment is a genuine =
operator, we call is a operator `=' problem, otherwise we
call it an assignment problem. In both of these last cases,
we use the WFL of the operator to indicate the error. */
if (MODIFY_EXPR_FROM_INITIALIZATION_P (node))
{
wfl = wfl_op1;
strcpy (operation, "declaration");
}
else
{
wfl = wfl_operator;
if (COMPOUND_ASSIGN_P (TREE_OPERAND (node, 1)))
strcpy (operation, "assignment");
else if (TREE_CODE (TREE_OPERAND (node, 0)) == RESULT_DECL)
strcpy (operation, "`return'");
else
strcpy (operation, "`='");
}
parse_error_context
(wfl, (!valid_cast_to_p (rhs_type, lhs_type) ?
"Incompatible type for %s. Can't convert `%s' to `%s'" :
"Incompatible type for %s. Explicit cast "
"needed to convert `%s' to `%s'"), operation, t1, t2);
free (t1); free (t2);
error_found = 1;
}
/* Inline read access to java.lang.PRIMTYPE.TYPE */
rhs = maybe_build_primttype_type_ref (rhs, wfl_op2);
/* Inline read access to java.lang.PRIMTYPE.TYPE */
if (new_rhs)
new_rhs = maybe_build_primttype_type_ref (new_rhs, wfl_op2);
if (error_found)
return error_mark_node;
/* If we built a compound expression as the result of a reference
assignment into an array element, return it here. */
if (TREE_CODE (node) == COMPOUND_EXPR)
return node;
TREE_OPERAND (node, 0) = lvalue;
TREE_OPERAND (node, 1) = new_rhs;
TREE_TYPE (node) = lhs_type;
return node;
}
/* Check that type SOURCE can be cast into type DEST. If the cast
can't occur at all, return 0 otherwise 1. This function is used to
produce accurate error messages on the reasons why an assignment
failed. */
static tree
try_reference_assignconv (lhs_type, rhs)
tree lhs_type, rhs;
{
tree new_rhs = NULL_TREE;
tree rhs_type = TREE_TYPE (rhs);
if (!JPRIMITIVE_TYPE_P (rhs_type) && JREFERENCE_TYPE_P (lhs_type))
{
/* `null' may be assigned to any reference type */
if (rhs == null_pointer_node)
new_rhs = null_pointer_node;
/* Try the reference assignment conversion */
else if (valid_ref_assignconv_cast_p (rhs_type, lhs_type, 0))
new_rhs = rhs;
/* This is a magic assignment that we process differently */
else if (rhs == soft_exceptioninfo_call_node)
new_rhs = rhs;
}
return new_rhs;
}
/* Check that RHS can be converted into LHS_TYPE by the assignment
conversion (5.2), for the cases of RHS being a builtin type. Return
NULL_TREE if the conversion fails or if because RHS isn't of a
builtin type. Return a converted RHS if the conversion is possible. */
static tree
try_builtin_assignconv (wfl_op1, lhs_type, rhs)
tree wfl_op1, lhs_type, rhs;
{
tree new_rhs = NULL_TREE;
tree rhs_type = TREE_TYPE (rhs);
/* Zero accepted everywhere */
if (TREE_CODE (rhs) == INTEGER_CST
&& TREE_INT_CST_HIGH (rhs) == 0 && TREE_INT_CST_LOW (rhs) == 0
&& JPRIMITIVE_TYPE_P (rhs_type))
new_rhs = convert (lhs_type, rhs);
/* 5.1.1 Try Identity Conversion,
5.1.2 Try Widening Primitive Conversion */
else if (valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type))
new_rhs = convert (lhs_type, rhs);
/* Try a narrowing primitive conversion (5.1.3):
- expression is a constant expression of type int AND
- variable is byte, short or char AND
- The value of the expression is representable in the type of the
variable */
else if (rhs_type == int_type_node && TREE_CONSTANT (rhs)
&& (lhs_type == byte_type_node || lhs_type == char_type_node
|| lhs_type == short_type_node))
{
if (int_fits_type_p (rhs, lhs_type))
new_rhs = convert (lhs_type, rhs);
else if (wfl_op1) /* Might be called with a NULL */
parse_warning_context
(wfl_op1, "Constant expression `%s' to wide for narrowing "
"primitive conversion to `%s'",
print_int_node (rhs), lang_printable_name (lhs_type, 0));
/* Reported a warning that will turn into an error further
down, so we don't return */
}
return new_rhs;
}
/* Return 1 if RHS_TYPE can be converted to LHS_TYPE by identity
conversion (5.1.1) or widening primitve conversion (5.1.2). Return
0 is the conversion test fails. This implements parts the method
invocation convertion (5.3). */
static int
valid_builtin_assignconv_identity_widening_p (lhs_type, rhs_type)
tree lhs_type, rhs_type;
{
int all_primitive;
if (lhs_type == rhs_type)
return 1;
/* Sometimes, instead of passing a type, we pass integer_zero_node
so we know that an integral type can accomodate it */
if (JINTEGRAL_TYPE_P (lhs_type) && (rhs_type == integer_zero_node))
return 1;
all_primitive =
JPRIMITIVE_TYPE_P (lhs_type) && JPRIMITIVE_TYPE_P (rhs_type);
if (!all_primitive)
return 0;
/* byte, even if it's smaller than a char can't be converted into a
char. Short can't too, but the < test below takes care of that */
if (lhs_type == char_type_node && rhs_type == byte_type_node)
return 0;
/* Accept all promoted type here. Note, we can't use <= in the test
below, because we still need to bounce out assignments of short
to char and the likes */
if (lhs_type == int_type_node
&& (rhs_type == promoted_byte_type_node
|| rhs_type == promoted_short_type_node
|| rhs_type == promoted_char_type_node
|| rhs_type == promoted_boolean_type_node))
return 1;
if (JINTEGRAL_TYPE_P (rhs_type)
&& ((TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type))
|| (JFLOAT_TYPE_P (lhs_type) &&
TYPE_PRECISION (rhs_type) == TYPE_PRECISION (lhs_type))))
return 1;
else if (JFLOAT_TYPE_P (rhs_type)
&& (TYPE_PRECISION (rhs_type) < TYPE_PRECISION (lhs_type)))
return 1;
return 0;
}
/* Check that something of SOURCE type can be assigned or cast to
something of DEST type at runtime. Return 1 if the operation is
valid, 0 otherwise. If CAST is set to 1, we're treating the case
were SOURCE is cast into DEST, which borrows a lot of the
assignment check. */
static int
valid_ref_assignconv_cast_p (source, dest, cast)
tree source;
tree dest;
int cast;
{
if (JNULLP_TYPE_P (source))
return 1;
if (TREE_CODE (source) == POINTER_TYPE)
source = TREE_TYPE (source);
if (TREE_CODE (dest) == POINTER_TYPE)
dest = TREE_TYPE (dest);
/* Case where SOURCE is a class type */
if (TYPE_CLASS_P (source))
{
if (TYPE_CLASS_P (dest))
return source == dest || inherits_from_p (source, dest)
|| (cast && inherits_from_p (dest, source));
if (TYPE_INTERFACE_P (dest))
{
/* If doing a cast and SOURCE is final, the operation is
always correct a compile time (because even if SOURCE
does not implement DEST, a subclass of SOURCE might). */
if (cast && !CLASS_FINAL (TYPE_NAME (source)))
return 1;
/* Otherwise, SOURCE must implement DEST */
return interface_of_p (dest, source);
}
/* DEST is an array, cast permited if SOURCE is of Object type */
return (cast && source == object_type_node ? 1 : 0);
}
if (TYPE_INTERFACE_P (source))
{
if (TYPE_CLASS_P (dest))
{
/* If not casting, DEST must be the Object type */
if (!cast)
return dest == object_type_node;
/* We're doing a cast. The cast is always valid is class
DEST is not final, otherwise, DEST must implement SOURCE */
else if (!CLASS_FINAL (TYPE_NAME (dest)))
return 1;
else
return interface_of_p (source, dest);
}
if (TYPE_INTERFACE_P (dest))
{
/* If doing a cast, then if SOURCE and DEST contain method
with the same signature but different return type, then
this is a (compile time) error */
if (cast)
{
tree method_source, method_dest;
tree source_type;
tree source_sig;
tree source_name;
for (method_source = TYPE_METHODS (source); method_source;
method_source = TREE_CHAIN (method_source))
{
source_sig =
build_java_argument_signature (TREE_TYPE (method_source));
source_type = TREE_TYPE (TREE_TYPE (method_source));
source_name = DECL_NAME (method_source);
for (method_dest = TYPE_METHODS (dest);
method_dest; method_dest = TREE_CHAIN (method_dest))
if (source_sig ==
build_java_argument_signature (TREE_TYPE (method_dest))
&& source_name == DECL_NAME (method_dest)
&& source_type != TREE_TYPE (TREE_TYPE (method_dest)))
return 0;
}
return 1;
}
else
return source == dest || interface_of_p (dest, source);
}
else /* Array */
return 0;
}
if (TYPE_ARRAY_P (source))
{
if (TYPE_CLASS_P (dest))
return dest == object_type_node;
if (TYPE_INTERFACE_P (dest))
return 0; /* Install test on Clonable. FIXME */
else /* Arrays */
{
tree source_element_type = TYPE_ARRAY_ELEMENT (source);
tree dest_element_type = TYPE_ARRAY_ELEMENT (dest);
/* In case of severe errors, they turn out null */
if (!dest_element_type || !source_element_type)
return 0;
if (source_element_type == dest_element_type)
return 1;
return valid_ref_assignconv_cast_p (source_element_type,
dest_element_type, cast);
}
return 0;
}
return 0;
}
static int
valid_cast_to_p (source, dest)
tree source;
tree dest;
{
if (TREE_CODE (source) == POINTER_TYPE)
source = TREE_TYPE (source);
if (TREE_CODE (dest) == POINTER_TYPE)
dest = TREE_TYPE (dest);
if (TREE_CODE (source) == RECORD_TYPE && TREE_CODE (dest) == RECORD_TYPE)
return valid_ref_assignconv_cast_p (source, dest, 1);
else if (JNUMERIC_TYPE_P (source) && JNUMERIC_TYPE_P (dest))
return 1;
return 0;
}
/* Method invocation conversion test. Return 1 if type SOURCE can be
converted to type DEST through the methond invocation conversion
process (5.3) */
static tree
do_unary_numeric_promotion (arg)
tree arg;
{
tree type = TREE_TYPE (arg);
if (TREE_CODE (type) == INTEGER_TYPE ? TYPE_PRECISION (type) < 32
: TREE_CODE (type) == CHAR_TYPE)
arg = convert (int_type_node, arg);
return arg;
}
static int
valid_method_invocation_conversion_p (dest, source)
tree dest, source;
{
return (((JPRIMITIVE_TYPE_P (source) || (source == integer_zero_node))
&& JPRIMITIVE_TYPE_P (dest)
&& valid_builtin_assignconv_identity_widening_p (dest, source))
|| ((JREFERENCE_TYPE_P (source) || JNULLP_TYPE_P (source))
&& (JREFERENCE_TYPE_P (dest) || JNULLP_TYPE_P (dest))
&& valid_ref_assignconv_cast_p (source, dest, 0)));
}
/* Build an incomplete binop expression. */
static tree
build_binop (op, op_location, op1, op2)
enum tree_code op;
int op_location;
tree op1, op2;
{
tree binop = build (op, NULL_TREE, op1, op2);
TREE_SIDE_EFFECTS (binop) = 1;
/* Store the location of the operator, for better error report. The
string of the operator will be rebuild based on the OP value. */
EXPR_WFL_LINECOL (binop) = op_location;
return binop;
}
/* Build the string of the operator retained by NODE. If NODE is part
of a compound expression, add an '=' at the end of the string. This
function is called when an error needs to be reported on an
operator. The string is returned as a pointer to a static character
buffer. */
static char *
operator_string (node)
tree node;
{
#define BUILD_OPERATOR_STRING(S) \
{ \
sprintf (buffer, "%s%s", S, (COMPOUND_ASSIGN_P (node) ? "=" : "")); \
return buffer; \
}
static char buffer [10];
switch (TREE_CODE (node))
{
case MULT_EXPR: BUILD_OPERATOR_STRING ("*");
case RDIV_EXPR: BUILD_OPERATOR_STRING ("/");
case TRUNC_MOD_EXPR: BUILD_OPERATOR_STRING ("%");
case PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
case MINUS_EXPR: BUILD_OPERATOR_STRING ("-");
case LSHIFT_EXPR: BUILD_OPERATOR_STRING ("<<");
case RSHIFT_EXPR: BUILD_OPERATOR_STRING (">>");
case URSHIFT_EXPR: BUILD_OPERATOR_STRING (">>>");
case BIT_AND_EXPR: BUILD_OPERATOR_STRING ("&");
case BIT_XOR_EXPR: BUILD_OPERATOR_STRING ("^");
case BIT_IOR_EXPR: BUILD_OPERATOR_STRING ("|");
case TRUTH_ANDIF_EXPR: BUILD_OPERATOR_STRING ("&&");
case TRUTH_ORIF_EXPR: BUILD_OPERATOR_STRING ("||");
case EQ_EXPR: BUILD_OPERATOR_STRING ("==");
case NE_EXPR: BUILD_OPERATOR_STRING ("!=");
case GT_EXPR: BUILD_OPERATOR_STRING (">");
case GE_EXPR: BUILD_OPERATOR_STRING (">=");
case LT_EXPR: BUILD_OPERATOR_STRING ("<");
case LE_EXPR: BUILD_OPERATOR_STRING ("<=");
case UNARY_PLUS_EXPR: BUILD_OPERATOR_STRING ("+");
case NEGATE_EXPR: BUILD_OPERATOR_STRING ("-");
case TRUTH_NOT_EXPR: BUILD_OPERATOR_STRING ("!");
case BIT_NOT_EXPR: BUILD_OPERATOR_STRING ("~");
case PREINCREMENT_EXPR: /* Fall through */
case POSTINCREMENT_EXPR: BUILD_OPERATOR_STRING ("++");
case PREDECREMENT_EXPR: /* Fall through */
case POSTDECREMENT_EXPR: BUILD_OPERATOR_STRING ("--");
default:
fatal ("unregistered operator %s - operator_string",
tree_code_name [TREE_CODE (node)]);
}
return NULL;
#undef BUILD_OPERATOR_STRING
}
/* Binary operators (15.16 up to 15.18). We return error_mark_node on
errors but we modify NODE so that it contains the type computed
according to the expression, when it's fixed. Otherwise, we write
error_mark_node as the type. It allows us to further the analysis
of remaining nodes and detects more errors in certain cases. */
static tree
patch_binop (node, wfl_op1, wfl_op2)
tree node;
tree wfl_op1;
tree wfl_op2;
{
tree op1 = TREE_OPERAND (node, 0);
tree op2 = TREE_OPERAND (node, 1);
tree op1_type = TREE_TYPE (op1);
tree op2_type = TREE_TYPE (op2);
tree prom_type;
int code = TREE_CODE (node);
/* If 1, tell the routine that we have to return error_mark_node
after checking for the initialization of the RHS */
int error_found = 0;
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
switch (code)
{
/* 15.16 Multiplicative operators */
case MULT_EXPR: /* 15.16.1 Multiplication Operator * */
case RDIV_EXPR: /* 15.16.2 Division Operator / */
case TRUNC_MOD_EXPR: /* 15.16.3 Remainder operator % */
if (!JPRIMITIVE_TYPE_P (op1_type) || !JPRIMITIVE_TYPE_P (op2_type))
{
if (!JPRIMITIVE_TYPE_P (op1_type))
ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
if (!JPRIMITIVE_TYPE_P (op2_type) && (op1_type != op2_type))
ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
TREE_TYPE (node) = error_mark_node;
error_found = 1;
break;
}
prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
/* Change the division operator if necessary */
if (code == RDIV_EXPR && TREE_CODE (prom_type) == INTEGER_TYPE)
TREE_SET_CODE (node, TRUNC_DIV_EXPR);
/* This one is more complicated. FLOATs are processed by a function
call to soft_fmod. */
if (code == TRUNC_MOD_EXPR)
return build_java_binop (TRUNC_MOD_EXPR, prom_type, op1, op2);
break;
/* 15.17 Additive Operators */
case PLUS_EXPR: /* 15.17.1 String Concatenation Operator + */
/* Operation is valid if either one argument is a string
constant, a String object or a StringBuffer crafted for the
purpose of the a previous usage of the String concatenation
operator */
if (TREE_CODE (op1) == STRING_CST
|| TREE_CODE (op2) == STRING_CST
|| JSTRING_TYPE_P (op1_type)
|| JSTRING_TYPE_P (op2_type)
|| IS_CRAFTED_STRING_BUFFER_P (op1)
|| IS_CRAFTED_STRING_BUFFER_P (op2))
return build_string_concatenation (op1, op2);
case MINUS_EXPR: /* 15.17.2 Additive Operators (+ and -) for
Numeric Types */
if (!JPRIMITIVE_TYPE_P (op1_type) || !JPRIMITIVE_TYPE_P (op2_type))
{
if (!JPRIMITIVE_TYPE_P (op1_type))
ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
if (!JPRIMITIVE_TYPE_P (op2_type) && (op1_type != op2_type))
ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
TREE_TYPE (node) = error_mark_node;
error_found = 1;
break;
}
prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
break;
/* 15.18 Shift Operators */
case LSHIFT_EXPR:
case RSHIFT_EXPR:
case URSHIFT_EXPR:
if (!JINTEGRAL_TYPE_P (op1_type) || !JINTEGRAL_TYPE_P (op2_type))
{
if (!JINTEGRAL_TYPE_P (op1_type))
ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
else
parse_error_context
(wfl_operator, (JPRIMITIVE_TYPE_P (op2_type) ?
"Incompatible type for `%s'. Explicit cast needed to convert "
"shift distance from `%s' to integral" :
"Incompatible type for `%s'. Can't convert shift distance from "
"`%s' to integral"),
operator_string (node), lang_printable_name (op2_type, 0));
TREE_TYPE (node) = error_mark_node;
error_found = 1;
break;
}
/* Unary numeric promotion (5.6.1) is performed on each operand
separatly */
op1 = do_unary_numeric_promotion (op1);
op2 = do_unary_numeric_promotion (op2);
/* The type of the shift expression is the type of the promoted
type of the left-hand operand */
prom_type = TREE_TYPE (op1);
/* Shift int only up to 0x1f and long up to 0x3f */
if (prom_type == int_type_node)
op2 = fold (build (BIT_AND_EXPR, int_type_node, op2,
build_int_2 (0x1f, 0)));
else
op2 = fold (build (BIT_AND_EXPR, int_type_node, op2,
build_int_2 (0x3f, 0)));
/* The >>> operator is a >> operating on unsigned quantities */
if (code == URSHIFT_EXPR && ! flag_emit_class_files)
{
op1 = convert (unsigned_type (prom_type), op1);
TREE_SET_CODE (node, RSHIFT_EXPR);
}
break;
/* 15.19.1 Type Comparison Operator instaceof */
case INSTANCEOF_EXPR:
TREE_TYPE (node) = boolean_type_node;
if (!(op2_type = resolve_type_during_patch (op2)))
return error_mark_node;
/* The first operand must be a reference type or the null type */
if (!JREFERENCE_TYPE_P (op1_type) && op1 != null_pointer_node)
error_found = 1; /* Error reported further below */
/* The second operand must be a reference type */
if (!JREFERENCE_TYPE_P (op2_type))
{
SET_WFL_OPERATOR (wfl_operator, node, wfl_op2);
parse_error_context
(wfl_operator, "Invalid argument `%s' for `instanceof'",
lang_printable_name (op2_type, 0));
error_found = 1;
}
if (!error_found && valid_ref_assignconv_cast_p (op1_type, op2_type, 1))
{
/* If the first operand is null, the result is always false */
if (op1 == null_pointer_node)
return boolean_false_node;
else if (flag_emit_class_files)
{
TREE_OPERAND (node, 1) = op2_type;
return node;
}
/* Otherwise we have to invoke instance of to figure it out */
else
{
tree call =
build (CALL_EXPR, boolean_type_node,
build_address_of (soft_instanceof_node),
tree_cons
(NULL_TREE, op1,
build_tree_list (NULL_TREE,
build_class_ref (op2_type))),
NULL_TREE);
TREE_SIDE_EFFECTS (call) = 1;
return call;
}
}
/* There is no way the expression operand can be an instance of
the type operand. This is a compile time error. */
else
{
char *t1 = strdup (lang_printable_name (op1_type, 0));
SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
parse_error_context
(wfl_operator, "Impossible for `%s' to be instance of `%s'",
t1, lang_printable_name (op2_type, 0));
free (t1);
error_found = 1;
}
break;
/* 15.21 Bitwise and Logical Operators */
case BIT_AND_EXPR:
case BIT_XOR_EXPR:
case BIT_IOR_EXPR:
if (JINTEGRAL_TYPE_P (op1_type) && JINTEGRAL_TYPE_P (op2_type))
/* Binary numeric promotion is performed on both operand and the
expression retain that type */
prom_type = binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
else if (TREE_CODE (op1_type) == BOOLEAN_TYPE
&& TREE_CODE (op1_type) == BOOLEAN_TYPE)
/* The type of the bitwise operator expression is BOOLEAN */
prom_type = boolean_type_node;
else
{
if (!JINTEGRAL_TYPE_P (op1_type))
ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op1_type);
if (!JINTEGRAL_TYPE_P (op2_type) && (op1_type != op2_type))
ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op2_type);
TREE_TYPE (node) = error_mark_node;
error_found = 1;
/* Insert a break here if adding thing before the switch's
break for this case */
}
break;
/* 15.22 Conditional-And Operator */
case TRUTH_ANDIF_EXPR:
/* 15.23 Conditional-Or Operator */
case TRUTH_ORIF_EXPR:
/* Operands must be of BOOLEAN type */
if (TREE_CODE (op1_type) != BOOLEAN_TYPE ||
TREE_CODE (op2_type) != BOOLEAN_TYPE)
{
if (TREE_CODE (op1_type) != BOOLEAN_TYPE)
ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op1_type);
if (TREE_CODE (op2_type) != BOOLEAN_TYPE && (op1_type != op2_type))
ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op2_type);
TREE_TYPE (node) = boolean_type_node;
error_found = 1;
break;
}
/* The type of the conditional operators is BOOLEAN */
prom_type = boolean_type_node;
break;
/* 15.19.1 Numerical Comparison Operators <, <=, >, >= */
case LT_EXPR:
case GT_EXPR:
case LE_EXPR:
case GE_EXPR:
/* The type of each of the operands must be a primitive numeric
type */
if (!JNUMERIC_TYPE_P (op1_type) || ! JNUMERIC_TYPE_P (op2_type))
{
if (!JNUMERIC_TYPE_P (op1_type))
ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op1_type);
if (!JNUMERIC_TYPE_P (op2_type) && (op1_type != op2_type))
ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op2_type);
TREE_TYPE (node) = boolean_type_node;
error_found = 1;
break;
}
/* Binary numeric promotion is performed on the operands */
binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
/* The type of the relation expression is always BOOLEAN */
prom_type = boolean_type_node;
break;
/* 15.20 Equality Operator */
case EQ_EXPR:
case NE_EXPR:
/* 15.20.1 Numerical Equality Operators == and != */
/* Binary numeric promotion is performed on the operands */
if (JNUMERIC_TYPE_P (op1_type) && JNUMERIC_TYPE_P (op2_type))
binary_numeric_promotion (op1_type, op2_type, &op1, &op2);
/* 15.20.2 Boolean Equality Operators == and != */
else if (TREE_CODE (op1_type) == BOOLEAN_TYPE &&
TREE_CODE (op2_type) == BOOLEAN_TYPE)
; /* Nothing to do here */
/* 15.20.3 Reference Equality Operators == and != */
/* Types have to be either references or the null type. If
they're references, it must be possible to convert either
type to the other by casting conversion. */
else if (op1 == null_pointer_node || op2 == null_pointer_node
|| (JREFERENCE_TYPE_P (op1_type) && JREFERENCE_TYPE_P (op2_type)
&& (valid_ref_assignconv_cast_p (op1_type, op2_type, 1)
|| valid_ref_assignconv_cast_p (op2_type,
op1_type, 1))))
; /* Nothing to do here */
/* Else we have an error figure what can't be converted into
what and report the error */
else
{
char *t1;
t1 = strdup (lang_printable_name (op1_type, 0));
parse_error_context
(wfl_operator, "Incompatible type for `%s'. Can't convert `%s' "
"to `%s'", operator_string (node), t1,
lang_printable_name (op2_type, 0));
free (t1);
TREE_TYPE (node) = boolean_type_node;
error_found = 1;
break;
}
prom_type = boolean_type_node;
break;
}
if (error_found)
return error_mark_node;
TREE_OPERAND (node, 0) = op1;
TREE_OPERAND (node, 1) = op2;
TREE_TYPE (node) = prom_type;
return fold (node);
}
/* Concatenate the STRING_CST CSTE and STRING. When AFTER is a non
zero value, the value of CSTE comes after the valude of STRING */
static tree
do_merge_string_cste (cste, string, string_len, after)
tree cste;
char *string;
int string_len, after;
{
int len = TREE_STRING_LENGTH (cste) + string_len;
char *old = TREE_STRING_POINTER (cste);
TREE_STRING_LENGTH (cste) = len;
TREE_STRING_POINTER (cste) = obstack_alloc (expression_obstack, len+1);
if (after)
{
strcpy (TREE_STRING_POINTER (cste), string);
strcat (TREE_STRING_POINTER (cste), old);
}
else
{
strcpy (TREE_STRING_POINTER (cste), old);
strcat (TREE_STRING_POINTER (cste), string);
}
return cste;
}
/* Tries to merge OP1 (a STRING_CST) and OP2 (if suitable). Return a
new STRING_CST on success, NULL_TREE on failure */
static tree
merge_string_cste (op1, op2, after)
tree op1, op2;
int after;
{
/* Handle two string constants right away */
if (TREE_CODE (op2) == STRING_CST)
return do_merge_string_cste (op1, TREE_STRING_POINTER (op2),
TREE_STRING_LENGTH (op2), after);
/* Reasonable integer constant can be treated right away */
if (TREE_CODE (op2) == INTEGER_CST && !TREE_CONSTANT_OVERFLOW (op2))
{
static char *boolean_true = "true";
static char *boolean_false = "false";
static char *null_pointer = "null";
char ch[3];
char *string;
if (op2 == boolean_true_node)
string = boolean_true;
else if (op2 == boolean_false_node)
string = boolean_false;
else if (op2 == null_pointer_node)
string = null_pointer;
else if (TREE_TYPE (op2) == char_type_node)
{
ch[0] = (char )TREE_INT_CST_LOW (op2);
ch[1] = '\0';
string = ch;
}
else
string = print_int_node (op2);
return do_merge_string_cste (op1, string, strlen (string), after);
}
return NULL_TREE;
}
/* Tries to statically concatenate OP1 and OP2 if possible. Either one
has to be a STRING_CST and the other part must be a STRING_CST or a
INTEGRAL constant. Return a new STRING_CST if the operation
succeed, NULL_TREE otherwise.
If the case we want to optimize for space, we might want to return
NULL_TREE for each invocation of this routine. FIXME */
static tree
string_constant_concatenation (op1, op2)
tree op1, op2;
{
if (TREE_CODE (op1) == STRING_CST || (TREE_CODE (op2) == STRING_CST))
{
tree string, rest;
int invert;
string = (TREE_CODE (op1) == STRING_CST ? op1 : op2);
rest = (string == op1 ? op2 : op1);
invert = (string == op1 ? 0 : 1 );
/* Walk REST, only if it looks reasonable */
if (TREE_CODE (rest) != STRING_CST
&& !IS_CRAFTED_STRING_BUFFER_P (rest)
&& !JSTRING_TYPE_P (TREE_TYPE (rest))
&& TREE_CODE (rest) == EXPR_WITH_FILE_LOCATION)
{
rest = java_complete_tree (rest);
if (rest == error_mark_node)
return error_mark_node;
rest = fold (rest);
}
return merge_string_cste (string, rest, invert);
}
return NULL_TREE;
}
/* Implement the `+' operator. Does static optimization if possible,
otherwise create (if necessary) and append elements to a
StringBuffer. The StringBuffer will be carried around until it is
used for a function call or an assignment. Then toString() will be
called on it to turn it into a String object. */
static tree
build_string_concatenation (op1, op2)
tree op1, op2;
{
tree result;
/* Try to do some static optimization */
if ((result = string_constant_concatenation (op1, op2)))
return result;
/* If operands are string constant, turn then into object references */
if (TREE_CODE (op1) == STRING_CST)
op1 = patch_string_cst (op1);
if (TREE_CODE (op2) == STRING_CST)
op2 = patch_string_cst (op2);
/* If OP1 isn't already a StringBuffer, create and
initialize a new one */
if (!IS_CRAFTED_STRING_BUFFER_P (op1))
{
/* Two solutions here:
1) OP1 is a string reference, we call new StringBuffer(OP1)
2) Op2 is something else, we call new StringBuffer().append(OP1). */
if (JSTRING_TYPE_P (TREE_TYPE (op1)))
op1 = BUILD_STRING_BUFFER (op1);
else
{
tree aNew = BUILD_STRING_BUFFER (NULL_TREE);
op1 = make_qualified_primary (aNew, BUILD_APPEND (op1), 0);
}
}
/* No longer the last node holding a crafted StringBuffer */
IS_CRAFTED_STRING_BUFFER_P (op1) = 0;
/* Create a node for `{new...,xxx}.append (op2)' */
op1 = make_qualified_primary (op1, BUILD_APPEND (op2), 0);
/* Mark the last node holding a crafted StringBuffer */
IS_CRAFTED_STRING_BUFFER_P (op1) = 1;
return op1;
}
/* Patch the string node NODE. NODE can be a STRING_CST of a crafted
StringBuffer. If no string were found to be patched, return
NULL. */
static tree
patch_string (node)
tree node;
{
if (TREE_CODE (node) == STRING_CST)
return patch_string_cst (node);
else if (IS_CRAFTED_STRING_BUFFER_P (node))
{
int saved = ctxp->explicit_constructor_p;
tree invoke = build_method_invocation (wfl_to_string, NULL_TREE);
tree ret;
/* Temporary disable forbid the use of `this'. */
ctxp->explicit_constructor_p = 0;
ret = java_complete_tree (make_qualified_primary (node, invoke, 0));
/* Restore it at its previous value */
ctxp->explicit_constructor_p = saved;
return ret;
}
return NULL_TREE;
}
/* Build the internal representation of a string constant. */
static tree
patch_string_cst (node)
tree node;
{
int location;
if (! flag_emit_class_files)
{
push_obstacks (&permanent_obstack, &permanent_obstack);
node = get_identifier (TREE_STRING_POINTER (node));
location = alloc_name_constant (CONSTANT_String, node);
node = build_ref_from_constant_pool (location);
}
TREE_TYPE (node) = promote_type (string_type_node);
TREE_CONSTANT (node) = 1;
return node;
}
/* Build an incomplete unary operator expression. */
static tree
build_unaryop (op_token, op_location, op1)
int op_token, op_location;
tree op1;
{
enum tree_code op;
tree unaryop;
switch (op_token)
{
case PLUS_TK: op = UNARY_PLUS_EXPR; break;
case MINUS_TK: op = NEGATE_EXPR; break;
case NEG_TK: op = TRUTH_NOT_EXPR; break;
case NOT_TK: op = BIT_NOT_EXPR; break;
default: fatal ("Unknown token `%d' for unary operator - build_unaryop",
op_token);
}
unaryop = build1 (op, NULL_TREE, op1);
TREE_SIDE_EFFECTS (unaryop) = 1;
/* Store the location of the operator, for better error report. The
string of the operator will be rebuild based on the OP value. */
EXPR_WFL_LINECOL (unaryop) = op_location;
return unaryop;
}
/* Special case for the ++/-- operators, since they require an extra
argument to build, which is set to NULL and patched
later. IS_POST_P is 1 if the operator, 0 otherwise. */
static tree
build_incdec (op_token, op_location, op1, is_post_p)
int op_token, op_location;
tree op1;
int is_post_p;
{
static enum tree_code lookup [2][2] =
{
{ PREDECREMENT_EXPR, PREINCREMENT_EXPR, },
{ POSTDECREMENT_EXPR, POSTINCREMENT_EXPR, },
};
tree node = build (lookup [is_post_p][(op_token - DECR_TK)],
NULL_TREE, op1, NULL_TREE);
TREE_SIDE_EFFECTS (node) = 1;
/* Store the location of the operator, for better error report. The
string of the operator will be rebuild based on the OP value. */
EXPR_WFL_LINECOL (node) = op_location;
return node;
}
/* Build an incomplete cast operator, based on the use of the
CONVERT_EXPR. Note that TREE_TYPE of the constructed node is
set. java_complete_tree is trained to walk a CONVERT_EXPR even
though its type is already set. */
static tree
build_cast (location, type, exp)
int location;
tree type, exp;
{
tree node = build1 (CONVERT_EXPR, type, exp);
EXPR_WFL_LINECOL (node) = location;
return node;
}
/* 15.14 Unary operators. We return error_mark_node in case of error,
but preserve the type of NODE if the type is fixed. */
static tree
patch_unaryop (node, wfl_op)
tree node;
tree wfl_op;
{
tree op = TREE_OPERAND (node, 0);
tree op_type = TREE_TYPE (op);
tree prom_type, value;
int code = TREE_CODE (node);
int error_found = 0;
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
switch (code)
{
/* 15.13.2 Postfix Increment Operator ++ */
case POSTINCREMENT_EXPR:
/* 15.13.3 Postfix Increment Operator -- */
case POSTDECREMENT_EXPR:
/* 15.14.1 Prefix Increment Operator ++ */
case PREINCREMENT_EXPR:
/* 15.14.2 Prefix Decrement Operator -- */
case PREDECREMENT_EXPR:
if (!DECL_P (op) && !((TREE_CODE (op) == INDIRECT_REF
|| TREE_CODE (op) == COMPONENT_REF)
&& JPRIMITIVE_TYPE_P (TREE_TYPE (op))))
{
tree lvalue;
/* Before screaming, check that we're not in fact trying to
increment a optimized static final access, in which case
we issue an different error message. */
if (!(TREE_CODE (wfl_op) == EXPR_WITH_FILE_LOCATION
&& resolve_expression_name (wfl_op, &lvalue)
&& check_final_assignment (lvalue, wfl_op)))
parse_error_context (wfl_operator, "Invalid argument to `%s'",
operator_string (node));
TREE_TYPE (node) = error_mark_node;
error_found = 1;
}
else if (check_final_assignment (op, wfl_op))
error_found = 1;
/* From now on, we know that op if a variable and that it has a
valid wfl. We use wfl_op to locate errors related to the
++/-- operand. */
else if (!JNUMERIC_TYPE_P (op_type))
{
parse_error_context
(wfl_op, "Invalid argument type `%s' to `%s'",
lang_printable_name (op_type, 0), operator_string (node));
TREE_TYPE (node) = error_mark_node;
error_found = 1;
}
else
{
/* Before the addition, binary numeric promotion if performed on
both operands */
value = integer_one_node;
prom_type = binary_numeric_promotion (op_type, TREE_TYPE (value),
&op, &value);
/* And write the promoted increment back */
TREE_OPERAND (node, 1) = value;
}
break;
/* 15.14.3 Unary Plus Operator + */
case UNARY_PLUS_EXPR:
/* 15.14.4 Unary Minus Operator - */
case NEGATE_EXPR:
if (!JNUMERIC_TYPE_P (op_type))
{
ERROR_CANT_CONVERT_TO_NUMERIC (wfl_operator, node, op_type);
TREE_TYPE (node) = error_mark_node;
error_found = 1;
}
/* Unary numeric promotion is performed on operand */
else
{
op = do_unary_numeric_promotion (op);
prom_type = TREE_TYPE (op);
if (code == UNARY_PLUS_EXPR)
node = op;
}
break;
/* 15.14.5 Bitwise Complement Operator ~ */
case BIT_NOT_EXPR:
if (!JINTEGRAL_TYPE_P (op_type))
{
ERROR_CAST_NEEDED_TO_INTEGRAL (wfl_operator, node, op_type);
TREE_TYPE (node) = error_mark_node;
error_found = 1;
}
else
{
op = do_unary_numeric_promotion (op);
prom_type = TREE_TYPE (op);
}
break;
/* 15.14.6 Logical Complement Operator ! */
case TRUTH_NOT_EXPR:
if (TREE_CODE (op_type) != BOOLEAN_TYPE)
{
ERROR_CANT_CONVERT_TO_BOOLEAN (wfl_operator, node, op_type);
/* But the type is known. We will report an error if further
attempt of a assignment is made with this rhs */
TREE_TYPE (node) = boolean_type_node;
error_found = 1;
}
else
prom_type = boolean_type_node;
break;
/* 15.15 Cast Expression */
case CONVERT_EXPR:
value = patch_cast (node, wfl_operator);
if (value == error_mark_node)
{
/* If this cast is part of an assignment, we tell the code
that deals with it not to complain about a mismatch,
because things have been cast, anyways */
TREE_TYPE (node) = error_mark_node;
error_found = 1;
}
else
node = value;
break;
}
if (error_found)
return error_mark_node;
/* In the case of UNARY_PLUS_EXPR, we replaced NODE by a new one */
else if (code != UNARY_PLUS_EXPR && code != CONVERT_EXPR)
{
TREE_OPERAND (node, 0) = op;
TREE_TYPE (node) = prom_type;
}
return fold (node);
}
/* Generic type resolution that sometimes takes place during node
patching. Returned the resolved type or generate an error
message. Return the resolved type or NULL_TREE. */
static tree
resolve_type_during_patch (type)
tree type;
{
if (unresolved_type_p (type, NULL))
{
tree type_decl = resolve_no_layout (EXPR_WFL_NODE (type), NULL_TREE);
if (!type_decl)
{
parse_error_context (type,
"Class `%s' not found in type declaration",
IDENTIFIER_POINTER (EXPR_WFL_NODE (type)));
return NULL_TREE;
}
else
{
CLASS_LOADED_P (TREE_TYPE (type_decl)) = 1;
return TREE_TYPE (type_decl);
}
}
return type;
}
/* 5.5 Casting Conversion. error_mark_node is returned if an error is
found. Otherwise NODE or something meant to replace it is returned. */
static tree
patch_cast (node, wfl_operator)
tree node;
tree wfl_operator;
{
tree op = TREE_OPERAND (node, 0);
tree op_type = TREE_TYPE (op);
tree cast_type = TREE_TYPE (node);
char *t1;
/* First resolve OP_TYPE if unresolved */
if (!(cast_type = resolve_type_during_patch (cast_type)))
return error_mark_node;
/* Check on cast that are proven correct at compile time */
if (JNUMERIC_TYPE_P (cast_type) && JNUMERIC_TYPE_P (op_type))
{
static tree convert_narrow ();
/* Same type */
if (cast_type == op_type)
return node;
/* Try widening/narowwing convertion. Potentially, things need
to be worked out in gcc so we implement the extreme cases
correctly. fold_convert() needs to be fixed. */
return convert (cast_type, op);
}
/* null can be casted to references */
if (op == null_pointer_node && JREFERENCE_TYPE_P (cast_type))
return build_null_of_type (cast_type);
/* The remaining legal casts involve conversion between reference
types. Check for their compile time correctness. */
if (JREFERENCE_TYPE_P (op_type) && JREFERENCE_TYPE_P (cast_type)
&& valid_ref_assignconv_cast_p (cast_type, op_type, 1))
{
TREE_TYPE (node) = promote_type (cast_type);
/* Now, the case can be determined correct at compile time if
OP_TYPE can be converted into CAST_TYPE by assignment
conversion (5.2) */
if (valid_ref_assignconv_cast_p (op_type, cast_type, 0))
{
TREE_SET_CODE (node, NOP_EXPR);
return node;
}
if (flag_emit_class_files)
{
TREE_SET_CODE (node, CONVERT_EXPR);
return node;
}
/* The cast requires a run-time check */
return build (CALL_EXPR, promote_type (cast_type),
build_address_of (soft_checkcast_node),
tree_cons (NULL_TREE, build_class_ref (cast_type),
build_tree_list (NULL_TREE, op)),
NULL_TREE);
}
/* Any other casts are proven incorrect at compile time */
t1 = strdup (lang_printable_name (op_type, 0));
parse_error_context (wfl_operator, "Invalid cast from `%s' to `%s'",
t1, lang_printable_name (cast_type, 0));
free (t1);
return error_mark_node;
}
/* Build a null constant and give it the type TYPE. */
static tree
build_null_of_type (type)
tree type;
{
tree node = build_int_2 (0, 0);
TREE_TYPE (node) = promote_type (type);
return node;
}
/* Build an ARRAY_REF incomplete tree node. Note that operand 1 isn't
a list of indices. */
static tree
build_array_ref (location, array, index)
int location;
tree array, index;
{
tree node = build (ARRAY_REF, NULL_TREE, array, index);
EXPR_WFL_LINECOL (node) = location;
return node;
}
/* 15.12 Array Access Expression */
static tree
patch_array_ref (node)
tree node;
{
tree array = TREE_OPERAND (node, 0);
tree array_type = TREE_TYPE (array);
tree index = TREE_OPERAND (node, 1);
tree index_type = TREE_TYPE (index);
int error_found = 0;
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
if (TREE_CODE (array_type) == POINTER_TYPE)
array_type = TREE_TYPE (array_type);
/* The array reference must be an array */
if (!TYPE_ARRAY_P (array_type))
{
parse_error_context
(wfl_operator, "`[]' can only be applied to arrays. It can't be "
"applied to `%s'", lang_printable_name (array_type, 0));
TREE_TYPE (node) = error_mark_node;
error_found = 1;
}
/* The array index underdoes unary numeric promotion. The promoted
type must be int */
index = do_unary_numeric_promotion (index);
if (TREE_TYPE (index) != int_type_node)
{
int could_cast = valid_cast_to_p (index_type, int_type_node);
parse_error_context
(wfl_operator,
(could_cast ? "Incompatible type for `[]'. Explicit cast needed to "
"convert `%s' to `int'" : "Incompatible type for `[]'. "
"Can't convert `%s' to `int'"),
lang_printable_name (index_type, 0));
TREE_TYPE (node) = error_mark_node;
error_found = 1;
}
if (error_found)
return error_mark_node;
array_type = TYPE_ARRAY_ELEMENT (array_type);
if (flag_emit_class_files)
{
TREE_OPERAND (node, 0) = array;
TREE_OPERAND (node, 1) = index;
}
else
node = build_java_arrayaccess (array, array_type, index);
TREE_TYPE (node) = array_type;
return node;
}
/* 15.9 Array Creation Expressions */
static tree
build_newarray_node (type, dims, extra_dims)
tree type;
tree dims;
int extra_dims;
{
tree node =
build (NEW_ARRAY_EXPR, NULL_TREE, type, nreverse (dims),
build_int_2 (extra_dims, 0));
return node;
}
static tree
patch_newarray (node)
tree node;
{
tree type = TREE_OPERAND (node, 0);
tree dims = TREE_OPERAND (node, 1);
tree cdim, array_type;
int error_found = 0;
int ndims = 0;
int xdims = TREE_INT_CST_LOW (TREE_OPERAND (node, 2));
/* Dimension types are verified. It's better for the types to be
verified in order. */
for (cdim = dims, ndims = 0; cdim; cdim = TREE_CHAIN (cdim), ndims++ )
{
int dim_error = 0;
tree dim = TREE_VALUE (cdim);
/* Dim might have been saved during its evaluation */
dim = (TREE_CODE (dim) == SAVE_EXPR ? dim = TREE_OPERAND (dim, 0) : dim);
/* The type of each specified dimension must be an integral type. */
if (!JINTEGRAL_TYPE_P (TREE_TYPE (dim)))
dim_error = 1;
/* Each expression undergoes an unary numeric promotion (5.6.1) and the
promoted type must be int. */
else
{
dim = do_unary_numeric_promotion (dim);
if (TREE_TYPE (dim) != int_type_node)
dim_error = 1;
}
/* Report errors on types here */
if (dim_error)
{
parse_error_context
(TREE_PURPOSE (cdim),
"Incompatible type for dimension in array creation expression. "
"%s convert `%s' to `int'",
(valid_cast_to_p (TREE_TYPE (dim), int_type_node) ?
"Explicit cast needed to" : "Can't"),
lang_printable_name (TREE_TYPE (dim), 0));
error_found = 1;
}
TREE_PURPOSE (cdim) = NULL_TREE;
}
/* Resolve array base type if unresolved */
if (!(type = resolve_type_during_patch (type)))
error_found = 1;
if (error_found)
{
/* We don't want further evaluation of this bogus array creation
operation */
TREE_TYPE (node) = error_mark_node;
return error_mark_node;
}
/* Set array_type to the actual (promoted) array type of the result. */
if (TREE_CODE (type) == RECORD_TYPE)
type = build_pointer_type (type);
while (--xdims >= 0)
{
type = promote_type (build_java_array_type (type, -1));
}
dims = nreverse (dims);
array_type = type;
for (cdim = dims; cdim; cdim = TREE_CHAIN (cdim))
{
type = array_type;
array_type = build_java_array_type (type,
TREE_CODE (cdim) == INTEGER_CST ?
TREE_INT_CST_LOW (cdim) : -1);
array_type = promote_type (array_type);
}
dims = nreverse (dims);
/* The node is transformed into a function call. Things are done
differently according to the number of dimensions. If the number
of dimension is equal to 1, then the nature of the base type
(primitive or not) matters. */
if (ndims == 1)
{
if (JPRIMITIVE_TYPE_P (type))
{
int type_code;
if (type == boolean_type_node)
type_code = 4;
else if (type == char_type_node)
type_code = 5;
else if (type == float_type_node)
type_code = 6;
else if (type == double_type_node)
type_code = 7;
else if (type == byte_type_node)
type_code = 8;
else if (type == short_type_node)
type_code = 9;
else if (type == int_type_node)
type_code = 10;
else if (type == long_type_node)
type_code = 11;
else
fatal ("Can't compute type code - patch_newarray");
return build_newarray (type_code, TREE_VALUE (dims));
}
else
return build_anewarray (TREE_TYPE (type), TREE_VALUE (dims));
}
/* Can't reuse what's already written in expr.c because it uses the
JVM stack representation. Provide a build_multianewarray. FIXME */
return build (CALL_EXPR, array_type,
build_address_of (soft_multianewarray_node),
tree_cons (NULL_TREE, build_class_ref (TREE_TYPE (array_type)),
tree_cons (NULL_TREE,
build_int_2 (ndims, 0), dims )),
NULL_TREE);
}
static tree
build_this (location)
int location;
{
tree node = build_wfl_node (this_identifier_node, input_filename, 0, 0);
TREE_SET_CODE (node, THIS_EXPR);
EXPR_WFL_LINECOL (node) = location;
return node;
}
/* 14.15 The return statement. It builds a modify expression that
assigns the returned value to the RESULT_DECL that hold the value
to be returned. */
static tree
build_return (location, op)
int location;
tree op;
{
tree node = build1 (RETURN_EXPR, NULL_TREE, op);
EXPR_WFL_LINECOL (node) = location;
node = build_debugable_stmt (location, node);
return node;
}
static tree
patch_return (node)
tree node;
{
tree return_exp = TREE_OPERAND (node, 0);
tree meth = current_function_decl;
tree mtype = TREE_TYPE (TREE_TYPE (current_function_decl));
int error_found = 0;
TREE_TYPE (node) = error_mark_node;
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
/* It's invalid to have a return value within a function that is
declared with the keyword void or that is a constructor */
if (return_exp && (mtype == void_type_node || DECL_CONSTRUCTOR_P (meth)))
error_found = 1;
/* It's invalid to have a no return value within a function that
isn't declared with the keyword `void' */
if (!return_exp && (mtype != void_type_node && !DECL_CONSTRUCTOR_P (meth)))
error_found = 2;
if (error_found)
{
if (!DECL_CONSTRUCTOR_P (meth))
{
char *t = strdup (lang_printable_name (mtype, 0));
parse_error_context (wfl_operator,
"`return' with%s value from `%s %s'",
(error_found == 1 ? "" : "out"),
t, lang_printable_name (meth, 0));
free (t);
}
else
parse_error_context (wfl_operator,
"`return' with value from constructor `%s'",
lang_printable_name (meth, 0));
return error_mark_node;
}
/* If we have a return_exp, build a modify expression and expand
it. Note: at that point, the assignment is declared valid, but we
may want to carry some more hacks */
if (return_exp)
{
tree exp = java_complete_tree (return_exp);
tree modify, patched;
/* If the function returned value and EXP are booleans, EXP has
to be converted into the type of DECL_RESULT, which is integer
(see complete_start_java_method) */
if (TREE_TYPE (exp) == boolean_type_node &&
TREE_TYPE (TREE_TYPE (meth)) == boolean_type_node)
exp = convert_to_integer (TREE_TYPE (DECL_RESULT (meth)), exp);
/* `null' can be assigned to a function returning a reference */
if (JREFERENCE_TYPE_P (TREE_TYPE (TREE_TYPE (meth))) &&
exp == null_pointer_node)
exp = build_null_of_type (TREE_TYPE (TREE_TYPE (meth)));
if ((patched = patch_string (exp)))
exp = patched;
modify = build (MODIFY_EXPR, NULL_TREE, DECL_RESULT (meth), exp);
EXPR_WFL_LINECOL (modify) = EXPR_WFL_LINECOL (node);
modify = java_complete_tree (modify);
if (modify != error_mark_node)
{
TREE_SIDE_EFFECTS (modify) = 1;
TREE_OPERAND (node, 0) = modify;
}
else
return error_mark_node;
}
TREE_TYPE (node) = void_type_node;
TREE_SIDE_EFFECTS (node) = 1;
return node;
}
/* 14.8 The if Statement */
static tree
build_if_else_statement (location, expression, if_body, else_body)
int location;
tree expression, if_body, else_body;
{
tree node;
if (!else_body)
else_body = empty_stmt_node;
node = build (COND_EXPR, NULL_TREE, expression, if_body, else_body);
EXPR_WFL_LINECOL (node) = location;
node = build_debugable_stmt (location, node);
return node;
}
static tree
patch_if_else_statement (node)
tree node;
{
tree expression = TREE_OPERAND (node, 0);
TREE_TYPE (node) = error_mark_node;
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
/* The type of expression must be boolean */
if (TREE_TYPE (expression) != boolean_type_node
&& TREE_TYPE (expression) != promoted_boolean_type_node)
{
parse_error_context
(wfl_operator,
"Incompatible type for `if'. Can't convert `%s' to `boolean'",
lang_printable_name (TREE_TYPE (expression), 0));
return error_mark_node;
}
TREE_TYPE (node) = void_type_node;
TREE_SIDE_EFFECTS (node) = 1;
CAN_COMPLETE_NORMALLY (node)
= CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
| CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 2));
return node;
}
/* 14.6 Labeled Statements */
/* Action taken when a lableled statement is parsed. a new
LABELED_BLOCK_EXPR is created. No statement is attached to the
label, yet. */
static tree
build_labeled_block (location, label)
int location;
tree label;
{
tree label_name = merge_qualified_name (label_id, label);
tree label_decl, node;
/* Issue a warning if we try to reuse a label that was previously
declared */
if (IDENTIFIER_LOCAL_VALUE (label_name))
{
EXPR_WFL_LINECOL (wfl_operator) = location;
parse_warning_context (wfl_operator, "Declaration of `%s' shadows "
"a previous declaration",
IDENTIFIER_POINTER (label));
EXPR_WFL_LINECOL (wfl_operator) =
EXPR_WFL_LINECOL (IDENTIFIER_LOCAL_VALUE (label_name));
parse_warning_context (wfl_operator, "This is the location of the "
"previous declaration of label `%s'",
IDENTIFIER_POINTER (label));
java_warning_count--;
}
label_decl = create_label_decl (label_name);
node = build (LABELED_BLOCK_EXPR, NULL_TREE, label_decl, NULL_TREE);
EXPR_WFL_LINECOL (node) = location;
TREE_SIDE_EFFECTS (node) = 1;
return node;
}
/* Generate a label crafting a unique name for it. This is used to
implicitely label loops that aren't the body part of labeled
statement. */
static tree
generate_labeled_block ()
{
return build_labeled_block (0, generate_name ());
}
/* A labeled statement LBE is attached a statement. */
static tree
complete_labeled_statement (lbe, statement)
tree lbe; /* Labeled block expr */
tree statement;
{
/* In anyways, tie the loop to its statement */
LABELED_BLOCK_BODY (lbe) = statement;
/* Ok, if statement is a for loop, we have to attach the labeled
statement to the block the for loop belongs to and return the
block instead */
if (TREE_CODE (statement) == LOOP_EXPR && IS_FOR_LOOP_P (statement))
{
java_method_add_stmt (current_function_decl, lbe);
return exit_block ();
}
return lbe;
}
/* 14.10, 14.11, 14.12 Loop Statements */
/* Create an empty LOOP_EXPR and make it the last in the nested loop
list. */
static tree
build_new_loop (loop_body)
tree loop_body;
{
tree loop = build (LOOP_EXPR, NULL_TREE, loop_body);
TREE_SIDE_EFFECTS (loop) = 1;
PUSH_LOOP (loop);
return loop;
}
/* Create a loop body according to the following structure:
COMPOUND_EXPR
COMPOUND_EXPR (loop main body)
EXIT_EXPR (this order is for while/for loops.
LABELED_BLOCK_EXPR the order is reversed for do loops)
LABEL_DECL (continue occurding here branche at the
BODY end of this labeled block)
INCREMENT (if any)
REVERSED, if non zero, tells that the loop condition expr comes
after the body, like in the do-while loop.
To obtain a loop, the loop body structure described above is
encapsulated within a LOOP_EXPR surrounded by a LABELED_BLOCK_EXPR:
LABELED_BLOCK_EXPR
LABEL_DECL (use this label to exit the loop)
LOOP_EXPR
<structure described above> */
static tree
build_loop_body (location, condition, reversed)
int location;
tree condition;
int reversed;
{
tree first, second, body;
condition = build (EXIT_EXPR, NULL_TREE, condition); /* Force walk */
EXPR_WFL_LINECOL (condition) = location; /* For accurate error report */
condition = build_debugable_stmt (location, condition);
TREE_SIDE_EFFECTS (condition) = 1;
body = generate_labeled_block ();
first = (reversed ? body : condition);
second = (reversed ? condition : body);
return
build (COMPOUND_EXPR, NULL_TREE,
build (COMPOUND_EXPR, NULL_TREE, first, second), empty_stmt_node);
}
/* Install CONDITION (if any) and loop BODY (using REVERSED to tell
their order) on the current loop. Unlink the current loop from the
loop list. */
static tree
complete_loop_body (location, condition, body, reversed)
int location;
tree condition, body;
int reversed;
{
tree to_return = ctxp->current_loop;
tree loop_body = LOOP_EXPR_BODY (to_return);
if (condition)
{
tree cnode = LOOP_EXPR_BODY_CONDITION_EXPR (loop_body, reversed);
/* We wrapped the EXIT_EXPR around a WFL so we can debug it.
The real EXIT_EXPR is one operand further. */
EXPR_WFL_LINECOL (cnode) = location;
/* This one is for accurate error reports */
EXPR_WFL_LINECOL (TREE_OPERAND (cnode, 0)) = location;
TREE_OPERAND (TREE_OPERAND (cnode, 0), 0) = condition;
}
LOOP_EXPR_BODY_BODY_EXPR (loop_body, reversed) = body;
POP_LOOP ();
return to_return;
}
/* Tailored version of complete_loop_body for FOR loops, when FOR
loops feature the condition part */
static tree
complete_for_loop (location, condition, update, body)
int location;
tree condition, update, body;
{
/* Put the condition and the loop body in place */
tree loop = complete_loop_body (location, condition, body, 0);
/* LOOP is the current loop which has been now popped of the loop
stack. Install the update block */
LOOP_EXPR_BODY_UPDATE_BLOCK (LOOP_EXPR_BODY (loop)) = update;
return loop;
}
/* If the loop isn't surrounded by a labeled statement, create one and
insert LOOP as it's body. */
static tree
patch_loop_statement (loop)
tree loop;
{
tree loop_label, to_return_as_loop;
if (LOOP_HAS_LABEL_P (loop))
{
loop_label = ctxp->current_labeled_block;
to_return_as_loop = loop;
}
else
{
loop_label = generate_labeled_block ();
LABELED_BLOCK_BODY (loop_label) = loop;
PUSH_LABELED_BLOCK (loop_label);
to_return_as_loop = loop_label;
}
TREE_TYPE (to_return_as_loop) = void_type_node;
return to_return_as_loop;
}
/* 14.13, 14.14: break and continue Statements */
/* Build a break or a continue statement. a null NAME indicates an
unlabeled break/continue statement. */
static tree
build_bc_statement (location, is_break, name)
int location, is_break;
tree name;
{
tree break_continue, label_block_expr = NULL_TREE;
if (name)
{
if (!(label_block_expr = IDENTIFIER_LOCAL_VALUE
(merge_qualified_name (label_id, EXPR_WFL_NODE (name)))))
/* Null means that we don't have a target for this named
break/continue. In this case, we make the target to be the
label name, so that the error can be reported accuratly in
patch_bc_statement. */
label_block_expr = EXPR_WFL_NODE (name);
}
/* Unlabeled break/continue will be handled during the
break/continue patch operation */
break_continue
= build (EXIT_BLOCK_EXPR, NULL_TREE, label_block_expr, NULL_TREE);
IS_BREAK_STMT_P (break_continue) = is_break;
TREE_SIDE_EFFECTS (break_continue) = 1;
EXPR_WFL_LINECOL (break_continue) = location;
break_continue = build_debugable_stmt (location, break_continue);
return break_continue;
}
/* Verification of a break/continue statement. */
static tree
patch_bc_statement (node)
tree node;
{
tree bc_label = EXIT_BLOCK_LABELED_BLOCK (node), target_stmt;
int is_unlabeled = 0;
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
/* Not having a target means that the break/continue statement is
unlabeled. We try to find a decent label for it */
if (!bc_label)
{
is_unlabeled = 1;
/* There should be a loop/switch to branch to */
if (ctxp->current_loop)
{
if (TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
{
/* At that stage, we're in the loop body, which is
encapsulated around a LABELED_BLOCK_EXPR. So searching
the current loop label requires us to consider the
labeled block before the current one. */
if (!LOOP_HAS_LABEL_SKIP_P (ctxp->current_loop))
fatal ("unlabeled loop has no installed label -- "
"patch_bc_statement");
bc_label = TREE_CHAIN (ctxp->current_labeled_block);
}
/* For a SWITCH statement, this is the current one */
else
bc_label = ctxp->current_labeled_block;
}
/* Not having a loop to break/continue to is an error */
else
{
parse_error_context (wfl_operator, "`%s' must be in loop%s",
(IS_BREAK_STMT_P (node) ? "break" : "continue"),
(IS_BREAK_STMT_P (node) ? " or switch" : ""));
return error_mark_node;
}
}
/* Having an identifier here means that the target is unknown. */
else if (TREE_CODE (bc_label) == IDENTIFIER_NODE)
{
parse_error_context (wfl_operator, "No label definition found for `%s'",
IDENTIFIER_POINTER (bc_label));
return error_mark_node;
}
/* Find the statement we're targeting. */
target_stmt = LABELED_BLOCK_BODY (bc_label);
/* 14.13 The break Statement */
if (IS_BREAK_STMT_P (node))
{
/* Named break are always fine, as far as they have a target
(already verified). Anonymous break need to target
while/do/for/switch */
if (is_unlabeled &&
!(TREE_CODE (target_stmt) == LOOP_EXPR /* do/while/for */
|| TREE_CODE (target_stmt) == SWITCH_EXPR)) /* switch FIXME */
{
parse_error_context (wfl_operator,
"`break' must be in loop or switch");
return error_mark_node;
}
/* If previously unlabeled, install the new found label */
if (is_unlabeled)
EXIT_BLOCK_LABELED_BLOCK (node) = bc_label;
}
/* 14.14 The continue Statement */
/* The continue statement must always target a loop */
else
{
if (TREE_CODE (target_stmt) != LOOP_EXPR) /* do/while/for */
{
parse_error_context (wfl_operator, "`continue' must be in loop");
return error_mark_node;
}
/* Everything looks good. We can fix the `continue' jump to go
at the place in the loop were the continue is. The continue
is the current labeled block, by construction. */
EXIT_BLOCK_LABELED_BLOCK (node) = bc_label = ctxp->current_labeled_block;
}
CAN_COMPLETE_NORMALLY (bc_label) = 1;
/* Our break/continue don't return values. */
TREE_TYPE (node) = void_type_node;
/* Encapsulate the break within a compound statement so that it's
expanded all the times by expand_expr (and not clobered
sometimes, like after a if statement) */
node = add_stmt_to_compound (NULL_TREE, void_type_node, node);
TREE_SIDE_EFFECTS (node) = 1;
return node;
}
/* Process the exit expression belonging to a loop. Its type must be
boolean. */
static tree
patch_exit_expr (node)
tree node;
{
tree expression = TREE_OPERAND (node, 0);
TREE_TYPE (node) = error_mark_node;
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
/* The type of expression must be boolean */
if (TREE_TYPE (expression) != boolean_type_node)
{
parse_error_context
(wfl_operator,
"Incompatible type for loop conditional. Can't convert `%s' to "
"`boolean'",
lang_printable_name (TREE_TYPE (expression), 0));
return error_mark_node;
}
/* Now we know things are allright, invert the condition, fold and
return */
TREE_OPERAND (node, 0) =
fold (build1 (TRUTH_NOT_EXPR, boolean_type_node, expression));
if (! integer_zerop (TREE_OPERAND (node, 0))
&& ctxp->current_loop != NULL_TREE
&& TREE_CODE (ctxp->current_loop) == LOOP_EXPR)
CAN_COMPLETE_NORMALLY (ctxp->current_loop) = 1;
if (! integer_onep (TREE_OPERAND (node, 0)))
CAN_COMPLETE_NORMALLY (node) = 1;
TREE_TYPE (node) = void_type_node;
return node;
}
/* 14.9 Switch statement */
static tree
patch_switch_statement (node)
tree node;
{
tree se = TREE_OPERAND (node, 0), se_type;
/* Complete the switch expression */
se = TREE_OPERAND (node, 0) = java_complete_tree (se);
se_type = TREE_TYPE (se);
/* The type of the switch expression must be char, byte, short or
int */
if (!JINTEGRAL_TYPE_P (se_type))
{
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (node);
parse_error_context (wfl_operator, "Incompatible type for `switch'. "
"Can't convert `%s' to `int'",
lang_printable_name (se_type, 0));
/* This is what java_complete_tree will check */
TREE_OPERAND (node, 0) = error_mark_node;
return error_mark_node;
}
TREE_OPERAND (node, 1) = java_complete_tree (TREE_OPERAND (node, 1));
/* Ready to return */
if (TREE_CODE (TREE_OPERAND (node, 1)) == ERROR_MARK)
{
TREE_TYPE (node) = error_mark_node;
return error_mark_node;
}
TREE_TYPE (node) = void_type_node;
TREE_SIDE_EFFECTS (node) = 1;
CAN_COMPLETE_NORMALLY (node)
= CAN_COMPLETE_NORMALLY (TREE_OPERAND (node, 1))
|| ! SWITCH_HAS_DEFAULT (node);
return node;
}
/* 14.18 The try statement */
/* Wrap BLOCK around a LABELED_BLOCK, set DECL to the newly generated
exit labeld and issue a jump to FINALLY_LABEL:
LABELED_BLOCK
BLOCK
<orignal_statments>
DECL = &LABEL_DECL
GOTO_EXPR
FINALLY_LABEL
LABEL_DECL */
static tree
build_jump_to_finally (block, decl, finally_label, type)
tree block, decl, finally_label, type;
{
tree stmt;
tree new_block = build (LABELED_BLOCK_EXPR, type,
create_label_decl (generate_name ()), block);
stmt = build (MODIFY_EXPR, void_type_node, decl,
build_address_of (LABELED_BLOCK_LABEL (new_block)));
TREE_SIDE_EFFECTS (stmt) = 1;
add_stmt_to_block (block, type, stmt);
stmt = build (GOTO_EXPR, void_type_node, finally_label);
TREE_SIDE_EFFECTS (stmt) = 1;
add_stmt_to_block (block, type, stmt);
return new_block;
}
static tree
build_try_statement (location, try_block, catches, finally)
int location;
tree try_block, catches, finally;
{
tree node, rff;
if (finally && ! flag_emit_class_files)
{
/* This block defines a scope for the entire try[-catch]-finally
sequence. It hold a local variable used to return from the
finally using a computed goto. We call it
return_from_finally (RFF). */
rff = build_decl (VAR_DECL, generate_name (), return_address_type_node);
/* Modification of the try block. */
try_block = build_jump_to_finally (try_block, rff,
FINALLY_EXPR_LABEL (finally),
NULL_TREE);
/* To the finally block: add the computed goto */
add_stmt_to_block (FINALLY_EXPR_BLOCK (finally), NULL_TREE,
build (GOTO_EXPR, void_type_node, rff));
/* Modification of each catch blocks, if any */
if (catches)
{
tree catch, catch_decl, catch_block, stmt;
for (catch = catches; catch; catch = TREE_CHAIN (catch))
TREE_OPERAND (catch, 0) =
build_jump_to_finally (TREE_OPERAND (catch, 0), rff,
FINALLY_EXPR_LABEL (finally),
NULL_TREE);
/* Plus, at the end of the list, we add the catch clause that
will catch an uncaught exception, call finally and rethrow it:
BLOCK
void *exception_parameter; (catch_decl)
LABELED_BLOCK
BLOCK
exception_parameter = _Jv_exception_info ();
RFF = &LABEL_DECL;
goto finally;
LABEL_DECL;
CALL_EXPR
Jv_ReThrow
exception_parameter */
catch_decl = build_decl (VAR_DECL, generate_name (), ptr_type_node);
BUILD_ASSIGN_EXCEPTION_INFO (stmt, catch_decl);
catch_block = build_expr_block (stmt, NULL_TREE);
catch_block = build_jump_to_finally (catch_block, rff,
FINALLY_EXPR_LABEL (finally),
void_type_node);
BUILD_THROW (stmt, catch_decl);
catch_block = build_expr_block (catch_block, catch_decl);
add_stmt_to_block (catch_block, void_type_node, stmt);
/* Link the new handler to the existing list as the first
entry. It will be the last one to be generated. */
catch = build1 (CATCH_EXPR, void_type_node, catch_block);
TREE_CHAIN (catch) = catches;
catches = catch;
}
}
node = build (TRY_EXPR, NULL_TREE, try_block, catches, finally);
EXPR_WFL_LINECOL (node) = location;
/* If we have a finally, surround this whole thing by a block where
the RFF local variable is defined. */
return (finally && ! flag_emit_class_files ? build_expr_block (node, rff)
: node);
}
/* Get the catch clause block from an element of the catch clause
list. If depends on whether a finally clause exists or node (in
which case the original catch clause was surrounded by a
LABELED_BLOCK_EXPR. */
tree
java_get_catch_block (node, finally_present_p)
tree node;
int finally_present_p;
{
return (CATCH_EXPR_GET_EXPR (TREE_OPERAND (node, 0), finally_present_p));
}
static tree
patch_try_statement (node)
tree node;
{
int error_found = 0;
tree try = TREE_OPERAND (node, 0);
/* Exception handlers are considered in left to right order */
tree catch = nreverse (TREE_OPERAND (node, 1));
tree finally = TREE_OPERAND (node, 2);
int finally_p = (finally ? 1 : 0);
tree current, caught_type_list = NULL_TREE;
/* Check catch clauses, if any. Every time we find an error, we try
to process the next catch clause. We process the catch clause before
the try block so that when processing the try block we can check thrown
exceptions againts the caught type list. */
for (current = catch; current; current = TREE_CHAIN (current))
{
tree carg_decl, carg_type;
tree sub_current, catch_block, catch_clause;
int unreachable;
/* Always detect the last catch clause if a finally is
present. This is the catch-all handler and it just needs to
be walked. */
if (!TREE_CHAIN (current) && finally)
{
TREE_OPERAND (current, 0) =
java_complete_tree (TREE_OPERAND (current, 0));
continue;
}
/* At this point, the structure of the catch clause is
LABELED_BLOCK_EXPR (if we have a finally)
CATCH_EXPR (catch node)
BLOCK (with the decl of the parameter)
COMPOUND_EXPR
MODIFIY_EXPR (assignemnt of the catch parameter)
BLOCK (catch clause block)
LABEL_DECL (where to return after finally (if any))
Since the structure of the catch clause depends on the
presence of a finally, we use a function call to get to the
cath clause */
catch_clause = java_get_catch_block (current, finally_p);
carg_decl = BLOCK_EXPR_DECLS (catch_clause);
carg_type = TREE_TYPE (TREE_TYPE (carg_decl));
/* Catch clauses can't have more than one parameter declared,
but it's already enforced by the grammar. Make sure that the
only parameter of the clause statement in of class Throwable
or a subclass of Throwable, but that was done earlier. The
catch clause parameter type has also been resolved. */
/* Just make sure that the catch clause parameter type inherits
from java.lang.Throwable */
if (!inherits_from_p (carg_type, throwable_type_node))
{
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
parse_error_context (wfl_operator,
"Can't catch class `%s'. Catch clause "
"parameter type must be a subclass of "
"class `java.lang.Throwable'",
lang_printable_name (carg_type, 0));
error_found = 1;
continue;
}
/* Partial check for unreachable catch statement: The catch
clause is reachable iff is no earlier catch block A in
the try statement such that the type of the catch
clause's parameter is the same as or a subclass of the
type of A's parameter */
unreachable = 0;
for (sub_current = catch;
sub_current != current; sub_current = TREE_CHAIN (sub_current))
{
tree sub_catch_clause, decl;
sub_catch_clause = java_get_catch_block (sub_current, finally_p);
decl = BLOCK_EXPR_DECLS (sub_catch_clause);
if (inherits_from_p (carg_type, TREE_TYPE (TREE_TYPE (decl))))
{
EXPR_WFL_LINECOL (wfl_operator) = EXPR_WFL_LINECOL (current);
parse_error_context
(wfl_operator, "`catch' not reached because of the catch "
"clause at line %d", EXPR_WFL_LINENO (sub_current));
unreachable = error_found = 1;
break;
}
}
/* Complete the catch clause block */
catch_block = java_complete_tree (TREE_OPERAND (current, 0));
if (catch_block == error_mark_node)
{
error_found = 1;
continue;
}
if (CAN_COMPLETE_NORMALLY (catch_block))
CAN_COMPLETE_NORMALLY (node) = 1;
TREE_OPERAND (current, 0) = catch_block;
if (unreachable)
continue;
/* Things to do here: the exception must be thrown */
/* Link this type to the caught type list */
caught_type_list = tree_cons (NULL_TREE, carg_type, caught_type_list);
}
PUSH_EXCEPTIONS (caught_type_list);
if ((try = java_complete_tree (try)) == error_mark_node)
error_found = 1;
if (CAN_COMPLETE_NORMALLY (try))
CAN_COMPLETE_NORMALLY (node) = 1;
POP_EXCEPTIONS ();
/* Process finally */
if (finally)
{
current = java_complete_tree (FINALLY_EXPR_BLOCK (finally));
FINALLY_EXPR_BLOCK (finally) = current;
if (current == error_mark_node)
error_found = 1;
if (! CAN_COMPLETE_NORMALLY (current))
CAN_COMPLETE_NORMALLY (node) = 0;
}
/* Verification ends here */
if (error_found)
return error_mark_node;
TREE_OPERAND (node, 0) = try;
TREE_OPERAND (node, 1) = catch;
TREE_OPERAND (node, 2) = finally;
TREE_TYPE (node) = void_type_node;
return node;
}
/* 14.17 The synchronized Statement */
static tree
patch_synchronized_statement (node, wfl_op1)
tree node, wfl_op1;
{
tree expr = TREE_OPERAND (node, 0);
tree block = TREE_OPERAND (node, 1);
tree try_block, catch_all, stmt, compound, decl;
/* The TYPE of expr must be a reference type */
if (!JREFERENCE_TYPE_P (TREE_TYPE (TREE_OPERAND (node, 0))))
{
SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
parse_error_context (wfl_operator, "Incompatible type for `synchronized'"
". Can't convert `%s' to `java.lang.Object'",
lang_printable_name (TREE_TYPE (expr), 0));
return error_mark_node;
}
/* Generate a try-finally for the synchronized statement, except
that the handler that catches all throw exception calls
_Jv_MonitorExit and then rethrow the exception.
The synchronized statement is then implemented as:
TRY
{
_Jv_MonitorEnter (expression)
synchronized_block
_Jv_MonitorExit (expression)
}
CATCH_ALL
{
e = _Jv_exception_info ();
_Jv_MonitorExit (expression)
Throw (e);
} */
/* TRY block */
BUILD_MONITOR_ENTER (stmt, expr);
compound = add_stmt_to_compound (NULL_TREE, int_type_node, stmt);
compound = add_stmt_to_compound (compound, void_type_node, block);
BUILD_MONITOR_EXIT (stmt, expr);
compound = add_stmt_to_compound (compound, int_type_node, stmt);
try_block = build_expr_block (compound, NULL_TREE);
/* CATCH_ALL block */
decl = build_decl (VAR_DECL, generate_name (), ptr_type_node);
BUILD_ASSIGN_EXCEPTION_INFO (stmt, decl);
compound = add_stmt_to_compound (NULL_TREE, void_type_node, stmt);
BUILD_MONITOR_EXIT (stmt, expr);
compound = add_stmt_to_compound (compound, int_type_node, stmt);
BUILD_THROW (stmt, decl);
compound = add_stmt_to_compound (compound, void_type_node, stmt);
catch_all = build_expr_block (compound, decl);
catch_all = build_expr_block (catch_all, NULL_TREE);
catch_all = build1 (CATCH_EXPR, void_type_node, catch_all);
/* TRY-CATCH statement */
return build (TRY_EXPR, void_type_node, try_block, catch_all, NULL_TREE);
}
/* 14.16 The throw Statement */
static tree
patch_throw_statement (node, wfl_op1)
tree node, wfl_op1;
{
tree expr = TREE_OPERAND (node, 0);
tree type = TREE_TYPE (expr);
int unchecked_ok = 0, tryblock_throws_ok = 0;
/* Thrown expression must be assignable to java.lang.Throwable */
if (!try_reference_assignconv (throwable_type_node, expr))
{
SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
parse_error_context (wfl_operator, "Can't throw `%s'; it must be a "
"subclass of class `java.lang.Throwable'",
lang_printable_name (type, 0));
/* If the thrown expression was a reference, we further the
compile-time check. */
if (!JREFERENCE_TYPE_P (type))
return error_mark_node;
}
/* At least one of the following must be true */
/* The type of the throw expression is a not checked exception,
i.e. is a unchecked expression. */
unchecked_ok = IS_UNCHECKED_EXCEPTION_P (TREE_TYPE (type));
/* Throw is contained in a try statement and at least one catch
clause can receive the thrown expression or the current method is
declared to throw such an exception. Or, the throw statement is
contained in a method or constructor declaration and the type of
the Expression is assignable to at least one type listed in the
throws clause the declaration. */
SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
if (!unchecked_ok)
tryblock_throws_ok =
check_thrown_exceptions_do (TREE_TYPE (expr));
if (!(unchecked_ok || tryblock_throws_ok))
{
/* If there is a surrounding try block that has no matching
clatch clause, report it first. A surrounding try block exits
only if there is something after the list of checked
exception thrown by the current function (if any). */
if (IN_TRY_BLOCK_P ())
parse_error_context (wfl_operator, "Checked exception `%s' can't be "
"caught by any of the catch clause(s) "
"of the surrounding `try' block",
lang_printable_name (type, 0));
/* If we have no surrounding try statement and the method doesn't have
any throws, report it now. FIXME */
else if (!EXCEPTIONS_P (currently_caught_type_list)
&& !tryblock_throws_ok)
parse_error_context (wfl_operator, "Checked exception `%s' isn't "
"thrown from a `try' block",
lang_printable_name (type, 0));
/* Otherwise, the current method doesn't have the appropriate
throws declaration */
else
parse_error_context (wfl_operator, "Checked exception `%s' doesn't "
"match any of current method's `throws' "
"declaration(s)",
lang_printable_name (type, 0));
return error_mark_node;
}
/* If a throw statement is contained in a static initializer, then a
compile-time check ensures that either its value is always an
unchecked exception or its value is always caught by some try
statement that contains it. FIXME, static initializer. */
if (! flag_emit_class_files)
BUILD_THROW (node, expr);
return node;
}
/* Check that exception said to be thrown by method DECL can be
effectively caught from where DECL is invoked. */
static void
check_thrown_exceptions (location, decl)
int location;
tree decl;
{
tree throws;
/* For all the unchecked exceptions thrown by DECL */
for (throws = DECL_FUNCTION_THROWS (decl); throws;
throws = TREE_CHAIN (throws))
if (!check_thrown_exceptions_do (TREE_VALUE (throws)))
{
EXPR_WFL_LINECOL (wfl_operator) = location;
parse_error_context
(wfl_operator, "Exception `%s' must be caught, or it must be "
"declared in the `throws' clause of `%s'",
lang_printable_name (TREE_VALUE (throws), 0),
IDENTIFIER_POINTER (DECL_NAME (current_function_decl)));
}
}
/* Return 1 if checked EXCEPTION is caught at the current nesting level of
try-catch blocks, OR is listed in the `throws' clause of the
current method. */
static int
check_thrown_exceptions_do (exception)
tree exception;
{
tree list = currently_caught_type_list;
resolve_and_layout (exception, NULL_TREE);
/* First, all the nested try-catch-finally at that stage. The
last element contains `throws' clause exceptions, if any. */
if (IS_UNCHECKED_EXCEPTION_P (exception))
return 1;
while (list)
{
tree caught;
for (caught = TREE_VALUE (list); caught; caught = TREE_CHAIN (caught))
if (valid_ref_assignconv_cast_p (exception, TREE_VALUE (caught), 0))
return 1;
list = TREE_CHAIN (list);
}
return 0;
}
static void
purge_unchecked_exceptions (mdecl)
tree mdecl;
{
tree throws = DECL_FUNCTION_THROWS (mdecl);
tree new = NULL_TREE;
while (throws)
{
tree next = TREE_CHAIN (throws);
if (!IS_UNCHECKED_EXCEPTION_P (TREE_VALUE (throws)))
{
TREE_CHAIN (throws) = new;
new = throws;
}
throws = next;
}
/* List is inverted here, but it doesn't matter */
DECL_FUNCTION_THROWS (mdecl) = new;
}
/* 15.24 Conditional Operator ?: */
static tree
patch_conditional_expr (node, wfl_cond, wfl_op1)
tree node, wfl_cond, wfl_op1;
{
tree cond = TREE_OPERAND (node, 0);
tree op1 = TREE_OPERAND (node, 1);
tree op2 = TREE_OPERAND (node, 2);
tree t1 = TREE_TYPE (op1);
tree t2 = TREE_TYPE (op2);
tree resulting_type = NULL_TREE;
int error_found = 0;
/* The first expression must be a boolean */
if (TREE_TYPE (cond) != boolean_type_node)
{
SET_WFL_OPERATOR (wfl_operator, node, wfl_cond);
parse_error_context (wfl_operator, "Incompatible type for `?:'. Can't "
"convert `%s' to `boolean'",
lang_printable_name (TREE_TYPE (cond), 0));
error_found = 1;
}
/* Second and third can be numeric, boolean (i.e. primitive),
references or null. Anything else results in an error */
if (!((JNUMERIC_TYPE_P (t1) && JNUMERIC_TYPE_P (t2))
|| ((JREFERENCE_TYPE_P (t1) || op1 == null_pointer_node)
&& (JREFERENCE_TYPE_P (t2) || op2 == null_pointer_node))
|| (t1 == boolean_type_node && t2 == boolean_type_node)))
error_found = 1;
/* Determine the type of the conditional expression. Same types are
easy to deal with */
else if (t1 == t2)
resulting_type = t1;
/* There are different rules for numeric types */
else if (JNUMERIC_TYPE_P (t1))
{
/* if byte/short found, the resulting type is short */
if ((t1 == byte_type_node && t2 == short_type_node)
|| (t1 == short_type_node && t2 == byte_type_node))
resulting_type = short_type_node;
/* If t1 is a constant int and t2 is of type byte, short or char
and t1's value fits in t2, then the resulting type is t2 */
else if ((t1 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 1)))
&& JBSC_TYPE_P (t2) && int_fits_type_p (TREE_OPERAND (node, 1), t2))
resulting_type = t2;
/* If t2 is a constant int and t1 is of type byte, short or char
and t2's value fits in t1, then the resulting type is t1 */
else if ((t2 == int_type_node && TREE_CONSTANT (TREE_OPERAND (node, 2)))
&& JBSC_TYPE_P (t1) && int_fits_type_p (TREE_OPERAND (node, 2), t1))
resulting_type = t1;
/* Otherwise, binary numeric promotion is applied and the
resulting type is the promoted type of operand 1 and 2 */
else
resulting_type = binary_numeric_promotion (t2, t2,
&TREE_OPERAND (node, 1),
&TREE_OPERAND (node, 2));
}
/* Cases of a reference and a null type */
else if (JREFERENCE_TYPE_P (t1) && op2 == null_pointer_node)
resulting_type = t1;
else if (JREFERENCE_TYPE_P (t2) && op1 == null_pointer_node)
resulting_type = t2;
/* Last case: different reference types. If a type can be converted
into the other one by assignment conversion, the latter
determines the type of the expression */
else if ((resulting_type = try_reference_assignconv (t1, op2)))
resulting_type = promote_type (t1);
else if ((resulting_type = try_reference_assignconv (t2, op1)))
resulting_type = promote_type (t2);
/* If we don't have any resulting type, we're in trouble */
if (!resulting_type)
{
char *t = strdup (lang_printable_name (t1, 0));
SET_WFL_OPERATOR (wfl_operator, node, wfl_op1);
parse_error_context (wfl_operator, "Incompatible type for `?:'. Can't "
"convert `%s' to `%s'", t,
lang_printable_name (t2, 0));
free (t);
error_found = 1;
}
if (error_found)
{
TREE_TYPE (node) = error_mark_node;
return error_mark_node;
}
TREE_TYPE (node) = resulting_type;
TREE_SET_CODE (node, COND_EXPR);
CAN_COMPLETE_NORMALLY (node) = 1;
return node;
}
|