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
13113
13114
13115
13116
13117
13118
13119
13120
13121
13122
13123
13124
13125
13126
13127
13128
13129
13130
13131
13132
13133
13134
13135
13136
13137
13138
13139
13140
13141
13142
13143
13144
13145
13146
13147
13148
13149
13150
13151
13152
13153
13154
13155
13156
13157
13158
13159
13160
13161
13162
13163
13164
13165
13166
13167
13168
13169
13170
13171
13172
13173
13174
13175
13176
13177
13178
13179
13180
13181
13182
13183
13184
13185
13186
13187
13188
13189
13190
13191
13192
13193
13194
13195
13196
13197
13198
13199
13200
13201
13202
13203
13204
13205
13206
13207
13208
13209
13210
13211
13212
13213
13214
13215
13216
13217
13218
13219
13220
13221
13222
13223
13224
13225
13226
13227
13228
13229
13230
13231
13232
13233
13234
13235
13236
13237
13238
13239
13240
13241
13242
13243
13244
13245
13246
13247
13248
13249
13250
13251
13252
13253
13254
13255
13256
13257
13258
13259
13260
13261
13262
13263
13264
13265
13266
13267
13268
13269
13270
13271
13272
13273
13274
13275
13276
13277
13278
13279
13280
13281
13282
13283
13284
13285
13286
13287
13288
13289
13290
13291
13292
13293
13294
13295
13296
13297
13298
13299
13300
13301
13302
13303
13304
13305
13306
13307
13308
13309
13310
13311
13312
13313
13314
13315
13316
13317
13318
13319
13320
13321
13322
13323
13324
13325
13326
13327
13328
13329
13330
13331
13332
13333
13334
13335
13336
13337
13338
13339
13340
13341
13342
13343
13344
13345
13346
13347
13348
13349
13350
13351
13352
13353
13354
13355
13356
13357
13358
13359
13360
13361
13362
13363
13364
13365
13366
13367
13368
13369
13370
13371
13372
13373
13374
13375
13376
13377
13378
13379
13380
13381
13382
13383
13384
13385
13386
13387
13388
13389
13390
13391
13392
13393
13394
13395
13396
13397
13398
13399
13400
13401
13402
13403
13404
13405
13406
13407
13408
13409
13410
13411
13412
13413
13414
13415
13416
13417
13418
13419
13420
13421
13422
13423
13424
13425
13426
13427
13428
13429
13430
13431
13432
13433
13434
13435
13436
13437
13438
13439
13440
13441
13442
13443
13444
13445
13446
13447
13448
13449
13450
13451
13452
13453
13454
13455
13456
13457
13458
13459
13460
13461
13462
13463
13464
13465
13466
13467
13468
13469
13470
13471
13472
13473
13474
13475
13476
13477
13478
13479
13480
13481
13482
13483
13484
13485
13486
13487
13488
13489
13490
13491
13492
13493
13494
13495
13496
13497
13498
13499
13500
13501
13502
13503
13504
13505
13506
13507
13508
13509
13510
13511
13512
13513
13514
13515
13516
13517
13518
13519
13520
13521
13522
13523
13524
13525
13526
13527
13528
13529
13530
13531
13532
13533
13534
13535
13536
13537
13538
13539
13540
13541
13542
13543
13544
13545
13546
13547
13548
13549
13550
13551
13552
13553
13554
13555
13556
13557
13558
13559
13560
13561
13562
13563
13564
13565
13566
13567
13568
13569
13570
13571
13572
13573
13574
13575
13576
13577
13578
13579
13580
13581
13582
13583
13584
13585
13586
13587
13588
13589
13590
13591
13592
13593
13594
13595
13596
13597
13598
13599
13600
13601
13602
13603
13604
13605
13606
13607
13608
13609
13610
13611
13612
13613
13614
13615
13616
13617
13618
13619
13620
13621
13622
13623
13624
13625
13626
13627
13628
13629
13630
13631
13632
13633
13634
13635
13636
13637
13638
13639
13640
13641
13642
13643
13644
13645
13646
13647
13648
13649
13650
13651
13652
13653
13654
13655
13656
13657
13658
13659
13660
13661
13662
13663
13664
13665
13666
13667
13668
13669
13670
13671
13672
13673
13674
13675
13676
13677
13678
13679
13680
13681
13682
13683
13684
13685
13686
13687
13688
13689
13690
13691
13692
13693
13694
13695
13696
13697
13698
13699
13700
13701
13702
13703
13704
13705
13706
13707
13708
13709
13710
13711
13712
13713
13714
13715
13716
13717
13718
13719
13720
13721
13722
13723
13724
13725
13726
13727
13728
13729
13730
13731
13732
13733
13734
13735
13736
13737
13738
13739
13740
13741
13742
13743
13744
13745
13746
13747
13748
13749
13750
13751
13752
13753
13754
13755
13756
13757
13758
13759
13760
13761
13762
13763
13764
13765
13766
13767
13768
13769
13770
13771
13772
13773
13774
13775
13776
13777
13778
13779
13780
13781
13782
13783
13784
13785
13786
13787
13788
13789
13790
13791
13792
13793
13794
13795
13796
13797
13798
13799
13800
13801
13802
13803
13804
13805
13806
13807
13808
13809
13810
13811
13812
13813
13814
13815
13816
13817
13818
13819
13820
13821
13822
13823
13824
13825
13826
13827
13828
13829
13830
13831
13832
13833
13834
13835
13836
13837
13838
13839
13840
13841
13842
13843
13844
13845
13846
13847
13848
13849
13850
13851
13852
13853
13854
13855
13856
13857
13858
13859
13860
13861
13862
13863
13864
13865
13866
13867
13868
13869
13870
13871
13872
13873
13874
13875
13876
13877
13878
13879
13880
13881
13882
13883
13884
13885
13886
13887
13888
13889
13890
13891
13892
13893
13894
13895
13896
13897
13898
13899
13900
13901
13902
13903
13904
13905
13906
13907
13908
13909
13910
13911
13912
13913
13914
13915
13916
13917
13918
13919
13920
13921
13922
13923
13924
13925
13926
13927
13928
13929
13930
13931
13932
13933
13934
13935
13936
13937
13938
13939
13940
13941
13942
13943
13944
13945
13946
13947
13948
13949
13950
13951
13952
13953
13954
13955
13956
13957
13958
13959
13960
13961
13962
13963
13964
13965
13966
13967
13968
13969
13970
13971
13972
13973
13974
13975
13976
13977
13978
13979
13980
13981
13982
13983
13984
13985
13986
13987
13988
13989
13990
13991
13992
13993
13994
13995
13996
13997
13998
13999
14000
14001
14002
14003
14004
14005
14006
14007
14008
14009
14010
14011
14012
14013
14014
14015
14016
14017
14018
14019
14020
14021
14022
14023
14024
14025
14026
14027
14028
14029
14030
14031
14032
14033
14034
14035
14036
14037
14038
14039
14040
14041
14042
14043
14044
14045
14046
14047
14048
14049
14050
14051
14052
14053
14054
14055
14056
14057
14058
14059
14060
14061
14062
14063
14064
14065
14066
14067
14068
14069
14070
14071
14072
14073
14074
14075
14076
14077
14078
14079
14080
14081
14082
14083
14084
14085
14086
14087
14088
14089
14090
14091
14092
14093
14094
14095
14096
14097
14098
14099
14100
14101
14102
14103
14104
14105
14106
14107
14108
14109
14110
14111
14112
14113
14114
14115
14116
14117
14118
14119
14120
14121
14122
14123
14124
14125
14126
14127
14128
14129
14130
14131
14132
14133
14134
14135
14136
14137
14138
14139
14140
14141
14142
14143
14144
14145
14146
14147
14148
14149
14150
14151
14152
14153
14154
14155
14156
14157
14158
14159
14160
14161
14162
14163
14164
14165
14166
14167
14168
14169
14170
14171
14172
14173
14174
14175
14176
14177
14178
14179
14180
14181
14182
14183
14184
14185
14186
14187
14188
14189
14190
14191
14192
14193
14194
14195
14196
14197
14198
14199
14200
14201
14202
14203
14204
14205
14206
14207
14208
14209
14210
14211
14212
14213
14214
14215
14216
14217
14218
14219
14220
14221
14222
14223
14224
14225
14226
14227
14228
14229
14230
14231
14232
14233
14234
14235
14236
14237
14238
14239
14240
14241
14242
14243
14244
14245
14246
14247
14248
14249
14250
14251
14252
14253
14254
14255
14256
14257
14258
14259
14260
14261
14262
14263
14264
14265
14266
14267
14268
14269
14270
14271
14272
14273
14274
14275
14276
14277
14278
14279
14280
14281
14282
14283
14284
14285
14286
14287
14288
14289
14290
14291
14292
14293
14294
14295
14296
14297
14298
14299
14300
14301
14302
14303
14304
14305
14306
14307
14308
14309
14310
14311
14312
14313
14314
14315
14316
14317
14318
14319
14320
14321
14322
14323
14324
14325
14326
14327
14328
14329
14330
14331
14332
14333
14334
14335
14336
14337
14338
14339
14340
14341
14342
14343
14344
14345
14346
14347
14348
14349
14350
14351
14352
14353
14354
14355
14356
14357
14358
14359
14360
14361
14362
14363
14364
14365
14366
14367
14368
14369
14370
14371
14372
14373
14374
14375
14376
14377
14378
14379
14380
14381
14382
14383
14384
14385
14386
14387
14388
14389
14390
14391
14392
14393
14394
14395
14396
14397
14398
14399
14400
14401
14402
14403
14404
14405
14406
14407
14408
14409
14410
14411
14412
14413
14414
14415
14416
14417
14418
14419
14420
14421
14422
14423
14424
14425
14426
14427
14428
14429
14430
14431
14432
14433
14434
14435
14436
14437
14438
14439
14440
14441
14442
14443
14444
14445
14446
14447
14448
14449
14450
14451
14452
14453
14454
14455
14456
14457
14458
14459
14460
14461
14462
14463
14464
14465
14466
14467
14468
14469
14470
14471
14472
14473
14474
14475
14476
14477
14478
14479
14480
14481
14482
14483
14484
14485
14486
14487
14488
14489
14490
14491
14492
14493
14494
14495
14496
14497
14498
14499
14500
14501
14502
14503
14504
14505
14506
14507
14508
14509
14510
14511
14512
14513
14514
14515
14516
14517
14518
14519
14520
14521
14522
14523
14524
14525
14526
14527
14528
14529
14530
14531
14532
14533
14534
14535
14536
14537
14538
14539
14540
14541
14542
14543
14544
14545
14546
14547
14548
14549
14550
14551
14552
14553
14554
14555
14556
14557
14558
14559
14560
14561
14562
14563
14564
14565
14566
14567
14568
14569
14570
14571
14572
14573
14574
14575
14576
14577
14578
14579
14580
14581
14582
14583
14584
14585
14586
14587
14588
14589
14590
14591
14592
14593
14594
14595
14596
14597
14598
14599
14600
14601
14602
14603
14604
14605
14606
14607
14608
14609
14610
14611
14612
14613
14614
14615
14616
14617
14618
14619
14620
14621
14622
14623
14624
14625
14626
14627
14628
14629
14630
14631
14632
14633
14634
14635
14636
14637
14638
14639
14640
14641
14642
14643
14644
14645
14646
14647
14648
14649
14650
14651
14652
14653
14654
14655
14656
14657
14658
14659
14660
14661
14662
14663
14664
14665
14666
14667
14668
14669
14670
14671
14672
14673
14674
14675
14676
14677
14678
14679
14680
14681
14682
14683
14684
14685
14686
14687
14688
14689
14690
14691
14692
14693
14694
14695
14696
14697
14698
14699
14700
14701
14702
14703
14704
14705
14706
14707
14708
14709
14710
14711
14712
14713
14714
14715
14716
14717
14718
14719
14720
14721
14722
14723
14724
14725
14726
14727
14728
14729
14730
14731
14732
14733
14734
14735
14736
14737
14738
14739
14740
14741
14742
14743
14744
14745
14746
14747
14748
14749
14750
14751
14752
14753
14754
14755
14756
14757
14758
14759
14760
14761
14762
14763
14764
14765
14766
14767
14768
14769
14770
14771
14772
14773
14774
14775
14776
14777
14778
14779
14780
14781
14782
14783
14784
14785
14786
14787
14788
14789
14790
14791
14792
14793
14794
14795
14796
14797
14798
14799
14800
14801
14802
14803
14804
14805
14806
14807
14808
14809
14810
14811
14812
14813
14814
14815
14816
14817
14818
14819
14820
14821
14822
14823
14824
14825
14826
14827
14828
14829
14830
14831
14832
14833
14834
14835
14836
14837
14838
14839
14840
14841
14842
14843
14844
14845
14846
14847
14848
14849
14850
14851
14852
14853
14854
14855
14856
14857
14858
14859
14860
14861
14862
14863
14864
14865
14866
14867
14868
14869
14870
14871
14872
14873
14874
14875
14876
14877
14878
14879
14880
14881
14882
14883
14884
14885
14886
14887
14888
14889
14890
14891
14892
14893
14894
14895
14896
14897
14898
14899
14900
14901
14902
14903
14904
14905
14906
14907
14908
14909
14910
14911
14912
14913
14914
14915
14916
14917
14918
14919
14920
14921
14922
14923
14924
14925
14926
14927
14928
14929
14930
14931
14932
14933
14934
14935
14936
14937
14938
14939
14940
14941
14942
14943
14944
14945
14946
14947
14948
14949
14950
14951
14952
14953
14954
14955
14956
14957
14958
14959
14960
14961
14962
14963
14964
14965
14966
14967
14968
14969
14970
14971
14972
14973
14974
14975
14976
14977
14978
14979
14980
14981
14982
14983
14984
14985
14986
14987
14988
14989
14990
14991
14992
14993
14994
14995
14996
14997
14998
14999
15000
15001
15002
15003
15004
15005
15006
15007
15008
15009
15010
15011
15012
15013
15014
15015
15016
15017
15018
15019
15020
15021
15022
15023
15024
15025
15026
15027
15028
15029
15030
15031
15032
15033
15034
15035
15036
15037
15038
15039
15040
15041
15042
15043
15044
15045
15046
15047
15048
15049
15050
15051
15052
15053
15054
15055
15056
15057
15058
15059
15060
15061
15062
15063
15064
15065
15066
15067
15068
15069
15070
15071
15072
15073
15074
15075
15076
15077
15078
15079
15080
15081
15082
15083
15084
15085
15086
15087
15088
15089
15090
15091
15092
15093
15094
15095
15096
15097
15098
15099
15100
15101
15102
15103
15104
15105
15106
15107
15108
15109
15110
15111
15112
15113
15114
15115
15116
15117
15118
15119
15120
15121
15122
15123
15124
15125
15126
15127
15128
15129
15130
15131
15132
15133
15134
15135
15136
15137
15138
15139
15140
15141
15142
15143
15144
15145
15146
15147
15148
15149
15150
15151
15152
15153
15154
15155
15156
15157
15158
15159
15160
15161
15162
15163
15164
15165
15166
15167
15168
15169
15170
15171
15172
15173
15174
15175
15176
15177
15178
15179
15180
15181
15182
15183
15184
15185
15186
15187
15188
15189
15190
15191
15192
15193
15194
15195
15196
15197
15198
15199
15200
15201
15202
15203
15204
15205
15206
15207
15208
15209
15210
15211
15212
15213
15214
15215
15216
15217
15218
15219
15220
15221
15222
15223
15224
15225
15226
15227
15228
15229
15230
15231
15232
15233
15234
15235
15236
15237
15238
15239
15240
15241
15242
15243
15244
15245
15246
15247
15248
15249
15250
15251
15252
15253
15254
15255
15256
15257
15258
15259
15260
15261
15262
15263
15264
15265
15266
15267
15268
15269
15270
15271
15272
15273
15274
15275
15276
15277
15278
15279
15280
15281
15282
15283
15284
15285
15286
15287
15288
15289
15290
15291
15292
15293
15294
15295
15296
15297
15298
15299
15300
15301
15302
15303
15304
15305
15306
15307
15308
15309
15310
15311
15312
15313
15314
15315
15316
15317
15318
15319
15320
15321
15322
15323
15324
15325
15326
15327
15328
15329
15330
15331
15332
15333
15334
15335
15336
15337
15338
15339
15340
15341
15342
15343
15344
15345
15346
15347
15348
15349
15350
15351
15352
15353
15354
15355
15356
15357
15358
15359
15360
15361
15362
15363
15364
15365
15366
15367
15368
15369
15370
15371
15372
15373
15374
15375
15376
15377
15378
15379
15380
15381
15382
15383
15384
15385
15386
15387
15388
15389
15390
15391
15392
15393
15394
15395
15396
15397
15398
15399
15400
15401
15402
15403
15404
15405
15406
15407
15408
15409
15410
15411
15412
15413
15414
15415
15416
15417
15418
15419
15420
15421
15422
15423
15424
15425
15426
15427
15428
15429
15430
15431
15432
15433
15434
15435
15436
15437
15438
15439
15440
15441
15442
15443
15444
15445
15446
15447
15448
15449
15450
15451
15452
15453
15454
15455
15456
15457
15458
15459
15460
15461
15462
15463
15464
15465
15466
15467
15468
15469
15470
15471
15472
15473
15474
15475
15476
15477
15478
15479
15480
15481
15482
15483
15484
15485
15486
15487
15488
15489
15490
15491
15492
15493
15494
15495
15496
15497
15498
15499
15500
15501
15502
15503
15504
15505
15506
15507
15508
15509
15510
15511
15512
15513
15514
15515
15516
15517
15518
15519
15520
15521
15522
15523
15524
15525
15526
15527
15528
15529
15530
15531
15532
15533
15534
15535
15536
15537
15538
15539
15540
15541
15542
15543
15544
15545
15546
15547
15548
15549
15550
15551
15552
15553
15554
15555
15556
15557
15558
15559
15560
15561
15562
15563
15564
15565
15566
15567
15568
15569
15570
15571
15572
15573
15574
15575
15576
15577
15578
15579
15580
15581
15582
15583
15584
15585
15586
15587
15588
15589
15590
15591
15592
15593
15594
15595
15596
15597
15598
15599
15600
15601
15602
15603
15604
15605
15606
15607
15608
15609
15610
15611
15612
15613
15614
15615
15616
15617
15618
15619
15620
15621
15622
15623
15624
15625
15626
15627
15628
15629
15630
15631
15632
15633
15634
15635
15636
15637
15638
15639
15640
15641
15642
15643
15644
15645
15646
15647
15648
15649
15650
15651
15652
15653
15654
15655
15656
15657
15658
15659
15660
15661
15662
15663
15664
15665
15666
15667
15668
15669
15670
15671
15672
15673
15674
15675
15676
15677
15678
15679
15680
15681
15682
15683
15684
15685
15686
15687
15688
15689
15690
15691
15692
15693
15694
15695
15696
15697
15698
15699
15700
15701
15702
15703
15704
15705
15706
15707
15708
15709
15710
15711
15712
15713
15714
15715
15716
15717
15718
15719
15720
15721
15722
15723
15724
15725
15726
15727
15728
15729
15730
15731
15732
15733
15734
15735
15736
15737
15738
15739
15740
15741
15742
15743
15744
15745
15746
15747
15748
15749
15750
15751
15752
15753
15754
15755
15756
15757
15758
15759
15760
15761
15762
15763
15764
15765
15766
15767
15768
15769
15770
15771
15772
15773
15774
15775
15776
15777
15778
15779
15780
15781
15782
15783
15784
15785
15786
15787
15788
15789
15790
15791
15792
15793
15794
15795
15796
15797
15798
15799
15800
15801
15802
15803
15804
15805
15806
15807
15808
15809
15810
15811
15812
15813
15814
15815
15816
15817
15818
15819
15820
15821
15822
15823
15824
15825
15826
15827
15828
15829
15830
15831
15832
15833
15834
15835
15836
15837
15838
15839
15840
15841
15842
15843
15844
15845
15846
15847
15848
15849
15850
15851
15852
15853
15854
15855
15856
15857
15858
15859
15860
15861
15862
15863
15864
15865
15866
15867
15868
15869
15870
15871
15872
15873
15874
15875
15876
15877
15878
15879
15880
15881
15882
15883
15884
15885
15886
15887
15888
15889
15890
15891
15892
15893
15894
15895
15896
15897
15898
15899
15900
15901
15902
15903
15904
15905
15906
15907
15908
15909
15910
15911
15912
15913
15914
15915
15916
15917
15918
15919
15920
15921
15922
15923
15924
15925
15926
15927
15928
15929
15930
15931
15932
15933
15934
15935
15936
15937
15938
15939
15940
15941
15942
15943
15944
15945
15946
15947
15948
15949
15950
15951
15952
15953
15954
15955
15956
15957
15958
15959
15960
15961
15962
15963
15964
15965
15966
15967
15968
15969
15970
15971
15972
15973
15974
15975
15976
15977
15978
15979
15980
15981
15982
15983
15984
15985
15986
15987
15988
15989
15990
15991
15992
15993
15994
15995
15996
15997
15998
15999
16000
16001
16002
16003
16004
16005
16006
16007
16008
16009
16010
16011
16012
16013
16014
16015
16016
16017
16018
16019
16020
16021
16022
16023
16024
16025
16026
16027
16028
16029
16030
16031
16032
16033
16034
16035
16036
16037
16038
16039
16040
16041
16042
16043
16044
16045
16046
16047
16048
16049
16050
16051
16052
16053
16054
16055
16056
16057
16058
16059
16060
16061
16062
16063
16064
16065
16066
16067
16068
16069
16070
16071
16072
16073
16074
16075
16076
16077
16078
16079
16080
16081
16082
16083
16084
16085
16086
16087
16088
16089
16090
16091
16092
16093
16094
16095
16096
16097
16098
16099
16100
16101
16102
16103
16104
16105
16106
16107
16108
16109
16110
16111
16112
16113
16114
16115
16116
16117
16118
16119
16120
16121
16122
16123
16124
16125
16126
16127
16128
16129
16130
16131
16132
16133
16134
16135
16136
16137
16138
16139
16140
16141
16142
16143
16144
16145
16146
16147
16148
16149
16150
16151
16152
16153
16154
16155
16156
16157
16158
16159
16160
16161
16162
16163
16164
16165
16166
16167
16168
16169
16170
16171
16172
16173
16174
16175
16176
16177
16178
16179
16180
16181
16182
16183
16184
16185
16186
16187
16188
16189
16190
16191
16192
16193
16194
16195
16196
16197
16198
16199
16200
16201
16202
16203
16204
16205
16206
16207
16208
16209
16210
16211
16212
16213
16214
16215
16216
16217
16218
16219
16220
16221
16222
16223
16224
16225
16226
16227
16228
16229
16230
16231
16232
16233
16234
16235
16236
16237
16238
16239
16240
16241
16242
16243
16244
16245
16246
16247
16248
16249
16250
16251
16252
16253
16254
16255
16256
16257
16258
16259
16260
16261
16262
16263
16264
16265
16266
16267
16268
16269
16270
16271
16272
16273
16274
16275
16276
16277
16278
16279
16280
16281
16282
16283
16284
16285
16286
16287
16288
16289
16290
16291
16292
16293
16294
16295
16296
16297
16298
16299
16300
16301
16302
16303
16304
16305
16306
16307
16308
16309
16310
16311
16312
16313
16314
16315
16316
16317
16318
16319
16320
16321
16322
16323
16324
16325
16326
16327
16328
16329
16330
16331
16332
16333
16334
16335
16336
16337
16338
16339
16340
16341
16342
16343
16344
16345
16346
16347
16348
16349
16350
16351
16352
16353
16354
16355
16356
16357
16358
16359
16360
16361
16362
16363
16364
16365
16366
16367
16368
16369
16370
16371
16372
16373
16374
16375
16376
16377
16378
16379
16380
16381
16382
16383
16384
16385
16386
16387
16388
16389
16390
16391
16392
16393
16394
16395
16396
16397
16398
16399
16400
16401
16402
16403
16404
16405
16406
16407
16408
16409
16410
16411
16412
16413
16414
16415
16416
16417
16418
16419
16420
16421
16422
16423
16424
16425
16426
16427
16428
16429
16430
16431
16432
16433
16434
16435
16436
16437
16438
16439
16440
16441
16442
16443
16444
16445
16446
16447
16448
16449
16450
16451
16452
16453
16454
16455
16456
16457
16458
16459
16460
16461
16462
16463
16464
16465
16466
16467
16468
16469
16470
16471
16472
16473
16474
16475
16476
16477
16478
16479
16480
16481
16482
16483
16484
16485
16486
16487
16488
16489
16490
16491
16492
16493
16494
16495
16496
16497
16498
16499
16500
16501
16502
16503
16504
16505
16506
16507
16508
16509
16510
16511
16512
16513
16514
16515
16516
16517
16518
16519
16520
16521
16522
16523
16524
16525
16526
16527
16528
16529
16530
16531
16532
16533
16534
16535
16536
16537
16538
16539
16540
16541
16542
16543
16544
16545
16546
16547
16548
16549
16550
16551
16552
16553
16554
16555
16556
16557
16558
16559
16560
|
/* com.c -- Implementation File (module.c template V1.0)
Copyright (C) 1995-1998 Free Software Foundation, Inc.
Contributed by James Craig Burley (burley@gnu.org).
This file is part of GNU Fortran.
GNU Fortran 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.
GNU Fortran 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 GNU Fortran; see the file COPYING. If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA.
Related Modules:
None
Description:
Contains compiler-specific functions.
Modifications:
*/
/* Understanding this module means understanding the interface between
the g77 front end and the gcc back end (or, perhaps, some other
back end). In here are the functions called by the front end proper
to notify whatever back end is in place about certain things, and
also the back-end-specific functions. It's a bear to deal with, so
lately I've been trying to simplify things, especially with regard
to the gcc-back-end-specific stuff.
Building expressions generally seems quite easy, but building decls
has been challenging and is undergoing revision. gcc has several
kinds of decls:
TYPE_DECL -- a type (int, float, struct, function, etc.)
CONST_DECL -- a constant of some type other than function
LABEL_DECL -- a variable or a constant?
PARM_DECL -- an argument to a function (a variable that is a dummy)
RESULT_DECL -- the return value of a function (a variable)
VAR_DECL -- other variable (can hold a ptr-to-function, struct, int, etc.)
FUNCTION_DECL -- a function (either the actual function or an extern ref)
FIELD_DECL -- a field in a struct or union (goes into types)
g77 has a set of functions that somewhat parallels the gcc front end
when it comes to building decls:
Internal Function (one we define, not just declare as extern):
int yes;
yes = suspend_momentary ();
if (is_nested) push_f_function_context ();
start_function (get_identifier ("function_name"), function_type,
is_nested, is_public);
// for each arg, build PARM_DECL and call push_parm_decl (decl) with it;
store_parm_decls (is_main_program);
ffecom_start_compstmt_ ();
// for stmts and decls inside function, do appropriate things;
ffecom_end_compstmt_ ();
finish_function (is_nested);
if (is_nested) pop_f_function_context ();
if (is_nested) resume_momentary (yes);
Everything Else:
int yes;
tree d;
tree init;
yes = suspend_momentary ();
// fill in external, public, static, &c for decl, and
// set DECL_INITIAL to error_mark_node if going to initialize
// set is_top_level TRUE only if not at top level and decl
// must go in top level (i.e. not within current function decl context)
d = start_decl (decl, is_top_level);
init = ...; // if have initializer
finish_decl (d, init, is_top_level);
resume_momentary (yes);
*/
/* Include files. */
#include "proj.h"
#if FFECOM_targetCURRENT == FFECOM_targetGCC
#include "flags.j"
#include "rtl.j"
#include "toplev.j"
#include "tree.j"
#include "output.j" /* Must follow tree.j so TREE_CODE is defined! */
#include "convert.j"
#endif /* FFECOM_targetCURRENT == FFECOM_targetGCC */
#define FFECOM_GCC_INCLUDE 1 /* Enable -I. */
/* BEGIN stuff from gcc/cccp.c. */
/* The following symbols should be autoconfigured:
HAVE_FCNTL_H
HAVE_STDLIB_H
HAVE_SYS_TIME_H
HAVE_UNISTD_H
STDC_HEADERS
TIME_WITH_SYS_TIME
In the mean time, we'll get by with approximations based
on existing GCC configuration symbols. */
#ifdef POSIX
# ifndef HAVE_STDLIB_H
# define HAVE_STDLIB_H 1
# endif
# ifndef HAVE_UNISTD_H
# define HAVE_UNISTD_H 1
# endif
# ifndef STDC_HEADERS
# define STDC_HEADERS 1
# endif
#endif /* defined (POSIX) */
#if defined (POSIX) || (defined (USG) && !defined (VMS))
# ifndef HAVE_FCNTL_H
# define HAVE_FCNTL_H 1
# endif
#endif
#ifndef RLIMIT_STACK
# include <time.h>
#else
# if TIME_WITH_SYS_TIME
# include <sys/time.h>
# include <time.h>
# else
# if HAVE_SYS_TIME_H
# include <sys/time.h>
# else
# include <time.h>
# endif
# endif
# include <sys/resource.h>
#endif
#if HAVE_FCNTL_H
# include <fcntl.h>
#endif
/* This defines "errno" properly for VMS, and gives us EACCES. */
#include <errno.h>
#if HAVE_STDLIB_H
# include <stdlib.h>
#else
char *getenv ();
#endif
#if HAVE_UNISTD_H
# include <unistd.h>
#endif
/* VMS-specific definitions */
#ifdef VMS
#include <descrip.h>
#define O_RDONLY 0 /* Open arg for Read/Only */
#define O_WRONLY 1 /* Open arg for Write/Only */
#define read(fd,buf,size) VMS_read (fd,buf,size)
#define write(fd,buf,size) VMS_write (fd,buf,size)
#define open(fname,mode,prot) VMS_open (fname,mode,prot)
#define fopen(fname,mode) VMS_fopen (fname,mode)
#define freopen(fname,mode,ofile) VMS_freopen (fname,mode,ofile)
#define strncat(dst,src,cnt) VMS_strncat (dst,src,cnt)
#define fstat(fd,stbuf) VMS_fstat (fd,stbuf)
static int VMS_fstat (), VMS_stat ();
static char * VMS_strncat ();
static int VMS_read ();
static int VMS_write ();
static int VMS_open ();
static FILE * VMS_fopen ();
static FILE * VMS_freopen ();
static void hack_vms_include_specification ();
typedef struct { unsigned :16, :16, :16; } vms_ino_t;
#define ino_t vms_ino_t
#define INCLUDE_LEN_FUDGE 10 /* leave room for VMS syntax conversion */
#ifdef __GNUC__
#define BSTRING /* VMS/GCC supplies the bstring routines */
#endif /* __GNUC__ */
#endif /* VMS */
#ifndef O_RDONLY
#define O_RDONLY 0
#endif
/* END stuff from gcc/cccp.c. */
#define FFECOM_DETERMINE_TYPES 1 /* for com.h */
#include "com.h"
#include "bad.h"
#include "bld.h"
#include "equiv.h"
#include "expr.h"
#include "implic.h"
#include "info.h"
#include "malloc.h"
#include "src.h"
#include "st.h"
#include "storag.h"
#include "symbol.h"
#include "target.h"
#include "top.h"
#include "type.h"
/* Externals defined here. */
#define FFECOM_FASTER_ARRAY_REFS 0 /* Generates faster code? */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
/* tree.h declares a bunch of stuff that it expects the front end to
define. Here are the definitions, which in the C front end are
found in the file c-decl.c. */
tree integer_zero_node;
tree integer_one_node;
tree null_pointer_node;
tree error_mark_node;
tree void_type_node;
tree integer_type_node;
tree unsigned_type_node;
tree char_type_node;
tree current_function_decl;
/* ~~tree.h SHOULD declare this, because toplev.c and dwarfout.c reference
it. */
char *language_string = "GNU F77";
/* Stream for reading from the input file. */
FILE *finput;
/* These definitions parallel those in c-decl.c so that code from that
module can be used pretty much as is. Much of these defs aren't
otherwise used, i.e. by g77 code per se, except some of them are used
to build some of them that are. The ones that are global (i.e. not
"static") are those that ste.c and such might use (directly
or by using com macros that reference them in their definitions). */
static tree short_integer_type_node;
tree long_integer_type_node;
static tree long_long_integer_type_node;
static tree short_unsigned_type_node;
static tree long_unsigned_type_node;
static tree long_long_unsigned_type_node;
static tree unsigned_char_type_node;
static tree signed_char_type_node;
static tree float_type_node;
static tree double_type_node;
static tree complex_float_type_node;
tree complex_double_type_node;
static tree long_double_type_node;
static tree complex_integer_type_node;
static tree complex_long_double_type_node;
tree string_type_node;
static tree double_ftype_double;
static tree float_ftype_float;
static tree ldouble_ftype_ldouble;
/* The rest of these are inventions for g77, though there might be
similar things in the C front end. As they are found, these
inventions should be renamed to be canonical. Note that only
the ones currently required to be global are so. */
static tree ffecom_tree_fun_type_void;
static tree ffecom_tree_ptr_to_fun_type_void;
tree ffecom_integer_type_node; /* Abbrev for _tree_type[blah][blah]. */
tree ffecom_integer_zero_node; /* Like *_*_* with g77's integer type. */
tree ffecom_integer_one_node; /* " */
tree ffecom_tree_type[FFEINFO_basictype][FFEINFO_kindtype];
/* _fun_type things are the f2c-specific versions. For -fno-f2c,
just use build_function_type and build_pointer_type on the
appropriate _tree_type array element. */
static tree ffecom_tree_fun_type[FFEINFO_basictype][FFEINFO_kindtype];
static tree ffecom_tree_ptr_to_fun_type[FFEINFO_basictype][FFEINFO_kindtype];
static tree ffecom_tree_subr_type;
static tree ffecom_tree_ptr_to_subr_type;
static tree ffecom_tree_blockdata_type;
static tree ffecom_tree_xargc_;
ffecomSymbol ffecom_symbol_null_
=
{
NULL_TREE,
NULL_TREE,
NULL_TREE,
};
ffeinfoKindtype ffecom_pointer_kind_ = FFEINFO_basictypeNONE;
ffeinfoKindtype ffecom_label_kind_ = FFEINFO_basictypeNONE;
int ffecom_f2c_typecode_[FFEINFO_basictype][FFEINFO_kindtype];
tree ffecom_f2c_integer_type_node;
tree ffecom_f2c_ptr_to_integer_type_node;
tree ffecom_f2c_address_type_node;
tree ffecom_f2c_real_type_node;
tree ffecom_f2c_ptr_to_real_type_node;
tree ffecom_f2c_doublereal_type_node;
tree ffecom_f2c_complex_type_node;
tree ffecom_f2c_doublecomplex_type_node;
tree ffecom_f2c_longint_type_node;
tree ffecom_f2c_logical_type_node;
tree ffecom_f2c_flag_type_node;
tree ffecom_f2c_ftnlen_type_node;
tree ffecom_f2c_ftnlen_zero_node;
tree ffecom_f2c_ftnlen_one_node;
tree ffecom_f2c_ftnlen_two_node;
tree ffecom_f2c_ptr_to_ftnlen_type_node;
tree ffecom_f2c_ftnint_type_node;
tree ffecom_f2c_ptr_to_ftnint_type_node;
#endif /* FFECOM_targetCURRENT == FFECOM_targetGCC */
/* Simple definitions and enumerations. */
#ifndef FFECOM_sizeMAXSTACKITEM
#define FFECOM_sizeMAXSTACKITEM 32*1024 /* Keep user-declared things
larger than this # bytes
off stack if possible. */
#endif
/* For systems that have large enough stacks, they should define
this to 0, and here, for ease of use later on, we just undefine
it if it is 0. */
#if FFECOM_sizeMAXSTACKITEM == 0
#undef FFECOM_sizeMAXSTACKITEM
#endif
typedef enum
{
FFECOM_rttypeVOID_,
FFECOM_rttypeVOIDSTAR_, /* C's `void *' type. */
FFECOM_rttypeFTNINT_, /* f2c's `ftnint' type. */
FFECOM_rttypeINTEGER_, /* f2c's `integer' type. */
FFECOM_rttypeLONGINT_, /* f2c's `longint' type. */
FFECOM_rttypeLOGICAL_, /* f2c's `logical' type. */
FFECOM_rttypeREAL_F2C_, /* f2c's `real' returned as `double'. */
FFECOM_rttypeREAL_GNU_, /* `real' returned as such. */
FFECOM_rttypeCOMPLEX_F2C_, /* f2c's `complex' returned via 1st arg. */
FFECOM_rttypeCOMPLEX_GNU_, /* f2c's `complex' returned directly. */
FFECOM_rttypeDOUBLE_, /* C's `double' type. */
FFECOM_rttypeDOUBLEREAL_, /* f2c's `doublereal' type. */
FFECOM_rttypeDBLCMPLX_F2C_, /* f2c's `doublecomplex' returned via 1st arg. */
FFECOM_rttypeDBLCMPLX_GNU_, /* f2c's `doublecomplex' returned directly. */
FFECOM_rttypeCHARACTER_, /* f2c `char *'/`ftnlen' pair. */
FFECOM_rttype_
} ffecomRttype_;
/* Internal typedefs. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
typedef struct _ffecom_concat_list_ ffecomConcatList_;
typedef struct _ffecom_temp_ *ffecomTemp_;
#endif /* FFECOM_targetCURRENT == FFECOM_targetGCC */
/* Private include files. */
/* Internal structure definitions. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
struct _ffecom_concat_list_
{
ffebld *exprs;
int count;
int max;
ffetargetCharacterSize minlen;
ffetargetCharacterSize maxlen;
};
struct _ffecom_temp_
{
ffecomTemp_ next;
tree type; /* Base type (w/o size/array applied). */
tree t;
ffetargetCharacterSize size;
int elements;
bool in_use;
bool auto_pop;
};
#endif /* FFECOM_targetCURRENT == FFECOM_targetGCC */
/* Static functions (internal). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree ffecom_arglist_expr_ (char *argstring, ffebld args);
static tree ffecom_widest_expr_type_ (ffebld list);
static bool ffecom_overlap_ (tree dest_decl, tree dest_offset,
tree dest_size, tree source_tree,
ffebld source, bool scalar_arg);
static bool ffecom_args_overlapping_ (tree dest_tree, ffebld dest,
tree args, tree callee_commons,
bool scalar_args);
static tree ffecom_build_f2c_string_ (int i, char *s);
static tree ffecom_call_ (tree fn, ffeinfoKindtype kt,
bool is_f2c_complex, tree type,
tree args, tree dest_tree,
ffebld dest, bool *dest_used,
tree callee_commons, bool scalar_args);
static tree ffecom_call_binop_ (tree fn, ffeinfoKindtype kt,
bool is_f2c_complex, tree type,
ffebld left, ffebld right,
tree dest_tree, ffebld dest,
bool *dest_used, tree callee_commons,
bool scalar_args);
static void ffecom_char_args_x_ (tree *xitem, tree *length,
ffebld expr, bool with_null);
static tree ffecom_check_size_overflow_ (ffesymbol s, tree type, bool dummy);
static tree ffecom_char_enhance_arg_ (tree *xtype, ffesymbol s);
static ffecomConcatList_
ffecom_concat_list_gather_ (ffecomConcatList_ catlist,
ffebld expr,
ffetargetCharacterSize max);
static void ffecom_concat_list_kill_ (ffecomConcatList_ catlist);
static ffecomConcatList_ ffecom_concat_list_new_ (ffebld expr,
ffetargetCharacterSize max);
static void ffecom_debug_kludge_ (tree aggr, char *aggr_type, ffesymbol member,
tree member_type, ffetargetOffset offset);
static void ffecom_do_entry_ (ffesymbol fn, int entrynum);
static tree ffecom_expr_ (ffebld expr, tree dest_tree, ffebld dest,
bool *dest_used, bool assignp, bool widenp);
static tree ffecom_expr_intrinsic_ (ffebld expr, tree dest_tree,
ffebld dest, bool *dest_used);
static tree ffecom_expr_power_integer_ (ffebld left, ffebld right);
static void ffecom_expr_transform_ (ffebld expr);
static void ffecom_f2c_make_type_ (tree *type, int tcode, char *name);
static void ffecom_f2c_set_lio_code_ (ffeinfoBasictype bt, int size,
int code);
static ffeglobal ffecom_finish_global_ (ffeglobal global);
static ffesymbol ffecom_finish_symbol_transform_ (ffesymbol s);
static tree ffecom_get_appended_identifier_ (char us, char *text);
static tree ffecom_get_external_identifier_ (ffesymbol s);
static tree ffecom_get_identifier_ (char *text);
static tree ffecom_gen_sfuncdef_ (ffesymbol s,
ffeinfoBasictype bt,
ffeinfoKindtype kt);
static char *ffecom_gfrt_args_ (ffecomGfrt ix);
static tree ffecom_gfrt_tree_ (ffecomGfrt ix);
static tree ffecom_init_zero_ (tree decl);
static tree ffecom_intrinsic_ichar_ (tree tree_type, ffebld arg,
tree *maybe_tree);
static tree ffecom_intrinsic_len_ (ffebld expr);
static void ffecom_let_char_ (tree dest_tree,
tree dest_length,
ffetargetCharacterSize dest_size,
ffebld source);
static void ffecom_make_gfrt_ (ffecomGfrt ix);
static void ffecom_member_phase1_ (ffestorag mst, ffestorag st);
#ifdef SOMEONE_GETS_DEBUG_SUPPORT_WORKING
static void ffecom_member_phase2_ (ffestorag mst, ffestorag st);
#endif
static void ffecom_push_dummy_decls_ (ffebld dumlist,
bool stmtfunc);
static void ffecom_start_progunit_ (void);
static ffesymbol ffecom_sym_transform_ (ffesymbol s);
static ffesymbol ffecom_sym_transform_assign_ (ffesymbol s);
static void ffecom_transform_common_ (ffesymbol s);
static void ffecom_transform_equiv_ (ffestorag st);
static tree ffecom_transform_namelist_ (ffesymbol s);
static void ffecom_tree_canonize_ptr_ (tree *decl, tree *offset,
tree t);
static void ffecom_tree_canonize_ref_ (tree *decl, tree *offset,
tree *size, tree tree);
static tree ffecom_tree_divide_ (tree tree_type, tree left, tree right,
tree dest_tree, ffebld dest,
bool *dest_used);
static tree ffecom_type_localvar_ (ffesymbol s,
ffeinfoBasictype bt,
ffeinfoKindtype kt);
static tree ffecom_type_namelist_ (void);
#if 0
static tree ffecom_type_permanent_copy_ (tree t);
#endif
static tree ffecom_type_vardesc_ (void);
static tree ffecom_vardesc_ (ffebld expr);
static tree ffecom_vardesc_array_ (ffesymbol s);
static tree ffecom_vardesc_dims_ (ffesymbol s);
#endif /* FFECOM_targetCURRENT == FFECOM_targetGCC */
/* These are static functions that parallel those found in the C front
end and thus have the same names. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void bison_rule_compstmt_ (void);
static void bison_rule_pushlevel_ (void);
static tree builtin_function (char *name, tree type,
enum built_in_function function_code,
char *library_name);
static int duplicate_decls (tree newdecl, tree olddecl);
static void finish_decl (tree decl, tree init, bool is_top_level);
static void finish_function (int nested);
static char *lang_printable_name (tree decl, int v);
static tree lookup_name_current_level (tree name);
static struct binding_level *make_binding_level (void);
static void pop_f_function_context (void);
static void push_f_function_context (void);
static void push_parm_decl (tree parm);
static tree pushdecl_top_level (tree decl);
static tree storedecls (tree decls);
static void store_parm_decls (int is_main_program);
static tree start_decl (tree decl, bool is_top_level);
static void start_function (tree name, tree type, int nested, int public);
#endif /* FFECOM_targetCURRENT == FFECOM_targetGCC */
#if FFECOM_GCC_INCLUDE
static void ffecom_file_ (char *name);
static void ffecom_initialize_char_syntax_ (void);
static void ffecom_close_include_ (FILE *f);
static int ffecom_decode_include_option_ (char *spec);
static FILE *ffecom_open_include_ (char *name, ffewhereLine l,
ffewhereColumn c);
#endif /* FFECOM_GCC_INCLUDE */
/* Static objects accessed by functions in this module. */
static ffesymbol ffecom_primary_entry_ = NULL;
static ffesymbol ffecom_nested_entry_ = NULL;
static ffeinfoKind ffecom_primary_entry_kind_;
static bool ffecom_primary_entry_is_proc_;
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree ffecom_outer_function_decl_;
static tree ffecom_previous_function_decl_;
static tree ffecom_which_entrypoint_decl_;
static ffecomTemp_ ffecom_latest_temp_;
static int ffecom_pending_calls_ = 0;
static tree ffecom_float_zero_ = NULL_TREE;
static tree ffecom_float_half_ = NULL_TREE;
static tree ffecom_double_zero_ = NULL_TREE;
static tree ffecom_double_half_ = NULL_TREE;
static tree ffecom_func_result_;/* For functions. */
static tree ffecom_func_length_;/* For CHARACTER fns. */
static ffebld ffecom_list_blockdata_;
static ffebld ffecom_list_common_;
static ffebld ffecom_master_arglist_;
static ffeinfoBasictype ffecom_master_bt_;
static ffeinfoKindtype ffecom_master_kt_;
static ffetargetCharacterSize ffecom_master_size_;
static int ffecom_num_fns_ = 0;
static int ffecom_num_entrypoints_ = 0;
static bool ffecom_is_altreturning_ = FALSE;
static tree ffecom_multi_type_node_;
static tree ffecom_multi_retval_;
static tree
ffecom_multi_fields_[FFEINFO_basictype][FFEINFO_kindtype];
static bool ffecom_member_namelisted_; /* _member_phase1_ namelisted? */
static bool ffecom_doing_entry_ = FALSE;
static bool ffecom_transform_only_dummies_ = FALSE;
/* Holds pointer-to-function expressions. */
static tree ffecom_gfrt_[FFECOM_gfrt]
=
{
#define DEFGFRT(CODE,NAME,TYPE,ARGS,VOLATILE,COMPLEX) NULL_TREE,
#include "com-rt.def"
#undef DEFGFRT
};
/* Holds the external names of the functions. */
static char *ffecom_gfrt_name_[FFECOM_gfrt]
=
{
#define DEFGFRT(CODE,NAME,TYPE,ARGS,VOLATILE,COMPLEX) NAME,
#include "com-rt.def"
#undef DEFGFRT
};
/* Whether the function returns. */
static bool ffecom_gfrt_volatile_[FFECOM_gfrt]
=
{
#define DEFGFRT(CODE,NAME,TYPE,ARGS,VOLATILE,COMPLEX) VOLATILE,
#include "com-rt.def"
#undef DEFGFRT
};
/* Whether the function returns type complex. */
static bool ffecom_gfrt_complex_[FFECOM_gfrt]
=
{
#define DEFGFRT(CODE,NAME,TYPE,ARGS,VOLATILE,COMPLEX) COMPLEX,
#include "com-rt.def"
#undef DEFGFRT
};
/* Type code for the function return value. */
static ffecomRttype_ ffecom_gfrt_type_[FFECOM_gfrt]
=
{
#define DEFGFRT(CODE,NAME,TYPE,ARGS,VOLATILE,COMPLEX) TYPE,
#include "com-rt.def"
#undef DEFGFRT
};
/* String of codes for the function's arguments. */
static char *ffecom_gfrt_argstring_[FFECOM_gfrt]
=
{
#define DEFGFRT(CODE,NAME,TYPE,ARGS,VOLATILE,COMPLEX) ARGS,
#include "com-rt.def"
#undef DEFGFRT
};
#endif /* FFECOM_targetCURRENT == FFECOM_targetGCC */
/* Internal macros. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
/* We let tm.h override the types used here, to handle trivial differences
such as the choice of unsigned int or long unsigned int for size_t.
When machines start needing nontrivial differences in the size type,
it would be best to do something here to figure out automatically
from other information what type to use. */
/* NOTE: g77 currently doesn't use these; see setting of sizetype and
change that if you need to. -- jcb 09/01/91. */
#define ffecom_concat_list_count_(catlist) ((catlist).count)
#define ffecom_concat_list_expr_(catlist,i) ((catlist).exprs[(i)])
#define ffecom_concat_list_maxlen_(catlist) ((catlist).maxlen)
#define ffecom_concat_list_minlen_(catlist) ((catlist).minlen)
#define ffecom_start_compstmt_ bison_rule_pushlevel_
#define ffecom_end_compstmt_ bison_rule_compstmt_
#define ffecom_char_args_(i,l,e) ffecom_char_args_x_((i),(l),(e),FALSE)
#define ffecom_char_args_with_null_(i,l,e) ffecom_char_args_x_((i),(l),(e),TRUE)
/* For each binding contour we allocate a binding_level structure
* which records the names defined in that contour.
* Contours include:
* 0) the global one
* 1) one for each function definition,
* where internal declarations of the parameters appear.
*
* The current meaning of a name can be found by searching the levels from
* the current one out to the global one.
*/
/* Note that the information in the `names' component of the global contour
is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
struct binding_level
{
/* A chain of _DECL nodes for all variables, constants, functions, and
typedef types. These are in the reverse of the order supplied. */
tree names;
/* For each level (except not the global one), a chain of BLOCK nodes for
all the levels that were entered and exited one level down. */
tree blocks;
/* The BLOCK node for this level, if one has been preallocated. If 0, the
BLOCK is allocated (if needed) when the level is popped. */
tree this_block;
/* The binding level which this one is contained in (inherits from). */
struct binding_level *level_chain;
};
#define NULL_BINDING_LEVEL (struct binding_level *) NULL
/* The binding level currently in effect. */
static struct binding_level *current_binding_level;
/* A chain of binding_level structures awaiting reuse. */
static struct binding_level *free_binding_level;
/* The outermost binding level, for names of file scope.
This is created when the compiler is started and exists
through the entire run. */
static struct binding_level *global_binding_level;
/* Binding level structures are initialized by copying this one. */
static struct binding_level clear_binding_level
=
{NULL, NULL, NULL, NULL_BINDING_LEVEL};
/* Language-dependent contents of an identifier. */
struct lang_identifier
{
struct tree_identifier ignore;
tree global_value, local_value, label_value;
bool invented;
};
/* Macros for access to language-specific slots in an identifier. */
/* Each of these slots contains a DECL node or null. */
/* This represents the value which the identifier has in the
file-scope namespace. */
#define IDENTIFIER_GLOBAL_VALUE(NODE) \
(((struct lang_identifier *)(NODE))->global_value)
/* This represents the value which the identifier has in the current
scope. */
#define IDENTIFIER_LOCAL_VALUE(NODE) \
(((struct lang_identifier *)(NODE))->local_value)
/* This represents the value which the identifier has as a label in
the current label scope. */
#define IDENTIFIER_LABEL_VALUE(NODE) \
(((struct lang_identifier *)(NODE))->label_value)
/* This is nonzero if the identifier was "made up" by g77 code. */
#define IDENTIFIER_INVENTED(NODE) \
(((struct lang_identifier *)(NODE))->invented)
/* In identifiers, C uses the following fields in a special way:
TREE_PUBLIC to record that there was a previous local extern decl.
TREE_USED to record that such a decl was used.
TREE_ADDRESSABLE to record that the address of such a decl was used. */
/* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
that have names. Here so we can clear out their names' definitions
at the end of the function. */
static tree named_labels;
/* A list of LABEL_DECLs from outer contexts that are currently shadowed. */
static tree shadowed_labels;
#endif /* FFECOM_targetCURRENT == FFECOM_targetGCC */
/* This is like gcc's stabilize_reference -- in fact, most of the code
comes from that -- but it handles the situation where the reference
is going to have its subparts picked at, and it shouldn't change
(or trigger extra invocations of functions in the subtrees) due to
this. save_expr is a bit overzealous, because we don't need the
entire thing calculated and saved like a temp. So, for DECLs, no
change is needed, because these are stable aggregates, and ARRAY_REF
and such might well be stable too, but for things like calculations,
we do need to calculate a snapshot of a value before picking at it. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_stabilize_aggregate_ (tree ref)
{
tree result;
enum tree_code code = TREE_CODE (ref);
switch (code)
{
case VAR_DECL:
case PARM_DECL:
case RESULT_DECL:
/* No action is needed in this case. */
return ref;
case NOP_EXPR:
case CONVERT_EXPR:
case FLOAT_EXPR:
case FIX_TRUNC_EXPR:
case FIX_FLOOR_EXPR:
case FIX_ROUND_EXPR:
case FIX_CEIL_EXPR:
result = build_nt (code, stabilize_reference (TREE_OPERAND (ref, 0)));
break;
case INDIRECT_REF:
result = build_nt (INDIRECT_REF,
stabilize_reference_1 (TREE_OPERAND (ref, 0)));
break;
case COMPONENT_REF:
result = build_nt (COMPONENT_REF,
stabilize_reference (TREE_OPERAND (ref, 0)),
TREE_OPERAND (ref, 1));
break;
case BIT_FIELD_REF:
result = build_nt (BIT_FIELD_REF,
stabilize_reference (TREE_OPERAND (ref, 0)),
stabilize_reference_1 (TREE_OPERAND (ref, 1)),
stabilize_reference_1 (TREE_OPERAND (ref, 2)));
break;
case ARRAY_REF:
result = build_nt (ARRAY_REF,
stabilize_reference (TREE_OPERAND (ref, 0)),
stabilize_reference_1 (TREE_OPERAND (ref, 1)));
break;
case COMPOUND_EXPR:
result = build_nt (COMPOUND_EXPR,
stabilize_reference_1 (TREE_OPERAND (ref, 0)),
stabilize_reference (TREE_OPERAND (ref, 1)));
break;
case RTL_EXPR:
result = build1 (INDIRECT_REF, TREE_TYPE (ref),
save_expr (build1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (ref)),
ref)));
break;
default:
return save_expr (ref);
case ERROR_MARK:
return error_mark_node;
}
TREE_TYPE (result) = TREE_TYPE (ref);
TREE_READONLY (result) = TREE_READONLY (ref);
TREE_SIDE_EFFECTS (result) = TREE_SIDE_EFFECTS (ref);
TREE_THIS_VOLATILE (result) = TREE_THIS_VOLATILE (ref);
TREE_RAISES (result) = TREE_RAISES (ref);
return result;
}
#endif
/* A rip-off of gcc's convert.c convert_to_complex function,
reworked to handle complex implemented as C structures
(RECORD_TYPE with two fields, real and imaginary `r' and `i'). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_convert_to_complex_ (tree type, tree expr)
{
register enum tree_code form = TREE_CODE (TREE_TYPE (expr));
tree subtype;
assert (TREE_CODE (type) == RECORD_TYPE);
subtype = TREE_TYPE (TYPE_FIELDS (type));
if (form == REAL_TYPE || form == INTEGER_TYPE || form == ENUMERAL_TYPE)
{
expr = convert (subtype, expr);
return ffecom_2 (COMPLEX_EXPR, type, expr,
convert (subtype, integer_zero_node));
}
if (form == RECORD_TYPE)
{
tree elt_type = TREE_TYPE (TYPE_FIELDS (TREE_TYPE (expr)));
if (TYPE_MAIN_VARIANT (elt_type) == TYPE_MAIN_VARIANT (subtype))
return expr;
else
{
expr = save_expr (expr);
return ffecom_2 (COMPLEX_EXPR,
type,
convert (subtype,
ffecom_1 (REALPART_EXPR,
TREE_TYPE (TYPE_FIELDS (TREE_TYPE (expr))),
expr)),
convert (subtype,
ffecom_1 (IMAGPART_EXPR,
TREE_TYPE (TYPE_FIELDS (TREE_TYPE (expr))),
expr)));
}
}
if (form == POINTER_TYPE || form == REFERENCE_TYPE)
error ("pointer value used where a complex was expected");
else
error ("aggregate value used where a complex was expected");
return ffecom_2 (COMPLEX_EXPR, type,
convert (subtype, integer_zero_node),
convert (subtype, integer_zero_node));
}
#endif
/* Like gcc's convert(), but crashes if widening might happen. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_convert_narrow_ (type, expr)
tree type, expr;
{
register tree e = expr;
register enum tree_code code = TREE_CODE (type);
if (type == TREE_TYPE (e)
|| TREE_CODE (e) == ERROR_MARK)
return e;
if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (TREE_TYPE (e)))
return fold (build1 (NOP_EXPR, type, e));
if (TREE_CODE (TREE_TYPE (e)) == ERROR_MARK
|| code == ERROR_MARK)
return error_mark_node;
if (TREE_CODE (TREE_TYPE (e)) == VOID_TYPE)
{
assert ("void value not ignored as it ought to be" == NULL);
return error_mark_node;
}
assert (code != VOID_TYPE);
if ((code != RECORD_TYPE)
&& (TREE_CODE (TREE_TYPE (e)) == RECORD_TYPE))
assert ("converting COMPLEX to REAL" == NULL);
assert (code != ENUMERAL_TYPE);
if (code == INTEGER_TYPE)
{
assert (TREE_CODE (TREE_TYPE (e)) == INTEGER_TYPE);
assert (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (e)));
return fold (convert_to_integer (type, e));
}
if (code == POINTER_TYPE)
{
assert (TREE_CODE (TREE_TYPE (e)) == POINTER_TYPE);
return fold (convert_to_pointer (type, e));
}
if (code == REAL_TYPE)
{
assert (TREE_CODE (TREE_TYPE (e)) == REAL_TYPE);
assert (TYPE_PRECISION (type) <= TYPE_PRECISION (TREE_TYPE (e)));
return fold (convert_to_real (type, e));
}
if (code == COMPLEX_TYPE)
{
assert (TREE_CODE (TREE_TYPE (e)) == COMPLEX_TYPE);
assert (TYPE_PRECISION (TREE_TYPE (type)) <= TYPE_PRECISION (TREE_TYPE (TREE_TYPE (e))));
return fold (convert_to_complex (type, e));
}
if (code == RECORD_TYPE)
{
assert (TREE_CODE (TREE_TYPE (e)) == RECORD_TYPE);
/* Check that at least the first field name agrees. */
assert (DECL_NAME (TYPE_FIELDS (type))
== DECL_NAME (TYPE_FIELDS (TREE_TYPE (e))));
assert (TYPE_PRECISION (TREE_TYPE (TYPE_FIELDS (type)))
<= TYPE_PRECISION (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (e)))));
if (TYPE_PRECISION (TREE_TYPE (TYPE_FIELDS (type)))
== TYPE_PRECISION (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (e)))))
return e;
return fold (ffecom_convert_to_complex_ (type, e));
}
assert ("conversion to non-scalar type requested" == NULL);
return error_mark_node;
}
#endif
/* Like gcc's convert(), but crashes if narrowing might happen. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_convert_widen_ (type, expr)
tree type, expr;
{
register tree e = expr;
register enum tree_code code = TREE_CODE (type);
if (type == TREE_TYPE (e)
|| TREE_CODE (e) == ERROR_MARK)
return e;
if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (TREE_TYPE (e)))
return fold (build1 (NOP_EXPR, type, e));
if (TREE_CODE (TREE_TYPE (e)) == ERROR_MARK
|| code == ERROR_MARK)
return error_mark_node;
if (TREE_CODE (TREE_TYPE (e)) == VOID_TYPE)
{
assert ("void value not ignored as it ought to be" == NULL);
return error_mark_node;
}
assert (code != VOID_TYPE);
if ((code != RECORD_TYPE)
&& (TREE_CODE (TREE_TYPE (e)) == RECORD_TYPE))
assert ("narrowing COMPLEX to REAL" == NULL);
assert (code != ENUMERAL_TYPE);
if (code == INTEGER_TYPE)
{
assert (TREE_CODE (TREE_TYPE (e)) == INTEGER_TYPE);
assert (TYPE_PRECISION (type) >= TYPE_PRECISION (TREE_TYPE (e)));
return fold (convert_to_integer (type, e));
}
if (code == POINTER_TYPE)
{
assert (TREE_CODE (TREE_TYPE (e)) == POINTER_TYPE);
return fold (convert_to_pointer (type, e));
}
if (code == REAL_TYPE)
{
assert (TREE_CODE (TREE_TYPE (e)) == REAL_TYPE);
assert (TYPE_PRECISION (type) >= TYPE_PRECISION (TREE_TYPE (e)));
return fold (convert_to_real (type, e));
}
if (code == COMPLEX_TYPE)
{
assert (TREE_CODE (TREE_TYPE (e)) == COMPLEX_TYPE);
assert (TYPE_PRECISION (TREE_TYPE (type)) >= TYPE_PRECISION (TREE_TYPE (TREE_TYPE (e))));
return fold (convert_to_complex (type, e));
}
if (code == RECORD_TYPE)
{
assert (TREE_CODE (TREE_TYPE (e)) == RECORD_TYPE);
/* Check that at least the first field name agrees. */
assert (DECL_NAME (TYPE_FIELDS (type))
== DECL_NAME (TYPE_FIELDS (TREE_TYPE (e))));
assert (TYPE_PRECISION (TREE_TYPE (TYPE_FIELDS (type)))
>= TYPE_PRECISION (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (e)))));
if (TYPE_PRECISION (TREE_TYPE (TYPE_FIELDS (type)))
== TYPE_PRECISION (TREE_TYPE (TYPE_FIELDS (TREE_TYPE (e)))))
return e;
return fold (ffecom_convert_to_complex_ (type, e));
}
assert ("conversion to non-scalar type requested" == NULL);
return error_mark_node;
}
#endif
/* Handles making a COMPLEX type, either the standard
(but buggy?) gbe way, or the safer (but less elegant?)
f2c way. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_make_complex_type_ (tree subtype)
{
tree type;
tree realfield;
tree imagfield;
if (ffe_is_emulate_complex ())
{
type = make_node (RECORD_TYPE);
realfield = ffecom_decl_field (type, NULL_TREE, "r", subtype);
imagfield = ffecom_decl_field (type, realfield, "i", subtype);
TYPE_FIELDS (type) = realfield;
layout_type (type);
}
else
{
type = make_node (COMPLEX_TYPE);
TREE_TYPE (type) = subtype;
layout_type (type);
}
return type;
}
#endif
/* Chooses either the gbe or the f2c way to build a
complex constant. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_build_complex_constant_ (tree type, tree realpart, tree imagpart)
{
tree bothparts;
if (ffe_is_emulate_complex ())
{
bothparts = build_tree_list (TYPE_FIELDS (type), realpart);
TREE_CHAIN (bothparts) = build_tree_list (TREE_CHAIN (TYPE_FIELDS (type)), imagpart);
bothparts = build (CONSTRUCTOR, type, NULL_TREE, bothparts);
}
else
{
bothparts = build_complex (type, realpart, imagpart);
}
return bothparts;
}
#endif
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_arglist_expr_ (char *c, ffebld expr)
{
tree list;
tree *plist = &list;
tree trail = NULL_TREE; /* Append char length args here. */
tree *ptrail = &trail;
tree length;
ffebld exprh;
tree item;
bool ptr = FALSE;
tree wanted = NULL_TREE;
static char zed[] = "0";
if (c == NULL)
c = &zed[0];
while (expr != NULL)
{
if (*c != '\0')
{
ptr = FALSE;
if (*c == '&')
{
ptr = TRUE;
++c;
}
switch (*(c++))
{
case '\0':
ptr = TRUE;
wanted = NULL_TREE;
break;
case 'a':
assert (ptr);
wanted = NULL_TREE;
break;
case 'c':
wanted = ffecom_f2c_complex_type_node;
break;
case 'd':
wanted = ffecom_f2c_doublereal_type_node;
break;
case 'e':
wanted = ffecom_f2c_doublecomplex_type_node;
break;
case 'f':
wanted = ffecom_f2c_real_type_node;
break;
case 'i':
wanted = ffecom_f2c_integer_type_node;
break;
case 'j':
wanted = ffecom_f2c_longint_type_node;
break;
default:
assert ("bad argstring code" == NULL);
wanted = NULL_TREE;
break;
}
}
exprh = ffebld_head (expr);
if (exprh == NULL)
wanted = NULL_TREE;
if ((wanted == NULL_TREE)
|| (ptr
&& (TYPE_MODE
(ffecom_tree_type[ffeinfo_basictype (ffebld_info (exprh))]
[ffeinfo_kindtype (ffebld_info (exprh))])
== TYPE_MODE (wanted))))
*plist
= build_tree_list (NULL_TREE,
ffecom_arg_ptr_to_expr (exprh,
&length));
else
{
item = ffecom_arg_expr (exprh, &length);
item = ffecom_convert_widen_ (wanted, item);
if (ptr)
{
item = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (item)),
item);
}
*plist
= build_tree_list (NULL_TREE,
item);
}
plist = &TREE_CHAIN (*plist);
expr = ffebld_trail (expr);
if (length != NULL_TREE)
{
*ptrail = build_tree_list (NULL_TREE, length);
ptrail = &TREE_CHAIN (*ptrail);
}
}
/* We've run out of args in the call; if the implementation expects
more, supply null pointers for them, which the implementation can
check to see if an arg was omitted. */
while (*c != '\0' && *c != '0')
{
if (*c == '&')
++c;
else
assert ("missing arg to run-time routine!" == NULL);
switch (*(c++))
{
case '\0':
case 'a':
case 'c':
case 'd':
case 'e':
case 'f':
case 'i':
case 'j':
break;
default:
assert ("bad arg string code" == NULL);
break;
}
*plist
= build_tree_list (NULL_TREE,
null_pointer_node);
plist = &TREE_CHAIN (*plist);
}
*plist = trail;
return list;
}
#endif
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_widest_expr_type_ (ffebld list)
{
ffebld item;
ffebld widest = NULL;
ffetype type;
ffetype widest_type = NULL;
tree t;
for (; list != NULL; list = ffebld_trail (list))
{
item = ffebld_head (list);
if (item == NULL)
continue;
if ((widest != NULL)
&& (ffeinfo_basictype (ffebld_info (item))
!= ffeinfo_basictype (ffebld_info (widest))))
continue;
type = ffeinfo_type (ffeinfo_basictype (ffebld_info (item)),
ffeinfo_kindtype (ffebld_info (item)));
if ((widest == FFEINFO_kindtypeNONE)
|| (ffetype_size (type)
> ffetype_size (widest_type)))
{
widest = item;
widest_type = type;
}
}
assert (widest != NULL);
t = ffecom_tree_type[ffeinfo_basictype (ffebld_info (widest))]
[ffeinfo_kindtype (ffebld_info (widest))];
assert (t != NULL_TREE);
return t;
}
#endif
/* Check whether dest and source might overlap. ffebld versions of these
might or might not be passed, will be NULL if not.
The test is really whether source_tree is modifiable and, if modified,
might overlap destination such that the value(s) in the destination might
change before it is finally modified. dest_* are the canonized
destination itself. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static bool
ffecom_overlap_ (tree dest_decl, tree dest_offset, tree dest_size,
tree source_tree, ffebld source UNUSED,
bool scalar_arg)
{
tree source_decl;
tree source_offset;
tree source_size;
tree t;
if (source_tree == NULL_TREE)
return FALSE;
switch (TREE_CODE (source_tree))
{
case ERROR_MARK:
case IDENTIFIER_NODE:
case INTEGER_CST:
case REAL_CST:
case COMPLEX_CST:
case STRING_CST:
case CONST_DECL:
case VAR_DECL:
case RESULT_DECL:
case FIELD_DECL:
case MINUS_EXPR:
case MULT_EXPR:
case TRUNC_DIV_EXPR:
case CEIL_DIV_EXPR:
case FLOOR_DIV_EXPR:
case ROUND_DIV_EXPR:
case TRUNC_MOD_EXPR:
case CEIL_MOD_EXPR:
case FLOOR_MOD_EXPR:
case ROUND_MOD_EXPR:
case RDIV_EXPR:
case EXACT_DIV_EXPR:
case FIX_TRUNC_EXPR:
case FIX_CEIL_EXPR:
case FIX_FLOOR_EXPR:
case FIX_ROUND_EXPR:
case FLOAT_EXPR:
case EXPON_EXPR:
case NEGATE_EXPR:
case MIN_EXPR:
case MAX_EXPR:
case ABS_EXPR:
case FFS_EXPR:
case LSHIFT_EXPR:
case RSHIFT_EXPR:
case LROTATE_EXPR:
case RROTATE_EXPR:
case BIT_IOR_EXPR:
case BIT_XOR_EXPR:
case BIT_AND_EXPR:
case BIT_ANDTC_EXPR:
case BIT_NOT_EXPR:
case TRUTH_ANDIF_EXPR:
case TRUTH_ORIF_EXPR:
case TRUTH_AND_EXPR:
case TRUTH_OR_EXPR:
case TRUTH_XOR_EXPR:
case TRUTH_NOT_EXPR:
case LT_EXPR:
case LE_EXPR:
case GT_EXPR:
case GE_EXPR:
case EQ_EXPR:
case NE_EXPR:
case COMPLEX_EXPR:
case CONJ_EXPR:
case REALPART_EXPR:
case IMAGPART_EXPR:
case LABEL_EXPR:
case COMPONENT_REF:
return FALSE;
case COMPOUND_EXPR:
return ffecom_overlap_ (dest_decl, dest_offset, dest_size,
TREE_OPERAND (source_tree, 1), NULL,
scalar_arg);
case MODIFY_EXPR:
return ffecom_overlap_ (dest_decl, dest_offset, dest_size,
TREE_OPERAND (source_tree, 0), NULL,
scalar_arg);
case CONVERT_EXPR:
case NOP_EXPR:
case NON_LVALUE_EXPR:
case PLUS_EXPR:
if (TREE_CODE (TREE_TYPE (source_tree)) != POINTER_TYPE)
return TRUE;
ffecom_tree_canonize_ptr_ (&source_decl, &source_offset,
source_tree);
source_size = TYPE_SIZE (TREE_TYPE (TREE_TYPE (source_tree)));
break;
case COND_EXPR:
return
ffecom_overlap_ (dest_decl, dest_offset, dest_size,
TREE_OPERAND (source_tree, 1), NULL,
scalar_arg)
|| ffecom_overlap_ (dest_decl, dest_offset, dest_size,
TREE_OPERAND (source_tree, 2), NULL,
scalar_arg);
case ADDR_EXPR:
ffecom_tree_canonize_ref_ (&source_decl, &source_offset,
&source_size,
TREE_OPERAND (source_tree, 0));
break;
case PARM_DECL:
if (TREE_CODE (TREE_TYPE (source_tree)) != POINTER_TYPE)
return TRUE;
source_decl = source_tree;
source_offset = size_zero_node;
source_size = TYPE_SIZE (TREE_TYPE (TREE_TYPE (source_tree)));
break;
case SAVE_EXPR:
case REFERENCE_EXPR:
case PREDECREMENT_EXPR:
case PREINCREMENT_EXPR:
case POSTDECREMENT_EXPR:
case POSTINCREMENT_EXPR:
case INDIRECT_REF:
case ARRAY_REF:
case CALL_EXPR:
default:
return TRUE;
}
/* Come here when source_decl, source_offset, and source_size filled
in appropriately. */
if (source_decl == NULL_TREE)
return FALSE; /* No decl involved, so no overlap. */
if (source_decl != dest_decl)
return FALSE; /* Different decl, no overlap. */
if (TREE_CODE (dest_size) == ERROR_MARK)
return TRUE; /* Assignment into entire assumed-size
array? Shouldn't happen.... */
t = ffecom_2 (LE_EXPR, integer_type_node,
ffecom_2 (PLUS_EXPR, TREE_TYPE (dest_offset),
dest_offset,
convert (TREE_TYPE (dest_offset),
dest_size)),
convert (TREE_TYPE (dest_offset),
source_offset));
if (integer_onep (t))
return FALSE; /* Destination precedes source. */
if (!scalar_arg
|| (source_size == NULL_TREE)
|| (TREE_CODE (source_size) == ERROR_MARK)
|| integer_zerop (source_size))
return TRUE; /* No way to tell if dest follows source. */
t = ffecom_2 (LE_EXPR, integer_type_node,
ffecom_2 (PLUS_EXPR, TREE_TYPE (source_offset),
source_offset,
convert (TREE_TYPE (source_offset),
source_size)),
convert (TREE_TYPE (source_offset),
dest_offset));
if (integer_onep (t))
return FALSE; /* Destination follows source. */
return TRUE; /* Destination and source overlap. */
}
#endif
/* Check whether dest might overlap any of a list of arguments or is
in a COMMON area the callee might know about (and thus modify). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static bool
ffecom_args_overlapping_ (tree dest_tree, ffebld dest UNUSED,
tree args, tree callee_commons,
bool scalar_args)
{
tree arg;
tree dest_decl;
tree dest_offset;
tree dest_size;
ffecom_tree_canonize_ref_ (&dest_decl, &dest_offset, &dest_size,
dest_tree);
if (dest_decl == NULL_TREE)
return FALSE; /* Seems unlikely! */
/* If the decl cannot be determined reliably, or if its in COMMON
and the callee isn't known to not futz with COMMON via other
means, overlap might happen. */
if ((TREE_CODE (dest_decl) == ERROR_MARK)
|| ((callee_commons != NULL_TREE)
&& TREE_PUBLIC (dest_decl)))
return TRUE;
for (; args != NULL_TREE; args = TREE_CHAIN (args))
{
if (((arg = TREE_VALUE (args)) != NULL_TREE)
&& ffecom_overlap_ (dest_decl, dest_offset, dest_size,
arg, NULL, scalar_args))
return TRUE;
}
return FALSE;
}
#endif
/* Build a string for a variable name as used by NAMELIST. This means that
if we're using the f2c library, we build an uppercase string, since
f2c does this. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_build_f2c_string_ (int i, char *s)
{
if (!ffe_is_f2c_library ())
return build_string (i, s);
{
char *tmp;
char *p;
char *q;
char space[34];
tree t;
if (((size_t) i) > ARRAY_SIZE (space))
tmp = malloc_new_ks (malloc_pool_image (), "f2c_string", i);
else
tmp = &space[0];
for (p = s, q = tmp; *p != '\0'; ++p, ++q)
*q = ffesrc_toupper (*p);
*q = '\0';
t = build_string (i, tmp);
if (((size_t) i) > ARRAY_SIZE (space))
malloc_kill_ks (malloc_pool_image (), tmp, i);
return t;
}
}
#endif
/* Returns CALL_EXPR or equivalent with given type (pass NULL_TREE for
type to just get whatever the function returns), handling the
f2c value-returning convention, if required, by prepending
to the arglist a pointer to a temporary to receive the return value. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_call_ (tree fn, ffeinfoKindtype kt, bool is_f2c_complex,
tree type, tree args, tree dest_tree,
ffebld dest, bool *dest_used, tree callee_commons,
bool scalar_args)
{
tree item;
tree tempvar;
if (dest_used != NULL)
*dest_used = FALSE;
if (is_f2c_complex)
{
if ((dest_used == NULL)
|| (dest == NULL)
|| (ffeinfo_basictype (ffebld_info (dest))
!= FFEINFO_basictypeCOMPLEX)
|| (ffeinfo_kindtype (ffebld_info (dest)) != kt)
|| ((type != NULL_TREE) && (TREE_TYPE (dest_tree) != type))
|| ffecom_args_overlapping_ (dest_tree, dest, args,
callee_commons,
scalar_args))
{
tempvar = ffecom_push_tempvar (ffecom_tree_type
[FFEINFO_basictypeCOMPLEX][kt],
FFETARGET_charactersizeNONE,
-1, TRUE);
}
else
{
*dest_used = TRUE;
tempvar = dest_tree;
type = NULL_TREE;
}
item
= build_tree_list (NULL_TREE,
ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (tempvar)),
tempvar));
TREE_CHAIN (item) = args;
item = ffecom_3s (CALL_EXPR, TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))), fn,
item, NULL_TREE);
if (tempvar != dest_tree)
item = ffecom_2 (COMPOUND_EXPR, TREE_TYPE (tempvar), item, tempvar);
}
else
item = ffecom_3s (CALL_EXPR, TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))), fn,
args, NULL_TREE);
if ((type != NULL_TREE) && (TREE_TYPE (item) != type))
item = ffecom_convert_narrow_ (type, item);
return item;
}
#endif
/* Given two arguments, transform them and make a call to the given
function via ffecom_call_. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_call_binop_ (tree fn, ffeinfoKindtype kt, bool is_f2c_complex,
tree type, ffebld left, ffebld right,
tree dest_tree, ffebld dest, bool *dest_used,
tree callee_commons, bool scalar_args)
{
tree left_tree;
tree right_tree;
tree left_length;
tree right_length;
ffecom_push_calltemps ();
left_tree = ffecom_arg_ptr_to_expr (left, &left_length);
right_tree = ffecom_arg_ptr_to_expr (right, &right_length);
ffecom_pop_calltemps ();
left_tree = build_tree_list (NULL_TREE, left_tree);
right_tree = build_tree_list (NULL_TREE, right_tree);
TREE_CHAIN (left_tree) = right_tree;
if (left_length != NULL_TREE)
{
left_length = build_tree_list (NULL_TREE, left_length);
TREE_CHAIN (right_tree) = left_length;
}
if (right_length != NULL_TREE)
{
right_length = build_tree_list (NULL_TREE, right_length);
if (left_length != NULL_TREE)
TREE_CHAIN (left_length) = right_length;
else
TREE_CHAIN (right_tree) = right_length;
}
return ffecom_call_ (fn, kt, is_f2c_complex, type, left_tree,
dest_tree, dest, dest_used, callee_commons,
scalar_args);
}
#endif
/* ffecom_char_args_x_ -- Return ptr/length args for char subexpression
tree ptr_arg;
tree length_arg;
ffebld expr;
bool with_null;
ffecom_char_args_x_(&ptr_arg,&length_arg,expr,with_null);
Handles CHARACTER-type CONTER, SYMTER, SUBSTR, ARRAYREF, and FUNCREF
subexpressions by constructing the appropriate trees for the ptr-to-
character-text and length-of-character-text arguments in a calling
sequence.
Note that if with_null is TRUE, and the expression is an opCONTER,
a null byte is appended to the string. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_char_args_x_ (tree *xitem, tree *length, ffebld expr, bool with_null)
{
tree item;
tree high;
ffetargetCharacter1 val;
ffetargetCharacterSize newlen;
switch (ffebld_op (expr))
{
case FFEBLD_opCONTER:
val = ffebld_constant_character1 (ffebld_conter (expr));
newlen = ffetarget_length_character1 (val);
if (with_null)
{
if (newlen != 0)
++newlen; /* begin FFETARGET-NULL-KLUDGE. */
}
*length = build_int_2 (newlen, 0);
TREE_TYPE (*length) = ffecom_f2c_ftnlen_type_node;
high = build_int_2 (newlen, 0);
TREE_TYPE (high) = ffecom_f2c_ftnlen_type_node;
item = build_string (newlen, /* end FFETARGET-NULL-KLUDGE. */
ffetarget_text_character1 (val));
TREE_TYPE (item)
= build_type_variant
(build_array_type
(char_type_node,
build_range_type
(ffecom_f2c_ftnlen_type_node,
ffecom_f2c_ftnlen_one_node,
high)),
1, 0);
TREE_CONSTANT (item) = 1;
TREE_STATIC (item) = 1;
item = ffecom_1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (item)),
item);
break;
case FFEBLD_opSYMTER:
{
ffesymbol s = ffebld_symter (expr);
item = ffesymbol_hook (s).decl_tree;
if (item == NULL_TREE)
{
s = ffecom_sym_transform_ (s);
item = ffesymbol_hook (s).decl_tree;
}
if (ffesymbol_kind (s) == FFEINFO_kindENTITY)
{
if (ffesymbol_size (s) == FFETARGET_charactersizeNONE)
*length = ffesymbol_hook (s).length_tree;
else
{
*length = build_int_2 (ffesymbol_size (s), 0);
TREE_TYPE (*length) = ffecom_f2c_ftnlen_type_node;
}
}
else if (item == error_mark_node)
*length = error_mark_node;
else /* FFEINFO_kindFUNCTION: */
*length = NULL_TREE;
if (!ffesymbol_hook (s).addr
&& (item != error_mark_node))
item = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (item)),
item);
}
break;
case FFEBLD_opARRAYREF:
{
ffebld dims[FFECOM_dimensionsMAX];
tree array;
int i;
ffecom_push_calltemps ();
ffecom_char_args_ (&item, length, ffebld_left (expr));
ffecom_pop_calltemps ();
if (item == error_mark_node || *length == error_mark_node)
{
item = *length = error_mark_node;
break;
}
/* Build up ARRAY_REFs in reverse order (since we're column major
here in Fortran land). */
for (i = 0, expr = ffebld_right (expr);
expr != NULL;
expr = ffebld_trail (expr))
dims[i++] = ffebld_head (expr);
for (--i, array = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (item)));
i >= 0;
--i, array = TYPE_MAIN_VARIANT (TREE_TYPE (array)))
{
item = ffecom_2 (PLUS_EXPR, build_pointer_type (TREE_TYPE (array)),
item,
size_binop (MULT_EXPR,
size_in_bytes (TREE_TYPE (array)),
size_binop (MINUS_EXPR,
ffecom_expr (dims[i]),
TYPE_MIN_VALUE (TYPE_DOMAIN (array)))));
}
}
break;
case FFEBLD_opSUBSTR:
{
ffebld start;
ffebld end;
ffebld thing = ffebld_right (expr);
tree start_tree;
tree end_tree;
assert (ffebld_op (thing) == FFEBLD_opITEM);
start = ffebld_head (thing);
thing = ffebld_trail (thing);
assert (ffebld_trail (thing) == NULL);
end = ffebld_head (thing);
ffecom_push_calltemps ();
ffecom_char_args_ (&item, length, ffebld_left (expr));
ffecom_pop_calltemps ();
if (item == error_mark_node || *length == error_mark_node)
{
item = *length = error_mark_node;
break;
}
if (start == NULL)
{
if (end == NULL)
;
else
{
end_tree = convert (ffecom_f2c_ftnlen_type_node,
ffecom_expr (end));
if (end_tree == error_mark_node)
{
item = *length = error_mark_node;
break;
}
*length = end_tree;
}
}
else
{
start_tree = convert (ffecom_f2c_ftnlen_type_node,
ffecom_expr (start));
if (start_tree == error_mark_node)
{
item = *length = error_mark_node;
break;
}
start_tree = ffecom_save_tree (start_tree);
item = ffecom_2 (PLUS_EXPR, TREE_TYPE (item),
item,
ffecom_2 (MINUS_EXPR,
TREE_TYPE (start_tree),
start_tree,
ffecom_f2c_ftnlen_one_node));
if (end == NULL)
{
*length = ffecom_2 (PLUS_EXPR, ffecom_f2c_ftnlen_type_node,
ffecom_f2c_ftnlen_one_node,
ffecom_2 (MINUS_EXPR,
ffecom_f2c_ftnlen_type_node,
*length,
start_tree));
}
else
{
end_tree = convert (ffecom_f2c_ftnlen_type_node,
ffecom_expr (end));
if (end_tree == error_mark_node)
{
item = *length = error_mark_node;
break;
}
*length = ffecom_2 (PLUS_EXPR, ffecom_f2c_ftnlen_type_node,
ffecom_f2c_ftnlen_one_node,
ffecom_2 (MINUS_EXPR,
ffecom_f2c_ftnlen_type_node,
end_tree, start_tree));
}
}
}
break;
case FFEBLD_opFUNCREF:
{
ffesymbol s = ffebld_symter (ffebld_left (expr));
tree tempvar;
tree args;
ffetargetCharacterSize size = ffeinfo_size (ffebld_info (expr));
ffecomGfrt ix;
if (size == FFETARGET_charactersizeNONE)
size = 24; /* ~~~~ Kludge alert! This should someday be fixed. */
*length = build_int_2 (size, 0);
TREE_TYPE (*length) = ffecom_f2c_ftnlen_type_node;
if (ffeinfo_where (ffebld_info (ffebld_left (expr)))
== FFEINFO_whereINTRINSIC)
{
if (size == 1)
{ /* Invocation of an intrinsic returning CHARACTER*1. */
item = ffecom_expr_intrinsic_ (expr, NULL_TREE,
NULL, NULL);
break;
}
ix = ffeintrin_gfrt_direct (ffebld_symter_implementation (ffebld_left (expr)));
assert (ix != FFECOM_gfrt);
item = ffecom_gfrt_tree_ (ix);
}
else
{
ix = FFECOM_gfrt;
item = ffesymbol_hook (s).decl_tree;
if (item == NULL_TREE)
{
s = ffecom_sym_transform_ (s);
item = ffesymbol_hook (s).decl_tree;
}
if (item == error_mark_node)
{
item = *length = error_mark_node;
break;
}
if (!ffesymbol_hook (s).addr)
item = ffecom_1_fn (item);
}
assert (ffecom_pending_calls_ != 0);
tempvar = ffecom_push_tempvar (char_type_node, size, -1, TRUE);
tempvar = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (tempvar)),
tempvar);
ffecom_push_calltemps ();
args = build_tree_list (NULL_TREE, tempvar);
if (ffesymbol_where (s) == FFEINFO_whereCONSTANT) /* Sfunc args by value. */
TREE_CHAIN (args) = ffecom_list_expr (ffebld_right (expr));
else
{
TREE_CHAIN (args) = build_tree_list (NULL_TREE, *length);
if (ffesymbol_where (s) == FFEINFO_whereINTRINSIC)
{
TREE_CHAIN (TREE_CHAIN (args))
= ffecom_arglist_expr_ (ffecom_gfrt_args_ (ix),
ffebld_right (expr));
}
else
{
TREE_CHAIN (TREE_CHAIN (args))
= ffecom_list_ptr_to_expr (ffebld_right (expr));
}
}
item = ffecom_3s (CALL_EXPR,
TREE_TYPE (TREE_TYPE (TREE_TYPE (item))),
item, args, NULL_TREE);
item = ffecom_2 (COMPOUND_EXPR, TREE_TYPE (tempvar), item,
tempvar);
ffecom_pop_calltemps ();
}
break;
case FFEBLD_opCONVERT:
ffecom_push_calltemps ();
ffecom_char_args_ (&item, length, ffebld_left (expr));
ffecom_pop_calltemps ();
if (item == error_mark_node || *length == error_mark_node)
{
item = *length = error_mark_node;
break;
}
if ((ffebld_size_known (ffebld_left (expr))
== FFETARGET_charactersizeNONE)
|| (ffebld_size_known (ffebld_left (expr)) < (ffebld_size (expr))))
{ /* Possible blank-padding needed, copy into
temporary. */
tree tempvar;
tree args;
tree newlen;
assert (ffecom_pending_calls_ != 0);
tempvar = ffecom_push_tempvar (char_type_node,
ffebld_size (expr), -1, TRUE);
tempvar = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (tempvar)),
tempvar);
newlen = build_int_2 (ffebld_size (expr), 0);
TREE_TYPE (newlen) = ffecom_f2c_ftnlen_type_node;
args = build_tree_list (NULL_TREE, tempvar);
TREE_CHAIN (args) = build_tree_list (NULL_TREE, item);
TREE_CHAIN (TREE_CHAIN (args)) = build_tree_list (NULL_TREE, newlen);
TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (args)))
= build_tree_list (NULL_TREE, *length);
item = ffecom_call_gfrt (FFECOM_gfrtCOPY, args);
TREE_SIDE_EFFECTS (item) = 1;
item = ffecom_2 (COMPOUND_EXPR, TREE_TYPE (tempvar), fold (item),
tempvar);
*length = newlen;
}
else
{ /* Just truncate the length. */
*length = build_int_2 (ffebld_size (expr), 0);
TREE_TYPE (*length) = ffecom_f2c_ftnlen_type_node;
}
break;
default:
assert ("bad op for single char arg expr" == NULL);
item = NULL_TREE;
break;
}
*xitem = item;
}
#endif
/* Check the size of the type to be sure it doesn't overflow the
"portable" capacities of the compiler back end. `dummy' types
can generally overflow the normal sizes as long as the computations
themselves don't overflow. A particular target of the back end
must still enforce its size requirements, though, and the back
end takes care of this in stor-layout.c. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_check_size_overflow_ (ffesymbol s, tree type, bool dummy)
{
if (TREE_CODE (type) == ERROR_MARK)
return type;
if (TYPE_SIZE (type) == NULL_TREE)
return type;
if (TREE_CODE (TYPE_SIZE (type)) != INTEGER_CST)
return type;
if ((tree_int_cst_sgn (TYPE_SIZE (type)) < 0)
|| (!dummy && (((TREE_INT_CST_HIGH (TYPE_SIZE (type)) != 0))
|| TREE_OVERFLOW (TYPE_SIZE (type)))))
{
ffebad_start (FFEBAD_ARRAY_LARGE);
ffebad_string (ffesymbol_text (s));
ffebad_here (0, ffesymbol_where_line (s), ffesymbol_where_column (s));
ffebad_finish ();
return error_mark_node;
}
return type;
}
#endif
/* Builds a length argument (PARM_DECL). Also wraps type in an array type
where the dimension info is (1:size) where <size> is ffesymbol_size(s) if
known, length_arg if not known (FFETARGET_charactersizeNONE). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_char_enhance_arg_ (tree *xtype, ffesymbol s)
{
ffetargetCharacterSize sz = ffesymbol_size (s);
tree highval;
tree tlen;
tree type = *xtype;
if (ffesymbol_where (s) == FFEINFO_whereCONSTANT)
tlen = NULL_TREE; /* A statement function, no length passed. */
else
{
if (ffesymbol_where (s) == FFEINFO_whereDUMMY)
tlen = ffecom_get_invented_identifier ("__g77_length_%s",
ffesymbol_text (s), 0);
else
tlen = ffecom_get_invented_identifier ("__g77_%s",
"length", 0);
tlen = build_decl (PARM_DECL, tlen, ffecom_f2c_ftnlen_type_node);
#if BUILT_FOR_270
DECL_ARTIFICIAL (tlen) = 1;
#endif
}
if (sz == FFETARGET_charactersizeNONE)
{
assert (tlen != NULL_TREE);
highval = variable_size (tlen);
}
else
{
highval = build_int_2 (sz, 0);
TREE_TYPE (highval) = ffecom_f2c_ftnlen_type_node;
}
type = build_array_type (type,
build_range_type (ffecom_f2c_ftnlen_type_node,
ffecom_f2c_ftnlen_one_node,
highval));
*xtype = type;
return tlen;
}
#endif
/* ffecom_concat_list_gather_ -- Gather list of concatenated string exprs
ffecomConcatList_ catlist;
ffebld expr; // expr of CHARACTER basictype.
ffetargetCharacterSize max; // max chars to gather or _...NONE if no max
catlist = ffecom_concat_list_gather_(catlist,expr,max);
Scans expr for character subexpressions, updates and returns catlist
accordingly. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static ffecomConcatList_
ffecom_concat_list_gather_ (ffecomConcatList_ catlist, ffebld expr,
ffetargetCharacterSize max)
{
ffetargetCharacterSize sz;
recurse: /* :::::::::::::::::::: */
if (expr == NULL)
return catlist;
if ((max != FFETARGET_charactersizeNONE) && (catlist.minlen >= max))
return catlist; /* Don't append any more items. */
switch (ffebld_op (expr))
{
case FFEBLD_opCONTER:
case FFEBLD_opSYMTER:
case FFEBLD_opARRAYREF:
case FFEBLD_opFUNCREF:
case FFEBLD_opSUBSTR:
case FFEBLD_opCONVERT: /* Callers should strip this off beforehand
if they don't need to preserve it. */
if (catlist.count == catlist.max)
{ /* Make a (larger) list. */
ffebld *newx;
int newmax;
newmax = (catlist.max == 0) ? 8 : catlist.max * 2;
newx = malloc_new_ks (malloc_pool_image (), "catlist",
newmax * sizeof (newx[0]));
if (catlist.max != 0)
{
memcpy (newx, catlist.exprs, catlist.max * sizeof (newx[0]));
malloc_kill_ks (malloc_pool_image (), catlist.exprs,
catlist.max * sizeof (newx[0]));
}
catlist.max = newmax;
catlist.exprs = newx;
}
if ((sz = ffebld_size_known (expr)) != FFETARGET_charactersizeNONE)
catlist.minlen += sz;
else
++catlist.minlen; /* Not true for F90; can be 0 length. */
if ((sz = ffebld_size_max (expr)) == FFETARGET_charactersizeNONE)
catlist.maxlen = sz;
else
catlist.maxlen += sz;
if ((max != FFETARGET_charactersizeNONE) && (catlist.minlen > max))
{ /* This item overlaps (or is beyond) the end
of the destination. */
switch (ffebld_op (expr))
{
case FFEBLD_opCONTER:
case FFEBLD_opSYMTER:
case FFEBLD_opARRAYREF:
case FFEBLD_opFUNCREF:
case FFEBLD_opSUBSTR:
break; /* ~~Do useful truncations here. */
default:
assert ("op changed or inconsistent switches!" == NULL);
break;
}
}
catlist.exprs[catlist.count++] = expr;
return catlist;
case FFEBLD_opPAREN:
expr = ffebld_left (expr);
goto recurse; /* :::::::::::::::::::: */
case FFEBLD_opCONCATENATE:
catlist = ffecom_concat_list_gather_ (catlist, ffebld_left (expr), max);
expr = ffebld_right (expr);
goto recurse; /* :::::::::::::::::::: */
#if 0 /* Breaks passing small actual arg to larger
dummy arg of sfunc */
case FFEBLD_opCONVERT:
expr = ffebld_left (expr);
{
ffetargetCharacterSize cmax;
cmax = catlist.len + ffebld_size_known (expr);
if ((max == FFETARGET_charactersizeNONE) || (max > cmax))
max = cmax;
}
goto recurse; /* :::::::::::::::::::: */
#endif
case FFEBLD_opANY:
return catlist;
default:
assert ("bad op in _gather_" == NULL);
return catlist;
}
}
#endif
/* ffecom_concat_list_kill_ -- Kill list of concatenated string exprs
ffecomConcatList_ catlist;
ffecom_concat_list_kill_(catlist);
Anything allocated within the list info is deallocated. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_concat_list_kill_ (ffecomConcatList_ catlist)
{
if (catlist.max != 0)
malloc_kill_ks (malloc_pool_image (), catlist.exprs,
catlist.max * sizeof (catlist.exprs[0]));
}
#endif
/* ffecom_concat_list_new_ -- Make list of concatenated string exprs
ffecomConcatList_ catlist;
ffebld expr; // Root expr of CHARACTER basictype.
ffetargetCharacterSize max; // max chars to gather or _...NONE if no max
catlist = ffecom_concat_list_new_(expr,max);
Returns a flattened list of concatenated subexpressions given a
tree of such expressions. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static ffecomConcatList_
ffecom_concat_list_new_ (ffebld expr, ffetargetCharacterSize max)
{
ffecomConcatList_ catlist;
catlist.maxlen = catlist.minlen = catlist.max = catlist.count = 0;
return ffecom_concat_list_gather_ (catlist, expr, max);
}
#endif
/* Provide some kind of useful info on member of aggregate area,
since current g77/gcc technology does not provide debug info
on these members. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_debug_kludge_ (tree aggr, char *aggr_type, ffesymbol member,
tree member_type UNUSED, ffetargetOffset offset)
{
tree value;
tree decl;
int len;
char *buff;
char space[120];
#if 0
tree type_id;
for (type_id = member_type;
TREE_CODE (type_id) != IDENTIFIER_NODE;
)
{
switch (TREE_CODE (type_id))
{
case INTEGER_TYPE:
case REAL_TYPE:
type_id = TYPE_NAME (type_id);
break;
case ARRAY_TYPE:
case COMPLEX_TYPE:
type_id = TREE_TYPE (type_id);
break;
default:
assert ("no IDENTIFIER_NODE for type!" == NULL);
type_id = error_mark_node;
break;
}
}
#endif
if (ffecom_transform_only_dummies_
|| !ffe_is_debug_kludge ())
return; /* Can't do this yet, maybe later. */
len = 60
+ strlen (aggr_type)
+ IDENTIFIER_LENGTH (DECL_NAME (aggr));
#if 0
+ IDENTIFIER_LENGTH (type_id);
#endif
if (((size_t) len) >= ARRAY_SIZE (space))
buff = malloc_new_ks (malloc_pool_image (), "debug_kludge", len + 1);
else
buff = &space[0];
sprintf (&buff[0], "At (%s) `%s' plus %ld bytes",
aggr_type,
IDENTIFIER_POINTER (DECL_NAME (aggr)),
(long int) offset);
value = build_string (len, buff);
TREE_TYPE (value)
= build_type_variant (build_array_type (char_type_node,
build_range_type
(integer_type_node,
integer_one_node,
build_int_2 (strlen (buff), 0))),
1, 0);
decl = build_decl (VAR_DECL,
ffecom_get_identifier_ (ffesymbol_text (member)),
TREE_TYPE (value));
TREE_CONSTANT (decl) = 1;
TREE_STATIC (decl) = 1;
DECL_INITIAL (decl) = error_mark_node;
DECL_IN_SYSTEM_HEADER (decl) = 1; /* Don't let -Wunused complain. */
decl = start_decl (decl, FALSE);
finish_decl (decl, value, FALSE);
if (buff != &space[0])
malloc_kill_ks (malloc_pool_image (), buff, len + 1);
}
#endif
/* ffecom_do_entry_ -- Do compilation of a particular entrypoint
ffesymbol fn; // the SUBROUTINE, FUNCTION, or ENTRY symbol itself
int i; // entry# for this entrypoint (used by master fn)
ffecom_do_entrypoint_(s,i);
Makes a public entry point that calls our private master fn (already
compiled). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_do_entry_ (ffesymbol fn, int entrynum)
{
ffebld item;
tree type; /* Type of function. */
tree multi_retval; /* Var holding return value (union). */
tree result; /* Var holding result. */
ffeinfoBasictype bt;
ffeinfoKindtype kt;
ffeglobal g;
ffeglobalType gt;
bool charfunc; /* All entry points return same type
CHARACTER. */
bool cmplxfunc; /* Use f2c way of returning COMPLEX. */
bool multi; /* Master fn has multiple return types. */
bool altreturning = FALSE; /* This entry point has alternate returns. */
int yes;
int old_lineno = lineno;
char *old_input_filename = input_filename;
input_filename = ffesymbol_where_filename (fn);
lineno = ffesymbol_where_filelinenum (fn);
/* c-parse.y indeed does call suspend_momentary and not only ignores the
return value, but also never calls resume_momentary, when starting an
outer function (see "fndef:", "setspecs:", and so on). So g77 does the
same thing. It shouldn't be a problem since start_function calls
temporary_allocation, but it might be necessary. If it causes a problem
here, then maybe there's a bug lurking in gcc. NOTE: This identical
comment appears twice in thist file. */
suspend_momentary ();
ffecom_doing_entry_ = TRUE; /* Don't bother with array dimensions. */
switch (ffecom_primary_entry_kind_)
{
case FFEINFO_kindFUNCTION:
/* Determine actual return type for function. */
gt = FFEGLOBAL_typeFUNC;
bt = ffesymbol_basictype (fn);
kt = ffesymbol_kindtype (fn);
if (bt == FFEINFO_basictypeNONE)
{
ffeimplic_establish_symbol (fn);
if (ffesymbol_funcresult (fn) != NULL)
ffeimplic_establish_symbol (ffesymbol_funcresult (fn));
bt = ffesymbol_basictype (fn);
kt = ffesymbol_kindtype (fn);
}
if (bt == FFEINFO_basictypeCHARACTER)
charfunc = TRUE, cmplxfunc = FALSE;
else if ((bt == FFEINFO_basictypeCOMPLEX)
&& ffesymbol_is_f2c (fn))
charfunc = FALSE, cmplxfunc = TRUE;
else
charfunc = cmplxfunc = FALSE;
if (charfunc)
type = ffecom_tree_fun_type_void;
else if (ffesymbol_is_f2c (fn))
type = ffecom_tree_fun_type[bt][kt];
else
type = build_function_type (ffecom_tree_type[bt][kt], NULL_TREE);
if ((type == NULL_TREE)
|| (TREE_TYPE (type) == NULL_TREE))
type = ffecom_tree_fun_type_void; /* _sym_exec_transition. */
multi = (ffecom_master_bt_ == FFEINFO_basictypeNONE);
break;
case FFEINFO_kindSUBROUTINE:
gt = FFEGLOBAL_typeSUBR;
bt = FFEINFO_basictypeNONE;
kt = FFEINFO_kindtypeNONE;
if (ffecom_is_altreturning_)
{ /* Am _I_ altreturning? */
for (item = ffesymbol_dummyargs (fn);
item != NULL;
item = ffebld_trail (item))
{
if (ffebld_op (ffebld_head (item)) == FFEBLD_opSTAR)
{
altreturning = TRUE;
break;
}
}
if (altreturning)
type = ffecom_tree_subr_type;
else
type = ffecom_tree_fun_type_void;
}
else
type = ffecom_tree_fun_type_void;
charfunc = FALSE;
cmplxfunc = FALSE;
multi = FALSE;
break;
default:
assert ("say what??" == NULL);
/* Fall through. */
case FFEINFO_kindANY:
gt = FFEGLOBAL_typeANY;
bt = FFEINFO_basictypeNONE;
kt = FFEINFO_kindtypeNONE;
type = error_mark_node;
charfunc = FALSE;
cmplxfunc = FALSE;
multi = FALSE;
break;
}
/* build_decl uses the current lineno and input_filename to set the decl
source info. So, I've putzed with ffestd and ffeste code to update that
source info to point to the appropriate statement just before calling
ffecom_do_entrypoint (which calls this fn). */
start_function (ffecom_get_external_identifier_ (fn),
type,
0, /* nested/inline */
1); /* TREE_PUBLIC */
if (((g = ffesymbol_global (fn)) != NULL)
&& ((ffeglobal_type (g) == gt)
|| (ffeglobal_type (g) == FFEGLOBAL_typeEXT)))
{
ffeglobal_set_hook (g, current_function_decl);
}
/* Reset args in master arg list so they get retransitioned. */
for (item = ffecom_master_arglist_;
item != NULL;
item = ffebld_trail (item))
{
ffebld arg;
ffesymbol s;
arg = ffebld_head (item);
if (ffebld_op (arg) != FFEBLD_opSYMTER)
continue; /* Alternate return or some such thing. */
s = ffebld_symter (arg);
ffesymbol_hook (s).decl_tree = NULL_TREE;
ffesymbol_hook (s).length_tree = NULL_TREE;
}
/* Build dummy arg list for this entry point. */
yes = suspend_momentary ();
if (charfunc || cmplxfunc)
{ /* Prepend arg for where result goes. */
tree type;
tree length;
if (charfunc)
type = ffecom_tree_type[FFEINFO_basictypeCHARACTER][kt];
else
type = ffecom_tree_type[FFEINFO_basictypeCOMPLEX][kt];
result = ffecom_get_invented_identifier ("__g77_%s",
"result", 0);
/* Make length arg _and_ enhance type info for CHAR arg itself. */
if (charfunc)
length = ffecom_char_enhance_arg_ (&type, fn);
else
length = NULL_TREE; /* Not ref'd if !charfunc. */
type = build_pointer_type (type);
result = build_decl (PARM_DECL, result, type);
push_parm_decl (result);
ffecom_func_result_ = result;
if (charfunc)
{
push_parm_decl (length);
ffecom_func_length_ = length;
}
}
else
result = DECL_RESULT (current_function_decl);
ffecom_push_dummy_decls_ (ffesymbol_dummyargs (fn), FALSE);
resume_momentary (yes);
store_parm_decls (0);
ffecom_start_compstmt_ ();
/* Make local var to hold return type for multi-type master fn. */
if (multi)
{
yes = suspend_momentary ();
multi_retval = ffecom_get_invented_identifier ("__g77_%s",
"multi_retval", 0);
multi_retval = build_decl (VAR_DECL, multi_retval,
ffecom_multi_type_node_);
multi_retval = start_decl (multi_retval, FALSE);
finish_decl (multi_retval, NULL_TREE, FALSE);
resume_momentary (yes);
}
else
multi_retval = NULL_TREE; /* Not actually ref'd if !multi. */
/* Here we emit the actual code for the entry point. */
{
ffebld list;
ffebld arg;
ffesymbol s;
tree arglist = NULL_TREE;
tree *plist = &arglist;
tree prepend;
tree call;
tree actarg;
tree master_fn;
/* Prepare actual arg list based on master arg list. */
for (list = ffecom_master_arglist_;
list != NULL;
list = ffebld_trail (list))
{
arg = ffebld_head (list);
if (ffebld_op (arg) != FFEBLD_opSYMTER)
continue;
s = ffebld_symter (arg);
if (ffesymbol_hook (s).decl_tree == NULL_TREE)
actarg = null_pointer_node; /* We don't have this arg. */
else
actarg = ffesymbol_hook (s).decl_tree;
*plist = build_tree_list (NULL_TREE, actarg);
plist = &TREE_CHAIN (*plist);
}
/* This code appends the length arguments for character
variables/arrays. */
for (list = ffecom_master_arglist_;
list != NULL;
list = ffebld_trail (list))
{
arg = ffebld_head (list);
if (ffebld_op (arg) != FFEBLD_opSYMTER)
continue;
s = ffebld_symter (arg);
if (ffesymbol_basictype (s) != FFEINFO_basictypeCHARACTER)
continue; /* Only looking for CHARACTER arguments. */
if (ffesymbol_kind (s) != FFEINFO_kindENTITY)
continue; /* Only looking for variables and arrays. */
if (ffesymbol_hook (s).length_tree == NULL_TREE)
actarg = ffecom_f2c_ftnlen_zero_node; /* We don't have this arg. */
else
actarg = ffesymbol_hook (s).length_tree;
*plist = build_tree_list (NULL_TREE, actarg);
plist = &TREE_CHAIN (*plist);
}
/* Prepend character-value return info to actual arg list. */
if (charfunc)
{
prepend = build_tree_list (NULL_TREE, ffecom_func_result_);
TREE_CHAIN (prepend)
= build_tree_list (NULL_TREE, ffecom_func_length_);
TREE_CHAIN (TREE_CHAIN (prepend)) = arglist;
arglist = prepend;
}
/* Prepend multi-type return value to actual arg list. */
if (multi)
{
prepend
= build_tree_list (NULL_TREE,
ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (multi_retval)),
multi_retval));
TREE_CHAIN (prepend) = arglist;
arglist = prepend;
}
/* Prepend my entry-point number to the actual arg list. */
prepend = build_tree_list (NULL_TREE, build_int_2 (entrynum, 0));
TREE_CHAIN (prepend) = arglist;
arglist = prepend;
/* Build the call to the master function. */
master_fn = ffecom_1_fn (ffecom_previous_function_decl_);
call = ffecom_3s (CALL_EXPR,
TREE_TYPE (TREE_TYPE (TREE_TYPE (master_fn))),
master_fn, arglist, NULL_TREE);
/* Decide whether the master function is a function or subroutine, and
handle the return value for my entry point. */
if (charfunc || ((ffecom_primary_entry_kind_ == FFEINFO_kindSUBROUTINE)
&& !altreturning))
{
expand_expr_stmt (call);
expand_null_return ();
}
else if (multi && cmplxfunc)
{
expand_expr_stmt (call);
result
= ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (result))),
result);
result = ffecom_modify (NULL_TREE, result,
ffecom_2 (COMPONENT_REF, TREE_TYPE (result),
multi_retval,
ffecom_multi_fields_[bt][kt]));
expand_expr_stmt (result);
expand_null_return ();
}
else if (multi)
{
expand_expr_stmt (call);
result
= ffecom_modify (NULL_TREE, result,
convert (TREE_TYPE (result),
ffecom_2 (COMPONENT_REF,
ffecom_tree_type[bt][kt],
multi_retval,
ffecom_multi_fields_[bt][kt])));
expand_return (result);
}
else if (cmplxfunc)
{
result
= ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (result))),
result);
result = ffecom_modify (NULL_TREE, result, call);
expand_expr_stmt (result);
expand_null_return ();
}
else
{
result = ffecom_modify (NULL_TREE,
result,
convert (TREE_TYPE (result),
call));
expand_return (result);
}
clear_momentary ();
}
ffecom_end_compstmt_ ();
finish_function (0);
lineno = old_lineno;
input_filename = old_input_filename;
ffecom_doing_entry_ = FALSE;
}
#endif
/* Transform expr into gcc tree with possible destination
Recursive descent on expr while making corresponding tree nodes and
attaching type info and such. If destination supplied and compatible
with temporary that would be made in certain cases, temporary isn't
made, destination used instead, and dest_used flag set TRUE. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_expr_ (ffebld expr, tree dest_tree, ffebld dest,
bool *dest_used, bool assignp, bool widenp)
{
tree item;
tree list;
tree args;
ffeinfoBasictype bt;
ffeinfoKindtype kt;
tree t;
tree dt; /* decl_tree for an ffesymbol. */
tree tree_type, tree_type_x;
tree left, right;
ffesymbol s;
enum tree_code code;
assert (expr != NULL);
if (dest_used != NULL)
*dest_used = FALSE;
bt = ffeinfo_basictype (ffebld_info (expr));
kt = ffeinfo_kindtype (ffebld_info (expr));
tree_type = ffecom_tree_type[bt][kt];
/* Widen integral arithmetic as desired while preserving signedness. */
tree_type_x = NULL_TREE;
if (widenp && tree_type
&& GET_MODE_CLASS (TYPE_MODE (tree_type)) == MODE_INT
&& TYPE_PRECISION (tree_type) < TYPE_PRECISION (sizetype))
tree_type_x = (TREE_UNSIGNED (tree_type) ? usizetype : ssizetype);
switch (ffebld_op (expr))
{
case FFEBLD_opACCTER:
{
ffebitCount i;
ffebit bits = ffebld_accter_bits (expr);
ffetargetOffset source_offset = 0;
ffetargetOffset dest_offset = ffebld_accter_pad (expr);
tree purpose;
assert (dest_offset == 0
|| (bt == FFEINFO_basictypeCHARACTER
&& kt == FFEINFO_kindtypeCHARACTER1));
list = item = NULL;
for (;;)
{
ffebldConstantUnion cu;
ffebitCount length;
bool value;
ffebldConstantArray ca = ffebld_accter (expr);
ffebit_test (bits, source_offset, &value, &length);
if (length == 0)
break;
if (value)
{
for (i = 0; i < length; ++i)
{
cu = ffebld_constantarray_get (ca, bt, kt,
source_offset + i);
t = ffecom_constantunion (&cu, bt, kt, tree_type);
if (i == 0
&& dest_offset != 0)
purpose = build_int_2 (dest_offset, 0);
else
purpose = NULL_TREE;
if (list == NULL_TREE)
list = item = build_tree_list (purpose, t);
else
{
TREE_CHAIN (item) = build_tree_list (purpose, t);
item = TREE_CHAIN (item);
}
}
}
source_offset += length;
dest_offset += length;
}
}
item = build_int_2 ((ffebld_accter_size (expr)
+ ffebld_accter_pad (expr)) - 1, 0);
ffebit_kill (ffebld_accter_bits (expr));
TREE_TYPE (item) = ffecom_integer_type_node;
item
= build_array_type
(tree_type,
build_range_type (ffecom_integer_type_node,
ffecom_integer_zero_node,
item));
list = build (CONSTRUCTOR, item, NULL_TREE, list);
TREE_CONSTANT (list) = 1;
TREE_STATIC (list) = 1;
return list;
case FFEBLD_opARRTER:
{
ffetargetOffset i;
list = NULL_TREE;
if (ffebld_arrter_pad (expr) == 0)
item = NULL_TREE;
else
{
assert (bt == FFEINFO_basictypeCHARACTER
&& kt == FFEINFO_kindtypeCHARACTER1);
/* Becomes PURPOSE first time through loop. */
item = build_int_2 (ffebld_arrter_pad (expr), 0);
}
for (i = 0; i < ffebld_arrter_size (expr); ++i)
{
ffebldConstantUnion cu
= ffebld_constantarray_get (ffebld_arrter (expr), bt, kt, i);
t = ffecom_constantunion (&cu, bt, kt, tree_type);
if (list == NULL_TREE)
/* Assume item is PURPOSE first time through loop. */
list = item = build_tree_list (item, t);
else
{
TREE_CHAIN (item) = build_tree_list (NULL_TREE, t);
item = TREE_CHAIN (item);
}
}
}
item = build_int_2 ((ffebld_arrter_size (expr)
+ ffebld_arrter_pad (expr)) - 1, 0);
TREE_TYPE (item) = ffecom_integer_type_node;
item
= build_array_type
(tree_type,
build_range_type (ffecom_integer_type_node,
ffecom_integer_zero_node,
item));
list = build (CONSTRUCTOR, item, NULL_TREE, list);
TREE_CONSTANT (list) = 1;
TREE_STATIC (list) = 1;
return list;
case FFEBLD_opCONTER:
item
= ffecom_constantunion (&ffebld_constant_union (ffebld_conter (expr)),
bt, kt, tree_type);
return item;
case FFEBLD_opSYMTER:
if ((ffebld_symter_generic (expr) != FFEINTRIN_genNONE)
|| (ffebld_symter_specific (expr) != FFEINTRIN_specNONE))
return ffecom_ptr_to_expr (expr); /* Same as %REF(intrinsic). */
s = ffebld_symter (expr);
t = ffesymbol_hook (s).decl_tree;
if (assignp)
{ /* ASSIGN'ed-label expr. */
if (ffe_is_ugly_assign ())
{
/* User explicitly wants ASSIGN'ed variables to be at the same
memory address as the variables when used in non-ASSIGN
contexts. That can make old, arcane, non-standard code
work, but don't try to do it when a pointer wouldn't fit
in the normal variable (take other approach, and warn,
instead). */
if (t == NULL_TREE)
{
s = ffecom_sym_transform_ (s);
t = ffesymbol_hook (s).decl_tree;
assert (t != NULL_TREE);
}
if (t == error_mark_node)
return t;
if (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (t)))
>= GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (null_pointer_node))))
{
if (ffesymbol_hook (s).addr)
t = ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (t))), t);
return t;
}
if (ffesymbol_hook (s).assign_tree == NULL_TREE)
{
ffebad_start_msg ("ASSIGN'ed label cannot fit into `%A' at %0 -- using wider sibling",
FFEBAD_severityWARNING);
ffebad_string (ffesymbol_text (s));
ffebad_here (0, ffesymbol_where_line (s),
ffesymbol_where_column (s));
ffebad_finish ();
}
}
/* Don't use the normal variable's tree for ASSIGN, though mark
it as in the system header (housekeeping). Use an explicit,
specially created sibling that is known to be wide enough
to hold pointers to labels. */
if (t != NULL_TREE
&& TREE_CODE (t) == VAR_DECL)
DECL_IN_SYSTEM_HEADER (t) = 1; /* Don't let -Wunused complain. */
t = ffesymbol_hook (s).assign_tree;
if (t == NULL_TREE)
{
s = ffecom_sym_transform_assign_ (s);
t = ffesymbol_hook (s).assign_tree;
assert (t != NULL_TREE);
}
}
else
{
if (t == NULL_TREE)
{
s = ffecom_sym_transform_ (s);
t = ffesymbol_hook (s).decl_tree;
assert (t != NULL_TREE);
}
if (ffesymbol_hook (s).addr)
t = ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (t))), t);
}
return t;
case FFEBLD_opARRAYREF:
{
ffebld dims[FFECOM_dimensionsMAX];
#if FFECOM_FASTER_ARRAY_REFS
tree array;
#endif
int i;
#if FFECOM_FASTER_ARRAY_REFS
t = ffecom_ptr_to_expr (ffebld_left (expr));
#else
t = ffecom_expr (ffebld_left (expr));
#endif
if (t == error_mark_node)
return t;
if ((ffeinfo_where (ffebld_info (expr)) == FFEINFO_whereFLEETING)
&& !mark_addressable (t))
return error_mark_node; /* Make sure non-const ref is to
non-reg. */
/* Build up ARRAY_REFs in reverse order (since we're column major
here in Fortran land). */
for (i = 0, expr = ffebld_right (expr);
expr != NULL;
expr = ffebld_trail (expr))
dims[i++] = ffebld_head (expr);
#if FFECOM_FASTER_ARRAY_REFS
for (--i, array = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (t)));
i >= 0;
--i, array = TYPE_MAIN_VARIANT (TREE_TYPE (array)))
t = ffecom_2 (PLUS_EXPR,
build_pointer_type (TREE_TYPE (array)),
t,
size_binop (MULT_EXPR,
size_in_bytes (TREE_TYPE (array)),
size_binop (MINUS_EXPR,
ffecom_expr (dims[i]),
TYPE_MIN_VALUE (TYPE_DOMAIN (array)))));
t = ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (t))),
t);
#else
while (i > 0)
t = ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (t))),
t,
ffecom_expr_ (dims[--i], NULL, NULL, NULL, FALSE, TRUE));
#endif
return t;
}
case FFEBLD_opUPLUS:
left = ffecom_expr_ (ffebld_left (expr), NULL, NULL, NULL, FALSE, widenp);
return ffecom_1 (NOP_EXPR, tree_type, left);
case FFEBLD_opPAREN: /* ~~~Make sure Fortran rules respected here */
left = ffecom_expr_ (ffebld_left (expr), NULL, NULL, NULL, FALSE, widenp);
return ffecom_1 (NOP_EXPR, tree_type, left);
case FFEBLD_opUMINUS:
left = ffecom_expr_ (ffebld_left (expr), NULL, NULL, NULL, FALSE, widenp);
if (tree_type_x)
{
tree_type = tree_type_x;
left = convert (tree_type, left);
}
return ffecom_1 (NEGATE_EXPR, tree_type, left);
case FFEBLD_opADD:
left = ffecom_expr_ (ffebld_left (expr), NULL, NULL, NULL, FALSE, widenp);
right = ffecom_expr_ (ffebld_right (expr), NULL, NULL, NULL, FALSE, widenp);
if (tree_type_x)
{
tree_type = tree_type_x;
left = convert (tree_type, left);
right = convert (tree_type, right);
}
return ffecom_2 (PLUS_EXPR, tree_type, left, right);
case FFEBLD_opSUBTRACT:
left = ffecom_expr_ (ffebld_left (expr), NULL, NULL, NULL, FALSE, widenp);
right = ffecom_expr_ (ffebld_right (expr), NULL, NULL, NULL, FALSE, widenp);
if (tree_type_x)
{
tree_type = tree_type_x;
left = convert (tree_type, left);
right = convert (tree_type, right);
}
return ffecom_2 (MINUS_EXPR, tree_type, left, right);
case FFEBLD_opMULTIPLY:
left = ffecom_expr_ (ffebld_left (expr), NULL, NULL, NULL, FALSE, widenp);
right = ffecom_expr_ (ffebld_right (expr), NULL, NULL, NULL, FALSE, widenp);
if (tree_type_x)
{
tree_type = tree_type_x;
left = convert (tree_type, left);
right = convert (tree_type, right);
}
return ffecom_2 (MULT_EXPR, tree_type, left, right);
case FFEBLD_opDIVIDE:
left = ffecom_expr_ (ffebld_left (expr), NULL, NULL, NULL, FALSE, widenp);
right = ffecom_expr_ (ffebld_right (expr), NULL, NULL, NULL, FALSE, widenp);
if (tree_type_x)
{
tree_type = tree_type_x;
left = convert (tree_type, left);
right = convert (tree_type, right);
}
return ffecom_tree_divide_ (tree_type, left, right,
dest_tree, dest, dest_used);
case FFEBLD_opPOWER:
{
ffebld left = ffebld_left (expr);
ffebld right = ffebld_right (expr);
ffecomGfrt code;
ffeinfoKindtype rtkt;
ffeinfoKindtype ltkt;
switch (ffeinfo_basictype (ffebld_info (right)))
{
case FFEINFO_basictypeINTEGER:
if (1 || optimize)
{
item = ffecom_expr_power_integer_ (left, right);
if (item != NULL_TREE)
return item;
}
rtkt = FFEINFO_kindtypeINTEGER1;
switch (ffeinfo_basictype (ffebld_info (left)))
{
case FFEINFO_basictypeINTEGER:
if ((ffeinfo_kindtype (ffebld_info (left))
== FFEINFO_kindtypeINTEGER4)
|| (ffeinfo_kindtype (ffebld_info (right))
== FFEINFO_kindtypeINTEGER4))
{
code = FFECOM_gfrtPOW_QQ;
ltkt = FFEINFO_kindtypeINTEGER4;
rtkt = FFEINFO_kindtypeINTEGER4;
}
else
{
code = FFECOM_gfrtPOW_II;
ltkt = FFEINFO_kindtypeINTEGER1;
}
break;
case FFEINFO_basictypeREAL:
if (ffeinfo_kindtype (ffebld_info (left))
== FFEINFO_kindtypeREAL1)
{
code = FFECOM_gfrtPOW_RI;
ltkt = FFEINFO_kindtypeREAL1;
}
else
{
code = FFECOM_gfrtPOW_DI;
ltkt = FFEINFO_kindtypeREAL2;
}
break;
case FFEINFO_basictypeCOMPLEX:
if (ffeinfo_kindtype (ffebld_info (left))
== FFEINFO_kindtypeREAL1)
{
code = FFECOM_gfrtPOW_CI; /* Overlapping result okay. */
ltkt = FFEINFO_kindtypeREAL1;
}
else
{
code = FFECOM_gfrtPOW_ZI; /* Overlapping result okay. */
ltkt = FFEINFO_kindtypeREAL2;
}
break;
default:
assert ("bad pow_*i" == NULL);
code = FFECOM_gfrtPOW_CI; /* Overlapping result okay. */
ltkt = FFEINFO_kindtypeREAL1;
break;
}
if (ffeinfo_kindtype (ffebld_info (left)) != ltkt)
left = ffeexpr_convert (left, NULL, NULL,
ffeinfo_basictype (ffebld_info (left)),
ltkt, 0,
FFETARGET_charactersizeNONE,
FFEEXPR_contextLET);
if (ffeinfo_kindtype (ffebld_info (right)) != rtkt)
right = ffeexpr_convert (right, NULL, NULL,
FFEINFO_basictypeINTEGER,
rtkt, 0,
FFETARGET_charactersizeNONE,
FFEEXPR_contextLET);
break;
case FFEINFO_basictypeREAL:
if (ffeinfo_kindtype (ffebld_info (left)) == FFEINFO_kindtypeREAL1)
left = ffeexpr_convert (left, NULL, NULL, FFEINFO_basictypeREAL,
FFEINFO_kindtypeREALDOUBLE, 0,
FFETARGET_charactersizeNONE,
FFEEXPR_contextLET);
if (ffeinfo_kindtype (ffebld_info (right))
== FFEINFO_kindtypeREAL1)
right = ffeexpr_convert (right, NULL, NULL,
FFEINFO_basictypeREAL,
FFEINFO_kindtypeREALDOUBLE, 0,
FFETARGET_charactersizeNONE,
FFEEXPR_contextLET);
code = FFECOM_gfrtPOW_DD;
break;
case FFEINFO_basictypeCOMPLEX:
if (ffeinfo_kindtype (ffebld_info (left)) == FFEINFO_kindtypeREAL1)
left = ffeexpr_convert (left, NULL, NULL,
FFEINFO_basictypeCOMPLEX,
FFEINFO_kindtypeREALDOUBLE, 0,
FFETARGET_charactersizeNONE,
FFEEXPR_contextLET);
if (ffeinfo_kindtype (ffebld_info (right))
== FFEINFO_kindtypeREAL1)
right = ffeexpr_convert (right, NULL, NULL,
FFEINFO_basictypeCOMPLEX,
FFEINFO_kindtypeREALDOUBLE, 0,
FFETARGET_charactersizeNONE,
FFEEXPR_contextLET);
code = FFECOM_gfrtPOW_ZZ; /* Overlapping result okay. */
break;
default:
assert ("bad pow_x*" == NULL);
code = FFECOM_gfrtPOW_II;
break;
}
return ffecom_call_binop_ (ffecom_gfrt_tree_ (code),
ffecom_gfrt_kindtype (code),
(ffe_is_f2c_library ()
&& ffecom_gfrt_complex_[code]),
tree_type, left, right,
dest_tree, dest, dest_used,
NULL_TREE, FALSE);
}
case FFEBLD_opNOT:
switch (bt)
{
case FFEINFO_basictypeLOGICAL:
item = ffecom_truth_value_invert (ffecom_expr (ffebld_left (expr)));
return convert (tree_type, item);
case FFEINFO_basictypeINTEGER:
return ffecom_1 (BIT_NOT_EXPR, tree_type,
ffecom_expr (ffebld_left (expr)));
default:
assert ("NOT bad basictype" == NULL);
/* Fall through. */
case FFEINFO_basictypeANY:
return error_mark_node;
}
break;
case FFEBLD_opFUNCREF:
assert (ffeinfo_basictype (ffebld_info (expr))
!= FFEINFO_basictypeCHARACTER);
/* Fall through. */
case FFEBLD_opSUBRREF:
if (ffeinfo_where (ffebld_info (ffebld_left (expr)))
== FFEINFO_whereINTRINSIC)
{ /* Invocation of an intrinsic. */
item = ffecom_expr_intrinsic_ (expr, dest_tree, dest,
dest_used);
return item;
}
s = ffebld_symter (ffebld_left (expr));
dt = ffesymbol_hook (s).decl_tree;
if (dt == NULL_TREE)
{
s = ffecom_sym_transform_ (s);
dt = ffesymbol_hook (s).decl_tree;
}
if (dt == error_mark_node)
return dt;
if (ffesymbol_hook (s).addr)
item = dt;
else
item = ffecom_1_fn (dt);
ffecom_push_calltemps ();
if (ffesymbol_where (s) == FFEINFO_whereCONSTANT)
args = ffecom_list_expr (ffebld_right (expr));
else
args = ffecom_list_ptr_to_expr (ffebld_right (expr));
ffecom_pop_calltemps ();
item = ffecom_call_ (item, kt,
ffesymbol_is_f2c (s)
&& (bt == FFEINFO_basictypeCOMPLEX)
&& (ffesymbol_where (s)
!= FFEINFO_whereCONSTANT),
tree_type,
args,
dest_tree, dest, dest_used,
error_mark_node, FALSE);
TREE_SIDE_EFFECTS (item) = 1;
return item;
case FFEBLD_opAND:
switch (bt)
{
case FFEINFO_basictypeLOGICAL:
item
= ffecom_2 (TRUTH_ANDIF_EXPR, integer_type_node,
ffecom_truth_value (ffecom_expr (ffebld_left (expr))),
ffecom_truth_value (ffecom_expr (ffebld_right (expr))));
return convert (tree_type, item);
case FFEINFO_basictypeINTEGER:
return ffecom_2 (BIT_AND_EXPR, tree_type,
ffecom_expr (ffebld_left (expr)),
ffecom_expr (ffebld_right (expr)));
default:
assert ("AND bad basictype" == NULL);
/* Fall through. */
case FFEINFO_basictypeANY:
return error_mark_node;
}
break;
case FFEBLD_opOR:
switch (bt)
{
case FFEINFO_basictypeLOGICAL:
item
= ffecom_2 (TRUTH_ORIF_EXPR, integer_type_node,
ffecom_truth_value (ffecom_expr (ffebld_left (expr))),
ffecom_truth_value (ffecom_expr (ffebld_right (expr))));
return convert (tree_type, item);
case FFEINFO_basictypeINTEGER:
return ffecom_2 (BIT_IOR_EXPR, tree_type,
ffecom_expr (ffebld_left (expr)),
ffecom_expr (ffebld_right (expr)));
default:
assert ("OR bad basictype" == NULL);
/* Fall through. */
case FFEINFO_basictypeANY:
return error_mark_node;
}
break;
case FFEBLD_opXOR:
case FFEBLD_opNEQV:
switch (bt)
{
case FFEINFO_basictypeLOGICAL:
item
= ffecom_2 (NE_EXPR, integer_type_node,
ffecom_expr (ffebld_left (expr)),
ffecom_expr (ffebld_right (expr)));
return convert (tree_type, ffecom_truth_value (item));
case FFEINFO_basictypeINTEGER:
return ffecom_2 (BIT_XOR_EXPR, tree_type,
ffecom_expr (ffebld_left (expr)),
ffecom_expr (ffebld_right (expr)));
default:
assert ("XOR/NEQV bad basictype" == NULL);
/* Fall through. */
case FFEINFO_basictypeANY:
return error_mark_node;
}
break;
case FFEBLD_opEQV:
switch (bt)
{
case FFEINFO_basictypeLOGICAL:
item
= ffecom_2 (EQ_EXPR, integer_type_node,
ffecom_expr (ffebld_left (expr)),
ffecom_expr (ffebld_right (expr)));
return convert (tree_type, ffecom_truth_value (item));
case FFEINFO_basictypeINTEGER:
return
ffecom_1 (BIT_NOT_EXPR, tree_type,
ffecom_2 (BIT_XOR_EXPR, tree_type,
ffecom_expr (ffebld_left (expr)),
ffecom_expr (ffebld_right (expr))));
default:
assert ("EQV bad basictype" == NULL);
/* Fall through. */
case FFEINFO_basictypeANY:
return error_mark_node;
}
break;
case FFEBLD_opCONVERT:
if (ffebld_op (ffebld_left (expr)) == FFEBLD_opANY)
return error_mark_node;
switch (bt)
{
case FFEINFO_basictypeLOGICAL:
case FFEINFO_basictypeINTEGER:
case FFEINFO_basictypeREAL:
return convert (tree_type, ffecom_expr (ffebld_left (expr)));
case FFEINFO_basictypeCOMPLEX:
switch (ffeinfo_basictype (ffebld_info (ffebld_left (expr))))
{
case FFEINFO_basictypeINTEGER:
case FFEINFO_basictypeLOGICAL:
case FFEINFO_basictypeREAL:
item = ffecom_expr (ffebld_left (expr));
if (item == error_mark_node)
return error_mark_node;
/* convert() takes care of converting to the subtype first,
at least in gcc-2.7.2. */
item = convert (tree_type, item);
return item;
case FFEINFO_basictypeCOMPLEX:
return convert (tree_type, ffecom_expr (ffebld_left (expr)));
default:
assert ("CONVERT COMPLEX bad basictype" == NULL);
/* Fall through. */
case FFEINFO_basictypeANY:
return error_mark_node;
}
break;
default:
assert ("CONVERT bad basictype" == NULL);
/* Fall through. */
case FFEINFO_basictypeANY:
return error_mark_node;
}
break;
case FFEBLD_opLT:
code = LT_EXPR;
goto relational; /* :::::::::::::::::::: */
case FFEBLD_opLE:
code = LE_EXPR;
goto relational; /* :::::::::::::::::::: */
case FFEBLD_opEQ:
code = EQ_EXPR;
goto relational; /* :::::::::::::::::::: */
case FFEBLD_opNE:
code = NE_EXPR;
goto relational; /* :::::::::::::::::::: */
case FFEBLD_opGT:
code = GT_EXPR;
goto relational; /* :::::::::::::::::::: */
case FFEBLD_opGE:
code = GE_EXPR;
relational: /* :::::::::::::::::::: */
switch (ffeinfo_basictype (ffebld_info (ffebld_left (expr))))
{
case FFEINFO_basictypeLOGICAL:
case FFEINFO_basictypeINTEGER:
case FFEINFO_basictypeREAL:
item = ffecom_2 (code, integer_type_node,
ffecom_expr (ffebld_left (expr)),
ffecom_expr (ffebld_right (expr)));
return convert (tree_type, item);
case FFEINFO_basictypeCOMPLEX:
assert (code == EQ_EXPR || code == NE_EXPR);
{
tree real_type;
tree arg1 = ffecom_expr (ffebld_left (expr));
tree arg2 = ffecom_expr (ffebld_right (expr));
if (arg1 == error_mark_node || arg2 == error_mark_node)
return error_mark_node;
arg1 = ffecom_save_tree (arg1);
arg2 = ffecom_save_tree (arg2);
if (TREE_CODE (TREE_TYPE (arg1)) == COMPLEX_TYPE)
{
real_type = TREE_TYPE (TREE_TYPE (arg1));
assert (real_type == TREE_TYPE (TREE_TYPE (arg2)));
}
else
{
real_type = TREE_TYPE (TYPE_FIELDS (TREE_TYPE (arg1)));
assert (real_type == TREE_TYPE (TYPE_FIELDS (TREE_TYPE (arg2))));
}
item
= ffecom_2 (TRUTH_ANDIF_EXPR, integer_type_node,
ffecom_2 (EQ_EXPR, integer_type_node,
ffecom_1 (REALPART_EXPR, real_type, arg1),
ffecom_1 (REALPART_EXPR, real_type, arg2)),
ffecom_2 (EQ_EXPR, integer_type_node,
ffecom_1 (IMAGPART_EXPR, real_type, arg1),
ffecom_1 (IMAGPART_EXPR, real_type,
arg2)));
if (code == EQ_EXPR)
item = ffecom_truth_value (item);
else
item = ffecom_truth_value_invert (item);
return convert (tree_type, item);
}
case FFEINFO_basictypeCHARACTER:
ffecom_push_calltemps (); /* Even though we might not call. */
{
ffebld left = ffebld_left (expr);
ffebld right = ffebld_right (expr);
tree left_tree;
tree right_tree;
tree left_length;
tree right_length;
/* f2c run-time functions do the implicit blank-padding for us,
so we don't usually have to implement blank-padding ourselves.
(The exception is when we pass an argument to a separately
compiled statement function -- if we know the arg is not the
same length as the dummy, we must truncate or extend it. If
we "inline" statement functions, that necessity goes away as
well.)
Strip off the CONVERT operators that blank-pad. (Truncation by
CONVERT shouldn't happen here, but it can happen in
assignments.) */
while (ffebld_op (left) == FFEBLD_opCONVERT)
left = ffebld_left (left);
while (ffebld_op (right) == FFEBLD_opCONVERT)
right = ffebld_left (right);
left_tree = ffecom_arg_ptr_to_expr (left, &left_length);
right_tree = ffecom_arg_ptr_to_expr (right, &right_length);
if (left_tree == error_mark_node || left_length == error_mark_node
|| right_tree == error_mark_node
|| right_length == error_mark_node)
{
ffecom_pop_calltemps ();
return error_mark_node;
}
if ((ffebld_size_known (left) == 1)
&& (ffebld_size_known (right) == 1))
{
left_tree
= ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (left_tree))),
left_tree);
right_tree
= ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (right_tree))),
right_tree);
item
= ffecom_2 (code, integer_type_node,
ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (left_tree))),
left_tree,
integer_one_node),
ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (right_tree))),
right_tree,
integer_one_node));
}
else
{
item = build_tree_list (NULL_TREE, left_tree);
TREE_CHAIN (item) = build_tree_list (NULL_TREE, right_tree);
TREE_CHAIN (TREE_CHAIN (item)) = build_tree_list (NULL_TREE,
left_length);
TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (item)))
= build_tree_list (NULL_TREE, right_length);
item = ffecom_call_gfrt (FFECOM_gfrtCMP, item);
item = ffecom_2 (code, integer_type_node,
item,
convert (TREE_TYPE (item),
integer_zero_node));
}
item = convert (tree_type, item);
}
ffecom_pop_calltemps ();
return item;
default:
assert ("relational bad basictype" == NULL);
/* Fall through. */
case FFEINFO_basictypeANY:
return error_mark_node;
}
break;
case FFEBLD_opPERCENT_LOC:
item = ffecom_arg_ptr_to_expr (ffebld_left (expr), &list);
return convert (tree_type, item);
case FFEBLD_opITEM:
case FFEBLD_opSTAR:
case FFEBLD_opBOUNDS:
case FFEBLD_opREPEAT:
case FFEBLD_opLABTER:
case FFEBLD_opLABTOK:
case FFEBLD_opIMPDO:
case FFEBLD_opCONCATENATE:
case FFEBLD_opSUBSTR:
default:
assert ("bad op" == NULL);
/* Fall through. */
case FFEBLD_opANY:
return error_mark_node;
}
#if 1
assert ("didn't think anything got here anymore!!" == NULL);
#else
switch (ffebld_arity (expr))
{
case 2:
TREE_OPERAND (item, 0) = ffecom_expr (ffebld_left (expr));
TREE_OPERAND (item, 1) = ffecom_expr (ffebld_right (expr));
if (TREE_OPERAND (item, 0) == error_mark_node
|| TREE_OPERAND (item, 1) == error_mark_node)
return error_mark_node;
break;
case 1:
TREE_OPERAND (item, 0) = ffecom_expr (ffebld_left (expr));
if (TREE_OPERAND (item, 0) == error_mark_node)
return error_mark_node;
break;
default:
break;
}
return fold (item);
#endif
}
#endif
/* Returns the tree that does the intrinsic invocation.
Note: this function applies only to intrinsics returning
CHARACTER*1 or non-CHARACTER results, and to intrinsic
subroutines. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_expr_intrinsic_ (ffebld expr, tree dest_tree,
ffebld dest, bool *dest_used)
{
tree expr_tree;
tree saved_expr1; /* For those who need it. */
tree saved_expr2; /* For those who need it. */
ffeinfoBasictype bt;
ffeinfoKindtype kt;
tree tree_type;
tree arg1_type;
tree real_type; /* REAL type corresponding to COMPLEX. */
tree tempvar;
ffebld list = ffebld_right (expr); /* List of (some) args. */
ffebld arg1; /* For handy reference. */
ffebld arg2;
ffebld arg3;
ffeintrinImp codegen_imp;
ffecomGfrt gfrt;
assert (ffebld_op (ffebld_left (expr)) == FFEBLD_opSYMTER);
if (dest_used != NULL)
*dest_used = FALSE;
bt = ffeinfo_basictype (ffebld_info (expr));
kt = ffeinfo_kindtype (ffebld_info (expr));
tree_type = ffecom_tree_type[bt][kt];
if (list != NULL)
{
arg1 = ffebld_head (list);
if (arg1 != NULL && ffebld_op (arg1) == FFEBLD_opANY)
return error_mark_node;
if ((list = ffebld_trail (list)) != NULL)
{
arg2 = ffebld_head (list);
if (arg2 != NULL && ffebld_op (arg2) == FFEBLD_opANY)
return error_mark_node;
if ((list = ffebld_trail (list)) != NULL)
{
arg3 = ffebld_head (list);
if (arg3 != NULL && ffebld_op (arg3) == FFEBLD_opANY)
return error_mark_node;
}
else
arg3 = NULL;
}
else
arg2 = arg3 = NULL;
}
else
arg1 = arg2 = arg3 = NULL;
/* <list> ends up at the opITEM of the 3rd arg, or NULL if there are < 3
args. This is used by the MAX/MIN expansions. */
if (arg1 != NULL)
arg1_type = ffecom_tree_type
[ffeinfo_basictype (ffebld_info (arg1))]
[ffeinfo_kindtype (ffebld_info (arg1))];
else
arg1_type = NULL_TREE; /* Really not needed, but might catch bugs
here. */
/* There are several ways for each of the cases in the following switch
statements to exit (from simplest to use to most complicated):
break; (when expr_tree == NULL)
A standard call is made to the specific intrinsic just as if it had been
passed in as a dummy procedure and called as any old procedure. This
method can produce slower code but in some cases it's the easiest way for
now. However, if a (presumably faster) direct call is available,
that is used, so this is the easiest way in many more cases now.
gfrt = FFECOM_gfrtWHATEVER;
break;
gfrt contains the gfrt index of a library function to call, passing the
argument(s) by value rather than by reference. Used when a more
careful choice of library function is needed than that provided
by the vanilla `break;'.
return expr_tree;
The expr_tree has been completely set up and is ready to be returned
as is. No further actions are taken. Use this when the tree is not
in the simple form for one of the arity_n labels. */
/* For info on how the switch statement cases were written, see the files
enclosed in comments below the switch statement. */
codegen_imp = ffebld_symter_implementation (ffebld_left (expr));
gfrt = ffeintrin_gfrt_direct (codegen_imp);
if (gfrt == FFECOM_gfrt)
gfrt = ffeintrin_gfrt_indirect (codegen_imp);
switch (codegen_imp)
{
case FFEINTRIN_impABS:
case FFEINTRIN_impCABS:
case FFEINTRIN_impCDABS:
case FFEINTRIN_impDABS:
case FFEINTRIN_impIABS:
if (ffeinfo_basictype (ffebld_info (arg1))
== FFEINFO_basictypeCOMPLEX)
{
if (kt == FFEINFO_kindtypeREAL1)
gfrt = FFECOM_gfrtCABS;
else if (kt == FFEINFO_kindtypeREAL2)
gfrt = FFECOM_gfrtCDABS;
break;
}
return ffecom_1 (ABS_EXPR, tree_type,
convert (tree_type, ffecom_expr (arg1)));
case FFEINTRIN_impACOS:
case FFEINTRIN_impDACOS:
break;
case FFEINTRIN_impAIMAG:
case FFEINTRIN_impDIMAG:
case FFEINTRIN_impIMAGPART:
if (TREE_CODE (arg1_type) == COMPLEX_TYPE)
arg1_type = TREE_TYPE (arg1_type);
else
arg1_type = TREE_TYPE (TYPE_FIELDS (arg1_type));
return
convert (tree_type,
ffecom_1 (IMAGPART_EXPR, arg1_type,
ffecom_expr (arg1)));
case FFEINTRIN_impAINT:
case FFEINTRIN_impDINT:
#if 0 /* ~~ someday implement FIX_TRUNC_EXPR
yielding same type as arg */
return ffecom_1 (FIX_TRUNC_EXPR, tree_type, ffecom_expr (arg1));
#else /* in the meantime, must use floor to avoid range problems with ints */
/* r__1 = r1 >= 0 ? floor(r1) : -floor(-r1); */
saved_expr1 = ffecom_save_tree (ffecom_expr (arg1));
return
convert (tree_type,
ffecom_3 (COND_EXPR, double_type_node,
ffecom_truth_value
(ffecom_2 (GE_EXPR, integer_type_node,
saved_expr1,
convert (arg1_type,
ffecom_float_zero_))),
ffecom_call_gfrt (FFECOM_gfrtL_FLOOR,
build_tree_list (NULL_TREE,
convert (double_type_node,
saved_expr1))),
ffecom_1 (NEGATE_EXPR, double_type_node,
ffecom_call_gfrt (FFECOM_gfrtL_FLOOR,
build_tree_list (NULL_TREE,
convert (double_type_node,
ffecom_1 (NEGATE_EXPR,
arg1_type,
saved_expr1))))
))
);
#endif
case FFEINTRIN_impANINT:
case FFEINTRIN_impDNINT:
#if 0 /* This way of doing it won't handle real
numbers of large magnitudes. */
saved_expr1 = ffecom_save_tree (ffecom_expr (arg1));
expr_tree = convert (tree_type,
convert (integer_type_node,
ffecom_3 (COND_EXPR, tree_type,
ffecom_truth_value
(ffecom_2 (GE_EXPR,
integer_type_node,
saved_expr1,
ffecom_float_zero_)),
ffecom_2 (PLUS_EXPR,
tree_type,
saved_expr1,
ffecom_float_half_),
ffecom_2 (MINUS_EXPR,
tree_type,
saved_expr1,
ffecom_float_half_))));
return expr_tree;
#else /* So we instead call floor. */
/* r__1 = r1 >= 0 ? floor(r1 + .5) : -floor(.5 - r1) */
saved_expr1 = ffecom_save_tree (ffecom_expr (arg1));
return
convert (tree_type,
ffecom_3 (COND_EXPR, double_type_node,
ffecom_truth_value
(ffecom_2 (GE_EXPR, integer_type_node,
saved_expr1,
convert (arg1_type,
ffecom_float_zero_))),
ffecom_call_gfrt (FFECOM_gfrtL_FLOOR,
build_tree_list (NULL_TREE,
convert (double_type_node,
ffecom_2 (PLUS_EXPR,
arg1_type,
saved_expr1,
convert (arg1_type,
ffecom_float_half_))))),
ffecom_1 (NEGATE_EXPR, double_type_node,
ffecom_call_gfrt (FFECOM_gfrtL_FLOOR,
build_tree_list (NULL_TREE,
convert (double_type_node,
ffecom_2 (MINUS_EXPR,
arg1_type,
convert (arg1_type,
ffecom_float_half_),
saved_expr1)))))
)
);
#endif
case FFEINTRIN_impASIN:
case FFEINTRIN_impDASIN:
case FFEINTRIN_impATAN:
case FFEINTRIN_impDATAN:
case FFEINTRIN_impATAN2:
case FFEINTRIN_impDATAN2:
break;
case FFEINTRIN_impCHAR:
case FFEINTRIN_impACHAR:
assert (ffecom_pending_calls_ != 0);
tempvar = ffecom_push_tempvar (char_type_node,
1, -1, TRUE);
{
tree tmv = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (tempvar)));
expr_tree = ffecom_modify (tmv,
ffecom_2 (ARRAY_REF, tmv, tempvar,
integer_one_node),
convert (tmv, ffecom_expr (arg1)));
}
expr_tree = ffecom_2 (COMPOUND_EXPR, TREE_TYPE (tempvar),
expr_tree,
tempvar);
expr_tree = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (expr_tree)),
expr_tree);
return expr_tree;
case FFEINTRIN_impCMPLX:
case FFEINTRIN_impDCMPLX:
if (arg2 == NULL)
return
convert (tree_type, ffecom_expr (arg1));
real_type = ffecom_tree_type[FFEINFO_basictypeREAL][kt];
return
ffecom_2 (COMPLEX_EXPR, tree_type,
convert (real_type, ffecom_expr (arg1)),
convert (real_type,
ffecom_expr (arg2)));
case FFEINTRIN_impCOMPLEX:
return
ffecom_2 (COMPLEX_EXPR, tree_type,
ffecom_expr (arg1),
ffecom_expr (arg2));
case FFEINTRIN_impCONJG:
case FFEINTRIN_impDCONJG:
{
tree arg1_tree;
real_type = ffecom_tree_type[FFEINFO_basictypeREAL][kt];
arg1_tree = ffecom_save_tree (ffecom_expr (arg1));
return
ffecom_2 (COMPLEX_EXPR, tree_type,
ffecom_1 (REALPART_EXPR, real_type, arg1_tree),
ffecom_1 (NEGATE_EXPR, real_type,
ffecom_1 (IMAGPART_EXPR, real_type, arg1_tree)));
}
case FFEINTRIN_impCOS:
case FFEINTRIN_impCCOS:
case FFEINTRIN_impCDCOS:
case FFEINTRIN_impDCOS:
if (bt == FFEINFO_basictypeCOMPLEX)
{
if (kt == FFEINFO_kindtypeREAL1)
gfrt = FFECOM_gfrtCCOS; /* Overlapping result okay. */
else if (kt == FFEINFO_kindtypeREAL2)
gfrt = FFECOM_gfrtCDCOS; /* Overlapping result okay. */
}
break;
case FFEINTRIN_impCOSH:
case FFEINTRIN_impDCOSH:
break;
case FFEINTRIN_impDBLE:
case FFEINTRIN_impDFLOAT:
case FFEINTRIN_impDREAL:
case FFEINTRIN_impFLOAT:
case FFEINTRIN_impIDINT:
case FFEINTRIN_impIFIX:
case FFEINTRIN_impINT2:
case FFEINTRIN_impINT8:
case FFEINTRIN_impINT:
case FFEINTRIN_impLONG:
case FFEINTRIN_impREAL:
case FFEINTRIN_impSHORT:
case FFEINTRIN_impSNGL:
return convert (tree_type, ffecom_expr (arg1));
case FFEINTRIN_impDIM:
case FFEINTRIN_impDDIM:
case FFEINTRIN_impIDIM:
saved_expr1 = ffecom_save_tree (convert (tree_type,
ffecom_expr (arg1)));
saved_expr2 = ffecom_save_tree (convert (tree_type,
ffecom_expr (arg2)));
return
ffecom_3 (COND_EXPR, tree_type,
ffecom_truth_value
(ffecom_2 (GT_EXPR, integer_type_node,
saved_expr1,
saved_expr2)),
ffecom_2 (MINUS_EXPR, tree_type,
saved_expr1,
saved_expr2),
convert (tree_type, ffecom_float_zero_));
case FFEINTRIN_impDPROD:
return
ffecom_2 (MULT_EXPR, tree_type,
convert (tree_type, ffecom_expr (arg1)),
convert (tree_type, ffecom_expr (arg2)));
case FFEINTRIN_impEXP:
case FFEINTRIN_impCDEXP:
case FFEINTRIN_impCEXP:
case FFEINTRIN_impDEXP:
if (bt == FFEINFO_basictypeCOMPLEX)
{
if (kt == FFEINFO_kindtypeREAL1)
gfrt = FFECOM_gfrtCEXP; /* Overlapping result okay. */
else if (kt == FFEINFO_kindtypeREAL2)
gfrt = FFECOM_gfrtCDEXP; /* Overlapping result okay. */
}
break;
case FFEINTRIN_impICHAR:
case FFEINTRIN_impIACHAR:
#if 0 /* The simple approach. */
ffecom_char_args_ (&expr_tree, &saved_expr1 /* Ignored */ , arg1);
expr_tree
= ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (expr_tree))),
expr_tree);
expr_tree
= ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (expr_tree))),
expr_tree,
integer_one_node);
return convert (tree_type, expr_tree);
#else /* The more interesting (and more optimal) approach. */
expr_tree = ffecom_intrinsic_ichar_ (tree_type, arg1, &saved_expr1);
expr_tree = ffecom_3 (COND_EXPR, tree_type,
saved_expr1,
expr_tree,
convert (tree_type, integer_zero_node));
return expr_tree;
#endif
case FFEINTRIN_impINDEX:
break;
case FFEINTRIN_impLEN:
#if 0
break; /* The simple approach. */
#else
return ffecom_intrinsic_len_ (arg1); /* The more optimal approach. */
#endif
case FFEINTRIN_impLGE:
case FFEINTRIN_impLGT:
case FFEINTRIN_impLLE:
case FFEINTRIN_impLLT:
break;
case FFEINTRIN_impLOG:
case FFEINTRIN_impALOG:
case FFEINTRIN_impCDLOG:
case FFEINTRIN_impCLOG:
case FFEINTRIN_impDLOG:
if (bt == FFEINFO_basictypeCOMPLEX)
{
if (kt == FFEINFO_kindtypeREAL1)
gfrt = FFECOM_gfrtCLOG; /* Overlapping result okay. */
else if (kt == FFEINFO_kindtypeREAL2)
gfrt = FFECOM_gfrtCDLOG; /* Overlapping result okay. */
}
break;
case FFEINTRIN_impLOG10:
case FFEINTRIN_impALOG10:
case FFEINTRIN_impDLOG10:
if (gfrt != FFECOM_gfrt)
break; /* Already picked one, stick with it. */
if (kt == FFEINFO_kindtypeREAL1)
gfrt = FFECOM_gfrtALOG10;
else if (kt == FFEINFO_kindtypeREAL2)
gfrt = FFECOM_gfrtDLOG10;
break;
case FFEINTRIN_impMAX:
case FFEINTRIN_impAMAX0:
case FFEINTRIN_impAMAX1:
case FFEINTRIN_impDMAX1:
case FFEINTRIN_impMAX0:
case FFEINTRIN_impMAX1:
if (bt != ffeinfo_basictype (ffebld_info (arg1)))
arg1_type = ffecom_widest_expr_type_ (ffebld_right (expr));
else
arg1_type = tree_type;
expr_tree = ffecom_2 (MAX_EXPR, arg1_type,
convert (arg1_type, ffecom_expr (arg1)),
convert (arg1_type, ffecom_expr (arg2)));
for (; list != NULL; list = ffebld_trail (list))
{
if ((ffebld_head (list) == NULL)
|| (ffebld_op (ffebld_head (list)) == FFEBLD_opANY))
continue;
expr_tree = ffecom_2 (MAX_EXPR, arg1_type,
expr_tree,
convert (arg1_type,
ffecom_expr (ffebld_head (list))));
}
return convert (tree_type, expr_tree);
case FFEINTRIN_impMIN:
case FFEINTRIN_impAMIN0:
case FFEINTRIN_impAMIN1:
case FFEINTRIN_impDMIN1:
case FFEINTRIN_impMIN0:
case FFEINTRIN_impMIN1:
if (bt != ffeinfo_basictype (ffebld_info (arg1)))
arg1_type = ffecom_widest_expr_type_ (ffebld_right (expr));
else
arg1_type = tree_type;
expr_tree = ffecom_2 (MIN_EXPR, arg1_type,
convert (arg1_type, ffecom_expr (arg1)),
convert (arg1_type, ffecom_expr (arg2)));
for (; list != NULL; list = ffebld_trail (list))
{
if ((ffebld_head (list) == NULL)
|| (ffebld_op (ffebld_head (list)) == FFEBLD_opANY))
continue;
expr_tree = ffecom_2 (MIN_EXPR, arg1_type,
expr_tree,
convert (arg1_type,
ffecom_expr (ffebld_head (list))));
}
return convert (tree_type, expr_tree);
case FFEINTRIN_impMOD:
case FFEINTRIN_impAMOD:
case FFEINTRIN_impDMOD:
if (bt != FFEINFO_basictypeREAL)
return ffecom_2 (TRUNC_MOD_EXPR, tree_type,
convert (tree_type, ffecom_expr (arg1)),
convert (tree_type, ffecom_expr (arg2)));
if (kt == FFEINFO_kindtypeREAL1)
gfrt = FFECOM_gfrtAMOD;
else if (kt == FFEINFO_kindtypeREAL2)
gfrt = FFECOM_gfrtDMOD;
break;
case FFEINTRIN_impNINT:
case FFEINTRIN_impIDNINT:
#if 0 /* ~~ ideally FIX_ROUND_EXPR would be
implemented, but it ain't yet */
return ffecom_1 (FIX_ROUND_EXPR, tree_type, ffecom_expr (arg1));
#else
/* i__1 = r1 >= 0 ? floor(r1 + .5) : -floor(.5 - r1); */
saved_expr1 = ffecom_save_tree (ffecom_expr (arg1));
return
convert (ffecom_integer_type_node,
ffecom_3 (COND_EXPR, arg1_type,
ffecom_truth_value
(ffecom_2 (GE_EXPR, integer_type_node,
saved_expr1,
convert (arg1_type,
ffecom_float_zero_))),
ffecom_2 (PLUS_EXPR, arg1_type,
saved_expr1,
convert (arg1_type,
ffecom_float_half_)),
ffecom_2 (MINUS_EXPR, arg1_type,
saved_expr1,
convert (arg1_type,
ffecom_float_half_))));
#endif
case FFEINTRIN_impSIGN:
case FFEINTRIN_impDSIGN:
case FFEINTRIN_impISIGN:
{
tree arg2_tree = ffecom_expr (arg2);
saved_expr1
= ffecom_save_tree
(ffecom_1 (ABS_EXPR, tree_type,
convert (tree_type,
ffecom_expr (arg1))));
expr_tree
= ffecom_3 (COND_EXPR, tree_type,
ffecom_truth_value
(ffecom_2 (GE_EXPR, integer_type_node,
arg2_tree,
convert (TREE_TYPE (arg2_tree),
integer_zero_node))),
saved_expr1,
ffecom_1 (NEGATE_EXPR, tree_type, saved_expr1));
/* Make sure SAVE_EXPRs get referenced early enough. */
expr_tree
= ffecom_2 (COMPOUND_EXPR, tree_type,
convert (void_type_node, saved_expr1),
expr_tree);
}
return expr_tree;
case FFEINTRIN_impSIN:
case FFEINTRIN_impCDSIN:
case FFEINTRIN_impCSIN:
case FFEINTRIN_impDSIN:
if (bt == FFEINFO_basictypeCOMPLEX)
{
if (kt == FFEINFO_kindtypeREAL1)
gfrt = FFECOM_gfrtCSIN; /* Overlapping result okay. */
else if (kt == FFEINFO_kindtypeREAL2)
gfrt = FFECOM_gfrtCDSIN; /* Overlapping result okay. */
}
break;
case FFEINTRIN_impSINH:
case FFEINTRIN_impDSINH:
break;
case FFEINTRIN_impSQRT:
case FFEINTRIN_impCDSQRT:
case FFEINTRIN_impCSQRT:
case FFEINTRIN_impDSQRT:
if (bt == FFEINFO_basictypeCOMPLEX)
{
if (kt == FFEINFO_kindtypeREAL1)
gfrt = FFECOM_gfrtCSQRT; /* Overlapping result okay. */
else if (kt == FFEINFO_kindtypeREAL2)
gfrt = FFECOM_gfrtCDSQRT; /* Overlapping result okay. */
}
break;
case FFEINTRIN_impTAN:
case FFEINTRIN_impDTAN:
case FFEINTRIN_impTANH:
case FFEINTRIN_impDTANH:
break;
case FFEINTRIN_impREALPART:
if (TREE_CODE (arg1_type) == COMPLEX_TYPE)
arg1_type = TREE_TYPE (arg1_type);
else
arg1_type = TREE_TYPE (TYPE_FIELDS (arg1_type));
return
convert (tree_type,
ffecom_1 (REALPART_EXPR, arg1_type,
ffecom_expr (arg1)));
case FFEINTRIN_impIAND:
case FFEINTRIN_impAND:
return ffecom_2 (BIT_AND_EXPR, tree_type,
convert (tree_type,
ffecom_expr (arg1)),
convert (tree_type,
ffecom_expr (arg2)));
case FFEINTRIN_impIOR:
case FFEINTRIN_impOR:
return ffecom_2 (BIT_IOR_EXPR, tree_type,
convert (tree_type,
ffecom_expr (arg1)),
convert (tree_type,
ffecom_expr (arg2)));
case FFEINTRIN_impIEOR:
case FFEINTRIN_impXOR:
return ffecom_2 (BIT_XOR_EXPR, tree_type,
convert (tree_type,
ffecom_expr (arg1)),
convert (tree_type,
ffecom_expr (arg2)));
case FFEINTRIN_impLSHIFT:
return ffecom_2 (LSHIFT_EXPR, tree_type,
ffecom_expr (arg1),
convert (integer_type_node,
ffecom_expr (arg2)));
case FFEINTRIN_impRSHIFT:
return ffecom_2 (RSHIFT_EXPR, tree_type,
ffecom_expr (arg1),
convert (integer_type_node,
ffecom_expr (arg2)));
case FFEINTRIN_impNOT:
return ffecom_1 (BIT_NOT_EXPR, tree_type, ffecom_expr (arg1));
case FFEINTRIN_impBIT_SIZE:
return convert (tree_type, TYPE_SIZE (arg1_type));
case FFEINTRIN_impBTEST:
{
ffetargetLogical1 true;
ffetargetLogical1 false;
tree true_tree;
tree false_tree;
ffetarget_logical1 (&true, TRUE);
ffetarget_logical1 (&false, FALSE);
if (true == 1)
true_tree = convert (tree_type, integer_one_node);
else
true_tree = convert (tree_type, build_int_2 (true, 0));
if (false == 0)
false_tree = convert (tree_type, integer_zero_node);
else
false_tree = convert (tree_type, build_int_2 (false, 0));
return
ffecom_3 (COND_EXPR, tree_type,
ffecom_truth_value
(ffecom_2 (EQ_EXPR, integer_type_node,
ffecom_2 (BIT_AND_EXPR, arg1_type,
ffecom_expr (arg1),
ffecom_2 (LSHIFT_EXPR, arg1_type,
convert (arg1_type,
integer_one_node),
convert (integer_type_node,
ffecom_expr (arg2)))),
convert (arg1_type,
integer_zero_node))),
false_tree,
true_tree);
}
case FFEINTRIN_impIBCLR:
return
ffecom_2 (BIT_AND_EXPR, tree_type,
ffecom_expr (arg1),
ffecom_1 (BIT_NOT_EXPR, tree_type,
ffecom_2 (LSHIFT_EXPR, tree_type,
convert (tree_type,
integer_one_node),
convert (integer_type_node,
ffecom_expr (arg2)))));
case FFEINTRIN_impIBITS:
{
tree arg3_tree = ffecom_save_tree (convert (integer_type_node,
ffecom_expr (arg3)));
tree uns_type
= ffecom_tree_type[FFEINFO_basictypeHOLLERITH][kt];
expr_tree
= ffecom_2 (BIT_AND_EXPR, tree_type,
ffecom_2 (RSHIFT_EXPR, tree_type,
ffecom_expr (arg1),
convert (integer_type_node,
ffecom_expr (arg2))),
convert (tree_type,
ffecom_2 (RSHIFT_EXPR, uns_type,
ffecom_1 (BIT_NOT_EXPR,
uns_type,
convert (uns_type,
integer_zero_node)),
ffecom_2 (MINUS_EXPR,
integer_type_node,
TYPE_SIZE (uns_type),
arg3_tree))));
#if !defined(TREE_SHIFT_FULLWIDTH) || !TREE_SHIFT_FULLWIDTH
expr_tree
= ffecom_3 (COND_EXPR, tree_type,
ffecom_truth_value
(ffecom_2 (NE_EXPR, integer_type_node,
arg3_tree,
integer_zero_node)),
expr_tree,
convert (tree_type, integer_zero_node));
#endif
}
return expr_tree;
case FFEINTRIN_impIBSET:
return
ffecom_2 (BIT_IOR_EXPR, tree_type,
ffecom_expr (arg1),
ffecom_2 (LSHIFT_EXPR, tree_type,
convert (tree_type, integer_one_node),
convert (integer_type_node,
ffecom_expr (arg2))));
case FFEINTRIN_impISHFT:
{
tree arg1_tree = ffecom_save_tree (ffecom_expr (arg1));
tree arg2_tree = ffecom_save_tree (convert (integer_type_node,
ffecom_expr (arg2)));
tree uns_type
= ffecom_tree_type[FFEINFO_basictypeHOLLERITH][kt];
expr_tree
= ffecom_3 (COND_EXPR, tree_type,
ffecom_truth_value
(ffecom_2 (GE_EXPR, integer_type_node,
arg2_tree,
integer_zero_node)),
ffecom_2 (LSHIFT_EXPR, tree_type,
arg1_tree,
arg2_tree),
convert (tree_type,
ffecom_2 (RSHIFT_EXPR, uns_type,
convert (uns_type, arg1_tree),
ffecom_1 (NEGATE_EXPR,
integer_type_node,
arg2_tree))));
#if !defined(TREE_SHIFT_FULLWIDTH) || !TREE_SHIFT_FULLWIDTH
expr_tree
= ffecom_3 (COND_EXPR, tree_type,
ffecom_truth_value
(ffecom_2 (NE_EXPR, integer_type_node,
arg2_tree,
TYPE_SIZE (uns_type))),
expr_tree,
convert (tree_type, integer_zero_node));
#endif
/* Make sure SAVE_EXPRs get referenced early enough. */
expr_tree
= ffecom_2 (COMPOUND_EXPR, tree_type,
convert (void_type_node, arg1_tree),
ffecom_2 (COMPOUND_EXPR, tree_type,
convert (void_type_node, arg2_tree),
expr_tree));
}
return expr_tree;
case FFEINTRIN_impISHFTC:
{
tree arg1_tree = ffecom_save_tree (ffecom_expr (arg1));
tree arg2_tree = ffecom_save_tree (convert (integer_type_node,
ffecom_expr (arg2)));
tree arg3_tree = (arg3 == NULL) ? TYPE_SIZE (tree_type)
: ffecom_save_tree (convert (integer_type_node, ffecom_expr (arg3)));
tree shift_neg;
tree shift_pos;
tree mask_arg1;
tree masked_arg1;
tree uns_type
= ffecom_tree_type[FFEINFO_basictypeHOLLERITH][kt];
mask_arg1
= ffecom_2 (LSHIFT_EXPR, tree_type,
ffecom_1 (BIT_NOT_EXPR, tree_type,
convert (tree_type, integer_zero_node)),
arg3_tree);
#if !defined(TREE_SHIFT_FULLWIDTH) || !TREE_SHIFT_FULLWIDTH
mask_arg1
= ffecom_3 (COND_EXPR, tree_type,
ffecom_truth_value
(ffecom_2 (NE_EXPR, integer_type_node,
arg3_tree,
TYPE_SIZE (uns_type))),
mask_arg1,
convert (tree_type, integer_zero_node));
#endif
mask_arg1 = ffecom_save_tree (mask_arg1);
masked_arg1
= ffecom_2 (BIT_AND_EXPR, tree_type,
arg1_tree,
ffecom_1 (BIT_NOT_EXPR, tree_type,
mask_arg1));
masked_arg1 = ffecom_save_tree (masked_arg1);
shift_neg
= ffecom_2 (BIT_IOR_EXPR, tree_type,
convert (tree_type,
ffecom_2 (RSHIFT_EXPR, uns_type,
convert (uns_type, masked_arg1),
ffecom_1 (NEGATE_EXPR,
integer_type_node,
arg2_tree))),
ffecom_2 (LSHIFT_EXPR, tree_type,
arg1_tree,
ffecom_2 (PLUS_EXPR, integer_type_node,
arg2_tree,
arg3_tree)));
shift_pos
= ffecom_2 (BIT_IOR_EXPR, tree_type,
ffecom_2 (LSHIFT_EXPR, tree_type,
arg1_tree,
arg2_tree),
convert (tree_type,
ffecom_2 (RSHIFT_EXPR, uns_type,
convert (uns_type, masked_arg1),
ffecom_2 (MINUS_EXPR,
integer_type_node,
arg3_tree,
arg2_tree))));
expr_tree
= ffecom_3 (COND_EXPR, tree_type,
ffecom_truth_value
(ffecom_2 (LT_EXPR, integer_type_node,
arg2_tree,
integer_zero_node)),
shift_neg,
shift_pos);
expr_tree
= ffecom_2 (BIT_IOR_EXPR, tree_type,
ffecom_2 (BIT_AND_EXPR, tree_type,
mask_arg1,
arg1_tree),
ffecom_2 (BIT_AND_EXPR, tree_type,
ffecom_1 (BIT_NOT_EXPR, tree_type,
mask_arg1),
expr_tree));
expr_tree
= ffecom_3 (COND_EXPR, tree_type,
ffecom_truth_value
(ffecom_2 (TRUTH_ORIF_EXPR, integer_type_node,
ffecom_2 (EQ_EXPR, integer_type_node,
ffecom_1 (ABS_EXPR,
integer_type_node,
arg2_tree),
arg3_tree),
ffecom_2 (EQ_EXPR, integer_type_node,
arg2_tree,
integer_zero_node))),
arg1_tree,
expr_tree);
/* Make sure SAVE_EXPRs get referenced early enough. */
expr_tree
= ffecom_2 (COMPOUND_EXPR, tree_type,
convert (void_type_node, arg1_tree),
ffecom_2 (COMPOUND_EXPR, tree_type,
convert (void_type_node, arg2_tree),
ffecom_2 (COMPOUND_EXPR, tree_type,
convert (void_type_node,
mask_arg1),
ffecom_2 (COMPOUND_EXPR, tree_type,
convert (void_type_node,
masked_arg1),
expr_tree))));
expr_tree
= ffecom_2 (COMPOUND_EXPR, tree_type,
convert (void_type_node,
arg3_tree),
expr_tree);
}
return expr_tree;
case FFEINTRIN_impLOC:
{
tree arg1_tree = ffecom_expr (arg1);
expr_tree
= convert (tree_type,
ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (arg1_tree)),
arg1_tree));
}
return expr_tree;
case FFEINTRIN_impMVBITS:
{
tree arg1_tree;
tree arg2_tree;
tree arg3_tree;
ffebld arg4 = ffebld_head (ffebld_trail (list));
tree arg4_tree;
tree arg4_type;
ffebld arg5 = ffebld_head (ffebld_trail (ffebld_trail (list)));
tree arg5_tree;
tree prep_arg1;
tree prep_arg4;
tree arg5_plus_arg3;
ffecom_push_calltemps ();
arg2_tree = convert (integer_type_node,
ffecom_expr (arg2));
arg3_tree = ffecom_save_tree (convert (integer_type_node,
ffecom_expr (arg3)));
arg4_tree = ffecom_expr_rw (arg4);
arg4_type = TREE_TYPE (arg4_tree);
arg1_tree = ffecom_save_tree (convert (arg4_type,
ffecom_expr (arg1)));
arg5_tree = ffecom_save_tree (convert (integer_type_node,
ffecom_expr (arg5)));
ffecom_pop_calltemps ();
prep_arg1
= ffecom_2 (LSHIFT_EXPR, arg4_type,
ffecom_2 (BIT_AND_EXPR, arg4_type,
ffecom_2 (RSHIFT_EXPR, arg4_type,
arg1_tree,
arg2_tree),
ffecom_1 (BIT_NOT_EXPR, arg4_type,
ffecom_2 (LSHIFT_EXPR, arg4_type,
ffecom_1 (BIT_NOT_EXPR,
arg4_type,
convert
(arg4_type,
integer_zero_node)),
arg3_tree))),
arg5_tree);
arg5_plus_arg3
= ffecom_save_tree (ffecom_2 (PLUS_EXPR, arg4_type,
arg5_tree,
arg3_tree));
prep_arg4
= ffecom_2 (LSHIFT_EXPR, arg4_type,
ffecom_1 (BIT_NOT_EXPR, arg4_type,
convert (arg4_type,
integer_zero_node)),
arg5_plus_arg3);
#if !defined(TREE_SHIFT_FULLWIDTH) || !TREE_SHIFT_FULLWIDTH
prep_arg4
= ffecom_3 (COND_EXPR, arg4_type,
ffecom_truth_value
(ffecom_2 (NE_EXPR, integer_type_node,
arg5_plus_arg3,
convert (TREE_TYPE (arg5_plus_arg3),
TYPE_SIZE (arg4_type)))),
prep_arg4,
convert (arg4_type, integer_zero_node));
#endif
prep_arg4
= ffecom_2 (BIT_AND_EXPR, arg4_type,
arg4_tree,
ffecom_2 (BIT_IOR_EXPR, arg4_type,
prep_arg4,
ffecom_1 (BIT_NOT_EXPR, arg4_type,
ffecom_2 (LSHIFT_EXPR, arg4_type,
ffecom_1 (BIT_NOT_EXPR,
arg4_type,
convert
(arg4_type,
integer_zero_node)),
arg5_tree))));
prep_arg1
= ffecom_2 (BIT_IOR_EXPR, arg4_type,
prep_arg1,
prep_arg4);
#if !defined(TREE_SHIFT_FULLWIDTH) || !TREE_SHIFT_FULLWIDTH
prep_arg1
= ffecom_3 (COND_EXPR, arg4_type,
ffecom_truth_value
(ffecom_2 (NE_EXPR, integer_type_node,
arg3_tree,
convert (TREE_TYPE (arg3_tree),
integer_zero_node))),
prep_arg1,
arg4_tree);
prep_arg1
= ffecom_3 (COND_EXPR, arg4_type,
ffecom_truth_value
(ffecom_2 (NE_EXPR, integer_type_node,
arg3_tree,
convert (TREE_TYPE (arg3_tree),
TYPE_SIZE (arg4_type)))),
prep_arg1,
arg1_tree);
#endif
expr_tree
= ffecom_2s (MODIFY_EXPR, void_type_node,
arg4_tree,
prep_arg1);
/* Make sure SAVE_EXPRs get referenced early enough. */
expr_tree
= ffecom_2 (COMPOUND_EXPR, void_type_node,
arg1_tree,
ffecom_2 (COMPOUND_EXPR, void_type_node,
arg3_tree,
ffecom_2 (COMPOUND_EXPR, void_type_node,
arg5_tree,
ffecom_2 (COMPOUND_EXPR, void_type_node,
arg5_plus_arg3,
expr_tree))));
expr_tree
= ffecom_2 (COMPOUND_EXPR, void_type_node,
arg4_tree,
expr_tree);
}
return expr_tree;
case FFEINTRIN_impDERF:
case FFEINTRIN_impERF:
case FFEINTRIN_impDERFC:
case FFEINTRIN_impERFC:
break;
case FFEINTRIN_impIARGC:
/* extern int xargc; i__1 = xargc - 1; */
expr_tree = ffecom_2 (MINUS_EXPR, TREE_TYPE (ffecom_tree_xargc_),
ffecom_tree_xargc_,
convert (TREE_TYPE (ffecom_tree_xargc_),
integer_one_node));
return expr_tree;
case FFEINTRIN_impSIGNAL_func:
case FFEINTRIN_impSIGNAL_subr:
{
tree arg1_tree;
tree arg2_tree;
tree arg3_tree;
ffecom_push_calltemps ();
arg1_tree = convert (ffecom_f2c_integer_type_node,
ffecom_expr (arg1));
arg1_tree = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (arg1_tree)),
arg1_tree);
/* Pass procedure as a pointer to it, anything else by value. */
if (ffeinfo_kind (ffebld_info (arg2)) == FFEINFO_kindENTITY)
arg2_tree = convert (integer_type_node, ffecom_expr (arg2));
else
arg2_tree = ffecom_ptr_to_expr (arg2);
arg2_tree = convert (TREE_TYPE (null_pointer_node),
arg2_tree);
if (arg3 != NULL)
arg3_tree = ffecom_expr_rw (arg3);
else
arg3_tree = NULL_TREE;
ffecom_pop_calltemps ();
arg1_tree = build_tree_list (NULL_TREE, arg1_tree);
arg2_tree = build_tree_list (NULL_TREE, arg2_tree);
TREE_CHAIN (arg1_tree) = arg2_tree;
expr_tree
= ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
((codegen_imp == FFEINTRIN_impSIGNAL_subr) ?
NULL_TREE :
tree_type),
arg1_tree,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
if (arg3_tree != NULL_TREE)
expr_tree
= ffecom_modify (NULL_TREE, arg3_tree,
convert (TREE_TYPE (arg3_tree),
expr_tree));
}
return expr_tree;
case FFEINTRIN_impALARM:
{
tree arg1_tree;
tree arg2_tree;
tree arg3_tree;
ffecom_push_calltemps ();
arg1_tree = convert (ffecom_f2c_integer_type_node,
ffecom_expr (arg1));
arg1_tree = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (arg1_tree)),
arg1_tree);
/* Pass procedure as a pointer to it, anything else by value. */
if (ffeinfo_kind (ffebld_info (arg2)) == FFEINFO_kindENTITY)
arg2_tree = convert (integer_type_node, ffecom_expr (arg2));
else
arg2_tree = ffecom_ptr_to_expr (arg2);
arg2_tree = convert (TREE_TYPE (null_pointer_node),
arg2_tree);
if (arg3 != NULL)
arg3_tree = ffecom_expr_rw (arg3);
else
arg3_tree = NULL_TREE;
ffecom_pop_calltemps ();
arg1_tree = build_tree_list (NULL_TREE, arg1_tree);
arg2_tree = build_tree_list (NULL_TREE, arg2_tree);
TREE_CHAIN (arg1_tree) = arg2_tree;
expr_tree
= ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
arg1_tree,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
if (arg3_tree != NULL_TREE)
expr_tree
= ffecom_modify (NULL_TREE, arg3_tree,
convert (TREE_TYPE (arg3_tree),
expr_tree));
}
return expr_tree;
case FFEINTRIN_impCHDIR_subr:
case FFEINTRIN_impFDATE_subr:
case FFEINTRIN_impFGET_subr:
case FFEINTRIN_impFPUT_subr:
case FFEINTRIN_impGETCWD_subr:
case FFEINTRIN_impHOSTNM_subr:
case FFEINTRIN_impSYSTEM_subr:
case FFEINTRIN_impUNLINK_subr:
{
tree arg1_len = integer_zero_node;
tree arg1_tree;
tree arg2_tree;
ffecom_push_calltemps ();
arg1_tree = ffecom_arg_ptr_to_expr (arg1, &arg1_len);
if (arg2 != NULL)
arg2_tree = ffecom_expr_rw (arg2);
else
arg2_tree = NULL_TREE;
ffecom_pop_calltemps ();
arg1_tree = build_tree_list (NULL_TREE, arg1_tree);
arg1_len = build_tree_list (NULL_TREE, arg1_len);
TREE_CHAIN (arg1_tree) = arg1_len;
expr_tree
= ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
arg1_tree,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
if (arg2_tree != NULL_TREE)
expr_tree
= ffecom_modify (NULL_TREE, arg2_tree,
convert (TREE_TYPE (arg2_tree),
expr_tree));
}
return expr_tree;
case FFEINTRIN_impEXIT:
if (arg1 != NULL)
break;
expr_tree = build_tree_list (NULL_TREE,
ffecom_1 (ADDR_EXPR,
build_pointer_type
(ffecom_integer_type_node),
integer_zero_node));
return
ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
void_type_node,
expr_tree,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
case FFEINTRIN_impFLUSH:
if (arg1 == NULL)
gfrt = FFECOM_gfrtFLUSH;
else
gfrt = FFECOM_gfrtFLUSH1;
break;
case FFEINTRIN_impCHMOD_subr:
case FFEINTRIN_impLINK_subr:
case FFEINTRIN_impRENAME_subr:
case FFEINTRIN_impSYMLNK_subr:
{
tree arg1_len = integer_zero_node;
tree arg1_tree;
tree arg2_len = integer_zero_node;
tree arg2_tree;
tree arg3_tree;
ffecom_push_calltemps ();
arg1_tree = ffecom_arg_ptr_to_expr (arg1, &arg1_len);
arg2_tree = ffecom_arg_ptr_to_expr (arg2, &arg2_len);
if (arg3 != NULL)
arg3_tree = ffecom_expr_rw (arg3);
else
arg3_tree = NULL_TREE;
ffecom_pop_calltemps ();
arg1_tree = build_tree_list (NULL_TREE, arg1_tree);
arg1_len = build_tree_list (NULL_TREE, arg1_len);
arg2_tree = build_tree_list (NULL_TREE, arg2_tree);
arg2_len = build_tree_list (NULL_TREE, arg2_len);
TREE_CHAIN (arg1_tree) = arg2_tree;
TREE_CHAIN (arg2_tree) = arg1_len;
TREE_CHAIN (arg1_len) = arg2_len;
expr_tree = ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
arg1_tree,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
if (arg3_tree != NULL_TREE)
expr_tree = ffecom_modify (NULL_TREE, arg3_tree,
convert (TREE_TYPE (arg3_tree),
expr_tree));
}
return expr_tree;
case FFEINTRIN_impLSTAT_subr:
case FFEINTRIN_impSTAT_subr:
{
tree arg1_len = integer_zero_node;
tree arg1_tree;
tree arg2_tree;
tree arg3_tree;
ffecom_push_calltemps ();
arg1_tree = ffecom_arg_ptr_to_expr (arg1, &arg1_len);
arg2_tree = ffecom_ptr_to_expr (arg2);
if (arg3 != NULL)
arg3_tree = ffecom_expr_rw (arg3);
else
arg3_tree = NULL_TREE;
ffecom_pop_calltemps ();
arg1_tree = build_tree_list (NULL_TREE, arg1_tree);
arg1_len = build_tree_list (NULL_TREE, arg1_len);
arg2_tree = build_tree_list (NULL_TREE, arg2_tree);
TREE_CHAIN (arg1_tree) = arg2_tree;
TREE_CHAIN (arg2_tree) = arg1_len;
expr_tree = ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
arg1_tree,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
if (arg3_tree != NULL_TREE)
expr_tree = ffecom_modify (NULL_TREE, arg3_tree,
convert (TREE_TYPE (arg3_tree),
expr_tree));
}
return expr_tree;
case FFEINTRIN_impFGETC_subr:
case FFEINTRIN_impFPUTC_subr:
{
tree arg1_tree;
tree arg2_tree;
tree arg2_len = integer_zero_node;
tree arg3_tree;
ffecom_push_calltemps ();
arg1_tree = convert (ffecom_f2c_integer_type_node,
ffecom_expr (arg1));
arg1_tree = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (arg1_tree)),
arg1_tree);
arg2_tree = ffecom_arg_ptr_to_expr (arg2, &arg2_len);
arg3_tree = ffecom_expr_rw (arg3);
ffecom_pop_calltemps ();
arg1_tree = build_tree_list (NULL_TREE, arg1_tree);
arg2_tree = build_tree_list (NULL_TREE, arg2_tree);
arg2_len = build_tree_list (NULL_TREE, arg2_len);
TREE_CHAIN (arg1_tree) = arg2_tree;
TREE_CHAIN (arg2_tree) = arg2_len;
expr_tree = ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
arg1_tree,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
expr_tree = ffecom_modify (NULL_TREE, arg3_tree,
convert (TREE_TYPE (arg3_tree),
expr_tree));
}
return expr_tree;
case FFEINTRIN_impFSTAT_subr:
{
tree arg1_tree;
tree arg2_tree;
tree arg3_tree;
ffecom_push_calltemps ();
arg1_tree = convert (ffecom_f2c_integer_type_node,
ffecom_expr (arg1));
arg1_tree = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (arg1_tree)),
arg1_tree);
arg2_tree = convert (ffecom_f2c_ptr_to_integer_type_node,
ffecom_ptr_to_expr (arg2));
if (arg3 == NULL)
arg3_tree = NULL_TREE;
else
arg3_tree = ffecom_expr_rw (arg3);
ffecom_pop_calltemps ();
arg1_tree = build_tree_list (NULL_TREE, arg1_tree);
arg2_tree = build_tree_list (NULL_TREE, arg2_tree);
TREE_CHAIN (arg1_tree) = arg2_tree;
expr_tree = ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
arg1_tree,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
if (arg3_tree != NULL_TREE) {
expr_tree = ffecom_modify (NULL_TREE, arg3_tree,
convert (TREE_TYPE (arg3_tree),
expr_tree));
}
}
return expr_tree;
case FFEINTRIN_impKILL_subr:
{
tree arg1_tree;
tree arg2_tree;
tree arg3_tree;
ffecom_push_calltemps ();
arg1_tree = convert (ffecom_f2c_integer_type_node,
ffecom_expr (arg1));
arg1_tree = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (arg1_tree)),
arg1_tree);
arg2_tree = convert (ffecom_f2c_integer_type_node,
ffecom_expr (arg2));
arg2_tree = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (arg2_tree)),
arg2_tree);
if (arg3 == NULL)
arg3_tree = NULL_TREE;
else
arg3_tree = ffecom_expr_rw (arg3);
ffecom_pop_calltemps ();
arg1_tree = build_tree_list (NULL_TREE, arg1_tree);
arg2_tree = build_tree_list (NULL_TREE, arg2_tree);
TREE_CHAIN (arg1_tree) = arg2_tree;
expr_tree = ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
arg1_tree,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
if (arg3_tree != NULL_TREE) {
expr_tree = ffecom_modify (NULL_TREE, arg3_tree,
convert (TREE_TYPE (arg3_tree),
expr_tree));
}
}
return expr_tree;
case FFEINTRIN_impCTIME_subr:
case FFEINTRIN_impTTYNAM_subr:
{
tree arg1_len = integer_zero_node;
tree arg1_tree;
tree arg2_tree;
ffecom_push_calltemps ();
arg1_tree = ffecom_arg_ptr_to_expr (arg1, &arg1_len);
arg2_tree = convert (((gfrt == FFEINTRIN_impCTIME_subr) ?
ffecom_f2c_longint_type_node :
ffecom_f2c_integer_type_node),
ffecom_expr (arg2));
arg2_tree = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (arg2_tree)),
arg2_tree);
ffecom_pop_calltemps ();
arg1_tree = build_tree_list (NULL_TREE, arg1_tree);
arg1_len = build_tree_list (NULL_TREE, arg1_len);
arg2_tree = build_tree_list (NULL_TREE, arg2_tree);
TREE_CHAIN (arg1_len) = arg2_tree;
TREE_CHAIN (arg1_tree) = arg1_len;
expr_tree
= ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
arg1_tree,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
}
return expr_tree;
case FFEINTRIN_impIRAND:
case FFEINTRIN_impRAND:
/* Arg defaults to 0 (normal random case) */
{
tree arg1_tree;
if (arg1 == NULL)
arg1_tree = ffecom_integer_zero_node;
else
arg1_tree = ffecom_expr (arg1);
arg1_tree = convert (ffecom_f2c_integer_type_node,
arg1_tree);
arg1_tree = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (arg1_tree)),
arg1_tree);
arg1_tree = build_tree_list (NULL_TREE, arg1_tree);
expr_tree = ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
((codegen_imp == FFEINTRIN_impIRAND) ?
ffecom_f2c_integer_type_node :
ffecom_f2c_doublereal_type_node),
arg1_tree,
dest_tree, dest, dest_used,
NULL_TREE, TRUE);
}
return expr_tree;
case FFEINTRIN_impFTELL_subr:
case FFEINTRIN_impUMASK_subr:
{
tree arg1_tree;
tree arg2_tree;
ffecom_push_calltemps ();
arg1_tree = convert (ffecom_f2c_integer_type_node,
ffecom_expr (arg1));
arg1_tree = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (arg1_tree)),
arg1_tree);
if (arg2 == NULL)
arg2_tree = NULL_TREE;
else
arg2_tree = ffecom_expr_rw (arg2);
ffecom_pop_calltemps ();
expr_tree = ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
build_tree_list (NULL_TREE, arg1_tree),
NULL_TREE, NULL, NULL, NULL_TREE,
TRUE);
if (arg2_tree != NULL_TREE) {
expr_tree = ffecom_modify (NULL_TREE, arg2_tree,
convert (TREE_TYPE (arg2_tree),
expr_tree));
}
}
return expr_tree;
case FFEINTRIN_impCPU_TIME:
case FFEINTRIN_impSECOND_subr:
{
tree arg1_tree;
ffecom_push_calltemps ();
arg1_tree = ffecom_expr_rw (arg1);
ffecom_pop_calltemps ();
expr_tree
= ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
NULL_TREE,
NULL_TREE, NULL, NULL, NULL_TREE, TRUE);
expr_tree
= ffecom_modify (NULL_TREE, arg1_tree,
convert (TREE_TYPE (arg1_tree),
expr_tree));
}
return expr_tree;
case FFEINTRIN_impDTIME_subr:
case FFEINTRIN_impETIME_subr:
{
tree arg1_tree;
tree arg2_tree;
ffecom_push_calltemps ();
arg1_tree = ffecom_expr_rw (arg1);
arg2_tree = ffecom_ptr_to_expr (arg2);
ffecom_pop_calltemps ();
expr_tree = ffecom_call_ (ffecom_gfrt_tree_ (gfrt),
ffecom_gfrt_kindtype (gfrt),
FALSE,
NULL_TREE,
build_tree_list (NULL_TREE, arg2_tree),
NULL_TREE, NULL, NULL, NULL_TREE,
TRUE);
expr_tree = ffecom_modify (NULL_TREE, arg1_tree,
convert (TREE_TYPE (arg1_tree),
expr_tree));
}
return expr_tree;
/* Straightforward calls of libf2c routines: */
case FFEINTRIN_impABORT:
case FFEINTRIN_impACCESS:
case FFEINTRIN_impBESJ0:
case FFEINTRIN_impBESJ1:
case FFEINTRIN_impBESJN:
case FFEINTRIN_impBESY0:
case FFEINTRIN_impBESY1:
case FFEINTRIN_impBESYN:
case FFEINTRIN_impCHDIR_func:
case FFEINTRIN_impCHMOD_func:
case FFEINTRIN_impDATE:
case FFEINTRIN_impDATE_AND_TIME:
case FFEINTRIN_impDBESJ0:
case FFEINTRIN_impDBESJ1:
case FFEINTRIN_impDBESJN:
case FFEINTRIN_impDBESY0:
case FFEINTRIN_impDBESY1:
case FFEINTRIN_impDBESYN:
case FFEINTRIN_impDTIME_func:
case FFEINTRIN_impETIME_func:
case FFEINTRIN_impFGETC_func:
case FFEINTRIN_impFGET_func:
case FFEINTRIN_impFNUM:
case FFEINTRIN_impFPUTC_func:
case FFEINTRIN_impFPUT_func:
case FFEINTRIN_impFSEEK:
case FFEINTRIN_impFSTAT_func:
case FFEINTRIN_impFTELL_func:
case FFEINTRIN_impGERROR:
case FFEINTRIN_impGETARG:
case FFEINTRIN_impGETCWD_func:
case FFEINTRIN_impGETENV:
case FFEINTRIN_impGETGID:
case FFEINTRIN_impGETLOG:
case FFEINTRIN_impGETPID:
case FFEINTRIN_impGETUID:
case FFEINTRIN_impGMTIME:
case FFEINTRIN_impHOSTNM_func:
case FFEINTRIN_impIDATE_unix:
case FFEINTRIN_impIDATE_vxt:
case FFEINTRIN_impIERRNO:
case FFEINTRIN_impISATTY:
case FFEINTRIN_impITIME:
case FFEINTRIN_impKILL_func:
case FFEINTRIN_impLINK_func:
case FFEINTRIN_impLNBLNK:
case FFEINTRIN_impLSTAT_func:
case FFEINTRIN_impLTIME:
case FFEINTRIN_impMCLOCK8:
case FFEINTRIN_impMCLOCK:
case FFEINTRIN_impPERROR:
case FFEINTRIN_impRENAME_func:
case FFEINTRIN_impSECNDS:
case FFEINTRIN_impSECOND_func:
case FFEINTRIN_impSLEEP:
case FFEINTRIN_impSRAND:
case FFEINTRIN_impSTAT_func:
case FFEINTRIN_impSYMLNK_func:
case FFEINTRIN_impSYSTEM_CLOCK:
case FFEINTRIN_impSYSTEM_func:
case FFEINTRIN_impTIME8:
case FFEINTRIN_impTIME_unix:
case FFEINTRIN_impTIME_vxt:
case FFEINTRIN_impUMASK_func:
case FFEINTRIN_impUNLINK_func:
break;
case FFEINTRIN_impCTIME_func: /* CHARACTER functions not handled here. */
case FFEINTRIN_impFDATE_func: /* CHARACTER functions not handled here. */
case FFEINTRIN_impTTYNAM_func: /* CHARACTER functions not handled here. */
case FFEINTRIN_impNONE:
case FFEINTRIN_imp: /* Hush up gcc warning. */
fprintf (stderr, "No %s implementation.\n",
ffeintrin_name_implementation (ffebld_symter_implementation (ffebld_left (expr))));
assert ("unimplemented intrinsic" == NULL);
return error_mark_node;
}
assert (gfrt != FFECOM_gfrt); /* Must have an implementation! */
ffecom_push_calltemps ();
expr_tree = ffecom_arglist_expr_ (ffecom_gfrt_args_ (gfrt),
ffebld_right (expr));
ffecom_pop_calltemps ();
return ffecom_call_ (ffecom_gfrt_tree_ (gfrt), ffecom_gfrt_kindtype (gfrt),
(ffe_is_f2c_library () && ffecom_gfrt_complex_[gfrt]),
tree_type,
expr_tree, dest_tree, dest, dest_used,
NULL_TREE, TRUE);
/**INDENT* (Do not reformat this comment even with -fca option.)
Data-gathering files: Given the source file listed below, compiled with
f2c I obtained the output file listed after that, and from the output
file I derived the above code.
-------- (begin input file to f2c)
implicit none
character*10 A1,A2
complex C1,C2
integer I1,I2
real R1,R2
double precision D1,D2
C
call getem(A1,A2,C1,C2,I1,I2,R1,R2,D1,D2)
c /
call fooI(I1/I2)
call fooR(R1/I1)
call fooD(D1/I1)
call fooC(C1/I1)
call fooR(R1/R2)
call fooD(R1/D1)
call fooD(D1/D2)
call fooD(D1/R1)
call fooC(C1/C2)
call fooC(C1/R1)
call fooZ(C1/D1)
c **
call fooI(I1**I2)
call fooR(R1**I1)
call fooD(D1**I1)
call fooC(C1**I1)
call fooR(R1**R2)
call fooD(R1**D1)
call fooD(D1**D2)
call fooD(D1**R1)
call fooC(C1**C2)
call fooC(C1**R1)
call fooZ(C1**D1)
c FFEINTRIN_impABS
call fooR(ABS(R1))
c FFEINTRIN_impACOS
call fooR(ACOS(R1))
c FFEINTRIN_impAIMAG
call fooR(AIMAG(C1))
c FFEINTRIN_impAINT
call fooR(AINT(R1))
c FFEINTRIN_impALOG
call fooR(ALOG(R1))
c FFEINTRIN_impALOG10
call fooR(ALOG10(R1))
c FFEINTRIN_impAMAX0
call fooR(AMAX0(I1,I2))
c FFEINTRIN_impAMAX1
call fooR(AMAX1(R1,R2))
c FFEINTRIN_impAMIN0
call fooR(AMIN0(I1,I2))
c FFEINTRIN_impAMIN1
call fooR(AMIN1(R1,R2))
c FFEINTRIN_impAMOD
call fooR(AMOD(R1,R2))
c FFEINTRIN_impANINT
call fooR(ANINT(R1))
c FFEINTRIN_impASIN
call fooR(ASIN(R1))
c FFEINTRIN_impATAN
call fooR(ATAN(R1))
c FFEINTRIN_impATAN2
call fooR(ATAN2(R1,R2))
c FFEINTRIN_impCABS
call fooR(CABS(C1))
c FFEINTRIN_impCCOS
call fooC(CCOS(C1))
c FFEINTRIN_impCEXP
call fooC(CEXP(C1))
c FFEINTRIN_impCHAR
call fooA(CHAR(I1))
c FFEINTRIN_impCLOG
call fooC(CLOG(C1))
c FFEINTRIN_impCONJG
call fooC(CONJG(C1))
c FFEINTRIN_impCOS
call fooR(COS(R1))
c FFEINTRIN_impCOSH
call fooR(COSH(R1))
c FFEINTRIN_impCSIN
call fooC(CSIN(C1))
c FFEINTRIN_impCSQRT
call fooC(CSQRT(C1))
c FFEINTRIN_impDABS
call fooD(DABS(D1))
c FFEINTRIN_impDACOS
call fooD(DACOS(D1))
c FFEINTRIN_impDASIN
call fooD(DASIN(D1))
c FFEINTRIN_impDATAN
call fooD(DATAN(D1))
c FFEINTRIN_impDATAN2
call fooD(DATAN2(D1,D2))
c FFEINTRIN_impDCOS
call fooD(DCOS(D1))
c FFEINTRIN_impDCOSH
call fooD(DCOSH(D1))
c FFEINTRIN_impDDIM
call fooD(DDIM(D1,D2))
c FFEINTRIN_impDEXP
call fooD(DEXP(D1))
c FFEINTRIN_impDIM
call fooR(DIM(R1,R2))
c FFEINTRIN_impDINT
call fooD(DINT(D1))
c FFEINTRIN_impDLOG
call fooD(DLOG(D1))
c FFEINTRIN_impDLOG10
call fooD(DLOG10(D1))
c FFEINTRIN_impDMAX1
call fooD(DMAX1(D1,D2))
c FFEINTRIN_impDMIN1
call fooD(DMIN1(D1,D2))
c FFEINTRIN_impDMOD
call fooD(DMOD(D1,D2))
c FFEINTRIN_impDNINT
call fooD(DNINT(D1))
c FFEINTRIN_impDPROD
call fooD(DPROD(R1,R2))
c FFEINTRIN_impDSIGN
call fooD(DSIGN(D1,D2))
c FFEINTRIN_impDSIN
call fooD(DSIN(D1))
c FFEINTRIN_impDSINH
call fooD(DSINH(D1))
c FFEINTRIN_impDSQRT
call fooD(DSQRT(D1))
c FFEINTRIN_impDTAN
call fooD(DTAN(D1))
c FFEINTRIN_impDTANH
call fooD(DTANH(D1))
c FFEINTRIN_impEXP
call fooR(EXP(R1))
c FFEINTRIN_impIABS
call fooI(IABS(I1))
c FFEINTRIN_impICHAR
call fooI(ICHAR(A1))
c FFEINTRIN_impIDIM
call fooI(IDIM(I1,I2))
c FFEINTRIN_impIDNINT
call fooI(IDNINT(D1))
c FFEINTRIN_impINDEX
call fooI(INDEX(A1,A2))
c FFEINTRIN_impISIGN
call fooI(ISIGN(I1,I2))
c FFEINTRIN_impLEN
call fooI(LEN(A1))
c FFEINTRIN_impLGE
call fooL(LGE(A1,A2))
c FFEINTRIN_impLGT
call fooL(LGT(A1,A2))
c FFEINTRIN_impLLE
call fooL(LLE(A1,A2))
c FFEINTRIN_impLLT
call fooL(LLT(A1,A2))
c FFEINTRIN_impMAX0
call fooI(MAX0(I1,I2))
c FFEINTRIN_impMAX1
call fooI(MAX1(R1,R2))
c FFEINTRIN_impMIN0
call fooI(MIN0(I1,I2))
c FFEINTRIN_impMIN1
call fooI(MIN1(R1,R2))
c FFEINTRIN_impMOD
call fooI(MOD(I1,I2))
c FFEINTRIN_impNINT
call fooI(NINT(R1))
c FFEINTRIN_impSIGN
call fooR(SIGN(R1,R2))
c FFEINTRIN_impSIN
call fooR(SIN(R1))
c FFEINTRIN_impSINH
call fooR(SINH(R1))
c FFEINTRIN_impSQRT
call fooR(SQRT(R1))
c FFEINTRIN_impTAN
call fooR(TAN(R1))
c FFEINTRIN_impTANH
call fooR(TANH(R1))
c FFEINTRIN_imp_CMPLX_C
call fooC(cmplx(C1,C2))
c FFEINTRIN_imp_CMPLX_D
call fooZ(cmplx(D1,D2))
c FFEINTRIN_imp_CMPLX_I
call fooC(cmplx(I1,I2))
c FFEINTRIN_imp_CMPLX_R
call fooC(cmplx(R1,R2))
c FFEINTRIN_imp_DBLE_C
call fooD(dble(C1))
c FFEINTRIN_imp_DBLE_D
call fooD(dble(D1))
c FFEINTRIN_imp_DBLE_I
call fooD(dble(I1))
c FFEINTRIN_imp_DBLE_R
call fooD(dble(R1))
c FFEINTRIN_imp_INT_C
call fooI(int(C1))
c FFEINTRIN_imp_INT_D
call fooI(int(D1))
c FFEINTRIN_imp_INT_I
call fooI(int(I1))
c FFEINTRIN_imp_INT_R
call fooI(int(R1))
c FFEINTRIN_imp_REAL_C
call fooR(real(C1))
c FFEINTRIN_imp_REAL_D
call fooR(real(D1))
c FFEINTRIN_imp_REAL_I
call fooR(real(I1))
c FFEINTRIN_imp_REAL_R
call fooR(real(R1))
c
c FFEINTRIN_imp_INT_D:
c
c FFEINTRIN_specIDINT
call fooI(IDINT(D1))
c
c FFEINTRIN_imp_INT_R:
c
c FFEINTRIN_specIFIX
call fooI(IFIX(R1))
c FFEINTRIN_specINT
call fooI(INT(R1))
c
c FFEINTRIN_imp_REAL_D:
c
c FFEINTRIN_specSNGL
call fooR(SNGL(D1))
c
c FFEINTRIN_imp_REAL_I:
c
c FFEINTRIN_specFLOAT
call fooR(FLOAT(I1))
c FFEINTRIN_specREAL
call fooR(REAL(I1))
c
end
-------- (end input file to f2c)
-------- (begin output from providing above input file as input to:
-------- `f2c | gcc -E -C - | sed -e "s:/[*]*://:g" -e "s:[*]*[/]://:g" \
-------- -e "s:^#.*$::g"')
// -- translated by f2c (version 19950223).
You must link the resulting object file with the libraries:
-lf2c -lm (in that order)
//
// f2c.h -- Standard Fortran to C header file //
/// barf [ba:rf] 2. "He suggested using FORTRAN, and everybody barfed."
- From The Shogakukan DICTIONARY OF NEW ENGLISH (Second edition) //
// F2C_INTEGER will normally be `int' but would be `long' on 16-bit systems //
// we assume short, float are OK //
typedef long int // long int // integer;
typedef char *address;
typedef short int shortint;
typedef float real;
typedef double doublereal;
typedef struct { real r, i; } complex;
typedef struct { doublereal r, i; } doublecomplex;
typedef long int // long int // logical;
typedef short int shortlogical;
typedef char logical1;
typedef char integer1;
// typedef long long longint; // // system-dependent //
// Extern is for use with -E //
// I/O stuff //
typedef long int // int or long int // flag;
typedef long int // int or long int // ftnlen;
typedef long int // int or long int // ftnint;
//external read, write//
typedef struct
{ flag cierr;
ftnint ciunit;
flag ciend;
char *cifmt;
ftnint cirec;
} cilist;
//internal read, write//
typedef struct
{ flag icierr;
char *iciunit;
flag iciend;
char *icifmt;
ftnint icirlen;
ftnint icirnum;
} icilist;
//open//
typedef struct
{ flag oerr;
ftnint ounit;
char *ofnm;
ftnlen ofnmlen;
char *osta;
char *oacc;
char *ofm;
ftnint orl;
char *oblnk;
} olist;
//close//
typedef struct
{ flag cerr;
ftnint cunit;
char *csta;
} cllist;
//rewind, backspace, endfile//
typedef struct
{ flag aerr;
ftnint aunit;
} alist;
// inquire //
typedef struct
{ flag inerr;
ftnint inunit;
char *infile;
ftnlen infilen;
ftnint *inex; //parameters in standard's order//
ftnint *inopen;
ftnint *innum;
ftnint *innamed;
char *inname;
ftnlen innamlen;
char *inacc;
ftnlen inacclen;
char *inseq;
ftnlen inseqlen;
char *indir;
ftnlen indirlen;
char *infmt;
ftnlen infmtlen;
char *inform;
ftnint informlen;
char *inunf;
ftnlen inunflen;
ftnint *inrecl;
ftnint *innrec;
char *inblank;
ftnlen inblanklen;
} inlist;
union Multitype { // for multiple entry points //
integer1 g;
shortint h;
integer i;
// longint j; //
real r;
doublereal d;
complex c;
doublecomplex z;
};
typedef union Multitype Multitype;
typedef long Long; // No longer used; formerly in Namelist //
struct Vardesc { // for Namelist //
char *name;
char *addr;
ftnlen *dims;
int type;
};
typedef struct Vardesc Vardesc;
struct Namelist {
char *name;
Vardesc **vars;
int nvars;
};
typedef struct Namelist Namelist;
// procedure parameter types for -A and -C++ //
typedef int // Unknown procedure type // (*U_fp)();
typedef shortint (*J_fp)();
typedef integer (*I_fp)();
typedef real (*R_fp)();
typedef doublereal (*D_fp)(), (*E_fp)();
typedef // Complex // void (*C_fp)();
typedef // Double Complex // void (*Z_fp)();
typedef logical (*L_fp)();
typedef shortlogical (*K_fp)();
typedef // Character // void (*H_fp)();
typedef // Subroutine // int (*S_fp)();
// E_fp is for real functions when -R is not specified //
typedef void C_f; // complex function //
typedef void H_f; // character function //
typedef void Z_f; // double complex function //
typedef doublereal E_f; // real function with -R not specified //
// undef any lower-case symbols that your C compiler predefines, e.g.: //
// (No such symbols should be defined in a strict ANSI C compiler.
We can avoid trouble with f2c-translated code by using
gcc -ansi [-traditional].) //
// Main program // MAIN__()
{
// System generated locals //
integer i__1;
real r__1, r__2;
doublereal d__1, d__2;
complex q__1;
doublecomplex z__1, z__2, z__3;
logical L__1;
char ch__1[1];
// Builtin functions //
void c_div();
integer pow_ii();
double pow_ri(), pow_di();
void pow_ci();
double pow_dd();
void pow_zz();
double acos(), r_imag(), r_int(), log(), r_lg10(), r_mod(), r_nint(),
asin(), atan(), atan2(), c_abs();
void c_cos(), c_exp(), c_log(), r_cnjg();
double cos(), cosh();
void c_sin(), c_sqrt();
double d_dim(), exp(), r_dim(), d_int(), d_lg10(), d_mod(), d_nint(),
d_sign(), sin(), sinh(), sqrt(), tan(), tanh();
integer i_dim(), i_dnnt(), i_indx(), i_sign(), i_len();
logical l_ge(), l_gt(), l_le(), l_lt();
integer i_nint();
double r_sign();
// Local variables //
extern // Subroutine // int fooa_(), fooc_(), food_(), fooi_(), foor_(),
fool_(), fooz_(), getem_();
static char a1[10], a2[10];
static complex c1, c2;
static doublereal d1, d2;
static integer i1, i2;
static real r1, r2;
getem_(a1, a2, &c1, &c2, &i1, &i2, &r1, &r2, &d1, &d2, 10L, 10L);
// / //
i__1 = i1 / i2;
fooi_(&i__1);
r__1 = r1 / i1;
foor_(&r__1);
d__1 = d1 / i1;
food_(&d__1);
d__1 = (doublereal) i1;
q__1.r = c1.r / d__1, q__1.i = c1.i / d__1;
fooc_(&q__1);
r__1 = r1 / r2;
foor_(&r__1);
d__1 = r1 / d1;
food_(&d__1);
d__1 = d1 / d2;
food_(&d__1);
d__1 = d1 / r1;
food_(&d__1);
c_div(&q__1, &c1, &c2);
fooc_(&q__1);
q__1.r = c1.r / r1, q__1.i = c1.i / r1;
fooc_(&q__1);
z__1.r = c1.r / d1, z__1.i = c1.i / d1;
fooz_(&z__1);
// ** //
i__1 = pow_ii(&i1, &i2);
fooi_(&i__1);
r__1 = pow_ri(&r1, &i1);
foor_(&r__1);
d__1 = pow_di(&d1, &i1);
food_(&d__1);
pow_ci(&q__1, &c1, &i1);
fooc_(&q__1);
d__1 = (doublereal) r1;
d__2 = (doublereal) r2;
r__1 = pow_dd(&d__1, &d__2);
foor_(&r__1);
d__2 = (doublereal) r1;
d__1 = pow_dd(&d__2, &d1);
food_(&d__1);
d__1 = pow_dd(&d1, &d2);
food_(&d__1);
d__2 = (doublereal) r1;
d__1 = pow_dd(&d1, &d__2);
food_(&d__1);
z__2.r = c1.r, z__2.i = c1.i;
z__3.r = c2.r, z__3.i = c2.i;
pow_zz(&z__1, &z__2, &z__3);
q__1.r = z__1.r, q__1.i = z__1.i;
fooc_(&q__1);
z__2.r = c1.r, z__2.i = c1.i;
z__3.r = r1, z__3.i = 0.;
pow_zz(&z__1, &z__2, &z__3);
q__1.r = z__1.r, q__1.i = z__1.i;
fooc_(&q__1);
z__2.r = c1.r, z__2.i = c1.i;
z__3.r = d1, z__3.i = 0.;
pow_zz(&z__1, &z__2, &z__3);
fooz_(&z__1);
// FFEINTRIN_impABS //
r__1 = (doublereal)(( r1 ) >= 0 ? ( r1 ) : -( r1 )) ;
foor_(&r__1);
// FFEINTRIN_impACOS //
r__1 = acos(r1);
foor_(&r__1);
// FFEINTRIN_impAIMAG //
r__1 = r_imag(&c1);
foor_(&r__1);
// FFEINTRIN_impAINT //
r__1 = r_int(&r1);
foor_(&r__1);
// FFEINTRIN_impALOG //
r__1 = log(r1);
foor_(&r__1);
// FFEINTRIN_impALOG10 //
r__1 = r_lg10(&r1);
foor_(&r__1);
// FFEINTRIN_impAMAX0 //
r__1 = (real) (( i1 ) >= ( i2 ) ? ( i1 ) : ( i2 )) ;
foor_(&r__1);
// FFEINTRIN_impAMAX1 //
r__1 = (doublereal)(( r1 ) >= ( r2 ) ? ( r1 ) : ( r2 )) ;
foor_(&r__1);
// FFEINTRIN_impAMIN0 //
r__1 = (real) (( i1 ) <= ( i2 ) ? ( i1 ) : ( i2 )) ;
foor_(&r__1);
// FFEINTRIN_impAMIN1 //
r__1 = (doublereal)(( r1 ) <= ( r2 ) ? ( r1 ) : ( r2 )) ;
foor_(&r__1);
// FFEINTRIN_impAMOD //
r__1 = r_mod(&r1, &r2);
foor_(&r__1);
// FFEINTRIN_impANINT //
r__1 = r_nint(&r1);
foor_(&r__1);
// FFEINTRIN_impASIN //
r__1 = asin(r1);
foor_(&r__1);
// FFEINTRIN_impATAN //
r__1 = atan(r1);
foor_(&r__1);
// FFEINTRIN_impATAN2 //
r__1 = atan2(r1, r2);
foor_(&r__1);
// FFEINTRIN_impCABS //
r__1 = c_abs(&c1);
foor_(&r__1);
// FFEINTRIN_impCCOS //
c_cos(&q__1, &c1);
fooc_(&q__1);
// FFEINTRIN_impCEXP //
c_exp(&q__1, &c1);
fooc_(&q__1);
// FFEINTRIN_impCHAR //
*(unsigned char *)&ch__1[0] = i1;
fooa_(ch__1, 1L);
// FFEINTRIN_impCLOG //
c_log(&q__1, &c1);
fooc_(&q__1);
// FFEINTRIN_impCONJG //
r_cnjg(&q__1, &c1);
fooc_(&q__1);
// FFEINTRIN_impCOS //
r__1 = cos(r1);
foor_(&r__1);
// FFEINTRIN_impCOSH //
r__1 = cosh(r1);
foor_(&r__1);
// FFEINTRIN_impCSIN //
c_sin(&q__1, &c1);
fooc_(&q__1);
// FFEINTRIN_impCSQRT //
c_sqrt(&q__1, &c1);
fooc_(&q__1);
// FFEINTRIN_impDABS //
d__1 = (( d1 ) >= 0 ? ( d1 ) : -( d1 )) ;
food_(&d__1);
// FFEINTRIN_impDACOS //
d__1 = acos(d1);
food_(&d__1);
// FFEINTRIN_impDASIN //
d__1 = asin(d1);
food_(&d__1);
// FFEINTRIN_impDATAN //
d__1 = atan(d1);
food_(&d__1);
// FFEINTRIN_impDATAN2 //
d__1 = atan2(d1, d2);
food_(&d__1);
// FFEINTRIN_impDCOS //
d__1 = cos(d1);
food_(&d__1);
// FFEINTRIN_impDCOSH //
d__1 = cosh(d1);
food_(&d__1);
// FFEINTRIN_impDDIM //
d__1 = d_dim(&d1, &d2);
food_(&d__1);
// FFEINTRIN_impDEXP //
d__1 = exp(d1);
food_(&d__1);
// FFEINTRIN_impDIM //
r__1 = r_dim(&r1, &r2);
foor_(&r__1);
// FFEINTRIN_impDINT //
d__1 = d_int(&d1);
food_(&d__1);
// FFEINTRIN_impDLOG //
d__1 = log(d1);
food_(&d__1);
// FFEINTRIN_impDLOG10 //
d__1 = d_lg10(&d1);
food_(&d__1);
// FFEINTRIN_impDMAX1 //
d__1 = (( d1 ) >= ( d2 ) ? ( d1 ) : ( d2 )) ;
food_(&d__1);
// FFEINTRIN_impDMIN1 //
d__1 = (( d1 ) <= ( d2 ) ? ( d1 ) : ( d2 )) ;
food_(&d__1);
// FFEINTRIN_impDMOD //
d__1 = d_mod(&d1, &d2);
food_(&d__1);
// FFEINTRIN_impDNINT //
d__1 = d_nint(&d1);
food_(&d__1);
// FFEINTRIN_impDPROD //
d__1 = (doublereal) r1 * r2;
food_(&d__1);
// FFEINTRIN_impDSIGN //
d__1 = d_sign(&d1, &d2);
food_(&d__1);
// FFEINTRIN_impDSIN //
d__1 = sin(d1);
food_(&d__1);
// FFEINTRIN_impDSINH //
d__1 = sinh(d1);
food_(&d__1);
// FFEINTRIN_impDSQRT //
d__1 = sqrt(d1);
food_(&d__1);
// FFEINTRIN_impDTAN //
d__1 = tan(d1);
food_(&d__1);
// FFEINTRIN_impDTANH //
d__1 = tanh(d1);
food_(&d__1);
// FFEINTRIN_impEXP //
r__1 = exp(r1);
foor_(&r__1);
// FFEINTRIN_impIABS //
i__1 = (( i1 ) >= 0 ? ( i1 ) : -( i1 )) ;
fooi_(&i__1);
// FFEINTRIN_impICHAR //
i__1 = *(unsigned char *)a1;
fooi_(&i__1);
// FFEINTRIN_impIDIM //
i__1 = i_dim(&i1, &i2);
fooi_(&i__1);
// FFEINTRIN_impIDNINT //
i__1 = i_dnnt(&d1);
fooi_(&i__1);
// FFEINTRIN_impINDEX //
i__1 = i_indx(a1, a2, 10L, 10L);
fooi_(&i__1);
// FFEINTRIN_impISIGN //
i__1 = i_sign(&i1, &i2);
fooi_(&i__1);
// FFEINTRIN_impLEN //
i__1 = i_len(a1, 10L);
fooi_(&i__1);
// FFEINTRIN_impLGE //
L__1 = l_ge(a1, a2, 10L, 10L);
fool_(&L__1);
// FFEINTRIN_impLGT //
L__1 = l_gt(a1, a2, 10L, 10L);
fool_(&L__1);
// FFEINTRIN_impLLE //
L__1 = l_le(a1, a2, 10L, 10L);
fool_(&L__1);
// FFEINTRIN_impLLT //
L__1 = l_lt(a1, a2, 10L, 10L);
fool_(&L__1);
// FFEINTRIN_impMAX0 //
i__1 = (( i1 ) >= ( i2 ) ? ( i1 ) : ( i2 )) ;
fooi_(&i__1);
// FFEINTRIN_impMAX1 //
i__1 = (integer) (doublereal)(( r1 ) >= ( r2 ) ? ( r1 ) : ( r2 )) ;
fooi_(&i__1);
// FFEINTRIN_impMIN0 //
i__1 = (( i1 ) <= ( i2 ) ? ( i1 ) : ( i2 )) ;
fooi_(&i__1);
// FFEINTRIN_impMIN1 //
i__1 = (integer) (doublereal)(( r1 ) <= ( r2 ) ? ( r1 ) : ( r2 )) ;
fooi_(&i__1);
// FFEINTRIN_impMOD //
i__1 = i1 % i2;
fooi_(&i__1);
// FFEINTRIN_impNINT //
i__1 = i_nint(&r1);
fooi_(&i__1);
// FFEINTRIN_impSIGN //
r__1 = r_sign(&r1, &r2);
foor_(&r__1);
// FFEINTRIN_impSIN //
r__1 = sin(r1);
foor_(&r__1);
// FFEINTRIN_impSINH //
r__1 = sinh(r1);
foor_(&r__1);
// FFEINTRIN_impSQRT //
r__1 = sqrt(r1);
foor_(&r__1);
// FFEINTRIN_impTAN //
r__1 = tan(r1);
foor_(&r__1);
// FFEINTRIN_impTANH //
r__1 = tanh(r1);
foor_(&r__1);
// FFEINTRIN_imp_CMPLX_C //
r__1 = c1.r;
r__2 = c2.r;
q__1.r = r__1, q__1.i = r__2;
fooc_(&q__1);
// FFEINTRIN_imp_CMPLX_D //
z__1.r = d1, z__1.i = d2;
fooz_(&z__1);
// FFEINTRIN_imp_CMPLX_I //
r__1 = (real) i1;
r__2 = (real) i2;
q__1.r = r__1, q__1.i = r__2;
fooc_(&q__1);
// FFEINTRIN_imp_CMPLX_R //
q__1.r = r1, q__1.i = r2;
fooc_(&q__1);
// FFEINTRIN_imp_DBLE_C //
d__1 = (doublereal) c1.r;
food_(&d__1);
// FFEINTRIN_imp_DBLE_D //
d__1 = d1;
food_(&d__1);
// FFEINTRIN_imp_DBLE_I //
d__1 = (doublereal) i1;
food_(&d__1);
// FFEINTRIN_imp_DBLE_R //
d__1 = (doublereal) r1;
food_(&d__1);
// FFEINTRIN_imp_INT_C //
i__1 = (integer) c1.r;
fooi_(&i__1);
// FFEINTRIN_imp_INT_D //
i__1 = (integer) d1;
fooi_(&i__1);
// FFEINTRIN_imp_INT_I //
i__1 = i1;
fooi_(&i__1);
// FFEINTRIN_imp_INT_R //
i__1 = (integer) r1;
fooi_(&i__1);
// FFEINTRIN_imp_REAL_C //
r__1 = c1.r;
foor_(&r__1);
// FFEINTRIN_imp_REAL_D //
r__1 = (real) d1;
foor_(&r__1);
// FFEINTRIN_imp_REAL_I //
r__1 = (real) i1;
foor_(&r__1);
// FFEINTRIN_imp_REAL_R //
r__1 = r1;
foor_(&r__1);
// FFEINTRIN_imp_INT_D: //
// FFEINTRIN_specIDINT //
i__1 = (integer) d1;
fooi_(&i__1);
// FFEINTRIN_imp_INT_R: //
// FFEINTRIN_specIFIX //
i__1 = (integer) r1;
fooi_(&i__1);
// FFEINTRIN_specINT //
i__1 = (integer) r1;
fooi_(&i__1);
// FFEINTRIN_imp_REAL_D: //
// FFEINTRIN_specSNGL //
r__1 = (real) d1;
foor_(&r__1);
// FFEINTRIN_imp_REAL_I: //
// FFEINTRIN_specFLOAT //
r__1 = (real) i1;
foor_(&r__1);
// FFEINTRIN_specREAL //
r__1 = (real) i1;
foor_(&r__1);
} // MAIN__ //
-------- (end output file from f2c)
*/
}
#endif
/* For power (exponentiation) where right-hand operand is type INTEGER,
generate in-line code to do it the fast way (which, if the operand
is a constant, might just mean a series of multiplies). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_expr_power_integer_ (ffebld left, ffebld right)
{
tree l = ffecom_expr (left);
tree r = ffecom_expr (right);
tree ltype = TREE_TYPE (l);
tree rtype = TREE_TYPE (r);
tree result = NULL_TREE;
if (l == error_mark_node
|| r == error_mark_node)
return error_mark_node;
if (TREE_CODE (r) == INTEGER_CST)
{
int sgn = tree_int_cst_sgn (r);
if (sgn == 0)
return convert (ltype, integer_one_node);
if ((TREE_CODE (ltype) == INTEGER_TYPE)
&& (sgn < 0))
{
/* Reciprocal of integer is either 0, -1, or 1, so after
calculating that (which we leave to the back end to do
or not do optimally), don't bother with any multiplying. */
result = ffecom_tree_divide_ (ltype,
convert (ltype, integer_one_node),
l,
NULL_TREE, NULL, NULL);
r = ffecom_1 (NEGATE_EXPR,
rtype,
r);
if ((TREE_INT_CST_LOW (r) & 1) == 0)
result = ffecom_1 (ABS_EXPR, rtype,
result);
}
/* Generate appropriate series of multiplies, preceded
by divide if the exponent is negative. */
l = save_expr (l);
if (sgn < 0)
{
l = ffecom_tree_divide_ (ltype,
convert (ltype, integer_one_node),
l,
NULL_TREE, NULL, NULL);
r = ffecom_1 (NEGATE_EXPR, rtype, r);
assert (TREE_CODE (r) == INTEGER_CST);
if (tree_int_cst_sgn (r) < 0)
{ /* The "most negative" number. */
r = ffecom_1 (NEGATE_EXPR, rtype,
ffecom_2 (RSHIFT_EXPR, rtype,
r,
integer_one_node));
l = save_expr (l);
l = ffecom_2 (MULT_EXPR, ltype,
l,
l);
}
}
for (;;)
{
if (TREE_INT_CST_LOW (r) & 1)
{
if (result == NULL_TREE)
result = l;
else
result = ffecom_2 (MULT_EXPR, ltype,
result,
l);
}
r = ffecom_2 (RSHIFT_EXPR, rtype,
r,
integer_one_node);
if (integer_zerop (r))
break;
assert (TREE_CODE (r) == INTEGER_CST);
l = save_expr (l);
l = ffecom_2 (MULT_EXPR, ltype,
l,
l);
}
return result;
}
/* Though rhs isn't a constant, in-line code cannot be expanded
while transforming dummies
because the back end cannot be easily convinced to generate
stores (MODIFY_EXPR), handle temporaries, and so on before
all the appropriate rtx's have been generated for things like
dummy args referenced in rhs -- which doesn't happen until
store_parm_decls() is called (expand_function_start, I believe,
does the actual rtx-stuffing of PARM_DECLs).
So, in this case, let the caller generate the call to the
run-time-library function to evaluate the power for us. */
if (ffecom_transform_only_dummies_)
return NULL_TREE;
/* Right-hand operand not a constant, expand in-line code to figure
out how to do the multiplies, &c.
The returned expression is expressed this way in GNU C, where l and
r are the "inputs":
({ typeof (r) rtmp = r;
typeof (l) ltmp = l;
typeof (l) result;
if (rtmp == 0)
result = 1;
else
{
if ((basetypeof (l) == basetypeof (int))
&& (rtmp < 0))
{
result = ((typeof (l)) 1) / ltmp;
if ((ltmp < 0) && (((-rtmp) & 1) == 0))
result = -result;
}
else
{
result = 1;
if ((basetypeof (l) != basetypeof (int))
&& (rtmp < 0))
{
ltmp = ((typeof (l)) 1) / ltmp;
rtmp = -rtmp;
if (rtmp < 0)
{
rtmp = -(rtmp >> 1);
ltmp *= ltmp;
}
}
for (;;)
{
if (rtmp & 1)
result *= ltmp;
if ((rtmp >>= 1) == 0)
break;
ltmp *= ltmp;
}
}
}
result;
})
Note that some of the above is compile-time collapsable, such as
the first part of the if statements that checks the base type of
l against int. The if statements are phrased that way to suggest
an easy way to generate the if/else constructs here, knowing that
the back end should (and probably does) eliminate the resulting
dead code (either the int case or the non-int case), something
it couldn't do without the redundant phrasing, requiring explicit
dead-code elimination here, which would be kind of difficult to
read. */
{
tree rtmp;
tree ltmp;
tree basetypeof_l_is_int;
tree se;
basetypeof_l_is_int
= build_int_2 ((TREE_CODE (ltype) == INTEGER_TYPE), 0);
se = expand_start_stmt_expr ();
ffecom_push_calltemps ();
rtmp = ffecom_push_tempvar (rtype, FFETARGET_charactersizeNONE, -1,
TRUE);
ltmp = ffecom_push_tempvar (ltype, FFETARGET_charactersizeNONE, -1,
TRUE);
result = ffecom_push_tempvar (ltype, FFETARGET_charactersizeNONE, -1,
TRUE);
expand_expr_stmt (ffecom_modify (void_type_node,
rtmp,
r));
expand_expr_stmt (ffecom_modify (void_type_node,
ltmp,
l));
expand_start_cond (ffecom_truth_value
(ffecom_2 (EQ_EXPR, integer_type_node,
rtmp,
convert (rtype, integer_zero_node))),
0);
expand_expr_stmt (ffecom_modify (void_type_node,
result,
convert (ltype, integer_one_node)));
expand_start_else ();
if (!integer_zerop (basetypeof_l_is_int))
{
expand_start_cond (ffecom_2 (LT_EXPR, integer_type_node,
rtmp,
convert (rtype,
integer_zero_node)),
0);
expand_expr_stmt (ffecom_modify (void_type_node,
result,
ffecom_tree_divide_
(ltype,
convert (ltype, integer_one_node),
ltmp,
NULL_TREE, NULL, NULL)));
expand_start_cond (ffecom_truth_value
(ffecom_2 (TRUTH_ANDIF_EXPR, integer_type_node,
ffecom_2 (LT_EXPR, integer_type_node,
ltmp,
convert (ltype,
integer_zero_node)),
ffecom_2 (EQ_EXPR, integer_type_node,
ffecom_2 (BIT_AND_EXPR,
rtype,
ffecom_1 (NEGATE_EXPR,
rtype,
rtmp),
convert (rtype,
integer_one_node)),
convert (rtype,
integer_zero_node)))),
0);
expand_expr_stmt (ffecom_modify (void_type_node,
result,
ffecom_1 (NEGATE_EXPR,
ltype,
result)));
expand_end_cond ();
expand_start_else ();
}
expand_expr_stmt (ffecom_modify (void_type_node,
result,
convert (ltype, integer_one_node)));
expand_start_cond (ffecom_truth_value
(ffecom_2 (TRUTH_ANDIF_EXPR, integer_type_node,
ffecom_truth_value_invert
(basetypeof_l_is_int),
ffecom_2 (LT_EXPR, integer_type_node,
rtmp,
convert (rtype,
integer_zero_node)))),
0);
expand_expr_stmt (ffecom_modify (void_type_node,
ltmp,
ffecom_tree_divide_
(ltype,
convert (ltype, integer_one_node),
ltmp,
NULL_TREE, NULL, NULL)));
expand_expr_stmt (ffecom_modify (void_type_node,
rtmp,
ffecom_1 (NEGATE_EXPR, rtype,
rtmp)));
expand_start_cond (ffecom_truth_value
(ffecom_2 (LT_EXPR, integer_type_node,
rtmp,
convert (rtype, integer_zero_node))),
0);
expand_expr_stmt (ffecom_modify (void_type_node,
rtmp,
ffecom_1 (NEGATE_EXPR, rtype,
ffecom_2 (RSHIFT_EXPR,
rtype,
rtmp,
integer_one_node))));
expand_expr_stmt (ffecom_modify (void_type_node,
ltmp,
ffecom_2 (MULT_EXPR, ltype,
ltmp,
ltmp)));
expand_end_cond ();
expand_end_cond ();
expand_start_loop (1);
expand_start_cond (ffecom_truth_value
(ffecom_2 (BIT_AND_EXPR, rtype,
rtmp,
convert (rtype, integer_one_node))),
0);
expand_expr_stmt (ffecom_modify (void_type_node,
result,
ffecom_2 (MULT_EXPR, ltype,
result,
ltmp)));
expand_end_cond ();
expand_exit_loop_if_false (NULL,
ffecom_truth_value
(ffecom_modify (rtype,
rtmp,
ffecom_2 (RSHIFT_EXPR,
rtype,
rtmp,
integer_one_node))));
expand_expr_stmt (ffecom_modify (void_type_node,
ltmp,
ffecom_2 (MULT_EXPR, ltype,
ltmp,
ltmp)));
expand_end_loop ();
expand_end_cond ();
if (!integer_zerop (basetypeof_l_is_int))
expand_end_cond ();
expand_expr_stmt (result);
ffecom_pop_calltemps ();
result = expand_end_stmt_expr (se);
TREE_SIDE_EFFECTS (result) = 1;
}
return result;
}
#endif
/* ffecom_expr_transform_ -- Transform symbols in expr
ffebld expr; // FFE expression.
ffecom_expr_transform_ (expr);
Recursive descent on expr while transforming any untransformed SYMTERs. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_expr_transform_ (ffebld expr)
{
tree t;
ffesymbol s;
tail_recurse: /* :::::::::::::::::::: */
if (expr == NULL)
return;
switch (ffebld_op (expr))
{
case FFEBLD_opSYMTER:
s = ffebld_symter (expr);
t = ffesymbol_hook (s).decl_tree;
if ((t == NULL_TREE)
&& ((ffesymbol_kind (s) != FFEINFO_kindNONE)
|| ((ffesymbol_where (s) != FFEINFO_whereNONE)
&& (ffesymbol_where (s) != FFEINFO_whereINTRINSIC))))
{
s = ffecom_sym_transform_ (s);
t = ffesymbol_hook (s).decl_tree; /* Sfunc expr non-dummy,
DIMENSION expr? */
}
break; /* Ok if (t == NULL) here. */
case FFEBLD_opITEM:
ffecom_expr_transform_ (ffebld_head (expr));
expr = ffebld_trail (expr);
goto tail_recurse; /* :::::::::::::::::::: */
default:
break;
}
switch (ffebld_arity (expr))
{
case 2:
ffecom_expr_transform_ (ffebld_left (expr));
expr = ffebld_right (expr);
goto tail_recurse; /* :::::::::::::::::::: */
case 1:
expr = ffebld_left (expr);
goto tail_recurse; /* :::::::::::::::::::: */
default:
break;
}
return;
}
#endif
/* Make a type based on info in live f2c.h file. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_f2c_make_type_ (tree *type, int tcode, char *name)
{
switch (tcode)
{
case FFECOM_f2ccodeCHAR:
*type = make_signed_type (CHAR_TYPE_SIZE);
break;
case FFECOM_f2ccodeSHORT:
*type = make_signed_type (SHORT_TYPE_SIZE);
break;
case FFECOM_f2ccodeINT:
*type = make_signed_type (INT_TYPE_SIZE);
break;
case FFECOM_f2ccodeLONG:
*type = make_signed_type (LONG_TYPE_SIZE);
break;
case FFECOM_f2ccodeLONGLONG:
*type = make_signed_type (LONG_LONG_TYPE_SIZE);
break;
case FFECOM_f2ccodeCHARPTR:
*type = build_pointer_type (DEFAULT_SIGNED_CHAR
? signed_char_type_node
: unsigned_char_type_node);
break;
case FFECOM_f2ccodeFLOAT:
*type = make_node (REAL_TYPE);
TYPE_PRECISION (*type) = FLOAT_TYPE_SIZE;
layout_type (*type);
break;
case FFECOM_f2ccodeDOUBLE:
*type = make_node (REAL_TYPE);
TYPE_PRECISION (*type) = DOUBLE_TYPE_SIZE;
layout_type (*type);
break;
case FFECOM_f2ccodeLONGDOUBLE:
*type = make_node (REAL_TYPE);
TYPE_PRECISION (*type) = LONG_DOUBLE_TYPE_SIZE;
layout_type (*type);
break;
case FFECOM_f2ccodeTWOREALS:
*type = ffecom_make_complex_type_ (ffecom_f2c_real_type_node);
break;
case FFECOM_f2ccodeTWODOUBLEREALS:
*type = ffecom_make_complex_type_ (ffecom_f2c_doublereal_type_node);
break;
default:
assert ("unexpected FFECOM_f2ccodeXYZZY!" == NULL);
*type = error_mark_node;
return;
}
pushdecl (build_decl (TYPE_DECL,
ffecom_get_invented_identifier ("__g77_f2c_%s",
name, 0),
*type));
}
#endif
#if FFECOM_targetCURRENT == FFECOM_targetGCC
/* Set the f2c list-directed-I/O code for whatever (integral) type has the
given size. */
static void
ffecom_f2c_set_lio_code_ (ffeinfoBasictype bt, int size,
int code)
{
int j;
tree t;
for (j = 0; ((size_t) j) < ARRAY_SIZE (ffecom_tree_type[0]); ++j)
if (((t = ffecom_tree_type[bt][j]) != NULL_TREE)
&& (TREE_INT_CST_LOW (TYPE_SIZE (t)) == size))
{
assert (code != -1);
ffecom_f2c_typecode_[bt][j] = code;
code = -1;
}
}
#endif
/* Finish up globals after doing all program units in file
Need to handle only uninitialized COMMON areas. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static ffeglobal
ffecom_finish_global_ (ffeglobal global)
{
tree cbtype;
tree cbt;
tree size;
if (ffeglobal_type (global) != FFEGLOBAL_typeCOMMON)
return global;
if (ffeglobal_common_init (global))
return global;
cbt = ffeglobal_hook (global);
if ((cbt == NULL_TREE)
|| !ffeglobal_common_have_size (global))
return global; /* No need to make common, never ref'd. */
suspend_momentary ();
DECL_EXTERNAL (cbt) = 0;
/* Give the array a size now. */
size = build_int_2 ((ffeglobal_common_size (global)
+ ffeglobal_common_pad (global)) - 1,
0);
cbtype = TREE_TYPE (cbt);
TYPE_DOMAIN (cbtype) = build_range_type (integer_type_node,
integer_zero_node,
size);
if (!TREE_TYPE (size))
TREE_TYPE (size) = TYPE_DOMAIN (cbtype);
layout_type (cbtype);
cbt = start_decl (cbt, FALSE);
assert (cbt == ffeglobal_hook (global));
finish_decl (cbt, NULL_TREE, FALSE);
return global;
}
#endif
/* Finish up any untransformed symbols. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static ffesymbol
ffecom_finish_symbol_transform_ (ffesymbol s)
{
if ((s == NULL) || (TREE_CODE (current_function_decl) == ERROR_MARK))
return s;
/* It's easy to know to transform an untransformed symbol, to make sure
we put out debugging info for it. But COMMON variables, unlike
EQUIVALENCE ones, aren't given declarations in addition to the
tree expressions that specify offsets, because COMMON variables
can be referenced in the outer scope where only dummy arguments
(PARM_DECLs) should really be seen. To be safe, just don't do any
VAR_DECLs for COMMON variables when we transform them for real
use, and therefore we do all the VAR_DECL creating here. */
if (ffesymbol_hook (s).decl_tree == NULL_TREE)
{
if (ffesymbol_where (s) == FFEINFO_whereCONSTANT
&& (ffesymbol_kind (s) == FFEINFO_kindFUNCTION
|| ffesymbol_kind (s) == FFEINFO_kindSUBROUTINE))
{
/* An unreferenced statement function. If this refers to
an undeclared array, it'll look like a reference to
an external function that might not exist. Even if it
does refer to an non-existent function, it seems silly
to force a linker error when the function won't actually
be called. But before the 1998-05-15 change to egcs/gcc
toplev.c by Mark Mitchell, to fix other problems, this
didn't actually happen, since gcc would defer nested
functions to be compiled later only if needed. With that
change, it makes sense to simply avoid telling the back
end about the statement (nested) function at all. But
if -Wunused is specified, might as well warn about it. */
if (warn_unused)
{
ffebad_start (FFEBAD_SFUNC_UNUSED);
ffebad_string (ffesymbol_text (s));
ffebad_here (0, ffesymbol_where_line (s), ffesymbol_where_column (s));
ffebad_finish ();
}
}
else if (ffesymbol_kind (s) != FFEINFO_kindNONE
|| (ffesymbol_where (s) != FFEINFO_whereNONE
&& ffesymbol_where (s) != FFEINFO_whereINTRINSIC
&& ffesymbol_where (s) != FFEINFO_whereDUMMY))
/* Not transformed, and not CHARACTER*(*), and not a dummy
argument, which can happen only if the entry point names
it "rides in on" are all invalidated for other reasons. */
s = ffecom_sym_transform_ (s);
}
if ((ffesymbol_where (s) == FFEINFO_whereCOMMON)
&& (ffesymbol_hook (s).decl_tree != error_mark_node))
{
#ifdef SOMEONE_GETS_DEBUG_SUPPORT_WORKING
int yes = suspend_momentary ();
/* This isn't working, at least for dbxout. The .s file looks
okay to me (burley), but in gdb 4.9 at least, the variables
appear to reside somewhere outside of the common area, so
it doesn't make sense to mislead anyone by generating the info
on those variables until this is fixed. NOTE: Same problem
with EQUIVALENCE, sadly...see similar #if later. */
ffecom_member_phase2_ (ffesymbol_storage (ffesymbol_common (s)),
ffesymbol_storage (s));
resume_momentary (yes);
#endif
}
return s;
}
#endif
/* Append underscore(s) to name before calling get_identifier. "us"
is nonzero if the name already contains an underscore and thus
needs two underscores appended. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_get_appended_identifier_ (char us, char *name)
{
int i;
char *newname;
tree id;
newname = xmalloc ((i = strlen (name)) + 1
+ ffe_is_underscoring ()
+ us);
memcpy (newname, name, i);
newname[i] = '_';
newname[i + us] = '_';
newname[i + 1 + us] = '\0';
id = get_identifier (newname);
free (newname);
return id;
}
#endif
/* Decide whether to append underscore to name before calling
get_identifier. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_get_external_identifier_ (ffesymbol s)
{
char us;
char *name = ffesymbol_text (s);
/* If name is a built-in name, just return it as is. */
if (!ffe_is_underscoring ()
|| (strcmp (name, FFETARGET_nameBLANK_COMMON) == 0)
#if FFETARGET_isENFORCED_MAIN_NAME
|| (strcmp (name, FFETARGET_nameENFORCED_NAME) == 0)
#else
|| (strcmp (name, FFETARGET_nameUNNAMED_MAIN) == 0)
#endif
|| (strcmp (name, FFETARGET_nameUNNAMED_BLOCK_DATA) == 0))
return get_identifier (name);
us = ffe_is_second_underscore ()
? (strchr (name, '_') != NULL)
: 0;
return ffecom_get_appended_identifier_ (us, name);
}
#endif
/* Decide whether to append underscore to internal name before calling
get_identifier.
This is for non-external, top-function-context names only. Transform
identifier so it doesn't conflict with the transformed result
of using a _different_ external name. E.g. if "CALL FOO" is
transformed into "FOO_();", then the variable in "FOO_ = 3"
must be transformed into something that does not conflict, since
these two things should be independent.
The transformation is as follows. If the name does not contain
an underscore, there is no possible conflict, so just return.
If the name does contain an underscore, then transform it just
like we transform an external identifier. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_get_identifier_ (char *name)
{
/* If name does not contain an underscore, just return it as is. */
if (!ffe_is_underscoring ()
|| (strchr (name, '_') == NULL))
return get_identifier (name);
return ffecom_get_appended_identifier_ (ffe_is_second_underscore (),
name);
}
#endif
/* ffecom_gen_sfuncdef_ -- Generate definition of statement function
tree t;
ffesymbol s; // kindFUNCTION, whereIMMEDIATE.
t = ffecom_gen_sfuncdef_(s,ffesymbol_basictype(s),
ffesymbol_kindtype(s));
Call after setting up containing function and getting trees for all
other symbols. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_gen_sfuncdef_ (ffesymbol s, ffeinfoBasictype bt, ffeinfoKindtype kt)
{
ffebld expr = ffesymbol_sfexpr (s);
tree type;
tree func;
tree result;
bool charfunc = (bt == FFEINFO_basictypeCHARACTER);
static bool recurse = FALSE;
int yes;
int old_lineno = lineno;
char *old_input_filename = input_filename;
ffecom_nested_entry_ = s;
/* For now, we don't have a handy pointer to where the sfunc is actually
defined, though that should be easy to add to an ffesymbol. (The
token/where info available might well point to the place where the type
of the sfunc is declared, especially if that precedes the place where
the sfunc itself is defined, which is typically the case.) We should
put out a null pointer rather than point somewhere wrong, but I want to
see how it works at this point. */
input_filename = ffesymbol_where_filename (s);
lineno = ffesymbol_where_filelinenum (s);
/* Pretransform the expression so any newly discovered things belong to the
outer program unit, not to the statement function. */
ffecom_expr_transform_ (expr);
/* Make sure no recursive invocation of this fn (a specific case of failing
to pretransform an sfunc's expression, i.e. where its expression
references another untransformed sfunc) happens. */
assert (!recurse);
recurse = TRUE;
yes = suspend_momentary ();
push_f_function_context ();
ffecom_push_calltemps ();
if (charfunc)
type = void_type_node;
else
{
type = ffecom_tree_type[bt][kt];
if (type == NULL_TREE)
type = integer_type_node; /* _sym_exec_transition reports
error. */
}
start_function (ffecom_get_identifier_ (ffesymbol_text (s)),
build_function_type (type, NULL_TREE),
1, /* nested/inline */
0); /* TREE_PUBLIC */
/* We don't worry about COMPLEX return values here, because this is
entirely internal to our code, and gcc has the ability to return COMPLEX
directly as a value. */
yes = suspend_momentary ();
if (charfunc)
{ /* Prepend arg for where result goes. */
tree type;
type = ffecom_tree_type[FFEINFO_basictypeCHARACTER][kt];
result = ffecom_get_invented_identifier ("__g77_%s",
"result", 0);
ffecom_char_enhance_arg_ (&type, s); /* Ignore returned length. */
type = build_pointer_type (type);
result = build_decl (PARM_DECL, result, type);
push_parm_decl (result);
}
else
result = NULL_TREE; /* Not ref'd if !charfunc. */
ffecom_push_dummy_decls_ (ffesymbol_dummyargs (s), TRUE);
resume_momentary (yes);
store_parm_decls (0);
ffecom_start_compstmt_ ();
if (expr != NULL)
{
if (charfunc)
{
ffetargetCharacterSize sz = ffesymbol_size (s);
tree result_length;
result_length = build_int_2 (sz, 0);
TREE_TYPE (result_length) = ffecom_f2c_ftnlen_type_node;
ffecom_let_char_ (result, result_length, sz, expr);
expand_null_return ();
}
else
expand_return (ffecom_modify (NULL_TREE,
DECL_RESULT (current_function_decl),
ffecom_expr (expr)));
clear_momentary ();
}
ffecom_end_compstmt_ ();
func = current_function_decl;
finish_function (1);
ffecom_pop_calltemps ();
pop_f_function_context ();
resume_momentary (yes);
recurse = FALSE;
lineno = old_lineno;
input_filename = old_input_filename;
ffecom_nested_entry_ = NULL;
return func;
}
#endif
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static char *
ffecom_gfrt_args_ (ffecomGfrt ix)
{
return ffecom_gfrt_argstring_[ix];
}
#endif
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_gfrt_tree_ (ffecomGfrt ix)
{
if (ffecom_gfrt_[ix] == NULL_TREE)
ffecom_make_gfrt_ (ix);
return ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (ffecom_gfrt_[ix])),
ffecom_gfrt_[ix]);
}
#endif
/* Return initialize-to-zero expression for this VAR_DECL. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_init_zero_ (tree decl)
{
tree init;
int incremental = TREE_STATIC (decl);
tree type = TREE_TYPE (decl);
if (incremental)
{
int momentary = suspend_momentary ();
push_obstacks_nochange ();
if (TREE_PERMANENT (decl))
end_temporary_allocation ();
make_decl_rtl (decl, NULL, TREE_PUBLIC (decl) ? 1 : 0);
assemble_variable (decl, TREE_PUBLIC (decl) ? 1 : 0, 0, 1);
pop_obstacks ();
resume_momentary (momentary);
}
push_momentary ();
if ((TREE_CODE (type) != ARRAY_TYPE)
&& (TREE_CODE (type) != RECORD_TYPE)
&& (TREE_CODE (type) != UNION_TYPE)
&& !incremental)
init = convert (type, integer_zero_node);
else if (!incremental)
{
int momentary = suspend_momentary ();
init = build (CONSTRUCTOR, type, NULL_TREE, NULL_TREE);
TREE_CONSTANT (init) = 1;
TREE_STATIC (init) = 1;
resume_momentary (momentary);
}
else
{
int momentary = suspend_momentary ();
assemble_zeros (int_size_in_bytes (type));
init = error_mark_node;
resume_momentary (momentary);
}
pop_momentary_nofree ();
return init;
}
#endif
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_intrinsic_ichar_ (tree tree_type, ffebld arg,
tree *maybe_tree)
{
tree expr_tree;
tree length_tree;
switch (ffebld_op (arg))
{
case FFEBLD_opCONTER: /* For F90, check 0-length. */
if (ffetarget_length_character1
(ffebld_constant_character1
(ffebld_conter (arg))) == 0)
{
*maybe_tree = integer_zero_node;
return convert (tree_type, integer_zero_node);
}
*maybe_tree = integer_one_node;
expr_tree = build_int_2 (*ffetarget_text_character1
(ffebld_constant_character1
(ffebld_conter (arg))),
0);
TREE_TYPE (expr_tree) = tree_type;
return expr_tree;
case FFEBLD_opSYMTER:
case FFEBLD_opARRAYREF:
case FFEBLD_opFUNCREF:
case FFEBLD_opSUBSTR:
ffecom_push_calltemps ();
ffecom_char_args_ (&expr_tree, &length_tree, arg);
ffecom_pop_calltemps ();
if ((expr_tree == error_mark_node)
|| (length_tree == error_mark_node))
{
*maybe_tree = error_mark_node;
return error_mark_node;
}
if (integer_zerop (length_tree))
{
*maybe_tree = integer_zero_node;
return convert (tree_type, integer_zero_node);
}
expr_tree
= ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (expr_tree))),
expr_tree);
expr_tree
= ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (expr_tree))),
expr_tree,
integer_one_node);
expr_tree = convert (tree_type, expr_tree);
if (TREE_CODE (length_tree) == INTEGER_CST)
*maybe_tree = integer_one_node;
else /* Must check length at run time. */
*maybe_tree
= ffecom_truth_value
(ffecom_2 (GT_EXPR, integer_type_node,
length_tree,
ffecom_f2c_ftnlen_zero_node));
return expr_tree;
case FFEBLD_opPAREN:
case FFEBLD_opCONVERT:
if (ffeinfo_size (ffebld_info (arg)) == 0)
{
*maybe_tree = integer_zero_node;
return convert (tree_type, integer_zero_node);
}
return ffecom_intrinsic_ichar_ (tree_type, ffebld_left (arg),
maybe_tree);
case FFEBLD_opCONCATENATE:
{
tree maybe_left;
tree maybe_right;
tree expr_left;
tree expr_right;
expr_left = ffecom_intrinsic_ichar_ (tree_type, ffebld_left (arg),
&maybe_left);
expr_right = ffecom_intrinsic_ichar_ (tree_type, ffebld_right (arg),
&maybe_right);
*maybe_tree = ffecom_2 (TRUTH_ORIF_EXPR, integer_type_node,
maybe_left,
maybe_right);
expr_tree = ffecom_3 (COND_EXPR, tree_type,
maybe_left,
expr_left,
expr_right);
return expr_tree;
}
default:
assert ("bad op in ICHAR" == NULL);
return error_mark_node;
}
}
#endif
/* ffecom_intrinsic_len_ -- Return length info for char arg (LEN())
tree length_arg;
ffebld expr;
length_arg = ffecom_intrinsic_len_ (expr);
Handles CHARACTER-type CONTER, SYMTER, SUBSTR, ARRAYREF, and FUNCREF
subexpressions by constructing the appropriate tree for the
length-of-character-text argument in a calling sequence. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_intrinsic_len_ (ffebld expr)
{
ffetargetCharacter1 val;
tree length;
switch (ffebld_op (expr))
{
case FFEBLD_opCONTER:
val = ffebld_constant_character1 (ffebld_conter (expr));
length = build_int_2 (ffetarget_length_character1 (val), 0);
TREE_TYPE (length) = ffecom_f2c_ftnlen_type_node;
break;
case FFEBLD_opSYMTER:
{
ffesymbol s = ffebld_symter (expr);
tree item;
item = ffesymbol_hook (s).decl_tree;
if (item == NULL_TREE)
{
s = ffecom_sym_transform_ (s);
item = ffesymbol_hook (s).decl_tree;
}
if (ffesymbol_kind (s) == FFEINFO_kindENTITY)
{
if (ffesymbol_size (s) == FFETARGET_charactersizeNONE)
length = ffesymbol_hook (s).length_tree;
else
{
length = build_int_2 (ffesymbol_size (s), 0);
TREE_TYPE (length) = ffecom_f2c_ftnlen_type_node;
}
}
else if (item == error_mark_node)
length = error_mark_node;
else /* FFEINFO_kindFUNCTION: */
length = NULL_TREE;
}
break;
case FFEBLD_opARRAYREF:
length = ffecom_intrinsic_len_ (ffebld_left (expr));
break;
case FFEBLD_opSUBSTR:
{
ffebld start;
ffebld end;
ffebld thing = ffebld_right (expr);
tree start_tree;
tree end_tree;
assert (ffebld_op (thing) == FFEBLD_opITEM);
start = ffebld_head (thing);
thing = ffebld_trail (thing);
assert (ffebld_trail (thing) == NULL);
end = ffebld_head (thing);
length = ffecom_intrinsic_len_ (ffebld_left (expr));
if (length == error_mark_node)
break;
if (start == NULL)
{
if (end == NULL)
;
else
{
length = convert (ffecom_f2c_ftnlen_type_node,
ffecom_expr (end));
}
}
else
{
start_tree = convert (ffecom_f2c_ftnlen_type_node,
ffecom_expr (start));
if (start_tree == error_mark_node)
{
length = error_mark_node;
break;
}
if (end == NULL)
{
length = ffecom_2 (PLUS_EXPR, ffecom_f2c_ftnlen_type_node,
ffecom_f2c_ftnlen_one_node,
ffecom_2 (MINUS_EXPR,
ffecom_f2c_ftnlen_type_node,
length,
start_tree));
}
else
{
end_tree = convert (ffecom_f2c_ftnlen_type_node,
ffecom_expr (end));
if (end_tree == error_mark_node)
{
length = error_mark_node;
break;
}
length = ffecom_2 (PLUS_EXPR, ffecom_f2c_ftnlen_type_node,
ffecom_f2c_ftnlen_one_node,
ffecom_2 (MINUS_EXPR,
ffecom_f2c_ftnlen_type_node,
end_tree, start_tree));
}
}
}
break;
case FFEBLD_opCONCATENATE:
length
= ffecom_2 (PLUS_EXPR, ffecom_f2c_ftnlen_type_node,
ffecom_intrinsic_len_ (ffebld_left (expr)),
ffecom_intrinsic_len_ (ffebld_right (expr)));
break;
case FFEBLD_opFUNCREF:
case FFEBLD_opCONVERT:
length = build_int_2 (ffebld_size (expr), 0);
TREE_TYPE (length) = ffecom_f2c_ftnlen_type_node;
break;
default:
assert ("bad op for single char arg expr" == NULL);
length = ffecom_f2c_ftnlen_zero_node;
break;
}
assert (length != NULL_TREE);
return length;
}
#endif
/* ffecom_let_char_ -- Do assignment stuff for character type
tree dest_tree; // destination (ADDR_EXPR)
tree dest_length; // length (INT_CST/INDIRECT_REF(PARM_DECL))
ffetargetCharacterSize dest_size; // length
ffebld source; // source expression
ffecom_let_char_(dest_tree,dest_length,dest_size,source);
Generates code to do the assignment. Used by ordinary assignment
statement handler ffecom_let_stmt and by statement-function
handler to generate code for a statement function. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_let_char_ (tree dest_tree, tree dest_length,
ffetargetCharacterSize dest_size, ffebld source)
{
ffecomConcatList_ catlist;
tree source_length;
tree source_tree;
tree expr_tree;
if ((dest_tree == error_mark_node)
|| (dest_length == error_mark_node))
return;
assert (dest_tree != NULL_TREE);
assert (dest_length != NULL_TREE);
/* Source might be an opCONVERT, which just means it is a different size
than the destination. Since the underlying implementation here handles
that (directly or via the s_copy or s_cat run-time-library functions),
we don't need the "convenience" of an opCONVERT that tells us to
truncate or blank-pad, particularly since the resulting implementation
would probably be slower than otherwise. */
while (ffebld_op (source) == FFEBLD_opCONVERT)
source = ffebld_left (source);
catlist = ffecom_concat_list_new_ (source, dest_size);
switch (ffecom_concat_list_count_ (catlist))
{
case 0: /* Shouldn't happen, but in case it does... */
ffecom_concat_list_kill_ (catlist);
source_tree = null_pointer_node;
source_length = ffecom_f2c_ftnlen_zero_node;
expr_tree = build_tree_list (NULL_TREE, dest_tree);
TREE_CHAIN (expr_tree) = build_tree_list (NULL_TREE, source_tree);
TREE_CHAIN (TREE_CHAIN (expr_tree))
= build_tree_list (NULL_TREE, dest_length);
TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (expr_tree)))
= build_tree_list (NULL_TREE, source_length);
expr_tree = ffecom_call_gfrt (FFECOM_gfrtCOPY, expr_tree);
TREE_SIDE_EFFECTS (expr_tree) = 1;
expand_expr_stmt (expr_tree);
return;
case 1: /* The (fairly) easy case. */
ffecom_char_args_ (&source_tree, &source_length,
ffecom_concat_list_expr_ (catlist, 0));
ffecom_concat_list_kill_ (catlist);
assert (source_tree != NULL_TREE);
assert (source_length != NULL_TREE);
if ((source_tree == error_mark_node)
|| (source_length == error_mark_node))
return;
if (dest_size == 1)
{
dest_tree
= ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE
(dest_tree))),
dest_tree);
dest_tree
= ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE
(dest_tree))),
dest_tree,
integer_one_node);
source_tree
= ffecom_1 (INDIRECT_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE
(source_tree))),
source_tree);
source_tree
= ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE
(source_tree))),
source_tree,
integer_one_node);
expr_tree = ffecom_modify (void_type_node, dest_tree, source_tree);
expand_expr_stmt (expr_tree);
return;
}
expr_tree = build_tree_list (NULL_TREE, dest_tree);
TREE_CHAIN (expr_tree) = build_tree_list (NULL_TREE, source_tree);
TREE_CHAIN (TREE_CHAIN (expr_tree))
= build_tree_list (NULL_TREE, dest_length);
TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (expr_tree)))
= build_tree_list (NULL_TREE, source_length);
expr_tree = ffecom_call_gfrt (FFECOM_gfrtCOPY, expr_tree);
TREE_SIDE_EFFECTS (expr_tree) = 1;
expand_expr_stmt (expr_tree);
return;
default: /* Must actually concatenate things. */
break;
}
/* Heavy-duty concatenation. */
{
int count = ffecom_concat_list_count_ (catlist);
int i;
tree lengths;
tree items;
tree length_array;
tree item_array;
tree citem;
tree clength;
length_array
= lengths
= ffecom_push_tempvar (ffecom_f2c_ftnlen_type_node,
FFETARGET_charactersizeNONE, count, TRUE);
item_array = items = ffecom_push_tempvar (ffecom_f2c_address_type_node,
FFETARGET_charactersizeNONE,
count, TRUE);
for (i = 0; i < count; ++i)
{
ffecom_char_args_ (&citem, &clength,
ffecom_concat_list_expr_ (catlist, i));
if ((citem == error_mark_node)
|| (clength == error_mark_node))
{
ffecom_concat_list_kill_ (catlist);
return;
}
items
= ffecom_2 (COMPOUND_EXPR, TREE_TYPE (items),
ffecom_modify (void_type_node,
ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (item_array))),
item_array,
build_int_2 (i, 0)),
citem),
items);
lengths
= ffecom_2 (COMPOUND_EXPR, TREE_TYPE (lengths),
ffecom_modify (void_type_node,
ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (length_array))),
length_array,
build_int_2 (i, 0)),
clength),
lengths);
}
expr_tree = build_tree_list (NULL_TREE, dest_tree);
TREE_CHAIN (expr_tree)
= build_tree_list (NULL_TREE,
ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (items)),
items));
TREE_CHAIN (TREE_CHAIN (expr_tree))
= build_tree_list (NULL_TREE,
ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (lengths)),
lengths));
TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (expr_tree)))
= build_tree_list
(NULL_TREE,
ffecom_1 (ADDR_EXPR, ffecom_f2c_ptr_to_ftnlen_type_node,
convert (ffecom_f2c_ftnlen_type_node,
build_int_2 (count, 0))));
TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (expr_tree))))
= build_tree_list (NULL_TREE, dest_length);
expr_tree = ffecom_call_gfrt (FFECOM_gfrtCAT, expr_tree);
TREE_SIDE_EFFECTS (expr_tree) = 1;
expand_expr_stmt (expr_tree);
}
ffecom_concat_list_kill_ (catlist);
}
#endif
/* ffecom_make_gfrt_ -- Make initial info for run-time routine
ffecomGfrt ix;
ffecom_make_gfrt_(ix);
Assumes gfrt_[ix] is NULL_TREE, and replaces it with the FUNCTION_DECL
for the indicated run-time routine (ix). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_make_gfrt_ (ffecomGfrt ix)
{
tree t;
tree ttype;
push_obstacks_nochange ();
end_temporary_allocation ();
switch (ffecom_gfrt_type_[ix])
{
case FFECOM_rttypeVOID_:
ttype = void_type_node;
break;
case FFECOM_rttypeVOIDSTAR_:
ttype = TREE_TYPE (null_pointer_node); /* `void *'. */
break;
case FFECOM_rttypeFTNINT_:
ttype = ffecom_f2c_ftnint_type_node;
break;
case FFECOM_rttypeINTEGER_:
ttype = ffecom_f2c_integer_type_node;
break;
case FFECOM_rttypeLONGINT_:
ttype = ffecom_f2c_longint_type_node;
break;
case FFECOM_rttypeLOGICAL_:
ttype = ffecom_f2c_logical_type_node;
break;
case FFECOM_rttypeREAL_F2C_:
ttype = double_type_node;
break;
case FFECOM_rttypeREAL_GNU_:
ttype = float_type_node;
break;
case FFECOM_rttypeCOMPLEX_F2C_:
ttype = void_type_node;
break;
case FFECOM_rttypeCOMPLEX_GNU_:
ttype = ffecom_f2c_complex_type_node;
break;
case FFECOM_rttypeDOUBLE_:
ttype = double_type_node;
break;
case FFECOM_rttypeDOUBLEREAL_:
ttype = ffecom_f2c_doublereal_type_node;
break;
case FFECOM_rttypeDBLCMPLX_F2C_:
ttype = void_type_node;
break;
case FFECOM_rttypeDBLCMPLX_GNU_:
ttype = ffecom_f2c_doublecomplex_type_node;
break;
case FFECOM_rttypeCHARACTER_:
ttype = void_type_node;
break;
default:
ttype = NULL;
assert ("bad rttype" == NULL);
break;
}
ttype = build_function_type (ttype, NULL_TREE);
t = build_decl (FUNCTION_DECL,
get_identifier (ffecom_gfrt_name_[ix]),
ttype);
DECL_EXTERNAL (t) = 1;
TREE_PUBLIC (t) = 1;
TREE_THIS_VOLATILE (t) = ffecom_gfrt_volatile_[ix] ? 1 : 0;
t = start_decl (t, TRUE);
finish_decl (t, NULL_TREE, TRUE);
resume_temporary_allocation ();
pop_obstacks ();
ffecom_gfrt_[ix] = t;
}
#endif
/* Phase 1 pass over each member of a COMMON/EQUIVALENCE group. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_member_phase1_ (ffestorag mst UNUSED, ffestorag st)
{
ffesymbol s = ffestorag_symbol (st);
if (ffesymbol_namelisted (s))
ffecom_member_namelisted_ = TRUE;
}
#endif
/* Phase 2 pass over each member of a COMMON/EQUIVALENCE group. Declare
the member so debugger will see it. Otherwise nobody should be
referencing the member. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
#ifdef SOMEONE_GETS_DEBUG_SUPPORT_WORKING
static void
ffecom_member_phase2_ (ffestorag mst, ffestorag st)
{
ffesymbol s;
tree t;
tree mt;
tree type;
if ((mst == NULL)
|| ((mt = ffestorag_hook (mst)) == NULL)
|| (mt == error_mark_node))
return;
if ((st == NULL)
|| ((s = ffestorag_symbol (st)) == NULL))
return;
type = ffecom_type_localvar_ (s,
ffesymbol_basictype (s),
ffesymbol_kindtype (s));
if (type == error_mark_node)
return;
t = build_decl (VAR_DECL,
ffecom_get_identifier_ (ffesymbol_text (s)),
type);
TREE_STATIC (t) = TREE_STATIC (mt);
DECL_INITIAL (t) = NULL_TREE;
TREE_ASM_WRITTEN (t) = 1;
DECL_RTL (t)
= gen_rtx (MEM, TYPE_MODE (type),
plus_constant (XEXP (DECL_RTL (mt), 0),
ffestorag_modulo (mst)
+ ffestorag_offset (st)
- ffestorag_offset (mst)));
t = start_decl (t, FALSE);
finish_decl (t, NULL_TREE, FALSE);
}
#endif
#endif
/* ffecom_push_dummy_decls_ -- Transform dummy args, push parm decls in order
Ignores STAR (alternate-return) dummies. All other get exec-transitioned
(which generates their trees) and then their trees get push_parm_decl'd.
The second arg is TRUE if the dummies are for a statement function, in
which case lengths are not pushed for character arguments (since they are
always known by both the caller and the callee, though the code allows
for someday permitting CHAR*(*) stmtfunc dummies). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_push_dummy_decls_ (ffebld dummy_list, bool stmtfunc)
{
ffebld dummy;
ffebld dumlist;
ffesymbol s;
tree parm;
ffecom_transform_only_dummies_ = TRUE;
/* First push the parms corresponding to actual dummy "contents". */
for (dumlist = dummy_list; dumlist != NULL; dumlist = ffebld_trail (dumlist))
{
dummy = ffebld_head (dumlist);
switch (ffebld_op (dummy))
{
case FFEBLD_opSTAR:
case FFEBLD_opANY:
continue; /* Forget alternate returns. */
default:
break;
}
assert (ffebld_op (dummy) == FFEBLD_opSYMTER);
s = ffebld_symter (dummy);
parm = ffesymbol_hook (s).decl_tree;
if (parm == NULL_TREE)
{
s = ffecom_sym_transform_ (s);
parm = ffesymbol_hook (s).decl_tree;
assert (parm != NULL_TREE);
}
if (parm != error_mark_node)
push_parm_decl (parm);
}
/* Then, for CHARACTER dummies, push the parms giving their lengths. */
for (dumlist = dummy_list; dumlist != NULL; dumlist = ffebld_trail (dumlist))
{
dummy = ffebld_head (dumlist);
switch (ffebld_op (dummy))
{
case FFEBLD_opSTAR:
case FFEBLD_opANY:
continue; /* Forget alternate returns, they mean
NOTHING! */
default:
break;
}
s = ffebld_symter (dummy);
if (ffesymbol_basictype (s) != FFEINFO_basictypeCHARACTER)
continue; /* Only looking for CHARACTER arguments. */
if (stmtfunc && (ffesymbol_size (s) != FFETARGET_charactersizeNONE))
continue; /* Stmtfunc arg with known size needs no
length param. */
if (ffesymbol_kind (s) != FFEINFO_kindENTITY)
continue; /* Only looking for variables and arrays. */
parm = ffesymbol_hook (s).length_tree;
assert (parm != NULL_TREE);
if (parm != error_mark_node)
push_parm_decl (parm);
}
ffecom_transform_only_dummies_ = FALSE;
}
#endif
/* ffecom_start_progunit_ -- Beginning of program unit
Does GNU back end stuff necessary to teach it about the start of its
equivalent of a Fortran program unit. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_start_progunit_ ()
{
ffesymbol fn = ffecom_primary_entry_;
ffebld arglist;
tree id; /* Identifier (name) of function. */
tree type; /* Type of function. */
tree result; /* Result of function. */
ffeinfoBasictype bt;
ffeinfoKindtype kt;
ffeglobal g;
ffeglobalType gt;
ffeglobalType egt = FFEGLOBAL_type;
bool charfunc;
bool cmplxfunc;
bool altentries = (ffecom_num_entrypoints_ != 0);
bool multi
= altentries
&& (ffecom_primary_entry_kind_ == FFEINFO_kindFUNCTION)
&& (ffecom_master_bt_ == FFEINFO_basictypeNONE);
bool main_program = FALSE;
int old_lineno = lineno;
char *old_input_filename = input_filename;
int yes;
assert (fn != NULL);
assert (ffesymbol_hook (fn).decl_tree == NULL_TREE);
input_filename = ffesymbol_where_filename (fn);
lineno = ffesymbol_where_filelinenum (fn);
/* c-parse.y indeed does call suspend_momentary and not only ignores the
return value, but also never calls resume_momentary, when starting an
outer function (see "fndef:", "setspecs:", and so on). So g77 does the
same thing. It shouldn't be a problem since start_function calls
temporary_allocation, but it might be necessary. If it causes a problem
here, then maybe there's a bug lurking in gcc. NOTE: This identical
comment appears twice in thist file. */
suspend_momentary ();
switch (ffecom_primary_entry_kind_)
{
case FFEINFO_kindPROGRAM:
main_program = TRUE;
gt = FFEGLOBAL_typeMAIN;
bt = FFEINFO_basictypeNONE;
kt = FFEINFO_kindtypeNONE;
type = ffecom_tree_fun_type_void;
charfunc = FALSE;
cmplxfunc = FALSE;
break;
case FFEINFO_kindBLOCKDATA:
gt = FFEGLOBAL_typeBDATA;
bt = FFEINFO_basictypeNONE;
kt = FFEINFO_kindtypeNONE;
type = ffecom_tree_fun_type_void;
charfunc = FALSE;
cmplxfunc = FALSE;
break;
case FFEINFO_kindFUNCTION:
gt = FFEGLOBAL_typeFUNC;
egt = FFEGLOBAL_typeEXT;
bt = ffesymbol_basictype (fn);
kt = ffesymbol_kindtype (fn);
if (bt == FFEINFO_basictypeNONE)
{
ffeimplic_establish_symbol (fn);
if (ffesymbol_funcresult (fn) != NULL)
ffeimplic_establish_symbol (ffesymbol_funcresult (fn));
bt = ffesymbol_basictype (fn);
kt = ffesymbol_kindtype (fn);
}
if (multi)
charfunc = cmplxfunc = FALSE;
else if (bt == FFEINFO_basictypeCHARACTER)
charfunc = TRUE, cmplxfunc = FALSE;
else if ((bt == FFEINFO_basictypeCOMPLEX)
&& ffesymbol_is_f2c (fn)
&& !altentries)
charfunc = FALSE, cmplxfunc = TRUE;
else
charfunc = cmplxfunc = FALSE;
if (multi || charfunc)
type = ffecom_tree_fun_type_void;
else if (ffesymbol_is_f2c (fn) && !altentries)
type = ffecom_tree_fun_type[bt][kt];
else
type = build_function_type (ffecom_tree_type[bt][kt], NULL_TREE);
if ((type == NULL_TREE)
|| (TREE_TYPE (type) == NULL_TREE))
type = ffecom_tree_fun_type_void; /* _sym_exec_transition. */
break;
case FFEINFO_kindSUBROUTINE:
gt = FFEGLOBAL_typeSUBR;
egt = FFEGLOBAL_typeEXT;
bt = FFEINFO_basictypeNONE;
kt = FFEINFO_kindtypeNONE;
if (ffecom_is_altreturning_)
type = ffecom_tree_subr_type;
else
type = ffecom_tree_fun_type_void;
charfunc = FALSE;
cmplxfunc = FALSE;
break;
default:
assert ("say what??" == NULL);
/* Fall through. */
case FFEINFO_kindANY:
gt = FFEGLOBAL_typeANY;
bt = FFEINFO_basictypeNONE;
kt = FFEINFO_kindtypeNONE;
type = error_mark_node;
charfunc = FALSE;
cmplxfunc = FALSE;
break;
}
if (altentries)
{
id = ffecom_get_invented_identifier ("__g77_masterfun_%s",
ffesymbol_text (fn),
0);
IDENTIFIER_INVENTED (id) = 0; /* Allow this to be debugged. */
}
#if FFETARGET_isENFORCED_MAIN
else if (main_program)
id = get_identifier (FFETARGET_nameENFORCED_MAIN_NAME);
#endif
else
id = ffecom_get_external_identifier_ (fn);
start_function (id,
type,
0, /* nested/inline */
!altentries); /* TREE_PUBLIC */
TREE_USED (current_function_decl) = 1; /* Avoid spurious warning if altentries. */
if (!altentries
&& ((g = ffesymbol_global (fn)) != NULL)
&& ((ffeglobal_type (g) == gt)
|| (ffeglobal_type (g) == egt)))
{
ffeglobal_set_hook (g, current_function_decl);
}
yes = suspend_momentary ();
/* Arg handling needs exec-transitioned ffesymbols to work with. But
exec-transitioning needs current_function_decl to be filled in. So we
do these things in two phases. */
if (altentries)
{ /* 1st arg identifies which entrypoint. */
ffecom_which_entrypoint_decl_
= build_decl (PARM_DECL,
ffecom_get_invented_identifier ("__g77_%s",
"which_entrypoint",
0),
integer_type_node);
push_parm_decl (ffecom_which_entrypoint_decl_);
}
if (charfunc
|| cmplxfunc
|| multi)
{ /* Arg for result (return value). */
tree type;
tree length;
if (charfunc)
type = ffecom_tree_type[FFEINFO_basictypeCHARACTER][kt];
else if (cmplxfunc)
type = ffecom_tree_type[FFEINFO_basictypeCOMPLEX][kt];
else
type = ffecom_multi_type_node_;
result = ffecom_get_invented_identifier ("__g77_%s",
"result", 0);
/* Make length arg _and_ enhance type info for CHAR arg itself. */
if (charfunc)
length = ffecom_char_enhance_arg_ (&type, fn);
else
length = NULL_TREE; /* Not ref'd if !charfunc. */
type = build_pointer_type (type);
result = build_decl (PARM_DECL, result, type);
push_parm_decl (result);
if (multi)
ffecom_multi_retval_ = result;
else
ffecom_func_result_ = result;
if (charfunc)
{
push_parm_decl (length);
ffecom_func_length_ = length;
}
}
if (ffecom_primary_entry_is_proc_)
{
if (altentries)
arglist = ffecom_master_arglist_;
else
arglist = ffesymbol_dummyargs (fn);
ffecom_push_dummy_decls_ (arglist, FALSE);
}
resume_momentary (yes);
if (TREE_CODE (current_function_decl) != ERROR_MARK)
store_parm_decls (main_program ? 1 : 0);
ffecom_start_compstmt_ ();
lineno = old_lineno;
input_filename = old_input_filename;
/* This handles any symbols still untransformed, in case -g specified.
This used to be done in ffecom_finish_progunit, but it turns out to
be necessary to do it here so that statement functions are
expanded before code. But don't bother for BLOCK DATA. */
if (ffecom_primary_entry_kind_ != FFEINFO_kindBLOCKDATA)
ffesymbol_drive (ffecom_finish_symbol_transform_);
}
#endif
/* ffecom_sym_transform_ -- Transform FFE sym into backend sym
ffesymbol s;
ffecom_sym_transform_(s);
The ffesymbol_hook info for s is updated with appropriate backend info
on the symbol. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static ffesymbol
ffecom_sym_transform_ (ffesymbol s)
{
tree t; /* Transformed thingy. */
tree tlen; /* Length if CHAR*(*). */
bool addr; /* Is t the address of the thingy? */
ffeinfoBasictype bt;
ffeinfoKindtype kt;
ffeglobal g;
int yes;
int old_lineno = lineno;
char *old_input_filename = input_filename;
if (ffesymbol_sfdummyparent (s) == NULL)
{
input_filename = ffesymbol_where_filename (s);
lineno = ffesymbol_where_filelinenum (s);
}
else
{
ffesymbol sf = ffesymbol_sfdummyparent (s);
input_filename = ffesymbol_where_filename (sf);
lineno = ffesymbol_where_filelinenum (sf);
}
bt = ffeinfo_basictype (ffebld_info (s));
kt = ffeinfo_kindtype (ffebld_info (s));
t = NULL_TREE;
tlen = NULL_TREE;
addr = FALSE;
switch (ffesymbol_kind (s))
{
case FFEINFO_kindNONE:
switch (ffesymbol_where (s))
{
case FFEINFO_whereDUMMY: /* Subroutine or function. */
assert (ffecom_transform_only_dummies_);
/* Before 0.4, this could be ENTITY/DUMMY, but see
ffestu_sym_end_transition -- no longer true (in particular, if
it could be an ENTITY, it _will_ be made one, so that
possibility won't come through here). So we never make length
arg for CHARACTER type. */
t = build_decl (PARM_DECL,
ffecom_get_identifier_ (ffesymbol_text (s)),
ffecom_tree_ptr_to_subr_type);
#if BUILT_FOR_270
DECL_ARTIFICIAL (t) = 1;
#endif
addr = TRUE;
break;
case FFEINFO_whereGLOBAL: /* Subroutine or function. */
assert (!ffecom_transform_only_dummies_);
if (((g = ffesymbol_global (s)) != NULL)
&& ((ffeglobal_type (g) == FFEGLOBAL_typeSUBR)
|| (ffeglobal_type (g) == FFEGLOBAL_typeFUNC)
|| (ffeglobal_type (g) == FFEGLOBAL_typeEXT))
&& (ffeglobal_hook (g) != NULL_TREE)
&& ffe_is_globals ())
{
t = ffeglobal_hook (g);
break;
}
push_obstacks_nochange ();
end_temporary_allocation ();
t = build_decl (FUNCTION_DECL,
ffecom_get_external_identifier_ (s),
ffecom_tree_subr_type); /* Assume subr. */
DECL_EXTERNAL (t) = 1;
TREE_PUBLIC (t) = 1;
t = start_decl (t, FALSE);
finish_decl (t, NULL_TREE, FALSE);
if ((g != NULL)
&& ((ffeglobal_type (g) == FFEGLOBAL_typeSUBR)
|| (ffeglobal_type (g) == FFEGLOBAL_typeFUNC)
|| (ffeglobal_type (g) == FFEGLOBAL_typeEXT)))
ffeglobal_set_hook (g, t);
resume_temporary_allocation ();
pop_obstacks ();
break;
default:
assert ("NONE where unexpected" == NULL);
/* Fall through. */
case FFEINFO_whereANY:
break;
}
break;
case FFEINFO_kindENTITY:
switch (ffeinfo_where (ffesymbol_info (s)))
{
case FFEINFO_whereCONSTANT: /* ~~debugging info needed? */
assert (!ffecom_transform_only_dummies_);
t = error_mark_node; /* Shouldn't ever see this in expr. */
break;
case FFEINFO_whereLOCAL:
assert (!ffecom_transform_only_dummies_);
{
ffestorag st = ffesymbol_storage (s);
tree type;
if ((st != NULL)
&& (ffestorag_size (st) == 0))
{
t = error_mark_node;
break;
}
yes = suspend_momentary ();
type = ffecom_type_localvar_ (s, bt, kt);
resume_momentary (yes);
if (type == error_mark_node)
{
t = error_mark_node;
break;
}
if ((st != NULL)
&& (ffestorag_parent (st) != NULL))
{ /* Child of EQUIVALENCE parent. */
ffestorag est;
tree et;
int yes;
ffetargetOffset offset;
est = ffestorag_parent (st);
ffecom_transform_equiv_ (est);
et = ffestorag_hook (est);
assert (et != NULL_TREE);
if (! TREE_STATIC (et))
put_var_into_stack (et);
yes = suspend_momentary ();
offset = ffestorag_modulo (est)
+ ffestorag_offset (ffesymbol_storage (s))
- ffestorag_offset (est);
ffecom_debug_kludge_ (et, "EQUIVALENCE", s, type, offset);
/* (t_type *) (((char *) &et) + offset) */
t = convert (string_type_node, /* (char *) */
ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (et)),
et));
t = ffecom_2 (PLUS_EXPR, TREE_TYPE (t),
t,
build_int_2 (offset, 0));
t = convert (build_pointer_type (type),
t);
addr = TRUE;
resume_momentary (yes);
}
else
{
tree initexpr;
bool init = ffesymbol_is_init (s);
yes = suspend_momentary ();
t = build_decl (VAR_DECL,
ffecom_get_identifier_ (ffesymbol_text (s)),
type);
if (init
|| ffesymbol_namelisted (s)
#ifdef FFECOM_sizeMAXSTACKITEM
|| ((st != NULL)
&& (ffestorag_size (st) > FFECOM_sizeMAXSTACKITEM))
#endif
|| ((ffecom_primary_entry_kind_ != FFEINFO_kindPROGRAM)
&& (ffecom_primary_entry_kind_
!= FFEINFO_kindBLOCKDATA)
&& (ffesymbol_is_save (s) || ffe_is_saveall ())))
TREE_STATIC (t) = !ffesymbol_attr (s, FFESYMBOL_attrADJUSTABLE);
else
TREE_STATIC (t) = 0; /* No need to make static. */
if (init || ffe_is_init_local_zero ())
DECL_INITIAL (t) = error_mark_node;
/* Keep -Wunused from complaining about var if it
is used as sfunc arg or DATA implied-DO. */
if (ffesymbol_attrs (s) & FFESYMBOL_attrsSFARG)
DECL_IN_SYSTEM_HEADER (t) = 1;
t = start_decl (t, FALSE);
if (init)
{
if (ffesymbol_init (s) != NULL)
initexpr = ffecom_expr (ffesymbol_init (s));
else
initexpr = ffecom_init_zero_ (t);
}
else if (ffe_is_init_local_zero ())
initexpr = ffecom_init_zero_ (t);
else
initexpr = NULL_TREE; /* Not ref'd if !init. */
finish_decl (t, initexpr, FALSE);
if ((st != NULL) && (DECL_SIZE (t) != error_mark_node))
{
tree size_tree;
size_tree = size_binop (CEIL_DIV_EXPR,
DECL_SIZE (t),
size_int (BITS_PER_UNIT));
assert (TREE_INT_CST_HIGH (size_tree) == 0);
assert (TREE_INT_CST_LOW (size_tree) == ffestorag_size (st));
}
resume_momentary (yes);
}
}
break;
case FFEINFO_whereRESULT:
assert (!ffecom_transform_only_dummies_);
if (bt == FFEINFO_basictypeCHARACTER)
{ /* Result is already in list of dummies, use
it (& length). */
t = ffecom_func_result_;
tlen = ffecom_func_length_;
addr = TRUE;
break;
}
if ((ffecom_num_entrypoints_ == 0)
&& (bt == FFEINFO_basictypeCOMPLEX)
&& (ffesymbol_is_f2c (ffecom_primary_entry_)))
{ /* Result is already in list of dummies, use
it. */
t = ffecom_func_result_;
addr = TRUE;
break;
}
if (ffecom_func_result_ != NULL_TREE)
{
t = ffecom_func_result_;
break;
}
if ((ffecom_num_entrypoints_ != 0)
&& (ffecom_master_bt_ == FFEINFO_basictypeNONE))
{
yes = suspend_momentary ();
assert (ffecom_multi_retval_ != NULL_TREE);
t = ffecom_1 (INDIRECT_REF, ffecom_multi_type_node_,
ffecom_multi_retval_);
t = ffecom_2 (COMPONENT_REF, ffecom_tree_type[bt][kt],
t, ffecom_multi_fields_[bt][kt]);
resume_momentary (yes);
break;
}
yes = suspend_momentary ();
t = build_decl (VAR_DECL,
ffecom_get_identifier_ (ffesymbol_text (s)),
ffecom_tree_type[bt][kt]);
TREE_STATIC (t) = 0; /* Put result on stack. */
t = start_decl (t, FALSE);
finish_decl (t, NULL_TREE, FALSE);
ffecom_func_result_ = t;
resume_momentary (yes);
break;
case FFEINFO_whereDUMMY:
{
tree type;
ffebld dl;
ffebld dim;
tree low;
tree high;
tree old_sizes;
bool adjustable = FALSE; /* Conditionally adjustable? */
type = ffecom_tree_type[bt][kt];
if (ffesymbol_sfdummyparent (s) != NULL)
{
if (current_function_decl == ffecom_outer_function_decl_)
{ /* Exec transition before sfunc
context; get it later. */
break;
}
t = ffecom_get_identifier_ (ffesymbol_text
(ffesymbol_sfdummyparent (s)));
}
else
t = ffecom_get_identifier_ (ffesymbol_text (s));
assert (ffecom_transform_only_dummies_);
old_sizes = get_pending_sizes ();
put_pending_sizes (old_sizes);
if (bt == FFEINFO_basictypeCHARACTER)
tlen = ffecom_char_enhance_arg_ (&type, s);
type = ffecom_check_size_overflow_ (s, type, TRUE);
for (dl = ffesymbol_dims (s); dl != NULL; dl = ffebld_trail (dl))
{
if (type == error_mark_node)
break;
dim = ffebld_head (dl);
assert (ffebld_op (dim) == FFEBLD_opBOUNDS);
if ((ffebld_left (dim) == NULL) || ffecom_doing_entry_)
low = ffecom_integer_one_node;
else
low = ffecom_expr (ffebld_left (dim));
assert (ffebld_right (dim) != NULL);
if ((ffebld_op (ffebld_right (dim)) == FFEBLD_opSTAR)
|| ffecom_doing_entry_)
{
/* Used to just do high=low. But for ffecom_tree_
canonize_ref_, it probably is important to correctly
assess the size. E.g. given COMPLEX C(*),CFUNC and
C(2)=CFUNC(C), overlap can happen, while it can't
for, say, C(1)=CFUNC(C(2)). */
/* Even more recently used to set to INT_MAX, but that
broke when some overflow checking went into the back
end. Now we just leave the upper bound unspecified. */
high = NULL;
}
else
high = ffecom_expr (ffebld_right (dim));
/* Determine whether array is conditionally adjustable,
to decide whether back-end magic is needed.
Normally the front end uses the back-end function
variable_size to wrap SAVE_EXPR's around expressions
affecting the size/shape of an array so that the
size/shape info doesn't change during execution
of the compiled code even though variables and
functions referenced in those expressions might.
variable_size also makes sure those saved expressions
get evaluated immediately upon entry to the
compiled procedure -- the front end normally doesn't
have to worry about that.
However, there is a problem with this that affects
g77's implementation of entry points, and that is
that it is _not_ true that each invocation of the
compiled procedure is permitted to evaluate
array size/shape info -- because it is possible
that, for some invocations, that info is invalid (in
which case it is "promised" -- i.e. a violation of
the Fortran standard -- that the compiled code
won't reference the array or its size/shape
during that particular invocation).
To phrase this in C terms, consider this gcc function:
void foo (int *n, float (*a)[*n])
{
// a is "pointer to array ...", fyi.
}
Suppose that, for some invocations, it is permitted
for a caller of foo to do this:
foo (NULL, NULL);
Now the _written_ code for foo can take such a call
into account by either testing explicitly for whether
(a == NULL) || (n == NULL) -- presumably it is
not permitted to reference *a in various fashions
if (n == NULL) I suppose -- or it can avoid it by
looking at other info (other arguments, static/global
data, etc.).
However, this won't work in gcc 2.5.8 because it'll
automatically emit the code to save the "*n"
expression, which'll yield a NULL dereference for
the "foo (NULL, NULL)" call, something the code
for foo cannot prevent.
g77 definitely needs to avoid executing such
code anytime the pointer to the adjustable array
is NULL, because even if its bounds expressions
don't have any references to possible "absent"
variables like "*n" -- say all variable references
are to COMMON variables, i.e. global (though in C,
local static could actually make sense) -- the
expressions could yield other run-time problems
for allowably "dead" values in those variables.
For example, let's consider a more complicated
version of foo:
extern int i;
extern int j;
void foo (float (*a)[i/j])
{
...
}
The above is (essentially) quite valid for Fortran
but, again, for a call like "foo (NULL);", it is
permitted for i and j to be undefined when the
call is made. If j happened to be zero, for
example, emitting the code to evaluate "i/j"
could result in a run-time error.
Offhand, though I don't have my F77 or F90
standards handy, it might even be valid for a
bounds expression to contain a function reference,
in which case I doubt it is permitted for an
implementation to invoke that function in the
Fortran case involved here (invocation of an
alternate ENTRY point that doesn't have the adjustable
array as one of its arguments).
So, the code that the compiler would normally emit
to preevaluate the size/shape info for an
adjustable array _must not_ be executed at run time
in certain cases. Specifically, for Fortran,
the case is when the pointer to the adjustable
array == NULL. (For gnu-ish C, it might be nice
for the source code itself to specify an expression
that, if TRUE, inhibits execution of the code. Or
reverse the sense for elegance.)
(Note that g77 could use a different test than NULL,
actually, since it happens to always pass an
integer to the called function that specifies which
entry point is being invoked. Hmm, this might
solve the next problem.)
One way a user could, I suppose, write "foo" so
it works is to insert COND_EXPR's for the
size/shape info so the dangerous stuff isn't
actually done, as in:
void foo (int *n, float (*a)[(a == NULL) ? 0 : *n])
{
...
}
The next problem is that the front end needs to
be able to tell the back end about the array's
decl _before_ it tells it about the conditional
expression to inhibit evaluation of size/shape info,
as shown above.
To solve this, the front end needs to be able
to give the back end the expression to inhibit
generation of the preevaluation code _after_
it makes the decl for the adjustable array.
Until then, the above example using the COND_EXPR
doesn't pass muster with gcc because the "(a == NULL)"
part has a reference to "a", which is still
undefined at that point.
g77 will therefore use a different mechanism in the
meantime. */
if (!adjustable
&& ((TREE_CODE (low) != INTEGER_CST)
|| (high && TREE_CODE (high) != INTEGER_CST)))
adjustable = TRUE;
#if 0 /* Old approach -- see below. */
if (TREE_CODE (low) != INTEGER_CST)
low = ffecom_3 (COND_EXPR, integer_type_node,
ffecom_adjarray_passed_ (s),
low,
ffecom_integer_zero_node);
if (high && TREE_CODE (high) != INTEGER_CST)
high = ffecom_3 (COND_EXPR, integer_type_node,
ffecom_adjarray_passed_ (s),
high,
ffecom_integer_zero_node);
#endif
/* ~~~gcc/stor-layout.c/layout_type should do this,
probably. Fixes 950302-1.f. */
if (TREE_CODE (low) != INTEGER_CST)
low = variable_size (low);
/* ~~~similarly, this fixes dumb0.f. The C front end
does this, which is why dumb0.c would work. */
if (high && TREE_CODE (high) != INTEGER_CST)
high = variable_size (high);
type
= build_array_type
(type,
build_range_type (ffecom_integer_type_node,
low, high));
type = ffecom_check_size_overflow_ (s, type, TRUE);
}
if (type == error_mark_node)
{
t = error_mark_node;
break;
}
if ((ffesymbol_sfdummyparent (s) == NULL)
|| (ffesymbol_basictype (s) == FFEINFO_basictypeCHARACTER))
{
type = build_pointer_type (type);
addr = TRUE;
}
t = build_decl (PARM_DECL, t, type);
#if BUILT_FOR_270
DECL_ARTIFICIAL (t) = 1;
#endif
/* If this arg is present in every entry point's list of
dummy args, then we're done. */
if (ffesymbol_numentries (s)
== (ffecom_num_entrypoints_ + 1))
break;
#if 1
/* If variable_size in stor-layout has been called during
the above, then get_pending_sizes should have the
yet-to-be-evaluated saved expressions pending.
Make the whole lot of them get emitted, conditionally
on whether the array decl ("t" above) is not NULL. */
{
tree sizes = get_pending_sizes ();
tree tem;
for (tem = sizes;
tem != old_sizes;
tem = TREE_CHAIN (tem))
{
tree temv = TREE_VALUE (tem);
if (sizes == tem)
sizes = temv;
else
sizes
= ffecom_2 (COMPOUND_EXPR,
TREE_TYPE (sizes),
temv,
sizes);
}
if (sizes != tem)
{
sizes
= ffecom_3 (COND_EXPR,
TREE_TYPE (sizes),
ffecom_2 (NE_EXPR,
integer_type_node,
t,
null_pointer_node),
sizes,
convert (TREE_TYPE (sizes),
integer_zero_node));
sizes = ffecom_save_tree (sizes);
sizes
= tree_cons (NULL_TREE, sizes, tem);
}
if (sizes)
put_pending_sizes (sizes);
}
#else
#if 0
if (adjustable
&& (ffesymbol_numentries (s)
!= ffecom_num_entrypoints_ + 1))
DECL_SOMETHING (t)
= ffecom_2 (NE_EXPR, integer_type_node,
t,
null_pointer_node);
#else
#if 0
if (adjustable
&& (ffesymbol_numentries (s)
!= ffecom_num_entrypoints_ + 1))
{
ffebad_start (FFEBAD_MISSING_ADJARRAY_UNSUPPORTED);
ffebad_here (0, ffesymbol_where_line (s),
ffesymbol_where_column (s));
ffebad_string (ffesymbol_text (s));
ffebad_finish ();
}
#endif
#endif
#endif
}
break;
case FFEINFO_whereCOMMON:
{
ffesymbol cs;
ffeglobal cg;
tree ct;
ffestorag st = ffesymbol_storage (s);
tree type;
int yes;
cs = ffesymbol_common (s); /* The COMMON area itself. */
if (st != NULL) /* Else not laid out. */
{
ffecom_transform_common_ (cs);
st = ffesymbol_storage (s);
}
yes = suspend_momentary ();
type = ffecom_type_localvar_ (s, bt, kt);
cg = ffesymbol_global (cs); /* The global COMMON info. */
if ((cg == NULL)
|| (ffeglobal_type (cg) != FFEGLOBAL_typeCOMMON))
ct = NULL_TREE;
else
ct = ffeglobal_hook (cg); /* The common area's tree. */
if ((ct == NULL_TREE)
|| (st == NULL)
|| (type == error_mark_node))
t = error_mark_node;
else
{
ffetargetOffset offset;
ffestorag cst;
cst = ffestorag_parent (st);
assert (cst == ffesymbol_storage (cs));
offset = ffestorag_modulo (cst)
+ ffestorag_offset (st)
- ffestorag_offset (cst);
ffecom_debug_kludge_ (ct, "COMMON", s, type, offset);
/* (t_type *) (((char *) &ct) + offset) */
t = convert (string_type_node, /* (char *) */
ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (ct)),
ct));
t = ffecom_2 (PLUS_EXPR, TREE_TYPE (t),
t,
build_int_2 (offset, 0));
t = convert (build_pointer_type (type),
t);
addr = TRUE;
}
resume_momentary (yes);
}
break;
case FFEINFO_whereIMMEDIATE:
case FFEINFO_whereGLOBAL:
case FFEINFO_whereFLEETING:
case FFEINFO_whereFLEETING_CADDR:
case FFEINFO_whereFLEETING_IADDR:
case FFEINFO_whereINTRINSIC:
case FFEINFO_whereCONSTANT_SUBOBJECT:
default:
assert ("ENTITY where unheard of" == NULL);
/* Fall through. */
case FFEINFO_whereANY:
t = error_mark_node;
break;
}
break;
case FFEINFO_kindFUNCTION:
switch (ffeinfo_where (ffesymbol_info (s)))
{
case FFEINFO_whereLOCAL: /* Me. */
assert (!ffecom_transform_only_dummies_);
t = current_function_decl;
break;
case FFEINFO_whereGLOBAL:
assert (!ffecom_transform_only_dummies_);
if (((g = ffesymbol_global (s)) != NULL)
&& ((ffeglobal_type (g) == FFEGLOBAL_typeFUNC)
|| (ffeglobal_type (g) == FFEGLOBAL_typeEXT))
&& (ffeglobal_hook (g) != NULL_TREE)
&& ffe_is_globals ())
{
t = ffeglobal_hook (g);
break;
}
push_obstacks_nochange ();
end_temporary_allocation ();
if (ffesymbol_is_f2c (s)
&& (ffesymbol_where (s) != FFEINFO_whereCONSTANT))
t = ffecom_tree_fun_type[bt][kt];
else
t = build_function_type (ffecom_tree_type[bt][kt], NULL_TREE);
t = build_decl (FUNCTION_DECL,
ffecom_get_external_identifier_ (s),
t);
DECL_EXTERNAL (t) = 1;
TREE_PUBLIC (t) = 1;
t = start_decl (t, FALSE);
finish_decl (t, NULL_TREE, FALSE);
if ((g != NULL)
&& ((ffeglobal_type (g) == FFEGLOBAL_typeFUNC)
|| (ffeglobal_type (g) == FFEGLOBAL_typeEXT)))
ffeglobal_set_hook (g, t);
resume_temporary_allocation ();
pop_obstacks ();
break;
case FFEINFO_whereDUMMY:
assert (ffecom_transform_only_dummies_);
if (ffesymbol_is_f2c (s)
&& (ffesymbol_where (s) != FFEINFO_whereCONSTANT))
t = ffecom_tree_ptr_to_fun_type[bt][kt];
else
t = build_pointer_type
(build_function_type (ffecom_tree_type[bt][kt], NULL_TREE));
t = build_decl (PARM_DECL,
ffecom_get_identifier_ (ffesymbol_text (s)),
t);
#if BUILT_FOR_270
DECL_ARTIFICIAL (t) = 1;
#endif
addr = TRUE;
break;
case FFEINFO_whereCONSTANT: /* Statement function. */
assert (!ffecom_transform_only_dummies_);
t = ffecom_gen_sfuncdef_ (s, bt, kt);
break;
case FFEINFO_whereINTRINSIC:
assert (!ffecom_transform_only_dummies_);
break; /* Let actual references generate their
decls. */
default:
assert ("FUNCTION where unheard of" == NULL);
/* Fall through. */
case FFEINFO_whereANY:
t = error_mark_node;
break;
}
break;
case FFEINFO_kindSUBROUTINE:
switch (ffeinfo_where (ffesymbol_info (s)))
{
case FFEINFO_whereLOCAL: /* Me. */
assert (!ffecom_transform_only_dummies_);
t = current_function_decl;
break;
case FFEINFO_whereGLOBAL:
assert (!ffecom_transform_only_dummies_);
if (((g = ffesymbol_global (s)) != NULL)
&& ((ffeglobal_type (g) == FFEGLOBAL_typeSUBR)
|| (ffeglobal_type (g) == FFEGLOBAL_typeEXT))
&& (ffeglobal_hook (g) != NULL_TREE)
&& ffe_is_globals ())
{
t = ffeglobal_hook (g);
break;
}
push_obstacks_nochange ();
end_temporary_allocation ();
t = build_decl (FUNCTION_DECL,
ffecom_get_external_identifier_ (s),
ffecom_tree_subr_type);
DECL_EXTERNAL (t) = 1;
TREE_PUBLIC (t) = 1;
t = start_decl (t, FALSE);
finish_decl (t, NULL_TREE, FALSE);
if ((g != NULL)
&& ((ffeglobal_type (g) == FFEGLOBAL_typeSUBR)
|| (ffeglobal_type (g) == FFEGLOBAL_typeEXT)))
ffeglobal_set_hook (g, t);
resume_temporary_allocation ();
pop_obstacks ();
break;
case FFEINFO_whereDUMMY:
assert (ffecom_transform_only_dummies_);
t = build_decl (PARM_DECL,
ffecom_get_identifier_ (ffesymbol_text (s)),
ffecom_tree_ptr_to_subr_type);
#if BUILT_FOR_270
DECL_ARTIFICIAL (t) = 1;
#endif
addr = TRUE;
break;
case FFEINFO_whereINTRINSIC:
assert (!ffecom_transform_only_dummies_);
break; /* Let actual references generate their
decls. */
default:
assert ("SUBROUTINE where unheard of" == NULL);
/* Fall through. */
case FFEINFO_whereANY:
t = error_mark_node;
break;
}
break;
case FFEINFO_kindPROGRAM:
switch (ffeinfo_where (ffesymbol_info (s)))
{
case FFEINFO_whereLOCAL: /* Me. */
assert (!ffecom_transform_only_dummies_);
t = current_function_decl;
break;
case FFEINFO_whereCOMMON:
case FFEINFO_whereDUMMY:
case FFEINFO_whereGLOBAL:
case FFEINFO_whereRESULT:
case FFEINFO_whereFLEETING:
case FFEINFO_whereFLEETING_CADDR:
case FFEINFO_whereFLEETING_IADDR:
case FFEINFO_whereIMMEDIATE:
case FFEINFO_whereINTRINSIC:
case FFEINFO_whereCONSTANT:
case FFEINFO_whereCONSTANT_SUBOBJECT:
default:
assert ("PROGRAM where unheard of" == NULL);
/* Fall through. */
case FFEINFO_whereANY:
t = error_mark_node;
break;
}
break;
case FFEINFO_kindBLOCKDATA:
switch (ffeinfo_where (ffesymbol_info (s)))
{
case FFEINFO_whereLOCAL: /* Me. */
assert (!ffecom_transform_only_dummies_);
t = current_function_decl;
break;
case FFEINFO_whereGLOBAL:
assert (!ffecom_transform_only_dummies_);
push_obstacks_nochange ();
end_temporary_allocation ();
t = build_decl (FUNCTION_DECL,
ffecom_get_external_identifier_ (s),
ffecom_tree_blockdata_type);
DECL_EXTERNAL (t) = 1;
TREE_PUBLIC (t) = 1;
t = start_decl (t, FALSE);
finish_decl (t, NULL_TREE, FALSE);
resume_temporary_allocation ();
pop_obstacks ();
break;
case FFEINFO_whereCOMMON:
case FFEINFO_whereDUMMY:
case FFEINFO_whereRESULT:
case FFEINFO_whereFLEETING:
case FFEINFO_whereFLEETING_CADDR:
case FFEINFO_whereFLEETING_IADDR:
case FFEINFO_whereIMMEDIATE:
case FFEINFO_whereINTRINSIC:
case FFEINFO_whereCONSTANT:
case FFEINFO_whereCONSTANT_SUBOBJECT:
default:
assert ("BLOCKDATA where unheard of" == NULL);
/* Fall through. */
case FFEINFO_whereANY:
t = error_mark_node;
break;
}
break;
case FFEINFO_kindCOMMON:
switch (ffeinfo_where (ffesymbol_info (s)))
{
case FFEINFO_whereLOCAL:
assert (!ffecom_transform_only_dummies_);
ffecom_transform_common_ (s);
break;
case FFEINFO_whereNONE:
case FFEINFO_whereCOMMON:
case FFEINFO_whereDUMMY:
case FFEINFO_whereGLOBAL:
case FFEINFO_whereRESULT:
case FFEINFO_whereFLEETING:
case FFEINFO_whereFLEETING_CADDR:
case FFEINFO_whereFLEETING_IADDR:
case FFEINFO_whereIMMEDIATE:
case FFEINFO_whereINTRINSIC:
case FFEINFO_whereCONSTANT:
case FFEINFO_whereCONSTANT_SUBOBJECT:
default:
assert ("COMMON where unheard of" == NULL);
/* Fall through. */
case FFEINFO_whereANY:
t = error_mark_node;
break;
}
break;
case FFEINFO_kindCONSTRUCT:
switch (ffeinfo_where (ffesymbol_info (s)))
{
case FFEINFO_whereLOCAL:
assert (!ffecom_transform_only_dummies_);
break;
case FFEINFO_whereNONE:
case FFEINFO_whereCOMMON:
case FFEINFO_whereDUMMY:
case FFEINFO_whereGLOBAL:
case FFEINFO_whereRESULT:
case FFEINFO_whereFLEETING:
case FFEINFO_whereFLEETING_CADDR:
case FFEINFO_whereFLEETING_IADDR:
case FFEINFO_whereIMMEDIATE:
case FFEINFO_whereINTRINSIC:
case FFEINFO_whereCONSTANT:
case FFEINFO_whereCONSTANT_SUBOBJECT:
default:
assert ("CONSTRUCT where unheard of" == NULL);
/* Fall through. */
case FFEINFO_whereANY:
t = error_mark_node;
break;
}
break;
case FFEINFO_kindNAMELIST:
switch (ffeinfo_where (ffesymbol_info (s)))
{
case FFEINFO_whereLOCAL:
assert (!ffecom_transform_only_dummies_);
t = ffecom_transform_namelist_ (s);
break;
case FFEINFO_whereNONE:
case FFEINFO_whereCOMMON:
case FFEINFO_whereDUMMY:
case FFEINFO_whereGLOBAL:
case FFEINFO_whereRESULT:
case FFEINFO_whereFLEETING:
case FFEINFO_whereFLEETING_CADDR:
case FFEINFO_whereFLEETING_IADDR:
case FFEINFO_whereIMMEDIATE:
case FFEINFO_whereINTRINSIC:
case FFEINFO_whereCONSTANT:
case FFEINFO_whereCONSTANT_SUBOBJECT:
default:
assert ("NAMELIST where unheard of" == NULL);
/* Fall through. */
case FFEINFO_whereANY:
t = error_mark_node;
break;
}
break;
default:
assert ("kind unheard of" == NULL);
/* Fall through. */
case FFEINFO_kindANY:
t = error_mark_node;
break;
}
ffesymbol_hook (s).decl_tree = t;
ffesymbol_hook (s).length_tree = tlen;
ffesymbol_hook (s).addr = addr;
lineno = old_lineno;
input_filename = old_input_filename;
return s;
}
#endif
/* Transform into ASSIGNable symbol.
Symbol has already been transformed, but for whatever reason, the
resulting decl_tree has been deemed not usable for an ASSIGN target.
(E.g. it isn't wide enough to hold a pointer.) So, here we invent
another local symbol of type void * and stuff that in the assign_tree
argument. The F77/F90 standards allow this implementation. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static ffesymbol
ffecom_sym_transform_assign_ (ffesymbol s)
{
tree t; /* Transformed thingy. */
int yes;
int old_lineno = lineno;
char *old_input_filename = input_filename;
if (ffesymbol_sfdummyparent (s) == NULL)
{
input_filename = ffesymbol_where_filename (s);
lineno = ffesymbol_where_filelinenum (s);
}
else
{
ffesymbol sf = ffesymbol_sfdummyparent (s);
input_filename = ffesymbol_where_filename (sf);
lineno = ffesymbol_where_filelinenum (sf);
}
assert (!ffecom_transform_only_dummies_);
yes = suspend_momentary ();
t = build_decl (VAR_DECL,
ffecom_get_invented_identifier ("__g77_ASSIGN_%s",
ffesymbol_text (s),
0),
TREE_TYPE (null_pointer_node));
switch (ffesymbol_where (s))
{
case FFEINFO_whereLOCAL:
/* Unlike for regular vars, SAVE status is easy to determine for
ASSIGNed vars, since there's no initialization, there's no
effective storage association (so "SAVE J" does not apply to
K even given "EQUIVALENCE (J,K)"), there's no size issue
to worry about, etc. */
if ((ffesymbol_is_save (s) || ffe_is_saveall ())
&& (ffecom_primary_entry_kind_ != FFEINFO_kindPROGRAM)
&& (ffecom_primary_entry_kind_ != FFEINFO_kindBLOCKDATA))
TREE_STATIC (t) = 1; /* SAVEd in proc, make static. */
else
TREE_STATIC (t) = 0; /* No need to make static. */
break;
case FFEINFO_whereCOMMON:
TREE_STATIC (t) = 1; /* Assume COMMONs always SAVEd. */
break;
case FFEINFO_whereDUMMY:
/* Note that twinning a DUMMY means the caller won't see
the ASSIGNed value. But both F77 and F90 allow implementations
to do this, i.e. disallow Fortran code that would try and
take advantage of actually putting a label into a variable
via a dummy argument (or any other storage association, for
that matter). */
TREE_STATIC (t) = 0;
break;
default:
TREE_STATIC (t) = 0;
break;
}
t = start_decl (t, FALSE);
finish_decl (t, NULL_TREE, FALSE);
resume_momentary (yes);
ffesymbol_hook (s).assign_tree = t;
lineno = old_lineno;
input_filename = old_input_filename;
return s;
}
#endif
/* Implement COMMON area in back end.
Because COMMON-based variables can be referenced in the dimension
expressions of dummy (adjustable) arrays, and because dummies
(in the gcc back end) need to be put in the outer binding level
of a function (which has two binding levels, the outer holding
the dummies and the inner holding the other vars), special care
must be taken to handle COMMON areas.
The current strategy is basically to always tell the back end about
the COMMON area as a top-level external reference to just a block
of storage of the master type of that area (e.g. integer, real,
character, whatever -- not a structure). As a distinct action,
if initial values are provided, tell the back end about the area
as a top-level non-external (initialized) area and remember not to
allow further initialization or expansion of the area. Meanwhile,
if no initialization happens at all, tell the back end about
the largest size we've seen declared so the space does get reserved.
(This function doesn't handle all that stuff, but it does some
of the important things.)
Meanwhile, for COMMON variables themselves, just keep creating
references like *((float *) (&common_area + offset)) each time
we reference the variable. In other words, don't make a VAR_DECL
or any kind of component reference (like we used to do before 0.4),
though we might do that as well just for debugging purposes (and
stuff the rtl with the appropriate offset expression). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_transform_common_ (ffesymbol s)
{
ffestorag st = ffesymbol_storage (s);
ffeglobal g = ffesymbol_global (s);
tree cbt;
tree cbtype;
tree init;
tree high;
bool is_init = ffestorag_is_init (st);
assert (st != NULL);
if ((g == NULL)
|| (ffeglobal_type (g) != FFEGLOBAL_typeCOMMON))
return;
/* First update the size of the area in global terms. */
ffeglobal_size_common (s, ffestorag_size (st));
if (!ffeglobal_common_init (g))
is_init = FALSE; /* No explicit init, don't let erroneous joins init. */
cbt = ffeglobal_hook (g);
/* If we already have declared this common block for a previous program
unit, and either we already initialized it or we don't have new
initialization for it, just return what we have without changing it. */
if ((cbt != NULL_TREE)
&& (!is_init
|| !DECL_EXTERNAL (cbt)))
return;
/* Process inits. */
if (is_init)
{
if (ffestorag_init (st) != NULL)
{
ffebld sexp;
/* Set the padding for the expression, so ffecom_expr
knows to insert that many zeros. */
switch (ffebld_op (sexp = ffestorag_init (st)))
{
case FFEBLD_opCONTER:
ffebld_conter_set_pad (sexp, ffestorag_modulo (st));
break;
case FFEBLD_opARRTER:
ffebld_arrter_set_pad (sexp, ffestorag_modulo (st));
break;
case FFEBLD_opACCTER:
ffebld_accter_set_pad (sexp, ffestorag_modulo (st));
break;
default:
assert ("bad op for cmn init (pad)" == NULL);
break;
}
init = ffecom_expr (sexp);
if (init == error_mark_node)
{ /* Hopefully the back end complained! */
init = NULL_TREE;
if (cbt != NULL_TREE)
return;
}
}
else
init = error_mark_node;
}
else
init = NULL_TREE;
push_obstacks_nochange ();
end_temporary_allocation ();
/* cbtype must be permanently allocated! */
/* Allocate the MAX of the areas so far, seen filewide. */
high = build_int_2 ((ffeglobal_common_size (g)
+ ffeglobal_common_pad (g)) - 1, 0);
TREE_TYPE (high) = ffecom_integer_type_node;
if (init)
cbtype = build_array_type (char_type_node,
build_range_type (integer_type_node,
integer_zero_node,
high));
else
cbtype = build_array_type (char_type_node, NULL_TREE);
if (cbt == NULL_TREE)
{
cbt
= build_decl (VAR_DECL,
ffecom_get_external_identifier_ (s),
cbtype);
TREE_STATIC (cbt) = 1;
TREE_PUBLIC (cbt) = 1;
}
else
{
assert (is_init);
TREE_TYPE (cbt) = cbtype;
}
DECL_EXTERNAL (cbt) = init ? 0 : 1;
DECL_INITIAL (cbt) = init ? error_mark_node : NULL_TREE;
cbt = start_decl (cbt, TRUE);
if (ffeglobal_hook (g) != NULL)
assert (cbt == ffeglobal_hook (g));
assert (!init || !DECL_EXTERNAL (cbt));
/* Make sure that any type can live in COMMON and be referenced
without getting a bus error. We could pick the most restrictive
alignment of all entities actually placed in the COMMON, but
this seems easy enough. */
DECL_ALIGN (cbt) = BIGGEST_ALIGNMENT;
if (is_init && (ffestorag_init (st) == NULL))
init = ffecom_init_zero_ (cbt);
finish_decl (cbt, init, TRUE);
if (is_init)
ffestorag_set_init (st, ffebld_new_any ());
if (init)
{
tree size_tree;
assert (DECL_SIZE (cbt) != NULL_TREE);
assert (TREE_CODE (DECL_SIZE (cbt)) == INTEGER_CST);
size_tree = size_binop (CEIL_DIV_EXPR,
DECL_SIZE (cbt),
size_int (BITS_PER_UNIT));
assert (TREE_INT_CST_HIGH (size_tree) == 0);
assert (TREE_INT_CST_LOW (size_tree)
== ffeglobal_common_size (g) + ffeglobal_common_pad (g));
}
ffeglobal_set_hook (g, cbt);
ffestorag_set_hook (st, cbt);
resume_temporary_allocation ();
pop_obstacks ();
}
#endif
/* Make master area for local EQUIVALENCE. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_transform_equiv_ (ffestorag eqst)
{
tree eqt;
tree eqtype;
tree init;
tree high;
bool is_init = ffestorag_is_init (eqst);
int yes;
assert (eqst != NULL);
eqt = ffestorag_hook (eqst);
if (eqt != NULL_TREE)
return;
/* Process inits. */
if (is_init)
{
if (ffestorag_init (eqst) != NULL)
{
ffebld sexp;
/* Set the padding for the expression, so ffecom_expr
knows to insert that many zeros. */
switch (ffebld_op (sexp = ffestorag_init (eqst)))
{
case FFEBLD_opCONTER:
ffebld_conter_set_pad (sexp, ffestorag_modulo (eqst));
break;
case FFEBLD_opARRTER:
ffebld_arrter_set_pad (sexp, ffestorag_modulo (eqst));
break;
case FFEBLD_opACCTER:
ffebld_accter_set_pad (sexp, ffestorag_modulo (eqst));
break;
default:
assert ("bad op for eqv init (pad)" == NULL);
break;
}
init = ffecom_expr (sexp);
if (init == error_mark_node)
init = NULL_TREE; /* Hopefully the back end complained! */
}
else
init = error_mark_node;
}
else if (ffe_is_init_local_zero ())
init = error_mark_node;
else
init = NULL_TREE;
ffecom_member_namelisted_ = FALSE;
ffestorag_drive (ffestorag_list_equivs (eqst),
&ffecom_member_phase1_,
eqst);
yes = suspend_momentary ();
high = build_int_2 ((ffestorag_size (eqst)
+ ffestorag_modulo (eqst)) - 1, 0);
TREE_TYPE (high) = ffecom_integer_type_node;
eqtype = build_array_type (char_type_node,
build_range_type (ffecom_integer_type_node,
ffecom_integer_zero_node,
high));
eqt = build_decl (VAR_DECL,
ffecom_get_invented_identifier ("__g77_equiv_%s",
ffesymbol_text
(ffestorag_symbol
(eqst)),
0),
eqtype);
DECL_EXTERNAL (eqt) = 0;
if (is_init
|| ffecom_member_namelisted_
#ifdef FFECOM_sizeMAXSTACKITEM
|| (ffestorag_size (eqst) > FFECOM_sizeMAXSTACKITEM)
#endif
|| ((ffecom_primary_entry_kind_ != FFEINFO_kindPROGRAM)
&& (ffecom_primary_entry_kind_ != FFEINFO_kindBLOCKDATA)
&& (ffestorag_is_save (eqst) || ffe_is_saveall ())))
TREE_STATIC (eqt) = 1;
else
TREE_STATIC (eqt) = 0;
TREE_PUBLIC (eqt) = 0;
DECL_CONTEXT (eqt) = current_function_decl;
if (init)
DECL_INITIAL (eqt) = error_mark_node;
else
DECL_INITIAL (eqt) = NULL_TREE;
eqt = start_decl (eqt, FALSE);
/* Make sure this shows up as a debug symbol, which is not normally
the case for invented identifiers. */
DECL_IGNORED_P (eqt) = 0;
/* Make sure that any type can live in EQUIVALENCE and be referenced
without getting a bus error. We could pick the most restrictive
alignment of all entities actually placed in the EQUIVALENCE, but
this seems easy enough. */
DECL_ALIGN (eqt) = BIGGEST_ALIGNMENT;
if ((!is_init && ffe_is_init_local_zero ())
|| (is_init && (ffestorag_init (eqst) == NULL)))
init = ffecom_init_zero_ (eqt);
finish_decl (eqt, init, FALSE);
if (is_init)
ffestorag_set_init (eqst, ffebld_new_any ());
{
tree size_tree;
size_tree = size_binop (CEIL_DIV_EXPR,
DECL_SIZE (eqt),
size_int (BITS_PER_UNIT));
assert (TREE_INT_CST_HIGH (size_tree) == 0);
assert (TREE_INT_CST_LOW (size_tree)
== ffestorag_size (eqst) + ffestorag_modulo (eqst));
}
ffestorag_set_hook (eqst, eqt);
#ifdef SOMEONE_GETS_DEBUG_SUPPORT_WORKING
ffestorag_drive (ffestorag_list_equivs (eqst),
&ffecom_member_phase2_,
eqst);
#endif
resume_momentary (yes);
}
#endif
/* Implement NAMELIST in back end. See f2c/format.c for more info. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_transform_namelist_ (ffesymbol s)
{
tree nmlt;
tree nmltype = ffecom_type_namelist_ ();
tree nmlinits;
tree nameinit;
tree varsinit;
tree nvarsinit;
tree field;
tree high;
int yes;
int i;
static int mynumber = 0;
yes = suspend_momentary ();
nmlt = build_decl (VAR_DECL,
ffecom_get_invented_identifier ("__g77_namelist_%d",
NULL, mynumber++),
nmltype);
TREE_STATIC (nmlt) = 1;
DECL_INITIAL (nmlt) = error_mark_node;
nmlt = start_decl (nmlt, FALSE);
/* Process inits. */
i = strlen (ffesymbol_text (s));
high = build_int_2 (i, 0);
TREE_TYPE (high) = ffecom_f2c_ftnlen_type_node;
nameinit = ffecom_build_f2c_string_ (i + 1,
ffesymbol_text (s));
TREE_TYPE (nameinit)
= build_type_variant
(build_array_type
(char_type_node,
build_range_type (ffecom_f2c_ftnlen_type_node,
ffecom_f2c_ftnlen_one_node,
high)),
1, 0);
TREE_CONSTANT (nameinit) = 1;
TREE_STATIC (nameinit) = 1;
nameinit = ffecom_1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (nameinit)),
nameinit);
varsinit = ffecom_vardesc_array_ (s);
varsinit = ffecom_1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (varsinit)),
varsinit);
TREE_CONSTANT (varsinit) = 1;
TREE_STATIC (varsinit) = 1;
{
ffebld b;
for (i = 0, b = ffesymbol_namelist (s); b != NULL; b = ffebld_trail (b))
++i;
}
nvarsinit = build_int_2 (i, 0);
TREE_TYPE (nvarsinit) = integer_type_node;
TREE_CONSTANT (nvarsinit) = 1;
TREE_STATIC (nvarsinit) = 1;
nmlinits = build_tree_list ((field = TYPE_FIELDS (nmltype)), nameinit);
TREE_CHAIN (nmlinits) = build_tree_list ((field = TREE_CHAIN (field)),
varsinit);
TREE_CHAIN (TREE_CHAIN (nmlinits))
= build_tree_list ((field = TREE_CHAIN (field)), nvarsinit);
nmlinits = build (CONSTRUCTOR, nmltype, NULL_TREE, nmlinits);
TREE_CONSTANT (nmlinits) = 1;
TREE_STATIC (nmlinits) = 1;
finish_decl (nmlt, nmlinits, FALSE);
nmlt = ffecom_1 (ADDR_EXPR, build_pointer_type (nmltype), nmlt);
resume_momentary (yes);
return nmlt;
}
#endif
/* A subroutine of ffecom_tree_canonize_ref_. The incoming tree is
analyzed on the assumption it is calculating a pointer to be
indirected through. It must return the proper decl and offset,
taking into account different units of measurements for offsets. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_tree_canonize_ptr_ (tree *decl, tree *offset,
tree t)
{
switch (TREE_CODE (t))
{
case NOP_EXPR:
case CONVERT_EXPR:
case NON_LVALUE_EXPR:
ffecom_tree_canonize_ptr_ (decl, offset, TREE_OPERAND (t, 0));
break;
case PLUS_EXPR:
ffecom_tree_canonize_ptr_ (decl, offset, TREE_OPERAND (t, 0));
if ((*decl == NULL_TREE)
|| (*decl == error_mark_node))
break;
if (TREE_CODE (TREE_OPERAND (t, 1)) == INTEGER_CST)
{
/* An offset into COMMON. */
*offset = size_binop (PLUS_EXPR,
*offset,
TREE_OPERAND (t, 1));
/* Convert offset (presumably in bytes) into canonical units
(presumably bits). */
*offset = size_binop (MULT_EXPR,
TYPE_SIZE (TREE_TYPE (TREE_TYPE (t))),
*offset);
break;
}
/* Not a COMMON reference, so an unrecognized pattern. */
*decl = error_mark_node;
break;
case PARM_DECL:
*decl = t;
*offset = bitsize_int (0L, 0L);
break;
case ADDR_EXPR:
if (TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL)
{
/* A reference to COMMON. */
*decl = TREE_OPERAND (t, 0);
*offset = bitsize_int (0L, 0L);
break;
}
/* Fall through. */
default:
/* Not a COMMON reference, so an unrecognized pattern. */
*decl = error_mark_node;
break;
}
}
#endif
/* Given a tree that is possibly intended for use as an lvalue, return
information representing a canonical view of that tree as a decl, an
offset into that decl, and a size for the lvalue.
If there's no applicable decl, NULL_TREE is returned for the decl,
and the other fields are left undefined.
If the tree doesn't fit the recognizable forms, an ERROR_MARK node
is returned for the decl, and the other fields are left undefined.
Otherwise, the decl returned currently is either a VAR_DECL or a
PARM_DECL.
The offset returned is always valid, but of course not necessarily
a constant, and not necessarily converted into the appropriate
type, leaving that up to the caller (so as to avoid that overhead
if the decls being looked at are different anyway).
If the size cannot be determined (e.g. an adjustable array),
an ERROR_MARK node is returned for the size. Otherwise, the
size returned is valid, not necessarily a constant, and not
necessarily converted into the appropriate type as with the
offset.
Note that the offset and size expressions are expressed in the
base storage units (usually bits) rather than in the units of
the type of the decl, because two decls with different types
might overlap but with apparently non-overlapping array offsets,
whereas converting the array offsets to consistant offsets will
reveal the overlap. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
ffecom_tree_canonize_ref_ (tree *decl, tree *offset,
tree *size, tree t)
{
/* The default path is to report a nonexistant decl. */
*decl = NULL_TREE;
if (t == NULL_TREE)
return;
switch (TREE_CODE (t))
{
case ERROR_MARK:
case IDENTIFIER_NODE:
case INTEGER_CST:
case REAL_CST:
case COMPLEX_CST:
case STRING_CST:
case CONST_DECL:
case PLUS_EXPR:
case MINUS_EXPR:
case MULT_EXPR:
case TRUNC_DIV_EXPR:
case CEIL_DIV_EXPR:
case FLOOR_DIV_EXPR:
case ROUND_DIV_EXPR:
case TRUNC_MOD_EXPR:
case CEIL_MOD_EXPR:
case FLOOR_MOD_EXPR:
case ROUND_MOD_EXPR:
case RDIV_EXPR:
case EXACT_DIV_EXPR:
case FIX_TRUNC_EXPR:
case FIX_CEIL_EXPR:
case FIX_FLOOR_EXPR:
case FIX_ROUND_EXPR:
case FLOAT_EXPR:
case EXPON_EXPR:
case NEGATE_EXPR:
case MIN_EXPR:
case MAX_EXPR:
case ABS_EXPR:
case FFS_EXPR:
case LSHIFT_EXPR:
case RSHIFT_EXPR:
case LROTATE_EXPR:
case RROTATE_EXPR:
case BIT_IOR_EXPR:
case BIT_XOR_EXPR:
case BIT_AND_EXPR:
case BIT_ANDTC_EXPR:
case BIT_NOT_EXPR:
case TRUTH_ANDIF_EXPR:
case TRUTH_ORIF_EXPR:
case TRUTH_AND_EXPR:
case TRUTH_OR_EXPR:
case TRUTH_XOR_EXPR:
case TRUTH_NOT_EXPR:
case LT_EXPR:
case LE_EXPR:
case GT_EXPR:
case GE_EXPR:
case EQ_EXPR:
case NE_EXPR:
case COMPLEX_EXPR:
case CONJ_EXPR:
case REALPART_EXPR:
case IMAGPART_EXPR:
case LABEL_EXPR:
case COMPONENT_REF:
case COMPOUND_EXPR:
case ADDR_EXPR:
return;
case VAR_DECL:
case PARM_DECL:
*decl = t;
*offset = bitsize_int (0L, 0L);
*size = TYPE_SIZE (TREE_TYPE (t));
return;
case ARRAY_REF:
{
tree array = TREE_OPERAND (t, 0);
tree element = TREE_OPERAND (t, 1);
tree init_offset;
if ((array == NULL_TREE)
|| (element == NULL_TREE))
{
*decl = error_mark_node;
return;
}
ffecom_tree_canonize_ref_ (decl, &init_offset, size,
array);
if ((*decl == NULL_TREE)
|| (*decl == error_mark_node))
return;
*offset = size_binop (MULT_EXPR,
TYPE_SIZE (TREE_TYPE (TREE_TYPE (array))),
size_binop (MINUS_EXPR,
element,
TYPE_MIN_VALUE
(TYPE_DOMAIN
(TREE_TYPE (array)))));
*offset = size_binop (PLUS_EXPR,
init_offset,
*offset);
*size = TYPE_SIZE (TREE_TYPE (t));
return;
}
case INDIRECT_REF:
/* Most of this code is to handle references to COMMON. And so
far that is useful only for calling library functions, since
external (user) functions might reference common areas. But
even calling an external function, it's worthwhile to decode
COMMON references because if not storing into COMMON, we don't
want COMMON-based arguments to gratuitously force use of a
temporary. */
*size = TYPE_SIZE (TREE_TYPE (t));
ffecom_tree_canonize_ptr_ (decl, offset,
TREE_OPERAND (t, 0));
return;
case CONVERT_EXPR:
case NOP_EXPR:
case MODIFY_EXPR:
case NON_LVALUE_EXPR:
case RESULT_DECL:
case FIELD_DECL:
case COND_EXPR: /* More cases than we can handle. */
case SAVE_EXPR:
case REFERENCE_EXPR:
case PREDECREMENT_EXPR:
case PREINCREMENT_EXPR:
case POSTDECREMENT_EXPR:
case POSTINCREMENT_EXPR:
case CALL_EXPR:
default:
*decl = error_mark_node;
return;
}
}
#endif
/* Do divide operation appropriate to type of operands. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_tree_divide_ (tree tree_type, tree left, tree right,
tree dest_tree, ffebld dest, bool *dest_used)
{
if ((left == error_mark_node)
|| (right == error_mark_node))
return error_mark_node;
switch (TREE_CODE (tree_type))
{
case INTEGER_TYPE:
return ffecom_2 (TRUNC_DIV_EXPR, tree_type,
left,
right);
case COMPLEX_TYPE:
{
ffecomGfrt ix;
if (TREE_TYPE (tree_type)
== ffecom_tree_type [FFEINFO_basictypeREAL][FFEINFO_kindtypeREAL1])
ix = FFECOM_gfrtDIV_CC; /* Overlapping result okay. */
else
ix = FFECOM_gfrtDIV_ZZ; /* Overlapping result okay. */
left = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (left)),
left);
left = build_tree_list (NULL_TREE, left);
right = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (right)),
right);
right = build_tree_list (NULL_TREE, right);
TREE_CHAIN (left) = right;
return ffecom_call_ (ffecom_gfrt_tree_ (ix),
ffecom_gfrt_kindtype (ix),
ffe_is_f2c_library (),
tree_type,
left,
dest_tree, dest, dest_used,
NULL_TREE, TRUE);
}
break;
case RECORD_TYPE:
{
ffecomGfrt ix;
if (TREE_TYPE (TYPE_FIELDS (tree_type))
== ffecom_tree_type [FFEINFO_basictypeREAL][FFEINFO_kindtypeREAL1])
ix = FFECOM_gfrtDIV_CC; /* Overlapping result okay. */
else
ix = FFECOM_gfrtDIV_ZZ; /* Overlapping result okay. */
left = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (left)),
left);
left = build_tree_list (NULL_TREE, left);
right = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (right)),
right);
right = build_tree_list (NULL_TREE, right);
TREE_CHAIN (left) = right;
return ffecom_call_ (ffecom_gfrt_tree_ (ix),
ffecom_gfrt_kindtype (ix),
ffe_is_f2c_library (),
tree_type,
left,
dest_tree, dest, dest_used,
NULL_TREE, TRUE);
}
break;
default:
return ffecom_2 (RDIV_EXPR, tree_type,
left,
right);
}
}
#endif
/* ffecom_type_localvar_ -- Build type info for non-dummy variable
tree type;
ffesymbol s; // the variable's symbol
ffeinfoBasictype bt; // it's basictype
ffeinfoKindtype kt; // it's kindtype
type = ffecom_type_localvar_(s,bt,kt);
Handles static arrays, CHARACTER type, etc. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_type_localvar_ (ffesymbol s, ffeinfoBasictype bt,
ffeinfoKindtype kt)
{
tree type;
ffebld dl;
ffebld dim;
tree lowt;
tree hight;
type = ffecom_tree_type[bt][kt];
if (bt == FFEINFO_basictypeCHARACTER)
{
hight = build_int_2 (ffesymbol_size (s), 0);
TREE_TYPE (hight) = ffecom_f2c_ftnlen_type_node;
type
= build_array_type
(type,
build_range_type (ffecom_f2c_ftnlen_type_node,
ffecom_f2c_ftnlen_one_node,
hight));
type = ffecom_check_size_overflow_ (s, type, FALSE);
}
for (dl = ffesymbol_dims (s); dl != NULL; dl = ffebld_trail (dl))
{
if (type == error_mark_node)
break;
dim = ffebld_head (dl);
assert (ffebld_op (dim) == FFEBLD_opBOUNDS);
if (ffebld_left (dim) == NULL)
lowt = integer_one_node;
else
lowt = ffecom_expr (ffebld_left (dim));
if (TREE_CODE (lowt) != INTEGER_CST)
lowt = variable_size (lowt);
assert (ffebld_right (dim) != NULL);
hight = ffecom_expr (ffebld_right (dim));
if (TREE_CODE (hight) != INTEGER_CST)
hight = variable_size (hight);
type = build_array_type (type,
build_range_type (ffecom_integer_type_node,
lowt, hight));
type = ffecom_check_size_overflow_ (s, type, FALSE);
}
return type;
}
#endif
/* Build Namelist type. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_type_namelist_ ()
{
static tree type = NULL_TREE;
if (type == NULL_TREE)
{
static tree namefield, varsfield, nvarsfield;
tree vardesctype;
vardesctype = ffecom_type_vardesc_ ();
push_obstacks_nochange ();
end_temporary_allocation ();
type = make_node (RECORD_TYPE);
vardesctype = build_pointer_type (build_pointer_type (vardesctype));
namefield = ffecom_decl_field (type, NULL_TREE, "name",
string_type_node);
varsfield = ffecom_decl_field (type, namefield, "vars", vardesctype);
nvarsfield = ffecom_decl_field (type, varsfield, "nvars",
integer_type_node);
TYPE_FIELDS (type) = namefield;
layout_type (type);
resume_temporary_allocation ();
pop_obstacks ();
}
return type;
}
#endif
/* Make a copy of a type, assuming caller has switched to the permanent
obstacks and that the type is for an aggregate (array) initializer. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC && 0 /* Not used now. */
static tree
ffecom_type_permanent_copy_ (tree t)
{
tree domain;
tree max;
assert (TREE_TYPE (t) != NULL_TREE);
domain = TYPE_DOMAIN (t);
assert (TREE_CODE (t) == ARRAY_TYPE);
assert (TREE_PERMANENT (TREE_TYPE (t)));
assert (TREE_PERMANENT (TREE_TYPE (domain)));
assert (TREE_PERMANENT (TYPE_MIN_VALUE (domain)));
max = TYPE_MAX_VALUE (domain);
if (!TREE_PERMANENT (max))
{
assert (TREE_CODE (max) == INTEGER_CST);
max = build_int_2 (TREE_INT_CST_LOW (max), TREE_INT_CST_HIGH (max));
TREE_TYPE (max) = TREE_TYPE (TYPE_MIN_VALUE (domain));
}
return build_array_type (TREE_TYPE (t),
build_range_type (TREE_TYPE (domain),
TYPE_MIN_VALUE (domain),
max));
}
#endif
/* Build Vardesc type. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_type_vardesc_ ()
{
static tree type = NULL_TREE;
static tree namefield, addrfield, dimsfield, typefield;
if (type == NULL_TREE)
{
push_obstacks_nochange ();
end_temporary_allocation ();
type = make_node (RECORD_TYPE);
namefield = ffecom_decl_field (type, NULL_TREE, "name",
string_type_node);
addrfield = ffecom_decl_field (type, namefield, "addr",
string_type_node);
dimsfield = ffecom_decl_field (type, addrfield, "dims",
ffecom_f2c_ptr_to_ftnlen_type_node);
typefield = ffecom_decl_field (type, dimsfield, "type",
integer_type_node);
TYPE_FIELDS (type) = namefield;
layout_type (type);
resume_temporary_allocation ();
pop_obstacks ();
}
return type;
}
#endif
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_vardesc_ (ffebld expr)
{
ffesymbol s;
assert (ffebld_op (expr) == FFEBLD_opSYMTER);
s = ffebld_symter (expr);
if (ffesymbol_hook (s).vardesc_tree == NULL_TREE)
{
int i;
tree vardesctype = ffecom_type_vardesc_ ();
tree var;
tree nameinit;
tree dimsinit;
tree addrinit;
tree typeinit;
tree field;
tree varinits;
int yes;
static int mynumber = 0;
yes = suspend_momentary ();
var = build_decl (VAR_DECL,
ffecom_get_invented_identifier ("__g77_vardesc_%d",
NULL, mynumber++),
vardesctype);
TREE_STATIC (var) = 1;
DECL_INITIAL (var) = error_mark_node;
var = start_decl (var, FALSE);
/* Process inits. */
nameinit = ffecom_build_f2c_string_ ((i = strlen (ffesymbol_text (s)))
+ 1,
ffesymbol_text (s));
TREE_TYPE (nameinit)
= build_type_variant
(build_array_type
(char_type_node,
build_range_type (integer_type_node,
integer_one_node,
build_int_2 (i, 0))),
1, 0);
TREE_CONSTANT (nameinit) = 1;
TREE_STATIC (nameinit) = 1;
nameinit = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (nameinit)),
nameinit);
addrinit = ffecom_arg_ptr_to_expr (expr, &typeinit);
dimsinit = ffecom_vardesc_dims_ (s);
if (typeinit == NULL_TREE)
{
ffeinfoBasictype bt = ffesymbol_basictype (s);
ffeinfoKindtype kt = ffesymbol_kindtype (s);
int tc = ffecom_f2c_typecode (bt, kt);
assert (tc != -1);
typeinit = build_int_2 (tc, (tc < 0) ? -1 : 0);
}
else
typeinit = ffecom_1 (NEGATE_EXPR, TREE_TYPE (typeinit), typeinit);
varinits = build_tree_list ((field = TYPE_FIELDS (vardesctype)),
nameinit);
TREE_CHAIN (varinits) = build_tree_list ((field = TREE_CHAIN (field)),
addrinit);
TREE_CHAIN (TREE_CHAIN (varinits))
= build_tree_list ((field = TREE_CHAIN (field)), dimsinit);
TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (varinits)))
= build_tree_list ((field = TREE_CHAIN (field)), typeinit);
varinits = build (CONSTRUCTOR, vardesctype, NULL_TREE, varinits);
TREE_CONSTANT (varinits) = 1;
TREE_STATIC (varinits) = 1;
finish_decl (var, varinits, FALSE);
var = ffecom_1 (ADDR_EXPR, build_pointer_type (vardesctype), var);
resume_momentary (yes);
ffesymbol_hook (s).vardesc_tree = var;
}
return ffesymbol_hook (s).vardesc_tree;
}
#endif
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_vardesc_array_ (ffesymbol s)
{
ffebld b;
tree list;
tree item = NULL_TREE;
tree var;
int i;
int yes;
static int mynumber = 0;
for (i = 0, list = NULL_TREE, b = ffesymbol_namelist (s);
b != NULL;
b = ffebld_trail (b), ++i)
{
tree t;
t = ffecom_vardesc_ (ffebld_head (b));
if (list == NULL_TREE)
list = item = build_tree_list (NULL_TREE, t);
else
{
TREE_CHAIN (item) = build_tree_list (NULL_TREE, t);
item = TREE_CHAIN (item);
}
}
yes = suspend_momentary ();
item = build_array_type (build_pointer_type (ffecom_type_vardesc_ ()),
build_range_type (integer_type_node,
integer_one_node,
build_int_2 (i, 0)));
list = build (CONSTRUCTOR, item, NULL_TREE, list);
TREE_CONSTANT (list) = 1;
TREE_STATIC (list) = 1;
var = ffecom_get_invented_identifier ("__g77_vardesc_array_%d", NULL,
mynumber++);
var = build_decl (VAR_DECL, var, item);
TREE_STATIC (var) = 1;
DECL_INITIAL (var) = error_mark_node;
var = start_decl (var, FALSE);
finish_decl (var, list, FALSE);
resume_momentary (yes);
return var;
}
#endif
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static tree
ffecom_vardesc_dims_ (ffesymbol s)
{
if (ffesymbol_dims (s) == NULL)
return convert (ffecom_f2c_ptr_to_ftnlen_type_node,
integer_zero_node);
{
ffebld b;
ffebld e;
tree list;
tree backlist;
tree item = NULL_TREE;
tree var;
int yes;
tree numdim;
tree numelem;
tree baseoff = NULL_TREE;
static int mynumber = 0;
numdim = build_int_2 ((int) ffesymbol_rank (s), 0);
TREE_TYPE (numdim) = ffecom_f2c_ftnlen_type_node;
numelem = ffecom_expr (ffesymbol_arraysize (s));
TREE_TYPE (numelem) = ffecom_f2c_ftnlen_type_node;
list = NULL_TREE;
backlist = NULL_TREE;
for (b = ffesymbol_dims (s), e = ffesymbol_extents (s);
b != NULL;
b = ffebld_trail (b), e = ffebld_trail (e))
{
tree t;
tree low;
tree back;
if (ffebld_trail (b) == NULL)
t = NULL_TREE;
else
{
t = convert (ffecom_f2c_ftnlen_type_node,
ffecom_expr (ffebld_head (e)));
if (list == NULL_TREE)
list = item = build_tree_list (NULL_TREE, t);
else
{
TREE_CHAIN (item) = build_tree_list (NULL_TREE, t);
item = TREE_CHAIN (item);
}
}
if (ffebld_left (ffebld_head (b)) == NULL)
low = ffecom_integer_one_node;
else
low = ffecom_expr (ffebld_left (ffebld_head (b)));
low = convert (ffecom_f2c_ftnlen_type_node, low);
back = build_tree_list (low, t);
TREE_CHAIN (back) = backlist;
backlist = back;
}
for (item = backlist; item != NULL_TREE; item = TREE_CHAIN (item))
{
if (TREE_VALUE (item) == NULL_TREE)
baseoff = TREE_PURPOSE (item);
else
baseoff = ffecom_2 (PLUS_EXPR, ffecom_f2c_ftnlen_type_node,
TREE_PURPOSE (item),
ffecom_2 (MULT_EXPR,
ffecom_f2c_ftnlen_type_node,
TREE_VALUE (item),
baseoff));
}
/* backlist now dead, along with all TREE_PURPOSEs on it. */
baseoff = build_tree_list (NULL_TREE, baseoff);
TREE_CHAIN (baseoff) = list;
numelem = build_tree_list (NULL_TREE, numelem);
TREE_CHAIN (numelem) = baseoff;
numdim = build_tree_list (NULL_TREE, numdim);
TREE_CHAIN (numdim) = numelem;
yes = suspend_momentary ();
item = build_array_type (ffecom_f2c_ftnlen_type_node,
build_range_type (integer_type_node,
integer_zero_node,
build_int_2
((int) ffesymbol_rank (s)
+ 2, 0)));
list = build (CONSTRUCTOR, item, NULL_TREE, numdim);
TREE_CONSTANT (list) = 1;
TREE_STATIC (list) = 1;
var = ffecom_get_invented_identifier ("__g77_dims_%d", NULL,
mynumber++);
var = build_decl (VAR_DECL, var, item);
TREE_STATIC (var) = 1;
DECL_INITIAL (var) = error_mark_node;
var = start_decl (var, FALSE);
finish_decl (var, list, FALSE);
var = ffecom_1 (ADDR_EXPR, build_pointer_type (item), var);
resume_momentary (yes);
return var;
}
}
#endif
/* Essentially does a "fold (build1 (code, type, node))" while checking
for certain housekeeping things.
NOTE: for building an ADDR_EXPR around a FUNCTION_DECL, use
ffecom_1_fn instead. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_1 (enum tree_code code, tree type, tree node)
{
tree item;
if ((node == error_mark_node)
|| (type == error_mark_node))
return error_mark_node;
if (code == ADDR_EXPR)
{
if (!mark_addressable (node))
assert ("can't mark_addressable this node!" == NULL);
}
switch (ffe_is_emulate_complex () ? code : NOP_EXPR)
{
tree realtype;
case REALPART_EXPR:
item = build (COMPONENT_REF, type, node, TYPE_FIELDS (TREE_TYPE (node)));
break;
case IMAGPART_EXPR:
item = build (COMPONENT_REF, type, node, TREE_CHAIN (TYPE_FIELDS (TREE_TYPE (node))));
break;
case NEGATE_EXPR:
if (TREE_CODE (type) != RECORD_TYPE)
{
item = build1 (code, type, node);
break;
}
node = ffecom_stabilize_aggregate_ (node);
realtype = TREE_TYPE (TYPE_FIELDS (type));
item =
ffecom_2 (COMPLEX_EXPR, type,
ffecom_1 (NEGATE_EXPR, realtype,
ffecom_1 (REALPART_EXPR, realtype,
node)),
ffecom_1 (NEGATE_EXPR, realtype,
ffecom_1 (IMAGPART_EXPR, realtype,
node)));
break;
default:
item = build1 (code, type, node);
break;
}
if (TREE_SIDE_EFFECTS (node))
TREE_SIDE_EFFECTS (item) = 1;
if ((code == ADDR_EXPR) && staticp (node))
TREE_CONSTANT (item) = 1;
return fold (item);
}
#endif
/* Like ffecom_1 (ADDR_EXPR, TREE_TYPE (node), node), except
handles TREE_CODE (node) == FUNCTION_DECL. In particular,
does not set TREE_ADDRESSABLE (because calling an inline
function does not mean the function needs to be separately
compiled). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_1_fn (tree node)
{
tree item;
tree type;
if (node == error_mark_node)
return error_mark_node;
type = build_type_variant (TREE_TYPE (node),
TREE_READONLY (node),
TREE_THIS_VOLATILE (node));
item = build1 (ADDR_EXPR,
build_pointer_type (type), node);
if (TREE_SIDE_EFFECTS (node))
TREE_SIDE_EFFECTS (item) = 1;
if (staticp (node))
TREE_CONSTANT (item) = 1;
return fold (item);
}
#endif
/* Essentially does a "fold (build (code, type, node1, node2))" while
checking for certain housekeeping things. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_2 (enum tree_code code, tree type, tree node1,
tree node2)
{
tree item;
if ((node1 == error_mark_node)
|| (node2 == error_mark_node)
|| (type == error_mark_node))
return error_mark_node;
switch (ffe_is_emulate_complex () ? code : NOP_EXPR)
{
tree a, b, c, d, realtype;
case CONJ_EXPR:
assert ("no CONJ_EXPR support yet" == NULL);
return error_mark_node;
case COMPLEX_EXPR:
item = build_tree_list (TYPE_FIELDS (type), node1);
TREE_CHAIN (item) = build_tree_list (TREE_CHAIN (TYPE_FIELDS (type)), node2);
item = build (CONSTRUCTOR, type, NULL_TREE, item);
break;
case PLUS_EXPR:
if (TREE_CODE (type) != RECORD_TYPE)
{
item = build (code, type, node1, node2);
break;
}
node1 = ffecom_stabilize_aggregate_ (node1);
node2 = ffecom_stabilize_aggregate_ (node2);
realtype = TREE_TYPE (TYPE_FIELDS (type));
item =
ffecom_2 (COMPLEX_EXPR, type,
ffecom_2 (PLUS_EXPR, realtype,
ffecom_1 (REALPART_EXPR, realtype,
node1),
ffecom_1 (REALPART_EXPR, realtype,
node2)),
ffecom_2 (PLUS_EXPR, realtype,
ffecom_1 (IMAGPART_EXPR, realtype,
node1),
ffecom_1 (IMAGPART_EXPR, realtype,
node2)));
break;
case MINUS_EXPR:
if (TREE_CODE (type) != RECORD_TYPE)
{
item = build (code, type, node1, node2);
break;
}
node1 = ffecom_stabilize_aggregate_ (node1);
node2 = ffecom_stabilize_aggregate_ (node2);
realtype = TREE_TYPE (TYPE_FIELDS (type));
item =
ffecom_2 (COMPLEX_EXPR, type,
ffecom_2 (MINUS_EXPR, realtype,
ffecom_1 (REALPART_EXPR, realtype,
node1),
ffecom_1 (REALPART_EXPR, realtype,
node2)),
ffecom_2 (MINUS_EXPR, realtype,
ffecom_1 (IMAGPART_EXPR, realtype,
node1),
ffecom_1 (IMAGPART_EXPR, realtype,
node2)));
break;
case MULT_EXPR:
if (TREE_CODE (type) != RECORD_TYPE)
{
item = build (code, type, node1, node2);
break;
}
node1 = ffecom_stabilize_aggregate_ (node1);
node2 = ffecom_stabilize_aggregate_ (node2);
realtype = TREE_TYPE (TYPE_FIELDS (type));
a = save_expr (ffecom_1 (REALPART_EXPR, realtype,
node1));
b = save_expr (ffecom_1 (IMAGPART_EXPR, realtype,
node1));
c = save_expr (ffecom_1 (REALPART_EXPR, realtype,
node2));
d = save_expr (ffecom_1 (IMAGPART_EXPR, realtype,
node2));
item =
ffecom_2 (COMPLEX_EXPR, type,
ffecom_2 (MINUS_EXPR, realtype,
ffecom_2 (MULT_EXPR, realtype,
a,
c),
ffecom_2 (MULT_EXPR, realtype,
b,
d)),
ffecom_2 (PLUS_EXPR, realtype,
ffecom_2 (MULT_EXPR, realtype,
a,
d),
ffecom_2 (MULT_EXPR, realtype,
c,
b)));
break;
case EQ_EXPR:
if ((TREE_CODE (node1) != RECORD_TYPE)
&& (TREE_CODE (node2) != RECORD_TYPE))
{
item = build (code, type, node1, node2);
break;
}
assert (TREE_CODE (node1) == RECORD_TYPE);
assert (TREE_CODE (node2) == RECORD_TYPE);
node1 = ffecom_stabilize_aggregate_ (node1);
node2 = ffecom_stabilize_aggregate_ (node2);
realtype = TREE_TYPE (TYPE_FIELDS (type));
item =
ffecom_2 (TRUTH_ANDIF_EXPR, type,
ffecom_2 (code, type,
ffecom_1 (REALPART_EXPR, realtype,
node1),
ffecom_1 (REALPART_EXPR, realtype,
node2)),
ffecom_2 (code, type,
ffecom_1 (IMAGPART_EXPR, realtype,
node1),
ffecom_1 (IMAGPART_EXPR, realtype,
node2)));
break;
case NE_EXPR:
if ((TREE_CODE (node1) != RECORD_TYPE)
&& (TREE_CODE (node2) != RECORD_TYPE))
{
item = build (code, type, node1, node2);
break;
}
assert (TREE_CODE (node1) == RECORD_TYPE);
assert (TREE_CODE (node2) == RECORD_TYPE);
node1 = ffecom_stabilize_aggregate_ (node1);
node2 = ffecom_stabilize_aggregate_ (node2);
realtype = TREE_TYPE (TYPE_FIELDS (type));
item =
ffecom_2 (TRUTH_ORIF_EXPR, type,
ffecom_2 (code, type,
ffecom_1 (REALPART_EXPR, realtype,
node1),
ffecom_1 (REALPART_EXPR, realtype,
node2)),
ffecom_2 (code, type,
ffecom_1 (IMAGPART_EXPR, realtype,
node1),
ffecom_1 (IMAGPART_EXPR, realtype,
node2)));
break;
default:
item = build (code, type, node1, node2);
break;
}
if (TREE_SIDE_EFFECTS (node1) || TREE_SIDE_EFFECTS (node2))
TREE_SIDE_EFFECTS (item) = 1;
return fold (item);
}
#endif
/* ffecom_2pass_advise_entrypoint -- Advise that there's this entrypoint
ffesymbol s; // the ENTRY point itself
if (ffecom_2pass_advise_entrypoint(s))
// the ENTRY point has been accepted
Does whatever compiler needs to do when it learns about the entrypoint,
like determine the return type of the master function, count the
number of entrypoints, etc. Returns FALSE if the return type is
not compatible with the return type(s) of other entrypoint(s).
NOTE: for every call to this fn that returns TRUE, _do_entrypoint must
later (after _finish_progunit) be called with the same entrypoint(s)
as passed to this fn for which TRUE was returned.
03-Jan-92 JCB 2.0
Return FALSE if the return type conflicts with previous entrypoints. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
bool
ffecom_2pass_advise_entrypoint (ffesymbol entry)
{
ffebld list; /* opITEM. */
ffebld mlist; /* opITEM. */
ffebld plist; /* opITEM. */
ffebld arg; /* ffebld_head(opITEM). */
ffebld item; /* opITEM. */
ffesymbol s; /* ffebld_symter(arg). */
ffeinfoBasictype bt = ffesymbol_basictype (entry);
ffeinfoKindtype kt = ffesymbol_kindtype (entry);
ffetargetCharacterSize size = ffesymbol_size (entry);
bool ok;
if (ffecom_num_entrypoints_ == 0)
{ /* First entrypoint, make list of main
arglist's dummies. */
assert (ffecom_primary_entry_ != NULL);
ffecom_master_bt_ = ffesymbol_basictype (ffecom_primary_entry_);
ffecom_master_kt_ = ffesymbol_kindtype (ffecom_primary_entry_);
ffecom_master_size_ = ffesymbol_size (ffecom_primary_entry_);
for (plist = NULL, list = ffesymbol_dummyargs (ffecom_primary_entry_);
list != NULL;
list = ffebld_trail (list))
{
arg = ffebld_head (list);
if (ffebld_op (arg) != FFEBLD_opSYMTER)
continue; /* Alternate return or some such thing. */
item = ffebld_new_item (arg, NULL);
if (plist == NULL)
ffecom_master_arglist_ = item;
else
ffebld_set_trail (plist, item);
plist = item;
}
}
/* If necessary, scan entry arglist for alternate returns. Do this scan
apparently redundantly (it's done below to UNIONize the arglists) so
that we don't complain about RETURN 1 if an offending ENTRY is the only
one with an alternate return. */
if (!ffecom_is_altreturning_)
{
for (list = ffesymbol_dummyargs (entry);
list != NULL;
list = ffebld_trail (list))
{
arg = ffebld_head (list);
if (ffebld_op (arg) == FFEBLD_opSTAR)
{
ffecom_is_altreturning_ = TRUE;
break;
}
}
}
/* Now check type compatibility. */
switch (ffecom_master_bt_)
{
case FFEINFO_basictypeNONE:
ok = (bt != FFEINFO_basictypeCHARACTER);
break;
case FFEINFO_basictypeCHARACTER:
ok
= (bt == FFEINFO_basictypeCHARACTER)
&& (kt == ffecom_master_kt_)
&& (size == ffecom_master_size_);
break;
case FFEINFO_basictypeANY:
return FALSE; /* Just don't bother. */
default:
if (bt == FFEINFO_basictypeCHARACTER)
{
ok = FALSE;
break;
}
ok = TRUE;
if ((bt != ffecom_master_bt_) || (kt != ffecom_master_kt_))
{
ffecom_master_bt_ = FFEINFO_basictypeNONE;
ffecom_master_kt_ = FFEINFO_kindtypeNONE;
}
break;
}
if (!ok)
{
ffebad_start (FFEBAD_ENTRY_CONFLICTS);
ffest_ffebad_here_current_stmt (0);
ffebad_finish ();
return FALSE; /* Can't handle entrypoint. */
}
/* Entrypoint type compatible with previous types. */
++ffecom_num_entrypoints_;
/* Master-arg-list = UNION(Master-arg-list,entry-arg-list). */
for (list = ffesymbol_dummyargs (entry);
list != NULL;
list = ffebld_trail (list))
{
arg = ffebld_head (list);
if (ffebld_op (arg) != FFEBLD_opSYMTER)
continue; /* Alternate return or some such thing. */
s = ffebld_symter (arg);
for (plist = NULL, mlist = ffecom_master_arglist_;
mlist != NULL;
plist = mlist, mlist = ffebld_trail (mlist))
{ /* plist points to previous item for easy
appending of arg. */
if (ffebld_symter (ffebld_head (mlist)) == s)
break; /* Already have this arg in the master list. */
}
if (mlist != NULL)
continue; /* Already have this arg in the master list. */
/* Append this arg to the master list. */
item = ffebld_new_item (arg, NULL);
if (plist == NULL)
ffecom_master_arglist_ = item;
else
ffebld_set_trail (plist, item);
}
return TRUE;
}
#endif
/* ffecom_2pass_do_entrypoint -- Do compilation of entrypoint
ffesymbol s; // the ENTRY point itself
ffecom_2pass_do_entrypoint(s);
Does whatever compiler needs to do to make the entrypoint actually
happen. Must be called for each entrypoint after
ffecom_finish_progunit is called. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_2pass_do_entrypoint (ffesymbol entry)
{
static int mfn_num = 0;
static int ent_num;
if (mfn_num != ffecom_num_fns_)
{ /* First entrypoint for this program unit. */
ent_num = 1;
mfn_num = ffecom_num_fns_;
ffecom_do_entry_ (ffecom_primary_entry_, 0);
}
else
++ent_num;
--ffecom_num_entrypoints_;
ffecom_do_entry_ (entry, ent_num);
}
#endif
/* Essentially does a "fold (build (code, type, node1, node2))" while
checking for certain housekeeping things. Always sets
TREE_SIDE_EFFECTS. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_2s (enum tree_code code, tree type, tree node1,
tree node2)
{
tree item;
if ((node1 == error_mark_node)
|| (node2 == error_mark_node)
|| (type == error_mark_node))
return error_mark_node;
item = build (code, type, node1, node2);
TREE_SIDE_EFFECTS (item) = 1;
return fold (item);
}
#endif
/* Essentially does a "fold (build (code, type, node1, node2, node3))" while
checking for certain housekeeping things. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_3 (enum tree_code code, tree type, tree node1,
tree node2, tree node3)
{
tree item;
if ((node1 == error_mark_node)
|| (node2 == error_mark_node)
|| (node3 == error_mark_node)
|| (type == error_mark_node))
return error_mark_node;
item = build (code, type, node1, node2, node3);
if (TREE_SIDE_EFFECTS (node1) || TREE_SIDE_EFFECTS (node2)
|| (node3 != NULL_TREE && TREE_SIDE_EFFECTS (node3)))
TREE_SIDE_EFFECTS (item) = 1;
return fold (item);
}
#endif
/* Essentially does a "fold (build (code, type, node1, node2, node3))" while
checking for certain housekeeping things. Always sets
TREE_SIDE_EFFECTS. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_3s (enum tree_code code, tree type, tree node1,
tree node2, tree node3)
{
tree item;
if ((node1 == error_mark_node)
|| (node2 == error_mark_node)
|| (node3 == error_mark_node)
|| (type == error_mark_node))
return error_mark_node;
item = build (code, type, node1, node2, node3);
TREE_SIDE_EFFECTS (item) = 1;
return fold (item);
}
#endif
/* ffecom_arg_expr -- Transform argument expr into gcc tree
See use by ffecom_list_expr.
If expression is NULL, returns an integer zero tree. If it is not
a CHARACTER expression, returns whatever ffecom_expr
returns and sets the length return value to NULL_TREE. Otherwise
generates code to evaluate the character expression, returns the proper
pointer to the result, but does NOT set the length return value to a tree
that specifies the length of the result. (In other words, the length
variable is always set to NULL_TREE, because a length is never passed.)
21-Dec-91 JCB 1.1
Don't set returned length, since nobody needs it (yet; someday if
we allow CHARACTER*(*) dummies to statement functions, we'll need
it). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_arg_expr (ffebld expr, tree *length)
{
tree ign;
*length = NULL_TREE;
if (expr == NULL)
return integer_zero_node;
if (ffeinfo_basictype (ffebld_info (expr)) != FFEINFO_basictypeCHARACTER)
return ffecom_expr (expr);
return ffecom_arg_ptr_to_expr (expr, &ign);
}
#endif
/* ffecom_arg_ptr_to_expr -- Transform argument expr into gcc tree
See use by ffecom_list_ptr_to_expr.
If expression is NULL, returns an integer zero tree. If it is not
a CHARACTER expression, returns whatever ffecom_ptr_to_expr
returns and sets the length return value to NULL_TREE. Otherwise
generates code to evaluate the character expression, returns the proper
pointer to the result, AND sets the length return value to a tree that
specifies the length of the result.
If the length argument is NULL, this is a slightly special
case of building a FORMAT expression, that is, an expression that
will be used at run time without regard to length. For the current
implementation, which uses the libf2c library, this means it is nice
to append a null byte to the end of the expression, where feasible,
to make sure any diagnostic about the FORMAT string terminates at
some useful point.
For now, treat %REF(char-expr) as the same as char-expr with a NULL
length argument. This might even be seen as a feature, if a null
byte can always be appended. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_arg_ptr_to_expr (ffebld expr, tree *length)
{
tree item;
tree ign_length;
ffecomConcatList_ catlist;
if (length != NULL)
*length = NULL_TREE;
if (expr == NULL)
return integer_zero_node;
switch (ffebld_op (expr))
{
case FFEBLD_opPERCENT_VAL:
if (ffeinfo_basictype (ffebld_info (expr)) != FFEINFO_basictypeCHARACTER)
return ffecom_expr (ffebld_left (expr));
{
tree temp_exp;
tree temp_length;
temp_exp = ffecom_arg_ptr_to_expr (ffebld_left (expr), &temp_length);
return ffecom_1 (INDIRECT_REF, TREE_TYPE (TREE_TYPE (temp_exp)),
temp_exp);
}
case FFEBLD_opPERCENT_REF:
if (ffeinfo_basictype (ffebld_info (expr)) != FFEINFO_basictypeCHARACTER)
return ffecom_ptr_to_expr (ffebld_left (expr));
if (length != NULL)
{
ign_length = NULL_TREE;
length = &ign_length;
}
expr = ffebld_left (expr);
break;
case FFEBLD_opPERCENT_DESCR:
switch (ffeinfo_basictype (ffebld_info (expr)))
{
#ifdef PASS_HOLLERITH_BY_DESCRIPTOR
case FFEINFO_basictypeHOLLERITH:
#endif
case FFEINFO_basictypeCHARACTER:
break; /* Passed by descriptor anyway. */
default:
item = ffecom_ptr_to_expr (expr);
if (item != error_mark_node)
*length = TYPE_SIZE (TREE_TYPE (TREE_TYPE (item)));
break;
}
break;
default:
break;
}
#ifdef PASS_HOLLERITH_BY_DESCRIPTOR
if ((ffeinfo_basictype (ffebld_info (expr)) == FFEINFO_basictypeHOLLERITH)
&& (length != NULL))
{ /* Pass Hollerith by descriptor. */
ffetargetHollerith h;
assert (ffebld_op (expr) == FFEBLD_opCONTER);
h = ffebld_cu_val_hollerith (ffebld_constant_union
(ffebld_conter (expr)));
*length
= build_int_2 (h.length, 0);
TREE_TYPE (*length) = ffecom_f2c_ftnlen_type_node;
}
#endif
if (ffeinfo_basictype (ffebld_info (expr)) != FFEINFO_basictypeCHARACTER)
return ffecom_ptr_to_expr (expr);
assert (ffeinfo_kindtype (ffebld_info (expr))
== FFEINFO_kindtypeCHARACTER1);
catlist = ffecom_concat_list_new_ (expr, FFETARGET_charactersizeNONE);
switch (ffecom_concat_list_count_ (catlist))
{
case 0: /* Shouldn't happen, but in case it does... */
if (length != NULL)
{
*length = ffecom_f2c_ftnlen_zero_node;
TREE_TYPE (*length) = ffecom_f2c_ftnlen_type_node;
}
ffecom_concat_list_kill_ (catlist);
return null_pointer_node;
case 1: /* The (fairly) easy case. */
if (length == NULL)
ffecom_char_args_with_null_ (&item, &ign_length,
ffecom_concat_list_expr_ (catlist, 0));
else
ffecom_char_args_ (&item, length,
ffecom_concat_list_expr_ (catlist, 0));
ffecom_concat_list_kill_ (catlist);
assert (item != NULL_TREE);
return item;
default: /* Must actually concatenate things. */
break;
}
{
int count = ffecom_concat_list_count_ (catlist);
int i;
tree lengths;
tree items;
tree length_array;
tree item_array;
tree citem;
tree clength;
tree temporary;
tree num;
tree known_length;
ffetargetCharacterSize sz;
length_array
= lengths
= ffecom_push_tempvar (ffecom_f2c_ftnlen_type_node,
FFETARGET_charactersizeNONE, count, TRUE);
item_array
= items
= ffecom_push_tempvar (ffecom_f2c_address_type_node,
FFETARGET_charactersizeNONE, count, TRUE);
known_length = ffecom_f2c_ftnlen_zero_node;
for (i = 0; i < count; ++i)
{
if ((i == count)
&& (length == NULL))
ffecom_char_args_with_null_ (&citem, &clength,
ffecom_concat_list_expr_ (catlist, i));
else
ffecom_char_args_ (&citem, &clength,
ffecom_concat_list_expr_ (catlist, i));
if ((citem == error_mark_node)
|| (clength == error_mark_node))
{
ffecom_concat_list_kill_ (catlist);
*length = error_mark_node;
return error_mark_node;
}
items
= ffecom_2 (COMPOUND_EXPR, TREE_TYPE (items),
ffecom_modify (void_type_node,
ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (item_array))),
item_array,
build_int_2 (i, 0)),
citem),
items);
clength = ffecom_save_tree (clength);
if (length != NULL)
known_length
= ffecom_2 (PLUS_EXPR, ffecom_f2c_ftnlen_type_node,
known_length,
clength);
lengths
= ffecom_2 (COMPOUND_EXPR, TREE_TYPE (lengths),
ffecom_modify (void_type_node,
ffecom_2 (ARRAY_REF,
TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (length_array))),
length_array,
build_int_2 (i, 0)),
clength),
lengths);
}
sz = ffecom_concat_list_maxlen_ (catlist);
assert (sz != FFETARGET_charactersizeNONE);
temporary = ffecom_push_tempvar (char_type_node,
sz, -1, TRUE);
temporary = ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (temporary)),
temporary);
item = build_tree_list (NULL_TREE, temporary);
TREE_CHAIN (item)
= build_tree_list (NULL_TREE,
ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (items)),
items));
TREE_CHAIN (TREE_CHAIN (item))
= build_tree_list (NULL_TREE,
ffecom_1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (lengths)),
lengths));
TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (item)))
= build_tree_list
(NULL_TREE,
ffecom_1 (ADDR_EXPR, ffecom_f2c_ptr_to_ftnlen_type_node,
convert (ffecom_f2c_ftnlen_type_node,
build_int_2 (count, 0))));
num = build_int_2 (sz, 0);
TREE_TYPE (num) = ffecom_f2c_ftnlen_type_node;
TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (TREE_CHAIN (item))))
= build_tree_list (NULL_TREE, num);
item = ffecom_call_gfrt (FFECOM_gfrtCAT, item);
TREE_SIDE_EFFECTS (item) = 1;
item = ffecom_2 (COMPOUND_EXPR, TREE_TYPE (temporary),
item,
temporary);
if (length != NULL)
*length = known_length;
}
ffecom_concat_list_kill_ (catlist);
assert (item != NULL_TREE);
return item;
}
#endif
/* ffecom_call_gfrt -- Generate call to run-time function
tree expr;
expr = ffecom_call_gfrt(FFECOM_gfrtSTOPNIL,NULL_TREE);
The first arg is the GNU Fortran Run-Time function index, the second
arg is the list of arguments to pass to it. Returned is the expression
(WITHOUT TREE_SIDE_EFFECTS set!) that makes the call and returns the
result (which may be void). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_call_gfrt (ffecomGfrt ix, tree args)
{
return ffecom_call_ (ffecom_gfrt_tree_ (ix),
ffecom_gfrt_kindtype (ix),
ffe_is_f2c_library () && ffecom_gfrt_complex_[ix],
NULL_TREE, args, NULL_TREE, NULL,
NULL, NULL_TREE, TRUE);
}
#endif
/* ffecom_constantunion -- Transform constant-union to tree
ffebldConstantUnion cu; // the constant to transform
ffeinfoBasictype bt; // its basic type
ffeinfoKindtype kt; // its kind type
tree tree_type; // ffecom_tree_type[bt][kt]
ffecom_constantunion(&cu,bt,kt,tree_type); */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_constantunion (ffebldConstantUnion *cu, ffeinfoBasictype bt,
ffeinfoKindtype kt, tree tree_type)
{
tree item;
switch (bt)
{
case FFEINFO_basictypeINTEGER:
{
int val;
switch (kt)
{
#if FFETARGET_okINTEGER1
case FFEINFO_kindtypeINTEGER1:
val = ffebld_cu_val_integer1 (*cu);
break;
#endif
#if FFETARGET_okINTEGER2
case FFEINFO_kindtypeINTEGER2:
val = ffebld_cu_val_integer2 (*cu);
break;
#endif
#if FFETARGET_okINTEGER3
case FFEINFO_kindtypeINTEGER3:
val = ffebld_cu_val_integer3 (*cu);
break;
#endif
#if FFETARGET_okINTEGER4
case FFEINFO_kindtypeINTEGER4:
val = ffebld_cu_val_integer4 (*cu);
break;
#endif
default:
assert ("bad INTEGER constant kind type" == NULL);
/* Fall through. */
case FFEINFO_kindtypeANY:
return error_mark_node;
}
item = build_int_2 (val, (val < 0) ? -1 : 0);
TREE_TYPE (item) = tree_type;
}
break;
case FFEINFO_basictypeLOGICAL:
{
int val;
switch (kt)
{
#if FFETARGET_okLOGICAL1
case FFEINFO_kindtypeLOGICAL1:
val = ffebld_cu_val_logical1 (*cu);
break;
#endif
#if FFETARGET_okLOGICAL2
case FFEINFO_kindtypeLOGICAL2:
val = ffebld_cu_val_logical2 (*cu);
break;
#endif
#if FFETARGET_okLOGICAL3
case FFEINFO_kindtypeLOGICAL3:
val = ffebld_cu_val_logical3 (*cu);
break;
#endif
#if FFETARGET_okLOGICAL4
case FFEINFO_kindtypeLOGICAL4:
val = ffebld_cu_val_logical4 (*cu);
break;
#endif
default:
assert ("bad LOGICAL constant kind type" == NULL);
/* Fall through. */
case FFEINFO_kindtypeANY:
return error_mark_node;
}
item = build_int_2 (val, (val < 0) ? -1 : 0);
TREE_TYPE (item) = tree_type;
}
break;
case FFEINFO_basictypeREAL:
{
REAL_VALUE_TYPE val;
switch (kt)
{
#if FFETARGET_okREAL1
case FFEINFO_kindtypeREAL1:
val = ffetarget_value_real1 (ffebld_cu_val_real1 (*cu));
break;
#endif
#if FFETARGET_okREAL2
case FFEINFO_kindtypeREAL2:
val = ffetarget_value_real2 (ffebld_cu_val_real2 (*cu));
break;
#endif
#if FFETARGET_okREAL3
case FFEINFO_kindtypeREAL3:
val = ffetarget_value_real3 (ffebld_cu_val_real3 (*cu));
break;
#endif
#if FFETARGET_okREAL4
case FFEINFO_kindtypeREAL4:
val = ffetarget_value_real4 (ffebld_cu_val_real4 (*cu));
break;
#endif
default:
assert ("bad REAL constant kind type" == NULL);
/* Fall through. */
case FFEINFO_kindtypeANY:
return error_mark_node;
}
item = build_real (tree_type, val);
}
break;
case FFEINFO_basictypeCOMPLEX:
{
REAL_VALUE_TYPE real;
REAL_VALUE_TYPE imag;
tree el_type = ffecom_tree_type[FFEINFO_basictypeREAL][kt];
switch (kt)
{
#if FFETARGET_okCOMPLEX1
case FFEINFO_kindtypeREAL1:
real = ffetarget_value_real1 (ffebld_cu_val_complex1 (*cu).real);
imag = ffetarget_value_real1 (ffebld_cu_val_complex1 (*cu).imaginary);
break;
#endif
#if FFETARGET_okCOMPLEX2
case FFEINFO_kindtypeREAL2:
real = ffetarget_value_real2 (ffebld_cu_val_complex2 (*cu).real);
imag = ffetarget_value_real2 (ffebld_cu_val_complex2 (*cu).imaginary);
break;
#endif
#if FFETARGET_okCOMPLEX3
case FFEINFO_kindtypeREAL3:
real = ffetarget_value_real3 (ffebld_cu_val_complex3 (*cu).real);
imag = ffetarget_value_real3 (ffebld_cu_val_complex3 (*cu).imaginary);
break;
#endif
#if FFETARGET_okCOMPLEX4
case FFEINFO_kindtypeREAL4:
real = ffetarget_value_real4 (ffebld_cu_val_complex4 (*cu).real);
imag = ffetarget_value_real4 (ffebld_cu_val_complex4 (*cu).imaginary);
break;
#endif
default:
assert ("bad REAL constant kind type" == NULL);
/* Fall through. */
case FFEINFO_kindtypeANY:
return error_mark_node;
}
item = ffecom_build_complex_constant_ (tree_type,
build_real (el_type, real),
build_real (el_type, imag));
}
break;
case FFEINFO_basictypeCHARACTER:
{ /* Happens only in DATA and similar contexts. */
ffetargetCharacter1 val;
switch (kt)
{
#if FFETARGET_okCHARACTER1
case FFEINFO_kindtypeLOGICAL1:
val = ffebld_cu_val_character1 (*cu);
break;
#endif
default:
assert ("bad CHARACTER constant kind type" == NULL);
/* Fall through. */
case FFEINFO_kindtypeANY:
return error_mark_node;
}
item = build_string (ffetarget_length_character1 (val),
ffetarget_text_character1 (val));
TREE_TYPE (item)
= build_type_variant (build_array_type (char_type_node,
build_range_type
(integer_type_node,
integer_one_node,
build_int_2
(ffetarget_length_character1
(val), 0))),
1, 0);
}
break;
case FFEINFO_basictypeHOLLERITH:
{
ffetargetHollerith h;
h = ffebld_cu_val_hollerith (*cu);
/* If not at least as wide as default INTEGER, widen it. */
if (h.length >= FLOAT_TYPE_SIZE / CHAR_TYPE_SIZE)
item = build_string (h.length, h.text);
else
{
char str[FLOAT_TYPE_SIZE / CHAR_TYPE_SIZE];
memcpy (str, h.text, h.length);
memset (&str[h.length], ' ',
FLOAT_TYPE_SIZE / CHAR_TYPE_SIZE
- h.length);
item = build_string (FLOAT_TYPE_SIZE / CHAR_TYPE_SIZE,
str);
}
TREE_TYPE (item)
= build_type_variant (build_array_type (char_type_node,
build_range_type
(integer_type_node,
integer_one_node,
build_int_2
(h.length, 0))),
1, 0);
}
break;
case FFEINFO_basictypeTYPELESS:
{
ffetargetInteger1 ival;
ffetargetTypeless tless;
ffebad error;
tless = ffebld_cu_val_typeless (*cu);
error = ffetarget_convert_integer1_typeless (&ival, tless);
assert (error == FFEBAD);
item = build_int_2 ((int) ival, 0);
}
break;
default:
assert ("not yet on constant type" == NULL);
/* Fall through. */
case FFEINFO_basictypeANY:
return error_mark_node;
}
TREE_CONSTANT (item) = 1;
return item;
}
#endif
/* Handy way to make a field in a struct/union. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_decl_field (tree context, tree prevfield,
char *name, tree type)
{
tree field;
field = build_decl (FIELD_DECL, get_identifier (name), type);
DECL_CONTEXT (field) = context;
DECL_FRAME_SIZE (field) = 0;
if (prevfield != NULL_TREE)
TREE_CHAIN (prevfield) = field;
return field;
}
#endif
void
ffecom_close_include (FILE *f)
{
#if FFECOM_GCC_INCLUDE
ffecom_close_include_ (f);
#endif
}
int
ffecom_decode_include_option (char *spec)
{
#if FFECOM_GCC_INCLUDE
return ffecom_decode_include_option_ (spec);
#else
return 1;
#endif
}
/* ffecom_end_transition -- Perform end transition on all symbols
ffecom_end_transition();
Calls ffecom_sym_end_transition for each global and local symbol. */
void
ffecom_end_transition ()
{
#if FFECOM_targetCURRENT == FFECOM_targetGCC
ffebld item;
#endif
if (ffe_is_ffedebug ())
fprintf (dmpout, "; end_stmt_transition\n");
#if FFECOM_targetCURRENT == FFECOM_targetGCC
ffecom_list_blockdata_ = NULL;
ffecom_list_common_ = NULL;
#endif
ffesymbol_drive (ffecom_sym_end_transition);
if (ffe_is_ffedebug ())
{
ffestorag_report ();
#if FFECOM_targetCURRENT == FFECOM_targetFFE
ffesymbol_report_all ();
#endif
}
#if FFECOM_targetCURRENT == FFECOM_targetGCC
ffecom_start_progunit_ ();
for (item = ffecom_list_blockdata_;
item != NULL;
item = ffebld_trail (item))
{
ffebld callee;
ffesymbol s;
tree dt;
tree t;
tree var;
int yes;
static int number = 0;
callee = ffebld_head (item);
s = ffebld_symter (callee);
t = ffesymbol_hook (s).decl_tree;
if (t == NULL_TREE)
{
s = ffecom_sym_transform_ (s);
t = ffesymbol_hook (s).decl_tree;
}
yes = suspend_momentary ();
dt = build_pointer_type (TREE_TYPE (t));
var = build_decl (VAR_DECL,
ffecom_get_invented_identifier ("__g77_forceload_%d",
NULL, number++),
dt);
DECL_EXTERNAL (var) = 0;
TREE_STATIC (var) = 1;
TREE_PUBLIC (var) = 0;
DECL_INITIAL (var) = error_mark_node;
TREE_USED (var) = 1;
var = start_decl (var, FALSE);
t = ffecom_1 (ADDR_EXPR, dt, t);
finish_decl (var, t, FALSE);
resume_momentary (yes);
}
/* This handles any COMMON areas that weren't referenced but have, for
example, important initial data. */
for (item = ffecom_list_common_;
item != NULL;
item = ffebld_trail (item))
ffecom_transform_common_ (ffebld_symter (ffebld_head (item)));
ffecom_list_common_ = NULL;
#endif
}
/* ffecom_exec_transition -- Perform exec transition on all symbols
ffecom_exec_transition();
Calls ffecom_sym_exec_transition for each global and local symbol.
Make sure error updating not inhibited. */
void
ffecom_exec_transition ()
{
bool inhibited;
if (ffe_is_ffedebug ())
fprintf (dmpout, "; exec_stmt_transition\n");
inhibited = ffebad_inhibit ();
ffebad_set_inhibit (FALSE);
ffesymbol_drive (ffecom_sym_exec_transition); /* Don't retract! */
ffeequiv_exec_transition (); /* Handle all pending EQUIVALENCEs. */
if (ffe_is_ffedebug ())
{
ffestorag_report ();
#if FFECOM_targetCURRENT == FFECOM_targetFFE
ffesymbol_report_all ();
#endif
}
if (inhibited)
ffebad_set_inhibit (TRUE);
}
/* ffecom_expand_let_stmt -- Compile let (assignment) statement
ffebld dest;
ffebld source;
ffecom_expand_let_stmt(dest,source);
Convert dest and source using ffecom_expr, then join them
with an ASSIGN op and pass the whole thing to expand_expr_stmt. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_expand_let_stmt (ffebld dest, ffebld source)
{
tree dest_tree;
tree dest_length;
tree source_tree;
tree expr_tree;
if (ffeinfo_basictype (ffebld_info (dest)) != FFEINFO_basictypeCHARACTER)
{
bool dest_used;
dest_tree = ffecom_expr_rw (dest);
if (dest_tree == error_mark_node)
return;
if ((TREE_CODE (dest_tree) != VAR_DECL)
|| TREE_ADDRESSABLE (dest_tree))
source_tree = ffecom_expr_ (source, dest_tree, dest, &dest_used,
FALSE, FALSE);
else
{
source_tree = ffecom_expr (source);
dest_used = FALSE;
}
if (source_tree == error_mark_node)
return;
if (dest_used)
expr_tree = source_tree;
else
expr_tree = ffecom_2s (MODIFY_EXPR, void_type_node,
dest_tree,
source_tree);
expand_expr_stmt (expr_tree);
return;
}
ffecom_push_calltemps ();
ffecom_char_args_ (&dest_tree, &dest_length, dest);
ffecom_let_char_ (dest_tree, dest_length, ffebld_size_known (dest),
source);
ffecom_pop_calltemps ();
}
#endif
/* ffecom_expr -- Transform expr into gcc tree
tree t;
ffebld expr; // FFE expression.
tree = ffecom_expr(expr);
Recursive descent on expr while making corresponding tree nodes and
attaching type info and such. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_expr (ffebld expr)
{
return ffecom_expr_ (expr, NULL_TREE, NULL, NULL, FALSE, FALSE);
}
#endif
/* Like ffecom_expr, but return tree usable for assigned GOTO or FORMAT. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_expr_assign (ffebld expr)
{
return ffecom_expr_ (expr, NULL_TREE, NULL, NULL, TRUE, FALSE);
}
#endif
/* Like ffecom_expr_rw, but return tree usable for ASSIGN. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_expr_assign_w (ffebld expr)
{
return ffecom_expr_ (expr, NULL_TREE, NULL, NULL, TRUE, FALSE);
}
#endif
/* Transform expr for use as into read/write tree and stabilize the
reference. Not for use on CHARACTER expressions.
Recursive descent on expr while making corresponding tree nodes and
attaching type info and such. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_expr_rw (ffebld expr)
{
assert (expr != NULL);
return stabilize_reference (ffecom_expr (expr));
}
#endif
/* Do global stuff. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_finish_compile ()
{
assert (ffecom_outer_function_decl_ == NULL_TREE);
assert (current_function_decl == NULL_TREE);
ffeglobal_drive (ffecom_finish_global_);
}
#endif
/* Public entry point for front end to access finish_decl. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_finish_decl (tree decl, tree init, bool is_top_level)
{
assert (!is_top_level);
finish_decl (decl, init, FALSE);
}
#endif
/* Finish a program unit. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_finish_progunit ()
{
ffecom_end_compstmt_ ();
ffecom_previous_function_decl_ = current_function_decl;
ffecom_which_entrypoint_decl_ = NULL_TREE;
finish_function (0);
}
#endif
/* Wrapper for get_identifier. pattern is like "...%s...", text is
inserted into final name in place of "%s", or if text is NULL,
pattern is like "...%d..." and text form of number is inserted
in place of "%d". */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_get_invented_identifier (char *pattern, char *text, int number)
{
tree decl;
char *nam;
mallocSize lenlen;
char space[66];
if (text == NULL)
lenlen = strlen (pattern) + 20;
else
lenlen = strlen (pattern) + strlen (text) - 1;
if (lenlen > ARRAY_SIZE (space))
nam = malloc_new_ks (malloc_pool_image (), pattern, lenlen);
else
nam = &space[0];
if (text == NULL)
sprintf (&nam[0], pattern, number);
else
sprintf (&nam[0], pattern, text);
decl = get_identifier (nam);
if (lenlen > ARRAY_SIZE (space))
malloc_kill_ks (malloc_pool_image (), nam, lenlen);
IDENTIFIER_INVENTED (decl) = 1;
return decl;
}
ffeinfoBasictype
ffecom_gfrt_basictype (ffecomGfrt gfrt)
{
assert (gfrt < FFECOM_gfrt);
switch (ffecom_gfrt_type_[gfrt])
{
case FFECOM_rttypeVOID_:
case FFECOM_rttypeVOIDSTAR_:
return FFEINFO_basictypeNONE;
case FFECOM_rttypeFTNINT_:
return FFEINFO_basictypeINTEGER;
case FFECOM_rttypeINTEGER_:
return FFEINFO_basictypeINTEGER;
case FFECOM_rttypeLONGINT_:
return FFEINFO_basictypeINTEGER;
case FFECOM_rttypeLOGICAL_:
return FFEINFO_basictypeLOGICAL;
case FFECOM_rttypeREAL_F2C_:
case FFECOM_rttypeREAL_GNU_:
return FFEINFO_basictypeREAL;
case FFECOM_rttypeCOMPLEX_F2C_:
case FFECOM_rttypeCOMPLEX_GNU_:
return FFEINFO_basictypeCOMPLEX;
case FFECOM_rttypeDOUBLE_:
case FFECOM_rttypeDOUBLEREAL_:
return FFEINFO_basictypeREAL;
case FFECOM_rttypeDBLCMPLX_F2C_:
case FFECOM_rttypeDBLCMPLX_GNU_:
return FFEINFO_basictypeCOMPLEX;
case FFECOM_rttypeCHARACTER_:
return FFEINFO_basictypeCHARACTER;
default:
return FFEINFO_basictypeANY;
}
}
ffeinfoKindtype
ffecom_gfrt_kindtype (ffecomGfrt gfrt)
{
assert (gfrt < FFECOM_gfrt);
switch (ffecom_gfrt_type_[gfrt])
{
case FFECOM_rttypeVOID_:
case FFECOM_rttypeVOIDSTAR_:
return FFEINFO_kindtypeNONE;
case FFECOM_rttypeFTNINT_:
return FFEINFO_kindtypeINTEGER1;
case FFECOM_rttypeINTEGER_:
return FFEINFO_kindtypeINTEGER1;
case FFECOM_rttypeLONGINT_:
return FFEINFO_kindtypeINTEGER4;
case FFECOM_rttypeLOGICAL_:
return FFEINFO_kindtypeLOGICAL1;
case FFECOM_rttypeREAL_F2C_:
case FFECOM_rttypeREAL_GNU_:
return FFEINFO_kindtypeREAL1;
case FFECOM_rttypeCOMPLEX_F2C_:
case FFECOM_rttypeCOMPLEX_GNU_:
return FFEINFO_kindtypeREAL1;
case FFECOM_rttypeDOUBLE_:
case FFECOM_rttypeDOUBLEREAL_:
return FFEINFO_kindtypeREAL2;
case FFECOM_rttypeDBLCMPLX_F2C_:
case FFECOM_rttypeDBLCMPLX_GNU_:
return FFEINFO_kindtypeREAL2;
case FFECOM_rttypeCHARACTER_:
return FFEINFO_kindtypeCHARACTER1;
default:
return FFEINFO_kindtypeANY;
}
}
void
ffecom_init_0 ()
{
tree endlink;
int i;
int j;
tree t;
tree field;
ffetype type;
ffetype base_type;
/* This block of code comes from the now-obsolete cktyps.c. It checks
whether the compiler environment is buggy in known ways, some of which
would, if not explicitly checked here, result in subtle bugs in g77. */
if (ffe_is_do_internal_checks ())
{
static char names[][12]
=
{"bar", "bletch", "foo", "foobar"};
char *name;
unsigned long ul;
double fl;
name = bsearch ("foo", &names[0], ARRAY_SIZE (names), sizeof (names[0]),
(int (*)()) strcmp);
if (name != (char *) &names[2])
{
assert ("bsearch doesn't work, #define FFEPROJ_BSEARCH 0 in proj.h"
== NULL);
abort ();
}
ul = strtoul ("123456789", NULL, 10);
if (ul != 123456789L)
{
assert ("strtoul doesn't have enough range, #define FFEPROJ_STRTOUL 0\
in proj.h" == NULL);
abort ();
}
fl = atof ("56.789");
if ((fl < 56.788) || (fl > 56.79))
{
assert ("atof not type double, fix your #include <stdio.h>"
== NULL);
abort ();
}
}
/* Set the sizetype before we do anything else. This _should_ be the
first type we create. */
t = make_unsigned_type (POINTER_SIZE);
assert (t == sizetype);
#if FFECOM_GCC_INCLUDE
ffecom_initialize_char_syntax_ ();
#endif
ffecom_outer_function_decl_ = NULL_TREE;
current_function_decl = NULL_TREE;
named_labels = NULL_TREE;
current_binding_level = NULL_BINDING_LEVEL;
free_binding_level = NULL_BINDING_LEVEL;
pushlevel (0); /* make the binding_level structure for
global names */
global_binding_level = current_binding_level;
/* Define `int' and `char' first so that dbx will output them first. */
integer_type_node = make_signed_type (INT_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("int"),
integer_type_node));
char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("char"),
char_type_node));
long_integer_type_node = make_signed_type (LONG_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("long int"),
long_integer_type_node));
unsigned_type_node = make_unsigned_type (INT_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("unsigned int"),
unsigned_type_node));
long_unsigned_type_node = make_unsigned_type (LONG_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("long unsigned int"),
long_unsigned_type_node));
long_long_integer_type_node = make_signed_type (LONG_LONG_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("long long int"),
long_long_integer_type_node));
long_long_unsigned_type_node = make_unsigned_type (LONG_LONG_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("long long unsigned int"),
long_long_unsigned_type_node));
error_mark_node = make_node (ERROR_MARK);
TREE_TYPE (error_mark_node) = error_mark_node;
short_integer_type_node = make_signed_type (SHORT_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("short int"),
short_integer_type_node));
short_unsigned_type_node = make_unsigned_type (SHORT_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("short unsigned int"),
short_unsigned_type_node));
/* Define both `signed char' and `unsigned char'. */
signed_char_type_node = make_signed_type (CHAR_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("signed char"),
signed_char_type_node));
unsigned_char_type_node = make_unsigned_type (CHAR_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("unsigned char"),
unsigned_char_type_node));
float_type_node = make_node (REAL_TYPE);
TYPE_PRECISION (float_type_node) = FLOAT_TYPE_SIZE;
layout_type (float_type_node);
pushdecl (build_decl (TYPE_DECL, get_identifier ("float"),
float_type_node));
double_type_node = make_node (REAL_TYPE);
TYPE_PRECISION (double_type_node) = DOUBLE_TYPE_SIZE;
layout_type (double_type_node);
pushdecl (build_decl (TYPE_DECL, get_identifier ("double"),
double_type_node));
long_double_type_node = make_node (REAL_TYPE);
TYPE_PRECISION (long_double_type_node) = LONG_DOUBLE_TYPE_SIZE;
layout_type (long_double_type_node);
pushdecl (build_decl (TYPE_DECL, get_identifier ("long double"),
long_double_type_node));
complex_integer_type_node = ffecom_make_complex_type_ (integer_type_node);
pushdecl (build_decl (TYPE_DECL, get_identifier ("complex int"),
complex_integer_type_node));
complex_float_type_node = ffecom_make_complex_type_ (float_type_node);
pushdecl (build_decl (TYPE_DECL, get_identifier ("complex float"),
complex_float_type_node));
complex_double_type_node = ffecom_make_complex_type_ (double_type_node);
pushdecl (build_decl (TYPE_DECL, get_identifier ("complex double"),
complex_double_type_node));
complex_long_double_type_node = ffecom_make_complex_type_ (long_double_type_node);
pushdecl (build_decl (TYPE_DECL, get_identifier ("complex long double"),
complex_long_double_type_node));
integer_zero_node = build_int_2 (0, 0);
TREE_TYPE (integer_zero_node) = integer_type_node;
integer_one_node = build_int_2 (1, 0);
TREE_TYPE (integer_one_node) = integer_type_node;
size_zero_node = build_int_2 (0, 0);
TREE_TYPE (size_zero_node) = sizetype;
size_one_node = build_int_2 (1, 0);
TREE_TYPE (size_one_node) = sizetype;
void_type_node = make_node (VOID_TYPE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("void"),
void_type_node));
layout_type (void_type_node); /* Uses integer_zero_node */
/* We are not going to have real types in C with less than byte alignment,
so we might as well not have any types that claim to have it. */
TYPE_ALIGN (void_type_node) = BITS_PER_UNIT;
null_pointer_node = build_int_2 (0, 0);
TREE_TYPE (null_pointer_node) = build_pointer_type (void_type_node);
layout_type (TREE_TYPE (null_pointer_node));
string_type_node = build_pointer_type (char_type_node);
ffecom_tree_fun_type_void
= build_function_type (void_type_node, NULL_TREE);
ffecom_tree_ptr_to_fun_type_void
= build_pointer_type (ffecom_tree_fun_type_void);
endlink = tree_cons (NULL_TREE, void_type_node, NULL_TREE);
float_ftype_float
= build_function_type (float_type_node,
tree_cons (NULL_TREE, float_type_node, endlink));
double_ftype_double
= build_function_type (double_type_node,
tree_cons (NULL_TREE, double_type_node, endlink));
ldouble_ftype_ldouble
= build_function_type (long_double_type_node,
tree_cons (NULL_TREE, long_double_type_node,
endlink));
for (i = 0; ((size_t) i) < ARRAY_SIZE (ffecom_tree_type); ++i)
for (j = 0; ((size_t) j) < ARRAY_SIZE (ffecom_tree_type[0]); ++j)
{
ffecom_tree_type[i][j] = NULL_TREE;
ffecom_tree_fun_type[i][j] = NULL_TREE;
ffecom_tree_ptr_to_fun_type[i][j] = NULL_TREE;
ffecom_f2c_typecode_[i][j] = -1;
}
/* Set up standard g77 types. Note that INTEGER and LOGICAL are set
to size FLOAT_TYPE_SIZE because they have to be the same size as
REAL, which also is FLOAT_TYPE_SIZE, according to the standard.
Compiler options and other such stuff that change the ways these
types are set should not affect this particular setup. */
ffecom_tree_type[FFEINFO_basictypeINTEGER][FFEINFO_kindtypeINTEGER1]
= t = make_signed_type (FLOAT_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("integer"),
t));
type = ffetype_new ();
base_type = type;
ffeinfo_set_type (FFEINFO_basictypeINTEGER, FFEINFO_kindtypeINTEGER1,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 1, type);
assert (ffetype_size (type) == sizeof (ffetargetInteger1));
ffecom_tree_type[FFEINFO_basictypeHOLLERITH][FFEINFO_kindtypeINTEGER1]
= t = make_unsigned_type (FLOAT_TYPE_SIZE); /* HOLLERITH means unsigned. */
pushdecl (build_decl (TYPE_DECL, get_identifier ("unsigned"),
t));
ffecom_tree_type[FFEINFO_basictypeINTEGER][FFEINFO_kindtypeINTEGER2]
= t = make_signed_type (CHAR_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("byte"),
t));
type = ffetype_new ();
ffeinfo_set_type (FFEINFO_basictypeINTEGER, FFEINFO_kindtypeINTEGER2,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 3, type);
assert (ffetype_size (type) == sizeof (ffetargetInteger2));
ffecom_tree_type[FFEINFO_basictypeHOLLERITH][FFEINFO_kindtypeINTEGER2]
= t = make_unsigned_type (CHAR_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("unsigned byte"),
t));
ffecom_tree_type[FFEINFO_basictypeINTEGER][FFEINFO_kindtypeINTEGER3]
= t = make_signed_type (CHAR_TYPE_SIZE * 2);
pushdecl (build_decl (TYPE_DECL, get_identifier ("word"),
t));
type = ffetype_new ();
ffeinfo_set_type (FFEINFO_basictypeINTEGER, FFEINFO_kindtypeINTEGER3,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 6, type);
assert (ffetype_size (type) == sizeof (ffetargetInteger3));
ffecom_tree_type[FFEINFO_basictypeHOLLERITH][FFEINFO_kindtypeINTEGER3]
= t = make_unsigned_type (CHAR_TYPE_SIZE * 2);
pushdecl (build_decl (TYPE_DECL, get_identifier ("unsigned word"),
t));
ffecom_tree_type[FFEINFO_basictypeINTEGER][FFEINFO_kindtypeINTEGER4]
= t = make_signed_type (FLOAT_TYPE_SIZE * 2);
pushdecl (build_decl (TYPE_DECL, get_identifier ("integer4"),
t));
type = ffetype_new ();
ffeinfo_set_type (FFEINFO_basictypeINTEGER, FFEINFO_kindtypeINTEGER4,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 2, type);
assert (ffetype_size (type) == sizeof (ffetargetInteger4));
ffecom_tree_type[FFEINFO_basictypeHOLLERITH][FFEINFO_kindtypeINTEGER4]
= t = make_unsigned_type (FLOAT_TYPE_SIZE * 2);
pushdecl (build_decl (TYPE_DECL, get_identifier ("unsigned4"),
t));
#if 0
if (ffe_is_do_internal_checks ()
&& LONG_TYPE_SIZE != FLOAT_TYPE_SIZE
&& LONG_TYPE_SIZE != CHAR_TYPE_SIZE
&& LONG_TYPE_SIZE != SHORT_TYPE_SIZE
&& LONG_TYPE_SIZE != LONG_LONG_TYPE_SIZE)
{
fprintf (stderr, "Sorry, no g77 support for LONG_TYPE_SIZE (%d bits) yet.\n",
LONG_TYPE_SIZE);
}
#endif
ffecom_tree_type[FFEINFO_basictypeLOGICAL][FFEINFO_kindtypeLOGICAL1]
= t = make_signed_type (FLOAT_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("logical"),
t));
type = ffetype_new ();
base_type = type;
ffeinfo_set_type (FFEINFO_basictypeLOGICAL, FFEINFO_kindtypeLOGICAL1,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 1, type);
assert (ffetype_size (type) == sizeof (ffetargetLogical1));
ffecom_tree_type[FFEINFO_basictypeLOGICAL][FFEINFO_kindtypeLOGICAL2]
= t = make_signed_type (CHAR_TYPE_SIZE);
pushdecl (build_decl (TYPE_DECL, get_identifier ("logical2"),
t));
type = ffetype_new ();
ffeinfo_set_type (FFEINFO_basictypeLOGICAL, FFEINFO_kindtypeLOGICAL2,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 3, type);
assert (ffetype_size (type) == sizeof (ffetargetLogical2));
ffecom_tree_type[FFEINFO_basictypeLOGICAL][FFEINFO_kindtypeLOGICAL3]
= t = make_signed_type (CHAR_TYPE_SIZE * 2);
pushdecl (build_decl (TYPE_DECL, get_identifier ("logical3"),
t));
type = ffetype_new ();
ffeinfo_set_type (FFEINFO_basictypeLOGICAL, FFEINFO_kindtypeLOGICAL3,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 6, type);
assert (ffetype_size (type) == sizeof (ffetargetLogical3));
ffecom_tree_type[FFEINFO_basictypeLOGICAL][FFEINFO_kindtypeLOGICAL4]
= t = make_signed_type (FLOAT_TYPE_SIZE * 2);
pushdecl (build_decl (TYPE_DECL, get_identifier ("logical4"),
t));
type = ffetype_new ();
ffeinfo_set_type (FFEINFO_basictypeLOGICAL, FFEINFO_kindtypeLOGICAL4,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 2, type);
assert (ffetype_size (type) == sizeof (ffetargetLogical4));
ffecom_tree_type[FFEINFO_basictypeREAL][FFEINFO_kindtypeREAL1]
= t = make_node (REAL_TYPE);
TYPE_PRECISION (t) = FLOAT_TYPE_SIZE;
pushdecl (build_decl (TYPE_DECL, get_identifier ("real"),
t));
layout_type (t);
type = ffetype_new ();
base_type = type;
ffeinfo_set_type (FFEINFO_basictypeREAL, FFEINFO_kindtypeREAL1,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 1, type);
ffecom_f2c_typecode_[FFEINFO_basictypeREAL][FFEINFO_kindtypeREAL1]
= FFETARGET_f2cTYREAL;
assert (ffetype_size (type) == sizeof (ffetargetReal1));
ffecom_tree_type[FFEINFO_basictypeREAL][FFEINFO_kindtypeREALDOUBLE]
= t = make_node (REAL_TYPE);
TYPE_PRECISION (t) = FLOAT_TYPE_SIZE * 2; /* Always twice REAL. */
pushdecl (build_decl (TYPE_DECL, get_identifier ("double precision"),
t));
layout_type (t);
type = ffetype_new ();
ffeinfo_set_type (FFEINFO_basictypeREAL, FFEINFO_kindtypeREALDOUBLE,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 2, type);
ffecom_f2c_typecode_[FFEINFO_basictypeREAL][FFEINFO_kindtypeREAL2]
= FFETARGET_f2cTYDREAL;
assert (ffetype_size (type) == sizeof (ffetargetReal2));
ffecom_tree_type[FFEINFO_basictypeCOMPLEX][FFEINFO_kindtypeREAL1]
= t = ffecom_make_complex_type_ (ffecom_tree_type[FFEINFO_basictypeREAL][FFEINFO_kindtypeREAL1]);
pushdecl (build_decl (TYPE_DECL, get_identifier ("complex"),
t));
type = ffetype_new ();
base_type = type;
ffeinfo_set_type (FFEINFO_basictypeCOMPLEX, FFEINFO_kindtypeREAL1,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 1, type);
ffecom_f2c_typecode_[FFEINFO_basictypeCOMPLEX][FFEINFO_kindtypeREAL1]
= FFETARGET_f2cTYCOMPLEX;
assert (ffetype_size (type) == sizeof (ffetargetComplex1));
ffecom_tree_type[FFEINFO_basictypeCOMPLEX][FFEINFO_kindtypeREALDOUBLE]
= t = ffecom_make_complex_type_ (ffecom_tree_type[FFEINFO_basictypeREAL][FFEINFO_kindtypeREAL2]);
pushdecl (build_decl (TYPE_DECL, get_identifier ("double complex"),
t));
type = ffetype_new ();
ffeinfo_set_type (FFEINFO_basictypeCOMPLEX, FFEINFO_kindtypeREALDOUBLE,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_star (base_type,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / CHAR_TYPE_SIZE,
type);
ffetype_set_kind (base_type, 2,
type);
ffecom_f2c_typecode_[FFEINFO_basictypeCOMPLEX][FFEINFO_kindtypeREAL2]
= FFETARGET_f2cTYDCOMPLEX;
assert (ffetype_size (type) == sizeof (ffetargetComplex2));
/* Make function and ptr-to-function types for non-CHARACTER types. */
for (i = 0; ((size_t) i) < ARRAY_SIZE (ffecom_tree_type); ++i)
for (j = 0; ((size_t) j) < ARRAY_SIZE (ffecom_tree_type[0]); ++j)
{
if ((t = ffecom_tree_type[i][j]) != NULL_TREE)
{
if (i == FFEINFO_basictypeINTEGER)
{
/* Figure out the smallest INTEGER type that can hold
a pointer on this machine. */
if (GET_MODE_SIZE (TYPE_MODE (t))
>= GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (null_pointer_node))))
{
if ((ffecom_pointer_kind_ == FFEINFO_kindtypeNONE)
|| (GET_MODE_SIZE (TYPE_MODE (ffecom_tree_type[i][ffecom_pointer_kind_]))
> GET_MODE_SIZE (TYPE_MODE (t))))
ffecom_pointer_kind_ = j;
}
}
else if (i == FFEINFO_basictypeCOMPLEX)
t = void_type_node;
/* For f2c compatibility, REAL functions are really
implemented as DOUBLE PRECISION. */
else if ((i == FFEINFO_basictypeREAL)
&& (j == FFEINFO_kindtypeREAL1))
t = ffecom_tree_type
[FFEINFO_basictypeREAL][FFEINFO_kindtypeREAL2];
t = ffecom_tree_fun_type[i][j] = build_function_type (t,
NULL_TREE);
ffecom_tree_ptr_to_fun_type[i][j] = build_pointer_type (t);
}
}
/* Set up pointer types. */
if (ffecom_pointer_kind_ == FFEINFO_basictypeNONE)
fatal ("no INTEGER type can hold a pointer on this configuration");
else if (0 && ffe_is_do_internal_checks ())
fprintf (stderr, "Pointer type kt=%d\n", ffecom_pointer_kind_);
ffetype_set_kind (ffeinfo_type (FFEINFO_basictypeINTEGER,
FFEINFO_kindtypeINTEGERDEFAULT),
7,
ffeinfo_type (FFEINFO_basictypeINTEGER,
ffecom_pointer_kind_));
if (ffe_is_ugly_assign ())
ffecom_label_kind_ = ffecom_pointer_kind_; /* Require ASSIGN etc to this. */
else
ffecom_label_kind_ = FFEINFO_kindtypeINTEGERDEFAULT;
if (0 && ffe_is_do_internal_checks ())
fprintf (stderr, "Label type kt=%d\n", ffecom_label_kind_);
ffecom_integer_type_node
= ffecom_tree_type[FFEINFO_basictypeINTEGER][FFEINFO_kindtypeINTEGER1];
ffecom_integer_zero_node = convert (ffecom_integer_type_node,
integer_zero_node);
ffecom_integer_one_node = convert (ffecom_integer_type_node,
integer_one_node);
/* Yes, the "FLOAT_TYPE_SIZE" references below are intentional.
Turns out that by TYLONG, runtime/libI77/lio.h really means
"whatever size an ftnint is". For consistency and sanity,
com.h and runtime/f2c.h.in agree that flag, ftnint, and ftlen
all are INTEGER, which we also make out of whatever back-end
integer type is FLOAT_TYPE_SIZE bits wide. This change, from
LONG_TYPE_SIZE, for TYLONG and TYLOGICAL, was necessary to
accommodate machines like the Alpha. Note that this suggests
f2c and libf2c are missing a distinction perhaps needed on
some machines between "int" and "long int". -- burley 0.5.5 950215 */
ffecom_f2c_set_lio_code_ (FFEINFO_basictypeINTEGER, FLOAT_TYPE_SIZE,
FFETARGET_f2cTYLONG);
ffecom_f2c_set_lio_code_ (FFEINFO_basictypeINTEGER, SHORT_TYPE_SIZE,
FFETARGET_f2cTYSHORT);
ffecom_f2c_set_lio_code_ (FFEINFO_basictypeINTEGER, CHAR_TYPE_SIZE,
FFETARGET_f2cTYINT1);
ffecom_f2c_set_lio_code_ (FFEINFO_basictypeINTEGER, LONG_LONG_TYPE_SIZE,
FFETARGET_f2cTYQUAD);
ffecom_f2c_set_lio_code_ (FFEINFO_basictypeLOGICAL, FLOAT_TYPE_SIZE,
FFETARGET_f2cTYLOGICAL);
ffecom_f2c_set_lio_code_ (FFEINFO_basictypeLOGICAL, SHORT_TYPE_SIZE,
FFETARGET_f2cTYLOGICAL2);
ffecom_f2c_set_lio_code_ (FFEINFO_basictypeLOGICAL, CHAR_TYPE_SIZE,
FFETARGET_f2cTYLOGICAL1);
ffecom_f2c_set_lio_code_ (FFEINFO_basictypeLOGICAL, LONG_LONG_TYPE_SIZE,
FFETARGET_f2cTYQUAD /* ~~~ */);
/* CHARACTER stuff is all special-cased, so it is not handled in the above
loop. CHARACTER items are built as arrays of unsigned char. */
ffecom_tree_type[FFEINFO_basictypeCHARACTER]
[FFEINFO_kindtypeCHARACTER1] = t = char_type_node;
type = ffetype_new ();
base_type = type;
ffeinfo_set_type (FFEINFO_basictypeCHARACTER,
FFEINFO_kindtypeCHARACTER1,
type);
ffetype_set_ams (type,
TYPE_ALIGN (t) / BITS_PER_UNIT, 0,
TREE_INT_CST_LOW (TYPE_SIZE (t)) / BITS_PER_UNIT);
ffetype_set_kind (base_type, 1, type);
assert (ffetype_size (type)
== sizeof (((ffetargetCharacter1) { 0, NULL }).text[0]));
ffecom_tree_fun_type[FFEINFO_basictypeCHARACTER]
[FFEINFO_kindtypeCHARACTER1] = ffecom_tree_fun_type_void;
ffecom_tree_ptr_to_fun_type[FFEINFO_basictypeCHARACTER]
[FFEINFO_kindtypeCHARACTER1]
= ffecom_tree_ptr_to_fun_type_void;
ffecom_f2c_typecode_[FFEINFO_basictypeCHARACTER][FFEINFO_kindtypeCHARACTER1]
= FFETARGET_f2cTYCHAR;
ffecom_f2c_typecode_[FFEINFO_basictypeANY][FFEINFO_kindtypeANY]
= 0;
/* Make multi-return-value type and fields. */
ffecom_multi_type_node_ = make_node (UNION_TYPE);
field = NULL_TREE;
for (i = 0; ((size_t) i) < ARRAY_SIZE (ffecom_tree_type); ++i)
for (j = 0; ((size_t) j) < ARRAY_SIZE (ffecom_tree_type[0]); ++j)
{
char name[30];
if (ffecom_tree_type[i][j] == NULL_TREE)
continue; /* Not supported. */
sprintf (&name[0], "bt_%s_kt_%s",
ffeinfo_basictype_string ((ffeinfoBasictype) i),
ffeinfo_kindtype_string ((ffeinfoKindtype) j));
ffecom_multi_fields_[i][j] = build_decl (FIELD_DECL,
get_identifier (name),
ffecom_tree_type[i][j]);
DECL_CONTEXT (ffecom_multi_fields_[i][j])
= ffecom_multi_type_node_;
DECL_FRAME_SIZE (ffecom_multi_fields_[i][j]) = 0;
TREE_CHAIN (ffecom_multi_fields_[i][j]) = field;
field = ffecom_multi_fields_[i][j];
}
TYPE_FIELDS (ffecom_multi_type_node_) = field;
layout_type (ffecom_multi_type_node_);
/* Subroutines usually return integer because they might have alternate
returns. */
ffecom_tree_subr_type
= build_function_type (integer_type_node, NULL_TREE);
ffecom_tree_ptr_to_subr_type
= build_pointer_type (ffecom_tree_subr_type);
ffecom_tree_blockdata_type
= build_function_type (void_type_node, NULL_TREE);
builtin_function ("__builtin_sqrtf", float_ftype_float,
BUILT_IN_FSQRT, "sqrtf");
builtin_function ("__builtin_fsqrt", double_ftype_double,
BUILT_IN_FSQRT, "sqrt");
builtin_function ("__builtin_sqrtl", ldouble_ftype_ldouble,
BUILT_IN_FSQRT, "sqrtl");
builtin_function ("__builtin_sinf", float_ftype_float,
BUILT_IN_SIN, "sinf");
builtin_function ("__builtin_sin", double_ftype_double,
BUILT_IN_SIN, "sin");
builtin_function ("__builtin_sinl", ldouble_ftype_ldouble,
BUILT_IN_SIN, "sinl");
builtin_function ("__builtin_cosf", float_ftype_float,
BUILT_IN_COS, "cosf");
builtin_function ("__builtin_cos", double_ftype_double,
BUILT_IN_COS, "cos");
builtin_function ("__builtin_cosl", ldouble_ftype_ldouble,
BUILT_IN_COS, "cosl");
#if BUILT_FOR_270
pedantic_lvalues = FALSE;
#endif
ffecom_f2c_make_type_ (&ffecom_f2c_integer_type_node,
FFECOM_f2cINTEGER,
"integer");
ffecom_f2c_make_type_ (&ffecom_f2c_address_type_node,
FFECOM_f2cADDRESS,
"address");
ffecom_f2c_make_type_ (&ffecom_f2c_real_type_node,
FFECOM_f2cREAL,
"real");
ffecom_f2c_make_type_ (&ffecom_f2c_doublereal_type_node,
FFECOM_f2cDOUBLEREAL,
"doublereal");
ffecom_f2c_make_type_ (&ffecom_f2c_complex_type_node,
FFECOM_f2cCOMPLEX,
"complex");
ffecom_f2c_make_type_ (&ffecom_f2c_doublecomplex_type_node,
FFECOM_f2cDOUBLECOMPLEX,
"doublecomplex");
ffecom_f2c_make_type_ (&ffecom_f2c_longint_type_node,
FFECOM_f2cLONGINT,
"longint");
ffecom_f2c_make_type_ (&ffecom_f2c_logical_type_node,
FFECOM_f2cLOGICAL,
"logical");
ffecom_f2c_make_type_ (&ffecom_f2c_flag_type_node,
FFECOM_f2cFLAG,
"flag");
ffecom_f2c_make_type_ (&ffecom_f2c_ftnlen_type_node,
FFECOM_f2cFTNLEN,
"ftnlen");
ffecom_f2c_make_type_ (&ffecom_f2c_ftnint_type_node,
FFECOM_f2cFTNINT,
"ftnint");
ffecom_f2c_ftnlen_zero_node
= convert (ffecom_f2c_ftnlen_type_node, integer_zero_node);
ffecom_f2c_ftnlen_one_node
= convert (ffecom_f2c_ftnlen_type_node, integer_one_node);
ffecom_f2c_ftnlen_two_node = build_int_2 (2, 0);
TREE_TYPE (ffecom_f2c_ftnlen_two_node) = ffecom_integer_type_node;
ffecom_f2c_ptr_to_ftnlen_type_node
= build_pointer_type (ffecom_f2c_ftnlen_type_node);
ffecom_f2c_ptr_to_ftnint_type_node
= build_pointer_type (ffecom_f2c_ftnint_type_node);
ffecom_f2c_ptr_to_integer_type_node
= build_pointer_type (ffecom_f2c_integer_type_node);
ffecom_f2c_ptr_to_real_type_node
= build_pointer_type (ffecom_f2c_real_type_node);
ffecom_float_zero_ = build_real (float_type_node, dconst0);
ffecom_double_zero_ = build_real (double_type_node, dconst0);
{
REAL_VALUE_TYPE point_5;
#ifdef REAL_ARITHMETIC
REAL_ARITHMETIC (point_5, RDIV_EXPR, dconst1, dconst2);
#else
point_5 = .5;
#endif
ffecom_float_half_ = build_real (float_type_node, point_5);
ffecom_double_half_ = build_real (double_type_node, point_5);
}
/* Do "extern int xargc;". */
ffecom_tree_xargc_ = build_decl (VAR_DECL,
get_identifier ("f__xargc"),
integer_type_node);
DECL_EXTERNAL (ffecom_tree_xargc_) = 1;
TREE_STATIC (ffecom_tree_xargc_) = 1;
TREE_PUBLIC (ffecom_tree_xargc_) = 1;
ffecom_tree_xargc_ = start_decl (ffecom_tree_xargc_, FALSE);
finish_decl (ffecom_tree_xargc_, NULL_TREE, FALSE);
#if 0 /* This is being fixed, and seems to be working now. */
if ((FLOAT_TYPE_SIZE != 32)
|| (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (null_pointer_node))) != 32))
{
warning ("configuration: REAL, INTEGER, and LOGICAL are %d bits wide,",
(int) FLOAT_TYPE_SIZE);
warning ("and pointers are %d bits wide, but g77 doesn't yet work",
(int) TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (null_pointer_node))));
warning ("properly unless they all are 32 bits wide.");
warning ("Please keep this in mind before you report bugs. g77 should");
warning ("support non-32-bit machines better as of version 0.6.");
}
#endif
#if 0 /* Code in ste.c that would crash has been commented out. */
if (TYPE_PRECISION (ffecom_f2c_ftnlen_type_node)
< TYPE_PRECISION (string_type_node))
/* I/O will probably crash. */
warning ("configuration: char * holds %d bits, but ftnlen only %d",
TYPE_PRECISION (string_type_node),
TYPE_PRECISION (ffecom_f2c_ftnlen_type_node));
#endif
#if 0 /* ASSIGN-related stuff has been changed to accommodate this. */
if (TYPE_PRECISION (ffecom_integer_type_node)
< TYPE_PRECISION (string_type_node))
/* ASSIGN 10 TO I will crash. */
warning ("configuration: char * holds %d bits, but INTEGER only %d --\n\
ASSIGN statement might fail",
TYPE_PRECISION (string_type_node),
TYPE_PRECISION (ffecom_integer_type_node));
#endif
}
#endif
/* ffecom_init_2 -- Initialize
ffecom_init_2(); */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_init_2 ()
{
assert (ffecom_outer_function_decl_ == NULL_TREE);
assert (current_function_decl == NULL_TREE);
assert (ffecom_which_entrypoint_decl_ == NULL_TREE);
ffecom_master_arglist_ = NULL;
++ffecom_num_fns_;
ffecom_latest_temp_ = NULL;
ffecom_primary_entry_ = NULL;
ffecom_is_altreturning_ = FALSE;
ffecom_func_result_ = NULL_TREE;
ffecom_multi_retval_ = NULL_TREE;
}
#endif
/* ffecom_list_expr -- Transform list of exprs into gcc tree
tree t;
ffebld expr; // FFE opITEM list.
tree = ffecom_list_expr(expr);
List of actual args is transformed into corresponding gcc backend list. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_list_expr (ffebld expr)
{
tree list;
tree *plist = &list;
tree trail = NULL_TREE; /* Append char length args here. */
tree *ptrail = &trail;
tree length;
while (expr != NULL)
{
*plist
= build_tree_list (NULL_TREE, ffecom_arg_expr (ffebld_head (expr),
&length));
plist = &TREE_CHAIN (*plist);
expr = ffebld_trail (expr);
if (length != NULL_TREE)
{
*ptrail = build_tree_list (NULL_TREE, length);
ptrail = &TREE_CHAIN (*ptrail);
}
}
*plist = trail;
return list;
}
#endif
/* ffecom_list_ptr_to_expr -- Transform list of exprs into gcc tree
tree t;
ffebld expr; // FFE opITEM list.
tree = ffecom_list_ptr_to_expr(expr);
List of actual args is transformed into corresponding gcc backend list for
use in calling an external procedure (vs. a statement function). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_list_ptr_to_expr (ffebld expr)
{
tree list;
tree *plist = &list;
tree trail = NULL_TREE; /* Append char length args here. */
tree *ptrail = &trail;
tree length;
while (expr != NULL)
{
*plist
= build_tree_list (NULL_TREE,
ffecom_arg_ptr_to_expr (ffebld_head (expr),
&length));
plist = &TREE_CHAIN (*plist);
expr = ffebld_trail (expr);
if (length != NULL_TREE)
{
*ptrail = build_tree_list (NULL_TREE, length);
ptrail = &TREE_CHAIN (*ptrail);
}
}
*plist = trail;
return list;
}
#endif
/* Obtain gcc's LABEL_DECL tree for label. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_lookup_label (ffelab label)
{
tree glabel;
if (ffelab_hook (label) == NULL_TREE)
{
char labelname[16];
switch (ffelab_type (label))
{
case FFELAB_typeLOOPEND:
case FFELAB_typeNOTLOOP:
case FFELAB_typeENDIF:
sprintf (labelname, "%" ffelabValue_f "u", ffelab_value (label));
glabel = build_decl (LABEL_DECL, get_identifier (labelname),
void_type_node);
DECL_CONTEXT (glabel) = current_function_decl;
DECL_MODE (glabel) = VOIDmode;
break;
case FFELAB_typeFORMAT:
push_obstacks_nochange ();
end_temporary_allocation ();
glabel = build_decl (VAR_DECL,
ffecom_get_invented_identifier
("__g77_format_%d", NULL,
(int) ffelab_value (label)),
build_type_variant (build_array_type
(char_type_node,
NULL_TREE),
1, 0));
TREE_CONSTANT (glabel) = 1;
TREE_STATIC (glabel) = 1;
DECL_CONTEXT (glabel) = 0;
DECL_INITIAL (glabel) = NULL;
make_decl_rtl (glabel, NULL, 0);
expand_decl (glabel);
resume_temporary_allocation ();
pop_obstacks ();
break;
case FFELAB_typeANY:
glabel = error_mark_node;
break;
default:
assert ("bad label type" == NULL);
glabel = NULL;
break;
}
ffelab_set_hook (label, glabel);
}
else
{
glabel = ffelab_hook (label);
}
return glabel;
}
#endif
/* Stabilizes the arguments. Don't use this if the lhs and rhs come from
a single source specification (as in the fourth argument of MVBITS).
If the type is NULL_TREE, the type of lhs is used to make the type of
the MODIFY_EXPR. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_modify (tree newtype, tree lhs,
tree rhs)
{
if (lhs == error_mark_node || rhs == error_mark_node)
return error_mark_node;
if (newtype == NULL_TREE)
newtype = TREE_TYPE (lhs);
if (TREE_SIDE_EFFECTS (lhs))
lhs = stabilize_reference (lhs);
return ffecom_2s (MODIFY_EXPR, newtype, lhs, rhs);
}
#endif
/* Register source file name. */
void
ffecom_file (char *name)
{
#if FFECOM_GCC_INCLUDE
ffecom_file_ (name);
#endif
}
/* ffecom_notify_init_storage -- An aggregate storage is now fully init'ed
ffestorag st;
ffecom_notify_init_storage(st);
Gets called when all possible units in an aggregate storage area (a LOCAL
with equivalences or a COMMON) have been initialized. The initialization
info either is in ffestorag_init or, if that is NULL,
ffestorag_accretion:
ffestorag_init may contain an opCONTER or opARRTER. opCONTER may occur
even for an array if the array is one element in length!
ffestorag_accretion will contain an opACCTER. It is much like an
opARRTER except it has an ffebit object in it instead of just a size.
The back end can use the info in the ffebit object, if it wants, to
reduce the amount of actual initialization, but in any case it should
kill the ffebit object when done. Also, set accretion to NULL but
init to a non-NULL value.
After performing initialization, DO NOT set init to NULL, because that'll
tell the front end it is ok for more initialization to happen. Instead,
set init to an opANY expression or some such thing that you can use to
tell that you've already initialized the object.
27-Oct-91 JCB 1.1
Support two-pass FFE. */
void
ffecom_notify_init_storage (ffestorag st)
{
ffebld init; /* The initialization expression. */
#if 0 && FFECOM_targetCURRENT == FFECOM_targetGCC
ffetargetOffset size; /* The size of the entity. */
ffetargetAlign pad; /* Its initial padding. */
#endif
if (ffestorag_init (st) == NULL)
{
init = ffestorag_accretion (st);
assert (init != NULL);
ffestorag_set_accretion (st, NULL);
ffestorag_set_accretes (st, 0);
#if 0 && FFECOM_targetCURRENT == FFECOM_targetGCC
/* For GNU backend, just turn ACCTER into ARRTER and proceed. */
size = ffebld_accter_size (init);
pad = ffebld_accter_pad (init);
ffebit_kill (ffebld_accter_bits (init));
ffebld_set_op (init, FFEBLD_opARRTER);
ffebld_set_arrter (init, ffebld_accter (init));
ffebld_arrter_set_size (init, size);
ffebld_arrter_set_pad (init, size);
#endif
#if FFECOM_TWOPASS
ffestorag_set_init (st, init);
#endif
}
#if FFECOM_ONEPASS
else
init = ffestorag_init (st);
#endif
#if FFECOM_ONEPASS /* Process the inits, wipe 'em out. */
ffestorag_set_init (st, ffebld_new_any ());
if (ffebld_op (init) == FFEBLD_opANY)
return; /* Oh, we already did this! */
#if FFECOM_targetCURRENT == FFECOM_targetFFE
{
ffesymbol s;
if (ffestorag_symbol (st) != NULL)
s = ffestorag_symbol (st);
else
s = ffestorag_typesymbol (st);
fprintf (dmpout, "= initialize_storage \"%s\" ",
(s != NULL) ? ffesymbol_text (s) : "(unnamed)");
ffebld_dump (init);
fputc ('\n', dmpout);
}
#endif
#endif /* if FFECOM_ONEPASS */
}
/* ffecom_notify_init_symbol -- A symbol is now fully init'ed
ffesymbol s;
ffecom_notify_init_symbol(s);
Gets called when all possible units in a symbol (not placed in COMMON
or involved in EQUIVALENCE, unless it as yet has no ffestorag object)
have been initialized. The initialization info either is in
ffesymbol_init or, if that is NULL, ffesymbol_accretion:
ffesymbol_init may contain an opCONTER or opARRTER. opCONTER may occur
even for an array if the array is one element in length!
ffesymbol_accretion will contain an opACCTER. It is much like an
opARRTER except it has an ffebit object in it instead of just a size.
The back end can use the info in the ffebit object, if it wants, to
reduce the amount of actual initialization, but in any case it should
kill the ffebit object when done. Also, set accretion to NULL but
init to a non-NULL value.
After performing initialization, DO NOT set init to NULL, because that'll
tell the front end it is ok for more initialization to happen. Instead,
set init to an opANY expression or some such thing that you can use to
tell that you've already initialized the object.
27-Oct-91 JCB 1.1
Support two-pass FFE. */
void
ffecom_notify_init_symbol (ffesymbol s)
{
ffebld init; /* The initialization expression. */
#if 0 && FFECOM_targetCURRENT == FFECOM_targetGCC
ffetargetOffset size; /* The size of the entity. */
ffetargetAlign pad; /* Its initial padding. */
#endif
if (ffesymbol_storage (s) == NULL)
return; /* Do nothing until COMMON/EQUIVALENCE
possibilities checked. */
if ((ffesymbol_init (s) == NULL)
&& ((init = ffesymbol_accretion (s)) != NULL))
{
ffesymbol_set_accretion (s, NULL);
ffesymbol_set_accretes (s, 0);
#if 0 && FFECOM_targetCURRENT == FFECOM_targetGCC
/* For GNU backend, just turn ACCTER into ARRTER and proceed. */
size = ffebld_accter_size (init);
pad = ffebld_accter_pad (init);
ffebit_kill (ffebld_accter_bits (init));
ffebld_set_op (init, FFEBLD_opARRTER);
ffebld_set_arrter (init, ffebld_accter (init));
ffebld_arrter_set_size (init, size);
ffebld_arrter_set_pad (init, size);
#endif
#if FFECOM_TWOPASS
ffesymbol_set_init (s, init);
#endif
}
#if FFECOM_ONEPASS
else
init = ffesymbol_init (s);
#endif
#if FFECOM_ONEPASS
ffesymbol_set_init (s, ffebld_new_any ());
if (ffebld_op (init) == FFEBLD_opANY)
return; /* Oh, we already did this! */
#if FFECOM_targetCURRENT == FFECOM_targetFFE
fprintf (dmpout, "= initialize_symbol \"%s\" ", ffesymbol_text (s));
ffebld_dump (init);
fputc ('\n', dmpout);
#endif
#endif /* if FFECOM_ONEPASS */
}
/* ffecom_notify_primary_entry -- Learn which is the primary entry point
ffesymbol s;
ffecom_notify_primary_entry(s);
Gets called when implicit or explicit PROGRAM statement seen or when
FUNCTION, SUBROUTINE, or BLOCK DATA statement seen, with the primary
global symbol that serves as the entry point. */
void
ffecom_notify_primary_entry (ffesymbol s)
{
ffecom_primary_entry_ = s;
ffecom_primary_entry_kind_ = ffesymbol_kind (s);
if ((ffecom_primary_entry_kind_ == FFEINFO_kindFUNCTION)
|| (ffecom_primary_entry_kind_ == FFEINFO_kindSUBROUTINE))
ffecom_primary_entry_is_proc_ = TRUE;
else
ffecom_primary_entry_is_proc_ = FALSE;
if (!ffe_is_silent ())
{
if (ffecom_primary_entry_kind_ == FFEINFO_kindPROGRAM)
fprintf (stderr, "%s:\n", ffesymbol_text (s));
else
fprintf (stderr, " %s:\n", ffesymbol_text (s));
}
#if FFECOM_targetCURRENT == FFECOM_targetGCC
if (ffecom_primary_entry_kind_ == FFEINFO_kindSUBROUTINE)
{
ffebld list;
ffebld arg;
for (list = ffesymbol_dummyargs (s);
list != NULL;
list = ffebld_trail (list))
{
arg = ffebld_head (list);
if (ffebld_op (arg) == FFEBLD_opSTAR)
{
ffecom_is_altreturning_ = TRUE;
break;
}
}
}
#endif
}
FILE *
ffecom_open_include (char *name, ffewhereLine l, ffewhereColumn c)
{
#if FFECOM_GCC_INCLUDE
return ffecom_open_include_ (name, l, c);
#else
return fopen (name, "r");
#endif
}
/* Clean up after making automatically popped call-arg temps.
Call this in pairs with push_calltemps around calls to
ffecom_arg_ptr_to_expr if the latter might use temporaries.
Any temporaries made within the outermost sequence of
push_calltemps and pop_calltemps, that are marked as "auto-pop"
meaning they won't be explicitly popped (freed), are popped
at this point so they can be reused later.
NOTE: when called by ffecom_gen_sfuncdef_, ffecom_pending_calls_
should come in == 1, and all of the in-use auto-pop temps
should have DECL_CONTEXT (temp->t) == current_function_decl.
Moreover, these temps should _never_ be re-used in future
calls to ffecom_push_tempvar -- since current_function_decl will
never be the same again.
SO, it could be a minor win in terms of compile time to just
strip these temps off the list. That is, if the above assumptions
are correct, just remove from the list of temps any temp
that is both in-use and has DECL_CONTEXT (temp->t)
== current_function_decl, when called from ffecom_gen_sfuncdef_. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_pop_calltemps ()
{
ffecomTemp_ temp;
assert (ffecom_pending_calls_ > 0);
if (--ffecom_pending_calls_ == 0)
for (temp = ffecom_latest_temp_; temp != NULL; temp = temp->next)
if (temp->auto_pop)
temp->in_use = FALSE;
}
#endif
/* Mark latest temp with given tree as no longer in use. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_pop_tempvar (tree t)
{
ffecomTemp_ temp;
for (temp = ffecom_latest_temp_; temp != NULL; temp = temp->next)
if (temp->in_use && (temp->t == t))
{
assert (!temp->auto_pop);
temp->in_use = FALSE;
return;
}
else
assert (temp->t != t);
assert ("couldn't ffecom_pop_tempvar!" != NULL);
}
#endif
/* ffecom_ptr_to_expr -- Transform expr into gcc tree with & in front
tree t;
ffebld expr; // FFE expression.
tree = ffecom_ptr_to_expr(expr);
Like ffecom_expr, but sticks address-of in front of most things. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_ptr_to_expr (ffebld expr)
{
tree item;
ffeinfoBasictype bt;
ffeinfoKindtype kt;
ffesymbol s;
assert (expr != NULL);
switch (ffebld_op (expr))
{
case FFEBLD_opSYMTER:
s = ffebld_symter (expr);
if (ffesymbol_where (s) == FFEINFO_whereINTRINSIC)
{
ffecomGfrt ix;
ix = ffeintrin_gfrt_indirect (ffebld_symter_implementation (expr));
assert (ix != FFECOM_gfrt);
if ((item = ffecom_gfrt_[ix]) == NULL_TREE)
{
ffecom_make_gfrt_ (ix);
item = ffecom_gfrt_[ix];
}
}
else
{
item = ffesymbol_hook (s).decl_tree;
if (item == NULL_TREE)
{
s = ffecom_sym_transform_ (s);
item = ffesymbol_hook (s).decl_tree;
}
}
assert (item != NULL);
if (item == error_mark_node)
return item;
if (!ffesymbol_hook (s).addr)
item = ffecom_1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (item)),
item);
return item;
case FFEBLD_opARRAYREF:
{
ffebld dims[FFECOM_dimensionsMAX];
tree array;
int i;
item = ffecom_ptr_to_expr (ffebld_left (expr));
if (item == error_mark_node)
return item;
if ((ffeinfo_where (ffebld_info (expr)) == FFEINFO_whereFLEETING)
&& !mark_addressable (item))
return error_mark_node; /* Make sure non-const ref is to
non-reg. */
/* Build up ARRAY_REFs in reverse order (since we're column major
here in Fortran land). */
for (i = 0, expr = ffebld_right (expr);
expr != NULL;
expr = ffebld_trail (expr))
dims[i++] = ffebld_head (expr);
for (--i, array = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (item)));
i >= 0;
--i, array = TYPE_MAIN_VARIANT (TREE_TYPE (array)))
{
/* The initial subtraction should happen in the original type so
that (possible) negative values are handled appropriately. */
item
= ffecom_2 (PLUS_EXPR,
build_pointer_type (TREE_TYPE (array)),
item,
size_binop (MULT_EXPR,
size_in_bytes (TREE_TYPE (array)),
convert (sizetype,
fold (build (MINUS_EXPR,
TREE_TYPE (TYPE_MIN_VALUE (TYPE_DOMAIN (array))),
ffecom_expr (dims[i]),
TYPE_MIN_VALUE (TYPE_DOMAIN (array)))))));
}
}
return item;
case FFEBLD_opCONTER:
bt = ffeinfo_basictype (ffebld_info (expr));
kt = ffeinfo_kindtype (ffebld_info (expr));
item = ffecom_constantunion (&ffebld_constant_union
(ffebld_conter (expr)), bt, kt,
ffecom_tree_type[bt][kt]);
if (item == error_mark_node)
return error_mark_node;
item = ffecom_1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (item)),
item);
return item;
case FFEBLD_opANY:
return error_mark_node;
default:
assert (ffecom_pending_calls_ > 0);
bt = ffeinfo_basictype (ffebld_info (expr));
kt = ffeinfo_kindtype (ffebld_info (expr));
item = ffecom_expr (expr);
if (item == error_mark_node)
return error_mark_node;
/* The back end currently optimizes a bit too zealously for us, in that
we fail JCB001 if the following block of code is omitted. It checks
to see if the transformed expression is a symbol or array reference,
and encloses it in a SAVE_EXPR if that is the case. */
STRIP_NOPS (item);
if ((TREE_CODE (item) == VAR_DECL)
|| (TREE_CODE (item) == PARM_DECL)
|| (TREE_CODE (item) == RESULT_DECL)
|| (TREE_CODE (item) == INDIRECT_REF)
|| (TREE_CODE (item) == ARRAY_REF)
|| (TREE_CODE (item) == COMPONENT_REF)
#ifdef OFFSET_REF
|| (TREE_CODE (item) == OFFSET_REF)
#endif
|| (TREE_CODE (item) == BUFFER_REF)
|| (TREE_CODE (item) == REALPART_EXPR)
|| (TREE_CODE (item) == IMAGPART_EXPR))
{
item = ffecom_save_tree (item);
}
item = ffecom_1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (item)),
item);
return item;
}
assert ("fall-through error" == NULL);
return error_mark_node;
}
#endif
/* Prepare to make call-arg temps.
Call this in pairs with pop_calltemps around calls to
ffecom_arg_ptr_to_expr if the latter might use temporaries. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_push_calltemps ()
{
ffecom_pending_calls_++;
}
#endif
/* Obtain a temp var with given data type.
Returns a VAR_DECL tree of a currently (that is, at the current
statement being compiled) not in use and having the given data type,
making a new one if necessary. size is FFETARGET_charactersizeNONE
for a non-CHARACTER type or >= 0 for a CHARACTER type. elements is
-1 for a scalar or > 0 for an array of type. auto_pop is TRUE if
ffecom_pop_tempvar won't be called, meaning temp will be freed
when #pending calls goes to zero. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_push_tempvar (tree type, ffetargetCharacterSize size, int elements,
bool auto_pop)
{
ffecomTemp_ temp;
int yes;
tree t;
static int mynumber;
assert (!auto_pop || (ffecom_pending_calls_ > 0));
if (type == error_mark_node)
return error_mark_node;
for (temp = ffecom_latest_temp_; temp != NULL; temp = temp->next)
{
if (temp->in_use
|| (temp->type != type)
|| (temp->size != size)
|| (temp->elements != elements)
|| (DECL_CONTEXT (temp->t) != current_function_decl))
continue;
temp->in_use = TRUE;
temp->auto_pop = auto_pop;
return temp->t;
}
/* Create a new temp. */
yes = suspend_momentary ();
if (size != FFETARGET_charactersizeNONE)
type = build_array_type (type,
build_range_type (ffecom_f2c_ftnlen_type_node,
ffecom_f2c_ftnlen_one_node,
build_int_2 (size, 0)));
if (elements != -1)
type = build_array_type (type,
build_range_type (integer_type_node,
integer_zero_node,
build_int_2 (elements - 1,
0)));
t = build_decl (VAR_DECL,
ffecom_get_invented_identifier ("__g77_expr_%d", NULL,
mynumber++),
type);
{ /* ~~~~ kludge alert here!!! else temp gets reused outside
a compound-statement sequence.... */
extern tree sequence_rtl_expr;
tree back_end_bug = sequence_rtl_expr;
sequence_rtl_expr = NULL_TREE;
t = start_decl (t, FALSE);
finish_decl (t, NULL_TREE, FALSE);
sequence_rtl_expr = back_end_bug;
}
resume_momentary (yes);
temp = malloc_new_kp (ffe_pool_program_unit (), "ffecomTemp_",
sizeof (*temp));
temp->next = ffecom_latest_temp_;
temp->type = type;
temp->t = t;
temp->size = size;
temp->elements = elements;
temp->in_use = TRUE;
temp->auto_pop = auto_pop;
ffecom_latest_temp_ = temp;
return t;
}
#endif
/* ffecom_return_expr -- Returns return-value expr given alt return expr
tree rtn; // NULL_TREE means use expand_null_return()
ffebld expr; // NULL if no alt return expr to RETURN stmt
rtn = ffecom_return_expr(expr);
Based on the program unit type and other info (like return function
type, return master function type when alternate ENTRY points,
whether subroutine has any alternate RETURN points, etc), returns the
appropriate expression to be returned to the caller, or NULL_TREE
meaning no return value or the caller expects it to be returned somewhere
else (which is handled by other parts of this module). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_return_expr (ffebld expr)
{
tree rtn;
switch (ffecom_primary_entry_kind_)
{
case FFEINFO_kindPROGRAM:
case FFEINFO_kindBLOCKDATA:
rtn = NULL_TREE;
break;
case FFEINFO_kindSUBROUTINE:
if (!ffecom_is_altreturning_)
rtn = NULL_TREE; /* No alt returns, never an expr. */
else if (expr == NULL)
rtn = integer_zero_node;
else
rtn = ffecom_expr (expr);
break;
case FFEINFO_kindFUNCTION:
if ((ffecom_multi_retval_ != NULL_TREE)
|| (ffesymbol_basictype (ffecom_primary_entry_)
== FFEINFO_basictypeCHARACTER)
|| ((ffesymbol_basictype (ffecom_primary_entry_)
== FFEINFO_basictypeCOMPLEX)
&& (ffecom_num_entrypoints_ == 0)
&& ffesymbol_is_f2c (ffecom_primary_entry_)))
{ /* Value is returned by direct assignment
into (implicit) dummy. */
rtn = NULL_TREE;
break;
}
rtn = ffecom_func_result_;
#if 0
/* Spurious error if RETURN happens before first reference! So elide
this code. In particular, for debugging registry, rtn should always
be non-null after all, but TREE_USED won't be set until we encounter
a reference in the code. Perfectly okay (but weird) code that,
e.g., has "GOTO 20;10 RETURN;20 RTN=0;GOTO 10", would result in
this diagnostic for no reason. Have people use -O -Wuninitialized
and leave it to the back end to find obviously weird cases. */
/* Used to "assert(rtn != NULL_TREE);" here, but it's kind of a valid
situation; if the return value has never been referenced, it won't
have a tree under 2pass mode. */
if ((rtn == NULL_TREE)
|| !TREE_USED (rtn))
{
ffebad_start (FFEBAD_RETURN_VALUE_UNSET);
ffebad_here (0, ffesymbol_where_line (ffecom_primary_entry_),
ffesymbol_where_column (ffecom_primary_entry_));
ffebad_string (ffesymbol_text (ffesymbol_funcresult
(ffecom_primary_entry_)));
ffebad_finish ();
}
#endif
break;
default:
assert ("bad unit kind" == NULL);
case FFEINFO_kindANY:
rtn = error_mark_node;
break;
}
return rtn;
}
#endif
/* Do save_expr only if tree is not error_mark_node. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_save_tree (tree t)
{
return save_expr (t);
}
#endif
/* Public entry point for front end to access start_decl. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_start_decl (tree decl, bool is_initialized)
{
DECL_INITIAL (decl) = is_initialized ? error_mark_node : NULL_TREE;
return start_decl (decl, FALSE);
}
#endif
/* ffecom_sym_commit -- Symbol's state being committed to reality
ffesymbol s;
ffecom_sym_commit(s);
Does whatever the backend needs when a symbol is committed after having
been backtrackable for a period of time. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_sym_commit (ffesymbol s UNUSED)
{
assert (!ffesymbol_retractable ());
}
#endif
/* ffecom_sym_end_transition -- Perform end transition on all symbols
ffecom_sym_end_transition();
Does backend-specific stuff and also calls ffest_sym_end_transition
to do the necessary FFE stuff.
Backtracking is never enabled when this fn is called, so don't worry
about it. */
ffesymbol
ffecom_sym_end_transition (ffesymbol s)
{
ffestorag st;
assert (!ffesymbol_retractable ());
s = ffest_sym_end_transition (s);
#if FFECOM_targetCURRENT == FFECOM_targetGCC
if ((ffesymbol_kind (s) == FFEINFO_kindBLOCKDATA)
&& (ffesymbol_where (s) == FFEINFO_whereGLOBAL))
{
ffecom_list_blockdata_
= ffebld_new_item (ffebld_new_symter (s, FFEINTRIN_genNONE,
FFEINTRIN_specNONE,
FFEINTRIN_impNONE),
ffecom_list_blockdata_);
}
#endif
/* This is where we finally notice that a symbol has partial initialization
and finalize it. */
if (ffesymbol_accretion (s) != NULL)
{
assert (ffesymbol_init (s) == NULL);
ffecom_notify_init_symbol (s);
}
else if (((st = ffesymbol_storage (s)) != NULL)
&& ((st = ffestorag_parent (st)) != NULL)
&& (ffestorag_accretion (st) != NULL))
{
assert (ffestorag_init (st) == NULL);
ffecom_notify_init_storage (st);
}
#if FFECOM_targetCURRENT == FFECOM_targetGCC
if ((ffesymbol_kind (s) == FFEINFO_kindCOMMON)
&& (ffesymbol_where (s) == FFEINFO_whereLOCAL)
&& (ffesymbol_storage (s) != NULL))
{
ffecom_list_common_
= ffebld_new_item (ffebld_new_symter (s, FFEINTRIN_genNONE,
FFEINTRIN_specNONE,
FFEINTRIN_impNONE),
ffecom_list_common_);
}
#endif
return s;
}
/* ffecom_sym_exec_transition -- Perform exec transition on all symbols
ffecom_sym_exec_transition();
Does backend-specific stuff and also calls ffest_sym_exec_transition
to do the necessary FFE stuff.
See the long-winded description in ffecom_sym_learned for info
on handling the situation where backtracking is inhibited. */
ffesymbol
ffecom_sym_exec_transition (ffesymbol s)
{
s = ffest_sym_exec_transition (s);
return s;
}
/* ffecom_sym_learned -- Initial or more info gained on symbol after exec
ffesymbol s;
s = ffecom_sym_learned(s);
Called when a new symbol is seen after the exec transition or when more
info (perhaps) is gained for an UNCERTAIN symbol. The symbol state when
it arrives here is that all its latest info is updated already, so its
state may be UNCERTAIN or UNDERSTOOD, it might already have the hook
field filled in if its gone through here or exec_transition first, and
so on.
The backend probably wants to check ffesymbol_retractable() to see if
backtracking is in effect. If so, the FFE's changes to the symbol may
be retracted (undone) or committed (ratified), at which time the
appropriate ffecom_sym_retract or _commit function will be called
for that function.
If the backend has its own backtracking mechanism, great, use it so that
committal is a simple operation. Though it doesn't make much difference,
I suppose: the reason for tentative symbol evolution in the FFE is to
enable error detection in weird incorrect statements early and to disable
incorrect error detection on a correct statement. The backend is not
likely to introduce any information that'll get involved in these
considerations, so it is probably just fine that the implementation
model for this fn and for _exec_transition is to not do anything
(besides the required FFE stuff) if ffesymbol_retractable() returns TRUE
and instead wait until ffecom_sym_commit is called (which it never
will be as long as we're using ambiguity-detecting statement analysis in
the FFE, which we are initially to shake out the code, but don't depend
on this), otherwise go ahead and do whatever is needed.
In essence, then, when this fn and _exec_transition get called while
backtracking is enabled, a general mechanism would be to flag which (or
both) of these were called (and in what order? neat question as to what
might happen that I'm too lame to think through right now) and then when
_commit is called reproduce the original calling sequence, if any, for
the two fns (at which point backtracking will, of course, be disabled). */
ffesymbol
ffecom_sym_learned (ffesymbol s)
{
ffestorag_exec_layout (s);
return s;
}
/* ffecom_sym_retract -- Symbol's state being retracted from reality
ffesymbol s;
ffecom_sym_retract(s);
Does whatever the backend needs when a symbol is retracted after having
been backtrackable for a period of time. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
void
ffecom_sym_retract (ffesymbol s UNUSED)
{
assert (!ffesymbol_retractable ());
#if 0 /* GCC doesn't commit any backtrackable sins,
so nothing needed here. */
switch (ffesymbol_hook (s).state)
{
case 0: /* nothing happened yet. */
break;
case 1: /* exec transition happened. */
break;
case 2: /* learned happened. */
break;
case 3: /* learned then exec. */
break;
case 4: /* exec then learned. */
break;
default:
assert ("bad hook state" == NULL);
break;
}
#endif
}
#endif
/* Create temporary gcc label. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_temp_label ()
{
tree glabel;
static int mynumber = 0;
glabel = build_decl (LABEL_DECL,
ffecom_get_invented_identifier ("__g77_label_%d",
NULL,
mynumber++),
void_type_node);
DECL_CONTEXT (glabel) = current_function_decl;
DECL_MODE (glabel) = VOIDmode;
return glabel;
}
#endif
/* Return an expression that is usable as an arg in a conditional context
(IF, DO WHILE, .NOT., and so on).
Use the one provided for the back end as of >2.6.0. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_truth_value (tree expr)
{
return truthvalue_conversion (expr);
}
#endif
/* Return the inversion of a truth value (the inversion of what
ffecom_truth_value builds).
Apparently invert_truthvalue, which is properly in the back end, is
enough for now, so just use it. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_truth_value_invert (tree expr)
{
return invert_truthvalue (ffecom_truth_value (expr));
}
#endif
/* Return PARM_DECL for arg#1 of master fn containing alternate ENTRY points
If the PARM_DECL already exists, return it, else create it. It's an
integer_type_node argument for the master function that implements a
subroutine or function with more than one entrypoint and is bound at
run time with the entrypoint number (0 for SUBROUTINE/FUNCTION, 1 for
first ENTRY statement, and so on). */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
tree
ffecom_which_entrypoint_decl ()
{
assert (ffecom_which_entrypoint_decl_ != NULL_TREE);
return ffecom_which_entrypoint_decl_;
}
#endif
/* The following sections consists of private and public functions
that have the same names and perform roughly the same functions
as counterparts in the C front end. Changes in the C front end
might affect how things should be done here. Only functions
needed by the back end should be public here; the rest should
be private (static in the C sense). Functions needed by other
g77 front-end modules should be accessed by them via public
ffecom_* names, which should themselves call private versions
in this section so the private versions are easy to recognize
when upgrading to a new gcc and finding interesting changes
in the front end.
Functions named after rule "foo:" in c-parse.y are named
"bison_rule_foo_" so they are easy to find. */
#if FFECOM_targetCURRENT == FFECOM_targetGCC
static void
bison_rule_compstmt_ ()
{
emit_line_note (input_filename, lineno);
expand_end_bindings (getdecls (), 1, 1);
poplevel (1, 1, 0);
pop_momentary ();
}
static void
bison_rule_pushlevel_ ()
{
emit_line_note (input_filename, lineno);
pushlevel (0);
clear_last_expr ();
push_momentary ();
expand_start_bindings (0);
}
/* Return a definition for a builtin function named NAME and whose data type
is TYPE. TYPE should be a function type with argument types.
FUNCTION_CODE tells later passes how to compile calls to this function.
See tree.h for its possible values.
If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
the name to be called if we can't opencode the function. */
static tree
builtin_function (char *name, tree type,
enum built_in_function function_code, char *library_name)
{
tree decl = build_decl (FUNCTION_DECL, get_identifier (name), type);
DECL_EXTERNAL (decl) = 1;
TREE_PUBLIC (decl) = 1;
if (library_name)
DECL_ASSEMBLER_NAME (decl) = get_identifier (library_name);
make_decl_rtl (decl, NULL_PTR, 1);
pushdecl (decl);
if (function_code != NOT_BUILT_IN)
{
DECL_BUILT_IN (decl) = 1;
DECL_FUNCTION_CODE (decl) = function_code;
}
return decl;
}
/* Handle when a new declaration NEWDECL
has the same name as an old one OLDDECL
in the same binding contour.
Prints an error message if appropriate.
If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
Otherwise, return 0. */
static int
duplicate_decls (tree newdecl, tree olddecl)
{
int types_match = 1;
int new_is_definition = (TREE_CODE (newdecl) == FUNCTION_DECL
&& DECL_INITIAL (newdecl) != 0);
tree oldtype = TREE_TYPE (olddecl);
tree newtype = TREE_TYPE (newdecl);
if (olddecl == newdecl)
return 1;
if (TREE_CODE (newtype) == ERROR_MARK
|| TREE_CODE (oldtype) == ERROR_MARK)
types_match = 0;
/* New decl is completely inconsistent with the old one =>
tell caller to replace the old one.
This is always an error except in the case of shadowing a builtin. */
if (TREE_CODE (olddecl) != TREE_CODE (newdecl))
return 0;
/* For real parm decl following a forward decl,
return 1 so old decl will be reused. */
if (types_match && TREE_CODE (newdecl) == PARM_DECL
&& TREE_ASM_WRITTEN (olddecl) && ! TREE_ASM_WRITTEN (newdecl))
return 1;
/* The new declaration is the same kind of object as the old one.
The declarations may partially match. Print warnings if they don't
match enough. Ultimately, copy most of the information from the new
decl to the old one, and keep using the old one. */
if (TREE_CODE (olddecl) == FUNCTION_DECL
&& DECL_BUILT_IN (olddecl))
{
/* A function declaration for a built-in function. */
if (!TREE_PUBLIC (newdecl))
return 0;
else if (!types_match)
{
/* Accept the return type of the new declaration if same modes. */
tree oldreturntype = TREE_TYPE (TREE_TYPE (olddecl));
tree newreturntype = TREE_TYPE (TREE_TYPE (newdecl));
/* Make sure we put the new type in the same obstack as the old ones.
If the old types are not both in the same obstack, use the
permanent one. */
if (TYPE_OBSTACK (oldtype) == TYPE_OBSTACK (newtype))
push_obstacks (TYPE_OBSTACK (oldtype), TYPE_OBSTACK (oldtype));
else
{
push_obstacks_nochange ();
end_temporary_allocation ();
}
if (TYPE_MODE (oldreturntype) == TYPE_MODE (newreturntype))
{
/* Function types may be shared, so we can't just modify
the return type of olddecl's function type. */
tree newtype
= build_function_type (newreturntype,
TYPE_ARG_TYPES (TREE_TYPE (olddecl)));
types_match = 1;
if (types_match)
TREE_TYPE (olddecl) = newtype;
}
pop_obstacks ();
}
if (!types_match)
return 0;
}
else if (TREE_CODE (olddecl) == FUNCTION_DECL
&& DECL_SOURCE_LINE (olddecl) == 0)
{
/* A function declaration for a predeclared function
that isn't actually built in. */
if (!TREE_PUBLIC (newdecl))
return 0;
else if (!types_match)
{
/* If the types don't match, preserve volatility indication.
Later on, we will discard everything else about the
default declaration. */
TREE_THIS_VOLATILE (newdecl) |= TREE_THIS_VOLATILE (olddecl);
}
}
/* Copy all the DECL_... slots specified in the new decl
except for any that we copy here from the old type.
Past this point, we don't change OLDTYPE and NEWTYPE
even if we change the types of NEWDECL and OLDDECL. */
if (types_match)
{
/* Make sure we put the new type in the same obstack as the old ones.
If the old types are not both in the same obstack, use the permanent
one. */
if (TYPE_OBSTACK (oldtype) == TYPE_OBSTACK (newtype))
push_obstacks (TYPE_OBSTACK (oldtype), TYPE_OBSTACK (oldtype));
else
{
push_obstacks_nochange ();
end_temporary_allocation ();
}
/* Merge the data types specified in the two decls. */
if (TREE_CODE (newdecl) != FUNCTION_DECL || !DECL_BUILT_IN (olddecl))
TREE_TYPE (newdecl)
= TREE_TYPE (olddecl)
= TREE_TYPE (newdecl);
/* Lay the type out, unless already done. */
if (oldtype != TREE_TYPE (newdecl))
{
if (TREE_TYPE (newdecl) != error_mark_node)
layout_type (TREE_TYPE (newdecl));
if (TREE_CODE (newdecl) != FUNCTION_DECL
&& TREE_CODE (newdecl) != TYPE_DECL
&& TREE_CODE (newdecl) != CONST_DECL)
layout_decl (newdecl, 0);
}
else
{
/* Since the type is OLDDECL's, make OLDDECL's size go with. */
DECL_SIZE (newdecl) = DECL_SIZE (olddecl);
if (TREE_CODE (olddecl) != FUNCTION_DECL)
if (DECL_ALIGN (olddecl) > DECL_ALIGN (newdecl))
DECL_ALIGN (newdecl) = DECL_ALIGN (olddecl);
}
/* Keep the old rtl since we can safely use it. */
DECL_RTL (newdecl) = DECL_RTL (olddecl);
/* Merge the type qualifiers. */
if (DECL_BUILT_IN_NONANSI (olddecl) && TREE_THIS_VOLATILE (olddecl)
&& !TREE_THIS_VOLATILE (newdecl))
TREE_THIS_VOLATILE (olddecl) = 0;
if (TREE_READONLY (newdecl))
TREE_READONLY (olddecl) = 1;
if (TREE_THIS_VOLATILE (newdecl))
{
TREE_THIS_VOLATILE (olddecl) = 1;
if (TREE_CODE (newdecl) == VAR_DECL)
make_var_volatile (newdecl);
}
/* Keep source location of definition rather than declaration.
Likewise, keep decl at outer scope. */
if ((DECL_INITIAL (newdecl) == 0 && DECL_INITIAL (olddecl) != 0)
|| (DECL_CONTEXT (newdecl) != 0 && DECL_CONTEXT (olddecl) == 0))
{
DECL_SOURCE_LINE (newdecl) = DECL_SOURCE_LINE (olddecl);
DECL_SOURCE_FILE (newdecl) = DECL_SOURCE_FILE (olddecl);
if (DECL_CONTEXT (olddecl) == 0
&& TREE_CODE (newdecl) != FUNCTION_DECL)
DECL_CONTEXT (newdecl) = 0;
}
/* Merge the unused-warning information. */
if (DECL_IN_SYSTEM_HEADER (olddecl))
DECL_IN_SYSTEM_HEADER (newdecl) = 1;
else if (DECL_IN_SYSTEM_HEADER (newdecl))
DECL_IN_SYSTEM_HEADER (olddecl) = 1;
/* Merge the initialization information. */
if (DECL_INITIAL (newdecl) == 0)
DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
/* Merge the section attribute.
We want to issue an error if the sections conflict but that must be
done later in decl_attributes since we are called before attributes
are assigned. */
if (DECL_SECTION_NAME (newdecl) == NULL_TREE)
DECL_SECTION_NAME (newdecl) = DECL_SECTION_NAME (olddecl);
#if BUILT_FOR_270
if (TREE_CODE (newdecl) == FUNCTION_DECL)
{
DECL_STATIC_CONSTRUCTOR(newdecl) |= DECL_STATIC_CONSTRUCTOR(olddecl);
DECL_STATIC_DESTRUCTOR (newdecl) |= DECL_STATIC_DESTRUCTOR (olddecl);
}
#endif
pop_obstacks ();
}
/* If cannot merge, then use the new type and qualifiers,
and don't preserve the old rtl. */
else
{
TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
TREE_READONLY (olddecl) = TREE_READONLY (newdecl);
TREE_THIS_VOLATILE (olddecl) = TREE_THIS_VOLATILE (newdecl);
TREE_SIDE_EFFECTS (olddecl) = TREE_SIDE_EFFECTS (newdecl);
}
/* Merge the storage class information. */
/* For functions, static overrides non-static. */
if (TREE_CODE (newdecl) == FUNCTION_DECL)
{
TREE_PUBLIC (newdecl) &= TREE_PUBLIC (olddecl);
/* This is since we don't automatically
copy the attributes of NEWDECL into OLDDECL. */
TREE_PUBLIC (olddecl) = TREE_PUBLIC (newdecl);
/* If this clears `static', clear it in the identifier too. */
if (! TREE_PUBLIC (olddecl))
TREE_PUBLIC (DECL_NAME (olddecl)) = 0;
}
if (DECL_EXTERNAL (newdecl))
{
TREE_STATIC (newdecl) = TREE_STATIC (olddecl);
DECL_EXTERNAL (newdecl) = DECL_EXTERNAL (olddecl);
/* An extern decl does not override previous storage class. */
TREE_PUBLIC (newdecl) = TREE_PUBLIC (olddecl);
}
else
{
TREE_STATIC (olddecl) = TREE_STATIC (newdecl);
TREE_PUBLIC (olddecl) = TREE_PUBLIC (newdecl);
}
/* If either decl says `inline', this fn is inline,
unless its definition was passed already. */
if (DECL_INLINE (newdecl) && DECL_INITIAL (olddecl) == 0)
DECL_INLINE (olddecl) = 1;
DECL_INLINE (newdecl) = DECL_INLINE (olddecl);
/* Get rid of any built-in function if new arg types don't match it
or if we have a function definition. */
if (TREE_CODE (newdecl) == FUNCTION_DECL
&& DECL_BUILT_IN (olddecl)
&& (!types_match || new_is_definition))
{
TREE_TYPE (olddecl) = TREE_TYPE (newdecl);
DECL_BUILT_IN (olddecl) = 0;
}
/* If redeclaring a builtin function, and not a definition,
it stays built in.
Also preserve various other info from the definition. */
if (TREE_CODE (newdecl) == FUNCTION_DECL && !new_is_definition)
{
if (DECL_BUILT_IN (olddecl))
{
DECL_BUILT_IN (newdecl) = 1;
DECL_FUNCTION_CODE (newdecl) = DECL_FUNCTION_CODE (olddecl);
}
else
DECL_FRAME_SIZE (newdecl) = DECL_FRAME_SIZE (olddecl);
DECL_RESULT (newdecl) = DECL_RESULT (olddecl);
DECL_INITIAL (newdecl) = DECL_INITIAL (olddecl);
DECL_SAVED_INSNS (newdecl) = DECL_SAVED_INSNS (olddecl);
DECL_ARGUMENTS (newdecl) = DECL_ARGUMENTS (olddecl);
}
/* Copy most of the decl-specific fields of NEWDECL into OLDDECL.
But preserve olddecl's DECL_UID. */
{
register unsigned olddecl_uid = DECL_UID (olddecl);
memcpy ((char *) olddecl + sizeof (struct tree_common),
(char *) newdecl + sizeof (struct tree_common),
sizeof (struct tree_decl) - sizeof (struct tree_common));
DECL_UID (olddecl) = olddecl_uid;
}
return 1;
}
/* Finish processing of a declaration;
install its initial value.
If the length of an array type is not known before,
it must be determined now, from the initial value, or it is an error. */
static void
finish_decl (tree decl, tree init, bool is_top_level)
{
register tree type = TREE_TYPE (decl);
int was_incomplete = (DECL_SIZE (decl) == 0);
int temporary = allocation_temporary_p ();
bool at_top_level = (current_binding_level == global_binding_level);
bool top_level = is_top_level || at_top_level;
/* Caller should pass TRUE for is_top_level only if we wouldn't be at top
level anyway. */
assert (!is_top_level || !at_top_level);
if (TREE_CODE (decl) == PARM_DECL)
assert (init == NULL_TREE);
/* Remember that PARM_DECL doesn't have a DECL_INITIAL field per se -- it
overlaps DECL_ARG_TYPE. */
else if (init == NULL_TREE)
assert (DECL_INITIAL (decl) == NULL_TREE);
else
assert (DECL_INITIAL (decl) == error_mark_node);
if (init != NULL_TREE)
{
if (TREE_CODE (decl) != TYPE_DECL)
DECL_INITIAL (decl) = init;
else
{
/* typedef foo = bar; store the type of bar as the type of foo. */
TREE_TYPE (decl) = TREE_TYPE (init);
DECL_INITIAL (decl) = init = 0;
}
}
/* Pop back to the obstack that is current for this binding level. This is
because MAXINDEX, rtl, etc. to be made below must go in the permanent
obstack. But don't discard the temporary data yet. */
pop_obstacks ();
/* Deduce size of array from initialization, if not already known */
if (TREE_CODE (type) == ARRAY_TYPE
&& TYPE_DOMAIN (type) == 0
&& TREE_CODE (decl) != TYPE_DECL)
{
assert (top_level);
assert (was_incomplete);
layout_decl (decl, 0);
}
if (TREE_CODE (decl) == VAR_DECL)
{
if (DECL_SIZE (decl) == NULL_TREE
&& TYPE_SIZE (TREE_TYPE (decl)) != NULL_TREE)
layout_decl (decl, 0);
if (DECL_SIZE (decl) == NULL_TREE
&& (TREE_STATIC (decl)
?
/* A static variable with an incomplete type is an error if it is
initialized. Also if it is not file scope. Otherwise, let it
through, but if it is not `extern' then it may cause an error
message later. */
(DECL_INITIAL (decl) != 0 || DECL_CONTEXT (decl) != 0)
:
/* An automatic variable with an incomplete type is an error. */
!DECL_EXTERNAL (decl)))
{
assert ("storage size not known" == NULL);
abort ();
}
if ((DECL_EXTERNAL (decl) || TREE_STATIC (decl))
&& (DECL_SIZE (decl) != 0)
&& (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST))
{
assert ("storage size not constant" == NULL);
abort ();
}
}
/* Output the assembler code and/or RTL code for variables and functions,
unless the type is an undefined structure or union. If not, it will get
done when the type is completed. */
if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == FUNCTION_DECL)
{
rest_of_decl_compilation (decl, NULL,
DECL_CONTEXT (decl) == 0,
0);
if (DECL_CONTEXT (decl) != 0)
{
/* Recompute the RTL of a local array now if it used to be an
incomplete type. */
if (was_incomplete
&& !TREE_STATIC (decl) && !DECL_EXTERNAL (decl))
{
/* If we used it already as memory, it must stay in memory. */
TREE_ADDRESSABLE (decl) = TREE_USED (decl);
/* If it's still incomplete now, no init will save it. */
if (DECL_SIZE (decl) == 0)
DECL_INITIAL (decl) = 0;
expand_decl (decl);
}
/* Compute and store the initial value. */
if (TREE_CODE (decl) != FUNCTION_DECL)
expand_decl_init (decl);
}
}
else if (TREE_CODE (decl) == TYPE_DECL)
{
rest_of_decl_compilation (decl, NULL_PTR,
DECL_CONTEXT (decl) == 0,
0);
}
/* This test used to include TREE_PERMANENT, however, we have the same
problem with initializers at the function level. Such initializers get
saved until the end of the function on the momentary_obstack. */
if (!(TREE_CODE (decl) == FUNCTION_DECL && DECL_INLINE (decl))
&& temporary
/* DECL_INITIAL is not defined in PARM_DECLs, since it shares space with
DECL_ARG_TYPE. */
&& TREE_CODE (decl) != PARM_DECL)
{
/* We need to remember that this array HAD an initialization, but
discard the actual temporary nodes, since we can't have a permanent
node keep pointing to them. */
/* We make an exception for inline functions, since it's normal for a
local extern redeclaration of an inline function to have a copy of
the top-level decl's DECL_INLINE. */
if ((DECL_INITIAL (decl) != 0)
&& (DECL_INITIAL (decl) != error_mark_node))
{
/* If this is a const variable, then preserve the
initializer instead of discarding it so that we can optimize
references to it. */
/* This test used to include TREE_STATIC, but this won't be set
for function level initializers. */
if (TREE_READONLY (decl))
{
preserve_initializer ();
/* Hack? Set the permanent bit for something that is
permanent, but not on the permenent obstack, so as to
convince output_constant_def to make its rtl on the
permanent obstack. */
TREE_PERMANENT (DECL_INITIAL (decl)) = 1;
/* The initializer and DECL must have the same (or equivalent
types), but if the initializer is a STRING_CST, its type
might not be on the right obstack, so copy the type
of DECL. */
TREE_TYPE (DECL_INITIAL (decl)) = type;
}
else
DECL_INITIAL (decl) = error_mark_node;
}
}
/* If requested, warn about definitions of large data objects. */
if (warn_larger_than
&& (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
&& !DECL_EXTERNAL (decl))
{
register tree decl_size = DECL_SIZE (decl);
if (decl_size && TREE_CODE (decl_size) == INTEGER_CST)
{
unsigned units = TREE_INT_CST_LOW (decl_size) / BITS_PER_UNIT;
if (units > larger_than_size)
warning_with_decl (decl, "size of `%s' is %u bytes", units);
}
}
/* If we have gone back from temporary to permanent allocation, actually
free the temporary space that we no longer need. */
if (temporary && !allocation_temporary_p ())
permanent_allocation (0);
/* At the end of a declaration, throw away any variable type sizes of types
defined inside that declaration. There is no use computing them in the
following function definition. */
if (current_binding_level == global_binding_level)
get_pending_sizes ();
}
/* Finish up a function declaration and compile that function
all the way to assembler language output. The free the storage
for the function definition.
This is called after parsing the body of the function definition.
NESTED is nonzero if the function being finished is nested in another. */
static void
finish_function (int nested)
{
register tree fndecl = current_function_decl;
assert (fndecl != NULL_TREE);
if (TREE_CODE (fndecl) != ERROR_MARK)
{
if (nested)
assert (DECL_CONTEXT (fndecl) != NULL_TREE);
else
assert (DECL_CONTEXT (fndecl) == NULL_TREE);
}
/* TREE_READONLY (fndecl) = 1;
This caused &foo to be of type ptr-to-const-function
which then got a warning when stored in a ptr-to-function variable. */
poplevel (1, 0, 1);
if (TREE_CODE (fndecl) != ERROR_MARK)
{
BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl)) = fndecl;
/* Must mark the RESULT_DECL as being in this function. */
DECL_CONTEXT (DECL_RESULT (fndecl)) = fndecl;
/* Obey `register' declarations if `setjmp' is called in this fn. */
/* Generate rtl for function exit. */
expand_function_end (input_filename, lineno, 0);
/* So we can tell if jump_optimize sets it to 1. */
can_reach_end = 0;
/* Run the optimizers and output the assembler code for this function. */
rest_of_compilation (fndecl);
}
/* Free all the tree nodes making up this function. */
/* Switch back to allocating nodes permanently until we start another
function. */
if (!nested)
permanent_allocation (1);
if (DECL_SAVED_INSNS (fndecl) == 0 && !nested && (TREE_CODE (fndecl) != ERROR_MARK))
{
/* Stop pointing to the local nodes about to be freed. */
/* But DECL_INITIAL must remain nonzero so we know this was an actual
function definition. */
/* For a nested function, this is done in pop_f_function_context. */
/* If rest_of_compilation set this to 0, leave it 0. */
if (DECL_INITIAL (fndecl) != 0)
DECL_INITIAL (fndecl) = error_mark_node;
DECL_ARGUMENTS (fndecl) = 0;
}
if (!nested)
{
/* Let the error reporting routines know that we're outside a function.
For a nested function, this value is used in pop_c_function_context
and then reset via pop_function_context. */
ffecom_outer_function_decl_ = current_function_decl = NULL;
}
}
/* Plug-in replacement for identifying the name of a decl and, for a
function, what we call it in diagnostics. For now, "program unit"
should suffice, since it's a bit of a hassle to figure out which
of several kinds of things it is. Note that it could conceivably
be a statement function, which probably isn't really a program unit
per se, but if that comes up, it should be easy to check (being a
nested function and all). */
static char *
lang_printable_name (tree decl, int v)
{
/* Just to keep GCC quiet about the unused variable.
In theory, differing values of V should produce different
output. */
switch (v)
{
default:
if (TREE_CODE (decl) == ERROR_MARK)
return "erroneous code";
return IDENTIFIER_POINTER (DECL_NAME (decl));
}
}
/* g77's function to print out name of current function that caused
an error. */
#if BUILT_FOR_270
void
lang_print_error_function (file)
char *file;
{
static ffeglobal last_g = NULL;
static ffesymbol last_s = NULL;
ffeglobal g;
ffesymbol s;
char *kind;
if ((ffecom_primary_entry_ == NULL)
|| (ffesymbol_global (ffecom_primary_entry_) == NULL))
{
g = NULL;
s = NULL;
kind = NULL;
}
else
{
g = ffesymbol_global (ffecom_primary_entry_);
if (ffecom_nested_entry_ == NULL)
{
s = ffecom_primary_entry_;
switch (ffesymbol_kind (s))
{
case FFEINFO_kindFUNCTION:
kind = "function";
break;
case FFEINFO_kindSUBROUTINE:
kind = "subroutine";
break;
case FFEINFO_kindPROGRAM:
kind = "program";
break;
case FFEINFO_kindBLOCKDATA:
kind = "block-data";
break;
default:
kind = ffeinfo_kind_message (ffesymbol_kind (s));
break;
}
}
else
{
s = ffecom_nested_entry_;
kind = "statement function";
}
}
if ((last_g != g) || (last_s != s))
{
if (file)
fprintf (stderr, "%s: ", file);
if (s == NULL)
fprintf (stderr, "Outside of any program unit:\n");
else
{
char *name = ffesymbol_text (s);
fprintf (stderr, "In %s `%s':\n", kind, name);
}
last_g = g;
last_s = s;
}
}
#endif
/* Similar to `lookup_name' but look only at current binding level. */
static tree
lookup_name_current_level (tree name)
{
register tree t;
if (current_binding_level == global_binding_level)
return IDENTIFIER_GLOBAL_VALUE (name);
if (IDENTIFIER_LOCAL_VALUE (name) == 0)
return 0;
for (t = current_binding_level->names; t; t = TREE_CHAIN (t))
if (DECL_NAME (t) == name)
break;
return t;
}
/* Create a new `struct binding_level'. */
static struct binding_level *
make_binding_level ()
{
/* NOSTRICT */
return (struct binding_level *) xmalloc (sizeof (struct binding_level));
}
/* Save and restore the variables in this file and elsewhere
that keep track of the progress of compilation of the current function.
Used for nested functions. */
struct f_function
{
struct f_function *next;
tree named_labels;
tree shadowed_labels;
struct binding_level *binding_level;
};
struct f_function *f_function_chain;
/* Restore the variables used during compilation of a C function. */
static void
pop_f_function_context ()
{
struct f_function *p = f_function_chain;
tree link;
/* Bring back all the labels that were shadowed. */
for (link = shadowed_labels; link; link = TREE_CHAIN (link))
if (DECL_NAME (TREE_VALUE (link)) != 0)
IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link)))
= TREE_VALUE (link);
if (DECL_SAVED_INSNS (current_function_decl) == 0)
{
/* Stop pointing to the local nodes about to be freed. */
/* But DECL_INITIAL must remain nonzero so we know this was an actual
function definition. */
DECL_INITIAL (current_function_decl) = error_mark_node;
DECL_ARGUMENTS (current_function_decl) = 0;
}
pop_function_context ();
f_function_chain = p->next;
named_labels = p->named_labels;
shadowed_labels = p->shadowed_labels;
current_binding_level = p->binding_level;
free (p);
}
/* Save and reinitialize the variables
used during compilation of a C function. */
static void
push_f_function_context ()
{
struct f_function *p
= (struct f_function *) xmalloc (sizeof (struct f_function));
push_function_context ();
p->next = f_function_chain;
f_function_chain = p;
p->named_labels = named_labels;
p->shadowed_labels = shadowed_labels;
p->binding_level = current_binding_level;
}
static void
push_parm_decl (tree parm)
{
int old_immediate_size_expand = immediate_size_expand;
/* Don't try computing parm sizes now -- wait till fn is called. */
immediate_size_expand = 0;
push_obstacks_nochange ();
/* Fill in arg stuff. */
DECL_ARG_TYPE (parm) = TREE_TYPE (parm);
DECL_ARG_TYPE_AS_WRITTEN (parm) = TREE_TYPE (parm);
TREE_READONLY (parm) = 1; /* All implementation args are read-only. */
parm = pushdecl (parm);
immediate_size_expand = old_immediate_size_expand;
finish_decl (parm, NULL_TREE, FALSE);
}
/* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL, if appropriate. */
static tree
pushdecl_top_level (x)
tree x;
{
register tree t;
register struct binding_level *b = current_binding_level;
register tree f = current_function_decl;
current_binding_level = global_binding_level;
current_function_decl = NULL_TREE;
t = pushdecl (x);
current_binding_level = b;
current_function_decl = f;
return t;
}
/* Store the list of declarations of the current level.
This is done for the parameter declarations of a function being defined,
after they are modified in the light of any missing parameters. */
static tree
storedecls (decls)
tree decls;
{
return current_binding_level->names = decls;
}
/* Store the parameter declarations into the current function declaration.
This is called after parsing the parameter declarations, before
digesting the body of the function.
For an old-style definition, modify the function's type
to specify at least the number of arguments. */
static void
store_parm_decls (int is_main_program UNUSED)
{
register tree fndecl = current_function_decl;
/* This is a chain of PARM_DECLs from old-style parm declarations. */
DECL_ARGUMENTS (fndecl) = storedecls (nreverse (getdecls ()));
/* Initialize the RTL code for the function. */
init_function_start (fndecl, input_filename, lineno);
/* Set up parameters and prepare for return, for the function. */
expand_function_start (fndecl, 0);
}
static tree
start_decl (tree decl, bool is_top_level)
{
register tree tem;
bool at_top_level = (current_binding_level == global_binding_level);
bool top_level = is_top_level || at_top_level;
/* Caller should pass TRUE for is_top_level only if we wouldn't be at top
level anyway. */
assert (!is_top_level || !at_top_level);
/* The corresponding pop_obstacks is in finish_decl. */
push_obstacks_nochange ();
if (DECL_INITIAL (decl) != NULL_TREE)
{
assert (DECL_INITIAL (decl) == error_mark_node);
assert (!DECL_EXTERNAL (decl));
}
else if (top_level)
assert ((TREE_STATIC (decl) == 1) || DECL_EXTERNAL (decl) == 1);
/* For Fortran, we by default put things in .common when possible. */
DECL_COMMON (decl) = 1;
/* Add this decl to the current binding level. TEM may equal DECL or it may
be a previous decl of the same name. */
if (is_top_level)
tem = pushdecl_top_level (decl);
else
tem = pushdecl (decl);
/* For a local variable, define the RTL now. */
if (!top_level
/* But not if this is a duplicate decl and we preserved the rtl from the
previous one (which may or may not happen). */
&& DECL_RTL (tem) == 0)
{
if (TYPE_SIZE (TREE_TYPE (tem)) != 0)
expand_decl (tem);
else if (TREE_CODE (TREE_TYPE (tem)) == ARRAY_TYPE
&& DECL_INITIAL (tem) != 0)
expand_decl (tem);
}
if (DECL_INITIAL (tem) != NULL_TREE)
{
/* When parsing and digesting the initializer, use temporary storage.
Do this even if we will ignore the value. */
if (at_top_level)
temporary_allocation ();
}
return tem;
}
/* Create the FUNCTION_DECL for a function definition.
DECLSPECS and DECLARATOR are the parts of the declaration;
they describe the function's name and the type it returns,
but twisted together in a fashion that parallels the syntax of C.
This function creates a binding context for the function body
as well as setting up the FUNCTION_DECL in current_function_decl.
Returns 1 on success. If the DECLARATOR is not suitable for a function
(it defines a datum instead), we return 0, which tells
yyparse to report a parse error.
NESTED is nonzero for a function nested within another function. */
static void
start_function (tree name, tree type, int nested, int public)
{
tree decl1;
tree restype;
int old_immediate_size_expand = immediate_size_expand;
named_labels = 0;
shadowed_labels = 0;
/* Don't expand any sizes in the return type of the function. */
immediate_size_expand = 0;
if (nested)
{
assert (!public);
assert (current_function_decl != NULL_TREE);
assert (DECL_CONTEXT (current_function_decl) == NULL_TREE);
}
else
{
assert (current_function_decl == NULL_TREE);
}
if (TREE_CODE (type) == ERROR_MARK)
decl1 = current_function_decl = error_mark_node;
else
{
decl1 = build_decl (FUNCTION_DECL,
name,
type);
TREE_PUBLIC (decl1) = public ? 1 : 0;
if (nested)
DECL_INLINE (decl1) = 1;
TREE_STATIC (decl1) = 1;
DECL_EXTERNAL (decl1) = 0;
announce_function (decl1);
/* Make the init_value nonzero so pushdecl knows this is not tentative.
error_mark_node is replaced below (in poplevel) with the BLOCK. */
DECL_INITIAL (decl1) = error_mark_node;
/* Record the decl so that the function name is defined. If we already have
a decl for this name, and it is a FUNCTION_DECL, use the old decl. */
current_function_decl = pushdecl (decl1);
}
if (!nested)
ffecom_outer_function_decl_ = current_function_decl;
pushlevel (0);
if (TREE_CODE (current_function_decl) != ERROR_MARK)
{
make_function_rtl (current_function_decl);
restype = TREE_TYPE (TREE_TYPE (current_function_decl));
DECL_RESULT (current_function_decl)
= build_decl (RESULT_DECL, NULL_TREE, restype);
}
if (!nested)
/* Allocate further tree nodes temporarily during compilation of this
function only. */
temporary_allocation ();
if (!nested && (TREE_CODE (current_function_decl) != ERROR_MARK))
TREE_ADDRESSABLE (current_function_decl) = 1;
immediate_size_expand = old_immediate_size_expand;
}
/* Here are the public functions the GNU back end needs. */
/* This is used by the `assert' macro. It is provided in libgcc.a,
which `cc' doesn't know how to link. Note that the C++ front-end
no longer actually uses the `assert' macro (instead, it calls
my_friendly_assert). But all of the back-end files still need this. */
void
__eprintf (string, expression, line, filename)
#ifdef __STDC__
const char *string;
const char *expression;
unsigned line;
const char *filename;
#else
char *string;
char *expression;
unsigned line;
char *filename;
#endif
{
fprintf (stderr, string, expression, line, filename);
fflush (stderr);
abort ();
}
tree
convert (type, expr)
tree type, expr;
{
register tree e = expr;
register enum tree_code code = TREE_CODE (type);
if (type == TREE_TYPE (e)
|| TREE_CODE (e) == ERROR_MARK)
return e;
if (TYPE_MAIN_VARIANT (type) == TYPE_MAIN_VARIANT (TREE_TYPE (e)))
return fold (build1 (NOP_EXPR, type, e));
if (TREE_CODE (TREE_TYPE (e)) == ERROR_MARK
|| code == ERROR_MARK)
return error_mark_node;
if (TREE_CODE (TREE_TYPE (e)) == VOID_TYPE)
{
assert ("void value not ignored as it ought to be" == NULL);
return error_mark_node;
}
if (code == VOID_TYPE)
return build1 (CONVERT_EXPR, type, e);
if ((code != RECORD_TYPE)
&& (TREE_CODE (TREE_TYPE (e)) == RECORD_TYPE))
e = ffecom_1 (REALPART_EXPR, TREE_TYPE (TYPE_FIELDS (TREE_TYPE (e))),
e);
if (code == INTEGER_TYPE || code == ENUMERAL_TYPE)
return fold (convert_to_integer (type, e));
if (code == POINTER_TYPE)
return fold (convert_to_pointer (type, e));
if (code == REAL_TYPE)
return fold (convert_to_real (type, e));
if (code == COMPLEX_TYPE)
return fold (convert_to_complex (type, e));
if (code == RECORD_TYPE)
return fold (ffecom_convert_to_complex_ (type, e));
assert ("conversion to non-scalar type requested" == NULL);
return error_mark_node;
}
/* integrate_decl_tree calls this function, but since we don't use the
DECL_LANG_SPECIFIC field, this is a no-op. */
void
copy_lang_decl (node)
tree node UNUSED;
{
}
/* Return the list of declarations of the current level.
Note that this list is in reverse order unless/until
you nreverse it; and when you do nreverse it, you must
store the result back using `storedecls' or you will lose. */
tree
getdecls ()
{
return current_binding_level->names;
}
/* Nonzero if we are currently in the global binding level. */
int
global_bindings_p ()
{
return current_binding_level == global_binding_level;
}
/* Insert BLOCK at the end of the list of subblocks of the
current binding level. This is used when a BIND_EXPR is expanded,
to handle the BLOCK node inside the BIND_EXPR. */
void
incomplete_type_error (value, type)
tree value UNUSED;
tree type;
{
if (TREE_CODE (type) == ERROR_MARK)
return;
assert ("incomplete type?!?" == NULL);
}
void
init_decl_processing ()
{
malloc_init ();
ffe_init_0 ();
}
char *
init_parse (filename)
char *filename;
{
#if BUILT_FOR_270
extern void (*print_error_function) (char *);
#endif
/* Open input file. */
if (filename == 0 || !strcmp (filename, "-"))
{
finput = stdin;
filename = "stdin";
}
else
finput = fopen (filename, "r");
if (finput == 0)
pfatal_with_name (filename);
#ifdef IO_BUFFER_SIZE
setvbuf (finput, (char *) xmalloc (IO_BUFFER_SIZE), _IOFBF, IO_BUFFER_SIZE);
#endif
/* Make identifier nodes long enough for the language-specific slots. */
set_identifier_size (sizeof (struct lang_identifier));
decl_printable_name = lang_printable_name;
#if BUILT_FOR_270
print_error_function = lang_print_error_function;
#endif
return filename;
}
void
finish_parse ()
{
fclose (finput);
}
void
insert_block (block)
tree block;
{
TREE_USED (block) = 1;
current_binding_level->blocks
= chainon (current_binding_level->blocks, block);
}
int
lang_decode_option (argc, argv)
int argc;
char **argv;
{
return ffe_decode_option (argc, argv);
}
/* used by print-tree.c */
void
lang_print_xnode (file, node, indent)
FILE *file UNUSED;
tree node UNUSED;
int indent UNUSED;
{
}
void
lang_finish ()
{
ffe_terminate_0 ();
if (ffe_is_ffedebug ())
malloc_pool_display (malloc_pool_image ());
}
char *
lang_identify ()
{
return "f77";
}
void
lang_init_options ()
{
/* Set default options for Fortran. */
flag_move_all_movables = 1;
flag_reduce_all_givs = 1;
flag_argument_noalias = 2;
}
void
lang_init ()
{
/* If the file is output from cpp, it should contain a first line
`# 1 "real-filename"', and the current design of gcc (toplev.c
in particular and the way it sets up information relied on by
INCLUDE) requires that we read this now, and store the
"real-filename" info in master_input_filename. Ask the lexer
to try doing this. */
ffelex_hash_kludge (finput);
}
int
mark_addressable (exp)
tree exp;
{
register tree x = exp;
while (1)
switch (TREE_CODE (x))
{
case ADDR_EXPR:
case COMPONENT_REF:
case ARRAY_REF:
x = TREE_OPERAND (x, 0);
break;
case CONSTRUCTOR:
TREE_ADDRESSABLE (x) = 1;
return 1;
case VAR_DECL:
case CONST_DECL:
case PARM_DECL:
case RESULT_DECL:
if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x)
&& DECL_NONLOCAL (x))
{
if (TREE_PUBLIC (x))
{
assert ("address of global register var requested" == NULL);
return 0;
}
assert ("address of register variable requested" == NULL);
}
else if (DECL_REGISTER (x) && !TREE_ADDRESSABLE (x))
{
if (TREE_PUBLIC (x))
{
assert ("address of global register var requested" == NULL);
return 0;
}
assert ("address of register var requested" == NULL);
}
put_var_into_stack (x);
/* drops in */
case FUNCTION_DECL:
TREE_ADDRESSABLE (x) = 1;
#if 0 /* poplevel deals with this now. */
if (DECL_CONTEXT (x) == 0)
TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (x)) = 1;
#endif
default:
return 1;
}
}
/* If DECL has a cleanup, build and return that cleanup here.
This is a callback called by expand_expr. */
tree
maybe_build_cleanup (decl)
tree decl UNUSED;
{
/* There are no cleanups in Fortran. */
return NULL_TREE;
}
/* Exit a binding level.
Pop the level off, and restore the state of the identifier-decl mappings
that were in effect when this level was entered.
If KEEP is nonzero, this level had explicit declarations, so
and create a "block" (a BLOCK node) for the level
to record its declarations and subblocks for symbol table output.
If FUNCTIONBODY is nonzero, this level is the body of a function,
so create a block as if KEEP were set and also clear out all
label names.
If REVERSE is nonzero, reverse the order of decls before putting
them into the BLOCK. */
tree
poplevel (keep, reverse, functionbody)
int keep;
int reverse;
int functionbody;
{
register tree link;
/* The chain of decls was accumulated in reverse order. Put it into forward
order, just for cleanliness. */
tree decls;
tree subblocks = current_binding_level->blocks;
tree block = 0;
tree decl;
int block_previously_created;
/* Get the decls in the order they were written. Usually
current_binding_level->names is in reverse order. But parameter decls
were previously put in forward order. */
if (reverse)
current_binding_level->names
= decls = nreverse (current_binding_level->names);
else
decls = current_binding_level->names;
/* Output any nested inline functions within this block if they weren't
already output. */
for (decl = decls; decl; decl = TREE_CHAIN (decl))
if (TREE_CODE (decl) == FUNCTION_DECL
&& !TREE_ASM_WRITTEN (decl)
&& DECL_INITIAL (decl) != 0
&& TREE_ADDRESSABLE (decl))
{
/* If this decl was copied from a file-scope decl on account of a
block-scope extern decl, propagate TREE_ADDRESSABLE to the
file-scope decl. */
if (DECL_ABSTRACT_ORIGIN (decl) != 0)
TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl)) = 1;
else
{
push_function_context ();
output_inline_function (decl);
pop_function_context ();
}
}
/* If there were any declarations or structure tags in that level, or if
this level is a function body, create a BLOCK to record them for the
life of this function. */
block = 0;
block_previously_created = (current_binding_level->this_block != 0);
if (block_previously_created)
block = current_binding_level->this_block;
else if (keep || functionbody)
block = make_node (BLOCK);
if (block != 0)
{
BLOCK_VARS (block) = decls;
BLOCK_SUBBLOCKS (block) = subblocks;
remember_end_note (block);
}
/* In each subblock, record that this is its superior. */
for (link = subblocks; link; link = TREE_CHAIN (link))
BLOCK_SUPERCONTEXT (link) = block;
/* Clear out the meanings of the local variables of this level. */
for (link = decls; link; link = TREE_CHAIN (link))
{
if (DECL_NAME (link) != 0)
{
/* If the ident. was used or addressed via a local extern decl,
don't forget that fact. */
if (DECL_EXTERNAL (link))
{
if (TREE_USED (link))
TREE_USED (DECL_NAME (link)) = 1;
if (TREE_ADDRESSABLE (link))
TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (link)) = 1;
}
IDENTIFIER_LOCAL_VALUE (DECL_NAME (link)) = 0;
}
}
/* If the level being exited is the top level of a function, check over all
the labels, and clear out the current (function local) meanings of their
names. */
if (functionbody)
{
/* If this is the top level block of a function, the vars are the
function's parameters. Don't leave them in the BLOCK because they
are found in the FUNCTION_DECL instead. */
BLOCK_VARS (block) = 0;
}
/* Pop the current level, and free the structure for reuse. */
{
register struct binding_level *level = current_binding_level;
current_binding_level = current_binding_level->level_chain;
level->level_chain = free_binding_level;
free_binding_level = level;
}
/* Dispose of the block that we just made inside some higher level. */
if (functionbody)
DECL_INITIAL (current_function_decl) = block;
else if (block)
{
if (!block_previously_created)
current_binding_level->blocks
= chainon (current_binding_level->blocks, block);
}
/* If we did not make a block for the level just exited, any blocks made
for inner levels (since they cannot be recorded as subblocks in that
level) must be carried forward so they will later become subblocks of
something else. */
else if (subblocks)
current_binding_level->blocks
= chainon (current_binding_level->blocks, subblocks);
/* Set the TYPE_CONTEXTs for all of the tagged types belonging to this
binding contour so that they point to the appropriate construct, i.e.
either to the current FUNCTION_DECL node, or else to the BLOCK node we
just constructed.
Note that for tagged types whose scope is just the formal parameter list
for some function type specification, we can't properly set their
TYPE_CONTEXTs here, because we don't have a pointer to the appropriate
FUNCTION_TYPE node readily available to us. For those cases, the
TYPE_CONTEXTs of the relevant tagged type nodes get set in
`grokdeclarator' as soon as we have created the FUNCTION_TYPE node which
will represent the "scope" for these "parameter list local" tagged
types. */
if (block)
TREE_USED (block) = 1;
return block;
}
void
print_lang_decl (file, node, indent)
FILE *file UNUSED;
tree node UNUSED;
int indent UNUSED;
{
}
void
print_lang_identifier (file, node, indent)
FILE *file;
tree node;
int indent;
{
print_node (file, "global", IDENTIFIER_GLOBAL_VALUE (node), indent + 4);
print_node (file, "local", IDENTIFIER_LOCAL_VALUE (node), indent + 4);
}
void
print_lang_statistics ()
{
}
void
print_lang_type (file, node, indent)
FILE *file UNUSED;
tree node UNUSED;
int indent UNUSED;
{
}
/* Record a decl-node X as belonging to the current lexical scope.
Check for errors (such as an incompatible declaration for the same
name already seen in the same scope).
Returns either X or an old decl for the same name.
If an old decl is returned, it may have been smashed
to agree with what X says. */
tree
pushdecl (x)
tree x;
{
register tree t;
register tree name = DECL_NAME (x);
register struct binding_level *b = current_binding_level;
if ((TREE_CODE (x) == FUNCTION_DECL)
&& (DECL_INITIAL (x) == 0)
&& DECL_EXTERNAL (x))
DECL_CONTEXT (x) = NULL_TREE;
else
DECL_CONTEXT (x) = current_function_decl;
if (name)
{
if (IDENTIFIER_INVENTED (name))
{
#if BUILT_FOR_270
DECL_ARTIFICIAL (x) = 1;
#endif
DECL_IN_SYSTEM_HEADER (x) = 1;
DECL_IGNORED_P (x) = 1;
TREE_USED (x) = 1;
if (TREE_CODE (x) == TYPE_DECL)
TYPE_DECL_SUPPRESS_DEBUG (x) = 1;
}
t = lookup_name_current_level (name);
assert ((t == NULL_TREE) || (DECL_CONTEXT (x) == NULL_TREE));
/* Don't push non-parms onto list for parms until we understand
why we're doing this and whether it works. */
assert ((b == global_binding_level)
|| !ffecom_transform_only_dummies_
|| TREE_CODE (x) == PARM_DECL);
if ((t != NULL_TREE) && duplicate_decls (x, t))
return t;
/* If we are processing a typedef statement, generate a whole new
..._TYPE node (which will be just an variant of the existing
..._TYPE node with identical properties) and then install the
TYPE_DECL node generated to represent the typedef name as the
TYPE_NAME of this brand new (duplicate) ..._TYPE node.
The whole point here is to end up with a situation where each and every
..._TYPE node the compiler creates will be uniquely associated with
AT MOST one node representing a typedef name. This way, even though
the compiler substitutes corresponding ..._TYPE nodes for TYPE_DECL
(i.e. "typedef name") nodes very early on, later parts of the
compiler can always do the reverse translation and get back the
corresponding typedef name. For example, given:
typedef struct S MY_TYPE; MY_TYPE object;
Later parts of the compiler might only know that `object' was of type
`struct S' if it were not for code just below. With this code
however, later parts of the compiler see something like:
struct S' == struct S typedef struct S' MY_TYPE; struct S' object;
And they can then deduce (from the node for type struct S') that the
original object declaration was:
MY_TYPE object;
Being able to do this is important for proper support of protoize, and
also for generating precise symbolic debugging information which
takes full account of the programmer's (typedef) vocabulary.
Obviously, we don't want to generate a duplicate ..._TYPE node if the
TYPE_DECL node that we are now processing really represents a
standard built-in type.
Since all standard types are effectively declared at line zero in the
source file, we can easily check to see if we are working on a
standard type by checking the current value of lineno. */
if (TREE_CODE (x) == TYPE_DECL)
{
if (DECL_SOURCE_LINE (x) == 0)
{
if (TYPE_NAME (TREE_TYPE (x)) == 0)
TYPE_NAME (TREE_TYPE (x)) = x;
}
else if (TREE_TYPE (x) != error_mark_node)
{
tree tt = TREE_TYPE (x);
tt = build_type_copy (tt);
TYPE_NAME (tt) = x;
TREE_TYPE (x) = tt;
}
}
/* This name is new in its binding level. Install the new declaration
and return it. */
if (b == global_binding_level)
IDENTIFIER_GLOBAL_VALUE (name) = x;
else
IDENTIFIER_LOCAL_VALUE (name) = x;
}
/* Put decls on list in reverse order. We will reverse them later if
necessary. */
TREE_CHAIN (x) = b->names;
b->names = x;
return x;
}
/* Enter a new binding level.
If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
not for that of tags. */
void
pushlevel (tag_transparent)
int tag_transparent;
{
register struct binding_level *newlevel = NULL_BINDING_LEVEL;
assert (!tag_transparent);
/* Reuse or create a struct for this binding level. */
if (free_binding_level)
{
newlevel = free_binding_level;
free_binding_level = free_binding_level->level_chain;
}
else
{
newlevel = make_binding_level ();
}
/* Add this level to the front of the chain (stack) of levels that are
active. */
*newlevel = clear_binding_level;
newlevel->level_chain = current_binding_level;
current_binding_level = newlevel;
}
/* Set the BLOCK node for the innermost scope
(the one we are currently in). */
void
set_block (block)
register tree block;
{
current_binding_level->this_block = block;
}
/* ~~tree.h SHOULD declare this, because toplev.c references it. */
/* Can't 'yydebug' a front end not generated by yacc/bison! */
void
set_yydebug (value)
int value;
{
if (value)
fprintf (stderr, "warning: no yacc/bison-generated output to debug!\n");
}
tree
signed_or_unsigned_type (unsignedp, type)
int unsignedp;
tree type;
{
tree type2;
if (! INTEGRAL_TYPE_P (type))
return type;
if (TYPE_PRECISION (type) == TYPE_PRECISION (signed_char_type_node))
return unsignedp ? unsigned_char_type_node : signed_char_type_node;
if (TYPE_PRECISION (type) == TYPE_PRECISION (integer_type_node))
return unsignedp ? unsigned_type_node : integer_type_node;
if (TYPE_PRECISION (type) == TYPE_PRECISION (short_integer_type_node))
return unsignedp ? short_unsigned_type_node : short_integer_type_node;
if (TYPE_PRECISION (type) == TYPE_PRECISION (long_integer_type_node))
return unsignedp ? long_unsigned_type_node : long_integer_type_node;
if (TYPE_PRECISION (type) == TYPE_PRECISION (long_long_integer_type_node))
return (unsignedp ? long_long_unsigned_type_node
: long_long_integer_type_node);
type2 = type_for_size (TYPE_PRECISION (type), unsignedp);
if (type2 == NULL_TREE)
return type;
return type2;
}
tree
signed_type (type)
tree type;
{
tree type1 = TYPE_MAIN_VARIANT (type);
ffeinfoKindtype kt;
tree type2;
if (type1 == unsigned_char_type_node || type1 == char_type_node)
return signed_char_type_node;
if (type1 == unsigned_type_node)
return integer_type_node;
if (type1 == short_unsigned_type_node)
return short_integer_type_node;
if (type1 == long_unsigned_type_node)
return long_integer_type_node;
if (type1 == long_long_unsigned_type_node)
return long_long_integer_type_node;
#if 0 /* gcc/c-* files only */
if (type1 == unsigned_intDI_type_node)
return intDI_type_node;
if (type1 == unsigned_intSI_type_node)
return intSI_type_node;
if (type1 == unsigned_intHI_type_node)
return intHI_type_node;
if (type1 == unsigned_intQI_type_node)
return intQI_type_node;
#endif
type2 = type_for_size (TYPE_PRECISION (type1), 0);
if (type2 != NULL_TREE)
return type2;
for (kt = 0; kt < ARRAY_SIZE (ffecom_tree_type[0]); ++kt)
{
type2 = ffecom_tree_type[FFEINFO_basictypeHOLLERITH][kt];
if (type1 == type2)
return ffecom_tree_type[FFEINFO_basictypeINTEGER][kt];
}
return type;
}
/* Prepare expr to be an argument of a TRUTH_NOT_EXPR,
or validate its data type for an `if' or `while' statement or ?..: exp.
This preparation consists of taking the ordinary
representation of an expression expr and producing a valid tree
boolean expression describing whether expr is nonzero. We could
simply always do build_binary_op (NE_EXPR, expr, integer_zero_node, 1),
but we optimize comparisons, &&, ||, and !.
The resulting type should always be `integer_type_node'. */
tree
truthvalue_conversion (expr)
tree expr;
{
if (TREE_CODE (expr) == ERROR_MARK)
return expr;
#if 0 /* This appears to be wrong for C++. */
/* These really should return error_mark_node after 2.4 is stable.
But not all callers handle ERROR_MARK properly. */
switch (TREE_CODE (TREE_TYPE (expr)))
{
case RECORD_TYPE:
error ("struct type value used where scalar is required");
return integer_zero_node;
case UNION_TYPE:
error ("union type value used where scalar is required");
return integer_zero_node;
case ARRAY_TYPE:
error ("array type value used where scalar is required");
return integer_zero_node;
default:
break;
}
#endif /* 0 */
switch (TREE_CODE (expr))
{
/* It is simpler and generates better code to have only TRUTH_*_EXPR
or comparison expressions as truth values at this level. */
#if 0
case COMPONENT_REF:
/* A one-bit unsigned bit-field is already acceptable. */
if (1 == TREE_INT_CST_LOW (DECL_SIZE (TREE_OPERAND (expr, 1)))
&& TREE_UNSIGNED (TREE_OPERAND (expr, 1)))
return expr;
break;
#endif
case EQ_EXPR:
/* It is simpler and generates better code to have only TRUTH_*_EXPR
or comparison expressions as truth values at this level. */
#if 0
if (integer_zerop (TREE_OPERAND (expr, 1)))
return build_unary_op (TRUTH_NOT_EXPR, TREE_OPERAND (expr, 0), 0);
#endif
case NE_EXPR: case LE_EXPR: case GE_EXPR: case LT_EXPR: case GT_EXPR:
case TRUTH_ANDIF_EXPR:
case TRUTH_ORIF_EXPR:
case TRUTH_AND_EXPR:
case TRUTH_OR_EXPR:
case TRUTH_XOR_EXPR:
TREE_TYPE (expr) = integer_type_node;
return expr;
case ERROR_MARK:
return expr;
case INTEGER_CST:
return integer_zerop (expr) ? integer_zero_node : integer_one_node;
case REAL_CST:
return real_zerop (expr) ? integer_zero_node : integer_one_node;
case ADDR_EXPR:
if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 0)))
return build (COMPOUND_EXPR, integer_type_node,
TREE_OPERAND (expr, 0), integer_one_node);
else
return integer_one_node;
case COMPLEX_EXPR:
return ffecom_2 ((TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1))
? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
integer_type_node,
truthvalue_conversion (TREE_OPERAND (expr, 0)),
truthvalue_conversion (TREE_OPERAND (expr, 1)));
case NEGATE_EXPR:
case ABS_EXPR:
case FLOAT_EXPR:
case FFS_EXPR:
/* These don't change whether an object is non-zero or zero. */
return truthvalue_conversion (TREE_OPERAND (expr, 0));
case LROTATE_EXPR:
case RROTATE_EXPR:
/* These don't change whether an object is zero or non-zero, but
we can't ignore them if their second arg has side-effects. */
if (TREE_SIDE_EFFECTS (TREE_OPERAND (expr, 1)))
return build (COMPOUND_EXPR, integer_type_node, TREE_OPERAND (expr, 1),
truthvalue_conversion (TREE_OPERAND (expr, 0)));
else
return truthvalue_conversion (TREE_OPERAND (expr, 0));
case COND_EXPR:
/* Distribute the conversion into the arms of a COND_EXPR. */
return fold (build (COND_EXPR, integer_type_node, TREE_OPERAND (expr, 0),
truthvalue_conversion (TREE_OPERAND (expr, 1)),
truthvalue_conversion (TREE_OPERAND (expr, 2))));
case CONVERT_EXPR:
/* Don't cancel the effect of a CONVERT_EXPR from a REFERENCE_TYPE,
since that affects how `default_conversion' will behave. */
if (TREE_CODE (TREE_TYPE (expr)) == REFERENCE_TYPE
|| TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0))) == REFERENCE_TYPE)
break;
/* fall through... */
case NOP_EXPR:
/* If this is widening the argument, we can ignore it. */
if (TYPE_PRECISION (TREE_TYPE (expr))
>= TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr, 0))))
return truthvalue_conversion (TREE_OPERAND (expr, 0));
break;
case MINUS_EXPR:
/* With IEEE arithmetic, x - x may not equal 0, so we can't optimize
this case. */
if (TARGET_FLOAT_FORMAT == IEEE_FLOAT_FORMAT
&& TREE_CODE (TREE_TYPE (expr)) == REAL_TYPE)
break;
/* fall through... */
case BIT_XOR_EXPR:
/* This and MINUS_EXPR can be changed into a comparison of the
two objects. */
if (TREE_TYPE (TREE_OPERAND (expr, 0))
== TREE_TYPE (TREE_OPERAND (expr, 1)))
return ffecom_2 (NE_EXPR, integer_type_node,
TREE_OPERAND (expr, 0),
TREE_OPERAND (expr, 1));
return ffecom_2 (NE_EXPR, integer_type_node,
TREE_OPERAND (expr, 0),
fold (build1 (NOP_EXPR,
TREE_TYPE (TREE_OPERAND (expr, 0)),
TREE_OPERAND (expr, 1))));
case BIT_AND_EXPR:
if (integer_onep (TREE_OPERAND (expr, 1)))
return expr;
break;
case MODIFY_EXPR:
#if 0 /* No such thing in Fortran. */
if (warn_parentheses && C_EXP_ORIGINAL_CODE (expr) == MODIFY_EXPR)
warning ("suggest parentheses around assignment used as truth value");
#endif
break;
default:
break;
}
if (TREE_CODE (TREE_TYPE (expr)) == COMPLEX_TYPE)
return (ffecom_2
((TREE_SIDE_EFFECTS (expr)
? TRUTH_OR_EXPR : TRUTH_ORIF_EXPR),
integer_type_node,
truthvalue_conversion (ffecom_1 (REALPART_EXPR,
TREE_TYPE (TREE_TYPE (expr)),
expr)),
truthvalue_conversion (ffecom_1 (IMAGPART_EXPR,
TREE_TYPE (TREE_TYPE (expr)),
expr))));
return ffecom_2 (NE_EXPR, integer_type_node,
expr,
convert (TREE_TYPE (expr), integer_zero_node));
}
tree
type_for_mode (mode, unsignedp)
enum machine_mode mode;
int unsignedp;
{
int i;
int j;
tree t;
if (mode == TYPE_MODE (integer_type_node))
return unsignedp ? unsigned_type_node : integer_type_node;
if (mode == TYPE_MODE (signed_char_type_node))
return unsignedp ? unsigned_char_type_node : signed_char_type_node;
if (mode == TYPE_MODE (short_integer_type_node))
return unsignedp ? short_unsigned_type_node : short_integer_type_node;
if (mode == TYPE_MODE (long_integer_type_node))
return unsignedp ? long_unsigned_type_node : long_integer_type_node;
if (mode == TYPE_MODE (long_long_integer_type_node))
return unsignedp ? long_long_unsigned_type_node : long_long_integer_type_node;
if (mode == TYPE_MODE (float_type_node))
return float_type_node;
if (mode == TYPE_MODE (double_type_node))
return double_type_node;
if (mode == TYPE_MODE (build_pointer_type (char_type_node)))
return build_pointer_type (char_type_node);
if (mode == TYPE_MODE (build_pointer_type (integer_type_node)))
return build_pointer_type (integer_type_node);
for (i = 0; ((size_t) i) < ARRAY_SIZE (ffecom_tree_type); ++i)
for (j = 0; ((size_t) j) < ARRAY_SIZE (ffecom_tree_type[0]); ++j)
{
if (((t = ffecom_tree_type[i][j]) != NULL_TREE)
&& (mode == TYPE_MODE (t)))
{
if ((i == FFEINFO_basictypeINTEGER) && unsignedp)
return ffecom_tree_type[FFEINFO_basictypeHOLLERITH][j];
else
return t;
}
}
return 0;
}
tree
type_for_size (bits, unsignedp)
unsigned bits;
int unsignedp;
{
ffeinfoKindtype kt;
tree type_node;
if (bits == TYPE_PRECISION (integer_type_node))
return unsignedp ? unsigned_type_node : integer_type_node;
if (bits == TYPE_PRECISION (signed_char_type_node))
return unsignedp ? unsigned_char_type_node : signed_char_type_node;
if (bits == TYPE_PRECISION (short_integer_type_node))
return unsignedp ? short_unsigned_type_node : short_integer_type_node;
if (bits == TYPE_PRECISION (long_integer_type_node))
return unsignedp ? long_unsigned_type_node : long_integer_type_node;
if (bits == TYPE_PRECISION (long_long_integer_type_node))
return (unsignedp ? long_long_unsigned_type_node
: long_long_integer_type_node);
for (kt = 0; kt < ARRAY_SIZE (ffecom_tree_type[0]); ++kt)
{
type_node = ffecom_tree_type[FFEINFO_basictypeINTEGER][kt];
if ((type_node != NULL_TREE) && (bits == TYPE_PRECISION (type_node)))
return unsignedp ? ffecom_tree_type[FFEINFO_basictypeHOLLERITH][kt]
: type_node;
}
return 0;
}
tree
unsigned_type (type)
tree type;
{
tree type1 = TYPE_MAIN_VARIANT (type);
ffeinfoKindtype kt;
tree type2;
if (type1 == signed_char_type_node || type1 == char_type_node)
return unsigned_char_type_node;
if (type1 == integer_type_node)
return unsigned_type_node;
if (type1 == short_integer_type_node)
return short_unsigned_type_node;
if (type1 == long_integer_type_node)
return long_unsigned_type_node;
if (type1 == long_long_integer_type_node)
return long_long_unsigned_type_node;
#if 0 /* gcc/c-* files only */
if (type1 == intDI_type_node)
return unsigned_intDI_type_node;
if (type1 == intSI_type_node)
return unsigned_intSI_type_node;
if (type1 == intHI_type_node)
return unsigned_intHI_type_node;
if (type1 == intQI_type_node)
return unsigned_intQI_type_node;
#endif
type2 = type_for_size (TYPE_PRECISION (type1), 1);
if (type2 != NULL_TREE)
return type2;
for (kt = 0; kt < ARRAY_SIZE (ffecom_tree_type[0]); ++kt)
{
type2 = ffecom_tree_type[FFEINFO_basictypeINTEGER][kt];
if (type1 == type2)
return ffecom_tree_type[FFEINFO_basictypeHOLLERITH][kt];
}
return type;
}
#endif /* FFECOM_targetCURRENT == FFECOM_targetGCC */
#if FFECOM_GCC_INCLUDE
/* From gcc/cccp.c, the code to handle -I. */
/* Skip leading "./" from a directory name.
This may yield the empty string, which represents the current directory. */
static char *
skip_redundant_dir_prefix (char *dir)
{
while (dir[0] == '.' && dir[1] == '/')
for (dir += 2; *dir == '/'; dir++)
continue;
if (dir[0] == '.' && !dir[1])
dir++;
return dir;
}
/* The file_name_map structure holds a mapping of file names for a
particular directory. This mapping is read from the file named
FILE_NAME_MAP_FILE in that directory. Such a file can be used to
map filenames on a file system with severe filename restrictions,
such as DOS. The format of the file name map file is just a series
of lines with two tokens on each line. The first token is the name
to map, and the second token is the actual name to use. */
struct file_name_map
{
struct file_name_map *map_next;
char *map_from;
char *map_to;
};
#define FILE_NAME_MAP_FILE "header.gcc"
/* Current maximum length of directory names in the search path
for include files. (Altered as we get more of them.) */
static int max_include_len = 0;
struct file_name_list
{
struct file_name_list *next;
char *fname;
/* Mapping of file names for this directory. */
struct file_name_map *name_map;
/* Non-zero if name_map is valid. */
int got_name_map;
};
static struct file_name_list *include = NULL; /* First dir to search */
static struct file_name_list *last_include = NULL; /* Last in chain */
/* I/O buffer structure.
The `fname' field is nonzero for source files and #include files
and for the dummy text used for -D and -U.
It is zero for rescanning results of macro expansion
and for expanding macro arguments. */
#define INPUT_STACK_MAX 400
static struct file_buf {
char *fname;
/* Filename specified with #line command. */
char *nominal_fname;
/* Record where in the search path this file was found.
For #include_next. */
struct file_name_list *dir;
ffewhereLine line;
ffewhereColumn column;
} instack[INPUT_STACK_MAX];
static int last_error_tick = 0; /* Incremented each time we print it. */
static int input_file_stack_tick = 0; /* Incremented when status changes. */
/* Current nesting level of input sources.
`instack[indepth]' is the level currently being read. */
static int indepth = -1;
typedef struct file_buf FILE_BUF;
typedef unsigned char U_CHAR;
/* table to tell if char can be part of a C identifier. */
U_CHAR is_idchar[256];
/* table to tell if char can be first char of a c identifier. */
U_CHAR is_idstart[256];
/* table to tell if c is horizontal space. */
U_CHAR is_hor_space[256];
/* table to tell if c is horizontal or vertical space. */
static U_CHAR is_space[256];
#define SKIP_WHITE_SPACE(p) do { while (is_hor_space[*p]) p++; } while (0)
#define SKIP_ALL_WHITE_SPACE(p) do { while (is_space[*p]) p++; } while (0)
/* Nonzero means -I- has been seen,
so don't look for #include "foo" the source-file directory. */
static int ignore_srcdir;
#ifndef INCLUDE_LEN_FUDGE
#define INCLUDE_LEN_FUDGE 0
#endif
static void append_include_chain (struct file_name_list *first,
struct file_name_list *last);
static FILE *open_include_file (char *filename,
struct file_name_list *searchptr);
static void print_containing_files (ffebadSeverity sev);
static char *skip_redundant_dir_prefix (char *);
static char *read_filename_string (int ch, FILE *f);
static struct file_name_map *read_name_map (char *dirname);
static char *savestring (char *input);
/* Append a chain of `struct file_name_list's
to the end of the main include chain.
FIRST is the beginning of the chain to append, and LAST is the end. */
static void
append_include_chain (first, last)
struct file_name_list *first, *last;
{
struct file_name_list *dir;
if (!first || !last)
return;
if (include == 0)
include = first;
else
last_include->next = first;
for (dir = first; ; dir = dir->next) {
int len = strlen (dir->fname) + INCLUDE_LEN_FUDGE;
if (len > max_include_len)
max_include_len = len;
if (dir == last)
break;
}
last->next = NULL;
last_include = last;
}
/* Try to open include file FILENAME. SEARCHPTR is the directory
being tried from the include file search path. This function maps
filenames on file systems based on information read by
read_name_map. */
static FILE *
open_include_file (filename, searchptr)
char *filename;
struct file_name_list *searchptr;
{
register struct file_name_map *map;
register char *from;
char *p, *dir;
if (searchptr && ! searchptr->got_name_map)
{
searchptr->name_map = read_name_map (searchptr->fname
? searchptr->fname : ".");
searchptr->got_name_map = 1;
}
/* First check the mapping for the directory we are using. */
if (searchptr && searchptr->name_map)
{
from = filename;
if (searchptr->fname)
from += strlen (searchptr->fname) + 1;
for (map = searchptr->name_map; map; map = map->map_next)
{
if (! strcmp (map->map_from, from))
{
/* Found a match. */
return fopen (map->map_to, "r");
}
}
}
/* Try to find a mapping file for the particular directory we are
looking in. Thus #include <sys/types.h> will look up sys/types.h
in /usr/include/header.gcc and look up types.h in
/usr/include/sys/header.gcc. */
p = rindex (filename, '/');
#ifdef DIR_SEPARATOR
if (! p) p = rindex (filename, DIR_SEPARATOR);
else {
char *tmp = rindex (filename, DIR_SEPARATOR);
if (tmp != NULL && tmp > p) p = tmp;
}
#endif
if (! p)
p = filename;
if (searchptr
&& searchptr->fname
&& strlen (searchptr->fname) == (size_t) (p - filename)
&& ! strncmp (searchptr->fname, filename, (int) (p - filename)))
{
/* FILENAME is in SEARCHPTR, which we've already checked. */
return fopen (filename, "r");
}
if (p == filename)
{
from = filename;
map = read_name_map (".");
}
else
{
dir = (char *) xmalloc (p - filename + 1);
memcpy (dir, filename, p - filename);
dir[p - filename] = '\0';
from = p + 1;
map = read_name_map (dir);
free (dir);
}
for (; map; map = map->map_next)
if (! strcmp (map->map_from, from))
return fopen (map->map_to, "r");
return fopen (filename, "r");
}
/* Print the file names and line numbers of the #include
commands which led to the current file. */
static void
print_containing_files (ffebadSeverity sev)
{
FILE_BUF *ip = NULL;
int i;
int first = 1;
char *str1;
char *str2;
/* If stack of files hasn't changed since we last printed
this info, don't repeat it. */
if (last_error_tick == input_file_stack_tick)
return;
for (i = indepth; i >= 0; i--)
if (instack[i].fname != NULL) {
ip = &instack[i];
break;
}
/* Give up if we don't find a source file. */
if (ip == NULL)
return;
/* Find the other, outer source files. */
for (i--; i >= 0; i--)
if (instack[i].fname != NULL)
{
ip = &instack[i];
if (first)
{
first = 0;
str1 = "In file included";
}
else
{
str1 = "... ...";
}
if (i == 1)
str2 = ":";
else
str2 = "";
ffebad_start_msg ("%A from %B at %0%C", sev);
ffebad_here (0, ip->line, ip->column);
ffebad_string (str1);
ffebad_string (ip->nominal_fname);
ffebad_string (str2);
ffebad_finish ();
}
/* Record we have printed the status as of this time. */
last_error_tick = input_file_stack_tick;
}
/* Read a space delimited string of unlimited length from a stdio
file. */
static char *
read_filename_string (ch, f)
int ch;
FILE *f;
{
char *alloc, *set;
int len;
len = 20;
set = alloc = xmalloc (len + 1);
if (! is_space[ch])
{
*set++ = ch;
while ((ch = getc (f)) != EOF && ! is_space[ch])
{
if (set - alloc == len)
{
len *= 2;
alloc = xrealloc (alloc, len + 1);
set = alloc + len / 2;
}
*set++ = ch;
}
}
*set = '\0';
ungetc (ch, f);
return alloc;
}
/* Read the file name map file for DIRNAME. */
static struct file_name_map *
read_name_map (dirname)
char *dirname;
{
/* This structure holds a linked list of file name maps, one per
directory. */
struct file_name_map_list
{
struct file_name_map_list *map_list_next;
char *map_list_name;
struct file_name_map *map_list_map;
};
static struct file_name_map_list *map_list;
register struct file_name_map_list *map_list_ptr;
char *name;
FILE *f;
size_t dirlen;
int separator_needed;
dirname = skip_redundant_dir_prefix (dirname);
for (map_list_ptr = map_list; map_list_ptr;
map_list_ptr = map_list_ptr->map_list_next)
if (! strcmp (map_list_ptr->map_list_name, dirname))
return map_list_ptr->map_list_map;
map_list_ptr = ((struct file_name_map_list *)
xmalloc (sizeof (struct file_name_map_list)));
map_list_ptr->map_list_name = savestring (dirname);
map_list_ptr->map_list_map = NULL;
dirlen = strlen (dirname);
separator_needed = dirlen != 0 && dirname[dirlen - 1] != '/';
name = (char *) xmalloc (dirlen + strlen (FILE_NAME_MAP_FILE) + 2);
strcpy (name, dirname);
name[dirlen] = '/';
strcpy (name + dirlen + separator_needed, FILE_NAME_MAP_FILE);
f = fopen (name, "r");
free (name);
if (!f)
map_list_ptr->map_list_map = NULL;
else
{
int ch;
while ((ch = getc (f)) != EOF)
{
char *from, *to;
struct file_name_map *ptr;
if (is_space[ch])
continue;
from = read_filename_string (ch, f);
while ((ch = getc (f)) != EOF && is_hor_space[ch])
;
to = read_filename_string (ch, f);
ptr = ((struct file_name_map *)
xmalloc (sizeof (struct file_name_map)));
ptr->map_from = from;
/* Make the real filename absolute. */
if (*to == '/')
ptr->map_to = to;
else
{
ptr->map_to = xmalloc (dirlen + strlen (to) + 2);
strcpy (ptr->map_to, dirname);
ptr->map_to[dirlen] = '/';
strcpy (ptr->map_to + dirlen + separator_needed, to);
free (to);
}
ptr->map_next = map_list_ptr->map_list_map;
map_list_ptr->map_list_map = ptr;
while ((ch = getc (f)) != '\n')
if (ch == EOF)
break;
}
fclose (f);
}
map_list_ptr->map_list_next = map_list;
map_list = map_list_ptr;
return map_list_ptr->map_list_map;
}
static char *
savestring (input)
char *input;
{
unsigned size = strlen (input);
char *output = xmalloc (size + 1);
strcpy (output, input);
return output;
}
static void
ffecom_file_ (char *name)
{
FILE_BUF *fp;
/* Do partial setup of input buffer for the sake of generating
early #line directives (when -g is in effect). */
fp = &instack[++indepth];
memset ((char *) fp, 0, sizeof (FILE_BUF));
if (name == NULL)
name = "";
fp->nominal_fname = fp->fname = name;
}
/* Initialize syntactic classifications of characters. */
static void
ffecom_initialize_char_syntax_ ()
{
register int i;
/*
* Set up is_idchar and is_idstart tables. These should be
* faster than saying (is_alpha (c) || c == '_'), etc.
* Set up these things before calling any routines tthat
* refer to them.
*/
for (i = 'a'; i <= 'z'; i++) {
is_idchar[i - 'a' + 'A'] = 1;
is_idchar[i] = 1;
is_idstart[i - 'a' + 'A'] = 1;
is_idstart[i] = 1;
}
for (i = '0'; i <= '9'; i++)
is_idchar[i] = 1;
is_idchar['_'] = 1;
is_idstart['_'] = 1;
/* horizontal space table */
is_hor_space[' '] = 1;
is_hor_space['\t'] = 1;
is_hor_space['\v'] = 1;
is_hor_space['\f'] = 1;
is_hor_space['\r'] = 1;
is_space[' '] = 1;
is_space['\t'] = 1;
is_space['\v'] = 1;
is_space['\f'] = 1;
is_space['\n'] = 1;
is_space['\r'] = 1;
}
static void
ffecom_close_include_ (FILE *f)
{
fclose (f);
indepth--;
input_file_stack_tick++;
ffewhere_line_kill (instack[indepth].line);
ffewhere_column_kill (instack[indepth].column);
}
static int
ffecom_decode_include_option_ (char *spec)
{
struct file_name_list *dirtmp;
if (! ignore_srcdir && !strcmp (spec, "-"))
ignore_srcdir = 1;
else
{
dirtmp = (struct file_name_list *)
xmalloc (sizeof (struct file_name_list));
dirtmp->next = 0; /* New one goes on the end */
if (spec[0] != 0)
dirtmp->fname = spec;
else
fatal ("Directory name must immediately follow -I option with no intervening spaces, as in `-Idir', not `-I dir'");
dirtmp->got_name_map = 0;
append_include_chain (dirtmp, dirtmp);
}
return 1;
}
/* Open INCLUDEd file. */
static FILE *
ffecom_open_include_ (char *name, ffewhereLine l, ffewhereColumn c)
{
char *fbeg = name;
size_t flen = strlen (fbeg);
struct file_name_list *search_start = include; /* Chain of dirs to search */
struct file_name_list dsp[1]; /* First in chain, if #include "..." */
struct file_name_list *searchptr = 0;
char *fname; /* Dynamically allocated fname buffer */
FILE *f;
FILE_BUF *fp;
if (flen == 0)
return NULL;
dsp[0].fname = NULL;
/* If -I- was specified, don't search current dir, only spec'd ones. */
if (!ignore_srcdir)
{
for (fp = &instack[indepth]; fp >= instack; fp--)
{
int n;
char *ep;
char *nam;
if ((nam = fp->nominal_fname) != NULL)
{
/* Found a named file. Figure out dir of the file,
and put it in front of the search list. */
dsp[0].next = search_start;
search_start = dsp;
#ifndef VMS
ep = rindex (nam, '/');
#ifdef DIR_SEPARATOR
if (ep == NULL) ep = rindex (nam, DIR_SEPARATOR);
else {
char *tmp = rindex (nam, DIR_SEPARATOR);
if (tmp != NULL && tmp > ep) ep = tmp;
}
#endif
#else /* VMS */
ep = rindex (nam, ']');
if (ep == NULL) ep = rindex (nam, '>');
if (ep == NULL) ep = rindex (nam, ':');
if (ep != NULL) ep++;
#endif /* VMS */
if (ep != NULL)
{
n = ep - nam;
dsp[0].fname = (char *) xmalloc (n + 1);
strncpy (dsp[0].fname, nam, n);
dsp[0].fname[n] = '\0';
if (n + INCLUDE_LEN_FUDGE > max_include_len)
max_include_len = n + INCLUDE_LEN_FUDGE;
}
else
dsp[0].fname = NULL; /* Current directory */
dsp[0].got_name_map = 0;
break;
}
}
}
/* Allocate this permanently, because it gets stored in the definitions
of macros. */
fname = xmalloc (max_include_len + flen + 4);
/* + 2 above for slash and terminating null. */
/* + 2 added for '.h' on VMS (to support '#include filename') (NOT USED
for g77 yet). */
/* If specified file name is absolute, just open it. */
if (*fbeg == '/'
#ifdef DIR_SEPARATOR
|| *fbeg == DIR_SEPARATOR
#endif
)
{
strncpy (fname, (char *) fbeg, flen);
fname[flen] = 0;
f = open_include_file (fname, NULL_PTR);
}
else
{
f = NULL;
/* Search directory path, trying to open the file.
Copy each filename tried into FNAME. */
for (searchptr = search_start; searchptr; searchptr = searchptr->next)
{
if (searchptr->fname)
{
/* The empty string in a search path is ignored.
This makes it possible to turn off entirely
a standard piece of the list. */
if (searchptr->fname[0] == 0)
continue;
strcpy (fname, skip_redundant_dir_prefix (searchptr->fname));
if (fname[0] && fname[strlen (fname) - 1] != '/')
strcat (fname, "/");
fname[strlen (fname) + flen] = 0;
}
else
fname[0] = 0;
strncat (fname, fbeg, flen);
#ifdef VMS
/* Change this 1/2 Unix 1/2 VMS file specification into a
full VMS file specification */
if (searchptr->fname && (searchptr->fname[0] != 0))
{
/* Fix up the filename */
hack_vms_include_specification (fname);
}
else
{
/* This is a normal VMS filespec, so use it unchanged. */
strncpy (fname, (char *) fbeg, flen);
fname[flen] = 0;
#if 0 /* Not for g77. */
/* if it's '#include filename', add the missing .h */
if (index (fname, '.') == NULL)
strcat (fname, ".h");
#endif
}
#endif /* VMS */
f = open_include_file (fname, searchptr);
#ifdef EACCES
if (f == NULL && errno == EACCES)
{
print_containing_files (FFEBAD_severityWARNING);
ffebad_start_msg ("At %0, INCLUDE file %A exists, but is not readable",
FFEBAD_severityWARNING);
ffebad_string (fname);
ffebad_here (0, l, c);
ffebad_finish ();
}
#endif
if (f != NULL)
break;
}
}
if (f == NULL)
{
/* A file that was not found. */
strncpy (fname, (char *) fbeg, flen);
fname[flen] = 0;
print_containing_files (ffebad_severity (FFEBAD_OPEN_INCLUDE));
ffebad_start (FFEBAD_OPEN_INCLUDE);
ffebad_here (0, l, c);
ffebad_string (fname);
ffebad_finish ();
}
if (dsp[0].fname != NULL)
free (dsp[0].fname);
if (f == NULL)
return NULL;
if (indepth >= (INPUT_STACK_MAX - 1))
{
print_containing_files (FFEBAD_severityFATAL);
ffebad_start_msg ("At %0, INCLUDE nesting too deep",
FFEBAD_severityFATAL);
ffebad_string (fname);
ffebad_here (0, l, c);
ffebad_finish ();
return NULL;
}
instack[indepth].line = ffewhere_line_use (l);
instack[indepth].column = ffewhere_column_use (c);
fp = &instack[indepth + 1];
memset ((char *) fp, 0, sizeof (FILE_BUF));
fp->nominal_fname = fp->fname = fname;
fp->dir = searchptr;
indepth++;
input_file_stack_tick++;
return f;
}
#endif /* FFECOM_GCC_INCLUDE */
|