-/**
- * ABI lowering.
+/*
+ * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
*
- * @author Sebastian Hack
- * @date 7.3.2005
- * @cvsid $Id$
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
+/**
+ * @file
+ * @brief Backend ABI implementation.
+ * @author Sebastian Hack, Michael Beck
+ * @version $Id$
*/
#ifdef HAVE_CONFIG_H
-# include <config.h>
+# include "config.h"
#endif
#include "obst.h"
#include "offset.h"
-#include "type.h"
#include "irgopt.h"
#include "irgraph_t.h"
#include "pdeq.h"
#include "irtools.h"
#include "raw_bitset.h"
+#include "error.h"
#include "be.h"
#include "beabi.h"
-#include "bearch.h"
+#include "bearch_t.h"
#include "benode_t.h"
#include "belive_t.h"
#include "besched_t.h"
-#include "beirg.h"
-#include "beirgmod.h"
+#include "beirg_t.h"
+#include "bessaconstr.h"
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. */
int pos;
const arch_register_t *reg;
ir_entity *stack_ent;
- unsigned alignment;
- unsigned space_before;
- unsigned space_after;
+ unsigned alignment; /**< stack alignment */
+ unsigned space_before; /**< allocate space before */
+ unsigned space_after; /**< allocate space after */
} be_abi_call_arg_t;
struct _be_abi_call_t {
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. */
+ at the start of the function. */
ir_node *start_barrier; /**< The barrier of the start block */
ir_node *reg_params; /**< The reg params node. */
pmap *regs; /**< A map of all callee-save and ignore regs to
- their Projs to the RegParams node. */
+ their Projs to the RegParams node. */
- int start_block_bias; /**< The stack bias at the end of the start block. */
+ int start_block_bias; /**< The stack bias at the end of the start block. */
void *cb; /**< ABI Callback self pointer. */
DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< The debugging module. */
};
-#if 0
-#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;
-#endif
static heights_t *ir_heights;
/* Flag: if set, try to omit the frame pointer if called by the backend */
static int cmp_call_arg(const void *a, const void *b, size_t n)
{
const be_abi_call_arg_t *p = a, *q = b;
+ (void) n;
return !(p->is_res == q->is_res && p->pos == q->pos);
}
*/
/**
- * Transform a call node.
+ * Transform a call node into a be_Call node.
+ *
* @param env The ABI environment for the current irg.
* @param irn The call node.
* @param curr_sp The stack pointer node to use.
*/
static ir_node *adjust_call(be_abi_irg_t *env, ir_node *irn, ir_node *curr_sp, ir_node *alloca_copy)
{
- ir_graph *irg = env->birg->irg;
- const arch_isa_t *isa = env->birg->main_env->arch_env->isa;
- ir_type *mt = get_Call_type(irn);
- ir_node *call_ptr = get_Call_ptr(irn);
- int n_params = get_method_n_params(mt);
- ir_node *curr_mem = get_Call_mem(irn);
- ir_node *bl = get_nodes_block(irn);
- pset *results = pset_new_ptr(8);
- pset *caller_save = pset_new_ptr(8);
- pset *states = pset_new_ptr(2);
- int stack_size = 0;
- int stack_dir = arch_isa_stack_dir(isa);
- const arch_register_t *sp = arch_isa_sp(isa);
- be_abi_call_t *call = be_abi_call_new(sp->reg_class);
- ir_mode *mach_mode = sp->reg_class->mode;
- struct obstack *obst = &env->obst;
- int no_alloc = call->flags.bits.frame_is_setup_on_call;
-
- ir_node *res_proj = NULL;
- int curr_res_proj = pn_Call_max;
- int n_low_args = 0;
- int n_pos = 0;
- int count;
+ ir_graph *irg = env->birg->irg;
+ const arch_env_t *arch_env = env->birg->main_env->arch_env;
+ const arch_isa_t *isa = arch_env->isa;
+ ir_type *mt = get_Call_type(irn);
+ ir_node *call_ptr = get_Call_ptr(irn);
+ int n_params = get_method_n_params(mt);
+ ir_node *curr_mem = get_Call_mem(irn);
+ ir_node *bl = get_nodes_block(irn);
+ pset *results = pset_new_ptr(8);
+ pset *caller_save = pset_new_ptr(8);
+ pset *states = pset_new_ptr(2);
+ int stack_size = 0;
+ int stack_dir = arch_isa_stack_dir(isa);
+ const arch_register_t *sp = arch_isa_sp(isa);
+ be_abi_call_t *call = be_abi_call_new(sp->reg_class);
+ ir_mode *mach_mode = sp->reg_class->mode;
+ struct obstack *obst = &env->obst;
+ int no_alloc = call->flags.bits.frame_is_setup_on_call;
+
+ ir_node *res_proj = NULL;
+ int curr_res_proj = pn_Call_max;
+ int n_reg_params = 0;
+ int n_stack_params = 0;
+ int n_ins;
ir_node *low_call;
ir_node **in;
ir_node **res_projs;
const arch_register_t *reg;
const ir_edge_t *edge;
- int *low_args;
- int *pos;
+ int *reg_param_idxs;
+ int *stack_param_idx;
int i, n;
/* Let the isa fill out the abi description for that call node. */
/* Insert code to put the stack arguments on the stack. */
assert(get_Call_n_params(irn) == n_params);
- for(i = 0; i < n_params; ++i) {
+ for (i = 0; i < n_params; ++i) {
be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
assert(arg);
if (arg->on_stack) {
stack_size += round_up2(arg_size, arg->alignment);
stack_size += round_up2(arg->space_after, arg->alignment);
obstack_int_grow(obst, i);
- n_pos++;
+ ++n_stack_params;
}
}
- pos = obstack_finish(obst);
+ stack_param_idx = obstack_finish(obst);
/* Collect all arguments which are passed in registers. */
- for(i = 0, n = get_Call_n_params(irn); i < n; ++i) {
+ for (i = 0; i < n_params; ++i) {
be_abi_call_arg_t *arg = get_call_arg(call, 0, i);
- if(arg && arg->in_reg) {
+ if (arg && arg->in_reg) {
obstack_int_grow(obst, i);
- n_low_args++;
+ ++n_reg_params;
}
}
- low_args = obstack_finish(obst);
+ reg_param_idxs = obstack_finish(obst);
/* If there are some parameters which shall be passed on the stack. */
- if(n_pos > 0) {
+ if (n_stack_params > 0) {
int curr_ofs = 0;
int do_seq = call->flags.bits.store_args_sequential && !no_alloc;
* 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];
- pos[other] = tmp;
+ for (i = 0; i < n_stack_params >> 1; ++i) {
+ int other = n_stack_params - i - 1;
+ int tmp = stack_param_idx[i];
+ stack_param_idx[i] = stack_param_idx[other];
+ stack_param_idx[other] = tmp;
}
}
* 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 && !no_alloc) {
+ if (stack_dir < 0 && !do_seq && !no_alloc) {
curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, stack_size);
- if(alloca_copy) {
+ if (alloca_copy) {
add_irn_dep(curr_sp, alloca_copy);
alloca_copy = NULL;
}
}
- if(!do_seq) {
+ if (! do_seq) {
obstack_ptr_grow(obst, get_Call_mem(irn));
curr_mem = new_NoMem();
} else {
curr_mem = get_Call_mem(irn);
}
- for(i = 0; i < n_pos; ++i) {
- int p = pos[i];
+ for (i = 0; i < n_stack_params; ++i) {
+ int p = stack_param_idx[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;
if (do_seq) {
curr_ofs = 0;
addr = curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, param_size + arg->space_before);
- if(alloca_copy) {
+ if (alloca_copy) {
add_irn_dep(curr_sp, alloca_copy);
alloca_copy = NULL;
}
curr_ofs = round_up2(curr_ofs, arg->alignment);
/* Make the expression to compute the argument's offset. */
- if(curr_ofs > 0) {
+ if (curr_ofs > 0) {
ir_mode *constmode = mach_mode;
if(mode_is_reference(mach_mode)) {
constmode = mode_Is;
in = (ir_node **) obstack_finish(obst);
/* We need the sync only, if we didn't build the stores sequentially. */
- if(!do_seq) {
- if(n_pos >= 1) {
- curr_mem = new_r_Sync(irg, bl, n_pos + 1, in);
+ if (! do_seq) {
+ if (n_stack_params >= 1) {
+ curr_mem = new_r_Sync(irg, bl, n_stack_params + 1, in);
} else {
curr_mem = get_Call_mem(irn);
}
}
/* Collect caller save registers */
- for(i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
+ for (i = 0, n = arch_isa_get_n_reg_class(isa); i < n; ++i) {
int j;
const arch_register_class_t *cls = arch_isa_get_reg_class(isa, i);
- for(j = 0; j < cls->n_regs; ++j) {
+ 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, caller_save)) {
+ if (arch_register_type_is(reg, caller_save)) {
pset_insert_ptr(caller_save, (void *) reg);
}
- if(arch_register_type_is(reg, state)) {
+ if (arch_register_type_is(reg, state)) {
pset_insert_ptr(caller_save, (void*) reg);
pset_insert_ptr(states, (void*) reg);
}
const ir_edge_t *res_edge;
ir_node *irn = get_edge_src_irn(edge);
- if(is_Proj(irn) && get_Proj_proj(irn) == pn_Call_T_result) {
+ if (is_Proj(irn) && get_Proj_proj(irn) == pn_Call_T_result) {
res_proj = irn;
foreach_out_edge(irn, res_edge) {
int proj;
assert(is_Proj(res));
proj = get_Proj_proj(res);
- arg = get_call_arg(call, 1, proj);
+ arg = get_call_arg(call, 1, proj);
/*
shift the proj number to the right, since we will drop the
set_Proj_proj(res, proj);
obstack_ptr_grow(obst, res);
- if(proj > curr_res_proj)
+ 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))
}
res_projs = obstack_finish(obst);
/* make the back end call node and set its register requirements. */
- for(i = 0; i < n_low_args; ++i) {
- obstack_ptr_grow(obst, get_Call_param(irn, low_args[i]));
+ for (i = 0; i < n_reg_params; ++i) {
+ obstack_ptr_grow(obst, get_Call_param(irn, reg_param_idxs[i]));
}
foreach_pset(states, reg) {
const arch_register_class_t *cls = arch_register_get_class(reg);
ir_node *regnode = new_rd_Unknown(irg, arch_register_class_mode(cls));
obstack_ptr_grow(obst, regnode);
}
- count = n_low_args + pset_count(states);
+ n_ins = n_reg_params + pset_count(states);
in = obstack_finish(obst);
- if(env->call->flags.bits.call_has_imm && get_irn_opcode(call_ptr) == iro_SymConst) {
+ if (env->call->flags.bits.call_has_imm && is_SymConst(call_ptr)) {
+ /* direct call */
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), count,
+ curr_res_proj + pset_count(caller_save), n_ins,
in, get_Call_type(irn));
be_Call_set_entity(low_call, get_SymConst_entity(call_ptr));
} else {
+ /* indirect call */
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),
- count, in, get_Call_type(irn));
+ n_ins, in, get_Call_type(irn));
}
- ARR_APP1(ir_node*, env->calls, low_call);
+ ARR_APP1(ir_node *, env->calls, low_call);
/*
Set the register class of the call address to
DBG((env->dbg, LEVEL_3, "\tcreated backend call %+F\n", low_call));
/* Set the register classes and constraints of the Call parameters. */
- for(i = 0; i < n_low_args; ++i) {
- int index = low_args[i];
+ for (i = 0; i < n_reg_params; ++i) {
+ int index = reg_param_idxs[i];
be_abi_call_arg_t *arg = get_call_arg(call, 0, index);
assert(arg->reg != NULL);
- be_set_constr_single_reg(low_call, be_pos_Call_first_arg + index, arg->reg);
+ be_set_constr_single_reg(low_call, be_pos_Call_first_arg + i, arg->reg);
}
/* Set the register constraints of the results. */
assert(arg->in_reg);
be_set_constr_single_reg(low_call, BE_OUT_POS(pn), arg->reg);
+ arch_set_irn_register(arch_env, res_projs[i], arg->reg);
}
obstack_free(obst, in);
exchange(irn, low_call);
set_Proj_pred(res_projs[i], low_call);
/* set the now unnecessary projT to bad */
- if(res_proj != NULL) {
+ if (res_proj != NULL) {
be_kill_node(res_proj);
}
}
/* Clean up the stack. */
- if(stack_size > 0) {
+ if (stack_size > 0) {
ir_node *mem_proj = NULL;
foreach_out_edge(low_call, edge) {
}
}
- if(!mem_proj) {
+ if (! mem_proj) {
mem_proj = new_r_Proj(irg, bl, low_call, mode_M, pn_Call_M);
keep_alive(mem_proj);
}
/* Clean up the stack frame if we allocated it */
- if(!no_alloc) {
+ if (! no_alloc) {
curr_sp = be_new_IncSP(sp, irg, bl, curr_sp, -stack_size);
add_irn_dep(curr_sp, mem_proj);
- if(alloca_copy) {
+ if (alloca_copy) {
add_irn_dep(curr_sp, alloca_copy);
alloca_copy = NULL;
}
}
be_abi_call_free(call);
- obstack_free(obst, pos);
+ obstack_free(obst, stack_param_idx);
del_pset(results);
del_pset(states);
del_pset(caller_save);
return curr_sp;
}
+/**
+ * Adjust the size of a node representing a stack alloc or free for the minimum stack alignment.
+ *
+ * @param alignment the minimum stack alignment
+ * @param size the node containing the non-aligned size
+ * @param irg the irg where new nodes are allocated on
+ * @param irg the block where new nodes are allocated on
+ * @param dbg debug info for new nodes
+ *
+ * @return a node representing the aligned size
+ */
+static ir_node *adjust_alloc_size(unsigned stack_alignment, ir_node *size, ir_graph *irg, ir_node *block, dbg_info *dbg) {
+ if (stack_alignment > 1) {
+ ir_mode *mode = get_irn_mode(size);
+ tarval *tv = new_tarval_from_long(stack_alignment-1, mode);
+ ir_node *mask = new_r_Const(irg, block, mode, tv);
+
+ size = new_rd_Add(dbg, irg, block, size, mask, mode);
+
+ tv = new_tarval_from_long(-(long)stack_alignment, mode);
+ mask = new_r_Const(irg, block, mode, tv);
+ size = new_rd_And(dbg, irg, block, size, mask, mode);
+ }
+ return size;
+}
/**
* Adjust an alloca.
* The alloca is transformed into a back end alloca node and connected to the stack nodes.
ir_node *alloc_mem;
ir_node *alloc_res;
ir_type *type;
+ dbg_info *dbg;
const ir_edge_t *edge;
- ir_node *new_alloc;
- ir_node *size;
- ir_node *addr;
- ir_node *copy;
- ir_node *ins[2];
+ ir_node *new_alloc, *size, *addr, *copy, *ins[2];
+ unsigned stack_alignment;
if (get_Alloc_where(alloc) != stack_alloc) {
assert(0);
return curr_sp;
}
+ dbg = get_irn_dbg_info(alloc);
+
/* we might need to multiply the size with the element size */
if(type != get_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(NULL, irg, block, mode_Iu, tv);
- ir_node *mul = new_rd_Mul(NULL, irg, block, get_Alloc_size(alloc),
+ ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
+ ir_node *mul = new_rd_Mul(dbg, irg, block, get_Alloc_size(alloc),
cnst, mode_Iu);
size = mul;
} else {
/* The stack pointer will be modified in an unknown manner.
We cannot omit it. */
env->call->flags.bits.try_omit_fp = 0;
+
+ /* FIXME: size must be here round up for the stack alignment, but
+ this must be transmitted from the backend. */
+ stack_alignment = 4;
+ size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
new_alloc = be_new_AddSP(env->isa->sp, irg, block, curr_sp, size);
+ set_irn_dbg_info(new_alloc, dbg);
if(alloc_mem != NULL) {
ir_node *addsp_mem;
addsp_mem = new_r_Proj(irg, block, new_alloc, mode_M, pn_be_AddSP_M);
- // We need to sync the output mem of the AddSP with the input mem
- // edge into the alloc node
+ /* We need to sync the output mem of the AddSP with the input mem
+ edge into the alloc node. */
ins[0] = get_Alloc_mem(alloc);
ins[1] = addsp_mem;
sync = new_r_Sync(irg, block, 2, ins);
ir_node *subsp, *mem, *res, *size, *sync;
ir_type *type;
ir_node *in[2];
+ ir_mode *sp_mode;
+ unsigned stack_alignment;
+ dbg_info *dbg;
if (get_Free_where(free) != stack_alloc) {
assert(0);
block = get_nodes_block(free);
irg = get_irn_irg(block);
type = get_Free_type(free);
+ sp_mode = env->isa->sp->reg_class->mode;
+ dbg = get_irn_dbg_info(free);
/* we might need to multiply the size with the element size */
if(type != get_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(NULL, irg, block, mode_Iu, tv);
- ir_node *mul = new_rd_Mul(NULL, irg, block, get_Free_size(free),
+ ir_node *cnst = new_rd_Const(dbg, irg, block, mode_Iu, tv);
+ ir_node *mul = new_rd_Mul(dbg, irg, block, get_Free_size(free),
cnst, mode_Iu);
size = mul;
} else {
size = get_Free_size(free);
}
+ /* FIXME: size must be here round up for the stack alignment, but
+ this must be transmitted from the backend. */
+ stack_alignment = 4;
+ size = adjust_alloc_size(stack_alignment, size, irg, block, dbg);
+
/* The stack pointer will be modified in an unknown manner.
We cannot omit it. */
env->call->flags.bits.try_omit_fp = 0;
subsp = be_new_SubSP(env->isa->sp, irg, block, curr_sp, size);
+ set_irn_dbg_info(subsp, dbg);
mem = new_r_Proj(irg, block, subsp, mode_M, pn_be_SubSP_M);
- res = new_r_Proj(irg, block, subsp, mode_P_data, pn_be_SubSP_res);
+ res = new_r_Proj(irg, block, subsp, sp_mode, pn_be_SubSP_res);
/* we need to sync the memory */
in[0] = get_Free_mem(free);
return heights_reachable_in_block(ir_heights, n1, n2);
}
-static int cmp_call_dependecy(const void *c1, const void *c2)
+static int cmp_call_dependency(const void *c1, const void *c2)
{
ir_node *n1 = *(ir_node **) c1;
ir_node *n2 = *(ir_node **) c2;
nodes = obstack_finish(&env->obst);
/* order the call nodes according to data dependency */
- qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependecy);
+ qsort(nodes, n, sizeof(nodes[0]), cmp_call_dependency);
for(i = n - 1; i >= 0; --i) {
ir_node *irn = nodes[i];
curr_sp = adjust_free(env, irn, curr_sp);
break;
default:
+ panic("invalid call");
break;
}
}
obstack_free(&env->obst, nodes);
/* Keep the last stack state in the block by tying it to Keep node */
- nodes[0] = curr_sp;
- keep = be_new_Keep(env->isa->sp->reg_class, get_irn_irg(bl), bl, 1, nodes);
- pmap_insert(env->keep_map, bl, keep);
+ if(curr_sp != env->init_sp) {
+ nodes[0] = curr_sp;
+ 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);
*/
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));
+ be_kill_node(keep);
+ remove_End_keepalive(get_irg_end(env->birg->irg), keep);
}
/* Insert results for Return into the register map. */
typedef struct lower_frame_sels_env_t {
be_abi_irg_t *env;
ir_entity *value_param_list; /**< the list of all value param entities */
+ ir_entity *value_param_tail; /**< the tail of the list of all value param entities */
} lower_frame_sels_env_t;
/**
* Walker: Replaces Sels of frame type and
* value param type entities by FrameAddress.
+ * Links all used entities.
*/
-static void lower_frame_sels_walker(ir_node *irn, void *data)
-{
+static void lower_frame_sels_walker(ir_node *irn, void *data) {
lower_frame_sels_env_t *ctx = data;
if (is_Sel(irn)) {
nw = be_new_FrameAddr(env->isa->sp->reg_class, irg, bl, frame, ent);
exchange(irn, nw);
- /* check, if it's a param sel and if have not seen this entity immediatly before */
- if (ptr == param_base && ctx->value_param_list != ent) {
+ /* check, if it's a param sel and if have not seen this entity before */
+ if (ptr == param_base &&
+ ent != ctx->value_param_tail &&
+ get_entity_link(ent) == NULL) {
set_entity_link(ent, ctx->value_param_list);
ctx->value_param_list = ent;
+ if (ctx->value_param_tail == NULL) ctx->value_param_tail = ent;
}
}
}
ir_graph *irg = env->birg->irg;
ir_node *bl = get_irg_start_block(irg);
ir_node *end = get_irg_end_block(irg);
- ir_node *mem = get_irg_initial_mem(irg);
+ ir_node *old_mem = get_irg_initial_mem(irg);
+ ir_node *new_mem_proj;
+ ir_node *mem;
ir_type *method_type = get_entity_type(get_irg_entity(irg));
pset *dont_save = pset_new_ptr(8);
ir_node *arg_tuple;
ir_node *value_param_base;
const ir_edge_t *edge;
- ir_type *arg_type, *bet_type;
+ ir_type *arg_type, *bet_type, *tp;
lower_frame_sels_env_t ctx;
ir_entity **param_map;
DBG((dbg, LEVEL_1, "introducing abi on %+F\n", irg));
+ /* set the links of all frame entities to NULL, we use it
+ to detect if an entity is already linked in the value_param_list */
+ tp = get_method_value_param_type(method_type);
+ if (tp != NULL) {
+ for (i = get_struct_n_members(tp) - 1; i >= 0; --i)
+ set_entity_link(get_struct_member(tp, i), NULL);
+ }
+
/* Convert the Sel nodes in the irg to frame load/store/addr nodes. */
ctx.env = env;
ctx.value_param_list = NULL;
+ ctx.value_param_tail = NULL;
irg_walk_graph(irg, lower_frame_sels_walker, NULL, &ctx);
/* value_param_base anchor is not needed anymore now */
}
obstack_free(&env->obst, rm);
+ /* create a new initial memory proj */
+ assert(is_Proj(old_mem));
+ new_mem_proj = new_r_Proj(irg, get_nodes_block(old_mem),
+ new_r_Unknown(irg, mode_T), mode_M,
+ get_Proj_proj(old_mem));
+ mem = new_mem_proj;
+
/* Generate the Prologue */
fp_reg = call->cb->prologue(env->cb, &mem, env->regs);
set_irg_frame(irg, frame_pointer);
pset_insert_ptr(env->ignore_regs, fp_reg);
+ /* rewire old mem users to new mem */
+ set_Proj_pred(new_mem_proj, get_Proj_pred(old_mem));
+ exchange(old_mem, mem);
+
set_irg_initial_mem(irg, mem);
/* Now, introduce stack param nodes for all parameters passed on the stack */
if(arg_proj != NULL) {
be_abi_call_arg_t *arg;
ir_type *param_type;
- int nr = get_Proj_proj(arg_proj);
+ int nr = get_Proj_proj(arg_proj);
+ ir_mode *mode;
nr = MIN(nr, n_params);
arg = get_call_arg(call, 0, nr);
param_type = get_method_param_type(method_type, nr);
- if(arg->in_reg) {
+ if (arg->in_reg) {
repl = pmap_get(env->regs, (void *) arg->reg);
}
}
/* 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. */
+ we thus will create a node representing the parameter's address
+ on the stack. */
else {
repl = be_new_FrameAddr(sp->reg_class, irg, reg_params_bl, frame_pointer, arg->stack_ent);
}
}
assert(repl != NULL);
+
+ /* Beware: the mode of the register parameters is always the mode of the register class
+ which may be wrong. Add Conv's then. */
+ mode = get_irn_mode(args[i]);
+ if (mode != get_irn_mode(repl)) {
+ repl = new_r_Conv(irg, get_irn_n(repl, -1), repl, mode);
+ }
exchange(args[i], repl);
}
}
{
const arch_isa_t *isa = env->isa;
int i, n, n_states;
- const arch_register_t **stateregs = NEW_ARR_F(const arch_register_t*, 0);
+ arch_register_t **stateregs = NEW_ARR_F(arch_register_t*, 0);
/* Collect caller save registers */
n = arch_isa_get_n_reg_class(isa);
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)) {
- ARR_APP1(arch_register_t*, stateregs, reg);
+ ARR_APP1(arch_register_t*, stateregs, (arch_register_t *)reg);
}
}
}
restore_optimization_state(&state);
FIRM_DBG_REGISTER(env->dbg, "firm.be.abi");
-#if 0
- memcpy(&env->irn_handler, &abi_irn_handler, sizeof(abi_irn_handler));
- env->irn_ops.impl = &abi_irn_ops;
-#endif
-
env->calls = NEW_ARR_F(ir_node*, 0);
/* Lower all call nodes in the IRG. */
survive_dce_register_irn(env->dce_survivor, (ir_node **) &ent->value);
}
-#if 0
- arch_env_push_irn_handler(env->birg->main_env->arch_env, &env->irn_handler);
-#endif
-
env->call->cb->done(env->cb);
env->cb = NULL;
return env;
void be_abi_free(be_abi_irg_t *env)
{
+ be_abi_call_free(env->call);
free_survive_dce(env->dce_survivor);
del_pset(env->ignore_regs);
pmap_destroy(env->regs);
obstack_free(&env->obst, NULL);
-#if 0
- arch_env_pop_irn_handler(env->birg->main_env->arch_env);
-#endif
free(env);
}
*/
+typedef ir_node **node_array;
+
typedef struct fix_stack_walker_env_t {
- ir_node **nodes;
+ node_array sp_nodes;
const arch_env_t *arch_env;
} fix_stack_walker_env_t;
{
fix_stack_walker_env_t *env = data;
- if (is_Block(node))
- return;
-
if (arch_irn_is(env->arch_env, node, modify_sp)) {
assert(get_irn_mode(node) != mode_M && get_irn_mode(node) != mode_T);
- ARR_APP1(ir_node*, env->nodes, node);
+ ARR_APP1(ir_node*, env->sp_nodes, node);
}
}
-void be_abi_fix_stack_nodes(be_abi_irg_t *env, be_lv_t *lv)
+void be_abi_fix_stack_nodes(be_abi_irg_t *env)
{
- int i;
+ be_ssa_construction_env_t senv;
+ int i, len;
ir_node **phis;
be_irg_t *birg = env->birg;
+ be_lv_t *lv = be_get_birg_liveness(birg);
fix_stack_walker_env_t walker_env;
+ arch_isa_t *isa;
- walker_env.nodes = NEW_ARR_F(ir_node*, 0);
+ walker_env.sp_nodes = NEW_ARR_F(ir_node*, 0);
walker_env.arch_env = birg->main_env->arch_env;
-
- be_assure_dom_front(birg);
+ isa = walker_env.arch_env->isa;
irg_walk_graph(birg->irg, collect_stack_nodes_walker, NULL, &walker_env);
- phis = be_ssa_construction(
- be_get_birg_dom_front(birg),
- be_get_birg_liveness(birg),
- env->init_sp,
- ARR_LEN(walker_env.nodes), walker_env.nodes,
- NULL, 1);
+ /* 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, birg);
+ 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 */
- for(i = 0; i < ARR_LEN(phis); ++i) {
+ len = ARR_LEN(phis);
+ for(i = 0; i < len; ++i) {
ir_node *phi = phis[i];
be_set_phi_reg_req(walker_env.arch_env, phi, &env->sp_req);
be_set_phi_flags(walker_env.arch_env, phi, arch_irn_flags_ignore | arch_irn_flags_modify_sp);
arch_set_irn_register(walker_env.arch_env, phi, env->isa->sp);
}
+ be_ssa_construction_destroy(&senv);
- DEL_ARR_F(phis);
- DEL_ARR_F(walker_env.nodes);
+ DEL_ARR_F(walker_env.sp_nodes);
}
static int process_stack_bias(be_abi_irg_t *env, ir_node *bl, int bias)
return abi->start_barrier;
}
-#if 0
-/*
- _____ _____ _ _ _ _ _ _
- |_ _| __ \| \ | | | | | | | | |
- | | | |__) | \| | | |__| | __ _ _ __ __| | | ___ _ __
- | | | _ /| . ` | | __ |/ _` | '_ \ / _` | |/ _ \ '__|
- _| |_| | \ \| |\ | | | | | (_| | | | | (_| | | __/ |
- |_____|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_|
-
- for Phi nodes which are created due to stack modifying nodes
- such as IncSP, AddSP and SetSP.
-
- These Phis are always to be ignored by the reg alloc and are
- fixed on the SP register of the ISA.
-*/
-
-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);
- const void *res = NULL;
-
- if(is_Phi(irn) && pset_find_ptr(abi->stack_phis, (void *) irn))
- res = &abi->irn_ops;
-
- return res;
-}
-
-static
-const arch_register_req_t *abi_get_irn_reg_req(const void *self,
- const ir_node *irn, int pos)
-{
- be_abi_irg_t *abi = get_abi_from_ops(self);
-
- if(pos == BE_OUT_POS(0)) {
- return &abi->sp_req;
- } else if(pos >= 0 && pos < get_irn_arity(irn)) {
- return &abi->sp_cls_req;
- }
-
- return arch_no_register_req;
-}
-
-static void abi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg)
-{
-}
-
-static const arch_register_t *abi_get_irn_reg(const void *self, const ir_node *irn)
-{
- const be_abi_irg_t *abi = get_abi_from_ops(self);
- return abi->isa->sp;
-}
-
-static arch_irn_class_t abi_classify(const void *_self, const ir_node *irn)
-{
- return arch_irn_class_normal;
-}
-
-static arch_irn_flags_t abi_get_flags(const void *_self, const ir_node *irn)
-{
- return arch_irn_flags_ignore | arch_irn_flags_modify_sp;
-}
-
-static ir_entity *abi_get_frame_entity(const void *_self, const ir_node *irn)
-{
- return NULL;
-}
-
-static void abi_set_frame_entity(const void *_self, ir_node *irn, ir_entity *ent)
-{
-}
-
-static void abi_set_frame_offset(const void *_self, ir_node *irn, int bias)
-{
-}
-
-static int abi_get_sp_bias(const void *self, const ir_node *irn)
-{
- return 0;
-}
-
-static const arch_irn_ops_if_t abi_irn_ops = {
- abi_get_irn_reg_req,
- abi_set_irn_reg,
- abi_get_irn_reg,
- abi_classify,
- abi_get_flags,
- abi_get_frame_entity,
- abi_set_frame_entity,
- abi_set_frame_offset,
- abi_get_sp_bias,
- NULL, /* get_inverse */
- NULL, /* get_op_estimated_cost */
- NULL, /* possible_memory_operand */
- NULL, /* perform_memory_operand */
-};
-
-static const arch_irn_handler_t abi_irn_handler = {
- abi_get_irn_ops
-};
-#endif
-
/**
* Returns non-zero if the ABI has omitted the frame pointer in
* the current graph.
projects / libfirm / blobdiff