2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Backend node support for generic backend nodes.
23 * @author Sebastian Hack
26 * Backend node support for generic backend nodes.
27 * This file provides Perm, Copy, Spill and Reload nodes.
40 #include "bitfiddle.h"
41 #include "raw_bitset.h"
52 #include "irbackedge_t.h"
53 #include "irverify_t.h"
63 typedef struct be_node_attr_t {
67 /** The be_Return nodes attribute type. */
70 int num_ret_vals; /**< number of return values */
71 unsigned pop; /**< number of bytes that should be popped */
72 int emit_pop; /**< if set, emit pop bytes, even if pop = 0 */
75 /** The be_IncSP attribute type. */
78 int offset; /**< The offset by which the stack shall be
80 int align; /**< whether stack should be aligned after the
84 /** The be_Frame attribute type. */
91 /** The be_Call attribute type. */
94 ir_entity *ent; /**< called entity if this is a static call. */
96 ir_type *call_tp; /**< call type, copied from the original Call */
101 ir_entity **in_entities;
102 ir_entity **out_entities;
108 ir_op *op_be_MemPerm;
111 ir_op *op_be_CopyKeep;
118 ir_op *op_be_FrameAddr;
121 * Compare the attributes of two be_FrameAddr nodes.
123 * @return zero if both nodes have identically attributes
125 static int FrameAddr_cmp_attr(const ir_node *a, const ir_node *b)
127 const be_frame_attr_t *a_attr = (const be_frame_attr_t*)get_irn_generic_attr_const(a);
128 const be_frame_attr_t *b_attr = (const be_frame_attr_t*)get_irn_generic_attr_const(b);
130 if (a_attr->ent != b_attr->ent || a_attr->offset != b_attr->offset)
133 return be_nodes_equal(a, b);
137 * Compare the attributes of two be_Return nodes.
139 * @return zero if both nodes have identically attributes
141 static int Return_cmp_attr(const ir_node *a, const ir_node *b)
143 const be_return_attr_t *a_attr = (const be_return_attr_t*)get_irn_generic_attr_const(a);
144 const be_return_attr_t *b_attr = (const be_return_attr_t*)get_irn_generic_attr_const(b);
146 if (a_attr->num_ret_vals != b_attr->num_ret_vals)
148 if (a_attr->pop != b_attr->pop)
150 if (a_attr->emit_pop != b_attr->emit_pop)
153 return be_nodes_equal(a, b);
157 * Compare the attributes of two be_IncSP nodes.
159 * @return zero if both nodes have identically attributes
161 static int IncSP_cmp_attr(const ir_node *a, const ir_node *b)
163 const be_incsp_attr_t *a_attr = (const be_incsp_attr_t*)get_irn_generic_attr_const(a);
164 const be_incsp_attr_t *b_attr = (const be_incsp_attr_t*)get_irn_generic_attr_const(b);
166 if (a_attr->offset != b_attr->offset)
169 return be_nodes_equal(a, b);
173 * Compare the attributes of two be_Call nodes.
175 * @return zero if both nodes have identically attributes
177 static int Call_cmp_attr(const ir_node *a, const ir_node *b)
179 const be_call_attr_t *a_attr = (const be_call_attr_t*)get_irn_generic_attr_const(a);
180 const be_call_attr_t *b_attr = (const be_call_attr_t*)get_irn_generic_attr_const(b);
182 if (a_attr->ent != b_attr->ent ||
183 a_attr->call_tp != b_attr->call_tp)
186 return be_nodes_equal(a, b);
189 static arch_register_req_t *allocate_reg_req(ir_graph *const irg)
191 struct obstack *obst = be_get_be_obst(irg);
193 arch_register_req_t *req = OALLOCZ(obst, arch_register_req_t);
197 void be_set_constr_in(ir_node *node, int pos, const arch_register_req_t *req)
199 backend_info_t *info = be_get_info(node);
200 assert(pos < get_irn_arity(node));
201 info->in_reqs[pos] = req;
204 void be_set_constr_out(ir_node *node, int pos, const arch_register_req_t *req)
206 backend_info_t *info = be_get_info(node);
207 info->out_infos[pos].req = req;
211 * Initializes the generic attribute of all be nodes and return it.
213 static void init_node_attr(ir_node *node, int n_inputs, int n_outputs)
215 assert(n_outputs >= 0);
217 ir_graph *irg = get_irn_irg(node);
218 struct obstack *obst = be_get_be_obst(irg);
219 backend_info_t *info = be_get_info(node);
220 const arch_register_req_t **in_reqs;
224 assert(n_inputs == get_irn_arity(node));
225 in_reqs = OALLOCN(obst, const arch_register_req_t*, n_inputs);
226 for (i = 0; i < n_inputs; ++i) {
227 in_reqs[i] = arch_no_register_req;
230 in_reqs = NEW_ARR_F(const arch_register_req_t*, 0);
232 info->in_reqs = in_reqs;
234 info->out_infos = NEW_ARR_DZ(reg_out_info_t, obst, n_outputs);
235 for (int i = 0; i < n_outputs; ++i) {
236 info->out_infos[i].req = arch_no_register_req;
240 static void add_register_req_in(ir_node *node, const arch_register_req_t *req)
242 backend_info_t *info = be_get_info(node);
243 ARR_APP1(const arch_register_req_t*, info->in_reqs, req);
246 ir_node *be_new_Spill(const arch_register_class_t *cls,
247 const arch_register_class_t *cls_frame, ir_node *bl,
248 ir_node *frame, ir_node *to_spill)
253 ir_graph *irg = get_Block_irg(bl);
257 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
258 init_node_attr(res, 2, 1);
259 a = (be_frame_attr_t*) get_irn_generic_attr(res);
262 a->base.exc.pin_state = op_pin_state_pinned;
264 be_node_set_reg_class_in(res, n_be_Spill_frame, cls_frame);
265 be_node_set_reg_class_in(res, n_be_Spill_val, cls);
266 arch_set_irn_register_req_out(res, 0, arch_no_register_req);
267 arch_add_irn_flags(res, arch_irn_flags_spill);
272 ir_node *be_new_Reload(const arch_register_class_t *cls,
273 const arch_register_class_t *cls_frame, ir_node *block,
274 ir_node *frame, ir_node *mem, ir_mode *mode)
278 ir_graph *irg = get_Block_irg(block);
283 res = new_ir_node(NULL, irg, block, op_be_Reload, mode, 2, in);
285 init_node_attr(res, 2, 1);
286 be_node_set_reg_class_out(res, 0, cls);
288 be_node_set_reg_class_in(res, n_be_Reload_frame, cls_frame);
289 arch_set_irn_flags(res, arch_irn_flags_rematerializable);
291 a = (be_frame_attr_t*) get_irn_generic_attr(res);
294 a->base.exc.pin_state = op_pin_state_pinned;
299 ir_node *be_get_Reload_mem(const ir_node *irn)
301 assert(be_is_Reload(irn));
302 return get_irn_n(irn, n_be_Reload_mem);
305 ir_node *be_get_Reload_frame(const ir_node *irn)
307 assert(be_is_Reload(irn));
308 return get_irn_n(irn, n_be_Reload_frame);
311 ir_node *be_get_Spill_val(const ir_node *irn)
313 assert(be_is_Spill(irn));
314 return get_irn_n(irn, n_be_Spill_val);
317 ir_node *be_get_Spill_frame(const ir_node *irn)
319 assert(be_is_Spill(irn));
320 return get_irn_n(irn, n_be_Spill_frame);
323 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_node *block,
324 int n, ir_node *in[])
327 ir_graph *irg = get_Block_irg(block);
328 be_node_attr_t *attr;
330 ir_node *irn = new_ir_node(NULL, irg, block, op_be_Perm, mode_T, n, in);
331 init_node_attr(irn, n, n);
332 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
333 attr->exc.pin_state = op_pin_state_pinned;
334 for (i = 0; i < n; ++i) {
335 const ir_node *input = in[i];
336 const arch_register_req_t *req = arch_get_irn_register_req(input);
337 if (req->width == 1) {
338 be_set_constr_in(irn, i, cls->class_req);
339 be_set_constr_out(irn, i, cls->class_req);
341 arch_register_req_t *const new_req = allocate_reg_req(irg);
343 new_req->type = (req->type & arch_register_req_type_aligned);
344 new_req->width = req->width;
345 be_set_constr_in(irn, i, new_req);
346 be_set_constr_out(irn, i, new_req);
353 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
355 int arity = get_irn_arity(perm);
356 const arch_register_req_t **old_in_reqs
357 = ALLOCAN(const arch_register_req_t*, arity);
358 reg_out_info_t *old_infos = ALLOCAN(reg_out_info_t, arity);
359 backend_info_t *info = be_get_info(perm);
363 assert(be_is_Perm(perm));
364 assert(new_size <= arity);
366 new_in = ALLOCAN(ir_node*, new_size);
368 /* save the old register data */
369 memcpy(old_in_reqs, info->in_reqs, arity * sizeof(old_in_reqs[0]));
370 memcpy(old_infos, info->out_infos, arity * sizeof(old_infos[0]));
372 /* compose the new in array and set the new register data directly */
373 for (i = 0; i < new_size; ++i) {
375 new_in[i] = get_irn_n(perm, idx);
376 info->in_reqs[i] = old_in_reqs[idx];
377 info->out_infos[i] = old_infos[idx];
380 set_irn_in(perm, new_size, new_in);
383 ir_node *be_new_MemPerm(ir_node *block, int n, ir_node *in[])
385 ir_graph *irg = get_Block_irg(block);
386 const arch_env_t *arch_env = be_get_irg_arch_env(irg);
387 ir_node *frame = get_irg_frame(irg);
388 const arch_register_t *sp = arch_env->sp;
390 be_memperm_attr_t *attr;
393 real_in = ALLOCAN(ir_node*, n + 1);
395 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
397 irn = new_ir_node(NULL, irg, block, op_be_MemPerm, mode_T, n+1, real_in);
399 init_node_attr(irn, n + 1, n);
400 be_node_set_reg_class_in(irn, 0, sp->reg_class);
402 attr = (be_memperm_attr_t*)get_irn_generic_attr(irn);
403 attr->in_entities = OALLOCNZ(get_irg_obstack(irg), ir_entity*, n);
404 attr->out_entities = OALLOCNZ(get_irg_obstack(irg), ir_entity*, n);
409 ir_node *be_new_Copy(ir_node *bl, ir_node *op)
413 be_node_attr_t *attr;
414 ir_graph *irg = get_Block_irg(bl);
415 const arch_register_req_t *in_req = arch_get_irn_register_req(op);
416 const arch_register_class_t *cls = in_req->cls;
419 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
420 init_node_attr(res, 1, 1);
421 attr = (be_node_attr_t*) get_irn_generic_attr(res);
422 attr->exc.pin_state = op_pin_state_floats;
423 be_node_set_reg_class_in(res, 0, cls);
424 be_node_set_reg_class_out(res, 0, cls);
426 arch_register_req_t *const req = allocate_reg_req(irg);
428 req->type = arch_register_req_type_should_be_same
429 | (in_req->type & arch_register_req_type_aligned);
430 req->other_same = 1U << 0;
431 req->width = in_req->width;
432 be_set_constr_out(res, 0, req);
437 ir_node *be_get_Copy_op(const ir_node *cpy)
439 return get_irn_n(cpy, n_be_Copy_op);
442 ir_node *be_new_Keep(ir_node *block, int n, ir_node *in[])
446 ir_graph *irg = get_Block_irg(block);
447 be_node_attr_t *attr;
449 res = new_ir_node(NULL, irg, block, op_be_Keep, mode_ANY, -1, NULL);
450 init_node_attr(res, -1, 1);
451 attr = (be_node_attr_t*) get_irn_generic_attr(res);
452 attr->exc.pin_state = op_pin_state_pinned;
454 for (i = 0; i < n; ++i) {
455 ir_node *pred = in[i];
456 add_irn_n(res, pred);
457 const arch_register_req_t *req = arch_get_irn_register_req(pred);
458 req = req->cls != NULL ? req->cls->class_req : arch_no_register_req;
459 add_register_req_in(res, req);
466 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
468 assert(be_is_Keep(keep));
469 add_irn_n(keep, node);
470 add_register_req_in(keep, cls->class_req);
473 ir_node *be_new_Call(dbg_info *dbg, ir_node *bl, ir_node *mem,
474 const arch_register_req_t *sp_req, ir_node *sp,
475 const arch_register_req_t *ptr_req, ir_node *ptr,
476 int n_outs, int n, ir_node *in[], ir_type *call_tp)
479 int real_n = n_be_Call_first_arg + n;
482 NEW_ARR_A(ir_node *, real_in, real_n);
483 real_in[n_be_Call_mem] = mem;
484 real_in[n_be_Call_sp] = sp;
485 real_in[n_be_Call_ptr] = ptr;
486 memcpy(&real_in[n_be_Call_first_arg], in, n * sizeof(in[0]));
488 ir_graph *const irg = get_Block_irg(bl);
489 ir_node *const irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
490 init_node_attr(irn, real_n, n_outs);
491 a = (be_call_attr_t*)get_irn_generic_attr(irn);
493 a->call_tp = call_tp;
495 a->base.exc.pin_state = op_pin_state_pinned;
496 be_set_constr_in(irn, n_be_Call_sp, sp_req);
497 be_set_constr_in(irn, n_be_Call_ptr, ptr_req);
501 ir_entity *be_Call_get_entity(const ir_node *call)
503 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(call);
504 assert(be_is_Call(call));
508 void be_Call_set_entity(ir_node *call, ir_entity *ent)
510 be_call_attr_t *a = (be_call_attr_t*)get_irn_generic_attr(call);
511 assert(be_is_Call(call));
515 ir_type *be_Call_get_type(ir_node *call)
517 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(call);
518 assert(be_is_Call(call));
522 void be_Call_set_type(ir_node *call, ir_type *call_tp)
524 be_call_attr_t *a = (be_call_attr_t*)get_irn_generic_attr(call);
525 assert(be_is_Call(call));
526 a->call_tp = call_tp;
529 void be_Call_set_pop(ir_node *call, unsigned pop)
531 be_call_attr_t *a = (be_call_attr_t*)get_irn_generic_attr(call);
535 unsigned be_Call_get_pop(const ir_node *call)
537 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(call);
541 ir_node *be_new_Return(dbg_info *const dbg, ir_node *const block, int const n_res, unsigned const pop, int const n, ir_node **const in)
543 ir_graph *const irg = get_Block_irg(block);
544 ir_node *const res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, n, in);
545 init_node_attr(res, n, 1);
546 be_set_constr_out(res, 0, arch_no_register_req);
548 be_return_attr_t *const a = (be_return_attr_t*)get_irn_generic_attr(res);
549 a->num_ret_vals = n_res;
552 a->base.exc.pin_state = op_pin_state_pinned;
557 int be_Return_get_n_rets(const ir_node *ret)
559 const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret);
560 return a->num_ret_vals;
563 unsigned be_Return_get_pop(const ir_node *ret)
565 const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret);
569 int be_Return_get_emit_pop(const ir_node *ret)
571 const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret);
575 void be_Return_set_emit_pop(ir_node *ret, int emit_pop)
577 be_return_attr_t *a = (be_return_attr_t*)get_irn_generic_attr(ret);
578 a->emit_pop = emit_pop;
581 ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *bl,
582 ir_node *old_sp, int offset, int align)
587 ir_graph *irg = get_Block_irg(bl);
590 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode,
592 init_node_attr(irn, 1, 1);
593 a = (be_incsp_attr_t*)get_irn_generic_attr(irn);
596 a->base.exc.pin_state = op_pin_state_pinned;
598 /* Set output constraint to stack register. */
599 be_node_set_reg_class_in(irn, 0, sp->reg_class);
600 be_set_constr_single_reg_out(irn, 0, sp, arch_register_req_type_produces_sp);
605 ir_node *be_new_AddSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp,
609 ir_node *in[n_be_AddSP_last];
611 be_node_attr_t *attr;
613 in[n_be_AddSP_old_sp] = old_sp;
614 in[n_be_AddSP_size] = sz;
616 irg = get_Block_irg(bl);
617 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, n_be_AddSP_last, in);
618 init_node_attr(irn, n_be_AddSP_last, pn_be_AddSP_last);
619 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
620 attr->exc.pin_state = op_pin_state_pinned;
622 /* Set output constraint to stack register. */
623 be_set_constr_single_reg_in(irn, n_be_AddSP_old_sp, sp,
624 arch_register_req_type_none);
625 be_node_set_reg_class_in(irn, n_be_AddSP_size, sp->reg_class);
626 be_set_constr_single_reg_out(irn, pn_be_AddSP_sp, sp,
627 arch_register_req_type_produces_sp);
632 ir_node *be_new_SubSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp, ir_node *sz)
635 ir_node *in[n_be_SubSP_last];
637 be_node_attr_t *attr;
639 in[n_be_SubSP_old_sp] = old_sp;
640 in[n_be_SubSP_size] = sz;
642 irg = get_Block_irg(bl);
643 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, n_be_SubSP_last, in);
644 init_node_attr(irn, n_be_SubSP_last, pn_be_SubSP_last);
645 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
646 attr->exc.pin_state = op_pin_state_pinned;
648 /* Set output constraint to stack register. */
649 be_set_constr_single_reg_in(irn, n_be_SubSP_old_sp, sp,
650 arch_register_req_type_none);
651 be_node_set_reg_class_in(irn, n_be_SubSP_size, sp->reg_class);
652 be_set_constr_single_reg_out(irn, pn_be_SubSP_sp, sp, arch_register_req_type_produces_sp);
657 ir_node *be_new_Start(dbg_info *dbgi, ir_node *bl, int n_outs)
660 ir_graph *irg = get_Block_irg(bl);
661 be_node_attr_t *attr;
663 res = new_ir_node(dbgi, irg, bl, op_be_Start, mode_T, 0, NULL);
664 init_node_attr(res, 0, n_outs);
665 attr = (be_node_attr_t*) get_irn_generic_attr(res);
666 attr->exc.pin_state = op_pin_state_pinned;
671 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_node *bl, ir_node *frame, ir_entity *ent)
676 ir_graph *irg = get_Block_irg(bl);
679 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
680 init_node_attr(irn, 1, 1);
681 a = (be_frame_attr_t*)get_irn_generic_attr(irn);
684 a->base.exc.pin_state = op_pin_state_floats;
685 be_node_set_reg_class_in(irn, 0, cls_frame);
686 be_node_set_reg_class_out(irn, 0, cls_frame);
688 return optimize_node(irn);
691 ir_node *be_get_FrameAddr_frame(const ir_node *node)
693 assert(be_is_FrameAddr(node));
694 return get_irn_n(node, n_be_FrameAddr_ptr);
697 ir_entity *be_get_FrameAddr_entity(const ir_node *node)
699 const be_frame_attr_t *attr = (const be_frame_attr_t*)get_irn_generic_attr_const(node);
703 ir_node *be_new_CopyKeep(ir_node *bl, ir_node *src, int n, ir_node *in_keep[])
706 ir_node **in = ALLOCAN(ir_node*, n + 1);
707 ir_graph *irg = get_Block_irg(bl);
708 const arch_register_req_t *req = arch_get_irn_register_req(src);
709 const arch_register_class_t *cls = req->cls;
710 ir_mode *mode = get_irn_mode(src);
711 be_node_attr_t *attr;
714 memcpy(&in[1], in_keep, n * sizeof(in[0]));
715 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
716 init_node_attr(irn, n + 1, 1);
717 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
718 attr->exc.pin_state = op_pin_state_floats;
719 be_node_set_reg_class_in(irn, 0, cls);
720 be_node_set_reg_class_out(irn, 0, cls);
721 for (int i = 0; i < n; ++i) {
722 ir_node *pred = in_keep[i];
723 const arch_register_req_t *req = arch_get_irn_register_req(pred);
724 req = req->cls != NULL ? req->cls->class_req : arch_no_register_req;
725 be_set_constr_in(irn, i+1, req);
731 ir_node *be_new_CopyKeep_single(ir_node *bl, ir_node *src, ir_node *keep)
733 return be_new_CopyKeep(bl, src, 1, &keep);
736 ir_node *be_get_CopyKeep_op(const ir_node *cpy)
738 return get_irn_n(cpy, n_be_CopyKeep_op);
741 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op)
743 set_irn_n(cpy, n_be_CopyKeep_op, op);
746 static bool be_has_frame_entity(const ir_node *irn)
748 switch (get_irn_opcode(irn)) {
758 ir_entity *be_get_frame_entity(const ir_node *irn)
760 if (be_has_frame_entity(irn)) {
761 const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn);
767 int be_get_frame_offset(const ir_node *irn)
769 assert(is_be_node(irn));
770 if (be_has_frame_entity(irn)) {
771 const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn);
777 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
779 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
781 assert(be_is_MemPerm(irn));
782 assert(n < be_get_MemPerm_entity_arity(irn));
784 attr->in_entities[n] = ent;
787 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
789 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
791 assert(be_is_MemPerm(irn));
792 assert(n < be_get_MemPerm_entity_arity(irn));
794 return attr->in_entities[n];
797 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
799 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
801 assert(be_is_MemPerm(irn));
802 assert(n < be_get_MemPerm_entity_arity(irn));
804 attr->out_entities[n] = ent;
807 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
809 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
811 assert(be_is_MemPerm(irn));
812 assert(n < be_get_MemPerm_entity_arity(irn));
814 return attr->out_entities[n];
817 int be_get_MemPerm_entity_arity(const ir_node *irn)
819 return get_irn_arity(irn) - 1;
822 const arch_register_req_t *be_create_reg_req(struct obstack *obst,
823 const arch_register_t *reg, arch_register_req_type_t additional_types)
825 arch_register_req_t *req = OALLOC(obst, arch_register_req_t);
826 const arch_register_class_t *cls = reg->reg_class;
827 unsigned *limited_bitset;
829 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
830 rbitset_set(limited_bitset, reg->index);
832 req->type = arch_register_req_type_limited | additional_types;
834 req->limited = limited_bitset;
839 void be_set_constr_single_reg_in(ir_node *node, int pos,
840 const arch_register_t *reg, arch_register_req_type_t additional_types)
842 const arch_register_req_t *req;
844 if (additional_types == 0) {
845 req = reg->single_req;
847 ir_graph *irg = get_irn_irg(node);
848 struct obstack *obst = be_get_be_obst(irg);
849 req = be_create_reg_req(obst, reg, additional_types);
851 be_set_constr_in(node, pos, req);
854 void be_set_constr_single_reg_out(ir_node *node, int pos,
855 const arch_register_t *reg, arch_register_req_type_t additional_types)
857 ir_graph *irg = get_irn_irg(node);
858 be_irg_t *birg = be_birg_from_irg(irg);
859 const arch_register_req_t *req;
861 /* if we have an ignore register, add ignore flag and just assign it */
862 if (!rbitset_is_set(birg->allocatable_regs, reg->global_index)) {
863 additional_types |= arch_register_req_type_ignore;
866 if (additional_types == 0) {
867 req = reg->single_req;
869 struct obstack *obst = be_get_be_obst(irg);
870 req = be_create_reg_req(obst, reg, additional_types);
873 arch_set_irn_register_out(node, pos, reg);
874 be_set_constr_out(node, pos, req);
877 void be_node_set_reg_class_in(ir_node *irn, int pos,
878 const arch_register_class_t *cls)
880 be_set_constr_in(irn, pos, cls->class_req);
883 void be_node_set_reg_class_out(ir_node *irn, int pos,
884 const arch_register_class_t *cls)
886 be_set_constr_out(irn, pos, cls->class_req);
889 ir_node *be_get_IncSP_pred(ir_node *irn)
891 assert(be_is_IncSP(irn));
892 return get_irn_n(irn, 0);
895 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred)
897 assert(be_is_IncSP(incsp));
898 set_irn_n(incsp, 0, pred);
901 void be_set_IncSP_offset(ir_node *irn, int offset)
903 be_incsp_attr_t *a = (be_incsp_attr_t*)get_irn_generic_attr(irn);
904 assert(be_is_IncSP(irn));
908 int be_get_IncSP_offset(const ir_node *irn)
910 const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
911 assert(be_is_IncSP(irn));
915 int be_get_IncSP_align(const ir_node *irn)
917 const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
918 assert(be_is_IncSP(irn));
922 static ir_entity *be_node_get_frame_entity(const ir_node *irn)
924 return be_get_frame_entity(irn);
927 void be_node_set_frame_entity(ir_node *irn, ir_entity *ent)
931 assert(be_has_frame_entity(irn));
933 a = (be_frame_attr_t*)get_irn_generic_attr(irn);
937 static void be_node_set_frame_offset(ir_node *irn, int offset)
941 if (!be_has_frame_entity(irn))
944 a = (be_frame_attr_t*)get_irn_generic_attr(irn);
948 static int be_node_get_sp_bias(const ir_node *irn)
950 if (be_is_IncSP(irn))
951 return be_get_IncSP_offset(irn);
953 return -(int)be_Call_get_pop(irn);
961 static const arch_irn_ops_t be_node_irn_ops = {
962 be_node_get_frame_entity,
963 be_node_set_frame_offset,
965 NULL, /* get_op_estimated_cost */
966 NULL, /* possible_memory_operand */
967 NULL, /* perform_memory_operand */
970 static int get_start_reg_index(ir_graph *irg, const arch_register_t *reg)
972 ir_node *start = get_irg_start(irg);
974 /* do a naive linear search... */
975 be_foreach_out(start, i) {
976 arch_register_req_t const *const out_req = arch_get_irn_register_req_out(start, i);
977 if (!arch_register_req_is(out_req, limited))
979 if (out_req->cls != reg->reg_class)
981 if (!rbitset_is_set(out_req->limited, reg->index))
985 panic("Tried querying undefined register '%s' at Start", reg->name);
988 ir_node *be_get_initial_reg_value(ir_graph *irg, const arch_register_t *reg)
990 int i = get_start_reg_index(irg, reg);
991 ir_node *start = get_irg_start(irg);
992 ir_mode *mode = arch_register_class_mode(reg->reg_class);
994 foreach_out_edge(start, edge) {
995 ir_node *proj = get_edge_src_irn(edge);
996 if (!is_Proj(proj)) // maybe End/Anchor
998 if (get_Proj_proj(proj) == i) {
1002 return new_r_Proj(start, mode, i);
1005 static ir_entity* dummy_get_frame_entity(const ir_node *node)
1011 static void dummy_set_frame_offset(ir_node *node, int bias)
1015 panic("should not be called");
1018 static int dummy_get_sp_bias(const ir_node *node)
1024 /* for "middleend" nodes */
1025 static const arch_irn_ops_t dummy_be_irn_ops = {
1026 dummy_get_frame_entity,
1027 dummy_set_frame_offset,
1029 NULL, /* get_op_estimated_cost */
1030 NULL, /* possible_memory_operand */
1031 NULL, /* perform_memory_operand */
1036 ir_node *be_new_Phi(ir_node *block, int n_ins, ir_node **ins, ir_mode *mode,
1037 const arch_register_req_t *req)
1039 ir_graph *irg = get_irn_irg(block);
1040 struct obstack *obst = be_get_be_obst(irg);
1041 backend_info_t *info;
1044 ir_node *phi = new_ir_node(NULL, irg, block, op_Phi, mode, n_ins, ins);
1045 phi->attr.phi.u.backedge = new_backedge_arr(get_irg_obstack(irg), n_ins);
1046 info = be_get_info(phi);
1047 info->out_infos = NEW_ARR_DZ(reg_out_info_t, obst, 1);
1048 info->in_reqs = OALLOCN(obst, const arch_register_req_t*, n_ins);
1050 info->out_infos[0].req = req;
1051 for (i = 0; i < n_ins; ++i) {
1052 info->in_reqs[i] = req;
1054 irn_verify_irg(phi, irg);
1055 phi = optimize_node(phi);
1059 void be_set_phi_reg_req(ir_node *node, const arch_register_req_t *req)
1061 int arity = get_irn_arity(node);
1064 backend_info_t *info = be_get_info(node);
1065 info->out_infos[0].req = req;
1066 for (i = 0; i < arity; ++i) {
1067 info->in_reqs[i] = req;
1070 assert(mode_is_datab(get_irn_mode(node)));
1073 void be_dump_phi_reg_reqs(FILE *F, const ir_node *node, dump_reason_t reason)
1075 ir_graph *irg = get_irn_irg(node);
1076 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND))
1080 case dump_node_opcode_txt:
1081 fputs(get_op_name(get_irn_op(node)), F);
1083 case dump_node_mode_txt:
1084 fprintf(F, "%s", get_mode_name(get_irn_mode(node)));
1086 case dump_node_nodeattr_txt:
1088 case dump_node_info_txt:
1089 arch_dump_reqs_and_registers(F, node);
1097 static const arch_irn_ops_t phi_irn_ops = {
1098 dummy_get_frame_entity,
1099 dummy_set_frame_offset,
1101 NULL, /* get_op_estimated_cost */
1102 NULL, /* possible_memory_operand */
1103 NULL, /* perform_memory_operand */
1109 * ir_op-Operation: dump a be node to file
1111 static void dump_node(FILE *f, const ir_node *irn, dump_reason_t reason)
1113 assert(is_be_node(irn));
1116 case dump_node_opcode_txt:
1117 fputs(get_op_name(get_irn_op(irn)), f);
1119 case dump_node_mode_txt:
1120 if (be_is_Copy(irn) || be_is_CopyKeep(irn)) {
1121 fprintf(f, "%s", get_mode_name(get_irn_mode(irn)));
1124 case dump_node_nodeattr_txt:
1125 if (be_is_Call(irn)) {
1126 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(irn);
1128 fprintf(f, " [%s] ", get_entity_name(a->ent));
1130 if (be_is_IncSP(irn)) {
1131 const be_incsp_attr_t *attr = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
1132 fprintf(f, " [%d] ", attr->offset);
1135 case dump_node_info_txt:
1136 arch_dump_reqs_and_registers(f, irn);
1138 if (be_has_frame_entity(irn)) {
1139 const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn);
1141 unsigned size = get_type_size_bytes(get_entity_type(a->ent));
1142 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bytes\n",
1143 a->ent, a->offset, a->offset, size, size);
1148 switch (get_irn_opcode(irn)) {
1150 const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
1151 fprintf(f, "align: %d\n", a->align);
1152 fprintf(f, "offset: %d\n", a->offset);
1156 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(irn);
1159 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1164 for (i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1165 ir_entity *in, *out;
1166 in = be_get_MemPerm_in_entity(irn, i);
1167 out = be_get_MemPerm_out_entity(irn, i);
1169 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1172 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1186 * Copies the backend specific attributes from old node to new node.
1188 static void copy_attr(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1190 const void *old_attr = get_irn_generic_attr_const(old_node);
1191 void *new_attr = get_irn_generic_attr(new_node);
1192 struct obstack *obst = be_get_be_obst(irg);
1193 backend_info_t *old_info = be_get_info(old_node);
1194 backend_info_t *new_info = be_get_info(new_node);
1196 assert(is_be_node(old_node));
1197 assert(is_be_node(new_node));
1199 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1201 new_info->flags = old_info->flags;
1202 new_info->out_infos = old_info->out_infos ? DUP_ARR_D(reg_out_info_t, obst, old_info->out_infos) : NULL;
1205 if (old_info->in_reqs != NULL) {
1206 unsigned n_ins = get_irn_arity(old_node);
1207 /* need dynamic in infos? */
1208 if (get_irn_op(old_node)->opar == oparity_dynamic) {
1209 new_info->in_reqs = NEW_ARR_F(const arch_register_req_t*, n_ins);
1211 new_info->in_reqs = OALLOCN(obst,const arch_register_req_t*, n_ins);
1213 memcpy(new_info->in_reqs, old_info->in_reqs,
1214 n_ins * sizeof(new_info->in_reqs[0]));
1216 new_info->in_reqs = NULL;
1220 int is_be_node(const ir_node *irn)
1222 return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops;
1225 static ir_op *new_be_op(unsigned code, const char *name, op_pin_state p,
1226 irop_flags flags, op_arity opar, size_t attr_size)
1228 ir_op *res = new_ir_op(code, name, p, flags, opar, 0, attr_size);
1229 res->ops.dump_node = dump_node;
1230 res->ops.copy_attr = copy_attr;
1231 res->ops.be_ops = &be_node_irn_ops;
1235 void be_init_op(void)
1239 assert(op_be_Spill == NULL);
1241 /* Acquire all needed opcodes. */
1242 op_be_Spill = new_be_op(beo_Spill, "be_Spill", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_frame_attr_t));
1243 op_be_Reload = new_be_op(beo_Reload, "be_Reload", op_pin_state_exc_pinned, irop_flag_none, oparity_zero, sizeof(be_frame_attr_t));
1244 op_be_Perm = new_be_op(beo_Perm, "be_Perm", op_pin_state_exc_pinned, irop_flag_none, oparity_variable, sizeof(be_node_attr_t));
1245 op_be_MemPerm = new_be_op(beo_MemPerm, "be_MemPerm", op_pin_state_exc_pinned, irop_flag_none, oparity_variable, sizeof(be_memperm_attr_t));
1246 op_be_Copy = new_be_op(beo_Copy, "be_Copy", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_node_attr_t));
1247 op_be_Keep = new_be_op(beo_Keep, "be_Keep", op_pin_state_exc_pinned, irop_flag_keep, oparity_dynamic, sizeof(be_node_attr_t));
1248 op_be_CopyKeep = new_be_op(beo_CopyKeep, "be_CopyKeep", op_pin_state_exc_pinned, irop_flag_keep, oparity_variable, sizeof(be_node_attr_t));
1249 op_be_Call = new_be_op(beo_Call, "be_Call", op_pin_state_exc_pinned, irop_flag_fragile|irop_flag_uses_memory, oparity_variable, sizeof(be_call_attr_t));
1250 ir_op_set_memory_index(op_be_Call, n_be_Call_mem);
1251 ir_op_set_fragile_indices(op_be_Call, pn_be_Call_X_regular, pn_be_Call_X_except);
1252 op_be_Return = new_be_op(beo_Return, "be_Return", op_pin_state_exc_pinned, irop_flag_cfopcode, oparity_variable, sizeof(be_return_attr_t));
1253 op_be_AddSP = new_be_op(beo_AddSP, "be_AddSP", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_node_attr_t));
1254 op_be_SubSP = new_be_op(beo_SubSP, "be_SubSP", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_node_attr_t));
1255 op_be_IncSP = new_be_op(beo_IncSP, "be_IncSP", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_incsp_attr_t));
1256 op_be_Start = new_be_op(beo_Start, "be_Start", op_pin_state_exc_pinned, irop_flag_none, oparity_zero, sizeof(be_node_attr_t));
1257 op_be_FrameAddr = new_be_op(beo_FrameAddr, "be_FrameAddr", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_frame_attr_t));
1259 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
1260 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
1261 op_be_Perm->ops.node_cmp_attr = be_nodes_equal;
1262 op_be_MemPerm->ops.node_cmp_attr = be_nodes_equal;
1263 op_be_Copy->ops.node_cmp_attr = be_nodes_equal;
1264 op_be_Keep->ops.node_cmp_attr = be_nodes_equal;
1265 op_be_CopyKeep->ops.node_cmp_attr = be_nodes_equal;
1266 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
1267 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
1268 op_be_AddSP->ops.node_cmp_attr = be_nodes_equal;
1269 op_be_SubSP->ops.node_cmp_attr = be_nodes_equal;
1270 op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr;
1271 op_be_Start->ops.node_cmp_attr = be_nodes_equal;
1272 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
1274 /* attach out dummy_ops to middle end nodes */
1275 for (opc = iro_First; opc <= iro_Last; ++opc) {
1276 ir_op *op = ir_get_opcode(opc);
1277 assert(op->ops.be_ops == NULL);
1278 op->ops.be_ops = &dummy_be_irn_ops;
1281 op_Phi->ops.be_ops = &phi_irn_ops;
1284 void be_finish_op(void)
1286 free_ir_op(op_be_Spill); op_be_Spill = NULL;
1287 free_ir_op(op_be_Reload); op_be_Reload = NULL;
1288 free_ir_op(op_be_Perm); op_be_Perm = NULL;
1289 free_ir_op(op_be_MemPerm); op_be_MemPerm = NULL;
1290 free_ir_op(op_be_Copy); op_be_Copy = NULL;
1291 free_ir_op(op_be_Keep); op_be_Keep = NULL;
1292 free_ir_op(op_be_CopyKeep); op_be_CopyKeep = NULL;
1293 free_ir_op(op_be_Call); op_be_Call = NULL;
1294 free_ir_op(op_be_Return); op_be_Return = NULL;
1295 free_ir_op(op_be_IncSP); op_be_IncSP = NULL;
1296 free_ir_op(op_be_AddSP); op_be_AddSP = NULL;
1297 free_ir_op(op_be_SubSP); op_be_SubSP = NULL;
1298 free_ir_op(op_be_Start); op_be_Start = NULL;
1299 free_ir_op(op_be_FrameAddr); op_be_FrameAddr = NULL;