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)
288 /* Add the size of all the types below the one of the entity to the entity's offset */
289 ofs += get_type_size_bytes(frame->order[index]);
292 /* correct the offset by the initial position of the frame pointer */
293 ofs -= frame->initial_offset;
295 /* correct the offset with the current bias. */
302 * Retrieve the entity with given offset from a frame type.
304 static ir_entity *search_ent_with_offset(ir_type *t, int offset)
308 for(i = 0, n = get_compound_n_members(t); i < n; ++i) {
309 ir_entity *ent = get_compound_member(t, i);
310 if (get_entity_offset(ent) == offset)
317 static int stack_frame_compute_initial_offset(be_stack_layout_t *frame)
319 ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
320 ir_entity *ent = search_ent_with_offset(base, 0);
322 frame->initial_offset = ent ? get_stack_entity_offset(frame, ent, 0) : 0;
324 return frame->initial_offset;
328 * Initializes the frame layout from parts
330 * @param frame the stack layout that will be initialized
331 * @param args the stack argument layout type
332 * @param between the between layout type
333 * @param locals the method frame type
334 * @param stack_dir the stack direction
335 * @param param_map an array mapping method argument positions to the stack argument type
337 * @return the initialized stack layout
339 static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *args,
340 ir_type *between, ir_type *locals, int stack_dir,
341 ir_entity *param_map[])
343 frame->arg_type = args;
344 frame->between_type = between;
345 frame->frame_type = locals;
346 frame->initial_offset = 0;
347 frame->initial_bias = 0;
348 frame->stack_dir = stack_dir;
349 frame->order[1] = between;
350 frame->param_map = param_map;
353 frame->order[0] = args;
354 frame->order[2] = locals;
357 frame->order[0] = locals;
358 frame->order[2] = args;
364 /** Dumps the stack layout to file. */
365 static void stack_layout_dump(FILE *file, be_stack_layout_t *frame)
369 ir_fprintf(file, "initial offset: %d\n", frame->initial_offset);
370 for (j = 0; j < N_FRAME_TYPES; ++j) {
371 ir_type *t = frame->order[j];
373 ir_fprintf(file, "type %d: %F size: %d\n", j, t, get_type_size_bytes(t));
374 for (i = 0, n = get_compound_n_members(t); i < n; ++i) {
375 ir_entity *ent = get_compound_member(t, i);
376 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));
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);
420 pset *results = pset_new_ptr(8);
421 pset *caller_save = pset_new_ptr(8);
422 pset *states = pset_new_ptr(2);
424 int stack_dir = arch_env_stack_dir(arch_env);
425 const arch_register_t *sp = arch_env_sp(arch_env);
426 be_abi_call_t *call = be_abi_call_new(sp->reg_class);
427 ir_mode *mach_mode = sp->reg_class->mode;
428 struct obstack *obst = &env->obst;
429 int no_alloc = call->flags.bits.frame_is_setup_on_call;
430 int n_res = get_method_n_ress(call_tp);
431 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
433 ir_node *res_proj = NULL;
434 int n_reg_params = 0;
435 int n_stack_params = 0;
441 int n_reg_results = 0;
442 const arch_register_t *reg;
443 const ir_edge_t *edge;
445 int *stack_param_idx;
448 /* Let the isa fill out the abi description for that call node. */
449 arch_env_get_call_abi(arch_env, call_tp, call);
451 /* Insert code to put the stack arguments on the stack. */
452 assert(get_Call_n_params(irn) == n_params);
453 for (i = 0; i < n_params; ++i) {
454 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
457 int arg_size = get_type_size_bytes(get_method_param_type(call_tp, i));
459 stack_size += round_up2(arg->space_before, arg->alignment);
460 stack_size += round_up2(arg_size, arg->alignment);
461 stack_size += round_up2(arg->space_after, arg->alignment);
462 obstack_int_grow(obst, i);
466 stack_param_idx = obstack_finish(obst);
468 /* Collect all arguments which are passed in registers. */
469 for (i = 0; i < n_params; ++i) {
470 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
471 if (arg && arg->in_reg) {
472 obstack_int_grow(obst, i);
476 reg_param_idxs = obstack_finish(obst);
479 * If the stack is decreasing and we do not want to store sequentially,
480 * or someone else allocated the call frame
481 * we allocate as much space on the stack all parameters need, by
482 * moving the stack pointer along the stack's direction.
484 * Note: we also have to do this for stack_size == 0, because we may have
485 * to adjust stack alignment for the call.
487 if (stack_dir < 0 && !do_seq && !no_alloc) {
488 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, stack_size, 1);
491 /* If there are some parameters which shall be passed on the stack. */
492 if (n_stack_params > 0) {
496 * Reverse list of stack parameters if call arguments are from left to right.
497 * We must them reverse again if they are pushed (not stored) and the stack
498 * direction is downwards.
500 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
501 for (i = 0; i < n_stack_params >> 1; ++i) {
502 int other = n_stack_params - i - 1;
503 int tmp = stack_param_idx[i];
504 stack_param_idx[i] = stack_param_idx[other];
505 stack_param_idx[other] = tmp;
509 curr_mem = get_Call_mem(irn);
511 obstack_ptr_grow(obst, curr_mem);
514 for (i = 0; i < n_stack_params; ++i) {
515 int p = stack_param_idx[i];
516 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
517 ir_node *param = get_Call_param(irn, p);
518 ir_node *addr = curr_sp;
520 ir_type *param_type = get_method_param_type(call_tp, p);
521 int param_size = get_type_size_bytes(param_type) + arg->space_after;
524 * If we wanted to build the arguments sequentially,
525 * the stack pointer for the next must be incremented,
526 * and the memory value propagated.
530 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, param_size + arg->space_before, 0);
531 add_irn_dep(curr_sp, curr_mem);
534 curr_ofs += arg->space_before;
535 curr_ofs = round_up2(curr_ofs, arg->alignment);
537 /* Make the expression to compute the argument's offset. */
539 ir_mode *constmode = mach_mode;
540 if(mode_is_reference(mach_mode)) {
543 addr = new_r_Const_long(irg, bl, constmode, curr_ofs);
544 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
548 /* Insert a store for primitive arguments. */
549 if (is_atomic_type(param_type)) {
551 ir_node *mem_input = do_seq ? curr_mem : new_NoMem();
552 store = new_r_Store(irg, bl, mem_input, addr, param);
553 mem = new_r_Proj(irg, bl, store, mode_M, pn_Store_M);
556 /* Make a mem copy for compound arguments. */
560 assert(mode_is_reference(get_irn_mode(param)));
561 copy = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type);
562 mem = new_r_Proj(irg, bl, copy, mode_M, pn_CopyB_M_regular);
565 curr_ofs += param_size;
570 obstack_ptr_grow(obst, mem);
573 in = (ir_node **) obstack_finish(obst);
575 /* We need the sync only, if we didn't build the stores sequentially. */
577 if (n_stack_params >= 1) {
578 curr_mem = new_r_Sync(irg, bl, n_stack_params + 1, in);
580 curr_mem = get_Call_mem(irn);
583 obstack_free(obst, in);
586 /* Collect caller save registers */
587 for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
589 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
590 for (j = 0; j < cls->n_regs; ++j) {
591 const arch_register_t *reg = arch_register_for_index(cls, j);
592 if (arch_register_type_is(reg, caller_save)) {
593 pset_insert_ptr(caller_save, (void *) reg);
595 if (arch_register_type_is(reg, state)) {
596 pset_insert_ptr(caller_save, (void*) reg);
597 pset_insert_ptr(states, (void*) reg);
602 /* search the greatest result proj number */
604 res_projs = alloca(n_res * sizeof(res_projs[0]));
605 memset(res_projs, 0, n_res * sizeof(res_projs[0]));
607 foreach_out_edge(irn, edge) {
608 const ir_edge_t *res_edge;
609 ir_node *irn = get_edge_src_irn(edge);
611 if(!is_Proj(irn) || get_Proj_proj(irn) != pn_Call_T_result)
614 foreach_out_edge(irn, res_edge) {
616 ir_node *res = get_edge_src_irn(res_edge);
618 assert(is_Proj(res));
620 proj = get_Proj_proj(res);
621 assert(proj < n_res);
622 assert(res_projs[proj] == NULL);
623 res_projs[proj] = res;
629 /** TODO: this is not correct for cases where return values are passed
630 * on the stack, but no known ABI does this currently...
632 n_reg_results = n_res;
634 /* make the back end call node and set its register requirements. */
635 for (i = 0; i < n_reg_params; ++i) {
636 obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
638 foreach_pset(states, reg) {
639 const arch_register_class_t *cls = arch_register_get_class(reg);
641 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
642 ir_fprintf(stderr, "Adding %+F\n", regnode);
644 ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
645 obstack_ptr_grow(obst, regnode);
647 n_ins = n_reg_params + pset_count(states);
649 in = obstack_finish(obst);
651 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
653 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
655 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
656 n_ins, in, get_Call_type(irn));
657 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
660 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
662 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
663 n_ins, in, get_Call_type(irn));
665 be_Call_set_pop(low_call, call->pop);
666 ARR_APP1(ir_node *, env->calls, low_call);
668 /* create new stack pointer */
669 curr_sp = new_r_Proj(irg, bl, low_call, get_irn_mode(curr_sp),
671 be_set_constr_single_reg(low_call, BE_OUT_POS(pn_be_Call_sp), sp);
672 arch_set_irn_register(arch_env, curr_sp, sp);
673 be_node_set_flags(low_call, BE_OUT_POS(pn_be_Call_sp),
674 arch_irn_flags_ignore | arch_irn_flags_modify_sp);
676 for(i = 0; i < n_res; ++i) {
678 ir_node *proj = res_projs[i];
679 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
681 /* returns values on stack not supported yet */
685 shift the proj number to the right, since we will drop the
686 unspeakable Proj_T from the Call. Therefore, all real argument
687 Proj numbers must be increased by pn_be_Call_first_res
689 pn = i + pn_be_Call_first_res;
692 ir_type *res_type = get_method_res_type(call_tp, i);
693 ir_mode *mode = get_type_mode(res_type);
694 proj = new_r_Proj(irg, bl, low_call, mode, pn);
697 set_Proj_pred(proj, low_call);
698 set_Proj_proj(proj, pn);
702 pset_remove_ptr(caller_save, arg->reg);
707 Set the register class of the call address to
708 the backend provided class (default: stack pointer class)
710 be_node_set_reg_class(low_call, be_pos_Call_ptr, call->cls_addr);
712 DBG((env->dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
714 /* Set the register classes and constraints of the Call parameters. */
715 for (i = 0; i < n_reg_params; ++i) {
716 int index = reg_param_idxs[i];
717 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
718 assert(arg->reg != NULL);
720 be_set_constr_single_reg(low_call, be_pos_Call_first_arg + i, arg->reg);
723 /* Set the register constraints of the results. */
724 for (i = 0; i < n_res; ++i) {
725 ir_node *proj = res_projs[i];
726 const be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
727 int pn = get_Proj_proj(proj);
730 be_set_constr_single_reg(low_call, BE_OUT_POS(pn), arg->reg);
731 arch_set_irn_register(arch_env, proj, arg->reg);
733 obstack_free(obst, in);
734 exchange(irn, low_call);
736 /* kill the ProjT node */
737 if (res_proj != NULL) {
741 /* Make additional projs for the caller save registers
742 and the Keep node which keeps them alive. */
743 if (1 || pset_count(caller_save) + n_reg_results > 0) {
744 const arch_register_t *reg;
749 = pn_be_Call_first_res + n_reg_results;
751 /* also keep the stack pointer */
753 set_irn_link(curr_sp, (void*) sp);
754 obstack_ptr_grow(obst, curr_sp);
756 for (reg = pset_first(caller_save); reg; reg = pset_next(caller_save), ++n) {
757 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode,
760 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
761 be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg);
762 arch_set_irn_register(arch_env, proj, reg);
764 /* a call can produce ignore registers, in this case set the flag and register for the Proj */
765 if (arch_register_type_is(reg, ignore)) {
766 be_node_set_flags(low_call, BE_OUT_POS(curr_res_proj),
767 arch_irn_flags_ignore);
770 set_irn_link(proj, (void*) reg);
771 obstack_ptr_grow(obst, proj);
775 for(i = 0; i < n_reg_results; ++i) {
776 ir_node *proj = res_projs[i];
777 const arch_register_t *reg = arch_get_irn_register(arch_env, proj);
778 set_irn_link(proj, (void*) reg);
779 obstack_ptr_grow(obst, proj);
783 /* create the Keep for the caller save registers */
784 in = (ir_node **) obstack_finish(obst);
785 keep = be_new_Keep(NULL, irg, bl, n, in);
786 for (i = 0; i < n; ++i) {
787 const arch_register_t *reg = get_irn_link(in[i]);
788 be_node_set_reg_class(keep, i, reg->reg_class);
790 obstack_free(obst, in);
793 /* Clean up the stack. */
794 assert(stack_size >= call->pop);
795 stack_size -= call->pop;
797 if (stack_size > 0) {
798 ir_node *mem_proj = NULL;
800 foreach_out_edge(low_call, edge) {
801 ir_node *irn = get_edge_src_irn(edge);
802 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
809 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_be_Call_M_regular);
810 keep_alive(mem_proj);
813 /* Clean up the stack frame or revert alignment fixes if we allocated it */
815 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size, 0);
818 be_abi_call_free(call);
819 obstack_free(obst, stack_param_idx);
822 del_pset(caller_save);
828 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
830 * @param alignment the minimum stack alignment
831 * @param size the node containing the non-aligned size
832 * @param irg the irg where new nodes are allocated on
833 * @param irg the block where new nodes are allocated on
834 * @param dbg debug info for new nodes
836 * @return a node representing the aligned size
838 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size,
839 ir_graph *irg, ir_node *block, dbg_info *dbg)
841 if (stack_alignment > 1) {
846 assert(is_po2(stack_alignment));
848 mode = get_irn_mode(size);
849 tv = new_tarval_from_long(stack_alignment-1, mode);
850 mask = new_r_Const(irg, block, mode, tv);
851 size = new_rd_Add(dbg, irg, block, size, mask, mode);
853 tv = new_tarval_from_long(-(long)stack_alignment, mode);
854 mask = new_r_Const(irg, block, mode, tv);
855 size = new_rd_And(dbg, irg, block, size, mask, mode);
861 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
863 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
872 const ir_edge_t *edge;
873 ir_node *new_alloc, *size, *addr, *ins[2];
874 unsigned stack_alignment;
876 assert(get_Alloc_where(alloc) == stack_alloc);
878 block = get_nodes_block(alloc);
879 irg = get_irn_irg(block);
882 type = get_Alloc_type(alloc);
884 foreach_out_edge(alloc, edge) {
885 ir_node *irn = get_edge_src_irn(edge);
887 assert(is_Proj(irn));
888 switch (get_Proj_proj(irn)) {
900 /* Beware: currently Alloc nodes without a result might happen,
901 only escape analysis kills them and this phase runs only for object
902 oriented source. We kill the Alloc here. */
903 if (alloc_res == NULL && alloc_mem) {
904 exchange(alloc_mem, get_Alloc_mem(alloc));
908 dbg = get_irn_dbg_info(alloc);
910 /* we might need to multiply the size with the element size */
911 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
912 tarval *tv = new_tarval_from_long(get_type_size_bytes(type),
914 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
915 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Alloc_size(alloc),
919 size = get_Alloc_size(alloc);
922 /* The stack pointer will be modified in an unknown manner.
923 We cannot omit it. */
924 env->call->flags.bits.try_omit_fp = 0;
926 stack_alignment = 1 << env->arch_env->stack_alignment;
927 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
928 new_alloc = be_new_AddSP(env->arch_env->sp, irg, block, curr_sp, size);
929 set_irn_dbg_info(new_alloc, dbg);
931 if(alloc_mem != NULL) {
935 addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
937 /* We need to sync the output mem of the AddSP with the input mem
938 edge into the alloc node. */
939 ins[0] = get_Alloc_mem(alloc);
941 sync = new_r_Sync(irg, block, 2, ins);
943 exchange(alloc_mem, sync);
946 exchange(alloc, new_alloc);
948 /* fix projnum of alloca res */
949 set_Proj_proj(alloc_res, pn_be_AddSP_res);
952 curr_sp = new_r_Proj(irg, block, new_alloc, get_irn_mode(curr_sp),
960 * The Free is transformed into a back end free node and connected to the stack nodes.
962 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
966 ir_node *subsp, *mem, *res, *size, *sync;
970 unsigned stack_alignment;
973 assert(get_Free_where(free) == stack_alloc);
975 block = get_nodes_block(free);
976 irg = get_irn_irg(block);
977 type = get_Free_type(free);
978 sp_mode = env->arch_env->sp->reg_class->mode;
979 dbg = get_irn_dbg_info(free);
981 /* we might need to multiply the size with the element size */
982 if (type != firm_unknown_type && get_type_size_bytes(type) != 1) {
983 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
984 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
985 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
989 size = get_Free_size(free);
992 stack_alignment = 1 << env->arch_env->stack_alignment;
993 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
995 /* The stack pointer will be modified in an unknown manner.
996 We cannot omit it. */
997 env->call->flags.bits.try_omit_fp = 0;
998 subsp = be_new_SubSP(env->arch_env->sp, irg, block, curr_sp, size);
999 set_irn_dbg_info(subsp, dbg);
1001 mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
1002 res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_sp);
1004 /* we need to sync the memory */
1005 in[0] = get_Free_mem(free);
1007 sync = new_r_Sync(irg, block, 2, in);
1009 /* and make the AddSP dependent on the former memory */
1010 add_irn_dep(subsp, get_Free_mem(free));
1013 exchange(free, sync);
1019 /* the following function is replaced by the usage of the heights module */
1022 * Walker for dependent_on().
1023 * This function searches a node tgt recursively from a given node
1024 * but is restricted to the given block.
1025 * @return 1 if tgt was reachable from curr, 0 if not.
1027 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl)
1031 if (get_nodes_block(curr) != bl)
1037 /* Phi functions stop the recursion inside a basic block */
1038 if (! is_Phi(curr)) {
1039 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
1040 if (check_dependence(get_irn_n(curr, i), tgt, bl))
1050 * Check if a node is somehow data dependent on another one.
1051 * both nodes must be in the same basic block.
1052 * @param n1 The first node.
1053 * @param n2 The second node.
1054 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1056 static int dependent_on(ir_node *n1, ir_node *n2)
1058 assert(get_nodes_block(n1) == get_nodes_block(n2));
1060 return heights_reachable_in_block(ir_heights, n1, n2);
1063 static int cmp_call_dependency(const void *c1, const void *c2)
1065 ir_node *n1 = *(ir_node **) c1;
1066 ir_node *n2 = *(ir_node **) c2;
1069 Classical qsort() comparison function behavior:
1070 0 if both elements are equal
1071 1 if second is "smaller" that first
1072 -1 if first is "smaller" that second
1074 if (dependent_on(n1, n2))
1077 if (dependent_on(n2, n1))
1084 * Walker: links all Call/Alloc/Free nodes to the Block they are contained.
1085 * Clears the irg_is_leaf flag if a Call is detected.
1087 static void link_ops_in_block_walker(ir_node *irn, void *data)
1089 ir_opcode code = get_irn_opcode(irn);
1091 if (code == iro_Call ||
1092 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1093 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1094 be_abi_irg_t *env = data;
1095 ir_node *bl = get_nodes_block(irn);
1096 void *save = get_irn_link(bl);
1098 if (code == iro_Call)
1099 env->call->flags.bits.irg_is_leaf = 0;
1101 set_irn_link(irn, save);
1102 set_irn_link(bl, irn);
1108 * Process all Call/Alloc/Free nodes inside a basic block.
1109 * Note that the link field of the block must contain a linked list of all
1110 * Call nodes inside the Block. We first order this list according to data dependency
1111 * and that connect the calls together.
1113 static void process_ops_in_block(ir_node *bl, void *data)
1115 be_abi_irg_t *env = data;
1116 ir_node *curr_sp = env->init_sp;
1120 for (irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
1121 obstack_ptr_grow(&env->obst, irn);
1123 /* If there were call nodes in the block. */
1129 nodes = obstack_finish(&env->obst);
1131 /* order the call nodes according to data dependency */
1132 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
1134 for (i = n - 1; i >= 0; --i) {
1135 ir_node *irn = nodes[i];
1137 DBG((env->dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1138 switch (get_irn_opcode(irn)) {
1141 /* The stack pointer will be modified due to a call. */
1142 env->call->flags.bits.try_omit_fp = 0;
1144 curr_sp = adjust_call(env, irn, curr_sp);
1147 if (get_Alloc_where(irn) == stack_alloc)
1148 curr_sp = adjust_alloc(env, irn, curr_sp);
1151 if (get_Free_where(irn) == stack_alloc)
1152 curr_sp = adjust_free(env, irn, curr_sp);
1155 panic("invalid call");
1160 obstack_free(&env->obst, nodes);
1162 /* Keep the last stack state in the block by tying it to Keep node,
1163 * the proj from calls is already kept */
1164 if (curr_sp != env->init_sp &&
1165 !(is_Proj(curr_sp) && be_is_Call(get_Proj_pred(curr_sp)))) {
1167 keep = be_new_Keep(env->arch_env->sp->reg_class,
1168 get_irn_irg(bl), bl, 1, nodes);
1169 pmap_insert(env->keep_map, bl, keep);
1173 set_irn_link(bl, curr_sp);
1174 } /* process_calls_in_block */
1177 * Adjust all call nodes in the graph to the ABI conventions.
1179 static void process_calls(be_abi_irg_t *env)
1181 ir_graph *irg = env->birg->irg;
1183 env->call->flags.bits.irg_is_leaf = 1;
1184 irg_walk_graph(irg, firm_clear_link, link_ops_in_block_walker, env);
1186 ir_heights = heights_new(env->birg->irg);
1187 irg_block_walk_graph(irg, NULL, process_ops_in_block, env);
1188 heights_free(ir_heights);
1192 * Computes the stack argument layout type.
1193 * Changes a possibly allocated value param type by moving
1194 * entities to the stack layout type.
1196 * @param env the ABI environment
1197 * @param call the current call ABI
1198 * @param method_type the method type
1199 * @param param_map an array mapping method arguments to the stack layout type
1201 * @return the stack argument layout type
1203 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type, ir_entity ***param_map)
1205 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1206 int inc = env->birg->main_env->arch_env->stack_dir * dir;
1207 int n = get_method_n_params(method_type);
1208 int curr = inc > 0 ? 0 : n - 1;
1214 ir_type *val_param_tp = get_method_value_param_type(method_type);
1215 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1218 *param_map = map = obstack_alloc(&env->obst, n * sizeof(ir_entity *));
1219 res = new_type_struct(mangle_u(id, new_id_from_chars("arg_type", 8)));
1220 for (i = 0; i < n; ++i, curr += inc) {
1221 ir_type *param_type = get_method_param_type(method_type, curr);
1222 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1225 if (arg->on_stack) {
1227 /* the entity was already created, move it to the param type */
1228 arg->stack_ent = get_method_value_param_ent(method_type, i);
1229 remove_struct_member(val_param_tp, arg->stack_ent);
1230 set_entity_owner(arg->stack_ent, res);
1231 add_struct_member(res, arg->stack_ent);
1232 /* must be automatic to set a fixed layout */
1233 set_entity_allocation(arg->stack_ent, allocation_automatic);
1236 snprintf(buf, sizeof(buf), "param_%d", i);
1237 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1239 ofs += arg->space_before;
1240 ofs = round_up2(ofs, arg->alignment);
1241 set_entity_offset(arg->stack_ent, ofs);
1242 ofs += arg->space_after;
1243 ofs += get_type_size_bytes(param_type);
1244 map[i] = arg->stack_ent;
1247 set_type_size_bytes(res, ofs);
1248 set_type_state(res, layout_fixed);
1253 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
1256 struct obstack obst;
1258 obstack_init(&obst);
1260 /* Create a Perm after the RegParams node to delimit it. */
1261 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1262 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1267 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
1268 const arch_register_t *reg = &cls->regs[j];
1269 ir_node *irn = pmap_get(regs, (void *) reg);
1271 if(irn && !arch_register_type_is(reg, ignore)) {
1273 obstack_ptr_grow(&obst, irn);
1274 set_irn_link(irn, (void *) reg);
1278 obstack_ptr_grow(&obst, NULL);
1279 in = obstack_finish(&obst);
1281 perm = be_new_Perm(cls, irg, bl, n_regs, in);
1282 for(j = 0; j < n_regs; ++j) {
1283 ir_node *arg = in[j];
1284 arch_register_t *reg = get_irn_link(arg);
1285 pmap_insert(regs, reg, arg);
1286 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
1289 obstack_free(&obst, in);
1292 obstack_free(&obst, NULL);
1297 const arch_register_t *reg;
1301 static int cmp_regs(const void *a, const void *b)
1303 const reg_node_map_t *p = a;
1304 const reg_node_map_t *q = b;
1306 if(p->reg->reg_class == q->reg->reg_class)
1307 return p->reg->index - q->reg->index;
1309 return p->reg->reg_class - q->reg->reg_class;
1312 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1315 int n = pmap_count(reg_map);
1317 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1319 foreach_pmap(reg_map, ent) {
1320 res[i].reg = ent->key;
1321 res[i].irn = ent->value;
1325 qsort(res, n, sizeof(res[0]), cmp_regs);
1330 * Creates a barrier.
1332 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1334 ir_graph *irg = env->birg->irg;
1335 int n_regs = pmap_count(regs);
1341 rm = reg_map_to_arr(&env->obst, regs);
1343 for(n = 0; n < n_regs; ++n)
1344 obstack_ptr_grow(&env->obst, rm[n].irn);
1347 obstack_ptr_grow(&env->obst, *mem);
1351 in = (ir_node **) obstack_finish(&env->obst);
1352 irn = be_new_Barrier(irg, bl, n, in);
1353 obstack_free(&env->obst, in);
1355 for(n = 0; n < n_regs; ++n) {
1356 const arch_register_t *reg = rm[n].reg;
1358 int pos = BE_OUT_POS(n);
1361 proj = new_r_Proj(irg, bl, irn, get_irn_mode(rm[n].irn), n);
1362 be_node_set_reg_class(irn, n, reg->reg_class);
1364 be_set_constr_single_reg(irn, n, reg);
1365 be_set_constr_single_reg(irn, pos, reg);
1366 be_node_set_reg_class(irn, pos, reg->reg_class);
1367 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1369 /* if the proj projects a ignore register or a node which is set to ignore, propagate this property. */
1370 if(arch_register_type_is(reg, ignore) || arch_irn_is(env->birg->main_env->arch_env, in[n], ignore))
1371 flags |= arch_irn_flags_ignore;
1373 if(arch_irn_is(env->birg->main_env->arch_env, in[n], modify_sp))
1374 flags |= arch_irn_flags_modify_sp;
1376 be_node_set_flags(irn, pos, flags);
1378 pmap_insert(regs, (void *) reg, proj);
1382 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1385 obstack_free(&env->obst, rm);
1390 * Creates a be_Return for a Return node.
1392 * @param @env the abi environment
1393 * @param irn the Return node or NULL if there was none
1394 * @param bl the block where the be_Retun should be placed
1395 * @param mem the current memory
1396 * @param n_res number of return results
1398 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl,
1399 ir_node *mem, int n_res)
1401 be_abi_call_t *call = env->call;
1402 const arch_env_t *arch_env = env->birg->main_env->arch_env;
1404 pmap *reg_map = pmap_create();
1405 ir_node *keep = pmap_get(env->keep_map, bl);
1412 const arch_register_t **regs;
1416 get the valid stack node in this block.
1417 If we had a call in that block there is a Keep constructed by process_calls()
1418 which points to the last stack modification in that block. we'll use
1419 it then. Else we use the stack from the start block and let
1420 the ssa construction fix the usage.
1422 stack = be_abi_reg_map_get(env->regs, arch_env->sp);
1424 stack = get_irn_n(keep, 0);
1426 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1429 /* Insert results for Return into the register map. */
1430 for(i = 0; i < n_res; ++i) {
1431 ir_node *res = get_Return_res(irn, i);
1432 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1433 assert(arg->in_reg && "return value must be passed in register");
1434 pmap_insert(reg_map, (void *) arg->reg, res);
1437 /* Add uses of the callee save registers. */
1438 foreach_pmap(env->regs, ent) {
1439 const arch_register_t *reg = ent->key;
1440 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1441 pmap_insert(reg_map, ent->key, ent->value);
1444 be_abi_reg_map_set(reg_map, arch_env->sp, stack);
1446 /* Make the Epilogue node and call the arch's epilogue maker. */
1447 create_barrier(env, bl, &mem, reg_map, 1);
1448 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1451 Maximum size of the in array for Return nodes is
1452 return args + callee save/ignore registers + memory + stack pointer
1454 in_max = pmap_count(reg_map) + n_res + 2;
1456 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1457 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1460 in[1] = be_abi_reg_map_get(reg_map, arch_env->sp);
1462 regs[1] = arch_env->sp;
1465 /* clear SP entry, since it has already been grown. */
1466 pmap_insert(reg_map, (void *) arch_env->sp, NULL);
1467 for(i = 0; i < n_res; ++i) {
1468 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1470 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1471 regs[n++] = arg->reg;
1473 /* Clear the map entry to mark the register as processed. */
1474 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1477 /* grow the rest of the stuff. */
1478 foreach_pmap(reg_map, ent) {
1481 regs[n++] = ent->key;
1485 /* The in array for the new back end return is now ready. */
1487 dbgi = get_irn_dbg_info(irn);
1491 /* we have to pop the shadow parameter in in case of struct returns */
1493 ret = be_new_Return(dbgi, env->birg->irg, bl, n_res, pop, n, in);
1495 /* Set the register classes of the return's parameter accordingly. */
1496 for(i = 0; i < n; ++i)
1498 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1500 /* Free the space of the Epilog's in array and the register <-> proj map. */
1501 obstack_free(&env->obst, in);
1502 pmap_destroy(reg_map);
1507 typedef struct lower_frame_sels_env_t {
1509 ir_entity *value_param_list; /**< the list of all value param entities */
1510 ir_entity *value_param_tail; /**< the tail of the list of all value param entities */
1511 } lower_frame_sels_env_t;
1514 * Walker: Replaces Sels of frame type and
1515 * value param type entities by FrameAddress.
1516 * Links all used entities.
1518 static void lower_frame_sels_walker(ir_node *irn, void *data) {
1519 lower_frame_sels_env_t *ctx = data;
1522 ir_graph *irg = current_ir_graph;
1523 ir_node *frame = get_irg_frame(irg);
1524 ir_node *param_base = get_irg_value_param_base(irg);
1525 ir_node *ptr = get_Sel_ptr(irn);
1527 if (ptr == frame || ptr == param_base) {
1528 be_abi_irg_t *env = ctx->env;
1529 ir_entity *ent = get_Sel_entity(irn);
1530 ir_node *bl = get_nodes_block(irn);
1533 nw = be_new_FrameAddr(env->arch_env->sp->reg_class, irg, bl, frame, ent);
1536 /* check, if it's a param sel and if have not seen this entity before */
1537 if (ptr == param_base &&
1538 ent != ctx->value_param_tail &&
1539 get_entity_link(ent) == NULL) {
1540 set_entity_link(ent, ctx->value_param_list);
1541 ctx->value_param_list = ent;
1542 if (ctx->value_param_tail == NULL) ctx->value_param_tail = ent;
1549 * Check if a value parameter is transmitted as a register.
1550 * This might happen if the address of an parameter is taken which is
1551 * transmitted in registers.
1553 * Note that on some architectures this case must be handled specially
1554 * because the place of the backing store is determined by their ABI.
1556 * In the default case we move the entity to the frame type and create
1557 * a backing store into the first block.
1559 static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_entity *value_param_list) {
1560 be_abi_call_t *call = env->call;
1561 ir_graph *irg = env->birg->irg;
1562 ir_entity *ent, *next_ent, *new_list;
1564 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1567 for (ent = value_param_list; ent; ent = next_ent) {
1568 int i = get_struct_member_index(get_entity_owner(ent), ent);
1569 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1571 next_ent = get_entity_link(ent);
1573 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", i));
1574 set_entity_link(ent, new_list);
1579 /* ok, change the graph */
1580 ir_node *start_bl = get_irg_start_block(irg);
1581 ir_node *first_bl = NULL;
1582 ir_node *frame, *imem, *nmem, *store, *mem, *args, *args_bl;
1583 const ir_edge_t *edge;
1584 optimization_state_t state;
1587 foreach_block_succ(start_bl, edge) {
1588 ir_node *succ = get_edge_src_irn(edge);
1589 if (start_bl != succ) {
1595 /* we had already removed critical edges, so the following
1596 assertion should be always true. */
1597 assert(get_Block_n_cfgpreds(first_bl) == 1);
1599 /* now create backing stores */
1600 frame = get_irg_frame(irg);
1601 imem = get_irg_initial_mem(irg);
1603 save_optimization_state(&state);
1605 nmem = new_r_Proj(irg, first_bl, get_irg_start(irg), mode_M, pn_Start_M);
1606 restore_optimization_state(&state);
1608 /* reroute all edges to the new memory source */
1609 edges_reroute(imem, nmem, irg);
1613 args = get_irg_args(irg);
1614 args_bl = get_nodes_block(args);
1615 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1616 int i = get_struct_member_index(get_entity_owner(ent), ent);
1617 ir_type *tp = get_entity_type(ent);
1618 ir_mode *mode = get_type_mode(tp);
1621 /* address for the backing store */
1622 addr = be_new_FrameAddr(env->arch_env->sp->reg_class, irg, first_bl, frame, ent);
1625 mem = new_r_Proj(irg, first_bl, store, mode_M, pn_Store_M);
1627 /* the backing store itself */
1628 store = new_r_Store(irg, first_bl, mem, addr,
1629 new_r_Proj(irg, args_bl, args, mode, i));
1631 /* the new memory Proj gets the last Proj from store */
1632 set_Proj_pred(nmem, store);
1633 set_Proj_proj(nmem, pn_Store_M);
1635 /* move all entities to the frame type */
1636 frame_tp = get_irg_frame_type(irg);
1637 offset = get_type_size_bytes(frame_tp);
1639 /* we will add new entities: set the layout to undefined */
1640 assert(get_type_state(frame_tp) == layout_fixed);
1641 set_type_state(frame_tp, layout_undefined);
1642 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1643 ir_type *tp = get_entity_type(ent);
1644 unsigned align = get_type_alignment_bytes(tp);
1646 offset += align - 1;
1647 offset &= ~(align - 1);
1648 set_entity_owner(ent, frame_tp);
1649 add_class_member(frame_tp, ent);
1650 /* must be automatic to set a fixed layout */
1651 set_entity_allocation(ent, allocation_automatic);
1652 set_entity_offset(ent, offset);
1653 offset += get_type_size_bytes(tp);
1655 set_type_size_bytes(frame_tp, offset);
1656 /* fix the layout again */
1657 set_type_state(frame_tp, layout_fixed);
1663 * The start block has no jump, instead it has an initial exec Proj.
1664 * The backend wants to handle all blocks the same way, so we replace
1665 * the out cfg edge with a real jump.
1667 static void fix_start_block(ir_node *block, void *env) {
1670 ir_node *start_block;
1673 /* we processed the start block, return */
1677 irg = get_irn_irg(block);
1678 start_block = get_irg_start_block(irg);
1680 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1681 ir_node *pred = get_Block_cfgpred(block, i);
1682 ir_node *pred_block = get_nodes_block(pred);
1684 /* ok, we are in the block, having start as cfg predecessor */
1685 if (pred_block == start_block) {
1686 ir_node *jump = new_r_Jmp(irg, pred_block);
1687 set_Block_cfgpred(block, i, jump);
1695 * Modify the irg itself and the frame type.
1697 static void modify_irg(be_abi_irg_t *env)
1699 be_abi_call_t *call = env->call;
1700 const arch_env_t *arch_env= env->birg->main_env->arch_env;
1701 const arch_register_t *sp = arch_env_sp(arch_env);
1702 ir_graph *irg = env->birg->irg;
1703 ir_node *bl = get_irg_start_block(irg);
1704 ir_node *end = get_irg_end_block(irg);
1705 ir_node *old_mem = get_irg_initial_mem(irg);
1706 ir_node *new_mem_proj;
1708 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1709 pset *dont_save = pset_new_ptr(8);
1716 const arch_register_t *fp_reg;
1717 ir_node *frame_pointer;
1718 ir_node *reg_params_bl;
1721 ir_node *value_param_base;
1722 const ir_edge_t *edge;
1723 ir_type *arg_type, *bet_type, *tp;
1724 lower_frame_sels_env_t ctx;
1725 ir_entity **param_map;
1727 bitset_t *used_proj_nr;
1728 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1730 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1732 /* set the links of all frame entities to NULL, we use it
1733 to detect if an entity is already linked in the value_param_list */
1734 tp = get_method_value_param_type(method_type);
1736 for (i = get_struct_n_members(tp) - 1; i >= 0; --i)
1737 set_entity_link(get_struct_member(tp, i), NULL);
1740 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1742 ctx.value_param_list = NULL;
1743 ctx.value_param_tail = NULL;
1744 irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
1746 /* value_param_base anchor is not needed anymore now */
1747 value_param_base = get_irg_value_param_base(irg);
1748 kill_node(value_param_base);
1749 set_irg_value_param_base(irg, new_r_Bad(irg));
1751 env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0]));
1752 env->regs = pmap_create();
1754 used_proj_nr = bitset_alloca(1024);
1755 n_params = get_method_n_params(method_type);
1756 args = obstack_alloc(&env->obst, n_params * sizeof(args[0]));
1757 memset(args, 0, n_params * sizeof(args[0]));
1759 /* Check if a value parameter is transmitted as a register.
1760 * This might happen if the address of an parameter is taken which is
1761 * transmitted in registers.
1763 * Note that on some architectures this case must be handled specially
1764 * because the place of the backing store is determined by their ABI.
1766 * In the default case we move the entity to the frame type and create
1767 * a backing store into the first block.
1769 fix_address_of_parameter_access(env, ctx.value_param_list);
1771 /* Fill the argument vector */
1772 arg_tuple = get_irg_args(irg);
1773 foreach_out_edge(arg_tuple, edge) {
1774 ir_node *irn = get_edge_src_irn(edge);
1775 if (! is_Anchor(irn)) {
1776 int nr = get_Proj_proj(irn);
1778 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1782 arg_type = compute_arg_type(env, call, method_type, ¶m_map);
1783 bet_type = call->cb->get_between_type(env->cb);
1784 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), arch_env->stack_dir, param_map);
1786 /* Count the register params and add them to the number of Projs for the RegParams node */
1787 for(i = 0; i < n_params; ++i) {
1788 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1789 if(arg->in_reg && args[i]) {
1790 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1791 assert(i == get_Proj_proj(args[i]));
1793 /* For now, associate the register with the old Proj from Start representing that argument. */
1794 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1795 bitset_set(used_proj_nr, i);
1796 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1800 /* Collect all callee-save registers */
1801 for(i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) {
1802 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
1803 for(j = 0; j < cls->n_regs; ++j) {
1804 const arch_register_t *reg = &cls->regs[j];
1805 if(arch_register_type_is(reg, callee_save) ||
1806 arch_register_type_is(reg, state)) {
1807 pmap_insert(env->regs, (void *) reg, NULL);
1812 pmap_insert(env->regs, (void *) sp, NULL);
1813 pmap_insert(env->regs, (void *) arch_env->bp, NULL);
1814 reg_params_bl = get_irg_start_block(irg);
1815 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1816 add_irn_dep(env->reg_params, get_irg_start(irg));
1819 * make proj nodes for the callee save registers.
1820 * memorize them, since Return nodes get those as inputs.
1822 * Note, that if a register corresponds to an argument, the regs map contains
1823 * the old Proj from start for that argument.
1826 rm = reg_map_to_arr(&env->obst, env->regs);
1827 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1828 arch_register_t *reg = (void *) rm[i].reg;
1829 ir_mode *mode = reg->reg_class->mode;
1831 int pos = BE_OUT_POS((int) nr);
1837 bitset_set(used_proj_nr, nr);
1838 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1839 pmap_insert(env->regs, (void *) reg, proj);
1840 be_set_constr_single_reg(env->reg_params, pos, reg);
1841 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1844 * If the register is an ignore register,
1845 * The Proj for that register shall also be ignored during register allocation.
1847 if(arch_register_type_is(reg, ignore))
1848 flags |= arch_irn_flags_ignore;
1851 flags |= arch_irn_flags_modify_sp;
1853 be_node_set_flags(env->reg_params, pos, flags);
1855 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1857 obstack_free(&env->obst, rm);
1859 /* create a new initial memory proj */
1860 assert(is_Proj(old_mem));
1861 new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
1862 new_r_Unknown(irg, mode_T), mode_M,
1863 get_Proj_proj(old_mem));
1866 /* Generate the Prologue */
1867 fp_reg = call->cb->prologue(env->cb, &mem, env->regs, &env->frame->initial_bias);
1869 /* do the stack allocation BEFORE the barrier, or spill code
1870 might be added before it */
1871 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1872 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND, 0);
1873 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1875 create_barrier(env, bl, &mem, env->regs, 0);
1877 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1878 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1880 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1881 set_irg_frame(irg, frame_pointer);
1882 pset_insert_ptr(env->ignore_regs, fp_reg);
1884 /* rewire old mem users to new mem */
1885 set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
1886 exchange(old_mem, mem);
1888 set_irg_initial_mem(irg, mem);
1890 /* Now, introduce stack param nodes for all parameters passed on the stack */
1891 for(i = 0; i < n_params; ++i) {
1892 ir_node *arg_proj = args[i];
1893 ir_node *repl = NULL;
1895 if(arg_proj != NULL) {
1896 be_abi_call_arg_t *arg;
1897 ir_type *param_type;
1898 int nr = get_Proj_proj(arg_proj);
1901 nr = MIN(nr, n_params);
1902 arg = get_call_arg(call, 0, nr);
1903 param_type = get_method_param_type(method_type, nr);
1906 repl = pmap_get(env->regs, (void *) arg->reg);
1907 } else if(arg->on_stack) {
1908 ir_node *addr = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1910 /* For atomic parameters which are actually used, we create a Load node. */
1911 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1912 ir_mode *mode = get_type_mode(param_type);
1913 ir_mode *load_mode = arg->load_mode;
1915 ir_node *load = new_r_Load(irg, reg_params_bl, new_NoMem(), addr, load_mode);
1916 set_irn_pinned(load, op_pin_state_floats);
1917 repl = new_r_Proj(irg, reg_params_bl, load, load_mode, pn_Load_res);
1919 if (mode != load_mode) {
1920 repl = new_r_Conv(irg, reg_params_bl, repl, mode);
1923 /* The stack parameter is not primitive (it is a struct or array),
1924 * we thus will create a node representing the parameter's address
1930 assert(repl != NULL);
1932 /* Beware: the mode of the register parameters is always the mode of the register class
1933 which may be wrong. Add Conv's then. */
1934 mode = get_irn_mode(args[i]);
1935 if (mode != get_irn_mode(repl)) {
1936 repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
1938 exchange(args[i], repl);
1942 /* the arg proj is not needed anymore now and should be only used by the anchor */
1943 assert(get_irn_n_edges(arg_tuple) == 1);
1944 kill_node(arg_tuple);
1945 set_irg_args(irg, new_rd_Bad(irg));
1947 /* All Return nodes hang on the End node, so look for them there. */
1948 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1949 ir_node *irn = get_Block_cfgpred(end, i);
1951 if (is_Return(irn)) {
1952 ir_node *blk = get_nodes_block(irn);
1953 ir_node *mem = get_Return_mem(irn);
1954 ir_node *ret = create_be_return(env, irn, blk, mem, get_Return_n_ress(irn));
1958 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
1959 the code is dead and will never be executed. */
1961 del_pset(dont_save);
1962 obstack_free(&env->obst, args);
1964 /* handle start block here (place a jump in the block) */
1966 irg_block_walk_graph(irg, fix_start_block, NULL, &i);
1969 /** Fix the state inputs of calls that still hang on unknowns */
1971 void fix_call_state_inputs(be_abi_irg_t *env)
1973 const arch_env_t *arch_env = env->arch_env;
1975 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
1977 /* Collect caller save registers */
1978 n = arch_env_get_n_reg_class(arch_env);
1979 for(i = 0; i < n; ++i) {
1981 const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i);
1982 for(j = 0; j < cls->n_regs; ++j) {
1983 const arch_register_t *reg = arch_register_for_index(cls, j);
1984 if(arch_register_type_is(reg, state)) {
1985 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
1990 n = ARR_LEN(env->calls);
1991 n_states = ARR_LEN(stateregs);
1992 for(i = 0; i < n; ++i) {
1994 ir_node *call = env->calls[i];
1996 arity = get_irn_arity(call);
1998 /* the state reg inputs are the last n inputs of the calls */
1999 for(s = 0; s < n_states; ++s) {
2000 int inp = arity - n_states + s;
2001 const arch_register_t *reg = stateregs[s];
2002 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
2004 set_irn_n(call, inp, regnode);
2008 DEL_ARR_F(stateregs);
2012 * Create a trampoline entity for the given method.
2014 static ir_entity *create_trampoline(be_main_env_t *be, ir_entity *method)
2016 ir_type *type = get_entity_type(method);
2017 ident *old_id = get_entity_ld_ident(method);
2018 ident *id = mangle3("L", old_id, "$stub");
2019 ir_type *parent = be->pic_trampolines_type;
2020 ir_entity *ent = new_entity(parent, old_id, type);
2021 set_entity_ld_ident(ent, id);
2022 set_entity_visibility(ent, visibility_local);
2023 set_entity_variability(ent, variability_uninitialized);
2029 * Returns the trampoline entity for the given method.
2031 static ir_entity *get_trampoline(be_main_env_t *env, ir_entity *method)
2033 ir_entity *result = pmap_get(env->ent_trampoline_map, method);
2034 if (result == NULL) {
2035 result = create_trampoline(env, method);
2036 pmap_insert(env->ent_trampoline_map, method, result);
2042 static ir_entity *create_pic_symbol(be_main_env_t *be, ir_entity *entity)
2044 ident *old_id = get_entity_ld_ident(entity);
2045 ident *id = mangle3("L", old_id, "$non_lazy_ptr");
2046 ir_type *e_type = get_entity_type(entity);
2047 ir_type *type = new_type_pointer(id, e_type, mode_P_data);
2048 ir_type *parent = be->pic_symbols_type;
2049 ir_entity *ent = new_entity(parent, old_id, type);
2050 set_entity_ld_ident(ent, id);
2051 set_entity_visibility(ent, visibility_local);
2052 set_entity_variability(ent, variability_uninitialized);
2057 static ir_entity *get_pic_symbol(be_main_env_t *env, ir_entity *entity)
2059 ir_entity *result = pmap_get(env->ent_pic_symbol_map, entity);
2060 if (result == NULL) {
2061 result = create_pic_symbol(env, entity);
2062 pmap_insert(env->ent_pic_symbol_map, entity, result);
2071 * Returns non-zero if a given entity can be accessed using a relative address.
2073 static int can_address_relative(ir_entity *entity)
2075 return get_entity_variability(entity) == variability_initialized
2076 || get_entity_visibility(entity) == visibility_local;
2079 /** patches SymConsts to work in position independent code */
2080 static void fix_pic_symconsts(ir_node *node, void *data)
2090 be_abi_irg_t *env = data;
2092 be_main_env_t *be = env->birg->main_env;
2094 arity = get_irn_arity(node);
2095 for (i = 0; i < arity; ++i) {
2097 ir_node *pred = get_irn_n(node, i);
2099 ir_entity *pic_symbol;
2100 ir_node *pic_symconst;
2102 if (!is_SymConst(pred))
2105 entity = get_SymConst_entity(pred);
2106 block = get_nodes_block(pred);
2107 irg = get_irn_irg(pred);
2109 /* calls can jump to relative addresses, so we can directly jump to
2110 the (relatively) known call address or the trampoline */
2111 if (is_Call(node) && i == 1) {
2112 ir_entity *trampoline;
2113 ir_node *trampoline_const;
2115 if (can_address_relative(entity))
2118 dbgi = get_irn_dbg_info(pred);
2119 trampoline = get_trampoline(be, entity);
2120 trampoline_const = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2122 set_irn_n(node, i, trampoline_const);
2126 /* everything else is accessed relative to EIP */
2127 mode = get_irn_mode(pred);
2128 unknown = new_r_Unknown(irg, mode);
2129 pic_base = arch_code_generator_get_pic_base(env->birg->cg);
2130 add = new_r_Add(irg, block, pic_base, pred, mode);
2132 /* make sure the walker doesn't visit this add again */
2133 mark_irn_visited(add);
2135 /* all ok now for locally constructed stuff */
2136 if (can_address_relative(entity)) {
2137 set_irn_n(node, i, add);
2141 /* get entry from pic symbol segment */
2142 dbgi = get_irn_dbg_info(pred);
2143 pic_symbol = get_pic_symbol(be, entity);
2144 pic_symconst = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code,
2146 set_Add_right(add, pic_symconst);
2148 /* we need an extra indirection for global data outside our current
2149 module. The loads are always safe and can therefore float
2150 and need no memory input */
2151 load = new_r_Load(irg, block, new_NoMem(), add, mode);
2152 load_res = new_r_Proj(irg, block, load, mode, pn_Load_res);
2153 set_irn_pinned(load, op_pin_state_floats);
2155 set_irn_n(node, i, load_res);
2159 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2161 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
2162 ir_node *old_frame = get_irg_frame(birg->irg);
2163 ir_graph *irg = birg->irg;
2167 optimization_state_t state;
2168 unsigned *limited_bitset;
2170 be_omit_fp = birg->main_env->options->omit_fp;
2171 be_omit_leaf_fp = birg->main_env->options->omit_leaf_fp;
2173 obstack_init(&env->obst);
2175 env->arch_env = birg->main_env->arch_env;
2176 env->method_type = get_entity_type(get_irg_entity(irg));
2177 env->call = be_abi_call_new(env->arch_env->sp->reg_class);
2178 arch_env_get_call_abi(env->arch_env, env->method_type, env->call);
2180 env->ignore_regs = pset_new_ptr_default();
2181 env->keep_map = pmap_create();
2182 env->dce_survivor = new_survive_dce();
2185 env->sp_req.type = arch_register_req_type_limited;
2186 env->sp_req.cls = arch_register_get_class(env->arch_env->sp);
2187 limited_bitset = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
2188 rbitset_set(limited_bitset, arch_register_get_index(env->arch_env->sp));
2189 env->sp_req.limited = limited_bitset;
2191 env->sp_cls_req.type = arch_register_req_type_normal;
2192 env->sp_cls_req.cls = arch_register_get_class(env->arch_env->sp);
2194 /* Beware: later we replace this node by the real one, ensure it is not CSE'd
2195 to another Unknown or the stack pointer gets used */
2196 save_optimization_state(&state);
2198 env->init_sp = dummy = new_r_Unknown(irg, env->arch_env->sp->reg_class->mode);
2199 restore_optimization_state(&state);
2200 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
2202 env->calls = NEW_ARR_F(ir_node*, 0);
2204 if (birg->main_env->options->pic) {
2205 irg_walk_graph(irg, fix_pic_symconsts, NULL, env);
2208 /* Lower all call nodes in the IRG. */
2212 Beware: init backend abi call object after processing calls,
2213 otherwise some information might be not yet available.
2215 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2217 /* Process the IRG */
2220 /* fix call inputs for state registers */
2221 fix_call_state_inputs(env);
2223 /* We don't need the keep map anymore. */
2224 pmap_destroy(env->keep_map);
2225 env->keep_map = NULL;
2227 /* calls array is not needed anymore */
2228 DEL_ARR_F(env->calls);
2231 /* reroute the stack origin of the calls to the true stack origin. */
2232 exchange(dummy, env->init_sp);
2233 exchange(old_frame, get_irg_frame(irg));
2235 /* Make some important node pointers survive the dead node elimination. */
2236 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2237 foreach_pmap(env->regs, ent) {
2238 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2241 env->call->cb->done(env->cb);
2246 void be_abi_free(be_abi_irg_t *env)
2248 be_abi_call_free(env->call);
2249 free_survive_dce(env->dce_survivor);
2250 del_pset(env->ignore_regs);
2251 pmap_destroy(env->regs);
2252 obstack_free(&env->obst, NULL);
2256 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2258 arch_register_t *reg;
2260 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2261 if(reg->reg_class == cls)
2262 bitset_set(bs, reg->index);
2265 void be_abi_set_non_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, unsigned *raw_bitset)
2268 arch_register_t *reg;
2270 for (i = 0; i < cls->n_regs; ++i) {
2271 if (arch_register_type_is(&cls->regs[i], ignore))
2274 rbitset_set(raw_bitset, i);
2277 for (reg = pset_first(abi->ignore_regs); reg != NULL;
2278 reg = pset_next(abi->ignore_regs)) {
2279 if (reg->reg_class != cls)
2282 rbitset_clear(raw_bitset, reg->index);
2286 /* Returns the stack layout from a abi environment. */
2287 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi) {
2294 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2295 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2296 | _| | |> < ___) | || (_| | (__| <
2297 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2301 typedef ir_node **node_array;
2303 typedef struct fix_stack_walker_env_t {
2304 node_array sp_nodes;
2305 const arch_env_t *arch_env;
2306 } fix_stack_walker_env_t;
2309 * Walker. Collect all stack modifying nodes.
2311 static void collect_stack_nodes_walker(ir_node *node, void *data)
2313 fix_stack_walker_env_t *env = data;
2315 if (arch_irn_is(env->arch_env, node, modify_sp)) {
2316 assert(get_irn_mode(node) != mode_M && get_irn_mode(node) != mode_T);
2317 ARR_APP1(ir_node*, env->sp_nodes, node);
2321 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2323 be_ssa_construction_env_t senv;
2326 be_irg_t *birg = env->birg;
2327 be_lv_t *lv = be_get_birg_liveness(birg);
2328 fix_stack_walker_env_t walker_env;
2330 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2331 walker_env.arch_env = birg->main_env->arch_env;
2333 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2335 /* nothing to be done if we didn't find any node, in fact we mustn't
2336 * continue, as for endless loops incsp might have had no users and is bad
2339 len = ARR_LEN(walker_env.sp_nodes);
2341 DEL_ARR_F(walker_env.sp_nodes);
2345 be_ssa_construction_init(&senv, birg);
2346 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2347 ARR_LEN(walker_env.sp_nodes));
2348 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2349 ARR_LEN(walker_env.sp_nodes));
2352 len = ARR_LEN(walker_env.sp_nodes);
2353 for(i = 0; i < len; ++i) {
2354 be_liveness_update(lv, walker_env.sp_nodes[i]);
2356 be_ssa_construction_update_liveness_phis(&senv, lv);
2359 phis = be_ssa_construction_get_new_phis(&senv);
2361 /* set register requirements for stack phis */
2362 len = ARR_LEN(phis);
2363 for(i = 0; i < len; ++i) {
2364 ir_node *phi = phis[i];
2365 be_set_phi_reg_req(walker_env.arch_env, phi, &env->sp_req);
2366 be_set_phi_flags(walker_env.arch_env, phi, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
2367 arch_set_irn_register(walker_env.arch_env, phi, env->arch_env->sp);
2369 be_ssa_construction_destroy(&senv);
2371 DEL_ARR_F(walker_env.sp_nodes);
2375 * Fix all stack accessing operations in the block bl.
2377 * @param env the abi environment
2378 * @param bl the block to process
2379 * @param real_bias the bias value
2381 * @return the bias at the end of this block
2383 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int real_bias)
2385 const arch_env_t *arch_env = env->birg->main_env->arch_env;
2386 int omit_fp = env->call->flags.bits.try_omit_fp;
2388 int wanted_bias = real_bias;
2390 sched_foreach(bl, irn) {
2394 Check, if the node relates to an entity on the stack frame.
2395 If so, set the true offset (including the bias) for that
2398 ir_entity *ent = arch_get_frame_entity(arch_env, irn);
2400 int bias = omit_fp ? real_bias : 0;
2401 int offset = get_stack_entity_offset(env->frame, ent, bias);
2402 arch_set_frame_offset(arch_env, irn, offset);
2403 DBG((env->dbg, LEVEL_2, "%F has offset %d (including bias %d)\n",
2404 ent, offset, bias));
2408 * If the node modifies the stack pointer by a constant offset,
2409 * record that in the bias.
2411 ofs = arch_get_sp_bias(arch_env, irn);
2413 if (be_is_IncSP(irn)) {
2414 /* fill in real stack frame size */
2415 if (ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2416 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2417 ofs = (int) get_type_size_bytes(frame_type);
2418 be_set_IncSP_offset(irn, ofs);
2419 } else if (ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2420 ir_type *frame_type = get_irg_frame_type(env->birg->irg);
2421 ofs = - (int)get_type_size_bytes(frame_type);
2422 be_set_IncSP_offset(irn, ofs);
2424 if (be_get_IncSP_align(irn)) {
2425 /* patch IncSP to produce an aligned stack pointer */
2426 ir_type *between_type = env->frame->between_type;
2427 int between_size = get_type_size_bytes(between_type);
2428 int alignment = 1 << env->arch_env->stack_alignment;
2429 int delta = (real_bias + ofs + between_size) & (alignment - 1);
2432 be_set_IncSP_offset(irn, ofs + alignment - delta);
2433 real_bias += alignment - delta;
2436 /* adjust so real_bias corresponds with wanted_bias */
2437 int delta = wanted_bias - real_bias;
2440 be_set_IncSP_offset(irn, ofs + delta);
2451 assert(real_bias == wanted_bias);
2456 * A helper struct for the bias walker.
2459 be_abi_irg_t *env; /**< The ABI irg environment. */
2460 int start_block_bias; /**< The bias at the end of the start block. */
2462 ir_node *start_block; /**< The start block of the current graph. */
2466 * Block-Walker: fix all stack offsets for all blocks
2467 * except the start block
2469 static void stack_bias_walker(ir_node *bl, void *data)
2471 struct bias_walk *bw = data;
2472 if (bl != bw->start_block) {
2473 process_stack_bias(bw->env, bl, bw->start_block_bias);
2477 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2479 be_stack_layout_t *frame = env->frame;
2480 ir_graph *irg = env->birg->irg;
2481 struct bias_walk bw;
2483 stack_frame_compute_initial_offset(frame);
2484 // stack_layout_dump(stdout, frame);
2486 /* Determine the stack bias at the end of the start block. */
2487 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), frame->initial_bias);
2488 bw.between_size = get_type_size_bytes(frame->between_type);
2490 /* fix the bias is all other blocks */
2492 bw.start_block = get_irg_start_block(irg);
2493 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2496 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2498 assert(arch_register_type_is(reg, callee_save));
2499 assert(pmap_contains(abi->regs, (void *) reg));
2500 return pmap_get(abi->regs, (void *) reg);
2503 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2505 assert(arch_register_type_is(reg, ignore));
2506 assert(pmap_contains(abi->regs, (void *) reg));
2507 return pmap_get(abi->regs, (void *) reg);
2511 * Returns non-zero if the ABI has omitted the frame pointer in
2512 * the current graph.
2514 int be_abi_omit_fp(const be_abi_irg_t *abi) {
2515 return abi->call->flags.bits.try_omit_fp;