projects / deliverable / binutils-gdb.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Add sparclite support.
[deliverable/binutils-gdb.git] / gdb / tm-29k.h
CommitLineData
dd3b648e
RP		 1/* Parameters for target machine of AMD 29000, for GDB, the GNU debugger.
2 Copyright 1990, 1991 Free Software Foundation, Inc.
3 Contributed by Cygnus Support. Written by Jim Kingdon.
4
5This file is part of GDB.
6
99a7de40 7This program is free software; you can redistribute it and/or modify
dd3b648e 8it under the terms of the GNU General Public License as published by
99a7de40
JG		 9the Free Software Foundation; either version 2 of the License, or
10(at your option) any later version.
dd3b648e 11
99a7de40 12This program is distributed in the hope that it will be useful,
dd3b648e
RP		 13but WITHOUT ANY WARRANTY; without even the implied warranty of
14MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15GNU General Public License for more details.
16
17You should have received a copy of the GNU General Public License
99a7de40
JG		 18along with this program; if not, write to the Free Software
19Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
dd3b648e
RP		 20
21/* Parameters for an EB29K (a board which plugs into a PC and is
22 accessed through EBMON software running on the PC, which we
23 use as we'd use a remote stub (see remote-eb.c).
24
25 If gdb is ported to other 29k machines/systems, the
26 machine/system-specific parts should be removed from this file (a
27 la tm-68k.h). */
28
29/* Byte order is configurable, but this machine runs big-endian. */
30#define TARGET_BYTE_ORDER BIG_ENDIAN
31
32/* Floating point uses IEEE representations. */
33#define IEEE_FLOAT
34
dd3b648e 35/* Recognize our magic number. */
2b05a37a 36#define BADMAG(x) ((x).f_magic != 0572)
dd3b648e
RP		 37
38/* Define this if the C compiler puts an underscore at the front
39 of external names before giving them to the linker. */
40
41#define NAMES_HAVE_UNDERSCORE
42
43/* Offset from address of function to start of its code.
44 Zero on most machines. */
45
46#define FUNCTION_START_OFFSET 0
47
48/* Advance PC across any function entry prologue instructions
49 to reach some "real" code. */
50
51#define SKIP_PROLOGUE(pc) \
52 { pc = skip_prologue (pc); }
53CORE_ADDR skip_prologue ();
54
55/* Immediately after a function call, return the saved pc.
56 Can't go through the frames for this because on some machines
57 the new frame is not set up until the new function executes
58 some instructions. */
59
60#define SAVED_PC_AFTER_CALL(frame) (read_register (LR0_REGNUM))
61
62/* I'm not sure about the exact value of this, but based on looking
63 at the stack pointer when we get to main this seems to be right.
64
65 This is the register stack; We call it "CONTROL" in GDB for consistency
66 with Pyramid. */
67#define CONTROL_END_ADDR 0x80200000
68
69/* Memory stack. This is for the default register stack size, which is
70 only 0x800 bytes. Perhaps we should let the user specify stack sizes
71 (and tell EBMON with the "ZS" command). */
72#define STACK_END_ADDR 0x801ff800
73
74/* Stack grows downward. */
75
76#define INNER_THAN <
77
78/* Stack must be aligned on 32-bit word boundaries. */
79#define STACK_ALIGN(ADDR) (((ADDR) + 3) & ~3)
80
81/* Sequence of bytes for breakpoint instruction. */
82/* ASNEQ 0x50, gr1, gr1
83 The trap number 0x50 is chosen arbitrarily. */
84#if TARGET_BYTE_ORDER == BIG_ENDIAN
85#define BREAKPOINT {0x72, 0x50, 0x01, 0x01}
86#else /* Target is little-endian. */
87#define BREAKPOINT {0x01, 0x01, 0x50, 0x72}
88#endif /* Target is little-endian. */
89
90/* Amount PC must be decremented by after a breakpoint.
91 This is often the number of bytes in BREAKPOINT
92 but not always. */
93
66a8a9b4 94#define DECR_PC_AFTER_BREAK 0
dd3b648e
RP		 95
96/* Nonzero if instruction at PC is a return instruction.
97 On the 29k, this is a "jmpi l0" instruction. */
98
99#define ABOUT_TO_RETURN(pc) \
100 ((read_memory_integer (pc, 4) & 0xff0000ff) == 0xc0000080)
101
102/* Return 1 if P points to an invalid floating point value. */
103
104#define INVALID_FLOAT(p, len) 0 /* Just a first guess; not checked */
105
106/* Say how long (ordinary) registers are. */
107
108#define REGISTER_TYPE long
109
2b05a37a
JG		 110/* Allow the register declarations here to be overridden for remote
111 kernel debugging. */
112#if !defined (REGISTER_NAMES)
113
dd3b648e
RP		 114/* Number of machine registers */
115
116#define NUM_REGS 205
117
118/* Initializer for an array of names of registers.
119 There should be NUM_REGS strings in this initializer.
120
121 FIXME, add floating point registers and support here.
122
123 Also note that this list does not attempt to deal with kernel
124 debugging (in which the first 32 registers are gr64-gr95). */
125
126#define REGISTER_NAMES \
127{"gr96", "gr97", "gr98", "gr99", "gr100", "gr101", "gr102", "gr103", "gr104", \
128 "gr105", "gr106", "gr107", "gr108", "gr109", "gr110", "gr111", "gr112", \
129 "gr113", "gr114", "gr115", "gr116", "gr117", "gr118", "gr119", "gr120", \
130 "gr121", "gr122", "gr123", "gr124", "gr125", "gr126", "gr127", \
131 "lr0", "lr1", "lr2", "lr3", "lr4", "lr5", "lr6", "lr7", "lr8", "lr9", \
132 "lr10", "lr11", "lr12", "lr13", "lr14", "lr15", "lr16", "lr17", "lr18", \
133 "lr19", "lr20", "lr21", "lr22", "lr23", "lr24", "lr25", "lr26", "lr27", \
134 "lr28", "lr29", "lr30", "lr31", "lr32", "lr33", "lr34", "lr35", "lr36", \
135 "lr37", "lr38", "lr39", "lr40", "lr41", "lr42", "lr43", "lr44", "lr45", \
136 "lr46", "lr47", "lr48", "lr49", "lr50", "lr51", "lr52", "lr53", "lr54", \
137 "lr55", "lr56", "lr57", "lr58", "lr59", "lr60", "lr61", "lr62", "lr63", \
138 "lr64", "lr65", "lr66", "lr67", "lr68", "lr69", "lr70", "lr71", "lr72", \
139 "lr73", "lr74", "lr75", "lr76", "lr77", "lr78", "lr79", "lr80", "lr81", \
140 "lr82", "lr83", "lr84", "lr85", "lr86", "lr87", "lr88", "lr89", "lr90", \
141 "lr91", "lr92", "lr93", "lr94", "lr95", "lr96", "lr97", "lr98", "lr99", \
142 "lr100", "lr101", "lr102", "lr103", "lr104", "lr105", "lr106", "lr107", \
143 "lr108", "lr109", "lr110", "lr111", "lr112", "lr113", "lr114", "lr115", \
144 "lr116", "lr117", "lr118", "lr119", "lr120", "lr121", "lr122", "lr123", \
145 "lr124", "lr125", "lr126", "lr127", \
146 "AI0", "AI1", "AI2", "AI3", "AI4", "AI5", "AI6", "AI7", "AI8", "AI9", \
147 "AI10", "AI11", "AI12", "AI13", "AI14", "AI15", "FP", \
148 "bp", "fc", "cr", "q", \
149 "vab", "ops", "cps", "cfg", "cha", "chd", "chc", "rbp", "tmc", "tmr", \
d0b04c6a 150 "pc0", "pc1", "pc2", "mmu", "lru", "fpe", "inte", "fps", "exo", "gr1", \
dd3b648e
RP		 151 "alu", "ipc", "ipa", "ipb" }
152
d0b04c6a
SG		 153/*
154 * Provide the processor register numbers of some registers that are
155 * expected/written in instructions that might change under different
156 * register sets. Namely, gcc can compile (-mkernel-registers) so that
157 * it uses gr64-gr95 in stead of gr96-gr127.
158 */
159#define MSP_HW_REGNUM 125 /* gr125 */
160#define RAB_HW_REGNUM 126 /* gr126 */
161
2b05a37a 162/* Convert Processor Special register #x to REGISTER_NAMES register # */
dd3b648e
RP		 163#define SR_REGNUM(x) \
164 ((x) < 15 ? VAB_REGNUM + (x) \
2b05a37a 165 : (x) >= 128 && (x) < 131 ? IPC_REGNUM + (x) - 128 \
dd3b648e
RP		 166 : (x) == 131 ? Q_REGNUM \
167 : (x) == 132 ? ALU_REGNUM \
2b05a37a
JG		 168 : (x) >= 133 && (x) < 136 ? BP_REGNUM + (x) - 133 \
169 : (x) >= 160 && (x) < 163 ? FPE_REGNUM + (x) - 160 \
dd3b648e
RP		 170 : (x) == 164 ? EXO_REGNUM \
171 : (error ("Internal error in SR_REGNUM"), 0))
172#define GR96_REGNUM 0
2b05a37a
JG		 173/* Define the return register separately, so it can be overridden for
174 kernel procedure calling conventions. */
175#define RETURN_REGNUM GR96_REGNUM
dd3b648e
RP		 176#define GR1_REGNUM 200
177/* This needs to be the memory stack pointer, not the register stack pointer,
178 to make call_function work right. */
179#define SP_REGNUM MSP_REGNUM
180#define FP_REGNUM 33 /* lr1 */
181/* Large Return Pointer (gr123). */
182#define LRP_REGNUM (123 - 96 + GR96_REGNUM)
183/* Static link pointer (gr124). */
184#define SLP_REGNUM (124 - 96 + GR96_REGNUM)
185/* Memory Stack Pointer (gr125). */
186#define MSP_REGNUM (125 - 96 + GR96_REGNUM)
187/* Register allocate bound (gr126). */
188#define RAB_REGNUM (126 - 96 + GR96_REGNUM)
189/* Register Free Bound (gr127). */
190#define RFB_REGNUM (127 - 96 + GR96_REGNUM)
191/* Register Stack Pointer. */
192#define RSP_REGNUM GR1_REGNUM
193#define LR0_REGNUM 32
dd3b648e
RP		 194#define BP_REGNUM 177
195#define FC_REGNUM 178
196#define CR_REGNUM 179
197#define Q_REGNUM 180
198#define VAB_REGNUM 181
2b05a37a
JG		 199#define OPS_REGNUM (VAB_REGNUM + 1)
200#define CPS_REGNUM (VAB_REGNUM + 2)
201#define CFG_REGNUM (VAB_REGNUM + 3)
202#define CHA_REGNUM (VAB_REGNUM + 4)
203#define CHD_REGNUM (VAB_REGNUM + 5)
204#define CHC_REGNUM (VAB_REGNUM + 6)
205#define RBP_REGNUM (VAB_REGNUM + 7)
206#define TMC_REGNUM (VAB_REGNUM + 8)
207#define TMR_REGNUM (VAB_REGNUM + 9)
208#define NPC_REGNUM (VAB_REGNUM + 10) /* pc0 */
209#define PC_REGNUM (VAB_REGNUM + 11) /* pc1 */
210#define PC2_REGNUM (VAB_REGNUM + 12)
211#define MMU_REGNUM (VAB_REGNUM + 13)
212#define LRU_REGNUM (VAB_REGNUM + 14)
213#define FPE_REGNUM (VAB_REGNUM + 15)
d0b04c6a 214#define INTE_REGNUM (VAB_REGNUM + 16)
2b05a37a
JG		 215#define FPS_REGNUM (VAB_REGNUM + 17)
216#define EXO_REGNUM (VAB_REGNUM + 18)
217/* gr1 is defined above as 200 = VAB_REGNUM + 19 */
218#define ALU_REGNUM (VAB_REGNUM + 20)
219#define PS_REGNUM ALU_REGNUM
220#define IPC_REGNUM (VAB_REGNUM + 21)
221#define IPA_REGNUM (VAB_REGNUM + 22)
222#define IPB_REGNUM (VAB_REGNUM + 23)
223
224#endif /* !defined(REGISTER_NAMES) */
dd3b648e
RP		 225
226/* Total amount of space needed to store our copies of the machine's
227 register state, the array `registers'. */
228#define REGISTER_BYTES (NUM_REGS * 4)
229
230/* Index within `registers' of the first byte of the space for
231 register N. */
232#define REGISTER_BYTE(N) ((N)*4)
233
234/* Number of bytes of storage in the actual machine representation
235 for register N. */
236
237/* All regs are 4 bytes. */
238
239#define REGISTER_RAW_SIZE(N) (4)
240
241/* Number of bytes of storage in the program's representation
242 for register N. */
243
244/* All regs are 4 bytes. */
245
246#define REGISTER_VIRTUAL_SIZE(N) (4)
247
248/* Largest value REGISTER_RAW_SIZE can have. */
249
250#define MAX_REGISTER_RAW_SIZE (4)
251
252/* Largest value REGISTER_VIRTUAL_SIZE can have. */
253
254#define MAX_REGISTER_VIRTUAL_SIZE (4)
255
256/* Nonzero if register N requires conversion
257 from raw format to virtual format. */
258
259#define REGISTER_CONVERTIBLE(N) (0)
260
261/* Convert data from raw format for register REGNUM
262 to virtual format for register REGNUM. */
263
264#define REGISTER_CONVERT_TO_VIRTUAL(REGNUM,FROM,TO) \
265{ bcopy ((FROM), (TO), 4); }
266
267/* Convert data from virtual format for register REGNUM
268 to raw format for register REGNUM. */
269
270#define REGISTER_CONVERT_TO_RAW(REGNUM,FROM,TO) \
271{ bcopy ((FROM), (TO), 4); }
272
273/* Return the GDB type object for the "standard" data type
274 of data in register N. */
275
276#define REGISTER_VIRTUAL_TYPE(N) \
277 (((N) == PC_REGNUM || (N) == LRP_REGNUM || (N) == SLP_REGNUM \
278 || (N) == MSP_REGNUM || (N) == RAB_REGNUM || (N) == RFB_REGNUM \
279 || (N) == GR1_REGNUM || (N) == FP_REGNUM || (N) == LR0_REGNUM \
280 || (N) == NPC_REGNUM || (N) == PC2_REGNUM) \
281 ? lookup_pointer_type (builtin_type_void) : builtin_type_int)
282\f
283/* Store the address of the place in which to copy the structure the
284 subroutine will return. This is called from call_function. */
285/* On the 29k the LRP points to the part of the structure beyond the first
286 16 words. */
287#define STORE_STRUCT_RETURN(ADDR, SP) \
288 write_register (LRP_REGNUM, (ADDR) + 16 * 4);
289
290/* Should call_function allocate stack space for a struct return? */
291/* On the 29k objects over 16 words require the caller to allocate space. */
292#define USE_STRUCT_CONVENTION(gcc_p, type) (TYPE_LENGTH (type) > 16 * 4)
293
294/* Extract from an array REGBUF containing the (raw) register state
295 a function return value of type TYPE, and copy that, in virtual format,
296 into VALBUF. */
297
298#define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
299 { \
300 int reg_length = TYPE_LENGTH (TYPE); \
301 if (reg_length > 16 * 4) \
302 { \
303 reg_length = 16 * 4; \
304 read_memory (*((int *)(REGBUF) + LRP_REGNUM), (VALBUF) + 16 * 4, \
305 TYPE_LENGTH (TYPE) - 16 * 4); \
306 } \
2b05a37a 307 bcopy (((int *)(REGBUF))+RETURN_REGNUM, (VALBUF), reg_length); \
dd3b648e
RP		 308 }
309
310/* Write into appropriate registers a function return value
311 of type TYPE, given in virtual format. */
312
313#define STORE_RETURN_VALUE(TYPE,VALBUF) \
314 { \
315 int reg_length = TYPE_LENGTH (TYPE); \
316 if (reg_length > 16 * 4) \
317 { \
318 reg_length = 16 * 4; \
319 write_memory (read_register (LRP_REGNUM), \
320 (char *)(VALBUF) + 16 * 4, \
321 TYPE_LENGTH (TYPE) - 16 * 4); \
322 } \
2b05a37a 323 write_register_bytes (REGISTER_BYTE (RETURN_REGNUM), (char *)(VALBUF), \
dd3b648e
RP		 324 TYPE_LENGTH (TYPE)); \
325 }
326\f
327/* The am29k user's guide documents well what the stacks look like.
328 But what isn't so clear there is how this interracts with the
329 symbols, or with GDB.
330 In the following saved_msp, saved memory stack pointer (which functions
331 as a memory frame pointer), means either
332 a register containing the memory frame pointer or, in the case of
333 functions with fixed size memory frames (i.e. those who don't use
334 alloca()), the result of the calculation msp + msize.
335
336 LOC_ARG, LOC_LOCAL - For GCC, these are relative to saved_msp.
337 For high C, these are relative to msp (making alloca impossible).
338 LOC_REGISTER, LOC_REGPARM - The register number is the number at the
339 time the function is running (after the prologue), or in the case
340 of LOC_REGPARM, may be a register number in the range 160-175.
341
342 The compilers do things like store an argument into memory, and then put out
343 a LOC_ARG for it, or put it into global registers and put out a
344 LOC_REGPARM. Thus is it important to execute the first line of
345 code (i.e. the line of the open brace, i.e. the prologue) of a function
346 before trying to print arguments or anything.
347
348 The following diagram attempts to depict what is going on in memory
349 (see also the _am29k user's guide_) and also how that interacts with
350 GDB frames. We arbitrarily pick fci->frame to point the same place
351 as the register stack pointer; since we set it ourself in
352 INIT_EXTRA_FRAME_INFO, and access it only through the FRAME_*
353 macros, it doesn't really matter exactly how we
354 do it. However, note that FRAME_FP is used in two ways in GDB:
355 (1) as a "magic cookie" which uniquely identifies frames (even over
841c051c 356 calls to the inferior), (2) (in PC_IN_CALL_DUMMY [ON_STACK])
dd3b648e 357 as the value of SP_REGNUM before the dummy frame was pushed. These
841c051c
JG		 358 two meanings would be incompatible for the 29k if we defined
359 CALL_DUMMY_LOCATION == ON_STACK (but we don't, so don't worry about it).
dd3b648e
RP		 360 Also note that "lr1" below, while called a frame pointer
361 in the user's guide, has only one function: To determine whether
362 registers need to be filled in the function epilogue.
363
364 Consider the code:
365 < call bar>
366 loc1: . . .
367 bar: sub gr1,gr1,rsize_b
368 . . .
369 add mfp,msp,0
370 sub msp,msp,msize_b
371 . . .
372 < call foo >
373 loc2: . . .
374 foo: sub gr1,gr1,rsize_f
375 . . .
376 add mfp,msp,0
377 sub msp,msp,msize_f
378 . . .
379 loc3: < suppose the inferior stops here >
380
381 memory stack register stack
382 | | |____________|
383 | | |____loc1____|
384 +------->|___________| | | ^
385 | | ^ | | locals_b | |
386 | | | | |____________| |
387 | | | | | | | rsize_b
388 | | | msize_b | | args_to_f | |
389 | | | | |____________| |
390 | | | | |____lr1_____| V
391 | | V | |____loc2____|<----------------+
392 | +--->|___________|<---------mfp | ^ |
393 | | | ^ | | locals_f | | |
394 | | | | msize_f | |____________| | |
395 | | | | | | | | rsize_f |
396 | | | V | | args | | |
397 | | |___________|<msp |____________| | |
398 | | |_____lr1____| V |
399 | | |___garbage__| <- gr1 <----+ |
400 | | | |
401 | | | |
402 | | pc=loc3 | |
403 | | | |
404 | | | |
405 | | frame cache | |
406 | | |_________________| | |
407 | | |rsize=rsize_b | | |
408 | | |msize=msize_b | | |
409 +---|--------saved_msp | | |
410 | |frame------------------------------------|---+
411 | |pc=loc2 | |
412 | |_________________| |
413 | |rsize=rsize_f | |
414 | |msize=msize_f | |
415 +--------saved_msp | |
416 |frame------------------------------------+
417 |pc=loc3 |
418 |_________________|
419
420 So, is that sufficiently confusing? Welcome to the 29000.
421 Notes:
422 * The frame for foo uses a memory frame pointer but the frame for
423 bar does not. In the latter case the saved_msp is
424 computed by adding msize to the saved_msp of the
425 next frame.
426 * msize is in the frame cache only for high C's sake. */
427
428void read_register_stack ();
429long read_register_stack_integer ();
430\f
431#define EXTRA_FRAME_INFO \
432 CORE_ADDR saved_msp; \
433 unsigned int rsize; \
d0b04c6a
SG		 434 unsigned int msize; \
435 unsigned char flags;
436
437/* Bits for flags in EXTRA_FRAME_INFO */
438#define TRANSPARENT 0x1 /* This is a transparent frame */
439#define MFP_USED 0x2 /* A memory frame pointer is used */
dd3b648e
RP		 440
441/* Because INIT_FRAME_PC gets passed fromleaf, that's where we init
442 not only ->pc and ->frame, but all the extra stuff, when called from
443 get_prev_frame_info, that is. */
d0b04c6a 444#define INIT_EXTRA_FRAME_INFO(fromleaf, fci) init_extra_frame_info(fci)
dd3b648e 445void init_extra_frame_info ();
d0b04c6a
SG		 446
447#define INIT_FRAME_PC(fromleaf, fci) init_frame_pc(fromleaf, fci)
dd3b648e 448void init_frame_pc ();
d0b04c6a 449
dd3b648e
RP		 450\f
451/* FRAME_CHAIN takes a FRAME
452 and produces the frame's chain-pointer.
453
dd3b648e 454 However, if FRAME_CHAIN_VALID returns zero,
e140f1da 455 it means the given frame is the outermost one and has no caller. */
dd3b648e
RP		 456
457/* On the 29k, the nominal address of a frame is the address on the
458 register stack of the return address (the one next to the incoming
459 arguments, not down at the bottom so nominal address == stack pointer).
460
461 GDB expects "nominal address" to equal contents of FP_REGNUM,
462 at least when it comes time to create the innermost frame.
463 However, that doesn't work for us, so when creating the innermost
464 frame we set ->frame ourselves in INIT_EXTRA_FRAME_INFO. */
465
466/* These are mostly dummies for the 29k because INIT_FRAME_PC
467 sets prev->frame instead. */
d0b04c6a
SG		 468#define FRAME_CHAIN(thisframe) ((thisframe)->frame + (thisframe)->rsize)
469
470/* Determine if the frame has a 'previous' and back-traceable frame. */
471#define FRAME_IS_UNCHAINED(frame) ((frame)->flags & TRANSPARENT)
dd3b648e 472
d0b04c6a
SG		 473/* Find the previous frame of a transparent routine.
474 * For now lets not try and trace through a transparent routine (we might
475 * have to assume that all transparent routines are traps).
476 */
477#define FIND_PREV_UNCHAINED_FRAME(frame) 0
dd3b648e 478
dd3b648e
RP		 479/* Define other aspects of the stack frame. */
480
481/* A macro that tells us whether the function invocation represented
482 by FI does not have a frame on the stack associated with it. If it
483 does not, FRAMELESS is set to 1, else 0. */
484#define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \
485 (FRAMELESS) = frameless_look_for_prologue(FI)
486
487/* Saved pc (i.e. return address). */
488#define FRAME_SAVED_PC(fraim) \
489 (read_register_stack_integer ((fraim)->frame + (fraim)->rsize, 4))
490
491/* Local variables (i.e. LOC_LOCAL) are on the memory stack, with their
492 offsets being relative to the memory stack pointer (high C) or
493 saved_msp (gcc). */
494
495#define FRAME_LOCALS_ADDRESS(fi) frame_locals_address (fi)
496extern CORE_ADDR frame_locals_address ();
497
498/* Return number of args passed to a frame.
499 Can return -1, meaning no way to tell. */
500/* While we could go the effort of finding the tags word and getting
501 the argcount field from it,
502 (1) It only counts arguments in registers, i.e. the first 16 words
503 of arguments
504 (2) It gives the number of arguments the function was declared with
505 not how many it was called with (or some variation, like all 16
506 words for varadic functions). This makes argcount pretty much
507 redundant with -g info, even for varadic functions.
508 So don't bother. */
509#define FRAME_NUM_ARGS(numargs, fi) ((numargs) = -1)
510
511#define FRAME_ARGS_ADDRESS(fi) FRAME_LOCALS_ADDRESS (fi)
512
513/* Return number of bytes at start of arglist that are not really args. */
514
515#define FRAME_ARGS_SKIP 0
516
517/* Provide our own get_saved_register. HAVE_REGISTER_WINDOWS is insufficient
518 because registers get renumbered on the 29k without getting saved. */
519
520#define GET_SAVED_REGISTER
521\f
522/* Call function stuff. */
523
524/* The dummy frame looks like this (see also the general frame picture
525 above):
526
527 register stack
528
529 | | frame for function
530 | locals_sproc | executing at time
531 |________________| of call_function.
532 | | We must not disturb
533 | args_out_sproc | it.
534 memory stack |________________|
d0b04c6a
SG		 535 |____lr1_sproc___|<-+
536 | | |__retaddr_sproc_| | <-- gr1 (at start)
537 |____________|<-msp 0 <-----------mfp_dummy_____| |
538 | | (at start) | save regs | |
539 | arg_slop | | pc0,pc1 | |
540 | (16 words) | | gr96-gr124 | |
541 |____________|<-msp 1--after | sr160-sr162 | |
542 | | PUSH_DUMMY_FRAME| sr128-sr135 | |
543 | struct ret | |________________| |
544 | 17+ | | | |
545 |____________|<- lrp | args_out_dummy | |
546 | struct ret | | (16 words) | |
547 | 16 | |________________| |
548 | (16 words) | |____lr1_dummy___|--+
dd3b648e
RP		 549 |____________|<- msp 2--after |_retaddr_dummy__|<- gr1 after
550 | | struct ret | | PUSH_DUMMY_FRAME
551 | margs17+ | area allocated | locals_inf |
552 | | |________________| called
553 |____________|<- msp 4--when | | function's
554 | | inf called | args_out_inf | frame (set up
555 | margs16 | |________________| by called
556 | (16 words) | |_____lr1_inf____| function).
557 |____________|<- msp 3--after | . |
558 | | args pushed | . |
559 | | | . |
560 | |
561
562 arg_slop: This area is so that when the call dummy adds 16 words to
563 the msp, it won't end up larger than mfp_dummy (it is needed in the
564 case where margs and struct_ret do not add up to at least 16 words).
565 struct ret: This area is allocated by GDB if the return value is more
566 than 16 words. struct ret_16 is not used on the 29k.
567 margs: Pushed by GDB. The call dummy copies the first 16 words to
568 args_out_dummy.
569 retaddr_sproc: Contains the PC at the time we call the function.
570 set by PUSH_DUMMY_FRAME and read by POP_FRAME.
571 retaddr_dummy: This points to a breakpoint instruction in the dummy. */
572\f
573/* Rsize for dummy frame, in bytes. */
574
575/* Bytes for outgoing args, lr1, and retaddr. */
576#define DUMMY_ARG (2 * 4 + 16 * 4)
577
578/* Number of special registers (sr128-) to save. */
579#define DUMMY_SAVE_SR128 8
d0b04c6a
SG		 580/* Number of special registers (sr160-) to save. */
581#define DUMMY_SAVE_SR160 3
2b05a37a
JG		 582/* Number of general (gr96- or gr64-) registers to save. */
583#define DUMMY_SAVE_GREGS 29
dd3b648e
RP		 584
585#define DUMMY_FRAME_RSIZE \
d0b04c6a
SG		 586(4 /* mfp_dummy */ \
587 + 2 * 4 /* pc0, pc1 */ \
588 + DUMMY_SAVE_GREGS * 4 \
589 + DUMMY_SAVE_SR160 * 4 \
590 + DUMMY_SAVE_SR128 * 4 \
591 + DUMMY_ARG \
dd3b648e
RP		 592 )
593
594/* Push an empty stack frame, to record the current PC, etc. */
595
d0b04c6a 596#define PUSH_DUMMY_FRAME push_dummy_frame()
dd3b648e
RP		 597extern void push_dummy_frame ();
598
599/* Discard from the stack the innermost frame,
600 restoring all saved registers. */
601
d0b04c6a 602#define POP_FRAME pop_frame()
dd3b648e
RP		 603extern void pop_frame ();
604
605/* This sequence of words is the instructions
606 mtsrim cr, 15
607 loadm 0, 0, lr2, msp ; load first 16 words of arguments into registers
608 add msp, msp, 16 * 4 ; point to the remaining arguments
609 CONST_INSN:
d0b04c6a
SG		 610 const lr0,inf
611 consth lr0,inf
612 calli lr0, lr0
dd3b648e
RP		 613 aseq 0x40,gr1,gr1 ; nop
614 asneq 0x50,gr1,gr1 ; breakpoint
615 */
616
617/* Position of the "const" instruction within CALL_DUMMY in bytes. */
618#define CONST_INSN (3 * 4)
619#if TARGET_BYTE_ORDER == HOST_BYTE_ORDER
d0b04c6a
SG		 620#define CALL_DUMMY {0x0400870f,\
621 0x36008200|(MSP_HW_REGNUM), \
622 0x15000040|(MSP_HW_REGNUM<<8)|(MSP_HW_REGNUM<<16), \
623 0x03ff80ff, 0x02ff80ff, 0xc8008080, 0x70400101, 0x72500101}
dd3b648e
RP		 624#else /* Byte order differs. */
625 you lose
626#endif /* Byte order differs. */
627#define CALL_DUMMY_LENGTH (8 * 4)
628
629#define CALL_DUMMY_START_OFFSET 0 /* Start execution at beginning of dummy */
630
631/* Helper macro for FIX_CALL_DUMMY. WORDP is a long * which points to a
632 word in target byte order; bits 0-7 and 16-23 of *WORDP are replaced with
633 bits 0-7 and 8-15 of DATA (which is in host byte order). */
634
635#if TARGET_BYTE_ORDER == BIG_ENDIAN
636#define STUFF_I16(WORDP, DATA) \
637 { \
638 *((char *)(WORDP) + 3) = ((DATA) & 0xff);\
639 *((char *)(WORDP) + 1) = (((DATA) >> 8) & 0xff);\
640 }
641#else /* Target is little endian. */
642#define STUFF_I16(WORDP, DATA) \
643 {
644 *(char *)(WORDP) = ((DATA) & 0xff);
645 *((char *)(WORDP) + 2) = (((DATA) >> 8) & 0xff);
646 }
647#endif /* Target is little endian. */
648
649/* Insert the specified number of args and function address
650 into a call sequence of the above form stored at DUMMYNAME. */
651
652/* Currently this stuffs in the address of the function that we are calling.
653 If different 29k systems use different breakpoint instructions, it
654 could also stuff BREAKPOINT in the right place (to avoid having to
655 duplicate CALL_DUMMY in each tm-*.h file). */
656
657#define FIX_CALL_DUMMY(dummyname, pc, fun, nargs, args, type, gcc_p) \
658 {\
659 STUFF_I16((char *)dummyname + CONST_INSN, fun);\
660 STUFF_I16((char *)dummyname + CONST_INSN + 4, fun >> 16);\
661 }
662
841c051c
JG		 663/* 29k architecture has separate data & instruction memories -- wired to
664 different pins on the chip -- and can't execute the data memory.
665 Also, there should be space after text_end;
dd3b648e
RP		 666 we won't get a SIGSEGV or scribble on data space. */
667
668#define CALL_DUMMY_LOCATION AFTER_TEXT_END
669
841c051c
JG		 670/* Because of this, we need (as a kludge) to know the addresses of the
671 text section. */
672
673#define NEED_TEXT_START_END
674
dd3b648e
RP		 675/* How to translate register numbers in the .stab's into gdb's internal register
676 numbers. We don't translate them, but we warn if an invalid register
677 number is seen. Note that FIXME, we use the value "sym" as an implicit
678 argument in printing the error message. It happens to be available where
679 this macro is used. (This macro definition appeared in a late revision
680 of gdb-3.91.6 and is not well tested. Also, it should be a "complaint".) */
681
682#define STAB_REG_TO_REGNUM(num) \
683 (((num) > LR0_REGNUM + 127) \
684 ? fprintf(stderr, \
685 "Invalid register number %d in symbol table entry for %s\n", \
686 (num), SYMBOL_NAME (sym)), (num) \
687 : (num))
GDB Binutils - Deliverables
This page took 0.089902 seconds and 4 git commands to generate.