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;
123 ir_op *op_be_RegParams;
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);
333 * For spills and reloads, we return "none" as requirement for frame
334 * pointer, so every input is ok. Some backends need this (e.g. STA).
335 * Matze: we should investigate if this is really needed, this solution
336 * looks very hacky to me
338 be_set_constr_in(res, be_pos_Spill_frame, arch_no_register_req);
343 ir_node *be_new_Reload(const arch_register_class_t *cls,
344 const arch_register_class_t *cls_frame, ir_node *block,
345 ir_node *frame, ir_node *mem, ir_mode *mode)
349 ir_graph *irg = get_Block_irg(block);
353 res = new_ir_node(NULL, irg, block, op_be_Reload, mode, 2, in);
355 init_node_attr(res, 2, 2);
356 be_node_set_reg_class_out(res, 0, cls);
357 be_node_set_reg_class_in(res, be_pos_Reload_frame, cls_frame);
358 arch_irn_set_flags(res, arch_irn_flags_rematerializable);
361 * For spills and reloads, we return "none" as requirement for frame
362 * pointer, so every input is ok. Some backends need this (e.g. STA).
363 * Matze: we should investigate if this is really needed, this solution
364 * looks very hacky to me
366 be_set_constr_in(res, be_pos_Reload_frame, arch_no_register_req);
371 ir_node *be_get_Reload_mem(const ir_node *irn)
373 assert(be_is_Reload(irn));
374 return get_irn_n(irn, be_pos_Reload_mem);
377 ir_node *be_get_Reload_frame(const ir_node *irn)
379 assert(be_is_Reload(irn));
380 return get_irn_n(irn, be_pos_Reload_frame);
383 ir_node *be_get_Spill_val(const ir_node *irn)
385 assert(be_is_Spill(irn));
386 return get_irn_n(irn, be_pos_Spill_val);
389 ir_node *be_get_Spill_frame(const ir_node *irn)
391 assert(be_is_Spill(irn));
392 return get_irn_n(irn, be_pos_Spill_frame);
395 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_node *block,
396 int n, ir_node *in[])
399 ir_graph *irg = get_Block_irg(block);
401 ir_node *irn = new_ir_node(NULL, irg, block, op_be_Perm, mode_T, n, in);
402 init_node_attr(irn, n, n);
403 for (i = 0; i < n; ++i) {
404 be_node_set_reg_class_in(irn, i, cls);
405 be_node_set_reg_class_out(irn, i, cls);
411 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
413 int arity = get_irn_arity(perm);
414 be_reg_data_t *old_data = ALLOCAN(be_reg_data_t, arity);
415 reg_out_info_t *old_infos = ALLOCAN(reg_out_info_t, arity);
416 be_node_attr_t *attr = get_irn_attr(perm);
417 backend_info_t *info = be_get_info(perm);
422 assert(be_is_Perm(perm));
423 assert(new_size <= arity);
425 new_in = alloca(new_size * sizeof(*new_in));
427 /* save the old register data */
428 memcpy(old_data, attr->reg_data, arity * sizeof(old_data[0]));
429 memcpy(old_infos, info->out_infos, arity * sizeof(old_infos[0]));
431 /* compose the new in array and set the new register data directly in place */
432 for (i = 0; i < new_size; ++i) {
434 new_in[i] = get_irn_n(perm, idx);
435 attr->reg_data[i] = old_data[idx];
436 info->out_infos[i] = old_infos[idx];
439 set_irn_in(perm, new_size, new_in);
442 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_node *bl, int n, ir_node *in[])
444 ir_graph *irg = get_Block_irg(bl);
445 ir_node *frame = get_irg_frame(irg);
446 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
447 const arch_register_t *sp = arch_env->sp;
449 be_memperm_attr_t *attr;
453 real_in = ALLOCAN(ir_node*, n + 1);
455 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
457 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
459 init_node_attr(irn, n + 1, n + 1);
460 be_node_set_reg_class_in(irn, 0, sp->reg_class);
461 for (i = 0; i < n; ++i) {
462 be_node_set_reg_class_in(irn, i + 1, cls_frame);
463 be_node_set_reg_class_out(irn, i, cls_frame);
466 attr = get_irn_attr(irn);
467 attr->in_entities = OALLOCNZ(irg->obst, ir_entity*, n);
468 attr->out_entities = OALLOCNZ(irg->obst, ir_entity*, n);
473 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_node *bl, ir_node *op)
477 arch_register_req_t *req;
478 ir_graph *irg = get_Block_irg(bl);
481 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
482 init_node_attr(res, 1, 1);
483 be_node_set_reg_class_in(res, 0, cls);
484 be_node_set_reg_class_out(res, 0, cls);
486 req = allocate_reg_req(res);
488 req->type = arch_register_req_type_should_be_same;
489 req->other_same = 1U << 0;
490 be_set_constr_out(res, 0, req);
495 ir_node *be_get_Copy_op(const ir_node *cpy) {
496 return get_irn_n(cpy, be_pos_Copy_op);
499 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
500 set_irn_n(cpy, be_pos_Copy_op, op);
503 ir_node *be_new_Keep(ir_node *block, int n, ir_node *in[])
507 ir_graph *irg = get_Block_irg(block);
509 res = new_ir_node(NULL, irg, block, op_be_Keep, mode_ANY, -1, NULL);
510 init_node_attr(res, -1, 1);
512 for (i = 0; i < n; ++i) {
513 add_irn_n(res, in[i]);
514 add_register_req_in(res);
521 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
525 assert(be_is_Keep(keep));
526 n = add_irn_n(keep, node);
527 add_register_req_in(keep);
528 be_node_set_reg_class_in(keep, n, cls);
531 /* creates a be_Call */
532 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem,
533 ir_node *sp, ir_node *ptr, int n_outs, int n, ir_node *in[],
537 int real_n = be_pos_Call_first_arg + n;
541 NEW_ARR_A(ir_node *, real_in, real_n);
542 real_in[be_pos_Call_mem] = mem;
543 real_in[be_pos_Call_sp] = sp;
544 real_in[be_pos_Call_ptr] = ptr;
545 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
547 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
548 a = init_node_attr(irn, real_n, n_outs);
550 a->call_tp = call_tp;
555 /* Gets the call entity or NULL if this is no static call. */
556 ir_entity *be_Call_get_entity(const ir_node *call) {
557 const be_call_attr_t *a = get_irn_attr_const(call);
558 assert(be_is_Call(call));
562 /* Sets the call entity. */
563 void be_Call_set_entity(ir_node *call, ir_entity *ent) {
564 be_call_attr_t *a = get_irn_attr(call);
565 assert(be_is_Call(call));
569 /* Gets the call type. */
570 ir_type *be_Call_get_type(ir_node *call) {
571 const be_call_attr_t *a = get_irn_attr_const(call);
572 assert(be_is_Call(call));
576 /* Sets the call type. */
577 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
578 be_call_attr_t *a = get_irn_attr(call);
579 assert(be_is_Call(call));
580 a->call_tp = call_tp;
583 void be_Call_set_pop(ir_node *call, unsigned pop) {
584 be_call_attr_t *a = get_irn_attr(call);
588 unsigned be_Call_get_pop(const ir_node *call) {
589 const be_call_attr_t *a = get_irn_attr_const(call);
593 /* Construct a new be_Return. */
594 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
595 unsigned pop, int n, ir_node *in[])
601 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL);
602 init_node_attr(res, -1, 1);
603 for (i = 0; i < n; ++i) {
604 add_irn_n(res, in[i]);
605 add_register_req_in(res);
607 be_set_constr_out(res, 0, arch_no_register_req);
609 a = get_irn_attr(res);
610 a->num_ret_vals = n_res;
617 /* Returns the number of real returns values */
618 int be_Return_get_n_rets(const ir_node *ret) {
619 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
620 return a->num_ret_vals;
623 /* return the number of bytes that should be popped from stack when executing the Return. */
624 unsigned be_Return_get_pop(const ir_node *ret) {
625 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
629 /* return non-zero, if number of popped bytes must be always emitted */
630 int be_Return_get_emit_pop(const ir_node *ret) {
631 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
635 /* return non-zero, if number of popped bytes must be always emitted */
636 void be_Return_set_emit_pop(ir_node *ret, int emit_pop) {
637 be_return_attr_t *a = get_irn_generic_attr(ret);
638 a->emit_pop = emit_pop;
641 int be_Return_append_node(ir_node *ret, ir_node *node) {
644 pos = add_irn_n(ret, node);
645 add_register_req_in(ret);
650 ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *bl,
651 ir_node *old_sp, int offset, int align)
656 ir_graph *irg = get_Block_irg(bl);
659 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode,
660 sizeof(in) / sizeof(in[0]), in);
661 a = init_node_attr(irn, 1, 1);
665 /* Set output constraint to stack register. */
666 be_node_set_reg_class_in(irn, 0, sp->reg_class);
667 be_set_constr_single_reg_out(irn, 0, sp, arch_register_req_type_produces_sp);
672 ir_node *be_new_AddSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp,
677 ir_node *in[be_pos_AddSP_last];
678 const arch_register_class_t *cls;
681 in[be_pos_AddSP_old_sp] = old_sp;
682 in[be_pos_AddSP_size] = sz;
684 irg = get_Block_irg(bl);
685 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
686 a = init_node_attr(irn, be_pos_AddSP_last, pn_be_AddSP_last);
688 /* Set output constraint to stack register. */
689 be_set_constr_single_reg_in(irn, be_pos_AddSP_old_sp, sp, 0);
690 be_node_set_reg_class_in(irn, be_pos_AddSP_size, arch_register_get_class(sp));
691 be_set_constr_single_reg_out(irn, pn_be_AddSP_sp, sp, arch_register_req_type_produces_sp);
693 cls = arch_register_get_class(sp);
698 ir_node *be_new_SubSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp, ir_node *sz)
702 ir_node *in[be_pos_SubSP_last];
705 in[be_pos_SubSP_old_sp] = old_sp;
706 in[be_pos_SubSP_size] = sz;
708 irg = get_Block_irg(bl);
709 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
710 a = init_node_attr(irn, be_pos_SubSP_last, pn_be_SubSP_last);
712 /* Set output constraint to stack register. */
713 be_set_constr_single_reg_in(irn, be_pos_SubSP_old_sp, sp, 0);
714 be_node_set_reg_class_in(irn, be_pos_SubSP_size, arch_register_get_class(sp));
715 be_set_constr_single_reg_out(irn, pn_be_SubSP_sp, sp, arch_register_req_type_produces_sp);
720 ir_node *be_new_RegParams(ir_node *bl, int n_outs)
724 ir_graph *irg = get_Block_irg(bl);
726 res = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, NULL);
727 init_node_attr(res, 0, -1);
728 for (i = 0; i < n_outs; ++i) {
729 add_register_req_out(res);
735 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_node *bl, ir_node *frame, ir_entity *ent)
740 ir_graph *irg = get_Block_irg(bl);
743 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
744 a = init_node_attr(irn, 1, 1);
747 be_node_set_reg_class_in(irn, 0, cls_frame);
748 be_node_set_reg_class_out(irn, 0, cls_frame);
750 return optimize_node(irn);
753 ir_node *be_get_FrameAddr_frame(const ir_node *node) {
754 assert(be_is_FrameAddr(node));
755 return get_irn_n(node, be_pos_FrameAddr_ptr);
758 ir_entity *be_get_FrameAddr_entity(const ir_node *node)
760 const be_frame_attr_t *attr = get_irn_generic_attr_const(node);
764 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)
767 ir_node **in = ALLOCAN(ir_node*, n + 1);
768 ir_graph *irg = get_Block_irg(bl);
771 memcpy(&in[1], in_keep, n * sizeof(in[0]));
772 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
773 init_node_attr(irn, n + 1, 1);
774 be_node_set_reg_class_in(irn, 0, cls);
775 be_node_set_reg_class_out(irn, 0, cls);
780 ir_node *be_new_CopyKeep_single(const arch_register_class_t *cls, ir_node *bl, ir_node *src, ir_node *keep, ir_mode *mode)
782 return be_new_CopyKeep(cls, bl, src, 1, &keep, mode);
785 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
786 return get_irn_n(cpy, be_pos_CopyKeep_op);
789 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
790 set_irn_n(cpy, be_pos_CopyKeep_op, op);
793 ir_node *be_new_Barrier(ir_node *bl, int n, ir_node *in[])
797 ir_graph *irg = get_Block_irg(bl);
799 res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
800 init_node_attr(res, -1, -1);
801 for (i = 0; i < n; ++i) {
802 add_irn_n(res, in[i]);
803 add_register_req_in(res);
804 add_register_req_out(res);
810 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
812 ir_node *block = get_nodes_block(barrier);
813 ir_mode *mode = get_irn_mode(node);
814 int n = add_irn_n(barrier, node);
816 ir_node *proj = new_r_Proj(block, barrier, mode, n);
817 add_register_req_in(barrier);
818 add_register_req_out(barrier);
823 int be_has_frame_entity(const ir_node *irn)
825 switch (get_irn_opcode(irn)) {
835 ir_entity *be_get_frame_entity(const ir_node *irn)
837 if (be_has_frame_entity(irn)) {
838 const be_frame_attr_t *a = get_irn_attr_const(irn);
844 int be_get_frame_offset(const ir_node *irn)
846 assert(is_be_node(irn));
847 if (be_has_frame_entity(irn)) {
848 const be_frame_attr_t *a = get_irn_attr_const(irn);
854 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
856 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
858 assert(be_is_MemPerm(irn));
859 assert(n < be_get_MemPerm_entity_arity(irn));
861 attr->in_entities[n] = ent;
864 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
866 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
868 assert(be_is_MemPerm(irn));
869 assert(n < be_get_MemPerm_entity_arity(irn));
871 return attr->in_entities[n];
874 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
876 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
878 assert(be_is_MemPerm(irn));
879 assert(n < be_get_MemPerm_entity_arity(irn));
881 attr->out_entities[n] = ent;
884 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
886 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
888 assert(be_is_MemPerm(irn));
889 assert(n < be_get_MemPerm_entity_arity(irn));
891 return attr->out_entities[n];
894 int be_get_MemPerm_entity_arity(const ir_node *irn)
896 return get_irn_arity(irn) - 1;
899 static const arch_register_req_t *get_single_req(struct obstack *obst,
900 const arch_register_t *reg, arch_register_req_type_t additional_types)
902 arch_register_req_t *req = obstack_alloc(obst, sizeof(*req));
903 const arch_register_class_t *cls = arch_register_get_class(reg);
904 unsigned *limited_bitset;
906 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
907 rbitset_set(limited_bitset, arch_register_get_index(reg));
909 req->type = arch_register_req_type_limited | additional_types;
911 req->limited = limited_bitset;
915 void be_set_constr_single_reg_in(ir_node *node, int pos,
916 const arch_register_t *reg, arch_register_req_type_t additional_types)
918 const arch_register_req_t *req;
920 if (additional_types == 0) {
921 req = reg->single_req;
923 ir_graph *irg = get_irn_irg(node);
924 struct obstack *obst = be_get_birg_obst(irg);
925 req = get_single_req(obst, reg, additional_types);
927 be_set_constr_in(node, pos, req);
930 void be_set_constr_single_reg_out(ir_node *node, int pos,
931 const arch_register_t *reg, arch_register_req_type_t additional_types)
933 const arch_register_req_t *req;
935 /* if we have an ignore register, add ignore flag and just assign it */
936 if (reg->type & arch_register_type_ignore) {
937 additional_types |= arch_register_req_type_ignore;
940 if (additional_types == 0) {
941 req = reg->single_req;
943 ir_graph *irg = get_irn_irg(node);
944 struct obstack *obst = be_get_birg_obst(irg);
945 req = get_single_req(obst, reg, additional_types);
948 arch_irn_set_register(node, pos, reg);
949 be_set_constr_out(node, pos, req);
952 void be_node_set_reg_class_in(ir_node *irn, int pos,
953 const arch_register_class_t *cls)
955 be_set_constr_in(irn, pos, cls->class_req);
958 void be_node_set_reg_class_out(ir_node *irn, int pos,
959 const arch_register_class_t *cls)
961 be_set_constr_out(irn, pos, cls->class_req);
964 ir_node *be_get_IncSP_pred(ir_node *irn) {
965 assert(be_is_IncSP(irn));
966 return get_irn_n(irn, 0);
969 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
970 assert(be_is_IncSP(incsp));
971 set_irn_n(incsp, 0, pred);
974 void be_set_IncSP_offset(ir_node *irn, int offset)
976 be_incsp_attr_t *a = get_irn_attr(irn);
977 assert(be_is_IncSP(irn));
981 int be_get_IncSP_offset(const ir_node *irn)
983 const be_incsp_attr_t *a = get_irn_attr_const(irn);
984 assert(be_is_IncSP(irn));
988 int be_get_IncSP_align(const ir_node *irn)
990 const be_incsp_attr_t *a = get_irn_attr_const(irn);
991 assert(be_is_IncSP(irn));
995 ir_node *be_spill(ir_node *block, ir_node *irn)
997 ir_graph *irg = get_Block_irg(block);
998 ir_node *frame = get_irg_frame(irg);
999 const arch_register_class_t *cls = arch_get_irn_reg_class_out(irn);
1000 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
1003 spill = be_new_Spill(cls, cls_frame, block, frame, irn);
1007 ir_node *be_reload(const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill)
1010 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
1011 ir_graph *irg = get_Block_irg(bl);
1012 ir_node *frame = get_irg_frame(irg);
1013 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
1015 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
1017 reload = be_new_Reload(cls, cls_frame, bl, frame, spill, mode);
1019 if (is_Block(insert)) {
1020 insert = sched_skip(insert, 0, sched_skip_cf_predicator, NULL);
1021 sched_add_after(insert, reload);
1023 sched_add_before(insert, reload);
1031 | _ \ ___ __ _ | _ \ ___ __ _ ___
1032 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
1033 | _ < __/ (_| | | _ < __/ (_| \__ \
1034 |_| \_\___|\__, | |_| \_\___|\__, |___/
1040 static const arch_register_req_t *be_node_get_out_reg_req(
1041 const ir_node *irn, int pos)
1043 const backend_info_t *info = be_get_info(irn);
1044 assert(pos < ARR_LEN(info->out_infos));
1045 return info->out_infos[pos].req;
1048 static const arch_register_req_t *be_node_get_in_reg_req(
1049 const ir_node *irn, int pos)
1051 const be_node_attr_t *a = get_irn_attr_const(irn);
1054 if (pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
1055 return arch_no_register_req;
1057 return a->reg_data[pos].in_req;
1060 static arch_irn_class_t be_node_classify(const ir_node *irn)
1062 switch (get_irn_opcode(irn)) {
1063 case beo_Spill: return arch_irn_class_spill;
1064 case beo_Reload: return arch_irn_class_reload;
1065 case beo_Perm: return arch_irn_class_perm;
1066 case beo_Copy: return arch_irn_class_copy;
1071 static ir_entity *be_node_get_frame_entity(const ir_node *irn)
1073 return be_get_frame_entity(irn);
1076 static void be_node_set_frame_entity(ir_node *irn, ir_entity *ent)
1080 assert(be_has_frame_entity(irn));
1082 a = get_irn_attr(irn);
1086 static void be_node_set_frame_offset(ir_node *irn, int offset)
1090 if (!be_has_frame_entity(irn))
1093 a = get_irn_attr(irn);
1097 static int be_node_get_sp_bias(const ir_node *irn)
1099 if (be_is_IncSP(irn))
1100 return be_get_IncSP_offset(irn);
1101 if (be_is_Call(irn))
1102 return -(int)be_Call_get_pop(irn);
1108 ___ ____ _ _ _ _ _ _
1109 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1110 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1111 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1112 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1117 static const arch_irn_ops_t be_node_irn_ops = {
1118 be_node_get_in_reg_req,
1119 be_node_get_out_reg_req,
1121 be_node_get_frame_entity,
1122 be_node_set_frame_entity,
1123 be_node_set_frame_offset,
1124 be_node_get_sp_bias,
1125 NULL, /* get_inverse */
1126 NULL, /* get_op_estimated_cost */
1127 NULL, /* possible_memory_operand */
1128 NULL, /* perform_memory_operand */
1131 static const arch_register_req_t *dummy_reg_req(
1132 const ir_node *node, int pos)
1136 return arch_no_register_req;
1139 static arch_irn_class_t dummy_classify(const ir_node *node)
1145 static ir_entity* dummy_get_frame_entity(const ir_node *node)
1151 static void dummy_set_frame_entity(ir_node *node, ir_entity *entity)
1155 panic("dummy_set_frame_entity() should not be called");
1158 static void dummy_set_frame_offset(ir_node *node, int bias)
1162 panic("dummy_set_frame_offset() should not be called");
1165 static int dummy_get_sp_bias(const ir_node *node)
1171 /* for "middleend" nodes */
1172 static const arch_irn_ops_t dummy_be_irn_ops = {
1176 dummy_get_frame_entity,
1177 dummy_set_frame_entity,
1178 dummy_set_frame_offset,
1180 NULL, /* get_inverse */
1181 NULL, /* get_op_estimated_cost */
1182 NULL, /* possible_memory_operand */
1183 NULL, /* perform_memory_operand */
1187 ____ _ _ ___ ____ _ _ _ _ _ _
1188 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1189 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1190 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1191 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1196 * Guess correct register class of a phi node by looking at its arguments
1198 static const arch_register_req_t *get_Phi_reg_req_recursive(const ir_node *phi,
1201 int n = get_irn_arity(phi);
1205 if (*visited && pset_find_ptr(*visited, phi))
1208 for (i = 0; i < n; ++i) {
1209 op = get_irn_n(phi, i);
1210 /* Matze: don't we unnecessary constraint our phis with this?
1211 * we only need to take the regclass IMO*/
1213 return arch_get_register_req_out(op);
1217 * The operands of that Phi were all Phis themselves.
1218 * We have to start a DFS for a non-Phi argument now.
1221 *visited = pset_new_ptr(16);
1223 pset_insert_ptr(*visited, phi);
1225 for (i = 0; i < n; ++i) {
1226 const arch_register_req_t *req;
1227 op = get_irn_n(phi, i);
1228 req = get_Phi_reg_req_recursive(op, visited);
1236 static const arch_register_req_t *phi_get_irn_reg_req(const ir_node *node,
1239 backend_info_t *info = be_get_info(node);
1240 const arch_register_req_t *req = info->out_infos[0].req;
1244 if (!mode_is_datab(get_irn_mode(node))) {
1245 req = arch_no_register_req;
1247 pset *visited = NULL;
1249 req = get_Phi_reg_req_recursive(node, &visited);
1250 assert(req->cls != NULL);
1251 req = req->cls->class_req;
1253 if (visited != NULL)
1256 info->out_infos[0].req = req;
1262 void be_set_phi_reg_req(ir_node *node, const arch_register_req_t *req)
1264 backend_info_t *info = be_get_info(node);
1265 info->out_infos[0].req = req;
1267 assert(mode_is_datab(get_irn_mode(node)));
1270 int be_dump_phi_reg_reqs(ir_node *node, FILE *F, dump_reason_t reason)
1273 case dump_node_opcode_txt:
1274 fputs(get_op_name(get_irn_op(node)), F);
1276 case dump_node_mode_txt:
1277 fprintf(F, "%s", get_mode_name(get_irn_mode(node)));
1279 case dump_node_nodeattr_txt:
1281 case dump_node_info_txt:
1282 arch_dump_reqs_and_registers(F, node);
1292 static const arch_irn_ops_t phi_irn_ops = {
1293 phi_get_irn_reg_req,
1294 phi_get_irn_reg_req,
1296 dummy_get_frame_entity,
1297 dummy_set_frame_entity,
1298 dummy_set_frame_offset,
1300 NULL, /* get_inverse */
1301 NULL, /* get_op_estimated_cost */
1302 NULL, /* possible_memory_operand */
1303 NULL, /* perform_memory_operand */
1308 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1309 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1310 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1311 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1316 * Dumps node register requirements to a file.
1318 static void dump_node_reqs(FILE *F, ir_node *node)
1321 be_node_attr_t *a = get_irn_attr(node);
1322 int len = ARR_LEN(a->reg_data);
1323 const backend_info_t *info = be_get_info(node);
1325 for (i = 0; i < len; ++i) {
1326 const arch_register_req_t *req = a->reg_data[i].in_req;
1327 if (req->cls == NULL)
1329 fprintf(F, "inreq #%d = ", i);
1330 arch_dump_register_req(F, req, node);
1334 for (i = 0; i < len; ++i) {
1335 const arch_register_req_t *req = info->out_infos[i].req;
1336 if (req->cls == NULL)
1338 fprintf(F, "outreq #%d = ", i);
1339 arch_dump_register_req(F, req, node);
1345 for (i = 0; i < len; ++i) {
1346 const arch_register_t *reg = arch_irn_get_register(node, i);
1347 fprintf(F, "reg #%d = %s\n", i, reg != NULL ? reg->name : "n/a");
1352 * ir_op-Operation: dump a be node to file
1354 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1356 be_node_attr_t *at = get_irn_attr(irn);
1358 assert(is_be_node(irn));
1361 case dump_node_opcode_txt:
1362 fputs(get_op_name(get_irn_op(irn)), f);
1364 case dump_node_mode_txt:
1365 if (be_is_Perm(irn) || be_is_Copy(irn) || be_is_CopyKeep(irn)) {
1366 fprintf(f, " %s", get_mode_name(get_irn_mode(irn)));
1369 case dump_node_nodeattr_txt:
1370 if (be_is_Call(irn)) {
1371 be_call_attr_t *a = (be_call_attr_t *) at;
1373 fprintf(f, " [%s] ", get_entity_name(a->ent));
1375 if (be_is_IncSP(irn)) {
1376 const be_incsp_attr_t *attr = get_irn_generic_attr_const(irn);
1377 if (attr->offset == BE_STACK_FRAME_SIZE_EXPAND) {
1378 fprintf(f, " [Setup Stackframe] ");
1379 } else if (attr->offset == BE_STACK_FRAME_SIZE_SHRINK) {
1380 fprintf(f, " [Destroy Stackframe] ");
1382 fprintf(f, " [%d] ", attr->offset);
1386 case dump_node_info_txt:
1387 dump_node_reqs(f, irn);
1389 if (be_has_frame_entity(irn)) {
1390 be_frame_attr_t *a = (be_frame_attr_t *) at;
1392 unsigned size = get_type_size_bytes(get_entity_type(a->ent));
1393 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bytes\n",
1394 a->ent, a->offset, a->offset, size, size);
1399 switch (get_irn_opcode(irn)) {
1402 be_incsp_attr_t *a = (be_incsp_attr_t *) at;
1403 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1404 fprintf(f, "offset: FRAME_SIZE\n");
1405 else if (a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1406 fprintf(f, "offset: -FRAME SIZE\n");
1408 fprintf(f, "offset: %u\n", a->offset);
1413 be_call_attr_t *a = (be_call_attr_t *) at;
1416 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1422 for (i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1423 ir_entity *in, *out;
1424 in = be_get_MemPerm_in_entity(irn, i);
1425 out = be_get_MemPerm_out_entity(irn, i);
1427 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1430 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1446 * Copies the backend specific attributes from old node to new node.
1448 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1450 const be_node_attr_t *old_attr = get_irn_attr_const(old_node);
1451 be_node_attr_t *new_attr = get_irn_attr(new_node);
1452 ir_graph *irg = get_irn_irg(new_node);
1453 struct obstack *obst = be_get_birg_obst(irg);
1454 backend_info_t *old_info = be_get_info(old_node);
1455 backend_info_t *new_info = be_get_info(new_node);
1457 assert(is_be_node(old_node));
1458 assert(is_be_node(new_node));
1460 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1462 if (old_info->out_infos != NULL) {
1463 unsigned n_outs = ARR_LEN(old_info->out_infos);
1464 /* need dyanmic out infos? */
1465 if (be_is_RegParams(new_node) || be_is_Barrier(new_node)
1466 || be_is_Perm(new_node)) {
1467 new_info->out_infos = NEW_ARR_F(reg_out_info_t, n_outs);
1469 new_info->out_infos = NEW_ARR_D(reg_out_info_t, obst, n_outs);
1471 memcpy(new_info->out_infos, old_info->out_infos,
1472 n_outs * sizeof(new_info->out_infos[0]));
1474 new_info->out_infos = NULL;
1478 if (old_attr->reg_data != NULL) {
1479 unsigned n_ins = ARR_LEN(old_attr->reg_data);
1480 /* need dynamic in infos? */
1481 if (get_irn_op(old_node)->opar == oparity_dynamic) {
1482 new_attr->reg_data = NEW_ARR_F(be_reg_data_t, n_ins);
1484 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, n_ins);
1486 memcpy(new_attr->reg_data, old_attr->reg_data,
1487 n_ins * sizeof(be_reg_data_t));
1489 new_attr->reg_data = NULL;
1493 static const ir_op_ops be_node_op_ops = {
1514 int is_be_node(const ir_node *irn)
1516 return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops;
1519 void be_init_op(void)
1523 /* Acquire all needed opcodes. */
1524 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);
1525 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);
1526 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);
1527 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);
1528 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);
1529 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);
1530 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);
1531 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);
1532 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);
1533 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);
1534 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);
1535 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);
1536 op_be_RegParams = new_ir_op(beo_RegParams, "be_RegParams", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1537 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);
1538 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);
1540 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
1541 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
1542 op_be_Perm->ops.node_cmp_attr = node_cmp_attr;
1543 op_be_MemPerm->ops.node_cmp_attr = node_cmp_attr;
1544 op_be_Copy->ops.node_cmp_attr = node_cmp_attr;
1545 op_be_Keep->ops.node_cmp_attr = node_cmp_attr;
1546 op_be_CopyKeep->ops.node_cmp_attr = node_cmp_attr;
1547 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
1548 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
1549 op_be_AddSP->ops.node_cmp_attr = node_cmp_attr;
1550 op_be_SubSP->ops.node_cmp_attr = node_cmp_attr;
1551 op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr;
1552 op_be_RegParams->ops.node_cmp_attr = node_cmp_attr;
1553 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
1554 op_be_Barrier->ops.node_cmp_attr = node_cmp_attr;
1556 /* attach out dummy_ops to middle end nodes */
1557 for (opc = iro_First; opc <= iro_Last; ++opc) {
1558 ir_op *op = get_irp_opcode(opc);
1559 assert(op->ops.be_ops == NULL);
1560 op->ops.be_ops = &dummy_be_irn_ops;
1563 op_Phi->ops.be_ops = &phi_irn_ops;