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;
74 const be_abi_callbacks_t *cb;
75 ir_type *between_type;
77 const arch_register_class_t *cls_addr;
80 struct _be_abi_irg_t {
82 be_irg_t *birg; /**< The back end IRG. */
83 const arch_env_t *arch_env;
84 survive_dce_t *dce_survivor;
86 be_abi_call_t *call; /**< The ABI call information. */
87 ir_type *method_type; /**< The type of the method of the IRG. */
89 ir_node *init_sp; /**< The node representing the stack pointer
90 at the start of the function. */
92 ir_node *reg_params; /**< The reg params node. */
93 pmap *regs; /**< A map of all callee-save and ignore regs to
94 their Projs to the RegParams node. */
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 ir_node **calls; /**< flexible array containing all be_Call nodes */
105 arch_register_req_t sp_req;
106 arch_register_req_t sp_cls_req;
108 be_stack_layout_t frame; /**< The stack frame model. */
110 DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< The debugging module. */
113 static heights_t *ir_heights;
115 /** Flag: if set, try to omit the frame pointer in all routines. */
116 static int be_omit_fp = 1;
118 /** Flag: if set, try to omit the frame pointer in leaf routines only. */
119 static int be_omit_leaf_fp = 1;
122 _ ____ ___ ____ _ _ _ _
123 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
124 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
125 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
126 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
128 These callbacks are used by the backend to set the parameters
129 for a specific call type.
133 * Set compare function: compares two ABI call object arguments.
135 static int cmp_call_arg(const void *a, const void *b, size_t n)
137 const be_abi_call_arg_t *p = a, *q = b;
139 return !(p->is_res == q->is_res && p->pos == q->pos);
143 * Get or set an ABI call object argument.
145 * @param call the abi call
146 * @param is_res true for call results, false for call arguments
147 * @param pos position of the argument
148 * @param do_insert true if the argument is set, false if it's retrieved
150 static be_abi_call_arg_t *get_or_set_call_arg(be_abi_call_t *call, int is_res, int pos, int do_insert)
152 be_abi_call_arg_t arg;
155 memset(&arg, 0, sizeof(arg));
159 hash = is_res * 128 + pos;
162 ? set_insert(call->params, &arg, sizeof(arg), hash)
163 : set_find(call->params, &arg, sizeof(arg), hash);
167 * Retrieve an ABI call object argument.
169 * @param call the ABI call object
170 * @param is_res true for call results, false for call arguments
171 * @param pos position of the argument
173 static inline be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
175 return get_or_set_call_arg(call, is_res, pos, 0);
178 /* Set the flags for a call. */
179 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
185 void be_abi_call_set_pop(be_abi_call_t *call, int pop)
191 /* Set register class for call address */
192 void be_abi_call_set_call_address_reg_class(be_abi_call_t *call, const arch_register_class_t *cls)
194 call->cls_addr = cls;
198 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)
200 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
202 arg->load_mode = load_mode;
203 arg->alignment = alignment;
204 arg->space_before = space_before;
205 arg->space_after = space_after;
206 assert(alignment > 0 && "Alignment must be greater than 0");
209 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
211 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
216 void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
218 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 1, arg_pos, 1);
223 /* Get the flags of a ABI call object. */
224 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
230 * Constructor for a new ABI call object.
232 * @return the new ABI call object
234 static be_abi_call_t *be_abi_call_new(const arch_register_class_t *cls_addr)
236 be_abi_call_t *call = XMALLOCZ(be_abi_call_t);
239 call->params = new_set(cmp_call_arg, 16);
241 call->cls_addr = cls_addr;
243 call->flags.bits.try_omit_fp = be_omit_fp | be_omit_leaf_fp;
249 * Destructor for an ABI call object.
251 static void be_abi_call_free(be_abi_call_t *call)
253 del_set(call->params);
259 | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _
260 | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` |
261 | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| |
262 |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, |
265 Handling of the stack frame. It is composed of three types:
266 1) The type of the arguments which are pushed on the stack.
267 2) The "between type" which consists of stuff the call of the
268 function pushes on the stack (like the return address and
269 the old base pointer for ia32).
270 3) The Firm frame type which consists of all local variables
274 static int get_stack_entity_offset(be_stack_layout_t *frame, ir_entity *ent,
277 ir_type *t = get_entity_owner(ent);
278 int ofs = get_entity_offset(ent);
282 /* Find the type the entity is contained in. */
283 for (index = 0; index < N_FRAME_TYPES; ++index) {
284 if (frame->order[index] == t)
286 /* Add the size of all the types below the one of the entity to the entity's offset */
287 ofs += get_type_size_bytes(frame->order[index]);
290 /* correct the offset by the initial position of the frame pointer */
291 ofs -= frame->initial_offset;
293 /* correct the offset with the current bias. */
300 * Retrieve the entity with given offset from a frame type.
302 static ir_entity *search_ent_with_offset(ir_type *t, int offset)
306 for(i = 0, n = get_compound_n_members(t); i < n; ++i) {
307 ir_entity *ent = get_compound_member(t, i);
308 if (get_entity_offset(ent) == offset)
315 static int stack_frame_compute_initial_offset(be_stack_layout_t *frame)
317 ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
318 ir_entity *ent = search_ent_with_offset(base, 0);
320 frame->initial_offset = ent ? get_stack_entity_offset(frame, ent, 0) : 0;
322 return frame->initial_offset;
326 * Initializes the frame layout from parts
328 * @param frame the stack layout that will be initialized
329 * @param args the stack argument layout type
330 * @param between the between layout type
331 * @param locals the method frame type
332 * @param stack_dir the stack direction
333 * @param param_map an array mapping method argument positions to the stack argument type
335 * @return the initialized stack layout
337 static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *args,
338 ir_type *between, ir_type *locals, int stack_dir,
339 ir_entity *param_map[])
341 frame->arg_type = args;
342 frame->between_type = between;
343 frame->frame_type = locals;
344 frame->initial_offset = 0;
345 frame->initial_bias = 0;
346 frame->stack_dir = stack_dir;
347 frame->order[1] = between;
348 frame->param_map = param_map;
351 frame->order[0] = args;
352 frame->order[2] = locals;
355 frame->order[0] = locals;
356 frame->order[2] = args;
362 /** Dumps the stack layout to file. */
363 static void stack_layout_dump(FILE *file, be_stack_layout_t *frame)
367 ir_fprintf(file, "initial offset: %d\n", frame->initial_offset);
368 for (j = 0; j < N_FRAME_TYPES; ++j) {
369 ir_type *t = frame->order[j];
371 ir_fprintf(file, "type %d: %F size: %d\n", j, t, get_type_size_bytes(t));
372 for (i = 0, n = get_compound_n_members(t); i < n; ++i) {
373 ir_entity *ent = get_compound_member(t, i);
374 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));
381 * Returns non-zero if the call argument at given position
382 * is transfered on the stack.
384 static inline int is_on_stack(be_abi_call_t *call, int pos)
386 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
387 return arg && !arg->in_reg;
397 Adjustment of the calls inside a graph.
402 * Transform a call node into a be_Call node.
404 * @param env The ABI environment for the current irg.
405 * @param irn The call node.
406 * @param curr_sp The stack pointer node to use.
407 * @return The stack pointer after the call.
409 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp)
411 ir_graph *irg = env->birg->irg;
412 const arch_env_t *arch_env = env->birg->main_env->arch_env;
413 ir_type *call_tp = get_Call_type(irn);
414 ir_node *call_ptr = get_Call_ptr(irn);
415 int n_params = get_method_n_params(call_tp);
416 ir_node *curr_mem = get_Call_mem(irn);
417 ir_node *bl = get_nodes_block(irn);
418 pset *results = pset_new_ptr(8);
419 pset *caller_save = pset_new_ptr(8);
420 pset *states = pset_new_ptr(2);
422 int stack_dir = arch_env_stack_dir(arch_env);
423 const arch_register_t *sp = arch_env_sp(arch_env);
424 be_abi_call_t *call = be_abi_call_new(sp->reg_class);
425 ir_mode *mach_mode = sp->reg_class->mode;
426 struct obstack *obst = &env->obst;
427 int no_alloc = call->flags.bits.frame_is_setup_on_call;
428 int n_res = get_method_n_ress(call_tp);
429 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
431 ir_node *res_proj = NULL;
432 int n_reg_params = 0;
433 int n_stack_params = 0;
439 int n_reg_results = 0;
440 const arch_register_t *reg;
441 const ir_edge_t *edge;
443 int *stack_param_idx;
446 /* Let the isa fill out the abi description for that call node. */
447 arch_env_get_call_abi(arch_env, call_tp, call);
449 /* Insert code to put the stack arguments on the stack. */
450 assert(get_Call_n_params(irn) == n_params);
451 for (i = 0; i < n_params; ++i) {
452 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
455 int arg_size = get_type_size_bytes(get_method_param_type(call_tp, i));
457 stack_size += round_up2(arg->space_before, arg->alignment);
458 stack_size += round_up2(arg_size, arg->alignment);
459 stack_size += round_up2(arg->space_after, arg->alignment);
460 obstack_int_grow(obst, i);
464 stack_param_idx = obstack_finish(obst);
466 /* Collect all arguments which are passed in registers. */
467 for (i = 0; i < n_params; ++i) {
468 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
469 if (arg && arg->in_reg) {
470 obstack_int_grow(obst, i);
474 reg_param_idxs = obstack_finish(obst);
477 * If the stack is decreasing and we do not want to store sequentially,
478 * or someone else allocated the call frame
479 * we allocate as much space on the stack all parameters need, by
480 * moving the stack pointer along the stack's direction.
482 * Note: we also have to do this for stack_size == 0, because we may have
483 * to adjust stack alignment for the call.
485 if (stack_dir < 0 && !do_seq && !no_alloc) {
486 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, stack_size, 1);
489 /* If there are some parameters which shall be passed on the stack. */
490 if (n_stack_params > 0) {
494 * Reverse list of stack parameters if call arguments are from left to right.
495 * We must them reverse again if they are pushed (not stored) and the stack
496 * direction is downwards.
498 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
499 for (i = 0; i < n_stack_params >> 1; ++i) {
500 int other = n_stack_params - i - 1;
501 int tmp = stack_param_idx[i];
502 stack_param_idx[i] = stack_param_idx[other];
503 stack_param_idx[other] = tmp;
507 curr_mem = get_Call_mem(irn);
509 obstack_ptr_grow(obst, curr_mem);
512 for (i = 0; i < n_stack_params; ++i) {
513 int p = stack_param_idx[i];
514 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
515 ir_node *param = get_Call_param(irn, p);
516 ir_node *addr = curr_sp;
518 ir_type *param_type = get_method_param_type(call_tp, p);
519 int param_size = get_type_size_bytes(param_type) + arg->space_after;
522 * If we wanted to build the arguments sequentially,
523 * the stack pointer for the next must be incremented,
524 * and the memory value propagated.
528 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, param_size + arg->space_before, 0);
529 add_irn_dep(curr_sp, curr_mem);
532 curr_ofs += arg->space_before;
533 curr_ofs = round_up2(curr_ofs, arg->alignment);
535 /* Make the expression to compute the argument's offset. */
537 ir_mode *constmode = mach_mode;
538 if(mode_is_reference(mach_mode)) {
541 addr = new_r_Const_long(irg, bl, constmode, curr_ofs);
542 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
546 /* Insert a store for primitive arguments. */
547 if (is_atomic_type(param_type)) {
549 ir_node *mem_input = do_seq ? curr_mem : new_NoMem();
550 store = new_r_Store(irg, bl, mem_input, addr, param);
551 mem = new_r_Proj(irg, bl, store, mode_M, pn_Store_M);
554 /* Make a mem copy for compound arguments. */
558 assert(mode_is_reference(get_irn_mode(param)));
559 copy = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type);
560 mem = new_r_Proj(irg, bl, copy, mode_M, pn_CopyB_M_regular);
563 curr_ofs += param_size;
568 obstack_ptr_grow(obst, mem);
571 in = (ir_node **) obstack_finish(obst);
573 /* We need the sync only, if we didn't build the stores sequentially. */
575 if (n_stack_params >= 1) {
576 curr_mem = new_r_Sync(irg, bl, n_stack_params + 1, in);
578 curr_mem = get_Call_mem(irn);
581 obstack_free(obst, in);
584 /* Collect caller save registers */
585 for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
587 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
588 for (j = 0; j < cls->n_regs; ++j) {
589 const arch_register_t *reg = arch_register_for_index(cls, j);
590 if (arch_register_type_is(reg, caller_save)) {
591 pset_insert_ptr(caller_save, (void *) reg);
593 if (arch_register_type_is(reg, state)) {
594 pset_insert_ptr(caller_save, (void*) reg);
595 pset_insert_ptr(states, (void*) reg);
600 /* search the greatest result proj number */
602 res_projs = ALLOCANZ(ir_node*, n_res);
604 foreach_out_edge(irn, edge) {
605 const ir_edge_t *res_edge;
606 ir_node *irn = get_edge_src_irn(edge);
608 if(!is_Proj(irn) || get_Proj_proj(irn) != pn_Call_T_result)
611 foreach_out_edge(irn, res_edge) {
613 ir_node *res = get_edge_src_irn(res_edge);
615 assert(is_Proj(res));
617 proj = get_Proj_proj(res);
618 assert(proj < n_res);
619 assert(res_projs[proj] == NULL);
620 res_projs[proj] = res;
626 /** TODO: this is not correct for cases where return values are passed
627 * on the stack, but no known ABI does this currently...
629 n_reg_results = n_res;
631 /* make the back end call node and set its register requirements. */
632 for (i = 0; i < n_reg_params; ++i) {
633 obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
635 foreach_pset(states, reg) {
636 const arch_register_class_t *cls = arch_register_get_class(reg);
638 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
639 ir_fprintf(stderr, "Adding %+F\n", regnode);
641 ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
642 obstack_ptr_grow(obst, regnode);
644 n_ins = n_reg_params + pset_count(states);
646 in = obstack_finish(obst);
648 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
650 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
652 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
653 n_ins, in, get_Call_type(irn));
654 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
657 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
659 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
660 n_ins, in, get_Call_type(irn));
662 be_Call_set_pop(low_call, call->pop);
663 ARR_APP1(ir_node *, env->calls, low_call);
665 /* create new stack pointer */
666 curr_sp = new_r_Proj(irg, bl, low_call, get_irn_mode(curr_sp),
668 be_set_constr_single_reg_out(low_call, pn_be_Call_sp, sp,
669 arch_register_req_type_ignore | arch_register_req_type_produces_sp);
670 arch_set_irn_register(curr_sp, sp);
672 for(i = 0; i < n_res; ++i) {
674 ir_node *proj = res_projs[i];
675 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
677 /* returns values on stack not supported yet */
681 shift the proj number to the right, since we will drop the
682 unspeakable Proj_T from the Call. Therefore, all real argument
683 Proj numbers must be increased by pn_be_Call_first_res
685 pn = i + pn_be_Call_first_res;
688 ir_type *res_type = get_method_res_type(call_tp, i);
689 ir_mode *mode = get_type_mode(res_type);
690 proj = new_r_Proj(irg, bl, low_call, mode, pn);
693 set_Proj_pred(proj, low_call);
694 set_Proj_proj(proj, pn);
698 pset_remove_ptr(caller_save, arg->reg);
703 Set the register class of the call address to
704 the backend provided class (default: stack pointer class)
706 be_node_set_reg_class_in(low_call, be_pos_Call_ptr, call->cls_addr);
708 DBG((env->dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
710 /* Set the register classes and constraints of the Call parameters. */
711 for (i = 0; i < n_reg_params; ++i) {
712 int index = reg_param_idxs[i];
713 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
714 assert(arg->reg != NULL);
716 be_set_constr_single_reg_in(low_call, be_pos_Call_first_arg + i,
720 /* Set the register constraints of the results. */
721 for (i = 0; i < n_res; ++i) {
722 ir_node *proj = res_projs[i];
723 const be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
724 int pn = get_Proj_proj(proj);
727 be_set_constr_single_reg_out(low_call, pn, arg->reg, 0);
728 arch_set_irn_register(proj, arg->reg);
730 obstack_free(obst, in);
731 exchange(irn, low_call);
733 /* kill the ProjT node */
734 if (res_proj != NULL) {
738 /* Make additional projs for the caller save registers
739 and the Keep node which keeps them alive. */
740 if (1 || pset_count(caller_save) + n_reg_results > 0) {
741 const arch_register_t *reg;
746 = pn_be_Call_first_res + n_reg_results;
748 /* also keep the stack pointer */
750 set_irn_link(curr_sp, (void*) sp);
751 obstack_ptr_grow(obst, curr_sp);
753 for (reg = pset_first(caller_save); reg; reg = pset_next(caller_save), ++n) {
754 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode,
757 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
758 be_set_constr_single_reg_out(low_call, curr_res_proj, reg, 0);
759 arch_set_irn_register(proj, reg);
761 set_irn_link(proj, (void*) reg);
762 obstack_ptr_grow(obst, proj);
766 for(i = 0; i < n_reg_results; ++i) {
767 ir_node *proj = res_projs[i];
768 const arch_register_t *reg = arch_get_irn_register(proj);
769 set_irn_link(proj, (void*) reg);
770 obstack_ptr_grow(obst, proj);
774 /* create the Keep for the caller save registers */
775 in = (ir_node **) obstack_finish(obst);
776 keep = be_new_Keep(NULL, irg, bl, n, in);
777 for (i = 0; i < n; ++i) {
778 const arch_register_t *reg = get_irn_link(in[i]);
779 be_node_set_reg_class_in(keep, i, reg->reg_class);
781 obstack_free(obst, in);
784 /* Clean up the stack. */
785 assert(stack_size >= call->pop);
786 stack_size -= call->pop;
788 if (stack_size > 0) {
789 ir_node *mem_proj = NULL;
791 foreach_out_edge(low_call, edge) {
792 ir_node *irn = get_edge_src_irn(edge);
793 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
800 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_be_Call_M_regular);
801 keep_alive(mem_proj);
804 /* Clean up the stack frame or revert alignment fixes if we allocated it */
806 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size, 0);
809 be_abi_call_free(call);
810 obstack_free(obst, stack_param_idx);
813 del_pset(caller_save);
819 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
821 * @param alignment the minimum stack alignment
822 * @param size the node containing the non-aligned size
823 * @param irg the irg where new nodes are allocated on
824 * @param irg the block where new nodes are allocated on
825 * @param dbg debug info for new nodes
827 * @return a node representing the aligned size
829 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size,
830 ir_graph *irg, ir_node *block, dbg_info *dbg)
832 if (stack_alignment > 1) {
837 assert(is_po2(stack_alignment));
839 mode = get_irn_mode(size);
840 tv = new_tarval_from_long(stack_alignment-1, mode);
841 mask = new_r_Const(irg, block, mode, tv);
842 size = new_rd_Add(dbg, irg, block, size, mask, mode);
844 tv = new_tarval_from_long(-(long)stack_alignment, mode);
845 mask = new_r_Const(irg, block, mode, tv);
846 size = new_rd_And(dbg, irg, block, size, mask, mode);
852 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
854 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
863 const ir_edge_t *edge;
864 ir_node *new_alloc, *size, *addr, *ins[2];
865 unsigned stack_alignment;
867 assert(get_Alloc_where(alloc) == stack_alloc);
869 block = get_nodes_block(alloc);
870 irg = get_irn_irg(block);
873 type = get_Alloc_type(alloc);
875 foreach_out_edge(alloc, edge) {
876 ir_node *irn = get_edge_src_irn(edge);
878 assert(is_Proj(irn));
879 switch (get_Proj_proj(irn)) {
891 /* Beware: currently Alloc nodes without a result might happen,
892 only escape analysis kills them and this phase runs only for object
893 oriented source. We kill the Alloc here. */
894 if (alloc_res == NULL && alloc_mem) {
895 exchange(alloc_mem, get_Alloc_mem(alloc));
899 dbg = get_irn_dbg_info(alloc);
901 /* we might need to multiply the size with the element size */
902 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
903 tarval *tv = new_tarval_from_long(get_type_size_bytes(type),
905 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
906 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Alloc_size(alloc),
910 size = get_Alloc_size(alloc);
913 /* The stack pointer will be modified in an unknown manner.
914 We cannot omit it. */
915 env->call->flags.bits.try_omit_fp = 0;
917 stack_alignment = 1 << env->arch_env->stack_alignment;
918 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
919 new_alloc = be_new_AddSP(env->arch_env->sp, irg, block, curr_sp, size);
920 set_irn_dbg_info(new_alloc, dbg);
922 if(alloc_mem != NULL) {
926 addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
928 /* We need to sync the output mem of the AddSP with the input mem
929 edge into the alloc node. */
930 ins[0] = get_Alloc_mem(alloc);
932 sync = new_r_Sync(irg, block, 2, ins);
934 exchange(alloc_mem, sync);
937 exchange(alloc, new_alloc);
939 /* fix projnum of alloca res */
940 set_Proj_proj(alloc_res, pn_be_AddSP_res);
943 curr_sp = new_r_Proj(irg, block, new_alloc, get_irn_mode(curr_sp),
951 * The Free is transformed into a back end free node and connected to the stack nodes.
953 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
957 ir_node *subsp, *mem, *res, *size, *sync;
961 unsigned stack_alignment;
964 assert(get_Free_where(free) == stack_alloc);
966 block = get_nodes_block(free);
967 irg = get_irn_irg(block);
968 type = get_Free_type(free);
969 sp_mode = env->arch_env->sp->reg_class->mode;
970 dbg = get_irn_dbg_info(free);
972 /* we might need to multiply the size with the element size */
973 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
974 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
975 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
976 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
980 size = get_Free_size(free);
983 stack_alignment = 1 << env->arch_env->stack_alignment;
984 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
986 /* The stack pointer will be modified in an unknown manner.
987 We cannot omit it. */
988 env->call->flags.bits.try_omit_fp = 0;
989 subsp = be_new_SubSP(env->arch_env->sp, irg, block, curr_sp, size);
990 set_irn_dbg_info(subsp, dbg);
992 mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
993 res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_sp);
995 /* we need to sync the memory */
996 in[0] = get_Free_mem(free);
998 sync = new_r_Sync(irg, block, 2, in);
1000 /* and make the AddSP dependent on the former memory */
1001 add_irn_dep(subsp, get_Free_mem(free));
1004 exchange(free, sync);
1010 /* the following function is replaced by the usage of the heights module */
1013 * Walker for dependent_on().
1014 * This function searches a node tgt recursively from a given node
1015 * but is restricted to the given block.
1016 * @return 1 if tgt was reachable from curr, 0 if not.
1018 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl)
1022 if (get_nodes_block(curr) != bl)
1028 /* Phi functions stop the recursion inside a basic block */
1029 if (! is_Phi(curr)) {
1030 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
1031 if (check_dependence(get_irn_n(curr, i), tgt, bl))
1041 * Check if a node is somehow data dependent on another one.
1042 * both nodes must be in the same basic block.
1043 * @param n1 The first node.
1044 * @param n2 The second node.
1045 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1047 static int dependent_on(ir_node *n1, ir_node *n2)
1049 assert(get_nodes_block(n1) == get_nodes_block(n2));
1051 return heights_reachable_in_block(ir_heights, n1, n2);
1054 static int cmp_call_dependency(const void *c1, const void *c2)
1056 ir_node *n1 = *(ir_node **) c1;
1057 ir_node *n2 = *(ir_node **) c2;
1060 Classical qsort() comparison function behavior:
1061 0 if both elements are equal
1062 1 if second is "smaller" that first
1063 -1 if first is "smaller" that second
1065 if (dependent_on(n1, n2))
1068 if (dependent_on(n2, n1))
1075 * Walker: links all Call/Alloc/Free nodes to the Block they are contained.
1076 * Clears the irg_is_leaf flag if a Call is detected.
1078 static void link_ops_in_block_walker(ir_node *irn, void *data)
1080 ir_opcode code = get_irn_opcode(irn);
1082 if (code == iro_Call ||
1083 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1084 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1085 be_abi_irg_t *env = data;
1086 ir_node *bl = get_nodes_block(irn);
1087 void *save = get_irn_link(bl);
1089 if (code == iro_Call)
1090 env->call->flags.bits.irg_is_leaf = 0;
1092 set_irn_link(irn, save);
1093 set_irn_link(bl, irn);
1099 * Process all Call/Alloc/Free nodes inside a basic block.
1100 * Note that the link field of the block must contain a linked list of all
1101 * Call nodes inside the Block. We first order this list according to data dependency
1102 * and that connect the calls together.
1104 static void process_ops_in_block(ir_node *bl, void *data)
1106 be_abi_irg_t *env = data;
1107 ir_node *curr_sp = env->init_sp;
1111 for (irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
1112 obstack_ptr_grow(&env->obst, irn);
1114 /* If there were call nodes in the block. */
1120 nodes = obstack_finish(&env->obst);
1122 /* order the call nodes according to data dependency */
1123 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
1125 for (i = n - 1; i >= 0; --i) {
1126 ir_node *irn = nodes[i];
1128 DBG((env->dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1129 switch (get_irn_opcode(irn)) {
1132 /* The stack pointer will be modified due to a call. */
1133 env->call->flags.bits.try_omit_fp = 0;
1135 curr_sp = adjust_call(env, irn, curr_sp);
1138 if (get_Alloc_where(irn) == stack_alloc)
1139 curr_sp = adjust_alloc(env, irn, curr_sp);
1142 if (get_Free_where(irn) == stack_alloc)
1143 curr_sp = adjust_free(env, irn, curr_sp);
1146 panic("invalid call");
1151 obstack_free(&env->obst, nodes);
1153 /* Keep the last stack state in the block by tying it to Keep node,
1154 * the proj from calls is already kept */
1155 if (curr_sp != env->init_sp &&
1156 !(is_Proj(curr_sp) && be_is_Call(get_Proj_pred(curr_sp)))) {
1158 keep = be_new_Keep(env->arch_env->sp->reg_class,
1159 get_irn_irg(bl), bl, 1, nodes);
1160 pmap_insert(env->keep_map, bl, keep);
1164 set_irn_link(bl, curr_sp);
1165 } /* process_calls_in_block */
1168 * Adjust all call nodes in the graph to the ABI conventions.
1170 static void process_calls(be_abi_irg_t *env)
1172 ir_graph *irg = env->birg->irg;
1174 env->call->flags.bits.irg_is_leaf = 1;
1175 irg_walk_graph(irg, firm_clear_link, link_ops_in_block_walker, env);
1177 ir_heights = heights_new(env->birg->irg);
1178 irg_block_walk_graph(irg, NULL, process_ops_in_block, env);
1179 heights_free(ir_heights);
1183 * Computes the stack argument layout type.
1184 * Changes a possibly allocated value param type by moving
1185 * entities to the stack layout type.
1187 * @param env the ABI environment
1188 * @param call the current call ABI
1189 * @param method_type the method type
1190 * @param param_map an array mapping method arguments to the stack layout type
1192 * @return the stack argument layout type
1194 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type, ir_entity ***param_map)
1196 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1197 int inc = env->birg->main_env->arch_env->stack_dir * dir;
1198 int n = get_method_n_params(method_type);
1199 int curr = inc > 0 ? 0 : n - 1;
1205 ir_type *val_param_tp = get_method_value_param_type(method_type);
1206 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1209 *param_map = map = obstack_alloc(&env->obst, n * sizeof(ir_entity *));
1210 res = new_type_struct(mangle_u(id, new_id_from_chars("arg_type", 8)));
1211 for (i = 0; i < n; ++i, curr += inc) {
1212 ir_type *param_type = get_method_param_type(method_type, curr);
1213 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1216 if (arg->on_stack) {
1218 /* the entity was already created, move it to the param type */
1219 arg->stack_ent = get_method_value_param_ent(method_type, i);
1220 remove_struct_member(val_param_tp, arg->stack_ent);
1221 set_entity_owner(arg->stack_ent, res);
1222 add_struct_member(res, arg->stack_ent);
1223 /* must be automatic to set a fixed layout */
1224 set_entity_allocation(arg->stack_ent, allocation_automatic);
1227 snprintf(buf, sizeof(buf), "param_%d", i);
1228 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1230 ofs += arg->space_before;
1231 ofs = round_up2(ofs, arg->alignment);
1232 set_entity_offset(arg->stack_ent, ofs);
1233 ofs += arg->space_after;
1234 ofs += get_type_size_bytes(param_type);
1235 map[i] = arg->stack_ent;
1238 set_type_size_bytes(res, ofs);
1239 set_type_state(res, layout_fixed);
1244 const arch_register_t *reg;
1248 static int cmp_regs(const void *a, const void *b)
1250 const reg_node_map_t *p = a;
1251 const reg_node_map_t *q = b;
1253 if(p->reg->reg_class == q->reg->reg_class)
1254 return p->reg->index - q->reg->index;
1256 return p->reg->reg_class - q->reg->reg_class;
1259 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1262 int n = pmap_count(reg_map);
1264 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1266 foreach_pmap(reg_map, ent) {
1267 res[i].reg = ent->key;
1268 res[i].irn = ent->value;
1272 qsort(res, n, sizeof(res[0]), cmp_regs);
1277 * Creates a barrier.
1279 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1281 ir_graph *irg = env->birg->irg;
1282 int n_regs = pmap_count(regs);
1288 rm = reg_map_to_arr(&env->obst, regs);
1290 for (n = 0; n < n_regs; ++n)
1291 obstack_ptr_grow(&env->obst, rm[n].irn);
1294 obstack_ptr_grow(&env->obst, *mem);
1298 in = (ir_node **) obstack_finish(&env->obst);
1299 irn = be_new_Barrier(irg, bl, n, in);
1300 obstack_free(&env->obst, in);
1302 for(n = 0; n < n_regs; ++n) {
1303 ir_node *pred = rm[n].irn;
1304 const arch_register_t *reg = rm[n].reg;
1305 arch_register_type_t add_type = 0;
1308 /* stupid workaround for now... as not all nodes report register
1310 if (!is_Phi(pred)) {
1311 const arch_register_req_t *ireq = arch_get_register_req_out(pred);
1312 if (ireq->type & arch_register_req_type_ignore)
1313 add_type |= arch_register_req_type_ignore;
1314 if (ireq->type & arch_register_req_type_produces_sp)
1315 add_type |= arch_register_req_type_produces_sp;
1318 proj = new_r_Proj(irg, bl, irn, get_irn_mode(pred), n);
1319 be_node_set_reg_class_in(irn, n, reg->reg_class);
1321 be_set_constr_single_reg_in(irn, n, reg, 0);
1322 be_set_constr_single_reg_out(irn, n, reg, add_type);
1323 arch_set_irn_register(proj, reg);
1325 pmap_insert(regs, (void *) reg, proj);
1329 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1332 obstack_free(&env->obst, rm);
1337 * Creates a be_Return for a Return node.
1339 * @param @env the abi environment
1340 * @param irn the Return node or NULL if there was none
1341 * @param bl the block where the be_Retun should be placed
1342 * @param mem the current memory
1343 * @param n_res number of return results
1345 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl,
1346 ir_node *mem, int n_res)
1348 be_abi_call_t *call = env->call;
1349 const arch_env_t *arch_env = env->birg->main_env->arch_env;
1351 pmap *reg_map = pmap_create();
1352 ir_node *keep = pmap_get(env->keep_map, bl);
1359 const arch_register_t **regs;
1363 get the valid stack node in this block.
1364 If we had a call in that block there is a Keep constructed by process_calls()
1365 which points to the last stack modification in that block. we'll use
1366 it then. Else we use the stack from the start block and let
1367 the ssa construction fix the usage.
1369 stack = be_abi_reg_map_get(env->regs, arch_env->sp);
1371 stack = get_irn_n(keep, 0);
1373 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1376 /* Insert results for Return into the register map. */
1377 for (i = 0; i < n_res; ++i) {
1378 ir_node *res = get_Return_res(irn, i);
1379 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1380 assert(arg->in_reg && "return value must be passed in register");
1381 pmap_insert(reg_map, (void *) arg->reg, res);
1384 /* Add uses of the callee save registers. */
1385 foreach_pmap(env->regs, ent) {
1386 const arch_register_t *reg = ent->key;
1387 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1388 pmap_insert(reg_map, ent->key, ent->value);
1391 be_abi_reg_map_set(reg_map, arch_env->sp, stack);
1393 /* Make the Epilogue node and call the arch's epilogue maker. */
1394 create_barrier(env, bl, &mem, reg_map, 1);
1395 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1398 Maximum size of the in array for Return nodes is
1399 return args + callee save/ignore registers + memory + stack pointer
1401 in_max = pmap_count(reg_map) + n_res + 2;
1403 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1404 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1407 in[1] = be_abi_reg_map_get(reg_map, arch_env->sp);
1409 regs[1] = arch_env->sp;
1412 /* clear SP entry, since it has already been grown. */
1413 pmap_insert(reg_map, (void *) arch_env->sp, NULL);
1414 for (i = 0; i < n_res; ++i) {
1415 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1417 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1418 regs[n++] = arg->reg;
1420 /* Clear the map entry to mark the register as processed. */
1421 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1424 /* grow the rest of the stuff. */
1425 foreach_pmap(reg_map, ent) {
1428 regs[n++] = ent->key;
1432 /* The in array for the new back end return is now ready. */
1434 dbgi = get_irn_dbg_info(irn);
1438 /* we have to pop the shadow parameter in in case of struct returns */
1440 ret = be_new_Return(dbgi, env->birg->irg, bl, n_res, pop, n, in);
1442 /* Set the register classes of the return's parameter accordingly. */
1443 for (i = 0; i < n; ++i) {
1444 if (regs[i] == NULL)
1447 be_node_set_reg_class_in(ret, i, regs[i]->reg_class);
1450 /* Free the space of the Epilog's in array and the register <-> proj map. */
1451 obstack_free(&env->obst, in);
1452 pmap_destroy(reg_map);
1457 typedef struct lower_frame_sels_env_t {
1459 ir_entity *value_param_list; /**< the list of all value param entities */
1460 ir_entity *value_param_tail; /**< the tail of the list of all value param entities */
1461 } lower_frame_sels_env_t;
1464 * Walker: Replaces Sels of frame type and
1465 * value param type entities by FrameAddress.
1466 * Links all used entities.
1468 static void lower_frame_sels_walker(ir_node *irn, void *data) {
1469 lower_frame_sels_env_t *ctx = data;
1472 ir_graph *irg = current_ir_graph;
1473 ir_node *frame = get_irg_frame(irg);
1474 ir_node *param_base = get_irg_value_param_base(irg);
1475 ir_node *ptr = get_Sel_ptr(irn);
1477 if (ptr == frame || ptr == param_base) {
1478 be_abi_irg_t *env = ctx->env;
1479 ir_entity *ent = get_Sel_entity(irn);
1480 ir_node *bl = get_nodes_block(irn);
1483 nw = be_new_FrameAddr(env->arch_env->sp->reg_class, irg, bl, frame, ent);
1486 /* check, if it's a param sel and if have not seen this entity before */
1487 if (ptr == param_base &&
1488 ent != ctx->value_param_tail &&
1489 get_entity_link(ent) == NULL) {
1490 set_entity_link(ent, ctx->value_param_list);
1491 ctx->value_param_list = ent;
1492 if (ctx->value_param_tail == NULL) ctx->value_param_tail = ent;
1499 * Check if a value parameter is transmitted as a register.
1500 * This might happen if the address of an parameter is taken which is
1501 * transmitted in registers.
1503 * Note that on some architectures this case must be handled specially
1504 * because the place of the backing store is determined by their ABI.
1506 * In the default case we move the entity to the frame type and create
1507 * a backing store into the first block.
1509 static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_entity *value_param_list) {
1510 be_abi_call_t *call = env->call;
1511 ir_graph *irg = env->birg->irg;
1512 ir_entity *ent, *next_ent, *new_list;
1514 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1517 for (ent = value_param_list; ent; ent = next_ent) {
1518 int i = get_struct_member_index(get_entity_owner(ent), ent);
1519 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1521 next_ent = get_entity_link(ent);
1523 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", i));
1524 set_entity_link(ent, new_list);
1529 /* ok, change the graph */
1530 ir_node *start_bl = get_irg_start_block(irg);
1531 ir_node *first_bl = NULL;
1532 ir_node *frame, *imem, *nmem, *store, *mem, *args, *args_bl;
1533 const ir_edge_t *edge;
1534 optimization_state_t state;
1537 foreach_block_succ(start_bl, edge) {
1538 ir_node *succ = get_edge_src_irn(edge);
1539 if (start_bl != succ) {
1545 /* we had already removed critical edges, so the following
1546 assertion should be always true. */
1547 assert(get_Block_n_cfgpreds(first_bl) == 1);
1549 /* now create backing stores */
1550 frame = get_irg_frame(irg);
1551 imem = get_irg_initial_mem(irg);
1553 save_optimization_state(&state);
1555 nmem = new_r_Proj(irg, first_bl, get_irg_start(irg), mode_M, pn_Start_M);
1556 restore_optimization_state(&state);
1558 /* reroute all edges to the new memory source */
1559 edges_reroute(imem, nmem, irg);
1563 args = get_irg_args(irg);
1564 args_bl = get_nodes_block(args);
1565 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1566 int i = get_struct_member_index(get_entity_owner(ent), ent);
1567 ir_type *tp = get_entity_type(ent);
1568 ir_mode *mode = get_type_mode(tp);
1571 /* address for the backing store */
1572 addr = be_new_FrameAddr(env->arch_env->sp->reg_class, irg, first_bl, frame, ent);
1575 mem = new_r_Proj(irg, first_bl, store, mode_M, pn_Store_M);
1577 /* the backing store itself */
1578 store = new_r_Store(irg, first_bl, mem, addr,
1579 new_r_Proj(irg, args_bl, args, mode, i));
1581 /* the new memory Proj gets the last Proj from store */
1582 set_Proj_pred(nmem, store);
1583 set_Proj_proj(nmem, pn_Store_M);
1585 /* move all entities to the frame type */
1586 frame_tp = get_irg_frame_type(irg);
1587 offset = get_type_size_bytes(frame_tp);
1589 /* we will add new entities: set the layout to undefined */
1590 assert(get_type_state(frame_tp) == layout_fixed);
1591 set_type_state(frame_tp, layout_undefined);
1592 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1593 ir_type *tp = get_entity_type(ent);
1594 unsigned align = get_type_alignment_bytes(tp);
1596 offset += align - 1;
1597 offset &= ~(align - 1);
1598 set_entity_owner(ent, frame_tp);
1599 add_class_member(frame_tp, ent);
1600 /* must be automatic to set a fixed layout */
1601 set_entity_allocation(ent, allocation_automatic);
1602 set_entity_offset(ent, offset);
1603 offset += get_type_size_bytes(tp);
1605 set_type_size_bytes(frame_tp, offset);
1606 /* fix the layout again */
1607 set_type_state(frame_tp, layout_fixed);
1613 * The start block has no jump, instead it has an initial exec Proj.
1614 * The backend wants to handle all blocks the same way, so we replace
1615 * the out cfg edge with a real jump.
1617 static void fix_start_block(ir_node *block, void *env) {
1620 ir_node *start_block;
1623 /* we processed the start block, return */
1627 irg = get_irn_irg(block);
1628 start_block = get_irg_start_block(irg);
1630 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1631 ir_node *pred = get_Block_cfgpred(block, i);
1632 ir_node *pred_block = get_nodes_block(pred);
1634 /* ok, we are in the block, having start as cfg predecessor */
1635 if (pred_block == start_block) {
1636 ir_node *jump = new_r_Jmp(irg, pred_block);
1637 set_Block_cfgpred(block, i, jump);
1645 * Modify the irg itself and the frame type.
1647 static void modify_irg(be_abi_irg_t *env)
1649 be_abi_call_t *call = env->call;
1650 const arch_env_t *arch_env= env->birg->main_env->arch_env;
1651 const arch_register_t *sp = arch_env_sp(arch_env);
1652 ir_graph *irg = env->birg->irg;
1656 ir_node *new_mem_proj;
1658 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1665 const arch_register_t *fp_reg;
1666 ir_node *frame_pointer;
1667 ir_node *reg_params_bl;
1670 ir_node *value_param_base;
1671 const ir_edge_t *edge;
1672 ir_type *arg_type, *bet_type, *tp;
1673 lower_frame_sels_env_t ctx;
1674 ir_entity **param_map;
1676 bitset_t *used_proj_nr;
1677 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1679 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1681 /* Must fetch memory here, otherwise the start Barrier gets the wrong
1682 * memory, which leads to loops in the DAG. */
1683 old_mem = get_irg_initial_mem(irg);
1685 /* set the links of all frame entities to NULL, we use it
1686 to detect if an entity is already linked in the value_param_list */
1687 tp = get_method_value_param_type(method_type);
1689 for (i = get_struct_n_members(tp) - 1; i >= 0; --i)
1690 set_entity_link(get_struct_member(tp, i), NULL);
1693 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1695 ctx.value_param_list = NULL;
1696 ctx.value_param_tail = NULL;
1697 irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
1699 /* value_param_base anchor is not needed anymore now */
1700 value_param_base = get_irg_value_param_base(irg);
1701 kill_node(value_param_base);
1702 set_irg_value_param_base(irg, new_r_Bad(irg));
1704 env->regs = pmap_create();
1706 used_proj_nr = bitset_alloca(1024);
1707 n_params = get_method_n_params(method_type);
1708 args = obstack_alloc(&env->obst, n_params * sizeof(args[0]));
1709 memset(args, 0, n_params * sizeof(args[0]));
1711 /* Check if a value parameter is transmitted as a register.
1712 * This might happen if the address of an parameter is taken which is
1713 * transmitted in registers.
1715 * Note that on some architectures this case must be handled specially
1716 * because the place of the backing store is determined by their ABI.
1718 * In the default case we move the entity to the frame type and create
1719 * a backing store into the first block.
1721 fix_address_of_parameter_access(env, ctx.value_param_list);
1723 /* Fill the argument vector */
1724 arg_tuple = get_irg_args(irg);
1725 foreach_out_edge(arg_tuple, edge) {
1726 ir_node *irn = get_edge_src_irn(edge);
1727 if (! is_Anchor(irn)) {
1728 int nr = get_Proj_proj(irn);
1730 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1734 arg_type = compute_arg_type(env, call, method_type, ¶m_map);
1735 bet_type = call->cb->get_between_type(env->cb);
1736 stack_frame_init(&env->frame, arg_type, bet_type, get_irg_frame_type(irg), arch_env->stack_dir, param_map);
1738 /* Count the register params and add them to the number of Projs for the RegParams node */
1739 for (i = 0; i < n_params; ++i) {
1740 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1741 if (arg->in_reg && args[i]) {
1742 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1743 assert(i == get_Proj_proj(args[i]));
1745 /* For now, associate the register with the old Proj from Start representing that argument. */
1746 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1747 bitset_set(used_proj_nr, i);
1748 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1752 /* Collect all callee-save registers */
1753 for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
1754 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
1755 for (j = 0; j < cls->n_regs; ++j) {
1756 const arch_register_t *reg = &cls->regs[j];
1757 if (arch_register_type_is(reg, callee_save) ||
1758 arch_register_type_is(reg, state)) {
1759 pmap_insert(env->regs, (void *) reg, NULL);
1764 pmap_insert(env->regs, (void *) sp, NULL);
1765 pmap_insert(env->regs, (void *) arch_env->bp, NULL);
1766 reg_params_bl = get_irg_start_block(irg);
1767 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1768 add_irn_dep(env->reg_params, get_irg_start(irg));
1771 * make proj nodes for the callee save registers.
1772 * memorize them, since Return nodes get those as inputs.
1774 * Note, that if a register corresponds to an argument, the regs map contains
1775 * the old Proj from start for that argument.
1778 rm = reg_map_to_arr(&env->obst, env->regs);
1779 for (i = 0, n = pmap_count(env->regs); i < n; ++i) {
1780 arch_register_t *reg = (void *) rm[i].reg;
1781 ir_mode *mode = reg->reg_class->mode;
1783 arch_register_req_type_t add_type = 0;
1787 add_type |= arch_register_req_type_produces_sp | arch_register_req_type_ignore;
1790 bitset_set(used_proj_nr, nr);
1791 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1792 pmap_insert(env->regs, (void *) reg, proj);
1793 be_set_constr_single_reg_out(env->reg_params, nr, reg, add_type);
1794 arch_set_irn_register(proj, reg);
1796 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1798 obstack_free(&env->obst, rm);
1800 /* create a new initial memory proj */
1801 assert(is_Proj(old_mem));
1802 new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
1803 new_r_Unknown(irg, mode_T), mode_M,
1804 get_Proj_proj(old_mem));
1807 /* Generate the Prologue */
1808 fp_reg = call->cb->prologue(env->cb, &mem, env->regs, &env->frame.initial_bias);
1810 /* do the stack allocation BEFORE the barrier, or spill code
1811 might be added before it */
1812 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1813 start_bl = get_irg_start_block(irg);
1814 env->init_sp = be_new_IncSP(sp, irg, start_bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND, 0);
1815 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1817 create_barrier(env, start_bl, &mem, env->regs, 0);
1819 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1820 arch_set_irn_register(env->init_sp, sp);
1822 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1823 set_irg_frame(irg, frame_pointer);
1824 pset_insert_ptr(env->ignore_regs, fp_reg);
1826 /* rewire old mem users to new mem */
1827 set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
1828 exchange(old_mem, mem);
1830 set_irg_initial_mem(irg, mem);
1832 /* Now, introduce stack param nodes for all parameters passed on the stack */
1833 for (i = 0; i < n_params; ++i) {
1834 ir_node *arg_proj = args[i];
1835 ir_node *repl = NULL;
1837 if (arg_proj != NULL) {
1838 be_abi_call_arg_t *arg;
1839 ir_type *param_type;
1840 int nr = get_Proj_proj(arg_proj);
1843 nr = MIN(nr, n_params);
1844 arg = get_call_arg(call, 0, nr);
1845 param_type = get_method_param_type(method_type, nr);
1848 repl = pmap_get(env->regs, (void *) arg->reg);
1849 } else if (arg->on_stack) {
1850 ir_node *addr = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1852 /* For atomic parameters which are actually used, we create a Load node. */
1853 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1854 ir_mode *mode = get_type_mode(param_type);
1855 ir_mode *load_mode = arg->load_mode;
1857 ir_node *load = new_r_Load(irg, reg_params_bl, new_NoMem(), addr, load_mode);
1858 set_irn_pinned(load, op_pin_state_floats);
1859 repl = new_r_Proj(irg, reg_params_bl, load, load_mode, pn_Load_res);
1861 if (mode != load_mode) {
1862 repl = new_r_Conv(irg, reg_params_bl, repl, mode);
1865 /* The stack parameter is not primitive (it is a struct or array),
1866 * we thus will create a node representing the parameter's address
1872 assert(repl != NULL);
1874 /* Beware: the mode of the register parameters is always the mode of the register class
1875 which may be wrong. Add Conv's then. */
1876 mode = get_irn_mode(args[i]);
1877 if (mode != get_irn_mode(repl)) {
1878 repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
1880 exchange(args[i], repl);
1884 /* the arg proj is not needed anymore now and should be only used by the anchor */
1885 assert(get_irn_n_edges(arg_tuple) == 1);
1886 kill_node(arg_tuple);
1887 set_irg_args(irg, new_rd_Bad(irg));
1889 /* All Return nodes hang on the End node, so look for them there. */
1890 end = get_irg_end_block(irg);
1891 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1892 ir_node *irn = get_Block_cfgpred(end, i);
1894 if (is_Return(irn)) {
1895 ir_node *blk = get_nodes_block(irn);
1896 ir_node *mem = get_Return_mem(irn);
1897 ir_node *ret = create_be_return(env, irn, blk, mem, get_Return_n_ress(irn));
1901 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
1902 the code is dead and will never be executed. */
1904 obstack_free(&env->obst, args);
1906 /* handle start block here (place a jump in the block) */
1908 irg_block_walk_graph(irg, fix_start_block, NULL, &i);
1911 /** Fix the state inputs of calls that still hang on unknowns */
1913 void fix_call_state_inputs(be_abi_irg_t *env)
1915 const arch_env_t *arch_env = env->arch_env;
1917 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
1919 /* Collect caller save registers */
1920 n = arch_env_get_n_reg_class(arch_env);
1921 for (i = 0; i < n; ++i) {
1923 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
1924 for (j = 0; j < cls->n_regs; ++j) {
1925 const arch_register_t *reg = arch_register_for_index(cls, j);
1926 if (arch_register_type_is(reg, state)) {
1927 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
1932 n = ARR_LEN(env->calls);
1933 n_states = ARR_LEN(stateregs);
1934 for (i = 0; i < n; ++i) {
1936 ir_node *call = env->calls[i];
1938 arity = get_irn_arity(call);
1940 /* the state reg inputs are the last n inputs of the calls */
1941 for (s = 0; s < n_states; ++s) {
1942 int inp = arity - n_states + s;
1943 const arch_register_t *reg = stateregs[s];
1944 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
1946 set_irn_n(call, inp, regnode);
1950 DEL_ARR_F(stateregs);
1954 * Create a trampoline entity for the given method.
1956 static ir_entity *create_trampoline(be_main_env_t *be, ir_entity *method)
1958 ir_type *type = get_entity_type(method);
1959 ident *old_id = get_entity_ld_ident(method);
1960 ident *id = mangle3("L", old_id, "$stub");
1961 ir_type *parent = be->pic_trampolines_type;
1962 ir_entity *ent = new_entity(parent, old_id, type);
1963 set_entity_ld_ident(ent, id);
1964 set_entity_visibility(ent, visibility_local);
1965 set_entity_variability(ent, variability_uninitialized);
1971 * Returns the trampoline entity for the given method.
1973 static ir_entity *get_trampoline(be_main_env_t *env, ir_entity *method)
1975 ir_entity *result = pmap_get(env->ent_trampoline_map, method);
1976 if (result == NULL) {
1977 result = create_trampoline(env, method);
1978 pmap_insert(env->ent_trampoline_map, method, result);
1984 static ir_entity *create_pic_symbol(be_main_env_t *be, ir_entity *entity)
1986 ident *old_id = get_entity_ld_ident(entity);
1987 ident *id = mangle3("L", old_id, "$non_lazy_ptr");
1988 ir_type *e_type = get_entity_type(entity);
1989 ir_type *type = new_type_pointer(id, e_type, mode_P_data);
1990 ir_type *parent = be->pic_symbols_type;
1991 ir_entity *ent = new_entity(parent, old_id, type);
1992 set_entity_ld_ident(ent, id);
1993 set_entity_visibility(ent, visibility_local);
1994 set_entity_variability(ent, variability_uninitialized);
1999 static ir_entity *get_pic_symbol(be_main_env_t *env, ir_entity *entity)
2001 ir_entity *result = pmap_get(env->ent_pic_symbol_map, entity);
2002 if (result == NULL) {
2003 result = create_pic_symbol(env, entity);
2004 pmap_insert(env->ent_pic_symbol_map, entity, result);
2013 * Returns non-zero if a given entity can be accessed using a relative address.
2015 static int can_address_relative(ir_entity *entity)
2017 return get_entity_variability(entity) == variability_initialized
2018 || get_entity_visibility(entity) == visibility_local;
2021 /** patches SymConsts to work in position independent code */
2022 static void fix_pic_symconsts(ir_node *node, void *data)
2032 be_abi_irg_t *env = data;
2034 be_main_env_t *be = env->birg->main_env;
2036 arity = get_irn_arity(node);
2037 for (i = 0; i < arity; ++i) {
2039 ir_node *pred = get_irn_n(node, i);
2041 ir_entity *pic_symbol;
2042 ir_node *pic_symconst;
2044 if (!is_SymConst(pred))
2047 entity = get_SymConst_entity(pred);
2048 block = get_nodes_block(pred);
2049 irg = get_irn_irg(pred);
2051 /* calls can jump to relative addresses, so we can directly jump to
2052 the (relatively) known call address or the trampoline */
2053 if (is_Call(node) && i == 1) {
2054 ir_entity *trampoline;
2055 ir_node *trampoline_const;
2057 if (can_address_relative(entity))
2060 dbgi = get_irn_dbg_info(pred);
2061 trampoline = get_trampoline(be, entity);
2062 trampoline_const = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2064 set_irn_n(node, i, trampoline_const);
2068 /* everything else is accessed relative to EIP */
2069 mode = get_irn_mode(pred);
2070 unknown = new_r_Unknown(irg, mode);
2071 pic_base = arch_code_generator_get_pic_base(env->birg->cg);
2073 /* all ok now for locally constructed stuff */
2074 if (can_address_relative(entity)) {
2075 ir_node *add = new_r_Add(irg, block, pic_base, pred, mode);
2077 /* make sure the walker doesn't visit this add again */
2078 mark_irn_visited(add);
2079 set_irn_n(node, i, add);
2083 /* get entry from pic symbol segment */
2084 dbgi = get_irn_dbg_info(pred);
2085 pic_symbol = get_pic_symbol(be, entity);
2086 pic_symconst = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2088 add = new_r_Add(irg, block, pic_base, pic_symconst, mode);
2089 mark_irn_visited(add);
2091 /* we need an extra indirection for global data outside our current
2092 module. The loads are always safe and can therefore float
2093 and need no memory input */
2094 load = new_r_Load(irg, block, new_NoMem(), add, mode);
2095 load_res = new_r_Proj(irg, block, load, mode, pn_Load_res);
2096 set_irn_pinned(load, op_pin_state_floats);
2098 set_irn_n(node, i, load_res);
2102 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2104 be_abi_irg_t *env = XMALLOC(be_abi_irg_t);
2105 ir_node *old_frame = get_irg_frame(birg->irg);
2106 ir_graph *irg = birg->irg;
2110 optimization_state_t state;
2111 unsigned *limited_bitset;
2113 be_omit_fp = birg->main_env->options->omit_fp;
2114 be_omit_leaf_fp = birg->main_env->options->omit_leaf_fp;
2116 obstack_init(&env->obst);
2118 env->arch_env = birg->main_env->arch_env;
2119 env->method_type = get_entity_type(get_irg_entity(irg));
2120 env->call = be_abi_call_new(env->arch_env->sp->reg_class);
2121 arch_env_get_call_abi(env->arch_env, env->method_type, env->call);
2123 env->ignore_regs = pset_new_ptr_default();
2124 env->keep_map = pmap_create();
2125 env->dce_survivor = new_survive_dce();
2128 env->sp_req.type = arch_register_req_type_limited;
2129 env->sp_req.cls = arch_register_get_class(env->arch_env->sp);
2130 limited_bitset = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
2131 rbitset_set(limited_bitset, arch_register_get_index(env->arch_env->sp));
2132 env->sp_req.limited = limited_bitset;
2133 if (env->arch_env->sp->type & arch_register_type_ignore) {
2134 env->sp_req.type |= arch_register_req_type_ignore;
2137 env->sp_cls_req.type = arch_register_req_type_normal;
2138 env->sp_cls_req.cls = arch_register_get_class(env->arch_env->sp);
2140 /* Beware: later we replace this node by the real one, ensure it is not CSE'd
2141 to another Unknown or the stack pointer gets used */
2142 save_optimization_state(&state);
2144 env->init_sp = dummy = new_r_Unknown(irg, env->arch_env->sp->reg_class->mode);
2145 restore_optimization_state(&state);
2146 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
2148 env->calls = NEW_ARR_F(ir_node*, 0);
2150 if (birg->main_env->options->pic) {
2151 irg_walk_graph(irg, fix_pic_symconsts, NULL, env);
2154 /* Lower all call nodes in the IRG. */
2158 Beware: init backend abi call object after processing calls,
2159 otherwise some information might be not yet available.
2161 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2163 /* Process the IRG */
2166 /* fix call inputs for state registers */
2167 fix_call_state_inputs(env);
2169 /* We don't need the keep map anymore. */
2170 pmap_destroy(env->keep_map);
2171 env->keep_map = NULL;
2173 /* calls array is not needed anymore */
2174 DEL_ARR_F(env->calls);
2177 /* reroute the stack origin of the calls to the true stack origin. */
2178 exchange(dummy, env->init_sp);
2179 exchange(old_frame, get_irg_frame(irg));
2181 /* Make some important node pointers survive the dead node elimination. */
2182 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2183 foreach_pmap(env->regs, ent) {
2184 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2187 env->call->cb->done(env->cb);
2192 void be_abi_free(be_abi_irg_t *env)
2194 be_abi_call_free(env->call);
2195 free_survive_dce(env->dce_survivor);
2196 del_pset(env->ignore_regs);
2197 pmap_destroy(env->regs);
2198 obstack_free(&env->obst, NULL);
2202 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2204 arch_register_t *reg;
2206 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2207 if(reg->reg_class == cls)
2208 bitset_set(bs, reg->index);
2211 void be_abi_set_non_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, unsigned *raw_bitset)
2214 arch_register_t *reg;
2216 for (i = 0; i < cls->n_regs; ++i) {
2217 if (arch_register_type_is(&cls->regs[i], ignore))
2220 rbitset_set(raw_bitset, i);
2223 for (reg = pset_first(abi->ignore_regs); reg != NULL;
2224 reg = pset_next(abi->ignore_regs)) {
2225 if (reg->reg_class != cls)
2228 rbitset_clear(raw_bitset, reg->index);
2232 /* Returns the stack layout from a abi environment. */
2233 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi) {
2240 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2241 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2242 | _| | |> < ___) | || (_| | (__| <
2243 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2247 typedef ir_node **node_array;
2249 typedef struct fix_stack_walker_env_t {
2250 node_array sp_nodes;
2251 } fix_stack_walker_env_t;
2254 * Walker. Collect all stack modifying nodes.
2256 static void collect_stack_nodes_walker(ir_node *node, void *data)
2258 fix_stack_walker_env_t *env = data;
2259 const arch_register_req_t *req;
2261 if (get_irn_mode(node) == mode_T)
2264 req = arch_get_register_req_out(node);
2265 if (! (req->type & arch_register_req_type_produces_sp))
2268 ARR_APP1(ir_node*, env->sp_nodes, node);
2271 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2273 be_ssa_construction_env_t senv;
2276 be_irg_t *birg = env->birg;
2277 be_lv_t *lv = be_get_birg_liveness(birg);
2278 fix_stack_walker_env_t walker_env;
2280 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2282 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2284 /* nothing to be done if we didn't find any node, in fact we mustn't
2285 * continue, as for endless loops incsp might have had no users and is bad
2288 len = ARR_LEN(walker_env.sp_nodes);
2290 DEL_ARR_F(walker_env.sp_nodes);
2294 be_ssa_construction_init(&senv, birg);
2295 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2296 ARR_LEN(walker_env.sp_nodes));
2297 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2298 ARR_LEN(walker_env.sp_nodes));
2301 len = ARR_LEN(walker_env.sp_nodes);
2302 for(i = 0; i < len; ++i) {
2303 be_liveness_update(lv, walker_env.sp_nodes[i]);
2305 be_ssa_construction_update_liveness_phis(&senv, lv);
2308 phis = be_ssa_construction_get_new_phis(&senv);
2310 /* set register requirements for stack phis */
2311 len = ARR_LEN(phis);
2312 for(i = 0; i < len; ++i) {
2313 ir_node *phi = phis[i];
2314 be_set_phi_reg_req(phi, &env->sp_req, arch_register_req_type_produces_sp);
2315 arch_set_irn_register(phi, env->arch_env->sp);
2317 be_ssa_construction_destroy(&senv);
2319 DEL_ARR_F(walker_env.sp_nodes);
2323 * Fix all stack accessing operations in the block bl.
2325 * @param env the abi environment
2326 * @param bl the block to process
2327 * @param real_bias the bias value
2329 * @return the bias at the end of this block
2331 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int real_bias)
2333 int omit_fp = env->call->flags.bits.try_omit_fp;
2335 int wanted_bias = real_bias;
2337 sched_foreach(bl, irn) {
2341 Check, if the node relates to an entity on the stack frame.
2342 If so, set the true offset (including the bias) for that
2345 ir_entity *ent = arch_get_frame_entity(irn);
2347 int bias = omit_fp ? real_bias : 0;
2348 int offset = get_stack_entity_offset(&env->frame, ent, bias);
2349 arch_set_frame_offset(irn, offset);
2350 DBG((env->dbg, LEVEL_2, "%F has offset %d (including bias %d)\n",
2351 ent, offset, bias));
2355 * If the node modifies the stack pointer by a constant offset,
2356 * record that in the bias.
2358 ofs = arch_get_sp_bias(irn);
2360 if (be_is_IncSP(irn)) {
2361 /* fill in real stack frame size */
2362 if (ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2363 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2364 ofs = (int) get_type_size_bytes(frame_type);
2365 be_set_IncSP_offset(irn, ofs);
2366 } else if (ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2367 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2368 ofs = - (int)get_type_size_bytes(frame_type);
2369 be_set_IncSP_offset(irn, ofs);
2371 if (be_get_IncSP_align(irn)) {
2372 /* patch IncSP to produce an aligned stack pointer */
2373 ir_type *between_type = env->frame.between_type;
2374 int between_size = get_type_size_bytes(between_type);
2375 int alignment = 1 << env->arch_env->stack_alignment;
2376 int delta = (real_bias + ofs + between_size) & (alignment - 1);
2379 be_set_IncSP_offset(irn, ofs + alignment - delta);
2380 real_bias += alignment - delta;
2383 /* adjust so real_bias corresponds with wanted_bias */
2384 int delta = wanted_bias - real_bias;
2387 be_set_IncSP_offset(irn, ofs + delta);
2398 assert(real_bias == wanted_bias);
2403 * A helper struct for the bias walker.
2406 be_abi_irg_t *env; /**< The ABI irg environment. */
2407 int start_block_bias; /**< The bias at the end of the start block. */
2409 ir_node *start_block; /**< The start block of the current graph. */
2413 * Block-Walker: fix all stack offsets for all blocks
2414 * except the start block
2416 static void stack_bias_walker(ir_node *bl, void *data)
2418 struct bias_walk *bw = data;
2419 if (bl != bw->start_block) {
2420 process_stack_bias(bw->env, bl, bw->start_block_bias);
2424 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2426 ir_graph *irg = env->birg->irg;
2427 struct bias_walk bw;
2429 stack_frame_compute_initial_offset(&env->frame);
2430 // stack_layout_dump(stdout, frame);
2432 /* Determine the stack bias at the end of the start block. */
2433 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), env->frame.initial_bias);
2434 bw.between_size = get_type_size_bytes(env->frame.between_type);
2436 /* fix the bias is all other blocks */
2438 bw.start_block = get_irg_start_block(irg);
2439 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2442 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2444 assert(arch_register_type_is(reg, callee_save));
2445 assert(pmap_contains(abi->regs, (void *) reg));
2446 return pmap_get(abi->regs, (void *) reg);
2449 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2451 assert(arch_register_type_is(reg, ignore));
2452 assert(pmap_contains(abi->regs, (void *) reg));
2453 return pmap_get(abi->regs, (void *) reg);
2457 * Returns non-zero if the ABI has omitted the frame pointer in
2458 * the current graph.
2460 int be_abi_omit_fp(const be_abi_irg_t *abi) {
2461 return abi->call->flags.bits.try_omit_fp;