4 * @author Sebastian Hack
19 #include "irgraph_t.h"
22 #include "iredges_t.h"
25 #include "irprintf_t.h"
33 #include "besched_t.h"
35 #define MAX(x, y) ((x) > (y) ? (x) : (y))
36 #define MIN(x, y) ((x) < (y) ? (x) : (y))
38 typedef struct _be_abi_call_arg_t {
41 unsigned on_stack : 1;
44 const arch_register_t *reg;
47 unsigned space_before;
51 struct _be_abi_call_t {
52 be_abi_call_flags_t flags;
53 const be_abi_callbacks_t *cb;
58 #define N_FRAME_TYPES 3
60 typedef struct _be_stack_frame_t {
65 type *order[N_FRAME_TYPES]; /**< arg, between and frame types ordered. */
71 struct _be_stack_slot_t {
72 struct _be_stack_frame_t *frame;
76 struct _be_abi_irg_t {
78 be_stack_frame_t *frame; /**< The stack frame model. */
79 const be_irg_t *birg; /**< The back end IRG. */
80 const arch_isa_t *isa; /**< The isa. */
81 survive_dce_t *dce_survivor;
83 be_abi_call_t *call; /**< The ABI call information. */
84 type *method_type; /**< The type of the method of the IRG. */
86 ir_node *init_sp; /**< The node representing the stack pointer
87 at the start of the function. */
89 ir_node *reg_params; /**< The reg params node. */
90 pmap *regs; /**< A map of all callee-save and ignore regs to
91 their Projs to the RegParams node. */
93 pset *stack_phis; /**< The set of all Phi nodes inserted due to
94 stack pointer modifying nodes. */
96 int start_block_bias; /**< The stack bias at the end of the start block. */
98 void *cb; /**< ABI Callback self pointer. */
100 pmap *keep_map; /**< mapping blocks to keep nodes. */
101 pset *ignore_regs; /**< Additional registers which shall be ignored. */
103 arch_irn_handler_t irn_handler;
104 arch_irn_ops_t irn_ops;
105 DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< The debugging module. */
108 #define get_abi_from_handler(ptr) firm_container_of(ptr, be_abi_irg_t, irn_handler)
109 #define get_abi_from_ops(ptr) firm_container_of(ptr, be_abi_irg_t, irn_ops)
111 /* Forward, since be need it in be_abi_introduce(). */
112 static const arch_irn_ops_if_t abi_irn_ops;
113 static const arch_irn_handler_t abi_irn_handler;
115 /* Flag: if set, try to omit the frame pointer if called by the backend */
119 _ ____ ___ ____ _ _ _ _
120 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
121 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
122 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
123 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
125 These callbacks are used by the backend to set the parameters
126 for a specific call type.
130 * Set compare function: compares two ABI call object arguments.
132 static int cmp_call_arg(const void *a, const void *b, size_t n)
134 const be_abi_call_arg_t *p = a, *q = b;
135 return !(p->is_res == q->is_res && p->pos == q->pos);
139 * Get or set an ABI call object argument.
141 * @param call the abi call
142 * @param is_res true for call results, false for call arguments
143 * @param pos position of the argument
144 * @param do_insert true if the argument is set, false if it's retrieved
146 static be_abi_call_arg_t *get_or_set_call_arg(be_abi_call_t *call, int is_res, int pos, int do_insert)
148 be_abi_call_arg_t arg;
151 memset(&arg, 0, sizeof(arg));
155 hash = is_res * 128 + pos;
158 ? set_insert(call->params, &arg, sizeof(arg), hash)
159 : set_find(call->params, &arg, sizeof(arg), hash);
163 * Retrieve an ABI call object argument.
165 * @param call the ABI call object
166 * @param is_res true for call results, false for call arguments
167 * @param pos position of the argument
169 static INLINE be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
171 return get_or_set_call_arg(call, is_res, pos, 0);
174 /* Set the flags for a call. */
175 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
181 void be_abi_call_param_stack(be_abi_call_t *call, int arg_pos, unsigned alignment, unsigned space_before, unsigned space_after)
183 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
185 arg->alignment = alignment;
186 arg->space_before = space_before;
187 arg->space_after = space_after;
188 assert(alignment > 0 && "Alignment must be greater than 0");
191 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
193 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
198 void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
200 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 1, arg_pos, 1);
205 /* Get the flags of a ABI call object. */
206 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
212 * Constructor for a new ABI call object.
214 * @return the new ABI call object
216 static be_abi_call_t *be_abi_call_new()
218 be_abi_call_t *call = xmalloc(sizeof(call[0]));
220 call->params = new_set(cmp_call_arg, 16);
223 call->flags.bits.try_omit_fp = be_omit_fp;
228 * Destructor for an ABI call object.
230 static void be_abi_call_free(be_abi_call_t *call)
232 del_set(call->params);
238 | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _
239 | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` |
240 | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| |
241 |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, |
244 Handling of the stack frame. It is composed of three types:
245 1) The type of the arguments which are pushed on the stack.
246 2) The "between type" which consists of stuff the call of the
247 function pushes on the stack (like the return address and
248 the old base pointer for ia32).
249 3) The Firm frame type which consists of all local variables
253 static int get_stack_entity_offset(be_stack_frame_t *frame, entity *ent, int bias)
255 type *t = get_entity_owner(ent);
256 int ofs = get_entity_offset_bytes(ent);
260 /* Find the type the entity is contained in. */
261 for(index = 0; index < N_FRAME_TYPES; ++index) {
262 if(frame->order[index] == t)
266 /* Add the size of all the types below the one of the entity to the entity's offset */
267 for(i = 0; i < index; ++i)
268 ofs += get_type_size_bytes(frame->order[i]);
270 /* correct the offset by the initial position of the frame pointer */
271 ofs -= frame->initial_offset;
273 /* correct the offset with the current bias. */
280 * Retrieve the entity with given offset from a frame type.
282 static entity *search_ent_with_offset(type *t, int offset)
286 for(i = 0, n = get_class_n_members(t); i < n; ++i) {
287 entity *ent = get_class_member(t, i);
288 if(get_entity_offset_bytes(ent) == offset)
295 static int stack_frame_compute_initial_offset(be_stack_frame_t *frame)
297 type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
298 entity *ent = search_ent_with_offset(base, 0);
299 frame->initial_offset = 0;
300 frame->initial_offset = get_stack_entity_offset(frame, ent, 0);
301 return frame->initial_offset;
304 static be_stack_frame_t *stack_frame_init(be_stack_frame_t *frame, type *args, type *between, type *locals, int stack_dir)
306 frame->arg_type = args;
307 frame->between_type = between;
308 frame->frame_type = locals;
309 frame->initial_offset = 0;
310 frame->stack_dir = stack_dir;
311 frame->order[1] = between;
314 frame->order[0] = args;
315 frame->order[2] = locals;
319 frame->order[0] = locals;
320 frame->order[2] = args;
326 static void stack_frame_dump(FILE *file, be_stack_frame_t *frame)
330 ir_fprintf(file, "initial offset: %d\n", frame->initial_offset);
331 for(j = 0; j < N_FRAME_TYPES; ++j) {
332 type *t = frame->order[j];
334 ir_fprintf(file, "type %d: %Fm size: %d\n", j, t, get_type_size_bytes(t));
335 for(i = 0, n = get_class_n_members(t); i < n; ++i) {
336 entity *ent = get_class_member(t, i);
337 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));
343 * If irn is a Sel node computes the address of an entity
344 * on the frame type return the entity, else NULL.
346 static INLINE entity *get_sel_ent(ir_node *irn)
348 if(is_Sel(irn) && get_Sel_ptr(irn) == get_irg_frame(get_irn_irg(irn))) {
349 return get_Sel_entity(irn);
356 * Walker: Replaces Loads, Stores and Sels of frame type entities
357 * by FrameLoad, FrameStore and FrameAddress.
359 static void lower_frame_sels_walker(ir_node *irn, void *data)
362 entity *ent = get_sel_ent(irn);
365 be_abi_irg_t *env = data;
366 ir_node *bl = get_nodes_block(irn);
367 ir_graph *irg = get_irn_irg(bl);
368 ir_node *frame = get_irg_frame(irg);
370 nw = be_new_FrameAddr(env->isa->sp->reg_class, irg, bl, frame, ent);
376 * Returns non-zero if the call argument at given position
377 * is transfered on the stack.
379 static INLINE int is_on_stack(be_abi_call_t *call, int pos)
381 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
382 return arg && !arg->in_reg;
392 Adjustment of the calls inside a graph.
397 * Transform a call node.
398 * @param env The ABI environment for the current irg.
399 * @param irn The call node.
400 * @param curr_sp The stack pointer node to use.
401 * @return The stack pointer after the call.
403 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp)
405 ir_graph *irg = env->birg->irg;
406 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
407 be_abi_call_t *call = be_abi_call_new();
408 ir_type *mt = get_Call_type(irn);
409 ir_node *call_ptr = get_Call_ptr(irn);
410 int n_params = get_method_n_params(mt);
411 ir_node *curr_mem = get_Call_mem(irn);
412 ir_node *bl = get_nodes_block(irn);
413 pset *results = pset_new_ptr(8);
414 pset *caller_save = pset_new_ptr(8);
416 int stack_dir = arch_isa_stack_dir(isa);
417 const arch_register_t *sp = arch_isa_sp(isa);
418 ir_mode *mach_mode = sp->reg_class->mode;
419 struct obstack *obst = &env->obst;
420 ir_node *no_mem = get_irg_no_mem(irg);
421 int no_alloc = call->flags.bits.frame_is_setup_on_call;
423 ir_node *res_proj = NULL;
424 int curr_res_proj = pn_Call_max;
431 const ir_edge_t *edge;
436 /* Let the isa fill out the abi description for that call node. */
437 arch_isa_get_call_abi(isa, mt, call);
439 /* Insert code to put the stack arguments on the stack. */
440 assert(get_Call_n_params(irn) == n_params);
441 for(i = 0; i < n_params; ++i) {
442 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
445 stack_size += arg->space_before;
446 stack_size = round_up2(stack_size, arg->alignment);
447 stack_size += get_type_size_bytes(get_method_param_type(mt, i));
448 stack_size += arg->space_after;
449 obstack_int_grow(obst, i);
453 pos = obstack_finish(obst);
455 /* Collect all arguments which are passed in registers. */
456 for(i = 0, n = get_Call_n_params(irn); i < n; ++i) {
457 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
458 if(arg && arg->in_reg) {
459 obstack_int_grow(obst, i);
463 low_args = obstack_finish(obst);
465 /* If there are some parameters which shall be passed on the stack. */
468 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
471 * Reverse list of stack parameters if call arguments are from left to right.
472 * We must them reverse again in they are pushed (not stored) and the stack
473 * direction is downwards.
475 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
476 for(i = 0; i < n_pos >> 1; ++i) {
477 int other = n_pos - i - 1;
485 * If the stack is decreasing and we do not want to store sequentially,
486 * or someone else allocated the call frame
487 * we allocate as much space on the stack all parameters need, by
488 * moving the stack pointer along the stack's direction.
490 if(stack_dir < 0 && !do_seq && !no_alloc) {
491 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, no_mem, stack_size, be_stack_dir_expand);
494 assert(mode_is_reference(mach_mode) && "machine mode must be pointer");
495 for(i = 0; i < n_pos; ++i) {
497 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
498 ir_node *param = get_Call_param(irn, p);
499 ir_node *addr = curr_sp;
501 type *param_type = get_method_param_type(mt, p);
502 int param_size = get_type_size_bytes(param_type) + arg->space_after;
505 * If we wanted to build the arguments sequentially,
506 * the stack pointer for the next must be incremented,
507 * and the memory value propagated.
511 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, curr_mem,
512 param_size + arg->space_before, be_stack_dir_expand);
515 curr_ofs += arg->space_before;
516 curr_ofs = round_up2(curr_ofs, arg->alignment);
518 /* Make the expression to compute the argument's offset. */
520 addr = new_r_Const_long(irg, bl, mode_Is, curr_ofs);
521 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
525 /* Insert a store for primitive arguments. */
526 if (is_atomic_type(param_type)) {
527 mem = new_r_Store(irg, bl, curr_mem, addr, param);
528 mem = new_r_Proj(irg, bl, mem, mode_M, pn_Store_M);
531 /* Make a mem copy for compound arguments. */
533 assert(mode_is_reference(get_irn_mode(param)));
534 mem = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type);
535 mem = new_r_Proj(irg, bl, mem, mode_M, pn_CopyB_M_regular);
538 curr_ofs += param_size;
543 obstack_ptr_grow(obst, mem);
546 in = (ir_node **) obstack_finish(obst);
548 /* We need the sync only, if we didn't build the stores sequentially. */
550 curr_mem = new_r_Sync(irg, bl, n_pos, in);
551 obstack_free(obst, in);
554 /* Collect caller save registers */
555 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
557 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
558 for(j = 0; j < cls->n_regs; ++j) {
559 const arch_register_t *reg = arch_register_for_index(cls, j);
560 if(arch_register_type_is(reg, caller_save))
561 pset_insert_ptr(caller_save, (void *) reg);
565 /* search the greatest result proj number */
567 /* TODO: what if the result is NOT used? Currently there is
568 * no way to detect this later, especially there is no way to
569 * see this in the proj numbers.
570 * While this is ok for the register allocator, it is bad for
571 * backends which need to change the be_Call further (x87 simulator
572 * for instance. However for this particular case the call_type is
575 foreach_out_edge(irn, edge) {
576 const ir_edge_t *res_edge;
577 ir_node *irn = get_edge_src_irn(edge);
579 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_T_result) {
581 foreach_out_edge(irn, res_edge) {
583 be_abi_call_arg_t *arg;
584 ir_node *res = get_edge_src_irn(res_edge);
586 assert(is_Proj(res));
588 proj = get_Proj_proj(res);
589 arg = get_call_arg(call, 1, proj);
592 shift the proj number to the right, since we will drop the
593 unspeakable Proj_T from the Call. Therefore, all real argument
594 Proj numbers must be increased by pn_be_Call_first_res
596 proj += pn_be_Call_first_res;
597 set_Proj_proj(res, proj);
598 obstack_ptr_grow(obst, res);
600 if(proj > curr_res_proj)
601 curr_res_proj = proj;
603 pset_remove_ptr(caller_save, arg->reg);
604 //pmap_insert(arg_regs, arg->reg, INT_TO_PTR(proj + 1))
611 obstack_ptr_grow(obst, NULL);
612 res_projs = obstack_finish(obst);
614 /* make the back end call node and set its register requirements. */
615 for(i = 0; i < n_low_args; ++i)
616 obstack_ptr_grow(obst, get_Call_param(irn, low_args[i]));
618 in = obstack_finish(obst);
620 if(env->call->flags.bits.call_has_imm && get_irn_opcode(call_ptr) == iro_SymConst) {
621 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem, curr_sp, curr_sp,
622 curr_res_proj + pset_count(caller_save), n_low_args, in,
624 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
628 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem, curr_sp, call_ptr,
629 curr_res_proj + pset_count(caller_save), n_low_args, in,
634 Set the register class of the call address to the same as the stack pointer's.
635 That' probably buggy for some architectures.
637 be_node_set_reg_class(low_call, be_pos_Call_ptr, sp->reg_class);
639 /* Set the register classes and constraints of the Call parameters. */
640 for(i = 0; i < n_low_args; ++i) {
641 int index = low_args[i];
642 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
643 assert(arg->reg != NULL);
645 be_set_constr_single_reg(low_call, be_pos_Call_first_arg + index, arg->reg);
648 /* Set the register constraints of the results. */
649 for(i = 0; res_projs[i]; ++i) {
650 ir_node *irn = res_projs[i];
651 int proj = get_Proj_proj(irn);
653 /* Correct Proj number since it has been adjusted! (see above) */
654 const be_abi_call_arg_t *arg = get_call_arg(call, 1, proj - pn_Call_max);
657 be_set_constr_single_reg(low_call, BE_OUT_POS(proj), arg->reg);
659 obstack_free(obst, in);
660 exchange(irn, low_call);
662 /* redirect the result projs to the lowered call instead of the Proj_T */
663 for(i = 0; res_projs[i]; ++i)
664 set_Proj_pred(res_projs[i], low_call);
666 /* Make additional projs for the caller save registers
667 and the Keep node which keeps them alive. */
668 if(pset_count(caller_save) > 0) {
669 const arch_register_t *reg;
673 for(reg = pset_first(caller_save), n = 0; reg; reg = pset_next(caller_save), ++n) {
674 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode, curr_res_proj);
676 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
677 be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg);
678 set_irn_link(proj, (void *) reg);
679 obstack_ptr_grow(obst, proj);
683 in = (ir_node **) obstack_finish(obst);
684 keep = be_new_Keep(NULL, irg, bl, n, in);
685 for(i = 0; i < n; ++i) {
686 const arch_register_t *reg = get_irn_link(in[i]);
687 be_node_set_reg_class(keep, i, reg->reg_class);
689 obstack_free(obst, in);
692 /* Clean up the stack. */
694 ir_node *mem_proj = NULL;
696 foreach_out_edge(low_call, edge) {
697 ir_node *irn = get_edge_src_irn(edge);
698 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
705 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_Call_M);
707 /* Clean up the stack frame if we allocated it */
709 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, mem_proj, stack_size, be_stack_dir_shrink);
712 be_abi_call_free(call);
713 obstack_free(obst, pos);
715 del_pset(caller_save);
722 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
724 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
726 if (get_Alloc_where(alloc) == stack_alloc) {
727 ir_node *bl = get_nodes_block(alloc);
728 ir_graph *irg = get_irn_irg(bl);
729 ir_node *alloc_mem = NULL;
730 ir_node *alloc_res = NULL;
732 const ir_edge_t *edge;
735 foreach_out_edge(alloc, edge) {
736 ir_node *irn = get_edge_src_irn(edge);
738 assert(is_Proj(irn));
739 switch(get_Proj_proj(irn)) {
751 /* Beware: currently Alloc nodes without a result might happen,
752 only escape analysis kills them and this phase runs only for object
753 oriented source. We kill the Alloc here. */
754 if (alloc_res == NULL) {
755 exchange(alloc_mem, get_Alloc_mem(alloc));
759 /* The stack pointer will be modified in an unknown manner.
760 We cannot omit it. */
761 env->call->flags.bits.try_omit_fp = 0;
762 new_alloc = be_new_AddSP(env->isa->sp, irg, bl, curr_sp, get_Alloc_size(alloc));
764 exchange(alloc_res, env->isa->stack_dir < 0 ? new_alloc : curr_sp);
766 if(alloc_mem != NULL)
767 exchange(alloc_mem, new_r_NoMem(irg));
776 * Walker for dependent_on().
777 * This function searches a node tgt recursively from a given node
778 * but is restricted to the given block.
779 * @return 1 if tgt was reachable from curr, 0 if not.
781 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl, unsigned long visited_nr)
785 if(get_irn_visited(curr) >= visited_nr)
788 set_irn_visited(curr, visited_nr);
789 if(get_nodes_block(curr) != bl)
795 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
796 if(check_dependence(get_irn_n(curr, i), tgt, bl, visited_nr))
804 * Check if a node is somehow data dependent on another one.
805 * both nodes must be in the same basic block.
806 * @param n1 The first node.
807 * @param n2 The second node.
808 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
810 static int dependent_on(ir_node *n1, ir_node *n2)
812 ir_node *bl = get_nodes_block(n1);
813 ir_graph *irg = get_irn_irg(bl);
814 long vis_nr = get_irg_visited(irg) + 1;
816 assert(bl == get_nodes_block(n2));
817 set_irg_visited(irg, vis_nr);
818 return check_dependence(n1, n2, bl, vis_nr);
821 static int cmp_call_dependecy(const void *c1, const void *c2)
823 ir_node *n1 = *(ir_node **) c1;
824 ir_node *n2 = *(ir_node **) c2;
827 Classical qsort() comparison function behavior:
828 0 if both elements are equal
829 1 if second is "smaller" that first
830 -1 if first is "smaller" that second
832 return n1 == n2 ? 0 : (dependent_on(n1, n2) ? -1 : 1);
835 static void link_calls_in_block_walker(ir_node *irn, void *data)
838 be_abi_irg_t *env = data;
839 ir_node *bl = get_nodes_block(irn);
840 void *save = get_irn_link(bl);
842 env->call->flags.bits.irg_is_leaf = 0;
844 set_irn_link(irn, save);
845 set_irn_link(bl, irn);
850 * Process all call nodes inside a basic block.
851 * Note that the link field of the block must contain a linked list of all
852 * Call nodes inside the block. We first order this list according to data dependency
853 * and that connect the calls together.
855 static void process_calls_in_block(ir_node *bl, void *data)
857 be_abi_irg_t *env = data;
858 ir_node *curr_sp = env->init_sp;
862 for(irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
863 obstack_ptr_grow(&env->obst, irn);
865 /* If there were call nodes in the block. */
871 nodes = obstack_finish(&env->obst);
873 /* order the call nodes according to data dependency */
874 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependecy);
876 for(i = n - 1; i >= 0; --i) {
877 ir_node *irn = nodes[i];
879 switch(get_irn_opcode(irn)) {
881 curr_sp = adjust_call(env, irn, curr_sp);
884 curr_sp = adjust_alloc(env, irn, curr_sp);
891 obstack_free(&env->obst, nodes);
893 /* Keep the last stack state in the block by tying it to Keep node */
895 keep = be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl), bl, 1, nodes);
896 pmap_insert(env->keep_map, bl, keep);
899 set_irn_link(bl, curr_sp);
903 * Adjust all call nodes in the graph to the ABI conventions.
905 static void process_calls(be_abi_irg_t *env)
907 ir_graph *irg = env->birg->irg;
909 env->call->flags.bits.irg_is_leaf = 1;
910 irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, env);
911 irg_block_walk_graph(irg, NULL, process_calls_in_block, env);
914 static void collect_return_walker(ir_node *irn, void *data)
916 if(get_irn_opcode(irn) == iro_Return) {
917 struct obstack *obst = data;
918 obstack_ptr_grow(obst, irn);
923 static ir_node *setup_frame(be_abi_irg_t *env)
925 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
926 const arch_register_t *sp = isa->sp;
927 const arch_register_t *bp = isa->bp;
928 be_abi_call_flags_bits_t flags = env->call->flags.bits;
929 ir_graph *irg = env->birg->irg;
930 ir_node *bl = get_irg_start_block(irg);
931 ir_node *no_mem = get_irg_no_mem(irg);
932 ir_node *old_frame = get_irg_frame(irg);
933 ir_node *stack = pmap_get(env->regs, (void *) sp);
934 ir_node *frame = pmap_get(env->regs, (void *) bp);
936 int stack_nr = get_Proj_proj(stack);
938 if(flags.try_omit_fp) {
939 stack = be_new_IncSP(sp, irg, bl, stack, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_expand);
944 frame = be_new_Copy(bp->reg_class, irg, bl, stack);
946 be_node_set_flags(frame, -1, arch_irn_flags_dont_spill);
948 be_set_constr_single_reg(frame, -1, bp);
949 be_node_set_flags(frame, -1, arch_irn_flags_ignore);
950 arch_set_irn_register(env->birg->main_env->arch_env, frame, bp);
953 stack = be_new_IncSP(sp, irg, bl, stack, frame, BE_STACK_FRAME_SIZE, be_stack_dir_expand);
956 be_node_set_flags(env->reg_params, -(stack_nr + 1), arch_irn_flags_ignore);
957 env->init_sp = stack;
958 set_irg_frame(irg, frame);
959 edges_reroute(old_frame, frame, irg);
964 static void clearup_frame(be_abi_irg_t *env, ir_node *ret, pmap *reg_map, struct obstack *obst)
966 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
967 const arch_register_t *sp = isa->sp;
968 const arch_register_t *bp = isa->bp;
969 ir_graph *irg = env->birg->irg;
970 ir_node *ret_mem = get_Return_mem(ret);
971 ir_node *frame = get_irg_frame(irg);
972 ir_node *bl = get_nodes_block(ret);
973 ir_node *stack = get_irn_link(bl);
977 if(env->call->flags.bits.try_omit_fp) {
978 stack = be_new_IncSP(sp, irg, bl, stack, ret_mem, BE_STACK_FRAME_SIZE, be_stack_dir_shrink);
982 stack = be_new_SetSP(sp, irg, bl, stack, frame, ret_mem);
983 be_set_constr_single_reg(stack, -1, sp);
984 be_node_set_flags(stack, -1, arch_irn_flags_ignore);
987 pmap_foreach(env->regs, ent) {
988 const arch_register_t *reg = ent->key;
989 ir_node *irn = ent->value;
992 obstack_ptr_grow(&env->obst, stack);
994 obstack_ptr_grow(&env->obst, frame);
995 else if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
996 obstack_ptr_grow(obst, irn);
1002 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type)
1004 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1005 int inc = env->birg->main_env->arch_env->isa->stack_dir * dir;
1006 int n = get_method_n_params(method_type);
1007 int curr = inc > 0 ? 0 : n - 1;
1014 snprintf(buf, sizeof(buf), "%s_arg_type", get_entity_name(get_irg_entity(env->birg->irg)));
1015 res = new_type_class(new_id_from_str(buf));
1017 for(i = 0; i < n; ++i, curr += inc) {
1018 type *param_type = get_method_param_type(method_type, curr);
1019 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1022 snprintf(buf, sizeof(buf), "param_%d", i);
1023 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1024 ofs += arg->space_before;
1025 ofs = round_up2(ofs, arg->alignment);
1026 set_entity_offset_bytes(arg->stack_ent, ofs);
1027 ofs += arg->space_after;
1028 ofs += get_type_size_bytes(param_type);
1032 set_type_size_bytes(res, ofs);
1036 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
1039 struct obstack obst;
1041 obstack_init(&obst);
1043 /* Create a Perm after the RegParams node to delimit it. */
1044 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1045 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1050 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
1051 const arch_register_t *reg = &cls->regs[j];
1052 ir_node *irn = pmap_get(regs, (void *) reg);
1054 if(irn && !arch_register_type_is(reg, ignore)) {
1056 obstack_ptr_grow(&obst, irn);
1057 set_irn_link(irn, (void *) reg);
1061 obstack_ptr_grow(&obst, NULL);
1062 in = obstack_finish(&obst);
1064 perm = be_new_Perm(cls, irg, bl, n_regs, in);
1065 for(j = 0; j < n_regs; ++j) {
1066 ir_node *arg = in[j];
1067 arch_register_t *reg = get_irn_link(arg);
1068 pmap_insert(regs, reg, arg);
1069 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
1072 obstack_free(&obst, in);
1075 obstack_free(&obst, NULL);
1079 const arch_register_t *reg;
1083 static int cmp_regs(const void *a, const void *b)
1085 const reg_node_map_t *p = a;
1086 const reg_node_map_t *q = b;
1088 if(p->reg->reg_class == q->reg->reg_class)
1089 return p->reg->index - q->reg->index;
1091 return p->reg->reg_class - q->reg->reg_class;
1094 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1097 int n = pmap_count(reg_map);
1099 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1101 pmap_foreach(reg_map, ent) {
1102 res[i].reg = ent->key;
1103 res[i].irn = ent->value;
1107 qsort(res, n, sizeof(res[0]), cmp_regs);
1112 * Creates a barrier.
1114 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1116 ir_graph *irg = env->birg->irg;
1117 int n_regs = pmap_count(regs);
1123 rm = reg_map_to_arr(&env->obst, regs);
1125 for(n = 0; n < n_regs; ++n)
1126 obstack_ptr_grow(&env->obst, rm[n].irn);
1129 obstack_ptr_grow(&env->obst, *mem);
1133 in = (ir_node **) obstack_finish(&env->obst);
1134 irn = be_new_Barrier(irg, bl, n, in);
1135 obstack_free(&env->obst, in);
1137 for(n = 0; n < n_regs; ++n) {
1138 const arch_register_t *reg = rm[n].reg;
1140 int pos = BE_OUT_POS(n);
1143 proj = new_r_Proj(irg, bl, irn, get_irn_mode(rm[n].irn), n);
1144 be_node_set_reg_class(irn, n, reg->reg_class);
1146 be_set_constr_single_reg(irn, n, reg);
1147 be_set_constr_single_reg(irn, pos, reg);
1148 be_node_set_reg_class(irn, pos, reg->reg_class);
1149 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1151 /* if the proj projects a ignore register or a node which is set to ignore, propagate this property. */
1152 if(arch_register_type_is(reg, ignore) || arch_irn_is(env->birg->main_env->arch_env, in[n], ignore))
1153 flags |= arch_irn_flags_ignore;
1155 if(arch_irn_is(env->birg->main_env->arch_env, in[n], modify_sp))
1156 flags |= arch_irn_flags_modify_sp;
1158 be_node_set_flags(irn, pos, flags);
1160 pmap_insert(regs, (void *) reg, proj);
1164 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1167 obstack_free(&env->obst, rm);
1172 * Creates a be_Return for a Return node.
1174 * @param @env the abi environment
1175 * @param irn the Return node or NULL if there was none
1176 * @param bl the block where the be_Retun should be placed
1177 * @param mem the current memory
1178 * @param n_res number of return results
1180 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, ir_node *mem, int n_res) {
1181 be_abi_call_t *call = env->call;
1182 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1184 pmap *reg_map = pmap_create();
1185 ir_node *keep = pmap_get(env->keep_map, bl);
1191 const arch_register_t **regs;
1195 get the valid stack node in this block.
1196 If we had a call in that block there is a Keep constructed by process_calls()
1197 which points to the last stack modification in that block. we'll use
1198 it then. Else we use the stack from the start block and let
1199 the ssa construction fix the usage.
1201 stack = be_abi_reg_map_get(env->regs, isa->sp);
1203 ir_node *bad = new_r_Bad(env->birg->irg);
1204 stack = get_irn_n(keep, 0);
1205 set_nodes_block(keep, bad);
1206 set_irn_n(keep, 0, bad);
1207 // exchange(keep, new_r_Bad(env->birg->irg));
1210 /* Insert results for Return into the register map. */
1211 for(i = 0; i < n_res; ++i) {
1212 ir_node *res = get_Return_res(irn, i);
1213 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1214 assert(arg->in_reg && "return value must be passed in register");
1215 pmap_insert(reg_map, (void *) arg->reg, res);
1218 /* Add uses of the callee save registers. */
1219 pmap_foreach(env->regs, ent) {
1220 const arch_register_t *reg = ent->key;
1221 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1222 pmap_insert(reg_map, ent->key, ent->value);
1225 be_abi_reg_map_set(reg_map, isa->sp, stack);
1227 /* Make the Epilogue node and call the arch's epilogue maker. */
1228 create_barrier(env, bl, &mem, reg_map, 1);
1229 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1232 Maximum size of the in array for Return nodes is
1233 return args + callee save/ignore registers + memory + stack pointer
1235 in_max = pmap_count(reg_map) + n_res + 2;
1237 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1238 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1241 in[1] = be_abi_reg_map_get(reg_map, isa->sp);
1246 /* clear SP entry, since it has already been grown. */
1247 pmap_insert(reg_map, (void *) isa->sp, NULL);
1248 for(i = 0; i < n_res; ++i) {
1249 ir_node *res = get_Return_res(irn, i);
1250 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1252 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1253 regs[n++] = arg->reg;
1255 /* Clear the map entry to mark the register as processed. */
1256 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1259 /* grow the rest of the stuff. */
1260 pmap_foreach(reg_map, ent) {
1263 regs[n++] = ent->key;
1267 /* The in array for the new back end return is now ready. */
1268 ret = be_new_Return(irn ? get_irn_dbg_info(irn) : NULL, env->birg->irg, bl, n_res, n, in);
1270 /* Set the register classes of the return's parameter accordingly. */
1271 for(i = 0; i < n; ++i)
1273 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1275 /* Free the space of the Epilog's in array and the register <-> proj map. */
1276 obstack_free(&env->obst, in);
1277 pmap_destroy(reg_map);
1283 * Modify the irg itself and the frame type.
1285 static void modify_irg(be_abi_irg_t *env)
1287 be_abi_call_t *call = env->call;
1288 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1289 const arch_register_t *sp = arch_isa_sp(isa);
1290 ir_graph *irg = env->birg->irg;
1291 ir_node *bl = get_irg_start_block(irg);
1292 ir_node *end = get_irg_end_block(irg);
1293 ir_node *arg_tuple = get_irg_args(irg);
1294 ir_node *no_mem = get_irg_no_mem(irg);
1295 ir_node *mem = get_irg_initial_mem(irg);
1296 type *method_type = get_entity_type(get_irg_entity(irg));
1297 pset *dont_save = pset_new_ptr(8);
1298 int n_params = get_method_n_params(method_type);
1304 const arch_register_t *fp_reg;
1305 ir_node *frame_pointer;
1307 ir_node *reg_params_bl;
1309 const ir_edge_t *edge;
1310 ir_type *arg_type, *bet_type;
1312 bitset_t *used_proj_nr;
1313 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1315 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1317 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1318 irg_walk_graph(irg, lower_frame_sels_walker, NULL, env);
1320 env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0]));
1321 env->regs = pmap_create();
1323 /* Find the maximum proj number of the argument tuple proj */
1324 foreach_out_edge(arg_tuple, edge) {
1325 ir_node *irn = get_edge_src_irn(edge);
1326 int nr = get_Proj_proj(irn);
1327 max_arg = MAX(max_arg, nr);
1330 used_proj_nr = bitset_alloca(1024);
1331 max_arg = MAX(max_arg + 1, n_params);
1332 args = obstack_alloc(&env->obst, max_arg * sizeof(args[0]));
1333 memset(args, 0, max_arg * sizeof(args[0]));
1335 /* Fill the argument vector */
1336 foreach_out_edge(arg_tuple, edge) {
1337 ir_node *irn = get_edge_src_irn(edge);
1338 int nr = get_Proj_proj(irn);
1340 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1343 arg_type = compute_arg_type(env, call, method_type);
1344 bet_type = call->cb->get_between_type(env->cb);
1345 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), isa->stack_dir);
1347 /* Count the register params and add them to the number of Projs for the RegParams node */
1348 for(i = 0; i < n_params; ++i) {
1349 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1350 if(arg->in_reg && args[i]) {
1351 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1352 assert(i == get_Proj_proj(args[i]));
1354 /* For now, associate the register with the old Proj from Start representing that argument. */
1355 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1356 bitset_set(used_proj_nr, i);
1357 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1361 /* Collect all callee-save registers */
1362 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1363 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1364 for(j = 0; j < cls->n_regs; ++j) {
1365 const arch_register_t *reg = &cls->regs[j];
1366 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1367 pmap_insert(env->regs, (void *) reg, NULL);
1371 pmap_insert(env->regs, (void *) sp, NULL);
1372 pmap_insert(env->regs, (void *) isa->bp, NULL);
1373 reg_params_bl = get_irg_start_block(irg);
1374 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1377 * make proj nodes for the callee save registers.
1378 * memorize them, since Return nodes get those as inputs.
1380 * Note, that if a register corresponds to an argument, the regs map contains
1381 * the old Proj from start for that argument.
1384 rm = reg_map_to_arr(&env->obst, env->regs);
1385 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1386 arch_register_t *reg = (void *) rm[i].reg;
1387 ir_node *arg_proj = rm[i].irn;
1388 ir_mode *mode = arg_proj ? get_irn_mode(arg_proj) : reg->reg_class->mode;
1390 int pos = BE_OUT_POS((int) nr);
1396 bitset_set(used_proj_nr, nr);
1397 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1398 pmap_insert(env->regs, (void *) reg, proj);
1399 be_set_constr_single_reg(env->reg_params, pos, reg);
1400 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1403 * If the register is an ignore register,
1404 * The Proj for that register shall also be ignored during register allocation.
1406 if(arch_register_type_is(reg, ignore))
1407 flags |= arch_irn_flags_ignore;
1410 flags |= arch_irn_flags_modify_sp;
1412 be_node_set_flags(env->reg_params, pos, flags);
1414 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1416 obstack_free(&env->obst, rm);
1418 /* Generate the Prologue */
1419 fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
1421 /* do the stack allocation BEFORE the barrier, or spill code
1422 might be added before it */
1423 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1424 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_expand);
1425 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1427 barrier = create_barrier(env, bl, &mem, env->regs, 0);
1429 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1430 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1432 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1433 set_irg_frame(irg, frame_pointer);
1434 pset_insert_ptr(env->ignore_regs, fp_reg);
1436 /* Now, introduce stack param nodes for all parameters passed on the stack */
1437 for(i = 0; i < max_arg; ++i) {
1438 ir_node *arg_proj = args[i];
1439 ir_node *repl = NULL;
1441 if(arg_proj != NULL) {
1442 be_abi_call_arg_t *arg;
1443 ir_type *param_type;
1444 int nr = get_Proj_proj(arg_proj);
1446 nr = MIN(nr, n_params);
1447 arg = get_call_arg(call, 0, nr);
1448 param_type = get_method_param_type(method_type, nr);
1451 repl = pmap_get(env->regs, (void *) arg->reg);
1454 else if(arg->on_stack) {
1455 /* For atomic parameters which are actually used, we create a StackParam node. */
1456 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1457 ir_mode *mode = get_type_mode(param_type);
1458 const arch_register_class_t *cls = arch_isa_get_reg_class_for_mode(isa, mode);
1459 repl = be_new_StackParam(cls, isa->bp->reg_class, irg, reg_params_bl, mode, frame_pointer, arg->stack_ent);
1462 /* The stack parameter is not primitive (it is a struct or array),
1463 we thus will create a node representing the parameter's address
1466 repl = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1470 assert(repl != NULL);
1471 edges_reroute(args[i], repl, irg);
1475 /* All Return nodes hang on the End node, so look for them there. */
1476 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1477 ir_node *irn = get_Block_cfgpred(end, i);
1479 if (is_Return(irn)) {
1480 ir_node *ret = create_be_return(env, irn, get_nodes_block(irn), get_Return_mem(irn), get_Return_n_ress(irn));
1484 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return than,
1485 the code is dead and will never be executed. */
1487 del_pset(dont_save);
1488 obstack_free(&env->obst, args);
1492 * Walker: puts all Alloc(stack_alloc) on a obstack
1494 static void collect_alloca_walker(ir_node *irn, void *data)
1496 be_abi_irg_t *env = data;
1497 if(get_irn_opcode(irn) == iro_Alloc && get_Alloc_where(irn) == stack_alloc)
1498 obstack_ptr_grow(&env->obst, irn);
1501 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
1503 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
1504 ir_node *old_frame = get_irg_frame(birg->irg);
1505 ir_graph *irg = birg->irg;
1510 obstack_init(&env->obst);
1512 env->isa = birg->main_env->arch_env->isa;
1513 env->method_type = get_entity_type(get_irg_entity(irg));
1514 env->call = be_abi_call_new();
1515 arch_isa_get_call_abi(env->isa, env->method_type, env->call);
1517 env->ignore_regs = pset_new_ptr_default();
1518 env->keep_map = pmap_create();
1519 env->dce_survivor = new_survive_dce();
1521 env->stack_phis = pset_new_ptr(16);
1522 env->init_sp = dummy = new_r_Unknown(irg, env->isa->sp->reg_class->mode);
1523 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
1525 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
1527 memcpy(&env->irn_handler, &abi_irn_handler, sizeof(abi_irn_handler));
1528 env->irn_ops.impl = &abi_irn_ops;
1530 /* Lower all call nodes in the IRG. */
1533 /* Process the IRG */
1536 /* We don't need the keep map anymore. */
1537 pmap_destroy(env->keep_map);
1539 /* reroute the stack origin of the calls to the true stack origin. */
1540 edges_reroute(dummy, env->init_sp, irg);
1541 edges_reroute(old_frame, get_irg_frame(irg), irg);
1543 /* Make some important node pointers survive the dead node elimination. */
1544 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
1545 pmap_foreach(env->regs, ent)
1546 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
1548 arch_env_push_irn_handler(env->birg->main_env->arch_env, &env->irn_handler);
1550 env->call->cb->done(env->cb);
1555 void be_abi_free(be_abi_irg_t *env)
1557 free_survive_dce(env->dce_survivor);
1558 del_pset(env->stack_phis);
1559 del_pset(env->ignore_regs);
1560 pmap_destroy(env->regs);
1561 obstack_free(&env->obst, NULL);
1562 arch_env_pop_irn_handler(env->birg->main_env->arch_env);
1566 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
1568 arch_register_t *reg;
1570 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
1571 if(reg->reg_class == cls)
1572 bitset_set(bs, reg->index);
1579 | ___(_)_ __ / ___|| |_ __ _ ___| | __
1580 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
1581 | _| | |> < ___) | || (_| | (__| <
1582 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
1586 struct fix_stack_walker_info {
1588 const arch_env_t *aenv;
1592 * Walker. Collect all stack modifying nodes.
1594 static void collect_stack_nodes_walker(ir_node *irn, void *data)
1596 struct fix_stack_walker_info *info = data;
1598 if(arch_irn_is(info->aenv, irn, modify_sp))
1599 pset_insert_ptr(info->nodes, irn);
1602 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
1604 dom_front_info_t *df;
1605 pset *stack_nodes = pset_new_ptr(16);
1606 struct fix_stack_walker_info info;
1608 info.nodes = stack_nodes;
1609 info.aenv = env->birg->main_env->arch_env;
1611 /* We need dominance frontiers for fix up */
1612 df = be_compute_dominance_frontiers(env->birg->irg);
1613 irg_walk_graph(env->birg->irg, collect_stack_nodes_walker, NULL, &info);
1614 pset_insert_ptr(stack_nodes, env->init_sp);
1615 be_ssa_constr_set_phis(df, stack_nodes, env->stack_phis);
1616 del_pset(stack_nodes);
1618 /* Liveness could have changed due to Phi nodes. */
1619 be_liveness(env->birg->irg);
1621 /* free these dominance frontiers */
1622 be_free_dominance_frontiers(df);
1626 * Translates a direction of an IncSP node (either be_stack_dir_shrink, or ...expand)
1627 * into -1 or 1, respectively.
1628 * @param irn The node.
1629 * @return 1, if the direction of the IncSP was along, -1 if against.
1631 static int get_dir(ir_node *irn)
1633 return 1 - 2 * (be_get_IncSP_direction(irn) == be_stack_dir_shrink);
1636 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
1638 const arch_env_t *aenv = env->birg->main_env->arch_env;
1639 int omit_fp = env->call->flags.bits.try_omit_fp;
1642 sched_foreach(bl, irn) {
1645 If the node modifies the stack pointer by a constant offset,
1646 record that in the bias.
1648 if(be_is_IncSP(irn)) {
1649 int ofs = be_get_IncSP_offset(irn);
1650 int dir = get_dir(irn);
1652 if(ofs == BE_STACK_FRAME_SIZE) {
1653 ofs = get_type_size_bytes(get_irg_frame_type(env->birg->irg));
1654 be_set_IncSP_offset(irn, ofs);
1662 Else check, if the node relates to an entity on the stack frame.
1663 If so, set the true offset (including the bias) for that
1667 entity *ent = arch_get_frame_entity(aenv, irn);
1669 int offset = get_stack_entity_offset(env->frame, ent, bias);
1670 arch_set_frame_offset(aenv, irn, offset);
1671 DBG((env->dbg, LEVEL_2, "%F has offset %d\n", ent, offset));
1680 * A helper struct for the bias walker.
1683 be_abi_irg_t *env; /**< The ABI irg environment. */
1684 int start_block_bias; /**< The bias at the end of the start block. */
1688 * Block-Walker: fix all stack offsets
1690 static void stack_bias_walker(ir_node *bl, void *data)
1692 if(bl != get_irg_start_block(get_irn_irg(bl))) {
1693 struct bias_walk *bw = data;
1694 process_stack_bias(bw->env, bl, bw->start_block_bias);
1698 void be_abi_fix_stack_bias(be_abi_irg_t *env)
1700 ir_graph *irg = env->birg->irg;
1701 struct bias_walk bw;
1703 stack_frame_compute_initial_offset(env->frame);
1704 // stack_frame_dump(stdout, env->frame);
1706 /* Determine the stack bias at the end of the start block. */
1707 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0);
1709 /* fix the bias is all other blocks */
1711 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
1714 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
1716 assert(arch_register_type_is(reg, callee_save));
1717 assert(pmap_contains(abi->regs, (void *) reg));
1718 return pmap_get(abi->regs, (void *) reg);
1722 _____ _____ _ _ _ _ _ _
1723 |_ _| __ \| \ | | | | | | | | |
1724 | | | |__) | \| | | |__| | __ _ _ __ __| | | ___ _ __
1725 | | | _ /| . ` | | __ |/ _` | '_ \ / _` | |/ _ \ '__|
1726 _| |_| | \ \| |\ | | | | | (_| | | | | (_| | | __/ |
1727 |_____|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1729 for Phi nodes which are created due to stack modifying nodes
1730 such as IncSP, AddSP and SetSP.
1732 These Phis are always to be ignored by the reg alloc and are
1733 fixed on the SP register of the ISA.
1736 static const void *abi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn)
1738 const be_abi_irg_t *abi = get_abi_from_handler(handler);
1739 const void *res = NULL;
1741 if(is_Phi(irn) && pset_find_ptr(abi->stack_phis, (void *) irn))
1742 res = &abi->irn_ops;
1747 static void be_abi_limited(void *data, bitset_t *bs)
1749 be_abi_irg_t *abi = data;
1750 bitset_clear_all(bs);
1751 bitset_set(bs, abi->isa->sp->index);
1754 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)
1756 be_abi_irg_t *abi = get_abi_from_ops(self);
1757 const arch_register_t *reg = abi->isa->sp;
1759 memset(req, 0, sizeof(req[0]));
1761 if(pos == BE_OUT_POS(0)) {
1762 req->cls = reg->reg_class;
1763 req->type = arch_register_req_type_limited;
1764 req->limited = be_abi_limited;
1765 req->limited_env = abi;
1768 else if(pos >= 0 && pos < get_irn_arity(irn)) {
1769 req->cls = reg->reg_class;
1770 req->type = arch_register_req_type_normal;
1776 static void abi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1780 static const arch_register_t *abi_get_irn_reg(const void *self, const ir_node *irn)
1782 const be_abi_irg_t *abi = get_abi_from_ops(self);
1783 return abi->isa->sp;
1786 static arch_irn_class_t abi_classify(const void *_self, const ir_node *irn)
1788 return arch_irn_class_normal;
1791 static arch_irn_flags_t abi_get_flags(const void *_self, const ir_node *irn)
1793 return arch_irn_flags_ignore | arch_irn_flags_modify_sp;
1796 static entity *abi_get_frame_entity(const void *_self, const ir_node *irn)
1801 static void abi_set_stack_bias(const void *_self, ir_node *irn, int bias)
1805 static const arch_irn_ops_if_t abi_irn_ops = {
1806 abi_get_irn_reg_req,
1811 abi_get_frame_entity,
1815 static const arch_irn_handler_t abi_irn_handler = {