/**
* @file
* @brief code selection (transform FIRM into SPARC FIRM)
+ * @author Hannes Rapp, Matthias Braun
* @version $Id$
*/
#include "config.h"
#include <stdint.h>
+#include <stdbool.h>
#include "irnode_t.h"
#include "irgraph_t.h"
//static ir_mode *mode_fp4;
static pmap *node_to_stack;
-static inline int mode_needs_gp_reg(ir_mode *mode)
+static inline bool mode_needs_gp_reg(ir_mode *mode)
{
- return mode_is_int(mode) || mode_is_reference(mode);
+ if (mode_is_int(mode) || mode_is_reference(mode)) {
+ /* we should only see 32bit code */
+ assert(get_mode_size_bits(mode) <= 32);
+ return true;
+ }
+ return false;
}
/**
typedef ir_node* (*new_binop_imm_func) (dbg_info *dbgi, ir_node *block, ir_node *op1, ir_entity *entity, int32_t immediate);
typedef ir_node* (*new_unop_fp_func) (dbg_info *dbgi, ir_node *block, ir_node *op1, ir_mode *mode);
-static bool is_value_imm_encodeable(int32_t value)
-{
- return -4096 <= value && value <= 4095;
-}
-
/**
* checks if a node's value can be encoded as a immediate
*/
return false;
value = get_tarval_long(get_Const_tarval(node));
- return is_value_imm_encodeable(value);
+ return sparc_is_value_imm_encodeable(value);
}
static bool needs_extension(ir_mode *mode)
}
mode1 = get_irn_mode(op1);
mode2 = get_irn_mode(op2);
+ /* we shouldn't see 64bit code */
+ assert(get_mode_size_bits(mode1) <= 32);
+ assert(get_mode_size_bits(mode2) <= 32);
if (is_imm_encodeable(op2)) {
ir_node *new_op1 = be_transform_node(op1);
ptr2 = be_transform_node(get_Add_right(base));
base = be_transform_node(get_Add_left(base));
} else {
- if (is_value_imm_encodeable(offset)) {
+ if (sparc_is_value_imm_encodeable(offset)) {
base = be_transform_node(base);
} else {
base = be_transform_node(ptr);
ir_node *new_load = NULL;
address_t address;
+ if (get_Load_unaligned(node) == align_non_aligned) {
+ panic("sparc: transformation of unaligned Loads not implemented yet");
+ }
+
if (mode_is_float(mode)) {
match_address(ptr, &address, false);
new_load = create_ldf(dbgi, block, address.ptr, new_mem, mode,
ir_node *new_store = NULL;
address_t address;
+ if (get_Store_unaligned(node) == align_non_aligned) {
+ panic("sparc: transformation of unaligned Stores not implemented yet");
+ }
+
if (mode_is_float(mode)) {
/* TODO: variants with reg+reg address mode */
match_address(ptr, &address, false);
new_store = create_stf(dbgi, block, new_val, address.ptr, new_mem,
mode, address.entity, address.offset, false);
} else {
+ assert(get_mode_size_bits(mode) <= 32);
match_address(ptr, &address, true);
if (address.ptr2 != NULL) {
assert(address.entity == NULL && address.offset == 0);
{
ir_entity *entity = create_float_const_entity(tv);
ir_node *hi = new_bd_sparc_SetHi(dbgi, block, entity, 0);
- ir_node *mem = new_r_NoMem(current_ir_graph);
+ ir_node *mem = get_irg_no_mem(current_ir_graph);
ir_mode *mode = get_tarval_mode(tv);
ir_node *new_op
= create_ldf(dbgi, block, hi, mem, mode, entity, 0, false);
- ir_node *proj = new_Proj(new_op, mode, pn_sparc_Ldf_res);
- be_dep_on_frame(hi);
+ ir_node *proj = new_r_Proj(new_op, mode, pn_sparc_Ldf_res);
set_irn_pinned(new_op, op_pin_state_floats);
return proj;
value = get_tarval_long(tv);
if (value == 0) {
return get_g0();
- } else if (-4096 <= value && value <= 4095) {
+ } else if (sparc_is_value_imm_encodeable(value)) {
return new_bd_sparc_Or_imm(dbgi, block, get_g0(), NULL, value);
} else {
ir_node *hi = new_bd_sparc_SetHi(dbgi, block, NULL, value);
- be_dep_on_frame(hi);
if ((value & 0x3ff) != 0) {
return new_bd_sparc_Or_imm(dbgi, block, hi, NULL, value & 0x3ff);
} else {
{
ir_node *hi = new_bd_sparc_SetHi(dbgi, block, entity, offset);
ir_node *low = new_bd_sparc_Or_imm(dbgi, block, hi, entity, offset);
- be_dep_on_frame(hi);
+
+ if (get_entity_owner(entity) == get_tls_type())
+ panic("thread local storage not supported yet in sparc backend");
return low;
}
index = new_bd_sparc_Sll_imm(dbgi, block, new_selector, NULL, 2);
/* load from jumptable */
load = new_bd_sparc_Ld_reg(dbgi, block, table_address, index,
- new_r_NoMem(current_ir_graph),
+ get_irg_no_mem(current_ir_graph),
mode_gp);
address = new_r_Proj(load, mode_gp, pn_sparc_Ld_res);
block = be_transform_node(get_nodes_block(node));
dbgi = get_irn_dbg_info(node);
- flag_node = be_transform_node(get_Proj_pred(selector));
+ flag_node = be_transform_node(selector);
relation = get_Cmp_relation(selector);
is_unsigned = !mode_is_signed(cmp_mode);
if (mode_is_float(cmp_mode)) {
{
ir_graph *irg = get_irn_irg(block);
ir_node *sp = get_irg_frame(irg);
- ir_node *nomem = new_r_NoMem(irg);
+ ir_node *nomem = get_irg_no_mem(irg);
ir_node *stf = create_stf(dbgi, block, ftoi, sp, nomem, src_mode,
NULL, 0, true);
ir_node *ld = new_bd_sparc_Ld_imm(dbgi, block, sp, stf, mode_gp,
{
ir_graph *irg = get_irn_irg(block);
ir_node *sp = get_irg_frame(irg);
- ir_node *nomem = new_r_NoMem(irg);
+ ir_node *nomem = get_irg_no_mem(irg);
ir_node *st = new_bd_sparc_St_imm(dbgi, block, op, sp, nomem,
mode_gp, NULL, 0, true);
ir_node *ldf = new_bd_sparc_Ldf_s(dbgi, block, sp, st, mode_fp,
layout->arg_type = arg_type;
layout->initial_offset = 0;
layout->initial_bias = 0;
- layout->stack_dir = -1;
layout->sp_relative = cconv->omit_fp;
assert(N_FRAME_TYPES == 3);
}
/**
- * transform the start node to the prolog code + initial barrier
+ * transform the start node to the prolog code
*/
static ir_node *gen_Start(ir_node *node)
{
ir_node *block = get_nodes_block(node);
ir_node *new_block = be_transform_node(block);
dbg_info *dbgi = get_irn_dbg_info(node);
- ir_node *mem;
ir_node *start;
- ir_node *sp;
- ir_node *barrier;
size_t i;
/* stackpointer is important at function prolog */
}
start = be_prolog_create_start(abihelper, dbgi, new_block);
- mem = be_prolog_get_memory(abihelper);
- sp = be_prolog_get_reg_value(abihelper, sp_reg);
-
- if (!cconv->omit_fp) {
- ir_node *save = new_bd_sparc_Save_imm(NULL, block, sp, NULL,
- -SPARC_MIN_STACKSIZE);
- sp = new_r_Proj(save, mode_gp, pn_sparc_Save_stack);
- arch_set_irn_register(sp, sp_reg);
- }
-
- sp = be_new_IncSP(sp_reg, new_block, sp, BE_STACK_FRAME_SIZE_EXPAND, 0);
- be_prolog_set_reg_value(abihelper, sp_reg, sp);
- be_prolog_set_memory(abihelper, mem);
-
- barrier = be_prolog_create_barrier(abihelper, new_block);
-
- return barrier;
+ return start;
}
static ir_node *get_stack_pointer_for(ir_node *node)
*/
static ir_node *gen_Return(ir_node *node)
{
- ir_node *block = get_nodes_block(node);
- ir_node *new_block = be_transform_node(block);
- dbg_info *dbgi = get_irn_dbg_info(node);
- ir_node *mem = get_Return_mem(node);
- ir_node *new_mem = be_transform_node(mem);
- ir_node *sp = get_stack_pointer_for(node);
- size_t n_res = get_Return_n_ress(node);
+ ir_node *block = get_nodes_block(node);
+ ir_node *new_block = be_transform_node(block);
+ dbg_info *dbgi = get_irn_dbg_info(node);
+ ir_node *mem = get_Return_mem(node);
+ ir_node *new_mem = be_transform_node(mem);
+ ir_node *sp = get_stack_pointer_for(node);
+ size_t n_res = get_Return_n_ress(node);
ir_node *bereturn;
size_t i;
}
}
- /* create the barrier before the epilog code */
- be_epilog_create_barrier(abihelper, new_block);
-
- /* epilog code: an incsp */
- sp = be_epilog_get_reg_value(abihelper, sp_reg);
- sp = be_new_IncSP(sp_reg, new_block, sp,
- BE_STACK_FRAME_SIZE_SHRINK, 0);
- be_epilog_set_reg_value(abihelper, sp_reg, sp);
-
- /* we need a restore instruction */
- if (!cconv->omit_fp) {
- ir_node *restore = new_bd_sparc_RestoreZero(NULL, block);
- keep_alive(restore);
- }
-
bereturn = be_epilog_create_return(abihelper, dbgi, new_block);
-
return bereturn;
}
{
ir_graph *irg = current_ir_graph;
ir_node *sp = get_irg_frame(irg);
- ir_node *nomem = new_r_NoMem(irg);
+ ir_node *nomem = get_irg_no_mem(irg);
ir_node *st = new_bd_sparc_St_imm(dbgi, block, value0, sp, nomem,
mode_gp, NULL, 0, true);
ir_mode *mode;
{
ir_graph *irg = current_ir_graph;
ir_node *stack = get_irg_frame(irg);
- ir_node *nomem = new_r_NoMem(irg);
+ ir_node *nomem = get_irg_no_mem(irg);
ir_node *stf = create_stf(dbgi, block, node, stack, nomem, float_mode,
NULL, 0, true);
int bits = get_mode_size_bits(float_mode);
ir_node *new_pred = be_transform_node(pred);
long pn = get_Proj_proj(node);
- assert(is_sparc_SDiv(new_pred) || is_sparc_UDiv(new_pred));
+ assert(is_sparc_SDiv(new_pred) || is_sparc_UDiv(new_pred)
+ || is_sparc_fdiv(new_pred));
assert((int)pn_sparc_SDiv_res == (int)pn_sparc_UDiv_res);
assert((int)pn_sparc_SDiv_M == (int)pn_sparc_UDiv_M);
assert((int)pn_sparc_SDiv_res == (int)pn_sparc_fdiv_res);
{
ir_node *block = get_nodes_block(node);
ir_node *new_block = be_transform_node(block);
- ir_node *barrier = be_transform_node(get_Proj_pred(node));
long pn = get_Proj_proj(node);
+ /* make sure prolog is constructed */
+ be_transform_node(get_Proj_pred(node));
switch ((pn_Start) pn) {
case pn_Start_X_initial_exec:
/* exchange ProjX with a jump */
return new_bd_sparc_Ba(NULL, new_block);
case pn_Start_M:
- return new_r_Proj(barrier, mode_M, 0);
+ return be_prolog_get_memory(abihelper);
case pn_Start_T_args:
- return barrier;
+ break;
case pn_Start_P_frame_base:
return get_frame_base();
- case pn_Start_P_tls:
- return new_r_Bad(current_ir_graph);
case pn_Start_max:
break;
}
case pn_Call_X_regular:
case pn_Call_X_except:
case pn_Call_T_result:
- case pn_Call_P_value_res_base:
case pn_Call_max:
break;
}
be_set_transform_function(op_sparc_Save, be_duplicate_node);
}
-/* hack to avoid unused fp proj at start barrier */
-static void assure_fp_keep(void)
-{
- unsigned n_users = 0;
- const ir_edge_t *edge;
- ir_node *fp_proj = be_prolog_get_reg_value(abihelper, fp_reg);
-
- foreach_out_edge(fp_proj, edge) {
- ir_node *succ = get_edge_src_irn(edge);
- if (is_End(succ) || is_Anchor(succ))
- continue;
- ++n_users;
- }
-
- if (n_users == 0) {
- ir_node *block = get_nodes_block(fp_proj);
- ir_node *in[1] = { fp_proj };
- be_new_Keep(block, 1, in);
- }
-}
-
/**
* Transform a Firm graph into a SPARC graph.
*/
create_stacklayout(irg);
be_transform_graph(irg, NULL);
- if (!cconv->omit_fp)
- assure_fp_keep();
be_abihelper_finish(abihelper);
sparc_free_calling_convention(cconv);
projects / libfirm / blobdiff