4 * @author Sebastian Hack
18 #include "irgraph_t.h"
21 #include "iredges_t.h"
24 #include "irprintf_t.h"
32 #include "besched_t.h"
34 #define MAX(x, y) ((x) > (y) ? (x) : (y))
35 #define MIN(x, y) ((x) < (y) ? (x) : (y))
37 typedef struct _be_abi_call_arg_t {
40 unsigned on_stack : 1;
43 const arch_register_t *reg;
46 unsigned space_before;
50 struct _be_abi_call_t {
51 be_abi_call_flags_t flags;
52 const be_abi_callbacks_t *cb;
57 #define N_FRAME_TYPES 3
59 typedef struct _be_stack_frame_t {
64 type *order[N_FRAME_TYPES]; /**< arg, between and frame types ordered. */
70 struct _be_stack_slot_t {
71 struct _be_stack_frame_t *frame;
75 struct _be_abi_irg_t {
77 be_stack_frame_t *frame; /**< The stack frame model. */
78 const be_irg_t *birg; /**< The back end IRG. */
79 const arch_isa_t *isa; /**< The isa. */
80 survive_dce_t *dce_survivor;
82 be_abi_call_t *call; /**< The ABI call information. */
83 type *method_type; /**< The type of the method of the IRG. */
85 ir_node *init_sp; /**< The node representing the stack pointer
86 at the start of the function. */
88 ir_node *reg_params; /**< The reg params node. */
89 pmap *regs; /**< A map of all callee-save and ignore regs to
90 their Projs to the RegParams node. */
92 pset *stack_phis; /**< The set of all Phi nodes inserted due to
93 stack pointer modifying nodes. */
95 int start_block_bias; /**< The stack bias at the end of the start block. */
97 void *cb; /**< ABI Callback self pointer. */
99 pmap *keep_map; /**< mapping blocks to keep nodes. */
100 pset *ignore_regs; /**< Additional registers which shall be ignored. */
102 arch_irn_handler_t irn_handler;
103 arch_irn_ops_t irn_ops;
104 DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< The debugging module. */
107 #define get_abi_from_handler(ptr) firm_container_of(ptr, be_abi_irg_t, irn_handler)
108 #define get_abi_from_ops(ptr) firm_container_of(ptr, be_abi_irg_t, irn_ops)
110 /* Forward, since be need it in be_abi_introduce(). */
111 static const arch_irn_ops_if_t abi_irn_ops;
112 static const arch_irn_handler_t abi_irn_handler;
114 /* Flag: if set, try to omit the frame pointer if called by the backend */
118 _ ____ ___ ____ _ _ _ _
119 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
120 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
121 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
122 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
124 These callbacks are used by the backend to set the parameters
125 for a specific call type.
129 * Set compare function: compares two ABI call object arguments.
131 static int cmp_call_arg(const void *a, const void *b, size_t n)
133 const be_abi_call_arg_t *p = a, *q = b;
134 return !(p->is_res == q->is_res && p->pos == q->pos);
138 * Get or set an ABI call object argument.
140 * @param call the abi call
141 * @param is_res true for call results, false for call arguments
142 * @param pos position of the argument
143 * @param do_insert true if the argument is set, false if it's retrieved
145 static be_abi_call_arg_t *get_or_set_call_arg(be_abi_call_t *call, int is_res, int pos, int do_insert)
147 be_abi_call_arg_t arg;
150 memset(&arg, 0, sizeof(arg));
154 hash = is_res * 128 + pos;
157 ? set_insert(call->params, &arg, sizeof(arg), hash)
158 : set_find(call->params, &arg, sizeof(arg), hash);
162 * Retrieve an ABI call object argument.
164 * @param call the ABI call object
165 * @param is_res true for call results, false for call arguments
166 * @param pos position of the argument
168 static INLINE be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
170 return get_or_set_call_arg(call, is_res, pos, 0);
173 /* Set the flags for a call. */
174 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
180 void be_abi_call_param_stack(be_abi_call_t *call, int arg_pos, unsigned alignment, unsigned space_before, unsigned space_after)
182 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
184 arg->alignment = alignment;
185 arg->space_before = space_before;
186 arg->space_after = space_after;
187 assert(alignment > 0 && "Alignment must be greater than 0");
190 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
192 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
197 void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
199 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 1, arg_pos, 1);
204 /* Get the flags of a ABI call object. */
205 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
211 * Constructor for a new ABI call object.
213 * @return the new ABI call object
215 static be_abi_call_t *be_abi_call_new()
217 be_abi_call_t *call = xmalloc(sizeof(call[0]));
219 call->params = new_set(cmp_call_arg, 16);
222 call->flags.bits.try_omit_fp = be_omit_fp;
227 * Destructor for an ABI call object.
229 static void be_abi_call_free(be_abi_call_t *call)
231 del_set(call->params);
237 | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _
238 | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` |
239 | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| |
240 |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, |
243 Handling of the stack frame. It is composed of three types:
244 1) The type of the arguments which are pushed on the stack.
245 2) The "between type" which consists of stuff the call of the
246 function pushes on the stack (like the return address and
247 the old base pointer for ia32).
248 3) The Firm frame type which consists of all local variables
252 static int get_stack_entity_offset(be_stack_frame_t *frame, entity *ent, int bias)
254 type *t = get_entity_owner(ent);
255 int ofs = get_entity_offset_bytes(ent);
259 /* Find the type the entity is contained in. */
260 for(index = 0; index < N_FRAME_TYPES; ++index) {
261 if(frame->order[index] == t)
265 /* Add the size of all the types below the one of the entity to the entity's offset */
266 for(i = 0; i < index; ++i)
267 ofs += get_type_size_bytes(frame->order[i]);
269 /* correct the offset by the initial position of the frame pointer */
270 ofs -= frame->initial_offset;
272 /* correct the offset with the current bias. */
279 * Retrieve the entity with given offset from a frame type.
281 static entity *search_ent_with_offset(type *t, int offset)
285 for(i = 0, n = get_class_n_members(t); i < n; ++i) {
286 entity *ent = get_class_member(t, i);
287 if(get_entity_offset_bytes(ent) == offset)
294 static int stack_frame_compute_initial_offset(be_stack_frame_t *frame)
296 type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
297 entity *ent = search_ent_with_offset(base, 0);
298 frame->initial_offset = 0;
299 frame->initial_offset = get_stack_entity_offset(frame, ent, 0);
300 return frame->initial_offset;
303 static be_stack_frame_t *stack_frame_init(be_stack_frame_t *frame, type *args, type *between, type *locals, int stack_dir)
305 frame->arg_type = args;
306 frame->between_type = between;
307 frame->frame_type = locals;
308 frame->initial_offset = 0;
309 frame->stack_dir = stack_dir;
310 frame->order[1] = between;
313 frame->order[0] = args;
314 frame->order[2] = locals;
318 frame->order[0] = locals;
319 frame->order[2] = args;
325 static void stack_frame_dump(FILE *file, be_stack_frame_t *frame)
329 ir_fprintf(file, "initial offset: %d\n", frame->initial_offset);
330 for(j = 0; j < N_FRAME_TYPES; ++j) {
331 type *t = frame->order[j];
333 ir_fprintf(file, "type %d: %Fm size: %d\n", j, t, get_type_size_bytes(t));
334 for(i = 0, n = get_class_n_members(t); i < n; ++i) {
335 entity *ent = get_class_member(t, i);
336 ir_fprintf(file, "\t%F int ofs: %d glob ofs: %d\n", ent, get_entity_offset_bytes(ent), get_stack_entity_offset(frame, ent, 0));
342 * If irn is a Sel node computes the address of an entity
343 * on the frame type return the entity, else NULL.
345 static INLINE entity *get_sel_ent(ir_node *irn)
347 if(is_Sel(irn) && get_Sel_ptr(irn) == get_irg_frame(get_irn_irg(irn))) {
348 return get_Sel_entity(irn);
355 * Walker: Replaces Loads, Stores and Sels of frame type entities
356 * by FrameLoad, FrameStore and FrameAdress.
358 static void lower_frame_sels_walker(ir_node *irn, void *data)
361 entity *ent = get_sel_ent(irn);
364 be_abi_irg_t *env = data;
365 ir_node *bl = get_nodes_block(irn);
366 ir_graph *irg = get_irn_irg(bl);
367 ir_node *frame = get_irg_frame(irg);
369 nw = be_new_FrameAddr(env->isa->sp->reg_class, irg, bl, frame, ent);
375 * Returns non-zero if the call argument at given position
376 * is transfered on the stack.
378 static INLINE int is_on_stack(be_abi_call_t *call, int pos)
380 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
381 return arg && !arg->in_reg;
391 Adjustment of the calls inside a graph.
396 * Transform a call node.
397 * @param env The ABI environment for the current irg.
398 * @param irn The call node.
399 * @param curr_sp The stack pointer node to use.
400 * @return The stack pointer after the call.
402 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp)
404 ir_graph *irg = env->birg->irg;
405 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
406 be_abi_call_t *call = be_abi_call_new();
407 ir_type *mt = get_Call_type(irn);
408 ir_node *call_ptr = get_Call_ptr(irn);
409 int n_params = get_method_n_params(mt);
410 ir_node *curr_mem = get_Call_mem(irn);
411 ir_node *bl = get_nodes_block(irn);
412 pset *results = pset_new_ptr(8);
413 pset *caller_save = pset_new_ptr(8);
415 int stack_dir = arch_isa_stack_dir(isa);
416 const arch_register_t *sp = arch_isa_sp(isa);
417 ir_mode *mach_mode = sp->reg_class->mode;
418 struct obstack *obst = &env->obst;
419 ir_node *no_mem = get_irg_no_mem(irg);
420 int no_alloc = call->flags.bits.frame_is_setup_on_call;
422 ir_node *res_proj = NULL;
423 int curr_res_proj = pn_Call_max;
430 const ir_edge_t *edge;
435 /* Let the isa fill out the abi description for that call node. */
436 arch_isa_get_call_abi(isa, mt, call);
438 /* Insert code to put the stack arguments on the stack. */
439 assert(get_Call_n_params(irn) == n_params);
440 for(i = 0; i < n_params; ++i) {
441 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
444 stack_size += arg->space_before;
445 stack_size = round_up2(stack_size, arg->alignment);
446 stack_size += get_type_size_bytes(get_method_param_type(mt, i));
447 stack_size += arg->space_after;
448 obstack_int_grow(obst, i);
452 pos = obstack_finish(obst);
454 /* Collect all arguments which are passed in registers. */
455 for(i = 0, n = get_Call_n_params(irn); i < n; ++i) {
456 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
457 if(arg && arg->in_reg) {
458 obstack_int_grow(obst, i);
462 low_args = obstack_finish(obst);
464 /* If there are some parameters which shall be passed on the stack. */
467 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
470 * Reverse list of stack parameters if call arguments are from left to right.
471 * We must them reverse again in they are pushed (not stored) and the stack
472 * direction is downwards.
474 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
475 for(i = 0; i < n_pos >> 1; ++i) {
476 int other = n_pos - i - 1;
484 * If the stack is decreasing and we do not want to store sequentially,
485 * or someone else allocated the call frame
486 * we allocate as much space on the stack all parameters need, by
487 * moving the stack pointer along the stack's direction.
489 if(stack_dir < 0 && !do_seq && !no_alloc) {
490 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, no_mem, stack_size, be_stack_dir_expand);
493 assert(mode_is_reference(mach_mode) && "machine mode must be pointer");
494 for(i = 0; i < n_pos; ++i) {
496 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
497 ir_node *param = get_Call_param(irn, p);
498 ir_node *addr = curr_sp;
500 type *param_type = get_method_param_type(mt, p);
501 int param_size = get_type_size_bytes(param_type) + arg->space_after;
504 * If we wanted to build the arguments sequentially,
505 * the stack pointer for the next must be incremented,
506 * and the memory value propagated.
510 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, curr_mem,
511 param_size + arg->space_before, be_stack_dir_expand);
514 curr_ofs += arg->space_before;
515 curr_ofs = round_up2(curr_ofs, arg->alignment);
517 /* Make the expression to compute the argument's offset. */
519 addr = new_r_Const_long(irg, bl, mode_Is, curr_ofs);
520 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
524 /* Insert a store for primitive arguments. */
525 if (is_atomic_type(param_type)) {
526 mem = new_r_Store(irg, bl, curr_mem, addr, param);
527 mem = new_r_Proj(irg, bl, mem, mode_M, pn_Store_M);
530 /* Make a mem copy for compound arguments. */
532 assert(mode_is_reference(get_irn_mode(param)));
533 mem = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type);
534 mem = new_r_Proj(irg, bl, mem, mode_M, pn_CopyB_M_regular);
537 curr_ofs += param_size;
542 obstack_ptr_grow(obst, mem);
545 in = (ir_node **) obstack_finish(obst);
547 /* We need the sync only, if we didn't build the stores sequentially. */
549 curr_mem = new_r_Sync(irg, bl, n_pos, in);
550 obstack_free(obst, in);
553 /* Collect caller save registers */
554 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
556 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
557 for(j = 0; j < cls->n_regs; ++j) {
558 const arch_register_t *reg = arch_register_for_index(cls, j);
559 if(arch_register_type_is(reg, caller_save))
560 pset_insert_ptr(caller_save, (void *) reg);
564 /* search the greatest result proj number */
566 /* TODO: what if the result is NOT used? Currently there is
567 * no way to detect this later, especially there is no way to
568 * see this in the proj numbers.
569 * While this is ok for the register allocator, it is bad for
570 * backends which need to change the be_Call further (x87 simulator
571 * for instance. However for this particular case the call_type is
574 foreach_out_edge(irn, edge) {
575 const ir_edge_t *res_edge;
576 ir_node *irn = get_edge_src_irn(edge);
578 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_T_result) {
580 foreach_out_edge(irn, res_edge) {
582 be_abi_call_arg_t *arg;
583 ir_node *res = get_edge_src_irn(res_edge);
585 assert(is_Proj(res));
587 proj = get_Proj_proj(res);
588 arg = get_call_arg(call, 1, proj);
591 shift the proj number to the right, since we will drop the
592 unspeakable Proj_T from the Call. Therefore, all real argument
593 Proj numbers must be increased by pn_be_Call_first_res
595 proj += pn_be_Call_first_res;
596 set_Proj_proj(res, proj);
597 obstack_ptr_grow(obst, res);
599 if(proj > curr_res_proj)
600 curr_res_proj = proj;
602 pset_remove_ptr(caller_save, arg->reg);
603 //pmap_insert(arg_regs, arg->reg, INT_TO_PTR(proj + 1))
610 obstack_ptr_grow(obst, NULL);
611 res_projs = obstack_finish(obst);
613 /* make the back end call node and set its register requirements. */
614 for(i = 0; i < n_low_args; ++i)
615 obstack_ptr_grow(obst, get_Call_param(irn, low_args[i]));
617 in = obstack_finish(obst);
619 if(env->call->flags.bits.call_has_imm && get_irn_opcode(call_ptr) == iro_SymConst) {
620 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem, curr_sp, curr_sp,
621 curr_res_proj + pset_count(caller_save), n_low_args, in,
623 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
627 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem, curr_sp, call_ptr,
628 curr_res_proj + pset_count(caller_save), n_low_args, in,
633 Set the register class of the call address to the same as the stack pointer's.
634 That' probably buggy for some architectures.
636 be_node_set_reg_class(low_call, be_pos_Call_ptr, sp->reg_class);
638 /* Set the register classes and constraints of the Call parameters. */
639 for(i = 0; i < n_low_args; ++i) {
640 int index = low_args[i];
641 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
642 assert(arg->reg != NULL);
644 be_set_constr_single_reg(low_call, be_pos_Call_first_arg + index, arg->reg);
647 /* Set the register constraints of the results. */
648 for(i = 0; res_projs[i]; ++i) {
649 ir_node *irn = res_projs[i];
650 int proj = get_Proj_proj(irn);
652 /* Correct Proj number since it has been adjusted! (see above) */
653 const be_abi_call_arg_t *arg = get_call_arg(call, 1, proj - pn_Call_max);
656 be_set_constr_single_reg(low_call, BE_OUT_POS(proj), arg->reg);
658 obstack_free(obst, in);
659 exchange(irn, low_call);
661 /* redirect the result projs to the lowered call instead of the Proj_T */
662 for(i = 0; res_projs[i]; ++i)
663 set_Proj_pred(res_projs[i], low_call);
665 /* Make additional projs for the caller save registers
666 and the Keep node which keeps them alive. */
667 if(pset_count(caller_save) > 0) {
668 const arch_register_t *reg;
672 for(reg = pset_first(caller_save), n = 0; reg; reg = pset_next(caller_save), ++n) {
673 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode, curr_res_proj);
675 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
676 be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg);
677 set_irn_link(proj, (void *) reg);
678 obstack_ptr_grow(obst, proj);
682 in = (ir_node **) obstack_finish(obst);
683 keep = be_new_Keep(NULL, irg, bl, n, in);
684 for(i = 0; i < n; ++i) {
685 const arch_register_t *reg = get_irn_link(in[i]);
686 be_node_set_reg_class(keep, i, reg->reg_class);
688 obstack_free(obst, in);
691 /* Clean up the stack. */
693 ir_node *mem_proj = NULL;
695 foreach_out_edge(low_call, edge) {
696 ir_node *irn = get_edge_src_irn(edge);
697 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
704 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_Call_M);
706 /* Clean up the stack frame if we allocated it */
708 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, mem_proj, stack_size, be_stack_dir_shrink);
711 be_abi_call_free(call);
712 obstack_free(obst, pos);
714 del_pset(caller_save);
721 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
723 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
725 if (get_Alloc_where(alloc) == stack_alloc) {
726 ir_node *bl = get_nodes_block(alloc);
727 ir_graph *irg = get_irn_irg(bl);
728 ir_node *alloc_mem = NULL;
729 ir_node *alloc_res = NULL;
731 const ir_edge_t *edge;
734 foreach_out_edge(alloc, edge) {
735 ir_node *irn = get_edge_src_irn(edge);
737 assert(is_Proj(irn));
738 switch(get_Proj_proj(irn)) {
750 /* Beware: currently Alloc nodes without a result might happen,
751 only escape analysis kills them and this phase runs only for object
752 oriented source. We kill the Alloc here. */
753 if (alloc_res == NULL) {
754 exchange(alloc_mem, get_Alloc_mem(alloc));
758 /* The stack pointer will be modified in an unknown manner.
759 We cannot omit it. */
760 env->call->flags.bits.try_omit_fp = 0;
761 new_alloc = be_new_AddSP(env->isa->sp, irg, bl, curr_sp, get_Alloc_size(alloc));
763 exchange(alloc_res, env->isa->stack_dir < 0 ? new_alloc : curr_sp);
765 if(alloc_mem != NULL)
766 exchange(alloc_mem, new_r_NoMem(irg));
775 * Walker for dependent_on().
776 * This function searches a node tgt recursively from a given node
777 * but is restricted to the given block.
778 * @return 1 if tgt was reachable from curr, 0 if not.
780 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl, unsigned long visited_nr)
784 if(get_irn_visited(curr) >= visited_nr)
787 set_irn_visited(curr, visited_nr);
788 if(get_nodes_block(curr) != bl)
794 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
795 if(check_dependence(get_irn_n(curr, i), tgt, bl, visited_nr))
803 * Check if a node is somehow data dependent on another one.
804 * both nodes must be in the same basic block.
805 * @param n1 The first node.
806 * @param n2 The second node.
807 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
809 static int dependent_on(ir_node *n1, ir_node *n2)
811 ir_node *bl = get_nodes_block(n1);
812 ir_graph *irg = get_irn_irg(bl);
813 long vis_nr = get_irg_visited(irg) + 1;
815 assert(bl == get_nodes_block(n2));
816 set_irg_visited(irg, vis_nr);
817 return check_dependence(n1, n2, bl, vis_nr);
820 static int cmp_call_dependecy(const void *c1, const void *c2)
822 ir_node *n1 = *(ir_node **) c1;
823 ir_node *n2 = *(ir_node **) c2;
826 Classical qsort() comparison function behavior:
827 0 if both elements are equal
828 1 if second is "smaller" that first
829 -1 if first is "smaller" that second
831 return n1 == n2 ? 0 : (dependent_on(n1, n2) ? -1 : 1);
834 static void link_calls_in_block_walker(ir_node *irn, void *data)
837 be_abi_irg_t *env = data;
838 ir_node *bl = get_nodes_block(irn);
839 void *save = get_irn_link(bl);
841 env->call->flags.bits.irg_is_leaf = 0;
843 set_irn_link(irn, save);
844 set_irn_link(bl, irn);
849 * Process all call nodes inside a basic block.
850 * Note that the link field of the block must contain a linked list of all
851 * Call nodes inside the block. We first order this list according to data dependency
852 * and that connect the calls together.
854 static void process_calls_in_block(ir_node *bl, void *data)
856 be_abi_irg_t *env = data;
857 ir_node *curr_sp = env->init_sp;
861 for(irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
862 obstack_ptr_grow(&env->obst, irn);
864 /* If there were call nodes in the block. */
870 nodes = obstack_finish(&env->obst);
872 /* order the call nodes according to data dependency */
873 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependecy);
875 for(i = n - 1; i >= 0; --i) {
876 ir_node *irn = nodes[i];
878 switch(get_irn_opcode(irn)) {
880 curr_sp = adjust_call(env, irn, curr_sp);
883 curr_sp = adjust_alloc(env, irn, curr_sp);
890 obstack_free(&env->obst, nodes);
892 /* Keep the last stack state in the block by tying it to Keep node */
894 keep = be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl), bl, 1, nodes);
895 pmap_insert(env->keep_map, bl, keep);
898 set_irn_link(bl, curr_sp);
902 * Adjust all call nodes in the graph to the ABI conventions.
904 static void process_calls(be_abi_irg_t *env)
906 ir_graph *irg = env->birg->irg;
908 env->call->flags.bits.irg_is_leaf = 1;
909 irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, env);
910 irg_block_walk_graph(irg, NULL, process_calls_in_block, env);
913 static void collect_return_walker(ir_node *irn, void *data)
915 if(get_irn_opcode(irn) == iro_Return) {
916 struct obstack *obst = data;
917 obstack_ptr_grow(obst, irn);
922 static ir_node *setup_frame(be_abi_irg_t *env)
924 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
925 const arch_register_t *sp = isa->sp;
926 const arch_register_t *bp = isa->bp;
927 be_abi_call_flags_bits_t flags = env->call->flags.bits;
928 ir_graph *irg = env->birg->irg;
929 ir_node *bl = get_irg_start_block(irg);
930 ir_node *no_mem = get_irg_no_mem(irg);
931 ir_node *old_frame = get_irg_frame(irg);
932 ir_node *stack = pmap_get(env->regs, (void *) sp);
933 ir_node *frame = pmap_get(env->regs, (void *) bp);
935 int stack_nr = get_Proj_proj(stack);
937 if(flags.try_omit_fp) {
938 stack = be_new_IncSP(sp, irg, bl, stack, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_expand);
943 frame = be_new_Copy(bp->reg_class, irg, bl, stack);
945 be_node_set_flags(frame, -1, arch_irn_flags_dont_spill);
947 be_set_constr_single_reg(frame, -1, bp);
948 be_node_set_flags(frame, -1, arch_irn_flags_ignore);
949 arch_set_irn_register(env->birg->main_env->arch_env, frame, bp);
952 stack = be_new_IncSP(sp, irg, bl, stack, frame, BE_STACK_FRAME_SIZE, be_stack_dir_expand);
955 be_node_set_flags(env->reg_params, -(stack_nr + 1), arch_irn_flags_ignore);
956 env->init_sp = stack;
957 set_irg_frame(irg, frame);
958 edges_reroute(old_frame, frame, irg);
963 static void clearup_frame(be_abi_irg_t *env, ir_node *ret, pmap *reg_map, struct obstack *obst)
965 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
966 const arch_register_t *sp = isa->sp;
967 const arch_register_t *bp = isa->bp;
968 ir_graph *irg = env->birg->irg;
969 ir_node *ret_mem = get_Return_mem(ret);
970 ir_node *frame = get_irg_frame(irg);
971 ir_node *bl = get_nodes_block(ret);
972 ir_node *stack = get_irn_link(bl);
976 if(env->call->flags.bits.try_omit_fp) {
977 stack = be_new_IncSP(sp, irg, bl, stack, ret_mem, BE_STACK_FRAME_SIZE, be_stack_dir_shrink);
981 stack = be_new_SetSP(sp, irg, bl, stack, frame, ret_mem);
982 be_set_constr_single_reg(stack, -1, sp);
983 be_node_set_flags(stack, -1, arch_irn_flags_ignore);
986 pmap_foreach(env->regs, ent) {
987 const arch_register_t *reg = ent->key;
988 ir_node *irn = ent->value;
991 obstack_ptr_grow(&env->obst, stack);
993 obstack_ptr_grow(&env->obst, frame);
994 else if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
995 obstack_ptr_grow(obst, irn);
1001 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type)
1003 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1004 int inc = env->birg->main_env->arch_env->isa->stack_dir * dir;
1005 int n = get_method_n_params(method_type);
1006 int curr = inc > 0 ? 0 : n - 1;
1013 snprintf(buf, sizeof(buf), "%s_arg_type", get_entity_name(get_irg_entity(env->birg->irg)));
1014 res = new_type_class(new_id_from_str(buf));
1016 for(i = 0; i < n; ++i, curr += inc) {
1017 type *param_type = get_method_param_type(method_type, curr);
1018 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1021 snprintf(buf, sizeof(buf), "param_%d", i);
1022 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1023 ofs += arg->space_before;
1024 ofs = round_up2(ofs, arg->alignment);
1025 set_entity_offset_bytes(arg->stack_ent, ofs);
1026 ofs += arg->space_after;
1027 ofs += get_type_size_bytes(param_type);
1031 set_type_size_bytes(res, ofs);
1035 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
1038 struct obstack obst;
1040 obstack_init(&obst);
1042 /* Create a Perm after the RegParams node to delimit it. */
1043 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1044 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1049 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
1050 const arch_register_t *reg = &cls->regs[j];
1051 ir_node *irn = pmap_get(regs, (void *) reg);
1053 if(irn && !arch_register_type_is(reg, ignore)) {
1055 obstack_ptr_grow(&obst, irn);
1056 set_irn_link(irn, (void *) reg);
1060 obstack_ptr_grow(&obst, NULL);
1061 in = obstack_finish(&obst);
1063 perm = be_new_Perm(cls, irg, bl, n_regs, in);
1064 for(j = 0; j < n_regs; ++j) {
1065 ir_node *arg = in[j];
1066 arch_register_t *reg = get_irn_link(arg);
1067 pmap_insert(regs, reg, arg);
1068 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
1071 obstack_free(&obst, in);
1074 obstack_free(&obst, NULL);
1078 const arch_register_t *reg;
1082 static int cmp_regs(const void *a, const void *b)
1084 const reg_node_map_t *p = a;
1085 const reg_node_map_t *q = b;
1087 if(p->reg->reg_class == q->reg->reg_class)
1088 return p->reg->index - q->reg->index;
1090 return p->reg->reg_class - q->reg->reg_class;
1093 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1096 int n = pmap_count(reg_map);
1098 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1100 pmap_foreach(reg_map, ent) {
1101 res[i].reg = ent->key;
1102 res[i].irn = ent->value;
1106 qsort(res, n, sizeof(res[0]), cmp_regs);
1111 * Creates a barrier.
1113 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1115 ir_graph *irg = env->birg->irg;
1116 int n_regs = pmap_count(regs);
1122 rm = reg_map_to_arr(&env->obst, regs);
1124 for(n = 0; n < n_regs; ++n)
1125 obstack_ptr_grow(&env->obst, rm[n].irn);
1128 obstack_ptr_grow(&env->obst, *mem);
1132 in = (ir_node **) obstack_finish(&env->obst);
1133 irn = be_new_Barrier(irg, bl, n, in);
1134 obstack_free(&env->obst, in);
1136 for(n = 0; n < n_regs; ++n) {
1137 const arch_register_t *reg = rm[n].reg;
1139 int pos = BE_OUT_POS(n);
1142 proj = new_r_Proj(irg, bl, irn, get_irn_mode(rm[n].irn), n);
1143 be_node_set_reg_class(irn, n, reg->reg_class);
1145 be_set_constr_single_reg(irn, n, reg);
1146 be_set_constr_single_reg(irn, pos, reg);
1147 be_node_set_reg_class(irn, pos, reg->reg_class);
1148 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1150 /* if the proj projects a ignore register or a node which is set to ignore, propagate this property. */
1151 if(arch_register_type_is(reg, ignore) || arch_irn_is(env->birg->main_env->arch_env, in[n], ignore))
1152 flags |= arch_irn_flags_ignore;
1154 if(arch_irn_is(env->birg->main_env->arch_env, in[n], modify_sp))
1155 flags |= arch_irn_flags_modify_sp;
1157 be_node_set_flags(irn, pos, flags);
1159 pmap_insert(regs, (void *) reg, proj);
1163 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1166 obstack_free(&env->obst, rm);
1171 * Creates a be_Return for a Return node.
1173 * @param @env the abi environment
1174 * @param irn the Return node or NULL if there was none
1175 * @param bl the block where the be_Retun should be placed
1176 * @param mem the current memory
1177 * @param n_res number of return results
1179 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, ir_node *mem, int n_res) {
1180 be_abi_call_t *call = env->call;
1181 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1183 pmap *reg_map = pmap_create();
1184 ir_node *keep = pmap_get(env->keep_map, bl);
1190 const arch_register_t **regs;
1194 get the valid stack node in this block.
1195 If we had a call in that block there is a Keep constructed by process_calls()
1196 which points to the last stack modification in that block. we'll use
1197 it then. Else we use the stack from the start block and let
1198 the ssa construction fix the usage.
1200 stack = be_abi_reg_map_get(env->regs, isa->sp);
1202 ir_node *bad = new_r_Bad(env->birg->irg);
1203 stack = get_irn_n(keep, 0);
1204 set_nodes_block(keep, bad);
1205 set_irn_n(keep, 0, bad);
1206 // exchange(keep, new_r_Bad(env->birg->irg));
1209 /* Insert results for Return into the register map. */
1210 for(i = 0; i < n_res; ++i) {
1211 ir_node *res = get_Return_res(irn, i);
1212 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1213 assert(arg->in_reg && "return value must be passed in register");
1214 pmap_insert(reg_map, (void *) arg->reg, res);
1217 /* Add uses of the callee save registers. */
1218 pmap_foreach(env->regs, ent) {
1219 const arch_register_t *reg = ent->key;
1220 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1221 pmap_insert(reg_map, ent->key, ent->value);
1224 be_abi_reg_map_set(reg_map, isa->sp, stack);
1226 /* Make the Epilogue node and call the arch's epilogue maker. */
1227 create_barrier(env, bl, &mem, reg_map, 1);
1228 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1231 Maximum size of the in array for Return nodes is
1232 return args + callee save/ignore registers + memory + stack pointer
1234 in_max = pmap_count(reg_map) + n_res + 2;
1236 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1237 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1240 in[1] = be_abi_reg_map_get(reg_map, isa->sp);
1245 /* clear SP entry, since it has already been grown. */
1246 pmap_insert(reg_map, (void *) isa->sp, NULL);
1247 for(i = 0; i < n_res; ++i) {
1248 ir_node *res = get_Return_res(irn, i);
1249 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1251 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1252 regs[n++] = arg->reg;
1254 /* Clear the map entry to mark the register as processed. */
1255 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1258 /* grow the rest of the stuff. */
1259 pmap_foreach(reg_map, ent) {
1262 regs[n++] = ent->key;
1266 /* The in array for the new back end return is now ready. */
1267 ret = be_new_Return(irn ? get_irn_dbg_info(irn) : NULL, env->birg->irg, bl, n_res, n, in);
1269 /* Set the register classes of the return's parameter accordingly. */
1270 for(i = 0; i < n; ++i)
1272 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1274 /* Free the space of the Epilog's in array and the register <-> proj map. */
1275 obstack_free(&env->obst, in);
1276 pmap_destroy(reg_map);
1282 * Modify the irg itself and the frame type.
1284 static void modify_irg(be_abi_irg_t *env)
1286 be_abi_call_t *call = env->call;
1287 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1288 const arch_register_t *sp = arch_isa_sp(isa);
1289 ir_graph *irg = env->birg->irg;
1290 ir_node *bl = get_irg_start_block(irg);
1291 ir_node *end = get_irg_end_block(irg);
1292 ir_node *arg_tuple = get_irg_args(irg);
1293 ir_node *no_mem = get_irg_no_mem(irg);
1294 ir_node *mem = get_irg_initial_mem(irg);
1295 type *method_type = get_entity_type(get_irg_entity(irg));
1296 pset *dont_save = pset_new_ptr(8);
1297 int n_params = get_method_n_params(method_type);
1303 const arch_register_t *fp_reg;
1304 ir_node *frame_pointer;
1306 ir_node *reg_params_bl;
1308 const ir_edge_t *edge;
1309 ir_type *arg_type, *bet_type;
1311 bitset_t *used_proj_nr;
1312 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1314 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1316 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1317 irg_walk_graph(irg, lower_frame_sels_walker, NULL, env);
1319 env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0]));
1320 env->regs = pmap_create();
1322 /* Find the maximum proj number of the argument tuple proj */
1323 foreach_out_edge(arg_tuple, edge) {
1324 ir_node *irn = get_edge_src_irn(edge);
1325 int nr = get_Proj_proj(irn);
1326 max_arg = MAX(max_arg, nr);
1329 used_proj_nr = bitset_alloca(1024);
1330 max_arg = MAX(max_arg + 1, n_params);
1331 args = obstack_alloc(&env->obst, max_arg * sizeof(args[0]));
1332 memset(args, 0, max_arg * sizeof(args[0]));
1334 /* Fill the argument vector */
1335 foreach_out_edge(arg_tuple, edge) {
1336 ir_node *irn = get_edge_src_irn(edge);
1337 int nr = get_Proj_proj(irn);
1339 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1342 arg_type = compute_arg_type(env, call, method_type);
1343 bet_type = call->cb->get_between_type(env->cb);
1344 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), isa->stack_dir);
1346 /* Count the register params and add them to the number of Projs for the RegParams node */
1347 for(i = 0; i < n_params; ++i) {
1348 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1349 if(arg->in_reg && args[i]) {
1350 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1351 assert(i == get_Proj_proj(args[i]));
1353 /* For now, associate the register with the old Proj from Start representing that argument. */
1354 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1355 bitset_set(used_proj_nr, i);
1356 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1360 /* Collect all callee-save registers */
1361 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1362 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1363 for(j = 0; j < cls->n_regs; ++j) {
1364 const arch_register_t *reg = &cls->regs[j];
1365 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1366 pmap_insert(env->regs, (void *) reg, NULL);
1370 pmap_insert(env->regs, (void *) sp, NULL);
1371 pmap_insert(env->regs, (void *) isa->bp, NULL);
1372 reg_params_bl = get_irg_start_block(irg);
1373 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1376 * make proj nodes for the callee save registers.
1377 * memorize them, since Return nodes get those as inputs.
1379 * Note, that if a register corresponds to an argument, the regs map contains
1380 * the old Proj from start for that argument.
1383 rm = reg_map_to_arr(&env->obst, env->regs);
1384 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1385 arch_register_t *reg = (void *) rm[i].reg;
1386 ir_node *arg_proj = rm[i].irn;
1387 ir_mode *mode = arg_proj ? get_irn_mode(arg_proj) : reg->reg_class->mode;
1389 int pos = BE_OUT_POS((int) nr);
1395 bitset_set(used_proj_nr, nr);
1396 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1397 pmap_insert(env->regs, (void *) reg, proj);
1398 be_set_constr_single_reg(env->reg_params, pos, reg);
1399 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1402 * If the register is an ignore register,
1403 * The Proj for that register shall also be ignored during register allocation.
1405 if(arch_register_type_is(reg, ignore))
1406 flags |= arch_irn_flags_ignore;
1409 flags |= arch_irn_flags_modify_sp;
1411 be_node_set_flags(env->reg_params, pos, flags);
1413 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1415 obstack_free(&env->obst, rm);
1417 /* Generate the Prologue */
1418 fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
1420 /* do the stack allocation BEFORE the barrier, or spill code
1421 might be added before it */
1422 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1423 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_expand);
1424 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1426 barrier = create_barrier(env, bl, &mem, env->regs, 0);
1428 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1429 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1431 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1432 set_irg_frame(irg, frame_pointer);
1433 pset_insert_ptr(env->ignore_regs, fp_reg);
1435 /* Now, introduce stack param nodes for all parameters passed on the stack */
1436 for(i = 0; i < max_arg; ++i) {
1437 ir_node *arg_proj = args[i];
1438 ir_node *repl = NULL;
1440 if(arg_proj != NULL) {
1441 be_abi_call_arg_t *arg;
1442 ir_type *param_type;
1443 int nr = get_Proj_proj(arg_proj);
1445 nr = MIN(nr, n_params);
1446 arg = get_call_arg(call, 0, nr);
1447 param_type = get_method_param_type(method_type, nr);
1450 repl = pmap_get(env->regs, (void *) arg->reg);
1453 else if(arg->on_stack) {
1454 /* For atomic parameters which are actually used, we create a StackParam node. */
1455 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1456 ir_mode *mode = get_type_mode(param_type);
1457 const arch_register_class_t *cls = arch_isa_get_reg_class_for_mode(isa, mode);
1458 repl = be_new_StackParam(cls, isa->bp->reg_class, irg, reg_params_bl, mode, frame_pointer, arg->stack_ent);
1461 /* The stack parameter is not primitive (it is a struct or array),
1462 we thus will create a node representing the parameter's address
1465 repl = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1469 assert(repl != NULL);
1470 edges_reroute(args[i], repl, irg);
1474 /* All Return nodes hang on the End node, so look for them there. */
1475 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1476 ir_node *irn = get_Block_cfgpred(end, i);
1478 if (is_Return(irn)) {
1479 ir_node *ret = create_be_return(env, irn, get_nodes_block(irn), get_Return_mem(irn), get_Return_n_ress(irn));
1483 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return than,
1484 the code is dead and will never be executed. */
1486 del_pset(dont_save);
1487 obstack_free(&env->obst, args);
1491 * Walker: puts all Alloc(stack_alloc) on a obstack
1493 static void collect_alloca_walker(ir_node *irn, void *data)
1495 be_abi_irg_t *env = data;
1496 if(get_irn_opcode(irn) == iro_Alloc && get_Alloc_where(irn) == stack_alloc)
1497 obstack_ptr_grow(&env->obst, irn);
1500 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
1502 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
1503 ir_node *old_frame = get_irg_frame(birg->irg);
1504 ir_graph *irg = birg->irg;
1509 obstack_init(&env->obst);
1511 env->isa = birg->main_env->arch_env->isa;
1512 env->method_type = get_entity_type(get_irg_entity(irg));
1513 env->call = be_abi_call_new();
1514 arch_isa_get_call_abi(env->isa, env->method_type, env->call);
1516 env->ignore_regs = pset_new_ptr_default();
1517 env->keep_map = pmap_create();
1518 env->dce_survivor = new_survive_dce();
1520 env->stack_phis = pset_new_ptr(16);
1521 env->init_sp = dummy = new_r_Unknown(irg, env->isa->sp->reg_class->mode);
1522 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
1524 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
1526 memcpy(&env->irn_handler, &abi_irn_handler, sizeof(abi_irn_handler));
1527 env->irn_ops.impl = &abi_irn_ops;
1529 /* Lower all call nodes in the IRG. */
1532 /* Process the IRG */
1535 /* We don't need the keep map anymore. */
1536 pmap_destroy(env->keep_map);
1538 /* reroute the stack origin of the calls to the true stack origin. */
1539 edges_reroute(dummy, env->init_sp, irg);
1540 edges_reroute(old_frame, get_irg_frame(irg), irg);
1542 /* Make some important node pointers survive the dead node elimination. */
1543 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
1544 pmap_foreach(env->regs, ent)
1545 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
1547 arch_env_push_irn_handler(env->birg->main_env->arch_env, &env->irn_handler);
1549 env->call->cb->done(env->cb);
1554 void be_abi_free(be_abi_irg_t *env)
1556 free_survive_dce(env->dce_survivor);
1557 del_pset(env->stack_phis);
1558 del_pset(env->ignore_regs);
1559 pmap_destroy(env->regs);
1560 obstack_free(&env->obst, NULL);
1561 arch_env_pop_irn_handler(env->birg->main_env->arch_env);
1565 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
1567 arch_register_t *reg;
1569 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
1570 if(reg->reg_class == cls)
1571 bitset_set(bs, reg->index);
1578 | ___(_)_ __ / ___|| |_ __ _ ___| | __
1579 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
1580 | _| | |> < ___) | || (_| | (__| <
1581 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
1585 struct fix_stack_walker_info {
1587 const arch_env_t *aenv;
1591 * Walker. Collect all stack modifying nodes.
1593 static void collect_stack_nodes_walker(ir_node *irn, void *data)
1595 struct fix_stack_walker_info *info = data;
1597 if(arch_irn_is(info->aenv, irn, modify_sp))
1598 pset_insert_ptr(info->nodes, irn);
1601 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
1603 dom_front_info_t *df;
1604 pset *stack_nodes = pset_new_ptr(16);
1605 struct fix_stack_walker_info info;
1607 info.nodes = stack_nodes;
1608 info.aenv = env->birg->main_env->arch_env;
1610 /* We need dominance frontiers for fix up */
1611 df = be_compute_dominance_frontiers(env->birg->irg);
1612 irg_walk_graph(env->birg->irg, collect_stack_nodes_walker, NULL, &info);
1613 pset_insert_ptr(stack_nodes, env->init_sp);
1614 be_ssa_constr_set_phis(df, stack_nodes, env->stack_phis);
1615 del_pset(stack_nodes);
1617 /* Liveness could have changed due to Phi nodes. */
1618 be_liveness(env->birg->irg);
1620 /* free these dominance frontiers */
1621 be_free_dominance_frontiers(df);
1625 * Translates a direction of an IncSP node (either be_stack_dir_shrink, or ...expand)
1626 * into -1 or 1, respectively.
1627 * @param irn The node.
1628 * @return 1, if the direction of the IncSP was along, -1 if against.
1630 static int get_dir(ir_node *irn)
1632 return 1 - 2 * (be_get_IncSP_direction(irn) == be_stack_dir_shrink);
1635 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
1637 const arch_env_t *aenv = env->birg->main_env->arch_env;
1638 int omit_fp = env->call->flags.bits.try_omit_fp;
1641 sched_foreach(bl, irn) {
1644 If the node modifies the stack pointer by a constant offset,
1645 record that in the bias.
1647 if(be_is_IncSP(irn)) {
1648 int ofs = be_get_IncSP_offset(irn);
1649 int dir = get_dir(irn);
1651 if(ofs == BE_STACK_FRAME_SIZE) {
1652 ofs = get_type_size_bytes(get_irg_frame_type(env->birg->irg));
1653 be_set_IncSP_offset(irn, ofs);
1661 Else check, if the node relates to an entity on the stack frame.
1662 If so, set the true offset (including the bias) for that
1666 entity *ent = arch_get_frame_entity(aenv, irn);
1668 int offset = get_stack_entity_offset(env->frame, ent, bias);
1669 arch_set_frame_offset(aenv, irn, offset);
1670 DBG((env->dbg, LEVEL_2, "%F has offset %d\n", ent, offset));
1679 * A helper struct for the bias walker.
1682 be_abi_irg_t *env; /**< The ABI irg environment. */
1683 int start_block_bias; /**< The bias at the end of the start block. */
1687 * Block-Walker: fix all stack offsets
1689 static void stack_bias_walker(ir_node *bl, void *data)
1691 if(bl != get_irg_start_block(get_irn_irg(bl))) {
1692 struct bias_walk *bw = data;
1693 process_stack_bias(bw->env, bl, bw->start_block_bias);
1697 void be_abi_fix_stack_bias(be_abi_irg_t *env)
1699 ir_graph *irg = env->birg->irg;
1700 struct bias_walk bw;
1702 stack_frame_compute_initial_offset(env->frame);
1703 // stack_frame_dump(stdout, env->frame);
1705 /* Determine the stack bias at the end of the start block. */
1706 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0);
1708 /* fix the bias is all other blocks */
1710 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
1713 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
1715 assert(arch_register_type_is(reg, callee_save));
1716 assert(pmap_contains(abi->regs, (void *) reg));
1717 return pmap_get(abi->regs, (void *) reg);
1721 _____ _____ _ _ _ _ _ _
1722 |_ _| __ \| \ | | | | | | | | |
1723 | | | |__) | \| | | |__| | __ _ _ __ __| | | ___ _ __
1724 | | | _ /| . ` | | __ |/ _` | '_ \ / _` | |/ _ \ '__|
1725 _| |_| | \ \| |\ | | | | | (_| | | | | (_| | | __/ |
1726 |_____|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1728 for Phi nodes which are created due to stack modifying nodes
1729 such as IncSP, AddSP and SetSP.
1731 These Phis are always to be ignored by the reg alloc and are
1732 fixed on the SP register of the ISA.
1735 static const void *abi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn)
1737 const be_abi_irg_t *abi = get_abi_from_handler(handler);
1738 const void *res = NULL;
1740 if(is_Phi(irn) && pset_find_ptr(abi->stack_phis, (void *) irn))
1741 res = &abi->irn_ops;
1746 static void be_abi_limited(void *data, bitset_t *bs)
1748 be_abi_irg_t *abi = data;
1749 bitset_clear_all(bs);
1750 bitset_set(bs, abi->isa->sp->index);
1753 static const arch_register_req_t *abi_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_node *irn, int pos)
1755 be_abi_irg_t *abi = get_abi_from_ops(self);
1756 const arch_register_t *reg = abi->isa->sp;
1758 memset(req, 0, sizeof(req[0]));
1760 if(pos == BE_OUT_POS(0)) {
1761 req->cls = reg->reg_class;
1762 req->type = arch_register_req_type_limited;
1763 req->limited = be_abi_limited;
1764 req->limited_env = abi;
1767 else if(pos >= 0 && pos < get_irn_arity(irn)) {
1768 req->cls = reg->reg_class;
1769 req->type = arch_register_req_type_normal;
1775 static void abi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1779 static const arch_register_t *abi_get_irn_reg(const void *self, const ir_node *irn)
1781 const be_abi_irg_t *abi = get_abi_from_ops(self);
1782 return abi->isa->sp;
1785 static arch_irn_class_t abi_classify(const void *_self, const ir_node *irn)
1787 return arch_irn_class_normal;
1790 static arch_irn_flags_t abi_get_flags(const void *_self, const ir_node *irn)
1792 return arch_irn_flags_ignore | arch_irn_flags_modify_sp;
1795 static entity *abi_get_frame_entity(const void *_self, const ir_node *irn)
1800 static void abi_set_stack_bias(const void *_self, ir_node *irn, int bias)
1804 static const arch_irn_ops_if_t abi_irn_ops = {
1805 abi_get_irn_reg_req,
1810 abi_get_frame_entity,
1814 static const arch_irn_handler_t abi_irn_handler = {