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
|
/* tc-alpha.c - Processor-specific code for the DEC Alpha CPU.
Copyright (C) 1989, 1993, 1994 Free Software Foundation, Inc.
Contributed by Carnegie Mellon University, 1993.
Written by Alessandro Forin, based on earlier gas-1.38 target CPU files.
Modified by Ken Raeburn for gas-2.x and ECOFF support.
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 2, 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, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/*
* Mach Operating System
* Copyright (c) 1993 Carnegie Mellon University
* All Rights Reserved.
*
* Permission to use, copy, modify and distribute this software and its
* documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie the
* rights to redistribute these changes.
*/
/*
* HISTORY
* 5-Oct-93 Alessandro Forin (af) at Carnegie-Mellon University
* First Checkin
*
* Author: Alessandro Forin, Carnegie Mellon University
* Date: Jan 1993
*/
#include <ctype.h>
#include "as.h"
#include "alpha-opcode.h"
#include "subsegs.h"
/* The OSF/1 V2.0 Alpha compiler can't compile this file with inline
functions. */
#ifndef __GNUC__
#undef inline
#define inline
#endif
/* @@ Will a simple 0x8000 work here? If not, why not? */
#define GP_ADJUSTMENT (0x8000 - 0x10)
/* These are exported to relaxing code, even though we don't do any
relaxing on this processor currently. */
int md_short_jump_size = 4;
int md_long_jump_size = 4;
/* handle of the OPCODE hash table */
static struct hash_control *op_hash;
/* Sections and symbols we'll want to keep track of. */
static segT lita_sec, rdata, sdata, lit8_sec, lit4_sec;
static symbolS *lit8_sym, *lit4_sym;
/* Setting for ".set [no]{at,macro}". */
static int at_ok = 1, macro_ok = 1;
/* Keep track of global pointer. */
valueT alpha_gp_value;
static symbolS *gp;
/* We'll probably be using this relocation frequently, and we
will want to compare for it. */
static reloc_howto_type *gpdisp_hi16_howto;
/* These are exported to ECOFF code. */
unsigned long alpha_gprmask, alpha_fprmask;
/* Used for LITUSE relocations. */
static expressionS lituse_basereg, lituse_byteoff, lituse_jsr;
/* Address size: In OSF/1 1.3, an undocumented "-32addr" option will
cause all addresses to be treated as 32-bit values in memory. (The
in-register versions are all sign-extended to 64 bits, of course.)
Some other systems may want this option too. */
static int addr32;
/* Symbol labelling the current insn. When the Alpha gas sees
foo:
.quad 0
and the section happens to not be on an eight byte boundary, it
will align both the symbol and the .quad to an eight byte boundary. */
static symbolS *insn_label;
/* Whether we should automatically align data generation pseudo-ops.
.align 0 will turn this off. */
static int auto_align = 1;
/* Imported functions -- they should be defined in header files somewhere. */
extern segT subseg_get ();
extern PTR bfd_alloc_by_size_t ();
extern void s_globl (), s_long (), s_short (), s_space (), cons (), s_text (),
s_data (), float_cons ();
/* Static functions, needing forward declarations. */
static void s_base (), s_proc (), s_alpha_set ();
static void s_gprel32 (), s_rdata (), s_sdata (), s_alpha_comm ();
static void s_alpha_text PARAMS ((int));
static void s_alpha_data PARAMS ((int));
static void s_alpha_align PARAMS ((int));
static void s_alpha_cons PARAMS ((int));
static void s_alpha_float_cons PARAMS ((int));
static int alpha_ip ();
static void emit_unaligned_io PARAMS ((char *, int, valueT, int));
static void emit_load_unal PARAMS ((int, valueT, int));
static void emit_store_unal PARAMS ((int, valueT, int));
static void emit_byte_manip_r PARAMS ((char *, int, int, int, int, int));
static void emit_extract_r PARAMS ((int, int, int, int, int));
static void emit_insert_r PARAMS ((int, int, int, int, int));
static void emit_mask_r PARAMS ((int, int, int, int, int));
static void emit_sign_extend PARAMS ((int, int));
static void emit_bis_r PARAMS ((int, int, int));
static int build_mem PARAMS ((int, int, int, bfd_signed_vma));
static int build_operate_n PARAMS ((int, int, int, int, int));
static void emit_sll_n PARAMS ((int, int, int));
static void emit_ldah_num PARAMS ((int, bfd_vma, int));
static void emit_addq_r PARAMS ((int, int, int));
static void emit_lda_n PARAMS ((int, bfd_vma, int));
static void emit_add64 PARAMS ((int, int, bfd_vma));
static int in_range_signed PARAMS ((bfd_vma, int));
static void alpha_align PARAMS ((int, int, symbolS *));
const pseudo_typeS md_pseudo_table[] =
{
{"common", s_comm, 0}, /* is this used? */
{"comm", s_alpha_comm, 0}, /* osf1 compiler does this */
{"text", s_alpha_text, 0},
{"data", s_alpha_data, 0},
{"rdata", s_rdata, 0},
{"sdata", s_sdata, 0},
{"gprel32", s_gprel32, 0},
{"t_floating", s_alpha_float_cons, 'd'},
{"s_floating", s_alpha_float_cons, 'f'},
{"f_floating", s_alpha_float_cons, 'F'},
{"g_floating", s_alpha_float_cons, 'G'},
{"d_floating", s_alpha_float_cons, 'D'},
{"proc", s_proc, 0},
{"aproc", s_proc, 1},
{"set", s_alpha_set, 0},
{"reguse", s_ignore, 0},
{"livereg", s_ignore, 0},
{"base", s_base, 0}, /*??*/
{"option", s_ignore, 0},
{"prologue", s_ignore, 0},
{"aent", s_ignore, 0},
{"ugen", s_ignore, 0},
{"align", s_alpha_align, 0},
{"byte", s_alpha_cons, 0},
{"hword", s_alpha_cons, 1},
{"int", s_alpha_cons, 2},
{"long", s_alpha_cons, 2},
{"octa", s_alpha_cons, 4},
{"quad", s_alpha_cons, 3},
{"short", s_alpha_cons, 1},
{"word", s_alpha_cons, 1},
{"double", s_alpha_float_cons, 'd'},
{"float", s_alpha_float_cons, 'f'},
{"single", s_alpha_float_cons, 'f'},
/* We don't do any optimizing, so we can safely ignore these. */
{"noalias", s_ignore, 0},
{"alias", s_ignore, 0},
{NULL, 0, 0},
};
#define SA 21 /* shift for register Ra */
#define SB 16 /* shift for register Rb */
#define SC 0 /* shift for register Rc */
#define SN 13 /* shift for 8 bit immediate # */
#define T9 23
#define T10 24
#define T11 25
#define T12 26
#define RA 26 /* note: same as T12 */
#define PV 27
#define AT 28
#define GP 29
#define SP 30
#define ZERO 31
#define OPCODE(X) (((X) >> 26) & 0x3f)
#define OP_FCN(X) (((X) >> 5) & 0x7f)
#ifndef FIRST_32BIT_QUADRANT
#define FIRST_32BIT_QUADRANT 0
#endif
int first_32bit_quadrant = FIRST_32BIT_QUADRANT;
int base_register = FIRST_32BIT_QUADRANT ? ZERO : GP;
int no_mixed_code = 0;
int nofloats = 0;
/* This array holds the chars that always start a comment. If the
pre-processor is disabled, these aren't very useful */
const char comment_chars[] = "#";
/* This array holds the chars that only start a comment at the beginning of
a line. If the line seems to have the form '# 123 filename'
.line and .file directives will appear in the pre-processed output */
/* Note that input_file.c hand checks for '#' at the beginning of the
first line of the input file. This is because the compiler outputs
#NO_APP at the beginning of its output. */
/* Also note that C style comments are always recognized. */
const char line_comment_chars[] = "#!";
/* Chars that can be used to separate mant from exp in floating point nums */
const char EXP_CHARS[] = "eE";
const char line_separator_chars[1];
/* Chars that mean this number is a floating point constant, as in
"0f12.456" or "0d1.2345e12". */
/* @@ Do all of these really get used on the alpha?? */
char FLT_CHARS[] = "rRsSfFdDxXpP";
/* Also be aware that MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT may have to be
changed in read.c. Ideally it shouldn't have to know about it at all,
but nothing is ideal around here. */
struct reloc_data {
expressionS exp;
int pcrel;
bfd_reloc_code_real_type code;
};
/* Occasionally, two relocations will be desired for one address.
Mainly only in cases like "jsr $r,foo" where we want both a LITUSE
and a HINT reloc. */
#define MAX_RELOCS 2
struct alpha_it {
unsigned long opcode; /* need at least 32 bits */
struct reloc_data reloc[MAX_RELOCS];
};
static void getExpression (char *str, struct alpha_it *insn);
static char *expr_end;
#define note_gpreg(R) (alpha_gprmask |= (1 << (R)))
#define note_fpreg(R) (alpha_fprmask |= (1 << (R)))
int
tc_get_register (frame)
int frame;
{
int framereg = SP;
SKIP_WHITESPACE ();
if (*input_line_pointer == '$')
{
input_line_pointer++;
if (input_line_pointer[0] == 's'
&& input_line_pointer[1] == 'p')
{
input_line_pointer += 2;
framereg = SP;
}
else
framereg = get_absolute_expression ();
framereg &= 31; /* ? */
}
else
as_warn ("frame reg expected, using $%d.", framereg);
note_gpreg (framereg);
return framereg;
}
/* Handle the .text pseudo-op. This is like the usual one, but it
clears insn_label and restores auto alignment. */
static void
s_alpha_text (i)
int i;
{
s_text (i);
insn_label = NULL;
auto_align = 1;
}
/* Handle the .data pseudo-op. This is like the usual one, but it
clears insn_label and restores auto alignment. */
static void
s_alpha_data (i)
int i;
{
s_data (i);
insn_label = NULL;
auto_align = 1;
}
static void
s_rdata (ignore)
int ignore;
{
int temp;
temp = get_absolute_expression ();
#if 0
if (!rdata)
rdata = subseg_get (".rdata", 0);
subseg_set (rdata, (subsegT) temp);
#else
rdata = subseg_new (".rdata", 0);
#endif
demand_empty_rest_of_line ();
insn_label = NULL;
auto_align = 1;
}
static void
s_sdata (ignore)
int ignore;
{
int temp;
temp = get_absolute_expression ();
#if 0
if (!sdata)
sdata = subseg_get (".sdata", 0);
subseg_set (sdata, (subsegT) temp);
#else
sdata = subseg_new (".sdata", 0);
#endif
demand_empty_rest_of_line ();
insn_label = NULL;
auto_align = 1;
}
static void
s_alpha_comm (ignore)
int ignore;
{
register char *name;
register char c;
register char *p;
offsetT temp;
register symbolS *symbolP;
name = input_line_pointer;
c = get_symbol_end ();
/* just after name is now '\0' */
p = input_line_pointer;
*p = c;
SKIP_WHITESPACE ();
/* Alpha OSF/1 compiler doesn't provide the comma, gcc does. */
if (*input_line_pointer == ',')
{
input_line_pointer++;
SKIP_WHITESPACE ();
}
if ((temp = get_absolute_expression ()) < 0)
{
as_warn (".COMMon length (%ld.) <0! Ignored.", (long) temp);
ignore_rest_of_line ();
return;
}
*p = 0;
symbolP = symbol_find_or_make (name);
*p = c;
if (S_IS_DEFINED (symbolP))
{
as_bad ("Ignoring attempt to re-define symbol");
ignore_rest_of_line ();
return;
}
if (S_GET_VALUE (symbolP))
{
if (S_GET_VALUE (symbolP) != (valueT) temp)
as_bad ("Length of .comm \"%s\" is already %ld. Not changed to %ld.",
S_GET_NAME (symbolP),
(long) S_GET_VALUE (symbolP),
(long) temp);
}
else
{
S_SET_VALUE (symbolP, (valueT) temp);
S_SET_EXTERNAL (symbolP);
}
know (symbolP->sy_frag == &zero_address_frag);
demand_empty_rest_of_line ();
}
arelent *
tc_gen_reloc (sec, fixp)
asection *sec;
fixS *fixp;
{
arelent *reloc;
reloc = (arelent *) bfd_alloc_by_size_t (stdoutput, sizeof (arelent));
reloc->sym_ptr_ptr = &fixp->fx_addsy->bsym;
reloc->address = fixp->fx_frag->fr_address + fixp->fx_where;
if (fixp->fx_r_type > BFD_RELOC_UNUSED)
abort ();
if (fixp->fx_r_type == BFD_RELOC_ALPHA_GPDISP_HI16)
{
if (!gpdisp_hi16_howto)
gpdisp_hi16_howto = bfd_reloc_type_lookup (stdoutput,
fixp->fx_r_type);
reloc->howto = gpdisp_hi16_howto;
}
else
reloc->howto = bfd_reloc_type_lookup (stdoutput, fixp->fx_r_type);
if (reloc->howto == NULL)
{
as_bad_where (fixp->fx_file, fixp->fx_line,
"cannot represent `%s' relocation in object file",
bfd_get_reloc_code_name (fixp->fx_r_type));
return NULL;
}
if (!fixp->fx_pcrel != !reloc->howto->pc_relative)
{
as_fatal ("internal error? cannot generate `%s' relocation",
bfd_get_reloc_code_name (fixp->fx_r_type));
}
assert (!fixp->fx_pcrel == !reloc->howto->pc_relative);
if (fixp->fx_r_type == BFD_RELOC_ALPHA_LITERAL)
{
/* fake out bfd_perform_relocation. sigh */
reloc->addend = -alpha_gp_value;
}
else if (reloc->howto->pc_relative && reloc->howto->pcrel_offset)
{
reloc->addend = fixp->fx_offset - reloc->address;
}
else
reloc->addend = fixp->fx_offset;
return reloc;
}
static void
s_base ()
{
if (first_32bit_quadrant)
{
/* not fatal, but it might not work in the end */
as_warn ("File overrides no-base-register option.");
first_32bit_quadrant = 0;
}
SKIP_WHITESPACE ();
if (*input_line_pointer == '$')
{ /* $rNN form */
input_line_pointer++;
if (*input_line_pointer == 'r')
input_line_pointer++;
}
base_register = get_absolute_expression ();
if (base_register < 0 || base_register > 31)
{
base_register = GP;
as_warn ("Bad base register, using $%d.", base_register);
}
demand_empty_rest_of_line ();
}
static int in_range_signed (val, nbits)
bfd_vma val;
int nbits;
{
/* Look at top bit of value that would be stored, figure out how it
would be extended by the hardware, and see if that matches the
original supplied value. */
bfd_vma mask;
bfd_vma one = 1;
bfd_vma top_bit, stored_value, missing_bits;
mask = (one << nbits) - 1;
stored_value = val & mask;
top_bit = stored_value & (one << (nbits - 1));
missing_bits = val & ~mask;
/* will sign-extend */
if (top_bit)
{
/* all remaining bits beyond mask should be one */
missing_bits |= mask;
return missing_bits + 1 == 0;
}
else
{
/* all other bits should be zero */
return missing_bits == 0;
}
}
#if 0
static int in_range_unsigned (val, nbits)
bfd_vma val;
int nbits;
{
/* Look at top bit of value that would be stored, figure out how it
would be extended by the hardware, and see if that matches the
original supplied value. */
bfd_vma mask;
bfd_vma one = 1;
bfd_vma top_bit, stored_value, missing_bits;
mask = (one << nbits) - 1;
stored_value = val & mask;
top_bit = stored_value & (one << nbits - 1);
missing_bits = val & ~mask;
return missing_bits == 0;
}
#endif
static void
s_gprel32 ()
{
expressionS e;
char *p;
SKIP_WHITESPACE ();
expression (&e);
switch (e.X_op)
{
case O_constant:
e.X_add_symbol = section_symbol (absolute_section);
/* fall through */
case O_symbol:
e.X_op = O_subtract;
e.X_op_symbol = gp;
break;
default:
abort ();
}
if (auto_align)
alpha_align (2, 0, insn_label);
p = frag_more (4);
memset (p, 0, 4);
fix_new_exp (frag_now, p - frag_now->fr_literal, 4, &e, 0,
BFD_RELOC_GPREL32);
insn_label = NULL;
}
static void
create_literal_section (secp, name)
segT *secp;
const char *name;
{
segT current_section = now_seg;
int current_subsec = now_subseg;
segT new_sec;
*secp = new_sec = subseg_new (name, 0);
subseg_set (current_section, current_subsec);
bfd_set_section_alignment (stdoutput, new_sec, 3);
bfd_set_section_flags (stdoutput, new_sec,
SEC_RELOC | SEC_ALLOC | SEC_LOAD | SEC_READONLY
| SEC_DATA);
}
static valueT
get_lit8_offset (val)
bfd_vma val;
{
valueT retval;
if (lit8_sec == 0)
{
create_literal_section (&lit8_sec, ".lit8");
lit8_sym = section_symbol (lit8_sec);
}
retval = add_to_literal_pool ((symbolS *) 0, val, lit8_sec, 8);
if (retval >= 0xfff0)
as_fatal ("overflow in fp literal (.lit8) table");
return retval;
}
static valueT
get_lit4_offset (val)
bfd_vma val;
{
valueT retval;
if (lit4_sec == 0)
{
create_literal_section (&lit4_sec, ".lit4");
lit4_sym = section_symbol (lit4_sec);
}
retval = add_to_literal_pool ((symbolS *) 0, val, lit4_sec, 4);
if (retval >= 0xfff0)
as_fatal ("overflow in fp literal (.lit4) table");
return retval;
}
static struct alpha_it clear_insn;
/* This function is called once, at assembler startup time. It should
set up all the tables, etc. that the MD part of the assembler will
need, that can be determined before arguments are parsed. */
void
md_begin ()
{
const char *retval, *name;
unsigned int i = 0;
op_hash = hash_new ();
for (i = 0; i < NUMOPCODES; )
{
const char *name = alpha_opcodes[i].name;
retval = hash_insert (op_hash, name, (PTR) &alpha_opcodes[i]);
if (retval)
as_fatal ("internal error: can't hash opcode `%s': %s",
name, retval);
do
i++;
while (i < NUMOPCODES
&& (alpha_opcodes[i].name == name
|| !strcmp (alpha_opcodes[i].name, name)));
}
/* Some opcodes include modifiers of various sorts with a "/mod"
syntax, like the architecture documentation suggests. However,
for use with gcc at least, we also need to access those same
opcodes without the "/". */
for (i = 0; i < NUMOPCODES; )
{
name = alpha_opcodes[i].name;
if (strchr (name, '/'))
{
char *p = xmalloc (strlen (name));
const char *q = name;
char *q2 = p;
for (; *q; q++)
if (*q != '/')
*q2++ = *q;
*q2++ = 0;
retval = hash_insert (op_hash, p, (PTR) &alpha_opcodes[i]);
/* Ignore failures -- the opcode table does duplicate some
variants in different forms, like "hw_stq" and "hw_st/q".
Maybe the variants can be eliminated, and this error
checking restored. */
}
do
i++;
while (i < NUMOPCODES
&& (alpha_opcodes[i].name == name
|| !strcmp (alpha_opcodes[i].name, name)));
}
lituse_basereg.X_op = O_constant;
lituse_basereg.X_add_number = 1;
lituse_byteoff.X_op = O_constant;
lituse_byteoff.X_add_number = 2;
lituse_jsr.X_op = O_constant;
lituse_jsr.X_add_number = 3;
/* So .sbss will get used for tiny objects. */
bfd_set_gp_size (stdoutput, 8);
create_literal_section (&lita_sec, ".lita");
/* For handling the GP, create a symbol that won't be output in the
symbol table. We'll edit it out of relocs later. */
gp = symbol_create ("<GP value>", lita_sec, 0x8000, &zero_address_frag);
memset (&clear_insn, 0, sizeof (clear_insn));
for (i = 0; i < MAX_RELOCS; i++)
clear_insn.reloc[i].code = BFD_RELOC_NONE;
}
int optnum = 1;
static void
emit_insn (insn)
struct alpha_it *insn;
{
char *toP;
int j;
toP = frag_more (4);
/* put out the opcode */
md_number_to_chars (toP, insn->opcode, 4);
/* put out the symbol-dependent stuff */
for (j = 0; j < MAX_RELOCS; j++)
{
struct reloc_data *r = &insn->reloc[j];
fixS *f;
if (r->code != BFD_RELOC_NONE)
{
if (r->exp.X_op == O_constant)
{
r->exp.X_add_symbol = section_symbol (absolute_section);
r->exp.X_op = O_symbol;
}
f = fix_new_exp (frag_now, (toP - frag_now->fr_literal), 4,
&r->exp, r->pcrel, r->code);
if (r->code == BFD_RELOC_ALPHA_GPDISP_LO16)
{
static bit_fixS cookie;
/* @@ This'll make the range checking in write.c shut up. */
f->fx_bit_fixP = &cookie;
}
}
}
insn_label = NULL;
}
void
md_assemble (str)
char *str;
{
int i, count;
#define MAX_INSNS 5
struct alpha_it insns[MAX_INSNS];
count = alpha_ip (str, insns);
if (count <= 0)
return;
for (i = 0; i < count; i++)
emit_insn (&insns[i]);
}
static inline void
maybe_set_gp (sec)
asection *sec;
{
bfd_vma vma;
if (!sec)
return;
vma = bfd_get_section_vma (foo, sec);
if (vma && vma < alpha_gp_value)
alpha_gp_value = vma;
}
static void
select_gp_value ()
{
if (alpha_gp_value != 0)
abort ();
/* Get minus-one in whatever width... */
alpha_gp_value = 0; alpha_gp_value--;
/* Select the smallest VMA of these existing sections. */
maybe_set_gp (lita_sec);
/* maybe_set_gp (sdata); Was disabled before -- should we use it? */
#if 0
maybe_set_gp (lit8_sec);
maybe_set_gp (lit4_sec);
#endif
alpha_gp_value += GP_ADJUSTMENT;
S_SET_VALUE (gp, alpha_gp_value);
#ifdef DEBUG1
printf ("Chose GP value of %lx\n", alpha_gp_value);
#endif
}
int
alpha_force_relocation (f)
fixS *f;
{
switch (f->fx_r_type)
{
case BFD_RELOC_ALPHA_GPDISP_HI16:
case BFD_RELOC_ALPHA_GPDISP_LO16:
case BFD_RELOC_ALPHA_LITERAL:
case BFD_RELOC_ALPHA_LITUSE:
case BFD_RELOC_GPREL32:
return 1;
case BFD_RELOC_ALPHA_HINT:
case BFD_RELOC_64:
case BFD_RELOC_32:
case BFD_RELOC_16:
case BFD_RELOC_8:
case BFD_RELOC_23_PCREL_S2:
case BFD_RELOC_14:
case BFD_RELOC_26:
case BFD_RELOC_12_PCREL:
return 0;
default:
abort ();
return 0;
}
}
int
alpha_fix_adjustable (f)
fixS *f;
{
/* Are there any relocation types for which we must generate a reloc
but we can adjust the values contained within it? */
switch (f->fx_r_type)
{
case BFD_RELOC_ALPHA_GPDISP_HI16:
case BFD_RELOC_ALPHA_GPDISP_LO16:
return 0;
case BFD_RELOC_GPREL32:
return 1;
default:
return !alpha_force_relocation (f);
}
/*NOTREACHED*/
}
valueT
md_section_align (seg, size)
segT seg;
valueT size;
{
#ifdef OBJ_ECOFF
/* This should probably be handled within BFD, or by pulling the
number from BFD at least. */
#define MIN 15
size += MIN;
size &= ~MIN;
#endif
return size;
}
/* Add this thing to the .lita section and produce a LITERAL reloc referring
to it. */
/* Are we currently eligible to emit a LITUSE reloc for the literal
references just generated? */
static int lituse_pending;
static void
load_symbol_address (reg, insn)
int reg;
struct alpha_it *insn;
{
static symbolS *lita_sym;
int x;
valueT retval;
if (!lita_sym)
{
lita_sym = section_symbol (lita_sec);
S_CLEAR_EXTERNAL (lita_sym);
}
retval = add_to_literal_pool (insn->reloc[0].exp.X_add_symbol,
insn->reloc[0].exp.X_add_number,
lita_sec, 8);
/* Now emit a LITERAL relocation for the original section. */
insn->reloc[0].exp.X_op = O_symbol;
insn->reloc[0].exp.X_add_symbol = lita_sym;
insn->reloc[0].exp.X_add_number = retval;
insn->reloc[0].code = BFD_RELOC_ALPHA_LITERAL;
lituse_pending = 1;
if (retval == 0x8000)
/* Overflow? */
as_fatal ("overflow in literal (.lita) table");
x = retval;
if (addr32)
insn->opcode = (0xa0000000 /* ldl */
| (reg << SA)
| (base_register << SB)
| (x & 0xffff));
else
insn->opcode = (0xa4000000 /* ldq */
| (reg << SA)
| (base_register << SB)
| (x & 0xffff));
note_gpreg (base_register);
}
/* To load an address with a single instruction,
emit a LITERAL reloc in this section, and a REFQUAD
for the .lita section, so that we'll be able to access
it via $gp:
lda REG, xx -> ldq REG, -32752(gp)
lda REG, xx+4 -> ldq REG, -32752(gp)
lda REG, 4(REG)
The offsets need to start near -0x8000, and the generated LITERAL
relocations should negate the offset. I don't completely grok the
scheme yet. */
static int
load_expression (reg, insn)
int reg;
struct alpha_it *insn;
{
valueT addend, addendhi, addendlo;
int num_insns = 1;
if (insn->reloc[0].exp.X_add_symbol->bsym->flags & BSF_SECTION_SYM)
{
addend = 0;
}
else
{
addend = insn->reloc[0].exp.X_add_number;
insn->reloc[0].exp.X_add_number = 0;
}
load_symbol_address (reg, insn);
if (addend)
{
if ((addend & ~0x7fffffff) != 0
&& (addend & ~0x7fffffff) + 0x80000000 != 0)
{
as_bad ("assembler not prepared to handle constants >32 bits yet");
addend = 0;
}
addendlo = addend & 0xffff;
addend -= addendlo;
addendhi = addend >> 16;
if (addendlo & 0x8000)
addendhi++;
/* It appears that the BASEREG LITUSE reloc should not be used on
an LDAH instruction. */
if (addendlo)
{
insn[1].opcode = (0x20000000 /* lda */
| (reg << SA)
| (reg << SB)
| (addendlo & 0xffff));
insn[1].reloc[0].code = BFD_RELOC_ALPHA_LITUSE;
insn[1].reloc[0].exp = lituse_basereg;
num_insns++;
}
if (addendhi)
{
insn[num_insns].opcode = (0x24000000
| (reg << SA)
| (reg << SB)
| (addendhi & 0xffff));
num_insns++;
}
if (num_insns == 1)
abort ();
lituse_pending = 0;
}
return num_insns;
}
static inline void
getExpression (str, this_insn)
char *str;
struct alpha_it *this_insn;
{
char *save_in;
segT seg;
#if 0 /* Not converted to bfd yet, and I don't think we need them
for ECOFF. Re-adding a.out support will probably require
them though. */
static const struct am {
char *name;
bfd_reloc_code_real_type reloc;
} macro[] = {
{ "hi", RELOC_48_63 },
{ "lo", RELOC_0_15 },
{ "ml", RELOC_16_31 },
{ "mh", RELOC_32_47 },
{ "uhi", RELOC_U_48_63 },
{ "uml", RELOC_U_16_31 },
{ "umh", RELOC_U_32_47 },
{ 0, }
};
/* Handle macros: "%macroname(expr)" */
if (*str == '%')
{
struct am *m;
char *p, *q;
str++;
m = ¯o[0];
while (q = m->name)
{
p = str;
while (*q && *p == *q)
p++, q++;
if (*q == 0)
break;
m++;
}
if (q)
{
str = p; /* keep the '(' */
this_insn->reloc = m->reloc;
}
}
#endif
save_in = input_line_pointer;
input_line_pointer = str;
seg = expression (&this_insn->reloc[0].exp);
/* XXX validate seg and exp, make sure they're reasonable */
expr_end = input_line_pointer;
input_line_pointer = save_in;
}
static void
emit_unaligned_io (dir, addr_reg, addr_offset, reg)
char *dir;
int addr_reg, reg;
valueT addr_offset;
{
char buf[90];
sprintf (buf, "%sq_u $%d,%ld($%d)", dir, reg, (long) addr_offset, addr_reg);
md_assemble (buf);
}
static void
emit_load_unal (addr_reg, addr_offset, reg)
int addr_reg, reg;
valueT addr_offset;
{
emit_unaligned_io ("ld", addr_reg, addr_offset, reg);
}
static void
emit_store_unal (addr_reg, addr_offset, reg)
int addr_reg, reg;
valueT addr_offset;
{
emit_unaligned_io ("st", addr_reg, addr_offset, reg);
}
static void
emit_byte_manip_r (op, in, mask, out, mode, which)
char *op;
int in, mask, out, mode, which;
{
char buf[90];
sprintf (buf, "%s%c%c $%d,$%d,$%d", op, mode, which, in, mask, out);
md_assemble (buf);
}
static void
emit_extract_r (in, mask, out, mode, which)
int in, mask, out, mode, which;
{
emit_byte_manip_r ("ext", in, mask, out, mode, which);
}
static void
emit_insert_r (in, mask, out, mode, which)
int in, mask, out, mode, which;
{
emit_byte_manip_r ("ins", in, mask, out, mode, which);
}
static void
emit_mask_r (in, mask, out, mode, which)
int in, mask, out, mode, which;
{
emit_byte_manip_r ("msk", in, mask, out, mode, which);
}
static void
emit_sign_extend (reg, size)
int reg, size;
{
char buf[90];
sprintf (buf, "sll $%d,0x%x,$%d", reg, 64 - size, reg);
md_assemble (buf);
sprintf (buf, "sra $%d,0x%x,$%d", reg, 64 - size, reg);
md_assemble (buf);
}
static void
emit_bis_r (in1, in2, out)
int in1, in2, out;
{
char buf[90];
sprintf (buf, "bis $%d,$%d,$%d", in1, in2, out);
md_assemble (buf);
}
static int
build_mem (opc, ra, rb, disp)
int opc, ra, rb;
bfd_signed_vma disp;
{
if ((disp >> 15) != 0
&& (disp >> 15) + 1 != 0)
abort ();
return ((opc << 26) | (ra << SA) | (rb << SB) | (disp & 0xffff));
}
static int
build_operate_n (opc, fn, ra, lit, rc)
int opc, fn, ra, rc;
int lit;
{
if (lit & ~0xff)
abort ();
return ((opc << 26) | (fn << 5) | (ra << SA) | (lit << SN) | (1 << 12) | (rc << SC));
}
static void
emit_sll_n (dest, disp, src)
int dest, disp, src;
{
struct alpha_it insn = clear_insn;
insn.opcode = build_operate_n (0x12, 0x39, src, disp, dest);
emit_insn (&insn);
}
static void
emit_ldah_num (dest, addend, src)
int dest, src;
bfd_vma addend;
{
struct alpha_it insn = clear_insn;
insn.opcode = build_mem (0x09, dest, src, addend);
emit_insn (&insn);
}
static void
emit_addq_r (in1, in2, out)
int in1, in2, out;
{
struct alpha_it insn = clear_insn;
insn.opcode = 0x40000400 | (in1 << SA) | (in2 << SB) | (out << SC);
emit_insn (&insn);
}
static void
emit_lda_n (dest, addend, src)
int dest, src;
bfd_vma addend;
{
struct alpha_it insn = clear_insn;
insn.opcode = build_mem (0x08, dest, src, addend);
emit_insn (&insn);
}
static void
emit_add64 (in, out, num)
int in, out;
bfd_vma num;
{
bfd_signed_vma snum = num;
if (in_range_signed (num, 16))
{
emit_lda_n (out, num, in);
return;
}
if ((num & 0xffff) == 0
&& in == ZERO
&& in_range_signed (snum >> 16, 16))
{
emit_ldah_num (out, snum >> 16, in);
return;
}
/* I'm not sure this one is getting invoked when it could. */
if ((num & 1) == 0 && in == ZERO)
{
if (in_range_signed (snum >> 1, 16))
{
emit_lda_n (out, snum >> 1, in);
emit_addq_r (out, out, out);
return;
}
else if (num & 0x1fffe == 0
&& in_range_signed (snum >> 17, 16))
{
emit_ldah_num (out, snum >> 17, in);
emit_addq_r (out, out, out);
return;
}
}
if (in_range_signed (num, 32))
{
bfd_vma lo = num & 0xffff;
if (lo & 0x8000)
lo -= 0x10000;
num -= lo;
emit_ldah_num (out, snum >> 16, in);
if (lo)
emit_lda_n (out, lo, out);
return;
}
if (in != ZERO && in != AT && out != AT && at_ok)
{
emit_add64 (ZERO, AT, num);
emit_addq_r (AT, in, out);
return;
}
if (in != ZERO)
as_bad ("load expression too complex to expand");
/* Could check also for loading 16- or 32-bit value and shifting by
arbitrary displacement. */
{
bfd_vma lo = snum & 0xffffffff;
if (lo & 0x80000000)
lo -= ((bfd_vma)0x10000000 << 4);
snum -= lo;
emit_add64 (ZERO, out, snum >> 32);
emit_sll_n (out, 32, out);
if (lo != 0)
emit_add64 (out, out, lo);
}
}
static int
alpha_ip (str, insns)
char *str;
struct alpha_it insns[];
{
char *s;
const char *args;
char c;
unsigned long i;
struct alpha_opcode *pattern;
char *argsStart;
unsigned int opcode;
unsigned int mask = 0;
int match = 0, num_gen = 1;
int comma = 0;
int do_add64, add64_in = 0, add64_out = 0;
bfd_vma add64_addend = 0;
for (s = str;
islower (*s) || *s == '_' || *s == '/' || *s == '4' || *s == '8';
++s)
;
switch (*s)
{
case '\0':
break;
case ',':
comma = 1;
/*FALLTHROUGH*/
case ' ':
*s++ = '\0';
break;
default:
as_fatal ("Unknown opcode: `%s'", str);
}
if ((pattern = (struct alpha_opcode *) hash_find (op_hash, str)) == NULL)
{
as_bad ("Unknown opcode: `%s'", str);
return -1;
}
if (comma)
*--s = ',';
argsStart = s;
for (;;)
{
do_add64 = 0;
opcode = pattern->match;
num_gen = 1;
for (i = 0; i < MAX_INSNS; i++)
insns[i] = clear_insn;
/* Build the opcode, checking as we go to make sure that the
operands match. */
for (args = pattern->args;; ++args)
{
switch (*args)
{
case '\0': /* end of args */
if (*s == '\0')
{
match = 1;
}
break;
case '+':
if (*s == '+')
{
++s;
continue;
}
if (*s == '-')
{
continue;
}
break;
case '(': /* these must match exactly */
case ')':
case ',':
case ' ':
case '0':
if (*s++ == *args)
continue;
break;
case '1': /* next operand must be a register */
case '2':
case '3':
case 'r':
case 'R':
if (*s++ == '$')
{
switch (c = *s++)
{
case 'a': /* $at: as temporary */
if (*s++ != 't')
goto error;
mask = AT;
break;
case 'g': /* $gp: base register */
if (*s++ != 'p')
goto error;
mask = base_register;
break;
case 's': /* $sp: stack pointer */
if (*s++ != 'p')
goto error;
mask = SP;
break;
case 'r': /* any register */
if (!isdigit (c = *s++))
{
goto error;
}
/* FALLTHROUGH */
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
if (isdigit (*s))
{
if ((c = 10 * (c - '0') + (*s++ - '0')) >= 32)
{
goto error;
}
}
else
{
c -= '0';
}
if ((c == GP) && first_32bit_quadrant)
c = ZERO;
mask = c;
break;
default:
goto error;
}
note_gpreg (mask);
/* Got the register, now figure out where it goes in
the opcode. */
doregister:
switch (*args)
{
case '1':
case 'e':
opcode |= mask << SA;
continue;
case '2':
case 'f':
opcode |= mask << SB;
continue;
case '3':
case 'g':
opcode |= mask;
continue;
case 'r':
opcode |= (mask << SA) | mask;
continue;
case 'R': /* ra and rb are the same */
opcode |= (mask << SA) | (mask << SB);
continue;
case 'E':
opcode |= (mask << SA) | (mask << SB) | (mask);
continue;
}
}
break;
case 'e': /* next operand is a floating point register */
case 'f':
case 'g':
case 'E':
if (*s++ == '$' && *s++ == 'f' && isdigit (*s))
{
mask = *s++;
if (isdigit (*s))
{
mask = 10 * (mask - '0') + (*s++ - '0');
if (mask >= 32)
{
break;
}
}
else
{
mask -= '0';
}
note_fpreg (mask);
/* same encoding as gp registers */
goto doregister;
}
break;
#if 0
case 'h': /* bits 16..31 */
insns[0].reloc = RELOC_16_31;
goto immediate;
#endif
case 'l': /* bits 0..15 */
insns[0].reloc[0].code = BFD_RELOC_16;
goto immediate;
case 'L': /* 21 bit PC relative immediate */
insns[0].reloc[0].code = BFD_RELOC_23_PCREL_S2;
insns[0].reloc[0].pcrel = 1;
goto immediate;
case 'i': /* 14 bit immediate */
if (OPCODE (opcode) != 0x1a)
/* Not a jmp variant?? */
abort ();
else if (opcode & 0x8000)
/* ret or jsr_coroutine */
{
insns[0].reloc[0].code = BFD_RELOC_14;
insns[0].reloc[0].pcrel = 0;
}
else
/* jmp or jsr */
{
insns[0].reloc[0].code = BFD_RELOC_ALPHA_HINT;
insns[0].reloc[0].pcrel = 1;
}
goto immediate;
case 'b': /* 8 bit immediate */
insns[0].reloc[0].code = BFD_RELOC_8;
goto immediate;
case 'I': /* 26 bit immediate, for PALcode */
insns[0].reloc[0].code = BFD_RELOC_26;
goto immediate;
case 't': /* 12 bit displacement, for PALcode */
insns[0].reloc[0].code = BFD_RELOC_12_PCREL;
goto immediate;
case '8': /* 8 bit 0...7 */
insns[0].reloc[0].code = BFD_RELOC_8;
goto immediate;
immediate:
if (*s == ' ')
s++;
getExpression (s, &insns[0]);
s = expr_end;
/* Handle overflow in certain instructions by converting
to other instructions. */
if (insns[0].reloc[0].code == BFD_RELOC_8
&& insns[0].reloc[0].exp.X_op == O_constant
&& (insns[0].reloc[0].exp.X_add_number < 0
|| insns[0].reloc[0].exp.X_add_number > 0xff))
{
if (OPCODE (opcode) == 0x10
&& (OP_FCN (opcode) == 0x00 /* addl */
|| OP_FCN (opcode) == 0x40 /* addl/v */
|| OP_FCN (opcode) == 0x20 /* addq */
|| OP_FCN (opcode) == 0x60 /* addq/v */
|| OP_FCN (opcode) == 0x09 /* subl */
|| OP_FCN (opcode) == 0x49 /* subl/v */
|| OP_FCN (opcode) == 0x29 /* subq */
|| OP_FCN (opcode) == 0x69 /* subq/v */
|| OP_FCN (opcode) == 0x02 /* s4addl */
|| OP_FCN (opcode) == 0x22 /* s4addq */
|| OP_FCN (opcode) == 0x0b /* s4subl */
|| OP_FCN (opcode) == 0x2b /* s4subq */
|| OP_FCN (opcode) == 0x12 /* s8addl */
|| OP_FCN (opcode) == 0x32 /* s8addq */
|| OP_FCN (opcode) == 0x1b /* s8subl */
|| OP_FCN (opcode) == 0x3b /* s8subq */
)
/* Can we make it fit by negating? */
&& -insns[0].reloc[0].exp.X_add_number < 0xff
&& -insns[0].reloc[0].exp.X_add_number > 0)
{
opcode ^= 0x120; /* convert add<=>sub */
insns[0].reloc[0].exp.X_add_number *= -1;
}
else if (at_ok && macro_ok)
{
/* Constant value supplied, but it's too large. */
do_add64 = 1;
add64_in = ZERO;
add64_out = AT;
add64_addend = insns[0].reloc[0].exp.X_add_number;
opcode &= ~ 0x1000;
opcode |= (AT << SB);
insns[0].reloc[0].code = BFD_RELOC_NONE;
}
else
as_bad ("overflow in 8-bit literal field in `operate' format insn");
}
else if (insns[0].reloc[0].code == BFD_RELOC_16
&& insns[0].reloc[0].exp.X_op == O_constant
&& !in_range_signed (insns[0].reloc[0].exp.X_add_number,
16))
{
bfd_vma val = insns[0].reloc[0].exp.X_add_number;
if (OPCODE (opcode) == 0x08)
{
do_add64 = 1;
add64_in = ZERO;
add64_out = AT;
add64_addend = val;
opcode &= ~0x1000;
opcode |= (AT << SB);
insns[0].reloc[0].code = BFD_RELOC_NONE;
}
else if (OPCODE (opcode) == 0x09
&& in_range_signed (val >> 16, 16))
{
/* ldah with high operand - convert to low */
insns[0].reloc[0].exp.X_add_number >>= 16;
}
else
as_bad ("I don't know how to handle 32+ bit constants here yet, sorry.");
}
else if (insns[0].reloc[0].code == BFD_RELOC_32
&& insns[0].reloc[0].exp.X_op == O_constant)
{
bfd_vma val = insns[0].reloc[0].exp.X_add_number;
bfd_signed_vma sval = val;
if (val >> 32 != 0
&& sval >> 32 != 0
&& sval >> 32 != -1)
as_bad ("I don't know how to handle 64 bit constants here yet, sorry.");
}
continue;
case 'F':
{
int format, length, mode, i;
char temp[20 /*MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT*/];
char *err;
static const char formats[4] = "FGfd";
bfd_vma bits, offset;
char *old_input_line_pointer = input_line_pointer;
input_line_pointer = s;
SKIP_WHITESPACE ();
memset (temp, 0, sizeof (temp));
mode = (opcode >> 26) & 3;
format = formats[mode];
err = md_atof (format, temp, &length);
if (err)
{
as_bad ("Bad floating literal: %s", err);
bits = 0;
}
else
{
/* Generate little-endian number from byte sequence. */
bits = 0;
for (i = length - 1; i >= 0; i--)
bits += ((bfd_vma)(temp[i] & 0xff)) << (i * 8);
}
switch (length)
{
case 8:
offset = get_lit8_offset (bits) - 0x8000;
insns[0].reloc[0].exp.X_add_symbol = lit8_sym;
insns[0].reloc[0].exp.X_add_number = 0x8000;
break;
case 4:
offset = get_lit4_offset (bits) - 0x8000;
insns[0].reloc[0].exp.X_add_symbol = lit4_sym;
insns[0].reloc[0].exp.X_add_number = 0x8000;
break;
default:
abort ();
}
insns[0].reloc[0].exp.X_op = O_symbol;
offset &= 0xffff;
num_gen = load_expression (AT, &insns[0]);
if (lituse_pending)
{
insns[num_gen].reloc[0].code = BFD_RELOC_ALPHA_LITUSE;
insns[num_gen].reloc[0].exp = lituse_basereg;
lituse_pending = 0;
}
insns[num_gen++].opcode = opcode | (AT << SB) | offset;
opcode = insns[0].opcode;
s = input_line_pointer;
input_line_pointer = old_input_line_pointer;
}
continue;
/* The following two.. take advantage of the fact that
opcode already contains most of what we need to know.
We just prepend to the instr an "ldah
$r,%ml(expr)($base)" and turn this one (done later
after we return) into something like "stq
$r,%lo(expr)(at)" or "ldq $r,%lo(expr)($r)".
NOTE: This can fail later on at link time if the
offset from $base actually turns out to be more than
2**31 or 2**47 if use_large_offsets is set. */
case 'P': /* Addressing macros: PUT */
mask = AT; /* register 'at' */
/* fall through */
case 'G': /* Addressing macros: GET */
/* All it is missing is the expression, which is what we
will get now */
if (*s == ' ')
s++;
getExpression (s, &insns[0]);
s = expr_end;
/* Must check for "lda ..,number" too */
if (insns[0].reloc[0].exp.X_op == O_big)
{
as_warn ("Sorry, not yet. Put bignums in .data section yourself.");
return -1;
}
if (insns[0].reloc[0].exp.X_op == O_constant)
{
bfd_vma val = insns[0].reloc[0].exp.X_add_number;
bfd_vma top, low;
insns[0].reloc[0].code = BFD_RELOC_NONE;
insns[1].reloc[0].code = BFD_RELOC_NONE;
low = val & 0xffff;
if (low & 0x8000)
low -= 0x10000;
top = val - low;
if (top)
{
do_add64 = 1;
add64_in = ZERO;
add64_out = AT;
add64_addend = top;
opcode |= AT << SB;
}
else
opcode |= ZERO << SB;
opcode &= ~0x1000;
opcode |= low & 0xffff;
}
else if (insns[0].reloc[0].exp.X_op == O_symbol)
{
unsigned long old_opcode = opcode;
int tmp_reg = -1;
if (!macro_ok)
as_bad ("insn requires expansion but `nomacro' specified");
else if (*args == 'G')
tmp_reg = mask;
else if (!at_ok)
as_bad ("insn expansion requires AT use, but `noat' specified");
else
tmp_reg = AT;
num_gen = load_expression (tmp_reg, insns);
opcode = insns[0].opcode;
/* lda is opcode 8, 0x20000000, and the macros that use
this code have an opcode field of 0. The latter
require further processing, and we don't have the
true opcode here. */
if (OPCODE (old_opcode) != 0
&& OPCODE (old_opcode) != 0x08)
{
struct alpha_it *i;
i = &insns[num_gen++];
i->opcode = old_opcode | (tmp_reg << SB);
if (lituse_pending)
{
i->reloc[0].code = BFD_RELOC_ALPHA_LITUSE;
i->reloc[0].exp = lituse_basereg;
lituse_pending = 0;
}
}
}
else
{
/* Not a number */
num_gen = 2;
insns[1].reloc[0].exp = insns[0].reloc[0].exp;
/* Generate: ldah REG,x1(GP); OP ?,x0(REG) */
abort (); /* relocs need fixing */
#if 0
insns[1].reloc = RELOC_0_15;
insns[1].opcode = opcode | mask << SB;
insns[0].reloc = RELOC_16_31;
opcode = 0x24000000 /*ldah*/ | mask << SA | (base_register << SB);
#endif
}
continue;
/* Same failure modes as above, actually most of the
same code shared. */
case 'B': /* Builtins */
args++;
switch (*args)
{
case 'a': /* ldgp */
if (first_32bit_quadrant || no_mixed_code)
return -1;
switch (OUTPUT_FLAVOR)
{
case bfd_target_aout_flavour:
/* this is cmu's a.out version */
insns[0].reloc[0].code = BFD_RELOC_NONE;
/* generate "zap %r,0xf,%r" to take high 32 bits */
opcode |= 0x48001600 /* zap ?,#,?*/ | (0xf << SN);
break;
case bfd_target_ecoff_flavour:
/* Given "ldgp R1,N(R2)", turn it into something
like "ldah R1,###(R2) ; lda R1,###(R1)" with
appropriate constants and relocations. */
{
unsigned long r1, r2;
unsigned long addend = 0;
num_gen = 2;
r2 = mask;
r1 = opcode & 0x3f;
insns[0].reloc[0].code = BFD_RELOC_ALPHA_GPDISP_HI16;
insns[0].reloc[0].pcrel = 1;
insns[0].reloc[0].exp.X_op = O_symbol;
insns[0].reloc[0].exp.X_add_symbol = gp;
insns[0].reloc[0].exp.X_add_number = 0;
insns[0].opcode = (0x24000000 /* ldah */
| (r1 << SA)
| (r2 << SB));
insns[1].reloc[0].code = BFD_RELOC_ALPHA_GPDISP_LO16;
insns[1].reloc[0].exp.X_op = O_symbol;
insns[1].reloc[0].exp.X_add_symbol = gp;
insns[1].reloc[0].exp.X_add_number = 4;
insns[1].reloc[0].pcrel = 1;
insns[1].opcode = 0x20000000 | (r1 << SA) | (r1 << SB);
opcode = insns[0].opcode;
/* merge in addend */
insns[1].opcode |= addend & 0xffff;
insns[0].opcode |= ((addend >> 16)
+ (addend & 0x8000 ? 1 : 0));
if (r2 == PV)
ecoff_set_gp_prolog_size (0);
}
break;
default:
abort ();
}
continue;
case 'b': /* setgp */
switch (OUTPUT_FLAVOR)
{
case bfd_target_aout_flavour:
/* generate "zap %r,0xf,$gp" to take high 32 bits */
opcode |= 0x48001600 /* zap ?,#,?*/
| (0xf << SN) | (base_register);
break;
default:
abort ();
}
continue;
case 'c': /* jsr $r,foo becomes
lda $27,foo
jsr $r,($27),foo
Register 27, t12, is used by convention
here. */
{
struct alpha_it *jsr;
expressionS etmp;
struct reloc_data *r;
/* We still have to parse the function name */
if (*s == ' ')
s++;
getExpression (s, &insns[0]);
etmp = insns[0].reloc[0].exp;
s = expr_end;
num_gen = load_expression (PV, &insns[0]);
note_gpreg (PV);
jsr = &insns[num_gen++];
jsr->opcode = (pattern->match
| (mask << SA)
| (PV << SB)
| 0);
if (lituse_pending)
{
/* LITUSE wasn't emitted yet */
jsr->reloc[0].code = BFD_RELOC_ALPHA_LITUSE;
jsr->reloc[0].exp = lituse_jsr;
r = &jsr->reloc[1];
lituse_pending = 0;
}
else
r = &jsr->reloc[0];
r->exp = etmp;
r->code = BFD_RELOC_ALPHA_HINT;
r->pcrel = 1;
opcode = insns[0].opcode;
}
continue;
case 'd':
/* Sub-word loads and stores. We load the address into
$at, which might involve using the `P' parameter
processing too, then emit a sequence to get the job
done, using unaligned memory accesses and byte
manipulation, with t9 and t10 as temporaries. */
{
/* Characteristics of access. */
int is_load = 99, is_unsigned = 0, is_unaligned = 0;
int mode_size, mode;
/* Register operand. */
int reg = -1;
/* Addend for loads and stores. */
valueT addend;
/* Which register do we use for the address? */
int addr;
{
/* Pick apart name and set flags. */
const char *s = pattern->name;
if (*s == 'u')
{
is_unaligned = 1;
s++;
}
if (s[0] == 'l' && s[1] == 'd')
is_load = 1;
else if (s[0] == 's' && s[1] == 't')
is_load = 0;
else
as_fatal ("unrecognized sub-word access insn `%s'",
str);
s += 2;
mode = *s++;
if (mode == 'b') mode_size = 1;
else if (mode == 'w') mode_size = 2;
else if (mode == 'l') mode_size = 4;
else if (mode == 'q') mode_size = 8;
else abort ();
if (*s == 'u')
{
is_unsigned = 1;
s++;
}
assert (*s == 0);
/* Longwords are always kept sign-extended. */
if (mode == 'l' && is_unsigned)
abort ();
/* There's no special unaligned byte handling. */
if (mode == 'b' && is_unaligned)
abort ();
/* Stores don't care about signedness. */
if (!is_load && is_unsigned)
abort ();
}
if (args[-2] == 'P')
{
addr = AT;
addend = 0;
}
else
{
/* foo r1,num(r2)
r2 -> mask
r1 -> (opcode >> SA) & 31
num -> insns->reloc[0].*
We want to emit "lda at,num(r2)", since these
operations require the use of a single register
with the starting address of the memory operand
we want to access.
We could probably get away without doing this
(and use r2 below, with the addend for the
actual reads and writes) in cases where the
addend is known to be a multiple of 8. */
int r2 = mask;
int r1 = (opcode >> SA) & 31;
if (insns[0].reloc[0].code == BFD_RELOC_NONE)
addend = 0;
else if (insns[0].reloc[0].code == BFD_RELOC_16)
{
if (insns[0].reloc[0].exp.X_op != O_constant)
abort ();
addend = insns[0].reloc[0].exp.X_add_number;
}
else
abort ();
if (addend + mode_size - 1 < 0x7fff
&& (addend % 8) == 0
&& (r2 < T9 || r2 > T12))
{
addr = r2;
num_gen = 0;
}
else
{
/* Let later relocation processing deal
with the addend field. */
insns[num_gen-1].opcode = (0x20000000 /* lda */
| (AT << SA)
| (r2 << SB));
addr = AT;
addend = 0;
}
reg = r1;
}
/* Because the emit_* routines append directly to
the current frag, we now need to flush any
pending insns. */
{
int i;
for (i = 0; i < num_gen; i++)
emit_insn (&insns[i]);
num_gen = 0;
}
if (is_load)
{
int reg2, reg3 = -1;
if (is_unaligned)
reg2 = T9, reg3 = T10;
else
reg2 = reg;
emit_load_unal (addr, addend, T9);
if (is_unaligned)
emit_load_unal (addr, addend + mode_size - 1, T10);
emit_extract_r (T9, addr, reg2, mode, 'l');
if (is_unaligned)
{
emit_extract_r (T10, addr, reg3, mode, 'h');
emit_bis_r (T9, T10, reg);
}
if (!is_unsigned)
emit_sign_extend (reg, mode_size * 8);
}
else
{
/* The second word gets processed first
because if the address does turn out to be
aligned, the processing for the second word
will be pushing around all-zeros, and the
entire value will be handled as the `first'
word. So we want to store the `first' word
last. */
/* Pair these up so that the memory loads get
separated from each other, as well as being
well in advance of the uses of the values
loaded. */
if (is_unaligned)
{
emit_load_unal (addr, addend + mode_size - 1, T11);
emit_insert_r (reg, addr, T12, mode, 'h');
}
emit_load_unal (addr, addend, T9);
emit_insert_r (reg, addr, T10, mode, 'l');
if (is_unaligned)
emit_mask_r (T12, addr, T12, mode, 'h');
emit_mask_r (T10, addr, T10, mode, 'l');
if (is_unaligned)
emit_bis_r (T11, T12, T11);
emit_bis_r (T9, T10, T9);
if (is_unaligned)
emit_store_unal (addr, addend + mode_size - 1, T11);
emit_store_unal (addr, addend, T9);
}
}
return 0;
/* DIVISION and MODULUS. Yech.
Convert OP x,y,result
to mov x,t10
mov y,t11
jsr t9, __OP
mov t12,result
with appropriate optimizations if t10,t11,t12
are the registers specified by the compiler.
We are missing an obvious optimization
opportunity here; if the ldq generated by the
jsr assembly requires a cycle or two to make
the value available, initiating it before one
or two of the mov instructions would result in
faster execution. */
case '0': /* reml */
case '1': /* divl */
case '2': /* remq */
case '3': /* divq */
case '4': /* remlu */
case '5': /* divlu */
case '6': /* remqu */
case '7': /* divqu */
{
static char func[8][6] = {
"reml", "divl", "remq", "divq",
"remlu", "divlu", "remqu", "divqu"
};
char expansion[64];
int reg;
/* All regs parsed, in opcode */
/* Do the expansions, one instr at a time */
reg = (opcode >> SA) & 31;
if (reg != T10)
{
/* x->t10 */
sprintf (expansion, "mov $%d,$%d", reg, T10);
md_assemble (expansion);
}
reg = (opcode >> SB) & 31;
if (reg == T10)
/* we already overwrote it! */
abort ();
else if (reg != T11)
{
/* y->t11 */
sprintf (expansion, "mov $%d,$%d", reg, T11);
md_assemble (expansion);
}
sprintf (expansion, "lda $%d,__%s", PV, func[*args - '0']);
md_assemble (expansion);
sprintf (expansion, "jsr $%d,($%d),__%s", T9, PV,
func[*args - '0']);
md_assemble (expansion);
#if 0 /* huh? */
if (!first_32bit_quadrant)
{
sprintf (expansion,
"zap $%d,0xf,$%d",
T9, base_register);
md_assemble (expansion);
}
#endif
sprintf (expansion, "ldgp $%d,0($%d)",
base_register, T9);
md_assemble (expansion);
/* Use insns[0] to get at the result */
if ((reg = (opcode & 31)) != PV)
opcode = (0x47e00400 /* or zero,zero,zero */
| (PV << SB)
| reg /* Rc */ ); /* pv->z */
else
num_gen = 0;
}
continue;
}
/* fall through */
default:
abort ();
}
break;
}
error:
if (match == 0)
{
/* Args don't match. */
if (&pattern[1] - alpha_opcodes < NUMOPCODES
&& !strcmp (pattern->name, pattern[1].name))
{
++pattern;
s = argsStart;
continue;
}
else
{
as_warn ("Illegal operands");
return -1;
}
}
else
{
/* Args match, see if a float instructions and -nofloats */
if (nofloats && pattern->isa_float)
return -1;
}
break;
}
if (do_add64)
{
/* If opcode represents an addq instruction, and the addend we
are using fits in a 16 bit range, we can change the addq
directly into an lda rather than emitting an lda followed by
an addq. */
if (OPCODE (opcode) == 0x10
&& OP_FCN (opcode) == 0x20 /* addq */
&& add64_in == ZERO
&& add64_out == AT
&& in_range_signed (add64_addend, 16))
{
opcode = (0x20000000 /* lda */
| (((opcode >> SC) & 0x1f) << SA)
| (((opcode >> SA) & 0x1f) << SB)
| (add64_addend & 0xffff));
}
else
emit_add64 (add64_in, add64_out, add64_addend);
}
insns[0].opcode = opcode;
return num_gen;
}
/* Turn a string in input_line_pointer into a floating point constant
of type type, and store the appropriate bytes in *litP. The number
of LITTLENUMS emitted is stored in *sizeP. An error message is
returned, or NULL on OK. */
/* Equal to MAX_PRECISION in atof-ieee.c */
#define MAX_LITTLENUMS 6
char *
md_atof (type, litP, sizeP)
char type;
char *litP;
int *sizeP;
{
int prec;
LITTLENUM_TYPE words[MAX_LITTLENUMS];
LITTLENUM_TYPE *wordP;
char *t;
char *atof_ieee (), *vax_md_atof ();
switch (type)
{
/* VAX floats */
case 'G':
/* VAX md_atof doesn't like "G" for some reason. */
type = 'g';
case 'F':
case 'D':
return vax_md_atof (type, litP, sizeP);
/* IEEE floats */
case 'f':
prec = 2;
break;
case 'd':
prec = 4;
break;
case 'x':
case 'X':
prec = 6;
break;
case 'p':
case 'P':
prec = 6;
break;
default:
*sizeP = 0;
return "Bad call to MD_ATOF()";
}
t = atof_ieee (input_line_pointer, type, words);
if (t)
input_line_pointer = t;
*sizeP = prec * sizeof (LITTLENUM_TYPE);
for (wordP = words + prec - 1; prec--;)
{
md_number_to_chars (litP, (long) (*wordP--), sizeof (LITTLENUM_TYPE));
litP += sizeof (LITTLENUM_TYPE);
}
return 0;
}
void
md_bignum_to_chars (buf, bignum, nchars)
char *buf;
LITTLENUM_TYPE *bignum;
int nchars;
{
while (nchars)
{
LITTLENUM_TYPE work = *bignum++;
int nb = CHARS_PER_LITTLENUM;
do
{
*buf++ = work & ((1 << BITS_PER_CHAR) - 1);
if (--nchars == 0)
return;
work >>= BITS_PER_CHAR;
}
while (--nb);
}
}
CONST char *md_shortopts = "Fm:g";
struct option md_longopts[] = {
#define OPTION_32ADDR (OPTION_MD_BASE)
{"32addr", no_argument, NULL, OPTION_32ADDR},
{NULL, no_argument, NULL, 0}
};
size_t md_longopts_size = sizeof(md_longopts);
int
md_parse_option (c, arg)
int c;
char *arg;
{
switch (c)
{
case 'F':
nofloats = 1;
break;
case OPTION_32ADDR:
addr32 = 1;
break;
case 'g':
/* Ignore `-g' so gcc can provide this option to the Digital
UNIX assembler, which otherwise would throw away info that
mips-tfile needs. */
break;
default:
return 0;
}
return 1;
}
void
md_show_usage (stream)
FILE *stream;
{
fprintf(stream, "\
Alpha options:\n\
-32addr treat addresses as 32-bit values\n\
-F lack floating point instructions support\n\
-m21064 | -m21066 | -m21164\n\
specify variant of Alpha architecture\n");
}
static void
s_proc (is_static)
int is_static;
{
/* XXXX Align to cache linesize XXXXX */
char *name;
char c;
char *p;
symbolS *symbolP;
int temp;
/* Takes ".proc name,nargs" */
name = input_line_pointer;
c = get_symbol_end ();
p = input_line_pointer;
symbolP = symbol_find_or_make (name);
*p = c;
SKIP_WHITESPACE ();
if (*input_line_pointer != ',')
{
*p = 0;
as_warn ("Expected comma after name \"%s\"", name);
*p = c;
temp = 0;
ignore_rest_of_line ();
}
else
{
input_line_pointer++;
temp = get_absolute_expression ();
}
/* symbolP->sy_other = (signed char) temp; */
as_warn ("unhandled: .proc %s,%d", name, temp);
demand_empty_rest_of_line ();
}
static void
s_alpha_set (x)
int x;
{
char *name = input_line_pointer, ch, *s;
int yesno = 1;
while (!is_end_of_line[(unsigned char) *input_line_pointer])
input_line_pointer++;
ch = *input_line_pointer;
*input_line_pointer = '\0';
s = name;
if (s[0] == 'n' && s[1] == 'o')
{
yesno = 0;
s += 2;
}
if (!strcmp ("reorder", s))
/* ignore */ ;
else if (!strcmp ("at", s))
at_ok = yesno;
else if (!strcmp ("macro", s))
macro_ok = yesno;
else if (!strcmp ("move", s))
/* ignore */ ;
else if (!strcmp ("volatile", s))
/* ignore */ ;
else
as_warn ("Tried to .set unrecognized mode `%s'", name);
*input_line_pointer = ch;
demand_empty_rest_of_line ();
}
/* @@ Is this right?? */
long
md_pcrel_from (fixP)
fixS *fixP;
{
valueT addr = fixP->fx_where + fixP->fx_frag->fr_address;
switch (fixP->fx_r_type)
{
case BFD_RELOC_ALPHA_GPDISP_HI16:
case BFD_RELOC_ALPHA_GPDISP_LO16:
return addr;
default:
return fixP->fx_size + addr;
}
}
/* Handle the .align pseudo-op. This aligns to a power of two. It
also adjusts any current instruction label. We treat this the same
way the MIPS port does: .align 0 turns off auto alignment. */
static void
s_alpha_align (ignore)
int ignore;
{
register int temp;
register long temp_fill;
long max_alignment = 15;
temp = get_absolute_expression ();
if (temp > max_alignment)
as_bad ("Alignment too large: %d. assumed.", temp = max_alignment);
else if (temp < 0)
{
as_warn ("Alignment negative: 0 assumed.");
temp = 0;
}
if (*input_line_pointer == ',')
{
input_line_pointer++;
temp_fill = get_absolute_expression ();
}
else
temp_fill = 0;
if (temp)
{
auto_align = 1;
alpha_align (temp, (int) temp_fill, insn_label);
}
else
{
auto_align = 0;
}
demand_empty_rest_of_line ();
}
static void
alpha_align (n, fill, label)
int n;
int fill;
symbolS *label;
{
if (fill == 0
&& (now_seg == text_section
|| !strcmp (now_seg->name, ".init")
|| !strcmp (now_seg->name, ".fini"))
&& n > 2)
{
static const unsigned char nop_pattern[] = { 0x1f, 0x04, 0xff, 0x47 };
/* First, make sure we're on a four-byte boundary, in case
someone has been putting .byte values into the text section.
The DEC assembler silently fills with unaligned no-op
instructions. This will zero-fill, then nop-fill with proper
alignment. */
frag_align (2, fill);
frag_align_pattern (n, nop_pattern, sizeof (nop_pattern));
}
else
frag_align (n, fill);
if (label != NULL)
{
assert (S_GET_SEGMENT (label) == now_seg);
label->sy_frag = frag_now;
S_SET_VALUE (label, (valueT) frag_now_fix ());
}
}
/* This function is called just before the generic pseudo-ops output
something. It just clears insn_label. */
void
alpha_flush_pending_output ()
{
insn_label = NULL;
}
/* Handle data allocation pseudo-ops. This is like the generic
version, but it makes sure the current label, if any, is correctly
aligned. */
static void
s_alpha_cons (log_size)
int log_size;
{
if (log_size > 0 && auto_align)
alpha_align (log_size, 0, insn_label);
insn_label = NULL;
cons (1 << log_size);
}
/* Handle floating point allocation pseudo-ops. This is like the
generic vresion, but it makes sure the current label, if any, is
correctly aligned. */
static void
s_alpha_float_cons (type)
int type;
{
if (auto_align)
{
int log_size;
switch (type)
{
default:
case 'f':
case 'F':
log_size = 2;
break;
case 'd':
case 'D':
case 'G':
log_size = 3;
break;
case 'x':
case 'X':
case 'p':
case 'P':
log_size = 4;
break;
}
alpha_align (log_size, 0, insn_label);
}
insn_label = NULL;
float_cons (type);
}
/* This function is called whenever a label is defined. It is used to
adjust the label when an automatic alignment occurs. */
void
alpha_define_label (sym)
symbolS *sym;
{
insn_label = sym;
}
int
md_apply_fix (fixP, valueP)
fixS *fixP;
valueT *valueP;
{
valueT value;
int size;
valueT addend;
char *p = fixP->fx_frag->fr_literal + fixP->fx_where;
value = *valueP;
switch (fixP->fx_r_type)
{
/* The GPDISP relocations are processed internally with a symbol
referring to the current function; we need to drop in a value
which, when added to the address of the start of the function,
gives the desired GP. */
case BFD_RELOC_ALPHA_GPDISP_HI16:
case BFD_RELOC_ALPHA_GPDISP_LO16:
addend = value;
if (fixP->fx_r_type == BFD_RELOC_ALPHA_GPDISP_HI16)
{
assert (fixP->fx_next->fx_r_type == BFD_RELOC_ALPHA_GPDISP_LO16);
#ifdef DEBUG1
printf ("hi16: ");
fprintf_vma (stdout, addend);
printf ("\n");
#endif
if (addend & 0x8000)
addend += 0x10000;
addend >>= 16;
fixP->fx_offset = 4; /* @@ Compute this using fx_next. */
}
else
{
#ifdef DEBUG1
printf ("lo16: ");
fprintf_vma (stdout, addend);
printf ("\n");
#endif
addend &= 0xffff;
fixP->fx_offset = 0;
}
md_number_to_chars (fixP->fx_frag->fr_literal + fixP->fx_where,
addend, 2);
fixP->fx_addsy = section_symbol (absolute_section);
fixP->fx_offset += fixP->fx_frag->fr_address + fixP->fx_where;
break;
case BFD_RELOC_8:
/* Write 8 bits, shifted left 13 bit positions. */
value &= 0xff;
p++;
*p &= 0x1f;
*p |= (value << 5) & 0xe0;
value >>= 3;
p++;
*p &= 0xe0;
*p |= value;
value >>= 5;
fixP->fx_done = 1;
if (value != 0)
as_bad_where (fixP->fx_file, fixP->fx_line,
"overflow in type-%d reloc", (int) fixP->fx_r_type);
return 3;
case BFD_RELOC_32:
size = 4;
goto do_it;
case BFD_RELOC_64:
size = 8;
goto do_it;
case BFD_RELOC_16:
/* Don't want overflow checking. */
size = 2;
do_it:
if (fixP->fx_pcrel == 0
&& fixP->fx_addsy == 0)
{
md_number_to_chars (p, value, size);
/* @@ Overflow checks?? */
goto done;
}
break;
case BFD_RELOC_26:
if (fixP->fx_addsy != 0
&& fixP->fx_addsy->bsym->section != absolute_section)
as_bad_where (fixP->fx_file, fixP->fx_line,
"PALcode instructions require immediate constant function code");
else if (value >> 26 != 0)
as_bad_where (fixP->fx_file, fixP->fx_line,
"overflow in 26-bit PALcode function field");
*p++ = value & 0xff;
value >>= 8;
*p++ = value & 0xff;
value >>= 8;
*p++ = value & 0xff;
value >>= 8;
{
char x = *p;
x &= ~3;
x |= (value & 3);
*p++ = x;
}
goto done;
case BFD_RELOC_14:
if (fixP->fx_addsy != 0
&& fixP->fx_addsy->bsym->section != absolute_section)
as_bad_where (fixP->fx_file, fixP->fx_line,
"ret/jsr_coroutine requires constant in displacement field");
else if (value >> 14 != 0)
as_bad_where (fixP->fx_file, fixP->fx_line,
"overflow in 14-bit operand field of ret or jsr_coroutine");
*p++ = value & 0xff;
value >>= 8;
*p = (*p & 0xc0) | (value & 0x3f);
goto done;
case BFD_RELOC_23_PCREL_S2:
/* Write 21 bits only. */
value >>= 2;
*p++ = value & 0xff;
value >>= 8;
*p++ = value & 0xff;
value >>= 8;
*p &= 0xe0;
*p |= (value & 0x1f);
goto done;
case BFD_RELOC_12_PCREL:
*p++ = value & 0xff;
value >>= 8;
*p &= 0xf0;
*p |= (value & 0x0f);
goto done;
case BFD_RELOC_ALPHA_LITERAL:
case BFD_RELOC_ALPHA_LITUSE:
return 2;
case BFD_RELOC_GPREL32:
assert (fixP->fx_subsy == gp);
value = - alpha_gp_value; /* huh? this works... */
fixP->fx_subsy = 0;
md_number_to_chars (p, value, 4);
break;
case BFD_RELOC_ALPHA_HINT:
if (fixP->fx_addsy == 0 && fixP->fx_pcrel == 0)
{
size = 2;
goto do_it;
}
return 2;
default:
as_fatal ("unhandled relocation type %s",
bfd_get_reloc_code_name (fixP->fx_r_type));
return 9;
}
if (fixP->fx_addsy == 0 && fixP->fx_pcrel == 0)
{
printf ("type %d reloc done?\n", fixP->fx_r_type);
done:
fixP->fx_done = 1;
return 42;
}
return 0x12345678;
}
void
alpha_frob_ecoff_data ()
{
select_gp_value ();
/* $zero and $f31 are read-only */
alpha_gprmask &= ~1;
alpha_fprmask &= ~1;
}
/* The Alpha has support for some VAX floating point types, as well as for
IEEE floating point. We consider IEEE to be the primary floating point
format, and sneak in the VAX floating point support here. */
#define md_atof vax_md_atof
#include "config/atof-vax.c"
|