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_graph *irg, ir_node *bl, ir_node *frame, ir_node *to_spill)
340 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
341 a = init_node_attr(res, 2);
345 be_node_set_reg_class_in(res, be_pos_Spill_frame, cls_frame);
346 be_node_set_reg_class_in(res, be_pos_Spill_val, cls);
350 ir_node *be_new_Reload(const arch_register_class_t *cls,
351 const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *block,
352 ir_node *frame, ir_node *mem, ir_mode *mode)
359 res = new_ir_node(NULL, irg, block, op_be_Reload, mode, 2, in);
361 init_node_attr(res, 2);
362 be_node_set_reg_class_out(res, 0, cls);
363 be_node_set_reg_class_in(res, be_pos_Reload_frame, cls_frame);
364 arch_irn_set_flags(res, arch_irn_flags_rematerializable);
368 ir_node *be_get_Reload_mem(const ir_node *irn)
370 assert(be_is_Reload(irn));
371 return get_irn_n(irn, be_pos_Reload_mem);
374 ir_node *be_get_Reload_frame(const ir_node *irn)
376 assert(be_is_Reload(irn));
377 return get_irn_n(irn, be_pos_Reload_frame);
380 ir_node *be_get_Spill_val(const ir_node *irn)
382 assert(be_is_Spill(irn));
383 return get_irn_n(irn, be_pos_Spill_val);
386 ir_node *be_get_Spill_frame(const ir_node *irn)
388 assert(be_is_Spill(irn));
389 return get_irn_n(irn, be_pos_Spill_frame);
392 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg,
393 ir_node *block, int n, ir_node *in[])
396 ir_node *irn = new_ir_node(NULL, irg, block, op_be_Perm, mode_T, n, in);
397 init_node_attr(irn, n);
398 for(i = 0; i < n; ++i) {
399 be_node_set_reg_class_in(irn, i, cls);
400 be_node_set_reg_class_out(irn, i, cls);
406 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
408 int arity = get_irn_arity(perm);
409 be_reg_data_t *old_data = ALLOCAN(be_reg_data_t, arity);
410 reg_out_info_t *old_infos = ALLOCAN(reg_out_info_t, arity);
411 be_node_attr_t *attr = get_irn_attr(perm);
412 backend_info_t *info = be_get_info(perm);
417 assert(be_is_Perm(perm));
418 assert(new_size <= arity);
420 new_in = alloca(new_size * sizeof(*new_in));
422 /* save the old register data */
423 memcpy(old_data, attr->reg_data, arity * sizeof(old_data[0]));
424 memcpy(old_infos, info->out_infos, arity * sizeof(old_infos[0]));
426 /* compose the new in array and set the new register data directly in place */
427 for (i = 0; i < new_size; ++i) {
429 new_in[i] = get_irn_n(perm, idx);
430 attr->reg_data[i] = old_data[idx];
431 info->out_infos[i] = old_infos[idx];
434 set_irn_in(perm, new_size, new_in);
437 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
439 ir_node *frame = get_irg_frame(irg);
440 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
441 const arch_register_t *sp = arch_env->sp;
443 be_memperm_attr_t *attr;
447 real_in = ALLOCAN(ir_node*, n + 1);
449 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
451 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
453 init_node_attr(irn, n + 1);
454 be_node_set_reg_class_in(irn, 0, sp->reg_class);
455 for (i = 0; i < n; ++i) {
456 be_node_set_reg_class_in(irn, i + 1, cls_frame);
457 be_node_set_reg_class_out(irn, i, cls_frame);
460 attr = get_irn_attr(irn);
462 attr->in_entities = obstack_alloc(irg->obst, n * sizeof(attr->in_entities[0]));
463 memset(attr->in_entities, 0, n * sizeof(attr->in_entities[0]));
464 attr->out_entities = obstack_alloc(irg->obst, n*sizeof(attr->out_entities[0]));
465 memset(attr->out_entities, 0, n*sizeof(attr->out_entities[0]));
471 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
475 arch_register_req_t *req;
478 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
479 init_node_attr(res, 1);
480 be_node_set_reg_class_in(res, 0, cls);
481 be_node_set_reg_class_out(res, 0, cls);
483 req = get_be_req(res, BE_OUT_POS(0));
485 req->type = arch_register_req_type_should_be_same;
486 req->other_same = 1U << 0;
491 ir_node *be_get_Copy_op(const ir_node *cpy) {
492 return get_irn_n(cpy, be_pos_Copy_op);
495 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
496 set_irn_n(cpy, be_pos_Copy_op, op);
499 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
504 res = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, -1, NULL);
505 init_node_attr(res, -1);
507 for(i = 0; i < n; ++i) {
508 add_irn_n(res, in[i]);
509 add_register_req(res);
510 be_node_set_reg_class_in(res, i, cls);
517 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
521 assert(be_is_Keep(keep));
522 n = add_irn_n(keep, node);
523 add_register_req(keep);
524 be_node_set_reg_class_in(keep, n, cls);
527 /* creates a be_Call */
528 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
529 int n_outs, int n, ir_node *in[], ir_type *call_tp)
532 int real_n = be_pos_Call_first_arg + n;
536 NEW_ARR_A(ir_node *, real_in, real_n);
537 real_in[be_pos_Call_mem] = mem;
538 real_in[be_pos_Call_sp] = sp;
539 real_in[be_pos_Call_ptr] = ptr;
540 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
542 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
543 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
545 a->call_tp = call_tp;
550 /* Gets the call entity or NULL if this is no static call. */
551 ir_entity *be_Call_get_entity(const ir_node *call) {
552 const be_call_attr_t *a = get_irn_attr_const(call);
553 assert(be_is_Call(call));
557 /* Sets the call entity. */
558 void be_Call_set_entity(ir_node *call, ir_entity *ent) {
559 be_call_attr_t *a = get_irn_attr(call);
560 assert(be_is_Call(call));
564 /* Gets the call type. */
565 ir_type *be_Call_get_type(ir_node *call) {
566 const be_call_attr_t *a = get_irn_attr_const(call);
567 assert(be_is_Call(call));
571 /* Sets the call type. */
572 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
573 be_call_attr_t *a = get_irn_attr(call);
574 assert(be_is_Call(call));
575 a->call_tp = call_tp;
578 void be_Call_set_pop(ir_node *call, unsigned pop) {
579 be_call_attr_t *a = get_irn_attr(call);
583 unsigned be_Call_get_pop(const ir_node *call) {
584 const be_call_attr_t *a = get_irn_attr_const(call);
588 /* Construct a new be_Return. */
589 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
590 unsigned pop, int n, ir_node *in[])
596 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL);
597 init_node_attr(res, -1);
598 for(i = 0; i < n; ++i) {
599 add_irn_n(res, in[i]);
600 add_register_req(res);
603 a = get_irn_attr(res);
604 a->num_ret_vals = n_res;
611 /* Returns the number of real returns values */
612 int be_Return_get_n_rets(const ir_node *ret) {
613 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
614 return a->num_ret_vals;
617 /* return the number of bytes that should be popped from stack when executing the Return. */
618 unsigned be_Return_get_pop(const ir_node *ret) {
619 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
623 /* return non-zero, if number of popped bytes must be always emitted */
624 int be_Return_get_emit_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 void be_Return_set_emit_pop(ir_node *ret, int emit_pop) {
631 be_return_attr_t *a = get_irn_generic_attr(ret);
632 a->emit_pop = emit_pop;
635 int be_Return_append_node(ir_node *ret, ir_node *node) {
638 pos = add_irn_n(ret, node);
639 add_register_req(ret);
644 ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl,
645 ir_node *old_sp, int offset, int align)
652 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode,
653 sizeof(in) / sizeof(in[0]), in);
654 a = init_node_attr(irn, 1);
658 /* Set output constraint to stack register. */
659 be_node_set_reg_class_in(irn, 0, sp->reg_class);
660 be_set_constr_single_reg_out(irn, 0, sp, arch_register_req_type_produces_sp);
665 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
669 ir_node *in[be_pos_AddSP_last];
670 const arch_register_class_t *cls;
672 in[be_pos_AddSP_old_sp] = old_sp;
673 in[be_pos_AddSP_size] = sz;
675 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
676 a = init_node_attr(irn, be_pos_AddSP_last);
678 /* Set output constraint to stack register. */
679 be_set_constr_single_reg_in(irn, be_pos_AddSP_old_sp, sp, 0);
680 be_node_set_reg_class_in(irn, be_pos_AddSP_size, arch_register_get_class(sp));
681 be_set_constr_single_reg_out(irn, pn_be_AddSP_sp, sp, arch_register_req_type_produces_sp);
683 cls = arch_register_get_class(sp);
688 ir_node *be_new_SubSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
692 ir_node *in[be_pos_SubSP_last];
694 in[be_pos_SubSP_old_sp] = old_sp;
695 in[be_pos_SubSP_size] = sz;
697 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
698 a = init_node_attr(irn, be_pos_SubSP_last);
700 /* Set output constraint to stack register. */
701 be_set_constr_single_reg_in(irn, be_pos_SubSP_old_sp, sp, 0);
702 be_node_set_reg_class_in(irn, be_pos_SubSP_size, arch_register_get_class(sp));
703 be_set_constr_single_reg_out(irn, pn_be_SubSP_sp, sp, arch_register_req_type_produces_sp);
708 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
713 res = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, NULL);
714 init_node_attr(res, -1);
715 for(i = 0; i < n_outs; ++i)
716 add_register_req(res);
721 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent)
728 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
729 a = init_node_attr(irn, 1);
732 be_node_set_reg_class_in(irn, 0, cls_frame);
733 be_node_set_reg_class_out(irn, 0, cls_frame);
735 return optimize_node(irn);
738 ir_node *be_get_FrameAddr_frame(const ir_node *node) {
739 assert(be_is_FrameAddr(node));
740 return get_irn_n(node, be_pos_FrameAddr_ptr);
743 ir_entity *be_get_FrameAddr_entity(const ir_node *node)
745 const be_frame_attr_t *attr = get_irn_generic_attr_const(node);
749 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)
752 ir_node **in = ALLOCAN(ir_node*, n + 1);
755 memcpy(&in[1], in_keep, n * sizeof(in[0]));
756 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
757 init_node_attr(irn, n + 1);
758 be_node_set_reg_class_in(irn, 0, cls);
759 be_node_set_reg_class_out(irn, 0, cls);
764 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)
766 return be_new_CopyKeep(cls, irg, bl, src, 1, &keep, mode);
769 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
770 return get_irn_n(cpy, be_pos_CopyKeep_op);
773 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
774 set_irn_n(cpy, be_pos_CopyKeep_op, op);
777 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
782 res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
783 init_node_attr(res, -1);
784 for(i = 0; i < n; ++i) {
785 add_irn_n(res, in[i]);
786 add_register_req(res);
792 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
794 ir_graph *irg = get_irn_irg(barrier);
795 ir_node *block = get_nodes_block(barrier);
796 ir_mode *mode = get_irn_mode(node);
797 int n = add_irn_n(barrier, node);
799 ir_node *proj = new_r_Proj(irg, block, barrier, mode, n);
800 add_register_req(barrier);
805 /* Construct a new be_Unwind. */
806 ir_node *be_new_Unwind(dbg_info *dbg, ir_graph *irg, ir_node *block,
807 ir_node *mem, ir_node *sp)
812 in[be_pos_Unwind_mem] = mem;
813 in[be_pos_Unwind_sp] = sp;
814 res = new_ir_node(dbg, irg, block, op_be_Unwind, mode_X, 2, in);
815 init_node_attr(res, -1);
820 int be_has_frame_entity(const ir_node *irn)
822 switch (get_irn_opcode(irn)) {
832 ir_entity *be_get_frame_entity(const ir_node *irn)
834 if (be_has_frame_entity(irn)) {
835 const be_frame_attr_t *a = get_irn_attr_const(irn);
841 int be_get_frame_offset(const ir_node *irn)
843 assert(is_be_node(irn));
844 if (be_has_frame_entity(irn)) {
845 const be_frame_attr_t *a = get_irn_attr_const(irn);
851 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
853 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
855 assert(be_is_MemPerm(irn));
856 assert(n < be_get_MemPerm_entity_arity(irn));
858 attr->in_entities[n] = ent;
861 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
863 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
865 assert(be_is_MemPerm(irn));
866 assert(n < be_get_MemPerm_entity_arity(irn));
868 return attr->in_entities[n];
871 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
873 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
875 assert(be_is_MemPerm(irn));
876 assert(n < be_get_MemPerm_entity_arity(irn));
878 attr->out_entities[n] = ent;
881 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
883 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
885 assert(be_is_MemPerm(irn));
886 assert(n < be_get_MemPerm_entity_arity(irn));
888 return attr->out_entities[n];
891 int be_get_MemPerm_entity_arity(const ir_node *irn)
893 return get_irn_arity(irn) - 1;
896 static void set_req_single(struct obstack *obst, arch_register_req_t *req,
897 const arch_register_t *reg, arch_register_req_type_t additional_types)
899 const arch_register_class_t *cls = arch_register_get_class(reg);
900 unsigned *limited_bitset;
902 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
903 rbitset_set(limited_bitset, arch_register_get_index(reg));
906 req->type |= arch_register_req_type_limited | additional_types;
907 req->limited = limited_bitset;
911 void be_set_constr_single_reg_in(ir_node *node, int pos,
912 const arch_register_t *reg, arch_register_req_type_t additional_types)
914 arch_register_req_t *req = get_be_req(node, pos);
915 ir_graph *irg = get_irn_irg(node);
916 struct obstack *obst = get_irg_obstack(irg);
918 set_req_single(obst, req, reg, additional_types);
921 void be_set_constr_single_reg_out(ir_node *node, int pos,
922 const arch_register_t *reg, arch_register_req_type_t additional_types)
924 arch_register_req_t *req = get_be_req(node, BE_OUT_POS(pos));
925 ir_graph *irg = get_irn_irg(node);
926 struct obstack *obst = get_irg_obstack(irg);
928 /* if we have an ignore register, add ignore flag and just assign it */
929 if (reg->type & arch_register_type_ignore) {
930 additional_types |= arch_register_req_type_ignore;
933 arch_irn_set_register(node, pos, reg);
934 set_req_single(obst, req, reg, additional_types);
937 void be_set_constr_limited(ir_node *node, int pos, const arch_register_req_t *req)
939 ir_graph *irg = get_irn_irg(node);
940 struct obstack *obst = get_irg_obstack(irg);
941 arch_register_req_t *r = get_be_req(node, pos);
943 assert(arch_register_req_is(req, limited));
944 assert(!(req->type & (arch_register_req_type_should_be_same | arch_register_req_type_must_be_different)));
945 memcpy(r, req, sizeof(r[0]));
946 r->limited = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
949 void be_node_set_reg_class_in(ir_node *irn, int pos, const arch_register_class_t *cls)
951 arch_register_req_t *req = get_be_req(irn, pos);
956 req->type = arch_register_req_type_none;
957 } else if (req->type == arch_register_req_type_none) {
958 req->type = arch_register_req_type_normal;
962 void be_node_set_reg_class_out(ir_node *irn, int pos, const arch_register_class_t *cls)
964 arch_register_req_t *req = get_be_req(irn, BE_OUT_POS(pos));
969 req->type = arch_register_req_type_none;
970 } else if (req->type == arch_register_req_type_none) {
971 req->type = arch_register_req_type_normal;
975 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
977 arch_register_req_t *req = get_be_req(irn, pos);
981 ir_node *be_get_IncSP_pred(ir_node *irn) {
982 assert(be_is_IncSP(irn));
983 return get_irn_n(irn, 0);
986 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
987 assert(be_is_IncSP(incsp));
988 set_irn_n(incsp, 0, pred);
991 void be_set_IncSP_offset(ir_node *irn, int offset)
993 be_incsp_attr_t *a = get_irn_attr(irn);
994 assert(be_is_IncSP(irn));
998 int be_get_IncSP_offset(const ir_node *irn)
1000 const be_incsp_attr_t *a = get_irn_attr_const(irn);
1001 assert(be_is_IncSP(irn));
1005 int be_get_IncSP_align(const ir_node *irn)
1007 const be_incsp_attr_t *a = get_irn_attr_const(irn);
1008 assert(be_is_IncSP(irn));
1012 ir_node *be_spill(ir_node *block, ir_node *irn)
1014 ir_graph *irg = get_irn_irg(block);
1015 ir_node *frame = get_irg_frame(irg);
1016 const arch_register_class_t *cls = arch_get_irn_reg_class_out(irn);
1017 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
1020 spill = be_new_Spill(cls, cls_frame, irg, block, frame, irn);
1024 ir_node *be_reload(const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill)
1027 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
1028 ir_graph *irg = get_irn_irg(bl);
1029 ir_node *frame = get_irg_frame(irg);
1030 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
1032 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
1034 reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
1036 if (is_Block(insert)) {
1037 insert = sched_skip(insert, 0, sched_skip_cf_predicator, NULL);
1038 sched_add_after(insert, reload);
1040 sched_add_before(insert, reload);
1048 | _ \ ___ __ _ | _ \ ___ __ _ ___
1049 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
1050 | _ < __/ (_| | | _ < __/ (_| \__ \
1051 |_| \_\___|\__, | |_| \_\___|\__, |___/
1058 arch_register_req_t *get_out_reg_req(const ir_node *irn, int out_pos)
1060 const be_node_attr_t *a = get_irn_attr_const(irn);
1062 if (out_pos >= ARR_LEN(a->reg_data)) {
1063 return arch_no_register_req;
1066 return &a->reg_data[out_pos].req;
1070 arch_register_req_t *get_in_reg_req(const ir_node *irn, int pos)
1072 const be_node_attr_t *a = get_irn_attr_const(irn);
1074 if (pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
1075 return arch_no_register_req;
1077 return &a->reg_data[pos].in_req;
1080 static const arch_register_req_t *
1081 be_node_get_irn_reg_req(const ir_node *irn, int pos)
1086 if (get_irn_mode(irn) == mode_T)
1087 return arch_no_register_req;
1090 out_pos = redir_proj((const ir_node **)&irn);
1091 assert(is_be_node(irn));
1092 return get_out_reg_req(irn, out_pos);
1093 } else if (is_be_node(irn)) {
1095 * For spills and reloads, we return "none" as requirement for frame
1096 * pointer, so every input is ok. Some backends need this (e.g. STA).
1098 if ((pos == be_pos_Spill_frame && be_is_Spill(irn)) ||
1099 (pos == be_pos_Reload_frame && be_is_Reload(irn)))
1100 return arch_no_register_req;
1102 return get_in_reg_req(irn, pos);
1105 return arch_no_register_req;
1108 static arch_irn_class_t be_node_classify(const ir_node *irn)
1111 switch (get_irn_opcode(irn)) {
1112 #define XXX(a,b) case a: return b
1113 XXX(beo_Spill, arch_irn_class_spill);
1114 XXX(beo_Reload, arch_irn_class_reload);
1115 XXX(beo_Perm, arch_irn_class_perm);
1116 XXX(beo_Copy, arch_irn_class_copy);
1117 XXX(beo_Return, arch_irn_class_branch);
1120 irn = get_Proj_pred(irn);
1122 assert(get_irn_mode(irn) == mode_T);
1123 irn = get_Proj_pred(irn);
1132 static ir_entity *be_node_get_frame_entity(const ir_node *irn)
1134 return be_get_frame_entity(irn);
1137 static void be_node_set_frame_entity(ir_node *irn, ir_entity *ent)
1141 assert(be_has_frame_entity(irn));
1143 a = get_irn_attr(irn);
1147 static void be_node_set_frame_offset(ir_node *irn, int offset)
1149 if(be_has_frame_entity(irn)) {
1150 be_frame_attr_t *a = get_irn_attr(irn);
1155 static int be_node_get_sp_bias(const ir_node *irn)
1157 if(be_is_IncSP(irn))
1158 return be_get_IncSP_offset(irn);
1160 return -(int)be_Call_get_pop(irn);
1166 ___ ____ _ _ _ _ _ _
1167 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1168 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1169 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1170 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1174 static const arch_irn_ops_t be_node_irn_ops = {
1175 be_node_get_irn_reg_req,
1177 be_node_get_frame_entity,
1178 be_node_set_frame_entity,
1179 be_node_set_frame_offset,
1180 be_node_get_sp_bias,
1181 NULL, /* get_inverse */
1182 NULL, /* get_op_estimated_cost */
1183 NULL, /* possible_memory_operand */
1184 NULL, /* perform_memory_operand */
1188 ____ _ _ ___ ____ _ _ _ _ _ _
1189 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1190 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1191 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1192 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1197 const arch_register_t *reg;
1198 arch_register_req_t req;
1199 arch_irn_flags_t flags;
1206 #define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops)
1209 phi_attr_t *get_Phi_attr(const ir_node *phi)
1211 phi_attr_t *attr = pmap_get(phi_handler.phi_attrs, (void*) phi);
1213 ir_graph *irg = get_irn_irg(phi);
1214 struct obstack *obst = get_irg_obstack(irg);
1215 attr = obstack_alloc(obst, sizeof(attr[0]));
1216 memset(attr, 0, sizeof(attr[0]));
1217 pmap_insert(phi_handler.phi_attrs, phi, attr);
1224 * Get register class of a Phi.
1227 const arch_register_req_t *get_Phi_reg_req_recursive(const ir_node *phi,
1230 int n = get_irn_arity(phi);
1234 if(*visited && pset_find_ptr(*visited, phi))
1237 for(i = 0; i < n; ++i) {
1238 op = get_irn_n(phi, i);
1239 /* Matze: don't we unnecessary constraint our phis with this?
1240 * we only need to take the regclass IMO*/
1242 return arch_get_register_req_out(op);
1246 * The operands of that Phi were all Phis themselves.
1247 * We have to start a DFS for a non-Phi argument now.
1250 *visited = pset_new_ptr(16);
1252 pset_insert_ptr(*visited, phi);
1254 for(i = 0; i < n; ++i) {
1255 const arch_register_req_t *req;
1256 op = get_irn_n(phi, i);
1257 req = get_Phi_reg_req_recursive(op, visited);
1266 const arch_register_req_t *phi_get_irn_reg_req(const ir_node *irn, int pos)
1271 if(!mode_is_datab(get_irn_mode(irn)))
1272 return arch_no_register_req;
1274 attr = get_Phi_attr(irn);
1276 if(attr->req.type == arch_register_req_type_none) {
1277 pset *visited = NULL;
1278 const arch_register_req_t *req;
1279 req = get_Phi_reg_req_recursive(irn, &visited);
1282 assert(attr->req.cls != NULL);
1283 attr->req.type = arch_register_req_type_normal;
1292 void be_set_phi_reg_req(ir_node *node, const arch_register_req_t *req,
1293 arch_register_req_type_t additional_types)
1297 assert(mode_is_datab(get_irn_mode(node)));
1299 attr = get_Phi_attr(node);
1301 attr->req.type |= additional_types;
1304 void be_set_phi_flags(ir_node *node, arch_irn_flags_t flags)
1308 assert(mode_is_datab(get_irn_mode(node)));
1310 attr = get_Phi_attr(node);
1311 attr->flags = flags;
1314 static arch_irn_class_t phi_classify(const ir_node *irn)
1320 static ir_entity *phi_get_frame_entity(const ir_node *irn)
1326 static void phi_set_frame_entity(ir_node *irn, ir_entity *ent)
1330 panic("phi_set_frame_entity() should not be called");
1333 static void phi_set_frame_offset(ir_node *irn, int bias)
1337 panic("phi_set_frame_offset() should not be called");
1340 static int phi_get_sp_bias(const ir_node *irn)
1346 static const arch_irn_ops_t phi_irn_ops = {
1347 phi_get_irn_reg_req,
1349 phi_get_frame_entity,
1350 phi_set_frame_entity,
1351 phi_set_frame_offset,
1353 NULL, /* get_inverse */
1354 NULL, /* get_op_estimated_cost */
1355 NULL, /* possible_memory_operand */
1356 NULL, /* perform_memory_operand */
1359 void be_phi_handler_new(void)
1361 phi_handler.phi_attrs = pmap_create();
1362 op_Phi->ops.be_ops = &phi_irn_ops;
1365 void be_phi_handler_free(void)
1367 pmap_destroy(phi_handler.phi_attrs);
1368 phi_handler.phi_attrs = NULL;
1369 op_Phi->ops.be_ops = NULL;
1372 void be_phi_handler_reset(void)
1374 if(phi_handler.phi_attrs)
1375 pmap_destroy(phi_handler.phi_attrs);
1376 phi_handler.phi_attrs = pmap_create();
1381 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1382 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1383 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1384 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1389 * Dumps a register requirement to a file.
1391 static void dump_node_req(FILE *f, int idx, const arch_register_req_t *req,
1392 const ir_node *node)
1396 if (req->cls == NULL) return;
1398 arch_register_req_format(tmp, sizeof(tmp), req, node);
1399 fprintf(f, "#%d %s\n", idx, tmp);
1403 * Dumps node register requirements to a file.
1405 static void dump_node_reqs(FILE *f, ir_node *node)
1408 be_node_attr_t *a = get_irn_attr(node);
1409 int len = ARR_LEN(a->reg_data);
1411 fprintf(f, "registers: \n");
1412 for (i = 0; i < len; ++i) {
1413 const arch_register_t *reg = arch_irn_get_register(node, i);
1414 fprintf(f, "#%d: %s\n", i, reg != NULL ? reg->name : "n/a");
1417 fprintf(f, "in requirements:\n");
1418 for (i = 0; i < len; ++i) {
1419 dump_node_req(f, i, &a->reg_data[i].in_req, node);
1422 fprintf(f, "\nout requirements:\n");
1423 for (i = 0; i < len; ++i) {
1424 dump_node_req(f, i, &a->reg_data[i].req, node);
1429 * ir_op-Operation: dump a be node to file
1431 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1433 be_node_attr_t *at = get_irn_attr(irn);
1435 assert(is_be_node(irn));
1438 case dump_node_opcode_txt:
1439 fputs(get_op_name(get_irn_op(irn)), f);
1441 case dump_node_mode_txt:
1442 if(be_is_Perm(irn) || be_is_Copy(irn) || be_is_CopyKeep(irn)) {
1443 fprintf(f, " %s", get_mode_name(get_irn_mode(irn)));
1446 case dump_node_nodeattr_txt:
1447 if(be_is_Call(irn)) {
1448 be_call_attr_t *a = (be_call_attr_t *) at;
1450 fprintf(f, " [%s] ", get_entity_name(a->ent));
1452 if(be_is_IncSP(irn)) {
1453 const be_incsp_attr_t *attr = get_irn_generic_attr_const(irn);
1454 if(attr->offset == BE_STACK_FRAME_SIZE_EXPAND) {
1455 fprintf(f, " [Setup Stackframe] ");
1456 } else if(attr->offset == BE_STACK_FRAME_SIZE_SHRINK) {
1457 fprintf(f, " [Destroy Stackframe] ");
1459 fprintf(f, " [%d] ", attr->offset);
1463 case dump_node_info_txt:
1464 dump_node_reqs(f, irn);
1466 if(be_has_frame_entity(irn)) {
1467 be_frame_attr_t *a = (be_frame_attr_t *) at;
1469 unsigned size = get_type_size_bytes(get_entity_type(a->ent));
1470 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bytes\n",
1471 a->ent, a->offset, a->offset, size, size);
1476 switch (get_irn_opcode(irn)) {
1479 be_incsp_attr_t *a = (be_incsp_attr_t *) at;
1480 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1481 fprintf(f, "offset: FRAME_SIZE\n");
1482 else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1483 fprintf(f, "offset: -FRAME SIZE\n");
1485 fprintf(f, "offset: %u\n", a->offset);
1490 be_call_attr_t *a = (be_call_attr_t *) at;
1493 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1499 for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1500 ir_entity *in, *out;
1501 in = be_get_MemPerm_in_entity(irn, i);
1502 out = be_get_MemPerm_out_entity(irn, i);
1504 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1507 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1523 * Copies the backend specific attributes from old node to new node.
1525 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1527 const be_node_attr_t *old_attr = get_irn_attr_const(old_node);
1528 be_node_attr_t *new_attr = get_irn_attr(new_node);
1529 struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
1530 backend_info_t *old_info = be_get_info(old_node);
1531 backend_info_t *new_info = be_get_info(new_node);
1534 assert(is_be_node(old_node));
1535 assert(is_be_node(new_node));
1537 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1538 new_attr->reg_data = NULL;
1540 if(old_attr->reg_data != NULL)
1541 len = ARR_LEN(old_attr->reg_data);
1545 if(get_irn_op(old_node)->opar == oparity_dynamic
1546 || be_is_RegParams(old_node)) {
1547 new_attr->reg_data = NEW_ARR_F(be_reg_data_t, len);
1548 new_info->out_infos = NEW_ARR_F(reg_out_info_t, len);
1550 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, len);
1551 new_info->out_infos = NEW_ARR_D(reg_out_info_t, obst, len);
1555 memcpy(new_attr->reg_data, old_attr->reg_data, len * sizeof(be_reg_data_t));
1556 memcpy(new_info->out_infos, old_info->out_infos, len * sizeof(new_info->out_infos[0]));
1557 for(i = 0; i < len; ++i) {
1558 const be_reg_data_t *rd = &old_attr->reg_data[i];
1559 be_reg_data_t *newrd = &new_attr->reg_data[i];
1560 if (arch_register_req_is(&rd->req, limited)) {
1561 const arch_register_req_t *req = &rd->req;
1562 arch_register_req_t *new_req = &newrd->req;
1564 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1566 if(arch_register_req_is(&rd->in_req, limited)) {
1567 const arch_register_req_t *req = &rd->in_req;
1568 arch_register_req_t *new_req = &newrd->in_req;
1570 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1576 static const ir_op_ops be_node_op_ops = {
1597 int is_be_node(const ir_node *irn)
1599 return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops;
1602 void be_init_op(void)
1604 /* Acquire all needed opcodes. */
1605 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);
1606 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);
1607 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);
1608 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);
1609 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);
1610 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);
1611 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);
1612 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);
1613 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);
1614 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);
1615 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);
1616 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);
1617 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);
1618 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);
1619 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);
1620 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);
1622 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
1623 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
1624 op_be_Perm->ops.node_cmp_attr = node_cmp_attr;
1625 op_be_MemPerm->ops.node_cmp_attr = node_cmp_attr;
1626 op_be_Copy->ops.node_cmp_attr = node_cmp_attr;
1627 op_be_Keep->ops.node_cmp_attr = node_cmp_attr;
1628 op_be_CopyKeep->ops.node_cmp_attr = node_cmp_attr;
1629 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
1630 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
1631 op_be_AddSP->ops.node_cmp_attr = node_cmp_attr;
1632 op_be_SubSP->ops.node_cmp_attr = node_cmp_attr;
1633 op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr;
1634 op_be_RegParams->ops.node_cmp_attr = node_cmp_attr;
1635 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
1636 op_be_Barrier->ops.node_cmp_attr = node_cmp_attr;
1637 op_be_Unwind->ops.node_cmp_attr = node_cmp_attr;