2 * Copyright (C) 1995-2008 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
27 * Backend node support for generic backend nodes.
28 * This file provides Perm, Copy, Spill and Reload nodes.
41 #include "bitfiddle.h"
42 #include "raw_bitset.h"
62 #define get_irn_attr(irn) get_irn_generic_attr(irn)
63 #define get_irn_attr_const(irn) get_irn_generic_attr_const(irn)
66 const arch_register_req_t *in_req;
69 /** The generic be nodes attribute type. */
71 be_reg_data_t *reg_data;
74 /** The be_Return nodes attribute type. */
76 be_node_attr_t node_attr; /**< base attributes of every be node. */
77 int num_ret_vals; /**< number of return values */
78 unsigned pop; /**< number of bytes that should be popped */
79 int emit_pop; /**< if set, emit pop bytes, even if pop = 0 */
82 /** The be_IncSP attribute type. */
84 be_node_attr_t node_attr; /**< base attributes of every be node. */
85 int offset; /**< The offset by which the stack shall be expanded/shrinked. */
86 int align; /**< whether stack should be aligned after the
90 /** The be_Frame attribute type. */
92 be_node_attr_t node_attr; /**< base attributes of every be node. */
97 /** The be_Call attribute type. */
99 be_node_attr_t node_attr; /**< base attributes of every be node. */
100 ir_entity *ent; /**< The called entity if this is a static call. */
102 ir_type *call_tp; /**< The call type, copied from the original Call node. */
106 be_node_attr_t node_attr; /**< base attributes of every be node. */
107 ir_entity **in_entities;
108 ir_entity **out_entities;
114 ir_op *op_be_MemPerm;
117 ir_op *op_be_CopyKeep;
124 ir_op *op_be_FrameAddr;
125 ir_op *op_be_Barrier;
127 static const ir_op_ops be_node_op_ops;
129 #define N irop_flag_none
130 #define L irop_flag_labeled
131 #define C irop_flag_commutative
132 #define X irop_flag_cfopcode
133 #define I irop_flag_ip_cfopcode
134 #define F irop_flag_fragile
135 #define Y irop_flag_forking
136 #define H irop_flag_highlevel
137 #define c irop_flag_constlike
138 #define K irop_flag_keep
139 #define M irop_flag_uses_memory
142 * Compare two be node attributes.
144 * @return zero if both attributes are identically
146 static int node_cmp_attr(ir_node *a, ir_node *b)
148 const be_node_attr_t *a_attr = get_irn_attr_const(a);
149 const be_node_attr_t *b_attr = get_irn_attr_const(b);
150 int i, len = ARR_LEN(a_attr->reg_data);
152 if (len != ARR_LEN(b_attr->reg_data))
155 if (!be_nodes_equal(a, b))
158 for (i = len - 1; i >= 0; --i) {
159 if (!reg_reqs_equal(a_attr->reg_data[i].in_req,
160 b_attr->reg_data[i].in_req))
168 * Compare the attributes of two be_FrameAddr nodes.
170 * @return zero if both nodes have identically attributes
172 static int FrameAddr_cmp_attr(ir_node *a, ir_node *b)
174 const be_frame_attr_t *a_attr = get_irn_attr_const(a);
175 const be_frame_attr_t *b_attr = get_irn_attr_const(b);
177 if (a_attr->ent != b_attr->ent || a_attr->offset != b_attr->offset)
180 return node_cmp_attr(a, b);
184 * Compare the attributes of two be_Return nodes.
186 * @return zero if both nodes have identically attributes
188 static int Return_cmp_attr(ir_node *a, ir_node *b)
190 const be_return_attr_t *a_attr = get_irn_attr_const(a);
191 const be_return_attr_t *b_attr = get_irn_attr_const(b);
193 if (a_attr->num_ret_vals != b_attr->num_ret_vals)
195 if (a_attr->pop != b_attr->pop)
197 if (a_attr->emit_pop != b_attr->emit_pop)
200 return node_cmp_attr(a, b);
204 * Compare the attributes of two be_IncSP nodes.
206 * @return zero if both nodes have identically attributes
208 static int IncSP_cmp_attr(ir_node *a, ir_node *b) {
209 const be_incsp_attr_t *a_attr = get_irn_attr_const(a);
210 const be_incsp_attr_t *b_attr = get_irn_attr_const(b);
212 if (a_attr->offset != b_attr->offset)
215 return node_cmp_attr(a, b);
219 * Compare the attributes of two be_Call nodes.
221 * @return zero if both nodes have identically attributes
223 static int Call_cmp_attr(ir_node *a, ir_node *b)
225 const be_call_attr_t *a_attr = get_irn_attr_const(a);
226 const be_call_attr_t *b_attr = get_irn_attr_const(b);
228 if (a_attr->ent != b_attr->ent ||
229 a_attr->call_tp != b_attr->call_tp)
232 return node_cmp_attr(a, b);
235 static arch_register_req_t *allocate_reg_req(const ir_node *node)
237 ir_graph *irg = get_irn_irg(node);
238 struct obstack *obst = be_get_birg_obst(irg);
240 arch_register_req_t *req = obstack_alloc(obst, sizeof(*req));
241 memset(req, 0, sizeof(*req));
245 void be_set_constr_in(ir_node *node, int pos, const arch_register_req_t *req)
247 const be_node_attr_t *attr = get_irn_attr_const(node);
248 be_reg_data_t *rd = &attr->reg_data[pos];
249 assert(pos < ARR_LEN(attr->reg_data));
253 void be_set_constr_out(ir_node *node, int pos, const arch_register_req_t *req)
255 backend_info_t *info = be_get_info(node);
256 info->out_infos[pos].req = req;
260 * Initializes the generic attribute of all be nodes and return it.
262 static void *init_node_attr(ir_node *node, int n_inputs, int n_outputs)
264 ir_graph *irg = get_irn_irg(node);
265 struct obstack *obst = be_get_birg_obst(irg);
266 be_node_attr_t *a = get_irn_attr(node);
267 backend_info_t *info = be_get_info(node);
269 memset(a, 0, sizeof(get_op_attr_size(get_irn_op(node))));
273 a->reg_data = NEW_ARR_D(be_reg_data_t, obst, n_inputs);
274 for (i = 0; i < n_inputs; ++i) {
275 a->reg_data[i].in_req = arch_no_register_req;
278 a->reg_data = NEW_ARR_F(be_reg_data_t, 0);
281 if (n_outputs >= 0) {
283 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, n_outputs);
284 memset(info->out_infos, 0, n_outputs * sizeof(info->out_infos[0]));
285 for (i = 0; i < n_outputs; ++i) {
286 info->out_infos[i].req = arch_no_register_req;
289 info->out_infos = NEW_ARR_F(reg_out_info_t, 0);
295 static void add_register_req_out(ir_node *node)
297 backend_info_t *info = be_get_info(node);
298 reg_out_info_t out_info;
299 memset(&out_info, 0, sizeof(out_info));
300 out_info.req = arch_no_register_req;
301 ARR_APP1(reg_out_info_t, info->out_infos, out_info);
304 static void add_register_req_in(ir_node *node)
306 be_node_attr_t *a = get_irn_attr(node);
307 be_reg_data_t regreq;
308 memset(®req, 0, sizeof(regreq));
309 regreq.in_req = arch_no_register_req;
310 ARR_APP1(be_reg_data_t, a->reg_data, regreq);
313 ir_node *be_new_Spill(const arch_register_class_t *cls,
314 const arch_register_class_t *cls_frame, ir_node *bl,
315 ir_node *frame, ir_node *to_spill)
320 ir_graph *irg = get_Block_irg(bl);
324 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
325 a = init_node_attr(res, 2, 1);
329 be_node_set_reg_class_in(res, be_pos_Spill_frame, cls_frame);
330 be_node_set_reg_class_in(res, be_pos_Spill_val, cls);
332 * For spills and reloads, we return "none" as requirement for frame
333 * pointer, so every input is ok. Some backends need this (STA).
334 * Matze: we should investigate if this is really needed, this solution
335 * looks very hacky to me
337 be_set_constr_in(res, be_pos_Spill_frame, arch_no_register_req);
339 arch_set_out_register_req(res, 0, arch_no_register_req);
344 ir_node *be_new_Reload(const arch_register_class_t *cls,
345 const arch_register_class_t *cls_frame, ir_node *block,
346 ir_node *frame, ir_node *mem, ir_mode *mode)
350 ir_graph *irg = get_Block_irg(block);
354 res = new_ir_node(NULL, irg, block, op_be_Reload, mode, 2, in);
356 init_node_attr(res, 2, 1);
357 be_node_set_reg_class_out(res, 0, cls);
359 be_node_set_reg_class_in(res, be_pos_Reload_frame, cls_frame);
360 arch_irn_set_flags(res, arch_irn_flags_rematerializable);
363 * For spills and reloads, we return "none" as requirement for frame
364 * pointer, so every input is ok. Some backends need this (e.g. STA).
365 * Matze: we should investigate if this is really needed, this solution
366 * looks very hacky to me
368 be_set_constr_in(res, be_pos_Reload_frame, arch_no_register_req);
373 ir_node *be_get_Reload_mem(const ir_node *irn)
375 assert(be_is_Reload(irn));
376 return get_irn_n(irn, be_pos_Reload_mem);
379 ir_node *be_get_Reload_frame(const ir_node *irn)
381 assert(be_is_Reload(irn));
382 return get_irn_n(irn, be_pos_Reload_frame);
385 ir_node *be_get_Spill_val(const ir_node *irn)
387 assert(be_is_Spill(irn));
388 return get_irn_n(irn, be_pos_Spill_val);
391 ir_node *be_get_Spill_frame(const ir_node *irn)
393 assert(be_is_Spill(irn));
394 return get_irn_n(irn, be_pos_Spill_frame);
397 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_node *block,
398 int n, ir_node *in[])
401 ir_graph *irg = get_Block_irg(block);
403 ir_node *irn = new_ir_node(NULL, irg, block, op_be_Perm, mode_T, n, in);
404 init_node_attr(irn, n, n);
405 for (i = 0; i < n; ++i) {
406 be_node_set_reg_class_in(irn, i, cls);
407 be_node_set_reg_class_out(irn, i, cls);
413 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
415 int arity = get_irn_arity(perm);
416 be_reg_data_t *old_data = ALLOCAN(be_reg_data_t, arity);
417 reg_out_info_t *old_infos = ALLOCAN(reg_out_info_t, arity);
418 be_node_attr_t *attr = get_irn_attr(perm);
419 backend_info_t *info = be_get_info(perm);
424 assert(be_is_Perm(perm));
425 assert(new_size <= arity);
427 new_in = alloca(new_size * sizeof(*new_in));
429 /* save the old register data */
430 memcpy(old_data, attr->reg_data, arity * sizeof(old_data[0]));
431 memcpy(old_infos, info->out_infos, arity * sizeof(old_infos[0]));
433 /* compose the new in array and set the new register data directly in place */
434 for (i = 0; i < new_size; ++i) {
436 new_in[i] = get_irn_n(perm, idx);
437 attr->reg_data[i] = old_data[idx];
438 info->out_infos[i] = old_infos[idx];
441 set_irn_in(perm, new_size, new_in);
444 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_node *bl, int n, ir_node *in[])
446 ir_graph *irg = get_Block_irg(bl);
447 ir_node *frame = get_irg_frame(irg);
448 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
449 const arch_register_t *sp = arch_env->sp;
451 be_memperm_attr_t *attr;
455 real_in = ALLOCAN(ir_node*, n + 1);
457 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
459 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
461 init_node_attr(irn, n + 1, n + 1);
462 be_node_set_reg_class_in(irn, 0, sp->reg_class);
463 for (i = 0; i < n; ++i) {
464 be_node_set_reg_class_in(irn, i + 1, cls_frame);
465 be_node_set_reg_class_out(irn, i, cls_frame);
468 attr = get_irn_attr(irn);
469 attr->in_entities = OALLOCNZ(irg->obst, ir_entity*, n);
470 attr->out_entities = OALLOCNZ(irg->obst, ir_entity*, n);
475 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_node *bl, ir_node *op)
479 arch_register_req_t *req;
480 ir_graph *irg = get_Block_irg(bl);
483 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
484 init_node_attr(res, 1, 1);
485 be_node_set_reg_class_in(res, 0, cls);
486 be_node_set_reg_class_out(res, 0, cls);
488 req = allocate_reg_req(res);
490 req->type = arch_register_req_type_should_be_same;
491 req->other_same = 1U << 0;
492 be_set_constr_out(res, 0, req);
497 ir_node *be_get_Copy_op(const ir_node *cpy) {
498 return get_irn_n(cpy, be_pos_Copy_op);
501 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
502 set_irn_n(cpy, be_pos_Copy_op, op);
505 ir_node *be_new_Keep(ir_node *block, int n, ir_node *in[])
509 ir_graph *irg = get_Block_irg(block);
511 res = new_ir_node(NULL, irg, block, op_be_Keep, mode_ANY, -1, NULL);
512 init_node_attr(res, -1, 1);
514 for (i = 0; i < n; ++i) {
515 add_irn_n(res, in[i]);
516 add_register_req_in(res);
523 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
527 assert(be_is_Keep(keep));
528 n = add_irn_n(keep, node);
529 add_register_req_in(keep);
530 be_node_set_reg_class_in(keep, n, cls);
533 /* creates a be_Call */
534 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem,
535 ir_node *sp, ir_node *ptr, int n_outs, int n, ir_node *in[],
539 int real_n = be_pos_Call_first_arg + n;
543 NEW_ARR_A(ir_node *, real_in, real_n);
544 real_in[be_pos_Call_mem] = mem;
545 real_in[be_pos_Call_sp] = sp;
546 real_in[be_pos_Call_ptr] = ptr;
547 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
549 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
550 a = init_node_attr(irn, real_n, n_outs);
552 a->call_tp = call_tp;
557 /* Gets the call entity or NULL if this is no static call. */
558 ir_entity *be_Call_get_entity(const ir_node *call) {
559 const be_call_attr_t *a = get_irn_attr_const(call);
560 assert(be_is_Call(call));
564 /* Sets the call entity. */
565 void be_Call_set_entity(ir_node *call, ir_entity *ent) {
566 be_call_attr_t *a = get_irn_attr(call);
567 assert(be_is_Call(call));
571 /* Gets the call type. */
572 ir_type *be_Call_get_type(ir_node *call) {
573 const be_call_attr_t *a = get_irn_attr_const(call);
574 assert(be_is_Call(call));
578 /* Sets the call type. */
579 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
580 be_call_attr_t *a = get_irn_attr(call);
581 assert(be_is_Call(call));
582 a->call_tp = call_tp;
585 void be_Call_set_pop(ir_node *call, unsigned pop) {
586 be_call_attr_t *a = get_irn_attr(call);
590 unsigned be_Call_get_pop(const ir_node *call) {
591 const be_call_attr_t *a = get_irn_attr_const(call);
595 /* Construct a new be_Return. */
596 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
597 unsigned pop, int n, ir_node *in[])
603 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL);
604 init_node_attr(res, -1, 1);
605 for (i = 0; i < n; ++i) {
606 add_irn_n(res, in[i]);
607 add_register_req_in(res);
609 be_set_constr_out(res, 0, arch_no_register_req);
611 a = get_irn_attr(res);
612 a->num_ret_vals = n_res;
619 /* Returns the number of real returns values */
620 int be_Return_get_n_rets(const ir_node *ret) {
621 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
622 return a->num_ret_vals;
625 /* return the number of bytes that should be popped from stack when executing the Return. */
626 unsigned be_Return_get_pop(const ir_node *ret) {
627 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
631 /* return non-zero, if number of popped bytes must be always emitted */
632 int be_Return_get_emit_pop(const ir_node *ret) {
633 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
637 /* return non-zero, if number of popped bytes must be always emitted */
638 void be_Return_set_emit_pop(ir_node *ret, int emit_pop) {
639 be_return_attr_t *a = get_irn_generic_attr(ret);
640 a->emit_pop = emit_pop;
643 int be_Return_append_node(ir_node *ret, ir_node *node) {
646 pos = add_irn_n(ret, node);
647 add_register_req_in(ret);
652 ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *bl,
653 ir_node *old_sp, int offset, int align)
658 ir_graph *irg = get_Block_irg(bl);
661 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode,
662 sizeof(in) / sizeof(in[0]), in);
663 a = init_node_attr(irn, 1, 1);
667 /* Set output constraint to stack register. */
668 be_node_set_reg_class_in(irn, 0, sp->reg_class);
669 be_set_constr_single_reg_out(irn, 0, sp, arch_register_req_type_produces_sp);
674 ir_node *be_new_AddSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp,
679 ir_node *in[be_pos_AddSP_last];
680 const arch_register_class_t *cls;
683 in[be_pos_AddSP_old_sp] = old_sp;
684 in[be_pos_AddSP_size] = sz;
686 irg = get_Block_irg(bl);
687 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
688 a = init_node_attr(irn, be_pos_AddSP_last, pn_be_AddSP_last);
690 /* Set output constraint to stack register. */
691 be_set_constr_single_reg_in(irn, be_pos_AddSP_old_sp, sp, 0);
692 be_node_set_reg_class_in(irn, be_pos_AddSP_size, arch_register_get_class(sp));
693 be_set_constr_single_reg_out(irn, pn_be_AddSP_sp, sp, arch_register_req_type_produces_sp);
695 cls = arch_register_get_class(sp);
700 ir_node *be_new_SubSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp, ir_node *sz)
704 ir_node *in[be_pos_SubSP_last];
707 in[be_pos_SubSP_old_sp] = old_sp;
708 in[be_pos_SubSP_size] = sz;
710 irg = get_Block_irg(bl);
711 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
712 a = init_node_attr(irn, be_pos_SubSP_last, pn_be_SubSP_last);
714 /* Set output constraint to stack register. */
715 be_set_constr_single_reg_in(irn, be_pos_SubSP_old_sp, sp, 0);
716 be_node_set_reg_class_in(irn, be_pos_SubSP_size, arch_register_get_class(sp));
717 be_set_constr_single_reg_out(irn, pn_be_SubSP_sp, sp, arch_register_req_type_produces_sp);
722 ir_node *be_new_Start(ir_node *bl, int n_outs)
726 ir_graph *irg = get_Block_irg(bl);
728 res = new_ir_node(NULL, irg, bl, op_be_Start, mode_T, 0, NULL);
729 init_node_attr(res, 0, -1);
730 for (i = 0; i < n_outs; ++i) {
731 add_register_req_out(res);
737 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_node *bl, ir_node *frame, ir_entity *ent)
742 ir_graph *irg = get_Block_irg(bl);
745 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
746 a = init_node_attr(irn, 1, 1);
749 be_node_set_reg_class_in(irn, 0, cls_frame);
750 be_node_set_reg_class_out(irn, 0, cls_frame);
752 return optimize_node(irn);
755 ir_node *be_get_FrameAddr_frame(const ir_node *node) {
756 assert(be_is_FrameAddr(node));
757 return get_irn_n(node, be_pos_FrameAddr_ptr);
760 ir_entity *be_get_FrameAddr_entity(const ir_node *node)
762 const be_frame_attr_t *attr = get_irn_generic_attr_const(node);
766 ir_node *be_new_CopyKeep(const arch_register_class_t *cls, ir_node *bl, ir_node *src, int n, ir_node *in_keep[], ir_mode *mode)
769 ir_node **in = ALLOCAN(ir_node*, n + 1);
770 ir_graph *irg = get_Block_irg(bl);
773 memcpy(&in[1], in_keep, n * sizeof(in[0]));
774 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
775 init_node_attr(irn, n + 1, 1);
776 be_node_set_reg_class_in(irn, 0, cls);
777 be_node_set_reg_class_out(irn, 0, cls);
782 ir_node *be_new_CopyKeep_single(const arch_register_class_t *cls, ir_node *bl, ir_node *src, ir_node *keep, ir_mode *mode)
784 return be_new_CopyKeep(cls, bl, src, 1, &keep, mode);
787 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
788 return get_irn_n(cpy, be_pos_CopyKeep_op);
791 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
792 set_irn_n(cpy, be_pos_CopyKeep_op, op);
795 ir_node *be_new_Barrier(ir_node *bl, int n, ir_node *in[])
799 ir_graph *irg = get_Block_irg(bl);
801 res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
802 init_node_attr(res, -1, -1);
803 for (i = 0; i < n; ++i) {
804 add_irn_n(res, in[i]);
805 add_register_req_in(res);
806 add_register_req_out(res);
812 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
814 ir_node *block = get_nodes_block(barrier);
815 ir_mode *mode = get_irn_mode(node);
816 int n = add_irn_n(barrier, node);
818 ir_node *proj = new_r_Proj(block, barrier, mode, n);
819 add_register_req_in(barrier);
820 add_register_req_out(barrier);
825 int be_has_frame_entity(const ir_node *irn)
827 switch (get_irn_opcode(irn)) {
837 ir_entity *be_get_frame_entity(const ir_node *irn)
839 if (be_has_frame_entity(irn)) {
840 const be_frame_attr_t *a = get_irn_attr_const(irn);
846 int be_get_frame_offset(const ir_node *irn)
848 assert(is_be_node(irn));
849 if (be_has_frame_entity(irn)) {
850 const be_frame_attr_t *a = get_irn_attr_const(irn);
856 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
858 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
860 assert(be_is_MemPerm(irn));
861 assert(n < be_get_MemPerm_entity_arity(irn));
863 attr->in_entities[n] = ent;
866 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
868 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
870 assert(be_is_MemPerm(irn));
871 assert(n < be_get_MemPerm_entity_arity(irn));
873 return attr->in_entities[n];
876 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
878 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
880 assert(be_is_MemPerm(irn));
881 assert(n < be_get_MemPerm_entity_arity(irn));
883 attr->out_entities[n] = ent;
886 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
888 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
890 assert(be_is_MemPerm(irn));
891 assert(n < be_get_MemPerm_entity_arity(irn));
893 return attr->out_entities[n];
896 int be_get_MemPerm_entity_arity(const ir_node *irn)
898 return get_irn_arity(irn) - 1;
901 static const arch_register_req_t *get_single_req(struct obstack *obst,
902 const arch_register_t *reg, arch_register_req_type_t additional_types)
904 arch_register_req_t *req = obstack_alloc(obst, sizeof(*req));
905 const arch_register_class_t *cls = arch_register_get_class(reg);
906 unsigned *limited_bitset;
908 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
909 rbitset_set(limited_bitset, arch_register_get_index(reg));
911 req->type = arch_register_req_type_limited | additional_types;
913 req->limited = limited_bitset;
917 void be_set_constr_single_reg_in(ir_node *node, int pos,
918 const arch_register_t *reg, arch_register_req_type_t additional_types)
920 const arch_register_req_t *req;
922 if (additional_types == 0) {
923 req = reg->single_req;
925 ir_graph *irg = get_irn_irg(node);
926 struct obstack *obst = be_get_birg_obst(irg);
927 req = get_single_req(obst, reg, additional_types);
929 be_set_constr_in(node, pos, req);
932 void be_set_constr_single_reg_out(ir_node *node, int pos,
933 const arch_register_t *reg, arch_register_req_type_t additional_types)
935 const arch_register_req_t *req;
937 /* if we have an ignore register, add ignore flag and just assign it */
938 if (reg->type & arch_register_type_ignore) {
939 additional_types |= arch_register_req_type_ignore;
942 if (additional_types == 0) {
943 req = reg->single_req;
945 ir_graph *irg = get_irn_irg(node);
946 struct obstack *obst = be_get_birg_obst(irg);
947 req = get_single_req(obst, reg, additional_types);
950 arch_irn_set_register(node, pos, reg);
951 be_set_constr_out(node, pos, req);
954 void be_node_set_reg_class_in(ir_node *irn, int pos,
955 const arch_register_class_t *cls)
957 be_set_constr_in(irn, pos, cls->class_req);
960 void be_node_set_reg_class_out(ir_node *irn, int pos,
961 const arch_register_class_t *cls)
963 be_set_constr_out(irn, pos, cls->class_req);
966 ir_node *be_get_IncSP_pred(ir_node *irn) {
967 assert(be_is_IncSP(irn));
968 return get_irn_n(irn, 0);
971 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
972 assert(be_is_IncSP(incsp));
973 set_irn_n(incsp, 0, pred);
976 void be_set_IncSP_offset(ir_node *irn, int offset)
978 be_incsp_attr_t *a = get_irn_attr(irn);
979 assert(be_is_IncSP(irn));
983 int be_get_IncSP_offset(const ir_node *irn)
985 const be_incsp_attr_t *a = get_irn_attr_const(irn);
986 assert(be_is_IncSP(irn));
990 int be_get_IncSP_align(const ir_node *irn)
992 const be_incsp_attr_t *a = get_irn_attr_const(irn);
993 assert(be_is_IncSP(irn));
997 ir_node *be_spill(ir_node *block, ir_node *irn)
999 ir_graph *irg = get_Block_irg(block);
1000 ir_node *frame = get_irg_frame(irg);
1001 const arch_register_class_t *cls = arch_get_irn_reg_class_out(irn);
1002 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
1005 spill = be_new_Spill(cls, cls_frame, block, frame, irn);
1009 ir_node *be_reload(const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill)
1012 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
1013 ir_graph *irg = get_Block_irg(bl);
1014 ir_node *frame = get_irg_frame(irg);
1015 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
1017 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
1019 reload = be_new_Reload(cls, cls_frame, bl, frame, spill, mode);
1021 if (is_Block(insert)) {
1022 insert = sched_skip(insert, 0, sched_skip_cf_predicator, NULL);
1023 sched_add_after(insert, reload);
1025 sched_add_before(insert, reload);
1033 | _ \ ___ __ _ | _ \ ___ __ _ ___
1034 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
1035 | _ < __/ (_| | | _ < __/ (_| \__ \
1036 |_| \_\___|\__, | |_| \_\___|\__, |___/
1042 static const arch_register_req_t *be_node_get_in_reg_req(
1043 const ir_node *irn, int pos)
1045 const be_node_attr_t *a = get_irn_attr_const(irn);
1048 if (pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
1049 return arch_no_register_req;
1051 return a->reg_data[pos].in_req;
1054 static arch_irn_class_t be_node_classify(const ir_node *irn)
1056 switch (get_irn_opcode(irn)) {
1057 case beo_Spill: return arch_irn_class_spill;
1058 case beo_Reload: return arch_irn_class_reload;
1059 case beo_Perm: return arch_irn_class_perm;
1060 case beo_Copy: return arch_irn_class_copy;
1065 static ir_entity *be_node_get_frame_entity(const ir_node *irn)
1067 return be_get_frame_entity(irn);
1070 static void be_node_set_frame_entity(ir_node *irn, ir_entity *ent)
1074 assert(be_has_frame_entity(irn));
1076 a = get_irn_attr(irn);
1080 static void be_node_set_frame_offset(ir_node *irn, int offset)
1084 if (!be_has_frame_entity(irn))
1087 a = get_irn_attr(irn);
1091 static int be_node_get_sp_bias(const ir_node *irn)
1093 if (be_is_IncSP(irn))
1094 return be_get_IncSP_offset(irn);
1095 if (be_is_Call(irn))
1096 return -(int)be_Call_get_pop(irn);
1102 ___ ____ _ _ _ _ _ _
1103 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1104 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1105 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1106 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1111 static const arch_irn_ops_t be_node_irn_ops = {
1112 be_node_get_in_reg_req,
1114 be_node_get_frame_entity,
1115 be_node_set_frame_entity,
1116 be_node_set_frame_offset,
1117 be_node_get_sp_bias,
1118 NULL, /* get_inverse */
1119 NULL, /* get_op_estimated_cost */
1120 NULL, /* possible_memory_operand */
1121 NULL, /* perform_memory_operand */
1124 static const arch_register_req_t *dummy_reg_req(
1125 const ir_node *node, int pos)
1129 return arch_no_register_req;
1132 static arch_irn_class_t dummy_classify(const ir_node *node)
1138 static ir_entity* dummy_get_frame_entity(const ir_node *node)
1144 static void dummy_set_frame_entity(ir_node *node, ir_entity *entity)
1148 panic("dummy_set_frame_entity() should not be called");
1151 static void dummy_set_frame_offset(ir_node *node, int bias)
1155 panic("dummy_set_frame_offset() should not be called");
1158 static int dummy_get_sp_bias(const ir_node *node)
1164 /* for "middleend" nodes */
1165 static const arch_irn_ops_t dummy_be_irn_ops = {
1168 dummy_get_frame_entity,
1169 dummy_set_frame_entity,
1170 dummy_set_frame_offset,
1172 NULL, /* get_inverse */
1173 NULL, /* get_op_estimated_cost */
1174 NULL, /* possible_memory_operand */
1175 NULL, /* perform_memory_operand */
1179 ____ _ _ ___ ____ _ _ _ _ _ _
1180 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1181 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1182 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1183 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1187 ir_node *be_new_Phi(ir_node *block, int n_ins, ir_node **ins, ir_mode *mode,
1188 const arch_register_class_t *cls)
1190 struct obstack *obst = be_get_birg_obst(get_irn_irg(block));
1191 backend_info_t *info;
1193 ir_node *phi = new_r_Phi(block, n_ins, ins, mode);
1194 info = be_get_info(phi);
1195 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
1196 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
1198 info->out_infos[0].req = arch_no_register_req;
1200 info->out_infos[0].req = cls->class_req;
1207 * Guess correct register class of a phi node by looking at its arguments
1209 static const arch_register_req_t *get_Phi_reg_req_recursive(const ir_node *phi,
1212 int n = get_irn_arity(phi);
1216 if (*visited && pset_find_ptr(*visited, phi))
1219 for (i = 0; i < n; ++i) {
1220 op = get_irn_n(phi, i);
1221 /* Matze: don't we unnecessary constraint our phis with this?
1222 * we only need to take the regclass IMO*/
1224 return arch_get_register_req_out(op);
1228 * The operands of that Phi were all Phis themselves.
1229 * We have to start a DFS for a non-Phi argument now.
1232 *visited = pset_new_ptr(16);
1234 pset_insert_ptr(*visited, phi);
1236 for (i = 0; i < n; ++i) {
1237 const arch_register_req_t *req;
1238 op = get_irn_n(phi, i);
1239 req = get_Phi_reg_req_recursive(op, visited);
1247 static const arch_register_req_t *phi_get_irn_reg_req(const ir_node *node,
1250 backend_info_t *info = be_get_info(node);
1251 const arch_register_req_t *req = info->out_infos[0].req;
1255 if (!mode_is_datab(get_irn_mode(node))) {
1256 req = arch_no_register_req;
1258 pset *visited = NULL;
1260 req = get_Phi_reg_req_recursive(node, &visited);
1261 assert(req->cls != NULL);
1262 req = req->cls->class_req;
1264 if (visited != NULL)
1267 info->out_infos[0].req = req;
1273 void be_set_phi_reg_req(ir_node *node, const arch_register_req_t *req)
1275 backend_info_t *info = be_get_info(node);
1276 info->out_infos[0].req = req;
1278 assert(mode_is_datab(get_irn_mode(node)));
1281 int be_dump_phi_reg_reqs(ir_node *node, FILE *F, dump_reason_t reason)
1284 case dump_node_opcode_txt:
1285 fputs(get_op_name(get_irn_op(node)), F);
1287 case dump_node_mode_txt:
1288 fprintf(F, "%s", get_mode_name(get_irn_mode(node)));
1290 case dump_node_nodeattr_txt:
1292 case dump_node_info_txt:
1294 backend_info_t *info = be_get_info(node);
1295 if (info != NULL && info->out_infos[0].req != NULL) {
1296 arch_dump_reqs_and_registers(F, node);
1308 static const arch_irn_ops_t phi_irn_ops = {
1309 phi_get_irn_reg_req,
1311 dummy_get_frame_entity,
1312 dummy_set_frame_entity,
1313 dummy_set_frame_offset,
1315 NULL, /* get_inverse */
1316 NULL, /* get_op_estimated_cost */
1317 NULL, /* possible_memory_operand */
1318 NULL, /* perform_memory_operand */
1323 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1324 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1325 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1326 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1331 * ir_op-Operation: dump a be node to file
1333 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1335 be_node_attr_t *at = get_irn_attr(irn);
1337 assert(is_be_node(irn));
1340 case dump_node_opcode_txt:
1341 fputs(get_op_name(get_irn_op(irn)), f);
1343 case dump_node_mode_txt:
1344 if (be_is_Perm(irn) || be_is_Copy(irn) || be_is_CopyKeep(irn)) {
1345 fprintf(f, " %s", get_mode_name(get_irn_mode(irn)));
1348 case dump_node_nodeattr_txt:
1349 if (be_is_Call(irn)) {
1350 be_call_attr_t *a = (be_call_attr_t *) at;
1352 fprintf(f, " [%s] ", get_entity_name(a->ent));
1354 if (be_is_IncSP(irn)) {
1355 const be_incsp_attr_t *attr = get_irn_generic_attr_const(irn);
1356 if (attr->offset == BE_STACK_FRAME_SIZE_EXPAND) {
1357 fprintf(f, " [Setup Stackframe] ");
1358 } else if (attr->offset == BE_STACK_FRAME_SIZE_SHRINK) {
1359 fprintf(f, " [Destroy Stackframe] ");
1361 fprintf(f, " [%d] ", attr->offset);
1365 case dump_node_info_txt:
1366 arch_dump_reqs_and_registers(f, irn);
1368 if (be_has_frame_entity(irn)) {
1369 be_frame_attr_t *a = (be_frame_attr_t *) at;
1371 unsigned size = get_type_size_bytes(get_entity_type(a->ent));
1372 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bytes\n",
1373 a->ent, a->offset, a->offset, size, size);
1378 switch (get_irn_opcode(irn)) {
1381 be_incsp_attr_t *a = (be_incsp_attr_t *) at;
1382 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1383 fprintf(f, "offset: FRAME_SIZE\n");
1384 else if (a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1385 fprintf(f, "offset: -FRAME SIZE\n");
1387 fprintf(f, "offset: %u\n", a->offset);
1392 be_call_attr_t *a = (be_call_attr_t *) at;
1395 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1401 for (i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1402 ir_entity *in, *out;
1403 in = be_get_MemPerm_in_entity(irn, i);
1404 out = be_get_MemPerm_out_entity(irn, i);
1406 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1409 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1425 * Copies the backend specific attributes from old node to new node.
1427 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1429 const be_node_attr_t *old_attr = get_irn_attr_const(old_node);
1430 be_node_attr_t *new_attr = get_irn_attr(new_node);
1431 ir_graph *irg = get_irn_irg(new_node);
1432 struct obstack *obst = be_get_birg_obst(irg);
1433 backend_info_t *old_info = be_get_info(old_node);
1434 backend_info_t *new_info = be_get_info(new_node);
1436 assert(is_be_node(old_node));
1437 assert(is_be_node(new_node));
1439 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1441 if (old_info->out_infos != NULL) {
1442 unsigned n_outs = ARR_LEN(old_info->out_infos);
1443 /* need dyanmic out infos? */
1444 if (be_is_Barrier(new_node) || be_is_Perm(new_node)) {
1445 new_info->out_infos = NEW_ARR_F(reg_out_info_t, n_outs);
1447 new_info->out_infos = NEW_ARR_D(reg_out_info_t, obst, n_outs);
1449 memcpy(new_info->out_infos, old_info->out_infos,
1450 n_outs * sizeof(new_info->out_infos[0]));
1452 new_info->out_infos = NULL;
1456 if (old_attr->reg_data != NULL) {
1457 unsigned n_ins = ARR_LEN(old_attr->reg_data);
1458 /* need dynamic in infos? */
1459 if (get_irn_op(old_node)->opar == oparity_dynamic) {
1460 new_attr->reg_data = NEW_ARR_F(be_reg_data_t, n_ins);
1462 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, n_ins);
1464 memcpy(new_attr->reg_data, old_attr->reg_data,
1465 n_ins * sizeof(be_reg_data_t));
1467 new_attr->reg_data = NULL;
1471 static const ir_op_ops be_node_op_ops = {
1492 int is_be_node(const ir_node *irn)
1494 return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops;
1497 void be_init_op(void)
1501 /* Acquire all needed opcodes. */
1502 op_be_Spill = new_ir_op(beo_Spill, "be_Spill", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
1503 op_be_Reload = new_ir_op(beo_Reload, "be_Reload", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
1504 op_be_Perm = new_ir_op(beo_Perm, "be_Perm", op_pin_state_pinned, N, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1505 op_be_MemPerm = new_ir_op(beo_MemPerm, "be_MemPerm", op_pin_state_pinned, N, oparity_variable, 0, sizeof(be_memperm_attr_t), &be_node_op_ops);
1506 op_be_Copy = new_ir_op(beo_Copy, "be_Copy", op_pin_state_floats, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1507 op_be_Keep = new_ir_op(beo_Keep, "be_Keep", op_pin_state_floats, K, oparity_dynamic, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1508 op_be_CopyKeep = new_ir_op(beo_CopyKeep, "be_CopyKeep", op_pin_state_floats, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1509 op_be_Call = new_ir_op(beo_Call, "be_Call", op_pin_state_pinned, F|M, oparity_variable, 0, sizeof(be_call_attr_t), &be_node_op_ops);
1510 op_be_Return = new_ir_op(beo_Return, "be_Return", op_pin_state_pinned, X, oparity_dynamic, 0, sizeof(be_return_attr_t), &be_node_op_ops);
1511 op_be_AddSP = new_ir_op(beo_AddSP, "be_AddSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1512 op_be_SubSP = new_ir_op(beo_SubSP, "be_SubSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1513 op_be_IncSP = new_ir_op(beo_IncSP, "be_IncSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_incsp_attr_t), &be_node_op_ops);
1514 op_be_Start = new_ir_op(beo_Start, "be_Start", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1515 op_be_FrameAddr = new_ir_op(beo_FrameAddr, "be_FrameAddr", op_pin_state_floats, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
1516 op_be_Barrier = new_ir_op(beo_Barrier, "be_Barrier", op_pin_state_pinned, N, oparity_dynamic, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1518 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
1519 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
1520 op_be_Perm->ops.node_cmp_attr = node_cmp_attr;
1521 op_be_MemPerm->ops.node_cmp_attr = node_cmp_attr;
1522 op_be_Copy->ops.node_cmp_attr = node_cmp_attr;
1523 op_be_Keep->ops.node_cmp_attr = node_cmp_attr;
1524 op_be_CopyKeep->ops.node_cmp_attr = node_cmp_attr;
1525 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
1526 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
1527 op_be_AddSP->ops.node_cmp_attr = node_cmp_attr;
1528 op_be_SubSP->ops.node_cmp_attr = node_cmp_attr;
1529 op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr;
1530 op_be_Start->ops.node_cmp_attr = node_cmp_attr;
1531 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
1532 op_be_Barrier->ops.node_cmp_attr = node_cmp_attr;
1534 /* attach out dummy_ops to middle end nodes */
1535 for (opc = iro_First; opc <= iro_Last; ++opc) {
1536 ir_op *op = get_irp_opcode(opc);
1537 assert(op->ops.be_ops == NULL);
1538 op->ops.be_ops = &dummy_be_irn_ops;
1541 op_Phi->ops.be_ops = &phi_irn_ops;