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_StackParam;
131 ir_op *op_be_FrameAddr;
132 ir_op *op_be_FrameLoad;
133 ir_op *op_be_FrameStore;
134 ir_op *op_be_Barrier;
136 static int beo_base = -1;
138 static const ir_op_ops be_node_op_ops;
140 #define N irop_flag_none
141 #define L irop_flag_labeled
142 #define C irop_flag_commutative
143 #define X irop_flag_cfopcode
144 #define I irop_flag_ip_cfopcode
145 #define F irop_flag_fragile
146 #define Y irop_flag_forking
147 #define H irop_flag_highlevel
148 #define c irop_flag_constlike
149 #define K irop_flag_keep
150 #define M irop_flag_machine
154 * Compare two node attributes.
156 * @return zero if both attributes are identically
158 static int _node_cmp_attr(be_node_attr_t *a, be_node_attr_t *b) {
161 if(ARR_LEN(a->reg_data) != ARR_LEN(b->reg_data))
164 len = ARR_LEN(a->reg_data);
165 for (i = 0; i < len; ++i) {
166 if (a->reg_data[i].reg != b->reg_data[i].reg ||
167 memcmp(&a->reg_data[i].in_req, &b->reg_data[i].in_req, sizeof(b->reg_data[i].in_req)) ||
168 memcmp(&a->reg_data[i].req, &b->reg_data[i].req, sizeof(a->reg_data[i].req)))
175 static int node_cmp_attr(ir_node *a, ir_node *b) {
176 be_node_attr_t *a_attr = get_irn_attr(a);
177 be_node_attr_t *b_attr = get_irn_attr(b);
179 return _node_cmp_attr(a_attr, b_attr);
183 * Compare the attributes of two FrameAddr nodes.
185 * @return zero if both attributes are identically
187 static int FrameAddr_cmp_attr(ir_node *a, ir_node *b) {
188 be_frame_attr_t *a_attr = get_irn_attr(a);
189 be_frame_attr_t *b_attr = get_irn_attr(b);
191 if (a_attr->ent != b_attr->ent || a_attr->offset != b_attr->offset)
194 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
197 static int Return_cmp_attr(ir_node *a, ir_node *b) {
198 be_return_attr_t *a_attr = get_irn_attr(a);
199 be_return_attr_t *b_attr = get_irn_attr(b);
201 if (a_attr->num_ret_vals != b_attr->num_ret_vals)
204 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
207 static int Stack_cmp_attr(ir_node *a, ir_node *b) {
208 be_stack_attr_t *a_attr = get_irn_attr(a);
209 be_stack_attr_t *b_attr = get_irn_attr(b);
211 if (a_attr->offset != b_attr->offset)
214 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
217 static int Call_cmp_attr(ir_node *a, ir_node *b) {
218 be_call_attr_t *a_attr = get_irn_attr(a);
219 be_call_attr_t *b_attr = get_irn_attr(b);
221 if (a_attr->ent != b_attr->ent ||
222 a_attr->call_tp != b_attr->call_tp)
225 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
228 static INLINE be_req_t *get_be_req(const ir_node *node, int pos)
231 be_node_attr_t *attr;
234 assert(is_be_node(node));
235 attr = get_irn_attr(node);
241 assert(idx < get_irn_arity(node));
243 assert(idx < ARR_LEN(attr->reg_data));
244 rd = &attr->reg_data[idx];
246 return pos < 0 ? &rd->req : &rd->in_req;
249 static INLINE arch_register_req_t *get_req(const ir_node *node, int pos)
251 be_req_t *bereq = get_be_req(node, pos);
255 void be_node_init(void) {
256 static int inited = 0;
263 /* Acquire all needed opcodes. */
264 beo_base = get_next_ir_opcodes(beo_Last);
266 op_be_Spill = new_ir_op(beo_base + beo_Spill, "be_Spill", op_pin_state_mem_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
267 op_be_Reload = new_ir_op(beo_base + beo_Reload, "be_Reload", op_pin_state_mem_pinned, N, oparity_zero, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
268 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);
269 op_be_MemPerm = new_ir_op(beo_base + beo_MemPerm, "be_MemPerm", op_pin_state_mem_pinned, N, oparity_variable, 0, sizeof(be_memperm_attr_t), &be_node_op_ops);
270 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);
271 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);
272 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);
273 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);
274 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);
275 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);
276 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);
277 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);
278 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);
279 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);
280 op_be_StackParam = new_ir_op(beo_base + beo_StackParam, "be_StackParam", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
281 op_be_FrameLoad = new_ir_op(beo_base + beo_FrameLoad, "be_FrameLoad", op_pin_state_pinned, N, oparity_any, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
282 op_be_FrameStore = new_ir_op(beo_base + beo_FrameStore, "be_FrameStore", op_pin_state_pinned, N, oparity_any, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
283 op_be_FrameAddr = new_ir_op(beo_base + beo_FrameAddr, "be_FrameAddr", op_pin_state_pinned, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
284 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);
286 set_op_tag(op_be_Spill, &be_node_tag);
287 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
288 set_op_tag(op_be_Reload, &be_node_tag);
289 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
290 set_op_tag(op_be_Perm, &be_node_tag);
291 op_be_Perm->ops.node_cmp_attr = node_cmp_attr;
292 set_op_tag(op_be_MemPerm, &be_node_tag);
293 op_be_MemPerm->ops.node_cmp_attr = node_cmp_attr;
294 set_op_tag(op_be_Copy, &be_node_tag);
295 op_be_Copy->ops.node_cmp_attr = node_cmp_attr;
296 set_op_tag(op_be_Keep, &be_node_tag);
297 op_be_Keep->ops.node_cmp_attr = node_cmp_attr;
298 set_op_tag(op_be_CopyKeep, &be_node_tag);
299 op_be_CopyKeep->ops.node_cmp_attr = node_cmp_attr;
300 set_op_tag(op_be_Call, &be_node_tag);
301 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
302 set_op_tag(op_be_Return, &be_node_tag);
303 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
304 set_op_tag(op_be_AddSP, &be_node_tag);
305 op_be_AddSP->ops.node_cmp_attr = node_cmp_attr;
306 set_op_tag(op_be_SubSP, &be_node_tag);
307 op_be_SubSP->ops.node_cmp_attr = node_cmp_attr;
308 set_op_tag(op_be_SetSP, &be_node_tag);
309 op_be_SetSP->ops.node_cmp_attr = Stack_cmp_attr;
310 set_op_tag(op_be_IncSP, &be_node_tag);
311 op_be_IncSP->ops.node_cmp_attr = Stack_cmp_attr;
312 set_op_tag(op_be_RegParams, &be_node_tag);
313 op_be_RegParams->ops.node_cmp_attr = node_cmp_attr;
314 set_op_tag(op_be_StackParam, &be_node_tag);
315 op_be_StackParam->ops.node_cmp_attr = FrameAddr_cmp_attr;
316 set_op_tag(op_be_FrameLoad, &be_node_tag);
317 op_be_FrameLoad->ops.node_cmp_attr = FrameAddr_cmp_attr;
318 set_op_tag(op_be_FrameStore, &be_node_tag);
319 op_be_FrameStore->ops.node_cmp_attr = FrameAddr_cmp_attr;
320 set_op_tag(op_be_FrameAddr, &be_node_tag);
321 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
322 set_op_tag(op_be_Barrier, &be_node_tag);
323 op_be_Barrier->ops.node_cmp_attr = node_cmp_attr;
327 * Initializes the generic attribute of all be nodes and return ir.
329 static void *init_node_attr(ir_node *node, int max_reg_data)
331 ir_graph *irg = get_irn_irg(node);
332 struct obstack *obst = get_irg_obstack(irg);
333 be_node_attr_t *a = get_irn_attr(node);
335 memset(a, 0, sizeof(get_op_attr_size(get_irn_op(node))));
337 if(max_reg_data >= 0) {
338 a->reg_data = NEW_ARR_D(be_reg_data_t, obst, max_reg_data);
339 memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
341 a->reg_data = NEW_ARR_F(be_reg_data_t, 0);
347 static void add_register_req(ir_node *node)
349 be_node_attr_t *a = get_irn_attr(node);
350 be_reg_data_t regreq;
351 memset(®req, 0, sizeof(regreq));
352 ARR_APP1(be_reg_data_t, a->reg_data, regreq);
355 int is_be_node(const ir_node *irn)
357 return get_op_tag(get_irn_op(irn)) == &be_node_tag;
360 be_opcode_t be_get_irn_opcode(const ir_node *irn)
362 return is_be_node(irn) ? get_irn_opcode(irn) - beo_base : beo_NoBeOp;
366 * Skip Proj nodes and return their Proj numbers.
368 * If *node is a Proj or Proj(Proj) node, skip it.
370 * @param node points to the node to be skipped
372 * @return 0 if *node was no Proj node, its Proj number else.
374 static int redir_proj(const ir_node **node)
376 const ir_node *n = *node;
381 *node = irn = get_Proj_pred(n);
383 assert(get_irn_mode(irn) == mode_T);
384 *node = get_Proj_pred(irn);
386 return get_Proj_proj(n);
392 static be_reg_data_t *retrieve_reg_data(const ir_node *node)
394 be_node_attr_t *attr;
398 pos = get_Proj_proj(node);
399 node = get_Proj_pred(node);
402 assert(is_be_node(node));
403 attr = get_irn_attr(node);
404 assert(pos >= 0 && pos < ARR_LEN(attr->reg_data) && "illegal proj number");
406 return &attr->reg_data[pos];
410 be_node_set_irn_reg(const void *_self, ir_node *irn, const arch_register_t *reg)
412 be_reg_data_t *r = retrieve_reg_data(irn);
416 ir_node *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
417 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *to_spill)
425 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
426 a = init_node_attr(res, 2);
430 be_node_set_reg_class(res, be_pos_Spill_frame, cls_frame);
431 be_node_set_reg_class(res, be_pos_Spill_val, cls);
435 ir_node *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
436 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode)
443 res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in);
445 init_node_attr(res, 2);
446 be_node_set_reg_class(res, -1, cls);
447 be_node_set_reg_class(res, be_pos_Reload_frame, cls_frame);
448 be_node_set_flags(res, -1, arch_irn_flags_rematerializable);
452 ir_node *be_get_Reload_mem(const ir_node *irn)
454 assert(be_is_Reload(irn));
455 return get_irn_n(irn, be_pos_Reload_mem);
458 ir_node *be_get_Reload_frame(const ir_node *irn)
460 assert(be_is_Reload(irn));
461 return get_irn_n(irn, be_pos_Reload_frame);
464 ir_node *be_get_Spill_val(const ir_node *irn)
466 assert(be_is_Spill(irn));
467 return get_irn_n(irn, be_pos_Spill_val);
470 ir_node *be_get_Spill_frame(const ir_node *irn)
472 assert(be_is_Spill(irn));
473 return get_irn_n(irn, be_pos_Spill_frame);
476 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
479 ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in);
480 init_node_attr(irn, n);
481 for(i = 0; i < n; ++i) {
482 be_node_set_reg_class(irn, i, cls);
483 be_node_set_reg_class(irn, OUT_POS(i), cls);
489 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
492 ir_node *frame = get_irg_frame(irg);
493 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
495 const arch_register_t *sp = arch_env->isa->sp;
496 be_memperm_attr_t *attr;
499 real_in = alloca((n+1) * sizeof(real_in[0]));
501 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
503 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
505 init_node_attr(irn, n + 1);
506 be_node_set_reg_class(irn, 0, sp->reg_class);
507 for(i = 0; i < n; ++i) {
508 be_node_set_reg_class(irn, i + 1, cls_frame);
509 be_node_set_reg_class(irn, OUT_POS(i), cls_frame);
512 attr = get_irn_attr(irn);
514 attr->in_entities = obstack_alloc(irg->obst, n * sizeof(attr->in_entities[0]));
515 memset(attr->in_entities, 0, n * sizeof(attr->in_entities[0]));
516 attr->out_entities = obstack_alloc(irg->obst, n*sizeof(attr->out_entities[0]));
517 memset(attr->out_entities, 0, n*sizeof(attr->out_entities[0]));
523 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
527 arch_register_req_t *req;
530 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
531 init_node_attr(res, 1);
532 be_node_set_reg_class(res, 0, cls);
533 be_node_set_reg_class(res, OUT_POS(0), cls);
535 req = get_req(res, OUT_POS(0));
537 req->type = arch_register_req_type_should_be_same;
543 ir_node *be_get_Copy_op(const ir_node *cpy) {
544 return get_irn_n(cpy, be_pos_Copy_op);
547 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
548 set_irn_n(cpy, be_pos_Copy_op, op);
551 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
556 res = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, -1, NULL);
557 init_node_attr(res, -1);
559 for(i = 0; i < n; ++i) {
560 add_irn_n(res, in[i]);
561 add_register_req(res);
562 be_node_set_reg_class(res, i, cls);
569 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
573 assert(be_is_Keep(keep));
574 n = add_irn_n(keep, node);
575 add_register_req(keep);
576 be_node_set_reg_class(keep, n, cls);
579 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
580 int n_outs, int n, ir_node *in[], ir_type *call_tp)
583 int real_n = be_pos_Call_first_arg + n;
587 NEW_ARR_A(ir_node *, real_in, real_n);
588 real_in[be_pos_Call_mem] = mem;
589 real_in[be_pos_Call_sp] = sp;
590 real_in[be_pos_Call_ptr] = ptr;
591 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
593 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
594 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
596 a->call_tp = call_tp;
600 /* Gets the call entity or NULL if this is no static call. */
601 ir_entity *be_Call_get_entity(const ir_node *call) {
602 be_call_attr_t *a = get_irn_attr(call);
603 assert(be_is_Call(call));
607 /* Sets the call entity. */
608 void be_Call_set_entity(ir_node *call, ir_entity *ent) {
609 be_call_attr_t *a = get_irn_attr(call);
610 assert(be_is_Call(call));
614 /* Gets the call type. */
615 ir_type *be_Call_get_type(ir_node *call) {
616 be_call_attr_t *a = get_irn_attr(call);
617 assert(be_is_Call(call));
621 /* Sets the call type. */
622 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
623 be_call_attr_t *a = get_irn_attr(call);
624 assert(be_is_Call(call));
625 a->call_tp = call_tp;
628 /* Construct a new be_Return. */
629 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
630 int n, ir_node *in[])
636 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL);
637 init_node_attr(res, -1);
638 for(i = 0; i < n; ++i) {
639 add_irn_n(res, in[i]);
640 add_register_req(res);
643 a = get_irn_attr(res);
644 a->num_ret_vals = n_res;
649 /* Returns the number of real returns values */
650 int be_Return_get_n_rets(ir_node *ret)
652 be_return_attr_t *a = get_irn_attr(ret);
653 return a->num_ret_vals;
656 int be_Return_append_node(ir_node *ret, ir_node *node)
660 pos = add_irn_n(ret, node);
661 add_register_req(ret);
666 ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, int offset)
673 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, sizeof(in) / sizeof(in[0]), in);
674 a = init_node_attr(irn, 1);
677 be_node_set_flags(irn, -1, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
679 /* Set output constraint to stack register. */
680 be_node_set_reg_class(irn, 0, sp->reg_class);
681 be_set_constr_single_reg(irn, BE_OUT_POS(0), sp);
682 be_node_set_irn_reg(NULL, irn, sp);
687 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
691 ir_node *in[be_pos_AddSP_last];
693 in[be_pos_AddSP_old_sp] = old_sp;
694 in[be_pos_AddSP_size] = sz;
696 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
697 a = init_node_attr(irn, be_pos_AddSP_last);
699 be_node_set_flags(irn, OUT_POS(pn_be_AddSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
701 /* Set output constraint to stack register. */
702 be_set_constr_single_reg(irn, be_pos_AddSP_old_sp, sp);
703 be_node_set_reg_class(irn, be_pos_AddSP_size, arch_register_get_class(sp));
704 be_set_constr_single_reg(irn, OUT_POS(pn_be_AddSP_res), sp);
705 a->reg_data[pn_be_AddSP_res].reg = sp;
710 ir_node *be_new_SubSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
714 ir_node *in[be_pos_SubSP_last];
716 in[be_pos_SubSP_old_sp] = old_sp;
717 in[be_pos_SubSP_size] = sz;
719 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
720 a = init_node_attr(irn, be_pos_SubSP_last);
722 be_node_set_flags(irn, OUT_POS(pn_be_SubSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
724 /* Set output constraint to stack register. */
725 be_set_constr_single_reg(irn, be_pos_SubSP_old_sp, sp);
726 be_node_set_reg_class(irn, be_pos_SubSP_size, arch_register_get_class(sp));
727 be_set_constr_single_reg(irn, OUT_POS(pn_be_SubSP_res), sp);
728 a->reg_data[pn_be_SubSP_res].reg = sp;
733 ir_node *be_new_SetSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *op, ir_node *mem)
742 irn = new_ir_node(NULL, irg, bl, op_be_SetSP, get_irn_mode(old_sp), 3, in);
743 a = init_node_attr(irn, 3);
745 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
747 /* Set output constraint to stack register. */
748 be_set_constr_single_reg(irn, OUT_POS(0), sp);
749 be_node_set_reg_class(irn, be_pos_AddSP_size, sp->reg_class);
750 be_node_set_reg_class(irn, be_pos_AddSP_old_sp, sp->reg_class);
755 ir_node *be_new_StackParam(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *frame_pointer, ir_entity *ent)
761 in[0] = frame_pointer;
762 irn = new_ir_node(NULL, irg, bl, op_be_StackParam, mode, 1, in);
763 a = init_node_attr(irn, 1);
766 be_node_set_reg_class(irn, 0, cls_frame);
767 be_node_set_reg_class(irn, OUT_POS(0), cls);
768 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_rematerializable);
773 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
778 res = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, NULL);
779 init_node_attr(res, -1);
780 for(i = 0; i < n_outs; ++i)
781 add_register_req(res);
786 ir_node *be_RegParams_append_out_reg(ir_node *regparams,
787 const arch_env_t *arch_env,
788 const arch_register_t *reg)
790 ir_graph *irg = get_irn_irg(regparams);
791 ir_node *block = get_nodes_block(regparams);
792 be_node_attr_t *attr = get_irn_attr(regparams);
793 const arch_register_class_t *cls = arch_register_get_class(reg);
794 ir_mode *mode = arch_register_class_mode(cls);
795 int n = ARR_LEN(attr->reg_data);
798 assert(be_is_RegParams(regparams));
799 proj = new_r_Proj(irg, block, regparams, mode, n);
800 add_register_req(regparams);
801 be_set_constr_single_reg(regparams, BE_OUT_POS(n), reg);
802 arch_set_irn_register(arch_env, proj, reg);
804 /* TODO decide, whether we need to set ignore/modify sp flags here? */
809 ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
810 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_entity *ent)
818 irn = new_ir_node(NULL, irg, bl, op_be_FrameLoad, mode_T, 2, in);
819 a = init_node_attr(irn, 3);
822 be_node_set_reg_class(irn, 1, cls_frame);
823 be_node_set_reg_class(irn, OUT_POS(pn_Load_res), cls_data);
827 ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
828 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, ir_entity *ent)
837 irn = new_ir_node(NULL, irg, bl, op_be_FrameStore, mode_T, 3, in);
838 a = init_node_attr(irn, 3);
841 be_node_set_reg_class(irn, 1, cls_frame);
842 be_node_set_reg_class(irn, 2, cls_data);
846 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent)
853 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
854 a = init_node_attr(irn, 1);
857 be_node_set_reg_class(irn, 0, cls_frame);
858 be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
860 return optimize_node(irn);
863 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)
866 ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0]));
869 memcpy(&in[1], in_keep, n * sizeof(in[0]));
870 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
871 init_node_attr(irn, n + 1);
872 be_node_set_reg_class(irn, OUT_POS(0), cls);
873 be_node_set_reg_class(irn, 0, cls);
878 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)
883 return be_new_CopyKeep(cls, irg, bl, src, 1, in, mode);
886 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
887 return get_irn_n(cpy, be_pos_CopyKeep_op);
890 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
891 set_irn_n(cpy, be_pos_CopyKeep_op, op);
894 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
899 res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
900 init_node_attr(res, -1);
901 for(i = 0; i < n; ++i) {
902 add_irn_n(res, in[i]);
903 add_register_req(res);
909 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
911 ir_graph *irg = get_irn_irg(barrier);
912 ir_node *block = get_nodes_block(barrier);
913 ir_mode *mode = get_irn_mode(node);
914 int n = add_irn_n(barrier, node);
916 ir_node *proj = new_r_Proj(irg, block, barrier, mode, n);
917 add_register_req(barrier);
922 int be_is_Spill (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill ; }
923 int be_is_Reload (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Reload ; }
924 int be_is_Copy (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Copy ; }
925 int be_is_CopyKeep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_CopyKeep ; }
926 int be_is_Perm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Perm ; }
927 int be_is_MemPerm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_MemPerm ; }
928 int be_is_Keep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Keep ; }
929 int be_is_Call (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Call ; }
930 int be_is_Return (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Return ; }
931 int be_is_IncSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_IncSP ; }
932 int be_is_SetSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SetSP ; }
933 int be_is_AddSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_AddSP ; }
934 int be_is_SubSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SubSP ; }
935 int be_is_RegParams (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_RegParams ; }
936 int be_is_StackParam (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_StackParam ; }
937 int be_is_FrameAddr (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameAddr ; }
938 int be_is_FrameLoad (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameLoad ; }
939 int be_is_FrameStore (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameStore ; }
940 int be_is_Barrier (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Barrier ; }
942 int be_has_frame_entity(const ir_node *irn)
944 switch(be_get_irn_opcode(irn)) {
957 ir_entity *be_get_frame_entity(const ir_node *irn)
959 if (be_has_frame_entity(irn)) {
960 be_frame_attr_t *a = get_irn_attr(irn);
966 int be_get_frame_offset(const ir_node *irn)
968 assert(is_be_node(irn));
969 if (be_has_frame_entity(irn)) {
970 be_frame_attr_t *a = get_irn_attr(irn);
976 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
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 attr->in_entities[n] = ent;
986 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
988 be_memperm_attr_t *attr = get_irn_attr(irn);
990 assert(be_is_MemPerm(irn));
991 assert(n < be_get_MemPerm_entity_arity(irn));
993 return attr->in_entities[n];
996 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
998 be_memperm_attr_t *attr = get_irn_attr(irn);
1000 assert(be_is_MemPerm(irn));
1001 assert(n < be_get_MemPerm_entity_arity(irn));
1003 attr->out_entities[n] = ent;
1006 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
1008 be_memperm_attr_t *attr = get_irn_attr(irn);
1010 assert(be_is_MemPerm(irn));
1011 assert(n < be_get_MemPerm_entity_arity(irn));
1013 return attr->out_entities[n];
1016 int be_get_MemPerm_entity_arity(const ir_node *irn)
1018 return get_irn_arity(irn) - 1;
1021 void be_set_constr_single_reg(ir_node *node, int pos, const arch_register_t *reg)
1023 arch_register_req_t *req = get_req(node, pos);
1024 const arch_register_class_t *cls = arch_register_get_class(reg);
1025 ir_graph *irg = get_irn_irg(node);
1026 struct obstack *obst = get_irg_obstack(irg);
1027 unsigned *limited_bitset;
1029 assert(req->cls == NULL || req->cls == cls);
1030 assert(! (req->type & arch_register_req_type_limited));
1031 assert(req->limited == NULL);
1033 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
1034 rbitset_set(limited_bitset, arch_register_get_index(reg));
1037 req->type |= arch_register_req_type_limited;
1038 req->limited = limited_bitset;
1041 void be_set_constr_limited(ir_node *node, int pos, const arch_register_req_t *req)
1043 ir_graph *irg = get_irn_irg(node);
1044 struct obstack *obst = get_irg_obstack(irg);
1045 arch_register_req_t *r = get_req(node, pos);
1047 assert(arch_register_req_is(req, limited));
1048 assert(! (req->type & (arch_register_req_type_should_be_same | arch_register_req_type_should_be_different)));
1049 memcpy(r, req, sizeof(r[0]));
1050 r->limited = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1053 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
1055 be_req_t *bereq = get_be_req(irn, pos);
1056 bereq->flags = flags;
1059 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
1061 arch_register_req_t *req = get_req(irn, pos);
1066 req->type = arch_register_req_type_none;
1067 } else if (req->type == arch_register_req_type_none) {
1068 req->type = arch_register_req_type_normal;
1072 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
1074 arch_register_req_t *req = get_req(irn, pos);
1078 ir_node *be_get_IncSP_pred(ir_node *irn) {
1079 assert(be_is_IncSP(irn));
1080 return get_irn_n(irn, 0);
1083 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
1084 assert(be_is_IncSP(incsp));
1085 set_irn_n(incsp, 0, pred);
1088 ir_node *be_get_IncSP_mem(ir_node *irn) {
1089 assert(be_is_IncSP(irn));
1090 return get_irn_n(irn, 1);
1093 void be_set_IncSP_offset(ir_node *irn, int offset)
1095 be_stack_attr_t *a = get_irn_attr(irn);
1096 assert(be_is_IncSP(irn));
1100 int be_get_IncSP_offset(const ir_node *irn)
1102 be_stack_attr_t *a = get_irn_attr(irn);
1103 assert(be_is_IncSP(irn));
1107 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn)
1109 ir_node *bl = get_nodes_block(irn);
1110 ir_graph *irg = get_irn_irg(bl);
1111 ir_node *frame = get_irg_frame(irg);
1112 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
1113 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
1116 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn);
1120 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)
1123 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
1124 ir_graph *irg = get_irn_irg(bl);
1125 ir_node *frame = get_irg_frame(irg);
1126 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
1128 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
1130 reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
1132 if (is_Block(insert)) {
1133 insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
1134 sched_add_after(insert, reload);
1136 sched_add_before(insert, reload);
1144 | _ \ ___ __ _ | _ \ ___ __ _ ___
1145 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
1146 | _ < __/ (_| | | _ < __/ (_| \__ \
1147 |_| \_\___|\__, | |_| \_\___|\__, |___/
1154 arch_register_req_t *get_out_reg_req(const ir_node *irn, int out_pos)
1156 const be_node_attr_t *a = get_irn_attr(irn);
1158 if(out_pos >= ARR_LEN(a->reg_data)) {
1159 return arch_no_register_req;
1162 return &a->reg_data[out_pos].req.req;
1166 arch_register_req_t *get_in_reg_req(const ir_node *irn, int pos)
1168 const be_node_attr_t *a = get_irn_attr(irn);
1170 if(pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
1171 return arch_no_register_req;
1173 return &a->reg_data[pos].in_req.req;
1176 static const arch_register_req_t *
1177 be_node_get_irn_reg_req(const void *self, const ir_node *irn, int pos)
1182 if (get_irn_mode(irn) == mode_T)
1183 return arch_no_register_req;
1185 out_pos = redir_proj((const ir_node **)&irn);
1186 assert(is_be_node(irn));
1187 return get_out_reg_req(irn, out_pos);
1188 } else if (is_be_node(irn)) {
1190 * For spills and reloads, we return "none" as requirement for frame
1191 * pointer, so every input is ok. Some backends need this (e.g. STA).
1193 if ((be_is_Spill(irn) && pos == be_pos_Spill_frame) ||
1194 (be_is_Reload(irn) && pos == be_pos_Reload_frame))
1195 return arch_no_register_req;
1197 return get_in_reg_req(irn, pos);
1200 return arch_no_register_req;
1203 const arch_register_t *
1204 be_node_get_irn_reg(const void *_self, const ir_node *irn)
1208 if (get_irn_mode(irn) == mode_T)
1210 r = retrieve_reg_data(irn);
1214 static arch_irn_class_t be_node_classify(const void *_self, const ir_node *irn)
1216 redir_proj((const ir_node **) &irn);
1218 switch(be_get_irn_opcode(irn)) {
1219 #define XXX(a,b) case beo_ ## a: return arch_irn_class_ ## b
1221 XXX(Reload, reload);
1224 XXX(Return, branch);
1225 XXX(StackParam, stackparam);
1228 return arch_irn_class_normal;
1234 static arch_irn_flags_t be_node_get_flags(const void *_self, const ir_node *node)
1240 pos = OUT_POS(get_Proj_proj(node));
1241 node = skip_Proj_const(node);
1244 bereq = get_be_req(node, pos);
1246 return bereq->flags;
1249 static ir_entity *be_node_get_frame_entity(const void *self, const ir_node *irn)
1251 return be_get_frame_entity(irn);
1254 static void be_node_set_frame_entity(const void *self, ir_node *irn, ir_entity *ent)
1258 assert(be_has_frame_entity(irn));
1260 a = get_irn_attr(irn);
1264 static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset)
1266 if(be_has_frame_entity(irn)) {
1267 be_frame_attr_t *a = get_irn_attr(irn);
1272 static int be_node_get_sp_bias(const void *self, const ir_node *irn)
1274 return be_is_IncSP(irn) ? be_get_IncSP_offset(irn) : 0;
1278 ___ ____ _ _ _ _ _ _
1279 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1280 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1281 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1282 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1286 static const arch_irn_ops_if_t be_node_irn_ops_if = {
1287 be_node_get_irn_reg_req,
1288 be_node_set_irn_reg,
1289 be_node_get_irn_reg,
1292 be_node_get_frame_entity,
1293 be_node_set_frame_entity,
1294 be_node_set_frame_offset,
1295 be_node_get_sp_bias,
1296 NULL, /* get_inverse */
1297 NULL, /* get_op_estimated_cost */
1298 NULL, /* possible_memory_operand */
1299 NULL, /* perform_memory_operand */
1302 static const arch_irn_ops_t be_node_irn_ops = {
1306 const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
1308 redir_proj((const ir_node **) &irn);
1309 return is_be_node(irn) ? &be_node_irn_ops : NULL;
1312 const arch_irn_handler_t be_node_irn_handler = {
1317 ____ _ _ ___ ____ _ _ _ _ _ _
1318 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1319 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1320 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1321 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1326 const arch_register_t *reg;
1327 arch_register_req_t req;
1328 arch_irn_flags_t flags;
1332 arch_irn_handler_t irn_handler;
1333 arch_irn_ops_t irn_ops;
1334 const arch_env_t *arch_env;
1338 #define get_phi_handler_from_handler(h) container_of(h, phi_handler_t, irn_handler)
1339 #define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops)
1342 const void *phi_get_irn_ops(const arch_irn_handler_t *handler,
1345 const phi_handler_t *h;
1346 if(!is_Phi(irn) || !mode_is_datab(get_irn_mode(irn)))
1349 h = get_phi_handler_from_handler(handler);
1354 phi_attr_t *get_Phi_attr(const phi_handler_t *handler, const ir_node *phi)
1356 phi_attr_t *attr = pmap_get(handler->phi_attrs, (void*) phi);
1358 ir_graph *irg = get_irn_irg(phi);
1359 struct obstack *obst = get_irg_obstack(irg);
1360 attr = obstack_alloc(obst, sizeof(attr[0]));
1361 memset(attr, 0, sizeof(attr[0]));
1362 pmap_insert(handler->phi_attrs, phi, attr);
1369 * Get register class of a Phi.
1372 const arch_register_req_t *get_Phi_reg_req_recursive(const phi_handler_t *h,
1376 int n = get_irn_arity(phi);
1380 if(*visited && pset_find_ptr(*visited, phi))
1383 for(i = 0; i < n; ++i) {
1384 op = get_irn_n(phi, i);
1385 /* Matze: don't we unnecessary constraint our phis with this?
1386 * we only need to take the regclass IMO*/
1388 return arch_get_register_req(h->arch_env, op, BE_OUT_POS(0));
1392 * The operands of that Phi were all Phis themselves.
1393 * We have to start a DFS for a non-Phi argument now.
1396 *visited = pset_new_ptr(16);
1398 pset_insert_ptr(*visited, phi);
1400 for(i = 0; i < n; ++i) {
1401 const arch_register_req_t *req;
1402 op = get_irn_n(phi, i);
1403 req = get_Phi_reg_req_recursive(h, op, visited);
1412 const arch_register_req_t *phi_get_irn_reg_req(const void *self,
1413 const ir_node *irn, int pos)
1415 phi_handler_t *phi_handler = get_phi_handler_from_ops(self);
1418 if(!mode_is_datab(get_irn_mode(irn)))
1419 return arch_no_register_req;
1421 attr = get_Phi_attr(phi_handler, irn);
1423 if(attr->req.type == arch_register_req_type_none) {
1424 pset *visited = NULL;
1425 const arch_register_req_t *req;
1426 req = get_Phi_reg_req_recursive(phi_handler, irn, &visited);
1428 memcpy(&attr->req, req, sizeof(req[0]));
1429 assert(attr->req.cls != NULL);
1430 attr->req.type = arch_register_req_type_normal;
1439 void be_set_phi_reg_req(const arch_env_t *arch_env, ir_node *node,
1440 const arch_register_req_t *req)
1442 const arch_irn_ops_t *ops = arch_get_irn_ops(arch_env, node);
1443 const phi_handler_t *handler = get_phi_handler_from_ops(ops);
1446 assert(mode_is_datab(get_irn_mode(node)));
1448 attr = get_Phi_attr(handler, node);
1449 memcpy(&attr->req, req, sizeof(req[0]));
1452 void be_set_phi_flags(const arch_env_t *arch_env, ir_node *node,
1453 arch_irn_flags_t flags)
1455 const arch_irn_ops_t *ops = arch_get_irn_ops(arch_env, node);
1456 const phi_handler_t *handler = get_phi_handler_from_ops(ops);
1459 assert(mode_is_datab(get_irn_mode(node)));
1461 attr = get_Phi_attr(handler, node);
1462 attr->flags = flags;
1466 void phi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1468 phi_handler_t *h = get_phi_handler_from_ops(self);
1469 phi_attr_t *attr = get_Phi_attr(h, irn);
1474 const arch_register_t *phi_get_irn_reg(const void *self, const ir_node *irn)
1476 phi_handler_t *h = get_phi_handler_from_ops(self);
1477 phi_attr_t *attr = get_Phi_attr(h, irn);
1482 arch_irn_class_t phi_classify(const void *self, const ir_node *irn)
1484 return arch_irn_class_normal;
1488 arch_irn_flags_t phi_get_flags(const void *self, const ir_node *irn)
1490 phi_handler_t *h = get_phi_handler_from_ops(self);
1491 phi_attr_t *attr = get_Phi_attr(h, irn);
1496 ir_entity *phi_get_frame_entity(const void *_self, const ir_node *irn)
1502 void phi_set_frame_entity(const void *_self, ir_node *irn, ir_entity *ent)
1508 void phi_set_frame_offset(const void *_self, ir_node *irn, int bias)
1514 int phi_get_sp_bias(const void* self, const ir_node *irn)
1520 const arch_irn_ops_if_t phi_irn_ops = {
1521 phi_get_irn_reg_req,
1526 phi_get_frame_entity,
1527 phi_set_frame_entity,
1528 phi_set_frame_offset,
1530 NULL, /* get_inverse */
1531 NULL, /* get_op_estimated_cost */
1532 NULL, /* possible_memory_operand */
1533 NULL, /* perform_memory_operand */
1536 arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env)
1538 phi_handler_t *h = xmalloc(sizeof(h[0]));
1539 h->irn_handler.get_irn_ops = phi_get_irn_ops;
1540 h->irn_ops.impl = &phi_irn_ops;
1541 h->arch_env = arch_env;
1542 h->phi_attrs = pmap_create();
1543 return (arch_irn_handler_t *) h;
1546 void be_phi_handler_free(arch_irn_handler_t *handler)
1548 phi_handler_t *h = (void *) handler;
1549 pmap_destroy(h->phi_attrs);
1553 void be_phi_handler_reset(arch_irn_handler_t *handler)
1555 phi_handler_t *h = get_phi_handler_from_handler(handler);
1557 pmap_destroy(h->phi_attrs);
1558 h->phi_attrs = pmap_create();
1563 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1564 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1565 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1566 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1571 * Dumps a register requirement to a file.
1573 static void dump_node_req(FILE *f, int idx, const arch_register_req_t *req,
1574 const ir_node *node)
1576 int did_something = 0;
1578 const char *prefix = buf;
1580 snprintf(buf, sizeof(buf), "#%d ", idx);
1581 buf[sizeof(buf) - 1] = '\0';
1586 arch_register_req_format(tmp, sizeof(tmp), req, node);
1587 fprintf(f, "%s", tmp);
1596 * Dumps node register requirements to a file.
1598 static void dump_node_reqs(FILE *f, ir_node *node)
1601 be_node_attr_t *a = get_irn_attr(node);
1602 int len = ARR_LEN(a->reg_data);
1604 fprintf(f, "registers: \n");
1605 for(i = 0; i < len; ++i) {
1606 be_reg_data_t *rd = &a->reg_data[i];
1608 fprintf(f, "#%d: %s\n", i, rd->reg->name);
1611 fprintf(f, "in requirements:\n");
1612 for(i = 0; i < len; ++i) {
1613 dump_node_req(f, i, &a->reg_data[i].in_req.req, node);
1616 fprintf(f, "\nout requirements:\n");
1617 for(i = 0; i < len; ++i) {
1618 dump_node_req(f, i, &a->reg_data[i].req.req, node);
1623 * ir_op-Operation: dump a be node to file
1625 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1627 be_node_attr_t *at = get_irn_attr(irn);
1629 assert(is_be_node(irn));
1632 case dump_node_opcode_txt:
1633 fprintf(f, get_op_name(get_irn_op(irn)));
1635 case dump_node_mode_txt:
1636 fprintf(f, get_mode_name(get_irn_mode(irn)));
1638 case dump_node_nodeattr_txt:
1640 case dump_node_info_txt:
1641 dump_node_reqs(f, irn);
1643 if(be_has_frame_entity(irn)) {
1644 be_frame_attr_t *a = (be_frame_attr_t *) at;
1646 int bits = get_type_size_bits(get_entity_type(a->ent));
1647 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bits\n",
1648 a->ent, a->offset, a->offset, bits, bits);
1653 switch(be_get_irn_opcode(irn)) {
1656 be_stack_attr_t *a = (be_stack_attr_t *) at;
1657 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1658 fprintf(f, "offset: FRAME_SIZE\n");
1659 else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1660 fprintf(f, "offset: -FRAME SIZE\n");
1662 fprintf(f, "offset: %u\n", a->offset);
1667 be_call_attr_t *a = (be_call_attr_t *) at;
1670 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1676 for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1677 ir_entity *in, *out;
1678 in = be_get_MemPerm_in_entity(irn, i);
1679 out = be_get_MemPerm_out_entity(irn, i);
1681 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1684 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1700 * Copies the backend specific attributes from old node to new node.
1702 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1704 be_node_attr_t *old_attr = get_irn_attr(old_node);
1705 be_node_attr_t *new_attr = get_irn_attr(new_node);
1706 struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
1709 assert(is_be_node(old_node));
1710 assert(is_be_node(new_node));
1712 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1713 new_attr->reg_data = NULL;
1715 if(old_attr->reg_data != NULL)
1716 len = ARR_LEN(old_attr->reg_data);
1720 if(get_irn_op(old_node)->opar == oparity_dynamic
1721 || be_is_RegParams(old_node)) {
1722 new_attr->reg_data = NEW_ARR_F(be_reg_data_t, len);
1724 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, len);
1728 memcpy(new_attr->reg_data, old_attr->reg_data, len * sizeof(be_reg_data_t));
1729 for(i = 0; i < len; ++i) {
1730 const be_reg_data_t *rd = &old_attr->reg_data[i];
1731 be_reg_data_t *newrd = &new_attr->reg_data[i];
1732 if(arch_register_req_is(&rd->req.req, limited)) {
1733 const arch_register_req_t *req = &rd->req.req;
1734 arch_register_req_t *new_req = &newrd->req.req;
1736 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1738 if(arch_register_req_is(&rd->in_req.req, limited)) {
1739 const arch_register_req_t *req = &rd->in_req.req;
1740 arch_register_req_t *new_req = &newrd->in_req.req;
1742 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1748 static const ir_op_ops be_node_op_ops = {