Tue Jul 7 13:00:37 1998 Alan Modra <alan@spri.levels.unisa.edu.au>
[binutils-gdb.git] / gas / config / tc-i386.c
1 /* i386.c -- Assemble code for the Intel 80386
2 Copyright (C) 1989, 91, 92, 93, 94, 95, 96, 97, 1998
3 Free Software Foundation.
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 the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
20 02111-1307, USA. */
21
22 /*
23 Intel 80386 machine specific gas.
24 Written by Eliot Dresselhaus (eliot@mgm.mit.edu).
25 Bugs & suggestions are completely welcome. This is free software.
26 Please help us make it better.
27 */
28
29 #include <ctype.h>
30
31 #include "as.h"
32 #include "subsegs.h"
33 #include "opcode/i386.h"
34
35 #ifndef TC_RELOC
36 #define TC_RELOC(X,Y) (Y)
37 #endif
38
39 #ifndef REGISTER_WARNINGS
40 #define REGISTER_WARNINGS 1
41 #endif
42
43 #ifndef SCALE1_WHEN_NO_INDEX
44 /* Specifying a scale factor besides 1 when there is no index is
45 futile. eg. `mov (%ebx,2),%al' does exactly the same as
46 `mov (%ebx),%al'. To slavishly follow what the programmer
47 specified, set SCALE1_WHEN_NO_INDEX to 0. */
48 #define SCALE1_WHEN_NO_INDEX 1
49 #endif
50
51 static unsigned long mode_from_disp_size PARAMS ((unsigned long));
52 static int fits_in_signed_byte PARAMS ((long));
53 static int fits_in_unsigned_byte PARAMS ((long));
54 static int fits_in_unsigned_word PARAMS ((long));
55 static int fits_in_signed_word PARAMS ((long));
56 static int smallest_imm_type PARAMS ((long));
57 static int add_prefix PARAMS ((unsigned int));
58 static void set_16bit_code_flag PARAMS ((int));
59 #ifdef BFD_ASSEMBLER
60 static bfd_reloc_code_real_type reloc
61 PARAMS ((int, int, bfd_reloc_code_real_type));
62 #endif
63
64 /* 'md_assemble ()' gathers together information and puts it into a
65 i386_insn. */
66
67 struct _i386_insn
68 {
69 /* TM holds the template for the insn were currently assembling. */
70 template tm;
71
72 /* SUFFIX holds the opcode suffix (e.g. 'l' for 'movl') if given. */
73 char suffix;
74
75 /* Operands are coded with OPERANDS, TYPES, DISPS, IMMS, and REGS. */
76
77 /* OPERANDS gives the number of given operands. */
78 unsigned int operands;
79
80 /* REG_OPERANDS, DISP_OPERANDS, MEM_OPERANDS, IMM_OPERANDS give the number
81 of given register, displacement, memory operands and immediate
82 operands. */
83 unsigned int reg_operands, disp_operands, mem_operands, imm_operands;
84
85 /* TYPES [i] is the type (see above #defines) which tells us how to
86 search through DISPS [i] & IMMS [i] & REGS [i] for the required
87 operand. */
88 unsigned int types[MAX_OPERANDS];
89
90 /* Displacements (if given) for each operand. */
91 expressionS *disps[MAX_OPERANDS];
92
93 /* Relocation type for operand */
94 #ifdef BFD_ASSEMBLER
95 enum bfd_reloc_code_real disp_reloc[MAX_OPERANDS];
96 #else
97 int disp_reloc[MAX_OPERANDS];
98 #endif
99
100 /* Immediate operands (if given) for each operand. */
101 expressionS *imms[MAX_OPERANDS];
102
103 /* Register operands (if given) for each operand. */
104 const reg_entry *regs[MAX_OPERANDS];
105
106 /* BASE_REG, INDEX_REG, and LOG2_SCALE_FACTOR are used to encode
107 the base index byte below. */
108 const reg_entry *base_reg;
109 const reg_entry *index_reg;
110 unsigned int log2_scale_factor;
111
112 /* SEG gives the seg_entries of this insn. They are zero unless
113 explicit segment overrides are given. */
114 const seg_entry *seg[2]; /* segments for memory operands (if given) */
115
116 /* PREFIX holds all the given prefix opcodes (usually null).
117 PREFIXES is the number of prefix opcodes. */
118 unsigned int prefixes;
119 unsigned char prefix[MAX_PREFIXES];
120
121 /* RM and SIB are the modrm byte and the sib byte where the
122 addressing modes of this insn are encoded. */
123
124 modrm_byte rm;
125 sib_byte sib;
126 };
127
128 typedef struct _i386_insn i386_insn;
129
130 /* List of chars besides those in app.c:symbol_chars that can start an
131 operand. Used to prevent the scrubber eating vital white-space. */
132 #ifdef LEX_AT
133 const char extra_symbol_chars[] = "*%-(@";
134 #else
135 const char extra_symbol_chars[] = "*%-(";
136 #endif
137
138 /* This array holds the chars that always start a comment. If the
139 pre-processor is disabled, these aren't very useful */
140 #if defined (TE_I386AIX) || ((defined (OBJ_ELF) || defined (OBJ_MAYBE_ELF)) && ! defined (TE_LINUX))
141 /* Putting '/' here makes it impossible to use the divide operator.
142 However, we need it for compatibility with SVR4 systems. */
143 const char comment_chars[] = "#/";
144 #define PREFIX_SEPARATOR '\\'
145 #else
146 const char comment_chars[] = "#";
147 #define PREFIX_SEPARATOR '/'
148 #endif
149
150 /* This array holds the chars that only start a comment at the beginning of
151 a line. If the line seems to have the form '# 123 filename'
152 .line and .file directives will appear in the pre-processed output */
153 /* Note that input_file.c hand checks for '#' at the beginning of the
154 first line of the input file. This is because the compiler outputs
155 #NO_APP at the beginning of its output. */
156 /* Also note that comments started like this one will always work if
157 '/' isn't otherwise defined. */
158 #if defined (TE_I386AIX) || ((defined (OBJ_ELF) || defined (OBJ_MAYBE_ELF)) && ! defined (TE_LINUX))
159 const char line_comment_chars[] = "";
160 #else
161 const char line_comment_chars[] = "/";
162 #endif
163
164 const char line_separator_chars[] = "";
165
166 /* Chars that can be used to separate mant from exp in floating point nums */
167 const char EXP_CHARS[] = "eE";
168
169 /* Chars that mean this number is a floating point constant */
170 /* As in 0f12.456 */
171 /* or 0d1.2345e12 */
172 const char FLT_CHARS[] = "fFdDxX";
173
174 /* tables for lexical analysis */
175 static char opcode_chars[256];
176 static char register_chars[256];
177 static char operand_chars[256];
178 static char identifier_chars[256];
179 static char digit_chars[256];
180
181 /* lexical macros */
182 #define is_opcode_char(x) (opcode_chars[(unsigned char) x])
183 #define is_operand_char(x) (operand_chars[(unsigned char) x])
184 #define is_register_char(x) (register_chars[(unsigned char) x])
185 #define is_space_char(x) ((x) == ' ')
186 #define is_identifier_char(x) (identifier_chars[(unsigned char) x])
187 #define is_digit_char(x) (digit_chars[(unsigned char) x])
188
189 /* put here all non-digit non-letter charcters that may occur in an operand */
190 static char operand_special_chars[] = "%$-+(,)*._~/<>|&^!:[@]";
191
192 /* md_assemble() always leaves the strings it's passed unaltered. To
193 effect this we maintain a stack of saved characters that we've smashed
194 with '\0's (indicating end of strings for various sub-fields of the
195 assembler instruction). */
196 static char save_stack[32];
197 static char *save_stack_p; /* stack pointer */
198 #define END_STRING_AND_SAVE(s) \
199 do { *save_stack_p++ = *(s); *(s) = '\0'; } while (0)
200 #define RESTORE_END_STRING(s) \
201 do { *(s) = *--save_stack_p; } while (0)
202
203 /* The instruction we're assembling. */
204 static i386_insn i;
205
206 /* Possible templates for current insn. */
207 static const templates *current_templates;
208
209 /* Per instruction expressionS buffers: 2 displacements & 2 immediate max. */
210 static expressionS disp_expressions[2], im_expressions[2];
211
212 static int this_operand; /* current operand we are working on */
213
214 static int flag_do_long_jump; /* FIXME what does this do? */
215
216 static int flag_16bit_code; /* 1 if we're writing 16-bit code, 0 if 32-bit */
217
218 /* Interface to relax_segment.
219 There are 2 relax states for 386 jump insns: one for conditional &
220 one for unconditional jumps. This is because the these two types
221 of jumps add different sizes to frags when we're figuring out what
222 sort of jump to choose to reach a given label. */
223
224 /* types */
225 #define COND_JUMP 1 /* conditional jump */
226 #define UNCOND_JUMP 2 /* unconditional jump */
227 /* sizes */
228 #define CODE16 1
229 #define SMALL 0
230 #define SMALL16 (SMALL|CODE16)
231 #define BIG 2
232 #define BIG16 (BIG|CODE16)
233
234 #ifndef INLINE
235 #ifdef __GNUC__
236 #define INLINE __inline__
237 #else
238 #define INLINE
239 #endif
240 #endif
241
242 #define ENCODE_RELAX_STATE(type,size) \
243 ((relax_substateT)((type<<2) | (size)))
244 #define SIZE_FROM_RELAX_STATE(s) \
245 ( (((s) & 0x3) == BIG ? 4 : (((s) & 0x3) == BIG16 ? 2 : 1)) )
246
247 /* This table is used by relax_frag to promote short jumps to long
248 ones where necessary. SMALL (short) jumps may be promoted to BIG
249 (32 bit long) ones, and SMALL16 jumps to BIG16 (16 bit long). We
250 don't allow a short jump in a 32 bit code segment to be promoted to
251 a 16 bit offset jump because it's slower (requires data size
252 prefix), and doesn't work, unless the destination is in the bottom
253 64k of the code segment (The top 16 bits of eip are zeroed). */
254
255 const relax_typeS md_relax_table[] =
256 {
257 /* The fields are:
258 1) most positive reach of this state,
259 2) most negative reach of this state,
260 3) how many bytes this mode will add to the size of the current frag
261 4) which index into the table to try if we can't fit into this one.
262 */
263 {1, 1, 0, 0},
264 {1, 1, 0, 0},
265 {1, 1, 0, 0},
266 {1, 1, 0, 0},
267
268 {127 + 1, -128 + 1, 0, ENCODE_RELAX_STATE (COND_JUMP, BIG)},
269 {127 + 1, -128 + 1, 0, ENCODE_RELAX_STATE (COND_JUMP, BIG16)},
270 /* dword conditionals adds 4 bytes to frag:
271 1 extra opcode byte, 3 extra displacement bytes. */
272 {0, 0, 4, 0},
273 /* word conditionals add 2 bytes to frag:
274 1 extra opcode byte, 1 extra displacement byte. */
275 {0, 0, 2, 0},
276
277 {127 + 1, -128 + 1, 0, ENCODE_RELAX_STATE (UNCOND_JUMP, BIG)},
278 {127 + 1, -128 + 1, 0, ENCODE_RELAX_STATE (UNCOND_JUMP, BIG16)},
279 /* dword jmp adds 3 bytes to frag:
280 0 extra opcode bytes, 3 extra displacement bytes. */
281 {0, 0, 3, 0},
282 /* word jmp adds 1 byte to frag:
283 0 extra opcode bytes, 1 extra displacement byte. */
284 {0, 0, 1, 0}
285
286 };
287
288
289 void
290 i386_align_code (fragP, count)
291 fragS *fragP;
292 int count;
293 {
294 /* Various efficient no-op patterns for aligning code labels. */
295 /* Note: Don't try to assemble the instructions in the comments. */
296 /* 0L and 0w are not legal */
297 static const char f32_1[] =
298 {0x90}; /* nop */
299 static const char f32_2[] =
300 {0x89,0xf6}; /* movl %esi,%esi */
301 static const char f32_3[] =
302 {0x8d,0x76,0x00}; /* leal 0(%esi),%esi */
303 static const char f32_4[] =
304 {0x8d,0x74,0x26,0x00}; /* leal 0(%esi,1),%esi */
305 static const char f32_5[] =
306 {0x90, /* nop */
307 0x8d,0x74,0x26,0x00}; /* leal 0(%esi,1),%esi */
308 static const char f32_6[] =
309 {0x8d,0xb6,0x00,0x00,0x00,0x00}; /* leal 0L(%esi),%esi */
310 static const char f32_7[] =
311 {0x8d,0xb4,0x26,0x00,0x00,0x00,0x00}; /* leal 0L(%esi,1),%esi */
312 static const char f32_8[] =
313 {0x90, /* nop */
314 0x8d,0xb4,0x26,0x00,0x00,0x00,0x00}; /* leal 0L(%esi,1),%esi */
315 static const char f32_9[] =
316 {0x89,0xf6, /* movl %esi,%esi */
317 0x8d,0xbc,0x27,0x00,0x00,0x00,0x00}; /* leal 0L(%edi,1),%edi */
318 static const char f32_10[] =
319 {0x8d,0x76,0x00, /* leal 0(%esi),%esi */
320 0x8d,0xbc,0x27,0x00,0x00,0x00,0x00}; /* leal 0L(%edi,1),%edi */
321 static const char f32_11[] =
322 {0x8d,0x74,0x26,0x00, /* leal 0(%esi,1),%esi */
323 0x8d,0xbc,0x27,0x00,0x00,0x00,0x00}; /* leal 0L(%edi,1),%edi */
324 static const char f32_12[] =
325 {0x8d,0xb6,0x00,0x00,0x00,0x00, /* leal 0L(%esi),%esi */
326 0x8d,0xbf,0x00,0x00,0x00,0x00}; /* leal 0L(%edi),%edi */
327 static const char f32_13[] =
328 {0x8d,0xb6,0x00,0x00,0x00,0x00, /* leal 0L(%esi),%esi */
329 0x8d,0xbc,0x27,0x00,0x00,0x00,0x00}; /* leal 0L(%edi,1),%edi */
330 static const char f32_14[] =
331 {0x8d,0xb4,0x26,0x00,0x00,0x00,0x00, /* leal 0L(%esi,1),%esi */
332 0x8d,0xbc,0x27,0x00,0x00,0x00,0x00}; /* leal 0L(%edi,1),%edi */
333 static const char f32_15[] =
334 {0xeb,0x0d,0x90,0x90,0x90,0x90,0x90, /* jmp .+15; lotsa nops */
335 0x90,0x90,0x90,0x90,0x90,0x90,0x90,0x90};
336 static const char f16_4[] =
337 {0x8d,0xb4,0x00,0x00}; /* lea 0w(%si),%si */
338 static const char f16_5[] =
339 {0x90, /* nop */
340 0x8d,0xb4,0x00,0x00}; /* lea 0w(%si),%si */
341 static const char f16_6[] =
342 {0x89,0xf6, /* mov %si,%si */
343 0x8d,0xbd,0x00,0x00}; /* lea 0w(%di),%di */
344 static const char f16_7[] =
345 {0x8d,0x74,0x00, /* lea 0(%si),%si */
346 0x8d,0xbd,0x00,0x00}; /* lea 0w(%di),%di */
347 static const char f16_8[] =
348 {0x8d,0xb4,0x00,0x00, /* lea 0w(%si),%si */
349 0x8d,0xbd,0x00,0x00}; /* lea 0w(%di),%di */
350 static const char *const f32_patt[] = {
351 f32_1, f32_2, f32_3, f32_4, f32_5, f32_6, f32_7, f32_8,
352 f32_9, f32_10, f32_11, f32_12, f32_13, f32_14, f32_15
353 };
354 static const char *const f16_patt[] = {
355 f32_1, f32_2, f32_3, f16_4, f16_5, f16_6, f16_7, f16_8,
356 f32_15, f32_15, f32_15, f32_15, f32_15, f32_15, f32_15
357 };
358
359 if (count > 0 && count <= 15)
360 {
361 if (flag_16bit_code)
362 {
363 memcpy(fragP->fr_literal + fragP->fr_fix,
364 f16_patt[count - 1], count);
365 if (count > 8) /* adjust jump offset */
366 fragP->fr_literal[fragP->fr_fix + 1] = count - 2;
367 }
368 else
369 memcpy(fragP->fr_literal + fragP->fr_fix,
370 f32_patt[count - 1], count);
371 fragP->fr_var = count;
372 }
373 }
374
375 static char *output_invalid PARAMS ((int c));
376 static int i386_operand PARAMS ((char *operand_string));
377 static const reg_entry *parse_register PARAMS ((char *reg_string,
378 char **end_op));
379 #ifndef I386COFF
380 static void s_bss PARAMS ((int));
381 #endif
382
383 symbolS *GOT_symbol; /* Pre-defined "_GLOBAL_OFFSET_TABLE_" */
384
385 static INLINE unsigned long
386 mode_from_disp_size (t)
387 unsigned long t;
388 {
389 return (t & Disp8) ? 1 : (t & (Disp16|Disp32)) ? 2 : 0;
390 }
391
392 static INLINE int
393 fits_in_signed_byte (num)
394 long num;
395 {
396 return (num >= -128) && (num <= 127);
397 } /* fits_in_signed_byte() */
398
399 static INLINE int
400 fits_in_unsigned_byte (num)
401 long num;
402 {
403 return (num & 0xff) == num;
404 } /* fits_in_unsigned_byte() */
405
406 static INLINE int
407 fits_in_unsigned_word (num)
408 long num;
409 {
410 return (num & 0xffff) == num;
411 } /* fits_in_unsigned_word() */
412
413 static INLINE int
414 fits_in_signed_word (num)
415 long num;
416 {
417 return (-32768 <= num) && (num <= 32767);
418 } /* fits_in_signed_word() */
419
420 static int
421 smallest_imm_type (num)
422 long num;
423 {
424 #if 0
425 /* This code is disabled because all the Imm1 forms in the opcode table
426 are slower on the i486, and they're the versions with the implicitly
427 specified single-position displacement, which has another syntax if
428 you really want to use that form. If you really prefer to have the
429 one-byte-shorter Imm1 form despite these problems, re-enable this
430 code. */
431 if (num == 1)
432 return Imm1 | Imm8 | Imm8S | Imm16 | Imm32;
433 #endif
434 return (fits_in_signed_byte (num)
435 ? (Imm8S | Imm8 | Imm16 | Imm32)
436 : fits_in_unsigned_byte (num)
437 ? (Imm8 | Imm16 | Imm32)
438 : (fits_in_signed_word (num) || fits_in_unsigned_word (num))
439 ? (Imm16 | Imm32)
440 : (Imm32));
441 } /* smallest_imm_type() */
442
443 /* Returns 0 if attempting to add a prefix where one from the same
444 class already exists, 1 if non rep/repne added, 2 if rep/repne
445 added. */
446 static int
447 add_prefix (prefix)
448 unsigned int prefix;
449 {
450 int ret = 1;
451 int q;
452
453 switch (prefix)
454 {
455 default:
456 abort ();
457
458 case CS_PREFIX_OPCODE:
459 case DS_PREFIX_OPCODE:
460 case ES_PREFIX_OPCODE:
461 case FS_PREFIX_OPCODE:
462 case GS_PREFIX_OPCODE:
463 case SS_PREFIX_OPCODE:
464 q = SEG_PREFIX;
465 break;
466
467 case REPNE_PREFIX_OPCODE:
468 case REPE_PREFIX_OPCODE:
469 ret = 2;
470 /* fall thru */
471 case LOCK_PREFIX_OPCODE:
472 q = LOCKREP_PREFIX;
473 break;
474
475 case FWAIT_OPCODE:
476 q = WAIT_PREFIX;
477 break;
478
479 case ADDR_PREFIX_OPCODE:
480 q = ADDR_PREFIX;
481 break;
482
483 case DATA_PREFIX_OPCODE:
484 q = DATA_PREFIX;
485 break;
486 }
487
488 if (i.prefix[q])
489 {
490 as_bad (_("same type of prefix used twice"));
491 return 0;
492 }
493
494 i.prefixes += 1;
495 i.prefix[q] = prefix;
496 return ret;
497 }
498
499 static void
500 set_16bit_code_flag (new_16bit_code_flag)
501 int new_16bit_code_flag;
502 {
503 flag_16bit_code = new_16bit_code_flag;
504 }
505
506 const pseudo_typeS md_pseudo_table[] =
507 {
508 #ifndef I386COFF
509 {"bss", s_bss, 0},
510 #endif
511 #if !defined(OBJ_AOUT) && !defined(USE_ALIGN_PTWO)
512 {"align", s_align_bytes, 0},
513 #else
514 {"align", s_align_ptwo, 0},
515 #endif
516 {"ffloat", float_cons, 'f'},
517 {"dfloat", float_cons, 'd'},
518 {"tfloat", float_cons, 'x'},
519 {"value", cons, 2},
520 {"noopt", s_ignore, 0},
521 {"optim", s_ignore, 0},
522 {"code16", set_16bit_code_flag, 1},
523 {"code32", set_16bit_code_flag, 0},
524 {0, 0, 0}
525 };
526
527 /* for interface with expression () */
528 extern char *input_line_pointer;
529
530 /* hash table for opcode lookup */
531 static struct hash_control *op_hash;
532 /* hash table for register lookup */
533 static struct hash_control *reg_hash;
534 \f
535
536 void
537 md_begin ()
538 {
539 const char *hash_err;
540
541 /* initialize op_hash hash table */
542 op_hash = hash_new ();
543
544 {
545 register const template *optab;
546 register templates *core_optab;
547
548 optab = i386_optab; /* setup for loop */
549 core_optab = (templates *) xmalloc (sizeof (templates));
550 core_optab->start = optab;
551
552 while (1)
553 {
554 ++optab;
555 if (optab->name == NULL
556 || strcmp (optab->name, (optab - 1)->name) != 0)
557 {
558 /* different name --> ship out current template list;
559 add to hash table; & begin anew */
560 core_optab->end = optab;
561 hash_err = hash_insert (op_hash,
562 (optab - 1)->name,
563 (PTR) core_optab);
564 if (hash_err)
565 {
566 hash_error:
567 as_fatal (_("Internal Error: Can't hash %s: %s"),
568 (optab - 1)->name,
569 hash_err);
570 }
571 if (optab->name == NULL)
572 break;
573 core_optab = (templates *) xmalloc (sizeof (templates));
574 core_optab->start = optab;
575 }
576 }
577 }
578
579 /* initialize reg_hash hash table */
580 reg_hash = hash_new ();
581 {
582 register const reg_entry *regtab;
583
584 for (regtab = i386_regtab;
585 regtab < i386_regtab + sizeof (i386_regtab) / sizeof (i386_regtab[0]);
586 regtab++)
587 {
588 hash_err = hash_insert (reg_hash, regtab->reg_name, (PTR) regtab);
589 if (hash_err)
590 goto hash_error;
591 }
592 }
593
594 /* fill in lexical tables: opcode_chars, operand_chars. */
595 {
596 register int c;
597 register char *p;
598
599 for (c = 0; c < 256; c++)
600 {
601 if (isdigit (c))
602 {
603 digit_chars[c] = c;
604 opcode_chars[c] = c;
605 register_chars[c] = c;
606 operand_chars[c] = c;
607 }
608 else if (islower (c))
609 {
610 opcode_chars[c] = c;
611 register_chars[c] = c;
612 operand_chars[c] = c;
613 }
614 else if (isupper (c))
615 {
616 opcode_chars[c] = tolower (c);
617 register_chars[c] = opcode_chars[c];
618 operand_chars[c] = c;
619 }
620
621 if (isalpha (c) || isdigit (c))
622 identifier_chars[c] = c;
623 }
624
625 #ifdef LEX_AT
626 identifier_chars['@'] = '@';
627 #endif
628 register_chars[')'] = ')';
629 register_chars['('] = '(';
630 digit_chars['-'] = '-';
631 identifier_chars['_'] = '_';
632 identifier_chars['.'] = '.';
633
634 for (p = operand_special_chars; *p != '\0'; p++)
635 operand_chars[(unsigned char) *p] = *p;
636 }
637
638 #if defined (OBJ_ELF) || defined (OBJ_MAYBE_ELF)
639 if (OUTPUT_FLAVOR == bfd_target_elf_flavour)
640 {
641 record_alignment (text_section, 2);
642 record_alignment (data_section, 2);
643 record_alignment (bss_section, 2);
644 }
645 #endif
646 }
647
648 void
649 i386_print_statistics (file)
650 FILE *file;
651 {
652 hash_print_statistics (file, "i386 opcode", op_hash);
653 hash_print_statistics (file, "i386 register", reg_hash);
654 }
655 \f
656
657 #ifdef DEBUG386
658
659 /* debugging routines for md_assemble */
660 static void pi PARAMS ((char *, i386_insn *));
661 static void pte PARAMS ((template *));
662 static void pt PARAMS ((unsigned int));
663 static void pe PARAMS ((expressionS *));
664 static void ps PARAMS ((symbolS *));
665
666 static void
667 pi (line, x)
668 char *line;
669 i386_insn *x;
670 {
671 register template *p;
672 int i;
673
674 fprintf (stdout, "%s: template ", line);
675 pte (&x->tm);
676 fprintf (stdout, " modrm: mode %x reg %x reg/mem %x",
677 x->rm.mode, x->rm.reg, x->rm.regmem);
678 fprintf (stdout, " base %x index %x scale %x\n",
679 x->bi.base, x->bi.index, x->bi.scale);
680 for (i = 0; i < x->operands; i++)
681 {
682 fprintf (stdout, " #%d: ", i + 1);
683 pt (x->types[i]);
684 fprintf (stdout, "\n");
685 if (x->types[i]
686 & (Reg | SReg2 | SReg3 | Control | Debug | Test | RegMMX))
687 fprintf (stdout, "%s\n", x->regs[i]->reg_name);
688 if (x->types[i] & Imm)
689 pe (x->imms[i]);
690 if (x->types[i] & Disp)
691 pe (x->disps[i]);
692 }
693 }
694
695 static void
696 pte (t)
697 template *t;
698 {
699 int i;
700 fprintf (stdout, " %d operands ", t->operands);
701 fprintf (stdout, "opcode %x ",
702 t->base_opcode);
703 if (t->extension_opcode != None)
704 fprintf (stdout, "ext %x ", t->extension_opcode);
705 if (t->opcode_modifier & D)
706 fprintf (stdout, "D");
707 if (t->opcode_modifier & W)
708 fprintf (stdout, "W");
709 fprintf (stdout, "\n");
710 for (i = 0; i < t->operands; i++)
711 {
712 fprintf (stdout, " #%d type ", i + 1);
713 pt (t->operand_types[i]);
714 fprintf (stdout, "\n");
715 }
716 }
717
718 static void
719 pe (e)
720 expressionS *e;
721 {
722 fprintf (stdout, " operation %d\n", e->X_op);
723 fprintf (stdout, " add_number %d (%x)\n",
724 e->X_add_number, e->X_add_number);
725 if (e->X_add_symbol)
726 {
727 fprintf (stdout, " add_symbol ");
728 ps (e->X_add_symbol);
729 fprintf (stdout, "\n");
730 }
731 if (e->X_op_symbol)
732 {
733 fprintf (stdout, " op_symbol ");
734 ps (e->X_op_symbol);
735 fprintf (stdout, "\n");
736 }
737 }
738
739 static void
740 ps (s)
741 symbolS *s;
742 {
743 fprintf (stdout, "%s type %s%s",
744 S_GET_NAME (s),
745 S_IS_EXTERNAL (s) ? "EXTERNAL " : "",
746 segment_name (S_GET_SEGMENT (s)));
747 }
748
749 struct type_name
750 {
751 unsigned int mask;
752 char *tname;
753 }
754
755 type_names[] =
756 {
757 { Reg8, "r8" },
758 { Reg16, "r16" },
759 { Reg32, "r32" },
760 { Imm8, "i8" },
761 { Imm8S, "i8s" },
762 { Imm16, "i16" },
763 { Imm32, "i32" },
764 { Imm1, "i1" },
765 { BaseIndex, "BaseIndex" },
766 { Disp8, "d8" },
767 { Disp16, "d16" },
768 { Disp32, "d32" },
769 { InOutPortReg, "InOutPortReg" },
770 { ShiftCount, "ShiftCount" },
771 { Control, "control reg" },
772 { Test, "test reg" },
773 { Debug, "debug reg" },
774 { FloatReg, "FReg" },
775 { FloatAcc, "FAcc" },
776 { SReg2, "SReg2" },
777 { SReg3, "SReg3" },
778 { Acc, "Acc" },
779 { JumpAbsolute, "Jump Absolute" },
780 { RegMMX, "rMMX" },
781 { EsSeg, "es" },
782 { 0, "" }
783 };
784
785 static void
786 pt (t)
787 unsigned int t;
788 {
789 register struct type_name *ty;
790
791 if (t == Unknown)
792 {
793 fprintf (stdout, _("Unknown"));
794 }
795 else
796 {
797 for (ty = type_names; ty->mask; ty++)
798 if (t & ty->mask)
799 fprintf (stdout, "%s, ", ty->tname);
800 }
801 fflush (stdout);
802 }
803
804 #endif /* DEBUG386 */
805 \f
806 #ifdef BFD_ASSEMBLER
807 static bfd_reloc_code_real_type
808 reloc (size, pcrel, other)
809 int size;
810 int pcrel;
811 bfd_reloc_code_real_type other;
812 {
813 if (other != NO_RELOC) return other;
814
815 if (pcrel)
816 {
817 switch (size)
818 {
819 case 1: return BFD_RELOC_8_PCREL;
820 case 2: return BFD_RELOC_16_PCREL;
821 case 4: return BFD_RELOC_32_PCREL;
822 }
823 as_bad (_("Can not do %d byte pc-relative relocation"), size);
824 }
825 else
826 {
827 switch (size)
828 {
829 case 1: return BFD_RELOC_8;
830 case 2: return BFD_RELOC_16;
831 case 4: return BFD_RELOC_32;
832 }
833 as_bad (_("Can not do %d byte relocation"), size);
834 }
835
836 return BFD_RELOC_NONE;
837 }
838
839 /*
840 * Here we decide which fixups can be adjusted to make them relative to
841 * the beginning of the section instead of the symbol. Basically we need
842 * to make sure that the dynamic relocations are done correctly, so in
843 * some cases we force the original symbol to be used.
844 */
845 int
846 tc_i386_fix_adjustable(fixP)
847 fixS * fixP;
848 {
849 #ifdef OBJ_ELF
850 /* Prevent all adjustments to global symbols. */
851 if (S_IS_EXTERN (fixP->fx_addsy))
852 return 0;
853 if (S_IS_WEAK (fixP->fx_addsy))
854 return 0;
855 #endif /* ! defined (OBJ_AOUT) */
856 /* adjust_reloc_syms doesn't know about the GOT */
857 if (fixP->fx_r_type == BFD_RELOC_386_GOTOFF
858 || fixP->fx_r_type == BFD_RELOC_386_PLT32
859 || fixP->fx_r_type == BFD_RELOC_386_GOT32)
860 return 0;
861 return 1;
862 }
863 #else
864 #define reloc(SIZE,PCREL,OTHER) 0
865 #define BFD_RELOC_16 0
866 #define BFD_RELOC_32 0
867 #define BFD_RELOC_16_PCREL 0
868 #define BFD_RELOC_32_PCREL 0
869 #define BFD_RELOC_386_PLT32 0
870 #define BFD_RELOC_386_GOT32 0
871 #define BFD_RELOC_386_GOTOFF 0
872 #endif
873
874 /* This is the guts of the machine-dependent assembler. LINE points to a
875 machine dependent instruction. This function is supposed to emit
876 the frags/bytes it assembles to. */
877
878 void
879 md_assemble (line)
880 char *line;
881 {
882 /* Points to template once we've found it. */
883 const template *t;
884
885 /* Count the size of the instruction generated. */
886 int insn_size = 0;
887
888 int j;
889
890 /* Initialize globals. */
891 memset (&i, '\0', sizeof (i));
892 for (j = 0; j < MAX_OPERANDS; j++)
893 i.disp_reloc[j] = NO_RELOC;
894 memset (disp_expressions, '\0', sizeof (disp_expressions));
895 memset (im_expressions, '\0', sizeof (im_expressions));
896 save_stack_p = save_stack; /* reset stack pointer */
897
898 /* First parse an opcode & call i386_operand for the operands.
899 We assume that the scrubber has arranged it so that line[0] is the valid
900 start of a (possibly prefixed) opcode. */
901 {
902 char opcode[MAX_OPCODE_SIZE];
903 char *l = line;
904 char *token_start = l;
905 char *opp;
906
907 /* Non-zero if we found a prefix only acceptable with string insns. */
908 const char *expecting_string_instruction = NULL;
909
910 while (1)
911 {
912 opp = opcode;
913 while ((*opp = opcode_chars[(unsigned char) *l]) != 0)
914 {
915 opp++;
916 if (opp >= opcode + sizeof (opcode))
917 {
918 as_bad (_("no such 386 instruction: `%s'"), token_start);
919 return;
920 }
921 l++;
922 }
923 if (!is_space_char (*l)
924 && *l != END_OF_INSN
925 && *l != PREFIX_SEPARATOR)
926 {
927 as_bad (_("invalid character %s in opcode"),
928 output_invalid (*l));
929 return;
930 }
931 if (token_start == l)
932 {
933 if (*l == PREFIX_SEPARATOR)
934 as_bad (_("expecting prefix; got nothing"));
935 else
936 as_bad (_("expecting opcode; got nothing"));
937 return;
938 }
939
940 /* Look up instruction (or prefix) via hash table. */
941 current_templates = hash_find (op_hash, opcode);
942
943 if (*l != END_OF_INSN
944 && current_templates
945 && (current_templates->start->opcode_modifier & IsPrefix))
946 {
947 /* If we are in 16-bit mode, do not allow addr16 or data16.
948 Similarly, in 32-bit mode, do not allow addr32 or data32. */
949 if ((current_templates->start->opcode_modifier & (Size16 | Size32))
950 && (((current_templates->start->opcode_modifier & Size32) != 0)
951 ^ flag_16bit_code))
952 {
953 as_bad (_("redundant %s prefix"),
954 current_templates->start->name);
955 return;
956 }
957 /* Add prefix, checking for repeated prefixes. */
958 switch (add_prefix (current_templates->start->base_opcode))
959 {
960 case 0:
961 return;
962 case 2:
963 expecting_string_instruction =
964 current_templates->start->name;
965 break;
966 }
967 /* Skip past PREFIX_SEPARATOR and reset token_start. */
968 token_start = ++l;
969 }
970 else
971 break;
972 }
973
974 if (!current_templates)
975 {
976 /* See if we can get a match by trimming off a suffix. */
977 switch (opp[-1])
978 {
979 case DWORD_OPCODE_SUFFIX:
980 case WORD_OPCODE_SUFFIX:
981 case BYTE_OPCODE_SUFFIX:
982 case SHORT_OPCODE_SUFFIX:
983 #if LONG_OPCODE_SUFFIX != DWORD_OPCODE_SUFFIX
984 case LONG_OPCODE_SUFFIX:
985 #endif
986 i.suffix = opp[-1];
987 opp[-1] = '\0';
988 current_templates = hash_find (op_hash, opcode);
989 }
990 if (!current_templates)
991 {
992 as_bad (_("no such 386 instruction: `%s'"), token_start);
993 return;
994 }
995 }
996
997 /* check for rep/repne without a string instruction */
998 if (expecting_string_instruction
999 && !(current_templates->start->opcode_modifier & IsString))
1000 {
1001 as_bad (_("expecting string instruction after `%s'"),
1002 expecting_string_instruction);
1003 return;
1004 }
1005
1006 /* There may be operands to parse. */
1007 if (*l != END_OF_INSN)
1008 {
1009 /* parse operands */
1010
1011 /* 1 if operand is pending after ','. */
1012 unsigned int expecting_operand = 0;
1013
1014 /* Non-zero if operand parens not balanced. */
1015 unsigned int paren_not_balanced;
1016
1017 do
1018 {
1019 /* skip optional white space before operand */
1020 if (is_space_char (*l))
1021 ++l;
1022 if (!is_operand_char (*l) && *l != END_OF_INSN)
1023 {
1024 as_bad (_("invalid character %s before operand %d"),
1025 output_invalid (*l),
1026 i.operands + 1);
1027 return;
1028 }
1029 token_start = l; /* after white space */
1030 paren_not_balanced = 0;
1031 while (paren_not_balanced || *l != ',')
1032 {
1033 if (*l == END_OF_INSN)
1034 {
1035 if (paren_not_balanced)
1036 {
1037 as_bad (_("unbalanced parenthesis in operand %d."),
1038 i.operands + 1);
1039 return;
1040 }
1041 else
1042 break; /* we are done */
1043 }
1044 else if (!is_operand_char (*l) && !is_space_char (*l))
1045 {
1046 as_bad (_("invalid character %s in operand %d"),
1047 output_invalid (*l),
1048 i.operands + 1);
1049 return;
1050 }
1051 if (*l == '(')
1052 ++paren_not_balanced;
1053 if (*l == ')')
1054 --paren_not_balanced;
1055 l++;
1056 }
1057 if (l != token_start)
1058 { /* yes, we've read in another operand */
1059 unsigned int operand_ok;
1060 this_operand = i.operands++;
1061 if (i.operands > MAX_OPERANDS)
1062 {
1063 as_bad (_("spurious operands; (%d operands/instruction max)"),
1064 MAX_OPERANDS);
1065 return;
1066 }
1067 /* now parse operand adding info to 'i' as we go along */
1068 END_STRING_AND_SAVE (l);
1069 operand_ok = i386_operand (token_start);
1070 RESTORE_END_STRING (l); /* restore old contents */
1071 if (!operand_ok)
1072 return;
1073 }
1074 else
1075 {
1076 if (expecting_operand)
1077 {
1078 expecting_operand_after_comma:
1079 as_bad (_("expecting operand after ','; got nothing"));
1080 return;
1081 }
1082 if (*l == ',')
1083 {
1084 as_bad (_("expecting operand before ','; got nothing"));
1085 return;
1086 }
1087 }
1088
1089 /* now *l must be either ',' or END_OF_INSN */
1090 if (*l == ',')
1091 {
1092 if (*++l == END_OF_INSN)
1093 { /* just skip it, if it's \n complain */
1094 goto expecting_operand_after_comma;
1095 }
1096 expecting_operand = 1;
1097 }
1098 }
1099 while (*l != END_OF_INSN); /* until we get end of insn */
1100 }
1101 }
1102
1103 /* Now we've parsed the opcode into a set of templates, and have the
1104 operands at hand.
1105
1106 Next, we find a template that matches the given insn,
1107 making sure the overlap of the given operands types is consistent
1108 with the template operand types. */
1109
1110 #define MATCH(overlap, given, template) \
1111 ((overlap) \
1112 && ((given) & BaseIndex) == ((overlap) & BaseIndex) \
1113 && ((given) & JumpAbsolute) == ((template) & JumpAbsolute))
1114
1115 /* If given types r0 and r1 are registers they must be of the same type
1116 unless the expected operand type register overlap is null.
1117 Note that Acc in a template matches every size of reg. */
1118 #define CONSISTENT_REGISTER_MATCH(m0, g0, t0, m1, g1, t1) \
1119 ( ((g0) & Reg) == 0 || ((g1) & Reg) == 0 || \
1120 ((g0) & Reg) == ((g1) & Reg) || \
1121 ((((m0) & Acc) ? Reg : (t0)) & (((m1) & Acc) ? Reg : (t1)) & Reg) == 0 )
1122
1123 {
1124 register unsigned int overlap0, overlap1;
1125 expressionS *exp;
1126 unsigned int overlap2;
1127 unsigned int found_reverse_match;
1128 int suffix_check;
1129
1130 overlap0 = 0;
1131 overlap1 = 0;
1132 overlap2 = 0;
1133 found_reverse_match = 0;
1134 suffix_check = (i.suffix == BYTE_OPCODE_SUFFIX
1135 ? No_bSuf
1136 : (i.suffix == WORD_OPCODE_SUFFIX
1137 ? No_wSuf
1138 : (i.suffix == SHORT_OPCODE_SUFFIX
1139 ? No_sSuf
1140 : (i.suffix == LONG_OPCODE_SUFFIX ? No_lSuf : 0))));
1141
1142 for (t = current_templates->start;
1143 t < current_templates->end;
1144 t++)
1145 {
1146 /* Must have right number of operands, and must not have
1147 disallowed suffix. */
1148 if (i.operands != t->operands || (t->opcode_modifier & suffix_check))
1149 continue;
1150 else if (!t->operands)
1151 break; /* 0 operands always matches */
1152
1153 overlap0 = i.types[0] & t->operand_types[0];
1154 switch (t->operands)
1155 {
1156 case 1:
1157 if (!MATCH (overlap0, i.types[0], t->operand_types[0]))
1158 continue;
1159 break;
1160 case 2:
1161 case 3:
1162 overlap1 = i.types[1] & t->operand_types[1];
1163 if (!MATCH (overlap0, i.types[0], t->operand_types[0])
1164 || !MATCH (overlap1, i.types[1], t->operand_types[1])
1165 || !CONSISTENT_REGISTER_MATCH (overlap0, i.types[0],
1166 t->operand_types[0],
1167 overlap1, i.types[1],
1168 t->operand_types[1]))
1169 {
1170
1171 /* check if other direction is valid ... */
1172 if ((t->opcode_modifier & (D|FloatD)) == 0)
1173 continue;
1174
1175 /* try reversing direction of operands */
1176 overlap0 = i.types[0] & t->operand_types[1];
1177 overlap1 = i.types[1] & t->operand_types[0];
1178 if (!MATCH (overlap0, i.types[0], t->operand_types[1])
1179 || !MATCH (overlap1, i.types[1], t->operand_types[0])
1180 || !CONSISTENT_REGISTER_MATCH (overlap0, i.types[0],
1181 t->operand_types[1],
1182 overlap1, i.types[1],
1183 t->operand_types[0]))
1184 {
1185 /* does not match either direction */
1186 continue;
1187 }
1188 /* found_reverse_match holds which of D or FloatDR
1189 we've found. */
1190 found_reverse_match = t->opcode_modifier & (D|FloatDR);
1191 break;
1192 }
1193 /* found a forward 2 operand match here */
1194 if (t->operands == 3)
1195 {
1196 /* Here we make use of the fact that there are no
1197 reverse match 3 operand instructions, and all 3
1198 operand instructions only need to be checked for
1199 register consistency between operands 2 and 3. */
1200 overlap2 = i.types[2] & t->operand_types[2];
1201 if (!MATCH (overlap2, i.types[2], t->operand_types[2])
1202 || !CONSISTENT_REGISTER_MATCH (overlap1, i.types[1],
1203 t->operand_types[1],
1204 overlap2, i.types[2],
1205 t->operand_types[2]))
1206 continue;
1207 }
1208 /* found either forward/reverse 2 or 3 operand match here:
1209 slip through to break */
1210 }
1211 break; /* we've found a match; break out of loop */
1212 } /* for (t = ... */
1213 if (t == current_templates->end)
1214 { /* we found no match */
1215 as_bad (_("suffix or operands invalid for `%s'"),
1216 current_templates->start->name);
1217 return;
1218 }
1219
1220 /* Copy the template we found. */
1221 i.tm = *t;
1222 if (found_reverse_match)
1223 {
1224 i.tm.operand_types[0] = t->operand_types[1];
1225 i.tm.operand_types[1] = t->operand_types[0];
1226 }
1227
1228 if (i.tm.opcode_modifier & FWait)
1229 if (! add_prefix (FWAIT_OPCODE))
1230 return;
1231
1232 /* Check string instruction segment overrides */
1233 if ((i.tm.opcode_modifier & IsString) != 0 && i.mem_operands != 0)
1234 {
1235 int mem_op = (i.types[0] & AnyMem) ? 0 : 1;
1236 if ((i.tm.operand_types[mem_op] & EsSeg) != 0)
1237 {
1238 if (i.seg[0] != NULL && i.seg[0] != &es)
1239 {
1240 as_bad (_("`%s' operand %d must use `%%es' segment"),
1241 i.tm.name,
1242 mem_op + 1);
1243 return;
1244 }
1245 /* There's only ever one segment override allowed per instruction.
1246 This instruction possibly has a legal segment override on the
1247 second operand, so copy the segment to where non-string
1248 instructions store it, allowing common code. */
1249 i.seg[0] = i.seg[1];
1250 }
1251 else if ((i.tm.operand_types[mem_op + 1] & EsSeg) != 0)
1252 {
1253 if (i.seg[1] != NULL && i.seg[1] != &es)
1254 {
1255 as_bad (_("`%s' operand %d must use `%%es' segment"),
1256 i.tm.name,
1257 mem_op + 2);
1258 return;
1259 }
1260 }
1261 }
1262
1263 /* If matched instruction specifies an explicit opcode suffix, use
1264 it. */
1265 if (i.tm.opcode_modifier & (Size16 | Size32))
1266 {
1267 if (i.tm.opcode_modifier & Size16)
1268 i.suffix = WORD_OPCODE_SUFFIX;
1269 else
1270 i.suffix = DWORD_OPCODE_SUFFIX;
1271 }
1272 else if (i.reg_operands)
1273 {
1274 /* If there's no opcode suffix we try to invent one based on
1275 register operands. */
1276 if (!i.suffix)
1277 {
1278 /* We take i.suffix from the last register operand specified,
1279 Destination register type is more significant than source
1280 register type. */
1281 int op;
1282 for (op = i.operands; --op >= 0; )
1283 if (i.types[op] & Reg)
1284 {
1285 i.suffix = ((i.types[op] & Reg8) ? BYTE_OPCODE_SUFFIX :
1286 (i.types[op] & Reg16) ? WORD_OPCODE_SUFFIX :
1287 DWORD_OPCODE_SUFFIX);
1288 break;
1289 }
1290 }
1291 else if (i.suffix == BYTE_OPCODE_SUFFIX)
1292 {
1293 int op;
1294 for (op = i.operands; --op >= 0; )
1295 {
1296 /* If this is an eight bit register, it's OK. If it's
1297 the 16 or 32 bit version of an eight bit register,
1298 we will just use the low portion, and that's OK too. */
1299 if (i.types[op] & Reg8)
1300 continue;
1301 if ((i.types[op] & WordReg) && i.regs[op]->reg_num < 4
1302 #if 0
1303 /* Check that the template allows eight bit regs
1304 This kills insns such as `orb $1,%edx', which
1305 maybe should be allowed. */
1306 && (i.tm.operand_types[op] & (Reg8|InOutPortReg))
1307 #endif
1308 )
1309 {
1310 #if REGISTER_WARNINGS
1311 if ((i.tm.operand_types[op] & InOutPortReg) == 0)
1312 as_warn (_("using `%%%s' instead of `%%%s' due to `%c' suffix"),
1313 (i.regs[op] - (i.types[op] & Reg16 ? 8 : 16))->reg_name,
1314 i.regs[op]->reg_name,
1315 i.suffix);
1316 #endif
1317 continue;
1318 }
1319 /* Any other register is bad */
1320 if (i.types[op] & (Reg | RegMMX | Control | Debug | Test
1321 | FloatReg | FloatAcc | SReg2 | SReg3))
1322 {
1323 as_bad (_("`%%%s' not allowed with `%s%c'"),
1324 i.regs[op]->reg_name,
1325 i.tm.name,
1326 i.suffix);
1327 return;
1328 }
1329 }
1330 }
1331 else if (i.suffix == DWORD_OPCODE_SUFFIX)
1332 {
1333 int op;
1334 for (op = i.operands; --op >= 0; )
1335 /* Reject eight bit registers, except where the template
1336 requires them. (eg. movzb) */
1337 if ((i.types[op] & Reg8) != 0
1338 && (i.tm.operand_types[op] & (Reg16|Reg32|Acc)) != 0)
1339 {
1340 as_bad (_("`%%%s' not allowed with `%s%c'"),
1341 i.regs[op]->reg_name,
1342 i.tm.name,
1343 i.suffix);
1344 return;
1345 }
1346 #if REGISTER_WARNINGS
1347 /* Warn if the e prefix on a general reg is missing. */
1348 else if ((i.types[op] & Reg16) != 0
1349 && (i.tm.operand_types[op] & (Reg32|Acc)) != 0)
1350 {
1351 as_warn (_("using `%%%s' instead of `%%%s' due to `%c' suffix"),
1352 (i.regs[op] + 8)->reg_name,
1353 i.regs[op]->reg_name,
1354 i.suffix);
1355 }
1356 #endif
1357 }
1358 else if (i.suffix == WORD_OPCODE_SUFFIX)
1359 {
1360 int op;
1361 for (op = i.operands; --op >= 0; )
1362 /* Reject eight bit registers, except where the template
1363 requires them. (eg. movzb) */
1364 if ((i.types[op] & Reg8) != 0
1365 && (i.tm.operand_types[op] & (Reg16|Reg32|Acc)) != 0)
1366 {
1367 as_bad (_("`%%%s' not allowed with `%s%c'"),
1368 i.regs[op]->reg_name,
1369 i.tm.name,
1370 i.suffix);
1371 return;
1372 }
1373 #if REGISTER_WARNINGS
1374 /* Warn if the e prefix on a general reg is present. */
1375 else if ((i.types[op] & Reg32) != 0
1376 && (i.tm.operand_types[op] & (Reg16|Acc)) != 0)
1377 {
1378 as_warn (_("using `%%%s' instead of `%%%s' due to `%c' suffix"),
1379 (i.regs[op] - 8)->reg_name,
1380 i.regs[op]->reg_name,
1381 i.suffix);
1382 }
1383 #endif
1384 }
1385 else
1386 abort();
1387 }
1388
1389 /* Make still unresolved immediate matches conform to size of immediate
1390 given in i.suffix. Note: overlap2 cannot be an immediate!
1391 We assume this. */
1392 if ((overlap0 & (Imm8 | Imm8S | Imm16 | Imm32))
1393 && overlap0 != Imm8 && overlap0 != Imm8S
1394 && overlap0 != Imm16 && overlap0 != Imm32)
1395 {
1396 if (i.suffix)
1397 {
1398 overlap0 &= (i.suffix == BYTE_OPCODE_SUFFIX ? (Imm8 | Imm8S) :
1399 (i.suffix == WORD_OPCODE_SUFFIX ? Imm16 : Imm32));
1400 }
1401 else if (overlap0 == (Imm16 | Imm32))
1402 {
1403 overlap0 =
1404 (flag_16bit_code ^ (i.prefix[DATA_PREFIX] != 0)) ? Imm16 : Imm32;
1405 }
1406 else
1407 {
1408 as_bad (_("no opcode suffix given; can't determine immediate size"));
1409 return;
1410 }
1411 }
1412 if ((overlap1 & (Imm8 | Imm8S | Imm16 | Imm32))
1413 && overlap1 != Imm8 && overlap1 != Imm8S
1414 && overlap1 != Imm16 && overlap1 != Imm32)
1415 {
1416 if (i.suffix)
1417 {
1418 overlap1 &= (i.suffix == BYTE_OPCODE_SUFFIX ? (Imm8 | Imm8S) :
1419 (i.suffix == WORD_OPCODE_SUFFIX ? Imm16 : Imm32));
1420 }
1421 else if (overlap1 == (Imm16 | Imm32))
1422 {
1423 overlap1 =
1424 (flag_16bit_code ^ (i.prefix[DATA_PREFIX] != 0)) ? Imm16 : Imm32;
1425 }
1426 else
1427 {
1428 as_bad (_("no opcode suffix given; can't determine immediate size"));
1429 return;
1430 }
1431 }
1432
1433 i.types[0] = overlap0;
1434 if (overlap0 & ImplicitRegister)
1435 i.reg_operands--;
1436 if (overlap0 & Imm1)
1437 i.imm_operands = 0; /* kludge for shift insns */
1438
1439 i.types[1] = overlap1;
1440 if (overlap1 & ImplicitRegister)
1441 i.reg_operands--;
1442
1443 i.types[2] = overlap2;
1444 if (overlap2 & ImplicitRegister)
1445 i.reg_operands--;
1446
1447 /* Finalize opcode. First, we change the opcode based on the operand
1448 size given by i.suffix: we never have to change things for byte insns,
1449 or when no opcode suffix is need to size the operands. */
1450
1451 if (!i.suffix && (i.tm.opcode_modifier & W))
1452 {
1453 as_bad (_("no opcode suffix given and no register operands; can't size instruction"));
1454 return;
1455 }
1456
1457 if (i.suffix && i.suffix != BYTE_OPCODE_SUFFIX)
1458 {
1459 /* Select between byte and word/dword operations. */
1460 if (i.tm.opcode_modifier & W)
1461 {
1462 if (i.tm.opcode_modifier & ShortForm)
1463 i.tm.base_opcode |= 8;
1464 else
1465 i.tm.base_opcode |= 1;
1466 }
1467 /* Now select between word & dword operations via the operand
1468 size prefix, except for instructions that will ignore this
1469 prefix anyway. */
1470 if ((i.suffix == DWORD_OPCODE_SUFFIX
1471 || i.suffix == LONG_OPCODE_SUFFIX) == flag_16bit_code
1472 && !(i.tm.opcode_modifier & IgnoreSize))
1473 {
1474 unsigned int prefix = DATA_PREFIX_OPCODE;
1475 if (i.tm.opcode_modifier & JumpByte) /* jcxz, loop */
1476 prefix = ADDR_PREFIX_OPCODE;
1477
1478 if (! add_prefix (prefix))
1479 return;
1480 }
1481 /* Size floating point instruction. */
1482 if (i.suffix == LONG_OPCODE_SUFFIX)
1483 {
1484 if (i.tm.opcode_modifier & FloatMF)
1485 i.tm.base_opcode ^= 4;
1486 }
1487 }
1488
1489 /* For insns with operands there are more diddles to do to the opcode. */
1490 if (i.operands)
1491 {
1492 /* Default segment register this instruction will use
1493 for memory accesses. 0 means unknown.
1494 This is only for optimizing out unnecessary segment overrides. */
1495 const seg_entry *default_seg = 0;
1496
1497 /* If we found a reverse match we must alter the opcode
1498 direction bit. found_reverse_match holds bits to change
1499 (different for int & float insns). */
1500
1501 i.tm.base_opcode ^= found_reverse_match;
1502
1503 /* The imul $imm, %reg instruction is converted into
1504 imul $imm, %reg, %reg, and the clr %reg instruction
1505 is converted into xor %reg, %reg. */
1506 if (i.tm.opcode_modifier & regKludge)
1507 {
1508 unsigned int first_reg_op = (i.types[0] & Reg) ? 0 : 1;
1509 /* Pretend we saw the extra register operand. */
1510 i.regs[first_reg_op+1] = i.regs[first_reg_op];
1511 i.reg_operands = 2;
1512 }
1513
1514 if (i.tm.opcode_modifier & ShortForm)
1515 {
1516 /* The register or float register operand is in operand 0 or 1. */
1517 unsigned int op = (i.types[0] & (Reg | FloatReg)) ? 0 : 1;
1518 /* Register goes in low 3 bits of opcode. */
1519 i.tm.base_opcode |= i.regs[op]->reg_num;
1520 if ((i.tm.opcode_modifier & Ugh) != 0)
1521 {
1522 /* Warn about some common errors, but press on regardless.
1523 The first case can be generated by gcc (<= 2.8.1). */
1524 if (i.operands == 2)
1525 {
1526 /* reversed arguments on faddp, fsubp, etc. */
1527 as_warn (_("translating to `%s %%%s,%%%s'"), i.tm.name,
1528 i.regs[1]->reg_name,
1529 i.regs[0]->reg_name);
1530 }
1531 else
1532 {
1533 /* extraneous `l' suffix on fp insn */
1534 as_warn (_("translating to `%s %%%s'"), i.tm.name,
1535 i.regs[0]->reg_name);
1536 }
1537 }
1538 }
1539 else if (i.tm.opcode_modifier & Modrm)
1540 {
1541 /* The opcode is completed (modulo i.tm.extension_opcode which
1542 must be put into the modrm byte).
1543 Now, we make the modrm & index base bytes based on all the
1544 info we've collected. */
1545
1546 /* i.reg_operands MUST be the number of real register operands;
1547 implicit registers do not count. */
1548 if (i.reg_operands == 2)
1549 {
1550 unsigned int source, dest;
1551 source = ((i.types[0]
1552 & (Reg
1553 | SReg2
1554 | SReg3
1555 | Control
1556 | Debug
1557 | Test
1558 | RegMMX))
1559 ? 0 : 1);
1560 dest = source + 1;
1561
1562 /* Certain instructions expect the destination to be
1563 in the i.rm.reg field. This is by far the
1564 exceptional case. For these instructions, if the
1565 source operand is a register, we must reverse the
1566 i.rm.reg and i.rm.regmem fields. We accomplish
1567 this by pretending that the two register operands
1568 were given in the reverse order. */
1569 if (i.tm.opcode_modifier & ReverseRegRegmem)
1570 {
1571 const reg_entry *tmp = i.regs[source];
1572 i.regs[source] = i.regs[dest];
1573 i.regs[dest] = tmp;
1574 }
1575
1576 i.rm.mode = 3;
1577 /* We must be careful to make sure that all
1578 segment/control/test/debug/MMX registers go into
1579 the i.rm.reg field (despite whether they are
1580 source or destination operands). */
1581 if (i.regs[dest]->reg_type
1582 & (SReg2 | SReg3 | Control | Debug | Test | RegMMX))
1583 {
1584 i.rm.reg = i.regs[dest]->reg_num;
1585 i.rm.regmem = i.regs[source]->reg_num;
1586 }
1587 else
1588 {
1589 i.rm.reg = i.regs[source]->reg_num;
1590 i.rm.regmem = i.regs[dest]->reg_num;
1591 }
1592 }
1593 else
1594 { /* if it's not 2 reg operands... */
1595 if (i.mem_operands)
1596 {
1597 unsigned int fake_zero_displacement = 0;
1598 unsigned int op = ((i.types[0] & AnyMem)
1599 ? 0
1600 : (i.types[1] & AnyMem) ? 1 : 2);
1601
1602 default_seg = &ds;
1603
1604 if (! i.base_reg)
1605 {
1606 i.rm.mode = 0;
1607 if (! i.disp_operands)
1608 fake_zero_displacement = 1;
1609 if (! i.index_reg)
1610 {
1611 /* Operand is just <disp> */
1612 if (flag_16bit_code ^ (i.prefix[ADDR_PREFIX] != 0))
1613 {
1614 i.rm.regmem = NO_BASE_REGISTER_16;
1615 i.types[op] &= ~Disp;
1616 i.types[op] |= Disp16;
1617 }
1618 else
1619 {
1620 i.rm.regmem = NO_BASE_REGISTER;
1621 i.types[op] &= ~Disp;
1622 i.types[op] |= Disp32;
1623 }
1624 }
1625 else /* ! i.base_reg && i.index_reg */
1626 {
1627 i.sib.index = i.index_reg->reg_num;
1628 i.sib.base = NO_BASE_REGISTER;
1629 i.sib.scale = i.log2_scale_factor;
1630 i.rm.regmem = ESCAPE_TO_TWO_BYTE_ADDRESSING;
1631 i.types[op] &= ~Disp;
1632 i.types[op] |= Disp32; /* Must be 32 bit */
1633 }
1634 }
1635 else if (i.base_reg->reg_type & Reg16)
1636 {
1637 switch (i.base_reg->reg_num)
1638 {
1639 case 3: /* (%bx) */
1640 if (! i.index_reg)
1641 i.rm.regmem = 7;
1642 else /* (%bx,%si) -> 0, or (%bx,%di) -> 1 */
1643 i.rm.regmem = i.index_reg->reg_num - 6;
1644 break;
1645 case 5: /* (%bp) */
1646 default_seg = &ss;
1647 if (! i.index_reg)
1648 {
1649 i.rm.regmem = 6;
1650 if ((i.types[op] & Disp) == 0)
1651 {
1652 /* fake (%bp) into 0(%bp) */
1653 i.types[op] |= Disp8;
1654 fake_zero_displacement = 1;
1655 }
1656 }
1657 else /* (%bp,%si) -> 2, or (%bp,%di) -> 3 */
1658 i.rm.regmem = i.index_reg->reg_num - 6 + 2;
1659 break;
1660 default: /* (%si) -> 4 or (%di) -> 5 */
1661 i.rm.regmem = i.base_reg->reg_num - 6 + 4;
1662 }
1663 i.rm.mode = mode_from_disp_size (i.types[op]);
1664 }
1665 else /* i.base_reg and 32 bit mode */
1666 {
1667 i.rm.regmem = i.base_reg->reg_num;
1668 i.sib.base = i.base_reg->reg_num;
1669 if (i.base_reg->reg_num == EBP_REG_NUM)
1670 {
1671 default_seg = &ss;
1672 if (i.disp_operands == 0)
1673 {
1674 fake_zero_displacement = 1;
1675 i.types[op] |= Disp8;
1676 }
1677 }
1678 else if (i.base_reg->reg_num == ESP_REG_NUM)
1679 {
1680 default_seg = &ss;
1681 }
1682 i.sib.scale = i.log2_scale_factor;
1683 if (! i.index_reg)
1684 {
1685 /* <disp>(%esp) becomes two byte modrm
1686 with no index register. We've already
1687 stored the code for esp in i.rm.regmem
1688 ie. ESCAPE_TO_TWO_BYTE_ADDRESSING. Any
1689 base register besides %esp will not use
1690 the extra modrm byte. */
1691 i.sib.index = NO_INDEX_REGISTER;
1692 #if ! SCALE1_WHEN_NO_INDEX
1693 /* Another case where we force the second
1694 modrm byte. */
1695 if (i.log2_scale_factor)
1696 i.rm.regmem = ESCAPE_TO_TWO_BYTE_ADDRESSING;
1697 #endif
1698 }
1699 else
1700 {
1701 i.sib.index = i.index_reg->reg_num;
1702 i.rm.regmem = ESCAPE_TO_TWO_BYTE_ADDRESSING;
1703 }
1704 i.rm.mode = mode_from_disp_size (i.types[op]);
1705 }
1706
1707 if (fake_zero_displacement)
1708 {
1709 /* Fakes a zero displacement assuming that i.types[op]
1710 holds the correct displacement size. */
1711 exp = &disp_expressions[i.disp_operands++];
1712 i.disps[op] = exp;
1713 exp->X_op = O_constant;
1714 exp->X_add_number = 0;
1715 exp->X_add_symbol = (symbolS *) 0;
1716 exp->X_op_symbol = (symbolS *) 0;
1717 }
1718 }
1719
1720 /* Fill in i.rm.reg or i.rm.regmem field with register
1721 operand (if any) based on i.tm.extension_opcode.
1722 Again, we must be careful to make sure that
1723 segment/control/debug/test/MMX registers are coded
1724 into the i.rm.reg field. */
1725 if (i.reg_operands)
1726 {
1727 unsigned int op =
1728 ((i.types[0]
1729 & (Reg | SReg2 | SReg3 | Control | Debug
1730 | Test | RegMMX))
1731 ? 0
1732 : ((i.types[1]
1733 & (Reg | SReg2 | SReg3 | Control | Debug
1734 | Test | RegMMX))
1735 ? 1
1736 : 2));
1737 /* If there is an extension opcode to put here, the
1738 register number must be put into the regmem field. */
1739 if (i.tm.extension_opcode != None)
1740 i.rm.regmem = i.regs[op]->reg_num;
1741 else
1742 i.rm.reg = i.regs[op]->reg_num;
1743
1744 /* Now, if no memory operand has set i.rm.mode = 0, 1, 2
1745 we must set it to 3 to indicate this is a register
1746 operand in the regmem field. */
1747 if (!i.mem_operands)
1748 i.rm.mode = 3;
1749 }
1750
1751 /* Fill in i.rm.reg field with extension opcode (if any). */
1752 if (i.tm.extension_opcode != None)
1753 i.rm.reg = i.tm.extension_opcode;
1754 }
1755 }
1756 else if (i.tm.opcode_modifier & (Seg2ShortForm | Seg3ShortForm))
1757 {
1758 if (i.tm.base_opcode == POP_SEG_SHORT && i.regs[0]->reg_num == 1)
1759 {
1760 as_bad (_("you can't `pop %%cs'"));
1761 return;
1762 }
1763 i.tm.base_opcode |= (i.regs[0]->reg_num << 3);
1764 }
1765 else if ((i.tm.base_opcode & ~(D|W)) == MOV_AX_DISP32)
1766 {
1767 default_seg = &ds;
1768 }
1769 else if ((i.tm.opcode_modifier & IsString) != 0)
1770 {
1771 /* For the string instructions that allow a segment override
1772 on one of their operands, the default segment is ds. */
1773 default_seg = &ds;
1774 }
1775
1776 /* If a segment was explicitly specified,
1777 and the specified segment is not the default,
1778 use an opcode prefix to select it.
1779 If we never figured out what the default segment is,
1780 then default_seg will be zero at this point,
1781 and the specified segment prefix will always be used. */
1782 if ((i.seg[0]) && (i.seg[0] != default_seg))
1783 {
1784 if (! add_prefix (i.seg[0]->seg_prefix))
1785 return;
1786 }
1787 }
1788 else if ((i.tm.opcode_modifier & Ugh) != 0)
1789 {
1790 /* UnixWare fsub no args is alias for fsubp, fadd -> faddp, etc */
1791 as_warn (_("translating to `%sp'"), i.tm.name);
1792 }
1793 }
1794
1795 /* Handle conversion of 'int $3' --> special int3 insn. */
1796 if (i.tm.base_opcode == INT_OPCODE && i.imms[0]->X_add_number == 3)
1797 {
1798 i.tm.base_opcode = INT3_OPCODE;
1799 i.imm_operands = 0;
1800 }
1801
1802 /* We are ready to output the insn. */
1803 {
1804 register char *p;
1805
1806 /* Output jumps. */
1807 if (i.tm.opcode_modifier & Jump)
1808 {
1809 unsigned long n = i.disps[0]->X_add_number;
1810 int prefix = (i.prefix[DATA_PREFIX] != 0);
1811 int code16 = 0;
1812
1813 if (prefix)
1814 {
1815 i.prefixes -= 1;
1816 code16 = CODE16;
1817 }
1818 if (flag_16bit_code)
1819 code16 ^= CODE16;
1820
1821 if (i.prefixes != 0)
1822 as_warn (_("skipping prefixes on this instruction"));
1823
1824 if (i.disps[0]->X_op == O_constant)
1825 {
1826 if (fits_in_signed_byte (n))
1827 {
1828 insn_size += 2;
1829 p = frag_more (2);
1830 p[0] = i.tm.base_opcode;
1831 p[1] = n;
1832 }
1833 else
1834 {
1835 /* Use 16-bit jumps only for 16-bit code,
1836 because text segments are limited to 64K anyway;
1837 Use 32-bit jumps for 32-bit code, because they're faster,
1838 and a 16-bit jump will clear the top 16 bits of %eip. */
1839 int jmp_size = code16 ? 2 : 4;
1840 if (code16 && !fits_in_signed_word (n))
1841 {
1842 as_bad (_("16-bit jump out of range"));
1843 return;
1844 }
1845
1846 if (i.tm.base_opcode == JUMP_PC_RELATIVE)
1847 { /* pace */
1848 /* unconditional jump */
1849 insn_size += prefix + 1 + jmp_size;
1850 p = frag_more (prefix + 1 + jmp_size);
1851 if (prefix)
1852 *p++ = DATA_PREFIX_OPCODE;
1853 *p++ = (char) 0xe9;
1854 md_number_to_chars (p, (valueT) n, jmp_size);
1855 }
1856 else
1857 {
1858 /* conditional jump */
1859 insn_size += prefix + 2 + jmp_size;
1860 p = frag_more (prefix + 2 + jmp_size);
1861 if (prefix)
1862 *p++ = DATA_PREFIX_OPCODE;
1863 *p++ = TWO_BYTE_OPCODE_ESCAPE;
1864 *p++ = i.tm.base_opcode + 0x10;
1865 md_number_to_chars (p, (valueT) n, jmp_size);
1866 }
1867 }
1868 }
1869 else
1870 {
1871 int size = code16 ? 2 : 4;
1872
1873 /* It's a symbol; end frag & setup for relax.
1874 Make sure there are more than 6 chars left in the current frag;
1875 if not we'll have to start a new one. */
1876 frag_grow (prefix + 1 + 2 + size);
1877 insn_size += 1 + prefix;
1878 p = frag_more (1 + prefix);
1879 if (prefix)
1880 *p++ = DATA_PREFIX_OPCODE;
1881 *p = i.tm.base_opcode;
1882 frag_var (rs_machine_dependent,
1883 prefix + 2 + size, /* 2 opcode/prefix + displacement */
1884 1,
1885 ((unsigned char) *p == JUMP_PC_RELATIVE
1886 ? ENCODE_RELAX_STATE (UNCOND_JUMP, SMALL) | code16
1887 : ENCODE_RELAX_STATE (COND_JUMP, SMALL) | code16),
1888 i.disps[0]->X_add_symbol,
1889 (offsetT) n, p);
1890 }
1891 }
1892 else if (i.tm.opcode_modifier & (JumpByte | JumpDword))
1893 {
1894 int size = (i.tm.opcode_modifier & JumpByte) ? 1 : 4;
1895 unsigned long n = i.disps[0]->X_add_number;
1896
1897 if (size == 1) /* then this is a loop or jecxz type instruction */
1898 {
1899 if (i.prefix[ADDR_PREFIX])
1900 {
1901 insn_size += 1;
1902 FRAG_APPEND_1_CHAR (ADDR_PREFIX_OPCODE);
1903 i.prefixes -= 1;
1904 }
1905 }
1906 else
1907 {
1908 int code16 = 0;
1909
1910 if (i.prefix[DATA_PREFIX])
1911 {
1912 insn_size += 1;
1913 FRAG_APPEND_1_CHAR (DATA_PREFIX_OPCODE);
1914 i.prefixes -= 1;
1915 code16 = CODE16;
1916 }
1917 if (flag_16bit_code)
1918 code16 ^= CODE16;
1919
1920 if (code16)
1921 size = 2;
1922 }
1923
1924 if (i.prefixes != 0)
1925 as_warn (_("skipping prefixes on this instruction"));
1926
1927 if (fits_in_unsigned_byte (i.tm.base_opcode))
1928 {
1929 insn_size += 1 + size;
1930 p = frag_more (1 + size);
1931 }
1932 else
1933 {
1934 insn_size += 2 + size; /* opcode can be at most two bytes */
1935 p = frag_more (2 + size);
1936 *p++ = (i.tm.base_opcode >> 8) & 0xff;
1937 }
1938 *p++ = i.tm.base_opcode & 0xff;
1939
1940 if (i.disps[0]->X_op == O_constant)
1941 {
1942 if (size == 1 && !fits_in_signed_byte (n))
1943 {
1944 as_bad (_("`%s' only takes byte displacement; %lu shortened to %d"),
1945 i.tm.name, n, *p);
1946 }
1947 else if (size == 2 && !fits_in_signed_word (n))
1948 {
1949 as_bad (_("16-bit jump out of range"));
1950 return;
1951 }
1952 md_number_to_chars (p, (valueT) n, size);
1953 }
1954 else
1955 {
1956 fix_new_exp (frag_now, p - frag_now->fr_literal, size,
1957 i.disps[0], 1, reloc (size, 1, i.disp_reloc[0]));
1958
1959 }
1960 }
1961 else if (i.tm.opcode_modifier & JumpInterSegment)
1962 {
1963 int size;
1964 int reloc_type;
1965 int prefix = i.prefix[DATA_PREFIX] != 0;
1966 int code16 = 0;
1967
1968 if (prefix)
1969 {
1970 code16 = CODE16;
1971 i.prefixes -= 1;
1972 }
1973 if (flag_16bit_code)
1974 code16 ^= CODE16;
1975
1976 size = 4;
1977 reloc_type = BFD_RELOC_32;
1978 if (code16)
1979 {
1980 size = 2;
1981 reloc_type = BFD_RELOC_16;
1982 }
1983
1984 if (i.prefixes != 0)
1985 as_warn (_("skipping prefixes on this instruction"));
1986
1987 insn_size += prefix + 1 + 2 + size; /* 1 opcode; 2 segment; offset */
1988 p = frag_more (prefix + 1 + 2 + size);
1989 if (prefix)
1990 *p++ = DATA_PREFIX_OPCODE;
1991 *p++ = i.tm.base_opcode;
1992 if (i.imms[1]->X_op == O_constant)
1993 {
1994 unsigned long n = i.imms[1]->X_add_number;
1995 if (size == 2 && !fits_in_unsigned_word (n))
1996 {
1997 as_bad (_("16-bit jump out of range"));
1998 return;
1999 }
2000 md_number_to_chars (p, (valueT) n, size);
2001 }
2002 else
2003 fix_new_exp (frag_now, p - frag_now->fr_literal, size,
2004 i.imms[1], 0, reloc_type);
2005 if (i.imms[0]->X_op != O_constant)
2006 as_bad (_("can't handle non absolute segment in `%s'"),
2007 i.tm.name);
2008 md_number_to_chars (p + size, (valueT) i.imms[0]->X_add_number, 2);
2009 }
2010 else
2011 {
2012 /* Output normal instructions here. */
2013 unsigned char *q;
2014
2015 /* The prefix bytes. */
2016 for (q = i.prefix;
2017 q < i.prefix + sizeof (i.prefix) / sizeof (i.prefix[0]);
2018 q++)
2019 {
2020 if (*q)
2021 {
2022 insn_size += 1;
2023 p = frag_more (1);
2024 md_number_to_chars (p, (valueT) *q, 1);
2025 }
2026 }
2027
2028 /* Now the opcode; be careful about word order here! */
2029 if (fits_in_unsigned_byte (i.tm.base_opcode))
2030 {
2031 insn_size += 1;
2032 FRAG_APPEND_1_CHAR (i.tm.base_opcode);
2033 }
2034 else if (fits_in_unsigned_word (i.tm.base_opcode))
2035 {
2036 insn_size += 2;
2037 p = frag_more (2);
2038 /* put out high byte first: can't use md_number_to_chars! */
2039 *p++ = (i.tm.base_opcode >> 8) & 0xff;
2040 *p = i.tm.base_opcode & 0xff;
2041 }
2042 else
2043 { /* opcode is either 3 or 4 bytes */
2044 if (i.tm.base_opcode & 0xff000000)
2045 {
2046 insn_size += 4;
2047 p = frag_more (4);
2048 *p++ = (i.tm.base_opcode >> 24) & 0xff;
2049 }
2050 else
2051 {
2052 insn_size += 3;
2053 p = frag_more (3);
2054 }
2055 *p++ = (i.tm.base_opcode >> 16) & 0xff;
2056 *p++ = (i.tm.base_opcode >> 8) & 0xff;
2057 *p = (i.tm.base_opcode) & 0xff;
2058 }
2059
2060 /* Now the modrm byte and sib byte (if present). */
2061 if (i.tm.opcode_modifier & Modrm)
2062 {
2063 insn_size += 1;
2064 p = frag_more (1);
2065 md_number_to_chars (p,
2066 (valueT) (i.rm.regmem << 0
2067 | i.rm.reg << 3
2068 | i.rm.mode << 6),
2069 1);
2070 /* If i.rm.regmem == ESP (4)
2071 && i.rm.mode != (Register mode)
2072 && not 16 bit
2073 ==> need second modrm byte. */
2074 if (i.rm.regmem == ESCAPE_TO_TWO_BYTE_ADDRESSING
2075 && i.rm.mode != 3
2076 && !(i.base_reg && (i.base_reg->reg_type & Reg16) != 0))
2077 {
2078 insn_size += 1;
2079 p = frag_more (1);
2080 md_number_to_chars (p,
2081 (valueT) (i.sib.base << 0
2082 | i.sib.index << 3
2083 | i.sib.scale << 6),
2084 1);
2085 }
2086 }
2087
2088 if (i.disp_operands)
2089 {
2090 register unsigned int n;
2091
2092 for (n = 0; n < i.operands; n++)
2093 {
2094 if (i.disps[n])
2095 {
2096 if (i.disps[n]->X_op == O_constant)
2097 {
2098 if (i.types[n] & Disp8)
2099 {
2100 insn_size += 1;
2101 p = frag_more (1);
2102 md_number_to_chars (p,
2103 (valueT) i.disps[n]->X_add_number,
2104 1);
2105 }
2106 else if (i.types[n] & Disp16)
2107 {
2108 insn_size += 2;
2109 p = frag_more (2);
2110 md_number_to_chars (p,
2111 (valueT) i.disps[n]->X_add_number,
2112 2);
2113 }
2114 else
2115 { /* Disp32 */
2116 insn_size += 4;
2117 p = frag_more (4);
2118 md_number_to_chars (p,
2119 (valueT) i.disps[n]->X_add_number,
2120 4);
2121 }
2122 }
2123 else if (i.types[n] & Disp32)
2124 {
2125 insn_size += 4;
2126 p = frag_more (4);
2127 fix_new_exp (frag_now, p - frag_now->fr_literal, 4,
2128 i.disps[n], 0,
2129 TC_RELOC (i.disp_reloc[n], BFD_RELOC_32));
2130 }
2131 else
2132 { /* must be Disp16 */
2133 insn_size += 2;
2134 p = frag_more (2);
2135 fix_new_exp (frag_now, p - frag_now->fr_literal, 2,
2136 i.disps[n], 0,
2137 TC_RELOC (i.disp_reloc[n], BFD_RELOC_16));
2138 }
2139 }
2140 }
2141 } /* end displacement output */
2142
2143 /* output immediate */
2144 if (i.imm_operands)
2145 {
2146 register unsigned int n;
2147
2148 for (n = 0; n < i.operands; n++)
2149 {
2150 if (i.imms[n])
2151 {
2152 if (i.imms[n]->X_op == O_constant)
2153 {
2154 if (i.types[n] & (Imm8 | Imm8S))
2155 {
2156 insn_size += 1;
2157 p = frag_more (1);
2158 md_number_to_chars (p,
2159 (valueT) i.imms[n]->X_add_number,
2160 1);
2161 }
2162 else if (i.types[n] & Imm16)
2163 {
2164 insn_size += 2;
2165 p = frag_more (2);
2166 md_number_to_chars (p,
2167 (valueT) i.imms[n]->X_add_number,
2168 2);
2169 }
2170 else
2171 {
2172 insn_size += 4;
2173 p = frag_more (4);
2174 md_number_to_chars (p,
2175 (valueT) i.imms[n]->X_add_number,
2176 4);
2177 }
2178 }
2179 else
2180 { /* not absolute_section */
2181 /* Need a 32-bit fixup (don't support 8bit
2182 non-absolute ims). Try to support other
2183 sizes ... */
2184 int r_type;
2185 int size;
2186 int pcrel = 0;
2187
2188 if (i.types[n] & (Imm8 | Imm8S))
2189 size = 1;
2190 else if (i.types[n] & Imm16)
2191 size = 2;
2192 else
2193 size = 4;
2194 insn_size += size;
2195 p = frag_more (size);
2196 r_type = reloc (size, 0, i.disp_reloc[0]);
2197 #ifdef BFD_ASSEMBLER
2198 if (r_type == BFD_RELOC_32
2199 && GOT_symbol
2200 && GOT_symbol == i.imms[n]->X_add_symbol
2201 && (i.imms[n]->X_op == O_symbol
2202 || (i.imms[n]->X_op == O_add
2203 && (i.imms[n]->X_op_symbol->sy_value.X_op
2204 == O_subtract))))
2205 {
2206 r_type = BFD_RELOC_386_GOTPC;
2207 i.imms[n]->X_add_number += 3;
2208 }
2209 #endif
2210 fix_new_exp (frag_now, p - frag_now->fr_literal, size,
2211 i.imms[n], pcrel, r_type);
2212 }
2213 }
2214 }
2215 } /* end immediate output */
2216 }
2217
2218 #ifdef DEBUG386
2219 if (flag_debug)
2220 {
2221 pi (line, &i);
2222 }
2223 #endif /* DEBUG386 */
2224 }
2225 }
2226 \f
2227 /* Parse OPERAND_STRING into the i386_insn structure I. Returns non-zero
2228 on error. */
2229
2230 static int
2231 i386_operand (operand_string)
2232 char *operand_string;
2233 {
2234 register char *op_string = operand_string;
2235
2236 /* We check for an absolute prefix (differentiating,
2237 for example, 'jmp pc_relative_label' from 'jmp *absolute_label'. */
2238 if (*op_string == ABSOLUTE_PREFIX)
2239 {
2240 ++op_string;
2241 if (is_space_char (*op_string))
2242 ++op_string;
2243 i.types[this_operand] |= JumpAbsolute;
2244 }
2245
2246 /* Check if operand is a register. */
2247 if (*op_string == REGISTER_PREFIX)
2248 {
2249 register const reg_entry *r;
2250 char *end_op;
2251
2252 r = parse_register (op_string, &end_op);
2253 if (r == NULL)
2254 return 0;
2255 /* Check for a segment override by searching for ':' after a
2256 segment register. */
2257 op_string = end_op;
2258 if (is_space_char (*op_string))
2259 ++op_string;
2260 if ((r->reg_type & (SReg2 | SReg3)) && *op_string == ':')
2261 {
2262 switch (r->reg_num)
2263 {
2264 case 0:
2265 i.seg[i.mem_operands] = &es;
2266 break;
2267 case 1:
2268 i.seg[i.mem_operands] = &cs;
2269 break;
2270 case 2:
2271 i.seg[i.mem_operands] = &ss;
2272 break;
2273 case 3:
2274 i.seg[i.mem_operands] = &ds;
2275 break;
2276 case 4:
2277 i.seg[i.mem_operands] = &fs;
2278 break;
2279 case 5:
2280 i.seg[i.mem_operands] = &gs;
2281 break;
2282 }
2283
2284 /* Skip the ':' and whitespace. */
2285 ++op_string;
2286 if (is_space_char (*op_string))
2287 ++op_string;
2288
2289 operand_string = op_string; /* Pretend given string starts here. */
2290 if (!is_digit_char (*op_string) && !is_identifier_char (*op_string)
2291 && *op_string != '(' && *op_string != ABSOLUTE_PREFIX)
2292 {
2293 as_bad (_("bad memory operand `%s'"), op_string);
2294 return 0;
2295 }
2296 /* Handle case of %es:*foo. */
2297 if (*op_string == ABSOLUTE_PREFIX)
2298 {
2299 ++op_string;
2300 if (is_space_char (*op_string))
2301 ++op_string;
2302 i.types[this_operand] |= JumpAbsolute;
2303 }
2304 goto do_memory_reference;
2305 }
2306 i.types[this_operand] |= r->reg_type & ~BaseIndex;
2307 i.regs[this_operand] = r;
2308 i.reg_operands++;
2309 }
2310 else if (*op_string == IMMEDIATE_PREFIX)
2311 { /* ... or an immediate */
2312 char *save_input_line_pointer;
2313 segT exp_seg = 0;
2314 expressionS *exp;
2315
2316 if (i.imm_operands == MAX_IMMEDIATE_OPERANDS)
2317 {
2318 as_bad (_("only 1 or 2 immediate operands are allowed"));
2319 return 0;
2320 }
2321
2322 exp = &im_expressions[i.imm_operands++];
2323 i.imms[this_operand] = exp;
2324
2325 ++op_string;
2326 if (is_space_char (*op_string))
2327 ++op_string;
2328
2329 save_input_line_pointer = input_line_pointer;
2330 input_line_pointer = op_string;
2331 exp_seg = expression (exp);
2332 if (*input_line_pointer != '\0')
2333 {
2334 /* This should be as_bad, but some versions of gcc, up to
2335 about 2.8 and egcs 1.01, generate a bogus @GOTOFF(%ebx)
2336 in certain cases. Oddly, the code in question turns out
2337 to work correctly anyhow, so we make this just a warning
2338 until those versions of gcc are obsolete. */
2339 as_warn (_("unrecognized characters `%s' in expression"),
2340 input_line_pointer);
2341 }
2342 input_line_pointer = save_input_line_pointer;
2343
2344 if (exp->X_op == O_absent)
2345 {
2346 /* missing or bad expr becomes absolute 0 */
2347 as_bad (_("missing or invalid immediate expression `%s' taken as 0"),
2348 operand_string);
2349 exp->X_op = O_constant;
2350 exp->X_add_number = 0;
2351 exp->X_add_symbol = (symbolS *) 0;
2352 exp->X_op_symbol = (symbolS *) 0;
2353 i.types[this_operand] |= Imm;
2354 }
2355 else if (exp->X_op == O_constant)
2356 {
2357 i.types[this_operand] |=
2358 smallest_imm_type ((long) exp->X_add_number);
2359 }
2360 #ifdef OBJ_AOUT
2361 else if (exp_seg != text_section
2362 && exp_seg != data_section
2363 && exp_seg != bss_section
2364 && exp_seg != undefined_section
2365 #ifdef BFD_ASSEMBLER
2366 && ! bfd_is_com_section (exp_seg)
2367 #endif
2368 )
2369 {
2370 seg_unimplemented:
2371 as_bad (_("Unimplemented segment type %d in parse_operand"), exp_seg);
2372 return 0;
2373 }
2374 #endif
2375 else
2376 {
2377 /* This is an address. */
2378 i.types[this_operand] |=
2379 (flag_16bit_code ^ (i.prefix[DATA_PREFIX] != 0)) ? Imm16 : Imm32;
2380 }
2381 /* shorten this type of this operand if the instruction wants
2382 * fewer bits than are present in the immediate. The bit field
2383 * code can put out 'andb $0xffffff, %al', for example. pace
2384 * also 'movw $foo,(%eax)'
2385 */
2386 switch (i.suffix)
2387 {
2388 case WORD_OPCODE_SUFFIX:
2389 i.types[this_operand] |= Imm16;
2390 break;
2391 case BYTE_OPCODE_SUFFIX:
2392 i.types[this_operand] |= Imm16 | Imm8 | Imm8S;
2393 break;
2394 }
2395 }
2396 else if (is_digit_char (*op_string) || is_identifier_char (*op_string)
2397 || *op_string == '(')
2398 {
2399 /* This is a memory reference of some sort. */
2400 char *end_of_operand_string;
2401 register char *base_string;
2402 int found_base_index_form;
2403
2404 /* Start and end of displacement string expression (if found). */
2405 char *displacement_string_start;
2406 char *displacement_string_end;
2407
2408 do_memory_reference:
2409 if ((i.mem_operands == 1
2410 && (current_templates->start->opcode_modifier & IsString) == 0)
2411 || i.mem_operands == 2)
2412 {
2413 as_bad (_("too many memory references for `%s'"),
2414 current_templates->start->name);
2415 return 0;
2416 }
2417
2418 /* Check for base index form. We detect the base index form by
2419 looking for an ')' at the end of the operand, searching
2420 for the '(' matching it, and finding a REGISTER_PREFIX or ','
2421 after the '('. */
2422 found_base_index_form = 0;
2423 end_of_operand_string = op_string + strlen (op_string);
2424
2425 --end_of_operand_string;
2426 if (is_space_char (*end_of_operand_string))
2427 --end_of_operand_string;
2428
2429 base_string = end_of_operand_string;
2430 if (*base_string == ')')
2431 {
2432 unsigned int parens_balanced = 1;
2433 /* We've already checked that the number of left & right ()'s are
2434 equal, so this loop will not be infinite. */
2435 do
2436 {
2437 base_string--;
2438 if (*base_string == ')')
2439 parens_balanced++;
2440 if (*base_string == '(')
2441 parens_balanced--;
2442 }
2443 while (parens_balanced);
2444
2445 /* If there is a displacement set-up for it to be parsed later. */
2446 displacement_string_start = op_string;
2447 displacement_string_end = base_string;
2448
2449 /* Skip past '(' and whitespace. */
2450 ++base_string;
2451 if (is_space_char (*base_string))
2452 ++base_string;
2453
2454 if (*base_string == REGISTER_PREFIX || *base_string == ',')
2455 found_base_index_form = 1;
2456 }
2457
2458 /* If we can't parse a base index register expression, we've found
2459 a pure displacement expression. We set up displacement_string_start
2460 and displacement_string_end for the code below. */
2461 if (!found_base_index_form)
2462 {
2463 displacement_string_start = op_string;
2464 displacement_string_end = end_of_operand_string + 1;
2465 }
2466 else
2467 {
2468 i.types[this_operand] |= BaseIndex;
2469
2470 /* Find base register (if any). */
2471 if (*base_string != ',')
2472 {
2473 char *end_op;
2474
2475 /* Trim off the closing ')' so that parse_register won't
2476 see it. */
2477 END_STRING_AND_SAVE (end_of_operand_string);
2478 i.base_reg = parse_register (base_string, &end_op);
2479 if (i.base_reg == NULL)
2480 {
2481 RESTORE_END_STRING (end_of_operand_string);
2482 return 0;
2483 }
2484 RESTORE_END_STRING (end_of_operand_string);
2485 base_string = end_op;
2486 if (is_space_char (*base_string))
2487 ++base_string;
2488 }
2489
2490 /* There may be an index reg or scale factor here. */
2491 if (*base_string == ',')
2492 {
2493 ++base_string;
2494 if (is_space_char (*base_string))
2495 ++base_string;
2496
2497 if (*base_string == REGISTER_PREFIX)
2498 {
2499 char *end_op;
2500
2501 END_STRING_AND_SAVE (end_of_operand_string);
2502 i.index_reg = parse_register (base_string, &end_op);
2503 RESTORE_END_STRING (end_of_operand_string);
2504
2505 if (i.index_reg == NULL)
2506 return 0;
2507
2508 base_string = end_op;
2509 if (is_space_char (*base_string))
2510 ++base_string;
2511 if (*base_string == ',')
2512 {
2513 ++base_string;
2514 if (is_space_char (*base_string))
2515 ++base_string;
2516 }
2517 else if (*base_string != ')')
2518 {
2519 as_bad (_("expecting `,' or `)' after index register in `%s'"),
2520 operand_string);
2521 return 0;
2522 }
2523 }
2524
2525 /* Check for scale factor. */
2526 if (isdigit ((unsigned char) *base_string))
2527 {
2528 if (isdigit ((unsigned char) base_string[1]))
2529 goto bad_scale; /* must be 1 digit scale */
2530 switch (*base_string)
2531 {
2532 case '1':
2533 i.log2_scale_factor = 0;
2534 break;
2535 case '2':
2536 i.log2_scale_factor = 1;
2537 break;
2538 case '4':
2539 i.log2_scale_factor = 2;
2540 break;
2541 case '8':
2542 i.log2_scale_factor = 3;
2543 break;
2544 default:
2545 bad_scale:
2546 as_bad (_("expecting scale factor of 1, 2, 4 or 8; got `%s'"),
2547 base_string);
2548 return 0;
2549 }
2550
2551 ++base_string;
2552 if (is_space_char (*base_string))
2553 ++base_string;
2554 if (*base_string != ')')
2555 {
2556 as_bad (_("expecting `)' after scale factor in `%s'"),
2557 operand_string);
2558 return 0;
2559 }
2560 if (i.log2_scale_factor != 0 && ! i.index_reg)
2561 {
2562 as_warn (_("scale factor of %d without an index register"),
2563 1 << i.log2_scale_factor);
2564 #if SCALE1_WHEN_NO_INDEX
2565 i.log2_scale_factor = 0;
2566 #endif
2567 }
2568 }
2569 else if (!i.index_reg)
2570 {
2571 as_bad (_("expecting index register or scale factor after `,'; got '%c'"),
2572 *base_string);
2573 return 0;
2574 }
2575 }
2576 else if (*base_string != ')')
2577 {
2578 as_bad (_("expecting `,' or `)' after base register in `%s'"),
2579 operand_string);
2580 return 0;
2581 }
2582 }
2583
2584 /* If there's an expression begining the operand, parse it,
2585 assuming displacement_string_start and
2586 displacement_string_end are meaningful. */
2587 if (displacement_string_start != displacement_string_end)
2588 {
2589 register expressionS *exp;
2590 segT exp_seg = 0;
2591 char *save_input_line_pointer;
2592 int bigdisp = Disp32;
2593
2594 if (flag_16bit_code ^ (i.prefix[ADDR_PREFIX] != 0))
2595 bigdisp = Disp16;
2596 i.types[this_operand] |= bigdisp;
2597
2598 exp = &disp_expressions[i.disp_operands];
2599 i.disps[this_operand] = exp;
2600 i.disp_reloc[this_operand] = NO_RELOC;
2601 i.disp_operands++;
2602 save_input_line_pointer = input_line_pointer;
2603 input_line_pointer = displacement_string_start;
2604 END_STRING_AND_SAVE (displacement_string_end);
2605 #ifndef GCC_ASM_O_HACK
2606 #define GCC_ASM_O_HACK 0
2607 #endif
2608 #if GCC_ASM_O_HACK
2609 END_STRING_AND_SAVE (displacement_string_end + 1);
2610 if ((i.types[this_operand] & BaseIndex) != 0
2611 && displacement_string_end[-1] == '+')
2612 {
2613 /* This hack is to avoid a warning when using the "o"
2614 constraint within gcc asm statements.
2615 For instance:
2616
2617 #define _set_tssldt_desc(n,addr,limit,type) \
2618 __asm__ __volatile__ ( \
2619 "movw %w2,%0\n\t" \
2620 "movw %w1,2+%0\n\t" \
2621 "rorl $16,%1\n\t" \
2622 "movb %b1,4+%0\n\t" \
2623 "movb %4,5+%0\n\t" \
2624 "movb $0,6+%0\n\t" \
2625 "movb %h1,7+%0\n\t" \
2626 "rorl $16,%1" \
2627 : "=o"(*(n)) : "q" (addr), "ri"(limit), "i"(type))
2628
2629 This works great except that the output assembler ends
2630 up looking a bit weird if it turns out that there is
2631 no offset. You end up producing code that looks like:
2632
2633 #APP
2634 movw $235,(%eax)
2635 movw %dx,2+(%eax)
2636 rorl $16,%edx
2637 movb %dl,4+(%eax)
2638 movb $137,5+(%eax)
2639 movb $0,6+(%eax)
2640 movb %dh,7+(%eax)
2641 rorl $16,%edx
2642 #NO_APP
2643
2644 So here we provide the missing zero.
2645 */
2646
2647 *displacement_string_end = '0';
2648 }
2649 #endif
2650 #ifndef LEX_AT
2651 {
2652 /*
2653 * We can have operands of the form
2654 * <symbol>@GOTOFF+<nnn>
2655 * Take the easy way out here and copy everything
2656 * into a temporary buffer...
2657 */
2658 register char *cp;
2659
2660 cp = strchr (input_line_pointer, '@');
2661 if (cp != NULL)
2662 {
2663 char *tmpbuf;
2664
2665 if (GOT_symbol == NULL)
2666 GOT_symbol = symbol_find_or_make (GLOBAL_OFFSET_TABLE_NAME);
2667
2668 tmpbuf = (char *) alloca ((cp - input_line_pointer) + 20);
2669
2670 if (strncmp (cp + 1, "PLT", 3) == 0)
2671 {
2672 i.disp_reloc[this_operand] = BFD_RELOC_386_PLT32;
2673 *cp = '\0';
2674 strcpy (tmpbuf, input_line_pointer);
2675 strcat (tmpbuf, cp + 1 + 3);
2676 *cp = '@';
2677 }
2678 else if (strncmp (cp + 1, "GOTOFF", 6) == 0)
2679 {
2680 i.disp_reloc[this_operand] = BFD_RELOC_386_GOTOFF;
2681 *cp = '\0';
2682 strcpy (tmpbuf, input_line_pointer);
2683 strcat (tmpbuf, cp + 1 + 6);
2684 *cp = '@';
2685 }
2686 else if (strncmp (cp + 1, "GOT", 3) == 0)
2687 {
2688 i.disp_reloc[this_operand] = BFD_RELOC_386_GOT32;
2689 *cp = '\0';
2690 strcpy (tmpbuf, input_line_pointer);
2691 strcat (tmpbuf, cp + 1 + 3);
2692 *cp = '@';
2693 }
2694 else
2695 as_bad (_("Bad reloc specifier `%s' in expression"), cp + 1);
2696
2697 /* GOT relocations are not supported in 16 bit mode */
2698 if (flag_16bit_code)
2699 as_bad (_("GOT relocations not supported in 16 bit mode"));
2700
2701 input_line_pointer = tmpbuf;
2702 }
2703 }
2704 #endif
2705
2706 exp_seg = expression (exp);
2707
2708 #ifdef BFD_ASSEMBLER
2709 /* We do this to make sure that the section symbol is in
2710 the symbol table. We will ultimately change the relocation
2711 to be relative to the beginning of the section */
2712 if (i.disp_reloc[this_operand] == BFD_RELOC_386_GOTOFF)
2713 {
2714 if (S_IS_LOCAL(exp->X_add_symbol)
2715 && S_GET_SEGMENT (exp->X_add_symbol) != undefined_section)
2716 section_symbol(exp->X_add_symbol->bsym->section);
2717 assert (exp->X_op == O_symbol);
2718 exp->X_op = O_subtract;
2719 exp->X_op_symbol = GOT_symbol;
2720 i.disp_reloc[this_operand] = BFD_RELOC_32;
2721 }
2722 #endif
2723
2724 if (*input_line_pointer)
2725 as_bad (_("Ignoring junk `%s' after expression"),
2726 input_line_pointer);
2727 #if GCC_ASM_O_HACK
2728 RESTORE_END_STRING (displacement_string_end + 1);
2729 #endif
2730 RESTORE_END_STRING (displacement_string_end);
2731 input_line_pointer = save_input_line_pointer;
2732
2733 #if 0 /* this is handled in expr. */
2734 if (exp->X_op == O_absent)
2735 {
2736 /* missing expr becomes absolute 0 */
2737 as_bad (_("missing or invalid displacement `%s' taken as 0"),
2738 operand_string);
2739 exp->X_op = O_constant;
2740 exp->X_add_number = 0;
2741 exp->X_add_symbol = (symbolS *) 0;
2742 exp->X_op_symbol = (symbolS *) 0;
2743 i.types[this_operand] |= Disp8;
2744 }
2745 else
2746 #endif
2747 if (exp->X_op == O_constant)
2748 {
2749 if (fits_in_signed_byte (exp->X_add_number))
2750 i.types[this_operand] |= Disp8;
2751 }
2752 #ifdef OBJ_AOUT
2753 else if (exp_seg != text_section
2754 && exp_seg != data_section
2755 && exp_seg != bss_section
2756 && exp_seg != undefined_section)
2757 {
2758 goto seg_unimplemented;
2759 }
2760 #endif
2761 }
2762
2763 /* Special case for (%dx) while doing input/output op. */
2764 if (i.base_reg
2765 && i.base_reg->reg_type == (Reg16 | InOutPortReg)
2766 && i.index_reg == 0
2767 && i.log2_scale_factor == 0
2768 && i.seg[i.mem_operands] == 0
2769 && (i.types[this_operand] & Disp) == 0)
2770 {
2771 i.types[this_operand] = InOutPortReg;
2772 return 1;
2773 }
2774 /* Make sure the memory operand we've been dealt is valid. */
2775 if (flag_16bit_code ^ (i.prefix[ADDR_PREFIX] != 0))
2776 {
2777 if ((i.base_reg
2778 && ((i.base_reg->reg_type & (Reg16|BaseIndex))
2779 != (Reg16|BaseIndex)))
2780 || (i.index_reg
2781 && (((i.index_reg->reg_type & (Reg16|BaseIndex))
2782 != (Reg16|BaseIndex))
2783 || ! (i.base_reg
2784 && i.base_reg->reg_num < 6
2785 && i.index_reg->reg_num >= 6
2786 && i.log2_scale_factor == 0))))
2787 {
2788 as_bad (_("`%s' is not a valid %s bit base/index expression"),
2789 operand_string, "16");
2790 return 0;
2791 }
2792 }
2793 else
2794 {
2795 if ((i.base_reg
2796 && (i.base_reg->reg_type & Reg32) == 0)
2797 || (i.index_reg
2798 && ((i.index_reg->reg_type & (Reg32|BaseIndex))
2799 != (Reg32|BaseIndex))))
2800 {
2801 as_bad (_("`%s' is not a valid %s bit base/index expression"),
2802 operand_string, "32");
2803 return 0;
2804 }
2805 }
2806 i.mem_operands++;
2807 }
2808 else
2809 { /* it's not a memory operand; argh! */
2810 as_bad (_("invalid char %s begining operand %d `%s'"),
2811 output_invalid (*op_string),
2812 this_operand + 1,
2813 op_string);
2814 return 0;
2815 }
2816 return 1; /* normal return */
2817 }
2818 \f
2819 /*
2820 * md_estimate_size_before_relax()
2821 *
2822 * Called just before relax().
2823 * Any symbol that is now undefined will not become defined.
2824 * Return the correct fr_subtype in the frag.
2825 * Return the initial "guess for fr_var" to caller.
2826 * The guess for fr_var is ACTUALLY the growth beyond fr_fix.
2827 * Whatever we do to grow fr_fix or fr_var contributes to our returned value.
2828 * Although it may not be explicit in the frag, pretend fr_var starts with a
2829 * 0 value.
2830 */
2831 int
2832 md_estimate_size_before_relax (fragP, segment)
2833 register fragS *fragP;
2834 register segT segment;
2835 {
2836 register unsigned char *opcode;
2837 register int old_fr_fix;
2838
2839 old_fr_fix = fragP->fr_fix;
2840 opcode = (unsigned char *) fragP->fr_opcode;
2841 /* We've already got fragP->fr_subtype right; all we have to do is
2842 check for un-relaxable symbols. */
2843 if (S_GET_SEGMENT (fragP->fr_symbol) != segment)
2844 {
2845 /* symbol is undefined in this segment */
2846 int code16 = fragP->fr_subtype & CODE16;
2847 int size = code16 ? 2 : 4;
2848 int pcrel_reloc = code16 ? BFD_RELOC_16_PCREL : BFD_RELOC_32_PCREL;
2849
2850 switch (opcode[0])
2851 {
2852 case JUMP_PC_RELATIVE: /* make jmp (0xeb) a dword displacement jump */
2853 opcode[0] = 0xe9; /* dword disp jmp */
2854 fragP->fr_fix += size;
2855 fix_new (fragP, old_fr_fix, size,
2856 fragP->fr_symbol,
2857 fragP->fr_offset, 1,
2858 (GOT_symbol && /* Not quite right - we should switch on
2859 presence of @PLT, but I cannot see how
2860 to get to that from here. We should have
2861 done this in md_assemble to really
2862 get it right all of the time, but I
2863 think it does not matter that much, as
2864 this will be right most of the time. ERY*/
2865 S_GET_SEGMENT(fragP->fr_symbol) == undefined_section)
2866 ? BFD_RELOC_386_PLT32 : pcrel_reloc);
2867 break;
2868
2869 default:
2870 /* This changes the byte-displacement jump 0x7N -->
2871 the dword-displacement jump 0x0f8N */
2872 opcode[1] = opcode[0] + 0x10;
2873 opcode[0] = TWO_BYTE_OPCODE_ESCAPE; /* two-byte escape */
2874 fragP->fr_fix += 1 + size; /* we've added an opcode byte */
2875 fix_new (fragP, old_fr_fix + 1, size,
2876 fragP->fr_symbol,
2877 fragP->fr_offset, 1,
2878 (GOT_symbol && /* Not quite right - we should switch on
2879 presence of @PLT, but I cannot see how
2880 to get to that from here. ERY */
2881 S_GET_SEGMENT(fragP->fr_symbol) == undefined_section)
2882 ? BFD_RELOC_386_PLT32 : pcrel_reloc);
2883 break;
2884 }
2885 frag_wane (fragP);
2886 }
2887 return (fragP->fr_var + fragP->fr_fix - old_fr_fix);
2888 } /* md_estimate_size_before_relax() */
2889 \f
2890 /*
2891 * md_convert_frag();
2892 *
2893 * Called after relax() is finished.
2894 * In: Address of frag.
2895 * fr_type == rs_machine_dependent.
2896 * fr_subtype is what the address relaxed to.
2897 *
2898 * Out: Any fixSs and constants are set up.
2899 * Caller will turn frag into a ".space 0".
2900 */
2901 #ifndef BFD_ASSEMBLER
2902 void
2903 md_convert_frag (headers, sec, fragP)
2904 object_headers *headers;
2905 segT sec;
2906 register fragS *fragP;
2907 #else
2908 void
2909 md_convert_frag (abfd, sec, fragP)
2910 bfd *abfd;
2911 segT sec;
2912 register fragS *fragP;
2913 #endif
2914 {
2915 register unsigned char *opcode;
2916 unsigned char *where_to_put_displacement = NULL;
2917 unsigned int target_address;
2918 unsigned int opcode_address;
2919 unsigned int extension = 0;
2920 int displacement_from_opcode_start;
2921
2922 opcode = (unsigned char *) fragP->fr_opcode;
2923
2924 /* Address we want to reach in file space. */
2925 target_address = S_GET_VALUE (fragP->fr_symbol) + fragP->fr_offset;
2926 #ifdef BFD_ASSEMBLER /* not needed otherwise? */
2927 target_address += fragP->fr_symbol->sy_frag->fr_address;
2928 #endif
2929
2930 /* Address opcode resides at in file space. */
2931 opcode_address = fragP->fr_address + fragP->fr_fix;
2932
2933 /* Displacement from opcode start to fill into instruction. */
2934 displacement_from_opcode_start = target_address - opcode_address;
2935
2936 switch (fragP->fr_subtype)
2937 {
2938 case ENCODE_RELAX_STATE (COND_JUMP, SMALL):
2939 case ENCODE_RELAX_STATE (COND_JUMP, SMALL16):
2940 case ENCODE_RELAX_STATE (UNCOND_JUMP, SMALL):
2941 case ENCODE_RELAX_STATE (UNCOND_JUMP, SMALL16):
2942 /* don't have to change opcode */
2943 extension = 1; /* 1 opcode + 1 displacement */
2944 where_to_put_displacement = &opcode[1];
2945 break;
2946
2947 case ENCODE_RELAX_STATE (COND_JUMP, BIG):
2948 extension = 5; /* 2 opcode + 4 displacement */
2949 opcode[1] = opcode[0] + 0x10;
2950 opcode[0] = TWO_BYTE_OPCODE_ESCAPE;
2951 where_to_put_displacement = &opcode[2];
2952 break;
2953
2954 case ENCODE_RELAX_STATE (UNCOND_JUMP, BIG):
2955 extension = 4; /* 1 opcode + 4 displacement */
2956 opcode[0] = 0xe9;
2957 where_to_put_displacement = &opcode[1];
2958 break;
2959
2960 case ENCODE_RELAX_STATE (COND_JUMP, BIG16):
2961 extension = 3; /* 2 opcode + 2 displacement */
2962 opcode[1] = opcode[0] + 0x10;
2963 opcode[0] = TWO_BYTE_OPCODE_ESCAPE;
2964 where_to_put_displacement = &opcode[2];
2965 break;
2966
2967 case ENCODE_RELAX_STATE (UNCOND_JUMP, BIG16):
2968 extension = 2; /* 1 opcode + 2 displacement */
2969 opcode[0] = 0xe9;
2970 where_to_put_displacement = &opcode[1];
2971 break;
2972
2973 default:
2974 BAD_CASE (fragP->fr_subtype);
2975 break;
2976 }
2977 /* now put displacement after opcode */
2978 md_number_to_chars ((char *) where_to_put_displacement,
2979 (valueT) (displacement_from_opcode_start - extension),
2980 SIZE_FROM_RELAX_STATE (fragP->fr_subtype));
2981 fragP->fr_fix += extension;
2982 }
2983 \f
2984
2985 int md_short_jump_size = 2; /* size of byte displacement jmp */
2986 int md_long_jump_size = 5; /* size of dword displacement jmp */
2987 const int md_reloc_size = 8; /* Size of relocation record */
2988
2989 void
2990 md_create_short_jump (ptr, from_addr, to_addr, frag, to_symbol)
2991 char *ptr;
2992 addressT from_addr, to_addr;
2993 fragS *frag;
2994 symbolS *to_symbol;
2995 {
2996 long offset;
2997
2998 offset = to_addr - (from_addr + 2);
2999 md_number_to_chars (ptr, (valueT) 0xeb, 1); /* opcode for byte-disp jump */
3000 md_number_to_chars (ptr + 1, (valueT) offset, 1);
3001 }
3002
3003 void
3004 md_create_long_jump (ptr, from_addr, to_addr, frag, to_symbol)
3005 char *ptr;
3006 addressT from_addr, to_addr;
3007 fragS *frag;
3008 symbolS *to_symbol;
3009 {
3010 long offset;
3011
3012 if (flag_do_long_jump)
3013 {
3014 offset = to_addr - S_GET_VALUE (to_symbol);
3015 md_number_to_chars (ptr, (valueT) 0xe9, 1);/* opcode for long jmp */
3016 md_number_to_chars (ptr + 1, (valueT) offset, 4);
3017 fix_new (frag, (ptr + 1) - frag->fr_literal, 4,
3018 to_symbol, (offsetT) 0, 0, BFD_RELOC_32);
3019 }
3020 else
3021 {
3022 offset = to_addr - (from_addr + 5);
3023 md_number_to_chars (ptr, (valueT) 0xe9, 1);
3024 md_number_to_chars (ptr + 1, (valueT) offset, 4);
3025 }
3026 }
3027 \f
3028 /* Apply a fixup (fixS) to segment data, once it has been determined
3029 by our caller that we have all the info we need to fix it up.
3030
3031 On the 386, immediates, displacements, and data pointers are all in
3032 the same (little-endian) format, so we don't need to care about which
3033 we are handling. */
3034
3035 int
3036 md_apply_fix3 (fixP, valp, seg)
3037 fixS *fixP; /* The fix we're to put in. */
3038 valueT *valp; /* Pointer to the value of the bits. */
3039 segT seg; /* Segment fix is from. */
3040 {
3041 register char *p = fixP->fx_where + fixP->fx_frag->fr_literal;
3042 valueT value = *valp;
3043
3044 if (fixP->fx_r_type == BFD_RELOC_32 && fixP->fx_pcrel)
3045 fixP->fx_r_type = BFD_RELOC_32_PCREL;
3046
3047 #if defined (BFD_ASSEMBLER) && !defined (TE_Mach)
3048 /*
3049 * This is a hack. There should be a better way to
3050 * handle this.
3051 */
3052 if (fixP->fx_r_type == BFD_RELOC_32_PCREL && fixP->fx_addsy)
3053 {
3054 #ifndef OBJ_AOUT
3055 if (OUTPUT_FLAVOR == bfd_target_elf_flavour
3056 || OUTPUT_FLAVOR == bfd_target_coff_flavour)
3057 value += fixP->fx_where + fixP->fx_frag->fr_address;
3058 #endif
3059 #if defined (OBJ_ELF) || defined (OBJ_MAYBE_ELF)
3060 if (OUTPUT_FLAVOR == bfd_target_elf_flavour
3061 && (S_GET_SEGMENT (fixP->fx_addsy) == seg
3062 || (fixP->fx_addsy->bsym->flags & BSF_SECTION_SYM) != 0)
3063 && ! S_IS_EXTERNAL (fixP->fx_addsy)
3064 && ! S_IS_WEAK (fixP->fx_addsy)
3065 && S_IS_DEFINED (fixP->fx_addsy)
3066 && ! S_IS_COMMON (fixP->fx_addsy))
3067 {
3068 /* Yes, we add the values in twice. This is because
3069 bfd_perform_relocation subtracts them out again. I think
3070 bfd_perform_relocation is broken, but I don't dare change
3071 it. FIXME. */
3072 value += fixP->fx_where + fixP->fx_frag->fr_address;
3073 }
3074 #endif
3075 #if defined (OBJ_COFF) && defined (TE_PE)
3076 /* For some reason, the PE format does not store a section
3077 address offset for a PC relative symbol. */
3078 if (S_GET_SEGMENT (fixP->fx_addsy) != seg)
3079 value += md_pcrel_from (fixP);
3080 #endif
3081 }
3082
3083 /* Fix a few things - the dynamic linker expects certain values here,
3084 and we must not dissappoint it. */
3085 #if defined (OBJ_ELF) || defined (OBJ_MAYBE_ELF)
3086 if (OUTPUT_FLAVOR == bfd_target_elf_flavour
3087 && fixP->fx_addsy)
3088 switch (fixP->fx_r_type) {
3089 case BFD_RELOC_386_PLT32:
3090 /* Make the jump instruction point to the address of the operand. At
3091 runtime we merely add the offset to the actual PLT entry. */
3092 value = 0xfffffffc;
3093 break;
3094 case BFD_RELOC_386_GOTPC:
3095 /*
3096 * This is tough to explain. We end up with this one if we have
3097 * operands that look like "_GLOBAL_OFFSET_TABLE_+[.-.L284]". The goal
3098 * here is to obtain the absolute address of the GOT, and it is strongly
3099 * preferable from a performance point of view to avoid using a runtime
3100 * relocation for this. The actual sequence of instructions often look
3101 * something like:
3102 *
3103 * call .L66
3104 * .L66:
3105 * popl %ebx
3106 * addl $_GLOBAL_OFFSET_TABLE_+[.-.L66],%ebx
3107 *
3108 * The call and pop essentially return the absolute address of
3109 * the label .L66 and store it in %ebx. The linker itself will
3110 * ultimately change the first operand of the addl so that %ebx points to
3111 * the GOT, but to keep things simple, the .o file must have this operand
3112 * set so that it generates not the absolute address of .L66, but the
3113 * absolute address of itself. This allows the linker itself simply
3114 * treat a GOTPC relocation as asking for a pcrel offset to the GOT to be
3115 * added in, and the addend of the relocation is stored in the operand
3116 * field for the instruction itself.
3117 *
3118 * Our job here is to fix the operand so that it would add the correct
3119 * offset so that %ebx would point to itself. The thing that is tricky is
3120 * that .-.L66 will point to the beginning of the instruction, so we need
3121 * to further modify the operand so that it will point to itself.
3122 * There are other cases where you have something like:
3123 *
3124 * .long $_GLOBAL_OFFSET_TABLE_+[.-.L66]
3125 *
3126 * and here no correction would be required. Internally in the assembler
3127 * we treat operands of this form as not being pcrel since the '.' is
3128 * explicitly mentioned, and I wonder whether it would simplify matters
3129 * to do it this way. Who knows. In earlier versions of the PIC patches,
3130 * the pcrel_adjust field was used to store the correction, but since the
3131 * expression is not pcrel, I felt it would be confusing to do it this way.
3132 */
3133 value -= 1;
3134 break;
3135 case BFD_RELOC_386_GOT32:
3136 value = 0; /* Fully resolved at runtime. No addend. */
3137 break;
3138 case BFD_RELOC_386_GOTOFF:
3139 break;
3140
3141 default:
3142 break;
3143 }
3144 #endif
3145
3146 #endif
3147 md_number_to_chars (p, value, fixP->fx_size);
3148
3149 return 1;
3150 }
3151
3152 #if 0
3153 /* This is never used. */
3154 long /* Knows about the byte order in a word. */
3155 md_chars_to_number (con, nbytes)
3156 unsigned char con[]; /* Low order byte 1st. */
3157 int nbytes; /* Number of bytes in the input. */
3158 {
3159 long retval;
3160 for (retval = 0, con += nbytes - 1; nbytes--; con--)
3161 {
3162 retval <<= BITS_PER_CHAR;
3163 retval |= *con;
3164 }
3165 return retval;
3166 }
3167 #endif /* 0 */
3168 \f
3169
3170 #define MAX_LITTLENUMS 6
3171
3172 /* Turn the string pointed to by litP into a floating point constant of type
3173 type, and emit the appropriate bytes. The number of LITTLENUMS emitted
3174 is stored in *sizeP . An error message is returned, or NULL on OK. */
3175 char *
3176 md_atof (type, litP, sizeP)
3177 char type;
3178 char *litP;
3179 int *sizeP;
3180 {
3181 int prec;
3182 LITTLENUM_TYPE words[MAX_LITTLENUMS];
3183 LITTLENUM_TYPE *wordP;
3184 char *t;
3185
3186 switch (type)
3187 {
3188 case 'f':
3189 case 'F':
3190 prec = 2;
3191 break;
3192
3193 case 'd':
3194 case 'D':
3195 prec = 4;
3196 break;
3197
3198 case 'x':
3199 case 'X':
3200 prec = 5;
3201 break;
3202
3203 default:
3204 *sizeP = 0;
3205 return _("Bad call to md_atof ()");
3206 }
3207 t = atof_ieee (input_line_pointer, type, words);
3208 if (t)
3209 input_line_pointer = t;
3210
3211 *sizeP = prec * sizeof (LITTLENUM_TYPE);
3212 /* This loops outputs the LITTLENUMs in REVERSE order; in accord with
3213 the bigendian 386. */
3214 for (wordP = words + prec - 1; prec--;)
3215 {
3216 md_number_to_chars (litP, (valueT) (*wordP--), sizeof (LITTLENUM_TYPE));
3217 litP += sizeof (LITTLENUM_TYPE);
3218 }
3219 return 0;
3220 }
3221 \f
3222 char output_invalid_buf[8];
3223
3224 static char *
3225 output_invalid (c)
3226 char c;
3227 {
3228 if (isprint (c))
3229 sprintf (output_invalid_buf, "'%c'", c);
3230 else
3231 sprintf (output_invalid_buf, "(0x%x)", (unsigned) c);
3232 return output_invalid_buf;
3233 }
3234
3235 /* REG_STRING starts *before* REGISTER_PREFIX. */
3236
3237 static const reg_entry *
3238 parse_register (reg_string, end_op)
3239 char *reg_string;
3240 char **end_op;
3241 {
3242 register char *s = reg_string;
3243 register char *p;
3244 char reg_name_given[MAX_REG_NAME_SIZE + 1];
3245 const reg_entry *r;
3246
3247 /* Skip REGISTER_PREFIX and possible whitespace. */
3248 ++s;
3249 if (is_space_char (*s))
3250 ++s;
3251
3252 p = reg_name_given;
3253 while ((*p++ = register_chars[(unsigned char) *s++]) != '\0')
3254 {
3255 if (p >= reg_name_given + MAX_REG_NAME_SIZE)
3256 {
3257 *p = '\0';
3258 as_bad (_("bad register name `%s'"), reg_name_given);
3259 return (const reg_entry *) NULL;
3260 }
3261 }
3262
3263 *end_op = s - 1;
3264
3265 r = (const reg_entry *) hash_find (reg_hash, reg_name_given);
3266
3267 if (r == NULL)
3268 {
3269 as_bad (_("bad register name `%s'"), reg_name_given);
3270 return (const reg_entry *) NULL;
3271 }
3272
3273 return r;
3274 }
3275 \f
3276 #ifdef OBJ_ELF
3277 CONST char *md_shortopts = "kmVQ:";
3278 #else
3279 CONST char *md_shortopts = "m";
3280 #endif
3281 struct option md_longopts[] = {
3282 {NULL, no_argument, NULL, 0}
3283 };
3284 size_t md_longopts_size = sizeof (md_longopts);
3285
3286 int
3287 md_parse_option (c, arg)
3288 int c;
3289 char *arg;
3290 {
3291 switch (c)
3292 {
3293 case 'm':
3294 flag_do_long_jump = 1;
3295 break;
3296
3297 #if defined (OBJ_ELF) || defined (OBJ_MAYBE_ELF)
3298 /* -k: Ignore for FreeBSD compatibility. */
3299 case 'k':
3300 break;
3301
3302 /* -V: SVR4 argument to print version ID. */
3303 case 'V':
3304 print_version_id ();
3305 break;
3306
3307 /* -Qy, -Qn: SVR4 arguments controlling whether a .comment section
3308 should be emitted or not. FIXME: Not implemented. */
3309 case 'Q':
3310 break;
3311 #endif
3312
3313 default:
3314 return 0;
3315 }
3316 return 1;
3317 }
3318
3319 void
3320 md_show_usage (stream)
3321 FILE *stream;
3322 {
3323 fprintf (stream, _("\
3324 -m do long jump\n"));
3325 }
3326
3327 #ifdef BFD_ASSEMBLER
3328 #ifdef OBJ_MAYBE_ELF
3329 #ifdef OBJ_MAYBE_COFF
3330
3331 /* Pick the target format to use. */
3332
3333 const char *
3334 i386_target_format ()
3335 {
3336 switch (OUTPUT_FLAVOR)
3337 {
3338 case bfd_target_coff_flavour:
3339 return "coff-i386";
3340 case bfd_target_elf_flavour:
3341 return "elf32-i386";
3342 default:
3343 abort ();
3344 return NULL;
3345 }
3346 }
3347
3348 #endif /* OBJ_MAYBE_COFF */
3349 #endif /* OBJ_MAYBE_ELF */
3350 #endif /* BFD_ASSEMBLER */
3351 \f
3352 /* ARGSUSED */
3353 symbolS *
3354 md_undefined_symbol (name)
3355 char *name;
3356 {
3357 if (*name == '_' && *(name+1) == 'G'
3358 && strcmp(name, GLOBAL_OFFSET_TABLE_NAME) == 0)
3359 {
3360 if (!GOT_symbol)
3361 {
3362 if (symbol_find (name))
3363 as_bad (_("GOT already in symbol table"));
3364 GOT_symbol = symbol_new (name, undefined_section,
3365 (valueT) 0, &zero_address_frag);
3366 };
3367 return GOT_symbol;
3368 }
3369 return 0;
3370 }
3371
3372 /* Round up a section size to the appropriate boundary. */
3373 valueT
3374 md_section_align (segment, size)
3375 segT segment;
3376 valueT size;
3377 {
3378 #ifdef OBJ_AOUT
3379 #ifdef BFD_ASSEMBLER
3380 /* For a.out, force the section size to be aligned. If we don't do
3381 this, BFD will align it for us, but it will not write out the
3382 final bytes of the section. This may be a bug in BFD, but it is
3383 easier to fix it here since that is how the other a.out targets
3384 work. */
3385 int align;
3386
3387 align = bfd_get_section_alignment (stdoutput, segment);
3388 size = ((size + (1 << align) - 1) & ((valueT) -1 << align));
3389 #endif
3390 #endif
3391
3392 return size;
3393 }
3394
3395 /* On the i386, PC-relative offsets are relative to the start of the
3396 next instruction. That is, the address of the offset, plus its
3397 size, since the offset is always the last part of the insn. */
3398
3399 long
3400 md_pcrel_from (fixP)
3401 fixS *fixP;
3402 {
3403 return fixP->fx_size + fixP->fx_where + fixP->fx_frag->fr_address;
3404 }
3405
3406 #ifndef I386COFF
3407
3408 static void
3409 s_bss (ignore)
3410 int ignore;
3411 {
3412 register int temp;
3413
3414 temp = get_absolute_expression ();
3415 subseg_set (bss_section, (subsegT) temp);
3416 demand_empty_rest_of_line ();
3417 }
3418
3419 #endif
3420
3421
3422 #ifdef BFD_ASSEMBLER
3423
3424 void
3425 i386_validate_fix (fixp)
3426 fixS *fixp;
3427 {
3428 if (fixp->fx_subsy && fixp->fx_subsy == GOT_symbol)
3429 {
3430 fixp->fx_r_type = BFD_RELOC_386_GOTOFF;
3431 fixp->fx_subsy = 0;
3432 }
3433 }
3434
3435 #define F(SZ,PCREL) (((SZ) << 1) + (PCREL))
3436 #define MAP(SZ,PCREL,TYPE) case F(SZ,PCREL): code = (TYPE); break
3437
3438 arelent *
3439 tc_gen_reloc (section, fixp)
3440 asection *section;
3441 fixS *fixp;
3442 {
3443 arelent *rel;
3444 bfd_reloc_code_real_type code;
3445
3446 switch (fixp->fx_r_type)
3447 {
3448 case BFD_RELOC_386_PLT32:
3449 case BFD_RELOC_386_GOT32:
3450 case BFD_RELOC_386_GOTOFF:
3451 case BFD_RELOC_386_GOTPC:
3452 case BFD_RELOC_RVA:
3453 code = fixp->fx_r_type;
3454 break;
3455 default:
3456 switch (F (fixp->fx_size, fixp->fx_pcrel))
3457 {
3458 MAP (1, 0, BFD_RELOC_8);
3459 MAP (2, 0, BFD_RELOC_16);
3460 MAP (4, 0, BFD_RELOC_32);
3461 MAP (1, 1, BFD_RELOC_8_PCREL);
3462 MAP (2, 1, BFD_RELOC_16_PCREL);
3463 MAP (4, 1, BFD_RELOC_32_PCREL);
3464 default:
3465 if (fixp->fx_pcrel)
3466 as_bad (_("Can not do %d byte pc-relative relocation"),
3467 fixp->fx_size);
3468 else
3469 as_bad (_("Can not do %d byte relocation"), fixp->fx_size);
3470 code = BFD_RELOC_32;
3471 break;
3472 }
3473 break;
3474 }
3475 #undef MAP
3476 #undef F
3477
3478 if (code == BFD_RELOC_32
3479 && GOT_symbol
3480 && fixp->fx_addsy == GOT_symbol)
3481 code = BFD_RELOC_386_GOTPC;
3482
3483 rel = (arelent *) xmalloc (sizeof (arelent));
3484 rel->sym_ptr_ptr = &fixp->fx_addsy->bsym;
3485 rel->address = fixp->fx_frag->fr_address + fixp->fx_where;
3486 if (fixp->fx_pcrel)
3487 rel->addend = fixp->fx_addnumber;
3488 else
3489 rel->addend = 0;
3490
3491 rel->howto = bfd_reloc_type_lookup (stdoutput, code);
3492 if (rel->howto == NULL)
3493 {
3494 as_bad_where (fixp->fx_file, fixp->fx_line,
3495 _("Cannot represent relocation type %s"),
3496 bfd_get_reloc_code_name (code));
3497 /* Set howto to a garbage value so that we can keep going. */
3498 rel->howto = bfd_reloc_type_lookup (stdoutput, BFD_RELOC_32);
3499 assert (rel->howto != NULL);
3500 }
3501
3502 return rel;
3503 }
3504
3505 #else /* ! BFD_ASSEMBLER */
3506
3507 #if (defined(OBJ_AOUT) | defined(OBJ_BOUT))
3508 void
3509 tc_aout_fix_to_chars (where, fixP, segment_address_in_file)
3510 char *where;
3511 fixS *fixP;
3512 relax_addressT segment_address_in_file;
3513 {
3514 /*
3515 * In: length of relocation (or of address) in chars: 1, 2 or 4.
3516 * Out: GNU LD relocation length code: 0, 1, or 2.
3517 */
3518
3519 static const unsigned char nbytes_r_length[] = {42, 0, 1, 42, 2};
3520 long r_symbolnum;
3521
3522 know (fixP->fx_addsy != NULL);
3523
3524 md_number_to_chars (where,
3525 (valueT) (fixP->fx_frag->fr_address
3526 + fixP->fx_where - segment_address_in_file),
3527 4);
3528
3529 r_symbolnum = (S_IS_DEFINED (fixP->fx_addsy)
3530 ? S_GET_TYPE (fixP->fx_addsy)
3531 : fixP->fx_addsy->sy_number);
3532
3533 where[6] = (r_symbolnum >> 16) & 0x0ff;
3534 where[5] = (r_symbolnum >> 8) & 0x0ff;
3535 where[4] = r_symbolnum & 0x0ff;
3536 where[7] = ((((!S_IS_DEFINED (fixP->fx_addsy)) << 3) & 0x08)
3537 | ((nbytes_r_length[fixP->fx_size] << 1) & 0x06)
3538 | (((fixP->fx_pcrel << 0) & 0x01) & 0x0f));
3539 }
3540
3541 #endif /* OBJ_AOUT or OBJ_BOUT */
3542
3543 #if defined (I386COFF)
3544
3545 short
3546 tc_coff_fix2rtype (fixP)
3547 fixS *fixP;
3548 {
3549 if (fixP->fx_r_type == R_IMAGEBASE)
3550 return R_IMAGEBASE;
3551
3552 return (fixP->fx_pcrel ?
3553 (fixP->fx_size == 1 ? R_PCRBYTE :
3554 fixP->fx_size == 2 ? R_PCRWORD :
3555 R_PCRLONG) :
3556 (fixP->fx_size == 1 ? R_RELBYTE :
3557 fixP->fx_size == 2 ? R_RELWORD :
3558 R_DIR32));
3559 }
3560
3561 int
3562 tc_coff_sizemachdep (frag)
3563 fragS *frag;
3564 {
3565 if (frag->fr_next)
3566 return (frag->fr_next->fr_address - frag->fr_address);
3567 else
3568 return 0;
3569 }
3570
3571 #endif /* I386COFF */
3572
3573 #endif /* BFD_ASSEMBLER? */
3574 \f
3575 /* end of tc-i386.c */