2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Backend node support for generic backend nodes.
23 * @author Sebastian Hack
27 * Backend node support for generic backend nodes.
28 * This file provides Perm, Copy, Spill and Reload nodes.
43 #include "bitfiddle.h"
44 #include "raw_bitset.h"
56 #include "besched_t.h"
61 #define OUT_POS(x) (-((x) + 1))
63 /* Sometimes we want to put const nodes into get_irn_generic_attr ... */
64 #define get_irn_attr(irn) get_irn_generic_attr((ir_node *) (irn))
66 static unsigned be_node_tag = FOURCC('B', 'E', 'N', 'O');
69 arch_register_req_t req;
70 arch_irn_flags_t flags;
74 const arch_register_t *reg;
79 /** The generic be nodes attribute type. */
81 be_reg_data_t *reg_data;
84 /** The be_Return nodes attribute type. */
86 be_node_attr_t node_attr;
87 int num_ret_vals; /**< number of return values */
90 /** The be_Stack attribute type. */
92 be_node_attr_t node_attr;
93 int offset; /**< The offset by which the stack shall be expanded/shrinked. */
96 /** The be_Frame attribute type. */
98 be_node_attr_t node_attr;
103 /** The be_Call attribute type. */
105 be_node_attr_t node_attr;
106 ir_entity *ent; /**< The called entity if this is a static call. */
107 ir_type *call_tp; /**< The call type, copied from the original Call node. */
111 be_node_attr_t node_attr;
112 ir_entity **in_entities;
113 ir_entity **out_entities;
119 ir_op *op_be_MemPerm;
122 ir_op *op_be_CopyKeep;
129 ir_op *op_be_RegParams;
130 ir_op *op_be_FrameAddr;
131 ir_op *op_be_Barrier;
133 static int beo_base = -1;
135 static const ir_op_ops be_node_op_ops;
137 #define N irop_flag_none
138 #define L irop_flag_labeled
139 #define C irop_flag_commutative
140 #define X irop_flag_cfopcode
141 #define I irop_flag_ip_cfopcode
142 #define F irop_flag_fragile
143 #define Y irop_flag_forking
144 #define H irop_flag_highlevel
145 #define c irop_flag_constlike
146 #define K irop_flag_keep
147 #define M irop_flag_machine
151 * Compare two node attributes.
153 * @return zero if both attributes are identically
155 static int _node_cmp_attr(be_node_attr_t *a, be_node_attr_t *b) {
158 if(ARR_LEN(a->reg_data) != ARR_LEN(b->reg_data))
161 len = ARR_LEN(a->reg_data);
162 for (i = 0; i < len; ++i) {
163 if (a->reg_data[i].reg != b->reg_data[i].reg ||
164 memcmp(&a->reg_data[i].in_req, &b->reg_data[i].in_req, sizeof(b->reg_data[i].in_req)) ||
165 memcmp(&a->reg_data[i].req, &b->reg_data[i].req, sizeof(a->reg_data[i].req)))
172 static int node_cmp_attr(ir_node *a, ir_node *b) {
173 be_node_attr_t *a_attr = get_irn_attr(a);
174 be_node_attr_t *b_attr = get_irn_attr(b);
176 return _node_cmp_attr(a_attr, b_attr);
180 * Compare the attributes of two FrameAddr nodes.
182 * @return zero if both attributes are identically
184 static int FrameAddr_cmp_attr(ir_node *a, ir_node *b) {
185 be_frame_attr_t *a_attr = get_irn_attr(a);
186 be_frame_attr_t *b_attr = get_irn_attr(b);
188 if (a_attr->ent != b_attr->ent || a_attr->offset != b_attr->offset)
191 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
194 static int Return_cmp_attr(ir_node *a, ir_node *b) {
195 be_return_attr_t *a_attr = get_irn_attr(a);
196 be_return_attr_t *b_attr = get_irn_attr(b);
198 if (a_attr->num_ret_vals != b_attr->num_ret_vals)
201 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
204 static int Stack_cmp_attr(ir_node *a, ir_node *b) {
205 be_stack_attr_t *a_attr = get_irn_attr(a);
206 be_stack_attr_t *b_attr = get_irn_attr(b);
208 if (a_attr->offset != b_attr->offset)
211 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
214 static int Call_cmp_attr(ir_node *a, ir_node *b) {
215 be_call_attr_t *a_attr = get_irn_attr(a);
216 be_call_attr_t *b_attr = get_irn_attr(b);
218 if (a_attr->ent != b_attr->ent ||
219 a_attr->call_tp != b_attr->call_tp)
222 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
225 static INLINE be_req_t *get_be_req(const ir_node *node, int pos)
228 be_node_attr_t *attr;
231 assert(is_be_node(node));
232 attr = get_irn_attr(node);
238 assert(idx < get_irn_arity(node));
240 assert(idx < ARR_LEN(attr->reg_data));
241 rd = &attr->reg_data[idx];
243 return pos < 0 ? &rd->req : &rd->in_req;
246 static INLINE arch_register_req_t *get_req(const ir_node *node, int pos)
248 be_req_t *bereq = get_be_req(node, pos);
252 void be_node_init(void) {
253 static int inited = 0;
260 /* Acquire all needed opcodes. */
261 beo_base = get_next_ir_opcodes(beo_Last);
263 op_be_Spill = new_ir_op(beo_base + beo_Spill, "be_Spill", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
264 op_be_Reload = new_ir_op(beo_base + beo_Reload, "be_Reload", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
265 op_be_Perm = new_ir_op(beo_base + beo_Perm, "be_Perm", op_pin_state_pinned, N, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
266 op_be_MemPerm = new_ir_op(beo_base + beo_MemPerm, "be_MemPerm", op_pin_state_pinned, N, oparity_variable, 0, sizeof(be_memperm_attr_t), &be_node_op_ops);
267 op_be_Copy = new_ir_op(beo_base + beo_Copy, "be_Copy", op_pin_state_floats, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
268 op_be_Keep = new_ir_op(beo_base + beo_Keep, "be_Keep", op_pin_state_pinned, K, oparity_dynamic, 0, sizeof(be_node_attr_t), &be_node_op_ops);
269 op_be_CopyKeep = new_ir_op(beo_base + beo_CopyKeep, "be_CopyKeep", op_pin_state_pinned, K, oparity_variable, 0, sizeof(be_node_attr_t), &be_node_op_ops);
270 op_be_Call = new_ir_op(beo_base + beo_Call, "be_Call", op_pin_state_pinned, F, oparity_variable, 0, sizeof(be_call_attr_t), &be_node_op_ops);
271 op_be_Return = new_ir_op(beo_base + beo_Return, "be_Return", op_pin_state_pinned, X, oparity_dynamic, 0, sizeof(be_return_attr_t), &be_node_op_ops);
272 op_be_AddSP = new_ir_op(beo_base + beo_AddSP, "be_AddSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
273 op_be_SubSP = new_ir_op(beo_base + beo_SubSP, "be_SubSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_node_attr_t), &be_node_op_ops);
274 op_be_IncSP = new_ir_op(beo_base + beo_IncSP, "be_IncSP", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_stack_attr_t), &be_node_op_ops);
275 op_be_SetSP = new_ir_op(beo_base + beo_SetSP, "be_SetSP", op_pin_state_pinned, N, oparity_binary, 0, sizeof(be_stack_attr_t), &be_node_op_ops);
276 op_be_RegParams = new_ir_op(beo_base + beo_RegParams, "be_RegParams", op_pin_state_pinned, N, oparity_zero, 0, sizeof(be_node_attr_t), &be_node_op_ops);
277 op_be_FrameAddr = new_ir_op(beo_base + beo_FrameAddr, "be_FrameAddr", op_pin_state_floats, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
278 op_be_Barrier = new_ir_op(beo_base + beo_Barrier, "be_Barrier", op_pin_state_pinned, N, oparity_dynamic, 0, sizeof(be_node_attr_t), &be_node_op_ops);
280 set_op_tag(op_be_Spill, &be_node_tag);
281 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
282 set_op_tag(op_be_Reload, &be_node_tag);
283 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
284 set_op_tag(op_be_Perm, &be_node_tag);
285 op_be_Perm->ops.node_cmp_attr = node_cmp_attr;
286 set_op_tag(op_be_MemPerm, &be_node_tag);
287 op_be_MemPerm->ops.node_cmp_attr = node_cmp_attr;
288 set_op_tag(op_be_Copy, &be_node_tag);
289 op_be_Copy->ops.node_cmp_attr = node_cmp_attr;
290 set_op_tag(op_be_Keep, &be_node_tag);
291 op_be_Keep->ops.node_cmp_attr = node_cmp_attr;
292 set_op_tag(op_be_CopyKeep, &be_node_tag);
293 op_be_CopyKeep->ops.node_cmp_attr = node_cmp_attr;
294 set_op_tag(op_be_Call, &be_node_tag);
295 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
296 set_op_tag(op_be_Return, &be_node_tag);
297 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
298 set_op_tag(op_be_AddSP, &be_node_tag);
299 op_be_AddSP->ops.node_cmp_attr = node_cmp_attr;
300 set_op_tag(op_be_SubSP, &be_node_tag);
301 op_be_SubSP->ops.node_cmp_attr = node_cmp_attr;
302 set_op_tag(op_be_SetSP, &be_node_tag);
303 op_be_SetSP->ops.node_cmp_attr = Stack_cmp_attr;
304 set_op_tag(op_be_IncSP, &be_node_tag);
305 op_be_IncSP->ops.node_cmp_attr = Stack_cmp_attr;
306 set_op_tag(op_be_RegParams, &be_node_tag);
307 op_be_RegParams->ops.node_cmp_attr = node_cmp_attr;
308 set_op_tag(op_be_FrameAddr, &be_node_tag);
309 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
310 set_op_tag(op_be_Barrier, &be_node_tag);
311 op_be_Barrier->ops.node_cmp_attr = node_cmp_attr;
315 * Initializes the generic attribute of all be nodes and return ir.
317 static void *init_node_attr(ir_node *node, int max_reg_data)
319 ir_graph *irg = get_irn_irg(node);
320 struct obstack *obst = get_irg_obstack(irg);
321 be_node_attr_t *a = get_irn_attr(node);
323 memset(a, 0, sizeof(get_op_attr_size(get_irn_op(node))));
325 if(max_reg_data >= 0) {
326 a->reg_data = NEW_ARR_D(be_reg_data_t, obst, max_reg_data);
327 memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
329 a->reg_data = NEW_ARR_F(be_reg_data_t, 0);
335 static void add_register_req(ir_node *node)
337 be_node_attr_t *a = get_irn_attr(node);
338 be_reg_data_t regreq;
339 memset(®req, 0, sizeof(regreq));
340 ARR_APP1(be_reg_data_t, a->reg_data, regreq);
343 int is_be_node(const ir_node *irn)
345 return get_op_tag(get_irn_op(irn)) == &be_node_tag;
348 be_opcode_t be_get_irn_opcode(const ir_node *irn)
350 return is_be_node(irn) ? (be_opcode_t) get_irn_opcode(irn) - beo_base : beo_NoBeOp;
354 * Skip Proj nodes and return their Proj numbers.
356 * If *node is a Proj or Proj(Proj) node, skip it.
358 * @param node points to the node to be skipped
360 * @return 0 if *node was no Proj node, its Proj number else.
362 static int redir_proj(const ir_node **node)
364 const ir_node *n = *node;
369 *node = irn = get_Proj_pred(n);
371 assert(get_irn_mode(irn) == mode_T);
372 *node = get_Proj_pred(irn);
374 return get_Proj_proj(n);
380 static be_reg_data_t *retrieve_reg_data(const ir_node *node)
382 be_node_attr_t *attr;
386 pos = get_Proj_proj(node);
387 node = get_Proj_pred(node);
390 assert(is_be_node(node));
391 attr = get_irn_attr(node);
392 assert(pos >= 0 && pos < ARR_LEN(attr->reg_data) && "illegal proj number");
394 return &attr->reg_data[pos];
398 be_node_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
400 be_reg_data_t *r = retrieve_reg_data(irn);
405 ir_node *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
406 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *to_spill)
414 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
415 a = init_node_attr(res, 2);
419 be_node_set_reg_class(res, be_pos_Spill_frame, cls_frame);
420 be_node_set_reg_class(res, be_pos_Spill_val, cls);
424 ir_node *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
425 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode)
432 res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in);
434 init_node_attr(res, 2);
435 be_node_set_reg_class(res, -1, cls);
436 be_node_set_reg_class(res, be_pos_Reload_frame, cls_frame);
437 be_node_set_flags(res, -1, arch_irn_flags_rematerializable);
441 ir_node *be_get_Reload_mem(const ir_node *irn)
443 assert(be_is_Reload(irn));
444 return get_irn_n(irn, be_pos_Reload_mem);
447 ir_node *be_get_Reload_frame(const ir_node *irn)
449 assert(be_is_Reload(irn));
450 return get_irn_n(irn, be_pos_Reload_frame);
453 ir_node *be_get_Spill_val(const ir_node *irn)
455 assert(be_is_Spill(irn));
456 return get_irn_n(irn, be_pos_Spill_val);
459 ir_node *be_get_Spill_frame(const ir_node *irn)
461 assert(be_is_Spill(irn));
462 return get_irn_n(irn, be_pos_Spill_frame);
465 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
468 ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in);
469 init_node_attr(irn, n);
470 for(i = 0; i < n; ++i) {
471 be_node_set_reg_class(irn, i, cls);
472 be_node_set_reg_class(irn, OUT_POS(i), cls);
478 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
480 ir_graph *irg = get_irn_irg(perm);
481 int n = get_irn_arity(perm);
482 be_reg_data_t *old_data = xmalloc(n * sizeof(old_data[0]));
483 be_node_attr_t *attr = get_irn_attr(perm);
484 ir_node **new_in = NEW_ARR_D(ir_node *, irg->obst, new_size + 1);
488 assert(be_is_Perm(perm));
489 assert(new_size <= n);
491 /* save the old register data */
492 memcpy(old_data, attr->reg_data, n * sizeof(old_data[0]));
494 /* compose the new in array and set the new register data directly in place */
495 for (i = 0; i < n; ++i) {
498 new_in[idx] = get_irn_n(perm, i);
499 attr->reg_data[idx] = old_data[i];
504 set_irn_in(perm, new_size, new_in);
507 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
510 ir_node *frame = get_irg_frame(irg);
511 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
513 const arch_register_t *sp = arch_env->isa->sp;
514 be_memperm_attr_t *attr;
517 real_in = alloca((n+1) * sizeof(real_in[0]));
519 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
521 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
523 init_node_attr(irn, n + 1);
524 be_node_set_reg_class(irn, 0, sp->reg_class);
525 for(i = 0; i < n; ++i) {
526 be_node_set_reg_class(irn, i + 1, cls_frame);
527 be_node_set_reg_class(irn, OUT_POS(i), cls_frame);
530 attr = get_irn_attr(irn);
532 attr->in_entities = obstack_alloc(irg->obst, n * sizeof(attr->in_entities[0]));
533 memset(attr->in_entities, 0, n * sizeof(attr->in_entities[0]));
534 attr->out_entities = obstack_alloc(irg->obst, n*sizeof(attr->out_entities[0]));
535 memset(attr->out_entities, 0, n*sizeof(attr->out_entities[0]));
541 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
545 arch_register_req_t *req;
548 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
549 init_node_attr(res, 1);
550 be_node_set_reg_class(res, 0, cls);
551 be_node_set_reg_class(res, OUT_POS(0), cls);
553 req = get_req(res, OUT_POS(0));
555 req->type = arch_register_req_type_should_be_same;
561 ir_node *be_get_Copy_op(const ir_node *cpy) {
562 return get_irn_n(cpy, be_pos_Copy_op);
565 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
566 set_irn_n(cpy, be_pos_Copy_op, op);
569 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
574 res = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, -1, NULL);
575 init_node_attr(res, -1);
577 for(i = 0; i < n; ++i) {
578 add_irn_n(res, in[i]);
579 add_register_req(res);
580 be_node_set_reg_class(res, i, cls);
587 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
591 assert(be_is_Keep(keep));
592 n = add_irn_n(keep, node);
593 add_register_req(keep);
594 be_node_set_reg_class(keep, n, cls);
597 /* creates a be_Call */
598 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
599 int n_outs, int n, ir_node *in[], ir_type *call_tp)
602 int real_n = be_pos_Call_first_arg + n;
606 NEW_ARR_A(ir_node *, real_in, real_n);
607 real_in[be_pos_Call_mem] = mem;
608 real_in[be_pos_Call_sp] = sp;
609 real_in[be_pos_Call_ptr] = ptr;
610 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
612 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
613 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
615 a->call_tp = call_tp;
619 /* Gets the call entity or NULL if this is no static call. */
620 ir_entity *be_Call_get_entity(const ir_node *call) {
621 be_call_attr_t *a = get_irn_attr(call);
622 assert(be_is_Call(call));
626 /* Sets the call entity. */
627 void be_Call_set_entity(ir_node *call, ir_entity *ent) {
628 be_call_attr_t *a = get_irn_attr(call);
629 assert(be_is_Call(call));
633 /* Gets the call type. */
634 ir_type *be_Call_get_type(ir_node *call) {
635 be_call_attr_t *a = get_irn_attr(call);
636 assert(be_is_Call(call));
640 /* Sets the call type. */
641 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
642 be_call_attr_t *a = get_irn_attr(call);
643 assert(be_is_Call(call));
644 a->call_tp = call_tp;
647 /* Construct a new be_Return. */
648 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
649 int n, ir_node *in[])
655 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL);
656 init_node_attr(res, -1);
657 for(i = 0; i < n; ++i) {
658 add_irn_n(res, in[i]);
659 add_register_req(res);
662 a = get_irn_attr(res);
663 a->num_ret_vals = n_res;
668 /* Returns the number of real returns values */
669 int be_Return_get_n_rets(ir_node *ret)
671 be_return_attr_t *a = get_irn_attr(ret);
672 return a->num_ret_vals;
675 int be_Return_append_node(ir_node *ret, ir_node *node)
679 pos = add_irn_n(ret, node);
680 add_register_req(ret);
685 ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, int offset)
692 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, sizeof(in) / sizeof(in[0]), in);
693 a = init_node_attr(irn, 1);
696 be_node_set_flags(irn, -1, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
698 /* Set output constraint to stack register. */
699 be_node_set_reg_class(irn, 0, sp->reg_class);
700 be_set_constr_single_reg(irn, BE_OUT_POS(0), sp);
701 be_node_set_irn_reg(NULL, irn, sp);
706 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
710 ir_node *in[be_pos_AddSP_last];
711 const arch_register_class_t *class;
713 in[be_pos_AddSP_old_sp] = old_sp;
714 in[be_pos_AddSP_size] = sz;
716 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
717 a = init_node_attr(irn, be_pos_AddSP_last);
719 be_node_set_flags(irn, OUT_POS(pn_be_AddSP_sp),
720 arch_irn_flags_ignore | arch_irn_flags_modify_sp);
722 /* Set output constraint to stack register. */
723 be_set_constr_single_reg(irn, be_pos_AddSP_old_sp, sp);
724 be_node_set_reg_class(irn, be_pos_AddSP_size, arch_register_get_class(sp));
725 be_set_constr_single_reg(irn, OUT_POS(pn_be_AddSP_sp), sp);
726 a->reg_data[pn_be_AddSP_sp].reg = sp;
728 class = arch_register_get_class(sp);
729 be_node_set_reg_class(irn, OUT_POS(pn_be_AddSP_res), class);
734 ir_node *be_new_SubSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
738 ir_node *in[be_pos_SubSP_last];
740 in[be_pos_SubSP_old_sp] = old_sp;
741 in[be_pos_SubSP_size] = sz;
743 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
744 a = init_node_attr(irn, be_pos_SubSP_last);
746 be_node_set_flags(irn, OUT_POS(pn_be_SubSP_sp),
747 arch_irn_flags_ignore | arch_irn_flags_modify_sp);
749 /* Set output constraint to stack register. */
750 be_set_constr_single_reg(irn, be_pos_SubSP_old_sp, sp);
751 be_node_set_reg_class(irn, be_pos_SubSP_size, arch_register_get_class(sp));
752 be_set_constr_single_reg(irn, OUT_POS(pn_be_SubSP_sp), sp);
753 a->reg_data[pn_be_SubSP_sp].reg = sp;
758 ir_node *be_new_SetSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl,
759 ir_node *old_sp, ir_node *op, ir_node *mem)
768 irn = new_ir_node(NULL, irg, bl, op_be_SetSP, get_irn_mode(old_sp), 3, in);
769 a = init_node_attr(irn, 3);
771 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
773 /* Set output constraint to stack register. */
774 be_set_constr_single_reg(irn, OUT_POS(0), sp);
775 be_node_set_reg_class(irn, be_pos_AddSP_size, sp->reg_class);
776 be_node_set_reg_class(irn, be_pos_AddSP_old_sp, sp->reg_class);
781 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
786 res = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, NULL);
787 init_node_attr(res, -1);
788 for(i = 0; i < n_outs; ++i)
789 add_register_req(res);
794 ir_node *be_RegParams_append_out_reg(ir_node *regparams,
795 const arch_env_t *arch_env,
796 const arch_register_t *reg)
798 ir_graph *irg = get_irn_irg(regparams);
799 ir_node *block = get_nodes_block(regparams);
800 be_node_attr_t *attr = get_irn_attr(regparams);
801 const arch_register_class_t *cls = arch_register_get_class(reg);
802 ir_mode *mode = arch_register_class_mode(cls);
803 int n = ARR_LEN(attr->reg_data);
806 assert(be_is_RegParams(regparams));
807 proj = new_r_Proj(irg, block, regparams, mode, n);
808 add_register_req(regparams);
809 be_set_constr_single_reg(regparams, BE_OUT_POS(n), reg);
810 arch_set_irn_register(arch_env, proj, reg);
812 /* TODO decide, whether we need to set ignore/modify sp flags here? */
817 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent)
824 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
825 a = init_node_attr(irn, 1);
828 be_node_set_reg_class(irn, 0, cls_frame);
829 be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
831 return optimize_node(irn);
834 ir_node *be_get_FrameAddr_frame(ir_node *node) {
835 assert(be_is_FrameAddr(node));
836 return get_irn_n(node, be_pos_FrameAddr_ptr);
839 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)
842 ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0]));
845 memcpy(&in[1], in_keep, n * sizeof(in[0]));
846 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
847 init_node_attr(irn, n + 1);
848 be_node_set_reg_class(irn, OUT_POS(0), cls);
849 be_node_set_reg_class(irn, 0, cls);
854 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)
859 return be_new_CopyKeep(cls, irg, bl, src, 1, in, mode);
862 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
863 return get_irn_n(cpy, be_pos_CopyKeep_op);
866 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
867 set_irn_n(cpy, be_pos_CopyKeep_op, op);
870 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
875 res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
876 init_node_attr(res, -1);
877 for(i = 0; i < n; ++i) {
878 add_irn_n(res, in[i]);
879 add_register_req(res);
885 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
887 ir_graph *irg = get_irn_irg(barrier);
888 ir_node *block = get_nodes_block(barrier);
889 ir_mode *mode = get_irn_mode(node);
890 int n = add_irn_n(barrier, node);
892 ir_node *proj = new_r_Proj(irg, block, barrier, mode, n);
893 add_register_req(barrier);
898 int be_is_Spill (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill ; }
899 int be_is_Reload (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Reload ; }
900 int be_is_Copy (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Copy ; }
901 int be_is_CopyKeep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_CopyKeep ; }
902 int be_is_Perm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Perm ; }
903 int be_is_MemPerm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_MemPerm ; }
904 int be_is_Keep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Keep ; }
905 int be_is_Call (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Call ; }
906 int be_is_Return (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Return ; }
907 int be_is_IncSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_IncSP ; }
908 int be_is_SetSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SetSP ; }
909 int be_is_AddSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_AddSP ; }
910 int be_is_SubSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SubSP ; }
911 int be_is_RegParams (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_RegParams ; }
912 int be_is_FrameAddr (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameAddr ; }
913 int be_is_Barrier (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Barrier ; }
915 int be_has_frame_entity(const ir_node *irn)
917 switch(be_get_irn_opcode(irn)) {
927 ir_entity *be_get_frame_entity(const ir_node *irn)
929 if (be_has_frame_entity(irn)) {
930 be_frame_attr_t *a = get_irn_attr(irn);
936 int be_get_frame_offset(const ir_node *irn)
938 assert(is_be_node(irn));
939 if (be_has_frame_entity(irn)) {
940 be_frame_attr_t *a = get_irn_attr(irn);
946 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
948 be_memperm_attr_t *attr = get_irn_attr(irn);
950 assert(be_is_MemPerm(irn));
951 assert(n < be_get_MemPerm_entity_arity(irn));
953 attr->in_entities[n] = ent;
956 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
958 be_memperm_attr_t *attr = get_irn_attr(irn);
960 assert(be_is_MemPerm(irn));
961 assert(n < be_get_MemPerm_entity_arity(irn));
963 return attr->in_entities[n];
966 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
968 be_memperm_attr_t *attr = get_irn_attr(irn);
970 assert(be_is_MemPerm(irn));
971 assert(n < be_get_MemPerm_entity_arity(irn));
973 attr->out_entities[n] = ent;
976 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
978 be_memperm_attr_t *attr = get_irn_attr(irn);
980 assert(be_is_MemPerm(irn));
981 assert(n < be_get_MemPerm_entity_arity(irn));
983 return attr->out_entities[n];
986 int be_get_MemPerm_entity_arity(const ir_node *irn)
988 return get_irn_arity(irn) - 1;
991 void be_set_constr_single_reg(ir_node *node, int pos, const arch_register_t *reg)
993 arch_register_req_t *req = get_req(node, pos);
994 const arch_register_class_t *cls = arch_register_get_class(reg);
995 ir_graph *irg = get_irn_irg(node);
996 struct obstack *obst = get_irg_obstack(irg);
997 unsigned *limited_bitset;
999 assert(req->cls == NULL || req->cls == cls);
1000 assert(! (req->type & arch_register_req_type_limited));
1001 assert(req->limited == NULL);
1003 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
1004 rbitset_set(limited_bitset, arch_register_get_index(reg));
1007 req->type |= arch_register_req_type_limited;
1008 req->limited = limited_bitset;
1011 void be_set_constr_limited(ir_node *node, int pos, const arch_register_req_t *req)
1013 ir_graph *irg = get_irn_irg(node);
1014 struct obstack *obst = get_irg_obstack(irg);
1015 arch_register_req_t *r = get_req(node, pos);
1017 assert(arch_register_req_is(req, limited));
1018 assert(! (req->type & (arch_register_req_type_should_be_same | arch_register_req_type_should_be_different)));
1019 memcpy(r, req, sizeof(r[0]));
1020 r->limited = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1023 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
1025 be_req_t *bereq = get_be_req(irn, pos);
1026 bereq->flags = flags;
1029 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
1031 arch_register_req_t *req = get_req(irn, pos);
1036 req->type = arch_register_req_type_none;
1037 } else if (req->type == arch_register_req_type_none) {
1038 req->type = arch_register_req_type_normal;
1042 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
1044 arch_register_req_t *req = get_req(irn, pos);
1048 ir_node *be_get_IncSP_pred(ir_node *irn) {
1049 assert(be_is_IncSP(irn));
1050 return get_irn_n(irn, 0);
1053 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
1054 assert(be_is_IncSP(incsp));
1055 set_irn_n(incsp, 0, pred);
1058 ir_node *be_get_IncSP_mem(ir_node *irn) {
1059 assert(be_is_IncSP(irn));
1060 return get_irn_n(irn, 1);
1063 void be_set_IncSP_offset(ir_node *irn, int offset)
1065 be_stack_attr_t *a = get_irn_attr(irn);
1066 assert(be_is_IncSP(irn));
1070 int be_get_IncSP_offset(const ir_node *irn)
1072 be_stack_attr_t *a = get_irn_attr(irn);
1073 assert(be_is_IncSP(irn));
1077 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn)
1079 ir_node *bl = get_nodes_block(irn);
1080 ir_graph *irg = get_irn_irg(bl);
1081 ir_node *frame = get_irg_frame(irg);
1082 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
1083 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
1086 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn);
1090 ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill)
1093 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
1094 ir_graph *irg = get_irn_irg(bl);
1095 ir_node *frame = get_irg_frame(irg);
1096 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
1098 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
1100 reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
1102 if (is_Block(insert)) {
1103 insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
1104 sched_add_after(insert, reload);
1106 sched_add_before(insert, reload);
1114 | _ \ ___ __ _ | _ \ ___ __ _ ___
1115 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
1116 | _ < __/ (_| | | _ < __/ (_| \__ \
1117 |_| \_\___|\__, | |_| \_\___|\__, |___/
1124 arch_register_req_t *get_out_reg_req(const ir_node *irn, int out_pos)
1126 const be_node_attr_t *a = get_irn_attr(irn);
1128 if(out_pos >= ARR_LEN(a->reg_data)) {
1129 return arch_no_register_req;
1132 return &a->reg_data[out_pos].req.req;
1136 arch_register_req_t *get_in_reg_req(const ir_node *irn, int pos)
1138 const be_node_attr_t *a = get_irn_attr(irn);
1140 if(pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
1141 return arch_no_register_req;
1143 return &a->reg_data[pos].in_req.req;
1146 static const arch_register_req_t *
1147 be_node_get_irn_reg_req(const void *self, const ir_node *irn, int pos)
1153 if (get_irn_mode(irn) == mode_T)
1154 return arch_no_register_req;
1156 out_pos = redir_proj((const ir_node **)&irn);
1157 assert(is_be_node(irn));
1158 return get_out_reg_req(irn, out_pos);
1159 } else if (is_be_node(irn)) {
1161 * For spills and reloads, we return "none" as requirement for frame
1162 * pointer, so every input is ok. Some backends need this (e.g. STA).
1164 if ((be_is_Spill(irn) && pos == be_pos_Spill_frame) ||
1165 (be_is_Reload(irn) && pos == be_pos_Reload_frame))
1166 return arch_no_register_req;
1168 return get_in_reg_req(irn, pos);
1171 return arch_no_register_req;
1174 const arch_register_t *
1175 be_node_get_irn_reg(const void *self, const ir_node *irn)
1180 if (get_irn_mode(irn) == mode_T)
1182 r = retrieve_reg_data(irn);
1186 static arch_irn_class_t be_node_classify(const void *self, const ir_node *irn)
1188 redir_proj((const ir_node **) &irn);
1191 switch(be_get_irn_opcode(irn)) {
1192 #define XXX(a,b) case beo_ ## a: return arch_irn_class_ ## b
1194 XXX(Reload, reload);
1197 XXX(Return, branch);
1200 return arch_irn_class_normal;
1206 static arch_irn_flags_t be_node_get_flags(const void *self, const ir_node *node)
1213 pos = OUT_POS(get_Proj_proj(node));
1214 node = skip_Proj_const(node);
1217 bereq = get_be_req(node, pos);
1219 return bereq->flags;
1222 static ir_entity *be_node_get_frame_entity(const void *self, const ir_node *irn)
1225 return be_get_frame_entity(irn);
1228 static void be_node_set_frame_entity(const void *self, ir_node *irn, ir_entity *ent)
1233 assert(be_has_frame_entity(irn));
1235 a = get_irn_attr(irn);
1239 static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset)
1242 if(be_has_frame_entity(irn)) {
1243 be_frame_attr_t *a = get_irn_attr(irn);
1248 static int be_node_get_sp_bias(const void *self, const ir_node *irn)
1251 return be_is_IncSP(irn) ? be_get_IncSP_offset(irn) : 0;
1255 ___ ____ _ _ _ _ _ _
1256 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1257 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1258 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1259 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1263 static const arch_irn_ops_if_t be_node_irn_ops_if = {
1264 be_node_get_irn_reg_req,
1265 be_node_set_irn_reg,
1266 be_node_get_irn_reg,
1269 be_node_get_frame_entity,
1270 be_node_set_frame_entity,
1271 be_node_set_frame_offset,
1272 be_node_get_sp_bias,
1273 NULL, /* get_inverse */
1274 NULL, /* get_op_estimated_cost */
1275 NULL, /* possible_memory_operand */
1276 NULL, /* perform_memory_operand */
1279 static const arch_irn_ops_t be_node_irn_ops = {
1283 const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
1285 redir_proj((const ir_node **) &irn);
1287 return is_be_node(irn) ? &be_node_irn_ops : NULL;
1290 const arch_irn_handler_t be_node_irn_handler = {
1295 ____ _ _ ___ ____ _ _ _ _ _ _
1296 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1297 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1298 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1299 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1304 const arch_register_t *reg;
1305 arch_register_req_t req;
1306 arch_irn_flags_t flags;
1310 arch_irn_handler_t irn_handler;
1311 arch_irn_ops_t irn_ops;
1312 const arch_env_t *arch_env;
1316 #define get_phi_handler_from_handler(h) container_of(h, phi_handler_t, irn_handler)
1317 #define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops)
1320 const void *phi_get_irn_ops(const arch_irn_handler_t *handler,
1323 const phi_handler_t *h;
1324 if(!is_Phi(irn) || !mode_is_datab(get_irn_mode(irn)))
1327 h = get_phi_handler_from_handler(handler);
1332 phi_attr_t *get_Phi_attr(const phi_handler_t *handler, const ir_node *phi)
1334 phi_attr_t *attr = pmap_get(handler->phi_attrs, (void*) phi);
1336 ir_graph *irg = get_irn_irg(phi);
1337 struct obstack *obst = get_irg_obstack(irg);
1338 attr = obstack_alloc(obst, sizeof(attr[0]));
1339 memset(attr, 0, sizeof(attr[0]));
1340 pmap_insert(handler->phi_attrs, phi, attr);
1347 * Get register class of a Phi.
1350 const arch_register_req_t *get_Phi_reg_req_recursive(const phi_handler_t *h,
1354 int n = get_irn_arity(phi);
1358 if(*visited && pset_find_ptr(*visited, phi))
1361 for(i = 0; i < n; ++i) {
1362 op = get_irn_n(phi, i);
1363 /* Matze: don't we unnecessary constraint our phis with this?
1364 * we only need to take the regclass IMO*/
1366 return arch_get_register_req(h->arch_env, op, BE_OUT_POS(0));
1370 * The operands of that Phi were all Phis themselves.
1371 * We have to start a DFS for a non-Phi argument now.
1374 *visited = pset_new_ptr(16);
1376 pset_insert_ptr(*visited, phi);
1378 for(i = 0; i < n; ++i) {
1379 const arch_register_req_t *req;
1380 op = get_irn_n(phi, i);
1381 req = get_Phi_reg_req_recursive(h, op, visited);
1390 const arch_register_req_t *phi_get_irn_reg_req(const void *self,
1391 const ir_node *irn, int pos)
1393 phi_handler_t *phi_handler = get_phi_handler_from_ops(self);
1398 if(!mode_is_datab(get_irn_mode(irn)))
1399 return arch_no_register_req;
1401 attr = get_Phi_attr(phi_handler, irn);
1403 if(attr->req.type == arch_register_req_type_none) {
1404 pset *visited = NULL;
1405 const arch_register_req_t *req;
1406 req = get_Phi_reg_req_recursive(phi_handler, irn, &visited);
1408 memcpy(&attr->req, req, sizeof(req[0]));
1409 assert(attr->req.cls != NULL);
1410 attr->req.type = arch_register_req_type_normal;
1419 void be_set_phi_reg_req(const arch_env_t *arch_env, ir_node *node,
1420 const arch_register_req_t *req)
1422 const arch_irn_ops_t *ops = arch_get_irn_ops(arch_env, node);
1423 const phi_handler_t *handler = get_phi_handler_from_ops(ops);
1426 assert(mode_is_datab(get_irn_mode(node)));
1428 attr = get_Phi_attr(handler, node);
1429 memcpy(&attr->req, req, sizeof(req[0]));
1432 void be_set_phi_flags(const arch_env_t *arch_env, ir_node *node,
1433 arch_irn_flags_t flags)
1435 const arch_irn_ops_t *ops = arch_get_irn_ops(arch_env, node);
1436 const phi_handler_t *handler = get_phi_handler_from_ops(ops);
1439 assert(mode_is_datab(get_irn_mode(node)));
1441 attr = get_Phi_attr(handler, node);
1442 attr->flags = flags;
1446 void phi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1448 phi_handler_t *h = get_phi_handler_from_ops(self);
1449 phi_attr_t *attr = get_Phi_attr(h, irn);
1454 const arch_register_t *phi_get_irn_reg(const void *self, const ir_node *irn)
1456 phi_handler_t *h = get_phi_handler_from_ops(self);
1457 phi_attr_t *attr = get_Phi_attr(h, irn);
1462 arch_irn_class_t phi_classify(const void *self, const ir_node *irn)
1466 return arch_irn_class_normal;
1470 arch_irn_flags_t phi_get_flags(const void *self, const ir_node *irn)
1472 phi_handler_t *h = get_phi_handler_from_ops(self);
1473 phi_attr_t *attr = get_Phi_attr(h, irn);
1479 ir_entity *phi_get_frame_entity(const void *self, const ir_node *irn)
1487 void phi_set_frame_entity(const void *self, ir_node *irn, ir_entity *ent)
1496 void phi_set_frame_offset(const void *self, ir_node *irn, int bias)
1505 int phi_get_sp_bias(const void* self, const ir_node *irn)
1513 const arch_irn_ops_if_t phi_irn_ops = {
1514 phi_get_irn_reg_req,
1519 phi_get_frame_entity,
1520 phi_set_frame_entity,
1521 phi_set_frame_offset,
1523 NULL, /* get_inverse */
1524 NULL, /* get_op_estimated_cost */
1525 NULL, /* possible_memory_operand */
1526 NULL, /* perform_memory_operand */
1529 arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env)
1531 phi_handler_t *h = xmalloc(sizeof(h[0]));
1532 h->irn_handler.get_irn_ops = phi_get_irn_ops;
1533 h->irn_ops.impl = &phi_irn_ops;
1534 h->arch_env = arch_env;
1535 h->phi_attrs = pmap_create();
1536 return (arch_irn_handler_t *) h;
1539 void be_phi_handler_free(arch_irn_handler_t *handler)
1541 phi_handler_t *h = get_phi_handler_from_handler(handler);
1542 pmap_destroy(h->phi_attrs);
1543 h->phi_attrs = NULL;
1547 void be_phi_handler_reset(arch_irn_handler_t *handler)
1549 phi_handler_t *h = get_phi_handler_from_handler(handler);
1551 pmap_destroy(h->phi_attrs);
1552 h->phi_attrs = pmap_create();
1557 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1558 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1559 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1560 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1565 * Dumps a register requirement to a file.
1567 static void dump_node_req(FILE *f, int idx, const arch_register_req_t *req,
1568 const ir_node *node)
1570 int did_something = 0;
1572 const char *prefix = buf;
1574 snprintf(buf, sizeof(buf), "#%d ", idx);
1575 buf[sizeof(buf) - 1] = '\0';
1580 arch_register_req_format(tmp, sizeof(tmp), req, node);
1581 fprintf(f, "%s", tmp);
1590 * Dumps node register requirements to a file.
1592 static void dump_node_reqs(FILE *f, ir_node *node)
1595 be_node_attr_t *a = get_irn_attr(node);
1596 int len = ARR_LEN(a->reg_data);
1598 fprintf(f, "registers: \n");
1599 for(i = 0; i < len; ++i) {
1600 be_reg_data_t *rd = &a->reg_data[i];
1602 fprintf(f, "#%d: %s\n", i, rd->reg->name);
1605 fprintf(f, "in requirements:\n");
1606 for(i = 0; i < len; ++i) {
1607 dump_node_req(f, i, &a->reg_data[i].in_req.req, node);
1610 fprintf(f, "\nout requirements:\n");
1611 for(i = 0; i < len; ++i) {
1612 dump_node_req(f, i, &a->reg_data[i].req.req, node);
1617 * ir_op-Operation: dump a be node to file
1619 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1621 be_node_attr_t *at = get_irn_attr(irn);
1623 assert(is_be_node(irn));
1626 case dump_node_opcode_txt:
1627 fprintf(f, get_op_name(get_irn_op(irn)));
1629 case dump_node_mode_txt:
1630 fprintf(f, get_mode_name(get_irn_mode(irn)));
1632 case dump_node_nodeattr_txt:
1633 if(be_is_Call(irn)) {
1634 be_call_attr_t *a = (be_call_attr_t *) at;
1636 fprintf(f, " [%s] ", get_entity_name(a->ent));
1639 case dump_node_info_txt:
1640 dump_node_reqs(f, irn);
1642 if(be_has_frame_entity(irn)) {
1643 be_frame_attr_t *a = (be_frame_attr_t *) at;
1645 int bits = get_type_size_bits(get_entity_type(a->ent));
1646 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bits\n",
1647 a->ent, a->offset, a->offset, bits, bits);
1652 switch(be_get_irn_opcode(irn)) {
1655 be_stack_attr_t *a = (be_stack_attr_t *) at;
1656 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1657 fprintf(f, "offset: FRAME_SIZE\n");
1658 else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1659 fprintf(f, "offset: -FRAME SIZE\n");
1661 fprintf(f, "offset: %u\n", a->offset);
1666 be_call_attr_t *a = (be_call_attr_t *) at;
1669 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1675 for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1676 ir_entity *in, *out;
1677 in = be_get_MemPerm_in_entity(irn, i);
1678 out = be_get_MemPerm_out_entity(irn, i);
1680 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1683 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1699 * Copies the backend specific attributes from old node to new node.
1701 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1703 be_node_attr_t *old_attr = get_irn_attr(old_node);
1704 be_node_attr_t *new_attr = get_irn_attr(new_node);
1705 struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
1708 assert(is_be_node(old_node));
1709 assert(is_be_node(new_node));
1711 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1712 new_attr->reg_data = NULL;
1714 if(old_attr->reg_data != NULL)
1715 len = ARR_LEN(old_attr->reg_data);
1719 if(get_irn_op(old_node)->opar == oparity_dynamic
1720 || be_is_RegParams(old_node)) {
1721 new_attr->reg_data = NEW_ARR_F(be_reg_data_t, len);
1723 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, len);
1727 memcpy(new_attr->reg_data, old_attr->reg_data, len * sizeof(be_reg_data_t));
1728 for(i = 0; i < len; ++i) {
1729 const be_reg_data_t *rd = &old_attr->reg_data[i];
1730 be_reg_data_t *newrd = &new_attr->reg_data[i];
1731 if(arch_register_req_is(&rd->req.req, limited)) {
1732 const arch_register_req_t *req = &rd->req.req;
1733 arch_register_req_t *new_req = &newrd->req.req;
1735 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1737 if(arch_register_req_is(&rd->in_req.req, limited)) {
1738 const arch_register_req_t *req = &rd->in_req.req;
1739 arch_register_req_t *new_req = &newrd->in_req.req;
1741 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1747 static const ir_op_ops be_node_op_ops = {