4 * @author Sebastian Hack
6 * Backend node support.
8 * This file provdies Perm, Copy, Spill and Reload nodes.
10 * Copyright (C) 2005 Universitaet Karlsruhe
11 * Released under the GPL
26 #include "bitfiddle.h"
37 #include "besched_t.h"
42 #define OUT_POS(x) (-((x) + 1))
44 /* Sometimes we want to put const nodes into get_irn_generic_attr ... */
45 #define get_irn_attr(irn) get_irn_generic_attr((ir_node *) (irn))
47 static unsigned be_node_tag = FOURCC('B', 'E', 'N', 'O');
50 typedef enum _node_kind_t {
61 be_req_kind_old_limited,
62 be_req_kind_negate_old_limited,
63 be_req_kind_single_reg
67 arch_register_req_t req;
69 arch_irn_flags_t flags;
72 void (*old_limited)(void *ptr, bitset_t *bs);
73 void *old_limited_env;
76 const arch_register_t *single_reg;
81 const arch_register_t *reg;
88 be_reg_data_t *reg_data;
92 be_node_attr_t node_attr;
93 int offset; /**< The offset by which the stack shall be increased/decreased. */
94 be_stack_dir_t dir; /**< The direction in which the stack shall be modified (along or in the other direction). */
98 be_node_attr_t node_attr;
104 be_node_attr_t node_attr;
109 be_frame_attr_t frame_attr;
110 ir_node *spill_ctx; /**< The node in whose context this spill was introduced. */
118 ir_op *op_be_CopyKeep;
124 ir_op *op_be_RegParams;
125 ir_op *op_be_StackParam;
126 ir_op *op_be_FrameAddr;
127 ir_op *op_be_FrameLoad;
128 ir_op *op_be_FrameStore;
129 ir_op *op_be_Barrier;
131 static int beo_base = -1;
133 static const ir_op_ops be_node_op_ops;
135 #define N irop_flag_none
136 #define L irop_flag_labeled
137 #define C irop_flag_commutative
138 #define X irop_flag_cfopcode
139 #define I irop_flag_ip_cfopcode
140 #define F irop_flag_fragile
141 #define Y irop_flag_forking
142 #define H irop_flag_highlevel
143 #define c irop_flag_constlike
144 #define K irop_flag_keep
146 void be_node_init(void) {
147 static int inited = 0;
154 /* Acquire all needed opcodes. */
155 beo_base = get_next_ir_opcodes(beo_Last - 1);
157 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);
158 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);
159 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);
160 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);
161 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);
162 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);
163 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);
164 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);
165 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);
166 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);
167 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);
168 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);
169 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);
170 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);
171 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);
172 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);
173 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);
175 set_op_tag(op_be_Spill, &be_node_tag);
176 set_op_tag(op_be_Reload, &be_node_tag);
177 set_op_tag(op_be_Perm, &be_node_tag);
178 set_op_tag(op_be_Copy, &be_node_tag);
179 set_op_tag(op_be_Keep, &be_node_tag);
180 set_op_tag(op_be_CopyKeep, &be_node_tag);
181 set_op_tag(op_be_Call, &be_node_tag);
182 set_op_tag(op_be_Return, &be_node_tag);
183 set_op_tag(op_be_AddSP, &be_node_tag);
184 set_op_tag(op_be_SetSP, &be_node_tag);
185 set_op_tag(op_be_IncSP, &be_node_tag);
186 set_op_tag(op_be_RegParams, &be_node_tag);
187 set_op_tag(op_be_StackParam, &be_node_tag);
188 set_op_tag(op_be_FrameLoad, &be_node_tag);
189 set_op_tag(op_be_FrameStore, &be_node_tag);
190 set_op_tag(op_be_FrameAddr, &be_node_tag);
191 set_op_tag(op_be_Barrier, &be_node_tag);
194 static void *init_node_attr(ir_node* irn, int max_reg_data)
196 ir_graph *irg = get_irn_irg(irn);
197 be_node_attr_t *a = get_irn_attr(irn);
199 memset(a, 0, sizeof(get_op_attr_size(get_irn_op(irn))));
200 a->max_reg_data = max_reg_data;
203 if(max_reg_data > 0) {
206 a->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(irg), max_reg_data);
207 memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
208 for(i = 0; i < max_reg_data; ++i) {
209 a->reg_data[i].req.req.cls = NULL;
210 a->reg_data[i].req.req.type = arch_register_req_type_none;
217 static INLINE int is_be_node(const ir_node *irn)
219 return get_op_tag(get_irn_op(irn)) == &be_node_tag;
222 be_opcode_t be_get_irn_opcode(const ir_node *irn)
224 return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp;
227 static int redir_proj(const ir_node **node, int pos)
229 const ir_node *n = *node;
234 assert(pos == -1 && "Illegal pos for a Proj");
235 *node = irn = get_Proj_pred(n);
237 assert(get_irn_mode(irn) == mode_T);
238 *node = get_Proj_pred(irn);
240 return get_Proj_proj(n);
247 be_node_set_irn_reg(const void *_self, ir_node *irn, const arch_register_t *reg)
252 out_pos = redir_proj((const ir_node **) &irn, -1);
253 a = get_irn_attr(irn);
255 assert(is_be_node(irn));
256 assert(out_pos < a->max_reg_data && "position too high");
257 a->reg_data[out_pos].reg = reg;
261 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)
269 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
270 a = init_node_attr(res, 2);
271 a->frame_attr.ent = NULL;
272 a->frame_attr.offset = 0;
275 be_node_set_reg_class(res, 0, cls_frame);
276 be_node_set_reg_class(res, 1, cls);
280 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)
287 res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in);
288 init_node_attr(res, 2);
289 be_node_set_reg_class(res, 0, cls_frame);
290 be_node_set_reg_class(res, -1, cls);
294 ir_node *(be_get_Reload_mem)(const ir_node *irn)
296 assert(be_is_Reload(irn));
297 return get_irn_n(irn, be_pos_Reload_mem);
300 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
303 ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in);
304 init_node_attr(irn, n);
305 for(i = 0; i < n; ++i) {
306 be_node_set_reg_class(irn, i, cls);
307 be_node_set_reg_class(irn, OUT_POS(i), cls);
313 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
319 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
320 init_node_attr(res, 1);
321 be_node_set_reg_class(res, 0, cls);
322 be_node_set_reg_class(res, OUT_POS(0), cls);
326 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
331 irn = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, n, in);
332 init_node_attr(irn, n);
333 for(i = 0; i < n; ++i) {
334 be_node_set_reg_class(irn, i, cls);
340 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[])
346 real_in = malloc(sizeof(real_in[0]) * (real_n));
351 memcpy(&real_in[3], in, n * sizeof(in[0]));
353 irn = new_ir_node(NULL, irg, bl, op_be_Call, mode_T, real_n, real_in);
354 init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
358 entity *be_Call_get_entity(const ir_node *call)
360 be_call_attr_t *a = get_irn_attr(call);
361 assert(be_is_Call(call));
365 void be_Call_set_entity(ir_node *call, entity *ent)
367 be_call_attr_t *a = get_irn_attr(call);
368 assert(be_is_Call(call));
372 ir_node *be_new_Return(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
374 ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Return, mode_X, n, in);
375 init_node_attr(irn, n);
380 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)
388 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, 2, in);
389 a = init_node_attr(irn, 1);
393 be_node_set_flags(irn, -1, arch_irn_flags_ignore);
395 /* Set output constraint to stack register. */
396 be_node_set_reg_class(irn, 0, sp->reg_class);
397 be_set_constr_single_reg(irn, -1, sp);
398 be_node_set_irn_reg(NULL, irn, sp);
403 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
407 ir_node *in[be_pos_AddSP_last];
409 in[be_pos_AddSP_old_sp] = old_sp;
410 in[be_pos_AddSP_size] = sz;
412 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
413 a = init_node_attr(irn, be_pos_AddSP_last);
415 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore);
417 /* Set output constraint to stack register. */
418 be_set_constr_single_reg(irn, OUT_POS(0), sp);
423 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)
432 irn = new_ir_node(NULL, irg, bl, op_be_SetSP, get_irn_mode(old_sp), 3, in);
433 a = init_node_attr(irn, 3);
435 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore);
437 /* Set output constraint to stack register. */
438 be_set_constr_single_reg(irn, OUT_POS(0), sp);
439 be_node_set_reg_class(irn, 1, sp->reg_class);
440 be_node_set_reg_class(irn, 2, sp->reg_class);
441 be_node_set_irn_reg(NULL, irn, sp);
446 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)
452 in[0] = frame_pointer;
453 irn = new_ir_node(NULL, irg, bl, op_be_StackParam, mode, 1, in);
454 a = init_node_attr(irn, 1);
457 be_node_set_reg_class(irn, 0, cls_frame);
458 be_node_set_reg_class(irn, OUT_POS(0), cls);
462 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
467 irn = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, in);
468 init_node_attr(irn, n_outs);
472 ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
473 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, entity *ent)
481 irn = new_ir_node(NULL, irg, bl, op_be_FrameLoad, mode_T, 2, in);
482 a = init_node_attr(irn, 3);
485 be_node_set_reg_class(irn, 1, cls_frame);
486 be_node_set_reg_class(irn, OUT_POS(pn_Load_res), cls_data);
490 ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
491 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, entity *ent)
500 irn = new_ir_node(NULL, irg, bl, op_be_FrameStore, mode_T, 3, in);
501 a = init_node_attr(irn, 3);
504 be_node_set_reg_class(irn, 1, cls_frame);
505 be_node_set_reg_class(irn, 2, cls_data);
509 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, entity *ent)
516 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
517 a = init_node_attr(irn, 1);
520 be_node_set_reg_class(irn, 0, cls_frame);
521 be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
525 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)
528 ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0]));
531 memcpy(&in[1], in_keep, n * sizeof(in[0]));
532 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
533 init_node_attr(irn, n);
534 be_node_set_reg_class(irn, OUT_POS(0), cls);
535 be_node_set_reg_class(irn, 0, cls);
540 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)
545 return be_new_CopyKeep(cls, irg, bl, src, 1, in, mode);
548 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
552 irn = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, n, in);
553 init_node_attr(irn, n);
557 int be_is_Spill (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill ; }
558 int be_is_Reload (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Reload ; }
559 int be_is_Copy (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Copy ; }
560 int be_is_Perm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Perm ; }
561 int be_is_Keep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Keep ; }
562 int be_is_Call (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Call ; }
563 int be_is_Return (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Return ; }
564 int be_is_IncSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_IncSP ; }
565 int be_is_SetSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SetSP ; }
566 int be_is_AddSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_AddSP ; }
567 int be_is_RegParams (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_RegParams ; }
568 int be_is_StackParam (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_StackParam ; }
569 int be_is_FrameAddr (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameAddr ; }
570 int be_is_FrameLoad (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameLoad ; }
571 int be_is_FrameStore (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameStore ; }
572 int be_is_Barrier (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Barrier ; }
574 int be_has_frame_entity(const ir_node *irn)
576 switch(be_get_irn_opcode(irn)) {
589 entity *be_get_frame_entity(const ir_node *irn)
591 if(be_has_frame_entity(irn)) {
592 be_frame_attr_t *a = get_irn_attr(irn);
598 static void be_limited(void *data, bitset_t *bs)
600 be_req_t *req = data;
603 case be_req_kind_negate_old_limited:
604 case be_req_kind_old_limited:
605 req->x.old_limited.old_limited(req->x.old_limited.old_limited_env, bs);
606 if(req->kind == be_req_kind_negate_old_limited)
609 case be_req_kind_single_reg:
610 bitset_clear_all(bs);
611 bitset_set(bs, req->x.single_reg->index);
616 static INLINE be_req_t *get_req(ir_node *irn, int pos)
618 int idx = pos < 0 ? -(pos + 1) : pos;
619 be_node_attr_t *a = get_irn_attr(irn);
620 be_reg_data_t *rd = &a->reg_data[idx];
621 be_req_t *r = pos < 0 ? &rd->req : &rd->in_req;
623 assert(is_be_node(irn));
624 assert(!(pos >= 0) || pos < get_irn_arity(irn));
625 assert(!(pos < 0) || -(pos + 1) <= a->max_reg_data);
630 void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg)
632 be_req_t *r = get_req(irn, pos);
634 r->kind = be_req_kind_single_reg;
635 r->x.single_reg = reg;
636 r->req.limited = be_limited;
637 r->req.limited_env = r;
638 r->req.type = arch_register_req_type_limited;
639 r->req.cls = reg->reg_class;
642 void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req)
644 be_req_t *r = get_req(irn, pos);
646 assert(arch_register_req_is(req, limited));
648 r->kind = be_req_kind_old_limited;
649 r->req.limited = be_limited;
650 r->req.limited_env = r;
651 r->req.type = arch_register_req_type_limited;
652 r->req.cls = req->cls;
654 r->x.old_limited.old_limited = req->limited;
655 r->x.old_limited.old_limited_env = req->limited_env;
658 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
660 be_req_t *r = get_req(irn, pos);
664 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
666 be_req_t *r = get_req(irn, pos);
668 if(r->req.type == arch_register_req_type_none)
669 r->req.type = arch_register_req_type_normal;
672 void be_set_IncSP_offset(ir_node *irn, unsigned offset)
674 be_stack_attr_t *a = get_irn_attr(irn);
675 assert(be_is_IncSP(irn));
679 unsigned be_get_IncSP_offset(const ir_node *irn)
681 be_stack_attr_t *a = get_irn_attr(irn);
682 assert(be_is_IncSP(irn));
686 void be_set_IncSP_direction(ir_node *irn, be_stack_dir_t dir)
688 be_stack_attr_t *a = get_irn_attr(irn);
689 assert(be_is_IncSP(irn));
693 be_stack_dir_t be_get_IncSP_direction(const ir_node *irn)
695 be_stack_attr_t *a = get_irn_attr(irn);
696 assert(be_is_IncSP(irn));
700 void be_set_Spill_entity(ir_node *irn, entity *ent)
702 be_spill_attr_t *a = get_irn_attr(irn);
703 assert(be_is_Spill(irn));
704 a->frame_attr.ent = ent;
707 static ir_node *find_a_spill_walker(ir_node *irn, unsigned visited_nr)
709 unsigned nr = get_irn_visited(irn);
711 set_irn_visited(irn, visited_nr);
715 if(nr < visited_nr) {
716 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
717 ir_node *n = find_a_spill_walker(get_irn_n(irn, i), visited_nr);
724 else if(be_get_irn_opcode(irn) == beo_Spill)
730 ir_node *be_get_Spill_context(const ir_node *irn) {
731 const be_spill_attr_t *a = get_irn_attr(irn);
732 assert(be_is_Spill(irn));
737 * Finds a spill for a reload.
738 * If the reload is directly using the spill, this is simple,
739 * else we perform DFS from the reload (over all PhiMs) and return
740 * the first spill node we find.
742 static INLINE ir_node *find_a_spill(const ir_node *irn)
744 ir_graph *irg = get_irn_irg(irn);
745 unsigned visited_nr = get_irg_visited(irg) + 1;
747 assert(be_is_Reload(irn));
748 set_irg_visited(irg, visited_nr);
749 return find_a_spill_walker(be_get_Reload_mem(irn), visited_nr);
752 entity *be_get_spill_entity(const ir_node *irn)
754 int opc = get_irn_opcode(irn);
756 switch(be_get_irn_opcode(irn)) {
759 ir_node *spill = find_a_spill(irn);
760 return be_get_spill_entity(spill);
764 be_spill_attr_t *a = get_irn_attr(irn);
765 return a->frame_attr.ent;
768 assert(0 && "Must give spill/reload node");
775 static void link_reload_walker(ir_node *irn, void *data)
777 ir_node **root = (ir_node **) data;
778 if(be_is_Reload(irn)) {
779 set_irn_link(irn, *root);
784 void be_copy_entities_to_reloads(ir_graph *irg)
787 irg_walk_graph(irg, link_reload_walker, NULL, (void *) &irn);
790 be_frame_attr_t *a = get_irn_attr(irn);
791 entity *ent = be_get_spill_entity(irn);
793 irn = get_irn_link(irn);
797 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx)
799 ir_node *bl = get_nodes_block(irn);
800 ir_graph *irg = get_irn_irg(bl);
801 ir_node *frame = get_irg_frame(irg);
805 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
806 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
808 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn, ctx);
811 * search the right insertion point. a spill of a phi cannot be put
812 * directly after the phi, if there are some phis behind the one which
813 * is spilled. Also, a spill of a Proj must be after all Projs of the
816 insert = sched_next(irn);
817 while((is_Phi(insert) || is_Proj(insert)) && !sched_is_end(insert))
818 insert = sched_next(insert);
821 * Here's one special case:
822 * If the spill is in the start block, the spill must be after the frame
823 * pointer is set up. This is checked here and fixed.
824 * If the insertion point is already the block, everything is fine, since
825 * the Spill gets inserted at the end of the block.
827 if(bl == get_irg_start_block(irg) && insert != bl && sched_comes_after(insert, frame))
828 insert = sched_next(frame);
830 sched_add_before(insert, spill);
834 ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *reloader, ir_mode *mode, ir_node *spill)
838 ir_node *bl = is_Block(reloader) ? reloader : get_nodes_block(reloader);
839 ir_graph *irg = get_irn_irg(bl);
840 ir_node *frame = get_irg_frame(irg);
841 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
843 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
845 reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
847 sched_add_before(reloader, reload);
851 static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int out_pos)
853 const be_node_attr_t *a = get_irn_attr(irn);
855 if(out_pos < a->max_reg_data)
856 memcpy(req, &a->reg_data[out_pos].req, sizeof(req[0]));
858 req->type = arch_register_req_type_none;
865 static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos)
867 const be_node_attr_t *a = get_irn_attr(irn);
868 int n = get_irn_arity(irn);
870 if(pos < get_irn_arity(irn) && pos < a->max_reg_data)
871 memcpy(req, &a->reg_data[pos].in_req, sizeof(req[0]));
873 req->type = arch_register_req_type_none;
880 static const arch_register_req_t *
881 be_node_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_node *irn, int pos)
886 if(get_irn_mode(irn) == mode_T)
889 out_pos = redir_proj((const ir_node **) &irn, pos);
890 assert(is_be_node(irn));
891 return put_out_reg_req(req, irn, out_pos);
895 return is_be_node(irn) ? put_in_reg_req(req, irn, pos) : NULL;
901 const arch_register_t *
902 be_node_get_irn_reg(const void *_self, const ir_node *irn)
907 out_pos = redir_proj((const ir_node **) &irn, -1);
908 a = get_irn_attr(irn);
910 assert(is_be_node(irn));
911 assert(out_pos < a->max_reg_data && "position too high");
913 return a->reg_data[out_pos].reg;
916 static arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn)
918 redir_proj((const ir_node **) &irn, -1);
920 switch(be_get_irn_opcode(irn)) {
921 #define XXX(a,b) case beo_ ## a: return arch_irn_class_ ## b;
934 static arch_irn_flags_t be_node_get_flags(const void *_self, const ir_node *irn)
939 out_pos = redir_proj((const ir_node **) &irn, -1);
940 a = get_irn_attr(irn);
942 assert(is_be_node(irn));
943 assert(out_pos < a->max_reg_data && "position too high");
945 return a->reg_data[out_pos].req.flags;
948 static entity *be_node_get_frame_entity(const void *self, const ir_node *irn)
950 return be_get_frame_entity(irn);
953 static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset)
955 if(be_has_frame_entity(irn)) {
956 be_frame_attr_t *a = get_irn_attr(irn);
962 static const arch_irn_ops_if_t be_node_irn_ops_if = {
963 be_node_get_irn_reg_req,
968 be_node_get_frame_entity,
969 be_node_set_frame_offset
972 static const arch_irn_ops_t be_node_irn_ops = {
976 const void *be_node_get_arch_ops(const arch_irn_handler_t *self, const ir_node *irn)
978 redir_proj((const ir_node **) &irn, -1);
979 return is_be_node(irn) ? &be_node_irn_ops : NULL;
982 const arch_irn_handler_t be_node_irn_handler = {
987 static void dump_node_req(FILE *f, int idx, be_req_t *req)
990 int did_something = 0;
992 const char *prefix = buf;
994 snprintf(buf, sizeof(buf), "#%d ", idx);
996 if(req->flags != arch_irn_flags_none) {
997 fprintf(f, "%sflags: ", prefix);
999 for(i = arch_irn_flags_none; i <= log2_ceil(arch_irn_flags_last); ++i) {
1000 if(req->flags & (1 << i)) {
1001 fprintf(f, "%s%s", prefix, arch_irn_flag_str(1 << i));
1009 if(req->req.cls != 0) {
1012 arch_register_req_format(tmp, sizeof(tmp), &req->req);
1013 fprintf(f, "%s", tmp);
1021 static void dump_node_reqs(FILE *f, ir_node *irn)
1024 be_node_attr_t *a = get_irn_attr(irn);
1026 fprintf(f, "registers: \n");
1027 for(i = 0; i < a->max_reg_data; ++i) {
1028 be_reg_data_t *rd = &a->reg_data[i];
1030 fprintf(f, "#%d: %s\n", i, rd->reg->name);
1033 fprintf(f, "in requirements\n");
1034 for(i = 0; i < a->max_reg_data; ++i) {
1035 dump_node_req(f, i, &a->reg_data[i].in_req);
1038 fprintf(f, "\nout requirements\n");
1039 for(i = 0; i < a->max_reg_data; ++i) {
1040 dump_node_req(f, i, &a->reg_data[i].req);
1044 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1046 be_node_attr_t *at = get_irn_attr(irn);
1048 assert(is_be_node(irn));
1051 case dump_node_opcode_txt:
1052 fprintf(f, get_op_name(get_irn_op(irn)));
1054 case dump_node_mode_txt:
1055 fprintf(f, get_mode_name(get_irn_mode(irn)));
1057 case dump_node_nodeattr_txt:
1059 case dump_node_info_txt:
1060 dump_node_reqs(f, irn);
1062 if(be_has_frame_entity(irn)) {
1063 be_frame_attr_t *a = (be_frame_attr_t *) at;
1065 ir_fprintf(f, "frame entity: %+F offset %x (%d)\n", a->ent, a->offset, a->offset);
1069 switch(be_get_irn_opcode(irn)) {
1072 be_spill_attr_t *a = (be_spill_attr_t *) at;
1073 ir_fprintf(f, "spill context: %+F\n", a->spill_ctx);
1079 be_stack_attr_t *a = (be_stack_attr_t *) at;
1080 fprintf(f, "offset: %u\n", a->offset);
1081 fprintf(f, "direction: %s\n", a->dir == be_stack_dir_along ? "along" : "against");
1092 * Copies the backend specific attributes from old node to new node.
1094 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1096 be_node_attr_t *old_attr = get_irn_attr(old_node);
1097 be_node_attr_t *new_attr = get_irn_attr(new_node);
1100 assert(is_be_node(old_node));
1101 assert(is_be_node(new_node));
1103 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1104 new_attr->reg_data = NULL;
1106 if(new_attr->max_reg_data > 0) {
1107 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(get_irn_irg(new_node)), new_attr->max_reg_data);
1108 memcpy(new_attr->reg_data, old_attr->reg_data, new_attr->max_reg_data * sizeof(be_reg_data_t));
1110 for(i = 0; i < old_attr->max_reg_data; ++i) {
1113 r = &new_attr->reg_data[i].req;
1114 r->req.limited_env = r;
1116 r = &new_attr->reg_data[i].in_req;
1117 r->req.limited_env = r;
1122 static const ir_op_ops be_node_op_ops = {
1138 pset *nodes_live_at(const arch_env_t *arch_env, const arch_register_class_t *cls, const ir_node *pos, pset *live)
1140 firm_dbg_module_t *dbg = firm_dbg_register("firm.be.node");
1141 const ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
1145 live_foreach(bl, li) {
1146 ir_node *irn = (ir_node *) li->irn;
1147 if(live_is_end(li) && arch_irn_consider_in_reg_alloc(arch_env, cls, irn))
1148 pset_insert_ptr(live, irn);
1151 sched_foreach_reverse(bl, irn) {
1156 * If we encounter the node we want to insert the Perm after,
1157 * exit immediately, so that this node is still live
1162 DBG((dbg, LEVEL_1, "%+F\n", irn));
1163 for(x = pset_first(live); x; x = pset_next(live))
1164 DBG((dbg, LEVEL_1, "\tlive: %+F\n", x));
1166 if(arch_irn_consider_in_reg_alloc(arch_env, cls, irn))
1167 pset_remove_ptr(live, irn);
1169 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
1170 ir_node *op = get_irn_n(irn, i);
1172 if(arch_irn_consider_in_reg_alloc(arch_env, cls, op))
1173 pset_insert_ptr(live, op);
1180 ir_node *insert_Perm_after(const arch_env_t *arch_env,
1181 const arch_register_class_t *cls,
1182 dom_front_info_t *dom_front,
1185 ir_node *bl = is_Block(pos) ? pos : get_nodes_block(pos);
1186 ir_graph *irg = get_irn_irg(bl);
1187 pset *live = pset_new_ptr_default();
1188 firm_dbg_module_t *dbg = firm_dbg_register("be.node");
1190 ir_node *curr, *irn, *perm, **nodes;
1193 DBG((dbg, LEVEL_1, "Insert Perm after: %+F\n", pos));
1195 if(!nodes_live_at(arch_env, cls, pos, live));
1197 n = pset_count(live);
1202 nodes = malloc(n * sizeof(nodes[0]));
1204 DBG((dbg, LEVEL_1, "live:\n"));
1205 for(irn = pset_first(live), i = 0; irn; irn = pset_next(live), i++) {
1206 DBG((dbg, LEVEL_1, "\t%+F\n", irn));
1210 perm = be_new_Perm(cls, irg, bl, n, nodes);
1211 sched_add_after(pos, perm);
1215 for(i = 0; i < n; ++i) {
1217 ir_node *perm_op = get_irn_n(perm, i);
1218 const arch_register_t *reg = arch_get_irn_register(arch_env, perm_op);
1220 ir_mode *mode = get_irn_mode(perm_op);
1221 ir_node *proj = new_r_Proj(irg, bl, perm, mode, i);
1222 arch_set_irn_register(arch_env, proj, reg);
1224 sched_add_after(curr, proj);
1227 copies[0] = perm_op;
1229 be_ssa_constr(dom_front, 2, copies);