*
* 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
#include "util.h"
#include "debug.h"
#include "fourcc.h"
+#include "offset.h"
#include "bitfiddle.h"
#include "irop_t.h"
#include "irnode_t.h"
#include "ircons_t.h"
#include "irprintf.h"
+#include "irgwalk.h"
#include "be_t.h"
#include "belive_t.h"
#include "beirgmod.h"
+#define OUT_POS(x) (-((x) + 1))
+
/* Sometimes we want to put const nodes into get_irn_generic_attr ... */
#define get_irn_attr(irn) get_irn_generic_attr((ir_node *) (irn))
static unsigned be_node_tag = FOURCC('B', 'E', 'N', 'O');
+#if 0
typedef enum _node_kind_t {
node_kind_spill,
node_kind_reload,
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;
+#endif
typedef enum {
be_req_kind_old_limited,
typedef struct {
int max_reg_data;
- const arch_register_class_t *cls;
be_reg_data_t *reg_data;
} be_node_attr_t;
int offset;
} be_frame_attr_t;
+typedef struct {
+ be_node_attr_t node_attr;
+ entity *ent;
+} be_call_attr_t;
+
typedef struct {
be_frame_attr_t frame_attr;
ir_node *spill_ctx; /**< The node in whose context this spill was introduced. */
} be_spill_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_Return;
-static ir_op *op_IncSP;
-static ir_op *op_AddSP;
-static ir_op *op_RegParams;
-static ir_op *op_StackParam;
-static ir_op *op_FrameAddr;
-static ir_op *op_FrameLoad;
-static ir_op *op_FrameStore;
+ir_op *op_be_Spill;
+ir_op *op_be_Reload;
+ir_op *op_be_Perm;
+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;
/* 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_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_Return = new_ir_op(beo_base + beo_Return, "Return", op_pin_state_pinned, X, 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_frame_attr_t), &be_node_op_ops);
- op_FrameAddr = new_ir_op(beo_base + beo_FrameAddr, "FrameAddr", op_pin_state_pinned, N, oparity_binary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
- op_FrameLoad = new_ir_op(beo_base + beo_FrameLoad, "FrameLoad", op_pin_state_pinned, N, oparity_any, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
- op_FrameStore = new_ir_op(beo_base + beo_FrameStore, "FrameStore", op_pin_state_pinned, N, oparity_any, 0, sizeof(be_frame_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_Call, &be_node_tag);
- set_op_tag(op_Return, &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);
- set_op_tag(op_FrameLoad, &be_node_tag);
- set_op_tag(op_FrameStore, &be_node_tag);
- set_op_tag(op_FrameAddr, &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, "Spill", op_pin_state_mem_pinned, N, oparity_unary, 0, sizeof(be_spill_attr_t), &be_node_op_ops);
+ op_be_Reload = new_ir_op(beo_base + beo_Reload, "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, "Perm", op_pin_state_pinned, N, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_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_be_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_be_CopyKeep = new_ir_op(beo_base + beo_CopyKeep, "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, "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, "Return", op_pin_state_pinned, X, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_AddSP = new_ir_op(beo_base + beo_AddSP, "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, "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, "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, "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, "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, "FrameAddr", op_pin_state_pinned, N, oparity_binary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
+ op_be_FrameLoad = new_ir_op(beo_base + beo_FrameLoad, "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, "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, "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_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);
+}
+
+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->cls = cls;
a->reg_data = NULL;
if(max_reg_data > 0) {
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;
}
}
const ir_node *n = *node;
if(is_Proj(n)) {
+ ir_node *irn;
+
assert(pos == -1 && "Illegal pos for a Proj");
- *node = get_Proj_pred(n);
+ *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);
}
}
-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, ir_node *ctx)
{
be_spill_attr_t *a;
- ir_node *in[1];
+ 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);
+ 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->frame_attr.ent = NULL;
a->frame_attr.offset = 0;
a->spill_ctx = ctx;
+
+ 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_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 *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_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 *irn;
ir_node **real_in;
- real_in = malloc(sizeof(real_in[0]) * (real_n));
+ real_in = xmalloc(sizeof(real_in[0]) * (real_n));
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(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));
+ irn = new_ir_node(NULL, irg, bl, op_be_Call, mode_T, real_n, real_in);
+ init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
return irn;
}
+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;
+}
+
+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;
+}
+
ir_node *be_new_Return(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
{
- ir_node *irn = new_ir_node(NULL, irg, bl, op_Return, mode_X, n, in);
- init_node_attr(irn, NULL, irg, n);
+ ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Return, mode_X, n, in);
+ init_node_attr(irn, n);
return irn;
}
in[0] = old_sp;
in[1] = mem;
- irn = new_ir_node(NULL, irg, bl, op_IncSP, sp->reg_class->mode, 2, in);
- a = init_node_attr(irn, sp->reg_class, irg, 1);
+ irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, 2, in);
+ a = init_node_attr(irn, 1);
a->dir = dir;
a->offset = offset;
be_node_set_flags(irn, -1, arch_irn_flags_ignore);
/* Set output constraint to stack register. */
+ be_node_set_reg_class(irn, 0, sp->reg_class);
be_set_constr_single_reg(irn, -1, 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[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);
+ in[be_pos_AddSP_old_sp] = old_sp;
+ in[be_pos_AddSP_size] = sz;
- be_node_set_flags(irn, -1, 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(0), arch_irn_flags_ignore);
/* Set output constraint to stack register. */
- be_set_constr_single_reg(irn, -1, sp);
+ be_set_constr_single_reg(irn, OUT_POS(0), sp);
+
+ return irn;
+}
+
+ir_node *be_new_SetSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *op, ir_node *mem)
+{
+ be_node_attr_t *a;
+ ir_node *irn;
+ 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);
+
+ /* 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);
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, entity *ent)
+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_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);
+ 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;
}
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;
}
in[0] = mem;
in[1] = frame;
- irn = new_ir_node(NULL, irg, bl, op_FrameLoad, mode_T, 2, in);
- a = init_node_attr(irn, NULL, irg, 3);
+ 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, -(pn_Load_res + 1), cls_data);
+ be_node_set_reg_class(irn, OUT_POS(pn_Load_res), cls_data);
return irn;
}
in[0] = mem;
in[1] = frame;
in[2] = data;
- irn = new_ir_node(NULL, irg, bl, op_FrameStore, mode_T, 3, in);
- a = init_node_attr(irn, NULL, irg, 3);
+ 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);
ir_node *in[1];
in[0] = frame;
- irn = new_ir_node(NULL, irg, bl, op_FrameAddr, get_irn_mode(frame), 1, in);
- a = init_node_attr(irn, NULL, irg, 1);
+ 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, -1, cls_frame);
+ be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
+ return 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_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_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:
be_frame_attr_t *a = get_irn_attr(irn);
return a->ent;
}
-
- else if(be_get_irn_opcode(irn) == beo_Reload)
- return be_get_spill_entity(irn);
-
return NULL;
}
{
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_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
+{
+ be_req_t *r = get_req(irn, pos);
+ r->req.type = type;
}
void be_set_IncSP_offset(ir_node *irn, unsigned offset)
a->offset = offset;
}
-unsigned be_get_IncSP_offset(ir_node *irn)
+unsigned be_get_IncSP_offset(const ir_node *irn)
{
be_stack_attr_t *a = get_irn_attr(irn);
assert(be_is_IncSP(irn));
a->dir = dir;
}
-be_stack_dir_t be_get_IncSP_direction(ir_node *irn)
+be_stack_dir_t be_get_IncSP_direction(const ir_node *irn)
{
be_stack_attr_t *a = get_irn_attr(irn);
assert(be_is_IncSP(irn));
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);
+ unsigned nr = get_irn_visited(irn);
- if(is_Phi(irn)) {
- int i, n;
+ set_irn_visited(irn, visited_nr);
+
+ if(is_Phi(irn)) {
+ int i, n;
+ if(nr < visited_nr) {
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(be_get_irn_opcode(irn) == beo_Spill)
- return irn;
}
+ else if(be_get_irn_opcode(irn) == beo_Spill)
+ return irn;
+
return NULL;
}
assert(be_is_Reload(irn));
set_irg_visited(irg, visited_nr);
- return find_a_spill_walker((ir_node *)irn, visited_nr);
+ return find_a_spill_walker(be_get_Reload_mem(irn), visited_nr);
}
entity *be_get_spill_entity(const ir_node *irn)
switch(be_get_irn_opcode(irn)) {
case beo_Reload:
- return be_get_spill_entity(find_a_spill(irn));
+ {
+ ir_node *spill = find_a_spill(irn);
+ return be_get_spill_entity(spill);
+ }
case beo_Spill:
{
be_spill_attr_t *a = get_irn_attr(irn);
}
default:
assert(0 && "Must give spill/reload node");
+ break;
}
return NULL;
}
+static void link_reload_walker(ir_node *irn, void *data)
+{
+ ir_node **root = (ir_node **) data;
+ if(be_is_Reload(irn)) {
+ set_irn_link(irn, *root);
+ *root = irn;
+ }
+}
+
+void be_copy_entities_to_reloads(ir_graph *irg)
+{
+ ir_node *irn = NULL;
+ irg_walk_graph(irg, link_reload_walker, NULL, (void *) &irn);
+
+ while(irn) {
+ be_frame_attr_t *a = get_irn_attr(irn);
+ entity *ent = be_get_spill_entity(irn);
+ a->ent = ent;
+ irn = get_irn_link(irn);
+ }
+}
+
ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx)
{
- 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 *insert = bl;
+ 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);
+
+ spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn, ctx);
/*
* 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.
+ * is spilled. Also, a spill of a Proj must be after all Projs of the
+ * same tuple node.
+ *
+ * Here's one special case:
+ * If the spill is in the start block, the spill must be after the frame
+ * pointer is set up. This is done by setting insert to the end of the block
+ * which is its default initialization (see above).
*/
+
insert = sched_next(irn);
- while(is_Phi(insert) && !sched_is_end(insert))
+ if(bl == get_irg_start_block(irg) && insert != bl && sched_get_time_step(frame) >= sched_get_time_step(insert))
+ insert = sched_next(frame);
+
+ while((is_Phi(insert) || is_Proj(insert)) && !sched_is_end(insert))
insert = sched_next(insert);
sched_add_before(insert, spill);
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 = get_irn_n(irn, be_pos_Copy_orig);
+ }
+ }
else {
req->type = arch_register_req_type_none;
req->cls = NULL;
return be_get_frame_entity(irn);
}
-static void be_node_set_stack_bias(const void *self, ir_node *irn, int bias)
+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 const arch_irn_ops_if_t be_node_irn_ops_if = {
be_node_get_irn_reg_req,
be_node_classify,
be_node_get_flags,
be_node_get_frame_entity,
- be_node_set_stack_bias
+ be_node_set_frame_offset
};
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 void dump_node_req(FILE *f, be_req_t *req)
+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 done = 0;
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_offset(const void *_self, ir_node *irn, int bias)
+{
+}
+
+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_offset
+};
+
+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();
+}
+
+
+/*
+ _ _ _ ____ _
+ | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
+ | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
+ | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
+ |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
+ |_| |___/
+*/
+
+static void dump_node_req(FILE *f, int idx, be_req_t *req)
+{
+ unsigned i;
int did_something = 0;
- const char *suffix = "";
+ char buf[16];
+ const char *prefix = buf;
+
+ snprintf(buf, sizeof(buf), "#%d ", idx);
if(req->flags != arch_irn_flags_none) {
- fprintf(f, "flags: ");
+ 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", suffix, arch_irn_flag_str(1 << i));
- suffix = "|";
+ fprintf(f, "%s%s", prefix, arch_irn_flag_str(1 << i));
+ prefix = "|";
}
}
- suffix = ", ";
+ prefix = ", ";
did_something = 1;
}
if(req->req.cls != 0) {
char tmp[256];
- fprintf(f, suffix);
+ fprintf(f, prefix);
arch_register_req_format(tmp, sizeof(tmp), &req->req);
fprintf(f, "%s", tmp);
did_something = 1;
fprintf(f, "in requirements\n");
for(i = 0; i < a->max_reg_data; ++i) {
- dump_node_req(f, &a->reg_data[i].in_req);
+ 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, &a->reg_data[i].req);
+ dump_node_req(f, i, &a->reg_data[i].req);
}
}
if(be_has_frame_entity(irn)) {
be_frame_attr_t *a = (be_frame_attr_t *) at;
- if (a->ent) {
- unsigned ofs = get_entity_offset_bytes(a->ent);
- ir_fprintf(f, "frame entity: %+F offset %x (%d)\n", a->ent, ofs, ofs);
- }
+ if (a->ent)
+ ir_fprintf(f, "frame entity: %+F offset %x (%d)\n", a->ent, a->offset, a->offset);
+
}
switch(be_get_irn_opcode(irn)) {
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_consider_in_reg_alloc(arch_env, cls, irn))
- 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[2];
- 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] = perm_op;
- copies[1] = proj;
- be_ssa_constr(dom_front, 2, copies);
- }
- return perm;
-}