1996-09-28 08:59:13 +08:00
|
|
|
|
/* Target-dependent code for the NEC V850 for GDB, the GNU debugger.
|
1996-10-16 07:44:13 +08:00
|
|
|
|
Copyright 1996, Free Software Foundation, Inc.
|
1996-09-28 08:59:13 +08:00
|
|
|
|
|
|
|
|
|
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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
|
|
|
|
|
|
|
|
|
|
#include "defs.h"
|
|
|
|
|
#include "frame.h"
|
|
|
|
|
#include "inferior.h"
|
|
|
|
|
#include "obstack.h"
|
|
|
|
|
#include "target.h"
|
|
|
|
|
#include "value.h"
|
|
|
|
|
#include "bfd.h"
|
|
|
|
|
#include "gdb_string.h"
|
|
|
|
|
#include "gdbcore.h"
|
1996-10-22 05:45:55 +08:00
|
|
|
|
#include "symfile.h"
|
|
|
|
|
|
|
|
|
|
/* Info gleaned from scanning a function's prologue. */
|
|
|
|
|
|
1996-10-23 07:34:11 +08:00
|
|
|
|
struct pifsr /* Info about one saved reg */
|
|
|
|
|
{
|
|
|
|
|
int framereg; /* Frame reg (SP or FP) */
|
|
|
|
|
int offset; /* Offset from framereg */
|
|
|
|
|
int reg; /* Saved register number */
|
|
|
|
|
};
|
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
struct prologue_info
|
1996-10-12 06:50:42 +08:00
|
|
|
|
{
|
|
|
|
|
int framereg;
|
1996-10-22 05:45:55 +08:00
|
|
|
|
int frameoffset;
|
|
|
|
|
int start_function;
|
1996-10-23 07:34:11 +08:00
|
|
|
|
struct pifsr *pifsrs;
|
1996-10-22 05:45:55 +08:00
|
|
|
|
};
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
static CORE_ADDR v850_scan_prologue PARAMS ((CORE_ADDR pc,
|
|
|
|
|
struct prologue_info *fs));
|
1996-10-22 05:45:55 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* Function: scan_prologue
|
|
|
|
|
Scan the prologue of the function that contains PC, and record what
|
|
|
|
|
we find in PI. PI->fsr must be zeroed by the called. Returns the
|
|
|
|
|
pc after the prologue. Note that the addresses saved in pi->fsr
|
|
|
|
|
are actually just frame relative (negative offsets from the frame
|
|
|
|
|
pointer). This is because we don't know the actual value of the
|
|
|
|
|
frame pointer yet. In some circumstances, the frame pointer can't
|
|
|
|
|
be determined till after we have scanned the prologue. */
|
1996-10-22 05:45:55 +08:00
|
|
|
|
|
|
|
|
|
static CORE_ADDR
|
1996-11-28 03:10:07 +08:00
|
|
|
|
v850_scan_prologue (pc, pi)
|
1996-10-22 05:45:55 +08:00
|
|
|
|
CORE_ADDR pc;
|
|
|
|
|
struct prologue_info *pi;
|
|
|
|
|
{
|
|
|
|
|
CORE_ADDR func_addr, prologue_end, current_pc;
|
1996-10-23 07:34:11 +08:00
|
|
|
|
struct pifsr *pifsr;
|
1996-10-22 05:45:55 +08:00
|
|
|
|
int fp_used;
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
|
|
|
|
/* First, figure out the bounds of the prologue so that we can limit the
|
|
|
|
|
search to something reasonable. */
|
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
if (find_pc_partial_function (pc, NULL, &func_addr, NULL))
|
1996-10-12 06:50:42 +08:00
|
|
|
|
{
|
1996-10-22 05:45:55 +08:00
|
|
|
|
struct symtab_and_line sal;
|
|
|
|
|
|
1996-10-12 06:50:42 +08:00
|
|
|
|
sal = find_pc_line (func_addr, 0);
|
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
if (func_addr == entry_point_address ())
|
|
|
|
|
pi->start_function = 1;
|
|
|
|
|
else
|
|
|
|
|
pi->start_function = 0;
|
|
|
|
|
|
1996-10-23 07:34:11 +08:00
|
|
|
|
#if 0
|
1996-10-16 07:44:13 +08:00
|
|
|
|
if (sal.line == 0)
|
1996-10-22 05:45:55 +08:00
|
|
|
|
prologue_end = pc;
|
1996-10-16 07:44:13 +08:00
|
|
|
|
else
|
|
|
|
|
prologue_end = sal.end;
|
1996-10-23 07:34:11 +08:00
|
|
|
|
#else
|
|
|
|
|
prologue_end = pc;
|
|
|
|
|
#endif
|
1996-10-12 06:50:42 +08:00
|
|
|
|
}
|
|
|
|
|
else
|
1996-10-22 05:45:55 +08:00
|
|
|
|
{ /* We're in the boondocks */
|
|
|
|
|
func_addr = pc - 100;
|
|
|
|
|
prologue_end = pc;
|
|
|
|
|
}
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
prologue_end = min (prologue_end, pc);
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
|
|
|
|
/* Now, search the prologue looking for instructions that setup fp, save
|
1996-10-22 05:45:55 +08:00
|
|
|
|
rp, adjust sp and such. We also record the frame offset of any saved
|
|
|
|
|
registers. */
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
pi->frameoffset = 0;
|
|
|
|
|
pi->framereg = SP_REGNUM;
|
|
|
|
|
fp_used = 0;
|
1996-10-23 07:34:11 +08:00
|
|
|
|
pifsr = pi->pifsrs;
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
|
|
|
|
for (current_pc = func_addr; current_pc < prologue_end; current_pc += 2)
|
|
|
|
|
{
|
|
|
|
|
int insn;
|
|
|
|
|
|
1996-10-17 10:12:24 +08:00
|
|
|
|
insn = read_memory_unsigned_integer (current_pc, 2);
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-23 07:34:11 +08:00
|
|
|
|
if ((insn & 0x07c0) == 0x0780 /* jarl or jr */
|
|
|
|
|
|| (insn & 0xffe0) == 0x0060 /* jmp */
|
|
|
|
|
|| (insn & 0x0780) == 0x0580) /* branch */
|
|
|
|
|
break; /* Ran into end of prologue */
|
1996-10-12 06:50:42 +08:00
|
|
|
|
if ((insn & 0xffe0) == ((SP_REGNUM << 11) | 0x0240)) /* add <imm>,sp */
|
1996-10-22 05:45:55 +08:00
|
|
|
|
pi->frameoffset = ((insn & 0x1f) ^ 0x10) - 0x10;
|
1996-10-12 06:50:42 +08:00
|
|
|
|
else if (insn == ((SP_REGNUM << 11) | 0x0600 | SP_REGNUM)) /* addi <imm>,sp,sp */
|
1996-10-22 05:45:55 +08:00
|
|
|
|
pi->frameoffset = read_memory_integer (current_pc + 2, 2);
|
|
|
|
|
else if (insn == ((FP_REGNUM << 11) | 0x0000 | 12)) /* mov r12,fp */
|
1996-10-12 06:50:42 +08:00
|
|
|
|
{
|
1996-10-22 05:45:55 +08:00
|
|
|
|
fp_used = 1;
|
|
|
|
|
pi->framereg = FP_REGNUM;
|
|
|
|
|
}
|
|
|
|
|
else if ((insn & 0x07ff) == (0x0760 | SP_REGNUM) /* st.w <reg>,<offset>[sp] */
|
|
|
|
|
|| (fp_used
|
|
|
|
|
&& (insn & 0x07ff) == (0x0760 | FP_REGNUM))) /* st.w <reg>,<offset>[fp] */
|
1996-10-23 07:34:11 +08:00
|
|
|
|
if (pifsr)
|
1996-10-22 05:45:55 +08:00
|
|
|
|
{
|
1996-10-23 07:34:11 +08:00
|
|
|
|
pifsr->framereg = insn & 0x1f;
|
|
|
|
|
pifsr->reg = (insn >> 11) & 0x1f; /* Extract <reg> */
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-23 07:34:11 +08:00
|
|
|
|
pifsr->offset = read_memory_integer (current_pc + 2, 2) & ~1;
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-23 07:34:11 +08:00
|
|
|
|
pifsr++;
|
1996-10-22 05:45:55 +08:00
|
|
|
|
}
|
1996-10-17 10:12:24 +08:00
|
|
|
|
|
|
|
|
|
if ((insn & 0x0780) >= 0x0600) /* Four byte instruction? */
|
|
|
|
|
current_pc += 2;
|
1996-10-12 06:50:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
1996-10-23 07:34:11 +08:00
|
|
|
|
if (pifsr)
|
|
|
|
|
pifsr->framereg = 0; /* Tie off last entry */
|
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
return current_pc;
|
1996-10-12 06:50:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* Function: init_extra_frame_info
|
|
|
|
|
Setup the frame's frame pointer, pc, and frame addresses for saved
|
|
|
|
|
registers. Most of the work is done in scan_prologue().
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
Note that when we are called for the last frame (currently active frame),
|
|
|
|
|
that fi->pc and fi->frame will already be setup. However, fi->frame will
|
|
|
|
|
be valid only if this routine uses FP. For previous frames, fi-frame will
|
|
|
|
|
always be correct (since that is derived from v850_frame_chain ()).
|
|
|
|
|
|
|
|
|
|
We can be called with the PC in the call dummy under two circumstances.
|
|
|
|
|
First, during normal backtracing, second, while figuring out the frame
|
1996-11-28 03:10:07 +08:00
|
|
|
|
pointer just prior to calling the target function (see run_stack_dummy). */
|
1996-10-22 05:45:55 +08:00
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
v850_init_extra_frame_info (fi)
|
1996-10-12 06:50:42 +08:00
|
|
|
|
struct frame_info *fi;
|
|
|
|
|
{
|
1996-10-22 05:45:55 +08:00
|
|
|
|
struct prologue_info pi;
|
1996-10-23 07:34:11 +08:00
|
|
|
|
struct pifsr pifsrs[NUM_REGS + 1], *pifsr;
|
1996-10-22 05:45:55 +08:00
|
|
|
|
int reg;
|
|
|
|
|
|
|
|
|
|
if (fi->next)
|
|
|
|
|
fi->pc = FRAME_SAVED_PC (fi->next);
|
|
|
|
|
|
|
|
|
|
memset (fi->fsr.regs, '\000', sizeof fi->fsr.regs);
|
|
|
|
|
|
|
|
|
|
/* The call dummy doesn't save any registers on the stack, so we can return
|
|
|
|
|
now. */
|
1996-11-28 03:10:07 +08:00
|
|
|
|
if (PC_IN_CALL_DUMMY (fi->pc, fi->frame, fi->frame))
|
1996-10-22 05:45:55 +08:00
|
|
|
|
return;
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
1996-10-23 07:34:11 +08:00
|
|
|
|
pi.pifsrs = pifsrs;
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
v850_scan_prologue (fi->pc, &pi);
|
1996-10-22 05:45:55 +08:00
|
|
|
|
|
1996-10-23 07:34:11 +08:00
|
|
|
|
if (!fi->next && pi.framereg == SP_REGNUM)
|
|
|
|
|
fi->frame = read_register (pi.framereg) - pi.frameoffset;
|
1996-10-22 05:45:55 +08:00
|
|
|
|
|
1996-10-23 07:34:11 +08:00
|
|
|
|
for (pifsr = pifsrs; pifsr->framereg; pifsr++)
|
|
|
|
|
{
|
|
|
|
|
fi->fsr.regs[pifsr->reg] = pifsr->offset + fi->frame;
|
|
|
|
|
|
|
|
|
|
if (pifsr->framereg == SP_REGNUM)
|
|
|
|
|
fi->fsr.regs[pifsr->reg] += pi.frameoffset;
|
|
|
|
|
}
|
1996-10-12 06:50:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* Function: frame_chain
|
|
|
|
|
Figure out the frame prior to FI. Unfortunately, this involves
|
|
|
|
|
scanning the prologue of the caller, which will also be done
|
|
|
|
|
shortly by v850_init_extra_frame_info. For the dummy frame, we
|
|
|
|
|
just return the stack pointer that was in use at the time the
|
|
|
|
|
function call was made. */
|
1996-10-22 05:45:55 +08:00
|
|
|
|
|
1996-10-12 06:50:42 +08:00
|
|
|
|
CORE_ADDR
|
|
|
|
|
v850_frame_chain (fi)
|
|
|
|
|
struct frame_info *fi;
|
|
|
|
|
{
|
1996-10-22 05:45:55 +08:00
|
|
|
|
struct prologue_info pi;
|
1996-11-28 03:10:07 +08:00
|
|
|
|
CORE_ADDR callers_pc, fp;
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
|
|
|
|
/* First, find out who called us */
|
1996-10-16 07:44:13 +08:00
|
|
|
|
callers_pc = FRAME_SAVED_PC (fi);
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* If caller is a call-dummy, then our FP bears no relation to his FP! */
|
|
|
|
|
fp = v850_find_callers_reg (fi, FP_REGNUM);
|
|
|
|
|
if (PC_IN_CALL_DUMMY(callers_pc, fp, fp))
|
|
|
|
|
return fp; /* caller is call-dummy: return oldest value of FP */
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* Caller is NOT a call-dummy, so everything else should just work.
|
|
|
|
|
Even if THIS frame is a call-dummy! */
|
1996-10-23 07:34:11 +08:00
|
|
|
|
pi.pifsrs = NULL;
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
v850_scan_prologue (callers_pc, &pi);
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
if (pi.start_function)
|
|
|
|
|
return 0; /* Don't chain beyond the start function */
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
if (pi.framereg == FP_REGNUM)
|
|
|
|
|
return v850_find_callers_reg (fi, pi.framereg);
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
return fi->frame - pi.frameoffset;
|
|
|
|
|
}
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* Function: find_callers_reg
|
|
|
|
|
Find REGNUM on the stack. Otherwise, it's in an active register.
|
|
|
|
|
One thing we might want to do here is to check REGNUM against the
|
|
|
|
|
clobber mask, and somehow flag it as invalid if it isn't saved on
|
|
|
|
|
the stack somewhere. This would provide a graceful failure mode
|
|
|
|
|
when trying to get the value of caller-saves registers for an inner
|
|
|
|
|
frame. */
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
CORE_ADDR
|
|
|
|
|
v850_find_callers_reg (fi, regnum)
|
|
|
|
|
struct frame_info *fi;
|
|
|
|
|
int regnum;
|
|
|
|
|
{
|
|
|
|
|
for (; fi; fi = fi->next)
|
1996-11-28 03:10:07 +08:00
|
|
|
|
if (PC_IN_CALL_DUMMY (fi->pc, fi->frame, fi->frame))
|
|
|
|
|
return generic_read_register_dummy (fi->pc, fi->frame, regnum);
|
1996-10-22 05:45:55 +08:00
|
|
|
|
else if (fi->fsr.regs[regnum] != 0)
|
1996-11-28 03:10:07 +08:00
|
|
|
|
return read_memory_unsigned_integer (fi->fsr.regs[regnum],
|
|
|
|
|
REGISTER_RAW_SIZE(regnum));
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
return read_register (regnum);
|
1996-10-12 06:50:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* Function: skip_prologue
|
|
|
|
|
Return the address of the first code past the prologue of the function. */
|
|
|
|
|
|
1996-10-12 06:50:42 +08:00
|
|
|
|
CORE_ADDR
|
|
|
|
|
v850_skip_prologue (pc)
|
|
|
|
|
CORE_ADDR pc;
|
|
|
|
|
{
|
|
|
|
|
CORE_ADDR func_addr, func_end;
|
|
|
|
|
|
|
|
|
|
/* See what the symbol table says */
|
|
|
|
|
|
|
|
|
|
if (find_pc_partial_function (pc, NULL, &func_addr, &func_end))
|
|
|
|
|
{
|
|
|
|
|
struct symtab_and_line sal;
|
|
|
|
|
|
|
|
|
|
sal = find_pc_line (func_addr, 0);
|
|
|
|
|
|
1996-10-16 07:44:13 +08:00
|
|
|
|
if (sal.line != 0 && sal.end < func_end)
|
1996-10-12 06:50:42 +08:00
|
|
|
|
return sal.end;
|
|
|
|
|
else
|
1996-10-16 07:44:13 +08:00
|
|
|
|
/* Either there's no line info, or the line after the prologue is after
|
|
|
|
|
the end of the function. In this case, there probably isn't a
|
|
|
|
|
prologue. */
|
1996-10-12 06:50:42 +08:00
|
|
|
|
return pc;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* We can't find the start of this function, so there's nothing we can do. */
|
|
|
|
|
return pc;
|
|
|
|
|
}
|
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* Function: pop_frame
|
|
|
|
|
This routine gets called when either the user uses the `return'
|
|
|
|
|
command, or the call dummy breakpoint gets hit. */
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
|
|
|
|
void
|
1996-10-12 06:50:42 +08:00
|
|
|
|
v850_pop_frame (frame)
|
|
|
|
|
struct frame_info *frame;
|
|
|
|
|
{
|
|
|
|
|
int regnum;
|
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
if (PC_IN_CALL_DUMMY(frame->pc, frame->frame, frame->frame))
|
|
|
|
|
generic_pop_dummy_frame ();
|
1996-10-22 05:45:55 +08:00
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
write_register (PC_REGNUM, FRAME_SAVED_PC (frame));
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
for (regnum = 0; regnum < NUM_REGS; regnum++)
|
|
|
|
|
if (frame->fsr.regs[regnum] != 0)
|
|
|
|
|
write_register (regnum,
|
1996-11-28 03:10:07 +08:00
|
|
|
|
read_memory_unsigned_integer (frame->fsr.regs[regnum],
|
|
|
|
|
REGISTER_RAW_SIZE(regnum)));
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
1996-10-22 05:45:55 +08:00
|
|
|
|
write_register (SP_REGNUM, FRAME_FP (frame));
|
|
|
|
|
}
|
1996-10-12 06:50:42 +08:00
|
|
|
|
|
|
|
|
|
flush_cached_frames ();
|
|
|
|
|
}
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* Function: push_arguments
|
|
|
|
|
Setup arguments and RP for a call to the target. First four args
|
|
|
|
|
go in R6->R9, subsequent args go into sp + 16 -> sp + ... Structs
|
|
|
|
|
are passed by reference. 64 bit quantities (doubles and long
|
|
|
|
|
longs) may be split between the regs and the stack. When calling a
|
|
|
|
|
function that returns a struct, a pointer to the struct is passed
|
|
|
|
|
in as a secret first argument (always in R6).
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
Stack space for the args has NOT been allocated: that job is up to us.
|
|
|
|
|
*/
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
|
|
|
|
CORE_ADDR
|
|
|
|
|
v850_push_arguments (nargs, args, sp, struct_return, struct_addr)
|
|
|
|
|
int nargs;
|
|
|
|
|
value_ptr *args;
|
|
|
|
|
CORE_ADDR sp;
|
|
|
|
|
unsigned char struct_return;
|
|
|
|
|
CORE_ADDR struct_addr;
|
|
|
|
|
{
|
|
|
|
|
int argreg;
|
|
|
|
|
int argnum;
|
1996-11-28 03:10:07 +08:00
|
|
|
|
int len = 0;
|
|
|
|
|
int stack_offset;
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* First, just for safety, make sure stack is aligned */
|
|
|
|
|
sp &= ~3;
|
|
|
|
|
|
|
|
|
|
/* Now make space on the stack for the args. */
|
|
|
|
|
for (argnum = 0; argnum < nargs; argnum++)
|
|
|
|
|
len += ((TYPE_LENGTH(VALUE_TYPE(args[argnum])) + 3) & ~3);
|
|
|
|
|
sp -= len; /* possibly over-allocating, but it works... */
|
|
|
|
|
/* (you might think we could allocate 16 bytes */
|
|
|
|
|
/* less, but the ABI seems to use it all! ) */
|
1996-10-16 16:57:35 +08:00
|
|
|
|
argreg = ARG0_REGNUM;
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* the struct_return pointer occupies the first parameter-passing reg */
|
1996-10-16 07:44:13 +08:00
|
|
|
|
if (struct_return)
|
|
|
|
|
write_register (argreg++, struct_addr);
|
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
stack_offset = 16;
|
|
|
|
|
/* The offset onto the stack at which we will start copying parameters
|
|
|
|
|
(after the registers are used up) begins at 16 rather than at zero.
|
|
|
|
|
I don't really know why, that's just the way it seems to work. */
|
|
|
|
|
|
|
|
|
|
/* Now load as many as possible of the first arguments into
|
|
|
|
|
registers, and push the rest onto the stack. There are 16 bytes
|
|
|
|
|
in four registers available. Loop thru args from first to last. */
|
1996-10-16 07:44:13 +08:00
|
|
|
|
for (argnum = 0; argnum < nargs; argnum++)
|
|
|
|
|
{
|
|
|
|
|
int len;
|
|
|
|
|
char *val;
|
1996-11-28 03:10:07 +08:00
|
|
|
|
char valbuf[REGISTER_RAW_SIZE(ARG0_REGNUM)];
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
|
|
|
|
if (TYPE_CODE (VALUE_TYPE (*args)) == TYPE_CODE_STRUCT
|
|
|
|
|
&& TYPE_LENGTH (VALUE_TYPE (*args)) > 8)
|
|
|
|
|
{
|
|
|
|
|
store_address (valbuf, 4, VALUE_ADDRESS (*args));
|
|
|
|
|
len = 4;
|
|
|
|
|
val = valbuf;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
len = TYPE_LENGTH (VALUE_TYPE (*args));
|
|
|
|
|
val = (char *)VALUE_CONTENTS (*args);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
while (len > 0)
|
1996-10-16 16:57:35 +08:00
|
|
|
|
if (argreg <= ARGLAST_REGNUM)
|
1996-10-16 07:44:13 +08:00
|
|
|
|
{
|
|
|
|
|
CORE_ADDR regval;
|
|
|
|
|
|
|
|
|
|
regval = extract_address (val, REGISTER_RAW_SIZE (argreg));
|
|
|
|
|
write_register (argreg, regval);
|
|
|
|
|
|
|
|
|
|
len -= REGISTER_RAW_SIZE (argreg);
|
|
|
|
|
val += REGISTER_RAW_SIZE (argreg);
|
|
|
|
|
argreg++;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
1996-11-28 03:10:07 +08:00
|
|
|
|
write_memory (sp + stack_offset, val, 4);
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
|
|
|
|
len -= 4;
|
|
|
|
|
val += 4;
|
1996-11-28 03:10:07 +08:00
|
|
|
|
stack_offset += 4;
|
1996-10-16 07:44:13 +08:00
|
|
|
|
}
|
|
|
|
|
args++;
|
|
|
|
|
}
|
1996-11-28 03:10:07 +08:00
|
|
|
|
return sp;
|
|
|
|
|
}
|
1996-10-16 07:44:13 +08:00
|
|
|
|
|
1996-11-28 03:10:07 +08:00
|
|
|
|
/* Function: push_return_address (pc)
|
|
|
|
|
Set up the return address for the inferior function call.
|
|
|
|
|
Needed for targets where we don't actually execute a JSR/BSR instruction */
|
|
|
|
|
|
|
|
|
|
CORE_ADDR
|
|
|
|
|
v850_push_return_address (pc, sp)
|
|
|
|
|
CORE_ADDR pc;
|
|
|
|
|
CORE_ADDR sp;
|
|
|
|
|
{
|
1996-11-28 03:31:26 +08:00
|
|
|
|
write_register (RP_REGNUM, CALL_DUMMY_ADDRESS ());
|
1996-10-16 07:44:13 +08:00
|
|
|
|
return sp;
|
|
|
|
|
}
|
1996-11-28 03:10:07 +08:00
|
|
|
|
|
|
|
|
|
/* Function: frame_saved_pc
|
|
|
|
|
Find the caller of this frame. We do this by seeing if RP_REGNUM
|
|
|
|
|
is saved in the stack anywhere, otherwise we get it from the
|
|
|
|
|
registers. If the inner frame is a dummy frame, return its PC
|
|
|
|
|
instead of RP, because that's where "caller" of the dummy-frame
|
|
|
|
|
will be found. */
|
|
|
|
|
|
|
|
|
|
CORE_ADDR
|
|
|
|
|
v850_frame_saved_pc (fi)
|
|
|
|
|
struct frame_info *fi;
|
|
|
|
|
{
|
|
|
|
|
if (PC_IN_CALL_DUMMY(fi->pc, fi->frame, fi->frame))
|
|
|
|
|
return generic_read_register_dummy(fi->pc, fi->frame, PC_REGNUM);
|
|
|
|
|
else
|
|
|
|
|
return v850_find_callers_reg (fi, RP_REGNUM);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
get_saved_register (raw_buffer, optimized, addrp, frame, regnum, lval)
|
|
|
|
|
char *raw_buffer;
|
|
|
|
|
int *optimized;
|
|
|
|
|
CORE_ADDR *addrp;
|
|
|
|
|
struct frame_info *frame;
|
|
|
|
|
int regnum;
|
|
|
|
|
enum lval_type *lval;
|
|
|
|
|
{
|
|
|
|
|
generic_get_saved_register (raw_buffer, optimized, addrp,
|
|
|
|
|
frame, regnum, lval);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Function: fix_call_dummy
|
|
|
|
|
Pokes the callee function's address into the CALL_DUMMY assembly stub.
|
|
|
|
|
Assumes that the CALL_DUMMY looks like this:
|
|
|
|
|
jarl <offset24>, r31
|
|
|
|
|
trap
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
v850_fix_call_dummy (dummy, sp, fun, nargs, args, type, gcc_p)
|
|
|
|
|
char *dummy;
|
|
|
|
|
CORE_ADDR sp;
|
|
|
|
|
CORE_ADDR fun;
|
|
|
|
|
int nargs;
|
|
|
|
|
value_ptr *args;
|
|
|
|
|
struct type *type;
|
|
|
|
|
int gcc_p;
|
|
|
|
|
{
|
|
|
|
|
long offset24;
|
|
|
|
|
|
1996-11-28 03:31:26 +08:00
|
|
|
|
offset24 = (long) fun - (long) entry_point_address ();
|
1996-11-28 03:10:07 +08:00
|
|
|
|
offset24 &= 0x3fffff;
|
|
|
|
|
offset24 |= 0xff800000; /* jarl <offset24>, r31 */
|
|
|
|
|
|
|
|
|
|
store_unsigned_integer ((unsigned int *)&dummy[2], 2, offset24 & 0xffff);
|
|
|
|
|
store_unsigned_integer ((unsigned int *)&dummy[0], 2, offset24 >> 16);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
1996-09-28 08:59:13 +08:00
|
|
|
|
void
|
1996-11-28 03:10:07 +08:00
|
|
|
|
_initialize_v850_tdep ()
|
1996-09-28 08:59:13 +08:00
|
|
|
|
{
|
|
|
|
|
tm_print_insn = print_insn_v850;
|
|
|
|
|
}
|