Commit | Line | Data |
---|---|---|
9faacb92 SC |
1 | /* Parameters for execution on a Hitachi Super-H machine. |
2 | Copyright (C) 1993 Free Software Foundation, Inc. | |
3 | ||
4 | This file is part of GDB. | |
5 | ||
6 | This program is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2 of the License, or | |
9 | (at your option) any later version. | |
10 | ||
11 | This program is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with this program; if not, write to the Free Software | |
18 | Foundation, 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 | ||
39 | extern 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 | ||
75 | /* Say how long registers are. */ | |
76 | #define REGISTER_TYPE long | |
77 | ||
78 | /* Say how much memory is needed to store a copy of the register set */ | |
79 | #define REGISTER_BYTES (NUM_REGS*4) | |
80 | ||
81 | /* Index within `registers' of the first byte of the space for | |
82 | register N. */ | |
83 | ||
84 | #define REGISTER_BYTE(N) ((N)*4) | |
85 | ||
86 | /* Number of bytes of storage in the actual machine representation | |
87 | for register N. */ | |
88 | ||
89 | #define REGISTER_RAW_SIZE(N) 4 | |
90 | ||
91 | #define REGISTER_VIRTUAL_SIZE(N) 4 | |
92 | ||
93 | /* Largest value REGISTER_RAW_SIZE can have. */ | |
94 | ||
95 | #define MAX_REGISTER_RAW_SIZE 4 | |
96 | ||
97 | /* Largest value REGISTER_VIRTUAL_SIZE can have. */ | |
98 | ||
99 | #define MAX_REGISTER_VIRTUAL_SIZE 4 | |
100 | ||
9faacb92 SC |
101 | /* Return the GDB type object for the "standard" data type |
102 | of data in register N. */ | |
103 | ||
104 | #define REGISTER_VIRTUAL_TYPE(N) builtin_type_int | |
105 | ||
106 | /* Initializer for an array of names of registers. | |
107 | Entries beyond the first NUM_REGS are ignored. */ | |
108 | ||
109 | #define REGISTER_NAMES \ | |
110 | {"r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", \ | |
111 | "r8", "r9", "r10","r11","r12","r13","r14","r15",\ | |
7ccb1e44 | 112 | "pc", "pr","gbr","vbr","mach","macl","sr","ticks","stalls","cycles","insts" ,"plr","tlr" } |
9faacb92 | 113 | |
7ccb1e44 | 114 | #define NUM_REGS 28 |
9faacb92 SC |
115 | |
116 | /* Register numbers of various important registers. | |
117 | Note that some of these values are "real" register numbers, | |
118 | and correspond to the general registers of the machine, | |
119 | and some are "phony" register numbers which are too large | |
120 | to be actual register numbers as far as the user is concerned | |
121 | but do serve to get the desired values when passed to read_register. */ | |
122 | ||
123 | #define FP_REGNUM 14 | |
124 | #define SP_REGNUM 15 | |
125 | #define PC_REGNUM 16 | |
126 | #define PR_REGNUM 17 | |
127 | #define GBR_REGNUM 18 | |
128 | #define VBR_REGNUM 19 | |
129 | #define MACH_REGNUM 20 | |
130 | #define MACL_REGNUM 21 | |
2f5e1736 SC |
131 | #define SR_REGNUM 22 |
132 | #define NUM_REALREGS 23 | |
9faacb92 SC |
133 | /* Store the address of the place in which to copy the structure the |
134 | subroutine will return. This is called from call_function. | |
135 | ||
136 | We store structs through a pointer passed in R4 */ | |
137 | ||
138 | #define STORE_STRUCT_RETURN(ADDR, SP) \ | |
139 | { write_register (4, (ADDR)); } | |
140 | ||
141 | /* Extract from an array REGBUF containing the (raw) register state | |
142 | a function return value of type TYPE, and copy that, in virtual format, | |
143 | into VALBUF. */ | |
144 | ||
145 | #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \ | |
ade40d31 | 146 | memcpy (VALBUF, (char *)(REGBUF), TYPE_LENGTH(TYPE)) |
9faacb92 SC |
147 | |
148 | ||
149 | /* Write into appropriate registers a function return value | |
150 | of type TYPE, given in virtual format. | |
151 | ||
152 | Things always get returned in R4/R5 */ | |
153 | ||
154 | #define STORE_RETURN_VALUE(TYPE,VALBUF) \ | |
155 | write_register_bytes (REGISTER_BYTE(4), VALBUF, TYPE_LENGTH (TYPE)) | |
156 | ||
157 | ||
158 | /* Extract from an array REGBUF containing the (raw) register state | |
159 | the address in which a function should return its structure value, | |
160 | as a CORE_ADDR (or an expression that can be used as one). */ | |
161 | ||
162 | #define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(CORE_ADDR *)(REGBUF)) | |
163 | \f | |
164 | ||
165 | /* Define other aspects of the stack frame. | |
166 | we keep a copy of the worked out return pc lying around, since it | |
167 | is a useful bit of info */ | |
168 | ||
169 | #define EXTRA_FRAME_INFO \ | |
170 | CORE_ADDR return_pc; | |
171 | ||
172 | #define INIT_EXTRA_FRAME_INFO(fromleaf, fi) \ | |
173 | init_extra_frame_info(fromleaf, fi) | |
174 | ||
175 | /* A macro that tells us whether the function invocation represented | |
176 | by FI does not have a frame on the stack associated with it. If it | |
177 | does not, FRAMELESS is set to 1, else 0. */ | |
178 | ||
179 | #define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \ | |
180 | (FRAMELESS) = frameless_look_for_prologue(FI) | |
181 | ||
9faacb92 SC |
182 | #define FRAME_CHAIN(FRAME) sh_frame_chain(FRAME) |
183 | #define FRAME_SAVED_PC(FRAME) ((FRAME)->return_pc) | |
184 | #define FRAME_ARGS_ADDRESS(fi) (fi)->frame | |
185 | #define FRAME_LOCALS_ADDRESS(fi) (fi)->frame | |
186 | ||
187 | /* Set VAL to the number of args passed to frame described by FI. | |
188 | Can set VAL to -1, meaning no way to tell. */ | |
189 | ||
190 | /* We can't tell how many args there are */ | |
191 | ||
192 | #define FRAME_NUM_ARGS(val,fi) (val = -1) | |
193 | ||
194 | /* Return number of bytes at start of arglist that are not really args. */ | |
195 | ||
196 | #define FRAME_ARGS_SKIP 0 | |
197 | ||
198 | /* Put here the code to store, into a struct frame_saved_regs, | |
199 | the addresses of the saved registers of frame described by FRAME_INFO. | |
200 | This includes special registers such as pc and fp saved in special | |
201 | ways in the stack frame. sp is even more special: | |
202 | the address we return for it IS the sp for the next frame. */ | |
203 | ||
204 | #define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \ | |
205 | frame_find_saved_regs(frame_info, &(frame_saved_regs)) | |
206 | ||
207 | #define NAMES_HAVE_UNDERSCORE | |
208 | ||
209 | typedef unsigned short INSN_WORD; | |
210 | ||
2f5e1736 | 211 | #define ADDR_BITS_REMOVE(addr) ((addr)) |
9faacb92 SC |
212 | |
213 | #define CALL_DUMMY_LENGTH 10 | |
214 | ||
215 | /* Discard from the stack the innermost frame, | |
216 | restoring all saved registers. */ | |
217 | ||
218 | #define POP_FRAME pop_frame(); | |
219 | ||
2f5e1736 | 220 | |
b4d3d0e5 | 221 | #define NOP {0x20, 0x0b} |