*
* This file provides Perm, Copy, Spill and Reload nodes.
*
- * Copyright (C) 2005 Universitaet Karlsruhe
+ * Copyright (C) 2005-2006 Universitaet Karlsruhe
* Released under the GPL
*/
#include "ircons_t.h"
#include "irprintf.h"
#include "irgwalk.h"
+#include "iropt_t.h"
#include "be_t.h"
#include "belive_t.h"
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_perm,
- node_kind_copy,
- node_kind_kill,
- node_kind_last
-} node_kind_t;
-#endif
-
typedef enum {
be_req_kind_old_limited,
be_req_kind_negate_old_limited,
be_req_t in_req;
} be_reg_data_t;
+/** The generic be nodes attribute type. */
typedef struct {
- int max_reg_data;
- be_reg_data_t *reg_data;
+ 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;
+ 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;
+/** The be_Frame attribute type. */
typedef struct {
be_node_attr_t node_attr;
- entity *ent;
+ ir_entity *ent;
int offset;
} be_frame_attr_t;
+/** The be_Call attribute type. */
typedef struct {
be_node_attr_t node_attr;
- entity *ent;
+ ir_entity *ent; /**< The called entity if this is a static call. */
+ ir_type *call_tp; /**< The call type, copied from the original Call node. */
} be_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;
+ be_node_attr_t node_attr;
+ 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_Return;
ir_op *op_be_IncSP;
ir_op *op_be_AddSP;
+ir_op *op_be_SubSP;
ir_op *op_be_SetSP;
ir_op *op_be_RegParams;
ir_op *op_be_StackParam;
#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;
/* Acquire all needed opcodes. */
beo_base = get_next_ir_opcodes(beo_Last - 1);
- 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);
+ op_be_Spill = new_ir_op(beo_base + beo_Spill, "be_Spill", op_pin_state_mem_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
+ op_be_Reload = new_ir_op(beo_base + beo_Reload, "be_Reload", op_pin_state_mem_pinned, N, oparity_zero, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
+ op_be_Perm = new_ir_op(beo_base + beo_Perm, "be_Perm", op_pin_state_pinned, N, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_MemPerm = new_ir_op(beo_base + beo_MemPerm, "be_MemPerm", op_pin_state_mem_pinned, N, oparity_variable, 0, sizeof(be_memperm_attr_t), &be_node_op_ops);
+ op_be_Copy = new_ir_op(beo_base + beo_Copy, "be_Copy", op_pin_state_floats, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_Keep = new_ir_op(beo_base + beo_Keep, "be_Keep", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_CopyKeep = new_ir_op(beo_base + beo_CopyKeep, "be_CopyKeep", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_Call = new_ir_op(beo_base + beo_Call, "be_Call", op_pin_state_pinned, F, oparity_variable, 0, sizeof(be_call_attr_t), &be_node_op_ops);
+ op_be_Return = new_ir_op(beo_base + beo_Return, "be_Return", op_pin_state_pinned, X, oparity_variable, 0, sizeof(be_return_attr_t), &be_node_op_ops);
+ op_be_AddSP = new_ir_op(beo_base + beo_AddSP, "be_AddSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_SubSP = new_ir_op(beo_base + beo_SubSP, "be_SubSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_SetSP = new_ir_op(beo_base + beo_SetSP, "be_SetSP", op_pin_state_pinned, N, oparity_binary, 0, sizeof(be_stack_attr_t), &be_node_op_ops);
+ op_be_IncSP = new_ir_op(beo_base + beo_IncSP, "be_IncSP", op_pin_state_pinned, N, oparity_binary, 0, sizeof(be_stack_attr_t), &be_node_op_ops);
+ op_be_RegParams = new_ir_op(beo_base + beo_RegParams, "be_RegParams", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops);
+ op_be_StackParam = new_ir_op(beo_base + beo_StackParam, "be_StackParam", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
+ op_be_FrameAddr = new_ir_op(beo_base + beo_FrameAddr, "be_FrameAddr", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
+ op_be_FrameLoad = new_ir_op(beo_base + beo_FrameLoad, "be_FrameLoad", op_pin_state_pinned, N, oparity_any, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
+ op_be_FrameStore = new_ir_op(beo_base + beo_FrameStore, "be_FrameStore", op_pin_state_pinned, N, oparity_any, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
+ op_be_Barrier = new_ir_op(beo_base + beo_Barrier, "be_Barrier", op_pin_state_pinned, N, oparity_any, 0, sizeof(be_node_attr_t), &be_node_op_ops);
set_op_tag(op_be_Spill, &be_node_tag);
set_op_tag(op_be_Reload, &be_node_tag);
set_op_tag(op_be_Perm, &be_node_tag);
+ set_op_tag(op_be_MemPerm, &be_node_tag);
set_op_tag(op_be_Copy, &be_node_tag);
set_op_tag(op_be_Keep, &be_node_tag);
set_op_tag(op_be_CopyKeep, &be_node_tag);
set_op_tag(op_be_Call, &be_node_tag);
set_op_tag(op_be_Return, &be_node_tag);
set_op_tag(op_be_AddSP, &be_node_tag);
+ set_op_tag(op_be_SubSP, &be_node_tag);
set_op_tag(op_be_SetSP, &be_node_tag);
set_op_tag(op_be_IncSP, &be_node_tag);
set_op_tag(op_be_RegParams, &be_node_tag);
set_op_tag(op_be_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);
+ 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);
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;
}
if(is_Proj(n)) {
ir_node *irn;
- assert(pos == -1 && "Illegal pos for a Proj");
*node = irn = get_Proj_pred(n);
if(is_Proj(irn)) {
assert(get_irn_mode(irn) == mode_T);
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;
-
- out_pos = redir_proj((const ir_node **) &irn, -1);
- a = get_irn_attr(irn);
+ be_reg_data_t *r = retrieve_reg_data(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, const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, 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[2];
- ir_node *res;
+ be_frame_attr_t *a;
+ ir_node *in[2];
+ ir_node *res;
+
+ 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;
- 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);
+ be_node_set_reg_class(res, be_pos_Spill_frame, cls_frame);
+ be_node_set_reg_class(res, be_pos_Spill_val, cls);
return res;
}
-ir_node *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode)
+ir_node *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
+ ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode)
{
ir_node *in[2];
ir_node *res;
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);
+ be_node_set_reg_class(res, be_pos_Reload_frame, cls_frame);
+ be_node_set_flags(res, -1, arch_irn_flags_rematerializable);
return res;
}
-ir_node *(be_get_Reload_mem)(const ir_node *irn)
+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[])
{
int i;
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];
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;
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 = xmalloc(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(NULL, irg, bl, op_be_Call, mode_T, real_n, real_in);
- init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
+ 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;
}
-entity *be_Call_get_entity(const ir_node *call)
-{
+/* Gets the call entity or NULL if this is no static call. */
+ir_entity *be_Call_get_entity(const ir_node *call) {
be_call_attr_t *a = get_irn_attr(call);
assert(be_is_Call(call));
return a->ent;
}
-void be_Call_set_entity(ir_node *call, entity *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;
}
-ir_node *be_new_Return(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
+/* 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[])
{
- ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Return, mode_X, n, 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;
return irn;
}
-ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *mem, 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, int offset)
{
be_stack_attr_t *a;
ir_node *irn;
ir_node *in[1];
in[0] = old_sp;
- in[1] = mem;
- irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, 2, in);
+ irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, sizeof(in) / sizeof(in[0]), in);
a = init_node_attr(irn, 1);
- a->dir = dir;
a->offset = offset;
- be_node_set_flags(irn, -1, 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_node_set_reg_class(irn, 0, sp->reg_class);
- be_set_constr_single_reg(irn, -1, sp);
+ be_set_constr_single_reg(irn, BE_OUT_POS(0), sp);
be_node_set_irn_reg(NULL, irn, sp);
return irn;
in[be_pos_AddSP_old_sp] = old_sp;
in[be_pos_AddSP_size] = sz;
- irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
- a = init_node_attr(irn, be_pos_AddSP_last);
+ 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);
+ 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, OUT_POS(0), 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_SubSP(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[be_pos_SubSP_last];
+
+ in[be_pos_SubSP_old_sp] = old_sp;
+ in[be_pos_SubSP_size] = sz;
+
+ irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
+ a = init_node_attr(irn, be_pos_SubSP_last);
+
+ be_node_set_flags(irn, OUT_POS(pn_be_SubSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
+
+ /* Set output constraint to stack register. */
+ be_set_constr_single_reg(irn, be_pos_SubSP_old_sp, sp);
+ be_node_set_reg_class(irn, be_pos_SubSP_size, arch_register_get_class(sp));
+ be_set_constr_single_reg(irn, OUT_POS(pn_be_SubSP_res), sp);
+ a->reg_data[pn_be_SubSP_res].reg = sp;
return irn;
}
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);
+ 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);
+ be_node_set_reg_class(irn, be_pos_AddSP_size, sp->reg_class);
+ be_node_set_reg_class(irn, be_pos_AddSP_old_sp, sp->reg_class);
return irn;
}
-ir_node *be_new_StackParam(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *frame_pointer, 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, ir_entity *ent)
{
be_frame_attr_t *a;
ir_node *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)
+ ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_entity *ent)
{
be_frame_attr_t *a;
ir_node *irn;
}
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)
+ ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, ir_entity *ent)
{
be_frame_attr_t *a;
ir_node *irn;
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)
+ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent)
{
be_frame_attr_t *a;
ir_node *irn;
a->offset = 0;
be_node_set_reg_class(irn, 0, cls_frame);
be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
- return irn;
+
+ 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)
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;
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 ; }
case beo_FrameLoad:
case beo_FrameAddr:
return 1;
+ default:
+ return 0;
}
-
- return 0;
}
-entity *be_get_frame_entity(const ir_node *irn)
+ir_entity *be_get_frame_entity(const ir_node *irn)
{
- if(be_has_frame_entity(irn)) {
+ if (be_has_frame_entity(irn)) {
be_frame_attr_t *a = get_irn_attr(irn);
return a->ent;
}
return NULL;
}
+int be_get_frame_offset(const ir_node *irn)
+{
+ assert(is_be_node(irn));
+ if (be_has_frame_entity(irn)) {
+ be_frame_attr_t *a = get_irn_attr(irn);
+ return a->offset;
+ }
+ return 0;
+}
+
+void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_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;
+}
+
+ir_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, ir_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;
+}
+
+ir_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)
{
be_req_t *req = data;
void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
{
be_req_t *r = get_req(irn, pos);
+
r->req.cls = cls;
- if(r->req.type == arch_register_req_type_none)
+
+ if (cls == NULL)
+ r->req.type = arch_register_req_type_none;
+ else if (r->req.type == arch_register_req_type_none)
r->req.type = arch_register_req_type_normal;
}
r->req.type = type;
}
-void be_set_IncSP_offset(ir_node *irn, unsigned offset)
-{
- be_stack_attr_t *a = get_irn_attr(irn);
+ir_node *be_get_IncSP_pred(ir_node *irn) {
assert(be_is_IncSP(irn));
- a->offset = offset;
+ return get_irn_n(irn, 0);
}
-unsigned be_get_IncSP_offset(const ir_node *irn)
-{
- be_stack_attr_t *a = get_irn_attr(irn);
- assert(be_is_IncSP(irn));
- return a->offset;
+void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
+ assert(be_is_IncSP(incsp));
+ set_irn_n(incsp, 0, pred);
}
-void be_set_IncSP_direction(ir_node *irn, be_stack_dir_t dir)
-{
- be_stack_attr_t *a = get_irn_attr(irn);
+ir_node *be_get_IncSP_mem(ir_node *irn) {
assert(be_is_IncSP(irn));
- a->dir = dir;
+ return get_irn_n(irn, 1);
}
-be_stack_dir_t be_get_IncSP_direction(const ir_node *irn)
+void be_set_IncSP_offset(ir_node *irn, int offset)
{
be_stack_attr_t *a = get_irn_attr(irn);
assert(be_is_IncSP(irn));
- return a->dir;
-}
-
-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->frame_attr.ent = ent;
-}
-
-static ir_node *find_a_spill_walker(ir_node *irn, unsigned visited_nr)
-{
- unsigned nr = get_irn_visited(irn);
-
- 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;
-
- 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;
-}
-
-/**
- * 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(const ir_node *irn)
-{
- 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(be_get_Reload_mem(irn), visited_nr);
-}
-
-entity *be_get_spill_entity(const ir_node *irn)
-{
- int opc = get_irn_opcode(irn);
-
- switch(be_get_irn_opcode(irn)) {
- case beo_Reload:
- {
- 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);
- return a->frame_attr.ent;
- }
- 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;
- }
+ a->offset = offset;
}
-void be_copy_entities_to_reloads(ir_graph *irg)
+int be_get_IncSP_offset(const ir_node *irn)
{
- 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);
- }
+ 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)
{
- 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 *frame = get_irg_frame(irg);
const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
+ ir_node *spill;
- spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn, 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. 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);
- 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);
+ 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 *insert, ir_mode *mode, ir_node *spill)
{
- ir_node *reload;
-
- ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
- ir_graph *irg = get_irn_irg(bl);
- ir_node *frame = get_irg_frame(irg);
+ ir_node *reload;
+ ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
+ ir_graph *irg = get_irn_irg(bl);
+ ir_node *frame = get_irg_frame(irg);
const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
- if(is_Block(insert)) {
+ if (is_Block(insert)) {
insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
sched_add_after(insert, reload);
}
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);
+ req->other_same = be_get_Copy_op(irn);
}
}
else {
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) && pos < a->max_reg_data)
memcpy(req, &a->reg_data[pos].in_req, sizeof(req[0]));
{
int out_pos = pos;
- if(pos < 0) {
- if(get_irn_mode(irn) == mode_T)
+ if (pos < 0) {
+ if (get_irn_mode(irn) == mode_T)
return NULL;
- out_pos = redir_proj((const ir_node **) &irn, pos);
+ out_pos = redir_proj((const ir_node **)&irn, pos);
assert(is_be_node(irn));
return put_out_reg_req(req, irn, out_pos);
}
else {
- return is_be_node(irn) ? put_in_reg_req(req, irn, pos) : NULL;
+ if (is_be_node(irn)) {
+ /*
+ For spills and reloads, we return "none" as requirement for frame pointer,
+ so every input is ok. Some backends need this (e.g. STA). We use an arbitrary
+ large number as pos, so put_in_reg_req will return "none" as requirement.
+ */
+ if ((be_is_Spill(irn) && pos == be_pos_Spill_frame) ||
+ (be_is_Reload(irn) && pos == be_pos_Reload_frame))
+ return put_in_reg_req(req, irn, INT_MAX);
+ else
+ return put_in_reg_req(req, irn, pos);
+ }
+ return NULL;
}
return req;
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;
}
static arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn)
redir_proj((const ir_node **) &irn, -1);
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)
+#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;
static arch_irn_flags_t be_node_get_flags(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].req.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)
+static ir_entity *be_node_get_frame_entity(const void *self, const ir_node *irn)
{
return be_get_frame_entity(irn);
}
+static void be_node_set_frame_entity(const void *self, ir_node *irn, ir_entity *ent)
+{
+ be_frame_attr_t *a;
+
+ assert(be_has_frame_entity(irn));
+
+ a = get_irn_attr(irn);
+ a->ent = ent;
+}
+
static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset)
{
if(be_has_frame_entity(irn)) {
}
}
+static int be_node_get_sp_bias(const void *self, const ir_node *irn)
+{
+ return be_is_IncSP(irn) ? be_get_IncSP_offset(irn) : 0;
+}
+
/*
___ ____ _ _ _ _ _ _
|_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
be_node_classify,
be_node_get_flags,
be_node_get_frame_entity,
- be_node_set_frame_offset
+ 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 = {
{
int n = get_irn_arity(phi);
ir_node *op;
- int done = 0;
int i;
if(*visited && pset_find_ptr(*visited, phi))
return arch_irn_flags_none;
}
-static entity *phi_get_frame_entity(const void *_self, const ir_node *irn)
+static ir_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, ir_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_classify,
phi_get_flags,
phi_get_frame_entity,
- phi_set_frame_offset
+ 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 = {
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;
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);
fprintf(f, "\n");
}
+/**
+ * Dumps node register requirements to a file.
+ */
static void dump_node_reqs(FILE *f, ir_node *irn)
{
int i;
}
}
+/**
+ * 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);
if(be_has_frame_entity(irn)) {
be_frame_attr_t *a = (be_frame_attr_t *) at;
- if (a->ent)
- ir_fprintf(f, "frame entity: %+F offset %x (%d)\n", a->ent, a->offset, a->offset);
+ 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(be_get_irn_opcode(irn)) {
- case beo_Spill:
+ case beo_IncSP:
{
- be_spill_attr_t *a = (be_spill_attr_t *) at;
- ir_fprintf(f, "spill context: %+F\n", a->spill_ctx);
+ 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) {
+ ir_entity *in, *out;
+ in = be_get_MemPerm_in_entity(irn, i);
+ out = be_get_MemPerm_out_entity(irn, i);
+ if(in) {
+ fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
+ }
+ if(out) {
+ fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
+ }
+ }
}
break;
- }
+ default:
+ break;
+ }
}
return 0;
}
/**
+ * ir_op-Operation:
* Copies the backend specific attributes from old node to new node.
*/
static void copy_attr(const ir_node *old_node, ir_node *new_node)