461 lines
7.8 KiB
C
461 lines
7.8 KiB
C
#include <signal.h>
|
|
#include "sysdep.h"
|
|
#include "bfd.h"
|
|
#include "remote-sim.h"
|
|
#include "callback.h"
|
|
|
|
#include "d10v_sim.h"
|
|
|
|
#define IMEM_SIZE 18 /* D10V instruction memory size is 18 bits */
|
|
#define DMEM_SIZE 16 /* Data memory */
|
|
|
|
uint16 OP[4];
|
|
|
|
static struct hash_entry *lookup_hash PARAMS ((uint32 ins, int size));
|
|
|
|
#define MAX_HASH 63
|
|
struct hash_entry
|
|
{
|
|
struct hash_entry *next;
|
|
long opcode;
|
|
long mask;
|
|
struct simops *ops;
|
|
};
|
|
|
|
struct hash_entry hash_table[MAX_HASH+1];
|
|
|
|
static long
|
|
hash(insn, format)
|
|
long insn;
|
|
int format;
|
|
{
|
|
if (format & LONG_OPCODE)
|
|
return ((insn & 0x3F000000) >> 24);
|
|
else
|
|
return((insn & 0x7E00) >> 9);
|
|
}
|
|
|
|
static struct hash_entry *
|
|
lookup_hash (ins, size)
|
|
uint32 ins;
|
|
int size;
|
|
{
|
|
struct hash_entry *h;
|
|
|
|
if (size)
|
|
h = &hash_table[(ins & 0x3F000000) >> 24];
|
|
else
|
|
h = &hash_table[(ins & 0x7E00) >> 9];
|
|
|
|
while ( (ins & h->mask) != h->opcode)
|
|
{
|
|
if (h->next == NULL)
|
|
{
|
|
printf ("ERROR looking up hash for %x\n",ins);
|
|
exit(1);
|
|
}
|
|
h = h->next;
|
|
}
|
|
return (h);
|
|
}
|
|
|
|
uint32
|
|
get_longword (x)
|
|
uint8 *x;
|
|
{
|
|
uint8 *a = x;
|
|
return (a[0]<<24) + (a[1]<<16) + (a[2]<<8) + (a[3]);
|
|
}
|
|
|
|
int64
|
|
get_longlong (x)
|
|
uint8 *x;
|
|
{
|
|
uint8 *a = x;
|
|
return ((int64)a[0]<<56) + ((int64)a[1]<<48) + ((int64)a[2]<<40) + ((int64)a[3]<<32) +
|
|
((int64)a[4]<< 24) + ((int64)a[5]<<16) + ((int64)a[6]<<8) + (int64)a[7];
|
|
}
|
|
|
|
uint16
|
|
get_word (x)
|
|
uint8 *x;
|
|
{
|
|
uint8 *a = x;
|
|
return ((uint16)a[0]<<8) + a[1];
|
|
}
|
|
|
|
void
|
|
write_word (addr, data)
|
|
uint8 *addr;
|
|
uint16 data;
|
|
{
|
|
uint8 *a = addr;
|
|
a[0] = data >> 8;
|
|
a[1] = data & 0xff;
|
|
}
|
|
|
|
void
|
|
write_longlong (addr, data)
|
|
uint8 *addr;
|
|
int64 data;
|
|
{
|
|
uint8 *a = addr;
|
|
a[0] = data >> 56;
|
|
a[1] = (data >> 48) & 0xff;
|
|
a[2] = (data >> 40) & 0xff;
|
|
a[3] = (data >> 32) & 0xff;
|
|
a[4] = (data >> 24) & 0xff;
|
|
a[5] = (data >> 16) & 0xff;
|
|
a[6] = (data >> 8) & 0xff;
|
|
a[7] = data & 0xff;
|
|
}
|
|
|
|
|
|
static void
|
|
get_operands (struct simops *s, uint32 ins)
|
|
{
|
|
int i, shift, bits, flags;
|
|
uint32 mask;
|
|
for (i=0; i < s->numops; i++)
|
|
{
|
|
shift = s->operands[3*i];
|
|
bits = s->operands[3*i+1];
|
|
flags = s->operands[3*i+2];
|
|
mask = 0x7FFFFFFF >> (31 - bits);
|
|
OP[i] = (ins >> shift) & mask;
|
|
}
|
|
}
|
|
|
|
static void
|
|
do_long (ins)
|
|
uint32 ins;
|
|
{
|
|
struct hash_entry *h;
|
|
/* printf ("do_long %x\n",ins); */
|
|
h = lookup_hash (ins, 1);
|
|
get_operands (h->ops, ins);
|
|
(h->ops->func)();
|
|
}
|
|
static void
|
|
do_2_short (ins1, ins2)
|
|
uint16 ins1, ins2;
|
|
{
|
|
struct hash_entry *h;
|
|
/* printf ("do_2_short %x -> %x\n",ins1,ins2); */
|
|
h = lookup_hash (ins1, 0);
|
|
get_operands (h->ops, ins1);
|
|
(h->ops->func)();
|
|
h = lookup_hash (ins2, 0);
|
|
get_operands (h->ops, ins2);
|
|
(h->ops->func)();
|
|
}
|
|
static void
|
|
do_parallel (ins1, ins2)
|
|
uint16 ins1, ins2;
|
|
{
|
|
struct hash_entry *h1, *h2;
|
|
/* printf ("do_parallel %x || %x\n",ins1,ins2); */
|
|
h1 = lookup_hash (ins1, 0);
|
|
h2 = lookup_hash (ins2, 0);
|
|
|
|
if (h1->ops->exec_type == PARONLY)
|
|
{
|
|
get_operands (h1->ops, ins1);
|
|
(h1->ops->func)();
|
|
if (State.exe)
|
|
{
|
|
get_operands (h2->ops, ins2);
|
|
(h2->ops->func)();
|
|
}
|
|
}
|
|
else if (h2->ops->exec_type == PARONLY)
|
|
{
|
|
get_operands (h2->ops, ins2);
|
|
(h2->ops->func)();
|
|
if (State.exe)
|
|
{
|
|
get_operands (h1->ops, ins1);
|
|
(h1->ops->func)();
|
|
}
|
|
}
|
|
else
|
|
{
|
|
get_operands (h1->ops, ins1);
|
|
(h1->ops->func)();
|
|
get_operands (h2->ops, ins2);
|
|
(h2->ops->func)();
|
|
}
|
|
}
|
|
|
|
|
|
void
|
|
sim_size (power)
|
|
int power;
|
|
|
|
{
|
|
if (State.imem)
|
|
{
|
|
free (State.imem);
|
|
free (State.dmem);
|
|
}
|
|
|
|
State.imem = (uint8 *)calloc(1,1<<IMEM_SIZE);
|
|
State.dmem = (uint8 *)calloc(1,1<<DMEM_SIZE);
|
|
if (!State.imem || !State.dmem )
|
|
{
|
|
fprintf (stderr,"Memory allocation failed.\n");
|
|
exit(1);
|
|
}
|
|
printf ("Allocated %d bytes instruction memory and\n",1<<IMEM_SIZE);
|
|
printf (" %d bytes data memory.\n",1<<DMEM_SIZE);
|
|
}
|
|
|
|
static void
|
|
init_system ()
|
|
{
|
|
if (!State.imem)
|
|
sim_size(1);
|
|
}
|
|
|
|
int
|
|
sim_write (addr, buffer, size)
|
|
SIM_ADDR addr;
|
|
unsigned char *buffer;
|
|
int size;
|
|
{
|
|
int i;
|
|
init_system ();
|
|
|
|
/* printf ("sim_write %d bytes to 0x%x\n",size,addr); */
|
|
for (i = 0; i < size; i++)
|
|
{
|
|
State.imem[i+addr] = buffer[i];
|
|
}
|
|
return size;
|
|
}
|
|
|
|
void
|
|
sim_open (args)
|
|
char *args;
|
|
{
|
|
struct simops *s;
|
|
struct hash_entry *h, *prev;
|
|
if (args != NULL)
|
|
printf ("sim_open %s\n",args);
|
|
|
|
/* put all the opcodes in the hash table */
|
|
for (s = Simops; s->func; s++)
|
|
{
|
|
h = &hash_table[hash(s->opcode,s->format)];
|
|
|
|
/* go to the last entry in the chain */
|
|
while (h->next)
|
|
h = h->next;
|
|
|
|
if (h->ops)
|
|
{
|
|
h->next = calloc(1,sizeof(struct hash_entry));
|
|
h = h->next;
|
|
}
|
|
h->ops = s;
|
|
h->mask = s->mask;
|
|
h->opcode = s->opcode;
|
|
}
|
|
}
|
|
|
|
|
|
void
|
|
sim_close (quitting)
|
|
int quitting;
|
|
{
|
|
/* nothing to do */
|
|
}
|
|
|
|
void
|
|
sim_set_profile (n)
|
|
int n;
|
|
{
|
|
printf ("sim_set_profile %d\n",n);
|
|
}
|
|
|
|
void
|
|
sim_set_profile_size (n)
|
|
int n;
|
|
{
|
|
printf ("sim_set_profile_size %d\n",n);
|
|
}
|
|
|
|
void
|
|
sim_resume (step, siggnal)
|
|
int step, siggnal;
|
|
{
|
|
uint32 inst;
|
|
int i;
|
|
reg_t oldpc;
|
|
|
|
/* printf ("sim_resume (%d,%d) PC=0x%x\n",step,siggnal,PC); */
|
|
|
|
if (step)
|
|
State.exception = SIGTRAP;
|
|
else
|
|
State.exception = 0;
|
|
|
|
do
|
|
{
|
|
inst = RLW (PC << 2);
|
|
oldpc = PC;
|
|
switch (inst & 0xC0000000)
|
|
{
|
|
case 0xC0000000:
|
|
/* long instruction */
|
|
do_long (inst & 0x3FFFFFFF);
|
|
break;
|
|
case 0x80000000:
|
|
/* R -> L */
|
|
do_2_short ( inst & 0x7FFF, (inst & 0x3FFF8000) >> 15);
|
|
break;
|
|
case 0x40000000:
|
|
/* L -> R */
|
|
do_2_short ((inst & 0x3FFF8000) >> 15, inst & 0x7FFF);
|
|
break;
|
|
case 0:
|
|
do_parallel ((inst & 0x3FFF8000) >> 15, inst & 0x7FFF);
|
|
break;
|
|
}
|
|
|
|
if (State.RP && PC == RPT_E)
|
|
{
|
|
RPT_C -= 1;
|
|
if (RPT_C == 0)
|
|
State.RP = 0;
|
|
else
|
|
PC = RPT_S;
|
|
}
|
|
|
|
/* FIXME */
|
|
if (PC == oldpc)
|
|
PC++;
|
|
}
|
|
while (!State.exception);
|
|
}
|
|
|
|
int
|
|
sim_trace ()
|
|
{
|
|
printf ("sim_trace\n");
|
|
return 0;
|
|
}
|
|
|
|
void
|
|
sim_info (verbose)
|
|
int verbose;
|
|
{
|
|
printf ("sim_info\n");
|
|
}
|
|
|
|
void
|
|
sim_create_inferior (start_address, argv, env)
|
|
SIM_ADDR start_address;
|
|
char **argv;
|
|
char **env;
|
|
{
|
|
printf ("sim_create_inferior: PC=0x%x\n",start_address);
|
|
PC = start_address >> 2;
|
|
}
|
|
|
|
|
|
void
|
|
sim_kill ()
|
|
{
|
|
/* nothing to do */
|
|
}
|
|
|
|
void
|
|
sim_set_callbacks(p)
|
|
host_callback *p;
|
|
{
|
|
printf ("sim_set_callbacks\n");
|
|
/* callback = p; */
|
|
}
|
|
|
|
void
|
|
sim_stop_reason (reason, sigrc)
|
|
enum sim_stop *reason;
|
|
int *sigrc;
|
|
{
|
|
/* printf ("sim_stop_reason: PC=0x%x\n",PC<<2); */
|
|
|
|
if (State.exception == SIGQUIT)
|
|
{
|
|
*reason = sim_exited;
|
|
*sigrc = State.exception;
|
|
}
|
|
else
|
|
{
|
|
*reason = sim_stopped;
|
|
*sigrc = State.exception;
|
|
}
|
|
}
|
|
|
|
void
|
|
sim_fetch_register (rn, memory)
|
|
int rn;
|
|
unsigned char *memory;
|
|
{
|
|
if (rn > 31)
|
|
{
|
|
WRITE_64 (memory, State.a[rn-32]);
|
|
/* printf ("sim_fetch_register %d 0x%llx\n",rn,State.a[rn-32]); */
|
|
}
|
|
else
|
|
{
|
|
WRITE_16 (memory, State.regs[rn]);
|
|
/* printf ("sim_fetch_register %d 0x%x\n",rn,State.regs[rn]); */
|
|
}
|
|
}
|
|
|
|
void
|
|
sim_store_register (rn, memory)
|
|
int rn;
|
|
unsigned char *memory;
|
|
{
|
|
if (rn > 31)
|
|
{
|
|
State.a[rn-32] = READ_64 (memory) & MASK40;
|
|
/* printf ("store: a%d=0x%llx\n",rn-32,State.a[rn-32]); */
|
|
}
|
|
else
|
|
{
|
|
State.regs[rn]= READ_16 (memory);
|
|
/* printf ("store: r%d=0x%x\n",rn,State.regs[rn]); */
|
|
}
|
|
}
|
|
|
|
sim_read (addr, buffer, size)
|
|
SIM_ADDR addr;
|
|
unsigned char *buffer;
|
|
int size;
|
|
{
|
|
int i;
|
|
for (i = 0; i < size; i++)
|
|
{
|
|
buffer[i] = State.imem[addr + i];
|
|
}
|
|
return size;
|
|
}
|
|
|
|
void
|
|
sim_do_command (cmd)
|
|
char *cmd;
|
|
{
|
|
printf("sim_do_command: %s\n",cmd);
|
|
}
|
|
|
|
int
|
|
sim_load (prog, from_tty)
|
|
char *prog;
|
|
int from_tty;
|
|
{
|
|
/* Return nonzero so GDB will handle it. */
|
|
return 1;
|
|
}
|