X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Flower%2Flower_mode_b.c;h=f9a2b9bb99b19bae7106ae8b04f73417fe92cec8;hb=61c66f56e9a5b1d23bb679077bf2f9350ff7594e;hp=50c1b4271c9d9fb6e24e5dd3dc209bf64b81ea77;hpb=9baf0cd6e299828073f897e4bd0a284379ad9cdb;p=libfirm diff --git a/ir/lower/lower_mode_b.c b/ir/lower/lower_mode_b.c index 50c1b4271..f9a2b9bb9 100644 --- a/ir/lower/lower_mode_b.c +++ b/ir/lower/lower_mode_b.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -19,285 +19,288 @@ /** * @file + * @brief lower mode_b operations to something the backend can handle * @author Matthias Braun, Christoph Mallon - * @version $Id$ */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif + +#include "lower_mode_b.h" #include +#include #include "irnode_t.h" #include "ircons_t.h" +#include "irflag.h" #include "irgwalk.h" #include "irtools.h" +#include "iredges.h" +#include "iropt_t.h" +#include "irgmod.h" #include "tv.h" #include "error.h" #include "lowering.h" +#include "pdeq.h" +#include "irpass_t.h" +#include "util.h" +#include "array.h" +#include "irgopt.h" + +typedef struct needs_lowering_t { + ir_node *node; + int input; +} needs_lowering_t; -static ir_mode *lowered_mode = NULL; -static int lower_direct_cmp = 0; +static ir_mode *lowered_mode; +static needs_lowering_t *needs_lowering; static ir_node *create_not(dbg_info *dbgi, ir_node *node) { - ir_graph *irg = current_ir_graph; - ir_node *block = get_nodes_block(node); - tarval *tv_one = get_tarval_one(lowered_mode); - ir_node *one = new_d_Const(dbgi, lowered_mode, tv_one); + ir_node *block = get_nodes_block(node); + ir_mode *mode = lowered_mode; + ir_tarval *tv_one = get_mode_one(mode); + ir_graph *irg = get_irn_irg(node); + ir_node *one = new_rd_Const(dbgi, irg, tv_one); + + return new_rd_Eor(dbgi, block, node, one, mode); +} - return new_rd_Eor(dbgi, irg, block, node, one, lowered_mode); +static ir_node *convert_to_modeb(ir_node *node) +{ + ir_node *block = get_nodes_block(node); + ir_graph *irg = get_irn_irg(node); + ir_mode *mode = lowered_mode; + ir_tarval *tv_zero = get_mode_null(mode); + ir_node *zero = new_r_Const(irg, tv_zero); + ir_node *cmp = new_r_Cmp(block, node, zero, ir_relation_less_greater); + return cmp; +} + +/** + * implementation of create_set_func which produces a cond with control + * flow + */ +static ir_node *create_cond_set(ir_node *cond_value, ir_mode *dest_mode) +{ + ir_node *lower_block = part_block_edges(cond_value); + ir_node *upper_block = get_nodes_block(cond_value); + ir_graph *irg = get_irn_irg(cond_value); + ir_node *cond = new_r_Cond(upper_block, cond_value); + ir_node *proj_true = new_r_Proj(cond, mode_X, pn_Cond_true); + ir_node *proj_false = new_r_Proj(cond, mode_X, pn_Cond_false); + ir_node *in_true[1] = { proj_true }; + ir_node *in_false[1] = { proj_false }; + ir_node *true_block = new_r_Block(irg, ARRAY_SIZE(in_true), in_true); + ir_node *false_block = new_r_Block(irg, ARRAY_SIZE(in_false),in_false); + ir_node *true_jmp = new_r_Jmp(true_block); + ir_node *false_jmp = new_r_Jmp(false_block); + ir_node *lower_in[2] = { true_jmp, false_jmp }; + ir_node *one = new_r_Const(irg, get_mode_one(dest_mode)); + ir_node *zero = new_r_Const(irg, get_mode_null(dest_mode)); + ir_node *phi_in[2] = { one, zero }; + ir_node *phi; + + set_irn_in(lower_block, ARRAY_SIZE(lower_in), lower_in); + phi = new_r_Phi(lower_block, ARRAY_SIZE(phi_in), phi_in, dest_mode); + + return phi; } static ir_node *lower_node(ir_node *node) { - ir_graph *irg = current_ir_graph; dbg_info *dbgi = get_irn_dbg_info(node); - ir_op *op = get_irn_op(node); ir_node *block = get_nodes_block(node); - ir_node *res; - - assert(get_irn_mode(node) == mode_b); + ir_mode *mode = lowered_mode; + ir_node *res = (ir_node*)get_irn_link(node); + ir_graph *irg; - res = get_irn_link(node); - if(res != NULL) + if (res != NULL) return res; - /* TODO: be robust against phi-loops... */ - if(op == op_Phi) { + node = skip_Tuple(node); + + assert(get_irn_mode(node) == mode_b); + + irg = get_irn_irg(node); + switch (get_irn_opcode(node)) { + case iro_Phi: { int i, arity; ir_node **in; - ir_node *unknown, *new_phi; + ir_node *dummy; + ir_node *new_phi; arity = get_irn_arity(node); - in = alloca(arity * sizeof(in[0])); - unknown = new_Unknown(lowered_mode); - for(i = 0; i < arity; ++i) { - in[i] = unknown; + in = ALLOCAN(ir_node*, arity); + dummy = new_r_Dummy(irg, mode); + for (i = 0; i < arity; ++i) { + in[i] = dummy; } - new_phi = new_rd_Phi(dbgi, irg, block, arity, in, - lowered_mode); + new_phi = new_r_Phi(block, arity, in, mode); + /* FIXME This does not correctly break cycles: The Phi might not be the + * first in the recursion, so the caller(s) are some yet un-lowered + * nodes and this Phi might have them (indirectly) as operands, so they + * would be replaced twice. */ set_irn_link(node, new_phi); - for(i = 0; i < arity; ++i) { - ir_node *in = get_irn_n(node, i); - ir_node *low_in = lower_node(in); + for (i = 0; i < arity; ++i) { + ir_node *in = get_irn_n(node, i); + ir_node *lowered_in = lower_node(in); - set_irn_n(new_phi, i, low_in); + set_irn_n(new_phi, i, lowered_in); } return new_phi; } - if(op == op_And || op == op_Or || op == op_Eor) { - int i, arity; - ir_node *copy = exact_copy(node); - - arity = get_irn_arity(node); - for(i = 0; i < arity; ++i) { - ir_node *in = get_irn_n(node, i); - ir_node *low_in = lower_node(in); - - set_irn_n(copy, i, low_in); - } - set_irn_mode(copy, lowered_mode); - - set_irn_link(node, copy); - return copy; + case iro_And: { + ir_node *lowered_left = lower_node(get_And_left(node)); + ir_node *lowered_right = lower_node(get_And_right(node)); + res = new_rd_And(dbgi, block, lowered_left, lowered_right, mode); + break; + } + case iro_Or: { + ir_node *lowered_left = lower_node(get_Or_left(node)); + ir_node *lowered_right = lower_node(get_Or_right(node)); + res = new_rd_Or(dbgi, block, lowered_left, lowered_right, mode); + break; } - if(op == op_Not) { + case iro_Eor: { + ir_node *lowered_left = lower_node(get_Eor_left(node)); + ir_node *lowered_right = lower_node(get_Eor_right(node)); + res = new_rd_Eor(dbgi, block, lowered_left, lowered_right, mode); + break; + } + + case iro_Not: { ir_node *op = get_Not_op(node); ir_node *low_op = lower_node(op); res = create_not(dbgi, low_op); - set_irn_link(node, res); - return res; + break; } - if(op == op_Psi) { - ir_node *cond = get_Psi_cond(node, 0); + + case iro_Mux: { + ir_node *cond = get_Mux_sel(node); ir_node *low_cond = lower_node(cond); - ir_node *v_true = get_Psi_val(node, 0); + ir_node *v_true = get_Mux_true(node); ir_node *low_v_true = lower_node(v_true); - ir_node *v_false = get_Psi_default(node); + ir_node *v_false = get_Mux_false(node); ir_node *low_v_false = lower_node(v_false); - ir_node *and0 = new_rd_And(dbgi, irg, block, cond, low_v_true, - lowered_mode); - + ir_node *and0 = new_rd_And(dbgi, block, low_cond, low_v_true, mode); ir_node *not_cond = create_not(dbgi, low_cond); - - ir_node *and1 = new_rd_And(dbgi, irg, block, not_cond, low_v_false, - lowered_mode); - - ir_node *or = new_rd_Or(dbgi, irg, block, and0, and1, - lowered_mode); - - set_irn_link(node, or); - return or; - } - if(op == op_Conv) { - tarval *tv_one = get_tarval_one(lowered_mode); - ir_node *one = new_d_Const(dbgi, lowered_mode, tv_one); - tarval *tv_zero = get_tarval_null(lowered_mode); - ir_node *zero = new_d_Const(dbgi, lowered_mode, tv_zero); - ir_mode *mode = get_irn_mode(node); - tarval *tv_zeroc = get_tarval_null(mode); - ir_node *zero_cmp = new_d_Const(dbgi, mode, tv_zeroc); - - ir_node *cmp = new_rd_Cmp(dbgi, irg, block, node, zero_cmp); - ir_node *proj = new_rd_Proj(dbgi, irg, block, cmp, mode_b, - pn_Cmp_Lg); - ir_node *vals[2] = { one, zero }; - ir_node *psi = new_rd_Psi(dbgi, irg, block, 1, &proj, vals, - lowered_mode); - - set_irn_link(node, psi); - return psi; + ir_node *and1 = new_rd_And(dbgi, block, not_cond, low_v_false, mode); + res = new_rd_Or(dbgi, block, and0, and1, mode); + break; } - if(op == op_Proj) { - ir_node *pred = get_Proj_pred(node); - - assert(!is_Load(pred)); - if(is_Cmp(pred)) { - ir_mode *mode = get_irn_mode(pred); - ir_node *left = get_Cmp_left(pred); - ir_node *right = get_Cmp_right(pred); - - if( (mode_is_int(mode) || mode_is_reference(mode)) && - (get_mode_size_bits(mode) < get_mode_size_bits(lowered_mode) - || classify_Const(right) == CNST_NULL)) { - int pnc = get_Proj_proj(node); - int need_not = 0; - ir_node *a = NULL; - ir_node *b = NULL; - - if(pnc == pn_Cmp_Lt) { - /* a < b -> (a - b) >> 31 */ - a = left; - b = right; - } else if(pnc == pn_Cmp_Le) { - /* a <= b -> ((a - b) >> 31) ^ 1 */ - a = right; - b = left; - need_not = 1; - } else if(pnc == pn_Cmp_Gt) { - /* a > b -> (b - a) >> 31 */ - a = right; - b = left; - } else if(pnc == pn_Cmp_Ge) { - /* a >= b -> ((a - b) >> 31) ^ 1 */ - a = left; - b = right; - need_not = 1; - } - - if(a != NULL) { - tarval *tv = new_tarval_from_long(31, mode_Iu); - ir_node *shift_cnt = new_d_Const(dbgi, mode_Iu, tv); - - if(mode != lowered_mode) { - a = new_rd_Conv(dbgi, irg, block, a, lowered_mode); - b = new_rd_Conv(dbgi, irg, block, b, lowered_mode); - } - - res = new_rd_Sub(dbgi, irg, block, a, b, lowered_mode); - res = new_rd_Shr(dbgi, irg, block, res, shift_cnt, - lowered_mode); - - if(need_not) { - res = create_not(dbgi, res); - } - set_irn_link(node, res); - return res; - } - } - - { - /* synthesize the 0/1 value */ - tarval *tv_one = get_tarval_one(lowered_mode); - ir_node *one = new_d_Const(dbgi, lowered_mode, tv_one); - tarval *tv_zero = get_tarval_null(lowered_mode); - ir_node *zero = new_d_Const(dbgi, lowered_mode, tv_zero); - - ir_node *vals[2] = { one, zero }; - ir_node *psi = new_rd_Psi(dbgi, irg, block, 1, &node, vals, - lowered_mode); - - set_irn_link(node, psi); - return psi; - } - } - panic("unexpected projb: %+F (pred: %+F)", node, pred); - } - if(op == op_Const) { - tarval *tv = get_Const_tarval(node); - if(tv == get_tarval_b_true()) { - tarval *tv_one = get_tarval_one(lowered_mode); - res = new_d_Const(dbgi, lowered_mode, tv_one); - } else if(tv == get_tarval_b_false()) { - tarval *tv_zero = get_tarval_null(lowered_mode); - res = new_d_Const(dbgi, lowered_mode, tv_zero); + case iro_Cmp: + res = create_cond_set(node, mode); + break; + + case iro_Const: { + ir_tarval *tv = get_Const_tarval(node); + if (tv == get_tarval_b_true()) { + ir_tarval *tv_one = get_mode_one(mode); + res = new_rd_Const(dbgi, irg, tv_one); + } else if (tv == get_tarval_b_false()) { + ir_tarval *tv_zero = get_mode_null(mode); + res = new_rd_Const(dbgi, irg, tv_zero); } else { panic("invalid boolean const %+F", node); } - set_irn_link(node, res); - return res; + break; + } + + case iro_Unknown: + res = new_r_Unknown(irg, mode); + break; + + case iro_Bad: + res = new_r_Bad(irg, mode); + break; + + default: + panic("Don't know how to lower mode_b node %+F", node); } - panic("didn't expect %+F to have mode_b", node); + set_irn_link(node, res); + return res; } -static ir_node *create_convb(ir_node *node) +static bool needs_mode_b_input(const ir_node *node, int input) { - ir_graph *irg = current_ir_graph; - ir_node *block = get_nodes_block(node); - ir_node *conv = new_rd_Conv(NULL, irg, block, node, mode_b); - - return conv; + return (is_Cond(node) && input == n_Cond_selector) + || (is_Mux(node) && input == n_Mux_sel); } -static void lower_mode_b_walker(ir_node *node, void *env) +/** + * Collects "roots" of a mode_b calculation. These are nodes which require a + * mode_b input (Cond, Mux) + */ +static void collect_needs_lowering(ir_node *node, void *env) { - int i, arity; + int arity = get_irn_arity(node); + int i; (void) env; - arity = get_irn_arity(node); - for(i = 0; i < arity; ++i) { - ir_node *lowered_in; + /* if the node produces mode_b then it is not a root (but should be + * something our lower_node function can handle) */ + if (get_irn_mode(node) == mode_b) { + assert(is_And(node) || is_Or(node) || is_Eor(node) || is_Phi(node) + || is_Not(node) || is_Mux(node) || is_Cmp(node) + || is_Const(node) || is_Unknown(node) || is_Bad(node)); + return; + } + + for (i = 0; i < arity; ++i) { + needs_lowering_t entry; ir_node *in = get_irn_n(node, i); - if(get_irn_mode(in) != mode_b) + if (get_irn_mode(in) != mode_b) + continue; + if (is_Cmp(in) && needs_mode_b_input(node, i)) continue; - if(! lower_direct_cmp) { - if(is_Cond(node) - || (is_Psi(node) && get_irn_mode(node) != mode_b)) { - if(is_Proj(in)) { - ir_node *pred = get_Proj_pred(in); - if(is_Cmp(pred)) - continue; - } - } - } - - lowered_in = lower_node(in); - lowered_in = create_convb(lowered_in); - set_irn_n(node, i, lowered_in); + entry.node = node; + entry.input = i; + ARR_APP1(needs_lowering_t, needs_lowering, entry); } } -static void clear_links(ir_node *node, void *env) +void ir_lower_mode_b(ir_graph *const irg, ir_mode *const nlowered_mode) { - (void) env; - set_irn_link(node, NULL); -} + size_t i; + size_t n; -void ir_lower_mode_b(ir_graph *irg, ir_mode *mode, int do_lower_direct_cmp) -{ - lowered_mode = mode; - lower_direct_cmp = do_lower_direct_cmp; - set_using_irn_link(irg); - irg_walk_graph(irg, clear_links, NULL, NULL); - irg_walk_graph(irg, lower_mode_b_walker, NULL, NULL); - clear_using_irn_link(irg); + lowered_mode = nlowered_mode; + + /* edges are used by part_block_edges in the ir_create_cond_set variant. */ + assure_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUT_EDGES + | IR_GRAPH_PROPERTY_NO_TUPLES); + + add_irg_constraints(irg, IR_GRAPH_CONSTRAINT_MODEB_LOWERED); + ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK); + + needs_lowering = NEW_ARR_F(needs_lowering_t, 0); + + irg_walk_graph(irg, firm_clear_link, collect_needs_lowering, NULL); + + n = ARR_LEN(needs_lowering); + for (i = 0; i < n; ++i) { + const needs_lowering_t *entry = &needs_lowering[i]; + ir_node *node = entry->node; + int input = entry->input; + ir_node *in = get_irn_n(node, input); + ir_node *lowered = lower_node(in); + + if (needs_mode_b_input(node, input)) + lowered = convert_to_modeb(lowered); + set_irn_n(node, input, lowered); + } + + ir_free_resources(irg, IR_RESOURCE_IRN_LINK); + + DEL_ARR_F(needs_lowering); + + confirm_irg_properties(irg, n > 0 ? IR_GRAPH_PROPERTIES_NONE : IR_GRAPH_PROPERTIES_ALL); }