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, ir_node *alloca_copy)
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;
422 ir_node *res_proj = NULL;
423 int curr_res_proj = pn_Call_max;
424 int n_reg_params = 0;
425 int n_stack_params = 0;
431 const arch_register_t *reg;
432 const ir_edge_t *edge;
434 int *stack_param_idx;
437 /* Let the isa fill out the abi description for that call node. */
438 arch_isa_get_call_abi(isa, mt, call);
440 /* Insert code to put the stack arguments on the stack. */
441 assert(get_Call_n_params(irn) == n_params);
442 for (i = 0; i < n_params; ++i) {
443 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
446 int arg_size = get_type_size_bytes(get_method_param_type(mt, i));
448 stack_size += round_up2(arg->space_before, arg->alignment);
449 stack_size += round_up2(arg_size, arg->alignment);
450 stack_size += round_up2(arg->space_after, arg->alignment);
451 obstack_int_grow(obst, i);
455 stack_param_idx = obstack_finish(obst);
457 /* Collect all arguments which are passed in registers. */
458 for (i = 0; i < n_params; ++i) {
459 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
460 if (arg && arg->in_reg) {
461 obstack_int_grow(obst, i);
465 reg_param_idxs = obstack_finish(obst);
467 /* If there are some parameters which shall be passed on the stack. */
468 if (n_stack_params > 0) {
470 int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
473 * Reverse list of stack parameters if call arguments are from left to right.
474 * We must them reverse again if they are pushed (not stored) and the stack
475 * direction is downwards.
477 if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) {
478 for (i = 0; i < n_stack_params >> 1; ++i) {
479 int other = n_stack_params - i - 1;
480 int tmp = stack_param_idx[i];
481 stack_param_idx[i] = stack_param_idx[other];
482 stack_param_idx[other] = tmp;
487 * If the stack is decreasing and we do not want to store sequentially,
488 * or someone else allocated the call frame
489 * we allocate as much space on the stack all parameters need, by
490 * moving the stack pointer along the stack's direction.
492 if (stack_dir < 0 && !do_seq && !no_alloc) {
493 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, stack_size);
495 add_irn_dep(curr_sp, alloca_copy);
501 obstack_ptr_grow(obst, get_Call_mem(irn));
502 curr_mem = new_NoMem();
504 curr_mem = get_Call_mem(irn);
507 for (i = 0; i < n_stack_params; ++i) {
508 int p = stack_param_idx[i];
509 be_abi_call_arg_t *arg = get_call_arg(call, 0, p);
510 ir_node *param = get_Call_param(irn, p);
511 ir_node *addr = curr_sp;
513 ir_type *param_type = get_method_param_type(mt, p);
514 int param_size = get_type_size_bytes(param_type) + arg->space_after;
517 * If we wanted to build the arguments sequentially,
518 * the stack pointer for the next must be incremented,
519 * and the memory value propagated.
523 addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, param_size + arg->space_before);
525 add_irn_dep(curr_sp, alloca_copy);
528 add_irn_dep(curr_sp, curr_mem);
531 curr_ofs += arg->space_before;
532 curr_ofs = round_up2(curr_ofs, arg->alignment);
534 /* Make the expression to compute the argument's offset. */
536 ir_mode *constmode = mach_mode;
537 if(mode_is_reference(mach_mode)) {
540 addr = new_r_Const_long(irg, bl, constmode, curr_ofs);
541 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
545 /* Insert a store for primitive arguments. */
546 if (is_atomic_type(param_type)) {
548 store = new_r_Store(irg, bl, curr_mem, addr, param);
549 mem = new_r_Proj(irg, bl, store, mode_M, pn_Store_M);
552 /* Make a mem copy for compound arguments. */
556 assert(mode_is_reference(get_irn_mode(param)));
557 copy = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type);
558 mem = new_r_Proj(irg, bl, copy, mode_M, pn_CopyB_M_regular);
561 curr_ofs += param_size;
566 obstack_ptr_grow(obst, mem);
569 in = (ir_node **) obstack_finish(obst);
571 /* We need the sync only, if we didn't build the stores sequentially. */
573 if (n_stack_params >= 1) {
574 curr_mem = new_r_Sync(irg, bl, n_stack_params + 1, in);
576 curr_mem = get_Call_mem(irn);
579 obstack_free(obst, in);
582 /* Collect caller save registers */
583 for (i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
585 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
586 for (j = 0; j < cls->n_regs; ++j) {
587 const arch_register_t *reg = arch_register_for_index(cls, j);
588 if (arch_register_type_is(reg, caller_save)) {
589 pset_insert_ptr(caller_save, (void *) reg);
591 if (arch_register_type_is(reg, state)) {
592 pset_insert_ptr(caller_save, (void*) reg);
593 pset_insert_ptr(states, (void*) reg);
598 /* search the greatest result proj number */
600 /* TODO: what if the result is NOT used? Currently there is
601 * no way to detect this later, especially there is no way to
602 * see this in the proj numbers.
603 * While this is ok for the register allocator, it is bad for
604 * backends which need to change the be_Call further (x87 simulator
605 * for instance. However for this particular case the call_type is
608 foreach_out_edge(irn, edge) {
609 const ir_edge_t *res_edge;
610 ir_node *irn = get_edge_src_irn(edge);
612 if (is_Proj(irn) && get_Proj_proj(irn) == pn_Call_T_result) {
614 foreach_out_edge(irn, res_edge) {
616 be_abi_call_arg_t *arg;
617 ir_node *res = get_edge_src_irn(res_edge);
619 assert(is_Proj(res));
621 proj = get_Proj_proj(res);
622 arg = get_call_arg(call, 1, proj);
625 shift the proj number to the right, since we will drop the
626 unspeakable Proj_T from the Call. Therefore, all real argument
627 Proj numbers must be increased by pn_be_Call_first_res
629 proj += pn_be_Call_first_res;
630 set_Proj_proj(res, proj);
631 obstack_ptr_grow(obst, res);
633 if (proj > curr_res_proj)
634 curr_res_proj = proj;
636 pset_remove_ptr(caller_save, arg->reg);
637 //pmap_insert(arg_regs, arg->reg, INT_TO_PTR(proj + 1))
644 obstack_ptr_grow(obst, NULL);
645 res_projs = obstack_finish(obst);
647 /* make the back end call node and set its register requirements. */
648 for (i = 0; i < n_reg_params; ++i) {
649 obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
651 foreach_pset(states, reg) {
652 const arch_register_class_t *cls = arch_register_get_class(reg);
654 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
655 ir_fprintf(stderr, "Adding %+F\n", regnode);
657 ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
658 obstack_ptr_grow(obst, regnode);
660 n_ins = n_reg_params + pset_count(states);
662 in = obstack_finish(obst);
664 if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
666 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
668 curr_res_proj + pset_count(caller_save), n_ins,
669 in, get_Call_type(irn));
670 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
673 low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem,
675 curr_res_proj + pset_count(caller_save),
676 n_ins, in, get_Call_type(irn));
678 ARR_APP1(ir_node *, env->calls, low_call);
681 Set the register class of the call address to
682 the backend provided class (default: stack pointer class)
684 be_node_set_reg_class(low_call, be_pos_Call_ptr, call->cls_addr);
686 DBG((env->dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
688 /* Set the register classes and constraints of the Call parameters. */
689 for (i = 0; i < n_reg_params; ++i) {
690 int index = reg_param_idxs[i];
691 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
692 assert(arg->reg != NULL);
694 be_set_constr_single_reg(low_call, be_pos_Call_first_arg + i, arg->reg);
697 /* Set the register constraints of the results. */
698 for (i = 0; res_projs[i]; ++i) {
699 int pn = get_Proj_proj(res_projs[i]);
701 /* Correct Proj number since it has been adjusted! (see above) */
702 const be_abi_call_arg_t *arg = get_call_arg(call, 1, pn - pn_Call_max);
704 /* Matze: we need the information about the real mode for later
705 * transforms (signed/unsigend compares, stores...), so leave the fixup
706 * for the backend transform phase... */
709 const arch_register_class_t *cls = arch_register_get_class(arg->reg);
710 ir_mode *mode = arch_register_class_mode(cls);
711 set_irn_mode(irn, mode);
715 be_set_constr_single_reg(low_call, BE_OUT_POS(pn), arg->reg);
716 arch_set_irn_register(arch_env, res_projs[i], arg->reg);
718 obstack_free(obst, in);
719 exchange(irn, low_call);
721 /* redirect the result projs to the lowered call instead of the Proj_T */
722 for (i = 0; res_projs[i]; ++i)
723 set_Proj_pred(res_projs[i], low_call);
725 /* set the now unnecessary projT to bad */
726 if (res_proj != NULL) {
727 be_kill_node(res_proj);
730 /* Make additional projs for the caller save registers
731 and the Keep node which keeps them alive. */
732 if (pset_count(caller_save) > 0) {
733 const arch_register_t *reg;
737 for (reg = pset_first(caller_save), n = 0; reg; reg = pset_next(caller_save), ++n) {
738 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode, curr_res_proj);
740 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
741 be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg);
743 /* a call can produce ignore registers, in this case set the flag and register for the Proj */
744 if (arch_register_type_is(reg, ignore)) {
745 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
746 be_node_set_flags(low_call, BE_OUT_POS(curr_res_proj), arch_irn_flags_ignore);
749 set_irn_link(proj, (void *) reg);
750 obstack_ptr_grow(obst, proj);
754 /* create the Keep for the caller save registers */
755 in = (ir_node **) obstack_finish(obst);
756 keep = be_new_Keep(NULL, irg, bl, n, in);
757 for (i = 0; i < n; ++i) {
758 const arch_register_t *reg = get_irn_link(in[i]);
759 be_node_set_reg_class(keep, i, reg->reg_class);
761 obstack_free(obst, in);
764 /* Clean up the stack. */
765 if (stack_size > 0) {
766 ir_node *mem_proj = NULL;
768 foreach_out_edge(low_call, edge) {
769 ir_node *irn = get_edge_src_irn(edge);
770 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
777 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_Call_M);
778 keep_alive(mem_proj);
781 /* Clean up the stack frame if we allocated it */
783 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size);
784 add_irn_dep(curr_sp, mem_proj);
786 add_irn_dep(curr_sp, alloca_copy);
792 be_abi_call_free(call);
793 obstack_free(obst, stack_param_idx);
796 del_pset(caller_save);
802 * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
804 * @param alignment the minimum stack alignment
805 * @param size the node containing the non-aligned size
806 * @param irg the irg where new nodes are allocated on
807 * @param irg the block where new nodes are allocated on
808 * @param dbg debug info for new nodes
810 * @return a node representing the aligned size
812 static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size, ir_graph *irg, ir_node *block, dbg_info *dbg) {
813 if (stack_alignment > 1) {
814 ir_mode *mode = get_irn_mode(size);
815 tarval *tv = new_tarval_from_long(stack_alignment-1, mode);
816 ir_node *mask = new_r_Const(irg, block, mode, tv);
818 size = new_rd_Add(dbg, irg, block, size, mask, mode);
820 tv = new_tarval_from_long(-(long)stack_alignment, mode);
821 mask = new_r_Const(irg, block, mode, tv);
822 size = new_rd_And(dbg, irg, block, size, mask, mode);
828 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
830 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp, ir_node **result_copy)
839 const ir_edge_t *edge;
840 ir_node *new_alloc, *size, *addr, *copy, *ins[2];
841 unsigned stack_alignment;
843 if (get_Alloc_where(alloc) != stack_alloc) {
848 block = get_nodes_block(alloc);
849 irg = get_irn_irg(block);
852 type = get_Alloc_type(alloc);
854 foreach_out_edge(alloc, edge) {
855 ir_node *irn = get_edge_src_irn(edge);
857 assert(is_Proj(irn));
858 switch(get_Proj_proj(irn)) {
870 /* Beware: currently Alloc nodes without a result might happen,
871 only escape analysis kills them and this phase runs only for object
872 oriented source. We kill the Alloc here. */
873 if (alloc_res == NULL && alloc_mem) {
874 exchange(alloc_mem, get_Alloc_mem(alloc));
878 dbg = get_irn_dbg_info(alloc);
880 /* we might need to multiply the size with the element size */
881 if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
882 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
883 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
884 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Alloc_size(alloc),
888 size = get_Alloc_size(alloc);
891 /* The stack pointer will be modified in an unknown manner.
892 We cannot omit it. */
893 env->call->flags.bits.try_omit_fp = 0;
895 /* FIXME: size must be here round up for the stack alignment, but
896 this must be transmitted from the backend. */
898 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
899 new_alloc = be_new_AddSP(env->isa->sp, irg, block, curr_sp, size);
900 set_irn_dbg_info(new_alloc, dbg);
902 if(alloc_mem != NULL) {
906 addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
908 /* We need to sync the output mem of the AddSP with the input mem
909 edge into the alloc node. */
910 ins[0] = get_Alloc_mem(alloc);
912 sync = new_r_Sync(irg, block, 2, ins);
914 exchange(alloc_mem, sync);
917 exchange(alloc, new_alloc);
919 /* fix projnum of alloca res */
920 set_Proj_proj(alloc_res, pn_be_AddSP_res);
922 addr = env->isa->stack_dir < 0 ? alloc_res : curr_sp;
924 /* copy the address away, since it could be used after further stack pointer modifications. */
925 /* Let it point curr_sp just for the moment, I'll reroute it in a second. */
926 *result_copy = copy = be_new_Copy(env->isa->sp->reg_class, irg, block, curr_sp);
928 /* Let all users of the Alloc() result now point to the copy. */
929 edges_reroute(alloc_res, copy, irg);
931 /* Rewire the copy appropriately. */
932 set_irn_n(copy, be_pos_Copy_op, addr);
941 * The Free is transformed into a back end free node and connected to the stack nodes.
943 static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp)
947 ir_node *subsp, *mem, *res, *size, *sync;
951 unsigned stack_alignment;
954 if (get_Free_where(free) != stack_alloc) {
959 block = get_nodes_block(free);
960 irg = get_irn_irg(block);
961 type = get_Free_type(free);
962 sp_mode = env->isa->sp->reg_class->mode;
963 dbg = get_irn_dbg_info(free);
965 /* we might need to multiply the size with the element size */
966 if(type != get_unknown_type() && get_type_size_bytes(type) != 1) {
967 tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu);
968 ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
969 ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
973 size = get_Free_size(free);
976 /* FIXME: size must be here round up for the stack alignment, but
977 this must be transmitted from the backend. */
979 size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
981 /* The stack pointer will be modified in an unknown manner.
982 We cannot omit it. */
983 env->call->flags.bits.try_omit_fp = 0;
984 subsp = be_new_SubSP(env->isa->sp, irg, block, curr_sp, size);
985 set_irn_dbg_info(subsp, dbg);
987 mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
988 res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_res);
990 /* we need to sync the memory */
991 in[0] = get_Free_mem(free);
993 sync = new_r_Sync(irg, block, 2, in);
995 /* and make the AddSP dependent on the former memory */
996 add_irn_dep(subsp, get_Free_mem(free));
999 exchange(free, sync);
1005 /* the following function is replaced by the usage of the heights module */
1008 * Walker for dependent_on().
1009 * This function searches a node tgt recursively from a given node
1010 * but is restricted to the given block.
1011 * @return 1 if tgt was reachable from curr, 0 if not.
1013 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl)
1017 if (get_nodes_block(curr) != bl)
1023 /* Phi functions stop the recursion inside a basic block */
1024 if (! is_Phi(curr)) {
1025 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
1026 if (check_dependence(get_irn_n(curr, i), tgt, bl))
1036 * Check if a node is somehow data dependent on another one.
1037 * both nodes must be in the same basic block.
1038 * @param n1 The first node.
1039 * @param n2 The second node.
1040 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
1042 static int dependent_on(ir_node *n1, ir_node *n2)
1044 assert(get_nodes_block(n1) == get_nodes_block(n2));
1046 return heights_reachable_in_block(ir_heights, n1, n2);
1049 static int cmp_call_dependency(const void *c1, const void *c2)
1051 ir_node *n1 = *(ir_node **) c1;
1052 ir_node *n2 = *(ir_node **) c2;
1055 Classical qsort() comparison function behavior:
1056 0 if both elements are equal
1057 1 if second is "smaller" that first
1058 -1 if first is "smaller" that second
1060 if (dependent_on(n1, n2))
1063 if (dependent_on(n2, n1))
1070 * Walker: links all Call/alloc/Free nodes to the Block they are contained.
1072 static void link_calls_in_block_walker(ir_node *irn, void *data)
1074 ir_opcode code = get_irn_opcode(irn);
1076 if (code == iro_Call ||
1077 (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) ||
1078 (code == iro_Free && get_Free_where(irn) == stack_alloc)) {
1079 be_abi_irg_t *env = data;
1080 ir_node *bl = get_nodes_block(irn);
1081 void *save = get_irn_link(bl);
1083 if (code == iro_Call)
1084 env->call->flags.bits.irg_is_leaf = 0;
1086 set_irn_link(irn, save);
1087 set_irn_link(bl, irn);
1093 * Process all Call nodes inside a basic block.
1094 * Note that the link field of the block must contain a linked list of all
1095 * Call nodes inside the Block. We first order this list according to data dependency
1096 * and that connect the calls together.
1098 static void process_calls_in_block(ir_node *bl, void *data)
1100 be_abi_irg_t *env = data;
1101 ir_node *curr_sp = env->init_sp;
1105 for(irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
1106 obstack_ptr_grow(&env->obst, irn);
1108 /* If there were call nodes in the block. */
1112 ir_node *copy = NULL;
1115 nodes = obstack_finish(&env->obst);
1117 /* order the call nodes according to data dependency */
1118 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
1120 for(i = n - 1; i >= 0; --i) {
1121 ir_node *irn = nodes[i];
1123 DBG((env->dbg, LEVEL_3, "\tprocessing call %+F\n", irn));
1124 switch(get_irn_opcode(irn)) {
1126 curr_sp = adjust_call(env, irn, curr_sp, copy);
1129 curr_sp = adjust_alloc(env, irn, curr_sp, ©);
1132 curr_sp = adjust_free(env, irn, curr_sp);
1135 panic("invalid call");
1140 obstack_free(&env->obst, nodes);
1142 /* Keep the last stack state in the block by tying it to Keep node */
1143 if(curr_sp != env->init_sp) {
1145 keep = be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl),
1147 pmap_insert(env->keep_map, bl, keep);
1151 set_irn_link(bl, curr_sp);
1152 } /* process_calls_in_block */
1155 * Adjust all call nodes in the graph to the ABI conventions.
1157 static void process_calls(be_abi_irg_t *env)
1159 ir_graph *irg = env->birg->irg;
1161 env->call->flags.bits.irg_is_leaf = 1;
1162 irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, env);
1164 ir_heights = heights_new(env->birg->irg);
1165 irg_block_walk_graph(irg, NULL, process_calls_in_block, env);
1166 heights_free(ir_heights);
1170 static ir_node *setup_frame(be_abi_irg_t *env)
1172 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1173 const arch_register_t *sp = isa->sp;
1174 const arch_register_t *bp = isa->bp;
1175 be_abi_call_flags_bits_t flags = env->call->flags.bits;
1176 ir_graph *irg = env->birg->irg;
1177 ir_node *bl = get_irg_start_block(irg);
1178 ir_node *no_mem = get_irg_no_mem(irg);
1179 ir_node *old_frame = get_irg_frame(irg);
1180 ir_node *stack = pmap_get(env->regs, (void *) sp);
1181 ir_node *frame = pmap_get(env->regs, (void *) bp);
1183 int stack_nr = get_Proj_proj(stack);
1185 if(flags.try_omit_fp) {
1186 stack = be_new_IncSP(sp, irg, bl, stack, no_mem, BE_STACK_FRAME_SIZE_EXPAND);
1191 frame = be_new_Copy(bp->reg_class, irg, bl, stack);
1193 be_node_set_flags(frame, -1, arch_irn_flags_dont_spill);
1194 if(!flags.fp_free) {
1195 be_set_constr_single_reg(frame, -1, bp);
1196 be_node_set_flags(frame, -1, arch_irn_flags_ignore);
1197 arch_set_irn_register(env->birg->main_env->arch_env, frame, bp);
1200 stack = be_new_IncSP(sp, irg, bl, stack, frame, BE_STACK_FRAME_SIZE_EXPAND);
1203 be_node_set_flags(env->reg_params, -(stack_nr + 1), arch_irn_flags_ignore);
1204 env->init_sp = stack;
1205 set_irg_frame(irg, frame);
1206 edges_reroute(old_frame, frame, irg);
1211 static void clearup_frame(be_abi_irg_t *env, ir_node *ret, pmap *reg_map, struct obstack *obst)
1213 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1214 const arch_register_t *sp = isa->sp;
1215 const arch_register_t *bp = isa->bp;
1216 ir_graph *irg = env->birg->irg;
1217 ir_node *ret_mem = get_Return_mem(ret);
1218 ir_node *frame = get_irg_frame(irg);
1219 ir_node *bl = get_nodes_block(ret);
1220 ir_node *stack = get_irn_link(bl);
1224 if(env->call->flags.bits.try_omit_fp) {
1225 stack = be_new_IncSP(sp, irg, bl, stack, ret_mem, -BE_STACK_FRAME_SIZE_SHRINK);
1229 stack = be_new_SetSP(sp, irg, bl, stack, frame, ret_mem);
1230 be_set_constr_single_reg(stack, -1, sp);
1231 be_node_set_flags(stack, -1, arch_irn_flags_ignore);
1234 pmap_foreach(env->regs, ent) {
1235 const arch_register_t *reg = ent->key;
1236 ir_node *irn = ent->value;
1239 obstack_ptr_grow(&env->obst, stack);
1241 obstack_ptr_grow(&env->obst, frame);
1242 else if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1243 obstack_ptr_grow(obst, irn);
1250 * Computes the stack argument layout type.
1251 * Changes a possibly allocated value param type by moving
1252 * entities to the stack layout type.
1254 * @param env the ABI environment
1255 * @param call the current call ABI
1256 * @param method_type the method type
1257 * @param param_map an array mapping method arguments to the stack layout type
1259 * @return the stack argument layout type
1261 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type, ir_entity ***param_map)
1263 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
1264 int inc = env->birg->main_env->arch_env->isa->stack_dir * dir;
1265 int n = get_method_n_params(method_type);
1266 int curr = inc > 0 ? 0 : n - 1;
1272 ir_type *val_param_tp = get_method_value_param_type(method_type);
1273 ident *id = get_entity_ident(get_irg_entity(env->birg->irg));
1276 *param_map = map = obstack_alloc(&env->obst, n * sizeof(ir_entity *));
1277 res = new_type_struct(mangle_u(id, new_id_from_chars("arg_type", 8)));
1278 for (i = 0; i < n; ++i, curr += inc) {
1279 ir_type *param_type = get_method_param_type(method_type, curr);
1280 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
1283 if (arg->on_stack) {
1285 /* the entity was already created, move it to the param type */
1286 arg->stack_ent = get_method_value_param_ent(method_type, i);
1287 remove_struct_member(val_param_tp, arg->stack_ent);
1288 set_entity_owner(arg->stack_ent, res);
1289 add_struct_member(res, arg->stack_ent);
1290 /* must be automatic to set a fixed layout */
1291 set_entity_allocation(arg->stack_ent, allocation_automatic);
1294 snprintf(buf, sizeof(buf), "param_%d", i);
1295 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
1297 ofs += arg->space_before;
1298 ofs = round_up2(ofs, arg->alignment);
1299 set_entity_offset(arg->stack_ent, ofs);
1300 ofs += arg->space_after;
1301 ofs += get_type_size_bytes(param_type);
1302 map[i] = arg->stack_ent;
1305 set_type_size_bytes(res, ofs);
1306 set_type_state(res, layout_fixed);
1311 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
1314 struct obstack obst;
1316 obstack_init(&obst);
1318 /* Create a Perm after the RegParams node to delimit it. */
1319 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1320 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1325 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
1326 const arch_register_t *reg = &cls->regs[j];
1327 ir_node *irn = pmap_get(regs, (void *) reg);
1329 if(irn && !arch_register_type_is(reg, ignore)) {
1331 obstack_ptr_grow(&obst, irn);
1332 set_irn_link(irn, (void *) reg);
1336 obstack_ptr_grow(&obst, NULL);
1337 in = obstack_finish(&obst);
1339 perm = be_new_Perm(cls, irg, bl, n_regs, in);
1340 for(j = 0; j < n_regs; ++j) {
1341 ir_node *arg = in[j];
1342 arch_register_t *reg = get_irn_link(arg);
1343 pmap_insert(regs, reg, arg);
1344 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
1347 obstack_free(&obst, in);
1350 obstack_free(&obst, NULL);
1355 const arch_register_t *reg;
1359 static int cmp_regs(const void *a, const void *b)
1361 const reg_node_map_t *p = a;
1362 const reg_node_map_t *q = b;
1364 if(p->reg->reg_class == q->reg->reg_class)
1365 return p->reg->index - q->reg->index;
1367 return p->reg->reg_class - q->reg->reg_class;
1370 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1373 int n = pmap_count(reg_map);
1375 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1377 pmap_foreach(reg_map, ent) {
1378 res[i].reg = ent->key;
1379 res[i].irn = ent->value;
1383 qsort(res, n, sizeof(res[0]), cmp_regs);
1388 * Creates a barrier.
1390 static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1392 ir_graph *irg = env->birg->irg;
1393 int n_regs = pmap_count(regs);
1399 rm = reg_map_to_arr(&env->obst, regs);
1401 for(n = 0; n < n_regs; ++n)
1402 obstack_ptr_grow(&env->obst, rm[n].irn);
1405 obstack_ptr_grow(&env->obst, *mem);
1409 in = (ir_node **) obstack_finish(&env->obst);
1410 irn = be_new_Barrier(irg, bl, n, in);
1411 obstack_free(&env->obst, in);
1413 for(n = 0; n < n_regs; ++n) {
1414 const arch_register_t *reg = rm[n].reg;
1416 int pos = BE_OUT_POS(n);
1419 proj = new_r_Proj(irg, bl, irn, get_irn_mode(rm[n].irn), n);
1420 be_node_set_reg_class(irn, n, reg->reg_class);
1422 be_set_constr_single_reg(irn, n, reg);
1423 be_set_constr_single_reg(irn, pos, reg);
1424 be_node_set_reg_class(irn, pos, reg->reg_class);
1425 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1427 /* if the proj projects a ignore register or a node which is set to ignore, propagate this property. */
1428 if(arch_register_type_is(reg, ignore) || arch_irn_is(env->birg->main_env->arch_env, in[n], ignore))
1429 flags |= arch_irn_flags_ignore;
1431 if(arch_irn_is(env->birg->main_env->arch_env, in[n], modify_sp))
1432 flags |= arch_irn_flags_modify_sp;
1434 be_node_set_flags(irn, pos, flags);
1436 pmap_insert(regs, (void *) reg, proj);
1440 *mem = new_r_Proj(irg, bl, irn, mode_M, n);
1443 obstack_free(&env->obst, rm);
1448 * Creates a be_Return for a Return node.
1450 * @param @env the abi environment
1451 * @param irn the Return node or NULL if there was none
1452 * @param bl the block where the be_Retun should be placed
1453 * @param mem the current memory
1454 * @param n_res number of return results
1456 static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, ir_node *mem, int n_res) {
1457 be_abi_call_t *call = env->call;
1458 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1460 pmap *reg_map = pmap_create();
1461 ir_node *keep = pmap_get(env->keep_map, bl);
1467 const arch_register_t **regs;
1471 get the valid stack node in this block.
1472 If we had a call in that block there is a Keep constructed by process_calls()
1473 which points to the last stack modification in that block. we'll use
1474 it then. Else we use the stack from the start block and let
1475 the ssa construction fix the usage.
1477 stack = be_abi_reg_map_get(env->regs, isa->sp);
1479 stack = get_irn_n(keep, 0);
1481 remove_End_keepalive(get_irg_end(env->birg->irg), keep);
1484 /* Insert results for Return into the register map. */
1485 for(i = 0; i < n_res; ++i) {
1486 ir_node *res = get_Return_res(irn, i);
1487 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1488 assert(arg->in_reg && "return value must be passed in register");
1489 pmap_insert(reg_map, (void *) arg->reg, res);
1492 /* Add uses of the callee save registers. */
1493 pmap_foreach(env->regs, ent) {
1494 const arch_register_t *reg = ent->key;
1495 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1496 pmap_insert(reg_map, ent->key, ent->value);
1499 be_abi_reg_map_set(reg_map, isa->sp, stack);
1501 /* Make the Epilogue node and call the arch's epilogue maker. */
1502 create_barrier(env, bl, &mem, reg_map, 1);
1503 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1506 Maximum size of the in array for Return nodes is
1507 return args + callee save/ignore registers + memory + stack pointer
1509 in_max = pmap_count(reg_map) + n_res + 2;
1511 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1512 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1515 in[1] = be_abi_reg_map_get(reg_map, isa->sp);
1520 /* clear SP entry, since it has already been grown. */
1521 pmap_insert(reg_map, (void *) isa->sp, NULL);
1522 for(i = 0; i < n_res; ++i) {
1523 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1525 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1526 regs[n++] = arg->reg;
1528 /* Clear the map entry to mark the register as processed. */
1529 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1532 /* grow the rest of the stuff. */
1533 pmap_foreach(reg_map, ent) {
1536 regs[n++] = ent->key;
1540 /* The in array for the new back end return is now ready. */
1541 ret = be_new_Return(irn ? get_irn_dbg_info(irn) : NULL, env->birg->irg, bl, n_res, n, in);
1543 /* Set the register classes of the return's parameter accordingly. */
1544 for(i = 0; i < n; ++i)
1546 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1548 /* Free the space of the Epilog's in array and the register <-> proj map. */
1549 obstack_free(&env->obst, in);
1550 pmap_destroy(reg_map);
1555 typedef struct lower_frame_sels_env_t {
1557 ir_entity *value_param_list; /**< the list of all value param entities */
1558 } lower_frame_sels_env_t;
1561 * Walker: Replaces Sels of frame type and
1562 * value param type entities by FrameAddress.
1564 static void lower_frame_sels_walker(ir_node *irn, void *data)
1566 lower_frame_sels_env_t *ctx = data;
1569 ir_graph *irg = current_ir_graph;
1570 ir_node *frame = get_irg_frame(irg);
1571 ir_node *param_base = get_irg_value_param_base(irg);
1572 ir_node *ptr = get_Sel_ptr(irn);
1574 if (ptr == frame || ptr == param_base) {
1575 be_abi_irg_t *env = ctx->env;
1576 ir_entity *ent = get_Sel_entity(irn);
1577 ir_node *bl = get_nodes_block(irn);
1580 nw = be_new_FrameAddr(env->isa->sp->reg_class, irg, bl, frame, ent);
1583 /* check, if it's a param sel and if have not seen this entity immediatly before */
1584 if (ptr == param_base && ctx->value_param_list != ent) {
1585 set_entity_link(ent, ctx->value_param_list);
1586 ctx->value_param_list = ent;
1593 * Check if a value parameter is transmitted as a register.
1594 * This might happen if the address of an parameter is taken which is
1595 * transmitted in registers.
1597 * Note that on some architectures this case must be handled specially
1598 * because the place of the backing store is determined by their ABI.
1600 * In the default case we move the entity to the frame type and create
1601 * a backing store into the first block.
1603 static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_entity *value_param_list) {
1604 be_abi_call_t *call = env->call;
1605 ir_graph *irg = env->birg->irg;
1606 ir_entity *ent, *next_ent, *new_list;
1608 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1611 for (ent = value_param_list; ent; ent = next_ent) {
1612 int i = get_struct_member_index(get_entity_owner(ent), ent);
1613 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1615 next_ent = get_entity_link(ent);
1617 DBG((dbg, LEVEL_2, "\targ #%d need backing store\n", i));
1618 set_entity_link(ent, new_list);
1623 /* ok, change the graph */
1624 ir_node *start_bl = get_irg_start_block(irg);
1625 ir_node *first_bl = NULL;
1626 ir_node *frame, *imem, *nmem, *store, *mem, *args, *args_bl;
1627 const ir_edge_t *edge;
1628 optimization_state_t state;
1631 foreach_block_succ(start_bl, edge) {
1632 ir_node *succ = get_edge_src_irn(edge);
1633 if (start_bl != succ) {
1639 /* we had already removed critical edges, so the following
1640 assertion should be always true. */
1641 assert(get_Block_n_cfgpreds(first_bl) == 1);
1643 /* now create backing stores */
1644 frame = get_irg_frame(irg);
1645 imem = get_irg_initial_mem(irg);
1647 save_optimization_state(&state);
1649 nmem = new_r_Proj(irg, first_bl, get_irg_start(irg), mode_M, pn_Start_M);
1650 restore_optimization_state(&state);
1652 /* reroute all edges to the new memory source */
1653 edges_reroute(imem, nmem, irg);
1657 args = get_irg_args(irg);
1658 args_bl = get_nodes_block(args);
1659 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1660 int i = get_struct_member_index(get_entity_owner(ent), ent);
1661 ir_type *tp = get_entity_type(ent);
1662 ir_mode *mode = get_type_mode(tp);
1665 /* address for the backing store */
1666 addr = be_new_FrameAddr(env->isa->sp->reg_class, irg, first_bl, frame, ent);
1669 mem = new_r_Proj(irg, first_bl, store, mode_M, pn_Store_M);
1671 /* the backing store itself */
1672 store = new_r_Store(irg, first_bl, mem, addr,
1673 new_r_Proj(irg, args_bl, args, mode, i));
1675 /* the new memory Proj gets the last Proj from store */
1676 set_Proj_pred(nmem, store);
1677 set_Proj_proj(nmem, pn_Store_M);
1679 /* move all entities to the frame type */
1680 frame_tp = get_irg_frame_type(irg);
1681 offset = get_type_size_bytes(frame_tp);
1682 for (ent = new_list; ent; ent = get_entity_link(ent)) {
1683 ir_type *tp = get_entity_type(ent);
1684 int align = get_type_alignment_bytes(tp);
1686 offset += align - 1;
1688 set_entity_owner(ent, frame_tp);
1689 add_class_member(frame_tp, ent);
1690 /* must be automatic to set a fixed layout */
1691 set_entity_allocation(ent, allocation_automatic);
1692 set_entity_offset(ent, offset);
1693 offset += get_type_size_bytes(tp);
1695 set_type_size_bytes(frame_tp, offset);
1700 * The start block has no jump, instead it has an initial exec Proj.
1701 * The backend wants to handle all blocks the same way, so we replace
1702 * the out cfg edge with a real jump.
1704 static void fix_start_block(ir_node *block, void *env) {
1707 ir_node *start_block;
1710 /* we processed the start block, return */
1714 irg = get_irn_irg(block);
1715 start_block = get_irg_start_block(irg);
1717 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1718 ir_node *pred = get_Block_cfgpred(block, i);
1719 ir_node *pred_block = get_nodes_block(pred);
1721 /* ok, we are in the block, having start as cfg predecessor */
1722 if (pred_block == start_block) {
1723 ir_node *jump = new_r_Jmp(irg, pred_block);
1724 set_Block_cfgpred(block, i, jump);
1731 * Modify the irg itself and the frame type.
1733 static void modify_irg(be_abi_irg_t *env)
1735 be_abi_call_t *call = env->call;
1736 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1737 const arch_register_t *sp = arch_isa_sp(isa);
1738 ir_graph *irg = env->birg->irg;
1739 ir_node *bl = get_irg_start_block(irg);
1740 ir_node *end = get_irg_end_block(irg);
1741 ir_node *old_mem = get_irg_initial_mem(irg);
1742 ir_node *new_mem_proj;
1744 ir_type *method_type = get_entity_type(get_irg_entity(irg));
1745 pset *dont_save = pset_new_ptr(8);
1751 const arch_register_t *fp_reg;
1752 ir_node *frame_pointer;
1754 ir_node *reg_params_bl;
1757 ir_node *value_param_base;
1758 const ir_edge_t *edge;
1759 ir_type *arg_type, *bet_type;
1760 lower_frame_sels_env_t ctx;
1761 ir_entity **param_map;
1763 bitset_t *used_proj_nr;
1764 DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;)
1766 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1768 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1770 ctx.value_param_list = 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 int nr = get_Proj_proj(irn);
1804 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1807 arg_type = compute_arg_type(env, call, method_type, ¶m_map);
1808 bet_type = call->cb->get_between_type(env->cb);
1809 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), isa->stack_dir, param_map);
1811 /* Count the register params and add them to the number of Projs for the RegParams node */
1812 for(i = 0; i < n_params; ++i) {
1813 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1814 if(arg->in_reg && args[i]) {
1815 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1816 assert(i == get_Proj_proj(args[i]));
1818 /* For now, associate the register with the old Proj from Start representing that argument. */
1819 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1820 bitset_set(used_proj_nr, i);
1821 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1825 /* Collect all callee-save registers */
1826 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1827 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1828 for(j = 0; j < cls->n_regs; ++j) {
1829 const arch_register_t *reg = &cls->regs[j];
1830 if(arch_register_type_is(reg, callee_save) ||
1831 arch_register_type_is(reg, state)) {
1832 pmap_insert(env->regs, (void *) reg, NULL);
1837 pmap_insert(env->regs, (void *) sp, NULL);
1838 pmap_insert(env->regs, (void *) isa->bp, NULL);
1839 reg_params_bl = get_irg_start_block(irg);
1840 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1841 add_irn_dep(env->reg_params, get_irg_start(irg));
1844 * make proj nodes for the callee save registers.
1845 * memorize them, since Return nodes get those as inputs.
1847 * Note, that if a register corresponds to an argument, the regs map contains
1848 * the old Proj from start for that argument.
1851 rm = reg_map_to_arr(&env->obst, env->regs);
1852 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1853 arch_register_t *reg = (void *) rm[i].reg;
1854 ir_mode *mode = reg->reg_class->mode;
1856 int pos = BE_OUT_POS((int) nr);
1862 bitset_set(used_proj_nr, nr);
1863 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1864 pmap_insert(env->regs, (void *) reg, proj);
1865 be_set_constr_single_reg(env->reg_params, pos, reg);
1866 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1869 * If the register is an ignore register,
1870 * The Proj for that register shall also be ignored during register allocation.
1872 if(arch_register_type_is(reg, ignore))
1873 flags |= arch_irn_flags_ignore;
1876 flags |= arch_irn_flags_modify_sp;
1878 be_node_set_flags(env->reg_params, pos, flags);
1880 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1882 obstack_free(&env->obst, rm);
1884 /* create a new initial memory proj */
1885 assert(is_Proj(old_mem));
1886 new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
1887 new_r_Unknown(irg, mode_T), mode_M,
1888 get_Proj_proj(old_mem));
1891 /* Generate the Prologue */
1892 fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
1894 /* do the stack allocation BEFORE the barrier, or spill code
1895 might be added before it */
1896 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1897 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND);
1898 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1900 env->start_barrier = barrier = create_barrier(env, bl, &mem, env->regs, 0);
1902 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1903 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1905 frame_pointer = be_abi_reg_map_get(env->regs, fp_reg);
1906 set_irg_frame(irg, frame_pointer);
1907 pset_insert_ptr(env->ignore_regs, fp_reg);
1909 /* rewire old mem users to new mem */
1910 set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
1911 exchange(old_mem, mem);
1913 set_irg_initial_mem(irg, mem);
1915 /* Now, introduce stack param nodes for all parameters passed on the stack */
1916 for(i = 0; i < n_params; ++i) {
1917 ir_node *arg_proj = args[i];
1918 ir_node *repl = NULL;
1920 if(arg_proj != NULL) {
1921 be_abi_call_arg_t *arg;
1922 ir_type *param_type;
1923 int nr = get_Proj_proj(arg_proj);
1926 nr = MIN(nr, n_params);
1927 arg = get_call_arg(call, 0, nr);
1928 param_type = get_method_param_type(method_type, nr);
1931 repl = pmap_get(env->regs, (void *) arg->reg);
1934 else if(arg->on_stack) {
1935 /* For atomic parameters which are actually used, we create a StackParam node. */
1936 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1937 ir_mode *mode = get_type_mode(param_type);
1938 const arch_register_class_t *cls = arch_isa_get_reg_class_for_mode(isa, mode);
1939 repl = be_new_StackParam(cls, isa->bp->reg_class, irg, reg_params_bl, mode, frame_pointer, arg->stack_ent);
1942 /* The stack parameter is not primitive (it is a struct or array),
1943 we thus will create a node representing the parameter's address
1946 repl = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1950 assert(repl != NULL);
1952 /* Beware: the mode of the register parameters is always the mode of the register class
1953 which may be wrong. Add Conv's then. */
1954 mode = get_irn_mode(args[i]);
1955 if (mode != get_irn_mode(repl)) {
1956 repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
1958 exchange(args[i], repl);
1962 /* the arg proj is not needed anymore now */
1963 assert(get_irn_n_edges(arg_tuple) == 0);
1964 be_kill_node(arg_tuple);
1965 set_irg_args(irg, new_rd_Bad(irg));
1967 /* All Return nodes hang on the End node, so look for them there. */
1968 for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) {
1969 ir_node *irn = get_Block_cfgpred(end, i);
1971 if (is_Return(irn)) {
1972 ir_node *ret = create_be_return(env, irn, get_nodes_block(irn), get_Return_mem(irn), get_Return_n_ress(irn));
1976 /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return then,
1977 the code is dead and will never be executed. */
1979 del_pset(dont_save);
1980 obstack_free(&env->obst, args);
1982 /* handle start block here (place a jump in the block) */
1984 irg_block_walk_graph(irg, fix_start_block, NULL, &temp);
1987 /** Fix the state inputs of calls that still hang on unknowns */
1989 void fix_call_state_inputs(be_abi_irg_t *env)
1991 const arch_isa_t *isa = env->isa;
1993 arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
1995 /* Collect caller save registers */
1996 n = arch_isa_get_n_reg_class(isa);
1997 for(i = 0; i < n; ++i) {
1999 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
2000 for(j = 0; j < cls->n_regs; ++j) {
2001 const arch_register_t *reg = arch_register_for_index(cls, j);
2002 if(arch_register_type_is(reg, state)) {
2003 ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
2008 n = ARR_LEN(env->calls);
2009 n_states = ARR_LEN(stateregs);
2010 for(i = 0; i < n; ++i) {
2012 ir_node *call = env->calls[i];
2014 arity = get_irn_arity(call);
2016 /* the statereg inputs are the last n inputs of the calls */
2017 for(s = 0; s < n_states; ++s) {
2018 int inp = arity - n_states + s;
2019 const arch_register_t *reg = stateregs[s];
2020 ir_node *regnode = be_abi_reg_map_get(env->regs, reg);
2022 set_irn_n(call, inp, regnode);
2027 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
2029 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
2030 ir_node *old_frame = get_irg_frame(birg->irg);
2031 ir_graph *irg = birg->irg;
2035 optimization_state_t state;
2036 unsigned *limited_bitset;
2038 be_omit_fp = birg->main_env->options->omit_fp;
2040 obstack_init(&env->obst);
2042 env->isa = birg->main_env->arch_env->isa;
2043 env->method_type = get_entity_type(get_irg_entity(irg));
2044 env->call = be_abi_call_new(env->isa->sp->reg_class);
2045 arch_isa_get_call_abi(env->isa, env->method_type, env->call);
2047 env->ignore_regs = pset_new_ptr_default();
2048 env->keep_map = pmap_create();
2049 env->dce_survivor = new_survive_dce();
2052 env->sp_req.type = arch_register_req_type_limited;
2053 env->sp_req.cls = arch_register_get_class(env->isa->sp);
2054 limited_bitset = rbitset_obstack_alloc(&env->obst, env->sp_req.cls->n_regs);
2055 rbitset_set(limited_bitset, arch_register_get_index(env->isa->sp));
2056 env->sp_req.limited = limited_bitset;
2058 env->sp_cls_req.type = arch_register_req_type_normal;
2059 env->sp_cls_req.cls = arch_register_get_class(env->isa->sp);
2061 /* Beware: later we replace this node by the real one, ensure it is not CSE'd
2062 to another Unknown or the stack pointer gets used */
2063 save_optimization_state(&state);
2065 env->init_sp = dummy = new_r_Unknown(irg, env->isa->sp->reg_class->mode);
2066 restore_optimization_state(&state);
2067 FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
2069 env->calls = NEW_ARR_F(ir_node*, 0);
2071 /* Lower all call nodes in the IRG. */
2075 Beware: init backend abi call object after processing calls,
2076 otherwise some information might be not yet available.
2078 env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg);
2080 /* Process the IRG */
2083 /* fix call inputs for state registers */
2084 fix_call_state_inputs(env);
2086 /* We don't need the keep map anymore. */
2087 pmap_destroy(env->keep_map);
2089 /* calls array is not needed anymore */
2090 DEL_ARR_F(env->calls);
2092 /* reroute the stack origin of the calls to the true stack origin. */
2093 exchange(dummy, env->init_sp);
2094 exchange(old_frame, get_irg_frame(irg));
2096 /* Make some important node pointers survive the dead node elimination. */
2097 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
2098 pmap_foreach(env->regs, ent) {
2099 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
2102 env->call->cb->done(env->cb);
2107 void be_abi_free(be_abi_irg_t *env)
2109 be_abi_call_free(env->call);
2110 free_survive_dce(env->dce_survivor);
2111 del_pset(env->ignore_regs);
2112 pmap_destroy(env->regs);
2113 obstack_free(&env->obst, NULL);
2117 void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs)
2119 arch_register_t *reg;
2121 for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs))
2122 if(reg->reg_class == cls)
2123 bitset_set(bs, reg->index);
2126 /* Returns the stack layout from a abi environment. */
2127 const be_stack_layout_t *be_abi_get_stack_layout(const be_abi_irg_t *abi) {
2134 | ___(_)_ __ / ___|| |_ __ _ ___| | __
2135 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
2136 | _| | |> < ___) | || (_| | (__| <
2137 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
2141 typedef ir_node **node_array;
2143 typedef struct fix_stack_walker_env_t {
2144 node_array sp_nodes;
2145 const arch_env_t *arch_env;
2146 } fix_stack_walker_env_t;
2149 * Walker. Collect all stack modifying nodes.
2151 static void collect_stack_nodes_walker(ir_node *node, void *data)
2153 fix_stack_walker_env_t *env = data;
2155 if (arch_irn_is(env->arch_env, node, modify_sp)) {
2156 assert(get_irn_mode(node) != mode_M && get_irn_mode(node) != mode_T);
2157 ARR_APP1(ir_node*, env->sp_nodes, node);
2161 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
2163 be_ssa_construction_env_t senv;
2166 be_irg_t *birg = env->birg;
2167 be_lv_t *lv = be_get_birg_liveness(birg);
2168 fix_stack_walker_env_t walker_env;
2171 walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
2172 walker_env.arch_env = birg->main_env->arch_env;
2173 isa = walker_env.arch_env->isa;
2175 irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
2177 /* nothing to be done if we didn't find any node, in fact we mustn't
2178 * continue, as for endless loops incsp might have had no users and is bad
2181 len = ARR_LEN(walker_env.sp_nodes);
2183 DEL_ARR_F(walker_env.sp_nodes);
2187 be_ssa_construction_init(&senv, birg);
2188 be_ssa_construction_add_copies(&senv, walker_env.sp_nodes,
2189 ARR_LEN(walker_env.sp_nodes));
2190 be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes,
2191 ARR_LEN(walker_env.sp_nodes));
2194 len = ARR_LEN(walker_env.sp_nodes);
2195 for(i = 0; i < len; ++i) {
2196 be_liveness_update(lv, walker_env.sp_nodes[i]);
2198 be_ssa_construction_update_liveness_phis(&senv, lv);
2201 phis = be_ssa_construction_get_new_phis(&senv);
2203 /* set register requirements for stack phis */
2204 len = ARR_LEN(phis);
2205 for(i = 0; i < len; ++i) {
2206 ir_node *phi = phis[i];
2207 be_set_phi_reg_req(walker_env.arch_env, phi, &env->sp_req);
2208 be_set_phi_flags(walker_env.arch_env, phi, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
2209 arch_set_irn_register(walker_env.arch_env, phi, env->isa->sp);
2211 be_ssa_construction_destroy(&senv);
2213 DEL_ARR_F(walker_env.sp_nodes);
2216 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
2218 const arch_env_t *arch_env = env->birg->main_env->arch_env;
2219 int omit_fp = env->call->flags.bits.try_omit_fp;
2222 sched_foreach(bl, irn) {
2225 Check, if the node relates to an entity on the stack frame.
2226 If so, set the true offset (including the bias) for that
2229 ir_entity *ent = arch_get_frame_entity(arch_env, irn);
2231 int offset = get_stack_entity_offset(env->frame, ent, bias);
2232 arch_set_frame_offset(arch_env, irn, offset);
2233 DBG((env->dbg, LEVEL_2, "%F has offset %d (including bias %d)\n", ent, offset, bias));
2237 If the node modifies the stack pointer by a constant offset,
2238 record that in the bias.
2240 if(arch_irn_is(arch_env, irn, modify_sp)) {
2241 int ofs = arch_get_sp_bias(arch_env, irn);
2243 if(be_is_IncSP(irn)) {
2244 if(ofs == BE_STACK_FRAME_SIZE_EXPAND) {
2245 ofs = get_type_size_bytes(get_irg_frame_type(env->birg->irg));
2246 be_set_IncSP_offset(irn, ofs);
2247 } else if(ofs == BE_STACK_FRAME_SIZE_SHRINK) {
2248 ofs = - get_type_size_bytes(get_irg_frame_type(env->birg->irg));
2249 be_set_IncSP_offset(irn, ofs);
2262 * A helper struct for the bias walker.
2265 be_abi_irg_t *env; /**< The ABI irg environment. */
2266 int start_block_bias; /**< The bias at the end of the start block. */
2267 ir_node *start_block; /**< The start block of the current graph. */
2271 * Block-Walker: fix all stack offsets
2273 static void stack_bias_walker(ir_node *bl, void *data)
2275 struct bias_walk *bw = data;
2276 if (bl != bw->start_block) {
2277 process_stack_bias(bw->env, bl, bw->start_block_bias);
2281 void be_abi_fix_stack_bias(be_abi_irg_t *env)
2283 ir_graph *irg = env->birg->irg;
2284 struct bias_walk bw;
2286 stack_frame_compute_initial_offset(env->frame);
2287 // stack_layout_dump(stdout, env->frame);
2289 /* Determine the stack bias at the end of the start block. */
2290 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0);
2292 /* fix the bias is all other blocks */
2294 bw.start_block = get_irg_start_block(irg);
2295 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
2298 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2300 assert(arch_register_type_is(reg, callee_save));
2301 assert(pmap_contains(abi->regs, (void *) reg));
2302 return pmap_get(abi->regs, (void *) reg);
2305 ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg)
2307 assert(arch_register_type_is(reg, ignore));
2308 assert(pmap_contains(abi->regs, (void *) reg));
2309 return pmap_get(abi->regs, (void *) reg);
2312 ir_node *be_abi_get_start_barrier(be_abi_irg_t *abi)
2314 return abi->start_barrier;
2318 * Returns non-zero if the ABI has omitted the frame pointer in
2319 * the current graph.
2321 int be_abi_omit_fp(const be_abi_irg_t *abi) {
2322 return abi->call->flags.bits.try_omit_fp;