typedef struct {
arch_register_req_t req;
-} be_req_t;
-
-typedef struct {
- be_req_t req;
- be_req_t in_req;
+ arch_register_req_t in_req;
} be_reg_data_t;
/** The generic be nodes attribute type. */
#define K irop_flag_keep
#define M irop_flag_uses_memory
-static int be_reqs_equal(const be_req_t *req1, const be_req_t *req2)
-{
- if(!reg_reqs_equal(&req1->req, &req2->req))
- return 0;
-
- return 1;
-}
-
/**
* Compare two be node attributes.
*
* @return zero if both attributes are identically
*/
static int _node_cmp_attr(const be_node_attr_t *a, const be_node_attr_t *b) {
- int i, len;
+ int i, len = ARR_LEN(a->reg_data);
- if (ARR_LEN(a->reg_data) != ARR_LEN(b->reg_data))
+ if (len != ARR_LEN(b->reg_data))
return 1;
- len = ARR_LEN(a->reg_data);
- for (i = 0; i < len; ++i) {
- if (!be_reqs_equal(&a->reg_data[i].in_req, &b->reg_data[i].in_req) ||
- !be_reqs_equal(&a->reg_data[i].req, &b->reg_data[i].req))
+ for (i = len - 1; i >= 0; --i) {
+ if (!reg_reqs_equal(&a->reg_data[i].in_req, &b->reg_data[i].in_req) ||
+ !reg_reqs_equal(&a->reg_data[i].req, &b->reg_data[i].req))
return 1;
}
const be_node_attr_t *a_attr = get_irn_attr_const(a);
const be_node_attr_t *b_attr = get_irn_attr_const(b);
- if(_node_cmp_attr(a_attr, b_attr) != 0)
+ if (_node_cmp_attr(a_attr, b_attr) != 0)
return 1;
return !be_info_equal(a, b);
const be_call_attr_t *b_attr = get_irn_attr_const(b);
if (a_attr->ent != b_attr->ent ||
- a_attr->call_tp != b_attr->call_tp)
+ a_attr->call_tp != b_attr->call_tp)
return 1;
return _node_cmp_attr(&a_attr->node_attr, &b_attr->node_attr);
}
-static inline be_req_t *get_be_req(const ir_node *node, int pos)
+static inline arch_register_req_t *get_be_req(const ir_node *node, int pos)
{
int idx;
const be_node_attr_t *attr;
assert(is_be_node(node));
attr = get_irn_attr_const(node);
- if(pos < 0) {
+ if (pos < 0) {
idx = -(pos + 1);
} else {
idx = pos;
return pos < 0 ? &rd->req : &rd->in_req;
}
-static inline arch_register_req_t *get_req(const ir_node *node, int pos)
-{
- be_req_t *bereq = get_be_req(node, pos);
- return &bereq->req;
-}
-
/**
- * Initializes the generic attribute of all be nodes and return ir.
+ * Initializes the generic attribute of all be nodes and return it.
*/
static void *init_node_attr(ir_node *node, int max_reg_data)
{
be_node_set_reg_class_in(res, 0, cls);
be_node_set_reg_class_out(res, 0, cls);
- req = get_req(res, BE_OUT_POS(0));
+ req = get_be_req(res, BE_OUT_POS(0));
req->cls = cls;
req->type = arch_register_req_type_should_be_same;
req->other_same = 1U << 0;
void be_set_constr_single_reg_in(ir_node *node, int pos,
const arch_register_t *reg, arch_register_req_type_t additional_types)
{
- arch_register_req_t *req = get_req(node, pos);
+ arch_register_req_t *req = get_be_req(node, pos);
ir_graph *irg = get_irn_irg(node);
struct obstack *obst = get_irg_obstack(irg);
void be_set_constr_single_reg_out(ir_node *node, int pos,
const arch_register_t *reg, arch_register_req_type_t additional_types)
{
- arch_register_req_t *req = get_req(node, BE_OUT_POS(pos));
+ arch_register_req_t *req = get_be_req(node, BE_OUT_POS(pos));
ir_graph *irg = get_irn_irg(node);
struct obstack *obst = get_irg_obstack(irg);
{
ir_graph *irg = get_irn_irg(node);
struct obstack *obst = get_irg_obstack(irg);
- arch_register_req_t *r = get_req(node, pos);
+ arch_register_req_t *r = get_be_req(node, pos);
assert(arch_register_req_is(req, limited));
assert(!(req->type & (arch_register_req_type_should_be_same | arch_register_req_type_must_be_different)));
void be_node_set_reg_class_in(ir_node *irn, int pos, const arch_register_class_t *cls)
{
- arch_register_req_t *req = get_req(irn, pos);
+ arch_register_req_t *req = get_be_req(irn, pos);
req->cls = cls;
void be_node_set_reg_class_out(ir_node *irn, int pos, const arch_register_class_t *cls)
{
- arch_register_req_t *req = get_req(irn, BE_OUT_POS(pos));
+ arch_register_req_t *req = get_be_req(irn, BE_OUT_POS(pos));
req->cls = cls;
void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
{
- arch_register_req_t *req = get_req(irn, pos);
+ arch_register_req_t *req = get_be_req(irn, pos);
req->type = type;
}
{
const be_node_attr_t *a = get_irn_attr_const(irn);
- if(out_pos >= ARR_LEN(a->reg_data)) {
+ if (out_pos >= ARR_LEN(a->reg_data)) {
return arch_no_register_req;
}
- return &a->reg_data[out_pos].req.req;
+ return &a->reg_data[out_pos].req;
}
static const
{
const be_node_attr_t *a = get_irn_attr_const(irn);
- if(pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
+ if (pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
return arch_no_register_req;
- return &a->reg_data[pos].in_req.req;
+ return &a->reg_data[pos].in_req;
}
static const arch_register_req_t *
* For spills and reloads, we return "none" as requirement for frame
* pointer, so every input is ok. Some backends need this (e.g. STA).
*/
- if ((be_is_Spill(irn) && pos == be_pos_Spill_frame) ||
- (be_is_Reload(irn) && pos == be_pos_Reload_frame))
+ if ((pos == be_pos_Spill_frame && be_is_Spill(irn)) ||
+ (pos == be_pos_Reload_frame && be_is_Reload(irn)))
return arch_no_register_req;
return get_in_reg_req(irn, pos);
int len = ARR_LEN(a->reg_data);
fprintf(f, "registers: \n");
- for(i = 0; i < len; ++i) {
+ for (i = 0; i < len; ++i) {
const arch_register_t *reg = arch_irn_get_register(node, i);
fprintf(f, "#%d: %s\n", i, reg != NULL ? reg->name : "n/a");
}
fprintf(f, "in requirements:\n");
- for(i = 0; i < len; ++i) {
- dump_node_req(f, i, &a->reg_data[i].in_req.req, node);
+ for (i = 0; i < len; ++i) {
+ dump_node_req(f, i, &a->reg_data[i].in_req, node);
}
fprintf(f, "\nout requirements:\n");
- for(i = 0; i < len; ++i) {
- dump_node_req(f, i, &a->reg_data[i].req.req, node);
+ for (i = 0; i < len; ++i) {
+ dump_node_req(f, i, &a->reg_data[i].req, node);
}
}
for(i = 0; i < len; ++i) {
const be_reg_data_t *rd = &old_attr->reg_data[i];
be_reg_data_t *newrd = &new_attr->reg_data[i];
- if(arch_register_req_is(&rd->req.req, limited)) {
- const arch_register_req_t *req = &rd->req.req;
- arch_register_req_t *new_req = &newrd->req.req;
+ if (arch_register_req_is(&rd->req, limited)) {
+ const arch_register_req_t *req = &rd->req;
+ arch_register_req_t *new_req = &newrd->req;
new_req->limited
= rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
}
- if(arch_register_req_is(&rd->in_req.req, limited)) {
- const arch_register_req_t *req = &rd->in_req.req;
- arch_register_req_t *new_req = &newrd->in_req.req;
+ if(arch_register_req_is(&rd->in_req, limited)) {
+ const arch_register_req_t *req = &rd->in_req;
+ arch_register_req_t *new_req = &newrd->in_req;
new_req->limited
= rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
}
return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops;
}
-void be_node_init(void) {
- static int inited = 0;
-
- if(inited)
- return;
-
- inited = 1;
-
+void be_init_op(void)
+{
/* Acquire all needed opcodes. */
op_be_Spill = new_ir_op(beo_Spill, "be_Spill", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
op_be_Reload = new_ir_op(beo_Reload, "be_Reload", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
projects / libfirm / blobdiff