519 lines
18 KiB
C
519 lines
18 KiB
C
/* Parameters for execution on any Hewlett-Packard PA-RISC machine.
|
||
Copyright 1986, 1987, 1989, 1990, 1991, 1992, 1993
|
||
Free Software Foundation, Inc.
|
||
|
||
Contributed by the Center for Software Science at the
|
||
University of Utah (pa-gdb-bugs@cs.utah.edu).
|
||
|
||
This file is part of GDB.
|
||
|
||
This program is free software; you can redistribute it and/or modify
|
||
it under the terms of the GNU General Public License as published by
|
||
the Free Software Foundation; either version 2 of the License, or
|
||
(at your option) any later version.
|
||
|
||
This program is distributed in the hope that it will be useful,
|
||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
GNU General Public License for more details.
|
||
|
||
You should have received a copy of the GNU General Public License
|
||
along with this program; if not, write to the Free Software
|
||
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
|
||
|
||
/* Target system byte order. */
|
||
|
||
#define TARGET_BYTE_ORDER BIG_ENDIAN
|
||
|
||
/* Get at various relevent fields of an instruction word. */
|
||
|
||
#define MASK_5 0x1f
|
||
#define MASK_11 0x7ff
|
||
#define MASK_14 0x3fff
|
||
#define MASK_21 0x1fffff
|
||
|
||
/* This macro gets bit fields using HP's numbering (MSB = 0) */
|
||
|
||
#define GET_FIELD(X, FROM, TO) \
|
||
((X) >> 31 - (TO) & (1 << ((TO) - (FROM) + 1)) - 1)
|
||
|
||
/* Watch out for NaNs */
|
||
|
||
#define IEEE_FLOAT
|
||
|
||
/* On the PA, any pass-by-value structure > 8 bytes is actually
|
||
passed via a pointer regardless of its type or the compiler
|
||
used. */
|
||
|
||
#define REG_STRUCT_HAS_ADDR(gcc_p,type) \
|
||
(TYPE_LENGTH (type) > 8)
|
||
|
||
/* 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. */
|
||
|
||
/* skip (stw rp, -20(0,sp)); copy 4,1; copy sp, 4; stwm 1,framesize(sp)
|
||
for gcc, or (stw rp, -20(0,sp); stwm 1, framesize(sp) for hcc */
|
||
|
||
#define SKIP_PROLOGUE(pc) pc = skip_prologue (pc)
|
||
|
||
/* If PC is in some function-call trampoline code, return the PC
|
||
where the function itself actually starts. If not, return NULL. */
|
||
|
||
#define SKIP_TRAMPOLINE_CODE(pc) skip_trampoline_code (pc, NULL)
|
||
|
||
/* Return non-zero if we are in some sort of a trampoline. */
|
||
|
||
#define IN_SOLIB_TRAMPOLINE(pc, name) skip_trampoline_code (pc, name)
|
||
|
||
/* Immediately after a function call, return the saved pc.
|
||
Can't go through the frames for this because on some machines
|
||
the new frame is not set up until the new function executes
|
||
some instructions. */
|
||
|
||
#undef SAVED_PC_AFTER_CALL
|
||
#define SAVED_PC_AFTER_CALL(frame) saved_pc_after_call (frame)
|
||
|
||
/* Stack grows upward */
|
||
|
||
#define INNER_THAN >
|
||
|
||
|
||
/* Sequence of bytes for breakpoint instruction. */
|
||
|
||
/*#define BREAKPOINT {0x00, 0x00, 0x00, 0x00}*/
|
||
#ifdef KERNELDEBUG /* XXX */
|
||
#define BREAKPOINT {0x00, 0x00, 0xa0, 0x00}
|
||
#else
|
||
#define BREAKPOINT {0x00, 0x01, 0x00, 0x04}
|
||
#endif
|
||
|
||
/* Amount PC must be decremented by after a breakpoint.
|
||
This is often the number of bytes in BREAKPOINT
|
||
but not always.
|
||
|
||
Not on the PA-RISC */
|
||
|
||
#define DECR_PC_AFTER_BREAK 0
|
||
|
||
/* return instruction is bv r0(rp) or bv,n r0(rp)*/
|
||
|
||
#define ABOUT_TO_RETURN(pc) ((read_memory_integer (pc, 4) | 0x2) == 0xE840C002)
|
||
|
||
/* Return 1 if P points to an invalid floating point value. */
|
||
|
||
#define INVALID_FLOAT(p, len) 0 /* Just a first guess; not checked */
|
||
|
||
/* Say how long (ordinary) registers are. This is a piece of bogosity
|
||
used in push_word and a few other places; REGISTER_RAW_SIZE is the
|
||
real way to know how big a register is. */
|
||
|
||
#define REGISTER_SIZE 4
|
||
|
||
/* Number of machine registers */
|
||
|
||
#define NUM_REGS 128
|
||
|
||
/* Initializer for an array of names of registers.
|
||
There should be NUM_REGS strings in this initializer. */
|
||
|
||
#define REGISTER_NAMES \
|
||
{"flags", "r1", "rp", "r3", "r4", "r5", "r6", "r7", "r8", "r9", \
|
||
"r10", "r11", "r12", "r13", "r14", "r15", "r16", "r17", "r18", "r19", \
|
||
"r20", "r21", "r22", "arg3", "arg2", "arg1", "arg0", "dp", "ret0", "ret1", \
|
||
"sp", "r31", "sar", "pcoqh", "pcsqh", "pcoqt", "pcsqt", \
|
||
"eiem", "iir", "isr", "ior", "ipsw", "goto", "sr4", "sr0", "sr1", "sr2", \
|
||
"sr3", "sr5", "sr6", "sr7", "cr0", "cr8", "cr9", "ccr", "cr12", "cr13", \
|
||
"cr24", "cr25", "cr26", "mpsfu_high", "mpsfu_low", "mpsfu_ovflo", "pad", \
|
||
"fpsr", "fpe1", "fpe2", "fpe3", "fpe4", "fpe5", "fpe6", "fpe7", \
|
||
"fr4", "fr4R", "fr5", "fr5R", "fr6", "fr6R", "fr7", "fr7R", \
|
||
"fr8", "fr8R", "fr9", "fr9R", "fr10", "fr10R", "fr11", "fr11R", \
|
||
"fr12", "fr12R", "fr13", "fr13R", "fr14", "fr14R", "fr15", "fr15R", \
|
||
"fr16", "fr16R", "fr17", "fr17R", "fr18", "fr18R", "fr19", "fr19R", \
|
||
"fr20", "fr20R", "fr21", "fr21R", "fr22", "fr22R", "fr23", "fr23R", \
|
||
"fr24", "fr24R", "fr25", "fr25R", "fr26", "fr26R", "fr27", "fr27R", \
|
||
"fr28", "fr28R", "fr29", "fr29R", "fr30", "fr30R", "fr31", "fr31R"}
|
||
|
||
/* 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 FLAGS_REGNUM 0 /* Various status flags */
|
||
#define RP_REGNUM 2 /* return pointer */
|
||
#define FP_REGNUM 3 /* Contains address of executing stack */
|
||
/* frame */
|
||
#define SP_REGNUM 30 /* Contains address of top of stack */
|
||
#define SAR_REGNUM 32 /* shift amount register */
|
||
#define IPSW_REGNUM 41 /* processor status word. ? */
|
||
#define PCOQ_HEAD_REGNUM 33 /* instruction offset queue head */
|
||
#define PCSQ_HEAD_REGNUM 34 /* instruction space queue head */
|
||
#define PCOQ_TAIL_REGNUM 35 /* instruction offset queue tail */
|
||
#define PCSQ_TAIL_REGNUM 36 /* instruction space queue tail */
|
||
#define FP0_REGNUM 64 /* floating point reg. 0 */
|
||
#define FP4_REGNUM 72
|
||
|
||
/* compatibility with the rest of gdb. */
|
||
#define PC_REGNUM PCOQ_HEAD_REGNUM
|
||
#define NPC_REGNUM PCOQ_TAIL_REGNUM
|
||
|
||
/* When fetching register values from an inferior or a core file,
|
||
clean them up using this macro. BUF is a char pointer to
|
||
the raw value of the register in the registers[] array. */
|
||
|
||
#define CLEAN_UP_REGISTER_VALUE(regno, buf) \
|
||
do { \
|
||
if ((regno) == PCOQ_HEAD_REGNUM || (regno) == PCOQ_TAIL_REGNUM) \
|
||
(buf)[3] &= ~0x3; \
|
||
} while (0)
|
||
|
||
/* Define DO_REGISTERS_INFO() to do machine-specific formatting
|
||
of register dumps. */
|
||
|
||
#define DO_REGISTERS_INFO(_regnum, fp) pa_do_registers_info (_regnum, fp)
|
||
|
||
/* PA specific macro to see if the current instruction is nullified. */
|
||
#define INSTRUCTION_NULLIFIED ((int)read_register (IPSW_REGNUM) & 0x00200000)
|
||
|
||
/* Number of bytes of storage in the actual machine representation
|
||
for register N. On the PA-RISC, all regs are 4 bytes, including
|
||
the FP registers (they're accessed as two 4 byte halves). */
|
||
|
||
#define REGISTER_RAW_SIZE(N) 4
|
||
|
||
/* Total amount of space needed to store our copies of the machine's
|
||
register state, the array `registers'. */
|
||
#define REGISTER_BYTES (NUM_REGS * REGISTER_RAW_SIZE (1))
|
||
|
||
/* Index within `registers' of the first byte of the space for
|
||
register N. */
|
||
|
||
#define REGISTER_BYTE(N) (N) * 4
|
||
|
||
/* Number of bytes of storage in the program's representation
|
||
for register N. */
|
||
|
||
#define REGISTER_VIRTUAL_SIZE(N) REGISTER_RAW_SIZE(N)
|
||
|
||
/* Largest value REGISTER_RAW_SIZE can have. */
|
||
|
||
#define MAX_REGISTER_RAW_SIZE 4
|
||
|
||
/* Largest value REGISTER_VIRTUAL_SIZE can have. */
|
||
|
||
#define MAX_REGISTER_VIRTUAL_SIZE 8
|
||
|
||
/* Return the GDB type object for the "standard" data type
|
||
of data in register N. */
|
||
|
||
#define REGISTER_VIRTUAL_TYPE(N) \
|
||
((N) < FP4_REGNUM ? builtin_type_int : builtin_type_float)
|
||
|
||
/* Store the address of the place in which to copy the structure the
|
||
subroutine will return. This is called from call_function. */
|
||
|
||
#define STORE_STRUCT_RETURN(ADDR, SP) {write_register (28, (ADDR)); }
|
||
|
||
/* Extract from an array REGBUF containing the (raw) register state
|
||
a function return value of type TYPE, and copy that, in virtual format,
|
||
into VALBUF. */
|
||
|
||
#define EXTRACT_RETURN_VALUE(TYPE,REGBUF,VALBUF) \
|
||
memcpy (VALBUF, (REGBUF) + REGISTER_BYTE(TYPE_LENGTH(TYPE) > 4 ? \
|
||
FP4_REGNUM :28), TYPE_LENGTH (TYPE))
|
||
|
||
/* Write into appropriate registers a function return value
|
||
of type TYPE, given in virtual format. */
|
||
|
||
#define STORE_RETURN_VALUE(TYPE,VALBUF) \
|
||
write_register_bytes ((TYPE_LENGTH(TYPE) > 4 \
|
||
? REGISTER_BYTE (FP4_REGNUM) \
|
||
: REGISTER_BYTE (28)), \
|
||
(VALBUF), TYPE_LENGTH (TYPE))
|
||
|
||
/* Extract from an array REGBUF containing the (raw) register state
|
||
the address in which a function should return its structure value,
|
||
as a CORE_ADDR (or an expression that can be used as one). */
|
||
|
||
#define EXTRACT_STRUCT_VALUE_ADDRESS(REGBUF) (*(int *)((REGBUF) + 28))
|
||
|
||
/*
|
||
* This macro defines the register numbers (from REGISTER_NAMES) that
|
||
* are effectively unavailable to the user through ptrace(). It allows
|
||
* us to include the whole register set in REGISTER_NAMES (inorder to
|
||
* better support remote debugging). If it is used in
|
||
* fetch/store_inferior_registers() gdb will not complain about I/O errors
|
||
* on fetching these registers. If all registers in REGISTER_NAMES
|
||
* are available, then return false (0).
|
||
*/
|
||
|
||
#define CANNOT_STORE_REGISTER(regno) \
|
||
((regno) == 0) || \
|
||
((regno) == PCSQ_HEAD_REGNUM) || \
|
||
((regno) >= PCSQ_TAIL_REGNUM && (regno) < IPSW_REGNUM) || \
|
||
((regno) > IPSW_REGNUM && (regno) < FP4_REGNUM)
|
||
|
||
#define INIT_EXTRA_FRAME_INFO(fromleaf, frame) init_extra_frame_info (fromleaf, frame)
|
||
|
||
/* 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 PA-RISC, the frame's nominal address
|
||
is the address of a 4-byte word containing the calling frame's
|
||
address (previous FP). */
|
||
|
||
#define FRAME_CHAIN(thisframe) frame_chain (thisframe)
|
||
|
||
#define FRAME_CHAIN_VALID(chain, thisframe) \
|
||
frame_chain_valid (chain, thisframe)
|
||
|
||
#define FRAME_CHAIN_COMBINE(chain, thisframe) (chain)
|
||
|
||
/* Define other aspects of the stack frame. */
|
||
|
||
/* A macro that tells us whether the function invocation represented
|
||
by FI does not have a frame on the stack associated with it. If it
|
||
does not, FRAMELESS is set to 1, else 0. */
|
||
#define FRAMELESS_FUNCTION_INVOCATION(FI, FRAMELESS) \
|
||
(FRAMELESS) = frameless_function_invocation(FI)
|
||
|
||
#define FRAME_SAVED_PC(FRAME) frame_saved_pc (FRAME)
|
||
|
||
#define FRAME_ARGS_ADDRESS(fi) ((fi)->frame)
|
||
|
||
#define FRAME_LOCALS_ADDRESS(fi) ((fi)->frame)
|
||
/* Set VAL to the number of args passed to frame described by FI.
|
||
Can set VAL to -1, meaning no way to tell. */
|
||
|
||
/* We can't tell how many args there are
|
||
now that the C compiler delays popping them. */
|
||
#define FRAME_NUM_ARGS(val,fi) (val = -1)
|
||
|
||
/* Return number of bytes at start of arglist that are not really args. */
|
||
|
||
#define FRAME_ARGS_SKIP 0
|
||
|
||
#define FRAME_FIND_SAVED_REGS(frame_info, frame_saved_regs) \
|
||
hppa_frame_find_saved_regs (frame_info, &frame_saved_regs)
|
||
|
||
|
||
/* Things needed for making the inferior call functions. */
|
||
|
||
/* Push an empty stack frame, to record the current PC, etc. */
|
||
|
||
#define PUSH_DUMMY_FRAME push_dummy_frame ()
|
||
|
||
/* Discard from the stack the innermost frame,
|
||
restoring all saved registers. */
|
||
#define POP_FRAME hppa_pop_frame ()
|
||
|
||
/* This sequence of words is the instructions
|
||
|
||
; Call stack frame has already been built by gdb. Since we could be calling
|
||
; a varargs function, and we do not have the benefit of a stub to put things in
|
||
; the right place, we load the first 4 word of arguments into both the general
|
||
; and fp registers.
|
||
call_dummy
|
||
ldw -36(sp), arg0
|
||
ldw -40(sp), arg1
|
||
ldw -44(sp), arg2
|
||
ldw -48(sp), arg3
|
||
ldo -36(sp), r1
|
||
fldws 0(0, r1), fr4
|
||
fldds -4(0, r1), fr5
|
||
fldws -8(0, r1), fr6
|
||
fldds -12(0, r1), fr7
|
||
ldil 0, r22 ; target will be placed here.
|
||
ldo 0(r22), r22
|
||
ldsid (0,r22), r4
|
||
ldil 0, r1 ; _sr4export will be placed here.
|
||
ldo 0(r1), r1
|
||
ldsid (0,r1), r20
|
||
combt,=,n r4, r20, text_space ; If target is in data space, do a
|
||
ble 0(sr5, r22) ; "normal" procedure call
|
||
copy r31, r2
|
||
break 4, 8
|
||
mtsp r21, sr0
|
||
ble,n 0(sr0, r22)
|
||
text_space ; Otherwise, go through _sr4export,
|
||
ble (sr4, r1) ; which will return back here.
|
||
stw 31,-24(r30)
|
||
break 4, 8
|
||
mtsp r21, sr0
|
||
ble,n 0(sr0, r22)
|
||
nop ; To avoid kernel bugs
|
||
nop ; and keep the dummy 8 byte aligned
|
||
|
||
The dummy decides if the target is in text space or data space. If
|
||
it's in data space, there's no problem because the target can
|
||
return back to the dummy. However, if the target is in text space,
|
||
the dummy calls the secret, undocumented routine _sr4export, which
|
||
calls a function in text space and can return to any space. Instead
|
||
of including fake instructions to represent saved registers, we
|
||
know that the frame is associated with the call dummy and treat it
|
||
specially.
|
||
|
||
The trailing NOPs are needed to avoid a bug in HPUX, BSD and OSF1
|
||
kernels. If the memory at the location pointed to by the PC is
|
||
0xffffffff then a ptrace step call will fail (even if the instruction
|
||
is nullified).
|
||
|
||
The code to pop a dummy frame single steps three instructions
|
||
starting with the last mtsp. This includes the nullified "instruction"
|
||
following the ble (which is uninitialized junk). If the
|
||
"instruction" following the last BLE is 0xffffffff, then the ptrace
|
||
will fail and the dummy frame is not correctly popped.
|
||
|
||
By placing a NOP in the delay slot of the BLE instruction we can be
|
||
sure that we never try to execute a 0xffffffff instruction and
|
||
avoid the kernel bug. The second NOP is needed to keep the call
|
||
dummy 8 byte aligned. */
|
||
|
||
#define CALL_DUMMY {0x4BDA3FB9, 0x4BD93FB1, 0x4BD83FA9, 0x4BD73FA1,\
|
||
0x37C13FB9, 0x24201004, 0x2C391005, 0x24311006,\
|
||
0x2C291007, 0x22C00000, 0x36D60000, 0x02C010A4,\
|
||
0x20200000, 0x34210000, 0x002010b4, 0x82842022,\
|
||
0xe6c06000, 0x081f0242, 0x00010004, 0x00151820,\
|
||
0xe6c00002, 0xe4202000, 0x6bdf3fd1, 0x00010004,\
|
||
0x00151820, 0xe6c00002, 0x08000240, 0x08000240}
|
||
|
||
#define CALL_DUMMY_LENGTH 112
|
||
#define CALL_DUMMY_START_OFFSET 0
|
||
|
||
/*
|
||
* Insert the specified number of args and function address
|
||
* into a call sequence of the above form stored at DUMMYNAME.
|
||
*
|
||
* On the hppa we need to call the stack dummy through $$dyncall.
|
||
* Therefore our version of FIX_CALL_DUMMY takes an extra argument,
|
||
* real_pc, which is the location where gdb should start up the
|
||
* inferior to do the function call.
|
||
*/
|
||
|
||
#define FIX_CALL_DUMMY hppa_fix_call_dummy
|
||
|
||
CORE_ADDR hppa_fix_call_dummy();
|
||
|
||
#define PUSH_ARGUMENTS(nargs, args, sp, struct_return, struct_addr) \
|
||
sp = hppa_push_arguments(nargs, args, sp, struct_return, struct_addr)
|
||
|
||
/* The low two bits of the PC on the PA contain the privilege level. Some
|
||
genius implementing a (non-GCC) compiler apparently decided this means
|
||
that "addresses" in a text section therefore include a privilege level,
|
||
and thus symbol tables should contain these bits. This seems like a
|
||
bonehead thing to do--anyway, it seems to work for our purposes to just
|
||
ignore those bits. */
|
||
#define SMASH_TEXT_ADDRESS(addr) ((addr) &= ~0x3)
|
||
|
||
#define GDB_TARGET_IS_HPPA
|
||
|
||
#define BELIEVE_PCC_PROMOTION 1
|
||
|
||
/*
|
||
* Unwind table and descriptor.
|
||
*/
|
||
|
||
struct unwind_table_entry {
|
||
unsigned int region_start;
|
||
unsigned int region_end;
|
||
|
||
unsigned int Cannot_unwind : 1;
|
||
unsigned int Millicode : 1;
|
||
unsigned int Millicode_save_sr0 : 1;
|
||
unsigned int Region_description : 2;
|
||
unsigned int reserved1 : 1;
|
||
unsigned int Entry_SR : 1;
|
||
unsigned int Entry_FR : 4; /* number saved */
|
||
unsigned int Entry_GR : 5; /* number saved */
|
||
unsigned int Args_stored : 1;
|
||
unsigned int Variable_Frame : 1;
|
||
unsigned int Separate_Package_Body : 1;
|
||
unsigned int Frame_Extension_Millicode:1;
|
||
unsigned int Stack_Overflow_Check : 1;
|
||
unsigned int Two_Instruction_SP_Increment:1;
|
||
unsigned int Ada_Region : 1;
|
||
/* Use this field to store a stub unwind type. */
|
||
#define stub_type reserved2
|
||
unsigned int reserved2 : 4;
|
||
unsigned int Save_SP : 1;
|
||
unsigned int Save_RP : 1;
|
||
unsigned int Save_MRP_in_frame : 1;
|
||
unsigned int extn_ptr_defined : 1;
|
||
unsigned int Cleanup_defined : 1;
|
||
|
||
unsigned int MPE_XL_interrupt_marker: 1;
|
||
unsigned int HP_UX_interrupt_marker: 1;
|
||
unsigned int Large_frame : 1;
|
||
unsigned int reserved4 : 2;
|
||
unsigned int Total_frame_size : 27;
|
||
};
|
||
|
||
/* HP linkers also generate unwinds for various linker-generated stubs.
|
||
GDB reads in the stubs from the $UNWIND_END$ subspace, then
|
||
"converts" them into normal unwind entries using some of the reserved
|
||
fields to store the stub type. */
|
||
|
||
struct stub_unwind_entry
|
||
{
|
||
/* The offset within the executable for the associated stub. */
|
||
unsigned stub_offset;
|
||
|
||
/* The type of stub this unwind entry describes. */
|
||
char type;
|
||
|
||
/* Unknown. Not needed by GDB at this time. */
|
||
char prs_info;
|
||
|
||
/* Length (in instructions) of the associated stub. */
|
||
short stub_length;
|
||
};
|
||
|
||
/* Sizes (in bytes) of the native unwind entries. */
|
||
#define UNWIND_ENTRY_SIZE 16
|
||
#define STUB_UNWIND_ENTRY_SIZE 8
|
||
|
||
/* The gaps represent linker stubs used in MPE and space for future
|
||
expansion. */
|
||
enum unwind_stub_types
|
||
{
|
||
LONG_BRANCH = 1,
|
||
PARAMETER_RELOCATION = 2,
|
||
EXPORT = 10,
|
||
IMPORT = 11,
|
||
};
|
||
|
||
|
||
/* Info about the unwind table associated with an object file. This is hung
|
||
off of the objfile->obj_private pointer, and is allocated in the objfile's
|
||
psymbol obstack. This allows us to have unique unwind info for each
|
||
executable and shared library that we are debugging. */
|
||
|
||
struct obj_unwind_info {
|
||
struct unwind_table_entry *table; /* Pointer to unwind info */
|
||
struct unwind_table_entry *cache; /* Pointer to last entry we found */
|
||
int last; /* Index of last entry */
|
||
};
|
||
|
||
#define OBJ_UNWIND_INFO(obj) ((struct obj_unwind_info *)obj->obj_private)
|
||
|
||
extern CORE_ADDR target_read_pc PARAMS ((void));
|
||
extern void target_write_pc PARAMS ((CORE_ADDR));
|
||
|
||
#define TARGET_READ_PC() target_read_pc ()
|
||
#define TARGET_WRITE_PC(v) target_write_pc (v)
|