2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Backend ABI implementation.
23 * @author Sebastian Hack, Michael Beck
33 #include "irgraph_t.h"
36 #include "iredges_t.h"
39 #include "irprintf_t.h"
45 #include "raw_bitset.h"
54 #include "besched_t.h"
56 #include "bessaconstr.h"
58 typedef struct _be_abi_call_arg_t {
59 unsigned is_res : 1; /**< 1: the call argument is a return value. 0: it's a call parameter. */
60 unsigned in_reg : 1; /**< 1: this argument is transmitted in registers. */
61 unsigned on_stack : 1; /**< 1: this argument is transmitted on the stack. */
64 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; /**< Flags describing the ABI behavior on calls */
74 int pop; /**< number of bytes the stack frame is shrinked by the callee on return. */
75 const be_abi_callbacks_t *cb;
76 ir_type *between_type;
78 const arch_register_class_t *cls_addr; /**< register class of the call address */
82 * The ABI information for the current birg.
84 struct _be_abi_irg_t {
86 be_irg_t *birg; /**< The back end IRG. */
87 const arch_env_t *arch_env;
88 survive_dce_t *dce_survivor;
90 be_abi_call_t *call; /**< The ABI call information. */
91 ir_type *method_type; /**< The type of the method of the IRG. */
93 ir_node *init_sp; /**< The node representing the stack pointer
94 at the start of the function. */
96 ir_node *reg_params; /**< The reg params node. */
97 pmap *regs; /**< A map of all callee-save and ignore regs to
98 their Projs to the RegParams node. */
100 int start_block_bias; /**< The stack bias at the end of the start block. */
102 void *cb; /**< ABI Callback self pointer. */
104 pmap *keep_map; /**< mapping blocks to keep nodes. */
105 pset *ignore_regs; /**< Additional registers which shall be ignored. */
107 ir_node **calls; /**< flexible array containing all be_Call nodes */
109 arch_register_req_t sp_req;
110 arch_register_req_t sp_cls_req;
112 be_stack_layout_t frame; /**< The stack frame model. */
114 DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< The debugging module. */
117 static heights_t *ir_heights;
119 /** Flag: if set, try to omit the frame pointer in all routines. */
120 static int be_omit_fp = 1;
122 /** Flag: if set, try to omit the frame pointer in leaf routines only. */
123 static int be_omit_leaf_fp = 1;
126 _ ____ ___ ____ _ _ _ _
127 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
128 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
129 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
130 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
132 These callbacks are used by the backend to set the parameters
133 for a specific call type.
137 * Set compare function: compares two ABI call object arguments.
139 static int cmp_call_arg(const void *a, const void *b, size_t n)
141 const be_abi_call_arg_t *p = a, *q = b;
143 return !(p->is_res == q->is_res && p->pos == q->pos);
147 * Get an ABI call object argument.
149 * @param call the abi call
150 * @param is_res true for call results, false for call arguments
151 * @param pos position of the argument
153 static be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
155 be_abi_call_arg_t arg;
158 memset(&arg, 0, sizeof(arg));
162 hash = is_res * 128 + pos;
164 return set_find(call->params, &arg, sizeof(arg), hash);
168 * Set an ABI call object argument.
170 * @param call the abi call
171 * @param is_res true for call results, false for call arguments
172 * @param pos position of the argument
174 static be_abi_call_arg_t *create_call_arg(be_abi_call_t *call, int is_res, int pos)
176 be_abi_call_arg_t arg;
179 memset(&arg, 0, sizeof(arg));
183 hash = is_res * 128 + pos;
185 return set_insert(call->params, &arg, sizeof(arg), hash);
188 /* Set the flags for a call. */
189 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
195 /* Sets the number of bytes the stackframe is shrinked by the callee on return */
196 void be_abi_call_set_pop(be_abi_call_t *call, int pop)
202 /* Set register class for call address */
203 void be_abi_call_set_call_address_reg_class(be_abi_call_t *call, const arch_register_class_t *cls)
205 call->cls_addr = cls;
209 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)
211 be_abi_call_arg_t *arg = create_call_arg(call, 0, arg_pos);
213 arg->load_mode = load_mode;
214 arg->alignment = alignment;
215 arg->space_before = space_before;
216 arg->space_after = space_after;
217 assert(alignment > 0 && "Alignment must be greater than 0");
220 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
222 be_abi_call_arg_t *arg = create_call_arg(call, 0, arg_pos);
227 void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
229 be_abi_call_arg_t *arg = create_call_arg(call, 1, arg_pos);
234 /* Get the flags of a ABI call object. */
235 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
241 * Constructor for a new ABI call object.
243 * @param cls_addr register class of the call address
245 * @return the new ABI call object
247 static be_abi_call_t *be_abi_call_new(const arch_register_class_t *cls_addr)
249 be_abi_call_t *call = XMALLOCZ(be_abi_call_t);
252 call->params = new_set(cmp_call_arg, 16);
254 call->cls_addr = cls_addr;
256 call->flags.bits.try_omit_fp = be_omit_fp | be_omit_leaf_fp;
262 * Destructor for an ABI call object.
264 static void be_abi_call_free(be_abi_call_t *call)
266 del_set(call->params);
272 | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _
273 | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` |
274 | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| |
275 |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, |
278 Handling of the stack frame. It is composed of three types:
279 1) The type of the arguments which are pushed on the stack.
280 2) The "between type" which consists of stuff the call of the
281 function pushes on the stack (like the return address and
282 the old base pointer for ia32).
283 3) The Firm frame type which consists of all local variables
287 static int get_stack_entity_offset(be_stack_layout_t *frame, ir_entity *ent,
290 ir_type *t = get_entity_owner(ent);
291 int ofs = get_entity_offset(ent);
295 /* Find the type the entity is contained in. */
296 for (index = 0; index < N_FRAME_TYPES; ++index) {
297 if (frame->order[index] == t)
299 /* Add the size of all the types below the one of the entity to the entity's offset */
300 ofs += get_type_size_bytes(frame->order[index]);
303 /* correct the offset by the initial position of the frame pointer */
304 ofs -= frame->initial_offset;
306 /* correct the offset with the current bias. */
313 * Retrieve the entity with given offset from a frame type.
315 static ir_entity *search_ent_with_offset(ir_type *t, int offset)
319 for (i = 0, n = get_compound_n_members(t); i < n; ++i) {
320 ir_entity *ent = get_compound_member(t, i);
321 if (get_entity_offset(ent) == offset)
328 static int stack_frame_compute_initial_offset(be_stack_layout_t *frame)
330 ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
331 ir_entity *ent = search_ent_with_offset(base, 0);
333 frame->initial_offset = ent ? get_stack_entity_offset(frame, ent, 0) : 0;
335 return frame->initial_offset;
339 * Initializes the frame layout from parts
341 * @param frame the stack layout that will be initialized
342 * @param args the stack argument layout type
343 * @param between the between layout type
344 * @param locals the method frame type
345 * @param stack_dir the stack direction: < 0 decreasing, > 0 increasing addresses
346 * @param param_map an array mapping method argument positions to the stack argument type
348 * @return the initialized stack layout
350 static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *args,
351 ir_type *between, ir_type *locals, int stack_dir,
352 ir_entity *param_map[])
354 frame->arg_type = args;
355 frame->between_type = between;
356 frame->frame_type = locals;
357 frame->initial_offset = 0;
358 frame->initial_bias = 0;
359 frame->stack_dir = stack_dir;
360 frame->order[1] = between;
361 frame->param_map = param_map;
364 frame->order[0] = args;
365 frame->order[2] = locals;
368 /* typical decreasing stack: locals have the
369 * lowest addresses, arguments the highest */
370 frame->order[0] = locals;
371 frame->order[2] = args;
377 /** Dumps the stack layout to file. */
378 static void stack_layout_dump(FILE *file, be_stack_layout_t *frame)
382 ir_fprintf(file, "initial offset: %d\n", frame->initial_offset);
383 for (j = 0; j < N_FRAME_TYPES; ++j) {
384 ir_type *t = frame->order[j];
386 ir_fprintf(file, "type %d: %F size: %d\n", j, t, get_type_size_bytes(t));
387 for (i = 0, n = get_compound_n_members(t); i < n; ++i) {
388 ir_entity *ent = get_compound_member(t, i);
389 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));
396 * Returns non-zero if the call argument at given position
397 * is transfered on the stack.
399 static inline int is_on_stack(be_abi_call_t *call, int pos)
401 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
402 return arg && !arg->in_reg;
412 Adjustment of the calls inside a graph.
417 * Transform a call node into a be_Call node.
419 * @param env The ABI environment for the current irg.
420 * @param irn The call node.
421 * @param curr_sp The stack pointer node to use.
422 * @return The stack pointer after the call.
424 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp)
426 ir_graph *irg = env->birg->irg;
427 const arch_env_t *arch_env = env->birg->main_env->arch_env;
428 ir_type *call_tp = get_Call_type(irn);
429 ir_node *call_ptr = get_Call_ptr(irn);
430 int n_params = get_method_n_params(call_tp);
431 ir_node *curr_mem = get_Call_mem(irn);
432 ir_node *bl = get_nodes_block(irn);
434 int stack_dir = arch_env->stack_dir;
435 const arch_register_t *sp = arch_env->sp;
436 be_abi_call_t *call = be_abi_call_new(sp->reg_class);
437 ir_mode *mach_mode = sp->reg_class->mode;
438 struct obstack *obst = &env->obst;
439 int no_alloc = call->flags.bits.frame_is_setup_on_call;
440 int n_res = get_method_n_ress(call_tp);
441 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
443 ir_node *res_proj = NULL;
444 int n_reg_params = 0;
445 int n_stack_params = 0;
448 pset_new_t destroyed_regs, states;
449 pset_new_iterator_t iter;
453 int n_reg_results = 0;
454 const arch_register_t *reg;
455 const ir_edge_t *edge;
457 int *stack_param_idx;
458 int i, n, destroy_all_regs;
461 pset_new_init(&destroyed_regs);
462 pset_new_init(&states);
464 /* Let the isa fill out the abi description for that call node. */
465 arch_env_get_call_abi(arch_env, call_tp, call);
467 /* Insert code to put the stack arguments on the stack. */
468 assert(get_Call_n_params(irn) == n_params);
469 for (i = 0; i < n_params; ++i) {
470 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
473 int arg_size = get_type_size_bytes(get_method_param_type(call_tp, i));
475 stack_size += round_up2(arg->space_before, arg->alignment);
476 stack_size += round_up2(arg_size, arg->alignment);
477 stack_size += round_up2(arg->space_after, arg->alignment);
478 obstack_int_grow(obst, i);
482 stack_param_idx = obstack_finish(obst);
484 /* Collect all arguments which are passed in registers. */
485 for (i = 0; i < n_params; ++i) {
486 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
487 if (arg && arg->in_reg) {
488 obstack_int_grow(obst, i);
492 reg_param_idxs = obstack_finish(obst);
495 * If the stack is decreasing and we do not want to store sequentially,
496 * or someone else allocated the call frame
497 * we allocate as much space on the stack all parameters need, by
498 * moving the stack pointer along the stack's direction.
500 * Note: we also have to do this for stack_size == 0, because we may have
501 * to adjust stack alignment for the call.
503 if (stack_dir < 0 && !do_seq && !no_alloc) {
504 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, stack_size, 1);
507 dbgi = get_irn_dbg_info(irn);
508 /* If there are some parameters which shall be passed on the stack. */
509 if (n_stack_params > 0) {
513 * Reverse list of stack parameters if call arguments are from left to right.
514 * We must them reverse again if they are pushed (not stored) and the stack
515 * direction is downwards.
517 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
518 for (i = 0; i < n_stack_params >> 1; ++i) {
519 int other = n_stack_params - i - 1;
520 int tmp = stack_param_idx[i];
521 stack_param_idx[i] = stack_param_idx[other];
522 stack_param_idx[other] = tmp;
526 curr_mem = get_Call_mem(irn);
528 obstack_ptr_grow(obst, curr_mem);
531 for (i = 0; i < n_stack_params; ++i) {
532 int p = stack_param_idx[i];
533 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
534 ir_node *param = get_Call_param(irn, p);
535 ir_node *addr = curr_sp;
537 ir_type *param_type = get_method_param_type(call_tp, p);
538 int param_size = get_type_size_bytes(param_type) + arg->space_after;
541 * If we wanted to build the arguments sequentially,
542 * the stack pointer for the next must be incremented,
543 * and the memory value propagated.
547 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, param_size + arg->space_before, 0);
548 add_irn_dep(curr_sp, curr_mem);
551 curr_ofs += arg->space_before;
552 curr_ofs = round_up2(curr_ofs, arg->alignment);
554 /* Make the expression to compute the argument's offset. */
556 ir_mode *constmode = mach_mode;
557 if (mode_is_reference(mach_mode)) {
560 addr = new_r_Const_long(irg, constmode, curr_ofs);
561 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
565 /* Insert a store for primitive arguments. */
566 if (is_atomic_type(param_type)) {
568 ir_node *mem_input = do_seq ? curr_mem : new_NoMem();
569 store = new_rd_Store(dbgi, irg, bl, mem_input, addr, param, 0);
570 mem = new_r_Proj(irg, bl, store, mode_M, pn_Store_M);
573 /* Make a mem copy for compound arguments. */
577 assert(mode_is_reference(get_irn_mode(param)));
578 copy = new_rd_CopyB(dbgi, irg, bl, curr_mem, addr, param, param_type);
579 mem = new_r_Proj(irg, bl, copy, mode_M, pn_CopyB_M_regular);
582 curr_ofs += param_size;
587 obstack_ptr_grow(obst, mem);
590 in = (ir_node **) obstack_finish(obst);
592 /* We need the sync only, if we didn't build the stores sequentially. */
594 if (n_stack_params >= 1) {
595 curr_mem = new_r_Sync(irg, bl, n_stack_params + 1, in);
597 curr_mem = get_Call_mem(irn);
600 obstack_free(obst, in);
603 /* check for the return_twice property */
604 destroy_all_regs = 0;
605 if (is_SymConst_addr_ent(call_ptr)) {
606 ir_entity *ent = get_SymConst_entity(call_ptr);
608 if (get_entity_additional_properties(ent) & mtp_property_returns_twice)
609 destroy_all_regs = 1;
611 ir_type *call_tp = get_Call_type(irn);
613 if (get_method_additional_properties(call_tp) & mtp_property_returns_twice)
614 destroy_all_regs = 1;
617 /* Put caller save into the destroyed set and state registers in the states set */
618 for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
620 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
621 for (j = 0; j < cls->n_regs; ++j) {
622 const arch_register_t *reg = arch_register_for_index(cls, j);
624 if (destroy_all_regs || arch_register_type_is(reg, caller_save)) {
625 if (! arch_register_type_is(reg, ignore))
626 pset_new_insert(&destroyed_regs, (void *) reg);
628 if (arch_register_type_is(reg, state)) {
629 pset_new_insert(&destroyed_regs, (void*) reg);
630 pset_new_insert(&states, (void*) reg);
635 if (destroy_all_regs) {
636 /* even if destroyed all is specified, neither SP nor FP are destroyed (else bad things will happen) */
637 pset_new_remove(&destroyed_regs, arch_env->sp);
638 pset_new_remove(&destroyed_regs, arch_env->bp);
641 /* search the largest result proj number */
642 res_projs = ALLOCANZ(ir_node*, n_res);
644 foreach_out_edge(irn, edge) {
645 const ir_edge_t *res_edge;
646 ir_node *irn = get_edge_src_irn(edge);
648 if (!is_Proj(irn) || get_Proj_proj(irn) != pn_Call_T_result)
651 foreach_out_edge(irn, res_edge) {
653 ir_node *res = get_edge_src_irn(res_edge);
655 assert(is_Proj(res));
657 proj = get_Proj_proj(res);
658 assert(proj < n_res);
659 assert(res_projs[proj] == NULL);
660 res_projs[proj] = res;
666 /** TODO: this is not correct for cases where return values are passed
667 * on the stack, but no known ABI does this currently...
669 n_reg_results = n_res;
671 /* make the back end call node and set its register requirements. */
672 for (i = 0; i < n_reg_params; ++i) {
673 obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
676 /* add state registers ins */
677 foreach_pset_new(&states, reg, iter) {
678 const arch_register_class_t *cls = arch_register_get_class(reg);
680 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
681 ir_fprintf(stderr, "Adding %+F\n", regnode);
683 ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
684 obstack_ptr_grow(obst, regnode);
686 n_ins = n_reg_params + pset_new_size(&states);
688 in = obstack_finish(obst);
690 /* ins collected, build the call */
691 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
693 low_call = be_new_Call(dbgi, irg, bl, curr_mem, curr_sp, curr_sp,
694 n_reg_results + pn_be_Call_first_res + pset_new_size(&destroyed_regs),
695 n_ins, in, get_Call_type(irn));
696 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
699 low_call = be_new_Call(dbgi, irg, bl, curr_mem, curr_sp, call_ptr,
700 n_reg_results + pn_be_Call_first_res + pset_new_size(&destroyed_regs),
701 n_ins, in, get_Call_type(irn));
703 be_Call_set_pop(low_call, call->pop);
705 /* put the call into the list of all calls for later processing */
706 ARR_APP1(ir_node *, env->calls, low_call);
708 /* create new stack pointer */
709 curr_sp = new_r_Proj(irg, bl, low_call, get_irn_mode(curr_sp),
711 be_set_constr_single_reg_out(low_call, pn_be_Call_sp, sp,
712 arch_register_req_type_ignore | arch_register_req_type_produces_sp);
713 arch_set_irn_register(curr_sp, sp);
715 /* now handle results */
716 for (i = 0; i < n_res; ++i) {
718 ir_node *proj = res_projs[i];
719 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
721 /* returns values on stack not supported yet */
725 shift the proj number to the right, since we will drop the
726 unspeakable Proj_T from the Call. Therefore, all real argument
727 Proj numbers must be increased by pn_be_Call_first_res
729 pn = i + pn_be_Call_first_res;
732 ir_type *res_type = get_method_res_type(call_tp, i);
733 ir_mode *mode = get_type_mode(res_type);
734 proj = new_r_Proj(irg, bl, low_call, mode, pn);
737 set_Proj_pred(proj, low_call);
738 set_Proj_proj(proj, pn);
742 pset_new_remove(&destroyed_regs, arg->reg);
747 Set the register class of the call address to
748 the backend provided class (default: stack pointer class)
750 be_node_set_reg_class_in(low_call, be_pos_Call_ptr, call->cls_addr);
752 DBG((env->dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
754 /* Set the register classes and constraints of the Call parameters. */
755 for (i = 0; i < n_reg_params; ++i) {
756 int index = reg_param_idxs[i];
757 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
758 assert(arg->reg != NULL);
760 be_set_constr_single_reg_in(low_call, be_pos_Call_first_arg + i,
764 /* Set the register constraints of the results. */
765 for (i = 0; i < n_res; ++i) {
766 ir_node *proj = res_projs[i];
767 const be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
768 int pn = get_Proj_proj(proj);
771 be_set_constr_single_reg_out(low_call, pn, arg->reg, 0);
772 arch_set_irn_register(proj, arg->reg);
774 obstack_free(obst, in);
775 exchange(irn, low_call);
777 /* kill the ProjT node */
778 if (res_proj != NULL) {
782 /* Make additional projs for the caller save registers
783 and the Keep node which keeps them alive. */
785 const arch_register_t *reg;
789 int curr_res_proj = pn_be_Call_first_res + n_reg_results;
790 pset_new_iterator_t iter;
792 /* also keep the stack pointer */
794 set_irn_link(curr_sp, (void*) sp);
795 obstack_ptr_grow(obst, curr_sp);
797 foreach_pset_new(&destroyed_regs, reg, iter) {
798 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode, curr_res_proj);
800 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
801 be_set_constr_single_reg_out(low_call, curr_res_proj, reg, 0);
802 arch_set_irn_register(proj, reg);
804 set_irn_link(proj, (void*) reg);
805 obstack_ptr_grow(obst, proj);
810 for (i = 0; i < n_reg_results; ++i) {
811 ir_node *proj = res_projs[i];
812 const arch_register_t *reg = arch_get_irn_register(proj);
813 set_irn_link(proj, (void*) reg);
814 obstack_ptr_grow(obst, proj);
818 /* create the Keep for the caller save registers */
819 in = (ir_node **) obstack_finish(obst);
820 keep = be_new_Keep(NULL, irg, bl, n, in);
821 for (i = 0; i < n; ++i) {
822 const arch_register_t *reg = get_irn_link(in[i]);
823 be_node_set_reg_class_in(keep, i, reg->reg_class);
825 obstack_free(obst, in);
828 /* Clean up the stack. */
829 assert(stack_size >= call->pop);
830 stack_size -= call->pop;
832 if (stack_size > 0) {
833 ir_node *mem_proj = NULL;
835 foreach_out_edge(low_call, edge) {
836 ir_node *irn = get_edge_src_irn(edge);
837 if (is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
844 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_be_Call_M_regular);
845 keep_alive(mem_proj);
848 /* Clean up the stack frame or revert alignment fixes if we allocated it */
850 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size, 0);
853 be_abi_call_free(call);
854 obstack_free(obst, stack_param_idx);
856 pset_new_destroy(&states);
857 pset_new_destroy(&destroyed_regs);
863 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
865 * @param alignment the minimum stack alignment
866 * @param size the node containing the non-aligned size
867 * @param irg the irg where new nodes are allocated on
868 * @param irg the block where new nodes are allocated on
869 * @param dbg debug info for new nodes
871 * @return a node representing the aligned size
873 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size,
874 ir_graph *irg, ir_node *block, dbg_info *dbg)
876 if (stack_alignment > 1) {
881 assert(is_po2(stack_alignment));
883 mode = get_irn_mode(size);
884 tv = new_tarval_from_long(stack_alignment-1, mode);
885 mask = new_r_Const(irg, tv);
886 size = new_rd_Add(dbg, irg, block, size, mask, mode);
888 tv = new_tarval_from_long(-(long)stack_alignment, mode);
889 mask = new_r_Const(irg, tv);
890 size = new_rd_And(dbg, irg, block, size, mask, mode);
896 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
898 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
907 const ir_edge_t *edge;
908 ir_node *new_alloc, *size, *addr, *ins[2];
909 unsigned stack_alignment;
911 assert(get_Alloc_where(alloc) == stack_alloc);
913 block = get_nodes_block(alloc);
914 irg = get_irn_irg(block);
917 type = get_Alloc_type(alloc);
919 foreach_out_edge(alloc, edge) {
920 ir_node *irn = get_edge_src_irn(edge);
922 assert(is_Proj(irn));
923 switch (get_Proj_proj(irn)) {
935 /* Beware: currently Alloc nodes without a result might happen,
936 only escape analysis kills them and this phase runs only for object
937 oriented source. We kill the Alloc here. */
938 if (alloc_res == NULL && alloc_mem) {
939 exchange(alloc_mem, get_Alloc_mem(alloc));
943 dbg = get_irn_dbg_info(alloc);
944 size = get_Alloc_size(alloc);
946 /* we might need to multiply the size with the element size */
947 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
948 ir_mode *mode = get_irn_mode(size);
949 tarval *tv = new_tarval_from_long(get_type_size_bytes(type),
951 ir_node *cnst = new_rd_Const(dbg, irg, tv);
952 size = new_rd_Mul(dbg, irg, block, size, cnst, mode);
955 /* The stack pointer will be modified in an unknown manner.
956 We cannot omit it. */
957 env->call->flags.bits.try_omit_fp = 0;
959 stack_alignment = 1 << env->arch_env->stack_alignment;
960 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
961 new_alloc = be_new_AddSP(env->arch_env->sp, irg, block, curr_sp, size);
962 set_irn_dbg_info(new_alloc, dbg);
964 if (alloc_mem != NULL) {
968 addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
970 /* We need to sync the output mem of the AddSP with the input mem
971 edge into the alloc node. */
972 ins[0] = get_Alloc_mem(alloc);
974 sync = new_r_Sync(irg, block, 2, ins);
976 exchange(alloc_mem, sync);
979 exchange(alloc, new_alloc);
981 /* fix projnum of alloca res */
982 set_Proj_proj(alloc_res, pn_be_AddSP_res);
985 curr_sp = new_r_Proj(irg, block, new_alloc, get_irn_mode(curr_sp),
993 * The Free is transformed into a back end free node and connected to the stack nodes.
995 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
999 ir_node *subsp, *mem, *res, *size, *sync;
1003 unsigned stack_alignment;
1006 assert(get_Free_where(free) == stack_alloc);
1008 block = get_nodes_block(free);
1009 irg = get_irn_irg(block);
1010 type = get_Free_type(free);
1011 sp_mode = env->arch_env->sp->reg_class->mode;
1012 dbg = get_irn_dbg_info(free);
1014 /* we might need to multiply the size with the element size */
1015 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
1016 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
1017 ir_node *cnst = new_rd_Const(dbg, irg, tv);
1018 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
1022 size = get_Free_size(free);
1025 stack_alignment = 1 << env->arch_env->stack_alignment;
1026 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
1028 /* The stack pointer will be modified in an unknown manner.
1029 We cannot omit it. */
1030 env->call->flags.bits.try_omit_fp = 0;
1031 subsp = be_new_SubSP(env->arch_env->sp, irg, block, curr_sp, size);
1032 set_irn_dbg_info(subsp, dbg);
1034 mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
1035 res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_sp);
1037 /* we need to sync the memory */
1038 in[0] = get_Free_mem(free);
1040 sync = new_r_Sync(irg, block, 2, in);
1042 /* and make the AddSP dependent on the former memory */
1043 add_irn_dep(subsp, get_Free_mem(free));
1046 exchange(free, sync);
1052 /* the following function is replaced by the usage of the heights module */
1055 * Walker for dependent_on().
1056 * This function searches a node tgt recursively from a given node
1057 * but is restricted to the given block.
1058 * @return 1 if tgt was reachable from curr, 0 if not.
1060 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl)
1064 if (get_nodes_block(curr) != bl)
1070 /* Phi functions stop the recursion inside a basic block */
1071 if (! is_Phi(curr)) {
1072 for (i = 0, n = get_irn_arity(curr); i < n; ++i) {
1073 if (check_dependence(get_irn_n(curr, i), tgt, bl))
1083 * Check if a node is somehow data dependent on another one.
1084 * both nodes must be in the same basic block.
1085 * @param n1 The first node.
1086 * @param n2 The second node.
1087 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1089 static int dependent_on(ir_node *n1, ir_node *n2)
1091 assert(get_nodes_block(n1) == get_nodes_block(n2));
1093 return heights_reachable_in_block(ir_heights, n1, n2);
1096 static int cmp_call_dependency(const void *c1, const void *c2)
1098 ir_node *n1 = *(ir_node **) c1;
1099 ir_node *n2 = *(ir_node **) c2;
1102 Classical qsort() comparison function behavior:
1103 0 if both elements are equal
1104 1 if second is "smaller" that first
1105 -1 if first is "smaller" that second
1107 if (dependent_on(n1, n2))
1110 if (dependent_on(n2, n1))
1117 * Walker: links all Call/Alloc/Free nodes to the Block they are contained.
1118 * Clears the irg_is_leaf flag if a Call is detected.
1120 static void link_ops_in_block_walker(ir_node *irn, void *data)
1122 ir_opcode code = get_irn_opcode(irn);
1124 if (code == iro_Call ||
1125 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1126 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1127 be_abi_irg_t *env = data;
1128 ir_node *bl = get_nodes_block(irn);
1129 void *save = get_irn_link(bl);
1131 if (code == iro_Call)
1132 env->call->flags.bits.irg_is_leaf = 0;
1134 set_irn_link(irn, save);
1135 set_irn_link(bl, irn);
1141 * Process all Call/Alloc/Free nodes inside a basic block.
1142 * Note that the link field of the block must contain a linked list of all
1143 * Call nodes inside the Block. We first order this list according to data dependency
1144 * and that connect the calls together.
1146 static void process_ops_in_block(ir_node *bl, void *data)
1148 be_abi_irg_t *env = data;
1149 ir_node *curr_sp = env->init_sp;
1153 for (irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
1154 obstack_ptr_grow(&env->obst, irn);
1156 /* If there were call nodes in the block. */
1162 nodes = obstack_finish(&env->obst);
1164 /* order the call nodes according to data dependency */
1165 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
1167 for (i = n - 1; i >= 0; --i) {
1168 ir_node *irn = nodes[i];
1170 DBG((env->dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1171 switch (get_irn_opcode(irn)) {
1174 /* The stack pointer will be modified due to a call. */
1175 env->call->flags.bits.try_omit_fp = 0;
1177 curr_sp = adjust_call(env, irn, curr_sp);
1180 if (get_Alloc_where(irn) == stack_alloc)
1181 curr_sp = adjust_alloc(env, irn, curr_sp);
1184 if (get_Free_where(irn) == stack_alloc)
1185 curr_sp = adjust_free(env, irn, curr_sp);
1188 panic("invalid call");
1193 obstack_free(&env->obst, nodes);
1195 /* Keep the last stack state in the block by tying it to Keep node,
1196 * the proj from calls is already kept */
1197 if (curr_sp != env->init_sp &&
1198 !(is_Proj(curr_sp) && be_is_Call(get_Proj_pred(curr_sp)))) {
1200 keep = be_new_Keep(env->arch_env->sp->reg_class,
1201 get_irn_irg(bl), bl, 1, nodes);
1202 pmap_insert(env->keep_map, bl, keep);
1206 set_irn_link(bl, curr_sp);
1207 } /* process_ops_in_block */
1210 * Adjust all call nodes in the graph to the ABI conventions.
1212 static void process_calls(be_abi_irg_t *env)
1214 ir_graph *irg = env->birg->irg;
1216 env->call->flags.bits.irg_is_leaf = 1;
1217 irg_walk_graph(irg, firm_clear_link, link_ops_in_block_walker, env);
1219 ir_heights = heights_new(env->birg->irg);
1220 irg_block_walk_graph(irg, NULL, process_ops_in_block, env);
1221 heights_free(ir_heights);
1225 * Computes the stack argument layout type.
1226 * Changes a possibly allocated value param type by moving
1227 * entities to the stack layout type.
1229 * @param env the ABI environment
1230 * @param call the current call ABI
1231 * @param method_type the method type
1232 * @param val_param_tp the value parameter type, will be destroyed
1233 * @param param_map an array mapping method arguments to the stack layout type
1235 * @return the stack argument layout type
1237 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call,
1238 ir_type *method_type, ir_type *val_param_tp,
1239 ir_entity ***param_map)
1241 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1242 int inc = env->birg->main_env->arch_env->stack_dir * dir;
1243 int n = get_method_n_params(method_type);
1244 int curr = inc > 0 ? 0 : n - 1;
1250 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1253 *param_map = map = obstack_alloc(&env->obst, n * sizeof(ir_entity *));
1254 res = new_type_struct(id_mangle_u(id, new_id_from_chars("arg_type", 8)));
1255 for (i = 0; i < n; ++i, curr += inc) {
1256 ir_type *param_type = get_method_param_type(method_type, curr);
1257 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1260 if (arg->on_stack) {
1261 if (val_param_tp != NULL) {
1262 /* the entity was already created, create a copy in the param type */
1263 ir_entity *val_ent = get_method_value_param_ent(method_type, i);
1264 arg->stack_ent = copy_entity_own(val_ent, res);
1265 set_entity_link(val_ent, arg->stack_ent);
1266 set_entity_link(arg->stack_ent, NULL);
1267 /* must be automatic to set a fixed layout */
1268 set_entity_allocation(arg->stack_ent, allocation_automatic);
1270 /* create a new entity */
1271 snprintf(buf, sizeof(buf), "param_%d", i);
1272 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1274 ofs += arg->space_before;
1275 ofs = round_up2(ofs, arg->alignment);
1276 set_entity_offset(arg->stack_ent, ofs);
1277 ofs += arg->space_after;
1278 ofs += get_type_size_bytes(param_type);
1279 map[i] = arg->stack_ent;
1282 set_type_size_bytes(res, ofs);
1283 set_type_state(res, layout_fixed);
1288 const arch_register_t *reg;
1292 static int cmp_regs(const void *a, const void *b)
1294 const reg_node_map_t *p = a;
1295 const reg_node_map_t *q = b;
1297 if (p->reg->reg_class == q->reg->reg_class)
1298 return p->reg->index - q->reg->index;
1300 return p->reg->reg_class - q->reg->reg_class;
1303 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1306 int n = pmap_count(reg_map);
1308 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1310 foreach_pmap(reg_map, ent) {
1311 res[i].reg = ent->key;
1312 res[i].irn = ent->value;
1316 qsort(res, n, sizeof(res[0]), cmp_regs);
1321 * Creates a barrier.
1323 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1325 ir_graph *irg = env->birg->irg;
1326 int n_regs = pmap_count(regs);
1332 rm = reg_map_to_arr(&env->obst, regs);
1334 for (n = 0; n < n_regs; ++n)
1335 obstack_ptr_grow(&env->obst, rm[n].irn);
1338 obstack_ptr_grow(&env->obst, *mem);
1342 in = (ir_node **) obstack_finish(&env->obst);
1343 irn = be_new_Barrier(irg, bl, n, in);
1344 obstack_free(&env->obst, in);
1346 for (n = 0; n < n_regs; ++n) {
1347 ir_node *pred = rm[n].irn;
1348 const arch_register_t *reg = rm[n].reg;
1349 arch_register_type_t add_type = 0;
1352 /* stupid workaround for now... as not all nodes report register
1354 if (!is_Phi(pred)) {
1355 const arch_register_req_t *ireq = arch_get_register_req_out(pred);
1356 if (ireq->type & arch_register_req_type_ignore)
1357 add_type |= arch_register_req_type_ignore;
1358 if (ireq->type & arch_register_req_type_produces_sp)
1359 add_type |= arch_register_req_type_produces_sp;
1362 proj = new_r_Proj(irg, bl, irn, get_irn_mode(pred), n);
1363 be_node_set_reg_class_in(irn, n, reg->reg_class);
1365 be_set_constr_single_reg_in(irn, n, reg, 0);
1366 be_set_constr_single_reg_out(irn, n, reg, add_type);
1367 arch_set_irn_register(proj, reg);
1369 pmap_insert(regs, (void *) reg, proj);
1373 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1376 obstack_free(&env->obst, rm);
1381 * Creates a be_Return for a Return node.
1383 * @param @env the abi environment
1384 * @param irn the Return node or NULL if there was none
1385 * @param bl the block where the be_Retun should be placed
1386 * @param mem the current memory
1387 * @param n_res number of return results
1389 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl,
1390 ir_node *mem, int n_res)
1392 be_abi_call_t *call = env->call;
1393 const arch_env_t *arch_env = env->birg->main_env->arch_env;
1395 pmap *reg_map = pmap_create();
1396 ir_node *keep = pmap_get(env->keep_map, bl);
1403 const arch_register_t **regs;
1407 get the valid stack node in this block.
1408 If we had a call in that block there is a Keep constructed by process_calls()
1409 which points to the last stack modification in that block. we'll use
1410 it then. Else we use the stack from the start block and let
1411 the ssa construction fix the usage.
1413 stack = be_abi_reg_map_get(env->regs, arch_env->sp);
1415 stack = get_irn_n(keep, 0);
1417 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1420 /* Insert results for Return into the register map. */
1421 for (i = 0; i < n_res; ++i) {
1422 ir_node *res = get_Return_res(irn, i);
1423 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1424 assert(arg->in_reg && "return value must be passed in register");
1425 pmap_insert(reg_map, (void *) arg->reg, res);
1428 /* Add uses of the callee save registers. */
1429 foreach_pmap(env->regs, ent) {
1430 const arch_register_t *reg = ent->key;
1431 if (arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1432 pmap_insert(reg_map, ent->key, ent->value);
1435 be_abi_reg_map_set(reg_map, arch_env->sp, stack);
1437 /* Make the Epilogue node and call the arch's epilogue maker. */
1438 create_barrier(env, bl, &mem, reg_map, 1);
1439 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1442 Maximum size of the in array for Return nodes is
1443 return args + callee save/ignore registers + memory + stack pointer
1445 in_max = pmap_count(reg_map) + n_res + 2;
1447 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1448 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1451 in[1] = be_abi_reg_map_get(reg_map, arch_env->sp);
1453 regs[1] = arch_env->sp;
1456 /* clear SP entry, since it has already been grown. */
1457 pmap_insert(reg_map, (void *) arch_env->sp, NULL);
1458 for (i = 0; i < n_res; ++i) {
1459 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1461 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1462 regs[n++] = arg->reg;
1464 /* Clear the map entry to mark the register as processed. */
1465 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1468 /* grow the rest of the stuff. */
1469 foreach_pmap(reg_map, ent) {
1472 regs[n++] = ent->key;
1476 /* The in array for the new back end return is now ready. */
1478 dbgi = get_irn_dbg_info(irn);
1482 /* we have to pop the shadow parameter in in case of struct returns */
1484 ret = be_new_Return(dbgi, env->birg->irg, bl, n_res, pop, n, in);
1486 /* Set the register classes of the return's parameter accordingly. */
1487 for (i = 0; i < n; ++i) {
1488 if (regs[i] == NULL)
1491 be_node_set_reg_class_in(ret, i, regs[i]->reg_class);
1494 /* Free the space of the Epilog's in array and the register <-> proj map. */
1495 obstack_free(&env->obst, in);
1496 pmap_destroy(reg_map);
1501 typedef struct ent_pos_pair ent_pos_pair;
1502 struct ent_pos_pair {
1503 ir_entity *ent; /**< a value param entity */
1504 int pos; /**< its parameter number */
1505 ent_pos_pair *next; /**< for linking */
1508 typedef struct lower_frame_sels_env_t {
1509 ent_pos_pair *value_param_list; /**< the list of all value param entities */
1510 ir_node *frame; /**< the current frame */
1511 const arch_register_class_t *sp_class; /**< register class of the stack pointer */
1512 const arch_register_class_t *link_class; /**< register class of the link pointer */
1513 ir_type *value_tp; /**< the value type if any */
1514 ir_type *frame_tp; /**< the frame type */
1515 int static_link_pos; /**< argument number of the hidden static link */
1516 } lower_frame_sels_env_t;
1519 * Return an entity from the backend for an value param entity.
1521 * @param ent an value param type entity
1522 * @param ctx context
1524 static ir_entity *get_argument_entity(ir_entity *ent, lower_frame_sels_env_t *ctx)
1526 ir_entity *argument_ent = get_entity_link(ent);
1528 if (argument_ent == NULL) {
1529 /* we have NO argument entity yet: This is bad, as we will
1530 * need one for backing store.
1533 ir_type *frame_tp = ctx->frame_tp;
1534 unsigned offset = get_type_size_bytes(frame_tp);
1535 ir_type *tp = get_entity_type(ent);
1536 unsigned align = get_type_alignment_bytes(tp);
1538 offset += align - 1;
1539 offset &= ~(align - 1);
1541 argument_ent = copy_entity_own(ent, frame_tp);
1543 /* must be automatic to set a fixed layout */
1544 set_entity_allocation(argument_ent, allocation_automatic);
1545 set_entity_offset(argument_ent, offset);
1546 offset += get_type_size_bytes(tp);
1548 set_type_size_bytes(frame_tp, offset);
1549 set_entity_link(ent, argument_ent);
1551 return argument_ent;
1554 * Walker: Replaces Sels of frame type and
1555 * value param type entities by FrameAddress.
1556 * Links all used entities.
1558 static void lower_frame_sels_walker(ir_node *irn, void *data)
1560 lower_frame_sels_env_t *ctx = data;
1563 ir_node *ptr = get_Sel_ptr(irn);
1565 if (ptr == ctx->frame) {
1566 ir_entity *ent = get_Sel_entity(irn);
1567 ir_node *bl = get_nodes_block(irn);
1571 if (get_entity_owner(ent) == ctx->value_tp) {
1572 /* replace by its copy from the argument type */
1573 pos = get_struct_member_index(ctx->value_tp, ent);
1574 ent = get_argument_entity(ent, ctx);
1577 nw = be_new_FrameAddr(ctx->sp_class, current_ir_graph, bl, ctx->frame, ent);
1580 /* check, if it's a param sel and if have not seen this entity before */
1581 if (get_entity_owner(ent) == ctx->value_tp && get_entity_link(ent) == NULL) {
1587 ARR_APP1(ent_pos_pair, ctx->value_param_list, pair);
1589 set_entity_link(ent, ctx->value_param_list);
1596 * Check if a value parameter is transmitted as a register.
1597 * This might happen if the address of an parameter is taken which is
1598 * transmitted in registers.
1600 * Note that on some architectures this case must be handled specially
1601 * because the place of the backing store is determined by their ABI.
1603 * In the default case we move the entity to the frame type and create
1604 * a backing store into the first block.
1606 static void fix_address_of_parameter_access(be_abi_irg_t *env, ent_pos_pair *value_param_list)
1608 be_abi_call_t *call = env->call;
1609 ir_graph *irg = env->birg->irg;
1610 ent_pos_pair *entry, *new_list;
1612 int i, n = ARR_LEN(value_param_list);
1613 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1616 for (i = 0; i < n; ++i) {
1617 int pos = value_param_list[i].pos;
1618 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
1621 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", pos));
1622 value_param_list[i].next = new_list;
1623 new_list = &value_param_list[i];
1626 if (new_list != NULL) {
1627 /* ok, change the graph */
1628 ir_node *start_bl = get_irg_start_block(irg);
1629 ir_node *first_bl = NULL;
1630 ir_node *frame, *imem, *nmem, *store, *mem, *args, *args_bl;
1631 const ir_edge_t *edge;
1632 optimization_state_t state;
1635 foreach_block_succ(start_bl, edge) {
1636 ir_node *succ = get_edge_src_irn(edge);
1637 if (start_bl != succ) {
1643 /* we had already removed critical edges, so the following
1644 assertion should be always true. */
1645 assert(get_Block_n_cfgpreds(first_bl) == 1);
1647 /* now create backing stores */
1648 frame = get_irg_frame(irg);
1649 imem = get_irg_initial_mem(irg);
1651 save_optimization_state(&state);
1653 nmem = new_r_Proj(irg, first_bl, get_irg_start(irg), mode_M, pn_Start_M);
1654 restore_optimization_state(&state);
1656 /* reroute all edges to the new memory source */
1657 edges_reroute(imem, nmem, irg);
1661 args = get_irg_args(irg);
1662 args_bl = get_nodes_block(args);
1663 for (entry = new_list; entry != NULL; entry = entry->next) {
1665 ir_type *tp = get_entity_type(entry->ent);
1666 ir_mode *mode = get_type_mode(tp);
1669 /* address for the backing store */
1670 addr = be_new_FrameAddr(env->arch_env->sp->reg_class, irg, first_bl, frame, entry->ent);
1673 mem = new_r_Proj(irg, first_bl, store, mode_M, pn_Store_M);
1675 /* the backing store itself */
1676 store = new_r_Store(irg, first_bl, mem, addr,
1677 new_r_Proj(irg, args_bl, args, mode, i), 0);
1679 /* the new memory Proj gets the last Proj from store */
1680 set_Proj_pred(nmem, store);
1681 set_Proj_proj(nmem, pn_Store_M);
1683 /* move all entities to the frame type */
1684 frame_tp = get_irg_frame_type(irg);
1685 offset = get_type_size_bytes(frame_tp);
1687 /* we will add new entities: set the layout to undefined */
1688 assert(get_type_state(frame_tp) == layout_fixed);
1689 set_type_state(frame_tp, layout_undefined);
1690 for (entry = new_list; entry != NULL; entry = entry->next) {
1691 ir_entity *ent = entry->ent;
1693 /* If the entity is still on the argument type, move it to the frame type.
1694 This happens if the value_param type was build due to compound
1696 if (get_entity_owner(ent) != frame_tp) {
1697 ir_type *tp = get_entity_type(ent);
1698 unsigned align = get_type_alignment_bytes(tp);
1700 offset += align - 1;
1701 offset &= ~(align - 1);
1702 set_entity_owner(ent, frame_tp);
1703 add_class_member(frame_tp, ent);
1704 /* must be automatic to set a fixed layout */
1705 set_entity_allocation(ent, allocation_automatic);
1706 set_entity_offset(ent, offset);
1707 offset += get_type_size_bytes(tp);
1710 set_type_size_bytes(frame_tp, offset);
1711 /* fix the layout again */
1712 set_type_state(frame_tp, layout_fixed);
1717 * The start block has no jump, instead it has an initial exec Proj.
1718 * The backend wants to handle all blocks the same way, so we replace
1719 * the out cfg edge with a real jump.
1721 static void fix_start_block(ir_graph *irg)
1723 ir_node *initial_X = get_irg_initial_exec(irg);
1724 ir_node *start_block = get_irg_start_block(irg);
1725 const ir_edge_t *edge;
1727 assert(is_Proj(initial_X));
1729 foreach_out_edge(initial_X, edge) {
1730 ir_node *block = get_edge_src_irn(edge);
1732 if (is_Anchor(block))
1734 if (block != start_block) {
1735 ir_node *jmp = new_r_Jmp(irg, start_block);
1737 set_Block_cfgpred(block, get_edge_src_pos(edge), jmp);
1741 panic("Initial exec has no follow block in %+F", irg);
1745 * Update the entity of Sels to the outer value parameters.
1747 static void update_outer_frame_sels(ir_node *irn, void *env) {
1748 lower_frame_sels_env_t *ctx = env;
1755 ptr = get_Sel_ptr(irn);
1756 if (! is_arg_Proj(ptr))
1758 if (get_Proj_proj(ptr) != ctx->static_link_pos)
1760 ent = get_Sel_entity(irn);
1762 if (get_entity_owner(ent) == ctx->value_tp) {
1763 /* replace by its copy from the argument type */
1764 pos = get_struct_member_index(ctx->value_tp, ent);
1765 ent = get_argument_entity(ent, ctx);
1766 set_Sel_entity(irn, ent);
1768 /* check, if we have not seen this entity before */
1769 if (get_entity_link(ent) == NULL) {
1775 ARR_APP1(ent_pos_pair, ctx->value_param_list, pair);
1777 set_entity_link(ent, ctx->value_param_list);
1783 * Fix access to outer local variables.
1785 static void fix_outer_variable_access(be_abi_irg_t *env, lower_frame_sels_env_t *ctx)
1790 for (i = get_class_n_members(ctx->frame_tp) - 1; i >= 0; --i) {
1791 ir_entity *ent = get_class_member(ctx->frame_tp, i);
1793 if (! is_method_entity(ent))
1797 * FIXME: find the number of the static link parameter
1798 * for now we assume 0 here
1800 ctx->static_link_pos = 0;
1802 irg = get_entity_irg(ent);
1803 irg_walk_graph(irg, NULL, update_outer_frame_sels, ctx);
1808 * Modify the irg itself and the frame type.
1810 static void modify_irg(be_abi_irg_t *env)
1812 be_abi_call_t *call = env->call;
1813 const arch_env_t *arch_env= env->birg->main_env->arch_env;
1814 const arch_register_t *sp = arch_env->sp;
1815 ir_graph *irg = env->birg->irg;
1819 ir_node *new_mem_proj;
1821 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1828 const arch_register_t *fp_reg;
1829 ir_node *frame_pointer;
1830 ir_node *reg_params_bl;
1833 const ir_edge_t *edge;
1834 ir_type *arg_type, *bet_type, *tp;
1835 lower_frame_sels_env_t ctx;
1836 ir_entity **param_map;
1838 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1840 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1842 /* Must fetch memory here, otherwise the start Barrier gets the wrong
1843 * memory, which leads to loops in the DAG. */
1844 old_mem = get_irg_initial_mem(irg);
1846 irp_reserve_resources(irp, IR_RESOURCE_ENTITY_LINK);
1848 /* set the links of all frame entities to NULL, we use it
1849 to detect if an entity is already linked in the value_param_list */
1850 tp = get_method_value_param_type(method_type);
1853 /* clear the links of the clone type, let the
1854 original entities point to its clones */
1855 for (i = get_struct_n_members(tp) - 1; i >= 0; --i) {
1856 ir_entity *mem = get_struct_member(tp, i);
1857 set_entity_link(mem, NULL);
1861 arg_type = compute_arg_type(env, call, method_type, tp, ¶m_map);
1863 /* Convert the Sel nodes in the irg to frame addr nodes: */
1864 ctx.value_param_list = NEW_ARR_F(ent_pos_pair, 0);
1865 ctx.frame = get_irg_frame(irg);
1866 ctx.sp_class = env->arch_env->sp->reg_class;
1867 ctx.link_class = env->arch_env->link_class;
1868 ctx.frame_tp = get_irg_frame_type(irg);
1870 /* we will possible add new entities to the frame: set the layout to undefined */
1871 assert(get_type_state(ctx.frame_tp) == layout_fixed);
1872 set_type_state(ctx.frame_tp, layout_undefined);
1874 irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
1876 /* fix the frame type layout again */
1877 set_type_state(ctx.frame_tp, layout_fixed);
1879 env->regs = pmap_create();
1881 n_params = get_method_n_params(method_type);
1882 args = obstack_alloc(&env->obst, n_params * sizeof(args[0]));
1883 memset(args, 0, n_params * sizeof(args[0]));
1886 * for inner function we must now fix access to outer frame entities.
1888 fix_outer_variable_access(env, &ctx);
1890 /* Check if a value parameter is transmitted as a register.
1891 * This might happen if the address of an parameter is taken which is
1892 * transmitted in registers.
1894 * Note that on some architectures this case must be handled specially
1895 * because the place of the backing store is determined by their ABI.
1897 * In the default case we move the entity to the frame type and create
1898 * a backing store into the first block.
1900 fix_address_of_parameter_access(env, ctx.value_param_list);
1902 DEL_ARR_F(ctx.value_param_list);
1903 irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK);
1905 /* Fill the argument vector */
1906 arg_tuple = get_irg_args(irg);
1907 foreach_out_edge(arg_tuple, edge) {
1908 ir_node *irn = get_edge_src_irn(edge);
1909 if (! is_Anchor(irn)) {
1910 int nr = get_Proj_proj(irn);
1912 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1916 bet_type = call->cb->get_between_type(env->cb);
1917 stack_frame_init(&env->frame, arg_type, bet_type, get_irg_frame_type(irg), arch_env->stack_dir, param_map);
1919 /* Count the register params and add them to the number of Projs for the RegParams node */
1920 for (i = 0; i < n_params; ++i) {
1921 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1922 if (arg->in_reg && args[i]) {
1923 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1924 assert(i == get_Proj_proj(args[i]));
1926 /* For now, associate the register with the old Proj from Start representing that argument. */
1927 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1928 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1932 /* Collect all callee-save registers */
1933 for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
1934 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
1935 for (j = 0; j < cls->n_regs; ++j) {
1936 const arch_register_t *reg = &cls->regs[j];
1937 if (arch_register_type_is(reg, callee_save) ||
1938 arch_register_type_is(reg, state)) {
1939 pmap_insert(env->regs, (void *) reg, NULL);
1944 pmap_insert(env->regs, (void *) sp, NULL);
1945 pmap_insert(env->regs, (void *) arch_env->bp, NULL);
1946 reg_params_bl = get_irg_start_block(irg);
1947 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1948 add_irn_dep(env->reg_params, get_irg_start(irg));
1951 * make proj nodes for the callee save registers.
1952 * memorize them, since Return nodes get those as inputs.
1954 * Note, that if a register corresponds to an argument, the regs map contains
1955 * the old Proj from start for that argument.
1958 rm = reg_map_to_arr(&env->obst, env->regs);
1959 for (i = 0, n = pmap_count(env->regs); i < n; ++i) {
1960 arch_register_t *reg = (void *) rm[i].reg;
1961 ir_mode *mode = reg->reg_class->mode;
1963 arch_register_req_type_t add_type = 0;
1967 add_type |= arch_register_req_type_produces_sp | arch_register_req_type_ignore;
1970 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1971 pmap_insert(env->regs, (void *) reg, proj);
1972 be_set_constr_single_reg_out(env->reg_params, nr, reg, add_type);
1973 arch_set_irn_register(proj, reg);
1975 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1977 obstack_free(&env->obst, rm);
1979 /* create a new initial memory proj */
1980 assert(is_Proj(old_mem));
1981 new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
1982 new_r_Unknown(irg, mode_T), mode_M,
1983 get_Proj_proj(old_mem));
1986 /* Generate the Prologue */
1987 fp_reg = call->cb->prologue(env->cb, &mem, env->regs, &env->frame.initial_bias);
1989 /* do the stack allocation BEFORE the barrier, or spill code
1990 might be added before it */
1991 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1992 start_bl = get_irg_start_block(irg);
1993 env->init_sp = be_new_IncSP(sp, irg, start_bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND, 0);
1994 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1996 create_barrier(env, start_bl, &mem, env->regs, 0);
1998 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1999 arch_set_irn_register(env->init_sp, sp);
2001 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
2002 set_irg_frame(irg, frame_pointer);
2003 pset_insert_ptr(env->ignore_regs, fp_reg);
2005 /* rewire old mem users to new mem */
2006 set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
2007 exchange(old_mem, mem);
2009 set_irg_initial_mem(irg, mem);
2011 /* Now, introduce stack param nodes for all parameters passed on the stack */
2012 for (i = 0; i < n_params; ++i) {
2013 ir_node *arg_proj = args[i];
2014 ir_node *repl = NULL;
2016 if (arg_proj != NULL) {
2017 be_abi_call_arg_t *arg;
2018 ir_type *param_type;
2019 int nr = get_Proj_proj(arg_proj);
2022 nr = MIN(nr, n_params);
2023 arg = get_call_arg(call, 0, nr);
2024 param_type = get_method_param_type(method_type, nr);
2027 repl = pmap_get(env->regs, (void *) arg->reg);
2028 } else if (arg->on_stack) {
2029 ir_node *addr = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
2031 /* For atomic parameters which are actually used, we create a Load node. */
2032 if (is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
2033 ir_mode *mode = get_type_mode(param_type);
2034 ir_mode *load_mode = arg->load_mode;
2036 ir_node *load = new_r_Load(irg, reg_params_bl, new_NoMem(), addr, load_mode, cons_floats);
2037 repl = new_r_Proj(irg, reg_params_bl, load, load_mode, pn_Load_res);
2039 if (mode != load_mode) {
2040 repl = new_r_Conv(irg, reg_params_bl, repl, mode);
2043 /* The stack parameter is not primitive (it is a struct or array),
2044 * we thus will create a node representing the parameter's address
2050 assert(repl != NULL);
2052 /* Beware: the mode of the register parameters is always the mode of the register class
2053 which may be wrong. Add Conv's then. */
2054 mode = get_irn_mode(args[i]);
2055 if (mode != get_irn_mode(repl)) {
2056 repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
2058 exchange(args[i], repl);
2062 /* the arg proj is not needed anymore now and should be only used by the anchor */
2063 assert(get_irn_n_edges(arg_tuple) == 1);
2064 kill_node(arg_tuple);
2065 set_irg_args(irg, new_r_Bad(irg));
2067 /* All Return nodes hang on the End node, so look for them there. */
2068 end = get_irg_end_block(irg);
2069 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
2070 ir_node *irn = get_Block_cfgpred(end, i);
2072 if (is_Return(irn)) {
2073 ir_node *blk = get_nodes_block(irn);
2074 ir_node *mem = get_Return_mem(irn);
2075 ir_node *ret = create_be_return(env, irn, blk, mem, get_Return_n_ress(irn));
2079 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
2080 the code is dead and will never be executed. */
2082 obstack_free(&env->obst, args);
2084 /* handle start block here (place a jump in the block) */
2085 fix_start_block(irg);
2088 /** Fix the state inputs of calls that still hang on unknowns */
2090 void fix_call_state_inputs(be_abi_irg_t *env)
2092 const arch_env_t *arch_env = env->arch_env;
2094 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
2096 /* Collect caller save registers */
2097 n = arch_env_get_n_reg_class(arch_env);
2098 for (i = 0; i < n; ++i) {
2100 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
2101 for (j = 0; j < cls->n_regs; ++j) {
2102 const arch_register_t *reg = arch_register_for_index(cls, j);
2103 if (arch_register_type_is(reg, state)) {
2104 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
2109 n = ARR_LEN(env->calls);
2110 n_states = ARR_LEN(stateregs);
2111 for (i = 0; i < n; ++i) {
2113 ir_node *call = env->calls[i];
2115 arity = get_irn_arity(call);
2117 /* the state reg inputs are the last n inputs of the calls */
2118 for (s = 0; s < n_states; ++s) {
2119 int inp = arity - n_states + s;
2120 const arch_register_t *reg = stateregs[s];
2121 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
2123 set_irn_n(call, inp, regnode);
2127 DEL_ARR_F(stateregs);
2131 * Create a trampoline entity for the given method.
2133 static ir_entity *create_trampoline(be_main_env_t *be, ir_entity *method)
2135 ir_type *type = get_entity_type(method);
2136 ident *old_id = get_entity_ld_ident(method);
2137 ident *id = id_mangle3("L", old_id, "$stub");
2138 ir_type *parent = be->pic_trampolines_type;
2139 ir_entity *ent = new_entity(parent, old_id, type);
2140 set_entity_ld_ident(ent, id);
2141 set_entity_visibility(ent, visibility_local);
2142 set_entity_variability(ent, variability_uninitialized);
2148 * Returns the trampoline entity for the given method.
2150 static ir_entity *get_trampoline(be_main_env_t *env, ir_entity *method)
2152 ir_entity *result = pmap_get(env->ent_trampoline_map, method);
2153 if (result == NULL) {
2154 result = create_trampoline(env, method);
2155 pmap_insert(env->ent_trampoline_map, method, result);
2161 static ir_entity *create_pic_symbol(be_main_env_t *be, ir_entity *entity)
2163 ident *old_id = get_entity_ld_ident(entity);
2164 ident *id = id_mangle3("L", old_id, "$non_lazy_ptr");
2165 ir_type *e_type = get_entity_type(entity);
2166 ir_type *type = new_type_pointer(id, e_type, mode_P_data);
2167 ir_type *parent = be->pic_symbols_type;
2168 ir_entity *ent = new_entity(parent, old_id, type);
2169 set_entity_ld_ident(ent, id);
2170 set_entity_visibility(ent, visibility_local);
2171 set_entity_variability(ent, variability_uninitialized);
2176 static ir_entity *get_pic_symbol(be_main_env_t *env, ir_entity *entity)
2178 ir_entity *result = pmap_get(env->ent_pic_symbol_map, entity);
2179 if (result == NULL) {
2180 result = create_pic_symbol(env, entity);
2181 pmap_insert(env->ent_pic_symbol_map, entity, result);
2190 * Returns non-zero if a given entity can be accessed using a relative address.
2192 static int can_address_relative(ir_entity *entity)
2194 return get_entity_variability(entity) == variability_initialized
2195 || get_entity_visibility(entity) == visibility_local;
2198 /** patches SymConsts to work in position independent code */
2199 static void fix_pic_symconsts(ir_node *node, void *data)
2209 be_abi_irg_t *env = data;
2211 be_main_env_t *be = env->birg->main_env;
2213 arity = get_irn_arity(node);
2214 for (i = 0; i < arity; ++i) {
2216 ir_node *pred = get_irn_n(node, i);
2218 ir_entity *pic_symbol;
2219 ir_node *pic_symconst;
2221 if (!is_SymConst(pred))
2224 entity = get_SymConst_entity(pred);
2225 block = get_nodes_block(pred);
2226 irg = get_irn_irg(pred);
2228 /* calls can jump to relative addresses, so we can directly jump to
2229 the (relatively) known call address or the trampoline */
2230 if (i == 1 && is_Call(node)) {
2231 ir_entity *trampoline;
2232 ir_node *trampoline_const;
2234 if (can_address_relative(entity))
2237 dbgi = get_irn_dbg_info(pred);
2238 trampoline = get_trampoline(be, entity);
2239 trampoline_const = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2241 set_irn_n(node, i, trampoline_const);
2245 /* everything else is accessed relative to EIP */
2246 mode = get_irn_mode(pred);
2247 unknown = new_r_Unknown(irg, mode);
2248 pic_base = arch_code_generator_get_pic_base(env->birg->cg);
2250 /* all ok now for locally constructed stuff */
2251 if (can_address_relative(entity)) {
2252 ir_node *add = new_r_Add(irg, block, pic_base, pred, mode);
2254 /* make sure the walker doesn't visit this add again */
2255 mark_irn_visited(add);
2256 set_irn_n(node, i, add);
2260 /* get entry from pic symbol segment */
2261 dbgi = get_irn_dbg_info(pred);
2262 pic_symbol = get_pic_symbol(be, entity);
2263 pic_symconst = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2265 add = new_r_Add(irg, block, pic_base, pic_symconst, mode);
2266 mark_irn_visited(add);
2268 /* we need an extra indirection for global data outside our current
2269 module. The loads are always safe and can therefore float
2270 and need no memory input */
2271 load = new_r_Load(irg, block, new_NoMem(), add, mode, cons_floats);
2272 load_res = new_r_Proj(irg, block, load, mode, pn_Load_res);
2274 set_irn_n(node, i, load_res);
2278 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2280 be_abi_irg_t *env = XMALLOC(be_abi_irg_t);
2281 ir_node *old_frame = get_irg_frame(birg->irg);
2282 ir_graph *irg = birg->irg;
2286 optimization_state_t state;
2287 unsigned *limited_bitset;
2289 be_omit_fp = birg->main_env->options->omit_fp;
2290 be_omit_leaf_fp = birg->main_env->options->omit_leaf_fp;
2292 obstack_init(&env->obst);
2294 env->arch_env = birg->main_env->arch_env;
2295 env->method_type = get_entity_type(get_irg_entity(irg));
2296 env->call = be_abi_call_new(env->arch_env->sp->reg_class);
2297 arch_env_get_call_abi(env->arch_env, env->method_type, env->call);
2299 env->ignore_regs = pset_new_ptr_default();
2300 env->keep_map = pmap_create();
2301 env->dce_survivor = new_survive_dce();
2304 env->sp_req.type = arch_register_req_type_limited;
2305 env->sp_req.cls = arch_register_get_class(env->arch_env->sp);
2306 limited_bitset = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
2307 rbitset_set(limited_bitset, arch_register_get_index(env->arch_env->sp));
2308 env->sp_req.limited = limited_bitset;
2309 if (env->arch_env->sp->type & arch_register_type_ignore) {
2310 env->sp_req.type |= arch_register_req_type_ignore;
2313 env->sp_cls_req.type = arch_register_req_type_normal;
2314 env->sp_cls_req.cls = arch_register_get_class(env->arch_env->sp);
2316 /* Beware: later we replace this node by the real one, ensure it is not CSE'd
2317 to another Unknown or the stack pointer gets used */
2318 save_optimization_state(&state);
2320 env->init_sp = dummy = new_r_Unknown(irg, env->arch_env->sp->reg_class->mode);
2321 restore_optimization_state(&state);
2323 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
2325 env->calls = NEW_ARR_F(ir_node*, 0);
2327 if (birg->main_env->options->pic) {
2328 irg_walk_graph(irg, fix_pic_symconsts, NULL, env);
2331 /* Lower all call nodes in the IRG. */
2335 Beware: init backend abi call object after processing calls,
2336 otherwise some information might be not yet available.
2338 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2340 /* Process the IRG */
2343 /* fix call inputs for state registers */
2344 fix_call_state_inputs(env);
2346 /* We don't need the keep map anymore. */
2347 pmap_destroy(env->keep_map);
2348 env->keep_map = NULL;
2350 /* calls array is not needed anymore */
2351 DEL_ARR_F(env->calls);
2354 /* reroute the stack origin of the calls to the true stack origin. */
2355 exchange(dummy, env->init_sp);
2356 exchange(old_frame, get_irg_frame(irg));
2358 /* Make some important node pointers survive the dead node elimination. */
2359 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2360 foreach_pmap(env->regs, ent) {
2361 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2364 env->call->cb->done(env->cb);
2369 void be_abi_free(be_abi_irg_t *env)
2371 be_abi_call_free(env->call);
2372 free_survive_dce(env->dce_survivor);
2373 del_pset(env->ignore_regs);
2374 pmap_destroy(env->regs);
2375 obstack_free(&env->obst, NULL);
2379 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2381 arch_register_t *reg;
2383 for (reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2384 if (reg->reg_class == cls)
2385 bitset_set(bs, reg->index);
2388 void be_abi_set_non_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, unsigned *raw_bitset)
2391 arch_register_t *reg;
2393 for (i = 0; i < cls->n_regs; ++i) {
2394 if (arch_register_type_is(&cls->regs[i], ignore))
2397 rbitset_set(raw_bitset, i);
2400 for (reg = pset_first(abi->ignore_regs); reg != NULL;
2401 reg = pset_next(abi->ignore_regs)) {
2402 if (reg->reg_class != cls)
2405 rbitset_clear(raw_bitset, reg->index);
2409 /* Returns the stack layout from a abi environment. */
2410 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi)
2418 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2419 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2420 | _| | |> < ___) | || (_| | (__| <
2421 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2425 typedef ir_node **node_array;
2427 typedef struct fix_stack_walker_env_t {
2428 node_array sp_nodes;
2429 } fix_stack_walker_env_t;
2432 * Walker. Collect all stack modifying nodes.
2434 static void collect_stack_nodes_walker(ir_node *node, void *data)
2436 fix_stack_walker_env_t *env = data;
2437 const arch_register_req_t *req;
2439 if (get_irn_mode(node) == mode_T)
2442 req = arch_get_register_req_out(node);
2443 if (! (req->type & arch_register_req_type_produces_sp))
2446 ARR_APP1(ir_node*, env->sp_nodes, node);
2449 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2451 be_ssa_construction_env_t senv;
2454 be_irg_t *birg = env->birg;
2455 be_lv_t *lv = be_get_birg_liveness(birg);
2456 fix_stack_walker_env_t walker_env;
2458 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2460 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2462 /* nothing to be done if we didn't find any node, in fact we mustn't
2463 * continue, as for endless loops incsp might have had no users and is bad
2466 len = ARR_LEN(walker_env.sp_nodes);
2468 DEL_ARR_F(walker_env.sp_nodes);
2472 be_ssa_construction_init(&senv, birg);
2473 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2474 ARR_LEN(walker_env.sp_nodes));
2475 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2476 ARR_LEN(walker_env.sp_nodes));
2479 len = ARR_LEN(walker_env.sp_nodes);
2480 for (i = 0; i < len; ++i) {
2481 be_liveness_update(lv, walker_env.sp_nodes[i]);
2483 be_ssa_construction_update_liveness_phis(&senv, lv);
2486 phis = be_ssa_construction_get_new_phis(&senv);
2488 /* set register requirements for stack phis */
2489 len = ARR_LEN(phis);
2490 for (i = 0; i < len; ++i) {
2491 ir_node *phi = phis[i];
2492 be_set_phi_reg_req(phi, &env->sp_req, arch_register_req_type_produces_sp);
2493 arch_set_irn_register(phi, env->arch_env->sp);
2495 be_ssa_construction_destroy(&senv);
2497 DEL_ARR_F(walker_env.sp_nodes);
2501 * Fix all stack accessing operations in the block bl.
2503 * @param env the abi environment
2504 * @param bl the block to process
2505 * @param real_bias the bias value
2507 * @return the bias at the end of this block
2509 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int real_bias)
2511 int omit_fp = env->call->flags.bits.try_omit_fp;
2513 int wanted_bias = real_bias;
2515 sched_foreach(bl, irn) {
2519 Check, if the node relates to an entity on the stack frame.
2520 If so, set the true offset (including the bias) for that
2523 ir_entity *ent = arch_get_frame_entity(irn);
2525 int bias = omit_fp ? real_bias : 0;
2526 int offset = get_stack_entity_offset(&env->frame, ent, bias);
2527 arch_set_frame_offset(irn, offset);
2528 DBG((env->dbg, LEVEL_2, "%F has offset %d (including bias %d)\n",
2529 ent, offset, bias));
2533 * If the node modifies the stack pointer by a constant offset,
2534 * record that in the bias.
2536 ofs = arch_get_sp_bias(irn);
2538 if (be_is_IncSP(irn)) {
2539 /* fill in real stack frame size */
2540 if (ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2541 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2542 ofs = (int) get_type_size_bytes(frame_type);
2543 be_set_IncSP_offset(irn, ofs);
2544 } else if (ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2545 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2546 ofs = - (int)get_type_size_bytes(frame_type);
2547 be_set_IncSP_offset(irn, ofs);
2549 if (be_get_IncSP_align(irn)) {
2550 /* patch IncSP to produce an aligned stack pointer */
2551 ir_type *between_type = env->frame.between_type;
2552 int between_size = get_type_size_bytes(between_type);
2553 int alignment = 1 << env->arch_env->stack_alignment;
2554 int delta = (real_bias + ofs + between_size) & (alignment - 1);
2557 be_set_IncSP_offset(irn, ofs + alignment - delta);
2558 real_bias += alignment - delta;
2561 /* adjust so real_bias corresponds with wanted_bias */
2562 int delta = wanted_bias - real_bias;
2565 be_set_IncSP_offset(irn, ofs + delta);
2576 assert(real_bias == wanted_bias);
2581 * A helper struct for the bias walker.
2584 be_abi_irg_t *env; /**< The ABI irg environment. */
2585 int start_block_bias; /**< The bias at the end of the start block. */
2587 ir_node *start_block; /**< The start block of the current graph. */
2591 * Block-Walker: fix all stack offsets for all blocks
2592 * except the start block
2594 static void stack_bias_walker(ir_node *bl, void *data)
2596 struct bias_walk *bw = data;
2597 if (bl != bw->start_block) {
2598 process_stack_bias(bw->env, bl, bw->start_block_bias);
2603 * Walker: finally lower all Sels of outer frame or parameter
2606 static void lower_outer_frame_sels(ir_node *sel, void *ctx) {
2607 be_abi_irg_t *env = ctx;
2615 ent = get_Sel_entity(sel);
2616 owner = get_entity_owner(ent);
2617 ptr = get_Sel_ptr(sel);
2619 if (owner == env->frame.frame_type || owner == env->frame.arg_type) {
2620 /* found access to outer frame or arguments */
2621 int offset = get_stack_entity_offset(&env->frame, ent, 0);
2624 ir_node *bl = get_nodes_block(sel);
2625 dbg_info *dbgi = get_irn_dbg_info(sel);
2626 ir_mode *mode = get_irn_mode(sel);
2627 ir_mode *mode_UInt = get_reference_mode_unsigned_eq(mode);
2628 ir_node *cnst = new_r_Const_long(current_ir_graph, mode_UInt, offset);
2630 ptr = new_rd_Add(dbgi, current_ir_graph, bl, ptr, cnst, mode);
2636 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2638 ir_graph *irg = env->birg->irg;
2641 struct bias_walk bw;
2643 stack_frame_compute_initial_offset(&env->frame);
2644 // stack_layout_dump(stdout, frame);
2646 /* Determine the stack bias at the end of the start block. */
2647 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), env->frame.initial_bias);
2648 bw.between_size = get_type_size_bytes(env->frame.between_type);
2650 /* fix the bias is all other blocks */
2652 bw.start_block = get_irg_start_block(irg);
2653 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2655 /* fix now inner functions: these still have Sel node to outer
2656 frame and parameter entities */
2657 frame_tp = get_irg_frame_type(irg);
2658 for (i = get_class_n_members(frame_tp) - 1; i >= 0; --i) {
2659 ir_entity *ent = get_class_member(frame_tp, i);
2661 if (is_method_entity(ent)) {
2662 ir_graph *irg = get_entity_irg(ent);
2664 irg_walk_graph(irg, NULL, lower_outer_frame_sels, env);
2669 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2671 assert(arch_register_type_is(reg, callee_save));
2672 assert(pmap_contains(abi->regs, (void *) reg));
2673 return pmap_get(abi->regs, (void *) reg);
2676 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2678 assert(arch_register_type_is(reg, ignore));
2679 assert(pmap_contains(abi->regs, (void *) reg));
2680 return pmap_get(abi->regs, (void *) reg);
2684 * Returns non-zero if the ABI has omitted the frame pointer in
2685 * the current graph.
2687 int be_abi_omit_fp(const be_abi_irg_t *abi)
2689 return abi->call->flags.bits.try_omit_fp;