* Copyright (C) 2005-2006 Universitaet Karlsruhe
* Released under the GPL
*/
-
#ifdef HAVE_CONFIG_H
-#include "config.h"
+#include <config.h>
#endif
#include <stdlib.h>
/** The generic be nodes attribute type. */
typedef struct {
- int max_reg_data;
be_reg_data_t *reg_data;
} be_node_attr_t;
* @return zero if both attributes are identically
*/
static int cmp_node_attr(be_node_attr_t *a, be_node_attr_t *b) {
- if (a->max_reg_data == b->max_reg_data) {
- int i;
+ int i, len;
+
+ if(ARR_LEN(a->reg_data) != ARR_LEN(b->reg_data))
+ return 1;
- for (i = 0; i < a->max_reg_data; ++i) {
- if (a->reg_data[i].reg != b->reg_data[i].reg ||
- memcmp(&a->reg_data[i].in_req, &b->reg_data[i].in_req, sizeof(b->reg_data[i].in_req)) ||
+ len = ARR_LEN(a->reg_data);
+ for (i = 0; i < len; ++i) {
+ if (a->reg_data[i].reg != b->reg_data[i].reg ||
+ memcmp(&a->reg_data[i].in_req, &b->reg_data[i].in_req, sizeof(b->reg_data[i].in_req)) ||
memcmp(&a->reg_data[i].req, &b->reg_data[i].req, sizeof(a->reg_data[i].req)))
- return 1;
- }
- return 0;
+ return 1;
}
- return 1;
+
+ return 0;
}
/**
op_be_Perm = new_ir_op(beo_base + beo_Perm, "be_Perm", op_pin_state_pinned, N, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
op_be_MemPerm = new_ir_op(beo_base + beo_MemPerm, "be_MemPerm", op_pin_state_mem_pinned, N, oparity_variable, 0, sizeof(be_memperm_attr_t), &be_node_op_ops);
op_be_Copy = new_ir_op(beo_base + beo_Copy, "be_Copy", op_pin_state_floats, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
- op_be_Keep = new_ir_op(beo_base + beo_Keep, "be_Keep", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_Keep = new_ir_op(beo_base + beo_Keep, "be_Keep", op_pin_state_pinned, K, oparity_dynamic, 0, sizeof(be_node_attr_t), &be_node_op_ops);
op_be_CopyKeep = new_ir_op(beo_base + beo_CopyKeep, "be_CopyKeep", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
op_be_Call = new_ir_op(beo_base + beo_Call, "be_Call", op_pin_state_pinned, F, oparity_variable, 0, sizeof(be_call_attr_t), &be_node_op_ops);
op_be_Return = new_ir_op(beo_base + beo_Return, "be_Return", op_pin_state_pinned, X, oparity_variable, 0, sizeof(be_return_attr_t), &be_node_op_ops);
op_be_FrameAddr = new_ir_op(beo_base + beo_FrameAddr, "be_FrameAddr", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
op_be_FrameLoad = new_ir_op(beo_base + beo_FrameLoad, "be_FrameLoad", op_pin_state_pinned, N, oparity_any, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
op_be_FrameStore = new_ir_op(beo_base + beo_FrameStore, "be_FrameStore", op_pin_state_pinned, N, oparity_any, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
- op_be_Barrier = new_ir_op(beo_base + beo_Barrier, "be_Barrier", op_pin_state_pinned, N, oparity_any, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_Barrier = new_ir_op(beo_base + beo_Barrier, "be_Barrier", op_pin_state_pinned, N, oparity_dynamic, 0, sizeof(be_node_attr_t), &be_node_op_ops);
set_op_tag(op_be_Spill, &be_node_tag);
set_op_tag(op_be_Reload, &be_node_tag);
/**
* Initializes the generic attribute of all be nodes and return ir.
*/
-static void *init_node_attr(ir_node* irn, int max_reg_data)
+static void *init_node_attr(ir_node *node, int max_reg_data)
{
- ir_graph *irg = get_irn_irg(irn);
- be_node_attr_t *a = get_irn_attr(irn);
+ ir_graph *irg = get_irn_irg(node);
+ struct obstack *obst = get_irg_obstack(irg);
+ be_node_attr_t *a = get_irn_attr(node);
- memset(a, 0, sizeof(get_op_attr_size(get_irn_op(irn))));
- a->max_reg_data = max_reg_data;
- a->reg_data = NULL;
+ memset(a, 0, sizeof(get_op_attr_size(get_irn_op(node))));
- if(max_reg_data > 0) {
- int i;
-
- a->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(irg), max_reg_data);
+ if(max_reg_data >= 0) {
+ a->reg_data = NEW_ARR_D(be_reg_data_t, obst, max_reg_data);
memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
- for(i = 0; i < max_reg_data; ++i) {
- a->reg_data[i].req.req.cls = NULL;
- a->reg_data[i].req.req.type = arch_register_req_type_none;
- }
+ } else {
+ a->reg_data = NEW_ARR_F(be_reg_data_t, 0);
}
return a;
}
+static void add_register_req(ir_node *node)
+{
+ be_node_attr_t *a = get_irn_attr(node);
+ be_reg_data_t regreq;
+ memset(®req, 0, sizeof(regreq));
+ ARR_APP1(be_reg_data_t, a->reg_data, regreq);
+}
+
int is_be_node(const ir_node *irn)
{
return get_op_tag(get_irn_op(irn)) == &be_node_tag;
assert(get_irn_mode(pred) == mode_T);
*pos = p;
res = get_irn_attr(pred);
- assert(p >= 0 && p < res->max_reg_data && "illegal proj number");
+ assert(p >= 0 && p < ARR_LEN(res->reg_data) && "illegal proj number");
}
- }
-
- else if(is_be_node(irn) && get_irn_mode(irn) != mode_T) {
+ } else if(is_be_node(irn) && get_irn_mode(irn) != mode_T) {
be_node_attr_t *a = get_irn_attr(irn);
- if(a->max_reg_data > 0) {
+ if(ARR_LEN(a->reg_data) > 0) {
res = a;
*pos = 0;
}
ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
{
int i;
- ir_node *irn;
+ ir_node *res;
+
+ res = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, -1, NULL);
+ init_node_attr(res, -1);
- irn = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, n, in);
- init_node_attr(irn, n);
for(i = 0; i < n; ++i) {
- be_node_set_reg_class(irn, i, cls);
+ add_irn_n(res, in[i]);
+ add_register_req(res);
+ be_node_set_reg_class(res, i, cls);
}
- keep_alive(irn);
- return irn;
+ keep_alive(res);
+
+ return res;
+}
+
+void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
+{
+ int n;
+
+ assert(be_is_Keep(keep));
+ n = add_irn_n(keep, node);
+ add_register_req(keep);
+ be_node_set_reg_class(keep, n, cls);
}
ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
{
- ir_node *irn;
- ir_node *in[1];
+ ir_node *res;
+ int i;
- irn = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, in);
- init_node_attr(irn, n_outs);
- return irn;
+ res = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, NULL);
+ init_node_attr(res, -1);
+ for(i = 0; i < n_outs; ++i)
+ add_register_req(res);
+
+ return res;
+}
+
+ir_node *be_RegParams_append_out_reg(ir_node *regparams,
+ const arch_env_t *arch_env,
+ const arch_register_t *reg)
+{
+ ir_graph *irg = get_irn_irg(regparams);
+ ir_node *block = get_nodes_block(regparams);
+ be_node_attr_t *attr = get_irn_attr(regparams);
+ const arch_register_class_t *cls = arch_register_get_class(reg);
+ ir_mode *mode = arch_register_class_mode(cls);
+ int n = ARR_LEN(attr->reg_data);
+ ir_node *proj;
+
+ assert(be_is_RegParams(regparams));
+ proj = new_r_Proj(irg, block, regparams, mode, n);
+ add_register_req(regparams);
+ be_set_constr_single_reg(regparams, n, reg);
+ arch_set_irn_register(arch_env, proj, reg);
+
+ /* TODO decide, whether we need to set ignore/modify sp flags here? */
+
+ return proj;
}
ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
{
- ir_node *irn;
+ ir_node *res;
+ int i;
- irn = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, n, in);
- init_node_attr(irn, n);
- return irn;
+ res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
+ init_node_attr(res, -1);
+ for(i = 0; i < n; ++i) {
+ add_irn_n(res, in[i]);
+ add_register_req(res);
+ }
+
+ return res;
+}
+
+ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
+{
+ ir_graph *irg = get_irn_irg(barrier);
+ ir_node *block = get_nodes_block(barrier);
+ ir_mode *mode = get_irn_mode(node);
+ int n = add_irn_n(barrier, node);
+ ir_node *proj = new_r_Proj(irg, block, barrier, mode, n);
+ add_register_req(barrier);
+
+ return proj;
}
int be_is_Spill (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill ; }
assert(is_be_node(irn));
assert(!(pos >= 0) || pos < get_irn_arity(irn));
- assert(!(pos < 0) || -(pos + 1) <= a->max_reg_data);
+ assert(!(pos < 0) || -(pos + 1) <= ARR_LEN(a->reg_data));
return r;
}
r->req.cls = cls;
- if (cls == NULL)
+ if (cls == NULL) {
r->req.type = arch_register_req_type_none;
- else if (r->req.type == arch_register_req_type_none)
+ } else if (r->req.type == arch_register_req_type_none) {
r->req.type = arch_register_req_type_normal;
+ }
}
void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
if (is_Block(insert)) {
insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
sched_add_after(insert, reload);
- }
-
- else
+ } else {
sched_add_before(insert, reload);
+ }
return reload;
}
{
const be_node_attr_t *a = get_irn_attr(irn);
- if(out_pos < a->max_reg_data) {
+ if(out_pos < ARR_LEN(a->reg_data)) {
memcpy(req, &a->reg_data[out_pos].req, sizeof(req[0]));
if(be_is_Copy(irn)) {
req->type |= arch_register_req_type_should_be_same;
req->other_same = be_get_Copy_op(irn);
}
- }
- else {
+ } else {
req->type = arch_register_req_type_none;
req->cls = NULL;
}
{
const be_node_attr_t *a = get_irn_attr(irn);
- if(pos < get_irn_arity(irn) && pos < a->max_reg_data)
+ if(pos < get_irn_arity(irn) && pos < ARR_LEN(a->reg_data)) {
memcpy(req, &a->reg_data[pos].in_req, sizeof(req[0]));
- else {
+ } else {
req->type = arch_register_req_type_none;
req->cls = NULL;
}
{
int i;
be_node_attr_t *a = get_irn_attr(irn);
+ int len = ARR_LEN(a->reg_data);
fprintf(f, "registers: \n");
- for(i = 0; i < a->max_reg_data; ++i) {
+ for(i = 0; i < len; ++i) {
be_reg_data_t *rd = &a->reg_data[i];
if(rd->reg)
fprintf(f, "#%d: %s\n", i, rd->reg->name);
}
fprintf(f, "in requirements\n");
- for(i = 0; i < a->max_reg_data; ++i) {
+ for(i = 0; i < len; ++i) {
dump_node_req(f, i, &a->reg_data[i].in_req);
}
fprintf(f, "\nout requirements\n");
- for(i = 0; i < a->max_reg_data; ++i) {
+ for(i = 0; i < len; ++i) {
dump_node_req(f, i, &a->reg_data[i].req);
}
}
{
be_node_attr_t *old_attr = get_irn_attr(old_node);
be_node_attr_t *new_attr = get_irn_attr(new_node);
- int i;
+ struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
+ int i, len;
assert(is_be_node(old_node));
assert(is_be_node(new_node));
memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
new_attr->reg_data = NULL;
- if(new_attr->max_reg_data > 0) {
- new_attr->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(get_irn_irg(new_node)), new_attr->max_reg_data);
- memcpy(new_attr->reg_data, old_attr->reg_data, new_attr->max_reg_data * sizeof(be_reg_data_t));
+ if(old_attr->reg_data != NULL)
+ len = ARR_LEN(old_attr->reg_data);
+ else
+ len = 0;
+
+ if(be_is_Keep(old_node) || be_is_RegParams(old_node) || be_is_Barrier(old_node)) {
+ new_attr->reg_data = NEW_ARR_F(be_reg_data_t, len);
+ } else {
+ new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, len);
+ }
+
+ if(len > 0) {
+ memcpy(new_attr->reg_data, old_attr->reg_data, len * sizeof(be_reg_data_t));
- for(i = 0; i < old_attr->max_reg_data; ++i) {
+ for(i = 0; i < len; ++i) {
be_req_t *r;
r = &new_attr->reg_data[i].req;
projects / libfirm / blobdiff