radare2/libr/reg/reg.c

419 lines
9.6 KiB
C
Raw Normal View History

/* radare - LGPL - Copyright 2009-2014 - pancake */
#include <r_reg.h>
#include <r_util.h>
#include <list.h>
R_LIB_VERSION (r_reg);
static const char *types[R_REG_TYPE_LAST+1] = {
"gpr", "drx", "fpu", "mmx", "xmm", "flg", "seg", NULL
};
R_API const char *r_reg_get_type(int idx) {
if (idx>=0 && idx<R_REG_TYPE_LAST)
return types[idx];
return NULL;
}
static void r_reg_item_free(RRegItem *item) {
free (item->name);
free (item->flags);
free (item);
}
R_API int r_reg_get_name_idx(const char *type) {
if (type)
switch (*type | (type[1]<<8)) {
/* flags */
case 'z'+('f'<<8): return R_REG_NAME_ZF;
case 's'+('f'<<8): return R_REG_NAME_SF;
case 'c'+('f'<<8): return R_REG_NAME_CF;
case 'o'+('f'<<8): return R_REG_NAME_OF;
/* gpr */
case 'p'+('c'<<8): return R_REG_NAME_PC;
case 's'+('r'<<8): return R_REG_NAME_SR;
case 's'+('p'<<8): return R_REG_NAME_SP;
case 'b'+('p'<<8): return R_REG_NAME_BP;
case 's'+('n'<<8): return R_REG_NAME_SN;
/* args */
case 'a'+('0'<<8): return R_REG_NAME_A0;
case 'a'+('1'<<8): return R_REG_NAME_A1;
case 'a'+('2'<<8): return R_REG_NAME_A2;
case 'a'+('3'<<8): return R_REG_NAME_A3;
}
return -1;
}
R_API int r_reg_set_name(RReg *reg, int role, const char *name) {
if (role>=0 && role<R_REG_NAME_LAST) {
reg->name[role] = r_str_dup (reg->name[role], name);
return R_TRUE;
}
return R_FALSE;
}
R_API const char *r_reg_get_name(RReg *reg, int role) {
if (reg && role>=0 && role<R_REG_NAME_LAST)
return reg->name[role];
return NULL;
}
R_API void r_reg_free_internal(RReg *reg) {
int i;
free (reg->reg_profile_str);
reg->reg_profile_str = NULL;
for (i = 0; i < R_REG_NAME_LAST; i++) {
2014-08-24 23:18:35 +00:00
if (reg->name[i]) {
free (reg->name[i]);
reg->name[i] = NULL;
}
2014-08-25 02:27:25 +00:00
}
for (i = 0; i<R_REG_TYPE_LAST; i++) {
2014-08-25 02:27:25 +00:00
r_list_purge (reg->regset[i].regs);
reg->regset[i].regs = r_list_newf ((RListFree)r_reg_item_free);
}
reg->size = 0;
}
R_API void r_reg_free(RReg *reg) {
int i;
if (!reg)
return;
for (i = 0; i < R_REG_TYPE_LAST; i++) {
r_list_purge (reg->regset[i].pool);
reg->regset[i].pool = NULL;
}
r_reg_free_internal (reg);
free (reg);
}
R_API RReg *r_reg_new() {
RRegArena *arena;
RReg *reg = R_NEW0 (RReg);
int i;
for (i=0; i<R_REG_TYPE_LAST; i++) {
arena = r_reg_arena_new (0);
2014-05-03 07:09:10 +00:00
if (!arena) {
free (reg);
return NULL;
}
reg->regset[i].pool = r_list_newf ((RListFree)r_reg_arena_free);
reg->regset[i].regs = r_list_newf ((RListFree)r_reg_item_free);
reg->regset[i].arena = arena;
//r_list_append (reg->regset[i].pool, arena);
}
return reg;
}
R_API int r_reg_type_by_name(const char *str) {
int i;
for (i=0; i<R_REG_TYPE_LAST && types[i]; i++)
if (!strcmp (types[i], str))
return i;
if (!strcmp (str, "all"))
return R_REG_TYPE_ALL;
eprintf ("Unknown register type: '%s'\n", str);
return -1;
}
static const char *parse_alias (RReg *reg, char **tok, const int n) {
int role;
if (n != 2)
return "Invalid syntax";
role = r_reg_get_name_idx(tok[0] + 1);
return r_reg_set_name(reg, role, tok[1]) ?
NULL :
"Invalid alias";
}
// Sizes prepended with a dot are expressed in bits
// strtoul with base 0 allows the input to be in decimal/octal/hex format
#define parse_size(c) \
((c)[0] == '.') ? \
strtoul((c) + 1, &end, 10) : \
strtoul((c), &end, 0) << 3;
static const char *parse_def (RReg *reg, char **tok, const int n) {
RRegItem *item;
char *end;
int type;
if (n != 5 && n != 6)
return "Invalid syntax";
type = r_reg_type_by_name (tok[0]);
if (type < 0)
return "Invalid register type";
item = R_NEW0 (RRegItem);
item->type = type;
item->name = strdup (tok[1]);
// All the numeric arguments are strictly checked
item->size = parse_size (tok[2]);
if (*end != '\0' || !item->size) {
r_reg_item_free (item);
return "Invalid size";
}
item->offset = parse_size (tok[3]);
if (*end != '\0') {
r_reg_item_free (item);
return "Invalid offset";
}
item->packed_size = parse_size (tok[4]);
if (*end != '\0') {
r_reg_item_free (item);
return "Invalid packed size";
}
// Dynamically update the list of supported bit sizes
reg->bits |= item->size;
// This is optional
if (n == 6)
item->flags = strdup (tok[5]);
// Don't allow duplicate registers
if (r_reg_get (reg, item->name, R_REG_TYPE_ALL)) {
r_reg_item_free (item);
return "Duplicate register definition";
}
r_list_append (reg->regset[item->type].regs, item);
// Update the overall profile size
if (item->offset + item->size > reg->size)
reg->size = item->offset + item->size;
return NULL;
}
#define PARSER_MAX_TOKENS 8
R_API int r_reg_set_profile_string(RReg *reg, const char *str) {
char *tok[PARSER_MAX_TOKENS];
char tmp[128];
int i, j, l;
const char *p = str;
if (!reg || !str)
return R_FALSE;
// Same profile, no need to change
if (reg->reg_profile_str && !strcmp (reg->reg_profile_str, str))
return R_TRUE;
// Purge the old registers
r_reg_free_internal (reg);
// Cache the profile string
2014-09-10 00:21:10 +00:00
reg->reg_profile_str = strdup (str);
// Line number
l = 0;
// For every line
do {
// Increment line number
l++;
// Skip comment lines
if (*p == '#') {
while (*p != '\n')
p++;
continue;
}
j = 0;
// For every word
while (*p) {
// Skip the whitespace
while (*p == ' ' || *p == '\t')
p++;
// Skip the rest of the line is a comment is encountered
if (*p == '#')
while (*p != '\n')
p++;
// EOL ?
if (*p == '\n')
break;
// Gather a handful of chars
// Use isgraph instead of isprint because the latter considers ' ' printable
for (i = 0; isgraph (*p) && i < sizeof(tmp) - 1;)
tmp[i++] = *p++;
tmp[i] = '\0';
// Limit the number of tokens
if (j > PARSER_MAX_TOKENS - 1)
break;
// Save the token
tok[j++] = strdup (tmp);
}
// Empty line, eww
if (j) {
// Do the actual parsing
char *first = tok[0];
// Check whether it's defining an alias or a register
const char *r = (*first == '=') ?
parse_alias (reg, tok, j) :
parse_def (reg, tok, j);
// Clean up
for (i = 0; i < j; i++)
free(tok[i]);
// Warn the user if something went wrong
if (r) {
eprintf("%s: Parse error @ line %d (%s)\n", __FUNCTION__, l, r);
// Clean up
r_reg_free_internal (reg);
return R_FALSE;
}
}
} while(*p++);
// Align to byte boundary if needed
if (reg->size&7)
reg->size += 8 - (reg->size&7);
// Transform to bytes
reg->size >>= 3;
r_reg_fit_arena (reg);
return R_TRUE;
}
R_API int r_reg_set_profile(RReg *reg, const char *profile) {
2014-09-10 22:41:33 +00:00
int ret;
char *base, *file;
char *str = r_file_slurp (profile, NULL);
if (!str) {
// XXX we must define this varname in r_lib.h /compiletime/
base = r_sys_getenv ("LIBR_PLUGINS");
if (base) {
2011-08-27 22:01:03 +00:00
file = r_str_concat (base, profile);
str = r_file_slurp (file, NULL);
free (file);
}
}
if (!str) {
eprintf ("r_reg_set_profile: Cannot find '%s'\n", profile);
return R_FALSE;
2014-05-03 07:06:46 +00:00
}
2014-09-10 22:41:33 +00:00
ret = r_reg_set_profile_string (reg, str);
free (str);
return ret;
}
R_API ut64 r_reg_setv(RReg *reg, const char *name, ut64 val) {
return r_reg_set_value (reg, r_reg_get (reg, name, -1), val);
}
R_API ut64 r_reg_getv(RReg *reg, const char *name) {
return r_reg_get_value (reg, r_reg_get (reg, name, -1));
}
R_API RRegItem *r_reg_get(RReg *reg, const char *name, int type) {
RListIter *iter;
RRegItem *r;
int i, e;
if (!reg || !name)
return NULL;
if (type == -1) {
i = 0;
e = R_REG_TYPE_LAST;
} else {
i = type;
e = type+1;
}
for (; i<e; i++) {
r_list_foreach (reg->regset[i].regs, iter, r) {
2014-08-08 00:11:23 +00:00
if (r->name && !strcmp (r->name, name)) {
return r;
2014-08-08 00:11:23 +00:00
}
}
}
return NULL;
}
R_API RList *r_reg_get_list(RReg *reg, int type) {
if (type < 0 || type > (R_REG_TYPE_LAST-1))
return NULL;
return reg->regset[type].regs;
}
R_API ut64 r_reg_cmp(RReg *reg, RRegItem *item) {
ut64 ret, ret2;
RListIter *it;
int ptr = !(reg->iters%2);
int len = (item->size/8); // TODO: must use r_mem_bitcmp or so.. flags not correctly checked
int off = BITS2BYTES (item->offset);
RRegArena *dst, *src;
it = r_list_head (reg->regset[item->type].pool);
if (!it || !it->n)
return UT64_MAX;
src = r_list_head (reg->regset[item->type].pool)->data;
dst = it->n->data;
if (off+len>src->size) len = src->size-off;
if (off+len>dst->size) len = dst->size-off;
if (len>1 && memcmp (dst->bytes+off, src->bytes+off, len)) {
r_reg_arena_set (reg, ptr, 0);
ret = r_reg_get_value (reg, item);
r_reg_arena_set (reg, !ptr, 0);
ret2 = r_reg_get_value (reg, item);
return ret-ret2;
}
return 0LL;
}
// TODO regsize is in bits, delta in bytes, maybe we should standarize this..
R_API RRegItem *r_reg_get_at (RReg *reg, int type, int regsize, int delta) {
RList *list = r_reg_get_list (reg, type);
RRegItem *ri;
RListIter *iter;
r_list_foreach (list, iter, ri) {
if (ri->size == regsize) {
if (BITS2BYTES(ri->offset) == delta)
return ri;
}
}
return NULL;
}
/* return the next register in the current regset that differs from */
R_API RRegItem *r_reg_next_diff(RReg *reg, int type, const ut8* buf, int buflen, RRegItem *prev_ri, int regsize) {
int bregsize = BITS2BYTES (regsize);
RRegArena *arena;
int delta;
if (type < 0 || type > (R_REG_TYPE_LAST-1))
return NULL;
arena = reg->regset[type].arena;
delta = prev_ri? prev_ri->offset+prev_ri->size: 0;
for (;;) {
if (delta+bregsize>=arena->size || delta+bregsize >= buflen)
break;
if (memcmp (arena->bytes+delta, buf+delta, bregsize)) {
RRegItem *ri = r_reg_get_at (reg, type, regsize, delta);
if (ri) return ri;
}
delta += bregsize;
}
return NULL;
}
R_API RRegSet *r_reg_regset_get(RReg *r, int type) {
RRegSet *rs;
if (type<0 || type>=R_REG_TYPE_LAST)
return NULL;
rs = &r->regset[type];
if (rs->arena)
return rs;
return NULL;
}