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 res_projs[proj] = res;
617 /** TODO: this is not correct for cases where return values are passed
618 * on the stack, but no known ABI does this currentl...
620 n_reg_results = n_res;
622 /* make the back end call node and set its register requirements. */
623 for (i = 0; i < n_reg_params; ++i) {
624 obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
626 foreach_pset(states, reg) {
627 const arch_register_class_t *cls = arch_register_get_class(reg);
629 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
630 ir_fprintf(stderr, "Adding %+F\n", regnode);
632 ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
633 obstack_ptr_grow(obst, regnode);
635 n_ins = n_reg_params + pset_count(states);
637 in = obstack_finish(obst);
639 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
641 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
643 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
644 n_ins, in, get_Call_type(irn));
645 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
648 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
650 n_reg_results + pn_be_Call_first_res + pset_count(caller_save),
651 n_ins, in, get_Call_type(irn));
653 ARR_APP1(ir_node *, env->calls, low_call);
655 for(i = 0; i < n_res; ++i) {
657 ir_node *proj = res_projs[i];
658 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
661 shift the proj number to the right, since we will drop the
662 unspeakable Proj_T from the Call. Therefore, all real argument
663 Proj numbers must be increased by pn_be_Call_first_res
665 pn = i + pn_be_Call_first_res;
668 ir_type *res_type = get_method_res_type(mt, i);
669 ir_mode *mode = get_type_mode(res_type);
670 proj = new_r_Proj(irg, bl, low_call, mode, pn);
673 set_Proj_pred(proj, low_call);
674 set_Proj_proj(proj, pn);
678 pset_remove_ptr(caller_save, arg->reg);
683 Set the register class of the call address to
684 the backend provided class (default: stack pointer class)
686 be_node_set_reg_class(low_call, be_pos_Call_ptr, call->cls_addr);
688 DBG((env->dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
690 /* Set the register classes and constraints of the Call parameters. */
691 for (i = 0; i < n_reg_params; ++i) {
692 int index = reg_param_idxs[i];
693 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
694 assert(arg->reg != NULL);
696 be_set_constr_single_reg(low_call, be_pos_Call_first_arg + i, arg->reg);
699 /* Set the register constraints of the results. */
700 for (i = 0; i < n_res; ++i) {
701 ir_node *proj = res_projs[i];
702 const be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
703 int pn = get_Proj_proj(proj);
706 be_set_constr_single_reg(low_call, BE_OUT_POS(pn), arg->reg);
707 arch_set_irn_register(arch_env, proj, arg->reg);
709 obstack_free(obst, in);
710 exchange(irn, low_call);
712 /* kill the ProjT node */
713 if (res_proj != NULL) {
714 be_kill_node(res_proj);
717 /* Make additional projs for the caller save registers
718 and the Keep node which keeps them alive. */
719 if (pset_count(caller_save) + n_reg_results > 0) {
720 const arch_register_t *reg;
724 = pn_be_Call_first_res + n_reg_results;
726 for (reg = pset_first(caller_save), n = 0; reg; reg = pset_next(caller_save), ++n) {
727 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode,
730 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
731 be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg);
732 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
734 /* a call can produce ignore registers, in this case set the flag and register for the Proj */
735 if (arch_register_type_is(reg, ignore)) {
736 be_node_set_flags(low_call, BE_OUT_POS(curr_res_proj),
737 arch_irn_flags_ignore);
740 set_irn_link(proj, (void*) reg);
741 obstack_ptr_grow(obst, proj);
745 for(i = 0; i < n_reg_results; ++i) {
746 ir_node *proj = res_projs[i];
747 const arch_register_t *reg = arch_get_irn_register(arch_env, proj);
748 set_irn_link(proj, (void*) reg);
749 obstack_ptr_grow(obst, proj);
753 /* create the Keep for the caller save registers */
754 in = (ir_node **) obstack_finish(obst);
755 keep = be_new_Keep(NULL, irg, bl, n, in);
756 for (i = 0; i < n; ++i) {
757 const arch_register_t *reg = get_irn_link(in[i]);
758 be_node_set_reg_class(keep, i, reg->reg_class);
760 obstack_free(obst, in);
763 /* Clean up the stack. */
764 if (stack_size > 0) {
765 ir_node *mem_proj = NULL;
767 foreach_out_edge(low_call, edge) {
768 ir_node *irn = get_edge_src_irn(edge);
769 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
776 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_Call_M);
777 keep_alive(mem_proj);
780 /* Clean up the stack frame if we allocated it */
782 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size);
783 add_irn_dep(curr_sp, mem_proj);
787 be_abi_call_free(call);
788 obstack_free(obst, stack_param_idx);
791 del_pset(caller_save);
797 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
799 * @param alignment the minimum stack alignment
800 * @param size the node containing the non-aligned size
801 * @param irg the irg where new nodes are allocated on
802 * @param irg the block where new nodes are allocated on
803 * @param dbg debug info for new nodes
805 * @return a node representing the aligned size
807 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size,
808 ir_graph *irg, ir_node *block, dbg_info *dbg)
810 if (stack_alignment > 1) {
811 ir_mode *mode = get_irn_mode(size);
812 tarval *tv = new_tarval_from_long(stack_alignment-1, mode);
813 ir_node *mask = new_r_Const(irg, block, mode, tv);
815 size = new_rd_Add(dbg, irg, block, size, mask, mode);
817 tv = new_tarval_from_long(-(long)stack_alignment, mode);
818 mask = new_r_Const(irg, block, mode, tv);
819 size = new_rd_And(dbg, irg, block, size, mask, mode);
825 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
827 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
836 const ir_edge_t *edge;
837 ir_node *new_alloc, *size, *addr, *ins[2];
838 unsigned stack_alignment;
840 if (get_Alloc_where(alloc) != stack_alloc) {
845 block = get_nodes_block(alloc);
846 irg = get_irn_irg(block);
849 type = get_Alloc_type(alloc);
851 foreach_out_edge(alloc, edge) {
852 ir_node *irn = get_edge_src_irn(edge);
854 assert(is_Proj(irn));
855 switch(get_Proj_proj(irn)) {
867 /* Beware: currently Alloc nodes without a result might happen,
868 only escape analysis kills them and this phase runs only for object
869 oriented source. We kill the Alloc here. */
870 if (alloc_res == NULL && alloc_mem) {
871 exchange(alloc_mem, get_Alloc_mem(alloc));
875 dbg = get_irn_dbg_info(alloc);
877 /* we might need to multiply the size with the element size */
878 if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
879 tarval *tv = new_tarval_from_long(get_type_size_bytes(type),
881 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
882 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Alloc_size(alloc),
886 size = get_Alloc_size(alloc);
889 /* The stack pointer will be modified in an unknown manner.
890 We cannot omit it. */
891 env->call->flags.bits.try_omit_fp = 0;
893 /* FIXME: size must be here round up for the stack alignment, but
894 this must be transmitted from the backend. */
896 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
897 new_alloc = be_new_AddSP(env->isa->sp, irg, block, curr_sp, size);
898 set_irn_dbg_info(new_alloc, dbg);
900 if(alloc_mem != NULL) {
904 addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
906 /* We need to sync the output mem of the AddSP with the input mem
907 edge into the alloc node. */
908 ins[0] = get_Alloc_mem(alloc);
910 sync = new_r_Sync(irg, block, 2, ins);
912 exchange(alloc_mem, sync);
915 exchange(alloc, new_alloc);
917 /* fix projnum of alloca res */
918 set_Proj_proj(alloc_res, pn_be_AddSP_res);
921 curr_sp = new_r_Proj(irg, block, new_alloc, get_irn_mode(curr_sp),
929 * The Free is transformed into a back end free node and connected to the stack nodes.
931 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
935 ir_node *subsp, *mem, *res, *size, *sync;
939 unsigned stack_alignment;
942 if (get_Free_where(free) != stack_alloc) {
947 block = get_nodes_block(free);
948 irg = get_irn_irg(block);
949 type = get_Free_type(free);
950 sp_mode = env->isa->sp->reg_class->mode;
951 dbg = get_irn_dbg_info(free);
953 /* we might need to multiply the size with the element size */
954 if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
955 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
956 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
957 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
961 size = get_Free_size(free);
964 /* FIXME: size must be here round up for the stack alignment, but
965 this must be transmitted from the backend. */
967 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
969 /* The stack pointer will be modified in an unknown manner.
970 We cannot omit it. */
971 env->call->flags.bits.try_omit_fp = 0;
972 subsp = be_new_SubSP(env->isa->sp, irg, block, curr_sp, size);
973 set_irn_dbg_info(subsp, dbg);
975 mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
976 res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_sp);
978 /* we need to sync the memory */
979 in[0] = get_Free_mem(free);
981 sync = new_r_Sync(irg, block, 2, in);
983 /* and make the AddSP dependent on the former memory */
984 add_irn_dep(subsp, get_Free_mem(free));
987 exchange(free, sync);
993 /* the following function is replaced by the usage of the heights module */
996 * Walker for dependent_on().
997 * This function searches a node tgt recursively from a given node
998 * but is restricted to the given block.
999 * @return 1 if tgt was reachable from curr, 0 if not.
1001 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl)
1005 if (get_nodes_block(curr) != bl)
1011 /* Phi functions stop the recursion inside a basic block */
1012 if (! is_Phi(curr)) {
1013 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
1014 if (check_dependence(get_irn_n(curr, i), tgt, bl))
1024 * Check if a node is somehow data dependent on another one.
1025 * both nodes must be in the same basic block.
1026 * @param n1 The first node.
1027 * @param n2 The second node.
1028 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1030 static int dependent_on(ir_node *n1, ir_node *n2)
1032 assert(get_nodes_block(n1) == get_nodes_block(n2));
1034 return heights_reachable_in_block(ir_heights, n1, n2);
1037 static int cmp_call_dependency(const void *c1, const void *c2)
1039 ir_node *n1 = *(ir_node **) c1;
1040 ir_node *n2 = *(ir_node **) c2;
1043 Classical qsort() comparison function behavior:
1044 0 if both elements are equal
1045 1 if second is "smaller" that first
1046 -1 if first is "smaller" that second
1048 if (dependent_on(n1, n2))
1051 if (dependent_on(n2, n1))
1058 * Walker: links all Call/alloc/Free nodes to the Block they are contained.
1060 static void link_calls_in_block_walker(ir_node *irn, void *data)
1062 ir_opcode code = get_irn_opcode(irn);
1064 if (code == iro_Call ||
1065 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1066 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1067 be_abi_irg_t *env = data;
1068 ir_node *bl = get_nodes_block(irn);
1069 void *save = get_irn_link(bl);
1071 if (code == iro_Call)
1072 env->call->flags.bits.irg_is_leaf = 0;
1074 set_irn_link(irn, save);
1075 set_irn_link(bl, irn);
1081 * Process all Call nodes inside a basic block.
1082 * Note that the link field of the block must contain a linked list of all
1083 * Call nodes inside the Block. We first order this list according to data dependency
1084 * and that connect the calls together.
1086 static void process_calls_in_block(ir_node *bl, void *data)
1088 be_abi_irg_t *env = data;
1089 ir_node *curr_sp = env->init_sp;
1093 for(irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
1094 obstack_ptr_grow(&env->obst, irn);
1096 /* If there were call nodes in the block. */
1102 nodes = obstack_finish(&env->obst);
1104 /* order the call nodes according to data dependency */
1105 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
1107 for(i = n - 1; i >= 0; --i) {
1108 ir_node *irn = nodes[i];
1110 DBG((env->dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1111 switch(get_irn_opcode(irn)) {
1113 curr_sp = adjust_call(env, irn, curr_sp);
1116 curr_sp = adjust_alloc(env, irn, curr_sp);
1119 curr_sp = adjust_free(env, irn, curr_sp);
1122 panic("invalid call");
1127 obstack_free(&env->obst, nodes);
1129 /* Keep the last stack state in the block by tying it to Keep node */
1130 if(curr_sp != env->init_sp) {
1132 keep = be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl),
1134 pmap_insert(env->keep_map, bl, keep);
1138 set_irn_link(bl, curr_sp);
1139 } /* process_calls_in_block */
1142 * Adjust all call nodes in the graph to the ABI conventions.
1144 static void process_calls(be_abi_irg_t *env)
1146 ir_graph *irg = env->birg->irg;
1148 env->call->flags.bits.irg_is_leaf = 1;
1149 irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, env);
1151 ir_heights = heights_new(env->birg->irg);
1152 irg_block_walk_graph(irg, NULL, process_calls_in_block, env);
1153 heights_free(ir_heights);
1157 static ir_node *setup_frame(be_abi_irg_t *env)
1159 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1160 const arch_register_t *sp = isa->sp;
1161 const arch_register_t *bp = isa->bp;
1162 be_abi_call_flags_bits_t flags = env->call->flags.bits;
1163 ir_graph *irg = env->birg->irg;
1164 ir_node *bl = get_irg_start_block(irg);
1165 ir_node *no_mem = get_irg_no_mem(irg);
1166 ir_node *old_frame = get_irg_frame(irg);
1167 ir_node *stack = pmap_get(env->regs, (void *) sp);
1168 ir_node *frame = pmap_get(env->regs, (void *) bp);
1170 int stack_nr = get_Proj_proj(stack);
1172 if(flags.try_omit_fp) {
1173 stack = be_new_IncSP(sp, irg, bl, stack, no_mem, BE_STACK_FRAME_SIZE_EXPAND);
1178 frame = be_new_Copy(bp->reg_class, irg, bl, stack);
1180 be_node_set_flags(frame, -1, arch_irn_flags_dont_spill);
1181 if(!flags.fp_free) {
1182 be_set_constr_single_reg(frame, -1, bp);
1183 be_node_set_flags(frame, -1, arch_irn_flags_ignore);
1184 arch_set_irn_register(env->birg->main_env->arch_env, frame, bp);
1187 stack = be_new_IncSP(sp, irg, bl, stack, frame, BE_STACK_FRAME_SIZE_EXPAND);
1190 be_node_set_flags(env->reg_params, -(stack_nr + 1), arch_irn_flags_ignore);
1191 env->init_sp = stack;
1192 set_irg_frame(irg, frame);
1193 edges_reroute(old_frame, frame, irg);
1198 static void clearup_frame(be_abi_irg_t *env, ir_node *ret, pmap *reg_map, struct obstack *obst)
1200 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1201 const arch_register_t *sp = isa->sp;
1202 const arch_register_t *bp = isa->bp;
1203 ir_graph *irg = env->birg->irg;
1204 ir_node *ret_mem = get_Return_mem(ret);
1205 ir_node *frame = get_irg_frame(irg);
1206 ir_node *bl = get_nodes_block(ret);
1207 ir_node *stack = get_irn_link(bl);
1211 if(env->call->flags.bits.try_omit_fp) {
1212 stack = be_new_IncSP(sp, irg, bl, stack, ret_mem, -BE_STACK_FRAME_SIZE_SHRINK);
1216 stack = be_new_SetSP(sp, irg, bl, stack, frame, ret_mem);
1217 be_set_constr_single_reg(stack, -1, sp);
1218 be_node_set_flags(stack, -1, arch_irn_flags_ignore);
1221 pmap_foreach(env->regs, ent) {
1222 const arch_register_t *reg = ent->key;
1223 ir_node *irn = ent->value;
1226 obstack_ptr_grow(&env->obst, stack);
1228 obstack_ptr_grow(&env->obst, frame);
1229 else if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1230 obstack_ptr_grow(obst, irn);
1237 * Computes the stack argument layout type.
1238 * Changes a possibly allocated value param type by moving
1239 * entities to the stack layout type.
1241 * @param env the ABI environment
1242 * @param call the current call ABI
1243 * @param method_type the method type
1244 * @param param_map an array mapping method arguments to the stack layout type
1246 * @return the stack argument layout type
1248 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type, ir_entity ***param_map)
1250 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1251 int inc = env->birg->main_env->arch_env->isa->stack_dir * dir;
1252 int n = get_method_n_params(method_type);
1253 int curr = inc > 0 ? 0 : n - 1;
1259 ir_type *val_param_tp = get_method_value_param_type(method_type);
1260 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1263 *param_map = map = obstack_alloc(&env->obst, n * sizeof(ir_entity *));
1264 res = new_type_struct(mangle_u(id, new_id_from_chars("arg_type", 8)));
1265 for (i = 0; i < n; ++i, curr += inc) {
1266 ir_type *param_type = get_method_param_type(method_type, curr);
1267 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1270 if (arg->on_stack) {
1272 /* the entity was already created, move it to the param type */
1273 arg->stack_ent = get_method_value_param_ent(method_type, i);
1274 remove_struct_member(val_param_tp, arg->stack_ent);
1275 set_entity_owner(arg->stack_ent, res);
1276 add_struct_member(res, arg->stack_ent);
1277 /* must be automatic to set a fixed layout */
1278 set_entity_allocation(arg->stack_ent, allocation_automatic);
1281 snprintf(buf, sizeof(buf), "param_%d", i);
1282 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1284 ofs += arg->space_before;
1285 ofs = round_up2(ofs, arg->alignment);
1286 set_entity_offset(arg->stack_ent, ofs);
1287 ofs += arg->space_after;
1288 ofs += get_type_size_bytes(param_type);
1289 map[i] = arg->stack_ent;
1292 set_type_size_bytes(res, ofs);
1293 set_type_state(res, layout_fixed);
1298 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
1301 struct obstack obst;
1303 obstack_init(&obst);
1305 /* Create a Perm after the RegParams node to delimit it. */
1306 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1307 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1312 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
1313 const arch_register_t *reg = &cls->regs[j];
1314 ir_node *irn = pmap_get(regs, (void *) reg);
1316 if(irn && !arch_register_type_is(reg, ignore)) {
1318 obstack_ptr_grow(&obst, irn);
1319 set_irn_link(irn, (void *) reg);
1323 obstack_ptr_grow(&obst, NULL);
1324 in = obstack_finish(&obst);
1326 perm = be_new_Perm(cls, irg, bl, n_regs, in);
1327 for(j = 0; j < n_regs; ++j) {
1328 ir_node *arg = in[j];
1329 arch_register_t *reg = get_irn_link(arg);
1330 pmap_insert(regs, reg, arg);
1331 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
1334 obstack_free(&obst, in);
1337 obstack_free(&obst, NULL);
1342 const arch_register_t *reg;
1346 static int cmp_regs(const void *a, const void *b)
1348 const reg_node_map_t *p = a;
1349 const reg_node_map_t *q = b;
1351 if(p->reg->reg_class == q->reg->reg_class)
1352 return p->reg->index - q->reg->index;
1354 return p->reg->reg_class - q->reg->reg_class;
1357 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1360 int n = pmap_count(reg_map);
1362 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1364 pmap_foreach(reg_map, ent) {
1365 res[i].reg = ent->key;
1366 res[i].irn = ent->value;
1370 qsort(res, n, sizeof(res[0]), cmp_regs);
1375 * Creates a barrier.
1377 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1379 ir_graph *irg = env->birg->irg;
1380 int n_regs = pmap_count(regs);
1386 rm = reg_map_to_arr(&env->obst, regs);
1388 for(n = 0; n < n_regs; ++n)
1389 obstack_ptr_grow(&env->obst, rm[n].irn);
1392 obstack_ptr_grow(&env->obst, *mem);
1396 in = (ir_node **) obstack_finish(&env->obst);
1397 irn = be_new_Barrier(irg, bl, n, in);
1398 obstack_free(&env->obst, in);
1400 for(n = 0; n < n_regs; ++n) {
1401 const arch_register_t *reg = rm[n].reg;
1403 int pos = BE_OUT_POS(n);
1406 proj = new_r_Proj(irg, bl, irn, get_irn_mode(rm[n].irn), n);
1407 be_node_set_reg_class(irn, n, reg->reg_class);
1409 be_set_constr_single_reg(irn, n, reg);
1410 be_set_constr_single_reg(irn, pos, reg);
1411 be_node_set_reg_class(irn, pos, reg->reg_class);
1412 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1414 /* if the proj projects a ignore register or a node which is set to ignore, propagate this property. */
1415 if(arch_register_type_is(reg, ignore) || arch_irn_is(env->birg->main_env->arch_env, in[n], ignore))
1416 flags |= arch_irn_flags_ignore;
1418 if(arch_irn_is(env->birg->main_env->arch_env, in[n], modify_sp))
1419 flags |= arch_irn_flags_modify_sp;
1421 be_node_set_flags(irn, pos, flags);
1423 pmap_insert(regs, (void *) reg, proj);
1427 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1430 obstack_free(&env->obst, rm);
1435 * Creates a be_Return for a Return node.
1437 * @param @env the abi environment
1438 * @param irn the Return node or NULL if there was none
1439 * @param bl the block where the be_Retun should be placed
1440 * @param mem the current memory
1441 * @param n_res number of return results
1443 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, ir_node *mem, int n_res) {
1444 be_abi_call_t *call = env->call;
1445 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1447 pmap *reg_map = pmap_create();
1448 ir_node *keep = pmap_get(env->keep_map, bl);
1454 const arch_register_t **regs;
1458 get the valid stack node in this block.
1459 If we had a call in that block there is a Keep constructed by process_calls()
1460 which points to the last stack modification in that block. we'll use
1461 it then. Else we use the stack from the start block and let
1462 the ssa construction fix the usage.
1464 stack = be_abi_reg_map_get(env->regs, isa->sp);
1466 stack = get_irn_n(keep, 0);
1468 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1471 /* Insert results for Return into the register map. */
1472 for(i = 0; i < n_res; ++i) {
1473 ir_node *res = get_Return_res(irn, i);
1474 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1475 assert(arg->in_reg && "return value must be passed in register");
1476 pmap_insert(reg_map, (void *) arg->reg, res);
1479 /* Add uses of the callee save registers. */
1480 pmap_foreach(env->regs, ent) {
1481 const arch_register_t *reg = ent->key;
1482 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1483 pmap_insert(reg_map, ent->key, ent->value);
1486 be_abi_reg_map_set(reg_map, isa->sp, stack);
1488 /* Make the Epilogue node and call the arch's epilogue maker. */
1489 create_barrier(env, bl, &mem, reg_map, 1);
1490 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1493 Maximum size of the in array for Return nodes is
1494 return args + callee save/ignore registers + memory + stack pointer
1496 in_max = pmap_count(reg_map) + n_res + 2;
1498 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1499 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1502 in[1] = be_abi_reg_map_get(reg_map, isa->sp);
1507 /* clear SP entry, since it has already been grown. */
1508 pmap_insert(reg_map, (void *) isa->sp, NULL);
1509 for(i = 0; i < n_res; ++i) {
1510 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1512 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1513 regs[n++] = arg->reg;
1515 /* Clear the map entry to mark the register as processed. */
1516 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1519 /* grow the rest of the stuff. */
1520 pmap_foreach(reg_map, ent) {
1523 regs[n++] = ent->key;
1527 /* The in array for the new back end return is now ready. */
1528 ret = be_new_Return(irn ? get_irn_dbg_info(irn) : NULL, env->birg->irg, bl, n_res, n, in);
1530 /* Set the register classes of the return's parameter accordingly. */
1531 for(i = 0; i < n; ++i)
1533 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1535 /* Free the space of the Epilog's in array and the register <-> proj map. */
1536 obstack_free(&env->obst, in);
1537 pmap_destroy(reg_map);
1542 typedef struct lower_frame_sels_env_t {
1544 ir_entity *value_param_list; /**< the list of all value param entities */
1545 ir_entity *value_param_tail; /**< the tail of the list of all value param entities */
1546 } lower_frame_sels_env_t;
1549 * Walker: Replaces Sels of frame type and
1550 * value param type entities by FrameAddress.
1551 * Links all used entities.
1553 static void lower_frame_sels_walker(ir_node *irn, void *data) {
1554 lower_frame_sels_env_t *ctx = data;
1557 ir_graph *irg = current_ir_graph;
1558 ir_node *frame = get_irg_frame(irg);
1559 ir_node *param_base = get_irg_value_param_base(irg);
1560 ir_node *ptr = get_Sel_ptr(irn);
1562 if (ptr == frame || ptr == param_base) {
1563 be_abi_irg_t *env = ctx->env;
1564 ir_entity *ent = get_Sel_entity(irn);
1565 ir_node *bl = get_nodes_block(irn);
1568 nw = be_new_FrameAddr(env->isa->sp->reg_class, irg, bl, frame, ent);
1571 /* check, if it's a param sel and if have not seen this entity before */
1572 if (ptr == param_base &&
1573 ent != ctx->value_param_tail &&
1574 get_entity_link(ent) == NULL) {
1575 set_entity_link(ent, ctx->value_param_list);
1576 ctx->value_param_list = ent;
1577 if (ctx->value_param_tail == NULL) ctx->value_param_tail = ent;
1584 * Check if a value parameter is transmitted as a register.
1585 * This might happen if the address of an parameter is taken which is
1586 * transmitted in registers.
1588 * Note that on some architectures this case must be handled specially
1589 * because the place of the backing store is determined by their ABI.
1591 * In the default case we move the entity to the frame type and create
1592 * a backing store into the first block.
1594 static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_entity *value_param_list) {
1595 be_abi_call_t *call = env->call;
1596 ir_graph *irg = env->birg->irg;
1597 ir_entity *ent, *next_ent, *new_list;
1599 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1602 for (ent = value_param_list; ent; ent = next_ent) {
1603 int i = get_struct_member_index(get_entity_owner(ent), ent);
1604 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1606 next_ent = get_entity_link(ent);
1608 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", i));
1609 set_entity_link(ent, new_list);
1614 /* ok, change the graph */
1615 ir_node *start_bl = get_irg_start_block(irg);
1616 ir_node *first_bl = NULL;
1617 ir_node *frame, *imem, *nmem, *store, *mem, *args, *args_bl;
1618 const ir_edge_t *edge;
1619 optimization_state_t state;
1622 foreach_block_succ(start_bl, edge) {
1623 ir_node *succ = get_edge_src_irn(edge);
1624 if (start_bl != succ) {
1630 /* we had already removed critical edges, so the following
1631 assertion should be always true. */
1632 assert(get_Block_n_cfgpreds(first_bl) == 1);
1634 /* now create backing stores */
1635 frame = get_irg_frame(irg);
1636 imem = get_irg_initial_mem(irg);
1638 save_optimization_state(&state);
1640 nmem = new_r_Proj(irg, first_bl, get_irg_start(irg), mode_M, pn_Start_M);
1641 restore_optimization_state(&state);
1643 /* reroute all edges to the new memory source */
1644 edges_reroute(imem, nmem, irg);
1648 args = get_irg_args(irg);
1649 args_bl = get_nodes_block(args);
1650 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1651 int i = get_struct_member_index(get_entity_owner(ent), ent);
1652 ir_type *tp = get_entity_type(ent);
1653 ir_mode *mode = get_type_mode(tp);
1656 /* address for the backing store */
1657 addr = be_new_FrameAddr(env->isa->sp->reg_class, irg, first_bl, frame, ent);
1660 mem = new_r_Proj(irg, first_bl, store, mode_M, pn_Store_M);
1662 /* the backing store itself */
1663 store = new_r_Store(irg, first_bl, mem, addr,
1664 new_r_Proj(irg, args_bl, args, mode, i));
1666 /* the new memory Proj gets the last Proj from store */
1667 set_Proj_pred(nmem, store);
1668 set_Proj_proj(nmem, pn_Store_M);
1670 /* move all entities to the frame type */
1671 frame_tp = get_irg_frame_type(irg);
1672 offset = get_type_size_bytes(frame_tp);
1673 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1674 ir_type *tp = get_entity_type(ent);
1675 int align = get_type_alignment_bytes(tp);
1677 offset += align - 1;
1679 set_entity_owner(ent, frame_tp);
1680 add_class_member(frame_tp, ent);
1681 /* must be automatic to set a fixed layout */
1682 set_entity_allocation(ent, allocation_automatic);
1683 set_entity_offset(ent, offset);
1684 offset += get_type_size_bytes(tp);
1686 set_type_size_bytes(frame_tp, offset);
1691 * The start block has no jump, instead it has an initial exec Proj.
1692 * The backend wants to handle all blocks the same way, so we replace
1693 * the out cfg edge with a real jump.
1695 static void fix_start_block(ir_node *block, void *env) {
1698 ir_node *start_block;
1701 /* we processed the start block, return */
1705 irg = get_irn_irg(block);
1706 start_block = get_irg_start_block(irg);
1708 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1709 ir_node *pred = get_Block_cfgpred(block, i);
1710 ir_node *pred_block = get_nodes_block(pred);
1712 /* ok, we are in the block, having start as cfg predecessor */
1713 if (pred_block == start_block) {
1714 ir_node *jump = new_r_Jmp(irg, pred_block);
1715 set_Block_cfgpred(block, i, jump);
1722 * Modify the irg itself and the frame type.
1724 static void modify_irg(be_abi_irg_t *env)
1726 be_abi_call_t *call = env->call;
1727 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1728 const arch_register_t *sp = arch_isa_sp(isa);
1729 ir_graph *irg = env->birg->irg;
1730 ir_node *bl = get_irg_start_block(irg);
1731 ir_node *end = get_irg_end_block(irg);
1732 ir_node *old_mem = get_irg_initial_mem(irg);
1733 ir_node *new_mem_proj;
1735 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1736 pset *dont_save = pset_new_ptr(8);
1742 const arch_register_t *fp_reg;
1743 ir_node *frame_pointer;
1745 ir_node *reg_params_bl;
1748 ir_node *value_param_base;
1749 const ir_edge_t *edge;
1750 ir_type *arg_type, *bet_type, *tp;
1751 lower_frame_sels_env_t ctx;
1752 ir_entity **param_map;
1754 bitset_t *used_proj_nr;
1755 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1757 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1759 /* set the links of all frame entities to NULL, we use it
1760 to detect if an entity is already linked in the value_param_list */
1761 tp = get_method_value_param_type(method_type);
1763 for (i = get_struct_n_members(tp) - 1; i >= 0; --i)
1764 set_entity_link(get_struct_member(tp, i), NULL);
1767 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1769 ctx.value_param_list = NULL;
1770 ctx.value_param_tail = NULL;
1771 irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
1773 /* value_param_base anchor is not needed anymore now */
1774 value_param_base = get_irg_value_param_base(irg);
1775 be_kill_node(value_param_base);
1776 set_irg_value_param_base(irg, new_r_Bad(irg));
1778 env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0]));
1779 env->regs = pmap_create();
1781 used_proj_nr = bitset_alloca(1024);
1782 n_params = get_method_n_params(method_type);
1783 args = obstack_alloc(&env->obst, n_params * sizeof(args[0]));
1784 memset(args, 0, n_params * sizeof(args[0]));
1786 /* Check if a value parameter is transmitted as a register.
1787 * This might happen if the address of an parameter is taken which is
1788 * transmitted in registers.
1790 * Note that on some architectures this case must be handled specially
1791 * because the place of the backing store is determined by their ABI.
1793 * In the default case we move the entity to the frame type and create
1794 * a backing store into the first block.
1796 fix_address_of_parameter_access(env, ctx.value_param_list);
1798 /* Fill the argument vector */
1799 arg_tuple = get_irg_args(irg);
1800 foreach_out_edge(arg_tuple, edge) {
1801 ir_node *irn = get_edge_src_irn(edge);
1802 if (! is_Anchor(irn)) {
1803 int nr = get_Proj_proj(irn);
1805 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1809 arg_type = compute_arg_type(env, call, method_type, ¶m_map);
1810 bet_type = call->cb->get_between_type(env->cb);
1811 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), isa->stack_dir, param_map);
1813 /* Count the register params and add them to the number of Projs for the RegParams node */
1814 for(i = 0; i < n_params; ++i) {
1815 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1816 if(arg->in_reg && args[i]) {
1817 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1818 assert(i == get_Proj_proj(args[i]));
1820 /* For now, associate the register with the old Proj from Start representing that argument. */
1821 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1822 bitset_set(used_proj_nr, i);
1823 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1827 /* Collect all callee-save registers */
1828 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1829 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1830 for(j = 0; j < cls->n_regs; ++j) {
1831 const arch_register_t *reg = &cls->regs[j];
1832 if(arch_register_type_is(reg, callee_save) ||
1833 arch_register_type_is(reg, state)) {
1834 pmap_insert(env->regs, (void *) reg, NULL);
1839 pmap_insert(env->regs, (void *) sp, NULL);
1840 pmap_insert(env->regs, (void *) isa->bp, NULL);
1841 reg_params_bl = get_irg_start_block(irg);
1842 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1843 add_irn_dep(env->reg_params, get_irg_start(irg));
1846 * make proj nodes for the callee save registers.
1847 * memorize them, since Return nodes get those as inputs.
1849 * Note, that if a register corresponds to an argument, the regs map contains
1850 * the old Proj from start for that argument.
1853 rm = reg_map_to_arr(&env->obst, env->regs);
1854 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1855 arch_register_t *reg = (void *) rm[i].reg;
1856 ir_mode *mode = reg->reg_class->mode;
1858 int pos = BE_OUT_POS((int) nr);
1864 bitset_set(used_proj_nr, nr);
1865 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1866 pmap_insert(env->regs, (void *) reg, proj);
1867 be_set_constr_single_reg(env->reg_params, pos, reg);
1868 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1871 * If the register is an ignore register,
1872 * The Proj for that register shall also be ignored during register allocation.
1874 if(arch_register_type_is(reg, ignore))
1875 flags |= arch_irn_flags_ignore;
1878 flags |= arch_irn_flags_modify_sp;
1880 be_node_set_flags(env->reg_params, pos, flags);
1882 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1884 obstack_free(&env->obst, rm);
1886 /* create a new initial memory proj */
1887 assert(is_Proj(old_mem));
1888 new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
1889 new_r_Unknown(irg, mode_T), mode_M,
1890 get_Proj_proj(old_mem));
1893 /* Generate the Prologue */
1894 fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
1896 /* do the stack allocation BEFORE the barrier, or spill code
1897 might be added before it */
1898 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1899 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND);
1900 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1902 env->start_barrier = barrier = create_barrier(env, bl, &mem, env->regs, 0);
1904 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1905 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1907 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1908 set_irg_frame(irg, frame_pointer);
1909 pset_insert_ptr(env->ignore_regs, fp_reg);
1911 /* rewire old mem users to new mem */
1912 set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
1913 exchange(old_mem, mem);
1915 set_irg_initial_mem(irg, mem);
1917 /* Now, introduce stack param nodes for all parameters passed on the stack */
1918 for(i = 0; i < n_params; ++i) {
1919 ir_node *arg_proj = args[i];
1920 ir_node *repl = NULL;
1922 if(arg_proj != NULL) {
1923 be_abi_call_arg_t *arg;
1924 ir_type *param_type;
1925 int nr = get_Proj_proj(arg_proj);
1928 nr = MIN(nr, n_params);
1929 arg = get_call_arg(call, 0, nr);
1930 param_type = get_method_param_type(method_type, nr);
1933 repl = pmap_get(env->regs, (void *) arg->reg);
1936 else if(arg->on_stack) {
1937 /* For atomic parameters which are actually used, we create a StackParam node. */
1938 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1939 ir_mode *mode = get_type_mode(param_type);
1940 const arch_register_class_t *cls = arch_isa_get_reg_class_for_mode(isa, mode);
1941 repl = be_new_StackParam(cls, isa->bp->reg_class, irg, reg_params_bl, mode, frame_pointer, arg->stack_ent);
1944 /* The stack parameter is not primitive (it is a struct or array),
1945 we thus will create a node representing the parameter's address
1948 repl = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1952 assert(repl != NULL);
1954 /* Beware: the mode of the register parameters is always the mode of the register class
1955 which may be wrong. Add Conv's then. */
1956 mode = get_irn_mode(args[i]);
1957 if (mode != get_irn_mode(repl)) {
1958 repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
1960 exchange(args[i], repl);
1964 /* the arg proj is not needed anymore now and should be only used by the anchor */
1965 assert(get_irn_n_edges(arg_tuple) == 1);
1966 be_kill_node(arg_tuple);
1967 set_irg_args(irg, new_rd_Bad(irg));
1969 /* All Return nodes hang on the End node, so look for them there. */
1970 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1971 ir_node *irn = get_Block_cfgpred(end, i);
1973 if (is_Return(irn)) {
1974 ir_node *ret = create_be_return(env, irn, get_nodes_block(irn), get_Return_mem(irn), get_Return_n_ress(irn));
1978 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
1979 the code is dead and will never be executed. */
1981 del_pset(dont_save);
1982 obstack_free(&env->obst, args);
1984 /* handle start block here (place a jump in the block) */
1986 irg_block_walk_graph(irg, fix_start_block, NULL, &temp);
1989 /** Fix the state inputs of calls that still hang on unknowns */
1991 void fix_call_state_inputs(be_abi_irg_t *env)
1993 const arch_isa_t *isa = env->isa;
1995 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
1997 /* Collect caller save registers */
1998 n = arch_isa_get_n_reg_class(isa);
1999 for(i = 0; i < n; ++i) {
2001 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
2002 for(j = 0; j < cls->n_regs; ++j) {
2003 const arch_register_t *reg = arch_register_for_index(cls, j);
2004 if(arch_register_type_is(reg, state)) {
2005 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
2010 n = ARR_LEN(env->calls);
2011 n_states = ARR_LEN(stateregs);
2012 for(i = 0; i < n; ++i) {
2014 ir_node *call = env->calls[i];
2016 arity = get_irn_arity(call);
2018 /* the statereg inputs are the last n inputs of the calls */
2019 for(s = 0; s < n_states; ++s) {
2020 int inp = arity - n_states + s;
2021 const arch_register_t *reg = stateregs[s];
2022 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
2024 set_irn_n(call, inp, regnode);
2029 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2031 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
2032 ir_node *old_frame = get_irg_frame(birg->irg);
2033 ir_graph *irg = birg->irg;
2037 optimization_state_t state;
2038 unsigned *limited_bitset;
2040 be_omit_fp = birg->main_env->options->omit_fp;
2042 obstack_init(&env->obst);
2044 env->isa = birg->main_env->arch_env->isa;
2045 env->method_type = get_entity_type(get_irg_entity(irg));
2046 env->call = be_abi_call_new(env->isa->sp->reg_class);
2047 arch_isa_get_call_abi(env->isa, env->method_type, env->call);
2049 env->ignore_regs = pset_new_ptr_default();
2050 env->keep_map = pmap_create();
2051 env->dce_survivor = new_survive_dce();
2054 env->sp_req.type = arch_register_req_type_limited;
2055 env->sp_req.cls = arch_register_get_class(env->isa->sp);
2056 limited_bitset = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
2057 rbitset_set(limited_bitset, arch_register_get_index(env->isa->sp));
2058 env->sp_req.limited = limited_bitset;
2060 env->sp_cls_req.type = arch_register_req_type_normal;
2061 env->sp_cls_req.cls = arch_register_get_class(env->isa->sp);
2063 /* Beware: later we replace this node by the real one, ensure it is not CSE'd
2064 to another Unknown or the stack pointer gets used */
2065 save_optimization_state(&state);
2067 env->init_sp = dummy = new_r_Unknown(irg, env->isa->sp->reg_class->mode);
2068 restore_optimization_state(&state);
2069 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
2071 env->calls = NEW_ARR_F(ir_node*, 0);
2073 /* Lower all call nodes in the IRG. */
2077 Beware: init backend abi call object after processing calls,
2078 otherwise some information might be not yet available.
2080 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2082 /* Process the IRG */
2085 /* fix call inputs for state registers */
2086 fix_call_state_inputs(env);
2088 /* We don't need the keep map anymore. */
2089 pmap_destroy(env->keep_map);
2091 /* calls array is not needed anymore */
2092 DEL_ARR_F(env->calls);
2094 /* reroute the stack origin of the calls to the true stack origin. */
2095 exchange(dummy, env->init_sp);
2096 exchange(old_frame, get_irg_frame(irg));
2098 /* Make some important node pointers survive the dead node elimination. */
2099 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2100 pmap_foreach(env->regs, ent) {
2101 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2104 env->call->cb->done(env->cb);
2109 void be_abi_free(be_abi_irg_t *env)
2111 be_abi_call_free(env->call);
2112 free_survive_dce(env->dce_survivor);
2113 del_pset(env->ignore_regs);
2114 pmap_destroy(env->regs);
2115 obstack_free(&env->obst, NULL);
2119 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2121 arch_register_t *reg;
2123 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2124 if(reg->reg_class == cls)
2125 bitset_set(bs, reg->index);
2128 /* Returns the stack layout from a abi environment. */
2129 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi) {
2136 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2137 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2138 | _| | |> < ___) | || (_| | (__| <
2139 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2143 typedef ir_node **node_array;
2145 typedef struct fix_stack_walker_env_t {
2146 node_array sp_nodes;
2147 const arch_env_t *arch_env;
2148 } fix_stack_walker_env_t;
2151 * Walker. Collect all stack modifying nodes.
2153 static void collect_stack_nodes_walker(ir_node *node, void *data)
2155 fix_stack_walker_env_t *env = data;
2157 if (arch_irn_is(env->arch_env, node, modify_sp)) {
2158 assert(get_irn_mode(node) != mode_M && get_irn_mode(node) != mode_T);
2159 ARR_APP1(ir_node*, env->sp_nodes, node);
2163 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2165 be_ssa_construction_env_t senv;
2168 be_irg_t *birg = env->birg;
2169 be_lv_t *lv = be_get_birg_liveness(birg);
2170 fix_stack_walker_env_t walker_env;
2173 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2174 walker_env.arch_env = birg->main_env->arch_env;
2175 isa = walker_env.arch_env->isa;
2177 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2179 /* nothing to be done if we didn't find any node, in fact we mustn't
2180 * continue, as for endless loops incsp might have had no users and is bad
2183 len = ARR_LEN(walker_env.sp_nodes);
2185 DEL_ARR_F(walker_env.sp_nodes);
2189 be_ssa_construction_init(&senv, birg);
2190 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2191 ARR_LEN(walker_env.sp_nodes));
2192 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2193 ARR_LEN(walker_env.sp_nodes));
2196 len = ARR_LEN(walker_env.sp_nodes);
2197 for(i = 0; i < len; ++i) {
2198 be_liveness_update(lv, walker_env.sp_nodes[i]);
2200 be_ssa_construction_update_liveness_phis(&senv, lv);
2203 phis = be_ssa_construction_get_new_phis(&senv);
2205 /* set register requirements for stack phis */
2206 len = ARR_LEN(phis);
2207 for(i = 0; i < len; ++i) {
2208 ir_node *phi = phis[i];
2209 be_set_phi_reg_req(walker_env.arch_env, phi, &env->sp_req);
2210 be_set_phi_flags(walker_env.arch_env, phi, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
2211 arch_set_irn_register(walker_env.arch_env, phi, env->isa->sp);
2213 be_ssa_construction_destroy(&senv);
2215 DEL_ARR_F(walker_env.sp_nodes);
2218 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
2220 const arch_env_t *arch_env = env->birg->main_env->arch_env;
2221 int omit_fp = env->call->flags.bits.try_omit_fp;
2224 sched_foreach(bl, irn) {
2228 Check, if the node relates to an entity on the stack frame.
2229 If so, set the true offset (including the bias) for that
2232 ir_entity *ent = arch_get_frame_entity(arch_env, irn);
2234 int offset = get_stack_entity_offset(env->frame, ent, bias);
2235 arch_set_frame_offset(arch_env, irn, offset);
2236 DBG((env->dbg, LEVEL_2, "%F has offset %d (including bias %d)\n", ent, offset, bias));
2239 if(omit_fp || be_is_IncSP(irn)) {
2241 * If the node modifies the stack pointer by a constant offset,
2242 * record that in the bias.
2244 ofs = arch_get_sp_bias(arch_env, irn);
2246 if(be_is_IncSP(irn)) {
2247 if(ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2248 ofs = get_type_size_bytes(get_irg_frame_type(env->birg->irg));
2249 be_set_IncSP_offset(irn, ofs);
2250 } else if(ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2251 ofs = - get_type_size_bytes(get_irg_frame_type(env->birg->irg));
2252 be_set_IncSP_offset(irn, ofs);
2265 * A helper struct for the bias walker.
2268 be_abi_irg_t *env; /**< The ABI irg environment. */
2269 int start_block_bias; /**< The bias at the end of the start block. */
2270 ir_node *start_block; /**< The start block of the current graph. */
2274 * Block-Walker: fix all stack offsets
2276 static void stack_bias_walker(ir_node *bl, void *data)
2278 struct bias_walk *bw = data;
2279 if (bl != bw->start_block) {
2280 process_stack_bias(bw->env, bl, bw->start_block_bias);
2284 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2286 ir_graph *irg = env->birg->irg;
2287 struct bias_walk bw;
2289 stack_frame_compute_initial_offset(env->frame);
2290 // stack_layout_dump(stdout, env->frame);
2292 /* Determine the stack bias at the end of the start block. */
2293 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0);
2295 /* fix the bias is all other blocks */
2297 bw.start_block = get_irg_start_block(irg);
2298 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2301 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2303 assert(arch_register_type_is(reg, callee_save));
2304 assert(pmap_contains(abi->regs, (void *) reg));
2305 return pmap_get(abi->regs, (void *) reg);
2308 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2310 assert(arch_register_type_is(reg, ignore));
2311 assert(pmap_contains(abi->regs, (void *) reg));
2312 return pmap_get(abi->regs, (void *) reg);
2315 ir_node *be_abi_get_start_barrier(be_abi_irg_t *abi)
2317 return abi->start_barrier;
2321 * Returns non-zero if the ABI has omitted the frame pointer in
2322 * the current graph.
2324 int be_abi_omit_fp(const be_abi_irg_t *abi) {
2325 return abi->call->flags.bits.try_omit_fp;