X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbenode.c;h=00d5c44bbd1fba1fbd98c3aead2b2bf87f24b358;hb=39e27d1fe336c1238bfe4a7b614d103762e39ba2;hp=e61ef5b61ca1eb16e6f3c1d49e3ba5fb54342397;hpb=ac8c91272a0513b5d2325c8473710cdc2e8256a8;p=libfirm diff --git a/ir/be/benode.c b/ir/be/benode.c index e61ef5b61..00d5c44bb 100644 --- a/ir/be/benode.c +++ b/ir/be/benode.c @@ -5,7 +5,7 @@ * * Backend node support. * - * This file provdies Perm, Copy, Spill and Reload nodes. + * This file provides Perm, Copy, Spill and Reload nodes. * * Copyright (C) 2005 Universitaet Karlsruhe * Released under the GPL @@ -23,12 +23,16 @@ #include "util.h" #include "debug.h" #include "fourcc.h" +#include "offset.h" +#include "bitfiddle.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" @@ -37,28 +41,13 @@ #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 _node_kind_t { - node_kind_spill, - node_kind_reload, - node_kind_perm, - node_kind_copy, - node_kind_kill, - node_kind_last -} node_kind_t; - -typedef struct { - node_kind_t kind; - const arch_register_class_t *cls; - ir_op *op; - int n_pos; - int *pos; -} be_op_t; - typedef enum { be_req_kind_old_limited, be_req_kind_negate_old_limited, @@ -68,6 +57,7 @@ typedef enum { 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); @@ -84,36 +74,62 @@ typedef struct { be_req_t in_req; } be_reg_data_t; +/** The generic be nodes attribute type. */ typedef struct { - int max_reg_data; - arch_irn_flags_t flags; - const arch_register_class_t *cls; - be_reg_data_t *reg_data; + int max_reg_data; + be_reg_data_t *reg_data; } be_node_attr_t; +/** The be_Return nodes attribute type. */ 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; + int num_ret_vals; /**< number of return values */ +} be_return_attr_t; +/** The be_Stack attribute type. */ typedef struct { be_node_attr_t node_attr; - int offset; /**< The offset by which the stack shall be increased/decreased. */ - be_stack_dir_t dir; /**< The direction in which the stack shall be modified (along or in the other direction). */ + int offset; /**< The offset by which the stack shall be expanded/shrinked. */ } be_stack_attr_t; -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; -static ir_op *op_Call; -static ir_op *op_IncSP; -static ir_op *op_AddSP; -static ir_op *op_RegParams; -static ir_op *op_StackParam; -static ir_op *op_NoReg; +/** The be_Frame attribute type. */ +typedef struct { + be_node_attr_t node_attr; + entity *ent; + int offset; +} be_frame_attr_t; + +/** The be_Call attribute type. */ +typedef struct { + be_node_attr_t node_attr; + 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_call_attr_t; + +typedef struct { + be_node_attr_t node_attr; + entity **in_entities; + 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_SetSP; +ir_op *op_be_RegParams; +ir_op *op_be_StackParam; +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; @@ -129,6 +145,42 @@ static const ir_op_ops be_node_op_ops; #define H irop_flag_highlevel #define c irop_flag_constlike #define K irop_flag_keep +#define M irop_flag_machine + + +/** + * Compare two node attributes. + * + * @return zero if both attributes are identically + */ +static int cmp_node_attr(be_node_attr_t *a, be_node_attr_t *b) { + if (a->max_reg_data == b->max_reg_data) { + int i; + + 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; +} + +/** + * Compare the attributes of two FrameAddr nodes. + * + * @return zero if both attributes are identically + */ +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; +} void be_node_init(void) { static int inited = 0; @@ -141,38 +193,57 @@ void be_node_init(void) { /* Acquire all needed opcodes. */ beo_base = get_next_ir_opcodes(beo_Last - 1); - op_Spill = new_ir_op(beo_base + beo_Spill, "Spill", op_pin_state_mem_pinned, N, 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, N, 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, N, 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_floats, N, 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, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops); - op_NoReg = new_ir_op(beo_base + beo_NoReg, "NoReg", op_pin_state_floats, N, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops); - op_Call = new_ir_op(beo_base + beo_Call, "Call", op_pin_state_pinned, N, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops); - op_AddSP = new_ir_op(beo_base + beo_AddSP, "AddSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_stack_attr_t), &be_node_op_ops); - op_IncSP = new_ir_op(beo_base + beo_IncSP, "IncSP", op_pin_state_pinned, N, oparity_binary, 0, sizeof(be_stack_attr_t), &be_node_op_ops); - op_RegParams = new_ir_op(beo_base + beo_RegParams, "RegParams", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops); - op_StackParam = new_ir_op(beo_base + beo_StackParam, "StackParam", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_stack_attr_t), &be_node_op_ops); - - 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); - set_op_tag(op_NoReg, &be_node_tag); - set_op_tag(op_Call, &be_node_tag); - set_op_tag(op_AddSP, &be_node_tag); - set_op_tag(op_IncSP, &be_node_tag); - set_op_tag(op_RegParams, &be_node_tag); - set_op_tag(op_StackParam, &be_node_tag); -} - -static void *init_node_attr(ir_node* irn, const arch_register_class_t *cls, ir_graph *irg, int max_reg_data) + 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, N, 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_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_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); + + op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr; +} + +/** + * Initializes the generic attribute of all be nodes and return ir. + */ +static void *init_node_attr(ir_node* irn, int max_reg_data) { + ir_graph *irg = get_irn_irg(irn); be_node_attr_t *a = get_irn_attr(irn); + memset(a, 0, sizeof(get_op_attr_size(get_irn_op(irn)))); a->max_reg_data = max_reg_data; - a->flags = arch_irn_flags_none; - a->cls = cls; a->reg_data = NULL; if(max_reg_data > 0) { @@ -181,20 +252,20 @@ static void *init_node_attr(ir_node* irn, const arch_register_class_t *cls, ir_g 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 = cls; - a->reg_data[i].req.req.type = arch_register_req_type_normal; + a->reg_data[i].req.req.cls = NULL; + a->reg_data[i].req.req.type = arch_register_req_type_none; } } return a; } -static INLINE int is_be_node(const ir_node *irn) +int is_be_node(const ir_node *irn) { return get_op_tag(get_irn_op(irn)) == &be_node_tag; } -be_opcode_t get_irn_be_opcode(const ir_node *irn) +be_opcode_t be_get_irn_opcode(const ir_node *irn) { return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp; } @@ -204,164 +275,353 @@ static int redir_proj(const ir_node **node, int pos) const ir_node *n = *node; if(is_Proj(n)) { - assert(pos == -1 && "Illegal pos for a Proj"); - *node = get_Proj_pred(n); + ir_node *irn; + + *node = irn = get_Proj_pred(n); + if(is_Proj(irn)) { + assert(get_irn_mode(irn) == mode_T); + *node = get_Proj_pred(irn); + } return get_Proj_proj(n); } 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"); + } + } + + 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) { - int out_pos; - be_node_attr_t *a; + be_reg_data_t *r = retrieve_reg_data(irn); - out_pos = redir_proj((const ir_node **) &irn, -1); - a = get_irn_attr(irn); - - assert(is_be_node(irn)); - assert(out_pos < a->max_reg_data && "position too high"); - a->reg_data[out_pos].reg = reg; + if(r) + r->reg = reg; } -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_graph *irg, ir_node *bl, ir_node *frame, ir_node *to_spill) { - be_spill_attr_t *a; - ir_node *in[1]; + be_frame_attr_t *a; + ir_node *in[2]; ir_node *res; - 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; + 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); + a->ent = NULL; + a->offset = 0; + + be_node_set_reg_class(res, 0, cls_frame); + be_node_set_reg_class(res, 1, cls); 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_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode) { - ir_node *in[1]; + ir_node *in[2]; ir_node *res; - in[0] = mem; - res = new_ir_node(NULL, irg, bl, op_Reload, mode, 1, in); - init_node_attr(res, cls, irg, 1); + in[0] = frame; + in[1] = mem; + res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in); + init_node_attr(res, 2); + be_node_set_reg_class(res, 0, cls_frame); + be_node_set_reg_class(res, -1, cls); 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); +} + +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_graph *irg, 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); + 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); + } + + return irn; +} + +ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, 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; + + real_in = alloca((n+1) * sizeof(real_in[0])); + 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); + 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); + + 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])); + return irn; } + ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op) { ir_node *in[1]; ir_node *res; 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); + be_node_set_reg_class(res, 0, cls); + be_node_set_reg_class(res, OUT_POS(0), cls); return res; } +ir_node *be_get_Copy_op(const ir_node *cpy) { + 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(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[]) { + int i; ir_node *irn; - irn = new_ir_node(NULL, irg, bl, op_Keep, mode_ANY, n, in); - init_node_attr(irn, cls, irg, 0); + 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); + } keep_alive(irn); return irn; } -ir_node *be_new_Call(ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr, int n_outs, int n, ir_node *in[]) +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) { - int real_n = 3 + n; + be_call_attr_t *a; + int real_n = be_pos_Call_first_arg + n; ir_node *irn; ir_node **real_in; - real_in = malloc(sizeof(real_in[0]) * (real_n)); + 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])); - real_in[0] = mem; - real_in[1] = sp; - real_in[2] = ptr; - memcpy(&real_in[3], 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; + return irn; +} + +/* Gets the call entity or NULL if this is no static call. */ +entity *be_Call_get_entity(const ir_node *call) { + be_call_attr_t *a = get_irn_attr(call); + assert(be_is_Call(call)); + return a->ent; +} + +/* Sets the call entity. */ +void be_Call_set_entity(ir_node *call, 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) { + be_call_attr_t *a = get_irn_attr(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; +} + +/* 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[]) +{ + 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; - irn = new_ir_node(NULL, irg, bl, op_Call, mode_T, real_n, real_in); - init_node_attr(irn, NULL, irg, (n_outs > real_n ? n_outs : real_n)); return irn; } -ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, unsigned offset, be_stack_dir_t dir) +/* Returns the number of real returns values */ +int be_Return_get_n_rets(ir_node *ret) +{ + be_return_attr_t *a = get_irn_attr(ret); + return a->num_ret_vals; +} + +ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *mem, int offset) { be_stack_attr_t *a; ir_node *irn; - ir_node *in[1]; + ir_node *in[2]; in[0] = old_sp; - irn = new_ir_node(NULL, irg, bl, op_IncSP, sp->reg_class->mode, 1, in); - a = init_node_attr(irn, sp->reg_class, irg, 1); - a->dir = dir; + in[1] = mem; + irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, 2, in); + a = init_node_attr(irn, 1); a->offset = offset; - a->node_attr.flags |= arch_irn_flags_ignore; + be_node_set_flags(irn, -1, arch_irn_flags_ignore | arch_irn_flags_modify_sp); /* Set output constraint to stack register. */ - be_set_constr_single_reg(irn, -1, sp); + 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; } -ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *op) +ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz) { be_node_attr_t *a; ir_node *irn; - ir_node *in[2]; + ir_node *in[be_pos_AddSP_last]; + + in[be_pos_AddSP_old_sp] = old_sp; + in[be_pos_AddSP_size] = sz; - in[0] = old_sp; - in[1] = op; - irn = new_ir_node(NULL, irg, bl, op_AddSP, sp->reg_class->mode, 2, in); - a = init_node_attr(irn, sp->reg_class, irg, 1); - a->flags |= arch_irn_flags_ignore; + 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); + + be_node_set_flags(irn, OUT_POS(pn_be_AddSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp); /* Set output constraint to stack register. */ - be_set_constr_single_reg(irn, -1, sp); - be_node_set_irn_reg(NULL, irn, sp); + 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; return irn; } -ir_node *be_new_NoReg(const arch_register_t *reg, ir_graph *irg, ir_node *bl) +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) { be_node_attr_t *a; ir_node *irn; - ir_node *in[1]; + ir_node *in[3]; + + 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); + + be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore | arch_irn_flags_modify_sp); + + /* Set output constraint to stack register. */ + be_set_constr_single_reg(irn, OUT_POS(0), sp); + be_node_set_reg_class(irn, 1, sp->reg_class); + be_node_set_reg_class(irn, 2, sp->reg_class); + be_node_set_irn_reg(NULL, irn, sp); - irn = new_ir_node(NULL, irg, bl, op_NoReg, reg->reg_class->mode, 0, in); - a = init_node_attr(irn, reg->reg_class, irg, 1); - a->flags |= arch_irn_flags_ignore; - be_set_constr_single_reg(irn, -1, reg); - be_node_set_irn_reg(NULL, irn, reg); return irn; } -ir_node *be_new_StackParam(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *frame_pointer, unsigned offset) +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, entity *ent) { - be_stack_attr_t *a; + be_frame_attr_t *a; ir_node *irn; ir_node *in[1]; in[0] = frame_pointer; - irn = new_ir_node(NULL, irg, bl, op_StackParam, mode, 1, in); - a = init_node_attr(irn, cls, irg, 1); - a->offset = offset; + irn = new_ir_node(NULL, irg, bl, op_be_StackParam, mode, 1, in); + a = init_node_attr(irn, 1); + a->ent = ent; + + be_node_set_reg_class(irn, 0, cls_frame); + be_node_set_reg_class(irn, OUT_POS(0), cls); return irn; } @@ -370,22 +630,192 @@ ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs) ir_node *irn; ir_node *in[1]; - irn = new_ir_node(NULL, irg, bl, op_RegParams, mode_T, 0, in); - init_node_attr(irn, NULL, irg, n_outs); + 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, entity *ent) +{ + 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; } -int be_is_Spill (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Spill ; } -int be_is_Reload (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Reload ; } -int be_is_Copy (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Copy ; } -int be_is_Perm (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Perm ; } -int be_is_Keep (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Keep ; } -int be_is_Call (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_Call ; } -int be_is_IncSP (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_IncSP ; } -int be_is_AddSP (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_AddSP ; } -int be_is_RegParams (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_RegParams ; } -int be_is_StackParam (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_StackParam ; } -int be_is_NoReg (const ir_node *irn) { return get_irn_be_opcode(irn) == beo_NoReg ; } +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, entity *ent) +{ + be_frame_attr_t *a; + ir_node *irn; + ir_node *in[3]; + + 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; +} + +ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, entity *ent) +{ + be_frame_attr_t *a; + ir_node *irn; + ir_node *in[1]; + + 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); + + 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 *irn; + ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0])); + + 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); + + 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 *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); +} + +void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) { + set_irn_n(cpy, be_pos_CopyKeep_op, op); +} + +ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[]) +{ + ir_node *irn; + + irn = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, n, in); + init_node_attr(irn, n); + return irn; +} + +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: + case beo_Spill: + case beo_Reload: + case beo_FrameStore: + case beo_FrameLoad: + case beo_FrameAddr: + return 1; + default: + return 0; + } +} + +entity* be_get_frame_entity(const ir_node *irn) +{ + if(be_has_frame_entity(irn)) { + be_frame_attr_t *a = get_irn_attr(irn); + return a->ent; + } + return NULL; +} + +void be_set_MemPerm_in_entity(const ir_node *irn, int n, entity *ent) +{ + be_memperm_attr_t *attr = get_irn_attr(irn); + + assert(be_is_MemPerm(irn)); + assert(n < be_get_MemPerm_entity_arity(irn)); + + attr->in_entities[n] = ent; +} + +entity* be_get_MemPerm_in_entity(const ir_node* irn, int n) +{ + be_memperm_attr_t *attr = get_irn_attr(irn); + + assert(be_is_MemPerm(irn)); + assert(n < be_get_MemPerm_entity_arity(irn)); + + return attr->in_entities[n]; +} + +void be_set_MemPerm_out_entity(const ir_node *irn, int n, entity *ent) +{ + be_memperm_attr_t *attr = get_irn_attr(irn); + + assert(be_is_MemPerm(irn)); + assert(n < be_get_MemPerm_entity_arity(irn)); + + attr->out_entities[n] = ent; +} + +entity* be_get_MemPerm_out_entity(const ir_node* irn, int n) +{ + be_memperm_attr_t *attr = get_irn_attr(irn); + + assert(be_is_MemPerm(irn)); + assert(n < be_get_MemPerm_entity_arity(irn)); + + return attr->out_entities[n]; +} + +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) { @@ -405,9 +835,9 @@ static void be_limited(void *data, bitset_t *bs) } } -void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg) +static INLINE be_req_t *get_req(ir_node *irn, int pos) { - int idx = pos < 0 ? -(pos - 1) : pos; + 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; @@ -416,6 +846,13 @@ void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg) assert(!(pos >= 0) || pos < get_irn_arity(irn)); assert(!(pos < 0) || -(pos + 1) <= a->max_reg_data); + return r; +} + +void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg) +{ + be_req_t *r = get_req(irn, pos); + r->kind = be_req_kind_single_reg; r->x.single_reg = reg; r->req.limited = be_limited; @@ -426,14 +863,8 @@ void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg) void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req) { - 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; + be_req_t *r = get_req(irn, pos); - assert(is_be_node(irn)); - assert(!(pos >= 0) || pos < get_irn_arity(irn)); - assert(!(pos < 0) || -(pos + 1) <= a->max_reg_data); assert(arch_register_req_is(req, limited)); r->kind = be_req_kind_old_limited; @@ -446,149 +877,116 @@ void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req r->x.old_limited.old_limited_env = req->limited_env; } -void be_set_IncSP_offset(ir_node *irn, unsigned offset) +void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags) { - be_stack_attr_t *a = get_irn_attr(irn); - assert(be_is_IncSP(irn)); - a->offset = offset; + be_req_t *r = get_req(irn, pos); + r->flags = flags; } -unsigned be_get_IncSP_offset(ir_node *irn) +void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls) { - be_stack_attr_t *a = get_irn_attr(irn); - assert(be_is_IncSP(irn)); - return a->offset; + be_req_t *r = get_req(irn, pos); + r->req.cls = cls; + if(r->req.type == arch_register_req_type_none) + r->req.type = arch_register_req_type_normal; } -void be_set_IncSP_direction(ir_node *irn, be_stack_dir_t dir) +void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type) { - be_stack_attr_t *a = get_irn_attr(irn); - assert(be_is_IncSP(irn)); - a->dir = dir; + be_req_t *r = get_req(irn, pos); + r->req.type = type; } -be_stack_dir_t be_get_IncSP_direction(ir_node *irn) -{ - be_stack_attr_t *a = get_irn_attr(irn); +ir_node *be_get_IncSP_pred(ir_node *irn) { assert(be_is_IncSP(irn)); - return a->dir; + return get_irn_n(irn, 0); } -void be_set_Spill_entity(ir_node *irn, entity *ent) -{ - be_spill_attr_t *a = get_irn_attr(irn); - assert(be_is_Spill(irn)); - a->ent = ent; +void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) { + assert(be_is_IncSP(incsp)); + set_irn_n(incsp, 0, pred); } -static ir_node *find_a_spill_walker(ir_node *irn, unsigned visited_nr) -{ - if(get_irn_visited(irn) < visited_nr) { - set_irn_visited(irn, visited_nr); - - 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; - } - } - - else if(get_irn_be_opcode(irn) == beo_Spill) - return irn; - } - - return NULL; -} - -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_get_IncSP_mem(ir_node *irn) { + assert(be_is_IncSP(irn)); + return get_irn_n(irn, 1); } -/** - * 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) +void be_set_IncSP_offset(ir_node *irn, int offset) { - ir_graph *irg = get_irn_irg(irn); - unsigned visited_nr = get_irg_visited(irg) + 1; - - assert(be_is_Reload(irn)); - set_irg_visited(irg, visited_nr); - return find_a_spill_walker(irn, visited_nr); + be_stack_attr_t *a = get_irn_attr(irn); + assert(be_is_IncSP(irn)); + a->offset = offset; } -entity *be_get_spill_entity(ir_node *irn) +int be_get_IncSP_offset(const ir_node *irn) { - int opc = get_irn_opcode(irn); - - switch(get_irn_be_opcode(irn)) { - case beo_Reload: - return be_get_spill_entity(find_a_spill(irn)); - case beo_Spill: - { - be_spill_attr_t *a = get_irn_attr(irn); - return a->ent; - } - default: - assert(0 && "Must give spill/reload node"); - } - - return NULL; + be_stack_attr_t *a = get_irn_attr(irn); + assert(be_is_IncSP(irn)); + return a->offset; } -ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx) +ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn) { - const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1); + ir_node *bl = get_nodes_block(irn); + ir_graph *irg = get_irn_irg(bl); + ir_node *frame = get_irg_frame(irg); + ir_node *spill; - 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; + 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); - /* - * 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); - - sched_add_before(insert, spill); + spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn); return spill; } -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_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill) { ir_node *reload; - ir_node *bl = get_nodes_block(irn); - ir_graph *irg = get_irn_irg(bl); + 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, irg, bl, mode, spill); + 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); - set_irn_n(irn, pos, reload); - sched_add_before(irn, 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) + 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; @@ -600,9 +998,8 @@ static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int o static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos) { const be_node_attr_t *a = get_irn_attr(irn); - int n = get_irn_arity(irn); - if(pos < get_irn_arity(irn)) + 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; @@ -636,68 +1033,355 @@ be_node_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_nod const arch_register_t * be_node_get_irn_reg(const void *_self, const ir_node *irn) { - int out_pos; - be_node_attr_t *a; - - out_pos = redir_proj((const ir_node **) &irn, -1); - a = get_irn_attr(irn); - - assert(is_be_node(irn)); - assert(out_pos < a->max_reg_data && "position too high"); - - return a->reg_data[out_pos].reg; + be_reg_data_t *r = retrieve_reg_data(irn); + return r ? r->reg : NULL; } -arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn) +static arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn) { redir_proj((const ir_node **) &irn, -1); - 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) + 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 0; + return arch_irn_class_normal; } return 0; } -arch_irn_flags_t be_node_get_flags(const void *_self, const ir_node *irn) +static arch_irn_flags_t be_node_get_flags(const void *_self, const ir_node *irn) { - be_node_attr_t *a = get_irn_attr(irn); - return a->flags; + be_reg_data_t *r = retrieve_reg_data(irn); + return r ? r->req.flags : 0; +} + +static 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, 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) +{ + int result = 0; + + if(be_is_IncSP(irn)) { + result = be_get_IncSP_offset(irn); + } + + return result; +} + +/* + ___ ____ _ _ _ _ _ _ + |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __ + | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__| + | || _ <| |\ | | _ | (_| | | | | (_| | | __/ | + |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_| + +*/ + 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, + 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_arch_ops(const arch_irn_handler_t *self, const ir_node *irn) +const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn) { redir_proj((const ir_node **) &irn, -1); return is_be_node(irn) ? &be_node_irn_ops : NULL; } const arch_irn_handler_t be_node_irn_handler = { - be_node_get_arch_ops + 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) +{ + 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); + if(!is_Phi(op)) + return arch_get_register_req(h->arch_env, req, op, BE_OUT_POS(0)); + } + + /* + 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; +} + +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) +{ + 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); + + 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; +} + +static entity *phi_get_frame_entity(const void *_self, const ir_node *irn) +{ + return NULL; +} + +static void phi_set_frame_entity(const void *_self, ir_node *irn, entity *ent) +{ +} + +static void phi_set_frame_offset(const void *_self, ir_node *irn, int bias) +{ +} + +static int phi_get_sp_bias(const void* self, const ir_node *irn) +{ + 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 */ +}; + +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) +{ + phi_handler_t *h = (void *) handler; + pmap_destroy(h->regs); + free(handler); +} + +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; +} + +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(); +} + +/* + _ _ _ ____ _ + | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _ + | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` | + | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| | + |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, | + |_| |___/ +*/ + +/** + * 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; + } + + 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; + } + + if(did_something) + fprintf(f, "\n"); +} + +/** + * Dumps node register requirements to a file. + */ +static void dump_node_reqs(FILE *f, ir_node *irn) +{ + 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); + } + + 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); + } + + fprintf(f, "\nout requirements\n"); + for(i = 0; i < a->max_reg_data; ++i) { + dump_node_req(f, i, &a->reg_data[i].req); + } +} + +/** + * 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)); @@ -711,46 +1395,72 @@ static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason) case dump_node_nodeattr_txt: break; case dump_node_info_txt: - fprintf(f, "reg class: %s\n", at->cls ? at->cls->name : "n/a"); - for(i = 0; i < at->max_reg_data; ++i) { - const arch_register_t *reg = at->reg_data[i].reg; - fprintf(f, "reg #%d: %s\n", i, reg ? reg->name : "n/a"); + dump_node_reqs(f, irn); + + if(be_has_frame_entity(irn)) { + be_frame_attr_t *a = (be_frame_attr_t *) at; + 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); + } + } - switch(get_irn_be_opcode(irn)) { - case beo_Spill: + switch(be_get_irn_opcode(irn)) { + case beo_IncSP: { - be_spill_attr_t *a = (be_spill_attr_t *) at; - - ir_fprintf(f, "spill context: %+F\n", a->spill_ctx); - if (a->ent) { - unsigned ofs = get_entity_offset_bytes(a->ent); - ir_fprintf(f, "spill entity: %+F offset %x (%d)\n", a->ent, ofs, ofs); - } - else { - ir_fprintf(f, "spill entity: n/a\n"); - } + 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); } break; + case beo_Call: + { + be_call_attr_t *a = (be_call_attr_t *) at; - case beo_IncSP: + if (a->ent) + fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent)); + } + break; + case beo_MemPerm: { - be_stack_attr_t *a = (be_stack_attr_t *) at; - fprintf(f, "offset: %u\n", a->offset); - fprintf(f, "direction: %s\n", a->dir == be_stack_dir_along ? "along" : "against"); + int i; + for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) { + 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; } -void copy_attr(const ir_node *old_node, ir_node *new_node) +/** + * 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) { be_node_attr_t *old_attr = get_irn_attr(old_node); be_node_attr_t *new_attr = get_irn_attr(new_node); + int i; assert(is_be_node(old_node)); assert(is_be_node(new_node)); @@ -761,6 +1471,16 @@ void copy_attr(const ir_node *old_node, ir_node *new_node) 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)); + + for(i = 0; i < old_attr->max_reg_data; ++i) { + be_req_t *r; + + r = &new_attr->reg_data[i].req; + r->req.limited_env = r; + + r = &new_attr->reg_data[i].in_req; + r->req.limited_env = r; + } } } @@ -779,98 +1499,3 @@ static const ir_op_ops be_node_op_ops = { dump_node, NULL }; - -pset *nodes_live_at(const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live) -{ - firm_dbg_module_t *dbg = firm_dbg_register("firm.be.node"); - const ir_node *bl = is_Block(pos) ? pos : 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 live; -} - -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) -{ - 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)); - - 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; - } - - 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_ssa_constr_single(dom_front, perm_op, 1, copies); - } - return perm; -}