#include <stdlib.h>
+#include "beirg.h"
#include "obst.h"
#include "set.h"
#include "pmap.h"
#include "irprintf.h"
#include "irgwalk.h"
#include "iropt_t.h"
+#include "irbackedge_t.h"
+#include "irverify_t.h"
#include "be_t.h"
#include "belive_t.h"
return be_nodes_equal(a, b);
}
-static arch_register_req_t *allocate_reg_req(const ir_node *node)
+static arch_register_req_t *allocate_reg_req(ir_graph *const irg)
{
- ir_graph *irg = get_irn_irg(node);
struct obstack *obst = be_get_be_obst(irg);
arch_register_req_t *req = OALLOCZ(obst, arch_register_req_t);
*/
static void init_node_attr(ir_node *node, int n_inputs, int n_outputs)
{
+ assert(n_outputs >= 0);
+
ir_graph *irg = get_irn_irg(node);
struct obstack *obst = be_get_be_obst(irg);
backend_info_t *info = be_get_info(node);
}
info->in_reqs = in_reqs;
- if (n_outputs >= 0) {
- int i;
- info->out_infos = NEW_ARR_D(reg_out_info_t, obst, n_outputs);
- memset(info->out_infos, 0, n_outputs * sizeof(info->out_infos[0]));
- for (i = 0; i < n_outputs; ++i) {
- info->out_infos[i].req = arch_no_register_req;
- }
- } else {
- info->out_infos = NEW_ARR_F(reg_out_info_t, 0);
+ info->out_infos = NEW_ARR_D(reg_out_info_t, obst, n_outputs);
+ memset(info->out_infos, 0, n_outputs * sizeof(info->out_infos[0]));
+ for (int i = 0; i < n_outputs; ++i) {
+ info->out_infos[i].req = arch_no_register_req;
}
}
-static void add_register_req_in(ir_node *node)
+static void add_register_req_in(ir_node *node, const arch_register_req_t *req)
{
backend_info_t *info = be_get_info(node);
- ARR_APP1(const arch_register_req_t*, info->in_reqs, arch_no_register_req);
+ ARR_APP1(const arch_register_req_t*, info->in_reqs, req);
}
ir_node *be_new_Spill(const arch_register_class_t *cls,
be_set_constr_in(irn, i, cls->class_req);
be_set_constr_out(irn, i, cls->class_req);
} else {
- arch_register_req_t *new_req = allocate_reg_req(irn);
+ arch_register_req_t *const new_req = allocate_reg_req(irg);
new_req->cls = cls;
new_req->type = (req->type & arch_register_req_type_aligned);
new_req->width = req->width;
{
ir_node *in[1];
ir_node *res;
- arch_register_req_t *req;
be_node_attr_t *attr;
ir_graph *irg = get_Block_irg(bl);
const arch_register_req_t *in_req = arch_get_irn_register_req(op);
be_node_set_reg_class_in(res, 0, cls);
be_node_set_reg_class_out(res, 0, cls);
- req = allocate_reg_req(res);
+ arch_register_req_t *const req = allocate_reg_req(irg);
req->cls = cls;
req->type = arch_register_req_type_should_be_same
| (in_req->type & arch_register_req_type_aligned);
return get_irn_n(cpy, n_be_Copy_op);
}
-void be_set_Copy_op(ir_node *cpy, ir_node *op)
-{
- set_irn_n(cpy, n_be_Copy_op, op);
-}
-
ir_node *be_new_Keep(ir_node *block, int n, ir_node *in[])
{
int i;
attr->exc.pin_state = op_pin_state_pinned;
for (i = 0; i < n; ++i) {
- add_irn_n(res, in[i]);
- add_register_req_in(res);
+ ir_node *pred = in[i];
+ add_irn_n(res, pred);
+ const arch_register_req_t *req = arch_get_irn_register_req(pred);
+ req = req->cls != NULL ? req->cls->class_req : arch_no_register_req;
+ add_register_req_in(res, req);
}
keep_alive(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_in(keep);
- be_node_set_reg_class_in(keep, n, cls);
+ add_irn_n(keep, node);
+ add_register_req_in(keep, cls->class_req);
}
ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem,
- ir_node *sp, ir_node *ptr, int n_outs, int n, ir_node *in[],
- ir_type *call_tp)
+ const arch_register_req_t *sp_req, ir_node *sp,
+ const arch_register_req_t *ptr_req, ir_node *ptr,
+ int n_outs, int n, ir_node *in[], ir_type *call_tp)
{
be_call_attr_t *a;
int real_n = n_be_Call_first_arg + n;
a->call_tp = call_tp;
a->pop = 0;
a->base.exc.pin_state = op_pin_state_pinned;
+ be_set_constr_in(irn, n_be_Call_sp, sp_req);
+ be_set_constr_in(irn, n_be_Call_ptr, ptr_req);
return irn;
}
attr->exc.pin_state = op_pin_state_floats;
be_node_set_reg_class_in(irn, 0, cls);
be_node_set_reg_class_out(irn, 0, cls);
+ for (int i = 0; i < n; ++i) {
+ ir_node *pred = in_keep[i];
+ const arch_register_req_t *req = arch_get_irn_register_req(pred);
+ req = req->cls != NULL ? req->cls->class_req : arch_no_register_req;
+ be_set_constr_in(irn, i+1, req);
+ }
return irn;
}
const arch_register_t *reg, arch_register_req_type_t additional_types)
{
arch_register_req_t *req = OALLOC(obst, arch_register_req_t);
- const arch_register_class_t *cls = arch_register_get_class(reg);
+ const arch_register_class_t *cls = reg->reg_class;
unsigned *limited_bitset;
limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
- rbitset_set(limited_bitset, arch_register_get_index(reg));
+ rbitset_set(limited_bitset, reg->index);
req->type = arch_register_req_type_limited | additional_types;
req->cls = cls;
be_node_get_frame_entity,
be_node_set_frame_offset,
be_node_get_sp_bias,
- NULL, /* get_inverse */
NULL, /* get_op_estimated_cost */
NULL, /* possible_memory_operand */
NULL, /* perform_memory_operand */
static int get_start_reg_index(ir_graph *irg, const arch_register_t *reg)
{
ir_node *start = get_irg_start(irg);
- unsigned n_outs = arch_get_irn_n_outs(start);
- int i;
/* do a naive linear search... */
- for (i = 0; i < (int)n_outs; ++i) {
- const arch_register_req_t *out_req
- = arch_get_irn_register_req_out(start, i);
- if (! (out_req->type & arch_register_req_type_limited))
+ be_foreach_out(start, i) {
+ arch_register_req_t const *const out_req = arch_get_irn_register_req_out(start, i);
+ if (!arch_register_req_is(out_req, limited))
continue;
- if (out_req->cls != arch_register_get_class(reg))
+ if (out_req->cls != reg->reg_class)
continue;
if (!rbitset_is_set(out_req->limited, reg->index))
continue;
{
int i = get_start_reg_index(irg, reg);
ir_node *start = get_irg_start(irg);
- ir_mode *mode = arch_register_class_mode(arch_register_get_class(reg));
+ ir_mode *mode = arch_register_class_mode(reg->reg_class);
foreach_out_edge(start, edge) {
ir_node *proj = get_edge_src_irn(edge);
return new_r_Proj(start, mode, i);
}
-int be_find_return_reg_input(ir_node *ret, const arch_register_t *reg)
-{
- int arity = get_irn_arity(ret);
- int i;
- /* do a naive linear search... */
- for (i = 0; i < arity; ++i) {
- const arch_register_req_t *req = arch_get_irn_register_req_in(ret, i);
- if (! (req->type & arch_register_req_type_limited))
- continue;
- if (req->cls != arch_register_get_class(reg))
- continue;
- if (!rbitset_is_set(req->limited, reg->index))
- continue;
- return i;
- }
- panic("Tried querying undefined register '%s' at Return", reg->name);
-}
-
static ir_entity* dummy_get_frame_entity(const ir_node *node)
{
(void) node;
dummy_get_frame_entity,
dummy_set_frame_offset,
dummy_get_sp_bias,
- NULL, /* get_inverse */
NULL, /* get_op_estimated_cost */
NULL, /* possible_memory_operand */
NULL, /* perform_memory_operand */
backend_info_t *info;
int i;
- ir_node *phi = new_r_Phi(block, n_ins, ins, mode);
+ ir_node *phi = new_ir_node(NULL, irg, block, op_Phi, mode, n_ins, ins);
+ phi->attr.phi.u.backedge = new_backedge_arr(irg->obst, n_ins);
info = be_get_info(phi);
info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
for (i = 0; i < n_ins; ++i) {
info->in_reqs[i] = req;
}
-
+ irn_verify_irg(phi, irg);
+ phi = optimize_node(phi);
return phi;
}
dummy_get_frame_entity,
dummy_set_frame_offset,
dummy_get_sp_bias,
- NULL, /* get_inverse */
NULL, /* get_op_estimated_cost */
NULL, /* possible_memory_operand */
NULL, /* perform_memory_operand */
memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
- new_info->flags = old_info->flags;
- if (old_info->out_infos != NULL) {
- size_t n_outs = ARR_LEN(old_info->out_infos);
- /* need dyanmic out infos? */
- if (be_is_Perm(new_node)) {
- new_info->out_infos = NEW_ARR_F(reg_out_info_t, n_outs);
- } else {
- new_info->out_infos = NEW_ARR_D(reg_out_info_t, obst, n_outs);
- }
- memcpy(new_info->out_infos, old_info->out_infos,
- n_outs * sizeof(new_info->out_infos[0]));
- } else {
- new_info->out_infos = NULL;
- }
+ new_info->flags = old_info->flags;
+ new_info->out_infos = old_info->out_infos ? DUP_ARR_D(reg_out_info_t, obst, old_info->out_infos) : NULL;
/* input infos */
if (old_info->in_reqs != NULL) {
projects / libfirm / blobdiff