X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeabi.c;h=9adfeddddc7f7d5acb3ed7e04202968941c3b639;hb=b7aa66eb5b4b4668d2b009020d3ee9be9bdaf56c;hp=07b0a20335a5fa5277e610b1f4eac4939b739dfd;hpb=388e5dc18ade61c5a1699b51839a6f5ede954436;p=libfirm diff --git a/ir/be/beabi.c b/ir/be/beabi.c index 07b0a2033..9adfedddd 100644 --- a/ir/be/beabi.c +++ b/ir/be/beabi.c @@ -2,16 +2,19 @@ * ABI lowering. * * @author Sebastian Hack - * @date 7.3.2005 + * @date 7.3.2005 + * @cvsid $Id$ */ #ifdef HAVE_CONFIG_H # include "config.h" #endif + #include "obst.h" +#include "offset.h" #include "type.h" -#include "survive_dce.h" +#include "irgopt.h" #include "irgraph_t.h" #include "irnode_t.h" @@ -20,59 +23,68 @@ #include "irgmod.h" #include "irgwalk.h" #include "irprintf_t.h" +#include "irgopt.h" #include "be.h" #include "beabi.h" #include "bearch.h" #include "benode_t.h" +#include "belive_t.h" #include "besched_t.h" #define MAX(x, y) ((x) > (y) ? (x) : (y)) #define MIN(x, y) ((x) < (y) ? (x) : (y)) typedef struct _be_abi_call_arg_t { - unsigned is_res : 1; - unsigned in_reg : 1; + unsigned is_res : 1; /**< 1: the call argument is a return value. 0: it's a call parameter. */ + unsigned in_reg : 1; /**< 1: this argument is transmitted in registers. */ + unsigned on_stack : 1; /**< 1: this argument is transmitted on the stack. */ int pos; const arch_register_t *reg; entity *stack_ent; + unsigned alignment; + unsigned space_before; + unsigned space_after; } be_abi_call_arg_t; struct _be_abi_call_t { be_abi_call_flags_t flags; - type *between_type; + const be_abi_callbacks_t *cb; + ir_type *between_type; set *params; }; #define N_FRAME_TYPES 3 -typedef struct _be_stack_frame_t { - type *arg_type; - type *between_type; - type *frame_type; +/** + * This type describes the stack layout. + * The stack is divided into 3 parts: + * - arg_type: A struct type describing the stack arguments and it's order. + * - between_type: A struct type describing the stack layout between arguments + * and frame type + * - frame_type: A class type descibing the frame layout + */ +typedef struct _be_stack_layout_t { + ir_type *arg_type; /**< A type describing the stack argument layout. */ + ir_type *between_type; /**< A type describing the "between" layout. */ + ir_type *frame_type; /**< The frame type. */ - type *order[N_FRAME_TYPES]; /**< arg, between and frame types ordered. */ + ir_type *order[N_FRAME_TYPES]; /**< arg, between and frame types ordered. */ int initial_offset; - int stack_dir; -} be_stack_frame_t; - -struct _be_stack_slot_t { - struct _be_stack_frame_t *frame; - entity *ent; -}; + int stack_dir; /**< -1 for decreasing, 1 for increasing. */ +} be_stack_layout_t; struct _be_abi_irg_t { struct obstack obst; - firm_dbg_module_t *dbg; /**< The debugging module. */ - be_stack_frame_t *frame; /**< The stack frame model. */ + be_stack_layout_t *frame; /**< The stack frame model. */ const be_irg_t *birg; /**< The back end IRG. */ const arch_isa_t *isa; /**< The isa. */ survive_dce_t *dce_survivor; be_abi_call_t *call; /**< The ABI call information. */ - type *method_type; /**< The type of the method of the IRG. */ + ir_type *method_type; /**< The type of the method of the IRG. */ ir_node *init_sp; /**< The node representing the stack pointer at the start of the function. */ @@ -86,19 +98,26 @@ struct _be_abi_irg_t { int start_block_bias; /**< The stack bias at the end of the start block. */ + void *cb; /**< ABI Callback self pointer. */ + + pmap *keep_map; /**< mapping blocks to keep nodes. */ + pset *ignore_regs; /**< Additional registers which shall be ignored. */ + arch_irn_handler_t irn_handler; arch_irn_ops_t irn_ops; + DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< The debugging module. */ }; -#define abi_offset_of(type,member) ((char *) &(((type *) 0)->member) - (char *) 0) -#define abi_get_relative(ptr, member) ((void *) ((char *) (ptr) - abi_offset_of(be_abi_irg_t, member))) -#define get_abi_from_handler(ptr) abi_get_relative(ptr, irn_handler) -#define get_abi_from_ops(ptr) abi_get_relative(ptr, irn_ops) +#define get_abi_from_handler(ptr) firm_container_of(ptr, be_abi_irg_t, irn_handler) +#define get_abi_from_ops(ptr) firm_container_of(ptr, be_abi_irg_t, irn_ops) /* Forward, since be need it in be_abi_introduce(). */ static const arch_irn_ops_if_t abi_irn_ops; static const arch_irn_handler_t abi_irn_handler; +/* Flag: if set, try to omit the frame pointer if called by the backend */ +int be_omit_fp = 1; + /* _ ____ ___ ____ _ _ _ _ / \ | __ )_ _| / ___|__ _| | | |__ __ _ ___| | _____ @@ -110,41 +129,66 @@ static const arch_irn_handler_t abi_irn_handler; for a specific call type. */ +/** + * Set compare function: compares two ABI call object arguments. + */ static int cmp_call_arg(const void *a, const void *b, size_t n) { const be_abi_call_arg_t *p = a, *q = b; return !(p->is_res == q->is_res && p->pos == q->pos); } +/** + * Get or set an ABI call object argument. + * + * @param call the abi call + * @param is_res true for call results, false for call arguments + * @param pos position of the argument + * @param do_insert true if the argument is set, false if it's retrieved + */ static be_abi_call_arg_t *get_or_set_call_arg(be_abi_call_t *call, int is_res, int pos, int do_insert) { be_abi_call_arg_t arg; unsigned hash; + memset(&arg, 0, sizeof(arg)); arg.is_res = is_res; arg.pos = pos; - hash = is_res * 100 + pos; + hash = is_res * 128 + pos; return do_insert ? set_insert(call->params, &arg, sizeof(arg), hash) : set_find(call->params, &arg, sizeof(arg), hash); } +/** + * Retrieve an ABI call object argument. + * + * @param call the ABI call object + * @param is_res true for call results, false for call arguments + * @param pos position of the argument + */ static INLINE be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos) { return get_or_set_call_arg(call, is_res, pos, 0); } -void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, ir_type *between_type) +/* Set the flags for a call. */ +void be_abi_call_set_flags(be_abi_call_t *call, be_abi_call_flags_t flags, const be_abi_callbacks_t *cb) { - call->flags = flags; - call->between_type = between_type; + call->flags = flags; + call->cb = cb; } -void be_abi_call_param_stack(be_abi_call_t *call, int arg_pos) +void be_abi_call_param_stack(be_abi_call_t *call, int arg_pos, unsigned alignment, unsigned space_before, unsigned space_after) { be_abi_call_arg_t *arg = get_or_set_call_arg(call, 0, arg_pos, 1); + arg->on_stack = 1; + arg->alignment = alignment; + arg->space_before = space_before; + arg->space_after = space_after; + assert(alignment > 0 && "Alignment must be greater than 0"); } void be_abi_call_param_reg(be_abi_call_t *call, int arg_pos, const arch_register_t *reg) @@ -161,15 +205,32 @@ void be_abi_call_res_reg(be_abi_call_t *call, int arg_pos, const arch_register_t arg->reg = reg; } -be_abi_call_t *be_abi_call_new(void) +/* Get the flags of a ABI call object. */ +be_abi_call_flags_t be_abi_call_get_flags(const be_abi_call_t *call) { - be_abi_call_t *call = malloc(sizeof(call[0])); - call->flags.val = 0; - call->params = new_set(cmp_call_arg, 16); + return call->flags; +} + +/** + * Constructor for a new ABI call object. + * + * @return the new ABI call object + */ +static be_abi_call_t *be_abi_call_new() +{ + be_abi_call_t *call = xmalloc(sizeof(call[0])); + call->flags.val = 0; + call->params = new_set(cmp_call_arg, 16); + call->cb = NULL; + + call->flags.bits.try_omit_fp = be_omit_fp; return call; } -void be_abi_call_free(be_abi_call_t *call) +/** + * Destructor for an ABI call object. + */ +static void be_abi_call_free(be_abi_call_t *call) { del_set(call->params); free(call); @@ -192,10 +253,10 @@ void be_abi_call_free(be_abi_call_t *call) and the spills. */ -static int get_stack_entity_offset(be_stack_frame_t *frame, entity *ent, int bias) +static int get_stack_entity_offset(be_stack_layout_t *frame, entity *ent, int bias) { - type *t = get_entity_owner(ent); - int ofs = get_entity_offset_bytes(ent); + ir_type *t = get_entity_owner(ent); + int ofs = get_entity_offset_bytes(ent); int i, index; @@ -218,12 +279,15 @@ static int get_stack_entity_offset(be_stack_frame_t *frame, entity *ent, int bia return ofs; } -static entity *search_ent_with_offset(type *t, int offset) +/** + * Retrieve the entity with given offset from a frame type. + */ +static entity *search_ent_with_offset(ir_type *t, int offset) { int i, n; - for(i = 0, n = get_class_n_members(t); i < n; ++i) { - entity *ent = get_class_member(t, i); + for(i = 0, n = get_compound_n_members(t); i < n; ++i) { + entity *ent = get_compound_member(t, i); if(get_entity_offset_bytes(ent) == offset) return ent; } @@ -231,16 +295,28 @@ static entity *search_ent_with_offset(type *t, int offset) return NULL; } -static int stack_frame_compute_initial_offset(be_stack_frame_t *frame) +static int stack_frame_compute_initial_offset(be_stack_layout_t *frame) { - type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type; - entity *ent = search_ent_with_offset(base, 0); + ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type; + entity *ent = search_ent_with_offset(base, 0); frame->initial_offset = 0; frame->initial_offset = get_stack_entity_offset(frame, ent, 0); return frame->initial_offset; } -static be_stack_frame_t *stack_frame_init(be_stack_frame_t *frame, type *args, type *between, type *locals, int stack_dir) +/** + * Initializes the frame layout from parts + * + * @param frame the stack layout that will be initialized + * @param args the stack argument layout type + * @param between the between layout type + * @param locals the method frame type + * @param stack_dir the stack direction + * + * @return the initialized stack layout + */ +static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *args, + ir_type *between, ir_type *locals, int stack_dir) { frame->arg_type = args; frame->between_type = between; @@ -253,91 +329,57 @@ static be_stack_frame_t *stack_frame_init(be_stack_frame_t *frame, type *args, t frame->order[0] = args; frame->order[2] = locals; } - else { frame->order[0] = locals; frame->order[2] = args; } - return frame; } -static void stack_frame_dump(FILE *file, be_stack_frame_t *frame) +/** Dumps the stack layout to file. */ +static void stack_layout_dump(FILE *file, be_stack_layout_t *frame) { int i, j, n; ir_fprintf(file, "initial offset: %d\n", frame->initial_offset); - for(j = 0; j < N_FRAME_TYPES; ++j) { - type *t = frame->order[j]; + for (j = 0; j < N_FRAME_TYPES; ++j) { + ir_type *t = frame->order[j]; - ir_fprintf(file, "type %d: %Fm size: %d\n", j, t, get_type_size_bytes(t)); - for(i = 0, n = get_class_n_members(t); i < n; ++i) { - entity *ent = get_class_member(t, i); + ir_fprintf(file, "type %d: %F size: %d\n", j, t, get_type_size_bytes(t)); + for (i = 0, n = get_compound_n_members(t); i < n; ++i) { + entity *ent = get_compound_member(t, i); 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)); } } } /** - * If irn is a Sel node computing the address of an entity - * on the frame type return the entity, else NULL. - */ -static INLINE entity *get_sel_ent(ir_node *irn) -{ - if(get_irn_opcode(irn) == iro_Sel - && get_Sel_ptr(irn) == get_irg_frame(get_irn_irg(irn))) { - - return get_Sel_entity(irn); - } - - return NULL; -} - -/** - * Walker: Replaces Loads, Stores and Sels of frame type entities - * by FrameLoad, FrameStore and FrameAdress. + * Walker: Replaces Sels of frame type and + * value param type entities by FrameAddress. */ static void lower_frame_sels_walker(ir_node *irn, void *data) { - const arch_register_class_t *cls; - be_abi_irg_t *env = data; - const arch_isa_t *isa = env->birg->main_env->arch_env->isa; - ir_graph *irg = get_irn_irg(irn); - ir_node *frame = get_irg_frame(irg); - ir_node *nw = NULL; - opcode opc = get_irn_opcode(irn); - - if(opc == iro_Load) { - ir_node *bl = get_nodes_block(irn); - ir_node *sel = get_Load_ptr(irn); - entity *ent = get_sel_ent(sel); - cls = arch_isa_get_reg_class_for_mode(isa, get_Load_mode(irn)); - if(ent != NULL) - nw = be_new_FrameLoad(isa->sp->reg_class, cls, irg, bl, get_Load_mem(irn), frame, ent); - } - - else if(opc == iro_Store) { - ir_node *bl = get_nodes_block(irn); - ir_node *val = get_Store_value(irn); - ir_node *sel = get_Store_ptr(irn); - entity *ent = get_sel_ent(sel); - cls = arch_isa_get_reg_class_for_mode(isa, get_irn_mode(val)); - if(ent != NULL) - nw = be_new_FrameStore(isa->sp->reg_class, cls, irg, bl, get_Store_mem(irn), frame, val, ent); - } - - else { - entity *ent = get_sel_ent(irn); - if(ent != NULL) { - ir_node *bl = get_nodes_block(irn); - nw = be_new_FrameAddr(isa->sp->reg_class, irg, bl, frame, ent); + if (is_Sel(irn)) { + be_abi_irg_t *env = data; + ir_graph *irg = current_ir_graph; + ir_node *frame = get_irg_frame(irg); + ir_node *ptr = get_Sel_ptr(irn); + + if (ptr == frame || ptr == get_irg_value_param_base(irg)) { + entity *ent = get_Sel_entity(irn); + ir_node *bl = get_nodes_block(irn); + ir_node *nw; + + nw = be_new_FrameAddr(env->isa->sp->reg_class, irg, bl, frame, ent); + exchange(irn, nw); } } - - if(nw != NULL) - exchange(irn, nw); } +/** + * Returns non-zero if the call argument at given position + * is transfered on the stack. + */ static INLINE int is_on_stack(be_abi_call_t *call, int pos) { be_abi_call_arg_t *arg = get_call_arg(call, 0, pos); @@ -380,6 +422,7 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) ir_mode *mach_mode = sp->reg_class->mode; struct obstack *obst = &env->obst; ir_node *no_mem = get_irg_no_mem(irg); + int no_alloc = call->flags.bits.frame_is_setup_on_call; ir_node *res_proj = NULL; int curr_res_proj = pn_Call_max; @@ -402,8 +445,11 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) for(i = 0; i < n_params; ++i) { be_abi_call_arg_t *arg = get_call_arg(call, 0, i); assert(arg); - if(!arg->in_reg) { + if(arg->on_stack) { + stack_size += arg->space_before; + stack_size = round_up2(stack_size, arg->alignment); stack_size += get_type_size_bytes(get_method_param_type(mt, i)); + stack_size += arg->space_after; obstack_int_grow(obst, i); n_pos++; } @@ -423,11 +469,15 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) /* If there are some parameters which shall be passed on the stack. */ if(n_pos > 0) { int curr_ofs = 0; - int do_seq = call->flags.bits.store_args_sequential; + int do_seq = call->flags.bits.store_args_sequential && !no_alloc; - /* Reverse list of stack parameters if call arguments are from left to right */ - if(call->flags.bits.left_to_right) { - for(i = 0; i < n_pos / 2; ++i) { + /* + * Reverse list of stack parameters if call arguments are from left to right. + * We must them reverse again in they are pushed (not stored) and the stack + * direction is downwards. + */ + if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) { + for(i = 0; i < n_pos >> 1; ++i) { int other = n_pos - i - 1; int tmp = pos[i]; pos[i] = pos[other]; @@ -437,55 +487,64 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) /* * If the stack is decreasing and we do not want to store sequentially, + * or someone else allocated the call frame * we allocate as much space on the stack all parameters need, by * moving the stack pointer along the stack's direction. */ - if(stack_dir < 0 && !do_seq) { - curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, no_mem, stack_size, be_stack_dir_along); + if(stack_dir < 0 && !do_seq && !no_alloc) { + curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, no_mem, stack_size, be_stack_dir_expand); } assert(mode_is_reference(mach_mode) && "machine mode must be pointer"); for(i = 0; i < n_pos; ++i) { - int p = pos[i]; - ir_node *param = get_Call_param(irn, p); - ir_node *addr = curr_sp; - ir_node *mem = NULL; - type *param_type = get_method_param_type(mt, p); - int param_size = get_type_size_bytes(param_type); - - /* Make the expression to compute the argument's offset. */ - if(curr_ofs > 0) { - addr = new_r_Const_long(irg, bl, mode_Is, curr_ofs); - addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode); + int p = pos[i]; + be_abi_call_arg_t *arg = get_call_arg(call, 0, p); + ir_node *param = get_Call_param(irn, p); + ir_node *addr = curr_sp; + ir_node *mem = NULL; + ir_type *param_type = get_method_param_type(mt, p); + int param_size = get_type_size_bytes(param_type) + arg->space_after; + + /* + * If we wanted to build the arguments sequentially, + * the stack pointer for the next must be incremented, + * and the memory value propagated. + */ + if (do_seq) { + curr_ofs = 0; + addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, curr_mem, + param_size + arg->space_before, be_stack_dir_expand); + } + else { + curr_ofs += arg->space_before; + curr_ofs = round_up2(curr_ofs, arg->alignment); + + /* Make the expression to compute the argument's offset. */ + if(curr_ofs > 0) { + addr = new_r_Const_long(irg, bl, mode_Is, curr_ofs); + addr = new_r_Add(irg, bl, curr_sp, addr, mach_mode); + } } /* Insert a store for primitive arguments. */ - if(is_atomic_type(param_type)) { + if (is_atomic_type(param_type)) { mem = new_r_Store(irg, bl, curr_mem, addr, param); mem = new_r_Proj(irg, bl, mem, mode_M, pn_Store_M); } - /* Make a memcopy for compound arguments. */ + /* Make a mem copy for compound arguments. */ else { assert(mode_is_reference(get_irn_mode(param))); mem = new_r_CopyB(irg, bl, curr_mem, addr, param, param_type); mem = new_r_Proj(irg, bl, mem, mode_M, pn_CopyB_M_regular); } - obstack_ptr_grow(obst, mem); - curr_ofs += param_size; - /* - * If we wanted to build the arguments sequentially, - * the stack pointer for the next must be incremented, - * and the memory value propagated. - */ - if(do_seq) { - curr_ofs = 0; - curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, no_mem, param_size, be_stack_dir_along); + if (do_seq) curr_mem = mem; - } + else + obstack_ptr_grow(obst, mem); } in = (ir_node **) obstack_finish(obst); @@ -508,11 +567,20 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) } /* search the greatest result proj number */ + + /* TODO: what if the result is NOT used? Currently there is + * no way to detect this later, especially there is no way to + * see this in the proj numbers. + * While this is ok for the register allocator, it is bad for + * backends which need to change the be_Call further (x87 simulator + * for instance. However for this particular case the call_type is + * sufficient.). + */ foreach_out_edge(irn, edge) { const ir_edge_t *res_edge; ir_node *irn = get_edge_src_irn(edge); - if(is_Proj(irn) && get_irn_mode(irn) == mode_T) { + if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_T_result) { res_proj = irn; foreach_out_edge(irn, res_edge) { int proj; @@ -527,19 +595,22 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) /* shift the proj number to the right, since we will drop the unspeakable Proj_T from the Call. Therefore, all real argument - Proj numbers must be increased by pn_Call_max + Proj numbers must be increased by pn_be_Call_first_res */ - proj += pn_Call_max; + proj += pn_be_Call_first_res; set_Proj_proj(res, proj); obstack_ptr_grow(obst, res); if(proj > curr_res_proj) curr_res_proj = proj; - if(arg->in_reg) + if(arg->in_reg) { pset_remove_ptr(caller_save, arg->reg); + //pmap_insert(arg_regs, arg->reg, INT_TO_PTR(proj + 1)) + } } } } + curr_res_proj++; obstack_ptr_grow(obst, NULL); res_projs = obstack_finish(obst); @@ -549,20 +620,33 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) obstack_ptr_grow(obst, get_Call_param(irn, low_args[i])); in = obstack_finish(obst); + if(env->call->flags.bits.call_has_imm && get_irn_opcode(call_ptr) == iro_SymConst) { - low_call = be_new_Call(irg, bl, curr_mem, curr_sp, curr_sp, curr_res_proj, n_low_args, in); + low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem, curr_sp, curr_sp, + curr_res_proj + pset_count(caller_save), n_low_args, in, + get_Call_type(irn)); be_Call_set_entity(low_call, get_SymConst_entity(call_ptr)); } else - low_call = be_new_Call(irg, bl, curr_mem, curr_sp, call_ptr, curr_res_proj, n_low_args, in); + low_call = be_new_Call(get_irn_dbg_info(irn), irg, bl, curr_mem, curr_sp, call_ptr, + curr_res_proj + pset_count(caller_save), n_low_args, in, + get_Call_type(irn)); + + /* + TODO: + Set the register class of the call address to the same as the stack pointer's. + That' probably buggy for some architectures. + */ + be_node_set_reg_class(low_call, be_pos_Call_ptr, sp->reg_class); /* Set the register classes and constraints of the Call parameters. */ for(i = 0; i < n_low_args; ++i) { int index = low_args[i]; be_abi_call_arg_t *arg = get_call_arg(call, 0, index); assert(arg->reg != NULL); - be_set_constr_single_reg(low_call, index, arg->reg); + + be_set_constr_single_reg(low_call, be_pos_Call_first_arg + index, arg->reg); } /* Set the register constraints of the results. */ @@ -591,11 +675,13 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) int i, n; for(reg = pset_first(caller_save), n = 0; reg; reg = pset_next(caller_save), ++n) { - ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode, curr_res_proj++); + ir_node *proj = new_r_Proj(irg, bl, low_call, reg->reg_class->mode, curr_res_proj); /* memorize the register in the link field. we need afterwards to set the register class of the keep correctly. */ + be_set_constr_single_reg(low_call, BE_OUT_POS(curr_res_proj), reg); set_irn_link(proj, (void *) reg); obstack_ptr_grow(obst, proj); + curr_res_proj++; } in = (ir_node **) obstack_finish(obst); @@ -622,8 +708,9 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) if(!mem_proj) mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_Call_M); - /* Make a Proj for the stack pointer. */ - curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, mem_proj, stack_size, be_stack_dir_against); + /* Clean up the stack frame if we allocated it */ + if(!no_alloc) + curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, mem_proj, stack_size, be_stack_dir_shrink); } be_abi_call_free(call); @@ -640,15 +727,50 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) */ static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp) { - if(get_Alloc_where(alloc) == stack_alloc) { + if (get_Alloc_where(alloc) == stack_alloc) { + ir_node *bl = get_nodes_block(alloc); + ir_graph *irg = get_irn_irg(bl); + ir_node *alloc_mem = NULL; + ir_node *alloc_res = NULL; + + const ir_edge_t *edge; ir_node *new_alloc; - ir_node *bl = get_nodes_block(alloc); - ir_graph *irg = get_irn_irg(bl); + foreach_out_edge(alloc, edge) { + ir_node *irn = get_edge_src_irn(edge); - new_alloc = be_new_Alloca(env->isa->sp, irg, bl, get_Alloc_mem(alloc), curr_sp, get_Alloc_size(alloc)); - exchange(alloc, new_alloc); - curr_sp = new_r_Proj(irg, bl, new_alloc, mode_P, pn_Alloc_res); + assert(is_Proj(irn)); + switch(get_Proj_proj(irn)) { + case pn_Alloc_M: + alloc_mem = irn; + break; + case pn_Alloc_res: + alloc_res = irn; + break; + default: + break; + } + } + + /* Beware: currently Alloc nodes without a result might happen, + only escape analysis kills them and this phase runs only for object + oriented source. We kill the Alloc here. */ + if (alloc_res == NULL) { + exchange(alloc_mem, get_Alloc_mem(alloc)); + return curr_sp; + } + + /* The stack pointer will be modified in an unknown manner. + We cannot omit it. */ + env->call->flags.bits.try_omit_fp = 0; + new_alloc = be_new_AddSP(env->isa->sp, irg, bl, curr_sp, get_Alloc_size(alloc)); + + exchange(alloc_res, env->isa->stack_dir < 0 ? new_alloc : curr_sp); + + if(alloc_mem != NULL) + exchange(alloc_mem, new_r_NoMem(irg)); + + curr_sp = new_alloc; } return curr_sp; @@ -714,11 +836,17 @@ static int cmp_call_dependecy(const void *c1, const void *c2) return n1 == n2 ? 0 : (dependent_on(n1, n2) ? -1 : 1); } +/** + * Walker: links all Call nodes to the Block they are contained. + */ static void link_calls_in_block_walker(ir_node *irn, void *data) { if(is_Call(irn)) { - ir_node *bl = get_nodes_block(irn); - void *save = get_irn_link(bl); + be_abi_irg_t *env = data; + ir_node *bl = get_nodes_block(irn); + void *save = get_irn_link(bl); + + env->call->flags.bits.irg_is_leaf = 0; set_irn_link(irn, save); set_irn_link(bl, irn); @@ -726,9 +854,10 @@ static void link_calls_in_block_walker(ir_node *irn, void *data) } /** - * Process all call nodes inside a basic block. + * Block-walker: + * Process all Call nodes inside a basic block. * Note that the link field of the block must contain a linked list of all - * Call nodes inside the block. We first order this list according to data dependency + * Call nodes inside the Block. We first order this list according to data dependency * and that connect the calls together. */ static void process_calls_in_block(ir_node *bl, void *data) @@ -743,6 +872,7 @@ static void process_calls_in_block(ir_node *bl, void *data) /* If there were call nodes in the block. */ if(n > 0) { + ir_node *keep; ir_node **nodes; int i; @@ -770,7 +900,8 @@ static void process_calls_in_block(ir_node *bl, void *data) /* Keep the last stack state in the block by tying it to Keep node */ nodes[0] = curr_sp; - be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl), bl, 1, nodes); + keep = be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl), bl, 1, nodes); + pmap_insert(env->keep_map, bl, keep); } set_irn_link(bl, curr_sp); @@ -783,37 +914,11 @@ static void process_calls(be_abi_irg_t *env) { ir_graph *irg = env->birg->irg; - irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, NULL); + env->call->flags.bits.irg_is_leaf = 1; + irg_walk_graph(irg, firm_clear_link, link_calls_in_block_walker, env); irg_block_walk_graph(irg, NULL, process_calls_in_block, env); } -#if 0 -/** - * Walker to implement alloca-style allocations. - * They are implemented using an add to the stack pointer - * and a copy instruction. - */ -static void implement_stack_alloc(be_abi_irg_t *env, ir_node *irn) -{ - const arch_isa_t *isa = env->birg->main_env->arch_env->isa; - ir_node *bl = get_nodes_block(irn); - ir_node *res = env->init_sp; - ir_node *size; - - assert(get_irn_opcode(irn) == iro_Alloc && get_Alloc_where(irn) == stack_alloc); - - size = get_Alloc_size(irn); - if(isa->stack_dir > 0) - res = be_new_Copy(isa->sp->reg_class, env->birg->irg, bl, res); - - res = be_new_AddSP(isa->sp, env->birg->irg, bl, res, size); - - if(isa->stack_dir < 0) - res = be_new_Copy(isa->sp->reg_class, env->birg->irg, bl, res); - -} -#endif - static void collect_return_walker(ir_node *irn, void *data) { if(get_irn_opcode(irn) == iro_Return) { @@ -822,6 +927,7 @@ static void collect_return_walker(ir_node *irn, void *data) } } +#if 0 /* static ir_node *setup_frame(be_abi_irg_t *env) { const arch_isa_t *isa = env->birg->main_env->arch_env->isa; @@ -838,7 +944,7 @@ static ir_node *setup_frame(be_abi_irg_t *env) int stack_nr = get_Proj_proj(stack); if(flags.try_omit_fp) { - stack = be_new_IncSP(sp, irg, bl, stack, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_along); + stack = be_new_IncSP(sp, irg, bl, stack, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_expand); frame = stack; } @@ -852,7 +958,7 @@ static ir_node *setup_frame(be_abi_irg_t *env) arch_set_irn_register(env->birg->main_env->arch_env, frame, bp); } - stack = be_new_IncSP(sp, irg, bl, stack, frame, BE_STACK_FRAME_SIZE, be_stack_dir_along); + stack = be_new_IncSP(sp, irg, bl, stack, frame, BE_STACK_FRAME_SIZE, be_stack_dir_expand); } be_node_set_flags(env->reg_params, -(stack_nr + 1), arch_irn_flags_ignore); @@ -863,7 +969,7 @@ static ir_node *setup_frame(be_abi_irg_t *env) return frame; } -static void clearup_frame(be_abi_irg_t *env, ir_node *ret, struct obstack *obst) +static void clearup_frame(be_abi_irg_t *env, ir_node *ret, pmap *reg_map, struct obstack *obst) { const arch_isa_t *isa = env->birg->main_env->arch_env->isa; const arch_register_t *sp = isa->sp; @@ -877,7 +983,7 @@ static void clearup_frame(be_abi_irg_t *env, ir_node *ret, struct obstack *obst) pmap_entry *ent; if(env->call->flags.bits.try_omit_fp) { - stack = be_new_IncSP(sp, irg, bl, stack, ret_mem, BE_STACK_FRAME_SIZE, be_stack_dir_against); + stack = be_new_IncSP(sp, irg, bl, stack, ret_mem, BE_STACK_FRAME_SIZE, be_stack_dir_shrink); } else { @@ -891,14 +997,27 @@ static void clearup_frame(be_abi_irg_t *env, ir_node *ret, struct obstack *obst) ir_node *irn = ent->value; if(reg == sp) - irn = stack; + obstack_ptr_grow(&env->obst, stack); else if(reg == bp) - irn = frame; - - obstack_ptr_grow(obst, irn); + obstack_ptr_grow(&env->obst, frame); + else if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore)) + obstack_ptr_grow(obst, irn); } } +*/ +#endif +/** + * Computes the stack argument layout type. + * Changes a possibly allocated value param type by moving + * entities to the stack layout type. + * + * @param env the ABI environment + * @param call the current call ABI + * @param method_type the method type + * + * @return the stack argument layout type + */ static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type *method_type) { int dir = env->call->flags.bits.left_to_right ? 1 : -1; @@ -910,55 +1029,317 @@ static ir_type *compute_arg_type(be_abi_irg_t *env, be_abi_call_t *call, ir_type char buf[128]; ir_type *res; int i; + ir_type *val_param_tp = get_method_value_param_type(method_type); + ident *id = get_entity_ident(get_irg_entity(env->birg->irg)); - snprintf(buf, sizeof(buf), "%s_arg_type", get_entity_name(get_irg_entity(env->birg->irg))); - res = new_type_class(new_id_from_str(buf)); - - for(i = 0; i < n; ++i, curr += inc) { - type *param_type = get_method_param_type(method_type, curr); + res = new_type_struct(mangle_u(id, new_id_from_chars("arg_type", 8))); + for (i = 0; i < n; ++i, curr += inc) { + ir_type *param_type = get_method_param_type(method_type, curr); be_abi_call_arg_t *arg = get_call_arg(call, 0, curr); - if(!arg->in_reg) { - snprintf(buf, sizeof(buf), "param_%d", i); - arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type); + if (arg->on_stack) { + if (val_param_tp) { + /* the entity was already created, move it to the param type */ + arg->stack_ent = get_method_value_param_ent(method_type, i); + remove_struct_member(val_param_tp, arg->stack_ent); + set_entity_owner(arg->stack_ent, res); + add_struct_member(res, arg->stack_ent); + /* must be automatic to set a fixed layout */ + set_entity_allocation(arg->stack_ent, allocation_automatic); + } + else { + snprintf(buf, sizeof(buf), "param_%d", i); + arg->stack_ent = new_entity(res, new_id_from_str(buf), param_type); + } + ofs += arg->space_before; + ofs = round_up2(ofs, arg->alignment); set_entity_offset_bytes(arg->stack_ent, ofs); + ofs += arg->space_after; ofs += get_type_size_bytes(param_type); } } - set_type_size_bytes(res, ofs); + set_type_state(res, layout_fixed); + return res; +} + +static void create_register_perms(const arch_isa_t *isa, ir_graph *irg, ir_node *bl, pmap *regs) +{ + int i, j, n; + struct obstack obst; + + obstack_init(&obst); + + /* Create a Perm after the RegParams node to delimit it. */ + for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) { + const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i); + ir_node *perm; + ir_node **in; + int n_regs; + + for(n_regs = 0, j = 0; j < cls->n_regs; ++j) { + const arch_register_t *reg = &cls->regs[j]; + ir_node *irn = pmap_get(regs, (void *) reg); + + if(irn && !arch_register_type_is(reg, ignore)) { + n_regs++; + obstack_ptr_grow(&obst, irn); + set_irn_link(irn, (void *) reg); + } + } + + obstack_ptr_grow(&obst, NULL); + in = obstack_finish(&obst); + if(n_regs > 0) { + perm = be_new_Perm(cls, irg, bl, n_regs, in); + for(j = 0; j < n_regs; ++j) { + ir_node *arg = in[j]; + arch_register_t *reg = get_irn_link(arg); + pmap_insert(regs, reg, arg); + be_set_constr_single_reg(perm, BE_OUT_POS(j), reg); + } + } + obstack_free(&obst, in); + } + + obstack_free(&obst, NULL); +} + +typedef struct { + const arch_register_t *reg; + ir_node *irn; +} reg_node_map_t; + +static int cmp_regs(const void *a, const void *b) +{ + const reg_node_map_t *p = a; + const reg_node_map_t *q = b; + + if(p->reg->reg_class == q->reg->reg_class) + return p->reg->index - q->reg->index; + else + return p->reg->reg_class - q->reg->reg_class; +} + +static reg_node_map_t *reg_map_to_arr(struct obstack *obst, pmap *reg_map) +{ + pmap_entry *ent; + int n = pmap_count(reg_map); + int i = 0; + reg_node_map_t *res = obstack_alloc(obst, n * sizeof(res[0])); + + pmap_foreach(reg_map, ent) { + res[i].reg = ent->key; + res[i].irn = ent->value; + i++; + } + + qsort(res, n, sizeof(res[0]), cmp_regs); return res; } +/** + * Creates a barrier. + */ +static ir_node *create_barrier(be_abi_irg_t *env, ir_node *bl, ir_node **mem, pmap *regs, int in_req) +{ + ir_graph *irg = env->birg->irg; + int n_regs = pmap_count(regs); + int n; + ir_node *irn; + ir_node **in; + reg_node_map_t *rm; + + rm = reg_map_to_arr(&env->obst, regs); + + for(n = 0; n < n_regs; ++n) + obstack_ptr_grow(&env->obst, rm[n].irn); + + if(mem) { + obstack_ptr_grow(&env->obst, *mem); + n++; + } + + in = (ir_node **) obstack_finish(&env->obst); + irn = be_new_Barrier(irg, bl, n, in); + obstack_free(&env->obst, in); + + for(n = 0; n < n_regs; ++n) { + const arch_register_t *reg = rm[n].reg; + int flags = 0; + int pos = BE_OUT_POS(n); + ir_node *proj; + + proj = new_r_Proj(irg, bl, irn, get_irn_mode(rm[n].irn), n); + be_node_set_reg_class(irn, n, reg->reg_class); + if(in_req) + be_set_constr_single_reg(irn, n, reg); + be_set_constr_single_reg(irn, pos, reg); + be_node_set_reg_class(irn, pos, reg->reg_class); + arch_set_irn_register(env->birg->main_env->arch_env, proj, reg); + + /* if the proj projects a ignore register or a node which is set to ignore, propagate this property. */ + if(arch_register_type_is(reg, ignore) || arch_irn_is(env->birg->main_env->arch_env, in[n], ignore)) + flags |= arch_irn_flags_ignore; + + if(arch_irn_is(env->birg->main_env->arch_env, in[n], modify_sp)) + flags |= arch_irn_flags_modify_sp; + + be_node_set_flags(irn, pos, flags); + + pmap_insert(regs, (void *) reg, proj); + } + + if(mem) { + *mem = new_r_Proj(irg, bl, irn, mode_M, n); + } + + obstack_free(&env->obst, rm); + return irn; +} + +/** + * Creates a be_Return for a Return node. + * + * @param @env the abi environment + * @param irn the Return node or NULL if there was none + * @param bl the block where the be_Retun should be placed + * @param mem the current memory + * @param n_res number of return results + */ +static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, ir_node *mem, int n_res) { + be_abi_call_t *call = env->call; + const arch_isa_t *isa = env->birg->main_env->arch_env->isa; + + pmap *reg_map = pmap_create(); + ir_node *keep = pmap_get(env->keep_map, bl); + int in_max; + ir_node *ret; + int i, n; + ir_node **in; + ir_node *stack; + const arch_register_t **regs; + pmap_entry *ent ; + + /* + get the valid stack node in this block. + If we had a call in that block there is a Keep constructed by process_calls() + which points to the last stack modification in that block. we'll use + it then. Else we use the stack from the start block and let + the ssa construction fix the usage. + */ + stack = be_abi_reg_map_get(env->regs, isa->sp); + if (keep) { + ir_node *bad = new_r_Bad(env->birg->irg); + stack = get_irn_n(keep, 0); + set_nodes_block(keep, bad); + set_irn_n(keep, 0, bad); + // exchange(keep, new_r_Bad(env->birg->irg)); + } + + /* Insert results for Return into the register map. */ + for(i = 0; i < n_res; ++i) { + ir_node *res = get_Return_res(irn, i); + be_abi_call_arg_t *arg = get_call_arg(call, 1, i); + assert(arg->in_reg && "return value must be passed in register"); + pmap_insert(reg_map, (void *) arg->reg, res); + } + + /* Add uses of the callee save registers. */ + pmap_foreach(env->regs, ent) { + const arch_register_t *reg = ent->key; + if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore)) + pmap_insert(reg_map, ent->key, ent->value); + } + + be_abi_reg_map_set(reg_map, isa->sp, stack); + + /* Make the Epilogue node and call the arch's epilogue maker. */ + create_barrier(env, bl, &mem, reg_map, 1); + call->cb->epilogue(env->cb, bl, &mem, reg_map); + + /* + Maximum size of the in array for Return nodes is + return args + callee save/ignore registers + memory + stack pointer + */ + in_max = pmap_count(reg_map) + n_res + 2; + + in = obstack_alloc(&env->obst, in_max * sizeof(in[0])); + regs = obstack_alloc(&env->obst, in_max * sizeof(regs[0])); + + in[0] = mem; + in[1] = be_abi_reg_map_get(reg_map, isa->sp); + regs[0] = NULL; + regs[1] = isa->sp; + n = 2; + + /* clear SP entry, since it has already been grown. */ + pmap_insert(reg_map, (void *) isa->sp, NULL); + for(i = 0; i < n_res; ++i) { + ir_node *res = get_Return_res(irn, i); + be_abi_call_arg_t *arg = get_call_arg(call, 1, i); + + in[n] = be_abi_reg_map_get(reg_map, arg->reg); + regs[n++] = arg->reg; + + /* Clear the map entry to mark the register as processed. */ + be_abi_reg_map_set(reg_map, arg->reg, NULL); + } + + /* grow the rest of the stuff. */ + pmap_foreach(reg_map, ent) { + if(ent->value) { + in[n] = ent->value; + regs[n++] = ent->key; + } + } + + /* The in array for the new back end return is now ready. */ + ret = be_new_Return(irn ? get_irn_dbg_info(irn) : NULL, env->birg->irg, bl, n_res, n, in); + + /* Set the register classes of the return's parameter accordingly. */ + for(i = 0; i < n; ++i) + if(regs[i]) + be_node_set_reg_class(ret, i, regs[i]->reg_class); + + /* Free the space of the Epilog's in array and the register <-> proj map. */ + obstack_free(&env->obst, in); + pmap_destroy(reg_map); + + return ret; +} + /** * Modify the irg itself and the frame type. */ static void modify_irg(be_abi_irg_t *env) { - firm_dbg_module_t *dbg = env->dbg; - be_abi_call_t *call = be_abi_call_new(); + be_abi_call_t *call = env->call; const arch_isa_t *isa = env->birg->main_env->arch_env->isa; const arch_register_t *sp = arch_isa_sp(isa); ir_graph *irg = env->birg->irg; ir_node *bl = get_irg_start_block(irg); ir_node *end = get_irg_end_block(irg); - ir_node *arg_tuple = get_irg_args(irg); ir_node *no_mem = get_irg_no_mem(irg); - type *method_type = get_entity_type(get_irg_entity(irg)); + ir_node *mem = get_irg_initial_mem(irg); + ir_type *method_type = get_entity_type(get_irg_entity(irg)); + pset *dont_save = pset_new_ptr(8); int n_params = get_method_n_params(method_type); - int max_arg = 0; - int reg_params_nr = 0; - int arg_offset = 0; int i, j, n; + reg_node_map_t *rm; + const arch_register_t *fp_reg; ir_node *frame_pointer; + ir_node *barrier; ir_node *reg_params_bl; - ir_node **args, **args_repl; + ir_node **args; + ir_node *arg_tuple; const ir_edge_t *edge; - ir_type *arg_type; + ir_type *arg_type, *bet_type; - pmap_entry *ent; + bitset_t *used_proj_nr; + DEBUG_ONLY(firm_dbg_module_t *dbg = env->dbg;) DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg)); @@ -968,19 +1349,12 @@ static void modify_irg(be_abi_irg_t *env) env->frame = obstack_alloc(&env->obst, sizeof(env->frame[0])); env->regs = pmap_create(); - /* Find the maximum proj number of the argument tuple proj */ - foreach_out_edge(arg_tuple, edge) { - ir_node *irn = get_edge_src_irn(edge); - int nr = get_Proj_proj(irn); - max_arg = MAX(max_arg, nr); - } - max_arg += 1; - args = obstack_alloc(&env->obst, max_arg * sizeof(args[0])); - args_repl = obstack_alloc(&env->obst, max_arg * sizeof(args[0])); - memset(args, 0, max_arg * sizeof(args[0])); - memset(args_repl, 0, max_arg * sizeof(args[0])); + used_proj_nr = bitset_alloca(1024); + args = obstack_alloc(&env->obst, n_params * sizeof(args[0])); + memset(args, 0, n_params * sizeof(args[0])); /* Fill the argument vector */ + arg_tuple = get_irg_args(irg); foreach_out_edge(arg_tuple, edge) { ir_node *irn = get_edge_src_irn(edge); int nr = get_Proj_proj(irn); @@ -988,18 +1362,20 @@ static void modify_irg(be_abi_irg_t *env) DBG((dbg, LEVEL_2, "\treading arg: %d -> %+F\n", nr, irn)); } - /* Get the ABI constraints from the ISA */ - arch_isa_get_call_abi(isa, method_type, call); - - arg_type = compute_arg_type(env, call, method_type); - stack_frame_init(env->frame, arg_type, call->between_type, get_irg_frame_type(irg), isa->stack_dir); + arg_type = compute_arg_type(env, call, method_type); + bet_type = call->cb->get_between_type(env->cb); + stack_frame_init(env->frame, arg_type, bet_type, get_irg_frame_type(irg), isa->stack_dir); /* Count the register params and add them to the number of Projs for the RegParams node */ for(i = 0; i < n_params; ++i) { be_abi_call_arg_t *arg = get_call_arg(call, 0, i); - if(arg->in_reg) { + if(arg->in_reg && args[i]) { assert(arg->reg != sp && "cannot use stack pointer as parameter register"); - pmap_insert(env->regs, (void *) arg->reg, NULL); + assert(i == get_Proj_proj(args[i])); + + /* For now, associate the register with the old Proj from Start representing that argument. */ + pmap_insert(env->regs, (void *) arg->reg, args[i]); + bitset_set(used_proj_nr, i); DBG((dbg, LEVEL_2, "\targ #%d -> reg %s\n", i, arg->reg->name)); } } @@ -1009,46 +1385,81 @@ static void modify_irg(be_abi_irg_t *env) const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i); for(j = 0; j < cls->n_regs; ++j) { const arch_register_t *reg = &cls->regs[j]; - if(arch_register_type_is(reg, callee_save)) + if(arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore)) pmap_insert(env->regs, (void *) reg, NULL); } } pmap_insert(env->regs, (void *) sp, NULL); pmap_insert(env->regs, (void *) isa->bp, NULL); - reg_params_nr = 0; reg_params_bl = get_irg_start_block(irg); env->reg_params = be_new_RegParams(irg, reg_params_bl, pmap_count(env->regs)); /* * make proj nodes for the callee save registers. * memorize them, since Return nodes get those as inputs. + * + * Note, that if a register corresponds to an argument, the regs map contains + * the old Proj from start for that argument. */ - for(ent = pmap_first(env->regs); ent; ent = pmap_next(env->regs)) { - arch_register_t *reg = ent->key; - int pos = -(reg_params_nr + 1); - ent->value = new_r_Proj(irg, reg_params_bl, env->reg_params, reg->reg_class->mode, reg_params_nr); + + rm = reg_map_to_arr(&env->obst, env->regs); + for(i = 0, n = pmap_count(env->regs); i < n; ++i) { + arch_register_t *reg = (void *) rm[i].reg; + ir_node *arg_proj = rm[i].irn; + ir_mode *mode = arg_proj ? get_irn_mode(arg_proj) : reg->reg_class->mode; + long nr = i; + int pos = BE_OUT_POS((int) nr); + int flags = 0; + + ir_node *proj; + + assert(nr >= 0); + bitset_set(used_proj_nr, nr); + proj = new_r_Proj(irg, reg_params_bl, env->reg_params, mode, nr); + pmap_insert(env->regs, (void *) reg, proj); be_set_constr_single_reg(env->reg_params, pos, reg); - arch_set_irn_register(env->birg->main_env->arch_env, ent->value, reg); + arch_set_irn_register(env->birg->main_env->arch_env, proj, reg); /* * If the register is an ignore register, * The Proj for that register shall also be ignored during register allocation. */ if(arch_register_type_is(reg, ignore)) - be_node_set_flags(env->reg_params, pos, arch_irn_flags_ignore); + flags |= arch_irn_flags_ignore; + + if(reg == sp) + flags |= arch_irn_flags_modify_sp; - reg_params_nr++; + be_node_set_flags(env->reg_params, pos, flags); - DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", reg_params_nr - 1, reg->name)); + DBG((dbg, LEVEL_2, "\tregister save proj #%d -> reg %s\n", nr, reg->name)); } + obstack_free(&env->obst, rm); - /* Insert the code to set up the stack frame */ - frame_pointer = setup_frame(env); + /* Generate the Prologue */ + fp_reg = call->cb->prologue(env->cb, &mem, env->regs); + + /* do the stack allocation BEFORE the barrier, or spill code + might be added before it */ + env->init_sp = be_abi_reg_map_get(env->regs, sp); + env->init_sp = be_new_IncSP(sp, irg, bl, env->init_sp, no_mem, BE_STACK_FRAME_SIZE, be_stack_dir_expand); + be_abi_reg_map_set(env->regs, sp, env->init_sp); + + barrier = create_barrier(env, bl, &mem, env->regs, 0); + + env->init_sp = be_abi_reg_map_get(env->regs, sp); + arch_set_irn_register(env->birg->main_env->arch_env, env->init_sp, sp); + + frame_pointer = be_abi_reg_map_get(env->regs, fp_reg); + set_irg_frame(irg, frame_pointer); + pset_insert_ptr(env->ignore_regs, fp_reg); /* Now, introduce stack param nodes for all parameters passed on the stack */ - for(i = 0; i < max_arg; ++i) { + for(i = 0; i < n_params; ++i) { ir_node *arg_proj = args[i]; + ir_node *repl = NULL; + if(arg_proj != NULL) { be_abi_call_arg_t *arg; ir_type *param_type; @@ -1059,85 +1470,44 @@ static void modify_irg(be_abi_irg_t *env) param_type = get_method_param_type(method_type, nr); if(arg->in_reg) { - args_repl[i] = new_r_Proj(irg, reg_params_bl, env->reg_params, get_irn_mode(arg_proj), reg_params_nr); - be_set_constr_single_reg(env->reg_params, -(reg_params_nr + 1), arg->reg); - reg_params_nr++; + repl = pmap_get(env->regs, (void *) arg->reg); } - /* when the (stack) parameter is primitive, we insert a StackParam - node representing the load of that parameter */ - else { - + else if(arg->on_stack) { /* For atomic parameters which are actually used, we create a StackParam node. */ if(is_atomic_type(param_type) && get_irn_n_edges(args[i]) > 0) { ir_mode *mode = get_type_mode(param_type); const arch_register_class_t *cls = arch_isa_get_reg_class_for_mode(isa, mode); - args_repl[i] = be_new_StackParam(cls, isa->bp->reg_class, irg, reg_params_bl, mode, frame_pointer, arg->stack_ent); + repl = be_new_StackParam(cls, isa->bp->reg_class, irg, reg_params_bl, mode, frame_pointer, arg->stack_ent); } /* The stack parameter is not primitive (it is a struct or array), we thus will create a node representing the parameter's address on the stack. */ else { - args_repl[i] = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent); + repl = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent); } } - } - } - /* reroute the edges from the original argument projs to the RegParam ones. */ - for(i = 0; i < max_arg; ++i) { - if(args[i] != NULL) { - assert(args_repl[i] != NULL); - edges_reroute(args[i], args_repl[i], irg); + assert(repl != NULL); + edges_reroute(args[i], repl, irg); } } /* All Return nodes hang on the End node, so look for them there. */ - for(i = 0, n = get_irn_arity(end); i < n; ++i) { - ir_node *irn = get_irn_n(end, i); - - if(get_irn_opcode(irn) == iro_Return) { - ir_node *bl = get_nodes_block(irn); - int n_res = get_Return_n_ress(irn); - pmap *reg_map = pmap_create_ex(n_res); - ir_node *ret; - int i, n; - ir_node **in; - - /* collect all arguments of the return */ - obstack_ptr_grow(&env->obst, get_Return_mem(irn)); - for(i = 0; i < n_res; ++i) { - ir_node *res = get_Return_res(irn, i); - be_abi_call_arg_t *arg = get_call_arg(call, 1, i); - - assert(arg->in_reg && "return value must be passed in register"); - pmap_insert(reg_map, res, (void *) arg->reg); - obstack_ptr_grow(&env->obst, res); - } - - /* generate the clean up code and add additional parameters to the return. */ - clearup_frame(env, irn, &env->obst); + for (i = 0, n = get_Block_n_cfgpreds(end); i < n; ++i) { + ir_node *irn = get_Block_cfgpred(end, i); - /* The in array for the new back end return is now ready. */ - n = obstack_object_size(&env->obst) / sizeof(in[0]); - in = obstack_finish(&env->obst); - ret = be_new_Return(irg, bl, n, in); - - /* Set the constraints for some arguments of the return. */ - for(i = 0; i < n; i++) { - const arch_register_t *reg = pmap_get(reg_map, in[i]); - if(reg != NULL) - be_set_constr_single_reg(ret, i, reg); - } + if (is_Return(irn)) { + ir_node *ret = create_be_return(env, irn, get_nodes_block(irn), get_Return_mem(irn), get_Return_n_ress(irn)); exchange(irn, ret); - obstack_free(&env->obst, in); - pmap_destroy(reg_map); } } + /* if we have endless loops here, n might be <= 0. Do NOT create a be_Return than, + the code is dead and will never be executed. */ + del_pset(dont_save); obstack_free(&env->obst, args); - be_abi_call_free(call); } /** @@ -1152,22 +1522,35 @@ static void collect_alloca_walker(ir_node *irn, void *data) be_abi_irg_t *be_abi_introduce(be_irg_t *birg) { - be_abi_irg_t *env = malloc(sizeof(env[0])); + be_abi_irg_t *env = xmalloc(sizeof(env[0])); + ir_node *old_frame = get_irg_frame(birg->irg); + ir_graph *irg = birg->irg; + pmap_entry *ent; ir_node *dummy; + optimization_state_t state; + + obstack_init(&env->obst); env->isa = birg->main_env->arch_env->isa; - env->method_type = get_entity_type(get_irg_entity(birg->irg)); + env->method_type = get_entity_type(get_irg_entity(irg)); env->call = be_abi_call_new(); arch_isa_get_call_abi(env->isa, env->method_type, env->call); + env->ignore_regs = pset_new_ptr_default(); + env->keep_map = pmap_create(); env->dce_survivor = new_survive_dce(); env->birg = birg; - env->dbg = firm_dbg_register("firm.be.abi"); env->stack_phis = pset_new_ptr(16); - env->init_sp = dummy = new_r_Unknown(birg->irg, env->isa->sp->reg_class->mode); + /* Beware: later we replace this node by the real one, ensure it is not CSE'd + to another Unknown or the stack pointer gets used */ + save_optimization_state(&state); + set_optimize(0); + env->init_sp = dummy = new_r_Unknown(irg, env->isa->sp->reg_class->mode); + restore_optimization_state(&state); + FIRM_DBG_REGISTER(env->dbg, "firm.be.abi"); - obstack_init(&env->obst); + env->cb = env->call->cb->init(env->call, birg->main_env->arch_env, irg); memcpy(&env->irn_handler, &abi_irn_handler, sizeof(abi_irn_handler)); env->irn_ops.impl = &abi_irn_ops; @@ -1178,15 +1561,22 @@ be_abi_irg_t *be_abi_introduce(be_irg_t *birg) /* Process the IRG */ modify_irg(env); + /* We don't need the keep map anymore. */ + pmap_destroy(env->keep_map); + /* reroute the stack origin of the calls to the true stack origin. */ - exchange(dummy, env->init_sp); + edges_reroute(dummy, env->init_sp, irg); + edges_reroute(old_frame, get_irg_frame(irg), irg); /* Make some important node pointers survive the dead node elimination. */ survive_dce_register_irn(env->dce_survivor, &env->init_sp); - survive_dce_register_pmap(env->dce_survivor, env->regs); + pmap_foreach(env->regs, ent) + survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value); arch_env_push_irn_handler(env->birg->main_env->arch_env, &env->irn_handler); + env->call->cb->done(env->cb); + be_liveness(irg); return env; } @@ -1194,12 +1584,22 @@ void be_abi_free(be_abi_irg_t *env) { free_survive_dce(env->dce_survivor); del_pset(env->stack_phis); + del_pset(env->ignore_regs); pmap_destroy(env->regs); obstack_free(&env->obst, NULL); arch_env_pop_irn_handler(env->birg->main_env->arch_env); free(env); } +void be_abi_put_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, bitset_t *bs) +{ + arch_register_t *reg; + + for(reg = pset_first(abi->ignore_regs); reg; reg = pset_next(abi->ignore_regs)) + if(reg->reg_class == cls) + bitset_set(bs, reg->index); +} + /* @@ -1211,50 +1611,61 @@ void be_abi_free(be_abi_irg_t *env) */ +struct fix_stack_walker_info { + nodeset *nodes; + const arch_env_t *aenv; +}; + +/** + * Walker. Collect all stack modifying nodes. + */ static void collect_stack_nodes_walker(ir_node *irn, void *data) { - pset *s = data; + struct fix_stack_walker_info *info = data; - if((is_Proj(irn) && be_is_Alloca(get_Proj_pred(irn)) && get_Proj_proj(irn) == pn_Alloc_res) - || be_is_IncSP(irn) - || be_is_SetSP(irn)) - pset_insert_ptr(s, irn); + if(arch_irn_is(info->aenv, irn, modify_sp)) + pset_insert_ptr(info->nodes, irn); } void be_abi_fix_stack_nodes(be_abi_irg_t *env) { dom_front_info_t *df; - pset *stack_nodes; + pset *stack_nodes = pset_new_ptr(16); + struct fix_stack_walker_info info; + + info.nodes = stack_nodes; + info.aenv = env->birg->main_env->arch_env; /* We need dominance frontiers for fix up */ df = be_compute_dominance_frontiers(env->birg->irg); - stack_nodes = pset_new_ptr(16); + irg_walk_graph(env->birg->irg, collect_stack_nodes_walker, NULL, &info); pset_insert_ptr(stack_nodes, env->init_sp); - irg_walk_graph(env->birg->irg, collect_stack_nodes_walker, NULL, stack_nodes); be_ssa_constr_set_phis(df, stack_nodes, env->stack_phis); del_pset(stack_nodes); + /* Liveness could have changed due to Phi nodes. */ + be_liveness(env->birg->irg); + /* free these dominance frontiers */ be_free_dominance_frontiers(df); } /** - * Translates a direction of an IncSP node (either be_stack_dir_against, or ...along) + * Translates a direction of an IncSP node (either be_stack_dir_shrink, or ...expand) * into -1 or 1, respectively. * @param irn The node. * @return 1, if the direction of the IncSP was along, -1 if against. */ static int get_dir(ir_node *irn) { - return 1 - 2 * (be_get_IncSP_direction(irn) == be_stack_dir_against); + return 1 - 2 * (be_get_IncSP_direction(irn) == be_stack_dir_shrink); } static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias) { const arch_env_t *aenv = env->birg->main_env->arch_env; + int omit_fp = env->call->flags.bits.try_omit_fp; ir_node *irn; - int start_bias = bias; - int omit_fp = env->call->flags.bits.try_omit_fp; sched_foreach(bl, irn) { @@ -1299,12 +1710,16 @@ static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias) struct bias_walk { be_abi_irg_t *env; /**< The ABI irg environment. */ int start_block_bias; /**< The bias at the end of the start block. */ + ir_node *start_block; /**< The start block of the current graph. */ }; +/** + * Block-Walker: fix all stack offsets + */ static void stack_bias_walker(ir_node *bl, void *data) { - if(bl != get_irg_start_block(get_irn_irg(bl))) { - struct bias_walk *bw = data; + struct bias_walk *bw = data; + if (bl != bw->start_block) { process_stack_bias(bw->env, bl, bw->start_block_bias); } } @@ -1315,13 +1730,14 @@ void be_abi_fix_stack_bias(be_abi_irg_t *env) struct bias_walk bw; stack_frame_compute_initial_offset(env->frame); - // stack_frame_dump(stdout, env->frame); + // stack_layout_dump(stdout, env->frame); - /* Determine the stack bias at the and of the start block. */ + /* Determine the stack bias at the end of the start block. */ bw.start_block_bias = process_stack_bias(env, get_irg_start_block(irg), 0); /* fix the bias is all other blocks */ bw.env = env; + bw.start_block = get_irg_start_block(irg); irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw); } @@ -1350,7 +1766,12 @@ ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *re static const void *abi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn) { const be_abi_irg_t *abi = get_abi_from_handler(handler); - return is_Phi(irn) && pset_find_ptr(abi->stack_phis, (void *) irn) != NULL ? &abi->irn_ops : NULL; + const void *res = NULL; + + if(is_Phi(irn) && pset_find_ptr(abi->stack_phis, (void *) irn)) + res = &abi->irn_ops; + + return res; } static void be_abi_limited(void *data, bitset_t *bs) @@ -1365,10 +1786,20 @@ static const arch_register_req_t *abi_get_irn_reg_req(const void *self, arch_reg be_abi_irg_t *abi = get_abi_from_ops(self); const arch_register_t *reg = abi->isa->sp; - req->cls = reg->reg_class; - req->type = arch_register_req_type_limited; - req->limited = be_abi_limited; - req->limited_env = abi; + memset(req, 0, sizeof(req[0])); + + if(pos == BE_OUT_POS(0)) { + req->cls = reg->reg_class; + req->type = arch_register_req_type_limited; + req->limited = be_abi_limited; + req->limited_env = abi; + } + + else if(pos >= 0 && pos < get_irn_arity(irn)) { + req->cls = reg->reg_class; + req->type = arch_register_req_type_normal; + } + return req; } @@ -1389,7 +1820,7 @@ static arch_irn_class_t abi_classify(const void *_self, const ir_node *irn) static arch_irn_flags_t abi_get_flags(const void *_self, const ir_node *irn) { - return arch_irn_flags_ignore; + return arch_irn_flags_ignore | arch_irn_flags_modify_sp; } static entity *abi_get_frame_entity(const void *_self, const ir_node *irn)