169 && b.
k == ~ (CORE_ADDR) 0)
201 return (a.
reg == b.
reg && a.
k == b.
k);
203 gdb_assert_not_reached (
"unexpected prologue value kind");
234 pv_t array_addr, CORE_ADDR array_len,
251 if (offset.
k <= -
size
252 && offset.
k >= array_len * elt_size)
254 else if (offset.
k % elt_size != 0
259 *i = offset.
k / elt_size;
302 : m_base_reg (base_reg),
305 m_addr_mask (((((CORE_ADDR) 1 << (addr_bit - 1)) - 1) << 1) | 1),
402 || ((offset - entry->offset) &
m_addr_mask) < entry->size);
416 CORE_ADDR offset = addr.
k;
446 CORE_ADDR offset = addr.
k;
480 CORE_ADDR offset = addr.
k;
void scan(void(*func)(void *closure, pv_t addr, CORE_ADDR size, pv_t value), void *closure)
pv_t fetch(pv_t addr, CORE_ADDR size)
int overlaps(struct area_entry *entry, CORE_ADDR offset, CORE_ADDR size)
struct area_entry * find_entry(CORE_ADDR offset)
bool find_reg(struct gdbarch *gdbarch, int reg, CORE_ADDR *offset_p)
pv_area(int base_reg, int addr_bit)
bool store_would_trash(pv_t addr)
struct area_entry * m_entry
void store(pv_t addr, CORE_ADDR size, pv_t value)
pv_t pv_subtract(pv_t a, pv_t b)
static void constant_last(pv_t *a, pv_t *b)
pv_t pv_constant(CORE_ADDR k)
int pv_is_register_k(pv_t a, int r, CORE_ADDR k)
pv_t pv_register(int reg, CORE_ADDR k)
int pv_is_identical(pv_t a, pv_t b)
pv_t pv_add(pv_t a, pv_t b)
pv_t pv_logical_and(pv_t a, pv_t b)
pv_t pv_add_constant(pv_t v, CORE_ADDR k)
int pv_is_register(pv_t a, int r)
enum pv_boolean pv_is_array_ref(pv_t addr, CORE_ADDR size, pv_t array_addr, CORE_ADDR array_len, CORE_ADDR elt_size, int *i)
int pv_is_constant(pv_t a)
int register_size(struct gdbarch *gdbarch, int regnum)
void(* func)(remote_target *remote, char *)
enum prologue_value_kind kind