X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeabi.c;h=be218364deaad0e8f71f0b3e451359ea4a0abe9f;hb=13c55699fa3a9a152b99d2fedce8eb229632d72d;hp=a41be6dcdac47274d694d30e498792a6c9366281;hpb=ab182d4b9ed44239ab3ff1d08b2f8e14a3699ccf;p=libfirm diff --git a/ir/be/beabi.c b/ir/be/beabi.c index a41be6dcd..be218364d 100644 --- a/ir/be/beabi.c +++ b/ir/be/beabi.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -39,7 +39,7 @@ #include "irgopt.h" #include "irbitset.h" #include "iropt_t.h" -#include "height.h" +#include "heights.h" #include "pdeq.h" #include "irtools.h" #include "raw_bitset.h" @@ -55,13 +55,14 @@ #include "beirg.h" #include "bessaconstr.h" #include "bemodule.h" +#include "betranshlp.h" DEBUG_ONLY(static firm_dbg_module_t *dbg;) typedef struct be_abi_call_arg_t { 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. */ + unsigned on_stack : 1; /**< 1: this argument is transmitted on the stack. */ unsigned callee : 1; /**< 1: someone called us. 0: We call another function */ int pos; @@ -86,8 +87,6 @@ struct be_abi_call_t { * The ABI information for the current graph. */ struct be_abi_irg_t { - survive_dce_t *dce_survivor; - be_abi_call_t *call; /**< The ABI call information. */ ir_node *init_sp; /**< The node representing the stack pointer @@ -96,26 +95,28 @@ struct be_abi_irg_t { ir_node *start; /**< The be_Start params node. */ pmap *regs; /**< A map of all callee-save and ignore regs to their Projs to the RegParams node. */ - 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. */ ir_node **calls; /**< flexible array containing all be_Call nodes */ - - arch_register_req_t *sp_req; }; -static heights_t *ir_heights; +static ir_heights_t *ir_heights; /** Flag: if set, try to omit the frame pointer in all routines. */ static int be_omit_fp = 1; -/** Flag: if set, try to omit the frame pointer in leaf routines only. */ -static int be_omit_leaf_fp = 1; +static ir_node *be_abi_reg_map_get(pmap *map, const arch_register_t *reg) +{ + return (ir_node*)pmap_get(map, reg); +} + +static void be_abi_reg_map_set(pmap *map, const arch_register_t* reg, + ir_node *node) +{ + pmap_insert(map, reg, node); +} /* _ ____ ___ ____ _ _ _ _ @@ -133,7 +134,8 @@ static int be_omit_leaf_fp = 1; */ static int cmp_call_arg(const void *a, const void *b, size_t n) { - const be_abi_call_arg_t *p = a, *q = b; + const be_abi_call_arg_t *p = (const be_abi_call_arg_t*)a; + const be_abi_call_arg_t *q = (const be_abi_call_arg_t*)b; (void) n; return !(p->is_res == q->is_res && p->pos == q->pos && p->callee == q->callee); } @@ -144,7 +146,7 @@ static int cmp_call_arg(const void *a, const void *b, size_t n) * @param call the abi call * @param is_res true for call results, false for call arguments * @param pos position of the argument - * @param callee context type - if we are callee or caller + * @param callee context type - if we are callee or caller */ static be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos, int callee) { @@ -158,7 +160,7 @@ static be_abi_call_arg_t *get_call_arg(be_abi_call_t *call, int is_res, int pos, hash = is_res * 128 + pos; - return set_find(call->params, &arg, sizeof(arg), hash); + return (be_abi_call_arg_t*)set_find(call->params, &arg, sizeof(arg), hash); } /** @@ -265,7 +267,7 @@ static be_abi_call_t *be_abi_call_new(const arch_register_class_t *cls_addr) call->cb = NULL; call->cls_addr = cls_addr; - call->flags.bits.try_omit_fp = be_omit_fp | be_omit_leaf_fp; + call->flags.bits.try_omit_fp = be_omit_fp; return call; } @@ -279,79 +281,6 @@ static void be_abi_call_free(be_abi_call_t *call) free(call); } -/* - _____ _ _ _ _ _ - | ___| __ __ _ _ __ ___ ___ | | | | __ _ _ __ __| | (_)_ __ __ _ - | |_ | '__/ _` | '_ ` _ \ / _ \ | |_| |/ _` | '_ \ / _` | | | '_ \ / _` | - | _|| | | (_| | | | | | | __/ | _ | (_| | | | | (_| | | | | | | (_| | - |_| |_| \__,_|_| |_| |_|\___| |_| |_|\__,_|_| |_|\__,_|_|_|_| |_|\__, | - |___/ - - Handling of the stack frame. It is composed of three types: - 1) The type of the arguments which are pushed on the stack. - 2) The "between type" which consists of stuff the call of the - function pushes on the stack (like the return address and - the old base pointer for ia32). - 3) The Firm frame type which consists of all local variables - and the spills. -*/ - -int be_get_stack_entity_offset(be_stack_layout_t *frame, ir_entity *ent, - int bias) -{ - ir_type *t = get_entity_owner(ent); - int ofs = get_entity_offset(ent); - - int index; - - /* Find the type the entity is contained in. */ - for (index = 0; index < N_FRAME_TYPES; ++index) { - if (frame->order[index] == t) - break; - /* Add the size of all the types below the one of the entity to the entity's offset */ - ofs += get_type_size_bytes(frame->order[index]); - } - - /* correct the offset by the initial position of the frame pointer */ - ofs -= frame->initial_offset; - - /* correct the offset with the current bias. */ - ofs += bias; - - return ofs; -} - -/** - * Retrieve the entity with given offset from a frame type. - */ -static ir_entity *search_ent_with_offset(ir_type *t, int offset) -{ - int i, n; - - for (i = 0, n = get_compound_n_members(t); i < n; ++i) { - ir_entity *ent = get_compound_member(t, i); - if (get_entity_offset(ent) == offset) - return ent; - } - - return NULL; -} - -static int stack_frame_compute_initial_offset(be_stack_layout_t *frame) -{ - ir_type *base = frame->stack_dir < 0 ? frame->between_type : frame->frame_type; - ir_entity *ent = search_ent_with_offset(base, 0); - - if (ent == NULL) { - frame->initial_offset - = frame->stack_dir < 0 ? get_type_size_bytes(frame->frame_type) : get_type_size_bytes(frame->between_type); - } else { - frame->initial_offset = be_get_stack_entity_offset(frame, ent, 0); - } - - return frame->initial_offset; -} - /** * Initializes the frame layout from parts * @@ -359,13 +288,12 @@ static int stack_frame_compute_initial_offset(be_stack_layout_t *frame) * @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: < 0 decreasing, > 0 increasing addresses * @param param_map an array mapping method argument positions to the stack argument type * * @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, + ir_type *between, ir_type *locals, ir_entity *param_map[]) { frame->arg_type = args; @@ -373,19 +301,13 @@ static be_stack_layout_t *stack_frame_init(be_stack_layout_t *frame, ir_type *ar frame->frame_type = locals; frame->initial_offset = 0; frame->initial_bias = 0; - frame->stack_dir = stack_dir; frame->order[1] = between; frame->param_map = param_map; - if (stack_dir > 0) { - frame->order[0] = args; - frame->order[2] = locals; - } else { - /* typical decreasing stack: locals have the - * lowest addresses, arguments the highest */ - frame->order[0] = locals; - frame->order[2] = args; - } + /* typical decreasing stack: locals have the + * lowest addresses, arguments the highest */ + frame->order[0] = locals; + frame->order[2] = args; return frame; } @@ -414,11 +336,10 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) const arch_env_t *arch_env = be_get_irg_arch_env(irg); ir_type *call_tp = get_Call_type(irn); ir_node *call_ptr = get_Call_ptr(irn); - int n_params = get_method_n_params(call_tp); + size_t n_params = get_method_n_params(call_tp); ir_node *curr_mem = get_Call_mem(irn); ir_node *bl = get_nodes_block(irn); int stack_size = 0; - int stack_dir = arch_env->stack_dir; const arch_register_t *sp = arch_env->sp; be_abi_call_t *call = be_abi_call_new(sp->reg_class); ir_mode *mach_mode = sp->reg_class->mode; @@ -441,6 +362,8 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) int *reg_param_idxs; int *stack_param_idx; int i, n, destroy_all_regs; + size_t s; + size_t p; dbg_info *dbgi; /* Let the isa fill out the abi description for that call node. */ @@ -449,26 +372,26 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) /* Insert code to put the stack arguments on the stack. */ assert(get_Call_n_params(irn) == n_params); stack_param_idx = ALLOCAN(int, n_params); - for (i = 0; i < n_params; ++i) { - be_abi_call_arg_t *arg = get_call_arg(call, 0, i, 0); + for (p = 0; p < n_params; ++p) { + be_abi_call_arg_t *arg = get_call_arg(call, 0, p, 0); assert(arg); if (arg->on_stack) { - int arg_size = get_type_size_bytes(get_method_param_type(call_tp, i)); + int arg_size = get_type_size_bytes(get_method_param_type(call_tp, p)); stack_size += round_up2(arg->space_before, arg->alignment); stack_size += round_up2(arg_size, arg->alignment); stack_size += round_up2(arg->space_after, arg->alignment); - stack_param_idx[n_stack_params++] = i; + stack_param_idx[n_stack_params++] = p; } } /* Collect all arguments which are passed in registers. */ reg_param_idxs = ALLOCAN(int, n_params); - for (i = 0; i < n_params; ++i) { - be_abi_call_arg_t *arg = get_call_arg(call, 0, i, 0); + for (p = 0; p < n_params; ++p) { + be_abi_call_arg_t *arg = get_call_arg(call, 0, p, 0); if (arg && arg->in_reg) { - reg_param_idxs[n_reg_params++] = i; + reg_param_idxs[n_reg_params++] = p; } } @@ -481,7 +404,7 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) * Note: we also have to do this for stack_size == 0, because we may have * to adjust stack alignment for the call. */ - if (stack_dir < 0 && !do_seq && !no_alloc) { + if (!do_seq && !no_alloc) { curr_sp = be_new_IncSP(sp, bl, curr_sp, stack_size, 1); } @@ -497,7 +420,7 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) * We must them reverse again if they are pushed (not stored) and the stack * direction is downwards. */ - if (call->flags.bits.left_to_right ^ (do_seq && stack_dir < 0)) { + if (call->flags.bits.left_to_right ^ do_seq) { for (i = 0; i < n_stack_params >> 1; ++i) { int other = n_stack_params - i - 1; int tmp = stack_param_idx[i]; @@ -547,9 +470,8 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) /* Insert a store for primitive arguments. */ if (is_atomic_type(param_type)) { - ir_node *store; - ir_node *mem_input = do_seq ? curr_mem : new_NoMem(); - store = new_rd_Store(dbgi, bl, mem_input, addr, param, 0); + ir_node *mem_input = do_seq ? curr_mem : new_r_NoMem(irg); + ir_node *store = new_rd_Store(dbgi, bl, mem_input, addr, param, cons_none); mem = new_r_Proj(store, mode_M, pn_Store_M); } else { /* Make a mem copy for compound arguments. */ @@ -594,9 +516,9 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) /* Put caller save into the destroyed set and state registers in the states * set */ - for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) { + for (i = 0, n = arch_env->n_register_classes; i < n; ++i) { unsigned j; - const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i); + const arch_register_class_t *cls = &arch_env->register_classes[i]; for (j = 0; j < cls->n_regs; ++j) { const arch_register_t *reg = arch_register_for_index(cls, j); @@ -605,15 +527,15 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) if (reg == arch_env->sp || reg == arch_env->bp) continue; - if (arch_register_type_is(reg, state)) { + if (reg->type & arch_register_type_state) { ARR_APP1(const arch_register_t*, destroyed_regs, reg); ARR_APP1(const arch_register_t*, states, reg); /* we're already in the destroyed set so no need for further * checking */ continue; } - if (destroy_all_regs || arch_register_type_is(reg, caller_save)) { - if (! arch_register_type_is(reg, ignore)) { + if (destroy_all_regs || (reg->type & arch_register_type_caller_save)) { + if (!(reg->type & arch_register_type_ignore)) { ARR_APP1(const arch_register_t*, destroyed_regs, reg); } } @@ -659,13 +581,9 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) } /* add state registers ins */ - for (i = 0; i < ARR_LEN(states); ++i) { - const arch_register_t *reg = states[i]; + for (s = 0; s < ARR_LEN(states); ++s) { + const arch_register_t *reg = states[s]; const arch_register_class_t *cls = arch_register_get_class(reg); -#if 0 - ir_node *regnode = be_abi_reg_map_get(env->regs, reg); - ir_fprintf(stderr, "Adding %+F\n", regnode); -#endif ir_node *regnode = new_r_Unknown(irg, arch_register_class_mode(cls)); in[n_ins++] = regnode; } @@ -723,8 +641,8 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) if (arg->in_reg) { /* remove register from destroyed regs */ - int j; - int n = ARR_LEN(destroyed_regs); + size_t j; + size_t n = ARR_LEN(destroyed_regs); for (j = 0; j < n; ++j) { if (destroyed_regs[j] == arg->reg) { destroyed_regs[j] = destroyed_regs[n-1]; @@ -739,7 +657,7 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) Set the register class of the call address to the backend provided class (default: stack pointer class) */ - be_node_set_reg_class_in(low_call, be_pos_Call_ptr, call->cls_addr); + be_node_set_reg_class_in(low_call, n_be_Call_ptr, call->cls_addr); DBG((dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call)); @@ -749,8 +667,8 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) be_abi_call_arg_t *arg = get_call_arg(call, 0, index, 0); assert(arg->reg != NULL); - be_set_constr_single_reg_in(low_call, be_pos_Call_first_arg + i, - arg->reg, 0); + be_set_constr_single_reg_in(low_call, n_be_Call_first_arg + i, + arg->reg, arch_register_req_type_none); } /* Set the register constraints of the results. */ @@ -760,7 +678,8 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) int pn = get_Proj_proj(proj); assert(arg->in_reg); - be_set_constr_single_reg_out(low_call, pn, arg->reg, 0); + be_set_constr_single_reg_out(low_call, pn, arg->reg, + arch_register_req_type_none); arch_set_irn_register(proj, arg->reg); } exchange(irn, low_call); @@ -775,6 +694,7 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) { ir_node **in, *keep; int i; + size_t d; int n = 0; int curr_res_proj = pn_be_Call_first_res + n_reg_results; int n_ins; @@ -786,12 +706,13 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) set_irn_link(curr_sp, (void*) sp); in[n++] = curr_sp; - for (i = 0; i < ARR_LEN(destroyed_regs); ++i) { - const arch_register_t *reg = destroyed_regs[i]; + for (d = 0; d < ARR_LEN(destroyed_regs); ++d) { + const arch_register_t *reg = destroyed_regs[d]; ir_node *proj = new_r_Proj(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_out(low_call, curr_res_proj, reg, 0); + be_set_constr_single_reg_out(low_call, curr_res_proj, reg, + arch_register_req_type_none); arch_set_irn_register(proj, reg); set_irn_link(proj, (void*) reg); @@ -810,7 +731,7 @@ static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp) /* create the Keep for the caller save registers */ keep = be_new_Keep(bl, n, in); for (i = 0; i < n; ++i) { - const arch_register_t *reg = get_irn_link(in[i]); + const arch_register_t *reg = (const arch_register_t*)get_irn_link(in[i]); be_node_set_reg_class_in(keep, i, reg->reg_class); } } @@ -862,10 +783,10 @@ static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size, ir_node *block, dbg_info *dbg) { if (stack_alignment > 1) { - ir_mode *mode; - tarval *tv; - ir_node *mask; - ir_graph *irg; + ir_mode *mode; + ir_tarval *tv; + ir_node *mask; + ir_graph *irg; assert(is_po2(stack_alignment)); @@ -934,11 +855,11 @@ static ir_node *adjust_alloc(be_abi_irg_t *env, ir_node *alloc, ir_node *curr_sp /* we might need to multiply the count with the element size */ if (type != firm_unknown_type && get_type_size_bytes(type) != 1) { - ir_mode *mode = get_irn_mode(count); - tarval *tv = new_tarval_from_long(get_type_size_bytes(type), - mode); - ir_node *cnst = new_rd_Const(dbg, irg, tv); - size = new_rd_Mul(dbg, block, count, cnst, mode); + ir_mode *mode = get_irn_mode(count); + ir_tarval *tv = new_tarval_from_long(get_type_size_bytes(type), + mode); + ir_node *cnst = new_rd_Const(dbg, irg, tv); + size = new_rd_Mul(dbg, block, count, cnst, mode); } else { size = count; } @@ -999,10 +920,10 @@ static ir_node *adjust_free(be_abi_irg_t *env, ir_node *free, ir_node *curr_sp) /* we might need to multiply the size with the element size */ if (type != firm_unknown_type && get_type_size_bytes(type) != 1) { - tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu); - ir_node *cnst = new_rd_Const(dbg, irg, tv); - ir_node *mul = new_rd_Mul(dbg, block, get_Free_size(free), - cnst, mode_Iu); + ir_tarval *tv = new_tarval_from_long(get_type_size_bytes(type), mode_Iu); + ir_node *cnst = new_rd_Const(dbg, irg, tv); + ir_node *mul = new_rd_Mul(dbg, block, get_Free_size(free), + cnst, mode_Iu); size = mul; } else { size = get_Free_size(free); @@ -1053,6 +974,7 @@ static int cmp_call_dependency(const void *c1, const void *c2) { ir_node *n1 = *(ir_node **) c1; ir_node *n2 = *(ir_node **) c2; + unsigned h1, h2; /* Classical qsort() comparison function behavior: @@ -1067,7 +989,16 @@ static int cmp_call_dependency(const void *c1, const void *c2) return 1; /* The nodes have no depth order, but we need a total order because qsort() - * is not stable. */ + * is not stable. + * + * Additionally, we need to respect transitive dependencies. Consider a + * Call a depending on Call b and an independent Call c. + * We MUST NOT order c > a and b > c. */ + h1 = get_irn_height(ir_heights, n1); + h2 = get_irn_height(ir_heights, n2); + if (h1 < h2) return -1; + if (h1 > h2) return 1; + /* Same height, so use a random (but stable) order */ return get_irn_idx(n1) - get_irn_idx(n2); } @@ -1077,8 +1008,8 @@ static int cmp_call_dependency(const void *c1, const void *c2) */ static void link_ops_in_block_walker(ir_node *irn, void *data) { - be_abi_irg_t *env = data; - ir_opcode code = get_irn_opcode(irn); + be_abi_irg_t *env = (be_abi_irg_t*)data; + unsigned code = get_irn_opcode(irn); if (code == iro_Call || (code == iro_Alloc && get_Alloc_where(irn) == stack_alloc) || @@ -1095,7 +1026,7 @@ static void link_ops_in_block_walker(ir_node *irn, void *data) if (code == iro_Builtin && get_Builtin_kind(irn) == ir_bk_return_address) { ir_node *param = get_Builtin_param(irn, 0); - tarval *tv = get_Const_tarval(param); + ir_tarval *tv = get_Const_tarval(param); unsigned long value = get_tarval_long(tv); /* use ebp, so the climbframe algo works... */ if (value > 0) { @@ -1108,12 +1039,12 @@ static void link_ops_in_block_walker(ir_node *irn, void *data) * Block-walker: * Process all Call/Alloc/Free 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 - * and that connect the calls together. + * nodes inside the Block. We first order this list according to data dependency + * and that connect the nodes together. */ static void process_ops_in_block(ir_node *bl, void *data) { - be_abi_irg_t *env = data; + be_abi_irg_t *env = (be_abi_irg_t*)data; ir_node *curr_sp = env->init_sp; ir_node *irn; ir_node **nodes; @@ -1121,12 +1052,14 @@ static void process_ops_in_block(ir_node *bl, void *data) int n_nodes; n_nodes = 0; - for (irn = get_irn_link(bl); irn != NULL; irn = get_irn_link(irn)) { + for (irn = (ir_node*)get_irn_link(bl); irn != NULL; + irn = (ir_node*)get_irn_link(irn)) { ++n_nodes; } nodes = ALLOCAN(ir_node*, n_nodes); - for (irn = get_irn_link(bl), n = 0; irn; irn = get_irn_link(irn), ++n) { + for (irn = (ir_node*)get_irn_link(bl), n = 0; irn != NULL; + irn = (ir_node*)get_irn_link(irn), ++n) { nodes[n] = irn; } @@ -1209,9 +1142,8 @@ static ir_type *compute_arg_type(be_abi_irg_t *env, ir_graph *irg, ir_type *method_type, ir_type *val_param_tp, ir_entity ***param_map) { - const arch_env_t *arch_env = be_get_irg_arch_env(irg); int dir = env->call->flags.bits.left_to_right ? 1 : -1; - int inc = arch_env->stack_dir * dir; + int inc = -dir; int n = get_method_n_params(method_type); int curr = inc > 0 ? 0 : n - 1; struct obstack *obst = be_get_be_obst(irg); @@ -1262,98 +1194,38 @@ typedef struct { static int cmp_regs(const void *a, const void *b) { - const reg_node_map_t *p = a; - const reg_node_map_t *q = b; + const reg_node_map_t *p = (const reg_node_map_t*)a; + const reg_node_map_t *q = (const reg_node_map_t*)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; + return p->reg->reg_class < q->reg->reg_class ? -1 : +1; } static void reg_map_to_arr(reg_node_map_t *res, pmap *reg_map) { pmap_entry *ent; - int n = pmap_count(reg_map); - int i = 0; + size_t n = pmap_count(reg_map); + size_t i = 0; foreach_pmap(reg_map, ent) { - res[i].reg = ent->key; - res[i].irn = ent->value; + res[i].reg = (const arch_register_t*)ent->key; + res[i].irn = (ir_node*)ent->value; i++; } qsort(res, n, sizeof(res[0]), cmp_regs); } -/** - * Creates a barrier. - */ -static ir_node *create_barrier(ir_node *bl, ir_node **mem, pmap *regs, - int in_req) -{ - int n_regs = pmap_count(regs); - int n; - ir_node *irn; - ir_node **in; - reg_node_map_t *rm; - - in = ALLOCAN(ir_node*, n_regs+1); - rm = ALLOCAN(reg_node_map_t, n_regs); - reg_map_to_arr(rm, regs); - for (n = 0; n < n_regs; ++n) { - in[n] = rm[n].irn; - } - - if (mem) { - in[n++] = *mem; - } - - irn = be_new_Barrier(bl, n, in); - - for (n = 0; n < n_regs; ++n) { - ir_node *pred = rm[n].irn; - const arch_register_t *reg = rm[n].reg; - arch_register_type_t add_type = 0; - ir_node *proj; - const backend_info_t *info; - - /* stupid workaround for now... as not all nodes report register - * requirements. */ - info = be_get_info(skip_Proj(pred)); - if (info != NULL && info->out_infos != NULL) { - const arch_register_req_t *ireq = arch_get_register_req_out(pred); - if (ireq->type & arch_register_req_type_ignore) - add_type |= arch_register_req_type_ignore; - if (ireq->type & arch_register_req_type_produces_sp) - add_type |= arch_register_req_type_produces_sp; - } - - proj = new_r_Proj(irn, get_irn_mode(pred), n); - be_node_set_reg_class_in(irn, n, reg->reg_class); - if (in_req) - be_set_constr_single_reg_in(irn, n, reg, 0); - be_set_constr_single_reg_out(irn, n, reg, add_type); - arch_set_irn_register(proj, reg); - - pmap_insert(regs, (void *) reg, proj); - } - - if (mem) { - *mem = new_r_Proj(irn, mode_M, n); - } - - 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 + * @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) @@ -1363,8 +1235,8 @@ static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, const arch_env_t *arch_env = be_get_irg_arch_env(irg); dbg_info *dbgi; pmap *reg_map = pmap_create(); - ir_node *keep = pmap_get(env->keep_map, bl); - int in_max; + ir_node *keep = (ir_node*)pmap_get(env->keep_map, bl); + size_t in_max; ir_node *ret; int i, n; unsigned pop; @@ -1397,17 +1269,13 @@ static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, /* Add uses of the callee save registers. */ foreach_pmap(env->regs, ent) { - const arch_register_t *reg = ent->key; - if (arch_register_type_is(reg, callee_save) || arch_register_type_is(reg, ignore)) + const arch_register_t *reg = (const arch_register_t*)ent->key; + if (reg->type & (arch_register_type_callee_save | arch_register_type_ignore)) pmap_insert(reg_map, ent->key, ent->value); } be_abi_reg_map_set(reg_map, arch_env->sp, stack); - /* Make the Epilogue node and call the arch's epilogue maker. */ - create_barrier(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 @@ -1438,8 +1306,8 @@ static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, /* grow the rest of the stuff. */ foreach_pmap(reg_map, ent) { if (ent->value) { - in[n] = ent->value; - regs[n++] = ent->key; + in[n] = (ir_node*)ent->value; + regs[n++] = (const arch_register_t*)ent->key; } } @@ -1458,7 +1326,7 @@ static ir_node *create_be_return(be_abi_irg_t *env, ir_node *irn, ir_node *bl, if (regs[i] == NULL) continue; - be_node_set_reg_class_in(ret, i, regs[i]->reg_class); + be_set_constr_single_reg_in(ret, i, regs[i], arch_register_req_type_none); } /* Free the space of the Epilog's in array and the register <-> proj map. */ @@ -1492,7 +1360,7 @@ typedef struct lower_frame_sels_env_t { */ static ir_entity *get_argument_entity(ir_entity *ent, lower_frame_sels_env_t *ctx) { - ir_entity *argument_ent = get_entity_link(ent); + ir_entity *argument_ent = (ir_entity*)get_entity_link(ent); if (argument_ent == NULL) { /* we have NO argument entity yet: This is bad, as we will @@ -1525,7 +1393,7 @@ static ir_entity *get_argument_entity(ir_entity *ent, lower_frame_sels_env_t *ct */ static void lower_frame_sels_walker(ir_node *irn, void *data) { - lower_frame_sels_env_t *ctx = data; + lower_frame_sels_env_t *ctx = (lower_frame_sels_env_t*)data; if (is_Sel(irn)) { ir_node *ptr = get_Sel_ptr(irn); @@ -1617,7 +1485,7 @@ static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_graph *irg, restore_optimization_state(&state); /* reroute all edges to the new memory source */ - edges_reroute(imem, nmem, irg); + edges_reroute(imem, nmem); store = NULL; mem = imem; @@ -1636,7 +1504,7 @@ static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_graph *irg, /* the backing store itself */ store = new_r_Store(first_bl, mem, addr, - new_r_Proj(args, mode, i), 0); + new_r_Proj(args, mode, i), cons_none); } /* the new memory Proj gets the last Proj from store */ set_Proj_pred(nmem, store); @@ -1681,25 +1549,13 @@ static void fix_address_of_parameter_access(be_abi_irg_t *env, ir_graph *irg, */ static void fix_start_block(ir_graph *irg) { - ir_node *initial_X = get_irg_initial_exec(irg); - ir_node *start_block = get_irg_start_block(irg); - const ir_edge_t *edge; + ir_node *initial_X = get_irg_initial_exec(irg); + ir_node *start_block = get_irg_start_block(irg); + ir_node *jmp = new_r_Jmp(start_block); assert(is_Proj(initial_X)); - - foreach_out_edge(initial_X, edge) { - ir_node *block = get_edge_src_irn(edge); - - if (is_Anchor(block)) - continue; - if (block != start_block) { - ir_node *jmp = new_r_Jmp(start_block); - set_Block_cfgpred(block, get_edge_src_pos(edge), jmp); - set_irg_initial_exec(irg, jmp); - return; - } - } - panic("Initial exec has no follow block in %+F", irg); + exchange(initial_X, jmp); + set_irg_initial_exec(irg, new_r_Bad(irg)); } /** @@ -1707,7 +1563,7 @@ static void fix_start_block(ir_graph *irg) */ static void update_outer_frame_sels(ir_node *irn, void *env) { - lower_frame_sels_env_t *ctx = env; + lower_frame_sels_env_t *ctx = (lower_frame_sels_env_t*)env; ir_node *ptr; ir_entity *ent; int pos = 0; @@ -1781,6 +1637,7 @@ static void modify_irg(ir_graph *irg) const arch_env_t *arch_env = be_get_irg_arch_env(irg); const arch_register_t *sp = arch_env->sp; ir_type *method_type = get_entity_type(get_irg_entity(irg)); + be_irg_t *birg = be_birg_from_irg(irg); struct obstack *obst = be_get_be_obst(irg); be_stack_layout_t *stack_layout = be_get_irg_stack_layout(irg); ir_node *end; @@ -1806,8 +1663,6 @@ static void modify_irg(ir_graph *irg) DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg)); - /* Must fetch memory here, otherwise the start Barrier gets the wrong - * memory, which leads to loops in the DAG. */ old_mem = get_irg_initial_mem(irg); irp_reserve_resources(irp, IR_RESOURCE_ENTITY_LINK); @@ -1889,10 +1744,10 @@ static void modify_irg(ir_graph *irg) } } - bet_type = call->cb->get_between_type(env->cb); - stack_frame_init(stack_layout, arg_type, bet_type, - get_irg_frame_type(irg), arch_env->stack_dir, param_map); stack_layout->sp_relative = call->flags.bits.try_omit_fp; + bet_type = call->cb->get_between_type(irg); + stack_frame_init(stack_layout, arg_type, bet_type, + get_irg_frame_type(irg), param_map); /* Count the register params and add them to the number of Projs for the RegParams node */ for (i = 0; i < n_params; ++i) { @@ -1908,17 +1763,19 @@ static void modify_irg(ir_graph *irg) } /* Collect all callee-save registers */ - for (i = 0, n = arch_env_get_n_reg_class(arch_env); i < n; ++i) { - const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i); + for (i = 0, n = arch_env->n_register_classes; i < n; ++i) { + const arch_register_class_t *cls = &arch_env->register_classes[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) || - arch_register_type_is(reg, state)) { + if (reg->type & (arch_register_type_callee_save | arch_register_type_state)) { pmap_insert(env->regs, (void *) reg, NULL); } } } + fp_reg = call->flags.bits.try_omit_fp ? arch_env->sp : arch_env->bp; + rbitset_clear(birg->allocatable_regs, fp_reg->global_index); + /* handle start block here (place a jump in the block) */ fix_start_block(irg); @@ -1926,26 +1783,29 @@ static void modify_irg(ir_graph *irg) pmap_insert(env->regs, (void *) arch_env->bp, NULL); start_bl = get_irg_start_block(irg); env->start = be_new_Start(NULL, start_bl, pmap_count(env->regs) + 1); + set_irg_start(irg, env->start); /* * 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. + * Note, that if a register corresponds to an argument, the regs map + * contains the old Proj from start for that argument. */ - rm = ALLOCAN(reg_node_map_t, pmap_count(env->regs)); reg_map_to_arr(rm, env->regs); for (i = 0, n = pmap_count(env->regs); i < n; ++i) { - arch_register_t *reg = (void *) rm[i].reg; + const arch_register_t *reg = rm[i].reg; ir_mode *mode = reg->reg_class->mode; long nr = i; - arch_register_req_type_t add_type = 0; + arch_register_req_type_t add_type = arch_register_req_type_none; ir_node *proj; if (reg == sp) - add_type |= arch_register_req_type_produces_sp | arch_register_req_type_ignore; + add_type |= arch_register_req_type_produces_sp; + if (!rbitset_is_set(birg->allocatable_regs, reg->global_index)) { + add_type |= arch_register_req_type_ignore; + } assert(nr >= 0); proj = new_r_Proj(env->start, mode, nr + 1); @@ -1963,23 +1823,11 @@ static void modify_irg(ir_graph *irg) mem = new_mem_proj; set_irg_initial_mem(irg, mem); - /* Generate the Prologue */ - fp_reg = call->cb->prologue(env->cb, &mem, env->regs, &stack_layout->initial_bias); - - /* 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, start_bl, env->init_sp, BE_STACK_FRAME_SIZE_EXPAND, 0); - be_abi_reg_map_set(env->regs, sp, env->init_sp); - - create_barrier(start_bl, &mem, env->regs, 0); - env->init_sp = be_abi_reg_map_get(env->regs, sp); - arch_set_irn_register(env->init_sp, sp); + /* set new frame_pointer */ 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); /* rewire old mem users to new mem */ exchange(old_mem, mem); @@ -2005,7 +1853,7 @@ static void modify_irg(ir_graph *irg) param_type = get_method_param_type(method_type, nr); if (arg->in_reg) { - repl = pmap_get(env->regs, (void *) arg->reg); + repl = (ir_node*)pmap_get(env->regs, arg->reg); } else if (arg->on_stack) { ir_node *addr = be_new_FrameAddr(sp->reg_class, start_bl, frame_pointer, arg->stack_ent); @@ -2014,7 +1862,7 @@ static void modify_irg(ir_graph *irg) ir_mode *mode = get_type_mode(param_type); ir_mode *load_mode = arg->load_mode; - ir_node *load = new_r_Load(start_bl, new_NoMem(), addr, load_mode, cons_floats); + ir_node *load = new_r_Load(start_bl, new_r_NoMem(irg), addr, load_mode, cons_floats); repl = new_r_Proj(load, load_mode, pn_Load_res); if (mode != load_mode) { @@ -2071,13 +1919,13 @@ static void fix_call_state_inputs(ir_graph *irg) arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0); /* Collect caller save registers */ - n = arch_env_get_n_reg_class(arch_env); + n = arch_env->n_register_classes; for (i = 0; i < n; ++i) { unsigned j; - const arch_register_class_t *cls = arch_env_get_reg_class(arch_env, i); + const arch_register_class_t *cls = &arch_env->register_classes[i]; for (j = 0; j < cls->n_regs; ++j) { const arch_register_t *reg = arch_register_for_index(cls, j); - if (arch_register_type_is(reg, state)) { + if (reg->type & arch_register_type_state) { ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg); } } @@ -2125,7 +1973,7 @@ static ir_entity *create_trampoline(be_main_env_t *be, ir_entity *method) */ static ir_entity *get_trampoline(be_main_env_t *env, ir_entity *method) { - ir_entity *result = pmap_get(env->ent_trampoline_map, method); + ir_entity *result = (ir_entity*)pmap_get(env->ent_trampoline_map, method); if (result == NULL) { result = create_trampoline(env, method); pmap_insert(env->ent_trampoline_map, method, result); @@ -2150,7 +1998,7 @@ static ir_entity *create_pic_symbol(be_main_env_t *be, ir_entity *entity) static ir_entity *get_pic_symbol(be_main_env_t *env, ir_entity *entity) { - ir_entity *result = pmap_get(env->ent_pic_symbol_map, entity); + ir_entity *result = (ir_entity*)pmap_get(env->ent_pic_symbol_map, entity); if (result == NULL) { result = create_pic_symbol(env, entity); pmap_insert(env->ent_pic_symbol_map, entity, result); @@ -2170,18 +2018,26 @@ static int can_address_relative(ir_entity *entity) && !(get_entity_linkage(entity) & IR_LINKAGE_MERGE); } +static ir_node *get_pic_base(ir_graph *irg) +{ + const arch_env_t *arch_env = be_get_irg_arch_env(irg); + if (arch_env->impl->get_pic_base == NULL) + return NULL; + return arch_env->impl->get_pic_base(irg); +} + /** patches SymConsts to work in position independent code */ static void fix_pic_symconsts(ir_node *node, void *data) { - ir_node *pic_base; - ir_node *add; - ir_node *block; - ir_mode *mode; - ir_node *load; - ir_node *load_res; - ir_graph *irg = get_irn_irg(node); - int arity, i; - be_main_env_t *be = be_get_irg_main_env(irg); + ir_graph *irg = get_irn_irg(node); + be_main_env_t *be = be_get_irg_main_env(irg); + ir_node *pic_base; + ir_node *add; + ir_node *block; + ir_mode *mode; + ir_node *load; + ir_node *load_res; + int arity, i; (void) data; arity = get_irn_arity(node); @@ -2210,14 +2066,14 @@ static void fix_pic_symconsts(ir_node *node, void *data) dbgi = get_irn_dbg_info(pred); trampoline = get_trampoline(be, entity); trampoline_const = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code, - trampoline, NULL); + trampoline); set_irn_n(node, i, trampoline_const); continue; } /* everything else is accessed relative to EIP */ mode = get_irn_mode(pred); - pic_base = arch_code_generator_get_pic_base(be_get_irg_cg(irg)); + pic_base = get_pic_base(irg); /* all ok now for locally constructed stuff */ if (can_address_relative(entity)) { @@ -2233,57 +2089,42 @@ static void fix_pic_symconsts(ir_node *node, void *data) dbgi = get_irn_dbg_info(pred); pic_symbol = get_pic_symbol(be, entity); pic_symconst = new_rd_SymConst_addr_ent(dbgi, irg, mode_P_code, - pic_symbol, NULL); + pic_symbol); add = new_r_Add(block, pic_base, pic_symconst, mode); mark_irn_visited(add); /* we need an extra indirection for global data outside our current module. The loads are always safe and can therefore float and need no memory input */ - load = new_r_Load(block, new_NoMem(), add, mode, cons_floats); + load = new_r_Load(block, new_r_NoMem(irg), add, mode, cons_floats); load_res = new_r_Proj(load, mode, pn_Load_res); set_irn_n(node, i, load_res); } } -be_abi_irg_t *be_abi_introduce(ir_graph *irg) +void be_abi_introduce(ir_graph *irg) { be_abi_irg_t *env = XMALLOCZ(be_abi_irg_t); ir_node *old_frame = get_irg_frame(irg); - struct obstack *obst = be_get_be_obst(irg); be_options_t *options = be_get_irg_options(irg); const arch_env_t *arch_env = be_get_irg_arch_env(irg); ir_entity *entity = get_irg_entity(irg); ir_type *method_type = get_entity_type(entity); - - pmap_entry *ent; - ir_node *dummy; - unsigned *limited_bitset; - arch_register_req_t *sp_req; - - be_omit_fp = options->omit_fp; - be_omit_leaf_fp = options->omit_leaf_fp; - - obstack_init(obst); - - env->ignore_regs = pset_new_ptr_default(); - env->keep_map = pmap_create(); - env->dce_survivor = new_survive_dce(); - - sp_req = OALLOCZ(obst, arch_register_req_t); - env->sp_req = sp_req; - - sp_req->type = arch_register_req_type_limited - | arch_register_req_type_produces_sp; - sp_req->cls = arch_register_get_class(arch_env->sp); - sp_req->width = 1; - - limited_bitset = rbitset_obstack_alloc(obst, sp_req->cls->n_regs); - rbitset_set(limited_bitset, arch_register_get_index(arch_env->sp)); - sp_req->limited = limited_bitset; - if (arch_env->sp->type & arch_register_type_ignore) { - sp_req->type |= arch_register_req_type_ignore; + be_irg_t *birg = be_birg_from_irg(irg); + struct obstack *obst = &birg->obst; + ir_node *dummy = new_r_Dummy(irg, + arch_env->sp->reg_class->mode); + unsigned r; + + /* determine allocatable registers */ + assert(birg->allocatable_regs == NULL); + birg->allocatable_regs = rbitset_obstack_alloc(obst, arch_env->n_registers); + for (r = 0; r < arch_env->n_registers; ++r) { + const arch_register_t *reg = &arch_env->registers[r]; + if ( !(reg->type & arch_register_type_ignore)) { + rbitset_set(birg->allocatable_regs, r); + } } /* break here if backend provides a custom API. @@ -2291,13 +2132,14 @@ be_abi_irg_t *be_abi_introduce(ir_graph *irg) * but need more cleanup to make this work */ be_set_irg_abi(irg, env); - if (arch_env->custom_abi) - return env; - env->call = be_abi_call_new(arch_env->sp->reg_class); + be_omit_fp = options->omit_fp; + + env->keep_map = pmap_create(); + env->call = be_abi_call_new(arch_env->sp->reg_class); arch_env_get_call_abi(arch_env, method_type, env->call); - env->init_sp = dummy = new_r_Dummy(irg, arch_env->sp->reg_class->mode); + env->init_sp = dummy; env->calls = NEW_ARR_F(ir_node*, 0); if (options->pic) { @@ -2307,12 +2149,6 @@ be_abi_irg_t *be_abi_introduce(ir_graph *irg) /* Lower all call nodes in the IRG. */ process_calls(irg); - /* - Beware: init backend abi call object after processing calls, - otherwise some information might be not yet available. - */ - env->cb = env->call->cb->init(env->call, irg); - /* Process the IRG */ modify_irg(irg); @@ -2331,15 +2167,8 @@ be_abi_irg_t *be_abi_introduce(ir_graph *irg) exchange(dummy, env->init_sp); exchange(old_frame, get_irg_frame(irg)); - /* Make some important node pointers survive the dead node elimination. */ - survive_dce_register_irn(env->dce_survivor, &env->init_sp); - foreach_pmap(env->regs, ent) { - survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value); - } - - env->call->cb->done(env->cb); - env->cb = NULL; - return env; + pmap_destroy(env->regs); + env->regs = NULL; } void be_abi_free(ir_graph *irg) @@ -2348,326 +2177,52 @@ void be_abi_free(ir_graph *irg) if (env->call != NULL) be_abi_call_free(env->call); - free_survive_dce(env->dce_survivor); - if (env->ignore_regs != NULL) - del_pset(env->ignore_regs); - if (env->regs != NULL) - pmap_destroy(env->regs); free(env); + assert(env->regs == NULL); be_set_irg_abi(irg, NULL); } -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); -} - -void be_abi_set_non_ignore_regs(be_abi_irg_t *abi, const arch_register_class_t *cls, unsigned *raw_bitset) +void be_put_allocatable_regs(const ir_graph *irg, + const arch_register_class_t *cls, bitset_t *bs) { - unsigned i; - arch_register_t *reg; + be_irg_t *birg = be_birg_from_irg(irg); + unsigned *allocatable_regs = birg->allocatable_regs; + unsigned i; + assert(bitset_size(bs) == cls->n_regs); + bitset_clear_all(bs); for (i = 0; i < cls->n_regs; ++i) { - if (arch_register_type_is(&cls->regs[i], ignore)) - continue; - - rbitset_set(raw_bitset, i); - } - - for (reg = pset_first(abi->ignore_regs); reg != NULL; - reg = pset_next(abi->ignore_regs)) { - if (reg->reg_class != cls) - continue; - - rbitset_clear(raw_bitset, reg->index); + const arch_register_t *reg = &cls->regs[i]; + if (rbitset_is_set(allocatable_regs, reg->global_index)) + bitset_set(bs, i); } } -/* - _____ _ ____ _ _ - | ___(_)_ __ / ___|| |_ __ _ ___| | __ - | |_ | \ \/ / \___ \| __/ _` |/ __| |/ / - | _| | |> < ___) | || (_| | (__| < - |_| |_/_/\_\ |____/ \__\__,_|\___|_|\_\ - -*/ - -typedef ir_node **node_array; - -typedef struct fix_stack_walker_env_t { - node_array sp_nodes; -} fix_stack_walker_env_t; - -/** - * Walker. Collect all stack modifying nodes. - */ -static void collect_stack_nodes_walker(ir_node *node, void *data) +unsigned be_get_n_allocatable_regs(const ir_graph *irg, + const arch_register_class_t *cls) { - ir_node *insn = node; - fix_stack_walker_env_t *env = data; - const arch_register_req_t *req; - - if (is_Proj(node)) { - insn = get_Proj_pred(node); - } - - if (arch_irn_get_n_outs(insn) == 0) - return; - if (get_irn_mode(node) == mode_T) - return; - - req = arch_get_register_req_out(node); - if (! (req->type & arch_register_req_type_produces_sp)) - return; - - ARR_APP1(ir_node*, env->sp_nodes, node); + bitset_t *bs = bitset_alloca(cls->n_regs); + be_put_allocatable_regs(irg, cls, bs); + return bitset_popcount(bs); } -void be_abi_fix_stack_nodes(ir_graph *irg) -{ - be_abi_irg_t *abi = be_get_irg_abi(irg); - be_lv_t *lv = be_get_irg_liveness(irg); - const arch_env_t *arch_env = be_get_irg_arch_env(irg); - be_ssa_construction_env_t senv; - int i, len; - ir_node **phis; - fix_stack_walker_env_t walker_env; - - walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0); - - irg_walk_graph(irg, collect_stack_nodes_walker, NULL, &walker_env); - - /* nothing to be done if we didn't find any node, in fact we mustn't - * continue, as for endless loops incsp might have had no users and is bad - * now. - */ - len = ARR_LEN(walker_env.sp_nodes); - if (len == 0) { - DEL_ARR_F(walker_env.sp_nodes); - return; - } - - be_ssa_construction_init(&senv, irg); - be_ssa_construction_add_copies(&senv, walker_env.sp_nodes, - ARR_LEN(walker_env.sp_nodes)); - be_ssa_construction_fix_users_array(&senv, walker_env.sp_nodes, - ARR_LEN(walker_env.sp_nodes)); - - if (lv != NULL) { - len = ARR_LEN(walker_env.sp_nodes); - for (i = 0; i < len; ++i) { - be_liveness_update(lv, walker_env.sp_nodes[i]); - } - be_ssa_construction_update_liveness_phis(&senv, lv); - } - - phis = be_ssa_construction_get_new_phis(&senv); - - /* set register requirements for stack phis */ - len = ARR_LEN(phis); - for (i = 0; i < len; ++i) { - ir_node *phi = phis[i]; - be_set_phi_reg_req(phi, abi->sp_req); - arch_set_irn_register(phi, arch_env->sp); - } - be_ssa_construction_destroy(&senv); - - DEL_ARR_F(walker_env.sp_nodes); -} - -/** - * Fix all stack accessing operations in the block bl. - * - * @param bl the block to process - * @param real_bias the bias value - * - * @return the bias at the end of this block - */ -static int process_stack_bias(ir_node *bl, int real_bias) +void be_set_allocatable_regs(const ir_graph *irg, + const arch_register_class_t *cls, + unsigned *raw_bitset) { - int wanted_bias = real_bias; - ir_graph *irg = get_Block_irg(bl); - be_stack_layout_t *layout = be_get_irg_stack_layout(irg); - bool sp_relative = layout->sp_relative; - const arch_env_t *arch_env = be_get_irg_arch_env(irg); - ir_node *irn; + be_irg_t *birg = be_birg_from_irg(irg); + unsigned *allocatable_regs = birg->allocatable_regs; + unsigned i; - sched_foreach(bl, irn) { - int ofs; - - /* - Check, if the node relates to an entity on the stack frame. - If so, set the true offset (including the bias) for that - node. - */ - ir_entity *ent = arch_get_frame_entity(irn); - if (ent != NULL) { - int bias = sp_relative ? real_bias : 0; - int offset = be_get_stack_entity_offset(layout, ent, bias); - arch_set_frame_offset(irn, offset); - DBG((dbg, LEVEL_2, "%F has offset %d (including bias %d)\n", - ent, offset, bias)); - } - - /* - * If the node modifies the stack pointer by a constant offset, - * record that in the bias. - */ - ofs = arch_get_sp_bias(irn); - - if (be_is_IncSP(irn)) { - /* fill in real stack frame size */ - if (ofs == BE_STACK_FRAME_SIZE_EXPAND) { - ir_type *frame_type = get_irg_frame_type(irg); - ofs = (int) get_type_size_bytes(frame_type); - be_set_IncSP_offset(irn, ofs); - } else if (ofs == BE_STACK_FRAME_SIZE_SHRINK) { - ir_type *frame_type = get_irg_frame_type(irg); - ofs = - (int)get_type_size_bytes(frame_type); - be_set_IncSP_offset(irn, ofs); - } else { - if (be_get_IncSP_align(irn)) { - /* patch IncSP to produce an aligned stack pointer */ - ir_type *between_type = layout->between_type; - int between_size = get_type_size_bytes(between_type); - int alignment = 1 << arch_env->stack_alignment; - int delta = (real_bias + ofs + between_size) & (alignment - 1); - assert(ofs >= 0); - if (delta > 0) { - be_set_IncSP_offset(irn, ofs + alignment - delta); - real_bias += alignment - delta; - } - } else { - /* adjust so real_bias corresponds with wanted_bias */ - int delta = wanted_bias - real_bias; - assert(delta <= 0); - if (delta != 0) { - be_set_IncSP_offset(irn, ofs + delta); - real_bias += delta; - } - } - } - } - - real_bias += ofs; - wanted_bias += ofs; - } - - assert(real_bias == wanted_bias); - return real_bias; -} - -/** - * A helper struct for the bias walker. - */ -struct bias_walk { - int start_block_bias; /**< The bias at the end of the start block. */ - int between_size; - ir_node *start_block; /**< The start block of the current graph. */ -}; - -/** - * Block-Walker: fix all stack offsets for all blocks - * except the start block - */ -static void stack_bias_walker(ir_node *bl, void *data) -{ - struct bias_walk *bw = data; - if (bl != bw->start_block) { - process_stack_bias(bl, bw->start_block_bias); - } -} - -/** - * Walker: finally lower all Sels of outer frame or parameter - * entities. - */ -static void lower_outer_frame_sels(ir_node *sel, void *ctx) -{ - ir_node *ptr; - ir_entity *ent; - ir_type *owner; - be_stack_layout_t *layout; - ir_graph *irg; - (void) ctx; - - if (! is_Sel(sel)) - return; - - ent = get_Sel_entity(sel); - owner = get_entity_owner(ent); - ptr = get_Sel_ptr(sel); - irg = get_irn_irg(sel); - layout = be_get_irg_stack_layout(irg); - - if (owner == layout->frame_type || owner == layout->arg_type) { - /* found access to outer frame or arguments */ - int offset = be_get_stack_entity_offset(layout, ent, 0); - - if (offset != 0) { - ir_node *bl = get_nodes_block(sel); - dbg_info *dbgi = get_irn_dbg_info(sel); - ir_mode *mode = get_irn_mode(sel); - ir_mode *mode_UInt = get_reference_mode_unsigned_eq(mode); - ir_node *cnst = new_r_Const_long(current_ir_graph, mode_UInt, offset); - - ptr = new_rd_Add(dbgi, bl, ptr, cnst, mode); - } - exchange(sel, ptr); - } -} - -void be_abi_fix_stack_bias(ir_graph *irg) -{ - be_stack_layout_t *stack_layout = be_get_irg_stack_layout(irg); - ir_type *frame_tp; - int i; - struct bias_walk bw; - - stack_frame_compute_initial_offset(stack_layout); - // stack_layout_dump(stdout, stack_layout); - - /* Determine the stack bias at the end of the start block. */ - bw.start_block_bias = process_stack_bias(get_irg_start_block(irg), - stack_layout->initial_bias); - bw.between_size = get_type_size_bytes(stack_layout->between_type); - - /* fix the bias is all other blocks */ - bw.start_block = get_irg_start_block(irg); - irg_block_walk_graph(irg, stack_bias_walker, NULL, &bw); - - /* fix now inner functions: these still have Sel node to outer - frame and parameter entities */ - frame_tp = get_irg_frame_type(irg); - for (i = get_class_n_members(frame_tp) - 1; i >= 0; --i) { - ir_entity *ent = get_class_member(frame_tp, i); - ir_graph *irg = get_entity_irg(ent); - - if (irg != NULL) { - irg_walk_graph(irg, NULL, lower_outer_frame_sels, NULL); - } + rbitset_clear_all(raw_bitset, cls->n_regs); + for (i = 0; i < cls->n_regs; ++i) { + const arch_register_t *reg = &cls->regs[i]; + if (rbitset_is_set(allocatable_regs, reg->global_index)) + rbitset_set(raw_bitset, i); } } -ir_node *be_abi_get_callee_save_irn(be_abi_irg_t *abi, const arch_register_t *reg) -{ - assert(arch_register_type_is(reg, callee_save)); - assert(pmap_contains(abi->regs, (void *) reg)); - return pmap_get(abi->regs, (void *) reg); -} - -ir_node *be_abi_get_ignore_irn(be_abi_irg_t *abi, const arch_register_t *reg) -{ - assert(arch_register_type_is(reg, ignore)); - assert(pmap_contains(abi->regs, (void *) reg)); - return pmap_get(abi->regs, (void *) reg); -} - BE_REGISTER_MODULE_CONSTRUCTOR(be_init_abi); void be_init_abi(void) {