5f248b19ff49efba64ee7d56413ab385a033caab
[deliverable/binutils-gdb.git] / gdb / config / d10v / tm-d10v.h
1 /* Target-specific definition for the Mitsubishi D10V
2 Copyright (C) 1996 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
19
20 /* Contributed by Martin Hunt, hunt@cygnus.com */
21
22 #define GDB_TARGET_IS_D10V
23
24 /* Define the bit, byte, and word ordering of the machine. */
25
26 #define TARGET_BYTE_ORDER BIG_ENDIAN
27
28 /* Offset from address of function to start of its code.
29 Zero on most machines. */
30
31 #define FUNCTION_START_OFFSET 0
32
33 /* these are the addresses the D10V-EVA board maps data */
34 /* and instruction memory to. */
35
36 #define DMEM_START 0x2000000
37 #define IMEM_START 0x1000000
38 #define STACK_START 0x2007ffe
39
40 #ifdef __STDC__ /* Forward decls for prototypes */
41 struct frame_info;
42 struct frame_saved_regs;
43 struct type;
44 struct value;
45 #endif
46
47 /* Advance PC across any function entry prologue instructions
48 to reach some "real" code. */
49
50 extern CORE_ADDR d10v_skip_prologue ();
51 #define SKIP_PROLOGUE(ip) \
52 {(ip) = d10v_skip_prologue(ip);}
53
54
55 /* Stack grows downward. */
56 #define INNER_THAN <
57
58 /* for a breakpoint, use "dbt || nop" */
59 #define BREAKPOINT {0x2f, 0x90, 0x5e, 0x00}
60
61 /* If your kernel resets the pc after the trap happens you may need to
62 define this before including this file. */
63 #define DECR_PC_AFTER_BREAK 4
64
65 #define REGISTER_NAMES \
66 { "r0", "r1", "r2", "r3", "r4", "r5", "r6", "r7", \
67 "r8", "r9", "r10","r11","r12", "r13", "r14","sp",\
68 "psw","bpsw","pc","bpc", "cr4", "cr5", "cr6", "rpt_c",\
69 "rpt_s","rpt_e", "mod_s", "mod_e", "cr12", "cr13", "iba", "cr15",\
70 "imap0","imap1","dmap","a0", "a1"\
71 }
72
73 #define NUM_REGS 37
74
75 /* Register numbers of various important registers.
76 Note that some of these values are "real" register numbers,
77 and correspond to the general registers of the machine,
78 and some are "phony" register numbers which are too large
79 to be actual register numbers as far as the user is concerned
80 but do serve to get the desired values when passed to read_register. */
81
82 #define R0_REGNUM 0
83 #define LR_REGNUM 13
84 #define SP_REGNUM 15
85 #define FP_REGNUM 11
86 #define PC_REGNUM 18
87 #define PSW_REGNUM 16
88 #define IMAP0_REGNUM 32
89 #define IMAP1_REGNUM 33
90 #define DMAP_REGNUM 34
91 #define A0_REGNUM 35
92
93 /* Say how much memory is needed to store a copy of the register set */
94 #define REGISTER_BYTES ((NUM_REGS-2)*2+16)
95
96 /* Index within `registers' of the first byte of the space for
97 register N. */
98
99 #define REGISTER_BYTE(N) \
100 ( ((N) > A0_REGNUM) ? ( ((N)-A0_REGNUM)*8 + A0_REGNUM*2 ) : ((N) * 2) )
101
102 /* Number of bytes of storage in the actual machine representation
103 for register N. */
104
105 #define REGISTER_RAW_SIZE(N) ( ((N) >= A0_REGNUM) ? 8 : 2 )
106
107 /* Number of bytes of storage in the program's representation
108 for register N. */
109 #define REGISTER_VIRTUAL_SIZE(N) ( ((N) >= A0_REGNUM) ? 8 : ( ((N) == PC_REGNUM || (N) == SP_REGNUM) ? 4 : 2 ))
110
111 /* Largest value REGISTER_RAW_SIZE can have. */
112
113 #define MAX_REGISTER_RAW_SIZE 8
114
115 /* Largest value REGISTER_VIRTUAL_SIZE can have. */
116
117 #define MAX_REGISTER_VIRTUAL_SIZE 8
118
119 /* Return the GDB type object for the "standard" data type
120 of data in register N. */
121
122 #define REGISTER_VIRTUAL_TYPE(N) \
123 ( ((N) < A0_REGNUM ) ? ((N) == PC_REGNUM || (N) == SP_REGNUM ? builtin_type_long : builtin_type_short) : builtin_type_long_long)
124
125
126 /* convert $pc and $sp to/from virtual addresses */
127 #define REGISTER_CONVERTIBLE(N) ((N) == PC_REGNUM || (N) == SP_REGNUM)
128 #define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,TYPE,FROM,TO) \
129 { \
130 ULONGEST x = extract_unsigned_integer ((FROM), REGISTER_RAW_SIZE (REGNUM)); \
131 if (REGNUM == PC_REGNUM) x = (x << 2) | IMEM_START; \
132 else x |= DMEM_START; \
133 store_unsigned_integer ((TO), TYPE_LENGTH(TYPE), x); \
134 }
135 #define REGISTER_CONVERT_TO_RAW(TYPE,REGNUM,FROM,TO) \
136 { \
137 ULONGEST x = extract_unsigned_integer ((FROM), TYPE_LENGTH(TYPE)); \
138 x &= 0x3ffff; \
139 if (REGNUM == PC_REGNUM) x >>= 2; \
140 store_unsigned_integer ((TO), 2, x); \
141 }
142
143 #define D10V_MAKE_DADDR(x) ( (x) & 0x3000000 ? (x) : ((x) | DMEM_START))
144 #define D10V_MAKE_IADDR(x) ( (x) & 0x3000000 ? (x) : (((x) << 2) | IMEM_START))
145
146 /* Store the address of the place in which to copy the structure the
147 subroutine will return. This is called from call_function.
148
149 We store structs through a pointer passed in R2 */
150
151 #define STORE_STRUCT_RETURN(ADDR, SP) \
152 { write_register (2, (ADDR)); }
153
154
155 /* Write into appropriate registers a function return value
156 of type TYPE, given in virtual format.
157
158 Things always get returned in R2/R3 */
159
160 #define STORE_RETURN_VALUE(TYPE,VALBUF) \
161 write_register_bytes (REGISTER_BYTE(2), VALBUF, TYPE_LENGTH (TYPE))
162
163
164 /* Extract from an array REGBUF containing the (raw) register state
165 the address in which a function should return its structure value,
166 as a CORE_ADDR (or an expression that can be used as one). */
167
168 #define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(CORE_ADDR *)(REGBUF))
169 \f
170
171 /* Define other aspects of the stack frame.
172 we keep a copy of the worked out return pc lying around, since it
173 is a useful bit of info */
174
175 #define EXTRA_FRAME_INFO \
176 CORE_ADDR return_pc; \
177 CORE_ADDR dummy; \
178 int frameless; \
179 int size;
180
181 #define INIT_EXTRA_FRAME_INFO(fromleaf, fi) \
182 d10v_init_extra_frame_info(fromleaf, fi)
183
184 extern void d10v_init_extra_frame_info PARAMS (( int fromleaf, struct frame_info *fi ));
185
186 /* A macro that tells us whether the function invocation represented
187 by FI does not have a frame on the stack associated with it. If it
188 does not, FRAMELESS is set to 1, else 0. */
189
190 #define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \
191 (FRAMELESS) = frameless_look_for_prologue(FI)
192
193 #define FRAME_CHAIN(FRAME) d10v_frame_chain(FRAME)
194 #define FRAME_CHAIN_VALID(chain,frame) \
195 ((chain) != 0 && (frame) != 0 && (frame)->pc > IMEM_START)
196 #define FRAME_SAVED_PC(FRAME) ((FRAME)->return_pc)
197 #define FRAME_ARGS_ADDRESS(fi) (fi)->frame
198 #define FRAME_LOCALS_ADDRESS(fi) (fi)->frame
199
200 /* Immediately after a function call, return the saved pc. We can't */
201 /* use frame->return_pc beause that is determined by reading R13 off the */
202 /*stack and that may not be written yet. */
203
204 #define SAVED_PC_AFTER_CALL(frame) ((read_register(LR_REGNUM) << 2) | IMEM_START)
205
206 /* Set VAL to the number of args passed to frame described by FI.
207 Can set VAL to -1, meaning no way to tell. */
208 /* We can't tell how many args there are */
209
210 #define FRAME_NUM_ARGS(val,fi) (val = -1)
211
212 /* Return number of bytes at start of arglist that are not really args. */
213
214 #define FRAME_ARGS_SKIP 0
215
216
217 /* Put here the code to store, into a struct frame_saved_regs,
218 the addresses of the saved registers of frame described by FRAME_INFO.
219 This includes special registers such as pc and fp saved in special
220 ways in the stack frame. sp is even more special:
221 the address we return for it IS the sp for the next frame. */
222
223 #define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \
224 d10v_frame_find_saved_regs(frame_info, &(frame_saved_regs))
225
226 extern void d10v_frame_find_saved_regs PARAMS ((struct frame_info *, struct frame_saved_regs *));
227
228 #define NAMES_HAVE_UNDERSCORE
229
230 /*
231 DUMMY FRAMES. Need these to support inferior function calls. They work
232 like this on D10V: First we set a breakpoint at 0 or __start. Then we push
233 all the registers onto the stack. Then put the function arguments in the proper
234 registers and set r13 to our breakpoint address. Finally call the function directly.
235 When it hits the breakpoint, clear the break point and pop the old register contents
236 off the stack.
237 */
238
239 #define CALL_DUMMY { }
240 #define PUSH_DUMMY_FRAME
241 #define CALL_DUMMY_START_OFFSET 0
242 #define CALL_DUMMY_LOCATION AT_ENTRY_POINT
243 #define CALL_DUMMY_BREAKPOINT_OFFSET (0)
244
245 extern CORE_ADDR d10v_call_dummy_address PARAMS ((void));
246 #define CALL_DUMMY_ADDRESS() d10v_call_dummy_address()
247
248 #define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, args, type, gcc_p) \
249 sp = d10v_fix_call_dummy (dummyname, pc, fun, nargs, args, type, gcc_p)
250
251 #define PC_IN_CALL_DUMMY(pc, sp, frame_address) ( pc == IMEM_START + 4 )
252
253 extern CORE_ADDR d10v_fix_call_dummy PARAMS ((char *, CORE_ADDR, CORE_ADDR,
254 int, struct value **,
255 struct type *, int));
256 #define PUSH_ARGUMENTS(nargs, args, sp, struct_return, struct_addr) \
257 sp = d10v_push_arguments((nargs), (args), (sp), (struct_return), (struct_addr))
258 extern CORE_ADDR d10v_push_arguments PARAMS ((int, struct value **, CORE_ADDR, int, CORE_ADDR));
259
260
261 /* Extract from an array REGBUF containing the (raw) register state
262 a function return value of type TYPE, and copy that, in virtual format,
263 into VALBUF. */
264
265 #define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
266 d10v_extract_return_value(TYPE, REGBUF, VALBUF)
267 extern void
268 d10v_extract_return_value PARAMS ((struct type *, char *, char *));
269
270
271 /* Discard from the stack the innermost frame,
272 restoring all saved registers. */
273 #define POP_FRAME d10v_pop_frame();
274 extern void d10v_pop_frame PARAMS((void));
275
276 #define REGISTER_SIZE 2
277
278 #ifdef CC_HAS_LONG_LONG
279 # define LONGEST long long
280 #else
281 # define LONGEST long
282 #endif
283 #define ULONGEST unsigned LONGEST
284
285 void d10v_write_pc PARAMS ((CORE_ADDR val, int pid));
286 CORE_ADDR d10v_read_pc PARAMS ((int pid));
287 void d10v_write_sp PARAMS ((CORE_ADDR val));
288 CORE_ADDR d10v_read_sp PARAMS ((void));
289
290 #define TARGET_READ_PC(pid) d10v_read_pc (pid)
291 #define TARGET_WRITE_PC(val,pid) d10v_write_pc (val, pid)
292 #define TARGET_READ_FP() d10v_read_sp ()
293 #define TARGET_WRITE_FP(val) d10v_write_sp (val)
294 #define TARGET_READ_SP() d10v_read_sp ()
295 #define TARGET_WRITE_SP(val) d10v_write_sp (val)
296
297 /* Number of bits in the appropriate type */
298 #define TARGET_INT_BIT (2 * TARGET_CHAR_BIT)
299 #define TARGET_PTR_BIT (4 * TARGET_CHAR_BIT)
300 #define TARGET_DOUBLE_BIT (4 * TARGET_CHAR_BIT)
301 #define TARGET_LONG_DOUBLE_BIT (8 * TARGET_CHAR_BIT)
This page took 0.035824 seconds and 4 git commands to generate.