static void sparc_determine_frameoffset(ir_node *const node,
int const sp_offset)
{
if (is_sparc_FrameAddr(node)) {
sparc_attr_t *const attr = get_sparc_attr(node);
ir_entity const *const entity = attr->immediate_value_entity;
if (entity != NULL) {
attr->immediate_value += get_entity_offset(entity);
if (node_has_sp_base(node))
attr->immediate_value += sp_offset + SPARC_MIN_STACKSIZE;
}
} else if (sparc_has_load_store_attr(node)) {
sparc_load_store_attr_t *const attr = get_sparc_load_store_attr(node);
if (!attr->is_frame_entity)
return;
ir_entity const *const entity
= attr->base.immediate_value_entity;
if (entity != NULL) {
attr->base.immediate_value += get_entity_offset(entity);
if (node_has_sp_base(node))
attr->base.immediate_value += sp_offset + SPARC_MIN_STACKSIZE;
}
} else if (be_is_MemPerm(node)) {
ir_graph *irg = get_irn_irg(node);
if (sparc_get_irg_data(irg)->omit_fp)
be_set_MemPerm_offset(node, sp_offset + SPARC_MIN_STACKSIZE);
}
}
static void sparc_layout_param_entities(ir_graph *const irg, calling_convention_t *const cconv, ir_type *const non_lowered)
{
ir_entity **const param_map = be_collect_parameter_entities(irg);
ir_type *const frame_type = get_irg_frame_type(irg);
size_t const n_params = cconv->n_parameters;
/* calculate offsets/create missing entities */
for (size_t i = 0; i < n_params; ++i) {
reg_or_stackslot_t *const param = &cconv->parameters[i];
ir_entity * entity = param_map[i];
if (entity == NULL) {
if (!param->already_stored)
continue;
entity = new_parameter_entity(frame_type, i, param->type);
}
param->entity = entity;
set_entity_offset(entity, param->offset);
}
ir_entity *const function = get_irg_entity(irg);
ir_type *const function_type = get_entity_type(function);
if (is_method_variadic(function_type)) {
ir_type *unknown = get_unknown_type();
ident *id = new_id_from_str("$va_start");
ir_entity *va_start_addr = new_entity(frame_type, id, unknown);
/* sparc_variadic_fixups() fiddled with our type, find out the
* original number of parameters */
size_t const orig_n_params = get_method_n_params(non_lowered);
long offset;
if (orig_n_params < n_params) {
assert(param_map[orig_n_params] != NULL);
offset = get_entity_offset(param_map[orig_n_params]);
} else {
offset = cconv->param_stack_size + SPARC_MIN_STACKSIZE;
}
set_entity_offset(va_start_addr, offset);
cconv->va_start_addr = va_start_addr;
}
free(param_map);
}
static void process_bias(ir_node *block, bool omit_fp, int bias, int free_bytes)
{
mark_Block_block_visited(block);
/* process schedule */
sched_foreach(block, irn) {
/* set bias to nodes with entities */
ir_entity *entity = sparc_get_frame_entity(irn);
if (entity != NULL) {
int offset = get_entity_offset(entity);
if (omit_fp)
offset += bias + SPARC_MIN_STACKSIZE;
sparc_set_frame_offset(irn, offset);
}
/* The additional alignment bytes cannot be used
* anymore after alloca. */
if (is_sparc_SubSP(irn)) {
free_bytes = 0;
} else if (is_sparc_AddSP(irn)) {
assert(free_bytes == 0);
}
int irn_bias = sparc_get_sp_bias(irn);
if (irn_bias == 0) {
/* do nothing */
} else if (irn_bias == SP_BIAS_RESET) {
bias = 0;
} else {
/* adjust values to respect stack alignment */
irn_bias -= free_bytes;
int new_bias_unaligned = bias + irn_bias;
int new_bias_aligned
= round_up2(new_bias_unaligned, SPARC_STACK_ALIGNMENT);
free_bytes = new_bias_aligned - new_bias_unaligned;
set_irn_sp_bias(irn, new_bias_aligned - bias);
bias = new_bias_aligned;
}
}
/**
* Lower a Sel node. Do not touch Sels accessing entities on the frame type.
*/
static void lower_sel(ir_node *sel)
{
ir_graph *irg = get_irn_irg(sel);
ir_entity *ent = get_Sel_entity(sel);
ir_type *owner = get_entity_owner(ent);
dbg_info *dbg = get_irn_dbg_info(sel);
ir_mode *mode = get_irn_mode(sel);
ir_node *bl = get_nodes_block(sel);
ir_node *newn;
/* we can only replace Sels when the layout of the owner type is decided. */
if (get_type_state(owner) != layout_fixed)
return;
if (0 < get_Sel_n_indexs(sel)) {
/* an Array access */
ir_type *basetyp = get_entity_type(ent);
ir_mode *basemode;
ir_node *index;
if (is_Primitive_type(basetyp))
basemode = get_type_mode(basetyp);
else
basemode = mode_P_data;
assert(basemode && "no mode for lowering Sel");
assert((get_mode_size_bits(basemode) % 8 == 0) && "can not deal with unorthodox modes");
index = get_Sel_index(sel, 0);
if (is_Array_type(owner)) {
ir_type *arr_ty = owner;
size_t dims = get_array_n_dimensions(arr_ty);
size_t *map = ALLOCAN(size_t, dims);
ir_mode *mode_Int = get_reference_mode_signed_eq(mode);
ir_tarval *tv;
ir_node *last_size;
size_t i;
assert(dims == (size_t)get_Sel_n_indexs(sel)
&& "array dimension must match number of indices of Sel node");
for (i = 0; i < dims; i++) {
size_t order = get_array_order(arr_ty, i);
assert(order < dims &&
"order of a dimension must be smaller than the arrays dim");
map[order] = i;
}
newn = get_Sel_ptr(sel);
/* Size of the array element */
tv = new_tarval_from_long(get_type_size_bytes(basetyp), mode_Int);
last_size = new_rd_Const(dbg, irg, tv);
/*
* We compute the offset part of dimension d_i recursively
* with the the offset part of dimension d_{i-1}
*
* off_0 = sizeof(array_element_type);
* off_i = (u_i - l_i) * off_{i-1} ; i >= 1
*
* whereas u_i is the upper bound of the current dimension
* and l_i the lower bound of the current dimension.
*/
for (i = dims; i > 0;) {
size_t dim = map[--i];
ir_node *lb, *ub, *elms, *n, *ind;
elms = NULL;
lb = get_array_lower_bound(arr_ty, dim);
ub = get_array_upper_bound(arr_ty, dim);
if (! is_Unknown(lb))
lb = new_rd_Conv(dbg, bl, copy_const_value(get_irn_dbg_info(sel), lb, bl), mode_Int);
else
lb = NULL;
if (! is_Unknown(ub))
ub = new_rd_Conv(dbg, bl, copy_const_value(get_irn_dbg_info(sel), ub, bl), mode_Int);
else
ub = NULL;
/*
* If the array has more than one dimension, lower and upper
* bounds have to be set in the non-last dimension.
*/
if (i > 0) {
assert(lb != NULL && "lower bound has to be set in multi-dim array");
assert(ub != NULL && "upper bound has to be set in multi-dim array");
/* Elements in one Dimension */
elms = new_rd_Sub(dbg, bl, ub, lb, mode_Int);
}
ind = new_rd_Conv(dbg, bl, get_Sel_index(sel, dim), mode_Int);
/*
* Normalize index, id lower bound is set, also assume
* lower bound == 0
*/
if (lb != NULL)
ind = new_rd_Sub(dbg, bl, ind, lb, mode_Int);
n = new_rd_Mul(dbg, bl, ind, last_size, mode_Int);
/*
* see comment above.
*/
if (i > 0)
last_size = new_rd_Mul(dbg, bl, last_size, elms, mode_Int);
newn = new_rd_Add(dbg, bl, newn, n, mode);
}
} else {
/* no array type */
ir_mode *idx_mode = get_irn_mode(index);
ir_tarval *tv = new_tarval_from_long(get_mode_size_bytes(basemode), idx_mode);
newn = new_rd_Add(dbg, bl, get_Sel_ptr(sel),
new_rd_Mul(dbg, bl, index,
new_r_Const(irg, tv),
idx_mode),
mode);
}
} else if (is_Method_type(get_entity_type(ent)) && is_Class_type(owner)) {
/* We need an additional load when accessing methods from a dispatch
* table.
* Matze TODO: Is this really still used? At least liboo does its own
* lowering of Method-Sels...
*/
ir_mode *ent_mode = get_type_mode(get_entity_type(ent));
int offset = get_entity_offset(ent);
ir_mode *mode_Int = get_reference_mode_signed_eq(mode);
ir_tarval *tv = new_tarval_from_long(offset, mode_Int);
ir_node *cnst = new_rd_Const(dbg, irg, tv);
ir_node *add = new_rd_Add(dbg, bl, get_Sel_ptr(sel), cnst, mode);
ir_node *mem = get_Sel_mem(sel);
newn = new_rd_Load(dbg, bl, mem, add, ent_mode, cons_none);
newn = new_r_Proj(newn, ent_mode, pn_Load_res);
} else {
int offset = get_entity_offset(ent);
/* replace Sel by add(obj, const(ent.offset)) */
newn = get_Sel_ptr(sel);
if (offset != 0) {
ir_mode *mode_UInt = get_reference_mode_unsigned_eq(mode);
ir_tarval *tv = new_tarval_from_long(offset, mode_UInt);
ir_node *cnst = new_r_Const(irg, tv);
newn = new_rd_Add(dbg, bl, newn, cnst, mode);
}
}
/* run the hooks */
hook_lower(sel);
exchange(sel, newn);
}
/**
* Lower a all possible SymConst nodes.
*/
static void lower_symconst(ir_node *symc)
{
ir_node *newn;
ir_type *tp;
ir_entity *ent;
ir_tarval *tv;
ir_enum_const *ec;
ir_mode *mode;
ir_graph *irg;
switch (get_SymConst_kind(symc)) {
case symconst_type_size:
/* rewrite the SymConst node by a Const node */
irg = get_irn_irg(symc);
tp = get_SymConst_type(symc);
assert(get_type_state(tp) == layout_fixed);
mode = get_irn_mode(symc);
newn = new_r_Const_long(irg, mode, get_type_size_bytes(tp));
assert(newn);
/* run the hooks */
hook_lower(symc);
exchange(symc, newn);
break;
case symconst_type_align:
/* rewrite the SymConst node by a Const node */
irg = get_irn_irg(symc);
tp = get_SymConst_type(symc);
assert(get_type_state(tp) == layout_fixed);
mode = get_irn_mode(symc);
newn = new_r_Const_long(irg, mode, get_type_alignment_bytes(tp));
assert(newn);
/* run the hooks */
hook_lower(symc);
exchange(symc, newn);
break;
case symconst_addr_ent:
/* leave */
break;
case symconst_ofs_ent:
/* rewrite the SymConst node by a Const node */
irg = get_irn_irg(symc);
ent = get_SymConst_entity(symc);
assert(get_type_state(get_entity_type(ent)) == layout_fixed);
mode = get_irn_mode(symc);
newn = new_r_Const_long(irg, mode, get_entity_offset(ent));
assert(newn);
/* run the hooks */
hook_lower(symc);
exchange(symc, newn);
break;
case symconst_enum_const:
/* rewrite the SymConst node by a Const node */
irg = get_irn_irg(symc);
ec = get_SymConst_enum(symc);
assert(get_type_state(get_enumeration_owner(ec)) == layout_fixed);
tv = get_enumeration_value(ec);
newn = new_r_Const(irg, tv);
assert(newn);
/* run the hooks */
hook_lower(symc);
exchange(symc, newn);
break;
default:
assert(!"unknown SymConst kind");
break;
}
}