X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbenode.c;h=3916616130dbbdd21811e905ce1f75b90f76dddb;hb=ab11945ab757f3f22a717a35d639be264b0f649c;hp=f3438fb90ed9bf8aca6bb861330bc7b609756986;hpb=82482db4ee76f0126e1925d4a3160dae107e303a;p=libfirm diff --git a/ir/be/benode.c b/ir/be/benode.c index f3438fb90..391661613 100644 --- a/ir/be/benode.c +++ b/ir/be/benode.c @@ -1,30 +1,32 @@ +/* + * This file is part of libFirm. + * Copyright (C) 2012 University of Karlsruhe. + */ + /** - * @file benode.c - * @date 17.05.2005 - * @author Sebastian Hack - * - * Backend node support. + * @file + * @brief Backend node support for generic backend nodes. + * @author Sebastian Hack + * @date 17.05.2005 * + * Backend node support for generic backend nodes. * This file provides Perm, Copy, Spill and Reload nodes. - * - * Copyright (C) 2005-2006 Universitaet Karlsruhe - * Released under the GPL */ - -#ifdef HAVE_CONFIG_H #include "config.h" -#endif #include +#include "beirg.h" #include "obst.h" #include "set.h" #include "pmap.h" #include "util.h" #include "debug.h" #include "fourcc.h" -#include "offset.h" #include "bitfiddle.h" +#include "raw_bitset.h" +#include "error.h" +#include "array_t.h" #include "irop_t.h" #include "irmode_t.h" @@ -33,83 +35,57 @@ #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" -#include "besched_t.h" -#include "benode_t.h" +#include "besched.h" +#include "benode.h" +#include "bearch.h" #include "beirgmod.h" -#define OUT_POS(x) (-((x) + 1)) - -/* Sometimes we want to put const nodes into get_irn_generic_attr ... */ -#define get_irn_attr(irn) get_irn_generic_attr((ir_node *) (irn)) - -static unsigned be_node_tag = FOURCC('B', 'E', 'N', 'O'); - -typedef enum { - be_req_kind_old_limited, - be_req_kind_negate_old_limited, - be_req_kind_single_reg -} be_req_kind_t; - -typedef struct { - arch_register_req_t req; - be_req_kind_t kind; - arch_irn_flags_t flags; - union { - struct { - void (*old_limited)(void *ptr, bitset_t *bs); - void *old_limited_env; - } old_limited; - - const arch_register_t *single_reg; - } x; -} be_req_t; - -typedef struct { - const arch_register_t *reg; - be_req_t req; - be_req_t in_req; -} be_reg_data_t; - -/** The generic be nodes attribute type. */ -typedef struct { - int max_reg_data; - be_reg_data_t *reg_data; +typedef struct be_node_attr_t { + except_attr exc; } be_node_attr_t; /** The be_Return nodes attribute type. */ typedef struct { - be_node_attr_t node_attr; - int num_ret_vals; /**< number of return values */ + be_node_attr_t base; + int num_ret_vals; /**< number of return values */ + unsigned pop; /**< number of bytes that should be popped */ + int emit_pop; /**< if set, emit pop bytes, even if pop = 0 */ } be_return_attr_t; -/** The be_Stack attribute type. */ +/** The be_IncSP attribute type. */ typedef struct { - be_node_attr_t node_attr; - int offset; /**< The offset by which the stack shall be expanded/shrinked. */ -} be_stack_attr_t; + be_node_attr_t base; + int offset; /**< The offset by which the stack shall be + expanded/shrinked. */ + int align; /**< whether stack should be aligned after the + IncSP */ +} be_incsp_attr_t; /** The be_Frame attribute type. */ typedef struct { - be_node_attr_t node_attr; - ir_entity *ent; - int offset; + be_node_attr_t base; + ir_entity *ent; + int offset; } be_frame_attr_t; /** The be_Call attribute type. */ typedef struct { - be_node_attr_t node_attr; - ir_entity *ent; /**< The called entity if this is a static call. */ - ir_type *call_tp; /**< The call type, copied from the original Call node. */ + be_node_attr_t base; + ir_entity *ent; /**< called entity if this is a static call. */ + unsigned pop; + ir_type *call_tp; /**< call type, copied from the original Call */ } be_call_attr_t; typedef struct { - be_node_attr_t node_attr; - ir_entity **in_entities; - ir_entity **out_entities; + be_node_attr_t base; + ir_entity **in_entities; + ir_entity **out_entities; } be_memperm_attr_t; ir_op *op_be_Spill; @@ -124,685 +100,651 @@ ir_op *op_be_Return; ir_op *op_be_IncSP; ir_op *op_be_AddSP; ir_op *op_be_SubSP; -ir_op *op_be_SetSP; -ir_op *op_be_RegParams; -ir_op *op_be_StackParam; +ir_op *op_be_Start; ir_op *op_be_FrameAddr; -ir_op *op_be_FrameLoad; -ir_op *op_be_FrameStore; -ir_op *op_be_Barrier; - -static int beo_base = -1; - -static const ir_op_ops be_node_op_ops; - -#define N irop_flag_none -#define L irop_flag_labeled -#define C irop_flag_commutative -#define X irop_flag_cfopcode -#define I irop_flag_ip_cfopcode -#define F irop_flag_fragile -#define Y irop_flag_forking -#define H irop_flag_highlevel -#define c irop_flag_constlike -#define K irop_flag_keep -#define M irop_flag_machine - /** - * Compare two node attributes. + * Compare the attributes of two be_FrameAddr nodes. * - * @return zero if both attributes are identically + * @return zero if both nodes have identically attributes */ -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; +static int FrameAddr_cmp_attr(const ir_node *a, const ir_node *b) +{ + const be_frame_attr_t *a_attr = (const be_frame_attr_t*)get_irn_generic_attr_const(a); + const be_frame_attr_t *b_attr = (const be_frame_attr_t*)get_irn_generic_attr_const(b); - 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)) || - memcmp(&a->reg_data[i].req, &b->reg_data[i].req, sizeof(a->reg_data[i].req))) - return 1; - } - return 0; - } - return 1; + if (a_attr->ent != b_attr->ent || a_attr->offset != b_attr->offset) + return 1; + + return be_nodes_equal(a, b); } /** - * Compare the attributes of two FrameAddr nodes. + * Compare the attributes of two be_Return nodes. * - * @return zero if both attributes are identically + * @return zero if both nodes have identically attributes */ -static int FrameAddr_cmp_attr(ir_node *a, ir_node *b) { - be_frame_attr_t *a_attr = get_irn_attr(a); - be_frame_attr_t *b_attr = get_irn_attr(b); - - if (a_attr->ent == b_attr->ent && a_attr->offset == b_attr->offset) - return cmp_node_attr(&a_attr->node_attr, &b_attr->node_attr); - return 1; -} +static int Return_cmp_attr(const ir_node *a, const ir_node *b) +{ + const be_return_attr_t *a_attr = (const be_return_attr_t*)get_irn_generic_attr_const(a); + const be_return_attr_t *b_attr = (const be_return_attr_t*)get_irn_generic_attr_const(b); -void be_node_init(void) { - static int inited = 0; + if (a_attr->num_ret_vals != b_attr->num_ret_vals) + return 1; + if (a_attr->pop != b_attr->pop) + return 1; + if (a_attr->emit_pop != b_attr->emit_pop) + return 1; - if(inited) - return; + return be_nodes_equal(a, b); +} - inited = 1; +/** + * Compare the attributes of two be_IncSP nodes. + * + * @return zero if both nodes have identically attributes + */ +static int IncSP_cmp_attr(const ir_node *a, const ir_node *b) +{ + const be_incsp_attr_t *a_attr = (const be_incsp_attr_t*)get_irn_generic_attr_const(a); + const be_incsp_attr_t *b_attr = (const be_incsp_attr_t*)get_irn_generic_attr_const(b); - /* Acquire all needed opcodes. */ - beo_base = get_next_ir_opcodes(beo_Last - 1); - - op_be_Spill = new_ir_op(beo_base + beo_Spill, "be_Spill", op_pin_state_mem_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops); - op_be_Reload = new_ir_op(beo_base + beo_Reload, "be_Reload", op_pin_state_mem_pinned, N, oparity_zero, 0, sizeof(be_frame_attr_t), &be_node_op_ops); - 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_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_AddSP = new_ir_op(beo_base + beo_AddSP, "be_AddSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops); - op_be_SubSP = new_ir_op(beo_base + beo_SubSP, "be_SubSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops); - op_be_SetSP = new_ir_op(beo_base + beo_SetSP, "be_SetSP", op_pin_state_pinned, N, oparity_binary, 0, sizeof(be_stack_attr_t), &be_node_op_ops); - op_be_IncSP = new_ir_op(beo_base + beo_IncSP, "be_IncSP", op_pin_state_pinned, N, oparity_binary, 0, sizeof(be_stack_attr_t), &be_node_op_ops); - op_be_RegParams = new_ir_op(beo_base + beo_RegParams, "be_RegParams", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops); - op_be_StackParam = new_ir_op(beo_base + beo_StackParam, "be_StackParam", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_frame_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); - - set_op_tag(op_be_Spill, &be_node_tag); - set_op_tag(op_be_Reload, &be_node_tag); - set_op_tag(op_be_Perm, &be_node_tag); - set_op_tag(op_be_MemPerm, &be_node_tag); - set_op_tag(op_be_Copy, &be_node_tag); - set_op_tag(op_be_Keep, &be_node_tag); - set_op_tag(op_be_CopyKeep, &be_node_tag); - set_op_tag(op_be_Call, &be_node_tag); - set_op_tag(op_be_Return, &be_node_tag); - set_op_tag(op_be_AddSP, &be_node_tag); - set_op_tag(op_be_SubSP, &be_node_tag); - set_op_tag(op_be_SetSP, &be_node_tag); - set_op_tag(op_be_IncSP, &be_node_tag); - set_op_tag(op_be_RegParams, &be_node_tag); - set_op_tag(op_be_StackParam, &be_node_tag); - set_op_tag(op_be_FrameLoad, &be_node_tag); - set_op_tag(op_be_FrameStore, &be_node_tag); - set_op_tag(op_be_FrameAddr, &be_node_tag); - set_op_tag(op_be_Barrier, &be_node_tag); + if (a_attr->offset != b_attr->offset) + return 1; - op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr; + return be_nodes_equal(a, b); } /** - * Initializes the generic attribute of all be nodes and return ir. + * Compare the attributes of two be_Call nodes. + * + * @return zero if both nodes have identically attributes */ -static void *init_node_attr(ir_node* irn, int max_reg_data) +static int Call_cmp_attr(const ir_node *a, const ir_node *b) { - ir_graph *irg = get_irn_irg(irn); - be_node_attr_t *a = get_irn_attr(irn); + const be_call_attr_t *a_attr = (const be_call_attr_t*)get_irn_generic_attr_const(a); + const be_call_attr_t *b_attr = (const be_call_attr_t*)get_irn_generic_attr_const(b); - memset(a, 0, sizeof(get_op_attr_size(get_irn_op(irn)))); - a->max_reg_data = max_reg_data; - a->reg_data = NULL; + if (a_attr->ent != b_attr->ent || + a_attr->call_tp != b_attr->call_tp) + return 1; - if(max_reg_data > 0) { - int i; + return be_nodes_equal(a, b); +} - a->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(irg), 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; - } - } +static arch_register_req_t *allocate_reg_req(ir_graph *const irg) +{ + struct obstack *obst = be_get_be_obst(irg); - return a; + arch_register_req_t *req = OALLOCZ(obst, arch_register_req_t); + return req; } -int is_be_node(const ir_node *irn) +void be_set_constr_in(ir_node *node, int pos, const arch_register_req_t *req) { - return get_op_tag(get_irn_op(irn)) == &be_node_tag; + backend_info_t *info = be_get_info(node); + assert(pos < get_irn_arity(node)); + info->in_reqs[pos] = req; } -be_opcode_t be_get_irn_opcode(const ir_node *irn) +void be_set_constr_out(ir_node *node, int pos, const arch_register_req_t *req) { - return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp; + backend_info_t *info = be_get_info(node); + info->out_infos[pos].req = req; } /** - * Skip Proj nodes and return their Proj numbers. - * - * If *node is a Proj or Proj(Proj) node, skip it. - * - * @param node points to the node to be skipped - * - * @return 0 if *node was no Proj node, its Proj number else. + * Initializes the generic attribute of all be nodes and return it. */ -static int redir_proj(const ir_node **node) +static void init_node_attr(ir_node *node, int n_inputs, int n_outputs) { - const ir_node *n = *node; + assert(n_outputs >= 0); - if(is_Proj(n)) { - ir_node *irn; + ir_graph *irg = get_irn_irg(node); + struct obstack *obst = be_get_be_obst(irg); + backend_info_t *info = be_get_info(node); + const arch_register_req_t **in_reqs; - *node = irn = get_Proj_pred(n); - if(is_Proj(irn)) { - assert(get_irn_mode(irn) == mode_T); - *node = get_Proj_pred(irn); + if (n_inputs >= 0) { + int i; + assert(n_inputs == get_irn_arity(node)); + in_reqs = OALLOCN(obst, const arch_register_req_t*, n_inputs); + for (i = 0; i < n_inputs; ++i) { + in_reqs[i] = arch_no_register_req; } - return get_Proj_proj(n); + } else { + in_reqs = NEW_ARR_F(const arch_register_req_t*, 0); } + info->in_reqs = in_reqs; - return 0; -} - -static be_node_attr_t *retrieve_irn_attr(const ir_node *irn, int *the_pos) -{ - int dummy; - be_node_attr_t *res = NULL; - int *pos = the_pos ? the_pos : &dummy; - - *pos = -1; - if(is_Proj(irn)) { - ir_node *pred = get_Proj_pred(irn); - int p = get_Proj_proj(irn); - - if(is_be_node(pred)) { - 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"); - } + info->out_infos = NEW_ARR_DZ(reg_out_info_t, obst, n_outputs); + for (int i = 0; i < n_outputs; ++i) { + info->out_infos[i].req = arch_no_register_req; } - - 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) { - res = a; - *pos = 0; - } - } - - return res; -} - -static be_reg_data_t *retrieve_reg_data(const ir_node *irn) -{ - int pos; - be_node_attr_t *a = retrieve_irn_attr(irn, &pos); - return a ? &a->reg_data[pos] : NULL; } -static void -be_node_set_irn_reg(const void *_self, ir_node *irn, const arch_register_t *reg) +static void add_register_req_in(ir_node *node, const arch_register_req_t *req) { - be_reg_data_t *r = retrieve_reg_data(irn); - - if(r) - r->reg = reg; + backend_info_t *info = be_get_info(node); + ARR_APP1(const arch_register_req_t*, info->in_reqs, req); } - -ir_node *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, - ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *to_spill) +ir_node *be_new_Spill(const arch_register_class_t *cls, + const arch_register_class_t *cls_frame, ir_node *bl, + ir_node *frame, ir_node *to_spill) { be_frame_attr_t *a; ir_node *in[2]; ir_node *res; + ir_graph *irg = get_Block_irg(bl); in[0] = frame; in[1] = to_spill; res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in); - a = init_node_attr(res, 2); + init_node_attr(res, 2, 1); + a = (be_frame_attr_t*) get_irn_generic_attr(res); a->ent = NULL; a->offset = 0; + a->base.exc.pin_state = op_pin_state_pinned; + + be_node_set_reg_class_in(res, n_be_Spill_frame, cls_frame); + be_node_set_reg_class_in(res, n_be_Spill_val, cls); + arch_set_irn_register_req_out(res, 0, arch_no_register_req); + arch_add_irn_flags(res, arch_irn_flags_spill); - be_node_set_reg_class(res, be_pos_Spill_frame, cls_frame); - be_node_set_reg_class(res, be_pos_Spill_val, cls); return res; } -ir_node *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, - ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode) +ir_node *be_new_Reload(const arch_register_class_t *cls, + const arch_register_class_t *cls_frame, ir_node *block, + ir_node *frame, ir_node *mem, ir_mode *mode) { - ir_node *in[2]; - ir_node *res; + ir_node *in[2]; + ir_node *res; + ir_graph *irg = get_Block_irg(block); + be_frame_attr_t *a; in[0] = frame; in[1] = mem; - res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in); + res = new_ir_node(NULL, irg, block, op_be_Reload, mode, 2, in); + + init_node_attr(res, 2, 1); + be_node_set_reg_class_out(res, 0, cls); + + be_node_set_reg_class_in(res, n_be_Reload_frame, cls_frame); + arch_set_irn_flags(res, arch_irn_flags_rematerializable); + + a = (be_frame_attr_t*) get_irn_generic_attr(res); + a->ent = NULL; + a->offset = 0; + a->base.exc.pin_state = op_pin_state_pinned; - init_node_attr(res, 2); - be_node_set_reg_class(res, -1, cls); - be_node_set_reg_class(res, be_pos_Reload_frame, cls_frame); - be_node_set_flags(res, -1, arch_irn_flags_rematerializable); return res; } ir_node *be_get_Reload_mem(const ir_node *irn) { assert(be_is_Reload(irn)); - return get_irn_n(irn, be_pos_Reload_mem); + return get_irn_n(irn, n_be_Reload_mem); } ir_node *be_get_Reload_frame(const ir_node *irn) { assert(be_is_Reload(irn)); - return get_irn_n(irn, be_pos_Reload_frame); + return get_irn_n(irn, n_be_Reload_frame); } ir_node *be_get_Spill_val(const ir_node *irn) { assert(be_is_Spill(irn)); - return get_irn_n(irn, be_pos_Spill_val); + return get_irn_n(irn, n_be_Spill_val); } + ir_node *be_get_Spill_frame(const ir_node *irn) { assert(be_is_Spill(irn)); - return get_irn_n(irn, be_pos_Spill_frame); + return get_irn_n(irn, n_be_Spill_frame); +} + +ir_node *be_new_Perm(const arch_register_class_t *cls, ir_node *block, + int n, ir_node *in[]) +{ + int i; + ir_graph *irg = get_Block_irg(block); + be_node_attr_t *attr; + + ir_node *irn = new_ir_node(NULL, irg, block, op_be_Perm, mode_T, n, in); + init_node_attr(irn, n, n); + attr = (be_node_attr_t*) get_irn_generic_attr(irn); + attr->exc.pin_state = op_pin_state_pinned; + for (i = 0; i < n; ++i) { + const ir_node *input = in[i]; + const arch_register_req_t *req = arch_get_irn_register_req(input); + if (req->width == 1) { + be_set_constr_in(irn, i, cls->class_req); + be_set_constr_out(irn, i, cls->class_req); + } else { + 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; + be_set_constr_in(irn, i, new_req); + be_set_constr_out(irn, i, new_req); + } + } + + return irn; } -ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[]) +void be_Perm_reduce(ir_node *perm, int new_size, int *map) { - int i; - ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in); - init_node_attr(irn, n); - for(i = 0; i < n; ++i) { - be_node_set_reg_class(irn, i, cls); - be_node_set_reg_class(irn, OUT_POS(i), cls); + int arity = get_irn_arity(perm); + const arch_register_req_t **old_in_reqs + = ALLOCAN(const arch_register_req_t*, arity); + reg_out_info_t *old_infos = ALLOCAN(reg_out_info_t, arity); + backend_info_t *info = be_get_info(perm); + ir_node **new_in; + int i; + + assert(be_is_Perm(perm)); + assert(new_size <= arity); + + new_in = ALLOCAN(ir_node*, new_size); + + /* save the old register data */ + memcpy(old_in_reqs, info->in_reqs, arity * sizeof(old_in_reqs[0])); + memcpy(old_infos, info->out_infos, arity * sizeof(old_infos[0])); + + /* compose the new in array and set the new register data directly */ + for (i = 0; i < new_size; ++i) { + int idx = map[i]; + new_in[i] = get_irn_n(perm, idx); + info->in_reqs[i] = old_in_reqs[idx]; + info->out_infos[i] = old_infos[idx]; } - return irn; + set_irn_in(perm, new_size, new_in); } -ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, int n, ir_node *in[]) +ir_node *be_new_MemPerm(ir_node *block, int n, ir_node *in[]) { - int i; - ir_node *frame = get_irg_frame(irg); - const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1); - ir_node *irn; - const arch_register_t *sp = arch_env->isa->sp; - be_memperm_attr_t *attr; - ir_node **real_in; + ir_graph *irg = get_Block_irg(block); + const arch_env_t *arch_env = be_get_irg_arch_env(irg); + ir_node *frame = get_irg_frame(irg); + const arch_register_t *sp = arch_env->sp; + ir_node *irn; + be_memperm_attr_t *attr; + ir_node **real_in; - real_in = alloca((n+1) * sizeof(real_in[0])); + real_in = ALLOCAN(ir_node*, n + 1); real_in[0] = frame; memcpy(&real_in[1], in, n * sizeof(real_in[0])); - irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in); + irn = new_ir_node(NULL, irg, block, op_be_MemPerm, mode_T, n+1, real_in); - init_node_attr(irn, n + 1); - be_node_set_reg_class(irn, 0, sp->reg_class); - for(i = 0; i < n; ++i) { - be_node_set_reg_class(irn, i + 1, cls_frame); - be_node_set_reg_class(irn, OUT_POS(i), cls_frame); - } - - attr = get_irn_attr(irn); + init_node_attr(irn, n + 1, n); + be_node_set_reg_class_in(irn, 0, sp->reg_class); - attr->in_entities = obstack_alloc(irg->obst, n * sizeof(attr->in_entities[0])); - memset(attr->in_entities, 0, n * sizeof(attr->in_entities[0])); - attr->out_entities = obstack_alloc(irg->obst, n*sizeof(attr->out_entities[0])); - memset(attr->out_entities, 0, n*sizeof(attr->out_entities[0])); + attr = (be_memperm_attr_t*)get_irn_generic_attr(irn); + attr->in_entities = OALLOCNZ(get_irg_obstack(irg), ir_entity*, n); + attr->out_entities = OALLOCNZ(get_irg_obstack(irg), ir_entity*, n); return irn; } - -ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op) +ir_node *be_new_Copy(ir_node *bl, ir_node *op) { ir_node *in[1]; ir_node *res; + 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); + const arch_register_class_t *cls = in_req->cls; in[0] = op; res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in); - init_node_attr(res, 1); - be_node_set_reg_class(res, 0, cls); - be_node_set_reg_class(res, OUT_POS(0), cls); - return res; -} + init_node_attr(res, 1, 1); + attr = (be_node_attr_t*) get_irn_generic_attr(res); + attr->exc.pin_state = op_pin_state_floats; + be_node_set_reg_class_in(res, 0, cls); + be_node_set_reg_class_out(res, 0, cls); + + 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); + req->other_same = 1U << 0; + req->width = in_req->width; + be_set_constr_out(res, 0, req); -ir_node *be_get_Copy_op(const ir_node *cpy) { - return get_irn_n(cpy, be_pos_Copy_op); + return res; } -void be_set_Copy_op(ir_node *cpy, ir_node *op) { - set_irn_n(cpy, be_pos_Copy_op, op); +ir_node *be_get_Copy_op(const ir_node *cpy) +{ + return get_irn_n(cpy, n_be_Copy_op); } -ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[]) +ir_node *be_new_Keep(ir_node *block, int n, ir_node *in[]) { int i; - ir_node *irn; - - 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); + ir_node *res; + ir_graph *irg = get_Block_irg(block); + be_node_attr_t *attr; + + res = new_ir_node(NULL, irg, block, op_be_Keep, mode_ANY, -1, NULL); + init_node_attr(res, -1, 1); + attr = (be_node_attr_t*) get_irn_generic_attr(res); + attr->exc.pin_state = op_pin_state_pinned; + + for (i = 0; i < n; ++i) { + 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(irn); - return irn; + keep_alive(res); + + return res; } -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) +void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node) +{ + assert(be_is_Keep(keep)); + add_irn_n(keep, node); + add_register_req_in(keep, cls->class_req); +} + +ir_node *be_new_Call(dbg_info *dbg, ir_node *bl, ir_node *mem, + 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 = be_pos_Call_first_arg + n; - ir_node *irn; + int real_n = n_be_Call_first_arg + n; ir_node **real_in; NEW_ARR_A(ir_node *, real_in, real_n); - real_in[be_pos_Call_mem] = mem; - real_in[be_pos_Call_sp] = sp; - real_in[be_pos_Call_ptr] = ptr; - memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0])); - - irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in); - a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n)); - a->ent = NULL; - a->call_tp = call_tp; + real_in[n_be_Call_mem] = mem; + real_in[n_be_Call_sp] = sp; + real_in[n_be_Call_ptr] = ptr; + memcpy(&real_in[n_be_Call_first_arg], in, n * sizeof(in[0])); + + ir_graph *const irg = get_Block_irg(bl); + ir_node *const irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in); + init_node_attr(irn, real_n, n_outs); + a = (be_call_attr_t*)get_irn_generic_attr(irn); + a->ent = NULL; + 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; } -/* Gets the call entity or NULL if this is no static call. */ -ir_entity *be_Call_get_entity(const ir_node *call) { - be_call_attr_t *a = get_irn_attr(call); +ir_entity *be_Call_get_entity(const ir_node *call) +{ + const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(call); assert(be_is_Call(call)); return a->ent; } -/* Sets the call entity. */ -void be_Call_set_entity(ir_node *call, ir_entity *ent) { - be_call_attr_t *a = get_irn_attr(call); +void be_Call_set_entity(ir_node *call, ir_entity *ent) +{ + be_call_attr_t *a = (be_call_attr_t*)get_irn_generic_attr(call); assert(be_is_Call(call)); a->ent = ent; } -/* Gets the call type. */ -ir_type *be_Call_get_type(ir_node *call) { - be_call_attr_t *a = get_irn_attr(call); +ir_type *be_Call_get_type(ir_node *call) +{ + const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(call); assert(be_is_Call(call)); return a->call_tp; } -/* Sets the call type. */ -void be_Call_set_type(ir_node *call, ir_type *call_tp) { - be_call_attr_t *a = get_irn_attr(call); +void be_Call_set_type(ir_node *call, ir_type *call_tp) +{ + be_call_attr_t *a = (be_call_attr_t*)get_irn_generic_attr(call); assert(be_is_Call(call)); a->call_tp = call_tp; } -/* Construct a new be_Return. */ -ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *bl, int n_res, int n, ir_node *in[]) +void be_Call_set_pop(ir_node *call, unsigned pop) { - be_return_attr_t *a; - ir_node *irn = new_ir_node(dbg, irg, bl, op_be_Return, mode_X, n, in); - init_node_attr(irn, n); - a = get_irn_attr(irn); - a->num_ret_vals = n_res; - - return irn; + be_call_attr_t *a = (be_call_attr_t*)get_irn_generic_attr(call); + a->pop = pop; } -/* Returns the number of real returns values */ -int be_Return_get_n_rets(ir_node *ret) +unsigned be_Call_get_pop(const ir_node *call) { - be_return_attr_t *a = get_irn_attr(ret); - return a->num_ret_vals; + const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(call); + return a->pop; } -ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, int offset) +ir_node *be_new_Return(dbg_info *const dbg, ir_node *const block, int const n_res, unsigned const pop, int const n, ir_node **const in) { - be_stack_attr_t *a; - ir_node *irn; - ir_node *in[1]; - - in[0] = old_sp; - irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, sizeof(in) / sizeof(in[0]), in); - a = init_node_attr(irn, 1); - a->offset = offset; + ir_graph *const irg = get_Block_irg(block); + ir_node *const res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, n, in); + init_node_attr(res, n, 1); + be_set_constr_out(res, 0, arch_no_register_req); - be_node_set_flags(irn, -1, arch_irn_flags_ignore | arch_irn_flags_modify_sp); + be_return_attr_t *const a = (be_return_attr_t*)get_irn_generic_attr(res); + a->num_ret_vals = n_res; + a->pop = pop; + a->emit_pop = 0; + a->base.exc.pin_state = op_pin_state_pinned; - /* Set output constraint to stack register. */ - be_node_set_reg_class(irn, 0, sp->reg_class); - be_set_constr_single_reg(irn, BE_OUT_POS(0), sp); - be_node_set_irn_reg(NULL, irn, sp); - - return irn; + return res; } -ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz) +int be_Return_get_n_rets(const ir_node *ret) { - be_node_attr_t *a; - ir_node *irn; - ir_node *in[be_pos_AddSP_last]; - - in[be_pos_AddSP_old_sp] = old_sp; - in[be_pos_AddSP_size] = sz; - - irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in); - a = init_node_attr(irn, be_pos_AddSP_last); + const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret); + return a->num_ret_vals; +} - be_node_set_flags(irn, OUT_POS(pn_be_AddSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp); +unsigned be_Return_get_pop(const ir_node *ret) +{ + const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret); + return a->pop; +} - /* Set output constraint to stack register. */ - be_set_constr_single_reg(irn, be_pos_AddSP_old_sp, sp); - be_node_set_reg_class(irn, be_pos_AddSP_size, arch_register_get_class(sp)); - be_set_constr_single_reg(irn, OUT_POS(pn_be_AddSP_res), sp); - a->reg_data[pn_be_AddSP_res].reg = sp; +int be_Return_get_emit_pop(const ir_node *ret) +{ + const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret); + return a->emit_pop; +} - return irn; +void be_Return_set_emit_pop(ir_node *ret, int emit_pop) +{ + be_return_attr_t *a = (be_return_attr_t*)get_irn_generic_attr(ret); + a->emit_pop = emit_pop; } -ir_node *be_new_SubSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz) +ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *bl, + ir_node *old_sp, int offset, int align) { - be_node_attr_t *a; + be_incsp_attr_t *a; ir_node *irn; - ir_node *in[be_pos_SubSP_last]; - - in[be_pos_SubSP_old_sp] = old_sp; - in[be_pos_SubSP_size] = sz; - - irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in); - a = init_node_attr(irn, be_pos_SubSP_last); + ir_node *in[1]; + ir_graph *irg = get_Block_irg(bl); - be_node_set_flags(irn, OUT_POS(pn_be_SubSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp); + in[0] = old_sp; + irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, + ARRAY_SIZE(in), in); + init_node_attr(irn, 1, 1); + a = (be_incsp_attr_t*)get_irn_generic_attr(irn); + a->offset = offset; + a->align = align; + a->base.exc.pin_state = op_pin_state_pinned; /* Set output constraint to stack register. */ - be_set_constr_single_reg(irn, be_pos_SubSP_old_sp, sp); - be_node_set_reg_class(irn, be_pos_SubSP_size, arch_register_get_class(sp)); - be_set_constr_single_reg(irn, OUT_POS(pn_be_SubSP_res), sp); - a->reg_data[pn_be_SubSP_res].reg = sp; + be_node_set_reg_class_in(irn, 0, sp->reg_class); + be_set_constr_single_reg_out(irn, 0, sp, arch_register_req_type_produces_sp); return irn; } -ir_node *be_new_SetSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *op, ir_node *mem) +ir_node *be_new_AddSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp, + ir_node *sz) { - be_node_attr_t *a; ir_node *irn; - ir_node *in[3]; + ir_node *in[n_be_AddSP_last]; + ir_graph *irg; + be_node_attr_t *attr; - in[0] = mem; - in[1] = old_sp; - in[2] = op; - irn = new_ir_node(NULL, irg, bl, op_be_SetSP, get_irn_mode(old_sp), 3, in); - a = init_node_attr(irn, 3); + in[n_be_AddSP_old_sp] = old_sp; + in[n_be_AddSP_size] = sz; - be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore | arch_irn_flags_modify_sp); + irg = get_Block_irg(bl); + irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, n_be_AddSP_last, in); + init_node_attr(irn, n_be_AddSP_last, pn_be_AddSP_last); + attr = (be_node_attr_t*) get_irn_generic_attr(irn); + attr->exc.pin_state = op_pin_state_pinned; /* Set output constraint to stack register. */ - be_set_constr_single_reg(irn, OUT_POS(0), sp); - be_node_set_reg_class(irn, be_pos_AddSP_size, sp->reg_class); - be_node_set_reg_class(irn, be_pos_AddSP_old_sp, sp->reg_class); + be_set_constr_single_reg_in(irn, n_be_AddSP_old_sp, sp, + arch_register_req_type_none); + be_node_set_reg_class_in(irn, n_be_AddSP_size, sp->reg_class); + be_set_constr_single_reg_out(irn, pn_be_AddSP_sp, sp, + arch_register_req_type_produces_sp); return irn; } -ir_node *be_new_StackParam(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *frame_pointer, ir_entity *ent) +ir_node *be_new_SubSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp, ir_node *sz) { - be_frame_attr_t *a; ir_node *irn; - ir_node *in[1]; + ir_node *in[n_be_SubSP_last]; + ir_graph *irg; + be_node_attr_t *attr; - in[0] = frame_pointer; - irn = new_ir_node(NULL, irg, bl, op_be_StackParam, mode, 1, in); - a = init_node_attr(irn, 1); - a->ent = ent; + in[n_be_SubSP_old_sp] = old_sp; + in[n_be_SubSP_size] = sz; - be_node_set_reg_class(irn, 0, cls_frame); - be_node_set_reg_class(irn, OUT_POS(0), cls); - return irn; -} + irg = get_Block_irg(bl); + irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, n_be_SubSP_last, in); + init_node_attr(irn, n_be_SubSP_last, pn_be_SubSP_last); + attr = (be_node_attr_t*) get_irn_generic_attr(irn); + attr->exc.pin_state = op_pin_state_pinned; -ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs) -{ - ir_node *irn; - ir_node *in[1]; + /* Set output constraint to stack register. */ + be_set_constr_single_reg_in(irn, n_be_SubSP_old_sp, sp, + arch_register_req_type_none); + be_node_set_reg_class_in(irn, n_be_SubSP_size, sp->reg_class); + be_set_constr_single_reg_out(irn, pn_be_SubSP_sp, sp, arch_register_req_type_produces_sp); - irn = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, in); - init_node_attr(irn, n_outs); return irn; } -ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data, - ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_entity *ent) +ir_node *be_new_Start(dbg_info *dbgi, ir_node *bl, int n_outs) { - be_frame_attr_t *a; - ir_node *irn; - ir_node *in[2]; - - in[0] = mem; - in[1] = frame; - irn = new_ir_node(NULL, irg, bl, op_be_FrameLoad, mode_T, 2, in); - a = init_node_attr(irn, 3); - a->ent = ent; - a->offset = 0; - be_node_set_reg_class(irn, 1, cls_frame); - be_node_set_reg_class(irn, OUT_POS(pn_Load_res), cls_data); - return irn; -} + ir_node *res; + ir_graph *irg = get_Block_irg(bl); + be_node_attr_t *attr; -ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data, - ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, ir_entity *ent) -{ - be_frame_attr_t *a; - ir_node *irn; - ir_node *in[3]; + res = new_ir_node(dbgi, irg, bl, op_be_Start, mode_T, 0, NULL); + init_node_attr(res, 0, n_outs); + attr = (be_node_attr_t*) get_irn_generic_attr(res); + attr->exc.pin_state = op_pin_state_pinned; - in[0] = mem; - in[1] = frame; - in[2] = data; - irn = new_ir_node(NULL, irg, bl, op_be_FrameStore, mode_T, 3, in); - a = init_node_attr(irn, 3); - a->ent = ent; - a->offset = 0; - be_node_set_reg_class(irn, 1, cls_frame); - be_node_set_reg_class(irn, 2, cls_data); - return irn; + return res; } -ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent) +ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_node *bl, ir_node *frame, ir_entity *ent) { be_frame_attr_t *a; ir_node *irn; ir_node *in[1]; + ir_graph *irg = get_Block_irg(bl); in[0] = frame; irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in); - a = init_node_attr(irn, 1); - a->ent = ent; - a->offset = 0; - be_node_set_reg_class(irn, 0, cls_frame); - be_node_set_reg_class(irn, OUT_POS(0), cls_frame); + init_node_attr(irn, 1, 1); + a = (be_frame_attr_t*)get_irn_generic_attr(irn); + a->ent = ent; + a->offset = 0; + a->base.exc.pin_state = op_pin_state_floats; + be_node_set_reg_class_in(irn, 0, cls_frame); + be_node_set_reg_class_out(irn, 0, cls_frame); return optimize_node(irn); } -ir_node *be_new_CopyKeep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *src, int n, ir_node *in_keep[], ir_mode *mode) +ir_node *be_get_FrameAddr_frame(const ir_node *node) { - ir_node *irn; - ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0])); + assert(be_is_FrameAddr(node)); + return get_irn_n(node, n_be_FrameAddr_ptr); +} + +ir_entity *be_get_FrameAddr_entity(const ir_node *node) +{ + const be_frame_attr_t *attr = (const be_frame_attr_t*)get_irn_generic_attr_const(node); + return attr->ent; +} + +ir_node *be_new_CopyKeep(ir_node *bl, ir_node *src, int n, ir_node *in_keep[]) +{ + ir_node *irn; + ir_node **in = ALLOCAN(ir_node*, n + 1); + ir_graph *irg = get_Block_irg(bl); + const arch_register_req_t *req = arch_get_irn_register_req(src); + const arch_register_class_t *cls = req->cls; + ir_mode *mode = get_irn_mode(src); + be_node_attr_t *attr; in[0] = src; memcpy(&in[1], in_keep, n * sizeof(in[0])); irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in); - init_node_attr(irn, n + 1); - be_node_set_reg_class(irn, OUT_POS(0), cls); - be_node_set_reg_class(irn, 0, cls); + init_node_attr(irn, n + 1, 1); + attr = (be_node_attr_t*) get_irn_generic_attr(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; } -ir_node *be_new_CopyKeep_single(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *src, ir_node *keep, ir_mode *mode) +ir_node *be_new_CopyKeep_single(ir_node *bl, ir_node *src, ir_node *keep) { - ir_node *in[1]; - - in[0] = keep; - return be_new_CopyKeep(cls, irg, bl, src, 1, in, mode); -} - -ir_node *be_get_CopyKeep_op(const ir_node *cpy) { - return get_irn_n(cpy, be_pos_CopyKeep_op); + return be_new_CopyKeep(bl, src, 1, &keep); } -void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) { - set_irn_n(cpy, be_pos_CopyKeep_op, op); +ir_node *be_get_CopyKeep_op(const ir_node *cpy) +{ + return get_irn_n(cpy, n_be_CopyKeep_op); } -ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[]) +void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) { - ir_node *irn; - - irn = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, n, in); - init_node_attr(irn, n); - return irn; + set_irn_n(cpy, n_be_CopyKeep_op, op); } -int be_is_Spill (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill ; } -int be_is_Reload (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Reload ; } -int be_is_Copy (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Copy ; } -int be_is_CopyKeep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_CopyKeep ; } -int be_is_Perm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Perm ; } -int be_is_MemPerm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_MemPerm ; } -int be_is_Keep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Keep ; } -int be_is_Call (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Call ; } -int be_is_Return (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Return ; } -int be_is_IncSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_IncSP ; } -int be_is_SetSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SetSP ; } -int be_is_AddSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_AddSP ; } -int be_is_RegParams (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_RegParams ; } -int be_is_StackParam (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_StackParam ; } -int be_is_FrameAddr (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameAddr ; } -int be_is_FrameLoad (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameLoad ; } -int be_is_FrameStore (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameStore ; } -int be_is_Barrier (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Barrier ; } - -int be_has_frame_entity(const ir_node *irn) -{ - switch(be_get_irn_opcode(irn)) { - case beo_StackParam: +static bool be_has_frame_entity(const ir_node *irn) +{ + switch (get_irn_opcode(irn)) { case beo_Spill: case beo_Reload: - case beo_FrameStore: - case beo_FrameLoad: case beo_FrameAddr: - return 1; + return true; default: - return 0; + return false; } } ir_entity *be_get_frame_entity(const ir_node *irn) { if (be_has_frame_entity(irn)) { - be_frame_attr_t *a = get_irn_attr(irn); + const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn); return a->ent; } return NULL; @@ -812,7 +754,7 @@ int be_get_frame_offset(const ir_node *irn) { assert(is_be_node(irn)); if (be_has_frame_entity(irn)) { - be_frame_attr_t *a = get_irn_attr(irn); + const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn); return a->offset; } return 0; @@ -820,7 +762,7 @@ int be_get_frame_offset(const ir_node *irn) void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent) { - be_memperm_attr_t *attr = get_irn_attr(irn); + const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn); assert(be_is_MemPerm(irn)); assert(n < be_get_MemPerm_entity_arity(irn)); @@ -830,7 +772,7 @@ void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent) ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n) { - be_memperm_attr_t *attr = get_irn_attr(irn); + const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn); assert(be_is_MemPerm(irn)); assert(n < be_get_MemPerm_entity_arity(irn)); @@ -840,7 +782,7 @@ ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n) void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent) { - be_memperm_attr_t *attr = get_irn_attr(irn); + const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn); assert(be_is_MemPerm(irn)); assert(n < be_get_MemPerm_entity_arity(irn)); @@ -850,7 +792,7 @@ void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent) ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n) { - be_memperm_attr_t *attr = get_irn_attr(irn); + const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn); assert(be_is_MemPerm(irn)); assert(n < be_get_MemPerm_entity_arity(irn)); @@ -863,693 +805,482 @@ int be_get_MemPerm_entity_arity(const ir_node *irn) return get_irn_arity(irn) - 1; } -static void be_limited(void *data, bitset_t *bs) -{ - be_req_t *req = data; - - switch(req->kind) { - case be_req_kind_negate_old_limited: - case be_req_kind_old_limited: - req->x.old_limited.old_limited(req->x.old_limited.old_limited_env, bs); - if(req->kind == be_req_kind_negate_old_limited) - bitset_flip_all(bs); - break; - case be_req_kind_single_reg: - bitset_clear_all(bs); - bitset_set(bs, req->x.single_reg->index); - break; - } -} - -static INLINE be_req_t *get_req(ir_node *irn, int pos) +const arch_register_req_t *be_create_reg_req(struct obstack *obst, + const arch_register_t *reg, arch_register_req_type_t additional_types) { - int idx = pos < 0 ? -(pos + 1) : pos; - be_node_attr_t *a = get_irn_attr(irn); - be_reg_data_t *rd = &a->reg_data[idx]; - be_req_t *r = pos < 0 ? &rd->req : &rd->in_req; + arch_register_req_t *req = OALLOC(obst, arch_register_req_t); + const arch_register_class_t *cls = reg->reg_class; + unsigned *limited_bitset; - assert(is_be_node(irn)); - assert(!(pos >= 0) || pos < get_irn_arity(irn)); - assert(!(pos < 0) || -(pos + 1) <= a->max_reg_data); + limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls)); + rbitset_set(limited_bitset, reg->index); - return r; + req->type = arch_register_req_type_limited | additional_types; + req->cls = cls; + req->limited = limited_bitset; + req->width = 1; + return req; } -void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg) +void be_set_constr_single_reg_in(ir_node *node, int pos, + const arch_register_t *reg, arch_register_req_type_t additional_types) { - be_req_t *r = get_req(irn, pos); + const arch_register_req_t *req; - r->kind = be_req_kind_single_reg; - r->x.single_reg = reg; - r->req.limited = be_limited; - r->req.limited_env = r; - r->req.type = arch_register_req_type_limited; - r->req.cls = reg->reg_class; + if (additional_types == 0) { + req = reg->single_req; + } else { + ir_graph *irg = get_irn_irg(node); + struct obstack *obst = be_get_be_obst(irg); + req = be_create_reg_req(obst, reg, additional_types); + } + be_set_constr_in(node, pos, req); } -void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req) +void be_set_constr_single_reg_out(ir_node *node, int pos, + const arch_register_t *reg, arch_register_req_type_t additional_types) { - be_req_t *r = get_req(irn, pos); + ir_graph *irg = get_irn_irg(node); + be_irg_t *birg = be_birg_from_irg(irg); + const arch_register_req_t *req; - assert(arch_register_req_is(req, limited)); + /* if we have an ignore register, add ignore flag and just assign it */ + if (!rbitset_is_set(birg->allocatable_regs, reg->global_index)) { + additional_types |= arch_register_req_type_ignore; + } - r->kind = be_req_kind_old_limited; - r->req.limited = be_limited; - r->req.limited_env = r; - r->req.type = arch_register_req_type_limited; - r->req.cls = req->cls; + if (additional_types == 0) { + req = reg->single_req; + } else { + struct obstack *obst = be_get_be_obst(irg); + req = be_create_reg_req(obst, reg, additional_types); + } - r->x.old_limited.old_limited = req->limited; - r->x.old_limited.old_limited_env = req->limited_env; + arch_set_irn_register_out(node, pos, reg); + be_set_constr_out(node, pos, req); } -void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags) +void be_node_set_reg_class_in(ir_node *irn, int pos, + const arch_register_class_t *cls) { - be_req_t *r = get_req(irn, pos); - r->flags = flags; + be_set_constr_in(irn, pos, cls->class_req); } -void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls) +void be_node_set_reg_class_out(ir_node *irn, int pos, + const arch_register_class_t *cls) { - be_req_t *r = get_req(irn, pos); - - r->req.cls = cls; - - if (cls == NULL) - 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; + be_set_constr_out(irn, pos, cls->class_req); } -void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type) +ir_node *be_get_IncSP_pred(ir_node *irn) { - be_req_t *r = get_req(irn, pos); - r->req.type = type; -} - -ir_node *be_get_IncSP_pred(ir_node *irn) { assert(be_is_IncSP(irn)); return get_irn_n(irn, 0); } -void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) { +void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) +{ assert(be_is_IncSP(incsp)); set_irn_n(incsp, 0, pred); } -ir_node *be_get_IncSP_mem(ir_node *irn) { - assert(be_is_IncSP(irn)); - return get_irn_n(irn, 1); -} - void be_set_IncSP_offset(ir_node *irn, int offset) { - be_stack_attr_t *a = get_irn_attr(irn); + be_incsp_attr_t *a = (be_incsp_attr_t*)get_irn_generic_attr(irn); assert(be_is_IncSP(irn)); a->offset = offset; } int be_get_IncSP_offset(const ir_node *irn) { - be_stack_attr_t *a = get_irn_attr(irn); + const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn); assert(be_is_IncSP(irn)); return a->offset; } -ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn) +int be_get_IncSP_align(const ir_node *irn) { - ir_node *bl = get_nodes_block(irn); - ir_graph *irg = get_irn_irg(bl); - ir_node *frame = get_irg_frame(irg); - const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1); - const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1); - ir_node *spill; - - spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn); - return spill; + const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn); + assert(be_is_IncSP(irn)); + return a->align; } -ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill) +static ir_entity *be_node_get_frame_entity(const ir_node *irn) { - ir_node *reload; - ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert); - ir_graph *irg = get_irn_irg(bl); - ir_node *frame = get_irg_frame(irg); - const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1); - - assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M)); - - reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode); - - if (is_Block(insert)) { - insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env); - sched_add_after(insert, reload); - } - - else - sched_add_before(insert, reload); - - return reload; -} - -/* - ____ ____ - | _ \ ___ __ _ | _ \ ___ __ _ ___ - | |_) / _ \/ _` | | |_) / _ \/ _` / __| - | _ < __/ (_| | | _ < __/ (_| \__ \ - |_| \_\___|\__, | |_| \_\___|\__, |___/ - |___/ |_| - -*/ - - -static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int out_pos) -{ - const be_node_attr_t *a = get_irn_attr(irn); - - if(out_pos < a->max_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 { - req->type = arch_register_req_type_none; - req->cls = NULL; - } - - return req; + return be_get_frame_entity(irn); } -static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos) +void be_node_set_frame_entity(ir_node *irn, ir_entity *ent) { - const be_node_attr_t *a = get_irn_attr(irn); + be_frame_attr_t *a; - if(pos < get_irn_arity(irn) && pos < a->max_reg_data) - memcpy(req, &a->reg_data[pos].in_req, sizeof(req[0])); - else { - req->type = arch_register_req_type_none; - req->cls = NULL; - } + assert(be_has_frame_entity(irn)); - return req; + a = (be_frame_attr_t*)get_irn_generic_attr(irn); + a->ent = ent; } -static const arch_register_req_t * -be_node_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_node *irn, int pos) +static void be_node_set_frame_offset(ir_node *irn, int offset) { - int out_pos = pos; - - if (pos < 0) { - if (get_irn_mode(irn) == mode_T) - return NULL; - - out_pos = redir_proj((const ir_node **)&irn); - assert(is_be_node(irn)); - return put_out_reg_req(req, irn, out_pos); - } - - else { - if (is_be_node(irn)) { - /* - For spills and reloads, we return "none" as requirement for frame pointer, - so every input is ok. Some backends need this (e.g. STA). We use an arbitrary - large number as pos, so put_in_reg_req will return "none" as requirement. - */ - if ((be_is_Spill(irn) && pos == be_pos_Spill_frame) || - (be_is_Reload(irn) && pos == be_pos_Reload_frame)) - return put_in_reg_req(req, irn, INT_MAX); - else - return put_in_reg_req(req, irn, pos); - } - return NULL; - } + be_frame_attr_t *a; - return req; -} + if (!be_has_frame_entity(irn)) + return; -const arch_register_t * -be_node_get_irn_reg(const void *_self, const ir_node *irn) -{ - be_reg_data_t *r = retrieve_reg_data(irn); - return r ? r->reg : NULL; + a = (be_frame_attr_t*)get_irn_generic_attr(irn); + a->offset = offset; } -static arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn) +static int be_node_get_sp_bias(const ir_node *irn) { - redir_proj((const ir_node **) &irn); - - switch(be_get_irn_opcode(irn)) { -#define XXX(a,b) case beo_ ## a: return arch_irn_class_ ## b - XXX(Spill, spill); - XXX(Reload, reload); - XXX(Perm, perm); - XXX(Copy, copy); - XXX(Return, branch); - XXX(StackParam, stackparam); -#undef XXX - default: - return arch_irn_class_normal; - } + if (be_is_IncSP(irn)) + return be_get_IncSP_offset(irn); + if (be_is_Call(irn)) + return -(int)be_Call_get_pop(irn); return 0; } -static arch_irn_flags_t be_node_get_flags(const void *_self, const ir_node *irn) -{ - be_reg_data_t *r = retrieve_reg_data(irn); - return r ? r->req.flags : 0; -} -static ir_entity *be_node_get_frame_entity(const void *self, const ir_node *irn) -{ - return be_get_frame_entity(irn); -} - -static void be_node_set_frame_entity(const void *self, ir_node *irn, ir_entity *ent) -{ - be_frame_attr_t *a; - assert(be_has_frame_entity(irn)); - - a = get_irn_attr(irn); - a->ent = ent; -} - -static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset) -{ - if(be_has_frame_entity(irn)) { - be_frame_attr_t *a = get_irn_attr(irn); - a->offset = offset; - } -} - -static int be_node_get_sp_bias(const void *self, const ir_node *irn) -{ - return be_is_IncSP(irn) ? be_get_IncSP_offset(irn) : 0; -} - -/* - ___ ____ _ _ _ _ _ _ - |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __ - | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__| - | || _ <| |\ | | _ | (_| | | | | (_| | | __/ | - |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_| - -*/ - -static const arch_irn_ops_if_t be_node_irn_ops_if = { - be_node_get_irn_reg_req, - be_node_set_irn_reg, - be_node_get_irn_reg, - be_node_classify, - be_node_get_flags, +/* for be nodes */ +static const arch_irn_ops_t be_node_irn_ops = { be_node_get_frame_entity, - be_node_set_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 const arch_irn_ops_t be_node_irn_ops = { - &be_node_irn_ops_if -}; - -const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn) -{ - redir_proj((const ir_node **) &irn); - return is_be_node(irn) ? &be_node_irn_ops : NULL; -} - -const arch_irn_handler_t be_node_irn_handler = { - be_node_get_irn_ops -}; - -/* - ____ _ _ ___ ____ _ _ _ _ _ _ - | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __ - | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__| - | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ | - |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_| - -*/ - -typedef struct { - arch_irn_handler_t irn_handler; - arch_irn_ops_t irn_ops; - const arch_env_t *arch_env; - pmap *regs; -} phi_handler_t; - -#define get_phi_handler_from_handler(h) container_of(h, phi_handler_t, irn_handler) -#define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops) - -static const void *phi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn) -{ - const phi_handler_t *h = get_phi_handler_from_handler(handler); - return is_Phi(irn) && mode_is_datab(get_irn_mode(irn)) ? &h->irn_ops : NULL; -} - -/** - * Get register class of a Phi. - * - */ -static const arch_register_req_t *get_Phi_reg_req_recursive(const phi_handler_t *h, arch_register_req_t *req, const ir_node *phi, pset **visited) +static int get_start_reg_index(ir_graph *irg, const arch_register_t *reg) { - int n = get_irn_arity(phi); - ir_node *op; - int i; - - if(*visited && pset_find_ptr(*visited, phi)) - return NULL; + ir_node *start = get_irg_start(irg); - for(i = 0; i < n; ++i) { - op = get_irn_n(phi, i); - if(!is_Phi(op)) - return arch_get_register_req(h->arch_env, req, op, BE_OUT_POS(0)); + /* do a naive linear search... */ + 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 != reg->reg_class) + continue; + if (!rbitset_is_set(out_req->limited, reg->index)) + continue; + return i; } - - /* - The operands of that Phi were all Phis themselves. - We have to start a DFS for a non-Phi argument now. - */ - if(!*visited) - *visited = pset_new_ptr(16); - - pset_insert_ptr(*visited, phi); - - for(i = 0; i < n; ++i) { - op = get_irn_n(phi, i); - if(get_Phi_reg_req_recursive(h, req, op, visited)) - return req; - } - - return NULL; + panic("Tried querying undefined register '%s' at Start", reg->name); } -static const arch_register_req_t *phi_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_node *irn, int pos) +ir_node *be_get_initial_reg_value(ir_graph *irg, const arch_register_t *reg) { - phi_handler_t *phi_handler = get_phi_handler_from_ops(self); - pset *visited = NULL; - - get_Phi_reg_req_recursive(phi_handler, req, irn, &visited); - /* Set the requirements type to normal, since an operand of the Phi could have had constraints. */ - req->type = arch_register_req_type_normal; - if(visited) - del_pset(visited); + int i = get_start_reg_index(irg, reg); + ir_node *start = get_irg_start(irg); + ir_mode *mode = arch_register_class_mode(reg->reg_class); - return req; -} - -static void phi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg) -{ - phi_handler_t *h = get_phi_handler_from_ops(self); - pmap_insert(h->regs, irn, (void *) reg); -} - -static const arch_register_t *phi_get_irn_reg(const void *self, const ir_node *irn) -{ - phi_handler_t *h = get_phi_handler_from_ops(self); - return pmap_get(h->regs, (void *) irn); -} - -static arch_irn_class_t phi_classify(const void *_self, const ir_node *irn) -{ - return arch_irn_class_normal; -} - -static arch_irn_flags_t phi_get_flags(const void *_self, const ir_node *irn) -{ - return arch_irn_flags_none; + foreach_out_edge(start, edge) { + ir_node *proj = get_edge_src_irn(edge); + if (!is_Proj(proj)) // maybe End/Anchor + continue; + if (get_Proj_proj(proj) == i) { + return proj; + } + } + return new_r_Proj(start, mode, i); } -static ir_entity *phi_get_frame_entity(const void *_self, const ir_node *irn) +static ir_entity* dummy_get_frame_entity(const ir_node *node) { + (void) node; return NULL; } -static void phi_set_frame_entity(const void *_self, ir_node *irn, ir_entity *ent) -{ -} - -static void phi_set_frame_offset(const void *_self, ir_node *irn, int bias) +static void dummy_set_frame_offset(ir_node *node, int bias) { + (void) node; + (void) bias; + panic("should not be called"); } -static int phi_get_sp_bias(const void* self, const ir_node *irn) +static int dummy_get_sp_bias(const ir_node *node) { + (void) node; return 0; } -static const arch_irn_ops_if_t phi_irn_ops = { - phi_get_irn_reg_req, - phi_set_irn_reg, - phi_get_irn_reg, - phi_classify, - phi_get_flags, - phi_get_frame_entity, - phi_set_frame_entity, - phi_set_frame_offset, - phi_get_sp_bias, - NULL, /* get_inverse */ - NULL, /* get_op_estimated_cost */ - NULL, /* possible_memory_operand */ - NULL, /* perform_memory_operand */ +/* for "middleend" nodes */ +static const arch_irn_ops_t dummy_be_irn_ops = { + dummy_get_frame_entity, + dummy_set_frame_offset, + dummy_get_sp_bias, + NULL, /* get_op_estimated_cost */ + NULL, /* possible_memory_operand */ + NULL, /* perform_memory_operand */ }; -static const arch_irn_handler_t phi_irn_handler = { - phi_get_irn_ops -}; -arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env) -{ - phi_handler_t *h = xmalloc(sizeof(h[0])); - h->irn_handler.get_irn_ops = phi_get_irn_ops; - h->irn_ops.impl = &phi_irn_ops; - h->arch_env = arch_env; - h->regs = pmap_create(); - return (arch_irn_handler_t *) h; -} -void be_phi_handler_free(arch_irn_handler_t *handler) +ir_node *be_new_Phi(ir_node *block, int n_ins, ir_node **ins, ir_mode *mode, + const arch_register_req_t *req) { - phi_handler_t *h = (void *) handler; - pmap_destroy(h->regs); - free(handler); -} + ir_graph *irg = get_irn_irg(block); + struct obstack *obst = be_get_be_obst(irg); + backend_info_t *info; + int i; -const void *be_phi_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn) -{ - phi_handler_t *phi_handler = get_phi_handler_from_handler(self); - return is_Phi(irn) ? &phi_handler->irn_ops : NULL; -} + ir_node *phi = new_ir_node(NULL, irg, block, op_Phi, mode, n_ins, ins); + phi->attr.phi.u.backedge = new_backedge_arr(get_irg_obstack(irg), n_ins); + info = be_get_info(phi); + info->out_infos = NEW_ARR_DZ(reg_out_info_t, obst, 1); + info->in_reqs = OALLOCN(obst, const arch_register_req_t*, n_ins); -void be_phi_handler_reset(arch_irn_handler_t *handler) -{ - phi_handler_t *h = get_phi_handler_from_handler(handler); - if(h->regs) - pmap_destroy(h->regs); - h->regs = pmap_create(); + info->out_infos[0].req = req; + for (i = 0; i < n_ins; ++i) { + info->in_reqs[i] = req; + } + irn_verify_irg(phi, irg); + phi = optimize_node(phi); + return phi; } -/* - _ _ _ ____ _ - | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _ - | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` | - | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| | - |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, | - |_| |___/ -*/ - -/** - * Dumps a register requirement to a file. - */ -static void dump_node_req(FILE *f, int idx, be_req_t *req) -{ - unsigned i; - int did_something = 0; - char buf[16]; - const char *prefix = buf; - - snprintf(buf, sizeof(buf), "#%d ", idx); - buf[sizeof(buf) - 1] = '\0'; - - if(req->flags != arch_irn_flags_none) { - fprintf(f, "%sflags: ", prefix); - prefix = ""; - for(i = arch_irn_flags_none; i <= log2_ceil(arch_irn_flags_last); ++i) { - if(req->flags & (1 << i)) { - fprintf(f, "%s%s", prefix, arch_irn_flag_str(1 << i)); - prefix = "|"; - } - } - prefix = ", "; - did_something = 1; - } +void be_set_phi_reg_req(ir_node *node, const arch_register_req_t *req) +{ + int arity = get_irn_arity(node); + int i; - if(req->req.cls != 0) { - char tmp[256]; - fprintf(f, prefix); - arch_register_req_format(tmp, sizeof(tmp), &req->req); - fprintf(f, "%s", tmp); - did_something = 1; + backend_info_t *info = be_get_info(node); + info->out_infos[0].req = req; + for (i = 0; i < arity; ++i) { + info->in_reqs[i] = req; } - if(did_something) - fprintf(f, "\n"); + assert(mode_is_datab(get_irn_mode(node))); } -/** - * Dumps node register requirements to a file. - */ -static void dump_node_reqs(FILE *f, ir_node *irn) +void be_dump_phi_reg_reqs(FILE *F, const ir_node *node, dump_reason_t reason) { - int i; - be_node_attr_t *a = get_irn_attr(irn); - - fprintf(f, "registers: \n"); - for(i = 0; i < a->max_reg_data; ++i) { - be_reg_data_t *rd = &a->reg_data[i]; - if(rd->reg) - fprintf(f, "#%d: %s\n", i, rd->reg->name); - } + ir_graph *irg = get_irn_irg(node); + if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND)) + return; - fprintf(f, "in requirements\n"); - for(i = 0; i < a->max_reg_data; ++i) { - dump_node_req(f, i, &a->reg_data[i].in_req); - } + switch (reason) { + case dump_node_opcode_txt: + fputs(get_op_name(get_irn_op(node)), F); + break; + case dump_node_mode_txt: + fprintf(F, "%s", get_mode_name(get_irn_mode(node))); + break; + case dump_node_nodeattr_txt: + break; + case dump_node_info_txt: + arch_dump_reqs_and_registers(F, node); + break; - fprintf(f, "\nout requirements\n"); - for(i = 0; i < a->max_reg_data; ++i) { - dump_node_req(f, i, &a->reg_data[i].req); + default: + break; } } +static const arch_irn_ops_t phi_irn_ops = { + dummy_get_frame_entity, + dummy_set_frame_offset, + dummy_get_sp_bias, + NULL, /* get_op_estimated_cost */ + NULL, /* possible_memory_operand */ + NULL, /* perform_memory_operand */ +}; + + + /** * ir_op-Operation: dump a be node to file */ -static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason) +static void dump_node(FILE *f, const ir_node *irn, dump_reason_t reason) { - be_node_attr_t *at = get_irn_attr(irn); - assert(is_be_node(irn)); - switch(reason) { + switch (reason) { case dump_node_opcode_txt: - fprintf(f, get_op_name(get_irn_op(irn))); + fputs(get_op_name(get_irn_op(irn)), f); break; case dump_node_mode_txt: - fprintf(f, get_mode_name(get_irn_mode(irn))); + if (be_is_Copy(irn) || be_is_CopyKeep(irn)) { + fprintf(f, "%s", get_mode_name(get_irn_mode(irn))); + } break; case dump_node_nodeattr_txt: + if (be_is_Call(irn)) { + const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(irn); + if (a->ent) + fprintf(f, " [%s] ", get_entity_name(a->ent)); + } + if (be_is_IncSP(irn)) { + const be_incsp_attr_t *attr = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn); + fprintf(f, " [%d] ", attr->offset); + } break; case dump_node_info_txt: - dump_node_reqs(f, irn); + arch_dump_reqs_and_registers(f, irn); - if(be_has_frame_entity(irn)) { - be_frame_attr_t *a = (be_frame_attr_t *) at; + if (be_has_frame_entity(irn)) { + const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn); if (a->ent) { - int bits = get_type_size_bits(get_entity_type(a->ent)); - ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bits\n", - a->ent, a->offset, a->offset, bits, bits); + unsigned size = get_type_size_bytes(get_entity_type(a->ent)); + ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bytes\n", + a->ent, a->offset, a->offset, size, size); } } - switch(be_get_irn_opcode(irn)) { - case beo_IncSP: - { - be_stack_attr_t *a = (be_stack_attr_t *) at; - if (a->offset == BE_STACK_FRAME_SIZE_EXPAND) - fprintf(f, "offset: FRAME_SIZE\n"); - else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK) - fprintf(f, "offset: -FRAME SIZE\n"); - else - fprintf(f, "offset: %u\n", a->offset); - } + switch (get_irn_opcode(irn)) { + case beo_IncSP: { + const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn); + fprintf(f, "align: %d\n", a->align); + fprintf(f, "offset: %d\n", a->offset); break; - case beo_Call: - { - be_call_attr_t *a = (be_call_attr_t *) at; + } + case beo_Call: { + const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(irn); - if (a->ent) - fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent)); - } + if (a->ent) + fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent)); break; - case beo_MemPerm: - { - int i; - for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) { - ir_entity *in, *out; - in = be_get_MemPerm_in_entity(irn, i); - out = be_get_MemPerm_out_entity(irn, i); - if(in) { - fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in)); - } - if(out) { - fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out)); - } + } + case beo_MemPerm: { + int i; + for (i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) { + ir_entity *in, *out; + in = be_get_MemPerm_in_entity(irn, i); + out = be_get_MemPerm_out_entity(irn, i); + if (in) { + fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in)); + } + if (out) { + fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out)); } } break; + } default: break; } } - - return 0; } /** * ir_op-Operation: * Copies the backend specific attributes from old node to new node. */ -static void copy_attr(const ir_node *old_node, ir_node *new_node) +static void copy_attr(ir_graph *irg, const ir_node *old_node, ir_node *new_node) { - be_node_attr_t *old_attr = get_irn_attr(old_node); - be_node_attr_t *new_attr = get_irn_attr(new_node); - int i; + const void *old_attr = get_irn_generic_attr_const(old_node); + void *new_attr = get_irn_generic_attr(new_node); + struct obstack *obst = be_get_be_obst(irg); + backend_info_t *old_info = be_get_info(old_node); + backend_info_t *new_info = be_get_info(new_node); 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)); + 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) { + unsigned n_ins = get_irn_arity(old_node); + /* need dynamic in infos? */ + if (get_irn_op(old_node)->opar == oparity_dynamic) { + new_info->in_reqs = NEW_ARR_F(const arch_register_req_t*, n_ins); + } else { + new_info->in_reqs = OALLOCN(obst,const arch_register_req_t*, n_ins); + } + memcpy(new_info->in_reqs, old_info->in_reqs, + n_ins * sizeof(new_info->in_reqs[0])); + } else { + new_info->in_reqs = NULL; + } +} + +int is_be_node(const ir_node *irn) +{ + return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops; +} + +static ir_op *new_be_op(unsigned code, const char *name, op_pin_state p, + irop_flags flags, op_arity opar, size_t attr_size) +{ + ir_op *res = new_ir_op(code, name, p, flags, opar, 0, attr_size); + res->ops.dump_node = dump_node; + res->ops.copy_attr = copy_attr; + res->ops.be_ops = &be_node_irn_ops; + return res; +} - for(i = 0; i < old_attr->max_reg_data; ++i) { - be_req_t *r; +void be_init_op(void) +{ + unsigned opc; - r = &new_attr->reg_data[i].req; - r->req.limited_env = r; + assert(op_be_Spill == NULL); - r = &new_attr->reg_data[i].in_req; - r->req.limited_env = r; - } + /* Acquire all needed opcodes. */ + op_be_Spill = new_be_op(beo_Spill, "be_Spill", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_frame_attr_t)); + op_be_Reload = new_be_op(beo_Reload, "be_Reload", op_pin_state_exc_pinned, irop_flag_none, oparity_zero, sizeof(be_frame_attr_t)); + op_be_Perm = new_be_op(beo_Perm, "be_Perm", op_pin_state_exc_pinned, irop_flag_none, oparity_variable, sizeof(be_node_attr_t)); + op_be_MemPerm = new_be_op(beo_MemPerm, "be_MemPerm", op_pin_state_exc_pinned, irop_flag_none, oparity_variable, sizeof(be_memperm_attr_t)); + op_be_Copy = new_be_op(beo_Copy, "be_Copy", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_node_attr_t)); + op_be_Keep = new_be_op(beo_Keep, "be_Keep", op_pin_state_exc_pinned, irop_flag_keep, oparity_dynamic, sizeof(be_node_attr_t)); + op_be_CopyKeep = new_be_op(beo_CopyKeep, "be_CopyKeep", op_pin_state_exc_pinned, irop_flag_keep, oparity_variable, sizeof(be_node_attr_t)); + op_be_Call = new_be_op(beo_Call, "be_Call", op_pin_state_exc_pinned, irop_flag_fragile|irop_flag_uses_memory, oparity_variable, sizeof(be_call_attr_t)); + ir_op_set_memory_index(op_be_Call, n_be_Call_mem); + ir_op_set_fragile_indices(op_be_Call, pn_be_Call_X_regular, pn_be_Call_X_except); + op_be_Return = new_be_op(beo_Return, "be_Return", op_pin_state_exc_pinned, irop_flag_cfopcode, oparity_variable, sizeof(be_return_attr_t)); + op_be_AddSP = new_be_op(beo_AddSP, "be_AddSP", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_node_attr_t)); + op_be_SubSP = new_be_op(beo_SubSP, "be_SubSP", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_node_attr_t)); + op_be_IncSP = new_be_op(beo_IncSP, "be_IncSP", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_incsp_attr_t)); + op_be_Start = new_be_op(beo_Start, "be_Start", op_pin_state_exc_pinned, irop_flag_none, oparity_zero, sizeof(be_node_attr_t)); + op_be_FrameAddr = new_be_op(beo_FrameAddr, "be_FrameAddr", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_frame_attr_t)); + + op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr; + op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr; + op_be_Perm->ops.node_cmp_attr = be_nodes_equal; + op_be_MemPerm->ops.node_cmp_attr = be_nodes_equal; + op_be_Copy->ops.node_cmp_attr = be_nodes_equal; + op_be_Keep->ops.node_cmp_attr = be_nodes_equal; + op_be_CopyKeep->ops.node_cmp_attr = be_nodes_equal; + op_be_Call->ops.node_cmp_attr = Call_cmp_attr; + op_be_Return->ops.node_cmp_attr = Return_cmp_attr; + op_be_AddSP->ops.node_cmp_attr = be_nodes_equal; + op_be_SubSP->ops.node_cmp_attr = be_nodes_equal; + op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr; + op_be_Start->ops.node_cmp_attr = be_nodes_equal; + op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr; + + /* attach out dummy_ops to middle end nodes */ + for (opc = iro_First; opc <= iro_Last; ++opc) { + ir_op *op = ir_get_opcode(opc); + assert(op->ops.be_ops == NULL); + op->ops.be_ops = &dummy_be_irn_ops; } + + op_Phi->ops.be_ops = &phi_irn_ops; } -static const ir_op_ops be_node_op_ops = { - NULL, - NULL, - NULL, - NULL, - NULL, - copy_attr, - NULL, - NULL, - NULL, - NULL, - NULL, - dump_node, - NULL -}; +void be_finish_op(void) +{ + free_ir_op(op_be_Spill); op_be_Spill = NULL; + free_ir_op(op_be_Reload); op_be_Reload = NULL; + free_ir_op(op_be_Perm); op_be_Perm = NULL; + free_ir_op(op_be_MemPerm); op_be_MemPerm = NULL; + free_ir_op(op_be_Copy); op_be_Copy = NULL; + free_ir_op(op_be_Keep); op_be_Keep = NULL; + free_ir_op(op_be_CopyKeep); op_be_CopyKeep = NULL; + free_ir_op(op_be_Call); op_be_Call = NULL; + free_ir_op(op_be_Return); op_be_Return = NULL; + free_ir_op(op_be_IncSP); op_be_IncSP = NULL; + free_ir_op(op_be_AddSP); op_be_AddSP = NULL; + free_ir_op(op_be_SubSP); op_be_SubSP = NULL; + free_ir_op(op_be_Start); op_be_Start = NULL; + free_ir_op(op_be_FrameAddr); op_be_FrameAddr = NULL; +}