diff options
author | Nick Clifton <nickc@redhat.com> | 2005-03-24 20:40:28 +0000 |
---|---|---|
committer | Nick Clifton <nickc@redhat.com> | 2005-03-24 20:40:28 +0000 |
commit | ea1562b345338540cf9a3c8fa28fbcb6da78fd3e (patch) | |
tree | 365f693777e612e6f40b668d1ec2d43f6a0c32ac /gas/config/tc-d30v.c | |
parent | 1acfb01b60e3f3e877aff2c05a29997719807696 (diff) | |
download | gdb-ea1562b345338540cf9a3c8fa28fbcb6da78fd3e.zip gdb-ea1562b345338540cf9a3c8fa28fbcb6da78fd3e.tar.gz gdb-ea1562b345338540cf9a3c8fa28fbcb6da78fd3e.tar.bz2 |
Convert unmaintained files over to ISO-C90 and fix formatting.
Diffstat (limited to 'gas/config/tc-d30v.c')
-rw-r--r-- | gas/config/tc-d30v.c | 1605 |
1 files changed, 759 insertions, 846 deletions
diff --git a/gas/config/tc-d30v.c b/gas/config/tc-d30v.c index d24c9e4..5c6b423 100644 --- a/gas/config/tc-d30v.c +++ b/gas/config/tc-d30v.c @@ -25,12 +25,12 @@ #include "subsegs.h" #include "opcode/d30v.h" -const char comment_chars[] = ";"; -const char line_comment_chars[] = "#"; +const char comment_chars[] = ";"; +const char line_comment_chars[] = "#"; const char line_separator_chars[] = ""; -const char *md_shortopts = "OnNcC"; -const char EXP_CHARS[] = "eE"; -const char FLT_CHARS[] = "dD"; +const char *md_shortopts = "OnNcC"; +const char EXP_CHARS[] = "eE"; +const char FLT_CHARS[] = "dD"; #if HAVE_LIMITS_H #include <limits.h> @@ -52,14 +52,15 @@ static int warn_register_name_conflicts = 1; /* EXEC types. */ typedef enum _exec_type { - EXEC_UNKNOWN, /* no order specified */ - EXEC_PARALLEL, /* done in parallel (FM=00) */ - EXEC_SEQ, /* sequential (FM=01) */ - EXEC_REVSEQ /* reverse sequential (FM=10) */ + EXEC_UNKNOWN, /* No order specified. */ + EXEC_PARALLEL, /* Done in parallel (FM=00). */ + EXEC_SEQ, /* Sequential (FM=01). */ + EXEC_REVSEQ /* Reverse sequential (FM=10). */ } exec_type_enum; /* Fixups. */ -#define MAX_INSN_FIXUPS (5) +#define MAX_INSN_FIXUPS 5 + struct d30v_fixup { expressionS exp; @@ -110,34 +111,6 @@ static symbolS *d30v_last_label; #define NOP_RIGHT ((long long) NOP) #define NOP2 (FM00 | NOP_LEFT | NOP_RIGHT) -/* Local functions. */ -static int reg_name_search PARAMS ((char *name)); -static int register_name PARAMS ((expressionS *expressionP)); -static int check_range PARAMS ((unsigned long num, int bits, int flags)); -static int postfix PARAMS ((char *p)); -static bfd_reloc_code_real_type get_reloc PARAMS ((struct d30v_operand *op, int rel_flag)); -static int get_operands PARAMS ((expressionS exp[], int cmp_hack)); -static struct d30v_format *find_format PARAMS ((struct d30v_opcode *opcode, - expressionS ops[],int fsize, int cmp_hack)); -static long long build_insn PARAMS ((struct d30v_insn *opcode, expressionS *opers)); -static void write_long PARAMS ((struct d30v_insn *opcode, long long insn, Fixups *fx)); -static void write_1_short PARAMS ((struct d30v_insn *opcode, long long insn, - Fixups *fx, int use_sequential)); -static int write_2_short PARAMS ((struct d30v_insn *opcode1, long long insn1, - struct d30v_insn *opcode2, long long insn2, exec_type_enum exec_type, Fixups *fx)); -static long long do_assemble PARAMS ((char *str, struct d30v_insn *opcode, - int shortp, int is_parallel)); -static int parallel_ok PARAMS ((struct d30v_insn *opcode1, unsigned long insn1, - struct d30v_insn *opcode2, unsigned long insn2, - exec_type_enum exec_type)); -static void d30v_number_to_chars PARAMS ((char *buf, long long value, int nbytes)); -static void check_size PARAMS ((long value, int bits, char *file, int line)); -static void d30v_align PARAMS ((int, char *, symbolS *)); -static void s_d30v_align PARAMS ((int)); -static void s_d30v_text PARAMS ((int)); -static void s_d30v_data PARAMS ((int)); -static void s_d30v_section PARAMS ((int)); - struct option md_longopts[] = { {NULL, no_argument, NULL, 0} @@ -145,21 +118,6 @@ struct option md_longopts[] = size_t md_longopts_size = sizeof (md_longopts); -/* The target specific pseudo-ops which we support. */ -const pseudo_typeS md_pseudo_table[] = -{ - { "word", cons, 4 }, - { "hword", cons, 2 }, - { "align", s_d30v_align, 0 }, - { "text", s_d30v_text, 0 }, - { "data", s_d30v_data, 0 }, - { "section", s_d30v_section, 0 }, - { "section.s", s_d30v_section, 0 }, - { "sect", s_d30v_section, 0 }, - { "sect.s", s_d30v_section, 0 }, - { NULL, NULL, 0 } -}; - /* Opcode hash table. */ static struct hash_control *d30v_hash; @@ -168,8 +126,7 @@ static struct hash_control *d30v_hash; array on success, or -1 on failure. */ static int -reg_name_search (name) - char *name; +reg_name_search (char *name) { int middle, low, high; int cmp; @@ -206,8 +163,7 @@ reg_name_search (name) register name. */ static int -register_name (expressionP) - expressionS *expressionP; +register_name (expressionS *expressionP) { int reg_number; char c, *p = input_line_pointer; @@ -236,10 +192,7 @@ register_name (expressionP) } static int -check_range (num, bits, flags) - unsigned long num; - int bits; - int flags; +check_range (unsigned long num, int bits, int flags) { long min, max; @@ -282,8 +235,7 @@ check_range (num, bits, flags) } void -md_show_usage (stream) - FILE *stream; +md_show_usage (FILE *stream) { fprintf (stream, _("\nD30V options:\n\ -O Make adjacent short instructions parallel if possible.\n\ @@ -294,9 +246,7 @@ md_show_usage (stream) } int -md_parse_option (c, arg) - int c; - char *arg ATTRIBUTE_UNUSED; +md_parse_option (int c, char *arg ATTRIBUTE_UNUSED) { switch (c) { @@ -331,8 +281,7 @@ md_parse_option (c, arg) } symbolS * -md_undefined_symbol (name) - char *name ATTRIBUTE_UNUSED; +md_undefined_symbol (char *name ATTRIBUTE_UNUSED) { return 0; } @@ -343,10 +292,7 @@ md_undefined_symbol (name) returned, or NULL on OK. */ char * -md_atof (type, litP, sizeP) - int type; - char *litP; - int *sizeP; +md_atof (int type, char *litP, int *sizeP) { int prec; LITTLENUM_TYPE words[4]; @@ -381,25 +327,22 @@ md_atof (type, litP, sizeP) } void -md_convert_frag (abfd, sec, fragP) - bfd *abfd ATTRIBUTE_UNUSED; - asection *sec ATTRIBUTE_UNUSED; - fragS *fragP ATTRIBUTE_UNUSED; +md_convert_frag (bfd *abfd ATTRIBUTE_UNUSED, + asection *sec ATTRIBUTE_UNUSED, + fragS *fragP ATTRIBUTE_UNUSED) { abort (); } valueT -md_section_align (seg, addr) - asection *seg; - valueT addr; +md_section_align (asection *seg, valueT addr) { int align = bfd_get_section_alignment (stdoutput, seg); return ((addr + (1 << align) - 1) & (-1 << align)); } void -md_begin () +md_begin (void) { struct d30v_opcode *opcode; d30v_hash = hash_new (); @@ -419,8 +362,7 @@ md_begin () from an expression. */ static int -postfix (p) - char *p; +postfix (char *p) { while (*p != '-' && *p != '+') { @@ -445,9 +387,7 @@ postfix (p) } static bfd_reloc_code_real_type -get_reloc (op, rel_flag) - struct d30v_operand *op; - int rel_flag; +get_reloc (struct d30v_operand *op, int rel_flag) { switch (op->bits) { @@ -484,9 +424,7 @@ get_reloc (op, rel_flag) /* Parse a string of operands and return an array of expressions. */ static int -get_operands (exp, cmp_hack) - expressionS exp[]; - int cmp_hack; +get_operands (expressionS exp[], int cmp_hack) { char *p = input_line_pointer; int numops = 0; @@ -579,9 +517,7 @@ get_operands (exp, cmp_hack) It does everything but write the FM bits. */ static long long -build_insn (opcode, opers) - struct d30v_insn *opcode; - expressionS *opers; +build_insn (struct d30v_insn *opcode, expressionS *opers) { int i, length, bits, shift, flags; unsigned long number, id = 0; @@ -621,16 +557,13 @@ build_insn (opcode, opers) number = 0; } else if (number & OPERAND_FLAG) - { - /* NUMBER is a flag register. */ - id = 3; - } + /* NUMBER is a flag register. */ + id = 3; + number &= 0x7F; } else if (flags & OPERAND_SPECIAL) - { - number = id; - } + number = id; if (opers[i].X_op != O_register && opers[i].X_op != O_constant && !(flags & OPERAND_NAME)) @@ -661,10 +594,10 @@ build_insn (opcode, opers) if (bits == 32) { /* It's a LONG instruction. */ - insn |= ((number & 0xffffffff) >> 26); /* top 6 bits */ - insn <<= 32; /* shift the first word over */ - insn |= ((number & 0x03FC0000) << 2); /* next 8 bits */ - insn |= number & 0x0003FFFF; /* bottom 18 bits */ + insn |= ((number & 0xffffffff) >> 26); /* Top 6 bits. */ + insn <<= 32; /* Shift the first word over. */ + insn |= ((number & 0x03FC0000) << 2); /* Next 8 bits. */ + insn |= number & 0x0003FFFF; /* Bottom 18 bits. */ } else insn |= number << shift; @@ -673,13 +606,24 @@ build_insn (opcode, opers) return insn; } +static void +d30v_number_to_chars (char *buf, /* Return 'nbytes' of chars here. */ + long long value, /* The value of the bits. */ + int n) /* Number of bytes in the output. */ +{ + while (n--) + { + buf[n] = value & 0xff; + value >>= 8; + } +} + /* Write out a long form instruction. */ static void -write_long (opcode, insn, fx) - struct d30v_insn *opcode ATTRIBUTE_UNUSED; - long long insn; - Fixups *fx; +write_long (struct d30v_insn *opcode ATTRIBUTE_UNUSED, + long long insn, + Fixups *fx) { int i, where; char *f = frag_more (8); @@ -692,12 +636,8 @@ write_long (opcode, insn, fx) if (fx->fix[i].reloc) { where = f - frag_now->fr_literal; - fix_new_exp (frag_now, - where, - fx->fix[i].size, - &(fx->fix[i].exp), - fx->fix[i].pcrel, - fx->fix[i].reloc); + fix_new_exp (frag_now, where, fx->fix[i].size, &(fx->fix[i].exp), + fx->fix[i].pcrel, fx->fix[i].reloc); } } @@ -707,11 +647,10 @@ write_long (opcode, insn, fx) /* Write out a short form instruction by itself. */ static void -write_1_short (opcode, insn, fx, use_sequential) - struct d30v_insn *opcode; - long long insn; - Fixups *fx; - int use_sequential; +write_1_short (struct d30v_insn *opcode, + long long insn, + Fixups *fx, + int use_sequential) { char *f = frag_more (8); int i, where; @@ -729,7 +668,6 @@ write_1_short (opcode, insn, fx, use_sequential) /* According to 4.3.1: for FM=01, sub-instructions performed only by IU cannot be encoded in L-container. */ - if (opcode->op->unit == IU) /* Right then left. */ insn |= FM10 | NOP_LEFT; @@ -741,7 +679,6 @@ write_1_short (opcode, insn, fx, use_sequential) { /* According to 4.3.1: for FM=00, sub-instructions performed only by IU cannot be encoded in L-container. */ - if (opcode->op->unit == IU) /* Right container. */ insn |= FM00 | NOP_LEFT; @@ -769,205 +706,15 @@ write_1_short (opcode, insn, fx, use_sequential) fx->fc = 0; } -/* Write out a short form instruction if possible. - Return number of instructions not written out. */ - -static int -write_2_short (opcode1, insn1, opcode2, insn2, exec_type, fx) - struct d30v_insn *opcode1, *opcode2; - long long insn1, insn2; - exec_type_enum exec_type; - Fixups *fx; -{ - long long insn = NOP2; - char *f; - int i, j, where; - - if (exec_type == EXEC_SEQ - && (opcode1->op->flags_used & (FLAG_JMP | FLAG_JSR)) - && ((opcode1->op->flags_used & FLAG_DELAY) == 0) - && ((opcode1->ecc == ECC_AL) || ! Optimizing)) - { - /* Unconditional, non-delayed branches kill instructions in - the right bin. Conditional branches don't always but if - we are not optimizing, then we have been asked to produce - an error about such constructs. For the purposes of this - test, subroutine calls are considered to be branches. */ - write_1_short (opcode1, insn1, fx->next, FALSE); - return 1; - } - - /* Note: we do not have to worry about subroutine calls occurring - in the right hand container. The return address is always - aligned to the next 64 bit boundary, be that 64 or 32 bit away. */ - switch (exec_type) - { - case EXEC_UNKNOWN: /* Order not specified. */ - if (Optimizing - && parallel_ok (opcode1, insn1, opcode2, insn2, exec_type) - && ! ( (opcode1->op->unit == EITHER_BUT_PREFER_MU - || opcode1->op->unit == MU) - && - ( opcode2->op->unit == EITHER_BUT_PREFER_MU - || opcode2->op->unit == MU))) - { - /* Parallel. */ - exec_type = EXEC_PARALLEL; - - if (opcode1->op->unit == IU - || opcode2->op->unit == MU - || opcode2->op->unit == EITHER_BUT_PREFER_MU) - insn = FM00 | (insn2 << 32) | insn1; - else - { - insn = FM00 | (insn1 << 32) | insn2; - fx = fx->next; - } - } - else if ((opcode1->op->flags_used & (FLAG_JMP | FLAG_JSR) - && ((opcode1->op->flags_used & FLAG_DELAY) == 0)) - || opcode1->op->flags_used & FLAG_RP) - { - /* We must emit (non-delayed) branch type instructions - on their own with nothing in the right container. */ - /* We must treat repeat instructions likewise, since the - following instruction has to be separate from the repeat - in order to be repeated. */ - write_1_short (opcode1, insn1, fx->next, FALSE); - return 1; - } - else if (prev_left_kills_right_p) - { - /* The left instruction kils the right slot, so we - must leave it empty. */ - write_1_short (opcode1, insn1, fx->next, FALSE); - return 1; - } - else if (opcode1->op->unit == IU) - { - if (opcode2->op->unit == EITHER_BUT_PREFER_MU) - { - /* Case 103810 is a request from Mitsubishi that opcodes - with EITHER_BUT_PREFER_MU should not be executed in - reverse sequential order. */ - write_1_short (opcode1, insn1, fx->next, FALSE); - return 1; - } - - /* Reverse sequential. */ - insn = FM10 | (insn2 << 32) | insn1; - exec_type = EXEC_REVSEQ; - } - else - { - /* Sequential. */ - insn = FM01 | (insn1 << 32) | insn2; - fx = fx->next; - exec_type = EXEC_SEQ; - } - break; - - case EXEC_PARALLEL: /* Parallel. */ - flag_explicitly_parallel = flag_xp_state; - if (! parallel_ok (opcode1, insn1, opcode2, insn2, exec_type)) - as_bad (_("Instructions may not be executed in parallel")); - else if (opcode1->op->unit == IU) - { - if (opcode2->op->unit == IU) - as_bad (_("Two IU instructions may not be executed in parallel")); - as_warn (_("Swapping instruction order")); - insn = FM00 | (insn2 << 32) | insn1; - } - else if (opcode2->op->unit == MU) - { - if (opcode1->op->unit == MU) - as_bad (_("Two MU instructions may not be executed in parallel")); - else if (opcode1->op->unit == EITHER_BUT_PREFER_MU) - as_warn (_("Executing %s in IU may not work"), opcode1->op->name); - as_warn (_("Swapping instruction order")); - insn = FM00 | (insn2 << 32) | insn1; - } - else - { - if (opcode2->op->unit == EITHER_BUT_PREFER_MU) - as_warn (_("Executing %s in IU may not work in parallel execution"), - opcode2->op->name); - - insn = FM00 | (insn1 << 32) | insn2; - fx = fx->next; - } - flag_explicitly_parallel = 0; - break; - - case EXEC_SEQ: /* Sequential. */ - if (opcode1->op->unit == IU) - as_bad (_("IU instruction may not be in the left container")); - if (prev_left_kills_right_p) - as_bad (_("special left instruction `%s' kills instruction " - "`%s' in right container"), - opcode1->op->name, opcode2->op->name); - insn = FM01 | (insn1 << 32) | insn2; - fx = fx->next; - break; - - case EXEC_REVSEQ: /* Reverse sequential. */ - if (opcode2->op->unit == MU) - as_bad (_("MU instruction may not be in the right container")); - if (opcode1->op->unit == EITHER_BUT_PREFER_MU) - as_warn (_("Executing %s in reverse serial with %s may not work"), - opcode1->op->name, opcode2->op->name); - else if (opcode2->op->unit == EITHER_BUT_PREFER_MU) - as_warn (_("Executing %s in IU in reverse serial may not work"), - opcode2->op->name); - insn = FM10 | (insn1 << 32) | insn2; - fx = fx->next; - break; - - default: - as_fatal (_("unknown execution type passed to write_2_short()")); - } - - f = frag_more (8); - d30v_number_to_chars (f, insn, 8); - - /* If the previous instruction was a 32-bit multiply but it is put into a - parallel container, mark the current instruction as being a 32-bit - multiply. */ - if (prev_mul32_p && exec_type == EXEC_PARALLEL) - cur_mul32_p = 1; - - for (j = 0; j < 2; j++) - { - for (i = 0; i < fx->fc; i++) - { - if (fx->fix[i].reloc) - { - where = (f - frag_now->fr_literal) + 4 * j; - - fix_new_exp (frag_now, - where, - fx->fix[i].size, - &(fx->fix[i].exp), - fx->fix[i].pcrel, - fx->fix[i].reloc); - } - } - - fx->fc = 0; - fx = fx->next; - } - - return 0; -} - /* Check 2 instructions and determine if they can be safely executed in parallel. Return 1 if they can be. */ static int -parallel_ok (op1, insn1, op2, insn2, exec_type) - struct d30v_insn *op1, *op2; - unsigned long insn1, insn2; - exec_type_enum exec_type; +parallel_ok (struct d30v_insn *op1, + unsigned long insn1, + struct d30v_insn *op2, + unsigned long insn2, + exec_type_enum exec_type) { int i, j, shift, regno, bits, ecc; unsigned long flags, mask, flags_set1, flags_set2, flags_used1, flags_used2; @@ -1215,206 +962,352 @@ parallel_ok (op1, insn1, op2, insn2, exec_type) return 1; } -/* This is the main entry point for the machine-dependent assembler. - STR points to a machine-dependent instruction. This function is - supposed to emit the frags/bytes it assembles to. For the D30V, it - mostly handles the special VLIW parsing and packing and leaves the - difficult stuff to do_assemble (). */ - -static long long prev_insn = -1; -static struct d30v_insn prev_opcode; -static subsegT prev_subseg; -static segT prev_seg = 0; +/* Write out a short form instruction if possible. + Return number of instructions not written out. */ -void -md_assemble (str) - char *str; +static int +write_2_short (struct d30v_insn *opcode1, + long long insn1, + struct d30v_insn *opcode2, + long long insn2, + exec_type_enum exec_type, + Fixups *fx) { - struct d30v_insn opcode; - long long insn; - /* Execution type; parallel, etc. */ - exec_type_enum extype = EXEC_UNKNOWN; - /* Saved extype. Used for multiline instructions. */ - static exec_type_enum etype = EXEC_UNKNOWN; - char *str2; - - if ((prev_insn != -1) && prev_seg - && ((prev_seg != now_seg) || (prev_subseg != now_subseg))) - d30v_cleanup (FALSE); + long long insn = NOP2; + char *f; + int i, j, where; - if (d30v_current_align < 3) - d30v_align (3, NULL, d30v_last_label); - else if (d30v_current_align > 3) - d30v_current_align = 3; - d30v_last_label = NULL; + if (exec_type == EXEC_SEQ + && (opcode1->op->flags_used & (FLAG_JMP | FLAG_JSR)) + && ((opcode1->op->flags_used & FLAG_DELAY) == 0) + && ((opcode1->ecc == ECC_AL) || ! Optimizing)) + { + /* Unconditional, non-delayed branches kill instructions in + the right bin. Conditional branches don't always but if + we are not optimizing, then we have been asked to produce + an error about such constructs. For the purposes of this + test, subroutine calls are considered to be branches. */ + write_1_short (opcode1, insn1, fx->next, FALSE); + return 1; + } - flag_explicitly_parallel = 0; - flag_xp_state = 0; - if (etype == EXEC_UNKNOWN) + /* Note: we do not have to worry about subroutine calls occurring + in the right hand container. The return address is always + aligned to the next 64 bit boundary, be that 64 or 32 bit away. */ + switch (exec_type) { - /* Look for the special multiple instruction separators. */ - str2 = strstr (str, "||"); - if (str2) - { - extype = EXEC_PARALLEL; - flag_xp_state = 1; - } - else + case EXEC_UNKNOWN: /* Order not specified. */ + if (Optimizing + && parallel_ok (opcode1, insn1, opcode2, insn2, exec_type) + && ! ( (opcode1->op->unit == EITHER_BUT_PREFER_MU + || opcode1->op->unit == MU) + && + ( opcode2->op->unit == EITHER_BUT_PREFER_MU + || opcode2->op->unit == MU))) { - str2 = strstr (str, "->"); - if (str2) - extype = EXEC_SEQ; + /* Parallel. */ + exec_type = EXEC_PARALLEL; + + if (opcode1->op->unit == IU + || opcode2->op->unit == MU + || opcode2->op->unit == EITHER_BUT_PREFER_MU) + insn = FM00 | (insn2 << 32) | insn1; else { - str2 = strstr (str, "<-"); - if (str2) - extype = EXEC_REVSEQ; + insn = FM00 | (insn1 << 32) | insn2; + fx = fx->next; } } + else if ((opcode1->op->flags_used & (FLAG_JMP | FLAG_JSR) + && ((opcode1->op->flags_used & FLAG_DELAY) == 0)) + || opcode1->op->flags_used & FLAG_RP) + { + /* We must emit (non-delayed) branch type instructions + on their own with nothing in the right container. */ + /* We must treat repeat instructions likewise, since the + following instruction has to be separate from the repeat + in order to be repeated. */ + write_1_short (opcode1, insn1, fx->next, FALSE); + return 1; + } + else if (prev_left_kills_right_p) + { + /* The left instruction kils the right slot, so we + must leave it empty. */ + write_1_short (opcode1, insn1, fx->next, FALSE); + return 1; + } + else if (opcode1->op->unit == IU) + { + if (opcode2->op->unit == EITHER_BUT_PREFER_MU) + { + /* Case 103810 is a request from Mitsubishi that opcodes + with EITHER_BUT_PREFER_MU should not be executed in + reverse sequential order. */ + write_1_short (opcode1, insn1, fx->next, FALSE); + return 1; + } - /* STR2 points to the separator, if one. */ - if (str2) + /* Reverse sequential. */ + insn = FM10 | (insn2 << 32) | insn1; + exec_type = EXEC_REVSEQ; + } + else { - *str2 = 0; + /* Sequential. */ + insn = FM01 | (insn1 << 32) | insn2; + fx = fx->next; + exec_type = EXEC_SEQ; + } + break; - /* If two instructions are present and we already have one saved, - then first write it out. */ - d30v_cleanup (FALSE); + case EXEC_PARALLEL: /* Parallel. */ + flag_explicitly_parallel = flag_xp_state; + if (! parallel_ok (opcode1, insn1, opcode2, insn2, exec_type)) + as_bad (_("Instructions may not be executed in parallel")); + else if (opcode1->op->unit == IU) + { + if (opcode2->op->unit == IU) + as_bad (_("Two IU instructions may not be executed in parallel")); + as_warn (_("Swapping instruction order")); + insn = FM00 | (insn2 << 32) | insn1; + } + else if (opcode2->op->unit == MU) + { + if (opcode1->op->unit == MU) + as_bad (_("Two MU instructions may not be executed in parallel")); + else if (opcode1->op->unit == EITHER_BUT_PREFER_MU) + as_warn (_("Executing %s in IU may not work"), opcode1->op->name); + as_warn (_("Swapping instruction order")); + insn = FM00 | (insn2 << 32) | insn1; + } + else + { + if (opcode2->op->unit == EITHER_BUT_PREFER_MU) + as_warn (_("Executing %s in IU may not work in parallel execution"), + opcode2->op->name); - /* Assemble first instruction and save it. */ - prev_insn = do_assemble (str, &prev_opcode, 1, 0); - if (prev_insn == -1) - as_bad (_("Cannot assemble instruction")); - if (prev_opcode.form != NULL && prev_opcode.form->form >= LONG) - as_bad (_("First opcode is long. Unable to mix instructions as specified.")); - fixups = fixups->next; - str = str2 + 2; - prev_seg = now_seg; - prev_subseg = now_subseg; + insn = FM00 | (insn1 << 32) | insn2; + fx = fx->next; } - } + flag_explicitly_parallel = 0; + break; - insn = do_assemble (str, &opcode, - (extype != EXEC_UNKNOWN || etype != EXEC_UNKNOWN), - extype == EXEC_PARALLEL); - if (insn == -1) - { - if (extype != EXEC_UNKNOWN) - etype = extype; - as_bad (_("Cannot assemble instruction")); - return; - } + case EXEC_SEQ: /* Sequential. */ + if (opcode1->op->unit == IU) + as_bad (_("IU instruction may not be in the left container")); + if (prev_left_kills_right_p) + as_bad (_("special left instruction `%s' kills instruction " + "`%s' in right container"), + opcode1->op->name, opcode2->op->name); + insn = FM01 | (insn1 << 32) | insn2; + fx = fx->next; + break; - if (etype != EXEC_UNKNOWN) - { - extype = etype; - etype = EXEC_UNKNOWN; + case EXEC_REVSEQ: /* Reverse sequential. */ + if (opcode2->op->unit == MU) + as_bad (_("MU instruction may not be in the right container")); + if (opcode1->op->unit == EITHER_BUT_PREFER_MU) + as_warn (_("Executing %s in reverse serial with %s may not work"), + opcode1->op->name, opcode2->op->name); + else if (opcode2->op->unit == EITHER_BUT_PREFER_MU) + as_warn (_("Executing %s in IU in reverse serial may not work"), + opcode2->op->name); + insn = FM10 | (insn1 << 32) | insn2; + fx = fx->next; + break; + + default: + as_fatal (_("unknown execution type passed to write_2_short()")); } - /* Word multiply instructions must not be followed by either a load or a - 16-bit multiply instruction in the next cycle. */ - if ( (extype != EXEC_REVSEQ) - && prev_mul32_p - && (opcode.op->flags_used & (FLAG_MEM | FLAG_MUL16))) + f = frag_more (8); + d30v_number_to_chars (f, insn, 8); + + /* If the previous instruction was a 32-bit multiply but it is put into a + parallel container, mark the current instruction as being a 32-bit + multiply. */ + if (prev_mul32_p && exec_type == EXEC_PARALLEL) + cur_mul32_p = 1; + + for (j = 0; j < 2; j++) { - /* However, load and multiply should able to be combined in a parallel - operation, so check for that first. */ - if (prev_insn != -1 - && (opcode.op->flags_used & FLAG_MEM) - && opcode.form->form < LONG - && (extype == EXEC_PARALLEL || (Optimizing && extype == EXEC_UNKNOWN)) - && parallel_ok (&prev_opcode, (long) prev_insn, - &opcode, (long) insn, extype) - && write_2_short (&prev_opcode, (long) prev_insn, - &opcode, (long) insn, extype, fixups) == 0) + for (i = 0; i < fx->fc; i++) { - /* No instructions saved. */ - prev_insn = -1; - return; + if (fx->fix[i].reloc) + { + where = (f - frag_now->fr_literal) + 4 * j; + + fix_new_exp (frag_now, + where, + fx->fix[i].size, + &(fx->fix[i].exp), + fx->fix[i].pcrel, + fx->fix[i].reloc); + } } - else - { - /* Can't parallelize, flush previous instruction and emit a - word of NOPS, unless the previous instruction is a NOP, - in which case just flush it, as this will generate a word - of NOPs for us. */ - if (prev_insn != -1 && (strcmp (prev_opcode.op->name, "nop") == 0)) - d30v_cleanup (FALSE); - else + fx->fc = 0; + fx = fx->next; + } + + return 0; +} + +/* Get a pointer to an entry in the format table. + It must look at all formats for an opcode and use the operands + to choose the correct one. Return NULL on error. */ + +static struct d30v_format * +find_format (struct d30v_opcode *opcode, + expressionS myops[], + int fsize, + int cmp_hack) +{ + int numops, match, index, i = 0, j, k; + struct d30v_format *fm; + + if (opcode == NULL) + return NULL; + + /* Get all the operands and save them as expressions. */ + numops = get_operands (myops, cmp_hack); + + while ((index = opcode->format[i++]) != 0) + { + if (fsize == FORCE_SHORT && index >= LONG) + continue; + + if (fsize == FORCE_LONG && index < LONG) + continue; + + fm = (struct d30v_format *) &d30v_format_table[index]; + k = index; + while (fm->form == index) + { + match = 1; + /* Now check the operands for compatibility. */ + for (j = 0; match && fm->operands[j]; j++) { - char *f; + int flags = d30v_operand_table[fm->operands[j]].flags; + int bits = d30v_operand_table[fm->operands[j]].bits; + int X_op = myops[j].X_op; + int num = myops[j].X_add_number; - if (prev_insn != -1) - d30v_cleanup (TRUE); - else + if (flags & OPERAND_SPECIAL) + break; + else if (X_op == O_illegal) + match = 0; + else if (flags & OPERAND_REG) { - f = frag_more (8); - d30v_number_to_chars (f, NOP2, 8); + if (X_op != O_register + || ((flags & OPERAND_ACC) && !(num & OPERAND_ACC)) + || (!(flags & OPERAND_ACC) && (num & OPERAND_ACC)) + || ((flags & OPERAND_FLAG) && !(num & OPERAND_FLAG)) + || (!(flags & (OPERAND_FLAG | OPERAND_CONTROL)) && (num & OPERAND_FLAG)) + || ((flags & OPERAND_CONTROL) + && !(num & (OPERAND_CONTROL | OPERAND_FLAG)))) + match = 0; + } + else if (((flags & OPERAND_MINUS) + && (X_op != O_absent || num != OPERAND_MINUS)) + || ((flags & OPERAND_PLUS) + && (X_op != O_absent || num != OPERAND_PLUS)) + || ((flags & OPERAND_ATMINUS) + && (X_op != O_absent || num != OPERAND_ATMINUS)) + || ((flags & OPERAND_ATPAR) + && (X_op != O_absent || num != OPERAND_ATPAR)) + || ((flags & OPERAND_ATSIGN) + && (X_op != O_absent || num != OPERAND_ATSIGN))) + match = 0; + else if (flags & OPERAND_NUM) + { + /* A number can be a constant or symbol expression. */ - if (warn_nops == NOP_ALL || warn_nops == NOP_MULTIPLY) + /* If we have found a register name, but that name + also matches a symbol, then re-parse the name as + an expression. */ + if (X_op == O_register + && symbol_find ((char *) myops[j].X_op_symbol)) { - if (opcode.op->flags_used & FLAG_MEM) - as_warn (_("word of NOPs added between word multiply and load")); - else - as_warn (_("word of NOPs added between word multiply and 16-bit multiply")); + input_line_pointer = (char *) myops[j].X_op_symbol; + expression (&myops[j]); } - } - } - extype = EXEC_UNKNOWN; - } - } - else if ( (extype == EXEC_REVSEQ) - && cur_mul32_p - && (prev_opcode.op->flags_used & (FLAG_MEM | FLAG_MUL16))) - { - /* Can't parallelize, flush current instruction and add a - sequential NOP. */ - write_1_short (&opcode, (long) insn, fixups->next->next, TRUE); + /* Turn an expression into a symbol for later resolution. */ + if (X_op != O_absent && X_op != O_constant + && X_op != O_symbol && X_op != O_register + && X_op != O_big) + { + symbolS *sym = make_expr_symbol (&myops[j]); + myops[j].X_op = X_op = O_symbol; + myops[j].X_add_symbol = sym; + myops[j].X_add_number = num = 0; + } - /* Make the previous instruction the current one. */ - extype = EXEC_UNKNOWN; - insn = prev_insn; - now_seg = prev_seg; - now_subseg = prev_subseg; - prev_insn = -1; - cur_mul32_p = prev_mul32_p; - prev_mul32_p = 0; - memcpy (&opcode, &prev_opcode, sizeof (prev_opcode)); - } + if (fm->form >= LONG) + { + /* If we're testing for a LONG format, either fits. */ + if (X_op != O_constant && X_op != O_symbol) + match = 0; + } + else if (fm->form < LONG + && ((fsize == FORCE_SHORT && X_op == O_symbol) + || (fm->form == SHORT_D2 && j == 0))) + match = 1; - /* If this is a long instruction, write it and any previous short - instruction. */ - if (opcode.form->form >= LONG) - { - if (extype != EXEC_UNKNOWN) - as_bad (_("Instruction uses long version, so it cannot be mixed as specified")); - d30v_cleanup (FALSE); - write_long (&opcode, insn, fixups); - prev_insn = -1; - } - else if ((prev_insn != -1) - && (write_2_short - (&prev_opcode, (long) prev_insn, &opcode, - (long) insn, extype, fixups) == 0)) - { - /* No instructions saved. */ - prev_insn = -1; - } - else - { - if (extype != EXEC_UNKNOWN) - as_bad (_("Unable to mix instructions as specified")); + /* This is the tricky part. Will the constant or symbol + fit into the space in the current format? */ + else if (X_op == O_constant) + { + if (check_range (num, bits, flags)) + match = 0; + } + else if (X_op == O_symbol + && S_IS_DEFINED (myops[j].X_add_symbol) + && S_GET_SEGMENT (myops[j].X_add_symbol) == now_seg + && opcode->reloc_flag == RELOC_PCREL) + { + /* If the symbol is defined, see if the value will fit + into the form we're considering. */ + fragS *f; + long value; - /* Save off last instruction so it may be packed on next pass. */ - memcpy (&prev_opcode, &opcode, sizeof (prev_opcode)); - prev_insn = insn; - prev_seg = now_seg; - prev_subseg = now_subseg; - fixups = fixups->next; - prev_mul32_p = cur_mul32_p; + /* Calculate the current address by running through the + previous frags and adding our current offset. */ + value = 0; + for (f = frchain_now->frch_root; f; f = f->fr_next) + value += f->fr_fix + f->fr_offset; + value = (S_GET_VALUE (myops[j].X_add_symbol) - value + - (obstack_next_free (&frchain_now->frch_obstack) + - frag_now->fr_literal)); + if (check_range (value, bits, flags)) + match = 0; + } + else + match = 0; + } + } + /* We're only done if the operands matched so far AND there + are no more to check. */ + if (match && myops[j].X_op == 0) + { + /* Final check - issue a warning if an odd numbered register + is used as the first register in an instruction that reads + or writes 2 registers. */ + + for (j = 0; fm->operands[j]; j++) + if (myops[j].X_op == O_register + && (myops[j].X_add_number & 1) + && (d30v_operand_table[fm->operands[j]].flags & OPERAND_2REG)) + as_warn (_("Odd numbered register used as target of multi-register instruction")); + + return fm; + } + fm = (struct d30v_format *) &d30v_format_table[++k]; + } } + return NULL; } /* Assemble a single instruction and return an opcode. @@ -1423,11 +1316,10 @@ md_assemble (str) #define NAME_BUF_LEN 20 static long long -do_assemble (str, opcode, shortp, is_parallel) - char *str; - struct d30v_insn *opcode; - int shortp; - int is_parallel; +do_assemble (char *str, + struct d30v_insn *opcode, + int shortp, + int is_parallel) { char *op_start; char *save; @@ -1610,182 +1502,303 @@ do_assemble (str, opcode, shortp, is_parallel) return insn; } -/* Get a pointer to an entry in the format table. - It must look at all formats for an opcode and use the operands - to choose the correct one. Return NULL on error. */ +/* Called internally to handle all alignment needs. This takes care + of eliding calls to frag_align if'n the cached current alignment + says we've already got it, as well as taking care of the auto-aligning + labels wrt code. */ -static struct d30v_format * -find_format (opcode, myops, fsize, cmp_hack) - struct d30v_opcode *opcode; - expressionS myops[]; - int fsize; - int cmp_hack; +static void +d30v_align (int n, char *pfill, symbolS *label) { - int numops, match, index, i = 0, j, k; - struct d30v_format *fm; + /* The front end is prone to changing segments out from under us + temporarily when -g is in effect. */ + int switched_seg_p = (d30v_current_align_seg != now_seg); - if (opcode == NULL) - return NULL; + /* Do not assume that if 'd30v_current_align >= n' and + '! switched_seg_p' that it is safe to avoid performing + this alignment request. The alignment of the current frag + can be changed under our feet, for example by a .ascii + directive in the source code. cf testsuite/gas/d30v/reloc.s */ + d30v_cleanup (FALSE); - /* Get all the operands and save them as expressions. */ - numops = get_operands (myops, cmp_hack); + if (pfill == NULL) + { + if (n > 2 + && (bfd_get_section_flags (stdoutput, now_seg) & SEC_CODE) != 0) + { + static char const nop[4] = { 0x00, 0xf0, 0x00, 0x00 }; - while ((index = opcode->format[i++]) != 0) + /* First, make sure we're on a four-byte boundary, in case + someone has been putting .byte values the text section. */ + if (d30v_current_align < 2 || switched_seg_p) + frag_align (2, 0, 0); + frag_align_pattern (n, nop, sizeof nop, 0); + } + else + frag_align (n, 0, 0); + } + else + frag_align (n, *pfill, 0); + + if (!switched_seg_p) + d30v_current_align = n; + + if (label != NULL) { - if (fsize == FORCE_SHORT && index >= LONG) - continue; + symbolS *sym; + int label_seen = FALSE; + struct frag *old_frag; + valueT old_value; + valueT new_value; - if (fsize == FORCE_LONG && index < LONG) - continue; + assert (S_GET_SEGMENT (label) == now_seg); - fm = (struct d30v_format *) &d30v_format_table[index]; - k = index; - while (fm->form == index) + old_frag = symbol_get_frag (label); + old_value = S_GET_VALUE (label); + new_value = (valueT) frag_now_fix (); + + /* It is possible to have more than one label at a particular + address, especially if debugging is enabled, so we must + take care to adjust all the labels at this address in this + fragment. To save time we search from the end of the symbol + list, backwards, since the symbols we are interested in are + almost certainly the ones that were most recently added. + Also to save time we stop searching once we have seen at least + one matching label, and we encounter a label that is no longer + in the target fragment. Note, this search is guaranteed to + find at least one match when sym == label, so no special case + code is necessary. */ + for (sym = symbol_lastP; sym != NULL; sym = symbol_previous (sym)) { - match = 1; - /* Now check the operands for compatibility. */ - for (j = 0; match && fm->operands[j]; j++) + if (symbol_get_frag (sym) == old_frag + && S_GET_VALUE (sym) == old_value) { - int flags = d30v_operand_table[fm->operands[j]].flags; - int bits = d30v_operand_table[fm->operands[j]].bits; - int X_op = myops[j].X_op; - int num = myops[j].X_add_number; + label_seen = TRUE; + symbol_set_frag (sym, frag_now); + S_SET_VALUE (sym, new_value); + } + else if (label_seen && symbol_get_frag (sym) != old_frag) + break; + } + } - if (flags & OPERAND_SPECIAL) - break; - else if (X_op == O_illegal) - match = 0; - else if (flags & OPERAND_REG) - { - if (X_op != O_register - || ((flags & OPERAND_ACC) && !(num & OPERAND_ACC)) - || (!(flags & OPERAND_ACC) && (num & OPERAND_ACC)) - || ((flags & OPERAND_FLAG) && !(num & OPERAND_FLAG)) - || (!(flags & (OPERAND_FLAG | OPERAND_CONTROL)) && (num & OPERAND_FLAG)) - || ((flags & OPERAND_CONTROL) - && !(num & (OPERAND_CONTROL | OPERAND_FLAG)))) - { - match = 0; - } - } - else if (((flags & OPERAND_MINUS) - && (X_op != O_absent || num != OPERAND_MINUS)) - || ((flags & OPERAND_PLUS) - && (X_op != O_absent || num != OPERAND_PLUS)) - || ((flags & OPERAND_ATMINUS) - && (X_op != O_absent || num != OPERAND_ATMINUS)) - || ((flags & OPERAND_ATPAR) - && (X_op != O_absent || num != OPERAND_ATPAR)) - || ((flags & OPERAND_ATSIGN) - && (X_op != O_absent || num != OPERAND_ATSIGN))) - { - match = 0; - } - else if (flags & OPERAND_NUM) - { - /* A number can be a constant or symbol expression. */ + record_alignment (now_seg, n); +} - /* If we have found a register name, but that name - also matches a symbol, then re-parse the name as - an expression. */ - if (X_op == O_register - && symbol_find ((char *) myops[j].X_op_symbol)) - { - input_line_pointer = (char *) myops[j].X_op_symbol; - expression (&myops[j]); - } +/* This is the main entry point for the machine-dependent assembler. + STR points to a machine-dependent instruction. This function is + supposed to emit the frags/bytes it assembles to. For the D30V, it + mostly handles the special VLIW parsing and packing and leaves the + difficult stuff to do_assemble (). */ - /* Turn an expression into a symbol for later resolution. */ - if (X_op != O_absent && X_op != O_constant - && X_op != O_symbol && X_op != O_register - && X_op != O_big) - { - symbolS *sym = make_expr_symbol (&myops[j]); - myops[j].X_op = X_op = O_symbol; - myops[j].X_add_symbol = sym; - myops[j].X_add_number = num = 0; - } +static long long prev_insn = -1; +static struct d30v_insn prev_opcode; +static subsegT prev_subseg; +static segT prev_seg = 0; - if (fm->form >= LONG) - { - /* If we're testing for a LONG format, either fits. */ - if (X_op != O_constant && X_op != O_symbol) - match = 0; - } - else if (fm->form < LONG - && ((fsize == FORCE_SHORT && X_op == O_symbol) - || (fm->form == SHORT_D2 && j == 0))) - match = 1; +void +md_assemble (char *str) +{ + struct d30v_insn opcode; + long long insn; + /* Execution type; parallel, etc. */ + exec_type_enum extype = EXEC_UNKNOWN; + /* Saved extype. Used for multiline instructions. */ + static exec_type_enum etype = EXEC_UNKNOWN; + char *str2; - /* This is the tricky part. Will the constant or symbol - fit into the space in the current format? */ - else if (X_op == O_constant) - { - if (check_range (num, bits, flags)) - match = 0; - } - else if (X_op == O_symbol - && S_IS_DEFINED (myops[j].X_add_symbol) - && S_GET_SEGMENT (myops[j].X_add_symbol) == now_seg - && opcode->reloc_flag == RELOC_PCREL) - { - /* If the symbol is defined, see if the value will fit - into the form we're considering. */ - fragS *f; - long value; + if ((prev_insn != -1) && prev_seg + && ((prev_seg != now_seg) || (prev_subseg != now_subseg))) + d30v_cleanup (FALSE); - /* Calculate the current address by running through the - previous frags and adding our current offset. */ - value = 0; - for (f = frchain_now->frch_root; f; f = f->fr_next) - value += f->fr_fix + f->fr_offset; - value = (S_GET_VALUE (myops[j].X_add_symbol) - value - - (obstack_next_free (&frchain_now->frch_obstack) - - frag_now->fr_literal)); - if (check_range (value, bits, flags)) - match = 0; - } - else - match = 0; - } + if (d30v_current_align < 3) + d30v_align (3, NULL, d30v_last_label); + else if (d30v_current_align > 3) + d30v_current_align = 3; + d30v_last_label = NULL; + + flag_explicitly_parallel = 0; + flag_xp_state = 0; + if (etype == EXEC_UNKNOWN) + { + /* Look for the special multiple instruction separators. */ + str2 = strstr (str, "||"); + if (str2) + { + extype = EXEC_PARALLEL; + flag_xp_state = 1; + } + else + { + str2 = strstr (str, "->"); + if (str2) + extype = EXEC_SEQ; + else + { + str2 = strstr (str, "<-"); + if (str2) + extype = EXEC_REVSEQ; } - /* We're only done if the operands matched so far AND there - are no more to check. */ - if (match && myops[j].X_op == 0) + } + + /* STR2 points to the separator, if one. */ + if (str2) + { + *str2 = 0; + + /* If two instructions are present and we already have one saved, + then first write it out. */ + d30v_cleanup (FALSE); + + /* Assemble first instruction and save it. */ + prev_insn = do_assemble (str, &prev_opcode, 1, 0); + if (prev_insn == -1) + as_bad (_("Cannot assemble instruction")); + if (prev_opcode.form != NULL && prev_opcode.form->form >= LONG) + as_bad (_("First opcode is long. Unable to mix instructions as specified.")); + fixups = fixups->next; + str = str2 + 2; + prev_seg = now_seg; + prev_subseg = now_subseg; + } + } + + insn = do_assemble (str, &opcode, + (extype != EXEC_UNKNOWN || etype != EXEC_UNKNOWN), + extype == EXEC_PARALLEL); + if (insn == -1) + { + if (extype != EXEC_UNKNOWN) + etype = extype; + as_bad (_("Cannot assemble instruction")); + return; + } + + if (etype != EXEC_UNKNOWN) + { + extype = etype; + etype = EXEC_UNKNOWN; + } + + /* Word multiply instructions must not be followed by either a load or a + 16-bit multiply instruction in the next cycle. */ + if ( (extype != EXEC_REVSEQ) + && prev_mul32_p + && (opcode.op->flags_used & (FLAG_MEM | FLAG_MUL16))) + { + /* However, load and multiply should able to be combined in a parallel + operation, so check for that first. */ + if (prev_insn != -1 + && (opcode.op->flags_used & FLAG_MEM) + && opcode.form->form < LONG + && (extype == EXEC_PARALLEL || (Optimizing && extype == EXEC_UNKNOWN)) + && parallel_ok (&prev_opcode, (long) prev_insn, + &opcode, (long) insn, extype) + && write_2_short (&prev_opcode, (long) prev_insn, + &opcode, (long) insn, extype, fixups) == 0) + { + /* No instructions saved. */ + prev_insn = -1; + return; + } + else + { + /* Can't parallelize, flush previous instruction and emit a + word of NOPS, unless the previous instruction is a NOP, + in which case just flush it, as this will generate a word + of NOPs for us. */ + + if (prev_insn != -1 && (strcmp (prev_opcode.op->name, "nop") == 0)) + d30v_cleanup (FALSE); + else { - /* Final check - issue a warning if an odd numbered register - is used as the first register in an instruction that reads - or writes 2 registers. */ + char *f; - for (j = 0; fm->operands[j]; j++) - if (myops[j].X_op == O_register - && (myops[j].X_add_number & 1) - && (d30v_operand_table[fm->operands[j]].flags & OPERAND_2REG)) - as_warn (_("Odd numbered register used as target of multi-register instruction")); + if (prev_insn != -1) + d30v_cleanup (TRUE); + else + { + f = frag_more (8); + d30v_number_to_chars (f, NOP2, 8); - return fm; + if (warn_nops == NOP_ALL || warn_nops == NOP_MULTIPLY) + { + if (opcode.op->flags_used & FLAG_MEM) + as_warn (_("word of NOPs added between word multiply and load")); + else + as_warn (_("word of NOPs added between word multiply and 16-bit multiply")); + } + } } - fm = (struct d30v_format *) &d30v_format_table[++k]; + + extype = EXEC_UNKNOWN; } } - return NULL; + else if ( (extype == EXEC_REVSEQ) + && cur_mul32_p + && (prev_opcode.op->flags_used & (FLAG_MEM | FLAG_MUL16))) + { + /* Can't parallelize, flush current instruction and add a + sequential NOP. */ + write_1_short (&opcode, (long) insn, fixups->next->next, TRUE); + + /* Make the previous instruction the current one. */ + extype = EXEC_UNKNOWN; + insn = prev_insn; + now_seg = prev_seg; + now_subseg = prev_subseg; + prev_insn = -1; + cur_mul32_p = prev_mul32_p; + prev_mul32_p = 0; + memcpy (&opcode, &prev_opcode, sizeof (prev_opcode)); + } + + /* If this is a long instruction, write it and any previous short + instruction. */ + if (opcode.form->form >= LONG) + { + if (extype != EXEC_UNKNOWN) + as_bad (_("Instruction uses long version, so it cannot be mixed as specified")); + d30v_cleanup (FALSE); + write_long (&opcode, insn, fixups); + prev_insn = -1; + } + else if ((prev_insn != -1) + && (write_2_short + (&prev_opcode, (long) prev_insn, &opcode, + (long) insn, extype, fixups) == 0)) + { + /* No instructions saved. */ + prev_insn = -1; + } + else + { + if (extype != EXEC_UNKNOWN) + as_bad (_("Unable to mix instructions as specified")); + + /* Save off last instruction so it may be packed on next pass. */ + memcpy (&prev_opcode, &opcode, sizeof (prev_opcode)); + prev_insn = insn; + prev_seg = now_seg; + prev_subseg = now_subseg; + fixups = fixups->next; + prev_mul32_p = cur_mul32_p; + } } /* If while processing a fixup, a reloc really needs to be created, then it is done here. */ arelent * -tc_gen_reloc (seg, fixp) - asection *seg ATTRIBUTE_UNUSED; - fixS *fixp; +tc_gen_reloc (asection *seg ATTRIBUTE_UNUSED, fixS *fixp) { arelent *reloc; - reloc = (arelent *) xmalloc (sizeof (arelent)); - reloc->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *)); + reloc = xmalloc (sizeof (arelent)); + reloc->sym_ptr_ptr = xmalloc (sizeof (asymbol *)); *reloc->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy); reloc->address = fixp->fx_frag->fr_address + fixp->fx_where; reloc->howto = bfd_reloc_type_lookup (stdoutput, fixp->fx_r_type); - if (reloc->howto == (reloc_howto_type *) NULL) + if (reloc->howto == NULL) { as_bad_where (fixp->fx_file, fixp->fx_line, _("reloc %d not supported by object file format"), @@ -1798,18 +1811,15 @@ tc_gen_reloc (seg, fixp) } int -md_estimate_size_before_relax (fragp, seg) - fragS *fragp ATTRIBUTE_UNUSED; - asection *seg ATTRIBUTE_UNUSED; +md_estimate_size_before_relax (fragS *fragp ATTRIBUTE_UNUSED, + asection *seg ATTRIBUTE_UNUSED) { abort (); return 0; } long -md_pcrel_from_section (fixp, sec) - fixS *fixp; - segT sec; +md_pcrel_from_section (fixS *fixp, segT sec) { if (fixp->fx_addsy != (symbolS *) NULL && (!S_IS_DEFINED (fixp->fx_addsy) @@ -1818,11 +1828,103 @@ md_pcrel_from_section (fixp, sec) return fixp->fx_frag->fr_address + fixp->fx_where; } +/* Called after the assembler has finished parsing the input file or + after a label is defined. Because the D30V assembler sometimes + saves short instructions to see if it can package them with the + next instruction, there may be a short instruction that still needs + written. */ + +int +d30v_cleanup (int use_sequential) +{ + segT seg; + subsegT subseg; + + if (prev_insn != -1) + { + seg = now_seg; + subseg = now_subseg; + subseg_set (prev_seg, prev_subseg); + write_1_short (&prev_opcode, (long) prev_insn, fixups->next, + use_sequential); + subseg_set (seg, subseg); + prev_insn = -1; + if (use_sequential) + prev_mul32_p = FALSE; + } + + return 1; +} + +/* This function is called at the start of every line. It checks to + see if the first character is a '.', which indicates the start of a + pseudo-op. If it is, then write out any unwritten instructions. */ + void -md_apply_fix3 (fixP, valP, seg) - fixS *fixP; - valueT *valP; - segT seg ATTRIBUTE_UNUSED; +d30v_start_line (void) +{ + char *c = input_line_pointer; + + while (ISSPACE (*c)) + c++; + + if (*c == '.') + d30v_cleanup (FALSE); +} + +static void +check_size (long value, int bits, char *file, int line) +{ + int tmp, max; + + if (value < 0) + tmp = ~value; + else + tmp = value; + + max = (1 << (bits - 1)) - 1; + + if (tmp > max) + as_bad_where (file, line, _("value too large to fit in %d bits"), bits); +} + +/* d30v_frob_label() is called when after a label is recognized. */ + +void +d30v_frob_label (symbolS *lab) +{ + /* Emit any pending instructions. */ + d30v_cleanup (FALSE); + + /* Update the label's address with the current output pointer. */ + symbol_set_frag (lab, frag_now); + S_SET_VALUE (lab, (valueT) frag_now_fix ()); + + /* Record this label for future adjustment after we find out what + kind of data it references, and the required alignment therewith. */ + d30v_last_label = lab; +} + +/* Hook into cons for capturing alignment changes. */ + +void +d30v_cons_align (int size) +{ + int log_size; + + log_size = 0; + while ((size >>= 1) != 0) + ++log_size; + + if (d30v_current_align < log_size) + d30v_align (log_size, (char *) NULL, NULL); + else if (d30v_current_align > log_size) + d30v_current_align = log_size; + d30v_last_label = NULL; +} + +void +md_apply_fix3 (fixS *fixP, valueT *valP, segT seg ATTRIBUTE_UNUSED) { char *where; unsigned long insn, insn2; @@ -1960,213 +2062,11 @@ md_apply_fix3 (fixP, valP, seg) } } -/* Called after the assembler has finished parsing the input file or - after a label is defined. Because the D30V assembler sometimes - saves short instructions to see if it can package them with the - next instruction, there may be a short instruction that still needs - written. */ - -int -d30v_cleanup (use_sequential) - int use_sequential; -{ - segT seg; - subsegT subseg; - - if (prev_insn != -1) - { - seg = now_seg; - subseg = now_subseg; - subseg_set (prev_seg, prev_subseg); - write_1_short (&prev_opcode, (long) prev_insn, fixups->next, - use_sequential); - subseg_set (seg, subseg); - prev_insn = -1; - if (use_sequential) - prev_mul32_p = FALSE; - } - - return 1; -} - -static void -d30v_number_to_chars (buf, value, n) - char *buf; /* Return 'nbytes' of chars here. */ - long long value; /* The value of the bits. */ - int n; /* Number of bytes in the output. */ -{ - while (n--) - { - buf[n] = value & 0xff; - value >>= 8; - } -} - -/* This function is called at the start of every line. It checks to - see if the first character is a '.', which indicates the start of a - pseudo-op. If it is, then write out any unwritten instructions. */ - -void -d30v_start_line () -{ - char *c = input_line_pointer; - - while (ISSPACE (*c)) - c++; - - if (*c == '.') - d30v_cleanup (FALSE); -} - -static void -check_size (value, bits, file, line) - long value; - int bits; - char *file; - int line; -{ - int tmp, max; - - if (value < 0) - tmp = ~value; - else - tmp = value; - - max = (1 << (bits - 1)) - 1; - - if (tmp > max) - as_bad_where (file, line, _("value too large to fit in %d bits"), bits); -} - -/* d30v_frob_label() is called when after a label is recognized. */ - -void -d30v_frob_label (lab) - symbolS *lab; -{ - /* Emit any pending instructions. */ - d30v_cleanup (FALSE); - - /* Update the label's address with the current output pointer. */ - symbol_set_frag (lab, frag_now); - S_SET_VALUE (lab, (valueT) frag_now_fix ()); - - /* Record this label for future adjustment after we find out what - kind of data it references, and the required alignment therewith. */ - d30v_last_label = lab; -} - -/* Hook into cons for capturing alignment changes. */ - -void -d30v_cons_align (size) - int size; -{ - int log_size; - - log_size = 0; - while ((size >>= 1) != 0) - ++log_size; - - if (d30v_current_align < log_size) - d30v_align (log_size, (char *) NULL, NULL); - else if (d30v_current_align > log_size) - d30v_current_align = log_size; - d30v_last_label = NULL; -} - -/* Called internally to handle all alignment needs. This takes care - of eliding calls to frag_align if'n the cached current alignment - says we've already got it, as well as taking care of the auto-aligning - labels wrt code. */ - -static void -d30v_align (n, pfill, label) - int n; - char *pfill; - symbolS *label; -{ - /* The front end is prone to changing segments out from under us - temporarily when -g is in effect. */ - int switched_seg_p = (d30v_current_align_seg != now_seg); - - /* Do not assume that if 'd30v_current_align >= n' and - '! switched_seg_p' that it is safe to avoid performing - this alignment request. The alignment of the current frag - can be changed under our feet, for example by a .ascii - directive in the source code. cf testsuite/gas/d30v/reloc.s */ - d30v_cleanup (FALSE); - - if (pfill == NULL) - { - if (n > 2 - && (bfd_get_section_flags (stdoutput, now_seg) & SEC_CODE) != 0) - { - static char const nop[4] = { 0x00, 0xf0, 0x00, 0x00 }; - - /* First, make sure we're on a four-byte boundary, in case - someone has been putting .byte values the text section. */ - if (d30v_current_align < 2 || switched_seg_p) - frag_align (2, 0, 0); - frag_align_pattern (n, nop, sizeof nop, 0); - } - else - frag_align (n, 0, 0); - } - else - frag_align (n, *pfill, 0); - - if (!switched_seg_p) - d30v_current_align = n; - - if (label != NULL) - { - symbolS *sym; - int label_seen = FALSE; - struct frag *old_frag; - valueT old_value; - valueT new_value; - - assert (S_GET_SEGMENT (label) == now_seg); - - old_frag = symbol_get_frag (label); - old_value = S_GET_VALUE (label); - new_value = (valueT) frag_now_fix (); - - /* It is possible to have more than one label at a particular - address, especially if debugging is enabled, so we must - take care to adjust all the labels at this address in this - fragment. To save time we search from the end of the symbol - list, backwards, since the symbols we are interested in are - almost certainly the ones that were most recently added. - Also to save time we stop searching once we have seen at least - one matching label, and we encounter a label that is no longer - in the target fragment. Note, this search is guaranteed to - find at least one match when sym == label, so no special case - code is necessary. */ - for (sym = symbol_lastP; sym != NULL; sym = symbol_previous (sym)) - { - if (symbol_get_frag (sym) == old_frag - && S_GET_VALUE (sym) == old_value) - { - label_seen = TRUE; - symbol_set_frag (sym, frag_now); - S_SET_VALUE (sym, new_value); - } - else if (label_seen && symbol_get_frag (sym) != old_frag) - break; - } - } - - record_alignment (now_seg, n); -} - /* Handle the .align pseudo-op. This aligns to a power of two. We hook here to latch the current alignment. */ static void -s_d30v_align (ignore) - int ignore ATTRIBUTE_UNUSED; +s_d30v_align (int ignore ATTRIBUTE_UNUSED) { int align; char fill, *pfill = NULL; @@ -2201,8 +2101,7 @@ s_d30v_align (ignore) clears the saved last label and resets known alignment. */ static void -s_d30v_text (i) - int i; +s_d30v_text (int i) { s_text (i); @@ -2215,8 +2114,7 @@ s_d30v_text (i) clears the saved last label and resets known alignment. */ static void -s_d30v_data (i) - int i; +s_d30v_data (int i) { s_data (i); d30v_last_label = NULL; @@ -2228,11 +2126,26 @@ s_d30v_data (i) clears the saved last label and resets known alignment. */ static void -s_d30v_section (ignore) - int ignore; +s_d30v_section (int ignore) { obj_elf_section (ignore); d30v_last_label = NULL; d30v_current_align = 0; d30v_current_align_seg = now_seg; } + +/* The target specific pseudo-ops which we support. */ +const pseudo_typeS md_pseudo_table[] = +{ + { "word", cons, 4 }, + { "hword", cons, 2 }, + { "align", s_d30v_align, 0 }, + { "text", s_d30v_text, 0 }, + { "data", s_d30v_data, 0 }, + { "section", s_d30v_section, 0 }, + { "section.s", s_d30v_section, 0 }, + { "sect", s_d30v_section, 0 }, + { "sect.s", s_d30v_section, 0 }, + { NULL, NULL, 0 } +}; + |