Don't merge if the storage class of the non-debug symbol is C_NULL.
[deliverable/binutils-gdb.git] / gas / config / tc-mn10300.c
1 /* tc-mn10300.c -- Assembler code for the Matsushita 10300
2 Copyright 1996, 1997, 1998, 1999, 2000, 2001
3 Free Software Foundation, Inc.
4
5 This file is part of GAS, the GNU Assembler.
6
7 GAS is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
10 any later version.
11
12 GAS is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with GAS; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
21
22 #include <stdio.h>
23 #include <ctype.h>
24 #include "as.h"
25 #include "subsegs.h"
26 #include "opcode/mn10300.h"
27 #include "dwarf2dbg.h"
28 \f
29 /* Structure to hold information about predefined registers. */
30 struct reg_name
31 {
32 const char *name;
33 int value;
34 };
35
36 /* Generic assembler global variables which must be defined by all
37 targets. */
38
39 /* Characters which always start a comment. */
40 const char comment_chars[] = "#";
41
42 /* Characters which start a comment at the beginning of a line. */
43 const char line_comment_chars[] = ";#";
44
45 /* Characters which may be used to separate multiple commands on a
46 single line. */
47 const char line_separator_chars[] = ";";
48
49 /* Characters which are used to indicate an exponent in a floating
50 point number. */
51 const char EXP_CHARS[] = "eE";
52
53 /* Characters which mean that a number is a floating point constant,
54 as in 0d1.0. */
55 const char FLT_CHARS[] = "dD";
56 \f
57 const relax_typeS md_relax_table[] = {
58 /* bCC relaxing */
59 {0x7f, -0x80, 2, 1},
60 {0x7fff, -0x8000, 5, 2},
61 {0x7fffffff, -0x80000000, 7, 0},
62
63 /* bCC relaxing (uncommon cases) */
64 {0x7f, -0x80, 3, 4},
65 {0x7fff, -0x8000, 6, 5},
66 {0x7fffffff, -0x80000000, 8, 0},
67
68 /* call relaxing */
69 {0x7fff, -0x8000, 5, 7},
70 {0x7fffffff, -0x80000000, 7, 0},
71
72 /* calls relaxing */
73 {0x7fff, -0x8000, 4, 9},
74 {0x7fffffff, -0x80000000, 6, 0},
75
76 /* jmp relaxing */
77 {0x7f, -0x80, 2, 11},
78 {0x7fff, -0x8000, 3, 12},
79 {0x7fffffff, -0x80000000, 5, 0},
80
81 };
82
83 /* Local functions. */
84 static void mn10300_insert_operand PARAMS ((unsigned long *, unsigned long *,
85 const struct mn10300_operand *,
86 offsetT, char *, unsigned,
87 unsigned));
88 static unsigned long check_operand PARAMS ((unsigned long,
89 const struct mn10300_operand *,
90 offsetT));
91 static int reg_name_search PARAMS ((const struct reg_name *, int, const char *));
92 static boolean data_register_name PARAMS ((expressionS *expressionP));
93 static boolean address_register_name PARAMS ((expressionS *expressionP));
94 static boolean other_register_name PARAMS ((expressionS *expressionP));
95 static void set_arch_mach PARAMS ((int));
96
97 /* Set linkrelax here to avoid fixups in most sections. */
98 int linkrelax = 1;
99
100 static int current_machine;
101
102 /* Fixups. */
103 #define MAX_INSN_FIXUPS (5)
104 struct mn10300_fixup
105 {
106 expressionS exp;
107 int opindex;
108 bfd_reloc_code_real_type reloc;
109 };
110 struct mn10300_fixup fixups[MAX_INSN_FIXUPS];
111 static int fc;
112
113 /* We must store the value of each register operand so that we can
114 verify that certain registers do not match. */
115 int mn10300_reg_operands[MN10300_MAX_OPERANDS];
116 \f
117 const char *md_shortopts = "";
118 struct option md_longopts[] = {
119 {NULL, no_argument, NULL, 0}
120 };
121 size_t md_longopts_size = sizeof (md_longopts);
122
123 /* The target specific pseudo-ops which we support. */
124 const pseudo_typeS md_pseudo_table[] =
125 {
126 { "file", dwarf2_directive_file, 0 },
127 { "loc", dwarf2_directive_loc, 0 },
128 { "am30", set_arch_mach, AM30 },
129 { "am33", set_arch_mach, AM33 },
130 { "mn10300", set_arch_mach, MN103 },
131 {NULL, 0, 0}
132 };
133
134 #define HAVE_AM33 (current_machine == AM33)
135 #define HAVE_AM30 (current_machine == AM30)
136
137 /* Opcode hash table. */
138 static struct hash_control *mn10300_hash;
139
140 /* This table is sorted. Suitable for searching by a binary search. */
141 static const struct reg_name data_registers[] =
142 {
143 { "d0", 0 },
144 { "d1", 1 },
145 { "d2", 2 },
146 { "d3", 3 },
147 };
148 #define DATA_REG_NAME_CNT \
149 (sizeof (data_registers) / sizeof (struct reg_name))
150
151 static const struct reg_name address_registers[] =
152 {
153 { "a0", 0 },
154 { "a1", 1 },
155 { "a2", 2 },
156 { "a3", 3 },
157 };
158
159 #define ADDRESS_REG_NAME_CNT \
160 (sizeof (address_registers) / sizeof (struct reg_name))
161
162 static const struct reg_name r_registers[] =
163 {
164 { "a0", 8 },
165 { "a1", 9 },
166 { "a2", 10 },
167 { "a3", 11 },
168 { "d0", 12 },
169 { "d1", 13 },
170 { "d2", 14 },
171 { "d3", 15 },
172 { "e0", 0 },
173 { "e1", 1 },
174 { "e10", 10 },
175 { "e11", 11 },
176 { "e12", 12 },
177 { "e13", 13 },
178 { "e14", 14 },
179 { "e15", 15 },
180 { "e2", 2 },
181 { "e3", 3 },
182 { "e4", 4 },
183 { "e5", 5 },
184 { "e6", 6 },
185 { "e7", 7 },
186 { "e8", 8 },
187 { "e9", 9 },
188 { "r0", 0 },
189 { "r1", 1 },
190 { "r10", 10 },
191 { "r11", 11 },
192 { "r12", 12 },
193 { "r13", 13 },
194 { "r14", 14 },
195 { "r15", 15 },
196 { "r2", 2 },
197 { "r3", 3 },
198 { "r4", 4 },
199 { "r5", 5 },
200 { "r6", 6 },
201 { "r7", 7 },
202 { "r8", 8 },
203 { "r9", 9 },
204 };
205
206 #define R_REG_NAME_CNT \
207 (sizeof (r_registers) / sizeof (struct reg_name))
208
209 static const struct reg_name xr_registers[] =
210 {
211 { "mcrh", 2 },
212 { "mcrl", 3 },
213 { "mcvf", 4 },
214 { "mdrq", 1 },
215 { "pc", 0 },
216 { "sp", 0 },
217 { "xr0", 0 },
218 { "xr1", 1 },
219 { "xr10", 10 },
220 { "xr11", 11 },
221 { "xr12", 12 },
222 { "xr13", 13 },
223 { "xr14", 14 },
224 { "xr15", 15 },
225 { "xr2", 2 },
226 { "xr3", 3 },
227 { "xr4", 4 },
228 { "xr5", 5 },
229 { "xr6", 6 },
230 { "xr7", 7 },
231 { "xr8", 8 },
232 { "xr9", 9 },
233 };
234
235 #define XR_REG_NAME_CNT \
236 (sizeof (xr_registers) / sizeof (struct reg_name))
237
238 static const struct reg_name other_registers[] =
239 {
240 { "mdr", 0 },
241 { "psw", 0 },
242 { "sp", 0 },
243 };
244
245 #define OTHER_REG_NAME_CNT \
246 (sizeof (other_registers) / sizeof (struct reg_name))
247
248 /* reg_name_search does a binary search of the given register table
249 to see if "name" is a valid regiter name. Returns the register
250 number from the array on success, or -1 on failure. */
251
252 static int
253 reg_name_search (regs, regcount, name)
254 const struct reg_name *regs;
255 int regcount;
256 const char *name;
257 {
258 int middle, low, high;
259 int cmp;
260
261 low = 0;
262 high = regcount - 1;
263
264 do
265 {
266 middle = (low + high) / 2;
267 cmp = strcasecmp (name, regs[middle].name);
268 if (cmp < 0)
269 high = middle - 1;
270 else if (cmp > 0)
271 low = middle + 1;
272 else
273 return regs[middle].value;
274 }
275 while (low <= high);
276 return -1;
277 }
278
279 /* Summary of register_name().
280 *
281 * in: Input_line_pointer points to 1st char of operand.
282 *
283 * out: A expressionS.
284 * The operand may have been a register: in this case, X_op == O_register,
285 * X_add_number is set to the register number, and truth is returned.
286 * Input_line_pointer->(next non-blank) char after operand, or is in
287 * its original state.
288 */
289
290 static boolean
291 r_register_name (expressionP)
292 expressionS *expressionP;
293 {
294 int reg_number;
295 char *name;
296 char *start;
297 char c;
298
299 /* Find the spelling of the operand. */
300 start = name = input_line_pointer;
301
302 c = get_symbol_end ();
303 reg_number = reg_name_search (r_registers, R_REG_NAME_CNT, name);
304
305 /* Look to see if it's in the register table. */
306 if (reg_number >= 0)
307 {
308 expressionP->X_op = O_register;
309 expressionP->X_add_number = reg_number;
310
311 /* Make the rest nice. */
312 expressionP->X_add_symbol = NULL;
313 expressionP->X_op_symbol = NULL;
314
315 /* Put back the delimiting char. */
316 *input_line_pointer = c;
317 return true;
318 }
319 else
320 {
321 /* Reset the line as if we had not done anything. */
322 /* Put back the delimiting char. */
323 *input_line_pointer = c;
324
325 /* Reset input_line pointer. */
326 input_line_pointer = start;
327 return false;
328 }
329 }
330
331 /* Summary of register_name().
332 *
333 * in: Input_line_pointer points to 1st char of operand.
334 *
335 * out: A expressionS.
336 * The operand may have been a register: in this case, X_op == O_register,
337 * X_add_number is set to the register number, and truth is returned.
338 * Input_line_pointer->(next non-blank) char after operand, or is in
339 * its original state.
340 */
341
342 static boolean
343 xr_register_name (expressionP)
344 expressionS *expressionP;
345 {
346 int reg_number;
347 char *name;
348 char *start;
349 char c;
350
351 /* Find the spelling of the operand. */
352 start = name = input_line_pointer;
353
354 c = get_symbol_end ();
355 reg_number = reg_name_search (xr_registers, XR_REG_NAME_CNT, name);
356
357 /* Look to see if it's in the register table. */
358 if (reg_number >= 0)
359 {
360 expressionP->X_op = O_register;
361 expressionP->X_add_number = reg_number;
362
363 /* Make the rest nice. */
364 expressionP->X_add_symbol = NULL;
365 expressionP->X_op_symbol = NULL;
366
367 /* Put back the delimiting char. */
368 *input_line_pointer = c;
369 return true;
370 }
371 else
372 {
373 /* Reset the line as if we had not done anything. */
374 /* Put back the delimiting char. */
375 *input_line_pointer = c;
376
377 /* Reset input_line pointer. */
378 input_line_pointer = start;
379 return false;
380 }
381 }
382
383 /* Summary of register_name().
384 *
385 * in: Input_line_pointer points to 1st char of operand.
386 *
387 * out: A expressionS.
388 * The operand may have been a register: in this case, X_op == O_register,
389 * X_add_number is set to the register number, and truth is returned.
390 * Input_line_pointer->(next non-blank) char after operand, or is in
391 * its original state.
392 */
393
394 static boolean
395 data_register_name (expressionP)
396 expressionS *expressionP;
397 {
398 int reg_number;
399 char *name;
400 char *start;
401 char c;
402
403 /* Find the spelling of the operand. */
404 start = name = input_line_pointer;
405
406 c = get_symbol_end ();
407 reg_number = reg_name_search (data_registers, DATA_REG_NAME_CNT, name);
408
409 /* Look to see if it's in the register table. */
410 if (reg_number >= 0)
411 {
412 expressionP->X_op = O_register;
413 expressionP->X_add_number = reg_number;
414
415 /* Make the rest nice. */
416 expressionP->X_add_symbol = NULL;
417 expressionP->X_op_symbol = NULL;
418
419 /* Put back the delimiting char. */
420 *input_line_pointer = c;
421 return true;
422 }
423 else
424 {
425 /* Reset the line as if we had not done anything. */
426 /* Put back the delimiting char. */
427 *input_line_pointer = c;
428
429 /* Reset input_line pointer. */
430 input_line_pointer = start;
431 return false;
432 }
433 }
434
435 /* Summary of register_name().
436 *
437 * in: Input_line_pointer points to 1st char of operand.
438 *
439 * out: A expressionS.
440 * The operand may have been a register: in this case, X_op == O_register,
441 * X_add_number is set to the register number, and truth is returned.
442 * Input_line_pointer->(next non-blank) char after operand, or is in
443 * its original state.
444 */
445
446 static boolean
447 address_register_name (expressionP)
448 expressionS *expressionP;
449 {
450 int reg_number;
451 char *name;
452 char *start;
453 char c;
454
455 /* Find the spelling of the operand. */
456 start = name = input_line_pointer;
457
458 c = get_symbol_end ();
459 reg_number = reg_name_search (address_registers, ADDRESS_REG_NAME_CNT, name);
460
461 /* Look to see if it's in the register table. */
462 if (reg_number >= 0)
463 {
464 expressionP->X_op = O_register;
465 expressionP->X_add_number = reg_number;
466
467 /* Make the rest nice. */
468 expressionP->X_add_symbol = NULL;
469 expressionP->X_op_symbol = NULL;
470
471 /* Put back the delimiting char. */
472 *input_line_pointer = c;
473 return true;
474 }
475 else
476 {
477 /* Reset the line as if we had not done anything. */
478 /* Put back the delimiting char. */
479 *input_line_pointer = c;
480
481 /* Reset input_line pointer. */
482 input_line_pointer = start;
483
484 return false;
485 }
486 }
487
488 /* Summary of register_name().
489 *
490 * in: Input_line_pointer points to 1st char of operand.
491 *
492 * out: A expressionS.
493 * The operand may have been a register: in this case, X_op == O_register,
494 * X_add_number is set to the register number, and truth is returned.
495 * Input_line_pointer->(next non-blank) char after operand, or is in
496 * its original state.
497 */
498
499 static boolean
500 other_register_name (expressionP)
501 expressionS *expressionP;
502 {
503 int reg_number;
504 char *name;
505 char *start;
506 char c;
507
508 /* Find the spelling of the operand. */
509 start = name = input_line_pointer;
510
511 c = get_symbol_end ();
512 reg_number = reg_name_search (other_registers, OTHER_REG_NAME_CNT, name);
513
514 /* Look to see if it's in the register table. */
515 if (reg_number >= 0)
516 {
517 expressionP->X_op = O_register;
518 expressionP->X_add_number = reg_number;
519
520 /* Make the rest nice. */
521 expressionP->X_add_symbol = NULL;
522 expressionP->X_op_symbol = NULL;
523
524 /* Put back the delimiting char. */
525 *input_line_pointer = c;
526 return true;
527 }
528 else
529 {
530 /* Reset the line as if we had not done anything. */
531 /* Put back the delimiting char. */
532 *input_line_pointer = c;
533
534 /* Reset input_line pointer. */
535 input_line_pointer = start;
536 return false;
537 }
538 }
539
540 void
541 md_show_usage (stream)
542 FILE *stream;
543 {
544 fprintf (stream, _("MN10300 options:\n\
545 none yet\n"));
546 }
547
548 int
549 md_parse_option (c, arg)
550 int c ATTRIBUTE_UNUSED;
551 char *arg ATTRIBUTE_UNUSED;
552 {
553 return 0;
554 }
555
556 symbolS *
557 md_undefined_symbol (name)
558 char *name ATTRIBUTE_UNUSED;
559 {
560 return 0;
561 }
562
563 char *
564 md_atof (type, litp, sizep)
565 int type;
566 char *litp;
567 int *sizep;
568 {
569 int prec;
570 LITTLENUM_TYPE words[4];
571 char *t;
572 int i;
573
574 switch (type)
575 {
576 case 'f':
577 prec = 2;
578 break;
579
580 case 'd':
581 prec = 4;
582 break;
583
584 default:
585 *sizep = 0;
586 return "bad call to md_atof";
587 }
588
589 t = atof_ieee (input_line_pointer, type, words);
590 if (t)
591 input_line_pointer = t;
592
593 *sizep = prec * 2;
594
595 for (i = prec - 1; i >= 0; i--)
596 {
597 md_number_to_chars (litp, (valueT) words[i], 2);
598 litp += 2;
599 }
600
601 return NULL;
602 }
603
604 void
605 md_convert_frag (abfd, sec, fragP)
606 bfd *abfd ATTRIBUTE_UNUSED;
607 asection *sec;
608 fragS *fragP;
609 {
610 static unsigned long label_count = 0;
611 char buf[40];
612
613 subseg_change (sec, 0);
614 if (fragP->fr_subtype == 0)
615 {
616 fix_new (fragP, fragP->fr_fix + 1, 1, fragP->fr_symbol,
617 fragP->fr_offset + 1, 1, BFD_RELOC_8_PCREL);
618 fragP->fr_var = 0;
619 fragP->fr_fix += 2;
620 }
621 else if (fragP->fr_subtype == 1)
622 {
623 /* Reverse the condition of the first branch. */
624 int offset = fragP->fr_fix;
625 int opcode = fragP->fr_literal[offset] & 0xff;
626
627 switch (opcode)
628 {
629 case 0xc8:
630 opcode = 0xc9;
631 break;
632 case 0xc9:
633 opcode = 0xc8;
634 break;
635 case 0xc0:
636 opcode = 0xc2;
637 break;
638 case 0xc2:
639 opcode = 0xc0;
640 break;
641 case 0xc3:
642 opcode = 0xc1;
643 break;
644 case 0xc1:
645 opcode = 0xc3;
646 break;
647 case 0xc4:
648 opcode = 0xc6;
649 break;
650 case 0xc6:
651 opcode = 0xc4;
652 break;
653 case 0xc7:
654 opcode = 0xc5;
655 break;
656 case 0xc5:
657 opcode = 0xc7;
658 break;
659 default:
660 abort ();
661 }
662 fragP->fr_literal[offset] = opcode;
663
664 /* Create a fixup for the reversed conditional branch. */
665 sprintf (buf, ".%s_%ld", FAKE_LABEL_NAME, label_count++);
666 fix_new (fragP, fragP->fr_fix + 1, 1,
667 symbol_new (buf, sec, 0, fragP->fr_next),
668 fragP->fr_offset + 1, 1, BFD_RELOC_8_PCREL);
669
670 /* Now create the unconditional branch + fixup to the
671 final target. */
672 fragP->fr_literal[offset + 2] = 0xcc;
673 fix_new (fragP, fragP->fr_fix + 3, 2, fragP->fr_symbol,
674 fragP->fr_offset + 1, 1, BFD_RELOC_16_PCREL);
675 fragP->fr_var = 0;
676 fragP->fr_fix += 5;
677 }
678 else if (fragP->fr_subtype == 2)
679 {
680 /* Reverse the condition of the first branch. */
681 int offset = fragP->fr_fix;
682 int opcode = fragP->fr_literal[offset] & 0xff;
683
684 switch (opcode)
685 {
686 case 0xc8:
687 opcode = 0xc9;
688 break;
689 case 0xc9:
690 opcode = 0xc8;
691 break;
692 case 0xc0:
693 opcode = 0xc2;
694 break;
695 case 0xc2:
696 opcode = 0xc0;
697 break;
698 case 0xc3:
699 opcode = 0xc1;
700 break;
701 case 0xc1:
702 opcode = 0xc3;
703 break;
704 case 0xc4:
705 opcode = 0xc6;
706 break;
707 case 0xc6:
708 opcode = 0xc4;
709 break;
710 case 0xc7:
711 opcode = 0xc5;
712 break;
713 case 0xc5:
714 opcode = 0xc7;
715 break;
716 default:
717 abort ();
718 }
719 fragP->fr_literal[offset] = opcode;
720
721 /* Create a fixup for the reversed conditional branch. */
722 sprintf (buf, ".%s_%ld", FAKE_LABEL_NAME, label_count++);
723 fix_new (fragP, fragP->fr_fix + 1, 1,
724 symbol_new (buf, sec, 0, fragP->fr_next),
725 fragP->fr_offset + 1, 1, BFD_RELOC_8_PCREL);
726
727 /* Now create the unconditional branch + fixup to the
728 final target. */
729 fragP->fr_literal[offset + 2] = 0xdc;
730 fix_new (fragP, fragP->fr_fix + 3, 4, fragP->fr_symbol,
731 fragP->fr_offset + 1, 1, BFD_RELOC_32_PCREL);
732 fragP->fr_var = 0;
733 fragP->fr_fix += 7;
734 }
735 else if (fragP->fr_subtype == 3)
736 {
737 fix_new (fragP, fragP->fr_fix + 2, 1, fragP->fr_symbol,
738 fragP->fr_offset + 2, 1, BFD_RELOC_8_PCREL);
739 fragP->fr_var = 0;
740 fragP->fr_fix += 3;
741 }
742 else if (fragP->fr_subtype == 4)
743 {
744 /* Reverse the condition of the first branch. */
745 int offset = fragP->fr_fix;
746 int opcode = fragP->fr_literal[offset + 1] & 0xff;
747
748 switch (opcode)
749 {
750 case 0xe8:
751 opcode = 0xe9;
752 break;
753 case 0xe9:
754 opcode = 0xe8;
755 break;
756 case 0xea:
757 opcode = 0xeb;
758 break;
759 case 0xeb:
760 opcode = 0xea;
761 break;
762 default:
763 abort ();
764 }
765 fragP->fr_literal[offset + 1] = opcode;
766
767 /* Create a fixup for the reversed conditional branch. */
768 sprintf (buf, ".%s_%ld", FAKE_LABEL_NAME, label_count++);
769 fix_new (fragP, fragP->fr_fix + 2, 1,
770 symbol_new (buf, sec, 0, fragP->fr_next),
771 fragP->fr_offset + 2, 1, BFD_RELOC_8_PCREL);
772
773 /* Now create the unconditional branch + fixup to the
774 final target. */
775 fragP->fr_literal[offset + 3] = 0xcc;
776 fix_new (fragP, fragP->fr_fix + 4, 2, fragP->fr_symbol,
777 fragP->fr_offset + 1, 1, BFD_RELOC_16_PCREL);
778 fragP->fr_var = 0;
779 fragP->fr_fix += 6;
780 }
781 else if (fragP->fr_subtype == 5)
782 {
783 /* Reverse the condition of the first branch. */
784 int offset = fragP->fr_fix;
785 int opcode = fragP->fr_literal[offset + 1] & 0xff;
786
787 switch (opcode)
788 {
789 case 0xe8:
790 opcode = 0xe9;
791 break;
792 case 0xea:
793 opcode = 0xeb;
794 break;
795 case 0xeb:
796 opcode = 0xea;
797 break;
798 default:
799 abort ();
800 }
801 fragP->fr_literal[offset + 1] = opcode;
802
803 /* Create a fixup for the reversed conditional branch. */
804 sprintf (buf, ".%s_%ld", FAKE_LABEL_NAME, label_count++);
805 fix_new (fragP, fragP->fr_fix + 2, 1,
806 symbol_new (buf, sec, 0, fragP->fr_next),
807 fragP->fr_offset + 2, 1, BFD_RELOC_8_PCREL);
808
809 /* Now create the unconditional branch + fixup to the
810 final target. */
811 fragP->fr_literal[offset + 3] = 0xdc;
812 fix_new (fragP, fragP->fr_fix + 4, 4, fragP->fr_symbol,
813 fragP->fr_offset + 1, 1, BFD_RELOC_32_PCREL);
814 fragP->fr_var = 0;
815 fragP->fr_fix += 8;
816 }
817 else if (fragP->fr_subtype == 6)
818 {
819 int offset = fragP->fr_fix;
820 fragP->fr_literal[offset] = 0xcd;
821 fix_new (fragP, fragP->fr_fix + 1, 2, fragP->fr_symbol,
822 fragP->fr_offset + 1, 1, BFD_RELOC_16_PCREL);
823 fragP->fr_var = 0;
824 fragP->fr_fix += 5;
825 }
826 else if (fragP->fr_subtype == 7)
827 {
828 int offset = fragP->fr_fix;
829 fragP->fr_literal[offset] = 0xdd;
830 fragP->fr_literal[offset + 5] = fragP->fr_literal[offset + 3];
831 fragP->fr_literal[offset + 6] = fragP->fr_literal[offset + 4];
832
833 fix_new (fragP, fragP->fr_fix + 1, 4, fragP->fr_symbol,
834 fragP->fr_offset + 1, 1, BFD_RELOC_32_PCREL);
835 fragP->fr_var = 0;
836 fragP->fr_fix += 7;
837 }
838 else if (fragP->fr_subtype == 8)
839 {
840 int offset = fragP->fr_fix;
841 fragP->fr_literal[offset] = 0xfa;
842 fragP->fr_literal[offset + 1] = 0xff;
843 fix_new (fragP, fragP->fr_fix + 2, 2, fragP->fr_symbol,
844 fragP->fr_offset + 2, 1, BFD_RELOC_16_PCREL);
845 fragP->fr_var = 0;
846 fragP->fr_fix += 4;
847 }
848 else if (fragP->fr_subtype == 9)
849 {
850 int offset = fragP->fr_fix;
851 fragP->fr_literal[offset] = 0xfc;
852 fragP->fr_literal[offset + 1] = 0xff;
853
854 fix_new (fragP, fragP->fr_fix + 2, 4, fragP->fr_symbol,
855 fragP->fr_offset + 2, 1, BFD_RELOC_32_PCREL);
856 fragP->fr_var = 0;
857 fragP->fr_fix += 6;
858 }
859 else if (fragP->fr_subtype == 10)
860 {
861 fragP->fr_literal[fragP->fr_fix] = 0xca;
862 fix_new (fragP, fragP->fr_fix + 1, 1, fragP->fr_symbol,
863 fragP->fr_offset + 1, 1, BFD_RELOC_8_PCREL);
864 fragP->fr_var = 0;
865 fragP->fr_fix += 2;
866 }
867 else if (fragP->fr_subtype == 11)
868 {
869 int offset = fragP->fr_fix;
870 fragP->fr_literal[offset] = 0xcc;
871
872 fix_new (fragP, fragP->fr_fix + 1, 4, fragP->fr_symbol,
873 fragP->fr_offset + 1, 1, BFD_RELOC_16_PCREL);
874 fragP->fr_var = 0;
875 fragP->fr_fix += 3;
876 }
877 else if (fragP->fr_subtype == 12)
878 {
879 int offset = fragP->fr_fix;
880 fragP->fr_literal[offset] = 0xdc;
881
882 fix_new (fragP, fragP->fr_fix + 1, 4, fragP->fr_symbol,
883 fragP->fr_offset + 1, 1, BFD_RELOC_32_PCREL);
884 fragP->fr_var = 0;
885 fragP->fr_fix += 5;
886 }
887 else
888 abort ();
889 }
890
891 valueT
892 md_section_align (seg, addr)
893 asection *seg;
894 valueT addr;
895 {
896 int align = bfd_get_section_alignment (stdoutput, seg);
897 return ((addr + (1 << align) - 1) & (-1 << align));
898 }
899
900 void
901 md_begin ()
902 {
903 char *prev_name = "";
904 register const struct mn10300_opcode *op;
905
906 mn10300_hash = hash_new ();
907
908 /* Insert unique names into hash table. The MN10300 instruction set
909 has many identical opcode names that have different opcodes based
910 on the operands. This hash table then provides a quick index to
911 the first opcode with a particular name in the opcode table. */
912
913 op = mn10300_opcodes;
914 while (op->name)
915 {
916 if (strcmp (prev_name, op->name))
917 {
918 prev_name = (char *) op->name;
919 hash_insert (mn10300_hash, op->name, (char *) op);
920 }
921 op++;
922 }
923
924 /* Set the default machine type. */
925 if (!bfd_set_arch_mach (stdoutput, bfd_arch_mn10300, MN103))
926 as_warn (_("could not set architecture and machine"));
927
928 current_machine = MN103;
929 }
930
931 void
932 md_assemble (str)
933 char *str;
934 {
935 char *s;
936 struct mn10300_opcode *opcode;
937 struct mn10300_opcode *next_opcode;
938 const unsigned char *opindex_ptr;
939 int next_opindex, relaxable;
940 unsigned long insn, extension, size = 0;
941 char *f;
942 int i;
943 int match;
944
945 /* Get the opcode. */
946 for (s = str; *s != '\0' && !isspace (*s); s++)
947 ;
948 if (*s != '\0')
949 *s++ = '\0';
950
951 /* Find the first opcode with the proper name. */
952 opcode = (struct mn10300_opcode *) hash_find (mn10300_hash, str);
953 if (opcode == NULL)
954 {
955 as_bad (_("Unrecognized opcode: `%s'"), str);
956 return;
957 }
958
959 str = s;
960 while (isspace (*str))
961 ++str;
962
963 input_line_pointer = str;
964
965 for (;;)
966 {
967 const char *errmsg;
968 int op_idx;
969 char *hold;
970 int extra_shift = 0;
971
972 errmsg = _("Invalid opcode/operands");
973
974 /* Reset the array of register operands. */
975 memset (mn10300_reg_operands, -1, sizeof (mn10300_reg_operands));
976
977 relaxable = 0;
978 fc = 0;
979 match = 0;
980 next_opindex = 0;
981 insn = opcode->opcode;
982 extension = 0;
983
984 /* If the instruction is not available on the current machine
985 then it can not possibly match. */
986 if (opcode->machine
987 && !(opcode->machine == AM33 && HAVE_AM33)
988 && !(opcode->machine == AM30 && HAVE_AM30))
989 goto error;
990
991 for (op_idx = 1, opindex_ptr = opcode->operands;
992 *opindex_ptr != 0;
993 opindex_ptr++, op_idx++)
994 {
995 const struct mn10300_operand *operand;
996 expressionS ex;
997
998 if (next_opindex == 0)
999 {
1000 operand = &mn10300_operands[*opindex_ptr];
1001 }
1002 else
1003 {
1004 operand = &mn10300_operands[next_opindex];
1005 next_opindex = 0;
1006 }
1007
1008 while (*str == ' ' || *str == ',')
1009 ++str;
1010
1011 if (operand->flags & MN10300_OPERAND_RELAX)
1012 relaxable = 1;
1013
1014 /* Gather the operand. */
1015 hold = input_line_pointer;
1016 input_line_pointer = str;
1017
1018 if (operand->flags & MN10300_OPERAND_PAREN)
1019 {
1020 if (*input_line_pointer != ')' && *input_line_pointer != '(')
1021 {
1022 input_line_pointer = hold;
1023 str = hold;
1024 goto error;
1025 }
1026 input_line_pointer++;
1027 goto keep_going;
1028 }
1029 /* See if we can match the operands. */
1030 else if (operand->flags & MN10300_OPERAND_DREG)
1031 {
1032 if (!data_register_name (&ex))
1033 {
1034 input_line_pointer = hold;
1035 str = hold;
1036 goto error;
1037 }
1038 }
1039 else if (operand->flags & MN10300_OPERAND_AREG)
1040 {
1041 if (!address_register_name (&ex))
1042 {
1043 input_line_pointer = hold;
1044 str = hold;
1045 goto error;
1046 }
1047 }
1048 else if (operand->flags & MN10300_OPERAND_SP)
1049 {
1050 char *start = input_line_pointer;
1051 char c = get_symbol_end ();
1052
1053 if (strcasecmp (start, "sp") != 0)
1054 {
1055 *input_line_pointer = c;
1056 input_line_pointer = hold;
1057 str = hold;
1058 goto error;
1059 }
1060 *input_line_pointer = c;
1061 goto keep_going;
1062 }
1063 else if (operand->flags & MN10300_OPERAND_RREG)
1064 {
1065 if (!r_register_name (&ex))
1066 {
1067 input_line_pointer = hold;
1068 str = hold;
1069 goto error;
1070 }
1071 }
1072 else if (operand->flags & MN10300_OPERAND_XRREG)
1073 {
1074 if (!xr_register_name (&ex))
1075 {
1076 input_line_pointer = hold;
1077 str = hold;
1078 goto error;
1079 }
1080 }
1081 else if (operand->flags & MN10300_OPERAND_USP)
1082 {
1083 char *start = input_line_pointer;
1084 char c = get_symbol_end ();
1085
1086 if (strcasecmp (start, "usp") != 0)
1087 {
1088 *input_line_pointer = c;
1089 input_line_pointer = hold;
1090 str = hold;
1091 goto error;
1092 }
1093 *input_line_pointer = c;
1094 goto keep_going;
1095 }
1096 else if (operand->flags & MN10300_OPERAND_SSP)
1097 {
1098 char *start = input_line_pointer;
1099 char c = get_symbol_end ();
1100
1101 if (strcasecmp (start, "ssp") != 0)
1102 {
1103 *input_line_pointer = c;
1104 input_line_pointer = hold;
1105 str = hold;
1106 goto error;
1107 }
1108 *input_line_pointer = c;
1109 goto keep_going;
1110 }
1111 else if (operand->flags & MN10300_OPERAND_MSP)
1112 {
1113 char *start = input_line_pointer;
1114 char c = get_symbol_end ();
1115
1116 if (strcasecmp (start, "msp") != 0)
1117 {
1118 *input_line_pointer = c;
1119 input_line_pointer = hold;
1120 str = hold;
1121 goto error;
1122 }
1123 *input_line_pointer = c;
1124 goto keep_going;
1125 }
1126 else if (operand->flags & MN10300_OPERAND_PC)
1127 {
1128 char *start = input_line_pointer;
1129 char c = get_symbol_end ();
1130
1131 if (strcasecmp (start, "pc") != 0)
1132 {
1133 *input_line_pointer = c;
1134 input_line_pointer = hold;
1135 str = hold;
1136 goto error;
1137 }
1138 *input_line_pointer = c;
1139 goto keep_going;
1140 }
1141 else if (operand->flags & MN10300_OPERAND_EPSW)
1142 {
1143 char *start = input_line_pointer;
1144 char c = get_symbol_end ();
1145
1146 if (strcasecmp (start, "epsw") != 0)
1147 {
1148 *input_line_pointer = c;
1149 input_line_pointer = hold;
1150 str = hold;
1151 goto error;
1152 }
1153 *input_line_pointer = c;
1154 goto keep_going;
1155 }
1156 else if (operand->flags & MN10300_OPERAND_PLUS)
1157 {
1158 if (*input_line_pointer != '+')
1159 {
1160 input_line_pointer = hold;
1161 str = hold;
1162 goto error;
1163 }
1164 input_line_pointer++;
1165 goto keep_going;
1166 }
1167 else if (operand->flags & MN10300_OPERAND_PSW)
1168 {
1169 char *start = input_line_pointer;
1170 char c = get_symbol_end ();
1171
1172 if (strcasecmp (start, "psw") != 0)
1173 {
1174 *input_line_pointer = c;
1175 input_line_pointer = hold;
1176 str = hold;
1177 goto error;
1178 }
1179 *input_line_pointer = c;
1180 goto keep_going;
1181 }
1182 else if (operand->flags & MN10300_OPERAND_MDR)
1183 {
1184 char *start = input_line_pointer;
1185 char c = get_symbol_end ();
1186
1187 if (strcasecmp (start, "mdr") != 0)
1188 {
1189 *input_line_pointer = c;
1190 input_line_pointer = hold;
1191 str = hold;
1192 goto error;
1193 }
1194 *input_line_pointer = c;
1195 goto keep_going;
1196 }
1197 else if (operand->flags & MN10300_OPERAND_REG_LIST)
1198 {
1199 unsigned int value = 0;
1200 if (*input_line_pointer != '[')
1201 {
1202 input_line_pointer = hold;
1203 str = hold;
1204 goto error;
1205 }
1206
1207 /* Eat the '['. */
1208 input_line_pointer++;
1209
1210 /* We used to reject a null register list here; however,
1211 we accept it now so the compiler can emit "call"
1212 instructions for all calls to named functions.
1213
1214 The linker can then fill in the appropriate bits for the
1215 register list and stack size or change the instruction
1216 into a "calls" if using "call" is not profitable. */
1217 while (*input_line_pointer != ']')
1218 {
1219 char *start;
1220 char c;
1221
1222 if (*input_line_pointer == ',')
1223 input_line_pointer++;
1224
1225 start = input_line_pointer;
1226 c = get_symbol_end ();
1227
1228 if (strcasecmp (start, "d2") == 0)
1229 {
1230 value |= 0x80;
1231 *input_line_pointer = c;
1232 }
1233 else if (strcasecmp (start, "d3") == 0)
1234 {
1235 value |= 0x40;
1236 *input_line_pointer = c;
1237 }
1238 else if (strcasecmp (start, "a2") == 0)
1239 {
1240 value |= 0x20;
1241 *input_line_pointer = c;
1242 }
1243 else if (strcasecmp (start, "a3") == 0)
1244 {
1245 value |= 0x10;
1246 *input_line_pointer = c;
1247 }
1248 else if (strcasecmp (start, "other") == 0)
1249 {
1250 value |= 0x08;
1251 *input_line_pointer = c;
1252 }
1253 else if (HAVE_AM33
1254 && strcasecmp (start, "exreg0") == 0)
1255 {
1256 value |= 0x04;
1257 *input_line_pointer = c;
1258 }
1259 else if (HAVE_AM33
1260 && strcasecmp (start, "exreg1") == 0)
1261 {
1262 value |= 0x02;
1263 *input_line_pointer = c;
1264 }
1265 else if (HAVE_AM33
1266 && strcasecmp (start, "exother") == 0)
1267 {
1268 value |= 0x01;
1269 *input_line_pointer = c;
1270 }
1271 else if (HAVE_AM33
1272 && strcasecmp (start, "all") == 0)
1273 {
1274 value |= 0xff;
1275 *input_line_pointer = c;
1276 }
1277 else
1278 {
1279 input_line_pointer = hold;
1280 str = hold;
1281 goto error;
1282 }
1283 }
1284 input_line_pointer++;
1285 mn10300_insert_operand (&insn, &extension, operand,
1286 value, (char *) NULL, 0, 0);
1287 goto keep_going;
1288
1289 }
1290 else if (data_register_name (&ex))
1291 {
1292 input_line_pointer = hold;
1293 str = hold;
1294 goto error;
1295 }
1296 else if (address_register_name (&ex))
1297 {
1298 input_line_pointer = hold;
1299 str = hold;
1300 goto error;
1301 }
1302 else if (other_register_name (&ex))
1303 {
1304 input_line_pointer = hold;
1305 str = hold;
1306 goto error;
1307 }
1308 else if (HAVE_AM33 && r_register_name (&ex))
1309 {
1310 input_line_pointer = hold;
1311 str = hold;
1312 goto error;
1313 }
1314 else if (HAVE_AM33 && xr_register_name (&ex))
1315 {
1316 input_line_pointer = hold;
1317 str = hold;
1318 goto error;
1319 }
1320 else if (*str == ')' || *str == '(')
1321 {
1322 input_line_pointer = hold;
1323 str = hold;
1324 goto error;
1325 }
1326 else
1327 {
1328 expression (&ex);
1329 }
1330
1331 switch (ex.X_op)
1332 {
1333 case O_illegal:
1334 errmsg = _("illegal operand");
1335 goto error;
1336 case O_absent:
1337 errmsg = _("missing operand");
1338 goto error;
1339 case O_register:
1340 {
1341 int mask;
1342
1343 mask = MN10300_OPERAND_DREG | MN10300_OPERAND_AREG;
1344 if (HAVE_AM33)
1345 mask |= MN10300_OPERAND_RREG | MN10300_OPERAND_XRREG;
1346 if ((operand->flags & mask) == 0)
1347 {
1348 input_line_pointer = hold;
1349 str = hold;
1350 goto error;
1351 }
1352
1353 if (opcode->format == FMT_D1 || opcode->format == FMT_S1)
1354 extra_shift = 8;
1355 else if (opcode->format == FMT_D2
1356 || opcode->format == FMT_D4
1357 || opcode->format == FMT_S2
1358 || opcode->format == FMT_S4
1359 || opcode->format == FMT_S6
1360 || opcode->format == FMT_D5)
1361 extra_shift = 16;
1362 else if (opcode->format == FMT_D7)
1363 extra_shift = 8;
1364 else if (opcode->format == FMT_D8 || opcode->format == FMT_D9)
1365 extra_shift = 8;
1366 else
1367 extra_shift = 0;
1368
1369 mn10300_insert_operand (&insn, &extension, operand,
1370 ex.X_add_number, (char *) NULL,
1371 0, extra_shift);
1372
1373 /* And note the register number in the register array. */
1374 mn10300_reg_operands[op_idx - 1] = ex.X_add_number;
1375 break;
1376 }
1377
1378 case O_constant:
1379 /* If this operand can be promoted, and it doesn't
1380 fit into the allocated bitfield for this insn,
1381 then promote it (ie this opcode does not match). */
1382 if (operand->flags
1383 & (MN10300_OPERAND_PROMOTE | MN10300_OPERAND_RELAX)
1384 && !check_operand (insn, operand, ex.X_add_number))
1385 {
1386 input_line_pointer = hold;
1387 str = hold;
1388 goto error;
1389 }
1390
1391 mn10300_insert_operand (&insn, &extension, operand,
1392 ex.X_add_number, (char *) NULL,
1393 0, 0);
1394 break;
1395
1396 default:
1397 /* If this operand can be promoted, then this opcode didn't
1398 match since we can't know if it needed promotion! */
1399 if (operand->flags & MN10300_OPERAND_PROMOTE)
1400 {
1401 input_line_pointer = hold;
1402 str = hold;
1403 goto error;
1404 }
1405
1406 /* We need to generate a fixup for this expression. */
1407 if (fc >= MAX_INSN_FIXUPS)
1408 as_fatal (_("too many fixups"));
1409 fixups[fc].exp = ex;
1410 fixups[fc].opindex = *opindex_ptr;
1411 fixups[fc].reloc = BFD_RELOC_UNUSED;
1412 ++fc;
1413 break;
1414 }
1415
1416 keep_going:
1417 str = input_line_pointer;
1418 input_line_pointer = hold;
1419
1420 while (*str == ' ' || *str == ',')
1421 ++str;
1422
1423 }
1424
1425 /* Make sure we used all the operands! */
1426 if (*str != ',')
1427 match = 1;
1428
1429 /* If this instruction has registers that must not match, verify
1430 that they do indeed not match. */
1431 if (opcode->no_match_operands)
1432 {
1433 int i;
1434
1435 /* Look at each operand to see if it's marked. */
1436 for (i = 0; i < MN10300_MAX_OPERANDS; i++)
1437 {
1438 if ((1 << i) & opcode->no_match_operands)
1439 {
1440 int j;
1441
1442 /* operand I is marked. Check that it does not match any
1443 operands > I which are marked. */
1444 for (j = i + 1; j < MN10300_MAX_OPERANDS; j++)
1445 {
1446 if (((1 << j) & opcode->no_match_operands)
1447 && mn10300_reg_operands[i] == mn10300_reg_operands[j])
1448 {
1449 errmsg = _("Invalid register specification.");
1450 match = 0;
1451 goto error;
1452 }
1453 }
1454 }
1455 }
1456 }
1457
1458 error:
1459 if (match == 0)
1460 {
1461 next_opcode = opcode + 1;
1462 if (!strcmp (next_opcode->name, opcode->name))
1463 {
1464 opcode = next_opcode;
1465 continue;
1466 }
1467
1468 as_bad ("%s", errmsg);
1469 return;
1470 }
1471 break;
1472 }
1473
1474 while (isspace (*str))
1475 ++str;
1476
1477 if (*str != '\0')
1478 as_bad (_("junk at end of line: `%s'"), str);
1479
1480 input_line_pointer = str;
1481
1482 /* Determine the size of the instruction. */
1483 if (opcode->format == FMT_S0)
1484 size = 1;
1485
1486 if (opcode->format == FMT_S1 || opcode->format == FMT_D0)
1487 size = 2;
1488
1489 if (opcode->format == FMT_S2 || opcode->format == FMT_D1)
1490 size = 3;
1491
1492 if (opcode->format == FMT_D6)
1493 size = 3;
1494
1495 if (opcode->format == FMT_D7 || opcode->format == FMT_D10)
1496 size = 4;
1497
1498 if (opcode->format == FMT_D8)
1499 size = 6;
1500
1501 if (opcode->format == FMT_D9)
1502 size = 7;
1503
1504 if (opcode->format == FMT_S4)
1505 size = 5;
1506
1507 if (opcode->format == FMT_S6 || opcode->format == FMT_D5)
1508 size = 7;
1509
1510 if (opcode->format == FMT_D2)
1511 size = 4;
1512
1513 if (opcode->format == FMT_D4)
1514 size = 6;
1515
1516 if (relaxable && fc > 0)
1517 {
1518 int type;
1519
1520 /* We want to anchor the line info to the previous frag (if
1521 there isn't one, create it), so that, when the insn is
1522 resized, we still get the right address for the beginning of
1523 the region. */
1524 f = frag_more (0);
1525 dwarf2_emit_insn (0);
1526
1527 /* bCC */
1528 if (size == 2)
1529 {
1530 /* Handle bra specially. Basically treat it like jmp so
1531 that we automatically handle 8, 16 and 32 bit offsets
1532 correctly as well as jumps to an undefined address.
1533
1534 It is also important to not treat it like other bCC
1535 instructions since the long forms of bra is different
1536 from other bCC instructions. */
1537 if (opcode->opcode == 0xca00)
1538 type = 10;
1539 else
1540 type = 0;
1541 }
1542 /* call */
1543 else if (size == 5)
1544 type = 6;
1545 /* calls */
1546 else if (size == 4)
1547 type = 8;
1548 /* jmp */
1549 else if (size == 3 && opcode->opcode == 0xcc0000)
1550 type = 10;
1551 /* bCC (uncommon cases) */
1552 else
1553 type = 3;
1554
1555 f = frag_var (rs_machine_dependent, 8, 8 - size, type,
1556 fixups[0].exp.X_add_symbol,
1557 fixups[0].exp.X_add_number,
1558 (char *)fixups[0].opindex);
1559
1560 /* This is pretty hokey. We basically just care about the
1561 opcode, so we have to write out the first word big endian.
1562
1563 The exception is "call", which has two operands that we
1564 care about.
1565
1566 The first operand (the register list) happens to be in the
1567 first instruction word, and will be in the right place if
1568 we output the first word in big endian mode.
1569
1570 The second operand (stack size) is in the extension word,
1571 and we want it to appear as the first character in the extension
1572 word (as it appears in memory). Luckily, writing the extension
1573 word in big endian format will do what we want. */
1574 number_to_chars_bigendian (f, insn, size > 4 ? 4 : size);
1575 if (size > 8)
1576 {
1577 number_to_chars_bigendian (f + 4, extension, 4);
1578 number_to_chars_bigendian (f + 8, 0, size - 8);
1579 }
1580 else if (size > 4)
1581 number_to_chars_bigendian (f + 4, extension, size - 4);
1582 }
1583 else
1584 {
1585 /* Allocate space for the instruction. */
1586 f = frag_more (size);
1587
1588 /* Fill in bytes for the instruction. Note that opcode fields
1589 are written big-endian, 16 & 32bit immediates are written
1590 little endian. Egad. */
1591 if (opcode->format == FMT_S0
1592 || opcode->format == FMT_S1
1593 || opcode->format == FMT_D0
1594 || opcode->format == FMT_D6
1595 || opcode->format == FMT_D7
1596 || opcode->format == FMT_D10
1597 || opcode->format == FMT_D1)
1598 {
1599 number_to_chars_bigendian (f, insn, size);
1600 }
1601 else if (opcode->format == FMT_S2
1602 && opcode->opcode != 0xdf0000
1603 && opcode->opcode != 0xde0000)
1604 {
1605 /* A format S2 instruction that is _not_ "ret" and "retf". */
1606 number_to_chars_bigendian (f, (insn >> 16) & 0xff, 1);
1607 number_to_chars_littleendian (f + 1, insn & 0xffff, 2);
1608 }
1609 else if (opcode->format == FMT_S2)
1610 {
1611 /* This must be a ret or retf, which is written entirely in
1612 big-endian format. */
1613 number_to_chars_bigendian (f, insn, 3);
1614 }
1615 else if (opcode->format == FMT_S4
1616 && opcode->opcode != 0xdc000000)
1617 {
1618 /* This must be a format S4 "call" instruction. What a pain. */
1619 unsigned long temp = (insn >> 8) & 0xffff;
1620 number_to_chars_bigendian (f, (insn >> 24) & 0xff, 1);
1621 number_to_chars_littleendian (f + 1, temp, 2);
1622 number_to_chars_bigendian (f + 3, insn & 0xff, 1);
1623 number_to_chars_bigendian (f + 4, extension & 0xff, 1);
1624 }
1625 else if (opcode->format == FMT_S4)
1626 {
1627 /* This must be a format S4 "jmp" instruction. */
1628 unsigned long temp = ((insn & 0xffffff) << 8) | (extension & 0xff);
1629 number_to_chars_bigendian (f, (insn >> 24) & 0xff, 1);
1630 number_to_chars_littleendian (f + 1, temp, 4);
1631 }
1632 else if (opcode->format == FMT_S6)
1633 {
1634 unsigned long temp = ((insn & 0xffffff) << 8)
1635 | ((extension >> 16) & 0xff);
1636 number_to_chars_bigendian (f, (insn >> 24) & 0xff, 1);
1637 number_to_chars_littleendian (f + 1, temp, 4);
1638 number_to_chars_bigendian (f + 5, (extension >> 8) & 0xff, 1);
1639 number_to_chars_bigendian (f + 6, extension & 0xff, 1);
1640 }
1641 else if (opcode->format == FMT_D2
1642 && opcode->opcode != 0xfaf80000
1643 && opcode->opcode != 0xfaf00000
1644 && opcode->opcode != 0xfaf40000)
1645 {
1646 /* A format D2 instruction where the 16bit immediate is
1647 really a single 16bit value, not two 8bit values. */
1648 number_to_chars_bigendian (f, (insn >> 16) & 0xffff, 2);
1649 number_to_chars_littleendian (f + 2, insn & 0xffff, 2);
1650 }
1651 else if (opcode->format == FMT_D2)
1652 {
1653 /* A format D2 instruction where the 16bit immediate
1654 is really two 8bit immediates. */
1655 number_to_chars_bigendian (f, insn, 4);
1656 }
1657 else if (opcode->format == FMT_D4)
1658 {
1659 unsigned long temp = ((insn & 0xffff) << 16) | (extension & 0xffff);
1660
1661 number_to_chars_bigendian (f, (insn >> 16) & 0xffff, 2);
1662 number_to_chars_littleendian (f + 2, temp, 4);
1663 }
1664 else if (opcode->format == FMT_D5)
1665 {
1666 unsigned long temp = (((insn & 0xffff) << 16)
1667 | ((extension >> 8) & 0xffff));
1668
1669 number_to_chars_bigendian (f, (insn >> 16) & 0xffff, 2);
1670 number_to_chars_littleendian (f + 2, temp, 4);
1671 number_to_chars_bigendian (f + 6, extension & 0xff, 1);
1672 }
1673 else if (opcode->format == FMT_D8)
1674 {
1675 unsigned long temp = ((insn & 0xff) << 16) | (extension & 0xffff);
1676
1677 number_to_chars_bigendian (f, (insn >> 8) & 0xffffff, 3);
1678 number_to_chars_bigendian (f + 3, (temp & 0xff), 1);
1679 number_to_chars_littleendian (f + 4, temp >> 8, 2);
1680 }
1681 else if (opcode->format == FMT_D9)
1682 {
1683 unsigned long temp = ((insn & 0xff) << 24) | (extension & 0xffffff);
1684
1685 number_to_chars_bigendian (f, (insn >> 8) & 0xffffff, 3);
1686 number_to_chars_littleendian (f + 3, temp, 4);
1687 }
1688
1689 /* Create any fixups. */
1690 for (i = 0; i < fc; i++)
1691 {
1692 const struct mn10300_operand *operand;
1693
1694 operand = &mn10300_operands[fixups[i].opindex];
1695 if (fixups[i].reloc != BFD_RELOC_UNUSED)
1696 {
1697 reloc_howto_type *reloc_howto;
1698 int size;
1699 int offset;
1700 fixS *fixP;
1701
1702 reloc_howto = bfd_reloc_type_lookup (stdoutput,
1703 fixups[i].reloc);
1704
1705 if (!reloc_howto)
1706 abort ();
1707
1708 size = bfd_get_reloc_size (reloc_howto);
1709
1710 if (size < 1 || size > 4)
1711 abort ();
1712
1713 offset = 4 - size;
1714 fixP = fix_new_exp (frag_now, f - frag_now->fr_literal + offset,
1715 size, &fixups[i].exp,
1716 reloc_howto->pc_relative,
1717 fixups[i].reloc);
1718 }
1719 else
1720 {
1721 int reloc, pcrel, reloc_size, offset;
1722 fixS *fixP;
1723
1724 reloc = BFD_RELOC_NONE;
1725 /* How big is the reloc? Remember SPLIT relocs are
1726 implicitly 32bits. */
1727 if ((operand->flags & MN10300_OPERAND_SPLIT) != 0)
1728 reloc_size = 32;
1729 else if ((operand->flags & MN10300_OPERAND_24BIT) != 0)
1730 reloc_size = 24;
1731 else
1732 reloc_size = operand->bits;
1733
1734 /* Is the reloc pc-relative? */
1735 pcrel = (operand->flags & MN10300_OPERAND_PCREL) != 0;
1736
1737 offset = size - (reloc_size + operand->shift) / 8;
1738
1739 /* Choose a proper BFD relocation type. */
1740 if (pcrel)
1741 {
1742 if (reloc_size == 32)
1743 reloc = BFD_RELOC_32_PCREL;
1744 else if (reloc_size == 16)
1745 reloc = BFD_RELOC_16_PCREL;
1746 else if (reloc_size == 8)
1747 reloc = BFD_RELOC_8_PCREL;
1748 else
1749 abort ();
1750 }
1751 else
1752 {
1753 if (reloc_size == 32)
1754 reloc = BFD_RELOC_32;
1755 else if (reloc_size == 16)
1756 reloc = BFD_RELOC_16;
1757 else if (reloc_size == 8)
1758 reloc = BFD_RELOC_8;
1759 else
1760 abort ();
1761 }
1762
1763 /* Convert the size of the reloc into what fix_new_exp wants. */
1764 reloc_size = reloc_size / 8;
1765 if (reloc_size == 8)
1766 reloc_size = 0;
1767 else if (reloc_size == 16)
1768 reloc_size = 1;
1769 else if (reloc_size == 32)
1770 reloc_size = 2;
1771
1772 fixP = fix_new_exp (frag_now, f - frag_now->fr_literal + offset,
1773 reloc_size, &fixups[i].exp, pcrel,
1774 ((bfd_reloc_code_real_type) reloc));
1775
1776 if (pcrel)
1777 fixP->fx_offset += offset;
1778 }
1779 }
1780
1781 dwarf2_emit_insn (size);
1782 }
1783 }
1784
1785 /* If while processing a fixup, a reloc really needs to be created
1786 then it is done here. */
1787
1788 arelent *
1789 tc_gen_reloc (seg, fixp)
1790 asection *seg ATTRIBUTE_UNUSED;
1791 fixS *fixp;
1792 {
1793 arelent *reloc;
1794 reloc = (arelent *) xmalloc (sizeof (arelent));
1795
1796 reloc->howto = bfd_reloc_type_lookup (stdoutput, fixp->fx_r_type);
1797 if (reloc->howto == (reloc_howto_type *) NULL)
1798 {
1799 as_bad_where (fixp->fx_file, fixp->fx_line,
1800 _("reloc %d not supported by object file format"),
1801 (int) fixp->fx_r_type);
1802 return NULL;
1803 }
1804 reloc->address = fixp->fx_frag->fr_address + fixp->fx_where;
1805
1806 if (fixp->fx_addsy && fixp->fx_subsy)
1807 {
1808 /* If we got a difference between two symbols, and the
1809 subtracted symbol is in the current section, use a
1810 PC-relative relocation. If both symbols are in the same
1811 section, the difference would have already been simplified
1812 to a constant. */
1813 if (S_GET_SEGMENT (fixp->fx_subsy) == seg)
1814 {
1815 reloc->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
1816 *reloc->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
1817 reloc->addend = (reloc->address - S_GET_VALUE (fixp->fx_subsy)
1818 + fixp->fx_offset);
1819
1820 switch (fixp->fx_r_type)
1821 {
1822 case BFD_RELOC_8:
1823 reloc->howto = bfd_reloc_type_lookup (stdoutput,
1824 BFD_RELOC_8_PCREL);
1825 return reloc;
1826
1827 case BFD_RELOC_16:
1828 reloc->howto = bfd_reloc_type_lookup (stdoutput,
1829 BFD_RELOC_16_PCREL);
1830 return reloc;
1831
1832 case BFD_RELOC_24:
1833 reloc->howto = bfd_reloc_type_lookup (stdoutput,
1834 BFD_RELOC_24_PCREL);
1835 return reloc;
1836
1837 case BFD_RELOC_32:
1838 reloc->howto = bfd_reloc_type_lookup (stdoutput,
1839 BFD_RELOC_32_PCREL);
1840 return reloc;
1841
1842 default:
1843 /* Try to compute the absolute value below. */
1844 break;
1845 }
1846 }
1847
1848 if ((S_GET_SEGMENT (fixp->fx_addsy) != S_GET_SEGMENT (fixp->fx_subsy))
1849 || S_GET_SEGMENT (fixp->fx_addsy) == undefined_section)
1850 {
1851 as_bad_where (fixp->fx_file, fixp->fx_line,
1852 "Difference of symbols in different sections is not supported");
1853 return NULL;
1854 }
1855
1856 reloc->sym_ptr_ptr = (asymbol **) &bfd_abs_symbol;
1857 reloc->addend = (S_GET_VALUE (fixp->fx_addsy)
1858 - S_GET_VALUE (fixp->fx_subsy) + fixp->fx_offset);
1859 }
1860 else
1861 {
1862 reloc->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
1863 *reloc->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
1864 reloc->addend = fixp->fx_offset;
1865 }
1866 return reloc;
1867 }
1868
1869 int
1870 md_estimate_size_before_relax (fragp, seg)
1871 fragS *fragp;
1872 asection *seg;
1873 {
1874 if (fragp->fr_subtype == 6
1875 && (!S_IS_DEFINED (fragp->fr_symbol)
1876 || seg != S_GET_SEGMENT (fragp->fr_symbol)))
1877 fragp->fr_subtype = 7;
1878 else if (fragp->fr_subtype == 8
1879 && (!S_IS_DEFINED (fragp->fr_symbol)
1880 || seg != S_GET_SEGMENT (fragp->fr_symbol)))
1881 fragp->fr_subtype = 9;
1882 else if (fragp->fr_subtype == 10
1883 && (!S_IS_DEFINED (fragp->fr_symbol)
1884 || seg != S_GET_SEGMENT (fragp->fr_symbol)))
1885 fragp->fr_subtype = 12;
1886
1887 if (fragp->fr_subtype >= sizeof (md_relax_table) / sizeof (md_relax_table[0]))
1888 abort ();
1889
1890 return md_relax_table[fragp->fr_subtype].rlx_length;
1891 }
1892
1893 long
1894 md_pcrel_from (fixp)
1895 fixS *fixp;
1896 {
1897 if (fixp->fx_addsy != (symbolS *) NULL && !S_IS_DEFINED (fixp->fx_addsy))
1898 {
1899 /* The symbol is undefined. Let the linker figure it out. */
1900 return 0;
1901 }
1902 return fixp->fx_frag->fr_address + fixp->fx_where;
1903 }
1904
1905 int
1906 md_apply_fix3 (fixp, valuep, seg)
1907 fixS *fixp;
1908 valueT *valuep;
1909 segT seg;
1910 {
1911 char *fixpos = fixp->fx_where + fixp->fx_frag->fr_literal;
1912 int size = 0;
1913 int value;
1914
1915 assert (fixp->fx_r_type < BFD_RELOC_UNUSED);
1916
1917 /* This should never happen. */
1918 if (seg->flags & SEC_ALLOC)
1919 abort ();
1920
1921 /* The value we are passed in *valuep includes the symbol values.
1922 Since we are using BFD_ASSEMBLER, if we are doing this relocation
1923 the code in write.c is going to call bfd_install_relocation, which
1924 is also going to use the symbol value. That means that if the
1925 reloc is fully resolved we want to use *valuep since
1926 bfd_install_relocation is not being used.
1927
1928 However, if the reloc is not fully resolved we do not want to use
1929 *valuep, and must use fx_offset instead. However, if the reloc
1930 is PC relative, we do want to use *valuep since it includes the
1931 result of md_pcrel_from. */
1932 if (fixp->fx_addsy == (symbolS *) NULL || fixp->fx_pcrel)
1933 value = *valuep;
1934 else
1935 value = fixp->fx_offset;
1936
1937 /* If the fix is relative to a symbol which is not defined, or not
1938 in the same segment as the fix, we cannot resolve it here. */
1939 if (fixp->fx_addsy != NULL
1940 && (! S_IS_DEFINED (fixp->fx_addsy)
1941 || (S_GET_SEGMENT (fixp->fx_addsy) != seg)))
1942 {
1943 fixp->fx_done = 0;
1944 return 0;
1945 }
1946
1947 switch (fixp->fx_r_type)
1948 {
1949 case BFD_RELOC_8:
1950 case BFD_RELOC_8_PCREL:
1951 size = 1;
1952 break;
1953
1954 case BFD_RELOC_16:
1955 case BFD_RELOC_16_PCREL:
1956 size = 2;
1957 break;
1958
1959 case BFD_RELOC_32:
1960 case BFD_RELOC_32_PCREL:
1961 size = 4;
1962 break;
1963
1964 case BFD_RELOC_VTABLE_INHERIT:
1965 case BFD_RELOC_VTABLE_ENTRY:
1966 fixp->fx_done = 0;
1967 return 1;
1968
1969 case BFD_RELOC_NONE:
1970 default:
1971 as_bad_where (fixp->fx_file, fixp->fx_line,
1972 _("Bad relocation fixup type (%d)"), fixp->fx_r_type);
1973 }
1974
1975 md_number_to_chars (fixpos, value, size);
1976
1977 /* If a symbol remains, pass the fixup, as a reloc, onto the linker. */
1978 if (fixp->fx_addsy == NULL)
1979 fixp->fx_done = 1;
1980
1981 return 0;
1982 }
1983
1984 /* Return nonzero if the fixup in FIXP will require a relocation,
1985 even it if appears that the fixup could be completely handled
1986 within GAS. */
1987
1988 int
1989 mn10300_force_relocation (fixp)
1990 struct fix *fixp;
1991 {
1992 if (fixp->fx_r_type == BFD_RELOC_VTABLE_INHERIT
1993 || fixp->fx_r_type == BFD_RELOC_VTABLE_ENTRY)
1994 return 1;
1995
1996 /* Do not adjust relocations involving symbols in code sections,
1997 because it breaks linker relaxations. This could be fixed in the
1998 linker, but this fix is simpler, and it pretty much only affects
1999 object size a little bit. */
2000 if ((S_GET_SEGMENT (fixp->fx_addsy)->flags & SEC_CODE)
2001 && fixp->fx_subsy
2002 && S_GET_SEGMENT (fixp->fx_addsy) == S_GET_SEGMENT (fixp->fx_subsy))
2003 return 1;
2004
2005 return 0;
2006 }
2007
2008 /* Return zero if the fixup in fixp should be left alone and not
2009 adjusted. */
2010
2011 boolean
2012 mn10300_fix_adjustable (fixp)
2013 struct fix *fixp;
2014 {
2015 /* Prevent all adjustments to global symbols. */
2016 if (S_IS_EXTERN (fixp->fx_addsy) || S_IS_WEAK (fixp->fx_addsy))
2017 return 0;
2018
2019 if (fixp->fx_r_type == BFD_RELOC_VTABLE_INHERIT
2020 || fixp->fx_r_type == BFD_RELOC_VTABLE_ENTRY)
2021 return 0;
2022
2023 /* Do not adjust relocations involving symbols in code sections,
2024 because it breaks linker relaxations. This could be fixed in the
2025 linker, but this fix is simpler, and it pretty much only affects
2026 object size a little bit. */
2027 if (S_GET_SEGMENT (fixp->fx_addsy)->flags & SEC_CODE)
2028 return 0;
2029
2030 return 1;
2031 }
2032
2033 /* Insert an operand value into an instruction. */
2034
2035 static void
2036 mn10300_insert_operand (insnp, extensionp, operand, val, file, line, shift)
2037 unsigned long *insnp;
2038 unsigned long *extensionp;
2039 const struct mn10300_operand *operand;
2040 offsetT val;
2041 char *file;
2042 unsigned int line;
2043 unsigned int shift;
2044 {
2045 /* No need to check 32bit operands for a bit. Note that
2046 MN10300_OPERAND_SPLIT is an implicit 32bit operand. */
2047 if (operand->bits != 32
2048 && (operand->flags & MN10300_OPERAND_SPLIT) == 0)
2049 {
2050 long min, max;
2051 offsetT test;
2052 int bits;
2053
2054 bits = operand->bits;
2055 if (operand->flags & MN10300_OPERAND_24BIT)
2056 bits = 24;
2057
2058 if ((operand->flags & MN10300_OPERAND_SIGNED) != 0)
2059 {
2060 max = (1 << (bits - 1)) - 1;
2061 min = - (1 << (bits - 1));
2062 }
2063 else
2064 {
2065 max = (1 << bits) - 1;
2066 min = 0;
2067 }
2068
2069 test = val;
2070
2071 if (test < (offsetT) min || test > (offsetT) max)
2072 {
2073 const char *err =
2074 _("operand out of range (%s not between %ld and %ld)");
2075 char buf[100];
2076
2077 sprint_value (buf, test);
2078 if (file == (char *) NULL)
2079 as_warn (err, buf, min, max);
2080 else
2081 as_warn_where (file, line, err, buf, min, max);
2082 }
2083 }
2084
2085 if ((operand->flags & MN10300_OPERAND_SPLIT) != 0)
2086 {
2087 *insnp |= (val >> (32 - operand->bits)) & ((1 << operand->bits) - 1);
2088 *extensionp |= ((val & ((1 << (32 - operand->bits)) - 1))
2089 << operand->shift);
2090 }
2091 else if ((operand->flags & MN10300_OPERAND_24BIT) != 0)
2092 {
2093 *insnp |= (val >> (24 - operand->bits)) & ((1 << operand->bits) - 1);
2094 *extensionp |= ((val & ((1 << (24 - operand->bits)) - 1))
2095 << operand->shift);
2096 }
2097 else if ((operand->flags & MN10300_OPERAND_EXTENDED) == 0)
2098 {
2099 *insnp |= (((long) val & ((1 << operand->bits) - 1))
2100 << (operand->shift + shift));
2101
2102 if ((operand->flags & MN10300_OPERAND_REPEATED) != 0)
2103 *insnp |= (((long) val & ((1 << operand->bits) - 1))
2104 << (operand->shift + shift + operand->bits));
2105 }
2106 else
2107 {
2108 *extensionp |= (((long) val & ((1 << operand->bits) - 1))
2109 << (operand->shift + shift));
2110
2111 if ((operand->flags & MN10300_OPERAND_REPEATED) != 0)
2112 *extensionp |= (((long) val & ((1 << operand->bits) - 1))
2113 << (operand->shift + shift + operand->bits));
2114 }
2115 }
2116
2117 static unsigned long
2118 check_operand (insn, operand, val)
2119 unsigned long insn ATTRIBUTE_UNUSED;
2120 const struct mn10300_operand *operand;
2121 offsetT val;
2122 {
2123 /* No need to check 32bit operands for a bit. Note that
2124 MN10300_OPERAND_SPLIT is an implicit 32bit operand. */
2125 if (operand->bits != 32
2126 && (operand->flags & MN10300_OPERAND_SPLIT) == 0)
2127 {
2128 long min, max;
2129 offsetT test;
2130 int bits;
2131
2132 bits = operand->bits;
2133 if (operand->flags & MN10300_OPERAND_24BIT)
2134 bits = 24;
2135
2136 if ((operand->flags & MN10300_OPERAND_SIGNED) != 0)
2137 {
2138 max = (1 << (bits - 1)) - 1;
2139 min = - (1 << (bits - 1));
2140 }
2141 else
2142 {
2143 max = (1 << bits) - 1;
2144 min = 0;
2145 }
2146
2147 test = val;
2148
2149 if (test < (offsetT) min || test > (offsetT) max)
2150 return 0;
2151 else
2152 return 1;
2153 }
2154 return 1;
2155 }
2156
2157 static void
2158 set_arch_mach (mach)
2159 int mach;
2160 {
2161 if (!bfd_set_arch_mach (stdoutput, bfd_arch_mn10300, mach))
2162 as_warn (_("could not set architecture and machine"));
2163
2164 current_machine = mach;
2165 }
This page took 0.07739 seconds and 4 git commands to generate.