1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
3339
3340
3341
3342
3343
3344
3345
3346
3347
3348
3349
3350
3351
3352
3353
3354
3355
3356
3357
3358
3359
3360
3361
3362
3363
3364
3365
3366
3367
3368
3369
3370
3371
3372
3373
3374
3375
3376
3377
3378
3379
3380
3381
3382
3383
3384
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
3401
3402
3403
3404
3405
3406
3407
3408
3409
3410
3411
3412
3413
3414
3415
3416
3417
3418
3419
3420
3421
3422
3423
3424
3425
3426
3427
3428
3429
3430
3431
3432
3433
3434
3435
3436
3437
3438
3439
3440
3441
3442
3443
3444
3445
3446
3447
3448
3449
3450
3451
3452
3453
3454
3455
3456
3457
3458
3459
3460
3461
3462
3463
3464
3465
3466
3467
3468
3469
3470
3471
3472
3473
3474
3475
3476
3477
3478
3479
3480
3481
3482
3483
3484
3485
3486
3487
3488
3489
3490
3491
3492
3493
3494
3495
3496
3497
3498
3499
3500
3501
3502
3503
3504
3505
3506
3507
3508
3509
3510
3511
3512
3513
3514
3515
3516
3517
3518
3519
3520
3521
3522
3523
3524
3525
3526
3527
3528
3529
3530
3531
3532
3533
3534
3535
3536
3537
3538
3539
3540
3541
3542
3543
3544
3545
3546
3547
3548
3549
3550
3551
3552
3553
3554
3555
3556
3557
3558
3559
3560
3561
3562
3563
3564
3565
3566
3567
3568
3569
3570
3571
3572
3573
3574
3575
3576
3577
3578
3579
3580
3581
3582
3583
3584
3585
3586
3587
3588
3589
3590
3591
3592
3593
3594
3595
3596
3597
3598
3599
3600
3601
3602
3603
3604
3605
3606
3607
3608
3609
3610
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
3622
3623
3624
3625
3626
3627
3628
3629
3630
3631
3632
3633
3634
3635
3636
3637
3638
3639
3640
3641
3642
3643
3644
3645
3646
3647
3648
3649
3650
3651
3652
3653
3654
3655
3656
3657
3658
3659
3660
3661
3662
3663
3664
3665
3666
3667
3668
3669
3670
3671
3672
3673
3674
3675
3676
3677
3678
3679
3680
3681
3682
3683
3684
3685
3686
3687
3688
3689
3690
3691
3692
3693
3694
3695
3696
3697
3698
3699
3700
3701
3702
3703
3704
3705
3706
3707
3708
3709
3710
3711
3712
3713
3714
3715
3716
3717
3718
3719
3720
3721
3722
3723
3724
3725
3726
3727
3728
3729
3730
3731
3732
3733
3734
3735
3736
3737
3738
3739
3740
3741
3742
3743
3744
3745
3746
3747
3748
3749
3750
3751
3752
3753
3754
3755
3756
3757
3758
3759
3760
3761
3762
3763
3764
3765
3766
3767
3768
3769
3770
3771
3772
3773
3774
3775
3776
3777
3778
3779
3780
3781
3782
3783
3784
3785
3786
3787
3788
3789
3790
3791
3792
3793
3794
3795
3796
3797
3798
3799
3800
3801
3802
3803
3804
3805
3806
3807
3808
3809
3810
3811
3812
3813
3814
3815
3816
3817
3818
3819
3820
3821
3822
3823
3824
3825
3826
3827
3828
3829
3830
3831
3832
3833
3834
3835
3836
3837
3838
3839
3840
3841
3842
3843
3844
3845
3846
3847
3848
3849
3850
3851
3852
3853
3854
3855
3856
3857
3858
3859
3860
3861
3862
3863
3864
3865
3866
3867
3868
3869
3870
3871
3872
3873
3874
3875
3876
3877
3878
3879
3880
3881
3882
3883
3884
3885
3886
3887
3888
3889
3890
3891
3892
3893
3894
3895
3896
3897
3898
3899
3900
3901
3902
3903
3904
3905
3906
3907
3908
3909
3910
3911
3912
3913
3914
3915
3916
3917
3918
3919
3920
3921
3922
3923
3924
3925
3926
3927
3928
3929
3930
3931
3932
3933
3934
3935
3936
3937
3938
3939
3940
3941
3942
3943
3944
3945
3946
3947
3948
3949
3950
3951
3952
3953
3954
3955
3956
3957
3958
3959
3960
3961
3962
3963
3964
3965
3966
3967
3968
3969
3970
3971
3972
3973
3974
3975
3976
3977
3978
3979
3980
3981
3982
3983
3984
3985
3986
3987
3988
3989
3990
3991
3992
3993
3994
3995
3996
3997
3998
3999
4000
4001
4002
4003
4004
4005
4006
4007
4008
4009
4010
4011
4012
4013
4014
4015
4016
4017
4018
4019
4020
4021
4022
4023
4024
4025
4026
4027
4028
4029
4030
4031
4032
4033
4034
4035
4036
4037
4038
4039
4040
4041
4042
4043
4044
4045
4046
4047
4048
4049
4050
4051
4052
4053
4054
4055
4056
4057
4058
4059
4060
4061
4062
4063
4064
4065
4066
4067
4068
4069
4070
4071
4072
4073
4074
4075
4076
4077
4078
4079
4080
4081
4082
4083
4084
4085
4086
4087
4088
4089
4090
4091
4092
4093
4094
4095
4096
4097
4098
4099
4100
4101
4102
4103
4104
4105
4106
4107
4108
4109
4110
4111
4112
4113
4114
4115
4116
4117
4118
4119
4120
4121
4122
4123
4124
4125
4126
4127
4128
4129
4130
4131
4132
4133
4134
4135
4136
4137
4138
4139
4140
4141
4142
4143
4144
4145
4146
4147
4148
4149
4150
4151
4152
4153
4154
4155
4156
4157
4158
4159
4160
4161
4162
4163
4164
4165
4166
4167
4168
4169
4170
4171
4172
4173
4174
4175
4176
4177
4178
4179
4180
4181
4182
4183
4184
4185
4186
4187
4188
4189
4190
4191
4192
4193
4194
4195
4196
4197
4198
4199
4200
4201
4202
4203
4204
4205
4206
4207
4208
4209
4210
4211
4212
4213
4214
4215
4216
4217
4218
4219
4220
4221
4222
4223
4224
4225
4226
4227
4228
4229
4230
4231
4232
4233
4234
4235
4236
4237
4238
4239
4240
4241
4242
4243
4244
4245
4246
4247
4248
4249
4250
4251
4252
4253
4254
4255
4256
4257
4258
4259
4260
4261
4262
4263
4264
4265
4266
4267
4268
4269
4270
4271
4272
4273
4274
4275
4276
4277
4278
4279
4280
4281
4282
4283
4284
4285
4286
4287
4288
4289
4290
4291
4292
4293
4294
4295
4296
4297
4298
4299
4300
4301
4302
4303
4304
4305
4306
4307
4308
4309
4310
4311
4312
4313
4314
4315
4316
4317
4318
4319
4320
4321
4322
4323
4324
4325
4326
4327
4328
4329
4330
4331
4332
4333
4334
4335
4336
4337
4338
4339
4340
4341
4342
4343
4344
4345
4346
4347
4348
4349
4350
4351
4352
4353
4354
4355
4356
4357
4358
4359
4360
4361
4362
4363
4364
4365
4366
4367
4368
4369
4370
4371
4372
4373
4374
4375
4376
4377
4378
4379
4380
4381
4382
4383
4384
4385
4386
4387
4388
4389
4390
4391
4392
4393
4394
4395
4396
4397
4398
4399
4400
4401
4402
4403
4404
4405
4406
4407
4408
4409
4410
4411
4412
4413
4414
4415
4416
4417
4418
4419
4420
4421
4422
4423
4424
4425
4426
4427
4428
4429
4430
4431
4432
4433
4434
4435
4436
4437
4438
4439
4440
4441
4442
4443
4444
4445
4446
4447
4448
4449
4450
4451
4452
4453
4454
4455
4456
4457
4458
4459
4460
4461
4462
4463
4464
4465
4466
4467
4468
4469
4470
4471
4472
4473
4474
4475
4476
4477
4478
4479
4480
4481
4482
4483
4484
4485
4486
4487
4488
4489
4490
4491
4492
4493
4494
4495
4496
4497
4498
4499
4500
4501
4502
4503
4504
4505
4506
4507
4508
4509
4510
4511
4512
4513
4514
4515
4516
4517
4518
4519
4520
4521
4522
4523
4524
4525
4526
4527
4528
4529
4530
4531
4532
4533
4534
4535
4536
4537
4538
4539
4540
4541
4542
4543
4544
4545
4546
4547
4548
4549
4550
4551
4552
4553
4554
4555
4556
4557
4558
4559
4560
4561
4562
4563
4564
4565
4566
4567
4568
4569
4570
4571
4572
4573
4574
4575
4576
4577
4578
4579
4580
4581
4582
4583
4584
4585
4586
4587
4588
4589
4590
4591
4592
4593
4594
4595
4596
4597
4598
4599
4600
4601
4602
4603
4604
4605
4606
4607
4608
4609
4610
4611
4612
4613
4614
4615
4616
4617
4618
4619
4620
4621
4622
4623
4624
4625
4626
4627
4628
4629
4630
4631
4632
4633
4634
4635
4636
4637
4638
4639
4640
4641
4642
4643
4644
4645
4646
4647
4648
4649
4650
4651
4652
4653
4654
4655
4656
4657
4658
4659
4660
4661
4662
4663
4664
4665
4666
4667
4668
4669
4670
4671
4672
4673
4674
4675
4676
4677
4678
4679
4680
4681
4682
4683
4684
4685
4686
4687
4688
4689
4690
4691
4692
4693
4694
4695
4696
4697
4698
4699
4700
4701
4702
4703
4704
4705
4706
4707
4708
4709
4710
4711
4712
4713
4714
4715
4716
4717
4718
4719
4720
4721
4722
4723
4724
4725
4726
4727
4728
4729
4730
4731
4732
4733
4734
4735
4736
4737
4738
4739
4740
4741
4742
4743
4744
4745
4746
4747
4748
4749
4750
4751
4752
4753
4754
4755
4756
4757
4758
4759
4760
4761
4762
4763
4764
4765
4766
4767
4768
4769
4770
4771
4772
4773
4774
4775
4776
4777
4778
4779
4780
4781
4782
4783
4784
4785
4786
4787
4788
4789
4790
4791
4792
4793
4794
4795
4796
4797
4798
4799
4800
4801
4802
4803
4804
4805
4806
4807
4808
4809
4810
4811
4812
4813
4814
4815
4816
4817
4818
4819
4820
4821
4822
4823
4824
4825
4826
4827
4828
4829
4830
4831
4832
4833
4834
4835
4836
4837
4838
4839
4840
4841
4842
4843
4844
4845
4846
4847
4848
4849
4850
4851
4852
4853
4854
4855
4856
4857
4858
4859
4860
4861
4862
4863
4864
4865
4866
4867
4868
4869
4870
4871
4872
4873
4874
4875
4876
4877
4878
4879
4880
4881
4882
4883
4884
4885
4886
4887
4888
4889
4890
4891
4892
4893
4894
4895
4896
4897
4898
4899
4900
4901
4902
4903
4904
4905
4906
4907
4908
4909
4910
4911
4912
4913
4914
4915
4916
4917
4918
4919
4920
4921
4922
4923
4924
4925
4926
4927
4928
4929
4930
4931
4932
4933
4934
4935
4936
4937
4938
4939
4940
4941
4942
4943
4944
4945
4946
4947
4948
4949
4950
4951
4952
4953
4954
4955
4956
4957
4958
4959
4960
4961
4962
4963
4964
4965
4966
4967
4968
4969
4970
4971
4972
4973
4974
4975
4976
4977
4978
4979
4980
4981
4982
4983
4984
4985
4986
4987
4988
4989
4990
4991
4992
4993
4994
4995
4996
4997
4998
4999
5000
5001
5002
5003
5004
5005
5006
5007
5008
5009
5010
5011
5012
5013
5014
5015
5016
5017
5018
5019
5020
5021
5022
5023
5024
5025
5026
5027
5028
5029
5030
5031
5032
5033
5034
5035
5036
5037
5038
5039
5040
5041
5042
5043
5044
5045
5046
5047
5048
5049
5050
5051
5052
5053
5054
5055
5056
5057
5058
5059
5060
5061
5062
5063
5064
5065
5066
5067
5068
5069
5070
5071
5072
5073
5074
5075
5076
5077
5078
5079
5080
5081
5082
5083
5084
5085
5086
5087
5088
5089
5090
5091
5092
5093
5094
5095
5096
5097
5098
5099
5100
5101
5102
5103
5104
5105
5106
5107
5108
5109
5110
5111
5112
5113
5114
5115
5116
5117
5118
5119
5120
5121
5122
5123
5124
5125
5126
5127
5128
5129
5130
5131
5132
5133
5134
5135
5136
5137
5138
5139
5140
5141
5142
5143
5144
5145
5146
5147
5148
5149
5150
5151
5152
5153
5154
5155
5156
5157
5158
5159
5160
5161
5162
5163
5164
5165
5166
5167
5168
5169
5170
5171
5172
5173
5174
5175
5176
5177
5178
5179
5180
5181
5182
5183
5184
5185
5186
5187
5188
5189
5190
5191
5192
5193
5194
5195
5196
5197
5198
5199
5200
5201
5202
5203
5204
5205
5206
5207
5208
5209
5210
5211
5212
5213
5214
5215
5216
5217
5218
5219
5220
5221
5222
5223
5224
5225
5226
5227
5228
5229
5230
5231
5232
5233
5234
5235
5236
5237
5238
5239
5240
5241
5242
5243
5244
5245
5246
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256
5257
5258
5259
5260
5261
5262
5263
5264
5265
5266
5267
5268
5269
5270
5271
5272
5273
5274
5275
5276
5277
5278
5279
5280
5281
5282
5283
5284
5285
5286
5287
5288
5289
5290
5291
5292
5293
5294
5295
5296
5297
5298
5299
5300
5301
5302
5303
5304
5305
5306
5307
5308
5309
5310
5311
5312
5313
5314
5315
5316
5317
5318
5319
5320
5321
5322
5323
5324
5325
5326
5327
5328
5329
5330
5331
5332
5333
5334
5335
5336
5337
5338
5339
5340
5341
5342
5343
5344
5345
5346
5347
5348
5349
5350
5351
5352
5353
5354
5355
5356
5357
5358
5359
5360
5361
5362
5363
5364
5365
5366
5367
5368
5369
5370
5371
5372
5373
5374
5375
5376
5377
5378
5379
5380
5381
5382
5383
5384
5385
5386
5387
5388
5389
5390
5391
5392
5393
5394
5395
5396
5397
5398
5399
5400
5401
5402
5403
5404
5405
5406
5407
5408
5409
5410
5411
5412
5413
5414
5415
5416
5417
5418
5419
5420
5421
5422
5423
5424
5425
5426
5427
5428
5429
5430
5431
5432
5433
5434
5435
5436
5437
5438
5439
5440
5441
5442
5443
5444
5445
5446
5447
5448
5449
5450
5451
5452
5453
5454
5455
5456
5457
5458
5459
5460
5461
5462
5463
5464
5465
5466
5467
5468
5469
5470
5471
5472
5473
5474
5475
5476
5477
5478
5479
5480
5481
5482
5483
5484
5485
5486
5487
5488
5489
5490
5491
5492
5493
5494
5495
5496
5497
5498
5499
5500
5501
5502
5503
5504
5505
5506
5507
5508
5509
5510
5511
5512
5513
5514
5515
5516
5517
5518
5519
5520
5521
5522
5523
5524
5525
5526
5527
5528
5529
5530
5531
5532
5533
5534
5535
5536
5537
5538
5539
5540
5541
5542
5543
5544
5545
5546
5547
5548
5549
5550
5551
5552
5553
5554
5555
5556
5557
5558
5559
5560
5561
5562
5563
5564
5565
5566
5567
5568
5569
5570
5571
5572
5573
5574
5575
5576
5577
5578
5579
5580
5581
5582
5583
5584
5585
5586
5587
5588
5589
5590
5591
5592
5593
5594
5595
5596
5597
5598
5599
5600
5601
5602
5603
5604
5605
5606
5607
5608
5609
5610
5611
5612
5613
5614
5615
5616
5617
5618
5619
5620
5621
5622
5623
5624
5625
5626
5627
5628
5629
5630
5631
5632
5633
5634
5635
5636
5637
5638
5639
5640
5641
5642
5643
5644
5645
5646
5647
5648
5649
5650
5651
5652
5653
5654
5655
5656
5657
5658
5659
5660
5661
5662
5663
5664
5665
5666
5667
5668
5669
5670
5671
5672
5673
5674
5675
5676
5677
5678
5679
5680
5681
5682
5683
5684
5685
5686
5687
5688
5689
5690
5691
5692
5693
5694
5695
5696
5697
5698
5699
5700
5701
5702
5703
5704
5705
5706
5707
5708
5709
5710
5711
5712
5713
5714
5715
5716
5717
5718
5719
5720
5721
5722
5723
5724
5725
5726
5727
5728
5729
5730
5731
5732
5733
5734
5735
5736
5737
5738
5739
5740
5741
5742
5743
5744
5745
5746
5747
5748
5749
5750
5751
5752
5753
5754
5755
5756
5757
5758
5759
5760
5761
5762
5763
5764
5765
5766
5767
5768
5769
5770
5771
5772
5773
5774
5775
5776
5777
5778
5779
5780
5781
5782
5783
5784
5785
5786
5787
5788
5789
5790
5791
5792
5793
5794
5795
5796
5797
5798
5799
5800
5801
5802
5803
5804
5805
5806
5807
5808
5809
5810
5811
5812
5813
5814
5815
5816
5817
5818
5819
5820
5821
5822
5823
5824
5825
5826
5827
5828
5829
5830
5831
5832
5833
5834
5835
5836
5837
5838
5839
5840
5841
5842
5843
5844
5845
5846
5847
5848
5849
5850
5851
5852
5853
5854
5855
5856
5857
5858
5859
5860
5861
5862
5863
5864
5865
5866
5867
5868
5869
5870
5871
5872
5873
5874
5875
5876
5877
5878
5879
5880
5881
5882
5883
5884
5885
5886
5887
5888
5889
5890
5891
5892
5893
5894
5895
5896
5897
5898
5899
5900
5901
5902
5903
5904
5905
5906
5907
5908
5909
5910
5911
5912
5913
5914
5915
5916
5917
5918
5919
5920
5921
5922
5923
5924
5925
5926
5927
5928
5929
5930
5931
5932
5933
5934
5935
5936
5937
5938
5939
5940
5941
5942
5943
5944
5945
5946
5947
5948
5949
5950
5951
5952
5953
5954
5955
5956
5957
5958
5959
5960
5961
5962
5963
5964
5965
5966
5967
5968
5969
5970
5971
5972
5973
5974
5975
5976
5977
5978
5979
5980
5981
5982
5983
5984
5985
5986
5987
5988
5989
5990
5991
5992
5993
5994
5995
5996
5997
5998
5999
6000
6001
6002
6003
6004
6005
6006
6007
6008
6009
6010
6011
6012
6013
6014
6015
6016
6017
6018
6019
6020
6021
6022
6023
6024
6025
6026
6027
6028
6029
6030
6031
6032
6033
6034
6035
6036
6037
6038
6039
6040
6041
6042
6043
6044
6045
6046
6047
6048
6049
6050
6051
6052
6053
6054
6055
6056
6057
6058
6059
6060
6061
6062
6063
6064
6065
6066
6067
6068
6069
6070
6071
6072
6073
6074
6075
6076
6077
6078
6079
6080
6081
6082
6083
6084
6085
6086
6087
6088
6089
6090
6091
6092
6093
6094
6095
6096
6097
6098
6099
6100
6101
6102
6103
6104
6105
6106
6107
6108
6109
6110
6111
6112
6113
6114
6115
6116
6117
6118
6119
6120
6121
6122
6123
6124
6125
6126
6127
6128
6129
6130
6131
6132
6133
6134
6135
6136
6137
6138
6139
6140
6141
6142
6143
6144
6145
6146
6147
6148
6149
6150
6151
6152
6153
6154
6155
6156
6157
6158
6159
6160
6161
6162
6163
6164
6165
6166
6167
6168
6169
6170
6171
6172
6173
6174
6175
6176
6177
6178
6179
6180
6181
6182
6183
6184
6185
6186
6187
6188
6189
6190
6191
6192
6193
6194
6195
6196
6197
6198
6199
6200
6201
6202
6203
6204
6205
6206
6207
6208
6209
6210
6211
6212
6213
6214
6215
6216
6217
6218
6219
6220
6221
6222
6223
6224
6225
6226
6227
6228
6229
6230
6231
6232
6233
6234
6235
6236
6237
6238
6239
6240
6241
6242
6243
6244
6245
6246
6247
6248
6249
6250
6251
6252
6253
6254
6255
6256
6257
6258
6259
6260
6261
6262
6263
6264
6265
6266
6267
6268
6269
6270
6271
6272
6273
6274
6275
6276
6277
6278
6279
6280
6281
6282
6283
6284
6285
6286
6287
6288
6289
6290
6291
6292
6293
6294
6295
6296
6297
6298
6299
6300
6301
6302
6303
6304
6305
6306
6307
6308
6309
6310
6311
6312
6313
6314
6315
6316
6317
6318
6319
6320
6321
6322
6323
6324
6325
6326
6327
6328
6329
6330
6331
6332
6333
6334
6335
6336
6337
6338
6339
6340
6341
6342
6343
6344
6345
6346
6347
6348
6349
6350
6351
6352
6353
6354
6355
6356
6357
6358
|
/* read.c - read a source file -
Copyright (C) 1986-2021 Free Software Foundation, Inc.
This file is part of GAS, the GNU Assembler.
GAS 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.
GAS 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 GAS; see the file COPYING. If not, write to the Free
Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
02110-1301, USA. */
/* If your chars aren't 8 bits, you will change this a bit (eg. to 0xFF).
But then, GNU isn't supposed to run on your machine anyway.
(RMS is so shortsighted sometimes.) */
#define MASK_CHAR ((int)(unsigned char) -1)
/* This is the largest known floating point format (for now). It will
grow when we do 4361 style flonums. */
#define MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT (16)
/* Routines that read assembler source text to build spaghetti in memory.
Another group of these functions is in the expr.c module. */
#include "as.h"
#include "safe-ctype.h"
#include "subsegs.h"
#include "sb.h"
#include "macro.h"
#include "obstack.h"
#include "ecoff.h"
#include "dw2gencfi.h"
#include "wchar.h"
#include <limits.h>
#ifndef TC_START_LABEL
#define TC_START_LABEL(STR, NUL_CHAR, NEXT_CHAR) (NEXT_CHAR == ':')
#endif
/* Set by the object-format or the target. */
#ifndef TC_IMPLICIT_LCOMM_ALIGNMENT
#define TC_IMPLICIT_LCOMM_ALIGNMENT(SIZE, P2VAR) \
do \
{ \
if ((SIZE) >= 8) \
(P2VAR) = 3; \
else if ((SIZE) >= 4) \
(P2VAR) = 2; \
else if ((SIZE) >= 2) \
(P2VAR) = 1; \
else \
(P2VAR) = 0; \
} \
while (0)
#endif
char *input_line_pointer; /*->next char of source file to parse. */
bool input_from_string = false;
#if BITS_PER_CHAR != 8
/* The following table is indexed by[(char)] and will break if
a char does not have exactly 256 states (hopefully 0:255!)! */
die horribly;
#endif
#ifndef LEX_AT
#define LEX_AT 0
#endif
#ifndef LEX_BR
/* The RS/6000 assembler uses {,},[,] as parts of symbol names. */
#define LEX_BR 0
#endif
#ifndef LEX_PCT
/* The Delta 68k assembler permits % inside label names. */
#define LEX_PCT 0
#endif
#ifndef LEX_QM
/* The PowerPC Windows NT assemblers permits ? inside label names. */
#define LEX_QM 0
#endif
#ifndef LEX_HASH
/* The IA-64 assembler uses # as a suffix designating a symbol. We include
it in the symbol and strip it out in tc_canonicalize_symbol_name. */
#define LEX_HASH 0
#endif
#ifndef LEX_DOLLAR
#define LEX_DOLLAR 3
#endif
#ifndef LEX_TILDE
/* The Delta 68k assembler permits ~ at start of label names. */
#define LEX_TILDE 0
#endif
/* Used by is_... macros. our ctype[]. */
char lex_type[256] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* @ABCDEFGHIJKLMNO */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* PQRSTUVWXYZ[\]^_ */
0, 0, 0, LEX_HASH, LEX_DOLLAR, LEX_PCT, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, /* _!"#$%&'()*+,-./ */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, LEX_QM, /* 0123456789:;<=>? */
LEX_AT, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, /* @ABCDEFGHIJKLMNO */
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, LEX_BR, 0, LEX_BR, 0, 3, /* PQRSTUVWXYZ[\]^_ */
0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, /* `abcdefghijklmno */
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, LEX_BR, 0, LEX_BR, LEX_TILDE, 0, /* pqrstuvwxyz{|}~. */
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3
};
/* In: a character.
Out: 1 if this character ends a line.
2 if this character is a line separator. */
char is_end_of_line[256] = {
#ifdef CR_EOL
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, /* @abcdefghijklmno */
#else
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, /* @abcdefghijklmno */
#endif
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* _!"#$%&'()*+,-./ */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0123456789:;<=>? */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 /* */
};
#ifndef TC_CASE_SENSITIVE
char original_case_string[128];
#endif
/* Functions private to this file. */
static char *buffer; /* 1st char of each buffer of lines is here. */
static char *buffer_limit; /*->1 + last char in buffer. */
/* TARGET_BYTES_BIG_ENDIAN is required to be defined to either 0 or 1
in the tc-<CPU>.h file. See the "Porting GAS" section of the
internals manual. */
int target_big_endian = TARGET_BYTES_BIG_ENDIAN;
/* Variables for handling include file directory table. */
/* Table of pointers to directories to search for .include's. */
const char **include_dirs;
/* How many are in the table. */
int include_dir_count;
/* Length of longest in table. */
int include_dir_maxlen = 1;
#ifndef WORKING_DOT_WORD
struct broken_word *broken_words;
int new_broken_words;
#endif
/* The current offset into the absolute section. We don't try to
build frags in the absolute section, since no data can be stored
there. We just keep track of the current offset. */
addressT abs_section_offset;
/* If this line had an MRI style label, it is stored in this variable.
This is used by some of the MRI pseudo-ops. */
symbolS *line_label;
/* This global variable is used to support MRI common sections. We
translate such sections into a common symbol. This variable is
non-NULL when we are in an MRI common section. */
symbolS *mri_common_symbol;
/* In MRI mode, after a dc.b pseudo-op with an odd number of bytes, we
need to align to an even byte boundary unless the next pseudo-op is
dc.b, ds.b, or dcb.b. This variable is set to 1 if an alignment
may be needed. */
static int mri_pending_align;
#ifndef NO_LISTING
#ifdef OBJ_ELF
/* This variable is set to be non-zero if the next string we see might
be the name of the source file in DWARF debugging information. See
the comment in emit_expr for the format we look for. */
static int dwarf_file_string;
#endif
#endif
/* If the target defines the md_frag_max_var hook then we know
enough to implement the .bundle_align_mode features. */
#ifdef md_frag_max_var
# define HANDLE_BUNDLE
#endif
#ifdef HANDLE_BUNDLE
/* .bundle_align_mode sets this. Normally it's zero. When nonzero,
it's the exponent of the bundle size, and aligned instruction bundle
mode is in effect. */
static unsigned int bundle_align_p2;
/* These are set by .bundle_lock and .bundle_unlock. .bundle_lock sets
bundle_lock_frag to frag_now and then starts a new frag with
frag_align_code. At the same time, bundle_lock_frain gets frchain_now,
so that .bundle_unlock can verify that we didn't change segments.
.bundle_unlock resets both to NULL. If we detect a bundling violation,
then we reset bundle_lock_frchain to NULL as an indicator that we've
already diagnosed the error with as_bad and don't need a cascade of
redundant errors, but bundle_lock_frag remains set to indicate that
we are expecting to see .bundle_unlock. */
static fragS *bundle_lock_frag;
static frchainS *bundle_lock_frchain;
/* This is incremented by .bundle_lock and decremented by .bundle_unlock,
to allow nesting. */
static unsigned int bundle_lock_depth;
#endif
static void do_s_func (int end_p, const char *default_prefix);
static void s_align (int, int);
static void s_altmacro (int);
static void s_bad_end (int);
static void s_reloc (int);
static int hex_float (int, char *);
static segT get_known_segmented_expression (expressionS * expP);
static void pobegin (void);
static size_t get_non_macro_line_sb (sb *);
static void generate_file_debug (void);
static char *_find_end_of_line (char *, int, int, int);
void
read_begin (void)
{
const char *p;
pobegin ();
obj_read_begin_hook ();
/* Something close -- but not too close -- to a multiple of 1024.
The debugging malloc I'm using has 24 bytes of overhead. */
obstack_begin (¬es, chunksize);
obstack_begin (&cond_obstack, chunksize);
#ifndef tc_line_separator_chars
#define tc_line_separator_chars line_separator_chars
#endif
/* Use machine dependent syntax. */
for (p = tc_line_separator_chars; *p; p++)
is_end_of_line[(unsigned char) *p] = 2;
/* Use more. FIXME-SOMEDAY. */
if (flag_mri)
lex_type['?'] = 3;
}
#ifndef TC_ADDRESS_BYTES
#define TC_ADDRESS_BYTES address_bytes
static inline int
address_bytes (void)
{
/* Choose smallest of 1, 2, 4, 8 bytes that is large enough to
contain an address. */
int n = (stdoutput->arch_info->bits_per_address - 1) / 8;
n |= n >> 1;
n |= n >> 2;
n += 1;
return n;
}
#endif
/* Set up pseudo-op tables. */
struct po_entry
{
const char *poc_name;
const pseudo_typeS *pop;
};
typedef struct po_entry po_entry_t;
/* Hash function for a po_entry. */
static hashval_t
hash_po_entry (const void *e)
{
const po_entry_t *entry = (const po_entry_t *) e;
return htab_hash_string (entry->poc_name);
}
/* Equality function for a po_entry. */
static int
eq_po_entry (const void *a, const void *b)
{
const po_entry_t *ea = (const po_entry_t *) a;
const po_entry_t *eb = (const po_entry_t *) b;
return strcmp (ea->poc_name, eb->poc_name) == 0;
}
static po_entry_t *
po_entry_alloc (const char *poc_name, const pseudo_typeS *pop)
{
po_entry_t *entry = XNEW (po_entry_t);
entry->poc_name = poc_name;
entry->pop = pop;
return entry;
}
static const pseudo_typeS *
po_entry_find (htab_t table, const char *poc_name)
{
po_entry_t needle = { poc_name, NULL };
po_entry_t *entry = htab_find (table, &needle);
return entry != NULL ? entry->pop : NULL;
}
static struct htab *po_hash;
static const pseudo_typeS potable[] = {
{"abort", s_abort, 0},
{"align", s_align_ptwo, 0},
{"altmacro", s_altmacro, 1},
{"ascii", stringer, 8+0},
{"asciz", stringer, 8+1},
{"balign", s_align_bytes, 0},
{"balignw", s_align_bytes, -2},
{"balignl", s_align_bytes, -4},
/* block */
#ifdef HANDLE_BUNDLE
{"bundle_align_mode", s_bundle_align_mode, 0},
{"bundle_lock", s_bundle_lock, 0},
{"bundle_unlock", s_bundle_unlock, 0},
#endif
{"byte", cons, 1},
{"comm", s_comm, 0},
{"common", s_mri_common, 0},
{"common.s", s_mri_common, 1},
{"data", s_data, 0},
{"dc", cons, 2},
{"dc.a", cons, 0},
{"dc.b", cons, 1},
{"dc.d", float_cons, 'd'},
{"dc.l", cons, 4},
{"dc.s", float_cons, 'f'},
{"dc.w", cons, 2},
{"dc.x", float_cons, 'x'},
{"dcb", s_space, 2},
{"dcb.b", s_space, 1},
{"dcb.d", s_float_space, 'd'},
{"dcb.l", s_space, 4},
{"dcb.s", s_float_space, 'f'},
{"dcb.w", s_space, 2},
{"dcb.x", s_float_space, 'x'},
{"ds", s_space, 2},
{"ds.b", s_space, 1},
{"ds.d", s_space, 8},
{"ds.l", s_space, 4},
{"ds.p", s_space, 12},
{"ds.s", s_space, 4},
{"ds.w", s_space, 2},
{"ds.x", s_space, 12},
{"debug", s_ignore, 0},
#ifdef S_SET_DESC
{"desc", s_desc, 0},
#endif
/* dim */
{"double", float_cons, 'd'},
/* dsect */
{"eject", listing_eject, 0}, /* Formfeed listing. */
{"else", s_else, 0},
{"elsec", s_else, 0},
{"elseif", s_elseif, (int) O_ne},
{"end", s_end, 0},
{"endc", s_endif, 0},
{"endfunc", s_func, 1},
{"endif", s_endif, 0},
{"endm", s_bad_end, 0},
{"endr", s_bad_end, 1},
/* endef */
{"equ", s_set, 0},
{"equiv", s_set, 1},
{"eqv", s_set, -1},
{"err", s_err, 0},
{"error", s_errwarn, 1},
{"exitm", s_mexit, 0},
/* extend */
{"extern", s_ignore, 0}, /* We treat all undef as ext. */
{"appfile", s_app_file, 1},
{"appline", s_app_line, 1},
{"fail", s_fail, 0},
{"file", s_app_file, 0},
{"fill", s_fill, 0},
{"float", float_cons, 'f'},
{"format", s_ignore, 0},
{"func", s_func, 0},
{"global", s_globl, 0},
{"globl", s_globl, 0},
{"hword", cons, 2},
{"if", s_if, (int) O_ne},
{"ifb", s_ifb, 1},
{"ifc", s_ifc, 0},
{"ifdef", s_ifdef, 0},
{"ifeq", s_if, (int) O_eq},
{"ifeqs", s_ifeqs, 0},
{"ifge", s_if, (int) O_ge},
{"ifgt", s_if, (int) O_gt},
{"ifle", s_if, (int) O_le},
{"iflt", s_if, (int) O_lt},
{"ifnb", s_ifb, 0},
{"ifnc", s_ifc, 1},
{"ifndef", s_ifdef, 1},
{"ifne", s_if, (int) O_ne},
{"ifnes", s_ifeqs, 1},
{"ifnotdef", s_ifdef, 1},
{"incbin", s_incbin, 0},
{"include", s_include, 0},
{"int", cons, 4},
{"irp", s_irp, 0},
{"irep", s_irp, 0},
{"irpc", s_irp, 1},
{"irepc", s_irp, 1},
{"lcomm", s_lcomm, 0},
{"lflags", s_ignore, 0}, /* Listing flags. */
{"linefile", s_app_line, 0},
{"linkonce", s_linkonce, 0},
{"list", listing_list, 1}, /* Turn listing on. */
{"llen", listing_psize, 1},
{"long", cons, 4},
{"lsym", s_lsym, 0},
{"macro", s_macro, 0},
{"mexit", s_mexit, 0},
{"mri", s_mri, 0},
{".mri", s_mri, 0}, /* Special case so .mri works in MRI mode. */
{"name", s_ignore, 0},
{"noaltmacro", s_altmacro, 0},
{"noformat", s_ignore, 0},
{"nolist", listing_list, 0}, /* Turn listing off. */
{"nopage", listing_nopage, 0},
{"nop", s_nop, 0},
{"nops", s_nops, 0},
{"octa", cons, 16},
{"offset", s_struct, 0},
{"org", s_org, 0},
{"p2align", s_align_ptwo, 0},
{"p2alignw", s_align_ptwo, -2},
{"p2alignl", s_align_ptwo, -4},
{"page", listing_eject, 0},
{"plen", listing_psize, 0},
{"print", s_print, 0},
{"psize", listing_psize, 0}, /* Set paper size. */
{"purgem", s_purgem, 0},
{"quad", cons, 8},
{"reloc", s_reloc, 0},
{"rep", s_rept, 0},
{"rept", s_rept, 0},
{"rva", s_rva, 4},
{"sbttl", listing_title, 1}, /* Subtitle of listing. */
/* scl */
/* sect */
{"set", s_set, 0},
{"short", cons, 2},
{"single", float_cons, 'f'},
/* size */
{"space", s_space, 0},
{"skip", s_space, 0},
{"sleb128", s_leb128, 1},
{"spc", s_ignore, 0},
{"stabd", s_stab, 'd'},
{"stabn", s_stab, 'n'},
{"stabs", s_stab, 's'},
{"string", stringer, 8+1},
{"string8", stringer, 8+1},
{"string16", stringer, 16+1},
{"string32", stringer, 32+1},
{"string64", stringer, 64+1},
{"struct", s_struct, 0},
/* tag */
{"text", s_text, 0},
/* This is for gcc to use. It's only just been added (2/94), so gcc
won't be able to use it for a while -- probably a year or more.
But once this has been released, check with gcc maintainers
before deleting it or even changing the spelling. */
{"this_GCC_requires_the_GNU_assembler", s_ignore, 0},
/* If we're folding case -- done for some targets, not necessarily
all -- the above string in an input file will be converted to
this one. Match it either way... */
{"this_gcc_requires_the_gnu_assembler", s_ignore, 0},
{"title", listing_title, 0}, /* Listing title. */
{"ttl", listing_title, 0},
/* type */
{"uleb128", s_leb128, 0},
/* use */
/* val */
{"xcom", s_comm, 0},
{"xdef", s_globl, 0},
{"xref", s_ignore, 0},
{"xstabs", s_xstab, 's'},
{"warning", s_errwarn, 0},
{"weakref", s_weakref, 0},
{"word", cons, 2},
{"zero", s_space, 0},
{"2byte", cons, 2},
{"4byte", cons, 4},
{"8byte", cons, 8},
{NULL, NULL, 0} /* End sentinel. */
};
static offsetT
get_absolute_expr (expressionS *exp)
{
expression_and_evaluate (exp);
if (exp->X_op != O_constant)
{
if (exp->X_op != O_absent)
as_bad (_("bad or irreducible absolute expression"));
exp->X_add_number = 0;
}
return exp->X_add_number;
}
offsetT
get_absolute_expression (void)
{
expressionS exp;
return get_absolute_expr (&exp);
}
static int pop_override_ok = 0;
static const char *pop_table_name;
void
pop_insert (const pseudo_typeS *table)
{
const pseudo_typeS *pop;
for (pop = table; pop->poc_name; pop++)
{
po_entry_t *elt = po_entry_alloc (pop->poc_name, pop);
if (htab_insert (po_hash, elt, 0) != NULL)
{
free (elt);
if (!pop_override_ok)
as_fatal (_("error constructing %s pseudo-op table"),
pop_table_name);
}
}
}
#ifndef md_pop_insert
#define md_pop_insert() pop_insert(md_pseudo_table)
#endif
#ifndef obj_pop_insert
#define obj_pop_insert() pop_insert(obj_pseudo_table)
#endif
#ifndef cfi_pop_insert
#define cfi_pop_insert() pop_insert(cfi_pseudo_table)
#endif
static void
pobegin (void)
{
po_hash = htab_create_alloc (16, hash_po_entry, eq_po_entry, NULL,
xcalloc, xfree);
/* Do the target-specific pseudo ops. */
pop_table_name = "md";
md_pop_insert ();
/* Now object specific. Skip any that were in the target table. */
pop_table_name = "obj";
pop_override_ok = 1;
obj_pop_insert ();
/* Now portable ones. Skip any that we've seen already. */
pop_table_name = "standard";
pop_insert (potable);
/* Now CFI ones. */
pop_table_name = "cfi";
pop_override_ok = 1;
cfi_pop_insert ();
}
#define HANDLE_CONDITIONAL_ASSEMBLY(num_read) \
if (ignore_input ()) \
{ \
char *eol = find_end_of_line (input_line_pointer - (num_read), \
flag_m68k_mri); \
input_line_pointer = (input_line_pointer <= buffer_limit \
&& eol >= buffer_limit) \
? buffer_limit \
: eol + 1; \
continue; \
}
/* This function is used when scrubbing the characters between #APP
and #NO_APP. */
static char *scrub_string;
static char *scrub_string_end;
static size_t
scrub_from_string (char *buf, size_t buflen)
{
size_t copy;
copy = scrub_string_end - scrub_string;
if (copy > buflen)
copy = buflen;
memcpy (buf, scrub_string, copy);
scrub_string += copy;
return copy;
}
/* Helper function of read_a_source_file, which tries to expand a macro. */
static int
try_macro (char term, const char *line)
{
sb out;
const char *err;
macro_entry *macro;
if (check_macro (line, &out, &err, ¯o))
{
if (err != NULL)
as_bad ("%s", err);
*input_line_pointer++ = term;
input_scrub_include_sb (&out,
input_line_pointer, 1);
sb_kill (&out);
buffer_limit =
input_scrub_next_buffer (&input_line_pointer);
#ifdef md_macro_info
md_macro_info (macro);
#endif
return 1;
}
return 0;
}
#ifdef HANDLE_BUNDLE
/* Start a new instruction bundle. Returns the rs_align_code frag that
will be used to align the new bundle. */
static fragS *
start_bundle (void)
{
fragS *frag = frag_now;
frag_align_code (0, 0);
while (frag->fr_type != rs_align_code)
frag = frag->fr_next;
gas_assert (frag != frag_now);
return frag;
}
/* Calculate the maximum size after relaxation of the region starting
at the given frag and extending through frag_now (which is unfinished). */
static unsigned int
pending_bundle_size (fragS *frag)
{
unsigned int offset = frag->fr_fix;
unsigned int size = 0;
gas_assert (frag != frag_now);
gas_assert (frag->fr_type == rs_align_code);
while (frag != frag_now)
{
/* This should only happen in what will later become an error case. */
if (frag == NULL)
return 0;
size += frag->fr_fix;
if (frag->fr_type == rs_machine_dependent)
size += md_frag_max_var (frag);
frag = frag->fr_next;
}
gas_assert (frag == frag_now);
size += frag_now_fix ();
if (frag->fr_type == rs_machine_dependent)
size += md_frag_max_var (frag);
gas_assert (size >= offset);
return size - offset;
}
/* Finish off the frag created to ensure bundle alignment. */
static void
finish_bundle (fragS *frag, unsigned int size)
{
gas_assert (bundle_align_p2 > 0);
gas_assert (frag->fr_type == rs_align_code);
if (size > 1)
{
/* If there is more than a single byte, then we need to set up the
alignment frag. Otherwise we leave it at its initial state from
calling frag_align_code (0, 0), so that it does nothing. */
frag->fr_offset = bundle_align_p2;
frag->fr_subtype = size - 1;
}
/* We do this every time rather than just in s_bundle_align_mode
so that we catch any affected section without needing hooks all
over for all paths that do section changes. It's cheap enough. */
if (bundle_align_p2 > OCTETS_PER_BYTE_POWER)
record_alignment (now_seg, bundle_align_p2 - OCTETS_PER_BYTE_POWER);
}
/* Assemble one instruction. This takes care of the bundle features
around calling md_assemble. */
static void
assemble_one (char *line)
{
fragS *insn_start_frag = NULL;
if (bundle_lock_frchain != NULL && bundle_lock_frchain != frchain_now)
{
as_bad (_("cannot change section or subsection inside .bundle_lock"));
/* Clearing this serves as a marker that we have already complained. */
bundle_lock_frchain = NULL;
}
if (bundle_lock_frchain == NULL && bundle_align_p2 > 0)
insn_start_frag = start_bundle ();
md_assemble (line);
if (bundle_lock_frchain != NULL)
{
/* Make sure this hasn't pushed the locked sequence
past the bundle size. */
unsigned int bundle_size = pending_bundle_size (bundle_lock_frag);
if (bundle_size > 1U << bundle_align_p2)
as_bad (_ (".bundle_lock sequence at %u bytes, "
"but .bundle_align_mode limit is %u bytes"),
bundle_size, 1U << bundle_align_p2);
}
else if (bundle_align_p2 > 0)
{
unsigned int insn_size = pending_bundle_size (insn_start_frag);
if (insn_size > 1U << bundle_align_p2)
as_bad (_("single instruction is %u bytes long, "
"but .bundle_align_mode limit is %u bytes"),
insn_size, 1U << bundle_align_p2);
finish_bundle (insn_start_frag, insn_size);
}
}
#else /* !HANDLE_BUNDLE */
# define assemble_one(line) md_assemble(line)
#endif /* HANDLE_BUNDLE */
static bool
in_bss (void)
{
flagword flags = bfd_section_flags (now_seg);
return (flags & SEC_ALLOC) && !(flags & (SEC_LOAD | SEC_HAS_CONTENTS));
}
/* Guts of .align directive:
N is the power of two to which to align. A value of zero is accepted but
ignored: the default alignment of the section will be at least this.
FILL may be NULL, or it may point to the bytes of the fill pattern.
LEN is the length of whatever FILL points to, if anything. If LEN is zero
but FILL is not NULL then LEN is treated as if it were one.
MAX is the maximum number of characters to skip when doing the alignment,
or 0 if there is no maximum. */
void
do_align (unsigned int n, char *fill, unsigned int len, unsigned int max)
{
if (now_seg == absolute_section || in_bss ())
{
if (fill != NULL)
while (len-- > 0)
if (*fill++ != '\0')
{
if (now_seg == absolute_section)
as_warn (_("ignoring fill value in absolute section"));
else
as_warn (_("ignoring fill value in section `%s'"),
segment_name (now_seg));
break;
}
fill = NULL;
len = 0;
}
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
#ifdef md_do_align
md_do_align (n, fill, len, max, just_record_alignment);
#endif
/* Only make a frag if we HAVE to... */
if ((n > OCTETS_PER_BYTE_POWER) && !need_pass_2)
{
if (fill == NULL)
{
if (subseg_text_p (now_seg))
frag_align_code (n, max);
else
frag_align (n, 0, max);
}
else if (len <= 1)
frag_align (n, *fill, max);
else
frag_align_pattern (n, fill, len, max);
}
#ifdef md_do_align
just_record_alignment: ATTRIBUTE_UNUSED_LABEL
#endif
if (n > OCTETS_PER_BYTE_POWER)
record_alignment (now_seg, n - OCTETS_PER_BYTE_POWER);
}
/* We read the file, putting things into a web that represents what we
have been reading. */
void
read_a_source_file (const char *name)
{
char nul_char;
char next_char;
char *s; /* String of symbol, '\0' appended. */
long temp;
const pseudo_typeS *pop;
#ifdef WARN_COMMENTS
found_comment = 0;
#endif
buffer = input_scrub_new_file (name);
listing_file (name);
listing_newline (NULL);
register_dependency (name);
/* Generate debugging information before we've read anything in to denote
this file as the "main" source file and not a subordinate one
(e.g. N_SO vs N_SOL in stabs). */
generate_file_debug ();
while ((buffer_limit = input_scrub_next_buffer (&input_line_pointer)) != 0)
{ /* We have another line to parse. */
#ifndef NO_LISTING
/* In order to avoid listing macro expansion lines with labels
multiple times, keep track of which line was last issued. */
static char *last_eol;
last_eol = NULL;
#endif
while (input_line_pointer < buffer_limit)
{
bool was_new_line;
/* We have more of this buffer to parse. */
/* We now have input_line_pointer->1st char of next line.
If input_line_pointer [-1] == '\n' then we just
scanned another line: so bump line counters. */
was_new_line = is_end_of_line[(unsigned char) input_line_pointer[-1]];
if (was_new_line)
{
symbol_set_value_now (&dot_symbol);
#ifdef md_start_line_hook
md_start_line_hook ();
#endif
if (input_line_pointer[-1] == '\n')
bump_line_counters ();
}
#ifndef NO_LISTING
/* If listing is on, and we are expanding a macro, then give
the listing code the contents of the expanded line. */
if (listing)
{
if ((listing & LISTING_MACEXP) && macro_nest > 0)
{
/* Find the end of the current expanded macro line. */
s = find_end_of_line (input_line_pointer, flag_m68k_mri);
if (s != last_eol)
{
char *copy;
int len;
last_eol = s;
/* Copy it for safe keeping. Also give an indication of
how much macro nesting is involved at this point. */
len = s - input_line_pointer;
copy = XNEWVEC (char, len + macro_nest + 2);
memset (copy, '>', macro_nest);
copy[macro_nest] = ' ';
memcpy (copy + macro_nest + 1, input_line_pointer, len);
copy[macro_nest + 1 + len] = '\0';
/* Install the line with the listing facility. */
listing_newline (copy);
}
}
else
listing_newline (NULL);
}
#endif
if (was_new_line)
{
line_label = NULL;
if (LABELS_WITHOUT_COLONS || flag_m68k_mri)
{
next_char = * input_line_pointer;
/* Text at the start of a line must be a label, we
run down and stick a colon in. */
if (is_name_beginner (next_char) || next_char == '"')
{
char *line_start;
int mri_line_macro;
HANDLE_CONDITIONAL_ASSEMBLY (0);
nul_char = get_symbol_name (& line_start);
next_char = (nul_char == '"' ? input_line_pointer[1] : nul_char);
/* In MRI mode, the EQU and MACRO pseudoops must
be handled specially. */
mri_line_macro = 0;
if (flag_m68k_mri)
{
char *rest = input_line_pointer + 1;
if (*rest == ':')
++rest;
if (*rest == ' ' || *rest == '\t')
++rest;
if ((strncasecmp (rest, "EQU", 3) == 0
|| strncasecmp (rest, "SET", 3) == 0)
&& (rest[3] == ' ' || rest[3] == '\t'))
{
input_line_pointer = rest + 3;
equals (line_start,
strncasecmp (rest, "SET", 3) == 0);
continue;
}
if (strncasecmp (rest, "MACRO", 5) == 0
&& (rest[5] == ' '
|| rest[5] == '\t'
|| is_end_of_line[(unsigned char) rest[5]]))
mri_line_macro = 1;
}
/* In MRI mode, we need to handle the MACRO
pseudo-op specially: we don't want to put the
symbol in the symbol table. */
if (!mri_line_macro
#ifdef TC_START_LABEL_WITHOUT_COLON
&& TC_START_LABEL_WITHOUT_COLON (nul_char, next_char)
#endif
)
line_label = colon (line_start);
else
line_label = symbol_create (line_start,
absolute_section,
&zero_address_frag, 0);
next_char = restore_line_pointer (nul_char);
if (next_char == ':')
input_line_pointer++;
}
}
}
/* We are at the beginning of a line, or similar place.
We expect a well-formed assembler statement.
A "symbol-name:" is a statement.
Depending on what compiler is used, the order of these tests
may vary to catch most common case 1st.
Each test is independent of all other tests at the (top)
level. */
do
nul_char = next_char = *input_line_pointer++;
while (next_char == '\t' || next_char == ' ' || next_char == '\f');
/* C is the 1st significant character.
Input_line_pointer points after that character. */
if (is_name_beginner (next_char) || next_char == '"')
{
char *rest;
/* Want user-defined label or pseudo/opcode. */
HANDLE_CONDITIONAL_ASSEMBLY (1);
--input_line_pointer;
nul_char = get_symbol_name (& s); /* name's delimiter. */
next_char = (nul_char == '"' ? input_line_pointer[1] : nul_char);
rest = input_line_pointer + (nul_char == '"' ? 2 : 1);
/* NEXT_CHAR is character after symbol.
The end of symbol in the input line is now '\0'.
S points to the beginning of the symbol.
[In case of pseudo-op, s->'.'.]
Input_line_pointer->'\0' where NUL_CHAR was. */
if (TC_START_LABEL (s, nul_char, next_char))
{
if (flag_m68k_mri)
{
/* In MRI mode, \tsym: set 0 is permitted. */
if (*rest == ':')
++rest;
if (*rest == ' ' || *rest == '\t')
++rest;
if ((strncasecmp (rest, "EQU", 3) == 0
|| strncasecmp (rest, "SET", 3) == 0)
&& (rest[3] == ' ' || rest[3] == '\t'))
{
input_line_pointer = rest + 3;
equals (s, 1);
continue;
}
}
line_label = colon (s); /* User-defined label. */
restore_line_pointer (nul_char);
++ input_line_pointer;
#ifdef tc_check_label
tc_check_label (line_label);
#endif
/* Input_line_pointer->after ':'. */
SKIP_WHITESPACE ();
}
else if ((next_char == '=' && *rest == '=')
|| ((next_char == ' ' || next_char == '\t')
&& rest[0] == '='
&& rest[1] == '='))
{
equals (s, -1);
demand_empty_rest_of_line ();
}
else if ((next_char == '='
|| ((next_char == ' ' || next_char == '\t')
&& *rest == '='))
#ifdef TC_EQUAL_IN_INSN
&& !TC_EQUAL_IN_INSN (next_char, s)
#endif
)
{
equals (s, 1);
demand_empty_rest_of_line ();
}
else
{
/* Expect pseudo-op or machine instruction. */
pop = NULL;
#ifndef TC_CASE_SENSITIVE
{
char *s2 = s;
strncpy (original_case_string, s2,
sizeof (original_case_string) - 1);
original_case_string[sizeof (original_case_string) - 1] = 0;
while (*s2)
{
*s2 = TOLOWER (*s2);
s2++;
}
}
#endif
if (NO_PSEUDO_DOT || flag_m68k_mri)
{
/* The MRI assembler uses pseudo-ops without
a period. */
pop = po_entry_find (po_hash, s);
if (pop != NULL && pop->poc_handler == NULL)
pop = NULL;
}
if (pop != NULL
|| (!flag_m68k_mri && *s == '.'))
{
/* PSEUDO - OP.
WARNING: next_char may be end-of-line.
We lookup the pseudo-op table with s+1 because we
already know that the pseudo-op begins with a '.'. */
if (pop == NULL)
pop = po_entry_find (po_hash, s + 1);
if (pop && !pop->poc_handler)
pop = NULL;
/* In MRI mode, we may need to insert an
automatic alignment directive. What a hack
this is. */
if (mri_pending_align
&& (pop == NULL
|| !((pop->poc_handler == cons
&& pop->poc_val == 1)
|| (pop->poc_handler == s_space
&& pop->poc_val == 1)
#ifdef tc_conditional_pseudoop
|| tc_conditional_pseudoop (pop)
#endif
|| pop->poc_handler == s_if
|| pop->poc_handler == s_ifdef
|| pop->poc_handler == s_ifc
|| pop->poc_handler == s_ifeqs
|| pop->poc_handler == s_else
|| pop->poc_handler == s_endif
|| pop->poc_handler == s_globl
|| pop->poc_handler == s_ignore)))
{
do_align (1, (char *) NULL, 0, 0);
mri_pending_align = 0;
if (line_label != NULL)
{
symbol_set_frag (line_label, frag_now);
S_SET_VALUE (line_label, frag_now_fix ());
}
}
/* Print the error msg now, while we still can. */
if (pop == NULL)
{
char *end = input_line_pointer;
(void) restore_line_pointer (nul_char);
s_ignore (0);
nul_char = next_char = *--input_line_pointer;
*input_line_pointer = '\0';
if (! macro_defined || ! try_macro (next_char, s))
{
*end = '\0';
as_bad (_("unknown pseudo-op: `%s'"), s);
*input_line_pointer++ = nul_char;
}
continue;
}
/* Put it back for error messages etc. */
next_char = restore_line_pointer (nul_char);
/* The following skip of whitespace is compulsory.
A well shaped space is sometimes all that separates
keyword from operands. */
if (next_char == ' ' || next_char == '\t')
input_line_pointer++;
/* Input_line is restored.
Input_line_pointer->1st non-blank char
after pseudo-operation. */
(*pop->poc_handler) (pop->poc_val);
/* If that was .end, just get out now. */
if (pop->poc_handler == s_end)
goto quit;
}
else
{
/* WARNING: next_char may be end-of-line. */
/* Also: input_line_pointer->`\0` where nul_char was. */
(void) restore_line_pointer (nul_char);
input_line_pointer = _find_end_of_line (input_line_pointer, flag_m68k_mri, 1, 0);
next_char = nul_char = *input_line_pointer;
*input_line_pointer = '\0';
generate_lineno_debug ();
if (macro_defined && try_macro (next_char, s))
continue;
if (mri_pending_align)
{
do_align (1, (char *) NULL, 0, 0);
mri_pending_align = 0;
if (line_label != NULL)
{
symbol_set_frag (line_label, frag_now);
S_SET_VALUE (line_label, frag_now_fix ());
}
}
assemble_one (s); /* Assemble 1 instruction. */
/* PR 19630: The backend may have set ilp to NULL
if it encountered a catastrophic failure. */
if (input_line_pointer == NULL)
as_fatal (_("unable to continue with assembly."));
*input_line_pointer++ = nul_char;
/* We resume loop AFTER the end-of-line from
this instruction. */
}
}
continue;
}
/* Empty statement? */
if (is_end_of_line[(unsigned char) next_char])
continue;
if ((LOCAL_LABELS_DOLLAR || LOCAL_LABELS_FB) && ISDIGIT (next_char))
{
/* local label ("4:") */
char *backup = input_line_pointer;
HANDLE_CONDITIONAL_ASSEMBLY (1);
temp = next_char - '0';
if (nul_char == '"')
++ input_line_pointer;
/* Read the whole number. */
while (ISDIGIT (*input_line_pointer))
{
const long digit = *input_line_pointer - '0';
if (temp > (LONG_MAX - digit) / 10)
{
as_bad (_("local label too large near %s"), backup);
temp = -1;
break;
}
temp = temp * 10 + digit;
++input_line_pointer;
}
/* Overflow: stop processing the label. */
if (temp == -1)
{
ignore_rest_of_line ();
continue;
}
if (LOCAL_LABELS_DOLLAR
&& *input_line_pointer == '$'
&& *(input_line_pointer + 1) == ':')
{
input_line_pointer += 2;
if (dollar_label_defined (temp))
{
as_fatal (_("label \"%ld$\" redefined"), temp);
}
define_dollar_label (temp);
colon (dollar_label_name (temp, 0));
continue;
}
if (LOCAL_LABELS_FB
&& *input_line_pointer++ == ':')
{
fb_label_instance_inc (temp);
colon (fb_label_name (temp, 0));
continue;
}
input_line_pointer = backup;
}
if (next_char && strchr (line_comment_chars, next_char))
{ /* Its a comment. Better say APP or NO_APP. */
sb sbuf;
char *ends;
char *new_buf;
char *new_tmp;
unsigned int new_length;
char *tmp_buf = 0;
s = input_line_pointer;
if (!startswith (s, "APP\n"))
{
/* We ignore it. */
ignore_rest_of_line ();
continue;
}
bump_line_counters ();
s += 4;
ends = strstr (s, "#NO_APP\n");
if (!ends)
{
unsigned int tmp_len;
unsigned int num;
/* The end of the #APP wasn't in this buffer. We
keep reading in buffers until we find the #NO_APP
that goes with this #APP There is one. The specs
guarantee it... */
tmp_len = buffer_limit - s;
tmp_buf = XNEWVEC (char, tmp_len + 1);
memcpy (tmp_buf, s, tmp_len);
do
{
new_tmp = input_scrub_next_buffer (&buffer);
if (!new_tmp)
break;
else
buffer_limit = new_tmp;
input_line_pointer = buffer;
ends = strstr (buffer, "#NO_APP\n");
if (ends)
num = ends - buffer;
else
num = buffer_limit - buffer;
tmp_buf = XRESIZEVEC (char, tmp_buf, tmp_len + num);
memcpy (tmp_buf + tmp_len, buffer, num);
tmp_len += num;
}
while (!ends);
input_line_pointer = ends ? ends + 8 : NULL;
s = tmp_buf;
ends = s + tmp_len;
}
else
{
input_line_pointer = ends + 8;
}
scrub_string = s;
scrub_string_end = ends;
new_length = ends - s;
new_buf = XNEWVEC (char, new_length);
new_tmp = new_buf;
for (;;)
{
size_t space;
size_t size;
space = (new_buf + new_length) - new_tmp;
size = do_scrub_chars (scrub_from_string, new_tmp, space);
if (size < space)
{
new_tmp[size] = 0;
break;
}
new_buf = XRESIZEVEC (char, new_buf, new_length + 100);
new_tmp = new_buf + new_length;
new_length += 100;
}
free (tmp_buf);
/* We've "scrubbed" input to the preferred format. In the
process we may have consumed the whole of the remaining
file (and included files). We handle this formatted
input similar to that of macro expansion, letting
actual macro expansion (possibly nested) and other
input expansion work. Beware that in messages, line
numbers and possibly file names will be incorrect. */
new_length = strlen (new_buf);
sb_build (&sbuf, new_length);
sb_add_buffer (&sbuf, new_buf, new_length);
input_scrub_include_sb (&sbuf, input_line_pointer, 0);
sb_kill (&sbuf);
buffer_limit = input_scrub_next_buffer (&input_line_pointer);
free (new_buf);
continue;
}
HANDLE_CONDITIONAL_ASSEMBLY (1);
#ifdef tc_unrecognized_line
if (tc_unrecognized_line (next_char))
continue;
#endif
input_line_pointer--;
/* Report unknown char as error. */
demand_empty_rest_of_line ();
}
}
quit:
symbol_set_value_now (&dot_symbol);
#ifdef HANDLE_BUNDLE
if (bundle_lock_frag != NULL)
{
as_bad_where (bundle_lock_frag->fr_file, bundle_lock_frag->fr_line,
_(".bundle_lock with no matching .bundle_unlock"));
bundle_lock_frag = NULL;
bundle_lock_frchain = NULL;
bundle_lock_depth = 0;
}
#endif
#ifdef md_cleanup
md_cleanup ();
#endif
/* Close the input file. */
input_scrub_close ();
#ifdef WARN_COMMENTS
{
if (warn_comment && found_comment)
as_warn_where (found_comment_file, found_comment,
"first comment found here");
}
#endif
}
/* Convert O_constant expression EXP into the equivalent O_big representation.
Take the sign of the number from SIGN rather than X_add_number. */
static void
convert_to_bignum (expressionS *exp, int sign)
{
valueT value;
unsigned int i;
value = exp->X_add_number;
for (i = 0; i < sizeof (exp->X_add_number) / CHARS_PER_LITTLENUM; i++)
{
generic_bignum[i] = value & LITTLENUM_MASK;
value >>= LITTLENUM_NUMBER_OF_BITS;
}
/* Add a sequence of sign bits if the top bit of X_add_number is not
the sign of the original value. */
if ((exp->X_add_number < 0) == !sign)
generic_bignum[i++] = sign ? LITTLENUM_MASK : 0;
exp->X_op = O_big;
exp->X_add_number = i;
}
/* For most MRI pseudo-ops, the line actually ends at the first
nonquoted space. This function looks for that point, stuffs a null
in, and sets *STOPCP to the character that used to be there, and
returns the location.
Until I hear otherwise, I am going to assume that this is only true
for the m68k MRI assembler. */
char *
mri_comment_field (char *stopcp)
{
char *s;
#ifdef TC_M68K
int inquote = 0;
know (flag_m68k_mri);
for (s = input_line_pointer;
((!is_end_of_line[(unsigned char) *s] && *s != ' ' && *s != '\t')
|| inquote);
s++)
{
if (*s == '\'')
inquote = !inquote;
}
#else
for (s = input_line_pointer;
!is_end_of_line[(unsigned char) *s];
s++)
;
#endif
*stopcp = *s;
*s = '\0';
return s;
}
/* Skip to the end of an MRI comment field. */
void
mri_comment_end (char *stop, int stopc)
{
know (flag_mri);
input_line_pointer = stop;
*stop = stopc;
while (!is_end_of_line[(unsigned char) *input_line_pointer])
++input_line_pointer;
}
void
s_abort (int ignore ATTRIBUTE_UNUSED)
{
as_fatal (_(".abort detected. Abandoning ship."));
}
/* Handle the .align pseudo-op. A positive ARG is a default alignment
(in bytes). A negative ARG is the negative of the length of the
fill pattern. BYTES_P is non-zero if the alignment value should be
interpreted as the byte boundary, rather than the power of 2. */
#ifndef TC_ALIGN_LIMIT
#define TC_ALIGN_LIMIT (stdoutput->arch_info->bits_per_address - 1)
#endif
static void
s_align (signed int arg, int bytes_p)
{
unsigned int align_limit = TC_ALIGN_LIMIT;
addressT align;
char *stop = NULL;
char stopc = 0;
offsetT fill = 0;
unsigned int max;
int fill_p;
if (flag_mri)
stop = mri_comment_field (&stopc);
if (is_end_of_line[(unsigned char) *input_line_pointer])
{
if (arg < 0)
align = 0;
else
align = arg; /* Default value from pseudo-op table. */
}
else
{
align = get_absolute_expression ();
SKIP_WHITESPACE ();
#ifdef TC_ALIGN_ZERO_IS_DEFAULT
if (arg > 0 && align == 0)
align = arg;
#endif
}
if (bytes_p)
{
/* Convert to a power of 2. */
if (align != 0)
{
unsigned int i;
for (i = 0; (align & 1) == 0; align >>= 1, ++i)
;
if (align != 1)
as_bad (_("alignment not a power of 2"));
align = i;
}
}
if (align > align_limit)
{
align = align_limit;
as_warn (_("alignment too large: %u assumed"), align_limit);
}
if (*input_line_pointer != ',')
{
fill_p = 0;
max = 0;
}
else
{
++input_line_pointer;
if (*input_line_pointer == ',')
fill_p = 0;
else
{
fill = get_absolute_expression ();
SKIP_WHITESPACE ();
fill_p = 1;
}
if (*input_line_pointer != ',')
max = 0;
else
{
++input_line_pointer;
max = get_absolute_expression ();
}
}
if (!fill_p)
{
if (arg < 0)
as_warn (_("expected fill pattern missing"));
do_align (align, (char *) NULL, 0, max);
}
else
{
unsigned int fill_len;
if (arg >= 0)
fill_len = 1;
else
fill_len = -arg;
if (fill_len <= 1)
{
char fill_char = 0;
fill_char = fill;
do_align (align, &fill_char, fill_len, max);
}
else
{
char ab[16];
if ((size_t) fill_len > sizeof ab)
{
as_warn (_("fill pattern too long, truncating to %u"),
(unsigned) sizeof ab);
fill_len = sizeof ab;
}
md_number_to_chars (ab, fill, fill_len);
do_align (align, ab, fill_len, max);
}
}
demand_empty_rest_of_line ();
if (flag_mri)
mri_comment_end (stop, stopc);
}
/* Handle the .align pseudo-op on machines where ".align 4" means
align to a 4 byte boundary. */
void
s_align_bytes (int arg)
{
s_align (arg, 1);
}
/* Handle the .align pseudo-op on machines where ".align 4" means align
to a 2**4 boundary. */
void
s_align_ptwo (int arg)
{
s_align (arg, 0);
}
/* Switch in and out of alternate macro mode. */
static void
s_altmacro (int on)
{
demand_empty_rest_of_line ();
macro_set_alternate (on);
}
/* Read a symbol name from input_line_pointer.
Stores the symbol name in a buffer and returns a pointer to this buffer.
The buffer is xalloc'ed. It is the caller's responsibility to free
this buffer.
The name is not left in the i_l_p buffer as it may need processing
to handle escape characters.
Advances i_l_p to the next non-whitespace character.
If a symbol name could not be read, the routine issues an error
messages, skips to the end of the line and returns NULL. */
char *
read_symbol_name (void)
{
char * name;
char * start;
char c;
c = *input_line_pointer++;
if (c == '"')
{
#define SYM_NAME_CHUNK_LEN 128
ptrdiff_t len = SYM_NAME_CHUNK_LEN;
char * name_end;
unsigned int C;
start = name = XNEWVEC (char, len + 1);
name_end = name + SYM_NAME_CHUNK_LEN;
while (is_a_char (C = next_char_of_string ()))
{
if (name >= name_end)
{
ptrdiff_t sofar;
sofar = name - start;
len += SYM_NAME_CHUNK_LEN;
start = XRESIZEVEC (char, start, len + 1);
name_end = start + len;
name = start + sofar;
}
*name++ = (char) C;
}
*name = 0;
/* Since quoted symbol names can contain non-ASCII characters,
check the string and warn if it cannot be recognised by the
current character set. */
if (mbstowcs (NULL, name, len) == (size_t) -1)
as_warn (_("symbol name not recognised in the current locale"));
}
else if (is_name_beginner (c) || (input_from_string && c == FAKE_LABEL_CHAR))
{
ptrdiff_t len;
name = input_line_pointer - 1;
/* We accept FAKE_LABEL_CHAR in a name in case this is
being called with a constructed string. */
while (is_part_of_name (c = *input_line_pointer++)
|| (input_from_string && c == FAKE_LABEL_CHAR))
;
len = (input_line_pointer - name) - 1;
start = XNEWVEC (char, len + 1);
memcpy (start, name, len);
start[len] = 0;
/* Skip a name ender char if one is present. */
if (! is_name_ender (c))
--input_line_pointer;
}
else
name = start = NULL;
if (name == start)
{
as_bad (_("expected symbol name"));
ignore_rest_of_line ();
return NULL;
}
SKIP_WHITESPACE ();
return start;
}
symbolS *
s_comm_internal (int param,
symbolS *(*comm_parse_extra) (int, symbolS *, addressT))
{
char *name;
offsetT temp, size;
symbolS *symbolP = NULL;
char *stop = NULL;
char stopc = 0;
expressionS exp;
if (flag_mri)
stop = mri_comment_field (&stopc);
if ((name = read_symbol_name ()) == NULL)
goto out;
/* Accept an optional comma after the name. The comma used to be
required, but Irix 5 cc does not generate it for .lcomm. */
if (*input_line_pointer == ',')
input_line_pointer++;
temp = get_absolute_expr (&exp);
size = temp;
size &= ((addressT) 2 << (stdoutput->arch_info->bits_per_address - 1)) - 1;
if (exp.X_op == O_absent)
{
as_bad (_("missing size expression"));
ignore_rest_of_line ();
goto out;
}
else if (temp != size || !exp.X_unsigned)
{
as_warn (_("size (%ld) out of range, ignored"), (long) temp);
ignore_rest_of_line ();
goto out;
}
symbolP = symbol_find_or_make (name);
if ((S_IS_DEFINED (symbolP) || symbol_equated_p (symbolP))
&& !S_IS_COMMON (symbolP))
{
if (!S_IS_VOLATILE (symbolP))
{
symbolP = NULL;
as_bad (_("symbol `%s' is already defined"), name);
ignore_rest_of_line ();
goto out;
}
symbolP = symbol_clone (symbolP, 1);
S_SET_SEGMENT (symbolP, undefined_section);
S_SET_VALUE (symbolP, 0);
symbol_set_frag (symbolP, &zero_address_frag);
S_CLEAR_VOLATILE (symbolP);
}
size = S_GET_VALUE (symbolP);
if (size == 0)
size = temp;
else if (size != temp)
as_warn (_("size of \"%s\" is already %ld; not changing to %ld"),
name, (long) size, (long) temp);
if (comm_parse_extra != NULL)
symbolP = (*comm_parse_extra) (param, symbolP, size);
else
{
S_SET_VALUE (symbolP, (valueT) size);
S_SET_EXTERNAL (symbolP);
S_SET_SEGMENT (symbolP, bfd_com_section_ptr);
}
demand_empty_rest_of_line ();
out:
if (flag_mri)
mri_comment_end (stop, stopc);
free (name);
return symbolP;
}
void
s_comm (int ignore)
{
s_comm_internal (ignore, NULL);
}
/* The MRI COMMON pseudo-op. We handle this by creating a common
symbol with the appropriate name. We make s_space do the right
thing by increasing the size. */
void
s_mri_common (int small ATTRIBUTE_UNUSED)
{
char *name;
char c;
char *alc = NULL;
symbolS *sym;
offsetT align;
char *stop = NULL;
char stopc = 0;
if (!flag_mri)
{
s_comm (0);
return;
}
stop = mri_comment_field (&stopc);
SKIP_WHITESPACE ();
name = input_line_pointer;
if (!ISDIGIT (*name))
c = get_symbol_name (& name);
else
{
do
{
++input_line_pointer;
}
while (ISDIGIT (*input_line_pointer));
c = *input_line_pointer;
*input_line_pointer = '\0';
if (line_label != NULL)
{
alc = XNEWVEC (char, strlen (S_GET_NAME (line_label))
+ (input_line_pointer - name) + 1);
sprintf (alc, "%s%s", name, S_GET_NAME (line_label));
name = alc;
}
}
sym = symbol_find_or_make (name);
c = restore_line_pointer (c);
free (alc);
if (*input_line_pointer != ',')
align = 0;
else
{
++input_line_pointer;
align = get_absolute_expression ();
}
if (S_IS_DEFINED (sym) && !S_IS_COMMON (sym))
{
as_bad (_("symbol `%s' is already defined"), S_GET_NAME (sym));
ignore_rest_of_line ();
mri_comment_end (stop, stopc);
return;
}
S_SET_EXTERNAL (sym);
S_SET_SEGMENT (sym, bfd_com_section_ptr);
mri_common_symbol = sym;
#ifdef S_SET_ALIGN
if (align != 0)
S_SET_ALIGN (sym, align);
#else
(void) align;
#endif
if (line_label != NULL)
{
expressionS exp;
exp.X_op = O_symbol;
exp.X_add_symbol = sym;
exp.X_add_number = 0;
symbol_set_value_expression (line_label, &exp);
symbol_set_frag (line_label, &zero_address_frag);
S_SET_SEGMENT (line_label, expr_section);
}
/* FIXME: We just ignore the small argument, which distinguishes
COMMON and COMMON.S. I don't know what we can do about it. */
/* Ignore the type and hptype. */
if (*input_line_pointer == ',')
input_line_pointer += 2;
if (*input_line_pointer == ',')
input_line_pointer += 2;
demand_empty_rest_of_line ();
mri_comment_end (stop, stopc);
}
void
s_data (int ignore ATTRIBUTE_UNUSED)
{
segT section;
int temp;
temp = get_absolute_expression ();
if (flag_readonly_data_in_text)
{
section = text_section;
temp += 1000;
}
else
section = data_section;
subseg_set (section, (subsegT) temp);
demand_empty_rest_of_line ();
}
/* Handle the .appfile pseudo-op. This is automatically generated by
do_scrub_chars when a preprocessor # line comment is seen with a
file name. This default definition may be overridden by the object
or CPU specific pseudo-ops. This function is also the default
definition for .file; the APPFILE argument is 1 for .appfile, 0 for
.file. */
void
s_app_file_string (char *file, int appfile ATTRIBUTE_UNUSED)
{
#ifdef LISTING
if (listing)
listing_source_file (file);
#endif
register_dependency (file);
#ifdef obj_app_file
obj_app_file (file, appfile);
#endif
}
void
s_app_file (int appfile)
{
char *s;
int length;
/* Some assemblers tolerate immediately following '"'. */
if ((s = demand_copy_string (&length)) != 0)
{
int may_omit
= (!new_logical_line_flags (s, -1, 1) && appfile);
/* In MRI mode, the preprocessor may have inserted an extraneous
backquote. */
if (flag_m68k_mri
&& *input_line_pointer == '\''
&& is_end_of_line[(unsigned char) input_line_pointer[1]])
++input_line_pointer;
demand_empty_rest_of_line ();
if (!may_omit)
s_app_file_string (s, appfile);
}
}
static int
get_linefile_number (int *flag)
{
SKIP_WHITESPACE ();
if (*input_line_pointer < '0' || *input_line_pointer > '9')
return 0;
*flag = get_absolute_expression ();
return 1;
}
/* Handle the .appline pseudo-op. This is automatically generated by
do_scrub_chars when a preprocessor # line comment is seen. This
default definition may be overridden by the object or CPU specific
pseudo-ops. */
void
s_app_line (int appline)
{
char *file = NULL;
int l;
/* The given number is that of the next line. */
if (appline)
l = get_absolute_expression ();
else if (!get_linefile_number (&l))
{
ignore_rest_of_line ();
return;
}
l--;
if (l < -1)
/* Some of the back ends can't deal with non-positive line numbers.
Besides, it's silly. GCC however will generate a line number of
zero when it is pre-processing builtins for assembler-with-cpp files:
# 0 "<built-in>"
We do not want to barf on this, especially since such files are used
in the GCC and GDB testsuites. So we check for negative line numbers
rather than non-positive line numbers. */
as_warn (_("line numbers must be positive; line number %d rejected"),
l + 1);
else
{
int flags = 0;
int length = 0;
if (!appline)
{
SKIP_WHITESPACE ();
if (*input_line_pointer == '"')
file = demand_copy_string (&length);
if (file)
{
int this_flag;
while (get_linefile_number (&this_flag))
switch (this_flag)
{
/* From GCC's cpp documentation:
1: start of a new file.
2: returning to a file after having included
another file.
3: following text comes from a system header file.
4: following text should be treated as extern "C".
4 is nonsensical for the assembler; 3, we don't
care about, so we ignore it just in case a
system header file is included while
preprocessing assembly. So 1 and 2 are all we
care about, and they are mutually incompatible.
new_logical_line_flags() demands this. */
case 1:
case 2:
if (flags && flags != (1 << this_flag))
as_warn (_("incompatible flag %i in line directive"),
this_flag);
else
flags |= 1 << this_flag;
break;
case 3:
case 4:
/* We ignore these. */
break;
default:
as_warn (_("unsupported flag %i in line directive"),
this_flag);
break;
}
if (!is_end_of_line[(unsigned char)*input_line_pointer])
file = 0;
}
}
if (appline || file)
{
new_logical_line_flags (file, l, flags);
#ifdef LISTING
if (listing)
listing_source_line (l);
#endif
}
}
if (appline || file)
demand_empty_rest_of_line ();
else
ignore_rest_of_line ();
}
/* Handle the .end pseudo-op. Actually, the real work is done in
read_a_source_file. */
void
s_end (int ignore ATTRIBUTE_UNUSED)
{
if (flag_mri)
{
/* The MRI assembler permits the start symbol to follow .end,
but we don't support that. */
SKIP_WHITESPACE ();
if (!is_end_of_line[(unsigned char) *input_line_pointer]
&& *input_line_pointer != '*'
&& *input_line_pointer != '!')
as_warn (_("start address not supported"));
}
}
/* Handle the .err pseudo-op. */
void
s_err (int ignore ATTRIBUTE_UNUSED)
{
as_bad (_(".err encountered"));
demand_empty_rest_of_line ();
}
/* Handle the .error and .warning pseudo-ops. */
void
s_errwarn (int err)
{
int len;
/* The purpose for the conditional assignment is not to
internationalize the directive itself, but that we need a
self-contained message, one that can be passed like the
demand_copy_C_string return value, and with no assumption on the
location of the name of the directive within the message. */
const char *msg
= (err ? _(".error directive invoked in source file")
: _(".warning directive invoked in source file"));
if (!is_it_end_of_statement ())
{
if (*input_line_pointer != '\"')
{
as_bad (_("%s argument must be a string"),
err ? ".error" : ".warning");
ignore_rest_of_line ();
return;
}
msg = demand_copy_C_string (&len);
if (msg == NULL)
return;
}
if (err)
as_bad ("%s", msg);
else
as_warn ("%s", msg);
demand_empty_rest_of_line ();
}
/* Handle the MRI fail pseudo-op. */
void
s_fail (int ignore ATTRIBUTE_UNUSED)
{
offsetT temp;
char *stop = NULL;
char stopc = 0;
if (flag_mri)
stop = mri_comment_field (&stopc);
temp = get_absolute_expression ();
if (temp >= 500)
as_warn (_(".fail %ld encountered"), (long) temp);
else
as_bad (_(".fail %ld encountered"), (long) temp);
demand_empty_rest_of_line ();
if (flag_mri)
mri_comment_end (stop, stopc);
}
void
s_fill (int ignore ATTRIBUTE_UNUSED)
{
expressionS rep_exp;
long size = 1;
long fill = 0;
char *p;
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
#ifdef md_cons_align
md_cons_align (1);
#endif
expression (&rep_exp);
if (*input_line_pointer == ',')
{
input_line_pointer++;
size = get_absolute_expression ();
if (*input_line_pointer == ',')
{
input_line_pointer++;
fill = get_absolute_expression ();
}
}
/* This is to be compatible with BSD 4.2 AS, not for any rational reason. */
#define BSD_FILL_SIZE_CROCK_8 (8)
if (size > BSD_FILL_SIZE_CROCK_8)
{
as_warn (_(".fill size clamped to %d"), BSD_FILL_SIZE_CROCK_8);
size = BSD_FILL_SIZE_CROCK_8;
}
if (size < 0)
{
as_warn (_("size negative; .fill ignored"));
size = 0;
}
else if (rep_exp.X_op == O_constant && rep_exp.X_add_number <= 0)
{
if (rep_exp.X_add_number < 0)
as_warn (_("repeat < 0; .fill ignored"));
size = 0;
}
if (size && !need_pass_2)
{
if (now_seg == absolute_section)
{
if (rep_exp.X_op != O_constant)
as_bad (_("non-constant fill count for absolute section"));
else if (fill && rep_exp.X_add_number != 0)
as_bad (_("attempt to fill absolute section with non-zero value"));
abs_section_offset += rep_exp.X_add_number * size;
}
else if (fill
&& (rep_exp.X_op != O_constant || rep_exp.X_add_number != 0)
&& in_bss ())
as_bad (_("attempt to fill section `%s' with non-zero value"),
segment_name (now_seg));
if (rep_exp.X_op == O_constant)
{
p = frag_var (rs_fill, (int) size, (int) size,
(relax_substateT) 0, (symbolS *) 0,
(offsetT) rep_exp.X_add_number,
(char *) 0);
}
else
{
/* We don't have a constant repeat count, so we can't use
rs_fill. We can get the same results out of rs_space,
but its argument is in bytes, so we must multiply the
repeat count by size. */
symbolS *rep_sym;
rep_sym = make_expr_symbol (&rep_exp);
if (size != 1)
{
expressionS size_exp;
size_exp.X_op = O_constant;
size_exp.X_add_number = size;
rep_exp.X_op = O_multiply;
rep_exp.X_add_symbol = rep_sym;
rep_exp.X_op_symbol = make_expr_symbol (&size_exp);
rep_exp.X_add_number = 0;
rep_sym = make_expr_symbol (&rep_exp);
}
p = frag_var (rs_space, (int) size, (int) size,
(relax_substateT) 0, rep_sym, (offsetT) 0, (char *) 0);
}
memset (p, 0, (unsigned int) size);
/* The magic number BSD_FILL_SIZE_CROCK_4 is from BSD 4.2 VAX
flavoured AS. The following bizarre behaviour is to be
compatible with above. I guess they tried to take up to 8
bytes from a 4-byte expression and they forgot to sign
extend. */
#define BSD_FILL_SIZE_CROCK_4 (4)
md_number_to_chars (p, (valueT) fill,
(size > BSD_FILL_SIZE_CROCK_4
? BSD_FILL_SIZE_CROCK_4
: (int) size));
/* Note: .fill (),0 emits no frag (since we are asked to .fill 0 bytes)
but emits no error message because it seems a legal thing to do.
It is a degenerate case of .fill but could be emitted by a
compiler. */
}
demand_empty_rest_of_line ();
}
void
s_globl (int ignore ATTRIBUTE_UNUSED)
{
char *name;
int c;
symbolS *symbolP;
char *stop = NULL;
char stopc = 0;
if (flag_mri)
stop = mri_comment_field (&stopc);
do
{
if ((name = read_symbol_name ()) == NULL)
return;
symbolP = symbol_find_or_make (name);
S_SET_EXTERNAL (symbolP);
SKIP_WHITESPACE ();
c = *input_line_pointer;
if (c == ',')
{
input_line_pointer++;
SKIP_WHITESPACE ();
if (is_end_of_line[(unsigned char) *input_line_pointer])
c = '\n';
}
free (name);
}
while (c == ',');
demand_empty_rest_of_line ();
if (flag_mri)
mri_comment_end (stop, stopc);
}
/* Handle the MRI IRP and IRPC pseudo-ops. */
void
s_irp (int irpc)
{
char * eol;
const char * file;
unsigned int line;
sb s;
const char *err;
sb out;
file = as_where (&line);
eol = find_end_of_line (input_line_pointer, 0);
sb_build (&s, eol - input_line_pointer);
sb_add_buffer (&s, input_line_pointer, eol - input_line_pointer);
input_line_pointer = eol;
sb_new (&out);
err = expand_irp (irpc, 0, &s, &out, get_non_macro_line_sb);
if (err != NULL)
as_bad_where (file, line, "%s", err);
sb_kill (&s);
input_scrub_include_sb (&out, input_line_pointer, 1);
sb_kill (&out);
buffer_limit = input_scrub_next_buffer (&input_line_pointer);
}
/* Handle the .linkonce pseudo-op. This tells the assembler to mark
the section to only be linked once. However, this is not supported
by most object file formats. This takes an optional argument,
which is what to do about duplicates. */
void
s_linkonce (int ignore ATTRIBUTE_UNUSED)
{
enum linkonce_type type;
SKIP_WHITESPACE ();
type = LINKONCE_DISCARD;
if (!is_end_of_line[(unsigned char) *input_line_pointer])
{
char *s;
char c;
c = get_symbol_name (& s);
if (strcasecmp (s, "discard") == 0)
type = LINKONCE_DISCARD;
else if (strcasecmp (s, "one_only") == 0)
type = LINKONCE_ONE_ONLY;
else if (strcasecmp (s, "same_size") == 0)
type = LINKONCE_SAME_SIZE;
else if (strcasecmp (s, "same_contents") == 0)
type = LINKONCE_SAME_CONTENTS;
else
as_warn (_("unrecognized .linkonce type `%s'"), s);
(void) restore_line_pointer (c);
}
#ifdef obj_handle_link_once
obj_handle_link_once (type);
#else /* ! defined (obj_handle_link_once) */
{
flagword flags;
if ((bfd_applicable_section_flags (stdoutput) & SEC_LINK_ONCE) == 0)
as_warn (_(".linkonce is not supported for this object file format"));
flags = bfd_section_flags (now_seg);
flags |= SEC_LINK_ONCE;
switch (type)
{
default:
abort ();
case LINKONCE_DISCARD:
flags |= SEC_LINK_DUPLICATES_DISCARD;
break;
case LINKONCE_ONE_ONLY:
flags |= SEC_LINK_DUPLICATES_ONE_ONLY;
break;
case LINKONCE_SAME_SIZE:
flags |= SEC_LINK_DUPLICATES_SAME_SIZE;
break;
case LINKONCE_SAME_CONTENTS:
flags |= SEC_LINK_DUPLICATES_SAME_CONTENTS;
break;
}
if (!bfd_set_section_flags (now_seg, flags))
as_bad (_("bfd_set_section_flags: %s"),
bfd_errmsg (bfd_get_error ()));
}
#endif /* ! defined (obj_handle_link_once) */
demand_empty_rest_of_line ();
}
void
bss_alloc (symbolS *symbolP, addressT size, unsigned int align)
{
char *pfrag;
segT current_seg = now_seg;
subsegT current_subseg = now_subseg;
segT bss_seg = bss_section;
#if defined (TC_MIPS) || defined (TC_ALPHA)
if (OUTPUT_FLAVOR == bfd_target_ecoff_flavour
|| OUTPUT_FLAVOR == bfd_target_elf_flavour)
{
/* For MIPS and Alpha ECOFF or ELF, small objects are put in .sbss. */
if (size <= bfd_get_gp_size (stdoutput))
{
bss_seg = subseg_new (".sbss", 1);
seg_info (bss_seg)->bss = 1;
if (!bfd_set_section_flags (bss_seg, SEC_ALLOC | SEC_SMALL_DATA))
as_warn (_("error setting flags for \".sbss\": %s"),
bfd_errmsg (bfd_get_error ()));
}
}
#endif
subseg_set (bss_seg, 1);
if (align > OCTETS_PER_BYTE_POWER)
{
record_alignment (bss_seg, align);
frag_align (align, 0, 0);
}
/* Detach from old frag. */
if (S_GET_SEGMENT (symbolP) == bss_seg)
symbol_get_frag (symbolP)->fr_symbol = NULL;
symbol_set_frag (symbolP, frag_now);
pfrag = frag_var (rs_org, 1, 1, 0, symbolP, size * OCTETS_PER_BYTE, NULL);
*pfrag = 0;
#ifdef S_SET_SIZE
S_SET_SIZE (symbolP, size);
#endif
S_SET_SEGMENT (symbolP, bss_seg);
#ifdef OBJ_COFF
/* The symbol may already have been created with a preceding
".globl" directive -- be careful not to step on storage class
in that case. Otherwise, set it to static. */
if (S_GET_STORAGE_CLASS (symbolP) != C_EXT)
S_SET_STORAGE_CLASS (symbolP, C_STAT);
#endif /* OBJ_COFF */
subseg_set (current_seg, current_subseg);
}
offsetT
parse_align (int align_bytes)
{
expressionS exp;
addressT align;
SKIP_WHITESPACE ();
if (*input_line_pointer != ',')
{
no_align:
as_bad (_("expected alignment after size"));
ignore_rest_of_line ();
return -1;
}
input_line_pointer++;
SKIP_WHITESPACE ();
align = get_absolute_expr (&exp);
if (exp.X_op == O_absent)
goto no_align;
if (!exp.X_unsigned)
{
as_warn (_("alignment negative; 0 assumed"));
align = 0;
}
if (align_bytes && align != 0)
{
/* convert to a power of 2 alignment */
unsigned int alignp2 = 0;
while ((align & 1) == 0)
align >>= 1, ++alignp2;
if (align != 1)
{
as_bad (_("alignment not a power of 2"));
ignore_rest_of_line ();
return -1;
}
align = alignp2;
}
return align;
}
/* Called from s_comm_internal after symbol name and size have been
parsed. NEEDS_ALIGN is 0 if it was an ".lcomm" (2 args only),
1 if this was a ".bss" directive which has a 3rd argument
(alignment as a power of 2), or 2 if this was a ".bss" directive
with alignment in bytes. */
symbolS *
s_lcomm_internal (int needs_align, symbolS *symbolP, addressT size)
{
addressT align = 0;
if (needs_align)
{
align = parse_align (needs_align - 1);
if (align == (addressT) -1)
return NULL;
}
else
/* Assume some objects may require alignment on some systems. */
TC_IMPLICIT_LCOMM_ALIGNMENT (size, align);
bss_alloc (symbolP, size, align);
return symbolP;
}
void
s_lcomm (int needs_align)
{
s_comm_internal (needs_align, s_lcomm_internal);
}
void
s_lcomm_bytes (int needs_align)
{
s_comm_internal (needs_align * 2, s_lcomm_internal);
}
void
s_lsym (int ignore ATTRIBUTE_UNUSED)
{
char *name;
expressionS exp;
symbolS *symbolP;
/* We permit ANY defined expression: BSD4.2 demands constants. */
if ((name = read_symbol_name ()) == NULL)
return;
if (*input_line_pointer != ',')
{
as_bad (_("expected comma after \"%s\""), name);
goto err_out;
}
input_line_pointer++;
expression_and_evaluate (&exp);
if (exp.X_op != O_constant
&& exp.X_op != O_register)
{
as_bad (_("bad expression"));
goto err_out;
}
symbolP = symbol_find_or_make (name);
if (S_GET_SEGMENT (symbolP) == undefined_section)
{
/* The name might be an undefined .global symbol; be sure to
keep the "external" bit. */
S_SET_SEGMENT (symbolP,
(exp.X_op == O_constant
? absolute_section
: reg_section));
S_SET_VALUE (symbolP, (valueT) exp.X_add_number);
}
else
{
as_bad (_("symbol `%s' is already defined"), name);
}
demand_empty_rest_of_line ();
free (name);
return;
err_out:
ignore_rest_of_line ();
free (name);
return;
}
/* Read a line into an sb. Returns the character that ended the line
or zero if there are no more lines. */
static int
get_line_sb (sb *line, int in_macro)
{
char *eol;
if (input_line_pointer[-1] == '\n')
bump_line_counters ();
if (input_line_pointer >= buffer_limit)
{
buffer_limit = input_scrub_next_buffer (&input_line_pointer);
if (buffer_limit == 0)
return 0;
}
eol = _find_end_of_line (input_line_pointer, flag_m68k_mri, 0, in_macro);
sb_add_buffer (line, input_line_pointer, eol - input_line_pointer);
input_line_pointer = eol;
/* Don't skip multiple end-of-line characters, because that breaks support
for the IA-64 stop bit (;;) which looks like two consecutive end-of-line
characters but isn't. Instead just skip one end of line character and
return the character skipped so that the caller can re-insert it if
necessary. */
return *input_line_pointer++;
}
static size_t
get_non_macro_line_sb (sb *line)
{
return get_line_sb (line, 0);
}
static size_t
get_macro_line_sb (sb *line)
{
return get_line_sb (line, 1);
}
/* Define a macro. This is an interface to macro.c. */
void
s_macro (int ignore ATTRIBUTE_UNUSED)
{
char *eol;
const char * file;
unsigned int line;
sb s;
const char *err;
const char *name;
file = as_where (&line);
eol = find_end_of_line (input_line_pointer, 0);
sb_build (&s, eol - input_line_pointer);
sb_add_buffer (&s, input_line_pointer, eol - input_line_pointer);
input_line_pointer = eol;
if (line_label != NULL)
{
sb label;
size_t len;
name = S_GET_NAME (line_label);
len = strlen (name);
sb_build (&label, len);
sb_add_buffer (&label, name, len);
err = define_macro (0, &s, &label, get_macro_line_sb, file, line, &name);
sb_kill (&label);
}
else
err = define_macro (0, &s, NULL, get_macro_line_sb, file, line, &name);
if (err != NULL)
as_bad_where (file, line, err, name);
else
{
if (line_label != NULL)
{
S_SET_SEGMENT (line_label, absolute_section);
S_SET_VALUE (line_label, 0);
symbol_set_frag (line_label, &zero_address_frag);
}
if (((NO_PSEUDO_DOT || flag_m68k_mri)
&& po_entry_find (po_hash, name) != NULL)
|| (!flag_m68k_mri
&& *name == '.'
&& po_entry_find (po_hash, name + 1) != NULL))
as_warn_where (file,
line,
_("attempt to redefine pseudo-op `%s' ignored"),
name);
}
sb_kill (&s);
}
/* Handle the .mexit pseudo-op, which immediately exits a macro
expansion. */
void
s_mexit (int ignore ATTRIBUTE_UNUSED)
{
if (macro_nest)
{
cond_exit_macro (macro_nest);
buffer_limit = input_scrub_next_buffer (&input_line_pointer);
}
else
as_warn (_("ignoring macro exit outside a macro definition."));
}
/* Switch in and out of MRI mode. */
void
s_mri (int ignore ATTRIBUTE_UNUSED)
{
int on;
#ifdef MRI_MODE_CHANGE
int old_flag;
#endif
on = get_absolute_expression ();
#ifdef MRI_MODE_CHANGE
old_flag = flag_mri;
#endif
if (on != 0)
{
flag_mri = 1;
#ifdef TC_M68K
flag_m68k_mri = 1;
#endif
macro_mri_mode (1);
}
else
{
flag_mri = 0;
#ifdef TC_M68K
flag_m68k_mri = 0;
#endif
macro_mri_mode (0);
}
/* Operator precedence changes in m68k MRI mode, so we need to
update the operator rankings. */
expr_set_precedence ();
#ifdef MRI_MODE_CHANGE
if (on != old_flag)
MRI_MODE_CHANGE (on);
#endif
demand_empty_rest_of_line ();
}
/* Handle changing the location counter. */
static void
do_org (segT segment, expressionS *exp, int fill)
{
if (segment != now_seg
&& segment != absolute_section
&& segment != expr_section)
as_bad (_("invalid segment \"%s\""), segment_name (segment));
if (now_seg == absolute_section)
{
if (fill != 0)
as_warn (_("ignoring fill value in absolute section"));
if (exp->X_op != O_constant)
{
as_bad (_("only constant offsets supported in absolute section"));
exp->X_add_number = 0;
}
abs_section_offset = exp->X_add_number;
}
else
{
char *p;
symbolS *sym = exp->X_add_symbol;
offsetT off = exp->X_add_number * OCTETS_PER_BYTE;
if (fill && in_bss ())
as_warn (_("ignoring fill value in section `%s'"),
segment_name (now_seg));
if (exp->X_op != O_constant && exp->X_op != O_symbol)
{
/* Handle complex expressions. */
sym = make_expr_symbol (exp);
off = 0;
}
p = frag_var (rs_org, 1, 1, (relax_substateT) 0, sym, off, (char *) 0);
*p = fill;
}
}
void
s_org (int ignore ATTRIBUTE_UNUSED)
{
segT segment;
expressionS exp;
long temp_fill;
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
/* The m68k MRI assembler has a different meaning for .org. It
means to create an absolute section at a given address. We can't
support that--use a linker script instead. */
if (flag_m68k_mri)
{
as_bad (_("MRI style ORG pseudo-op not supported"));
ignore_rest_of_line ();
return;
}
/* Don't believe the documentation of BSD 4.2 AS. There is no such
thing as a sub-segment-relative origin. Any absolute origin is
given a warning, then assumed to be segment-relative. Any
segmented origin expression ("foo+42") had better be in the right
segment or the .org is ignored.
BSD 4.2 AS warns if you try to .org backwards. We cannot because
we never know sub-segment sizes when we are reading code. BSD
will crash trying to emit negative numbers of filler bytes in
certain .orgs. We don't crash, but see as-write for that code.
Don't make frag if need_pass_2==1. */
segment = get_known_segmented_expression (&exp);
if (*input_line_pointer == ',')
{
input_line_pointer++;
temp_fill = get_absolute_expression ();
}
else
temp_fill = 0;
if (!need_pass_2)
do_org (segment, &exp, temp_fill);
demand_empty_rest_of_line ();
}
/* Handle parsing for the MRI SECT/SECTION pseudo-op. This should be
called by the obj-format routine which handles section changing
when in MRI mode. It will create a new section, and return it. It
will set *TYPE to the section type: one of 'C' (code), 'D' (data),
'M' (mixed), or 'R' (romable). The flags will be set in the section. */
void
s_mri_sect (char *type ATTRIBUTE_UNUSED)
{
#ifdef TC_M68K
char *name;
char c;
segT seg;
SKIP_WHITESPACE ();
name = input_line_pointer;
if (!ISDIGIT (*name))
c = get_symbol_name (& name);
else
{
do
{
++input_line_pointer;
}
while (ISDIGIT (*input_line_pointer));
c = *input_line_pointer;
*input_line_pointer = '\0';
}
name = xstrdup (name);
c = restore_line_pointer (c);
seg = subseg_new (name, 0);
if (c == ',')
{
unsigned int align;
++input_line_pointer;
align = get_absolute_expression ();
record_alignment (seg, align);
}
*type = 'C';
if (*input_line_pointer == ',')
{
c = *++input_line_pointer;
c = TOUPPER (c);
if (c == 'C' || c == 'D' || c == 'M' || c == 'R')
*type = c;
else
as_bad (_("unrecognized section type"));
++input_line_pointer;
{
flagword flags;
flags = SEC_NO_FLAGS;
if (*type == 'C')
flags = SEC_ALLOC | SEC_LOAD | SEC_READONLY | SEC_CODE;
else if (*type == 'D' || *type == 'M')
flags = SEC_ALLOC | SEC_LOAD | SEC_DATA;
else if (*type == 'R')
flags = SEC_ALLOC | SEC_LOAD | SEC_DATA | SEC_READONLY | SEC_ROM;
if (flags != SEC_NO_FLAGS)
{
if (!bfd_set_section_flags (seg, flags))
as_warn (_("error setting flags for \"%s\": %s"),
bfd_section_name (seg),
bfd_errmsg (bfd_get_error ()));
}
}
}
/* Ignore the HP type. */
if (*input_line_pointer == ',')
input_line_pointer += 2;
demand_empty_rest_of_line ();
#else /* ! TC_M68K */
/* The MRI assembler seems to use different forms of .sect for
different targets. */
as_bad ("MRI mode not supported for this target");
ignore_rest_of_line ();
#endif /* ! TC_M68K */
}
/* Handle the .print pseudo-op. */
void
s_print (int ignore ATTRIBUTE_UNUSED)
{
char *s;
int len;
s = demand_copy_C_string (&len);
if (s != NULL)
printf ("%s\n", s);
demand_empty_rest_of_line ();
}
/* Handle the .purgem pseudo-op. */
void
s_purgem (int ignore ATTRIBUTE_UNUSED)
{
if (is_it_end_of_statement ())
{
demand_empty_rest_of_line ();
return;
}
do
{
char *name;
char c;
SKIP_WHITESPACE ();
c = get_symbol_name (& name);
delete_macro (name);
*input_line_pointer = c;
SKIP_WHITESPACE_AFTER_NAME ();
}
while (*input_line_pointer++ == ',');
--input_line_pointer;
demand_empty_rest_of_line ();
}
/* Handle the .endm/.endr pseudo-ops. */
static void
s_bad_end (int endr)
{
as_warn (_(".end%c encountered without preceding %s"),
endr ? 'r' : 'm',
endr ? ".rept, .irp, or .irpc" : ".macro");
demand_empty_rest_of_line ();
}
/* Handle the .rept pseudo-op. */
void
s_rept (int ignore ATTRIBUTE_UNUSED)
{
size_t count;
count = (size_t) get_absolute_expression ();
do_repeat (count, "REPT", "ENDR");
}
/* This function provides a generic repeat block implementation. It allows
different directives to be used as the start/end keys. */
void
do_repeat (size_t count, const char *start, const char *end)
{
sb one;
sb many;
if (((ssize_t) count) < 0)
{
as_bad (_("negative count for %s - ignored"), start);
count = 0;
}
sb_new (&one);
if (!buffer_and_nest (start, end, &one, get_non_macro_line_sb))
{
as_bad (_("%s without %s"), start, end);
return;
}
sb_build (&many, count * one.len);
while (count-- > 0)
sb_add_sb (&many, &one);
sb_kill (&one);
input_scrub_include_sb (&many, input_line_pointer, 1);
sb_kill (&many);
buffer_limit = input_scrub_next_buffer (&input_line_pointer);
}
/* Like do_repeat except that any text matching EXPANDER in the
block is replaced by the iteration count. */
void
do_repeat_with_expander (size_t count,
const char * start,
const char * end,
const char * expander)
{
sb one;
sb many;
if (((ssize_t) count) < 0)
{
as_bad (_("negative count for %s - ignored"), start);
count = 0;
}
sb_new (&one);
if (!buffer_and_nest (start, end, &one, get_non_macro_line_sb))
{
as_bad (_("%s without %s"), start, end);
return;
}
sb_new (&many);
if (expander != NULL && strstr (one.ptr, expander) != NULL)
{
while (count -- > 0)
{
int len;
char * sub;
sb processed;
sb_build (& processed, one.len);
sb_add_sb (& processed, & one);
sub = strstr (processed.ptr, expander);
len = sprintf (sub, "%lu", (unsigned long) count);
gas_assert (len < 8);
memmove (sub + len, sub + 8,
processed.ptr + processed.len - (sub + 8));
processed.len -= (8 - len);
sb_add_sb (& many, & processed);
sb_kill (& processed);
}
}
else
while (count-- > 0)
sb_add_sb (&many, &one);
sb_kill (&one);
input_scrub_include_sb (&many, input_line_pointer, 1);
sb_kill (&many);
buffer_limit = input_scrub_next_buffer (&input_line_pointer);
}
/* Skip to end of current repeat loop; EXTRA indicates how many additional
input buffers to skip. Assumes that conditionals preceding the loop end
are properly nested.
This function makes it easier to implement a premature "break" out of the
loop. The EXTRA arg accounts for other buffers we might have inserted,
such as line substitutions. */
void
end_repeat (int extra)
{
cond_exit_macro (macro_nest);
while (extra-- >= 0)
buffer_limit = input_scrub_next_buffer (&input_line_pointer);
}
static void
assign_symbol (char *name, int mode)
{
symbolS *symbolP;
if (name[0] == '.' && name[1] == '\0')
{
/* Turn '. = mumble' into a .org mumble. */
segT segment;
expressionS exp;
segment = get_known_segmented_expression (&exp);
if (!need_pass_2)
do_org (segment, &exp, 0);
return;
}
if ((symbolP = symbol_find (name)) == NULL
&& (symbolP = md_undefined_symbol (name)) == NULL)
{
symbolP = symbol_find_or_make (name);
#ifndef NO_LISTING
/* When doing symbol listings, play games with dummy fragments living
outside the normal fragment chain to record the file and line info
for this symbol. */
if (listing & LISTING_SYMBOLS)
{
extern struct list_info_struct *listing_tail;
fragS *dummy_frag = XCNEW (fragS);
dummy_frag->line = listing_tail;
dummy_frag->fr_symbol = symbolP;
symbol_set_frag (symbolP, dummy_frag);
}
#endif
#if defined (OBJ_COFF) && !defined (TE_PE)
/* "set" symbols are local unless otherwise specified. */
SF_SET_LOCAL (symbolP);
#endif
}
if (S_IS_DEFINED (symbolP) || symbol_equated_p (symbolP))
{
if ((mode != 0 || !S_IS_VOLATILE (symbolP))
&& !S_CAN_BE_REDEFINED (symbolP))
{
as_bad (_("symbol `%s' is already defined"), name);
ignore_rest_of_line ();
input_line_pointer--;
return;
}
/* If the symbol is volatile, copy the symbol and replace the
original with the copy, so that previous uses of the symbol will
retain the value of the symbol at the point of use. */
else if (S_IS_VOLATILE (symbolP))
symbolP = symbol_clone (symbolP, 1);
}
if (mode == 0)
S_SET_VOLATILE (symbolP);
else if (mode < 0)
S_SET_FORWARD_REF (symbolP);
pseudo_set (symbolP);
}
/* Handle the .equ, .equiv, .eqv, and .set directives. If EQUIV is 1,
then this is .equiv, and it is an error if the symbol is already
defined. If EQUIV is -1, the symbol additionally is a forward
reference. */
void
s_set (int equiv)
{
char *name;
/* Especial apologies for the random logic:
this just grew, and could be parsed much more simply!
Dean in haste. */
if ((name = read_symbol_name ()) == NULL)
return;
if (*input_line_pointer != ',')
{
as_bad (_("expected comma after \"%s\""), name);
ignore_rest_of_line ();
free (name);
return;
}
input_line_pointer++;
assign_symbol (name, equiv);
demand_empty_rest_of_line ();
free (name);
}
void
s_space (int mult)
{
expressionS exp;
expressionS val;
char *p = 0;
char *stop = NULL;
char stopc = 0;
int bytes;
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
#ifdef md_cons_align
md_cons_align (1);
#endif
if (flag_mri)
stop = mri_comment_field (&stopc);
/* In m68k MRI mode, we need to align to a word boundary, unless
this is ds.b. */
if (flag_m68k_mri && mult > 1)
{
if (now_seg == absolute_section)
{
abs_section_offset += abs_section_offset & 1;
if (line_label != NULL)
S_SET_VALUE (line_label, abs_section_offset);
}
else if (mri_common_symbol != NULL)
{
valueT mri_val;
mri_val = S_GET_VALUE (mri_common_symbol);
if ((mri_val & 1) != 0)
{
S_SET_VALUE (mri_common_symbol, mri_val + 1);
if (line_label != NULL)
{
expressionS *symexp;
symexp = symbol_get_value_expression (line_label);
know (symexp->X_op == O_symbol);
know (symexp->X_add_symbol == mri_common_symbol);
symexp->X_add_number += 1;
}
}
}
else
{
do_align (1, (char *) NULL, 0, 0);
if (line_label != NULL)
{
symbol_set_frag (line_label, frag_now);
S_SET_VALUE (line_label, frag_now_fix ());
}
}
}
bytes = mult;
expression (&exp);
SKIP_WHITESPACE ();
if (*input_line_pointer == ',')
{
++input_line_pointer;
expression (&val);
}
else
{
val.X_op = O_constant;
val.X_add_number = 0;
}
if ((val.X_op != O_constant
|| val.X_add_number < - 0x80
|| val.X_add_number > 0xff
|| (mult != 0 && mult != 1 && val.X_add_number != 0))
&& (now_seg != absolute_section && !in_bss ()))
{
resolve_expression (&exp);
if (exp.X_op != O_constant)
as_bad (_("unsupported variable size or fill value"));
else
{
offsetT i;
/* PR 20901: Check for excessive values.
FIXME: 1<<10 is an arbitrary limit. Maybe use maxpagesize instead ? */
if (exp.X_add_number < 0 || exp.X_add_number > (1 << 10))
as_bad (_("size value for space directive too large: %lx"),
(long) exp.X_add_number);
else
{
if (mult == 0)
mult = 1;
bytes = mult * exp.X_add_number;
for (i = 0; i < exp.X_add_number; i++)
emit_expr (&val, mult);
}
}
}
else
{
if (now_seg == absolute_section || mri_common_symbol != NULL)
resolve_expression (&exp);
if (exp.X_op == O_constant)
{
offsetT repeat;
repeat = exp.X_add_number;
if (mult)
repeat *= mult;
bytes = repeat;
if (repeat <= 0)
{
if (!flag_mri)
as_warn (_(".space repeat count is zero, ignored"));
else if (repeat < 0)
as_warn (_(".space repeat count is negative, ignored"));
goto getout;
}
/* If we are in the absolute section, just bump the offset. */
if (now_seg == absolute_section)
{
if (val.X_op != O_constant || val.X_add_number != 0)
as_warn (_("ignoring fill value in absolute section"));
abs_section_offset += repeat;
goto getout;
}
/* If we are secretly in an MRI common section, then
creating space just increases the size of the common
symbol. */
if (mri_common_symbol != NULL)
{
S_SET_VALUE (mri_common_symbol,
S_GET_VALUE (mri_common_symbol) + repeat);
goto getout;
}
if (!need_pass_2)
p = frag_var (rs_fill, 1, 1, (relax_substateT) 0, (symbolS *) 0,
(offsetT) repeat, (char *) 0);
}
else
{
if (now_seg == absolute_section)
{
as_bad (_("space allocation too complex in absolute section"));
subseg_set (text_section, 0);
}
if (mri_common_symbol != NULL)
{
as_bad (_("space allocation too complex in common section"));
mri_common_symbol = NULL;
}
if (!need_pass_2)
p = frag_var (rs_space, 1, 1, (relax_substateT) 0,
make_expr_symbol (&exp), (offsetT) 0, (char *) 0);
}
if ((val.X_op != O_constant || val.X_add_number != 0) && in_bss ())
as_warn (_("ignoring fill value in section `%s'"),
segment_name (now_seg));
else if (p)
*p = val.X_add_number;
}
getout:
/* In MRI mode, after an odd number of bytes, we must align to an
even word boundary, unless the next instruction is a dc.b, ds.b
or dcb.b. */
if (flag_mri && (bytes & 1) != 0)
mri_pending_align = 1;
demand_empty_rest_of_line ();
if (flag_mri)
mri_comment_end (stop, stopc);
}
void
s_nop (int ignore ATTRIBUTE_UNUSED)
{
expressionS exp;
fragS *start;
addressT start_off;
offsetT frag_off;
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
#ifdef md_cons_align
md_cons_align (1);
#endif
SKIP_WHITESPACE ();
expression (&exp);
demand_empty_rest_of_line ();
start = frag_now;
start_off = frag_now_fix ();
do
{
#ifdef md_emit_single_noop
md_emit_single_noop;
#else
char *nop;
#ifndef md_single_noop_insn
#define md_single_noop_insn "nop"
#endif
/* md_assemble might modify its argument, so
we must pass it a string that is writable. */
if (asprintf (&nop, "%s", md_single_noop_insn) < 0)
as_fatal ("%s", xstrerror (errno));
/* Some targets assume that they can update input_line_pointer
inside md_assemble, and, worse, that they can leave it
assigned to the string pointer that was provided as an
argument. So preserve ilp here. */
char *saved_ilp = input_line_pointer;
md_assemble (nop);
input_line_pointer = saved_ilp;
free (nop);
#endif
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
} while (exp.X_op == O_constant
&& exp.X_add_number > 0
&& frag_offset_ignore_align_p (start, frag_now, &frag_off)
&& frag_off + frag_now_fix () < start_off + exp.X_add_number);
}
void
s_nops (int ignore ATTRIBUTE_UNUSED)
{
expressionS exp;
expressionS val;
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
#ifdef md_cons_align
md_cons_align (1);
#endif
SKIP_WHITESPACE ();
expression (&exp);
/* Note - this expression is tested for an absolute value in
write.c:relax_segment(). */
SKIP_WHITESPACE ();
if (*input_line_pointer == ',')
{
++input_line_pointer;
expression (&val);
}
else
{
val.X_op = O_constant;
val.X_add_number = 0;
}
if (val.X_op != O_constant)
{
as_bad (_("unsupported variable nop control in .nops directive"));
val.X_op = O_constant;
val.X_add_number = 0;
}
else if (val.X_add_number < 0)
{
as_warn (_("negative nop control byte, ignored"));
val.X_add_number = 0;
}
demand_empty_rest_of_line ();
if (need_pass_2)
/* Ignore this directive if we are going to perform a second pass. */
return;
/* Store the no-op instruction control byte in the first byte of frag. */
char *p;
symbolS *sym = make_expr_symbol (&exp);
p = frag_var (rs_space_nop, 1, 1, (relax_substateT) 0,
sym, (offsetT) 0, (char *) 0);
*p = val.X_add_number;
}
static int
parse_one_float (int float_type, char temp[MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT])
{
int length;
SKIP_WHITESPACE ();
/* Skip any 0{letter} that may be present. Don't even check if the
letter is legal. Someone may invent a "z" format and this routine
has no use for such information. Lusers beware: you get
diagnostics if your input is ill-conditioned. */
if (input_line_pointer[0] == '0'
&& ISALPHA (input_line_pointer[1]))
input_line_pointer += 2;
/* Accept :xxxx, where the x's are hex digits, for a floating point
with the exact digits specified. */
if (input_line_pointer[0] == ':')
{
++input_line_pointer;
length = hex_float (float_type, temp);
if (length < 0)
{
ignore_rest_of_line ();
return length;
}
}
else
{
const char *err;
err = md_atof (float_type, temp, &length);
know (length <= MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT);
know (err != NULL || length > 0);
if (err)
{
as_bad (_("bad floating literal: %s"), err);
ignore_rest_of_line ();
return -1;
}
}
return length;
}
/* This is like s_space, but the value is a floating point number with
the given precision. This is for the MRI dcb.s pseudo-op and
friends. */
void
s_float_space (int float_type)
{
offsetT count;
int flen;
char temp[MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT];
char *stop = NULL;
char stopc = 0;
#ifdef md_cons_align
md_cons_align (1);
#endif
if (flag_mri)
stop = mri_comment_field (&stopc);
count = get_absolute_expression ();
SKIP_WHITESPACE ();
if (*input_line_pointer != ',')
{
as_bad (_("missing value"));
ignore_rest_of_line ();
if (flag_mri)
mri_comment_end (stop, stopc);
return;
}
++input_line_pointer;
flen = parse_one_float (float_type, temp);
if (flen < 0)
{
if (flag_mri)
mri_comment_end (stop, stopc);
return;
}
while (--count >= 0)
{
char *p;
p = frag_more (flen);
memcpy (p, temp, (unsigned int) flen);
}
demand_empty_rest_of_line ();
if (flag_mri)
mri_comment_end (stop, stopc);
}
/* Handle the .struct pseudo-op, as found in MIPS assemblers. */
void
s_struct (int ignore ATTRIBUTE_UNUSED)
{
char *stop = NULL;
char stopc = 0;
if (flag_mri)
stop = mri_comment_field (&stopc);
abs_section_offset = get_absolute_expression ();
#if defined (OBJ_ELF) || defined (OBJ_MAYBE_ELF)
/* The ELF backend needs to know that we are changing sections, so
that .previous works correctly. */
if (IS_ELF)
obj_elf_section_change_hook ();
#endif
subseg_set (absolute_section, 0);
demand_empty_rest_of_line ();
if (flag_mri)
mri_comment_end (stop, stopc);
}
void
s_text (int ignore ATTRIBUTE_UNUSED)
{
int temp;
temp = get_absolute_expression ();
subseg_set (text_section, (subsegT) temp);
demand_empty_rest_of_line ();
}
/* .weakref x, y sets x as an alias to y that, as long as y is not
referenced directly, will cause y to become a weak symbol. */
void
s_weakref (int ignore ATTRIBUTE_UNUSED)
{
char *name;
symbolS *symbolP;
symbolS *symbolP2;
expressionS exp;
if ((name = read_symbol_name ()) == NULL)
return;
symbolP = symbol_find_or_make (name);
if (S_IS_DEFINED (symbolP) || symbol_equated_p (symbolP))
{
if (!S_IS_VOLATILE (symbolP))
{
as_bad (_("symbol `%s' is already defined"), name);
goto err_out;
}
symbolP = symbol_clone (symbolP, 1);
S_CLEAR_VOLATILE (symbolP);
}
SKIP_WHITESPACE ();
if (*input_line_pointer != ',')
{
as_bad (_("expected comma after \"%s\""), name);
goto err_out;
}
input_line_pointer++;
SKIP_WHITESPACE ();
free (name);
if ((name = read_symbol_name ()) == NULL)
return;
if ((symbolP2 = symbol_find_noref (name, 1)) == NULL
&& (symbolP2 = md_undefined_symbol (name)) == NULL)
{
symbolP2 = symbol_find_or_make (name);
S_SET_WEAKREFD (symbolP2);
}
else
{
symbolS *symp = symbolP2;
while (S_IS_WEAKREFR (symp) && symp != symbolP)
{
expressionS *expP = symbol_get_value_expression (symp);
gas_assert (expP->X_op == O_symbol
&& expP->X_add_number == 0);
symp = expP->X_add_symbol;
}
if (symp == symbolP)
{
char *loop;
loop = concat (S_GET_NAME (symbolP),
" => ", S_GET_NAME (symbolP2), (const char *) NULL);
symp = symbolP2;
while (symp != symbolP)
{
char *old_loop = loop;
symp = symbol_get_value_expression (symp)->X_add_symbol;
loop = concat (loop, " => ", S_GET_NAME (symp),
(const char *) NULL);
free (old_loop);
}
as_bad (_("%s: would close weakref loop: %s"),
S_GET_NAME (symbolP), loop);
free (loop);
free (name);
ignore_rest_of_line ();
return;
}
/* Short-circuiting instead of just checking here might speed
things up a tiny little bit, but loop error messages would
miss intermediate links. */
/* symbolP2 = symp; */
}
memset (&exp, 0, sizeof (exp));
exp.X_op = O_symbol;
exp.X_add_symbol = symbolP2;
S_SET_SEGMENT (symbolP, undefined_section);
symbol_set_value_expression (symbolP, &exp);
symbol_set_frag (symbolP, &zero_address_frag);
S_SET_WEAKREFR (symbolP);
demand_empty_rest_of_line ();
free (name);
return;
err_out:
ignore_rest_of_line ();
free (name);
return;
}
/* Verify that we are at the end of a line. If not, issue an error and
skip to EOL. */
void
demand_empty_rest_of_line (void)
{
SKIP_WHITESPACE ();
if (is_end_of_line[(unsigned char) *input_line_pointer])
input_line_pointer++;
else
{
if (ISPRINT (*input_line_pointer))
as_bad (_("junk at end of line, first unrecognized character is `%c'"),
*input_line_pointer);
else
as_bad (_("junk at end of line, first unrecognized character valued 0x%x"),
*input_line_pointer);
ignore_rest_of_line ();
}
/* Return pointing just after end-of-line. */
know (is_end_of_line[(unsigned char) input_line_pointer[-1]]);
}
/* Silently advance to the end of line. Use this after already having
issued an error about something bad. */
void
ignore_rest_of_line (void)
{
while (input_line_pointer < buffer_limit
&& !is_end_of_line[(unsigned char) *input_line_pointer])
input_line_pointer++;
input_line_pointer++;
/* Return pointing just after end-of-line. */
if (input_line_pointer <= buffer_limit)
know (is_end_of_line[(unsigned char) input_line_pointer[-1]]);
}
/* Sets frag for given symbol to zero_address_frag, except when the
symbol frag is already set to a dummy listing frag. */
static void
set_zero_frag (symbolS *symbolP)
{
if (symbol_get_frag (symbolP)->fr_type != rs_dummy)
symbol_set_frag (symbolP, &zero_address_frag);
}
/* In: Pointer to a symbol.
Input_line_pointer->expression.
Out: Input_line_pointer->just after any whitespace after expression.
Tried to set symbol to value of expression.
Will change symbols type, value, and frag; */
void
pseudo_set (symbolS *symbolP)
{
expressionS exp;
segT seg;
know (symbolP); /* NULL pointer is logic error. */
if (!S_IS_FORWARD_REF (symbolP))
(void) expression (&exp);
else
(void) deferred_expression (&exp);
if (exp.X_op == O_illegal)
as_bad (_("illegal expression"));
else if (exp.X_op == O_absent)
as_bad (_("missing expression"));
else if (exp.X_op == O_big)
{
if (exp.X_add_number > 0)
as_bad (_("bignum invalid"));
else
as_bad (_("floating point number invalid"));
}
else if (exp.X_op == O_subtract
&& !S_IS_FORWARD_REF (symbolP)
&& SEG_NORMAL (S_GET_SEGMENT (exp.X_add_symbol))
&& (symbol_get_frag (exp.X_add_symbol)
== symbol_get_frag (exp.X_op_symbol)))
{
exp.X_op = O_constant;
exp.X_add_number = (S_GET_VALUE (exp.X_add_symbol)
- S_GET_VALUE (exp.X_op_symbol));
}
if (symbol_section_p (symbolP))
{
as_bad ("attempt to set value of section symbol");
return;
}
switch (exp.X_op)
{
case O_illegal:
case O_absent:
case O_big:
exp.X_add_number = 0;
/* Fall through. */
case O_constant:
S_SET_SEGMENT (symbolP, absolute_section);
S_SET_VALUE (symbolP, (valueT) exp.X_add_number);
set_zero_frag (symbolP);
break;
case O_register:
#ifndef TC_GLOBAL_REGISTER_SYMBOL_OK
if (S_IS_EXTERNAL (symbolP))
{
as_bad ("can't equate global symbol `%s' with register name",
S_GET_NAME (symbolP));
return;
}
#endif
S_SET_SEGMENT (symbolP, reg_section);
S_SET_VALUE (symbolP, (valueT) exp.X_add_number);
set_zero_frag (symbolP);
symbol_get_value_expression (symbolP)->X_op = O_register;
break;
case O_symbol:
seg = S_GET_SEGMENT (exp.X_add_symbol);
/* For x=undef+const, create an expression symbol.
For x=x+const, just update x except when x is an undefined symbol
For x=defined+const, evaluate x. */
if (symbolP == exp.X_add_symbol
&& (seg != undefined_section
|| !symbol_constant_p (symbolP)))
{
*symbol_X_add_number (symbolP) += exp.X_add_number;
break;
}
else if (!S_IS_FORWARD_REF (symbolP) && seg != undefined_section)
{
symbolS *s = exp.X_add_symbol;
if (S_IS_COMMON (s))
as_bad (_("`%s' can't be equated to common symbol `%s'"),
S_GET_NAME (symbolP), S_GET_NAME (s));
S_SET_SEGMENT (symbolP, seg);
S_SET_VALUE (symbolP, exp.X_add_number + S_GET_VALUE (s));
symbol_set_frag (symbolP, symbol_get_frag (s));
copy_symbol_attributes (symbolP, s);
break;
}
S_SET_SEGMENT (symbolP, undefined_section);
symbol_set_value_expression (symbolP, &exp);
copy_symbol_attributes (symbolP, exp.X_add_symbol);
set_zero_frag (symbolP);
break;
default:
/* The value is some complex expression. */
S_SET_SEGMENT (symbolP, expr_section);
symbol_set_value_expression (symbolP, &exp);
set_zero_frag (symbolP);
break;
}
}
/* cons()
CONStruct more frag of .bytes, or .words etc.
Should need_pass_2 be 1 then emit no frag(s).
This understands EXPRESSIONS.
Bug (?)
This has a split personality. We use expression() to read the
value. We can detect if the value won't fit in a byte or word.
But we can't detect if expression() discarded significant digits
in the case of a long. Not worth the crocks required to fix it. */
/* Select a parser for cons expressions. */
/* Some targets need to parse the expression in various fancy ways.
You can define TC_PARSE_CONS_EXPRESSION to do whatever you like
(for example, the HPPA does this). Otherwise, you can define
REPEAT_CONS_EXPRESSIONS to permit repeat counts. If none of these
are defined, which is the normal case, then only simple expressions
are permitted. */
#ifdef TC_M68K
static void
parse_mri_cons (expressionS *exp, unsigned int nbytes);
#endif
#ifndef TC_PARSE_CONS_EXPRESSION
#ifdef REPEAT_CONS_EXPRESSIONS
#define TC_PARSE_CONS_EXPRESSION(EXP, NBYTES) \
(parse_repeat_cons (EXP, NBYTES), TC_PARSE_CONS_RETURN_NONE)
static void
parse_repeat_cons (expressionS *exp, unsigned int nbytes);
#endif
/* If we haven't gotten one yet, just call expression. */
#ifndef TC_PARSE_CONS_EXPRESSION
#define TC_PARSE_CONS_EXPRESSION(EXP, NBYTES) \
(expression (EXP), TC_PARSE_CONS_RETURN_NONE)
#endif
#endif
void
do_parse_cons_expression (expressionS *exp,
int nbytes ATTRIBUTE_UNUSED)
{
(void) TC_PARSE_CONS_EXPRESSION (exp, nbytes);
}
/* Worker to do .byte etc statements.
Clobbers input_line_pointer and checks end-of-line. */
static void
cons_worker (int nbytes, /* 1=.byte, 2=.word, 4=.long. */
int rva)
{
int c;
expressionS exp;
char *stop = NULL;
char stopc = 0;
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
if (flag_mri)
stop = mri_comment_field (&stopc);
if (is_it_end_of_statement ())
{
demand_empty_rest_of_line ();
if (flag_mri)
mri_comment_end (stop, stopc);
return;
}
if (nbytes == 0)
nbytes = TC_ADDRESS_BYTES ();
#ifdef md_cons_align
md_cons_align (nbytes);
#endif
c = 0;
do
{
TC_PARSE_CONS_RETURN_TYPE ret = TC_PARSE_CONS_RETURN_NONE;
#ifdef TC_CONS_FIX_CHECK
fixS **cur_fix = &frchain_now->fix_tail;
if (*cur_fix != NULL)
cur_fix = &(*cur_fix)->fx_next;
#endif
#ifdef TC_M68K
if (flag_m68k_mri)
parse_mri_cons (&exp, (unsigned int) nbytes);
else
#endif
{
#if 0
if (*input_line_pointer == '"')
{
as_bad (_("unexpected `\"' in expression"));
ignore_rest_of_line ();
return;
}
#endif
ret = TC_PARSE_CONS_EXPRESSION (&exp, (unsigned int) nbytes);
}
if (rva)
{
if (exp.X_op == O_symbol)
exp.X_op = O_symbol_rva;
else
as_fatal (_("rva without symbol"));
}
emit_expr_with_reloc (&exp, (unsigned int) nbytes, ret);
#ifdef TC_CONS_FIX_CHECK
TC_CONS_FIX_CHECK (&exp, nbytes, *cur_fix);
#endif
++c;
}
while (*input_line_pointer++ == ',');
/* In MRI mode, after an odd number of bytes, we must align to an
even word boundary, unless the next instruction is a dc.b, ds.b
or dcb.b. */
if (flag_mri && nbytes == 1 && (c & 1) != 0)
mri_pending_align = 1;
input_line_pointer--; /* Put terminator back into stream. */
demand_empty_rest_of_line ();
if (flag_mri)
mri_comment_end (stop, stopc);
}
void
cons (int size)
{
cons_worker (size, 0);
}
void
s_rva (int size)
{
cons_worker (size, 1);
}
/* .reloc offset, reloc_name, symbol+addend. */
static void
s_reloc (int ignore ATTRIBUTE_UNUSED)
{
char *stop = NULL;
char stopc = 0;
expressionS exp;
char *r_name;
int c;
struct reloc_list *reloc;
struct _bfd_rel { const char * name; bfd_reloc_code_real_type code; };
static struct _bfd_rel bfd_relocs[] =
{
{ "NONE", BFD_RELOC_NONE },
{ "8", BFD_RELOC_8 },
{ "16", BFD_RELOC_16 },
{ "32", BFD_RELOC_32 },
{ "64", BFD_RELOC_64 }
};
reloc = XNEW (struct reloc_list);
if (flag_mri)
stop = mri_comment_field (&stopc);
expression (&exp);
switch (exp.X_op)
{
case O_illegal:
case O_absent:
case O_big:
case O_register:
as_bad (_("missing or bad offset expression"));
goto err_out;
case O_constant:
exp.X_add_symbol = section_symbol (now_seg);
/* Mark the section symbol used in relocation so that it will be
included in the symbol table. */
symbol_mark_used_in_reloc (exp.X_add_symbol);
exp.X_op = O_symbol;
/* Fallthru */
case O_symbol:
if (exp.X_add_number == 0)
{
reloc->u.a.offset_sym = exp.X_add_symbol;
break;
}
/* Fallthru */
default:
reloc->u.a.offset_sym = make_expr_symbol (&exp);
break;
}
SKIP_WHITESPACE ();
if (*input_line_pointer != ',')
{
as_bad (_("missing reloc type"));
goto err_out;
}
++input_line_pointer;
SKIP_WHITESPACE ();
c = get_symbol_name (& r_name);
if (strncasecmp (r_name, "BFD_RELOC_", 10) == 0)
{
unsigned int i;
for (reloc->u.a.howto = NULL, i = 0; i < ARRAY_SIZE (bfd_relocs); i++)
if (strcasecmp (r_name + 10, bfd_relocs[i].name) == 0)
{
reloc->u.a.howto = bfd_reloc_type_lookup (stdoutput,
bfd_relocs[i].code);
break;
}
}
else
reloc->u.a.howto = bfd_reloc_name_lookup (stdoutput, r_name);
*input_line_pointer = c;
if (reloc->u.a.howto == NULL)
{
as_bad (_("unrecognized reloc type"));
goto err_out;
}
exp.X_op = O_absent;
SKIP_WHITESPACE_AFTER_NAME ();
if (*input_line_pointer == ',')
{
++input_line_pointer;
expression (&exp);
}
switch (exp.X_op)
{
case O_illegal:
case O_big:
case O_register:
as_bad (_("bad reloc expression"));
err_out:
ignore_rest_of_line ();
free (reloc);
if (flag_mri)
mri_comment_end (stop, stopc);
return;
case O_absent:
reloc->u.a.sym = NULL;
reloc->u.a.addend = 0;
break;
case O_constant:
reloc->u.a.sym = NULL;
reloc->u.a.addend = exp.X_add_number;
break;
case O_symbol:
reloc->u.a.sym = exp.X_add_symbol;
reloc->u.a.addend = exp.X_add_number;
break;
default:
reloc->u.a.sym = make_expr_symbol (&exp);
reloc->u.a.addend = 0;
break;
}
reloc->file = as_where (&reloc->line);
reloc->next = reloc_list;
reloc_list = reloc;
demand_empty_rest_of_line ();
if (flag_mri)
mri_comment_end (stop, stopc);
}
/* Put the contents of expression EXP into the object file using
NBYTES bytes. If need_pass_2 is 1, this does nothing. */
void
emit_expr (expressionS *exp, unsigned int nbytes)
{
emit_expr_with_reloc (exp, nbytes, TC_PARSE_CONS_RETURN_NONE);
}
void
emit_expr_with_reloc (expressionS *exp,
unsigned int nbytes,
TC_PARSE_CONS_RETURN_TYPE reloc)
{
operatorT op;
char *p;
valueT extra_digit = 0;
/* Don't do anything if we are going to make another pass. */
if (need_pass_2)
return;
frag_grow (nbytes);
dot_value = frag_now_fix ();
dot_frag = frag_now;
#ifndef NO_LISTING
#ifdef OBJ_ELF
/* When gcc emits DWARF 1 debugging pseudo-ops, a line number will
appear as a four byte positive constant in the .line section,
followed by a 2 byte 0xffff. Look for that case here. */
{
static int dwarf_line = -1;
if (strcmp (segment_name (now_seg), ".line") != 0)
dwarf_line = -1;
else if (dwarf_line >= 0
&& nbytes == 2
&& exp->X_op == O_constant
&& (exp->X_add_number == -1 || exp->X_add_number == 0xffff))
listing_source_line ((unsigned int) dwarf_line);
else if (nbytes == 4
&& exp->X_op == O_constant
&& exp->X_add_number >= 0)
dwarf_line = exp->X_add_number;
else
dwarf_line = -1;
}
/* When gcc emits DWARF 1 debugging pseudo-ops, a file name will
appear as a 2 byte TAG_compile_unit (0x11) followed by a 2 byte
AT_sibling (0x12) followed by a four byte address of the sibling
followed by a 2 byte AT_name (0x38) followed by the name of the
file. We look for that case here. */
{
static int dwarf_file = 0;
if (strcmp (segment_name (now_seg), ".debug") != 0)
dwarf_file = 0;
else if (dwarf_file == 0
&& nbytes == 2
&& exp->X_op == O_constant
&& exp->X_add_number == 0x11)
dwarf_file = 1;
else if (dwarf_file == 1
&& nbytes == 2
&& exp->X_op == O_constant
&& exp->X_add_number == 0x12)
dwarf_file = 2;
else if (dwarf_file == 2
&& nbytes == 4)
dwarf_file = 3;
else if (dwarf_file == 3
&& nbytes == 2
&& exp->X_op == O_constant
&& exp->X_add_number == 0x38)
dwarf_file = 4;
else
dwarf_file = 0;
/* The variable dwarf_file_string tells stringer that the string
may be the name of the source file. */
if (dwarf_file == 4)
dwarf_file_string = 1;
else
dwarf_file_string = 0;
}
#endif
#endif
if (check_eh_frame (exp, &nbytes))
return;
op = exp->X_op;
/* Handle a negative bignum. */
if (op == O_uminus
&& exp->X_add_number == 0
&& symbol_get_value_expression (exp->X_add_symbol)->X_op == O_big
&& symbol_get_value_expression (exp->X_add_symbol)->X_add_number > 0)
{
int i;
unsigned long carry;
exp = symbol_get_value_expression (exp->X_add_symbol);
/* Negate the bignum: one's complement each digit and add 1. */
carry = 1;
for (i = 0; i < exp->X_add_number; i++)
{
unsigned long next;
next = (((~(generic_bignum[i] & LITTLENUM_MASK))
& LITTLENUM_MASK)
+ carry);
generic_bignum[i] = next & LITTLENUM_MASK;
carry = next >> LITTLENUM_NUMBER_OF_BITS;
}
/* We can ignore any carry out, because it will be handled by
extra_digit if it is needed. */
extra_digit = (valueT) -1;
op = O_big;
}
if (op == O_absent || op == O_illegal)
{
as_warn (_("zero assumed for missing expression"));
exp->X_add_number = 0;
op = O_constant;
}
else if (op == O_big && exp->X_add_number <= 0)
{
as_bad (_("floating point number invalid"));
exp->X_add_number = 0;
op = O_constant;
}
else if (op == O_register)
{
as_warn (_("register value used as expression"));
op = O_constant;
}
/* Allow `.word 0' in the absolute section. */
if (now_seg == absolute_section)
{
if (op != O_constant || exp->X_add_number != 0)
as_bad (_("attempt to store value in absolute section"));
abs_section_offset += nbytes;
return;
}
/* Allow `.word 0' in BSS style sections. */
if ((op != O_constant || exp->X_add_number != 0) && in_bss ())
as_bad (_("attempt to store non-zero value in section `%s'"),
segment_name (now_seg));
p = frag_more ((int) nbytes);
if (reloc != TC_PARSE_CONS_RETURN_NONE)
{
emit_expr_fix (exp, nbytes, frag_now, p, reloc);
return;
}
#ifndef WORKING_DOT_WORD
/* If we have the difference of two symbols in a word, save it on
the broken_words list. See the code in write.c. */
if (op == O_subtract && nbytes == 2)
{
struct broken_word *x;
x = XNEW (struct broken_word);
x->next_broken_word = broken_words;
broken_words = x;
x->seg = now_seg;
x->subseg = now_subseg;
x->frag = frag_now;
x->word_goes_here = p;
x->dispfrag = 0;
x->add = exp->X_add_symbol;
x->sub = exp->X_op_symbol;
x->addnum = exp->X_add_number;
x->added = 0;
x->use_jump = 0;
new_broken_words++;
return;
}
#endif
/* If we have an integer, but the number of bytes is too large to
pass to md_number_to_chars, handle it as a bignum. */
if (op == O_constant && nbytes > sizeof (valueT))
{
extra_digit = exp->X_unsigned ? 0 : -1;
convert_to_bignum (exp, !exp->X_unsigned);
op = O_big;
}
if (op == O_constant)
{
valueT get;
valueT use;
valueT mask;
valueT unmask;
/* JF << of >= number of bits in the object is undefined. In
particular SPARC (Sun 4) has problems. */
if (nbytes >= sizeof (valueT))
{
know (nbytes == sizeof (valueT));
mask = 0;
}
else
{
/* Don't store these bits. */
mask = ~(valueT) 0 << (BITS_PER_CHAR * nbytes);
}
unmask = ~mask; /* Do store these bits. */
#ifdef NEVER
"Do this mod if you want every overflow check to assume SIGNED 2's complement data.";
mask = ~(unmask >> 1); /* Includes sign bit now. */
#endif
get = exp->X_add_number;
use = get & unmask;
if ((get & mask) != 0 && (-get & mask) != 0)
{
char get_buf[128];
char use_buf[128];
/* These buffers help to ease the translation of the warning message. */
sprintf_vma (get_buf, get);
sprintf_vma (use_buf, use);
/* Leading bits contain both 0s & 1s. */
as_warn (_("value 0x%s truncated to 0x%s"), get_buf, use_buf);
}
/* Put bytes in right order. */
md_number_to_chars (p, use, (int) nbytes);
}
else if (op == O_big)
{
unsigned int size;
LITTLENUM_TYPE *nums;
size = exp->X_add_number * CHARS_PER_LITTLENUM;
if (nbytes < size)
{
int i = nbytes / CHARS_PER_LITTLENUM;
if (i != 0)
{
LITTLENUM_TYPE sign = 0;
if ((generic_bignum[--i]
& (1 << (LITTLENUM_NUMBER_OF_BITS - 1))) != 0)
sign = ~(LITTLENUM_TYPE) 0;
while (++i < exp->X_add_number)
if (generic_bignum[i] != sign)
break;
}
else if (nbytes == 1)
{
/* We have nbytes == 1 and CHARS_PER_LITTLENUM == 2 (probably).
Check that bits 8.. of generic_bignum[0] match bit 7
and that they match all of generic_bignum[1..exp->X_add_number]. */
LITTLENUM_TYPE sign = (generic_bignum[0] & (1 << 7)) ? -1 : 0;
LITTLENUM_TYPE himask = LITTLENUM_MASK & ~ 0xFF;
if ((generic_bignum[0] & himask) == (sign & himask))
{
while (++i < exp->X_add_number)
if (generic_bignum[i] != sign)
break;
}
}
if (i < exp->X_add_number)
as_warn (ngettext ("bignum truncated to %d byte",
"bignum truncated to %d bytes",
nbytes),
nbytes);
size = nbytes;
}
if (nbytes == 1)
{
md_number_to_chars (p, (valueT) generic_bignum[0], 1);
return;
}
know (nbytes % CHARS_PER_LITTLENUM == 0);
if (target_big_endian)
{
while (nbytes > size)
{
md_number_to_chars (p, extra_digit, CHARS_PER_LITTLENUM);
nbytes -= CHARS_PER_LITTLENUM;
p += CHARS_PER_LITTLENUM;
}
nums = generic_bignum + size / CHARS_PER_LITTLENUM;
while (size >= CHARS_PER_LITTLENUM)
{
--nums;
md_number_to_chars (p, (valueT) *nums, CHARS_PER_LITTLENUM);
size -= CHARS_PER_LITTLENUM;
p += CHARS_PER_LITTLENUM;
}
}
else
{
nums = generic_bignum;
while (size >= CHARS_PER_LITTLENUM)
{
md_number_to_chars (p, (valueT) *nums, CHARS_PER_LITTLENUM);
++nums;
size -= CHARS_PER_LITTLENUM;
p += CHARS_PER_LITTLENUM;
nbytes -= CHARS_PER_LITTLENUM;
}
while (nbytes >= CHARS_PER_LITTLENUM)
{
md_number_to_chars (p, extra_digit, CHARS_PER_LITTLENUM);
nbytes -= CHARS_PER_LITTLENUM;
p += CHARS_PER_LITTLENUM;
}
}
}
else
emit_expr_fix (exp, nbytes, frag_now, p, TC_PARSE_CONS_RETURN_NONE);
}
void
emit_expr_fix (expressionS *exp, unsigned int nbytes, fragS *frag, char *p,
TC_PARSE_CONS_RETURN_TYPE r ATTRIBUTE_UNUSED)
{
int offset = 0;
unsigned int size = nbytes;
memset (p, 0, size);
/* Generate a fixS to record the symbol value. */
#ifdef TC_CONS_FIX_NEW
TC_CONS_FIX_NEW (frag, p - frag->fr_literal + offset, size, exp, r);
#else
if (r != TC_PARSE_CONS_RETURN_NONE)
{
reloc_howto_type *reloc_howto;
reloc_howto = bfd_reloc_type_lookup (stdoutput, r);
size = bfd_get_reloc_size (reloc_howto);
if (size > nbytes)
{
as_bad (ngettext ("%s relocations do not fit in %u byte",
"%s relocations do not fit in %u bytes",
nbytes),
reloc_howto->name, nbytes);
return;
}
else if (target_big_endian)
offset = nbytes - size;
}
else
switch (size)
{
case 1:
r = BFD_RELOC_8;
break;
case 2:
r = BFD_RELOC_16;
break;
case 3:
r = BFD_RELOC_24;
break;
case 4:
r = BFD_RELOC_32;
break;
case 8:
r = BFD_RELOC_64;
break;
default:
as_bad (_("unsupported BFD relocation size %u"), size);
return;
}
fix_new_exp (frag, p - frag->fr_literal + offset, size,
exp, 0, r);
#endif
}
/* Handle an MRI style string expression. */
#ifdef TC_M68K
static void
parse_mri_cons (expressionS *exp, unsigned int nbytes)
{
if (*input_line_pointer != '\''
&& (input_line_pointer[1] != '\''
|| (*input_line_pointer != 'A'
&& *input_line_pointer != 'E')))
(void) TC_PARSE_CONS_EXPRESSION (exp, nbytes);
else
{
unsigned int scan;
unsigned int result = 0;
/* An MRI style string. Cut into as many bytes as will fit into
a nbyte chunk, left justify if necessary, and separate with
commas so we can try again later. */
if (*input_line_pointer == 'A')
++input_line_pointer;
else if (*input_line_pointer == 'E')
{
as_bad (_("EBCDIC constants are not supported"));
++input_line_pointer;
}
input_line_pointer++;
for (scan = 0; scan < nbytes; scan++)
{
if (*input_line_pointer == '\'')
{
if (input_line_pointer[1] == '\'')
{
input_line_pointer++;
}
else
break;
}
result = (result << 8) | (*input_line_pointer++);
}
/* Left justify. */
while (scan < nbytes)
{
result <<= 8;
scan++;
}
/* Create correct expression. */
exp->X_op = O_constant;
exp->X_add_number = result;
/* Fake it so that we can read the next char too. */
if (input_line_pointer[0] != '\'' ||
(input_line_pointer[0] == '\'' && input_line_pointer[1] == '\''))
{
input_line_pointer -= 2;
input_line_pointer[0] = ',';
input_line_pointer[1] = '\'';
}
else
input_line_pointer++;
}
}
#endif /* TC_M68K */
#ifdef REPEAT_CONS_EXPRESSIONS
/* Parse a repeat expression for cons. This is used by the MIPS
assembler. The format is NUMBER:COUNT; NUMBER appears in the
object file COUNT times.
To use this for a target, define REPEAT_CONS_EXPRESSIONS. */
static void
parse_repeat_cons (expressionS *exp, unsigned int nbytes)
{
expressionS count;
int i;
expression (exp);
if (*input_line_pointer != ':')
{
/* No repeat count. */
return;
}
++input_line_pointer;
expression (&count);
if (count.X_op != O_constant
|| count.X_add_number <= 0)
{
as_warn (_("unresolvable or nonpositive repeat count; using 1"));
return;
}
/* The cons function is going to output this expression once. So we
output it count - 1 times. */
for (i = count.X_add_number - 1; i > 0; i--)
emit_expr (exp, nbytes);
}
#endif /* REPEAT_CONS_EXPRESSIONS */
/* Parse a floating point number represented as a hex constant. This
permits users to specify the exact bits they want in the floating
point number. */
static int
hex_float (int float_type, char *bytes)
{
int length;
int i;
switch (float_type)
{
case 'f':
case 'F':
case 's':
case 'S':
length = 4;
break;
case 'd':
case 'D':
case 'r':
case 'R':
length = 8;
break;
case 'x':
case 'X':
length = 12;
break;
case 'p':
case 'P':
length = 12;
break;
default:
as_bad (_("unknown floating type type '%c'"), float_type);
return -1;
}
/* It would be nice if we could go through expression to parse the
hex constant, but if we get a bignum it's a pain to sort it into
the buffer correctly. */
i = 0;
while (hex_p (*input_line_pointer) || *input_line_pointer == '_')
{
int d;
/* The MRI assembler accepts arbitrary underscores strewn about
through the hex constant, so we ignore them as well. */
if (*input_line_pointer == '_')
{
++input_line_pointer;
continue;
}
if (i >= length)
{
as_warn (_("floating point constant too large"));
return -1;
}
d = hex_value (*input_line_pointer) << 4;
++input_line_pointer;
while (*input_line_pointer == '_')
++input_line_pointer;
if (hex_p (*input_line_pointer))
{
d += hex_value (*input_line_pointer);
++input_line_pointer;
}
if (target_big_endian)
bytes[i] = d;
else
bytes[length - i - 1] = d;
++i;
}
if (i < length)
{
if (target_big_endian)
memset (bytes + i, 0, length - i);
else
memset (bytes, 0, length - i);
}
return length;
}
/* float_cons()
CONStruct some more frag chars of .floats .ffloats etc.
Makes 0 or more new frags.
If need_pass_2 == 1, no frags are emitted.
This understands only floating literals, not expressions. Sorry.
A floating constant is defined by atof_generic(), except it is preceded
by 0d 0f 0g or 0h. After observing the STRANGE way my BSD AS does its
reading, I decided to be incompatible. This always tries to give you
rounded bits to the precision of the pseudo-op. Former AS did premature
truncation, restored noisy bits instead of trailing 0s AND gave you
a choice of 2 flavours of noise according to which of 2 floating-point
scanners you directed AS to use.
In: input_line_pointer->whitespace before, or '0' of flonum. */
void
float_cons (/* Clobbers input_line-pointer, checks end-of-line. */
int float_type /* 'f':.ffloat ... 'F':.float ... */)
{
char *p;
int length; /* Number of chars in an object. */
char temp[MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT];
if (is_it_end_of_statement ())
{
demand_empty_rest_of_line ();
return;
}
if (now_seg == absolute_section)
{
as_bad (_("attempt to store float in absolute section"));
ignore_rest_of_line ();
return;
}
if (in_bss ())
{
as_bad (_("attempt to store float in section `%s'"),
segment_name (now_seg));
ignore_rest_of_line ();
return;
}
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
#ifdef md_cons_align
md_cons_align (1);
#endif
do
{
length = parse_one_float (float_type, temp);
if (length < 0)
return;
if (!need_pass_2)
{
int count;
count = 1;
#ifdef REPEAT_CONS_EXPRESSIONS
if (*input_line_pointer == ':')
{
expressionS count_exp;
++input_line_pointer;
expression (&count_exp);
if (count_exp.X_op != O_constant
|| count_exp.X_add_number <= 0)
as_warn (_("unresolvable or nonpositive repeat count; using 1"));
else
count = count_exp.X_add_number;
}
#endif
while (--count >= 0)
{
p = frag_more (length);
memcpy (p, temp, (unsigned int) length);
}
}
SKIP_WHITESPACE ();
}
while (*input_line_pointer++ == ',');
/* Put terminator back into stream. */
--input_line_pointer;
demand_empty_rest_of_line ();
}
/* LEB128 Encoding.
Note - we are using the DWARF standard's definition of LEB128 encoding
where each 7-bit value is a stored in a byte, *not* an octet. This
means that on targets where a byte contains multiple octets there is
a *huge waste of space*. (This also means that we do not have to
have special versions of these functions for when OCTETS_PER_BYTE_POWER
is non-zero).
If the 7-bit values were to be packed into N-bit bytes (where N > 8)
we would then have to consider whether multiple, successive LEB128
values should be packed into the bytes without padding (bad idea) or
whether each LEB128 number is padded out to a whole number of bytes.
Plus you have to decide on the endianness of packing octets into a
byte. */
/* Return the size of a LEB128 value in bytes. */
static inline unsigned int
sizeof_sleb128 (offsetT value)
{
int size = 0;
unsigned byte;
do
{
byte = (value & 0x7f);
/* Sadly, we cannot rely on typical arithmetic right shift behaviour.
Fortunately, we can structure things so that the extra work reduces
to a noop on systems that do things "properly". */
value = (value >> 7) | ~(-(offsetT)1 >> 7);
size += 1;
}
while (!(((value == 0) && ((byte & 0x40) == 0))
|| ((value == -1) && ((byte & 0x40) != 0))));
return size;
}
static inline unsigned int
sizeof_uleb128 (valueT value)
{
int size = 0;
do
{
value >>= 7;
size += 1;
}
while (value != 0);
return size;
}
unsigned int
sizeof_leb128 (valueT value, int sign)
{
if (sign)
return sizeof_sleb128 ((offsetT) value);
else
return sizeof_uleb128 (value);
}
/* Output a LEB128 value. Returns the number of bytes used. */
static inline unsigned int
output_sleb128 (char *p, offsetT value)
{
char *orig = p;
int more;
do
{
unsigned byte = (value & 0x7f);
/* Sadly, we cannot rely on typical arithmetic right shift behaviour.
Fortunately, we can structure things so that the extra work reduces
to a noop on systems that do things "properly". */
value = (value >> 7) | ~(-(offsetT)1 >> 7);
more = !((((value == 0) && ((byte & 0x40) == 0))
|| ((value == -1) && ((byte & 0x40) != 0))));
if (more)
byte |= 0x80;
*p++ = byte;
}
while (more);
return p - orig;
}
static inline unsigned int
output_uleb128 (char *p, valueT value)
{
char *orig = p;
do
{
unsigned byte = (value & 0x7f);
value >>= 7;
if (value != 0)
/* More bytes to follow. */
byte |= 0x80;
*p++ = byte;
}
while (value != 0);
return p - orig;
}
unsigned int
output_leb128 (char *p, valueT value, int sign)
{
if (sign)
return output_sleb128 (p, (offsetT) value);
else
return output_uleb128 (p, value);
}
/* Do the same for bignums. We combine sizeof with output here in that
we don't output for NULL values of P. It isn't really as critical as
for "normal" values that this be streamlined. Returns the number of
bytes used. */
static inline unsigned int
output_big_sleb128 (char *p, LITTLENUM_TYPE *bignum, unsigned int size)
{
char *orig = p;
valueT val = 0;
int loaded = 0;
unsigned byte;
/* Strip leading sign extensions off the bignum. */
while (size > 1
&& bignum[size - 1] == LITTLENUM_MASK
&& bignum[size - 2] > LITTLENUM_MASK / 2)
size--;
do
{
/* OR in the next part of the littlenum. */
val |= (*bignum << loaded);
loaded += LITTLENUM_NUMBER_OF_BITS;
size--;
bignum++;
/* Add bytes until there are less than 7 bits left in VAL
or until every non-sign bit has been written. */
do
{
byte = val & 0x7f;
loaded -= 7;
val >>= 7;
if (size > 0
|| val != ((byte & 0x40) == 0 ? 0 : ((valueT) 1 << loaded) - 1))
byte |= 0x80;
if (orig)
*p = byte;
p++;
}
while ((byte & 0x80) != 0 && loaded >= 7);
}
while (size > 0);
/* Mop up any left-over bits (of which there will be less than 7). */
if ((byte & 0x80) != 0)
{
/* Sign-extend VAL. */
if (val & (1 << (loaded - 1)))
val |= ~0U << loaded;
if (orig)
*p = val & 0x7f;
p++;
}
return p - orig;
}
static inline unsigned int
output_big_uleb128 (char *p, LITTLENUM_TYPE *bignum, unsigned int size)
{
char *orig = p;
valueT val = 0;
int loaded = 0;
unsigned byte;
/* Strip leading zeros off the bignum. */
/* XXX: Is this needed? */
while (size > 0 && bignum[size - 1] == 0)
size--;
do
{
if (loaded < 7 && size > 0)
{
val |= (*bignum << loaded);
loaded += 8 * CHARS_PER_LITTLENUM;
size--;
bignum++;
}
byte = val & 0x7f;
loaded -= 7;
val >>= 7;
if (size > 0 || val)
byte |= 0x80;
if (orig)
*p = byte;
p++;
}
while (byte & 0x80);
return p - orig;
}
static unsigned int
output_big_leb128 (char *p, LITTLENUM_TYPE *bignum, unsigned int size, int sign)
{
if (sign)
return output_big_sleb128 (p, bignum, size);
else
return output_big_uleb128 (p, bignum, size);
}
/* Generate the appropriate fragments for a given expression to emit a
leb128 value. SIGN is 1 for sleb, 0 for uleb. */
void
emit_leb128_expr (expressionS *exp, int sign)
{
operatorT op = exp->X_op;
unsigned int nbytes;
if (op == O_absent || op == O_illegal)
{
as_warn (_("zero assumed for missing expression"));
exp->X_add_number = 0;
op = O_constant;
}
else if (op == O_big && exp->X_add_number <= 0)
{
as_bad (_("floating point number invalid"));
exp->X_add_number = 0;
op = O_constant;
}
else if (op == O_register)
{
as_warn (_("register value used as expression"));
op = O_constant;
}
else if (op == O_constant
&& sign
&& (exp->X_add_number < 0) == !exp->X_extrabit)
{
/* We're outputting a signed leb128 and the sign of X_add_number
doesn't reflect the sign of the original value. Convert EXP
to a correctly-extended bignum instead. */
convert_to_bignum (exp, exp->X_extrabit);
op = O_big;
}
if (now_seg == absolute_section)
{
if (op != O_constant || exp->X_add_number != 0)
as_bad (_("attempt to store value in absolute section"));
abs_section_offset++;
return;
}
if ((op != O_constant || exp->X_add_number != 0) && in_bss ())
as_bad (_("attempt to store non-zero value in section `%s'"),
segment_name (now_seg));
/* Let check_eh_frame know that data is being emitted. nbytes == -1 is
a signal that this is leb128 data. It shouldn't optimize this away. */
nbytes = (unsigned int) -1;
if (check_eh_frame (exp, &nbytes))
abort ();
/* Let the backend know that subsequent data may be byte aligned. */
#ifdef md_cons_align
md_cons_align (1);
#endif
if (op == O_constant)
{
/* If we've got a constant, emit the thing directly right now. */
valueT value = exp->X_add_number;
unsigned int size;
char *p;
size = sizeof_leb128 (value, sign);
p = frag_more (size);
if (output_leb128 (p, value, sign) > size)
abort ();
}
else if (op == O_big)
{
/* O_big is a different sort of constant. */
int nbr_digits = exp->X_add_number;
unsigned int size;
char *p;
/* If the leading littenum is 0xffff, prepend a 0 to avoid confusion with
a signed number. Unary operators like - or ~ always extend the
bignum to its largest size. */
if (exp->X_unsigned
&& nbr_digits < SIZE_OF_LARGE_NUMBER
&& generic_bignum[nbr_digits - 1] == LITTLENUM_MASK)
generic_bignum[nbr_digits++] = 0;
size = output_big_leb128 (NULL, generic_bignum, nbr_digits, sign);
p = frag_more (size);
if (output_big_leb128 (p, generic_bignum, nbr_digits, sign) > size)
abort ();
}
else
{
/* Otherwise, we have to create a variable sized fragment and
resolve things later. */
frag_var (rs_leb128, sizeof_uleb128 (~(valueT) 0), 0, sign,
make_expr_symbol (exp), 0, (char *) NULL);
}
}
/* Parse the .sleb128 and .uleb128 pseudos. */
void
s_leb128 (int sign)
{
expressionS exp;
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
do
{
expression (&exp);
emit_leb128_expr (&exp, sign);
}
while (*input_line_pointer++ == ',');
input_line_pointer--;
demand_empty_rest_of_line ();
}
static void
stringer_append_char (int c, int bitsize)
{
if (c && in_bss ())
as_bad (_("attempt to store non-empty string in section `%s'"),
segment_name (now_seg));
if (!target_big_endian)
FRAG_APPEND_1_CHAR (c);
switch (bitsize)
{
case 64:
FRAG_APPEND_1_CHAR (0);
FRAG_APPEND_1_CHAR (0);
FRAG_APPEND_1_CHAR (0);
FRAG_APPEND_1_CHAR (0);
/* Fall through. */
case 32:
FRAG_APPEND_1_CHAR (0);
FRAG_APPEND_1_CHAR (0);
/* Fall through. */
case 16:
FRAG_APPEND_1_CHAR (0);
/* Fall through. */
case 8:
break;
default:
/* Called with invalid bitsize argument. */
abort ();
break;
}
if (target_big_endian)
FRAG_APPEND_1_CHAR (c);
}
/* Worker to do .ascii etc statements.
Reads 0 or more ',' separated, double-quoted strings.
Caller should have checked need_pass_2 is FALSE because we don't
check it.
Checks for end-of-line.
BITS_APPENDZERO says how many bits are in a target char.
The bottom bit is set if a NUL char should be appended to the strings. */
void
stringer (int bits_appendzero)
{
const int bitsize = bits_appendzero & ~7;
const int append_zero = bits_appendzero & 1;
unsigned int c;
#if !defined(NO_LISTING) && defined (OBJ_ELF)
char *start;
#endif
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
#ifdef md_cons_align
md_cons_align (1);
#endif
/* If we have been switched into the abs_section then we
will not have an obstack onto which we can hang strings. */
if (now_seg == absolute_section)
{
as_bad (_("strings must be placed into a section"));
ignore_rest_of_line ();
return;
}
/* The following awkward logic is to parse ZERO or more strings,
comma separated. Recall a string expression includes spaces
before the opening '\"' and spaces after the closing '\"'.
We fake a leading ',' if there is (supposed to be)
a 1st, expression. We keep demanding expressions for each ','. */
if (is_it_end_of_statement ())
{
c = 0; /* Skip loop. */
++input_line_pointer; /* Compensate for end of loop. */
}
else
{
c = ','; /* Do loop. */
}
while (c == ',' || c == '<' || c == '"')
{
SKIP_WHITESPACE ();
switch (*input_line_pointer)
{
case '\"':
++input_line_pointer; /*->1st char of string. */
#if !defined(NO_LISTING) && defined (OBJ_ELF)
start = input_line_pointer;
#endif
while (is_a_char (c = next_char_of_string ()))
stringer_append_char (c, bitsize);
/* Treat "a" "b" as "ab". Even if we are appending zeros. */
SKIP_ALL_WHITESPACE ();
if (*input_line_pointer == '"')
break;
if (append_zero)
stringer_append_char (0, bitsize);
#if !defined(NO_LISTING) && defined (OBJ_ELF)
/* In ELF, when gcc is emitting DWARF 1 debugging output, it
will emit .string with a filename in the .debug section
after a sequence of constants. See the comment in
emit_expr for the sequence. emit_expr will set
dwarf_file_string to non-zero if this string might be a
source file name. */
if (strcmp (segment_name (now_seg), ".debug") != 0)
dwarf_file_string = 0;
else if (dwarf_file_string)
{
c = input_line_pointer[-1];
input_line_pointer[-1] = '\0';
listing_source_file (start);
input_line_pointer[-1] = c;
}
#endif
break;
case '<':
input_line_pointer++;
c = get_single_number ();
stringer_append_char (c, bitsize);
if (*input_line_pointer != '>')
{
as_bad (_("expected <nn>"));
ignore_rest_of_line ();
return;
}
input_line_pointer++;
break;
case ',':
input_line_pointer++;
break;
}
SKIP_WHITESPACE ();
c = *input_line_pointer;
}
demand_empty_rest_of_line ();
}
/* FIXME-SOMEDAY: I had trouble here on characters with the
high bits set. We'll probably also have trouble with
multibyte chars, wide chars, etc. Also be careful about
returning values bigger than 1 byte. xoxorich. */
unsigned int
next_char_of_string (void)
{
unsigned int c;
c = *input_line_pointer++ & CHAR_MASK;
switch (c)
{
case 0:
/* PR 20902: Do not advance past the end of the buffer. */
-- input_line_pointer;
c = NOT_A_CHAR;
break;
case '\"':
c = NOT_A_CHAR;
break;
case '\n':
as_warn (_("unterminated string; newline inserted"));
bump_line_counters ();
break;
case '\\':
if (!TC_STRING_ESCAPES)
break;
switch (c = *input_line_pointer++ & CHAR_MASK)
{
case 'b':
c = '\b';
break;
case 'f':
c = '\f';
break;
case 'n':
c = '\n';
break;
case 'r':
c = '\r';
break;
case 't':
c = '\t';
break;
case 'v':
c = '\013';
break;
case '\\':
case '"':
break; /* As itself. */
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
{
long number;
int i;
for (i = 0, number = 0;
ISDIGIT (c) && i < 3;
c = *input_line_pointer++, i++)
{
number = number * 8 + c - '0';
}
c = number & CHAR_MASK;
}
--input_line_pointer;
break;
case 'x':
case 'X':
{
long number;
number = 0;
c = *input_line_pointer++;
while (ISXDIGIT (c))
{
if (ISDIGIT (c))
number = number * 16 + c - '0';
else if (ISUPPER (c))
number = number * 16 + c - 'A' + 10;
else
number = number * 16 + c - 'a' + 10;
c = *input_line_pointer++;
}
c = number & CHAR_MASK;
--input_line_pointer;
}
break;
case '\n':
/* To be compatible with BSD 4.2 as: give the luser a linefeed!! */
as_warn (_("unterminated string; newline inserted"));
c = '\n';
bump_line_counters ();
break;
case 0:
/* Do not advance past the end of the buffer. */
-- input_line_pointer;
c = NOT_A_CHAR;
break;
default:
#ifdef ONLY_STANDARD_ESCAPES
as_bad (_("bad escaped character in string"));
c = '?';
#endif /* ONLY_STANDARD_ESCAPES */
break;
}
break;
default:
break;
}
return (c);
}
static segT
get_segmented_expression (expressionS *expP)
{
segT retval;
retval = expression (expP);
if (expP->X_op == O_illegal
|| expP->X_op == O_absent
|| expP->X_op == O_big)
{
as_bad (_("expected address expression"));
expP->X_op = O_constant;
expP->X_add_number = 0;
retval = absolute_section;
}
return retval;
}
static segT
get_known_segmented_expression (expressionS *expP)
{
segT retval = get_segmented_expression (expP);
if (retval == undefined_section)
{
/* There is no easy way to extract the undefined symbol from the
expression. */
if (expP->X_add_symbol != NULL
&& S_GET_SEGMENT (expP->X_add_symbol) != expr_section)
as_warn (_("symbol \"%s\" undefined; zero assumed"),
S_GET_NAME (expP->X_add_symbol));
else
as_warn (_("some symbol undefined; zero assumed"));
retval = absolute_section;
expP->X_op = O_constant;
expP->X_add_number = 0;
}
return retval;
}
char /* Return terminator. */
get_absolute_expression_and_terminator (long *val_pointer /* Return value of expression. */)
{
/* FIXME: val_pointer should probably be offsetT *. */
*val_pointer = (long) get_absolute_expression ();
return (*input_line_pointer++);
}
/* Like demand_copy_string, but return NULL if the string contains any '\0's.
Give a warning if that happens. */
char *
demand_copy_C_string (int *len_pointer)
{
char *s;
if ((s = demand_copy_string (len_pointer)) != 0)
{
int len;
for (len = *len_pointer; len > 0; len--)
{
if (s[len - 1] == 0)
{
s = 0;
*len_pointer = 0;
as_bad (_("this string may not contain \'\\0\'"));
break;
}
}
}
return s;
}
/* Demand string, but return a safe (=private) copy of the string.
Return NULL if we can't read a string here. */
char *
demand_copy_string (int *lenP)
{
unsigned int c;
int len;
char *retval;
len = 0;
SKIP_WHITESPACE ();
if (*input_line_pointer == '\"')
{
input_line_pointer++; /* Skip opening quote. */
while (is_a_char (c = next_char_of_string ()))
{
obstack_1grow (¬es, c);
len++;
}
/* JF this next line is so demand_copy_C_string will return a
null terminated string. */
obstack_1grow (¬es, '\0');
retval = (char *) obstack_finish (¬es);
}
else
{
as_bad (_("missing string"));
retval = NULL;
ignore_rest_of_line ();
}
*lenP = len;
return (retval);
}
/* In: Input_line_pointer->next character.
Do: Skip input_line_pointer over all whitespace.
Out: 1 if input_line_pointer->end-of-line. */
int
is_it_end_of_statement (void)
{
SKIP_WHITESPACE ();
return (is_end_of_line[(unsigned char) *input_line_pointer]);
}
void
equals (char *sym_name, int reassign)
{
char *stop = NULL;
char stopc = 0;
input_line_pointer++;
if (*input_line_pointer == '=')
input_line_pointer++;
if (reassign < 0 && *input_line_pointer == '=')
input_line_pointer++;
while (*input_line_pointer == ' ' || *input_line_pointer == '\t')
input_line_pointer++;
if (flag_mri)
stop = mri_comment_field (&stopc);
assign_symbol (sym_name, reassign >= 0 ? !reassign : reassign);
if (flag_mri)
{
demand_empty_rest_of_line ();
mri_comment_end (stop, stopc);
}
}
/* .incbin -- include a file verbatim at the current location. */
void
s_incbin (int x ATTRIBUTE_UNUSED)
{
FILE * binfile;
char * path;
char * filename;
char * binfrag;
long skip = 0;
long count = 0;
long bytes;
int len;
#ifdef md_flush_pending_output
md_flush_pending_output ();
#endif
#ifdef md_cons_align
md_cons_align (1);
#endif
SKIP_WHITESPACE ();
filename = demand_copy_string (& len);
if (filename == NULL)
return;
SKIP_WHITESPACE ();
/* Look for optional skip and count. */
if (* input_line_pointer == ',')
{
++ input_line_pointer;
skip = get_absolute_expression ();
SKIP_WHITESPACE ();
if (* input_line_pointer == ',')
{
++ input_line_pointer;
count = get_absolute_expression ();
if (count == 0)
as_warn (_(".incbin count zero, ignoring `%s'"), filename);
SKIP_WHITESPACE ();
}
}
demand_empty_rest_of_line ();
/* Try opening absolute path first, then try include dirs. */
binfile = fopen (filename, FOPEN_RB);
if (binfile == NULL)
{
int i;
path = XNEWVEC (char, (unsigned long) len + include_dir_maxlen + 5);
for (i = 0; i < include_dir_count; i++)
{
sprintf (path, "%s/%s", include_dirs[i], filename);
binfile = fopen (path, FOPEN_RB);
if (binfile != NULL)
break;
}
if (binfile == NULL)
as_bad (_("file not found: %s"), filename);
}
else
path = xstrdup (filename);
if (binfile)
{
long file_len;
struct stat filestat;
if (fstat (fileno (binfile), &filestat) != 0
|| ! S_ISREG (filestat.st_mode)
|| S_ISDIR (filestat.st_mode))
{
as_bad (_("unable to include `%s'"), path);
goto done;
}
register_dependency (path);
/* Compute the length of the file. */
if (fseek (binfile, 0, SEEK_END) != 0)
{
as_bad (_("seek to end of .incbin file failed `%s'"), path);
goto done;
}
file_len = ftell (binfile);
/* If a count was not specified use the remainder of the file. */
if (count == 0)
count = file_len - skip;
if (skip < 0 || count < 0 || file_len < 0 || skip + count > file_len)
{
as_bad (_("skip (%ld) or count (%ld) invalid for file size (%ld)"),
skip, count, file_len);
goto done;
}
if (fseek (binfile, skip, SEEK_SET) != 0)
{
as_bad (_("could not skip to %ld in file `%s'"), skip, path);
goto done;
}
/* Allocate frag space and store file contents in it. */
binfrag = frag_more (count);
bytes = fread (binfrag, 1, count, binfile);
if (bytes < count)
as_warn (_("truncated file `%s', %ld of %ld bytes read"),
path, bytes, count);
}
done:
if (binfile != NULL)
fclose (binfile);
free (path);
}
/* .include -- include a file at this point. */
void
s_include (int arg ATTRIBUTE_UNUSED)
{
char *filename;
int i;
FILE *try_file;
char *path;
if (!flag_m68k_mri)
{
filename = demand_copy_string (&i);
if (filename == NULL)
{
/* demand_copy_string has already printed an error and
called ignore_rest_of_line. */
return;
}
}
else
{
SKIP_WHITESPACE ();
i = 0;
while (!is_end_of_line[(unsigned char) *input_line_pointer]
&& *input_line_pointer != ' '
&& *input_line_pointer != '\t')
{
obstack_1grow (¬es, *input_line_pointer);
++input_line_pointer;
++i;
}
obstack_1grow (¬es, '\0');
filename = (char *) obstack_finish (¬es);
while (!is_end_of_line[(unsigned char) *input_line_pointer])
++input_line_pointer;
}
demand_empty_rest_of_line ();
path = XNEWVEC (char, (unsigned long) i
+ include_dir_maxlen + 5 /* slop */ );
for (i = 0; i < include_dir_count; i++)
{
strcpy (path, include_dirs[i]);
strcat (path, "/");
strcat (path, filename);
if (0 != (try_file = fopen (path, FOPEN_RT)))
{
fclose (try_file);
goto gotit;
}
}
free (path);
path = filename;
gotit:
/* malloc Storage leak when file is found on path. FIXME-SOMEDAY. */
register_dependency (path);
input_scrub_insert_file (path);
}
void
add_include_dir (char *path)
{
int i;
if (include_dir_count == 0)
{
include_dirs = XNEWVEC (const char *, 2);
include_dirs[0] = "."; /* Current dir. */
include_dir_count = 2;
}
else
{
include_dir_count++;
include_dirs = XRESIZEVEC (const char *, include_dirs,
include_dir_count);
}
include_dirs[include_dir_count - 1] = path; /* New one. */
i = strlen (path);
if (i > include_dir_maxlen)
include_dir_maxlen = i;
}
/* Output debugging information to denote the source file. */
static void
generate_file_debug (void)
{
if (debug_type == DEBUG_STABS)
stabs_generate_asm_file ();
}
/* Output line number debugging information for the current source line. */
void
generate_lineno_debug (void)
{
switch (debug_type)
{
case DEBUG_UNSPECIFIED:
case DEBUG_NONE:
case DEBUG_DWARF:
break;
case DEBUG_STABS:
stabs_generate_asm_lineno ();
break;
case DEBUG_ECOFF:
ecoff_generate_asm_lineno ();
break;
case DEBUG_DWARF2:
/* ??? We could here indicate to dwarf2dbg.c that something
has changed. However, since there is additional backend
support that is required (calling dwarf2_emit_insn), we
let dwarf2dbg.c call as_where on its own. */
break;
}
}
/* Output debugging information to mark a function entry point or end point.
END_P is zero for .func, and non-zero for .endfunc. */
void
s_func (int end_p)
{
do_s_func (end_p, NULL);
}
/* Subroutine of s_func so targets can choose a different default prefix.
If DEFAULT_PREFIX is NULL, use the target's "leading char". */
static void
do_s_func (int end_p, const char *default_prefix)
{
/* Record the current function so that we can issue an error message for
misplaced .func,.endfunc, and also so that .endfunc needs no
arguments. */
static char *current_name;
static char *current_label;
if (end_p)
{
if (current_name == NULL)
{
as_bad (_("missing .func"));
ignore_rest_of_line ();
return;
}
if (debug_type == DEBUG_STABS)
stabs_generate_asm_endfunc (current_name, current_label);
current_name = current_label = NULL;
}
else /* ! end_p */
{
char *name, *label;
char delim1, delim2;
if (current_name != NULL)
{
as_bad (_(".endfunc missing for previous .func"));
ignore_rest_of_line ();
return;
}
delim1 = get_symbol_name (& name);
name = xstrdup (name);
*input_line_pointer = delim1;
SKIP_WHITESPACE_AFTER_NAME ();
if (*input_line_pointer != ',')
{
if (default_prefix)
{
if (asprintf (&label, "%s%s", default_prefix, name) == -1)
as_fatal ("%s", xstrerror (errno));
}
else
{
char leading_char = bfd_get_symbol_leading_char (stdoutput);
/* Missing entry point, use function's name with the leading
char prepended. */
if (leading_char)
{
if (asprintf (&label, "%c%s", leading_char, name) == -1)
as_fatal ("%s", xstrerror (errno));
}
else
label = name;
}
}
else
{
++input_line_pointer;
SKIP_WHITESPACE ();
delim2 = get_symbol_name (& label);
label = xstrdup (label);
restore_line_pointer (delim2);
}
if (debug_type == DEBUG_STABS)
stabs_generate_asm_func (name, label);
current_name = name;
current_label = label;
}
demand_empty_rest_of_line ();
}
#ifdef HANDLE_BUNDLE
void
s_bundle_align_mode (int arg ATTRIBUTE_UNUSED)
{
unsigned int align = get_absolute_expression ();
SKIP_WHITESPACE ();
demand_empty_rest_of_line ();
if (align > (unsigned int) TC_ALIGN_LIMIT)
as_fatal (_(".bundle_align_mode alignment too large (maximum %u)"),
(unsigned int) TC_ALIGN_LIMIT);
if (bundle_lock_frag != NULL)
{
as_bad (_("cannot change .bundle_align_mode inside .bundle_lock"));
return;
}
bundle_align_p2 = align;
}
void
s_bundle_lock (int arg ATTRIBUTE_UNUSED)
{
demand_empty_rest_of_line ();
if (bundle_align_p2 == 0)
{
as_bad (_(".bundle_lock is meaningless without .bundle_align_mode"));
return;
}
if (bundle_lock_depth == 0)
{
bundle_lock_frchain = frchain_now;
bundle_lock_frag = start_bundle ();
}
++bundle_lock_depth;
}
void
s_bundle_unlock (int arg ATTRIBUTE_UNUSED)
{
unsigned int size;
demand_empty_rest_of_line ();
if (bundle_lock_frag == NULL)
{
as_bad (_(".bundle_unlock without preceding .bundle_lock"));
return;
}
gas_assert (bundle_align_p2 > 0);
gas_assert (bundle_lock_depth > 0);
if (--bundle_lock_depth > 0)
return;
size = pending_bundle_size (bundle_lock_frag);
if (size > 1U << bundle_align_p2)
as_bad (_(".bundle_lock sequence is %u bytes, "
"but bundle size is only %u bytes"),
size, 1u << bundle_align_p2);
else
finish_bundle (bundle_lock_frag, size);
bundle_lock_frag = NULL;
bundle_lock_frchain = NULL;
}
#endif /* HANDLE_BUNDLE */
void
s_ignore (int arg ATTRIBUTE_UNUSED)
{
ignore_rest_of_line ();
}
void
read_print_statistics (FILE *file)
{
htab_print_statistics (file, "pseudo-op table", po_hash);
}
/* Inserts the given line into the input stream.
This call avoids macro/conditionals nesting checking, since the contents of
the line are assumed to replace the contents of a line already scanned.
An appropriate use of this function would be substitution of input lines when
called by md_start_line_hook(). The given line is assumed to already be
properly scrubbed. */
void
input_scrub_insert_line (const char *line)
{
sb newline;
size_t len = strlen (line);
sb_build (&newline, len);
sb_add_buffer (&newline, line, len);
input_scrub_include_sb (&newline, input_line_pointer, 0);
sb_kill (&newline);
buffer_limit = input_scrub_next_buffer (&input_line_pointer);
}
/* Insert a file into the input stream; the path must resolve to an actual
file; no include path searching or dependency registering is performed. */
void
input_scrub_insert_file (char *path)
{
input_scrub_include_file (path, input_line_pointer);
buffer_limit = input_scrub_next_buffer (&input_line_pointer);
}
/* Find the end of a line, considering quotation and escaping of quotes. */
#if !defined(TC_SINGLE_QUOTE_STRINGS) && defined(SINGLE_QUOTE_STRINGS)
# define TC_SINGLE_QUOTE_STRINGS 1
#endif
static char *
_find_end_of_line (char *s, int mri_string, int insn ATTRIBUTE_UNUSED,
int in_macro)
{
char inquote = '\0';
int inescape = 0;
while (!is_end_of_line[(unsigned char) *s]
|| (inquote && !ISCNTRL (*s))
|| (inquote == '\'' && flag_mri)
#ifdef TC_EOL_IN_INSN
|| (insn && TC_EOL_IN_INSN (s))
#endif
/* PR 6926: When we are parsing the body of a macro the sequence
\@ is special - it refers to the invocation count. If the @
character happens to be registered as a line-separator character
by the target, then the is_end_of_line[] test above will have
returned true, but we need to ignore the line separating
semantics in this particular case. */
|| (in_macro && inescape && *s == '@')
)
{
if (mri_string && *s == '\'')
inquote ^= *s;
else if (inescape)
inescape = 0;
else if (*s == '\\')
inescape = 1;
else if (!inquote
? *s == '"'
#ifdef TC_SINGLE_QUOTE_STRINGS
|| (TC_SINGLE_QUOTE_STRINGS && *s == '\'')
#endif
: *s == inquote)
inquote ^= *s;
++s;
}
if (inquote)
as_warn (_("missing closing `%c'"), inquote);
if (inescape && !ignore_input ())
as_warn (_("stray `\\'"));
return s;
}
char *
find_end_of_line (char *s, int mri_string)
{
return _find_end_of_line (s, mri_string, 0, 0);
}
static char *saved_ilp = NULL;
static char *saved_limit;
/* Use BUF as a temporary input pointer for calling other functions in this
file. BUF must be a C string, so that its end can be found by strlen.
Also sets the buffer_limit variable (local to this file) so that buffer
overruns should not occur. Saves the current input line pointer so that
it can be restored by calling restore_ilp().
Does not support recursion. */
void
temp_ilp (char *buf)
{
gas_assert (saved_ilp == NULL);
gas_assert (buf != NULL);
saved_ilp = input_line_pointer;
saved_limit = buffer_limit;
/* Prevent the assert in restore_ilp from triggering if
the input_line_pointer has not yet been initialised. */
if (saved_ilp == NULL)
saved_limit = saved_ilp = (char *) "";
input_line_pointer = buf;
buffer_limit = buf + strlen (buf);
input_from_string = true;
}
/* Restore a saved input line pointer. */
void
restore_ilp (void)
{
gas_assert (saved_ilp != NULL);
input_line_pointer = saved_ilp;
buffer_limit = saved_limit;
input_from_string = false;
saved_ilp = NULL;
}
|