1999-04-16 03:35:26 +02:00
|
|
|
|
/* Functions for manipulating expressions designed to be executed on the agent
|
2013-01-01 07:33:28 +01:00
|
|
|
|
Copyright (C) 1998-2013 Free Software Foundation, Inc.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
This file is part of GDB.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
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
|
2007-08-23 20:08:50 +02:00
|
|
|
|
the Free Software Foundation; either version 3 of the License, or
|
1999-07-07 22:19:36 +02:00
|
|
|
|
(at your option) any later version.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
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.
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
You should have received a copy of the GNU General Public License
|
2007-08-23 20:08:50 +02:00
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Despite what the above comment says about this file being part of
|
|
|
|
|
GDB, we would like to keep these functions free of GDB
|
|
|
|
|
dependencies, since we want to be able to use them in contexts
|
|
|
|
|
outside of GDB (test suites, the stub, etc.) */
|
|
|
|
|
|
|
|
|
|
#include "defs.h"
|
|
|
|
|
#include "ax.h"
|
|
|
|
|
|
1999-04-26 20:34:20 +02:00
|
|
|
|
#include "value.h"
|
2002-08-02 22:51:21 +02:00
|
|
|
|
#include "gdb_string.h"
|
1999-04-26 20:34:20 +02:00
|
|
|
|
|
2010-12-28 17:00:13 +01:00
|
|
|
|
#include "user-regs.h"
|
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void grow_expr (struct agent_expr *x, int n);
|
1999-05-25 20:09:09 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void append_const (struct agent_expr *x, LONGEST val, int n);
|
1999-05-25 20:09:09 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static LONGEST read_const (struct agent_expr *x, int o, int n);
|
1999-05-25 20:09:09 +02:00
|
|
|
|
|
2000-05-28 03:12:42 +02:00
|
|
|
|
static void generic_ext (struct agent_expr *x, enum agent_op op, int n);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Functions for building expressions. */
|
|
|
|
|
|
|
|
|
|
/* Allocate a new, empty agent expression. */
|
|
|
|
|
struct agent_expr *
|
2010-04-24 01:51:05 +02:00
|
|
|
|
new_agent_expr (struct gdbarch *gdbarch, CORE_ADDR scope)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
struct agent_expr *x = xmalloc (sizeof (*x));
|
2010-04-24 01:51:05 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
x->len = 0;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
x->size = 1; /* Change this to a larger value once
|
|
|
|
|
reallocation code is tested. */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
x->buf = xmalloc (x->size);
|
2010-04-24 01:51:05 +02:00
|
|
|
|
|
|
|
|
|
x->gdbarch = gdbarch;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
x->scope = scope;
|
|
|
|
|
|
2010-04-24 01:51:05 +02:00
|
|
|
|
/* Bit vector for registers used. */
|
|
|
|
|
x->reg_mask_len = 1;
|
|
|
|
|
x->reg_mask = xmalloc (x->reg_mask_len * sizeof (x->reg_mask[0]));
|
|
|
|
|
memset (x->reg_mask, 0, x->reg_mask_len * sizeof (x->reg_mask[0]));
|
|
|
|
|
|
2013-03-21 17:09:27 +01:00
|
|
|
|
x->tracing = 0;
|
|
|
|
|
x->trace_string = 0;
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return x;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Free a agent expression. */
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
free_agent_expr (struct agent_expr *x)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
2000-12-15 02:01:51 +01:00
|
|
|
|
xfree (x->buf);
|
2010-04-24 01:51:05 +02:00
|
|
|
|
xfree (x->reg_mask);
|
2000-12-15 02:01:51 +01:00
|
|
|
|
xfree (x);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
|
2000-05-15 08:15:27 +02:00
|
|
|
|
static void
|
|
|
|
|
do_free_agent_expr_cleanup (void *x)
|
|
|
|
|
{
|
|
|
|
|
free_agent_expr (x);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct cleanup *
|
|
|
|
|
make_cleanup_free_agent_expr (struct agent_expr *x)
|
|
|
|
|
{
|
|
|
|
|
return make_cleanup (do_free_agent_expr_cleanup, x);
|
|
|
|
|
}
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Make sure that X has room for at least N more bytes. This doesn't
|
|
|
|
|
affect the length, just the allocated size. */
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
grow_expr (struct agent_expr *x, int n)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
if (x->len + n > x->size)
|
|
|
|
|
{
|
|
|
|
|
x->size *= 2;
|
|
|
|
|
if (x->size < x->len + n)
|
|
|
|
|
x->size = x->len + n + 10;
|
|
|
|
|
x->buf = xrealloc (x->buf, x->size);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Append the low N bytes of VAL as an N-byte integer to the
|
|
|
|
|
expression X, in big-endian order. */
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
append_const (struct agent_expr *x, LONGEST val, int n)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
grow_expr (x, n);
|
|
|
|
|
for (i = n - 1; i >= 0; i--)
|
|
|
|
|
{
|
|
|
|
|
x->buf[x->len + i] = val & 0xff;
|
|
|
|
|
val >>= 8;
|
|
|
|
|
}
|
|
|
|
|
x->len += n;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Extract an N-byte big-endian unsigned integer from expression X at
|
|
|
|
|
offset O. */
|
|
|
|
|
static LONGEST
|
2000-07-30 03:48:28 +02:00
|
|
|
|
read_const (struct agent_expr *x, int o, int n)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
LONGEST accum = 0;
|
|
|
|
|
|
|
|
|
|
/* Make sure we're not reading off the end of the expression. */
|
|
|
|
|
if (o + n > x->len)
|
2005-01-29 Baurzhan Ismagulov <ibr@radix50.net>
* ax-gdb.c, ax-general.c, bcache.c, bfd-target.c, bsd-kvm.c,
* buildsym.c, c-lang.c, c-typeprint.c, c-valprint.c, charset.c,
* coff-pe-read.c, coffread.c, complaints.c, copying.c: I18n markup.
2005-01-29 18:53:26 +01:00
|
|
|
|
error (_("GDB bug: ax-general.c (read_const): incomplete constant"));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
for (i = 0; i < n; i++)
|
|
|
|
|
accum = (accum << 8) | x->buf[o + i];
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return accum;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Append a simple operator OP to EXPR. */
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
ax_simple (struct agent_expr *x, enum agent_op op)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
grow_expr (x, 1);
|
|
|
|
|
x->buf[x->len++] = op;
|
|
|
|
|
}
|
|
|
|
|
|
2011-02-18 21:55:45 +01:00
|
|
|
|
/* Append a pick operator to EXPR. DEPTH is the stack item to pick,
|
|
|
|
|
with 0 being top of stack. */
|
2011-02-23 22:02:47 +01:00
|
|
|
|
|
2011-02-18 21:55:45 +01:00
|
|
|
|
void
|
|
|
|
|
ax_pick (struct agent_expr *x, int depth)
|
|
|
|
|
{
|
|
|
|
|
if (depth < 0 || depth > 255)
|
|
|
|
|
error (_("GDB bug: ax-general.c (ax_pick): stack depth out of range"));
|
|
|
|
|
ax_simple (x, aop_pick);
|
|
|
|
|
append_const (x, 1, depth);
|
|
|
|
|
}
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Append a sign-extension or zero-extension instruction to EXPR, to
|
|
|
|
|
extend an N-bit value. */
|
|
|
|
|
static void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
generic_ext (struct agent_expr *x, enum agent_op op, int n)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
/* N must fit in a byte. */
|
|
|
|
|
if (n < 0 || n > 255)
|
2005-01-29 Baurzhan Ismagulov <ibr@radix50.net>
* ax-gdb.c, ax-general.c, bcache.c, bfd-target.c, bsd-kvm.c,
* buildsym.c, c-lang.c, c-typeprint.c, c-valprint.c, charset.c,
* coff-pe-read.c, coffread.c, complaints.c, copying.c: I18n markup.
2005-01-29 18:53:26 +01:00
|
|
|
|
error (_("GDB bug: ax-general.c (generic_ext): bit count out of range"));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* That had better be enough range. */
|
|
|
|
|
if (sizeof (LONGEST) * 8 > 255)
|
2011-01-05 23:22:53 +01:00
|
|
|
|
error (_("GDB bug: ax-general.c (generic_ext): "
|
|
|
|
|
"opcode has inadequate range"));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
grow_expr (x, 2);
|
|
|
|
|
x->buf[x->len++] = op;
|
|
|
|
|
x->buf[x->len++] = n;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Append a sign-extension instruction to EXPR, to extend an N-bit value. */
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
ax_ext (struct agent_expr *x, int n)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
generic_ext (x, aop_ext, n);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Append a zero-extension instruction to EXPR, to extend an N-bit value. */
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
ax_zero_ext (struct agent_expr *x, int n)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
generic_ext (x, aop_zero_ext, n);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Append a trace_quick instruction to EXPR, to record N bytes. */
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
ax_trace_quick (struct agent_expr *x, int n)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
/* N must fit in a byte. */
|
|
|
|
|
if (n < 0 || n > 255)
|
2011-01-05 23:22:53 +01:00
|
|
|
|
error (_("GDB bug: ax-general.c (ax_trace_quick): "
|
|
|
|
|
"size out of range for trace_quick"));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
grow_expr (x, 2);
|
|
|
|
|
x->buf[x->len++] = aop_trace_quick;
|
|
|
|
|
x->buf[x->len++] = n;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Append a goto op to EXPR. OP is the actual op (must be aop_goto or
|
|
|
|
|
aop_if_goto). We assume we don't know the target offset yet,
|
|
|
|
|
because it's probably a forward branch, so we leave space in EXPR
|
|
|
|
|
for the target, and return the offset in EXPR of that space, so we
|
|
|
|
|
can backpatch it once we do know the target offset. Use ax_label
|
|
|
|
|
to do the backpatching. */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
int
|
2000-07-30 03:48:28 +02:00
|
|
|
|
ax_goto (struct agent_expr *x, enum agent_op op)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
grow_expr (x, 3);
|
|
|
|
|
x->buf[x->len + 0] = op;
|
|
|
|
|
x->buf[x->len + 1] = 0xff;
|
|
|
|
|
x->buf[x->len + 2] = 0xff;
|
|
|
|
|
x->len += 3;
|
|
|
|
|
return x->len - 2;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Suppose a given call to ax_goto returns some value PATCH. When you
|
|
|
|
|
know the offset TARGET that goto should jump to, call
|
1999-07-07 22:19:36 +02:00
|
|
|
|
ax_label (EXPR, PATCH, TARGET)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
to patch TARGET into the ax_goto instruction. */
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
ax_label (struct agent_expr *x, int patch, int target)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
/* Make sure the value is in range. Don't accept 0xffff as an
|
|
|
|
|
offset; that's our magic sentinel value for unpatched branches. */
|
|
|
|
|
if (target < 0 || target >= 0xffff)
|
2005-01-29 Baurzhan Ismagulov <ibr@radix50.net>
* ax-gdb.c, ax-general.c, bcache.c, bfd-target.c, bsd-kvm.c,
* buildsym.c, c-lang.c, c-typeprint.c, c-valprint.c, charset.c,
* coff-pe-read.c, coffread.c, complaints.c, copying.c: I18n markup.
2005-01-29 18:53:26 +01:00
|
|
|
|
error (_("GDB bug: ax-general.c (ax_label): label target out of range"));
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
x->buf[patch] = (target >> 8) & 0xff;
|
|
|
|
|
x->buf[patch + 1] = target & 0xff;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Assemble code to push a constant on the stack. */
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
ax_const_l (struct agent_expr *x, LONGEST l)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
static enum agent_op ops[]
|
1999-07-07 22:19:36 +02:00
|
|
|
|
=
|
|
|
|
|
{aop_const8, aop_const16, aop_const32, aop_const64};
|
1999-04-16 03:35:26 +02:00
|
|
|
|
int size;
|
|
|
|
|
int op;
|
|
|
|
|
|
|
|
|
|
/* How big is the number? 'op' keeps track of which opcode to use.
|
|
|
|
|
Notice that we don't really care whether the original number was
|
|
|
|
|
signed or unsigned; we always reproduce the value exactly, and
|
|
|
|
|
use the shortest representation. */
|
|
|
|
|
for (op = 0, size = 8; size < 64; size *= 2, op++)
|
2007-01-07 16:35:44 +01:00
|
|
|
|
{
|
2010-03-19 19:21:03 +01:00
|
|
|
|
LONGEST lim = ((LONGEST) 1) << (size - 1);
|
2007-01-07 16:35:44 +01:00
|
|
|
|
|
|
|
|
|
if (-lim <= l && l <= lim - 1)
|
|
|
|
|
break;
|
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2010-12-31 20:16:37 +01:00
|
|
|
|
/* Emit the right opcode... */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
ax_simple (x, ops[op]);
|
|
|
|
|
|
|
|
|
|
/* Emit the low SIZE bytes as an unsigned number. We know that
|
|
|
|
|
sign-extending this will yield l. */
|
|
|
|
|
append_const (x, l, size / 8);
|
|
|
|
|
|
|
|
|
|
/* Now, if it was negative, and not full-sized, sign-extend it. */
|
|
|
|
|
if (l < 0 && size < 64)
|
|
|
|
|
ax_ext (x, size);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
ax_const_d (struct agent_expr *x, LONGEST d)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
/* FIXME: floating-point support not present yet. */
|
2011-01-05 23:22:53 +01:00
|
|
|
|
error (_("GDB bug: ax-general.c (ax_const_d): "
|
|
|
|
|
"floating point not supported yet"));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Assemble code to push the value of register number REG on the
|
|
|
|
|
stack. */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
ax_reg (struct agent_expr *x, int reg)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
2010-12-28 17:00:13 +01:00
|
|
|
|
if (reg >= gdbarch_num_regs (x->gdbarch))
|
|
|
|
|
{
|
|
|
|
|
/* This is a pseudo-register. */
|
|
|
|
|
if (!gdbarch_ax_pseudo_register_push_stack_p (x->gdbarch))
|
|
|
|
|
error (_("'%s' is a pseudo-register; "
|
|
|
|
|
"GDB cannot yet trace its contents."),
|
|
|
|
|
user_reg_map_regnum_to_name (x->gdbarch, reg));
|
|
|
|
|
if (gdbarch_ax_pseudo_register_push_stack (x->gdbarch, x, reg))
|
|
|
|
|
error (_("Trace '%s' failed."),
|
|
|
|
|
user_reg_map_regnum_to_name (x->gdbarch, reg));
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Make sure the register number is in range. */
|
|
|
|
|
if (reg < 0 || reg > 0xffff)
|
2011-01-05 23:22:53 +01:00
|
|
|
|
error (_("GDB bug: ax-general.c (ax_reg): "
|
|
|
|
|
"register number out of range"));
|
2010-12-28 17:00:13 +01:00
|
|
|
|
grow_expr (x, 3);
|
|
|
|
|
x->buf[x->len] = aop_reg;
|
|
|
|
|
x->buf[x->len + 1] = (reg >> 8) & 0xff;
|
|
|
|
|
x->buf[x->len + 2] = (reg) & 0xff;
|
|
|
|
|
x->len += 3;
|
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
2009-12-29 00:39:10 +01:00
|
|
|
|
|
|
|
|
|
/* Assemble code to operate on a trace state variable. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
ax_tsv (struct agent_expr *x, enum agent_op op, int num)
|
|
|
|
|
{
|
|
|
|
|
/* Make sure the tsv number is in range. */
|
|
|
|
|
if (num < 0 || num > 0xffff)
|
2011-01-05 23:22:53 +01:00
|
|
|
|
internal_error (__FILE__, __LINE__,
|
|
|
|
|
_("ax-general.c (ax_tsv): variable "
|
|
|
|
|
"number is %d, out of range"), num);
|
2009-12-29 00:39:10 +01:00
|
|
|
|
|
|
|
|
|
grow_expr (x, 3);
|
|
|
|
|
x->buf[x->len] = op;
|
|
|
|
|
x->buf[x->len + 1] = (num >> 8) & 0xff;
|
|
|
|
|
x->buf[x->len + 2] = (num) & 0xff;
|
|
|
|
|
x->len += 3;
|
|
|
|
|
}
|
2012-07-02 17:29:39 +02:00
|
|
|
|
|
|
|
|
|
/* Append a string to the expression. Note that the string is going
|
|
|
|
|
into the bytecodes directly, not on the stack. As a precaution,
|
|
|
|
|
include both length as prefix, and terminate with a NUL. (The NUL
|
|
|
|
|
is counted in the length.) */
|
|
|
|
|
|
|
|
|
|
void
|
2013-03-07 01:48:25 +01:00
|
|
|
|
ax_string (struct agent_expr *x, const char *str, int slen)
|
2012-07-02 17:29:39 +02:00
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
/* Make sure the string length is reasonable. */
|
|
|
|
|
if (slen < 0 || slen > 0xffff)
|
|
|
|
|
internal_error (__FILE__, __LINE__,
|
|
|
|
|
_("ax-general.c (ax_string): string "
|
|
|
|
|
"length is %d, out of allowed range"), slen);
|
|
|
|
|
|
|
|
|
|
grow_expr (x, 2 + slen + 1);
|
|
|
|
|
x->buf[x->len++] = ((slen + 1) >> 8) & 0xff;
|
|
|
|
|
x->buf[x->len++] = (slen + 1) & 0xff;
|
|
|
|
|
for (i = 0; i < slen; ++i)
|
|
|
|
|
x->buf[x->len++] = str[i];
|
|
|
|
|
x->buf[x->len++] = '\0';
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Functions for disassembling agent expressions, and otherwise
|
|
|
|
|
debugging the expression compiler. */
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
struct aop_map aop_map[] =
|
|
|
|
|
{
|
2011-02-18 22:12:07 +01:00
|
|
|
|
{0, 0, 0, 0, 0}
|
|
|
|
|
#define DEFOP(NAME, SIZE, DATA_SIZE, CONSUMED, PRODUCED, VALUE) \
|
|
|
|
|
, { # NAME, SIZE, DATA_SIZE, CONSUMED, PRODUCED }
|
|
|
|
|
#include "ax.def"
|
|
|
|
|
#undef DEFOP
|
1999-04-16 03:35:26 +02:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Disassemble the expression EXPR, writing to F. */
|
|
|
|
|
void
|
2000-07-30 03:48:28 +02:00
|
|
|
|
ax_print (struct ui_file *f, struct agent_expr *x)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
|
2010-04-24 01:51:05 +02:00
|
|
|
|
fprintf_filtered (f, _("Scope: %s\n"), paddress (x->gdbarch, x->scope));
|
|
|
|
|
fprintf_filtered (f, _("Reg mask:"));
|
|
|
|
|
for (i = 0; i < x->reg_mask_len; ++i)
|
|
|
|
|
fprintf_filtered (f, _(" %02x"), x->reg_mask[i]);
|
|
|
|
|
fprintf_filtered (f, _("\n"));
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Check the size of the name array against the number of entries in
|
|
|
|
|
the enum, to catch additions that people didn't sync. */
|
|
|
|
|
if ((sizeof (aop_map) / sizeof (aop_map[0]))
|
|
|
|
|
!= aop_last)
|
2005-01-29 Baurzhan Ismagulov <ibr@radix50.net>
* ax-gdb.c, ax-general.c, bcache.c, bfd-target.c, bsd-kvm.c,
* buildsym.c, c-lang.c, c-typeprint.c, c-valprint.c, charset.c,
* coff-pe-read.c, coffread.c, complaints.c, copying.c: I18n markup.
2005-01-29 18:53:26 +01:00
|
|
|
|
error (_("GDB bug: ax-general.c (ax_print): opcode map out of sync"));
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
|
|
|
|
for (i = 0; i < x->len;)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
enum agent_op op = x->buf[i];
|
|
|
|
|
|
|
|
|
|
if (op >= (sizeof (aop_map) / sizeof (aop_map[0]))
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|| !aop_map[op].name)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
2005-01-29 Baurzhan Ismagulov <ibr@radix50.net>
* ax-gdb.c, ax-general.c, bcache.c, bfd-target.c, bsd-kvm.c,
* buildsym.c, c-lang.c, c-typeprint.c, c-valprint.c, charset.c,
* coff-pe-read.c, coffread.c, complaints.c, copying.c: I18n markup.
2005-01-29 18:53:26 +01:00
|
|
|
|
fprintf_filtered (f, _("%3d <bad opcode %02x>\n"), i, op);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
i++;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
2011-02-24 08:39:48 +01:00
|
|
|
|
if (i + 1 + aop_map[op].op_size > x->len)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
2005-01-29 Baurzhan Ismagulov <ibr@radix50.net>
* ax-gdb.c, ax-general.c, bcache.c, bfd-target.c, bsd-kvm.c,
* buildsym.c, c-lang.c, c-typeprint.c, c-valprint.c, charset.c,
* coff-pe-read.c, coffread.c, complaints.c, copying.c: I18n markup.
2005-01-29 18:53:26 +01:00
|
|
|
|
fprintf_filtered (f, _("%3d <incomplete opcode %s>\n"),
|
1999-04-16 03:35:26 +02:00
|
|
|
|
i, aop_map[op].name);
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
fprintf_filtered (f, "%3d %s", i, aop_map[op].name);
|
2011-02-24 08:39:48 +01:00
|
|
|
|
if (aop_map[op].op_size > 0)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
fputs_filtered (" ", f);
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
print_longest (f, 'd', 0,
|
2011-02-24 08:39:48 +01:00
|
|
|
|
read_const (x, i + 1, aop_map[op].op_size));
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
2012-07-02 17:29:39 +02:00
|
|
|
|
/* Handle the complicated printf arguments specially. */
|
|
|
|
|
else if (op == aop_printf)
|
|
|
|
|
{
|
|
|
|
|
int slen, nargs;
|
|
|
|
|
|
|
|
|
|
i++;
|
|
|
|
|
nargs = x->buf[i++];
|
|
|
|
|
slen = x->buf[i++];
|
|
|
|
|
slen = slen * 256 + x->buf[i++];
|
|
|
|
|
fprintf_filtered (f, _(" \"%s\", %d args"),
|
|
|
|
|
&(x->buf[i]), nargs);
|
|
|
|
|
i += slen - 1;
|
|
|
|
|
}
|
1999-04-16 03:35:26 +02:00
|
|
|
|
fprintf_filtered (f, "\n");
|
2011-02-24 08:39:48 +01:00
|
|
|
|
i += 1 + aop_map[op].op_size;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2010-04-24 01:51:05 +02:00
|
|
|
|
/* Add register REG to the register mask for expression AX. */
|
|
|
|
|
void
|
|
|
|
|
ax_reg_mask (struct agent_expr *ax, int reg)
|
|
|
|
|
{
|
2010-12-28 17:00:13 +01:00
|
|
|
|
if (reg >= gdbarch_num_regs (ax->gdbarch))
|
2010-04-24 01:51:05 +02:00
|
|
|
|
{
|
2010-12-28 17:00:13 +01:00
|
|
|
|
/* This is a pseudo-register. */
|
|
|
|
|
if (!gdbarch_ax_pseudo_register_collect_p (ax->gdbarch))
|
|
|
|
|
error (_("'%s' is a pseudo-register; "
|
|
|
|
|
"GDB cannot yet trace its contents."),
|
|
|
|
|
user_reg_map_regnum_to_name (ax->gdbarch, reg));
|
|
|
|
|
if (gdbarch_ax_pseudo_register_collect (ax->gdbarch, ax, reg))
|
|
|
|
|
error (_("Trace '%s' failed."),
|
|
|
|
|
user_reg_map_regnum_to_name (ax->gdbarch, reg));
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
int byte = reg / 8;
|
|
|
|
|
|
|
|
|
|
/* Grow the bit mask if necessary. */
|
|
|
|
|
if (byte >= ax->reg_mask_len)
|
|
|
|
|
{
|
|
|
|
|
/* It's not appropriate to double here. This isn't a
|
|
|
|
|
string buffer. */
|
|
|
|
|
int new_len = byte + 1;
|
|
|
|
|
unsigned char *new_reg_mask = xrealloc (ax->reg_mask,
|
|
|
|
|
new_len
|
|
|
|
|
* sizeof (ax->reg_mask[0]));
|
|
|
|
|
memset (new_reg_mask + ax->reg_mask_len, 0,
|
|
|
|
|
(new_len - ax->reg_mask_len) * sizeof (ax->reg_mask[0]));
|
|
|
|
|
ax->reg_mask_len = new_len;
|
|
|
|
|
ax->reg_mask = new_reg_mask;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
ax->reg_mask[byte] |= 1 << (reg % 8);
|
2010-04-24 01:51:05 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Given an agent expression AX, fill in requirements and other descriptive
|
|
|
|
|
bits. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
void
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax_reqs (struct agent_expr *ax)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
int height;
|
|
|
|
|
|
2005-12-07 20:30:25 +01:00
|
|
|
|
/* Jump target table. targets[i] is non-zero iff we have found a
|
|
|
|
|
jump to offset i. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
char *targets = (char *) alloca (ax->len * sizeof (targets[0]));
|
|
|
|
|
|
2005-12-07 20:30:25 +01:00
|
|
|
|
/* Instruction boundary table. boundary[i] is non-zero iff our scan
|
|
|
|
|
has reached an instruction starting at offset i. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
char *boundary = (char *) alloca (ax->len * sizeof (boundary[0]));
|
|
|
|
|
|
2005-12-07 20:30:25 +01:00
|
|
|
|
/* Stack height record. If either targets[i] or boundary[i] is
|
1999-04-16 03:35:26 +02:00
|
|
|
|
non-zero, heights[i] is the height the stack should have before
|
|
|
|
|
executing the bytecode at that point. */
|
|
|
|
|
int *heights = (int *) alloca (ax->len * sizeof (heights[0]));
|
|
|
|
|
|
|
|
|
|
/* Pointer to a description of the present op. */
|
|
|
|
|
struct aop_map *op;
|
|
|
|
|
|
|
|
|
|
memset (targets, 0, ax->len * sizeof (targets[0]));
|
|
|
|
|
memset (boundary, 0, ax->len * sizeof (boundary[0]));
|
|
|
|
|
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax->max_height = ax->min_height = height = 0;
|
|
|
|
|
ax->flaw = agent_flaw_none;
|
|
|
|
|
ax->max_data_size = 0;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2011-02-24 08:39:48 +01:00
|
|
|
|
for (i = 0; i < ax->len; i += 1 + op->op_size)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
|
|
|
|
if (ax->buf[i] > (sizeof (aop_map) / sizeof (aop_map[0])))
|
|
|
|
|
{
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax->flaw = agent_flaw_bad_instruction;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
op = &aop_map[ax->buf[i]];
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
if (!op->name)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax->flaw = agent_flaw_bad_instruction;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
2011-02-24 08:39:48 +01:00
|
|
|
|
if (i + 1 + op->op_size > ax->len)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax->flaw = agent_flaw_incomplete_instruction;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2005-12-07 20:30:25 +01:00
|
|
|
|
/* If this instruction is a forward jump target, does the
|
|
|
|
|
current stack height match the stack height at the jump
|
|
|
|
|
source? */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (targets[i] && (heights[i] != height))
|
|
|
|
|
{
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax->flaw = agent_flaw_height_mismatch;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
boundary[i] = 1;
|
|
|
|
|
heights[i] = height;
|
|
|
|
|
|
2011-02-24 08:39:48 +01:00
|
|
|
|
height -= op->consumed;
|
2010-04-24 01:51:05 +02:00
|
|
|
|
if (height < ax->min_height)
|
|
|
|
|
ax->min_height = height;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
height += op->produced;
|
2010-04-24 01:51:05 +02:00
|
|
|
|
if (height > ax->max_height)
|
|
|
|
|
ax->max_height = height;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2010-04-24 01:51:05 +02:00
|
|
|
|
if (op->data_size > ax->max_data_size)
|
|
|
|
|
ax->max_data_size = op->data_size;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* For jump instructions, check that the target is a valid
|
1999-07-07 22:19:36 +02:00
|
|
|
|
offset. If it is, record the fact that that location is a
|
|
|
|
|
jump target, and record the height we expect there. */
|
1999-04-16 03:35:26 +02:00
|
|
|
|
if (aop_goto == op - aop_map
|
|
|
|
|
|| aop_if_goto == op - aop_map)
|
|
|
|
|
{
|
|
|
|
|
int target = read_const (ax, i + 1, 2);
|
|
|
|
|
if (target < 0 || target >= ax->len)
|
|
|
|
|
{
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax->flaw = agent_flaw_bad_jump;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
2005-12-07 20:30:25 +01:00
|
|
|
|
|
|
|
|
|
/* Do we have any information about what the stack height
|
|
|
|
|
should be at the target? */
|
|
|
|
|
if (targets[target] || boundary[target])
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
2005-12-07 20:30:25 +01:00
|
|
|
|
if (heights[target] != height)
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax->flaw = agent_flaw_height_mismatch;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
2005-12-07 20:30:25 +01:00
|
|
|
|
|
|
|
|
|
/* Record the target, along with the stack height we expect. */
|
|
|
|
|
targets[target] = 1;
|
|
|
|
|
heights[target] = height;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* For unconditional jumps with a successor, check that the
|
|
|
|
|
successor is a target, and pick up its stack height. */
|
|
|
|
|
if (aop_goto == op - aop_map
|
|
|
|
|
&& i + 3 < ax->len)
|
|
|
|
|
{
|
1999-07-07 22:19:36 +02:00
|
|
|
|
if (!targets[i + 3])
|
1999-04-16 03:35:26 +02:00
|
|
|
|
{
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax->flaw = agent_flaw_hole;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
height = heights[i + 3];
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* For reg instructions, record the register in the bit mask. */
|
|
|
|
|
if (aop_reg == op - aop_map)
|
|
|
|
|
{
|
|
|
|
|
int reg = read_const (ax, i + 1, 2);
|
|
|
|
|
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax_reg_mask (ax, reg);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Check that all the targets are on boundaries. */
|
|
|
|
|
for (i = 0; i < ax->len; i++)
|
|
|
|
|
if (targets[i] && !boundary[i])
|
|
|
|
|
{
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax->flaw = agent_flaw_bad_jump;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
2010-04-24 01:51:05 +02:00
|
|
|
|
ax->final_height = height;
|
1999-04-16 03:35:26 +02:00
|
|
|
|
}
|