retval = value_at_lazy (subobj_type,
address + subobj_offset);
if (in_stack_memory)
- retval->set_stack (1);
+ retval->set_stack (true);
}
break;
struct gdbarch *gdbarch = frame_unwind_arch (frame);
struct value *v = value_at_lazy (register_type (gdbarch, regnum), addr);
- v->set_stack (1);
+ v->set_stack (true);
return v;
}
void
read_value_memory (struct value *val, LONGEST bit_offset,
- int stack, CORE_ADDR memaddr,
+ bool stack, CORE_ADDR memaddr,
gdb_byte *buffer, size_t length)
{
ULONGEST xfered_total = 0;
gdb_assert (len >= 0);
if (len > 0)
- read_value_memory (this, 0, stack (), addr,
+ read_value_memory (this, false, stack (), addr,
contents_all_raw ().data (), len);
}
: m_modifiable (true),
m_lazy (true),
m_initialized (true),
- m_stack (0),
+ m_stack (false),
m_is_zero (false),
m_in_history (false),
m_type (type_),
void set_enclosing_type (struct type *new_type);
- int stack () const
+ bool stack () const
{ return m_stack; }
- void set_stack (int val)
+ void set_stack (bool val)
{ m_stack = val; }
/* If this value is lval_computed, return its lval_funcs
/* If value is from the stack. If this is set, read_stack will be
used instead of read_memory to enable extra caching. */
- unsigned int m_stack : 1;
+ bool m_stack : 1;
/* True if this is a zero value, created by 'value::zero'; false
otherwise. */
whether the memory is known to be stack memory. */
extern void read_value_memory (struct value *val, LONGEST bit_offset,
- int stack, CORE_ADDR memaddr,
+ bool stack, CORE_ADDR memaddr,
gdb_byte *buffer, size_t length);
/* Cast SCALAR_VALUE to the element type of VECTOR_TYPE, then replicate