mirror of
https://sourceware.org/git/binutils-gdb.git
synced 2024-12-03 04:12:10 +08:00
f6e6b40ff5
* cgen-dis.in, cgen-asm.in, cgen-ibld.in: New files. * cgen.sh: Likewise.
571 lines
15 KiB
C
571 lines
15 KiB
C
/* Instruction building/extraction support for @arch@. -*- C -*-
|
||
|
||
THIS FILE IS MACHINE GENERATED WITH CGEN: Cpu tools GENerator.
|
||
- the resultant file is machine generated, cgen-ibld.in isn't
|
||
|
||
Copyright (C) 1996, 1997, 1998, 1999, 2000 Free Software Foundation, Inc.
|
||
|
||
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
|
||
along with this program; if not, write to the Free Software Foundation, Inc.,
|
||
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
|
||
|
||
/* ??? Eventually more and more of this stuff can go to cpu-independent files.
|
||
Keep that in mind. */
|
||
|
||
#include "sysdep.h"
|
||
#include <ctype.h>
|
||
#include <stdio.h>
|
||
#include "ansidecl.h"
|
||
#include "dis-asm.h"
|
||
#include "bfd.h"
|
||
#include "symcat.h"
|
||
#include "@prefix@-desc.h"
|
||
#include "@prefix@-opc.h"
|
||
#include "opintl.h"
|
||
|
||
#undef min
|
||
#define min(a,b) ((a) < (b) ? (a) : (b))
|
||
#undef max
|
||
#define max(a,b) ((a) > (b) ? (a) : (b))
|
||
|
||
/* Used by the ifield rtx function. */
|
||
#define FLD(f) (fields->f)
|
||
|
||
static const char * insert_normal
|
||
PARAMS ((CGEN_CPU_DESC, long, unsigned int, unsigned int, unsigned int,
|
||
unsigned int, unsigned int, unsigned int, CGEN_INSN_BYTES_PTR));
|
||
static const char * insert_insn_normal
|
||
PARAMS ((CGEN_CPU_DESC, const CGEN_INSN *,
|
||
CGEN_FIELDS *, CGEN_INSN_BYTES_PTR, bfd_vma));
|
||
|
||
static int extract_normal
|
||
PARAMS ((CGEN_CPU_DESC, CGEN_EXTRACT_INFO *, CGEN_INSN_INT,
|
||
unsigned int, unsigned int, unsigned int, unsigned int,
|
||
unsigned int, unsigned int, bfd_vma, long *));
|
||
static int extract_insn_normal
|
||
PARAMS ((CGEN_CPU_DESC, const CGEN_INSN *, CGEN_EXTRACT_INFO *,
|
||
CGEN_INSN_INT, CGEN_FIELDS *, bfd_vma));
|
||
|
||
/* Operand insertion. */
|
||
|
||
#if ! CGEN_INT_INSN_P
|
||
|
||
/* Subroutine of insert_normal. */
|
||
|
||
static CGEN_INLINE void
|
||
insert_1 (cd, value, start, length, word_length, bufp)
|
||
CGEN_CPU_DESC cd;
|
||
unsigned long value;
|
||
int start,length,word_length;
|
||
unsigned char *bufp;
|
||
{
|
||
unsigned long x,mask;
|
||
int shift;
|
||
int big_p = CGEN_CPU_INSN_ENDIAN (cd) == CGEN_ENDIAN_BIG;
|
||
|
||
switch (word_length)
|
||
{
|
||
case 8:
|
||
x = *bufp;
|
||
break;
|
||
case 16:
|
||
if (big_p)
|
||
x = bfd_getb16 (bufp);
|
||
else
|
||
x = bfd_getl16 (bufp);
|
||
break;
|
||
case 24:
|
||
/* ??? This may need reworking as these cases don't necessarily
|
||
want the first byte and the last two bytes handled like this. */
|
||
if (big_p)
|
||
x = (bufp[0] << 16) | bfd_getb16 (bufp + 1);
|
||
else
|
||
x = bfd_getl16 (bufp) | (bufp[2] << 16);
|
||
break;
|
||
case 32:
|
||
if (big_p)
|
||
x = bfd_getb32 (bufp);
|
||
else
|
||
x = bfd_getl32 (bufp);
|
||
break;
|
||
default :
|
||
abort ();
|
||
}
|
||
|
||
/* Written this way to avoid undefined behaviour. */
|
||
mask = (((1L << (length - 1)) - 1) << 1) | 1;
|
||
if (CGEN_INSN_LSB0_P)
|
||
shift = (start + 1) - length;
|
||
else
|
||
shift = (word_length - (start + length));
|
||
x = (x & ~(mask << shift)) | ((value & mask) << shift);
|
||
|
||
switch (word_length)
|
||
{
|
||
case 8:
|
||
*bufp = x;
|
||
break;
|
||
case 16:
|
||
if (big_p)
|
||
bfd_putb16 (x, bufp);
|
||
else
|
||
bfd_putl16 (x, bufp);
|
||
break;
|
||
case 24:
|
||
/* ??? This may need reworking as these cases don't necessarily
|
||
want the first byte and the last two bytes handled like this. */
|
||
if (big_p)
|
||
{
|
||
bufp[0] = x >> 16;
|
||
bfd_putb16 (x, bufp + 1);
|
||
}
|
||
else
|
||
{
|
||
bfd_putl16 (x, bufp);
|
||
bufp[2] = x >> 16;
|
||
}
|
||
break;
|
||
case 32:
|
||
if (big_p)
|
||
bfd_putb32 (x, bufp);
|
||
else
|
||
bfd_putl32 (x, bufp);
|
||
break;
|
||
default :
|
||
abort ();
|
||
}
|
||
}
|
||
|
||
#endif /* ! CGEN_INT_INSN_P */
|
||
|
||
/* Default insertion routine.
|
||
|
||
ATTRS is a mask of the boolean attributes.
|
||
WORD_OFFSET is the offset in bits from the start of the insn of the value.
|
||
WORD_LENGTH is the length of the word in bits in which the value resides.
|
||
START is the starting bit number in the word, architecture origin.
|
||
LENGTH is the length of VALUE in bits.
|
||
TOTAL_LENGTH is the total length of the insn in bits.
|
||
|
||
The result is an error message or NULL if success. */
|
||
|
||
/* ??? This duplicates functionality with bfd's howto table and
|
||
bfd_install_relocation. */
|
||
/* ??? This doesn't handle bfd_vma's. Create another function when
|
||
necessary. */
|
||
|
||
static const char *
|
||
insert_normal (cd, value, attrs, word_offset, start, length, word_length,
|
||
total_length, buffer)
|
||
CGEN_CPU_DESC cd;
|
||
long value;
|
||
unsigned int attrs;
|
||
unsigned int word_offset, start, length, word_length, total_length;
|
||
CGEN_INSN_BYTES_PTR buffer;
|
||
{
|
||
static char errbuf[100];
|
||
/* Written this way to avoid undefined behaviour. */
|
||
unsigned 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;
|
||
|
||
if (CGEN_INT_INSN_P
|
||
&& word_offset != 0)
|
||
abort ();
|
||
|
||
if (word_length > 32)
|
||
abort ();
|
||
|
||
/* For architectures with insns smaller than the base-insn-bitsize,
|
||
word_length may be too big. */
|
||
if (cd->min_insn_bitsize < cd->base_insn_bitsize)
|
||
{
|
||
if (word_offset == 0
|
||
&& word_length > total_length)
|
||
word_length = total_length;
|
||
}
|
||
|
||
/* Ensure VALUE will fit. */
|
||
if (! CGEN_BOOL_ATTR (attrs, CGEN_IFLD_SIGNED))
|
||
{
|
||
unsigned long maxval = mask;
|
||
|
||
if ((unsigned long) value > maxval)
|
||
{
|
||
/* xgettext:c-format */
|
||
sprintf (errbuf,
|
||
_("operand out of range (%lu not between 0 and %lu)"),
|
||
value, maxval);
|
||
return errbuf;
|
||
}
|
||
}
|
||
else
|
||
{
|
||
if (! cgen_signed_overflow_ok_p (cd))
|
||
{
|
||
long minval = - (1L << (length - 1));
|
||
long maxval = (1L << (length - 1)) - 1;
|
||
|
||
if (value < minval || value > maxval)
|
||
{
|
||
sprintf
|
||
/* xgettext:c-format */
|
||
(errbuf, _("operand out of range (%ld not between %ld and %ld)"),
|
||
value, minval, maxval);
|
||
return errbuf;
|
||
}
|
||
}
|
||
}
|
||
|
||
#if CGEN_INT_INSN_P
|
||
|
||
{
|
||
int shift;
|
||
|
||
if (CGEN_INSN_LSB0_P)
|
||
shift = (start + 1) - length;
|
||
else
|
||
shift = word_length - (start + length);
|
||
*buffer = (*buffer & ~(mask << shift)) | ((value & mask) << shift);
|
||
}
|
||
|
||
#else /* ! CGEN_INT_INSN_P */
|
||
|
||
{
|
||
unsigned char *bufp = (unsigned char *) buffer + word_offset / 8;
|
||
|
||
insert_1 (cd, value, start, length, word_length, bufp);
|
||
}
|
||
|
||
#endif /* ! CGEN_INT_INSN_P */
|
||
|
||
return NULL;
|
||
}
|
||
|
||
/* Default insn builder (insert handler).
|
||
The instruction is recorded in CGEN_INT_INSN_P byte order
|
||
(meaning that if CGEN_INT_INSN_P BUFFER is an int * and thus the value is
|
||
recorded in host byte order, otherwise BUFFER is an array of bytes and the
|
||
value is recorded in target byte order).
|
||
The result is an error message or NULL if success. */
|
||
|
||
static const char *
|
||
insert_insn_normal (cd, insn, fields, buffer, pc)
|
||
CGEN_CPU_DESC cd;
|
||
const CGEN_INSN * insn;
|
||
CGEN_FIELDS * fields;
|
||
CGEN_INSN_BYTES_PTR buffer;
|
||
bfd_vma pc;
|
||
{
|
||
const CGEN_SYNTAX *syntax = CGEN_INSN_SYNTAX (insn);
|
||
unsigned long value;
|
||
const unsigned char * syn;
|
||
|
||
CGEN_INIT_INSERT (cd);
|
||
value = CGEN_INSN_BASE_VALUE (insn);
|
||
|
||
/* If we're recording insns as numbers (rather than a string of bytes),
|
||
target byte order handling is deferred until later. */
|
||
|
||
#if CGEN_INT_INSN_P
|
||
|
||
*buffer = value;
|
||
|
||
#else
|
||
|
||
cgen_put_insn_value (cd, buffer, min (cd->base_insn_bitsize,
|
||
CGEN_FIELDS_BITSIZE (fields)),
|
||
value);
|
||
|
||
#endif /* ! CGEN_INT_INSN_P */
|
||
|
||
/* ??? It would be better to scan the format's fields.
|
||
Still need to be able to insert a value based on the operand though;
|
||
e.g. storing a branch displacement that got resolved later.
|
||
Needs more thought first. */
|
||
|
||
for (syn = CGEN_SYNTAX_STRING (syntax); * syn != '\0'; ++ syn)
|
||
{
|
||
const char *errmsg;
|
||
|
||
if (CGEN_SYNTAX_CHAR_P (* syn))
|
||
continue;
|
||
|
||
errmsg = (* cd->insert_operand) (cd, CGEN_SYNTAX_FIELD (*syn),
|
||
fields, buffer, pc);
|
||
if (errmsg)
|
||
return errmsg;
|
||
}
|
||
|
||
return NULL;
|
||
}
|
||
|
||
/* Operand extraction. */
|
||
|
||
#if ! CGEN_INT_INSN_P
|
||
|
||
/* Subroutine of extract_normal.
|
||
Ensure sufficient bytes are cached in EX_INFO.
|
||
OFFSET is the offset in bytes from the start of the insn of the value.
|
||
BYTES is the length of the needed value.
|
||
Returns 1 for success, 0 for failure. */
|
||
|
||
static CGEN_INLINE int
|
||
fill_cache (cd, ex_info, offset, bytes, pc)
|
||
CGEN_CPU_DESC cd;
|
||
CGEN_EXTRACT_INFO *ex_info;
|
||
int offset, bytes;
|
||
bfd_vma pc;
|
||
{
|
||
/* It's doubtful that the middle part has already been fetched so
|
||
we don't optimize that case. kiss. */
|
||
int mask;
|
||
disassemble_info *info = (disassemble_info *) ex_info->dis_info;
|
||
|
||
/* First do a quick check. */
|
||
mask = (1 << bytes) - 1;
|
||
if (((ex_info->valid >> offset) & mask) == mask)
|
||
return 1;
|
||
|
||
/* Search for the first byte we need to read. */
|
||
for (mask = 1 << offset; bytes > 0; --bytes, ++offset, mask <<= 1)
|
||
if (! (mask & ex_info->valid))
|
||
break;
|
||
|
||
if (bytes)
|
||
{
|
||
int status;
|
||
|
||
pc += offset;
|
||
status = (*info->read_memory_func)
|
||
(pc, ex_info->insn_bytes + offset, bytes, info);
|
||
|
||
if (status != 0)
|
||
{
|
||
(*info->memory_error_func) (status, pc, info);
|
||
return 0;
|
||
}
|
||
|
||
ex_info->valid |= ((1 << bytes) - 1) << offset;
|
||
}
|
||
|
||
return 1;
|
||
}
|
||
|
||
/* Subroutine of extract_normal. */
|
||
|
||
static CGEN_INLINE long
|
||
extract_1 (cd, ex_info, start, length, word_length, bufp, pc)
|
||
CGEN_CPU_DESC cd;
|
||
CGEN_EXTRACT_INFO *ex_info;
|
||
int start,length,word_length;
|
||
unsigned char *bufp;
|
||
bfd_vma pc;
|
||
{
|
||
unsigned long x,mask;
|
||
int shift;
|
||
int big_p = CGEN_CPU_INSN_ENDIAN (cd) == CGEN_ENDIAN_BIG;
|
||
|
||
switch (word_length)
|
||
{
|
||
case 8:
|
||
x = *bufp;
|
||
break;
|
||
case 16:
|
||
if (big_p)
|
||
x = bfd_getb16 (bufp);
|
||
else
|
||
x = bfd_getl16 (bufp);
|
||
break;
|
||
case 24:
|
||
/* ??? This may need reworking as these cases don't necessarily
|
||
want the first byte and the last two bytes handled like this. */
|
||
if (big_p)
|
||
x = (bufp[0] << 16) | bfd_getb16 (bufp + 1);
|
||
else
|
||
x = bfd_getl16 (bufp) | (bufp[2] << 16);
|
||
break;
|
||
case 32:
|
||
if (big_p)
|
||
x = bfd_getb32 (bufp);
|
||
else
|
||
x = bfd_getl32 (bufp);
|
||
break;
|
||
default :
|
||
abort ();
|
||
}
|
||
|
||
/* Written this way to avoid undefined behaviour. */
|
||
mask = (((1L << (length - 1)) - 1) << 1) | 1;
|
||
if (CGEN_INSN_LSB0_P)
|
||
shift = (start + 1) - length;
|
||
else
|
||
shift = (word_length - (start + length));
|
||
return (x >> shift) & mask;
|
||
}
|
||
|
||
#endif /* ! CGEN_INT_INSN_P */
|
||
|
||
/* Default extraction routine.
|
||
|
||
INSN_VALUE is the first base_insn_bitsize bits of the insn in host order,
|
||
or sometimes less for cases like the m32r where the base insn size is 32
|
||
but some insns are 16 bits.
|
||
ATTRS is a mask of the boolean attributes. We only need `SIGNED',
|
||
but for generality we take a bitmask of all of them.
|
||
WORD_OFFSET is the offset in bits from the start of the insn of the value.
|
||
WORD_LENGTH is the length of the word in bits in which the value resides.
|
||
START is the starting bit number in the word, architecture origin.
|
||
LENGTH is the length of VALUE in bits.
|
||
TOTAL_LENGTH is the total length of the insn in bits.
|
||
|
||
Returns 1 for success, 0 for failure. */
|
||
|
||
/* ??? The return code isn't properly used. wip. */
|
||
|
||
/* ??? This doesn't handle bfd_vma's. Create another function when
|
||
necessary. */
|
||
|
||
static int
|
||
extract_normal (cd, ex_info, insn_value, attrs, word_offset, start, length,
|
||
word_length, total_length, pc, valuep)
|
||
CGEN_CPU_DESC cd;
|
||
#if ! CGEN_INT_INSN_P
|
||
CGEN_EXTRACT_INFO *ex_info;
|
||
#else
|
||
CGEN_EXTRACT_INFO *ex_info ATTRIBUTE_UNUSED;
|
||
#endif
|
||
CGEN_INSN_INT insn_value;
|
||
unsigned int attrs;
|
||
unsigned int word_offset, start, length, word_length, total_length;
|
||
#if ! CGEN_INT_INSN_P
|
||
bfd_vma pc;
|
||
#else
|
||
bfd_vma pc ATTRIBUTE_UNUSED;
|
||
#endif
|
||
long *valuep;
|
||
{
|
||
CGEN_INSN_INT value;
|
||
|
||
/* If LENGTH is zero, this operand doesn't contribute to the value
|
||
so give it a standard value of zero. */
|
||
if (length == 0)
|
||
{
|
||
*valuep = 0;
|
||
return 1;
|
||
}
|
||
|
||
if (CGEN_INT_INSN_P
|
||
&& word_offset != 0)
|
||
abort ();
|
||
|
||
if (word_length > 32)
|
||
abort ();
|
||
|
||
/* For architectures with insns smaller than the insn-base-bitsize,
|
||
word_length may be too big. */
|
||
if (cd->min_insn_bitsize < cd->base_insn_bitsize)
|
||
{
|
||
if (word_offset == 0
|
||
&& word_length > total_length)
|
||
word_length = total_length;
|
||
}
|
||
|
||
/* Does the value reside in INSN_VALUE? */
|
||
|
||
if (word_offset == 0)
|
||
{
|
||
/* Written this way to avoid undefined behaviour. */
|
||
CGEN_INSN_INT mask = (((1L << (length - 1)) - 1) << 1) | 1;
|
||
|
||
if (CGEN_INSN_LSB0_P)
|
||
value = insn_value >> ((start + 1) - length);
|
||
else
|
||
value = insn_value >> (word_length - (start + length));
|
||
value &= mask;
|
||
/* sign extend? */
|
||
if (CGEN_BOOL_ATTR (attrs, CGEN_IFLD_SIGNED)
|
||
&& (value & (1L << (length - 1))))
|
||
value |= ~mask;
|
||
}
|
||
|
||
#if ! CGEN_INT_INSN_P
|
||
|
||
else
|
||
{
|
||
unsigned char *bufp = ex_info->insn_bytes + word_offset / 8;
|
||
|
||
if (word_length > 32)
|
||
abort ();
|
||
|
||
if (fill_cache (cd, ex_info, word_offset / 8, word_length / 8, pc) == 0)
|
||
return 0;
|
||
|
||
value = extract_1 (cd, ex_info, start, length, word_length, bufp, pc);
|
||
}
|
||
|
||
#endif /* ! CGEN_INT_INSN_P */
|
||
|
||
*valuep = value;
|
||
|
||
return 1;
|
||
}
|
||
|
||
/* Default insn extractor.
|
||
|
||
INSN_VALUE is the first base_insn_bitsize bits, translated to host order.
|
||
The extracted fields are stored in FIELDS.
|
||
EX_INFO is used to handle reading variable length insns.
|
||
Return the length of the insn in bits, or 0 if no match,
|
||
or -1 if an error occurs fetching data (memory_error_func will have
|
||
been called). */
|
||
|
||
static int
|
||
extract_insn_normal (cd, insn, ex_info, insn_value, fields, pc)
|
||
CGEN_CPU_DESC cd;
|
||
const CGEN_INSN *insn;
|
||
CGEN_EXTRACT_INFO *ex_info;
|
||
CGEN_INSN_INT insn_value;
|
||
CGEN_FIELDS *fields;
|
||
bfd_vma pc;
|
||
{
|
||
const CGEN_SYNTAX *syntax = CGEN_INSN_SYNTAX (insn);
|
||
const unsigned char *syn;
|
||
|
||
CGEN_FIELDS_BITSIZE (fields) = CGEN_INSN_BITSIZE (insn);
|
||
|
||
CGEN_INIT_EXTRACT (cd);
|
||
|
||
for (syn = CGEN_SYNTAX_STRING (syntax); *syn; ++syn)
|
||
{
|
||
int length;
|
||
|
||
if (CGEN_SYNTAX_CHAR_P (*syn))
|
||
continue;
|
||
|
||
length = (* cd->extract_operand) (cd, CGEN_SYNTAX_FIELD (*syn),
|
||
ex_info, insn_value, fields, pc);
|
||
if (length <= 0)
|
||
return length;
|
||
}
|
||
|
||
/* We recognized and successfully extracted this insn. */
|
||
return CGEN_INSN_BITSIZE (insn);
|
||
}
|
||
|
||
/* machine generated code added here */
|