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_Barrier;
134 static int beo_base = -1;
136 static const ir_op_ops be_node_op_ops;
138 #define N irop_flag_none
139 #define L irop_flag_labeled
140 #define C irop_flag_commutative
141 #define X irop_flag_cfopcode
142 #define I irop_flag_ip_cfopcode
143 #define F irop_flag_fragile
144 #define Y irop_flag_forking
145 #define H irop_flag_highlevel
146 #define c irop_flag_constlike
147 #define K irop_flag_keep
148 #define M irop_flag_machine
152 * Compare two node attributes.
154 * @return zero if both attributes are identically
156 static int _node_cmp_attr(be_node_attr_t *a, be_node_attr_t *b) {
159 if(ARR_LEN(a->reg_data) != ARR_LEN(b->reg_data))
162 len = ARR_LEN(a->reg_data);
163 for (i = 0; i < len; ++i) {
164 if (a->reg_data[i].reg != b->reg_data[i].reg ||
165 memcmp(&a->reg_data[i].in_req, &b->reg_data[i].in_req, sizeof(b->reg_data[i].in_req)) ||
166 memcmp(&a->reg_data[i].req, &b->reg_data[i].req, sizeof(a->reg_data[i].req)))
173 static int node_cmp_attr(ir_node *a, ir_node *b) {
174 be_node_attr_t *a_attr = get_irn_attr(a);
175 be_node_attr_t *b_attr = get_irn_attr(b);
177 return _node_cmp_attr(a_attr, b_attr);
181 * Compare the attributes of two FrameAddr nodes.
183 * @return zero if both attributes are identically
185 static int FrameAddr_cmp_attr(ir_node *a, ir_node *b) {
186 be_frame_attr_t *a_attr = get_irn_attr(a);
187 be_frame_attr_t *b_attr = get_irn_attr(b);
189 if (a_attr->ent != b_attr->ent || a_attr->offset != b_attr->offset)
192 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
195 static int Return_cmp_attr(ir_node *a, ir_node *b) {
196 be_return_attr_t *a_attr = get_irn_attr(a);
197 be_return_attr_t *b_attr = get_irn_attr(b);
199 if (a_attr->num_ret_vals != b_attr->num_ret_vals)
202 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
205 static int Stack_cmp_attr(ir_node *a, ir_node *b) {
206 be_stack_attr_t *a_attr = get_irn_attr(a);
207 be_stack_attr_t *b_attr = get_irn_attr(b);
209 if (a_attr->offset != b_attr->offset)
212 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
215 static int Call_cmp_attr(ir_node *a, ir_node *b) {
216 be_call_attr_t *a_attr = get_irn_attr(a);
217 be_call_attr_t *b_attr = get_irn_attr(b);
219 if (a_attr->ent != b_attr->ent ||
220 a_attr->call_tp != b_attr->call_tp)
223 return _node_cmp_attr((be_node_attr_t*) a_attr, (be_node_attr_t*) b_attr);
226 static INLINE be_req_t *get_be_req(const ir_node *node, int pos)
229 be_node_attr_t *attr;
232 assert(is_be_node(node));
233 attr = get_irn_attr(node);
239 assert(idx < get_irn_arity(node));
241 assert(idx < ARR_LEN(attr->reg_data));
242 rd = &attr->reg_data[idx];
244 return pos < 0 ? &rd->req : &rd->in_req;
247 static INLINE arch_register_req_t *get_req(const ir_node *node, int pos)
249 be_req_t *bereq = get_be_req(node, pos);
253 void be_node_init(void) {
254 static int inited = 0;
261 /* Acquire all needed opcodes. */
262 beo_base = get_next_ir_opcodes(beo_Last);
264 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);
265 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);
266 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);
267 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);
268 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);
269 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);
270 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);
271 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);
272 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);
273 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);
274 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);
275 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);
276 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);
277 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);
278 op_be_StackParam = new_ir_op(beo_base + beo_StackParam, "be_StackParam", op_pin_state_floats, N, oparity_unary, 0, sizeof(be_frame_attr_t), &be_node_op_ops);
279 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);
280 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);
282 set_op_tag(op_be_Spill, &be_node_tag);
283 op_be_Spill->ops.node_cmp_attr = FrameAddr_cmp_attr;
284 set_op_tag(op_be_Reload, &be_node_tag);
285 op_be_Reload->ops.node_cmp_attr = FrameAddr_cmp_attr;
286 set_op_tag(op_be_Perm, &be_node_tag);
287 op_be_Perm->ops.node_cmp_attr = node_cmp_attr;
288 set_op_tag(op_be_MemPerm, &be_node_tag);
289 op_be_MemPerm->ops.node_cmp_attr = node_cmp_attr;
290 set_op_tag(op_be_Copy, &be_node_tag);
291 op_be_Copy->ops.node_cmp_attr = node_cmp_attr;
292 set_op_tag(op_be_Keep, &be_node_tag);
293 op_be_Keep->ops.node_cmp_attr = node_cmp_attr;
294 set_op_tag(op_be_CopyKeep, &be_node_tag);
295 op_be_CopyKeep->ops.node_cmp_attr = node_cmp_attr;
296 set_op_tag(op_be_Call, &be_node_tag);
297 op_be_Call->ops.node_cmp_attr = Call_cmp_attr;
298 set_op_tag(op_be_Return, &be_node_tag);
299 op_be_Return->ops.node_cmp_attr = Return_cmp_attr;
300 set_op_tag(op_be_AddSP, &be_node_tag);
301 op_be_AddSP->ops.node_cmp_attr = node_cmp_attr;
302 set_op_tag(op_be_SubSP, &be_node_tag);
303 op_be_SubSP->ops.node_cmp_attr = node_cmp_attr;
304 set_op_tag(op_be_SetSP, &be_node_tag);
305 op_be_SetSP->ops.node_cmp_attr = Stack_cmp_attr;
306 set_op_tag(op_be_IncSP, &be_node_tag);
307 op_be_IncSP->ops.node_cmp_attr = Stack_cmp_attr;
308 set_op_tag(op_be_RegParams, &be_node_tag);
309 op_be_RegParams->ops.node_cmp_attr = node_cmp_attr;
310 set_op_tag(op_be_StackParam, &be_node_tag);
311 op_be_StackParam->ops.node_cmp_attr = FrameAddr_cmp_attr;
312 set_op_tag(op_be_FrameAddr, &be_node_tag);
313 op_be_FrameAddr->ops.node_cmp_attr = FrameAddr_cmp_attr;
314 set_op_tag(op_be_Barrier, &be_node_tag);
315 op_be_Barrier->ops.node_cmp_attr = node_cmp_attr;
319 * Initializes the generic attribute of all be nodes and return ir.
321 static void *init_node_attr(ir_node *node, int max_reg_data)
323 ir_graph *irg = get_irn_irg(node);
324 struct obstack *obst = get_irg_obstack(irg);
325 be_node_attr_t *a = get_irn_attr(node);
327 memset(a, 0, sizeof(get_op_attr_size(get_irn_op(node))));
329 if(max_reg_data >= 0) {
330 a->reg_data = NEW_ARR_D(be_reg_data_t, obst, max_reg_data);
331 memset(a->reg_data, 0, max_reg_data * sizeof(a->reg_data[0]));
333 a->reg_data = NEW_ARR_F(be_reg_data_t, 0);
339 static void add_register_req(ir_node *node)
341 be_node_attr_t *a = get_irn_attr(node);
342 be_reg_data_t regreq;
343 memset(®req, 0, sizeof(regreq));
344 ARR_APP1(be_reg_data_t, a->reg_data, regreq);
347 int is_be_node(const ir_node *irn)
349 return get_op_tag(get_irn_op(irn)) == &be_node_tag;
352 be_opcode_t be_get_irn_opcode(const ir_node *irn)
354 return is_be_node(irn) ? (be_opcode_t) get_irn_opcode(irn) - beo_base : beo_NoBeOp;
358 * Skip Proj nodes and return their Proj numbers.
360 * If *node is a Proj or Proj(Proj) node, skip it.
362 * @param node points to the node to be skipped
364 * @return 0 if *node was no Proj node, its Proj number else.
366 static int redir_proj(const ir_node **node)
368 const ir_node *n = *node;
373 *node = irn = get_Proj_pred(n);
375 assert(get_irn_mode(irn) == mode_T);
376 *node = get_Proj_pred(irn);
378 return get_Proj_proj(n);
384 static be_reg_data_t *retrieve_reg_data(const ir_node *node)
386 be_node_attr_t *attr;
390 pos = get_Proj_proj(node);
391 node = get_Proj_pred(node);
394 assert(is_be_node(node));
395 attr = get_irn_attr(node);
396 assert(pos >= 0 && pos < ARR_LEN(attr->reg_data) && "illegal proj number");
398 return &attr->reg_data[pos];
402 be_node_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
404 be_reg_data_t *r = retrieve_reg_data(irn);
409 ir_node *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
410 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *to_spill)
418 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
419 a = init_node_attr(res, 2);
423 be_node_set_reg_class(res, be_pos_Spill_frame, cls_frame);
424 be_node_set_reg_class(res, be_pos_Spill_val, cls);
428 ir_node *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
429 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode)
436 res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in);
438 init_node_attr(res, 2);
439 be_node_set_reg_class(res, -1, cls);
440 be_node_set_reg_class(res, be_pos_Reload_frame, cls_frame);
441 be_node_set_flags(res, -1, arch_irn_flags_rematerializable);
445 ir_node *be_get_Reload_mem(const ir_node *irn)
447 assert(be_is_Reload(irn));
448 return get_irn_n(irn, be_pos_Reload_mem);
451 ir_node *be_get_Reload_frame(const ir_node *irn)
453 assert(be_is_Reload(irn));
454 return get_irn_n(irn, be_pos_Reload_frame);
457 ir_node *be_get_Spill_val(const ir_node *irn)
459 assert(be_is_Spill(irn));
460 return get_irn_n(irn, be_pos_Spill_val);
463 ir_node *be_get_Spill_frame(const ir_node *irn)
465 assert(be_is_Spill(irn));
466 return get_irn_n(irn, be_pos_Spill_frame);
469 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
472 ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in);
473 init_node_attr(irn, n);
474 for(i = 0; i < n; ++i) {
475 be_node_set_reg_class(irn, i, cls);
476 be_node_set_reg_class(irn, OUT_POS(i), cls);
482 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
484 ir_graph *irg = get_irn_irg(perm);
485 int n = get_irn_arity(perm);
486 be_reg_data_t *old_data = xmalloc(n * sizeof(old_data[0]));
487 be_node_attr_t *attr = get_irn_attr(perm);
488 ir_node **new_in = NEW_ARR_D(ir_node *, irg->obst, new_size + 1);
492 assert(be_is_Perm(perm));
493 assert(new_size <= n);
495 /* save the old register data */
496 memcpy(old_data, attr->reg_data, n * sizeof(old_data[0]));
498 /* compose the new in array and set the new register data directly in place */
499 for (i = 0; i < n; ++i) {
502 new_in[idx] = get_irn_n(perm, i);
503 attr->reg_data[idx] = old_data[i];
508 set_irn_in(perm, new_size, new_in);
511 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
514 ir_node *frame = get_irg_frame(irg);
515 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
517 const arch_register_t *sp = arch_env->isa->sp;
518 be_memperm_attr_t *attr;
521 real_in = alloca((n+1) * sizeof(real_in[0]));
523 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
525 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
527 init_node_attr(irn, n + 1);
528 be_node_set_reg_class(irn, 0, sp->reg_class);
529 for(i = 0; i < n; ++i) {
530 be_node_set_reg_class(irn, i + 1, cls_frame);
531 be_node_set_reg_class(irn, OUT_POS(i), cls_frame);
534 attr = get_irn_attr(irn);
536 attr->in_entities = obstack_alloc(irg->obst, n * sizeof(attr->in_entities[0]));
537 memset(attr->in_entities, 0, n * sizeof(attr->in_entities[0]));
538 attr->out_entities = obstack_alloc(irg->obst, n*sizeof(attr->out_entities[0]));
539 memset(attr->out_entities, 0, n*sizeof(attr->out_entities[0]));
545 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
549 arch_register_req_t *req;
552 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
553 init_node_attr(res, 1);
554 be_node_set_reg_class(res, 0, cls);
555 be_node_set_reg_class(res, OUT_POS(0), cls);
557 req = get_req(res, OUT_POS(0));
559 req->type = arch_register_req_type_should_be_same;
565 ir_node *be_get_Copy_op(const ir_node *cpy) {
566 return get_irn_n(cpy, be_pos_Copy_op);
569 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
570 set_irn_n(cpy, be_pos_Copy_op, op);
573 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
578 res = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, -1, NULL);
579 init_node_attr(res, -1);
581 for(i = 0; i < n; ++i) {
582 add_irn_n(res, in[i]);
583 add_register_req(res);
584 be_node_set_reg_class(res, i, cls);
591 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
595 assert(be_is_Keep(keep));
596 n = add_irn_n(keep, node);
597 add_register_req(keep);
598 be_node_set_reg_class(keep, n, cls);
601 /* creates a be_Call */
602 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
603 int n_outs, int n, ir_node *in[], ir_type *call_tp)
606 int real_n = be_pos_Call_first_arg + n;
610 NEW_ARR_A(ir_node *, real_in, real_n);
611 real_in[be_pos_Call_mem] = mem;
612 real_in[be_pos_Call_sp] = sp;
613 real_in[be_pos_Call_ptr] = ptr;
614 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
616 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
617 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
619 a->call_tp = call_tp;
623 /* Gets the call entity or NULL if this is no static call. */
624 ir_entity *be_Call_get_entity(const ir_node *call) {
625 be_call_attr_t *a = get_irn_attr(call);
626 assert(be_is_Call(call));
630 /* Sets the call entity. */
631 void be_Call_set_entity(ir_node *call, ir_entity *ent) {
632 be_call_attr_t *a = get_irn_attr(call);
633 assert(be_is_Call(call));
637 /* Gets the call type. */
638 ir_type *be_Call_get_type(ir_node *call) {
639 be_call_attr_t *a = get_irn_attr(call);
640 assert(be_is_Call(call));
644 /* Sets the call type. */
645 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
646 be_call_attr_t *a = get_irn_attr(call);
647 assert(be_is_Call(call));
648 a->call_tp = call_tp;
651 /* Construct a new be_Return. */
652 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
653 int n, ir_node *in[])
659 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL);
660 init_node_attr(res, -1);
661 for(i = 0; i < n; ++i) {
662 add_irn_n(res, in[i]);
663 add_register_req(res);
666 a = get_irn_attr(res);
667 a->num_ret_vals = n_res;
672 /* Returns the number of real returns values */
673 int be_Return_get_n_rets(ir_node *ret)
675 be_return_attr_t *a = get_irn_attr(ret);
676 return a->num_ret_vals;
679 int be_Return_append_node(ir_node *ret, ir_node *node)
683 pos = add_irn_n(ret, node);
684 add_register_req(ret);
689 ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, int offset)
696 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, sizeof(in) / sizeof(in[0]), in);
697 a = init_node_attr(irn, 1);
700 be_node_set_flags(irn, -1, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
702 /* Set output constraint to stack register. */
703 be_node_set_reg_class(irn, 0, sp->reg_class);
704 be_set_constr_single_reg(irn, BE_OUT_POS(0), sp);
705 be_node_set_irn_reg(NULL, irn, sp);
710 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
714 ir_node *in[be_pos_AddSP_last];
715 const arch_register_class_t *class;
717 in[be_pos_AddSP_old_sp] = old_sp;
718 in[be_pos_AddSP_size] = sz;
720 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
721 a = init_node_attr(irn, be_pos_AddSP_last);
723 be_node_set_flags(irn, OUT_POS(pn_be_AddSP_sp),
724 arch_irn_flags_ignore | arch_irn_flags_modify_sp);
726 /* Set output constraint to stack register. */
727 be_set_constr_single_reg(irn, be_pos_AddSP_old_sp, sp);
728 be_node_set_reg_class(irn, be_pos_AddSP_size, arch_register_get_class(sp));
729 be_set_constr_single_reg(irn, OUT_POS(pn_be_AddSP_sp), sp);
730 a->reg_data[pn_be_AddSP_sp].reg = sp;
732 class = arch_register_get_class(sp);
733 be_node_set_reg_class(irn, OUT_POS(pn_be_AddSP_res), class);
738 ir_node *be_new_SubSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
742 ir_node *in[be_pos_SubSP_last];
744 in[be_pos_SubSP_old_sp] = old_sp;
745 in[be_pos_SubSP_size] = sz;
747 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
748 a = init_node_attr(irn, be_pos_SubSP_last);
750 be_node_set_flags(irn, OUT_POS(pn_be_SubSP_sp),
751 arch_irn_flags_ignore | arch_irn_flags_modify_sp);
753 /* Set output constraint to stack register. */
754 be_set_constr_single_reg(irn, be_pos_SubSP_old_sp, sp);
755 be_node_set_reg_class(irn, be_pos_SubSP_size, arch_register_get_class(sp));
756 be_set_constr_single_reg(irn, OUT_POS(pn_be_SubSP_sp), sp);
757 a->reg_data[pn_be_SubSP_sp].reg = sp;
762 ir_node *be_new_SetSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl,
763 ir_node *old_sp, ir_node *op, ir_node *mem)
772 irn = new_ir_node(NULL, irg, bl, op_be_SetSP, get_irn_mode(old_sp), 3, in);
773 a = init_node_attr(irn, 3);
775 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
777 /* Set output constraint to stack register. */
778 be_set_constr_single_reg(irn, OUT_POS(0), sp);
779 be_node_set_reg_class(irn, be_pos_AddSP_size, sp->reg_class);
780 be_node_set_reg_class(irn, be_pos_AddSP_old_sp, sp->reg_class);
785 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)
791 in[0] = frame_pointer;
792 irn = new_ir_node(NULL, irg, bl, op_be_StackParam, mode, 1, in);
793 a = init_node_attr(irn, 1);
796 be_node_set_reg_class(irn, 0, cls_frame);
797 be_node_set_reg_class(irn, OUT_POS(0), cls);
798 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_rematerializable);
803 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
808 res = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, NULL);
809 init_node_attr(res, -1);
810 for(i = 0; i < n_outs; ++i)
811 add_register_req(res);
816 ir_node *be_RegParams_append_out_reg(ir_node *regparams,
817 const arch_env_t *arch_env,
818 const arch_register_t *reg)
820 ir_graph *irg = get_irn_irg(regparams);
821 ir_node *block = get_nodes_block(regparams);
822 be_node_attr_t *attr = get_irn_attr(regparams);
823 const arch_register_class_t *cls = arch_register_get_class(reg);
824 ir_mode *mode = arch_register_class_mode(cls);
825 int n = ARR_LEN(attr->reg_data);
828 assert(be_is_RegParams(regparams));
829 proj = new_r_Proj(irg, block, regparams, mode, n);
830 add_register_req(regparams);
831 be_set_constr_single_reg(regparams, BE_OUT_POS(n), reg);
832 arch_set_irn_register(arch_env, proj, reg);
834 /* TODO decide, whether we need to set ignore/modify sp flags here? */
839 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent)
846 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
847 a = init_node_attr(irn, 1);
850 be_node_set_reg_class(irn, 0, cls_frame);
851 be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
853 return optimize_node(irn);
856 ir_node *be_get_FrameAddr_frame(ir_node *node) {
857 assert(be_is_FrameAddr(node));
858 return get_irn_n(node, be_pos_FrameAddr_ptr);
861 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)
864 ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0]));
867 memcpy(&in[1], in_keep, n * sizeof(in[0]));
868 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
869 init_node_attr(irn, n + 1);
870 be_node_set_reg_class(irn, OUT_POS(0), cls);
871 be_node_set_reg_class(irn, 0, cls);
876 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)
881 return be_new_CopyKeep(cls, irg, bl, src, 1, in, mode);
884 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
885 return get_irn_n(cpy, be_pos_CopyKeep_op);
888 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
889 set_irn_n(cpy, be_pos_CopyKeep_op, op);
892 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
897 res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
898 init_node_attr(res, -1);
899 for(i = 0; i < n; ++i) {
900 add_irn_n(res, in[i]);
901 add_register_req(res);
907 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
909 ir_graph *irg = get_irn_irg(barrier);
910 ir_node *block = get_nodes_block(barrier);
911 ir_mode *mode = get_irn_mode(node);
912 int n = add_irn_n(barrier, node);
914 ir_node *proj = new_r_Proj(irg, block, barrier, mode, n);
915 add_register_req(barrier);
920 int be_is_Spill (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill ; }
921 int be_is_Reload (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Reload ; }
922 int be_is_Copy (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Copy ; }
923 int be_is_CopyKeep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_CopyKeep ; }
924 int be_is_Perm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Perm ; }
925 int be_is_MemPerm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_MemPerm ; }
926 int be_is_Keep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Keep ; }
927 int be_is_Call (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Call ; }
928 int be_is_Return (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Return ; }
929 int be_is_IncSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_IncSP ; }
930 int be_is_SetSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SetSP ; }
931 int be_is_AddSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_AddSP ; }
932 int be_is_SubSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SubSP ; }
933 int be_is_RegParams (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_RegParams ; }
934 int be_is_StackParam (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_StackParam ; }
935 int be_is_FrameAddr (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameAddr ; }
936 int be_is_Barrier (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Barrier ; }
938 int be_has_frame_entity(const ir_node *irn)
940 switch(be_get_irn_opcode(irn)) {
951 ir_entity *be_get_frame_entity(const ir_node *irn)
953 if (be_has_frame_entity(irn)) {
954 be_frame_attr_t *a = get_irn_attr(irn);
960 int be_get_frame_offset(const ir_node *irn)
962 assert(is_be_node(irn));
963 if (be_has_frame_entity(irn)) {
964 be_frame_attr_t *a = get_irn_attr(irn);
970 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
972 be_memperm_attr_t *attr = get_irn_attr(irn);
974 assert(be_is_MemPerm(irn));
975 assert(n < be_get_MemPerm_entity_arity(irn));
977 attr->in_entities[n] = ent;
980 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
982 be_memperm_attr_t *attr = get_irn_attr(irn);
984 assert(be_is_MemPerm(irn));
985 assert(n < be_get_MemPerm_entity_arity(irn));
987 return attr->in_entities[n];
990 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
992 be_memperm_attr_t *attr = get_irn_attr(irn);
994 assert(be_is_MemPerm(irn));
995 assert(n < be_get_MemPerm_entity_arity(irn));
997 attr->out_entities[n] = ent;
1000 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
1002 be_memperm_attr_t *attr = get_irn_attr(irn);
1004 assert(be_is_MemPerm(irn));
1005 assert(n < be_get_MemPerm_entity_arity(irn));
1007 return attr->out_entities[n];
1010 int be_get_MemPerm_entity_arity(const ir_node *irn)
1012 return get_irn_arity(irn) - 1;
1015 void be_set_constr_single_reg(ir_node *node, int pos, const arch_register_t *reg)
1017 arch_register_req_t *req = get_req(node, pos);
1018 const arch_register_class_t *cls = arch_register_get_class(reg);
1019 ir_graph *irg = get_irn_irg(node);
1020 struct obstack *obst = get_irg_obstack(irg);
1021 unsigned *limited_bitset;
1023 assert(req->cls == NULL || req->cls == cls);
1024 assert(! (req->type & arch_register_req_type_limited));
1025 assert(req->limited == NULL);
1027 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
1028 rbitset_set(limited_bitset, arch_register_get_index(reg));
1031 req->type |= arch_register_req_type_limited;
1032 req->limited = limited_bitset;
1035 void be_set_constr_limited(ir_node *node, int pos, const arch_register_req_t *req)
1037 ir_graph *irg = get_irn_irg(node);
1038 struct obstack *obst = get_irg_obstack(irg);
1039 arch_register_req_t *r = get_req(node, pos);
1041 assert(arch_register_req_is(req, limited));
1042 assert(! (req->type & (arch_register_req_type_should_be_same | arch_register_req_type_should_be_different)));
1043 memcpy(r, req, sizeof(r[0]));
1044 r->limited = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1047 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
1049 be_req_t *bereq = get_be_req(irn, pos);
1050 bereq->flags = flags;
1053 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
1055 arch_register_req_t *req = get_req(irn, pos);
1060 req->type = arch_register_req_type_none;
1061 } else if (req->type == arch_register_req_type_none) {
1062 req->type = arch_register_req_type_normal;
1066 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
1068 arch_register_req_t *req = get_req(irn, pos);
1072 ir_node *be_get_IncSP_pred(ir_node *irn) {
1073 assert(be_is_IncSP(irn));
1074 return get_irn_n(irn, 0);
1077 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
1078 assert(be_is_IncSP(incsp));
1079 set_irn_n(incsp, 0, pred);
1082 ir_node *be_get_IncSP_mem(ir_node *irn) {
1083 assert(be_is_IncSP(irn));
1084 return get_irn_n(irn, 1);
1087 void be_set_IncSP_offset(ir_node *irn, int offset)
1089 be_stack_attr_t *a = get_irn_attr(irn);
1090 assert(be_is_IncSP(irn));
1094 int be_get_IncSP_offset(const ir_node *irn)
1096 be_stack_attr_t *a = get_irn_attr(irn);
1097 assert(be_is_IncSP(irn));
1101 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn)
1103 ir_node *bl = get_nodes_block(irn);
1104 ir_graph *irg = get_irn_irg(bl);
1105 ir_node *frame = get_irg_frame(irg);
1106 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
1107 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
1110 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn);
1114 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)
1117 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
1118 ir_graph *irg = get_irn_irg(bl);
1119 ir_node *frame = get_irg_frame(irg);
1120 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
1122 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
1124 reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
1126 if (is_Block(insert)) {
1127 insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
1128 sched_add_after(insert, reload);
1130 sched_add_before(insert, reload);
1138 | _ \ ___ __ _ | _ \ ___ __ _ ___
1139 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
1140 | _ < __/ (_| | | _ < __/ (_| \__ \
1141 |_| \_\___|\__, | |_| \_\___|\__, |___/
1148 arch_register_req_t *get_out_reg_req(const ir_node *irn, int out_pos)
1150 const be_node_attr_t *a = get_irn_attr(irn);
1152 if(out_pos >= ARR_LEN(a->reg_data)) {
1153 return arch_no_register_req;
1156 return &a->reg_data[out_pos].req.req;
1160 arch_register_req_t *get_in_reg_req(const ir_node *irn, int pos)
1162 const be_node_attr_t *a = get_irn_attr(irn);
1164 if(pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
1165 return arch_no_register_req;
1167 return &a->reg_data[pos].in_req.req;
1170 static const arch_register_req_t *
1171 be_node_get_irn_reg_req(const void *self, const ir_node *irn, int pos)
1177 if (get_irn_mode(irn) == mode_T)
1178 return arch_no_register_req;
1180 out_pos = redir_proj((const ir_node **)&irn);
1181 assert(is_be_node(irn));
1182 return get_out_reg_req(irn, out_pos);
1183 } else if (is_be_node(irn)) {
1185 * For spills and reloads, we return "none" as requirement for frame
1186 * pointer, so every input is ok. Some backends need this (e.g. STA).
1188 if ((be_is_Spill(irn) && pos == be_pos_Spill_frame) ||
1189 (be_is_Reload(irn) && pos == be_pos_Reload_frame))
1190 return arch_no_register_req;
1192 return get_in_reg_req(irn, pos);
1195 return arch_no_register_req;
1198 const arch_register_t *
1199 be_node_get_irn_reg(const void *self, const ir_node *irn)
1204 if (get_irn_mode(irn) == mode_T)
1206 r = retrieve_reg_data(irn);
1210 static arch_irn_class_t be_node_classify(const void *self, const ir_node *irn)
1212 redir_proj((const ir_node **) &irn);
1215 switch(be_get_irn_opcode(irn)) {
1216 #define XXX(a,b) case beo_ ## a: return arch_irn_class_ ## b
1218 XXX(Reload, reload);
1221 XXX(Return, branch);
1222 XXX(StackParam, stackparam);
1225 return arch_irn_class_normal;
1231 static arch_irn_flags_t be_node_get_flags(const void *self, const ir_node *node)
1238 pos = OUT_POS(get_Proj_proj(node));
1239 node = skip_Proj_const(node);
1242 bereq = get_be_req(node, pos);
1244 return bereq->flags;
1247 static ir_entity *be_node_get_frame_entity(const void *self, const ir_node *irn)
1250 return be_get_frame_entity(irn);
1253 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)
1267 if(be_has_frame_entity(irn)) {
1268 be_frame_attr_t *a = get_irn_attr(irn);
1273 static int be_node_get_sp_bias(const void *self, const ir_node *irn)
1276 return be_is_IncSP(irn) ? be_get_IncSP_offset(irn) : 0;
1280 ___ ____ _ _ _ _ _ _
1281 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1282 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1283 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1284 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1288 static const arch_irn_ops_if_t be_node_irn_ops_if = {
1289 be_node_get_irn_reg_req,
1290 be_node_set_irn_reg,
1291 be_node_get_irn_reg,
1294 be_node_get_frame_entity,
1295 be_node_set_frame_entity,
1296 be_node_set_frame_offset,
1297 be_node_get_sp_bias,
1298 NULL, /* get_inverse */
1299 NULL, /* get_op_estimated_cost */
1300 NULL, /* possible_memory_operand */
1301 NULL, /* perform_memory_operand */
1304 static const arch_irn_ops_t be_node_irn_ops = {
1308 const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
1310 redir_proj((const ir_node **) &irn);
1312 return is_be_node(irn) ? &be_node_irn_ops : NULL;
1315 const arch_irn_handler_t be_node_irn_handler = {
1320 ____ _ _ ___ ____ _ _ _ _ _ _
1321 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1322 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1323 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1324 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1329 const arch_register_t *reg;
1330 arch_register_req_t req;
1331 arch_irn_flags_t flags;
1335 arch_irn_handler_t irn_handler;
1336 arch_irn_ops_t irn_ops;
1337 const arch_env_t *arch_env;
1341 #define get_phi_handler_from_handler(h) container_of(h, phi_handler_t, irn_handler)
1342 #define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops)
1345 const void *phi_get_irn_ops(const arch_irn_handler_t *handler,
1348 const phi_handler_t *h;
1349 if(!is_Phi(irn) || !mode_is_datab(get_irn_mode(irn)))
1352 h = get_phi_handler_from_handler(handler);
1357 phi_attr_t *get_Phi_attr(const phi_handler_t *handler, const ir_node *phi)
1359 phi_attr_t *attr = pmap_get(handler->phi_attrs, (void*) phi);
1361 ir_graph *irg = get_irn_irg(phi);
1362 struct obstack *obst = get_irg_obstack(irg);
1363 attr = obstack_alloc(obst, sizeof(attr[0]));
1364 memset(attr, 0, sizeof(attr[0]));
1365 pmap_insert(handler->phi_attrs, phi, attr);
1372 * Get register class of a Phi.
1375 const arch_register_req_t *get_Phi_reg_req_recursive(const phi_handler_t *h,
1379 int n = get_irn_arity(phi);
1383 if(*visited && pset_find_ptr(*visited, phi))
1386 for(i = 0; i < n; ++i) {
1387 op = get_irn_n(phi, i);
1388 /* Matze: don't we unnecessary constraint our phis with this?
1389 * we only need to take the regclass IMO*/
1391 return arch_get_register_req(h->arch_env, op, BE_OUT_POS(0));
1395 * The operands of that Phi were all Phis themselves.
1396 * We have to start a DFS for a non-Phi argument now.
1399 *visited = pset_new_ptr(16);
1401 pset_insert_ptr(*visited, phi);
1403 for(i = 0; i < n; ++i) {
1404 const arch_register_req_t *req;
1405 op = get_irn_n(phi, i);
1406 req = get_Phi_reg_req_recursive(h, op, visited);
1415 const arch_register_req_t *phi_get_irn_reg_req(const void *self,
1416 const ir_node *irn, int pos)
1418 phi_handler_t *phi_handler = get_phi_handler_from_ops(self);
1423 if(!mode_is_datab(get_irn_mode(irn)))
1424 return arch_no_register_req;
1426 attr = get_Phi_attr(phi_handler, irn);
1428 if(attr->req.type == arch_register_req_type_none) {
1429 pset *visited = NULL;
1430 const arch_register_req_t *req;
1431 req = get_Phi_reg_req_recursive(phi_handler, irn, &visited);
1433 memcpy(&attr->req, req, sizeof(req[0]));
1434 assert(attr->req.cls != NULL);
1435 attr->req.type = arch_register_req_type_normal;
1444 void be_set_phi_reg_req(const arch_env_t *arch_env, ir_node *node,
1445 const arch_register_req_t *req)
1447 const arch_irn_ops_t *ops = arch_get_irn_ops(arch_env, node);
1448 const phi_handler_t *handler = get_phi_handler_from_ops(ops);
1451 assert(mode_is_datab(get_irn_mode(node)));
1453 attr = get_Phi_attr(handler, node);
1454 memcpy(&attr->req, req, sizeof(req[0]));
1457 void be_set_phi_flags(const arch_env_t *arch_env, ir_node *node,
1458 arch_irn_flags_t flags)
1460 const arch_irn_ops_t *ops = arch_get_irn_ops(arch_env, node);
1461 const phi_handler_t *handler = get_phi_handler_from_ops(ops);
1464 assert(mode_is_datab(get_irn_mode(node)));
1466 attr = get_Phi_attr(handler, node);
1467 attr->flags = flags;
1471 void phi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1473 phi_handler_t *h = get_phi_handler_from_ops(self);
1474 phi_attr_t *attr = get_Phi_attr(h, irn);
1479 const arch_register_t *phi_get_irn_reg(const void *self, const ir_node *irn)
1481 phi_handler_t *h = get_phi_handler_from_ops(self);
1482 phi_attr_t *attr = get_Phi_attr(h, irn);
1487 arch_irn_class_t phi_classify(const void *self, const ir_node *irn)
1491 return arch_irn_class_normal;
1495 arch_irn_flags_t phi_get_flags(const void *self, const ir_node *irn)
1497 phi_handler_t *h = get_phi_handler_from_ops(self);
1498 phi_attr_t *attr = get_Phi_attr(h, irn);
1504 ir_entity *phi_get_frame_entity(const void *self, const ir_node *irn)
1512 void phi_set_frame_entity(const void *self, ir_node *irn, ir_entity *ent)
1521 void phi_set_frame_offset(const void *self, ir_node *irn, int bias)
1530 int phi_get_sp_bias(const void* self, const ir_node *irn)
1538 const arch_irn_ops_if_t phi_irn_ops = {
1539 phi_get_irn_reg_req,
1544 phi_get_frame_entity,
1545 phi_set_frame_entity,
1546 phi_set_frame_offset,
1548 NULL, /* get_inverse */
1549 NULL, /* get_op_estimated_cost */
1550 NULL, /* possible_memory_operand */
1551 NULL, /* perform_memory_operand */
1554 arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env)
1556 phi_handler_t *h = xmalloc(sizeof(h[0]));
1557 h->irn_handler.get_irn_ops = phi_get_irn_ops;
1558 h->irn_ops.impl = &phi_irn_ops;
1559 h->arch_env = arch_env;
1560 h->phi_attrs = pmap_create();
1561 return (arch_irn_handler_t *) h;
1564 void be_phi_handler_free(arch_irn_handler_t *handler)
1566 phi_handler_t *h = get_phi_handler_from_handler(handler);
1567 pmap_destroy(h->phi_attrs);
1568 h->phi_attrs = NULL;
1572 void be_phi_handler_reset(arch_irn_handler_t *handler)
1574 phi_handler_t *h = get_phi_handler_from_handler(handler);
1576 pmap_destroy(h->phi_attrs);
1577 h->phi_attrs = pmap_create();
1582 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1583 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1584 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1585 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1590 * Dumps a register requirement to a file.
1592 static void dump_node_req(FILE *f, int idx, const arch_register_req_t *req,
1593 const ir_node *node)
1595 int did_something = 0;
1597 const char *prefix = buf;
1599 snprintf(buf, sizeof(buf), "#%d ", idx);
1600 buf[sizeof(buf) - 1] = '\0';
1605 arch_register_req_format(tmp, sizeof(tmp), req, node);
1606 fprintf(f, "%s", tmp);
1615 * Dumps node register requirements to a file.
1617 static void dump_node_reqs(FILE *f, ir_node *node)
1620 be_node_attr_t *a = get_irn_attr(node);
1621 int len = ARR_LEN(a->reg_data);
1623 fprintf(f, "registers: \n");
1624 for(i = 0; i < len; ++i) {
1625 be_reg_data_t *rd = &a->reg_data[i];
1627 fprintf(f, "#%d: %s\n", i, rd->reg->name);
1630 fprintf(f, "in requirements:\n");
1631 for(i = 0; i < len; ++i) {
1632 dump_node_req(f, i, &a->reg_data[i].in_req.req, node);
1635 fprintf(f, "\nout requirements:\n");
1636 for(i = 0; i < len; ++i) {
1637 dump_node_req(f, i, &a->reg_data[i].req.req, node);
1642 * ir_op-Operation: dump a be node to file
1644 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1646 be_node_attr_t *at = get_irn_attr(irn);
1648 assert(is_be_node(irn));
1651 case dump_node_opcode_txt:
1652 fprintf(f, get_op_name(get_irn_op(irn)));
1654 case dump_node_mode_txt:
1655 fprintf(f, get_mode_name(get_irn_mode(irn)));
1657 case dump_node_nodeattr_txt:
1658 if(be_is_Call(irn)) {
1659 be_call_attr_t *a = (be_call_attr_t *) at;
1661 fprintf(f, " [%s] ", get_entity_name(a->ent));
1664 case dump_node_info_txt:
1665 dump_node_reqs(f, irn);
1667 if(be_has_frame_entity(irn)) {
1668 be_frame_attr_t *a = (be_frame_attr_t *) at;
1670 int bits = get_type_size_bits(get_entity_type(a->ent));
1671 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bits\n",
1672 a->ent, a->offset, a->offset, bits, bits);
1677 switch(be_get_irn_opcode(irn)) {
1680 be_stack_attr_t *a = (be_stack_attr_t *) at;
1681 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1682 fprintf(f, "offset: FRAME_SIZE\n");
1683 else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1684 fprintf(f, "offset: -FRAME SIZE\n");
1686 fprintf(f, "offset: %u\n", a->offset);
1691 be_call_attr_t *a = (be_call_attr_t *) at;
1694 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1700 for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1701 ir_entity *in, *out;
1702 in = be_get_MemPerm_in_entity(irn, i);
1703 out = be_get_MemPerm_out_entity(irn, i);
1705 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1708 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1724 * Copies the backend specific attributes from old node to new node.
1726 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1728 be_node_attr_t *old_attr = get_irn_attr(old_node);
1729 be_node_attr_t *new_attr = get_irn_attr(new_node);
1730 struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
1733 assert(is_be_node(old_node));
1734 assert(is_be_node(new_node));
1736 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1737 new_attr->reg_data = NULL;
1739 if(old_attr->reg_data != NULL)
1740 len = ARR_LEN(old_attr->reg_data);
1744 if(get_irn_op(old_node)->opar == oparity_dynamic
1745 || be_is_RegParams(old_node)) {
1746 new_attr->reg_data = NEW_ARR_F(be_reg_data_t, len);
1748 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, len);
1752 memcpy(new_attr->reg_data, old_attr->reg_data, len * sizeof(be_reg_data_t));
1753 for(i = 0; i < len; ++i) {
1754 const be_reg_data_t *rd = &old_attr->reg_data[i];
1755 be_reg_data_t *newrd = &new_attr->reg_data[i];
1756 if(arch_register_req_is(&rd->req.req, limited)) {
1757 const arch_register_req_t *req = &rd->req.req;
1758 arch_register_req_t *new_req = &newrd->req.req;
1760 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1762 if(arch_register_req_is(&rd->in_req.req, limited)) {
1763 const arch_register_req_t *req = &rd->in_req.req;
1764 arch_register_req_t *new_req = &newrd->in_req.req;
1766 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1772 static const ir_op_ops be_node_op_ops = {