1 /* ns32k.c -- Assemble on the National Semiconductor 32k series
2 Copyright (C) 1987-2018 Free Software Foundation, Inc.
4 This file is part of GAS, the GNU Assembler.
6 GAS is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3, or (at your option)
11 GAS is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GAS; see the file COPYING. If not, write to the Free
18 Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
21 /*#define SHOW_NUM 1*//* Uncomment for debugging. */
24 #include "opcode/ns32k.h"
29 #define IIF_ENTRIES 13 /* Number of entries in iif. */
30 #define PRIVATE_SIZE 256 /* Size of my garbage memory. */
32 #define DEFAULT -1 /* addr_mode returns this value when
33 plain constant or label is
36 #define IIF(ptr,a1,c1,e1,g1,i1,k1,m1,o1,q1,s1,u1) \
37 iif.iifP[ptr].type = a1; \
38 iif.iifP[ptr].size = c1; \
39 iif.iifP[ptr].object = e1; \
40 iif.iifP[ptr].object_adjust = g1; \
41 iif.iifP[ptr].pcrel = i1; \
42 iif.iifP[ptr].pcrel_adjust = k1; \
43 iif.iifP[ptr].im_disp = m1; \
44 iif.iifP[ptr].relax_substate = o1; \
45 iif.iifP[ptr].bit_fixP = q1; \
46 iif.iifP[ptr].addr_mode = s1; \
47 iif.iifP[ptr].bsr = u1;
49 #ifdef SEQUENT_COMPATABILITY
50 #define LINE_COMMENT_CHARS "|"
51 #define ABSOLUTE_PREFIX '@'
52 #define IMMEDIATE_PREFIX '#'
55 #ifndef LINE_COMMENT_CHARS
56 #define LINE_COMMENT_CHARS "#"
59 const char comment_chars
[] = "#";
60 const char line_comment_chars
[] = LINE_COMMENT_CHARS
;
61 const char line_separator_chars
[] = ";";
62 static int default_disp_size
= 4; /* Displacement size for external refs. */
64 #if !defined(ABSOLUTE_PREFIX) && !defined(IMMEDIATE_PREFIX)
65 #define ABSOLUTE_PREFIX '@' /* One or the other MUST be defined. */
70 signed char mode
; /* Addressing mode of operand (0-31). */
71 signed char scaled_mode
; /* Mode combined with scaled mode. */
72 char scaled_reg
; /* Register used in scaled+1 (1-8). */
73 char float_flag
; /* Set if R0..R7 was F0..F7 ie a
74 floating-point-register. */
75 char am_size
; /* Estimated max size of general addr-mode
77 char im_disp
; /* If im_disp==1 we have a displacement. */
78 char pcrel
; /* 1 if pcrel, this is really redundant info. */
79 char disp_suffix
[2]; /* Length of displacement(s), 0=undefined. */
80 char *disp
[2]; /* Pointer(s) at displacement(s)
81 or immediates(s) (ascii). */
82 char index_byte
; /* Index byte. */
84 typedef struct addr_mode addr_modeS
;
86 char *freeptr
, *freeptr_static
; /* Points at some number of free bytes. */
87 struct hash_control
*inst_hash_handle
;
89 struct ns32k_opcode
*desc
; /* Pointer at description of instruction. */
90 addr_modeS addr_modeP
;
91 const char EXP_CHARS
[] = "eE";
92 const char FLT_CHARS
[] = "fd"; /* We don't want to support lowercase,
95 /* UPPERCASE denotes live names when an instruction is built, IIF is
96 used as an intermediate form to store the actual parts of the
97 instruction. A ns32k machine instruction can be divided into a
98 couple of sub PARTs. When an instruction is assembled the
99 appropriate PART get an assignment. When an IIF has been completed
100 it is converted to a FRAGment as specified in AS.H. */
102 /* Internal structs. */
112 int type
; /* How to interpret object. */
113 int size
; /* Estimated max size of object. */
114 unsigned long object
; /* Binary data. */
115 int object_adjust
; /* Number added to object. */
116 int pcrel
; /* True if object is pcrel. */
117 int pcrel_adjust
; /* Length in bytes from the instruction
118 start to the displacement. */
119 int im_disp
; /* True if the object is a displacement. */
120 relax_substateT relax_substate
;/*Initial relaxsubstate. */
121 bit_fixS
*bit_fixP
; /* Pointer at bit_fix struct. */
122 int addr_mode
; /* What addrmode do we associate with this
124 char bsr
; /* Sequent hack. */
125 } iif_entryT
; /* Internal Instruction Format. */
129 int instr_size
; /* Max size of instruction in bytes. */
130 iif_entryT iifP
[IIF_ENTRIES
+ 1];
133 struct int_ins_form iif
;
136 /* Description of the PARTs in IIF
138 0 total length in bytes of entries in iif
151 For every entry there is a data length in bytes. This is stored in size[n].
152 0, the object length is not explicitly given by the instruction
153 and the operand is undefined. This is a case for relaxation.
154 Reserve 4 bytes for the final object.
156 1, the entry contains one byte
157 2, the entry contains two bytes
158 3, the entry contains three bytes
159 4, the entry contains four bytes
162 Furthermore, every entry has a data type identifier in type[n].
164 0, the entry is void, ignore it.
165 1, the entry is a binary number.
166 2, the entry is a pointer at an expression.
167 Where expression may be as simple as a single '1',
168 and as complicated as foo-bar+12,
169 foo and bar may be undefined but suffixed by :{b|w|d} to
170 control the length of the object.
172 3, the entry is a pointer at a bignum struct
174 The low-order-byte corresponds to low physical memory.
175 Obviously a FRAGment must be created for each valid disp in PART whose
176 data length is undefined (to bad) .
177 The case where just the expression is undefined is less severe and is
178 handled by fix. Here the number of bytes in the object file is known.
179 With this representation we simplify the assembly and separates the
180 machine dependent/independent parts in a more clean way (said OE). */
182 struct ns32k_option opt1
[] = /* restore, exit. */
194 struct ns32k_option opt2
[] = /* save, enter. */
206 struct ns32k_option opt3
[] = /* setcfg. */
214 struct ns32k_option opt4
[] = /* cinv. */
221 struct ns32k_option opt5
[] = /* String inst. */
228 struct ns32k_option opt6
[] = /* Plain reg ext,cvtp etc. */
241 #if !defined(NS32032) && !defined(NS32532)
245 struct ns32k_option cpureg_532
[] = /* lpr spr. */
258 {"intbase", 0xe, 0xff},
262 struct ns32k_option mmureg_532
[] = /* lmr smr. */
269 {"ivar0", 0xe, 0xff},
270 {"ivar1", 0xf, 0xff},
274 struct ns32k_option cpureg_032
[] = /* lpr spr. */
281 {"intbase", 0xe, 0xff},
285 struct ns32k_option mmureg_032
[] = /* lmr smr. */
301 struct ns32k_option
*cpureg
= cpureg_532
;
302 struct ns32k_option
*mmureg
= mmureg_532
;
304 struct ns32k_option
*cpureg
= cpureg_032
;
305 struct ns32k_option
*mmureg
= mmureg_032
;
309 const pseudo_typeS md_pseudo_table
[] =
310 { /* So far empty. */
314 #define IND(x,y) (((x)<<2)+(y))
316 /* Those are index's to relax groups in md_relax_table ie it must be
317 multiplied by 4 to point at a group start. Viz IND(x,y) Se function
318 relax_segment in write.c for more info. */
323 /* Those are index's to entries in a relax group. */
329 /* Those limits are calculated from the displacement start in memory.
330 The ns32k uses the beginning of the instruction as displacement
331 base. This type of displacements could be handled here by moving
332 the limit window up or down. I choose to use an internal
333 displacement base-adjust as there are other routines that must
334 consider this. Also, as we have two various offset-adjusts in the
335 ns32k (acb versus br/brs/jsr/bcond), two set of limits would have
336 had to be used. Now we don't have to think about that. */
338 const relax_typeS md_relax_table
[] =
345 {(63), (-64), 1, IND (BRANCH
, WORD
)},
346 {(8192), (-8192), 2, IND (BRANCH
, DOUBLE
)},
351 /* Array used to test if mode contains displacements.
352 Value is true if mode contains displacement. */
355 {0, 0, 0, 0, 0, 0, 0, 0,
356 1, 1, 1, 1, 1, 1, 1, 1,
357 1, 1, 1, 0, 0, 1, 1, 0,
358 1, 1, 1, 1, 1, 1, 1, 1};
360 /* Array used to calculate max size of displacements. */
365 /* Parse a general operand into an addressing mode struct
367 In: pointer at operand in ascii form
368 pointer at addr_mode struct for result
369 the level of recursion. (always 0 or 1)
371 Out: data in addr_mode struct. */
374 addr_mode (char *operand
,
375 addr_modeS
*addrmodeP
,
384 mode
= DEFAULT
; /* Default. */
385 addrmodeP
->scaled_mode
= 0; /* Why not. */
386 addrmodeP
->scaled_reg
= 0; /* If 0, not scaled index. */
387 addrmodeP
->float_flag
= 0;
388 addrmodeP
->am_size
= 0;
389 addrmodeP
->im_disp
= 0;
390 addrmodeP
->pcrel
= 0; /* Not set in this function. */
391 addrmodeP
->disp_suffix
[0] = 0;
392 addrmodeP
->disp_suffix
[1] = 0;
393 addrmodeP
->disp
[0] = NULL
;
394 addrmodeP
->disp
[1] = NULL
;
404 /* The following three case statements controls the mode-chars
405 this is the place to ed if you want to change them. */
406 #ifdef ABSOLUTE_PREFIX
407 case ABSOLUTE_PREFIX
:
408 if (str
[strl
- 1] == ']')
410 addrmodeP
->mode
= 21; /* absolute */
411 addrmodeP
->disp
[0] = str
+ 1;
414 #ifdef IMMEDIATE_PREFIX
415 case IMMEDIATE_PREFIX
:
416 if (str
[strl
- 1] == ']')
418 addrmodeP
->mode
= 20; /* immediate */
419 addrmodeP
->disp
[0] = str
+ 1;
423 if (str
[strl
- 1] != ']')
429 if (str
[2] != '\000')
431 addrmodeP
->mode
= 27; /* pc-relative */
432 addrmodeP
->disp
[0] = str
+ 2;
437 as_bad (_("Invalid syntax in PC-relative addressing mode"));
443 if (str
[strl
- 1] != ']')
445 if ((!strncmp (str
, "ext(", 4)) && strl
> 7)
447 addrmodeP
->disp
[0] = str
+ 4;
451 { /* disp[0]'s termination point. */
458 while (j
< strl
&& i
!= 0);
459 if (i
!= 0 || !(str
[j
+ 1] == '-' || str
[j
+ 1] == '+'))
461 as_bad (_("Invalid syntax in External addressing mode"));
464 str
[j
] = '\000'; /* null terminate disp[0] */
465 addrmodeP
->disp
[1] = str
+ j
+ 2;
466 addrmodeP
->mode
= 22;
484 addrmodeP
->float_flag
= 1;
487 if (str
[1] >= '0' && str
[1] < '8')
489 addrmodeP
->mode
= str
[1] - '0';
499 if (!strncmp (str
, "tos", 3))
501 addrmodeP
->mode
= 23; /* TopOfStack */
512 if (str
[strl
- 1] == ')')
514 if (str
[strl
- 2] == ')')
516 if (!strncmp (&str
[strl
- 5], "(fp", 3))
517 mode
= 16; /* Memory Relative. */
518 else if (!strncmp (&str
[strl
- 5], "(sp", 3))
520 else if (!strncmp (&str
[strl
- 5], "(sb", 3))
525 /* Memory relative. */
526 addrmodeP
->mode
= mode
;
527 j
= strl
- 5; /* Temp for end of disp[0]. */
533 if (str
[strl
] == ')')
535 if (str
[strl
] == '(')
538 while (strl
> -1 && i
!= 0);
542 as_bad (_("Invalid syntax in Memory Relative addressing mode"));
546 addrmodeP
->disp
[1] = str
;
547 addrmodeP
->disp
[0] = str
+ strl
+ 1;
548 str
[j
] = '\000'; /* Null terminate disp[0] . */
549 str
[strl
] = '\000'; /* Null terminate disp[1]. */
555 switch (str
[strl
- 3])
559 if (str
[strl
- 2] >= '0'
560 && str
[strl
- 2] < '8'
561 && str
[strl
- 4] == '(')
563 addrmodeP
->mode
= str
[strl
- 2] - '0' + 8;
564 addrmodeP
->disp
[0] = str
;
566 return -1; /* reg rel */
571 if (!strncmp (&str
[strl
- 4], "(fp", 3))
573 else if (!strncmp (&str
[strl
- 4], "(sp", 3))
575 else if (!strncmp (&str
[strl
- 4], "(sb", 3))
577 else if (!strncmp (&str
[strl
- 4], "(pc", 3))
582 addrmodeP
->mode
= mode
;
583 addrmodeP
->disp
[0] = str
;
584 str
[strl
- 4] = '\0';
586 return -1; /* Memory space. */
591 /* No trailing ')' do we have a ']' ? */
592 if (str
[strl
- 1] == ']')
594 switch (str
[strl
- 2])
609 as_bad (_("Invalid scaled-indexed mode, use (b,w,d,q)"));
611 if (str
[strl
- 3] != ':' || str
[strl
- 6] != '['
612 || str
[strl
- 5] == 'r' || str
[strl
- 4] < '0'
613 || str
[strl
- 4] > '7')
614 as_bad (_("Syntax in scaled-indexed mode, use [Rn:m] where n=[0..7] m={b,w,d,q}"));
615 } /* Scaled index. */
617 if (recursive_level
> 0)
619 as_bad (_("Scaled-indexed addressing mode combined with scaled-index"));
623 addrmodeP
->am_size
+= 1; /* scaled index byte. */
624 j
= str
[strl
- 4] - '0'; /* store temporary. */
625 str
[strl
- 6] = '\000'; /* null terminate for recursive call. */
626 i
= addr_mode (str
, addrmodeP
, 1);
628 if (!i
|| addrmodeP
->mode
== 20)
630 as_bad (_("Invalid or illegal addressing mode combined with scaled-index"));
634 addrmodeP
->scaled_mode
= addrmodeP
->mode
; /* Store the inferior mode. */
635 addrmodeP
->mode
= mode
;
636 addrmodeP
->scaled_reg
= j
+ 1;
642 addrmodeP
->mode
= DEFAULT
; /* Default to whatever. */
643 addrmodeP
->disp
[0] = str
;
649 evaluate_expr (expressionS
*resultP
, char *ptr
)
653 tmp_line
= input_line_pointer
;
654 input_line_pointer
= ptr
;
655 expression (resultP
);
656 input_line_pointer
= tmp_line
;
659 /* ptr points at string addr_modeP points at struct with result This
660 routine calls addr_mode to determine the general addr.mode of the
661 operand. When this is ready it parses the displacements for size
662 specifying suffixes and determines size of immediate mode via
663 ns32k-opcode. Also builds index bytes if needed. */
666 get_addr_mode (char *ptr
, addr_modeS
*addrmodeP
)
670 addr_mode (ptr
, addrmodeP
, 0);
672 if (addrmodeP
->mode
== DEFAULT
|| addrmodeP
->scaled_mode
== -1)
674 /* Resolve ambiguous operands, this shouldn't be necessary if
675 one uses standard NSC operand syntax. But the sequent
676 compiler doesn't!!! This finds a proper addressing mode
677 if it is implicitly stated. See ns32k-opcode.h. */
678 (void) evaluate_expr (&exprP
, ptr
); /* This call takes time Sigh! */
680 if (addrmodeP
->mode
== DEFAULT
)
682 if (exprP
.X_add_symbol
|| exprP
.X_op_symbol
)
683 addrmodeP
->mode
= desc
->default_model
; /* We have a label. */
685 addrmodeP
->mode
= desc
->default_modec
; /* We have a constant. */
689 if (exprP
.X_add_symbol
|| exprP
.X_op_symbol
)
690 addrmodeP
->scaled_mode
= desc
->default_model
;
692 addrmodeP
->scaled_mode
= desc
->default_modec
;
695 /* Must put this mess down in addr_mode to handle the scaled
699 /* It appears as the sequent compiler wants an absolute when we have
700 a label without @. Constants becomes immediates besides the addr
701 case. Think it does so with local labels too, not optimum, pcrel
702 is better. When I have time I will make gas check this and
703 select pcrel when possible Actually that is trivial. */
704 if ((tmp
= addrmodeP
->scaled_reg
))
705 { /* Build indexbyte. */
706 tmp
--; /* Remember regnumber comes incremented for
708 tmp
|= addrmodeP
->scaled_mode
<< 3;
709 addrmodeP
->index_byte
= (char) tmp
;
710 addrmodeP
->am_size
+= 1;
713 gas_assert (addrmodeP
->mode
>= 0);
714 if (disp_test
[(unsigned int) addrmodeP
->mode
])
723 /* There was a displacement, probe for length specifying suffix. */
724 addrmodeP
->pcrel
= 0;
726 gas_assert (addrmodeP
->mode
>= 0);
727 if (disp_test
[(unsigned int) addrmodeP
->mode
])
729 /* There is a displacement. */
730 if (addrmodeP
->mode
== 27 || addrmodeP
->scaled_mode
== 27)
731 /* Do we have pcrel. mode. */
732 addrmodeP
->pcrel
= 1;
734 addrmodeP
->im_disp
= 1;
736 for (i
= 0; i
< 2; i
++)
738 suffix_sub
= suffix
= 0;
740 if ((toP
= addrmodeP
->disp
[i
]))
742 /* Suffix of expression, the largest size rules. */
745 while ((c
= *fromP
++))
753 as_warn (_("Premature end of suffix -- Defaulting to d"));
766 as_warn (_("Bad suffix after ':' use {b|w|d} Defaulting to d"));
771 toP
--; /* So we write over the ':' */
773 if (suffix
< suffix_sub
)
778 *toP
= '\0'; /* Terminate properly. */
779 addrmodeP
->disp_suffix
[i
] = suffix
;
780 addrmodeP
->am_size
+= suffix
? suffix
: 4;
787 if (addrmodeP
->mode
== 20)
789 /* Look in ns32k_opcode for size. */
790 addrmodeP
->disp_suffix
[0] = addrmodeP
->am_size
= desc
->im_size
;
791 addrmodeP
->im_disp
= 0;
795 return addrmodeP
->mode
;
798 /* Read an option list. */
801 optlist (char *str
, /* The string to extract options from. */
802 struct ns32k_option
*optionP
, /* How to search the string. */
803 unsigned long *default_map
) /* Default pattern and output. */
805 int i
, j
, k
, strlen1
, strlen2
;
806 const char *patternP
, *strP
;
808 strlen1
= strlen (str
);
811 as_fatal (_("Very short instr to option, ie you can't do it on a NULLstr"));
813 for (i
= 0; optionP
[i
].pattern
!= 0; i
++)
815 strlen2
= strlen (optionP
[i
].pattern
);
817 for (j
= 0; j
< strlen1
; j
++)
819 patternP
= optionP
[i
].pattern
;
822 for (k
= 0; k
< strlen2
; k
++)
824 if (*(strP
++) != *(patternP
++))
830 *default_map
|= optionP
[i
].or;
831 *default_map
&= optionP
[i
].and;
837 /* Search struct for symbols.
838 This function is used to get the short integer form of reg names in
839 the instructions lmr, smr, lpr, spr return true if str is found in
843 list_search (char *str
, /* The string to match. */
844 struct ns32k_option
*optionP
, /* List to search. */
845 unsigned long *default_map
) /* Default pattern and output. */
849 for (i
= 0; optionP
[i
].pattern
!= 0; i
++)
851 if (!strncmp (optionP
[i
].pattern
, str
, 20))
853 /* Use strncmp to be safe. */
854 *default_map
|= optionP
[i
].or;
855 *default_map
&= optionP
[i
].and;
861 as_bad (_("No such entry in list. (cpu/mmu register)"));
865 /* Create a bit_fixS in obstack 'notes'.
866 This struct is used to profile the normal fix. If the bit_fixP is a
867 valid pointer (not NULL) the bit_fix data will be used to format
871 bit_fix_new (int size
, /* Length of bitfield. */
872 int offset
, /* Bit offset to bitfield. */
873 long min
, /* Signextended min for bitfield. */
874 long max
, /* Signextended max for bitfield. */
875 long add
, /* Add mask, used for huffman prefix. */
876 long base_type
, /* 0 or 1, if 1 it's exploded to opcode ptr. */
881 bit_fixP
= XOBNEW (¬es
, bit_fixS
);
883 bit_fixP
->fx_bit_size
= size
;
884 bit_fixP
->fx_bit_offset
= offset
;
885 bit_fixP
->fx_bit_base
= base_type
;
886 bit_fixP
->fx_bit_base_adj
= base_adj
;
887 bit_fixP
->fx_bit_max
= max
;
888 bit_fixP
->fx_bit_min
= min
;
889 bit_fixP
->fx_bit_add
= add
;
894 /* Convert operands to iif-format and adds bitfields to the opcode.
895 Operands are parsed in such an order that the opcode is updated from
896 its most significant bit, that is when the operand need to alter the
898 Be careful not to put to objects in the same iif-slot. */
901 encode_operand (int argc
,
903 const char *operandsP
,
905 char im_size ATTRIBUTE_UNUSED
,
910 int pcrel
, b
, loop
, pcrel_adjust
;
913 for (loop
= 0; loop
< argc
; loop
++)
915 /* What operand are we supposed to work on. */
916 i
= operandsP
[loop
<< 1] - '1';
918 as_fatal (_("Internal consistency error. check ns32k-opcode.h"));
924 switch ((d
= operandsP
[(loop
<< 1) + 1]))
926 case 'f': /* Operand of sfsr turns out to be a nasty
930 case 'Z': /* Float not immediate. */
931 case 'F': /* 32 bit float general form. */
932 case 'L': /* 64 bit float. */
933 case 'I': /* Integer not immediate. */
936 case 'D': /* Double-word. */
937 case 'A': /* Double-word gen-address-form ie no regs
939 get_addr_mode (argv
[i
], &addr_modeP
);
941 if ((addr_modeP
.mode
== 20) &&
942 (d
== 'I' || d
== 'Z' || d
== 'A'))
943 as_fatal (d
== 'A'? _("Address of immediate operand"):
944 _("Invalid immediate write operand."));
946 if (opcode_bit_ptr
== desc
->opcode_size
)
951 for (j
= b
; j
< (b
+ 2); j
++)
953 if (addr_modeP
.disp
[j
- b
])
957 addr_modeP
.disp_suffix
[j
- b
],
958 (unsigned long) addr_modeP
.disp
[j
- b
],
965 (addr_modeP
.scaled_reg
? addr_modeP
.scaled_mode
972 iif
.iifP
[1].object
|= ((long) addr_modeP
.mode
) << opcode_bit_ptr
;
974 if (addr_modeP
.scaled_reg
)
977 IIF (j
, 1, 1, (unsigned long) addr_modeP
.index_byte
,
978 0, 0, 0, 0, 0, NULL
, -1, 0);
982 case 'b': /* Multiple instruction disp. */
983 freeptr
++; /* OVE:this is an useful hack. */
984 sprintf (freeptr
, "((%s-1)*%d)", argv
[i
], desc
->im_size
);
986 pcrel
-= 1; /* Make pcrel 0 in spite of what case 'p':
989 case 'p': /* Displacement - pc relative addressing. */
992 case 'd': /* Displacement. */
993 iif
.instr_size
+= suffixP
[i
] ? suffixP
[i
] : 4;
994 IIF (12, 2, suffixP
[i
], (unsigned long) argv
[i
], 0,
995 pcrel
, pcrel_adjust
, 1, IND (BRANCH
, BYTE
), NULL
, -1, 0);
997 case 'H': /* Sequent-hack: the linker wants a bit set
1000 iif
.instr_size
+= suffixP
[i
] ? suffixP
[i
] : 4;
1001 IIF (12, 2, suffixP
[i
], (unsigned long) argv
[i
], 0,
1002 pcrel
, pcrel_adjust
, 1, IND (BRANCH
, BYTE
), NULL
, -1, 1);
1004 case 'q': /* quick */
1005 opcode_bit_ptr
-= 4;
1006 IIF (11, 2, 42, (unsigned long) argv
[i
], 0, 0, 0, 0, 0,
1007 bit_fix_new (4, opcode_bit_ptr
, -8, 7, 0, 1, 0), -1, 0);
1009 case 'r': /* Register number (3 bits). */
1010 list_search (argv
[i
], opt6
, &tmp
);
1011 opcode_bit_ptr
-= 3;
1012 iif
.iifP
[1].object
|= tmp
<< opcode_bit_ptr
;
1014 case 'O': /* Setcfg instruction options list. */
1015 optlist (argv
[i
], opt3
, &tmp
);
1016 opcode_bit_ptr
-= 4;
1017 iif
.iifP
[1].object
|= tmp
<< 15;
1019 case 'C': /* Cinv instruction options list. */
1020 optlist (argv
[i
], opt4
, &tmp
);
1021 opcode_bit_ptr
-= 4;
1022 iif
.iifP
[1].object
|= tmp
<< 15; /* Insert the regtype in opcode. */
1024 case 'S': /* String instruction options list. */
1025 optlist (argv
[i
], opt5
, &tmp
);
1026 opcode_bit_ptr
-= 4;
1027 iif
.iifP
[1].object
|= tmp
<< 15;
1030 case 'U': /* Register list. */
1031 IIF (10, 1, 1, 0, 0, 0, 0, 0, 0, NULL
, -1, 0);
1032 switch (operandsP
[(i
<< 1) + 1])
1034 case 'u': /* Restore, exit. */
1035 optlist (argv
[i
], opt1
, &iif
.iifP
[10].object
);
1037 case 'U': /* Save, enter. */
1038 optlist (argv
[i
], opt2
, &iif
.iifP
[10].object
);
1041 iif
.instr_size
+= 1;
1043 case 'M': /* MMU register. */
1044 list_search (argv
[i
], mmureg
, &tmp
);
1045 opcode_bit_ptr
-= 4;
1046 iif
.iifP
[1].object
|= tmp
<< opcode_bit_ptr
;
1048 case 'P': /* CPU register. */
1049 list_search (argv
[i
], cpureg
, &tmp
);
1050 opcode_bit_ptr
-= 4;
1051 iif
.iifP
[1].object
|= tmp
<< opcode_bit_ptr
;
1053 case 'g': /* Inss exts. */
1054 iif
.instr_size
+= 1; /* 1 byte is allocated after the opcode. */
1056 (unsigned long) argv
[i
], /* i always 2 here. */
1058 bit_fix_new (3, 5, 0, 7, 0, 0, 0), /* A bit_fix is targeted to
1064 (unsigned long) argv
[i
], /* i always 3 here. */
1066 bit_fix_new (5, 0, 1, 32, -1, 0, -1), -1, 0);
1069 iif
.instr_size
+= 1;
1070 b
= 2 + i
; /* Put the extension byte after opcode. */
1071 IIF (b
, 2, 1, 0, 0, 0, 0, 0, 0, 0, -1, 0);
1074 as_fatal (_("Bad opcode-table-option, check in file ns32k-opcode.h"));
1079 /* in: instruction line
1080 out: internal structure of instruction
1081 that has been prepared for direct conversion to fragment(s) and
1082 fixes in a systematical fashion
1083 Return-value = recursive_level. */
1084 /* Build iif of one assembly text line. */
1087 parse (const char *line
, int recursive_level
)
1089 const char *lineptr
;
1090 char c
, suffix_separator
;
1095 char suffix
[MAX_ARGS
], *argv
[MAX_ARGS
]; /* No more than 4 operands. */
1097 if (recursive_level
<= 0)
1099 /* Called from md_assemble. */
1100 for (lineptr
= line
; (*lineptr
) != '\0' && (*lineptr
) != ' '; lineptr
++)
1104 *(char *) lineptr
= '\0';
1106 if (!(desc
= (struct ns32k_opcode
*) hash_find (inst_hash_handle
, line
)))
1107 as_fatal (_("No such opcode"));
1109 *(char *) lineptr
= c
;
1116 if (*desc
->operands
)
1118 if (*lineptr
++ != '\0')
1123 while (*lineptr
!= '\0')
1125 if (desc
->operands
[argc
<< 1])
1128 arg_type
= desc
->operands
[(argc
<< 1) + 1];
1136 /* The operand is supposed to be a displacement. */
1137 /* Hackwarning: do not forget to update the 4
1138 cases above when editing ns32k-opcode.h. */
1139 suffix_separator
= ':';
1142 /* If this char occurs we loose. */
1143 suffix_separator
= '\255';
1147 suffix
[argc
] = 0; /* 0 when no ':' is encountered. */
1148 argv
[argc
] = freeptr
;
1151 while ((c
= *lineptr
) != '\0' && c
!= sep
)
1167 if (c
== suffix_separator
)
1169 /* ':' - label/suffix separator. */
1182 as_warn (_("Bad suffix, defaulting to d"));
1184 if (lineptr
[1] == '\0' || lineptr
[1] == sep
)
1203 if (*lineptr
== '\0')
1209 as_fatal (_("Too many operands passed to instruction"));
1214 if (argc
!= strlen (desc
->operands
) / 2)
1216 if (strlen (desc
->default_args
))
1218 /* We can apply default, don't goof. */
1219 if (parse (desc
->default_args
, 1) != 1)
1220 /* Check error in default. */
1221 as_fatal (_("Wrong numbers of operands in default, check ns32k-opcodes.h"));
1224 as_fatal (_("Wrong number of operands"));
1227 for (i
= 0; i
< IIF_ENTRIES
; i
++)
1228 /* Mark all entries as void. */
1229 iif
.iifP
[i
].type
= 0;
1231 /* Build opcode iif-entry. */
1232 iif
.instr_size
= desc
->opcode_size
/ 8;
1233 IIF (1, 1, iif
.instr_size
, desc
->opcode_seed
, 0, 0, 0, 0, 0, 0, -1, 0);
1235 /* This call encodes operands to iif format. */
1237 encode_operand (argc
, argv
, &desc
->operands
[0],
1238 &suffix
[0], desc
->im_size
, desc
->opcode_size
);
1240 return recursive_level
;
1243 /* This functionality should really be in the bfd library. */
1245 static bfd_reloc_code_real_type
1246 reloc (int size
, int pcrel
, int type
)
1248 int length
, rel_index
;
1249 bfd_reloc_code_real_type relocs
[] =
1251 BFD_RELOC_NS32K_IMM_8
,
1252 BFD_RELOC_NS32K_IMM_16
,
1253 BFD_RELOC_NS32K_IMM_32
,
1254 BFD_RELOC_NS32K_IMM_8_PCREL
,
1255 BFD_RELOC_NS32K_IMM_16_PCREL
,
1256 BFD_RELOC_NS32K_IMM_32_PCREL
,
1258 /* ns32k displacements. */
1259 BFD_RELOC_NS32K_DISP_8
,
1260 BFD_RELOC_NS32K_DISP_16
,
1261 BFD_RELOC_NS32K_DISP_32
,
1262 BFD_RELOC_NS32K_DISP_8_PCREL
,
1263 BFD_RELOC_NS32K_DISP_16_PCREL
,
1264 BFD_RELOC_NS32K_DISP_32_PCREL
,
1266 /* Normal 2's complement. */
1291 rel_index
= length
+ 3 * pcrel
+ 6 * type
;
1293 if (rel_index
>= 0 && (unsigned int) rel_index
< sizeof (relocs
) / sizeof (relocs
[0]))
1294 return relocs
[rel_index
];
1297 as_bad (_("Can not do %d byte pc-relative relocation for storage type %d"),
1300 as_bad (_("Can not do %d byte relocation for storage type %d"),
1303 return BFD_RELOC_NONE
;
1308 fix_new_ns32k (fragS
*frag
, /* Which frag? */
1309 int where
, /* Where in that frag? */
1310 int size
, /* 1, 2 or 4 usually. */
1311 symbolS
*add_symbol
, /* X_add_symbol. */
1312 long offset
, /* X_add_number. */
1313 int pcrel
, /* True if PC-relative relocation. */
1314 char im_disp
, /* True if the value to write is a
1316 bit_fixS
*bit_fixP
, /* Pointer at struct of bit_fix's, ignored if
1318 char bsr
, /* Sequent-linker-hack: 1 when relocobject is
1321 unsigned int opcode_offset
)
1323 fixS
*fixP
= fix_new (frag
, where
, size
, add_symbol
,
1325 bit_fixP
? NO_RELOC
: reloc (size
, pcrel
, im_disp
)
1328 fix_opcode_frag (fixP
) = opcode_frag
;
1329 fix_opcode_offset (fixP
) = opcode_offset
;
1330 fix_im_disp (fixP
) = im_disp
;
1331 fix_bsr (fixP
) = bsr
;
1332 fix_bit_fixP (fixP
) = bit_fixP
;
1333 /* We have a MD overflow check for displacements. */
1334 fixP
->fx_no_overflow
= (im_disp
!= 0);
1338 fix_new_ns32k_exp (fragS
*frag
, /* Which frag? */
1339 int where
, /* Where in that frag? */
1340 int size
, /* 1, 2 or 4 usually. */
1341 expressionS
*exp
, /* Expression. */
1342 int pcrel
, /* True if PC-relative relocation. */
1343 char im_disp
, /* True if the value to write is a
1345 bit_fixS
*bit_fixP
, /* Pointer at struct of bit_fix's, ignored if
1347 char bsr
, /* Sequent-linker-hack: 1 when relocobject is
1350 unsigned int opcode_offset
)
1352 fixS
*fixP
= fix_new_exp (frag
, where
, size
, exp
, pcrel
,
1353 bit_fixP
? NO_RELOC
: reloc (size
, pcrel
, im_disp
)
1356 fix_opcode_frag (fixP
) = opcode_frag
;
1357 fix_opcode_offset (fixP
) = opcode_offset
;
1358 fix_im_disp (fixP
) = im_disp
;
1359 fix_bsr (fixP
) = bsr
;
1360 fix_bit_fixP (fixP
) = bit_fixP
;
1361 /* We have a MD overflow check for displacements. */
1362 fixP
->fx_no_overflow
= (im_disp
!= 0);
1365 /* Convert number to chars in correct order. */
1368 md_number_to_chars (char *buf
, valueT value
, int nbytes
)
1370 number_to_chars_littleendian (buf
, value
, nbytes
);
1373 /* This is a variant of md_numbers_to_chars. The reason for its
1374 existence is the fact that ns32k uses Huffman coded
1375 displacements. This implies that the bit order is reversed in
1376 displacements and that they are prefixed with a size-tag.
1380 10xxxxxx xxxxxxxx word
1381 11xxxxxx xxxxxxxx xxxxxxxx xxxxxxxx double word
1383 This must be taken care of and we do it here! */
1386 md_number_to_disp (char *buf
, long val
, int n
)
1391 if (val
< -64 || val
> 63)
1392 as_bad (_("value of %ld out of byte displacement range."), val
);
1395 printf ("%x ", val
& 0xff);
1401 if (val
< -8192 || val
> 8191)
1402 as_bad (_("value of %ld out of word displacement range."), val
);
1406 printf ("%x ", val
>> 8 & 0xff);
1408 *buf
++ = (val
>> 8);
1410 printf ("%x ", val
& 0xff);
1416 if (val
< -0x20000000 || val
>= 0x20000000)
1417 as_bad (_("value of %ld out of double word displacement range."), val
);
1420 printf ("%x ", val
>> 24 & 0xff);
1422 *buf
++ = (val
>> 24);
1424 printf ("%x ", val
>> 16 & 0xff);
1426 *buf
++ = (val
>> 16);
1428 printf ("%x ", val
>> 8 & 0xff);
1430 *buf
++ = (val
>> 8);
1432 printf ("%x ", val
& 0xff);
1438 as_fatal (_("Internal logic error. Line %d, file: \"%s\""),
1439 __LINE__
, __FILE__
);
1444 md_number_to_imm (char *buf
, long val
, int n
)
1450 printf ("%x ", val
& 0xff);
1457 printf ("%x ", val
>> 8 & 0xff);
1459 *buf
++ = (val
>> 8);
1461 printf ("%x ", val
& 0xff);
1468 printf ("%x ", val
>> 24 & 0xff);
1470 *buf
++ = (val
>> 24);
1472 printf ("%x ", val
>> 16 & 0xff);
1474 *buf
++ = (val
>> 16);
1476 printf ("%x ", val
>> 8 & 0xff);
1478 *buf
++ = (val
>> 8);
1480 printf ("%x ", val
& 0xff);
1486 as_fatal (_("Internal logic error. line %d, file \"%s\""),
1487 __LINE__
, __FILE__
);
1491 /* Fast bitfiddling support. */
1492 /* Mask used to zero bitfield before oring in the true field. */
1494 static unsigned long l_mask
[] =
1496 0xffffffff, 0xfffffffe, 0xfffffffc, 0xfffffff8,
1497 0xfffffff0, 0xffffffe0, 0xffffffc0, 0xffffff80,
1498 0xffffff00, 0xfffffe00, 0xfffffc00, 0xfffff800,
1499 0xfffff000, 0xffffe000, 0xffffc000, 0xffff8000,
1500 0xffff0000, 0xfffe0000, 0xfffc0000, 0xfff80000,
1501 0xfff00000, 0xffe00000, 0xffc00000, 0xff800000,
1502 0xff000000, 0xfe000000, 0xfc000000, 0xf8000000,
1503 0xf0000000, 0xe0000000, 0xc0000000, 0x80000000,
1505 static unsigned long r_mask
[] =
1507 0x00000000, 0x00000001, 0x00000003, 0x00000007,
1508 0x0000000f, 0x0000001f, 0x0000003f, 0x0000007f,
1509 0x000000ff, 0x000001ff, 0x000003ff, 0x000007ff,
1510 0x00000fff, 0x00001fff, 0x00003fff, 0x00007fff,
1511 0x0000ffff, 0x0001ffff, 0x0003ffff, 0x0007ffff,
1512 0x000fffff, 0x001fffff, 0x003fffff, 0x007fffff,
1513 0x00ffffff, 0x01ffffff, 0x03ffffff, 0x07ffffff,
1514 0x0fffffff, 0x1fffffff, 0x3fffffff, 0x7fffffff,
1516 #define MASK_BITS 31
1517 /* Insert bitfield described by field_ptr and val at buf
1518 This routine is written for modification of the first 4 bytes pointed
1519 to by buf, to yield speed.
1520 The ifdef stuff is for selection between a ns32k-dependent routine
1521 and a general version. (My advice: use the general version!). */
1524 md_number_to_field (char *buf
, long val
, bit_fixS
*field_ptr
)
1526 unsigned long object
;
1528 /* Define ENDIAN on a ns32k machine. */
1530 unsigned long *mem_ptr
;
1535 if (field_ptr
->fx_bit_min
<= val
&& val
<= field_ptr
->fx_bit_max
)
1538 if (field_ptr
->fx_bit_base
)
1540 mem_ptr
= (unsigned long *) field_ptr
->fx_bit_base
;
1542 mem_ptr
= (unsigned long *) buf
;
1544 mem_ptr
= ((unsigned long *)
1545 ((char *) mem_ptr
+ field_ptr
->fx_bit_base_adj
));
1547 if (field_ptr
->fx_bit_base
)
1548 mem_ptr
= (char *) field_ptr
->fx_bit_base
;
1552 mem_ptr
+= field_ptr
->fx_bit_base_adj
;
1555 /* We have a nice ns32k machine with lowbyte at low-physical mem. */
1556 object
= *mem_ptr
; /* get some bytes */
1557 #else /* OVE Goof! the machine is a m68k or dito. */
1558 /* That takes more byte fiddling. */
1560 object
|= mem_ptr
[3] & 0xff;
1562 object
|= mem_ptr
[2] & 0xff;
1564 object
|= mem_ptr
[1] & 0xff;
1566 object
|= mem_ptr
[0] & 0xff;
1569 mask
|= (r_mask
[field_ptr
->fx_bit_offset
]);
1570 mask
|= (l_mask
[field_ptr
->fx_bit_offset
+ field_ptr
->fx_bit_size
]);
1572 val
+= field_ptr
->fx_bit_add
;
1573 object
|= ((val
<< field_ptr
->fx_bit_offset
) & (mask
^ 0xffffffff));
1577 mem_ptr
[0] = (char) object
;
1579 mem_ptr
[1] = (char) object
;
1581 mem_ptr
[2] = (char) object
;
1583 mem_ptr
[3] = (char) object
;
1587 as_bad (_("Bit field out of range"));
1590 /* Convert iif to fragments. From this point we start to dribble with
1591 functions in other files than this one.(Except hash.c) So, if it's
1592 possible to make an iif for an other CPU, you don't need to know
1593 what frags, relax, obstacks, etc is in order to port this
1594 assembler. You only need to know if it's possible to reduce your
1595 cpu-instruction to iif-format (takes some work) and adopt the other
1596 md_? parts according to given instructions Note that iif was
1597 invented for the clean ns32k`s architecture. */
1599 /* GAS for the ns32k has a problem. PC relative displacements are
1600 relative to the address of the opcode, not the address of the
1601 operand. We used to keep track of the offset between the operand
1602 and the opcode in pcrel_adjust for each frag and each fix. However,
1603 we get into trouble where there are two or more pc-relative
1604 operands and the size of the first one can't be determined. Then in
1605 the relax phase, the size of the first operand will change and
1606 pcrel_adjust will no longer be correct. The current solution is
1607 keep a pointer to the frag with the opcode in it and the offset in
1608 that frag for each frag and each fix. Then, when needed, we can
1609 always figure out how far it is between the opcode and the pcrel
1610 object. See also md_pcrel_adjust and md_fix_pcrel_adjust. For
1611 objects not part of an instruction, the pointer to the opcode frag
1620 unsigned int inst_offset
;
1628 frag_grow (iif
.instr_size
); /* This is important. */
1629 memP
= frag_more (0);
1631 inst_offset
= (memP
- frag_now
->fr_literal
);
1632 inst_frag
= frag_now
;
1634 for (i
= 0; i
< IIF_ENTRIES
; i
++)
1636 if ((type
= iif
.iifP
[i
].type
))
1638 /* The object exist, so handle it. */
1639 switch (size
= iif
.iifP
[i
].size
)
1643 /* It's a bitfix that operates on an existing object. */
1644 if (iif
.iifP
[i
].bit_fixP
->fx_bit_base
)
1645 /* Expand fx_bit_base to point at opcode. */
1646 iif
.iifP
[i
].bit_fixP
->fx_bit_base
= (long) inst_opcode
;
1649 case 8: /* bignum or doublefloat. */
1654 /* The final size in objectmemory is known. */
1655 memP
= frag_more (size
);
1656 j
= iif
.iifP
[i
].bit_fixP
;
1660 case 1: /* The object is pure binary. */
1662 md_number_to_field (memP
, exprP
.X_add_number
, j
);
1664 else if (iif
.iifP
[i
].pcrel
)
1665 fix_new_ns32k (frag_now
,
1666 (long) (memP
- frag_now
->fr_literal
),
1671 iif
.iifP
[i
].im_disp
,
1673 iif
.iifP
[i
].bsr
, /* Sequent hack. */
1674 inst_frag
, inst_offset
);
1677 /* Good, just put them bytes out. */
1678 switch (iif
.iifP
[i
].im_disp
)
1681 md_number_to_chars (memP
, iif
.iifP
[i
].object
, size
);
1684 md_number_to_disp (memP
, iif
.iifP
[i
].object
, size
);
1687 as_fatal (_("iif convert internal pcrel/binary"));
1693 /* The object is a pointer at an expression, so
1694 unpack it, note that bignums may result from the
1696 evaluate_expr (&exprP
, (char *) iif
.iifP
[i
].object
);
1697 if (exprP
.X_op
== O_big
|| size
== 8)
1699 if ((k
= exprP
.X_add_number
) > 0)
1701 /* We have a bignum ie a quad. This can only
1702 happens in a long suffixed instruction. */
1704 as_bad (_("Bignum too big for long"));
1709 for (l
= 0; k
> 0; k
--, l
+= 2)
1710 md_number_to_chars (memP
+ l
,
1711 generic_bignum
[l
>> 1],
1712 sizeof (LITTLENUM_TYPE
));
1717 LITTLENUM_TYPE words
[4];
1722 gen_to_words (words
, 2, 8);
1723 md_number_to_imm (memP
, (long) words
[0],
1724 sizeof (LITTLENUM_TYPE
));
1725 md_number_to_imm (memP
+ sizeof (LITTLENUM_TYPE
),
1727 sizeof (LITTLENUM_TYPE
));
1730 gen_to_words (words
, 4, 11);
1731 md_number_to_imm (memP
, (long) words
[0],
1732 sizeof (LITTLENUM_TYPE
));
1733 md_number_to_imm (memP
+ sizeof (LITTLENUM_TYPE
),
1735 sizeof (LITTLENUM_TYPE
));
1736 md_number_to_imm ((memP
+ 2
1737 * sizeof (LITTLENUM_TYPE
)),
1739 sizeof (LITTLENUM_TYPE
));
1740 md_number_to_imm ((memP
+ 3
1741 * sizeof (LITTLENUM_TYPE
)),
1743 sizeof (LITTLENUM_TYPE
));
1749 if (exprP
.X_add_symbol
||
1750 exprP
.X_op_symbol
||
1753 /* The expression was undefined due to an
1754 undefined label. Create a fix so we can fix
1755 the object later. */
1756 exprP
.X_add_number
+= iif
.iifP
[i
].object_adjust
;
1757 fix_new_ns32k_exp (frag_now
,
1758 (long) (memP
- frag_now
->fr_literal
),
1762 iif
.iifP
[i
].im_disp
,
1765 inst_frag
, inst_offset
);
1768 md_number_to_field (memP
, exprP
.X_add_number
, j
);
1771 /* Good, just put them bytes out. */
1772 switch (iif
.iifP
[i
].im_disp
)
1775 md_number_to_imm (memP
, exprP
.X_add_number
, size
);
1778 md_number_to_disp (memP
, exprP
.X_add_number
, size
);
1781 as_fatal (_("iif convert internal pcrel/pointer"));
1786 as_fatal (_("Internal logic error in iif.iifP[n].type"));
1791 /* Too bad, the object may be undefined as far as its
1792 final nsize in object memory is concerned. The size
1793 of the object in objectmemory is not explicitly
1794 given. If the object is defined its length can be
1795 determined and a fix can replace the frag. */
1797 evaluate_expr (&exprP
, (char *) iif
.iifP
[i
].object
);
1799 if ((exprP
.X_add_symbol
|| exprP
.X_op_symbol
) &&
1802 /* Size is unknown until link time so have to default. */
1803 size
= default_disp_size
; /* Normally 4 bytes. */
1804 memP
= frag_more (size
);
1805 fix_new_ns32k_exp (frag_now
,
1806 (long) (memP
- frag_now
->fr_literal
),
1809 0, /* never iif.iifP[i].pcrel, */
1810 1, /* always iif.iifP[i].im_disp */
1814 break; /* Exit this absolute hack. */
1817 if (exprP
.X_add_symbol
|| exprP
.X_op_symbol
)
1820 if (exprP
.X_op_symbol
)
1821 /* We can't relax this case. */
1822 as_fatal (_("Can't relax difference"));
1825 /* Size is not important. This gets fixed by
1826 relax, but we assume 0 in what follows. */
1827 memP
= frag_more (4); /* Max size. */
1831 fragS
*old_frag
= frag_now
;
1832 frag_variant (rs_machine_dependent
,
1835 IND (BRANCH
, UNDEF
), /* Expecting
1840 frag_opcode_frag (old_frag
) = inst_frag
;
1841 frag_opcode_offset (old_frag
) = inst_offset
;
1842 frag_bsr (old_frag
) = iif
.iifP
[i
].bsr
;
1848 /* This duplicates code in md_number_to_disp. */
1849 if (-64 <= exprP
.X_add_number
&& exprP
.X_add_number
<= 63)
1853 if (-8192 <= exprP
.X_add_number
1854 && exprP
.X_add_number
<= 8191)
1858 if (-0x20000000 <= exprP
.X_add_number
1859 && exprP
.X_add_number
<=0x1fffffff)
1863 as_bad (_("Displacement too large for :d"));
1869 memP
= frag_more (size
);
1870 md_number_to_disp (memP
, exprP
.X_add_number
, size
);
1876 as_fatal (_("Internal logic error in iif.iifP[].type"));
1883 md_assemble (char *line
)
1885 freeptr
= freeptr_static
;
1886 parse (line
, 0); /* Explode line to more fix form in iif. */
1887 convert_iif (); /* Convert iif to frags, fix's etc. */
1889 printf (" \t\t\t%s\n", line
);
1896 /* Build a hashtable of the instructions. */
1897 const struct ns32k_opcode
*ptr
;
1899 const struct ns32k_opcode
*endop
;
1901 inst_hash_handle
= hash_new ();
1903 endop
= ns32k_opcodes
+ sizeof (ns32k_opcodes
) / sizeof (ns32k_opcodes
[0]);
1904 for (ptr
= ns32k_opcodes
; ptr
< endop
; ptr
++)
1906 if ((status
= hash_insert (inst_hash_handle
, ptr
->name
, (char *) ptr
)))
1908 as_fatal (_("Can't hash %s: %s"), ptr
->name
, status
);
1911 /* Some private space please! */
1912 freeptr_static
= XNEWVEC (char, PRIVATE_SIZE
);
1915 /* Turn the string pointed to by litP into a floating point constant
1916 of type TYPE, and emit the appropriate bytes. The number of
1917 LITTLENUMS emitted is stored in *SIZEP. An error message is
1918 returned, or NULL on OK. */
1921 md_atof (int type
, char *litP
, int *sizeP
)
1923 return ieee_md_atof (type
, litP
, sizeP
, FALSE
);
1927 md_pcrel_adjust (fragS
*fragP
)
1930 addressT opcode_address
;
1931 unsigned int offset
;
1933 opcode_frag
= frag_opcode_frag (fragP
);
1934 if (opcode_frag
== 0)
1937 offset
= frag_opcode_offset (fragP
);
1938 opcode_address
= offset
+ opcode_frag
->fr_address
;
1940 return fragP
->fr_address
+ fragP
->fr_fix
- opcode_address
;
1944 md_fix_pcrel_adjust (fixS
*fixP
)
1947 addressT opcode_address
;
1948 unsigned int offset
;
1950 opcode_frag
= fix_opcode_frag (fixP
);
1951 if (opcode_frag
== 0)
1954 offset
= fix_opcode_offset (fixP
);
1955 opcode_address
= offset
+ opcode_frag
->fr_address
;
1957 return fixP
->fx_where
+ fixP
->fx_frag
->fr_address
- opcode_address
;
1960 /* Apply a fixS (fixup of an instruction or data that we didn't have
1961 enough info to complete immediately) to the data in a frag.
1963 On the ns32k, everything is in a different format, so we have broken
1964 out separate functions for each kind of thing we could be fixing.
1965 They all get called from here. */
1968 md_apply_fix (fixS
*fixP
, valueT
* valP
, segT seg ATTRIBUTE_UNUSED
)
1970 long val
= * (long *) valP
;
1971 char *buf
= fixP
->fx_where
+ fixP
->fx_frag
->fr_literal
;
1973 if (fix_bit_fixP (fixP
))
1974 /* Bitfields to fix, sigh. */
1975 md_number_to_field (buf
, val
, fix_bit_fixP (fixP
));
1976 else switch (fix_im_disp (fixP
))
1979 /* Immediate field. */
1980 md_number_to_imm (buf
, val
, fixP
->fx_size
);
1984 /* Displacement field. */
1985 /* Calculate offset. */
1986 md_number_to_disp (buf
,
1987 (fixP
->fx_pcrel
? val
+ md_fix_pcrel_adjust (fixP
)
1988 : val
), fixP
->fx_size
);
1992 /* Pointer in a data object. */
1993 md_number_to_chars (buf
, val
, fixP
->fx_size
);
1997 if (fixP
->fx_addsy
== NULL
&& fixP
->fx_pcrel
== 0)
2001 /* Convert a relaxed displacement to ditto in final output. */
2004 md_convert_frag (bfd
*abfd ATTRIBUTE_UNUSED
,
2005 segT sec ATTRIBUTE_UNUSED
,
2010 /* Address in gas core of the place to store the displacement. */
2011 char *buffer_address
= fragP
->fr_fix
+ fragP
->fr_literal
;
2012 /* Address in object code of the displacement. */
2015 switch (fragP
->fr_subtype
)
2017 case IND (BRANCH
, BYTE
):
2020 case IND (BRANCH
, WORD
):
2023 case IND (BRANCH
, DOUBLE
):
2031 know (fragP
->fr_symbol
);
2033 object_address
= fragP
->fr_fix
+ fragP
->fr_address
;
2035 /* The displacement of the address, from current location. */
2036 disp
= (S_GET_VALUE (fragP
->fr_symbol
) + fragP
->fr_offset
) - object_address
;
2037 disp
+= md_pcrel_adjust (fragP
);
2039 md_number_to_disp (buffer_address
, (long) disp
, (int) ext
);
2040 fragP
->fr_fix
+= ext
;
2043 /* This function returns the estimated size a variable object will occupy,
2044 one can say that we tries to guess the size of the objects before we
2045 actually know it. */
2048 md_estimate_size_before_relax (fragS
*fragP
, segT segment
)
2050 if (fragP
->fr_subtype
== IND (BRANCH
, UNDEF
))
2052 if (S_GET_SEGMENT (fragP
->fr_symbol
) != segment
)
2054 /* We don't relax symbols defined in another segment. The
2055 thing to do is to assume the object will occupy 4 bytes. */
2056 fix_new_ns32k (fragP
,
2057 (int) (fragP
->fr_fix
),
2064 frag_bsr(fragP
), /* Sequent hack. */
2065 frag_opcode_frag (fragP
),
2066 frag_opcode_offset (fragP
));
2072 /* Relaxable case. Set up the initial guess for the variable
2073 part of the frag. */
2074 fragP
->fr_subtype
= IND (BRANCH
, BYTE
);
2077 if (fragP
->fr_subtype
>= sizeof (md_relax_table
) / sizeof (md_relax_table
[0]))
2080 /* Return the size of the variable part of the frag. */
2081 return md_relax_table
[fragP
->fr_subtype
].rlx_length
;
2084 int md_short_jump_size
= 3;
2085 int md_long_jump_size
= 5;
2088 md_create_short_jump (char *ptr
,
2091 fragS
*frag ATTRIBUTE_UNUSED
,
2092 symbolS
*to_symbol ATTRIBUTE_UNUSED
)
2096 offset
= to_addr
- from_addr
;
2097 md_number_to_chars (ptr
, (valueT
) 0xEA, 1);
2098 md_number_to_disp (ptr
+ 1, (valueT
) offset
, 2);
2102 md_create_long_jump (char *ptr
,
2105 fragS
*frag ATTRIBUTE_UNUSED
,
2106 symbolS
*to_symbol ATTRIBUTE_UNUSED
)
2110 offset
= to_addr
- from_addr
;
2111 md_number_to_chars (ptr
, (valueT
) 0xEA, 1);
2112 md_number_to_disp (ptr
+ 1, (valueT
) offset
, 4);
2115 const char *md_shortopts
= "m:";
2117 struct option md_longopts
[] =
2119 #define OPTION_DISP_SIZE (OPTION_MD_BASE)
2120 {"disp-size-default", required_argument
, NULL
, OPTION_DISP_SIZE
},
2121 {NULL
, no_argument
, NULL
, 0}
2124 size_t md_longopts_size
= sizeof (md_longopts
);
2127 md_parse_option (int c
, const char *arg
)
2132 if (!strcmp (arg
, "32032"))
2134 cpureg
= cpureg_032
;
2135 mmureg
= mmureg_032
;
2137 else if (!strcmp (arg
, "32532"))
2139 cpureg
= cpureg_532
;
2140 mmureg
= mmureg_532
;
2144 as_warn (_("invalid architecture option -m%s, ignored"), arg
);
2148 case OPTION_DISP_SIZE
:
2150 int size
= atoi(arg
);
2153 case 1: case 2: case 4:
2154 default_disp_size
= size
;
2157 as_warn (_("invalid default displacement size \"%s\". Defaulting to %d."),
2158 arg
, default_disp_size
);
2171 md_show_usage (FILE *stream
)
2173 fprintf (stream
, _("\
2175 -m32032 | -m32532 select variant of NS32K architecture\n\
2176 --disp-size-default=<1|2|4>\n"));
2179 /* This is TC_CONS_FIX_NEW, called by emit_expr in read.c. */
2182 cons_fix_new_ns32k (fragS
*frag
, /* Which frag? */
2183 int where
, /* Where in that frag? */
2184 int size
, /* 1, 2 or 4 usually. */
2185 expressionS
*exp
, /* Expression. */
2186 bfd_reloc_code_real_type r ATTRIBUTE_UNUSED
)
2188 fix_new_ns32k_exp (frag
, where
, size
, exp
,
2192 /* We have no need to default values of symbols. */
2195 md_undefined_symbol (char *name ATTRIBUTE_UNUSED
)
2200 /* Round up a section size to the appropriate boundary. */
2203 md_section_align (segT segment ATTRIBUTE_UNUSED
, valueT size
)
2205 return size
; /* Byte alignment is fine. */
2208 /* Exactly what point is a PC-relative offset relative TO? On the
2209 ns32k, they're relative to the start of the instruction. */
2212 md_pcrel_from (fixS
*fixP
)
2216 res
= fixP
->fx_where
+ fixP
->fx_frag
->fr_address
;
2217 #ifdef SEQUENT_COMPATABILITY
2218 if (frag_bsr (fixP
->fx_frag
))
2219 res
+= 0x12 /* FOO Kludge alert! */
2225 tc_gen_reloc (asection
*section ATTRIBUTE_UNUSED
, fixS
*fixp
)
2228 bfd_reloc_code_real_type code
;
2230 code
= reloc (fixp
->fx_size
, fixp
->fx_pcrel
, fix_im_disp (fixp
));
2232 rel
= XNEW (arelent
);
2233 rel
->sym_ptr_ptr
= XNEW (asymbol
*);
2234 *rel
->sym_ptr_ptr
= symbol_get_bfdsym (fixp
->fx_addsy
);
2235 rel
->address
= fixp
->fx_frag
->fr_address
+ fixp
->fx_where
;
2237 rel
->addend
= fixp
->fx_addnumber
;
2241 rel
->howto
= bfd_reloc_type_lookup (stdoutput
, code
);
2246 name
= S_GET_NAME (fixp
->fx_addsy
);
2248 name
= _("<unknown>");
2249 as_fatal (_("Cannot find relocation type for symbol %s, code %d"),