void dmemory_lower_Alloc(ir_node *node)
{
assert(is_Alloc(node));
if (get_Alloc_where(node) != heap_alloc)
return;
ir_graph *irg = get_irn_irg(node);
ir_type *type = get_Alloc_type(node);
ir_node *count = get_Alloc_count(node);
ir_node *res = NULL;
ir_node *cur_mem = get_Alloc_mem(node);
ir_node *block = get_nodes_block(node);
if (is_Class_type(type)) {
res = (*dmemory_model.alloc_object)(type, irg, block, &cur_mem);
ddispatch_prepare_new_instance(type, res, irg, block, &cur_mem);
} else if (is_Array_type(type)) {
ir_type *eltype = get_array_element_type(type);
res = (*dmemory_model.alloc_array)(eltype, count, irg, block, &cur_mem);
} else {
assert (0);
}
turn_into_tuple(node, pn_Alloc_max);
set_irn_n(node, pn_Alloc_M, cur_mem);
set_irn_n(node, pn_Alloc_res, res);
}
static void check_entity_initializer(ir_entity *entity)
{
#ifndef NDEBUG
ir_initializer_t *initializer = entity->initializer;
ir_type *entity_tp = get_entity_type(entity);
switch (initializer->kind) {
case IR_INITIALIZER_COMPOUND:
assert(is_compound_type(entity_tp) || is_Array_type(entity_tp));
break;
case IR_INITIALIZER_CONST:
/* methods are initialized by a SymConst */
assert(is_atomic_type(entity_tp) || is_Method_type(entity_tp));
break;
case IR_INITIALIZER_TARVAL:
assert(is_atomic_type(entity_tp));
break;
case IR_INITIALIZER_NULL:
break;
}
#else
(void)entity;
#endif
}
/**
* 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);
}
static bool check_initializer(const ir_initializer_t *initializer,
const ir_type *type,
const ir_entity *context)
{
bool fine = true;
switch (get_initializer_kind(initializer)) {
case IR_INITIALIZER_NULL:
return fine;
case IR_INITIALIZER_TARVAL: {
ir_tarval *tv = get_initializer_tarval_value(initializer);
if (get_type_mode(type) != get_tarval_mode(tv)) {
report_error("tarval initializer for entity %+F has wrong mode: %+F vs %+F", context, get_type_mode(type), get_tarval_mode(tv));
fine = false;
}
return fine;
}
case IR_INITIALIZER_CONST: {
ir_node *value = get_initializer_const_value(initializer);
if (get_type_mode(type) != get_irn_mode(value)) {
report_error("const initializer for entity %+F has wrong mode: %+F vs %+F", context, get_type_mode(type), get_irn_mode(value));
fine = false;
}
if (!constant_on_correct_irg(value)) {
report_error("initializer const value %+F for entity %+F not on const-code irg", value, context);
fine = false;
}
return fine;
}
case IR_INITIALIZER_COMPOUND: {
size_t n_entries = get_initializer_compound_n_entries(initializer);
if (is_Array_type(type)) {
ir_type *element_type = get_array_element_type(type);
/* TODO: check array bounds? */
for (size_t i = 0; i < n_entries; ++i) {
const ir_initializer_t *sub_initializer
= get_initializer_compound_value(initializer, i);
check_initializer(sub_initializer, element_type, context);
}
} else if (is_compound_type(type)) {
size_t n_members = get_compound_n_members(type);
if (n_entries > n_members) {
report_error("too many values in compound initializer of %+F",
context);
fine = false;
}
for (size_t i = 0; i < n_entries; ++i) {
if (i >= n_members)
break;
ir_entity *member = get_compound_member(type, i);
ir_type *member_type = get_entity_type(member);
const ir_initializer_t *sub_initializer
= get_initializer_compound_value(initializer, i);
check_initializer(sub_initializer, member_type, context);
}
} else {
report_error("compound initiailizer for non-array/compound type in entity %+F",
context);
fine = false;
}
return fine;
}
}
report_error("invalid initializer for entity %+F", context);
return false;
}
