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"
38 #include "besched_t.h"
43 #define OUT_POS(x) (-((x) + 1))
45 /* Sometimes we want to put const nodes into get_irn_generic_attr ... */
46 #define get_irn_attr(irn) get_irn_generic_attr((ir_node *) (irn))
48 static unsigned be_node_tag = FOURCC('B', 'E', 'N', 'O');
51 typedef enum _node_kind_t {
62 be_req_kind_old_limited,
63 be_req_kind_negate_old_limited,
64 be_req_kind_single_reg
68 arch_register_req_t req;
70 arch_irn_flags_t flags;
73 void (*old_limited)(void *ptr, bitset_t *bs);
74 void *old_limited_env;
77 const arch_register_t *single_reg;
82 const arch_register_t *reg;
87 /** The generic be nodes attribute type. */
90 be_reg_data_t *reg_data;
93 /** The be_Stack attribute type. */
95 be_node_attr_t node_attr;
96 int offset; /**< The offset by which the stack shall be increased/decreased. */
97 be_stack_dir_t dir; /**< The direction in which the stack shall be modified (expand or shrink). */
100 /** The be_Frame attribute type. */
102 be_node_attr_t node_attr;
107 /** The be_Call attribute type. */
109 be_node_attr_t node_attr;
110 entity *ent; /**< The called entity if this is a static call. */
111 ir_type *call_tp; /**< The call type, copied from the original Call node. */
114 /** The be_Spill attribute type. */
116 be_frame_attr_t frame_attr;
117 ir_node *spill_ctx; /**< The node in whose context this spill was introduced. */
125 ir_op *op_be_CopyKeep;
131 ir_op *op_be_RegParams;
132 ir_op *op_be_StackParam;
133 ir_op *op_be_FrameAddr;
134 ir_op *op_be_FrameLoad;
135 ir_op *op_be_FrameStore;
136 ir_op *op_be_Barrier;
138 static int beo_base = -1;
140 static const ir_op_ops be_node_op_ops;
142 #define N irop_flag_none
143 #define L irop_flag_labeled
144 #define C irop_flag_commutative
145 #define X irop_flag_cfopcode
146 #define I irop_flag_ip_cfopcode
147 #define F irop_flag_fragile
148 #define Y irop_flag_forking
149 #define H irop_flag_highlevel
150 #define c irop_flag_constlike
151 #define K irop_flag_keep
152 #define M irop_flag_machine
155 void be_node_init(void) {
156 static int inited = 0;
163 /* Acquire all needed opcodes. */
164 beo_base = get_next_ir_opcodes(beo_Last - 1);
166 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);
167 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);
168 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);
169 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);
170 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);
171 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);
172 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);
173 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);
174 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);
175 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);
176 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);
177 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);
178 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);
179 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);
180 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);
181 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);
182 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);
184 set_op_tag(op_be_Spill, &be_node_tag);
185 set_op_tag(op_be_Reload, &be_node_tag);
186 set_op_tag(op_be_Perm, &be_node_tag);
187 set_op_tag(op_be_Copy, &be_node_tag);
188 set_op_tag(op_be_Keep, &be_node_tag);
189 set_op_tag(op_be_CopyKeep, &be_node_tag);
190 set_op_tag(op_be_Call, &be_node_tag);
191 set_op_tag(op_be_Return, &be_node_tag);
192 set_op_tag(op_be_AddSP, &be_node_tag);
193 set_op_tag(op_be_SetSP, &be_node_tag);
194 set_op_tag(op_be_IncSP, &be_node_tag);
195 set_op_tag(op_be_RegParams, &be_node_tag);
196 set_op_tag(op_be_StackParam, &be_node_tag);
197 set_op_tag(op_be_FrameLoad, &be_node_tag);
198 set_op_tag(op_be_FrameStore, &be_node_tag);
199 set_op_tag(op_be_FrameAddr, &be_node_tag);
200 set_op_tag(op_be_Barrier, &be_node_tag);
204 * Initializes the generic attribute of all be nodes and return ir.
206 static void *init_node_attr(ir_node* irn, int max_reg_data)
208 ir_graph *irg = get_irn_irg(irn);
209 be_node_attr_t *a = get_irn_attr(irn);
211 memset(a, 0, sizeof(get_op_attr_size(get_irn_op(irn))));
212 a->max_reg_data = max_reg_data;
215 if(max_reg_data > 0) {
218 a->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(irg), max_reg_data);
219 memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
220 for(i = 0; i < max_reg_data; ++i) {
221 a->reg_data[i].req.req.cls = NULL;
222 a->reg_data[i].req.req.type = arch_register_req_type_none;
229 static INLINE int is_be_node(const ir_node *irn)
231 return get_op_tag(get_irn_op(irn)) == &be_node_tag;
234 be_opcode_t be_get_irn_opcode(const ir_node *irn)
236 return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp;
239 static int redir_proj(const ir_node **node, int pos)
241 const ir_node *n = *node;
246 assert(pos == -1 && "Illegal pos for a Proj");
247 *node = irn = get_Proj_pred(n);
249 assert(get_irn_mode(irn) == mode_T);
250 *node = get_Proj_pred(irn);
252 return get_Proj_proj(n);
259 be_node_set_irn_reg(const void *_self, ir_node *irn, const arch_register_t *reg)
264 out_pos = redir_proj((const ir_node **) &irn, -1);
265 a = get_irn_attr(irn);
267 assert(is_be_node(irn));
268 assert(out_pos < a->max_reg_data && "position too high");
269 a->reg_data[out_pos].reg = reg;
273 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)
281 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
282 a = init_node_attr(res, 2);
283 a->frame_attr.ent = NULL;
284 a->frame_attr.offset = 0;
287 be_node_set_reg_class(res, 0, cls_frame);
288 be_node_set_reg_class(res, 1, cls);
292 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)
299 res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in);
300 init_node_attr(res, 2);
301 be_node_set_reg_class(res, 0, cls_frame);
302 be_node_set_reg_class(res, -1, cls);
306 ir_node *(be_get_Reload_mem)(const ir_node *irn)
308 assert(be_is_Reload(irn));
309 return get_irn_n(irn, be_pos_Reload_mem);
312 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
315 ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in);
316 init_node_attr(irn, n);
317 for(i = 0; i < n; ++i) {
318 be_node_set_reg_class(irn, i, cls);
319 be_node_set_reg_class(irn, OUT_POS(i), cls);
325 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
331 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
332 init_node_attr(res, 1);
333 be_node_set_reg_class(res, 0, cls);
334 be_node_set_reg_class(res, OUT_POS(0), cls);
338 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
343 irn = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, n, in);
344 init_node_attr(irn, n);
345 for(i = 0; i < n; ++i) {
346 be_node_set_reg_class(irn, i, cls);
352 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
353 int n_outs, int n, ir_node *in[], ir_type *call_tp)
356 int real_n = be_pos_Call_first_arg + n;
360 NEW_ARR_A(ir_node *, real_in, real_n);
361 real_in[be_pos_Call_mem] = mem;
362 real_in[be_pos_Call_sp] = sp;
363 real_in[be_pos_Call_ptr] = ptr;
364 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
366 irn = new_ir_node(NULL, irg, bl, op_be_Call, mode_T, real_n, real_in);
367 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
369 a->call_tp = call_tp;
373 /* Gets the call entity or NULL if this is no static call. */
374 entity *be_Call_get_entity(const ir_node *call) {
375 be_call_attr_t *a = get_irn_attr(call);
376 assert(be_is_Call(call));
380 /* Sets the call entity. */
381 void be_Call_set_entity(ir_node *call, entity *ent) {
382 be_call_attr_t *a = get_irn_attr(call);
383 assert(be_is_Call(call));
387 /* Gets the call type. */
388 ir_type *be_Call_get_type(ir_node *call) {
389 be_call_attr_t *a = get_irn_attr(call);
390 assert(be_is_Call(call));
394 /* Sets the call type. */
395 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
396 be_call_attr_t *a = get_irn_attr(call);
397 assert(be_is_Call(call));
398 a->call_tp = call_tp;
402 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
404 ir_node *irn = new_ir_node(dbg, irg, bl, op_be_Return, mode_X, n, in);
405 init_node_attr(irn, n);
410 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)
418 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, 2, in);
419 a = init_node_attr(irn, 1);
423 be_node_set_flags(irn, -1, arch_irn_flags_ignore);
425 /* Set output constraint to stack register. */
426 be_node_set_reg_class(irn, 0, sp->reg_class);
427 be_set_constr_single_reg(irn, -1, sp);
428 be_node_set_irn_reg(NULL, irn, sp);
433 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
437 ir_node *in[be_pos_AddSP_last];
439 in[be_pos_AddSP_old_sp] = old_sp;
440 in[be_pos_AddSP_size] = sz;
442 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
443 a = init_node_attr(irn, be_pos_AddSP_last);
445 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore);
447 /* Set output constraint to stack register. */
448 be_set_constr_single_reg(irn, OUT_POS(0), sp);
453 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)
462 irn = new_ir_node(NULL, irg, bl, op_be_SetSP, get_irn_mode(old_sp), 3, in);
463 a = init_node_attr(irn, 3);
465 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore);
467 /* Set output constraint to stack register. */
468 be_set_constr_single_reg(irn, OUT_POS(0), sp);
469 be_node_set_reg_class(irn, 1, sp->reg_class);
470 be_node_set_reg_class(irn, 2, sp->reg_class);
471 be_node_set_irn_reg(NULL, irn, sp);
476 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)
482 in[0] = frame_pointer;
483 irn = new_ir_node(NULL, irg, bl, op_be_StackParam, mode, 1, in);
484 a = init_node_attr(irn, 1);
487 be_node_set_reg_class(irn, 0, cls_frame);
488 be_node_set_reg_class(irn, OUT_POS(0), cls);
492 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
497 irn = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, in);
498 init_node_attr(irn, n_outs);
502 ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
503 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, entity *ent)
511 irn = new_ir_node(NULL, irg, bl, op_be_FrameLoad, mode_T, 2, in);
512 a = init_node_attr(irn, 3);
515 be_node_set_reg_class(irn, 1, cls_frame);
516 be_node_set_reg_class(irn, OUT_POS(pn_Load_res), cls_data);
520 ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
521 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, entity *ent)
530 irn = new_ir_node(NULL, irg, bl, op_be_FrameStore, mode_T, 3, in);
531 a = init_node_attr(irn, 3);
534 be_node_set_reg_class(irn, 1, cls_frame);
535 be_node_set_reg_class(irn, 2, cls_data);
539 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, entity *ent)
546 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
547 a = init_node_attr(irn, 1);
550 be_node_set_reg_class(irn, 0, cls_frame);
551 be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
555 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)
558 ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0]));
561 memcpy(&in[1], in_keep, n * sizeof(in[0]));
562 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
563 init_node_attr(irn, n + 1);
564 be_node_set_reg_class(irn, OUT_POS(0), cls);
565 be_node_set_reg_class(irn, 0, cls);
570 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)
575 return be_new_CopyKeep(cls, irg, bl, src, 1, in, mode);
578 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
582 irn = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, n, in);
583 init_node_attr(irn, n);
587 int be_is_Spill (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill ; }
588 int be_is_Reload (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Reload ; }
589 int be_is_Copy (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Copy ; }
590 int be_is_Perm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Perm ; }
591 int be_is_Keep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Keep ; }
592 int be_is_Call (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Call ; }
593 int be_is_Return (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Return ; }
594 int be_is_IncSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_IncSP ; }
595 int be_is_SetSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SetSP ; }
596 int be_is_AddSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_AddSP ; }
597 int be_is_RegParams (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_RegParams ; }
598 int be_is_StackParam (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_StackParam ; }
599 int be_is_FrameAddr (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameAddr ; }
600 int be_is_FrameLoad (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameLoad ; }
601 int be_is_FrameStore (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameStore ; }
602 int be_is_Barrier (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Barrier ; }
604 int be_has_frame_entity(const ir_node *irn)
606 switch(be_get_irn_opcode(irn)) {
619 entity *be_get_frame_entity(const ir_node *irn)
621 if(be_has_frame_entity(irn)) {
622 be_frame_attr_t *a = get_irn_attr(irn);
628 static void be_limited(void *data, bitset_t *bs)
630 be_req_t *req = data;
633 case be_req_kind_negate_old_limited:
634 case be_req_kind_old_limited:
635 req->x.old_limited.old_limited(req->x.old_limited.old_limited_env, bs);
636 if(req->kind == be_req_kind_negate_old_limited)
639 case be_req_kind_single_reg:
640 bitset_clear_all(bs);
641 bitset_set(bs, req->x.single_reg->index);
646 static INLINE be_req_t *get_req(ir_node *irn, int pos)
648 int idx = pos < 0 ? -(pos + 1) : pos;
649 be_node_attr_t *a = get_irn_attr(irn);
650 be_reg_data_t *rd = &a->reg_data[idx];
651 be_req_t *r = pos < 0 ? &rd->req : &rd->in_req;
653 assert(is_be_node(irn));
654 assert(!(pos >= 0) || pos < get_irn_arity(irn));
655 assert(!(pos < 0) || -(pos + 1) <= a->max_reg_data);
660 void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg)
662 be_req_t *r = get_req(irn, pos);
664 r->kind = be_req_kind_single_reg;
665 r->x.single_reg = reg;
666 r->req.limited = be_limited;
667 r->req.limited_env = r;
668 r->req.type = arch_register_req_type_limited;
669 r->req.cls = reg->reg_class;
672 void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req)
674 be_req_t *r = get_req(irn, pos);
676 assert(arch_register_req_is(req, limited));
678 r->kind = be_req_kind_old_limited;
679 r->req.limited = be_limited;
680 r->req.limited_env = r;
681 r->req.type = arch_register_req_type_limited;
682 r->req.cls = req->cls;
684 r->x.old_limited.old_limited = req->limited;
685 r->x.old_limited.old_limited_env = req->limited_env;
688 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
690 be_req_t *r = get_req(irn, pos);
694 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
696 be_req_t *r = get_req(irn, pos);
698 if(r->req.type == arch_register_req_type_none)
699 r->req.type = arch_register_req_type_normal;
702 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
704 be_req_t *r = get_req(irn, pos);
708 void be_set_IncSP_offset(ir_node *irn, unsigned offset)
710 be_stack_attr_t *a = get_irn_attr(irn);
711 assert(be_is_IncSP(irn));
715 unsigned be_get_IncSP_offset(const ir_node *irn)
717 be_stack_attr_t *a = get_irn_attr(irn);
718 assert(be_is_IncSP(irn));
722 void be_set_IncSP_direction(ir_node *irn, be_stack_dir_t dir)
724 be_stack_attr_t *a = get_irn_attr(irn);
725 assert(be_is_IncSP(irn));
729 be_stack_dir_t be_get_IncSP_direction(const ir_node *irn)
731 be_stack_attr_t *a = get_irn_attr(irn);
732 assert(be_is_IncSP(irn));
736 void be_set_Spill_entity(ir_node *irn, entity *ent)
738 be_spill_attr_t *a = get_irn_attr(irn);
739 assert(be_is_Spill(irn));
740 a->frame_attr.ent = ent;
743 static ir_node *find_a_spill_walker(ir_node *irn, unsigned visited_nr)
745 unsigned nr = get_irn_visited(irn);
747 set_irn_visited(irn, visited_nr);
751 if(nr < visited_nr) {
752 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
753 ir_node *n = find_a_spill_walker(get_irn_n(irn, i), visited_nr);
760 else if(be_get_irn_opcode(irn) == beo_Spill)
766 ir_node *be_get_Spill_context(const ir_node *irn) {
767 const be_spill_attr_t *a = get_irn_attr(irn);
768 assert(be_is_Spill(irn));
773 * Finds a spill for a reload.
774 * If the reload is directly using the spill, this is simple,
775 * else we perform DFS from the reload (over all PhiMs) and return
776 * the first spill node we find.
778 static INLINE ir_node *find_a_spill(const ir_node *irn)
780 ir_graph *irg = get_irn_irg(irn);
781 unsigned visited_nr = get_irg_visited(irg) + 1;
783 assert(be_is_Reload(irn));
784 set_irg_visited(irg, visited_nr);
785 return find_a_spill_walker(be_get_Reload_mem(irn), visited_nr);
788 entity *be_get_spill_entity(const ir_node *irn)
790 int opc = get_irn_opcode(irn);
792 switch(be_get_irn_opcode(irn)) {
795 ir_node *spill = find_a_spill(irn);
796 return be_get_spill_entity(spill);
800 be_spill_attr_t *a = get_irn_attr(irn);
801 return a->frame_attr.ent;
804 assert(0 && "Must give spill/reload node");
811 static void link_reload_walker(ir_node *irn, void *data)
813 ir_node **root = (ir_node **) data;
814 if(be_is_Reload(irn)) {
815 set_irn_link(irn, *root);
820 void be_copy_entities_to_reloads(ir_graph *irg)
823 irg_walk_graph(irg, link_reload_walker, NULL, (void *) &irn);
826 be_frame_attr_t *a = get_irn_attr(irn);
827 entity *ent = be_get_spill_entity(irn);
829 irn = get_irn_link(irn);
833 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx)
835 ir_node *bl = get_nodes_block(irn);
836 ir_graph *irg = get_irn_irg(bl);
837 ir_node *frame = get_irg_frame(irg);
838 ir_node *insert = bl;
841 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
842 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
844 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn, ctx);
847 * search the right insertion point. a spill of a phi cannot be put
848 * directly after the phi, if there are some phis behind the one which
849 * is spilled. Also, a spill of a Proj must be after all Projs of the
852 * Here's one special case:
853 * If the spill is in the start block, the spill must be after the frame
854 * pointer is set up. This is done by setting insert to the end of the block
855 * which is its default initialization (see above).
858 insert = sched_next(irn);
859 if(bl == get_irg_start_block(irg) && insert != bl && sched_get_time_step(frame) >= sched_get_time_step(insert))
860 insert = sched_next(frame);
862 while((is_Phi(insert) || is_Proj(insert)) && !sched_is_end(insert))
863 insert = sched_next(insert);
865 sched_add_before(insert, spill);
869 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)
873 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
874 ir_graph *irg = get_irn_irg(bl);
875 ir_node *frame = get_irg_frame(irg);
876 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
878 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
880 reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
882 if(is_Block(insert)) {
883 insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
884 sched_add_after(insert, reload);
888 sched_add_before(insert, reload);
895 | _ \ ___ __ _ | _ \ ___ __ _ ___
896 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
897 | _ < __/ (_| | | _ < __/ (_| \__ \
898 |_| \_\___|\__, | |_| \_\___|\__, |___/
904 static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int out_pos)
906 const be_node_attr_t *a = get_irn_attr(irn);
908 if(out_pos < a->max_reg_data) {
909 memcpy(req, &a->reg_data[out_pos].req, sizeof(req[0]));
911 if(be_is_Copy(irn)) {
912 req->type |= arch_register_req_type_should_be_same;
913 req->other_same = get_irn_n(irn, be_pos_Copy_orig);
917 req->type = arch_register_req_type_none;
924 static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos)
926 const be_node_attr_t *a = get_irn_attr(irn);
927 int n = get_irn_arity(irn);
929 if(pos < get_irn_arity(irn) && pos < a->max_reg_data)
930 memcpy(req, &a->reg_data[pos].in_req, sizeof(req[0]));
932 req->type = arch_register_req_type_none;
939 static const arch_register_req_t *
940 be_node_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_node *irn, int pos)
945 if(get_irn_mode(irn) == mode_T)
948 out_pos = redir_proj((const ir_node **) &irn, pos);
949 assert(is_be_node(irn));
950 return put_out_reg_req(req, irn, out_pos);
954 return is_be_node(irn) ? put_in_reg_req(req, irn, pos) : NULL;
960 const arch_register_t *
961 be_node_get_irn_reg(const void *_self, const ir_node *irn)
966 out_pos = redir_proj((const ir_node **) &irn, -1);
967 a = get_irn_attr(irn);
969 assert(is_be_node(irn));
970 assert(out_pos < a->max_reg_data && "position too high");
972 return a->reg_data[out_pos].reg;
975 static arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn)
977 redir_proj((const ir_node **) &irn, -1);
979 switch(be_get_irn_opcode(irn)) {
980 #define XXX(a,b) case beo_ ## a: return arch_irn_class_ ## b;
993 static arch_irn_flags_t be_node_get_flags(const void *_self, const ir_node *irn)
998 out_pos = redir_proj((const ir_node **) &irn, -1);
999 a = get_irn_attr(irn);
1001 assert(is_be_node(irn));
1002 assert(out_pos < a->max_reg_data && "position too high");
1004 return a->reg_data[out_pos].req.flags;
1007 static entity *be_node_get_frame_entity(const void *self, const ir_node *irn)
1009 return be_get_frame_entity(irn);
1012 static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset)
1014 if(be_has_frame_entity(irn)) {
1015 be_frame_attr_t *a = get_irn_attr(irn);
1021 ___ ____ _ _ _ _ _ _
1022 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1023 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1024 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1025 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1029 static const arch_irn_ops_if_t be_node_irn_ops_if = {
1030 be_node_get_irn_reg_req,
1031 be_node_set_irn_reg,
1032 be_node_get_irn_reg,
1035 be_node_get_frame_entity,
1036 be_node_set_frame_offset
1039 static const arch_irn_ops_t be_node_irn_ops = {
1043 const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
1045 redir_proj((const ir_node **) &irn, -1);
1046 return is_be_node(irn) ? &be_node_irn_ops : NULL;
1049 const arch_irn_handler_t be_node_irn_handler = {
1054 ____ _ _ ___ ____ _ _ _ _ _ _
1055 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1056 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1057 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1058 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1063 arch_irn_handler_t irn_handler;
1064 arch_irn_ops_t irn_ops;
1065 const arch_env_t *arch_env;
1069 #define get_phi_handler_from_handler(h) container_of(h, phi_handler_t, irn_handler)
1070 #define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops)
1072 static const void *phi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn)
1074 const phi_handler_t *h = get_phi_handler_from_handler(handler);
1075 return is_Phi(irn) && mode_is_datab(get_irn_mode(irn)) ? &h->irn_ops : NULL;
1079 * Get register class of a Phi.
1082 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)
1084 int n = get_irn_arity(phi);
1089 if(*visited && pset_find_ptr(*visited, phi))
1092 for(i = 0; i < n; ++i) {
1093 op = get_irn_n(phi, i);
1095 return arch_get_register_req(h->arch_env, req, op, BE_OUT_POS(0));
1099 The operands of that Phi were all Phis themselves.
1100 We have to start a DFS for a non-Phi argument now.
1103 *visited = pset_new_ptr(16);
1105 pset_insert_ptr(*visited, phi);
1107 for(i = 0; i < n; ++i) {
1108 op = get_irn_n(phi, i);
1109 if(get_Phi_reg_req_recursive(h, req, op, visited))
1116 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)
1118 phi_handler_t *phi_handler = get_phi_handler_from_ops(self);
1119 pset *visited = NULL;
1121 get_Phi_reg_req_recursive(phi_handler, req, irn, &visited);
1122 /* Set the requirements type to normal, since an operand of the Phi could have had constraints. */
1123 req->type = arch_register_req_type_normal;
1130 static void phi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1132 phi_handler_t *h = get_phi_handler_from_ops(self);
1133 pmap_insert(h->regs, irn, (void *) reg);
1136 static const arch_register_t *phi_get_irn_reg(const void *self, const ir_node *irn)
1138 phi_handler_t *h = get_phi_handler_from_ops(self);
1139 return pmap_get(h->regs, (void *) irn);
1142 static arch_irn_class_t phi_classify(const void *_self, const ir_node *irn)
1144 return arch_irn_class_normal;
1147 static arch_irn_flags_t phi_get_flags(const void *_self, const ir_node *irn)
1149 return arch_irn_flags_none;
1152 static entity *phi_get_frame_entity(const void *_self, const ir_node *irn)
1157 static void phi_set_frame_offset(const void *_self, ir_node *irn, int bias)
1161 static const arch_irn_ops_if_t phi_irn_ops = {
1162 phi_get_irn_reg_req,
1167 phi_get_frame_entity,
1168 phi_set_frame_offset
1171 static const arch_irn_handler_t phi_irn_handler = {
1175 arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env)
1177 phi_handler_t *h = xmalloc(sizeof(h[0]));
1178 h->irn_handler.get_irn_ops = phi_get_irn_ops;
1179 h->irn_ops.impl = &phi_irn_ops;
1180 h->arch_env = arch_env;
1181 h->regs = pmap_create();
1182 return (arch_irn_handler_t *) h;
1185 void be_phi_handler_free(arch_irn_handler_t *handler)
1187 phi_handler_t *h = (void *) handler;
1188 pmap_destroy(h->regs);
1192 const void *be_phi_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
1194 phi_handler_t *phi_handler = get_phi_handler_from_handler(self);
1195 return is_Phi(irn) ? &phi_handler->irn_ops : NULL;
1198 void be_phi_handler_reset(arch_irn_handler_t *handler)
1200 phi_handler_t *h = get_phi_handler_from_handler(handler);
1202 pmap_destroy(h->regs);
1203 h->regs = pmap_create();
1209 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1210 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1211 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1212 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1217 * Dumps a register requirement to a file.
1219 static void dump_node_req(FILE *f, int idx, be_req_t *req)
1222 int did_something = 0;
1224 const char *prefix = buf;
1226 snprintf(buf, sizeof(buf), "#%d ", idx);
1228 if(req->flags != arch_irn_flags_none) {
1229 fprintf(f, "%sflags: ", prefix);
1231 for(i = arch_irn_flags_none; i <= log2_ceil(arch_irn_flags_last); ++i) {
1232 if(req->flags & (1 << i)) {
1233 fprintf(f, "%s%s", prefix, arch_irn_flag_str(1 << i));
1241 if(req->req.cls != 0) {
1244 arch_register_req_format(tmp, sizeof(tmp), &req->req);
1245 fprintf(f, "%s", tmp);
1254 * Dumps node register requirements to a file.
1256 static void dump_node_reqs(FILE *f, ir_node *irn)
1259 be_node_attr_t *a = get_irn_attr(irn);
1261 fprintf(f, "registers: \n");
1262 for(i = 0; i < a->max_reg_data; ++i) {
1263 be_reg_data_t *rd = &a->reg_data[i];
1265 fprintf(f, "#%d: %s\n", i, rd->reg->name);
1268 fprintf(f, "in requirements\n");
1269 for(i = 0; i < a->max_reg_data; ++i) {
1270 dump_node_req(f, i, &a->reg_data[i].in_req);
1273 fprintf(f, "\nout requirements\n");
1274 for(i = 0; i < a->max_reg_data; ++i) {
1275 dump_node_req(f, i, &a->reg_data[i].req);
1280 * ir_op-Operation: dump a be node to file
1282 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1284 be_node_attr_t *at = get_irn_attr(irn);
1286 assert(is_be_node(irn));
1289 case dump_node_opcode_txt:
1290 fprintf(f, get_op_name(get_irn_op(irn)));
1292 case dump_node_mode_txt:
1293 fprintf(f, get_mode_name(get_irn_mode(irn)));
1295 case dump_node_nodeattr_txt:
1297 case dump_node_info_txt:
1298 dump_node_reqs(f, irn);
1300 if(be_has_frame_entity(irn)) {
1301 be_frame_attr_t *a = (be_frame_attr_t *) at;
1303 ir_fprintf(f, "frame entity: %+F offset %x (%d)\n", a->ent, a->offset, a->offset);
1307 switch(be_get_irn_opcode(irn)) {
1310 be_spill_attr_t *a = (be_spill_attr_t *) at;
1311 ir_fprintf(f, "spill context: %+F\n", a->spill_ctx);
1317 be_stack_attr_t *a = (be_stack_attr_t *) at;
1318 fprintf(f, "offset: %u\n", a->offset);
1319 fprintf(f, "direction: %s\n", a->dir == be_stack_dir_expand ? "expand" : "shrink");
1330 * Copies the backend specific attributes from old node to new node.
1332 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1334 be_node_attr_t *old_attr = get_irn_attr(old_node);
1335 be_node_attr_t *new_attr = get_irn_attr(new_node);
1338 assert(is_be_node(old_node));
1339 assert(is_be_node(new_node));
1341 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1342 new_attr->reg_data = NULL;
1344 if(new_attr->max_reg_data > 0) {
1345 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(get_irn_irg(new_node)), new_attr->max_reg_data);
1346 memcpy(new_attr->reg_data, old_attr->reg_data, new_attr->max_reg_data * sizeof(be_reg_data_t));
1348 for(i = 0; i < old_attr->max_reg_data; ++i) {
1351 r = &new_attr->reg_data[i].req;
1352 r->req.limited_env = r;
1354 r = &new_attr->reg_data[i].in_req;
1355 r->req.limited_env = r;
1360 static const ir_op_ops be_node_op_ops = {