1999-04-16 03:35:26 +02:00
|
|
|
|
/* GDB-specific functions for operating on agent expressions
|
2014-01-01 04:54:24 +01:00
|
|
|
|
Copyright (C) 1998-2014 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
|
|
|
|
|
|
|
|
|
#ifndef AX_GDB_H
|
|
|
|
|
#define AX_GDB_H
|
2003-04-12 Andrew Cagney <cagney@redhat.com>
* gdbarch.sh: Add missing opaque declarations.
* gdbarch.h: Regnerate.
* symtab.h: Add missing opaque declarations.
* value.h, target.h, symfile.h, stabsread.h: Ditto.
* x86-64-tdep.h, xmodem.h, monitor.h, typeprint.h: Ditto.
* srec.h, solib-svr4.h, source.h, inferior.h: Ditto.
* ser-unix.h, serial.h, remote-utils.h, gdbcore.h: Ditto.
* ppc-tdep.h, ocd.h, mips-tdep.h, gdbtypes.h: Ditto.
* buildsym.h, builtin-regs.h, linespec.h, language.h: Ditto.
* i387-tdep.h, gdbthread.h, event-top.h, gdb.h: Ditto.
* dwarf2cfi.h, doublest.h, disasm.h, cp-abi.h: Ditto.
* cli-out.h, c-lang.h, ax-gdb.h, arch-utils.h: Ditto.
* ada-lang.h, config/nm-lynx.h, config/nm-linux.h: Ditto.
* config/sparc/tm-sp64.h, config/rs6000/tm-rs6000.h: Ditto.
* config/pa/tm-hppah.h, config/m68k/tm-delta68.h: Ditto.
* cli/cli-setshow.h, cli/cli-script.h: Ditto.
2003-04-12 19:41:26 +02:00
|
|
|
|
|
|
|
|
|
struct expression;
|
2013-06-26 19:22:52 +02:00
|
|
|
|
union exp_element;
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Types and enums */
|
|
|
|
|
|
|
|
|
|
/* GDB stores expressions in the form of a flattened tree (struct
|
|
|
|
|
expression), so we just walk that tree and generate agent bytecodes
|
|
|
|
|
as we go along.
|
|
|
|
|
|
|
|
|
|
GDB's normal evaluation uses struct value, which contains the
|
|
|
|
|
expression's value as well as its address or the register it came
|
|
|
|
|
from. The `+' operator uses the value, whereas the unary `&'
|
|
|
|
|
operator will use the address portion. The `=' operator will use
|
|
|
|
|
the address or register number of its left hand side.
|
|
|
|
|
|
|
|
|
|
The issues are different when generating agent bytecode. Given a
|
|
|
|
|
variable reference expression, we should not necessarily generate
|
|
|
|
|
code to fetch its value, because the next operator may be `=' or
|
|
|
|
|
unary `&'. Instead, when we recurse on a subexpression, we
|
|
|
|
|
indicate whether we want that expression to produce an lvalue or an
|
|
|
|
|
rvalue. If we requested an lvalue, then the recursive call tells
|
|
|
|
|
us whether it generated code to compute an address on the stack, or
|
|
|
|
|
whether the lvalue lives in a register.
|
|
|
|
|
|
|
|
|
|
The `axs' prefix here means `agent expression, static', because
|
|
|
|
|
this is all static analysis of the expression, i.e. analysis which
|
|
|
|
|
doesn't depend on the contents of memory and registers. */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Different kinds of agent expression static values. */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
enum axs_lvalue_kind
|
|
|
|
|
{
|
|
|
|
|
/* We generated code to compute the subexpression's value.
|
|
|
|
|
Constants and arithmetic operators yield this. */
|
|
|
|
|
axs_rvalue,
|
|
|
|
|
|
|
|
|
|
/* We generated code to yield the subexpression's value's address on
|
|
|
|
|
the top of the stack. If the caller needs an rvalue, it should
|
|
|
|
|
call require_rvalue to produce the rvalue from this address. */
|
|
|
|
|
axs_lvalue_memory,
|
|
|
|
|
|
|
|
|
|
/* We didn't generate any code, and the stack is undisturbed,
|
|
|
|
|
because the subexpression's value lives in a register; u.reg is
|
|
|
|
|
the register number. If the caller needs an rvalue, it should
|
|
|
|
|
call require_rvalue to produce the rvalue from this register
|
|
|
|
|
number. */
|
|
|
|
|
axs_lvalue_register
|
|
|
|
|
};
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
|
|
|
|
/* Structure describing what we got from a subexpression. Think of
|
|
|
|
|
this as parallel to value.h's enum lval_type, except that we're
|
|
|
|
|
describing a value which will exist when the expression is
|
|
|
|
|
evaluated in the future, not a value we have in our hand. */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
struct axs_value
|
|
|
|
|
{
|
|
|
|
|
enum axs_lvalue_kind kind; /* see above */
|
|
|
|
|
|
|
|
|
|
/* The type of the subexpression. Even if lvalue == axs_lvalue_memory,
|
|
|
|
|
this is the type of the value itself; the value on the stack is a
|
2010-12-31 20:16:37 +01:00
|
|
|
|
"pointer to" an object of this type. */
|
1999-07-07 22:19:36 +02:00
|
|
|
|
struct type *type;
|
|
|
|
|
|
2010-03-17 23:04:43 +01:00
|
|
|
|
/* If nonzero, this is a variable which does not actually exist in
|
|
|
|
|
the program. */
|
|
|
|
|
char optimized_out;
|
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
union
|
|
|
|
|
{
|
|
|
|
|
/* if kind == axs_lvalue_register, this is the register number */
|
|
|
|
|
int reg;
|
|
|
|
|
}
|
|
|
|
|
u;
|
|
|
|
|
};
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
1999-07-07 22:19:36 +02:00
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
/* Translating GDB expressions into agent expressions. */
|
|
|
|
|
|
|
|
|
|
/* Given a GDB expression EXPR, return bytecode to trace its value.
|
|
|
|
|
The result will use the `trace' and `trace_quick' bytecodes to
|
|
|
|
|
record the value of all memory touched by the expression, and leave
|
|
|
|
|
no values on the stack. The caller can then use the ax_reqs
|
|
|
|
|
function to discover which registers the expression uses. */
|
2013-03-21 17:09:27 +01:00
|
|
|
|
extern struct agent_expr *gen_trace_for_expr (CORE_ADDR, struct expression *,
|
|
|
|
|
int);
|
1999-04-16 03:35:26 +02:00
|
|
|
|
|
2010-03-17 23:04:43 +01:00
|
|
|
|
extern struct agent_expr *gen_trace_for_var (CORE_ADDR, struct gdbarch *,
|
2013-03-21 17:09:27 +01:00
|
|
|
|
struct symbol *, int);
|
2009-12-24 01:40:49 +01:00
|
|
|
|
|
2011-09-27 15:09:37 +02:00
|
|
|
|
extern struct agent_expr *gen_trace_for_return_address (CORE_ADDR,
|
2013-03-21 17:09:27 +01:00
|
|
|
|
struct gdbarch *,
|
|
|
|
|
int);
|
2011-09-27 15:09:37 +02:00
|
|
|
|
|
2009-07-14 23:40:34 +02:00
|
|
|
|
extern struct agent_expr *gen_eval_for_expr (CORE_ADDR, struct expression *);
|
|
|
|
|
|
2012-04-27 22:47:57 +02:00
|
|
|
|
extern void gen_expr (struct expression *exp, union exp_element **pc,
|
|
|
|
|
struct agent_expr *ax, struct axs_value *value);
|
|
|
|
|
|
|
|
|
|
extern void require_rvalue (struct agent_expr *ax, struct axs_value *value);
|
|
|
|
|
|
2012-07-02 17:29:39 +02:00
|
|
|
|
struct format_piece;
|
|
|
|
|
extern struct agent_expr *gen_printf (CORE_ADDR, struct gdbarch *,
|
2013-03-07 01:48:25 +01:00
|
|
|
|
CORE_ADDR, LONGEST, const char *, int,
|
2012-07-02 17:29:39 +02:00
|
|
|
|
struct format_piece *,
|
|
|
|
|
int, struct expression **);
|
|
|
|
|
|
1999-04-16 03:35:26 +02:00
|
|
|
|
#endif /* AX_GDB_H */
|