2015-10-07 15:20:19 +02:00
|
|
|
/* ARC target-dependent stuff. Extension structure access functions
|
2015-01-01 15:15:26 +01:00
|
|
|
Copyright (C) 1995-2015 Free Software Foundation, Inc.
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2007-07-05 11:49:03 +02:00
|
|
|
This file is part of libopcodes.
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2007-07-05 11:49:03 +02:00
|
|
|
This library is free software; you can redistribute it and/or modify
|
2001-01-11 22:20:20 +01:00
|
|
|
it under the terms of the GNU General Public License as published by
|
2007-07-05 11:49:03 +02:00
|
|
|
the Free Software Foundation; either version 3, or (at your option)
|
|
|
|
any later version.
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2007-07-05 11:49:03 +02:00
|
|
|
It 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.
|
2001-01-11 22:20:20 +01:00
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program; if not, write to the Free Software
|
2007-07-05 11:49:03 +02:00
|
|
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
|
|
|
|
MA 02110-1301, USA. */
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2001-08-31 22:05:24 +02:00
|
|
|
#include "sysdep.h"
|
2001-01-11 22:20:20 +01:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <stdio.h>
|
2015-10-07 15:20:19 +02:00
|
|
|
|
2001-01-11 22:20:20 +01:00
|
|
|
#include "bfd.h"
|
|
|
|
#include "arc-ext.h"
|
2015-10-07 15:20:19 +02:00
|
|
|
#include "elf/arc.h"
|
2001-01-11 22:20:20 +01:00
|
|
|
#include "libiberty.h"
|
|
|
|
|
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* This module provides support for extensions to the ARC processor
|
|
|
|
architecture. */
|
2001-01-11 22:20:20 +01:00
|
|
|
|
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* Local constants. */
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
#define FIRST_EXTENSION_CORE_REGISTER 32
|
|
|
|
#define LAST_EXTENSION_CORE_REGISTER 59
|
|
|
|
#define FIRST_EXTENSION_CONDITION_CODE 0x10
|
|
|
|
#define LAST_EXTENSION_CONDITION_CODE 0x1f
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
#define NUM_EXT_CORE \
|
|
|
|
(LAST_EXTENSION_CORE_REGISTER - FIRST_EXTENSION_CORE_REGISTER + 1)
|
|
|
|
#define NUM_EXT_COND \
|
|
|
|
(LAST_EXTENSION_CONDITION_CODE - FIRST_EXTENSION_CONDITION_CODE + 1)
|
|
|
|
#define INST_HASH_BITS 6
|
|
|
|
#define INST_HASH_SIZE (1 << INST_HASH_BITS)
|
|
|
|
#define INST_HASH_MASK (INST_HASH_SIZE - 1)
|
2001-01-11 22:20:20 +01:00
|
|
|
|
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* Local types. */
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* These types define the information stored in the table. */
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
struct ExtInstruction
|
|
|
|
{
|
|
|
|
char major;
|
|
|
|
char minor;
|
|
|
|
char flags;
|
|
|
|
char* name;
|
|
|
|
struct ExtInstruction* next;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct ExtAuxRegister
|
|
|
|
{
|
|
|
|
long address;
|
|
|
|
char* name;
|
|
|
|
struct ExtAuxRegister* next;
|
|
|
|
};
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
struct ExtCoreRegister
|
|
|
|
{
|
|
|
|
short number;
|
|
|
|
enum ExtReadWrite rw;
|
|
|
|
char* name;
|
|
|
|
};
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
struct arcExtMap
|
2001-01-11 22:20:20 +01:00
|
|
|
{
|
2015-10-07 15:20:19 +02:00
|
|
|
struct ExtAuxRegister* auxRegisters;
|
|
|
|
struct ExtInstruction* instructions[INST_HASH_SIZE];
|
|
|
|
struct ExtCoreRegister coreRegisters[NUM_EXT_CORE];
|
|
|
|
char* condCodes[NUM_EXT_COND];
|
|
|
|
};
|
2001-08-31 22:05:24 +02:00
|
|
|
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* Local data. */
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* Extension table. */
|
|
|
|
static struct arcExtMap arc_extension_map;
|
2001-08-31 22:05:24 +02:00
|
|
|
|
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* Local macros. */
|
2001-08-31 22:05:24 +02:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* A hash function used to map instructions into the table. */
|
|
|
|
#define INST_HASH(MAJOR, MINOR) ((((MAJOR) << 3) ^ (MINOR)) & INST_HASH_MASK)
|
2001-08-31 22:05:24 +02:00
|
|
|
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* Local functions. */
|
2001-08-31 22:05:24 +02:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
static void
|
|
|
|
create_map (unsigned char *block,
|
|
|
|
unsigned long length)
|
|
|
|
{
|
|
|
|
unsigned char *p = block;
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2001-08-31 22:05:24 +02:00
|
|
|
while (p && p < (block + length))
|
2001-01-11 22:20:20 +01:00
|
|
|
{
|
|
|
|
/* p[0] == length of record
|
|
|
|
p[1] == type of record
|
|
|
|
For instructions:
|
|
|
|
p[2] = opcode
|
|
|
|
p[3] = minor opcode (if opcode == 3)
|
|
|
|
p[4] = flags
|
|
|
|
p[5]+ = name
|
|
|
|
For core regs and condition codes:
|
|
|
|
p[2] = value
|
|
|
|
p[3]+ = name
|
2015-10-07 15:20:19 +02:00
|
|
|
For auxiliary regs:
|
2001-01-11 22:20:20 +01:00
|
|
|
p[2..5] = value
|
|
|
|
p[6]+ = name
|
2015-10-07 15:20:19 +02:00
|
|
|
(value is p[2]<<24|p[3]<<16|p[4]<<8|p[5]). */
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* The sequence of records is temrinated by an "empty"
|
|
|
|
record. */
|
2001-01-11 22:20:20 +01:00
|
|
|
if (p[0] == 0)
|
2015-10-07 15:20:19 +02:00
|
|
|
break;
|
2001-08-31 22:05:24 +02:00
|
|
|
|
2001-01-11 22:20:20 +01:00
|
|
|
switch (p[1])
|
|
|
|
{
|
|
|
|
case EXT_INSTRUCTION:
|
|
|
|
{
|
2015-10-07 15:20:19 +02:00
|
|
|
struct ExtInstruction *insn = XNEW (struct ExtInstruction);
|
|
|
|
int major = p[2];
|
|
|
|
int minor = p[3];
|
|
|
|
struct ExtInstruction **bucket =
|
|
|
|
&arc_extension_map.instructions[INST_HASH (major, minor)];
|
|
|
|
|
|
|
|
insn->name = xstrdup ((char *) (p + 5));
|
|
|
|
insn->major = major;
|
|
|
|
insn->minor = minor;
|
|
|
|
insn->flags = p[4];
|
|
|
|
insn->next = *bucket;
|
|
|
|
*bucket = insn;
|
|
|
|
break;
|
2001-01-11 22:20:20 +01:00
|
|
|
}
|
2001-08-31 22:05:24 +02:00
|
|
|
|
|
|
|
case EXT_CORE_REGISTER:
|
2001-01-11 22:20:20 +01:00
|
|
|
{
|
2015-10-07 15:20:19 +02:00
|
|
|
unsigned char number = p[2];
|
|
|
|
char* name = (char *) (p + 3);
|
|
|
|
|
|
|
|
arc_extension_map.
|
|
|
|
coreRegisters[number - FIRST_EXTENSION_CORE_REGISTER].number
|
|
|
|
= number;
|
|
|
|
arc_extension_map.
|
|
|
|
coreRegisters[number - FIRST_EXTENSION_CORE_REGISTER].rw
|
|
|
|
= REG_READWRITE;
|
|
|
|
arc_extension_map.
|
|
|
|
coreRegisters[number - FIRST_EXTENSION_CORE_REGISTER].name
|
|
|
|
= xstrdup (name);
|
|
|
|
break;
|
|
|
|
}
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
case EXT_LONG_CORE_REGISTER:
|
|
|
|
{
|
|
|
|
unsigned char number = p[2];
|
|
|
|
char* name = (char *) (p + 7);
|
|
|
|
enum ExtReadWrite rw = p[6];
|
|
|
|
|
|
|
|
arc_extension_map.
|
|
|
|
coreRegisters[number - FIRST_EXTENSION_CORE_REGISTER].number
|
|
|
|
= number;
|
|
|
|
arc_extension_map.
|
|
|
|
coreRegisters[number - FIRST_EXTENSION_CORE_REGISTER].rw
|
|
|
|
= rw;
|
|
|
|
arc_extension_map.
|
|
|
|
coreRegisters[number - FIRST_EXTENSION_CORE_REGISTER].name
|
|
|
|
= xstrdup (name);
|
2001-01-11 22:20:20 +01:00
|
|
|
}
|
2001-08-31 22:05:24 +02:00
|
|
|
|
|
|
|
case EXT_COND_CODE:
|
2001-01-11 22:20:20 +01:00
|
|
|
{
|
2015-10-07 15:20:19 +02:00
|
|
|
char *cc_name = xstrdup ((char *) (p + 3));
|
|
|
|
|
|
|
|
arc_extension_map.
|
|
|
|
condCodes[p[2] - FIRST_EXTENSION_CONDITION_CODE]
|
|
|
|
= cc_name;
|
|
|
|
break;
|
2001-08-31 22:05:24 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
case EXT_AUX_REGISTER:
|
2001-01-11 22:20:20 +01:00
|
|
|
{
|
2015-10-07 15:20:19 +02:00
|
|
|
/* Trickier -- need to store linked list of these. */
|
|
|
|
struct ExtAuxRegister *newAuxRegister
|
|
|
|
= XNEW (struct ExtAuxRegister);
|
|
|
|
char *aux_name = xstrdup ((char *) (p + 6));
|
2001-01-11 22:20:20 +01:00
|
|
|
|
|
|
|
newAuxRegister->name = aux_name;
|
2015-10-07 15:20:19 +02:00
|
|
|
newAuxRegister->address = (p[2] << 24) | (p[3] << 16)
|
|
|
|
| (p[4] << 8) | p[5];
|
2001-01-11 22:20:20 +01:00
|
|
|
newAuxRegister->next = arc_extension_map.auxRegisters;
|
|
|
|
arc_extension_map.auxRegisters = newAuxRegister;
|
2015-10-07 15:20:19 +02:00
|
|
|
break;
|
2001-01-11 22:20:20 +01:00
|
|
|
}
|
2001-08-31 22:05:24 +02:00
|
|
|
|
2001-01-11 22:20:20 +01:00
|
|
|
default:
|
2015-10-07 15:20:19 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
p += p[0]; /* Move on to next record. */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Free memory that has been allocated for the extensions. */
|
|
|
|
|
|
|
|
static void
|
|
|
|
destroy_map (void)
|
|
|
|
{
|
|
|
|
struct ExtAuxRegister *r;
|
|
|
|
unsigned int i;
|
|
|
|
|
|
|
|
/* Free auxiliary registers. */
|
|
|
|
r = arc_extension_map.auxRegisters;
|
|
|
|
while (r)
|
|
|
|
{
|
|
|
|
/* N.B. after r has been freed, r->next is invalid! */
|
|
|
|
struct ExtAuxRegister* next = r->next;
|
|
|
|
|
|
|
|
free (r->name);
|
|
|
|
free (r);
|
|
|
|
r = next;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Free instructions. */
|
|
|
|
for (i = 0; i < INST_HASH_SIZE; i++)
|
|
|
|
{
|
|
|
|
struct ExtInstruction *insn = arc_extension_map.instructions[i];
|
|
|
|
|
|
|
|
while (insn)
|
|
|
|
{
|
|
|
|
/* N.B. after insn has been freed, insn->next is invalid! */
|
|
|
|
struct ExtInstruction *next = insn->next;
|
|
|
|
|
|
|
|
free (insn->name);
|
|
|
|
free (insn);
|
|
|
|
insn = next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Free core registers. */
|
|
|
|
for (i = 0; i < NUM_EXT_CORE; i++)
|
|
|
|
{
|
|
|
|
if (arc_extension_map.coreRegisters[i].name)
|
|
|
|
free (arc_extension_map.coreRegisters[i].name);
|
|
|
|
}
|
2001-08-31 22:05:24 +02:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* Free condition codes. */
|
|
|
|
for (i = 0; i < NUM_EXT_COND; i++)
|
|
|
|
{
|
|
|
|
if (arc_extension_map.condCodes[i])
|
|
|
|
free (arc_extension_map.condCodes[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
memset (&arc_extension_map, 0, sizeof (arc_extension_map));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static const char *
|
|
|
|
ExtReadWrite_image (enum ExtReadWrite val)
|
|
|
|
{
|
|
|
|
switch (val)
|
|
|
|
{
|
|
|
|
case REG_INVALID : return "INVALID";
|
|
|
|
case REG_READ : return "RO";
|
|
|
|
case REG_WRITE : return "WO";
|
|
|
|
case REG_READWRITE: return "R/W";
|
|
|
|
default : return "???";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Externally visible functions. */
|
|
|
|
|
|
|
|
/* Get the name of an extension instruction. */
|
|
|
|
|
|
|
|
const char *
|
|
|
|
arcExtMap_instName (int opcode,
|
|
|
|
int insn,
|
|
|
|
int *flags)
|
|
|
|
{
|
|
|
|
/* Here the following tasks need to be done. First of all, the
|
|
|
|
opcode stored in the Extension Map is the real opcode. However,
|
|
|
|
the subopcode stored in the instruction to be disassembled is
|
|
|
|
mangled. We pass (in minor opcode), the instruction word. Here
|
|
|
|
we will un-mangle it and get the real subopcode which we can look
|
|
|
|
for in the Extension Map. This function is used both for the
|
|
|
|
ARCTangent and the ARCompact, so we would also need some sort of
|
|
|
|
a way to distinguish between the two architectures. This is
|
|
|
|
because the ARCTangent does not do any of this mangling so we
|
|
|
|
have no issues there. */
|
|
|
|
|
|
|
|
/* If P[22:23] is 0 or 2 then un-mangle using iiiiiI. If it is 1
|
|
|
|
then use iiiiIi. Now, if P is 3 then check M[5:5] and if it is 0
|
|
|
|
then un-mangle using iiiiiI else iiiiii. */
|
|
|
|
|
|
|
|
unsigned char minor;
|
|
|
|
struct ExtInstruction *temp;
|
|
|
|
|
|
|
|
/* 16-bit instructions. */
|
|
|
|
if (0x08 <= opcode && opcode <= 0x0b)
|
|
|
|
{
|
|
|
|
unsigned char b, c, i;
|
|
|
|
|
|
|
|
b = (insn & 0x0700) >> 8;
|
|
|
|
c = (insn & 0x00e0) >> 5;
|
|
|
|
i = (insn & 0x001f);
|
|
|
|
|
|
|
|
if (i)
|
|
|
|
minor = i;
|
|
|
|
else
|
|
|
|
minor = (c == 0x07) ? b : c;
|
|
|
|
}
|
|
|
|
/* 32-bit instructions. */
|
|
|
|
else
|
|
|
|
{
|
|
|
|
unsigned char I, A, B;
|
|
|
|
|
|
|
|
I = (insn & 0x003f0000) >> 16;
|
|
|
|
A = (insn & 0x0000003f);
|
|
|
|
B = ((insn & 0x07000000) >> 24) | ((insn & 0x00007000) >> 9);
|
|
|
|
|
|
|
|
if (I != 0x2f)
|
|
|
|
{
|
|
|
|
#ifndef UNMANGLED
|
|
|
|
switch (P)
|
|
|
|
{
|
|
|
|
case 3:
|
|
|
|
if (M)
|
|
|
|
{
|
|
|
|
minor = I;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case 0:
|
|
|
|
case 2:
|
|
|
|
minor = (I >> 1) | ((I & 0x1) << 5);
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
minor = (I >> 1) | (I & 0x1) | ((I & 0x2) << 4);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
minor = I;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (A != 0x3f)
|
|
|
|
minor = A;
|
|
|
|
else
|
|
|
|
minor = B;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
temp = arc_extension_map.instructions[INST_HASH (opcode, minor)];
|
|
|
|
while (temp)
|
|
|
|
{
|
|
|
|
if ((temp->major == opcode) && (temp->minor == minor))
|
|
|
|
{
|
|
|
|
*flags = temp->flags;
|
|
|
|
return temp->name;
|
2001-01-11 22:20:20 +01:00
|
|
|
}
|
2015-10-07 15:20:19 +02:00
|
|
|
temp = temp->next;
|
2001-01-11 22:20:20 +01:00
|
|
|
}
|
2001-08-31 22:05:24 +02:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
return NULL;
|
2001-01-11 22:20:20 +01:00
|
|
|
}
|
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
/* Get the name of an extension core register. */
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
const char *
|
|
|
|
arcExtMap_coreRegName (int regnum)
|
|
|
|
{
|
|
|
|
if (regnum < FIRST_EXTENSION_CORE_REGISTER
|
|
|
|
|| regnum > LAST_EXTENSION_CONDITION_CODE)
|
|
|
|
return NULL;
|
|
|
|
return arc_extension_map.
|
|
|
|
coreRegisters[regnum - FIRST_EXTENSION_CORE_REGISTER].name;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get the access mode of an extension core register. */
|
|
|
|
|
|
|
|
enum ExtReadWrite
|
|
|
|
arcExtMap_coreReadWrite (int regnum)
|
2001-01-11 22:20:20 +01:00
|
|
|
{
|
2015-10-07 15:20:19 +02:00
|
|
|
if (regnum < FIRST_EXTENSION_CORE_REGISTER
|
|
|
|
|| regnum > LAST_EXTENSION_CONDITION_CODE)
|
|
|
|
return REG_INVALID;
|
|
|
|
return arc_extension_map.
|
|
|
|
coreRegisters[regnum - FIRST_EXTENSION_CORE_REGISTER].rw;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get the name of an extension condition code. */
|
|
|
|
|
|
|
|
const char *
|
|
|
|
arcExtMap_condCodeName (int code)
|
|
|
|
{
|
|
|
|
if (code < FIRST_EXTENSION_CONDITION_CODE
|
|
|
|
|| code > LAST_EXTENSION_CONDITION_CODE)
|
|
|
|
return NULL;
|
|
|
|
return arc_extension_map.
|
|
|
|
condCodes[code - FIRST_EXTENSION_CONDITION_CODE];
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get the name of an extension auxiliary register. */
|
|
|
|
|
|
|
|
const char *
|
|
|
|
arcExtMap_auxRegName (long address)
|
|
|
|
{
|
|
|
|
/* Walk the list of auxiliary register names and find the name. */
|
|
|
|
struct ExtAuxRegister *r;
|
|
|
|
|
|
|
|
for (r = arc_extension_map.auxRegisters; r; r = r->next)
|
|
|
|
{
|
|
|
|
if (r->address == address)
|
|
|
|
return (const char *)r->name;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Load extensions described in .arcextmap and
|
|
|
|
.gnu.linkonce.arcextmap.* ELF section. */
|
2001-01-11 22:20:20 +01:00
|
|
|
|
2015-10-07 15:20:19 +02:00
|
|
|
void
|
|
|
|
build_ARC_extmap (bfd *text_bfd)
|
|
|
|
{
|
|
|
|
asection *sect;
|
|
|
|
|
|
|
|
/* The map is built each time gdb loads an executable file - so free
|
|
|
|
any existing map, as the map defined by the new file may differ
|
|
|
|
from the old. */
|
|
|
|
destroy_map ();
|
|
|
|
|
|
|
|
for (sect = text_bfd->sections; sect != NULL; sect = sect->next)
|
|
|
|
if (!strncmp (sect->name,
|
|
|
|
".gnu.linkonce.arcextmap.",
|
|
|
|
sizeof (".gnu.linkonce.arcextmap.") - 1)
|
|
|
|
|| !strcmp (sect->name,".arcextmap"))
|
2001-01-11 22:20:20 +01:00
|
|
|
{
|
2015-10-07 15:20:19 +02:00
|
|
|
bfd_size_type count = bfd_get_section_size (sect);
|
|
|
|
unsigned char* buffer = xmalloc (count);
|
|
|
|
|
|
|
|
if (buffer)
|
|
|
|
{
|
|
|
|
if (bfd_get_section_contents (text_bfd, sect, buffer, 0, count))
|
|
|
|
create_map (buffer, count);
|
|
|
|
free (buffer);
|
|
|
|
}
|
2001-01-11 22:20:20 +01:00
|
|
|
}
|
|
|
|
}
|
2015-10-07 15:20:19 +02:00
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
dump_ARC_extmap (void)
|
|
|
|
{
|
|
|
|
struct ExtAuxRegister *r;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
r = arc_extension_map.auxRegisters;
|
|
|
|
|
|
|
|
while (r)
|
|
|
|
{
|
|
|
|
printf ("AUX : %s %ld\n", r->name, r->address);
|
|
|
|
r = r->next;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < INST_HASH_SIZE; i++)
|
|
|
|
{
|
|
|
|
struct ExtInstruction *insn;
|
|
|
|
|
|
|
|
for (insn = arc_extension_map.instructions[i];
|
|
|
|
insn != NULL; insn = insn->next)
|
|
|
|
printf ("INST: %d %d %x %s\n", insn->major, insn->minor,
|
|
|
|
insn->flags, insn->name);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < NUM_EXT_CORE; i++)
|
|
|
|
{
|
|
|
|
struct ExtCoreRegister reg = arc_extension_map.coreRegisters[i];
|
|
|
|
|
|
|
|
if (reg.name)
|
|
|
|
printf ("CORE: %s %d %s\n", reg.name, reg.number,
|
|
|
|
ExtReadWrite_image (reg.rw));
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < NUM_EXT_COND; i++)
|
|
|
|
if (arc_extension_map.condCodes[i])
|
|
|
|
printf ("COND: %s\n", arc_extension_map.condCodes[i]);
|
|
|
|
}
|