2010-01-21 01:38:52 +00:00
|
|
|
/* radare - LGPL - Copyright 2009-2010 pancake<nopcode.org> */
|
2009-02-05 21:08:46 +00:00
|
|
|
|
|
|
|
#include <r_bp.h>
|
2009-04-13 22:47:02 +00:00
|
|
|
#include "../config.h"
|
|
|
|
|
|
|
|
static struct r_bp_handle_t *bp_static_plugins[] =
|
|
|
|
{ R_BP_STATIC_PLUGINS };
|
2009-02-05 21:08:46 +00:00
|
|
|
|
2010-01-21 01:38:52 +00:00
|
|
|
R_API struct r_bp_t *r_bp_init(struct r_bp_t *bp)
|
2009-02-05 21:08:46 +00:00
|
|
|
{
|
2009-04-13 22:47:02 +00:00
|
|
|
int i;
|
2010-01-21 01:38:52 +00:00
|
|
|
if (bp) {
|
|
|
|
bp->cur = NULL;
|
|
|
|
bp->nbps = 0;
|
|
|
|
bp->trace_bp = 0;
|
|
|
|
bp->stepcont = R_BP_CONT_NORMAL;
|
|
|
|
bp->breakpoint = NULL;
|
|
|
|
INIT_LIST_HEAD(&bp->bps);
|
|
|
|
INIT_LIST_HEAD(&bp->plugins);
|
|
|
|
for (i=0;bp_static_plugins[i];i++)
|
|
|
|
r_bp_handle_add (bp, bp_static_plugins[i]);
|
|
|
|
memset (&bp->iob, 0, sizeof(bp->iob));
|
|
|
|
}
|
|
|
|
return bp;
|
2009-02-05 21:08:46 +00:00
|
|
|
}
|
|
|
|
|
2010-01-21 01:38:52 +00:00
|
|
|
R_API struct r_bp_t *r_bp_new() {
|
|
|
|
return r_bp_init (MALLOC_STRUCT (struct r_bp_t));
|
2009-02-05 21:08:46 +00:00
|
|
|
}
|
|
|
|
|
2009-09-13 22:37:28 +00:00
|
|
|
R_API struct r_bp_t *r_bp_free(struct r_bp_t *bp)
|
2009-04-12 22:46:44 +00:00
|
|
|
{
|
2009-09-13 22:37:28 +00:00
|
|
|
/* XXX : properly destroy bp list */
|
2010-01-21 01:38:52 +00:00
|
|
|
free (bp);
|
2009-09-13 22:37:28 +00:00
|
|
|
return NULL;
|
2009-04-12 22:46:44 +00:00
|
|
|
}
|
|
|
|
|
2009-09-13 22:37:28 +00:00
|
|
|
R_API int r_bp_get_bytes(struct r_bp_t *bp, ut8 *buf, int len, int endian, int idx)
|
2009-04-12 22:46:44 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct r_bp_arch_t *b;
|
|
|
|
if (bp->cur) {
|
|
|
|
/* XXX: can be buggy huh : infinite loop is possible */
|
|
|
|
for(i=0;1;i++) {
|
|
|
|
b = &bp->cur->bps[i%bp->cur->nbps];
|
2009-04-12 23:10:22 +00:00
|
|
|
if (b->endian == endian && idx%(i+1)==0) {
|
2009-04-12 22:46:44 +00:00
|
|
|
for(i=0;i<len;) {
|
2010-01-21 01:38:52 +00:00
|
|
|
memcpy (buf+i, b->bytes, len);
|
2009-04-12 22:46:44 +00:00
|
|
|
i += b->length;
|
|
|
|
}
|
2010-01-21 01:38:52 +00:00
|
|
|
return b->length;
|
2009-04-12 22:46:44 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-01-21 01:38:52 +00:00
|
|
|
return 0;
|
2009-04-12 22:46:44 +00:00
|
|
|
}
|
|
|
|
|
2010-01-26 00:28:33 +00:00
|
|
|
R_API RBreakpointItem *r_bp_at_addr(RBreakpoint *bp, ut64 addr, int rwx)
|
2009-02-05 21:08:46 +00:00
|
|
|
{
|
2009-04-12 22:46:44 +00:00
|
|
|
struct list_head *pos;
|
2010-01-26 00:28:33 +00:00
|
|
|
RBreakpointItem *b;
|
2009-04-12 22:46:44 +00:00
|
|
|
|
2010-01-21 01:38:52 +00:00
|
|
|
eprintf ("===ataddr=== 0x%08llx\n", addr);
|
2009-04-12 22:46:44 +00:00
|
|
|
list_for_each(pos, &bp->bps) {
|
|
|
|
b = list_entry(pos, struct r_bp_item_t, list);
|
2010-01-21 01:38:52 +00:00
|
|
|
eprintf ("---ataddr--- 0x%08llx %d %d\n", b->addr, b->size, b->recoil);
|
2009-04-12 22:46:44 +00:00
|
|
|
if (addr >= b->addr && addr <= b->addr+b->size && rwx&b->rwx)
|
2010-01-21 01:38:52 +00:00
|
|
|
return b;
|
2009-04-12 22:46:44 +00:00
|
|
|
}
|
2010-01-21 01:38:52 +00:00
|
|
|
return NULL;
|
2009-04-12 22:46:44 +00:00
|
|
|
}
|
|
|
|
|
2009-07-08 11:49:55 +00:00
|
|
|
R_API struct r_bp_item_t *r_bp_enable(struct r_bp_t *bp, ut64 addr, int set)
|
2009-04-12 22:46:44 +00:00
|
|
|
{
|
|
|
|
struct list_head *pos;
|
|
|
|
struct r_bp_item_t *b;
|
|
|
|
list_for_each(pos, &bp->bps) {
|
|
|
|
b = list_entry(pos, struct r_bp_item_t, list);
|
|
|
|
if (addr >= b->addr && addr <= b->addr+b->size) {
|
|
|
|
b->enabled = set;
|
2009-04-15 10:01:12 +00:00
|
|
|
return b;
|
2009-04-12 22:46:44 +00:00
|
|
|
}
|
|
|
|
}
|
2009-04-15 10:01:12 +00:00
|
|
|
return NULL;
|
2009-04-12 22:46:44 +00:00
|
|
|
}
|
|
|
|
|
2009-09-13 22:37:28 +00:00
|
|
|
R_API int r_bp_stepy_continuation(struct r_bp_t *bp)
|
|
|
|
{
|
|
|
|
// TODO: implement
|
|
|
|
return bp->stepcont;
|
|
|
|
}
|
|
|
|
|
|
|
|
R_API int r_bp_add_cond(struct r_bp_t *bp, const char *cond)
|
|
|
|
{
|
|
|
|
// TODO: implement contitional breakpoints
|
|
|
|
bp->stepcont = R_TRUE;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
R_API int r_bp_del_cond(struct r_bp_t *bp, int idx)
|
|
|
|
{
|
|
|
|
// add contitional
|
|
|
|
bp->stepcont = R_FALSE;
|
|
|
|
return R_TRUE;
|
|
|
|
}
|
|
|
|
|
2009-04-12 22:46:44 +00:00
|
|
|
/* TODO: detect overlapping of breakpoints */
|
2009-09-13 22:37:28 +00:00
|
|
|
static struct r_bp_item_t *r_bp_add(struct r_bp_t *bp, const ut8 *obytes, ut64 addr, int size, int hw, int rwx)
|
2009-04-12 22:46:44 +00:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct r_bp_item_t *b;
|
2010-01-21 01:38:52 +00:00
|
|
|
if (r_bp_at_addr (bp, addr, rwx)) {
|
|
|
|
eprintf ("Breakpoint already set at this address.\n");
|
2009-04-12 22:46:44 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
2010-01-21 01:38:52 +00:00
|
|
|
b = MALLOC_STRUCT (struct r_bp_item_t);
|
2009-04-12 22:46:44 +00:00
|
|
|
b->pids[0] = 0; /* for any pid */
|
|
|
|
b->addr = addr;
|
|
|
|
b->size = size;
|
2009-09-13 22:37:28 +00:00
|
|
|
b->enabled = R_TRUE;
|
2009-04-12 22:46:44 +00:00
|
|
|
b->hw = hw;
|
|
|
|
b->trace = 0;
|
2010-01-21 01:38:52 +00:00
|
|
|
|
|
|
|
if (hw) {
|
|
|
|
b->bbytes = NULL;
|
|
|
|
b->obytes = NULL;
|
|
|
|
b->recoil = 0;
|
|
|
|
} else {
|
|
|
|
b->bbytes = malloc (size+16);
|
|
|
|
if (obytes) {
|
|
|
|
b->obytes = malloc(size);
|
|
|
|
memcpy (b->obytes, obytes, size);
|
|
|
|
} else b->obytes = NULL;
|
|
|
|
/* XXX: endian .. use bp->endian */
|
|
|
|
// XXX for hw breakpoints there are no bytes
|
|
|
|
ret = r_bp_get_bytes (bp, b->bbytes, size, 0, 0);
|
|
|
|
if (ret == 0) {
|
|
|
|
eprintf ("Cannot get breakpoint bytes. No r_bp_use()?\n");
|
|
|
|
free (b->obytes);
|
|
|
|
free (b->bbytes);
|
|
|
|
free (b);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
b->recoil = ret;
|
|
|
|
}
|
|
|
|
|
2009-04-12 22:46:44 +00:00
|
|
|
bp->nbps++;
|
2010-01-21 01:38:52 +00:00
|
|
|
list_add_tail (&(b->list), &bp->bps);
|
2009-04-12 22:46:44 +00:00
|
|
|
return b;
|
|
|
|
}
|
|
|
|
|
2009-12-24 02:17:53 +00:00
|
|
|
R_API int r_bp_add_fault(struct r_bp_t *bp, ut64 addr, int size, int rwx)
|
|
|
|
{
|
|
|
|
// TODO
|
2010-01-04 00:25:52 +00:00
|
|
|
return R_FALSE;
|
2009-12-24 02:17:53 +00:00
|
|
|
}
|
|
|
|
|
2009-09-13 22:37:28 +00:00
|
|
|
R_API struct r_bp_item_t *r_bp_add_sw(struct r_bp_t *bp, ut64 addr, int size, int rwx)
|
|
|
|
{
|
|
|
|
struct r_bp_item_t *item;
|
|
|
|
ut8 *bytes;
|
2010-01-21 01:38:52 +00:00
|
|
|
if (size<1)
|
|
|
|
size = 1;
|
|
|
|
bytes = malloc (size);
|
2009-09-13 22:37:28 +00:00
|
|
|
if (bytes == NULL)
|
|
|
|
return NULL;
|
|
|
|
if (bp->iob.read_at) {
|
2010-01-21 01:38:52 +00:00
|
|
|
bp->iob.read_at (bp->iob.io, addr, bytes, size);
|
|
|
|
} else memset (bytes, 0, size);
|
|
|
|
item = r_bp_add (bp, bytes, addr, size, R_BP_TYPE_SW, rwx);
|
|
|
|
free (bytes);
|
2009-09-13 22:37:28 +00:00
|
|
|
return item;
|
|
|
|
}
|
|
|
|
|
|
|
|
R_API struct r_bp_item_t *r_bp_add_hw(struct r_bp_t *bp, ut64 addr, int size, int rwx)
|
|
|
|
{
|
2010-01-21 01:38:52 +00:00
|
|
|
return r_bp_add (bp, NULL, addr, size, R_BP_TYPE_HW, rwx);
|
2009-09-13 22:37:28 +00:00
|
|
|
}
|
|
|
|
|
2009-07-08 11:49:55 +00:00
|
|
|
R_API int r_bp_del(struct r_bp_t *bp, ut64 addr)
|
2009-04-12 22:46:44 +00:00
|
|
|
{
|
|
|
|
struct list_head *pos;
|
|
|
|
struct r_bp_item_t *b;
|
|
|
|
list_for_each(pos, &bp->bps) {
|
|
|
|
b = list_entry(pos, struct r_bp_item_t, list);
|
|
|
|
if (b->addr == addr) {
|
2010-01-21 01:38:52 +00:00
|
|
|
list_del (&b->list);
|
2009-04-12 22:46:44 +00:00
|
|
|
return R_TRUE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return R_FALSE;
|
2009-04-11 21:22:20 +00:00
|
|
|
}
|
|
|
|
|
2009-09-13 22:37:28 +00:00
|
|
|
// TODO: rename or drop?
|
2010-01-21 01:38:52 +00:00
|
|
|
// TODO: use a r_bp_item instead of address
|
|
|
|
// TODO: we can just drop it.. its just b->trace = R_TRUE or so..
|
2009-09-13 22:37:28 +00:00
|
|
|
R_API int r_bp_set_trace(struct r_bp_t *bp, ut64 addr, int set)
|
2009-04-15 10:01:12 +00:00
|
|
|
{
|
|
|
|
struct list_head *pos;
|
2009-09-13 22:37:28 +00:00
|
|
|
struct r_bp_item_t *b;
|
|
|
|
list_for_each(pos, &bp->bps) {
|
|
|
|
b = list_entry(pos, struct r_bp_item_t, list);
|
|
|
|
if (addr >= b->addr && addr <= b->addr+b->size) {
|
|
|
|
b->trace = set;
|
|
|
|
return R_TRUE;
|
|
|
|
}
|
2009-04-15 10:01:12 +00:00
|
|
|
}
|
2010-01-21 01:38:52 +00:00
|
|
|
return R_FALSE;
|
2009-09-13 22:37:28 +00:00
|
|
|
}
|
|
|
|
|
2010-01-21 01:38:52 +00:00
|
|
|
#if 0
|
2009-09-13 22:37:28 +00:00
|
|
|
// TODO: rename or remove
|
|
|
|
R_API int r_bp_set_trace_bp(struct r_bp_t *bp, ut64 addr, int set)
|
|
|
|
{
|
|
|
|
bp->trace_all = set;
|
|
|
|
bp->trace_bp = addr;
|
|
|
|
return R_TRUE;
|
2009-04-15 10:01:12 +00:00
|
|
|
}
|
2010-01-21 01:38:52 +00:00
|
|
|
#endif
|
2009-04-15 10:01:12 +00:00
|
|
|
|
2009-09-13 22:37:28 +00:00
|
|
|
// TODO: deprecate
|
2009-04-11 21:22:20 +00:00
|
|
|
R_API int r_bp_list(struct r_bp_t *bp, int rad)
|
|
|
|
{
|
2009-09-13 22:37:28 +00:00
|
|
|
int n = 0;
|
2009-04-12 22:46:44 +00:00
|
|
|
struct r_bp_item_t *b;
|
|
|
|
struct list_head *pos;
|
2010-01-21 01:38:52 +00:00
|
|
|
|
|
|
|
eprintf ("Breakpoint list:\n");
|
2009-04-12 22:46:44 +00:00
|
|
|
list_for_each(pos, &bp->bps) {
|
|
|
|
b = list_entry(pos, struct r_bp_item_t, list);
|
2010-01-21 01:38:52 +00:00
|
|
|
printf ("0x%08llx - 0x%08llx %d %c%c%c %s %s %s\n",
|
2009-04-12 22:46:44 +00:00
|
|
|
b->addr, b->addr+b->size, b->size,
|
2010-01-04 00:25:52 +00:00
|
|
|
(b->rwx & R_BP_PROT_READ)?'r':'-',
|
|
|
|
(b->rwx & R_BP_PROT_WRITE)?'w':'-',
|
|
|
|
(b->rwx & R_BP_PROT_EXEC)?'x':'-',
|
2009-04-12 22:46:44 +00:00
|
|
|
b->hw?"hw":"sw",
|
2009-04-12 23:10:22 +00:00
|
|
|
b->trace?"trace":"break",
|
|
|
|
b->enabled?"enabled":"disabled");
|
2009-04-12 22:46:44 +00:00
|
|
|
/* TODO: Show list of pids and trace points, conditionals */
|
2009-09-13 22:37:28 +00:00
|
|
|
n++;
|
2009-04-12 22:46:44 +00:00
|
|
|
}
|
2009-09-13 22:37:28 +00:00
|
|
|
return n;
|
2009-02-05 21:08:46 +00:00
|
|
|
}
|