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
35 #include "irgraph_t.h"
38 #include "iredges_t.h"
41 #include "irprintf_t.h"
47 #include "raw_bitset.h"
55 #include "besched_t.h"
57 #include "bessaconstr.h"
59 typedef struct _be_abi_call_arg_t {
60 unsigned is_res : 1; /**< 1: the call argument is a return value. 0: it's a call parameter. */
61 unsigned in_reg : 1; /**< 1: this argument is transmitted in registers. */
62 unsigned on_stack : 1; /**< 1: this argument is transmitted on the stack. */
65 const arch_register_t *reg;
68 unsigned alignment; /**< stack alignment */
69 unsigned space_before; /**< allocate space before */
70 unsigned space_after; /**< allocate space after */
73 struct _be_abi_call_t {
74 be_abi_call_flags_t flags;
76 const be_abi_callbacks_t *cb;
77 ir_type *between_type;
79 const arch_register_class_t *cls_addr;
82 struct _be_abi_irg_t {
84 be_stack_layout_t *frame; /**< The stack frame model. */
85 be_irg_t *birg; /**< The back end IRG. */
86 const arch_isa_t *isa; /**< The isa. */
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 DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< The debugging module. */
114 static heights_t *ir_heights;
116 /* Flag: if set, try to omit the frame pointer if called by the backend */
117 static int be_omit_fp = 1;
118 static int be_pic = 0;
121 _ ____ ___ ____ _ _ _ _
122 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
123 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
124 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
125 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
127 These callbacks are used by the backend to set the parameters
128 for a specific call type.
132 * Set compare function: compares two ABI call object arguments.
134 static int cmp_call_arg(const void *a, const void *b, size_t n)
136 const be_abi_call_arg_t *p = a, *q = b;
138 return !(p->is_res == q->is_res && p->pos == q->pos);
142 * Get or set an ABI call object argument.
144 * @param call the abi call
145 * @param is_res true for call results, false for call arguments
146 * @param pos position of the argument
147 * @param do_insert true if the argument is set, false if it's retrieved
149 static be_abi_call_arg_t *get_or_set_call_arg(be_abi_call_t *call, int is_res, int pos, int do_insert)
151 be_abi_call_arg_t arg;
154 memset(&arg, 0, sizeof(arg));
158 hash = is_res * 128 + pos;
161 ? set_insert(call->params, &arg, sizeof(arg), hash)
162 : set_find(call->params, &arg, sizeof(arg), hash);
166 * Retrieve an ABI call object argument.
168 * @param call the ABI call object
169 * @param is_res true for call results, false for call arguments
170 * @param pos position of the argument
172 static INLINE be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
174 return get_or_set_call_arg(call, is_res, pos, 0);
177 /* Set the flags for a call. */
178 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
184 void be_abi_call_set_pop(be_abi_call_t *call, int pop)
190 /* Set register class for call address */
191 void be_abi_call_set_call_address_reg_class(be_abi_call_t *call, const arch_register_class_t *cls)
193 call->cls_addr = cls;
197 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)
199 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
201 arg->load_mode = load_mode;
202 arg->alignment = alignment;
203 arg->space_before = space_before;
204 arg->space_after = space_after;
205 assert(alignment > 0 && "Alignment must be greater than 0");
208 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
210 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
215 void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
217 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 1, arg_pos, 1);
222 /* Get the flags of a ABI call object. */
223 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
229 * Constructor for a new ABI call object.
231 * @return the new ABI call object
233 static be_abi_call_t *be_abi_call_new(const arch_register_class_t *cls_addr)
235 be_abi_call_t *call = xmalloc(sizeof(call[0]));
236 memset(call, 0, sizeof(call[0]));
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;
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, int bias)
276 ir_type *t = get_entity_owner(ent);
277 int ofs = get_entity_offset(ent);
281 /* Find the type the entity is contained in. */
282 for(index = 0; index < N_FRAME_TYPES; ++index) {
283 if(frame->order[index] == t)
287 /* Add the size of all the types below the one of the entity to the entity's offset */
288 for(i = 0; i < index; ++i)
289 ofs += get_type_size_bytes(frame->order[i]);
291 /* correct the offset by the initial position of the frame pointer */
292 ofs -= frame->initial_offset;
294 /* correct the offset with the current bias. */
301 * Retrieve the entity with given offset from a frame type.
303 static ir_entity *search_ent_with_offset(ir_type *t, int offset)
307 for(i = 0, n = get_compound_n_members(t); i < n; ++i) {
308 ir_entity *ent = get_compound_member(t, i);
309 if(get_entity_offset(ent) == offset)
316 static int stack_frame_compute_initial_offset(be_stack_layout_t *frame)
318 ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
319 ir_entity *ent = search_ent_with_offset(base, 0);
321 frame->initial_offset = ent ? get_stack_entity_offset(frame, ent, 0) : 0;
323 return frame->initial_offset;
327 * Initializes the frame layout from parts
329 * @param frame the stack layout that will be initialized
330 * @param args the stack argument layout type
331 * @param between the between layout type
332 * @param locals the method frame type
333 * @param stack_dir the stack direction
334 * @param param_map an array mapping method argument positions to the stack argument type
336 * @return the initialized stack layout
338 static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *args,
339 ir_type *between, ir_type *locals, int stack_dir,
340 ir_entity *param_map[])
342 frame->arg_type = args;
343 frame->between_type = between;
344 frame->frame_type = locals;
345 frame->initial_offset = 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 const arch_isa_t *isa = arch_env->isa;
414 ir_type *call_tp = get_Call_type(irn);
415 ir_node *call_ptr = get_Call_ptr(irn);
416 int n_params = get_method_n_params(call_tp);
417 ir_node *curr_mem = get_Call_mem(irn);
418 ir_node *bl = get_nodes_block(irn);
419 pset *results = pset_new_ptr(8);
420 pset *caller_save = pset_new_ptr(8);
421 pset *states = pset_new_ptr(2);
423 int stack_dir = arch_isa_stack_dir(isa);
424 const arch_register_t *sp = arch_isa_sp(isa);
425 be_abi_call_t *call = be_abi_call_new(sp->reg_class);
426 ir_mode *mach_mode = sp->reg_class->mode;
427 struct obstack *obst = &env->obst;
428 int no_alloc = call->flags.bits.frame_is_setup_on_call;
429 int n_res = get_method_n_ress(call_tp);
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_isa_get_call_abi(isa, 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);
476 /* If there are some parameters which shall be passed on the stack. */
477 if (n_stack_params > 0) {
479 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
482 * Reverse list of stack parameters if call arguments are from left to right.
483 * We must them reverse again if they are pushed (not stored) and the stack
484 * direction is downwards.
486 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
487 for (i = 0; i < n_stack_params >> 1; ++i) {
488 int other = n_stack_params - i - 1;
489 int tmp = stack_param_idx[i];
490 stack_param_idx[i] = stack_param_idx[other];
491 stack_param_idx[other] = tmp;
496 * If the stack is decreasing and we do not want to store sequentially,
497 * or someone else allocated the call frame
498 * we allocate as much space on the stack all parameters need, by
499 * moving the stack pointer along the stack's direction.
501 if (stack_dir < 0 && !do_seq && !no_alloc) {
502 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, stack_size);
505 curr_mem = get_Call_mem(irn);
507 obstack_ptr_grow(obst, curr_mem);
510 for (i = 0; i < n_stack_params; ++i) {
511 int p = stack_param_idx[i];
512 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
513 ir_node *param = get_Call_param(irn, p);
514 ir_node *addr = curr_sp;
516 ir_type *param_type = get_method_param_type(call_tp, p);
517 int param_size = get_type_size_bytes(param_type) + arg->space_after;
520 * If we wanted to build the arguments sequentially,
521 * the stack pointer for the next must be incremented,
522 * and the memory value propagated.
526 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, param_size + arg->space_before);
527 add_irn_dep(curr_sp, curr_mem);
530 curr_ofs += arg->space_before;
531 curr_ofs = round_up2(curr_ofs, arg->alignment);
533 /* Make the expression to compute the argument's offset. */
535 ir_mode *constmode = mach_mode;
536 if(mode_is_reference(mach_mode)) {
539 addr = new_r_Const_long(irg, bl, constmode, curr_ofs);
540 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
544 /* Insert a store for primitive arguments. */
545 if (is_atomic_type(param_type)) {
547 ir_node *mem_input = do_seq ? curr_mem : new_NoMem();
548 store = new_r_Store(irg, bl, mem_input, addr, param);
549 mem = new_r_Proj(irg, bl, store, mode_M, pn_Store_M);
552 /* Make a mem copy for compound arguments. */
556 assert(mode_is_reference(get_irn_mode(param)));
557 copy = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type);
558 mem = new_r_Proj(irg, bl, copy, mode_M, pn_CopyB_M_regular);
561 curr_ofs += param_size;
566 obstack_ptr_grow(obst, mem);
569 in = (ir_node **) obstack_finish(obst);
571 /* We need the sync only, if we didn't build the stores sequentially. */
573 if (n_stack_params >= 1) {
574 curr_mem = new_r_Sync(irg, bl, n_stack_params + 1, in);
576 curr_mem = get_Call_mem(irn);
579 obstack_free(obst, in);
582 /* Collect caller save registers */
583 for (i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
585 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
586 for (j = 0; j < cls->n_regs; ++j) {
587 const arch_register_t *reg = arch_register_for_index(cls, j);
588 if (arch_register_type_is(reg, caller_save)) {
589 pset_insert_ptr(caller_save, (void *) reg);
591 if (arch_register_type_is(reg, state)) {
592 pset_insert_ptr(caller_save, (void*) reg);
593 pset_insert_ptr(states, (void*) reg);
598 /* search the greatest result proj number */
600 res_projs = alloca(n_res * sizeof(res_projs[0]));
601 memset(res_projs, 0, n_res * sizeof(res_projs[0]));
603 foreach_out_edge(irn, edge) {
604 const ir_edge_t *res_edge;
605 ir_node *irn = get_edge_src_irn(edge);
607 if(!is_Proj(irn) || get_Proj_proj(irn) != pn_Call_T_result)
610 foreach_out_edge(irn, res_edge) {
612 ir_node *res = get_edge_src_irn(res_edge);
614 assert(is_Proj(res));
616 proj = get_Proj_proj(res);
617 assert(proj < n_res);
618 assert(res_projs[proj] == NULL);
619 res_projs[proj] = res;
625 /** TODO: this is not correct for cases where return values are passed
626 * on the stack, but no known ABI does this currentl...
628 n_reg_results = n_res;
630 /* make the back end call node and set its register requirements. */
631 for (i = 0; i < n_reg_params; ++i) {
632 obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
634 foreach_pset(states, reg) {
635 const arch_register_class_t *cls = arch_register_get_class(reg);
637 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
638 ir_fprintf(stderr, "Adding %+F\n", regnode);
640 ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
641 obstack_ptr_grow(obst, regnode);
643 n_ins = n_reg_params + pset_count(states);
645 in = obstack_finish(obst);
647 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
649 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
651 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
652 n_ins, in, get_Call_type(irn));
653 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
656 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
658 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
659 n_ins, in, get_Call_type(irn));
661 be_Call_set_pop(low_call, call->pop);
662 ARR_APP1(ir_node *, env->calls, low_call);
664 /* create new stack pointer */
665 curr_sp = new_r_Proj(irg, bl, low_call, get_irn_mode(curr_sp),
667 be_set_constr_single_reg(low_call, BE_OUT_POS(pn_be_Call_sp), sp);
668 arch_set_irn_register(arch_env, curr_sp, sp);
669 be_node_set_flags(low_call, BE_OUT_POS(pn_be_Call_sp),
670 arch_irn_flags_ignore | arch_irn_flags_modify_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(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(low_call, be_pos_Call_first_arg + i, arg->reg);
719 /* Set the register constraints of the results. */
720 for (i = 0; i < n_res; ++i) {
721 ir_node *proj = res_projs[i];
722 const be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
723 int pn = get_Proj_proj(proj);
726 be_set_constr_single_reg(low_call, BE_OUT_POS(pn), arg->reg);
727 arch_set_irn_register(arch_env, proj, arg->reg);
729 obstack_free(obst, in);
730 exchange(irn, low_call);
732 /* kill the ProjT node */
733 if (res_proj != NULL) {
734 be_kill_node(res_proj);
737 /* Make additional projs for the caller save registers
738 and the Keep node which keeps them alive. */
739 if (1 || pset_count(caller_save) + n_reg_results > 0) {
740 const arch_register_t *reg;
745 = pn_be_Call_first_res + n_reg_results;
747 /* also keep the stack pointer */
749 set_irn_link(curr_sp, (void*) sp);
750 obstack_ptr_grow(obst, curr_sp);
752 for (reg = pset_first(caller_save); reg; reg = pset_next(caller_save), ++n) {
753 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode,
756 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
757 be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg);
758 arch_set_irn_register(arch_env, proj, reg);
760 /* a call can produce ignore registers, in this case set the flag and register for the Proj */
761 if (arch_register_type_is(reg, ignore)) {
762 be_node_set_flags(low_call, BE_OUT_POS(curr_res_proj),
763 arch_irn_flags_ignore);
766 set_irn_link(proj, (void*) reg);
767 obstack_ptr_grow(obst, proj);
771 for(i = 0; i < n_reg_results; ++i) {
772 ir_node *proj = res_projs[i];
773 const arch_register_t *reg = arch_get_irn_register(arch_env, proj);
774 set_irn_link(proj, (void*) reg);
775 obstack_ptr_grow(obst, proj);
779 /* create the Keep for the caller save registers */
780 in = (ir_node **) obstack_finish(obst);
781 keep = be_new_Keep(NULL, irg, bl, n, in);
782 for (i = 0; i < n; ++i) {
783 const arch_register_t *reg = get_irn_link(in[i]);
784 be_node_set_reg_class(keep, i, reg->reg_class);
786 obstack_free(obst, in);
789 /* Clean up the stack. */
790 assert(stack_size >= call->pop);
791 stack_size -= call->pop;
793 if (stack_size > 0) {
794 ir_node *mem_proj = NULL;
796 foreach_out_edge(low_call, edge) {
797 ir_node *irn = get_edge_src_irn(edge);
798 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
805 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_be_Call_M_regular);
806 keep_alive(mem_proj);
809 /* Clean up the stack frame if we allocated it */
811 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size);
815 be_abi_call_free(call);
816 obstack_free(obst, stack_param_idx);
819 del_pset(caller_save);
825 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
827 * @param alignment the minimum stack alignment
828 * @param size the node containing the non-aligned size
829 * @param irg the irg where new nodes are allocated on
830 * @param irg the block where new nodes are allocated on
831 * @param dbg debug info for new nodes
833 * @return a node representing the aligned size
835 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size,
836 ir_graph *irg, ir_node *block, dbg_info *dbg)
838 if (stack_alignment > 1) {
839 ir_mode *mode = get_irn_mode(size);
840 tarval *tv = new_tarval_from_long(stack_alignment-1, mode);
841 ir_node *mask = new_r_Const(irg, block, mode, tv);
843 size = new_rd_Add(dbg, irg, block, size, mask, mode);
845 tv = new_tarval_from_long(-(long)stack_alignment, mode);
846 mask = new_r_Const(irg, block, mode, tv);
847 size = new_rd_And(dbg, irg, block, size, mask, mode);
853 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
855 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
864 const ir_edge_t *edge;
865 ir_node *new_alloc, *size, *addr, *ins[2];
866 unsigned stack_alignment;
868 if (get_Alloc_where(alloc) != stack_alloc) {
873 block = get_nodes_block(alloc);
874 irg = get_irn_irg(block);
877 type = get_Alloc_type(alloc);
879 foreach_out_edge(alloc, edge) {
880 ir_node *irn = get_edge_src_irn(edge);
882 assert(is_Proj(irn));
883 switch(get_Proj_proj(irn)) {
895 /* Beware: currently Alloc nodes without a result might happen,
896 only escape analysis kills them and this phase runs only for object
897 oriented source. We kill the Alloc here. */
898 if (alloc_res == NULL && alloc_mem) {
899 exchange(alloc_mem, get_Alloc_mem(alloc));
903 dbg = get_irn_dbg_info(alloc);
905 /* we might need to multiply the size with the element size */
906 if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
907 tarval *tv = new_tarval_from_long(get_type_size_bytes(type),
909 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
910 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Alloc_size(alloc),
914 size = get_Alloc_size(alloc);
917 /* The stack pointer will be modified in an unknown manner.
918 We cannot omit it. */
919 env->call->flags.bits.try_omit_fp = 0;
921 /* FIXME: size must be here round up for the stack alignment, but
922 this must be transmitted from the backend. */
924 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
925 new_alloc = be_new_AddSP(env->isa->sp, irg, block, curr_sp, size);
926 set_irn_dbg_info(new_alloc, dbg);
928 if(alloc_mem != NULL) {
932 addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
934 /* We need to sync the output mem of the AddSP with the input mem
935 edge into the alloc node. */
936 ins[0] = get_Alloc_mem(alloc);
938 sync = new_r_Sync(irg, block, 2, ins);
940 exchange(alloc_mem, sync);
943 exchange(alloc, new_alloc);
945 /* fix projnum of alloca res */
946 set_Proj_proj(alloc_res, pn_be_AddSP_res);
949 curr_sp = new_r_Proj(irg, block, new_alloc, get_irn_mode(curr_sp),
957 * The Free is transformed into a back end free node and connected to the stack nodes.
959 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
963 ir_node *subsp, *mem, *res, *size, *sync;
967 unsigned stack_alignment;
970 if (get_Free_where(free) != stack_alloc) {
975 block = get_nodes_block(free);
976 irg = get_irn_irg(block);
977 type = get_Free_type(free);
978 sp_mode = env->isa->sp->reg_class->mode;
979 dbg = get_irn_dbg_info(free);
981 /* we might need to multiply the size with the element size */
982 if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
983 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
984 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
985 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
989 size = get_Free_size(free);
992 /* FIXME: size must be here round up for the stack alignment, but
993 this must be transmitted from the backend. */
995 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
997 /* The stack pointer will be modified in an unknown manner.
998 We cannot omit it. */
999 env->call->flags.bits.try_omit_fp = 0;
1000 subsp = be_new_SubSP(env->isa->sp, irg, block, curr_sp, size);
1001 set_irn_dbg_info(subsp, dbg);
1003 mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
1004 res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_sp);
1006 /* we need to sync the memory */
1007 in[0] = get_Free_mem(free);
1009 sync = new_r_Sync(irg, block, 2, in);
1011 /* and make the AddSP dependent on the former memory */
1012 add_irn_dep(subsp, get_Free_mem(free));
1015 exchange(free, sync);
1021 /* the following function is replaced by the usage of the heights module */
1024 * Walker for dependent_on().
1025 * This function searches a node tgt recursively from a given node
1026 * but is restricted to the given block.
1027 * @return 1 if tgt was reachable from curr, 0 if not.
1029 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl)
1033 if (get_nodes_block(curr) != bl)
1039 /* Phi functions stop the recursion inside a basic block */
1040 if (! is_Phi(curr)) {
1041 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
1042 if (check_dependence(get_irn_n(curr, i), tgt, bl))
1052 * Check if a node is somehow data dependent on another one.
1053 * both nodes must be in the same basic block.
1054 * @param n1 The first node.
1055 * @param n2 The second node.
1056 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1058 static int dependent_on(ir_node *n1, ir_node *n2)
1060 assert(get_nodes_block(n1) == get_nodes_block(n2));
1062 return heights_reachable_in_block(ir_heights, n1, n2);
1065 static int cmp_call_dependency(const void *c1, const void *c2)
1067 ir_node *n1 = *(ir_node **) c1;
1068 ir_node *n2 = *(ir_node **) c2;
1071 Classical qsort() comparison function behavior:
1072 0 if both elements are equal
1073 1 if second is "smaller" that first
1074 -1 if first is "smaller" that second
1076 if (dependent_on(n1, n2))
1079 if (dependent_on(n2, n1))
1086 * Walker: links all Call/alloc/Free nodes to the Block they are contained.
1088 static void link_calls_in_block_walker(ir_node *irn, void *data)
1090 ir_opcode code = get_irn_opcode(irn);
1092 if (code == iro_Call ||
1093 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1094 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1095 be_abi_irg_t *env = data;
1096 ir_node *bl = get_nodes_block(irn);
1097 void *save = get_irn_link(bl);
1099 if (code == iro_Call)
1100 env->call->flags.bits.irg_is_leaf = 0;
1102 set_irn_link(irn, save);
1103 set_irn_link(bl, irn);
1109 * Process all Call nodes inside a basic block.
1110 * Note that the link field of the block must contain a linked list of all
1111 * Call nodes inside the Block. We first order this list according to data dependency
1112 * and that connect the calls together.
1114 static void process_calls_in_block(ir_node *bl, void *data)
1116 be_abi_irg_t *env = data;
1117 ir_node *curr_sp = env->init_sp;
1121 for(irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
1122 obstack_ptr_grow(&env->obst, irn);
1124 /* If there were call nodes in the block. */
1130 nodes = obstack_finish(&env->obst);
1132 /* order the call nodes according to data dependency */
1133 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
1135 for(i = n - 1; i >= 0; --i) {
1136 ir_node *irn = nodes[i];
1138 DBG((env->dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1139 switch(get_irn_opcode(irn)) {
1141 curr_sp = adjust_call(env, irn, curr_sp);
1144 curr_sp = adjust_alloc(env, irn, curr_sp);
1147 curr_sp = adjust_free(env, irn, curr_sp);
1150 panic("invalid call");
1155 obstack_free(&env->obst, nodes);
1157 /* Keep the last stack state in the block by tying it to Keep node,
1158 * the proj from calls is already kept */
1159 if(curr_sp != env->init_sp
1160 && !(is_Proj(curr_sp) && be_is_Call(get_Proj_pred(curr_sp)))) {
1162 keep = be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl),
1164 pmap_insert(env->keep_map, bl, keep);
1168 set_irn_link(bl, curr_sp);
1169 } /* process_calls_in_block */
1172 * Adjust all call nodes in the graph to the ABI conventions.
1174 static void process_calls(be_abi_irg_t *env)
1176 ir_graph *irg = env->birg->irg;
1178 env->call->flags.bits.irg_is_leaf = 1;
1179 irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, env);
1181 ir_heights = heights_new(env->birg->irg);
1182 irg_block_walk_graph(irg, NULL, process_calls_in_block, env);
1183 heights_free(ir_heights);
1187 * Computes the stack argument layout type.
1188 * Changes a possibly allocated value param type by moving
1189 * entities to the stack layout type.
1191 * @param env the ABI environment
1192 * @param call the current call ABI
1193 * @param method_type the method type
1194 * @param param_map an array mapping method arguments to the stack layout type
1196 * @return the stack argument layout type
1198 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type, ir_entity ***param_map)
1200 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1201 int inc = env->birg->main_env->arch_env->isa->stack_dir * dir;
1202 int n = get_method_n_params(method_type);
1203 int curr = inc > 0 ? 0 : n - 1;
1209 ir_type *val_param_tp = get_method_value_param_type(method_type);
1210 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1213 *param_map = map = obstack_alloc(&env->obst, n * sizeof(ir_entity *));
1214 res = new_type_struct(mangle_u(id, new_id_from_chars("arg_type", 8)));
1215 for (i = 0; i < n; ++i, curr += inc) {
1216 ir_type *param_type = get_method_param_type(method_type, curr);
1217 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1220 if (arg->on_stack) {
1222 /* the entity was already created, move it to the param type */
1223 arg->stack_ent = get_method_value_param_ent(method_type, i);
1224 remove_struct_member(val_param_tp, arg->stack_ent);
1225 set_entity_owner(arg->stack_ent, res);
1226 add_struct_member(res, arg->stack_ent);
1227 /* must be automatic to set a fixed layout */
1228 set_entity_allocation(arg->stack_ent, allocation_automatic);
1231 snprintf(buf, sizeof(buf), "param_%d", i);
1232 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1234 ofs += arg->space_before;
1235 ofs = round_up2(ofs, arg->alignment);
1236 set_entity_offset(arg->stack_ent, ofs);
1237 ofs += arg->space_after;
1238 ofs += get_type_size_bytes(param_type);
1239 map[i] = arg->stack_ent;
1242 set_type_size_bytes(res, ofs);
1243 set_type_state(res, layout_fixed);
1248 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
1251 struct obstack obst;
1253 obstack_init(&obst);
1255 /* Create a Perm after the RegParams node to delimit it. */
1256 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1257 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1262 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
1263 const arch_register_t *reg = &cls->regs[j];
1264 ir_node *irn = pmap_get(regs, (void *) reg);
1266 if(irn && !arch_register_type_is(reg, ignore)) {
1268 obstack_ptr_grow(&obst, irn);
1269 set_irn_link(irn, (void *) reg);
1273 obstack_ptr_grow(&obst, NULL);
1274 in = obstack_finish(&obst);
1276 perm = be_new_Perm(cls, irg, bl, n_regs, in);
1277 for(j = 0; j < n_regs; ++j) {
1278 ir_node *arg = in[j];
1279 arch_register_t *reg = get_irn_link(arg);
1280 pmap_insert(regs, reg, arg);
1281 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
1284 obstack_free(&obst, in);
1287 obstack_free(&obst, NULL);
1292 const arch_register_t *reg;
1296 static int cmp_regs(const void *a, const void *b)
1298 const reg_node_map_t *p = a;
1299 const reg_node_map_t *q = b;
1301 if(p->reg->reg_class == q->reg->reg_class)
1302 return p->reg->index - q->reg->index;
1304 return p->reg->reg_class - q->reg->reg_class;
1307 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1310 int n = pmap_count(reg_map);
1312 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1314 foreach_pmap(reg_map, ent) {
1315 res[i].reg = ent->key;
1316 res[i].irn = ent->value;
1320 qsort(res, n, sizeof(res[0]), cmp_regs);
1325 * Creates a barrier.
1327 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1329 ir_graph *irg = env->birg->irg;
1330 int n_regs = pmap_count(regs);
1336 rm = reg_map_to_arr(&env->obst, regs);
1338 for(n = 0; n < n_regs; ++n)
1339 obstack_ptr_grow(&env->obst, rm[n].irn);
1342 obstack_ptr_grow(&env->obst, *mem);
1346 in = (ir_node **) obstack_finish(&env->obst);
1347 irn = be_new_Barrier(irg, bl, n, in);
1348 obstack_free(&env->obst, in);
1350 for(n = 0; n < n_regs; ++n) {
1351 const arch_register_t *reg = rm[n].reg;
1353 int pos = BE_OUT_POS(n);
1356 proj = new_r_Proj(irg, bl, irn, get_irn_mode(rm[n].irn), n);
1357 be_node_set_reg_class(irn, n, reg->reg_class);
1359 be_set_constr_single_reg(irn, n, reg);
1360 be_set_constr_single_reg(irn, pos, reg);
1361 be_node_set_reg_class(irn, pos, reg->reg_class);
1362 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1364 /* if the proj projects a ignore register or a node which is set to ignore, propagate this property. */
1365 if(arch_register_type_is(reg, ignore) || arch_irn_is(env->birg->main_env->arch_env, in[n], ignore))
1366 flags |= arch_irn_flags_ignore;
1368 if(arch_irn_is(env->birg->main_env->arch_env, in[n], modify_sp))
1369 flags |= arch_irn_flags_modify_sp;
1371 be_node_set_flags(irn, pos, flags);
1373 pmap_insert(regs, (void *) reg, proj);
1377 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1380 obstack_free(&env->obst, rm);
1385 * Creates a be_Return for a Return node.
1387 * @param @env the abi environment
1388 * @param irn the Return node or NULL if there was none
1389 * @param bl the block where the be_Retun should be placed
1390 * @param mem the current memory
1391 * @param n_res number of return results
1393 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl,
1394 ir_node *mem, int n_res)
1396 be_abi_call_t *call = env->call;
1397 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1399 pmap *reg_map = pmap_create();
1400 ir_node *keep = pmap_get(env->keep_map, bl);
1407 const arch_register_t **regs;
1411 get the valid stack node in this block.
1412 If we had a call in that block there is a Keep constructed by process_calls()
1413 which points to the last stack modification in that block. we'll use
1414 it then. Else we use the stack from the start block and let
1415 the ssa construction fix the usage.
1417 stack = be_abi_reg_map_get(env->regs, isa->sp);
1419 stack = get_irn_n(keep, 0);
1421 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1424 /* Insert results for Return into the register map. */
1425 for(i = 0; i < n_res; ++i) {
1426 ir_node *res = get_Return_res(irn, i);
1427 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1428 assert(arg->in_reg && "return value must be passed in register");
1429 pmap_insert(reg_map, (void *) arg->reg, res);
1432 /* Add uses of the callee save registers. */
1433 foreach_pmap(env->regs, ent) {
1434 const arch_register_t *reg = ent->key;
1435 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1436 pmap_insert(reg_map, ent->key, ent->value);
1439 be_abi_reg_map_set(reg_map, isa->sp, stack);
1441 /* Make the Epilogue node and call the arch's epilogue maker. */
1442 create_barrier(env, bl, &mem, reg_map, 1);
1443 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1446 Maximum size of the in array for Return nodes is
1447 return args + callee save/ignore registers + memory + stack pointer
1449 in_max = pmap_count(reg_map) + n_res + 2;
1451 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1452 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1455 in[1] = be_abi_reg_map_get(reg_map, isa->sp);
1460 /* clear SP entry, since it has already been grown. */
1461 pmap_insert(reg_map, (void *) isa->sp, NULL);
1462 for(i = 0; i < n_res; ++i) {
1463 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1465 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1466 regs[n++] = arg->reg;
1468 /* Clear the map entry to mark the register as processed. */
1469 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1472 /* grow the rest of the stuff. */
1473 foreach_pmap(reg_map, ent) {
1476 regs[n++] = ent->key;
1480 /* The in array for the new back end return is now ready. */
1482 dbgi = get_irn_dbg_info(irn);
1486 /* we have to pop the shadow parameter in in case of struct returns */
1488 ret = be_new_Return(dbgi, env->birg->irg, bl, n_res, pop, n, in);
1490 /* Set the register classes of the return's parameter accordingly. */
1491 for(i = 0; i < n; ++i)
1493 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1495 /* Free the space of the Epilog's in array and the register <-> proj map. */
1496 obstack_free(&env->obst, in);
1497 pmap_destroy(reg_map);
1502 typedef struct lower_frame_sels_env_t {
1504 ir_entity *value_param_list; /**< the list of all value param entities */
1505 ir_entity *value_param_tail; /**< the tail of the list of all value param entities */
1506 } lower_frame_sels_env_t;
1509 * Walker: Replaces Sels of frame type and
1510 * value param type entities by FrameAddress.
1511 * Links all used entities.
1513 static void lower_frame_sels_walker(ir_node *irn, void *data) {
1514 lower_frame_sels_env_t *ctx = data;
1517 ir_graph *irg = current_ir_graph;
1518 ir_node *frame = get_irg_frame(irg);
1519 ir_node *param_base = get_irg_value_param_base(irg);
1520 ir_node *ptr = get_Sel_ptr(irn);
1522 if (ptr == frame || ptr == param_base) {
1523 be_abi_irg_t *env = ctx->env;
1524 ir_entity *ent = get_Sel_entity(irn);
1525 ir_node *bl = get_nodes_block(irn);
1528 nw = be_new_FrameAddr(env->isa->sp->reg_class, irg, bl, frame, ent);
1531 /* check, if it's a param sel and if have not seen this entity before */
1532 if (ptr == param_base &&
1533 ent != ctx->value_param_tail &&
1534 get_entity_link(ent) == NULL) {
1535 set_entity_link(ent, ctx->value_param_list);
1536 ctx->value_param_list = ent;
1537 if (ctx->value_param_tail == NULL) ctx->value_param_tail = ent;
1544 * Check if a value parameter is transmitted as a register.
1545 * This might happen if the address of an parameter is taken which is
1546 * transmitted in registers.
1548 * Note that on some architectures this case must be handled specially
1549 * because the place of the backing store is determined by their ABI.
1551 * In the default case we move the entity to the frame type and create
1552 * a backing store into the first block.
1554 static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_entity *value_param_list) {
1555 be_abi_call_t *call = env->call;
1556 ir_graph *irg = env->birg->irg;
1557 ir_entity *ent, *next_ent, *new_list;
1559 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1562 for (ent = value_param_list; ent; ent = next_ent) {
1563 int i = get_struct_member_index(get_entity_owner(ent), ent);
1564 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1566 next_ent = get_entity_link(ent);
1568 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", i));
1569 set_entity_link(ent, new_list);
1574 /* ok, change the graph */
1575 ir_node *start_bl = get_irg_start_block(irg);
1576 ir_node *first_bl = NULL;
1577 ir_node *frame, *imem, *nmem, *store, *mem, *args, *args_bl;
1578 const ir_edge_t *edge;
1579 optimization_state_t state;
1582 foreach_block_succ(start_bl, edge) {
1583 ir_node *succ = get_edge_src_irn(edge);
1584 if (start_bl != succ) {
1590 /* we had already removed critical edges, so the following
1591 assertion should be always true. */
1592 assert(get_Block_n_cfgpreds(first_bl) == 1);
1594 /* now create backing stores */
1595 frame = get_irg_frame(irg);
1596 imem = get_irg_initial_mem(irg);
1598 save_optimization_state(&state);
1600 nmem = new_r_Proj(irg, first_bl, get_irg_start(irg), mode_M, pn_Start_M);
1601 restore_optimization_state(&state);
1603 /* reroute all edges to the new memory source */
1604 edges_reroute(imem, nmem, irg);
1608 args = get_irg_args(irg);
1609 args_bl = get_nodes_block(args);
1610 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1611 int i = get_struct_member_index(get_entity_owner(ent), ent);
1612 ir_type *tp = get_entity_type(ent);
1613 ir_mode *mode = get_type_mode(tp);
1616 /* address for the backing store */
1617 addr = be_new_FrameAddr(env->isa->sp->reg_class, irg, first_bl, frame, ent);
1620 mem = new_r_Proj(irg, first_bl, store, mode_M, pn_Store_M);
1622 /* the backing store itself */
1623 store = new_r_Store(irg, first_bl, mem, addr,
1624 new_r_Proj(irg, args_bl, args, mode, i));
1626 /* the new memory Proj gets the last Proj from store */
1627 set_Proj_pred(nmem, store);
1628 set_Proj_proj(nmem, pn_Store_M);
1630 /* move all entities to the frame type */
1631 frame_tp = get_irg_frame_type(irg);
1632 offset = get_type_size_bytes(frame_tp);
1634 /* we will add new entities: set the layout to undefined */
1635 assert(get_type_state(frame_tp) == layout_fixed);
1636 set_type_state(frame_tp, layout_undefined);
1637 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1638 ir_type *tp = get_entity_type(ent);
1639 unsigned align = get_type_alignment_bytes(tp);
1641 offset += align - 1;
1642 offset &= ~(align - 1);
1643 set_entity_owner(ent, frame_tp);
1644 add_class_member(frame_tp, ent);
1645 /* must be automatic to set a fixed layout */
1646 set_entity_allocation(ent, allocation_automatic);
1647 set_entity_offset(ent, offset);
1648 offset += get_type_size_bytes(tp);
1650 set_type_size_bytes(frame_tp, offset);
1651 /* fix the layout again */
1652 set_type_state(frame_tp, layout_fixed);
1658 * The start block has no jump, instead it has an initial exec Proj.
1659 * The backend wants to handle all blocks the same way, so we replace
1660 * the out cfg edge with a real jump.
1662 static void fix_start_block(ir_node *block, void *env) {
1665 ir_node *start_block;
1668 /* we processed the start block, return */
1672 irg = get_irn_irg(block);
1673 start_block = get_irg_start_block(irg);
1675 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1676 ir_node *pred = get_Block_cfgpred(block, i);
1677 ir_node *pred_block = get_nodes_block(pred);
1679 /* ok, we are in the block, having start as cfg predecessor */
1680 if (pred_block == start_block) {
1681 ir_node *jump = new_r_Jmp(irg, pred_block);
1682 set_Block_cfgpred(block, i, jump);
1690 * Modify the irg itself and the frame type.
1692 static void modify_irg(be_abi_irg_t *env)
1694 be_abi_call_t *call = env->call;
1695 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1696 const arch_register_t *sp = arch_isa_sp(isa);
1697 ir_graph *irg = env->birg->irg;
1698 ir_node *bl = get_irg_start_block(irg);
1699 ir_node *end = get_irg_end_block(irg);
1700 ir_node *old_mem = get_irg_initial_mem(irg);
1701 ir_node *new_mem_proj;
1703 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1704 pset *dont_save = pset_new_ptr(8);
1711 const arch_register_t *fp_reg;
1712 ir_node *frame_pointer;
1713 ir_node *reg_params_bl;
1716 ir_node *value_param_base;
1717 const ir_edge_t *edge;
1718 ir_type *arg_type, *bet_type, *tp;
1719 lower_frame_sels_env_t ctx;
1720 ir_entity **param_map;
1722 bitset_t *used_proj_nr;
1723 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1725 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1727 /* set the links of all frame entities to NULL, we use it
1728 to detect if an entity is already linked in the value_param_list */
1729 tp = get_method_value_param_type(method_type);
1731 for (i = get_struct_n_members(tp) - 1; i >= 0; --i)
1732 set_entity_link(get_struct_member(tp, i), NULL);
1735 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1737 ctx.value_param_list = NULL;
1738 ctx.value_param_tail = NULL;
1739 irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
1741 /* value_param_base anchor is not needed anymore now */
1742 value_param_base = get_irg_value_param_base(irg);
1743 be_kill_node(value_param_base);
1744 set_irg_value_param_base(irg, new_r_Bad(irg));
1746 env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0]));
1747 env->regs = pmap_create();
1749 used_proj_nr = bitset_alloca(1024);
1750 n_params = get_method_n_params(method_type);
1751 args = obstack_alloc(&env->obst, n_params * sizeof(args[0]));
1752 memset(args, 0, n_params * sizeof(args[0]));
1754 /* Check if a value parameter is transmitted as a register.
1755 * This might happen if the address of an parameter is taken which is
1756 * transmitted in registers.
1758 * Note that on some architectures this case must be handled specially
1759 * because the place of the backing store is determined by their ABI.
1761 * In the default case we move the entity to the frame type and create
1762 * a backing store into the first block.
1764 fix_address_of_parameter_access(env, ctx.value_param_list);
1766 /* Fill the argument vector */
1767 arg_tuple = get_irg_args(irg);
1768 foreach_out_edge(arg_tuple, edge) {
1769 ir_node *irn = get_edge_src_irn(edge);
1770 if (! is_Anchor(irn)) {
1771 int nr = get_Proj_proj(irn);
1773 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1777 arg_type = compute_arg_type(env, call, method_type, ¶m_map);
1778 bet_type = call->cb->get_between_type(env->cb);
1779 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), isa->stack_dir, param_map);
1781 /* Count the register params and add them to the number of Projs for the RegParams node */
1782 for(i = 0; i < n_params; ++i) {
1783 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1784 if(arg->in_reg && args[i]) {
1785 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1786 assert(i == get_Proj_proj(args[i]));
1788 /* For now, associate the register with the old Proj from Start representing that argument. */
1789 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1790 bitset_set(used_proj_nr, i);
1791 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1795 /* Collect all callee-save registers */
1796 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1797 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1798 for(j = 0; j < cls->n_regs; ++j) {
1799 const arch_register_t *reg = &cls->regs[j];
1800 if(arch_register_type_is(reg, callee_save) ||
1801 arch_register_type_is(reg, state)) {
1802 pmap_insert(env->regs, (void *) reg, NULL);
1807 pmap_insert(env->regs, (void *) sp, NULL);
1808 pmap_insert(env->regs, (void *) isa->bp, NULL);
1809 reg_params_bl = get_irg_start_block(irg);
1810 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1811 add_irn_dep(env->reg_params, get_irg_start(irg));
1814 * make proj nodes for the callee save registers.
1815 * memorize them, since Return nodes get those as inputs.
1817 * Note, that if a register corresponds to an argument, the regs map contains
1818 * the old Proj from start for that argument.
1821 rm = reg_map_to_arr(&env->obst, env->regs);
1822 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1823 arch_register_t *reg = (void *) rm[i].reg;
1824 ir_mode *mode = reg->reg_class->mode;
1826 int pos = BE_OUT_POS((int) nr);
1832 bitset_set(used_proj_nr, nr);
1833 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1834 pmap_insert(env->regs, (void *) reg, proj);
1835 be_set_constr_single_reg(env->reg_params, pos, reg);
1836 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1839 * If the register is an ignore register,
1840 * The Proj for that register shall also be ignored during register allocation.
1842 if(arch_register_type_is(reg, ignore))
1843 flags |= arch_irn_flags_ignore;
1846 flags |= arch_irn_flags_modify_sp;
1848 be_node_set_flags(env->reg_params, pos, flags);
1850 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1852 obstack_free(&env->obst, rm);
1854 /* create a new initial memory proj */
1855 assert(is_Proj(old_mem));
1856 new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
1857 new_r_Unknown(irg, mode_T), mode_M,
1858 get_Proj_proj(old_mem));
1861 /* Generate the Prologue */
1862 fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
1864 /* do the stack allocation BEFORE the barrier, or spill code
1865 might be added before it */
1866 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1867 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND);
1868 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1870 create_barrier(env, bl, &mem, env->regs, 0);
1872 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1873 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1875 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1876 set_irg_frame(irg, frame_pointer);
1877 pset_insert_ptr(env->ignore_regs, fp_reg);
1879 /* rewire old mem users to new mem */
1880 set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
1881 exchange(old_mem, mem);
1883 set_irg_initial_mem(irg, mem);
1885 /* Now, introduce stack param nodes for all parameters passed on the stack */
1886 for(i = 0; i < n_params; ++i) {
1887 ir_node *arg_proj = args[i];
1888 ir_node *repl = NULL;
1890 if(arg_proj != NULL) {
1891 be_abi_call_arg_t *arg;
1892 ir_type *param_type;
1893 int nr = get_Proj_proj(arg_proj);
1896 nr = MIN(nr, n_params);
1897 arg = get_call_arg(call, 0, nr);
1898 param_type = get_method_param_type(method_type, nr);
1901 repl = pmap_get(env->regs, (void *) arg->reg);
1902 } else if(arg->on_stack) {
1903 ir_node *addr = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1905 /* For atomic parameters which are actually used, we create a Load node. */
1906 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1907 ir_mode *mode = get_type_mode(param_type);
1908 ir_mode *load_mode = arg->load_mode;
1910 ir_node *load = new_r_Load(irg, reg_params_bl, new_NoMem(), addr, load_mode);
1911 set_irn_pinned(load, op_pin_state_floats);
1912 repl = new_r_Proj(irg, reg_params_bl, load, load_mode, pn_Load_res);
1914 if (mode != load_mode) {
1915 repl = new_r_Conv(irg, reg_params_bl, repl, mode);
1918 /* The stack parameter is not primitive (it is a struct or array),
1919 * we thus will create a node representing the parameter's address
1925 assert(repl != NULL);
1927 /* Beware: the mode of the register parameters is always the mode of the register class
1928 which may be wrong. Add Conv's then. */
1929 mode = get_irn_mode(args[i]);
1930 if (mode != get_irn_mode(repl)) {
1931 repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
1933 exchange(args[i], repl);
1937 /* the arg proj is not needed anymore now and should be only used by the anchor */
1938 assert(get_irn_n_edges(arg_tuple) == 1);
1939 be_kill_node(arg_tuple);
1940 set_irg_args(irg, new_rd_Bad(irg));
1942 /* All Return nodes hang on the End node, so look for them there. */
1943 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1944 ir_node *irn = get_Block_cfgpred(end, i);
1946 if (is_Return(irn)) {
1947 ir_node *blk = get_nodes_block(irn);
1948 ir_node *mem = get_Return_mem(irn);
1949 ir_node *ret = create_be_return(env, irn, blk, mem, get_Return_n_ress(irn));
1953 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
1954 the code is dead and will never be executed. */
1956 del_pset(dont_save);
1957 obstack_free(&env->obst, args);
1959 /* handle start block here (place a jump in the block) */
1961 irg_block_walk_graph(irg, fix_start_block, NULL, &i);
1964 /** Fix the state inputs of calls that still hang on unknowns */
1966 void fix_call_state_inputs(be_abi_irg_t *env)
1968 const arch_isa_t *isa = env->isa;
1970 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
1972 /* Collect caller save registers */
1973 n = arch_isa_get_n_reg_class(isa);
1974 for(i = 0; i < n; ++i) {
1976 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1977 for(j = 0; j < cls->n_regs; ++j) {
1978 const arch_register_t *reg = arch_register_for_index(cls, j);
1979 if(arch_register_type_is(reg, state)) {
1980 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
1985 n = ARR_LEN(env->calls);
1986 n_states = ARR_LEN(stateregs);
1987 for(i = 0; i < n; ++i) {
1989 ir_node *call = env->calls[i];
1991 arity = get_irn_arity(call);
1993 /* the statereg inputs are the last n inputs of the calls */
1994 for(s = 0; s < n_states; ++s) {
1995 int inp = arity - n_states + s;
1996 const arch_register_t *reg = stateregs[s];
1997 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
1999 set_irn_n(call, inp, regnode);
2004 static ir_entity *create_trampoline(be_main_env_t *be, ir_entity *method)
2006 ir_type *type = get_entity_type(method);
2007 ident *old_id = get_entity_ld_ident(method);
2008 ident *id = mangle3("L", old_id, "$stub");
2009 ir_type *parent = be->pic_trampolines_type;
2010 ir_entity *ent = new_entity(parent, old_id, type);
2011 set_entity_ld_ident(ent, id);
2012 set_entity_visibility(ent, visibility_local);
2013 set_entity_variability(ent, variability_uninitialized);
2018 static int can_address_relative(ir_entity *entity)
2020 return get_entity_variability(entity) == variability_initialized
2021 || get_entity_visibility(entity) == visibility_local;
2024 /** patches SymConsts to work in position independent code */
2025 static void fix_pic_symconsts(ir_node *node, void *data)
2035 be_abi_irg_t *env = data;
2037 be_main_env_t *be = env->birg->main_env;
2039 arity = get_irn_arity(node);
2040 for (i = 0; i < arity; ++i) {
2041 ir_node *pred = get_irn_n(node, i);
2043 if (!is_SymConst(pred))
2046 entity = get_SymConst_entity(pred);
2047 block = get_nodes_block(pred);
2048 irg = get_irn_irg(pred);
2050 /* calls can jump to relative addresses, so we can directly jump to
2051 the (relatively) known call address or the trampoline */
2052 if (is_Call(node) && i == 1) {
2053 if(can_address_relative(entity))
2056 dbg_info *dbgi = get_irn_dbg_info(pred);
2057 ir_entity *trampoline = create_trampoline(be, entity);
2058 ir_node *trampoline_const
2059 = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code, trampoline,
2061 set_irn_n(node, i, trampoline_const);
2065 /* everything else is accessed relative to EIP */
2066 mode = get_irn_mode(pred);
2067 unknown = new_r_Unknown(irg, mode);
2068 pic_base = arch_code_generator_get_pic_base(env->birg->cg);
2069 add = new_r_Add(irg, block, pic_base, pred, mode);
2071 /* make sure the walker doesn't visit this add again */
2072 mark_irn_visited(add);
2074 /* all ok now for locally constructed stuff */
2075 if (can_address_relative(entity)) {
2076 set_irn_n(node, i, add);
2080 /* we need an extra indirection for global data outside our current
2081 module. The loads are always safe and can therefore float
2082 and need no memory input */
2083 load = new_r_Load(irg, block, new_NoMem(), add, mode);
2084 load_res = new_r_Proj(irg, block, load, mode, pn_Load_res);
2085 set_irn_pinned(load, op_pin_state_floats);
2087 set_irn_n(node, i, load_res);
2091 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2093 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
2094 ir_node *old_frame = get_irg_frame(birg->irg);
2095 ir_graph *irg = birg->irg;
2099 optimization_state_t state;
2100 unsigned *limited_bitset;
2102 be_omit_fp = birg->main_env->options->omit_fp;
2103 be_pic = birg->main_env->options->pic;
2105 obstack_init(&env->obst);
2107 env->isa = birg->main_env->arch_env->isa;
2108 env->method_type = get_entity_type(get_irg_entity(irg));
2109 env->call = be_abi_call_new(env->isa->sp->reg_class);
2110 arch_isa_get_call_abi(env->isa, env->method_type, env->call);
2112 env->ignore_regs = pset_new_ptr_default();
2113 env->keep_map = pmap_create();
2114 env->dce_survivor = new_survive_dce();
2117 env->sp_req.type = arch_register_req_type_limited;
2118 env->sp_req.cls = arch_register_get_class(env->isa->sp);
2119 limited_bitset = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
2120 rbitset_set(limited_bitset, arch_register_get_index(env->isa->sp));
2121 env->sp_req.limited = limited_bitset;
2123 env->sp_cls_req.type = arch_register_req_type_normal;
2124 env->sp_cls_req.cls = arch_register_get_class(env->isa->sp);
2126 /* Beware: later we replace this node by the real one, ensure it is not CSE'd
2127 to another Unknown or the stack pointer gets used */
2128 save_optimization_state(&state);
2130 env->init_sp = dummy = new_r_Unknown(irg, env->isa->sp->reg_class->mode);
2131 restore_optimization_state(&state);
2132 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
2134 env->calls = NEW_ARR_F(ir_node*, 0);
2137 irg_walk_graph(irg, fix_pic_symconsts, NULL, env);
2140 /* Lower all call nodes in the IRG. */
2144 Beware: init backend abi call object after processing calls,
2145 otherwise some information might be not yet available.
2147 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2149 /* Process the IRG */
2152 /* fix call inputs for state registers */
2153 fix_call_state_inputs(env);
2155 /* We don't need the keep map anymore. */
2156 pmap_destroy(env->keep_map);
2157 env->keep_map = NULL;
2159 /* calls array is not needed anymore */
2160 DEL_ARR_F(env->calls);
2163 /* reroute the stack origin of the calls to the true stack origin. */
2164 exchange(dummy, env->init_sp);
2165 exchange(old_frame, get_irg_frame(irg));
2167 /* Make some important node pointers survive the dead node elimination. */
2168 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2169 foreach_pmap(env->regs, ent) {
2170 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2173 env->call->cb->done(env->cb);
2178 void be_abi_free(be_abi_irg_t *env)
2180 be_abi_call_free(env->call);
2181 free_survive_dce(env->dce_survivor);
2182 del_pset(env->ignore_regs);
2183 pmap_destroy(env->regs);
2184 obstack_free(&env->obst, NULL);
2188 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2190 arch_register_t *reg;
2192 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2193 if(reg->reg_class == cls)
2194 bitset_set(bs, reg->index);
2197 /* Returns the stack layout from a abi environment. */
2198 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi) {
2205 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2206 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2207 | _| | |> < ___) | || (_| | (__| <
2208 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2212 typedef ir_node **node_array;
2214 typedef struct fix_stack_walker_env_t {
2215 node_array sp_nodes;
2216 const arch_env_t *arch_env;
2217 } fix_stack_walker_env_t;
2220 * Walker. Collect all stack modifying nodes.
2222 static void collect_stack_nodes_walker(ir_node *node, void *data)
2224 fix_stack_walker_env_t *env = data;
2226 if (arch_irn_is(env->arch_env, node, modify_sp)) {
2227 assert(get_irn_mode(node) != mode_M && get_irn_mode(node) != mode_T);
2228 ARR_APP1(ir_node*, env->sp_nodes, node);
2232 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2234 be_ssa_construction_env_t senv;
2237 be_irg_t *birg = env->birg;
2238 be_lv_t *lv = be_get_birg_liveness(birg);
2239 fix_stack_walker_env_t walker_env;
2242 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2243 walker_env.arch_env = birg->main_env->arch_env;
2244 isa = walker_env.arch_env->isa;
2246 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2248 /* nothing to be done if we didn't find any node, in fact we mustn't
2249 * continue, as for endless loops incsp might have had no users and is bad
2252 len = ARR_LEN(walker_env.sp_nodes);
2254 DEL_ARR_F(walker_env.sp_nodes);
2258 be_ssa_construction_init(&senv, birg);
2259 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2260 ARR_LEN(walker_env.sp_nodes));
2261 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2262 ARR_LEN(walker_env.sp_nodes));
2265 len = ARR_LEN(walker_env.sp_nodes);
2266 for(i = 0; i < len; ++i) {
2267 be_liveness_update(lv, walker_env.sp_nodes[i]);
2269 be_ssa_construction_update_liveness_phis(&senv, lv);
2272 phis = be_ssa_construction_get_new_phis(&senv);
2274 /* set register requirements for stack phis */
2275 len = ARR_LEN(phis);
2276 for(i = 0; i < len; ++i) {
2277 ir_node *phi = phis[i];
2278 be_set_phi_reg_req(walker_env.arch_env, phi, &env->sp_req);
2279 be_set_phi_flags(walker_env.arch_env, phi, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
2280 arch_set_irn_register(walker_env.arch_env, phi, env->isa->sp);
2282 be_ssa_construction_destroy(&senv);
2284 DEL_ARR_F(walker_env.sp_nodes);
2287 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
2289 const arch_env_t *arch_env = env->birg->main_env->arch_env;
2290 int omit_fp = env->call->flags.bits.try_omit_fp;
2293 sched_foreach(bl, irn) {
2297 Check, if the node relates to an entity on the stack frame.
2298 If so, set the true offset (including the bias) for that
2301 ir_entity *ent = arch_get_frame_entity(arch_env, irn);
2303 int offset = get_stack_entity_offset(env->frame, ent, bias);
2304 arch_set_frame_offset(arch_env, irn, offset);
2305 DBG((env->dbg, LEVEL_2, "%F has offset %d (including bias %d)\n", ent, offset, bias));
2308 if(omit_fp || be_is_IncSP(irn)) {
2310 * If the node modifies the stack pointer by a constant offset,
2311 * record that in the bias.
2313 ofs = arch_get_sp_bias(arch_env, irn);
2315 if(be_is_IncSP(irn)) {
2316 if(ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2317 ofs = (int)get_type_size_bytes(get_irg_frame_type(env->birg->irg));
2318 be_set_IncSP_offset(irn, ofs);
2319 } else if(ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2320 ofs = - (int)get_type_size_bytes(get_irg_frame_type(env->birg->irg));
2321 be_set_IncSP_offset(irn, ofs);
2334 * A helper struct for the bias walker.
2337 be_abi_irg_t *env; /**< The ABI irg environment. */
2338 int start_block_bias; /**< The bias at the end of the start block. */
2339 ir_node *start_block; /**< The start block of the current graph. */
2343 * Block-Walker: fix all stack offsets
2345 static void stack_bias_walker(ir_node *bl, void *data)
2347 struct bias_walk *bw = data;
2348 if (bl != bw->start_block) {
2349 process_stack_bias(bw->env, bl, bw->start_block_bias);
2353 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2355 ir_graph *irg = env->birg->irg;
2356 struct bias_walk bw;
2358 stack_frame_compute_initial_offset(env->frame);
2359 // stack_layout_dump(stdout, env->frame);
2361 /* Determine the stack bias at the end of the start block. */
2362 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0);
2364 /* fix the bias is all other blocks */
2366 bw.start_block = get_irg_start_block(irg);
2367 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2370 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2372 assert(arch_register_type_is(reg, callee_save));
2373 assert(pmap_contains(abi->regs, (void *) reg));
2374 return pmap_get(abi->regs, (void *) reg);
2377 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2379 assert(arch_register_type_is(reg, ignore));
2380 assert(pmap_contains(abi->regs, (void *) reg));
2381 return pmap_get(abi->regs, (void *) reg);
2385 * Returns non-zero if the ABI has omitted the frame pointer in
2386 * the current graph.
2388 int be_abi_omit_fp(const be_abi_irg_t *abi) {
2389 return abi->call->flags.bits.try_omit_fp;