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))
538 obstack_ptr_grow(obst, NULL);
539 res_projs = obstack_finish(obst);
541 /* make the back end call node and set its register requirements. */
542 for(i = 0; i < n_low_args; ++i)
543 obstack_ptr_grow(obst, get_Call_param(irn, low_args[i]));
545 in = obstack_finish(obst);
547 if(env->call->flags.bits.call_has_imm && get_irn_opcode(call_ptr) == iro_SymConst) {
548 low_call = be_new_Call(irg, bl, curr_mem, curr_sp, curr_sp, curr_res_proj + pset_count(caller_save), n_low_args, in);
549 be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
553 low_call = be_new_Call(irg, bl, curr_mem, curr_sp, call_ptr, curr_res_proj + pset_count(caller_save), n_low_args, in);
555 /* Set the register classes and constraints of the Call parameters. */
556 for(i = 0; i < n_low_args; ++i) {
557 int index = low_args[i];
558 be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
559 assert(arg->reg != NULL);
561 be_set_constr_single_reg(low_call, be_pos_Call_first_arg + index, arg->reg);
564 /* Set the register constraints of the results. */
565 for(i = 0; res_projs[i]; ++i) {
566 ir_node *irn = res_projs[i];
567 int proj = get_Proj_proj(irn);
569 /* Correct Proj number since it has been adjusted! (see above) */
570 const be_abi_call_arg_t *arg = get_call_arg(call, 1, proj - pn_Call_max);
573 be_set_constr_single_reg(low_call, BE_OUT_POS(proj), arg->reg);
575 obstack_free(obst, in);
576 exchange(irn, low_call);
578 /* redirect the result projs to the lowered call instead of the Proj_T */
579 for(i = 0; res_projs[i]; ++i)
580 set_Proj_pred(res_projs[i], low_call);
582 /* Make additional projs for the caller save registers
583 and the Keep node which keeps them alive. */
584 if(pset_count(caller_save) > 0) {
585 const arch_register_t *reg;
589 for(reg = pset_first(caller_save), n = 0; reg; reg = pset_next(caller_save), ++n) {
590 ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode, curr_res_proj);
592 /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */
593 be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg);
594 set_irn_link(proj, (void *) reg);
595 obstack_ptr_grow(obst, proj);
599 in = (ir_node **) obstack_finish(obst);
600 keep = be_new_Keep(NULL, irg, bl, n, in);
601 for(i = 0; i < n; ++i) {
602 const arch_register_t *reg = get_irn_link(in[i]);
603 be_node_set_reg_class(keep, i, reg->reg_class);
605 obstack_free(obst, in);
608 /* Clean up the stack. */
610 ir_node *mem_proj = NULL;
612 foreach_out_edge(low_call, edge) {
613 ir_node *irn = get_edge_src_irn(edge);
614 if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_M) {
621 mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_Call_M);
623 /* Make a Proj for the stack pointer. */
624 curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, mem_proj, stack_size, be_stack_dir_against);
627 be_abi_call_free(call);
628 obstack_free(obst, pos);
630 del_pset(caller_save);
637 * The alloca is transformed into a back end alloca node and connected to the stack nodes.
639 static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp)
641 if(get_Alloc_where(alloc) == stack_alloc) {
642 ir_node *bl = get_nodes_block(alloc);
643 ir_graph *irg = get_irn_irg(bl);
644 ir_node *alloc_mem = NULL;
645 ir_node *alloc_res = NULL;
647 const ir_edge_t *edge;
650 env->call->flags.bits.try_omit_fp = 0;
652 new_alloc = be_new_AddSP(env->isa->sp, irg, bl, curr_sp, get_Alloc_size(alloc));
654 foreach_out_edge(alloc, edge) {
655 ir_node *irn = get_edge_src_irn(edge);
657 assert(is_Proj(irn));
658 switch(get_Proj_proj(irn)) {
670 assert(alloc_res != NULL);
671 exchange(alloc_res, env->isa->stack_dir < 0 ? new_alloc : curr_sp);
673 if(alloc_mem != NULL)
674 exchange(alloc_mem, new_r_NoMem(irg));
683 * Walker for dependent_on().
684 * This function searches a node tgt recursively from a given node
685 * but is restricted to the given block.
686 * @return 1 if tgt was reachable from curr, 0 if not.
688 static int check_dependence(ir_node *curr, ir_node *tgt, ir_node *bl, unsigned long visited_nr)
692 if(get_irn_visited(curr) >= visited_nr)
695 set_irn_visited(curr, visited_nr);
696 if(get_nodes_block(curr) != bl)
702 for(i = 0, n = get_irn_arity(curr); i < n; ++i) {
703 if(check_dependence(get_irn_n(curr, i), tgt, bl, visited_nr))
711 * Check if a node is somehow data dependent on another one.
712 * both nodes must be in the same basic block.
713 * @param n1 The first node.
714 * @param n2 The second node.
715 * @return 1, if n1 is data dependent (transitively) on n2, 0 if not.
717 static int dependent_on(ir_node *n1, ir_node *n2)
719 ir_node *bl = get_nodes_block(n1);
720 ir_graph *irg = get_irn_irg(bl);
721 long vis_nr = get_irg_visited(irg) + 1;
723 assert(bl == get_nodes_block(n2));
724 set_irg_visited(irg, vis_nr);
725 return check_dependence(n1, n2, bl, vis_nr);
728 static int cmp_call_dependecy(const void *c1, const void *c2)
730 ir_node *n1 = *(ir_node **) c1;
731 ir_node *n2 = *(ir_node **) c2;
734 Classical qsort() comparison function behavior:
735 0 if both elements are equal
736 1 if second is "smaller" that first
737 -1 if first is "smaller" that second
739 return n1 == n2 ? 0 : (dependent_on(n1, n2) ? -1 : 1);
742 static void link_calls_in_block_walker(ir_node *irn, void *data)
745 be_abi_irg_t *env = data;
746 ir_node *bl = get_nodes_block(irn);
747 void *save = get_irn_link(bl);
749 env->call->flags.bits.irg_is_leaf = 0;
751 set_irn_link(irn, save);
752 set_irn_link(bl, irn);
757 * Process all call nodes inside a basic block.
758 * Note that the link field of the block must contain a linked list of all
759 * Call nodes inside the block. We first order this list according to data dependency
760 * and that connect the calls together.
762 static void process_calls_in_block(ir_node *bl, void *data)
764 be_abi_irg_t *env = data;
765 ir_node *curr_sp = env->init_sp;
769 for(irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n)
770 obstack_ptr_grow(&env->obst, irn);
772 /* If there were call nodes in the block. */
777 nodes = obstack_finish(&env->obst);
779 /* order the call nodes according to data dependency */
780 qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependecy);
782 for(i = n - 1; i >= 0; --i) {
783 ir_node *irn = nodes[i];
785 switch(get_irn_opcode(irn)) {
787 curr_sp = adjust_call(env, irn, curr_sp);
790 curr_sp = adjust_alloc(env, irn, curr_sp);
797 obstack_free(&env->obst, nodes);
799 /* Keep the last stack state in the block by tying it to Keep node */
801 be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl), bl, 1, nodes);
804 set_irn_link(bl, curr_sp);
808 * Adjust all call nodes in the graph to the ABI conventions.
810 static void process_calls(be_abi_irg_t *env)
812 ir_graph *irg = env->birg->irg;
814 env->call->flags.bits.irg_is_leaf = 1;
815 irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, env);
816 irg_block_walk_graph(irg, NULL, process_calls_in_block, env);
819 static void collect_return_walker(ir_node *irn, void *data)
821 if(get_irn_opcode(irn) == iro_Return) {
822 struct obstack *obst = data;
823 obstack_ptr_grow(obst, irn);
827 static ir_node *setup_frame(be_abi_irg_t *env)
829 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
830 const arch_register_t *sp = isa->sp;
831 const arch_register_t *bp = isa->bp;
832 be_abi_call_flags_bits_t flags = env->call->flags.bits;
833 ir_graph *irg = env->birg->irg;
834 ir_node *bl = get_irg_start_block(irg);
835 ir_node *no_mem = get_irg_no_mem(irg);
836 ir_node *old_frame = get_irg_frame(irg);
837 ir_node *stack = pmap_get(env->regs, (void *) sp);
838 ir_node *frame = pmap_get(env->regs, (void *) bp);
840 int stack_nr = get_Proj_proj(stack);
842 if(flags.try_omit_fp) {
843 stack = be_new_IncSP(sp, irg, bl, stack, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_along);
848 frame = be_new_Copy(bp->reg_class, irg, bl, stack);
850 be_node_set_flags(frame, -1, arch_irn_flags_dont_spill);
852 be_set_constr_single_reg(frame, -1, bp);
853 be_node_set_flags(frame, -1, arch_irn_flags_ignore);
854 arch_set_irn_register(env->birg->main_env->arch_env, frame, bp);
857 stack = be_new_IncSP(sp, irg, bl, stack, frame, BE_STACK_FRAME_SIZE, be_stack_dir_along);
860 be_node_set_flags(env->reg_params, -(stack_nr + 1), arch_irn_flags_ignore);
861 env->init_sp = stack;
862 set_irg_frame(irg, frame);
863 edges_reroute(old_frame, frame, irg);
868 static void clearup_frame(be_abi_irg_t *env, ir_node *ret, pmap *reg_map, struct obstack *obst)
870 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
871 const arch_register_t *sp = isa->sp;
872 const arch_register_t *bp = isa->bp;
873 ir_graph *irg = env->birg->irg;
874 ir_node *ret_mem = get_Return_mem(ret);
875 ir_node *frame = get_irg_frame(irg);
876 ir_node *bl = get_nodes_block(ret);
877 ir_node *stack = get_irn_link(bl);
881 if(env->call->flags.bits.try_omit_fp) {
882 stack = be_new_IncSP(sp, irg, bl, stack, ret_mem, BE_STACK_FRAME_SIZE, be_stack_dir_against);
886 stack = be_new_SetSP(sp, irg, bl, stack, frame, ret_mem);
887 be_set_constr_single_reg(stack, -1, sp);
888 be_node_set_flags(stack, -1, arch_irn_flags_ignore);
891 pmap_foreach(env->regs, ent) {
892 const arch_register_t *reg = ent->key;
893 ir_node *irn = ent->value;
896 obstack_ptr_grow(&env->obst, stack);
898 obstack_ptr_grow(&env->obst, frame);
899 else if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
900 obstack_ptr_grow(obst, irn);
904 static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type)
906 int dir = env->call->flags.bits.left_to_right ? 1 : -1;
907 int inc = env->birg->main_env->arch_env->isa->stack_dir * dir;
908 int n = get_method_n_params(method_type);
909 int curr = inc > 0 ? 0 : n - 1;
916 snprintf(buf, sizeof(buf), "%s_arg_type", get_entity_name(get_irg_entity(env->birg->irg)));
917 res = new_type_class(new_id_from_str(buf));
919 for(i = 0; i < n; ++i, curr += inc) {
920 type *param_type = get_method_param_type(method_type, curr);
921 be_abi_call_arg_t *arg = get_call_arg(call, 0, curr);
924 snprintf(buf, sizeof(buf), "param_%d", i);
925 arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type);
926 set_entity_offset_bytes(arg->stack_ent, ofs);
927 ofs += get_type_size_bytes(param_type);
931 set_type_size_bytes(res, ofs);
935 static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs)
942 /* Create a Perm after the RegParams node to delimit it. */
943 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
944 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
949 for(n_regs = 0, j = 0; j < cls->n_regs; ++j) {
950 const arch_register_t *reg = &cls->regs[j];
951 ir_node *irn = pmap_get(regs, (void *) reg);
953 if(irn && !arch_register_type_is(reg, ignore)) {
955 obstack_ptr_grow(&obst, irn);
956 set_irn_link(irn, (void *) reg);
960 obstack_ptr_grow(&obst, NULL);
961 in = obstack_finish(&obst);
963 perm = be_new_Perm(cls, irg, bl, n_regs, in);
964 for(j = 0; j < n_regs; ++j) {
965 ir_node *arg = in[j];
966 arch_register_t *reg = get_irn_link(arg);
967 pmap_insert(regs, reg, arg);
968 be_set_constr_single_reg(perm, BE_OUT_POS(j), reg);
971 obstack_free(&obst, in);
974 obstack_free(&obst, NULL);
978 const arch_register_t *reg;
982 static int cmp_regs(const void *a, const void *b)
984 const reg_node_map_t *p = a;
985 const reg_node_map_t *q = b;
987 if(p->reg->reg_class == q->reg->reg_class)
988 return p->reg->index - q->reg->index;
990 return p->reg->reg_class - q->reg->reg_class;
993 static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map)
996 int n = pmap_count(reg_map);
998 reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0]));
1000 pmap_foreach(reg_map, ent) {
1001 res[i].reg = ent->key;
1002 res[i].irn = ent->value;
1006 qsort(res, n, sizeof(res[0]), cmp_regs);
1010 static void create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req)
1012 ir_graph *irg = env->birg->irg;
1014 int n_regs = pmap_count(regs);
1019 rm = reg_map_to_arr(&env->obst, regs);
1021 for(i = 0, n = 0; i < n_regs; ++i, ++n)
1022 obstack_ptr_grow(&env->obst, rm[i].irn);
1025 obstack_ptr_grow(&env->obst, *mem);
1029 in = (ir_node **) obstack_finish(&env->obst);
1030 irn = be_new_Barrier(env->birg->irg, bl, n, in);
1031 obstack_free(&env->obst, in);
1033 for(n = 0; n < n_regs; ++n) {
1034 int pos = BE_OUT_POS(n);
1036 const arch_register_t *reg = rm[n].reg;
1038 proj = new_r_Proj(env->birg->irg, bl, irn, get_irn_mode(rm[i].irn), n);
1039 be_node_set_reg_class(irn, n, reg->reg_class);
1041 be_set_constr_single_reg(irn, n, reg);
1042 be_set_constr_single_reg(irn, pos, reg);
1043 be_node_set_reg_class(irn, pos, reg->reg_class);
1044 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1045 if(arch_register_type_is(reg, ignore))
1046 be_node_set_flags(irn, pos, arch_irn_flags_ignore);
1048 pmap_insert(regs, (void *) reg, proj);
1052 *mem = new_r_Proj(env->birg->irg, bl, irn, mode_M, n);
1055 obstack_free(&env->obst, rm);
1059 * Modify the irg itself and the frame type.
1061 static void modify_irg(be_abi_irg_t *env)
1063 firm_dbg_module_t *dbg = env->dbg;
1064 be_abi_call_t *call = env->call;
1065 const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
1066 const arch_register_t *sp = arch_isa_sp(isa);
1067 ir_graph *irg = env->birg->irg;
1068 ir_node *bl = get_irg_start_block(irg);
1069 ir_node *end = get_irg_end_block(irg);
1070 ir_node *arg_tuple = get_irg_args(irg);
1071 ir_node *no_mem = get_irg_no_mem(irg);
1072 ir_node *mem = get_irg_initial_mem(irg);
1073 type *method_type = get_entity_type(get_irg_entity(irg));
1074 pset *dont_save = pset_new_ptr(8);
1075 pmap *reg_proj_map = pmap_create();
1076 int n_params = get_method_n_params(method_type);
1083 const arch_register_t *fp_reg;
1084 ir_node *frame_pointer;
1085 ir_node *reg_params_bl;
1087 const ir_edge_t *edge;
1088 ir_type *arg_type, *bet_type;
1091 bitset_t *used_proj_nr;
1093 DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
1095 /* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
1096 irg_walk_graph(irg, lower_frame_sels_walker, NULL, env);
1098 env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0]));
1099 env->regs = pmap_create();
1101 /* Find the maximum proj number of the argument tuple proj */
1102 foreach_out_edge(arg_tuple, edge) {
1103 ir_node *irn = get_edge_src_irn(edge);
1104 int nr = get_Proj_proj(irn);
1105 max_arg = MAX(max_arg, nr);
1107 max_arg = MAX(max_arg + 1, n_params);
1108 args = obstack_alloc(&env->obst, max_arg * sizeof(args[0]));
1109 memset(args, 0, max_arg * sizeof(args[0]));
1110 used_proj_nr = bitset_alloca(1024);
1112 /* Fill the argument vector */
1113 foreach_out_edge(arg_tuple, edge) {
1114 ir_node *irn = get_edge_src_irn(edge);
1115 int nr = get_Proj_proj(irn);
1117 DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn));
1120 arg_type = compute_arg_type(env, call, method_type);
1121 bet_type = call->cb->get_between_type(env->cb);
1122 stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), isa->stack_dir);
1124 /* Count the register params and add them to the number of Projs for the RegParams node */
1125 for(i = 0; i < n_params; ++i) {
1126 be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
1127 if(arg->in_reg && args[i]) {
1128 assert(arg->reg != sp && "cannot use stack pointer as parameter register");
1129 assert(i == get_Proj_proj(args[i]));
1131 /* For now, associate the register with the old Proj from Start representing that argument. */
1132 pmap_insert(env->regs, (void *) arg->reg, args[i]);
1133 bitset_set(used_proj_nr, i);
1134 DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name));
1138 /* Collect all callee-save registers */
1139 for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
1140 const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
1141 for(j = 0; j < cls->n_regs; ++j) {
1142 const arch_register_t *reg = &cls->regs[j];
1143 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1144 pmap_insert(env->regs, (void *) reg, NULL);
1148 pmap_insert(env->regs, (void *) sp, NULL);
1149 pmap_insert(env->regs, (void *) isa->bp, NULL);
1150 reg_params_bl = get_irg_start_block(irg);
1151 env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs));
1154 * make proj nodes for the callee save registers.
1155 * memorize them, since Return nodes get those as inputs.
1157 * Note, that if a register corresponds to an argument, the regs map contains
1158 * the old Proj from start for that argument.
1161 rm = reg_map_to_arr(&env->obst, env->regs);
1162 for(i = 0, n = pmap_count(env->regs); i < n; ++i) {
1163 arch_register_t *reg = (void *) rm[i].reg;
1164 ir_node *arg_proj = rm[i].irn;
1166 ir_mode *mode = arg_proj ? get_irn_mode(arg_proj) : reg->reg_class->mode;
1168 int pos = BE_OUT_POS((int) nr);
1171 bitset_set(used_proj_nr, nr);
1172 proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr);
1173 pmap_insert(env->regs, (void *) reg, proj);
1174 be_set_constr_single_reg(env->reg_params, pos, reg);
1175 arch_set_irn_register(env->birg->main_env->arch_env, proj, reg);
1178 * If the register is an ignore register,
1179 * The Proj for that register shall also be ignored during register allocation.
1181 if(arch_register_type_is(reg, ignore))
1182 be_node_set_flags(env->reg_params, pos, arch_irn_flags_ignore);
1184 DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name));
1186 obstack_free(&env->obst, rm);
1188 /* Generate the Prologue */
1189 fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
1190 create_barrier(env, bl, &mem, env->regs, 0);
1192 env->init_sp = be_abi_reg_map_get(env->regs, sp);
1193 env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_along);
1194 arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp);
1195 be_abi_reg_map_set(env->regs, sp, env->init_sp);
1196 frame_pointer = be_abi_reg_map_get(env->regs, sp);
1197 set_irg_frame(irg, frame_pointer);
1199 /* Now, introduce stack param nodes for all parameters passed on the stack */
1200 for(i = 0; i < max_arg; ++i) {
1201 ir_node *arg_proj = args[i];
1202 ir_node *repl = NULL;
1204 if(arg_proj != NULL) {
1205 be_abi_call_arg_t *arg;
1206 ir_type *param_type;
1207 int nr = get_Proj_proj(arg_proj);
1209 nr = MIN(nr, n_params);
1210 arg = get_call_arg(call, 0, nr);
1211 param_type = get_method_param_type(method_type, nr);
1214 repl = pmap_get(env->regs, (void *) arg->reg);
1217 else if(arg->on_stack) {
1218 /* For atomic parameters which are actually used, we create a StackParam node. */
1219 if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) {
1220 ir_mode *mode = get_type_mode(param_type);
1221 const arch_register_class_t *cls = arch_isa_get_reg_class_for_mode(isa, mode);
1222 repl = be_new_StackParam(cls, isa->bp->reg_class, irg, reg_params_bl, mode, frame_pointer, arg->stack_ent);
1225 /* The stack parameter is not primitive (it is a struct or array),
1226 we thus will create a node representing the parameter's address
1229 repl = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
1233 assert(repl != NULL);
1234 edges_reroute(args[i], repl, irg);
1238 /* All Return nodes hang on the End node, so look for them there. */
1239 for(i = 0, n = get_irn_arity(end); i < n; ++i) {
1240 ir_node *irn = get_irn_n(end, i);
1242 if(get_irn_opcode(irn) == iro_Return) {
1243 ir_node *bl = get_nodes_block(irn);
1244 int n_res = get_Return_n_ress(irn);
1245 pmap *reg_map = pmap_create();
1246 ir_node *mem = get_Return_mem(irn);
1251 const arch_register_t **regs;
1253 pmap_insert(reg_map, (void *) sp, pmap_get(env->regs, (void *) sp));
1255 /* Insert results for Return into the register map. */
1256 for(i = 0; i < n_res; ++i) {
1257 ir_node *res = get_Return_res(irn, i);
1258 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1259 assert(arg->in_reg && "return value must be passed in register");
1260 pmap_insert(reg_map, (void *) arg->reg, res);
1263 /* Add uses of the callee save registers. */
1264 pmap_foreach(env->regs, ent) {
1265 const arch_register_t *reg = ent->key;
1266 if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore))
1267 pmap_insert(reg_map, ent->key, ent->value);
1270 /* Make the Epilogue node and call the arch's epilogue maker. */
1271 create_barrier(env, bl, &mem, reg_map, 1);
1272 call->cb->epilogue(env->cb, bl, &mem, reg_map);
1275 Maximum size of the in array for Return nodes is
1276 return args + callee save/ignore registers + memory + stack pointer
1278 in_max = pmap_count(reg_map) + get_Return_n_ress(irn) + 2;
1280 in = obstack_alloc(&env->obst, in_max * sizeof(in[0]));
1281 regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0]));
1284 in[1] = be_abi_reg_map_get(reg_map, sp);
1289 /* clear SP entry, since it has already been grown. */
1290 pmap_insert(reg_map, (void *) sp, NULL);
1291 for(i = 0; i < n_res; ++i) {
1292 ir_node *res = get_Return_res(irn, i);
1293 be_abi_call_arg_t *arg = get_call_arg(call, 1, i);
1295 in[n] = be_abi_reg_map_get(reg_map, arg->reg);
1296 regs[n++] = arg->reg;
1298 /* Clear the map entry to mark the register as processed. */
1299 be_abi_reg_map_set(reg_map, arg->reg, NULL);
1302 /* grow the rest of the stuff. */
1303 pmap_foreach(reg_map, ent) {
1306 regs[n++] = ent->key;
1310 /* The in array for the new back end return is now ready. */
1311 ret = be_new_Return(irg, bl, n, in);
1313 /* Set the register classes of the return's parameter accordingly. */
1314 for(i = 0; i < n; ++i)
1316 be_node_set_reg_class(ret, i, regs[i]->reg_class);
1318 /* Free the space of the Epilog's in array and the register <-> proj map. */
1319 obstack_free(&env->obst, in);
1321 pmap_destroy(reg_map);
1325 obstack_free(&env->obst, args);
1329 * Walker: puts all Alloc(stack_alloc) on a obstack
1331 static void collect_alloca_walker(ir_node *irn, void *data)
1333 be_abi_irg_t *env = data;
1334 if(get_irn_opcode(irn) == iro_Alloc && get_Alloc_where(irn) == stack_alloc)
1335 obstack_ptr_grow(&env->obst, irn);
1338 be_abi_irg_t *be_abi_introduce(be_irg_t *birg)
1340 be_abi_irg_t *env = xmalloc(sizeof(env[0]));
1341 ir_node *old_frame = get_irg_frame(birg->irg);
1342 ir_graph *irg = birg->irg;
1347 env->isa = birg->main_env->arch_env->isa;
1348 env->method_type = get_entity_type(get_irg_entity(irg));
1349 env->call = be_abi_call_new();
1350 arch_isa_get_call_abi(env->isa, env->method_type, env->call);
1352 env->dce_survivor = new_survive_dce();
1354 env->dbg = firm_dbg_register("firm.be.abi");
1355 env->stack_phis = pset_new_ptr(16);
1356 env->init_sp = dummy = new_r_Unknown(irg, env->isa->sp->reg_class->mode);
1358 env->cb = env->call->cb->init(env->call, env->isa, irg);
1360 obstack_init(&env->obst);
1362 memcpy(&env->irn_handler, &abi_irn_handler, sizeof(abi_irn_handler));
1363 env->irn_ops.impl = &abi_irn_ops;
1365 /* Lower all call nodes in the IRG. */
1368 /* Process the IRG */
1371 /* reroute the stack origin of the calls to the true stack origin. */
1372 edges_reroute(dummy, env->init_sp, irg);
1373 edges_reroute(old_frame, get_irg_frame(irg), irg);
1375 /* Make some important node pointers survive the dead node elimination. */
1376 survive_dce_register_irn(env->dce_survivor, &env->init_sp);
1377 pmap_foreach(env->regs, ent)
1378 survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
1380 arch_env_push_irn_handler(env->birg->main_env->arch_env, &env->irn_handler);
1382 env->call->cb->done(env->cb);
1387 void be_abi_free(be_abi_irg_t *env)
1389 free_survive_dce(env->dce_survivor);
1390 del_pset(env->stack_phis);
1391 pmap_destroy(env->regs);
1392 obstack_free(&env->obst, NULL);
1393 arch_env_pop_irn_handler(env->birg->main_env->arch_env);
1401 | ___(_)_ __ / ___|| |_ __ _ ___| | __
1402 | |_ | \ \/ / \___ \| __/ _` |/ __| |/ /
1403 | _| | |> < ___) | || (_| | (__| <
1404 |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\
1408 static void collect_stack_nodes_walker(ir_node *irn, void *data)
1412 if(be_is_AddSP(irn) || be_is_IncSP(irn) || be_is_SetSP(irn))
1413 pset_insert_ptr(s, irn);
1416 void be_abi_fix_stack_nodes(be_abi_irg_t *env)
1418 dom_front_info_t *df;
1421 /* We need dominance frontiers for fix up */
1422 df = be_compute_dominance_frontiers(env->birg->irg);
1423 stack_nodes = pset_new_ptr(16);
1424 pset_insert_ptr(stack_nodes, env->init_sp);
1425 irg_walk_graph(env->birg->irg, collect_stack_nodes_walker, NULL, stack_nodes);
1426 be_ssa_constr_set_phis(df, stack_nodes, env->stack_phis);
1427 del_pset(stack_nodes);
1429 /* Liveness could have changed due to Phi nodes. */
1430 be_liveness(env->birg->irg);
1432 /* free these dominance frontiers */
1433 be_free_dominance_frontiers(df);
1437 * Translates a direction of an IncSP node (either be_stack_dir_against, or ...along)
1438 * into -1 or 1, respectively.
1439 * @param irn The node.
1440 * @return 1, if the direction of the IncSP was along, -1 if against.
1442 static int get_dir(ir_node *irn)
1444 return 1 - 2 * (be_get_IncSP_direction(irn) == be_stack_dir_against);
1447 static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
1449 const arch_env_t *aenv = env->birg->main_env->arch_env;
1451 int start_bias = bias;
1452 int omit_fp = env->call->flags.bits.try_omit_fp;
1454 sched_foreach(bl, irn) {
1457 If the node modifies the stack pointer by a constant offset,
1458 record that in the bias.
1460 if(be_is_IncSP(irn)) {
1461 int ofs = be_get_IncSP_offset(irn);
1462 int dir = get_dir(irn);
1464 if(ofs == BE_STACK_FRAME_SIZE) {
1465 ofs = get_type_size_bytes(get_irg_frame_type(env->birg->irg));
1466 be_set_IncSP_offset(irn, ofs);
1474 Else check, if the node relates to an entity on the stack frame.
1475 If so, set the true offset (including the bias) for that
1479 entity *ent = arch_get_frame_entity(aenv, irn);
1481 int offset = get_stack_entity_offset(env->frame, ent, bias);
1482 arch_set_frame_offset(aenv, irn, offset);
1483 DBG((env->dbg, LEVEL_2, "%F has offset %d\n", ent, offset));
1492 * A helper struct for the bias walker.
1495 be_abi_irg_t *env; /**< The ABI irg environment. */
1496 int start_block_bias; /**< The bias at the end of the start block. */
1499 static void stack_bias_walker(ir_node *bl, void *data)
1501 if(bl != get_irg_start_block(get_irn_irg(bl))) {
1502 struct bias_walk *bw = data;
1503 process_stack_bias(bw->env, bl, bw->start_block_bias);
1507 void be_abi_fix_stack_bias(be_abi_irg_t *env)
1509 ir_graph *irg = env->birg->irg;
1510 struct bias_walk bw;
1512 stack_frame_compute_initial_offset(env->frame);
1513 // stack_frame_dump(stdout, env->frame);
1515 /* Determine the stack bias at the and of the start block. */
1516 bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0);
1518 /* fix the bias is all other blocks */
1520 irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw);
1523 ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg)
1525 assert(arch_register_type_is(reg, callee_save));
1526 assert(pmap_contains(abi->regs, (void *) reg));
1527 return pmap_get(abi->regs, (void *) reg);
1531 _____ _____ _ _ _ _ _ _
1532 |_ _| __ \| \ | | | | | | | | |
1533 | | | |__) | \| | | |__| | __ _ _ __ __| | | ___ _ __
1534 | | | _ /| . ` | | __ |/ _` | '_ \ / _` | |/ _ \ '__|
1535 _| |_| | \ \| |\ | | | | | (_| | | | | (_| | | __/ |
1536 |_____|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
1538 for Phi nodes which are created due to stack modifying nodes
1539 such as IncSP, AddSP and SetSP.
1541 These Phis are always to be ignored by the reg alloc and are
1542 fixed on the SP register of the ISA.
1545 static const void *abi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn)
1547 const be_abi_irg_t *abi = get_abi_from_handler(handler);
1548 const void *res = NULL;
1550 if(is_Phi(irn) && pset_find_ptr(abi->stack_phis, (void *) irn))
1551 res = &abi->irn_ops;
1556 static void be_abi_limited(void *data, bitset_t *bs)
1558 be_abi_irg_t *abi = data;
1559 bitset_clear_all(bs);
1560 bitset_set(bs, abi->isa->sp->index);
1563 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)
1565 be_abi_irg_t *abi = get_abi_from_ops(self);
1566 const arch_register_t *reg = abi->isa->sp;
1568 memset(req, 0, sizeof(req[0]));
1570 if(pos == BE_OUT_POS(0)) {
1571 req->cls = reg->reg_class;
1572 req->type = arch_register_req_type_limited;
1573 req->limited = be_abi_limited;
1574 req->limited_env = abi;
1577 else if(pos >= 0 && pos < get_irn_arity(irn)) {
1578 req->cls = reg->reg_class;
1579 req->type = arch_register_req_type_normal;
1585 static void abi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
1589 static const arch_register_t *abi_get_irn_reg(const void *self, const ir_node *irn)
1591 const be_abi_irg_t *abi = get_abi_from_ops(self);
1592 return abi->isa->sp;
1595 static arch_irn_class_t abi_classify(const void *_self, const ir_node *irn)
1597 return arch_irn_class_normal;
1600 static arch_irn_flags_t abi_get_flags(const void *_self, const ir_node *irn)
1602 return arch_irn_flags_ignore;
1605 static entity *abi_get_frame_entity(const void *_self, const ir_node *irn)
1610 static void abi_set_stack_bias(const void *_self, ir_node *irn, int bias)
1614 static const arch_irn_ops_if_t abi_irn_ops = {
1615 abi_get_irn_reg_req,
1620 abi_get_frame_entity,
1624 static const arch_irn_handler_t abi_irn_handler = {