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"
56 #include "besched_t.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 arch_register_req_t req;
67 arch_register_req_t in_req;
70 /** The generic be nodes attribute type. */
72 be_reg_data_t *reg_data;
75 /** The be_Return nodes attribute type. */
77 be_node_attr_t node_attr; /**< base attributes of every be node. */
78 int num_ret_vals; /**< number of return values */
79 unsigned pop; /**< number of bytes that should be popped */
80 int emit_pop; /**< if set, emit pop bytes, even if pop = 0 */
83 /** The be_IncSP attribute type. */
85 be_node_attr_t node_attr; /**< base attributes of every be node. */
86 int offset; /**< The offset by which the stack shall be expanded/shrinked. */
87 int align; /**< whether stack should be aligned after the
91 /** The be_Frame attribute type. */
93 be_node_attr_t node_attr; /**< base attributes of every be node. */
98 /** The be_Call attribute type. */
100 be_node_attr_t node_attr; /**< base attributes of every be node. */
101 ir_entity *ent; /**< The called entity if this is a static call. */
103 ir_type *call_tp; /**< The call type, copied from the original Call node. */
107 be_node_attr_t node_attr; /**< base attributes of every be node. */
108 ir_entity **in_entities;
109 ir_entity **out_entities;
115 ir_op *op_be_MemPerm;
118 ir_op *op_be_CopyKeep;
124 ir_op *op_be_RegParams;
125 ir_op *op_be_FrameAddr;
126 ir_op *op_be_Barrier;
129 static const ir_op_ops be_node_op_ops;
131 #define N irop_flag_none
132 #define L irop_flag_labeled
133 #define C irop_flag_commutative
134 #define X irop_flag_cfopcode
135 #define I irop_flag_ip_cfopcode
136 #define F irop_flag_fragile
137 #define Y irop_flag_forking
138 #define H irop_flag_highlevel
139 #define c irop_flag_constlike
140 #define K irop_flag_keep
141 #define M irop_flag_uses_memory
144 * Compare two be node attributes.
146 * @return zero if both attributes are identically
148 static int _node_cmp_attr(const be_node_attr_t *a, const be_node_attr_t *b) {
149 int i, len = ARR_LEN(a->reg_data);
151 if (len != ARR_LEN(b->reg_data))
154 for (i = len - 1; i >= 0; --i) {
155 if (!reg_reqs_equal(&a->reg_data[i].in_req, &b->reg_data[i].in_req) ||
156 !reg_reqs_equal(&a->reg_data[i].req, &b->reg_data[i].req))
164 * Compare the node attributes of two be_node's.
166 * @return zero if both nodes have identically attributes
168 static int node_cmp_attr(ir_node *a, ir_node *b) {
169 const be_node_attr_t *a_attr = get_irn_attr_const(a);
170 const be_node_attr_t *b_attr = get_irn_attr_const(b);
172 if (_node_cmp_attr(a_attr, b_attr) != 0)
175 return !be_info_equal(a, b);
179 * Compare the attributes of two be_FrameAddr nodes.
181 * @return zero if both nodes have identically attributes
183 static int FrameAddr_cmp_attr(ir_node *a, ir_node *b) {
184 const be_frame_attr_t *a_attr = get_irn_attr_const(a);
185 const be_frame_attr_t *b_attr = get_irn_attr_const(b);
187 if (a_attr->ent != b_attr->ent || a_attr->offset != b_attr->offset)
190 return _node_cmp_attr(&a_attr->node_attr, &b_attr->node_attr);
194 * Compare the attributes of two be_Return nodes.
196 * @return zero if both nodes have identically attributes
198 static int Return_cmp_attr(ir_node *a, ir_node *b) {
199 const be_return_attr_t *a_attr = get_irn_attr_const(a);
200 const be_return_attr_t *b_attr = get_irn_attr_const(b);
202 if (a_attr->num_ret_vals != b_attr->num_ret_vals)
204 if (a_attr->pop != b_attr->pop)
206 if (a_attr->emit_pop != b_attr->emit_pop)
209 return _node_cmp_attr(&a_attr->node_attr, &b_attr->node_attr);
213 * Compare the attributes of two be_IncSP nodes.
215 * @return zero if both nodes have identically attributes
217 static int IncSP_cmp_attr(ir_node *a, ir_node *b) {
218 const be_incsp_attr_t *a_attr = get_irn_attr_const(a);
219 const be_incsp_attr_t *b_attr = get_irn_attr_const(b);
221 if (a_attr->offset != b_attr->offset)
224 return _node_cmp_attr(&a_attr->node_attr, &b_attr->node_attr);
228 * Compare the attributes of two be_Call nodes.
230 * @return zero if both nodes have identically attributes
232 static int Call_cmp_attr(ir_node *a, ir_node *b) {
233 const be_call_attr_t *a_attr = get_irn_attr_const(a);
234 const be_call_attr_t *b_attr = get_irn_attr_const(b);
236 if (a_attr->ent != b_attr->ent ||
237 a_attr->call_tp != b_attr->call_tp)
240 return _node_cmp_attr(&a_attr->node_attr, &b_attr->node_attr);
243 static inline arch_register_req_t *get_be_req(const ir_node *node, int pos)
246 const be_node_attr_t *attr;
249 assert(is_be_node(node));
250 attr = get_irn_attr_const(node);
256 assert(idx < get_irn_arity(node));
258 assert(idx < ARR_LEN(attr->reg_data));
259 rd = &attr->reg_data[idx];
261 return pos < 0 ? &rd->req : &rd->in_req;
265 * Initializes the generic attribute of all be nodes and return it.
267 static void *init_node_attr(ir_node *node, int max_reg_data)
269 ir_graph *irg = get_irn_irg(node);
270 struct obstack *obst = get_irg_obstack(irg);
271 be_node_attr_t *a = get_irn_attr(node);
273 memset(a, 0, sizeof(get_op_attr_size(get_irn_op(node))));
275 if(max_reg_data >= 0) {
276 backend_info_t *info = be_get_info(node);
277 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, max_reg_data);
278 memset(info->out_infos, 0, max_reg_data * sizeof(info->out_infos[0]));
280 a->reg_data = NEW_ARR_D(be_reg_data_t, obst, max_reg_data);
281 memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
283 backend_info_t *info = be_get_info(node);
284 info->out_infos = NEW_ARR_F(reg_out_info_t, 0);
286 a->reg_data = NEW_ARR_F(be_reg_data_t, 0);
292 static void add_register_req(ir_node *node)
294 backend_info_t *info = be_get_info(node);
295 be_node_attr_t *a = get_irn_attr(node);
296 be_reg_data_t regreq;
297 reg_out_info_t out_info;
298 memset(®req, 0, sizeof(regreq));
299 memset(&out_info, 0, sizeof(out_info));
300 ARR_APP1(be_reg_data_t, a->reg_data, regreq);
301 ARR_APP1(reg_out_info_t, info->out_infos, out_info);
305 * Skip Proj nodes and return their Proj numbers.
307 * If *node is a Proj or Proj(Proj) node, skip it.
309 * @param node points to the node to be skipped
311 * @return 0 if *node was no Proj node, its Proj number else.
313 static int redir_proj(const ir_node **node)
315 const ir_node *n = *node;
320 *node = irn = get_Proj_pred(n);
322 assert(get_irn_mode(irn) == mode_T);
323 *node = get_Proj_pred(irn);
325 return get_Proj_proj(n);
331 ir_node *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
332 ir_node *bl, ir_node *frame, ir_node *to_spill)
337 ir_graph *irg = get_Block_irg(bl);
341 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
342 a = init_node_attr(res, 2);
346 be_node_set_reg_class_in(res, be_pos_Spill_frame, cls_frame);
347 be_node_set_reg_class_in(res, be_pos_Spill_val, cls);
351 ir_node *be_new_Reload(const arch_register_class_t *cls,
352 const arch_register_class_t *cls_frame, ir_node *block,
353 ir_node *frame, ir_node *mem, ir_mode *mode)
357 ir_graph *irg = get_Block_irg(block);
361 res = new_ir_node(NULL, irg, block, op_be_Reload, mode, 2, in);
363 init_node_attr(res, 2);
364 be_node_set_reg_class_out(res, 0, cls);
365 be_node_set_reg_class_in(res, be_pos_Reload_frame, cls_frame);
366 arch_irn_set_flags(res, arch_irn_flags_rematerializable);
370 ir_node *be_get_Reload_mem(const ir_node *irn)
372 assert(be_is_Reload(irn));
373 return get_irn_n(irn, be_pos_Reload_mem);
376 ir_node *be_get_Reload_frame(const ir_node *irn)
378 assert(be_is_Reload(irn));
379 return get_irn_n(irn, be_pos_Reload_frame);
382 ir_node *be_get_Spill_val(const ir_node *irn)
384 assert(be_is_Spill(irn));
385 return get_irn_n(irn, be_pos_Spill_val);
388 ir_node *be_get_Spill_frame(const ir_node *irn)
390 assert(be_is_Spill(irn));
391 return get_irn_n(irn, be_pos_Spill_frame);
394 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_node *block, int n, ir_node *in[])
397 ir_graph *irg = get_Block_irg(block);
399 ir_node *irn = new_ir_node(NULL, irg, block, op_be_Perm, mode_T, n, in);
400 init_node_attr(irn, n);
401 for (i = 0; i < n; ++i) {
402 be_node_set_reg_class_in(irn, i, cls);
403 be_node_set_reg_class_out(irn, i, cls);
409 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
411 int arity = get_irn_arity(perm);
412 be_reg_data_t *old_data = ALLOCAN(be_reg_data_t, arity);
413 reg_out_info_t *old_infos = ALLOCAN(reg_out_info_t, arity);
414 be_node_attr_t *attr = get_irn_attr(perm);
415 backend_info_t *info = be_get_info(perm);
420 assert(be_is_Perm(perm));
421 assert(new_size <= arity);
423 new_in = alloca(new_size * sizeof(*new_in));
425 /* save the old register data */
426 memcpy(old_data, attr->reg_data, arity * sizeof(old_data[0]));
427 memcpy(old_infos, info->out_infos, arity * sizeof(old_infos[0]));
429 /* compose the new in array and set the new register data directly in place */
430 for (i = 0; i < new_size; ++i) {
432 new_in[i] = get_irn_n(perm, idx);
433 attr->reg_data[i] = old_data[idx];
434 info->out_infos[i] = old_infos[idx];
437 set_irn_in(perm, new_size, new_in);
440 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_node *bl, int n, ir_node *in[])
442 ir_graph *irg = get_Block_irg(bl);
443 ir_node *frame = get_irg_frame(irg);
444 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
445 const arch_register_t *sp = arch_env->sp;
447 be_memperm_attr_t *attr;
451 real_in = ALLOCAN(ir_node*, n + 1);
453 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
455 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
457 init_node_attr(irn, n + 1);
458 be_node_set_reg_class_in(irn, 0, sp->reg_class);
459 for (i = 0; i < n; ++i) {
460 be_node_set_reg_class_in(irn, i + 1, cls_frame);
461 be_node_set_reg_class_out(irn, i, cls_frame);
464 attr = get_irn_attr(irn);
466 attr->in_entities = obstack_alloc(irg->obst, n * sizeof(attr->in_entities[0]));
467 memset(attr->in_entities, 0, n * sizeof(attr->in_entities[0]));
468 attr->out_entities = obstack_alloc(irg->obst, n*sizeof(attr->out_entities[0]));
469 memset(attr->out_entities, 0, n*sizeof(attr->out_entities[0]));
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);
485 be_node_set_reg_class_in(res, 0, cls);
486 be_node_set_reg_class_out(res, 0, cls);
488 req = get_be_req(res, BE_OUT_POS(0));
490 req->type = arch_register_req_type_should_be_same;
491 req->other_same = 1U << 0;
496 ir_node *be_get_Copy_op(const ir_node *cpy) {
497 return get_irn_n(cpy, be_pos_Copy_op);
500 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
501 set_irn_n(cpy, be_pos_Copy_op, op);
504 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_node *bl, int n, ir_node *in[])
508 ir_graph *irg = get_Block_irg(bl);
510 res = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, -1, NULL);
511 init_node_attr(res, -1);
513 for(i = 0; i < n; ++i) {
514 add_irn_n(res, in[i]);
515 add_register_req(res);
516 be_node_set_reg_class_in(res, i, cls);
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(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, ir_node *sp, ir_node *ptr,
535 int n_outs, int n, ir_node *in[], ir_type *call_tp)
538 int real_n = be_pos_Call_first_arg + n;
542 NEW_ARR_A(ir_node *, real_in, real_n);
543 real_in[be_pos_Call_mem] = mem;
544 real_in[be_pos_Call_sp] = sp;
545 real_in[be_pos_Call_ptr] = ptr;
546 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
548 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
549 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
551 a->call_tp = call_tp;
556 /* Gets the call entity or NULL if this is no static call. */
557 ir_entity *be_Call_get_entity(const ir_node *call) {
558 const be_call_attr_t *a = get_irn_attr_const(call);
559 assert(be_is_Call(call));
563 /* Sets the call entity. */
564 void be_Call_set_entity(ir_node *call, ir_entity *ent) {
565 be_call_attr_t *a = get_irn_attr(call);
566 assert(be_is_Call(call));
570 /* Gets the call type. */
571 ir_type *be_Call_get_type(ir_node *call) {
572 const be_call_attr_t *a = get_irn_attr_const(call);
573 assert(be_is_Call(call));
577 /* Sets the call type. */
578 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
579 be_call_attr_t *a = get_irn_attr(call);
580 assert(be_is_Call(call));
581 a->call_tp = call_tp;
584 void be_Call_set_pop(ir_node *call, unsigned pop) {
585 be_call_attr_t *a = get_irn_attr(call);
589 unsigned be_Call_get_pop(const ir_node *call) {
590 const be_call_attr_t *a = get_irn_attr_const(call);
594 /* Construct a new be_Return. */
595 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
596 unsigned pop, int n, ir_node *in[])
602 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL);
603 init_node_attr(res, -1);
604 for(i = 0; i < n; ++i) {
605 add_irn_n(res, in[i]);
606 add_register_req(res);
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(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);
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, ir_node *sz)
676 ir_node *in[be_pos_AddSP_last];
677 const arch_register_class_t *cls;
680 in[be_pos_AddSP_old_sp] = old_sp;
681 in[be_pos_AddSP_size] = sz;
683 irg = get_Block_irg(bl);
684 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
685 a = init_node_attr(irn, be_pos_AddSP_last);
687 /* Set output constraint to stack register. */
688 be_set_constr_single_reg_in(irn, be_pos_AddSP_old_sp, sp, 0);
689 be_node_set_reg_class_in(irn, be_pos_AddSP_size, arch_register_get_class(sp));
690 be_set_constr_single_reg_out(irn, pn_be_AddSP_sp, sp, arch_register_req_type_produces_sp);
692 cls = arch_register_get_class(sp);
697 ir_node *be_new_SubSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp, ir_node *sz)
701 ir_node *in[be_pos_SubSP_last];
704 in[be_pos_SubSP_old_sp] = old_sp;
705 in[be_pos_SubSP_size] = sz;
707 irg = get_Block_irg(bl);
708 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
709 a = init_node_attr(irn, be_pos_SubSP_last);
711 /* Set output constraint to stack register. */
712 be_set_constr_single_reg_in(irn, be_pos_SubSP_old_sp, sp, 0);
713 be_node_set_reg_class_in(irn, be_pos_SubSP_size, arch_register_get_class(sp));
714 be_set_constr_single_reg_out(irn, pn_be_SubSP_sp, sp, arch_register_req_type_produces_sp);
719 ir_node *be_new_RegParams(ir_node *bl, int n_outs)
723 ir_graph *irg = get_Block_irg(bl);
725 res = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, NULL);
726 init_node_attr(res, -1);
727 for(i = 0; i < n_outs; ++i)
728 add_register_req(res);
733 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_node *bl, ir_node *frame, ir_entity *ent)
738 ir_graph *irg = get_Block_irg(bl);
741 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
742 a = init_node_attr(irn, 1);
745 be_node_set_reg_class_in(irn, 0, cls_frame);
746 be_node_set_reg_class_out(irn, 0, cls_frame);
748 return optimize_node(irn);
751 ir_node *be_get_FrameAddr_frame(const ir_node *node) {
752 assert(be_is_FrameAddr(node));
753 return get_irn_n(node, be_pos_FrameAddr_ptr);
756 ir_entity *be_get_FrameAddr_entity(const ir_node *node)
758 const be_frame_attr_t *attr = get_irn_generic_attr_const(node);
762 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)
765 ir_node **in = ALLOCAN(ir_node*, n + 1);
766 ir_graph *irg = get_Block_irg(bl);
769 memcpy(&in[1], in_keep, n * sizeof(in[0]));
770 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
771 init_node_attr(irn, n + 1);
772 be_node_set_reg_class_in(irn, 0, cls);
773 be_node_set_reg_class_out(irn, 0, cls);
778 ir_node *be_new_CopyKeep_single(const arch_register_class_t *cls, ir_node *bl, ir_node *src, ir_node *keep, ir_mode *mode)
780 return be_new_CopyKeep(cls, bl, src, 1, &keep, mode);
783 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
784 return get_irn_n(cpy, be_pos_CopyKeep_op);
787 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
788 set_irn_n(cpy, be_pos_CopyKeep_op, op);
791 ir_node *be_new_Barrier(ir_node *bl, int n, ir_node *in[])
795 ir_graph *irg = get_Block_irg(bl);
797 res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
798 init_node_attr(res, -1);
799 for(i = 0; i < n; ++i) {
800 add_irn_n(res, in[i]);
801 add_register_req(res);
807 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
809 ir_node *block = get_nodes_block(barrier);
810 ir_mode *mode = get_irn_mode(node);
811 int n = add_irn_n(barrier, node);
813 ir_node *proj = new_r_Proj(block, barrier, mode, n);
814 add_register_req(barrier);
819 /* Construct a new be_Unwind. */
820 ir_node *be_new_Unwind(dbg_info *dbg, ir_node *block,
821 ir_node *mem, ir_node *sp)
825 ir_graph *irg = get_Block_irg(block);
827 in[be_pos_Unwind_mem] = mem;
828 in[be_pos_Unwind_sp] = sp;
829 res = new_ir_node(dbg, irg, block, op_be_Unwind, mode_X, 2, in);
830 init_node_attr(res, -1);
835 int be_has_frame_entity(const ir_node *irn)
837 switch (get_irn_opcode(irn)) {
847 ir_entity *be_get_frame_entity(const ir_node *irn)
849 if (be_has_frame_entity(irn)) {
850 const be_frame_attr_t *a = get_irn_attr_const(irn);
856 int be_get_frame_offset(const ir_node *irn)
858 assert(is_be_node(irn));
859 if (be_has_frame_entity(irn)) {
860 const be_frame_attr_t *a = get_irn_attr_const(irn);
866 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
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 attr->in_entities[n] = ent;
876 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
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 return attr->in_entities[n];
886 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
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 attr->out_entities[n] = ent;
896 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
898 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
900 assert(be_is_MemPerm(irn));
901 assert(n < be_get_MemPerm_entity_arity(irn));
903 return attr->out_entities[n];
906 int be_get_MemPerm_entity_arity(const ir_node *irn)
908 return get_irn_arity(irn) - 1;
911 static void set_req_single(struct obstack *obst, arch_register_req_t *req,
912 const arch_register_t *reg, arch_register_req_type_t additional_types)
914 const arch_register_class_t *cls = arch_register_get_class(reg);
915 unsigned *limited_bitset;
917 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
918 rbitset_set(limited_bitset, arch_register_get_index(reg));
921 req->type |= arch_register_req_type_limited | additional_types;
922 req->limited = limited_bitset;
926 void be_set_constr_single_reg_in(ir_node *node, int pos,
927 const arch_register_t *reg, arch_register_req_type_t additional_types)
929 arch_register_req_t *req = get_be_req(node, pos);
930 ir_graph *irg = get_irn_irg(node);
931 struct obstack *obst = get_irg_obstack(irg);
933 set_req_single(obst, req, reg, additional_types);
936 void be_set_constr_single_reg_out(ir_node *node, int pos,
937 const arch_register_t *reg, arch_register_req_type_t additional_types)
939 arch_register_req_t *req = get_be_req(node, BE_OUT_POS(pos));
940 ir_graph *irg = get_irn_irg(node);
941 struct obstack *obst = get_irg_obstack(irg);
943 /* if we have an ignore register, add ignore flag and just assign it */
944 if (reg->type & arch_register_type_ignore) {
945 additional_types |= arch_register_req_type_ignore;
948 arch_irn_set_register(node, pos, reg);
949 set_req_single(obst, req, reg, additional_types);
952 void be_set_constr_limited(ir_node *node, int pos, const arch_register_req_t *req)
954 ir_graph *irg = get_irn_irg(node);
955 struct obstack *obst = get_irg_obstack(irg);
956 arch_register_req_t *r = get_be_req(node, pos);
958 assert(arch_register_req_is(req, limited));
959 assert(!(req->type & (arch_register_req_type_should_be_same | arch_register_req_type_must_be_different)));
960 memcpy(r, req, sizeof(r[0]));
961 r->limited = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
964 void be_node_set_reg_class_in(ir_node *irn, int pos, const arch_register_class_t *cls)
966 arch_register_req_t *req = get_be_req(irn, pos);
971 req->type = arch_register_req_type_none;
972 } else if (req->type == arch_register_req_type_none) {
973 req->type = arch_register_req_type_normal;
977 void be_node_set_reg_class_out(ir_node *irn, int pos, const arch_register_class_t *cls)
979 arch_register_req_t *req = get_be_req(irn, BE_OUT_POS(pos));
984 req->type = arch_register_req_type_none;
985 } else if (req->type == arch_register_req_type_none) {
986 req->type = arch_register_req_type_normal;
990 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
992 arch_register_req_t *req = get_be_req(irn, pos);
996 ir_node *be_get_IncSP_pred(ir_node *irn) {
997 assert(be_is_IncSP(irn));
998 return get_irn_n(irn, 0);
1001 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
1002 assert(be_is_IncSP(incsp));
1003 set_irn_n(incsp, 0, pred);
1006 void be_set_IncSP_offset(ir_node *irn, int offset)
1008 be_incsp_attr_t *a = get_irn_attr(irn);
1009 assert(be_is_IncSP(irn));
1013 int be_get_IncSP_offset(const ir_node *irn)
1015 const be_incsp_attr_t *a = get_irn_attr_const(irn);
1016 assert(be_is_IncSP(irn));
1020 int be_get_IncSP_align(const ir_node *irn)
1022 const be_incsp_attr_t *a = get_irn_attr_const(irn);
1023 assert(be_is_IncSP(irn));
1027 ir_node *be_spill(ir_node *block, ir_node *irn)
1029 ir_graph *irg = get_Block_irg(block);
1030 ir_node *frame = get_irg_frame(irg);
1031 const arch_register_class_t *cls = arch_get_irn_reg_class_out(irn);
1032 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
1035 spill = be_new_Spill(cls, cls_frame, block, frame, irn);
1039 ir_node *be_reload(const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill)
1042 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
1043 ir_graph *irg = get_Block_irg(bl);
1044 ir_node *frame = get_irg_frame(irg);
1045 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
1047 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
1049 reload = be_new_Reload(cls, cls_frame, bl, frame, spill, mode);
1051 if (is_Block(insert)) {
1052 insert = sched_skip(insert, 0, sched_skip_cf_predicator, NULL);
1053 sched_add_after(insert, reload);
1055 sched_add_before(insert, reload);
1063 | _ \ ___ __ _ | _ \ ___ __ _ ___
1064 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
1065 | _ < __/ (_| | | _ < __/ (_| \__ \
1066 |_| \_\___|\__, | |_| \_\___|\__, |___/
1073 arch_register_req_t *get_out_reg_req(const ir_node *irn, int out_pos)
1075 const be_node_attr_t *a = get_irn_attr_const(irn);
1077 if (out_pos >= ARR_LEN(a->reg_data)) {
1078 return arch_no_register_req;
1081 return &a->reg_data[out_pos].req;
1085 arch_register_req_t *get_in_reg_req(const ir_node *irn, int pos)
1087 const be_node_attr_t *a = get_irn_attr_const(irn);
1089 if (pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
1090 return arch_no_register_req;
1092 return &a->reg_data[pos].in_req;
1095 static const arch_register_req_t *
1096 be_node_get_irn_reg_req(const ir_node *irn, int pos)
1101 if (get_irn_mode(irn) == mode_T)
1102 return arch_no_register_req;
1105 out_pos = redir_proj((const ir_node **)&irn);
1106 assert(is_be_node(irn));
1107 return get_out_reg_req(irn, out_pos);
1108 } else if (is_be_node(irn)) {
1110 * For spills and reloads, we return "none" as requirement for frame
1111 * pointer, so every input is ok. Some backends need this (e.g. STA).
1113 if ((pos == be_pos_Spill_frame && be_is_Spill(irn)) ||
1114 (pos == be_pos_Reload_frame && be_is_Reload(irn)))
1115 return arch_no_register_req;
1117 return get_in_reg_req(irn, pos);
1120 return arch_no_register_req;
1123 static arch_irn_class_t be_node_classify(const ir_node *irn)
1126 switch (get_irn_opcode(irn)) {
1127 #define XXX(a,b) case a: return b
1128 XXX(beo_Spill, arch_irn_class_spill);
1129 XXX(beo_Reload, arch_irn_class_reload);
1130 XXX(beo_Perm, arch_irn_class_perm);
1131 XXX(beo_Copy, arch_irn_class_copy);
1132 XXX(beo_Return, arch_irn_class_branch);
1135 irn = get_Proj_pred(irn);
1137 assert(get_irn_mode(irn) == mode_T);
1138 irn = get_Proj_pred(irn);
1147 static ir_entity *be_node_get_frame_entity(const ir_node *irn)
1149 return be_get_frame_entity(irn);
1152 static void be_node_set_frame_entity(ir_node *irn, ir_entity *ent)
1156 assert(be_has_frame_entity(irn));
1158 a = get_irn_attr(irn);
1162 static void be_node_set_frame_offset(ir_node *irn, int offset)
1164 if(be_has_frame_entity(irn)) {
1165 be_frame_attr_t *a = get_irn_attr(irn);
1170 static int be_node_get_sp_bias(const ir_node *irn)
1172 if(be_is_IncSP(irn))
1173 return be_get_IncSP_offset(irn);
1175 return -(int)be_Call_get_pop(irn);
1181 ___ ____ _ _ _ _ _ _
1182 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1183 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1184 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1185 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1189 static const arch_irn_ops_t be_node_irn_ops = {
1190 be_node_get_irn_reg_req,
1192 be_node_get_frame_entity,
1193 be_node_set_frame_entity,
1194 be_node_set_frame_offset,
1195 be_node_get_sp_bias,
1196 NULL, /* get_inverse */
1197 NULL, /* get_op_estimated_cost */
1198 NULL, /* possible_memory_operand */
1199 NULL, /* perform_memory_operand */
1203 ____ _ _ ___ ____ _ _ _ _ _ _
1204 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1205 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1206 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1207 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1212 const arch_register_t *reg;
1213 arch_register_req_t req;
1214 arch_irn_flags_t flags;
1221 #define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops)
1224 phi_attr_t *get_Phi_attr(const ir_node *phi)
1226 phi_attr_t *attr = pmap_get(phi_handler.phi_attrs, (void*) phi);
1228 ir_graph *irg = get_irn_irg(phi);
1229 struct obstack *obst = get_irg_obstack(irg);
1230 attr = obstack_alloc(obst, sizeof(attr[0]));
1231 memset(attr, 0, sizeof(attr[0]));
1232 pmap_insert(phi_handler.phi_attrs, phi, attr);
1239 * Get register class of a Phi.
1242 const arch_register_req_t *get_Phi_reg_req_recursive(const ir_node *phi,
1245 int n = get_irn_arity(phi);
1249 if(*visited && pset_find_ptr(*visited, phi))
1252 for(i = 0; i < n; ++i) {
1253 op = get_irn_n(phi, i);
1254 /* Matze: don't we unnecessary constraint our phis with this?
1255 * we only need to take the regclass IMO*/
1257 return arch_get_register_req_out(op);
1261 * The operands of that Phi were all Phis themselves.
1262 * We have to start a DFS for a non-Phi argument now.
1265 *visited = pset_new_ptr(16);
1267 pset_insert_ptr(*visited, phi);
1269 for(i = 0; i < n; ++i) {
1270 const arch_register_req_t *req;
1271 op = get_irn_n(phi, i);
1272 req = get_Phi_reg_req_recursive(op, visited);
1281 const arch_register_req_t *phi_get_irn_reg_req(const ir_node *irn, int pos)
1286 if(!mode_is_datab(get_irn_mode(irn)))
1287 return arch_no_register_req;
1289 attr = get_Phi_attr(irn);
1291 if(attr->req.type == arch_register_req_type_none) {
1292 pset *visited = NULL;
1293 const arch_register_req_t *req;
1294 req = get_Phi_reg_req_recursive(irn, &visited);
1297 assert(attr->req.cls != NULL);
1298 attr->req.type = arch_register_req_type_normal;
1307 void be_set_phi_reg_req(ir_node *node, const arch_register_req_t *req,
1308 arch_register_req_type_t additional_types)
1312 assert(mode_is_datab(get_irn_mode(node)));
1314 attr = get_Phi_attr(node);
1316 attr->req.type |= additional_types;
1319 void be_set_phi_flags(ir_node *node, arch_irn_flags_t flags)
1323 assert(mode_is_datab(get_irn_mode(node)));
1325 attr = get_Phi_attr(node);
1326 attr->flags = flags;
1329 static arch_irn_class_t phi_classify(const ir_node *irn)
1335 static ir_entity *phi_get_frame_entity(const ir_node *irn)
1341 static void phi_set_frame_entity(ir_node *irn, ir_entity *ent)
1345 panic("phi_set_frame_entity() should not be called");
1348 static void phi_set_frame_offset(ir_node *irn, int bias)
1352 panic("phi_set_frame_offset() should not be called");
1355 static int phi_get_sp_bias(const ir_node *irn)
1361 static const arch_irn_ops_t phi_irn_ops = {
1362 phi_get_irn_reg_req,
1364 phi_get_frame_entity,
1365 phi_set_frame_entity,
1366 phi_set_frame_offset,
1368 NULL, /* get_inverse */
1369 NULL, /* get_op_estimated_cost */
1370 NULL, /* possible_memory_operand */
1371 NULL, /* perform_memory_operand */
1374 void be_phi_handler_new(void)
1376 phi_handler.phi_attrs = pmap_create();
1377 op_Phi->ops.be_ops = &phi_irn_ops;
1380 void be_phi_handler_free(void)
1382 pmap_destroy(phi_handler.phi_attrs);
1383 phi_handler.phi_attrs = NULL;
1384 op_Phi->ops.be_ops = NULL;
1387 void be_phi_handler_reset(void)
1389 if(phi_handler.phi_attrs)
1390 pmap_destroy(phi_handler.phi_attrs);
1391 phi_handler.phi_attrs = pmap_create();
1396 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1397 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1398 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1399 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1404 * Dumps a register requirement to a file.
1406 static void dump_node_req(FILE *f, int idx, const arch_register_req_t *req,
1407 const ir_node *node)
1411 if (req->cls == NULL) return;
1413 arch_register_req_format(tmp, sizeof(tmp), req, node);
1414 fprintf(f, "#%d %s\n", idx, tmp);
1418 * Dumps node register requirements to a file.
1420 static void dump_node_reqs(FILE *f, ir_node *node)
1423 be_node_attr_t *a = get_irn_attr(node);
1424 int len = ARR_LEN(a->reg_data);
1426 fprintf(f, "registers: \n");
1427 for (i = 0; i < len; ++i) {
1428 const arch_register_t *reg = arch_irn_get_register(node, i);
1429 fprintf(f, "#%d: %s\n", i, reg != NULL ? reg->name : "n/a");
1432 fprintf(f, "in requirements:\n");
1433 for (i = 0; i < len; ++i) {
1434 dump_node_req(f, i, &a->reg_data[i].in_req, node);
1437 fprintf(f, "\nout requirements:\n");
1438 for (i = 0; i < len; ++i) {
1439 dump_node_req(f, i, &a->reg_data[i].req, node);
1444 * ir_op-Operation: dump a be node to file
1446 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1448 be_node_attr_t *at = get_irn_attr(irn);
1450 assert(is_be_node(irn));
1453 case dump_node_opcode_txt:
1454 fputs(get_op_name(get_irn_op(irn)), f);
1456 case dump_node_mode_txt:
1457 if(be_is_Perm(irn) || be_is_Copy(irn) || be_is_CopyKeep(irn)) {
1458 fprintf(f, " %s", get_mode_name(get_irn_mode(irn)));
1461 case dump_node_nodeattr_txt:
1462 if(be_is_Call(irn)) {
1463 be_call_attr_t *a = (be_call_attr_t *) at;
1465 fprintf(f, " [%s] ", get_entity_name(a->ent));
1467 if(be_is_IncSP(irn)) {
1468 const be_incsp_attr_t *attr = get_irn_generic_attr_const(irn);
1469 if(attr->offset == BE_STACK_FRAME_SIZE_EXPAND) {
1470 fprintf(f, " [Setup Stackframe] ");
1471 } else if(attr->offset == BE_STACK_FRAME_SIZE_SHRINK) {
1472 fprintf(f, " [Destroy Stackframe] ");
1474 fprintf(f, " [%d] ", attr->offset);
1478 case dump_node_info_txt:
1479 dump_node_reqs(f, irn);
1481 if(be_has_frame_entity(irn)) {
1482 be_frame_attr_t *a = (be_frame_attr_t *) at;
1484 unsigned size = get_type_size_bytes(get_entity_type(a->ent));
1485 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bytes\n",
1486 a->ent, a->offset, a->offset, size, size);
1491 switch (get_irn_opcode(irn)) {
1494 be_incsp_attr_t *a = (be_incsp_attr_t *) at;
1495 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1496 fprintf(f, "offset: FRAME_SIZE\n");
1497 else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1498 fprintf(f, "offset: -FRAME SIZE\n");
1500 fprintf(f, "offset: %u\n", a->offset);
1505 be_call_attr_t *a = (be_call_attr_t *) at;
1508 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1514 for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1515 ir_entity *in, *out;
1516 in = be_get_MemPerm_in_entity(irn, i);
1517 out = be_get_MemPerm_out_entity(irn, i);
1519 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1522 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1538 * Copies the backend specific attributes from old node to new node.
1540 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1542 const be_node_attr_t *old_attr = get_irn_attr_const(old_node);
1543 be_node_attr_t *new_attr = get_irn_attr(new_node);
1544 struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
1545 backend_info_t *old_info = be_get_info(old_node);
1546 backend_info_t *new_info = be_get_info(new_node);
1549 assert(is_be_node(old_node));
1550 assert(is_be_node(new_node));
1552 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1553 new_attr->reg_data = NULL;
1555 if(old_attr->reg_data != NULL)
1556 len = ARR_LEN(old_attr->reg_data);
1560 if(get_irn_op(old_node)->opar == oparity_dynamic
1561 || be_is_RegParams(old_node)) {
1562 new_attr->reg_data = NEW_ARR_F(be_reg_data_t, len);
1563 new_info->out_infos = NEW_ARR_F(reg_out_info_t, len);
1565 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, len);
1566 new_info->out_infos = NEW_ARR_D(reg_out_info_t, obst, len);
1570 memcpy(new_attr->reg_data, old_attr->reg_data, len * sizeof(be_reg_data_t));
1571 memcpy(new_info->out_infos, old_info->out_infos, len * sizeof(new_info->out_infos[0]));
1572 for(i = 0; i < len; ++i) {
1573 const be_reg_data_t *rd = &old_attr->reg_data[i];
1574 be_reg_data_t *newrd = &new_attr->reg_data[i];
1575 if (arch_register_req_is(&rd->req, limited)) {
1576 const arch_register_req_t *req = &rd->req;
1577 arch_register_req_t *new_req = &newrd->req;
1579 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1581 if(arch_register_req_is(&rd->in_req, limited)) {
1582 const arch_register_req_t *req = &rd->in_req;
1583 arch_register_req_t *new_req = &newrd->in_req;
1585 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1591 static const ir_op_ops be_node_op_ops = {
1612 int is_be_node(const ir_node *irn)
1614 return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops;
1617 void be_init_op(void)
1619 /* Acquire all needed opcodes. */
1620 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);
1621 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);
1622 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);
1623 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);
1624 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);
1625 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);
1626 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);
1627 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);
1628 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);
1629 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);
1630 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);
1631 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);
1632 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);
1633 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);
1634 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);
1635 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);
1637 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
1638 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
1639 op_be_Perm->ops.node_cmp_attr = node_cmp_attr;
1640 op_be_MemPerm->ops.node_cmp_attr = node_cmp_attr;
1641 op_be_Copy->ops.node_cmp_attr = node_cmp_attr;
1642 op_be_Keep->ops.node_cmp_attr = node_cmp_attr;
1643 op_be_CopyKeep->ops.node_cmp_attr = node_cmp_attr;
1644 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
1645 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
1646 op_be_AddSP->ops.node_cmp_attr = node_cmp_attr;
1647 op_be_SubSP->ops.node_cmp_attr = node_cmp_attr;
1648 op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr;
1649 op_be_RegParams->ops.node_cmp_attr = node_cmp_attr;
1650 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
1651 op_be_Barrier->ops.node_cmp_attr = node_cmp_attr;
1652 op_be_Unwind->ops.node_cmp_attr = node_cmp_attr;