2 * Copyright (C) 1995-2007 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;
67 unsigned alignment; /**< stack alignment */
68 unsigned space_before; /**< allocate space before */
69 unsigned space_after; /**< allocate space after */
72 struct _be_abi_call_t {
73 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_stack_layout_t *frame; /**< The stack frame model. */
83 be_irg_t *birg; /**< The back end IRG. */
84 const arch_isa_t *isa; /**< The isa. */
85 survive_dce_t *dce_survivor;
87 be_abi_call_t *call; /**< The ABI call information. */
88 ir_type *method_type; /**< The type of the method of the IRG. */
90 ir_node *init_sp; /**< The node representing the stack pointer
91 at the start of the function. */
93 ir_node *start_barrier; /**< The barrier of the start block */
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;
120 _ ____ ___ ____ _ _ _ _
121 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
122 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
123 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
124 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
126 These callbacks are used by the backend to set the parameters
127 for a specific call type.
131 * Set compare function: compares two ABI call object arguments.
133 static int cmp_call_arg(const void *a, const void *b, size_t n)
135 const be_abi_call_arg_t *p = a, *q = b;
137 return !(p->is_res == q->is_res && p->pos == q->pos);
141 * Get or set an ABI call object argument.
143 * @param call the abi call
144 * @param is_res true for call results, false for call arguments
145 * @param pos position of the argument
146 * @param do_insert true if the argument is set, false if it's retrieved
148 static be_abi_call_arg_t *get_or_set_call_arg(be_abi_call_t *call, int is_res, int pos, int do_insert)
150 be_abi_call_arg_t arg;
153 memset(&arg, 0, sizeof(arg));
157 hash = is_res * 128 + pos;
160 ? set_insert(call->params, &arg, sizeof(arg), hash)
161 : set_find(call->params, &arg, sizeof(arg), hash);
165 * Retrieve an ABI call object argument.
167 * @param call the ABI call object
168 * @param is_res true for call results, false for call arguments
169 * @param pos position of the argument
171 static INLINE be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
173 return get_or_set_call_arg(call, is_res, pos, 0);
176 /* Set the flags for a call. */
177 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
184 /* Set register class for call address */
185 void be_abi_call_set_call_address_reg_class(be_abi_call_t *call, const arch_register_class_t *cls)
187 call->cls_addr = cls;
191 void be_abi_call_param_stack(be_abi_call_t *call, int arg_pos, unsigned alignment, unsigned space_before, unsigned space_after)
193 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
195 arg->alignment = alignment;
196 arg->space_before = space_before;
197 arg->space_after = space_after;
198 assert(alignment > 0 && "Alignment must be greater than 0");
201 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
203 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
208 void be_abi_call_res_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, 1, arg_pos, 1);
215 /* Get the flags of a ABI call object. */
216 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
222 * Constructor for a new ABI call object.
224 * @return the new ABI call object
226 static be_abi_call_t *be_abi_call_new(const arch_register_class_t *cls_addr)
228 be_abi_call_t *call = xmalloc(sizeof(call[0]));
231 call->params = new_set(cmp_call_arg, 16);
233 call->cls_addr = cls_addr;
235 call->flags.bits.try_omit_fp = be_omit_fp;
241 * Destructor for an ABI call object.
243 static void be_abi_call_free(be_abi_call_t *call)
245 del_set(call->params);
251 | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _
252 | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` |
253 | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| |
254 |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, |
257 Handling of the stack frame. It is composed of three types:
258 1) The type of the arguments which are pushed on the stack.
259 2) The "between type" which consists of stuff the call of the
260 function pushes on the stack (like the return address and
261 the old base pointer for ia32).
262 3) The Firm frame type which consists of all local variables
266 static int get_stack_entity_offset(be_stack_layout_t *frame, ir_entity *ent, int bias)
268 ir_type *t = get_entity_owner(ent);
269 int ofs = get_entity_offset(ent);
273 /* Find the type the entity is contained in. */
274 for(index = 0; index < N_FRAME_TYPES; ++index) {
275 if(frame->order[index] == t)
279 /* Add the size of all the types below the one of the entity to the entity's offset */
280 for(i = 0; i < index; ++i)
281 ofs += get_type_size_bytes(frame->order[i]);
283 /* correct the offset by the initial position of the frame pointer */
284 ofs -= frame->initial_offset;
286 /* correct the offset with the current bias. */
293 * Retrieve the entity with given offset from a frame type.
295 static ir_entity *search_ent_with_offset(ir_type *t, int offset)
299 for(i = 0, n = get_compound_n_members(t); i < n; ++i) {
300 ir_entity *ent = get_compound_member(t, i);
301 if(get_entity_offset(ent) == offset)
308 static int stack_frame_compute_initial_offset(be_stack_layout_t *frame)
310 ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
311 ir_entity *ent = search_ent_with_offset(base, 0);
313 frame->initial_offset = ent ? get_stack_entity_offset(frame, ent, 0) : 0;
315 return frame->initial_offset;
319 * Initializes the frame layout from parts
321 * @param frame the stack layout that will be initialized
322 * @param args the stack argument layout type
323 * @param between the between layout type
324 * @param locals the method frame type
325 * @param stack_dir the stack direction
326 * @param param_map an array mapping method argument positions to the stack argument type
328 * @return the initialized stack layout
330 static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *args,
331 ir_type *between, ir_type *locals, int stack_dir,
332 ir_entity *param_map[])
334 frame->arg_type = args;
335 frame->between_type = between;
336 frame->frame_type = locals;
337 frame->initial_offset = 0;
338 frame->stack_dir = stack_dir;
339 frame->order[1] = between;
340 frame->param_map = param_map;
343 frame->order[0] = args;
344 frame->order[2] = locals;
347 frame->order[0] = locals;
348 frame->order[2] = args;
354 /** Dumps the stack layout to file. */
355 static void stack_layout_dump(FILE *file, be_stack_layout_t *frame)
359 ir_fprintf(file, "initial offset: %d\n", frame->initial_offset);
360 for (j = 0; j < N_FRAME_TYPES; ++j) {
361 ir_type *t = frame->order[j];
363 ir_fprintf(file, "type %d: %F size: %d\n", j, t, get_type_size_bytes(t));
364 for (i = 0, n = get_compound_n_members(t); i < n; ++i) {
365 ir_entity *ent = get_compound_member(t, i);
366 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));
373 * Returns non-zero if the call argument at given position
374 * is transfered on the stack.
376 static INLINE int is_on_stack(be_abi_call_t *call, int pos)
378 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
379 return arg && !arg->in_reg;
389 Adjustment of the calls inside a graph.
394 * Transform a call node into a be_Call node.
396 * @param env The ABI environment for the current irg.
397 * @param irn The call node.
398 * @param curr_sp The stack pointer node to use.
399 * @return The stack pointer after the call.
401 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp, ir_node *alloca_copy)
403 ir_graph *irg = env->birg->irg;
404 const arch_env_t *arch_env = env->birg->main_env->arch_env;
405 const arch_isa_t *isa = arch_env->isa;
406 ir_type *mt = get_Call_type(irn);
407 ir_node *call_ptr = get_Call_ptr(irn);
408 int n_params = get_method_n_params(mt);
409 ir_node *curr_mem = get_Call_mem(irn);
410 ir_node *bl = get_nodes_block(irn);
411 pset *results = pset_new_ptr(8);
412 pset *caller_save = pset_new_ptr(8);
413 pset *states = pset_new_ptr(2);
415 int stack_dir = arch_isa_stack_dir(isa);
416 const arch_register_t *sp = arch_isa_sp(isa);
417 be_abi_call_t *call = be_abi_call_new(sp->reg_class);
418 ir_mode *mach_mode = sp->reg_class->mode;
419 struct obstack *obst = &env->obst;
420 int no_alloc = call->flags.bits.frame_is_setup_on_call;
422 ir_node *res_proj = NULL;
423 int curr_res_proj = pn_Call_max;
424 int n_reg_params = 0;
425 int n_stack_params = 0;
431 const arch_register_t *reg;
432 const ir_edge_t *edge;
434 int *stack_param_idx;
437 /* Let the isa fill out the abi description for that call node. */
438 arch_isa_get_call_abi(isa, mt, call);
440 /* Insert code to put the stack arguments on the stack. */
441 assert(get_Call_n_params(irn) == n_params);
442 for (i = 0; i < n_params; ++i) {
443 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
446 int arg_size = get_type_size_bytes(get_method_param_type(mt, i));
448 stack_size += round_up2(arg->space_before, arg->alignment);
449 stack_size += round_up2(arg_size, arg->alignment);
450 stack_size += round_up2(arg->space_after, arg->alignment);
451 obstack_int_grow(obst, i);
455 stack_param_idx = obstack_finish(obst);
457 /* Collect all arguments which are passed in registers. */
458 for (i = 0; i < n_params; ++i) {
459 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
460 if (arg && arg->in_reg) {
461 obstack_int_grow(obst, i);
465 reg_param_idxs = obstack_finish(obst);
467 /* If there are some parameters which shall be passed on the stack. */
468 if (n_stack_params > 0) {
470 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
473 * Reverse list of stack parameters if call arguments are from left to right.
474 * We must them reverse again if they are pushed (not stored) and the stack
475 * direction is downwards.
477 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
478 for (i = 0; i < n_stack_params >> 1; ++i) {
479 int other = n_stack_params - i - 1;
480 int tmp = stack_param_idx[i];
481 stack_param_idx[i] = stack_param_idx[other];
482 stack_param_idx[other] = tmp;
487 * If the stack is decreasing and we do not want to store sequentially,
488 * or someone else allocated the call frame
489 * we allocate as much space on the stack all parameters need, by
490 * moving the stack pointer along the stack's direction.
492 if (stack_dir < 0 && !do_seq && !no_alloc) {
493 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, stack_size);
495 add_irn_dep(curr_sp, alloca_copy);
501 obstack_ptr_grow(obst, get_Call_mem(irn));
502 curr_mem = new_NoMem();
504 curr_mem = get_Call_mem(irn);
507 for (i = 0; i < n_stack_params; ++i) {
508 int p = stack_param_idx[i];
509 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
510 ir_node *param = get_Call_param(irn, p);
511 ir_node *addr = curr_sp;
513 ir_type *param_type = get_method_param_type(mt, p);
514 int param_size = get_type_size_bytes(param_type) + arg->space_after;
517 * If we wanted to build the arguments sequentially,
518 * the stack pointer for the next must be incremented,
519 * and the memory value propagated.
523 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, param_size + arg->space_before);
525 add_irn_dep(curr_sp, alloca_copy);
528 add_irn_dep(curr_sp, curr_mem);
531 curr_ofs += arg->space_before;
532 curr_ofs = round_up2(curr_ofs, arg->alignment);
534 /* Make the expression to compute the argument's offset. */
536 ir_mode *constmode = mach_mode;
537 if(mode_is_reference(mach_mode)) {
540 addr = new_r_Const_long(irg, bl, constmode, curr_ofs);
541 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
545 /* Insert a store for primitive arguments. */
546 if (is_atomic_type(param_type)) {
548 store = new_r_Store(irg, bl, curr_mem, 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 /* TODO: what if the result is NOT used? Currently there is
601 * no way to detect this later, especially there is no way to
602 * see this in the proj numbers.
603 * While this is ok for the register allocator, it is bad for
604 * backends which need to change the be_Call further (x87 simulator
605 * for instance. However for this particular case the call_type is
608 foreach_out_edge(irn, edge) {
609 const ir_edge_t *res_edge;
610 ir_node *irn = get_edge_src_irn(edge);
612 if (is_Proj(irn) && get_Proj_proj(irn) == pn_Call_T_result) {
614 foreach_out_edge(irn, res_edge) {
616 be_abi_call_arg_t *arg;
617 ir_node *res = get_edge_src_irn(res_edge);
619 assert(is_Proj(res));
621 proj = get_Proj_proj(res);
622 arg = get_call_arg(call, 1, proj);
625 shift the proj number to the right, since we will drop the
626 unspeakable Proj_T from the Call. Therefore, all real argument
627 Proj numbers must be increased by pn_be_Call_first_res
629 proj += pn_be_Call_first_res;
630 set_Proj_proj(res, proj);
631 obstack_ptr_grow(obst, res);
633 if (proj > curr_res_proj)
634 curr_res_proj = proj;
636 pset_remove_ptr(caller_save, arg->reg);
637 //pmap_insert(arg_regs, arg->reg, INT_TO_PTR(proj + 1))
644 obstack_ptr_grow(obst, NULL);
645 res_projs = obstack_finish(obst);
647 /* make the back end call node and set its register requirements. */
648 for (i = 0; i < n_reg_params; ++i) {
649 obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
651 foreach_pset(states, reg) {
652 const arch_register_class_t *cls = arch_register_get_class(reg);
654 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
655 ir_fprintf(stderr, "Adding %+F\n", regnode);
657 ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
658 obstack_ptr_grow(obst, regnode);
660 n_ins = n_reg_params + pset_count(states);
662 in = obstack_finish(obst);
664 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
666 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
668 curr_res_proj + pset_count(caller_save), n_ins,
669 in, get_Call_type(irn));
670 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
673 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
675 curr_res_proj + pset_count(caller_save),
676 n_ins, in, get_Call_type(irn));
678 ARR_APP1(ir_node *, env->calls, low_call);
681 Set the register class of the call address to
682 the backend provided class (default: stack pointer class)
684 be_node_set_reg_class(low_call, be_pos_Call_ptr, call->cls_addr);
686 DBG((env->dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
688 /* Set the register classes and constraints of the Call parameters. */
689 for (i = 0; i < n_reg_params; ++i) {
690 int index = reg_param_idxs[i];
691 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
692 assert(arg->reg != NULL);
694 be_set_constr_single_reg(low_call, be_pos_Call_first_arg + i, arg->reg);
697 /* Set the register constraints of the results. */
698 for (i = 0; res_projs[i]; ++i) {
699 int pn = get_Proj_proj(res_projs[i]);
701 /* Correct Proj number since it has been adjusted! (see above) */
702 const be_abi_call_arg_t *arg = get_call_arg(call, 1, pn - pn_Call_max);
704 /* Matze: we need the information about the real mode for later
705 * transforms (signed/unsigend compares, stores...), so leave the fixup
706 * for the backend transform phase... */
709 const arch_register_class_t *cls = arch_register_get_class(arg->reg);
710 ir_mode *mode = arch_register_class_mode(cls);
711 set_irn_mode(irn, mode);
715 be_set_constr_single_reg(low_call, BE_OUT_POS(pn), arg->reg);
716 arch_set_irn_register(arch_env, res_projs[i], arg->reg);
718 obstack_free(obst, in);
719 exchange(irn, low_call);
721 /* redirect the result projs to the lowered call instead of the Proj_T */
722 for (i = 0; res_projs[i]; ++i)
723 set_Proj_pred(res_projs[i], low_call);
725 /* set the now unnecessary projT to bad */
726 if (res_proj != NULL) {
727 be_kill_node(res_proj);
730 /* Make additional projs for the caller save registers
731 and the Keep node which keeps them alive. */
732 if (pset_count(caller_save) > 0) {
733 const arch_register_t *reg;
737 for (reg = pset_first(caller_save), n = 0; reg; reg = pset_next(caller_save), ++n) {
738 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode, curr_res_proj);
740 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
741 be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg);
743 /* a call can produce ignore registers, in this case set the flag and register for the Proj */
744 if (arch_register_type_is(reg, ignore)) {
745 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
746 be_node_set_flags(low_call, BE_OUT_POS(curr_res_proj), arch_irn_flags_ignore);
749 set_irn_link(proj, (void *) reg);
750 obstack_ptr_grow(obst, proj);
754 /* create the Keep for the caller save registers */
755 in = (ir_node **) obstack_finish(obst);
756 keep = be_new_Keep(NULL, irg, bl, n, in);
757 for (i = 0; i < n; ++i) {
758 const arch_register_t *reg = get_irn_link(in[i]);
759 be_node_set_reg_class(keep, i, reg->reg_class);
761 obstack_free(obst, in);
764 /* Clean up the stack. */
765 if (stack_size > 0) {
766 ir_node *mem_proj = NULL;
768 foreach_out_edge(low_call, edge) {
769 ir_node *irn = get_edge_src_irn(edge);
770 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
777 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_Call_M);
778 keep_alive(mem_proj);
781 /* Clean up the stack frame if we allocated it */
783 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size);
784 add_irn_dep(curr_sp, mem_proj);
786 add_irn_dep(curr_sp, alloca_copy);
792 be_abi_call_free(call);
793 obstack_free(obst, stack_param_idx);
796 del_pset(caller_save);
802 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
804 * @param alignment the minimum stack alignment
805 * @param size the node containing the non-aligned size
806 * @param irg the irg where new nodes are allocated on
807 * @param irg the block where new nodes are allocated on
808 * @param dbg debug info for new nodes
810 * @return a node representing the aligned size
812 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size,
813 ir_graph *irg, ir_node *block, dbg_info *dbg)
815 if (stack_alignment > 1) {
816 ir_mode *mode = get_irn_mode(size);
817 tarval *tv = new_tarval_from_long(stack_alignment-1, mode);
818 ir_node *mask = new_r_Const(irg, block, mode, tv);
820 size = new_rd_Add(dbg, irg, block, size, mask, mode);
822 tv = new_tarval_from_long(-(long)stack_alignment, mode);
823 mask = new_r_Const(irg, block, mode, tv);
824 size = new_rd_And(dbg, irg, block, size, mask, mode);
830 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
832 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp, ir_node **result_copy)
841 const ir_edge_t *edge;
842 ir_node *new_alloc, *size, *addr, *copy, *ins[2];
843 unsigned stack_alignment;
845 if (get_Alloc_where(alloc) != stack_alloc) {
850 block = get_nodes_block(alloc);
851 irg = get_irn_irg(block);
854 type = get_Alloc_type(alloc);
856 foreach_out_edge(alloc, edge) {
857 ir_node *irn = get_edge_src_irn(edge);
859 assert(is_Proj(irn));
860 switch(get_Proj_proj(irn)) {
872 /* Beware: currently Alloc nodes without a result might happen,
873 only escape analysis kills them and this phase runs only for object
874 oriented source. We kill the Alloc here. */
875 if (alloc_res == NULL && alloc_mem) {
876 exchange(alloc_mem, get_Alloc_mem(alloc));
880 dbg = get_irn_dbg_info(alloc);
882 /* we might need to multiply the size with the element size */
883 if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
884 tarval *tv = new_tarval_from_long(get_type_size_bytes(type),
886 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
887 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Alloc_size(alloc),
891 size = get_Alloc_size(alloc);
894 /* The stack pointer will be modified in an unknown manner.
895 We cannot omit it. */
896 env->call->flags.bits.try_omit_fp = 0;
898 /* FIXME: size must be here round up for the stack alignment, but
899 this must be transmitted from the backend. */
901 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
902 new_alloc = be_new_AddSP(env->isa->sp, irg, block, curr_sp, size);
903 set_irn_dbg_info(new_alloc, dbg);
905 if(alloc_mem != NULL) {
909 addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
911 /* We need to sync the output mem of the AddSP with the input mem
912 edge into the alloc node. */
913 ins[0] = get_Alloc_mem(alloc);
915 sync = new_r_Sync(irg, block, 2, ins);
917 exchange(alloc_mem, sync);
920 exchange(alloc, new_alloc);
922 /* fix projnum of alloca res */
923 set_Proj_proj(alloc_res, pn_be_AddSP_res);
926 curr_sp = new_r_Proj(irg, block, new_alloc, get_irn_mode(curr_sp),
930 /* copy the address away, since it could be used after further stack pointer modifications. */
931 /* Let it point curr_sp just for the moment, I'll reroute it in a second. */
932 *result_copy = copy = be_new_Copy(env->isa->sp->reg_class, irg, block, curr_sp);
933 set_irn_mode(copy, mode_P);
936 /* Let all users of the Alloc() result now point to the copy. */
937 edges_reroute(alloc_res, addr, irg);
939 /* Rewire the copy appropriately. */
940 set_irn_n(copy, be_pos_Copy_op, addr);
950 * The Free is transformed into a back end free node and connected to the stack nodes.
952 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
956 ir_node *subsp, *mem, *res, *size, *sync;
960 unsigned stack_alignment;
963 if (get_Free_where(free) != stack_alloc) {
968 block = get_nodes_block(free);
969 irg = get_irn_irg(block);
970 type = get_Free_type(free);
971 sp_mode = env->isa->sp->reg_class->mode;
972 dbg = get_irn_dbg_info(free);
974 /* we might need to multiply the size with the element size */
975 if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
976 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
977 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
978 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
982 size = get_Free_size(free);
985 /* FIXME: size must be here round up for the stack alignment, but
986 this must be transmitted from the backend. */
988 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
990 /* The stack pointer will be modified in an unknown manner.
991 We cannot omit it. */
992 env->call->flags.bits.try_omit_fp = 0;
993 subsp = be_new_SubSP(env->isa->sp, irg, block, curr_sp, size);
994 set_irn_dbg_info(subsp, dbg);
996 mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
997 res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_sp);
999 /* we need to sync the memory */
1000 in[0] = get_Free_mem(free);
1002 sync = new_r_Sync(irg, block, 2, in);
1004 /* and make the AddSP dependent on the former memory */
1005 add_irn_dep(subsp, get_Free_mem(free));
1008 exchange(free, sync);
1014 /* the following function is replaced by the usage of the heights module */
1017 * Walker for dependent_on().
1018 * This function searches a node tgt recursively from a given node
1019 * but is restricted to the given block.
1020 * @return 1 if tgt was reachable from curr, 0 if not.
1022 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl)
1026 if (get_nodes_block(curr) != bl)
1032 /* Phi functions stop the recursion inside a basic block */
1033 if (! is_Phi(curr)) {
1034 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
1035 if (check_dependence(get_irn_n(curr, i), tgt, bl))
1045 * Check if a node is somehow data dependent on another one.
1046 * both nodes must be in the same basic block.
1047 * @param n1 The first node.
1048 * @param n2 The second node.
1049 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1051 static int dependent_on(ir_node *n1, ir_node *n2)
1053 assert(get_nodes_block(n1) == get_nodes_block(n2));
1055 return heights_reachable_in_block(ir_heights, n1, n2);
1058 static int cmp_call_dependency(const void *c1, const void *c2)
1060 ir_node *n1 = *(ir_node **) c1;
1061 ir_node *n2 = *(ir_node **) c2;
1064 Classical qsort() comparison function behavior:
1065 0 if both elements are equal
1066 1 if second is "smaller" that first
1067 -1 if first is "smaller" that second
1069 if (dependent_on(n1, n2))
1072 if (dependent_on(n2, n1))
1079 * Walker: links all Call/alloc/Free nodes to the Block they are contained.
1081 static void link_calls_in_block_walker(ir_node *irn, void *data)
1083 ir_opcode code = get_irn_opcode(irn);
1085 if (code == iro_Call ||
1086 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1087 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1088 be_abi_irg_t *env = data;
1089 ir_node *bl = get_nodes_block(irn);
1090 void *save = get_irn_link(bl);
1092 if (code == iro_Call)
1093 env->call->flags.bits.irg_is_leaf = 0;
1095 set_irn_link(irn, save);
1096 set_irn_link(bl, irn);
1102 * Process all Call nodes inside a basic block.
1103 * Note that the link field of the block must contain a linked list of all
1104 * Call nodes inside the Block. We first order this list according to data dependency
1105 * and that connect the calls together.
1107 static void process_calls_in_block(ir_node *bl, void *data)
1109 be_abi_irg_t *env = data;
1110 ir_node *curr_sp = env->init_sp;
1114 for(irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
1115 obstack_ptr_grow(&env->obst, irn);
1117 /* If there were call nodes in the block. */
1121 ir_node *copy = NULL;
1124 nodes = obstack_finish(&env->obst);
1126 /* order the call nodes according to data dependency */
1127 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
1129 for(i = n - 1; i >= 0; --i) {
1130 ir_node *irn = nodes[i];
1132 DBG((env->dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1133 switch(get_irn_opcode(irn)) {
1135 curr_sp = adjust_call(env, irn, curr_sp, copy);
1138 curr_sp = adjust_alloc(env, irn, curr_sp, ©);
1141 curr_sp = adjust_free(env, irn, curr_sp);
1144 panic("invalid call");
1149 obstack_free(&env->obst, nodes);
1151 /* Keep the last stack state in the block by tying it to Keep node */
1152 if(curr_sp != env->init_sp) {
1154 keep = be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl),
1156 pmap_insert(env->keep_map, bl, keep);
1160 set_irn_link(bl, curr_sp);
1161 } /* process_calls_in_block */
1164 * Adjust all call nodes in the graph to the ABI conventions.
1166 static void process_calls(be_abi_irg_t *env)
1168 ir_graph *irg = env->birg->irg;
1170 env->call->flags.bits.irg_is_leaf = 1;
1171 irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, env);
1173 ir_heights = heights_new(env->birg->irg);
1174 irg_block_walk_graph(irg, NULL, process_calls_in_block, env);
1175 heights_free(ir_heights);
1179 static ir_node *setup_frame(be_abi_irg_t *env)
1181 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1182 const arch_register_t *sp = isa->sp;
1183 const arch_register_t *bp = isa->bp;
1184 be_abi_call_flags_bits_t flags = env->call->flags.bits;
1185 ir_graph *irg = env->birg->irg;
1186 ir_node *bl = get_irg_start_block(irg);
1187 ir_node *no_mem = get_irg_no_mem(irg);
1188 ir_node *old_frame = get_irg_frame(irg);
1189 ir_node *stack = pmap_get(env->regs, (void *) sp);
1190 ir_node *frame = pmap_get(env->regs, (void *) bp);
1192 int stack_nr = get_Proj_proj(stack);
1194 if(flags.try_omit_fp) {
1195 stack = be_new_IncSP(sp, irg, bl, stack, no_mem, BE_STACK_FRAME_SIZE_EXPAND);
1200 frame = be_new_Copy(bp->reg_class, irg, bl, stack);
1202 be_node_set_flags(frame, -1, arch_irn_flags_dont_spill);
1203 if(!flags.fp_free) {
1204 be_set_constr_single_reg(frame, -1, bp);
1205 be_node_set_flags(frame, -1, arch_irn_flags_ignore);
1206 arch_set_irn_register(env->birg->main_env->arch_env, frame, bp);
1209 stack = be_new_IncSP(sp, irg, bl, stack, frame, BE_STACK_FRAME_SIZE_EXPAND);
1212 be_node_set_flags(env->reg_params, -(stack_nr + 1), arch_irn_flags_ignore);
1213 env->init_sp = stack;
1214 set_irg_frame(irg, frame);
1215 edges_reroute(old_frame, frame, irg);
1220 static void clearup_frame(be_abi_irg_t *env, ir_node *ret, pmap *reg_map, struct obstack *obst)
1222 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1223 const arch_register_t *sp = isa->sp;
1224 const arch_register_t *bp = isa->bp;
1225 ir_graph *irg = env->birg->irg;
1226 ir_node *ret_mem = get_Return_mem(ret);
1227 ir_node *frame = get_irg_frame(irg);
1228 ir_node *bl = get_nodes_block(ret);
1229 ir_node *stack = get_irn_link(bl);
1233 if(env->call->flags.bits.try_omit_fp) {
1234 stack = be_new_IncSP(sp, irg, bl, stack, ret_mem, -BE_STACK_FRAME_SIZE_SHRINK);
1238 stack = be_new_SetSP(sp, irg, bl, stack, frame, ret_mem);
1239 be_set_constr_single_reg(stack, -1, sp);
1240 be_node_set_flags(stack, -1, arch_irn_flags_ignore);
1243 pmap_foreach(env->regs, ent) {
1244 const arch_register_t *reg = ent->key;
1245 ir_node *irn = ent->value;
1248 obstack_ptr_grow(&env->obst, stack);
1250 obstack_ptr_grow(&env->obst, frame);
1251 else if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1252 obstack_ptr_grow(obst, irn);
1259 * Computes the stack argument layout type.
1260 * Changes a possibly allocated value param type by moving
1261 * entities to the stack layout type.
1263 * @param env the ABI environment
1264 * @param call the current call ABI
1265 * @param method_type the method type
1266 * @param param_map an array mapping method arguments to the stack layout type
1268 * @return the stack argument layout type
1270 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type, ir_entity ***param_map)
1272 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1273 int inc = env->birg->main_env->arch_env->isa->stack_dir * dir;
1274 int n = get_method_n_params(method_type);
1275 int curr = inc > 0 ? 0 : n - 1;
1281 ir_type *val_param_tp = get_method_value_param_type(method_type);
1282 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1285 *param_map = map = obstack_alloc(&env->obst, n * sizeof(ir_entity *));
1286 res = new_type_struct(mangle_u(id, new_id_from_chars("arg_type", 8)));
1287 for (i = 0; i < n; ++i, curr += inc) {
1288 ir_type *param_type = get_method_param_type(method_type, curr);
1289 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1292 if (arg->on_stack) {
1294 /* the entity was already created, move it to the param type */
1295 arg->stack_ent = get_method_value_param_ent(method_type, i);
1296 remove_struct_member(val_param_tp, arg->stack_ent);
1297 set_entity_owner(arg->stack_ent, res);
1298 add_struct_member(res, arg->stack_ent);
1299 /* must be automatic to set a fixed layout */
1300 set_entity_allocation(arg->stack_ent, allocation_automatic);
1303 snprintf(buf, sizeof(buf), "param_%d", i);
1304 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1306 ofs += arg->space_before;
1307 ofs = round_up2(ofs, arg->alignment);
1308 set_entity_offset(arg->stack_ent, ofs);
1309 ofs += arg->space_after;
1310 ofs += get_type_size_bytes(param_type);
1311 map[i] = arg->stack_ent;
1314 set_type_size_bytes(res, ofs);
1315 set_type_state(res, layout_fixed);
1320 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
1323 struct obstack obst;
1325 obstack_init(&obst);
1327 /* Create a Perm after the RegParams node to delimit it. */
1328 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1329 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1334 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
1335 const arch_register_t *reg = &cls->regs[j];
1336 ir_node *irn = pmap_get(regs, (void *) reg);
1338 if(irn && !arch_register_type_is(reg, ignore)) {
1340 obstack_ptr_grow(&obst, irn);
1341 set_irn_link(irn, (void *) reg);
1345 obstack_ptr_grow(&obst, NULL);
1346 in = obstack_finish(&obst);
1348 perm = be_new_Perm(cls, irg, bl, n_regs, in);
1349 for(j = 0; j < n_regs; ++j) {
1350 ir_node *arg = in[j];
1351 arch_register_t *reg = get_irn_link(arg);
1352 pmap_insert(regs, reg, arg);
1353 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
1356 obstack_free(&obst, in);
1359 obstack_free(&obst, NULL);
1364 const arch_register_t *reg;
1368 static int cmp_regs(const void *a, const void *b)
1370 const reg_node_map_t *p = a;
1371 const reg_node_map_t *q = b;
1373 if(p->reg->reg_class == q->reg->reg_class)
1374 return p->reg->index - q->reg->index;
1376 return p->reg->reg_class - q->reg->reg_class;
1379 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1382 int n = pmap_count(reg_map);
1384 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1386 pmap_foreach(reg_map, ent) {
1387 res[i].reg = ent->key;
1388 res[i].irn = ent->value;
1392 qsort(res, n, sizeof(res[0]), cmp_regs);
1397 * Creates a barrier.
1399 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1401 ir_graph *irg = env->birg->irg;
1402 int n_regs = pmap_count(regs);
1408 rm = reg_map_to_arr(&env->obst, regs);
1410 for(n = 0; n < n_regs; ++n)
1411 obstack_ptr_grow(&env->obst, rm[n].irn);
1414 obstack_ptr_grow(&env->obst, *mem);
1418 in = (ir_node **) obstack_finish(&env->obst);
1419 irn = be_new_Barrier(irg, bl, n, in);
1420 obstack_free(&env->obst, in);
1422 for(n = 0; n < n_regs; ++n) {
1423 const arch_register_t *reg = rm[n].reg;
1425 int pos = BE_OUT_POS(n);
1428 proj = new_r_Proj(irg, bl, irn, get_irn_mode(rm[n].irn), n);
1429 be_node_set_reg_class(irn, n, reg->reg_class);
1431 be_set_constr_single_reg(irn, n, reg);
1432 be_set_constr_single_reg(irn, pos, reg);
1433 be_node_set_reg_class(irn, pos, reg->reg_class);
1434 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1436 /* if the proj projects a ignore register or a node which is set to ignore, propagate this property. */
1437 if(arch_register_type_is(reg, ignore) || arch_irn_is(env->birg->main_env->arch_env, in[n], ignore))
1438 flags |= arch_irn_flags_ignore;
1440 if(arch_irn_is(env->birg->main_env->arch_env, in[n], modify_sp))
1441 flags |= arch_irn_flags_modify_sp;
1443 be_node_set_flags(irn, pos, flags);
1445 pmap_insert(regs, (void *) reg, proj);
1449 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1452 obstack_free(&env->obst, rm);
1457 * Creates a be_Return for a Return node.
1459 * @param @env the abi environment
1460 * @param irn the Return node or NULL if there was none
1461 * @param bl the block where the be_Retun should be placed
1462 * @param mem the current memory
1463 * @param n_res number of return results
1465 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, ir_node *mem, int n_res) {
1466 be_abi_call_t *call = env->call;
1467 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1469 pmap *reg_map = pmap_create();
1470 ir_node *keep = pmap_get(env->keep_map, bl);
1476 const arch_register_t **regs;
1480 get the valid stack node in this block.
1481 If we had a call in that block there is a Keep constructed by process_calls()
1482 which points to the last stack modification in that block. we'll use
1483 it then. Else we use the stack from the start block and let
1484 the ssa construction fix the usage.
1486 stack = be_abi_reg_map_get(env->regs, isa->sp);
1488 stack = get_irn_n(keep, 0);
1490 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1493 /* Insert results for Return into the register map. */
1494 for(i = 0; i < n_res; ++i) {
1495 ir_node *res = get_Return_res(irn, i);
1496 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1497 assert(arg->in_reg && "return value must be passed in register");
1498 pmap_insert(reg_map, (void *) arg->reg, res);
1501 /* Add uses of the callee save registers. */
1502 pmap_foreach(env->regs, ent) {
1503 const arch_register_t *reg = ent->key;
1504 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1505 pmap_insert(reg_map, ent->key, ent->value);
1508 be_abi_reg_map_set(reg_map, isa->sp, stack);
1510 /* Make the Epilogue node and call the arch's epilogue maker. */
1511 create_barrier(env, bl, &mem, reg_map, 1);
1512 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1515 Maximum size of the in array for Return nodes is
1516 return args + callee save/ignore registers + memory + stack pointer
1518 in_max = pmap_count(reg_map) + n_res + 2;
1520 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1521 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1524 in[1] = be_abi_reg_map_get(reg_map, isa->sp);
1529 /* clear SP entry, since it has already been grown. */
1530 pmap_insert(reg_map, (void *) isa->sp, NULL);
1531 for(i = 0; i < n_res; ++i) {
1532 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1534 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1535 regs[n++] = arg->reg;
1537 /* Clear the map entry to mark the register as processed. */
1538 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1541 /* grow the rest of the stuff. */
1542 pmap_foreach(reg_map, ent) {
1545 regs[n++] = ent->key;
1549 /* The in array for the new back end return is now ready. */
1550 ret = be_new_Return(irn ? get_irn_dbg_info(irn) : NULL, env->birg->irg, bl, n_res, n, in);
1552 /* Set the register classes of the return's parameter accordingly. */
1553 for(i = 0; i < n; ++i)
1555 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1557 /* Free the space of the Epilog's in array and the register <-> proj map. */
1558 obstack_free(&env->obst, in);
1559 pmap_destroy(reg_map);
1564 typedef struct lower_frame_sels_env_t {
1566 ir_entity *value_param_list; /**< the list of all value param entities */
1567 ir_entity *value_param_tail; /**< the tail of the list of all value param entities */
1568 } lower_frame_sels_env_t;
1571 * Walker: Replaces Sels of frame type and
1572 * value param type entities by FrameAddress.
1573 * Links all used entities.
1575 static void lower_frame_sels_walker(ir_node *irn, void *data) {
1576 lower_frame_sels_env_t *ctx = data;
1579 ir_graph *irg = current_ir_graph;
1580 ir_node *frame = get_irg_frame(irg);
1581 ir_node *param_base = get_irg_value_param_base(irg);
1582 ir_node *ptr = get_Sel_ptr(irn);
1584 if (ptr == frame || ptr == param_base) {
1585 be_abi_irg_t *env = ctx->env;
1586 ir_entity *ent = get_Sel_entity(irn);
1587 ir_node *bl = get_nodes_block(irn);
1590 nw = be_new_FrameAddr(env->isa->sp->reg_class, irg, bl, frame, ent);
1593 /* check, if it's a param sel and if have not seen this entity before */
1594 if (ptr == param_base &&
1595 ent != ctx->value_param_tail &&
1596 get_entity_link(ent) == NULL) {
1597 set_entity_link(ent, ctx->value_param_list);
1598 ctx->value_param_list = ent;
1599 if (ctx->value_param_tail == NULL) ctx->value_param_tail = ent;
1606 * Check if a value parameter is transmitted as a register.
1607 * This might happen if the address of an parameter is taken which is
1608 * transmitted in registers.
1610 * Note that on some architectures this case must be handled specially
1611 * because the place of the backing store is determined by their ABI.
1613 * In the default case we move the entity to the frame type and create
1614 * a backing store into the first block.
1616 static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_entity *value_param_list) {
1617 be_abi_call_t *call = env->call;
1618 ir_graph *irg = env->birg->irg;
1619 ir_entity *ent, *next_ent, *new_list;
1621 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1624 for (ent = value_param_list; ent; ent = next_ent) {
1625 int i = get_struct_member_index(get_entity_owner(ent), ent);
1626 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1628 next_ent = get_entity_link(ent);
1630 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", i));
1631 set_entity_link(ent, new_list);
1636 /* ok, change the graph */
1637 ir_node *start_bl = get_irg_start_block(irg);
1638 ir_node *first_bl = NULL;
1639 ir_node *frame, *imem, *nmem, *store, *mem, *args, *args_bl;
1640 const ir_edge_t *edge;
1641 optimization_state_t state;
1644 foreach_block_succ(start_bl, edge) {
1645 ir_node *succ = get_edge_src_irn(edge);
1646 if (start_bl != succ) {
1652 /* we had already removed critical edges, so the following
1653 assertion should be always true. */
1654 assert(get_Block_n_cfgpreds(first_bl) == 1);
1656 /* now create backing stores */
1657 frame = get_irg_frame(irg);
1658 imem = get_irg_initial_mem(irg);
1660 save_optimization_state(&state);
1662 nmem = new_r_Proj(irg, first_bl, get_irg_start(irg), mode_M, pn_Start_M);
1663 restore_optimization_state(&state);
1665 /* reroute all edges to the new memory source */
1666 edges_reroute(imem, nmem, irg);
1670 args = get_irg_args(irg);
1671 args_bl = get_nodes_block(args);
1672 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1673 int i = get_struct_member_index(get_entity_owner(ent), ent);
1674 ir_type *tp = get_entity_type(ent);
1675 ir_mode *mode = get_type_mode(tp);
1678 /* address for the backing store */
1679 addr = be_new_FrameAddr(env->isa->sp->reg_class, irg, first_bl, frame, ent);
1682 mem = new_r_Proj(irg, first_bl, store, mode_M, pn_Store_M);
1684 /* the backing store itself */
1685 store = new_r_Store(irg, first_bl, mem, addr,
1686 new_r_Proj(irg, args_bl, args, mode, i));
1688 /* the new memory Proj gets the last Proj from store */
1689 set_Proj_pred(nmem, store);
1690 set_Proj_proj(nmem, pn_Store_M);
1692 /* move all entities to the frame type */
1693 frame_tp = get_irg_frame_type(irg);
1694 offset = get_type_size_bytes(frame_tp);
1695 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1696 ir_type *tp = get_entity_type(ent);
1697 int align = get_type_alignment_bytes(tp);
1699 offset += align - 1;
1701 set_entity_owner(ent, frame_tp);
1702 add_class_member(frame_tp, ent);
1703 /* must be automatic to set a fixed layout */
1704 set_entity_allocation(ent, allocation_automatic);
1705 set_entity_offset(ent, offset);
1706 offset += get_type_size_bytes(tp);
1708 set_type_size_bytes(frame_tp, offset);
1713 * The start block has no jump, instead it has an initial exec Proj.
1714 * The backend wants to handle all blocks the same way, so we replace
1715 * the out cfg edge with a real jump.
1717 static void fix_start_block(ir_node *block, void *env) {
1720 ir_node *start_block;
1723 /* we processed the start block, return */
1727 irg = get_irn_irg(block);
1728 start_block = get_irg_start_block(irg);
1730 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1731 ir_node *pred = get_Block_cfgpred(block, i);
1732 ir_node *pred_block = get_nodes_block(pred);
1734 /* ok, we are in the block, having start as cfg predecessor */
1735 if (pred_block == start_block) {
1736 ir_node *jump = new_r_Jmp(irg, pred_block);
1737 set_Block_cfgpred(block, i, jump);
1744 * Modify the irg itself and the frame type.
1746 static void modify_irg(be_abi_irg_t *env)
1748 be_abi_call_t *call = env->call;
1749 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1750 const arch_register_t *sp = arch_isa_sp(isa);
1751 ir_graph *irg = env->birg->irg;
1752 ir_node *bl = get_irg_start_block(irg);
1753 ir_node *end = get_irg_end_block(irg);
1754 ir_node *old_mem = get_irg_initial_mem(irg);
1755 ir_node *new_mem_proj;
1757 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1758 pset *dont_save = pset_new_ptr(8);
1764 const arch_register_t *fp_reg;
1765 ir_node *frame_pointer;
1767 ir_node *reg_params_bl;
1770 ir_node *value_param_base;
1771 const ir_edge_t *edge;
1772 ir_type *arg_type, *bet_type, *tp;
1773 lower_frame_sels_env_t ctx;
1774 ir_entity **param_map;
1776 bitset_t *used_proj_nr;
1777 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1779 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1781 /* set the links of all frame entities to NULL, we use it
1782 to detect if an entity is already linked in the value_param_list */
1783 tp = get_method_value_param_type(method_type);
1785 for (i = get_struct_n_members(tp) - 1; i >= 0; --i)
1786 set_entity_link(get_struct_member(tp, i), NULL);
1789 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1791 ctx.value_param_list = NULL;
1792 ctx.value_param_tail = NULL;
1793 irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
1795 /* value_param_base anchor is not needed anymore now */
1796 value_param_base = get_irg_value_param_base(irg);
1797 be_kill_node(value_param_base);
1798 set_irg_value_param_base(irg, new_r_Bad(irg));
1800 env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0]));
1801 env->regs = pmap_create();
1803 used_proj_nr = bitset_alloca(1024);
1804 n_params = get_method_n_params(method_type);
1805 args = obstack_alloc(&env->obst, n_params * sizeof(args[0]));
1806 memset(args, 0, n_params * sizeof(args[0]));
1808 /* Check if a value parameter is transmitted as a register.
1809 * This might happen if the address of an parameter is taken which is
1810 * transmitted in registers.
1812 * Note that on some architectures this case must be handled specially
1813 * because the place of the backing store is determined by their ABI.
1815 * In the default case we move the entity to the frame type and create
1816 * a backing store into the first block.
1818 fix_address_of_parameter_access(env, ctx.value_param_list);
1820 /* Fill the argument vector */
1821 arg_tuple = get_irg_args(irg);
1822 foreach_out_edge(arg_tuple, edge) {
1823 ir_node *irn = get_edge_src_irn(edge);
1824 if (! is_Anchor(irn)) {
1825 int nr = get_Proj_proj(irn);
1827 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1831 arg_type = compute_arg_type(env, call, method_type, ¶m_map);
1832 bet_type = call->cb->get_between_type(env->cb);
1833 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), isa->stack_dir, param_map);
1835 /* Count the register params and add them to the number of Projs for the RegParams node */
1836 for(i = 0; i < n_params; ++i) {
1837 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1838 if(arg->in_reg && args[i]) {
1839 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1840 assert(i == get_Proj_proj(args[i]));
1842 /* For now, associate the register with the old Proj from Start representing that argument. */
1843 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1844 bitset_set(used_proj_nr, i);
1845 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1849 /* Collect all callee-save registers */
1850 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1851 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1852 for(j = 0; j < cls->n_regs; ++j) {
1853 const arch_register_t *reg = &cls->regs[j];
1854 if(arch_register_type_is(reg, callee_save) ||
1855 arch_register_type_is(reg, state)) {
1856 pmap_insert(env->regs, (void *) reg, NULL);
1861 pmap_insert(env->regs, (void *) sp, NULL);
1862 pmap_insert(env->regs, (void *) isa->bp, NULL);
1863 reg_params_bl = get_irg_start_block(irg);
1864 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1865 add_irn_dep(env->reg_params, get_irg_start(irg));
1868 * make proj nodes for the callee save registers.
1869 * memorize them, since Return nodes get those as inputs.
1871 * Note, that if a register corresponds to an argument, the regs map contains
1872 * the old Proj from start for that argument.
1875 rm = reg_map_to_arr(&env->obst, env->regs);
1876 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1877 arch_register_t *reg = (void *) rm[i].reg;
1878 ir_mode *mode = reg->reg_class->mode;
1880 int pos = BE_OUT_POS((int) nr);
1886 bitset_set(used_proj_nr, nr);
1887 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1888 pmap_insert(env->regs, (void *) reg, proj);
1889 be_set_constr_single_reg(env->reg_params, pos, reg);
1890 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1893 * If the register is an ignore register,
1894 * The Proj for that register shall also be ignored during register allocation.
1896 if(arch_register_type_is(reg, ignore))
1897 flags |= arch_irn_flags_ignore;
1900 flags |= arch_irn_flags_modify_sp;
1902 be_node_set_flags(env->reg_params, pos, flags);
1904 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1906 obstack_free(&env->obst, rm);
1908 /* create a new initial memory proj */
1909 assert(is_Proj(old_mem));
1910 new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
1911 new_r_Unknown(irg, mode_T), mode_M,
1912 get_Proj_proj(old_mem));
1915 /* Generate the Prologue */
1916 fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
1918 /* do the stack allocation BEFORE the barrier, or spill code
1919 might be added before it */
1920 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1921 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND);
1922 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1924 env->start_barrier = barrier = create_barrier(env, bl, &mem, env->regs, 0);
1926 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1927 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1929 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1930 set_irg_frame(irg, frame_pointer);
1931 pset_insert_ptr(env->ignore_regs, fp_reg);
1933 /* rewire old mem users to new mem */
1934 set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
1935 exchange(old_mem, mem);
1937 set_irg_initial_mem(irg, mem);
1939 /* Now, introduce stack param nodes for all parameters passed on the stack */
1940 for(i = 0; i < n_params; ++i) {
1941 ir_node *arg_proj = args[i];
1942 ir_node *repl = NULL;
1944 if(arg_proj != NULL) {
1945 be_abi_call_arg_t *arg;
1946 ir_type *param_type;
1947 int nr = get_Proj_proj(arg_proj);
1950 nr = MIN(nr, n_params);
1951 arg = get_call_arg(call, 0, nr);
1952 param_type = get_method_param_type(method_type, nr);
1955 repl = pmap_get(env->regs, (void *) arg->reg);
1958 else if(arg->on_stack) {
1959 /* For atomic parameters which are actually used, we create a StackParam node. */
1960 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1961 ir_mode *mode = get_type_mode(param_type);
1962 const arch_register_class_t *cls = arch_isa_get_reg_class_for_mode(isa, mode);
1963 repl = be_new_StackParam(cls, isa->bp->reg_class, irg, reg_params_bl, mode, frame_pointer, arg->stack_ent);
1966 /* The stack parameter is not primitive (it is a struct or array),
1967 we thus will create a node representing the parameter's address
1970 repl = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1974 assert(repl != NULL);
1976 /* Beware: the mode of the register parameters is always the mode of the register class
1977 which may be wrong. Add Conv's then. */
1978 mode = get_irn_mode(args[i]);
1979 if (mode != get_irn_mode(repl)) {
1980 repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
1982 exchange(args[i], repl);
1986 /* the arg proj is not needed anymore now and should be only used by the anchor */
1987 assert(get_irn_n_edges(arg_tuple) == 1);
1988 be_kill_node(arg_tuple);
1989 set_irg_args(irg, new_rd_Bad(irg));
1991 /* All Return nodes hang on the End node, so look for them there. */
1992 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1993 ir_node *irn = get_Block_cfgpred(end, i);
1995 if (is_Return(irn)) {
1996 ir_node *ret = create_be_return(env, irn, get_nodes_block(irn), get_Return_mem(irn), get_Return_n_ress(irn));
2000 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
2001 the code is dead and will never be executed. */
2003 del_pset(dont_save);
2004 obstack_free(&env->obst, args);
2006 /* handle start block here (place a jump in the block) */
2008 irg_block_walk_graph(irg, fix_start_block, NULL, &temp);
2011 /** Fix the state inputs of calls that still hang on unknowns */
2013 void fix_call_state_inputs(be_abi_irg_t *env)
2015 const arch_isa_t *isa = env->isa;
2017 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
2019 /* Collect caller save registers */
2020 n = arch_isa_get_n_reg_class(isa);
2021 for(i = 0; i < n; ++i) {
2023 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
2024 for(j = 0; j < cls->n_regs; ++j) {
2025 const arch_register_t *reg = arch_register_for_index(cls, j);
2026 if(arch_register_type_is(reg, state)) {
2027 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
2032 n = ARR_LEN(env->calls);
2033 n_states = ARR_LEN(stateregs);
2034 for(i = 0; i < n; ++i) {
2036 ir_node *call = env->calls[i];
2038 arity = get_irn_arity(call);
2040 /* the statereg inputs are the last n inputs of the calls */
2041 for(s = 0; s < n_states; ++s) {
2042 int inp = arity - n_states + s;
2043 const arch_register_t *reg = stateregs[s];
2044 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
2046 set_irn_n(call, inp, regnode);
2051 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2053 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
2054 ir_node *old_frame = get_irg_frame(birg->irg);
2055 ir_graph *irg = birg->irg;
2059 optimization_state_t state;
2060 unsigned *limited_bitset;
2062 be_omit_fp = birg->main_env->options->omit_fp;
2064 obstack_init(&env->obst);
2066 env->isa = birg->main_env->arch_env->isa;
2067 env->method_type = get_entity_type(get_irg_entity(irg));
2068 env->call = be_abi_call_new(env->isa->sp->reg_class);
2069 arch_isa_get_call_abi(env->isa, env->method_type, env->call);
2071 env->ignore_regs = pset_new_ptr_default();
2072 env->keep_map = pmap_create();
2073 env->dce_survivor = new_survive_dce();
2076 env->sp_req.type = arch_register_req_type_limited;
2077 env->sp_req.cls = arch_register_get_class(env->isa->sp);
2078 limited_bitset = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
2079 rbitset_set(limited_bitset, arch_register_get_index(env->isa->sp));
2080 env->sp_req.limited = limited_bitset;
2082 env->sp_cls_req.type = arch_register_req_type_normal;
2083 env->sp_cls_req.cls = arch_register_get_class(env->isa->sp);
2085 /* Beware: later we replace this node by the real one, ensure it is not CSE'd
2086 to another Unknown or the stack pointer gets used */
2087 save_optimization_state(&state);
2089 env->init_sp = dummy = new_r_Unknown(irg, env->isa->sp->reg_class->mode);
2090 restore_optimization_state(&state);
2091 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
2093 env->calls = NEW_ARR_F(ir_node*, 0);
2095 /* Lower all call nodes in the IRG. */
2099 Beware: init backend abi call object after processing calls,
2100 otherwise some information might be not yet available.
2102 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2104 /* Process the IRG */
2107 /* fix call inputs for state registers */
2108 fix_call_state_inputs(env);
2110 /* We don't need the keep map anymore. */
2111 pmap_destroy(env->keep_map);
2113 /* calls array is not needed anymore */
2114 DEL_ARR_F(env->calls);
2116 /* reroute the stack origin of the calls to the true stack origin. */
2117 exchange(dummy, env->init_sp);
2118 exchange(old_frame, get_irg_frame(irg));
2120 /* Make some important node pointers survive the dead node elimination. */
2121 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2122 pmap_foreach(env->regs, ent) {
2123 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2126 env->call->cb->done(env->cb);
2131 void be_abi_free(be_abi_irg_t *env)
2133 be_abi_call_free(env->call);
2134 free_survive_dce(env->dce_survivor);
2135 del_pset(env->ignore_regs);
2136 pmap_destroy(env->regs);
2137 obstack_free(&env->obst, NULL);
2141 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2143 arch_register_t *reg;
2145 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2146 if(reg->reg_class == cls)
2147 bitset_set(bs, reg->index);
2150 /* Returns the stack layout from a abi environment. */
2151 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi) {
2158 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2159 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2160 | _| | |> < ___) | || (_| | (__| <
2161 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2165 typedef ir_node **node_array;
2167 typedef struct fix_stack_walker_env_t {
2168 node_array sp_nodes;
2169 const arch_env_t *arch_env;
2170 } fix_stack_walker_env_t;
2173 * Walker. Collect all stack modifying nodes.
2175 static void collect_stack_nodes_walker(ir_node *node, void *data)
2177 fix_stack_walker_env_t *env = data;
2179 if (arch_irn_is(env->arch_env, node, modify_sp)) {
2180 assert(get_irn_mode(node) != mode_M && get_irn_mode(node) != mode_T);
2181 ARR_APP1(ir_node*, env->sp_nodes, node);
2185 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2187 be_ssa_construction_env_t senv;
2190 be_irg_t *birg = env->birg;
2191 be_lv_t *lv = be_get_birg_liveness(birg);
2192 fix_stack_walker_env_t walker_env;
2195 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2196 walker_env.arch_env = birg->main_env->arch_env;
2197 isa = walker_env.arch_env->isa;
2199 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2201 /* nothing to be done if we didn't find any node, in fact we mustn't
2202 * continue, as for endless loops incsp might have had no users and is bad
2205 len = ARR_LEN(walker_env.sp_nodes);
2207 DEL_ARR_F(walker_env.sp_nodes);
2211 be_ssa_construction_init(&senv, birg);
2212 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2213 ARR_LEN(walker_env.sp_nodes));
2214 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2215 ARR_LEN(walker_env.sp_nodes));
2218 len = ARR_LEN(walker_env.sp_nodes);
2219 for(i = 0; i < len; ++i) {
2220 be_liveness_update(lv, walker_env.sp_nodes[i]);
2222 be_ssa_construction_update_liveness_phis(&senv, lv);
2225 phis = be_ssa_construction_get_new_phis(&senv);
2227 /* set register requirements for stack phis */
2228 len = ARR_LEN(phis);
2229 for(i = 0; i < len; ++i) {
2230 ir_node *phi = phis[i];
2231 be_set_phi_reg_req(walker_env.arch_env, phi, &env->sp_req);
2232 be_set_phi_flags(walker_env.arch_env, phi, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
2233 arch_set_irn_register(walker_env.arch_env, phi, env->isa->sp);
2235 be_ssa_construction_destroy(&senv);
2237 DEL_ARR_F(walker_env.sp_nodes);
2240 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
2242 const arch_env_t *arch_env = env->birg->main_env->arch_env;
2243 int omit_fp = env->call->flags.bits.try_omit_fp;
2246 sched_foreach(bl, irn) {
2250 Check, if the node relates to an entity on the stack frame.
2251 If so, set the true offset (including the bias) for that
2254 ir_entity *ent = arch_get_frame_entity(arch_env, irn);
2256 int offset = get_stack_entity_offset(env->frame, ent, bias);
2257 arch_set_frame_offset(arch_env, irn, offset);
2258 DBG((env->dbg, LEVEL_2, "%F has offset %d (including bias %d)\n", ent, offset, bias));
2261 if(omit_fp || be_is_IncSP(irn)) {
2263 * If the node modifies the stack pointer by a constant offset,
2264 * record that in the bias.
2266 ofs = arch_get_sp_bias(arch_env, irn);
2268 if(be_is_IncSP(irn)) {
2269 if(ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2270 ofs = get_type_size_bytes(get_irg_frame_type(env->birg->irg));
2271 be_set_IncSP_offset(irn, ofs);
2272 } else if(ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2273 ofs = - get_type_size_bytes(get_irg_frame_type(env->birg->irg));
2274 be_set_IncSP_offset(irn, ofs);
2287 * A helper struct for the bias walker.
2290 be_abi_irg_t *env; /**< The ABI irg environment. */
2291 int start_block_bias; /**< The bias at the end of the start block. */
2292 ir_node *start_block; /**< The start block of the current graph. */
2296 * Block-Walker: fix all stack offsets
2298 static void stack_bias_walker(ir_node *bl, void *data)
2300 struct bias_walk *bw = data;
2301 if (bl != bw->start_block) {
2302 process_stack_bias(bw->env, bl, bw->start_block_bias);
2306 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2308 ir_graph *irg = env->birg->irg;
2309 struct bias_walk bw;
2311 stack_frame_compute_initial_offset(env->frame);
2312 // stack_layout_dump(stdout, env->frame);
2314 /* Determine the stack bias at the end of the start block. */
2315 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0);
2317 /* fix the bias is all other blocks */
2319 bw.start_block = get_irg_start_block(irg);
2320 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2323 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2325 assert(arch_register_type_is(reg, callee_save));
2326 assert(pmap_contains(abi->regs, (void *) reg));
2327 return pmap_get(abi->regs, (void *) reg);
2330 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2332 assert(arch_register_type_is(reg, ignore));
2333 assert(pmap_contains(abi->regs, (void *) reg));
2334 return pmap_get(abi->regs, (void *) reg);
2337 ir_node *be_abi_get_start_barrier(be_abi_irg_t *abi)
2339 return abi->start_barrier;
2343 * Returns non-zero if the ABI has omitted the frame pointer in
2344 * the current graph.
2346 int be_abi_omit_fp(const be_abi_irg_t *abi) {
2347 return abi->call->flags.bits.try_omit_fp;