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
|
/* tc-mcore.c -- Assemble code for M*Core
Copyright 1999, 2000, 2001, 2002, 2003, 2005
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 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. */
#include <stdio.h>
#include "as.h"
#include "bfd.h"
#include "subsegs.h"
#define DEFINE_TABLE
#include "../opcodes/mcore-opc.h"
#include "safe-ctype.h"
#include <string.h>
#ifdef OBJ_ELF
#include "elf/mcore.h"
#endif
#ifndef streq
#define streq(a,b) (strcmp (a, b) == 0)
#endif
/* Forward declarations for dumb compilers. */
static void mcore_s_literals PARAMS ((int));
static void mcore_pool_count PARAMS ((void (*) (int), int));
static void mcore_cons PARAMS ((int));
static void mcore_float_cons PARAMS ((int));
static void mcore_stringer PARAMS ((int));
static void mcore_fill PARAMS ((int));
static int mylog2 PARAMS ((unsigned int));
static char * parse_reg PARAMS ((char *, unsigned *));
static char * parse_creg PARAMS ((char *, unsigned *));
static char * parse_exp PARAMS ((char *, expressionS *));
static char * parse_rt PARAMS ((char *, char **, int, expressionS *));
static char * parse_imm PARAMS ((char *, unsigned *, unsigned, unsigned));
static char * parse_mem PARAMS ((char *, unsigned *, unsigned *, unsigned));
static char * parse_psrmod PARAMS ((char *, unsigned *));
static void make_name PARAMS ((char *, char *, int));
static int enter_literal PARAMS ((expressionS *, int));
static void dump_literals PARAMS ((int));
static void check_literals PARAMS ((int, int));
static void mcore_s_text PARAMS ((int));
static void mcore_s_data PARAMS ((int));
static void mcore_s_section PARAMS ((int));
static void mcore_s_bss PARAMS ((int));
#ifdef OBJ_ELF
static void mcore_s_comm PARAMS ((int));
#endif
/* Several places in this file insert raw instructions into the
object. They should use MCORE_INST_XXX macros to get the opcodes
and then use these two macros to crack the MCORE_INST value into
the appropriate byte values. */
#define INST_BYTE0(x) (target_big_endian ? (((x) >> 8) & 0xFF) : ((x) & 0xFF))
#define INST_BYTE1(x) (target_big_endian ? ((x) & 0xFF) : (((x) >> 8) & 0xFF))
const char comment_chars[] = "#/";
const char line_separator_chars[] = ";";
const char line_comment_chars[] = "#/";
const int md_reloc_size = 8;
static int do_jsri2bsr = 0; /* Change here from 1 by Cruess 19 August 97. */
static int sifilter_mode = 0;
const char EXP_CHARS[] = "eE";
/* Chars that mean this number is a floating point constant
As in 0f12.456
or 0d1.2345e12 */
const char FLT_CHARS[] = "rRsSfFdDxXpP";
#define C(what,length) (((what) << 2) + (length))
#define GET_WHAT(x) ((x >> 2))
/* These are the two types of relaxable instruction */
#define COND_JUMP 1
#define UNCD_JUMP 2
#define UNDEF_DISP 0
#define DISP12 1
#define DISP32 2
#define UNDEF_WORD_DISP 3
#define C12_LEN 2
#define C32_LEN 10 /* allow for align */
#define U12_LEN 2
#define U32_LEN 8 /* allow for align */
typedef enum
{
M210,
M340
}
cpu_type;
cpu_type cpu = M340;
/* Initialize the relax table. */
const relax_typeS md_relax_table[] = {
{ 0, 0, 0, 0 },
{ 0, 0, 0, 0 },
{ 0, 0, 0, 0 },
{ 0, 0, 0, 0 },
/* COND_JUMP */
{ 0, 0, 0, 0 }, /* UNDEF_DISP */
{ 2048, -2046, C12_LEN, C(COND_JUMP, DISP32) }, /* DISP12 */
{ 0, 0, C32_LEN, 0 }, /* DISP32 */
{ 0, 0, C32_LEN, 0 }, /* UNDEF_WORD_DISP */
/* UNCD_JUMP */
{ 0, 0, 0, 0 }, /* UNDEF_DISP */
{ 2048, -2046, U12_LEN, C(UNCD_JUMP, DISP32) }, /* DISP12 */
{ 0, 0, U32_LEN, 0 }, /* DISP32 */
{ 0, 0, U32_LEN, 0 } /* UNDEF_WORD_DISP */
};
/* Literal pool data structures. */
struct literal
{
unsigned short refcnt;
unsigned char ispcrel;
unsigned char unused;
expressionS e;
};
#define MAX_POOL_SIZE (1024/4)
static struct literal litpool [MAX_POOL_SIZE];
static unsigned poolsize;
static unsigned poolnumber;
static unsigned long poolspan;
/* SPANPANIC: the point at which we get too scared and force a dump
of the literal pool, and perhaps put a branch in place.
Calculated as:
1024 span of lrw/jmpi/jsri insn (actually span+1)
-2 possible alignment at the insn.
-2 possible alignment to get the table aligned.
-2 an inserted branch around the table.
== 1018
at 1018, we might be in trouble.
-- so we have to be smaller than 1018 and since we deal with 2-byte
instructions, the next good choice is 1016.
-- Note we have a test case that fails when we've got 1018 here. */
#define SPANPANIC (1016) /* 1024 - 1 entry - 2 byte rounding. */
#define SPANCLOSE (900)
#define SPANEXIT (600)
static symbolS * poolsym; /* label for current pool. */
static char poolname[8];
static struct hash_control * opcode_hash_control; /* Opcode mnemonics. */
/* This table describes all the machine specific pseudo-ops the assembler
has to support. The fields are:
Pseudo-op name without dot
Function to call to execute this pseudo-op
Integer arg to pass to the function. */
const pseudo_typeS md_pseudo_table[] =
{
{ "export", s_globl, 0 },
{ "import", s_ignore, 0 },
{ "literals", mcore_s_literals, 0 },
{ "page", listing_eject, 0 },
/* The following are to intercept the placement of data into the text
section (eg addresses for a switch table), so that the space they
occupy can be taken into account when deciding whether or not to
dump the current literal pool.
XXX - currently we do not cope with the .space and .dcb.d directives. */
{ "ascii", mcore_stringer, 0 },
{ "asciz", mcore_stringer, 1 },
{ "byte", mcore_cons, 1 },
{ "dc", mcore_cons, 2 },
{ "dc.b", mcore_cons, 1 },
{ "dc.d", mcore_float_cons, 'd'},
{ "dc.l", mcore_cons, 4 },
{ "dc.s", mcore_float_cons, 'f'},
{ "dc.w", mcore_cons, 2 },
{ "dc.x", mcore_float_cons, 'x'},
{ "double", mcore_float_cons, 'd'},
{ "float", mcore_float_cons, 'f'},
{ "hword", mcore_cons, 2 },
{ "int", mcore_cons, 4 },
{ "long", mcore_cons, 4 },
{ "octa", mcore_cons, 16 },
{ "quad", mcore_cons, 8 },
{ "short", mcore_cons, 2 },
{ "single", mcore_float_cons, 'f'},
{ "string", mcore_stringer, 1 },
{ "word", mcore_cons, 2 },
{ "fill", mcore_fill, 0 },
/* Allow for the effect of section changes. */
{ "text", mcore_s_text, 0 },
{ "data", mcore_s_data, 0 },
{ "bss", mcore_s_bss, 1 },
#ifdef OBJ_ELF
{ "comm", mcore_s_comm, 0 },
#endif
{ "section", mcore_s_section, 0 },
{ "section.s", mcore_s_section, 0 },
{ "sect", mcore_s_section, 0 },
{ "sect.s", mcore_s_section, 0 },
{ 0, 0, 0 }
};
static void
mcore_s_literals (ignore)
int ignore ATTRIBUTE_UNUSED;
{
dump_literals (0);
demand_empty_rest_of_line ();
}
/* Perform FUNC (ARG), and track number of bytes added to frag. */
static void
mcore_pool_count (func, arg)
void (*func) PARAMS ((int));
int arg;
{
const fragS *curr_frag = frag_now;
offsetT added = -frag_now_fix_octets ();
(*func) (arg);
while (curr_frag != frag_now)
{
added += curr_frag->fr_fix;
curr_frag = curr_frag->fr_next;
}
added += frag_now_fix_octets ();
poolspan += added;
}
static void
mcore_cons (nbytes)
int nbytes;
{
if (now_seg == text_section)
mcore_pool_count (cons, nbytes);
else
cons (nbytes);
/* In theory we ought to call check_literals (2,0) here in case
we need to dump the literal table. We cannot do this however,
as the directives that we are intercepting may be being used
to build a switch table, and we must not interfere with its
contents. Instead we cross our fingers and pray... */
}
static void
mcore_float_cons (float_type)
int float_type;
{
if (now_seg == text_section)
mcore_pool_count (float_cons, float_type);
else
float_cons (float_type);
/* See the comment in mcore_cons () about calling check_literals.
It is unlikely that a switch table will be constructed using
floating point values, but it is still likely that an indexed
table of floating point constants is being created by these
directives, so again we must not interfere with their placement. */
}
static void
mcore_stringer (append_zero)
int append_zero;
{
if (now_seg == text_section)
mcore_pool_count (stringer, append_zero);
else
stringer (append_zero);
/* We call check_literals here in case a large number of strings are
being placed into the text section with a sequence of stringer
directives. In theory we could be upsetting something if these
strings are actually in an indexed table instead of referenced by
individual labels. Let us hope that that never happens. */
check_literals (2, 0);
}
static void
mcore_fill (unused)
int unused;
{
if (now_seg == text_section)
mcore_pool_count (s_fill, unused);
else
s_fill (unused);
check_literals (2, 0);
}
/* Handle the section changing pseudo-ops. These call through to the
normal implementations, but they dump the literal pool first. */
static void
mcore_s_text (ignore)
int ignore;
{
dump_literals (0);
#ifdef OBJ_ELF
obj_elf_text (ignore);
#else
s_text (ignore);
#endif
}
static void
mcore_s_data (ignore)
int ignore;
{
dump_literals (0);
#ifdef OBJ_ELF
obj_elf_data (ignore);
#else
s_data (ignore);
#endif
}
static void
mcore_s_section (ignore)
int ignore;
{
/* Scan forwards to find the name of the section. If the section
being switched to is ".line" then this is a DWARF1 debug section
which is arbitrarily placed inside generated code. In this case
do not dump the literal pool because it is a) inefficient and
b) would require the generation of extra code to jump around the
pool. */
char * ilp = input_line_pointer;
while (*ilp != 0 && ISSPACE (*ilp))
++ ilp;
if (strncmp (ilp, ".line", 5) == 0
&& (ISSPACE (ilp[5]) || *ilp == '\n' || *ilp == '\r'))
;
else
dump_literals (0);
#ifdef OBJ_ELF
obj_elf_section (ignore);
#endif
#ifdef OBJ_COFF
obj_coff_section (ignore);
#endif
}
static void
mcore_s_bss (needs_align)
int needs_align;
{
dump_literals (0);
s_lcomm_bytes (needs_align);
}
#ifdef OBJ_ELF
static void
mcore_s_comm (needs_align)
int needs_align;
{
dump_literals (0);
obj_elf_common (needs_align);
}
#endif
/* This function is called once, at assembler startup time. This should
set up all the tables, etc that the MD part of the assembler needs. */
void
md_begin ()
{
const mcore_opcode_info * opcode;
char * prev_name = "";
opcode_hash_control = hash_new ();
/* Insert unique names into hash table */
for (opcode = mcore_table; opcode->name; opcode ++)
{
if (! streq (prev_name, opcode->name))
{
prev_name = opcode->name;
hash_insert (opcode_hash_control, opcode->name, (char *) opcode);
}
}
}
/* Get a log2(val). */
static int
mylog2 (val)
unsigned int val;
{
int log = -1;
while (val != 0)
{
log ++;
val >>= 1;
}
return log;
}
/* Try to parse a reg name. */
static char *
parse_reg (s, reg)
char * s;
unsigned * reg;
{
/* Strip leading whitespace. */
while (ISSPACE (* s))
++ s;
if (TOLOWER (s[0]) == 'r')
{
if (s[1] == '1' && s[2] >= '0' && s[2] <= '5')
{
*reg = 10 + s[2] - '0';
return s + 3;
}
if (s[1] >= '0' && s[1] <= '9')
{
*reg = s[1] - '0';
return s + 2;
}
}
else if ( TOLOWER (s[0]) == 's'
&& TOLOWER (s[1]) == 'p'
&& ! ISALNUM (s[2]))
{
* reg = 0;
return s + 2;
}
as_bad (_("register expected, but saw '%.6s'"), s);
return s;
}
static struct Cregs
{
char * name;
unsigned int crnum;
}
cregs[] =
{
{ "psr", 0},
{ "vbr", 1},
{ "epsr", 2},
{ "fpsr", 3},
{ "epc", 4},
{ "fpc", 5},
{ "ss0", 6},
{ "ss1", 7},
{ "ss2", 8},
{ "ss3", 9},
{ "ss4", 10},
{ "gcr", 11},
{ "gsr", 12},
{ "", 0}
};
static char *
parse_creg (s, reg)
char * s;
unsigned * reg;
{
int i;
/* Strip leading whitespace. */
while (ISSPACE (* s))
++s;
if ((TOLOWER (s[0]) == 'c' && TOLOWER (s[1]) == 'r'))
{
if (s[2] == '3' && s[3] >= '0' && s[3] <= '1')
{
*reg = 30 + s[3] - '0';
return s + 4;
}
if (s[2] == '2' && s[3] >= '0' && s[3] <= '9')
{
*reg = 20 + s[3] - '0';
return s + 4;
}
if (s[2] == '1' && s[3] >= '0' && s[3] <= '9')
{
*reg = 10 + s[3] - '0';
return s + 4;
}
if (s[2] >= '0' && s[2] <= '9')
{
*reg = s[2] - '0';
return s + 3;
}
}
/* Look at alternate creg names before giving error. */
for (i = 0; cregs[i].name[0] != '\0'; i++)
{
char buf [10];
int length;
int j;
length = strlen (cregs[i].name);
for (j = 0; j < length; j++)
buf[j] = TOLOWER (s[j]);
if (strncmp (cregs[i].name, buf, length) == 0)
{
*reg = cregs[i].crnum;
return s + length;
}
}
as_bad (_("control register expected, but saw '%.6s'"), s);
return s;
}
static char *
parse_psrmod (s, reg)
char * s;
unsigned * reg;
{
int i;
char buf[10];
static struct psrmods
{
char * name;
unsigned int value;
}
psrmods[] =
{
{ "ie", 1 },
{ "fe", 2 },
{ "ee", 4 },
{ "af", 8 } /* Really 0 and non-combinable. */
};
for (i = 0; i < 2; i++)
buf[i] = TOLOWER (s[i]);
for (i = sizeof (psrmods) / sizeof (psrmods[0]); i--;)
{
if (! strncmp (psrmods[i].name, buf, 2))
{
* reg = psrmods[i].value;
return s + 2;
}
}
as_bad (_("bad/missing psr specifier"));
* reg = 0;
return s;
}
static char *
parse_exp (s, e)
char * s;
expressionS * e;
{
char * save;
char * new;
/* Skip whitespace. */
while (ISSPACE (* s))
++ s;
save = input_line_pointer;
input_line_pointer = s;
expression (e);
if (e->X_op == O_absent)
as_bad (_("missing operand"));
new = input_line_pointer;
input_line_pointer = save;
return new;
}
static void
make_name (s, p, n)
char * s;
char * p;
int n;
{
static const char hex[] = "0123456789ABCDEF";
s[0] = p[0];
s[1] = p[1];
s[2] = p[2];
s[3] = hex[(n >> 12) & 0xF];
s[4] = hex[(n >> 8) & 0xF];
s[5] = hex[(n >> 4) & 0xF];
s[6] = hex[(n) & 0xF];
s[7] = 0;
}
#define POOL_END_LABEL ".LE"
#define POOL_START_LABEL ".LS"
static void
dump_literals (isforce)
int isforce;
{
unsigned int i;
struct literal * p;
symbolS * brarsym = NULL;
if (poolsize == 0)
return;
/* Must we branch around the literal table? */
if (isforce)
{
char * output;
char brarname[8];
make_name (brarname, POOL_END_LABEL, poolnumber);
brarsym = symbol_make (brarname);
symbol_table_insert (brarsym);
output = frag_var (rs_machine_dependent,
md_relax_table[C (UNCD_JUMP, DISP32)].rlx_length,
md_relax_table[C (UNCD_JUMP, DISP12)].rlx_length,
C (UNCD_JUMP, 0), brarsym, 0, 0);
output[0] = INST_BYTE0 (MCORE_INST_BR); /* br .+xxx */
output[1] = INST_BYTE1 (MCORE_INST_BR);
}
/* Make sure that the section is sufficiently aligned and that
the literal table is aligned within it. */
record_alignment (now_seg, 2);
frag_align (2, 0, 0);
colon (S_GET_NAME (poolsym));
for (i = 0, p = litpool; i < poolsize; i++, p++)
emit_expr (& p->e, 4);
if (brarsym != NULL)
colon (S_GET_NAME (brarsym));
poolsize = 0;
}
static void
check_literals (kind, offset)
int kind;
int offset;
{
poolspan += offset;
/* SPANCLOSE and SPANEXIT are smaller numbers than SPANPANIC.
SPANPANIC means that we must dump now.
kind == 0 is any old instruction.
kind > 0 means we just had a control transfer instruction.
kind == 1 means within a function
kind == 2 means we just left a function
The dump_literals (1) call inserts a branch around the table, so
we first look to see if its a situation where we won't have to
insert a branch (e.g., the previous instruction was an unconditional
branch).
SPANPANIC is the point where we must dump a single-entry pool.
it accounts for alignments and an inserted branch.
the 'poolsize*2' accounts for the scenario where we do:
lrw r1,lit1; lrw r2,lit2; lrw r3,lit3
Note that the 'lit2' reference is 2 bytes further along
but the literal it references will be 4 bytes further along,
so we must consider the poolsize into this equation.
This is slightly over-cautious, but guarantees that we won't
panic because a relocation is too distant. */
if (poolspan > SPANCLOSE && kind > 0)
dump_literals (0);
else if (poolspan > SPANEXIT && kind > 1)
dump_literals (0);
else if (poolspan >= (SPANPANIC - poolsize * 2))
dump_literals (1);
}
static int
enter_literal (e, ispcrel)
expressionS * e;
int ispcrel;
{
unsigned int i;
struct literal * p;
if (poolsize >= MAX_POOL_SIZE - 2)
{
/* The literal pool is as full as we can handle. We have
to be 2 entries shy of the 1024/4=256 entries because we
have to allow for the branch (2 bytes) and the alignment
(2 bytes before the first insn referencing the pool and
2 bytes before the pool itself) == 6 bytes, rounds up
to 2 entries. */
dump_literals (1);
}
if (poolsize == 0)
{
/* Create new literal pool. */
if (++ poolnumber > 0xFFFF)
as_fatal (_("more than 65K literal pools"));
make_name (poolname, POOL_START_LABEL, poolnumber);
poolsym = symbol_make (poolname);
symbol_table_insert (poolsym);
poolspan = 0;
}
/* Search pool for value so we don't have duplicates. */
for (p = litpool, i = 0; i < poolsize; i++, p++)
{
if (e->X_op == p->e.X_op
&& e->X_add_symbol == p->e.X_add_symbol
&& e->X_add_number == p->e.X_add_number
&& ispcrel == p->ispcrel)
{
p->refcnt ++;
return i;
}
}
p->refcnt = 1;
p->ispcrel = ispcrel;
p->e = * e;
poolsize ++;
return i;
}
/* Parse a literal specification. -- either new or old syntax.
old syntax: the user supplies the label and places the literal.
new syntax: we put it into the literal pool. */
static char *
parse_rt (s, outputp, ispcrel, ep)
char * s;
char ** outputp;
int ispcrel;
expressionS * ep;
{
expressionS e;
int n;
if (ep)
/* Indicate nothing there. */
ep->X_op = O_absent;
if (*s == '[')
{
s = parse_exp (s + 1, & e);
if (*s == ']')
s++;
else
as_bad (_("missing ']'"));
}
else
{
s = parse_exp (s, & e);
n = enter_literal (& e, ispcrel);
if (ep)
*ep = e;
/* Create a reference to pool entry. */
e.X_op = O_symbol;
e.X_add_symbol = poolsym;
e.X_add_number = n << 2;
}
* outputp = frag_more (2);
fix_new_exp (frag_now, (*outputp) - frag_now->fr_literal, 2, & e, 1,
BFD_RELOC_MCORE_PCREL_IMM8BY4);
return s;
}
static char *
parse_imm (s, val, min, max)
char * s;
unsigned * val;
unsigned min;
unsigned max;
{
char * new;
expressionS e;
new = parse_exp (s, & e);
if (e.X_op == O_absent)
; /* An error message has already been emitted. */
else if (e.X_op != O_constant)
as_bad (_("operand must be a constant"));
else if ((addressT) e.X_add_number < min || (addressT) e.X_add_number > max)
as_bad (_("operand must be absolute in range %u..%u, not %ld"),
min, max, (long) e.X_add_number);
* val = e.X_add_number;
return new;
}
static char *
parse_mem (s, reg, off, siz)
char * s;
unsigned * reg;
unsigned * off;
unsigned siz;
{
* off = 0;
while (ISSPACE (* s))
++ s;
if (* s == '(')
{
s = parse_reg (s + 1, reg);
while (ISSPACE (* s))
++ s;
if (* s == ',')
{
s = parse_imm (s + 1, off, 0, 63);
if (siz > 1)
{
if (siz > 2)
{
if (* off & 0x3)
as_bad (_("operand must be a multiple of 4"));
* off >>= 2;
}
else
{
if (* off & 0x1)
as_bad (_("operand must be a multiple of 2"));
* off >>= 1;
}
}
}
while (ISSPACE (* s))
++ s;
if (* s == ')')
s ++;
}
else
as_bad (_("base register expected"));
return s;
}
/* This is the guts of the machine-dependent assembler. STR points to a
machine dependent instruction. This function is supposed to emit
the frags/bytes it assembles to. */
void
md_assemble (str)
char * str;
{
char * op_start;
char * op_end;
mcore_opcode_info * opcode;
char * output;
int nlen = 0;
unsigned short inst;
unsigned reg;
unsigned off;
unsigned isize;
expressionS e;
char name[20];
/* Drop leading whitespace. */
while (ISSPACE (* str))
str ++;
/* Find the op code end. */
for (op_start = op_end = str;
nlen < 20 && !is_end_of_line [(unsigned char) *op_end] && *op_end != ' ';
op_end++)
{
name[nlen] = op_start[nlen];
nlen++;
}
name [nlen] = 0;
if (nlen == 0)
{
as_bad (_("can't find opcode "));
return;
}
opcode = (mcore_opcode_info *) hash_find (opcode_hash_control, name);
if (opcode == NULL)
{
as_bad (_("unknown opcode \"%s\""), name);
return;
}
inst = opcode->inst;
isize = 2;
switch (opcode->opclass)
{
case O0:
output = frag_more (2);
break;
case OT:
op_end = parse_imm (op_end + 1, & reg, 0, 3);
inst |= reg;
output = frag_more (2);
break;
case O1:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
output = frag_more (2);
break;
case JMP:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
output = frag_more (2);
/* In a sifilter mode, we emit this insn 2 times,
fixes problem of an interrupt during a jmp.. */
if (sifilter_mode)
{
output[0] = INST_BYTE0 (inst);
output[1] = INST_BYTE1 (inst);
output = frag_more (2);
}
break;
case JSR:
op_end = parse_reg (op_end + 1, & reg);
if (reg == 15)
as_bad (_("invalid register: r15 illegal"));
inst |= reg;
output = frag_more (2);
if (sifilter_mode)
{
/* Replace with: bsr .+2 ; addi r15,6; jmp rx ; jmp rx */
inst = MCORE_INST_BSR; /* with 0 displacement */
output[0] = INST_BYTE0 (inst);
output[1] = INST_BYTE1 (inst);
output = frag_more (2);
inst = MCORE_INST_ADDI;
inst |= 15; /* addi r15,6 */
inst |= (6 - 1) << 4; /* over the jmp's */
output[0] = INST_BYTE0 (inst);
output[1] = INST_BYTE1 (inst);
output = frag_more (2);
inst = MCORE_INST_JMP | reg;
output[0] = INST_BYTE0 (inst);
output[1] = INST_BYTE1 (inst);
output = frag_more (2); /* 2nd emitted in fallthru */
}
break;
case OC:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (*op_end == ',')
{
op_end = parse_creg (op_end + 1, & reg);
inst |= reg << 4;
}
output = frag_more (2);
break;
case MULSH:
if (cpu == M210)
{
as_bad (_("M340 specific opcode used when assembling for M210"));
break;
}
/* drop through... */
case O2:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_reg (op_end + 1, & reg);
inst |= reg << 4;
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case X1: /* Handle both syntax-> xtrb- r1,rx OR xtrb- rx */
op_end = parse_reg (op_end + 1, & reg);
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',') /* xtrb- r1,rx */
{
if (reg != 1)
as_bad (_("destination register must be r1"));
op_end = parse_reg (op_end + 1, & reg);
}
inst |= reg;
output = frag_more (2);
break;
case O1R1: /* div- rx,r1 */
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_reg (op_end + 1, & reg);
if (reg != 1)
as_bad (_("source register must be r1"));
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case OI:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 1, 32);
inst |= (reg - 1) << 4;
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case OB:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 0, 31);
inst |= reg << 4;
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case OB2: /* like OB, but arg is 2^n instead of n */
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 1, 1 << 31);
/* Further restrict the immediate to a power of two. */
if ((reg & (reg - 1)) == 0)
reg = mylog2 (reg);
else
{
reg = 0;
as_bad (_("immediate is not a power of two"));
}
inst |= (reg) << 4;
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case OBRa: /* Specific for bgeni: imm of 0->6 translate to movi. */
case OBRb:
case OBRc:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 0, 31);
/* immediate values of 0 -> 6 translate to movi */
if (reg <= 6)
{
inst = (inst & 0xF) | MCORE_INST_BGENI_ALT;
reg = 0x1 << reg;
as_warn (_("translating bgeni to movi"));
}
inst &= ~ 0x01f0;
inst |= reg << 4;
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case OBR2: /* like OBR, but arg is 2^n instead of n */
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 1, 1 << 31);
/* Further restrict the immediate to a power of two. */
if ((reg & (reg - 1)) == 0)
reg = mylog2 (reg);
else
{
reg = 0;
as_bad (_("immediate is not a power of two"));
}
/* Immediate values of 0 -> 6 translate to movi. */
if (reg <= 6)
{
inst = (inst & 0xF) | MCORE_INST_BGENI_ALT;
reg = 0x1 << reg;
as_warn (_("translating mgeni to movi"));
}
inst |= reg << 4;
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case OMa: /* Specific for bmaski: imm 1->7 translate to movi. */
case OMb:
case OMc:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 1, 32);
/* Immediate values of 1 -> 7 translate to movi. */
if (reg <= 7)
{
inst = (inst & 0xF) | MCORE_INST_BMASKI_ALT;
reg = (0x1 << reg) - 1;
inst |= reg << 4;
as_warn (_("translating bmaski to movi"));
}
else
{
inst &= ~ 0x01F0;
inst |= (reg & 0x1F) << 4;
}
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case SI:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 1, 31);
inst |= reg << 4;
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case I7:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 0, 0x7F);
inst |= reg << 4;
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case LS:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg << 8;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
int size;
if ((inst & 0x6000) == 0)
size = 4;
else if ((inst & 0x6000) == 0x4000)
size = 2;
else if ((inst & 0x6000) == 0x2000)
size = 1;
else
abort ();
op_end = parse_mem (op_end + 1, & reg, & off, size);
if (off > 16)
as_bad (_("displacement too large (%d)"), off);
else
inst |= (reg) | (off << 4);
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case LR:
op_end = parse_reg (op_end + 1, & reg);
if (reg == 0 || reg == 15)
as_bad (_("Invalid register: r0 and r15 illegal"));
inst |= (reg << 8);
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
/* parse_rt calls frag_more() for us. */
input_line_pointer = parse_rt (op_end + 1, & output, 0, 0);
op_end = input_line_pointer;
}
else
{
as_bad (_("second operand missing"));
output = frag_more (2); /* save its space */
}
break;
case LJ:
input_line_pointer = parse_rt (op_end + 1, & output, 1, 0);
/* parse_rt() calls frag_more() for us. */
op_end = input_line_pointer;
break;
case RM:
op_end = parse_reg (op_end + 1, & reg);
if (reg == 0 || reg == 15)
as_bad (_("bad starting register: r0 and r15 invalid"));
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == '-')
{
op_end = parse_reg (op_end + 1, & reg);
if (reg != 15)
as_bad (_("ending register must be r15"));
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
}
if (* op_end == ',')
{
op_end ++;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == '(')
{
op_end = parse_reg (op_end + 1, & reg);
if (reg != 0)
as_bad (_("bad base register: must be r0"));
if (* op_end == ')')
op_end ++;
}
else
as_bad (_("base register expected"));
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case RQ:
op_end = parse_reg (op_end + 1, & reg);
if (reg != 4)
as_fatal (_("first register must be r4"));
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == '-')
{
op_end = parse_reg (op_end + 1, & reg);
if (reg != 7)
as_fatal (_("last register must be r7"));
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end ++;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == '(')
{
op_end = parse_reg (op_end + 1, & reg);
if (reg >= 4 && reg <= 7)
as_fatal ("base register cannot be r4, r5, r6, or r7");
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ')')
op_end ++;
}
else
as_bad (_("base register expected"));
}
else
as_bad (_("second operand missing"));
}
else
as_bad (_("reg-reg expected"));
output = frag_more (2);
break;
case BR:
input_line_pointer = parse_exp (op_end + 1, & e);
op_end = input_line_pointer;
output = frag_more (2);
fix_new_exp (frag_now, output-frag_now->fr_literal,
2, & e, 1, BFD_RELOC_MCORE_PCREL_IMM11BY2);
break;
case BL:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg << 4;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_exp (op_end + 1, & e);
output = frag_more (2);
fix_new_exp (frag_now, output-frag_now->fr_literal,
2, & e, 1, BFD_RELOC_MCORE_PCREL_IMM4BY2);
}
else
{
as_bad (_("second operand missing"));
output = frag_more (2);
}
break;
case JC:
input_line_pointer = parse_exp (op_end + 1, & e);
op_end = input_line_pointer;
output = frag_var (rs_machine_dependent,
md_relax_table[C (COND_JUMP, DISP32)].rlx_length,
md_relax_table[C (COND_JUMP, DISP12)].rlx_length,
C (COND_JUMP, 0), e.X_add_symbol, e.X_add_number, 0);
isize = C32_LEN;
break;
case JU:
input_line_pointer = parse_exp (op_end + 1, & e);
op_end = input_line_pointer;
output = frag_var (rs_machine_dependent,
md_relax_table[C (UNCD_JUMP, DISP32)].rlx_length,
md_relax_table[C (UNCD_JUMP, DISP12)].rlx_length,
C (UNCD_JUMP, 0), e.X_add_symbol, e.X_add_number, 0);
isize = U32_LEN;
break;
case JL:
inst = MCORE_INST_JSRI; /* jsri */
input_line_pointer = parse_rt (op_end + 1, & output, 1, & e);
/* parse_rt() calls frag_more for us. */
op_end = input_line_pointer;
/* Only do this if we know how to do it ... */
if (e.X_op != O_absent && do_jsri2bsr)
{
/* Look at adding the R_PCREL_JSRIMM11BY2. */
fix_new_exp (frag_now, output-frag_now->fr_literal,
2, & e, 1, BFD_RELOC_MCORE_PCREL_JSR_IMM11BY2);
}
break;
case RSI: /* SI, but imm becomes 32-imm */
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 1, 31);
reg = 32 - reg;
inst |= reg << 4;
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case DO21: /* O2, dup rd, lit must be 1 */
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
inst |= reg << 4;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 1, 31);
if (reg != 1)
as_bad (_("second operand must be 1"));
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case SIa:
op_end = parse_reg (op_end + 1, & reg);
inst |= reg;
/* Skip whitespace. */
while (ISSPACE (* op_end))
++ op_end;
if (* op_end == ',')
{
op_end = parse_imm (op_end + 1, & reg, 1, 31);
if (reg == 0)
as_bad (_("zero used as immediate value"));
inst |= reg << 4;
}
else
as_bad (_("second operand missing"));
output = frag_more (2);
break;
case OPSR:
if (cpu == M210)
{
as_bad (_("M340 specific opcode used when assembling for M210"));
break;
}
op_end = parse_psrmod (op_end + 1, & reg);
/* Look for further selectors. */
while (* op_end == ',')
{
unsigned value;
op_end = parse_psrmod (op_end + 1, & value);
if (value & reg)
as_bad (_("duplicated psr bit specifier"));
reg |= value;
}
if (reg > 8)
as_bad (_("`af' must appear alone"));
inst |= (reg & 0x7);
output = frag_more (2);
break;
default:
as_bad (_("unimplemented opcode \"%s\""), name);
}
/* Drop whitespace after all the operands have been parsed. */
while (ISSPACE (* op_end))
op_end ++;
/* Give warning message if the insn has more operands than required. */
if (strcmp (op_end, opcode->name) && strcmp (op_end, ""))
as_warn (_("ignoring operands: %s "), op_end);
output[0] = INST_BYTE0 (inst);
output[1] = INST_BYTE1 (inst);
check_literals (opcode->transfer, isize);
}
symbolS *
md_undefined_symbol (name)
char *name ATTRIBUTE_UNUSED;
{
return 0;
}
void
md_mcore_end ()
{
dump_literals (0);
subseg_set (text_section, 0);
}
/* Various routines to kill one day. */
/* Equal to MAX_PRECISION in atof-ieee.c */
#define MAX_LITTLENUMS 6
/* 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.*/
char *
md_atof (type, litP, sizeP)
int type;
char * litP;
int * sizeP;
{
int prec;
LITTLENUM_TYPE words[MAX_LITTLENUMS];
int i;
char * t;
switch (type)
{
case 'f':
case 'F':
case 's':
case 'S':
prec = 2;
break;
case 'd':
case 'D':
case 'r':
case 'R':
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_NTOF()");
}
t = atof_ieee (input_line_pointer, type, words);
if (t)
input_line_pointer = t;
*sizeP = prec * sizeof (LITTLENUM_TYPE);
if (! target_big_endian)
{
for (i = prec - 1; i >= 0; i--)
{
md_number_to_chars (litP, (valueT) words[i],
sizeof (LITTLENUM_TYPE));
litP += sizeof (LITTLENUM_TYPE);
}
}
else
for (i = 0; i < prec; i++)
{
md_number_to_chars (litP, (valueT) words[i],
sizeof (LITTLENUM_TYPE));
litP += sizeof (LITTLENUM_TYPE);
}
return 0;
}
const char * md_shortopts = "";
#define OPTION_JSRI2BSR_ON (OPTION_MD_BASE + 0)
#define OPTION_JSRI2BSR_OFF (OPTION_MD_BASE + 1)
#define OPTION_SIFILTER_ON (OPTION_MD_BASE + 2)
#define OPTION_SIFILTER_OFF (OPTION_MD_BASE + 3)
#define OPTION_CPU (OPTION_MD_BASE + 4)
#define OPTION_EB (OPTION_MD_BASE + 5)
#define OPTION_EL (OPTION_MD_BASE + 6)
struct option md_longopts[] =
{
{ "no-jsri2bsr", no_argument, NULL, OPTION_JSRI2BSR_OFF},
{ "jsri2bsr", no_argument, NULL, OPTION_JSRI2BSR_ON},
{ "sifilter", no_argument, NULL, OPTION_SIFILTER_ON},
{ "no-sifilter", no_argument, NULL, OPTION_SIFILTER_OFF},
{ "cpu", required_argument, NULL, OPTION_CPU},
{ "EB", no_argument, NULL, OPTION_EB},
{ "EL", no_argument, NULL, OPTION_EL},
{ 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 OPTION_CPU:
if (streq (arg, "210"))
{
cpu = M210;
target_big_endian = 1;
}
else if (streq (arg, "340"))
cpu = M340;
else
as_warn (_("unrecognised cpu type '%s'"), arg);
break;
case OPTION_EB: target_big_endian = 1; break;
case OPTION_EL: target_big_endian = 0; cpu = M340; break;
case OPTION_JSRI2BSR_ON: do_jsri2bsr = 1; break;
case OPTION_JSRI2BSR_OFF: do_jsri2bsr = 0; break;
case OPTION_SIFILTER_ON: sifilter_mode = 1; break;
case OPTION_SIFILTER_OFF: sifilter_mode = 0; break;
default: return 0;
}
return 1;
}
void
md_show_usage (stream)
FILE * stream;
{
fprintf (stream, _("\
MCORE specific options:\n\
-{no-}jsri2bsr {dis}able jsri to bsr transformation (def: dis)\n\
-{no-}sifilter {dis}able silicon filter behavior (def: dis)\n\
-cpu=[210|340] select CPU type\n\
-EB assemble for a big endian system (default)\n\
-EL assemble for a little endian system\n"));
}
int md_short_jump_size;
void
md_create_short_jump (ptr, from_Nddr, to_Nddr, frag, to_symbol)
char * ptr ATTRIBUTE_UNUSED;
addressT from_Nddr ATTRIBUTE_UNUSED;
addressT to_Nddr ATTRIBUTE_UNUSED;
fragS * frag ATTRIBUTE_UNUSED;
symbolS * to_symbol ATTRIBUTE_UNUSED;
{
as_fatal (_("failed sanity check: short_jump"));
}
void
md_create_long_jump (ptr, from_Nddr, to_Nddr, frag, to_symbol)
char * ptr ATTRIBUTE_UNUSED;
addressT from_Nddr ATTRIBUTE_UNUSED;
addressT to_Nddr ATTRIBUTE_UNUSED;
fragS * frag ATTRIBUTE_UNUSED;
symbolS * to_symbol ATTRIBUTE_UNUSED;
{
as_fatal (_("failed sanity check: long_jump"));
}
/* Called after relaxing, change the frags so they know how big they are. */
void
md_convert_frag (abfd, sec, fragP)
bfd * abfd ATTRIBUTE_UNUSED;
segT sec ATTRIBUTE_UNUSED;
register fragS * fragP;
{
char *buffer;
int targ_addr = S_GET_VALUE (fragP->fr_symbol) + fragP->fr_offset;
buffer = fragP->fr_fix + fragP->fr_literal;
switch (fragP->fr_subtype)
{
case C (COND_JUMP, DISP12):
case C (UNCD_JUMP, DISP12):
{
/* Get the address of the end of the instruction. */
int next_inst = fragP->fr_fix + fragP->fr_address + 2;
unsigned char t0;
int disp = targ_addr - next_inst;
if (disp & 1)
as_bad (_("odd displacement at %x"), next_inst - 2);
disp >>= 1;
if (! target_big_endian)
{
t0 = buffer[1] & 0xF8;
md_number_to_chars (buffer, disp, 2);
buffer[1] = (buffer[1] & 0x07) | t0;
}
else
{
t0 = buffer[0] & 0xF8;
md_number_to_chars (buffer, disp, 2);
buffer[0] = (buffer[0] & 0x07) | t0;
}
fragP->fr_fix += 2;
}
break;
case C (COND_JUMP, DISP32):
case C (COND_JUMP, UNDEF_WORD_DISP):
{
/* A conditional branch wont fit into 12 bits so:
* b!cond 1f
* jmpi 0f
* .align 2
* 0: .long disp
* 1:
*
* if the b!cond is 4 byte aligned, the literal which would
* go at x+4 will also be aligned.
*/
int first_inst = fragP->fr_fix + fragP->fr_address;
int needpad = (first_inst & 3);
if (! target_big_endian)
buffer[1] ^= 0x08;
else
buffer[0] ^= 0x08; /* Toggle T/F bit */
buffer[2] = INST_BYTE0 (MCORE_INST_JMPI); /* Build jmpi */
buffer[3] = INST_BYTE1 (MCORE_INST_JMPI);
if (needpad)
{
if (! target_big_endian)
{
buffer[0] = 4; /* branch over jmpi, pad, and ptr */
buffer[2] = 1; /* jmpi offset of 1 gets the pointer */
}
else
{
buffer[1] = 4; /* branch over jmpi, pad, and ptr */
buffer[3] = 1; /* jmpi offset of 1 gets the pointer */
}
buffer[4] = 0; /* alignment/pad */
buffer[5] = 0;
buffer[6] = 0; /* space for 32 bit address */
buffer[7] = 0;
buffer[8] = 0;
buffer[9] = 0;
/* Make reloc for the long disp */
fix_new (fragP, fragP->fr_fix + 6, 4,
fragP->fr_symbol, fragP->fr_offset, 0, BFD_RELOC_32);
fragP->fr_fix += C32_LEN;
}
else
{
/* See comment below about this given gas' limitations for
shrinking the fragment. '3' is the amount of code that
we inserted here, but '4' is right for the space we reserved
for this fragment. */
if (! target_big_endian)
{
buffer[0] = 3; /* branch over jmpi, and ptr */
buffer[2] = 0; /* jmpi offset of 0 gets the pointer */
}
else
{
buffer[1] = 3; /* branch over jmpi, and ptr */
buffer[3] = 0; /* jmpi offset of 0 gets the pointer */
}
buffer[4] = 0; /* space for 32 bit address */
buffer[5] = 0;
buffer[6] = 0;
buffer[7] = 0;
/* Make reloc for the long disp. */
fix_new (fragP, fragP->fr_fix + 4, 4,
fragP->fr_symbol, fragP->fr_offset, 0, BFD_RELOC_32);
fragP->fr_fix += C32_LEN;
/* Frag is actually shorter (see the other side of this ifdef)
but gas isn't prepared for that. We have to re-adjust
the branch displacement so that it goes beyond the
full length of the fragment, not just what we actually
filled in. */
if (! target_big_endian)
buffer[0] = 4; /* jmpi, ptr, and the 'tail pad' */
else
buffer[1] = 4; /* jmpi, ptr, and the 'tail pad' */
}
}
break;
case C (UNCD_JUMP, DISP32):
case C (UNCD_JUMP, UNDEF_WORD_DISP):
{
/* An unconditional branch will not fit in 12 bits, make code which
looks like:
jmpi 0f
.align 2
0: .long disp
we need a pad if "first_inst" is 4 byte aligned.
[because the natural literal place is x + 2] */
int first_inst = fragP->fr_fix + fragP->fr_address;
int needpad = !(first_inst & 3);
buffer[0] = INST_BYTE0 (MCORE_INST_JMPI); /* Build jmpi */
buffer[1] = INST_BYTE1 (MCORE_INST_JMPI);
if (needpad)
{
if (! target_big_endian)
buffer[0] = 1; /* jmpi offset of 1 since padded */
else
buffer[1] = 1; /* jmpi offset of 1 since padded */
buffer[2] = 0; /* alignment */
buffer[3] = 0;
buffer[4] = 0; /* space for 32 bit address */
buffer[5] = 0;
buffer[6] = 0;
buffer[7] = 0;
/* Make reloc for the long disp. */
fix_new (fragP, fragP->fr_fix + 4, 4,
fragP->fr_symbol, fragP->fr_offset, 0, BFD_RELOC_32);
fragP->fr_fix += U32_LEN;
}
else
{
if (! target_big_endian)
buffer[0] = 0; /* jmpi offset of 0 if no pad */
else
buffer[1] = 0; /* jmpi offset of 0 if no pad */
buffer[2] = 0; /* space for 32 bit address */
buffer[3] = 0;
buffer[4] = 0;
buffer[5] = 0;
/* Make reloc for the long disp. */
fix_new (fragP, fragP->fr_fix + 2, 4,
fragP->fr_symbol, fragP->fr_offset, 0, BFD_RELOC_32);
fragP->fr_fix += U32_LEN;
}
}
break;
default:
abort ();
}
}
/* Applies the desired value to the specified location.
Also sets up addends for 'rela' type relocations. */
void
md_apply_fix3 (fixP, valP, segment)
fixS * fixP;
valueT * valP;
segT segment ATTRIBUTE_UNUSED;
{
char * buf = fixP->fx_where + fixP->fx_frag->fr_literal;
char * file = fixP->fx_file ? fixP->fx_file : _("unknown");
const char * symname;
/* Note: use offsetT because it is signed, valueT is unsigned. */
offsetT val = *valP;
symname = fixP->fx_addsy ? S_GET_NAME (fixP->fx_addsy) : _("<unknown>");
/* Save this for the addend in the relocation record. */
fixP->fx_addnumber = val;
if (fixP->fx_addsy != NULL)
{
#ifdef OBJ_ELF
/* For ELF we can just return and let the reloc that will be generated
take care of everything. For COFF we still have to insert 'val'
into the insn since the addend field will be ignored. */
return;
#endif
}
else
fixP->fx_done = 1;
switch (fixP->fx_r_type)
{
case BFD_RELOC_MCORE_PCREL_IMM11BY2: /* second byte of 2 byte opcode */
if ((val & 1) != 0)
as_bad_where (file, fixP->fx_line,
_("odd distance branch (0x%lx bytes)"), (long) val);
val /= 2;
if (((val & ~0x3ff) != 0) && ((val | 0x3ff) != -1))
as_bad_where (file, fixP->fx_line,
_("pcrel for branch to %s too far (0x%lx)"),
symname, (long) val);
if (target_big_endian)
{
buf[0] |= ((val >> 8) & 0x7);
buf[1] |= (val & 0xff);
}
else
{
buf[1] |= ((val >> 8) & 0x7);
buf[0] |= (val & 0xff);
}
break;
case BFD_RELOC_MCORE_PCREL_IMM8BY4: /* lower 8 bits of 2 byte opcode */
val += 3;
val /= 4;
if (val & ~0xff)
as_bad_where (file, fixP->fx_line,
_("pcrel for lrw/jmpi/jsri to %s too far (0x%lx)"),
symname, (long) val);
else if (! target_big_endian)
buf[0] |= (val & 0xff);
else
buf[1] |= (val & 0xff);
break;
case BFD_RELOC_MCORE_PCREL_IMM4BY2: /* loopt instruction */
if ((val < -32) || (val > -2))
as_bad_where (file, fixP->fx_line,
_("pcrel for loopt too far (0x%lx)"), (long) val);
val /= 2;
if (! target_big_endian)
buf[0] |= (val & 0xf);
else
buf[1] |= (val & 0xf);
break;
case BFD_RELOC_MCORE_PCREL_JSR_IMM11BY2:
/* Conditional linker map jsri to bsr. */
/* If its a local target and close enough, fix it.
NB: >= -2k for backwards bsr; < 2k for forwards... */
if (fixP->fx_addsy == 0 && val >= -2048 && val < 2048)
{
long nval = (val / 2) & 0x7ff;
nval |= MCORE_INST_BSR;
/* REPLACE the instruction, don't just modify it. */
buf[0] = INST_BYTE0 (nval);
buf[1] = INST_BYTE1 (nval);
}
else
fixP->fx_done = 0;
break;
case BFD_RELOC_MCORE_PCREL_32:
case BFD_RELOC_VTABLE_INHERIT:
case BFD_RELOC_VTABLE_ENTRY:
fixP->fx_done = 0;
break;
default:
if (fixP->fx_addsy != NULL)
{
/* If the fix is an absolute reloc based on a symbol's
address, then it cannot be resolved until the final link. */
fixP->fx_done = 0;
}
#ifdef OBJ_ELF
else
#endif
{
if (fixP->fx_size == 4)
;
else if (fixP->fx_size == 2 && val >= -32768 && val <= 32767)
;
else if (fixP->fx_size == 1 && val >= -256 && val <= 255)
;
else
abort ();
md_number_to_chars (buf, val, fixP->fx_size);
}
break;
}
}
void
md_operand (expressionP)
expressionS * expressionP;
{
/* Ignore leading hash symbol, if poresent. */
if (* input_line_pointer == '#')
{
input_line_pointer ++;
expression (expressionP);
}
}
int md_long_jump_size;
/* Called just before address relaxation, return the length
by which a fragment must grow to reach it's destination. */
int
md_estimate_size_before_relax (fragP, segment_type)
register fragS * fragP;
register segT segment_type;
{
switch (fragP->fr_subtype)
{
default:
abort ();
case C (UNCD_JUMP, UNDEF_DISP):
/* Used to be a branch to somewhere which was unknown. */
if (!fragP->fr_symbol)
{
fragP->fr_subtype = C (UNCD_JUMP, DISP12);
}
else if (S_GET_SEGMENT (fragP->fr_symbol) == segment_type)
{
fragP->fr_subtype = C (UNCD_JUMP, DISP12);
}
else
{
fragP->fr_subtype = C (UNCD_JUMP, UNDEF_WORD_DISP);
}
break;
case C (COND_JUMP, UNDEF_DISP):
/* Used to be a branch to somewhere which was unknown. */
if (fragP->fr_symbol
&& S_GET_SEGMENT (fragP->fr_symbol) == segment_type)
{
/* Got a symbol and it's defined in this segment, become byte
sized - maybe it will fix up */
fragP->fr_subtype = C (COND_JUMP, DISP12);
}
else if (fragP->fr_symbol)
{
/* Its got a segment, but its not ours, so it will always be long. */
fragP->fr_subtype = C (COND_JUMP, UNDEF_WORD_DISP);
}
else
{
/* We know the abs value. */
fragP->fr_subtype = C (COND_JUMP, DISP12);
}
break;
case C (UNCD_JUMP, DISP12):
case C (UNCD_JUMP, DISP32):
case C (UNCD_JUMP, UNDEF_WORD_DISP):
case C (COND_JUMP, DISP12):
case C (COND_JUMP, DISP32):
case C (COND_JUMP, UNDEF_WORD_DISP):
/* When relaxing a section for the second time, we don't need to
do anything besides return the current size. */
break;
}
return md_relax_table[fragP->fr_subtype].rlx_length;
}
/* Put number into target byte order. */
void
md_number_to_chars (ptr, use, nbytes)
char * ptr;
valueT use;
int nbytes;
{
if (! target_big_endian)
switch (nbytes)
{
case 4: ptr[3] = (use >> 24) & 0xff; /* fall through */
case 3: ptr[2] = (use >> 16) & 0xff; /* fall through */
case 2: ptr[1] = (use >> 8) & 0xff; /* fall through */
case 1: ptr[0] = (use >> 0) & 0xff; break;
default: abort ();
}
else
switch (nbytes)
{
case 4: *ptr++ = (use >> 24) & 0xff; /* fall through */
case 3: *ptr++ = (use >> 16) & 0xff; /* fall through */
case 2: *ptr++ = (use >> 8) & 0xff; /* fall through */
case 1: *ptr++ = (use >> 0) & 0xff; break;
default: abort ();
}
}
/* Round up a section size to the appropriate boundary. */
valueT
md_section_align (segment, size)
segT segment ATTRIBUTE_UNUSED;
valueT size;
{
return size; /* Byte alignment is fine */
}
/* The location from which a PC relative jump should be calculated,
given a PC relative reloc. */
long
md_pcrel_from_section (fixp, sec)
fixS * fixp;
segT sec ATTRIBUTE_UNUSED;
{
#ifdef OBJ_ELF
/* If the symbol is undefined or defined in another section
we leave the add number alone for the linker to fix it later.
Only account for the PC pre-bump (which is 2 bytes on the MCore). */
if (fixp->fx_addsy != (symbolS *) NULL
&& (! S_IS_DEFINED (fixp->fx_addsy)
|| (S_GET_SEGMENT (fixp->fx_addsy) != sec)))
{
assert (fixp->fx_size == 2); /* must be an insn */
return fixp->fx_size;
}
#endif
/* The case where we are going to resolve things... */
return fixp->fx_size + fixp->fx_where + fixp->fx_frag->fr_address;
}
#define F(SZ,PCREL) (((SZ) << 1) + (PCREL))
#define MAP(SZ,PCREL,TYPE) case F (SZ, PCREL): code = (TYPE); break
arelent *
tc_gen_reloc (section, fixp)
asection * section ATTRIBUTE_UNUSED;
fixS * fixp;
{
arelent * rel;
bfd_reloc_code_real_type code;
switch (fixp->fx_r_type)
{
/* These confuse the size/pcrel macro approach. */
case BFD_RELOC_VTABLE_INHERIT:
case BFD_RELOC_VTABLE_ENTRY:
case BFD_RELOC_MCORE_PCREL_IMM4BY2:
case BFD_RELOC_MCORE_PCREL_IMM8BY4:
case BFD_RELOC_MCORE_PCREL_IMM11BY2:
case BFD_RELOC_MCORE_PCREL_JSR_IMM11BY2:
case BFD_RELOC_RVA:
code = fixp->fx_r_type;
break;
default:
switch (F (fixp->fx_size, fixp->fx_pcrel))
{
MAP (1, 0, BFD_RELOC_8);
MAP (2, 0, BFD_RELOC_16);
MAP (4, 0, BFD_RELOC_32);
MAP (1, 1, BFD_RELOC_8_PCREL);
MAP (2, 1, BFD_RELOC_16_PCREL);
MAP (4, 1, BFD_RELOC_32_PCREL);
default:
code = fixp->fx_r_type;
as_bad (_("Can not do %d byte %srelocation"),
fixp->fx_size,
fixp->fx_pcrel ? _("pc-relative") : "");
}
break;
}
rel = (arelent *) xmalloc (sizeof (arelent));
rel->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
*rel->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
rel->address = fixp->fx_frag->fr_address + fixp->fx_where;
/* Always pass the addend along! */
rel->addend = fixp->fx_addnumber;
rel->howto = bfd_reloc_type_lookup (stdoutput, code);
if (rel->howto == NULL)
{
as_bad_where (fixp->fx_file, fixp->fx_line,
_("Cannot represent relocation type %s"),
bfd_get_reloc_code_name (code));
/* Set howto to a garbage value so that we can keep going. */
rel->howto = bfd_reloc_type_lookup (stdoutput, BFD_RELOC_32);
assert (rel->howto != NULL);
}
return rel;
}
#ifdef OBJ_ELF
/* See whether we need to force a relocation into the output file.
This is used to force out switch and PC relative relocations when
relaxing. */
int
mcore_force_relocation (fix)
fixS * fix;
{
if (fix->fx_r_type == BFD_RELOC_RVA)
return 1;
return generic_force_reloc (fix);
}
/* Return true if the fix can be handled by GAS, false if it must
be passed through to the linker. */
bfd_boolean
mcore_fix_adjustable (fixP)
fixS * fixP;
{
/* We need the symbol name for the VTABLE entries. */
if ( fixP->fx_r_type == BFD_RELOC_VTABLE_INHERIT
|| fixP->fx_r_type == BFD_RELOC_VTABLE_ENTRY)
return 0;
return 1;
}
#endif /* OBJ_ELF */
|