* config/tc-mn10300.c (mn10300_insert_operand): Provide prototype
[deliverable/binutils-gdb.git] / gas / config / tc-mn10300.c
1 /* tc-mn10300.c -- Assembler code for the Matsushita 10300
2
3 Copyright (C) 1996 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
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
21
22 #include <stdio.h>
23 #include <ctype.h>
24 #include "as.h"
25 #include "subsegs.h"
26 #include "opcode/mn10300.h"
27 \f
28 /* Structure to hold information about predefined registers. */
29 struct reg_name
30 {
31 const char *name;
32 int value;
33 };
34
35 /* Generic assembler global variables which must be defined by all targets. */
36
37 /* Characters which always start a comment. */
38 const char comment_chars[] = "#";
39
40 /* Characters which start a comment at the beginning of a line. */
41 const char line_comment_chars[] = ";#";
42
43 /* Characters which may be used to separate multiple commands on a
44 single line. */
45 const char line_separator_chars[] = ";";
46
47 /* Characters which are used to indicate an exponent in a floating
48 point number. */
49 const char EXP_CHARS[] = "eE";
50
51 /* Characters which mean that a number is a floating point constant,
52 as in 0d1.0. */
53 const char FLT_CHARS[] = "dD";
54 \f
55
56 /* local functions */
57 static void mn10300_insert_operand PARAMS ((unsigned long *, unsigned long *,
58 const struct mn10300_operand *,
59 offsetT, char *, unsigned,
60 unsigned));
61 static unsigned long check_operand PARAMS ((unsigned long,
62 const struct mn10300_operand *,
63 offsetT));
64 static int reg_name_search PARAMS ((const struct reg_name *, int, const char *));
65 static boolean register_name PARAMS ((expressionS *expressionP));
66 static boolean system_register_name PARAMS ((expressionS *expressionP));
67 static boolean cc_name PARAMS ((expressionS *expressionP));
68
69
70 /* fixups */
71 #define MAX_INSN_FIXUPS (5)
72 struct mn10300_fixup
73 {
74 expressionS exp;
75 int opindex;
76 bfd_reloc_code_real_type reloc;
77 };
78 struct mn10300_fixup fixups[MAX_INSN_FIXUPS];
79 static int fc;
80 \f
81 const char *md_shortopts = "";
82 struct option md_longopts[] = {
83 {NULL, no_argument, NULL, 0}
84 };
85 size_t md_longopts_size = sizeof(md_longopts);
86
87 /* The target specific pseudo-ops which we support. */
88 const pseudo_typeS md_pseudo_table[] =
89 {
90 { NULL, NULL, 0 }
91 };
92
93 /* Opcode hash table. */
94 static struct hash_control *mn10300_hash;
95
96 /* This table is sorted. Suitable for searching by a binary search. */
97 static const struct reg_name data_registers[] =
98 {
99 { "d0", 0 },
100 { "d1", 1 },
101 { "d2", 2 },
102 { "d3", 3 },
103 };
104 #define DATA_REG_NAME_CNT (sizeof(data_registers) / sizeof(struct reg_name))
105
106 static const struct reg_name address_registers[] =
107 {
108 { "a0", 0 },
109 { "a1", 1 },
110 { "a2", 2 },
111 { "a3", 3 },
112 };
113 #define ADDRESS_REG_NAME_CNT (sizeof(address_registers) / sizeof(struct reg_name))
114
115 static const struct reg_name other_registers[] =
116 {
117 { "mdr", 0 },
118 { "psw", 0 },
119 { "sp", 0 },
120 };
121 #define OTHER_REG_NAME_CNT (sizeof(other_registers) / sizeof(struct reg_name))
122
123 /* reg_name_search does a binary search of the given register table
124 to see if "name" is a valid regiter name. Returns the register
125 number from the array on success, or -1 on failure. */
126
127 static int
128 reg_name_search (regs, regcount, name)
129 const struct reg_name *regs;
130 int regcount;
131 const char *name;
132 {
133 int middle, low, high;
134 int cmp;
135
136 low = 0;
137 high = regcount - 1;
138
139 do
140 {
141 middle = (low + high) / 2;
142 cmp = strcasecmp (name, regs[middle].name);
143 if (cmp < 0)
144 high = middle - 1;
145 else if (cmp > 0)
146 low = middle + 1;
147 else
148 return regs[middle].value;
149 }
150 while (low <= high);
151 return -1;
152 }
153
154
155 /* Summary of register_name().
156 *
157 * in: Input_line_pointer points to 1st char of operand.
158 *
159 * out: A expressionS.
160 * The operand may have been a register: in this case, X_op == O_register,
161 * X_add_number is set to the register number, and truth is returned.
162 * Input_line_pointer->(next non-blank) char after operand, or is in
163 * its original state.
164 */
165 static boolean
166 data_register_name (expressionP)
167 expressionS *expressionP;
168 {
169 int reg_number;
170 char *name;
171 char *start;
172 char c;
173
174 /* Find the spelling of the operand */
175 start = name = input_line_pointer;
176
177 c = get_symbol_end ();
178 reg_number = reg_name_search (data_registers, DATA_REG_NAME_CNT, name);
179
180 /* look to see if it's in the register table */
181 if (reg_number >= 0)
182 {
183 expressionP->X_op = O_register;
184 expressionP->X_add_number = reg_number;
185
186 /* make the rest nice */
187 expressionP->X_add_symbol = NULL;
188 expressionP->X_op_symbol = NULL;
189 *input_line_pointer = c; /* put back the delimiting char */
190 return true;
191 }
192 else
193 {
194 /* reset the line as if we had not done anything */
195 *input_line_pointer = c; /* put back the delimiting char */
196 input_line_pointer = start; /* reset input_line pointer */
197 return false;
198 }
199 }
200
201 /* Summary of register_name().
202 *
203 * in: Input_line_pointer points to 1st char of operand.
204 *
205 * out: A expressionS.
206 * The operand may have been a register: in this case, X_op == O_register,
207 * X_add_number is set to the register number, and truth is returned.
208 * Input_line_pointer->(next non-blank) char after operand, or is in
209 * its original state.
210 */
211 static boolean
212 address_register_name (expressionP)
213 expressionS *expressionP;
214 {
215 int reg_number;
216 char *name;
217 char *start;
218 char c;
219
220 /* Find the spelling of the operand */
221 start = name = input_line_pointer;
222
223 c = get_symbol_end ();
224 reg_number = reg_name_search (address_registers, ADDRESS_REG_NAME_CNT, name);
225
226 /* look to see if it's in the register table */
227 if (reg_number >= 0)
228 {
229 expressionP->X_op = O_register;
230 expressionP->X_add_number = reg_number;
231
232 /* make the rest nice */
233 expressionP->X_add_symbol = NULL;
234 expressionP->X_op_symbol = NULL;
235 *input_line_pointer = c; /* put back the delimiting char */
236 return true;
237 }
238 else
239 {
240 /* reset the line as if we had not done anything */
241 *input_line_pointer = c; /* put back the delimiting char */
242 input_line_pointer = start; /* reset input_line pointer */
243 return false;
244 }
245 }
246
247 /* Summary of register_name().
248 *
249 * in: Input_line_pointer points to 1st char of operand.
250 *
251 * out: A expressionS.
252 * The operand may have been a register: in this case, X_op == O_register,
253 * X_add_number is set to the register number, and truth is returned.
254 * Input_line_pointer->(next non-blank) char after operand, or is in
255 * its original state.
256 */
257 static boolean
258 other_register_name (expressionP)
259 expressionS *expressionP;
260 {
261 int reg_number;
262 char *name;
263 char *start;
264 char c;
265
266 /* Find the spelling of the operand */
267 start = name = input_line_pointer;
268
269 c = get_symbol_end ();
270 reg_number = reg_name_search (other_registers, OTHER_REG_NAME_CNT, name);
271
272 /* look to see if it's in the register table */
273 if (reg_number >= 0)
274 {
275 expressionP->X_op = O_register;
276 expressionP->X_add_number = reg_number;
277
278 /* make the rest nice */
279 expressionP->X_add_symbol = NULL;
280 expressionP->X_op_symbol = NULL;
281 *input_line_pointer = c; /* put back the delimiting char */
282 return true;
283 }
284 else
285 {
286 /* reset the line as if we had not done anything */
287 *input_line_pointer = c; /* put back the delimiting char */
288 input_line_pointer = start; /* reset input_line pointer */
289 return false;
290 }
291 }
292
293 void
294 md_show_usage (stream)
295 FILE *stream;
296 {
297 fprintf(stream, "MN10300 options:\n\
298 none yet\n");
299 }
300
301 int
302 md_parse_option (c, arg)
303 int c;
304 char *arg;
305 {
306 return 0;
307 }
308
309 symbolS *
310 md_undefined_symbol (name)
311 char *name;
312 {
313 return 0;
314 }
315
316 char *
317 md_atof (type, litp, sizep)
318 int type;
319 char *litp;
320 int *sizep;
321 {
322 int prec;
323 LITTLENUM_TYPE words[4];
324 char *t;
325 int i;
326
327 switch (type)
328 {
329 case 'f':
330 prec = 2;
331 break;
332
333 case 'd':
334 prec = 4;
335 break;
336
337 default:
338 *sizep = 0;
339 return "bad call to md_atof";
340 }
341
342 t = atof_ieee (input_line_pointer, type, words);
343 if (t)
344 input_line_pointer = t;
345
346 *sizep = prec * 2;
347
348 for (i = prec - 1; i >= 0; i--)
349 {
350 md_number_to_chars (litp, (valueT) words[i], 2);
351 litp += 2;
352 }
353
354 return NULL;
355 }
356
357
358 void
359 md_convert_frag (abfd, sec, fragP)
360 bfd *abfd;
361 asection *sec;
362 fragS *fragP;
363 {
364 /* printf ("call to md_convert_frag \n"); */
365 abort ();
366 }
367
368 valueT
369 md_section_align (seg, addr)
370 asection *seg;
371 valueT addr;
372 {
373 int align = bfd_get_section_alignment (stdoutput, seg);
374 return ((addr + (1 << align) - 1) & (-1 << align));
375 }
376
377 void
378 md_begin ()
379 {
380 char *prev_name = "";
381 register const struct mn10300_opcode *op;
382
383 mn10300_hash = hash_new();
384
385 /* Insert unique names into hash table. The MN10300 instruction set
386 has many identical opcode names that have different opcodes based
387 on the operands. This hash table then provides a quick index to
388 the first opcode with a particular name in the opcode table. */
389
390 op = mn10300_opcodes;
391 while (op->name)
392 {
393 if (strcmp (prev_name, op->name))
394 {
395 prev_name = (char *) op->name;
396 hash_insert (mn10300_hash, op->name, (char *) op);
397 }
398 op++;
399 }
400 }
401
402 void
403 md_assemble (str)
404 char *str;
405 {
406 char *s;
407 struct mn10300_opcode *opcode;
408 struct mn10300_opcode *next_opcode;
409 const unsigned char *opindex_ptr;
410 int next_opindex;
411 unsigned long insn, extension, size;
412 char *f;
413 int i;
414 int match;
415 bfd_reloc_code_real_type reloc;
416
417 /* Get the opcode. */
418 for (s = str; *s != '\0' && ! isspace (*s); s++)
419 ;
420 if (*s != '\0')
421 *s++ = '\0';
422
423 /* find the first opcode with the proper name */
424 opcode = (struct mn10300_opcode *)hash_find (mn10300_hash, str);
425 if (opcode == NULL)
426 {
427 as_bad ("Unrecognized opcode: `%s'", str);
428 return;
429 }
430
431 str = s;
432 while (isspace (*str))
433 ++str;
434
435 input_line_pointer = str;
436
437 for(;;)
438 {
439 const char *errmsg = NULL;
440 int op_idx;
441 char *hold;
442 int extra_shift = 0;
443
444 fc = 0;
445 match = 0;
446 next_opindex = 0;
447 insn = opcode->opcode;
448 extension = 0;
449 for (op_idx = 1, opindex_ptr = opcode->operands;
450 *opindex_ptr != 0;
451 opindex_ptr++, op_idx++)
452 {
453 const struct mn10300_operand *operand;
454 expressionS ex;
455
456 if (next_opindex == 0)
457 {
458 operand = &mn10300_operands[*opindex_ptr];
459 }
460 else
461 {
462 operand = &mn10300_operands[next_opindex];
463 next_opindex = 0;
464 }
465
466 errmsg = NULL;
467
468 while (*str == ' ' || *str == ',' || *str == '[' || *str == ']')
469 ++str;
470
471 /* Gather the operand. */
472 hold = input_line_pointer;
473 input_line_pointer = str;
474
475 if (operand->flags & MN10300_OPERAND_PAREN)
476 {
477 if (*input_line_pointer != ')' && *input_line_pointer != '(')
478 {
479 input_line_pointer = hold;
480 str = hold;
481 goto error;
482 }
483 input_line_pointer++;
484 goto keep_going;
485 }
486 /* See if we can match the operands. */
487 else if (operand->flags & MN10300_OPERAND_DREG)
488 {
489 if (!data_register_name (&ex))
490 {
491 input_line_pointer = hold;
492 str = hold;
493 goto error;
494 }
495 }
496 else if (operand->flags & MN10300_OPERAND_AREG)
497 {
498 if (!address_register_name (&ex))
499 {
500 input_line_pointer = hold;
501 str = hold;
502 goto error;
503 }
504 }
505 else if (operand->flags & MN10300_OPERAND_SP)
506 {
507 char *start = input_line_pointer;
508 char c = get_symbol_end ();
509
510 if (strcmp (start, "sp") != 0)
511 {
512 *input_line_pointer = c;
513 input_line_pointer = hold;
514 str = hold;
515 goto error;
516 }
517 *input_line_pointer = c;
518 goto keep_going;
519 }
520 else if (operand->flags & MN10300_OPERAND_PSW)
521 {
522 char *start = input_line_pointer;
523 char c = get_symbol_end ();
524
525 if (strcmp (start, "psw") != 0)
526 {
527 *input_line_pointer = c;
528 input_line_pointer = hold;
529 str = hold;
530 goto error;
531 }
532 *input_line_pointer = c;
533 goto keep_going;
534 }
535 else if (operand->flags & MN10300_OPERAND_MDR)
536 {
537 char *start = input_line_pointer;
538 char c = get_symbol_end ();
539
540 if (strcmp (start, "mdr") != 0)
541 {
542 *input_line_pointer = c;
543 input_line_pointer = hold;
544 str = hold;
545 goto error;
546 }
547 *input_line_pointer = c;
548 goto keep_going;
549 }
550 else if (data_register_name (&ex))
551 {
552 input_line_pointer = hold;
553 str = hold;
554 goto error;
555 }
556 else if (address_register_name (&ex))
557 {
558 input_line_pointer = hold;
559 str = hold;
560 goto error;
561 }
562 else if (other_register_name (&ex))
563 {
564 input_line_pointer = hold;
565 str = hold;
566 goto error;
567 }
568 else if (*str == ')' || *str == '(')
569 {
570 input_line_pointer = hold;
571 str = hold;
572 goto error;
573 }
574 else
575 {
576 expression (&ex);
577 }
578
579 switch (ex.X_op)
580 {
581 case O_illegal:
582 errmsg = "illegal operand";
583 goto error;
584 case O_absent:
585 errmsg = "missing operand";
586 goto error;
587 case O_register:
588 if (operand->flags & (MN10300_OPERAND_DREG
589 | MN10300_OPERAND_AREG) == 0)
590 {
591 input_line_pointer = hold;
592 str = hold;
593 goto error;
594 }
595
596 if (opcode->format == FMT_D1 || opcode->format == FMT_S1)
597 extra_shift = 8;
598 else if (opcode->format == FMT_D2 || opcode->format == FMT_D4
599 || opcode->format == FMT_S2 || opcode->format == FMT_S4
600 || opcode->format == FMT_S6 || opcode->format == FMT_D5)
601 extra_shift = 16;
602 else
603 extra_shift = 0;
604
605 mn10300_insert_operand (&insn, &extension, operand,
606 ex.X_add_number, (char *) NULL,
607 0, extra_shift);
608
609 break;
610
611 case O_constant:
612 /* If this operand can be promoted, and it doesn't
613 fit into the allocated bitfield for this insn,
614 then promote it (ie this opcode does not match). */
615 if (operand->flags & MN10300_OPERAND_PROMOTE
616 && ! check_operand (insn, operand, ex.X_add_number))
617 {
618 input_line_pointer = hold;
619 str = hold;
620 goto error;
621 }
622
623 mn10300_insert_operand (&insn, &extension, operand,
624 ex.X_add_number, (char *) NULL,
625 0, 0);
626 break;
627
628 default:
629 /* If this operand can be promoted, then this opcode didn't
630 match since we can't know if it needed promotion! */
631 if (operand->flags & MN10300_OPERAND_PROMOTE)
632 {
633 input_line_pointer = hold;
634 str = hold;
635 goto error;
636 }
637
638 /* We need to generate a fixup for this expression. */
639 if (fc >= MAX_INSN_FIXUPS)
640 as_fatal ("too many fixups");
641 fixups[fc].exp = ex;
642 fixups[fc].opindex = *opindex_ptr;
643 fixups[fc].reloc = BFD_RELOC_UNUSED;
644 ++fc;
645 break;
646 }
647
648 keep_going:
649 str = input_line_pointer;
650 input_line_pointer = hold;
651
652 while (*str == ' ' || *str == ',' || *str == '[' || *str == ']')
653 ++str;
654
655 }
656
657 /* Make sure we used all the operands! */
658 if (*str != ',')
659 match = 1;
660
661 error:
662 if (match == 0)
663 {
664 next_opcode = opcode + 1;
665 if (next_opcode->opcode != 0 && !strcmp(next_opcode->name, opcode->name))
666 {
667 opcode = next_opcode;
668 continue;
669 }
670
671 as_bad ("%s", errmsg);
672 return;
673 }
674 break;
675 }
676
677 while (isspace (*str))
678 ++str;
679
680 if (*str != '\0')
681 as_bad ("junk at end of line: `%s'", str);
682
683 input_line_pointer = str;
684
685 /* Determine the size of the instruction. */
686 if (opcode->format == FMT_S0)
687 size = 1;
688
689 if (opcode->format == FMT_S1 || opcode->format == FMT_D0)
690 size = 2;
691
692 if (opcode->format == FMT_S2 || opcode->format == FMT_D1)
693 size = 3;
694
695 if (opcode->format == FMT_S4)
696 size = 5;
697
698 if (opcode->format == FMT_S6 || opcode->format == FMT_D5)
699 size = 7;
700
701 if (opcode->format == FMT_D2)
702 size = 4;
703
704 if (opcode->format == FMT_D4)
705 size = 6;
706
707 /* Write out the instruction. */
708
709 f = frag_more (size);
710 number_to_chars_bigendian (f, insn, size > 4 ? 4 : size);
711 if (size > 4)
712 number_to_chars_bigendian (f + 4, extension, size - 4);
713 }
714
715
716 /* if while processing a fixup, a reloc really needs to be created */
717 /* then it is done here */
718
719 arelent *
720 tc_gen_reloc (seg, fixp)
721 asection *seg;
722 fixS *fixp;
723 {
724 arelent *reloc;
725 reloc = (arelent *) bfd_alloc_by_size_t (stdoutput, sizeof (arelent));
726 reloc->sym_ptr_ptr = &fixp->fx_addsy->bsym;
727 reloc->address = fixp->fx_frag->fr_address + fixp->fx_where;
728 reloc->howto = bfd_reloc_type_lookup (stdoutput, fixp->fx_r_type);
729 if (reloc->howto == (reloc_howto_type *) NULL)
730 {
731 as_bad_where (fixp->fx_file, fixp->fx_line,
732 "reloc %d not supported by object file format", (int)fixp->fx_r_type);
733 return NULL;
734 }
735 reloc->addend = fixp->fx_addnumber;
736 /* printf("tc_gen_reloc: addr=%x addend=%x\n", reloc->address, reloc->addend); */
737 return reloc;
738 }
739
740 int
741 md_estimate_size_before_relax (fragp, seg)
742 fragS *fragp;
743 asection *seg;
744 {
745 return 0;
746 }
747
748 long
749 md_pcrel_from (fixp)
750 fixS *fixp;
751 {
752 if (fixp->fx_addsy != (symbolS *) NULL && ! S_IS_DEFINED (fixp->fx_addsy))
753 {
754 /* The symbol is undefined. Let the linker figure it out. */
755 return 0;
756 }
757 return fixp->fx_frag->fr_address + fixp->fx_where;
758 }
759
760 int
761 md_apply_fix3 (fixp, valuep, seg)
762 fixS *fixp;
763 valueT *valuep;
764 segT seg;
765 {
766 valueT value;
767 char *where;
768
769 fixp->fx_done = 1;
770 return 0;
771
772 if (fixp->fx_addsy == (symbolS *) NULL)
773 {
774 value = *valuep;
775 fixp->fx_done = 1;
776 }
777 else if (fixp->fx_pcrel)
778 value = *valuep;
779 else
780 {
781 value = fixp->fx_offset;
782 if (fixp->fx_subsy != (symbolS *) NULL)
783 {
784 if (S_GET_SEGMENT (fixp->fx_subsy) == absolute_section)
785 value -= S_GET_VALUE (fixp->fx_subsy);
786 else
787 {
788 /* We don't actually support subtracting a symbol. */
789 as_bad_where (fixp->fx_file, fixp->fx_line,
790 "expression too complex");
791 }
792 }
793 }
794
795 /* printf("md_apply_fix: value=0x%x type=%d\n", value, fixp->fx_r_type); */
796
797 if ((int) fixp->fx_r_type >= (int) BFD_RELOC_UNUSED)
798 {
799 int opindex;
800 const struct mn10300_operand *operand;
801 char *where;
802 unsigned long insn, extension;
803
804 opindex = (int) fixp->fx_r_type - (int) BFD_RELOC_UNUSED;
805 operand = &mn10300_operands[opindex];
806
807 /* Fetch the instruction, insert the fully resolved operand
808 value, and stuff the instruction back again.
809
810 Note the instruction has been stored in little endian
811 format! */
812 where = fixp->fx_frag->fr_literal + fixp->fx_where;
813
814 insn = bfd_getl32((unsigned char *) where);
815 extension = 0;
816 mn10300_insert_operand (&insn, &extension, operand,
817 (offsetT) value, fixp->fx_file,
818 fixp->fx_line, 0);
819 bfd_putl32((bfd_vma) insn, (unsigned char *) where);
820
821 if (fixp->fx_done)
822 {
823 /* Nothing else to do here. */
824 return 1;
825 }
826
827 /* Determine a BFD reloc value based on the operand information.
828 We are only prepared to turn a few of the operands into relocs. */
829
830 {
831 as_bad_where(fixp->fx_file, fixp->fx_line,
832 "unresolved expression that must be resolved");
833 fixp->fx_done = 1;
834 return 1;
835 }
836 }
837 else if (fixp->fx_done)
838 {
839 /* We still have to insert the value into memory! */
840 where = fixp->fx_frag->fr_literal + fixp->fx_where;
841 if (fixp->fx_size == 1)
842 *where = value & 0xff;
843 if (fixp->fx_size == 2)
844 bfd_putl16(value & 0xffff, (unsigned char *) where);
845 if (fixp->fx_size == 4)
846 bfd_putl32(value, (unsigned char *) where);
847 }
848
849 fixp->fx_addnumber = value;
850 return 1;
851 }
852
853 /* Insert an operand value into an instruction. */
854
855 static void
856 mn10300_insert_operand (insnp, extensionp, operand, val, file, line, shift)
857 unsigned long *insnp;
858 unsigned long *extensionp;
859 const struct mn10300_operand *operand;
860 offsetT val;
861 char *file;
862 unsigned int line;
863 unsigned int shift;
864 {
865 /* No need to check 32bit operands for a bit. Note that
866 MN10300_OPERAND_SPLIT is an implicit 32bit operand. */
867 if (operand->bits != 32
868 && (operand->flags & MN10300_OPERAND_SPLIT) == 0)
869 {
870 long min, max;
871 offsetT test;
872
873 if ((operand->flags & MN10300_OPERAND_SIGNED) != 0)
874 {
875 max = (1 << (operand->bits - 1)) - 1;
876 min = - (1 << (operand->bits - 1));
877 }
878 else
879 {
880 max = (1 << operand->bits) - 1;
881 min = 0;
882 }
883
884 test = val;
885
886
887 if (test < (offsetT) min || test > (offsetT) max)
888 {
889 const char *err =
890 "operand out of range (%s not between %ld and %ld)";
891 char buf[100];
892
893 sprint_value (buf, test);
894 if (file == (char *) NULL)
895 as_warn (err, buf, min, max);
896 else
897 as_warn_where (file, line, err, buf, min, max);
898 }
899 }
900
901 if ((operand->flags & MN10300_OPERAND_SPLIT) != 0)
902 {
903 *insnp |= (val >> 32 - operand->bits) & ((1 << operand->bits) - 1);
904 *extensionp |= ((val & ((1 << (32 - operand->bits)) - 1))
905 << operand->shift);
906 }
907 else if ((operand->flags & MN10300_OPERAND_EXTENDED) == 0)
908 {
909 *insnp |= (((long) val & ((1 << operand->bits) - 1))
910 << (operand->shift + shift));
911
912 if ((operand->flags & MN10300_OPERAND_REPEATED) != 0)
913 *insnp |= (((long) val & ((1 << operand->bits) - 1))
914 << (operand->shift + shift + 2));
915 }
916 else
917 {
918 *extensionp |= (((long) val & ((1 << operand->bits) - 1))
919 << (operand->shift + shift));
920
921 if ((operand->flags & MN10300_OPERAND_REPEATED) != 0)
922 *extensionp |= (((long) val & ((1 << operand->bits) - 1))
923 << (operand->shift + shift + 2));
924 }
925 }
926
927 static unsigned long
928 check_operand (insn, operand, val)
929 unsigned long insn;
930 const struct mn10300_operand *operand;
931 offsetT val;
932 {
933 /* No need to check 32bit operands for a bit. Note that
934 MN10300_OPERAND_SPLIT is an implicit 32bit operand. */
935 if (operand->bits != 32
936 && (operand->flags & MN10300_OPERAND_SPLIT) == 0)
937 {
938 long min, max;
939 offsetT test;
940
941 if ((operand->flags & MN10300_OPERAND_SIGNED) != 0)
942 {
943 max = (1 << (operand->bits - 1)) - 1;
944 min = - (1 << (operand->bits - 1));
945 }
946 else
947 {
948 max = (1 << operand->bits) - 1;
949 min = 0;
950 }
951
952 test = val;
953
954
955 if (test < (offsetT) min || test > (offsetT) max)
956 return 0;
957 else
958 return 1;
959 }
960 return 1;
961 }
This page took 0.050858 seconds and 5 git commands to generate.