X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbenode.c;h=a189252a7408e89843671b5cc714248f736be9c8;hb=ca21c59ea00ff05918de26952e91ac39f1589e01;hp=9e3e2fe6e76e1fb1971dfcf53092ffd502d85648;hpb=d1ea6b5491733b44c3ff046ed7fc1859f5dda8e5;p=libfirm diff --git a/ir/be/benode.c b/ir/be/benode.c index 9e3e2fe6e..215aea191 100644 --- a/ir/be/benode.c +++ b/ir/be/benode.c @@ -1,19 +1,33 @@ -/** - * @file benode.c - * @date 17.05.2005 - * @author Sebastian Hack +/* + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. * - * Backend node support. + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. * - * This file provdies Perm, Copy, Spill and Reload nodes. + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. * - * Copyright (C) 2005 Universitaet Karlsruhe - * Released under the GPL + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ -#ifdef HAVE_CONFIG_H +/** + * @file + * @brief Backend node support for generic backend nodes. + * @author Sebastian Hack + * @date 17.05.2005 + * @version $Id$ + * + * Backend node support for generic backend nodes. + * This file provides Perm, Copy, Spill and Reload nodes. + */ #include "config.h" -#endif #include @@ -23,642 +37,1518 @@ #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" #include "irnode_t.h" #include "ircons_t.h" #include "irprintf.h" +#include "irgwalk.h" +#include "iropt_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" -/* Sometimes we want to put const nodes into get_irn_generic_attr ... */ -#define get_irn_attr(irn) get_irn_generic_attr((ir_node *) (irn)) +#define get_irn_attr(irn) get_irn_generic_attr(irn) +#define get_irn_attr_const(irn) get_irn_generic_attr_const(irn) -static unsigned be_node_tag = FOURCC('B', 'E', 'N', 'O'); +typedef struct { + const arch_register_req_t *in_req; +} be_reg_data_t; -typedef enum _node_kind_t { - node_kind_spill, - node_kind_reload, - node_kind_perm, - node_kind_copy, - node_kind_kill, - node_kind_last -} node_kind_t; +/** The generic be nodes attribute type. */ +typedef struct { + be_reg_data_t *reg_data; +} be_node_attr_t; +/** The be_Return nodes attribute type. */ typedef struct { - node_kind_t kind; - const arch_register_class_t *cls; - ir_op *op; - int n_pos; - int *pos; -} be_op_t; + be_node_attr_t node_attr; /**< base attributes of every be node. */ + 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_IncSP attribute type. */ typedef struct { - arch_register_req_t req; - unsigned negate_limited : 1; - void (*old_limited)(void *ptr, bitset_t *bs); - void *old_limited_env; -} be_req_t; + be_node_attr_t node_attr; /**< base attributes of every be node. */ + 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 { - const arch_register_t *reg; - be_req_t req; -} be_reg_data_t; + be_node_attr_t node_attr; /**< base attributes of every be node. */ + ir_entity *ent; + int offset; +} be_frame_attr_t; +/** The be_Call attribute type. */ typedef struct { - int n_outs; - const arch_register_class_t *cls; - be_reg_data_t *reg_data; -} be_node_attr_t; + be_node_attr_t node_attr; /**< base attributes of every be node. */ + ir_entity *ent; /**< The called entity if this is a static call. */ + unsigned pop; + ir_type *call_tp; /**< The call type, copied from the original Call node. */ +} be_call_attr_t; typedef struct { - be_node_attr_t node_attr; - ir_node *spill_ctx; /**< The node in whose context this spill was introduced. */ - entity *ent; /**< The entity in the stack frame the spill writes to. */ -} be_spill_attr_t; + be_node_attr_t node_attr; /**< base attributes of every be node. */ + ir_entity **in_entities; + ir_entity **out_entities; +} be_memperm_attr_t; + +ir_op *op_be_Spill; +ir_op *op_be_Reload; +ir_op *op_be_Perm; +ir_op *op_be_MemPerm; +ir_op *op_be_Copy; +ir_op *op_be_Keep; +ir_op *op_be_CopyKeep; +ir_op *op_be_Call; +ir_op *op_be_Return; +ir_op *op_be_IncSP; +ir_op *op_be_AddSP; +ir_op *op_be_SubSP; +ir_op *op_be_Start; +ir_op *op_be_FrameAddr; +ir_op *op_be_Barrier; + +static const ir_op_ops be_node_op_ops; -static ir_op *op_Spill; -static ir_op *op_Reload; -static ir_op *op_Perm; -static ir_op *op_Copy; -static ir_op *op_Keep; +#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_uses_memory -static int beo_base = -1; +/** + * Compare two be node attributes. + * + * @return zero if both attributes are identically + */ +static int node_cmp_attr(ir_node *a, ir_node *b) +{ + const be_node_attr_t *a_attr = get_irn_attr_const(a); + const be_node_attr_t *b_attr = get_irn_attr_const(b); + int i, len = ARR_LEN(a_attr->reg_data); -static const ir_op_ops be_node_op_ops; + if (len != ARR_LEN(b_attr->reg_data)) + return 1; -void be_node_init(void) { - static int inited = 0; - int i; + if (!be_nodes_equal(a, b)) + return 1; - if(inited) - return; + for (i = len - 1; i >= 0; --i) { + if (!reg_reqs_equal(a_attr->reg_data[i].in_req, + b_attr->reg_data[i].in_req)) + return 1; + } + + return 0; +} + +/** + * Compare the attributes of two be_FrameAddr nodes. + * + * @return zero if both nodes have identically attributes + */ +static int FrameAddr_cmp_attr(ir_node *a, ir_node *b) +{ + const be_frame_attr_t *a_attr = get_irn_attr_const(a); + const be_frame_attr_t *b_attr = get_irn_attr_const(b); + + if (a_attr->ent != b_attr->ent || a_attr->offset != b_attr->offset) + return 1; + + return node_cmp_attr(a, b); +} + +/** + * Compare the attributes of two be_Return nodes. + * + * @return zero if both nodes have identically attributes + */ +static int Return_cmp_attr(ir_node *a, ir_node *b) +{ + const be_return_attr_t *a_attr = get_irn_attr_const(a); + const be_return_attr_t *b_attr = get_irn_attr_const(b); + + 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; + + return node_cmp_attr(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(ir_node *a, ir_node *b) +{ + const be_incsp_attr_t *a_attr = get_irn_attr_const(a); + const be_incsp_attr_t *b_attr = get_irn_attr_const(b); - beo_base = get_next_ir_opcode(); + if (a_attr->offset != b_attr->offset) + return 1; - /* Acquire all needed opcodes. We assume that they are consecutive! */ - for(i = beo_Spill; i < beo_Last; ++i) - get_next_ir_opcode(); + return node_cmp_attr(a, b); +} + +/** + * Compare the attributes of two be_Call nodes. + * + * @return zero if both nodes have identically attributes + */ +static int Call_cmp_attr(ir_node *a, ir_node *b) +{ + const be_call_attr_t *a_attr = get_irn_attr_const(a); + const be_call_attr_t *b_attr = get_irn_attr_const(b); - op_Spill = new_ir_op(beo_base + beo_Spill, "Spill", op_pin_state_mem_pinned, 0, oparity_unary, 0, sizeof(be_spill_attr_t), &be_node_op_ops); - op_Reload = new_ir_op(beo_base + beo_Reload, "Reload", op_pin_state_mem_pinned, 0, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops); - op_Perm = new_ir_op(beo_base + beo_Perm, "Perm", op_pin_state_pinned, 0, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops); - op_Copy = new_ir_op(beo_base + beo_Copy, "Copy", op_pin_state_pinned, 0, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops); - op_Keep = new_ir_op(beo_base + beo_Keep, "Keep", op_pin_state_pinned, 0, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops); + if (a_attr->ent != b_attr->ent || + a_attr->call_tp != b_attr->call_tp) + return 1; - set_op_tag(op_Spill, &be_node_tag); - set_op_tag(op_Reload, &be_node_tag); - set_op_tag(op_Perm, &be_node_tag); - set_op_tag(op_Copy, &be_node_tag); - set_op_tag(op_Keep, &be_node_tag); + return node_cmp_attr(a, b); } -static void *init_node_attr(ir_node* irn, const arch_register_class_t *cls, ir_graph *irg, int n_outs) +static arch_register_req_t *allocate_reg_req(const ir_node *node) { - be_node_attr_t *a = get_irn_attr(irn); + ir_graph *irg = get_irn_irg(node); + struct obstack *obst = be_get_birg_obst(irg); - a->n_outs = n_outs; - a->cls = cls; - a->reg_data = NULL; + arch_register_req_t *req = obstack_alloc(obst, sizeof(*req)); + memset(req, 0, sizeof(*req)); + return req; +} - if(n_outs > 0) { +void be_set_constr_in(ir_node *node, int pos, const arch_register_req_t *req) +{ + const be_node_attr_t *attr = get_irn_attr_const(node); + be_reg_data_t *rd = &attr->reg_data[pos]; + assert(pos < ARR_LEN(attr->reg_data)); + rd->in_req = req; +} + +void be_set_constr_out(ir_node *node, int pos, const arch_register_req_t *req) +{ + backend_info_t *info = be_get_info(node); + info->out_infos[pos].req = req; +} + +/** + * Initializes the generic attribute of all be nodes and return it. + */ +static void *init_node_attr(ir_node *node, int n_inputs, int n_outputs) +{ + ir_graph *irg = get_irn_irg(node); + struct obstack *obst = be_get_birg_obst(irg); + be_node_attr_t *a = get_irn_attr(node); + backend_info_t *info = be_get_info(node); + + memset(a, 0, sizeof(get_op_attr_size(get_irn_op(node)))); + + if (n_inputs >= 0) { int i; + a->reg_data = NEW_ARR_D(be_reg_data_t, obst, n_inputs); + for (i = 0; i < n_inputs; ++i) { + a->reg_data[i].in_req = arch_no_register_req; + } + } else { + a->reg_data = NEW_ARR_F(be_reg_data_t, 0); + } - a->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(irg), n_outs); - memset(a->reg_data, 0, n_outs * sizeof(a->reg_data[0])); - for(i = 0; i < n_outs; ++i) { - a->reg_data[i].req.req.cls = cls; - a->reg_data[i].req.req.type = arch_register_req_type_normal; + 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); } return a; } -static INLINE int is_be_node(const ir_node *irn) +static void add_register_req_out(ir_node *node) { - return get_op_tag(get_irn_op(irn)) == &be_node_tag; + backend_info_t *info = be_get_info(node); + reg_out_info_t out_info; + memset(&out_info, 0, sizeof(out_info)); + out_info.req = arch_no_register_req; + ARR_APP1(reg_out_info_t, info->out_infos, out_info); } -be_opcode_t get_irn_be_opcode(const ir_node *irn) +static void add_register_req_in(ir_node *node) { - return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp; + be_node_attr_t *a = get_irn_attr(node); + be_reg_data_t regreq; + memset(®req, 0, sizeof(regreq)); + regreq.in_req = arch_no_register_req; + ARR_APP1(be_reg_data_t, a->reg_data, regreq); } -ir_node *be_new_Spill(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *to_spill, ir_node *ctx) +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_spill_attr_t *a; - ir_node *in[1]; - ir_node *res; + 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, 1); + a->ent = NULL; + a->offset = 0; + + be_node_set_reg_class_in(res, be_pos_Spill_frame, cls_frame); + be_node_set_reg_class_in(res, be_pos_Spill_val, cls); + /* + * For spills and reloads, we return "none" as requirement for frame + * pointer, so every input is ok. Some backends need this (STA). + * Matze: we should investigate if this is really needed, this solution + * looks very hacky to me + */ + be_set_constr_in(res, be_pos_Spill_frame, arch_no_register_req); + + arch_set_out_register_req(res, 0, arch_no_register_req); - in[0] = to_spill; - res = new_ir_node(NULL, irg, bl, op_Spill, mode_M, 1, in); - a = init_node_attr(res, cls, irg, 0); - a->ent = NULL; - a->spill_ctx = ctx; return res; } -ir_node *be_new_Reload(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *mem) +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[1]; - ir_node *res; + ir_node *in[2]; + ir_node *res; + ir_graph *irg = get_Block_irg(block); + + in[0] = frame; + in[1] = mem; + 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, be_pos_Reload_frame, cls_frame); + arch_irn_set_flags(res, arch_irn_flags_rematerializable); + + /* + * For spills and reloads, we return "none" as requirement for frame + * pointer, so every input is ok. Some backends need this (e.g. STA). + * Matze: we should investigate if this is really needed, this solution + * looks very hacky to me + */ + be_set_constr_in(res, be_pos_Reload_frame, arch_no_register_req); - in[0] = mem; - res = new_ir_node(NULL, irg, bl, op_Reload, mode, 1, in); - init_node_attr(res, cls, irg, 1); return res; } -ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[]) +ir_node *be_get_Reload_mem(const ir_node *irn) +{ + assert(be_is_Reload(irn)); + return get_irn_n(irn, be_pos_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); +} + +ir_node *be_get_Spill_val(const ir_node *irn) +{ + assert(be_is_Spill(irn)); + return get_irn_n(irn, be_pos_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); +} + +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); + + ir_node *irn = new_ir_node(NULL, irg, block, op_be_Perm, mode_T, n, in); + init_node_attr(irn, n, n); + for (i = 0; i < n; ++i) { + be_node_set_reg_class_in(irn, i, cls); + be_node_set_reg_class_out(irn, i, cls); + } + + return irn; +} + +void be_Perm_reduce(ir_node *perm, int new_size, int *map) +{ + int arity = get_irn_arity(perm); + be_reg_data_t *old_data = ALLOCAN(be_reg_data_t, arity); + reg_out_info_t *old_infos = ALLOCAN(reg_out_info_t, arity); + be_node_attr_t *attr = get_irn_attr(perm); + 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 = alloca(new_size * sizeof(*new_in)); + + /* save the old register data */ + memcpy(old_data, attr->reg_data, arity * sizeof(old_data[0])); + memcpy(old_infos, info->out_infos, arity * sizeof(old_infos[0])); + + /* compose the new in array and set the new register data directly in place */ + for (i = 0; i < new_size; ++i) { + int idx = map[i]; + new_in[i] = get_irn_n(perm, idx); + attr->reg_data[i] = old_data[idx]; + info->out_infos[i] = old_infos[idx]; + } + + set_irn_in(perm, new_size, new_in); +} + +ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_node *bl, int n, ir_node *in[]) { - ir_node *irn = new_ir_node(NULL, irg, bl, op_Perm, mode_T, n, in); - init_node_attr(irn, cls, irg, n); + ir_graph *irg = get_Block_irg(bl); + 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 = 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); + + init_node_attr(irn, n + 1, n); + be_node_set_reg_class_in(irn, 0, sp->reg_class); + + attr = get_irn_attr(irn); + attr->in_entities = OALLOCNZ(irg->obst, ir_entity*, n); + attr->out_entities = OALLOCNZ(irg->obst, 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(const arch_register_class_t *cls, ir_node *bl, ir_node *op) { ir_node *in[1]; ir_node *res; + arch_register_req_t *req; + ir_graph *irg = get_Block_irg(bl); in[0] = op; - res = new_ir_node(NULL, irg, bl, op_Copy, get_irn_mode(op), 1, in); - init_node_attr(res, cls, irg, 1); + res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in); + init_node_attr(res, 1, 1); + be_node_set_reg_class_in(res, 0, cls); + be_node_set_reg_class_out(res, 0, cls); + + req = allocate_reg_req(res); + req->cls = cls; + req->type = arch_register_req_type_should_be_same; + req->other_same = 1U << 0; + be_set_constr_out(res, 0, req); + return res; } -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_get_Copy_op(const ir_node *cpy) { - ir_node *irn; + return get_irn_n(cpy, be_pos_Copy_op); +} + +void be_set_Copy_op(ir_node *cpy, ir_node *op) +{ + set_irn_n(cpy, be_pos_Copy_op, op); +} + +ir_node *be_new_Keep(ir_node *block, int n, ir_node *in[]) +{ + int i; + ir_node *res; + ir_graph *irg = get_Block_irg(block); + + res = new_ir_node(NULL, irg, block, op_be_Keep, mode_ANY, -1, NULL); + init_node_attr(res, -1, 1); + + for (i = 0; i < n; ++i) { + add_irn_n(res, in[i]); + add_register_req_in(res); + } + 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_in(keep); + be_node_set_reg_class_in(keep, n, cls); +} - irn = new_ir_node(NULL, irg, bl, op_Keep, mode_ANY, n, in); - init_node_attr(irn, cls, irg, 0); - keep_alive(irn); +/* creates a be_Call */ +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) +{ + be_call_attr_t *a; + int real_n = be_pos_Call_first_arg + n; + ir_node *irn; + 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, real_n, n_outs); + a->ent = NULL; + a->call_tp = call_tp; + a->pop = 0; return irn; } -int be_is_Spill(const ir_node *irn) +/* Gets the call entity or NULL if this is no static call. */ +ir_entity *be_Call_get_entity(const ir_node *call) +{ + const be_call_attr_t *a = get_irn_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); + assert(be_is_Call(call)); + a->ent = ent; +} + +/* Gets the call type. */ +ir_type *be_Call_get_type(ir_node *call) +{ + const be_call_attr_t *a = get_irn_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); + assert(be_is_Call(call)); + a->call_tp = call_tp; +} + +void be_Call_set_pop(ir_node *call, unsigned pop) { - return get_irn_be_opcode(irn) == beo_Spill; + be_call_attr_t *a = get_irn_attr(call); + a->pop = pop; } -int be_is_Reload(const ir_node *irn) +unsigned be_Call_get_pop(const ir_node *call) { - return get_irn_be_opcode(irn) == beo_Reload; + const be_call_attr_t *a = get_irn_attr_const(call); + return a->pop; } -int be_is_Copy(const ir_node *irn) +/* Construct a new be_Return. */ +ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res, + unsigned pop, int n, ir_node *in[]) { - return get_irn_be_opcode(irn) == beo_Copy; + be_return_attr_t *a; + ir_node *res; + int i; + + res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL); + init_node_attr(res, -1, 1); + for (i = 0; i < n; ++i) { + add_irn_n(res, in[i]); + add_register_req_in(res); + } + be_set_constr_out(res, 0, arch_no_register_req); + + a = get_irn_attr(res); + a->num_ret_vals = n_res; + a->pop = pop; + a->emit_pop = 0; + + return res; } -int be_is_Perm(const ir_node *irn) +/* Returns the number of real returns values */ +int be_Return_get_n_rets(const ir_node *ret) { - return get_irn_be_opcode(irn) == beo_Perm; + const be_return_attr_t *a = get_irn_generic_attr_const(ret); + return a->num_ret_vals; } -int be_is_Keep(const ir_node *irn) +/* return the number of bytes that should be popped from stack when executing the Return. */ +unsigned be_Return_get_pop(const ir_node *ret) { - return get_irn_be_opcode(irn) == beo_Keep; + const be_return_attr_t *a = get_irn_generic_attr_const(ret); + return a->pop; } -static void be_limited(void *data, bitset_t *bs) +/* return non-zero, if number of popped bytes must be always emitted */ +int be_Return_get_emit_pop(const ir_node *ret) { - be_req_t *req = data; + const be_return_attr_t *a = get_irn_generic_attr_const(ret); + return a->emit_pop; +} - req->old_limited(req->old_limited_env, bs); - if(req->negate_limited) - bitset_flip_all(bs); +/* return non-zero, if number of popped bytes must be always emitted */ +void be_Return_set_emit_pop(ir_node *ret, int emit_pop) +{ + be_return_attr_t *a = get_irn_generic_attr(ret); + a->emit_pop = emit_pop; } -void be_set_Perm_out_req(ir_node *irn, int pos, const arch_register_req_t *req, unsigned negate_limited) +int be_Return_append_node(ir_node *ret, ir_node *node) { - be_node_attr_t *a = get_irn_attr(irn); - be_req_t *r = &a->reg_data[pos].req; + int pos; - assert(be_is_Perm(irn)); - assert(pos >= 0 && pos < get_irn_arity(irn)); - memcpy(&r->req, req, sizeof(req[0])); + pos = add_irn_n(ret, node); + add_register_req_in(ret); - if(arch_register_req_is(req, limited)) { - r->old_limited = r->req.limited; - r->old_limited_env = r->req.limited_env; - r->req.limited = be_limited; - r->req.limited_env = r; - r->negate_limited = negate_limited; + return pos; +} + +ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *bl, + ir_node *old_sp, int offset, int align) +{ + be_incsp_attr_t *a; + ir_node *irn; + ir_node *in[1]; + ir_graph *irg = get_Block_irg(bl); + + 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, 1); + a->offset = offset; + a->align = align; + + /* Set output constraint to stack register. */ + 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_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[be_pos_AddSP_last]; + const arch_register_class_t *cls; + ir_graph *irg; + + in[be_pos_AddSP_old_sp] = old_sp; + in[be_pos_AddSP_size] = sz; + + irg = get_Block_irg(bl); + 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, pn_be_AddSP_last); + + /* Set output constraint to stack register. */ + be_set_constr_single_reg_in(irn, be_pos_AddSP_old_sp, sp, 0); + be_node_set_reg_class_in(irn, be_pos_AddSP_size, arch_register_get_class(sp)); + be_set_constr_single_reg_out(irn, pn_be_AddSP_sp, sp, arch_register_req_type_produces_sp); + + cls = arch_register_get_class(sp); + + return irn; +} + +ir_node *be_new_SubSP(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[be_pos_SubSP_last]; + ir_graph *irg; + + in[be_pos_SubSP_old_sp] = old_sp; + in[be_pos_SubSP_size] = sz; + + irg = get_Block_irg(bl); + 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, pn_be_SubSP_last); + + /* Set output constraint to stack register. */ + be_set_constr_single_reg_in(irn, be_pos_SubSP_old_sp, sp, 0); + be_node_set_reg_class_in(irn, be_pos_SubSP_size, arch_register_get_class(sp)); + be_set_constr_single_reg_out(irn, pn_be_SubSP_sp, sp, arch_register_req_type_produces_sp); + + return irn; +} + +ir_node *be_new_Start(dbg_info *dbgi, ir_node *bl, int n_outs) +{ + ir_node *res; + int i; + ir_graph *irg = get_Block_irg(bl); + + res = new_ir_node(dbgi, irg, bl, op_be_Start, mode_T, 0, NULL); + init_node_attr(res, 0, -1); + for (i = 0; i < n_outs; ++i) { + add_register_req_out(res); } + + return res; } -void be_set_Spill_entity(ir_node *irn, entity *ent) +ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_node *bl, ir_node *frame, ir_entity *ent) { - be_spill_attr_t *a = get_irn_attr(irn); - assert(be_is_Spill(irn)); + 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, 1); a->ent = ent; + a->offset = 0; + be_node_set_reg_class_in(irn, 0, cls_frame); + be_node_set_reg_class_out(irn, 0, cls_frame); + + return optimize_node(irn); } -static ir_node *find_a_spill_walker(ir_node *irn, unsigned visited_nr) +ir_node *be_get_FrameAddr_frame(const ir_node *node) { - if(get_irn_visited(irn) < visited_nr) { - set_irn_visited(irn, visited_nr); + assert(be_is_FrameAddr(node)); + return get_irn_n(node, be_pos_FrameAddr_ptr); +} - if(is_Phi(irn)) { - int i, n; - for(i = 0, n = get_irn_arity(irn); i < n; ++i) { - ir_node *n = find_a_spill_walker(get_irn_n(irn, i), visited_nr); - if(n != NULL) - return n; - } - } +ir_entity *be_get_FrameAddr_entity(const ir_node *node) +{ + const be_frame_attr_t *attr = get_irn_generic_attr_const(node); + return attr->ent; +} - else if(get_irn_be_opcode(irn) == beo_Spill) - return irn; - } +ir_node *be_new_CopyKeep(const arch_register_class_t *cls, ir_node *bl, ir_node *src, int n, ir_node *in_keep[], ir_mode *mode) +{ + ir_node *irn; + ir_node **in = ALLOCAN(ir_node*, n + 1); + ir_graph *irg = get_Block_irg(bl); - return NULL; + 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, 1); + be_node_set_reg_class_in(irn, 0, cls); + be_node_set_reg_class_out(irn, 0, cls); + + return irn; } -ir_node *be_get_Spill_context(const ir_node *irn) { - const be_spill_attr_t *a = get_irn_attr(irn); - assert(be_is_Spill(irn)); - return a->spill_ctx; +ir_node *be_new_CopyKeep_single(const arch_register_class_t *cls, ir_node *bl, ir_node *src, ir_node *keep, ir_mode *mode) +{ + return be_new_CopyKeep(cls, bl, src, 1, &keep, mode); } -/** - * Finds a spill for a reload. - * If the reload is directly using the spill, this is simple, - * else we perform DFS from the reload (over all PhiMs) and return - * the first spill node we find. - */ -static INLINE ir_node *find_a_spill(ir_node *irn) +ir_node *be_get_CopyKeep_op(const ir_node *cpy) { - ir_graph *irg = get_irn_irg(irn); - unsigned visited_nr = get_irg_visited(irg) + 1; + return get_irn_n(cpy, be_pos_CopyKeep_op); +} - assert(be_is_Reload(irn)); - set_irg_visited(irg, visited_nr); - return find_a_spill_walker(irn, visited_nr); +void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) +{ + set_irn_n(cpy, be_pos_CopyKeep_op, op); } -entity *be_get_spill_entity(ir_node *irn) +ir_node *be_new_Barrier(ir_node *bl, int n, ir_node *in[]) { - int opc = get_irn_opcode(irn); + ir_node *res; + int i; + ir_graph *irg = get_Block_irg(bl); + + res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL); + init_node_attr(res, -1, -1); + for (i = 0; i < n; ++i) { + add_irn_n(res, in[i]); + add_register_req_in(res); + add_register_req_out(res); + } - switch(get_irn_be_opcode(irn)) { - case beo_Reload: - return be_get_spill_entity(find_a_spill(irn)); + return res; +} + +ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node) +{ + ir_mode *mode = get_irn_mode(node); + int n = add_irn_n(barrier, node); + + ir_node *proj = new_r_Proj(barrier, mode, n); + add_register_req_in(barrier); + add_register_req_out(barrier); + + return proj; +} + +int be_has_frame_entity(const ir_node *irn) +{ + switch (get_irn_opcode(irn)) { case beo_Spill: - { - be_spill_attr_t *a = get_irn_attr(irn); - return a->ent; - } + case beo_Reload: + case beo_FrameAddr: + return 1; default: - assert(0 && "Must give spill/reload node"); + return 0; } +} +ir_entity *be_get_frame_entity(const ir_node *irn) +{ + if (be_has_frame_entity(irn)) { + const be_frame_attr_t *a = get_irn_attr_const(irn); + return a->ent; + } return NULL; } -ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx) +int be_get_frame_offset(const ir_node *irn) { - const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1); + assert(is_be_node(irn)); + if (be_has_frame_entity(irn)) { + const be_frame_attr_t *a = get_irn_attr_const(irn); + return a->offset; + } + return 0; +} - ir_node *bl = get_nodes_block(irn); - ir_graph *irg = get_irn_irg(bl); - ir_node *spill = be_new_Spill(cls, irg, bl, irn, ctx); - ir_node *insert; +void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent) +{ + const be_memperm_attr_t *attr = get_irn_attr_const(irn); - /* - * search the right insertion point. a spill of a phi cannot be put - * directly after the phi, if there are some phis behind the one which - * is spilled. - */ - insert = sched_next(irn); - while(is_Phi(insert) && !sched_is_end(insert)) - insert = sched_next(insert); + assert(be_is_MemPerm(irn)); + assert(n < be_get_MemPerm_entity_arity(irn)); - sched_add_before(insert, spill); - return spill; + attr->in_entities[n] = ent; } -ir_node *be_reload(const arch_env_t *arch_env, - const arch_register_class_t *cls, - ir_node *irn, int pos, ir_mode *mode, ir_node *spill) +ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n) { - ir_node *reload; + const be_memperm_attr_t *attr = get_irn_attr_const(irn); - ir_node *bl = get_nodes_block(irn); - ir_graph *irg = get_irn_irg(bl); + assert(be_is_MemPerm(irn)); + assert(n < be_get_MemPerm_entity_arity(irn)); - assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M)); + return attr->in_entities[n]; +} - reload = be_new_Reload(cls, irg, bl, mode, spill); +void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent) +{ + const be_memperm_attr_t *attr = get_irn_attr_const(irn); - set_irn_n(irn, pos, reload); - sched_add_before(irn, reload); - return reload; + assert(be_is_MemPerm(irn)); + assert(n < be_get_MemPerm_entity_arity(irn)); + + attr->out_entities[n] = ent; } -static int redir_proj(const ir_node **node, int pos) +ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n) { - const ir_node *n = *node; + const be_memperm_attr_t *attr = get_irn_attr_const(irn); - if(is_Proj(n)) { - assert(pos == -1 && "Illegal pos for a Proj"); - *node = get_Proj_pred(n); - return get_Proj_proj(n); - } + assert(be_is_MemPerm(irn)); + assert(n < be_get_MemPerm_entity_arity(irn)); - return 0; + return attr->out_entities[n]; } -static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int out_pos) +int be_get_MemPerm_entity_arity(const ir_node *irn) { - const be_node_attr_t *a = get_irn_attr(irn); + return get_irn_arity(irn) - 1; +} +static const arch_register_req_t *get_single_req(struct obstack *obst, + const arch_register_t *reg, arch_register_req_type_t additional_types) +{ + arch_register_req_t *req = obstack_alloc(obst, sizeof(*req)); + const arch_register_class_t *cls = arch_register_get_class(reg); + unsigned *limited_bitset; - if(out_pos < a->n_outs) - memcpy(req, &a->reg_data[out_pos].req, sizeof(req[0])); - else { - req->type = arch_register_req_type_none; - req->cls = NULL; - } + limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls)); + rbitset_set(limited_bitset, arch_register_get_index(reg)); + req->type = arch_register_req_type_limited | additional_types; + req->cls = cls; + req->limited = limited_bitset; return req; } -static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos) +void be_set_constr_single_reg_in(ir_node *node, int pos, + const arch_register_t *reg, arch_register_req_type_t additional_types) +{ + const arch_register_req_t *req; + + if (additional_types == 0) { + req = reg->single_req; + } else { + ir_graph *irg = get_irn_irg(node); + struct obstack *obst = be_get_birg_obst(irg); + req = get_single_req(obst, reg, additional_types); + } + be_set_constr_in(node, pos, 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) { - const be_node_attr_t *a = get_irn_attr(irn); - int n = get_irn_arity(irn); + const arch_register_req_t *req; - req->type = arch_register_req_type_none; - req->cls = NULL; + /* if we have an ignore register, add ignore flag and just assign it */ + if (reg->type & arch_register_type_ignore) { + additional_types |= arch_register_req_type_ignore; + } - switch(get_irn_be_opcode(irn)) { - case beo_Spill: - case beo_Copy: - case beo_Keep: - case beo_Perm: - if(pos < n) { - req->type = arch_register_req_type_normal; - req->cls = a->cls; - } - break; - case beo_Reload: - default: - req = NULL; + if (additional_types == 0) { + req = reg->single_req; + } else { + ir_graph *irg = get_irn_irg(node); + struct obstack *obst = be_get_birg_obst(irg); + req = get_single_req(obst, reg, additional_types); } - return req; + arch_irn_set_register(node, pos, reg); + be_set_constr_out(node, pos, req); } -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) +void be_node_set_reg_class_in(ir_node *irn, int pos, + const arch_register_class_t *cls) { - int out_pos = pos; + be_set_constr_in(irn, pos, cls->class_req); +} - if(pos < 0) { - if(get_irn_mode(irn) == mode_T) - return NULL; +void be_node_set_reg_class_out(ir_node *irn, int pos, + const arch_register_class_t *cls) +{ + be_set_constr_out(irn, pos, cls->class_req); +} - out_pos = redir_proj((const ir_node **) &irn, pos); - assert(is_be_node(irn)); - return put_out_reg_req(req, irn, out_pos); - } +ir_node *be_get_IncSP_pred(ir_node *irn) +{ + assert(be_is_IncSP(irn)); + return get_irn_n(irn, 0); +} - else { - return is_be_node(irn) ? put_in_reg_req(req, irn, pos) : NULL; - } +void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) +{ + assert(be_is_IncSP(incsp)); + set_irn_n(incsp, 0, pred); +} - return req; +void be_set_IncSP_offset(ir_node *irn, int offset) +{ + be_incsp_attr_t *a = get_irn_attr(irn); + assert(be_is_IncSP(irn)); + a->offset = offset; } -static void -be_node_set_irn_reg(const void *_self, ir_node *irn, const arch_register_t *reg) +int be_get_IncSP_offset(const ir_node *irn) { - int out_pos; - be_node_attr_t *a; + const be_incsp_attr_t *a = get_irn_attr_const(irn); + assert(be_is_IncSP(irn)); + return a->offset; +} - out_pos = redir_proj((const ir_node **) &irn, -1); - a = get_irn_attr(irn); +int be_get_IncSP_align(const ir_node *irn) +{ + const be_incsp_attr_t *a = get_irn_attr_const(irn); + assert(be_is_IncSP(irn)); + return a->align; +} - assert(is_be_node(irn)); - assert(out_pos < a->n_outs && "position too high"); - a->reg_data[out_pos].reg = reg; +ir_node *be_spill(ir_node *block, ir_node *irn) +{ + ir_graph *irg = get_Block_irg(block); + ir_node *frame = get_irg_frame(irg); + const arch_register_class_t *cls = arch_get_irn_reg_class_out(irn); + const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame); + ir_node *spill; + + spill = be_new_Spill(cls, cls_frame, block, frame, irn); + return spill; } -const arch_register_t * -be_node_get_irn_reg(const void *_self, const ir_node *irn) +ir_node *be_reload(const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill) { - int out_pos; - be_node_attr_t *a; + ir_node *reload; + ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert); + ir_graph *irg = get_Block_irg(bl); + ir_node *frame = get_irg_frame(irg); + const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame); - out_pos = redir_proj((const ir_node **) &irn, -1); - a = get_irn_attr(irn); + assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M)); - assert(is_be_node(irn)); - assert(out_pos < a->n_outs && "position too high"); + reload = be_new_Reload(cls, cls_frame, bl, frame, spill, mode); - return a->reg_data[out_pos].reg; + if (is_Block(insert)) { + insert = sched_skip(insert, 0, sched_skip_cf_predicator, NULL); + sched_add_after(insert, reload); + } else { + sched_add_before(insert, reload); + } + + return reload; } -arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn) +/* + ____ ____ + | _ \ ___ __ _ | _ \ ___ __ _ ___ + | |_) / _ \/ _` | | |_) / _ \/ _` / __| + | _ < __/ (_| | | _ < __/ (_| \__ \ + |_| \_\___|\__, | |_| \_\___|\__, |___/ + |___/ |_| + +*/ + + +static const arch_register_req_t *be_node_get_in_reg_req( + const ir_node *irn, int pos) { - redir_proj((const ir_node **) &irn, -1); + const be_node_attr_t *a = get_irn_attr_const(irn); - switch(get_irn_be_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) -#undef XXX - default: - return 0; + assert(pos >= 0); + if (pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data)) + return arch_no_register_req; + + return a->reg_data[pos].in_req; +} + +static arch_irn_class_t be_node_classify(const ir_node *irn) +{ + switch (get_irn_opcode(irn)) { + case beo_Spill: return arch_irn_class_spill; + case beo_Reload: return arch_irn_class_reload; + case beo_Perm: return arch_irn_class_perm; + case beo_Copy: return arch_irn_class_copy; + default: return 0; } +} - return 0; +static ir_entity *be_node_get_frame_entity(const ir_node *irn) +{ + return be_get_frame_entity(irn); +} + +static void be_node_set_frame_entity(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; } -arch_irn_class_t be_node_get_flags(const void *_self, const ir_node *irn) +static void be_node_set_frame_offset(ir_node *irn, int offset) { + be_frame_attr_t *a; + + if (!be_has_frame_entity(irn)) + return; + + a = get_irn_attr(irn); + a->offset = offset; +} + +static int be_node_get_sp_bias(const ir_node *irn) +{ + 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 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, +/* + ___ ____ _ _ _ _ _ _ + |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __ + | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__| + | || _ <| |\ | | _ | (_| | | | | (_| | | __/ | + |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_| + +*/ + +/* for be nodes */ +static const arch_irn_ops_t be_node_irn_ops = { + be_node_get_in_reg_req, be_node_classify, - be_node_get_flags, + 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 +static const arch_register_req_t *dummy_reg_req( + const ir_node *node, int pos) +{ + (void) node; + (void) pos; + return arch_no_register_req; +} + +static arch_irn_class_t dummy_classify(const ir_node *node) +{ + (void) node; + return 0; +} + +static ir_entity* dummy_get_frame_entity(const ir_node *node) +{ + (void) node; + return NULL; +} + +static void dummy_set_frame_entity(ir_node *node, ir_entity *entity) +{ + (void) node; + (void) entity; + panic("dummy_set_frame_entity() should not be called"); +} + +static void dummy_set_frame_offset(ir_node *node, int bias) +{ + (void) node; + (void) bias; + panic("dummy_set_frame_offset() should not be called"); +} + +static int dummy_get_sp_bias(const ir_node *node) +{ + (void) node; + return 0; +} + +/* for "middleend" nodes */ +static const arch_irn_ops_t dummy_be_irn_ops = { + dummy_reg_req, + dummy_classify, + dummy_get_frame_entity, + dummy_set_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 */ }; -const void *be_node_get_arch_ops(const arch_irn_handler_t *self, const ir_node *irn) +/* + ____ _ _ ___ ____ _ _ _ _ _ _ + | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __ + | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__| + | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ | + |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_| + +*/ + +ir_node *be_new_Phi(ir_node *block, int n_ins, ir_node **ins, ir_mode *mode, + const arch_register_class_t *cls) +{ + struct obstack *obst = be_get_birg_obst(get_irn_irg(block)); + backend_info_t *info; + + ir_node *phi = new_r_Phi(block, n_ins, ins, mode); + 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])); + if (cls == NULL) { + info->out_infos[0].req = arch_no_register_req; + } else { + info->out_infos[0].req = cls->class_req; + } + + return phi; +} + +/** + * Guess correct register class of a phi node by looking at its arguments + */ +static const arch_register_req_t *get_Phi_reg_req_recursive(const ir_node *phi, + pset **visited) +{ + int n = get_irn_arity(phi); + ir_node *op; + int i; + + if (*visited && pset_find_ptr(*visited, phi)) + return NULL; + + for (i = 0; i < n; ++i) { + op = get_irn_n(phi, i); + /* Matze: don't we unnecessary constraint our phis with this? + * we only need to take the regclass IMO*/ + if (!is_Phi(op)) + return arch_get_register_req_out(op); + } + + /* + * 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) { + const arch_register_req_t *req; + op = get_irn_n(phi, i); + req = get_Phi_reg_req_recursive(op, visited); + if (req != NULL) + return req; + } + + return NULL; +} + +static const arch_register_req_t *phi_get_irn_reg_req(const ir_node *node, + int pos) +{ + backend_info_t *info = be_get_info(node); + const arch_register_req_t *req = info->out_infos[0].req; + (void) pos; + + if (req == NULL) { + if (!mode_is_datab(get_irn_mode(node))) { + req = arch_no_register_req; + } else { + pset *visited = NULL; + + req = get_Phi_reg_req_recursive(node, &visited); + assert(req->cls != NULL); + req = req->cls->class_req; + + if (visited != NULL) + del_pset(visited); + } + info->out_infos[0].req = req; + } + + return req; +} + +void be_set_phi_reg_req(ir_node *node, const arch_register_req_t *req) { - redir_proj((const ir_node **) &irn, -1); - return is_be_node(irn) ? &be_node_irn_ops : NULL; + backend_info_t *info = be_get_info(node); + info->out_infos[0].req = req; + + assert(mode_is_datab(get_irn_mode(node))); } -const arch_irn_handler_t be_node_irn_handler = { - be_node_get_arch_ops +int be_dump_phi_reg_reqs(ir_node *node, FILE *F, dump_reason_t reason) +{ + 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: + { + backend_info_t *info = be_get_info(node); + if (info != NULL && info->out_infos[0].req != NULL) { + arch_dump_reqs_and_registers(F, node); + } + break; + } + + default: + break; + } + + return 0; +} + +static const arch_irn_ops_t phi_irn_ops = { + phi_get_irn_reg_req, + dummy_classify, + dummy_get_frame_entity, + dummy_set_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 */ }; +/* + _ _ _ ____ _ + | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _ + | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` | + | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| | + |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, | + |_| |___/ +*/ + +/** + * ir_op-Operation: dump a be node to file + */ static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason) { be_node_attr_t *at = get_irn_attr(irn); - int i; 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_Perm(irn) || 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)) { + be_call_attr_t *a = (be_call_attr_t *) at; + if (a->ent) + fprintf(f, " [%s] ", get_entity_name(a->ent)); + } + if (be_is_IncSP(irn)) { + const be_incsp_attr_t *attr = get_irn_generic_attr_const(irn); + if (attr->offset == BE_STACK_FRAME_SIZE_EXPAND) { + fprintf(f, " [Setup Stackframe] "); + } else if (attr->offset == BE_STACK_FRAME_SIZE_SHRINK) { + fprintf(f, " [Destroy Stackframe] "); + } else { + fprintf(f, " [%d] ", attr->offset); + } + } break; case dump_node_info_txt: - fprintf(f, "reg class: %s\n", at->cls->name); - for(i = 0; i < at->n_outs; ++i) { - const arch_register_t *reg = at->reg_data[i].reg; - fprintf(f, "reg #%d: %s\n", i, reg ? reg->name : "n/a"); + arch_dump_reqs_and_registers(f, irn); + + if (be_has_frame_entity(irn)) { + be_frame_attr_t *a = (be_frame_attr_t *) at; + if (a->ent) { + 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); + } + } - if(get_irn_be_opcode(irn) == beo_Spill) { - be_spill_attr_t *a = (be_spill_attr_t *) at; - unsigned ofs = get_entity_offset_bytes(a->ent); - ir_fprintf(f, "spill context: %+F\n", a->spill_ctx); - ir_fprintf(f, "spill entity: %+F offset %x (%d)\n", a->ent, ofs, ofs); + switch (get_irn_opcode(irn)) { + case beo_IncSP: + { + be_incsp_attr_t *a = (be_incsp_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); + } + break; + case beo_Call: + { + be_call_attr_t *a = (be_call_attr_t *) at; + + 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)); + } + } + } + break; + + default: + break; } - 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) +{ + const be_node_attr_t *old_attr = get_irn_attr_const(old_node); + be_node_attr_t *new_attr = get_irn_attr(new_node); + ir_graph *irg = get_irn_irg(new_node); + struct obstack *obst = be_get_birg_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))); + + if (old_info->out_infos != NULL) { + unsigned n_outs = ARR_LEN(old_info->out_infos); + /* need dyanmic out infos? */ + if (be_is_Barrier(new_node) || 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; + } + + /* input infos */ + if (old_attr->reg_data != NULL) { + unsigned n_ins = ARR_LEN(old_attr->reg_data); + /* need dynamic in infos? */ + if (get_irn_op(old_node)->opar == oparity_dynamic) { + new_attr->reg_data = NEW_ARR_F(be_reg_data_t, n_ins); + } else { + new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, n_ins); + } + memcpy(new_attr->reg_data, old_attr->reg_data, + n_ins * sizeof(be_reg_data_t)); + } else { + new_attr->reg_data = NULL; + } +} + static const ir_op_ops be_node_op_ops = { + firm_default_hash, + NULL, + NULL, NULL, NULL, NULL, NULL, NULL, NULL, + copy_attr, NULL, NULL, NULL, NULL, NULL, dump_node, - NULL + NULL, + &be_node_irn_ops }; -pset *nodes_live_at(const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live) +int is_be_node(const ir_node *irn) { - firm_dbg_module_t *dbg = firm_dbg_register("firm.be.node"); - ir_node *bl = get_nodes_block(pos); - ir_node *irn; - irn_live_t *li; - - live_foreach(bl, li) { - ir_node *irn = (ir_node *) li->irn; - if(live_is_end(li) && arch_irn_consider_in_reg_alloc(arch_env, cls, irn)) - pset_insert_ptr(live, irn); - } - - sched_foreach_reverse(bl, irn) { - int i, n; - ir_node *x; - - /* - * If we encounter the node we want to insert the Perm after, - * exit immediately, so that this node is still live - */ - if(irn == pos) - return live; - - DBG((dbg, LEVEL_1, "%+F\n", irn)); - for(x = pset_first(live); x; x = pset_next(live)) - DBG((dbg, LEVEL_1, "\tlive: %+F\n", x)); - - if(arch_irn_has_reg_class(arch_env, irn, -1, cls)) - pset_remove_ptr(live, irn); - - for(i = 0, n = get_irn_arity(irn); i < n; ++i) { - ir_node *op = get_irn_n(irn, i); - - if(arch_irn_consider_in_reg_alloc(arch_env, cls, op)) - pset_insert_ptr(live, op); - } - } - - return NULL; + return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops; } -ir_node *insert_Perm_after(const arch_env_t *arch_env, - const arch_register_class_t *cls, - dom_front_info_t *dom_front, - ir_node *pos) +void be_init_op(void) { - ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos); - ir_graph *irg = get_irn_irg(bl); - pset *live = pset_new_ptr_default(); - firm_dbg_module_t *dbg = firm_dbg_register("be.node"); - - ir_node *curr, *irn, *perm, **nodes; - int i, n; - - DBG((dbg, LEVEL_1, "Insert Perm after: %+F\n", pos)); - - if(!nodes_live_at(arch_env, cls, pos, live)) - assert(0 && "position not found"); - - n = pset_count(live); - - if(n == 0) - return NULL; - - nodes = malloc(n * sizeof(nodes[0])); - - DBG((dbg, LEVEL_1, "live:\n")); - for(irn = pset_first(live), i = 0; irn; irn = pset_next(live), i++) { - DBG((dbg, LEVEL_1, "\t%+F\n", irn)); - nodes[i] = irn; + ir_opcode opc; + + /* Acquire all needed opcodes. */ + op_be_Spill = new_ir_op(beo_Spill, "be_Spill", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops); + op_be_Reload = new_ir_op(beo_Reload, "be_Reload", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_frame_attr_t), &be_node_op_ops); + op_be_Perm = new_ir_op(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_MemPerm, "be_MemPerm", op_pin_state_pinned, N, oparity_variable, 0, sizeof(be_memperm_attr_t), &be_node_op_ops); + op_be_Copy = new_ir_op(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_Keep, "be_Keep", op_pin_state_floats, K, oparity_dynamic, 0, sizeof(be_node_attr_t), &be_node_op_ops); + op_be_CopyKeep = new_ir_op(beo_CopyKeep, "be_CopyKeep", op_pin_state_floats, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops); + op_be_Call = new_ir_op(beo_Call, "be_Call", op_pin_state_pinned, F|M, oparity_variable, 0, sizeof(be_call_attr_t), &be_node_op_ops); + op_be_Return = new_ir_op(beo_Return, "be_Return", op_pin_state_pinned, X, oparity_dynamic, 0, sizeof(be_return_attr_t), &be_node_op_ops); + op_be_AddSP = new_ir_op(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_SubSP, "be_SubSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops); + op_be_IncSP = new_ir_op(beo_IncSP, "be_IncSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_incsp_attr_t), &be_node_op_ops); + op_be_Start = new_ir_op(beo_Start, "be_Start", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops); + op_be_FrameAddr = new_ir_op(beo_FrameAddr, "be_FrameAddr", op_pin_state_floats, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops); + op_be_Barrier = new_ir_op(beo_Barrier, "be_Barrier", op_pin_state_pinned, N, oparity_dynamic, 0, sizeof(be_node_attr_t), &be_node_op_ops); + + 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 = node_cmp_attr; + op_be_MemPerm->ops.node_cmp_attr = node_cmp_attr; + op_be_Copy->ops.node_cmp_attr = node_cmp_attr; + op_be_Keep->ops.node_cmp_attr = node_cmp_attr; + op_be_CopyKeep->ops.node_cmp_attr = node_cmp_attr; + 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 = node_cmp_attr; + op_be_SubSP->ops.node_cmp_attr = node_cmp_attr; + op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr; + op_be_Start->ops.node_cmp_attr = node_cmp_attr; + op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr; + op_be_Barrier->ops.node_cmp_attr = node_cmp_attr; + + /* attach out dummy_ops to middle end nodes */ + for (opc = iro_First; opc <= iro_Last; ++opc) { + ir_op *op = get_irp_opcode(opc); + assert(op->ops.be_ops == NULL); + op->ops.be_ops = &dummy_be_irn_ops; } - perm = be_new_Perm(cls, irg, bl, n, nodes); - sched_add_after(pos, perm); - free(nodes); - - curr = perm; - for(i = 0; i < n; ++i) { - ir_node *copies[1]; - ir_node *perm_op = get_irn_n(perm, i); - const arch_register_t *reg = arch_get_irn_register(arch_env, perm_op); - - ir_mode *mode = get_irn_mode(perm_op); - ir_node *proj = new_r_Proj(irg, bl, perm, mode, i); - arch_set_irn_register(arch_env, proj, reg); - - sched_add_after(curr, proj); - curr = proj; - - copies[0] = proj; - be_introduce_copies(dom_front, perm_op, 1, copies); - } - return perm; + op_Phi->ops.be_ops = &phi_irn_ops; }