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.
43 #include "bitfiddle.h"
44 #include "raw_bitset.h"
58 #include "besched_t.h"
64 #define OUT_POS(x) (-((x) + 1))
66 #define get_irn_attr(irn) get_irn_generic_attr(irn)
67 #define get_irn_attr_const(irn) get_irn_generic_attr_const(irn)
70 arch_register_req_t req;
71 arch_irn_flags_t flags;
75 const arch_register_t *reg;
80 /** The generic be nodes attribute type. */
82 be_reg_data_t *reg_data;
85 /** The be_Return nodes attribute type. */
87 be_node_attr_t node_attr; /**< base attributes of every be node. */
88 int num_ret_vals; /**< number of return values */
89 unsigned pop; /**< number of bytes that should be popped */
90 int emit_pop; /**< if set, emit pop bytes, even if pop = 0 */
93 /** The be_IncSP attribute type. */
95 be_node_attr_t node_attr; /**< base attributes of every be node. */
96 int offset; /**< The offset by which the stack shall be expanded/shrinked. */
97 int align; /**< whether stack should be aligned after the
101 /** The be_Frame attribute type. */
103 be_node_attr_t node_attr; /**< base attributes of every be node. */
108 /** The be_Call attribute type. */
110 be_node_attr_t node_attr; /**< base attributes of every be node. */
111 ir_entity *ent; /**< The called entity if this is a static call. */
113 ir_type *call_tp; /**< The call type, copied from the original Call node. */
117 be_node_attr_t node_attr; /**< base attributes of every be node. */
118 ir_entity **in_entities;
119 ir_entity **out_entities;
125 ir_op *op_be_MemPerm;
128 ir_op *op_be_CopyKeep;
134 ir_op *op_be_RegParams;
135 ir_op *op_be_FrameAddr;
136 ir_op *op_be_Barrier;
139 static const ir_op_ops be_node_op_ops;
141 #define N irop_flag_none
142 #define L irop_flag_labeled
143 #define C irop_flag_commutative
144 #define X irop_flag_cfopcode
145 #define I irop_flag_ip_cfopcode
146 #define F irop_flag_fragile
147 #define Y irop_flag_forking
148 #define H irop_flag_highlevel
149 #define c irop_flag_constlike
150 #define K irop_flag_keep
151 #define M irop_flag_uses_memory
153 static int be_reqs_equal(const be_req_t *req1, const be_req_t *req2)
155 if(!reg_reqs_equal(&req1->req, &req2->req))
157 if(req1->flags != req2->flags)
164 * Compare two be node attributes.
166 * @return zero if both attributes are identically
168 static int _node_cmp_attr(const be_node_attr_t *a, const be_node_attr_t *b) {
171 if (ARR_LEN(a->reg_data) != ARR_LEN(b->reg_data))
174 len = ARR_LEN(a->reg_data);
175 for (i = 0; i < len; ++i) {
176 if (a->reg_data[i].reg != b->reg_data[i].reg ||
177 !be_reqs_equal(&a->reg_data[i].in_req, &b->reg_data[i].in_req) ||
178 !be_reqs_equal(&a->reg_data[i].req, &b->reg_data[i].req))
186 * Compare the node attributes of two be_node's.
188 * @return zero if both nodes have identically attributes
190 static int node_cmp_attr(ir_node *a, ir_node *b) {
191 const be_node_attr_t *a_attr = get_irn_attr_const(a);
192 const be_node_attr_t *b_attr = get_irn_attr_const(b);
194 return _node_cmp_attr(a_attr, b_attr);
198 * Compare the attributes of two be_FrameAddr nodes.
200 * @return zero if both nodes have identically attributes
202 static int FrameAddr_cmp_attr(ir_node *a, ir_node *b) {
203 const be_frame_attr_t *a_attr = get_irn_attr_const(a);
204 const be_frame_attr_t *b_attr = get_irn_attr_const(b);
206 if (a_attr->ent != b_attr->ent || a_attr->offset != b_attr->offset)
209 return _node_cmp_attr(&a_attr->node_attr, &b_attr->node_attr);
213 * Compare the attributes of two be_Return nodes.
215 * @return zero if both nodes have identically attributes
217 static int Return_cmp_attr(ir_node *a, ir_node *b) {
218 const be_return_attr_t *a_attr = get_irn_attr_const(a);
219 const be_return_attr_t *b_attr = get_irn_attr_const(b);
221 if (a_attr->num_ret_vals != b_attr->num_ret_vals)
223 if (a_attr->pop != b_attr->pop)
225 if (a_attr->emit_pop != b_attr->emit_pop)
228 return _node_cmp_attr(&a_attr->node_attr, &b_attr->node_attr);
232 * Compare the attributes of two be_IncSP nodes.
234 * @return zero if both nodes have identically attributes
236 static int IncSP_cmp_attr(ir_node *a, ir_node *b) {
237 const be_incsp_attr_t *a_attr = get_irn_attr_const(a);
238 const be_incsp_attr_t *b_attr = get_irn_attr_const(b);
240 if (a_attr->offset != b_attr->offset)
243 return _node_cmp_attr(&a_attr->node_attr, &b_attr->node_attr);
247 * Compare the attributes of two be_Call nodes.
249 * @return zero if both nodes have identically attributes
251 static int Call_cmp_attr(ir_node *a, ir_node *b) {
252 const be_call_attr_t *a_attr = get_irn_attr_const(a);
253 const be_call_attr_t *b_attr = get_irn_attr_const(b);
255 if (a_attr->ent != b_attr->ent ||
256 a_attr->call_tp != b_attr->call_tp)
259 return _node_cmp_attr(&a_attr->node_attr, &b_attr->node_attr);
262 static INLINE be_req_t *get_be_req(const ir_node *node, int pos)
265 const be_node_attr_t *attr;
268 assert(is_be_node(node));
269 attr = get_irn_attr_const(node);
275 assert(idx < get_irn_arity(node));
277 assert(idx < ARR_LEN(attr->reg_data));
278 rd = &attr->reg_data[idx];
280 return pos < 0 ? &rd->req : &rd->in_req;
283 static INLINE arch_register_req_t *get_req(const ir_node *node, int pos)
285 be_req_t *bereq = get_be_req(node, pos);
290 * Initializes the generic attribute of all be nodes and return ir.
292 static void *init_node_attr(ir_node *node, int max_reg_data)
294 ir_graph *irg = get_irn_irg(node);
295 struct obstack *obst = get_irg_obstack(irg);
296 be_node_attr_t *a = get_irn_attr(node);
298 memset(a, 0, sizeof(get_op_attr_size(get_irn_op(node))));
300 if(max_reg_data >= 0) {
301 a->reg_data = NEW_ARR_D(be_reg_data_t, obst, max_reg_data);
302 memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
304 a->reg_data = NEW_ARR_F(be_reg_data_t, 0);
310 static void add_register_req(ir_node *node)
312 be_node_attr_t *a = get_irn_attr(node);
313 be_reg_data_t regreq;
314 memset(®req, 0, sizeof(regreq));
315 ARR_APP1(be_reg_data_t, a->reg_data, regreq);
319 * Skip Proj nodes and return their Proj numbers.
321 * If *node is a Proj or Proj(Proj) node, skip it.
323 * @param node points to the node to be skipped
325 * @return 0 if *node was no Proj node, its Proj number else.
327 static int redir_proj(const ir_node **node)
329 const ir_node *n = *node;
334 *node = irn = get_Proj_pred(n);
336 assert(get_irn_mode(irn) == mode_T);
337 *node = get_Proj_pred(irn);
339 return get_Proj_proj(n);
345 static be_reg_data_t *retrieve_reg_data(const ir_node *node)
347 const be_node_attr_t *attr;
351 pos = get_Proj_proj(node);
352 node = get_Proj_pred(node);
355 assert(is_be_node(node));
356 attr = get_irn_attr_const(node);
357 assert(pos >= 0 && pos < ARR_LEN(attr->reg_data) && "illegal proj number");
359 return &attr->reg_data[pos];
363 be_node_set_irn_reg(ir_node *irn, const arch_register_t *reg)
365 be_reg_data_t *r = retrieve_reg_data(irn);
369 ir_node *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
370 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *to_spill)
378 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
379 a = init_node_attr(res, 2);
383 be_node_set_reg_class(res, be_pos_Spill_frame, cls_frame);
384 be_node_set_reg_class(res, be_pos_Spill_val, cls);
388 ir_node *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
389 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode)
396 res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in);
398 init_node_attr(res, 2);
399 be_node_set_reg_class(res, -1, cls);
400 be_node_set_reg_class(res, be_pos_Reload_frame, cls_frame);
401 be_node_set_flags(res, -1, arch_irn_flags_rematerializable);
405 ir_node *be_get_Reload_mem(const ir_node *irn)
407 assert(be_is_Reload(irn));
408 return get_irn_n(irn, be_pos_Reload_mem);
411 ir_node *be_get_Reload_frame(const ir_node *irn)
413 assert(be_is_Reload(irn));
414 return get_irn_n(irn, be_pos_Reload_frame);
417 ir_node *be_get_Spill_val(const ir_node *irn)
419 assert(be_is_Spill(irn));
420 return get_irn_n(irn, be_pos_Spill_val);
423 ir_node *be_get_Spill_frame(const ir_node *irn)
425 assert(be_is_Spill(irn));
426 return get_irn_n(irn, be_pos_Spill_frame);
429 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
432 ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in);
433 init_node_attr(irn, n);
434 for(i = 0; i < n; ++i) {
435 be_node_set_reg_class(irn, i, cls);
436 be_node_set_reg_class(irn, OUT_POS(i), cls);
442 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
444 int arity = get_irn_arity(perm);
445 be_reg_data_t *old_data = alloca(arity * sizeof(old_data[0]));
446 be_node_attr_t *attr = get_irn_attr(perm);
451 assert(be_is_Perm(perm));
452 assert(new_size <= arity);
454 NEW_ARR_A(ir_node *, new_in, new_size);
456 /* save the old register data */
457 memcpy(old_data, attr->reg_data, arity * sizeof(old_data[0]));
459 /* compose the new in array and set the new register data directly in place */
460 for (i = 0; i < new_size; ++i) {
462 new_in[i] = get_irn_n(perm, idx);
463 attr->reg_data[i] = old_data[idx];
466 set_irn_in(perm, new_size, new_in);
469 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
472 ir_node *frame = get_irg_frame(irg);
473 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(frame, -1);
475 const arch_register_t *sp = arch_env->sp;
476 be_memperm_attr_t *attr;
479 real_in = alloca((n+1) * sizeof(real_in[0]));
481 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
483 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
485 init_node_attr(irn, n + 1);
486 be_node_set_reg_class(irn, 0, sp->reg_class);
487 for (i = 0; i < n; ++i) {
488 be_node_set_reg_class(irn, i + 1, cls_frame);
489 be_node_set_reg_class(irn, OUT_POS(i), cls_frame);
492 attr = get_irn_attr(irn);
494 attr->in_entities = obstack_alloc(irg->obst, n * sizeof(attr->in_entities[0]));
495 memset(attr->in_entities, 0, n * sizeof(attr->in_entities[0]));
496 attr->out_entities = obstack_alloc(irg->obst, n*sizeof(attr->out_entities[0]));
497 memset(attr->out_entities, 0, n*sizeof(attr->out_entities[0]));
503 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
507 arch_register_req_t *req;
510 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
511 init_node_attr(res, 1);
512 be_node_set_reg_class(res, 0, cls);
513 be_node_set_reg_class(res, OUT_POS(0), cls);
515 req = get_req(res, OUT_POS(0));
517 req->type = arch_register_req_type_should_be_same;
518 req->other_same = 1U << 0;
523 ir_node *be_get_Copy_op(const ir_node *cpy) {
524 return get_irn_n(cpy, be_pos_Copy_op);
527 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
528 set_irn_n(cpy, be_pos_Copy_op, op);
531 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
536 res = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, -1, NULL);
537 init_node_attr(res, -1);
539 for(i = 0; i < n; ++i) {
540 add_irn_n(res, in[i]);
541 add_register_req(res);
542 be_node_set_reg_class(res, i, cls);
549 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
553 assert(be_is_Keep(keep));
554 n = add_irn_n(keep, node);
555 add_register_req(keep);
556 be_node_set_reg_class(keep, n, cls);
559 /* creates a be_Call */
560 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
561 int n_outs, int n, ir_node *in[], ir_type *call_tp)
564 int real_n = be_pos_Call_first_arg + n;
568 NEW_ARR_A(ir_node *, real_in, real_n);
569 real_in[be_pos_Call_mem] = mem;
570 real_in[be_pos_Call_sp] = sp;
571 real_in[be_pos_Call_ptr] = ptr;
572 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
574 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
575 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
577 a->call_tp = call_tp;
582 /* Gets the call entity or NULL if this is no static call. */
583 ir_entity *be_Call_get_entity(const ir_node *call) {
584 const be_call_attr_t *a = get_irn_attr_const(call);
585 assert(be_is_Call(call));
589 /* Sets the call entity. */
590 void be_Call_set_entity(ir_node *call, ir_entity *ent) {
591 be_call_attr_t *a = get_irn_attr(call);
592 assert(be_is_Call(call));
596 /* Gets the call type. */
597 ir_type *be_Call_get_type(ir_node *call) {
598 const be_call_attr_t *a = get_irn_attr_const(call);
599 assert(be_is_Call(call));
603 /* Sets the call type. */
604 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
605 be_call_attr_t *a = get_irn_attr(call);
606 assert(be_is_Call(call));
607 a->call_tp = call_tp;
610 void be_Call_set_pop(ir_node *call, unsigned pop) {
611 be_call_attr_t *a = get_irn_attr(call);
615 unsigned be_Call_get_pop(const ir_node *call) {
616 const be_call_attr_t *a = get_irn_attr_const(call);
620 /* Construct a new be_Return. */
621 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
622 unsigned pop, int n, ir_node *in[])
628 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL);
629 init_node_attr(res, -1);
630 for(i = 0; i < n; ++i) {
631 add_irn_n(res, in[i]);
632 add_register_req(res);
635 a = get_irn_attr(res);
636 a->num_ret_vals = n_res;
643 /* Returns the number of real returns values */
644 int be_Return_get_n_rets(const ir_node *ret) {
645 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
646 return a->num_ret_vals;
649 /* return the number of bytes that should be popped from stack when executing the Return. */
650 unsigned be_Return_get_pop(const ir_node *ret) {
651 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
655 /* return non-zero, if number of popped bytes must be always emitted */
656 int be_Return_get_emit_pop(const ir_node *ret) {
657 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
661 /* return non-zero, if number of popped bytes must be always emitted */
662 void be_Return_set_emit_pop(ir_node *ret, int emit_pop) {
663 be_return_attr_t *a = get_irn_generic_attr(ret);
664 a->emit_pop = emit_pop;
667 int be_Return_append_node(ir_node *ret, ir_node *node) {
670 pos = add_irn_n(ret, node);
671 add_register_req(ret);
676 ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl,
677 ir_node *old_sp, int offset, int align)
684 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode,
685 sizeof(in) / sizeof(in[0]), in);
686 a = init_node_attr(irn, 1);
690 be_node_set_flags(irn, -1, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
692 /* Set output constraint to stack register. */
693 be_node_set_reg_class(irn, 0, sp->reg_class);
694 be_set_constr_single_reg(irn, BE_OUT_POS(0), sp);
695 be_node_set_irn_reg(irn, sp);
700 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
704 ir_node *in[be_pos_AddSP_last];
705 const arch_register_class_t *cls;
707 in[be_pos_AddSP_old_sp] = old_sp;
708 in[be_pos_AddSP_size] = sz;
710 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
711 a = init_node_attr(irn, be_pos_AddSP_last);
713 be_node_set_flags(irn, OUT_POS(pn_be_AddSP_sp),
714 arch_irn_flags_ignore | arch_irn_flags_modify_sp);
716 /* Set output constraint to stack register. */
717 be_set_constr_single_reg(irn, be_pos_AddSP_old_sp, sp);
718 be_node_set_reg_class(irn, be_pos_AddSP_size, arch_register_get_class(sp));
719 be_set_constr_single_reg(irn, OUT_POS(pn_be_AddSP_sp), sp);
720 a->reg_data[pn_be_AddSP_sp].reg = sp;
722 cls = arch_register_get_class(sp);
723 be_node_set_reg_class(irn, OUT_POS(pn_be_AddSP_res), cls);
728 ir_node *be_new_SubSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
732 ir_node *in[be_pos_SubSP_last];
734 in[be_pos_SubSP_old_sp] = old_sp;
735 in[be_pos_SubSP_size] = sz;
737 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
738 a = init_node_attr(irn, be_pos_SubSP_last);
740 be_node_set_flags(irn, OUT_POS(pn_be_SubSP_sp),
741 arch_irn_flags_ignore | arch_irn_flags_modify_sp);
743 /* Set output constraint to stack register. */
744 be_set_constr_single_reg(irn, be_pos_SubSP_old_sp, sp);
745 be_node_set_reg_class(irn, be_pos_SubSP_size, arch_register_get_class(sp));
746 be_set_constr_single_reg(irn, OUT_POS(pn_be_SubSP_sp), sp);
747 a->reg_data[pn_be_SubSP_sp].reg = sp;
752 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
757 res = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, NULL);
758 init_node_attr(res, -1);
759 for(i = 0; i < n_outs; ++i)
760 add_register_req(res);
765 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent)
772 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
773 a = init_node_attr(irn, 1);
776 be_node_set_reg_class(irn, 0, cls_frame);
777 be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
779 return optimize_node(irn);
782 ir_node *be_get_FrameAddr_frame(const ir_node *node) {
783 assert(be_is_FrameAddr(node));
784 return get_irn_n(node, be_pos_FrameAddr_ptr);
787 ir_entity *be_get_FrameAddr_entity(const ir_node *node)
789 const be_frame_attr_t *attr = get_irn_generic_attr_const(node);
793 ir_node *be_new_CopyKeep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *src, int n, ir_node *in_keep[], ir_mode *mode)
796 ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0]));
799 memcpy(&in[1], in_keep, n * sizeof(in[0]));
800 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
801 init_node_attr(irn, n + 1);
802 be_node_set_reg_class(irn, OUT_POS(0), cls);
803 be_node_set_reg_class(irn, 0, cls);
808 ir_node *be_new_CopyKeep_single(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *src, ir_node *keep, ir_mode *mode)
810 return be_new_CopyKeep(cls, irg, bl, src, 1, &keep, mode);
813 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
814 return get_irn_n(cpy, be_pos_CopyKeep_op);
817 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
818 set_irn_n(cpy, be_pos_CopyKeep_op, op);
821 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
826 res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
827 init_node_attr(res, -1);
828 for(i = 0; i < n; ++i) {
829 add_irn_n(res, in[i]);
830 add_register_req(res);
836 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
838 ir_graph *irg = get_irn_irg(barrier);
839 ir_node *block = get_nodes_block(barrier);
840 ir_mode *mode = get_irn_mode(node);
841 int n = add_irn_n(barrier, node);
843 ir_node *proj = new_r_Proj(irg, block, barrier, mode, n);
844 add_register_req(barrier);
849 /* Construct a new be_Unwind. */
850 ir_node *be_new_Unwind(dbg_info *dbg, ir_graph *irg, ir_node *block,
851 ir_node *mem, ir_node *sp)
856 in[be_pos_Unwind_mem] = mem;
857 in[be_pos_Unwind_sp] = sp;
858 res = new_ir_node(dbg, irg, block, op_be_Unwind, mode_X, 2, in);
859 init_node_attr(res, -1);
864 int be_has_frame_entity(const ir_node *irn)
866 switch (get_irn_opcode(irn)) {
876 ir_entity *be_get_frame_entity(const ir_node *irn)
878 if (be_has_frame_entity(irn)) {
879 const be_frame_attr_t *a = get_irn_attr_const(irn);
885 int be_get_frame_offset(const ir_node *irn)
887 assert(is_be_node(irn));
888 if (be_has_frame_entity(irn)) {
889 const be_frame_attr_t *a = get_irn_attr_const(irn);
895 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
897 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
899 assert(be_is_MemPerm(irn));
900 assert(n < be_get_MemPerm_entity_arity(irn));
902 attr->in_entities[n] = ent;
905 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
907 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
909 assert(be_is_MemPerm(irn));
910 assert(n < be_get_MemPerm_entity_arity(irn));
912 return attr->in_entities[n];
915 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
917 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
919 assert(be_is_MemPerm(irn));
920 assert(n < be_get_MemPerm_entity_arity(irn));
922 attr->out_entities[n] = ent;
925 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
927 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
929 assert(be_is_MemPerm(irn));
930 assert(n < be_get_MemPerm_entity_arity(irn));
932 return attr->out_entities[n];
935 int be_get_MemPerm_entity_arity(const ir_node *irn)
937 return get_irn_arity(irn) - 1;
940 void be_set_constr_single_reg(ir_node *node, int pos, const arch_register_t *reg)
942 arch_register_req_t *req = get_req(node, pos);
943 const arch_register_class_t *cls = arch_register_get_class(reg);
944 ir_graph *irg = get_irn_irg(node);
945 struct obstack *obst = get_irg_obstack(irg);
946 unsigned *limited_bitset;
948 assert(req->cls == NULL || req->cls == cls);
949 assert(! (req->type & arch_register_req_type_limited));
950 assert(req->limited == NULL);
952 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
953 rbitset_set(limited_bitset, arch_register_get_index(reg));
956 req->type |= arch_register_req_type_limited;
957 req->limited = limited_bitset;
960 void be_set_constr_limited(ir_node *node, int pos, const arch_register_req_t *req)
962 ir_graph *irg = get_irn_irg(node);
963 struct obstack *obst = get_irg_obstack(irg);
964 arch_register_req_t *r = get_req(node, pos);
966 assert(arch_register_req_is(req, limited));
967 assert(!(req->type & (arch_register_req_type_should_be_same | arch_register_req_type_must_be_different)));
968 memcpy(r, req, sizeof(r[0]));
969 r->limited = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
972 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
974 be_req_t *bereq = get_be_req(irn, pos);
975 bereq->flags = flags;
978 void be_node_add_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
980 be_req_t *bereq = get_be_req(irn, pos);
981 bereq->flags |= flags;
984 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
986 arch_register_req_t *req = get_req(irn, pos);
991 req->type = arch_register_req_type_none;
992 } else if (req->type == arch_register_req_type_none) {
993 req->type = arch_register_req_type_normal;
997 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
999 arch_register_req_t *req = get_req(irn, pos);
1003 ir_node *be_get_IncSP_pred(ir_node *irn) {
1004 assert(be_is_IncSP(irn));
1005 return get_irn_n(irn, 0);
1008 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
1009 assert(be_is_IncSP(incsp));
1010 set_irn_n(incsp, 0, pred);
1013 void be_set_IncSP_offset(ir_node *irn, int offset)
1015 be_incsp_attr_t *a = get_irn_attr(irn);
1016 assert(be_is_IncSP(irn));
1020 int be_get_IncSP_offset(const ir_node *irn)
1022 const be_incsp_attr_t *a = get_irn_attr_const(irn);
1023 assert(be_is_IncSP(irn));
1027 int be_get_IncSP_align(const ir_node *irn)
1029 const be_incsp_attr_t *a = get_irn_attr_const(irn);
1030 assert(be_is_IncSP(irn));
1034 ir_node *be_spill(const arch_env_t *arch_env, ir_node *block, ir_node *irn)
1036 ir_graph *irg = get_irn_irg(block);
1037 ir_node *frame = get_irg_frame(irg);
1038 const arch_register_class_t *cls = arch_get_irn_reg_class(irn, -1);
1039 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(frame, -1);
1043 spill = be_new_Spill(cls, cls_frame, irg, block, frame, irn);
1047 ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill)
1050 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
1051 ir_graph *irg = get_irn_irg(bl);
1052 ir_node *frame = get_irg_frame(irg);
1053 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(frame, -1);
1055 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
1057 reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
1059 if (is_Block(insert)) {
1060 insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
1061 sched_add_after(insert, reload);
1063 sched_add_before(insert, reload);
1071 | _ \ ___ __ _ | _ \ ___ __ _ ___
1072 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
1073 | _ < __/ (_| | | _ < __/ (_| \__ \
1074 |_| \_\___|\__, | |_| \_\___|\__, |___/
1081 arch_register_req_t *get_out_reg_req(const ir_node *irn, int out_pos)
1083 const be_node_attr_t *a = get_irn_attr_const(irn);
1085 if(out_pos >= ARR_LEN(a->reg_data)) {
1086 return arch_no_register_req;
1089 return &a->reg_data[out_pos].req.req;
1093 arch_register_req_t *get_in_reg_req(const ir_node *irn, int pos)
1095 const be_node_attr_t *a = get_irn_attr_const(irn);
1097 if(pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
1098 return arch_no_register_req;
1100 return &a->reg_data[pos].in_req.req;
1103 static const arch_register_req_t *
1104 be_node_get_irn_reg_req(const ir_node *irn, int pos)
1109 if (get_irn_mode(irn) == mode_T)
1110 return arch_no_register_req;
1112 out_pos = redir_proj((const ir_node **)&irn);
1113 assert(is_be_node(irn));
1114 return get_out_reg_req(irn, out_pos);
1115 } else if (is_be_node(irn)) {
1117 * For spills and reloads, we return "none" as requirement for frame
1118 * pointer, so every input is ok. Some backends need this (e.g. STA).
1120 if ((be_is_Spill(irn) && pos == be_pos_Spill_frame) ||
1121 (be_is_Reload(irn) && pos == be_pos_Reload_frame))
1122 return arch_no_register_req;
1124 return get_in_reg_req(irn, pos);
1127 return arch_no_register_req;
1130 const arch_register_t *
1131 be_node_get_irn_reg(const ir_node *irn)
1135 if (get_irn_mode(irn) == mode_T)
1137 r = retrieve_reg_data(irn);
1141 static arch_irn_class_t be_node_classify(const ir_node *irn)
1144 switch (get_irn_opcode(irn)) {
1145 #define XXX(a,b) case a: return b
1146 XXX(beo_Spill, arch_irn_class_spill);
1147 XXX(beo_Reload, arch_irn_class_reload);
1148 XXX(beo_Perm, arch_irn_class_perm);
1149 XXX(beo_Copy, arch_irn_class_copy);
1150 XXX(beo_Return, arch_irn_class_branch);
1153 irn = get_Proj_pred(irn);
1155 assert(get_irn_mode(irn) == mode_T);
1156 irn = get_Proj_pred(irn);
1161 return arch_irn_class_normal;
1167 static arch_irn_flags_t be_node_get_flags(const ir_node *node)
1173 pos = OUT_POS(get_Proj_proj(node));
1174 node = skip_Proj_const(node);
1177 bereq = get_be_req(node, pos);
1179 return bereq->flags;
1182 static ir_entity *be_node_get_frame_entity(const ir_node *irn)
1184 return be_get_frame_entity(irn);
1187 static void be_node_set_frame_entity(ir_node *irn, ir_entity *ent)
1191 assert(be_has_frame_entity(irn));
1193 a = get_irn_attr(irn);
1197 static void be_node_set_frame_offset(ir_node *irn, int offset)
1199 if(be_has_frame_entity(irn)) {
1200 be_frame_attr_t *a = get_irn_attr(irn);
1205 static int be_node_get_sp_bias(const ir_node *irn)
1207 if(be_is_IncSP(irn))
1208 return be_get_IncSP_offset(irn);
1210 return -(int)be_Call_get_pop(irn);
1216 ___ ____ _ _ _ _ _ _
1217 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1218 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1219 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1220 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1224 static const arch_irn_ops_t be_node_irn_ops = {
1225 be_node_get_irn_reg_req,
1226 be_node_set_irn_reg,
1227 be_node_get_irn_reg,
1230 be_node_get_frame_entity,
1231 be_node_set_frame_entity,
1232 be_node_set_frame_offset,
1233 be_node_get_sp_bias,
1234 NULL, /* get_inverse */
1235 NULL, /* get_op_estimated_cost */
1236 NULL, /* possible_memory_operand */
1237 NULL, /* perform_memory_operand */
1241 ____ _ _ ___ ____ _ _ _ _ _ _
1242 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1243 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1244 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1245 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1250 const arch_register_t *reg;
1251 arch_register_req_t req;
1252 arch_irn_flags_t flags;
1256 arch_env_t *arch_env;
1260 #define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops)
1263 phi_attr_t *get_Phi_attr(const ir_node *phi)
1265 phi_attr_t *attr = pmap_get(phi_handler.phi_attrs, (void*) phi);
1267 ir_graph *irg = get_irn_irg(phi);
1268 struct obstack *obst = get_irg_obstack(irg);
1269 attr = obstack_alloc(obst, sizeof(attr[0]));
1270 memset(attr, 0, sizeof(attr[0]));
1271 pmap_insert(phi_handler.phi_attrs, phi, attr);
1278 * Get register class of a Phi.
1281 const arch_register_req_t *get_Phi_reg_req_recursive(const ir_node *phi,
1284 int n = get_irn_arity(phi);
1288 if(*visited && pset_find_ptr(*visited, phi))
1291 for(i = 0; i < n; ++i) {
1292 op = get_irn_n(phi, i);
1293 /* Matze: don't we unnecessary constraint our phis with this?
1294 * we only need to take the regclass IMO*/
1296 return arch_get_register_req(op, BE_OUT_POS(0));
1300 * The operands of that Phi were all Phis themselves.
1301 * We have to start a DFS for a non-Phi argument now.
1304 *visited = pset_new_ptr(16);
1306 pset_insert_ptr(*visited, phi);
1308 for(i = 0; i < n; ++i) {
1309 const arch_register_req_t *req;
1310 op = get_irn_n(phi, i);
1311 req = get_Phi_reg_req_recursive(op, visited);
1320 const arch_register_req_t *phi_get_irn_reg_req(const ir_node *irn, int pos)
1325 if(!mode_is_datab(get_irn_mode(irn)))
1326 return arch_no_register_req;
1328 attr = get_Phi_attr(irn);
1330 if(attr->req.type == arch_register_req_type_none) {
1331 pset *visited = NULL;
1332 const arch_register_req_t *req;
1333 req = get_Phi_reg_req_recursive(irn, &visited);
1335 memcpy(&attr->req, req, sizeof(req[0]));
1336 assert(attr->req.cls != NULL);
1337 attr->req.type = arch_register_req_type_normal;
1346 void be_set_phi_reg_req(const arch_env_t *arch_env, ir_node *node,
1347 const arch_register_req_t *req)
1352 assert(mode_is_datab(get_irn_mode(node)));
1354 attr = get_Phi_attr(node);
1355 memcpy(&attr->req, req, sizeof(req[0]));
1358 void be_set_phi_flags(const arch_env_t *arch_env, ir_node *node,
1359 arch_irn_flags_t flags)
1364 assert(mode_is_datab(get_irn_mode(node)));
1366 attr = get_Phi_attr(node);
1367 attr->flags = flags;
1370 static void phi_set_irn_reg(ir_node *irn, const arch_register_t *reg)
1372 phi_attr_t *attr = get_Phi_attr(irn);
1376 static const arch_register_t *phi_get_irn_reg(const ir_node *irn)
1378 phi_attr_t *attr = get_Phi_attr(irn);
1382 static arch_irn_class_t phi_classify(const ir_node *irn)
1385 return arch_irn_class_normal;
1388 static arch_irn_flags_t phi_get_flags(const ir_node *irn)
1390 phi_attr_t *attr = get_Phi_attr(irn);
1394 static ir_entity *phi_get_frame_entity(const ir_node *irn)
1400 static void phi_set_frame_entity(ir_node *irn, ir_entity *ent)
1404 panic("phi_set_frame_entity() should not be called");
1407 static void phi_set_frame_offset(ir_node *irn, int bias)
1411 panic("phi_set_frame_offset() should not be called");
1414 static int phi_get_sp_bias(const ir_node *irn)
1420 static const arch_irn_ops_t phi_irn_ops = {
1421 phi_get_irn_reg_req,
1426 phi_get_frame_entity,
1427 phi_set_frame_entity,
1428 phi_set_frame_offset,
1430 NULL, /* get_inverse */
1431 NULL, /* get_op_estimated_cost */
1432 NULL, /* possible_memory_operand */
1433 NULL, /* perform_memory_operand */
1436 void be_phi_handler_new(be_main_env_t *env)
1438 phi_handler.arch_env = env->arch_env;
1439 phi_handler.phi_attrs = pmap_create();
1440 op_Phi->ops.be_ops = &phi_irn_ops;
1443 void be_phi_handler_free(void)
1445 pmap_destroy(phi_handler.phi_attrs);
1446 phi_handler.phi_attrs = NULL;
1447 op_Phi->ops.be_ops = NULL;
1450 void be_phi_handler_reset(void)
1452 if(phi_handler.phi_attrs)
1453 pmap_destroy(phi_handler.phi_attrs);
1454 phi_handler.phi_attrs = pmap_create();
1459 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1460 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1461 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1462 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1467 * Dumps a register requirement to a file.
1469 static void dump_node_req(FILE *f, int idx, const arch_register_req_t *req,
1470 const ir_node *node)
1472 int did_something = 0;
1474 const char *prefix = buf;
1476 snprintf(buf, sizeof(buf), "#%d ", idx);
1477 buf[sizeof(buf) - 1] = '\0';
1482 arch_register_req_format(tmp, sizeof(tmp), req, node);
1483 fprintf(f, "%s", tmp);
1492 * Dumps node register requirements to a file.
1494 static void dump_node_reqs(FILE *f, ir_node *node)
1497 be_node_attr_t *a = get_irn_attr(node);
1498 int len = ARR_LEN(a->reg_data);
1500 fprintf(f, "registers: \n");
1501 for(i = 0; i < len; ++i) {
1502 be_reg_data_t *rd = &a->reg_data[i];
1504 fprintf(f, "#%d: %s\n", i, rd->reg->name);
1507 fprintf(f, "in requirements:\n");
1508 for(i = 0; i < len; ++i) {
1509 dump_node_req(f, i, &a->reg_data[i].in_req.req, node);
1512 fprintf(f, "\nout requirements:\n");
1513 for(i = 0; i < len; ++i) {
1514 dump_node_req(f, i, &a->reg_data[i].req.req, node);
1519 * ir_op-Operation: dump a be node to file
1521 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1523 be_node_attr_t *at = get_irn_attr(irn);
1525 assert(is_be_node(irn));
1528 case dump_node_opcode_txt:
1529 fprintf(f, get_op_name(get_irn_op(irn)));
1531 case dump_node_mode_txt:
1532 if(be_is_Perm(irn) || be_is_Copy(irn) || be_is_CopyKeep(irn)) {
1533 fprintf(f, " %s", get_mode_name(get_irn_mode(irn)));
1536 case dump_node_nodeattr_txt:
1537 if(be_is_Call(irn)) {
1538 be_call_attr_t *a = (be_call_attr_t *) at;
1540 fprintf(f, " [%s] ", get_entity_name(a->ent));
1542 if(be_is_IncSP(irn)) {
1543 const be_incsp_attr_t *attr = get_irn_generic_attr_const(irn);
1544 if(attr->offset == BE_STACK_FRAME_SIZE_EXPAND) {
1545 fprintf(f, " [Setup Stackframe] ");
1546 } else if(attr->offset == BE_STACK_FRAME_SIZE_SHRINK) {
1547 fprintf(f, " [Destroy Stackframe] ");
1549 fprintf(f, " [%d] ", attr->offset);
1553 case dump_node_info_txt:
1554 dump_node_reqs(f, irn);
1556 if(be_has_frame_entity(irn)) {
1557 be_frame_attr_t *a = (be_frame_attr_t *) at;
1559 unsigned size = get_type_size_bytes(get_entity_type(a->ent));
1560 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bytes\n",
1561 a->ent, a->offset, a->offset, size, size);
1566 switch (get_irn_opcode(irn)) {
1569 be_incsp_attr_t *a = (be_incsp_attr_t *) at;
1570 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1571 fprintf(f, "offset: FRAME_SIZE\n");
1572 else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1573 fprintf(f, "offset: -FRAME SIZE\n");
1575 fprintf(f, "offset: %u\n", a->offset);
1580 be_call_attr_t *a = (be_call_attr_t *) at;
1583 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1589 for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1590 ir_entity *in, *out;
1591 in = be_get_MemPerm_in_entity(irn, i);
1592 out = be_get_MemPerm_out_entity(irn, i);
1594 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1597 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1613 * Copies the backend specific attributes from old node to new node.
1615 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1617 const be_node_attr_t *old_attr = get_irn_attr_const(old_node);
1618 be_node_attr_t *new_attr = get_irn_attr(new_node);
1619 struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
1622 assert(is_be_node(old_node));
1623 assert(is_be_node(new_node));
1625 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1626 new_attr->reg_data = NULL;
1628 if(old_attr->reg_data != NULL)
1629 len = ARR_LEN(old_attr->reg_data);
1633 if(get_irn_op(old_node)->opar == oparity_dynamic
1634 || be_is_RegParams(old_node)) {
1635 new_attr->reg_data = NEW_ARR_F(be_reg_data_t, len);
1637 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, len);
1641 memcpy(new_attr->reg_data, old_attr->reg_data, len * sizeof(be_reg_data_t));
1642 for(i = 0; i < len; ++i) {
1643 const be_reg_data_t *rd = &old_attr->reg_data[i];
1644 be_reg_data_t *newrd = &new_attr->reg_data[i];
1645 if(arch_register_req_is(&rd->req.req, limited)) {
1646 const arch_register_req_t *req = &rd->req.req;
1647 arch_register_req_t *new_req = &newrd->req.req;
1649 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1651 if(arch_register_req_is(&rd->in_req.req, limited)) {
1652 const arch_register_req_t *req = &rd->in_req.req;
1653 arch_register_req_t *new_req = &newrd->in_req.req;
1655 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1661 static const ir_op_ops be_node_op_ops = {
1682 int is_be_node(const ir_node *irn)
1684 return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops;
1687 void be_node_init(void) {
1688 static int inited = 0;
1695 /* Acquire all needed opcodes. */
1696 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);
1697 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);
1698 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);
1699 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);
1700 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);
1701 op_be_Keep = new_ir_op(beo_Keep, "be_Keep", op_pin_state_pinned, K, oparity_dynamic, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1702 op_be_CopyKeep = new_ir_op(beo_CopyKeep, "be_CopyKeep", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1703 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);
1704 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);
1705 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);
1706 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);
1707 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);
1708 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);
1709 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);
1710 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);
1711 op_be_Unwind = new_ir_op(beo_Unwind, "be_Unwind", op_pin_state_pinned, X, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops);
1713 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
1714 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
1715 op_be_Perm->ops.node_cmp_attr = node_cmp_attr;
1716 op_be_MemPerm->ops.node_cmp_attr = node_cmp_attr;
1717 op_be_Copy->ops.node_cmp_attr = node_cmp_attr;
1718 op_be_Keep->ops.node_cmp_attr = node_cmp_attr;
1719 op_be_CopyKeep->ops.node_cmp_attr = node_cmp_attr;
1720 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
1721 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
1722 op_be_AddSP->ops.node_cmp_attr = node_cmp_attr;
1723 op_be_SubSP->ops.node_cmp_attr = node_cmp_attr;
1724 op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr;
1725 op_be_RegParams->ops.node_cmp_attr = node_cmp_attr;
1726 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
1727 op_be_Barrier->ops.node_cmp_attr = node_cmp_attr;
1728 op_be_Unwind->ops.node_cmp_attr = node_cmp_attr;