1998-01-13 01:37:20 +00:00
|
|
|
|
/* Assembler interface for targets using CGEN. -*- C -*-
|
|
|
|
|
CGEN: Cpu tools GENerator
|
|
|
|
|
|
1998-07-21 20:59:23 +00:00
|
|
|
|
THIS FILE IS USED TO GENERATE @prefix@-asm.c.
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
Copyright (C) 1996, 1997, 1998 Free Software Foundation, Inc.
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
This file is part of the GNU Binutils and GDB, the GNU debugger.
|
|
|
|
|
|
|
|
|
|
This program 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.
|
|
|
|
|
|
|
|
|
|
This program 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
|
1998-07-21 20:59:23 +00:00
|
|
|
|
along with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
|
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
#include "sysdep.h"
|
|
|
|
|
#include <ctype.h>
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include "ansidecl.h"
|
|
|
|
|
#include "bfd.h"
|
1998-02-23 21:17:29 +00:00
|
|
|
|
#include "symcat.h"
|
1998-07-21 20:59:23 +00:00
|
|
|
|
#include "@prefix@-opc.h"
|
1998-04-28 00:07:48 +00:00
|
|
|
|
#include "opintl.h"
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
/* ??? The layout of this stuff is still work in progress.
|
|
|
|
|
For speed in assembly/disassembly, we use inline functions. That of course
|
|
|
|
|
will only work for GCC. When this stuff is finished, we can decide whether
|
|
|
|
|
to keep the inline functions (and only get the performance increase when
|
|
|
|
|
compiled with GCC), or switch to macros, or use something else.
|
|
|
|
|
*/
|
|
|
|
|
|
1998-04-27 17:49:54 +00:00
|
|
|
|
static const char * insert_normal
|
|
|
|
|
PARAMS ((long, unsigned int, int, int, int, char *));
|
1998-02-23 21:17:29 +00:00
|
|
|
|
static const char * parse_insn_normal
|
1998-01-13 01:37:20 +00:00
|
|
|
|
PARAMS ((const CGEN_INSN *, const char **, CGEN_FIELDS *));
|
1998-02-23 21:17:29 +00:00
|
|
|
|
static const char * insert_insn_normal
|
1998-07-21 20:59:23 +00:00
|
|
|
|
PARAMS ((const CGEN_INSN *, CGEN_FIELDS *, cgen_insn_t *, bfd_vma));
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
1998-04-27 17:49:54 +00:00
|
|
|
|
/* -- assembler routines inserted here */
|
|
|
|
|
|
1998-01-13 01:37:20 +00:00
|
|
|
|
/* Default insertion routine.
|
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
ATTRS is a mask of the boolean attributes.
|
|
|
|
|
LENGTH is the length of VALUE in bits.
|
|
|
|
|
TOTAL_LENGTH is the total length of the insn (currently 8,16,32).
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
The result is an error message or NULL if success. */
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
/* ??? This duplicates functionality with bfd's howto table and
|
1998-01-13 01:37:20 +00:00
|
|
|
|
bfd_install_relocation. */
|
1998-02-23 21:17:29 +00:00
|
|
|
|
/* ??? For architectures where insns can be representable as ints,
|
|
|
|
|
store insn in `field' struct and add registers, etc. while parsing? */
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
static const char *
|
1998-04-27 17:49:54 +00:00
|
|
|
|
insert_normal (value, attrs, start, length, total_length, buffer)
|
1998-01-13 01:37:20 +00:00
|
|
|
|
long value;
|
|
|
|
|
unsigned int attrs;
|
1998-02-23 21:17:29 +00:00
|
|
|
|
int start;
|
|
|
|
|
int length;
|
|
|
|
|
int total_length;
|
|
|
|
|
char * buffer;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
|
|
|
|
bfd_vma x;
|
1998-02-23 21:17:29 +00:00
|
|
|
|
static char buf[100];
|
1998-07-21 20:59:23 +00:00
|
|
|
|
/* Written this way to avoid undefined behaviour.
|
|
|
|
|
Yes, `long' will be bfd_vma but not yet. */
|
|
|
|
|
long mask = (((1L << (length - 1)) - 1) << 1) | 1;
|
|
|
|
|
|
|
|
|
|
/* If LENGTH is zero, this operand doesn't contribute to the value. */
|
|
|
|
|
if (length == 0)
|
|
|
|
|
return NULL;
|
1998-02-23 21:17:29 +00:00
|
|
|
|
|
|
|
|
|
/* Ensure VALUE will fit. */
|
1998-07-21 20:59:23 +00:00
|
|
|
|
if ((attrs & CGEN_ATTR_MASK (CGEN_OPERAND_UNSIGNED)) != 0)
|
1998-02-23 21:17:29 +00:00
|
|
|
|
{
|
1998-07-21 20:59:23 +00:00
|
|
|
|
unsigned long max = mask;
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if ((unsigned long) value > max)
|
|
|
|
|
{
|
1998-07-21 20:59:23 +00:00
|
|
|
|
/* xgettext:c-format */
|
1998-04-28 00:07:48 +00:00
|
|
|
|
sprintf (buf, _("operand out of range (%lu not between 0 and %lu)"),
|
|
|
|
|
value, max);
|
1998-02-23 21:17:29 +00:00
|
|
|
|
return buf;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1998-07-21 20:59:23 +00:00
|
|
|
|
long min = - (1L << (length - 1));
|
|
|
|
|
long max = (1L << (length - 1)) - 1;
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if (value < min || value > max)
|
1998-07-21 20:59:23 +00:00
|
|
|
|
{
|
|
|
|
|
sprintf
|
|
|
|
|
/* xgettext:c-format */
|
|
|
|
|
(buf, _("operand out of range (%ld not between %ld and %ld)"),
|
|
|
|
|
value, min, max);
|
|
|
|
|
return buf;
|
|
|
|
|
}
|
1998-02-23 21:17:29 +00:00
|
|
|
|
}
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
#if 0 /*def CGEN_INT_INSN*/
|
1998-07-21 20:59:23 +00:00
|
|
|
|
*buffer |= (value & mask) << (total_length - (start + length));
|
1998-01-13 01:37:20 +00:00
|
|
|
|
#else
|
|
|
|
|
switch (total_length)
|
|
|
|
|
{
|
|
|
|
|
case 8:
|
1998-02-23 21:17:29 +00:00
|
|
|
|
x = * (unsigned char *) buffer;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
break;
|
|
|
|
|
case 16:
|
|
|
|
|
if (CGEN_CURRENT_ENDIAN == CGEN_ENDIAN_BIG)
|
|
|
|
|
x = bfd_getb16 (buffer);
|
|
|
|
|
else
|
|
|
|
|
x = bfd_getl16 (buffer);
|
|
|
|
|
break;
|
|
|
|
|
case 32:
|
|
|
|
|
if (CGEN_CURRENT_ENDIAN == CGEN_ENDIAN_BIG)
|
|
|
|
|
x = bfd_getb32 (buffer);
|
|
|
|
|
else
|
|
|
|
|
x = bfd_getl32 (buffer);
|
|
|
|
|
break;
|
|
|
|
|
default :
|
|
|
|
|
abort ();
|
|
|
|
|
}
|
|
|
|
|
|
1998-07-21 20:59:23 +00:00
|
|
|
|
x |= (value & mask) << (total_length - (start + length));
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
switch (total_length)
|
|
|
|
|
{
|
|
|
|
|
case 8:
|
1998-02-23 21:17:29 +00:00
|
|
|
|
* buffer = value;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
break;
|
|
|
|
|
case 16:
|
|
|
|
|
if (CGEN_CURRENT_ENDIAN == CGEN_ENDIAN_BIG)
|
|
|
|
|
bfd_putb16 (x, buffer);
|
|
|
|
|
else
|
|
|
|
|
bfd_putl16 (x, buffer);
|
|
|
|
|
break;
|
|
|
|
|
case 32:
|
|
|
|
|
if (CGEN_CURRENT_ENDIAN == CGEN_ENDIAN_BIG)
|
|
|
|
|
bfd_putb32 (x, buffer);
|
|
|
|
|
else
|
|
|
|
|
bfd_putl32 (x, buffer);
|
|
|
|
|
break;
|
|
|
|
|
default :
|
|
|
|
|
abort ();
|
|
|
|
|
}
|
|
|
|
|
#endif
|
1998-02-23 21:17:29 +00:00
|
|
|
|
|
|
|
|
|
return NULL;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Default insn parser.
|
|
|
|
|
|
|
|
|
|
The syntax string is scanned and operands are parsed and stored in FIELDS.
|
|
|
|
|
Relocs are queued as we go via other callbacks.
|
|
|
|
|
|
|
|
|
|
??? Note that this is currently an all-or-nothing parser. If we fail to
|
|
|
|
|
parse the instruction, we return 0 and the caller will start over from
|
|
|
|
|
the beginning. Backtracking will be necessary in parsing subexpressions,
|
|
|
|
|
but that can be handled there. Not handling backtracking here may get
|
|
|
|
|
expensive in the case of the m68k. Deal with later.
|
|
|
|
|
|
|
|
|
|
Returns NULL for success, an error message for failure.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
static const char *
|
|
|
|
|
parse_insn_normal (insn, strp, fields)
|
1998-02-23 21:17:29 +00:00
|
|
|
|
const CGEN_INSN * insn;
|
|
|
|
|
const char ** strp;
|
|
|
|
|
CGEN_FIELDS * fields;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
1998-02-23 21:17:29 +00:00
|
|
|
|
const CGEN_SYNTAX * syntax = CGEN_INSN_SYNTAX (insn);
|
|
|
|
|
const char * str = *strp;
|
|
|
|
|
const char * errmsg;
|
|
|
|
|
const char * p;
|
|
|
|
|
const unsigned char * syn;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
#ifdef CGEN_MNEMONIC_OPERANDS
|
1998-07-21 20:59:23 +00:00
|
|
|
|
/* FIXME: wip */
|
1998-01-13 01:37:20 +00:00
|
|
|
|
int past_opcode_p;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* For now we assume the mnemonic is first (there are no leading operands).
|
|
|
|
|
We can parse it without needing to set up operand parsing. */
|
|
|
|
|
p = CGEN_INSN_MNEMONIC (insn);
|
1998-02-23 21:17:29 +00:00
|
|
|
|
while (* p && * p == * str)
|
|
|
|
|
++ p, ++ str;
|
1998-04-28 00:07:48 +00:00
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if (* p || (* str && !isspace (* str)))
|
1998-04-28 00:07:48 +00:00
|
|
|
|
return _("unrecognized instruction");
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
CGEN_INIT_PARSE ();
|
|
|
|
|
cgen_init_parse_operand ();
|
|
|
|
|
#ifdef CGEN_MNEMONIC_OPERANDS
|
|
|
|
|
past_opcode_p = 0;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* We don't check for (*str != '\0') here because we want to parse
|
|
|
|
|
any trailing fake arguments in the syntax string. */
|
|
|
|
|
syn = CGEN_SYNTAX_STRING (CGEN_INSN_SYNTAX (insn));
|
1998-02-23 21:17:29 +00:00
|
|
|
|
|
1998-01-13 01:37:20 +00:00
|
|
|
|
/* Mnemonics come first for now, ensure valid string. */
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if (! CGEN_SYNTAX_MNEMONIC_P (* syn))
|
1998-01-13 01:37:20 +00:00
|
|
|
|
abort ();
|
1998-02-23 21:17:29 +00:00
|
|
|
|
|
1998-01-13 01:37:20 +00:00
|
|
|
|
++syn;
|
1998-02-23 21:17:29 +00:00
|
|
|
|
|
|
|
|
|
while (* syn != 0)
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
|
|
|
|
/* Non operand chars must match exactly. */
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if (CGEN_SYNTAX_CHAR_P (* syn))
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if (*str == CGEN_SYNTAX_CHAR (* syn))
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
|
|
|
|
#ifdef CGEN_MNEMONIC_OPERANDS
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if (* syn == ' ')
|
1998-01-13 01:37:20 +00:00
|
|
|
|
past_opcode_p = 1;
|
|
|
|
|
#endif
|
1998-02-23 21:17:29 +00:00
|
|
|
|
++ syn;
|
|
|
|
|
++ str;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Syntax char didn't match. Can't be this insn. */
|
1998-02-23 21:17:29 +00:00
|
|
|
|
/* FIXME: would like to return something like
|
|
|
|
|
"expected char `c'" */
|
1998-04-28 00:07:48 +00:00
|
|
|
|
return _("syntax error");
|
1998-01-13 01:37:20 +00:00
|
|
|
|
}
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* We have an operand of some sort. */
|
|
|
|
|
errmsg = @arch@_cgen_parse_operand (CGEN_SYNTAX_FIELD (*syn),
|
|
|
|
|
&str, fields);
|
|
|
|
|
if (errmsg)
|
|
|
|
|
return errmsg;
|
|
|
|
|
|
|
|
|
|
/* Done with this operand, continue with next one. */
|
1998-02-23 21:17:29 +00:00
|
|
|
|
++ syn;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If we're at the end of the syntax string, we're done. */
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if (* syn == '\0')
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
|
|
|
|
/* FIXME: For the moment we assume a valid `str' can only contain
|
|
|
|
|
blanks now. IE: We needn't try again with a longer version of
|
|
|
|
|
the insn and it is assumed that longer versions of insns appear
|
|
|
|
|
before shorter ones (eg: lsr r2,r3,1 vs lsr r2,r3). */
|
1998-02-23 21:17:29 +00:00
|
|
|
|
while (isspace (* str))
|
|
|
|
|
++ str;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if (* str != '\0')
|
1998-04-28 00:07:48 +00:00
|
|
|
|
return _("junk at end of line"); /* FIXME: would like to include `str' */
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* We couldn't parse it. */
|
|
|
|
|
return "unrecognized instruction";
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Default insn builder (insert handler).
|
1998-02-23 21:17:29 +00:00
|
|
|
|
The instruction is recorded in target byte order.
|
|
|
|
|
The result is an error message or NULL if success. */
|
|
|
|
|
/* FIXME: change buffer to char *? */
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
static const char *
|
1998-07-21 20:59:23 +00:00
|
|
|
|
insert_insn_normal (insn, fields, buffer, pc)
|
1998-02-23 21:17:29 +00:00
|
|
|
|
const CGEN_INSN * insn;
|
|
|
|
|
CGEN_FIELDS * fields;
|
|
|
|
|
cgen_insn_t * buffer;
|
1998-07-21 20:59:23 +00:00
|
|
|
|
bfd_vma pc;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
1998-02-23 21:17:29 +00:00
|
|
|
|
const CGEN_SYNTAX * syntax = CGEN_INSN_SYNTAX (insn);
|
1998-01-13 01:37:20 +00:00
|
|
|
|
bfd_vma value;
|
1998-02-23 21:17:29 +00:00
|
|
|
|
const unsigned char * syn;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
CGEN_INIT_INSERT ();
|
|
|
|
|
value = CGEN_INSN_VALUE (insn);
|
|
|
|
|
|
|
|
|
|
/* If we're recording insns as numbers (rather than a string of bytes),
|
|
|
|
|
target byte order handling is deferred until later. */
|
|
|
|
|
#undef min
|
|
|
|
|
#define min(a,b) ((a) < (b) ? (a) : (b))
|
|
|
|
|
#if 0 /*def CGEN_INT_INSN*/
|
|
|
|
|
*buffer = value;
|
|
|
|
|
#else
|
|
|
|
|
switch (min (CGEN_BASE_INSN_BITSIZE, CGEN_FIELDS_BITSIZE (fields)))
|
|
|
|
|
{
|
|
|
|
|
case 8:
|
1998-02-23 21:17:29 +00:00
|
|
|
|
* buffer = value;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
break;
|
|
|
|
|
case 16:
|
|
|
|
|
if (CGEN_CURRENT_ENDIAN == CGEN_ENDIAN_BIG)
|
|
|
|
|
bfd_putb16 (value, (char *) buffer);
|
|
|
|
|
else
|
|
|
|
|
bfd_putl16 (value, (char *) buffer);
|
|
|
|
|
break;
|
|
|
|
|
case 32:
|
|
|
|
|
if (CGEN_CURRENT_ENDIAN == CGEN_ENDIAN_BIG)
|
|
|
|
|
bfd_putb32 (value, (char *) buffer);
|
|
|
|
|
else
|
|
|
|
|
bfd_putl32 (value, (char *) buffer);
|
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
abort ();
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* ??? Rather than scanning the syntax string again, we could store
|
|
|
|
|
in `fields' a null terminated list of the fields that are present. */
|
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
for (syn = CGEN_SYNTAX_STRING (syntax); * syn != '\0'; ++ syn)
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
1998-02-23 21:17:29 +00:00
|
|
|
|
const char *errmsg;
|
|
|
|
|
|
|
|
|
|
if (CGEN_SYNTAX_CHAR_P (* syn))
|
1998-01-13 01:37:20 +00:00
|
|
|
|
continue;
|
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
errmsg = @arch@_cgen_insert_operand (CGEN_SYNTAX_FIELD (*syn), fields,
|
1998-07-21 20:59:23 +00:00
|
|
|
|
(char *) buffer, pc);
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if (errmsg)
|
|
|
|
|
return errmsg;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
}
|
1998-02-23 21:17:29 +00:00
|
|
|
|
|
|
|
|
|
return NULL;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Main entry point.
|
|
|
|
|
This routine is called for each instruction to be assembled.
|
|
|
|
|
STR points to the insn to be assembled.
|
|
|
|
|
We assume all necessary tables have been initialized.
|
1998-04-27 17:49:54 +00:00
|
|
|
|
The assembled instruction, less any fixups, is stored in buf.
|
|
|
|
|
[??? What byte order?]
|
1998-01-13 01:37:20 +00:00
|
|
|
|
The result is a pointer to the insn's entry in the opcode table,
|
|
|
|
|
or NULL if an error occured (an error message will have already been
|
1998-04-27 17:49:54 +00:00
|
|
|
|
printed).
|
|
|
|
|
|
|
|
|
|
Note that when processing (non-alias) macro-insns,
|
|
|
|
|
this function recurses. */
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
const CGEN_INSN *
|
|
|
|
|
@arch@_cgen_assemble_insn (str, fields, buf, errmsg)
|
1998-02-23 21:17:29 +00:00
|
|
|
|
const char * str;
|
|
|
|
|
CGEN_FIELDS * fields;
|
|
|
|
|
cgen_insn_t * buf;
|
|
|
|
|
char ** errmsg;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
1998-02-23 21:17:29 +00:00
|
|
|
|
const char * start;
|
|
|
|
|
CGEN_INSN_LIST * ilist;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
/* Skip leading white space. */
|
1998-02-23 21:17:29 +00:00
|
|
|
|
while (isspace (* str))
|
|
|
|
|
++ str;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
|
|
|
|
/* The instructions are stored in hashed lists.
|
|
|
|
|
Get the first in the list. */
|
|
|
|
|
ilist = CGEN_ASM_LOOKUP_INSN (str);
|
|
|
|
|
|
|
|
|
|
/* Keep looking until we find a match. */
|
|
|
|
|
|
|
|
|
|
start = str;
|
|
|
|
|
for ( ; ilist != NULL ; ilist = CGEN_ASM_NEXT_INSN (ilist))
|
|
|
|
|
{
|
|
|
|
|
const CGEN_INSN *insn = ilist->insn;
|
|
|
|
|
|
|
|
|
|
#if 0 /* not needed as unsupported opcodes shouldn't be in the hash lists */
|
|
|
|
|
/* Is this insn supported by the selected cpu? */
|
|
|
|
|
if (! @arch@_cgen_insn_supported (insn))
|
|
|
|
|
continue;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* If the RELAX attribute is set, this is an insn that shouldn't be
|
|
|
|
|
chosen immediately. Instead, it is used during assembler/linker
|
|
|
|
|
relaxation if possible. */
|
|
|
|
|
if (CGEN_INSN_ATTR (insn, CGEN_INSN_RELAX) != 0)
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
str = start;
|
|
|
|
|
|
|
|
|
|
/* Record a default length for the insn. This will get set to the
|
|
|
|
|
correct value while parsing. */
|
|
|
|
|
/* FIXME: wip */
|
|
|
|
|
CGEN_FIELDS_BITSIZE (fields) = CGEN_INSN_BITSIZE (insn);
|
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
if (! CGEN_PARSE_FN (insn) (insn, & str, fields))
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
1998-07-21 20:59:23 +00:00
|
|
|
|
/* ??? 0 is passed for `pc' */
|
|
|
|
|
if (CGEN_INSERT_FN (insn) (insn, fields, buf, (bfd_vma) 0) != NULL)
|
1998-02-23 21:17:29 +00:00
|
|
|
|
continue;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
/* It is up to the caller to actually output the insn and any
|
|
|
|
|
queued relocs. */
|
|
|
|
|
return insn;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Try the next entry. */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* FIXME: We can return a better error message than this.
|
|
|
|
|
Need to track why it failed and pick the right one. */
|
|
|
|
|
{
|
|
|
|
|
static char errbuf[100];
|
1998-04-28 00:07:48 +00:00
|
|
|
|
if (strlen (start) > 50)
|
1998-07-21 20:59:23 +00:00
|
|
|
|
/* xgettext:c-format */
|
1998-04-28 00:07:48 +00:00
|
|
|
|
sprintf (errbuf, _("bad instruction `%.50s...'"), start);
|
1998-07-21 20:59:23 +00:00
|
|
|
|
else
|
|
|
|
|
/* xgettext:c-format */
|
1998-04-28 00:07:48 +00:00
|
|
|
|
sprintf (errbuf, _("bad instruction `%.50s'"), start);
|
|
|
|
|
|
1998-01-13 01:37:20 +00:00
|
|
|
|
*errmsg = errbuf;
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#if 0 /* This calls back to GAS which we can't do without care. */
|
|
|
|
|
|
|
|
|
|
/* Record each member of OPVALS in the assembler's symbol table.
|
|
|
|
|
This lets GAS parse registers for us.
|
|
|
|
|
??? Interesting idea but not currently used. */
|
|
|
|
|
|
|
|
|
|
/* Record each member of OPVALS in the assembler's symbol table.
|
|
|
|
|
FIXME: Not currently used. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
@arch@_cgen_asm_hash_keywords (opvals)
|
1998-02-23 21:17:29 +00:00
|
|
|
|
CGEN_KEYWORD * opvals;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
|
|
|
|
CGEN_KEYWORD_SEARCH search = cgen_keyword_search_init (opvals, NULL);
|
1998-02-23 21:17:29 +00:00
|
|
|
|
const CGEN_KEYWORD_ENTRY * ke;
|
1998-01-13 01:37:20 +00:00
|
|
|
|
|
1998-02-23 21:17:29 +00:00
|
|
|
|
while ((ke = cgen_keyword_search_next (& search)) != NULL)
|
1998-01-13 01:37:20 +00:00
|
|
|
|
{
|
|
|
|
|
#if 0 /* Unnecessary, should be done in the search routine. */
|
|
|
|
|
if (! @arch@_cgen_opval_supported (ke))
|
|
|
|
|
continue;
|
|
|
|
|
#endif
|
|
|
|
|
cgen_asm_record_register (ke->name, ke->value);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#endif /* 0 */
|