/* tc-tahoe.c
- Not part of GAS yet. */
+ Not part of GAS yet. */
#include "as.h"
#include "obstack.h"
int top_ndx; /* -1, or index register. eg 7=[R7] */
int top_reg; /* -1, or register number. eg 7 = R7 or (R7) */
byte top_mode; /* Addressing mode byte. This byte, defines
- which of the 11 modes opcode is. */
+ which of the 11 modes opcode is. */
char top_access; /* Access type wanted for this opperand
'b'branch ' 'no-instruction 'amrvw' */
};
/* The addressing modes for an operand. These numbers are the acutal values
- for certain modes, so be carefull if you screw with them. */
+ for certain modes, so be carefull if you screw with them. */
#define TAHOE_DIRECT_REG (0x50)
#define TAHOE_REG_DEFERRED (0x60)
#define TAHOE_WIDTH_BIG_NON_REV_JUMP ':'
/* The hex code for certain tahoe commands and modes.
- This is just for readability. */
+ This is just for readability. */
#define TAHOE_JMP (0x71)
#define TAHOE_PC_REL_LONG (0xEF)
#define TAHOE_BRB (0x11)
#define TAHOE_BRW (0x13)
/* These, when 'ored' with, or added to, a register number,
- set up the number for the displacement mode. */
+ set up the number for the displacement mode. */
#define TAHOE_PC_OR_BYTE (0xA0)
#define TAHOE_PC_OR_WORD (0xC0)
#define TAHOE_PC_OR_LONG (0xE0)
struct tit /* get it out of the sewer, it stands for
tahoe instruction tree (Geeze!) */
{
- tahoe_opcodeT tit_opcode; /* The opcode. */
- byte tit_operands; /* How many operands are here. */
+ tahoe_opcodeT tit_opcode; /* The opcode. */
+ byte tit_operands; /* How many operands are here. */
struct top tit_operand[TIT_MAX_OPERANDS]; /* Operands */
char *tit_error; /* "" or fatal error text */
};
long omagic = OMAGIC;
/* These chars start a comment anywhere in a source file (except inside
- another comment or a quoted string. */
+ another comment or a quoted string. */
const char comment_chars[] = "#;";
-/* These chars only start a comment at the beginning of a line. */
+/* These chars only start a comment at the beginning of a line. */
const char line_comment_chars[] = "#";
/* Chars that can be used to separate mant from exp in floating point nums */
as in 0f123.456
or 0d1.234E-12 (see exp chars above)
Note: The Tahoe port doesn't support floating point constants. This is
- consistant with 'as' If it's needed, I can always add it later. */
+ consistant with 'as' If it's needed, I can always add it later. */
const char FLT_CHARS[] = "df";
/* Also be aware that MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT may have to be
(The tahoe has plenty of room, so the change currently isn't needed.)
*/
-static struct tit t; /* A tahoe instruction after decoding. */
+static struct tit t; /* A tahoe instruction after decoding. */
void float_cons ();
/* A table of pseudo ops (sans .), the function called, and an integer op
- that the function is called with. */
+ that the function is called with. */
const pseudo_typeS md_pseudo_table[] =
{
Always, 1 byte opcode, then displacement/absolute.
If word or longword, change opcode to brw or jmp.
-
2. TAHOE_WIDTH_CONDITIONAL_JUMP (?)
J<cond> where <cond> is a simple flag test.
Format: "b?"
to them. (WF + length(word))
The first letter is Byte, Word.
- 2nd letter is Forward, Backward. */
+ 2nd letter is Forward, Backward. */
#define BF (1+ 127)
#define BB (1+-128)
#define WF (2+ 32767)
/* Dont need LF, LB because they always reach. [They are coded as 0.] */
#define C(a,b) ENCODE_RELAX(a,b)
-/* This macro has no side-effects. */
+/* This macro has no side-effects. */
#define ENCODE_RELAX(what,length) (((what) << 2) + (length))
#define RELAX_STATE(what) ((what) >> 2)
#define RELAX_LENGTH(length) ((length) && 3)
/* This is the table used by gas to figure out relaxing modes. The fields are
forward_branch reach, backward_branch reach, number of bytes it would take,
- where the next biggest branch is. */
+ where the next biggest branch is. */
const relax_typeS md_relax_table[] =
{
{
}, /* unused 1,3 */
/* Reversible Conditional Branch. If the branch won't reach, reverse
it, and jump over a brw or a jmp that will reach. The relax part is the
- actual address. */
+ actual address. */
{
BF, BB, 1, C (2, 1)
}, /* b<cond> B`foo 2,0 */
1, 1, 0, 0
}, /* unused 2,3 */
/* Another type of reversable branch. But this only has a word
- displacement. */
+ displacement. */
{
1, 1, 0, 0
}, /* unused 3,0 */
displacement. If I can't reach, branch over a byte branch, to a
jump that will reach. The jumped branch jumps over the reaching
branch, to continue with the flow of the program. It's like playing
- leap frog. */
+ leap frog. */
{
1, 1, 0, 0
}, /* unused 4,0 */
}, /* unused 4,3 */
/* Normal displacement mode, no jumping or anything like that.
The relax points to one byte before the address, thats why all
- the numbers are up by one. */
+ the numbers are up by one. */
{
BF + 1, BB + 1, 2, C (5, 1)
}, /* B^"foo" 5,0 */
md_begin() will crash. */
static struct hash_control *op_hash;
-/* Init function. Build the hash table. */
+/* Init function. Build the hash table. */
void
md_begin ()
{
struct tot *tP;
char *errorval = 0;
- int synthetic_too = 1; /* If 0, just use real opcodes. */
+ int synthetic_too = 1; /* If 0, just use real opcodes. */
op_hash = hash_new ();
\f
/* The functions in this section take numbers in the machine format, and
munges them into Tahoe byte order.
- They exist primarily for cross assembly purpose. */
-void /* Knows about order of bytes in address. */
+ They exist primarily for cross assembly purpose. */
+void /* Knows about order of bytes in address. */
md_number_to_chars (con, value, nbytes)
- char con[]; /* Return 'nbytes' of chars here. */
- valueT value; /* The value of the bits. */
- int nbytes; /* Number of bytes in the output. */
+ char con[]; /* Return 'nbytes' of chars here. */
+ valueT value; /* The value of the bits. */
+ int nbytes; /* Number of bytes in the output. */
{
number_to_chars_bigendian (con, value, nbytes);
}
#ifdef comment
-void /* Knows about order of bytes in address. */
+void /* Knows about order of bytes in address. */
md_number_to_imm (con, value, nbytes)
- char con[]; /* Return 'nbytes' of chars here. */
- long int value; /* The value of the bits. */
- int nbytes; /* Number of bytes in the output. */
+ char con[]; /* Return 'nbytes' of chars here. */
+ long int value; /* The value of the bits. */
+ int nbytes; /* Number of bytes in the output. */
{
md_number_to_chars (con, value, nbytes);
}
know (0);
}
-void /* Knows about order of bytes in address. */
+void /* Knows about order of bytes in address. */
md_number_to_disp (con, value, nbytes)
- char con[]; /* Return 'nbytes' of chars here. */
- long int value; /* The value of the bits. */
- int nbytes; /* Number of bytes in the output. */
+ char con[]; /* Return 'nbytes' of chars here. */
+ long int value; /* The value of the bits. */
+ int nbytes; /* Number of bytes in the output. */
{
md_number_to_chars (con, value, nbytes);
}
-void /* Knows about order of bytes in address. */
+void /* Knows about order of bytes in address. */
md_number_to_field (con, value, nbytes)
- char con[]; /* Return 'nbytes' of chars here. */
- long int value; /* The value of the bits. */
- int nbytes; /* Number of bytes in the output. */
+ char con[]; /* Return 'nbytes' of chars here. */
+ long int value; /* The value of the bits. */
+ int nbytes; /* Number of bytes in the output. */
{
md_number_to_chars (con, value, nbytes);
}
next three bytes are symbolnum, in kind of 3 byte big endian (least sig. byte last).
The last byte is broken up with bit 7 as pcrel,
bits 6 & 5 as length,
- bit 4 as extern and the last nibble as 'undefined'. */
+ bit 4 as extern and the last nibble as 'undefined'. */
#if comment
void
{
byte the_bytes[sizeof (struct relocation_info)];
/* The reason I can't just encode these directly into ri_p is that
- ri_p may point to ri. */
+ ri_p may point to ri. */
/* This is easy */
md_number_to_chars (the_bytes, ri.r_address, sizeof (ri.r_address));
next three bytes are symbolnum, in kind of 3 byte big endian (least sig. byte last).
The last byte is broken up with bit 7 as pcrel,
bits 6 & 5 as length,
- bit 4 as extern and the last nibble as 'undefined'. */
+ bit 4 as extern and the last nibble as 'undefined'. */
-void
+void
tc_aout_fix_to_chars (where, fixP, segment_address_in_file)
char *where;
fixS *fixP;
/* Relocate byte stuff */
\f
-/* This is for broken word. */
+/* This is for broken word. */
const int md_short_jump_size = 3;
void
int
md_estimate_size_before_relax (fragP, segment_type)
register fragS *fragP;
- segT segment_type; /* N_DATA or N_TEXT. */
+ segT segment_type; /* N_DATA or N_TEXT. */
{
register char *p;
register int old_fr_fix;
if (S_GET_SEGMENT (fragP->fr_symbol) == segment_type)
{
/* The symbol was in the same segment as the opcode, and it's
- a real pc_rel case so it's a relaxable case. */
+ a real pc_rel case so it's a relaxable case. */
fragP->fr_subtype = ENCODE_RELAX (STATE_PC_RELATIVE, STATE_BYTE);
}
else
{
/* This case is still undefined, so asume it's a long word for the
- linker to fix. */
+ linker to fix. */
p = fragP->fr_literal + old_fr_fix;
*p |= TAHOE_PC_OR_LONG;
- /* We now know how big it will be, one long word. */
+ /* We now know how big it will be, one long word. */
fragP->fr_fix += 1 + 4;
fix_new (fragP, old_fr_fix + 1, fragP->fr_symbol,
fragP->fr_offset, FX_PCREL32, NULL);
else
{
p = fragP->fr_literal + old_fr_fix;
- *fragP->fr_opcode ^= 0x10; /* Reverse sense of branch. */
+ *fragP->fr_opcode ^= 0x10; /* Reverse sense of branch. */
*p++ = 6;
*p++ = TAHOE_JMP;
*p++ = TAHOE_PC_REL_LONG;
else
{
p = fragP->fr_literal + old_fr_fix;
- *fragP->fr_opcode ^= 0x10; /* Reverse sense of branch. */
+ *fragP->fr_opcode ^= 0x10; /* Reverse sense of branch. */
*p++ = 0;
*p++ = 6;
*p++ = TAHOE_JMP;
segT seg;
register fragS *fragP;
{
- register char *addressP; /* -> _var to change. */
- register char *opcodeP; /* -> opcode char(s) to change. */
+ register char *addressP; /* -> _var to change. */
+ register char *opcodeP; /* -> opcode char(s) to change. */
register short int length_code; /* 2=long 1=word 0=byte */
register short int extension = 0; /* Size of relaxed address.
- Added to fr_fix: incl. ALL var chars. */
+ Added to fr_fix: incl. ALL var chars. */
register symbolS *symbolP;
register long int where;
register long int address_of_var;
case ENCODE_RELAX (STATE_PC_RELATIVE, STATE_BYTE):
/* *addressP holds the registers number, plus 0x10, if it's deferred
mode. To set up the right mode, just OR the size of this displacement */
- /* Byte displacement. */
+ /* Byte displacement. */
*addressP++ |= TAHOE_PC_OR_BYTE;
*addressP = target_address - (address_of_var + 2);
extension = 2;
break;
case ENCODE_RELAX (STATE_PC_RELATIVE, STATE_WORD):
- /* Word displacement. */
+ /* Word displacement. */
*addressP++ |= TAHOE_PC_OR_WORD;
md_number_to_chars (addressP, target_address - (address_of_var + 3), 2);
extension = 3;
break;
case ENCODE_RELAX (STATE_PC_RELATIVE, STATE_LONG):
- /* Long word displacement. */
+ /* Long word displacement. */
*addressP++ |= TAHOE_PC_OR_LONG;
md_number_to_chars (addressP, target_address - (address_of_var + 5), 4);
extension = 5;
break;
case ENCODE_RELAX (STATE_CONDITIONAL_BRANCH, STATE_WORD):
- *opcodeP ^= 0x10; /* Reverse sense of test. */
+ *opcodeP ^= 0x10; /* Reverse sense of test. */
*addressP++ = 3; /* Jump over word branch */
*addressP++ = TAHOE_BRW;
md_number_to_chars (addressP, target_address - (address_of_var + 4), 2);
break;
case ENCODE_RELAX (STATE_CONDITIONAL_BRANCH, STATE_LONG):
- *opcodeP ^= 0x10; /* Reverse sense of test. */
+ *opcodeP ^= 0x10; /* Reverse sense of test. */
*addressP++ = 6;
*addressP++ = TAHOE_JMP;
*addressP++ = TAHOE_PC_REL_LONG;
} /* md_convert_frag */
\f
-/* This is the stuff for md_assemble. */
+/* This is the stuff for md_assemble. */
#define FP_REG 13
#define SP_REG 14
#define PC_REG 15
*/
int
tahoe_reg_parse (start)
- char **start; /* A pointer to the string to parse. */
+ char **start; /* A pointer to the string to parse. */
{
register char *regpoint = *start;
register int regnum = -1;
switch (*regpoint++)
{
case '%': /* Registers can start with a %,
- R or r, and then a number. */
+ R or r, and then a number. */
case 'R':
case 'r':
if (isdigit (*regpoint))
{
- /* Got the first digit. */
+ /* Got the first digit. */
regnum = *regpoint++ - '0';
if ((regnum == 1) && isdigit (*regpoint))
{
- /* Its a two digit number. */
+ /* Its a two digit number. */
regnum = 10 + (*regpoint++ - '0');
if (regnum > BIGGESTREG)
{ /* Number too big? */
out: ndx, reg, mode, error, dispsize */
{
- int mode = 0; /* This operand's mode. */
- char segfault = *optex; /* To keep the back parsing from freaking. */
- char *point = optex + 1; /* Parsing from front to back. */
- char *end; /* Parsing from back to front. */
+ int mode = 0; /* This operand's mode. */
+ char segfault = *optex; /* To keep the back parsing from freaking. */
+ char *point = optex + 1; /* Parsing from front to back. */
+ char *end; /* Parsing from back to front. */
int reg = -1; /* major register, -1 means absent */
int imreg = -1; /* Major register in immediate mode */
int ndx = -1; /* index register number, -1 means absent */
char dec_inc = ' '; /* Is the SP auto-incremented '+' or
- auto-decremented '-' or neither ' '. */
+ auto-decremented '-' or neither ' '. */
int immediate = 0; /* 1 if '$' immediate mode */
int call_width = 0; /* If the caller casts the displacement */
int abs_width = 0; /* The width of the absolute displacment */
char *tp, *temp, c; /* Temporary holders */
- char access = topP->top_access; /* Save on a deref. */
+ char access = topP->top_access; /* Save on a deref. */
char width = topP->top_width;
int really_none = 0; /* Empty expressions evaluate to 0
but I need to know if it's there or not */
expressionS *expP; /* -> expression values for this operand */
- /* Does this command restrict the displacement size. */
+ /* Does this command restrict the displacement size. */
if (access == 'b')
com_width = (width == 'b' ? 1 :
(width == 'w' ? 2 :
* yank.
*/
- for (end = point; *end != '\0'; end++) /* Move to the end. */
+ for (end = point; *end != '\0'; end++) /* Move to the end. */
;
if (end != point) /* Null string? */
if (end > point && *end == ' ' && end[-1] != '\'')
end--; /* Hop white space */
- /* Is this an index reg. */
+ /* Is this an index reg. */
if ((*end == ']') && (end[-1] != '\''))
{
temp = end;
- /* Find opening brace. */
+ /* Find opening brace. */
for (--end; (*end != '[' && end != point); end--)
;
- /* If I found the opening brace, get the index register number. */
+ /* If I found the opening brace, get the index register number. */
if (*end == '[')
{
- tp = end + 1; /* tp should point to the start of a reg. */
+ tp = end + 1; /* tp should point to the start of a reg. */
ndx = tahoe_reg_parse (&tp);
if (tp != temp)
- { /* Reg. parse error. */
+ { /* Reg. parse error. */
ndx = -1;
}
else
{
- end--; /* Found it, move past brace. */
+ end--; /* Found it, move past brace. */
}
if (ndx == -1)
{
op_bad = _("Couldn't parse the [index] in this operand.");
- end = point; /* Force all the rest of the tests to fail. */
+ end = point; /* Force all the rest of the tests to fail. */
}
}
else
{
op_bad = _("Couldn't find the opening '[' for the index of this operand.");
- end = point; /* Force all the rest of the tests to fail. */
+ end = point; /* Force all the rest of the tests to fail. */
}
}
{
temp = end;
- /* Find opening paren. */
+ /* Find opening paren. */
for (--end; (*end != '(' && end != point); end--)
;
- /* If I found the opening paren, get the register number. */
+ /* If I found the opening paren, get the register number. */
if (*end == '(')
{
tp = end + 1;
reg = tahoe_reg_parse (&tp);
if (tp != temp)
{
- /* Not a register, but could be part of the expression. */
+ /* Not a register, but could be part of the expression. */
reg = -1;
end = temp; /* Rest the pointer back */
}
else
{
- end--; /* Found the reg. move before opening paren. */
+ end--; /* Found the reg. move before opening paren. */
}
}
else
{
op_bad = _("Couldn't find the opening '(' for the deref of this operand.");
- end = point; /* Force all the rest of the tests to fail. */
+ end = point; /* Force all the rest of the tests to fail. */
}
}
if it is there.*/
if (*point != '\0')
{
- /* If there is junk after point, then the it's not immediate reg. */
+ /* If there is junk after point, then the it's not immediate reg. */
point = tp;
imreg = -1;
}
really_none = 1;
case O_constant:
/* for SEG_ABSOLUTE, we shouldnt need to set X_op_symbol,
- X_add_symbol to any particular value. */
+ X_add_symbol to any particular value. */
/* But, we will program defensively. Since this situation occurs
- rarely so it costs us little to do so. */
+ rarely so it costs us little to do so. */
expP->X_add_symbol = NULL;
expP->X_op_symbol = NULL;
/* How many bytes are needed to express this abs value? */
case O_big:
/* This is an error. Tahoe doesn't allow any expressions
bigger that a 32 bit long word. Any bigger has to be referenced
- by address. */
+ by address. */
op_bad = _("Expression is too large for a 32 bits.");
break;
}
/* I'm done, so restore optex */
*optex = segfault;
-
/*
* At this point in the game, we (in theory) have all the components of
* the operand at least parsed. Now it's time to check for syntax/semantic
op_bad = _("You can't index a register in immediate mode.");
if (access == 'a')
op_bad = _("Immediate access can't be used as an address.");
- /* ponder the wisdom of a cast because it doesn't do any good. */
+ /* ponder the wisdom of a cast because it doesn't do any good. */
}
else if (deferred)
{
/*
* At this point, all the errors we can do have be checked for.
- * We can build the 'top'. */
+ * We can build the 'top'. */
topP->top_ndx = ndx;
topP->top_reg = reg;
static void
tip (titP, instring)
- struct tit *titP; /* We build an exploded instruction here. */
- char *instring; /* Text of a vax instruction: we modify. */
+ struct tit *titP; /* We build an exploded instruction here. */
+ char *instring; /* Text of a vax instruction: we modify. */
{
- register struct tot_wot *twP = NULL; /* How to bit-encode this opcode. */
+ register struct tot_wot *twP = NULL; /* How to bit-encode this opcode. */
register char *p; /* 1/skip whitespace.2/scan vot_how */
register char *q; /* */
register unsigned char count; /* counts number of operands seen */
register struct top *operandp;/* scan operands in struct tit */
register char *alloperr = ""; /* error over all operands */
register char c; /* Remember char, (we clobber it
- with '\0' temporarily). */
+ with '\0' temporarily). */
char *save_input_line_pointer;
if (*instring == ' ')
- ++instring; /* Skip leading whitespace. */
+ ++instring; /* Skip leading whitespace. */
for (p = instring; *p && *p != ' '; p++)
; /* MUST end in end-of-string or
- exactly 1 space. */
- /* Scanned up to end of operation-code. */
- /* Operation-code is ended with whitespace. */
+ exactly 1 space. */
+ /* Scanned up to end of operation-code. */
+ /* Operation-code is ended with whitespace. */
if (p == instring)
{
titP->tit_error = _("No operator");
* We trust instring points to an op-name, with no whitespace.
*/
twP = (struct tot_wot *) hash_find (op_hash, instring);
- *p = c; /* Restore char after op-code. */
+ *p = c; /* Restore char after op-code. */
if (twP == 0)
{
titP->tit_error = _("Unknown operator");
operandp->top_access = p[0];
operandp->top_width = p[1];
tip_op (instring - 1, operandp);
- *q = c; /* Restore input text. */
+ *q = c; /* Restore input text. */
if (*(operandp->top_error))
{
alloperr = operandp->top_error;
else
alloperr = _("Not enough operands");
}
- /* Restore the pointer. */
+ /* Restore the pointer. */
input_line_pointer = save_input_line_pointer;
if (!*alloperr)
{
if (*instring == ' ')
- instring++; /* Skip whitespace. */
+ instring++; /* Skip whitespace. */
if (*instring)
alloperr = _("Too many operands");
}
}
}
- titP->tit_opcode = twP->code; /* The op-code. */
+ titP->tit_opcode = twP->code; /* The op-code. */
titP->tit_operands = count;
} /* tip */
\f
/* md_assemble() emit frags for 1 instruction */
void
md_assemble (instruction_string)
- char *instruction_string; /* A string: assemble 1 instruction. */
+ char *instruction_string; /* A string: assemble 1 instruction. */
{
char *p;
- register struct top *operandP;/* An operand. Scans all operands. */
- /* char c_save; fixme: remove this line *//* What used to live after an expression. */
- /* struct frag *fragP; fixme: remove this line *//* Fragment of code we just made. */
+ register struct top *operandP;/* An operand. Scans all operands. */
+ /* char c_save; fixme: remove this line *//* What used to live after an expression. */
+ /* struct frag *fragP; fixme: remove this line *//* Fragment of code we just made. */
/* register struct top *end_operandP; fixme: remove this line *//* -> slot just after last operand
- Limit of the for (each operand). */
+ Limit of the for (each operand). */
register expressionS *expP; /* -> expression values for this operand */
- /* These refer to an instruction operand expression. */
+ /* These refer to an instruction operand expression. */
segT to_seg; /* Target segment of the address. */
register valueT this_add_number;
- register symbolS *this_add_symbol; /* +ve (minuend) symbol. */
+ register symbolS *this_add_symbol; /* +ve (minuend) symbol. */
- /* tahoe_opcodeT opcode_as_number; fixme: remove this line *//* The opcode as a number. */
- char *opcodeP; /* Where it is in a frag. */
- /* char *opmodeP; fixme: remove this line *//* Where opcode type is, in a frag. */
+ /* tahoe_opcodeT opcode_as_number; fixme: remove this line *//* The opcode as a number. */
+ char *opcodeP; /* Where it is in a frag. */
+ /* char *opmodeP; fixme: remove this line *//* Where opcode type is, in a frag. */
int dispsize; /* From top_dispsize: tahoe_operand_width
(in bytes) */
int is_undefined; /* 1 if operand expression's
- segment not known yet. */
+ segment not known yet. */
int pc_rel; /* Is this operand pc relative? */
- /* Decode the operand. */
+ /* Decode the operand. */
tip (&t, instruction_string);
/*
else
{
/* We saw no errors in any operands - try to make frag(s) */
- /* Emit op-code. */
- /* Remember where it is, in case we want to modify the op-code later. */
+ /* Emit op-code. */
+ /* Remember where it is, in case we want to modify the op-code later. */
opcodeP = frag_more (1);
*opcodeP = t.tit_opcode;
- /* Now do each operand. */
+ /* Now do each operand. */
for (operandP = t.tit_operand;
operandP < t.tit_operand + t.tit_operands;
operandP++)
FRAG_APPEND_1_CHAR (0x40 + operandP->top_ndx);
} /* if(top_ndx>=0) */
- /* Here to make main operand frag(s). */
+ /* Here to make main operand frag(s). */
this_add_number = expP->X_add_number;
this_add_symbol = expP->X_add_symbol;
to_seg = operandP->seg_of_operand;
if (operandP->top_access == 'b')
{
/* Branches must be expressions. A psuedo branch can also jump to
- an absolute address. */
+ an absolute address. */
if (to_seg == now_seg || is_undefined)
{
- /* If is_undefined, then it might BECOME now_seg by relax time. */
+ /* If is_undefined, then it might BECOME now_seg by relax time. */
if (dispsize)
{
/* I know how big the branch is supposed to be (it's a normal
- branch), so I set up the frag, and let GAS do the rest. */
+ branch), so I set up the frag, and let GAS do the rest. */
p = frag_more (dispsize);
fix_new (frag_now, p - frag_now->fr_literal,
this_add_symbol, this_add_number,
{
/* (to_seg==now_seg || to_seg == SEG_UNKNOWN) && dispsize==0 */
/* If we don't know how big it is, then its a synthetic branch,
- so we set up a simple relax state. */
+ so we set up a simple relax state. */
switch (operandP->top_width)
{
case TAHOE_WIDTH_CONDITIONAL_JUMP:
break;
case TAHOE_WIDTH_ALWAYS_JUMP:
/* Simple (unconditional) jump. I may have to convert this to
- a word branch, or an absolute jump. */
+ a word branch, or an absolute jump. */
frag_var (rs_machine_dependent, 5, 1,
ENCODE_RELAX (STATE_ALWAYS_BRANCH,
is_undefined ? STATE_UNDF : STATE_BYTE),
this_add_symbol, this_add_number, opcodeP);
break;
- /* The smallest size for the next 2 cases is word. */
+ /* The smallest size for the next 2 cases is word. */
case TAHOE_WIDTH_BIG_REV_JUMP:
frag_var (rs_machine_dependent, 8, 2,
ENCODE_RELAX (STATE_BIG_REV_BRANCH,
{
/* to_seg != now_seg && to_seg != seg_unknown (still in branch)
In other words, I'm jumping out of my segment so extend the
- branches to jumps, and let GAS fix them. */
+ branches to jumps, and let GAS fix them. */
/* These are "branches" what will always be branches around a jump
to the correct addresss in real life.
If to_seg is SEG_ABSOLUTE, just encode the branch in,
- else let GAS fix the address. */
+ else let GAS fix the address. */
switch (operandP->top_width)
{
/* The theory:
For SEG_ABSOLUTE, then mode is ABSOLUTE_ADDR, jump
to that addresss (not pc_rel).
- For other segs, address is a long word PC rel jump. */
+ For other segs, address is a long word PC rel jump. */
case TAHOE_WIDTH_CONDITIONAL_JUMP:
/* b<cond> */
/* To reverse the condition in a TAHOE branch,
}
else
{
- /* It ain't a branch operand. */
+ /* It ain't a branch operand. */
switch (operandP->top_mode)
{
/* Auto-foo access, only works for one reg (SP)
- so the only thing needed is the mode. */
+ so the only thing needed is the mode. */
case TAHOE_AUTO_DEC:
case TAHOE_AUTO_INC:
case TAHOE_AUTO_INC_DEFERRED:
break;
/* An absolute address. It's size is always 5 bytes.
- (mode_type + 4 byte address). */
+ (mode_type + 4 byte address). */
case TAHOE_ABSOLUTE_ADDR:
know ((this_add_symbol == NULL));
p = frag_more (5);
break;
/* Immediate data. If the size isn't known, then it's an address
- + and offset, which is 4 bytes big. */
+ + and offset, which is 4 bytes big. */
case TAHOE_IMMEDIATE:
if (this_add_symbol != NULL)
{
}
else
{
- /* It's a integer, and I know it's size. */
+ /* It's a integer, and I know it's size. */
if ((unsigned) this_add_number < 0x40)
{
/* Will it fit in a literal? */
/* Distance from the PC. If the size isn't known, we have to relax
into it. The difference between this and disp(sp) is that
this offset is pc_rel, and disp(sp) isn't.
- Note the drop through code. */
+ Note the drop through code. */
case TAHOE_DISPLACED_RELATIVE:
case TAHOE_DISP_REL_DEFERRED:
/* Register, plus a displacement mode. Save the register number,
and weather its deffered or not, and relax the size if it isn't
- known. */
+ known. */
case TAHOE_REG_DISP:
case TAHOE_REG_DISP_DEFERRED:
if (operandP->top_mode == TAHOE_DISP_REL_DEFERRED ||
operandP->top_mode == TAHOE_REG_DISP_DEFERRED)
operandP->top_reg += 0x10; /* deffered mode is always 0x10 higher
- than it's non-deffered sibling. */
+ than it's non-deffered sibling. */
/* Is this a value out of this segment?
The first part of this conditional is a cludge to make gas
produce the same output as 'as' when there is a lable, in
the current segment, displaceing a register. It's strange,
and no one in their right mind would do it, but it's easy
- to cludge. */
+ to cludge. */
if ((dispsize == 0 && !pc_rel) ||
(to_seg != now_seg && !is_undefined && to_seg != SEG_ABSOLUTE))
dispsize = 4;
}
else
{
- /* Either this is an abs, or a cast. */
+ /* Either this is an abs, or a cast. */
p = frag_more (dispsize + 1);
switch (dispsize)
{
} /* if(!need_pass_2 && !goofed) */
} /* tahoe_assemble() */
-
-/* We have no need to default values of symbols. */
+/* We have no need to default values of symbols. */
/* ARGSUSED */
symbolS *
return 0;
} /* md_undefined_symbol() */
-/* Round up a section size to the appropriate boundary. */
+/* Round up a section size to the appropriate boundary. */
valueT
md_section_align (segment, size)
segT segment;
On the sparc, they're relative to the address of the offset, plus
its size. This gets us to the following instruction.
(??? Is this right? FIXME-SOON) */
-long
+long
md_pcrel_from (fixP)
fixS *fixP;
{
: 0))) + fixP->fx_where + fixP->fx_frag->fr_address);
} /* md_pcrel_from() */
-int
+int
tc_is_pcrel (fixP)
fixS *fixP;
{
know (0);
return (0);
} /* tc_is_pcrel() */
-
-/* end of tc-tahoe.c */
projects / binutils-gdb.git / commitdiff