2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Backend node support for generic backend nodes.
23 * @author Sebastian Hack
27 * Backend node support for generic backend nodes.
28 * This file provides Perm, Copy, Spill and Reload nodes.
41 #include "bitfiddle.h"
42 #include "raw_bitset.h"
62 #define get_irn_attr(irn) get_irn_generic_attr(irn)
63 #define get_irn_attr_const(irn) get_irn_generic_attr_const(irn)
66 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);
304 ir_node *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
305 ir_node *bl, ir_node *frame, ir_node *to_spill)
310 ir_graph *irg = get_Block_irg(bl);
314 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
315 a = init_node_attr(res, 2);
319 be_node_set_reg_class_in(res, be_pos_Spill_frame, cls_frame);
320 be_node_set_reg_class_in(res, be_pos_Spill_val, cls);
323 * For spills and reloads, we return "none" as requirement for frame
324 * pointer, so every input is ok. Some backends need this (e.g. STA).
325 * Matze: we should investigate if this is really needed, this solution
326 * looks very hacky to me
328 be_node_set_reg_class_in(res, be_pos_Spill_frame, NULL);
333 ir_node *be_new_Reload(const arch_register_class_t *cls,
334 const arch_register_class_t *cls_frame, ir_node *block,
335 ir_node *frame, ir_node *mem, ir_mode *mode)
339 ir_graph *irg = get_Block_irg(block);
343 res = new_ir_node(NULL, irg, block, op_be_Reload, mode, 2, in);
345 init_node_attr(res, 2);
346 be_node_set_reg_class_out(res, 0, cls);
347 be_node_set_reg_class_in(res, be_pos_Reload_frame, cls_frame);
348 arch_irn_set_flags(res, arch_irn_flags_rematerializable);
351 * For spills and reloads, we return "none" as requirement for frame
352 * pointer, so every input is ok. Some backends need this (e.g. STA).
353 * Matze: we should investigate if this is really needed, this solution
354 * looks very hacky to me
356 be_node_set_reg_class_in(res, be_pos_Reload_frame, NULL);
361 ir_node *be_get_Reload_mem(const ir_node *irn)
363 assert(be_is_Reload(irn));
364 return get_irn_n(irn, be_pos_Reload_mem);
367 ir_node *be_get_Reload_frame(const ir_node *irn)
369 assert(be_is_Reload(irn));
370 return get_irn_n(irn, be_pos_Reload_frame);
373 ir_node *be_get_Spill_val(const ir_node *irn)
375 assert(be_is_Spill(irn));
376 return get_irn_n(irn, be_pos_Spill_val);
379 ir_node *be_get_Spill_frame(const ir_node *irn)
381 assert(be_is_Spill(irn));
382 return get_irn_n(irn, be_pos_Spill_frame);
385 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_node *block, int n, ir_node *in[])
388 ir_graph *irg = get_Block_irg(block);
390 ir_node *irn = new_ir_node(NULL, irg, block, op_be_Perm, mode_T, n, in);
391 init_node_attr(irn, n);
392 for (i = 0; i < n; ++i) {
393 be_node_set_reg_class_in(irn, i, cls);
394 be_node_set_reg_class_out(irn, i, cls);
400 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
402 int arity = get_irn_arity(perm);
403 be_reg_data_t *old_data = ALLOCAN(be_reg_data_t, arity);
404 reg_out_info_t *old_infos = ALLOCAN(reg_out_info_t, arity);
405 be_node_attr_t *attr = get_irn_attr(perm);
406 backend_info_t *info = be_get_info(perm);
411 assert(be_is_Perm(perm));
412 assert(new_size <= arity);
414 new_in = alloca(new_size * sizeof(*new_in));
416 /* save the old register data */
417 memcpy(old_data, attr->reg_data, arity * sizeof(old_data[0]));
418 memcpy(old_infos, info->out_infos, arity * sizeof(old_infos[0]));
420 /* compose the new in array and set the new register data directly in place */
421 for (i = 0; i < new_size; ++i) {
423 new_in[i] = get_irn_n(perm, idx);
424 attr->reg_data[i] = old_data[idx];
425 info->out_infos[i] = old_infos[idx];
428 set_irn_in(perm, new_size, new_in);
431 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_node *bl, int n, ir_node *in[])
433 ir_graph *irg = get_Block_irg(bl);
434 ir_node *frame = get_irg_frame(irg);
435 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
436 const arch_register_t *sp = arch_env->sp;
438 be_memperm_attr_t *attr;
442 real_in = ALLOCAN(ir_node*, n + 1);
444 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
446 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
448 init_node_attr(irn, n + 1);
449 be_node_set_reg_class_in(irn, 0, sp->reg_class);
450 for (i = 0; i < n; ++i) {
451 be_node_set_reg_class_in(irn, i + 1, cls_frame);
452 be_node_set_reg_class_out(irn, i, cls_frame);
455 attr = get_irn_attr(irn);
456 attr->in_entities = OALLOCNZ(irg->obst, ir_entity*, n);
457 attr->out_entities = OALLOCNZ(irg->obst, ir_entity*, n);
463 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_node *bl, ir_node *op)
467 arch_register_req_t *req;
468 ir_graph *irg = get_Block_irg(bl);
471 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
472 init_node_attr(res, 1);
473 be_node_set_reg_class_in(res, 0, cls);
474 be_node_set_reg_class_out(res, 0, cls);
476 req = get_be_req(res, BE_OUT_POS(0));
478 req->type = arch_register_req_type_should_be_same;
479 req->other_same = 1U << 0;
484 ir_node *be_get_Copy_op(const ir_node *cpy) {
485 return get_irn_n(cpy, be_pos_Copy_op);
488 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
489 set_irn_n(cpy, be_pos_Copy_op, op);
492 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_node *bl, int n, ir_node *in[])
496 ir_graph *irg = get_Block_irg(bl);
498 res = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, -1, NULL);
499 init_node_attr(res, -1);
501 for(i = 0; i < n; ++i) {
502 add_irn_n(res, in[i]);
503 add_register_req(res);
504 be_node_set_reg_class_in(res, i, cls);
511 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
515 assert(be_is_Keep(keep));
516 n = add_irn_n(keep, node);
517 add_register_req(keep);
518 be_node_set_reg_class_in(keep, n, cls);
521 /* creates a be_Call */
522 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
523 int n_outs, int n, ir_node *in[], ir_type *call_tp)
526 int real_n = be_pos_Call_first_arg + n;
530 NEW_ARR_A(ir_node *, real_in, real_n);
531 real_in[be_pos_Call_mem] = mem;
532 real_in[be_pos_Call_sp] = sp;
533 real_in[be_pos_Call_ptr] = ptr;
534 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
536 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
537 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
539 a->call_tp = call_tp;
544 /* Gets the call entity or NULL if this is no static call. */
545 ir_entity *be_Call_get_entity(const ir_node *call) {
546 const be_call_attr_t *a = get_irn_attr_const(call);
547 assert(be_is_Call(call));
551 /* Sets the call entity. */
552 void be_Call_set_entity(ir_node *call, ir_entity *ent) {
553 be_call_attr_t *a = get_irn_attr(call);
554 assert(be_is_Call(call));
558 /* Gets the call type. */
559 ir_type *be_Call_get_type(ir_node *call) {
560 const be_call_attr_t *a = get_irn_attr_const(call);
561 assert(be_is_Call(call));
565 /* Sets the call type. */
566 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
567 be_call_attr_t *a = get_irn_attr(call);
568 assert(be_is_Call(call));
569 a->call_tp = call_tp;
572 void be_Call_set_pop(ir_node *call, unsigned pop) {
573 be_call_attr_t *a = get_irn_attr(call);
577 unsigned be_Call_get_pop(const ir_node *call) {
578 const be_call_attr_t *a = get_irn_attr_const(call);
582 /* Construct a new be_Return. */
583 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
584 unsigned pop, int n, ir_node *in[])
590 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL);
591 init_node_attr(res, -1);
592 for(i = 0; i < n; ++i) {
593 add_irn_n(res, in[i]);
594 add_register_req(res);
597 a = get_irn_attr(res);
598 a->num_ret_vals = n_res;
605 /* Returns the number of real returns values */
606 int be_Return_get_n_rets(const ir_node *ret) {
607 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
608 return a->num_ret_vals;
611 /* return the number of bytes that should be popped from stack when executing the Return. */
612 unsigned be_Return_get_pop(const ir_node *ret) {
613 const be_return_attr_t *a = get_irn_generic_attr_const(ret);
617 /* return non-zero, if number of popped bytes must be always emitted */
618 int be_Return_get_emit_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 void be_Return_set_emit_pop(ir_node *ret, int emit_pop) {
625 be_return_attr_t *a = get_irn_generic_attr(ret);
626 a->emit_pop = emit_pop;
629 int be_Return_append_node(ir_node *ret, ir_node *node) {
632 pos = add_irn_n(ret, node);
633 add_register_req(ret);
638 ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *bl,
639 ir_node *old_sp, int offset, int align)
644 ir_graph *irg = get_Block_irg(bl);
647 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode,
648 sizeof(in) / sizeof(in[0]), in);
649 a = init_node_attr(irn, 1);
653 /* Set output constraint to stack register. */
654 be_node_set_reg_class_in(irn, 0, sp->reg_class);
655 be_set_constr_single_reg_out(irn, 0, sp, arch_register_req_type_produces_sp);
660 ir_node *be_new_AddSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp, ir_node *sz)
664 ir_node *in[be_pos_AddSP_last];
665 const arch_register_class_t *cls;
668 in[be_pos_AddSP_old_sp] = old_sp;
669 in[be_pos_AddSP_size] = sz;
671 irg = get_Block_irg(bl);
672 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
673 a = init_node_attr(irn, be_pos_AddSP_last);
675 /* Set output constraint to stack register. */
676 be_set_constr_single_reg_in(irn, be_pos_AddSP_old_sp, sp, 0);
677 be_node_set_reg_class_in(irn, be_pos_AddSP_size, arch_register_get_class(sp));
678 be_set_constr_single_reg_out(irn, pn_be_AddSP_sp, sp, arch_register_req_type_produces_sp);
680 cls = arch_register_get_class(sp);
685 ir_node *be_new_SubSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp, ir_node *sz)
689 ir_node *in[be_pos_SubSP_last];
692 in[be_pos_SubSP_old_sp] = old_sp;
693 in[be_pos_SubSP_size] = sz;
695 irg = get_Block_irg(bl);
696 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
697 a = init_node_attr(irn, be_pos_SubSP_last);
699 /* Set output constraint to stack register. */
700 be_set_constr_single_reg_in(irn, be_pos_SubSP_old_sp, sp, 0);
701 be_node_set_reg_class_in(irn, be_pos_SubSP_size, arch_register_get_class(sp));
702 be_set_constr_single_reg_out(irn, pn_be_SubSP_sp, sp, arch_register_req_type_produces_sp);
707 ir_node *be_new_RegParams(ir_node *bl, int n_outs)
711 ir_graph *irg = get_Block_irg(bl);
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_node *bl, ir_node *frame, ir_entity *ent)
726 ir_graph *irg = get_Block_irg(bl);
729 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
730 a = init_node_attr(irn, 1);
733 be_node_set_reg_class_in(irn, 0, cls_frame);
734 be_node_set_reg_class_out(irn, 0, cls_frame);
736 return optimize_node(irn);
739 ir_node *be_get_FrameAddr_frame(const ir_node *node) {
740 assert(be_is_FrameAddr(node));
741 return get_irn_n(node, be_pos_FrameAddr_ptr);
744 ir_entity *be_get_FrameAddr_entity(const ir_node *node)
746 const be_frame_attr_t *attr = get_irn_generic_attr_const(node);
750 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)
753 ir_node **in = ALLOCAN(ir_node*, n + 1);
754 ir_graph *irg = get_Block_irg(bl);
757 memcpy(&in[1], in_keep, n * sizeof(in[0]));
758 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
759 init_node_attr(irn, n + 1);
760 be_node_set_reg_class_in(irn, 0, cls);
761 be_node_set_reg_class_out(irn, 0, cls);
766 ir_node *be_new_CopyKeep_single(const arch_register_class_t *cls, ir_node *bl, ir_node *src, ir_node *keep, ir_mode *mode)
768 return be_new_CopyKeep(cls, bl, src, 1, &keep, mode);
771 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
772 return get_irn_n(cpy, be_pos_CopyKeep_op);
775 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
776 set_irn_n(cpy, be_pos_CopyKeep_op, op);
779 ir_node *be_new_Barrier(ir_node *bl, int n, ir_node *in[])
783 ir_graph *irg = get_Block_irg(bl);
785 res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
786 init_node_attr(res, -1);
787 for(i = 0; i < n; ++i) {
788 add_irn_n(res, in[i]);
789 add_register_req(res);
795 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
797 ir_node *block = get_nodes_block(barrier);
798 ir_mode *mode = get_irn_mode(node);
799 int n = add_irn_n(barrier, node);
801 ir_node *proj = new_r_Proj(block, barrier, mode, n);
802 add_register_req(barrier);
807 /* Construct a new be_Unwind. */
808 ir_node *be_new_Unwind(dbg_info *dbg, ir_node *block,
809 ir_node *mem, ir_node *sp)
813 ir_graph *irg = get_Block_irg(block);
815 in[be_pos_Unwind_mem] = mem;
816 in[be_pos_Unwind_sp] = sp;
817 res = new_ir_node(dbg, irg, block, op_be_Unwind, mode_X, 2, in);
818 init_node_attr(res, -1);
823 int be_has_frame_entity(const ir_node *irn)
825 switch (get_irn_opcode(irn)) {
835 ir_entity *be_get_frame_entity(const ir_node *irn)
837 if (be_has_frame_entity(irn)) {
838 const be_frame_attr_t *a = get_irn_attr_const(irn);
844 int be_get_frame_offset(const ir_node *irn)
846 assert(is_be_node(irn));
847 if (be_has_frame_entity(irn)) {
848 const be_frame_attr_t *a = get_irn_attr_const(irn);
854 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
856 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
858 assert(be_is_MemPerm(irn));
859 assert(n < be_get_MemPerm_entity_arity(irn));
861 attr->in_entities[n] = ent;
864 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
866 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
868 assert(be_is_MemPerm(irn));
869 assert(n < be_get_MemPerm_entity_arity(irn));
871 return attr->in_entities[n];
874 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
876 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
878 assert(be_is_MemPerm(irn));
879 assert(n < be_get_MemPerm_entity_arity(irn));
881 attr->out_entities[n] = ent;
884 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
886 const be_memperm_attr_t *attr = get_irn_attr_const(irn);
888 assert(be_is_MemPerm(irn));
889 assert(n < be_get_MemPerm_entity_arity(irn));
891 return attr->out_entities[n];
894 int be_get_MemPerm_entity_arity(const ir_node *irn)
896 return get_irn_arity(irn) - 1;
899 static void set_req_single(struct obstack *obst, arch_register_req_t *req,
900 const arch_register_t *reg, arch_register_req_type_t additional_types)
902 const arch_register_class_t *cls = arch_register_get_class(reg);
903 unsigned *limited_bitset;
905 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
906 rbitset_set(limited_bitset, arch_register_get_index(reg));
909 req->type |= arch_register_req_type_limited | additional_types;
910 req->limited = limited_bitset;
914 void be_set_constr_single_reg_in(ir_node *node, int pos,
915 const arch_register_t *reg, arch_register_req_type_t additional_types)
917 arch_register_req_t *req = get_be_req(node, pos);
918 ir_graph *irg = get_irn_irg(node);
919 struct obstack *obst = get_irg_obstack(irg);
921 set_req_single(obst, req, reg, additional_types);
924 void be_set_constr_single_reg_out(ir_node *node, int pos,
925 const arch_register_t *reg, arch_register_req_type_t additional_types)
927 arch_register_req_t *req = get_be_req(node, BE_OUT_POS(pos));
928 ir_graph *irg = get_irn_irg(node);
929 struct obstack *obst = get_irg_obstack(irg);
931 /* if we have an ignore register, add ignore flag and just assign it */
932 if (reg->type & arch_register_type_ignore) {
933 additional_types |= arch_register_req_type_ignore;
936 arch_irn_set_register(node, pos, reg);
937 set_req_single(obst, req, reg, additional_types);
940 void be_set_constr_limited(ir_node *node, int pos, const arch_register_req_t *req)
942 ir_graph *irg = get_irn_irg(node);
943 struct obstack *obst = get_irg_obstack(irg);
944 arch_register_req_t *r = get_be_req(node, pos);
946 assert(arch_register_req_is(req, limited));
947 assert(!(req->type & (arch_register_req_type_should_be_same | arch_register_req_type_must_be_different)));
948 memcpy(r, req, sizeof(r[0]));
949 r->limited = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
952 void be_node_set_reg_class_in(ir_node *irn, int pos, const arch_register_class_t *cls)
954 arch_register_req_t *req = get_be_req(irn, pos);
959 req->type = arch_register_req_type_none;
960 } else if (req->type == arch_register_req_type_none) {
961 req->type = arch_register_req_type_normal;
965 void be_node_set_reg_class_out(ir_node *irn, int pos, const arch_register_class_t *cls)
967 arch_register_req_t *req = get_be_req(irn, BE_OUT_POS(pos));
972 req->type = arch_register_req_type_none;
973 } else if (req->type == arch_register_req_type_none) {
974 req->type = arch_register_req_type_normal;
978 ir_node *be_get_IncSP_pred(ir_node *irn) {
979 assert(be_is_IncSP(irn));
980 return get_irn_n(irn, 0);
983 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
984 assert(be_is_IncSP(incsp));
985 set_irn_n(incsp, 0, pred);
988 void be_set_IncSP_offset(ir_node *irn, int offset)
990 be_incsp_attr_t *a = get_irn_attr(irn);
991 assert(be_is_IncSP(irn));
995 int be_get_IncSP_offset(const ir_node *irn)
997 const be_incsp_attr_t *a = get_irn_attr_const(irn);
998 assert(be_is_IncSP(irn));
1002 int be_get_IncSP_align(const ir_node *irn)
1004 const be_incsp_attr_t *a = get_irn_attr_const(irn);
1005 assert(be_is_IncSP(irn));
1009 ir_node *be_spill(ir_node *block, ir_node *irn)
1011 ir_graph *irg = get_Block_irg(block);
1012 ir_node *frame = get_irg_frame(irg);
1013 const arch_register_class_t *cls = arch_get_irn_reg_class_out(irn);
1014 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
1017 spill = be_new_Spill(cls, cls_frame, block, frame, irn);
1021 ir_node *be_reload(const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill)
1024 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
1025 ir_graph *irg = get_Block_irg(bl);
1026 ir_node *frame = get_irg_frame(irg);
1027 const arch_register_class_t *cls_frame = arch_get_irn_reg_class_out(frame);
1029 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
1031 reload = be_new_Reload(cls, cls_frame, bl, frame, spill, mode);
1033 if (is_Block(insert)) {
1034 insert = sched_skip(insert, 0, sched_skip_cf_predicator, NULL);
1035 sched_add_after(insert, reload);
1037 sched_add_before(insert, reload);
1045 | _ \ ___ __ _ | _ \ ___ __ _ ___
1046 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
1047 | _ < __/ (_| | | _ < __/ (_| \__ \
1048 |_| \_\___|\__, | |_| \_\___|\__, |___/
1054 static const arch_register_req_t *be_node_get_out_reg_req(
1055 const ir_node *irn, int pos)
1057 const be_node_attr_t *a = get_irn_attr_const(irn);
1060 if (pos >= ARR_LEN(a->reg_data)) {
1061 return arch_no_register_req;
1064 return &a->reg_data[pos].req;
1067 static const arch_register_req_t *be_node_get_in_reg_req(
1068 const ir_node *irn, int pos)
1070 const be_node_attr_t *a = get_irn_attr_const(irn);
1073 if (pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
1074 return arch_no_register_req;
1076 return &a->reg_data[pos].in_req;
1079 static arch_irn_class_t be_node_classify(const ir_node *irn)
1081 switch (get_irn_opcode(irn)) {
1082 case beo_Spill: return arch_irn_class_spill;
1083 case beo_Reload: return arch_irn_class_reload;
1084 case beo_Perm: return arch_irn_class_perm;
1085 case beo_Copy: return arch_irn_class_copy;
1090 static ir_entity *be_node_get_frame_entity(const ir_node *irn)
1092 return be_get_frame_entity(irn);
1095 static void be_node_set_frame_entity(ir_node *irn, ir_entity *ent)
1099 assert(be_has_frame_entity(irn));
1101 a = get_irn_attr(irn);
1105 static void be_node_set_frame_offset(ir_node *irn, int offset)
1109 if(!be_has_frame_entity(irn))
1112 a = get_irn_attr(irn);
1116 static int be_node_get_sp_bias(const ir_node *irn)
1118 if(be_is_IncSP(irn))
1119 return be_get_IncSP_offset(irn);
1121 return -(int)be_Call_get_pop(irn);
1127 ___ ____ _ _ _ _ _ _
1128 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1129 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1130 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1131 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1136 static const arch_irn_ops_t be_node_irn_ops = {
1137 be_node_get_in_reg_req,
1138 be_node_get_out_reg_req,
1140 be_node_get_frame_entity,
1141 be_node_set_frame_entity,
1142 be_node_set_frame_offset,
1143 be_node_get_sp_bias,
1144 NULL, /* get_inverse */
1145 NULL, /* get_op_estimated_cost */
1146 NULL, /* possible_memory_operand */
1147 NULL, /* perform_memory_operand */
1150 static const arch_register_req_t *dummy_reg_req(
1151 const ir_node *node, int pos)
1155 return arch_no_register_req;
1158 static arch_irn_class_t dummy_classify(const ir_node *node)
1164 static ir_entity* dummy_get_frame_entity(const ir_node *node)
1170 static void dummy_set_frame_entity(ir_node *node, ir_entity *entity)
1174 panic("dummy_set_frame_entity() should not be called");
1177 static void dummy_set_frame_offset(ir_node *node, int bias)
1181 panic("dummy_set_frame_offset() should not be called");
1184 static int dummy_get_sp_bias(const ir_node *node)
1190 /* for "middleend" nodes */
1191 static const arch_irn_ops_t dummy_be_irn_ops = {
1195 dummy_get_frame_entity,
1196 dummy_set_frame_entity,
1197 dummy_set_frame_offset,
1199 NULL, /* get_inverse */
1200 NULL, /* get_op_estimated_cost */
1201 NULL, /* possible_memory_operand */
1202 NULL, /* perform_memory_operand */
1206 ____ _ _ ___ ____ _ _ _ _ _ _
1207 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1208 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1209 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1210 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1215 * Guess correct register class of a phi node by looking at its arguments
1217 static const arch_register_req_t *get_Phi_reg_req_recursive(const ir_node *phi,
1220 int n = get_irn_arity(phi);
1224 if(*visited && pset_find_ptr(*visited, phi))
1227 for(i = 0; i < n; ++i) {
1228 op = get_irn_n(phi, i);
1229 /* Matze: don't we unnecessary constraint our phis with this?
1230 * we only need to take the regclass IMO*/
1232 return arch_get_register_req_out(op);
1236 * The operands of that Phi were all Phis themselves.
1237 * We have to start a DFS for a non-Phi argument now.
1240 *visited = pset_new_ptr(16);
1242 pset_insert_ptr(*visited, phi);
1244 for(i = 0; i < n; ++i) {
1245 const arch_register_req_t *req;
1246 op = get_irn_n(phi, i);
1247 req = get_Phi_reg_req_recursive(op, visited);
1255 static const arch_register_req_t *phi_get_irn_reg_req(const ir_node *node,
1258 backend_info_t *info = be_get_info(node);
1259 const arch_register_req_t *req = info->out_infos[0].req;
1263 if (!mode_is_datab(get_irn_mode(node))) {
1264 req = arch_no_register_req;
1266 pset *visited = NULL;
1267 ir_graph *irg = get_irn_irg(node);
1268 struct obstack *obst = get_irg_obstack(irg);
1270 req = get_Phi_reg_req_recursive(node, &visited);
1271 assert(req->cls != NULL);
1273 if (req->type != arch_register_req_type_normal) {
1274 arch_register_req_t *nreq = OALLOCZ(obst, arch_register_req_t);
1275 nreq->type = arch_register_req_type_normal;
1276 nreq->cls = req->cls;
1280 if (visited != NULL)
1283 info->out_infos[0].req = req;
1289 void be_set_phi_reg_req(ir_node *node, const arch_register_req_t *req)
1291 backend_info_t *info = be_get_info(node);
1292 info->out_infos[0].req = req;
1294 assert(mode_is_datab(get_irn_mode(node)));
1297 int be_dump_phi_reg_reqs(ir_node *node, FILE *F, dump_reason_t reason)
1299 backend_info_t *info;
1304 case dump_node_opcode_txt:
1305 fputs(get_op_name(get_irn_op(node)), F);
1307 case dump_node_mode_txt:
1308 fprintf(F, "%s", get_mode_name(get_irn_mode(node)));
1310 case dump_node_nodeattr_txt:
1312 case dump_node_info_txt:
1313 info = be_get_info(node);
1315 /* we still have a little problem with the initialisation order. This
1316 dump function is attached to the Phi ops before we can be sure
1317 that all backend infos have been constructed... */
1319 const arch_register_req_t *req = info->out_infos[0].req;
1320 const arch_register_t *reg = arch_irn_get_register(node, 0);
1322 arity = get_irn_arity(node);
1323 for (i = 0; i < arity; ++i) {
1324 fprintf(F, "inreq #%d = ", i);
1325 arch_dump_register_req(F, req, node);
1328 fprintf(F, "outreq #0 = ");
1329 arch_dump_register_req(F, req, node);
1334 fprintf(F, "reg #0 = %s\n", reg != NULL ? reg->name : "n/a");
1346 static const arch_irn_ops_t phi_irn_ops = {
1347 phi_get_irn_reg_req,
1348 phi_get_irn_reg_req,
1350 dummy_get_frame_entity,
1351 dummy_set_frame_entity,
1352 dummy_set_frame_offset,
1354 NULL, /* get_inverse */
1355 NULL, /* get_op_estimated_cost */
1356 NULL, /* possible_memory_operand */
1357 NULL, /* perform_memory_operand */
1362 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1363 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1364 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1365 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1370 * Dumps node register requirements to a file.
1372 static void dump_node_reqs(FILE *F, ir_node *node)
1375 be_node_attr_t *a = get_irn_attr(node);
1376 int len = ARR_LEN(a->reg_data);
1378 for (i = 0; i < len; ++i) {
1379 const arch_register_req_t *req = &a->reg_data[i].in_req;
1380 if (req->cls == NULL)
1382 fprintf(F, "inreq #%d = ", i);
1383 arch_dump_register_req(F, req, node);
1387 for (i = 0; i < len; ++i) {
1388 const arch_register_req_t *req = &a->reg_data[i].req;
1389 if (req->cls == NULL)
1391 fprintf(F, "outreq #%d = ", i);
1392 arch_dump_register_req(F, req, node);
1398 for (i = 0; i < len; ++i) {
1399 const arch_register_t *reg = arch_irn_get_register(node, i);
1400 fprintf(F, "reg #%d = %s\n", i, reg != NULL ? reg->name : "n/a");
1405 * ir_op-Operation: dump a be node to file
1407 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1409 be_node_attr_t *at = get_irn_attr(irn);
1411 assert(is_be_node(irn));
1414 case dump_node_opcode_txt:
1415 fputs(get_op_name(get_irn_op(irn)), f);
1417 case dump_node_mode_txt:
1418 if(be_is_Perm(irn) || be_is_Copy(irn) || be_is_CopyKeep(irn)) {
1419 fprintf(f, " %s", get_mode_name(get_irn_mode(irn)));
1422 case dump_node_nodeattr_txt:
1423 if(be_is_Call(irn)) {
1424 be_call_attr_t *a = (be_call_attr_t *) at;
1426 fprintf(f, " [%s] ", get_entity_name(a->ent));
1428 if(be_is_IncSP(irn)) {
1429 const be_incsp_attr_t *attr = get_irn_generic_attr_const(irn);
1430 if(attr->offset == BE_STACK_FRAME_SIZE_EXPAND) {
1431 fprintf(f, " [Setup Stackframe] ");
1432 } else if(attr->offset == BE_STACK_FRAME_SIZE_SHRINK) {
1433 fprintf(f, " [Destroy Stackframe] ");
1435 fprintf(f, " [%d] ", attr->offset);
1439 case dump_node_info_txt:
1440 dump_node_reqs(f, irn);
1442 if(be_has_frame_entity(irn)) {
1443 be_frame_attr_t *a = (be_frame_attr_t *) at;
1445 unsigned size = get_type_size_bytes(get_entity_type(a->ent));
1446 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bytes\n",
1447 a->ent, a->offset, a->offset, size, size);
1452 switch (get_irn_opcode(irn)) {
1455 be_incsp_attr_t *a = (be_incsp_attr_t *) at;
1456 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1457 fprintf(f, "offset: FRAME_SIZE\n");
1458 else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1459 fprintf(f, "offset: -FRAME SIZE\n");
1461 fprintf(f, "offset: %u\n", a->offset);
1466 be_call_attr_t *a = (be_call_attr_t *) at;
1469 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1475 for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1476 ir_entity *in, *out;
1477 in = be_get_MemPerm_in_entity(irn, i);
1478 out = be_get_MemPerm_out_entity(irn, i);
1480 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1483 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1499 * Copies the backend specific attributes from old node to new node.
1501 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1503 const be_node_attr_t *old_attr = get_irn_attr_const(old_node);
1504 be_node_attr_t *new_attr = get_irn_attr(new_node);
1505 struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
1506 backend_info_t *old_info = be_get_info(old_node);
1507 backend_info_t *new_info = be_get_info(new_node);
1510 assert(is_be_node(old_node));
1511 assert(is_be_node(new_node));
1513 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1514 new_attr->reg_data = NULL;
1516 if(old_attr->reg_data != NULL)
1517 len = ARR_LEN(old_attr->reg_data);
1521 if(get_irn_op(old_node)->opar == oparity_dynamic
1522 || be_is_RegParams(old_node)) {
1523 new_attr->reg_data = NEW_ARR_F(be_reg_data_t, len);
1524 new_info->out_infos = NEW_ARR_F(reg_out_info_t, len);
1526 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, len);
1527 new_info->out_infos = NEW_ARR_D(reg_out_info_t, obst, len);
1531 memcpy(new_attr->reg_data, old_attr->reg_data, len * sizeof(be_reg_data_t));
1532 memcpy(new_info->out_infos, old_info->out_infos, len * sizeof(new_info->out_infos[0]));
1533 for(i = 0; i < len; ++i) {
1534 const be_reg_data_t *rd = &old_attr->reg_data[i];
1535 be_reg_data_t *newrd = &new_attr->reg_data[i];
1536 if (arch_register_req_is(&rd->req, limited)) {
1537 const arch_register_req_t *req = &rd->req;
1538 arch_register_req_t *new_req = &newrd->req;
1540 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1542 if(arch_register_req_is(&rd->in_req, limited)) {
1543 const arch_register_req_t *req = &rd->in_req;
1544 arch_register_req_t *new_req = &newrd->in_req;
1546 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1552 static const ir_op_ops be_node_op_ops = {
1573 int is_be_node(const ir_node *irn)
1575 return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops;
1578 void be_init_op(void)
1582 /* Acquire all needed opcodes. */
1583 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);
1584 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);
1585 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);
1586 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);
1587 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);
1588 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);
1589 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);
1590 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);
1591 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);
1592 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);
1593 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);
1594 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);
1595 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);
1596 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);
1597 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);
1598 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);
1600 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
1601 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
1602 op_be_Perm->ops.node_cmp_attr = node_cmp_attr;
1603 op_be_MemPerm->ops.node_cmp_attr = node_cmp_attr;
1604 op_be_Copy->ops.node_cmp_attr = node_cmp_attr;
1605 op_be_Keep->ops.node_cmp_attr = node_cmp_attr;
1606 op_be_CopyKeep->ops.node_cmp_attr = node_cmp_attr;
1607 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
1608 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
1609 op_be_AddSP->ops.node_cmp_attr = node_cmp_attr;
1610 op_be_SubSP->ops.node_cmp_attr = node_cmp_attr;
1611 op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr;
1612 op_be_RegParams->ops.node_cmp_attr = node_cmp_attr;
1613 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
1614 op_be_Barrier->ops.node_cmp_attr = node_cmp_attr;
1615 op_be_Unwind->ops.node_cmp_attr = node_cmp_attr;
1617 /* attach out dummy_ops to middle end nodes */
1618 for (opc = iro_First; opc <= iro_Last; ++opc) {
1619 ir_op *op = get_irp_opcode(opc);
1620 assert(op->ops.be_ops == NULL);
1621 op->ops.be_ops = &dummy_be_irn_ops;
1624 op_Phi->ops.be_ops = &phi_irn_ops;