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
|
/* Maintain binary trees of symbols.
Copyright (C) 2000-2024 Free Software Foundation, Inc.
Contributed by Andy Vaught
This file is part of GCC.
GCC 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 3, or (at your option) any later
version.
GCC 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 GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "options.h"
#include "gfortran.h"
#include "parse.h"
#include "match.h"
#include "constructor.h"
/* Strings for all symbol attributes. We use these for dumping the
parse tree, in error messages, and also when reading and writing
modules. */
const mstring flavors[] =
{
minit ("UNKNOWN-FL", FL_UNKNOWN), minit ("PROGRAM", FL_PROGRAM),
minit ("BLOCK-DATA", FL_BLOCK_DATA), minit ("MODULE", FL_MODULE),
minit ("VARIABLE", FL_VARIABLE), minit ("PARAMETER", FL_PARAMETER),
minit ("LABEL", FL_LABEL), minit ("PROCEDURE", FL_PROCEDURE),
minit ("DERIVED", FL_DERIVED), minit ("NAMELIST", FL_NAMELIST),
minit ("UNION", FL_UNION), minit ("STRUCTURE", FL_STRUCT),
minit (NULL, -1)
};
const mstring procedures[] =
{
minit ("UNKNOWN-PROC", PROC_UNKNOWN),
minit ("MODULE-PROC", PROC_MODULE),
minit ("INTERNAL-PROC", PROC_INTERNAL),
minit ("DUMMY-PROC", PROC_DUMMY),
minit ("INTRINSIC-PROC", PROC_INTRINSIC),
minit ("EXTERNAL-PROC", PROC_EXTERNAL),
minit ("STATEMENT-PROC", PROC_ST_FUNCTION),
minit (NULL, -1)
};
const mstring intents[] =
{
minit ("UNKNOWN-INTENT", INTENT_UNKNOWN),
minit ("IN", INTENT_IN),
minit ("OUT", INTENT_OUT),
minit ("INOUT", INTENT_INOUT),
minit (NULL, -1)
};
const mstring access_types[] =
{
minit ("UNKNOWN-ACCESS", ACCESS_UNKNOWN),
minit ("PUBLIC", ACCESS_PUBLIC),
minit ("PRIVATE", ACCESS_PRIVATE),
minit (NULL, -1)
};
const mstring ifsrc_types[] =
{
minit ("UNKNOWN", IFSRC_UNKNOWN),
minit ("DECL", IFSRC_DECL),
minit ("BODY", IFSRC_IFBODY)
};
const mstring save_status[] =
{
minit ("UNKNOWN", SAVE_NONE),
minit ("EXPLICIT-SAVE", SAVE_EXPLICIT),
minit ("IMPLICIT-SAVE", SAVE_IMPLICIT),
};
/* Set the mstrings for DTIO procedure names. */
const mstring dtio_procs[] =
{
minit ("_dtio_formatted_read", DTIO_RF),
minit ("_dtio_formatted_write", DTIO_WF),
minit ("_dtio_unformatted_read", DTIO_RUF),
minit ("_dtio_unformatted_write", DTIO_WUF),
};
/* This is to make sure the backend generates setup code in the correct
order. */
static int next_dummy_order = 1;
gfc_namespace *gfc_current_ns;
gfc_namespace *gfc_global_ns_list;
gfc_gsymbol *gfc_gsym_root = NULL;
gfc_symbol *gfc_derived_types;
static gfc_undo_change_set default_undo_chgset_var = { vNULL, vNULL, NULL };
static gfc_undo_change_set *latest_undo_chgset = &default_undo_chgset_var;
/*********** IMPLICIT NONE and IMPLICIT statement handlers ***********/
/* The following static variable indicates whether a particular element has
been explicitly set or not. */
static int new_flag[GFC_LETTERS];
/* Handle a correctly parsed IMPLICIT NONE. */
void
gfc_set_implicit_none (bool type, bool external, locus *loc)
{
int i;
if (external)
gfc_current_ns->has_implicit_none_export = 1;
if (type)
{
gfc_current_ns->seen_implicit_none = 1;
for (i = 0; i < GFC_LETTERS; i++)
{
if (gfc_current_ns->set_flag[i])
{
gfc_error_now ("IMPLICIT NONE (type) statement at %L following an "
"IMPLICIT statement", loc);
return;
}
gfc_clear_ts (&gfc_current_ns->default_type[i]);
gfc_current_ns->set_flag[i] = 1;
}
}
}
/* Reset the implicit range flags. */
void
gfc_clear_new_implicit (void)
{
int i;
for (i = 0; i < GFC_LETTERS; i++)
new_flag[i] = 0;
}
/* Prepare for a new implicit range. Sets flags in new_flag[]. */
bool
gfc_add_new_implicit_range (int c1, int c2)
{
int i;
c1 -= 'a';
c2 -= 'a';
for (i = c1; i <= c2; i++)
{
if (new_flag[i])
{
gfc_error ("Letter %qc already set in IMPLICIT statement at %C",
i + 'A');
return false;
}
new_flag[i] = 1;
}
return true;
}
/* Add a matched implicit range for gfc_set_implicit(). Check if merging
the new implicit types back into the existing types will work. */
bool
gfc_merge_new_implicit (gfc_typespec *ts)
{
int i;
if (gfc_current_ns->seen_implicit_none)
{
gfc_error ("Cannot specify IMPLICIT at %C after IMPLICIT NONE");
return false;
}
for (i = 0; i < GFC_LETTERS; i++)
{
if (new_flag[i])
{
if (gfc_current_ns->set_flag[i])
{
gfc_error ("Letter %qc already has an IMPLICIT type at %C",
i + 'A');
return false;
}
gfc_current_ns->default_type[i] = *ts;
gfc_current_ns->implicit_loc[i] = gfc_current_locus;
gfc_current_ns->set_flag[i] = 1;
}
}
return true;
}
/* Given a symbol, return a pointer to the typespec for its default type. */
gfc_typespec *
gfc_get_default_type (const char *name, gfc_namespace *ns)
{
char letter;
letter = name[0];
if (flag_allow_leading_underscore && letter == '_')
gfc_fatal_error ("Option %<-fallow-leading-underscore%> is for use only by "
"gfortran developers, and should not be used for "
"implicitly typed variables");
if (letter < 'a' || letter > 'z')
gfc_internal_error ("gfc_get_default_type(): Bad symbol %qs", name);
if (ns == NULL)
ns = gfc_current_ns;
return &ns->default_type[letter - 'a'];
}
/* Recursively append candidate SYM to CANDIDATES. Store the number of
candidates in CANDIDATES_LEN. */
static void
lookup_symbol_fuzzy_find_candidates (gfc_symtree *sym,
char **&candidates,
size_t &candidates_len)
{
gfc_symtree *p;
if (sym == NULL)
return;
if (sym->n.sym->ts.type != BT_UNKNOWN && sym->n.sym->ts.type != BT_PROCEDURE)
vec_push (candidates, candidates_len, sym->name);
p = sym->left;
if (p)
lookup_symbol_fuzzy_find_candidates (p, candidates, candidates_len);
p = sym->right;
if (p)
lookup_symbol_fuzzy_find_candidates (p, candidates, candidates_len);
}
/* Lookup symbol SYM_NAME fuzzily, taking names in SYMBOL into account. */
static const char*
lookup_symbol_fuzzy (const char *sym_name, gfc_symbol *symbol)
{
char **candidates = NULL;
size_t candidates_len = 0;
lookup_symbol_fuzzy_find_candidates (symbol->ns->sym_root, candidates,
candidates_len);
return gfc_closest_fuzzy_match (sym_name, candidates);
}
/* Given a pointer to a symbol, set its type according to the first
letter of its name. Fails if the letter in question has no default
type. */
bool
gfc_set_default_type (gfc_symbol *sym, int error_flag, gfc_namespace *ns)
{
gfc_typespec *ts;
gfc_expr *e;
/* Check to see if a function selector of unknown type can be resolved. */
if (sym->assoc
&& (e = sym->assoc->target)
&& e->expr_type == EXPR_FUNCTION)
{
if (e->ts.type == BT_UNKNOWN)
gfc_resolve_expr (e);
sym->ts = e->ts;
if (sym->ts.type != BT_UNKNOWN)
return true;
}
if (sym->ts.type != BT_UNKNOWN)
gfc_internal_error ("gfc_set_default_type(): symbol already has a type");
ts = gfc_get_default_type (sym->name, ns);
if (ts->type == BT_UNKNOWN)
{
if (error_flag && !sym->attr.untyped && !gfc_query_suppress_errors ())
{
const char *guessed = lookup_symbol_fuzzy (sym->name, sym);
if (guessed)
gfc_error ("Symbol %qs at %L has no IMPLICIT type"
"; did you mean %qs?",
sym->name, &sym->declared_at, guessed);
else
gfc_error ("Symbol %qs at %L has no IMPLICIT type",
sym->name, &sym->declared_at);
sym->attr.untyped = 1; /* Ensure we only give an error once. */
}
return false;
}
sym->ts = *ts;
sym->attr.implicit_type = 1;
if (ts->type == BT_CHARACTER && ts->u.cl)
sym->ts.u.cl = gfc_new_charlen (sym->ns, ts->u.cl);
else if (ts->type == BT_CLASS
&& !gfc_build_class_symbol (&sym->ts, &sym->attr, &sym->as))
return false;
if (sym->attr.is_bind_c == 1 && warn_c_binding_type)
{
/* BIND(C) variables should not be implicitly declared. */
gfc_warning_now (OPT_Wc_binding_type, "Implicitly declared BIND(C) "
"variable %qs at %L may not be C interoperable",
sym->name, &sym->declared_at);
sym->ts.f90_type = sym->ts.type;
}
if (sym->attr.dummy != 0)
{
if (sym->ns->proc_name != NULL
&& (sym->ns->proc_name->attr.subroutine != 0
|| sym->ns->proc_name->attr.function != 0)
&& sym->ns->proc_name->attr.is_bind_c != 0
&& warn_c_binding_type)
{
/* Dummy args to a BIND(C) routine may not be interoperable if
they are implicitly typed. */
gfc_warning_now (OPT_Wc_binding_type, "Implicitly declared variable "
"%qs at %L may not be C interoperable but it is a "
"dummy argument to the BIND(C) procedure %qs at %L",
sym->name, &(sym->declared_at),
sym->ns->proc_name->name,
&(sym->ns->proc_name->declared_at));
sym->ts.f90_type = sym->ts.type;
}
}
return true;
}
/* This function is called from parse.cc(parse_progunit) to check the
type of the function is not implicitly typed in the host namespace
and to implicitly type the function result, if necessary. */
void
gfc_check_function_type (gfc_namespace *ns)
{
gfc_symbol *proc = ns->proc_name;
if (!proc->attr.contained || proc->result->attr.implicit_type)
return;
if (proc->result->ts.type == BT_UNKNOWN && proc->result->ts.interface == NULL)
{
if (gfc_set_default_type (proc->result, 0, gfc_current_ns))
{
if (proc->result != proc)
{
proc->ts = proc->result->ts;
proc->as = gfc_copy_array_spec (proc->result->as);
proc->attr.dimension = proc->result->attr.dimension;
proc->attr.pointer = proc->result->attr.pointer;
proc->attr.allocatable = proc->result->attr.allocatable;
}
}
else if (!proc->result->attr.proc_pointer)
{
gfc_error ("Function result %qs at %L has no IMPLICIT type",
proc->result->name, &proc->result->declared_at);
proc->result->attr.untyped = 1;
}
}
}
/******************** Symbol attribute stuff *********************/
/* Older standards produced conflicts for some attributes that are allowed
in newer standards. Check for the conflict and issue an error depending
on the standard in play. */
static bool
conflict_std (int standard, const char *a1, const char *a2, const char *name,
locus *where)
{
if (name == NULL)
{
return gfc_notify_std (standard, "%s attribute conflicts "
"with %s attribute at %L", a1, a2,
where);
}
else
{
return gfc_notify_std (standard, "%s attribute conflicts "
"with %s attribute in %qs at %L",
a1, a2, name, where);
}
}
/* This is a generic conflict-checker. We do this to avoid having a
single conflict in two places. */
#define conf(a, b) if (attr->a && attr->b) { a1 = a; a2 = b; goto conflict; }
#define conf2(a) if (attr->a) { a2 = a; goto conflict; }
#define conf_std(a, b, std) if (attr->a && attr->b \
&& !conflict_std (std, a, b, name, where)) \
return false;
bool
gfc_check_conflict (symbol_attribute *attr, const char *name, locus *where)
{
static const char *dummy = "DUMMY", *save = "SAVE", *pointer = "POINTER",
*target = "TARGET", *external = "EXTERNAL", *intent = "INTENT",
*intent_in = "INTENT(IN)", *intrinsic = "INTRINSIC",
*intent_out = "INTENT(OUT)", *intent_inout = "INTENT(INOUT)",
*allocatable = "ALLOCATABLE", *elemental = "ELEMENTAL",
*privat = "PRIVATE", *recursive = "RECURSIVE",
*in_common = "COMMON", *result = "RESULT", *in_namelist = "NAMELIST",
*publik = "PUBLIC", *optional = "OPTIONAL", *entry = "ENTRY",
*function = "FUNCTION", *subroutine = "SUBROUTINE",
*dimension = "DIMENSION", *in_equivalence = "EQUIVALENCE",
*use_assoc = "USE ASSOCIATED", *cray_pointer = "CRAY POINTER",
*cray_pointee = "CRAY POINTEE", *data = "DATA", *value = "VALUE",
*volatile_ = "VOLATILE", *is_protected = "PROTECTED",
*is_bind_c = "BIND(C)", *procedure = "PROCEDURE",
*proc_pointer = "PROCEDURE POINTER", *abstract = "ABSTRACT",
*asynchronous = "ASYNCHRONOUS", *codimension = "CODIMENSION",
*contiguous = "CONTIGUOUS", *generic = "GENERIC", *automatic = "AUTOMATIC",
*pdt_len = "LEN", *pdt_kind = "KIND";
static const char *threadprivate = "THREADPRIVATE";
static const char *omp_declare_target = "OMP DECLARE TARGET";
static const char *omp_declare_target_link = "OMP DECLARE TARGET LINK";
static const char *oacc_declare_copyin = "OACC DECLARE COPYIN";
static const char *oacc_declare_create = "OACC DECLARE CREATE";
static const char *oacc_declare_deviceptr = "OACC DECLARE DEVICEPTR";
static const char *oacc_declare_device_resident =
"OACC DECLARE DEVICE_RESIDENT";
const char *a1, *a2;
if (attr->artificial)
return true;
if (where == NULL)
where = &gfc_current_locus;
if (attr->pointer && attr->intent != INTENT_UNKNOWN)
conf_std (pointer, intent, GFC_STD_F2003);
conf_std (in_namelist, allocatable, GFC_STD_F2003);
conf_std (in_namelist, pointer, GFC_STD_F2003);
/* Check for attributes not allowed in a BLOCK DATA. */
if (gfc_current_state () == COMP_BLOCK_DATA)
{
a1 = NULL;
if (attr->in_namelist)
a1 = in_namelist;
if (attr->allocatable)
a1 = allocatable;
if (attr->external)
a1 = external;
if (attr->optional)
a1 = optional;
if (attr->access == ACCESS_PRIVATE)
a1 = privat;
if (attr->access == ACCESS_PUBLIC)
a1 = publik;
if (attr->intent != INTENT_UNKNOWN)
a1 = intent;
if (a1 != NULL)
{
gfc_error
("%s attribute not allowed in BLOCK DATA program unit at %L",
a1, where);
return false;
}
}
if (attr->save == SAVE_EXPLICIT)
{
conf (dummy, save);
conf (in_common, save);
conf (result, save);
conf (automatic, save);
switch (attr->flavor)
{
case FL_PROGRAM:
case FL_BLOCK_DATA:
case FL_MODULE:
case FL_LABEL:
case_fl_struct:
case FL_PARAMETER:
a1 = gfc_code2string (flavors, attr->flavor);
a2 = save;
goto conflict;
case FL_NAMELIST:
gfc_error ("Namelist group name at %L cannot have the "
"SAVE attribute", where);
return false;
case FL_PROCEDURE:
/* Conflicts between SAVE and PROCEDURE will be checked at
resolution stage, see "resolve_fl_procedure". */
case FL_VARIABLE:
default:
break;
}
}
/* The copying of procedure dummy arguments for module procedures in
a submodule occur whilst the current state is COMP_CONTAINS. It
is necessary, therefore, to let this through. */
if (name && attr->dummy
&& (attr->function || attr->subroutine)
&& gfc_current_state () == COMP_CONTAINS
&& !(gfc_new_block && gfc_new_block->abr_modproc_decl))
gfc_error_now ("internal procedure %qs at %L conflicts with "
"DUMMY argument", name, where);
conf (dummy, entry);
conf (dummy, intrinsic);
conf (dummy, threadprivate);
conf (dummy, omp_declare_target);
conf (dummy, omp_declare_target_link);
conf (pointer, target);
conf (pointer, intrinsic);
conf (pointer, elemental);
conf (pointer, codimension);
conf (allocatable, elemental);
conf (in_common, automatic);
conf (result, automatic);
conf (use_assoc, automatic);
conf (dummy, automatic);
conf (target, external);
conf (target, intrinsic);
if (!attr->if_source)
conf (external, dimension); /* See Fortran 95's R504. */
conf (external, intrinsic);
conf (entry, intrinsic);
conf (abstract, intrinsic);
if ((attr->if_source == IFSRC_DECL && !attr->procedure) || attr->contained)
conf (external, subroutine);
if (attr->proc_pointer && !gfc_notify_std (GFC_STD_F2003,
"Procedure pointer at %C"))
return false;
conf (allocatable, pointer);
conf_std (allocatable, dummy, GFC_STD_F2003);
conf_std (allocatable, function, GFC_STD_F2003);
conf_std (allocatable, result, GFC_STD_F2003);
conf_std (elemental, recursive, GFC_STD_F2018);
conf (in_common, dummy);
conf (in_common, allocatable);
conf (in_common, codimension);
conf (in_common, result);
conf (in_equivalence, use_assoc);
conf (in_equivalence, codimension);
conf (in_equivalence, dummy);
conf (in_equivalence, target);
conf (in_equivalence, pointer);
conf (in_equivalence, function);
conf (in_equivalence, result);
conf (in_equivalence, entry);
conf (in_equivalence, allocatable);
conf (in_equivalence, threadprivate);
conf (in_equivalence, omp_declare_target);
conf (in_equivalence, omp_declare_target_link);
conf (in_equivalence, oacc_declare_create);
conf (in_equivalence, oacc_declare_copyin);
conf (in_equivalence, oacc_declare_deviceptr);
conf (in_equivalence, oacc_declare_device_resident);
conf (in_equivalence, is_bind_c);
conf (dummy, result);
conf (entry, result);
conf (generic, result);
conf (generic, omp_declare_target);
conf (generic, omp_declare_target_link);
conf (function, subroutine);
if (!function && !subroutine)
conf (is_bind_c, dummy);
conf (is_bind_c, cray_pointer);
conf (is_bind_c, cray_pointee);
conf (is_bind_c, codimension);
conf (is_bind_c, allocatable);
conf (is_bind_c, elemental);
/* Need to also get volatile attr, according to 5.1 of F2003 draft.
Parameter conflict caught below. Also, value cannot be specified
for a dummy procedure. */
/* Cray pointer/pointee conflicts. */
conf (cray_pointer, cray_pointee);
conf (cray_pointer, dimension);
conf (cray_pointer, codimension);
conf (cray_pointer, contiguous);
conf (cray_pointer, pointer);
conf (cray_pointer, target);
conf (cray_pointer, allocatable);
conf (cray_pointer, external);
conf (cray_pointer, intrinsic);
conf (cray_pointer, in_namelist);
conf (cray_pointer, function);
conf (cray_pointer, subroutine);
conf (cray_pointer, entry);
conf (cray_pointee, allocatable);
conf (cray_pointee, contiguous);
conf (cray_pointee, codimension);
conf (cray_pointee, intent);
conf (cray_pointee, optional);
conf (cray_pointee, dummy);
conf (cray_pointee, target);
conf (cray_pointee, intrinsic);
conf (cray_pointee, pointer);
conf (cray_pointee, entry);
conf (cray_pointee, in_common);
conf (cray_pointee, in_equivalence);
conf (cray_pointee, threadprivate);
conf (cray_pointee, omp_declare_target);
conf (cray_pointee, omp_declare_target_link);
conf (cray_pointee, oacc_declare_create);
conf (cray_pointee, oacc_declare_copyin);
conf (cray_pointee, oacc_declare_deviceptr);
conf (cray_pointee, oacc_declare_device_resident);
conf (data, dummy);
conf (data, function);
conf (data, result);
conf (data, allocatable);
conf (value, pointer)
conf (value, allocatable)
conf (value, subroutine)
conf (value, function)
conf (value, volatile_)
conf (value, dimension)
conf (value, codimension)
conf (value, external)
conf (codimension, result)
if (attr->value
&& (attr->intent == INTENT_OUT || attr->intent == INTENT_INOUT))
{
a1 = value;
a2 = attr->intent == INTENT_OUT ? intent_out : intent_inout;
goto conflict;
}
conf (is_protected, intrinsic)
conf (is_protected, in_common)
conf (asynchronous, intrinsic)
conf (asynchronous, external)
conf (volatile_, intrinsic)
conf (volatile_, external)
if (attr->volatile_ && attr->intent == INTENT_IN)
{
a1 = volatile_;
a2 = intent_in;
goto conflict;
}
conf (procedure, allocatable)
conf (procedure, dimension)
conf (procedure, codimension)
conf (procedure, intrinsic)
conf (procedure, target)
conf (procedure, value)
conf (procedure, volatile_)
conf (procedure, asynchronous)
conf (procedure, entry)
conf (proc_pointer, abstract)
conf (proc_pointer, omp_declare_target)
conf (proc_pointer, omp_declare_target_link)
conf (entry, omp_declare_target)
conf (entry, omp_declare_target_link)
conf (entry, oacc_declare_create)
conf (entry, oacc_declare_copyin)
conf (entry, oacc_declare_deviceptr)
conf (entry, oacc_declare_device_resident)
conf (pdt_kind, allocatable)
conf (pdt_kind, pointer)
conf (pdt_kind, dimension)
conf (pdt_kind, codimension)
conf (pdt_len, allocatable)
conf (pdt_len, pointer)
conf (pdt_len, dimension)
conf (pdt_len, codimension)
conf (pdt_len, pdt_kind)
if (attr->access == ACCESS_PRIVATE)
{
a1 = privat;
conf2 (pdt_kind);
conf2 (pdt_len);
}
a1 = gfc_code2string (flavors, attr->flavor);
if (attr->in_namelist
&& attr->flavor != FL_VARIABLE
&& attr->flavor != FL_PROCEDURE
&& attr->flavor != FL_UNKNOWN)
{
a2 = in_namelist;
goto conflict;
}
switch (attr->flavor)
{
case FL_PROGRAM:
case FL_BLOCK_DATA:
case FL_MODULE:
case FL_LABEL:
conf2 (codimension);
conf2 (dimension);
conf2 (dummy);
conf2 (volatile_);
conf2 (asynchronous);
conf2 (contiguous);
conf2 (pointer);
conf2 (is_protected);
conf2 (target);
conf2 (external);
conf2 (intrinsic);
conf2 (allocatable);
conf2 (result);
conf2 (in_namelist);
conf2 (optional);
conf2 (function);
conf2 (subroutine);
conf2 (threadprivate);
conf2 (omp_declare_target);
conf2 (omp_declare_target_link);
conf2 (oacc_declare_create);
conf2 (oacc_declare_copyin);
conf2 (oacc_declare_deviceptr);
conf2 (oacc_declare_device_resident);
if (attr->access == ACCESS_PUBLIC || attr->access == ACCESS_PRIVATE)
{
a2 = attr->access == ACCESS_PUBLIC ? publik : privat;
gfc_error ("%s attribute applied to %s %s at %L", a2, a1,
name, where);
return false;
}
if (attr->is_bind_c)
{
gfc_error_now ("BIND(C) applied to %s %s at %L", a1, name, where);
return false;
}
break;
case FL_VARIABLE:
break;
case FL_NAMELIST:
conf2 (result);
break;
case FL_PROCEDURE:
/* Conflicts with INTENT, SAVE and RESULT will be checked
at resolution stage, see "resolve_fl_procedure". */
if (attr->subroutine)
{
a1 = subroutine;
conf2 (target);
conf2 (allocatable);
conf2 (volatile_);
conf2 (asynchronous);
conf2 (in_namelist);
conf2 (codimension);
conf2 (dimension);
conf2 (function);
if (!attr->proc_pointer)
conf2 (threadprivate);
}
/* Procedure pointers in COMMON blocks are allowed in F03,
* but forbidden per F08:C5100. */
if (!attr->proc_pointer || (gfc_option.allow_std & GFC_STD_F2008))
conf2 (in_common);
conf2 (omp_declare_target_link);
switch (attr->proc)
{
case PROC_ST_FUNCTION:
conf2 (dummy);
conf2 (target);
break;
case PROC_MODULE:
conf2 (dummy);
break;
case PROC_DUMMY:
conf2 (result);
conf2 (threadprivate);
break;
default:
break;
}
break;
case_fl_struct:
conf2 (dummy);
conf2 (pointer);
conf2 (target);
conf2 (external);
conf2 (intrinsic);
conf2 (allocatable);
conf2 (optional);
conf2 (entry);
conf2 (function);
conf2 (subroutine);
conf2 (threadprivate);
conf2 (result);
conf2 (omp_declare_target);
conf2 (omp_declare_target_link);
conf2 (oacc_declare_create);
conf2 (oacc_declare_copyin);
conf2 (oacc_declare_deviceptr);
conf2 (oacc_declare_device_resident);
if (attr->intent != INTENT_UNKNOWN)
{
a2 = intent;
goto conflict;
}
break;
case FL_PARAMETER:
conf2 (external);
conf2 (intrinsic);
conf2 (optional);
conf2 (allocatable);
conf2 (function);
conf2 (subroutine);
conf2 (entry);
conf2 (contiguous);
conf2 (pointer);
conf2 (is_protected);
conf2 (target);
conf2 (dummy);
conf2 (in_common);
conf2 (value);
conf2 (volatile_);
conf2 (asynchronous);
conf2 (threadprivate);
conf2 (value);
conf2 (codimension);
conf2 (result);
if (!attr->is_iso_c)
conf2 (is_bind_c);
break;
default:
break;
}
return true;
conflict:
if (name == NULL)
gfc_error ("%s attribute conflicts with %s attribute at %L",
a1, a2, where);
else
gfc_error ("%s attribute conflicts with %s attribute in %qs at %L",
a1, a2, name, where);
return false;
}
#undef conf
#undef conf2
#undef conf_std
/* Mark a symbol as referenced. */
void
gfc_set_sym_referenced (gfc_symbol *sym)
{
if (sym->attr.referenced)
return;
sym->attr.referenced = 1;
/* Remember which order dummy variables are accessed in. */
if (sym->attr.dummy)
sym->dummy_order = next_dummy_order++;
}
/* Common subroutine called by attribute changing subroutines in order
to prevent them from changing a symbol that has been
use-associated. Returns zero if it is OK to change the symbol,
nonzero if not. */
static int
check_used (symbol_attribute *attr, const char *name, locus *where)
{
if (attr->use_assoc == 0)
return 0;
if (where == NULL)
where = &gfc_current_locus;
if (name == NULL)
gfc_error ("Cannot change attributes of USE-associated symbol at %L",
where);
else
gfc_error ("Cannot change attributes of USE-associated symbol %s at %L",
name, where);
return 1;
}
/* Generate an error because of a duplicate attribute. */
static void
duplicate_attr (const char *attr, locus *where)
{
if (where == NULL)
where = &gfc_current_locus;
gfc_error ("Duplicate %s attribute specified at %L", attr, where);
}
bool
gfc_add_ext_attribute (symbol_attribute *attr, ext_attr_id_t ext_attr,
locus *where ATTRIBUTE_UNUSED)
{
attr->ext_attr |= 1 << ext_attr;
return true;
}
/* Called from decl.cc (attr_decl1) to check attributes, when declared
separately. */
bool
gfc_add_attribute (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_allocatable (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->allocatable && ! gfc_submodule_procedure(attr))
{
duplicate_attr ("ALLOCATABLE", where);
return false;
}
if (attr->flavor == FL_PROCEDURE && attr->if_source == IFSRC_IFBODY
&& !gfc_find_state (COMP_INTERFACE))
{
gfc_error ("ALLOCATABLE specified outside of INTERFACE body at %L",
where);
return false;
}
attr->allocatable = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_automatic (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->automatic && !gfc_notify_std (GFC_STD_LEGACY,
"Duplicate AUTOMATIC attribute specified at %L", where))
return false;
attr->automatic = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_codimension (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->codimension)
{
duplicate_attr ("CODIMENSION", where);
return false;
}
if (attr->flavor == FL_PROCEDURE && attr->if_source == IFSRC_IFBODY
&& !gfc_find_state (COMP_INTERFACE))
{
gfc_error ("CODIMENSION specified for %qs outside its INTERFACE body "
"at %L", name, where);
return false;
}
attr->codimension = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_dimension (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->dimension && ! gfc_submodule_procedure(attr))
{
duplicate_attr ("DIMENSION", where);
return false;
}
if (attr->flavor == FL_PROCEDURE && attr->if_source == IFSRC_IFBODY
&& !gfc_find_state (COMP_INTERFACE))
{
gfc_error ("DIMENSION specified for %qs outside its INTERFACE body "
"at %L", name, where);
return false;
}
attr->dimension = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_contiguous (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->contiguous)
{
duplicate_attr ("CONTIGUOUS", where);
return false;
}
attr->contiguous = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_external (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->external)
{
duplicate_attr ("EXTERNAL", where);
return false;
}
if (attr->pointer && attr->if_source != IFSRC_IFBODY)
{
attr->pointer = 0;
attr->proc_pointer = 1;
}
attr->external = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_intrinsic (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->intrinsic)
{
duplicate_attr ("INTRINSIC", where);
return false;
}
attr->intrinsic = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_optional (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->optional)
{
duplicate_attr ("OPTIONAL", where);
return false;
}
attr->optional = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_kind (symbol_attribute *attr, locus *where)
{
if (attr->pdt_kind)
{
duplicate_attr ("KIND", where);
return false;
}
attr->pdt_kind = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_len (symbol_attribute *attr, locus *where)
{
if (attr->pdt_len)
{
duplicate_attr ("LEN", where);
return false;
}
attr->pdt_len = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_pointer (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->pointer && !(attr->if_source == IFSRC_IFBODY
&& !gfc_find_state (COMP_INTERFACE))
&& ! gfc_submodule_procedure(attr))
{
duplicate_attr ("POINTER", where);
return false;
}
if (attr->procedure || (attr->external && attr->if_source != IFSRC_IFBODY)
|| (attr->if_source == IFSRC_IFBODY
&& !gfc_find_state (COMP_INTERFACE)))
attr->proc_pointer = 1;
else
attr->pointer = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_cray_pointer (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
attr->cray_pointer = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_cray_pointee (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->cray_pointee)
{
gfc_error ("Cray Pointee at %L appears in multiple pointer()"
" statements", where);
return false;
}
attr->cray_pointee = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_protected (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->is_protected)
{
if (!gfc_notify_std (GFC_STD_LEGACY,
"Duplicate PROTECTED attribute specified at %L",
where))
return false;
}
attr->is_protected = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_result (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
attr->result = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_save (symbol_attribute *attr, save_state s, const char *name,
locus *where)
{
if (check_used (attr, name, where))
return false;
if (s == SAVE_EXPLICIT && gfc_pure (NULL))
{
gfc_error
("SAVE attribute at %L cannot be specified in a PURE procedure",
where);
return false;
}
if (s == SAVE_EXPLICIT)
gfc_unset_implicit_pure (NULL);
if (s == SAVE_EXPLICIT && attr->save == SAVE_EXPLICIT
&& (flag_automatic || pedantic))
{
if (!gfc_notify_std (GFC_STD_LEGACY,
"Duplicate SAVE attribute specified at %L",
where))
return false;
}
attr->save = s;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_value (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->value)
{
if (!gfc_notify_std (GFC_STD_LEGACY,
"Duplicate VALUE attribute specified at %L",
where))
return false;
}
attr->value = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_volatile (symbol_attribute *attr, const char *name, locus *where)
{
/* No check_used needed as 11.2.1 of the F2003 standard allows
that the local identifier made accessible by a use statement can be
given a VOLATILE attribute - unless it is a coarray (F2008, C560). */
if (attr->volatile_ && attr->volatile_ns == gfc_current_ns)
if (!gfc_notify_std (GFC_STD_LEGACY,
"Duplicate VOLATILE attribute specified at %L",
where))
return false;
/* F2008: C1282 A designator of a variable with the VOLATILE attribute
shall not appear in a pure subprogram.
F2018: C1588 A local variable of a pure subprogram, or of a BLOCK
construct within a pure subprogram, shall not have the SAVE or
VOLATILE attribute. */
if (gfc_pure (NULL))
{
gfc_error ("VOLATILE attribute at %L cannot be specified in a "
"PURE procedure", where);
return false;
}
attr->volatile_ = 1;
attr->volatile_ns = gfc_current_ns;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_asynchronous (symbol_attribute *attr, const char *name, locus *where)
{
/* No check_used needed as 11.2.1 of the F2003 standard allows
that the local identifier made accessible by a use statement can be
given a ASYNCHRONOUS attribute. */
if (attr->asynchronous && attr->asynchronous_ns == gfc_current_ns)
if (!gfc_notify_std (GFC_STD_LEGACY,
"Duplicate ASYNCHRONOUS attribute specified at %L",
where))
return false;
attr->asynchronous = 1;
attr->asynchronous_ns = gfc_current_ns;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_threadprivate (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->threadprivate)
{
duplicate_attr ("THREADPRIVATE", where);
return false;
}
attr->threadprivate = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_omp_declare_target (symbol_attribute *attr, const char *name,
locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->omp_declare_target)
return true;
attr->omp_declare_target = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_omp_declare_target_link (symbol_attribute *attr, const char *name,
locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->omp_declare_target_link)
return true;
attr->omp_declare_target_link = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_oacc_declare_create (symbol_attribute *attr, const char *name,
locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->oacc_declare_create)
return true;
attr->oacc_declare_create = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_oacc_declare_copyin (symbol_attribute *attr, const char *name,
locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->oacc_declare_copyin)
return true;
attr->oacc_declare_copyin = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_oacc_declare_deviceptr (symbol_attribute *attr, const char *name,
locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->oacc_declare_deviceptr)
return true;
attr->oacc_declare_deviceptr = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_oacc_declare_device_resident (symbol_attribute *attr, const char *name,
locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->oacc_declare_device_resident)
return true;
attr->oacc_declare_device_resident = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_target (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->target)
{
duplicate_attr ("TARGET", where);
return false;
}
attr->target = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_dummy (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
/* Duplicate dummy arguments are allowed due to ENTRY statements. */
attr->dummy = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_in_common (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
/* Duplicate attribute already checked for. */
attr->in_common = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_in_equivalence (symbol_attribute *attr, const char *name, locus *where)
{
/* Duplicate attribute already checked for. */
attr->in_equivalence = 1;
if (!gfc_check_conflict (attr, name, where))
return false;
if (attr->flavor == FL_VARIABLE)
return true;
return gfc_add_flavor (attr, FL_VARIABLE, name, where);
}
bool
gfc_add_data (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
attr->data = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_in_namelist (symbol_attribute *attr, const char *name, locus *where)
{
attr->in_namelist = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_sequence (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
attr->sequence = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_elemental (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->elemental)
{
duplicate_attr ("ELEMENTAL", where);
return false;
}
attr->elemental = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_pure (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->pure)
{
duplicate_attr ("PURE", where);
return false;
}
attr->pure = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_recursive (symbol_attribute *attr, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->recursive)
{
duplicate_attr ("RECURSIVE", where);
return false;
}
attr->recursive = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_entry (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->entry)
{
duplicate_attr ("ENTRY", where);
return false;
}
attr->entry = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_function (symbol_attribute *attr, const char *name, locus *where)
{
if (attr->flavor != FL_PROCEDURE
&& !gfc_add_flavor (attr, FL_PROCEDURE, name, where))
return false;
attr->function = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_subroutine (symbol_attribute *attr, const char *name, locus *where)
{
if (attr->flavor != FL_PROCEDURE
&& !gfc_add_flavor (attr, FL_PROCEDURE, name, where))
return false;
attr->subroutine = 1;
/* If we are looking at a BLOCK DATA statement and we encounter a
name with a leading underscore (which must be
compiler-generated), do not check. See PR 84394. */
if (name && *name != '_' && gfc_current_state () != COMP_BLOCK_DATA)
return gfc_check_conflict (attr, name, where);
else
return true;
}
bool
gfc_add_generic (symbol_attribute *attr, const char *name, locus *where)
{
if (attr->flavor != FL_PROCEDURE
&& !gfc_add_flavor (attr, FL_PROCEDURE, name, where))
return false;
attr->generic = 1;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_proc (symbol_attribute *attr, const char *name, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->flavor != FL_PROCEDURE
&& !gfc_add_flavor (attr, FL_PROCEDURE, name, where))
return false;
if (attr->procedure)
{
duplicate_attr ("PROCEDURE", where);
return false;
}
attr->procedure = 1;
return gfc_check_conflict (attr, NULL, where);
}
bool
gfc_add_abstract (symbol_attribute* attr, locus* where)
{
if (attr->abstract)
{
duplicate_attr ("ABSTRACT", where);
return false;
}
attr->abstract = 1;
return gfc_check_conflict (attr, NULL, where);
}
/* Flavors are special because some flavors are not what Fortran
considers attributes and can be reaffirmed multiple times. */
bool
gfc_add_flavor (symbol_attribute *attr, sym_flavor f, const char *name,
locus *where)
{
if ((f == FL_PROGRAM || f == FL_BLOCK_DATA || f == FL_MODULE
|| f == FL_PARAMETER || f == FL_LABEL || gfc_fl_struct(f)
|| f == FL_NAMELIST) && check_used (attr, name, where))
return false;
if (attr->flavor == f && f == FL_VARIABLE)
return true;
/* Copying a procedure dummy argument for a module procedure in a
submodule results in the flavor being copied and would result in
an error without this. */
if (attr->flavor == f && f == FL_PROCEDURE
&& gfc_new_block && gfc_new_block->abr_modproc_decl)
return true;
if (attr->flavor != FL_UNKNOWN)
{
if (where == NULL)
where = &gfc_current_locus;
if (name)
gfc_error ("%s attribute of %qs conflicts with %s attribute at %L",
gfc_code2string (flavors, attr->flavor), name,
gfc_code2string (flavors, f), where);
else
gfc_error ("%s attribute conflicts with %s attribute at %L",
gfc_code2string (flavors, attr->flavor),
gfc_code2string (flavors, f), where);
return false;
}
attr->flavor = f;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_procedure (symbol_attribute *attr, procedure_type t,
const char *name, locus *where)
{
if (check_used (attr, name, where))
return false;
if (attr->flavor != FL_PROCEDURE
&& !gfc_add_flavor (attr, FL_PROCEDURE, name, where))
return false;
if (where == NULL)
where = &gfc_current_locus;
if (attr->proc != PROC_UNKNOWN && !attr->module_procedure
&& attr->access == ACCESS_UNKNOWN)
{
if (attr->proc == PROC_ST_FUNCTION && t == PROC_INTERNAL
&& !gfc_notification_std (GFC_STD_F2008))
gfc_error ("%s procedure at %L is already declared as %s "
"procedure. \nF2008: A pointer function assignment "
"is ambiguous if it is the first executable statement "
"after the specification block. Please add any other "
"kind of executable statement before it. FIXME",
gfc_code2string (procedures, t), where,
gfc_code2string (procedures, attr->proc));
else
gfc_error ("%s procedure at %L is already declared as %s "
"procedure", gfc_code2string (procedures, t), where,
gfc_code2string (procedures, attr->proc));
return false;
}
attr->proc = t;
/* Statement functions are always scalar and functions. */
if (t == PROC_ST_FUNCTION
&& ((!attr->function && !gfc_add_function (attr, name, where))
|| attr->dimension))
return false;
return gfc_check_conflict (attr, name, where);
}
bool
gfc_add_intent (symbol_attribute *attr, sym_intent intent, locus *where)
{
if (check_used (attr, NULL, where))
return false;
if (attr->intent == INTENT_UNKNOWN)
{
attr->intent = intent;
return gfc_check_conflict (attr, NULL, where);
}
if (where == NULL)
where = &gfc_current_locus;
gfc_error ("INTENT (%s) conflicts with INTENT(%s) at %L",
gfc_intent_string (attr->intent),
gfc_intent_string (intent), where);
return false;
}
/* No checks for use-association in public and private statements. */
bool
gfc_add_access (symbol_attribute *attr, gfc_access access,
const char *name, locus *where)
{
if (attr->access == ACCESS_UNKNOWN
|| (attr->use_assoc && attr->access != ACCESS_PRIVATE))
{
attr->access = access;
return gfc_check_conflict (attr, name, where);
}
if (where == NULL)
where = &gfc_current_locus;
gfc_error ("ACCESS specification at %L was already specified", where);
return false;
}
/* Set the is_bind_c field for the given symbol_attribute. */
bool
gfc_add_is_bind_c (symbol_attribute *attr, const char *name, locus *where,
int is_proc_lang_bind_spec)
{
if (is_proc_lang_bind_spec == 0 && attr->flavor == FL_PROCEDURE)
gfc_error_now ("BIND(C) attribute at %L can only be used for "
"variables or common blocks", where);
else if (attr->is_bind_c)
gfc_error_now ("Duplicate BIND attribute specified at %L", where);
else
attr->is_bind_c = 1;
if (where == NULL)
where = &gfc_current_locus;
if (!gfc_notify_std (GFC_STD_F2003, "BIND(C) at %L", where))
return false;
return gfc_check_conflict (attr, name, where);
}
/* Set the extension field for the given symbol_attribute. */
bool
gfc_add_extension (symbol_attribute *attr, locus *where)
{
if (where == NULL)
where = &gfc_current_locus;
if (attr->extension)
gfc_error_now ("Duplicate EXTENDS attribute specified at %L", where);
else
attr->extension = 1;
if (!gfc_notify_std (GFC_STD_F2003, "EXTENDS at %L", where))
return false;
return true;
}
bool
gfc_add_explicit_interface (gfc_symbol *sym, ifsrc source,
gfc_formal_arglist * formal, locus *where)
{
if (check_used (&sym->attr, sym->name, where))
return false;
/* Skip the following checks in the case of a module_procedures in a
submodule since they will manifestly fail. */
if (sym->attr.module_procedure == 1
&& source == IFSRC_DECL)
goto finish;
if (where == NULL)
where = &gfc_current_locus;
if (sym->attr.if_source != IFSRC_UNKNOWN
&& sym->attr.if_source != IFSRC_DECL)
{
gfc_error ("Symbol %qs at %L already has an explicit interface",
sym->name, where);
return false;
}
if (source == IFSRC_IFBODY && (sym->attr.dimension || sym->attr.allocatable))
{
gfc_error ("%qs at %L has attributes specified outside its INTERFACE "
"body", sym->name, where);
return false;
}
finish:
sym->formal = formal;
sym->attr.if_source = source;
return true;
}
/* Add a type to a symbol. */
bool
gfc_add_type (gfc_symbol *sym, gfc_typespec *ts, locus *where)
{
sym_flavor flavor;
bt type;
if (where == NULL)
where = &gfc_current_locus;
if (sym->result)
type = sym->result->ts.type;
else
type = sym->ts.type;
if (sym->attr.result && type == BT_UNKNOWN && sym->ns->proc_name)
type = sym->ns->proc_name->ts.type;
if (type != BT_UNKNOWN && !(sym->attr.function && sym->attr.implicit_type)
&& !(gfc_state_stack->previous && gfc_state_stack->previous->previous
&& gfc_state_stack->previous->previous->state == COMP_SUBMODULE)
&& !sym->attr.module_procedure)
{
if (sym->attr.use_assoc)
gfc_error ("Symbol %qs at %L conflicts with symbol from module %qs, "
"use-associated at %L", sym->name, where, sym->module,
&sym->declared_at);
else if (sym->attr.function && sym->attr.result)
gfc_error ("Symbol %qs at %L already has basic type of %s",
sym->ns->proc_name->name, where, gfc_basic_typename (type));
else
gfc_error ("Symbol %qs at %L already has basic type of %s", sym->name,
where, gfc_basic_typename (type));
return false;
}
if (sym->attr.procedure && sym->ts.interface)
{
gfc_error ("Procedure %qs at %L may not have basic type of %s",
sym->name, where, gfc_basic_typename (ts->type));
return false;
}
flavor = sym->attr.flavor;
if (flavor == FL_PROGRAM || flavor == FL_BLOCK_DATA || flavor == FL_MODULE
|| flavor == FL_LABEL
|| (flavor == FL_PROCEDURE && sym->attr.subroutine)
|| flavor == FL_DERIVED || flavor == FL_NAMELIST)
{
gfc_error ("Symbol %qs at %L cannot have a type",
sym->ns->proc_name ? sym->ns->proc_name->name : sym->name,
where);
return false;
}
sym->ts = *ts;
return true;
}
/* Clears all attributes. */
void
gfc_clear_attr (symbol_attribute *attr)
{
memset (attr, 0, sizeof (symbol_attribute));
}
/* Check for missing attributes in the new symbol. Currently does
nothing, but it's not clear that it is unnecessary yet. */
bool
gfc_missing_attr (symbol_attribute *attr ATTRIBUTE_UNUSED,
locus *where ATTRIBUTE_UNUSED)
{
return true;
}
/* Copy an attribute to a symbol attribute, bit by bit. Some
attributes have a lot of side-effects but cannot be present given
where we are called from, so we ignore some bits. */
bool
gfc_copy_attr (symbol_attribute *dest, symbol_attribute *src, locus *where)
{
int is_proc_lang_bind_spec;
/* In line with the other attributes, we only add bits but do not remove
them; cf. also PR 41034. */
dest->ext_attr |= src->ext_attr;
if (src->allocatable && !gfc_add_allocatable (dest, where))
goto fail;
if (src->automatic && !gfc_add_automatic (dest, NULL, where))
goto fail;
if (src->dimension && !gfc_add_dimension (dest, NULL, where))
goto fail;
if (src->codimension && !gfc_add_codimension (dest, NULL, where))
goto fail;
if (src->contiguous && !gfc_add_contiguous (dest, NULL, where))
goto fail;
if (src->optional && !gfc_add_optional (dest, where))
goto fail;
if (src->pointer && !gfc_add_pointer (dest, where))
goto fail;
if (src->is_protected && !gfc_add_protected (dest, NULL, where))
goto fail;
if (src->save && !gfc_add_save (dest, src->save, NULL, where))
goto fail;
if (src->value && !gfc_add_value (dest, NULL, where))
goto fail;
if (src->volatile_ && !gfc_add_volatile (dest, NULL, where))
goto fail;
if (src->asynchronous && !gfc_add_asynchronous (dest, NULL, where))
goto fail;
if (src->threadprivate
&& !gfc_add_threadprivate (dest, NULL, where))
goto fail;
if (src->omp_declare_target
&& !gfc_add_omp_declare_target (dest, NULL, where))
goto fail;
if (src->omp_declare_target_link
&& !gfc_add_omp_declare_target_link (dest, NULL, where))
goto fail;
if (src->oacc_declare_create
&& !gfc_add_oacc_declare_create (dest, NULL, where))
goto fail;
if (src->oacc_declare_copyin
&& !gfc_add_oacc_declare_copyin (dest, NULL, where))
goto fail;
if (src->oacc_declare_deviceptr
&& !gfc_add_oacc_declare_deviceptr (dest, NULL, where))
goto fail;
if (src->oacc_declare_device_resident
&& !gfc_add_oacc_declare_device_resident (dest, NULL, where))
goto fail;
if (src->target && !gfc_add_target (dest, where))
goto fail;
if (src->dummy && !gfc_add_dummy (dest, NULL, where))
goto fail;
if (src->result && !gfc_add_result (dest, NULL, where))
goto fail;
if (src->entry)
dest->entry = 1;
if (src->in_namelist && !gfc_add_in_namelist (dest, NULL, where))
goto fail;
if (src->in_common && !gfc_add_in_common (dest, NULL, where))
goto fail;
if (src->generic && !gfc_add_generic (dest, NULL, where))
goto fail;
if (src->function && !gfc_add_function (dest, NULL, where))
goto fail;
if (src->subroutine && !gfc_add_subroutine (dest, NULL, where))
goto fail;
if (src->sequence && !gfc_add_sequence (dest, NULL, where))
goto fail;
if (src->elemental && !gfc_add_elemental (dest, where))
goto fail;
if (src->pure && !gfc_add_pure (dest, where))
goto fail;
if (src->recursive && !gfc_add_recursive (dest, where))
goto fail;
if (src->flavor != FL_UNKNOWN
&& !gfc_add_flavor (dest, src->flavor, NULL, where))
goto fail;
if (src->intent != INTENT_UNKNOWN
&& !gfc_add_intent (dest, src->intent, where))
goto fail;
if (src->access != ACCESS_UNKNOWN
&& !gfc_add_access (dest, src->access, NULL, where))
goto fail;
if (!gfc_missing_attr (dest, where))
goto fail;
if (src->cray_pointer && !gfc_add_cray_pointer (dest, where))
goto fail;
if (src->cray_pointee && !gfc_add_cray_pointee (dest, where))
goto fail;
is_proc_lang_bind_spec = (src->flavor == FL_PROCEDURE ? 1 : 0);
if (src->is_bind_c
&& !gfc_add_is_bind_c (dest, NULL, where, is_proc_lang_bind_spec))
return false;
if (src->is_c_interop)
dest->is_c_interop = 1;
if (src->is_iso_c)
dest->is_iso_c = 1;
if (src->external && !gfc_add_external (dest, where))
goto fail;
if (src->intrinsic && !gfc_add_intrinsic (dest, where))
goto fail;
if (src->proc_pointer)
dest->proc_pointer = 1;
return true;
fail:
return false;
}
/* A function to generate a dummy argument symbol using that from the
interface declaration. Can be used for the result symbol as well if
the flag is set. */
int
gfc_copy_dummy_sym (gfc_symbol **dsym, gfc_symbol *sym, int result)
{
int rc;
rc = gfc_get_symbol (sym->name, NULL, dsym);
if (rc)
return rc;
if (!gfc_add_type (*dsym, &(sym->ts), &gfc_current_locus))
return 1;
if (!gfc_copy_attr (&(*dsym)->attr, &(sym->attr),
&gfc_current_locus))
return 1;
if ((*dsym)->attr.dimension)
(*dsym)->as = gfc_copy_array_spec (sym->as);
(*dsym)->attr.class_ok = sym->attr.class_ok;
if ((*dsym) != NULL && !result
&& (!gfc_add_dummy(&(*dsym)->attr, (*dsym)->name, NULL)
|| !gfc_missing_attr (&(*dsym)->attr, NULL)))
return 1;
else if ((*dsym) != NULL && result
&& (!gfc_add_result(&(*dsym)->attr, (*dsym)->name, NULL)
|| !gfc_missing_attr (&(*dsym)->attr, NULL)))
return 1;
return 0;
}
/************** Component name management ************/
/* Component names of a derived type form their own little namespaces
that are separate from all other spaces. The space is composed of
a singly linked list of gfc_component structures whose head is
located in the parent symbol. */
/* Add a component name to a symbol. The call fails if the name is
already present. On success, the component pointer is modified to
point to the additional component structure. */
bool
gfc_add_component (gfc_symbol *sym, const char *name,
gfc_component **component)
{
gfc_component *p, *tail;
/* Check for existing components with the same name, but not for union
components or containers. Unions and maps are anonymous so they have
unique internal names which will never conflict.
Don't use gfc_find_component here because it calls gfc_use_derived,
but the derived type may not be fully defined yet. */
tail = NULL;
for (p = sym->components; p; p = p->next)
{
if (strcmp (p->name, name) == 0)
{
gfc_error ("Component %qs at %C already declared at %L",
name, &p->loc);
return false;
}
tail = p;
}
if (sym->attr.extension
&& gfc_find_component (sym->components->ts.u.derived,
name, true, true, NULL))
{
gfc_error ("Component %qs at %C already in the parent type "
"at %L", name, &sym->components->ts.u.derived->declared_at);
return false;
}
/* Allocate a new component. */
p = gfc_get_component ();
if (tail == NULL)
sym->components = p;
else
tail->next = p;
p->name = gfc_get_string ("%s", name);
p->loc = gfc_current_locus;
p->ts.type = BT_UNKNOWN;
*component = p;
return true;
}
/* Recursive function to switch derived types of all symbol in a
namespace. */
static void
switch_types (gfc_symtree *st, gfc_symbol *from, gfc_symbol *to)
{
gfc_symbol *sym;
if (st == NULL)
return;
sym = st->n.sym;
if (sym->ts.type == BT_DERIVED && sym->ts.u.derived == from)
sym->ts.u.derived = to;
switch_types (st->left, from, to);
switch_types (st->right, from, to);
}
/* This subroutine is called when a derived type is used in order to
make the final determination about which version to use. The
standard requires that a type be defined before it is 'used', but
such types can appear in IMPLICIT statements before the actual
definition. 'Using' in this context means declaring a variable to
be that type or using the type constructor.
If a type is used and the components haven't been defined, then we
have to have a derived type in a parent unit. We find the node in
the other namespace and point the symtree node in this namespace to
that node. Further reference to this name point to the correct
node. If we can't find the node in a parent namespace, then we have
an error.
This subroutine takes a pointer to a symbol node and returns a
pointer to the translated node or NULL for an error. Usually there
is no translation and we return the node we were passed. */
gfc_symbol *
gfc_use_derived (gfc_symbol *sym)
{
gfc_symbol *s;
gfc_typespec *t;
gfc_symtree *st;
int i;
if (!sym)
return NULL;
if (sym->attr.unlimited_polymorphic)
return sym;
if (sym->attr.generic)
sym = gfc_find_dt_in_generic (sym);
if (sym->components != NULL || sym->attr.zero_comp)
return sym; /* Already defined. */
if (sym->ns->parent == NULL)
goto bad;
if (gfc_find_symbol (sym->name, sym->ns->parent, 1, &s))
{
gfc_error ("Symbol %qs at %C is ambiguous", sym->name);
return NULL;
}
if (s == NULL || !gfc_fl_struct (s->attr.flavor))
goto bad;
/* Get rid of symbol sym, translating all references to s. */
for (i = 0; i < GFC_LETTERS; i++)
{
t = &sym->ns->default_type[i];
if (t->u.derived == sym)
t->u.derived = s;
}
st = gfc_find_symtree (sym->ns->sym_root, sym->name);
st->n.sym = s;
s->refs++;
/* Unlink from list of modified symbols. */
gfc_commit_symbol (sym);
switch_types (sym->ns->sym_root, sym, s);
/* TODO: Also have to replace sym -> s in other lists like
namelists, common lists and interface lists. */
gfc_free_symbol (sym);
return s;
bad:
gfc_error ("Derived type %qs at %C is being used before it is defined",
sym->name);
return NULL;
}
/* Find all derived types in the uppermost namespace that have a component
a component called name and stash them in the assoc field of an
associate name variable.
This is used to infer the derived type of an associate name, whose selector
is a sibling derived type function that has not yet been parsed. Either
the derived type is use associated in both contained and sibling procedures
or it appears in the uppermost namespace. */
static int cts = 0;
static void
find_derived_types (gfc_symbol *sym, gfc_symtree *st, const char *name,
bool contained, bool stash)
{
if (st->n.sym && st->n.sym->attr.flavor == FL_DERIVED
&& !st->n.sym->attr.is_class
&& ((contained && st->n.sym->attr.use_assoc) || !contained)
&& gfc_find_component (st->n.sym, name, true, true, NULL))
{
/* Do the stashing, if required. */
cts++;
if (stash)
{
if (sym->assoc->derived_types)
st->n.sym->dt_next = sym->assoc->derived_types;
sym->assoc->derived_types = st->n.sym;
}
}
if (st->left)
find_derived_types (sym, st->left, name, contained, stash);
if (st->right)
find_derived_types (sym, st->right, name, contained, stash);
}
int
gfc_find_derived_types (gfc_symbol *sym, gfc_namespace *ns,
const char *name, bool stash)
{
gfc_namespace *encompassing = NULL;
gcc_assert (sym->assoc);
cts = 0;
while (ns->parent)
{
if (!ns->parent->parent && ns->proc_name
&& (ns->proc_name->attr.function || ns->proc_name->attr.subroutine))
encompassing = ns;
ns = ns->parent;
}
/* Search the top level namespace first. */
find_derived_types (sym, ns->sym_root, name, false, stash);
/* Then the encompassing namespace. */
if (encompassing && encompassing != ns)
find_derived_types (sym, encompassing->sym_root, name, true, stash);
return cts;
}
/* Find the component with the given name in the union type symbol.
If ref is not NULL it will be set to the chain of components through which
the component can actually be accessed. This is necessary for unions because
intermediate structures may be maps, nested structures, or other unions,
all of which may (or must) be 'anonymous' to user code. */
static gfc_component *
find_union_component (gfc_symbol *un, const char *name,
bool noaccess, gfc_ref **ref)
{
gfc_component *m, *check;
gfc_ref *sref, *tmp;
for (m = un->components; m; m = m->next)
{
check = gfc_find_component (m->ts.u.derived, name, noaccess, true, &tmp);
if (check == NULL)
continue;
/* Found component somewhere in m; chain the refs together. */
if (ref)
{
/* Map ref. */
sref = gfc_get_ref ();
sref->type = REF_COMPONENT;
sref->u.c.component = m;
sref->u.c.sym = m->ts.u.derived;
sref->next = tmp;
*ref = sref;
}
/* Other checks (such as access) were done in the recursive calls. */
return check;
}
return NULL;
}
/* Recursively append candidate COMPONENT structures to CANDIDATES. Store
the number of total candidates in CANDIDATES_LEN. */
static void
lookup_component_fuzzy_find_candidates (gfc_component *component,
char **&candidates,
size_t &candidates_len)
{
for (gfc_component *p = component; p; p = p->next)
vec_push (candidates, candidates_len, p->name);
}
/* Lookup component MEMBER fuzzily, taking names in COMPONENT into account. */
static const char*
lookup_component_fuzzy (const char *member, gfc_component *component)
{
char **candidates = NULL;
size_t candidates_len = 0;
lookup_component_fuzzy_find_candidates (component, candidates,
candidates_len);
return gfc_closest_fuzzy_match (member, candidates);
}
/* Given a derived type node and a component name, try to locate the
component structure. Returns the NULL pointer if the component is
not found or the components are private. If noaccess is set, no access
checks are done. If silent is set, an error will not be generated if
the component cannot be found or accessed.
If ref is not NULL, *ref is set to represent the chain of components
required to get to the ultimate component.
If the component is simply a direct subcomponent, or is inherited from a
parent derived type in the given derived type, this is a single ref with its
component set to the returned component.
Otherwise, *ref is constructed as a chain of subcomponents. This occurs
when the component is found through an implicit chain of nested union and
map components. Unions and maps are "anonymous" substructures in FORTRAN
which cannot be explicitly referenced, but the reference chain must be
considered as in C for backend translation to correctly compute layouts.
(For example, x.a may refer to x->(UNION)->(MAP)->(UNION)->(MAP)->a). */
gfc_component *
gfc_find_component (gfc_symbol *sym, const char *name,
bool noaccess, bool silent, gfc_ref **ref)
{
gfc_component *p, *check;
gfc_ref *sref = NULL, *tmp = NULL;
if (name == NULL || sym == NULL)
return NULL;
if (sym->attr.flavor == FL_DERIVED)
sym = gfc_use_derived (sym);
else
gcc_assert (gfc_fl_struct (sym->attr.flavor));
if (sym == NULL)
return NULL;
/* Handle UNIONs specially - mutually recursive with gfc_find_component. */
if (sym->attr.flavor == FL_UNION)
return find_union_component (sym, name, noaccess, ref);
if (ref) *ref = NULL;
for (p = sym->components; p; p = p->next)
{
/* Nest search into union's maps. */
if (p->ts.type == BT_UNION)
{
check = find_union_component (p->ts.u.derived, name, noaccess, &tmp);
if (check != NULL)
{
/* Union ref. */
if (ref)
{
sref = gfc_get_ref ();
sref->type = REF_COMPONENT;
sref->u.c.component = p;
sref->u.c.sym = p->ts.u.derived;
sref->next = tmp;
*ref = sref;
}
return check;
}
}
else if (strcmp (p->name, name) == 0)
break;
continue;
}
if (p && sym->attr.use_assoc && !noaccess)
{
bool is_parent_comp = sym->attr.extension && (p == sym->components);
if (p->attr.access == ACCESS_PRIVATE ||
(p->attr.access != ACCESS_PUBLIC
&& sym->component_access == ACCESS_PRIVATE
&& !is_parent_comp))
{
if (!silent)
gfc_error ("Component %qs at %C is a PRIVATE component of %qs",
name, sym->name);
return NULL;
}
}
if (p == NULL
&& sym->attr.extension
&& sym->components->ts.type == BT_DERIVED)
{
p = gfc_find_component (sym->components->ts.u.derived, name,
noaccess, silent, ref);
/* Do not overwrite the error. */
if (p == NULL)
return p;
}
if (p == NULL && !silent)
{
const char *guessed = lookup_component_fuzzy (name, sym->components);
if (guessed)
gfc_error ("%qs at %C is not a member of the %qs structure"
"; did you mean %qs?",
name, sym->name, guessed);
else
gfc_error ("%qs at %C is not a member of the %qs structure",
name, sym->name);
}
/* Component was found; build the ultimate component reference. */
if (p != NULL && ref)
{
tmp = gfc_get_ref ();
tmp->type = REF_COMPONENT;
tmp->u.c.component = p;
tmp->u.c.sym = sym;
/* Link the final component ref to the end of the chain of subrefs. */
if (sref)
{
*ref = sref;
for (; sref->next; sref = sref->next)
;
sref->next = tmp;
}
else
*ref = tmp;
}
return p;
}
/* Given a symbol, free all of the component structures and everything
they point to. */
static void
free_components (gfc_component *p)
{
gfc_component *q;
for (; p; p = q)
{
q = p->next;
gfc_free_array_spec (p->as);
gfc_free_expr (p->initializer);
if (p->kind_expr)
gfc_free_expr (p->kind_expr);
if (p->param_list)
gfc_free_actual_arglist (p->param_list);
free (p->tb);
p->tb = NULL;
free (p);
}
}
/******************** Statement label management ********************/
/* Comparison function for statement labels, used for managing the
binary tree. */
static int
compare_st_labels (void *a1, void *b1)
{
int a = ((gfc_st_label *) a1)->value;
int b = ((gfc_st_label *) b1)->value;
return (b - a);
}
/* Free a single gfc_st_label structure, making sure the tree is not
messed up. This function is called only when some parse error
occurs. */
void
gfc_free_st_label (gfc_st_label *label)
{
if (label == NULL)
return;
gfc_delete_bbt (&label->ns->st_labels, label, compare_st_labels);
if (label->format != NULL)
gfc_free_expr (label->format);
free (label);
}
/* Free a whole tree of gfc_st_label structures. */
static void
free_st_labels (gfc_st_label *label)
{
if (label == NULL)
return;
free_st_labels (label->left);
free_st_labels (label->right);
if (label->format != NULL)
gfc_free_expr (label->format);
free (label);
}
/* Given a label number, search for and return a pointer to the label
structure, creating it if it does not exist. */
gfc_st_label *
gfc_get_st_label (int labelno)
{
gfc_st_label *lp;
gfc_namespace *ns;
if (gfc_current_state () == COMP_DERIVED)
ns = gfc_current_block ()->f2k_derived;
else
{
/* Find the namespace of the scoping unit:
If we're in a BLOCK construct, jump to the parent namespace. */
ns = gfc_current_ns;
while (ns->proc_name && ns->proc_name->attr.flavor == FL_LABEL)
ns = ns->parent;
}
/* First see if the label is already in this namespace. */
lp = ns->st_labels;
while (lp)
{
if (lp->value == labelno)
return lp;
if (lp->value < labelno)
lp = lp->left;
else
lp = lp->right;
}
lp = XCNEW (gfc_st_label);
lp->value = labelno;
lp->defined = ST_LABEL_UNKNOWN;
lp->referenced = ST_LABEL_UNKNOWN;
lp->ns = ns;
gfc_insert_bbt (&ns->st_labels, lp, compare_st_labels);
return lp;
}
/* Called when a statement with a statement label is about to be
accepted. We add the label to the list of the current namespace,
making sure it hasn't been defined previously and referenced
correctly. */
void
gfc_define_st_label (gfc_st_label *lp, gfc_sl_type type, locus *label_locus)
{
int labelno;
labelno = lp->value;
if (lp->defined != ST_LABEL_UNKNOWN)
gfc_error ("Duplicate statement label %d at %L and %L", labelno,
&lp->where, label_locus);
else
{
lp->where = *label_locus;
switch (type)
{
case ST_LABEL_FORMAT:
if (lp->referenced == ST_LABEL_TARGET
|| lp->referenced == ST_LABEL_DO_TARGET)
gfc_error ("Label %d at %C already referenced as branch target",
labelno);
else
lp->defined = ST_LABEL_FORMAT;
break;
case ST_LABEL_TARGET:
case ST_LABEL_DO_TARGET:
if (lp->referenced == ST_LABEL_FORMAT)
gfc_error ("Label %d at %C already referenced as a format label",
labelno);
else
lp->defined = type;
if (lp->referenced == ST_LABEL_DO_TARGET && type != ST_LABEL_DO_TARGET
&& !gfc_notify_std (GFC_STD_F95_OBS | GFC_STD_F2018_DEL,
"DO termination statement which is not END DO"
" or CONTINUE with label %d at %C", labelno))
return;
break;
default:
lp->defined = ST_LABEL_BAD_TARGET;
lp->referenced = ST_LABEL_BAD_TARGET;
}
}
}
/* Reference a label. Given a label and its type, see if that
reference is consistent with what is known about that label,
updating the unknown state. Returns false if something goes
wrong. */
bool
gfc_reference_st_label (gfc_st_label *lp, gfc_sl_type type)
{
gfc_sl_type label_type;
int labelno;
bool rc;
if (lp == NULL)
return true;
labelno = lp->value;
if (lp->defined != ST_LABEL_UNKNOWN)
label_type = lp->defined;
else
{
label_type = lp->referenced;
lp->where = gfc_current_locus;
}
if (label_type == ST_LABEL_FORMAT
&& (type == ST_LABEL_TARGET || type == ST_LABEL_DO_TARGET))
{
gfc_error ("Label %d at %C previously used as a FORMAT label", labelno);
rc = false;
goto done;
}
if ((label_type == ST_LABEL_TARGET || label_type == ST_LABEL_DO_TARGET
|| label_type == ST_LABEL_BAD_TARGET)
&& type == ST_LABEL_FORMAT)
{
gfc_error ("Label %d at %C previously used as branch target", labelno);
rc = false;
goto done;
}
if (lp->referenced == ST_LABEL_DO_TARGET && type == ST_LABEL_DO_TARGET
&& !gfc_notify_std (GFC_STD_F95_OBS | GFC_STD_F2018_DEL,
"Shared DO termination label %d at %C", labelno))
return false;
if (type == ST_LABEL_DO_TARGET
&& !gfc_notify_std (GFC_STD_F2018_OBS, "Labeled DO statement "
"at %L", &gfc_current_locus))
return false;
if (lp->referenced != ST_LABEL_DO_TARGET)
lp->referenced = type;
rc = true;
done:
return rc;
}
/************** Symbol table management subroutines ****************/
/* Basic details: Fortran 95 requires a potentially unlimited number
of distinct namespaces when compiling a program unit. This case
occurs during a compilation of internal subprograms because all of
the internal subprograms must be read before we can start
generating code for the host.
Given the tricky nature of the Fortran grammar, we must be able to
undo changes made to a symbol table if the current interpretation
of a statement is found to be incorrect. Whenever a symbol is
looked up, we make a copy of it and link to it. All of these
symbols are kept in a vector so that we can commit or
undo the changes at a later time.
A symtree may point to a symbol node outside of its namespace. In
this case, that symbol has been used as a host associated variable
at some previous time. */
/* Allocate a new namespace structure. Copies the implicit types from
PARENT if PARENT_TYPES is set. */
gfc_namespace *
gfc_get_namespace (gfc_namespace *parent, int parent_types)
{
gfc_namespace *ns;
gfc_typespec *ts;
int in;
int i;
ns = XCNEW (gfc_namespace);
ns->sym_root = NULL;
ns->uop_root = NULL;
ns->tb_sym_root = NULL;
ns->finalizers = NULL;
ns->default_access = ACCESS_UNKNOWN;
ns->parent = parent;
for (in = GFC_INTRINSIC_BEGIN; in != GFC_INTRINSIC_END; in++)
{
ns->operator_access[in] = ACCESS_UNKNOWN;
ns->tb_op[in] = NULL;
}
/* Initialize default implicit types. */
for (i = 'a'; i <= 'z'; i++)
{
ns->set_flag[i - 'a'] = 0;
ts = &ns->default_type[i - 'a'];
if (parent_types && ns->parent != NULL)
{
/* Copy parent settings. */
*ts = ns->parent->default_type[i - 'a'];
continue;
}
if (flag_implicit_none != 0)
{
gfc_clear_ts (ts);
continue;
}
if ('i' <= i && i <= 'n')
{
ts->type = BT_INTEGER;
ts->kind = gfc_default_integer_kind;
}
else
{
ts->type = BT_REAL;
ts->kind = gfc_default_real_kind;
}
}
ns->refs = 1;
return ns;
}
/* Comparison function for symtree nodes. */
static int
compare_symtree (void *_st1, void *_st2)
{
gfc_symtree *st1, *st2;
st1 = (gfc_symtree *) _st1;
st2 = (gfc_symtree *) _st2;
return strcmp (st1->name, st2->name);
}
/* Allocate a new symtree node and associate it with the new symbol. */
gfc_symtree *
gfc_new_symtree (gfc_symtree **root, const char *name)
{
gfc_symtree *st;
st = XCNEW (gfc_symtree);
st->name = gfc_get_string ("%s", name);
gfc_insert_bbt (root, st, compare_symtree);
return st;
}
/* Delete a symbol from the tree. Does not free the symbol itself! */
static void
gfc_delete_symtree (gfc_symtree **root, const char *name)
{
gfc_symtree st, *st0;
const char *p;
/* Submodules are marked as mod.submod. When freeing a submodule
symbol, the symtree only has "submod", so adjust that here. */
p = strrchr(name, '.');
if (p)
p++;
else
p = name;
st.name = gfc_get_string ("%s", p);
st0 = (gfc_symtree *) gfc_delete_bbt (root, &st, compare_symtree);
free (st0);
}
/* Given a root symtree node and a name, try to find the symbol within
the namespace. Returns NULL if the symbol is not found. */
gfc_symtree *
gfc_find_symtree (gfc_symtree *st, const char *name)
{
int c;
while (st != NULL)
{
c = strcmp (name, st->name);
if (c == 0)
return st;
st = (c < 0) ? st->left : st->right;
}
return NULL;
}
/* Return a symtree node with a name that is guaranteed to be unique
within the namespace and corresponds to an illegal fortran name. */
gfc_symtree *
gfc_get_unique_symtree (gfc_namespace *ns)
{
char name[GFC_MAX_SYMBOL_LEN + 1];
static int serial = 0;
sprintf (name, "@%d", serial++);
return gfc_new_symtree (&ns->sym_root, name);
}
/* Given a name find a user operator node, creating it if it doesn't
exist. These are much simpler than symbols because they can't be
ambiguous with one another. */
gfc_user_op *
gfc_get_uop (const char *name)
{
gfc_user_op *uop;
gfc_symtree *st;
gfc_namespace *ns = gfc_current_ns;
if (ns->omp_udr_ns)
ns = ns->parent;
st = gfc_find_symtree (ns->uop_root, name);
if (st != NULL)
return st->n.uop;
st = gfc_new_symtree (&ns->uop_root, name);
uop = st->n.uop = XCNEW (gfc_user_op);
uop->name = gfc_get_string ("%s", name);
uop->access = ACCESS_UNKNOWN;
uop->ns = ns;
return uop;
}
/* Given a name find the user operator node. Returns NULL if it does
not exist. */
gfc_user_op *
gfc_find_uop (const char *name, gfc_namespace *ns)
{
gfc_symtree *st;
if (ns == NULL)
ns = gfc_current_ns;
st = gfc_find_symtree (ns->uop_root, name);
return (st == NULL) ? NULL : st->n.uop;
}
/* Update a symbol's common_block field, and take care of the associated
memory management. */
static void
set_symbol_common_block (gfc_symbol *sym, gfc_common_head *common_block)
{
if (sym->common_block == common_block)
return;
if (sym->common_block && sym->common_block->name[0] != '\0')
{
sym->common_block->refs--;
if (sym->common_block->refs == 0)
free (sym->common_block);
}
sym->common_block = common_block;
}
/* Remove a gfc_symbol structure and everything it points to. */
void
gfc_free_symbol (gfc_symbol *&sym)
{
if (sym == NULL)
return;
gfc_free_array_spec (sym->as);
free_components (sym->components);
gfc_free_expr (sym->value);
gfc_free_namelist (sym->namelist);
if (sym->ns != sym->formal_ns)
gfc_free_namespace (sym->formal_ns);
if (!sym->attr.generic_copy)
gfc_free_interface (sym->generic);
gfc_free_formal_arglist (sym->formal);
gfc_free_namespace (sym->f2k_derived);
set_symbol_common_block (sym, NULL);
if (sym->param_list)
gfc_free_actual_arglist (sym->param_list);
free (sym);
sym = NULL;
}
/* Returns true if the symbol SYM has, through its FORMAL_NS field, a reference
to itself which should be eliminated for the symbol memory to be released
via normal reference counting.
The implementation is crucial as it controls the proper release of symbols,
especially (contained) procedure symbols, which can represent a lot of memory
through the namespace of their body.
We try to avoid freeing too much memory (causing dangling pointers), to not
leak too much (wasting memory), and to avoid expensive walks of the symbol
tree (which would be the correct way to check for a cycle). */
bool
cyclic_reference_break_needed (gfc_symbol *sym)
{
/* Normal symbols don't reference themselves. */
if (sym->formal_ns == nullptr)
return false;
/* Procedures at the root of the file do have a self reference, but they don't
have a reference in a parent namespace preventing the release of the
procedure namespace, so they can use the normal reference counting. */
if (sym->formal_ns == sym->ns)
return false;
/* If sym->refs == 1, we can use normal reference counting. If sym->refs > 2,
the symbol won't be freed anyway, with or without cyclic reference. */
if (sym->refs != 2)
return false;
/* Procedure symbols host-associated from a module in submodules are special,
because the namespace of the procedure block in the submodule is different
from the FORMAL_NS namespace generated by host-association. So there are
two different namespaces representing the same procedure namespace. As
FORMAL_NS comes from host-association, which only imports symbols visible
from the outside (dummy arguments basically), we can assume there is no
self reference through FORMAL_NS in that case. */
if (sym->attr.host_assoc && sym->attr.used_in_submodule)
return false;
/* We can assume that contained procedures have cyclic references, because
the symbol of the procedure itself is accessible in the procedure body
namespace. So we assume that symbols with a formal namespace different
from the declaration namespace and two references, one of which is about
to be removed, are procedures with just the self reference left. At this
point, the symbol SYM matches that pattern, so we return true here to
permit the release of SYM. */
return true;
}
/* Decrease the reference counter and free memory when we reach zero.
Returns true if the symbol has been freed, false otherwise. */
bool
gfc_release_symbol (gfc_symbol *&sym)
{
if (sym == NULL)
return false;
if (cyclic_reference_break_needed (sym))
{
/* As formal_ns contains a reference to sym, delete formal_ns just
before the deletion of sym. */
gfc_namespace *ns = sym->formal_ns;
sym->formal_ns = NULL;
gfc_free_namespace (ns);
}
sym->refs--;
if (sym->refs > 0)
return false;
gcc_assert (sym->refs == 0);
gfc_free_symbol (sym);
return true;
}
/* Allocate and initialize a new symbol node. */
gfc_symbol *
gfc_new_symbol (const char *name, gfc_namespace *ns)
{
gfc_symbol *p;
p = XCNEW (gfc_symbol);
gfc_clear_ts (&p->ts);
gfc_clear_attr (&p->attr);
p->ns = ns;
p->declared_at = gfc_current_locus;
p->name = gfc_get_string ("%s", name);
return p;
}
/* Generate an error if a symbol is ambiguous, and set the error flag
on it. */
static void
ambiguous_symbol (const char *name, gfc_symtree *st)
{
if (st->n.sym->error)
return;
if (st->n.sym->module)
gfc_error ("Name %qs at %C is an ambiguous reference to %qs "
"from module %qs", name, st->n.sym->name, st->n.sym->module);
else
gfc_error ("Name %qs at %C is an ambiguous reference to %qs "
"from current program unit", name, st->n.sym->name);
st->n.sym->error = 1;
}
/* If we're in a SELECT TYPE block, check if the variable 'st' matches any
selector on the stack. If yes, replace it by the corresponding temporary. */
static void
select_type_insert_tmp (gfc_symtree **st)
{
gfc_select_type_stack *stack = select_type_stack;
for (; stack; stack = stack->prev)
if ((*st)->n.sym == stack->selector && stack->tmp)
{
*st = stack->tmp;
select_type_insert_tmp (st);
return;
}
}
/* Look for a symtree in the current procedure -- that is, go up to
parent namespaces but only if inside a BLOCK. Returns NULL if not found. */
gfc_symtree*
gfc_find_symtree_in_proc (const char* name, gfc_namespace* ns)
{
while (ns)
{
gfc_symtree* st = gfc_find_symtree (ns->sym_root, name);
if (st)
return st;
if (!ns->construct_entities)
break;
ns = ns->parent;
}
return NULL;
}
/* Search for a symtree starting in the current namespace, resorting to
any parent namespaces if requested by a nonzero parent_flag.
Returns true if the name is ambiguous. */
bool
gfc_find_sym_tree (const char *name, gfc_namespace *ns, int parent_flag,
gfc_symtree **result)
{
gfc_symtree *st;
if (ns == NULL)
ns = gfc_current_ns;
do
{
st = gfc_find_symtree (ns->sym_root, name);
if (st != NULL)
{
select_type_insert_tmp (&st);
*result = st;
/* Ambiguous generic interfaces are permitted, as long
as the specific interfaces are different. */
if (st->ambiguous && !st->n.sym->attr.generic)
{
ambiguous_symbol (name, st);
return true;
}
return false;
}
if (!parent_flag)
break;
/* Don't escape an interface block. */
if (ns && !ns->has_import_set
&& ns->proc_name && ns->proc_name->attr.if_source == IFSRC_IFBODY)
break;
ns = ns->parent;
}
while (ns != NULL);
if (gfc_current_state() == COMP_DERIVED
&& gfc_current_block ()->attr.pdt_template)
{
gfc_symbol *der = gfc_current_block ();
for (; der; der = gfc_get_derived_super_type (der))
{
if (der->f2k_derived && der->f2k_derived->sym_root)
{
st = gfc_find_symtree (der->f2k_derived->sym_root, name);
if (st)
break;
}
}
*result = st;
return false;
}
*result = NULL;
return false;
}
/* Same, but returns the symbol instead. */
int
gfc_find_symbol (const char *name, gfc_namespace *ns, int parent_flag,
gfc_symbol **result)
{
gfc_symtree *st;
int i;
i = gfc_find_sym_tree (name, ns, parent_flag, &st);
if (st == NULL)
*result = NULL;
else
*result = st->n.sym;
return i;
}
/* Tells whether there is only one set of changes in the stack. */
static bool
single_undo_checkpoint_p (void)
{
if (latest_undo_chgset == &default_undo_chgset_var)
{
gcc_assert (latest_undo_chgset->previous == NULL);
return true;
}
else
{
gcc_assert (latest_undo_chgset->previous != NULL);
return false;
}
}
/* Save symbol with the information necessary to back it out. */
void
gfc_save_symbol_data (gfc_symbol *sym)
{
gfc_symbol *s;
unsigned i;
if (!single_undo_checkpoint_p ())
{
/* If there is more than one change set, look for the symbol in the
current one. If it is found there, we can reuse it. */
FOR_EACH_VEC_ELT (latest_undo_chgset->syms, i, s)
if (s == sym)
{
gcc_assert (sym->gfc_new || sym->old_symbol != NULL);
return;
}
}
else if (sym->gfc_new || sym->old_symbol != NULL)
return;
s = XCNEW (gfc_symbol);
*s = *sym;
sym->old_symbol = s;
sym->gfc_new = 0;
latest_undo_chgset->syms.safe_push (sym);
}
/* Given a name, find a symbol, or create it if it does not exist yet
in the current namespace. If the symbol is found we make sure that
it's OK.
The integer return code indicates
0 All OK
1 The symbol name was ambiguous
2 The name meant to be established was already host associated.
So if the return value is nonzero, then an error was issued. */
int
gfc_get_sym_tree (const char *name, gfc_namespace *ns, gfc_symtree **result,
bool allow_subroutine)
{
gfc_symtree *st;
gfc_symbol *p;
/* This doesn't usually happen during resolution. */
if (ns == NULL)
ns = gfc_current_ns;
/* Try to find the symbol in ns. */
st = gfc_find_symtree (ns->sym_root, name);
if (st == NULL && ns->omp_udr_ns)
{
ns = ns->parent;
st = gfc_find_symtree (ns->sym_root, name);
}
if (st == NULL)
{
/* If not there, create a new symbol. */
p = gfc_new_symbol (name, ns);
/* Add to the list of tentative symbols. */
p->old_symbol = NULL;
p->mark = 1;
p->gfc_new = 1;
latest_undo_chgset->syms.safe_push (p);
st = gfc_new_symtree (&ns->sym_root, name);
st->n.sym = p;
p->refs++;
}
else
{
/* Make sure the existing symbol is OK. Ambiguous
generic interfaces are permitted, as long as the
specific interfaces are different. */
if (st->ambiguous && !st->n.sym->attr.generic)
{
ambiguous_symbol (name, st);
return 1;
}
p = st->n.sym;
if (p->ns != ns && (!p->attr.function || ns->proc_name != p)
&& !(allow_subroutine && p->attr.subroutine)
&& !(ns->proc_name && ns->proc_name->attr.if_source == IFSRC_IFBODY
&& (ns->has_import_set || p->attr.imported)))
{
/* Symbol is from another namespace. */
gfc_error ("Symbol %qs at %C has already been host associated",
name);
return 2;
}
p->mark = 1;
/* Copy in case this symbol is changed. */
gfc_save_symbol_data (p);
}
*result = st;
return 0;
}
int
gfc_get_symbol (const char *name, gfc_namespace *ns, gfc_symbol **result)
{
gfc_symtree *st;
int i;
i = gfc_get_sym_tree (name, ns, &st, false);
if (i != 0)
return i;
if (st)
*result = st->n.sym;
else
*result = NULL;
return i;
}
/* Subroutine that searches for a symbol, creating it if it doesn't
exist, but tries to host-associate the symbol if possible. */
int
gfc_get_ha_sym_tree (const char *name, gfc_symtree **result)
{
gfc_symtree *st;
int i;
i = gfc_find_sym_tree (name, gfc_current_ns, 0, &st);
if (st != NULL)
{
gfc_save_symbol_data (st->n.sym);
*result = st;
return i;
}
i = gfc_find_sym_tree (name, gfc_current_ns, 1, &st);
if (i)
return i;
if (st != NULL)
{
*result = st;
return 0;
}
return gfc_get_sym_tree (name, gfc_current_ns, result, false);
}
int
gfc_get_ha_symbol (const char *name, gfc_symbol **result)
{
int i;
gfc_symtree *st;
i = gfc_get_ha_sym_tree (name, &st);
if (st)
*result = st->n.sym;
else
*result = NULL;
return i;
}
/* Search for the symtree belonging to a gfc_common_head; we cannot use
head->name as the common_root symtree's name might be mangled. */
static gfc_symtree *
find_common_symtree (gfc_symtree *st, gfc_common_head *head)
{
gfc_symtree *result;
if (st == NULL)
return NULL;
if (st->n.common == head)
return st;
result = find_common_symtree (st->left, head);
if (!result)
result = find_common_symtree (st->right, head);
return result;
}
/* Restore previous state of symbol. Just copy simple stuff. */
static void
restore_old_symbol (gfc_symbol *p)
{
gfc_symbol *old;
p->mark = 0;
old = p->old_symbol;
p->ts.type = old->ts.type;
p->ts.kind = old->ts.kind;
p->attr = old->attr;
if (p->value != old->value)
{
gcc_checking_assert (old->value == NULL);
gfc_free_expr (p->value);
p->value = NULL;
}
if (p->as != old->as)
{
if (p->as)
gfc_free_array_spec (p->as);
p->as = old->as;
}
p->generic = old->generic;
p->component_access = old->component_access;
if (p->namelist != NULL && old->namelist == NULL)
{
gfc_free_namelist (p->namelist);
p->namelist = NULL;
}
else
{
if (p->namelist_tail != old->namelist_tail)
{
gfc_free_namelist (old->namelist_tail->next);
old->namelist_tail->next = NULL;
}
}
p->namelist_tail = old->namelist_tail;
if (p->formal != old->formal)
{
gfc_free_formal_arglist (p->formal);
p->formal = old->formal;
}
set_symbol_common_block (p, old->common_block);
p->common_head = old->common_head;
p->old_symbol = old->old_symbol;
free (old);
}
/* Frees the internal data of a gfc_undo_change_set structure. Doesn't free
the structure itself. */
static void
free_undo_change_set_data (gfc_undo_change_set &cs)
{
cs.syms.release ();
cs.tbps.release ();
}
/* Given a change set pointer, free its target's contents and update it with
the address of the previous change set. Note that only the contents are
freed, not the target itself (the contents' container). It is not a problem
as the latter will be a local variable usually. */
static void
pop_undo_change_set (gfc_undo_change_set *&cs)
{
free_undo_change_set_data (*cs);
cs = cs->previous;
}
static void free_old_symbol (gfc_symbol *sym);
/* Merges the current change set into the previous one. The changes themselves
are left untouched; only one checkpoint is forgotten. */
void
gfc_drop_last_undo_checkpoint (void)
{
gfc_symbol *s, *t;
unsigned i, j;
FOR_EACH_VEC_ELT (latest_undo_chgset->syms, i, s)
{
/* No need to loop in this case. */
if (s->old_symbol == NULL)
continue;
/* Remove the duplicate symbols. */
FOR_EACH_VEC_ELT (latest_undo_chgset->previous->syms, j, t)
if (t == s)
{
latest_undo_chgset->previous->syms.unordered_remove (j);
/* S->OLD_SYMBOL is the backup symbol for S as it was at the
last checkpoint. We drop that checkpoint, so S->OLD_SYMBOL
shall contain from now on the backup symbol for S as it was
at the checkpoint before. */
if (s->old_symbol->gfc_new)
{
gcc_assert (s->old_symbol->old_symbol == NULL);
s->gfc_new = s->old_symbol->gfc_new;
free_old_symbol (s);
}
else
restore_old_symbol (s->old_symbol);
break;
}
}
latest_undo_chgset->previous->syms.safe_splice (latest_undo_chgset->syms);
latest_undo_chgset->previous->tbps.safe_splice (latest_undo_chgset->tbps);
pop_undo_change_set (latest_undo_chgset);
}
/* Remove the reference to the symbol SYM in the symbol tree held by NS
and free SYM if the last reference to it has been removed.
Returns whether the symbol has been freed. */
static bool
delete_symbol_from_ns (gfc_symbol *sym, gfc_namespace *ns)
{
if (ns == nullptr)
return false;
/* The derived type is saved in the symtree with the first
letter capitalized; the all lower-case version to the
derived type contains its associated generic function. */
const char *sym_name = gfc_fl_struct (sym->attr.flavor)
? gfc_dt_upper_string (sym->name)
: sym->name;
gfc_delete_symtree (&ns->sym_root, sym_name);
return gfc_release_symbol (sym);
}
/* Undoes all the changes made to symbols since the previous checkpoint.
This subroutine is made simpler due to the fact that attributes are
never removed once added. */
void
gfc_restore_last_undo_checkpoint (void)
{
gfc_symbol *p;
unsigned i;
FOR_EACH_VEC_ELT_REVERSE (latest_undo_chgset->syms, i, p)
{
/* Symbol in a common block was new. Or was old and just put in common */
if (p->common_block
&& (p->gfc_new || !p->old_symbol->common_block))
{
/* If the symbol was added to any common block, it
needs to be removed to stop the resolver looking
for a (possibly) dead symbol. */
if (p->common_block->head == p && !p->common_next)
{
gfc_symtree st, *st0;
st0 = find_common_symtree (p->ns->common_root,
p->common_block);
if (st0)
{
st.name = st0->name;
gfc_delete_bbt (&p->ns->common_root, &st, compare_symtree);
free (st0);
}
}
if (p->common_block->head == p)
p->common_block->head = p->common_next;
else
{
gfc_symbol *cparent, *csym;
cparent = p->common_block->head;
csym = cparent->common_next;
while (csym != p)
{
cparent = csym;
csym = csym->common_next;
}
gcc_assert(cparent->common_next == p);
cparent->common_next = csym->common_next;
}
p->common_next = NULL;
}
if (p->gfc_new)
{
bool freed = delete_symbol_from_ns (p, p->ns);
/* If the symbol is a procedure (function or subroutine), remove
it from the procedure body namespace as well as from the outer
namespace. */
if (!freed
&& p->formal_ns != p->ns)
freed = delete_symbol_from_ns (p, p->formal_ns);
/* If the formal_ns field has not been set yet, the previous
conditional does nothing. In that case, we can assume that
gfc_current_ns is the procedure body namespace, and remove the
symbol from there. */
if (!freed
&& gfc_current_ns != p->ns
&& gfc_current_ns != p->formal_ns)
freed = delete_symbol_from_ns (p, gfc_current_ns);
}
else
restore_old_symbol (p);
}
latest_undo_chgset->syms.truncate (0);
latest_undo_chgset->tbps.truncate (0);
if (!single_undo_checkpoint_p ())
pop_undo_change_set (latest_undo_chgset);
}
/* Makes sure that there is only one set of changes; in other words we haven't
forgotten to pair a call to gfc_new_checkpoint with a call to either
gfc_drop_last_undo_checkpoint or gfc_restore_last_undo_checkpoint. */
static void
enforce_single_undo_checkpoint (void)
{
gcc_checking_assert (single_undo_checkpoint_p ());
}
/* Undoes all the changes made to symbols in the current statement. */
void
gfc_undo_symbols (void)
{
enforce_single_undo_checkpoint ();
gfc_restore_last_undo_checkpoint ();
}
/* Free sym->old_symbol. sym->old_symbol is mostly a shallow copy of sym; the
components of old_symbol that might need deallocation are the "allocatables"
that are restored in gfc_undo_symbols(), with two exceptions: namelist and
namelist_tail. In case these differ between old_symbol and sym, it's just
because sym->namelist has gotten a few more items. */
static void
free_old_symbol (gfc_symbol *sym)
{
if (sym->old_symbol == NULL)
return;
if (sym->old_symbol->as != NULL
&& sym->old_symbol->as != sym->as
&& !(sym->ts.type == BT_CLASS
&& sym->ts.u.derived->attr.is_class
&& sym->old_symbol->as == CLASS_DATA (sym)->as))
gfc_free_array_spec (sym->old_symbol->as);
if (sym->old_symbol->value != sym->value)
gfc_free_expr (sym->old_symbol->value);
if (sym->old_symbol->formal != sym->formal)
gfc_free_formal_arglist (sym->old_symbol->formal);
free (sym->old_symbol);
sym->old_symbol = NULL;
}
/* Makes the changes made in the current statement permanent-- gets
rid of undo information. */
void
gfc_commit_symbols (void)
{
gfc_symbol *p;
gfc_typebound_proc *tbp;
unsigned i;
enforce_single_undo_checkpoint ();
FOR_EACH_VEC_ELT (latest_undo_chgset->syms, i, p)
{
p->mark = 0;
p->gfc_new = 0;
free_old_symbol (p);
}
latest_undo_chgset->syms.truncate (0);
FOR_EACH_VEC_ELT (latest_undo_chgset->tbps, i, tbp)
tbp->error = 0;
latest_undo_chgset->tbps.truncate (0);
}
/* Makes the changes made in one symbol permanent -- gets rid of undo
information. */
void
gfc_commit_symbol (gfc_symbol *sym)
{
gfc_symbol *p;
unsigned i;
enforce_single_undo_checkpoint ();
FOR_EACH_VEC_ELT (latest_undo_chgset->syms, i, p)
if (p == sym)
{
latest_undo_chgset->syms.unordered_remove (i);
break;
}
sym->mark = 0;
sym->gfc_new = 0;
free_old_symbol (sym);
}
/* Recursively free trees containing type-bound procedures. */
static void
free_tb_tree (gfc_symtree *t)
{
if (t == NULL)
return;
free_tb_tree (t->left);
free_tb_tree (t->right);
/* TODO: Free type-bound procedure u.generic */
free (t->n.tb);
t->n.tb = NULL;
free (t);
}
/* Recursive function that deletes an entire tree and all the common
head structures it points to. */
static void
free_common_tree (gfc_symtree * common_tree)
{
if (common_tree == NULL)
return;
free_common_tree (common_tree->left);
free_common_tree (common_tree->right);
free (common_tree);
}
/* Recursive function that deletes an entire tree and all the common
head structures it points to. */
static void
free_omp_udr_tree (gfc_symtree * omp_udr_tree)
{
if (omp_udr_tree == NULL)
return;
free_omp_udr_tree (omp_udr_tree->left);
free_omp_udr_tree (omp_udr_tree->right);
gfc_free_omp_udr (omp_udr_tree->n.omp_udr);
free (omp_udr_tree);
}
/* Recursive function that deletes an entire tree and all the user
operator nodes that it contains. */
static void
free_uop_tree (gfc_symtree *uop_tree)
{
if (uop_tree == NULL)
return;
free_uop_tree (uop_tree->left);
free_uop_tree (uop_tree->right);
gfc_free_interface (uop_tree->n.uop->op);
free (uop_tree->n.uop);
free (uop_tree);
}
/* Recursive function that deletes an entire tree and all the symbols
that it contains. */
static void
free_sym_tree (gfc_symtree *sym_tree)
{
if (sym_tree == NULL)
return;
free_sym_tree (sym_tree->left);
free_sym_tree (sym_tree->right);
gfc_release_symbol (sym_tree->n.sym);
free (sym_tree);
}
/* Free the gfc_equiv_info's. */
static void
gfc_free_equiv_infos (gfc_equiv_info *s)
{
if (s == NULL)
return;
gfc_free_equiv_infos (s->next);
free (s);
}
/* Free the gfc_equiv_lists. */
static void
gfc_free_equiv_lists (gfc_equiv_list *l)
{
if (l == NULL)
return;
gfc_free_equiv_lists (l->next);
gfc_free_equiv_infos (l->equiv);
free (l);
}
/* Free a finalizer procedure list. */
void
gfc_free_finalizer (gfc_finalizer* el)
{
if (el)
{
gfc_release_symbol (el->proc_sym);
free (el);
}
}
static void
gfc_free_finalizer_list (gfc_finalizer* list)
{
while (list)
{
gfc_finalizer* current = list;
list = list->next;
gfc_free_finalizer (current);
}
}
/* Create a new gfc_charlen structure and add it to a namespace.
If 'old_cl' is given, the newly created charlen will be a copy of it. */
gfc_charlen*
gfc_new_charlen (gfc_namespace *ns, gfc_charlen *old_cl)
{
gfc_charlen *cl;
cl = gfc_get_charlen ();
/* Copy old_cl. */
if (old_cl)
{
cl->length = gfc_copy_expr (old_cl->length);
cl->length_from_typespec = old_cl->length_from_typespec;
cl->backend_decl = old_cl->backend_decl;
cl->passed_length = old_cl->passed_length;
cl->resolved = old_cl->resolved;
}
/* Put into namespace. */
cl->next = ns->cl_list;
ns->cl_list = cl;
return cl;
}
/* Free the charlen list from cl to end (end is not freed).
Free the whole list if end is NULL. */
static void
gfc_free_charlen (gfc_charlen *cl, gfc_charlen *end)
{
gfc_charlen *cl2;
for (; cl != end; cl = cl2)
{
gcc_assert (cl);
cl2 = cl->next;
gfc_free_expr (cl->length);
free (cl);
}
}
/* Free entry list structs. */
static void
free_entry_list (gfc_entry_list *el)
{
gfc_entry_list *next;
if (el == NULL)
return;
next = el->next;
free (el);
free_entry_list (next);
}
/* Free a namespace structure and everything below it. Interface
lists associated with intrinsic operators are not freed. These are
taken care of when a specific name is freed. */
void
gfc_free_namespace (gfc_namespace *&ns)
{
gfc_namespace *p, *q;
int i;
gfc_was_finalized *f;
if (ns == NULL)
return;
ns->refs--;
if (ns->refs > 0)
return;
gcc_assert (ns->refs == 0);
gfc_free_statements (ns->code);
free_sym_tree (ns->sym_root);
free_uop_tree (ns->uop_root);
free_common_tree (ns->common_root);
free_omp_udr_tree (ns->omp_udr_root);
free_tb_tree (ns->tb_sym_root);
free_tb_tree (ns->tb_uop_root);
gfc_free_finalizer_list (ns->finalizers);
gfc_free_omp_declare_simd_list (ns->omp_declare_simd);
gfc_free_omp_declare_variant_list (ns->omp_declare_variant);
gfc_free_charlen (ns->cl_list, NULL);
free_st_labels (ns->st_labels);
free_entry_list (ns->entries);
gfc_free_equiv (ns->equiv);
gfc_free_equiv_lists (ns->equiv_lists);
gfc_free_use_stmts (ns->use_stmts);
for (i = GFC_INTRINSIC_BEGIN; i != GFC_INTRINSIC_END; i++)
gfc_free_interface (ns->op[i]);
gfc_free_data (ns->data);
/* Free all the expr + component combinations that have been
finalized. */
f = ns->was_finalized;
while (f)
{
gfc_was_finalized* current = f;
f = f->next;
free (current);
}
if (ns->omp_assumes)
{
free (ns->omp_assumes->absent);
free (ns->omp_assumes->contains);
gfc_free_expr_list (ns->omp_assumes->holds);
free (ns->omp_assumes);
}
p = ns->contained;
free (ns);
ns = NULL;
/* Recursively free any contained namespaces. */
while (p != NULL)
{
q = p;
p = p->sibling;
gfc_free_namespace (q);
}
}
void
gfc_symbol_init_2 (void)
{
gfc_current_ns = gfc_get_namespace (NULL, 0);
}
void
gfc_symbol_done_2 (void)
{
if (gfc_current_ns != NULL)
{
/* free everything from the root. */
while (gfc_current_ns->parent != NULL)
gfc_current_ns = gfc_current_ns->parent;
gfc_free_namespace (gfc_current_ns);
gfc_current_ns = NULL;
}
gfc_derived_types = NULL;
enforce_single_undo_checkpoint ();
free_undo_change_set_data (*latest_undo_chgset);
}
/* Count how many nodes a symtree has. */
static unsigned
count_st_nodes (const gfc_symtree *st)
{
unsigned nodes;
if (!st)
return 0;
nodes = count_st_nodes (st->left);
nodes++;
nodes += count_st_nodes (st->right);
return nodes;
}
/* Convert symtree tree into symtree vector. */
static unsigned
fill_st_vector (gfc_symtree *st, gfc_symtree **st_vec, unsigned node_cntr)
{
if (!st)
return node_cntr;
node_cntr = fill_st_vector (st->left, st_vec, node_cntr);
st_vec[node_cntr++] = st;
node_cntr = fill_st_vector (st->right, st_vec, node_cntr);
return node_cntr;
}
/* Traverse namespace. As the functions might modify the symtree, we store the
symtree as a vector and operate on this vector. Note: We assume that
sym_func or st_func never deletes nodes from the symtree - only adding is
allowed. Additionally, newly added nodes are not traversed. */
static void
do_traverse_symtree (gfc_symtree *st, void (*st_func) (gfc_symtree *),
void (*sym_func) (gfc_symbol *))
{
gfc_symtree **st_vec;
unsigned nodes, i, node_cntr;
gcc_assert ((st_func && !sym_func) || (!st_func && sym_func));
nodes = count_st_nodes (st);
st_vec = XALLOCAVEC (gfc_symtree *, nodes);
node_cntr = 0;
fill_st_vector (st, st_vec, node_cntr);
if (sym_func)
{
/* Clear marks. */
for (i = 0; i < nodes; i++)
st_vec[i]->n.sym->mark = 0;
for (i = 0; i < nodes; i++)
if (!st_vec[i]->n.sym->mark)
{
(*sym_func) (st_vec[i]->n.sym);
st_vec[i]->n.sym->mark = 1;
}
}
else
for (i = 0; i < nodes; i++)
(*st_func) (st_vec[i]);
}
/* Recursively traverse the symtree nodes. */
void
gfc_traverse_symtree (gfc_symtree *st, void (*st_func) (gfc_symtree *))
{
do_traverse_symtree (st, st_func, NULL);
}
/* Call a given function for all symbols in the namespace. We take
care that each gfc_symbol node is called exactly once. */
void
gfc_traverse_ns (gfc_namespace *ns, void (*sym_func) (gfc_symbol *))
{
do_traverse_symtree (ns->sym_root, NULL, sym_func);
}
/* Return TRUE when name is the name of an intrinsic type. */
bool
gfc_is_intrinsic_typename (const char *name)
{
if (strcmp (name, "integer") == 0
|| strcmp (name, "real") == 0
|| strcmp (name, "character") == 0
|| strcmp (name, "logical") == 0
|| strcmp (name, "complex") == 0
|| strcmp (name, "doubleprecision") == 0
|| strcmp (name, "doublecomplex") == 0)
return true;
else
return false;
}
/* Return TRUE if the symbol is an automatic variable. */
static bool
gfc_is_var_automatic (gfc_symbol *sym)
{
/* Pointer and allocatable variables are never automatic. */
if (sym->attr.pointer || sym->attr.allocatable)
return false;
/* Check for arrays with non-constant size. */
if (sym->attr.dimension && sym->as
&& !gfc_is_compile_time_shape (sym->as))
return true;
/* Check for non-constant length character variables. */
if (sym->ts.type == BT_CHARACTER
&& sym->ts.u.cl
&& !gfc_is_constant_expr (sym->ts.u.cl->length))
return true;
/* Variables with explicit AUTOMATIC attribute. */
if (sym->attr.automatic)
return true;
return false;
}
/* Given a symbol, mark it as SAVEd if it is allowed. */
static void
save_symbol (gfc_symbol *sym)
{
if (sym->attr.use_assoc)
return;
if (sym->attr.in_common
|| sym->attr.in_equivalence
|| sym->attr.dummy
|| sym->attr.result
|| sym->attr.flavor != FL_VARIABLE)
return;
/* Automatic objects are not saved. */
if (gfc_is_var_automatic (sym))
return;
gfc_add_save (&sym->attr, SAVE_EXPLICIT, sym->name, &sym->declared_at);
}
/* Mark those symbols which can be SAVEd as such. */
void
gfc_save_all (gfc_namespace *ns)
{
gfc_traverse_ns (ns, save_symbol);
}
/* Make sure that no changes to symbols are pending. */
void
gfc_enforce_clean_symbol_state(void)
{
enforce_single_undo_checkpoint ();
gcc_assert (latest_undo_chgset->syms.is_empty ());
}
/************** Global symbol handling ************/
/* Search a tree for the global symbol. */
gfc_gsymbol *
gfc_find_gsymbol (gfc_gsymbol *symbol, const char *name)
{
int c;
if (symbol == NULL)
return NULL;
while (symbol)
{
c = strcmp (name, symbol->name);
if (!c)
return symbol;
symbol = (c < 0) ? symbol->left : symbol->right;
}
return NULL;
}
/* Case insensitive search a tree for the global symbol. */
gfc_gsymbol *
gfc_find_case_gsymbol (gfc_gsymbol *symbol, const char *name)
{
int c;
if (symbol == NULL)
return NULL;
while (symbol)
{
c = strcasecmp (name, symbol->name);
if (!c)
return symbol;
symbol = (c < 0) ? symbol->left : symbol->right;
}
return NULL;
}
/* Compare two global symbols. Used for managing the BB tree. */
static int
gsym_compare (void *_s1, void *_s2)
{
gfc_gsymbol *s1, *s2;
s1 = (gfc_gsymbol *) _s1;
s2 = (gfc_gsymbol *) _s2;
return strcmp (s1->name, s2->name);
}
/* Get a global symbol, creating it if it doesn't exist. */
gfc_gsymbol *
gfc_get_gsymbol (const char *name, bool bind_c)
{
gfc_gsymbol *s;
s = gfc_find_gsymbol (gfc_gsym_root, name);
if (s != NULL)
return s;
s = XCNEW (gfc_gsymbol);
s->type = GSYM_UNKNOWN;
s->name = gfc_get_string ("%s", name);
s->bind_c = bind_c;
gfc_insert_bbt (&gfc_gsym_root, s, gsym_compare);
return s;
}
void
gfc_traverse_gsymbol (gfc_gsymbol *gsym,
void (*do_something) (gfc_gsymbol *, void *),
void *data)
{
if (gsym->left)
gfc_traverse_gsymbol (gsym->left, do_something, data);
(*do_something) (gsym, data);
if (gsym->right)
gfc_traverse_gsymbol (gsym->right, do_something, data);
}
static gfc_symbol *
get_iso_c_binding_dt (int sym_id)
{
gfc_symbol *dt_list = gfc_derived_types;
/* Loop through the derived types in the name list, searching for
the desired symbol from iso_c_binding. Search the parent namespaces
if necessary and requested to (parent_flag). */
if (dt_list)
{
while (dt_list->dt_next != gfc_derived_types)
{
if (dt_list->from_intmod != INTMOD_NONE
&& dt_list->intmod_sym_id == sym_id)
return dt_list;
dt_list = dt_list->dt_next;
}
}
return NULL;
}
/* Verifies that the given derived type symbol, derived_sym, is interoperable
with C. This is necessary for any derived type that is BIND(C) and for
derived types that are parameters to functions that are BIND(C). All
fields of the derived type are required to be interoperable, and are tested
for such. If an error occurs, the errors are reported here, allowing for
multiple errors to be handled for a single derived type. */
bool
verify_bind_c_derived_type (gfc_symbol *derived_sym)
{
gfc_component *curr_comp = NULL;
bool is_c_interop = false;
bool retval = true;
if (derived_sym == NULL)
gfc_internal_error ("verify_bind_c_derived_type(): Given symbol is "
"unexpectedly NULL");
/* If we've already looked at this derived symbol, do not look at it again
so we don't repeat warnings/errors. */
if (derived_sym->ts.is_c_interop)
return true;
/* The derived type must have the BIND attribute to be interoperable
J3/04-007, Section 15.2.3. */
if (derived_sym->attr.is_bind_c != 1)
{
derived_sym->ts.is_c_interop = 0;
gfc_error_now ("Derived type %qs declared at %L must have the BIND "
"attribute to be C interoperable", derived_sym->name,
&(derived_sym->declared_at));
retval = false;
}
curr_comp = derived_sym->components;
/* Fortran 2003 allows an empty derived type. C99 appears to disallow an
empty struct. Section 15.2 in Fortran 2003 states: "The following
subclauses define the conditions under which a Fortran entity is
interoperable. If a Fortran entity is interoperable, an equivalent
entity may be defined by means of C and the Fortran entity is said
to be interoperable with the C entity. There does not have to be such
an interoperating C entity."
*/
if (curr_comp == NULL)
{
gfc_warning (0, "Derived type %qs with BIND(C) attribute at %L is empty, "
"and may be inaccessible by the C companion processor",
derived_sym->name, &(derived_sym->declared_at));
derived_sym->ts.is_c_interop = 1;
derived_sym->attr.is_bind_c = 1;
return true;
}
/* Initialize the derived type as being C interoperable.
If we find an error in the components, this will be set false. */
derived_sym->ts.is_c_interop = 1;
/* Loop through the list of components to verify that the kind of
each is a C interoperable type. */
do
{
/* The components cannot be pointers (fortran sense).
J3/04-007, Section 15.2.3, C1505. */
if (curr_comp->attr.pointer != 0)
{
gfc_error ("Component %qs at %L cannot have the "
"POINTER attribute because it is a member "
"of the BIND(C) derived type %qs at %L",
curr_comp->name, &(curr_comp->loc),
derived_sym->name, &(derived_sym->declared_at));
retval = false;
}
if (curr_comp->attr.proc_pointer != 0)
{
gfc_error ("Procedure pointer component %qs at %L cannot be a member"
" of the BIND(C) derived type %qs at %L", curr_comp->name,
&curr_comp->loc, derived_sym->name,
&derived_sym->declared_at);
retval = false;
}
/* The components cannot be allocatable.
J3/04-007, Section 15.2.3, C1505. */
if (curr_comp->attr.allocatable != 0)
{
gfc_error ("Component %qs at %L cannot have the "
"ALLOCATABLE attribute because it is a member "
"of the BIND(C) derived type %qs at %L",
curr_comp->name, &(curr_comp->loc),
derived_sym->name, &(derived_sym->declared_at));
retval = false;
}
/* BIND(C) derived types must have interoperable components. */
if (curr_comp->ts.type == BT_DERIVED
&& curr_comp->ts.u.derived->ts.is_iso_c != 1
&& curr_comp->ts.u.derived != derived_sym)
{
/* This should be allowed; the draft says a derived-type cannot
have type parameters if it is has the BIND attribute. Type
parameters seem to be for making parameterized derived types.
There's no need to verify the type if it is c_ptr/c_funptr. */
retval = verify_bind_c_derived_type (curr_comp->ts.u.derived);
}
else
{
/* Grab the typespec for the given component and test the kind. */
is_c_interop = gfc_verify_c_interop (&(curr_comp->ts));
if (!is_c_interop)
{
/* Report warning and continue since not fatal. The
draft does specify a constraint that requires all fields
to interoperate, but if the user says real(4), etc., it
may interoperate with *something* in C, but the compiler
most likely won't know exactly what. Further, it may not
interoperate with the same data type(s) in C if the user
recompiles with different flags (e.g., -m32 and -m64 on
x86_64 and using integer(4) to claim interop with a
C_LONG). */
if (derived_sym->attr.is_bind_c == 1 && warn_c_binding_type)
/* If the derived type is bind(c), all fields must be
interop. */
gfc_warning (OPT_Wc_binding_type,
"Component %qs in derived type %qs at %L "
"may not be C interoperable, even though "
"derived type %qs is BIND(C)",
curr_comp->name, derived_sym->name,
&(curr_comp->loc), derived_sym->name);
else if (warn_c_binding_type)
/* If derived type is param to bind(c) routine, or to one
of the iso_c_binding procs, it must be interoperable, so
all fields must interop too. */
gfc_warning (OPT_Wc_binding_type,
"Component %qs in derived type %qs at %L "
"may not be C interoperable",
curr_comp->name, derived_sym->name,
&(curr_comp->loc));
}
}
curr_comp = curr_comp->next;
} while (curr_comp != NULL);
if (derived_sym->attr.sequence != 0)
{
gfc_error ("Derived type %qs at %L cannot have the SEQUENCE "
"attribute because it is BIND(C)", derived_sym->name,
&(derived_sym->declared_at));
retval = false;
}
/* Mark the derived type as not being C interoperable if we found an
error. If there were only warnings, proceed with the assumption
it's interoperable. */
if (!retval)
derived_sym->ts.is_c_interop = 0;
return retval;
}
/* Generate symbols for the named constants c_null_ptr and c_null_funptr. */
static bool
gen_special_c_interop_ptr (gfc_symbol *tmp_sym, gfc_symtree *dt_symtree)
{
gfc_constructor *c;
gcc_assert (tmp_sym && dt_symtree && dt_symtree->n.sym);
dt_symtree->n.sym->attr.referenced = 1;
tmp_sym->attr.is_c_interop = 1;
tmp_sym->attr.is_bind_c = 1;
tmp_sym->ts.is_c_interop = 1;
tmp_sym->ts.is_iso_c = 1;
tmp_sym->ts.type = BT_DERIVED;
tmp_sym->ts.f90_type = BT_VOID;
tmp_sym->attr.flavor = FL_PARAMETER;
tmp_sym->ts.u.derived = dt_symtree->n.sym;
/* Set the c_address field of c_null_ptr and c_null_funptr to
the value of NULL. */
tmp_sym->value = gfc_get_expr ();
tmp_sym->value->expr_type = EXPR_STRUCTURE;
tmp_sym->value->ts.type = BT_DERIVED;
tmp_sym->value->ts.f90_type = BT_VOID;
tmp_sym->value->ts.u.derived = tmp_sym->ts.u.derived;
gfc_constructor_append_expr (&tmp_sym->value->value.constructor, NULL, NULL);
c = gfc_constructor_first (tmp_sym->value->value.constructor);
c->expr = gfc_get_int_expr (gfc_index_integer_kind, NULL, 0);
c->expr->ts.is_iso_c = 1;
return true;
}
/* Add a formal argument, gfc_formal_arglist, to the
end of the given list of arguments. Set the reference to the
provided symbol, param_sym, in the argument. */
static void
add_formal_arg (gfc_formal_arglist **head,
gfc_formal_arglist **tail,
gfc_formal_arglist *formal_arg,
gfc_symbol *param_sym)
{
/* Put in list, either as first arg or at the tail (curr arg). */
if (*head == NULL)
*head = *tail = formal_arg;
else
{
(*tail)->next = formal_arg;
(*tail) = formal_arg;
}
(*tail)->sym = param_sym;
(*tail)->next = NULL;
return;
}
/* Add a procedure interface to the given symbol (i.e., store a
reference to the list of formal arguments). */
static void
add_proc_interface (gfc_symbol *sym, ifsrc source, gfc_formal_arglist *formal)
{
sym->formal = formal;
sym->attr.if_source = source;
}
/* Copy the formal args from an existing symbol, src, into a new
symbol, dest. New formal args are created, and the description of
each arg is set according to the existing ones. This function is
used when creating procedure declaration variables from a procedure
declaration statement (see match_proc_decl()) to create the formal
args based on the args of a given named interface.
When an actual argument list is provided, skip the absent arguments
unless copy_type is true.
To be used together with gfc_se->ignore_optional. */
void
gfc_copy_formal_args_intr (gfc_symbol *dest, gfc_intrinsic_sym *src,
gfc_actual_arglist *actual, bool copy_type)
{
gfc_formal_arglist *head = NULL;
gfc_formal_arglist *tail = NULL;
gfc_formal_arglist *formal_arg = NULL;
gfc_intrinsic_arg *curr_arg = NULL;
gfc_formal_arglist *formal_prev = NULL;
gfc_actual_arglist *act_arg = actual;
/* Save current namespace so we can change it for formal args. */
gfc_namespace *parent_ns = gfc_current_ns;
/* Create a new namespace, which will be the formal ns (namespace
of the formal args). */
gfc_current_ns = gfc_get_namespace (parent_ns, 0);
gfc_current_ns->proc_name = dest;
for (curr_arg = src->formal; curr_arg; curr_arg = curr_arg->next)
{
/* Skip absent arguments. */
if (actual)
{
gcc_assert (act_arg != NULL);
if (act_arg->expr == NULL)
{
act_arg = act_arg->next;
continue;
}
}
formal_arg = gfc_get_formal_arglist ();
gfc_get_symbol (curr_arg->name, gfc_current_ns, &(formal_arg->sym));
/* May need to copy more info for the symbol. */
if (copy_type && act_arg->expr != NULL)
{
formal_arg->sym->ts = act_arg->expr->ts;
if (act_arg->expr->rank > 0)
{
formal_arg->sym->attr.dimension = 1;
formal_arg->sym->as = gfc_get_array_spec();
formal_arg->sym->as->rank = -1;
formal_arg->sym->as->type = AS_ASSUMED_RANK;
}
if (act_arg->name && strcmp (act_arg->name, "%VAL") == 0)
formal_arg->sym->pass_as_value = 1;
}
else
formal_arg->sym->ts = curr_arg->ts;
formal_arg->sym->attr.optional = curr_arg->optional;
formal_arg->sym->attr.value = curr_arg->value;
formal_arg->sym->attr.intent = curr_arg->intent;
formal_arg->sym->attr.flavor = FL_VARIABLE;
formal_arg->sym->attr.dummy = 1;
/* Do not treat an actual deferred-length character argument wrongly
as template for the formal argument. */
if (formal_arg->sym->ts.type == BT_CHARACTER
&& !(formal_arg->sym->attr.allocatable
|| formal_arg->sym->attr.pointer))
formal_arg->sym->ts.deferred = false;
if (formal_arg->sym->ts.type == BT_CHARACTER)
formal_arg->sym->ts.u.cl = gfc_new_charlen (gfc_current_ns, NULL);
/* If this isn't the first arg, set up the next ptr. For the
last arg built, the formal_arg->next will never get set to
anything other than NULL. */
if (formal_prev != NULL)
formal_prev->next = formal_arg;
else
formal_arg->next = NULL;
formal_prev = formal_arg;
/* Add arg to list of formal args. */
add_formal_arg (&head, &tail, formal_arg, formal_arg->sym);
/* Validate changes. */
gfc_commit_symbol (formal_arg->sym);
if (actual)
act_arg = act_arg->next;
}
/* Add the interface to the symbol. */
add_proc_interface (dest, IFSRC_DECL, head);
/* Store the formal namespace information. */
if (dest->formal != NULL)
/* The current ns should be that for the dest proc. */
dest->formal_ns = gfc_current_ns;
/* Restore the current namespace to what it was on entry. */
gfc_current_ns = parent_ns;
}
static int
std_for_isocbinding_symbol (int id)
{
switch (id)
{
#define NAMED_INTCST(a,b,c,d) \
case a:\
return d;
#include "iso-c-binding.def"
#undef NAMED_INTCST
#define NAMED_FUNCTION(a,b,c,d) \
case a:\
return d;
#define NAMED_SUBROUTINE(a,b,c,d) \
case a:\
return d;
#include "iso-c-binding.def"
#undef NAMED_FUNCTION
#undef NAMED_SUBROUTINE
default:
return GFC_STD_F2003;
}
}
/* Generate the given set of C interoperable kind objects, or all
interoperable kinds. This function will only be given kind objects
for valid iso_c_binding defined types because this is verified when
the 'use' statement is parsed. If the user gives an 'only' clause,
the specific kinds are looked up; if they don't exist, an error is
reported. If the user does not give an 'only' clause, all
iso_c_binding symbols are generated. If a list of specific kinds
is given, it must have a NULL in the first empty spot to mark the
end of the list. For C_null_(fun)ptr, dt_symtree has to be set and
point to the symtree for c_(fun)ptr. */
gfc_symtree *
generate_isocbinding_symbol (const char *mod_name, iso_c_binding_symbol s,
const char *local_name, gfc_symtree *dt_symtree,
bool hidden)
{
const char *const name = (local_name && local_name[0])
? local_name : c_interop_kinds_table[s].name;
gfc_symtree *tmp_symtree;
gfc_symbol *tmp_sym = NULL;
int index;
if (gfc_notification_std (std_for_isocbinding_symbol (s)) == ERROR)
return NULL;
tmp_symtree = gfc_find_symtree (gfc_current_ns->sym_root, name);
if (hidden
&& (!tmp_symtree || !tmp_symtree->n.sym
|| tmp_symtree->n.sym->from_intmod != INTMOD_ISO_C_BINDING
|| tmp_symtree->n.sym->intmod_sym_id != s))
tmp_symtree = NULL;
/* Already exists in this scope so don't re-add it. */
if (tmp_symtree != NULL && (tmp_sym = tmp_symtree->n.sym) != NULL
&& (!tmp_sym->attr.generic
|| (tmp_sym = gfc_find_dt_in_generic (tmp_sym)) != NULL)
&& tmp_sym->from_intmod == INTMOD_ISO_C_BINDING)
{
if (tmp_sym->attr.flavor == FL_DERIVED
&& !get_iso_c_binding_dt (tmp_sym->intmod_sym_id))
{
if (gfc_derived_types)
{
tmp_sym->dt_next = gfc_derived_types->dt_next;
gfc_derived_types->dt_next = tmp_sym;
}
else
{
tmp_sym->dt_next = tmp_sym;
}
gfc_derived_types = tmp_sym;
}
return tmp_symtree;
}
/* Create the sym tree in the current ns. */
if (hidden)
{
tmp_symtree = gfc_get_unique_symtree (gfc_current_ns);
tmp_sym = gfc_new_symbol (name, gfc_current_ns);
/* Add to the list of tentative symbols. */
latest_undo_chgset->syms.safe_push (tmp_sym);
tmp_sym->old_symbol = NULL;
tmp_sym->mark = 1;
tmp_sym->gfc_new = 1;
tmp_symtree->n.sym = tmp_sym;
tmp_sym->refs++;
}
else
{
gfc_get_sym_tree (name, gfc_current_ns, &tmp_symtree, false);
gcc_assert (tmp_symtree);
tmp_sym = tmp_symtree->n.sym;
}
/* Say what module this symbol belongs to. */
tmp_sym->module = gfc_get_string ("%s", mod_name);
tmp_sym->from_intmod = INTMOD_ISO_C_BINDING;
tmp_sym->intmod_sym_id = s;
tmp_sym->attr.is_iso_c = 1;
tmp_sym->attr.use_assoc = 1;
gcc_assert (dt_symtree == NULL || s == ISOCBINDING_NULL_FUNPTR
|| s == ISOCBINDING_NULL_PTR);
switch (s)
{
#define NAMED_INTCST(a,b,c,d) case a :
#define NAMED_REALCST(a,b,c,d) case a :
#define NAMED_CMPXCST(a,b,c,d) case a :
#define NAMED_LOGCST(a,b,c) case a :
#define NAMED_CHARKNDCST(a,b,c) case a :
#include "iso-c-binding.def"
tmp_sym->value = gfc_get_int_expr (gfc_default_integer_kind, NULL,
c_interop_kinds_table[s].value);
/* Initialize an integer constant expression node. */
tmp_sym->attr.flavor = FL_PARAMETER;
tmp_sym->ts.type = BT_INTEGER;
tmp_sym->ts.kind = gfc_default_integer_kind;
/* Mark this type as a C interoperable one. */
tmp_sym->ts.is_c_interop = 1;
tmp_sym->ts.is_iso_c = 1;
tmp_sym->value->ts.is_c_interop = 1;
tmp_sym->value->ts.is_iso_c = 1;
tmp_sym->attr.is_c_interop = 1;
/* Tell what f90 type this c interop kind is valid. */
tmp_sym->ts.f90_type = c_interop_kinds_table[s].f90_type;
break;
#define NAMED_CHARCST(a,b,c) case a :
#include "iso-c-binding.def"
/* Initialize an integer constant expression node for the
length of the character. */
tmp_sym->value = gfc_get_character_expr (gfc_default_character_kind,
&gfc_current_locus, NULL, 1);
tmp_sym->value->ts.is_c_interop = 1;
tmp_sym->value->ts.is_iso_c = 1;
tmp_sym->value->value.character.length = 1;
tmp_sym->value->value.character.string[0]
= (gfc_char_t) c_interop_kinds_table[s].value;
tmp_sym->ts.u.cl = gfc_new_charlen (gfc_current_ns, NULL);
tmp_sym->ts.u.cl->length = gfc_get_int_expr (gfc_charlen_int_kind,
NULL, 1);
/* May not need this in both attr and ts, but do need in
attr for writing module file. */
tmp_sym->attr.is_c_interop = 1;
tmp_sym->attr.flavor = FL_PARAMETER;
tmp_sym->ts.type = BT_CHARACTER;
/* Need to set it to the C_CHAR kind. */
tmp_sym->ts.kind = gfc_default_character_kind;
/* Mark this type as a C interoperable one. */
tmp_sym->ts.is_c_interop = 1;
tmp_sym->ts.is_iso_c = 1;
/* Tell what f90 type this c interop kind is valid. */
tmp_sym->ts.f90_type = BT_CHARACTER;
break;
case ISOCBINDING_PTR:
case ISOCBINDING_FUNPTR:
{
gfc_symbol *dt_sym;
gfc_component *tmp_comp = NULL;
/* Generate real derived type. */
if (hidden)
dt_sym = tmp_sym;
else
{
const char *hidden_name;
gfc_interface *intr, *head;
hidden_name = gfc_dt_upper_string (tmp_sym->name);
tmp_symtree = gfc_find_symtree (gfc_current_ns->sym_root,
hidden_name);
gcc_assert (tmp_symtree == NULL);
gfc_get_sym_tree (hidden_name, gfc_current_ns, &tmp_symtree, false);
dt_sym = tmp_symtree->n.sym;
dt_sym->name = gfc_get_string (s == ISOCBINDING_PTR
? "c_ptr" : "c_funptr");
/* Generate an artificial generic function. */
head = tmp_sym->generic;
intr = gfc_get_interface ();
intr->sym = dt_sym;
intr->where = gfc_current_locus;
intr->next = head;
tmp_sym->generic = intr;
if (!tmp_sym->attr.generic
&& !gfc_add_generic (&tmp_sym->attr, tmp_sym->name, NULL))
return NULL;
if (!tmp_sym->attr.function
&& !gfc_add_function (&tmp_sym->attr, tmp_sym->name, NULL))
return NULL;
}
/* Say what module this symbol belongs to. */
dt_sym->module = gfc_get_string ("%s", mod_name);
dt_sym->from_intmod = INTMOD_ISO_C_BINDING;
dt_sym->intmod_sym_id = s;
dt_sym->attr.use_assoc = 1;
/* Initialize an integer constant expression node. */
dt_sym->attr.flavor = FL_DERIVED;
dt_sym->ts.is_c_interop = 1;
dt_sym->attr.is_c_interop = 1;
dt_sym->attr.private_comp = 1;
dt_sym->component_access = ACCESS_PRIVATE;
dt_sym->ts.is_iso_c = 1;
dt_sym->ts.type = BT_DERIVED;
dt_sym->ts.f90_type = BT_VOID;
/* A derived type must have the bind attribute to be
interoperable (J3/04-007, Section 15.2.3), even though
the binding label is not used. */
dt_sym->attr.is_bind_c = 1;
dt_sym->attr.referenced = 1;
dt_sym->ts.u.derived = dt_sym;
/* Add the symbol created for the derived type to the current ns. */
if (gfc_derived_types)
{
dt_sym->dt_next = gfc_derived_types->dt_next;
gfc_derived_types->dt_next = dt_sym;
}
else
{
dt_sym->dt_next = dt_sym;
}
gfc_derived_types = dt_sym;
gfc_add_component (dt_sym, "c_address", &tmp_comp);
if (tmp_comp == NULL)
gcc_unreachable ();
tmp_comp->ts.type = BT_INTEGER;
/* Set this because the module will need to read/write this field. */
tmp_comp->ts.f90_type = BT_INTEGER;
/* The kinds for c_ptr and c_funptr are the same. */
index = get_c_kind ("c_ptr", c_interop_kinds_table);
tmp_comp->ts.kind = c_interop_kinds_table[index].value;
tmp_comp->attr.access = ACCESS_PRIVATE;
/* Mark the component as C interoperable. */
tmp_comp->ts.is_c_interop = 1;
}
break;
case ISOCBINDING_NULL_PTR:
case ISOCBINDING_NULL_FUNPTR:
gen_special_c_interop_ptr (tmp_sym, dt_symtree);
break;
default:
gcc_unreachable ();
}
gfc_commit_symbol (tmp_sym);
return tmp_symtree;
}
/* Check that a symbol is already typed. If strict is not set, an untyped
symbol is acceptable for non-standard-conforming mode. */
bool
gfc_check_symbol_typed (gfc_symbol* sym, gfc_namespace* ns,
bool strict, locus where)
{
gcc_assert (sym);
if (gfc_matching_prefix)
return true;
/* Check for the type and try to give it an implicit one. */
if (sym->ts.type == BT_UNKNOWN
&& !gfc_set_default_type (sym, 0, ns))
{
if (strict)
{
gfc_error ("Symbol %qs is used before it is typed at %L",
sym->name, &where);
return false;
}
if (!gfc_notify_std (GFC_STD_GNU, "Symbol %qs is used before"
" it is typed at %L", sym->name, &where))
return false;
}
/* Everything is ok. */
return true;
}
/* Construct a typebound-procedure structure. Those are stored in a tentative
list and marked `error' until symbols are committed. */
gfc_typebound_proc*
gfc_get_typebound_proc (gfc_typebound_proc *tb0)
{
gfc_typebound_proc *result;
result = XCNEW (gfc_typebound_proc);
if (tb0)
*result = *tb0;
result->error = 1;
latest_undo_chgset->tbps.safe_push (result);
return result;
}
/* Get the super-type of a given derived type. */
gfc_symbol*
gfc_get_derived_super_type (gfc_symbol* derived)
{
gcc_assert (derived);
if (derived->attr.generic)
derived = gfc_find_dt_in_generic (derived);
if (!derived->attr.extension)
return NULL;
gcc_assert (derived->components);
gcc_assert (derived->components->ts.type == BT_DERIVED);
gcc_assert (derived->components->ts.u.derived);
if (derived->components->ts.u.derived->attr.generic)
return gfc_find_dt_in_generic (derived->components->ts.u.derived);
return derived->components->ts.u.derived;
}
/* Check if a derived type t2 is an extension of (or equal to) a type t1. */
bool
gfc_type_is_extension_of (gfc_symbol *t1, gfc_symbol *t2)
{
while (!gfc_compare_derived_types (t1, t2) && t2->attr.extension)
t2 = gfc_get_derived_super_type (t2);
return gfc_compare_derived_types (t1, t2);
}
/* Check if parameterized derived type t2 is an instance of pdt template t1
gfc_symbol *t1 -> pdt template to verify t2 against.
gfc_symbol *t2 -> pdt instance to be verified.
In decl.cc, gfc_get_pdt_instance, a pdt instance is given a 3 character
prefix "Pdt", followed by an underscore list of the kind parameters,
up to a maximum of 8 kind parameters. To verify if a PDT Type corresponds
to the template, this functions extracts t2's derive_type name,
and compares it to the derive_type name of t1 for compatibility.
For example:
t2->name = Pdtf_2_2; extract out the 'f' and compare with t1->name. */
bool
gfc_pdt_is_instance_of (gfc_symbol *t1, gfc_symbol *t2)
{
if ( !t1->attr.pdt_template || !t2->attr.pdt_type )
return false;
/* Limit comparison to length of t1->name to ignore new kind params. */
if ( !(strncmp (&(t2->name[3]), t1->name, strlen (t1->name)) == 0) )
return false;
return true;
}
/* Check if two typespecs are type compatible (F03:5.1.1.2):
If ts1 is nonpolymorphic, ts2 must be the same type.
If ts1 is polymorphic (CLASS), ts2 must be an extension of ts1. */
bool
gfc_type_compatible (gfc_typespec *ts1, gfc_typespec *ts2)
{
bool is_class1 = (ts1->type == BT_CLASS);
bool is_class2 = (ts2->type == BT_CLASS);
bool is_derived1 = (ts1->type == BT_DERIVED);
bool is_derived2 = (ts2->type == BT_DERIVED);
bool is_union1 = (ts1->type == BT_UNION);
bool is_union2 = (ts2->type == BT_UNION);
/* A boz-literal-constant has no type. */
if (ts1->type == BT_BOZ || ts2->type == BT_BOZ)
return false;
if (is_class1
&& ts1->u.derived->components
&& ((ts1->u.derived->attr.is_class
&& ts1->u.derived->components->ts.u.derived->attr
.unlimited_polymorphic)
|| ts1->u.derived->attr.unlimited_polymorphic))
return 1;
if (!is_derived1 && !is_derived2 && !is_class1 && !is_class2
&& !is_union1 && !is_union2)
return (ts1->type == ts2->type);
if ((is_derived1 && is_derived2) || (is_union1 && is_union2))
return gfc_compare_derived_types (ts1->u.derived, ts2->u.derived);
if (is_derived1 && is_class2)
return gfc_compare_derived_types (ts1->u.derived,
ts2->u.derived->attr.is_class ?
ts2->u.derived->components->ts.u.derived
: ts2->u.derived);
if (is_class1 && is_derived2)
return gfc_type_is_extension_of (ts1->u.derived->attr.is_class ?
ts1->u.derived->components->ts.u.derived
: ts1->u.derived,
ts2->u.derived);
else if (is_class1 && is_class2)
return gfc_type_is_extension_of (ts1->u.derived->attr.is_class ?
ts1->u.derived->components->ts.u.derived
: ts1->u.derived,
ts2->u.derived->attr.is_class ?
ts2->u.derived->components->ts.u.derived
: ts2->u.derived);
else
return 0;
}
/* Find the parent-namespace of the current function. If we're inside
BLOCK constructs, it may not be the current one. */
gfc_namespace*
gfc_find_proc_namespace (gfc_namespace* ns)
{
while (ns->construct_entities)
{
ns = ns->parent;
gcc_assert (ns);
}
return ns;
}
/* Check if an associate-variable should be translated as an `implicit' pointer
internally (if it is associated to a variable and not an array with
descriptor). */
bool
gfc_is_associate_pointer (gfc_symbol* sym)
{
if (!sym->assoc)
return false;
if (sym->ts.type == BT_CLASS)
return true;
if (sym->ts.type == BT_CHARACTER
&& sym->ts.deferred
&& sym->assoc->target
&& sym->assoc->target->expr_type == EXPR_FUNCTION)
return true;
if (!sym->assoc->variable)
return false;
if (sym->attr.dimension && sym->as->type != AS_EXPLICIT)
return false;
return true;
}
gfc_symbol *
gfc_find_dt_in_generic (gfc_symbol *sym)
{
gfc_interface *intr = NULL;
if (!sym || gfc_fl_struct (sym->attr.flavor))
return sym;
if (sym->attr.generic)
for (intr = sym->generic; intr; intr = intr->next)
if (gfc_fl_struct (intr->sym->attr.flavor))
break;
return intr ? intr->sym : NULL;
}
/* Get the dummy arguments from a procedure symbol. If it has been declared
via a PROCEDURE statement with a named interface, ts.interface will be set
and the arguments need to be taken from there. */
gfc_formal_arglist *
gfc_sym_get_dummy_args (gfc_symbol *sym)
{
gfc_formal_arglist *dummies;
if (sym == NULL)
return NULL;
dummies = sym->formal;
if (dummies == NULL && sym->ts.interface != NULL)
dummies = sym->ts.interface->formal;
return dummies;
}
/* Given a procedure, returns the associated namespace.
The resulting NS should match the condition NS->PROC_NAME == SYM. */
gfc_namespace *
gfc_get_procedure_ns (gfc_symbol *sym)
{
if (sym->formal_ns
&& sym->formal_ns->proc_name == sym)
return sym->formal_ns;
/* The above should have worked in most cases. If it hasn't, try some other
heuristics, eventually returning SYM->NS. */
if (gfc_current_ns->proc_name == sym)
return gfc_current_ns;
/* For contained procedures, the symbol's NS field is the
hosting namespace, not the procedure namespace. */
if (sym->attr.flavor == FL_PROCEDURE && sym->attr.contained)
for (gfc_namespace *ns = sym->ns->contained; ns; ns = ns->sibling)
if (ns->proc_name == sym)
return ns;
if (sym->formal)
for (gfc_formal_arglist *f = sym->formal; f != nullptr; f = f->next)
if (f->sym)
{
gfc_namespace *ns = f->sym->ns;
if (ns && ns->proc_name == sym)
return ns;
}
return sym->ns;
}
/* Given a symbol, returns the namespace in which the symbol is specified.
In most cases, it is the namespace hosting the symbol. This is the case
for variables. For functions, however, it is the function namespace
itself. This specification namespace is used to check conformance of
array spec bound expressions. */
gfc_namespace *
gfc_get_spec_ns (gfc_symbol *sym)
{
if (sym->attr.flavor == FL_PROCEDURE
&& sym->attr.function)
{
if (sym->result == sym)
return gfc_get_procedure_ns (sym);
/* Generic and intrinsic functions can have a null result. */
else if (sym->result != nullptr)
return sym->result->ns;
}
return sym->ns;
}
|