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"
46 #include "raw_bitset.h"
57 #include "bessaconstr.h"
60 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
62 typedef struct _be_abi_call_arg_t {
63 unsigned is_res : 1; /**< 1: the call argument is a return value. 0: it's a call parameter. */
64 unsigned in_reg : 1; /**< 1: this argument is transmitted in registers. */
65 unsigned on_stack : 1; /**< 1: this argument is transmitted on the stack. */
68 const arch_register_t *reg;
71 unsigned alignment; /**< stack alignment */
72 unsigned space_before; /**< allocate space before */
73 unsigned space_after; /**< allocate space after */
76 struct _be_abi_call_t {
77 be_abi_call_flags_t flags; /**< Flags describing the ABI behavior on calls */
78 int pop; /**< number of bytes the stack frame is shrinked by the callee on return. */
79 const be_abi_callbacks_t *cb;
80 ir_type *between_type;
82 const arch_register_class_t *cls_addr; /**< register class of the call address */
86 * The ABI information for the current birg.
88 struct _be_abi_irg_t {
89 be_irg_t *birg; /**< The back end IRG. */
91 const arch_env_t *arch_env;
92 survive_dce_t *dce_survivor;
94 be_abi_call_t *call; /**< The ABI call information. */
95 ir_type *method_type; /**< The type of the method of the IRG. */
97 ir_node *init_sp; /**< The node representing the stack pointer
98 at the start of the function. */
100 ir_node *start; /**< The be_Start params node. */
101 pmap *regs; /**< A map of all callee-save and ignore regs to
102 their Projs to the RegParams node. */
104 int start_block_bias; /**< The stack bias at the end of the start block. */
106 void *cb; /**< ABI Callback self pointer. */
108 pmap *keep_map; /**< mapping blocks to keep nodes. */
109 pset *ignore_regs; /**< Additional registers which shall be ignored. */
111 ir_node **calls; /**< flexible array containing all be_Call nodes */
113 arch_register_req_t *sp_req;
115 be_stack_layout_t frame; /**< The stack frame model. */
118 static heights_t *ir_heights;
120 /** Flag: if set, try to omit the frame pointer in all routines. */
121 static int be_omit_fp = 1;
123 /** Flag: if set, try to omit the frame pointer in leaf routines only. */
124 static int be_omit_leaf_fp = 1;
127 _ ____ ___ ____ _ _ _ _
128 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
129 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
130 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
131 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
133 These callbacks are used by the backend to set the parameters
134 for a specific call type.
138 * Set compare function: compares two ABI call object arguments.
140 static int cmp_call_arg(const void *a, const void *b, size_t n)
142 const be_abi_call_arg_t *p = a, *q = b;
144 return !(p->is_res == q->is_res && p->pos == q->pos);
148 * Get an ABI call object argument.
150 * @param call the abi call
151 * @param is_res true for call results, false for call arguments
152 * @param pos position of the argument
154 static be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
156 be_abi_call_arg_t arg;
159 memset(&arg, 0, sizeof(arg));
163 hash = is_res * 128 + pos;
165 return set_find(call->params, &arg, sizeof(arg), hash);
169 * Set an ABI call object argument.
171 * @param call the abi call
172 * @param is_res true for call results, false for call arguments
173 * @param pos position of the argument
175 static be_abi_call_arg_t *create_call_arg(be_abi_call_t *call, int is_res, int pos)
177 be_abi_call_arg_t arg;
180 memset(&arg, 0, sizeof(arg));
184 hash = is_res * 128 + pos;
186 return set_insert(call->params, &arg, sizeof(arg), hash);
189 /* Set the flags for a call. */
190 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
196 /* Sets the number of bytes the stackframe is shrinked by the callee on return */
197 void be_abi_call_set_pop(be_abi_call_t *call, int pop)
203 /* Set register class for call address */
204 void be_abi_call_set_call_address_reg_class(be_abi_call_t *call, const arch_register_class_t *cls)
206 call->cls_addr = cls;
210 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)
212 be_abi_call_arg_t *arg = create_call_arg(call, 0, arg_pos);
214 arg->load_mode = load_mode;
215 arg->alignment = alignment;
216 arg->space_before = space_before;
217 arg->space_after = space_after;
218 assert(alignment > 0 && "Alignment must be greater than 0");
221 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
223 be_abi_call_arg_t *arg = create_call_arg(call, 0, arg_pos);
228 void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
230 be_abi_call_arg_t *arg = create_call_arg(call, 1, arg_pos);
235 /* Get the flags of a ABI call object. */
236 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
242 * Constructor for a new ABI call object.
244 * @param cls_addr register class of the call address
246 * @return the new ABI call object
248 static be_abi_call_t *be_abi_call_new(const arch_register_class_t *cls_addr)
250 be_abi_call_t *call = XMALLOCZ(be_abi_call_t);
253 call->params = new_set(cmp_call_arg, 16);
255 call->cls_addr = cls_addr;
257 call->flags.bits.try_omit_fp = be_omit_fp | be_omit_leaf_fp;
263 * Destructor for an ABI call object.
265 static void be_abi_call_free(be_abi_call_t *call)
267 del_set(call->params);
273 | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _
274 | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` |
275 | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| |
276 |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, |
279 Handling of the stack frame. It is composed of three types:
280 1) The type of the arguments which are pushed on the stack.
281 2) The "between type" which consists of stuff the call of the
282 function pushes on the stack (like the return address and
283 the old base pointer for ia32).
284 3) The Firm frame type which consists of all local variables
288 static int get_stack_entity_offset(be_stack_layout_t *frame, ir_entity *ent,
291 ir_type *t = get_entity_owner(ent);
292 int ofs = get_entity_offset(ent);
296 /* Find the type the entity is contained in. */
297 for (index = 0; index < N_FRAME_TYPES; ++index) {
298 if (frame->order[index] == t)
300 /* Add the size of all the types below the one of the entity to the entity's offset */
301 ofs += get_type_size_bytes(frame->order[index]);
304 /* correct the offset by the initial position of the frame pointer */
305 ofs -= frame->initial_offset;
307 /* correct the offset with the current bias. */
314 * Retrieve the entity with given offset from a frame type.
316 static ir_entity *search_ent_with_offset(ir_type *t, int offset)
320 for (i = 0, n = get_compound_n_members(t); i < n; ++i) {
321 ir_entity *ent = get_compound_member(t, i);
322 if (get_entity_offset(ent) == offset)
329 static int stack_frame_compute_initial_offset(be_stack_layout_t *frame)
331 ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
332 ir_entity *ent = search_ent_with_offset(base, 0);
335 frame->initial_offset
336 = frame->stack_dir < 0 ? get_type_size_bytes(frame->frame_type) : get_type_size_bytes(frame->between_type);
338 frame->initial_offset = get_stack_entity_offset(frame, ent, 0);
341 return frame->initial_offset;
345 * Initializes the frame layout from parts
347 * @param frame the stack layout that will be initialized
348 * @param args the stack argument layout type
349 * @param between the between layout type
350 * @param locals the method frame type
351 * @param stack_dir the stack direction: < 0 decreasing, > 0 increasing addresses
352 * @param param_map an array mapping method argument positions to the stack argument type
354 * @return the initialized stack layout
356 static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *args,
357 ir_type *between, ir_type *locals, int stack_dir,
358 ir_entity *param_map[])
360 frame->arg_type = args;
361 frame->between_type = between;
362 frame->frame_type = locals;
363 frame->initial_offset = 0;
364 frame->initial_bias = 0;
365 frame->stack_dir = stack_dir;
366 frame->order[1] = between;
367 frame->param_map = param_map;
370 frame->order[0] = args;
371 frame->order[2] = locals;
374 /* typical decreasing stack: locals have the
375 * lowest addresses, arguments the highest */
376 frame->order[0] = locals;
377 frame->order[2] = args;
383 * Returns non-zero if the call argument at given position
384 * is transfered on the stack.
386 static inline int is_on_stack(be_abi_call_t *call, int pos)
388 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
389 return arg && !arg->in_reg;
399 Adjustment of the calls inside a graph.
404 * Transform a call node into a be_Call node.
406 * @param env The ABI environment for the current irg.
407 * @param irn The call node.
408 * @param curr_sp The stack pointer node to use.
409 * @return The stack pointer after the call.
411 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp)
413 ir_graph *irg = env->birg->irg;
414 const arch_env_t *arch_env = env->birg->main_env->arch_env;
415 ir_type *call_tp = get_Call_type(irn);
416 ir_node *call_ptr = get_Call_ptr(irn);
417 int n_params = get_method_n_params(call_tp);
418 ir_node *curr_mem = get_Call_mem(irn);
419 ir_node *bl = get_nodes_block(irn);
421 int stack_dir = arch_env->stack_dir;
422 const arch_register_t *sp = arch_env->sp;
423 be_abi_call_t *call = be_abi_call_new(sp->reg_class);
424 ir_mode *mach_mode = sp->reg_class->mode;
425 struct obstack *obst = be_get_birg_obst(irg);
426 int no_alloc = call->flags.bits.frame_is_setup_on_call;
427 int n_res = get_method_n_ress(call_tp);
428 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
430 ir_node *res_proj = NULL;
431 int n_reg_params = 0;
432 int n_stack_params = 0;
435 pset_new_t destroyed_regs, states;
436 pset_new_iterator_t iter;
440 int n_reg_results = 0;
441 const arch_register_t *reg;
442 const ir_edge_t *edge;
444 int *stack_param_idx;
445 int i, n, destroy_all_regs;
448 pset_new_init(&destroyed_regs);
449 pset_new_init(&states);
451 /* Let the isa fill out the abi description for that call node. */
452 arch_env_get_call_abi(arch_env, call_tp, call);
454 /* Insert code to put the stack arguments on the stack. */
455 assert(get_Call_n_params(irn) == n_params);
456 assert(obstack_object_size(obst) == 0);
457 stack_param_idx = ALLOCAN(int, n_params);
458 for (i = 0; i < n_params; ++i) {
459 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
462 int arg_size = get_type_size_bytes(get_method_param_type(call_tp, i));
464 stack_size += round_up2(arg->space_before, arg->alignment);
465 stack_size += round_up2(arg_size, arg->alignment);
466 stack_size += round_up2(arg->space_after, arg->alignment);
468 stack_param_idx[n_stack_params++] = i;
472 /* Collect all arguments which are passed in registers. */
473 reg_param_idxs = ALLOCAN(int, n_params);
474 for (i = 0; i < n_params; ++i) {
475 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
476 if (arg && arg->in_reg) {
477 reg_param_idxs[n_reg_params++] = i;
482 * If the stack is decreasing and we do not want to store sequentially,
483 * or someone else allocated the call frame
484 * we allocate as much space on the stack all parameters need, by
485 * moving the stack pointer along the stack's direction.
487 * Note: we also have to do this for stack_size == 0, because we may have
488 * to adjust stack alignment for the call.
490 if (stack_dir < 0 && !do_seq && !no_alloc) {
491 curr_sp = be_new_IncSP(sp, bl, curr_sp, stack_size, 1);
494 dbgi = get_irn_dbg_info(irn);
495 /* If there are some parameters which shall be passed on the stack. */
496 if (n_stack_params > 0) {
498 ir_node **in = ALLOCAN(ir_node*, n_stack_params+1);
502 * Reverse list of stack parameters if call arguments are from left to right.
503 * We must them reverse again if they are pushed (not stored) and the stack
504 * direction is downwards.
506 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
507 for (i = 0; i < n_stack_params >> 1; ++i) {
508 int other = n_stack_params - i - 1;
509 int tmp = stack_param_idx[i];
510 stack_param_idx[i] = stack_param_idx[other];
511 stack_param_idx[other] = tmp;
515 curr_mem = get_Call_mem(irn);
517 in[n_in++] = curr_mem;
520 for (i = 0; i < n_stack_params; ++i) {
521 int p = stack_param_idx[i];
522 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
523 ir_node *param = get_Call_param(irn, p);
524 ir_node *addr = curr_sp;
526 ir_type *param_type = get_method_param_type(call_tp, p);
527 int param_size = get_type_size_bytes(param_type) + arg->space_after;
530 * If we wanted to build the arguments sequentially,
531 * the stack pointer for the next must be incremented,
532 * and the memory value propagated.
536 addr = curr_sp = be_new_IncSP(sp, bl, curr_sp,
537 param_size + arg->space_before, 0);
538 add_irn_dep(curr_sp, curr_mem);
540 curr_ofs += arg->space_before;
541 curr_ofs = round_up2(curr_ofs, arg->alignment);
543 /* Make the expression to compute the argument's offset. */
545 ir_mode *constmode = mach_mode;
546 if (mode_is_reference(mach_mode)) {
549 addr = new_r_Const_long(irg, constmode, curr_ofs);
550 addr = new_r_Add(bl, curr_sp, addr, mach_mode);
554 /* Insert a store for primitive arguments. */
555 if (is_atomic_type(param_type)) {
557 ir_node *mem_input = do_seq ? curr_mem : new_NoMem();
558 store = new_rd_Store(dbgi, bl, mem_input, addr, param, 0);
559 mem = new_r_Proj(store, mode_M, pn_Store_M);
561 /* Make a mem copy for compound arguments. */
564 assert(mode_is_reference(get_irn_mode(param)));
565 copy = new_rd_CopyB(dbgi, bl, curr_mem, addr, param, param_type);
566 mem = new_r_Proj(copy, mode_M, pn_CopyB_M_regular);
569 curr_ofs += param_size;
577 /* We need the sync only, if we didn't build the stores sequentially. */
579 if (n_stack_params >= 1) {
580 curr_mem = new_r_Sync(bl, n_in, in);
582 curr_mem = get_Call_mem(irn);
587 /* check for the return_twice property */
588 destroy_all_regs = 0;
589 if (is_SymConst_addr_ent(call_ptr)) {
590 ir_entity *ent = get_SymConst_entity(call_ptr);
592 if (get_entity_additional_properties(ent) & mtp_property_returns_twice)
593 destroy_all_regs = 1;
595 ir_type *call_tp = get_Call_type(irn);
597 if (get_method_additional_properties(call_tp) & mtp_property_returns_twice)
598 destroy_all_regs = 1;
601 /* Put caller save into the destroyed set and state registers in the states set */
602 for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
604 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
605 for (j = 0; j < cls->n_regs; ++j) {
606 const arch_register_t *reg = arch_register_for_index(cls, j);
608 if (destroy_all_regs || arch_register_type_is(reg, caller_save)) {
609 if (! arch_register_type_is(reg, ignore))
610 pset_new_insert(&destroyed_regs, (void *) reg);
612 if (arch_register_type_is(reg, state)) {
613 pset_new_insert(&destroyed_regs, (void*) reg);
614 pset_new_insert(&states, (void*) reg);
619 if (destroy_all_regs) {
620 /* even if destroyed all is specified, neither SP nor FP are destroyed (else bad things will happen) */
621 pset_new_remove(&destroyed_regs, arch_env->sp);
622 pset_new_remove(&destroyed_regs, arch_env->bp);
625 /* search the largest result proj number */
626 res_projs = ALLOCANZ(ir_node*, n_res);
628 foreach_out_edge(irn, edge) {
629 const ir_edge_t *res_edge;
630 ir_node *irn = get_edge_src_irn(edge);
632 if (!is_Proj(irn) || get_Proj_proj(irn) != pn_Call_T_result)
635 foreach_out_edge(irn, res_edge) {
637 ir_node *res = get_edge_src_irn(res_edge);
639 assert(is_Proj(res));
641 proj = get_Proj_proj(res);
642 assert(proj < n_res);
643 assert(res_projs[proj] == NULL);
644 res_projs[proj] = res;
650 /** TODO: this is not correct for cases where return values are passed
651 * on the stack, but no known ABI does this currently...
653 n_reg_results = n_res;
655 assert(obstack_object_size(obst) == 0);
657 in = ALLOCAN(ir_node*, n_reg_params + pset_new_size(&states));
659 /* make the back end call node and set its register requirements. */
660 for (i = 0; i < n_reg_params; ++i) {
661 in[n_ins++] = get_Call_param(irn, reg_param_idxs[i]);
664 /* add state registers ins */
665 foreach_pset_new(&states, reg, iter) {
666 const arch_register_class_t *cls = arch_register_get_class(reg);
668 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
669 ir_fprintf(stderr, "Adding %+F\n", regnode);
671 ir_node *regnode = new_r_Unknown(irg, arch_register_class_mode(cls));
672 in[n_ins++] = regnode;
674 assert(n_ins == (int) (n_reg_params + pset_new_size(&states)));
676 /* ins collected, build the call */
677 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
679 low_call = be_new_Call(dbgi, irg, bl, curr_mem, curr_sp, curr_sp,
680 n_reg_results + pn_be_Call_first_res + pset_new_size(&destroyed_regs),
681 n_ins, in, get_Call_type(irn));
682 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
685 low_call = be_new_Call(dbgi, irg, bl, curr_mem, curr_sp, call_ptr,
686 n_reg_results + pn_be_Call_first_res + pset_new_size(&destroyed_regs),
687 n_ins, in, get_Call_type(irn));
689 be_Call_set_pop(low_call, call->pop);
691 /* put the call into the list of all calls for later processing */
692 ARR_APP1(ir_node *, env->calls, low_call);
694 /* create new stack pointer */
695 curr_sp = new_r_Proj(low_call, get_irn_mode(curr_sp), pn_be_Call_sp);
696 be_set_constr_single_reg_out(low_call, pn_be_Call_sp, sp,
697 arch_register_req_type_ignore | arch_register_req_type_produces_sp);
698 arch_set_irn_register(curr_sp, sp);
700 /* now handle results */
701 for (i = 0; i < n_res; ++i) {
703 ir_node *proj = res_projs[i];
704 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
706 /* returns values on stack not supported yet */
710 shift the proj number to the right, since we will drop the
711 unspeakable Proj_T from the Call. Therefore, all real argument
712 Proj numbers must be increased by pn_be_Call_first_res
714 pn = i + pn_be_Call_first_res;
717 ir_type *res_type = get_method_res_type(call_tp, i);
718 ir_mode *mode = get_type_mode(res_type);
719 proj = new_r_Proj(low_call, mode, pn);
722 set_Proj_pred(proj, low_call);
723 set_Proj_proj(proj, pn);
727 pset_new_remove(&destroyed_regs, arg->reg);
732 Set the register class of the call address to
733 the backend provided class (default: stack pointer class)
735 be_node_set_reg_class_in(low_call, be_pos_Call_ptr, call->cls_addr);
737 DBG((dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
739 /* Set the register classes and constraints of the Call parameters. */
740 for (i = 0; i < n_reg_params; ++i) {
741 int index = reg_param_idxs[i];
742 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
743 assert(arg->reg != NULL);
745 be_set_constr_single_reg_in(low_call, be_pos_Call_first_arg + i,
749 /* Set the register constraints of the results. */
750 for (i = 0; i < n_res; ++i) {
751 ir_node *proj = res_projs[i];
752 const be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
753 int pn = get_Proj_proj(proj);
756 be_set_constr_single_reg_out(low_call, pn, arg->reg, 0);
757 arch_set_irn_register(proj, arg->reg);
759 exchange(irn, low_call);
761 /* kill the ProjT node */
762 if (res_proj != NULL) {
766 /* Make additional projs for the caller save registers
767 and the Keep node which keeps them alive. */
769 const arch_register_t *reg;
773 int curr_res_proj = pn_be_Call_first_res + n_reg_results;
774 pset_new_iterator_t iter;
777 n_ins = (int)pset_new_size(&destroyed_regs) + n_reg_results + 1;
778 in = ALLOCAN(ir_node *, n_ins);
780 /* also keep the stack pointer */
781 set_irn_link(curr_sp, (void*) sp);
784 foreach_pset_new(&destroyed_regs, reg, iter) {
785 ir_node *proj = new_r_Proj(low_call, reg->reg_class->mode, curr_res_proj);
787 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
788 be_set_constr_single_reg_out(low_call, curr_res_proj, reg, 0);
789 arch_set_irn_register(proj, reg);
791 set_irn_link(proj, (void*) reg);
796 for (i = 0; i < n_reg_results; ++i) {
797 ir_node *proj = res_projs[i];
798 const arch_register_t *reg = arch_get_irn_register(proj);
799 set_irn_link(proj, (void*) reg);
804 /* create the Keep for the caller save registers */
805 keep = be_new_Keep(bl, n, in);
806 for (i = 0; i < n; ++i) {
807 const arch_register_t *reg = get_irn_link(in[i]);
808 be_node_set_reg_class_in(keep, i, reg->reg_class);
812 /* Clean up the stack. */
813 assert(stack_size >= call->pop);
814 stack_size -= call->pop;
816 if (stack_size > 0) {
817 ir_node *mem_proj = NULL;
819 foreach_out_edge(low_call, edge) {
820 ir_node *irn = get_edge_src_irn(edge);
821 if (is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
828 mem_proj = new_r_Proj(low_call, mode_M, pn_be_Call_M_regular);
829 keep_alive(mem_proj);
832 /* Clean up the stack frame or revert alignment fixes if we allocated it */
834 curr_sp = be_new_IncSP(sp, bl, curr_sp, -stack_size, 0);
837 be_abi_call_free(call);
839 pset_new_destroy(&states);
840 pset_new_destroy(&destroyed_regs);
846 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
848 * @param alignment the minimum stack alignment
849 * @param size the node containing the non-aligned size
850 * @param block the block where new nodes are allocated on
851 * @param dbg debug info for new nodes
853 * @return a node representing the aligned size
855 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size,
856 ir_node *block, dbg_info *dbg)
858 if (stack_alignment > 1) {
864 assert(is_po2(stack_alignment));
866 mode = get_irn_mode(size);
867 tv = new_tarval_from_long(stack_alignment-1, mode);
868 irg = get_Block_irg(block);
869 mask = new_r_Const(irg, tv);
870 size = new_rd_Add(dbg, block, size, mask, mode);
872 tv = new_tarval_from_long(-(long)stack_alignment, mode);
873 mask = new_r_Const(irg, tv);
874 size = new_rd_And(dbg, block, size, mask, mode);
880 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
882 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
891 const ir_edge_t *edge;
896 unsigned stack_alignment;
898 assert(get_Alloc_where(alloc) == stack_alloc);
900 block = get_nodes_block(alloc);
901 irg = get_Block_irg(block);
904 type = get_Alloc_type(alloc);
906 foreach_out_edge(alloc, edge) {
907 ir_node *irn = get_edge_src_irn(edge);
909 assert(is_Proj(irn));
910 switch (get_Proj_proj(irn)) {
922 /* Beware: currently Alloc nodes without a result might happen,
923 only escape analysis kills them and this phase runs only for object
924 oriented source. We kill the Alloc here. */
925 if (alloc_res == NULL && alloc_mem) {
926 exchange(alloc_mem, get_Alloc_mem(alloc));
930 dbg = get_irn_dbg_info(alloc);
931 count = get_Alloc_count(alloc);
933 /* we might need to multiply the count with the element size */
934 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
935 ir_mode *mode = get_irn_mode(count);
936 tarval *tv = new_tarval_from_long(get_type_size_bytes(type),
938 ir_node *cnst = new_rd_Const(dbg, irg, tv);
939 size = new_rd_Mul(dbg, block, count, cnst, mode);
944 /* The stack pointer will be modified in an unknown manner.
945 We cannot omit it. */
946 env->call->flags.bits.try_omit_fp = 0;
948 stack_alignment = 1 << env->arch_env->stack_alignment;
949 size = adjust_alloc_size(stack_alignment, size, block, dbg);
950 new_alloc = be_new_AddSP(env->arch_env->sp, block, curr_sp, size);
951 set_irn_dbg_info(new_alloc, dbg);
953 if (alloc_mem != NULL) {
957 addsp_mem = new_r_Proj(new_alloc, mode_M, pn_be_AddSP_M);
959 /* We need to sync the output mem of the AddSP with the input mem
960 edge into the alloc node. */
961 ins[0] = get_Alloc_mem(alloc);
963 sync = new_r_Sync(block, 2, ins);
965 exchange(alloc_mem, sync);
968 exchange(alloc, new_alloc);
970 /* fix projnum of alloca res */
971 set_Proj_proj(alloc_res, pn_be_AddSP_res);
973 curr_sp = new_r_Proj(new_alloc, get_irn_mode(curr_sp), pn_be_AddSP_sp);
980 * The Free is transformed into a back end free node and connected to the stack nodes.
982 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
986 ir_node *subsp, *mem, *res, *size, *sync;
990 unsigned stack_alignment;
993 assert(get_Free_where(free) == stack_alloc);
995 block = get_nodes_block(free);
996 irg = get_irn_irg(block);
997 type = get_Free_type(free);
998 sp_mode = env->arch_env->sp->reg_class->mode;
999 dbg = get_irn_dbg_info(free);
1001 /* we might need to multiply the size with the element size */
1002 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
1003 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
1004 ir_node *cnst = new_rd_Const(dbg, irg, tv);
1005 ir_node *mul = new_rd_Mul(dbg, block, get_Free_size(free),
1009 size = get_Free_size(free);
1012 stack_alignment = 1 << env->arch_env->stack_alignment;
1013 size = adjust_alloc_size(stack_alignment, size, block, dbg);
1015 /* The stack pointer will be modified in an unknown manner.
1016 We cannot omit it. */
1017 env->call->flags.bits.try_omit_fp = 0;
1018 subsp = be_new_SubSP(env->arch_env->sp, block, curr_sp, size);
1019 set_irn_dbg_info(subsp, dbg);
1021 mem = new_r_Proj(subsp, mode_M, pn_be_SubSP_M);
1022 res = new_r_Proj(subsp, sp_mode, pn_be_SubSP_sp);
1024 /* we need to sync the memory */
1025 in[0] = get_Free_mem(free);
1027 sync = new_r_Sync(block, 2, in);
1029 /* and make the AddSP dependent on the former memory */
1030 add_irn_dep(subsp, get_Free_mem(free));
1033 exchange(free, sync);
1040 * Check if a node is somehow data dependent on another one.
1041 * both nodes must be in the same basic block.
1042 * @param n1 The first node.
1043 * @param n2 The second node.
1044 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1046 static int dependent_on(ir_node *n1, ir_node *n2)
1048 assert(get_nodes_block(n1) == get_nodes_block(n2));
1050 return heights_reachable_in_block(ir_heights, n1, n2);
1053 static int cmp_call_dependency(const void *c1, const void *c2)
1055 ir_node *n1 = *(ir_node **) c1;
1056 ir_node *n2 = *(ir_node **) c2;
1059 Classical qsort() comparison function behavior:
1060 0 if both elements are equal
1061 1 if second is "smaller" that first
1062 -1 if first is "smaller" that second
1064 if (dependent_on(n1, n2))
1067 if (dependent_on(n2, n1))
1070 /* The nodes have no depth order, but we need a total order because qsort()
1072 return get_irn_idx(n1) - get_irn_idx(n2);
1076 * Walker: links all Call/Alloc/Free nodes to the Block they are contained.
1077 * Clears the irg_is_leaf flag if a Call is detected.
1079 static void link_ops_in_block_walker(ir_node *irn, void *data)
1081 be_abi_irg_t *env = data;
1082 ir_opcode code = get_irn_opcode(irn);
1084 if (code == iro_Call ||
1085 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1086 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1087 ir_node *bl = get_nodes_block(irn);
1088 void *save = get_irn_link(bl);
1090 if (code == iro_Call)
1091 env->call->flags.bits.irg_is_leaf = 0;
1093 set_irn_link(irn, save);
1094 set_irn_link(bl, irn);
1097 if (code == iro_Builtin && get_Builtin_kind(irn) == ir_bk_return_address) {
1098 ir_node *param = get_Builtin_param(irn, 0);
1099 tarval *tv = get_Const_tarval(param);
1100 unsigned long value = get_tarval_long(tv);
1101 /* use ebp, so the climbframe algo works... */
1103 env->call->flags.bits.try_omit_fp = 0;
1110 * Process all Call/Alloc/Free nodes inside a basic block.
1111 * Note that the link field of the block must contain a linked list of all
1112 * Call nodes inside the Block. We first order this list according to data dependency
1113 * and that connect the calls together.
1115 static void process_ops_in_block(ir_node *bl, void *data)
1117 be_abi_irg_t *env = data;
1118 ir_node *curr_sp = env->init_sp;
1125 for (irn = get_irn_link(bl); irn != NULL; irn = get_irn_link(irn)) {
1129 nodes = ALLOCAN(ir_node*, n_nodes);
1130 for (irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n) {
1134 /* If there were call nodes in the block. */
1139 /* order the call nodes according to data dependency */
1140 qsort(nodes, n_nodes, sizeof(nodes[0]), cmp_call_dependency);
1142 for (i = n_nodes - 1; i >= 0; --i) {
1143 ir_node *irn = nodes[i];
1145 DBG((dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1146 switch (get_irn_opcode(irn)) {
1149 /* The stack pointer will be modified due to a call. */
1150 env->call->flags.bits.try_omit_fp = 0;
1152 curr_sp = adjust_call(env, irn, curr_sp);
1155 if (get_Alloc_where(irn) == stack_alloc)
1156 curr_sp = adjust_alloc(env, irn, curr_sp);
1159 if (get_Free_where(irn) == stack_alloc)
1160 curr_sp = adjust_free(env, irn, curr_sp);
1163 panic("invalid call");
1167 /* Keep the last stack state in the block by tying it to Keep node,
1168 * the proj from calls is already kept */
1169 if (curr_sp != env->init_sp &&
1170 !(is_Proj(curr_sp) && be_is_Call(get_Proj_pred(curr_sp)))) {
1172 keep = be_new_Keep(bl, 1, nodes);
1173 pmap_insert(env->keep_map, bl, keep);
1177 set_irn_link(bl, curr_sp);
1181 * Adjust all call nodes in the graph to the ABI conventions.
1183 static void process_calls(be_abi_irg_t *env)
1185 ir_graph *irg = env->birg->irg;
1187 env->call->flags.bits.irg_is_leaf = 1;
1188 irg_walk_graph(irg, firm_clear_link, link_ops_in_block_walker, env);
1190 ir_heights = heights_new(env->birg->irg);
1191 irg_block_walk_graph(irg, NULL, process_ops_in_block, env);
1192 heights_free(ir_heights);
1196 * Computes the stack argument layout type.
1197 * Changes a possibly allocated value param type by moving
1198 * entities to the stack layout type.
1200 * @param env the ABI environment
1201 * @param call the current call ABI
1202 * @param method_type the method type
1203 * @param val_param_tp the value parameter type, will be destroyed
1204 * @param param_map an array mapping method arguments to the stack layout type
1206 * @return the stack argument layout type
1208 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call,
1209 ir_type *method_type, ir_type *val_param_tp,
1210 ir_entity ***param_map)
1212 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1213 int inc = env->birg->main_env->arch_env->stack_dir * dir;
1214 int n = get_method_n_params(method_type);
1215 int curr = inc > 0 ? 0 : n - 1;
1216 struct obstack *obst = be_get_birg_obst(env->irg);
1222 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1225 *param_map = map = OALLOCN(obst, ir_entity*, n);
1226 res = new_type_struct(id_mangle_u(id, new_id_from_chars("arg_type", 8)));
1227 for (i = 0; i < n; ++i, curr += inc) {
1228 ir_type *param_type = get_method_param_type(method_type, curr);
1229 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1232 if (arg->on_stack) {
1233 if (val_param_tp != NULL) {
1234 /* the entity was already created, create a copy in the param type */
1235 ir_entity *val_ent = get_method_value_param_ent(method_type, i);
1236 arg->stack_ent = copy_entity_own(val_ent, res);
1237 set_entity_link(val_ent, arg->stack_ent);
1238 set_entity_link(arg->stack_ent, NULL);
1240 /* create a new entity */
1241 snprintf(buf, sizeof(buf), "param_%d", i);
1242 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1244 ofs += arg->space_before;
1245 ofs = round_up2(ofs, arg->alignment);
1246 set_entity_offset(arg->stack_ent, ofs);
1247 ofs += arg->space_after;
1248 ofs += get_type_size_bytes(param_type);
1249 map[i] = arg->stack_ent;
1252 set_type_size_bytes(res, ofs);
1253 set_type_state(res, layout_fixed);
1258 const arch_register_t *reg;
1262 static int cmp_regs(const void *a, const void *b)
1264 const reg_node_map_t *p = a;
1265 const reg_node_map_t *q = b;
1267 if (p->reg->reg_class == q->reg->reg_class)
1268 return p->reg->index - q->reg->index;
1270 return p->reg->reg_class - q->reg->reg_class;
1273 static void reg_map_to_arr(reg_node_map_t *res, pmap *reg_map)
1276 int n = pmap_count(reg_map);
1279 foreach_pmap(reg_map, ent) {
1280 res[i].reg = ent->key;
1281 res[i].irn = ent->value;
1285 qsort(res, n, sizeof(res[0]), cmp_regs);
1289 * Creates a barrier.
1291 static ir_node *create_barrier(ir_node *bl, ir_node **mem, pmap *regs,
1294 int n_regs = pmap_count(regs);
1300 in = ALLOCAN(ir_node*, n_regs+1);
1301 rm = ALLOCAN(reg_node_map_t, n_regs);
1302 reg_map_to_arr(rm, regs);
1303 for (n = 0; n < n_regs; ++n) {
1311 irn = be_new_Barrier(bl, n, in);
1313 for (n = 0; n < n_regs; ++n) {
1314 ir_node *pred = rm[n].irn;
1315 const arch_register_t *reg = rm[n].reg;
1316 arch_register_type_t add_type = 0;
1318 const backend_info_t *info;
1320 /* stupid workaround for now... as not all nodes report register
1322 info = be_get_info(skip_Proj(pred));
1323 if (info != NULL && info->out_infos != NULL) {
1324 const arch_register_req_t *ireq = arch_get_register_req_out(pred);
1325 if (ireq->type & arch_register_req_type_ignore)
1326 add_type |= arch_register_req_type_ignore;
1327 if (ireq->type & arch_register_req_type_produces_sp)
1328 add_type |= arch_register_req_type_produces_sp;
1331 proj = new_r_Proj(irn, get_irn_mode(pred), n);
1332 be_node_set_reg_class_in(irn, n, reg->reg_class);
1334 be_set_constr_single_reg_in(irn, n, reg, 0);
1335 be_set_constr_single_reg_out(irn, n, reg, add_type);
1336 arch_set_irn_register(proj, reg);
1338 pmap_insert(regs, (void *) reg, proj);
1342 *mem = new_r_Proj(irn, mode_M, n);
1349 * Creates a be_Return for a Return node.
1351 * @param @env the abi environment
1352 * @param irn the Return node or NULL if there was none
1353 * @param bl the block where the be_Retun should be placed
1354 * @param mem the current memory
1355 * @param n_res number of return results
1357 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl,
1358 ir_node *mem, int n_res)
1360 be_abi_call_t *call = env->call;
1361 const arch_env_t *arch_env = env->birg->main_env->arch_env;
1363 pmap *reg_map = pmap_create();
1364 ir_node *keep = pmap_get(env->keep_map, bl);
1371 const arch_register_t **regs;
1375 get the valid stack node in this block.
1376 If we had a call in that block there is a Keep constructed by process_calls()
1377 which points to the last stack modification in that block. we'll use
1378 it then. Else we use the stack from the start block and let
1379 the ssa construction fix the usage.
1381 stack = be_abi_reg_map_get(env->regs, arch_env->sp);
1383 stack = get_irn_n(keep, 0);
1385 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1388 /* Insert results for Return into the register map. */
1389 for (i = 0; i < n_res; ++i) {
1390 ir_node *res = get_Return_res(irn, i);
1391 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1392 assert(arg->in_reg && "return value must be passed in register");
1393 pmap_insert(reg_map, (void *) arg->reg, res);
1396 /* Add uses of the callee save registers. */
1397 foreach_pmap(env->regs, ent) {
1398 const arch_register_t *reg = ent->key;
1399 if (arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1400 pmap_insert(reg_map, ent->key, ent->value);
1403 be_abi_reg_map_set(reg_map, arch_env->sp, stack);
1405 /* Make the Epilogue node and call the arch's epilogue maker. */
1406 create_barrier(bl, &mem, reg_map, 1);
1407 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1410 Maximum size of the in array for Return nodes is
1411 return args + callee save/ignore registers + memory + stack pointer
1413 in_max = pmap_count(reg_map) + n_res + 2;
1415 in = ALLOCAN(ir_node*, in_max);
1416 regs = ALLOCAN(arch_register_t const*, in_max);
1419 in[1] = be_abi_reg_map_get(reg_map, arch_env->sp);
1421 regs[1] = arch_env->sp;
1424 /* clear SP entry, since it has already been grown. */
1425 pmap_insert(reg_map, (void *) arch_env->sp, NULL);
1426 for (i = 0; i < n_res; ++i) {
1427 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1429 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1430 regs[n++] = arg->reg;
1432 /* Clear the map entry to mark the register as processed. */
1433 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1436 /* grow the rest of the stuff. */
1437 foreach_pmap(reg_map, ent) {
1440 regs[n++] = ent->key;
1444 /* The in array for the new back end return is now ready. */
1446 dbgi = get_irn_dbg_info(irn);
1450 /* we have to pop the shadow parameter in in case of struct returns */
1452 ret = be_new_Return(dbgi, env->birg->irg, bl, n_res, pop, n, in);
1454 /* Set the register classes of the return's parameter accordingly. */
1455 for (i = 0; i < n; ++i) {
1456 if (regs[i] == NULL)
1459 be_node_set_reg_class_in(ret, i, regs[i]->reg_class);
1462 /* Free the space of the Epilog's in array and the register <-> proj map. */
1463 pmap_destroy(reg_map);
1468 typedef struct ent_pos_pair ent_pos_pair;
1469 struct ent_pos_pair {
1470 ir_entity *ent; /**< a value param entity */
1471 int pos; /**< its parameter number */
1472 ent_pos_pair *next; /**< for linking */
1475 typedef struct lower_frame_sels_env_t {
1476 ent_pos_pair *value_param_list; /**< the list of all value param entities */
1477 ir_node *frame; /**< the current frame */
1478 const arch_register_class_t *sp_class; /**< register class of the stack pointer */
1479 const arch_register_class_t *link_class; /**< register class of the link pointer */
1480 ir_type *value_tp; /**< the value type if any */
1481 ir_type *frame_tp; /**< the frame type */
1482 int static_link_pos; /**< argument number of the hidden static link */
1483 } lower_frame_sels_env_t;
1486 * Return an entity from the backend for an value param entity.
1488 * @param ent an value param type entity
1489 * @param ctx context
1491 static ir_entity *get_argument_entity(ir_entity *ent, lower_frame_sels_env_t *ctx)
1493 ir_entity *argument_ent = get_entity_link(ent);
1495 if (argument_ent == NULL) {
1496 /* we have NO argument entity yet: This is bad, as we will
1497 * need one for backing store.
1500 ir_type *frame_tp = ctx->frame_tp;
1501 unsigned offset = get_type_size_bytes(frame_tp);
1502 ir_type *tp = get_entity_type(ent);
1503 unsigned align = get_type_alignment_bytes(tp);
1505 offset += align - 1;
1506 offset &= ~(align - 1);
1508 argument_ent = copy_entity_own(ent, frame_tp);
1510 /* must be automatic to set a fixed layout */
1511 set_entity_offset(argument_ent, offset);
1512 offset += get_type_size_bytes(tp);
1514 set_type_size_bytes(frame_tp, offset);
1515 set_entity_link(ent, argument_ent);
1517 return argument_ent;
1520 * Walker: Replaces Sels of frame type and
1521 * value param type entities by FrameAddress.
1522 * Links all used entities.
1524 static void lower_frame_sels_walker(ir_node *irn, void *data)
1526 lower_frame_sels_env_t *ctx = data;
1529 ir_node *ptr = get_Sel_ptr(irn);
1531 if (ptr == ctx->frame) {
1532 ir_entity *ent = get_Sel_entity(irn);
1533 ir_node *bl = get_nodes_block(irn);
1536 int is_value_param = 0;
1538 if (get_entity_owner(ent) == ctx->value_tp) {
1541 /* replace by its copy from the argument type */
1542 pos = get_struct_member_index(ctx->value_tp, ent);
1543 ent = get_argument_entity(ent, ctx);
1546 nw = be_new_FrameAddr(ctx->sp_class, bl, ctx->frame, ent);
1549 /* check, if it's a param Sel and if have not seen this entity before */
1550 if (is_value_param && get_entity_link(ent) == NULL) {
1556 ARR_APP1(ent_pos_pair, ctx->value_param_list, pair);
1558 set_entity_link(ent, ctx->value_param_list);
1565 * Check if a value parameter is transmitted as a register.
1566 * This might happen if the address of an parameter is taken which is
1567 * transmitted in registers.
1569 * Note that on some architectures this case must be handled specially
1570 * because the place of the backing store is determined by their ABI.
1572 * In the default case we move the entity to the frame type and create
1573 * a backing store into the first block.
1575 static void fix_address_of_parameter_access(be_abi_irg_t *env, ent_pos_pair *value_param_list)
1577 be_abi_call_t *call = env->call;
1578 ir_graph *irg = env->birg->irg;
1579 ent_pos_pair *entry, *new_list;
1581 int i, n = ARR_LEN(value_param_list);
1584 for (i = 0; i < n; ++i) {
1585 int pos = value_param_list[i].pos;
1586 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
1589 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", pos));
1590 value_param_list[i].next = new_list;
1591 new_list = &value_param_list[i];
1594 if (new_list != NULL) {
1595 /* ok, change the graph */
1596 ir_node *start_bl = get_irg_start_block(irg);
1597 ir_node *first_bl = get_first_block_succ(start_bl);
1598 ir_node *frame, *imem, *nmem, *store, *mem, *args;
1599 optimization_state_t state;
1602 assert(first_bl && first_bl != start_bl);
1603 /* we had already removed critical edges, so the following
1604 assertion should be always true. */
1605 assert(get_Block_n_cfgpreds(first_bl) == 1);
1607 /* now create backing stores */
1608 frame = get_irg_frame(irg);
1609 imem = get_irg_initial_mem(irg);
1611 save_optimization_state(&state);
1613 nmem = new_r_Proj(get_irg_start(irg), mode_M, pn_Start_M);
1614 restore_optimization_state(&state);
1616 /* reroute all edges to the new memory source */
1617 edges_reroute(imem, nmem, irg);
1621 args = get_irg_args(irg);
1622 for (entry = new_list; entry != NULL; entry = entry->next) {
1624 ir_type *tp = get_entity_type(entry->ent);
1625 ir_mode *mode = get_type_mode(tp);
1628 /* address for the backing store */
1629 addr = be_new_FrameAddr(env->arch_env->sp->reg_class, first_bl, frame, entry->ent);
1632 mem = new_r_Proj(store, mode_M, pn_Store_M);
1634 /* the backing store itself */
1635 store = new_r_Store(first_bl, mem, addr,
1636 new_r_Proj(args, mode, i), 0);
1638 /* the new memory Proj gets the last Proj from store */
1639 set_Proj_pred(nmem, store);
1640 set_Proj_proj(nmem, pn_Store_M);
1642 /* move all entities to the frame type */
1643 frame_tp = get_irg_frame_type(irg);
1644 offset = get_type_size_bytes(frame_tp);
1646 /* we will add new entities: set the layout to undefined */
1647 assert(get_type_state(frame_tp) == layout_fixed);
1648 set_type_state(frame_tp, layout_undefined);
1649 for (entry = new_list; entry != NULL; entry = entry->next) {
1650 ir_entity *ent = entry->ent;
1652 /* If the entity is still on the argument type, move it to the frame type.
1653 This happens if the value_param type was build due to compound
1655 if (get_entity_owner(ent) != frame_tp) {
1656 ir_type *tp = get_entity_type(ent);
1657 unsigned align = get_type_alignment_bytes(tp);
1659 offset += align - 1;
1660 offset &= ~(align - 1);
1661 set_entity_owner(ent, frame_tp);
1662 add_class_member(frame_tp, ent);
1663 /* must be automatic to set a fixed layout */
1664 set_entity_offset(ent, offset);
1665 offset += get_type_size_bytes(tp);
1668 set_type_size_bytes(frame_tp, offset);
1669 /* fix the layout again */
1670 set_type_state(frame_tp, layout_fixed);
1675 * The start block has no jump, instead it has an initial exec Proj.
1676 * The backend wants to handle all blocks the same way, so we replace
1677 * the out cfg edge with a real jump.
1679 static void fix_start_block(ir_graph *irg)
1681 ir_node *initial_X = get_irg_initial_exec(irg);
1682 ir_node *start_block = get_irg_start_block(irg);
1683 const ir_edge_t *edge;
1685 assert(is_Proj(initial_X));
1687 foreach_out_edge(initial_X, edge) {
1688 ir_node *block = get_edge_src_irn(edge);
1690 if (is_Anchor(block))
1692 if (block != start_block) {
1693 ir_node *jmp = new_r_Jmp(start_block);
1694 set_Block_cfgpred(block, get_edge_src_pos(edge), jmp);
1695 set_irg_initial_exec(irg, jmp);
1699 panic("Initial exec has no follow block in %+F", irg);
1703 * Update the entity of Sels to the outer value parameters.
1705 static void update_outer_frame_sels(ir_node *irn, void *env)
1707 lower_frame_sels_env_t *ctx = env;
1714 ptr = get_Sel_ptr(irn);
1715 if (! is_arg_Proj(ptr))
1717 if (get_Proj_proj(ptr) != ctx->static_link_pos)
1719 ent = get_Sel_entity(irn);
1721 if (get_entity_owner(ent) == ctx->value_tp) {
1722 /* replace by its copy from the argument type */
1723 pos = get_struct_member_index(ctx->value_tp, ent);
1724 ent = get_argument_entity(ent, ctx);
1725 set_Sel_entity(irn, ent);
1727 /* check, if we have not seen this entity before */
1728 if (get_entity_link(ent) == NULL) {
1734 ARR_APP1(ent_pos_pair, ctx->value_param_list, pair);
1736 set_entity_link(ent, ctx->value_param_list);
1742 * Fix access to outer local variables.
1744 static void fix_outer_variable_access(be_abi_irg_t *env,
1745 lower_frame_sels_env_t *ctx)
1751 for (i = get_class_n_members(ctx->frame_tp) - 1; i >= 0; --i) {
1752 ir_entity *ent = get_class_member(ctx->frame_tp, i);
1754 if (! is_method_entity(ent))
1757 irg = get_entity_irg(ent);
1762 * FIXME: find the number of the static link parameter
1763 * for now we assume 0 here
1765 ctx->static_link_pos = 0;
1767 irg_walk_graph(irg, NULL, update_outer_frame_sels, ctx);
1772 * Modify the irg itself and the frame type.
1774 static void modify_irg(be_abi_irg_t *env)
1776 be_abi_call_t *call = env->call;
1777 const arch_env_t *arch_env= env->birg->main_env->arch_env;
1778 const arch_register_t *sp = arch_env->sp;
1779 ir_graph *irg = env->birg->irg;
1782 ir_node *new_mem_proj;
1784 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1785 struct obstack *obst = be_get_birg_obst(irg);
1790 unsigned frame_size;
1793 const arch_register_t *fp_reg;
1794 ir_node *frame_pointer;
1798 const ir_edge_t *edge;
1799 ir_type *arg_type, *bet_type, *tp;
1800 lower_frame_sels_env_t ctx;
1801 ir_entity **param_map;
1803 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1805 /* Must fetch memory here, otherwise the start Barrier gets the wrong
1806 * memory, which leads to loops in the DAG. */
1807 old_mem = get_irg_initial_mem(irg);
1809 irp_reserve_resources(irp, IR_RESOURCE_ENTITY_LINK);
1811 /* set the links of all frame entities to NULL, we use it
1812 to detect if an entity is already linked in the value_param_list */
1813 tp = get_method_value_param_type(method_type);
1816 /* clear the links of the clone type, let the
1817 original entities point to its clones */
1818 for (i = get_struct_n_members(tp) - 1; i >= 0; --i) {
1819 ir_entity *mem = get_struct_member(tp, i);
1820 set_entity_link(mem, NULL);
1824 arg_type = compute_arg_type(env, call, method_type, tp, ¶m_map);
1826 /* Convert the Sel nodes in the irg to frame addr nodes: */
1827 ctx.value_param_list = NEW_ARR_F(ent_pos_pair, 0);
1828 ctx.frame = get_irg_frame(irg);
1829 ctx.sp_class = env->arch_env->sp->reg_class;
1830 ctx.link_class = env->arch_env->link_class;
1831 ctx.frame_tp = get_irg_frame_type(irg);
1833 /* layout the stackframe now */
1834 if (get_type_state(ctx.frame_tp) == layout_undefined) {
1835 default_layout_compound_type(ctx.frame_tp);
1838 /* we will possible add new entities to the frame: set the layout to undefined */
1839 assert(get_type_state(ctx.frame_tp) == layout_fixed);
1840 set_type_state(ctx.frame_tp, layout_undefined);
1842 irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
1844 /* fix the frame type layout again */
1845 set_type_state(ctx.frame_tp, layout_fixed);
1846 /* align stackframe to 4 byte */
1847 frame_size = get_type_size_bytes(ctx.frame_tp);
1848 if (frame_size % 4 != 0) {
1849 set_type_size_bytes(ctx.frame_tp, frame_size + 4 - (frame_size % 4));
1852 env->regs = pmap_create();
1854 n_params = get_method_n_params(method_type);
1855 args = OALLOCNZ(obst, ir_node*, n_params);
1858 * for inner function we must now fix access to outer frame entities.
1860 fix_outer_variable_access(env, &ctx);
1862 /* Check if a value parameter is transmitted as a register.
1863 * This might happen if the address of an parameter is taken which is
1864 * transmitted in registers.
1866 * Note that on some architectures this case must be handled specially
1867 * because the place of the backing store is determined by their ABI.
1869 * In the default case we move the entity to the frame type and create
1870 * a backing store into the first block.
1872 fix_address_of_parameter_access(env, ctx.value_param_list);
1874 DEL_ARR_F(ctx.value_param_list);
1875 irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK);
1877 /* Fill the argument vector */
1878 arg_tuple = get_irg_args(irg);
1879 foreach_out_edge(arg_tuple, edge) {
1880 ir_node *irn = get_edge_src_irn(edge);
1881 if (! is_Anchor(irn)) {
1882 int nr = get_Proj_proj(irn);
1884 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1888 bet_type = call->cb->get_between_type(env->cb);
1889 stack_frame_init(&env->frame, arg_type, bet_type, get_irg_frame_type(irg), arch_env->stack_dir, param_map);
1891 /* Count the register params and add them to the number of Projs for the RegParams node */
1892 for (i = 0; i < n_params; ++i) {
1893 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1894 if (arg->in_reg && args[i]) {
1895 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1896 assert(i == get_Proj_proj(args[i]));
1898 /* For now, associate the register with the old Proj from Start representing that argument. */
1899 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1900 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1904 /* Collect all callee-save registers */
1905 for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
1906 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
1907 for (j = 0; j < cls->n_regs; ++j) {
1908 const arch_register_t *reg = &cls->regs[j];
1909 if (arch_register_type_is(reg, callee_save) ||
1910 arch_register_type_is(reg, state)) {
1911 pmap_insert(env->regs, (void *) reg, NULL);
1916 /* handle start block here (place a jump in the block) */
1917 fix_start_block(irg);
1919 pmap_insert(env->regs, (void *) sp, NULL);
1920 pmap_insert(env->regs, (void *) arch_env->bp, NULL);
1921 start_bl = get_irg_start_block(irg);
1922 env->start = be_new_Start(NULL, start_bl, pmap_count(env->regs) + 1);
1925 * make proj nodes for the callee save registers.
1926 * memorize them, since Return nodes get those as inputs.
1928 * Note, that if a register corresponds to an argument, the regs map contains
1929 * the old Proj from start for that argument.
1932 rm = ALLOCAN(reg_node_map_t, pmap_count(env->regs));
1933 reg_map_to_arr(rm, env->regs);
1934 for (i = 0, n = pmap_count(env->regs); i < n; ++i) {
1935 arch_register_t *reg = (void *) rm[i].reg;
1936 ir_mode *mode = reg->reg_class->mode;
1938 arch_register_req_type_t add_type = 0;
1942 add_type |= arch_register_req_type_produces_sp | arch_register_req_type_ignore;
1945 proj = new_r_Proj(env->start, mode, nr + 1);
1946 pmap_insert(env->regs, (void *) reg, proj);
1947 be_set_constr_single_reg_out(env->start, nr + 1, reg, add_type);
1948 arch_set_irn_register(proj, reg);
1950 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1953 /* create a new initial memory proj */
1954 assert(is_Proj(old_mem));
1955 arch_set_out_register_req(env->start, 0, arch_no_register_req);
1956 new_mem_proj = new_r_Proj(env->start, mode_M, 0);
1958 set_irg_initial_mem(irg, mem);
1960 /* Generate the Prologue */
1961 fp_reg = call->cb->prologue(env->cb, &mem, env->regs, &env->frame.initial_bias);
1963 /* do the stack allocation BEFORE the barrier, or spill code
1964 might be added before it */
1965 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1966 env->init_sp = be_new_IncSP(sp, start_bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND, 0);
1967 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1969 create_barrier(start_bl, &mem, env->regs, 0);
1971 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1972 arch_set_irn_register(env->init_sp, sp);
1974 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1975 set_irg_frame(irg, frame_pointer);
1976 pset_insert_ptr(env->ignore_regs, fp_reg);
1978 /* rewire old mem users to new mem */
1979 exchange(old_mem, mem);
1981 /* keep the mem (for functions with an endless loop = no return) */
1984 set_irg_initial_mem(irg, mem);
1986 /* Now, introduce stack param nodes for all parameters passed on the stack */
1987 for (i = 0; i < n_params; ++i) {
1988 ir_node *arg_proj = args[i];
1989 ir_node *repl = NULL;
1991 if (arg_proj != NULL) {
1992 be_abi_call_arg_t *arg;
1993 ir_type *param_type;
1994 int nr = get_Proj_proj(arg_proj);
1997 nr = MIN(nr, n_params);
1998 arg = get_call_arg(call, 0, nr);
1999 param_type = get_method_param_type(method_type, nr);
2002 repl = pmap_get(env->regs, (void *) arg->reg);
2003 } else if (arg->on_stack) {
2004 ir_node *addr = be_new_FrameAddr(sp->reg_class, start_bl, frame_pointer, arg->stack_ent);
2006 /* For atomic parameters which are actually used, we create a Load node. */
2007 if (is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
2008 ir_mode *mode = get_type_mode(param_type);
2009 ir_mode *load_mode = arg->load_mode;
2011 ir_node *load = new_r_Load(start_bl, new_NoMem(), addr, load_mode, cons_floats);
2012 repl = new_r_Proj(load, load_mode, pn_Load_res);
2014 if (mode != load_mode) {
2015 repl = new_r_Conv(start_bl, repl, mode);
2018 /* The stack parameter is not primitive (it is a struct or array),
2019 * we thus will create a node representing the parameter's address
2025 assert(repl != NULL);
2027 /* Beware: the mode of the register parameters is always the mode of the register class
2028 which may be wrong. Add Conv's then. */
2029 mode = get_irn_mode(args[i]);
2030 if (mode != get_irn_mode(repl)) {
2031 repl = new_r_Conv(get_nodes_block(repl), repl, mode);
2033 exchange(args[i], repl);
2037 /* the arg proj is not needed anymore now and should be only used by the anchor */
2038 assert(get_irn_n_edges(arg_tuple) == 1);
2039 kill_node(arg_tuple);
2040 set_irg_args(irg, new_r_Bad(irg));
2042 /* All Return nodes hang on the End node, so look for them there. */
2043 end = get_irg_end_block(irg);
2044 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
2045 ir_node *irn = get_Block_cfgpred(end, i);
2047 if (is_Return(irn)) {
2048 ir_node *blk = get_nodes_block(irn);
2049 ir_node *mem = get_Return_mem(irn);
2050 ir_node *ret = create_be_return(env, irn, blk, mem, get_Return_n_ress(irn));
2055 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
2056 the code is dead and will never be executed. */
2059 /** Fix the state inputs of calls that still hang on unknowns */
2060 static void fix_call_state_inputs(be_abi_irg_t *env)
2062 const arch_env_t *arch_env = env->arch_env;
2064 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
2066 /* Collect caller save registers */
2067 n = arch_env_get_n_reg_class(arch_env);
2068 for (i = 0; i < n; ++i) {
2070 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
2071 for (j = 0; j < cls->n_regs; ++j) {
2072 const arch_register_t *reg = arch_register_for_index(cls, j);
2073 if (arch_register_type_is(reg, state)) {
2074 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
2079 n = ARR_LEN(env->calls);
2080 n_states = ARR_LEN(stateregs);
2081 for (i = 0; i < n; ++i) {
2083 ir_node *call = env->calls[i];
2085 arity = get_irn_arity(call);
2087 /* the state reg inputs are the last n inputs of the calls */
2088 for (s = 0; s < n_states; ++s) {
2089 int inp = arity - n_states + s;
2090 const arch_register_t *reg = stateregs[s];
2091 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
2093 set_irn_n(call, inp, regnode);
2097 DEL_ARR_F(stateregs);
2101 * Create a trampoline entity for the given method.
2103 static ir_entity *create_trampoline(be_main_env_t *be, ir_entity *method)
2105 ir_type *type = get_entity_type(method);
2106 ident *old_id = get_entity_ld_ident(method);
2107 ident *id = id_mangle3("", old_id, "$stub");
2108 ir_type *parent = be->pic_trampolines_type;
2109 ir_entity *ent = new_entity(parent, old_id, type);
2110 set_entity_ld_ident(ent, id);
2111 set_entity_visibility(ent, ir_visibility_private);
2117 * Returns the trampoline entity for the given method.
2119 static ir_entity *get_trampoline(be_main_env_t *env, ir_entity *method)
2121 ir_entity *result = pmap_get(env->ent_trampoline_map, method);
2122 if (result == NULL) {
2123 result = create_trampoline(env, method);
2124 pmap_insert(env->ent_trampoline_map, method, result);
2130 static ir_entity *create_pic_symbol(be_main_env_t *be, ir_entity *entity)
2132 ident *old_id = get_entity_ld_ident(entity);
2133 ident *id = id_mangle3("", old_id, "$non_lazy_ptr");
2134 ir_type *e_type = get_entity_type(entity);
2135 ir_type *type = new_type_pointer(e_type);
2136 ir_type *parent = be->pic_symbols_type;
2137 ir_entity *ent = new_entity(parent, old_id, type);
2138 set_entity_ld_ident(ent, id);
2139 set_entity_visibility(ent, ir_visibility_private);
2144 static ir_entity *get_pic_symbol(be_main_env_t *env, ir_entity *entity)
2146 ir_entity *result = pmap_get(env->ent_pic_symbol_map, entity);
2147 if (result == NULL) {
2148 result = create_pic_symbol(env, entity);
2149 pmap_insert(env->ent_pic_symbol_map, entity, result);
2158 * Returns non-zero if a given entity can be accessed using a relative address.
2160 static int can_address_relative(ir_entity *entity)
2162 return get_entity_visibility(entity) != ir_visibility_external
2163 && !(get_entity_linkage(entity) & IR_LINKAGE_MERGE);
2166 /** patches SymConsts to work in position independent code */
2167 static void fix_pic_symconsts(ir_node *node, void *data)
2176 be_abi_irg_t *env = data;
2178 be_main_env_t *be = env->birg->main_env;
2180 arity = get_irn_arity(node);
2181 for (i = 0; i < arity; ++i) {
2183 ir_node *pred = get_irn_n(node, i);
2185 ir_entity *pic_symbol;
2186 ir_node *pic_symconst;
2188 if (!is_SymConst(pred))
2191 entity = get_SymConst_entity(pred);
2192 block = get_nodes_block(pred);
2193 irg = get_irn_irg(pred);
2195 /* calls can jump to relative addresses, so we can directly jump to
2196 the (relatively) known call address or the trampoline */
2197 if (i == 1 && is_Call(node)) {
2198 ir_entity *trampoline;
2199 ir_node *trampoline_const;
2201 if (can_address_relative(entity))
2204 dbgi = get_irn_dbg_info(pred);
2205 trampoline = get_trampoline(be, entity);
2206 trampoline_const = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2208 set_irn_n(node, i, trampoline_const);
2212 /* everything else is accessed relative to EIP */
2213 mode = get_irn_mode(pred);
2214 pic_base = arch_code_generator_get_pic_base(env->birg->cg);
2216 /* all ok now for locally constructed stuff */
2217 if (can_address_relative(entity)) {
2218 ir_node *add = new_r_Add(block, pic_base, pred, mode);
2220 /* make sure the walker doesn't visit this add again */
2221 mark_irn_visited(add);
2222 set_irn_n(node, i, add);
2226 /* get entry from pic symbol segment */
2227 dbgi = get_irn_dbg_info(pred);
2228 pic_symbol = get_pic_symbol(be, entity);
2229 pic_symconst = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2231 add = new_r_Add(block, pic_base, pic_symconst, mode);
2232 mark_irn_visited(add);
2234 /* we need an extra indirection for global data outside our current
2235 module. The loads are always safe and can therefore float
2236 and need no memory input */
2237 load = new_r_Load(block, new_NoMem(), add, mode, cons_floats);
2238 load_res = new_r_Proj(load, mode, pn_Load_res);
2240 set_irn_n(node, i, load_res);
2244 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2246 be_abi_irg_t *env = XMALLOC(be_abi_irg_t);
2247 ir_node *old_frame = get_irg_frame(birg->irg);
2248 ir_graph *irg = birg->irg;
2249 struct obstack *obst = be_get_birg_obst(irg);
2253 unsigned *limited_bitset;
2254 arch_register_req_t *sp_req;
2256 be_omit_fp = birg->main_env->options->omit_fp;
2257 be_omit_leaf_fp = birg->main_env->options->omit_leaf_fp;
2261 env->arch_env = birg->main_env->arch_env;
2262 env->method_type = get_entity_type(get_irg_entity(irg));
2263 env->call = be_abi_call_new(env->arch_env->sp->reg_class);
2264 arch_env_get_call_abi(env->arch_env, env->method_type, env->call);
2266 env->ignore_regs = pset_new_ptr_default();
2267 env->keep_map = pmap_create();
2268 env->dce_survivor = new_survive_dce();
2272 sp_req = OALLOCZ(obst, arch_register_req_t);
2273 env->sp_req = sp_req;
2275 sp_req->type = arch_register_req_type_limited
2276 | arch_register_req_type_produces_sp;
2277 sp_req->cls = arch_register_get_class(env->arch_env->sp);
2279 limited_bitset = rbitset_obstack_alloc(obst, sp_req->cls->n_regs);
2280 rbitset_set(limited_bitset, arch_register_get_index(env->arch_env->sp));
2281 sp_req->limited = limited_bitset;
2282 if (env->arch_env->sp->type & arch_register_type_ignore) {
2283 sp_req->type |= arch_register_req_type_ignore;
2286 env->init_sp = dummy = new_r_Dummy(irg, env->arch_env->sp->reg_class->mode);
2288 env->calls = NEW_ARR_F(ir_node*, 0);
2290 if (birg->main_env->options->pic) {
2291 irg_walk_graph(irg, fix_pic_symconsts, NULL, env);
2294 /* Lower all call nodes in the IRG. */
2298 Beware: init backend abi call object after processing calls,
2299 otherwise some information might be not yet available.
2301 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2303 /* Process the IRG */
2306 /* fix call inputs for state registers */
2307 fix_call_state_inputs(env);
2309 /* We don't need the keep map anymore. */
2310 pmap_destroy(env->keep_map);
2311 env->keep_map = NULL;
2313 /* calls array is not needed anymore */
2314 DEL_ARR_F(env->calls);
2317 /* reroute the stack origin of the calls to the true stack origin. */
2318 exchange(dummy, env->init_sp);
2319 exchange(old_frame, get_irg_frame(irg));
2321 /* Make some important node pointers survive the dead node elimination. */
2322 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2323 foreach_pmap(env->regs, ent) {
2324 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2327 env->call->cb->done(env->cb);
2332 void be_abi_free(be_abi_irg_t *env)
2334 be_abi_call_free(env->call);
2335 free_survive_dce(env->dce_survivor);
2336 del_pset(env->ignore_regs);
2337 pmap_destroy(env->regs);
2341 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2343 arch_register_t *reg;
2345 for (reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2346 if (reg->reg_class == cls)
2347 bitset_set(bs, reg->index);
2350 void be_abi_set_non_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, unsigned *raw_bitset)
2353 arch_register_t *reg;
2355 for (i = 0; i < cls->n_regs; ++i) {
2356 if (arch_register_type_is(&cls->regs[i], ignore))
2359 rbitset_set(raw_bitset, i);
2362 for (reg = pset_first(abi->ignore_regs); reg != NULL;
2363 reg = pset_next(abi->ignore_regs)) {
2364 if (reg->reg_class != cls)
2367 rbitset_clear(raw_bitset, reg->index);
2371 /* Returns the stack layout from a abi environment. */
2372 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi)
2380 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2381 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2382 | _| | |> < ___) | || (_| | (__| <
2383 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2387 typedef ir_node **node_array;
2389 typedef struct fix_stack_walker_env_t {
2390 node_array sp_nodes;
2391 } fix_stack_walker_env_t;
2394 * Walker. Collect all stack modifying nodes.
2396 static void collect_stack_nodes_walker(ir_node *node, void *data)
2398 ir_node *insn = node;
2399 fix_stack_walker_env_t *env = data;
2400 const arch_register_req_t *req;
2402 if (is_Proj(node)) {
2403 insn = get_Proj_pred(node);
2406 if (arch_irn_get_n_outs(insn) == 0)
2409 req = arch_get_register_req_out(node);
2410 if (! (req->type & arch_register_req_type_produces_sp))
2413 ARR_APP1(ir_node*, env->sp_nodes, node);
2416 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2418 be_ssa_construction_env_t senv;
2421 be_irg_t *birg = env->birg;
2422 be_lv_t *lv = be_get_birg_liveness(birg);
2423 fix_stack_walker_env_t walker_env;
2425 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2427 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2429 /* nothing to be done if we didn't find any node, in fact we mustn't
2430 * continue, as for endless loops incsp might have had no users and is bad
2433 len = ARR_LEN(walker_env.sp_nodes);
2435 DEL_ARR_F(walker_env.sp_nodes);
2439 be_ssa_construction_init(&senv, birg);
2440 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2441 ARR_LEN(walker_env.sp_nodes));
2442 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2443 ARR_LEN(walker_env.sp_nodes));
2446 len = ARR_LEN(walker_env.sp_nodes);
2447 for (i = 0; i < len; ++i) {
2448 be_liveness_update(lv, walker_env.sp_nodes[i]);
2450 be_ssa_construction_update_liveness_phis(&senv, lv);
2453 phis = be_ssa_construction_get_new_phis(&senv);
2455 /* set register requirements for stack phis */
2456 len = ARR_LEN(phis);
2457 for (i = 0; i < len; ++i) {
2458 ir_node *phi = phis[i];
2459 be_set_phi_reg_req(phi, env->sp_req);
2460 arch_set_irn_register(phi, env->arch_env->sp);
2462 be_ssa_construction_destroy(&senv);
2464 DEL_ARR_F(walker_env.sp_nodes);
2468 * Fix all stack accessing operations in the block bl.
2470 * @param env the abi environment
2471 * @param bl the block to process
2472 * @param real_bias the bias value
2474 * @return the bias at the end of this block
2476 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int real_bias)
2478 int omit_fp = env->call->flags.bits.try_omit_fp;
2480 int wanted_bias = real_bias;
2482 sched_foreach(bl, irn) {
2486 Check, if the node relates to an entity on the stack frame.
2487 If so, set the true offset (including the bias) for that
2490 ir_entity *ent = arch_get_frame_entity(irn);
2492 int bias = omit_fp ? real_bias : 0;
2493 int offset = get_stack_entity_offset(&env->frame, ent, bias);
2494 arch_set_frame_offset(irn, offset);
2495 DBG((dbg, LEVEL_2, "%F has offset %d (including bias %d)\n",
2496 ent, offset, bias));
2500 * If the node modifies the stack pointer by a constant offset,
2501 * record that in the bias.
2503 ofs = arch_get_sp_bias(irn);
2505 if (be_is_IncSP(irn)) {
2506 /* fill in real stack frame size */
2507 if (ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2508 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2509 ofs = (int) get_type_size_bytes(frame_type);
2510 be_set_IncSP_offset(irn, ofs);
2511 } else if (ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2512 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2513 ofs = - (int)get_type_size_bytes(frame_type);
2514 be_set_IncSP_offset(irn, ofs);
2516 if (be_get_IncSP_align(irn)) {
2517 /* patch IncSP to produce an aligned stack pointer */
2518 ir_type *between_type = env->frame.between_type;
2519 int between_size = get_type_size_bytes(between_type);
2520 int alignment = 1 << env->arch_env->stack_alignment;
2521 int delta = (real_bias + ofs + between_size) & (alignment - 1);
2524 be_set_IncSP_offset(irn, ofs + alignment - delta);
2525 real_bias += alignment - delta;
2528 /* adjust so real_bias corresponds with wanted_bias */
2529 int delta = wanted_bias - real_bias;
2532 be_set_IncSP_offset(irn, ofs + delta);
2543 assert(real_bias == wanted_bias);
2548 * A helper struct for the bias walker.
2551 be_abi_irg_t *env; /**< The ABI irg environment. */
2552 int start_block_bias; /**< The bias at the end of the start block. */
2554 ir_node *start_block; /**< The start block of the current graph. */
2558 * Block-Walker: fix all stack offsets for all blocks
2559 * except the start block
2561 static void stack_bias_walker(ir_node *bl, void *data)
2563 struct bias_walk *bw = data;
2564 if (bl != bw->start_block) {
2565 process_stack_bias(bw->env, bl, bw->start_block_bias);
2570 * Walker: finally lower all Sels of outer frame or parameter
2573 static void lower_outer_frame_sels(ir_node *sel, void *ctx)
2575 be_abi_irg_t *env = ctx;
2583 ent = get_Sel_entity(sel);
2584 owner = get_entity_owner(ent);
2585 ptr = get_Sel_ptr(sel);
2587 if (owner == env->frame.frame_type || owner == env->frame.arg_type) {
2588 /* found access to outer frame or arguments */
2589 int offset = get_stack_entity_offset(&env->frame, ent, 0);
2592 ir_node *bl = get_nodes_block(sel);
2593 dbg_info *dbgi = get_irn_dbg_info(sel);
2594 ir_mode *mode = get_irn_mode(sel);
2595 ir_mode *mode_UInt = get_reference_mode_unsigned_eq(mode);
2596 ir_node *cnst = new_r_Const_long(current_ir_graph, mode_UInt, offset);
2598 ptr = new_rd_Add(dbgi, bl, ptr, cnst, mode);
2604 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2606 ir_graph *irg = env->birg->irg;
2609 struct bias_walk bw;
2611 stack_frame_compute_initial_offset(&env->frame);
2612 // stack_layout_dump(stdout, frame);
2614 /* Determine the stack bias at the end of the start block. */
2615 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), env->frame.initial_bias);
2616 bw.between_size = get_type_size_bytes(env->frame.between_type);
2618 /* fix the bias is all other blocks */
2620 bw.start_block = get_irg_start_block(irg);
2621 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2623 /* fix now inner functions: these still have Sel node to outer
2624 frame and parameter entities */
2625 frame_tp = get_irg_frame_type(irg);
2626 for (i = get_class_n_members(frame_tp) - 1; i >= 0; --i) {
2627 ir_entity *ent = get_class_member(frame_tp, i);
2628 ir_graph *irg = get_entity_irg(ent);
2631 irg_walk_graph(irg, NULL, lower_outer_frame_sels, env);
2636 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2638 assert(arch_register_type_is(reg, callee_save));
2639 assert(pmap_contains(abi->regs, (void *) reg));
2640 return pmap_get(abi->regs, (void *) reg);
2643 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2645 assert(arch_register_type_is(reg, ignore));
2646 assert(pmap_contains(abi->regs, (void *) reg));
2647 return pmap_get(abi->regs, (void *) reg);
2651 * Returns non-zero if the ABI has omitted the frame pointer in
2652 * the current graph.
2654 int be_abi_omit_fp(const be_abi_irg_t *abi)
2656 return abi->call->flags.bits.try_omit_fp;
2659 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_abi);
2660 void be_init_abi(void)
2662 FIRM_DBG_REGISTER(dbg, "firm.be.abi");