2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Backend ABI implementation.
23 * @author Sebastian Hack, Michael Beck
35 #include "irgraph_t.h"
38 #include "iredges_t.h"
41 #include "irprintf_t.h"
47 #include "raw_bitset.h"
55 #include "besched_t.h"
57 #include "bessaconstr.h"
59 typedef struct _be_abi_call_arg_t {
60 unsigned is_res : 1; /**< 1: the call argument is a return value. 0: it's a call parameter. */
61 unsigned in_reg : 1; /**< 1: this argument is transmitted in registers. */
62 unsigned on_stack : 1; /**< 1: this argument is transmitted on the stack. */
65 const arch_register_t *reg;
68 unsigned alignment; /**< stack alignment */
69 unsigned space_before; /**< allocate space before */
70 unsigned space_after; /**< allocate space after */
73 struct _be_abi_call_t {
74 be_abi_call_flags_t flags;
76 const be_abi_callbacks_t *cb;
77 ir_type *between_type;
79 const arch_register_class_t *cls_addr;
82 struct _be_abi_irg_t {
84 be_stack_layout_t *frame; /**< The stack frame model. */
85 be_irg_t *birg; /**< The back end IRG. */
86 const arch_env_t *arch_env;
87 survive_dce_t *dce_survivor;
89 be_abi_call_t *call; /**< The ABI call information. */
90 ir_type *method_type; /**< The type of the method of the IRG. */
92 ir_node *init_sp; /**< The node representing the stack pointer
93 at the start of the function. */
95 ir_node *reg_params; /**< The reg params node. */
96 pmap *regs; /**< A map of all callee-save and ignore regs to
97 their Projs to the RegParams node. */
99 int start_block_bias; /**< The stack bias at the end of the start block. */
101 void *cb; /**< ABI Callback self pointer. */
103 pmap *keep_map; /**< mapping blocks to keep nodes. */
104 pset *ignore_regs; /**< Additional registers which shall be ignored. */
106 ir_node **calls; /**< flexible array containing all be_Call nodes */
108 arch_register_req_t sp_req;
109 arch_register_req_t sp_cls_req;
111 DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< The debugging module. */
114 static heights_t *ir_heights;
116 /** Flag: if set, try to omit the frame pointer in all routines. */
117 static int be_omit_fp = 1;
119 /** Flag: if set, try to omit the frame pointer in leaf routines only. */
120 static int be_omit_leaf_fp = 1;
123 _ ____ ___ ____ _ _ _ _
124 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
125 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
126 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
127 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
129 These callbacks are used by the backend to set the parameters
130 for a specific call type.
134 * Set compare function: compares two ABI call object arguments.
136 static int cmp_call_arg(const void *a, const void *b, size_t n)
138 const be_abi_call_arg_t *p = a, *q = b;
140 return !(p->is_res == q->is_res && p->pos == q->pos);
144 * Get or set an ABI call object argument.
146 * @param call the abi call
147 * @param is_res true for call results, false for call arguments
148 * @param pos position of the argument
149 * @param do_insert true if the argument is set, false if it's retrieved
151 static be_abi_call_arg_t *get_or_set_call_arg(be_abi_call_t *call, int is_res, int pos, int do_insert)
153 be_abi_call_arg_t arg;
156 memset(&arg, 0, sizeof(arg));
160 hash = is_res * 128 + pos;
163 ? set_insert(call->params, &arg, sizeof(arg), hash)
164 : set_find(call->params, &arg, sizeof(arg), hash);
168 * Retrieve an ABI call object argument.
170 * @param call the ABI call object
171 * @param is_res true for call results, false for call arguments
172 * @param pos position of the argument
174 static INLINE be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
176 return get_or_set_call_arg(call, is_res, pos, 0);
179 /* Set the flags for a call. */
180 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
186 void be_abi_call_set_pop(be_abi_call_t *call, int pop)
192 /* Set register class for call address */
193 void be_abi_call_set_call_address_reg_class(be_abi_call_t *call, const arch_register_class_t *cls)
195 call->cls_addr = cls;
199 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)
201 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
203 arg->load_mode = load_mode;
204 arg->alignment = alignment;
205 arg->space_before = space_before;
206 arg->space_after = space_after;
207 assert(alignment > 0 && "Alignment must be greater than 0");
210 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
212 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
217 void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
219 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 1, arg_pos, 1);
224 /* Get the flags of a ABI call object. */
225 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
231 * Constructor for a new ABI call object.
233 * @return the new ABI call object
235 static be_abi_call_t *be_abi_call_new(const arch_register_class_t *cls_addr)
237 be_abi_call_t *call = xmalloc(sizeof(call[0]));
238 memset(call, 0, sizeof(call[0]));
241 call->params = new_set(cmp_call_arg, 16);
243 call->cls_addr = cls_addr;
245 call->flags.bits.try_omit_fp = be_omit_fp | be_omit_leaf_fp;
251 * Destructor for an ABI call object.
253 static void be_abi_call_free(be_abi_call_t *call)
255 del_set(call->params);
261 | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _
262 | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` |
263 | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| |
264 |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, |
267 Handling of the stack frame. It is composed of three types:
268 1) The type of the arguments which are pushed on the stack.
269 2) The "between type" which consists of stuff the call of the
270 function pushes on the stack (like the return address and
271 the old base pointer for ia32).
272 3) The Firm frame type which consists of all local variables
276 static int get_stack_entity_offset(be_stack_layout_t *frame, ir_entity *ent,
279 ir_type *t = get_entity_owner(ent);
280 int ofs = get_entity_offset(ent);
284 /* Find the type the entity is contained in. */
285 for(index = 0; index < N_FRAME_TYPES; ++index) {
286 if(frame->order[index] == t)
290 /* Add the size of all the types below the one of the entity to the entity's offset */
291 for(i = 0; i < index; ++i)
292 ofs += get_type_size_bytes(frame->order[i]);
294 /* correct the offset by the initial position of the frame pointer */
295 ofs -= frame->initial_offset;
297 /* correct the offset with the current bias. */
304 * Retrieve the entity with given offset from a frame type.
306 static ir_entity *search_ent_with_offset(ir_type *t, int offset)
310 for(i = 0, n = get_compound_n_members(t); i < n; ++i) {
311 ir_entity *ent = get_compound_member(t, i);
312 if(get_entity_offset(ent) == offset)
319 static int stack_frame_compute_initial_offset(be_stack_layout_t *frame)
321 ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
322 ir_entity *ent = search_ent_with_offset(base, 0);
324 frame->initial_offset = ent ? get_stack_entity_offset(frame, ent, 0) : 0;
326 return frame->initial_offset;
330 * Initializes the frame layout from parts
332 * @param frame the stack layout that will be initialized
333 * @param args the stack argument layout type
334 * @param between the between layout type
335 * @param locals the method frame type
336 * @param stack_dir the stack direction
337 * @param param_map an array mapping method argument positions to the stack argument type
339 * @return the initialized stack layout
341 static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *args,
342 ir_type *between, ir_type *locals, int stack_dir,
343 ir_entity *param_map[])
345 frame->arg_type = args;
346 frame->between_type = between;
347 frame->frame_type = locals;
348 frame->initial_offset = 0;
349 frame->stack_dir = stack_dir;
350 frame->order[1] = between;
351 frame->param_map = param_map;
354 frame->order[0] = args;
355 frame->order[2] = locals;
358 frame->order[0] = locals;
359 frame->order[2] = args;
365 /** Dumps the stack layout to file. */
366 static void stack_layout_dump(FILE *file, be_stack_layout_t *frame)
370 ir_fprintf(file, "initial offset: %d\n", frame->initial_offset);
371 for (j = 0; j < N_FRAME_TYPES; ++j) {
372 ir_type *t = frame->order[j];
374 ir_fprintf(file, "type %d: %F size: %d\n", j, t, get_type_size_bytes(t));
375 for (i = 0, n = get_compound_n_members(t); i < n; ++i) {
376 ir_entity *ent = get_compound_member(t, i);
377 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));
384 * Returns non-zero if the call argument at given position
385 * is transfered on the stack.
387 static INLINE int is_on_stack(be_abi_call_t *call, int pos)
389 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
390 return arg && !arg->in_reg;
400 Adjustment of the calls inside a graph.
405 * Transform a call node into a be_Call node.
407 * @param env The ABI environment for the current irg.
408 * @param irn The call node.
409 * @param curr_sp The stack pointer node to use.
410 * @return The stack pointer after the call.
412 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp)
414 ir_graph *irg = env->birg->irg;
415 const arch_env_t *arch_env = env->birg->main_env->arch_env;
416 ir_type *call_tp = get_Call_type(irn);
417 ir_node *call_ptr = get_Call_ptr(irn);
418 int n_params = get_method_n_params(call_tp);
419 ir_node *curr_mem = get_Call_mem(irn);
420 ir_node *bl = get_nodes_block(irn);
421 pset *results = pset_new_ptr(8);
422 pset *caller_save = pset_new_ptr(8);
423 pset *states = pset_new_ptr(2);
425 int stack_dir = arch_env_stack_dir(arch_env);
426 const arch_register_t *sp = arch_env_sp(arch_env);
427 be_abi_call_t *call = be_abi_call_new(sp->reg_class);
428 ir_mode *mach_mode = sp->reg_class->mode;
429 struct obstack *obst = &env->obst;
430 int no_alloc = call->flags.bits.frame_is_setup_on_call;
431 int n_res = get_method_n_ress(call_tp);
432 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
434 ir_node *res_proj = NULL;
435 int n_reg_params = 0;
436 int n_stack_params = 0;
442 int n_reg_results = 0;
443 const arch_register_t *reg;
444 const ir_edge_t *edge;
446 int *stack_param_idx;
449 /* Let the isa fill out the abi description for that call node. */
450 arch_env_get_call_abi(arch_env, call_tp, call);
452 /* Insert code to put the stack arguments on the stack. */
453 assert(get_Call_n_params(irn) == n_params);
454 for (i = 0; i < n_params; ++i) {
455 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
458 int arg_size = get_type_size_bytes(get_method_param_type(call_tp, i));
460 stack_size += round_up2(arg->space_before, arg->alignment);
461 stack_size += round_up2(arg_size, arg->alignment);
462 stack_size += round_up2(arg->space_after, arg->alignment);
463 obstack_int_grow(obst, i);
467 stack_param_idx = obstack_finish(obst);
469 /* Collect all arguments which are passed in registers. */
470 for (i = 0; i < n_params; ++i) {
471 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
472 if (arg && arg->in_reg) {
473 obstack_int_grow(obst, i);
477 reg_param_idxs = obstack_finish(obst);
480 * If the stack is decreasing and we do not want to store sequentially,
481 * or someone else allocated the call frame
482 * we allocate as much space on the stack all parameters need, by
483 * moving the stack pointer along the stack's direction.
485 * Note: we also have to do this for stack_size == 0, because we may have
486 * to adjust stack alignment for the call.
488 if (stack_dir < 0 && !do_seq && !no_alloc) {
489 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, stack_size, 1);
492 /* If there are some parameters which shall be passed on the stack. */
493 if (n_stack_params > 0) {
497 * Reverse list of stack parameters if call arguments are from left to right.
498 * We must them reverse again if they are pushed (not stored) and the stack
499 * direction is downwards.
501 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
502 for (i = 0; i < n_stack_params >> 1; ++i) {
503 int other = n_stack_params - i - 1;
504 int tmp = stack_param_idx[i];
505 stack_param_idx[i] = stack_param_idx[other];
506 stack_param_idx[other] = tmp;
510 curr_mem = get_Call_mem(irn);
512 obstack_ptr_grow(obst, curr_mem);
515 for (i = 0; i < n_stack_params; ++i) {
516 int p = stack_param_idx[i];
517 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
518 ir_node *param = get_Call_param(irn, p);
519 ir_node *addr = curr_sp;
521 ir_type *param_type = get_method_param_type(call_tp, p);
522 int param_size = get_type_size_bytes(param_type) + arg->space_after;
525 * If we wanted to build the arguments sequentially,
526 * the stack pointer for the next must be incremented,
527 * and the memory value propagated.
531 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, param_size + arg->space_before, 0);
532 add_irn_dep(curr_sp, curr_mem);
535 curr_ofs += arg->space_before;
536 curr_ofs = round_up2(curr_ofs, arg->alignment);
538 /* Make the expression to compute the argument's offset. */
540 ir_mode *constmode = mach_mode;
541 if(mode_is_reference(mach_mode)) {
544 addr = new_r_Const_long(irg, bl, constmode, curr_ofs);
545 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
549 /* Insert a store for primitive arguments. */
550 if (is_atomic_type(param_type)) {
552 ir_node *mem_input = do_seq ? curr_mem : new_NoMem();
553 store = new_r_Store(irg, bl, mem_input, addr, param);
554 mem = new_r_Proj(irg, bl, store, mode_M, pn_Store_M);
557 /* Make a mem copy for compound arguments. */
561 assert(mode_is_reference(get_irn_mode(param)));
562 copy = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type);
563 mem = new_r_Proj(irg, bl, copy, mode_M, pn_CopyB_M_regular);
566 curr_ofs += param_size;
571 obstack_ptr_grow(obst, mem);
574 in = (ir_node **) obstack_finish(obst);
576 /* We need the sync only, if we didn't build the stores sequentially. */
578 if (n_stack_params >= 1) {
579 curr_mem = new_r_Sync(irg, bl, n_stack_params + 1, in);
581 curr_mem = get_Call_mem(irn);
584 obstack_free(obst, in);
587 /* Collect caller save registers */
588 for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
590 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
591 for (j = 0; j < cls->n_regs; ++j) {
592 const arch_register_t *reg = arch_register_for_index(cls, j);
593 if (arch_register_type_is(reg, caller_save)) {
594 pset_insert_ptr(caller_save, (void *) reg);
596 if (arch_register_type_is(reg, state)) {
597 pset_insert_ptr(caller_save, (void*) reg);
598 pset_insert_ptr(states, (void*) reg);
603 /* search the greatest result proj number */
605 res_projs = alloca(n_res * sizeof(res_projs[0]));
606 memset(res_projs, 0, n_res * sizeof(res_projs[0]));
608 foreach_out_edge(irn, edge) {
609 const ir_edge_t *res_edge;
610 ir_node *irn = get_edge_src_irn(edge);
612 if(!is_Proj(irn) || get_Proj_proj(irn) != pn_Call_T_result)
615 foreach_out_edge(irn, res_edge) {
617 ir_node *res = get_edge_src_irn(res_edge);
619 assert(is_Proj(res));
621 proj = get_Proj_proj(res);
622 assert(proj < n_res);
623 assert(res_projs[proj] == NULL);
624 res_projs[proj] = res;
630 /** TODO: this is not correct for cases where return values are passed
631 * on the stack, but no known ABI does this currently...
633 n_reg_results = n_res;
635 /* make the back end call node and set its register requirements. */
636 for (i = 0; i < n_reg_params; ++i) {
637 obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
639 foreach_pset(states, reg) {
640 const arch_register_class_t *cls = arch_register_get_class(reg);
642 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
643 ir_fprintf(stderr, "Adding %+F\n", regnode);
645 ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
646 obstack_ptr_grow(obst, regnode);
648 n_ins = n_reg_params + pset_count(states);
650 in = obstack_finish(obst);
652 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
654 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
656 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
657 n_ins, in, get_Call_type(irn));
658 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
661 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
663 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
664 n_ins, in, get_Call_type(irn));
666 be_Call_set_pop(low_call, call->pop);
667 ARR_APP1(ir_node *, env->calls, low_call);
669 /* create new stack pointer */
670 curr_sp = new_r_Proj(irg, bl, low_call, get_irn_mode(curr_sp),
672 be_set_constr_single_reg(low_call, BE_OUT_POS(pn_be_Call_sp), sp);
673 arch_set_irn_register(arch_env, curr_sp, sp);
674 be_node_set_flags(low_call, BE_OUT_POS(pn_be_Call_sp),
675 arch_irn_flags_ignore | arch_irn_flags_modify_sp);
677 for(i = 0; i < n_res; ++i) {
679 ir_node *proj = res_projs[i];
680 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
682 /* returns values on stack not supported yet */
686 shift the proj number to the right, since we will drop the
687 unspeakable Proj_T from the Call. Therefore, all real argument
688 Proj numbers must be increased by pn_be_Call_first_res
690 pn = i + pn_be_Call_first_res;
693 ir_type *res_type = get_method_res_type(call_tp, i);
694 ir_mode *mode = get_type_mode(res_type);
695 proj = new_r_Proj(irg, bl, low_call, mode, pn);
698 set_Proj_pred(proj, low_call);
699 set_Proj_proj(proj, pn);
703 pset_remove_ptr(caller_save, arg->reg);
708 Set the register class of the call address to
709 the backend provided class (default: stack pointer class)
711 be_node_set_reg_class(low_call, be_pos_Call_ptr, call->cls_addr);
713 DBG((env->dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
715 /* Set the register classes and constraints of the Call parameters. */
716 for (i = 0; i < n_reg_params; ++i) {
717 int index = reg_param_idxs[i];
718 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
719 assert(arg->reg != NULL);
721 be_set_constr_single_reg(low_call, be_pos_Call_first_arg + i, arg->reg);
724 /* Set the register constraints of the results. */
725 for (i = 0; i < n_res; ++i) {
726 ir_node *proj = res_projs[i];
727 const be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
728 int pn = get_Proj_proj(proj);
731 be_set_constr_single_reg(low_call, BE_OUT_POS(pn), arg->reg);
732 arch_set_irn_register(arch_env, proj, arg->reg);
734 obstack_free(obst, in);
735 exchange(irn, low_call);
737 /* kill the ProjT node */
738 if (res_proj != NULL) {
742 /* Make additional projs for the caller save registers
743 and the Keep node which keeps them alive. */
744 if (1 || pset_count(caller_save) + n_reg_results > 0) {
745 const arch_register_t *reg;
750 = pn_be_Call_first_res + n_reg_results;
752 /* also keep the stack pointer */
754 set_irn_link(curr_sp, (void*) sp);
755 obstack_ptr_grow(obst, curr_sp);
757 for (reg = pset_first(caller_save); reg; reg = pset_next(caller_save), ++n) {
758 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode,
761 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
762 be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg);
763 arch_set_irn_register(arch_env, proj, reg);
765 /* a call can produce ignore registers, in this case set the flag and register for the Proj */
766 if (arch_register_type_is(reg, ignore)) {
767 be_node_set_flags(low_call, BE_OUT_POS(curr_res_proj),
768 arch_irn_flags_ignore);
771 set_irn_link(proj, (void*) reg);
772 obstack_ptr_grow(obst, proj);
776 for(i = 0; i < n_reg_results; ++i) {
777 ir_node *proj = res_projs[i];
778 const arch_register_t *reg = arch_get_irn_register(arch_env, proj);
779 set_irn_link(proj, (void*) reg);
780 obstack_ptr_grow(obst, proj);
784 /* create the Keep for the caller save registers */
785 in = (ir_node **) obstack_finish(obst);
786 keep = be_new_Keep(NULL, irg, bl, n, in);
787 for (i = 0; i < n; ++i) {
788 const arch_register_t *reg = get_irn_link(in[i]);
789 be_node_set_reg_class(keep, i, reg->reg_class);
791 obstack_free(obst, in);
794 /* Clean up the stack. */
795 assert(stack_size >= call->pop);
796 stack_size -= call->pop;
798 if (stack_size > 0) {
799 ir_node *mem_proj = NULL;
801 foreach_out_edge(low_call, edge) {
802 ir_node *irn = get_edge_src_irn(edge);
803 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
810 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_be_Call_M_regular);
811 keep_alive(mem_proj);
814 /* Clean up the stack frame or revert alignment fixes if we allocated it */
816 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size, 0);
819 be_abi_call_free(call);
820 obstack_free(obst, stack_param_idx);
823 del_pset(caller_save);
829 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
831 * @param alignment the minimum stack alignment
832 * @param size the node containing the non-aligned size
833 * @param irg the irg where new nodes are allocated on
834 * @param irg the block where new nodes are allocated on
835 * @param dbg debug info for new nodes
837 * @return a node representing the aligned size
839 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size,
840 ir_graph *irg, ir_node *block, dbg_info *dbg)
842 if (stack_alignment > 1) {
847 assert(is_po2(stack_alignment));
849 mode = get_irn_mode(size);
850 tv = new_tarval_from_long(stack_alignment-1, mode);
851 mask = new_r_Const(irg, block, mode, tv);
852 size = new_rd_Add(dbg, irg, block, size, mask, mode);
854 tv = new_tarval_from_long(-(long)stack_alignment, mode);
855 mask = new_r_Const(irg, block, mode, tv);
856 size = new_rd_And(dbg, irg, block, size, mask, mode);
862 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
864 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
873 const ir_edge_t *edge;
874 ir_node *new_alloc, *size, *addr, *ins[2];
875 unsigned stack_alignment;
877 assert(get_Alloc_where(alloc) == stack_alloc);
879 block = get_nodes_block(alloc);
880 irg = get_irn_irg(block);
883 type = get_Alloc_type(alloc);
885 foreach_out_edge(alloc, edge) {
886 ir_node *irn = get_edge_src_irn(edge);
888 assert(is_Proj(irn));
889 switch (get_Proj_proj(irn)) {
901 /* Beware: currently Alloc nodes without a result might happen,
902 only escape analysis kills them and this phase runs only for object
903 oriented source. We kill the Alloc here. */
904 if (alloc_res == NULL && alloc_mem) {
905 exchange(alloc_mem, get_Alloc_mem(alloc));
909 dbg = get_irn_dbg_info(alloc);
911 /* we might need to multiply the size with the element size */
912 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
913 tarval *tv = new_tarval_from_long(get_type_size_bytes(type),
915 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
916 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Alloc_size(alloc),
920 size = get_Alloc_size(alloc);
923 /* The stack pointer will be modified in an unknown manner.
924 We cannot omit it. */
925 env->call->flags.bits.try_omit_fp = 0;
927 stack_alignment = 1 << env->arch_env->stack_alignment;
928 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
929 new_alloc = be_new_AddSP(env->arch_env->sp, irg, block, curr_sp, size);
930 set_irn_dbg_info(new_alloc, dbg);
932 if(alloc_mem != NULL) {
936 addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
938 /* We need to sync the output mem of the AddSP with the input mem
939 edge into the alloc node. */
940 ins[0] = get_Alloc_mem(alloc);
942 sync = new_r_Sync(irg, block, 2, ins);
944 exchange(alloc_mem, sync);
947 exchange(alloc, new_alloc);
949 /* fix projnum of alloca res */
950 set_Proj_proj(alloc_res, pn_be_AddSP_res);
953 curr_sp = new_r_Proj(irg, block, new_alloc, get_irn_mode(curr_sp),
961 * The Free is transformed into a back end free node and connected to the stack nodes.
963 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
967 ir_node *subsp, *mem, *res, *size, *sync;
971 unsigned stack_alignment;
974 assert(get_Free_where(free) == stack_alloc);
976 block = get_nodes_block(free);
977 irg = get_irn_irg(block);
978 type = get_Free_type(free);
979 sp_mode = env->arch_env->sp->reg_class->mode;
980 dbg = get_irn_dbg_info(free);
982 /* we might need to multiply the size with the element size */
983 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
984 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
985 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
986 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
990 size = get_Free_size(free);
993 stack_alignment = 1 << env->arch_env->stack_alignment;
994 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
996 /* The stack pointer will be modified in an unknown manner.
997 We cannot omit it. */
998 env->call->flags.bits.try_omit_fp = 0;
999 subsp = be_new_SubSP(env->arch_env->sp, irg, block, curr_sp, size);
1000 set_irn_dbg_info(subsp, dbg);
1002 mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
1003 res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_sp);
1005 /* we need to sync the memory */
1006 in[0] = get_Free_mem(free);
1008 sync = new_r_Sync(irg, block, 2, in);
1010 /* and make the AddSP dependent on the former memory */
1011 add_irn_dep(subsp, get_Free_mem(free));
1014 exchange(free, sync);
1020 /* the following function is replaced by the usage of the heights module */
1023 * Walker for dependent_on().
1024 * This function searches a node tgt recursively from a given node
1025 * but is restricted to the given block.
1026 * @return 1 if tgt was reachable from curr, 0 if not.
1028 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl)
1032 if (get_nodes_block(curr) != bl)
1038 /* Phi functions stop the recursion inside a basic block */
1039 if (! is_Phi(curr)) {
1040 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
1041 if (check_dependence(get_irn_n(curr, i), tgt, bl))
1051 * Check if a node is somehow data dependent on another one.
1052 * both nodes must be in the same basic block.
1053 * @param n1 The first node.
1054 * @param n2 The second node.
1055 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1057 static int dependent_on(ir_node *n1, ir_node *n2)
1059 assert(get_nodes_block(n1) == get_nodes_block(n2));
1061 return heights_reachable_in_block(ir_heights, n1, n2);
1064 static int cmp_call_dependency(const void *c1, const void *c2)
1066 ir_node *n1 = *(ir_node **) c1;
1067 ir_node *n2 = *(ir_node **) c2;
1070 Classical qsort() comparison function behavior:
1071 0 if both elements are equal
1072 1 if second is "smaller" that first
1073 -1 if first is "smaller" that second
1075 if (dependent_on(n1, n2))
1078 if (dependent_on(n2, n1))
1085 * Walker: links all Call/Alloc/Free nodes to the Block they are contained.
1086 * Clears the irg_is_leaf flag if a Call is detected.
1088 static void link_ops_in_block_walker(ir_node *irn, void *data)
1090 ir_opcode code = get_irn_opcode(irn);
1092 if (code == iro_Call ||
1093 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1094 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1095 be_abi_irg_t *env = data;
1096 ir_node *bl = get_nodes_block(irn);
1097 void *save = get_irn_link(bl);
1099 if (code == iro_Call)
1100 env->call->flags.bits.irg_is_leaf = 0;
1102 set_irn_link(irn, save);
1103 set_irn_link(bl, irn);
1109 * Process all Call/Alloc/Free nodes inside a basic block.
1110 * Note that the link field of the block must contain a linked list of all
1111 * Call nodes inside the Block. We first order this list according to data dependency
1112 * and that connect the calls together.
1114 static void process_ops_in_block(ir_node *bl, void *data)
1116 be_abi_irg_t *env = data;
1117 ir_node *curr_sp = env->init_sp;
1121 for (irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
1122 obstack_ptr_grow(&env->obst, irn);
1124 /* If there were call nodes in the block. */
1130 nodes = obstack_finish(&env->obst);
1132 /* order the call nodes according to data dependency */
1133 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
1135 for (i = n - 1; i >= 0; --i) {
1136 ir_node *irn = nodes[i];
1138 DBG((env->dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1139 switch (get_irn_opcode(irn)) {
1142 /* The stack pointer will be modified due to a call. */
1143 env->call->flags.bits.try_omit_fp = 0;
1145 curr_sp = adjust_call(env, irn, curr_sp);
1148 if (get_Alloc_where(irn) == stack_alloc)
1149 curr_sp = adjust_alloc(env, irn, curr_sp);
1152 if (get_Free_where(irn) == stack_alloc)
1153 curr_sp = adjust_free(env, irn, curr_sp);
1156 panic("invalid call");
1161 obstack_free(&env->obst, nodes);
1163 /* Keep the last stack state in the block by tying it to Keep node,
1164 * the proj from calls is already kept */
1165 if (curr_sp != env->init_sp &&
1166 !(is_Proj(curr_sp) && be_is_Call(get_Proj_pred(curr_sp)))) {
1168 keep = be_new_Keep(env->arch_env->sp->reg_class,
1169 get_irn_irg(bl), bl, 1, nodes);
1170 pmap_insert(env->keep_map, bl, keep);
1174 set_irn_link(bl, curr_sp);
1175 } /* process_calls_in_block */
1178 * Adjust all call nodes in the graph to the ABI conventions.
1180 static void process_calls(be_abi_irg_t *env)
1182 ir_graph *irg = env->birg->irg;
1184 env->call->flags.bits.irg_is_leaf = 1;
1185 irg_walk_graph(irg, firm_clear_link, link_ops_in_block_walker, env);
1187 ir_heights = heights_new(env->birg->irg);
1188 irg_block_walk_graph(irg, NULL, process_ops_in_block, env);
1189 heights_free(ir_heights);
1193 * Computes the stack argument layout type.
1194 * Changes a possibly allocated value param type by moving
1195 * entities to the stack layout type.
1197 * @param env the ABI environment
1198 * @param call the current call ABI
1199 * @param method_type the method type
1200 * @param param_map an array mapping method arguments to the stack layout type
1202 * @return the stack argument layout type
1204 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type, ir_entity ***param_map)
1206 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1207 int inc = env->birg->main_env->arch_env->stack_dir * dir;
1208 int n = get_method_n_params(method_type);
1209 int curr = inc > 0 ? 0 : n - 1;
1215 ir_type *val_param_tp = get_method_value_param_type(method_type);
1216 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1219 *param_map = map = obstack_alloc(&env->obst, n * sizeof(ir_entity *));
1220 res = new_type_struct(mangle_u(id, new_id_from_chars("arg_type", 8)));
1221 for (i = 0; i < n; ++i, curr += inc) {
1222 ir_type *param_type = get_method_param_type(method_type, curr);
1223 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1226 if (arg->on_stack) {
1228 /* the entity was already created, move it to the param type */
1229 arg->stack_ent = get_method_value_param_ent(method_type, i);
1230 remove_struct_member(val_param_tp, arg->stack_ent);
1231 set_entity_owner(arg->stack_ent, res);
1232 add_struct_member(res, arg->stack_ent);
1233 /* must be automatic to set a fixed layout */
1234 set_entity_allocation(arg->stack_ent, allocation_automatic);
1237 snprintf(buf, sizeof(buf), "param_%d", i);
1238 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1240 ofs += arg->space_before;
1241 ofs = round_up2(ofs, arg->alignment);
1242 set_entity_offset(arg->stack_ent, ofs);
1243 ofs += arg->space_after;
1244 ofs += get_type_size_bytes(param_type);
1245 map[i] = arg->stack_ent;
1248 set_type_size_bytes(res, ofs);
1249 set_type_state(res, layout_fixed);
1254 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
1257 struct obstack obst;
1259 obstack_init(&obst);
1261 /* Create a Perm after the RegParams node to delimit it. */
1262 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1263 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1268 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
1269 const arch_register_t *reg = &cls->regs[j];
1270 ir_node *irn = pmap_get(regs, (void *) reg);
1272 if(irn && !arch_register_type_is(reg, ignore)) {
1274 obstack_ptr_grow(&obst, irn);
1275 set_irn_link(irn, (void *) reg);
1279 obstack_ptr_grow(&obst, NULL);
1280 in = obstack_finish(&obst);
1282 perm = be_new_Perm(cls, irg, bl, n_regs, in);
1283 for(j = 0; j < n_regs; ++j) {
1284 ir_node *arg = in[j];
1285 arch_register_t *reg = get_irn_link(arg);
1286 pmap_insert(regs, reg, arg);
1287 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
1290 obstack_free(&obst, in);
1293 obstack_free(&obst, NULL);
1298 const arch_register_t *reg;
1302 static int cmp_regs(const void *a, const void *b)
1304 const reg_node_map_t *p = a;
1305 const reg_node_map_t *q = b;
1307 if(p->reg->reg_class == q->reg->reg_class)
1308 return p->reg->index - q->reg->index;
1310 return p->reg->reg_class - q->reg->reg_class;
1313 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1316 int n = pmap_count(reg_map);
1318 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1320 foreach_pmap(reg_map, ent) {
1321 res[i].reg = ent->key;
1322 res[i].irn = ent->value;
1326 qsort(res, n, sizeof(res[0]), cmp_regs);
1331 * Creates a barrier.
1333 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1335 ir_graph *irg = env->birg->irg;
1336 int n_regs = pmap_count(regs);
1342 rm = reg_map_to_arr(&env->obst, regs);
1344 for(n = 0; n < n_regs; ++n)
1345 obstack_ptr_grow(&env->obst, rm[n].irn);
1348 obstack_ptr_grow(&env->obst, *mem);
1352 in = (ir_node **) obstack_finish(&env->obst);
1353 irn = be_new_Barrier(irg, bl, n, in);
1354 obstack_free(&env->obst, in);
1356 for(n = 0; n < n_regs; ++n) {
1357 const arch_register_t *reg = rm[n].reg;
1359 int pos = BE_OUT_POS(n);
1362 proj = new_r_Proj(irg, bl, irn, get_irn_mode(rm[n].irn), n);
1363 be_node_set_reg_class(irn, n, reg->reg_class);
1365 be_set_constr_single_reg(irn, n, reg);
1366 be_set_constr_single_reg(irn, pos, reg);
1367 be_node_set_reg_class(irn, pos, reg->reg_class);
1368 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1370 /* if the proj projects a ignore register or a node which is set to ignore, propagate this property. */
1371 if(arch_register_type_is(reg, ignore) || arch_irn_is(env->birg->main_env->arch_env, in[n], ignore))
1372 flags |= arch_irn_flags_ignore;
1374 if(arch_irn_is(env->birg->main_env->arch_env, in[n], modify_sp))
1375 flags |= arch_irn_flags_modify_sp;
1377 be_node_set_flags(irn, pos, flags);
1379 pmap_insert(regs, (void *) reg, proj);
1383 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1386 obstack_free(&env->obst, rm);
1391 * Creates a be_Return for a Return node.
1393 * @param @env the abi environment
1394 * @param irn the Return node or NULL if there was none
1395 * @param bl the block where the be_Retun should be placed
1396 * @param mem the current memory
1397 * @param n_res number of return results
1399 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl,
1400 ir_node *mem, int n_res)
1402 be_abi_call_t *call = env->call;
1403 const arch_env_t *arch_env = env->birg->main_env->arch_env;
1405 pmap *reg_map = pmap_create();
1406 ir_node *keep = pmap_get(env->keep_map, bl);
1413 const arch_register_t **regs;
1417 get the valid stack node in this block.
1418 If we had a call in that block there is a Keep constructed by process_calls()
1419 which points to the last stack modification in that block. we'll use
1420 it then. Else we use the stack from the start block and let
1421 the ssa construction fix the usage.
1423 stack = be_abi_reg_map_get(env->regs, arch_env->sp);
1425 stack = get_irn_n(keep, 0);
1427 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1430 /* Insert results for Return into the register map. */
1431 for(i = 0; i < n_res; ++i) {
1432 ir_node *res = get_Return_res(irn, i);
1433 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1434 assert(arg->in_reg && "return value must be passed in register");
1435 pmap_insert(reg_map, (void *) arg->reg, res);
1438 /* Add uses of the callee save registers. */
1439 foreach_pmap(env->regs, ent) {
1440 const arch_register_t *reg = ent->key;
1441 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1442 pmap_insert(reg_map, ent->key, ent->value);
1445 be_abi_reg_map_set(reg_map, arch_env->sp, stack);
1447 /* Make the Epilogue node and call the arch's epilogue maker. */
1448 create_barrier(env, bl, &mem, reg_map, 1);
1449 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1452 Maximum size of the in array for Return nodes is
1453 return args + callee save/ignore registers + memory + stack pointer
1455 in_max = pmap_count(reg_map) + n_res + 2;
1457 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1458 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1461 in[1] = be_abi_reg_map_get(reg_map, arch_env->sp);
1463 regs[1] = arch_env->sp;
1466 /* clear SP entry, since it has already been grown. */
1467 pmap_insert(reg_map, (void *) arch_env->sp, NULL);
1468 for(i = 0; i < n_res; ++i) {
1469 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1471 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1472 regs[n++] = arg->reg;
1474 /* Clear the map entry to mark the register as processed. */
1475 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1478 /* grow the rest of the stuff. */
1479 foreach_pmap(reg_map, ent) {
1482 regs[n++] = ent->key;
1486 /* The in array for the new back end return is now ready. */
1488 dbgi = get_irn_dbg_info(irn);
1492 /* we have to pop the shadow parameter in in case of struct returns */
1494 ret = be_new_Return(dbgi, env->birg->irg, bl, n_res, pop, n, in);
1496 /* Set the register classes of the return's parameter accordingly. */
1497 for(i = 0; i < n; ++i)
1499 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1501 /* Free the space of the Epilog's in array and the register <-> proj map. */
1502 obstack_free(&env->obst, in);
1503 pmap_destroy(reg_map);
1508 typedef struct lower_frame_sels_env_t {
1510 ir_entity *value_param_list; /**< the list of all value param entities */
1511 ir_entity *value_param_tail; /**< the tail of the list of all value param entities */
1512 } lower_frame_sels_env_t;
1515 * Walker: Replaces Sels of frame type and
1516 * value param type entities by FrameAddress.
1517 * Links all used entities.
1519 static void lower_frame_sels_walker(ir_node *irn, void *data) {
1520 lower_frame_sels_env_t *ctx = data;
1523 ir_graph *irg = current_ir_graph;
1524 ir_node *frame = get_irg_frame(irg);
1525 ir_node *param_base = get_irg_value_param_base(irg);
1526 ir_node *ptr = get_Sel_ptr(irn);
1528 if (ptr == frame || ptr == param_base) {
1529 be_abi_irg_t *env = ctx->env;
1530 ir_entity *ent = get_Sel_entity(irn);
1531 ir_node *bl = get_nodes_block(irn);
1534 nw = be_new_FrameAddr(env->arch_env->sp->reg_class, irg, bl, frame, ent);
1537 /* check, if it's a param sel and if have not seen this entity before */
1538 if (ptr == param_base &&
1539 ent != ctx->value_param_tail &&
1540 get_entity_link(ent) == NULL) {
1541 set_entity_link(ent, ctx->value_param_list);
1542 ctx->value_param_list = ent;
1543 if (ctx->value_param_tail == NULL) ctx->value_param_tail = ent;
1550 * Check if a value parameter is transmitted as a register.
1551 * This might happen if the address of an parameter is taken which is
1552 * transmitted in registers.
1554 * Note that on some architectures this case must be handled specially
1555 * because the place of the backing store is determined by their ABI.
1557 * In the default case we move the entity to the frame type and create
1558 * a backing store into the first block.
1560 static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_entity *value_param_list) {
1561 be_abi_call_t *call = env->call;
1562 ir_graph *irg = env->birg->irg;
1563 ir_entity *ent, *next_ent, *new_list;
1565 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1568 for (ent = value_param_list; ent; ent = next_ent) {
1569 int i = get_struct_member_index(get_entity_owner(ent), ent);
1570 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1572 next_ent = get_entity_link(ent);
1574 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", i));
1575 set_entity_link(ent, new_list);
1580 /* ok, change the graph */
1581 ir_node *start_bl = get_irg_start_block(irg);
1582 ir_node *first_bl = NULL;
1583 ir_node *frame, *imem, *nmem, *store, *mem, *args, *args_bl;
1584 const ir_edge_t *edge;
1585 optimization_state_t state;
1588 foreach_block_succ(start_bl, edge) {
1589 ir_node *succ = get_edge_src_irn(edge);
1590 if (start_bl != succ) {
1596 /* we had already removed critical edges, so the following
1597 assertion should be always true. */
1598 assert(get_Block_n_cfgpreds(first_bl) == 1);
1600 /* now create backing stores */
1601 frame = get_irg_frame(irg);
1602 imem = get_irg_initial_mem(irg);
1604 save_optimization_state(&state);
1606 nmem = new_r_Proj(irg, first_bl, get_irg_start(irg), mode_M, pn_Start_M);
1607 restore_optimization_state(&state);
1609 /* reroute all edges to the new memory source */
1610 edges_reroute(imem, nmem, irg);
1614 args = get_irg_args(irg);
1615 args_bl = get_nodes_block(args);
1616 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1617 int i = get_struct_member_index(get_entity_owner(ent), ent);
1618 ir_type *tp = get_entity_type(ent);
1619 ir_mode *mode = get_type_mode(tp);
1622 /* address for the backing store */
1623 addr = be_new_FrameAddr(env->arch_env->sp->reg_class, irg, first_bl, frame, ent);
1626 mem = new_r_Proj(irg, first_bl, store, mode_M, pn_Store_M);
1628 /* the backing store itself */
1629 store = new_r_Store(irg, first_bl, mem, addr,
1630 new_r_Proj(irg, args_bl, args, mode, i));
1632 /* the new memory Proj gets the last Proj from store */
1633 set_Proj_pred(nmem, store);
1634 set_Proj_proj(nmem, pn_Store_M);
1636 /* move all entities to the frame type */
1637 frame_tp = get_irg_frame_type(irg);
1638 offset = get_type_size_bytes(frame_tp);
1640 /* we will add new entities: set the layout to undefined */
1641 assert(get_type_state(frame_tp) == layout_fixed);
1642 set_type_state(frame_tp, layout_undefined);
1643 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1644 ir_type *tp = get_entity_type(ent);
1645 unsigned align = get_type_alignment_bytes(tp);
1647 offset += align - 1;
1648 offset &= ~(align - 1);
1649 set_entity_owner(ent, frame_tp);
1650 add_class_member(frame_tp, ent);
1651 /* must be automatic to set a fixed layout */
1652 set_entity_allocation(ent, allocation_automatic);
1653 set_entity_offset(ent, offset);
1654 offset += get_type_size_bytes(tp);
1656 set_type_size_bytes(frame_tp, offset);
1657 /* fix the layout again */
1658 set_type_state(frame_tp, layout_fixed);
1664 * The start block has no jump, instead it has an initial exec Proj.
1665 * The backend wants to handle all blocks the same way, so we replace
1666 * the out cfg edge with a real jump.
1668 static void fix_start_block(ir_node *block, void *env) {
1671 ir_node *start_block;
1674 /* we processed the start block, return */
1678 irg = get_irn_irg(block);
1679 start_block = get_irg_start_block(irg);
1681 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1682 ir_node *pred = get_Block_cfgpred(block, i);
1683 ir_node *pred_block = get_nodes_block(pred);
1685 /* ok, we are in the block, having start as cfg predecessor */
1686 if (pred_block == start_block) {
1687 ir_node *jump = new_r_Jmp(irg, pred_block);
1688 set_Block_cfgpred(block, i, jump);
1696 * Modify the irg itself and the frame type.
1698 static void modify_irg(be_abi_irg_t *env)
1700 be_abi_call_t *call = env->call;
1701 const arch_env_t *arch_env= env->birg->main_env->arch_env;
1702 const arch_register_t *sp = arch_env_sp(arch_env);
1703 ir_graph *irg = env->birg->irg;
1704 ir_node *bl = get_irg_start_block(irg);
1705 ir_node *end = get_irg_end_block(irg);
1706 ir_node *old_mem = get_irg_initial_mem(irg);
1707 ir_node *new_mem_proj;
1709 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1710 pset *dont_save = pset_new_ptr(8);
1717 const arch_register_t *fp_reg;
1718 ir_node *frame_pointer;
1719 ir_node *reg_params_bl;
1722 ir_node *value_param_base;
1723 const ir_edge_t *edge;
1724 ir_type *arg_type, *bet_type, *tp;
1725 lower_frame_sels_env_t ctx;
1726 ir_entity **param_map;
1728 bitset_t *used_proj_nr;
1729 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1731 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1733 /* set the links of all frame entities to NULL, we use it
1734 to detect if an entity is already linked in the value_param_list */
1735 tp = get_method_value_param_type(method_type);
1737 for (i = get_struct_n_members(tp) - 1; i >= 0; --i)
1738 set_entity_link(get_struct_member(tp, i), NULL);
1741 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1743 ctx.value_param_list = NULL;
1744 ctx.value_param_tail = NULL;
1745 irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
1747 /* value_param_base anchor is not needed anymore now */
1748 value_param_base = get_irg_value_param_base(irg);
1749 kill_node(value_param_base);
1750 set_irg_value_param_base(irg, new_r_Bad(irg));
1752 env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0]));
1753 env->regs = pmap_create();
1755 used_proj_nr = bitset_alloca(1024);
1756 n_params = get_method_n_params(method_type);
1757 args = obstack_alloc(&env->obst, n_params * sizeof(args[0]));
1758 memset(args, 0, n_params * sizeof(args[0]));
1760 /* Check if a value parameter is transmitted as a register.
1761 * This might happen if the address of an parameter is taken which is
1762 * transmitted in registers.
1764 * Note that on some architectures this case must be handled specially
1765 * because the place of the backing store is determined by their ABI.
1767 * In the default case we move the entity to the frame type and create
1768 * a backing store into the first block.
1770 fix_address_of_parameter_access(env, ctx.value_param_list);
1772 /* Fill the argument vector */
1773 arg_tuple = get_irg_args(irg);
1774 foreach_out_edge(arg_tuple, edge) {
1775 ir_node *irn = get_edge_src_irn(edge);
1776 if (! is_Anchor(irn)) {
1777 int nr = get_Proj_proj(irn);
1779 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1783 arg_type = compute_arg_type(env, call, method_type, ¶m_map);
1784 bet_type = call->cb->get_between_type(env->cb);
1785 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), arch_env->stack_dir, param_map);
1787 /* Count the register params and add them to the number of Projs for the RegParams node */
1788 for(i = 0; i < n_params; ++i) {
1789 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1790 if(arg->in_reg && args[i]) {
1791 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1792 assert(i == get_Proj_proj(args[i]));
1794 /* For now, associate the register with the old Proj from Start representing that argument. */
1795 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1796 bitset_set(used_proj_nr, i);
1797 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1801 /* Collect all callee-save registers */
1802 for(i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
1803 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
1804 for(j = 0; j < cls->n_regs; ++j) {
1805 const arch_register_t *reg = &cls->regs[j];
1806 if(arch_register_type_is(reg, callee_save) ||
1807 arch_register_type_is(reg, state)) {
1808 pmap_insert(env->regs, (void *) reg, NULL);
1813 pmap_insert(env->regs, (void *) sp, NULL);
1814 pmap_insert(env->regs, (void *) arch_env->bp, NULL);
1815 reg_params_bl = get_irg_start_block(irg);
1816 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1817 add_irn_dep(env->reg_params, get_irg_start(irg));
1820 * make proj nodes for the callee save registers.
1821 * memorize them, since Return nodes get those as inputs.
1823 * Note, that if a register corresponds to an argument, the regs map contains
1824 * the old Proj from start for that argument.
1827 rm = reg_map_to_arr(&env->obst, env->regs);
1828 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1829 arch_register_t *reg = (void *) rm[i].reg;
1830 ir_mode *mode = reg->reg_class->mode;
1832 int pos = BE_OUT_POS((int) nr);
1838 bitset_set(used_proj_nr, nr);
1839 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1840 pmap_insert(env->regs, (void *) reg, proj);
1841 be_set_constr_single_reg(env->reg_params, pos, reg);
1842 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1845 * If the register is an ignore register,
1846 * The Proj for that register shall also be ignored during register allocation.
1848 if(arch_register_type_is(reg, ignore))
1849 flags |= arch_irn_flags_ignore;
1852 flags |= arch_irn_flags_modify_sp;
1854 be_node_set_flags(env->reg_params, pos, flags);
1856 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1858 obstack_free(&env->obst, rm);
1860 /* create a new initial memory proj */
1861 assert(is_Proj(old_mem));
1862 new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
1863 new_r_Unknown(irg, mode_T), mode_M,
1864 get_Proj_proj(old_mem));
1867 /* Generate the Prologue */
1868 fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
1870 /* do the stack allocation BEFORE the barrier, or spill code
1871 might be added before it */
1872 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1873 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND, 0);
1874 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1876 create_barrier(env, bl, &mem, env->regs, 0);
1878 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1879 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1881 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1882 set_irg_frame(irg, frame_pointer);
1883 pset_insert_ptr(env->ignore_regs, fp_reg);
1885 /* rewire old mem users to new mem */
1886 set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
1887 exchange(old_mem, mem);
1889 set_irg_initial_mem(irg, mem);
1891 /* Now, introduce stack param nodes for all parameters passed on the stack */
1892 for(i = 0; i < n_params; ++i) {
1893 ir_node *arg_proj = args[i];
1894 ir_node *repl = NULL;
1896 if(arg_proj != NULL) {
1897 be_abi_call_arg_t *arg;
1898 ir_type *param_type;
1899 int nr = get_Proj_proj(arg_proj);
1902 nr = MIN(nr, n_params);
1903 arg = get_call_arg(call, 0, nr);
1904 param_type = get_method_param_type(method_type, nr);
1907 repl = pmap_get(env->regs, (void *) arg->reg);
1908 } else if(arg->on_stack) {
1909 ir_node *addr = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1911 /* For atomic parameters which are actually used, we create a Load node. */
1912 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1913 ir_mode *mode = get_type_mode(param_type);
1914 ir_mode *load_mode = arg->load_mode;
1916 ir_node *load = new_r_Load(irg, reg_params_bl, new_NoMem(), addr, load_mode);
1917 set_irn_pinned(load, op_pin_state_floats);
1918 repl = new_r_Proj(irg, reg_params_bl, load, load_mode, pn_Load_res);
1920 if (mode != load_mode) {
1921 repl = new_r_Conv(irg, reg_params_bl, repl, mode);
1924 /* The stack parameter is not primitive (it is a struct or array),
1925 * we thus will create a node representing the parameter's address
1931 assert(repl != NULL);
1933 /* Beware: the mode of the register parameters is always the mode of the register class
1934 which may be wrong. Add Conv's then. */
1935 mode = get_irn_mode(args[i]);
1936 if (mode != get_irn_mode(repl)) {
1937 repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
1939 exchange(args[i], repl);
1943 /* the arg proj is not needed anymore now and should be only used by the anchor */
1944 assert(get_irn_n_edges(arg_tuple) == 1);
1945 kill_node(arg_tuple);
1946 set_irg_args(irg, new_rd_Bad(irg));
1948 /* All Return nodes hang on the End node, so look for them there. */
1949 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1950 ir_node *irn = get_Block_cfgpred(end, i);
1952 if (is_Return(irn)) {
1953 ir_node *blk = get_nodes_block(irn);
1954 ir_node *mem = get_Return_mem(irn);
1955 ir_node *ret = create_be_return(env, irn, blk, mem, get_Return_n_ress(irn));
1959 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
1960 the code is dead and will never be executed. */
1962 del_pset(dont_save);
1963 obstack_free(&env->obst, args);
1965 /* handle start block here (place a jump in the block) */
1967 irg_block_walk_graph(irg, fix_start_block, NULL, &i);
1970 /** Fix the state inputs of calls that still hang on unknowns */
1972 void fix_call_state_inputs(be_abi_irg_t *env)
1974 const arch_env_t *arch_env = env->arch_env;
1976 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
1978 /* Collect caller save registers */
1979 n = arch_env_get_n_reg_class(arch_env);
1980 for(i = 0; i < n; ++i) {
1982 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
1983 for(j = 0; j < cls->n_regs; ++j) {
1984 const arch_register_t *reg = arch_register_for_index(cls, j);
1985 if(arch_register_type_is(reg, state)) {
1986 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
1991 n = ARR_LEN(env->calls);
1992 n_states = ARR_LEN(stateregs);
1993 for(i = 0; i < n; ++i) {
1995 ir_node *call = env->calls[i];
1997 arity = get_irn_arity(call);
1999 /* the state reg inputs are the last n inputs of the calls */
2000 for(s = 0; s < n_states; ++s) {
2001 int inp = arity - n_states + s;
2002 const arch_register_t *reg = stateregs[s];
2003 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
2005 set_irn_n(call, inp, regnode);
2009 DEL_ARR_F(stateregs);
2013 * Create a trampoline entity for the given method.
2015 static ir_entity *create_trampoline(be_main_env_t *be, ir_entity *method)
2017 ir_type *type = get_entity_type(method);
2018 ident *old_id = get_entity_ld_ident(method);
2019 ident *id = mangle3("L", old_id, "$stub");
2020 ir_type *parent = be->pic_trampolines_type;
2021 ir_entity *ent = new_entity(parent, old_id, type);
2022 set_entity_ld_ident(ent, id);
2023 set_entity_visibility(ent, visibility_local);
2024 set_entity_variability(ent, variability_uninitialized);
2030 * Returns the trampoline entity for the given method.
2032 static ir_entity *get_trampoline(be_main_env_t *env, ir_entity *method)
2034 ir_entity *result = pmap_get(env->ent_trampoline_map, method);
2035 if (result == NULL) {
2036 result = create_trampoline(env, method);
2037 pmap_insert(env->ent_trampoline_map, method, result);
2043 static ir_entity *create_pic_symbol(be_main_env_t *be, ir_entity *entity)
2045 ident *old_id = get_entity_ld_ident(entity);
2046 ident *id = mangle3("L", old_id, "$non_lazy_ptr");
2047 ir_type *e_type = get_entity_type(entity);
2048 ir_type *type = new_type_pointer(id, e_type, mode_P_data);
2049 ir_type *parent = be->pic_symbols_type;
2050 ir_entity *ent = new_entity(parent, old_id, type);
2051 set_entity_ld_ident(ent, id);
2052 set_entity_visibility(ent, visibility_local);
2053 set_entity_variability(ent, variability_uninitialized);
2058 static ir_entity *get_pic_symbol(be_main_env_t *env, ir_entity *entity)
2060 ir_entity *result = pmap_get(env->ent_pic_symbol_map, entity);
2061 if (result == NULL) {
2062 result = create_pic_symbol(env, entity);
2063 pmap_insert(env->ent_pic_symbol_map, entity, result);
2072 * Returns non-zero if a given entity can be accessed using a relative address.
2074 static int can_address_relative(ir_entity *entity)
2076 return get_entity_variability(entity) == variability_initialized
2077 || get_entity_visibility(entity) == visibility_local;
2080 /** patches SymConsts to work in position independent code */
2081 static void fix_pic_symconsts(ir_node *node, void *data)
2091 be_abi_irg_t *env = data;
2093 be_main_env_t *be = env->birg->main_env;
2095 arity = get_irn_arity(node);
2096 for (i = 0; i < arity; ++i) {
2098 ir_node *pred = get_irn_n(node, i);
2100 ir_entity *pic_symbol;
2101 ir_node *pic_symconst;
2103 if (!is_SymConst(pred))
2106 entity = get_SymConst_entity(pred);
2107 block = get_nodes_block(pred);
2108 irg = get_irn_irg(pred);
2110 /* calls can jump to relative addresses, so we can directly jump to
2111 the (relatively) known call address or the trampoline */
2112 if (is_Call(node) && i == 1) {
2113 ir_entity *trampoline;
2114 ir_node *trampoline_const;
2116 if (can_address_relative(entity))
2119 dbgi = get_irn_dbg_info(pred);
2120 trampoline = get_trampoline(be, entity);
2121 trampoline_const = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2123 set_irn_n(node, i, trampoline_const);
2127 /* everything else is accessed relative to EIP */
2128 mode = get_irn_mode(pred);
2129 unknown = new_r_Unknown(irg, mode);
2130 pic_base = arch_code_generator_get_pic_base(env->birg->cg);
2131 add = new_r_Add(irg, block, pic_base, pred, mode);
2133 /* make sure the walker doesn't visit this add again */
2134 mark_irn_visited(add);
2136 /* all ok now for locally constructed stuff */
2137 if (can_address_relative(entity)) {
2138 set_irn_n(node, i, add);
2142 /* get entry from pic symbol segment */
2143 dbgi = get_irn_dbg_info(pred);
2144 pic_symbol = get_pic_symbol(be, entity);
2145 pic_symconst = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2147 set_Add_right(add, pic_symconst);
2149 /* we need an extra indirection for global data outside our current
2150 module. The loads are always safe and can therefore float
2151 and need no memory input */
2152 load = new_r_Load(irg, block, new_NoMem(), add, mode);
2153 load_res = new_r_Proj(irg, block, load, mode, pn_Load_res);
2154 set_irn_pinned(load, op_pin_state_floats);
2156 set_irn_n(node, i, load_res);
2160 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2162 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
2163 ir_node *old_frame = get_irg_frame(birg->irg);
2164 ir_graph *irg = birg->irg;
2168 optimization_state_t state;
2169 unsigned *limited_bitset;
2171 be_omit_fp = birg->main_env->options->omit_fp;
2172 be_omit_leaf_fp = birg->main_env->options->omit_leaf_fp;
2174 obstack_init(&env->obst);
2176 env->arch_env = birg->main_env->arch_env;
2177 env->method_type = get_entity_type(get_irg_entity(irg));
2178 env->call = be_abi_call_new(env->arch_env->sp->reg_class);
2179 arch_env_get_call_abi(env->arch_env, env->method_type, env->call);
2181 env->ignore_regs = pset_new_ptr_default();
2182 env->keep_map = pmap_create();
2183 env->dce_survivor = new_survive_dce();
2186 env->sp_req.type = arch_register_req_type_limited;
2187 env->sp_req.cls = arch_register_get_class(env->arch_env->sp);
2188 limited_bitset = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
2189 rbitset_set(limited_bitset, arch_register_get_index(env->arch_env->sp));
2190 env->sp_req.limited = limited_bitset;
2192 env->sp_cls_req.type = arch_register_req_type_normal;
2193 env->sp_cls_req.cls = arch_register_get_class(env->arch_env->sp);
2195 /* Beware: later we replace this node by the real one, ensure it is not CSE'd
2196 to another Unknown or the stack pointer gets used */
2197 save_optimization_state(&state);
2199 env->init_sp = dummy = new_r_Unknown(irg, env->arch_env->sp->reg_class->mode);
2200 restore_optimization_state(&state);
2201 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
2203 env->calls = NEW_ARR_F(ir_node*, 0);
2205 if (birg->main_env->options->pic) {
2206 irg_walk_graph(irg, fix_pic_symconsts, NULL, env);
2209 /* Lower all call nodes in the IRG. */
2213 Beware: init backend abi call object after processing calls,
2214 otherwise some information might be not yet available.
2216 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2218 /* Process the IRG */
2221 /* fix call inputs for state registers */
2222 fix_call_state_inputs(env);
2224 /* We don't need the keep map anymore. */
2225 pmap_destroy(env->keep_map);
2226 env->keep_map = NULL;
2228 /* calls array is not needed anymore */
2229 DEL_ARR_F(env->calls);
2232 /* reroute the stack origin of the calls to the true stack origin. */
2233 exchange(dummy, env->init_sp);
2234 exchange(old_frame, get_irg_frame(irg));
2236 /* Make some important node pointers survive the dead node elimination. */
2237 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2238 foreach_pmap(env->regs, ent) {
2239 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2242 env->call->cb->done(env->cb);
2247 void be_abi_free(be_abi_irg_t *env)
2249 be_abi_call_free(env->call);
2250 free_survive_dce(env->dce_survivor);
2251 del_pset(env->ignore_regs);
2252 pmap_destroy(env->regs);
2253 obstack_free(&env->obst, NULL);
2257 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2259 arch_register_t *reg;
2261 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2262 if(reg->reg_class == cls)
2263 bitset_set(bs, reg->index);
2266 void be_abi_set_non_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, unsigned *raw_bitset)
2269 arch_register_t *reg;
2271 for (i = 0; i < cls->n_regs; ++i) {
2272 if (arch_register_type_is(&cls->regs[i], ignore))
2275 rbitset_set(raw_bitset, i);
2278 for (reg = pset_first(abi->ignore_regs); reg != NULL;
2279 reg = pset_next(abi->ignore_regs)) {
2280 if (reg->reg_class != cls)
2283 rbitset_clear(raw_bitset, reg->index);
2287 /* Returns the stack layout from a abi environment. */
2288 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi) {
2295 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2296 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2297 | _| | |> < ___) | || (_| | (__| <
2298 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2302 typedef ir_node **node_array;
2304 typedef struct fix_stack_walker_env_t {
2305 node_array sp_nodes;
2306 const arch_env_t *arch_env;
2307 } fix_stack_walker_env_t;
2310 * Walker. Collect all stack modifying nodes.
2312 static void collect_stack_nodes_walker(ir_node *node, void *data)
2314 fix_stack_walker_env_t *env = data;
2316 if (arch_irn_is(env->arch_env, node, modify_sp)) {
2317 assert(get_irn_mode(node) != mode_M && get_irn_mode(node) != mode_T);
2318 ARR_APP1(ir_node*, env->sp_nodes, node);
2322 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2324 be_ssa_construction_env_t senv;
2327 be_irg_t *birg = env->birg;
2328 be_lv_t *lv = be_get_birg_liveness(birg);
2329 fix_stack_walker_env_t walker_env;
2331 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2332 walker_env.arch_env = birg->main_env->arch_env;
2334 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2336 /* nothing to be done if we didn't find any node, in fact we mustn't
2337 * continue, as for endless loops incsp might have had no users and is bad
2340 len = ARR_LEN(walker_env.sp_nodes);
2342 DEL_ARR_F(walker_env.sp_nodes);
2346 be_ssa_construction_init(&senv, birg);
2347 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2348 ARR_LEN(walker_env.sp_nodes));
2349 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2350 ARR_LEN(walker_env.sp_nodes));
2353 len = ARR_LEN(walker_env.sp_nodes);
2354 for(i = 0; i < len; ++i) {
2355 be_liveness_update(lv, walker_env.sp_nodes[i]);
2357 be_ssa_construction_update_liveness_phis(&senv, lv);
2360 phis = be_ssa_construction_get_new_phis(&senv);
2362 /* set register requirements for stack phis */
2363 len = ARR_LEN(phis);
2364 for(i = 0; i < len; ++i) {
2365 ir_node *phi = phis[i];
2366 be_set_phi_reg_req(walker_env.arch_env, phi, &env->sp_req);
2367 be_set_phi_flags(walker_env.arch_env, phi, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
2368 arch_set_irn_register(walker_env.arch_env, phi, env->arch_env->sp);
2370 be_ssa_construction_destroy(&senv);
2372 DEL_ARR_F(walker_env.sp_nodes);
2375 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int real_bias)
2377 const arch_env_t *arch_env = env->birg->main_env->arch_env;
2378 int omit_fp = env->call->flags.bits.try_omit_fp;
2380 int wanted_bias = real_bias;
2382 sched_foreach(bl, irn) {
2386 Check, if the node relates to an entity on the stack frame.
2387 If so, set the true offset (including the bias) for that
2390 ir_entity *ent = arch_get_frame_entity(arch_env, irn);
2392 int bias = omit_fp ? real_bias : 0;
2393 int offset = get_stack_entity_offset(env->frame, ent, bias);
2394 arch_set_frame_offset(arch_env, irn, offset);
2395 DBG((env->dbg, LEVEL_2, "%F has offset %d (including bias %d)\n",
2396 ent, offset, bias));
2400 * If the node modifies the stack pointer by a constant offset,
2401 * record that in the bias.
2403 ofs = arch_get_sp_bias(arch_env, irn);
2405 if(be_is_IncSP(irn)) {
2406 /* fill in real stack frame size */
2407 if(ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2408 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2409 ofs = (int) get_type_size_bytes(frame_type);
2410 be_set_IncSP_offset(irn, ofs);
2411 } else if(ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2412 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2413 ofs = - (int)get_type_size_bytes(frame_type);
2414 be_set_IncSP_offset(irn, ofs);
2416 if (be_get_IncSP_align(irn)) {
2417 /* patch IncSP to produce an aligned stack pointer */
2418 ir_type *between_type = env->frame->between_type;
2419 int between_size = get_type_size_bytes(between_type);
2420 int alignment = 1 << env->arch_env->stack_alignment;
2421 int delta = (real_bias + ofs + between_size) & (alignment - 1);
2424 be_set_IncSP_offset(irn, ofs + alignment - delta);
2425 real_bias += alignment - delta;
2428 /* adjust so real_bias corresponds with wanted_bias */
2429 int delta = wanted_bias - real_bias;
2432 be_set_IncSP_offset(irn, ofs + delta);
2443 assert(real_bias == wanted_bias);
2448 * A helper struct for the bias walker.
2451 be_abi_irg_t *env; /**< The ABI irg environment. */
2452 int start_block_bias; /**< The bias at the end of the start block. */
2454 ir_node *start_block; /**< The start block of the current graph. */
2458 * Block-Walker: fix all stack offsets
2460 static void stack_bias_walker(ir_node *bl, void *data)
2462 struct bias_walk *bw = data;
2463 if (bl != bw->start_block) {
2464 process_stack_bias(bw->env, bl, bw->start_block_bias);
2468 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2470 ir_graph *irg = env->birg->irg;
2471 struct bias_walk bw;
2473 stack_frame_compute_initial_offset(env->frame);
2474 // stack_layout_dump(stdout, env->frame);
2476 /* Determine the stack bias at the end of the start block. */
2477 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0);
2478 bw.between_size = get_type_size_bytes(env->frame->between_type);
2480 /* fix the bias is all other blocks */
2482 bw.start_block = get_irg_start_block(irg);
2483 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2486 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2488 assert(arch_register_type_is(reg, callee_save));
2489 assert(pmap_contains(abi->regs, (void *) reg));
2490 return pmap_get(abi->regs, (void *) reg);
2493 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2495 assert(arch_register_type_is(reg, ignore));
2496 assert(pmap_contains(abi->regs, (void *) reg));
2497 return pmap_get(abi->regs, (void *) reg);
2501 * Returns non-zero if the ABI has omitted the frame pointer in
2502 * the current graph.
2504 int be_abi_omit_fp(const be_abi_irg_t *abi) {
2505 return abi->call->flags.bits.try_omit_fp;