2 * Copyright (C) 1995-2011 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
26 * Backend node support for generic backend nodes.
27 * This file provides Perm, Copy, Spill and Reload nodes.
40 #include "bitfiddle.h"
41 #include "raw_bitset.h"
52 #include "irbackedge_t.h"
53 #include "irverify_t.h"
63 typedef struct be_node_attr_t {
67 /** The be_Return nodes attribute type. */
70 int num_ret_vals; /**< number of return values */
71 unsigned pop; /**< number of bytes that should be popped */
72 int emit_pop; /**< if set, emit pop bytes, even if pop = 0 */
75 /** The be_IncSP attribute type. */
78 int offset; /**< The offset by which the stack shall be
80 int align; /**< whether stack should be aligned after the
84 /** The be_Frame attribute type. */
91 /** The be_Call attribute type. */
94 ir_entity *ent; /**< called entity if this is a static call. */
96 ir_type *call_tp; /**< call type, copied from the original Call */
101 ir_entity **in_entities;
102 ir_entity **out_entities;
108 ir_op *op_be_MemPerm;
111 ir_op *op_be_CopyKeep;
118 ir_op *op_be_FrameAddr;
121 * Compare the attributes of two be_FrameAddr nodes.
123 * @return zero if both nodes have identically attributes
125 static int FrameAddr_cmp_attr(const ir_node *a, const ir_node *b)
127 const be_frame_attr_t *a_attr = (const be_frame_attr_t*)get_irn_generic_attr_const(a);
128 const be_frame_attr_t *b_attr = (const be_frame_attr_t*)get_irn_generic_attr_const(b);
130 if (a_attr->ent != b_attr->ent || a_attr->offset != b_attr->offset)
133 return be_nodes_equal(a, b);
137 * Compare the attributes of two be_Return nodes.
139 * @return zero if both nodes have identically attributes
141 static int Return_cmp_attr(const ir_node *a, const ir_node *b)
143 const be_return_attr_t *a_attr = (const be_return_attr_t*)get_irn_generic_attr_const(a);
144 const be_return_attr_t *b_attr = (const be_return_attr_t*)get_irn_generic_attr_const(b);
146 if (a_attr->num_ret_vals != b_attr->num_ret_vals)
148 if (a_attr->pop != b_attr->pop)
150 if (a_attr->emit_pop != b_attr->emit_pop)
153 return be_nodes_equal(a, b);
157 * Compare the attributes of two be_IncSP nodes.
159 * @return zero if both nodes have identically attributes
161 static int IncSP_cmp_attr(const ir_node *a, const ir_node *b)
163 const be_incsp_attr_t *a_attr = (const be_incsp_attr_t*)get_irn_generic_attr_const(a);
164 const be_incsp_attr_t *b_attr = (const be_incsp_attr_t*)get_irn_generic_attr_const(b);
166 if (a_attr->offset != b_attr->offset)
169 return be_nodes_equal(a, b);
173 * Compare the attributes of two be_Call nodes.
175 * @return zero if both nodes have identically attributes
177 static int Call_cmp_attr(const ir_node *a, const ir_node *b)
179 const be_call_attr_t *a_attr = (const be_call_attr_t*)get_irn_generic_attr_const(a);
180 const be_call_attr_t *b_attr = (const be_call_attr_t*)get_irn_generic_attr_const(b);
182 if (a_attr->ent != b_attr->ent ||
183 a_attr->call_tp != b_attr->call_tp)
186 return be_nodes_equal(a, b);
189 static arch_register_req_t *allocate_reg_req(ir_graph *const irg)
191 struct obstack *obst = be_get_be_obst(irg);
193 arch_register_req_t *req = OALLOCZ(obst, arch_register_req_t);
197 void be_set_constr_in(ir_node *node, int pos, const arch_register_req_t *req)
199 backend_info_t *info = be_get_info(node);
200 assert(pos < get_irn_arity(node));
201 info->in_reqs[pos] = req;
204 void be_set_constr_out(ir_node *node, int pos, const arch_register_req_t *req)
206 backend_info_t *info = be_get_info(node);
207 info->out_infos[pos].req = req;
211 * Initializes the generic attribute of all be nodes and return it.
213 static void init_node_attr(ir_node *node, int n_inputs, int n_outputs)
215 assert(n_outputs >= 0);
217 ir_graph *irg = get_irn_irg(node);
218 struct obstack *obst = be_get_be_obst(irg);
219 backend_info_t *info = be_get_info(node);
220 const arch_register_req_t **in_reqs;
224 assert(n_inputs == get_irn_arity(node));
225 in_reqs = OALLOCN(obst, const arch_register_req_t*, n_inputs);
226 for (i = 0; i < n_inputs; ++i) {
227 in_reqs[i] = arch_no_register_req;
230 in_reqs = NEW_ARR_F(const arch_register_req_t*, 0);
232 info->in_reqs = in_reqs;
234 info->out_infos = NEW_ARR_DZ(reg_out_info_t, obst, n_outputs);
235 for (int i = 0; i < n_outputs; ++i) {
236 info->out_infos[i].req = arch_no_register_req;
240 static void add_register_req_in(ir_node *node, const arch_register_req_t *req)
242 backend_info_t *info = be_get_info(node);
243 ARR_APP1(const arch_register_req_t*, info->in_reqs, req);
246 ir_node *be_new_Spill(const arch_register_class_t *cls,
247 const arch_register_class_t *cls_frame, ir_node *bl,
248 ir_node *frame, ir_node *to_spill)
253 ir_graph *irg = get_Block_irg(bl);
257 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
258 init_node_attr(res, 2, 1);
259 a = (be_frame_attr_t*) get_irn_generic_attr(res);
262 a->base.exc.pin_state = op_pin_state_pinned;
264 be_node_set_reg_class_in(res, n_be_Spill_frame, cls_frame);
265 be_node_set_reg_class_in(res, n_be_Spill_val, cls);
266 arch_set_irn_register_req_out(res, 0, arch_no_register_req);
271 ir_node *be_new_Reload(const arch_register_class_t *cls,
272 const arch_register_class_t *cls_frame, ir_node *block,
273 ir_node *frame, ir_node *mem, ir_mode *mode)
277 ir_graph *irg = get_Block_irg(block);
282 res = new_ir_node(NULL, irg, block, op_be_Reload, mode, 2, in);
284 init_node_attr(res, 2, 1);
285 be_node_set_reg_class_out(res, 0, cls);
287 be_node_set_reg_class_in(res, n_be_Reload_frame, cls_frame);
288 arch_set_irn_flags(res, arch_irn_flags_rematerializable);
290 a = (be_frame_attr_t*) get_irn_generic_attr(res);
293 a->base.exc.pin_state = op_pin_state_pinned;
298 ir_node *be_get_Reload_mem(const ir_node *irn)
300 assert(be_is_Reload(irn));
301 return get_irn_n(irn, n_be_Reload_mem);
304 ir_node *be_get_Reload_frame(const ir_node *irn)
306 assert(be_is_Reload(irn));
307 return get_irn_n(irn, n_be_Reload_frame);
310 ir_node *be_get_Spill_val(const ir_node *irn)
312 assert(be_is_Spill(irn));
313 return get_irn_n(irn, n_be_Spill_val);
316 ir_node *be_get_Spill_frame(const ir_node *irn)
318 assert(be_is_Spill(irn));
319 return get_irn_n(irn, n_be_Spill_frame);
322 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_node *block,
323 int n, ir_node *in[])
326 ir_graph *irg = get_Block_irg(block);
327 be_node_attr_t *attr;
329 ir_node *irn = new_ir_node(NULL, irg, block, op_be_Perm, mode_T, n, in);
330 init_node_attr(irn, n, n);
331 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
332 attr->exc.pin_state = op_pin_state_pinned;
333 for (i = 0; i < n; ++i) {
334 const ir_node *input = in[i];
335 const arch_register_req_t *req = arch_get_irn_register_req(input);
336 if (req->width == 1) {
337 be_set_constr_in(irn, i, cls->class_req);
338 be_set_constr_out(irn, i, cls->class_req);
340 arch_register_req_t *const new_req = allocate_reg_req(irg);
342 new_req->type = (req->type & arch_register_req_type_aligned);
343 new_req->width = req->width;
344 be_set_constr_in(irn, i, new_req);
345 be_set_constr_out(irn, i, new_req);
352 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
354 int arity = get_irn_arity(perm);
355 const arch_register_req_t **old_in_reqs
356 = ALLOCAN(const arch_register_req_t*, arity);
357 reg_out_info_t *old_infos = ALLOCAN(reg_out_info_t, arity);
358 backend_info_t *info = be_get_info(perm);
362 assert(be_is_Perm(perm));
363 assert(new_size <= arity);
365 new_in = ALLOCAN(ir_node*, new_size);
367 /* save the old register data */
368 memcpy(old_in_reqs, info->in_reqs, arity * sizeof(old_in_reqs[0]));
369 memcpy(old_infos, info->out_infos, arity * sizeof(old_infos[0]));
371 /* compose the new in array and set the new register data directly */
372 for (i = 0; i < new_size; ++i) {
374 new_in[i] = get_irn_n(perm, idx);
375 info->in_reqs[i] = old_in_reqs[idx];
376 info->out_infos[i] = old_infos[idx];
379 set_irn_in(perm, new_size, new_in);
382 ir_node *be_new_MemPerm(ir_node *block, int n, ir_node *in[])
384 ir_graph *irg = get_Block_irg(block);
385 const arch_env_t *arch_env = be_get_irg_arch_env(irg);
386 ir_node *frame = get_irg_frame(irg);
387 const arch_register_t *sp = arch_env->sp;
389 be_memperm_attr_t *attr;
392 real_in = ALLOCAN(ir_node*, n + 1);
394 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
396 irn = new_ir_node(NULL, irg, block, op_be_MemPerm, mode_T, n+1, real_in);
398 init_node_attr(irn, n + 1, n);
399 be_node_set_reg_class_in(irn, 0, sp->reg_class);
401 attr = (be_memperm_attr_t*)get_irn_generic_attr(irn);
402 attr->in_entities = OALLOCNZ(get_irg_obstack(irg), ir_entity*, n);
403 attr->out_entities = OALLOCNZ(get_irg_obstack(irg), ir_entity*, n);
408 ir_node *be_new_Copy(ir_node *bl, ir_node *op)
412 be_node_attr_t *attr;
413 ir_graph *irg = get_Block_irg(bl);
414 const arch_register_req_t *in_req = arch_get_irn_register_req(op);
415 const arch_register_class_t *cls = in_req->cls;
418 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
419 init_node_attr(res, 1, 1);
420 attr = (be_node_attr_t*) get_irn_generic_attr(res);
421 attr->exc.pin_state = op_pin_state_floats;
422 be_node_set_reg_class_in(res, 0, cls);
423 be_node_set_reg_class_out(res, 0, cls);
425 arch_register_req_t *const req = allocate_reg_req(irg);
427 req->type = arch_register_req_type_should_be_same
428 | (in_req->type & arch_register_req_type_aligned);
429 req->other_same = 1U << 0;
430 req->width = in_req->width;
431 be_set_constr_out(res, 0, req);
436 ir_node *be_get_Copy_op(const ir_node *cpy)
438 return get_irn_n(cpy, n_be_Copy_op);
441 ir_node *be_new_Keep(ir_node *block, int n, ir_node *in[])
445 ir_graph *irg = get_Block_irg(block);
446 be_node_attr_t *attr;
448 res = new_ir_node(NULL, irg, block, op_be_Keep, mode_ANY, -1, NULL);
449 init_node_attr(res, -1, 1);
450 attr = (be_node_attr_t*) get_irn_generic_attr(res);
451 attr->exc.pin_state = op_pin_state_pinned;
453 for (i = 0; i < n; ++i) {
454 ir_node *pred = in[i];
455 add_irn_n(res, pred);
456 const arch_register_req_t *req = arch_get_irn_register_req(pred);
457 req = req->cls != NULL ? req->cls->class_req : arch_no_register_req;
458 add_register_req_in(res, req);
465 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
467 assert(be_is_Keep(keep));
468 add_irn_n(keep, node);
469 add_register_req_in(keep, cls->class_req);
472 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem,
473 const arch_register_req_t *sp_req, ir_node *sp,
474 const arch_register_req_t *ptr_req, ir_node *ptr,
475 int n_outs, int n, ir_node *in[], ir_type *call_tp)
478 int real_n = n_be_Call_first_arg + n;
482 NEW_ARR_A(ir_node *, real_in, real_n);
483 real_in[n_be_Call_mem] = mem;
484 real_in[n_be_Call_sp] = sp;
485 real_in[n_be_Call_ptr] = ptr;
486 memcpy(&real_in[n_be_Call_first_arg], in, n * sizeof(in[0]));
488 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
489 init_node_attr(irn, real_n, n_outs);
490 a = (be_call_attr_t*)get_irn_generic_attr(irn);
492 a->call_tp = call_tp;
494 a->base.exc.pin_state = op_pin_state_pinned;
495 be_set_constr_in(irn, n_be_Call_sp, sp_req);
496 be_set_constr_in(irn, n_be_Call_ptr, ptr_req);
500 ir_entity *be_Call_get_entity(const ir_node *call)
502 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(call);
503 assert(be_is_Call(call));
507 void be_Call_set_entity(ir_node *call, ir_entity *ent)
509 be_call_attr_t *a = (be_call_attr_t*)get_irn_generic_attr(call);
510 assert(be_is_Call(call));
514 ir_type *be_Call_get_type(ir_node *call)
516 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(call);
517 assert(be_is_Call(call));
521 void be_Call_set_type(ir_node *call, ir_type *call_tp)
523 be_call_attr_t *a = (be_call_attr_t*)get_irn_generic_attr(call);
524 assert(be_is_Call(call));
525 a->call_tp = call_tp;
528 void be_Call_set_pop(ir_node *call, unsigned pop)
530 be_call_attr_t *a = (be_call_attr_t*)get_irn_generic_attr(call);
534 unsigned be_Call_get_pop(const ir_node *call)
536 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(call);
540 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
541 unsigned pop, int n, ir_node *in[])
546 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, n, in);
547 init_node_attr(res, n, 1);
548 be_set_constr_out(res, 0, arch_no_register_req);
550 a = (be_return_attr_t*)get_irn_generic_attr(res);
551 a->num_ret_vals = n_res;
554 a->base.exc.pin_state = op_pin_state_pinned;
559 int be_Return_get_n_rets(const ir_node *ret)
561 const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret);
562 return a->num_ret_vals;
565 unsigned be_Return_get_pop(const ir_node *ret)
567 const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret);
571 int be_Return_get_emit_pop(const ir_node *ret)
573 const be_return_attr_t *a = (const be_return_attr_t*)get_irn_generic_attr_const(ret);
577 void be_Return_set_emit_pop(ir_node *ret, int emit_pop)
579 be_return_attr_t *a = (be_return_attr_t*)get_irn_generic_attr(ret);
580 a->emit_pop = emit_pop;
583 ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *bl,
584 ir_node *old_sp, int offset, int align)
589 ir_graph *irg = get_Block_irg(bl);
592 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode,
594 init_node_attr(irn, 1, 1);
595 a = (be_incsp_attr_t*)get_irn_generic_attr(irn);
598 a->base.exc.pin_state = op_pin_state_pinned;
600 /* Set output constraint to stack register. */
601 be_node_set_reg_class_in(irn, 0, sp->reg_class);
602 be_set_constr_single_reg_out(irn, 0, sp, arch_register_req_type_produces_sp);
607 ir_node *be_new_AddSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp,
611 ir_node *in[n_be_AddSP_last];
613 be_node_attr_t *attr;
615 in[n_be_AddSP_old_sp] = old_sp;
616 in[n_be_AddSP_size] = sz;
618 irg = get_Block_irg(bl);
619 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, n_be_AddSP_last, in);
620 init_node_attr(irn, n_be_AddSP_last, pn_be_AddSP_last);
621 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
622 attr->exc.pin_state = op_pin_state_pinned;
624 /* Set output constraint to stack register. */
625 be_set_constr_single_reg_in(irn, n_be_AddSP_old_sp, sp,
626 arch_register_req_type_none);
627 be_node_set_reg_class_in(irn, n_be_AddSP_size, sp->reg_class);
628 be_set_constr_single_reg_out(irn, pn_be_AddSP_sp, sp,
629 arch_register_req_type_produces_sp);
634 ir_node *be_new_SubSP(const arch_register_t *sp, ir_node *bl, ir_node *old_sp, ir_node *sz)
637 ir_node *in[n_be_SubSP_last];
639 be_node_attr_t *attr;
641 in[n_be_SubSP_old_sp] = old_sp;
642 in[n_be_SubSP_size] = sz;
644 irg = get_Block_irg(bl);
645 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, n_be_SubSP_last, in);
646 init_node_attr(irn, n_be_SubSP_last, pn_be_SubSP_last);
647 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
648 attr->exc.pin_state = op_pin_state_pinned;
650 /* Set output constraint to stack register. */
651 be_set_constr_single_reg_in(irn, n_be_SubSP_old_sp, sp,
652 arch_register_req_type_none);
653 be_node_set_reg_class_in(irn, n_be_SubSP_size, sp->reg_class);
654 be_set_constr_single_reg_out(irn, pn_be_SubSP_sp, sp, arch_register_req_type_produces_sp);
659 ir_node *be_new_Start(dbg_info *dbgi, ir_node *bl, int n_outs)
662 ir_graph *irg = get_Block_irg(bl);
663 be_node_attr_t *attr;
665 res = new_ir_node(dbgi, irg, bl, op_be_Start, mode_T, 0, NULL);
666 init_node_attr(res, 0, n_outs);
667 attr = (be_node_attr_t*) get_irn_generic_attr(res);
668 attr->exc.pin_state = op_pin_state_pinned;
673 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_node *bl, ir_node *frame, ir_entity *ent)
678 ir_graph *irg = get_Block_irg(bl);
681 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
682 init_node_attr(irn, 1, 1);
683 a = (be_frame_attr_t*)get_irn_generic_attr(irn);
686 a->base.exc.pin_state = op_pin_state_floats;
687 be_node_set_reg_class_in(irn, 0, cls_frame);
688 be_node_set_reg_class_out(irn, 0, cls_frame);
690 return optimize_node(irn);
693 ir_node *be_get_FrameAddr_frame(const ir_node *node)
695 assert(be_is_FrameAddr(node));
696 return get_irn_n(node, n_be_FrameAddr_ptr);
699 ir_entity *be_get_FrameAddr_entity(const ir_node *node)
701 const be_frame_attr_t *attr = (const be_frame_attr_t*)get_irn_generic_attr_const(node);
705 ir_node *be_new_CopyKeep(ir_node *bl, ir_node *src, int n, ir_node *in_keep[])
708 ir_node **in = ALLOCAN(ir_node*, n + 1);
709 ir_graph *irg = get_Block_irg(bl);
710 const arch_register_req_t *req = arch_get_irn_register_req(src);
711 const arch_register_class_t *cls = req->cls;
712 ir_mode *mode = get_irn_mode(src);
713 be_node_attr_t *attr;
716 memcpy(&in[1], in_keep, n * sizeof(in[0]));
717 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
718 init_node_attr(irn, n + 1, 1);
719 attr = (be_node_attr_t*) get_irn_generic_attr(irn);
720 attr->exc.pin_state = op_pin_state_floats;
721 be_node_set_reg_class_in(irn, 0, cls);
722 be_node_set_reg_class_out(irn, 0, cls);
723 for (int i = 0; i < n; ++i) {
724 ir_node *pred = in_keep[i];
725 const arch_register_req_t *req = arch_get_irn_register_req(pred);
726 req = req->cls != NULL ? req->cls->class_req : arch_no_register_req;
727 be_set_constr_in(irn, i+1, req);
733 ir_node *be_new_CopyKeep_single(ir_node *bl, ir_node *src, ir_node *keep)
735 return be_new_CopyKeep(bl, src, 1, &keep);
738 ir_node *be_get_CopyKeep_op(const ir_node *cpy)
740 return get_irn_n(cpy, n_be_CopyKeep_op);
743 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op)
745 set_irn_n(cpy, n_be_CopyKeep_op, op);
748 static bool be_has_frame_entity(const ir_node *irn)
750 switch (get_irn_opcode(irn)) {
760 ir_entity *be_get_frame_entity(const ir_node *irn)
762 if (be_has_frame_entity(irn)) {
763 const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn);
769 int be_get_frame_offset(const ir_node *irn)
771 assert(is_be_node(irn));
772 if (be_has_frame_entity(irn)) {
773 const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn);
779 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
781 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
783 assert(be_is_MemPerm(irn));
784 assert(n < be_get_MemPerm_entity_arity(irn));
786 attr->in_entities[n] = ent;
789 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
791 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
793 assert(be_is_MemPerm(irn));
794 assert(n < be_get_MemPerm_entity_arity(irn));
796 return attr->in_entities[n];
799 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
801 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
803 assert(be_is_MemPerm(irn));
804 assert(n < be_get_MemPerm_entity_arity(irn));
806 attr->out_entities[n] = ent;
809 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
811 const be_memperm_attr_t *attr = (const be_memperm_attr_t*)get_irn_generic_attr_const(irn);
813 assert(be_is_MemPerm(irn));
814 assert(n < be_get_MemPerm_entity_arity(irn));
816 return attr->out_entities[n];
819 int be_get_MemPerm_entity_arity(const ir_node *irn)
821 return get_irn_arity(irn) - 1;
824 const arch_register_req_t *be_create_reg_req(struct obstack *obst,
825 const arch_register_t *reg, arch_register_req_type_t additional_types)
827 arch_register_req_t *req = OALLOC(obst, arch_register_req_t);
828 const arch_register_class_t *cls = reg->reg_class;
829 unsigned *limited_bitset;
831 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
832 rbitset_set(limited_bitset, reg->index);
834 req->type = arch_register_req_type_limited | additional_types;
836 req->limited = limited_bitset;
841 void be_set_constr_single_reg_in(ir_node *node, int pos,
842 const arch_register_t *reg, arch_register_req_type_t additional_types)
844 const arch_register_req_t *req;
846 if (additional_types == 0) {
847 req = reg->single_req;
849 ir_graph *irg = get_irn_irg(node);
850 struct obstack *obst = be_get_be_obst(irg);
851 req = be_create_reg_req(obst, reg, additional_types);
853 be_set_constr_in(node, pos, req);
856 void be_set_constr_single_reg_out(ir_node *node, int pos,
857 const arch_register_t *reg, arch_register_req_type_t additional_types)
859 ir_graph *irg = get_irn_irg(node);
860 be_irg_t *birg = be_birg_from_irg(irg);
861 const arch_register_req_t *req;
863 /* if we have an ignore register, add ignore flag and just assign it */
864 if (!rbitset_is_set(birg->allocatable_regs, reg->global_index)) {
865 additional_types |= arch_register_req_type_ignore;
868 if (additional_types == 0) {
869 req = reg->single_req;
871 struct obstack *obst = be_get_be_obst(irg);
872 req = be_create_reg_req(obst, reg, additional_types);
875 arch_set_irn_register_out(node, pos, reg);
876 be_set_constr_out(node, pos, req);
879 void be_node_set_reg_class_in(ir_node *irn, int pos,
880 const arch_register_class_t *cls)
882 be_set_constr_in(irn, pos, cls->class_req);
885 void be_node_set_reg_class_out(ir_node *irn, int pos,
886 const arch_register_class_t *cls)
888 be_set_constr_out(irn, pos, cls->class_req);
891 ir_node *be_get_IncSP_pred(ir_node *irn)
893 assert(be_is_IncSP(irn));
894 return get_irn_n(irn, 0);
897 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred)
899 assert(be_is_IncSP(incsp));
900 set_irn_n(incsp, 0, pred);
903 void be_set_IncSP_offset(ir_node *irn, int offset)
905 be_incsp_attr_t *a = (be_incsp_attr_t*)get_irn_generic_attr(irn);
906 assert(be_is_IncSP(irn));
910 int be_get_IncSP_offset(const ir_node *irn)
912 const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
913 assert(be_is_IncSP(irn));
917 int be_get_IncSP_align(const ir_node *irn)
919 const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
920 assert(be_is_IncSP(irn));
924 static ir_entity *be_node_get_frame_entity(const ir_node *irn)
926 return be_get_frame_entity(irn);
929 void be_node_set_frame_entity(ir_node *irn, ir_entity *ent)
933 assert(be_has_frame_entity(irn));
935 a = (be_frame_attr_t*)get_irn_generic_attr(irn);
939 static void be_node_set_frame_offset(ir_node *irn, int offset)
943 if (!be_has_frame_entity(irn))
946 a = (be_frame_attr_t*)get_irn_generic_attr(irn);
950 static int be_node_get_sp_bias(const ir_node *irn)
952 if (be_is_IncSP(irn))
953 return be_get_IncSP_offset(irn);
955 return -(int)be_Call_get_pop(irn);
963 static const arch_irn_ops_t be_node_irn_ops = {
964 be_node_get_frame_entity,
965 be_node_set_frame_offset,
967 NULL, /* get_op_estimated_cost */
968 NULL, /* possible_memory_operand */
969 NULL, /* perform_memory_operand */
972 static int get_start_reg_index(ir_graph *irg, const arch_register_t *reg)
974 ir_node *start = get_irg_start(irg);
976 /* do a naive linear search... */
977 be_foreach_out(start, i) {
978 arch_register_req_t const *const out_req = arch_get_irn_register_req_out(start, i);
979 if (!arch_register_req_is(out_req, limited))
981 if (out_req->cls != reg->reg_class)
983 if (!rbitset_is_set(out_req->limited, reg->index))
987 panic("Tried querying undefined register '%s' at Start", reg->name);
990 ir_node *be_get_initial_reg_value(ir_graph *irg, const arch_register_t *reg)
992 int i = get_start_reg_index(irg, reg);
993 ir_node *start = get_irg_start(irg);
994 ir_mode *mode = arch_register_class_mode(reg->reg_class);
996 foreach_out_edge(start, edge) {
997 ir_node *proj = get_edge_src_irn(edge);
998 if (!is_Proj(proj)) // maybe End/Anchor
1000 if (get_Proj_proj(proj) == i) {
1004 return new_r_Proj(start, mode, i);
1007 static ir_entity* dummy_get_frame_entity(const ir_node *node)
1013 static void dummy_set_frame_offset(ir_node *node, int bias)
1017 panic("should not be called");
1020 static int dummy_get_sp_bias(const ir_node *node)
1026 /* for "middleend" nodes */
1027 static const arch_irn_ops_t dummy_be_irn_ops = {
1028 dummy_get_frame_entity,
1029 dummy_set_frame_offset,
1031 NULL, /* get_op_estimated_cost */
1032 NULL, /* possible_memory_operand */
1033 NULL, /* perform_memory_operand */
1038 ir_node *be_new_Phi(ir_node *block, int n_ins, ir_node **ins, ir_mode *mode,
1039 const arch_register_req_t *req)
1041 ir_graph *irg = get_irn_irg(block);
1042 struct obstack *obst = be_get_be_obst(irg);
1043 backend_info_t *info;
1046 ir_node *phi = new_ir_node(NULL, irg, block, op_Phi, mode, n_ins, ins);
1047 phi->attr.phi.u.backedge = new_backedge_arr(get_irg_obstack(irg), n_ins);
1048 info = be_get_info(phi);
1049 info->out_infos = NEW_ARR_DZ(reg_out_info_t, obst, 1);
1050 info->in_reqs = OALLOCN(obst, const arch_register_req_t*, n_ins);
1052 info->out_infos[0].req = req;
1053 for (i = 0; i < n_ins; ++i) {
1054 info->in_reqs[i] = req;
1056 irn_verify_irg(phi, irg);
1057 phi = optimize_node(phi);
1061 void be_set_phi_reg_req(ir_node *node, const arch_register_req_t *req)
1063 int arity = get_irn_arity(node);
1066 backend_info_t *info = be_get_info(node);
1067 info->out_infos[0].req = req;
1068 for (i = 0; i < arity; ++i) {
1069 info->in_reqs[i] = req;
1072 assert(mode_is_datab(get_irn_mode(node)));
1075 void be_dump_phi_reg_reqs(FILE *F, const ir_node *node, dump_reason_t reason)
1077 ir_graph *irg = get_irn_irg(node);
1078 if (!irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_BACKEND))
1082 case dump_node_opcode_txt:
1083 fputs(get_op_name(get_irn_op(node)), F);
1085 case dump_node_mode_txt:
1086 fprintf(F, "%s", get_mode_name(get_irn_mode(node)));
1088 case dump_node_nodeattr_txt:
1090 case dump_node_info_txt:
1091 arch_dump_reqs_and_registers(F, node);
1099 static const arch_irn_ops_t phi_irn_ops = {
1100 dummy_get_frame_entity,
1101 dummy_set_frame_offset,
1103 NULL, /* get_op_estimated_cost */
1104 NULL, /* possible_memory_operand */
1105 NULL, /* perform_memory_operand */
1111 * ir_op-Operation: dump a be node to file
1113 static void dump_node(FILE *f, const ir_node *irn, dump_reason_t reason)
1115 assert(is_be_node(irn));
1118 case dump_node_opcode_txt:
1119 fputs(get_op_name(get_irn_op(irn)), f);
1121 case dump_node_mode_txt:
1122 if (be_is_Copy(irn) || be_is_CopyKeep(irn)) {
1123 fprintf(f, "%s", get_mode_name(get_irn_mode(irn)));
1126 case dump_node_nodeattr_txt:
1127 if (be_is_Call(irn)) {
1128 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(irn);
1130 fprintf(f, " [%s] ", get_entity_name(a->ent));
1132 if (be_is_IncSP(irn)) {
1133 const be_incsp_attr_t *attr = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
1134 fprintf(f, " [%d] ", attr->offset);
1137 case dump_node_info_txt:
1138 arch_dump_reqs_and_registers(f, irn);
1140 if (be_has_frame_entity(irn)) {
1141 const be_frame_attr_t *a = (const be_frame_attr_t*)get_irn_generic_attr_const(irn);
1143 unsigned size = get_type_size_bytes(get_entity_type(a->ent));
1144 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bytes\n",
1145 a->ent, a->offset, a->offset, size, size);
1150 switch (get_irn_opcode(irn)) {
1152 const be_incsp_attr_t *a = (const be_incsp_attr_t*)get_irn_generic_attr_const(irn);
1153 fprintf(f, "align: %d\n", a->align);
1154 fprintf(f, "offset: %d\n", a->offset);
1158 const be_call_attr_t *a = (const be_call_attr_t*)get_irn_generic_attr_const(irn);
1161 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1166 for (i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1167 ir_entity *in, *out;
1168 in = be_get_MemPerm_in_entity(irn, i);
1169 out = be_get_MemPerm_out_entity(irn, i);
1171 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1174 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1188 * Copies the backend specific attributes from old node to new node.
1190 static void copy_attr(ir_graph *irg, const ir_node *old_node, ir_node *new_node)
1192 const void *old_attr = get_irn_generic_attr_const(old_node);
1193 void *new_attr = get_irn_generic_attr(new_node);
1194 struct obstack *obst = be_get_be_obst(irg);
1195 backend_info_t *old_info = be_get_info(old_node);
1196 backend_info_t *new_info = be_get_info(new_node);
1198 assert(is_be_node(old_node));
1199 assert(is_be_node(new_node));
1201 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1203 new_info->flags = old_info->flags;
1204 new_info->out_infos = old_info->out_infos ? DUP_ARR_D(reg_out_info_t, obst, old_info->out_infos) : NULL;
1207 if (old_info->in_reqs != NULL) {
1208 unsigned n_ins = get_irn_arity(old_node);
1209 /* need dynamic in infos? */
1210 if (get_irn_op(old_node)->opar == oparity_dynamic) {
1211 new_info->in_reqs = NEW_ARR_F(const arch_register_req_t*, n_ins);
1213 new_info->in_reqs = OALLOCN(obst,const arch_register_req_t*, n_ins);
1215 memcpy(new_info->in_reqs, old_info->in_reqs,
1216 n_ins * sizeof(new_info->in_reqs[0]));
1218 new_info->in_reqs = NULL;
1222 int is_be_node(const ir_node *irn)
1224 return get_op_ops(get_irn_op(irn))->be_ops == &be_node_irn_ops;
1227 static ir_op *new_be_op(unsigned code, const char *name, op_pin_state p,
1228 irop_flags flags, op_arity opar, size_t attr_size)
1230 ir_op *res = new_ir_op(code, name, p, flags, opar, 0, attr_size);
1231 res->ops.dump_node = dump_node;
1232 res->ops.copy_attr = copy_attr;
1233 res->ops.be_ops = &be_node_irn_ops;
1237 void be_init_op(void)
1241 assert(op_be_Spill == NULL);
1243 /* Acquire all needed opcodes. */
1244 op_be_Spill = new_be_op(beo_Spill, "be_Spill", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_frame_attr_t));
1245 op_be_Reload = new_be_op(beo_Reload, "be_Reload", op_pin_state_exc_pinned, irop_flag_none, oparity_zero, sizeof(be_frame_attr_t));
1246 op_be_Perm = new_be_op(beo_Perm, "be_Perm", op_pin_state_exc_pinned, irop_flag_none, oparity_variable, sizeof(be_node_attr_t));
1247 op_be_MemPerm = new_be_op(beo_MemPerm, "be_MemPerm", op_pin_state_exc_pinned, irop_flag_none, oparity_variable, sizeof(be_memperm_attr_t));
1248 op_be_Copy = new_be_op(beo_Copy, "be_Copy", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_node_attr_t));
1249 op_be_Keep = new_be_op(beo_Keep, "be_Keep", op_pin_state_exc_pinned, irop_flag_keep, oparity_dynamic, sizeof(be_node_attr_t));
1250 op_be_CopyKeep = new_be_op(beo_CopyKeep, "be_CopyKeep", op_pin_state_exc_pinned, irop_flag_keep, oparity_variable, sizeof(be_node_attr_t));
1251 op_be_Call = new_be_op(beo_Call, "be_Call", op_pin_state_exc_pinned, irop_flag_fragile|irop_flag_uses_memory, oparity_variable, sizeof(be_call_attr_t));
1252 ir_op_set_memory_index(op_be_Call, n_be_Call_mem);
1253 ir_op_set_fragile_indices(op_be_Call, pn_be_Call_X_regular, pn_be_Call_X_except);
1254 op_be_Return = new_be_op(beo_Return, "be_Return", op_pin_state_exc_pinned, irop_flag_cfopcode, oparity_variable, sizeof(be_return_attr_t));
1255 op_be_AddSP = new_be_op(beo_AddSP, "be_AddSP", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_node_attr_t));
1256 op_be_SubSP = new_be_op(beo_SubSP, "be_SubSP", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_node_attr_t));
1257 op_be_IncSP = new_be_op(beo_IncSP, "be_IncSP", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_incsp_attr_t));
1258 op_be_Start = new_be_op(beo_Start, "be_Start", op_pin_state_exc_pinned, irop_flag_none, oparity_zero, sizeof(be_node_attr_t));
1259 op_be_FrameAddr = new_be_op(beo_FrameAddr, "be_FrameAddr", op_pin_state_exc_pinned, irop_flag_none, oparity_unary, sizeof(be_frame_attr_t));
1261 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
1262 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
1263 op_be_Perm->ops.node_cmp_attr = be_nodes_equal;
1264 op_be_MemPerm->ops.node_cmp_attr = be_nodes_equal;
1265 op_be_Copy->ops.node_cmp_attr = be_nodes_equal;
1266 op_be_Keep->ops.node_cmp_attr = be_nodes_equal;
1267 op_be_CopyKeep->ops.node_cmp_attr = be_nodes_equal;
1268 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
1269 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
1270 op_be_AddSP->ops.node_cmp_attr = be_nodes_equal;
1271 op_be_SubSP->ops.node_cmp_attr = be_nodes_equal;
1272 op_be_IncSP->ops.node_cmp_attr = IncSP_cmp_attr;
1273 op_be_Start->ops.node_cmp_attr = be_nodes_equal;
1274 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
1276 /* attach out dummy_ops to middle end nodes */
1277 for (opc = iro_First; opc <= iro_Last; ++opc) {
1278 ir_op *op = ir_get_opcode(opc);
1279 assert(op->ops.be_ops == NULL);
1280 op->ops.be_ops = &dummy_be_irn_ops;
1283 op_Phi->ops.be_ops = &phi_irn_ops;
1286 void be_finish_op(void)
1288 free_ir_op(op_be_Spill); op_be_Spill = NULL;
1289 free_ir_op(op_be_Reload); op_be_Reload = NULL;
1290 free_ir_op(op_be_Perm); op_be_Perm = NULL;
1291 free_ir_op(op_be_MemPerm); op_be_MemPerm = NULL;
1292 free_ir_op(op_be_Copy); op_be_Copy = NULL;
1293 free_ir_op(op_be_Keep); op_be_Keep = NULL;
1294 free_ir_op(op_be_CopyKeep); op_be_CopyKeep = NULL;
1295 free_ir_op(op_be_Call); op_be_Call = NULL;
1296 free_ir_op(op_be_Return); op_be_Return = NULL;
1297 free_ir_op(op_be_IncSP); op_be_IncSP = NULL;
1298 free_ir_op(op_be_AddSP); op_be_AddSP = NULL;
1299 free_ir_op(op_be_SubSP); op_be_SubSP = NULL;
1300 free_ir_op(op_be_Start); op_be_Start = NULL;
1301 free_ir_op(op_be_FrameAddr); op_be_FrameAddr = NULL;