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_D(reg_out_info_t, obst, n_outputs);
235 memset(info->out_infos, 0, n_outputs * sizeof(info->out_infos[0]));
236 for (int i = 0; i < n_outputs; ++i) {
237 info->out_infos[i].req = arch_no_register_req;
241 static void add_register_req_in(ir_node *node, const arch_register_req_t *req)
243 backend_info_t *info = be_get_info(node);
244 ARR_APP1(const arch_register_req_t*, info->in_reqs, req);
247 ir_node *be_new_Spill(const arch_register_class_t *cls,
248 const arch_register_class_t *cls_frame, ir_node *bl,
249 ir_node *frame, ir_node *to_spill)
254 ir_graph *irg = get_Block_irg(bl);
258 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
259 init_node_attr(res, 2, 1);
260 a = (be_frame_attr_t*) get_irn_generic_attr(res);
263 a->base.exc.pin_state = op_pin_state_pinned;
265 be_node_set_reg_class_in(res, n_be_Spill_frame, cls_frame);
266 be_node_set_reg_class_in(res, n_be_Spill_val, cls);
267 arch_set_irn_register_req_out(res, 0, arch_no_register_req);
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(irg->obst, ir_entity*, n);
404 attr->out_entities = OALLOCNZ(irg->obst, 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_graph *irg, 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;
483 NEW_ARR_A(ir_node *, real_in, real_n);
484 real_in[n_be_Call_mem] = mem;
485 real_in[n_be_Call_sp] = sp;
486 real_in[n_be_Call_ptr] = ptr;
487 memcpy(&real_in[n_be_Call_first_arg], in, n * sizeof(in[0]));
489 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 *dbg, ir_graph *irg, ir_node *block, int n_res,
542 unsigned pop, int n, ir_node *in[])
547 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, n, in);
548 init_node_attr(res, n, 1);
549 be_set_constr_out(res, 0, arch_no_register_req);
551 a = (be_return_attr_t*)get_irn_generic_attr(res);
552 a->num_ret_vals = n_res;
555 a->base.exc.pin_state = op_pin_state_pinned;
560 int be_Return_get_n_rets(const ir_node *ret)
562 const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret);
563 return a->num_ret_vals;
566 unsigned be_Return_get_pop(const ir_node *ret)
568 const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret);
572 int be_Return_get_emit_pop(const ir_node *ret)
574 const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret);
578 void be_Return_set_emit_pop(ir_node *ret, int emit_pop)
580 be_return_attr_t *a = (be_return_attr_t*)get_irn_generic_attr(ret);
581 a->emit_pop = emit_pop;
584 ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *bl,
585 ir_node *old_sp, int offset, int align)
590 ir_graph *irg = get_Block_irg(bl);
593 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode,
595 init_node_attr(irn, 1, 1);
596 a = (be_incsp_attr_t*)get_irn_generic_attr(irn);
599 a->base.exc.pin_state = op_pin_state_pinned;
601 /* Set output constraint to stack register. */
602 be_node_set_reg_class_in(irn, 0, sp->reg_class);
603 be_set_constr_single_reg_out(irn, 0, sp, arch_register_req_type_produces_sp);
608 ir_node *be_new_AddSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp,
612 ir_node *in[n_be_AddSP_last];
614 be_node_attr_t *attr;
616 in[n_be_AddSP_old_sp] = old_sp;
617 in[n_be_AddSP_size] = sz;
619 irg = get_Block_irg(bl);
620 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, n_be_AddSP_last, in);
621 init_node_attr(irn, n_be_AddSP_last, pn_be_AddSP_last);
622 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
623 attr->exc.pin_state = op_pin_state_pinned;
625 /* Set output constraint to stack register. */
626 be_set_constr_single_reg_in(irn, n_be_AddSP_old_sp, sp,
627 arch_register_req_type_none);
628 be_node_set_reg_class_in(irn, n_be_AddSP_size, sp->reg_class);
629 be_set_constr_single_reg_out(irn, pn_be_AddSP_sp, sp,
630 arch_register_req_type_produces_sp);
635 ir_node *be_new_SubSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp, ir_node *sz)
638 ir_node *in[n_be_SubSP_last];
640 be_node_attr_t *attr;
642 in[n_be_SubSP_old_sp] = old_sp;
643 in[n_be_SubSP_size] = sz;
645 irg = get_Block_irg(bl);
646 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, n_be_SubSP_last, in);
647 init_node_attr(irn, n_be_SubSP_last, pn_be_SubSP_last);
648 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
649 attr->exc.pin_state = op_pin_state_pinned;
651 /* Set output constraint to stack register. */
652 be_set_constr_single_reg_in(irn, n_be_SubSP_old_sp, sp,
653 arch_register_req_type_none);
654 be_node_set_reg_class_in(irn, n_be_SubSP_size, sp->reg_class);
655 be_set_constr_single_reg_out(irn, pn_be_SubSP_sp, sp, arch_register_req_type_produces_sp);
660 ir_node *be_new_Start(dbg_info *dbgi, ir_node *bl, int n_outs)
663 ir_graph *irg = get_Block_irg(bl);
664 be_node_attr_t *attr;
666 res = new_ir_node(dbgi, irg, bl, op_be_Start, mode_T, 0, NULL);
667 init_node_attr(res, 0, n_outs);
668 attr = (be_node_attr_t*) get_irn_generic_attr(res);
669 attr->exc.pin_state = op_pin_state_pinned;
674 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_node *bl, ir_node *frame, ir_entity *ent)
679 ir_graph *irg = get_Block_irg(bl);
682 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
683 init_node_attr(irn, 1, 1);
684 a = (be_frame_attr_t*)get_irn_generic_attr(irn);
687 a->base.exc.pin_state = op_pin_state_floats;
688 be_node_set_reg_class_in(irn, 0, cls_frame);
689 be_node_set_reg_class_out(irn, 0, cls_frame);
691 return optimize_node(irn);
694 ir_node *be_get_FrameAddr_frame(const ir_node *node)
696 assert(be_is_FrameAddr(node));
697 return get_irn_n(node, n_be_FrameAddr_ptr);
700 ir_entity *be_get_FrameAddr_entity(const ir_node *node)
702 const be_frame_attr_t *attr = (const be_frame_attr_t*)get_irn_generic_attr_const(node);
706 ir_node *be_new_CopyKeep(ir_node *bl, ir_node *src, int n, ir_node *in_keep[])
709 ir_node **in = ALLOCAN(ir_node*, n + 1);
710 ir_graph *irg = get_Block_irg(bl);
711 const arch_register_req_t *req = arch_get_irn_register_req(src);
712 const arch_register_class_t *cls = req->cls;
713 ir_mode *mode = get_irn_mode(src);
714 be_node_attr_t *attr;
717 memcpy(&in[1], in_keep, n * sizeof(in[0]));
718 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
719 init_node_attr(irn, n + 1, 1);
720 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
721 attr->exc.pin_state = op_pin_state_floats;
722 be_node_set_reg_class_in(irn, 0, cls);
723 be_node_set_reg_class_out(irn, 0, cls);
724 for (int i = 0; i < n; ++i) {
725 ir_node *pred = in_keep[i];
726 const arch_register_req_t *req = arch_get_irn_register_req(pred);
727 req = req->cls != NULL ? req->cls->class_req : arch_no_register_req;
728 be_set_constr_in(irn, i+1, req);
734 ir_node *be_new_CopyKeep_single(ir_node *bl, ir_node *src, ir_node *keep)
736 return be_new_CopyKeep(bl, src, 1, &keep);
739 ir_node *be_get_CopyKeep_op(const ir_node *cpy)
741 return get_irn_n(cpy, n_be_CopyKeep_op);
744 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op)
746 set_irn_n(cpy, n_be_CopyKeep_op, op);
749 static bool be_has_frame_entity(const ir_node *irn)
751 switch (get_irn_opcode(irn)) {
761 ir_entity *be_get_frame_entity(const ir_node *irn)
763 if (be_has_frame_entity(irn)) {
764 const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn);
770 int be_get_frame_offset(const ir_node *irn)
772 assert(is_be_node(irn));
773 if (be_has_frame_entity(irn)) {
774 const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn);
780 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
782 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
784 assert(be_is_MemPerm(irn));
785 assert(n < be_get_MemPerm_entity_arity(irn));
787 attr->in_entities[n] = ent;
790 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
792 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
794 assert(be_is_MemPerm(irn));
795 assert(n < be_get_MemPerm_entity_arity(irn));
797 return attr->in_entities[n];
800 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
802 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
804 assert(be_is_MemPerm(irn));
805 assert(n < be_get_MemPerm_entity_arity(irn));
807 attr->out_entities[n] = ent;
810 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
812 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
814 assert(be_is_MemPerm(irn));
815 assert(n < be_get_MemPerm_entity_arity(irn));
817 return attr->out_entities[n];
820 int be_get_MemPerm_entity_arity(const ir_node *irn)
822 return get_irn_arity(irn) - 1;
825 const arch_register_req_t *be_create_reg_req(struct obstack *obst,
826 const arch_register_t *reg, arch_register_req_type_t additional_types)
828 arch_register_req_t *req = OALLOC(obst, arch_register_req_t);
829 const arch_register_class_t *cls = reg->reg_class;
830 unsigned *limited_bitset;
832 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
833 rbitset_set(limited_bitset, reg->index);
835 req->type = arch_register_req_type_limited | additional_types;
837 req->limited = limited_bitset;
842 void be_set_constr_single_reg_in(ir_node *node, int pos,
843 const arch_register_t *reg, arch_register_req_type_t additional_types)
845 const arch_register_req_t *req;
847 if (additional_types == 0) {
848 req = reg->single_req;
850 ir_graph *irg = get_irn_irg(node);
851 struct obstack *obst = be_get_be_obst(irg);
852 req = be_create_reg_req(obst, reg, additional_types);
854 be_set_constr_in(node, pos, req);
857 void be_set_constr_single_reg_out(ir_node *node, int pos,
858 const arch_register_t *reg, arch_register_req_type_t additional_types)
860 ir_graph *irg = get_irn_irg(node);
861 be_irg_t *birg = be_birg_from_irg(irg);
862 const arch_register_req_t *req;
864 /* if we have an ignore register, add ignore flag and just assign it */
865 if (!rbitset_is_set(birg->allocatable_regs, reg->global_index)) {
866 additional_types |= arch_register_req_type_ignore;
869 if (additional_types == 0) {
870 req = reg->single_req;
872 struct obstack *obst = be_get_be_obst(irg);
873 req = be_create_reg_req(obst, reg, additional_types);
876 arch_set_irn_register_out(node, pos, reg);
877 be_set_constr_out(node, pos, req);
880 void be_node_set_reg_class_in(ir_node *irn, int pos,
881 const arch_register_class_t *cls)
883 be_set_constr_in(irn, pos, cls->class_req);
886 void be_node_set_reg_class_out(ir_node *irn, int pos,
887 const arch_register_class_t *cls)
889 be_set_constr_out(irn, pos, cls->class_req);
892 ir_node *be_get_IncSP_pred(ir_node *irn)
894 assert(be_is_IncSP(irn));
895 return get_irn_n(irn, 0);
898 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred)
900 assert(be_is_IncSP(incsp));
901 set_irn_n(incsp, 0, pred);
904 void be_set_IncSP_offset(ir_node *irn, int offset)
906 be_incsp_attr_t *a = (be_incsp_attr_t*)get_irn_generic_attr(irn);
907 assert(be_is_IncSP(irn));
911 int be_get_IncSP_offset(const ir_node *irn)
913 const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
914 assert(be_is_IncSP(irn));
918 int be_get_IncSP_align(const ir_node *irn)
920 const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
921 assert(be_is_IncSP(irn));
925 static ir_entity *be_node_get_frame_entity(const ir_node *irn)
927 return be_get_frame_entity(irn);
930 void be_node_set_frame_entity(ir_node *irn, ir_entity *ent)
934 assert(be_has_frame_entity(irn));
936 a = (be_frame_attr_t*)get_irn_generic_attr(irn);
940 static void be_node_set_frame_offset(ir_node *irn, int offset)
944 if (!be_has_frame_entity(irn))
947 a = (be_frame_attr_t*)get_irn_generic_attr(irn);
951 static int be_node_get_sp_bias(const ir_node *irn)
953 if (be_is_IncSP(irn))
954 return be_get_IncSP_offset(irn);
956 return -(int)be_Call_get_pop(irn);
964 static const arch_irn_ops_t be_node_irn_ops = {
965 be_node_get_frame_entity,
966 be_node_set_frame_offset,
968 NULL, /* get_op_estimated_cost */
969 NULL, /* possible_memory_operand */
970 NULL, /* perform_memory_operand */
973 static int get_start_reg_index(ir_graph *irg, const arch_register_t *reg)
975 ir_node *start = get_irg_start(irg);
977 /* do a naive linear search... */
978 be_foreach_out(start, i) {
979 arch_register_req_t const *const out_req = arch_get_irn_register_req_out(start, i);
980 if (!arch_register_req_is(out_req, limited))
982 if (out_req->cls != reg->reg_class)
984 if (!rbitset_is_set(out_req->limited, reg->index))
988 panic("Tried querying undefined register '%s' at Start", reg->name);
991 ir_node *be_get_initial_reg_value(ir_graph *irg, const arch_register_t *reg)
993 int i = get_start_reg_index(irg, reg);
994 ir_node *start = get_irg_start(irg);
995 ir_mode *mode = arch_register_class_mode(reg->reg_class);
997 foreach_out_edge(start, edge) {
998 ir_node *proj = get_edge_src_irn(edge);
999 if (!is_Proj(proj)) // maybe End/Anchor
1001 if (get_Proj_proj(proj) == i) {
1005 return new_r_Proj(start, mode, i);
1008 static ir_entity* dummy_get_frame_entity(const ir_node *node)
1014 static void dummy_set_frame_offset(ir_node *node, int bias)
1018 panic("should not be called");
1021 static int dummy_get_sp_bias(const ir_node *node)
1027 /* for "middleend" nodes */
1028 static const arch_irn_ops_t dummy_be_irn_ops = {
1029 dummy_get_frame_entity,
1030 dummy_set_frame_offset,
1032 NULL, /* get_op_estimated_cost */
1033 NULL, /* possible_memory_operand */
1034 NULL, /* perform_memory_operand */
1039 ir_node *be_new_Phi(ir_node *block, int n_ins, ir_node **ins, ir_mode *mode,
1040 const arch_register_req_t *req)
1042 ir_graph *irg = get_irn_irg(block);
1043 struct obstack *obst = be_get_be_obst(irg);
1044 backend_info_t *info;
1047 ir_node *phi = new_ir_node(NULL, irg, block, op_Phi, mode, n_ins, ins);
1048 phi->attr.phi.u.backedge = new_backedge_arr(irg->obst, n_ins);
1049 info = be_get_info(phi);
1050 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
1051 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
1052 info->in_reqs = OALLOCN(obst, const arch_register_req_t*, n_ins);
1054 info->out_infos[0].req = req;
1055 for (i = 0; i < n_ins; ++i) {
1056 info->in_reqs[i] = req;
1058 irn_verify_irg(phi, irg);
1059 phi = optimize_node(phi);
1063 void be_set_phi_reg_req(ir_node *node, const arch_register_req_t *req)
1065 int arity = get_irn_arity(node);
1068 backend_info_t *info = be_get_info(node);
1069 info->out_infos[0].req = req;
1070 for (i = 0; i < arity; ++i) {
1071 info->in_reqs[i] = req;
1074 assert(mode_is_datab(get_irn_mode(node)));
1077 void be_dump_phi_reg_reqs(FILE *F, const ir_node *node, dump_reason_t reason)
1079 ir_graph *irg = get_irn_irg(node);
1080 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND))
1084 case dump_node_opcode_txt:
1085 fputs(get_op_name(get_irn_op(node)), F);
1087 case dump_node_mode_txt:
1088 fprintf(F, "%s", get_mode_name(get_irn_mode(node)));
1090 case dump_node_nodeattr_txt:
1092 case dump_node_info_txt:
1093 arch_dump_reqs_and_registers(F, node);
1101 static const arch_irn_ops_t phi_irn_ops = {
1102 dummy_get_frame_entity,
1103 dummy_set_frame_offset,
1105 NULL, /* get_op_estimated_cost */
1106 NULL, /* possible_memory_operand */
1107 NULL, /* perform_memory_operand */
1113 * ir_op-Operation: dump a be node to file
1115 static void dump_node(FILE *f, const ir_node *irn, dump_reason_t reason)
1117 assert(is_be_node(irn));
1120 case dump_node_opcode_txt:
1121 fputs(get_op_name(get_irn_op(irn)), f);
1123 case dump_node_mode_txt:
1124 if (be_is_Copy(irn) || be_is_CopyKeep(irn)) {
1125 fprintf(f, "%s", get_mode_name(get_irn_mode(irn)));
1128 case dump_node_nodeattr_txt:
1129 if (be_is_Call(irn)) {
1130 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(irn);
1132 fprintf(f, " [%s] ", get_entity_name(a->ent));
1134 if (be_is_IncSP(irn)) {
1135 const be_incsp_attr_t *attr = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
1136 fprintf(f, " [%d] ", attr->offset);
1139 case dump_node_info_txt:
1140 arch_dump_reqs_and_registers(f, irn);
1142 if (be_has_frame_entity(irn)) {
1143 const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn);
1145 unsigned size = get_type_size_bytes(get_entity_type(a->ent));
1146 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bytes\n",
1147 a->ent, a->offset, a->offset, size, size);
1152 switch (get_irn_opcode(irn)) {
1154 const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
1155 fprintf(f, "align: %d\n", a->align);
1156 fprintf(f, "offset: %d\n", a->offset);
1160 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(irn);
1163 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1168 for (i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1169 ir_entity *in, *out;
1170 in = be_get_MemPerm_in_entity(irn, i);
1171 out = be_get_MemPerm_out_entity(irn, i);
1173 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1176 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1190 * Copies the backend specific attributes from old node to new node.
1192 static void copy_attr(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1194 const void *old_attr = get_irn_generic_attr_const(old_node);
1195 void *new_attr = get_irn_generic_attr(new_node);
1196 struct obstack *obst = be_get_be_obst(irg);
1197 backend_info_t *old_info = be_get_info(old_node);
1198 backend_info_t *new_info = be_get_info(new_node);
1200 assert(is_be_node(old_node));
1201 assert(is_be_node(new_node));
1203 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1205 new_info->flags = old_info->flags;
1206 new_info->out_infos = old_info->out_infos ? DUP_ARR_D(reg_out_info_t, obst, old_info->out_infos) : NULL;
1209 if (old_info->in_reqs != NULL) {
1210 unsigned n_ins = get_irn_arity(old_node);
1211 /* need dynamic in infos? */
1212 if (get_irn_op(old_node)->opar == oparity_dynamic) {
1213 new_info->in_reqs = NEW_ARR_F(const arch_register_req_t*, n_ins);
1215 new_info->in_reqs = OALLOCN(obst,const arch_register_req_t*, n_ins);
1217 memcpy(new_info->in_reqs, old_info->in_reqs,
1218 n_ins * sizeof(new_info->in_reqs[0]));
1220 new_info->in_reqs = NULL;
1224 int is_be_node(const ir_node *irn)
1226 return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops;
1229 static ir_op *new_be_op(unsigned code, const char *name, op_pin_state p,
1230 irop_flags flags, op_arity opar, size_t attr_size)
1232 ir_op *res = new_ir_op(code, name, p, flags, opar, 0, attr_size);
1233 res->ops.dump_node = dump_node;
1234 res->ops.copy_attr = copy_attr;
1235 res->ops.be_ops = &be_node_irn_ops;
1239 void be_init_op(void)
1243 assert(op_be_Spill == NULL);
1245 /* Acquire all needed opcodes. */
1246 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));
1247 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));
1248 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));
1249 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));
1250 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));
1251 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));
1252 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));
1253 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));
1254 ir_op_set_memory_index(op_be_Call, n_be_Call_mem);
1255 ir_op_set_fragile_indices(op_be_Call, pn_be_Call_X_regular, pn_be_Call_X_except);
1256 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));
1257 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));
1258 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));
1259 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));
1260 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));
1261 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));
1263 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
1264 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
1265 op_be_Perm->ops.node_cmp_attr = be_nodes_equal;
1266 op_be_MemPerm->ops.node_cmp_attr = be_nodes_equal;
1267 op_be_Copy->ops.node_cmp_attr = be_nodes_equal;
1268 op_be_Keep->ops.node_cmp_attr = be_nodes_equal;
1269 op_be_CopyKeep->ops.node_cmp_attr = be_nodes_equal;
1270 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
1271 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
1272 op_be_AddSP->ops.node_cmp_attr = be_nodes_equal;
1273 op_be_SubSP->ops.node_cmp_attr = be_nodes_equal;
1274 op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr;
1275 op_be_Start->ops.node_cmp_attr = be_nodes_equal;
1276 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
1278 /* attach out dummy_ops to middle end nodes */
1279 for (opc = iro_First; opc <= iro_Last; ++opc) {
1280 ir_op *op = ir_get_opcode(opc);
1281 assert(op->ops.be_ops == NULL);
1282 op->ops.be_ops = &dummy_be_irn_ops;
1285 op_Phi->ops.be_ops = &phi_irn_ops;
1288 void be_finish_op(void)
1290 free_ir_op(op_be_Spill); op_be_Spill = NULL;
1291 free_ir_op(op_be_Reload); op_be_Reload = NULL;
1292 free_ir_op(op_be_Perm); op_be_Perm = NULL;
1293 free_ir_op(op_be_MemPerm); op_be_MemPerm = NULL;
1294 free_ir_op(op_be_Copy); op_be_Copy = NULL;
1295 free_ir_op(op_be_Keep); op_be_Keep = NULL;
1296 free_ir_op(op_be_CopyKeep); op_be_CopyKeep = NULL;
1297 free_ir_op(op_be_Call); op_be_Call = NULL;
1298 free_ir_op(op_be_Return); op_be_Return = NULL;
1299 free_ir_op(op_be_IncSP); op_be_IncSP = NULL;
1300 free_ir_op(op_be_AddSP); op_be_AddSP = NULL;
1301 free_ir_op(op_be_SubSP); op_be_SubSP = NULL;
1302 free_ir_op(op_be_Start); op_be_Start = NULL;
1303 free_ir_op(op_be_FrameAddr); op_be_FrameAddr = NULL;