mirror of
https://github.com/darlinghq/darling-gdb.git
synced 2024-11-25 21:19:54 +00:00
197e01b6dc
* arm-tdep.c: * ia64-tdep.c: * i386-tdep.c: * hpread.c: * hppa-tdep.c: * hppa-hpux-tdep.c: * gnu-nat.c: * gdbtypes.c: * gdbarch.h: * gdbarch.c: * eval.c: * dwarf2read.c: * dbxread.c: * copying: * symfile.c: * stabsread.c: * sh64-tdep.c: * sh-tdep.c: * s390-tdep.c: * rs6000-tdep.c: * remote.c: * remote-mips.c: * mips-tdep.c: * mdebugread.c: * linux-nat.c: * infrun.c: * xcoffread.c: * win32-nat.c: * valops.c: * utils.c: * tracepoint.c: * target.c: * symtab.c: * c-exp.y: * ada-valprint.c: * ada-typeprint.c: * ada-lex.l: * ada-lang.h: * ada-lang.c: * ada-exp.y: * alphafbsd-tdep.c: * alphabsd-tdep.h: * alphabsd-tdep.c: * alphabsd-nat.c: * alpha-tdep.h: * alpha-tdep.c: * alpha-osf1-tdep.c: * alpha-nat.c: * alpha-mdebug-tdep.c: * alpha-linux-tdep.c: * alpha-linux-nat.c: * aix-thread.c: * abug-rom.c: * arch-utils.c: * annotate.h: * annotate.c: * amd64obsd-tdep.c: * amd64obsd-nat.c: * amd64nbsd-tdep.c: * amd64nbsd-nat.c: * amd64fbsd-tdep.c: * amd64fbsd-nat.c: * amd64bsd-nat.c: * amd64-tdep.h: * amd64-tdep.c: * amd64-sol2-tdep.c: * amd64-nat.h: * amd64-nat.c: * amd64-linux-tdep.c: * amd64-linux-nat.c: * alphanbsd-tdep.c: * block.h: * block.c: * bfd-target.h: * bfd-target.c: * bcache.h: * bcache.c: * ax.h: * ax-general.c: * ax-gdb.h: * ax-gdb.c: * avr-tdep.c: * auxv.h: * auxv.c: * armnbsd-tdep.c: * armnbsd-nat.c: * arm-tdep.h: * arm-linux-nat.c: * arch-utils.h: * charset.c: * call-cmds.h: * c-valprint.c: * c-typeprint.c: * c-lang.h: * c-lang.c: * buildsym.h: * buildsym.c: * bsd-uthread.h: * bsd-uthread.c: * bsd-kvm.h: * bsd-kvm.c: * breakpoint.h: * core-regset.c: * core-aout.c: * completer.h: * completer.c: * complaints.h: * complaints.c: * command.h: * coffread.c: * coff-solib.h: * coff-solib.c: * coff-pe-read.h: * coff-pe-read.c: * cli-out.h: * cli-out.c: * charset.h: * dink32-rom.c: * dictionary.h: * dictionary.c: * demangle.c: * defs.h: * dcache.h: * dcache.c: * d10v-tdep.c: * cpu32bug-rom.c: * cp-valprint.c: * cp-support.h: * cp-support.c: * cp-namespace.c: * cp-abi.h: * cp-abi.c: * corelow.c: * corefile.c: * environ.c: * elfread.c: * dwarfread.c: * dwarf2loc.c: * dwarf2expr.h: * dwarf2expr.c: * dwarf2-frame.h: * dwarf2-frame.c: * dve3900-rom.c: * dummy-frame.h: * dummy-frame.c: * dsrec.c: * doublest.h: * doublest.c: * disasm.h: * disasm.c: * fork-child.c: * findvar.c: * fbsd-nat.h: * fbsd-nat.c: * f-valprint.c: * f-typeprint.c: * f-lang.h: * f-lang.c: * expression.h: * expprint.c: * exec.h: * exec.c: * exceptions.h: * exceptions.c: * event-top.h: * event-top.c: * event-loop.h: * event-loop.c: * gdb.c: * gdb-stabs.h: * gdb-events.h: * gdb-events.c: * gcore.c: * frv-tdep.h: * frv-tdep.c: * frv-linux-tdep.c: * frame.h: * frame.c: * frame-unwind.h: * frame-unwind.c: * frame-base.h: * frame-base.c: * gdb_vfork.h: * gdb_thread_db.h: * gdb_string.h: * gdb_stat.h: * gdb_regex.h: * gdb_ptrace.h: * gdb_proc_service.h: * gdb_obstack.h: * gdb_locale.h: * gdb_dirent.h: * gdb_curses.h: * gdb_assert.h: * gdbarch.sh: * gdb.h: * hpux-thread.c: * hppabsd-nat.c: * hppa-tdep.h: * hpacc-abi.c: * h8300-tdep.c: * gregset.h: * go32-nat.c: * gnu-v3-abi.c: * gnu-v2-abi.h: * gnu-v2-abi.c: * gnu-nat.h: * glibc-tdep.c: * gdbtypes.h: * gdbcore.h: * gdbcmd.h: * i386nbsd-tdep.c: * i386nbsd-nat.c: * i386gnu-tdep.c: * i386gnu-nat.c: * i386fbsd-tdep.c: * i386fbsd-nat.c: * i386bsd-tdep.c: * i386bsd-nat.h: * i386bsd-nat.c: * i386-tdep.h: * i386-sol2-nat.c: * i386-nto-tdep.c: * i386-nat.c: * i386-linux-tdep.h: * i386-linux-tdep.c: * i386-linux-nat.c: * i386-cygwin-tdep.c: * inf-ttrace.c: * inf-ptrace.h: * inf-ptrace.c: * inf-loop.h: * inf-loop.c: * inf-child.h: * inf-child.c: * ia64-tdep.h: * ia64-linux-nat.c: * i387-tdep.h: * i387-tdep.c: * i386v4-nat.c: * i386v-nat.c: * i386obsd-tdep.c: * i386obsd-nat.c: * kod.c: * jv-valprint.c: * jv-typeprint.c: * jv-lang.h: * jv-lang.c: * irix5-nat.c: * iq2000-tdep.c: * interps.h: * interps.c: * inftarg.c: * inflow.h: * inflow.c: * inferior.h: * infcmd.c: * infcall.h: * infcall.c: * inf-ttrace.h: * m32r-tdep.h: * m32r-tdep.c: * m32r-rom.c: * m32r-linux-tdep.c: * m32r-linux-nat.c: * m2-valprint.c: * m2-typeprint.c: * m2-lang.h: * m2-lang.c: * lynx-nat.c: * linux-thread-db.c: * linux-nat.h: * linespec.c: * libunwind-frame.h: * libunwind-frame.c: * language.h: * language.c: * macroexp.c: * macrocmd.c: * m88kbsd-nat.c: * m88k-tdep.h: * m88k-tdep.c: * m68klinux-tdep.c: * m68klinux-nat.c: * m68kbsd-tdep.c: * m68kbsd-nat.c: * m68k-tdep.h: * m68k-tdep.c: * mips-linux-nat.c: * mips-irix-tdep.c: * minsyms.c: * memattr.h: * memattr.c: * mem-break.c: * mdebugread.h: * main.h: * main.c: * macrotab.h: * macrotab.c: * macroscope.h: * macroscope.c: * macroexp.h: * nbsd-tdep.c: * mt-tdep.c: * monitor.h: * monitor.c: * mn10300-tdep.h: * mn10300-tdep.c: * mn10300-linux-tdep.c: * mipsv4-nat.c: * mipsread.c: * mipsnbsd-tdep.h: * mipsnbsd-tdep.c: * mipsnbsd-nat.c: * mips64obsd-tdep.c: * mips64obsd-nat.c: * mips-tdep.h: * mips-mdebug-tdep.c: * mips-linux-tdep.c: * osabi.h: * osabi.c: * ocd.h: * ocd.c: * observer.c: * objfiles.h: * objfiles.c: * objc-lang.h: * objc-lang.c: * objc-exp.y: * nto-tdep.h: * nto-tdep.c: * nto-procfs.c: * nlmread.c: * nbsd-tdep.h: * ppcobsd-tdep.c: * ppcobsd-nat.c: * ppcnbsd-tdep.h: * ppcnbsd-tdep.c: * ppcnbsd-nat.c: * ppcbug-rom.c: * ppc-tdep.h: * ppc-sysv-tdep.c: * ppc-linux-tdep.c: * ppc-linux-nat.c: * ppc-bdm.c: * parser-defs.h: * parse.c: * p-valprint.c: * p-typeprint.c: * p-lang.h: * p-lang.c: * remote-fileio.h: * remote-fileio.c: * remote-est.c: * remote-e7000.c: * regset.h: * regset.c: * reggroups.h: * reggroups.c: * regcache.h: * regcache.c: * proc-why.c: * proc-service.c: * proc-events.c: * printcmd.c: * ppcobsd-tdep.h: * sentinel-frame.h: * sentinel-frame.c: * scm-valprint.c: * scm-tags.h: * scm-lang.h: * scm-lang.c: * scm-exp.c: * s390-tdep.h: * rom68k-rom.c: * remote.h: * remote-utils.c: * remote-st.c: * remote-sim.c: * remote-sds.c: * remote-rdp.c: * remote-rdi.c: * remote-hms.c: * sim-regno.h: * shnbsd-tdep.h: * shnbsd-tdep.c: * shnbsd-nat.c: * sh-tdep.h: * serial.h: * serial.c: * ser-unix.h: * ser-unix.c: * ser-tcp.c: * ser-pipe.c: * ser-go32.c: * ser-e7kpc.c: * ser-base.h: * ser-base.c: * solib.c: * solib-svr4.h: * solib-svr4.c: * solib-sunos.c: * solib-som.h: * solib-som.c: * solib-pa64.h: * solib-pa64.c: * solib-osf.c: * solib-null.c: * solib-legacy.c: * solib-irix.c: * solib-frv.c: * solib-aix5.c: * sol-thread.c: * sparc64-linux-tdep.c: * sparc64-linux-nat.c: * sparc-tdep.h: * sparc-tdep.c: * sparc-sol2-tdep.c: * sparc-sol2-nat.c: * sparc-nat.h: * sparc-nat.c: * sparc-linux-tdep.c: * sparc-linux-nat.c: * source.h: * source.c: * somread.c: * solist.h: * solib.h: * std-regs.c: * stack.h: * stack.c: * stabsread.h: * sparcobsd-tdep.c: * sparcnbsd-tdep.c: * sparcnbsd-nat.c: * sparc64obsd-tdep.c: * sparc64nbsd-tdep.c: * sparc64nbsd-nat.c: * sparc64fbsd-tdep.c: * sparc64fbsd-nat.c: * sparc64-tdep.h: * sparc64-tdep.c: * sparc64-sol2-tdep.c: * sparc64-nat.c: * ui-file.c: * typeprint.h: * typeprint.c: * tramp-frame.h: * tramp-frame.c: * trad-frame.h: * trad-frame.c: * tracepoint.h: * top.c: * tobs.inc: * thread.c: * terminal.h: * target.h: * symfile.h: * stop-gdb.c: * vaxbsd-nat.c: * vax-tdep.h: * vax-tdep.c: * vax-nat.c: * varobj.h: * varobj.c: * value.h: * value.c: * valprint.h: * valprint.c: * v850-tdep.c: * uw-thread.c: * user-regs.c: * ui-out.h: * ui-out.c: * ui-file.h: * xcoffsolib.h: * xcoffsolib.c: * wrapper.c: * wince.c: * wince-stub.h: * wince-stub.c: * vaxobsd-tdep.c: * vaxnbsd-tdep.c: * gdb_gcore.sh: * copying.c: * configure.ac: * aclocal.m4: * acinclude.m4: * reply_mig_hack.awk: * observer.sh: * gdb_mbuild.sh: * arm-linux-tdep.c: * blockframe.c: * dbug-rom.c: * environ.h: * dwarf2loc.h: * gdb-events.sh: * glibc-tdep.h: * gdb_wait.h: * gdbthread.h: * i386-sol2-tdep.c: * hppabsd-tdep.c: * hppa-linux-nat.c: * hppa-hpux-nat.c: * ia64-linux-tdep.c: * infptrace.c: * linespec.h: * maint.c: * mips-mdebug-tdep.h: * remote-m32r-sdi.c: * s390-nat.c: * rs6000-nat.c: * remote-utils.h: * sh3-rom.c: * sh-linux-tdep.c: * top.h: * symtab.h: * symmisc.c: * symfile-mem.c: * srec.h: * user-regs.h: * version.h: * valarith.c: * xstormy16-tdep.c: * wrapper.h: * Makefile.in: * f-exp.y: * cris-tdep.c: * cp-name-parser.y: * procfs.c: * proc-utils.h: * proc-flags.c: * proc-api.c: * p-exp.y: * m68hc11-tdep.c: * m2-exp.y: * kod.h: * kod-cisco.c: * jv-exp.y: * hppa-linux-tdep.c: Add (c) after Copyright. Update the FSF address.
716 lines
17 KiB
C
716 lines
17 KiB
C
/* DWARF 2 Expression Evaluator.
|
||
|
||
Copyright (C) 2001, 2002, 2003, 2005 Free Software Foundation, Inc.
|
||
|
||
Contributed by Daniel Berlin (dan@dberlin.org)
|
||
|
||
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., 51 Franklin Street, Fifth Floor,
|
||
Boston, MA 02110-1301, USA. */
|
||
|
||
#include "defs.h"
|
||
#include "symtab.h"
|
||
#include "gdbtypes.h"
|
||
#include "value.h"
|
||
#include "gdbcore.h"
|
||
#include "elf/dwarf2.h"
|
||
#include "dwarf2expr.h"
|
||
|
||
/* Local prototypes. */
|
||
|
||
static void execute_stack_op (struct dwarf_expr_context *,
|
||
gdb_byte *, gdb_byte *);
|
||
|
||
/* Create a new context for the expression evaluator. */
|
||
|
||
struct dwarf_expr_context *
|
||
new_dwarf_expr_context (void)
|
||
{
|
||
struct dwarf_expr_context *retval;
|
||
retval = xcalloc (1, sizeof (struct dwarf_expr_context));
|
||
retval->stack_len = 0;
|
||
retval->stack_allocated = 10;
|
||
retval->stack = xmalloc (retval->stack_allocated * sizeof (CORE_ADDR));
|
||
retval->num_pieces = 0;
|
||
retval->pieces = 0;
|
||
return retval;
|
||
}
|
||
|
||
/* Release the memory allocated to CTX. */
|
||
|
||
void
|
||
free_dwarf_expr_context (struct dwarf_expr_context *ctx)
|
||
{
|
||
xfree (ctx->stack);
|
||
xfree (ctx->pieces);
|
||
xfree (ctx);
|
||
}
|
||
|
||
/* Expand the memory allocated to CTX's stack to contain at least
|
||
NEED more elements than are currently used. */
|
||
|
||
static void
|
||
dwarf_expr_grow_stack (struct dwarf_expr_context *ctx, size_t need)
|
||
{
|
||
if (ctx->stack_len + need > ctx->stack_allocated)
|
||
{
|
||
size_t newlen = ctx->stack_len + need + 10;
|
||
ctx->stack = xrealloc (ctx->stack,
|
||
newlen * sizeof (CORE_ADDR));
|
||
ctx->stack_allocated = newlen;
|
||
}
|
||
}
|
||
|
||
/* Push VALUE onto CTX's stack. */
|
||
|
||
void
|
||
dwarf_expr_push (struct dwarf_expr_context *ctx, CORE_ADDR value)
|
||
{
|
||
dwarf_expr_grow_stack (ctx, 1);
|
||
ctx->stack[ctx->stack_len++] = value;
|
||
}
|
||
|
||
/* Pop the top item off of CTX's stack. */
|
||
|
||
void
|
||
dwarf_expr_pop (struct dwarf_expr_context *ctx)
|
||
{
|
||
if (ctx->stack_len <= 0)
|
||
error (_("dwarf expression stack underflow"));
|
||
ctx->stack_len--;
|
||
}
|
||
|
||
/* Retrieve the N'th item on CTX's stack. */
|
||
|
||
CORE_ADDR
|
||
dwarf_expr_fetch (struct dwarf_expr_context *ctx, int n)
|
||
{
|
||
if (ctx->stack_len <= n)
|
||
error (_("Asked for position %d of stack, stack only has %d elements on it."),
|
||
n, ctx->stack_len);
|
||
return ctx->stack[ctx->stack_len - (1 + n)];
|
||
|
||
}
|
||
|
||
/* Add a new piece to CTX's piece list. */
|
||
static void
|
||
add_piece (struct dwarf_expr_context *ctx,
|
||
int in_reg, CORE_ADDR value, ULONGEST size)
|
||
{
|
||
struct dwarf_expr_piece *p;
|
||
|
||
ctx->num_pieces++;
|
||
|
||
if (ctx->pieces)
|
||
ctx->pieces = xrealloc (ctx->pieces,
|
||
(ctx->num_pieces
|
||
* sizeof (struct dwarf_expr_piece)));
|
||
else
|
||
ctx->pieces = xmalloc (ctx->num_pieces
|
||
* sizeof (struct dwarf_expr_piece));
|
||
|
||
p = &ctx->pieces[ctx->num_pieces - 1];
|
||
p->in_reg = in_reg;
|
||
p->value = value;
|
||
p->size = size;
|
||
}
|
||
|
||
/* Evaluate the expression at ADDR (LEN bytes long) using the context
|
||
CTX. */
|
||
|
||
void
|
||
dwarf_expr_eval (struct dwarf_expr_context *ctx, gdb_byte *addr, size_t len)
|
||
{
|
||
execute_stack_op (ctx, addr, addr + len);
|
||
}
|
||
|
||
/* Decode the unsigned LEB128 constant at BUF into the variable pointed to
|
||
by R, and return the new value of BUF. Verify that it doesn't extend
|
||
past BUF_END. */
|
||
|
||
gdb_byte *
|
||
read_uleb128 (gdb_byte *buf, gdb_byte *buf_end, ULONGEST * r)
|
||
{
|
||
unsigned shift = 0;
|
||
ULONGEST result = 0;
|
||
gdb_byte byte;
|
||
|
||
while (1)
|
||
{
|
||
if (buf >= buf_end)
|
||
error (_("read_uleb128: Corrupted DWARF expression."));
|
||
|
||
byte = *buf++;
|
||
result |= (byte & 0x7f) << shift;
|
||
if ((byte & 0x80) == 0)
|
||
break;
|
||
shift += 7;
|
||
}
|
||
*r = result;
|
||
return buf;
|
||
}
|
||
|
||
/* Decode the signed LEB128 constant at BUF into the variable pointed to
|
||
by R, and return the new value of BUF. Verify that it doesn't extend
|
||
past BUF_END. */
|
||
|
||
gdb_byte *
|
||
read_sleb128 (gdb_byte *buf, gdb_byte *buf_end, LONGEST * r)
|
||
{
|
||
unsigned shift = 0;
|
||
LONGEST result = 0;
|
||
gdb_byte byte;
|
||
|
||
while (1)
|
||
{
|
||
if (buf >= buf_end)
|
||
error (_("read_sleb128: Corrupted DWARF expression."));
|
||
|
||
byte = *buf++;
|
||
result |= (byte & 0x7f) << shift;
|
||
shift += 7;
|
||
if ((byte & 0x80) == 0)
|
||
break;
|
||
}
|
||
if (shift < (sizeof (*r) * 8) && (byte & 0x40) != 0)
|
||
result |= -(1 << shift);
|
||
|
||
*r = result;
|
||
return buf;
|
||
}
|
||
|
||
/* Read an address from BUF, and verify that it doesn't extend past
|
||
BUF_END. The address is returned, and *BYTES_READ is set to the
|
||
number of bytes read from BUF. */
|
||
|
||
CORE_ADDR
|
||
dwarf2_read_address (gdb_byte *buf, gdb_byte *buf_end, int *bytes_read)
|
||
{
|
||
CORE_ADDR result;
|
||
|
||
if (buf_end - buf < TARGET_ADDR_BIT / TARGET_CHAR_BIT)
|
||
error (_("dwarf2_read_address: Corrupted DWARF expression."));
|
||
|
||
*bytes_read = TARGET_ADDR_BIT / TARGET_CHAR_BIT;
|
||
/* NOTE: cagney/2003-05-22: This extract is assuming that a DWARF 2
|
||
address is always unsigned. That may or may not be true. */
|
||
result = extract_unsigned_integer (buf, TARGET_ADDR_BIT / TARGET_CHAR_BIT);
|
||
return result;
|
||
}
|
||
|
||
/* Return the type of an address, for unsigned arithmetic. */
|
||
|
||
static struct type *
|
||
unsigned_address_type (void)
|
||
{
|
||
switch (TARGET_ADDR_BIT / TARGET_CHAR_BIT)
|
||
{
|
||
case 2:
|
||
return builtin_type_uint16;
|
||
case 4:
|
||
return builtin_type_uint32;
|
||
case 8:
|
||
return builtin_type_uint64;
|
||
default:
|
||
internal_error (__FILE__, __LINE__,
|
||
_("Unsupported address size.\n"));
|
||
}
|
||
}
|
||
|
||
/* Return the type of an address, for signed arithmetic. */
|
||
|
||
static struct type *
|
||
signed_address_type (void)
|
||
{
|
||
switch (TARGET_ADDR_BIT / TARGET_CHAR_BIT)
|
||
{
|
||
case 2:
|
||
return builtin_type_int16;
|
||
case 4:
|
||
return builtin_type_int32;
|
||
case 8:
|
||
return builtin_type_int64;
|
||
default:
|
||
internal_error (__FILE__, __LINE__,
|
||
_("Unsupported address size.\n"));
|
||
}
|
||
}
|
||
|
||
/* The engine for the expression evaluator. Using the context in CTX,
|
||
evaluate the expression between OP_PTR and OP_END. */
|
||
|
||
static void
|
||
execute_stack_op (struct dwarf_expr_context *ctx,
|
||
gdb_byte *op_ptr, gdb_byte *op_end)
|
||
{
|
||
ctx->in_reg = 0;
|
||
|
||
while (op_ptr < op_end)
|
||
{
|
||
enum dwarf_location_atom op = *op_ptr++;
|
||
CORE_ADDR result;
|
||
ULONGEST uoffset, reg;
|
||
LONGEST offset;
|
||
int bytes_read;
|
||
|
||
switch (op)
|
||
{
|
||
case DW_OP_lit0:
|
||
case DW_OP_lit1:
|
||
case DW_OP_lit2:
|
||
case DW_OP_lit3:
|
||
case DW_OP_lit4:
|
||
case DW_OP_lit5:
|
||
case DW_OP_lit6:
|
||
case DW_OP_lit7:
|
||
case DW_OP_lit8:
|
||
case DW_OP_lit9:
|
||
case DW_OP_lit10:
|
||
case DW_OP_lit11:
|
||
case DW_OP_lit12:
|
||
case DW_OP_lit13:
|
||
case DW_OP_lit14:
|
||
case DW_OP_lit15:
|
||
case DW_OP_lit16:
|
||
case DW_OP_lit17:
|
||
case DW_OP_lit18:
|
||
case DW_OP_lit19:
|
||
case DW_OP_lit20:
|
||
case DW_OP_lit21:
|
||
case DW_OP_lit22:
|
||
case DW_OP_lit23:
|
||
case DW_OP_lit24:
|
||
case DW_OP_lit25:
|
||
case DW_OP_lit26:
|
||
case DW_OP_lit27:
|
||
case DW_OP_lit28:
|
||
case DW_OP_lit29:
|
||
case DW_OP_lit30:
|
||
case DW_OP_lit31:
|
||
result = op - DW_OP_lit0;
|
||
break;
|
||
|
||
case DW_OP_addr:
|
||
result = dwarf2_read_address (op_ptr, op_end, &bytes_read);
|
||
op_ptr += bytes_read;
|
||
break;
|
||
|
||
case DW_OP_const1u:
|
||
result = extract_unsigned_integer (op_ptr, 1);
|
||
op_ptr += 1;
|
||
break;
|
||
case DW_OP_const1s:
|
||
result = extract_signed_integer (op_ptr, 1);
|
||
op_ptr += 1;
|
||
break;
|
||
case DW_OP_const2u:
|
||
result = extract_unsigned_integer (op_ptr, 2);
|
||
op_ptr += 2;
|
||
break;
|
||
case DW_OP_const2s:
|
||
result = extract_signed_integer (op_ptr, 2);
|
||
op_ptr += 2;
|
||
break;
|
||
case DW_OP_const4u:
|
||
result = extract_unsigned_integer (op_ptr, 4);
|
||
op_ptr += 4;
|
||
break;
|
||
case DW_OP_const4s:
|
||
result = extract_signed_integer (op_ptr, 4);
|
||
op_ptr += 4;
|
||
break;
|
||
case DW_OP_const8u:
|
||
result = extract_unsigned_integer (op_ptr, 8);
|
||
op_ptr += 8;
|
||
break;
|
||
case DW_OP_const8s:
|
||
result = extract_signed_integer (op_ptr, 8);
|
||
op_ptr += 8;
|
||
break;
|
||
case DW_OP_constu:
|
||
op_ptr = read_uleb128 (op_ptr, op_end, &uoffset);
|
||
result = uoffset;
|
||
break;
|
||
case DW_OP_consts:
|
||
op_ptr = read_sleb128 (op_ptr, op_end, &offset);
|
||
result = offset;
|
||
break;
|
||
|
||
/* The DW_OP_reg operations are required to occur alone in
|
||
location expressions. */
|
||
case DW_OP_reg0:
|
||
case DW_OP_reg1:
|
||
case DW_OP_reg2:
|
||
case DW_OP_reg3:
|
||
case DW_OP_reg4:
|
||
case DW_OP_reg5:
|
||
case DW_OP_reg6:
|
||
case DW_OP_reg7:
|
||
case DW_OP_reg8:
|
||
case DW_OP_reg9:
|
||
case DW_OP_reg10:
|
||
case DW_OP_reg11:
|
||
case DW_OP_reg12:
|
||
case DW_OP_reg13:
|
||
case DW_OP_reg14:
|
||
case DW_OP_reg15:
|
||
case DW_OP_reg16:
|
||
case DW_OP_reg17:
|
||
case DW_OP_reg18:
|
||
case DW_OP_reg19:
|
||
case DW_OP_reg20:
|
||
case DW_OP_reg21:
|
||
case DW_OP_reg22:
|
||
case DW_OP_reg23:
|
||
case DW_OP_reg24:
|
||
case DW_OP_reg25:
|
||
case DW_OP_reg26:
|
||
case DW_OP_reg27:
|
||
case DW_OP_reg28:
|
||
case DW_OP_reg29:
|
||
case DW_OP_reg30:
|
||
case DW_OP_reg31:
|
||
if (op_ptr != op_end && *op_ptr != DW_OP_piece)
|
||
error (_("DWARF-2 expression error: DW_OP_reg operations must be "
|
||
"used either alone or in conjuction with DW_OP_piece."));
|
||
|
||
result = op - DW_OP_reg0;
|
||
ctx->in_reg = 1;
|
||
|
||
break;
|
||
|
||
case DW_OP_regx:
|
||
op_ptr = read_uleb128 (op_ptr, op_end, ®);
|
||
if (op_ptr != op_end && *op_ptr != DW_OP_piece)
|
||
error (_("DWARF-2 expression error: DW_OP_reg operations must be "
|
||
"used either alone or in conjuction with DW_OP_piece."));
|
||
|
||
result = reg;
|
||
ctx->in_reg = 1;
|
||
break;
|
||
|
||
case DW_OP_breg0:
|
||
case DW_OP_breg1:
|
||
case DW_OP_breg2:
|
||
case DW_OP_breg3:
|
||
case DW_OP_breg4:
|
||
case DW_OP_breg5:
|
||
case DW_OP_breg6:
|
||
case DW_OP_breg7:
|
||
case DW_OP_breg8:
|
||
case DW_OP_breg9:
|
||
case DW_OP_breg10:
|
||
case DW_OP_breg11:
|
||
case DW_OP_breg12:
|
||
case DW_OP_breg13:
|
||
case DW_OP_breg14:
|
||
case DW_OP_breg15:
|
||
case DW_OP_breg16:
|
||
case DW_OP_breg17:
|
||
case DW_OP_breg18:
|
||
case DW_OP_breg19:
|
||
case DW_OP_breg20:
|
||
case DW_OP_breg21:
|
||
case DW_OP_breg22:
|
||
case DW_OP_breg23:
|
||
case DW_OP_breg24:
|
||
case DW_OP_breg25:
|
||
case DW_OP_breg26:
|
||
case DW_OP_breg27:
|
||
case DW_OP_breg28:
|
||
case DW_OP_breg29:
|
||
case DW_OP_breg30:
|
||
case DW_OP_breg31:
|
||
{
|
||
op_ptr = read_sleb128 (op_ptr, op_end, &offset);
|
||
result = (ctx->read_reg) (ctx->baton, op - DW_OP_breg0);
|
||
result += offset;
|
||
}
|
||
break;
|
||
case DW_OP_bregx:
|
||
{
|
||
op_ptr = read_uleb128 (op_ptr, op_end, ®);
|
||
op_ptr = read_sleb128 (op_ptr, op_end, &offset);
|
||
result = (ctx->read_reg) (ctx->baton, reg);
|
||
result += offset;
|
||
}
|
||
break;
|
||
case DW_OP_fbreg:
|
||
{
|
||
gdb_byte *datastart;
|
||
size_t datalen;
|
||
unsigned int before_stack_len;
|
||
|
||
op_ptr = read_sleb128 (op_ptr, op_end, &offset);
|
||
/* Rather than create a whole new context, we simply
|
||
record the stack length before execution, then reset it
|
||
afterwards, effectively erasing whatever the recursive
|
||
call put there. */
|
||
before_stack_len = ctx->stack_len;
|
||
/* FIXME: cagney/2003-03-26: This code should be using
|
||
get_frame_base_address(), and then implement a dwarf2
|
||
specific this_base method. */
|
||
(ctx->get_frame_base) (ctx->baton, &datastart, &datalen);
|
||
dwarf_expr_eval (ctx, datastart, datalen);
|
||
result = dwarf_expr_fetch (ctx, 0);
|
||
if (ctx->in_reg)
|
||
result = (ctx->read_reg) (ctx->baton, result);
|
||
result = result + offset;
|
||
ctx->stack_len = before_stack_len;
|
||
ctx->in_reg = 0;
|
||
}
|
||
break;
|
||
case DW_OP_dup:
|
||
result = dwarf_expr_fetch (ctx, 0);
|
||
break;
|
||
|
||
case DW_OP_drop:
|
||
dwarf_expr_pop (ctx);
|
||
goto no_push;
|
||
|
||
case DW_OP_pick:
|
||
offset = *op_ptr++;
|
||
result = dwarf_expr_fetch (ctx, offset);
|
||
break;
|
||
|
||
case DW_OP_over:
|
||
result = dwarf_expr_fetch (ctx, 1);
|
||
break;
|
||
|
||
case DW_OP_rot:
|
||
{
|
||
CORE_ADDR t1, t2, t3;
|
||
|
||
if (ctx->stack_len < 3)
|
||
error (_("Not enough elements for DW_OP_rot. Need 3, have %d."),
|
||
ctx->stack_len);
|
||
t1 = ctx->stack[ctx->stack_len - 1];
|
||
t2 = ctx->stack[ctx->stack_len - 2];
|
||
t3 = ctx->stack[ctx->stack_len - 3];
|
||
ctx->stack[ctx->stack_len - 1] = t2;
|
||
ctx->stack[ctx->stack_len - 2] = t3;
|
||
ctx->stack[ctx->stack_len - 3] = t1;
|
||
goto no_push;
|
||
}
|
||
|
||
case DW_OP_deref:
|
||
case DW_OP_deref_size:
|
||
case DW_OP_abs:
|
||
case DW_OP_neg:
|
||
case DW_OP_not:
|
||
case DW_OP_plus_uconst:
|
||
/* Unary operations. */
|
||
result = dwarf_expr_fetch (ctx, 0);
|
||
dwarf_expr_pop (ctx);
|
||
|
||
switch (op)
|
||
{
|
||
case DW_OP_deref:
|
||
{
|
||
gdb_byte *buf = alloca (TARGET_ADDR_BIT / TARGET_CHAR_BIT);
|
||
int bytes_read;
|
||
|
||
(ctx->read_mem) (ctx->baton, buf, result,
|
||
TARGET_ADDR_BIT / TARGET_CHAR_BIT);
|
||
result = dwarf2_read_address (buf,
|
||
buf + (TARGET_ADDR_BIT
|
||
/ TARGET_CHAR_BIT),
|
||
&bytes_read);
|
||
}
|
||
break;
|
||
|
||
case DW_OP_deref_size:
|
||
{
|
||
gdb_byte *buf = alloca (TARGET_ADDR_BIT / TARGET_CHAR_BIT);
|
||
int bytes_read;
|
||
|
||
(ctx->read_mem) (ctx->baton, buf, result, *op_ptr++);
|
||
result = dwarf2_read_address (buf,
|
||
buf + (TARGET_ADDR_BIT
|
||
/ TARGET_CHAR_BIT),
|
||
&bytes_read);
|
||
}
|
||
break;
|
||
|
||
case DW_OP_abs:
|
||
if ((signed int) result < 0)
|
||
result = -result;
|
||
break;
|
||
case DW_OP_neg:
|
||
result = -result;
|
||
break;
|
||
case DW_OP_not:
|
||
result = ~result;
|
||
break;
|
||
case DW_OP_plus_uconst:
|
||
op_ptr = read_uleb128 (op_ptr, op_end, ®);
|
||
result += reg;
|
||
break;
|
||
}
|
||
break;
|
||
|
||
case DW_OP_and:
|
||
case DW_OP_div:
|
||
case DW_OP_minus:
|
||
case DW_OP_mod:
|
||
case DW_OP_mul:
|
||
case DW_OP_or:
|
||
case DW_OP_plus:
|
||
case DW_OP_shl:
|
||
case DW_OP_shr:
|
||
case DW_OP_shra:
|
||
case DW_OP_xor:
|
||
case DW_OP_le:
|
||
case DW_OP_ge:
|
||
case DW_OP_eq:
|
||
case DW_OP_lt:
|
||
case DW_OP_gt:
|
||
case DW_OP_ne:
|
||
{
|
||
/* Binary operations. Use the value engine to do computations in
|
||
the right width. */
|
||
CORE_ADDR first, second;
|
||
enum exp_opcode binop;
|
||
struct value *val1, *val2;
|
||
|
||
second = dwarf_expr_fetch (ctx, 0);
|
||
dwarf_expr_pop (ctx);
|
||
|
||
first = dwarf_expr_fetch (ctx, 0);
|
||
dwarf_expr_pop (ctx);
|
||
|
||
val1 = value_from_longest (unsigned_address_type (), first);
|
||
val2 = value_from_longest (unsigned_address_type (), second);
|
||
|
||
switch (op)
|
||
{
|
||
case DW_OP_and:
|
||
binop = BINOP_BITWISE_AND;
|
||
break;
|
||
case DW_OP_div:
|
||
binop = BINOP_DIV;
|
||
break;
|
||
case DW_OP_minus:
|
||
binop = BINOP_SUB;
|
||
break;
|
||
case DW_OP_mod:
|
||
binop = BINOP_MOD;
|
||
break;
|
||
case DW_OP_mul:
|
||
binop = BINOP_MUL;
|
||
break;
|
||
case DW_OP_or:
|
||
binop = BINOP_BITWISE_IOR;
|
||
break;
|
||
case DW_OP_plus:
|
||
binop = BINOP_ADD;
|
||
break;
|
||
case DW_OP_shl:
|
||
binop = BINOP_LSH;
|
||
break;
|
||
case DW_OP_shr:
|
||
binop = BINOP_RSH;
|
||
break;
|
||
case DW_OP_shra:
|
||
binop = BINOP_RSH;
|
||
val1 = value_from_longest (signed_address_type (), first);
|
||
break;
|
||
case DW_OP_xor:
|
||
binop = BINOP_BITWISE_XOR;
|
||
break;
|
||
case DW_OP_le:
|
||
binop = BINOP_LEQ;
|
||
break;
|
||
case DW_OP_ge:
|
||
binop = BINOP_GEQ;
|
||
break;
|
||
case DW_OP_eq:
|
||
binop = BINOP_EQUAL;
|
||
break;
|
||
case DW_OP_lt:
|
||
binop = BINOP_LESS;
|
||
break;
|
||
case DW_OP_gt:
|
||
binop = BINOP_GTR;
|
||
break;
|
||
case DW_OP_ne:
|
||
binop = BINOP_NOTEQUAL;
|
||
break;
|
||
default:
|
||
internal_error (__FILE__, __LINE__,
|
||
_("Can't be reached."));
|
||
}
|
||
result = value_as_long (value_binop (val1, val2, binop));
|
||
}
|
||
break;
|
||
|
||
case DW_OP_GNU_push_tls_address:
|
||
/* Variable is at a constant offset in the thread-local
|
||
storage block into the objfile for the current thread and
|
||
the dynamic linker module containing this expression. Here
|
||
we return returns the offset from that base. The top of the
|
||
stack has the offset from the beginning of the thread
|
||
control block at which the variable is located. Nothing
|
||
should follow this operator, so the top of stack would be
|
||
returned. */
|
||
result = dwarf_expr_fetch (ctx, 0);
|
||
dwarf_expr_pop (ctx);
|
||
result = (ctx->get_tls_address) (ctx->baton, result);
|
||
break;
|
||
|
||
case DW_OP_skip:
|
||
offset = extract_signed_integer (op_ptr, 2);
|
||
op_ptr += 2;
|
||
op_ptr += offset;
|
||
goto no_push;
|
||
|
||
case DW_OP_bra:
|
||
offset = extract_signed_integer (op_ptr, 2);
|
||
op_ptr += 2;
|
||
if (dwarf_expr_fetch (ctx, 0) != 0)
|
||
op_ptr += offset;
|
||
dwarf_expr_pop (ctx);
|
||
goto no_push;
|
||
|
||
case DW_OP_nop:
|
||
goto no_push;
|
||
|
||
case DW_OP_piece:
|
||
{
|
||
ULONGEST size;
|
||
CORE_ADDR addr_or_regnum;
|
||
|
||
/* Record the piece. */
|
||
op_ptr = read_uleb128 (op_ptr, op_end, &size);
|
||
addr_or_regnum = dwarf_expr_fetch (ctx, 0);
|
||
add_piece (ctx, ctx->in_reg, addr_or_regnum, size);
|
||
|
||
/* Pop off the address/regnum, and clear the in_reg flag. */
|
||
dwarf_expr_pop (ctx);
|
||
ctx->in_reg = 0;
|
||
}
|
||
goto no_push;
|
||
|
||
default:
|
||
error (_("Unhandled dwarf expression opcode 0x%x"), op);
|
||
}
|
||
|
||
/* Most things push a result value. */
|
||
dwarf_expr_push (ctx, result);
|
||
no_push:;
|
||
}
|
||
}
|