1999-09-04 17:29:22 +00:00
|
|
|
|
/*-
|
|
|
|
|
tc-pj.c -- Assemble code for Pico Java
|
2005-03-03 11:52:12 +00:00
|
|
|
|
Copyright 1999, 2000, 2001, 2002, 2003, 2005
|
|
|
|
|
Free Software Foundation, Inc.
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
This file is part of GAS, the GNU Assembler.
|
|
|
|
|
|
|
|
|
|
GAS is free software; you can redistribute it and/or modify
|
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
|
the Free Software Foundation; either version 2, or (at your option)
|
|
|
|
|
any later version.
|
|
|
|
|
|
|
|
|
|
GAS is distributed in the hope that it will be useful,
|
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
|
along with GAS; see the file COPYING. If not, write to
|
|
|
|
|
the Free Software Foundation, 59 Temple Place - Suite 330,
|
|
|
|
|
Boston, MA 02111-1307, USA. */
|
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
/* Contributed by Steve Chamberlain of Transmeta <sac@pobox.com>. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
#include "as.h"
|
2001-09-19 05:33:36 +00:00
|
|
|
|
#include "safe-ctype.h"
|
1999-09-04 17:29:22 +00:00
|
|
|
|
#include "opcode/pj.h"
|
|
|
|
|
|
|
|
|
|
extern const pj_opc_info_t pj_opc_info[512];
|
|
|
|
|
|
2005-03-24 20:40:28 +00:00
|
|
|
|
const char comment_chars[] = "!/";
|
1999-09-04 17:29:22 +00:00
|
|
|
|
const char line_separator_chars[] = ";";
|
2005-03-24 20:40:28 +00:00
|
|
|
|
const char line_comment_chars[] = "/!#";
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
static int pending_reloc;
|
|
|
|
|
static struct hash_control *opcode_hash_control;
|
|
|
|
|
|
|
|
|
|
static void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
little (int ignore ATTRIBUTE_UNUSED)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
target_big_endian = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
big (int ignore ATTRIBUTE_UNUSED)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
target_big_endian = 1;
|
|
|
|
|
}
|
|
|
|
|
|
2005-03-24 20:40:28 +00:00
|
|
|
|
const pseudo_typeS md_pseudo_table[] =
|
|
|
|
|
{
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{"ml", little, 0},
|
|
|
|
|
{"mb", big, 0},
|
|
|
|
|
{0, 0, 0}
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const char FLT_CHARS[] = "rRsSfFdDxXpP";
|
|
|
|
|
const char EXP_CHARS[] = "eE";
|
|
|
|
|
|
|
|
|
|
void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
md_operand (expressionS *op)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
if (strncmp (input_line_pointer, "%hi16", 5) == 0)
|
|
|
|
|
{
|
|
|
|
|
if (pending_reloc)
|
2000-07-17 21:24:35 +00:00
|
|
|
|
as_bad (_("confusing relocation expressions"));
|
1999-09-04 17:29:22 +00:00
|
|
|
|
pending_reloc = BFD_RELOC_PJ_CODE_HI16;
|
|
|
|
|
input_line_pointer += 5;
|
|
|
|
|
expression (op);
|
|
|
|
|
}
|
2005-03-24 20:40:28 +00:00
|
|
|
|
|
1999-09-04 17:29:22 +00:00
|
|
|
|
if (strncmp (input_line_pointer, "%lo16", 5) == 0)
|
|
|
|
|
{
|
|
|
|
|
if (pending_reloc)
|
2000-07-17 21:24:35 +00:00
|
|
|
|
as_bad (_("confusing relocation expressions"));
|
1999-09-04 17:29:22 +00:00
|
|
|
|
pending_reloc = BFD_RELOC_PJ_CODE_LO16;
|
|
|
|
|
input_line_pointer += 5;
|
|
|
|
|
expression (op);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
/* Parse an expression and then restore the input line pointer. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
static char *
|
2005-03-24 20:40:28 +00:00
|
|
|
|
parse_exp_save_ilp (char *s, expressionS *op)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
char *save = input_line_pointer;
|
2005-03-24 20:40:28 +00:00
|
|
|
|
|
1999-09-04 17:29:22 +00:00
|
|
|
|
input_line_pointer = s;
|
|
|
|
|
expression (op);
|
|
|
|
|
s = input_line_pointer;
|
|
|
|
|
input_line_pointer = save;
|
|
|
|
|
return s;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* This is called by emit_expr via TC_CONS_FIX_NEW when creating a
|
|
|
|
|
reloc for a cons. We could use the definition there, except that
|
|
|
|
|
we want to handle magic pending reloc expressions specially. */
|
|
|
|
|
|
|
|
|
|
void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
pj_cons_fix_new_pj (fragS *frag, int where, int nbytes, expressionS *exp)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
2000-07-17 21:24:35 +00:00
|
|
|
|
static int rv[5][2] =
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{ { 0, 0 },
|
|
|
|
|
{ BFD_RELOC_8, BFD_RELOC_8 },
|
|
|
|
|
{ BFD_RELOC_PJ_CODE_DIR16, BFD_RELOC_16 },
|
|
|
|
|
{ 0, 0 },
|
|
|
|
|
{ BFD_RELOC_PJ_CODE_DIR32, BFD_RELOC_32 }};
|
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
fix_new_exp (frag, where, nbytes, exp, 0,
|
1999-09-04 17:29:22 +00:00
|
|
|
|
pending_reloc ? pending_reloc
|
2000-07-17 21:24:35 +00:00
|
|
|
|
: rv[nbytes][(now_seg->flags & SEC_CODE) ? 0 : 1]);
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
pending_reloc = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Turn a reloc description character from the pj-opc.h table into
|
2000-07-17 21:24:35 +00:00
|
|
|
|
code which BFD can handle. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
static int
|
2005-03-24 20:40:28 +00:00
|
|
|
|
c_to_r (int x)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
switch (x)
|
|
|
|
|
{
|
|
|
|
|
case O_R8:
|
|
|
|
|
return BFD_RELOC_8_PCREL;
|
|
|
|
|
case O_U8:
|
|
|
|
|
case O_8:
|
|
|
|
|
return BFD_RELOC_8;
|
|
|
|
|
case O_R16:
|
|
|
|
|
return BFD_RELOC_PJ_CODE_REL16;
|
|
|
|
|
case O_U16:
|
|
|
|
|
case O_16:
|
|
|
|
|
return BFD_RELOC_PJ_CODE_DIR16;
|
|
|
|
|
case O_R32:
|
|
|
|
|
return BFD_RELOC_PJ_CODE_REL32;
|
|
|
|
|
case O_32:
|
|
|
|
|
return BFD_RELOC_PJ_CODE_DIR32;
|
|
|
|
|
}
|
|
|
|
|
abort ();
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Handler for the ipush fake opcode,
|
2000-07-17 21:24:35 +00:00
|
|
|
|
turns ipush <foo> into sipush lo16<foo>, sethi hi16<foo>. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
static void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
ipush_code (pj_opc_info_t *opcode ATTRIBUTE_UNUSED, char *str)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
char *b = frag_more (6);
|
|
|
|
|
expressionS arg;
|
2000-07-17 21:24:35 +00:00
|
|
|
|
|
1999-09-04 17:29:22 +00:00
|
|
|
|
b[0] = 0x11;
|
|
|
|
|
b[3] = 0xed;
|
2002-12-12 21:52:06 +00:00
|
|
|
|
parse_exp_save_ilp (str + 1, &arg);
|
|
|
|
|
if (pending_reloc)
|
|
|
|
|
{
|
|
|
|
|
as_bad (_("can't have relocation for ipush"));
|
|
|
|
|
pending_reloc = 0;
|
|
|
|
|
}
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
fix_new_exp (frag_now, b - frag_now->fr_literal + 1, 2,
|
|
|
|
|
&arg, 0, BFD_RELOC_PJ_CODE_DIR16);
|
1999-09-04 17:29:22 +00:00
|
|
|
|
fix_new_exp (frag_now, b - frag_now->fr_literal + 4, 2,
|
2000-07-17 21:24:35 +00:00
|
|
|
|
&arg, 0, BFD_RELOC_PJ_CODE_HI16);
|
1999-09-04 17:29:22 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Insert names into the opcode table which are really mini macros,
|
2003-11-22 02:35:31 +00:00
|
|
|
|
not opcodes. The fakeness is indicated with an opcode of -1. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
static void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
fake_opcode (const char *name,
|
|
|
|
|
void (*func) (struct pj_opc_info_t *, char *))
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
2005-03-24 20:40:28 +00:00
|
|
|
|
pj_opc_info_t * fake = xmalloc (sizeof (pj_opc_info_t));
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
fake->opcode = -1;
|
|
|
|
|
fake->opcode_next = -1;
|
2002-12-12 21:52:06 +00:00
|
|
|
|
fake->u.func = func;
|
1999-09-04 17:29:22 +00:00
|
|
|
|
hash_insert (opcode_hash_control, name, (char *) fake);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Enter another entry into the opcode hash table so the same opcode
|
2000-07-17 21:24:35 +00:00
|
|
|
|
can have another name. */
|
|
|
|
|
|
1999-09-04 17:29:22 +00:00
|
|
|
|
static void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
alias (const char *new, const char *old)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
hash_insert (opcode_hash_control, new,
|
|
|
|
|
(char *) hash_find (opcode_hash_control, old));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* This function is called once, at assembler startup time. It sets
|
|
|
|
|
up the hash table with all the opcodes in it, and also initializes
|
2000-07-17 21:24:35 +00:00
|
|
|
|
some aliases for compatibility with other assemblers. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
md_begin (void)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
const pj_opc_info_t *opcode;
|
|
|
|
|
opcode_hash_control = hash_new ();
|
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
/* Insert names into hash table. */
|
2002-12-12 21:52:06 +00:00
|
|
|
|
for (opcode = pj_opc_info; opcode->u.name; opcode++)
|
|
|
|
|
hash_insert (opcode_hash_control, opcode->u.name, (char *) opcode);
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
/* Insert the only fake opcode. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
fake_opcode ("ipush", ipush_code);
|
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
/* Add some aliases for opcode names. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
alias ("ifeq_s", "ifeq");
|
|
|
|
|
alias ("ifne_s", "ifne");
|
|
|
|
|
alias ("if_icmpge_s", "if_icmpge");
|
|
|
|
|
alias ("if_icmpne_s", "if_icmpne");
|
|
|
|
|
alias ("if_icmpeq_s", "if_icmpeq");
|
|
|
|
|
alias ("if_icmpgt_s", "if_icmpgt");
|
|
|
|
|
alias ("goto_s", "goto");
|
|
|
|
|
|
|
|
|
|
bfd_set_arch_mach (stdoutput, TARGET_ARCH, 0);
|
|
|
|
|
}
|
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
/* This is the guts of the machine-dependent assembler. STR points to
|
|
|
|
|
a machine dependent instruction. This function is supposed to emit
|
|
|
|
|
the frags/bytes it assembles to. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
md_assemble (char *str)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
2005-02-23 12:28:06 +00:00
|
|
|
|
char *op_start;
|
|
|
|
|
char *op_end;
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
pj_opc_info_t *opcode;
|
|
|
|
|
char *output;
|
|
|
|
|
int idx = 0;
|
|
|
|
|
char pend;
|
|
|
|
|
|
|
|
|
|
int nlen = 0;
|
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
/* Drop leading whitespace. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
while (*str == ' ')
|
|
|
|
|
str++;
|
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
/* Find the op code end. */
|
2005-02-23 12:28:06 +00:00
|
|
|
|
op_start = str;
|
|
|
|
|
for (op_end = str;
|
|
|
|
|
*op_end && !is_end_of_line[*op_end & 0xff] && *op_end != ' ';
|
2000-07-17 21:24:35 +00:00
|
|
|
|
op_end++)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
nlen++;
|
|
|
|
|
|
|
|
|
|
pend = *op_end;
|
|
|
|
|
*op_end = 0;
|
|
|
|
|
|
|
|
|
|
if (nlen == 0)
|
2000-07-17 21:24:35 +00:00
|
|
|
|
as_bad (_("can't find opcode "));
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
opcode = (pj_opc_info_t *) hash_find (opcode_hash_control, op_start);
|
|
|
|
|
*op_end = pend;
|
|
|
|
|
|
|
|
|
|
if (opcode == NULL)
|
|
|
|
|
{
|
2000-07-17 21:24:35 +00:00
|
|
|
|
as_bad (_("unknown opcode %s"), op_start);
|
1999-09-04 17:29:22 +00:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (opcode->opcode == -1)
|
|
|
|
|
{
|
2000-07-17 21:24:35 +00:00
|
|
|
|
/* It's a fake opcode. Dig out the args and pretend that was
|
|
|
|
|
what we were passed. */
|
2002-12-12 21:52:06 +00:00
|
|
|
|
(*opcode->u.func) (opcode, op_end);
|
1999-09-04 17:29:22 +00:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
int an;
|
|
|
|
|
|
|
|
|
|
output = frag_more (opcode->len);
|
|
|
|
|
output[idx++] = opcode->opcode;
|
|
|
|
|
|
|
|
|
|
if (opcode->opcode_next != -1)
|
|
|
|
|
output[idx++] = opcode->opcode_next;
|
|
|
|
|
|
|
|
|
|
for (an = 0; opcode->arg[an]; an++)
|
|
|
|
|
{
|
|
|
|
|
expressionS arg;
|
|
|
|
|
|
|
|
|
|
if (*op_end == ',' && an != 0)
|
|
|
|
|
op_end++;
|
|
|
|
|
|
|
|
|
|
if (*op_end == 0)
|
|
|
|
|
as_bad ("expected expresssion");
|
|
|
|
|
|
|
|
|
|
op_end = parse_exp_save_ilp (op_end, &arg);
|
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
fix_new_exp (frag_now,
|
1999-09-04 17:29:22 +00:00
|
|
|
|
output - frag_now->fr_literal + idx,
|
|
|
|
|
ASIZE (opcode->arg[an]),
|
|
|
|
|
&arg,
|
2000-07-17 21:24:35 +00:00
|
|
|
|
PCREL (opcode->arg[an]),
|
1999-09-04 17:29:22 +00:00
|
|
|
|
pending_reloc ? pending_reloc : c_to_r (opcode->arg[an]));
|
|
|
|
|
|
|
|
|
|
idx += ASIZE (opcode->arg[an]);
|
|
|
|
|
pending_reloc = 0;
|
|
|
|
|
}
|
|
|
|
|
|
2001-09-19 05:33:36 +00:00
|
|
|
|
while (ISSPACE (*op_end))
|
1999-09-04 17:29:22 +00:00
|
|
|
|
op_end++;
|
|
|
|
|
|
|
|
|
|
if (*op_end != 0)
|
|
|
|
|
as_warn ("extra stuff on line ignored");
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (pending_reloc)
|
|
|
|
|
as_bad ("Something forgot to clean up\n");
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
2000-07-17 21:24:35 +00:00
|
|
|
|
/* Turn a string in input_line_pointer into a floating point constant
|
|
|
|
|
of type type, and store the appropriate bytes in *LITP. The number
|
|
|
|
|
of LITTLENUMS emitted is stored in *SIZEP . An error message is
|
|
|
|
|
returned, or NULL on OK. */
|
|
|
|
|
|
1999-09-04 17:29:22 +00:00
|
|
|
|
char *
|
2005-03-24 20:40:28 +00:00
|
|
|
|
md_atof (int type, char *litP, int *sizeP)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
int prec;
|
|
|
|
|
LITTLENUM_TYPE words[4];
|
|
|
|
|
char *t;
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
switch (type)
|
|
|
|
|
{
|
|
|
|
|
case 'f':
|
|
|
|
|
prec = 2;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 'd':
|
|
|
|
|
prec = 4;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
*sizeP = 0;
|
2000-07-17 21:24:35 +00:00
|
|
|
|
return _("bad call to md_atof");
|
1999-09-04 17:29:22 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
t = atof_ieee (input_line_pointer, type, words);
|
|
|
|
|
if (t)
|
|
|
|
|
input_line_pointer = t;
|
|
|
|
|
|
|
|
|
|
*sizeP = prec * 2;
|
|
|
|
|
|
|
|
|
|
if (!target_big_endian)
|
|
|
|
|
{
|
|
|
|
|
for (i = prec - 1; i >= 0; i--)
|
|
|
|
|
{
|
|
|
|
|
md_number_to_chars (litP, (valueT) words[i], 2);
|
|
|
|
|
litP += 2;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
for (i = 0; i < prec; i++)
|
|
|
|
|
{
|
|
|
|
|
md_number_to_chars (litP, (valueT) words[i], 2);
|
|
|
|
|
litP += 2;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
2002-06-08 07:37:16 +00:00
|
|
|
|
const char *md_shortopts = "";
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
2005-03-24 20:40:28 +00:00
|
|
|
|
struct option md_longopts[] =
|
|
|
|
|
{
|
1999-09-04 17:29:22 +00:00
|
|
|
|
#define OPTION_LITTLE (OPTION_MD_BASE)
|
|
|
|
|
#define OPTION_BIG (OPTION_LITTLE + 1)
|
|
|
|
|
|
|
|
|
|
{"little", no_argument, NULL, OPTION_LITTLE},
|
|
|
|
|
{"big", no_argument, NULL, OPTION_BIG},
|
|
|
|
|
{NULL, no_argument, NULL, 0}
|
|
|
|
|
};
|
|
|
|
|
size_t md_longopts_size = sizeof (md_longopts);
|
|
|
|
|
|
|
|
|
|
int
|
2005-03-24 20:40:28 +00:00
|
|
|
|
md_parse_option (int c, char *arg ATTRIBUTE_UNUSED)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
switch (c)
|
|
|
|
|
{
|
|
|
|
|
case OPTION_LITTLE:
|
2002-12-12 21:52:06 +00:00
|
|
|
|
little (0);
|
1999-09-04 17:29:22 +00:00
|
|
|
|
break;
|
|
|
|
|
case OPTION_BIG:
|
2002-12-12 21:52:06 +00:00
|
|
|
|
big (0);
|
1999-09-04 17:29:22 +00:00
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
md_show_usage (FILE *stream)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
2000-07-17 21:24:35 +00:00
|
|
|
|
fprintf (stream, _("\
|
1999-09-04 17:29:22 +00:00
|
|
|
|
PJ options:\n\
|
|
|
|
|
-little generate little endian code\n\
|
|
|
|
|
-big generate big endian code\n"));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Apply a fixup to the object file. */
|
|
|
|
|
|
2001-11-15 21:29:00 +00:00
|
|
|
|
void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
md_apply_fix3 (fixS *fixP, valueT * valP, segT seg ATTRIBUTE_UNUSED)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
char *buf = fixP->fx_where + fixP->fx_frag->fr_literal;
|
2002-09-05 00:01:18 +00:00
|
|
|
|
long val = *valP;
|
1999-09-04 17:29:22 +00:00
|
|
|
|
long max, min;
|
|
|
|
|
int shift;
|
|
|
|
|
|
|
|
|
|
max = min = 0;
|
|
|
|
|
shift = 0;
|
|
|
|
|
switch (fixP->fx_r_type)
|
|
|
|
|
{
|
|
|
|
|
case BFD_RELOC_VTABLE_INHERIT:
|
|
|
|
|
case BFD_RELOC_VTABLE_ENTRY:
|
|
|
|
|
fixP->fx_done = 0;
|
2001-11-15 21:29:00 +00:00
|
|
|
|
return;
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
case BFD_RELOC_PJ_CODE_REL16:
|
|
|
|
|
if (val < -0x8000 || val >= 0x7fff)
|
2000-07-17 21:24:35 +00:00
|
|
|
|
as_bad_where (fixP->fx_file, fixP->fx_line, _("pcrel too far"));
|
1999-09-04 17:29:22 +00:00
|
|
|
|
buf[0] |= (val >> 8) & 0xff;
|
|
|
|
|
buf[1] = val & 0xff;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BFD_RELOC_PJ_CODE_HI16:
|
|
|
|
|
*buf++ = val >> 24;
|
|
|
|
|
*buf++ = val >> 16;
|
|
|
|
|
fixP->fx_addnumber = val & 0xffff;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BFD_RELOC_PJ_CODE_DIR16:
|
|
|
|
|
case BFD_RELOC_PJ_CODE_LO16:
|
|
|
|
|
*buf++ = val >> 8;
|
|
|
|
|
*buf++ = val >> 0;
|
|
|
|
|
|
|
|
|
|
max = 0xffff;
|
|
|
|
|
min = -0xffff;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BFD_RELOC_8:
|
|
|
|
|
max = 0xff;
|
|
|
|
|
min = -0xff;
|
|
|
|
|
*buf++ = val;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BFD_RELOC_PJ_CODE_DIR32:
|
|
|
|
|
*buf++ = val >> 24;
|
|
|
|
|
*buf++ = val >> 16;
|
|
|
|
|
*buf++ = val >> 8;
|
|
|
|
|
*buf++ = val >> 0;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BFD_RELOC_32:
|
|
|
|
|
if (target_big_endian)
|
|
|
|
|
{
|
|
|
|
|
*buf++ = val >> 24;
|
|
|
|
|
*buf++ = val >> 16;
|
|
|
|
|
*buf++ = val >> 8;
|
|
|
|
|
*buf++ = val >> 0;
|
|
|
|
|
}
|
2000-07-17 21:24:35 +00:00
|
|
|
|
else
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
*buf++ = val >> 0;
|
|
|
|
|
*buf++ = val >> 8;
|
|
|
|
|
*buf++ = val >> 16;
|
|
|
|
|
*buf++ = val >> 24;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case BFD_RELOC_16:
|
|
|
|
|
if (target_big_endian)
|
|
|
|
|
{
|
|
|
|
|
*buf++ = val >> 8;
|
|
|
|
|
*buf++ = val >> 0;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
*buf++ = val >> 0;
|
|
|
|
|
*buf++ = val >> 8;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
abort ();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (max != 0 && (val < min || val > max))
|
2000-07-17 21:24:35 +00:00
|
|
|
|
as_bad_where (fixP->fx_file, fixP->fx_line, _("offset out of range"));
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
2001-11-15 21:29:00 +00:00
|
|
|
|
if (fixP->fx_addsy == NULL && fixP->fx_pcrel == 0)
|
|
|
|
|
fixP->fx_done = 1;
|
1999-09-04 17:29:22 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Put number into target byte order. Always put values in an
|
2000-07-17 21:24:35 +00:00
|
|
|
|
executable section into big endian order. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
void
|
2005-03-24 20:40:28 +00:00
|
|
|
|
md_number_to_chars (char *ptr, valueT use, int nbytes)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
if (target_big_endian || now_seg->flags & SEC_CODE)
|
|
|
|
|
number_to_chars_bigendian (ptr, use, nbytes);
|
|
|
|
|
else
|
|
|
|
|
number_to_chars_littleendian (ptr, use, nbytes);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Translate internal representation of relocation info to BFD target
|
2000-07-17 21:24:35 +00:00
|
|
|
|
format. */
|
1999-09-04 17:29:22 +00:00
|
|
|
|
|
|
|
|
|
arelent *
|
2005-03-24 20:40:28 +00:00
|
|
|
|
tc_gen_reloc (asection *section ATTRIBUTE_UNUSED, fixS *fixp)
|
1999-09-04 17:29:22 +00:00
|
|
|
|
{
|
|
|
|
|
arelent *rel;
|
|
|
|
|
bfd_reloc_code_real_type r_type;
|
|
|
|
|
|
2005-03-24 20:40:28 +00:00
|
|
|
|
rel = xmalloc (sizeof (arelent));
|
|
|
|
|
rel->sym_ptr_ptr = xmalloc (sizeof (asymbol *));
|
1999-09-04 17:29:22 +00:00
|
|
|
|
*rel->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
|
|
|
|
|
rel->address = fixp->fx_frag->fr_address + fixp->fx_where;
|
|
|
|
|
|
|
|
|
|
r_type = fixp->fx_r_type;
|
|
|
|
|
rel->addend = fixp->fx_addnumber;
|
|
|
|
|
rel->howto = bfd_reloc_type_lookup (stdoutput, r_type);
|
|
|
|
|
|
|
|
|
|
if (rel->howto == NULL)
|
|
|
|
|
{
|
|
|
|
|
as_bad_where (fixp->fx_file, fixp->fx_line,
|
2000-07-17 21:24:35 +00:00
|
|
|
|
_("Cannot represent relocation type %s"),
|
1999-09-04 17:29:22 +00:00
|
|
|
|
bfd_get_reloc_code_name (r_type));
|
|
|
|
|
/* Set howto to a garbage value so that we can keep going. */
|
|
|
|
|
rel->howto = bfd_reloc_type_lookup (stdoutput, BFD_RELOC_32);
|
|
|
|
|
assert (rel->howto != NULL);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return rel;
|
|
|
|
|
}
|