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_Return nodes attribute type. */
95 be_node_attr_t node_attr;
96 int num_ret_vals; /**< number of return values */
99 /** The be_Stack attribute type. */
101 be_node_attr_t node_attr;
102 int offset; /**< The offset by which the stack shall be increased/decreased. */
103 be_stack_dir_t dir; /**< The direction in which the stack shall be modified (expand or shrink). */
106 /** The be_Frame attribute type. */
108 be_node_attr_t node_attr;
113 /** The be_Call attribute type. */
115 be_node_attr_t node_attr;
116 entity *ent; /**< The called entity if this is a static call. */
117 ir_type *call_tp; /**< The call type, copied from the original Call node. */
120 /** The be_Spill attribute type. */
122 be_frame_attr_t frame_attr;
123 ir_node *spill_ctx; /**< The node in whose context this spill was introduced. */
131 ir_op *op_be_CopyKeep;
137 ir_op *op_be_RegParams;
138 ir_op *op_be_StackParam;
139 ir_op *op_be_FrameAddr;
140 ir_op *op_be_FrameLoad;
141 ir_op *op_be_FrameStore;
142 ir_op *op_be_Barrier;
144 static int beo_base = -1;
146 static const ir_op_ops be_node_op_ops;
148 #define N irop_flag_none
149 #define L irop_flag_labeled
150 #define C irop_flag_commutative
151 #define X irop_flag_cfopcode
152 #define I irop_flag_ip_cfopcode
153 #define F irop_flag_fragile
154 #define Y irop_flag_forking
155 #define H irop_flag_highlevel
156 #define c irop_flag_constlike
157 #define K irop_flag_keep
158 #define M irop_flag_machine
161 void be_node_init(void) {
162 static int inited = 0;
169 /* Acquire all needed opcodes. */
170 beo_base = get_next_ir_opcodes(beo_Last - 1);
172 op_be_Spill = new_ir_op(beo_base + beo_Spill, "be_Spill", op_pin_state_mem_pinned, N, oparity_unary, 0, sizeof(be_spill_attr_t), &be_node_op_ops);
173 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);
174 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);
175 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);
176 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);
177 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);
178 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);
179 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);
180 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);
181 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);
182 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);
183 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);
184 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);
185 op_be_FrameAddr = new_ir_op(beo_base + beo_FrameAddr, "be_FrameAddr", op_pin_state_pinned, N, oparity_binary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
186 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);
187 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);
188 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);
190 set_op_tag(op_be_Spill, &be_node_tag);
191 set_op_tag(op_be_Reload, &be_node_tag);
192 set_op_tag(op_be_Perm, &be_node_tag);
193 set_op_tag(op_be_Copy, &be_node_tag);
194 set_op_tag(op_be_Keep, &be_node_tag);
195 set_op_tag(op_be_CopyKeep, &be_node_tag);
196 set_op_tag(op_be_Call, &be_node_tag);
197 set_op_tag(op_be_Return, &be_node_tag);
198 set_op_tag(op_be_AddSP, &be_node_tag);
199 set_op_tag(op_be_SetSP, &be_node_tag);
200 set_op_tag(op_be_IncSP, &be_node_tag);
201 set_op_tag(op_be_RegParams, &be_node_tag);
202 set_op_tag(op_be_StackParam, &be_node_tag);
203 set_op_tag(op_be_FrameLoad, &be_node_tag);
204 set_op_tag(op_be_FrameStore, &be_node_tag);
205 set_op_tag(op_be_FrameAddr, &be_node_tag);
206 set_op_tag(op_be_Barrier, &be_node_tag);
210 * Initializes the generic attribute of all be nodes and return ir.
212 static void *init_node_attr(ir_node* irn, int max_reg_data)
214 ir_graph *irg = get_irn_irg(irn);
215 be_node_attr_t *a = get_irn_attr(irn);
217 memset(a, 0, sizeof(get_op_attr_size(get_irn_op(irn))));
218 a->max_reg_data = max_reg_data;
221 if(max_reg_data > 0) {
224 a->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(irg), max_reg_data);
225 memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
226 for(i = 0; i < max_reg_data; ++i) {
227 a->reg_data[i].req.req.cls = NULL;
228 a->reg_data[i].req.req.type = arch_register_req_type_none;
235 static INLINE int is_be_node(const ir_node *irn)
237 return get_op_tag(get_irn_op(irn)) == &be_node_tag;
240 be_opcode_t be_get_irn_opcode(const ir_node *irn)
242 return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp;
245 static int redir_proj(const ir_node **node, int pos)
247 const ir_node *n = *node;
252 assert(pos == -1 && "Illegal pos for a Proj");
253 *node = irn = get_Proj_pred(n);
255 assert(get_irn_mode(irn) == mode_T);
256 *node = get_Proj_pred(irn);
258 return get_Proj_proj(n);
265 be_node_set_irn_reg(const void *_self, ir_node *irn, const arch_register_t *reg)
270 out_pos = redir_proj((const ir_node **) &irn, -1);
271 a = get_irn_attr(irn);
273 assert(is_be_node(irn));
274 assert(out_pos < a->max_reg_data && "position too high");
275 a->reg_data[out_pos].reg = reg;
279 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)
287 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
288 a = init_node_attr(res, 2);
289 a->frame_attr.ent = NULL;
290 a->frame_attr.offset = 0;
293 be_node_set_reg_class(res, 0, cls_frame);
294 be_node_set_reg_class(res, 1, cls);
298 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)
305 res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in);
306 init_node_attr(res, 2);
307 be_node_set_reg_class(res, 0, cls_frame);
308 be_node_set_reg_class(res, -1, cls);
312 ir_node *(be_get_Reload_mem)(const ir_node *irn)
314 assert(be_is_Reload(irn));
315 return get_irn_n(irn, be_pos_Reload_mem);
318 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
321 ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in);
322 init_node_attr(irn, n);
323 for(i = 0; i < n; ++i) {
324 be_node_set_reg_class(irn, i, cls);
325 be_node_set_reg_class(irn, OUT_POS(i), cls);
331 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
337 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
338 init_node_attr(res, 1);
339 be_node_set_reg_class(res, 0, cls);
340 be_node_set_reg_class(res, OUT_POS(0), cls);
344 ir_node *be_get_Copy_op(const ir_node *cpy) {
345 return get_irn_n(cpy, be_pos_Copy_op);
348 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
353 irn = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, n, in);
354 init_node_attr(irn, n);
355 for(i = 0; i < n; ++i) {
356 be_node_set_reg_class(irn, i, cls);
362 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
363 int n_outs, int n, ir_node *in[], ir_type *call_tp)
366 int real_n = be_pos_Call_first_arg + n;
370 NEW_ARR_A(ir_node *, real_in, real_n);
371 real_in[be_pos_Call_mem] = mem;
372 real_in[be_pos_Call_sp] = sp;
373 real_in[be_pos_Call_ptr] = ptr;
374 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
376 irn = new_ir_node(NULL, irg, bl, op_be_Call, mode_T, real_n, real_in);
377 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
379 a->call_tp = call_tp;
383 /* Gets the call entity or NULL if this is no static call. */
384 entity *be_Call_get_entity(const ir_node *call) {
385 be_call_attr_t *a = get_irn_attr(call);
386 assert(be_is_Call(call));
390 /* Sets the call entity. */
391 void be_Call_set_entity(ir_node *call, entity *ent) {
392 be_call_attr_t *a = get_irn_attr(call);
393 assert(be_is_Call(call));
397 /* Gets the call type. */
398 ir_type *be_Call_get_type(ir_node *call) {
399 be_call_attr_t *a = get_irn_attr(call);
400 assert(be_is_Call(call));
404 /* Sets the call type. */
405 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
406 be_call_attr_t *a = get_irn_attr(call);
407 assert(be_is_Call(call));
408 a->call_tp = call_tp;
411 /* Construct a new be_Return. */
412 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *bl, int n_res, int n, ir_node *in[])
415 ir_node *irn = new_ir_node(dbg, irg, bl, op_be_Return, mode_X, n, in);
416 init_node_attr(irn, n);
417 a = get_irn_attr(irn);
418 a->num_ret_vals = n_res;
423 /* Returns the number of real returns values */
424 int be_Return_get_n_rets(ir_node *ret)
426 be_return_attr_t *a = get_irn_attr(ret);
427 return a->num_ret_vals;
430 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)
438 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, 2, in);
439 a = init_node_attr(irn, 1);
443 be_node_set_flags(irn, -1, arch_irn_flags_ignore);
445 /* Set output constraint to stack register. */
446 be_node_set_reg_class(irn, 0, sp->reg_class);
447 be_set_constr_single_reg(irn, -1, sp);
448 be_node_set_irn_reg(NULL, irn, sp);
453 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
457 ir_node *in[be_pos_AddSP_last];
459 in[be_pos_AddSP_old_sp] = old_sp;
460 in[be_pos_AddSP_size] = sz;
462 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
463 a = init_node_attr(irn, be_pos_AddSP_last);
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);
473 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)
482 irn = new_ir_node(NULL, irg, bl, op_be_SetSP, get_irn_mode(old_sp), 3, in);
483 a = init_node_attr(irn, 3);
485 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore);
487 /* Set output constraint to stack register. */
488 be_set_constr_single_reg(irn, OUT_POS(0), sp);
489 be_node_set_reg_class(irn, 1, sp->reg_class);
490 be_node_set_reg_class(irn, 2, sp->reg_class);
491 be_node_set_irn_reg(NULL, irn, sp);
496 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)
502 in[0] = frame_pointer;
503 irn = new_ir_node(NULL, irg, bl, op_be_StackParam, mode, 1, in);
504 a = init_node_attr(irn, 1);
507 be_node_set_reg_class(irn, 0, cls_frame);
508 be_node_set_reg_class(irn, OUT_POS(0), cls);
512 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
517 irn = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, in);
518 init_node_attr(irn, n_outs);
522 ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
523 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, entity *ent)
531 irn = new_ir_node(NULL, irg, bl, op_be_FrameLoad, mode_T, 2, in);
532 a = init_node_attr(irn, 3);
535 be_node_set_reg_class(irn, 1, cls_frame);
536 be_node_set_reg_class(irn, OUT_POS(pn_Load_res), cls_data);
540 ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
541 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, entity *ent)
550 irn = new_ir_node(NULL, irg, bl, op_be_FrameStore, mode_T, 3, in);
551 a = init_node_attr(irn, 3);
554 be_node_set_reg_class(irn, 1, cls_frame);
555 be_node_set_reg_class(irn, 2, cls_data);
559 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, entity *ent)
566 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
567 a = init_node_attr(irn, 1);
570 be_node_set_reg_class(irn, 0, cls_frame);
571 be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
575 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)
578 ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0]));
581 memcpy(&in[1], in_keep, n * sizeof(in[0]));
582 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
583 init_node_attr(irn, n + 1);
584 be_node_set_reg_class(irn, OUT_POS(0), cls);
585 be_node_set_reg_class(irn, 0, cls);
590 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)
595 return be_new_CopyKeep(cls, irg, bl, src, 1, in, mode);
598 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
602 irn = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, n, in);
603 init_node_attr(irn, n);
607 int be_is_Spill (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill ; }
608 int be_is_Reload (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Reload ; }
609 int be_is_Copy (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Copy ; }
610 int be_is_CopyKeep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_CopyKeep ; }
611 int be_is_Perm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Perm ; }
612 int be_is_Keep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Keep ; }
613 int be_is_Call (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Call ; }
614 int be_is_Return (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Return ; }
615 int be_is_IncSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_IncSP ; }
616 int be_is_SetSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SetSP ; }
617 int be_is_AddSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_AddSP ; }
618 int be_is_RegParams (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_RegParams ; }
619 int be_is_StackParam (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_StackParam ; }
620 int be_is_FrameAddr (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameAddr ; }
621 int be_is_FrameLoad (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameLoad ; }
622 int be_is_FrameStore (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameStore ; }
623 int be_is_Barrier (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Barrier ; }
625 int be_has_frame_entity(const ir_node *irn)
627 switch(be_get_irn_opcode(irn)) {
640 entity *be_get_frame_entity(const ir_node *irn)
642 if(be_has_frame_entity(irn)) {
643 be_frame_attr_t *a = get_irn_attr(irn);
649 static void be_limited(void *data, bitset_t *bs)
651 be_req_t *req = data;
654 case be_req_kind_negate_old_limited:
655 case be_req_kind_old_limited:
656 req->x.old_limited.old_limited(req->x.old_limited.old_limited_env, bs);
657 if(req->kind == be_req_kind_negate_old_limited)
660 case be_req_kind_single_reg:
661 bitset_clear_all(bs);
662 bitset_set(bs, req->x.single_reg->index);
667 static INLINE be_req_t *get_req(ir_node *irn, int pos)
669 int idx = pos < 0 ? -(pos + 1) : pos;
670 be_node_attr_t *a = get_irn_attr(irn);
671 be_reg_data_t *rd = &a->reg_data[idx];
672 be_req_t *r = pos < 0 ? &rd->req : &rd->in_req;
674 assert(is_be_node(irn));
675 assert(!(pos >= 0) || pos < get_irn_arity(irn));
676 assert(!(pos < 0) || -(pos + 1) <= a->max_reg_data);
681 void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg)
683 be_req_t *r = get_req(irn, pos);
685 r->kind = be_req_kind_single_reg;
686 r->x.single_reg = reg;
687 r->req.limited = be_limited;
688 r->req.limited_env = r;
689 r->req.type = arch_register_req_type_limited;
690 r->req.cls = reg->reg_class;
693 void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req)
695 be_req_t *r = get_req(irn, pos);
697 assert(arch_register_req_is(req, limited));
699 r->kind = be_req_kind_old_limited;
700 r->req.limited = be_limited;
701 r->req.limited_env = r;
702 r->req.type = arch_register_req_type_limited;
703 r->req.cls = req->cls;
705 r->x.old_limited.old_limited = req->limited;
706 r->x.old_limited.old_limited_env = req->limited_env;
709 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
711 be_req_t *r = get_req(irn, pos);
715 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
717 be_req_t *r = get_req(irn, pos);
719 if(r->req.type == arch_register_req_type_none)
720 r->req.type = arch_register_req_type_normal;
723 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
725 be_req_t *r = get_req(irn, pos);
729 ir_node *be_get_IncSP_pred(ir_node *irn) {
730 assert(be_is_IncSP(irn));
731 return get_irn_n(irn, 0);
734 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
735 assert(be_is_IncSP(incsp));
736 set_irn_n(incsp, 0, pred);
739 ir_node *be_get_IncSP_mem(ir_node *irn) {
740 assert(be_is_IncSP(irn));
741 return get_irn_n(irn, 1);
744 void be_set_IncSP_offset(ir_node *irn, unsigned offset)
746 be_stack_attr_t *a = get_irn_attr(irn);
747 assert(be_is_IncSP(irn));
751 unsigned be_get_IncSP_offset(const ir_node *irn)
753 be_stack_attr_t *a = get_irn_attr(irn);
754 assert(be_is_IncSP(irn));
758 void be_set_IncSP_direction(ir_node *irn, be_stack_dir_t dir)
760 be_stack_attr_t *a = get_irn_attr(irn);
761 assert(be_is_IncSP(irn));
765 be_stack_dir_t be_get_IncSP_direction(const ir_node *irn)
767 be_stack_attr_t *a = get_irn_attr(irn);
768 assert(be_is_IncSP(irn));
772 void be_set_Spill_entity(ir_node *irn, entity *ent)
774 be_spill_attr_t *a = get_irn_attr(irn);
775 assert(be_is_Spill(irn));
776 a->frame_attr.ent = ent;
779 static ir_node *find_a_spill_walker(ir_node *irn, unsigned visited_nr)
781 unsigned nr = get_irn_visited(irn);
783 set_irn_visited(irn, visited_nr);
787 if(nr < visited_nr) {
788 for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
789 ir_node *n = find_a_spill_walker(get_irn_n(irn, i), visited_nr);
796 else if(be_get_irn_opcode(irn) == beo_Spill)
802 ir_node *be_get_Spill_context(const ir_node *irn) {
803 const be_spill_attr_t *a = get_irn_attr(irn);
804 assert(be_is_Spill(irn));
809 * Finds a spill for a reload.
810 * If the reload is directly using the spill, this is simple,
811 * else we perform DFS from the reload (over all PhiMs) and return
812 * the first spill node we find.
814 static INLINE ir_node *find_a_spill(const ir_node *irn)
816 ir_graph *irg = get_irn_irg(irn);
817 unsigned visited_nr = get_irg_visited(irg) + 1;
819 assert(be_is_Reload(irn));
820 set_irg_visited(irg, visited_nr);
821 return find_a_spill_walker(be_get_Reload_mem(irn), visited_nr);
824 entity *be_get_spill_entity(const ir_node *irn)
826 switch(be_get_irn_opcode(irn)) {
829 ir_node *spill = find_a_spill(irn);
830 return be_get_spill_entity(spill);
834 be_spill_attr_t *a = get_irn_attr(irn);
835 return a->frame_attr.ent;
838 assert(0 && "Must give spill/reload node");
845 static void link_reload_walker(ir_node *irn, void *data)
847 ir_node **root = (ir_node **) data;
848 if(be_is_Reload(irn)) {
849 set_irn_link(irn, *root);
854 void be_copy_entities_to_reloads(ir_graph *irg)
857 irg_walk_graph(irg, link_reload_walker, NULL, (void *) &irn);
860 be_frame_attr_t *a = get_irn_attr(irn);
861 entity *ent = be_get_spill_entity(irn);
863 irn = get_irn_link(irn);
867 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx)
869 ir_node *bl = get_nodes_block(irn);
870 ir_graph *irg = get_irn_irg(bl);
871 ir_node *frame = get_irg_frame(irg);
872 ir_node *insert = bl;
875 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
876 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
878 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn, ctx);
881 * search the right insertion point. a spill of a phi cannot be put
882 * directly after the phi, if there are some phis behind the one which
883 * is spilled. Also, a spill of a Proj must be after all Projs of the
886 * Here's one special case:
887 * If the spill is in the start block, the spill must be after the frame
888 * pointer is set up. This is done by setting insert to the end of the block
889 * which is its default initialization (see above).
892 insert = sched_next(irn);
893 if(insert != bl && bl == get_irg_start_block(irg) && sched_get_time_step(frame) >= sched_get_time_step(insert))
894 insert = sched_next(frame);
896 while((is_Phi(insert) || is_Proj(insert)) && !sched_is_end(insert))
897 insert = sched_next(insert);
899 sched_add_before(insert, spill);
903 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)
907 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
908 ir_graph *irg = get_irn_irg(bl);
909 ir_node *frame = get_irg_frame(irg);
910 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
912 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
914 reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
916 if(is_Block(insert)) {
917 insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
918 sched_add_after(insert, reload);
922 sched_add_before(insert, reload);
929 | _ \ ___ __ _ | _ \ ___ __ _ ___
930 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
931 | _ < __/ (_| | | _ < __/ (_| \__ \
932 |_| \_\___|\__, | |_| \_\___|\__, |___/
938 static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int out_pos)
940 const be_node_attr_t *a = get_irn_attr(irn);
942 if(out_pos < a->max_reg_data) {
943 memcpy(req, &a->reg_data[out_pos].req, sizeof(req[0]));
945 if(be_is_Copy(irn)) {
946 req->type |= arch_register_req_type_should_be_same;
947 req->other_same = be_get_Copy_op(irn);
951 req->type = arch_register_req_type_none;
958 static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos)
960 const be_node_attr_t *a = get_irn_attr(irn);
962 if(pos < get_irn_arity(irn) && pos < a->max_reg_data)
963 memcpy(req, &a->reg_data[pos].in_req, sizeof(req[0]));
965 req->type = arch_register_req_type_none;
972 static const arch_register_req_t *
973 be_node_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_node *irn, int pos)
978 if(get_irn_mode(irn) == mode_T)
981 out_pos = redir_proj((const ir_node **) &irn, pos);
982 assert(is_be_node(irn));
983 return put_out_reg_req(req, irn, out_pos);
987 return is_be_node(irn) ? put_in_reg_req(req, irn, pos) : NULL;
993 const arch_register_t *
994 be_node_get_irn_reg(const void *_self, const ir_node *irn)
999 out_pos = redir_proj((const ir_node **) &irn, -1);
1000 a = get_irn_attr(irn);
1002 assert(is_be_node(irn));
1003 assert(out_pos < a->max_reg_data && "position too high");
1005 return a->reg_data[out_pos].reg;
1008 static arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn)
1010 redir_proj((const ir_node **) &irn, -1);
1012 switch(be_get_irn_opcode(irn)) {
1013 #define XXX(a,b) case beo_ ## a: return arch_irn_class_ ## b
1015 XXX(Reload, reload);
1018 XXX(Return, branch);
1027 static arch_irn_flags_t be_node_get_flags(const void *_self, const ir_node *irn)
1032 out_pos = redir_proj((const ir_node **) &irn, -1);
1033 a = get_irn_attr(irn);
1035 assert(is_be_node(irn));
1036 assert(out_pos < a->max_reg_data && "position too high");
1038 return a->reg_data[out_pos].req.flags;
1041 static entity *be_node_get_frame_entity(const void *self, const ir_node *irn)
1043 return be_get_frame_entity(irn);
1046 static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset)
1048 if(be_has_frame_entity(irn)) {
1049 be_frame_attr_t *a = get_irn_attr(irn);
1055 ___ ____ _ _ _ _ _ _
1056 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1057 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1058 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1059 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1063 static const arch_irn_ops_if_t be_node_irn_ops_if = {
1064 be_node_get_irn_reg_req,
1065 be_node_set_irn_reg,
1066 be_node_get_irn_reg,
1069 be_node_get_frame_entity,
1070 be_node_set_frame_offset
1073 static const arch_irn_ops_t be_node_irn_ops = {
1077 const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
1079 redir_proj((const ir_node **) &irn, -1);
1080 return is_be_node(irn) ? &be_node_irn_ops : NULL;
1083 const arch_irn_handler_t be_node_irn_handler = {
1088 ____ _ _ ___ ____ _ _ _ _ _ _
1089 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1090 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1091 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1092 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1097 arch_irn_handler_t irn_handler;
1098 arch_irn_ops_t irn_ops;
1099 const arch_env_t *arch_env;
1103 #define get_phi_handler_from_handler(h) container_of(h, phi_handler_t, irn_handler)
1104 #define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops)
1106 static const void *phi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn)
1108 const phi_handler_t *h = get_phi_handler_from_handler(handler);
1109 return is_Phi(irn) && mode_is_datab(get_irn_mode(irn)) ? &h->irn_ops : NULL;
1113 * Get register class of a Phi.
1116 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)
1118 int n = get_irn_arity(phi);
1122 if(*visited && pset_find_ptr(*visited, phi))
1125 for(i = 0; i < n; ++i) {
1126 op = get_irn_n(phi, i);
1128 return arch_get_register_req(h->arch_env, req, op, BE_OUT_POS(0));
1132 The operands of that Phi were all Phis themselves.
1133 We have to start a DFS for a non-Phi argument now.
1136 *visited = pset_new_ptr(16);
1138 pset_insert_ptr(*visited, phi);
1140 for(i = 0; i < n; ++i) {
1141 op = get_irn_n(phi, i);
1142 if(get_Phi_reg_req_recursive(h, req, op, visited))
1149 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)
1151 phi_handler_t *phi_handler = get_phi_handler_from_ops(self);
1152 pset *visited = NULL;
1154 get_Phi_reg_req_recursive(phi_handler, req, irn, &visited);
1155 /* Set the requirements type to normal, since an operand of the Phi could have had constraints. */
1156 req->type = arch_register_req_type_normal;
1163 static void phi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1165 phi_handler_t *h = get_phi_handler_from_ops(self);
1166 pmap_insert(h->regs, irn, (void *) reg);
1169 static const arch_register_t *phi_get_irn_reg(const void *self, const ir_node *irn)
1171 phi_handler_t *h = get_phi_handler_from_ops(self);
1172 return pmap_get(h->regs, (void *) irn);
1175 static arch_irn_class_t phi_classify(const void *_self, const ir_node *irn)
1177 return arch_irn_class_normal;
1180 static arch_irn_flags_t phi_get_flags(const void *_self, const ir_node *irn)
1182 return arch_irn_flags_none;
1185 static entity *phi_get_frame_entity(const void *_self, const ir_node *irn)
1190 static void phi_set_frame_offset(const void *_self, ir_node *irn, int bias)
1194 static const arch_irn_ops_if_t phi_irn_ops = {
1195 phi_get_irn_reg_req,
1200 phi_get_frame_entity,
1201 phi_set_frame_offset
1204 static const arch_irn_handler_t phi_irn_handler = {
1208 arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env)
1210 phi_handler_t *h = xmalloc(sizeof(h[0]));
1211 h->irn_handler.get_irn_ops = phi_get_irn_ops;
1212 h->irn_ops.impl = &phi_irn_ops;
1213 h->arch_env = arch_env;
1214 h->regs = pmap_create();
1215 return (arch_irn_handler_t *) h;
1218 void be_phi_handler_free(arch_irn_handler_t *handler)
1220 phi_handler_t *h = (void *) handler;
1221 pmap_destroy(h->regs);
1225 const void *be_phi_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
1227 phi_handler_t *phi_handler = get_phi_handler_from_handler(self);
1228 return is_Phi(irn) ? &phi_handler->irn_ops : NULL;
1231 void be_phi_handler_reset(arch_irn_handler_t *handler)
1233 phi_handler_t *h = get_phi_handler_from_handler(handler);
1235 pmap_destroy(h->regs);
1236 h->regs = pmap_create();
1242 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1243 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1244 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1245 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1250 * Dumps a register requirement to a file.
1252 static void dump_node_req(FILE *f, int idx, be_req_t *req)
1255 int did_something = 0;
1257 const char *prefix = buf;
1259 snprintf(buf, sizeof(buf), "#%d ", idx);
1261 if(req->flags != arch_irn_flags_none) {
1262 fprintf(f, "%sflags: ", prefix);
1264 for(i = arch_irn_flags_none; i <= log2_ceil(arch_irn_flags_last); ++i) {
1265 if(req->flags & (1 << i)) {
1266 fprintf(f, "%s%s", prefix, arch_irn_flag_str(1 << i));
1274 if(req->req.cls != 0) {
1277 arch_register_req_format(tmp, sizeof(tmp), &req->req);
1278 fprintf(f, "%s", tmp);
1287 * Dumps node register requirements to a file.
1289 static void dump_node_reqs(FILE *f, ir_node *irn)
1292 be_node_attr_t *a = get_irn_attr(irn);
1294 fprintf(f, "registers: \n");
1295 for(i = 0; i < a->max_reg_data; ++i) {
1296 be_reg_data_t *rd = &a->reg_data[i];
1298 fprintf(f, "#%d: %s\n", i, rd->reg->name);
1301 fprintf(f, "in requirements\n");
1302 for(i = 0; i < a->max_reg_data; ++i) {
1303 dump_node_req(f, i, &a->reg_data[i].in_req);
1306 fprintf(f, "\nout requirements\n");
1307 for(i = 0; i < a->max_reg_data; ++i) {
1308 dump_node_req(f, i, &a->reg_data[i].req);
1313 * ir_op-Operation: dump a be node to file
1315 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1317 be_node_attr_t *at = get_irn_attr(irn);
1319 assert(is_be_node(irn));
1322 case dump_node_opcode_txt:
1323 fprintf(f, get_op_name(get_irn_op(irn)));
1325 case dump_node_mode_txt:
1326 fprintf(f, get_mode_name(get_irn_mode(irn)));
1328 case dump_node_nodeattr_txt:
1330 case dump_node_info_txt:
1331 dump_node_reqs(f, irn);
1333 if(be_has_frame_entity(irn)) {
1334 be_frame_attr_t *a = (be_frame_attr_t *) at;
1336 int bits = get_type_size_bits(get_entity_type(a->ent));
1337 ir_fprintf(f, "frame entity: %+F offset 0x%x (%d) size 0x%x %d\n",
1338 a->ent, a->offset, a->offset, bits, bits);
1343 switch(be_get_irn_opcode(irn)) {
1346 be_spill_attr_t *a = (be_spill_attr_t *) at;
1347 ir_fprintf(f, "spill context: %+F\n", a->spill_ctx);
1353 be_stack_attr_t *a = (be_stack_attr_t *) at;
1354 if (a->offset == BE_STACK_FRAME_SIZE)
1355 fprintf(f, "offset: FRAME_SIZE\n");
1357 fprintf(f, "offset: %u\n", a->offset);
1358 fprintf(f, "direction: %s\n", a->dir == be_stack_dir_expand ? "expand" : "shrink");
1363 be_call_attr_t *a = (be_call_attr_t *) at;
1366 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1378 * Copies the backend specific attributes from old node to new node.
1380 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1382 be_node_attr_t *old_attr = get_irn_attr(old_node);
1383 be_node_attr_t *new_attr = get_irn_attr(new_node);
1386 assert(is_be_node(old_node));
1387 assert(is_be_node(new_node));
1389 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1390 new_attr->reg_data = NULL;
1392 if(new_attr->max_reg_data > 0) {
1393 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, get_irg_obstack(get_irn_irg(new_node)), new_attr->max_reg_data);
1394 memcpy(new_attr->reg_data, old_attr->reg_data, new_attr->max_reg_data * sizeof(be_reg_data_t));
1396 for(i = 0; i < old_attr->max_reg_data; ++i) {
1399 r = &new_attr->reg_data[i].req;
1400 r->req.limited_env = r;
1402 r = &new_attr->reg_data[i].in_req;
1403 r->req.limited_env = r;
1408 static const ir_op_ops be_node_op_ops = {