3 changed files with 235 additions and 0 deletions
@ -0,0 +1,220 @@ |
|||
/* Parameters for execution on a WDC 65816 machine.
|
|||
Copyright (C) 1995 Free Software Foundation, Inc. |
|||
|
|||
This file is part of GDB. |
|||
|
|||
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 of the License, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ |
|||
|
|||
/* Contributed by Steve Chamberlain sac@cygnus.com */ |
|||
|
|||
#define GDB_TARGET_IS_W65 |
|||
|
|||
#define IEEE_FLOAT 1 |
|||
|
|||
/* Define the bit, byte, and word ordering of the machine. */ |
|||
|
|||
#define TARGET_BYTE_ORDER LITTLE_ENDIAN |
|||
|
|||
|
|||
/* Offset from address of function to start of its code.
|
|||
Zero on most machines. */ |
|||
|
|||
#define FUNCTION_START_OFFSET 0 |
|||
|
|||
/* Advance PC across any function entry prologue instructions
|
|||
to reach some "real" code. */ |
|||
|
|||
extern CORE_ADDR w65_skip_prologue (); |
|||
|
|||
#define SKIP_PROLOGUE(ip) \ |
|||
{(ip) = w65_skip_prologue(ip);} |
|||
|
|||
|
|||
/* Immediately after a function call, return the saved pc.
|
|||
Can't always go through the frames for this because on some machines |
|||
the new frame is not set up until the new function executes |
|||
some instructions. |
|||
|
|||
The return address is the value saved in the PR register + 4 */ |
|||
|
|||
#define SAVED_PC_AFTER_CALL(frame) \ |
|||
saved_pc_after_call(frame) |
|||
|
|||
|
|||
/* Stack grows downward. */ |
|||
|
|||
#define INNER_THAN < |
|||
|
|||
/* Illegal instruction - used by the simulator for breakpoint
|
|||
detection */ |
|||
|
|||
#define BREAKPOINT {0xcb} /* WAI */ |
|||
|
|||
/* If your kernel resets the pc after the trap happens you may need to
|
|||
define this before including this file. */ |
|||
#define DECR_PC_AFTER_BREAK 0 |
|||
|
|||
/* Nonzero if instruction at PC is a return instruction. */ |
|||
|
|||
#define ABOUT_TO_RETURN(pc) \ |
|||
(read_memory_integer(pc,1) == RTL || read_memory_integer(pc,1) == RTS) |
|||
|
|||
#define RTL 0x6b |
|||
#define RTS 0x60 |
|||
|
|||
/* Return 1 if P points to an invalid floating point value. */ |
|||
|
|||
#define INVALID_FLOAT(p, len) 0 /* Just a first guess; not checked */ |
|||
|
|||
/* Say how long registers are. */ |
|||
/*#define REGISTER_TYPE int*/ |
|||
|
|||
/* Say how much memory is needed to store a copy of the register set */ |
|||
#define REGISTER_BYTES (NUM_REGS*4) |
|||
|
|||
/* Index within `registers' of the first byte of the space for
|
|||
register N. */ |
|||
|
|||
#define REGISTER_BYTE(N) ((N)*4) |
|||
|
|||
/* Number of bytes of storage in the actual machine representation
|
|||
for register N. */ |
|||
|
|||
#define REGISTER_RAW_SIZE(N) (((N) < 16) ? 2 : 4) |
|||
|
|||
#define REGISTER_VIRTUAL_SIZE(N) REGISTER_RAW_SIZE(N) |
|||
|
|||
/* Largest value REGISTER_RAW_SIZE can have. */ |
|||
|
|||
#define MAX_REGISTER_RAW_SIZE 4 |
|||
|
|||
/* Largest value REGISTER_VIRTUAL_SIZE can have. */ |
|||
|
|||
#define MAX_REGISTER_VIRTUAL_SIZE 4 |
|||
|
|||
/* Return the GDB type object for the "standard" data type
|
|||
of data in register N. */ |
|||
|
|||
#define REGISTER_VIRTUAL_TYPE(N) \ |
|||
(REGISTER_VIRTUAL_SIZE(N) == 2 ? builtin_type_unsigned_short : builtin_type_unsigned_long) |
|||
|
|||
/* Initializer for an array of names of registers.
|
|||
Entries beyond the first NUM_REGS are ignored. */ |
|||
|
|||
#define REGISTER_NAMES \ |
|||
{"r0","r1","r2", "r3", "r4", "r5", "r6", "r7", \ |
|||
"r8","r9","r10","r11","r12","r13","r14","r15", \ |
|||
"pc","a", "x", "y", "dbr","d", "s", "p", \ |
|||
"ticks","cycles","insts"} |
|||
|
|||
/* Register numbers of various important registers.
|
|||
Note that some of these values are "real" register numbers, |
|||
and correspond to the general registers of the machine, |
|||
and some are "phony" register numbers which are too large |
|||
to be actual register numbers as far as the user is concerned |
|||
but do serve to get the desired values when passed to read_register. */ |
|||
|
|||
#define SP_REGNUM 22 |
|||
#define FP_REGNUM 15 |
|||
#define NUM_REGS 27 |
|||
#define PC_REGNUM 16 |
|||
#define P_REGNUM 23 |
|||
|
|||
/* Store the address of the place in which to copy the structure the
|
|||
subroutine will return. This is called from call_function. |
|||
|
|||
We store structs through a pointer passed in R4 */ |
|||
|
|||
#define STORE_STRUCT_RETURN(ADDR, SP) \ |
|||
{ write_register (4, (ADDR)); } |
|||
|
|||
/* Extract from an array REGBUF containing the (raw) register state
|
|||
a function return value of type TYPE, and copy that, in virtual format, |
|||
into VALBUF. */ |
|||
|
|||
#define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \ |
|||
memcpy (VALBUF, (char *)(REGBUF), TYPE_LENGTH(TYPE)) |
|||
|
|||
|
|||
/* Write into appropriate registers a function return value
|
|||
of type TYPE, given in virtual format. |
|||
|
|||
Things always get returned in R4/R5 */ |
|||
|
|||
#define STORE_RETURN_VALUE(TYPE,VALBUF) \ |
|||
write_register_bytes (REGISTER_BYTE(4), VALBUF, TYPE_LENGTH (TYPE)) |
|||
|
|||
|
|||
/* Extract from an array REGBUF containing the (raw) register state
|
|||
the address in which a function should return its structure value, |
|||
as a CORE_ADDR (or an expression that can be used as one). */ |
|||
|
|||
#define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(CORE_ADDR *)(REGBUF)) |
|||
|
|||
/* A macro that tells us whether the function invocation represented
|
|||
by FI does not have a frame on the stack associated with it. If it |
|||
does not, FRAMELESS is set to 1, else 0. */ |
|||
|
|||
#define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \ |
|||
(FRAMELESS) = frameless_look_for_prologue(FI) |
|||
|
|||
#define FRAME_CHAIN(FRAME) w65_frame_chain(FRAME) |
|||
#define FRAME_SAVED_PC(FRAME) (w65_frame_saved_pc(FRAME)) |
|||
#define FRAME_ARGS_ADDRESS(fi) (fi)->frame |
|||
#define FRAME_LOCALS_ADDRESS(fi) (fi)->frame |
|||
|
|||
/* Set VAL to the number of args passed to frame described by FI.
|
|||
Can set VAL to -1, meaning no way to tell. */ |
|||
|
|||
/* We can't tell how many args there are */ |
|||
|
|||
#define FRAME_NUM_ARGS(val,fi) (val = -1) |
|||
|
|||
/* Return number of bytes at start of arglist that are not really args. */ |
|||
|
|||
#define FRAME_ARGS_SKIP 0 |
|||
|
|||
/* Put here the code to store, into a struct frame_saved_regs,
|
|||
the addresses of the saved registers of frame described by FRAME_INFO. |
|||
This includes special registers such as pc and fp saved in special |
|||
ways in the stack frame. sp is even more special: |
|||
the address we return for it IS the sp for the next frame. */ |
|||
|
|||
#define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \ |
|||
frame_find_saved_regs(frame_info, &(frame_saved_regs)) |
|||
|
|||
#define NAMES_HAVE_UNDERSCORE |
|||
|
|||
typedef unsigned short INSN_WORD; |
|||
|
|||
#define ADDR_BITS_REMOVE(addr) ((addr) & 0xffffff) |
|||
|
|||
#define CALL_DUMMY_LENGTH 10 |
|||
|
|||
/* Discard from the stack the innermost frame,
|
|||
restoring all saved registers. */ |
|||
|
|||
#define POP_FRAME pop_frame(); |
|||
|
|||
|
|||
#define NOP {0xea} |
|||
|
|||
#define REGISTER_SIZE 4 |
|||
|
|||
#define PRINT_REGISTER_HOOK(regno) print_register_hook(regno) |
|||
|
|||
#define TARGET_INT_BIT 16 |
|||
#define TARGET_LONG_BIT 32 |
|||
#define TARGET_PTR_BIT 32 |
|||
@ -0,0 +1,11 @@ |
|||
# Target: WDC 65816 simulator |
|||
TDEPFILES= w65-tdep.o remote-sim.o libsim.a |
|||
|
|||
other:all |
|||
|
|||
libsim.a: |
|||
cp ../sim/w65/libsim.a . |
|||
ranlib libsim.a |
|||
|
|||
|
|||
TM_FILE= tm-w65.h |
|||
Loading…
Reference in new issue