4 * @author Sebastian Hack
6 * Backend node support.
8 * This file provides Perm, Copy, Spill and Reload nodes.
10 * Copyright (C) 2005 Universitaet Karlsruhe
11 * Released under the GPL
27 #include "bitfiddle.h"
39 #include "besched_t.h"
44 #define OUT_POS(x) (-((x) + 1))
46 /* Sometimes we want to put const nodes into get_irn_generic_attr ... */
47 #define get_irn_attr(irn) get_irn_generic_attr((ir_node *) (irn))
49 static unsigned be_node_tag = FOURCC('B', 'E', 'N', 'O');
52 be_req_kind_old_limited,
53 be_req_kind_negate_old_limited,
54 be_req_kind_single_reg
58 arch_register_req_t req;
60 arch_irn_flags_t flags;
63 void (*old_limited)(void *ptr, bitset_t *bs);
64 void *old_limited_env;
67 const arch_register_t *single_reg;
72 const arch_register_t *reg;
77 /** The generic be nodes attribute type. */
80 be_reg_data_t *reg_data;
83 /** The be_Return nodes attribute type. */
85 be_node_attr_t node_attr;
86 int num_ret_vals; /**< number of return values */
89 /** The be_Stack attribute type. */
91 be_node_attr_t node_attr;
92 int offset; /**< The offset by which the stack shall be expanded/shrinked. */
95 /** The be_Frame attribute type. */
97 be_node_attr_t node_attr;
102 /** The be_Call attribute type. */
104 be_node_attr_t node_attr;
105 entity *ent; /**< The called entity if this is a static call. */
106 ir_type *call_tp; /**< The call type, copied from the original Call node. */
110 be_node_attr_t node_attr;
111 entity **in_entities;
112 entity **out_entities;
118 ir_op *op_be_MemPerm;
121 ir_op *op_be_CopyKeep;
127 ir_op *op_be_RegParams;
128 ir_op *op_be_StackParam;
129 ir_op *op_be_FrameAddr;
130 ir_op *op_be_FrameLoad;
131 ir_op *op_be_FrameStore;
132 ir_op *op_be_Barrier;
134 static int beo_base = -1;
136 static const ir_op_ops be_node_op_ops;
138 #define N irop_flag_none
139 #define L irop_flag_labeled
140 #define C irop_flag_commutative
141 #define X irop_flag_cfopcode
142 #define I irop_flag_ip_cfopcode
143 #define F irop_flag_fragile
144 #define Y irop_flag_forking
145 #define H irop_flag_highlevel
146 #define c irop_flag_constlike
147 #define K irop_flag_keep
148 #define M irop_flag_machine
152 * Compare two node attributes.
154 * @return zero if both attributes are identically
156 static int cmp_node_attr(be_node_attr_t *a, be_node_attr_t *b) {
157 if (a->max_reg_data == b->max_reg_data) {
160 for (i = 0; i < a->max_reg_data; ++i) {
161 if (a->reg_data[i].reg != b->reg_data[i].reg ||
162 memcmp(&a->reg_data[i].in_req, &b->reg_data[i].in_req, sizeof(b->reg_data[i].in_req)) ||
163 memcmp(&a->reg_data[i].req, &b->reg_data[i].req, sizeof(a->reg_data[i].req)))
172 * Compare the attributes of two FrameAddr nodes.
174 * @return zero if both attributes are identically
176 static int FrameAddr_cmp_attr(ir_node *a, ir_node *b) {
177 be_frame_attr_t *a_attr = get_irn_attr(a);
178 be_frame_attr_t *b_attr = get_irn_attr(b);
180 if (a_attr->ent == b_attr->ent && a_attr->offset == b_attr->offset)
181 return cmp_node_attr(&a_attr->node_attr, &b_attr->node_attr);
185 void be_node_init(void) {
186 static int inited = 0;
193 /* Acquire all needed opcodes. */
194 beo_base = get_next_ir_opcodes(beo_Last - 1);
196 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);
197 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);
198 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);
199 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);
200 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);
201 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);
202 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);
203 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);
204 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);
205 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);
206 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);
207 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);
208 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);
209 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);
210 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);
211 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);
212 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);
213 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);
215 set_op_tag(op_be_Spill, &be_node_tag);
216 set_op_tag(op_be_Reload, &be_node_tag);
217 set_op_tag(op_be_Perm, &be_node_tag);
218 set_op_tag(op_be_MemPerm, &be_node_tag);
219 set_op_tag(op_be_Copy, &be_node_tag);
220 set_op_tag(op_be_Keep, &be_node_tag);
221 set_op_tag(op_be_CopyKeep, &be_node_tag);
222 set_op_tag(op_be_Call, &be_node_tag);
223 set_op_tag(op_be_Return, &be_node_tag);
224 set_op_tag(op_be_AddSP, &be_node_tag);
225 set_op_tag(op_be_SetSP, &be_node_tag);
226 set_op_tag(op_be_IncSP, &be_node_tag);
227 set_op_tag(op_be_RegParams, &be_node_tag);
228 set_op_tag(op_be_StackParam, &be_node_tag);
229 set_op_tag(op_be_FrameLoad, &be_node_tag);
230 set_op_tag(op_be_FrameStore, &be_node_tag);
231 set_op_tag(op_be_FrameAddr, &be_node_tag);
232 set_op_tag(op_be_Barrier, &be_node_tag);
234 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
238 * Initializes the generic attribute of all be nodes and return ir.
240 static void *init_node_attr(ir_node* irn, int max_reg_data)
242 ir_graph *irg = get_irn_irg(irn);
243 be_node_attr_t *a = get_irn_attr(irn);
245 memset(a, 0, sizeof(get_op_attr_size(get_irn_op(irn))));
246 a->max_reg_data = max_reg_data;
249 if(max_reg_data > 0) {
252 a->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(irg), max_reg_data);
253 memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
254 for(i = 0; i < max_reg_data; ++i) {
255 a->reg_data[i].req.req.cls = NULL;
256 a->reg_data[i].req.req.type = arch_register_req_type_none;
263 int is_be_node(const ir_node *irn)
265 return get_op_tag(get_irn_op(irn)) == &be_node_tag;
268 be_opcode_t be_get_irn_opcode(const ir_node *irn)
270 return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp;
273 static int redir_proj(const ir_node **node, int pos)
275 const ir_node *n = *node;
280 *node = irn = get_Proj_pred(n);
282 assert(get_irn_mode(irn) == mode_T);
283 *node = get_Proj_pred(irn);
285 return get_Proj_proj(n);
291 static be_node_attr_t *retrieve_irn_attr(const ir_node *irn, int *the_pos)
294 be_node_attr_t *res = NULL;
295 int *pos = the_pos ? the_pos : &dummy;
299 ir_node *pred = get_Proj_pred(irn);
300 int p = get_Proj_proj(irn);
302 if(is_be_node(pred)) {
303 assert(get_irn_mode(pred) == mode_T);
305 res = get_irn_attr(pred);
306 assert(p >= 0 && p < res->max_reg_data && "illegal proj number");
310 else if(is_be_node(irn) && get_irn_mode(irn) != mode_T) {
311 be_node_attr_t *a = get_irn_attr(irn);
312 if(a->max_reg_data > 0) {
321 static be_reg_data_t *retrieve_reg_data(const ir_node *irn)
324 be_node_attr_t *a = retrieve_irn_attr(irn, &pos);
325 return a ? &a->reg_data[pos] : NULL;
329 be_node_set_irn_reg(const void *_self, ir_node *irn, const arch_register_t *reg)
331 be_reg_data_t *r = retrieve_reg_data(irn);
338 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)
346 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
347 a = init_node_attr(res, 2);
351 be_node_set_reg_class(res, 0, cls_frame);
352 be_node_set_reg_class(res, 1, cls);
356 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)
363 res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in);
364 init_node_attr(res, 2);
365 be_node_set_reg_class(res, 0, cls_frame);
366 be_node_set_reg_class(res, -1, cls);
370 ir_node *be_get_Reload_mem(const ir_node *irn)
372 assert(be_is_Reload(irn));
373 return get_irn_n(irn, be_pos_Reload_mem);
376 ir_node *be_get_Reload_frame(const ir_node *irn)
378 assert(be_is_Reload(irn));
379 return get_irn_n(irn, be_pos_Reload_frame);
382 ir_node *be_get_Spill_val(const ir_node *irn)
384 assert(be_is_Spill(irn));
385 return get_irn_n(irn, be_pos_Spill_val);
388 ir_node *be_get_Spill_frame(const ir_node *irn)
390 assert(be_is_Spill(irn));
391 return get_irn_n(irn, be_pos_Spill_frame);
394 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
397 ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in);
398 init_node_attr(irn, n);
399 for(i = 0; i < n; ++i) {
400 be_node_set_reg_class(irn, i, cls);
401 be_node_set_reg_class(irn, OUT_POS(i), cls);
407 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
410 ir_node *frame = get_irg_frame(irg);
411 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
413 const arch_register_t *sp = arch_env->isa->sp;
414 be_memperm_attr_t *attr;
417 real_in = alloca((n+1) * sizeof(real_in[0]));
419 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
421 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
423 init_node_attr(irn, n + 1);
424 be_node_set_reg_class(irn, 0, sp->reg_class);
425 for(i = 0; i < n; ++i) {
426 be_node_set_reg_class(irn, i + 1, cls_frame);
427 be_node_set_reg_class(irn, OUT_POS(i), cls_frame);
430 attr = get_irn_attr(irn);
432 attr->in_entities = obstack_alloc(irg->obst, n * sizeof(attr->in_entities[0]));
433 memset(attr->in_entities, 0, n * sizeof(attr->in_entities[0]));
434 attr->out_entities = obstack_alloc(irg->obst, n*sizeof(attr->out_entities[0]));
435 memset(attr->out_entities, 0, n*sizeof(attr->out_entities[0]));
441 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
447 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
448 init_node_attr(res, 1);
449 be_node_set_reg_class(res, 0, cls);
450 be_node_set_reg_class(res, OUT_POS(0), cls);
454 ir_node *be_get_Copy_op(const ir_node *cpy) {
455 return get_irn_n(cpy, be_pos_Copy_op);
458 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
459 set_irn_n(cpy, be_pos_Copy_op, op);
462 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
467 irn = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, n, in);
468 init_node_attr(irn, n);
469 for(i = 0; i < n; ++i) {
470 be_node_set_reg_class(irn, i, cls);
476 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
477 int n_outs, int n, ir_node *in[], ir_type *call_tp)
480 int real_n = be_pos_Call_first_arg + n;
484 NEW_ARR_A(ir_node *, real_in, real_n);
485 real_in[be_pos_Call_mem] = mem;
486 real_in[be_pos_Call_sp] = sp;
487 real_in[be_pos_Call_ptr] = ptr;
488 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
490 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
491 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
493 a->call_tp = call_tp;
497 /* Gets the call entity or NULL if this is no static call. */
498 entity *be_Call_get_entity(const ir_node *call) {
499 be_call_attr_t *a = get_irn_attr(call);
500 assert(be_is_Call(call));
504 /* Sets the call entity. */
505 void be_Call_set_entity(ir_node *call, entity *ent) {
506 be_call_attr_t *a = get_irn_attr(call);
507 assert(be_is_Call(call));
511 /* Gets the call type. */
512 ir_type *be_Call_get_type(ir_node *call) {
513 be_call_attr_t *a = get_irn_attr(call);
514 assert(be_is_Call(call));
518 /* Sets the call type. */
519 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
520 be_call_attr_t *a = get_irn_attr(call);
521 assert(be_is_Call(call));
522 a->call_tp = call_tp;
525 /* Construct a new be_Return. */
526 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *bl, int n_res, int n, ir_node *in[])
529 ir_node *irn = new_ir_node(dbg, irg, bl, op_be_Return, mode_X, n, in);
530 init_node_attr(irn, n);
531 a = get_irn_attr(irn);
532 a->num_ret_vals = n_res;
537 /* Returns the number of real returns values */
538 int be_Return_get_n_rets(ir_node *ret)
540 be_return_attr_t *a = get_irn_attr(ret);
541 return a->num_ret_vals;
544 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)
552 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, 2, in);
553 a = init_node_attr(irn, 1);
556 be_node_set_flags(irn, -1, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
558 /* Set output constraint to stack register. */
559 be_node_set_reg_class(irn, 0, sp->reg_class);
560 be_set_constr_single_reg(irn, BE_OUT_POS(0), sp);
561 be_node_set_irn_reg(NULL, irn, sp);
566 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
570 ir_node *in[be_pos_AddSP_last];
572 in[be_pos_AddSP_old_sp] = old_sp;
573 in[be_pos_AddSP_size] = sz;
575 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
576 a = init_node_attr(irn, be_pos_AddSP_last);
578 be_node_set_flags(irn, OUT_POS(pn_be_AddSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
580 /* Set output constraint to stack register. */
581 be_set_constr_single_reg(irn, be_pos_AddSP_old_sp, sp);
582 be_node_set_reg_class(irn, be_pos_AddSP_size, arch_register_get_class(sp));
583 be_set_constr_single_reg(irn, OUT_POS(pn_be_AddSP_res), sp);
584 a->reg_data[pn_be_AddSP_res].reg = sp;
589 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)
598 irn = new_ir_node(NULL, irg, bl, op_be_SetSP, get_irn_mode(old_sp), 3, in);
599 a = init_node_attr(irn, 3);
601 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
603 /* Set output constraint to stack register. */
604 be_set_constr_single_reg(irn, OUT_POS(0), sp);
605 be_node_set_reg_class(irn, 1, sp->reg_class);
606 be_node_set_reg_class(irn, 2, sp->reg_class);
607 be_node_set_irn_reg(NULL, irn, sp);
612 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)
618 in[0] = frame_pointer;
619 irn = new_ir_node(NULL, irg, bl, op_be_StackParam, mode, 1, in);
620 a = init_node_attr(irn, 1);
623 be_node_set_reg_class(irn, 0, cls_frame);
624 be_node_set_reg_class(irn, OUT_POS(0), cls);
628 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
633 irn = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, in);
634 init_node_attr(irn, n_outs);
638 ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
639 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, entity *ent)
647 irn = new_ir_node(NULL, irg, bl, op_be_FrameLoad, mode_T, 2, in);
648 a = init_node_attr(irn, 3);
651 be_node_set_reg_class(irn, 1, cls_frame);
652 be_node_set_reg_class(irn, OUT_POS(pn_Load_res), cls_data);
656 ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
657 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, entity *ent)
666 irn = new_ir_node(NULL, irg, bl, op_be_FrameStore, mode_T, 3, in);
667 a = init_node_attr(irn, 3);
670 be_node_set_reg_class(irn, 1, cls_frame);
671 be_node_set_reg_class(irn, 2, cls_data);
675 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, entity *ent)
682 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
683 a = init_node_attr(irn, 1);
686 be_node_set_reg_class(irn, 0, cls_frame);
687 be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
689 return optimize_node(irn);
692 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)
695 ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0]));
698 memcpy(&in[1], in_keep, n * sizeof(in[0]));
699 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
700 init_node_attr(irn, n + 1);
701 be_node_set_reg_class(irn, OUT_POS(0), cls);
702 be_node_set_reg_class(irn, 0, cls);
707 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)
712 return be_new_CopyKeep(cls, irg, bl, src, 1, in, mode);
715 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
716 return get_irn_n(cpy, be_pos_CopyKeep_op);
719 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
720 set_irn_n(cpy, be_pos_CopyKeep_op, op);
723 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
727 irn = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, n, in);
728 init_node_attr(irn, n);
732 int be_is_Spill (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill ; }
733 int be_is_Reload (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Reload ; }
734 int be_is_Copy (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Copy ; }
735 int be_is_CopyKeep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_CopyKeep ; }
736 int be_is_Perm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Perm ; }
737 int be_is_MemPerm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_MemPerm ; }
738 int be_is_Keep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Keep ; }
739 int be_is_Call (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Call ; }
740 int be_is_Return (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Return ; }
741 int be_is_IncSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_IncSP ; }
742 int be_is_SetSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SetSP ; }
743 int be_is_AddSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_AddSP ; }
744 int be_is_RegParams (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_RegParams ; }
745 int be_is_StackParam (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_StackParam ; }
746 int be_is_FrameAddr (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameAddr ; }
747 int be_is_FrameLoad (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameLoad ; }
748 int be_is_FrameStore (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameStore ; }
749 int be_is_Barrier (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Barrier ; }
751 int be_has_frame_entity(const ir_node *irn)
753 switch(be_get_irn_opcode(irn)) {
766 entity* be_get_frame_entity(const ir_node *irn)
768 if(be_has_frame_entity(irn)) {
769 be_frame_attr_t *a = get_irn_attr(irn);
775 void be_set_MemPerm_in_entity(const ir_node *irn, int n, entity *ent)
777 be_memperm_attr_t *attr = get_irn_attr(irn);
779 assert(be_is_MemPerm(irn));
780 assert(n < be_get_MemPerm_entity_arity(irn));
782 attr->in_entities[n] = ent;
785 entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
787 be_memperm_attr_t *attr = get_irn_attr(irn);
789 assert(be_is_MemPerm(irn));
790 assert(n < be_get_MemPerm_entity_arity(irn));
792 return attr->in_entities[n];
795 void be_set_MemPerm_out_entity(const ir_node *irn, int n, entity *ent)
797 be_memperm_attr_t *attr = get_irn_attr(irn);
799 assert(be_is_MemPerm(irn));
800 assert(n < be_get_MemPerm_entity_arity(irn));
802 attr->out_entities[n] = ent;
805 entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
807 be_memperm_attr_t *attr = get_irn_attr(irn);
809 assert(be_is_MemPerm(irn));
810 assert(n < be_get_MemPerm_entity_arity(irn));
812 return attr->out_entities[n];
815 int be_get_MemPerm_entity_arity(const ir_node *irn)
817 return get_irn_arity(irn) - 1;
820 static void be_limited(void *data, bitset_t *bs)
822 be_req_t *req = data;
825 case be_req_kind_negate_old_limited:
826 case be_req_kind_old_limited:
827 req->x.old_limited.old_limited(req->x.old_limited.old_limited_env, bs);
828 if(req->kind == be_req_kind_negate_old_limited)
831 case be_req_kind_single_reg:
832 bitset_clear_all(bs);
833 bitset_set(bs, req->x.single_reg->index);
838 static INLINE be_req_t *get_req(ir_node *irn, int pos)
840 int idx = pos < 0 ? -(pos + 1) : pos;
841 be_node_attr_t *a = get_irn_attr(irn);
842 be_reg_data_t *rd = &a->reg_data[idx];
843 be_req_t *r = pos < 0 ? &rd->req : &rd->in_req;
845 assert(is_be_node(irn));
846 assert(!(pos >= 0) || pos < get_irn_arity(irn));
847 assert(!(pos < 0) || -(pos + 1) <= a->max_reg_data);
852 void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg)
854 be_req_t *r = get_req(irn, pos);
856 r->kind = be_req_kind_single_reg;
857 r->x.single_reg = reg;
858 r->req.limited = be_limited;
859 r->req.limited_env = r;
860 r->req.type = arch_register_req_type_limited;
861 r->req.cls = reg->reg_class;
864 void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req)
866 be_req_t *r = get_req(irn, pos);
868 assert(arch_register_req_is(req, limited));
870 r->kind = be_req_kind_old_limited;
871 r->req.limited = be_limited;
872 r->req.limited_env = r;
873 r->req.type = arch_register_req_type_limited;
874 r->req.cls = req->cls;
876 r->x.old_limited.old_limited = req->limited;
877 r->x.old_limited.old_limited_env = req->limited_env;
880 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
882 be_req_t *r = get_req(irn, pos);
886 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
888 be_req_t *r = get_req(irn, pos);
890 if(r->req.type == arch_register_req_type_none)
891 r->req.type = arch_register_req_type_normal;
894 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
896 be_req_t *r = get_req(irn, pos);
900 ir_node *be_get_IncSP_pred(ir_node *irn) {
901 assert(be_is_IncSP(irn));
902 return get_irn_n(irn, 0);
905 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
906 assert(be_is_IncSP(incsp));
907 set_irn_n(incsp, 0, pred);
910 ir_node *be_get_IncSP_mem(ir_node *irn) {
911 assert(be_is_IncSP(irn));
912 return get_irn_n(irn, 1);
915 void be_set_IncSP_offset(ir_node *irn, int offset)
917 be_stack_attr_t *a = get_irn_attr(irn);
918 assert(be_is_IncSP(irn));
922 int be_get_IncSP_offset(const ir_node *irn)
924 be_stack_attr_t *a = get_irn_attr(irn);
925 assert(be_is_IncSP(irn));
929 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn)
931 ir_node *bl = get_nodes_block(irn);
932 ir_graph *irg = get_irn_irg(bl);
933 ir_node *frame = get_irg_frame(irg);
936 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
937 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
939 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn);
943 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)
947 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
948 ir_graph *irg = get_irn_irg(bl);
949 ir_node *frame = get_irg_frame(irg);
950 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
952 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
954 reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
956 if(is_Block(insert)) {
957 insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
958 sched_add_after(insert, reload);
962 sched_add_before(insert, reload);
969 | _ \ ___ __ _ | _ \ ___ __ _ ___
970 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
971 | _ < __/ (_| | | _ < __/ (_| \__ \
972 |_| \_\___|\__, | |_| \_\___|\__, |___/
978 static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int out_pos)
980 const be_node_attr_t *a = get_irn_attr(irn);
982 if(out_pos < a->max_reg_data) {
983 memcpy(req, &a->reg_data[out_pos].req, sizeof(req[0]));
985 if(be_is_Copy(irn)) {
986 req->type |= arch_register_req_type_should_be_same;
987 req->other_same = be_get_Copy_op(irn);
991 req->type = arch_register_req_type_none;
998 static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos)
1000 const be_node_attr_t *a = get_irn_attr(irn);
1002 if(pos < get_irn_arity(irn) && pos < a->max_reg_data)
1003 memcpy(req, &a->reg_data[pos].in_req, sizeof(req[0]));
1005 req->type = arch_register_req_type_none;
1012 static const arch_register_req_t *
1013 be_node_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_node *irn, int pos)
1018 if(get_irn_mode(irn) == mode_T)
1021 out_pos = redir_proj((const ir_node **) &irn, pos);
1022 assert(is_be_node(irn));
1023 return put_out_reg_req(req, irn, out_pos);
1027 return is_be_node(irn) ? put_in_reg_req(req, irn, pos) : NULL;
1033 const arch_register_t *
1034 be_node_get_irn_reg(const void *_self, const ir_node *irn)
1036 be_reg_data_t *r = retrieve_reg_data(irn);
1037 return r ? r->reg : NULL;
1040 static arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn)
1042 redir_proj((const ir_node **) &irn, -1);
1044 switch(be_get_irn_opcode(irn)) {
1045 #define XXX(a,b) case beo_ ## a: return arch_irn_class_ ## b
1047 XXX(Reload, reload);
1050 XXX(Return, branch);
1051 XXX(StackParam, stackparam);
1054 return arch_irn_class_normal;
1060 static arch_irn_flags_t be_node_get_flags(const void *_self, const ir_node *irn)
1062 be_reg_data_t *r = retrieve_reg_data(irn);
1063 return r ? r->req.flags : 0;
1066 static entity *be_node_get_frame_entity(const void *self, const ir_node *irn)
1068 return be_get_frame_entity(irn);
1071 static void be_node_set_frame_entity(const void *self, ir_node *irn, entity *ent)
1075 assert(be_has_frame_entity(irn));
1077 a = get_irn_attr(irn);
1081 static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset)
1083 if(be_has_frame_entity(irn)) {
1084 be_frame_attr_t *a = get_irn_attr(irn);
1089 static int be_node_get_sp_bias(const void *self, const ir_node *irn)
1093 if(be_is_IncSP(irn)) {
1094 result = be_get_IncSP_offset(irn);
1101 ___ ____ _ _ _ _ _ _
1102 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1103 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1104 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1105 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1109 static const arch_irn_ops_if_t be_node_irn_ops_if = {
1110 be_node_get_irn_reg_req,
1111 be_node_set_irn_reg,
1112 be_node_get_irn_reg,
1115 be_node_get_frame_entity,
1116 be_node_set_frame_entity,
1117 be_node_set_frame_offset,
1118 be_node_get_sp_bias,
1119 NULL, /* get_inverse */
1120 NULL, /* get_op_estimated_cost */
1121 NULL, /* possible_memory_operand */
1122 NULL, /* perform_memory_operand */
1125 static const arch_irn_ops_t be_node_irn_ops = {
1129 const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
1131 redir_proj((const ir_node **) &irn, -1);
1132 return is_be_node(irn) ? &be_node_irn_ops : NULL;
1135 const arch_irn_handler_t be_node_irn_handler = {
1140 ____ _ _ ___ ____ _ _ _ _ _ _
1141 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1142 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1143 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1144 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1149 arch_irn_handler_t irn_handler;
1150 arch_irn_ops_t irn_ops;
1151 const arch_env_t *arch_env;
1155 #define get_phi_handler_from_handler(h) container_of(h, phi_handler_t, irn_handler)
1156 #define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops)
1158 static const void *phi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn)
1160 const phi_handler_t *h = get_phi_handler_from_handler(handler);
1161 return is_Phi(irn) && mode_is_datab(get_irn_mode(irn)) ? &h->irn_ops : NULL;
1165 * Get register class of a Phi.
1168 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)
1170 int n = get_irn_arity(phi);
1174 if(*visited && pset_find_ptr(*visited, phi))
1177 for(i = 0; i < n; ++i) {
1178 op = get_irn_n(phi, i);
1180 return arch_get_register_req(h->arch_env, req, op, BE_OUT_POS(0));
1184 The operands of that Phi were all Phis themselves.
1185 We have to start a DFS for a non-Phi argument now.
1188 *visited = pset_new_ptr(16);
1190 pset_insert_ptr(*visited, phi);
1192 for(i = 0; i < n; ++i) {
1193 op = get_irn_n(phi, i);
1194 if(get_Phi_reg_req_recursive(h, req, op, visited))
1201 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)
1203 phi_handler_t *phi_handler = get_phi_handler_from_ops(self);
1204 pset *visited = NULL;
1206 get_Phi_reg_req_recursive(phi_handler, req, irn, &visited);
1207 /* Set the requirements type to normal, since an operand of the Phi could have had constraints. */
1208 req->type = arch_register_req_type_normal;
1215 static void phi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1217 phi_handler_t *h = get_phi_handler_from_ops(self);
1218 pmap_insert(h->regs, irn, (void *) reg);
1221 static const arch_register_t *phi_get_irn_reg(const void *self, const ir_node *irn)
1223 phi_handler_t *h = get_phi_handler_from_ops(self);
1224 return pmap_get(h->regs, (void *) irn);
1227 static arch_irn_class_t phi_classify(const void *_self, const ir_node *irn)
1229 return arch_irn_class_normal;
1232 static arch_irn_flags_t phi_get_flags(const void *_self, const ir_node *irn)
1234 return arch_irn_flags_none;
1237 static entity *phi_get_frame_entity(const void *_self, const ir_node *irn)
1242 static void phi_set_frame_entity(const void *_self, ir_node *irn, entity *ent)
1246 static void phi_set_frame_offset(const void *_self, ir_node *irn, int bias)
1250 static int phi_get_sp_bias(const void* self, const ir_node *irn)
1255 static const arch_irn_ops_if_t phi_irn_ops = {
1256 phi_get_irn_reg_req,
1261 phi_get_frame_entity,
1262 phi_set_frame_entity,
1263 phi_set_frame_offset,
1265 NULL, /* get_inverse */
1266 NULL, /* get_op_estimated_cost */
1267 NULL, /* possible_memory_operand */
1268 NULL, /* perform_memory_operand */
1271 static const arch_irn_handler_t phi_irn_handler = {
1275 arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env)
1277 phi_handler_t *h = xmalloc(sizeof(h[0]));
1278 h->irn_handler.get_irn_ops = phi_get_irn_ops;
1279 h->irn_ops.impl = &phi_irn_ops;
1280 h->arch_env = arch_env;
1281 h->regs = pmap_create();
1282 return (arch_irn_handler_t *) h;
1285 void be_phi_handler_free(arch_irn_handler_t *handler)
1287 phi_handler_t *h = (void *) handler;
1288 pmap_destroy(h->regs);
1292 const void *be_phi_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
1294 phi_handler_t *phi_handler = get_phi_handler_from_handler(self);
1295 return is_Phi(irn) ? &phi_handler->irn_ops : NULL;
1298 void be_phi_handler_reset(arch_irn_handler_t *handler)
1300 phi_handler_t *h = get_phi_handler_from_handler(handler);
1302 pmap_destroy(h->regs);
1303 h->regs = pmap_create();
1308 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1309 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1310 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1311 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1316 * Dumps a register requirement to a file.
1318 static void dump_node_req(FILE *f, int idx, be_req_t *req)
1321 int did_something = 0;
1323 const char *prefix = buf;
1325 snprintf(buf, sizeof(buf), "#%d ", idx);
1326 buf[sizeof(buf) - 1] = '\0';
1328 if(req->flags != arch_irn_flags_none) {
1329 fprintf(f, "%sflags: ", prefix);
1331 for(i = arch_irn_flags_none; i <= log2_ceil(arch_irn_flags_last); ++i) {
1332 if(req->flags & (1 << i)) {
1333 fprintf(f, "%s%s", prefix, arch_irn_flag_str(1 << i));
1341 if(req->req.cls != 0) {
1344 arch_register_req_format(tmp, sizeof(tmp), &req->req);
1345 fprintf(f, "%s", tmp);
1354 * Dumps node register requirements to a file.
1356 static void dump_node_reqs(FILE *f, ir_node *irn)
1359 be_node_attr_t *a = get_irn_attr(irn);
1361 fprintf(f, "registers: \n");
1362 for(i = 0; i < a->max_reg_data; ++i) {
1363 be_reg_data_t *rd = &a->reg_data[i];
1365 fprintf(f, "#%d: %s\n", i, rd->reg->name);
1368 fprintf(f, "in requirements\n");
1369 for(i = 0; i < a->max_reg_data; ++i) {
1370 dump_node_req(f, i, &a->reg_data[i].in_req);
1373 fprintf(f, "\nout requirements\n");
1374 for(i = 0; i < a->max_reg_data; ++i) {
1375 dump_node_req(f, i, &a->reg_data[i].req);
1380 * ir_op-Operation: dump a be node to file
1382 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1384 be_node_attr_t *at = get_irn_attr(irn);
1386 assert(is_be_node(irn));
1389 case dump_node_opcode_txt:
1390 fprintf(f, get_op_name(get_irn_op(irn)));
1392 case dump_node_mode_txt:
1393 fprintf(f, get_mode_name(get_irn_mode(irn)));
1395 case dump_node_nodeattr_txt:
1397 case dump_node_info_txt:
1398 dump_node_reqs(f, irn);
1400 if(be_has_frame_entity(irn)) {
1401 be_frame_attr_t *a = (be_frame_attr_t *) at;
1403 int bits = get_type_size_bits(get_entity_type(a->ent));
1404 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bits\n",
1405 a->ent, a->offset, a->offset, bits, bits);
1410 switch(be_get_irn_opcode(irn)) {
1413 be_stack_attr_t *a = (be_stack_attr_t *) at;
1414 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1415 fprintf(f, "offset: FRAME_SIZE\n");
1416 else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1417 fprintf(f, "offset: -FRAME SIZE\n");
1419 fprintf(f, "offset: %u\n", a->offset);
1424 be_call_attr_t *a = (be_call_attr_t *) at;
1427 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1433 for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1435 in = be_get_MemPerm_in_entity(irn, i);
1436 out = be_get_MemPerm_out_entity(irn, i);
1438 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1441 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1457 * Copies the backend specific attributes from old node to new node.
1459 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1461 be_node_attr_t *old_attr = get_irn_attr(old_node);
1462 be_node_attr_t *new_attr = get_irn_attr(new_node);
1465 assert(is_be_node(old_node));
1466 assert(is_be_node(new_node));
1468 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1469 new_attr->reg_data = NULL;
1471 if(new_attr->max_reg_data > 0) {
1472 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(get_irn_irg(new_node)), new_attr->max_reg_data);
1473 memcpy(new_attr->reg_data, old_attr->reg_data, new_attr->max_reg_data * sizeof(be_reg_data_t));
1475 for(i = 0; i < old_attr->max_reg_data; ++i) {
1478 r = &new_attr->reg_data[i].req;
1479 r->req.limited_env = r;
1481 r = &new_attr->reg_data[i].in_req;
1482 r->req.limited_env = r;
1487 static const ir_op_ops be_node_op_ops = {