123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363 |
- /* Definitions to make GDB run on a ISI Optimum V (3.05) under 4.2bsd.
- WARNING: This is preliminary and it was for GDB version 1.
- It certainly requires additional macros and changes for GDB version 2.
- Copyright (C) 1986 Free Software Foundation, Inc.
- GDB is distributed in the hope that it will be useful, but WITHOUT ANY
- WARRANTY. No author or distributor accepts responsibility to anyone
- for the consequences of using it or for whether it serves any
- particular purpose or works at all, unless he says so in writing.
- Refer to the GDB General Public License for full details.
- Everyone is granted permission to copy, modify and redistribute GDB,
- but only under the conditions described in the GDB General Public
- License. A copy of this license is supposed to have been given to you
- along with GDB so you can know your rights and responsibilities. It
- should be in a file named COPYING. Among other things, the copyright
- notice and this notice must be preserved on all copies.
- In other words, go ahead and share GDB, but don't try to stop
- anyone else from sharing it farther. Help stamp out software hoarding!
- */
- /* Define this if the C compiler puts an underscore at the front
- of external names before giving them to the linker. */
- #define NAMES_HAVE_UNDERSCORE
- /* 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. */
- #define SKIP_PROLOGUE(pc) \
- { register int op = read_memory_integer (pc, 2); \
- if (op == 0047126) \
- pc += 4; /* Skip link #word */ \
- else if (op == 0044016) \
- pc += 6; /* Skip link #long */ \
- else if (op == 0x6000) \
- pc += 4; /* Skip bra #word */ \
- else if (op == 0x60ff) \
- pc += 6; /* skip bra #long */ \
- else if (op & 0xff00 == 0x6000) \
- pc += 2; /* skip bra #char */ \
- }
- /* 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. */
- #define SAVED_PC_AFTER_CALL(frame) \
- read_memory_integer (read_register (SP_REGNUM), 4)
- /* This is the amount to subtract from u.u_ar0
- to get the offset in the core file of the register values. */
- #define KERNEL_U_ADDR 0x10800000
- /* Address of end of stack space. */
- #define STACK_END_ADDR 0x10000000
- /* Stack grows downward. */
- #define INNER_THAN <
- /* Sequence of bytes for breakpoint instruction. */
- #define BREAKPOINT {0x4e, 0x4f}
- /* Amount PC must be decremented by after a breakpoint.
- This is often the number of bytes in BREAKPOINT
- but not always. */
- #define DECR_PC_AFTER_BREAK 2
- /* Nonzero if instruction at PC is a return instruction. */
- #define ABOUT_TO_RETURN(pc) (read_memory_integer (pc, 2) == 0x4e76)
- /* Return 1 if P points to an invalid floating point value. */
- #define INVALID_FLOAT(p) 0
- /* Say how long registers are. */
- #define REGISTER_TYPE long
- /* Number of machine registers */
- #define NUM_REGS 18
- /* Number that are really general registers */
- #define NUM_GENERAL_REGS 16
- /* Initializer for an array of names of registers.
- There should be NUM_REGS strings in this initializer. */
- #define REGISTER_NAMES {"d0", "d1", "d2", "d3", "d4", "d5", "d6", "d7", "a0", "a1", "a2", "a3", "a4", "a5", "fp", "sp", "ps", "pc"}
- /* 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 FP_REGNUM 14 /* Contains address of executing stack frame */
- #define SP_REGNUM 15 /* Contains address of top of stack */
- #define PS_REGNUM 16 /* Contains processor status */
- #define PC_REGNUM 17 /* Contains program counter */
- #define REGISTER_U_ADDR(addr, blockend, regno) \
- { if (regno < 2) addr = blockend - 0x18 + regno * 4; \
- else if (regno < 8) addr = blockend - 0x54 + regno * 4; \
- else if (regno < 10) addr = blockend - 0x30 + regno * 4;\
- else if (regno < 15) addr = blockend - 0x5c + regno * 4;\
- else if (regno < 16) addr = blockend - 0x1c; \
- else addr = blockend - 0x44 + regno * 4; } \
- /* Describe the pointer in each stack frame to the previous stack frame
- (its caller). */
- /* FRAME_CHAIN takes a frame's nominal address
- and produces the frame's chain-pointer.
- FRAME_CHAIN_COMBINE takes the chain pointer and the frame's nominal address
- and produces the nominal address of the caller frame.
- However, if FRAME_CHAIN_VALID returns zero,
- it means the given frame is the outermost one and has no caller.
- In that case, FRAME_CHAIN_COMBINE is not used. */
- /* In the case of the ISI, the frame's nominal address
- is the address of a 4-byte word containing the calling frame's address. */
- #define FRAME_CHAIN(thisframe) (read_memory_integer (thisframe, 4))
- #define FRAME_CHAIN_VALID(chain, thisframe) \
- (chain != 0 && (FRAME_SAVED_PC (thisframe) >= first_object_file_end))
- #define FRAME_CHAIN_COMBINE(chain, thisframe) (chain)
- /* Define other aspects of the stack frame. */
- #define FRAME_SAVED_PC(frame) (read_memory_integer (frame + 4, 4))
- #define FRAME_ARGS_ADDRESS(fi) (fi.frame)
- #define FRAME_LOCALS_ADDRESS(fi) (fi.frame)
- /* Return number of args passed to a frame.
- Can return -1, meaning no way to tell. */
- #define FRAME_NUM_ARGS(val, fi) \
- { register CORE_ADDR pc = FRAME_SAVED_PC (fi.frame); \
- register int insn = 0177777 & read_memory_integer (pc, 2); \
- val = 0; \
- if (insn == 0047757 || insn == 0157374) /* lea W(sp),sp or addaw #W,sp */ \
- val = read_memory_integer (pc + 2, 2); \
- else if ((insn & 0170777) == 0050217 /* addql #N, sp */ \
- || (insn & 0170777) == 0050117) /* addqw */ \
- { val = (insn >> 9) & 7; if (val == 0) val = 8; } \
- else if (insn == 0157774) /* addal #WW, sp */ \
- val = read_memory_integer (pc + 2, 4); \
- val >>= 2; }
- /* Return number of bytes at start of arglist that are not really args. */
- #define FRAME_ARGS_SKIP 4
- /* 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) \
- { register int regnum; \
- register int regmask; \
- register CORE_ADDR next_addr; \
- register CORE_ADDR pc; \
- bzero (&frame_saved_regs, sizeof frame_saved_regs); \
- if ((frame_info).pc >= (frame_info).frame - CALL_DUMMY_LENGTH - FP_REGNUM*4 - 4 \
- && (frame_info).pc <= (frame_info).frame) \
- { next_addr = (frame_info).frame; \
- pc = (frame_info).frame - CALL_DUMMY_LENGTH - FP_REGNUM * 4 - 4; }\
- else \
- { pc = get_pc_function_start ((frame_info).pc); \
- /* Verify we have a link a6 instruction next; \
- if not we lose. If we win, find the address above the saved \
- regs using the amount of storage from the link instruction. */\
- if (044016 == read_memory_integer (pc, 2)) \
- next_addr = (frame_info).frame - read_memory_integer (pc += 2, 4), pc+=4; \
- else if (047126 == read_memory_integer (pc, 2)) \
- next_addr = (frame_info).frame - read_memory_integer (pc += 2, 2), pc+=2; \
- else goto lose; \
- /* If have an addal #-n, sp next, adjust next_addr. */ \
- if ((0177777 & read_memory_integer (pc, 2)) == 0157774) \
- next_addr += read_memory_integer (pc += 2, 4), pc += 4; \
- } \
- /* next should be a moveml to (sp) or -(sp) or a movl r,-(sp) */ \
- regmask = read_memory_integer (pc + 2, 2); \
- if (0044327 == read_memory_integer (pc, 2)) \
- { pc += 4; /* Regmask's low bit is for register 0, the first written */ \
- for (regnum = 0; regnum < 16; regnum++, regmask >>= 1) \
- if (regmask & 1) \
- (frame_saved_regs).regs[regnum] = (next_addr += 4) - 4; } \
- else if (0044347 == read_memory_integer (pc, 2)) \
- { pc += 4; /* Regmask's low bit is for register 15, the first pushed */ \
- for (regnum = 15; regnum >= 0; regnum--, regmask >>= 1) \
- if (regmask & 1) \
- (frame_saved_regs).regs[regnum] = (next_addr -= 4); } \
- else if (0x2f00 == 0xfff0 & read_memory_integer (pc, 2)) \
- { regnum = 0xf & read_memory_integer (pc, 2); pc += 2; \
- (frame_saved_regs).regs[regnum] = (next_addr -= 4); } \
- /* clrw -(sp); movw ccr,-(sp) may follow. */ \
- if (0x426742e7 == read_memory_integer (pc, 4)) \
- (frame_saved_regs).regs[PS_REGNUM] = (next_addr -= 4); \
- lose: ; \
- (frame_saved_regs).regs[SP_REGNUM] = (frame_info).frame + 8; \
- (frame_saved_regs).regs[FP_REGNUM] = (frame_info).frame; \
- (frame_saved_regs).regs[PC_REGNUM] = (frame_info).frame + 4; \
- }
- /* Things needed for making the inferior call functions. */
- /* Push an empty stack frame, to record the current PC, etc. */
- #define PUSH_DUMMY_FRAME \
- { register CORE_ADDR sp = read_register (SP_REGNUM);\
- register int regnum; \
- sp = push_word (sp, read_register (PC_REGNUM)); \
- sp = push_word (sp, read_register (FP_REGNUM)); \
- write_register (FP_REGNUM, sp); \
- for (regnum = FP_REGNUM - 1; regnum >= 0; regnum--) \
- sp = push_word (sp, read_register (regnum)); \
- sp = push_word (sp, read_register (PS_REGNUM)); \
- write_register (SP_REGNUM, sp); }
- /* Discard from the stack the innermost frame, restoring all registers. */
- #define POP_FRAME \
- { register CORE_ADDR fp = read_register (FP_REGNUM); \
- register int regnum; \
- struct frame_saved_regs fsr; \
- struct frame_info fi; \
- fi = get_frame_info (fp); \
- get_frame_saved_regs (&fi, &fsr); \
- for (regnum = FP_REGNUM - 1; regnum >= 0; regnum--) \
- if (fsr.regs[regnum]) \
- write_register (regnum, read_memory_integer (fsr.regs[regnum], 4)); \
- if (fsr.regs[PS_REGNUM]) \
- write_register (PS_REGNUM, read_memory_integer (fsr.regs[PS_REGNUM], 4)); \
- write_register (FP_REGNUM, read_memory_integer (fp, 4)); \
- write_register (PC_REGNUM, read_memory_integer (fp + 4, 4)); \
- write_register (SP_REGNUM, fp + 8); \
- }
- /* This sequence of words is the instructions
- moveml 0xfffc,-(sp)
- clrw -(sp)
- movew ccr,-(sp)
- /..* The arguments are pushed at this point by GDB;
- no code is needed in the dummy for this.
- The CALL_DUMMY_START_OFFSET gives the position of
- the following jsr instruction. *../
- jsr @#32323232
- addl #69696969,sp
- bpt
- nop
- Note this is 24 bytes.
- We actually start executing at the jsr, since the pushing of the
- registers is done by PUSH_DUMMY_FRAME. If this were real code,
- the arguments for the function called by the jsr would be pushed
- between the moveml and the jsr, and we could allow it to execute through.
- But the arguments have to be pushed by GDB after the PUSH_DUMMY_FRAME is done,
- and we cannot allow the moveml to push the registers again lest they be
- taken for the arguments. */
- #define CALL_DUMMY {0x48e7fffc, 0x426742e7, 0x4eb93232, 0x3232dffc, 0x69696969, 0x4e4f4e71}
- #define CALL_DUMMY_LENGTH 24
- #define CALL_DUMMY_START_OFFSET 8
- /* Insert the specified number of args and function address
- into a call sequence of the above form stored at DUMMYNAME. */
- #define FIX_CALL_DUMMY(dummyname, fun, nargs) \
- { *(int *)((char *) dummyname + 16) = nargs * 4; \
- *(int *)((char *) dummyname + 10) = fun; }
- /* Interface definitions for kernel debugger KDB. */
- /* Map machine fault codes into signal numbers.
- First subtract 0, divide by 4, then index in a table.
- Faults for which the entry in this table is 0
- are not handled by KDB; the program's own trap handler
- gets to handle then. */
- #define FAULT_CODE_ORIGIN 0
- #define FAULT_CODE_UNITS 4
- #define FAULT_TABLE \
- { 0, 0, 0, 0, SIGTRAP, 0, 0, 0, \
- 0, SIGTRAP, 0, 0, 0, 0, 0, SIGKILL, \
- 0, 0, 0, 0, 0, 0, 0, 0, \
- SIGILL }
- /* Start running with a stack stretching from BEG to END.
- BEG and END should be symbols meaningful to the assembler.
- This is used only for kdb. */
- #define INIT_STACK(beg, end) \
- { asm (".globl end"); \
- asm ("movl $ end, sp"); \
- asm ("clrl fp"); }
- /* Push the frame pointer register on the stack. */
- #define PUSH_FRAME_PTR \
- asm ("movel fp, -(sp)");
- /* Copy the top-of-stack to the frame pointer register. */
- #define POP_FRAME_PTR \
- asm ("movl (sp), fp");
- /* After KDB is entered by a fault, push all registers
- that GDB thinks about (all NUM_REGS of them),
- so that they appear in order of ascending GDB register number.
- The fault code will be on the stack beyond the last register. */
- #define PUSH_REGISTERS \
- { asm ("clrw -(sp)"); \
- asm ("pea 10(sp)"); \
- asm ("movem $ 0xfffe,-(sp)"); }
- /* Assuming the registers (including processor status) have been
- pushed on the stack in order of ascending GDB register number,
- restore them and return to the address in the saved PC register. */
- #define POP_REGISTERS \
- { asm ("subil $8,28(sp)"); \
- asm ("movem (sp),$ 0xffff"); \
- asm ("rte"); }
- ============================================================m-isi-ovinit.h
- /* This is how the size of an individual .o file's text segment
- is rounded on a vax. */
- #define FILEADDR_ROUND(addr) (addr)
- ============================================================
|