2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Backend ABI implementation.
23 * @author Sebastian Hack, Michael Beck
35 #include "irgraph_t.h"
38 #include "iredges_t.h"
41 #include "irprintf_t.h"
47 #include "raw_bitset.h"
55 #include "besched_t.h"
57 #include "bessaconstr.h"
59 typedef struct _be_abi_call_arg_t {
60 unsigned is_res : 1; /**< 1: the call argument is a return value. 0: it's a call parameter. */
61 unsigned in_reg : 1; /**< 1: this argument is transmitted in registers. */
62 unsigned on_stack : 1; /**< 1: this argument is transmitted on the stack. */
65 const arch_register_t *reg;
67 unsigned alignment; /**< stack alignment */
68 unsigned space_before; /**< allocate space before */
69 unsigned space_after; /**< allocate space after */
72 struct _be_abi_call_t {
73 be_abi_call_flags_t flags;
74 const be_abi_callbacks_t *cb;
75 ir_type *between_type;
77 const arch_register_class_t *cls_addr;
80 struct _be_abi_irg_t {
82 be_stack_layout_t *frame; /**< The stack frame model. */
83 be_irg_t *birg; /**< The back end IRG. */
84 const arch_isa_t *isa; /**< The isa. */
85 survive_dce_t *dce_survivor;
87 be_abi_call_t *call; /**< The ABI call information. */
88 ir_type *method_type; /**< The type of the method of the IRG. */
90 ir_node *init_sp; /**< The node representing the stack pointer
91 at the start of the function. */
93 ir_node *start_barrier; /**< The barrier of the start block */
95 ir_node *reg_params; /**< The reg params node. */
96 pmap *regs; /**< A map of all callee-save and ignore regs to
97 their Projs to the RegParams node. */
99 int start_block_bias; /**< The stack bias at the end of the start block. */
101 void *cb; /**< ABI Callback self pointer. */
103 pmap *keep_map; /**< mapping blocks to keep nodes. */
104 pset *ignore_regs; /**< Additional registers which shall be ignored. */
106 ir_node **calls; /**< flexible array containing all be_Call nodes */
108 arch_register_req_t sp_req;
109 arch_register_req_t sp_cls_req;
111 DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< The debugging module. */
114 static heights_t *ir_heights;
116 /* Flag: if set, try to omit the frame pointer if called by the backend */
117 static int be_omit_fp = 1;
120 _ ____ ___ ____ _ _ _ _
121 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
122 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
123 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
124 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
126 These callbacks are used by the backend to set the parameters
127 for a specific call type.
131 * Set compare function: compares two ABI call object arguments.
133 static int cmp_call_arg(const void *a, const void *b, size_t n)
135 const be_abi_call_arg_t *p = a, *q = b;
137 return !(p->is_res == q->is_res && p->pos == q->pos);
141 * Get or set an ABI call object argument.
143 * @param call the abi call
144 * @param is_res true for call results, false for call arguments
145 * @param pos position of the argument
146 * @param do_insert true if the argument is set, false if it's retrieved
148 static be_abi_call_arg_t *get_or_set_call_arg(be_abi_call_t *call, int is_res, int pos, int do_insert)
150 be_abi_call_arg_t arg;
153 memset(&arg, 0, sizeof(arg));
157 hash = is_res * 128 + pos;
160 ? set_insert(call->params, &arg, sizeof(arg), hash)
161 : set_find(call->params, &arg, sizeof(arg), hash);
165 * Retrieve an ABI call object argument.
167 * @param call the ABI call object
168 * @param is_res true for call results, false for call arguments
169 * @param pos position of the argument
171 static INLINE be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
173 return get_or_set_call_arg(call, is_res, pos, 0);
176 /* Set the flags for a call. */
177 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
184 /* Set register class for call address */
185 void be_abi_call_set_call_address_reg_class(be_abi_call_t *call, const arch_register_class_t *cls)
187 call->cls_addr = cls;
191 void be_abi_call_param_stack(be_abi_call_t *call, int arg_pos, unsigned alignment, unsigned space_before, unsigned space_after)
193 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
195 arg->alignment = alignment;
196 arg->space_before = space_before;
197 arg->space_after = space_after;
198 assert(alignment > 0 && "Alignment must be greater than 0");
201 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
203 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
208 void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
210 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 1, arg_pos, 1);
215 /* Get the flags of a ABI call object. */
216 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
222 * Constructor for a new ABI call object.
224 * @return the new ABI call object
226 static be_abi_call_t *be_abi_call_new(const arch_register_class_t *cls_addr)
228 be_abi_call_t *call = xmalloc(sizeof(call[0]));
231 call->params = new_set(cmp_call_arg, 16);
233 call->cls_addr = cls_addr;
235 call->flags.bits.try_omit_fp = be_omit_fp;
241 * Destructor for an ABI call object.
243 static void be_abi_call_free(be_abi_call_t *call)
245 del_set(call->params);
251 | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _
252 | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` |
253 | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| |
254 |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, |
257 Handling of the stack frame. It is composed of three types:
258 1) The type of the arguments which are pushed on the stack.
259 2) The "between type" which consists of stuff the call of the
260 function pushes on the stack (like the return address and
261 the old base pointer for ia32).
262 3) The Firm frame type which consists of all local variables
266 static int get_stack_entity_offset(be_stack_layout_t *frame, ir_entity *ent, int bias)
268 ir_type *t = get_entity_owner(ent);
269 int ofs = get_entity_offset(ent);
273 /* Find the type the entity is contained in. */
274 for(index = 0; index < N_FRAME_TYPES; ++index) {
275 if(frame->order[index] == t)
279 /* Add the size of all the types below the one of the entity to the entity's offset */
280 for(i = 0; i < index; ++i)
281 ofs += get_type_size_bytes(frame->order[i]);
283 /* correct the offset by the initial position of the frame pointer */
284 ofs -= frame->initial_offset;
286 /* correct the offset with the current bias. */
293 * Retrieve the entity with given offset from a frame type.
295 static ir_entity *search_ent_with_offset(ir_type *t, int offset)
299 for(i = 0, n = get_compound_n_members(t); i < n; ++i) {
300 ir_entity *ent = get_compound_member(t, i);
301 if(get_entity_offset(ent) == offset)
308 static int stack_frame_compute_initial_offset(be_stack_layout_t *frame)
310 ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
311 ir_entity *ent = search_ent_with_offset(base, 0);
313 frame->initial_offset = ent ? get_stack_entity_offset(frame, ent, 0) : 0;
315 return frame->initial_offset;
319 * Initializes the frame layout from parts
321 * @param frame the stack layout that will be initialized
322 * @param args the stack argument layout type
323 * @param between the between layout type
324 * @param locals the method frame type
325 * @param stack_dir the stack direction
326 * @param param_map an array mapping method argument positions to the stack argument type
328 * @return the initialized stack layout
330 static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *args,
331 ir_type *between, ir_type *locals, int stack_dir,
332 ir_entity *param_map[])
334 frame->arg_type = args;
335 frame->between_type = between;
336 frame->frame_type = locals;
337 frame->initial_offset = 0;
338 frame->stack_dir = stack_dir;
339 frame->order[1] = between;
340 frame->param_map = param_map;
343 frame->order[0] = args;
344 frame->order[2] = locals;
347 frame->order[0] = locals;
348 frame->order[2] = args;
354 /** Dumps the stack layout to file. */
355 static void stack_layout_dump(FILE *file, be_stack_layout_t *frame)
359 ir_fprintf(file, "initial offset: %d\n", frame->initial_offset);
360 for (j = 0; j < N_FRAME_TYPES; ++j) {
361 ir_type *t = frame->order[j];
363 ir_fprintf(file, "type %d: %F size: %d\n", j, t, get_type_size_bytes(t));
364 for (i = 0, n = get_compound_n_members(t); i < n; ++i) {
365 ir_entity *ent = get_compound_member(t, i);
366 ir_fprintf(file, "\t%F int ofs: %d glob ofs: %d\n", ent, get_entity_offset_bytes(ent), get_stack_entity_offset(frame, ent, 0));
373 * Returns non-zero if the call argument at given position
374 * is transfered on the stack.
376 static INLINE int is_on_stack(be_abi_call_t *call, int pos)
378 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
379 return arg && !arg->in_reg;
389 Adjustment of the calls inside a graph.
394 * Transform a call node into a be_Call node.
396 * @param env The ABI environment for the current irg.
397 * @param irn The call node.
398 * @param curr_sp The stack pointer node to use.
399 * @return The stack pointer after the call.
401 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp)
403 ir_graph *irg = env->birg->irg;
404 const arch_env_t *arch_env = env->birg->main_env->arch_env;
405 const arch_isa_t *isa = arch_env->isa;
406 ir_type *mt = get_Call_type(irn);
407 ir_node *call_ptr = get_Call_ptr(irn);
408 int n_params = get_method_n_params(mt);
409 ir_node *curr_mem = get_Call_mem(irn);
410 ir_node *bl = get_nodes_block(irn);
411 pset *results = pset_new_ptr(8);
412 pset *caller_save = pset_new_ptr(8);
413 pset *states = pset_new_ptr(2);
415 int stack_dir = arch_isa_stack_dir(isa);
416 const arch_register_t *sp = arch_isa_sp(isa);
417 be_abi_call_t *call = be_abi_call_new(sp->reg_class);
418 ir_mode *mach_mode = sp->reg_class->mode;
419 struct obstack *obst = &env->obst;
420 int no_alloc = call->flags.bits.frame_is_setup_on_call;
421 int n_res = get_method_n_ress(mt);
423 ir_node *res_proj = NULL;
424 int n_reg_params = 0;
425 int n_stack_params = 0;
431 int n_reg_results = 0;
432 const arch_register_t *reg;
433 const ir_edge_t *edge;
435 int *stack_param_idx;
438 /* Let the isa fill out the abi description for that call node. */
439 arch_isa_get_call_abi(isa, mt, call);
441 /* Insert code to put the stack arguments on the stack. */
442 assert(get_Call_n_params(irn) == n_params);
443 for (i = 0; i < n_params; ++i) {
444 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
447 int arg_size = get_type_size_bytes(get_method_param_type(mt, i));
449 stack_size += round_up2(arg->space_before, arg->alignment);
450 stack_size += round_up2(arg_size, arg->alignment);
451 stack_size += round_up2(arg->space_after, arg->alignment);
452 obstack_int_grow(obst, i);
456 stack_param_idx = obstack_finish(obst);
458 /* Collect all arguments which are passed in registers. */
459 for (i = 0; i < n_params; ++i) {
460 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
461 if (arg && arg->in_reg) {
462 obstack_int_grow(obst, i);
466 reg_param_idxs = obstack_finish(obst);
468 /* If there are some parameters which shall be passed on the stack. */
469 if (n_stack_params > 0) {
471 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
474 * Reverse list of stack parameters if call arguments are from left to right.
475 * We must them reverse again if they are pushed (not stored) and the stack
476 * direction is downwards.
478 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
479 for (i = 0; i < n_stack_params >> 1; ++i) {
480 int other = n_stack_params - i - 1;
481 int tmp = stack_param_idx[i];
482 stack_param_idx[i] = stack_param_idx[other];
483 stack_param_idx[other] = tmp;
488 * If the stack is decreasing and we do not want to store sequentially,
489 * or someone else allocated the call frame
490 * we allocate as much space on the stack all parameters need, by
491 * moving the stack pointer along the stack's direction.
493 if (stack_dir < 0 && !do_seq && !no_alloc) {
494 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, stack_size);
498 obstack_ptr_grow(obst, get_Call_mem(irn));
499 curr_mem = new_NoMem();
501 curr_mem = get_Call_mem(irn);
504 for (i = 0; i < n_stack_params; ++i) {
505 int p = stack_param_idx[i];
506 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
507 ir_node *param = get_Call_param(irn, p);
508 ir_node *addr = curr_sp;
510 ir_type *param_type = get_method_param_type(mt, p);
511 int param_size = get_type_size_bytes(param_type) + arg->space_after;
514 * If we wanted to build the arguments sequentially,
515 * the stack pointer for the next must be incremented,
516 * and the memory value propagated.
520 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, param_size + arg->space_before);
521 add_irn_dep(curr_sp, curr_mem);
524 curr_ofs += arg->space_before;
525 curr_ofs = round_up2(curr_ofs, arg->alignment);
527 /* Make the expression to compute the argument's offset. */
529 ir_mode *constmode = mach_mode;
530 if(mode_is_reference(mach_mode)) {
533 addr = new_r_Const_long(irg, bl, constmode, curr_ofs);
534 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
538 /* Insert a store for primitive arguments. */
539 if (is_atomic_type(param_type)) {
541 store = new_r_Store(irg, bl, curr_mem, addr, param);
542 mem = new_r_Proj(irg, bl, store, mode_M, pn_Store_M);
545 /* Make a mem copy for compound arguments. */
549 assert(mode_is_reference(get_irn_mode(param)));
550 copy = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type);
551 mem = new_r_Proj(irg, bl, copy, mode_M, pn_CopyB_M_regular);
554 curr_ofs += param_size;
559 obstack_ptr_grow(obst, mem);
562 in = (ir_node **) obstack_finish(obst);
564 /* We need the sync only, if we didn't build the stores sequentially. */
566 if (n_stack_params >= 1) {
567 curr_mem = new_r_Sync(irg, bl, n_stack_params + 1, in);
569 curr_mem = get_Call_mem(irn);
572 obstack_free(obst, in);
575 /* Collect caller save registers */
576 for (i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
578 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
579 for (j = 0; j < cls->n_regs; ++j) {
580 const arch_register_t *reg = arch_register_for_index(cls, j);
581 if (arch_register_type_is(reg, caller_save)) {
582 pset_insert_ptr(caller_save, (void *) reg);
584 if (arch_register_type_is(reg, state)) {
585 pset_insert_ptr(caller_save, (void*) reg);
586 pset_insert_ptr(states, (void*) reg);
591 /* search the greatest result proj number */
593 res_projs = alloca(n_res * sizeof(res_projs[0]));
594 memset(res_projs, 0, n_res * sizeof(res_projs[0]));
596 foreach_out_edge(irn, edge) {
597 const ir_edge_t *res_edge;
598 ir_node *irn = get_edge_src_irn(edge);
600 if(!is_Proj(irn) || get_Proj_proj(irn) != pn_Call_T_result)
603 foreach_out_edge(irn, res_edge) {
605 ir_node *res = get_edge_src_irn(res_edge);
607 assert(is_Proj(res));
609 proj = get_Proj_proj(res);
610 assert(proj < n_res);
611 assert(res_projs[proj] == NULL);
612 res_projs[proj] = res;
618 /** TODO: this is not correct for cases where return values are passed
619 * on the stack, but no known ABI does this currentl...
621 n_reg_results = n_res;
623 /* make the back end call node and set its register requirements. */
624 for (i = 0; i < n_reg_params; ++i) {
625 obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
627 foreach_pset(states, reg) {
628 const arch_register_class_t *cls = arch_register_get_class(reg);
630 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
631 ir_fprintf(stderr, "Adding %+F\n", regnode);
633 ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
634 obstack_ptr_grow(obst, regnode);
636 n_ins = n_reg_params + pset_count(states);
638 in = obstack_finish(obst);
640 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
642 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
644 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
645 n_ins, in, get_Call_type(irn));
646 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
649 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
651 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
652 n_ins, in, get_Call_type(irn));
654 ARR_APP1(ir_node *, env->calls, low_call);
656 for(i = 0; i < n_res; ++i) {
658 ir_node *proj = res_projs[i];
659 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
661 /* returns values on stack not supported yet */
665 shift the proj number to the right, since we will drop the
666 unspeakable Proj_T from the Call. Therefore, all real argument
667 Proj numbers must be increased by pn_be_Call_first_res
669 pn = i + pn_be_Call_first_res;
672 ir_type *res_type = get_method_res_type(mt, i);
673 ir_mode *mode = get_type_mode(res_type);
674 proj = new_r_Proj(irg, bl, low_call, mode, pn);
677 set_Proj_pred(proj, low_call);
678 set_Proj_proj(proj, pn);
682 pset_remove_ptr(caller_save, arg->reg);
687 Set the register class of the call address to
688 the backend provided class (default: stack pointer class)
690 be_node_set_reg_class(low_call, be_pos_Call_ptr, call->cls_addr);
692 DBG((env->dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
694 /* Set the register classes and constraints of the Call parameters. */
695 for (i = 0; i < n_reg_params; ++i) {
696 int index = reg_param_idxs[i];
697 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
698 assert(arg->reg != NULL);
700 be_set_constr_single_reg(low_call, be_pos_Call_first_arg + i, arg->reg);
703 /* Set the register constraints of the results. */
704 for (i = 0; i < n_res; ++i) {
705 ir_node *proj = res_projs[i];
706 const be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
707 int pn = get_Proj_proj(proj);
710 be_set_constr_single_reg(low_call, BE_OUT_POS(pn), arg->reg);
711 arch_set_irn_register(arch_env, proj, arg->reg);
713 obstack_free(obst, in);
714 exchange(irn, low_call);
716 /* kill the ProjT node */
717 if (res_proj != NULL) {
718 be_kill_node(res_proj);
721 /* Make additional projs for the caller save registers
722 and the Keep node which keeps them alive. */
723 if (pset_count(caller_save) + n_reg_results > 0) {
724 const arch_register_t *reg;
728 = pn_be_Call_first_res + n_reg_results;
730 for (reg = pset_first(caller_save), n = 0; reg; reg = pset_next(caller_save), ++n) {
731 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode,
734 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
735 be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg);
736 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
738 /* a call can produce ignore registers, in this case set the flag and register for the Proj */
739 if (arch_register_type_is(reg, ignore)) {
740 be_node_set_flags(low_call, BE_OUT_POS(curr_res_proj),
741 arch_irn_flags_ignore);
744 set_irn_link(proj, (void*) reg);
745 obstack_ptr_grow(obst, proj);
749 for(i = 0; i < n_reg_results; ++i) {
750 ir_node *proj = res_projs[i];
751 const arch_register_t *reg = arch_get_irn_register(arch_env, proj);
752 set_irn_link(proj, (void*) reg);
753 obstack_ptr_grow(obst, proj);
757 /* create the Keep for the caller save registers */
758 in = (ir_node **) obstack_finish(obst);
759 keep = be_new_Keep(NULL, irg, bl, n, in);
760 for (i = 0; i < n; ++i) {
761 const arch_register_t *reg = get_irn_link(in[i]);
762 be_node_set_reg_class(keep, i, reg->reg_class);
764 obstack_free(obst, in);
767 /* Clean up the stack. */
768 if (stack_size > 0) {
769 ir_node *mem_proj = NULL;
771 foreach_out_edge(low_call, edge) {
772 ir_node *irn = get_edge_src_irn(edge);
773 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
780 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_Call_M);
781 keep_alive(mem_proj);
784 /* Clean up the stack frame if we allocated it */
786 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size);
787 add_irn_dep(curr_sp, mem_proj);
791 be_abi_call_free(call);
792 obstack_free(obst, stack_param_idx);
795 del_pset(caller_save);
801 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
803 * @param alignment the minimum stack alignment
804 * @param size the node containing the non-aligned size
805 * @param irg the irg where new nodes are allocated on
806 * @param irg the block where new nodes are allocated on
807 * @param dbg debug info for new nodes
809 * @return a node representing the aligned size
811 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size,
812 ir_graph *irg, ir_node *block, dbg_info *dbg)
814 if (stack_alignment > 1) {
815 ir_mode *mode = get_irn_mode(size);
816 tarval *tv = new_tarval_from_long(stack_alignment-1, mode);
817 ir_node *mask = new_r_Const(irg, block, mode, tv);
819 size = new_rd_Add(dbg, irg, block, size, mask, mode);
821 tv = new_tarval_from_long(-(long)stack_alignment, mode);
822 mask = new_r_Const(irg, block, mode, tv);
823 size = new_rd_And(dbg, irg, block, size, mask, mode);
829 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
831 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
840 const ir_edge_t *edge;
841 ir_node *new_alloc, *size, *addr, *ins[2];
842 unsigned stack_alignment;
844 if (get_Alloc_where(alloc) != stack_alloc) {
849 block = get_nodes_block(alloc);
850 irg = get_irn_irg(block);
853 type = get_Alloc_type(alloc);
855 foreach_out_edge(alloc, edge) {
856 ir_node *irn = get_edge_src_irn(edge);
858 assert(is_Proj(irn));
859 switch(get_Proj_proj(irn)) {
871 /* Beware: currently Alloc nodes without a result might happen,
872 only escape analysis kills them and this phase runs only for object
873 oriented source. We kill the Alloc here. */
874 if (alloc_res == NULL && alloc_mem) {
875 exchange(alloc_mem, get_Alloc_mem(alloc));
879 dbg = get_irn_dbg_info(alloc);
881 /* we might need to multiply the size with the element size */
882 if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
883 tarval *tv = new_tarval_from_long(get_type_size_bytes(type),
885 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
886 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Alloc_size(alloc),
890 size = get_Alloc_size(alloc);
893 /* The stack pointer will be modified in an unknown manner.
894 We cannot omit it. */
895 env->call->flags.bits.try_omit_fp = 0;
897 /* FIXME: size must be here round up for the stack alignment, but
898 this must be transmitted from the backend. */
900 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
901 new_alloc = be_new_AddSP(env->isa->sp, irg, block, curr_sp, size);
902 set_irn_dbg_info(new_alloc, dbg);
904 if(alloc_mem != NULL) {
908 addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
910 /* We need to sync the output mem of the AddSP with the input mem
911 edge into the alloc node. */
912 ins[0] = get_Alloc_mem(alloc);
914 sync = new_r_Sync(irg, block, 2, ins);
916 exchange(alloc_mem, sync);
919 exchange(alloc, new_alloc);
921 /* fix projnum of alloca res */
922 set_Proj_proj(alloc_res, pn_be_AddSP_res);
925 curr_sp = new_r_Proj(irg, block, new_alloc, get_irn_mode(curr_sp),
933 * The Free is transformed into a back end free node and connected to the stack nodes.
935 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
939 ir_node *subsp, *mem, *res, *size, *sync;
943 unsigned stack_alignment;
946 if (get_Free_where(free) != stack_alloc) {
951 block = get_nodes_block(free);
952 irg = get_irn_irg(block);
953 type = get_Free_type(free);
954 sp_mode = env->isa->sp->reg_class->mode;
955 dbg = get_irn_dbg_info(free);
957 /* we might need to multiply the size with the element size */
958 if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
959 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
960 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
961 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
965 size = get_Free_size(free);
968 /* FIXME: size must be here round up for the stack alignment, but
969 this must be transmitted from the backend. */
971 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
973 /* The stack pointer will be modified in an unknown manner.
974 We cannot omit it. */
975 env->call->flags.bits.try_omit_fp = 0;
976 subsp = be_new_SubSP(env->isa->sp, irg, block, curr_sp, size);
977 set_irn_dbg_info(subsp, dbg);
979 mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
980 res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_sp);
982 /* we need to sync the memory */
983 in[0] = get_Free_mem(free);
985 sync = new_r_Sync(irg, block, 2, in);
987 /* and make the AddSP dependent on the former memory */
988 add_irn_dep(subsp, get_Free_mem(free));
991 exchange(free, sync);
997 /* the following function is replaced by the usage of the heights module */
1000 * Walker for dependent_on().
1001 * This function searches a node tgt recursively from a given node
1002 * but is restricted to the given block.
1003 * @return 1 if tgt was reachable from curr, 0 if not.
1005 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl)
1009 if (get_nodes_block(curr) != bl)
1015 /* Phi functions stop the recursion inside a basic block */
1016 if (! is_Phi(curr)) {
1017 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
1018 if (check_dependence(get_irn_n(curr, i), tgt, bl))
1028 * Check if a node is somehow data dependent on another one.
1029 * both nodes must be in the same basic block.
1030 * @param n1 The first node.
1031 * @param n2 The second node.
1032 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1034 static int dependent_on(ir_node *n1, ir_node *n2)
1036 assert(get_nodes_block(n1) == get_nodes_block(n2));
1038 return heights_reachable_in_block(ir_heights, n1, n2);
1041 static int cmp_call_dependency(const void *c1, const void *c2)
1043 ir_node *n1 = *(ir_node **) c1;
1044 ir_node *n2 = *(ir_node **) c2;
1047 Classical qsort() comparison function behavior:
1048 0 if both elements are equal
1049 1 if second is "smaller" that first
1050 -1 if first is "smaller" that second
1052 if (dependent_on(n1, n2))
1055 if (dependent_on(n2, n1))
1062 * Walker: links all Call/alloc/Free nodes to the Block they are contained.
1064 static void link_calls_in_block_walker(ir_node *irn, void *data)
1066 ir_opcode code = get_irn_opcode(irn);
1068 if (code == iro_Call ||
1069 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1070 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1071 be_abi_irg_t *env = data;
1072 ir_node *bl = get_nodes_block(irn);
1073 void *save = get_irn_link(bl);
1075 if (code == iro_Call)
1076 env->call->flags.bits.irg_is_leaf = 0;
1078 set_irn_link(irn, save);
1079 set_irn_link(bl, irn);
1085 * Process all Call nodes inside a basic block.
1086 * Note that the link field of the block must contain a linked list of all
1087 * Call nodes inside the Block. We first order this list according to data dependency
1088 * and that connect the calls together.
1090 static void process_calls_in_block(ir_node *bl, void *data)
1092 be_abi_irg_t *env = data;
1093 ir_node *curr_sp = env->init_sp;
1097 for(irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
1098 obstack_ptr_grow(&env->obst, irn);
1100 /* If there were call nodes in the block. */
1106 nodes = obstack_finish(&env->obst);
1108 /* order the call nodes according to data dependency */
1109 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
1111 for(i = n - 1; i >= 0; --i) {
1112 ir_node *irn = nodes[i];
1114 DBG((env->dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1115 switch(get_irn_opcode(irn)) {
1117 curr_sp = adjust_call(env, irn, curr_sp);
1120 curr_sp = adjust_alloc(env, irn, curr_sp);
1123 curr_sp = adjust_free(env, irn, curr_sp);
1126 panic("invalid call");
1131 obstack_free(&env->obst, nodes);
1133 /* Keep the last stack state in the block by tying it to Keep node */
1134 if(curr_sp != env->init_sp) {
1136 keep = be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl),
1138 pmap_insert(env->keep_map, bl, keep);
1142 set_irn_link(bl, curr_sp);
1143 } /* process_calls_in_block */
1146 * Adjust all call nodes in the graph to the ABI conventions.
1148 static void process_calls(be_abi_irg_t *env)
1150 ir_graph *irg = env->birg->irg;
1152 env->call->flags.bits.irg_is_leaf = 1;
1153 irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, env);
1155 ir_heights = heights_new(env->birg->irg);
1156 irg_block_walk_graph(irg, NULL, process_calls_in_block, env);
1157 heights_free(ir_heights);
1161 static ir_node *setup_frame(be_abi_irg_t *env)
1163 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1164 const arch_register_t *sp = isa->sp;
1165 const arch_register_t *bp = isa->bp;
1166 be_abi_call_flags_bits_t flags = env->call->flags.bits;
1167 ir_graph *irg = env->birg->irg;
1168 ir_node *bl = get_irg_start_block(irg);
1169 ir_node *no_mem = get_irg_no_mem(irg);
1170 ir_node *old_frame = get_irg_frame(irg);
1171 ir_node *stack = pmap_get(env->regs, (void *) sp);
1172 ir_node *frame = pmap_get(env->regs, (void *) bp);
1174 int stack_nr = get_Proj_proj(stack);
1176 if(flags.try_omit_fp) {
1177 stack = be_new_IncSP(sp, irg, bl, stack, no_mem, BE_STACK_FRAME_SIZE_EXPAND);
1182 frame = be_new_Copy(bp->reg_class, irg, bl, stack);
1184 be_node_set_flags(frame, -1, arch_irn_flags_dont_spill);
1185 if(!flags.fp_free) {
1186 be_set_constr_single_reg(frame, -1, bp);
1187 be_node_set_flags(frame, -1, arch_irn_flags_ignore);
1188 arch_set_irn_register(env->birg->main_env->arch_env, frame, bp);
1191 stack = be_new_IncSP(sp, irg, bl, stack, frame, BE_STACK_FRAME_SIZE_EXPAND);
1194 be_node_set_flags(env->reg_params, -(stack_nr + 1), arch_irn_flags_ignore);
1195 env->init_sp = stack;
1196 set_irg_frame(irg, frame);
1197 edges_reroute(old_frame, frame, irg);
1202 static void clearup_frame(be_abi_irg_t *env, ir_node *ret, pmap *reg_map, struct obstack *obst)
1204 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1205 const arch_register_t *sp = isa->sp;
1206 const arch_register_t *bp = isa->bp;
1207 ir_graph *irg = env->birg->irg;
1208 ir_node *ret_mem = get_Return_mem(ret);
1209 ir_node *frame = get_irg_frame(irg);
1210 ir_node *bl = get_nodes_block(ret);
1211 ir_node *stack = get_irn_link(bl);
1215 if(env->call->flags.bits.try_omit_fp) {
1216 stack = be_new_IncSP(sp, irg, bl, stack, ret_mem, -BE_STACK_FRAME_SIZE_SHRINK);
1220 stack = be_new_SetSP(sp, irg, bl, stack, frame, ret_mem);
1221 be_set_constr_single_reg(stack, -1, sp);
1222 be_node_set_flags(stack, -1, arch_irn_flags_ignore);
1225 pmap_foreach(env->regs, ent) {
1226 const arch_register_t *reg = ent->key;
1227 ir_node *irn = ent->value;
1230 obstack_ptr_grow(&env->obst, stack);
1232 obstack_ptr_grow(&env->obst, frame);
1233 else if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1234 obstack_ptr_grow(obst, irn);
1241 * Computes the stack argument layout type.
1242 * Changes a possibly allocated value param type by moving
1243 * entities to the stack layout type.
1245 * @param env the ABI environment
1246 * @param call the current call ABI
1247 * @param method_type the method type
1248 * @param param_map an array mapping method arguments to the stack layout type
1250 * @return the stack argument layout type
1252 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type, ir_entity ***param_map)
1254 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1255 int inc = env->birg->main_env->arch_env->isa->stack_dir * dir;
1256 int n = get_method_n_params(method_type);
1257 int curr = inc > 0 ? 0 : n - 1;
1263 ir_type *val_param_tp = get_method_value_param_type(method_type);
1264 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1267 *param_map = map = obstack_alloc(&env->obst, n * sizeof(ir_entity *));
1268 res = new_type_struct(mangle_u(id, new_id_from_chars("arg_type", 8)));
1269 for (i = 0; i < n; ++i, curr += inc) {
1270 ir_type *param_type = get_method_param_type(method_type, curr);
1271 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1274 if (arg->on_stack) {
1276 /* the entity was already created, move it to the param type */
1277 arg->stack_ent = get_method_value_param_ent(method_type, i);
1278 remove_struct_member(val_param_tp, arg->stack_ent);
1279 set_entity_owner(arg->stack_ent, res);
1280 add_struct_member(res, arg->stack_ent);
1281 /* must be automatic to set a fixed layout */
1282 set_entity_allocation(arg->stack_ent, allocation_automatic);
1285 snprintf(buf, sizeof(buf), "param_%d", i);
1286 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1288 ofs += arg->space_before;
1289 ofs = round_up2(ofs, arg->alignment);
1290 set_entity_offset(arg->stack_ent, ofs);
1291 ofs += arg->space_after;
1292 ofs += get_type_size_bytes(param_type);
1293 map[i] = arg->stack_ent;
1296 set_type_size_bytes(res, ofs);
1297 set_type_state(res, layout_fixed);
1302 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
1305 struct obstack obst;
1307 obstack_init(&obst);
1309 /* Create a Perm after the RegParams node to delimit it. */
1310 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1311 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1316 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
1317 const arch_register_t *reg = &cls->regs[j];
1318 ir_node *irn = pmap_get(regs, (void *) reg);
1320 if(irn && !arch_register_type_is(reg, ignore)) {
1322 obstack_ptr_grow(&obst, irn);
1323 set_irn_link(irn, (void *) reg);
1327 obstack_ptr_grow(&obst, NULL);
1328 in = obstack_finish(&obst);
1330 perm = be_new_Perm(cls, irg, bl, n_regs, in);
1331 for(j = 0; j < n_regs; ++j) {
1332 ir_node *arg = in[j];
1333 arch_register_t *reg = get_irn_link(arg);
1334 pmap_insert(regs, reg, arg);
1335 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
1338 obstack_free(&obst, in);
1341 obstack_free(&obst, NULL);
1346 const arch_register_t *reg;
1350 static int cmp_regs(const void *a, const void *b)
1352 const reg_node_map_t *p = a;
1353 const reg_node_map_t *q = b;
1355 if(p->reg->reg_class == q->reg->reg_class)
1356 return p->reg->index - q->reg->index;
1358 return p->reg->reg_class - q->reg->reg_class;
1361 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1364 int n = pmap_count(reg_map);
1366 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1368 pmap_foreach(reg_map, ent) {
1369 res[i].reg = ent->key;
1370 res[i].irn = ent->value;
1374 qsort(res, n, sizeof(res[0]), cmp_regs);
1379 * Creates a barrier.
1381 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1383 ir_graph *irg = env->birg->irg;
1384 int n_regs = pmap_count(regs);
1390 rm = reg_map_to_arr(&env->obst, regs);
1392 for(n = 0; n < n_regs; ++n)
1393 obstack_ptr_grow(&env->obst, rm[n].irn);
1396 obstack_ptr_grow(&env->obst, *mem);
1400 in = (ir_node **) obstack_finish(&env->obst);
1401 irn = be_new_Barrier(irg, bl, n, in);
1402 obstack_free(&env->obst, in);
1404 for(n = 0; n < n_regs; ++n) {
1405 const arch_register_t *reg = rm[n].reg;
1407 int pos = BE_OUT_POS(n);
1410 proj = new_r_Proj(irg, bl, irn, get_irn_mode(rm[n].irn), n);
1411 be_node_set_reg_class(irn, n, reg->reg_class);
1413 be_set_constr_single_reg(irn, n, reg);
1414 be_set_constr_single_reg(irn, pos, reg);
1415 be_node_set_reg_class(irn, pos, reg->reg_class);
1416 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1418 /* if the proj projects a ignore register or a node which is set to ignore, propagate this property. */
1419 if(arch_register_type_is(reg, ignore) || arch_irn_is(env->birg->main_env->arch_env, in[n], ignore))
1420 flags |= arch_irn_flags_ignore;
1422 if(arch_irn_is(env->birg->main_env->arch_env, in[n], modify_sp))
1423 flags |= arch_irn_flags_modify_sp;
1425 be_node_set_flags(irn, pos, flags);
1427 pmap_insert(regs, (void *) reg, proj);
1431 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1434 obstack_free(&env->obst, rm);
1439 * Creates a be_Return for a Return node.
1441 * @param @env the abi environment
1442 * @param irn the Return node or NULL if there was none
1443 * @param bl the block where the be_Retun should be placed
1444 * @param mem the current memory
1445 * @param n_res number of return results
1447 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, ir_node *mem, int n_res) {
1448 be_abi_call_t *call = env->call;
1449 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1451 pmap *reg_map = pmap_create();
1452 ir_node *keep = pmap_get(env->keep_map, bl);
1458 const arch_register_t **regs;
1462 get the valid stack node in this block.
1463 If we had a call in that block there is a Keep constructed by process_calls()
1464 which points to the last stack modification in that block. we'll use
1465 it then. Else we use the stack from the start block and let
1466 the ssa construction fix the usage.
1468 stack = be_abi_reg_map_get(env->regs, isa->sp);
1470 stack = get_irn_n(keep, 0);
1472 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1475 /* Insert results for Return into the register map. */
1476 for(i = 0; i < n_res; ++i) {
1477 ir_node *res = get_Return_res(irn, i);
1478 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1479 assert(arg->in_reg && "return value must be passed in register");
1480 pmap_insert(reg_map, (void *) arg->reg, res);
1483 /* Add uses of the callee save registers. */
1484 pmap_foreach(env->regs, ent) {
1485 const arch_register_t *reg = ent->key;
1486 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1487 pmap_insert(reg_map, ent->key, ent->value);
1490 be_abi_reg_map_set(reg_map, isa->sp, stack);
1492 /* Make the Epilogue node and call the arch's epilogue maker. */
1493 create_barrier(env, bl, &mem, reg_map, 1);
1494 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1497 Maximum size of the in array for Return nodes is
1498 return args + callee save/ignore registers + memory + stack pointer
1500 in_max = pmap_count(reg_map) + n_res + 2;
1502 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1503 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1506 in[1] = be_abi_reg_map_get(reg_map, isa->sp);
1511 /* clear SP entry, since it has already been grown. */
1512 pmap_insert(reg_map, (void *) isa->sp, NULL);
1513 for(i = 0; i < n_res; ++i) {
1514 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1516 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1517 regs[n++] = arg->reg;
1519 /* Clear the map entry to mark the register as processed. */
1520 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1523 /* grow the rest of the stuff. */
1524 pmap_foreach(reg_map, ent) {
1527 regs[n++] = ent->key;
1531 /* The in array for the new back end return is now ready. */
1532 ret = be_new_Return(irn ? get_irn_dbg_info(irn) : NULL, env->birg->irg, bl, n_res, n, in);
1534 /* Set the register classes of the return's parameter accordingly. */
1535 for(i = 0; i < n; ++i)
1537 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1539 /* Free the space of the Epilog's in array and the register <-> proj map. */
1540 obstack_free(&env->obst, in);
1541 pmap_destroy(reg_map);
1546 typedef struct lower_frame_sels_env_t {
1548 ir_entity *value_param_list; /**< the list of all value param entities */
1549 ir_entity *value_param_tail; /**< the tail of the list of all value param entities */
1550 } lower_frame_sels_env_t;
1553 * Walker: Replaces Sels of frame type and
1554 * value param type entities by FrameAddress.
1555 * Links all used entities.
1557 static void lower_frame_sels_walker(ir_node *irn, void *data) {
1558 lower_frame_sels_env_t *ctx = data;
1561 ir_graph *irg = current_ir_graph;
1562 ir_node *frame = get_irg_frame(irg);
1563 ir_node *param_base = get_irg_value_param_base(irg);
1564 ir_node *ptr = get_Sel_ptr(irn);
1566 if (ptr == frame || ptr == param_base) {
1567 be_abi_irg_t *env = ctx->env;
1568 ir_entity *ent = get_Sel_entity(irn);
1569 ir_node *bl = get_nodes_block(irn);
1572 nw = be_new_FrameAddr(env->isa->sp->reg_class, irg, bl, frame, ent);
1575 /* check, if it's a param sel and if have not seen this entity before */
1576 if (ptr == param_base &&
1577 ent != ctx->value_param_tail &&
1578 get_entity_link(ent) == NULL) {
1579 set_entity_link(ent, ctx->value_param_list);
1580 ctx->value_param_list = ent;
1581 if (ctx->value_param_tail == NULL) ctx->value_param_tail = ent;
1588 * Check if a value parameter is transmitted as a register.
1589 * This might happen if the address of an parameter is taken which is
1590 * transmitted in registers.
1592 * Note that on some architectures this case must be handled specially
1593 * because the place of the backing store is determined by their ABI.
1595 * In the default case we move the entity to the frame type and create
1596 * a backing store into the first block.
1598 static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_entity *value_param_list) {
1599 be_abi_call_t *call = env->call;
1600 ir_graph *irg = env->birg->irg;
1601 ir_entity *ent, *next_ent, *new_list;
1603 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1606 for (ent = value_param_list; ent; ent = next_ent) {
1607 int i = get_struct_member_index(get_entity_owner(ent), ent);
1608 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1610 next_ent = get_entity_link(ent);
1612 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", i));
1613 set_entity_link(ent, new_list);
1618 /* ok, change the graph */
1619 ir_node *start_bl = get_irg_start_block(irg);
1620 ir_node *first_bl = NULL;
1621 ir_node *frame, *imem, *nmem, *store, *mem, *args, *args_bl;
1622 const ir_edge_t *edge;
1623 optimization_state_t state;
1626 foreach_block_succ(start_bl, edge) {
1627 ir_node *succ = get_edge_src_irn(edge);
1628 if (start_bl != succ) {
1634 /* we had already removed critical edges, so the following
1635 assertion should be always true. */
1636 assert(get_Block_n_cfgpreds(first_bl) == 1);
1638 /* now create backing stores */
1639 frame = get_irg_frame(irg);
1640 imem = get_irg_initial_mem(irg);
1642 save_optimization_state(&state);
1644 nmem = new_r_Proj(irg, first_bl, get_irg_start(irg), mode_M, pn_Start_M);
1645 restore_optimization_state(&state);
1647 /* reroute all edges to the new memory source */
1648 edges_reroute(imem, nmem, irg);
1652 args = get_irg_args(irg);
1653 args_bl = get_nodes_block(args);
1654 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1655 int i = get_struct_member_index(get_entity_owner(ent), ent);
1656 ir_type *tp = get_entity_type(ent);
1657 ir_mode *mode = get_type_mode(tp);
1660 /* address for the backing store */
1661 addr = be_new_FrameAddr(env->isa->sp->reg_class, irg, first_bl, frame, ent);
1664 mem = new_r_Proj(irg, first_bl, store, mode_M, pn_Store_M);
1666 /* the backing store itself */
1667 store = new_r_Store(irg, first_bl, mem, addr,
1668 new_r_Proj(irg, args_bl, args, mode, i));
1670 /* the new memory Proj gets the last Proj from store */
1671 set_Proj_pred(nmem, store);
1672 set_Proj_proj(nmem, pn_Store_M);
1674 /* move all entities to the frame type */
1675 frame_tp = get_irg_frame_type(irg);
1676 offset = get_type_size_bytes(frame_tp);
1677 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1678 ir_type *tp = get_entity_type(ent);
1679 int align = get_type_alignment_bytes(tp);
1681 offset += align - 1;
1683 set_entity_owner(ent, frame_tp);
1684 add_class_member(frame_tp, ent);
1685 /* must be automatic to set a fixed layout */
1686 set_entity_allocation(ent, allocation_automatic);
1687 set_entity_offset(ent, offset);
1688 offset += get_type_size_bytes(tp);
1690 set_type_size_bytes(frame_tp, offset);
1696 * The start block has no jump, instead it has an initial exec Proj.
1697 * The backend wants to handle all blocks the same way, so we replace
1698 * the out cfg edge with a real jump.
1700 static void fix_start_block(ir_node *block, void *env) {
1703 ir_node *start_block;
1706 /* we processed the start block, return */
1710 irg = get_irn_irg(block);
1711 start_block = get_irg_start_block(irg);
1713 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1714 ir_node *pred = get_Block_cfgpred(block, i);
1715 ir_node *pred_block = get_nodes_block(pred);
1717 /* ok, we are in the block, having start as cfg predecessor */
1718 if (pred_block == start_block) {
1719 ir_node *jump = new_r_Jmp(irg, pred_block);
1720 set_Block_cfgpred(block, i, jump);
1728 * Modify the irg itself and the frame type.
1730 static void modify_irg(be_abi_irg_t *env)
1732 be_abi_call_t *call = env->call;
1733 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1734 const arch_register_t *sp = arch_isa_sp(isa);
1735 ir_graph *irg = env->birg->irg;
1736 ir_node *bl = get_irg_start_block(irg);
1737 ir_node *end = get_irg_end_block(irg);
1738 ir_node *old_mem = get_irg_initial_mem(irg);
1739 ir_node *new_mem_proj;
1741 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1742 pset *dont_save = pset_new_ptr(8);
1748 const arch_register_t *fp_reg;
1749 ir_node *frame_pointer;
1751 ir_node *reg_params_bl;
1754 ir_node *value_param_base;
1755 const ir_edge_t *edge;
1756 ir_type *arg_type, *bet_type, *tp;
1757 lower_frame_sels_env_t ctx;
1758 ir_entity **param_map;
1760 bitset_t *used_proj_nr;
1761 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1763 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1765 /* set the links of all frame entities to NULL, we use it
1766 to detect if an entity is already linked in the value_param_list */
1767 tp = get_method_value_param_type(method_type);
1769 for (i = get_struct_n_members(tp) - 1; i >= 0; --i)
1770 set_entity_link(get_struct_member(tp, i), NULL);
1773 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1775 ctx.value_param_list = NULL;
1776 ctx.value_param_tail = NULL;
1777 irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
1779 /* value_param_base anchor is not needed anymore now */
1780 value_param_base = get_irg_value_param_base(irg);
1781 be_kill_node(value_param_base);
1782 set_irg_value_param_base(irg, new_r_Bad(irg));
1784 env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0]));
1785 env->regs = pmap_create();
1787 used_proj_nr = bitset_alloca(1024);
1788 n_params = get_method_n_params(method_type);
1789 args = obstack_alloc(&env->obst, n_params * sizeof(args[0]));
1790 memset(args, 0, n_params * sizeof(args[0]));
1792 /* Check if a value parameter is transmitted as a register.
1793 * This might happen if the address of an parameter is taken which is
1794 * transmitted in registers.
1796 * Note that on some architectures this case must be handled specially
1797 * because the place of the backing store is determined by their ABI.
1799 * In the default case we move the entity to the frame type and create
1800 * a backing store into the first block.
1802 fix_address_of_parameter_access(env, ctx.value_param_list);
1804 /* Fill the argument vector */
1805 arg_tuple = get_irg_args(irg);
1806 foreach_out_edge(arg_tuple, edge) {
1807 ir_node *irn = get_edge_src_irn(edge);
1808 if (! is_Anchor(irn)) {
1809 int nr = get_Proj_proj(irn);
1811 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1815 arg_type = compute_arg_type(env, call, method_type, ¶m_map);
1816 bet_type = call->cb->get_between_type(env->cb);
1817 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), isa->stack_dir, param_map);
1819 /* Count the register params and add them to the number of Projs for the RegParams node */
1820 for(i = 0; i < n_params; ++i) {
1821 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1822 if(arg->in_reg && args[i]) {
1823 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1824 assert(i == get_Proj_proj(args[i]));
1826 /* For now, associate the register with the old Proj from Start representing that argument. */
1827 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1828 bitset_set(used_proj_nr, i);
1829 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1833 /* Collect all callee-save registers */
1834 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1835 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1836 for(j = 0; j < cls->n_regs; ++j) {
1837 const arch_register_t *reg = &cls->regs[j];
1838 if(arch_register_type_is(reg, callee_save) ||
1839 arch_register_type_is(reg, state)) {
1840 pmap_insert(env->regs, (void *) reg, NULL);
1845 pmap_insert(env->regs, (void *) sp, NULL);
1846 pmap_insert(env->regs, (void *) isa->bp, NULL);
1847 reg_params_bl = get_irg_start_block(irg);
1848 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1849 add_irn_dep(env->reg_params, get_irg_start(irg));
1852 * make proj nodes for the callee save registers.
1853 * memorize them, since Return nodes get those as inputs.
1855 * Note, that if a register corresponds to an argument, the regs map contains
1856 * the old Proj from start for that argument.
1859 rm = reg_map_to_arr(&env->obst, env->regs);
1860 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1861 arch_register_t *reg = (void *) rm[i].reg;
1862 ir_mode *mode = reg->reg_class->mode;
1864 int pos = BE_OUT_POS((int) nr);
1870 bitset_set(used_proj_nr, nr);
1871 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1872 pmap_insert(env->regs, (void *) reg, proj);
1873 be_set_constr_single_reg(env->reg_params, pos, reg);
1874 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1877 * If the register is an ignore register,
1878 * The Proj for that register shall also be ignored during register allocation.
1880 if(arch_register_type_is(reg, ignore))
1881 flags |= arch_irn_flags_ignore;
1884 flags |= arch_irn_flags_modify_sp;
1886 be_node_set_flags(env->reg_params, pos, flags);
1888 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1890 obstack_free(&env->obst, rm);
1892 /* create a new initial memory proj */
1893 assert(is_Proj(old_mem));
1894 new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
1895 new_r_Unknown(irg, mode_T), mode_M,
1896 get_Proj_proj(old_mem));
1899 /* Generate the Prologue */
1900 fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
1902 /* do the stack allocation BEFORE the barrier, or spill code
1903 might be added before it */
1904 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1905 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND);
1906 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1908 env->start_barrier = barrier = create_barrier(env, bl, &mem, env->regs, 0);
1910 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1911 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1913 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1914 set_irg_frame(irg, frame_pointer);
1915 pset_insert_ptr(env->ignore_regs, fp_reg);
1917 /* rewire old mem users to new mem */
1918 set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
1919 exchange(old_mem, mem);
1921 set_irg_initial_mem(irg, mem);
1923 /* Now, introduce stack param nodes for all parameters passed on the stack */
1924 for(i = 0; i < n_params; ++i) {
1925 ir_node *arg_proj = args[i];
1926 ir_node *repl = NULL;
1928 if(arg_proj != NULL) {
1929 be_abi_call_arg_t *arg;
1930 ir_type *param_type;
1931 int nr = get_Proj_proj(arg_proj);
1934 nr = MIN(nr, n_params);
1935 arg = get_call_arg(call, 0, nr);
1936 param_type = get_method_param_type(method_type, nr);
1939 repl = pmap_get(env->regs, (void *) arg->reg);
1942 else if(arg->on_stack) {
1943 ir_node *addr = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1945 /* For atomic parameters which are actually used, we create a Load node. */
1946 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1947 ir_mode *mode = get_type_mode(param_type);
1948 ir_node *load = new_rd_Load(NULL, irg, reg_params_bl,
1949 new_NoMem(), addr, mode);
1950 repl = new_rd_Proj(NULL, irg, reg_params_bl, load,
1954 /* The stack parameter is not primitive (it is a struct or array),
1955 we thus will create a node representing the parameter's address
1962 assert(repl != NULL);
1964 /* Beware: the mode of the register parameters is always the mode of the register class
1965 which may be wrong. Add Conv's then. */
1966 mode = get_irn_mode(args[i]);
1967 if (mode != get_irn_mode(repl)) {
1968 repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
1970 exchange(args[i], repl);
1974 /* the arg proj is not needed anymore now and should be only used by the anchor */
1975 assert(get_irn_n_edges(arg_tuple) == 1);
1976 be_kill_node(arg_tuple);
1977 set_irg_args(irg, new_rd_Bad(irg));
1979 /* All Return nodes hang on the End node, so look for them there. */
1980 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1981 ir_node *irn = get_Block_cfgpred(end, i);
1983 if (is_Return(irn)) {
1984 ir_node *ret = create_be_return(env, irn, get_nodes_block(irn), get_Return_mem(irn), get_Return_n_ress(irn));
1988 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
1989 the code is dead and will never be executed. */
1991 del_pset(dont_save);
1992 obstack_free(&env->obst, args);
1994 /* this was needed for STA backend... */
1996 /* handle start block here (place a jump in the block) */
1998 irg_block_walk_graph(irg, fix_start_block, NULL, &i);
2002 /** Fix the state inputs of calls that still hang on unknowns */
2004 void fix_call_state_inputs(be_abi_irg_t *env)
2006 const arch_isa_t *isa = env->isa;
2008 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
2010 /* Collect caller save registers */
2011 n = arch_isa_get_n_reg_class(isa);
2012 for(i = 0; i < n; ++i) {
2014 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
2015 for(j = 0; j < cls->n_regs; ++j) {
2016 const arch_register_t *reg = arch_register_for_index(cls, j);
2017 if(arch_register_type_is(reg, state)) {
2018 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
2023 n = ARR_LEN(env->calls);
2024 n_states = ARR_LEN(stateregs);
2025 for(i = 0; i < n; ++i) {
2027 ir_node *call = env->calls[i];
2029 arity = get_irn_arity(call);
2031 /* the statereg inputs are the last n inputs of the calls */
2032 for(s = 0; s < n_states; ++s) {
2033 int inp = arity - n_states + s;
2034 const arch_register_t *reg = stateregs[s];
2035 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
2037 set_irn_n(call, inp, regnode);
2042 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2044 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
2045 ir_node *old_frame = get_irg_frame(birg->irg);
2046 ir_graph *irg = birg->irg;
2050 optimization_state_t state;
2051 unsigned *limited_bitset;
2053 be_omit_fp = birg->main_env->options->omit_fp;
2055 obstack_init(&env->obst);
2057 env->isa = birg->main_env->arch_env->isa;
2058 env->method_type = get_entity_type(get_irg_entity(irg));
2059 env->call = be_abi_call_new(env->isa->sp->reg_class);
2060 arch_isa_get_call_abi(env->isa, env->method_type, env->call);
2062 env->ignore_regs = pset_new_ptr_default();
2063 env->keep_map = pmap_create();
2064 env->dce_survivor = new_survive_dce();
2067 env->sp_req.type = arch_register_req_type_limited;
2068 env->sp_req.cls = arch_register_get_class(env->isa->sp);
2069 limited_bitset = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
2070 rbitset_set(limited_bitset, arch_register_get_index(env->isa->sp));
2071 env->sp_req.limited = limited_bitset;
2073 env->sp_cls_req.type = arch_register_req_type_normal;
2074 env->sp_cls_req.cls = arch_register_get_class(env->isa->sp);
2076 /* Beware: later we replace this node by the real one, ensure it is not CSE'd
2077 to another Unknown or the stack pointer gets used */
2078 save_optimization_state(&state);
2080 env->init_sp = dummy = new_r_Unknown(irg, env->isa->sp->reg_class->mode);
2081 restore_optimization_state(&state);
2082 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
2084 env->calls = NEW_ARR_F(ir_node*, 0);
2086 /* Lower all call nodes in the IRG. */
2090 Beware: init backend abi call object after processing calls,
2091 otherwise some information might be not yet available.
2093 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2095 /* Process the IRG */
2098 /* fix call inputs for state registers */
2099 fix_call_state_inputs(env);
2101 /* We don't need the keep map anymore. */
2102 pmap_destroy(env->keep_map);
2104 /* calls array is not needed anymore */
2105 DEL_ARR_F(env->calls);
2107 /* reroute the stack origin of the calls to the true stack origin. */
2108 exchange(dummy, env->init_sp);
2109 exchange(old_frame, get_irg_frame(irg));
2111 /* Make some important node pointers survive the dead node elimination. */
2112 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2113 pmap_foreach(env->regs, ent) {
2114 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2117 env->call->cb->done(env->cb);
2122 void be_abi_free(be_abi_irg_t *env)
2124 be_abi_call_free(env->call);
2125 free_survive_dce(env->dce_survivor);
2126 del_pset(env->ignore_regs);
2127 pmap_destroy(env->regs);
2128 obstack_free(&env->obst, NULL);
2132 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2134 arch_register_t *reg;
2136 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2137 if(reg->reg_class == cls)
2138 bitset_set(bs, reg->index);
2141 /* Returns the stack layout from a abi environment. */
2142 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi) {
2149 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2150 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2151 | _| | |> < ___) | || (_| | (__| <
2152 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2156 typedef ir_node **node_array;
2158 typedef struct fix_stack_walker_env_t {
2159 node_array sp_nodes;
2160 const arch_env_t *arch_env;
2161 } fix_stack_walker_env_t;
2164 * Walker. Collect all stack modifying nodes.
2166 static void collect_stack_nodes_walker(ir_node *node, void *data)
2168 fix_stack_walker_env_t *env = data;
2170 if (arch_irn_is(env->arch_env, node, modify_sp)) {
2171 assert(get_irn_mode(node) != mode_M && get_irn_mode(node) != mode_T);
2172 ARR_APP1(ir_node*, env->sp_nodes, node);
2176 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2178 be_ssa_construction_env_t senv;
2181 be_irg_t *birg = env->birg;
2182 be_lv_t *lv = be_get_birg_liveness(birg);
2183 fix_stack_walker_env_t walker_env;
2186 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2187 walker_env.arch_env = birg->main_env->arch_env;
2188 isa = walker_env.arch_env->isa;
2190 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2192 /* nothing to be done if we didn't find any node, in fact we mustn't
2193 * continue, as for endless loops incsp might have had no users and is bad
2196 len = ARR_LEN(walker_env.sp_nodes);
2198 DEL_ARR_F(walker_env.sp_nodes);
2202 be_ssa_construction_init(&senv, birg);
2203 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2204 ARR_LEN(walker_env.sp_nodes));
2205 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2206 ARR_LEN(walker_env.sp_nodes));
2209 len = ARR_LEN(walker_env.sp_nodes);
2210 for(i = 0; i < len; ++i) {
2211 be_liveness_update(lv, walker_env.sp_nodes[i]);
2213 be_ssa_construction_update_liveness_phis(&senv, lv);
2216 phis = be_ssa_construction_get_new_phis(&senv);
2218 /* set register requirements for stack phis */
2219 len = ARR_LEN(phis);
2220 for(i = 0; i < len; ++i) {
2221 ir_node *phi = phis[i];
2222 be_set_phi_reg_req(walker_env.arch_env, phi, &env->sp_req);
2223 be_set_phi_flags(walker_env.arch_env, phi, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
2224 arch_set_irn_register(walker_env.arch_env, phi, env->isa->sp);
2226 be_ssa_construction_destroy(&senv);
2228 DEL_ARR_F(walker_env.sp_nodes);
2231 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
2233 const arch_env_t *arch_env = env->birg->main_env->arch_env;
2234 int omit_fp = env->call->flags.bits.try_omit_fp;
2237 sched_foreach(bl, irn) {
2241 Check, if the node relates to an entity on the stack frame.
2242 If so, set the true offset (including the bias) for that
2245 ir_entity *ent = arch_get_frame_entity(arch_env, irn);
2247 int offset = get_stack_entity_offset(env->frame, ent, bias);
2248 arch_set_frame_offset(arch_env, irn, offset);
2249 DBG((env->dbg, LEVEL_2, "%F has offset %d (including bias %d)\n", ent, offset, bias));
2252 if(omit_fp || be_is_IncSP(irn)) {
2254 * If the node modifies the stack pointer by a constant offset,
2255 * record that in the bias.
2257 ofs = arch_get_sp_bias(arch_env, irn);
2259 if(be_is_IncSP(irn)) {
2260 if(ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2261 ofs = get_type_size_bytes(get_irg_frame_type(env->birg->irg));
2262 be_set_IncSP_offset(irn, ofs);
2263 } else if(ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2264 ofs = - get_type_size_bytes(get_irg_frame_type(env->birg->irg));
2265 be_set_IncSP_offset(irn, ofs);
2278 * A helper struct for the bias walker.
2281 be_abi_irg_t *env; /**< The ABI irg environment. */
2282 int start_block_bias; /**< The bias at the end of the start block. */
2283 ir_node *start_block; /**< The start block of the current graph. */
2287 * Block-Walker: fix all stack offsets
2289 static void stack_bias_walker(ir_node *bl, void *data)
2291 struct bias_walk *bw = data;
2292 if (bl != bw->start_block) {
2293 process_stack_bias(bw->env, bl, bw->start_block_bias);
2297 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2299 ir_graph *irg = env->birg->irg;
2300 struct bias_walk bw;
2302 stack_frame_compute_initial_offset(env->frame);
2303 // stack_layout_dump(stdout, env->frame);
2305 /* Determine the stack bias at the end of the start block. */
2306 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0);
2308 /* fix the bias is all other blocks */
2310 bw.start_block = get_irg_start_block(irg);
2311 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2314 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2316 assert(arch_register_type_is(reg, callee_save));
2317 assert(pmap_contains(abi->regs, (void *) reg));
2318 return pmap_get(abi->regs, (void *) reg);
2321 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2323 assert(arch_register_type_is(reg, ignore));
2324 assert(pmap_contains(abi->regs, (void *) reg));
2325 return pmap_get(abi->regs, (void *) reg);
2328 ir_node *be_abi_get_start_barrier(be_abi_irg_t *abi)
2330 return abi->start_barrier;
2334 * Returns non-zero if the ABI has omitted the frame pointer in
2335 * the current graph.
2337 int be_abi_omit_fp(const be_abi_irg_t *abi) {
2338 return abi->call->flags.bits.try_omit_fp;