Fri Feb 4 15:53:18 1994 Steve Chamberlain (sac@cygnus.com)
[deliverable/binutils-gdb.git] / gdb / config / sh / tm-sh.h
CommitLineData
9faacb92
SC
1/* Parameters for execution on a Hitachi Super-H machine.
2 Copyright (C) 1993 Free Software Foundation, Inc.
3
4This file is part of GDB.
5
6This program is free software; you can redistribute it and/or modify
7it under the terms of the GNU General Public License as published by
8the Free Software Foundation; either version 2 of the License, or
9(at your option) any later version.
10
11This program is distributed in the hope that it will be useful,
12but WITHOUT ANY WARRANTY; without even the implied warranty of
13MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14GNU General Public License for more details.
15
16You should have received a copy of the GNU General Public License
17along with this program; if not, write to the Free Software
18Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
19
20/* Contributed by Steve Chamberlain sac@cygnus.com */
21
22#define GDB_TARGET_IS_SH
23
24#define IEEE_FLOAT 1
25
26/* Define the bit, byte, and word ordering of the machine. */
27
28#define TARGET_BYTE_ORDER BIG_ENDIAN
29
30
31/* Offset from address of function to start of its code.
32 Zero on most machines. */
33
34#define FUNCTION_START_OFFSET 0
35
36/* Advance PC across any function entry prologue instructions
37 to reach some "real" code. */
38
39extern CORE_ADDR sh_skip_prologue ();
40#define SKIP_PROLOGUE(ip) \
41 {(ip) = sh_skip_prologue(ip);}
42
43
44/* Immediately after a function call, return the saved pc.
45 Can't always go through the frames for this because on some machines
46 the new frame is not set up until the new function executes
47 some instructions.
48
49 The return address is the value saved in the PR register + 4 */
50
51#define SAVED_PC_AFTER_CALL(frame) \
52 (ADDR_BITS_REMOVE(read_register(PR_REGNUM))+4)
53
54/* Stack grows downward. */
55
56#define INNER_THAN <
57
58/* Illegal instruction - used by the simulator for breakpoint
59 detection */
60
61#define BREAKPOINT {0xc3, 0xff} /* 0xc3ff is trapa #ff */
62
63
64/* If your kernel resets the pc after the trap happens you may need to
65 define this before including this file. */
2f5e1736 66#define DECR_PC_AFTER_BREAK 2
9faacb92
SC
67
68/* Nonzero if instruction at PC is a return instruction. */
69#define ABOUT_TO_RETURN(pc) (read_memory_integer(pc,2) == 0x000b)
70
71/* Return 1 if P points to an invalid floating point value. */
72
73#define INVALID_FLOAT(p, len) 0 /* Just a first guess; not checked */
74
f4f0d174
JK
75/* Say how long (ordinary) registers are. This is a piece of bogosity
76 used in push_word and a few other places; REGISTER_RAW_SIZE is the
77 real way to know how big a register is. */
78
79#define REGISTER_SIZE 4
9faacb92
SC
80
81/* Say how much memory is needed to store a copy of the register set */
82#define REGISTER_BYTES (NUM_REGS*4)
83
84/* Index within `registers' of the first byte of the space for
85 register N. */
86
87#define REGISTER_BYTE(N) ((N)*4)
88
89/* Number of bytes of storage in the actual machine representation
90 for register N. */
91
92#define REGISTER_RAW_SIZE(N) 4
93
94#define REGISTER_VIRTUAL_SIZE(N) 4
95
96/* Largest value REGISTER_RAW_SIZE can have. */
97
98#define MAX_REGISTER_RAW_SIZE 4
99
100/* Largest value REGISTER_VIRTUAL_SIZE can have. */
101
102#define MAX_REGISTER_VIRTUAL_SIZE 4
103
9faacb92
SC
104/* Return the GDB type object for the "standard" data type
105 of data in register N. */
106
107#define REGISTER_VIRTUAL_TYPE(N) builtin_type_int
108
109/* Initializer for an array of names of registers.
110 Entries beyond the first NUM_REGS are ignored. */
111
112#define REGISTER_NAMES \
113 {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", \
114 "r8", "r9", "r10","r11","r12","r13","r14","r15",\
7ccb1e44 115 "pc", "pr","gbr","vbr","mach","macl","sr","ticks","stalls","cycles","insts" ,"plr","tlr" }
9faacb92 116
7ccb1e44 117#define NUM_REGS 28
9faacb92
SC
118
119/* Register numbers of various important registers.
120 Note that some of these values are "real" register numbers,
121 and correspond to the general registers of the machine,
122 and some are "phony" register numbers which are too large
123 to be actual register numbers as far as the user is concerned
124 but do serve to get the desired values when passed to read_register. */
125
126#define FP_REGNUM 14
127#define SP_REGNUM 15
128#define PC_REGNUM 16
129#define PR_REGNUM 17
130#define GBR_REGNUM 18
131#define VBR_REGNUM 19
132#define MACH_REGNUM 20
133#define MACL_REGNUM 21
2f5e1736
SC
134#define SR_REGNUM 22
135#define NUM_REALREGS 23
9faacb92
SC
136/* Store the address of the place in which to copy the structure the
137 subroutine will return. This is called from call_function.
138
139 We store structs through a pointer passed in R4 */
140
141#define STORE_STRUCT_RETURN(ADDR, SP) \
142 { write_register (4, (ADDR)); }
143
144/* Extract from an array REGBUF containing the (raw) register state
145 a function return value of type TYPE, and copy that, in virtual format,
146 into VALBUF. */
147
148#define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
ade40d31 149 memcpy (VALBUF, (char *)(REGBUF), TYPE_LENGTH(TYPE))
9faacb92
SC
150
151
152/* Write into appropriate registers a function return value
153 of type TYPE, given in virtual format.
154
155 Things always get returned in R4/R5 */
156
157#define STORE_RETURN_VALUE(TYPE,VALBUF) \
158 write_register_bytes (REGISTER_BYTE(4), VALBUF, TYPE_LENGTH (TYPE))
159
160
161/* Extract from an array REGBUF containing the (raw) register state
162 the address in which a function should return its structure value,
163 as a CORE_ADDR (or an expression that can be used as one). */
164
165#define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(CORE_ADDR *)(REGBUF))
166\f
167
168/* Define other aspects of the stack frame.
169 we keep a copy of the worked out return pc lying around, since it
170 is a useful bit of info */
171
172#define EXTRA_FRAME_INFO \
173 CORE_ADDR return_pc;
174
175#define INIT_EXTRA_FRAME_INFO(fromleaf, fi) \
176 init_extra_frame_info(fromleaf, fi)
177
178/* A macro that tells us whether the function invocation represented
179 by FI does not have a frame on the stack associated with it. If it
180 does not, FRAMELESS is set to 1, else 0. */
181
182#define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \
183 (FRAMELESS) = frameless_look_for_prologue(FI)
184
9faacb92
SC
185#define FRAME_CHAIN(FRAME) sh_frame_chain(FRAME)
186#define FRAME_SAVED_PC(FRAME) ((FRAME)->return_pc)
187#define FRAME_ARGS_ADDRESS(fi) (fi)->frame
188#define FRAME_LOCALS_ADDRESS(fi) (fi)->frame
189
190/* Set VAL to the number of args passed to frame described by FI.
191 Can set VAL to -1, meaning no way to tell. */
192
193/* We can't tell how many args there are */
194
195#define FRAME_NUM_ARGS(val,fi) (val = -1)
196
197/* Return number of bytes at start of arglist that are not really args. */
198
199#define FRAME_ARGS_SKIP 0
200
201/* Put here the code to store, into a struct frame_saved_regs,
202 the addresses of the saved registers of frame described by FRAME_INFO.
203 This includes special registers such as pc and fp saved in special
204 ways in the stack frame. sp is even more special:
205 the address we return for it IS the sp for the next frame. */
206
207#define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \
208 frame_find_saved_regs(frame_info, &(frame_saved_regs))
209
210#define NAMES_HAVE_UNDERSCORE
211
212typedef unsigned short INSN_WORD;
213
2f5e1736 214#define ADDR_BITS_REMOVE(addr) ((addr))
9faacb92
SC
215
216#define CALL_DUMMY_LENGTH 10
217
218/* Discard from the stack the innermost frame,
219 restoring all saved registers. */
220
221#define POP_FRAME pop_frame();
222
2f5e1736 223
b4d3d0e5 224#define NOP {0x20, 0x0b}
This page took 0.086497 seconds and 4 git commands to generate.