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_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_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_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_floats, 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_floats, 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_floats, 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_floats, 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) ? (be_opcode_t) 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);
417 ir_node *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
418 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *to_spill)
426 res = new_ir_node(NULL, irg, bl, op_be_Spill, mode_M, 2, in);
427 a = init_node_attr(res, 2);
431 be_node_set_reg_class(res, be_pos_Spill_frame, cls_frame);
432 be_node_set_reg_class(res, be_pos_Spill_val, cls);
436 ir_node *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
437 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode)
444 res = new_ir_node(NULL, irg, bl, op_be_Reload, mode, 2, in);
446 init_node_attr(res, 2);
447 be_node_set_reg_class(res, -1, cls);
448 be_node_set_reg_class(res, be_pos_Reload_frame, cls_frame);
449 be_node_set_flags(res, -1, arch_irn_flags_rematerializable);
453 ir_node *be_get_Reload_mem(const ir_node *irn)
455 assert(be_is_Reload(irn));
456 return get_irn_n(irn, be_pos_Reload_mem);
459 ir_node *be_get_Reload_frame(const ir_node *irn)
461 assert(be_is_Reload(irn));
462 return get_irn_n(irn, be_pos_Reload_frame);
465 ir_node *be_get_Spill_val(const ir_node *irn)
467 assert(be_is_Spill(irn));
468 return get_irn_n(irn, be_pos_Spill_val);
471 ir_node *be_get_Spill_frame(const ir_node *irn)
473 assert(be_is_Spill(irn));
474 return get_irn_n(irn, be_pos_Spill_frame);
477 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
480 ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Perm, mode_T, n, in);
481 init_node_attr(irn, n);
482 for(i = 0; i < n; ++i) {
483 be_node_set_reg_class(irn, i, cls);
484 be_node_set_reg_class(irn, OUT_POS(i), cls);
490 void be_Perm_reduce(ir_node *perm, int new_size, int *map)
492 ir_graph *irg = get_irn_irg(perm);
493 int n = get_irn_arity(perm);
494 be_reg_data_t *old_data = xmalloc(n * sizeof(old_data[0]));
495 be_node_attr_t *attr = get_irn_attr(perm);
496 ir_node **new_in = NEW_ARR_D(ir_node *, irg->obst, new_size + 1);
500 assert(be_is_Perm(perm));
501 assert(new_size <= n);
503 /* save the old register data */
504 memcpy(old_data, attr->reg_data, n * sizeof(old_data[0]));
506 /* compose the new in array and set the new register data directly in place */
507 for (i = 0; i < n; ++i) {
510 new_in[idx] = get_irn_n(perm, i);
511 attr->reg_data[idx] = old_data[i];
516 set_irn_in(perm, new_size, new_in);
519 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
522 ir_node *frame = get_irg_frame(irg);
523 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
525 const arch_register_t *sp = arch_env->isa->sp;
526 be_memperm_attr_t *attr;
529 real_in = alloca((n+1) * sizeof(real_in[0]));
531 memcpy(&real_in[1], in, n * sizeof(real_in[0]));
533 irn = new_ir_node(NULL, irg, bl, op_be_MemPerm, mode_T, n+1, real_in);
535 init_node_attr(irn, n + 1);
536 be_node_set_reg_class(irn, 0, sp->reg_class);
537 for(i = 0; i < n; ++i) {
538 be_node_set_reg_class(irn, i + 1, cls_frame);
539 be_node_set_reg_class(irn, OUT_POS(i), cls_frame);
542 attr = get_irn_attr(irn);
544 attr->in_entities = obstack_alloc(irg->obst, n * sizeof(attr->in_entities[0]));
545 memset(attr->in_entities, 0, n * sizeof(attr->in_entities[0]));
546 attr->out_entities = obstack_alloc(irg->obst, n*sizeof(attr->out_entities[0]));
547 memset(attr->out_entities, 0, n*sizeof(attr->out_entities[0]));
553 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *op)
557 arch_register_req_t *req;
560 res = new_ir_node(NULL, irg, bl, op_be_Copy, get_irn_mode(op), 1, in);
561 init_node_attr(res, 1);
562 be_node_set_reg_class(res, 0, cls);
563 be_node_set_reg_class(res, OUT_POS(0), cls);
565 req = get_req(res, OUT_POS(0));
567 req->type = arch_register_req_type_should_be_same;
573 ir_node *be_get_Copy_op(const ir_node *cpy) {
574 return get_irn_n(cpy, be_pos_Copy_op);
577 void be_set_Copy_op(ir_node *cpy, ir_node *op) {
578 set_irn_n(cpy, be_pos_Copy_op, op);
581 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int n, ir_node *in[])
586 res = new_ir_node(NULL, irg, bl, op_be_Keep, mode_ANY, -1, NULL);
587 init_node_attr(res, -1);
589 for(i = 0; i < n; ++i) {
590 add_irn_n(res, in[i]);
591 add_register_req(res);
592 be_node_set_reg_class(res, i, cls);
599 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
603 assert(be_is_Keep(keep));
604 n = add_irn_n(keep, node);
605 add_register_req(keep);
606 be_node_set_reg_class(keep, n, cls);
609 /* creates a be_Call */
610 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
611 int n_outs, int n, ir_node *in[], ir_type *call_tp)
614 int real_n = be_pos_Call_first_arg + n;
618 NEW_ARR_A(ir_node *, real_in, real_n);
619 real_in[be_pos_Call_mem] = mem;
620 real_in[be_pos_Call_sp] = sp;
621 real_in[be_pos_Call_ptr] = ptr;
622 memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0]));
624 irn = new_ir_node(dbg, irg, bl, op_be_Call, mode_T, real_n, real_in);
625 a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n));
627 a->call_tp = call_tp;
631 /* Gets the call entity or NULL if this is no static call. */
632 ir_entity *be_Call_get_entity(const ir_node *call) {
633 be_call_attr_t *a = get_irn_attr(call);
634 assert(be_is_Call(call));
638 /* Sets the call entity. */
639 void be_Call_set_entity(ir_node *call, ir_entity *ent) {
640 be_call_attr_t *a = get_irn_attr(call);
641 assert(be_is_Call(call));
645 /* Gets the call type. */
646 ir_type *be_Call_get_type(ir_node *call) {
647 be_call_attr_t *a = get_irn_attr(call);
648 assert(be_is_Call(call));
652 /* Sets the call type. */
653 void be_Call_set_type(ir_node *call, ir_type *call_tp) {
654 be_call_attr_t *a = get_irn_attr(call);
655 assert(be_is_Call(call));
656 a->call_tp = call_tp;
659 /* Construct a new be_Return. */
660 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
661 int n, ir_node *in[])
667 res = new_ir_node(dbg, irg, block, op_be_Return, mode_X, -1, NULL);
668 init_node_attr(res, -1);
669 for(i = 0; i < n; ++i) {
670 add_irn_n(res, in[i]);
671 add_register_req(res);
674 a = get_irn_attr(res);
675 a->num_ret_vals = n_res;
680 /* Returns the number of real returns values */
681 int be_Return_get_n_rets(ir_node *ret)
683 be_return_attr_t *a = get_irn_attr(ret);
684 return a->num_ret_vals;
687 int be_Return_append_node(ir_node *ret, ir_node *node)
691 pos = add_irn_n(ret, node);
692 add_register_req(ret);
697 ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, int offset)
704 irn = new_ir_node(NULL, irg, bl, op_be_IncSP, sp->reg_class->mode, sizeof(in) / sizeof(in[0]), in);
705 a = init_node_attr(irn, 1);
708 be_node_set_flags(irn, -1, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
710 /* Set output constraint to stack register. */
711 be_node_set_reg_class(irn, 0, sp->reg_class);
712 be_set_constr_single_reg(irn, BE_OUT_POS(0), sp);
713 be_node_set_irn_reg(NULL, irn, sp);
718 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
722 ir_node *in[be_pos_AddSP_last];
724 in[be_pos_AddSP_old_sp] = old_sp;
725 in[be_pos_AddSP_size] = sz;
727 irn = new_ir_node(NULL, irg, bl, op_be_AddSP, mode_T, be_pos_AddSP_last, in);
728 a = init_node_attr(irn, be_pos_AddSP_last);
730 be_node_set_flags(irn, OUT_POS(pn_be_AddSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
732 /* Set output constraint to stack register. */
733 be_set_constr_single_reg(irn, be_pos_AddSP_old_sp, sp);
734 be_node_set_reg_class(irn, be_pos_AddSP_size, arch_register_get_class(sp));
735 be_set_constr_single_reg(irn, OUT_POS(pn_be_AddSP_res), sp);
736 a->reg_data[pn_be_AddSP_res].reg = sp;
741 ir_node *be_new_SubSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz)
745 ir_node *in[be_pos_SubSP_last];
747 in[be_pos_SubSP_old_sp] = old_sp;
748 in[be_pos_SubSP_size] = sz;
750 irn = new_ir_node(NULL, irg, bl, op_be_SubSP, mode_T, be_pos_SubSP_last, in);
751 a = init_node_attr(irn, be_pos_SubSP_last);
753 be_node_set_flags(irn, OUT_POS(pn_be_SubSP_res), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
755 /* Set output constraint to stack register. */
756 be_set_constr_single_reg(irn, be_pos_SubSP_old_sp, sp);
757 be_node_set_reg_class(irn, be_pos_SubSP_size, arch_register_get_class(sp));
758 be_set_constr_single_reg(irn, OUT_POS(pn_be_SubSP_res), sp);
759 a->reg_data[pn_be_SubSP_res].reg = sp;
764 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)
773 irn = new_ir_node(NULL, irg, bl, op_be_SetSP, get_irn_mode(old_sp), 3, in);
774 a = init_node_attr(irn, 3);
776 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_ignore | arch_irn_flags_modify_sp);
778 /* Set output constraint to stack register. */
779 be_set_constr_single_reg(irn, OUT_POS(0), sp);
780 be_node_set_reg_class(irn, be_pos_AddSP_size, sp->reg_class);
781 be_node_set_reg_class(irn, be_pos_AddSP_old_sp, sp->reg_class);
786 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)
792 in[0] = frame_pointer;
793 irn = new_ir_node(NULL, irg, bl, op_be_StackParam, mode, 1, in);
794 a = init_node_attr(irn, 1);
797 be_node_set_reg_class(irn, 0, cls_frame);
798 be_node_set_reg_class(irn, OUT_POS(0), cls);
799 be_node_set_flags(irn, OUT_POS(0), arch_irn_flags_rematerializable);
804 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_outs)
809 res = new_ir_node(NULL, irg, bl, op_be_RegParams, mode_T, 0, NULL);
810 init_node_attr(res, -1);
811 for(i = 0; i < n_outs; ++i)
812 add_register_req(res);
817 ir_node *be_RegParams_append_out_reg(ir_node *regparams,
818 const arch_env_t *arch_env,
819 const arch_register_t *reg)
821 ir_graph *irg = get_irn_irg(regparams);
822 ir_node *block = get_nodes_block(regparams);
823 be_node_attr_t *attr = get_irn_attr(regparams);
824 const arch_register_class_t *cls = arch_register_get_class(reg);
825 ir_mode *mode = arch_register_class_mode(cls);
826 int n = ARR_LEN(attr->reg_data);
829 assert(be_is_RegParams(regparams));
830 proj = new_r_Proj(irg, block, regparams, mode, n);
831 add_register_req(regparams);
832 be_set_constr_single_reg(regparams, BE_OUT_POS(n), reg);
833 arch_set_irn_register(arch_env, proj, reg);
835 /* TODO decide, whether we need to set ignore/modify sp flags here? */
840 ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
841 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_entity *ent)
849 irn = new_ir_node(NULL, irg, bl, op_be_FrameLoad, mode_T, 2, in);
850 a = init_node_attr(irn, 3);
853 be_node_set_reg_class(irn, 1, cls_frame);
854 be_node_set_reg_class(irn, OUT_POS(pn_Load_res), cls_data);
858 ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
859 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, ir_entity *ent)
868 irn = new_ir_node(NULL, irg, bl, op_be_FrameStore, mode_T, 3, in);
869 a = init_node_attr(irn, 3);
872 be_node_set_reg_class(irn, 1, cls_frame);
873 be_node_set_reg_class(irn, 2, cls_data);
877 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent)
884 irn = new_ir_node(NULL, irg, bl, op_be_FrameAddr, get_irn_mode(frame), 1, in);
885 a = init_node_attr(irn, 1);
888 be_node_set_reg_class(irn, 0, cls_frame);
889 be_node_set_reg_class(irn, OUT_POS(0), cls_frame);
891 return optimize_node(irn);
894 ir_node *be_get_FrameAddr_frame(ir_node *node) {
895 assert(be_is_FrameAddr(node));
896 return get_irn_n(node, be_pos_FrameAddr_ptr);
899 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)
902 ir_node **in = (ir_node **) alloca((n + 1) * sizeof(in[0]));
905 memcpy(&in[1], in_keep, n * sizeof(in[0]));
906 irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
907 init_node_attr(irn, n + 1);
908 be_node_set_reg_class(irn, OUT_POS(0), cls);
909 be_node_set_reg_class(irn, 0, cls);
914 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)
919 return be_new_CopyKeep(cls, irg, bl, src, 1, in, mode);
922 ir_node *be_get_CopyKeep_op(const ir_node *cpy) {
923 return get_irn_n(cpy, be_pos_CopyKeep_op);
926 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op) {
927 set_irn_n(cpy, be_pos_CopyKeep_op, op);
930 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
935 res = new_ir_node(NULL, irg, bl, op_be_Barrier, mode_T, -1, NULL);
936 init_node_attr(res, -1);
937 for(i = 0; i < n; ++i) {
938 add_irn_n(res, in[i]);
939 add_register_req(res);
945 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node)
947 ir_graph *irg = get_irn_irg(barrier);
948 ir_node *block = get_nodes_block(barrier);
949 ir_mode *mode = get_irn_mode(node);
950 int n = add_irn_n(barrier, node);
952 ir_node *proj = new_r_Proj(irg, block, barrier, mode, n);
953 add_register_req(barrier);
958 int be_is_Spill (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Spill ; }
959 int be_is_Reload (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Reload ; }
960 int be_is_Copy (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Copy ; }
961 int be_is_CopyKeep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_CopyKeep ; }
962 int be_is_Perm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Perm ; }
963 int be_is_MemPerm (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_MemPerm ; }
964 int be_is_Keep (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Keep ; }
965 int be_is_Call (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Call ; }
966 int be_is_Return (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Return ; }
967 int be_is_IncSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_IncSP ; }
968 int be_is_SetSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SetSP ; }
969 int be_is_AddSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_AddSP ; }
970 int be_is_SubSP (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_SubSP ; }
971 int be_is_RegParams (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_RegParams ; }
972 int be_is_StackParam (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_StackParam ; }
973 int be_is_FrameAddr (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameAddr ; }
974 int be_is_FrameLoad (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameLoad ; }
975 int be_is_FrameStore (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_FrameStore ; }
976 int be_is_Barrier (const ir_node *irn) { return be_get_irn_opcode(irn) == beo_Barrier ; }
978 int be_has_frame_entity(const ir_node *irn)
980 switch(be_get_irn_opcode(irn)) {
993 ir_entity *be_get_frame_entity(const ir_node *irn)
995 if (be_has_frame_entity(irn)) {
996 be_frame_attr_t *a = get_irn_attr(irn);
1002 int be_get_frame_offset(const ir_node *irn)
1004 assert(is_be_node(irn));
1005 if (be_has_frame_entity(irn)) {
1006 be_frame_attr_t *a = get_irn_attr(irn);
1012 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity *ent)
1014 be_memperm_attr_t *attr = get_irn_attr(irn);
1016 assert(be_is_MemPerm(irn));
1017 assert(n < be_get_MemPerm_entity_arity(irn));
1019 attr->in_entities[n] = ent;
1022 ir_entity* be_get_MemPerm_in_entity(const ir_node* irn, int n)
1024 be_memperm_attr_t *attr = get_irn_attr(irn);
1026 assert(be_is_MemPerm(irn));
1027 assert(n < be_get_MemPerm_entity_arity(irn));
1029 return attr->in_entities[n];
1032 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity *ent)
1034 be_memperm_attr_t *attr = get_irn_attr(irn);
1036 assert(be_is_MemPerm(irn));
1037 assert(n < be_get_MemPerm_entity_arity(irn));
1039 attr->out_entities[n] = ent;
1042 ir_entity* be_get_MemPerm_out_entity(const ir_node* irn, int n)
1044 be_memperm_attr_t *attr = get_irn_attr(irn);
1046 assert(be_is_MemPerm(irn));
1047 assert(n < be_get_MemPerm_entity_arity(irn));
1049 return attr->out_entities[n];
1052 int be_get_MemPerm_entity_arity(const ir_node *irn)
1054 return get_irn_arity(irn) - 1;
1057 void be_set_constr_single_reg(ir_node *node, int pos, const arch_register_t *reg)
1059 arch_register_req_t *req = get_req(node, pos);
1060 const arch_register_class_t *cls = arch_register_get_class(reg);
1061 ir_graph *irg = get_irn_irg(node);
1062 struct obstack *obst = get_irg_obstack(irg);
1063 unsigned *limited_bitset;
1065 assert(req->cls == NULL || req->cls == cls);
1066 assert(! (req->type & arch_register_req_type_limited));
1067 assert(req->limited == NULL);
1069 limited_bitset = rbitset_obstack_alloc(obst, arch_register_class_n_regs(cls));
1070 rbitset_set(limited_bitset, arch_register_get_index(reg));
1073 req->type |= arch_register_req_type_limited;
1074 req->limited = limited_bitset;
1077 void be_set_constr_limited(ir_node *node, int pos, const arch_register_req_t *req)
1079 ir_graph *irg = get_irn_irg(node);
1080 struct obstack *obst = get_irg_obstack(irg);
1081 arch_register_req_t *r = get_req(node, pos);
1083 assert(arch_register_req_is(req, limited));
1084 assert(! (req->type & (arch_register_req_type_should_be_same | arch_register_req_type_should_be_different)));
1085 memcpy(r, req, sizeof(r[0]));
1086 r->limited = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1089 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags)
1091 be_req_t *bereq = get_be_req(irn, pos);
1092 bereq->flags = flags;
1095 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls)
1097 arch_register_req_t *req = get_req(irn, pos);
1102 req->type = arch_register_req_type_none;
1103 } else if (req->type == arch_register_req_type_none) {
1104 req->type = arch_register_req_type_normal;
1108 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type)
1110 arch_register_req_t *req = get_req(irn, pos);
1114 ir_node *be_get_IncSP_pred(ir_node *irn) {
1115 assert(be_is_IncSP(irn));
1116 return get_irn_n(irn, 0);
1119 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred) {
1120 assert(be_is_IncSP(incsp));
1121 set_irn_n(incsp, 0, pred);
1124 ir_node *be_get_IncSP_mem(ir_node *irn) {
1125 assert(be_is_IncSP(irn));
1126 return get_irn_n(irn, 1);
1129 void be_set_IncSP_offset(ir_node *irn, int offset)
1131 be_stack_attr_t *a = get_irn_attr(irn);
1132 assert(be_is_IncSP(irn));
1136 int be_get_IncSP_offset(const ir_node *irn)
1138 be_stack_attr_t *a = get_irn_attr(irn);
1139 assert(be_is_IncSP(irn));
1143 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn)
1145 ir_node *bl = get_nodes_block(irn);
1146 ir_graph *irg = get_irn_irg(bl);
1147 ir_node *frame = get_irg_frame(irg);
1148 const arch_register_class_t *cls = arch_get_irn_reg_class(arch_env, irn, -1);
1149 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
1152 spill = be_new_Spill(cls, cls_frame, irg, bl, frame, irn);
1156 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)
1159 ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert);
1160 ir_graph *irg = get_irn_irg(bl);
1161 ir_node *frame = get_irg_frame(irg);
1162 const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1);
1164 assert(be_is_Spill(spill) || (is_Phi(spill) && get_irn_mode(spill) == mode_M));
1166 reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode);
1168 if (is_Block(insert)) {
1169 insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env);
1170 sched_add_after(insert, reload);
1172 sched_add_before(insert, reload);
1180 | _ \ ___ __ _ | _ \ ___ __ _ ___
1181 | |_) / _ \/ _` | | |_) / _ \/ _` / __|
1182 | _ < __/ (_| | | _ < __/ (_| \__ \
1183 |_| \_\___|\__, | |_| \_\___|\__, |___/
1190 arch_register_req_t *get_out_reg_req(const ir_node *irn, int out_pos)
1192 const be_node_attr_t *a = get_irn_attr(irn);
1194 if(out_pos >= ARR_LEN(a->reg_data)) {
1195 return arch_no_register_req;
1198 return &a->reg_data[out_pos].req.req;
1202 arch_register_req_t *get_in_reg_req(const ir_node *irn, int pos)
1204 const be_node_attr_t *a = get_irn_attr(irn);
1206 if(pos >= get_irn_arity(irn) || pos >= ARR_LEN(a->reg_data))
1207 return arch_no_register_req;
1209 return &a->reg_data[pos].in_req.req;
1212 static const arch_register_req_t *
1213 be_node_get_irn_reg_req(const void *self, const ir_node *irn, int pos)
1219 if (get_irn_mode(irn) == mode_T)
1220 return arch_no_register_req;
1222 out_pos = redir_proj((const ir_node **)&irn);
1223 assert(is_be_node(irn));
1224 return get_out_reg_req(irn, out_pos);
1225 } else if (is_be_node(irn)) {
1227 * For spills and reloads, we return "none" as requirement for frame
1228 * pointer, so every input is ok. Some backends need this (e.g. STA).
1230 if ((be_is_Spill(irn) && pos == be_pos_Spill_frame) ||
1231 (be_is_Reload(irn) && pos == be_pos_Reload_frame))
1232 return arch_no_register_req;
1234 return get_in_reg_req(irn, pos);
1237 return arch_no_register_req;
1240 const arch_register_t *
1241 be_node_get_irn_reg(const void *self, const ir_node *irn)
1246 if (get_irn_mode(irn) == mode_T)
1248 r = retrieve_reg_data(irn);
1252 static arch_irn_class_t be_node_classify(const void *self, const ir_node *irn)
1254 redir_proj((const ir_node **) &irn);
1257 switch(be_get_irn_opcode(irn)) {
1258 #define XXX(a,b) case beo_ ## a: return arch_irn_class_ ## b
1260 XXX(Reload, reload);
1263 XXX(Return, branch);
1264 XXX(StackParam, stackparam);
1267 return arch_irn_class_normal;
1273 static arch_irn_flags_t be_node_get_flags(const void *self, const ir_node *node)
1280 pos = OUT_POS(get_Proj_proj(node));
1281 node = skip_Proj_const(node);
1284 bereq = get_be_req(node, pos);
1286 return bereq->flags;
1289 static ir_entity *be_node_get_frame_entity(const void *self, const ir_node *irn)
1292 return be_get_frame_entity(irn);
1295 static void be_node_set_frame_entity(const void *self, ir_node *irn, ir_entity *ent)
1300 assert(be_has_frame_entity(irn));
1302 a = get_irn_attr(irn);
1306 static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset)
1309 if(be_has_frame_entity(irn)) {
1310 be_frame_attr_t *a = get_irn_attr(irn);
1315 static int be_node_get_sp_bias(const void *self, const ir_node *irn)
1318 return be_is_IncSP(irn) ? be_get_IncSP_offset(irn) : 0;
1322 ___ ____ _ _ _ _ _ _
1323 |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1324 | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1325 | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1326 |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1330 static const arch_irn_ops_if_t be_node_irn_ops_if = {
1331 be_node_get_irn_reg_req,
1332 be_node_set_irn_reg,
1333 be_node_get_irn_reg,
1336 be_node_get_frame_entity,
1337 be_node_set_frame_entity,
1338 be_node_set_frame_offset,
1339 be_node_get_sp_bias,
1340 NULL, /* get_inverse */
1341 NULL, /* get_op_estimated_cost */
1342 NULL, /* possible_memory_operand */
1343 NULL, /* perform_memory_operand */
1346 static const arch_irn_ops_t be_node_irn_ops = {
1350 const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn)
1352 redir_proj((const ir_node **) &irn);
1354 return is_be_node(irn) ? &be_node_irn_ops : NULL;
1357 const arch_irn_handler_t be_node_irn_handler = {
1362 ____ _ _ ___ ____ _ _ _ _ _ _
1363 | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __
1364 | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__|
1365 | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ |
1366 |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1371 const arch_register_t *reg;
1372 arch_register_req_t req;
1373 arch_irn_flags_t flags;
1377 arch_irn_handler_t irn_handler;
1378 arch_irn_ops_t irn_ops;
1379 const arch_env_t *arch_env;
1383 #define get_phi_handler_from_handler(h) container_of(h, phi_handler_t, irn_handler)
1384 #define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops)
1387 const void *phi_get_irn_ops(const arch_irn_handler_t *handler,
1390 const phi_handler_t *h;
1391 if(!is_Phi(irn) || !mode_is_datab(get_irn_mode(irn)))
1394 h = get_phi_handler_from_handler(handler);
1399 phi_attr_t *get_Phi_attr(const phi_handler_t *handler, const ir_node *phi)
1401 phi_attr_t *attr = pmap_get(handler->phi_attrs, (void*) phi);
1403 ir_graph *irg = get_irn_irg(phi);
1404 struct obstack *obst = get_irg_obstack(irg);
1405 attr = obstack_alloc(obst, sizeof(attr[0]));
1406 memset(attr, 0, sizeof(attr[0]));
1407 pmap_insert(handler->phi_attrs, phi, attr);
1414 * Get register class of a Phi.
1417 const arch_register_req_t *get_Phi_reg_req_recursive(const phi_handler_t *h,
1421 int n = get_irn_arity(phi);
1425 if(*visited && pset_find_ptr(*visited, phi))
1428 for(i = 0; i < n; ++i) {
1429 op = get_irn_n(phi, i);
1430 /* Matze: don't we unnecessary constraint our phis with this?
1431 * we only need to take the regclass IMO*/
1433 return arch_get_register_req(h->arch_env, op, BE_OUT_POS(0));
1437 * The operands of that Phi were all Phis themselves.
1438 * We have to start a DFS for a non-Phi argument now.
1441 *visited = pset_new_ptr(16);
1443 pset_insert_ptr(*visited, phi);
1445 for(i = 0; i < n; ++i) {
1446 const arch_register_req_t *req;
1447 op = get_irn_n(phi, i);
1448 req = get_Phi_reg_req_recursive(h, op, visited);
1457 const arch_register_req_t *phi_get_irn_reg_req(const void *self,
1458 const ir_node *irn, int pos)
1460 phi_handler_t *phi_handler = get_phi_handler_from_ops(self);
1465 if(!mode_is_datab(get_irn_mode(irn)))
1466 return arch_no_register_req;
1468 attr = get_Phi_attr(phi_handler, irn);
1470 if(attr->req.type == arch_register_req_type_none) {
1471 pset *visited = NULL;
1472 const arch_register_req_t *req;
1473 req = get_Phi_reg_req_recursive(phi_handler, irn, &visited);
1475 memcpy(&attr->req, req, sizeof(req[0]));
1476 assert(attr->req.cls != NULL);
1477 attr->req.type = arch_register_req_type_normal;
1486 void be_set_phi_reg_req(const arch_env_t *arch_env, ir_node *node,
1487 const arch_register_req_t *req)
1489 const arch_irn_ops_t *ops = arch_get_irn_ops(arch_env, node);
1490 const phi_handler_t *handler = get_phi_handler_from_ops(ops);
1493 assert(mode_is_datab(get_irn_mode(node)));
1495 attr = get_Phi_attr(handler, node);
1496 memcpy(&attr->req, req, sizeof(req[0]));
1499 void be_set_phi_flags(const arch_env_t *arch_env, ir_node *node,
1500 arch_irn_flags_t flags)
1502 const arch_irn_ops_t *ops = arch_get_irn_ops(arch_env, node);
1503 const phi_handler_t *handler = get_phi_handler_from_ops(ops);
1506 assert(mode_is_datab(get_irn_mode(node)));
1508 attr = get_Phi_attr(handler, node);
1509 attr->flags = flags;
1513 void phi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1515 phi_handler_t *h = get_phi_handler_from_ops(self);
1516 phi_attr_t *attr = get_Phi_attr(h, irn);
1521 const arch_register_t *phi_get_irn_reg(const void *self, const ir_node *irn)
1523 phi_handler_t *h = get_phi_handler_from_ops(self);
1524 phi_attr_t *attr = get_Phi_attr(h, irn);
1529 arch_irn_class_t phi_classify(const void *self, const ir_node *irn)
1533 return arch_irn_class_normal;
1537 arch_irn_flags_t phi_get_flags(const void *self, const ir_node *irn)
1539 phi_handler_t *h = get_phi_handler_from_ops(self);
1540 phi_attr_t *attr = get_Phi_attr(h, irn);
1546 ir_entity *phi_get_frame_entity(const void *self, const ir_node *irn)
1554 void phi_set_frame_entity(const void *self, ir_node *irn, ir_entity *ent)
1563 void phi_set_frame_offset(const void *self, ir_node *irn, int bias)
1572 int phi_get_sp_bias(const void* self, const ir_node *irn)
1580 const arch_irn_ops_if_t phi_irn_ops = {
1581 phi_get_irn_reg_req,
1586 phi_get_frame_entity,
1587 phi_set_frame_entity,
1588 phi_set_frame_offset,
1590 NULL, /* get_inverse */
1591 NULL, /* get_op_estimated_cost */
1592 NULL, /* possible_memory_operand */
1593 NULL, /* perform_memory_operand */
1596 arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env)
1598 phi_handler_t *h = xmalloc(sizeof(h[0]));
1599 h->irn_handler.get_irn_ops = phi_get_irn_ops;
1600 h->irn_ops.impl = &phi_irn_ops;
1601 h->arch_env = arch_env;
1602 h->phi_attrs = pmap_create();
1603 return (arch_irn_handler_t *) h;
1606 void be_phi_handler_free(arch_irn_handler_t *handler)
1608 phi_handler_t *h = get_phi_handler_from_handler(handler);
1609 pmap_destroy(h->phi_attrs);
1610 h->phi_attrs = NULL;
1614 void be_phi_handler_reset(arch_irn_handler_t *handler)
1616 phi_handler_t *h = get_phi_handler_from_handler(handler);
1618 pmap_destroy(h->phi_attrs);
1619 h->phi_attrs = pmap_create();
1624 | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _
1625 | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` |
1626 | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| |
1627 |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, |
1632 * Dumps a register requirement to a file.
1634 static void dump_node_req(FILE *f, int idx, const arch_register_req_t *req,
1635 const ir_node *node)
1637 int did_something = 0;
1639 const char *prefix = buf;
1641 snprintf(buf, sizeof(buf), "#%d ", idx);
1642 buf[sizeof(buf) - 1] = '\0';
1647 arch_register_req_format(tmp, sizeof(tmp), req, node);
1648 fprintf(f, "%s", tmp);
1657 * Dumps node register requirements to a file.
1659 static void dump_node_reqs(FILE *f, ir_node *node)
1662 be_node_attr_t *a = get_irn_attr(node);
1663 int len = ARR_LEN(a->reg_data);
1665 fprintf(f, "registers: \n");
1666 for(i = 0; i < len; ++i) {
1667 be_reg_data_t *rd = &a->reg_data[i];
1669 fprintf(f, "#%d: %s\n", i, rd->reg->name);
1672 fprintf(f, "in requirements:\n");
1673 for(i = 0; i < len; ++i) {
1674 dump_node_req(f, i, &a->reg_data[i].in_req.req, node);
1677 fprintf(f, "\nout requirements:\n");
1678 for(i = 0; i < len; ++i) {
1679 dump_node_req(f, i, &a->reg_data[i].req.req, node);
1684 * ir_op-Operation: dump a be node to file
1686 static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
1688 be_node_attr_t *at = get_irn_attr(irn);
1690 assert(is_be_node(irn));
1693 case dump_node_opcode_txt:
1694 fprintf(f, get_op_name(get_irn_op(irn)));
1696 case dump_node_mode_txt:
1697 fprintf(f, get_mode_name(get_irn_mode(irn)));
1699 case dump_node_nodeattr_txt:
1701 case dump_node_info_txt:
1702 dump_node_reqs(f, irn);
1704 if(be_has_frame_entity(irn)) {
1705 be_frame_attr_t *a = (be_frame_attr_t *) at;
1707 int bits = get_type_size_bits(get_entity_type(a->ent));
1708 ir_fprintf(f, "frame entity: %+F, offset 0x%x (%d), size 0x%x (%d) bits\n",
1709 a->ent, a->offset, a->offset, bits, bits);
1714 switch(be_get_irn_opcode(irn)) {
1717 be_stack_attr_t *a = (be_stack_attr_t *) at;
1718 if (a->offset == BE_STACK_FRAME_SIZE_EXPAND)
1719 fprintf(f, "offset: FRAME_SIZE\n");
1720 else if(a->offset == BE_STACK_FRAME_SIZE_SHRINK)
1721 fprintf(f, "offset: -FRAME SIZE\n");
1723 fprintf(f, "offset: %u\n", a->offset);
1728 be_call_attr_t *a = (be_call_attr_t *) at;
1731 fprintf(f, "\ncalling: %s\n", get_entity_name(a->ent));
1737 for(i = 0; i < be_get_MemPerm_entity_arity(irn); ++i) {
1738 ir_entity *in, *out;
1739 in = be_get_MemPerm_in_entity(irn, i);
1740 out = be_get_MemPerm_out_entity(irn, i);
1742 fprintf(f, "\nin[%d]: %s\n", i, get_entity_name(in));
1745 fprintf(f, "\nout[%d]: %s\n", i, get_entity_name(out));
1761 * Copies the backend specific attributes from old node to new node.
1763 static void copy_attr(const ir_node *old_node, ir_node *new_node)
1765 be_node_attr_t *old_attr = get_irn_attr(old_node);
1766 be_node_attr_t *new_attr = get_irn_attr(new_node);
1767 struct obstack *obst = get_irg_obstack(get_irn_irg(new_node));
1770 assert(is_be_node(old_node));
1771 assert(is_be_node(new_node));
1773 memcpy(new_attr, old_attr, get_op_attr_size(get_irn_op(old_node)));
1774 new_attr->reg_data = NULL;
1776 if(old_attr->reg_data != NULL)
1777 len = ARR_LEN(old_attr->reg_data);
1781 if(get_irn_op(old_node)->opar == oparity_dynamic
1782 || be_is_RegParams(old_node)) {
1783 new_attr->reg_data = NEW_ARR_F(be_reg_data_t, len);
1785 new_attr->reg_data = NEW_ARR_D(be_reg_data_t, obst, len);
1789 memcpy(new_attr->reg_data, old_attr->reg_data, len * sizeof(be_reg_data_t));
1790 for(i = 0; i < len; ++i) {
1791 const be_reg_data_t *rd = &old_attr->reg_data[i];
1792 be_reg_data_t *newrd = &new_attr->reg_data[i];
1793 if(arch_register_req_is(&rd->req.req, limited)) {
1794 const arch_register_req_t *req = &rd->req.req;
1795 arch_register_req_t *new_req = &newrd->req.req;
1797 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1799 if(arch_register_req_is(&rd->in_req.req, limited)) {
1800 const arch_register_req_t *req = &rd->in_req.req;
1801 arch_register_req_t *new_req = &newrd->in_req.req;
1803 = rbitset_duplicate_obstack_alloc(obst, req->limited, req->cls->n_regs);
1809 static const ir_op_ops be_node_op_ops = {