2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Backend ABI implementation.
23 * @author Sebastian Hack, Michael Beck
33 #include "irgraph_t.h"
36 #include "iredges_t.h"
39 #include "irprintf_t.h"
45 #include "raw_bitset.h"
53 #include "besched_t.h"
55 #include "bessaconstr.h"
57 typedef struct _be_abi_call_arg_t {
58 unsigned is_res : 1; /**< 1: the call argument is a return value. 0: it's a call parameter. */
59 unsigned in_reg : 1; /**< 1: this argument is transmitted in registers. */
60 unsigned on_stack : 1; /**< 1: this argument is transmitted on the stack. */
63 const arch_register_t *reg;
66 unsigned alignment; /**< stack alignment */
67 unsigned space_before; /**< allocate space before */
68 unsigned space_after; /**< allocate space after */
71 struct _be_abi_call_t {
72 be_abi_call_flags_t flags; /**< Flags describing the ABI behavior on calls */
73 int pop; /**< number of bytes the stack frame is shrinked by the callee on return. */
74 const be_abi_callbacks_t *cb;
75 ir_type *between_type;
77 const arch_register_class_t *cls_addr; /**< register class of the call address */
81 * The ABI information for the current birg.
83 struct _be_abi_irg_t {
85 be_irg_t *birg; /**< The back end IRG. */
86 const arch_env_t *arch_env;
87 survive_dce_t *dce_survivor;
89 be_abi_call_t *call; /**< The ABI call information. */
90 ir_type *method_type; /**< The type of the method of the IRG. */
92 ir_node *init_sp; /**< The node representing the stack pointer
93 at the start of the function. */
95 ir_node *reg_params; /**< The reg params node. */
96 pmap *regs; /**< A map of all callee-save and ignore regs to
97 their Projs to the RegParams node. */
99 int start_block_bias; /**< The stack bias at the end of the start block. */
101 void *cb; /**< ABI Callback self pointer. */
103 pmap *keep_map; /**< mapping blocks to keep nodes. */
104 pset *ignore_regs; /**< Additional registers which shall be ignored. */
106 ir_node **calls; /**< flexible array containing all be_Call nodes */
108 arch_register_req_t sp_req;
109 arch_register_req_t sp_cls_req;
111 be_stack_layout_t frame; /**< The stack frame model. */
113 DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< The debugging module. */
116 static heights_t *ir_heights;
118 /** Flag: if set, try to omit the frame pointer in all routines. */
119 static int be_omit_fp = 1;
121 /** Flag: if set, try to omit the frame pointer in leaf routines only. */
122 static int be_omit_leaf_fp = 1;
125 _ ____ ___ ____ _ _ _ _
126 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
127 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
128 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
129 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
131 These callbacks are used by the backend to set the parameters
132 for a specific call type.
136 * Set compare function: compares two ABI call object arguments.
138 static int cmp_call_arg(const void *a, const void *b, size_t n)
140 const be_abi_call_arg_t *p = a, *q = b;
142 return !(p->is_res == q->is_res && p->pos == q->pos);
146 * Get an ABI call object argument.
148 * @param call the abi call
149 * @param is_res true for call results, false for call arguments
150 * @param pos position of the argument
152 static be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
154 be_abi_call_arg_t arg;
157 memset(&arg, 0, sizeof(arg));
161 hash = is_res * 128 + pos;
163 return set_find(call->params, &arg, sizeof(arg), hash);
167 * Set an ABI call object argument.
169 * @param call the abi call
170 * @param is_res true for call results, false for call arguments
171 * @param pos position of the argument
173 static be_abi_call_arg_t *create_call_arg(be_abi_call_t *call, int is_res, int pos)
175 be_abi_call_arg_t arg;
178 memset(&arg, 0, sizeof(arg));
182 hash = is_res * 128 + pos;
184 return set_insert(call->params, &arg, sizeof(arg), hash);
187 /* Set the flags for a call. */
188 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
194 /* Sets the number of bytes the stackframe is shrinked by the callee on return */
195 void be_abi_call_set_pop(be_abi_call_t *call, int pop)
201 /* Set register class for call address */
202 void be_abi_call_set_call_address_reg_class(be_abi_call_t *call, const arch_register_class_t *cls)
204 call->cls_addr = cls;
208 void be_abi_call_param_stack(be_abi_call_t *call, int arg_pos, ir_mode *load_mode, unsigned alignment, unsigned space_before, unsigned space_after)
210 be_abi_call_arg_t *arg = create_call_arg(call, 0, arg_pos);
212 arg->load_mode = load_mode;
213 arg->alignment = alignment;
214 arg->space_before = space_before;
215 arg->space_after = space_after;
216 assert(alignment > 0 && "Alignment must be greater than 0");
219 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
221 be_abi_call_arg_t *arg = create_call_arg(call, 0, arg_pos);
226 void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
228 be_abi_call_arg_t *arg = create_call_arg(call, 1, arg_pos);
233 /* Get the flags of a ABI call object. */
234 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
240 * Constructor for a new ABI call object.
242 * @param cls_addr register class of the call address
244 * @return the new ABI call object
246 static be_abi_call_t *be_abi_call_new(const arch_register_class_t *cls_addr)
248 be_abi_call_t *call = XMALLOCZ(be_abi_call_t);
251 call->params = new_set(cmp_call_arg, 16);
253 call->cls_addr = cls_addr;
255 call->flags.bits.try_omit_fp = be_omit_fp | be_omit_leaf_fp;
261 * Destructor for an ABI call object.
263 static void be_abi_call_free(be_abi_call_t *call)
265 del_set(call->params);
271 | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _
272 | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` |
273 | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| |
274 |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, |
277 Handling of the stack frame. It is composed of three types:
278 1) The type of the arguments which are pushed on the stack.
279 2) The "between type" which consists of stuff the call of the
280 function pushes on the stack (like the return address and
281 the old base pointer for ia32).
282 3) The Firm frame type which consists of all local variables
286 static int get_stack_entity_offset(be_stack_layout_t *frame, ir_entity *ent,
289 ir_type *t = get_entity_owner(ent);
290 int ofs = get_entity_offset(ent);
294 /* Find the type the entity is contained in. */
295 for (index = 0; index < N_FRAME_TYPES; ++index) {
296 if (frame->order[index] == t)
298 /* Add the size of all the types below the one of the entity to the entity's offset */
299 ofs += get_type_size_bytes(frame->order[index]);
302 /* correct the offset by the initial position of the frame pointer */
303 ofs -= frame->initial_offset;
305 /* correct the offset with the current bias. */
312 * Retrieve the entity with given offset from a frame type.
314 static ir_entity *search_ent_with_offset(ir_type *t, int offset)
318 for(i = 0, n = get_compound_n_members(t); i < n; ++i) {
319 ir_entity *ent = get_compound_member(t, i);
320 if (get_entity_offset(ent) == offset)
327 static int stack_frame_compute_initial_offset(be_stack_layout_t *frame)
329 ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
330 ir_entity *ent = search_ent_with_offset(base, 0);
332 frame->initial_offset = ent ? get_stack_entity_offset(frame, ent, 0) : 0;
334 return frame->initial_offset;
338 * Initializes the frame layout from parts
340 * @param frame the stack layout that will be initialized
341 * @param args the stack argument layout type
342 * @param between the between layout type
343 * @param locals the method frame type
344 * @param stack_dir the stack direction
345 * @param param_map an array mapping method argument positions to the stack argument type
347 * @return the initialized stack layout
349 static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *args,
350 ir_type *between, ir_type *locals, int stack_dir,
351 ir_entity *param_map[])
353 frame->arg_type = args;
354 frame->between_type = between;
355 frame->frame_type = locals;
356 frame->initial_offset = 0;
357 frame->initial_bias = 0;
358 frame->stack_dir = stack_dir;
359 frame->order[1] = between;
360 frame->param_map = param_map;
363 frame->order[0] = args;
364 frame->order[2] = locals;
367 frame->order[0] = locals;
368 frame->order[2] = args;
374 /** Dumps the stack layout to file. */
375 static void stack_layout_dump(FILE *file, be_stack_layout_t *frame)
379 ir_fprintf(file, "initial offset: %d\n", frame->initial_offset);
380 for (j = 0; j < N_FRAME_TYPES; ++j) {
381 ir_type *t = frame->order[j];
383 ir_fprintf(file, "type %d: %F size: %d\n", j, t, get_type_size_bytes(t));
384 for (i = 0, n = get_compound_n_members(t); i < n; ++i) {
385 ir_entity *ent = get_compound_member(t, i);
386 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));
393 * Returns non-zero if the call argument at given position
394 * is transfered on the stack.
396 static inline int is_on_stack(be_abi_call_t *call, int pos)
398 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
399 return arg && !arg->in_reg;
409 Adjustment of the calls inside a graph.
414 * Transform a call node into a be_Call node.
416 * @param env The ABI environment for the current irg.
417 * @param irn The call node.
418 * @param curr_sp The stack pointer node to use.
419 * @return The stack pointer after the call.
421 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp)
423 ir_graph *irg = env->birg->irg;
424 const arch_env_t *arch_env = env->birg->main_env->arch_env;
425 ir_type *call_tp = get_Call_type(irn);
426 ir_node *call_ptr = get_Call_ptr(irn);
427 int n_params = get_method_n_params(call_tp);
428 ir_node *curr_mem = get_Call_mem(irn);
429 ir_node *bl = get_nodes_block(irn);
430 pset *results = pset_new_ptr(8);
431 pset *caller_save = pset_new_ptr(8);
432 pset *states = pset_new_ptr(2);
434 int stack_dir = arch_env_stack_dir(arch_env);
435 const arch_register_t *sp = arch_env_sp(arch_env);
436 be_abi_call_t *call = be_abi_call_new(sp->reg_class);
437 ir_mode *mach_mode = sp->reg_class->mode;
438 struct obstack *obst = &env->obst;
439 int no_alloc = call->flags.bits.frame_is_setup_on_call;
440 int n_res = get_method_n_ress(call_tp);
441 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
443 ir_node *res_proj = NULL;
444 int n_reg_params = 0;
445 int n_stack_params = 0;
451 int n_reg_results = 0;
452 const arch_register_t *reg;
453 const ir_edge_t *edge;
455 int *stack_param_idx;
458 /* Let the isa fill out the abi description for that call node. */
459 arch_env_get_call_abi(arch_env, call_tp, call);
461 /* Insert code to put the stack arguments on the stack. */
462 assert(get_Call_n_params(irn) == n_params);
463 for (i = 0; i < n_params; ++i) {
464 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
467 int arg_size = get_type_size_bytes(get_method_param_type(call_tp, i));
469 stack_size += round_up2(arg->space_before, arg->alignment);
470 stack_size += round_up2(arg_size, arg->alignment);
471 stack_size += round_up2(arg->space_after, arg->alignment);
472 obstack_int_grow(obst, i);
476 stack_param_idx = obstack_finish(obst);
478 /* Collect all arguments which are passed in registers. */
479 for (i = 0; i < n_params; ++i) {
480 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
481 if (arg && arg->in_reg) {
482 obstack_int_grow(obst, i);
486 reg_param_idxs = obstack_finish(obst);
489 * If the stack is decreasing and we do not want to store sequentially,
490 * or someone else allocated the call frame
491 * we allocate as much space on the stack all parameters need, by
492 * moving the stack pointer along the stack's direction.
494 * Note: we also have to do this for stack_size == 0, because we may have
495 * to adjust stack alignment for the call.
497 if (stack_dir < 0 && !do_seq && !no_alloc) {
498 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, stack_size, 1);
501 /* If there are some parameters which shall be passed on the stack. */
502 if (n_stack_params > 0) {
506 * Reverse list of stack parameters if call arguments are from left to right.
507 * We must them reverse again if they are pushed (not stored) and the stack
508 * direction is downwards.
510 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
511 for (i = 0; i < n_stack_params >> 1; ++i) {
512 int other = n_stack_params - i - 1;
513 int tmp = stack_param_idx[i];
514 stack_param_idx[i] = stack_param_idx[other];
515 stack_param_idx[other] = tmp;
519 curr_mem = get_Call_mem(irn);
521 obstack_ptr_grow(obst, curr_mem);
524 for (i = 0; i < n_stack_params; ++i) {
525 int p = stack_param_idx[i];
526 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
527 ir_node *param = get_Call_param(irn, p);
528 ir_node *addr = curr_sp;
530 ir_type *param_type = get_method_param_type(call_tp, p);
531 int param_size = get_type_size_bytes(param_type) + arg->space_after;
534 * If we wanted to build the arguments sequentially,
535 * the stack pointer for the next must be incremented,
536 * and the memory value propagated.
540 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, param_size + arg->space_before, 0);
541 add_irn_dep(curr_sp, curr_mem);
544 curr_ofs += arg->space_before;
545 curr_ofs = round_up2(curr_ofs, arg->alignment);
547 /* Make the expression to compute the argument's offset. */
549 ir_mode *constmode = mach_mode;
550 if(mode_is_reference(mach_mode)) {
553 addr = new_r_Const_long(irg, bl, constmode, curr_ofs);
554 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
558 /* Insert a store for primitive arguments. */
559 if (is_atomic_type(param_type)) {
561 ir_node *mem_input = do_seq ? curr_mem : new_NoMem();
562 store = new_r_Store(irg, bl, mem_input, addr, param);
563 mem = new_r_Proj(irg, bl, store, mode_M, pn_Store_M);
566 /* Make a mem copy for compound arguments. */
570 assert(mode_is_reference(get_irn_mode(param)));
571 copy = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type);
572 mem = new_r_Proj(irg, bl, copy, mode_M, pn_CopyB_M_regular);
575 curr_ofs += param_size;
580 obstack_ptr_grow(obst, mem);
583 in = (ir_node **) obstack_finish(obst);
585 /* We need the sync only, if we didn't build the stores sequentially. */
587 if (n_stack_params >= 1) {
588 curr_mem = new_r_Sync(irg, bl, n_stack_params + 1, in);
590 curr_mem = get_Call_mem(irn);
593 obstack_free(obst, in);
596 /* Collect caller save registers */
597 for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
599 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
600 for (j = 0; j < cls->n_regs; ++j) {
601 const arch_register_t *reg = arch_register_for_index(cls, j);
602 if (arch_register_type_is(reg, caller_save)) {
603 pset_insert_ptr(caller_save, (void *) reg);
605 if (arch_register_type_is(reg, state)) {
606 pset_insert_ptr(caller_save, (void*) reg);
607 pset_insert_ptr(states, (void*) reg);
612 /* search the greatest result proj number */
614 res_projs = ALLOCANZ(ir_node*, n_res);
616 foreach_out_edge(irn, edge) {
617 const ir_edge_t *res_edge;
618 ir_node *irn = get_edge_src_irn(edge);
620 if(!is_Proj(irn) || get_Proj_proj(irn) != pn_Call_T_result)
623 foreach_out_edge(irn, res_edge) {
625 ir_node *res = get_edge_src_irn(res_edge);
627 assert(is_Proj(res));
629 proj = get_Proj_proj(res);
630 assert(proj < n_res);
631 assert(res_projs[proj] == NULL);
632 res_projs[proj] = res;
638 /** TODO: this is not correct for cases where return values are passed
639 * on the stack, but no known ABI does this currently...
641 n_reg_results = n_res;
643 /* make the back end call node and set its register requirements. */
644 for (i = 0; i < n_reg_params; ++i) {
645 obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
647 foreach_pset(states, reg) {
648 const arch_register_class_t *cls = arch_register_get_class(reg);
650 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
651 ir_fprintf(stderr, "Adding %+F\n", regnode);
653 ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
654 obstack_ptr_grow(obst, regnode);
656 n_ins = n_reg_params + pset_count(states);
658 in = obstack_finish(obst);
660 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
662 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
664 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
665 n_ins, in, get_Call_type(irn));
666 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
669 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
671 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
672 n_ins, in, get_Call_type(irn));
674 be_Call_set_pop(low_call, call->pop);
675 ARR_APP1(ir_node *, env->calls, low_call);
677 /* create new stack pointer */
678 curr_sp = new_r_Proj(irg, bl, low_call, get_irn_mode(curr_sp),
680 be_set_constr_single_reg_out(low_call, pn_be_Call_sp, sp,
681 arch_register_req_type_ignore | arch_register_req_type_produces_sp);
682 arch_set_irn_register(curr_sp, sp);
684 for(i = 0; i < n_res; ++i) {
686 ir_node *proj = res_projs[i];
687 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
689 /* returns values on stack not supported yet */
693 shift the proj number to the right, since we will drop the
694 unspeakable Proj_T from the Call. Therefore, all real argument
695 Proj numbers must be increased by pn_be_Call_first_res
697 pn = i + pn_be_Call_first_res;
700 ir_type *res_type = get_method_res_type(call_tp, i);
701 ir_mode *mode = get_type_mode(res_type);
702 proj = new_r_Proj(irg, bl, low_call, mode, pn);
705 set_Proj_pred(proj, low_call);
706 set_Proj_proj(proj, pn);
710 pset_remove_ptr(caller_save, arg->reg);
715 Set the register class of the call address to
716 the backend provided class (default: stack pointer class)
718 be_node_set_reg_class_in(low_call, be_pos_Call_ptr, call->cls_addr);
720 DBG((env->dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
722 /* Set the register classes and constraints of the Call parameters. */
723 for (i = 0; i < n_reg_params; ++i) {
724 int index = reg_param_idxs[i];
725 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
726 assert(arg->reg != NULL);
728 be_set_constr_single_reg_in(low_call, be_pos_Call_first_arg + i,
732 /* Set the register constraints of the results. */
733 for (i = 0; i < n_res; ++i) {
734 ir_node *proj = res_projs[i];
735 const be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
736 int pn = get_Proj_proj(proj);
739 be_set_constr_single_reg_out(low_call, pn, arg->reg, 0);
740 arch_set_irn_register(proj, arg->reg);
742 obstack_free(obst, in);
743 exchange(irn, low_call);
745 /* kill the ProjT node */
746 if (res_proj != NULL) {
750 /* Make additional projs for the caller save registers
751 and the Keep node which keeps them alive. */
752 if (1 || pset_count(caller_save) + n_reg_results > 0) {
753 const arch_register_t *reg;
758 = pn_be_Call_first_res + n_reg_results;
760 /* also keep the stack pointer */
762 set_irn_link(curr_sp, (void*) sp);
763 obstack_ptr_grow(obst, curr_sp);
765 for (reg = pset_first(caller_save); reg; reg = pset_next(caller_save), ++n) {
766 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode,
769 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
770 be_set_constr_single_reg_out(low_call, curr_res_proj, reg, 0);
771 arch_set_irn_register(proj, reg);
773 set_irn_link(proj, (void*) reg);
774 obstack_ptr_grow(obst, proj);
778 for(i = 0; i < n_reg_results; ++i) {
779 ir_node *proj = res_projs[i];
780 const arch_register_t *reg = arch_get_irn_register(proj);
781 set_irn_link(proj, (void*) reg);
782 obstack_ptr_grow(obst, proj);
786 /* create the Keep for the caller save registers */
787 in = (ir_node **) obstack_finish(obst);
788 keep = be_new_Keep(NULL, irg, bl, n, in);
789 for (i = 0; i < n; ++i) {
790 const arch_register_t *reg = get_irn_link(in[i]);
791 be_node_set_reg_class_in(keep, i, reg->reg_class);
793 obstack_free(obst, in);
796 /* Clean up the stack. */
797 assert(stack_size >= call->pop);
798 stack_size -= call->pop;
800 if (stack_size > 0) {
801 ir_node *mem_proj = NULL;
803 foreach_out_edge(low_call, edge) {
804 ir_node *irn = get_edge_src_irn(edge);
805 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
812 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_be_Call_M_regular);
813 keep_alive(mem_proj);
816 /* Clean up the stack frame or revert alignment fixes if we allocated it */
818 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size, 0);
821 be_abi_call_free(call);
822 obstack_free(obst, stack_param_idx);
825 del_pset(caller_save);
831 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
833 * @param alignment the minimum stack alignment
834 * @param size the node containing the non-aligned size
835 * @param irg the irg where new nodes are allocated on
836 * @param irg the block where new nodes are allocated on
837 * @param dbg debug info for new nodes
839 * @return a node representing the aligned size
841 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size,
842 ir_graph *irg, ir_node *block, dbg_info *dbg)
844 if (stack_alignment > 1) {
849 assert(is_po2(stack_alignment));
851 mode = get_irn_mode(size);
852 tv = new_tarval_from_long(stack_alignment-1, mode);
853 mask = new_r_Const(irg, block, mode, tv);
854 size = new_rd_Add(dbg, irg, block, size, mask, mode);
856 tv = new_tarval_from_long(-(long)stack_alignment, mode);
857 mask = new_r_Const(irg, block, mode, tv);
858 size = new_rd_And(dbg, irg, block, size, mask, mode);
864 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
866 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
875 const ir_edge_t *edge;
876 ir_node *new_alloc, *size, *addr, *ins[2];
877 unsigned stack_alignment;
879 assert(get_Alloc_where(alloc) == stack_alloc);
881 block = get_nodes_block(alloc);
882 irg = get_irn_irg(block);
885 type = get_Alloc_type(alloc);
887 foreach_out_edge(alloc, edge) {
888 ir_node *irn = get_edge_src_irn(edge);
890 assert(is_Proj(irn));
891 switch (get_Proj_proj(irn)) {
903 /* Beware: currently Alloc nodes without a result might happen,
904 only escape analysis kills them and this phase runs only for object
905 oriented source. We kill the Alloc here. */
906 if (alloc_res == NULL && alloc_mem) {
907 exchange(alloc_mem, get_Alloc_mem(alloc));
911 dbg = get_irn_dbg_info(alloc);
913 /* we might need to multiply the size with the element size */
914 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
915 tarval *tv = new_tarval_from_long(get_type_size_bytes(type),
917 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
918 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Alloc_size(alloc),
922 size = get_Alloc_size(alloc);
925 /* The stack pointer will be modified in an unknown manner.
926 We cannot omit it. */
927 env->call->flags.bits.try_omit_fp = 0;
929 stack_alignment = 1 << env->arch_env->stack_alignment;
930 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
931 new_alloc = be_new_AddSP(env->arch_env->sp, irg, block, curr_sp, size);
932 set_irn_dbg_info(new_alloc, dbg);
934 if(alloc_mem != NULL) {
938 addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
940 /* We need to sync the output mem of the AddSP with the input mem
941 edge into the alloc node. */
942 ins[0] = get_Alloc_mem(alloc);
944 sync = new_r_Sync(irg, block, 2, ins);
946 exchange(alloc_mem, sync);
949 exchange(alloc, new_alloc);
951 /* fix projnum of alloca res */
952 set_Proj_proj(alloc_res, pn_be_AddSP_res);
955 curr_sp = new_r_Proj(irg, block, new_alloc, get_irn_mode(curr_sp),
963 * The Free is transformed into a back end free node and connected to the stack nodes.
965 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
969 ir_node *subsp, *mem, *res, *size, *sync;
973 unsigned stack_alignment;
976 assert(get_Free_where(free) == stack_alloc);
978 block = get_nodes_block(free);
979 irg = get_irn_irg(block);
980 type = get_Free_type(free);
981 sp_mode = env->arch_env->sp->reg_class->mode;
982 dbg = get_irn_dbg_info(free);
984 /* we might need to multiply the size with the element size */
985 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
986 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
987 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
988 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
992 size = get_Free_size(free);
995 stack_alignment = 1 << env->arch_env->stack_alignment;
996 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
998 /* The stack pointer will be modified in an unknown manner.
999 We cannot omit it. */
1000 env->call->flags.bits.try_omit_fp = 0;
1001 subsp = be_new_SubSP(env->arch_env->sp, irg, block, curr_sp, size);
1002 set_irn_dbg_info(subsp, dbg);
1004 mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
1005 res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_sp);
1007 /* we need to sync the memory */
1008 in[0] = get_Free_mem(free);
1010 sync = new_r_Sync(irg, block, 2, in);
1012 /* and make the AddSP dependent on the former memory */
1013 add_irn_dep(subsp, get_Free_mem(free));
1016 exchange(free, sync);
1022 /* the following function is replaced by the usage of the heights module */
1025 * Walker for dependent_on().
1026 * This function searches a node tgt recursively from a given node
1027 * but is restricted to the given block.
1028 * @return 1 if tgt was reachable from curr, 0 if not.
1030 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl)
1034 if (get_nodes_block(curr) != bl)
1040 /* Phi functions stop the recursion inside a basic block */
1041 if (! is_Phi(curr)) {
1042 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
1043 if (check_dependence(get_irn_n(curr, i), tgt, bl))
1053 * Check if a node is somehow data dependent on another one.
1054 * both nodes must be in the same basic block.
1055 * @param n1 The first node.
1056 * @param n2 The second node.
1057 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1059 static int dependent_on(ir_node *n1, ir_node *n2)
1061 assert(get_nodes_block(n1) == get_nodes_block(n2));
1063 return heights_reachable_in_block(ir_heights, n1, n2);
1066 static int cmp_call_dependency(const void *c1, const void *c2)
1068 ir_node *n1 = *(ir_node **) c1;
1069 ir_node *n2 = *(ir_node **) c2;
1072 Classical qsort() comparison function behavior:
1073 0 if both elements are equal
1074 1 if second is "smaller" that first
1075 -1 if first is "smaller" that second
1077 if (dependent_on(n1, n2))
1080 if (dependent_on(n2, n1))
1087 * Walker: links all Call/Alloc/Free nodes to the Block they are contained.
1088 * Clears the irg_is_leaf flag if a Call is detected.
1090 static void link_ops_in_block_walker(ir_node *irn, void *data)
1092 ir_opcode code = get_irn_opcode(irn);
1094 if (code == iro_Call ||
1095 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1096 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1097 be_abi_irg_t *env = data;
1098 ir_node *bl = get_nodes_block(irn);
1099 void *save = get_irn_link(bl);
1101 if (code == iro_Call)
1102 env->call->flags.bits.irg_is_leaf = 0;
1104 set_irn_link(irn, save);
1105 set_irn_link(bl, irn);
1111 * Process all Call/Alloc/Free nodes inside a basic block.
1112 * Note that the link field of the block must contain a linked list of all
1113 * Call nodes inside the Block. We first order this list according to data dependency
1114 * and that connect the calls together.
1116 static void process_ops_in_block(ir_node *bl, void *data)
1118 be_abi_irg_t *env = data;
1119 ir_node *curr_sp = env->init_sp;
1123 for (irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
1124 obstack_ptr_grow(&env->obst, irn);
1126 /* If there were call nodes in the block. */
1132 nodes = obstack_finish(&env->obst);
1134 /* order the call nodes according to data dependency */
1135 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
1137 for (i = n - 1; i >= 0; --i) {
1138 ir_node *irn = nodes[i];
1140 DBG((env->dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1141 switch (get_irn_opcode(irn)) {
1144 /* The stack pointer will be modified due to a call. */
1145 env->call->flags.bits.try_omit_fp = 0;
1147 curr_sp = adjust_call(env, irn, curr_sp);
1150 if (get_Alloc_where(irn) == stack_alloc)
1151 curr_sp = adjust_alloc(env, irn, curr_sp);
1154 if (get_Free_where(irn) == stack_alloc)
1155 curr_sp = adjust_free(env, irn, curr_sp);
1158 panic("invalid call");
1163 obstack_free(&env->obst, nodes);
1165 /* Keep the last stack state in the block by tying it to Keep node,
1166 * the proj from calls is already kept */
1167 if (curr_sp != env->init_sp &&
1168 !(is_Proj(curr_sp) && be_is_Call(get_Proj_pred(curr_sp)))) {
1170 keep = be_new_Keep(env->arch_env->sp->reg_class,
1171 get_irn_irg(bl), bl, 1, nodes);
1172 pmap_insert(env->keep_map, bl, keep);
1176 set_irn_link(bl, curr_sp);
1177 } /* process_calls_in_block */
1180 * Adjust all call nodes in the graph to the ABI conventions.
1182 static void process_calls(be_abi_irg_t *env)
1184 ir_graph *irg = env->birg->irg;
1186 env->call->flags.bits.irg_is_leaf = 1;
1187 irg_walk_graph(irg, firm_clear_link, link_ops_in_block_walker, env);
1189 ir_heights = heights_new(env->birg->irg);
1190 irg_block_walk_graph(irg, NULL, process_ops_in_block, env);
1191 heights_free(ir_heights);
1195 * Computes the stack argument layout type.
1196 * Changes a possibly allocated value param type by moving
1197 * entities to the stack layout type.
1199 * @param env the ABI environment
1200 * @param call the current call ABI
1201 * @param method_type the method type
1202 * @param param_map an array mapping method arguments to the stack layout type
1204 * @return the stack argument layout type
1206 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type, ir_entity ***param_map)
1208 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1209 int inc = env->birg->main_env->arch_env->stack_dir * dir;
1210 int n = get_method_n_params(method_type);
1211 int curr = inc > 0 ? 0 : n - 1;
1217 ir_type *val_param_tp = get_method_value_param_type(method_type);
1218 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1221 *param_map = map = obstack_alloc(&env->obst, n * sizeof(ir_entity *));
1222 res = new_type_struct(mangle_u(id, new_id_from_chars("arg_type", 8)));
1223 for (i = 0; i < n; ++i, curr += inc) {
1224 ir_type *param_type = get_method_param_type(method_type, curr);
1225 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1228 if (arg->on_stack) {
1230 /* the entity was already created, move it to the param type */
1231 arg->stack_ent = get_method_value_param_ent(method_type, i);
1232 remove_struct_member(val_param_tp, arg->stack_ent);
1233 set_entity_owner(arg->stack_ent, res);
1234 add_struct_member(res, arg->stack_ent);
1235 /* must be automatic to set a fixed layout */
1236 set_entity_allocation(arg->stack_ent, allocation_automatic);
1239 snprintf(buf, sizeof(buf), "param_%d", i);
1240 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1242 ofs += arg->space_before;
1243 ofs = round_up2(ofs, arg->alignment);
1244 set_entity_offset(arg->stack_ent, ofs);
1245 ofs += arg->space_after;
1246 ofs += get_type_size_bytes(param_type);
1247 map[i] = arg->stack_ent;
1250 set_type_size_bytes(res, ofs);
1251 set_type_state(res, layout_fixed);
1256 const arch_register_t *reg;
1260 static int cmp_regs(const void *a, const void *b)
1262 const reg_node_map_t *p = a;
1263 const reg_node_map_t *q = b;
1265 if(p->reg->reg_class == q->reg->reg_class)
1266 return p->reg->index - q->reg->index;
1268 return p->reg->reg_class - q->reg->reg_class;
1271 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1274 int n = pmap_count(reg_map);
1276 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1278 foreach_pmap(reg_map, ent) {
1279 res[i].reg = ent->key;
1280 res[i].irn = ent->value;
1284 qsort(res, n, sizeof(res[0]), cmp_regs);
1289 * Creates a barrier.
1291 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1293 ir_graph *irg = env->birg->irg;
1294 int n_regs = pmap_count(regs);
1300 rm = reg_map_to_arr(&env->obst, regs);
1302 for (n = 0; n < n_regs; ++n)
1303 obstack_ptr_grow(&env->obst, rm[n].irn);
1306 obstack_ptr_grow(&env->obst, *mem);
1310 in = (ir_node **) obstack_finish(&env->obst);
1311 irn = be_new_Barrier(irg, bl, n, in);
1312 obstack_free(&env->obst, in);
1314 for(n = 0; n < n_regs; ++n) {
1315 ir_node *pred = rm[n].irn;
1316 const arch_register_t *reg = rm[n].reg;
1317 arch_register_type_t add_type = 0;
1320 /* stupid workaround for now... as not all nodes report register
1322 if (!is_Phi(pred)) {
1323 const arch_register_req_t *ireq = arch_get_register_req_out(pred);
1324 if (ireq->type & arch_register_req_type_ignore)
1325 add_type |= arch_register_req_type_ignore;
1326 if (ireq->type & arch_register_req_type_produces_sp)
1327 add_type |= arch_register_req_type_produces_sp;
1330 proj = new_r_Proj(irg, bl, irn, get_irn_mode(pred), n);
1331 be_node_set_reg_class_in(irn, n, reg->reg_class);
1333 be_set_constr_single_reg_in(irn, n, reg, 0);
1334 be_set_constr_single_reg_out(irn, n, reg, add_type);
1335 arch_set_irn_register(proj, reg);
1337 pmap_insert(regs, (void *) reg, proj);
1341 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1344 obstack_free(&env->obst, rm);
1349 * Creates a be_Return for a Return node.
1351 * @param @env the abi environment
1352 * @param irn the Return node or NULL if there was none
1353 * @param bl the block where the be_Retun should be placed
1354 * @param mem the current memory
1355 * @param n_res number of return results
1357 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl,
1358 ir_node *mem, int n_res)
1360 be_abi_call_t *call = env->call;
1361 const arch_env_t *arch_env = env->birg->main_env->arch_env;
1363 pmap *reg_map = pmap_create();
1364 ir_node *keep = pmap_get(env->keep_map, bl);
1371 const arch_register_t **regs;
1375 get the valid stack node in this block.
1376 If we had a call in that block there is a Keep constructed by process_calls()
1377 which points to the last stack modification in that block. we'll use
1378 it then. Else we use the stack from the start block and let
1379 the ssa construction fix the usage.
1381 stack = be_abi_reg_map_get(env->regs, arch_env->sp);
1383 stack = get_irn_n(keep, 0);
1385 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1388 /* Insert results for Return into the register map. */
1389 for (i = 0; i < n_res; ++i) {
1390 ir_node *res = get_Return_res(irn, i);
1391 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1392 assert(arg->in_reg && "return value must be passed in register");
1393 pmap_insert(reg_map, (void *) arg->reg, res);
1396 /* Add uses of the callee save registers. */
1397 foreach_pmap(env->regs, ent) {
1398 const arch_register_t *reg = ent->key;
1399 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1400 pmap_insert(reg_map, ent->key, ent->value);
1403 be_abi_reg_map_set(reg_map, arch_env->sp, stack);
1405 /* Make the Epilogue node and call the arch's epilogue maker. */
1406 create_barrier(env, bl, &mem, reg_map, 1);
1407 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1410 Maximum size of the in array for Return nodes is
1411 return args + callee save/ignore registers + memory + stack pointer
1413 in_max = pmap_count(reg_map) + n_res + 2;
1415 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1416 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1419 in[1] = be_abi_reg_map_get(reg_map, arch_env->sp);
1421 regs[1] = arch_env->sp;
1424 /* clear SP entry, since it has already been grown. */
1425 pmap_insert(reg_map, (void *) arch_env->sp, NULL);
1426 for (i = 0; i < n_res; ++i) {
1427 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1429 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1430 regs[n++] = arg->reg;
1432 /* Clear the map entry to mark the register as processed. */
1433 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1436 /* grow the rest of the stuff. */
1437 foreach_pmap(reg_map, ent) {
1440 regs[n++] = ent->key;
1444 /* The in array for the new back end return is now ready. */
1446 dbgi = get_irn_dbg_info(irn);
1450 /* we have to pop the shadow parameter in in case of struct returns */
1452 ret = be_new_Return(dbgi, env->birg->irg, bl, n_res, pop, n, in);
1454 /* Set the register classes of the return's parameter accordingly. */
1455 for (i = 0; i < n; ++i) {
1456 if (regs[i] == NULL)
1459 be_node_set_reg_class_in(ret, i, regs[i]->reg_class);
1462 /* Free the space of the Epilog's in array and the register <-> proj map. */
1463 obstack_free(&env->obst, in);
1464 pmap_destroy(reg_map);
1469 typedef struct lower_frame_sels_env_t {
1471 ir_entity *value_param_list; /**< the list of all value param entities */
1472 ir_entity *value_param_tail; /**< the tail of the list of all value param entities */
1473 } lower_frame_sels_env_t;
1476 * Walker: Replaces Sels of frame type and
1477 * value param type entities by FrameAddress.
1478 * Links all used entities.
1480 static void lower_frame_sels_walker(ir_node *irn, void *data) {
1481 lower_frame_sels_env_t *ctx = data;
1484 ir_graph *irg = current_ir_graph;
1485 ir_node *frame = get_irg_frame(irg);
1486 ir_node *param_base = get_irg_value_param_base(irg);
1487 ir_node *ptr = get_Sel_ptr(irn);
1489 if (ptr == frame || ptr == param_base) {
1490 be_abi_irg_t *env = ctx->env;
1491 ir_entity *ent = get_Sel_entity(irn);
1492 ir_node *bl = get_nodes_block(irn);
1495 nw = be_new_FrameAddr(env->arch_env->sp->reg_class, irg, bl, frame, ent);
1498 /* check, if it's a param sel and if have not seen this entity before */
1499 if (ptr == param_base &&
1500 ent != ctx->value_param_tail &&
1501 get_entity_link(ent) == NULL) {
1502 set_entity_link(ent, ctx->value_param_list);
1503 ctx->value_param_list = ent;
1504 if (ctx->value_param_tail == NULL) ctx->value_param_tail = ent;
1511 * Check if a value parameter is transmitted as a register.
1512 * This might happen if the address of an parameter is taken which is
1513 * transmitted in registers.
1515 * Note that on some architectures this case must be handled specially
1516 * because the place of the backing store is determined by their ABI.
1518 * In the default case we move the entity to the frame type and create
1519 * a backing store into the first block.
1521 static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_entity *value_param_list) {
1522 be_abi_call_t *call = env->call;
1523 ir_graph *irg = env->birg->irg;
1524 ir_entity *ent, *next_ent, *new_list;
1526 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1529 for (ent = value_param_list; ent; ent = next_ent) {
1530 int i = get_struct_member_index(get_entity_owner(ent), ent);
1531 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1533 next_ent = get_entity_link(ent);
1535 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", i));
1536 set_entity_link(ent, new_list);
1541 /* ok, change the graph */
1542 ir_node *start_bl = get_irg_start_block(irg);
1543 ir_node *first_bl = NULL;
1544 ir_node *frame, *imem, *nmem, *store, *mem, *args, *args_bl;
1545 const ir_edge_t *edge;
1546 optimization_state_t state;
1549 foreach_block_succ(start_bl, edge) {
1550 ir_node *succ = get_edge_src_irn(edge);
1551 if (start_bl != succ) {
1557 /* we had already removed critical edges, so the following
1558 assertion should be always true. */
1559 assert(get_Block_n_cfgpreds(first_bl) == 1);
1561 /* now create backing stores */
1562 frame = get_irg_frame(irg);
1563 imem = get_irg_initial_mem(irg);
1565 save_optimization_state(&state);
1567 nmem = new_r_Proj(irg, first_bl, get_irg_start(irg), mode_M, pn_Start_M);
1568 restore_optimization_state(&state);
1570 /* reroute all edges to the new memory source */
1571 edges_reroute(imem, nmem, irg);
1575 args = get_irg_args(irg);
1576 args_bl = get_nodes_block(args);
1577 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1578 int i = get_struct_member_index(get_entity_owner(ent), ent);
1579 ir_type *tp = get_entity_type(ent);
1580 ir_mode *mode = get_type_mode(tp);
1583 /* address for the backing store */
1584 addr = be_new_FrameAddr(env->arch_env->sp->reg_class, irg, first_bl, frame, ent);
1587 mem = new_r_Proj(irg, first_bl, store, mode_M, pn_Store_M);
1589 /* the backing store itself */
1590 store = new_r_Store(irg, first_bl, mem, addr,
1591 new_r_Proj(irg, args_bl, args, mode, i));
1593 /* the new memory Proj gets the last Proj from store */
1594 set_Proj_pred(nmem, store);
1595 set_Proj_proj(nmem, pn_Store_M);
1597 /* move all entities to the frame type */
1598 frame_tp = get_irg_frame_type(irg);
1599 offset = get_type_size_bytes(frame_tp);
1601 /* we will add new entities: set the layout to undefined */
1602 assert(get_type_state(frame_tp) == layout_fixed);
1603 set_type_state(frame_tp, layout_undefined);
1604 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1605 ir_type *tp = get_entity_type(ent);
1606 unsigned align = get_type_alignment_bytes(tp);
1608 offset += align - 1;
1609 offset &= ~(align - 1);
1610 set_entity_owner(ent, frame_tp);
1611 add_class_member(frame_tp, ent);
1612 /* must be automatic to set a fixed layout */
1613 set_entity_allocation(ent, allocation_automatic);
1614 set_entity_offset(ent, offset);
1615 offset += get_type_size_bytes(tp);
1617 set_type_size_bytes(frame_tp, offset);
1618 /* fix the layout again */
1619 set_type_state(frame_tp, layout_fixed);
1625 * The start block has no jump, instead it has an initial exec Proj.
1626 * The backend wants to handle all blocks the same way, so we replace
1627 * the out cfg edge with a real jump.
1629 static void fix_start_block(ir_node *block, void *env) {
1632 ir_node *start_block;
1635 /* we processed the start block, return */
1639 irg = get_irn_irg(block);
1640 start_block = get_irg_start_block(irg);
1642 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1643 ir_node *pred = get_Block_cfgpred(block, i);
1644 ir_node *pred_block = get_nodes_block(pred);
1646 /* ok, we are in the block, having start as cfg predecessor */
1647 if (pred_block == start_block) {
1648 ir_node *jump = new_r_Jmp(irg, pred_block);
1649 set_Block_cfgpred(block, i, jump);
1657 * Modify the irg itself and the frame type.
1659 static void modify_irg(be_abi_irg_t *env)
1661 be_abi_call_t *call = env->call;
1662 const arch_env_t *arch_env= env->birg->main_env->arch_env;
1663 const arch_register_t *sp = arch_env_sp(arch_env);
1664 ir_graph *irg = env->birg->irg;
1668 ir_node *new_mem_proj;
1670 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1677 const arch_register_t *fp_reg;
1678 ir_node *frame_pointer;
1679 ir_node *reg_params_bl;
1682 ir_node *value_param_base;
1683 const ir_edge_t *edge;
1684 ir_type *arg_type, *bet_type, *tp;
1685 lower_frame_sels_env_t ctx;
1686 ir_entity **param_map;
1688 bitset_t *used_proj_nr;
1689 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1691 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1693 /* Must fetch memory here, otherwise the start Barrier gets the wrong
1694 * memory, which leads to loops in the DAG. */
1695 old_mem = get_irg_initial_mem(irg);
1697 irp_reserve_resources(irp, IR_RESOURCE_ENTITY_LINK);
1698 /* set the links of all frame entities to NULL, we use it
1699 to detect if an entity is already linked in the value_param_list */
1700 tp = get_method_value_param_type(method_type);
1702 for (i = get_struct_n_members(tp) - 1; i >= 0; --i)
1703 set_entity_link(get_struct_member(tp, i), NULL);
1706 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1708 ctx.value_param_list = NULL;
1709 ctx.value_param_tail = NULL;
1710 irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
1712 /* value_param_base anchor is not needed anymore now */
1713 value_param_base = get_irg_value_param_base(irg);
1714 kill_node(value_param_base);
1715 set_irg_value_param_base(irg, new_r_Bad(irg));
1717 env->regs = pmap_create();
1719 used_proj_nr = bitset_alloca(1024);
1720 n_params = get_method_n_params(method_type);
1721 args = obstack_alloc(&env->obst, n_params * sizeof(args[0]));
1722 memset(args, 0, n_params * sizeof(args[0]));
1724 /* Check if a value parameter is transmitted as a register.
1725 * This might happen if the address of an parameter is taken which is
1726 * transmitted in registers.
1728 * Note that on some architectures this case must be handled specially
1729 * because the place of the backing store is determined by their ABI.
1731 * In the default case we move the entity to the frame type and create
1732 * a backing store into the first block.
1734 fix_address_of_parameter_access(env, ctx.value_param_list);
1735 irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK);
1737 /* Fill the argument vector */
1738 arg_tuple = get_irg_args(irg);
1739 foreach_out_edge(arg_tuple, edge) {
1740 ir_node *irn = get_edge_src_irn(edge);
1741 if (! is_Anchor(irn)) {
1742 int nr = get_Proj_proj(irn);
1744 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1748 arg_type = compute_arg_type(env, call, method_type, ¶m_map);
1749 bet_type = call->cb->get_between_type(env->cb);
1750 stack_frame_init(&env->frame, arg_type, bet_type, get_irg_frame_type(irg), arch_env->stack_dir, param_map);
1752 /* Count the register params and add them to the number of Projs for the RegParams node */
1753 for (i = 0; i < n_params; ++i) {
1754 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1755 if (arg->in_reg && args[i]) {
1756 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1757 assert(i == get_Proj_proj(args[i]));
1759 /* For now, associate the register with the old Proj from Start representing that argument. */
1760 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1761 bitset_set(used_proj_nr, i);
1762 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1766 /* Collect all callee-save registers */
1767 for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
1768 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
1769 for (j = 0; j < cls->n_regs; ++j) {
1770 const arch_register_t *reg = &cls->regs[j];
1771 if (arch_register_type_is(reg, callee_save) ||
1772 arch_register_type_is(reg, state)) {
1773 pmap_insert(env->regs, (void *) reg, NULL);
1778 pmap_insert(env->regs, (void *) sp, NULL);
1779 pmap_insert(env->regs, (void *) arch_env->bp, NULL);
1780 reg_params_bl = get_irg_start_block(irg);
1781 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1782 add_irn_dep(env->reg_params, get_irg_start(irg));
1785 * make proj nodes for the callee save registers.
1786 * memorize them, since Return nodes get those as inputs.
1788 * Note, that if a register corresponds to an argument, the regs map contains
1789 * the old Proj from start for that argument.
1792 rm = reg_map_to_arr(&env->obst, env->regs);
1793 for (i = 0, n = pmap_count(env->regs); i < n; ++i) {
1794 arch_register_t *reg = (void *) rm[i].reg;
1795 ir_mode *mode = reg->reg_class->mode;
1797 arch_register_req_type_t add_type = 0;
1801 add_type |= arch_register_req_type_produces_sp | arch_register_req_type_ignore;
1804 bitset_set(used_proj_nr, nr);
1805 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1806 pmap_insert(env->regs, (void *) reg, proj);
1807 be_set_constr_single_reg_out(env->reg_params, nr, reg, add_type);
1808 arch_set_irn_register(proj, reg);
1810 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1812 obstack_free(&env->obst, rm);
1814 /* create a new initial memory proj */
1815 assert(is_Proj(old_mem));
1816 new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
1817 new_r_Unknown(irg, mode_T), mode_M,
1818 get_Proj_proj(old_mem));
1821 /* Generate the Prologue */
1822 fp_reg = call->cb->prologue(env->cb, &mem, env->regs, &env->frame.initial_bias);
1824 /* do the stack allocation BEFORE the barrier, or spill code
1825 might be added before it */
1826 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1827 start_bl = get_irg_start_block(irg);
1828 env->init_sp = be_new_IncSP(sp, irg, start_bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND, 0);
1829 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1831 create_barrier(env, start_bl, &mem, env->regs, 0);
1833 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1834 arch_set_irn_register(env->init_sp, sp);
1836 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1837 set_irg_frame(irg, frame_pointer);
1838 pset_insert_ptr(env->ignore_regs, fp_reg);
1840 /* rewire old mem users to new mem */
1841 set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
1842 exchange(old_mem, mem);
1844 set_irg_initial_mem(irg, mem);
1846 /* Now, introduce stack param nodes for all parameters passed on the stack */
1847 for (i = 0; i < n_params; ++i) {
1848 ir_node *arg_proj = args[i];
1849 ir_node *repl = NULL;
1851 if (arg_proj != NULL) {
1852 be_abi_call_arg_t *arg;
1853 ir_type *param_type;
1854 int nr = get_Proj_proj(arg_proj);
1857 nr = MIN(nr, n_params);
1858 arg = get_call_arg(call, 0, nr);
1859 param_type = get_method_param_type(method_type, nr);
1862 repl = pmap_get(env->regs, (void *) arg->reg);
1863 } else if (arg->on_stack) {
1864 ir_node *addr = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1866 /* For atomic parameters which are actually used, we create a Load node. */
1867 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1868 ir_mode *mode = get_type_mode(param_type);
1869 ir_mode *load_mode = arg->load_mode;
1871 ir_node *load = new_r_Load(irg, reg_params_bl, new_NoMem(), addr, load_mode);
1872 set_irn_pinned(load, op_pin_state_floats);
1873 repl = new_r_Proj(irg, reg_params_bl, load, load_mode, pn_Load_res);
1875 if (mode != load_mode) {
1876 repl = new_r_Conv(irg, reg_params_bl, repl, mode);
1879 /* The stack parameter is not primitive (it is a struct or array),
1880 * we thus will create a node representing the parameter's address
1886 assert(repl != NULL);
1888 /* Beware: the mode of the register parameters is always the mode of the register class
1889 which may be wrong. Add Conv's then. */
1890 mode = get_irn_mode(args[i]);
1891 if (mode != get_irn_mode(repl)) {
1892 repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
1894 exchange(args[i], repl);
1898 /* the arg proj is not needed anymore now and should be only used by the anchor */
1899 assert(get_irn_n_edges(arg_tuple) == 1);
1900 kill_node(arg_tuple);
1901 set_irg_args(irg, new_rd_Bad(irg));
1903 /* All Return nodes hang on the End node, so look for them there. */
1904 end = get_irg_end_block(irg);
1905 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1906 ir_node *irn = get_Block_cfgpred(end, i);
1908 if (is_Return(irn)) {
1909 ir_node *blk = get_nodes_block(irn);
1910 ir_node *mem = get_Return_mem(irn);
1911 ir_node *ret = create_be_return(env, irn, blk, mem, get_Return_n_ress(irn));
1915 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
1916 the code is dead and will never be executed. */
1918 obstack_free(&env->obst, args);
1920 /* handle start block here (place a jump in the block) */
1922 irg_block_walk_graph(irg, fix_start_block, NULL, &i);
1925 /** Fix the state inputs of calls that still hang on unknowns */
1927 void fix_call_state_inputs(be_abi_irg_t *env)
1929 const arch_env_t *arch_env = env->arch_env;
1931 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
1933 /* Collect caller save registers */
1934 n = arch_env_get_n_reg_class(arch_env);
1935 for (i = 0; i < n; ++i) {
1937 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
1938 for (j = 0; j < cls->n_regs; ++j) {
1939 const arch_register_t *reg = arch_register_for_index(cls, j);
1940 if (arch_register_type_is(reg, state)) {
1941 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
1946 n = ARR_LEN(env->calls);
1947 n_states = ARR_LEN(stateregs);
1948 for (i = 0; i < n; ++i) {
1950 ir_node *call = env->calls[i];
1952 arity = get_irn_arity(call);
1954 /* the state reg inputs are the last n inputs of the calls */
1955 for (s = 0; s < n_states; ++s) {
1956 int inp = arity - n_states + s;
1957 const arch_register_t *reg = stateregs[s];
1958 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
1960 set_irn_n(call, inp, regnode);
1964 DEL_ARR_F(stateregs);
1968 * Create a trampoline entity for the given method.
1970 static ir_entity *create_trampoline(be_main_env_t *be, ir_entity *method)
1972 ir_type *type = get_entity_type(method);
1973 ident *old_id = get_entity_ld_ident(method);
1974 ident *id = mangle3("L", old_id, "$stub");
1975 ir_type *parent = be->pic_trampolines_type;
1976 ir_entity *ent = new_entity(parent, old_id, type);
1977 set_entity_ld_ident(ent, id);
1978 set_entity_visibility(ent, visibility_local);
1979 set_entity_variability(ent, variability_uninitialized);
1985 * Returns the trampoline entity for the given method.
1987 static ir_entity *get_trampoline(be_main_env_t *env, ir_entity *method)
1989 ir_entity *result = pmap_get(env->ent_trampoline_map, method);
1990 if (result == NULL) {
1991 result = create_trampoline(env, method);
1992 pmap_insert(env->ent_trampoline_map, method, result);
1998 static ir_entity *create_pic_symbol(be_main_env_t *be, ir_entity *entity)
2000 ident *old_id = get_entity_ld_ident(entity);
2001 ident *id = mangle3("L", old_id, "$non_lazy_ptr");
2002 ir_type *e_type = get_entity_type(entity);
2003 ir_type *type = new_type_pointer(id, e_type, mode_P_data);
2004 ir_type *parent = be->pic_symbols_type;
2005 ir_entity *ent = new_entity(parent, old_id, type);
2006 set_entity_ld_ident(ent, id);
2007 set_entity_visibility(ent, visibility_local);
2008 set_entity_variability(ent, variability_uninitialized);
2013 static ir_entity *get_pic_symbol(be_main_env_t *env, ir_entity *entity)
2015 ir_entity *result = pmap_get(env->ent_pic_symbol_map, entity);
2016 if (result == NULL) {
2017 result = create_pic_symbol(env, entity);
2018 pmap_insert(env->ent_pic_symbol_map, entity, result);
2027 * Returns non-zero if a given entity can be accessed using a relative address.
2029 static int can_address_relative(ir_entity *entity)
2031 return get_entity_variability(entity) == variability_initialized
2032 || get_entity_visibility(entity) == visibility_local;
2035 /** patches SymConsts to work in position independent code */
2036 static void fix_pic_symconsts(ir_node *node, void *data)
2046 be_abi_irg_t *env = data;
2048 be_main_env_t *be = env->birg->main_env;
2050 arity = get_irn_arity(node);
2051 for (i = 0; i < arity; ++i) {
2053 ir_node *pred = get_irn_n(node, i);
2055 ir_entity *pic_symbol;
2056 ir_node *pic_symconst;
2058 if (!is_SymConst(pred))
2061 entity = get_SymConst_entity(pred);
2062 block = get_nodes_block(pred);
2063 irg = get_irn_irg(pred);
2065 /* calls can jump to relative addresses, so we can directly jump to
2066 the (relatively) known call address or the trampoline */
2067 if (i == 1 && is_Call(node)) {
2068 ir_entity *trampoline;
2069 ir_node *trampoline_const;
2071 if (can_address_relative(entity))
2074 dbgi = get_irn_dbg_info(pred);
2075 trampoline = get_trampoline(be, entity);
2076 trampoline_const = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2078 set_irn_n(node, i, trampoline_const);
2082 /* everything else is accessed relative to EIP */
2083 mode = get_irn_mode(pred);
2084 unknown = new_r_Unknown(irg, mode);
2085 pic_base = arch_code_generator_get_pic_base(env->birg->cg);
2087 /* all ok now for locally constructed stuff */
2088 if (can_address_relative(entity)) {
2089 ir_node *add = new_r_Add(irg, block, pic_base, pred, mode);
2091 /* make sure the walker doesn't visit this add again */
2092 mark_irn_visited(add);
2093 set_irn_n(node, i, add);
2097 /* get entry from pic symbol segment */
2098 dbgi = get_irn_dbg_info(pred);
2099 pic_symbol = get_pic_symbol(be, entity);
2100 pic_symconst = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2102 add = new_r_Add(irg, block, pic_base, pic_symconst, mode);
2103 mark_irn_visited(add);
2105 /* we need an extra indirection for global data outside our current
2106 module. The loads are always safe and can therefore float
2107 and need no memory input */
2108 load = new_r_Load(irg, block, new_NoMem(), add, mode);
2109 load_res = new_r_Proj(irg, block, load, mode, pn_Load_res);
2110 set_irn_pinned(load, op_pin_state_floats);
2112 set_irn_n(node, i, load_res);
2116 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2118 be_abi_irg_t *env = XMALLOC(be_abi_irg_t);
2119 ir_node *old_frame = get_irg_frame(birg->irg);
2120 ir_graph *irg = birg->irg;
2124 optimization_state_t state;
2125 unsigned *limited_bitset;
2127 be_omit_fp = birg->main_env->options->omit_fp;
2128 be_omit_leaf_fp = birg->main_env->options->omit_leaf_fp;
2130 obstack_init(&env->obst);
2132 env->arch_env = birg->main_env->arch_env;
2133 env->method_type = get_entity_type(get_irg_entity(irg));
2134 env->call = be_abi_call_new(env->arch_env->sp->reg_class);
2135 arch_env_get_call_abi(env->arch_env, env->method_type, env->call);
2137 env->ignore_regs = pset_new_ptr_default();
2138 env->keep_map = pmap_create();
2139 env->dce_survivor = new_survive_dce();
2142 env->sp_req.type = arch_register_req_type_limited;
2143 env->sp_req.cls = arch_register_get_class(env->arch_env->sp);
2144 limited_bitset = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
2145 rbitset_set(limited_bitset, arch_register_get_index(env->arch_env->sp));
2146 env->sp_req.limited = limited_bitset;
2147 if (env->arch_env->sp->type & arch_register_type_ignore) {
2148 env->sp_req.type |= arch_register_req_type_ignore;
2151 env->sp_cls_req.type = arch_register_req_type_normal;
2152 env->sp_cls_req.cls = arch_register_get_class(env->arch_env->sp);
2154 /* Beware: later we replace this node by the real one, ensure it is not CSE'd
2155 to another Unknown or the stack pointer gets used */
2156 save_optimization_state(&state);
2158 env->init_sp = dummy = new_r_Unknown(irg, env->arch_env->sp->reg_class->mode);
2159 restore_optimization_state(&state);
2161 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
2163 env->calls = NEW_ARR_F(ir_node*, 0);
2165 if (birg->main_env->options->pic) {
2166 irg_walk_graph(irg, fix_pic_symconsts, NULL, env);
2169 /* Lower all call nodes in the IRG. */
2173 Beware: init backend abi call object after processing calls,
2174 otherwise some information might be not yet available.
2176 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2178 /* Process the IRG */
2181 /* fix call inputs for state registers */
2182 fix_call_state_inputs(env);
2184 /* We don't need the keep map anymore. */
2185 pmap_destroy(env->keep_map);
2186 env->keep_map = NULL;
2188 /* calls array is not needed anymore */
2189 DEL_ARR_F(env->calls);
2192 /* reroute the stack origin of the calls to the true stack origin. */
2193 exchange(dummy, env->init_sp);
2194 exchange(old_frame, get_irg_frame(irg));
2196 /* Make some important node pointers survive the dead node elimination. */
2197 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2198 foreach_pmap(env->regs, ent) {
2199 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2202 env->call->cb->done(env->cb);
2207 void be_abi_free(be_abi_irg_t *env)
2209 be_abi_call_free(env->call);
2210 free_survive_dce(env->dce_survivor);
2211 del_pset(env->ignore_regs);
2212 pmap_destroy(env->regs);
2213 obstack_free(&env->obst, NULL);
2217 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2219 arch_register_t *reg;
2221 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2222 if(reg->reg_class == cls)
2223 bitset_set(bs, reg->index);
2226 void be_abi_set_non_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, unsigned *raw_bitset)
2229 arch_register_t *reg;
2231 for (i = 0; i < cls->n_regs; ++i) {
2232 if (arch_register_type_is(&cls->regs[i], ignore))
2235 rbitset_set(raw_bitset, i);
2238 for (reg = pset_first(abi->ignore_regs); reg != NULL;
2239 reg = pset_next(abi->ignore_regs)) {
2240 if (reg->reg_class != cls)
2243 rbitset_clear(raw_bitset, reg->index);
2247 /* Returns the stack layout from a abi environment. */
2248 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi) {
2255 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2256 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2257 | _| | |> < ___) | || (_| | (__| <
2258 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2262 typedef ir_node **node_array;
2264 typedef struct fix_stack_walker_env_t {
2265 node_array sp_nodes;
2266 } fix_stack_walker_env_t;
2269 * Walker. Collect all stack modifying nodes.
2271 static void collect_stack_nodes_walker(ir_node *node, void *data)
2273 fix_stack_walker_env_t *env = data;
2274 const arch_register_req_t *req;
2276 if (get_irn_mode(node) == mode_T)
2279 req = arch_get_register_req_out(node);
2280 if (! (req->type & arch_register_req_type_produces_sp))
2283 ARR_APP1(ir_node*, env->sp_nodes, node);
2286 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2288 be_ssa_construction_env_t senv;
2291 be_irg_t *birg = env->birg;
2292 be_lv_t *lv = be_get_birg_liveness(birg);
2293 fix_stack_walker_env_t walker_env;
2295 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2297 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2299 /* nothing to be done if we didn't find any node, in fact we mustn't
2300 * continue, as for endless loops incsp might have had no users and is bad
2303 len = ARR_LEN(walker_env.sp_nodes);
2305 DEL_ARR_F(walker_env.sp_nodes);
2309 be_ssa_construction_init(&senv, birg);
2310 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2311 ARR_LEN(walker_env.sp_nodes));
2312 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2313 ARR_LEN(walker_env.sp_nodes));
2316 len = ARR_LEN(walker_env.sp_nodes);
2317 for(i = 0; i < len; ++i) {
2318 be_liveness_update(lv, walker_env.sp_nodes[i]);
2320 be_ssa_construction_update_liveness_phis(&senv, lv);
2323 phis = be_ssa_construction_get_new_phis(&senv);
2325 /* set register requirements for stack phis */
2326 len = ARR_LEN(phis);
2327 for(i = 0; i < len; ++i) {
2328 ir_node *phi = phis[i];
2329 be_set_phi_reg_req(phi, &env->sp_req, arch_register_req_type_produces_sp);
2330 arch_set_irn_register(phi, env->arch_env->sp);
2332 be_ssa_construction_destroy(&senv);
2334 DEL_ARR_F(walker_env.sp_nodes);
2338 * Fix all stack accessing operations in the block bl.
2340 * @param env the abi environment
2341 * @param bl the block to process
2342 * @param real_bias the bias value
2344 * @return the bias at the end of this block
2346 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int real_bias)
2348 int omit_fp = env->call->flags.bits.try_omit_fp;
2350 int wanted_bias = real_bias;
2352 sched_foreach(bl, irn) {
2356 Check, if the node relates to an entity on the stack frame.
2357 If so, set the true offset (including the bias) for that
2360 ir_entity *ent = arch_get_frame_entity(irn);
2362 int bias = omit_fp ? real_bias : 0;
2363 int offset = get_stack_entity_offset(&env->frame, ent, bias);
2364 arch_set_frame_offset(irn, offset);
2365 DBG((env->dbg, LEVEL_2, "%F has offset %d (including bias %d)\n",
2366 ent, offset, bias));
2370 * If the node modifies the stack pointer by a constant offset,
2371 * record that in the bias.
2373 ofs = arch_get_sp_bias(irn);
2375 if (be_is_IncSP(irn)) {
2376 /* fill in real stack frame size */
2377 if (ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2378 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2379 ofs = (int) get_type_size_bytes(frame_type);
2380 be_set_IncSP_offset(irn, ofs);
2381 } else if (ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2382 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2383 ofs = - (int)get_type_size_bytes(frame_type);
2384 be_set_IncSP_offset(irn, ofs);
2386 if (be_get_IncSP_align(irn)) {
2387 /* patch IncSP to produce an aligned stack pointer */
2388 ir_type *between_type = env->frame.between_type;
2389 int between_size = get_type_size_bytes(between_type);
2390 int alignment = 1 << env->arch_env->stack_alignment;
2391 int delta = (real_bias + ofs + between_size) & (alignment - 1);
2394 be_set_IncSP_offset(irn, ofs + alignment - delta);
2395 real_bias += alignment - delta;
2398 /* adjust so real_bias corresponds with wanted_bias */
2399 int delta = wanted_bias - real_bias;
2402 be_set_IncSP_offset(irn, ofs + delta);
2413 assert(real_bias == wanted_bias);
2418 * A helper struct for the bias walker.
2421 be_abi_irg_t *env; /**< The ABI irg environment. */
2422 int start_block_bias; /**< The bias at the end of the start block. */
2424 ir_node *start_block; /**< The start block of the current graph. */
2428 * Block-Walker: fix all stack offsets for all blocks
2429 * except the start block
2431 static void stack_bias_walker(ir_node *bl, void *data)
2433 struct bias_walk *bw = data;
2434 if (bl != bw->start_block) {
2435 process_stack_bias(bw->env, bl, bw->start_block_bias);
2439 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2441 ir_graph *irg = env->birg->irg;
2442 struct bias_walk bw;
2444 stack_frame_compute_initial_offset(&env->frame);
2445 // stack_layout_dump(stdout, frame);
2447 /* Determine the stack bias at the end of the start block. */
2448 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), env->frame.initial_bias);
2449 bw.between_size = get_type_size_bytes(env->frame.between_type);
2451 /* fix the bias is all other blocks */
2453 bw.start_block = get_irg_start_block(irg);
2454 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2457 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2459 assert(arch_register_type_is(reg, callee_save));
2460 assert(pmap_contains(abi->regs, (void *) reg));
2461 return pmap_get(abi->regs, (void *) reg);
2464 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2466 assert(arch_register_type_is(reg, ignore));
2467 assert(pmap_contains(abi->regs, (void *) reg));
2468 return pmap_get(abi->regs, (void *) reg);
2472 * Returns non-zero if the ABI has omitted the frame pointer in
2473 * the current graph.
2475 int be_abi_omit_fp(const be_abi_irg_t *abi) {
2476 return abi->call->flags.bits.try_omit_fp;