4 * @author Sebastian Hack
16 #include "irgraph_t.h"
19 #include "iredges_t.h"
22 #include "irprintf_t.h"
30 #include "besched_t.h"
32 #define MAX(x, y) ((x) > (y) ? (x) : (y))
33 #define MIN(x, y) ((x) < (y) ? (x) : (y))
35 typedef struct _be_abi_call_arg_t {
38 unsigned on_stack : 1;
41 const arch_register_t *reg;
45 struct _be_abi_call_t {
46 be_abi_call_flags_t flags;
47 const be_abi_callbacks_t *cb;
52 #define N_FRAME_TYPES 3
54 typedef struct _be_stack_frame_t {
59 type *order[N_FRAME_TYPES]; /**< arg, between and frame types ordered. */
65 struct _be_stack_slot_t {
66 struct _be_stack_frame_t *frame;
70 struct _be_abi_irg_t {
72 firm_dbg_module_t *dbg; /**< The debugging module. */
73 be_stack_frame_t *frame; /**< The stack frame model. */
74 const be_irg_t *birg; /**< The back end IRG. */
75 const arch_isa_t *isa; /**< The isa. */
76 survive_dce_t *dce_survivor;
78 be_abi_call_t *call; /**< The ABI call information. */
79 type *method_type; /**< The type of the method of the IRG. */
81 ir_node *init_sp; /**< The node representing the stack pointer
82 at the start of the function. */
84 ir_node *reg_params; /**< The reg params node. */
85 pmap *regs; /**< A map of all callee-save and ignore regs to
86 their Projs to the RegParams node. */
88 pset *stack_phis; /**< The set of all Phi nodes inserted due to
89 stack pointer modifying nodes. */
91 int start_block_bias; /**< The stack bias at the end of the start block. */
93 void *cb; /**< ABI Callback self pointer. */
95 arch_irn_handler_t irn_handler;
96 arch_irn_ops_t irn_ops;
99 #define abi_offset_of(type,member) ((char *) &(((type *) 0)->member) - (char *) 0)
100 #define abi_get_relative(ptr, member) ((void *) ((char *) (ptr) - abi_offset_of(be_abi_irg_t, member)))
101 #define get_abi_from_handler(ptr) abi_get_relative(ptr, irn_handler)
102 #define get_abi_from_ops(ptr) abi_get_relative(ptr, irn_ops)
104 /* Forward, since be need it in be_abi_introduce(). */
105 static const arch_irn_ops_if_t abi_irn_ops;
106 static const arch_irn_handler_t abi_irn_handler;
109 _ ____ ___ ____ _ _ _ _
110 / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____
111 / _ \ | _ \| | | | / _` | | | '_ \ / _` |/ __| |/ / __|
112 / ___ \| |_) | | | |__| (_| | | | |_) | (_| | (__| <\__ \
113 /_/ \_\____/___| \____\__,_|_|_|_.__/ \__,_|\___|_|\_\___/
115 These callbacks are used by the backend to set the parameters
116 for a specific call type.
119 static int cmp_call_arg(const void *a, const void *b, size_t n)
121 const be_abi_call_arg_t *p = a, *q = b;
122 return !(p->is_res == q->is_res && p->pos == q->pos);
125 static be_abi_call_arg_t *get_or_set_call_arg(be_abi_call_t *call, int is_res, int pos, int do_insert)
127 be_abi_call_arg_t arg;
130 memset(&arg, 0, sizeof(arg));
134 hash = is_res * 100 + pos;
137 ? set_insert(call->params, &arg, sizeof(arg), hash)
138 : set_find(call->params, &arg, sizeof(arg), hash);
141 static INLINE be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos)
143 return get_or_set_call_arg(call, is_res, pos, 0);
146 void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb)
152 void be_abi_call_param_stack(be_abi_call_t *call, int arg_pos)
154 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
158 void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
160 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1);
165 void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg)
167 be_abi_call_arg_t *arg = get_or_set_call_arg(call, 1, arg_pos, 1);
172 be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call)
177 be_abi_call_t *be_abi_call_new(void)
179 be_abi_call_t *call = malloc(sizeof(call[0]));
181 call->params = new_set(cmp_call_arg, 16);
186 void be_abi_call_free(be_abi_call_t *call)
188 del_set(call->params);
194 | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _
195 | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` |
196 | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| |
197 |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, |
200 Handling of the stack frame. It is composed of three types:
201 1) The type of the arguments which are pushed on the stack.
202 2) The "between type" which consists of stuff the call of the
203 function pushes on the stack (like the return address and
204 the old base pointer for ia32).
205 3) The Firm frame type which consists of all local variables
209 static int get_stack_entity_offset(be_stack_frame_t *frame, entity *ent, int bias)
211 type *t = get_entity_owner(ent);
212 int ofs = get_entity_offset_bytes(ent);
216 /* Find the type the entity is contained in. */
217 for(index = 0; index < N_FRAME_TYPES; ++index) {
218 if(frame->order[index] == t)
222 /* Add the size of all the types below the one of the entity to the entity's offset */
223 for(i = 0; i < index; ++i)
224 ofs += get_type_size_bytes(frame->order[i]);
226 /* correct the offset by the initial position of the frame pointer */
227 ofs -= frame->initial_offset;
229 /* correct the offset with the current bias. */
235 static entity *search_ent_with_offset(type *t, int offset)
239 for(i = 0, n = get_class_n_members(t); i < n; ++i) {
240 entity *ent = get_class_member(t, i);
241 if(get_entity_offset_bytes(ent) == offset)
248 static int stack_frame_compute_initial_offset(be_stack_frame_t *frame)
250 type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type;
251 entity *ent = search_ent_with_offset(base, 0);
252 frame->initial_offset = 0;
253 frame->initial_offset = get_stack_entity_offset(frame, ent, 0);
254 return frame->initial_offset;
257 static be_stack_frame_t *stack_frame_init(be_stack_frame_t *frame, type *args, type *between, type *locals, int stack_dir)
259 frame->arg_type = args;
260 frame->between_type = between;
261 frame->frame_type = locals;
262 frame->initial_offset = 0;
263 frame->stack_dir = stack_dir;
264 frame->order[1] = between;
267 frame->order[0] = args;
268 frame->order[2] = locals;
272 frame->order[0] = locals;
273 frame->order[2] = args;
279 static void stack_frame_dump(FILE *file, be_stack_frame_t *frame)
283 ir_fprintf(file, "initial offset: %d\n", frame->initial_offset);
284 for(j = 0; j < N_FRAME_TYPES; ++j) {
285 type *t = frame->order[j];
287 ir_fprintf(file, "type %d: %Fm size: %d\n", j, t, get_type_size_bytes(t));
288 for(i = 0, n = get_class_n_members(t); i < n; ++i) {
289 entity *ent = get_class_member(t, i);
290 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));
296 * If irn is a Sel node computing the address of an entity
297 * on the frame type return the entity, else NULL.
299 static INLINE entity *get_sel_ent(ir_node *irn)
301 if(get_irn_opcode(irn) == iro_Sel
302 && get_Sel_ptr(irn) == get_irg_frame(get_irn_irg(irn))) {
304 return get_Sel_entity(irn);
311 * Walker: Replaces Loads, Stores and Sels of frame type entities
312 * by FrameLoad, FrameStore and FrameAdress.
314 static void lower_frame_sels_walker(ir_node *irn, void *data)
317 entity *ent = get_sel_ent(irn);
320 be_abi_irg_t *env = data;
321 ir_node *bl = get_nodes_block(irn);
322 ir_graph *irg = get_irn_irg(bl);
323 ir_node *frame = get_irg_frame(irg);
325 nw = be_new_FrameAddr(env->isa->sp->reg_class, irg, bl, frame, ent);
332 static INLINE int is_on_stack(be_abi_call_t *call, int pos)
334 be_abi_call_arg_t *arg = get_call_arg(call, 0, pos);
335 return arg && !arg->in_reg;
345 Adjustment of the calls inside a graph.
350 * Transform a call node.
351 * @param env The ABI environment for the current irg.
352 * @param irn The call node.
353 * @param curr_sp The stack pointer node to use.
354 * @return The stack pointer after the call.
356 static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp)
358 ir_graph *irg = env->birg->irg;
359 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
360 be_abi_call_t *call = be_abi_call_new();
361 ir_type *mt = get_Call_type(irn);
362 ir_node *call_ptr = get_Call_ptr(irn);
363 int n_params = get_method_n_params(mt);
364 ir_node *curr_mem = get_Call_mem(irn);
365 ir_node *bl = get_nodes_block(irn);
366 pset *results = pset_new_ptr(8);
367 pset *caller_save = pset_new_ptr(8);
369 int stack_dir = arch_isa_stack_dir(isa);
370 const arch_register_t *sp = arch_isa_sp(isa);
371 ir_mode *mach_mode = sp->reg_class->mode;
372 struct obstack *obst = &env->obst;
373 ir_node *no_mem = get_irg_no_mem(irg);
375 ir_node *res_proj = NULL;
376 int curr_res_proj = pn_Call_max;
383 const ir_edge_t *edge;
388 /* Let the isa fill out the abi description for that call node. */
389 arch_isa_get_call_abi(isa, mt, call);
391 /* Insert code to put the stack arguments on the stack. */
392 assert(get_Call_n_params(irn) == n_params);
393 for(i = 0; i < n_params; ++i) {
394 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
397 stack_size += get_type_size_bytes(get_method_param_type(mt, i));
398 obstack_int_grow(obst, i);
402 pos = obstack_finish(obst);
404 /* Collect all arguments which are passed in registers. */
405 for(i = 0, n = get_Call_n_params(irn); i < n; ++i) {
406 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
407 if(arg && arg->in_reg) {
408 obstack_int_grow(obst, i);
412 low_args = obstack_finish(obst);
414 /* If there are some parameters which shall be passed on the stack. */
417 int do_seq = call->flags.bits.store_args_sequential;
419 /* Reverse list of stack parameters if call arguments are from left to right */
420 if(call->flags.bits.left_to_right) {
421 for(i = 0; i < n_pos / 2; ++i) {
422 int other = n_pos - i - 1;
430 * If the stack is decreasing and we do not want to store sequentially,
431 * we allocate as much space on the stack all parameters need, by
432 * moving the stack pointer along the stack's direction.
434 if(stack_dir < 0 && !do_seq) {
435 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, no_mem, stack_size, be_stack_dir_along);
438 assert(mode_is_reference(mach_mode) && "machine mode must be pointer");
439 for(i = 0; i < n_pos; ++i) {
441 ir_node *param = get_Call_param(irn, p);
442 ir_node *addr = curr_sp;
444 type *param_type = get_method_param_type(mt, p);
445 int param_size = get_type_size_bytes(param_type);
447 /* Make the expression to compute the argument's offset. */
449 addr = new_r_Const_long(irg, bl, mode_Is, curr_ofs);
450 addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode);
453 /* Insert a store for primitive arguments. */
454 if(is_atomic_type(param_type)) {
455 mem = new_r_Store(irg, bl, curr_mem, addr, param);
456 mem = new_r_Proj(irg, bl, mem, mode_M, pn_Store_M);
459 /* Make a memcopy for compound arguments. */
461 assert(mode_is_reference(get_irn_mode(param)));
462 mem = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type);
463 mem = new_r_Proj(irg, bl, mem, mode_M, pn_CopyB_M_regular);
466 obstack_ptr_grow(obst, mem);
468 curr_ofs += param_size;
471 * If we wanted to build the arguments sequentially,
472 * the stack pointer for the next must be incremented,
473 * and the memory value propagated.
477 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, no_mem, param_size, be_stack_dir_along);
482 in = (ir_node **) obstack_finish(obst);
484 /* We need the sync only, if we didn't build the stores sequentially. */
486 curr_mem = new_r_Sync(irg, bl, n_pos, in);
487 obstack_free(obst, in);
490 /* Collect caller save registers */
491 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
493 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
494 for(j = 0; j < cls->n_regs; ++j) {
495 const arch_register_t *reg = arch_register_for_index(cls, j);
496 if(arch_register_type_is(reg, caller_save))
497 pset_insert_ptr(caller_save, (void *) reg);
501 /* search the greatest result proj number */
502 foreach_out_edge(irn, edge) {
503 const ir_edge_t *res_edge;
504 ir_node *irn = get_edge_src_irn(edge);
506 if(is_Proj(irn) && get_irn_mode(irn) == mode_T) {
508 foreach_out_edge(irn, res_edge) {
510 be_abi_call_arg_t *arg;
511 ir_node *res = get_edge_src_irn(res_edge);
513 assert(is_Proj(res));
515 proj = get_Proj_proj(res);
516 arg = get_call_arg(call, 1, proj);
519 shift the proj number to the right, since we will drop the
520 unspeakable Proj_T from the Call. Therefore, all real argument
521 Proj numbers must be increased by pn_Call_max
524 set_Proj_proj(res, proj);
525 obstack_ptr_grow(obst, res);
527 if(proj > curr_res_proj)
528 curr_res_proj = proj;
530 pset_remove_ptr(caller_save, arg->reg);
531 //pmap_insert(arg_regs, arg->reg, INT_TO_PTR(proj + 1))
537 obstack_ptr_grow(obst, NULL);
538 res_projs = obstack_finish(obst);
540 /* make the back end call node and set its register requirements. */
541 for(i = 0; i < n_low_args; ++i)
542 obstack_ptr_grow(obst, get_Call_param(irn, low_args[i]));
544 in = obstack_finish(obst);
545 if(env->call->flags.bits.call_has_imm && get_irn_opcode(call_ptr) == iro_SymConst) {
546 low_call = be_new_Call(irg, bl, curr_mem, curr_sp, curr_sp, curr_res_proj, n_low_args, in);
547 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
551 low_call = be_new_Call(irg, bl, curr_mem, curr_sp, call_ptr, curr_res_proj, n_low_args, in);
553 /* Set the register classes and constraints of the Call parameters. */
554 for(i = 0; i < n_low_args; ++i) {
555 int index = low_args[i];
556 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
557 assert(arg->reg != NULL);
560 if(pmap_contains(arg_regs, (void *) arg->reg)) {
561 int out_proj_num = PTR_TO_INT(be_abi_reg_map_get(arg_regs, arg->reg)) - 1;
562 be_node_set_must_be_same(low_call, out_proj_num, low_args[i]);
567 be_set_constr_single_reg(low_call, index, arg->reg);
570 /* Set the register constraints of the results. */
571 for(i = 0; res_projs[i]; ++i) {
572 ir_node *irn = res_projs[i];
573 int proj = get_Proj_proj(irn);
575 /* Correct Proj number since it has been adjusted! (see above) */
576 const be_abi_call_arg_t *arg = get_call_arg(call, 1, proj - pn_Call_max);
579 be_set_constr_single_reg(low_call, BE_OUT_POS(proj), arg->reg);
581 obstack_free(obst, in);
582 exchange(irn, low_call);
584 /* redirect the result projs to the lowered call instead of the Proj_T */
585 for(i = 0; res_projs[i]; ++i)
586 set_Proj_pred(res_projs[i], low_call);
588 /* Make additional projs for the caller save registers
589 and the Keep node which keeps them alive. */
590 if(pset_count(caller_save) > 0) {
591 const arch_register_t *reg;
595 for(reg = pset_first(caller_save), n = 0; reg; reg = pset_next(caller_save), ++n) {
596 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode, curr_res_proj++);
598 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
599 set_irn_link(proj, (void *) reg);
600 obstack_ptr_grow(obst, proj);
603 in = (ir_node **) obstack_finish(obst);
604 keep = be_new_Keep(NULL, irg, bl, n, in);
605 for(i = 0; i < n; ++i) {
606 const arch_register_t *reg = get_irn_link(in[i]);
607 be_node_set_reg_class(keep, i, reg->reg_class);
609 obstack_free(obst, in);
612 /* Clean up the stack. */
614 ir_node *mem_proj = NULL;
616 foreach_out_edge(low_call, edge) {
617 ir_node *irn = get_edge_src_irn(edge);
618 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
625 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_Call_M);
627 /* Make a Proj for the stack pointer. */
628 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, mem_proj, stack_size, be_stack_dir_against);
631 be_abi_call_free(call);
632 obstack_free(obst, pos);
634 del_pset(caller_save);
641 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
643 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
645 if(get_Alloc_where(alloc) == stack_alloc) {
646 ir_node *bl = get_nodes_block(alloc);
647 ir_graph *irg = get_irn_irg(bl);
648 ir_node *alloc_mem = NULL;
649 ir_node *alloc_res = NULL;
651 const ir_edge_t *edge;
654 env->call->flags.bits.try_omit_fp = 0;
656 new_alloc = be_new_AddSP(env->isa->sp, irg, bl, curr_sp, get_Alloc_size(alloc));
658 foreach_out_edge(alloc, edge) {
659 ir_node *irn = get_edge_src_irn(edge);
661 assert(is_Proj(irn));
662 switch(get_Proj_proj(irn)) {
674 assert(alloc_res != NULL);
675 exchange(alloc_res, env->isa->stack_dir < 0 ? new_alloc : curr_sp);
677 if(alloc_mem != NULL)
678 exchange(alloc_mem, new_r_NoMem(irg));
687 * Walker for dependent_on().
688 * This function searches a node tgt recursively from a given node
689 * but is restricted to the given block.
690 * @return 1 if tgt was reachable from curr, 0 if not.
692 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl, unsigned long visited_nr)
696 if(get_irn_visited(curr) >= visited_nr)
699 set_irn_visited(curr, visited_nr);
700 if(get_nodes_block(curr) != bl)
706 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
707 if(check_dependence(get_irn_n(curr, i), tgt, bl, visited_nr))
715 * Check if a node is somehow data dependent on another one.
716 * both nodes must be in the same basic block.
717 * @param n1 The first node.
718 * @param n2 The second node.
719 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
721 static int dependent_on(ir_node *n1, ir_node *n2)
723 ir_node *bl = get_nodes_block(n1);
724 ir_graph *irg = get_irn_irg(bl);
725 long vis_nr = get_irg_visited(irg) + 1;
727 assert(bl == get_nodes_block(n2));
728 set_irg_visited(irg, vis_nr);
729 return check_dependence(n1, n2, bl, vis_nr);
732 static int cmp_call_dependecy(const void *c1, const void *c2)
734 ir_node *n1 = *(ir_node **) c1;
735 ir_node *n2 = *(ir_node **) c2;
738 Classical qsort() comparison function behavior:
739 0 if both elements are equal
740 1 if second is "smaller" that first
741 -1 if first is "smaller" that second
743 return n1 == n2 ? 0 : (dependent_on(n1, n2) ? -1 : 1);
746 static void link_calls_in_block_walker(ir_node *irn, void *data)
749 be_abi_irg_t *env = data;
750 ir_node *bl = get_nodes_block(irn);
751 void *save = get_irn_link(bl);
753 env->call->flags.bits.irg_is_leaf = 0;
755 set_irn_link(irn, save);
756 set_irn_link(bl, irn);
761 * Process all call nodes inside a basic block.
762 * Note that the link field of the block must contain a linked list of all
763 * Call nodes inside the block. We first order this list according to data dependency
764 * and that connect the calls together.
766 static void process_calls_in_block(ir_node *bl, void *data)
768 be_abi_irg_t *env = data;
769 ir_node *curr_sp = env->init_sp;
773 for(irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
774 obstack_ptr_grow(&env->obst, irn);
776 /* If there were call nodes in the block. */
781 nodes = obstack_finish(&env->obst);
783 /* order the call nodes according to data dependency */
784 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependecy);
786 for(i = n - 1; i >= 0; --i) {
787 ir_node *irn = nodes[i];
789 switch(get_irn_opcode(irn)) {
791 curr_sp = adjust_call(env, irn, curr_sp);
794 curr_sp = adjust_alloc(env, irn, curr_sp);
801 obstack_free(&env->obst, nodes);
803 /* Keep the last stack state in the block by tying it to Keep node */
805 be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl), bl, 1, nodes);
808 set_irn_link(bl, curr_sp);
812 * Adjust all call nodes in the graph to the ABI conventions.
814 static void process_calls(be_abi_irg_t *env)
816 ir_graph *irg = env->birg->irg;
818 env->call->flags.bits.irg_is_leaf = 1;
819 irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, env);
820 irg_block_walk_graph(irg, NULL, process_calls_in_block, env);
823 static void collect_return_walker(ir_node *irn, void *data)
825 if(get_irn_opcode(irn) == iro_Return) {
826 struct obstack *obst = data;
827 obstack_ptr_grow(obst, irn);
831 static ir_node *setup_frame(be_abi_irg_t *env)
833 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
834 const arch_register_t *sp = isa->sp;
835 const arch_register_t *bp = isa->bp;
836 be_abi_call_flags_bits_t flags = env->call->flags.bits;
837 ir_graph *irg = env->birg->irg;
838 ir_node *bl = get_irg_start_block(irg);
839 ir_node *no_mem = get_irg_no_mem(irg);
840 ir_node *old_frame = get_irg_frame(irg);
841 ir_node *stack = pmap_get(env->regs, (void *) sp);
842 ir_node *frame = pmap_get(env->regs, (void *) bp);
844 int stack_nr = get_Proj_proj(stack);
846 if(flags.try_omit_fp) {
847 stack = be_new_IncSP(sp, irg, bl, stack, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_along);
852 frame = be_new_Copy(bp->reg_class, irg, bl, stack);
854 be_node_set_flags(frame, -1, arch_irn_flags_dont_spill);
856 be_set_constr_single_reg(frame, -1, bp);
857 be_node_set_flags(frame, -1, arch_irn_flags_ignore);
858 arch_set_irn_register(env->birg->main_env->arch_env, frame, bp);
861 stack = be_new_IncSP(sp, irg, bl, stack, frame, BE_STACK_FRAME_SIZE, be_stack_dir_along);
864 be_node_set_flags(env->reg_params, -(stack_nr + 1), arch_irn_flags_ignore);
865 env->init_sp = stack;
866 set_irg_frame(irg, frame);
867 edges_reroute(old_frame, frame, irg);
872 static void clearup_frame(be_abi_irg_t *env, ir_node *ret, pmap *reg_map, struct obstack *obst)
874 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
875 const arch_register_t *sp = isa->sp;
876 const arch_register_t *bp = isa->bp;
877 ir_graph *irg = env->birg->irg;
878 ir_node *ret_mem = get_Return_mem(ret);
879 ir_node *frame = get_irg_frame(irg);
880 ir_node *bl = get_nodes_block(ret);
881 ir_node *stack = get_irn_link(bl);
885 if(env->call->flags.bits.try_omit_fp) {
886 stack = be_new_IncSP(sp, irg, bl, stack, ret_mem, BE_STACK_FRAME_SIZE, be_stack_dir_against);
890 stack = be_new_SetSP(sp, irg, bl, stack, frame, ret_mem);
891 be_set_constr_single_reg(stack, -1, sp);
892 be_node_set_flags(stack, -1, arch_irn_flags_ignore);
895 pmap_foreach(env->regs, ent) {
896 const arch_register_t *reg = ent->key;
897 ir_node *irn = ent->value;
900 obstack_ptr_grow(&env->obst, stack);
902 obstack_ptr_grow(&env->obst, frame);
903 else if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
904 obstack_ptr_grow(obst, irn);
908 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type)
910 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
911 int inc = env->birg->main_env->arch_env->isa->stack_dir * dir;
912 int n = get_method_n_params(method_type);
913 int curr = inc > 0 ? 0 : n - 1;
920 snprintf(buf, sizeof(buf), "%s_arg_type", get_entity_name(get_irg_entity(env->birg->irg)));
921 res = new_type_class(new_id_from_str(buf));
923 for(i = 0; i < n; ++i, curr += inc) {
924 type *param_type = get_method_param_type(method_type, curr);
925 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
928 snprintf(buf, sizeof(buf), "param_%d", i);
929 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
930 set_entity_offset_bytes(arg->stack_ent, ofs);
931 ofs += get_type_size_bytes(param_type);
935 set_type_size_bytes(res, ofs);
939 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
946 /* Create a Perm after the RegParams node to delimit it. */
947 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
948 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
953 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
954 const arch_register_t *reg = &cls->regs[j];
955 ir_node *irn = pmap_get(regs, (void *) reg);
957 if(irn && !arch_register_type_is(reg, ignore)) {
959 obstack_ptr_grow(&obst, irn);
960 set_irn_link(irn, (void *) reg);
964 obstack_ptr_grow(&obst, NULL);
965 in = obstack_finish(&obst);
967 perm = be_new_Perm(cls, irg, bl, n_regs, in);
968 for(j = 0; j < n_regs; ++j) {
969 ir_node *arg = in[j];
970 arch_register_t *reg = get_irn_link(arg);
971 pmap_insert(regs, reg, arg);
972 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
975 obstack_free(&obst, in);
978 obstack_free(&obst, NULL);
982 const arch_register_t *reg;
986 static int cmp_regs(const void *a, const void *b)
988 const reg_node_map_t *p = a;
989 const reg_node_map_t *q = b;
991 if(p->reg->reg_class == q->reg->reg_class)
992 return p->reg->index - q->reg->index;
994 return p->reg->reg_class - q->reg->reg_class;
997 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
1000 int n = pmap_count(reg_map);
1002 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1004 pmap_foreach(reg_map, ent) {
1005 res[i].reg = ent->key;
1006 res[i].irn = ent->value;
1010 qsort(res, n, sizeof(res[0]), cmp_regs);
1014 static void create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1016 ir_graph *irg = env->birg->irg;
1018 int n_regs = pmap_count(regs);
1023 rm = reg_map_to_arr(&env->obst, regs);
1025 for(i = 0, n = 0; i < n_regs; ++i, ++n)
1026 obstack_ptr_grow(&env->obst, rm[i].irn);
1029 obstack_ptr_grow(&env->obst, *mem);
1033 in = (ir_node **) obstack_finish(&env->obst);
1034 irn = be_new_Barrier(env->birg->irg, bl, n, in);
1035 obstack_free(&env->obst, in);
1037 for(n = 0; n < n_regs; ++n) {
1038 int pos = BE_OUT_POS(n);
1040 const arch_register_t *reg = rm[n].reg;
1042 proj = new_r_Proj(env->birg->irg, bl, irn, get_irn_mode(rm[i].irn), n);
1043 be_node_set_reg_class(irn, n, reg->reg_class);
1045 be_set_constr_single_reg(irn, n, reg);
1046 be_set_constr_single_reg(irn, pos, reg);
1047 be_node_set_reg_class(irn, pos, reg->reg_class);
1048 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1049 if(arch_register_type_is(reg, ignore))
1050 be_node_set_flags(irn, pos, arch_irn_flags_ignore);
1052 pmap_insert(regs, (void *) reg, proj);
1056 *mem = new_r_Proj(env->birg->irg, bl, irn, mode_M, n);
1059 obstack_free(&env->obst, rm);
1063 * Modify the irg itself and the frame type.
1065 static void modify_irg(be_abi_irg_t *env)
1067 firm_dbg_module_t *dbg = env->dbg;
1068 be_abi_call_t *call = env->call;
1069 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1070 const arch_register_t *sp = arch_isa_sp(isa);
1071 ir_graph *irg = env->birg->irg;
1072 ir_node *bl = get_irg_start_block(irg);
1073 ir_node *end = get_irg_end_block(irg);
1074 ir_node *arg_tuple = get_irg_args(irg);
1075 ir_node *no_mem = get_irg_no_mem(irg);
1076 ir_node *mem = get_irg_initial_mem(irg);
1077 type *method_type = get_entity_type(get_irg_entity(irg));
1078 pset *dont_save = pset_new_ptr(8);
1079 pmap *reg_proj_map = pmap_create();
1080 int n_params = get_method_n_params(method_type);
1087 const arch_register_t *fp_reg;
1088 ir_node *frame_pointer;
1089 ir_node *reg_params_bl;
1091 const ir_edge_t *edge;
1092 ir_type *arg_type, *bet_type;
1095 bitset_t *used_proj_nr;
1097 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1099 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1100 irg_walk_graph(irg, lower_frame_sels_walker, NULL, env);
1102 env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0]));
1103 env->regs = pmap_create();
1105 /* Find the maximum proj number of the argument tuple proj */
1106 foreach_out_edge(arg_tuple, edge) {
1107 ir_node *irn = get_edge_src_irn(edge);
1108 int nr = get_Proj_proj(irn);
1109 max_arg = MAX(max_arg, nr);
1111 max_arg = MAX(max_arg + 1, n_params);
1112 args = obstack_alloc(&env->obst, max_arg * sizeof(args[0]));
1113 memset(args, 0, max_arg * sizeof(args[0]));
1114 used_proj_nr = bitset_alloca(1024);
1116 /* Fill the argument vector */
1117 foreach_out_edge(arg_tuple, edge) {
1118 ir_node *irn = get_edge_src_irn(edge);
1119 int nr = get_Proj_proj(irn);
1121 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1124 arg_type = compute_arg_type(env, call, method_type);
1125 bet_type = call->cb->get_between_type(env->cb);
1126 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), isa->stack_dir);
1128 /* Count the register params and add them to the number of Projs for the RegParams node */
1129 for(i = 0; i < n_params; ++i) {
1130 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1131 if(arg->in_reg && args[i]) {
1132 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1133 assert(i == get_Proj_proj(args[i]));
1135 /* For now, associate the register with the old Proj from Start representing that argument. */
1136 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1137 bitset_set(used_proj_nr, i);
1138 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1142 /* Collect all callee-save registers */
1143 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1144 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1145 for(j = 0; j < cls->n_regs; ++j) {
1146 const arch_register_t *reg = &cls->regs[j];
1147 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1148 pmap_insert(env->regs, (void *) reg, NULL);
1152 pmap_insert(env->regs, (void *) sp, NULL);
1153 pmap_insert(env->regs, (void *) isa->bp, NULL);
1154 reg_params_bl = get_irg_start_block(irg);
1155 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1158 * make proj nodes for the callee save registers.
1159 * memorize them, since Return nodes get those as inputs.
1161 * Note, that if a register corresponds to an argument, the regs map contains
1162 * the old Proj from start for that argument.
1165 rm = reg_map_to_arr(&env->obst, env->regs);
1166 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1167 arch_register_t *reg = (void *) rm[i].reg;
1168 ir_node *arg_proj = rm[i].irn;
1170 ir_mode *mode = arg_proj ? get_irn_mode(arg_proj) : reg->reg_class->mode;
1172 int pos = BE_OUT_POS((int) nr);
1175 bitset_set(used_proj_nr, nr);
1176 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1177 pmap_insert(env->regs, (void *) reg, proj);
1178 be_set_constr_single_reg(env->reg_params, pos, reg);
1179 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1182 * If the register is an ignore register,
1183 * The Proj for that register shall also be ignored during register allocation.
1185 if(arch_register_type_is(reg, ignore))
1186 be_node_set_flags(env->reg_params, pos, arch_irn_flags_ignore);
1188 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1190 obstack_free(&env->obst, rm);
1192 /* Generate the Prologue */
1193 fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
1194 create_barrier(env, bl, &mem, env->regs, 0);
1196 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1197 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_along);
1198 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1199 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1200 frame_pointer = be_abi_reg_map_get(env->regs, sp);
1201 set_irg_frame(irg, frame_pointer);
1203 /* Now, introduce stack param nodes for all parameters passed on the stack */
1204 for(i = 0; i < max_arg; ++i) {
1205 ir_node *arg_proj = args[i];
1206 ir_node *repl = NULL;
1208 if(arg_proj != NULL) {
1209 be_abi_call_arg_t *arg;
1210 ir_type *param_type;
1211 int nr = get_Proj_proj(arg_proj);
1213 nr = MIN(nr, n_params);
1214 arg = get_call_arg(call, 0, nr);
1215 param_type = get_method_param_type(method_type, nr);
1218 repl = pmap_get(env->regs, (void *) arg->reg);
1221 else if(arg->on_stack) {
1222 /* For atomic parameters which are actually used, we create a StackParam node. */
1223 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1224 ir_mode *mode = get_type_mode(param_type);
1225 const arch_register_class_t *cls = arch_isa_get_reg_class_for_mode(isa, mode);
1226 repl = be_new_StackParam(cls, isa->bp->reg_class, irg, reg_params_bl, mode, frame_pointer, arg->stack_ent);
1229 /* The stack parameter is not primitive (it is a struct or array),
1230 we thus will create a node representing the parameter's address
1233 repl = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1237 assert(repl != NULL);
1238 edges_reroute(args[i], repl, irg);
1242 /* All Return nodes hang on the End node, so look for them there. */
1243 for(i = 0, n = get_irn_arity(end); i < n; ++i) {
1244 ir_node *irn = get_irn_n(end, i);
1246 if(get_irn_opcode(irn) == iro_Return) {
1247 ir_node *bl = get_nodes_block(irn);
1248 int n_res = get_Return_n_ress(irn);
1249 pmap *reg_map = pmap_create();
1250 ir_node *mem = get_Return_mem(irn);
1255 const arch_register_t **regs;
1257 pmap_insert(reg_map, (void *) sp, pmap_get(env->regs, (void *) sp));
1259 /* Insert results for Return into the register map. */
1260 for(i = 0; i < n_res; ++i) {
1261 ir_node *res = get_Return_res(irn, i);
1262 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1263 assert(arg->in_reg && "return value must be passed in register");
1264 pmap_insert(reg_map, (void *) arg->reg, res);
1267 /* Add uses of the callee save registers. */
1268 pmap_foreach(env->regs, ent) {
1269 const arch_register_t *reg = ent->key;
1270 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1271 pmap_insert(reg_map, ent->key, ent->value);
1274 /* Make the Epilogue node and call the arch's epilogue maker. */
1275 create_barrier(env, bl, &mem, reg_map, 1);
1276 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1279 Maximum size of the in array for Return nodes is
1280 return args + callee save/ignore registers + memory + stack pointer
1282 in_max = pmap_count(reg_map) + get_Return_n_ress(irn) + 2;
1284 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1285 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1288 in[1] = be_abi_reg_map_get(reg_map, sp);
1293 /* clear SP entry, since it has already been grown. */
1294 pmap_insert(reg_map, (void *) sp, NULL);
1295 for(i = 0; i < n_res; ++i) {
1296 ir_node *res = get_Return_res(irn, i);
1297 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1299 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1300 regs[n++] = arg->reg;
1302 /* Clear the map entry to mark the register as processed. */
1303 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1306 /* grow the rest of the stuff. */
1307 pmap_foreach(reg_map, ent) {
1310 regs[n++] = ent->key;
1314 /* The in array for the new back end return is now ready. */
1315 ret = be_new_Return(irg, bl, n, in);
1317 /* Set the register classes of the return's parameter accordingly. */
1318 for(i = 0; i < n; ++i)
1320 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1322 /* Free the space of the Epilog's in array and the register <-> proj map. */
1323 obstack_free(&env->obst, in);
1325 pmap_destroy(reg_map);
1329 obstack_free(&env->obst, args);
1333 * Walker: puts all Alloc(stack_alloc) on a obstack
1335 static void collect_alloca_walker(ir_node *irn, void *data)
1337 be_abi_irg_t *env = data;
1338 if(get_irn_opcode(irn) == iro_Alloc && get_Alloc_where(irn) == stack_alloc)
1339 obstack_ptr_grow(&env->obst, irn);
1342 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
1344 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
1345 ir_node *old_frame = get_irg_frame(birg->irg);
1346 ir_graph *irg = birg->irg;
1351 env->isa = birg->main_env->arch_env->isa;
1352 env->method_type = get_entity_type(get_irg_entity(irg));
1353 env->call = be_abi_call_new();
1354 arch_isa_get_call_abi(env->isa, env->method_type, env->call);
1356 env->dce_survivor = new_survive_dce();
1358 env->dbg = firm_dbg_register("firm.be.abi");
1359 env->stack_phis = pset_new_ptr(16);
1360 env->init_sp = dummy = new_r_Unknown(irg, env->isa->sp->reg_class->mode);
1362 env->cb = env->call->cb->init(env->call, env->isa, irg);
1364 obstack_init(&env->obst);
1366 memcpy(&env->irn_handler, &abi_irn_handler, sizeof(abi_irn_handler));
1367 env->irn_ops.impl = &abi_irn_ops;
1369 /* Lower all call nodes in the IRG. */
1372 /* Process the IRG */
1375 /* reroute the stack origin of the calls to the true stack origin. */
1376 edges_reroute(dummy, env->init_sp, irg);
1377 edges_reroute(old_frame, get_irg_frame(irg), irg);
1379 /* Make some important node pointers survive the dead node elimination. */
1380 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
1381 pmap_foreach(env->regs, ent)
1382 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
1384 arch_env_push_irn_handler(env->birg->main_env->arch_env, &env->irn_handler);
1386 env->call->cb->done(env->cb);
1391 void be_abi_free(be_abi_irg_t *env)
1393 free_survive_dce(env->dce_survivor);
1394 del_pset(env->stack_phis);
1395 pmap_destroy(env->regs);
1396 obstack_free(&env->obst, NULL);
1397 arch_env_pop_irn_handler(env->birg->main_env->arch_env);
1405 | ___(_)_ __ / ___|| |_ __ _ ___| | __
1406 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
1407 | _| | |> < ___) | || (_| | (__| <
1408 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
1412 static void collect_stack_nodes_walker(ir_node *irn, void *data)
1416 if(be_is_AddSP(irn) || be_is_IncSP(irn) || be_is_SetSP(irn))
1417 pset_insert_ptr(s, irn);
1420 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
1422 dom_front_info_t *df;
1425 /* We need dominance frontiers for fix up */
1426 df = be_compute_dominance_frontiers(env->birg->irg);
1427 stack_nodes = pset_new_ptr(16);
1428 pset_insert_ptr(stack_nodes, env->init_sp);
1429 irg_walk_graph(env->birg->irg, collect_stack_nodes_walker, NULL, stack_nodes);
1430 be_ssa_constr_set_phis(df, stack_nodes, env->stack_phis);
1431 del_pset(stack_nodes);
1433 /* Liveness could have changed due to Phi nodes. */
1434 be_liveness(env->birg->irg);
1436 /* free these dominance frontiers */
1437 be_free_dominance_frontiers(df);
1441 * Translates a direction of an IncSP node (either be_stack_dir_against, or ...along)
1442 * into -1 or 1, respectively.
1443 * @param irn The node.
1444 * @return 1, if the direction of the IncSP was along, -1 if against.
1446 static int get_dir(ir_node *irn)
1448 return 1 - 2 * (be_get_IncSP_direction(irn) == be_stack_dir_against);
1451 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
1453 const arch_env_t *aenv = env->birg->main_env->arch_env;
1455 int start_bias = bias;
1456 int omit_fp = env->call->flags.bits.try_omit_fp;
1458 sched_foreach(bl, irn) {
1461 If the node modifies the stack pointer by a constant offset,
1462 record that in the bias.
1464 if(be_is_IncSP(irn)) {
1465 int ofs = be_get_IncSP_offset(irn);
1466 int dir = get_dir(irn);
1468 if(ofs == BE_STACK_FRAME_SIZE) {
1469 ofs = get_type_size_bytes(get_irg_frame_type(env->birg->irg));
1470 be_set_IncSP_offset(irn, ofs);
1478 Else check, if the node relates to an entity on the stack frame.
1479 If so, set the true offset (including the bias) for that
1483 entity *ent = arch_get_frame_entity(aenv, irn);
1485 int offset = get_stack_entity_offset(env->frame, ent, bias);
1486 arch_set_frame_offset(aenv, irn, offset);
1487 DBG((env->dbg, LEVEL_2, "%F has offset %d\n", ent, offset));
1496 * A helper struct for the bias walker.
1499 be_abi_irg_t *env; /**< The ABI irg environment. */
1500 int start_block_bias; /**< The bias at the end of the start block. */
1503 static void stack_bias_walker(ir_node *bl, void *data)
1505 if(bl != get_irg_start_block(get_irn_irg(bl))) {
1506 struct bias_walk *bw = data;
1507 process_stack_bias(bw->env, bl, bw->start_block_bias);
1511 void be_abi_fix_stack_bias(be_abi_irg_t *env)
1513 ir_graph *irg = env->birg->irg;
1514 struct bias_walk bw;
1516 stack_frame_compute_initial_offset(env->frame);
1517 // stack_frame_dump(stdout, env->frame);
1519 /* Determine the stack bias at the and of the start block. */
1520 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0);
1522 /* fix the bias is all other blocks */
1524 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
1527 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
1529 assert(arch_register_type_is(reg, callee_save));
1530 assert(pmap_contains(abi->regs, (void *) reg));
1531 return pmap_get(abi->regs, (void *) reg);
1535 _____ _____ _ _ _ _ _ _
1536 |_ _| __ \| \ | | | | | | | | |
1537 | | | |__) | \| | | |__| | __ _ _ __ __| | | ___ _ __
1538 | | | _ /| . ` | | __ |/ _` | '_ \ / _` | |/ _ \ '__|
1539 _| |_| | \ \| |\ | | | | | (_| | | | | (_| | | __/ |
1540 |_____|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1542 for Phi nodes which are created due to stack modifying nodes
1543 such as IncSP, AddSP and SetSP.
1545 These Phis are always to be ignored by the reg alloc and are
1546 fixed on the SP register of the ISA.
1549 static const void *abi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn)
1551 const be_abi_irg_t *abi = get_abi_from_handler(handler);
1552 const void *res = NULL;
1554 if(is_Phi(irn) && pset_find_ptr(abi->stack_phis, (void *) irn))
1555 res = &abi->irn_ops;
1560 static void be_abi_limited(void *data, bitset_t *bs)
1562 be_abi_irg_t *abi = data;
1563 bitset_clear_all(bs);
1564 bitset_set(bs, abi->isa->sp->index);
1567 static const arch_register_req_t *abi_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_node *irn, int pos)
1569 be_abi_irg_t *abi = get_abi_from_ops(self);
1570 const arch_register_t *reg = abi->isa->sp;
1572 memset(req, 0, sizeof(req[0]));
1574 if(pos == BE_OUT_POS(0)) {
1575 req->cls = reg->reg_class;
1576 req->type = arch_register_req_type_limited;
1577 req->limited = be_abi_limited;
1578 req->limited_env = abi;
1581 else if(pos >= 0 && pos < get_irn_arity(irn)) {
1582 req->cls = reg->reg_class;
1583 req->type = arch_register_req_type_normal;
1589 static void abi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1593 static const arch_register_t *abi_get_irn_reg(const void *self, const ir_node *irn)
1595 const be_abi_irg_t *abi = get_abi_from_ops(self);
1596 return abi->isa->sp;
1599 static arch_irn_class_t abi_classify(const void *_self, const ir_node *irn)
1601 return arch_irn_class_normal;
1604 static arch_irn_flags_t abi_get_flags(const void *_self, const ir_node *irn)
1606 return arch_irn_flags_ignore;
1609 static entity *abi_get_frame_entity(const void *_self, const ir_node *irn)
1614 static void abi_set_stack_bias(const void *_self, ir_node *irn, int bias)
1618 static const arch_irn_ops_if_t abi_irn_ops = {
1619 abi_get_irn_reg_req,
1624 abi_get_frame_entity,
1628 static const arch_irn_handler_t abi_irn_handler = {