/*
- * Copyright (C) 1995-2010 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.
- *
- * 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.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
* @brief be transform helper extracted from the ia32 backend.
* @author Matthias Braun, Michael Beck
* @date 14.06.2007
- * @version $Id$
*/
#include "config.h"
#include "trouts.h"
#include "cgana.h"
#include "debug.h"
+#include "execfreq_t.h"
#include "beirg.h"
+#include "beabi.h"
#include "betranshlp.h"
#include "belive.h"
#include "benode.h"
void be_duplicate_deps(ir_node *old_node, ir_node *new_node)
{
- int i;
int deps = get_irn_deps(old_node);
-
- for (i = 0; i < deps; ++i) {
+ for (int i = 0; i < deps; ++i) {
ir_node *dep = get_irn_dep(old_node, i);
ir_node *new_dep = be_transform_node(dep);
}
}
+ir_node *be_transform_phi(ir_node *node, const arch_register_req_t *req)
+{
+ ir_node *block = be_transform_node(get_nodes_block(node));
+ ir_graph *irg = get_Block_irg(block);
+ dbg_info *dbgi = get_irn_dbg_info(node);
+
+ /* phi nodes allow loops, so we use the old arguments for now
+ * and fix this later */
+ ir_node **ins = get_irn_in(node)+1;
+ int arity = get_irn_arity(node);
+ ir_mode *mode = req->cls != NULL ? req->cls->mode : get_irn_mode(node);
+ ir_node *phi = new_ir_node(dbgi, irg, block, op_Phi, mode, arity, ins);
+ copy_node_attr(irg, node, phi);
+ be_duplicate_deps(node, phi);
+
+ backend_info_t *info = be_get_info(phi);
+ struct obstack *obst = be_get_be_obst(irg);
+ info->in_reqs = OALLOCN(obst, const arch_register_req_t*, arity);
+ for (int i = 0; i < arity; ++i) {
+ info->in_reqs[i] = req;
+ }
+
+ arch_set_irn_register_req_out(phi, 0, req);
+ be_enqueue_preds(node);
+
+ return phi;
+}
+
void be_set_transform_function(ir_op *op, be_transform_func func)
{
/* shouldn't be assigned twice (except for exchanging the default
op->ops.generic = (op_func) func;
}
-void be_start_transform_setup(void)
+/**
+ * Transform helper for blocks.
+ */
+static ir_node *transform_block(ir_node *node)
{
- clear_irp_opcodes_generic_func();
+ ir_graph *irg = get_irn_irg(node);
+ dbg_info *dbgi = get_irn_dbg_info(node);
+ ir_mode *mode = get_irn_mode(node);
+ ir_node *block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), mode,
+ get_irn_arity(node), get_irn_in(node) + 1);
+ copy_node_attr(irg, node, block);
+ block->node_nr = node->node_nr;
- be_set_transform_function(op_Bad, be_duplicate_node);
- be_set_transform_function(op_be_Copy, be_duplicate_node);
- be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
- be_set_transform_function(op_be_IncSP, be_duplicate_node);
- be_set_transform_function(op_be_Keep, be_duplicate_node);
- be_set_transform_function(op_be_Return, be_duplicate_node);
- be_set_transform_function(op_be_Start, be_duplicate_node);
- be_set_transform_function(op_NoMem, be_duplicate_node);
- be_set_transform_function(op_Pin, be_duplicate_node);
- be_set_transform_function(op_Start, be_duplicate_node);
- be_set_transform_function(op_Sync, be_duplicate_node);
+ /* transfer execfreq value */
+ double execfreq = get_block_execfreq(node);
+ set_block_execfreq(block, execfreq);
+
+ /* put the preds in the worklist */
+ be_enqueue_preds(node);
+
+ return block;
+}
+
+static ir_node *transform_end(ir_node *node)
+{
+ /* end has to be duplicated manually because we need a dynamic in array */
+ ir_graph *irg = get_irn_irg(node);
+ dbg_info *dbgi = get_irn_dbg_info(node);
+ ir_node *block = be_transform_node(get_nodes_block(node));
+ ir_node *new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
+ copy_node_attr(irg, node, new_end);
+ be_duplicate_deps(node, new_end);
+
+ set_irg_end(irg, new_end);
+
+ /* do not transform predecessors yet to keep the pre-transform
+ * phase from visiting all the graph */
+ int arity = get_irn_arity(node);
+ for (int i = 0; i < arity; ++i) {
+ ir_node *in = get_irn_n(node, i);
+ add_End_keepalive(new_end, in);
+ }
+ be_enqueue_preds(node);
+
+ return new_end;
}
ir_node *be_duplicate_node(ir_node *node)
dbg_info *dbgi = get_irn_dbg_info(node);
ir_mode *mode = get_irn_mode(node);
ir_op *op = get_irn_op(node);
- ir_node *new_node;
- int i, arity;
- arity = get_irn_arity(node);
+ ir_node *new_node;
+ int arity = get_irn_arity(node);
if (op->opar == oparity_dynamic) {
new_node = new_ir_node(dbgi, irg, block, op, mode, -1, NULL);
- for (i = 0; i < arity; ++i) {
+ for (int i = 0; i < arity; ++i) {
ir_node *in = get_irn_n(node, i);
in = be_transform_node(in);
add_irn_n(new_node, in);
}
} else {
ir_node **ins = ALLOCAN(ir_node*, arity);
- for (i = 0; i < arity; ++i) {
+ for (int i = 0; i < arity; ++i) {
ir_node *in = get_irn_n(node, i);
ins[i] = be_transform_node(in);
}
ir_node *be_transform_node(ir_node *node)
{
- ir_op *op;
- ir_node *new_node = be_get_transformed_node(node);
- be_transform_func *transform;
-
+ ir_node *new_node = be_get_transformed_node(node);
if (new_node != NULL)
return new_node;
- DEBUG_ONLY(be_set_transformed_node(node, NULL));
+ DEBUG_ONLY(be_set_transformed_node(node, NULL);)
- op = get_irn_op(node);
- if (op->ops.generic == NULL) {
- panic("No transform function registered for node %+F.", node);
- }
- transform = (be_transform_func *)op->ops.generic;
+ ir_op *op = get_irn_op(node);
+ be_transform_func *transform = (be_transform_func *)op->ops.generic;
new_node = transform(node);
assert(new_node != NULL);
be_set_transformed_node(node, new_node);
- hook_dead_node_elim_subst(current_ir_graph, node, new_node);
return new_node;
}
void be_enqueue_preds(ir_node *node)
{
- int i, arity;
-
/* put the preds in the worklist */
- arity = get_irn_arity(node);
- for (i = 0; i < arity; ++i) {
+ int arity = get_irn_arity(node);
+ for (int i = 0; i < arity; ++i) {
ir_node *pred = get_irn_n(node, i);
pdeq_putr(env.worklist, pred);
}
*/
static void fix_loops(ir_node *node)
{
- int i, arity;
- int changed;
-
assert(node_is_in_irgs_storage(env.irg, node));
if (irn_visited_else_mark(node))
return;
- changed = 0;
+ bool changed = false;
if (! is_Block(node)) {
ir_node *block = get_nodes_block(node);
ir_node *new_block = (ir_node*)get_irn_link(block);
if (new_block != NULL) {
set_nodes_block(node, new_block);
block = new_block;
- changed = 1;
+ changed = true;
}
fix_loops(block);
}
- arity = get_irn_arity(node);
- for (i = 0; i < arity; ++i) {
+ int arity = get_irn_arity(node);
+ for (int i = 0; i < arity; ++i) {
ir_node *in = get_irn_n(node, i);
ir_node *nw = (ir_node*)get_irn_link(in);
if (nw != NULL && nw != in) {
set_irn_n(node, i, nw);
in = nw;
- changed = 1;
+ changed = true;
}
fix_loops(in);
/* fix proj block */
if (is_Proj(node)) {
set_nodes_block(node, get_nodes_block(get_Proj_pred(node)));
- changed = 1;
+ changed = true;
}
arity = get_irn_deps(node);
- for (i = 0; i < arity; ++i) {
+ for (int i = 0; i < arity; ++i) {
ir_node *in = get_irn_dep(node, i);
ir_node *nw = (ir_node*)get_irn_link(in);
if (nw != NULL && nw != in) {
set_irn_dep(node, i, nw);
in = nw;
- changed = 1;
+ changed = true;
}
fix_loops(in);
return be_transform_node(place);
}
-static void pre_transform_anchor(int anchor)
+static void pre_transform_anchor(ir_graph *irg, int anchor)
{
ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
ir_node *transformed = be_transform_node(old_anchor_node);
- set_irg_anchor(current_ir_graph, anchor, transformed);
-}
-
-static void kill_unused_anchor(int anchor)
-{
- ir_node *old_anchor_node = get_irn_n(env.old_anchor, anchor);
- ir_node *old_bad = get_irn_n(env.old_anchor, anchor_bad);
- if (old_anchor_node != NULL && get_irn_n_edges(old_anchor_node) <= 1) {
- set_irn_n(env.old_anchor, anchor, old_bad);
- }
-}
-
-static ir_node *new_be_Anchor(ir_graph *irg)
-{
- struct obstack *obst = be_get_be_obst(irg);
- backend_info_t *info;
- ir_node *new_anchor;
-
- /* Hack: some places in the code ask the Anchor for its register
- requirements */
- new_anchor = new_r_Anchor(irg);
- info = be_get_info(new_anchor);
- info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
- memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
- info->out_infos[0].req = arch_no_register_req;
-
- return new_anchor;
+ set_irg_anchor(irg, anchor, transformed);
}
/**
*/
static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform)
{
- int i;
- ir_node *old_end, *new_anchor;
-
hook_dead_node_elim(irg, 1);
inc_irg_visited(irg);
- env.irg = irg;
- env.worklist = new_waitq();
- env.old_anchor = irg->anchor;
+ env.irg = irg;
+ env.worklist = new_waitq();
+ env.old_anchor = irg->anchor;
- old_end = get_irg_end(irg);
+ ir_node *old_end = get_irg_end(irg);
/* put all anchor nodes in the worklist */
- for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
+ for (int i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
ir_node *anchor = get_irg_anchor(irg, i);
if (anchor == NULL)
waitq_put(env.worklist, anchor);
}
- new_anchor = new_be_Anchor(irg);
+ ir_node *new_anchor = new_r_Anchor(irg);
irg->anchor = new_anchor;
/* pre transform some anchors (so they are available in the other transform
* functions) */
- pre_transform_anchor(anchor_bad);
- pre_transform_anchor(anchor_no_mem);
- pre_transform_anchor(anchor_start_block);
- pre_transform_anchor(anchor_start);
- pre_transform_anchor(anchor_frame);
- kill_unused_anchor(anchor_tls);
+ pre_transform_anchor(irg, anchor_no_mem);
+ pre_transform_anchor(irg, anchor_end_block);
+ pre_transform_anchor(irg, anchor_end);
+ pre_transform_anchor(irg, anchor_start_block);
+ pre_transform_anchor(irg, anchor_start);
+ pre_transform_anchor(irg, anchor_frame);
if (pre_transform)
pre_transform();
/* fix loops and set new anchors*/
inc_irg_visited(irg);
- for (i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
+ for (int i = get_irg_n_anchors(irg) - 1; i >= 0; --i) {
ir_node *anchor = get_irn_n(env.old_anchor, i);
if (anchor == NULL)
hook_dead_node_elim(irg, 0);
}
-/**
- * Transform helper for blocks.
- */
-static ir_node *gen_Block(ir_node *node)
-{
- ir_graph *irg = current_ir_graph;
- dbg_info *dbgi = get_irn_dbg_info(node);
- ir_node *block;
-
- block = new_ir_node(dbgi, irg, NULL, get_irn_op(node), get_irn_mode(node),
- get_irn_arity(node), get_irn_in(node) + 1);
- copy_node_attr(irg, node, block);
- block->node_nr = node->node_nr;
-
- /* put the preds in the worklist */
- be_enqueue_preds(node);
-
- return block;
-}
-
-static ir_node *gen_End(ir_node *node)
-{
- /* end has to be duplicated manually because we need a dynamic in array */
- ir_graph *irg = current_ir_graph;
- dbg_info *dbgi = get_irn_dbg_info(node);
- ir_node *block = be_transform_node(get_nodes_block(node));
- int i, arity;
- ir_node *new_end;
-
- new_end = new_ir_node(dbgi, irg, block, op_End, mode_X, -1, NULL);
- copy_node_attr(irg, node, new_end);
- be_duplicate_deps(node, new_end);
-
- set_irg_end(irg, new_end);
-
- /* transform preds */
- arity = get_irn_arity(node);
- for (i = 0; i < arity; ++i) {
- ir_node *in = get_irn_n(node, i);
- ir_node *new_in = be_transform_node(in);
-
- add_End_keepalive(new_end, new_in);
- }
-
- return new_end;
-}
-
void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
{
ir_graph *old_current_ir_graph = current_ir_graph;
- struct obstack *old_obst = NULL;
- struct obstack *new_obst = NULL;
-
current_ir_graph = irg;
/* create a new obstack */
- old_obst = irg->obst;
- new_obst = XMALLOC(struct obstack);
- obstack_init(new_obst);
- irg->obst = new_obst;
+ struct obstack old_obst = irg->obst;
+ obstack_init(&irg->obst);
irg->last_node_idx = 0;
- /* invalidate phase info as (at least vrp info) is used inside the
- * equivalent/compute_value functions and might replace our newly
- * created nodes with middleend nodes */
- irg_invalidate_phases(irg);
+ free_vrp_data(irg);
/* create new value table for CSE */
new_identities(irg);
- /* enter special helper */
- op_Block->ops.generic = (op_func)gen_Block;
- op_End->ops.generic = (op_func)gen_End;
-
/* do the main transformation */
transform_nodes(irg, func);
/* free the old obstack */
- obstack_free(old_obst, 0);
- xfree(old_obst);
+ obstack_free(&old_obst, 0);
/* restore state */
current_ir_graph = old_current_ir_graph;
/* most analysis info is wrong after transformation */
- free_callee_info(irg);
- free_irg_outs(irg);
- free_trouts();
- free_loop_information(irg);
- set_irg_doms_inconsistent(irg);
-
- be_liveness_invalidate(be_get_irg_liveness(irg));
- /* Hack for now, something is buggy with invalidate liveness... */
- be_birg_from_irg(irg)->lv = NULL;
- be_invalidate_dom_front(irg);
+ be_invalidate_live_chk(irg);
+ confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_NONE);
/* recalculate edges */
- edges_deactivate(irg);
edges_activate(irg);
}
-int be_mux_is_abs(ir_node *sel, ir_node *mux_true, ir_node *mux_false)
+bool be_upper_bits_clean(const ir_node *node, ir_mode *mode)
{
- ir_node *cmp_left;
- ir_node *cmp_right;
- ir_mode *mode;
- ir_relation relation;
-
- if (!is_Cmp(sel))
- return 0;
-
- /**
- * Note further that these optimization work even for floating point
- * with NaN's because -NaN == NaN.
- * However, if +0 and -0 is handled differently, we cannot use the Abs/-Abs
- * transformations.
- */
- mode = get_irn_mode(mux_true);
- if (mode_honor_signed_zeros(mode))
- return 0;
-
- /* must be <, <=, >=, > */
- relation = get_Cmp_relation(sel);
- if ((relation & ir_relation_less_greater) == 0)
- return 0;
-
- if (!ir_is_negated_value(mux_true, mux_false))
- return 0;
-
- /* must be x cmp 0 */
- cmp_right = get_Cmp_right(sel);
- if (!is_Const(cmp_right) || !is_Const_null(cmp_right))
- return 0;
-
- cmp_left = get_Cmp_left(sel);
- if (cmp_left == mux_false) {
- if (relation & ir_relation_less) {
- return 1;
- } else {
- assert(relation & ir_relation_greater);
- return -1;
- }
- } else if (cmp_left == mux_true) {
- if (relation & ir_relation_less) {
- return -1;
- } else {
- assert(relation & ir_relation_greater);
- return 1;
+ ir_op *op = get_irn_op(node);
+ if (op->ops.generic1 == NULL)
+ return false;
+ upper_bits_clean_func func = (upper_bits_clean_func)op->ops.generic1;
+ return func(node, mode);
+}
+
+static bool bit_binop_upper_bits_clean(const ir_node *node, ir_mode *mode)
+{
+ return be_upper_bits_clean(get_binop_left(node), mode)
+ && be_upper_bits_clean(get_binop_right(node), mode);
+}
+
+static bool mux_upper_bits_clean(const ir_node *node, ir_mode *mode)
+{
+ return be_upper_bits_clean(get_Mux_true(node), mode)
+ && be_upper_bits_clean(get_Mux_false(node), mode);
+}
+
+static bool and_upper_bits_clean(const ir_node *node, ir_mode *mode)
+{
+ if (!mode_is_signed(mode)) {
+ return be_upper_bits_clean(get_And_left(node), mode)
+ || be_upper_bits_clean(get_And_right(node), mode);
+ } else {
+ return bit_binop_upper_bits_clean(node, mode);
+ }
+}
+
+static bool shr_upper_bits_clean(const ir_node *node, ir_mode *mode)
+{
+ if (mode_is_signed(mode)) {
+ return false;
+ } else {
+ const ir_node *right = get_Shr_right(node);
+ if (is_Const(right)) {
+ ir_tarval *tv = get_Const_tarval(right);
+ long val = get_tarval_long(tv);
+ if (val >= 32 - (long)get_mode_size_bits(mode))
+ return true;
}
+ return be_upper_bits_clean(get_Shr_left(node), mode);
+ }
+}
+
+static bool shrs_upper_bits_clean(const ir_node *node, ir_mode *mode)
+{
+ return be_upper_bits_clean(get_Shrs_left(node), mode);
+}
+
+static bool const_upper_bits_clean(const ir_node *node, ir_mode *mode)
+{
+ ir_tarval *tv = get_Const_tarval(node);
+ long val = get_tarval_long(tv);
+ if (mode_is_signed(mode)) {
+ long shifted = val >> (get_mode_size_bits(mode)-1);
+ return shifted == 0 || shifted == -1;
+ } else {
+ unsigned long shifted = (unsigned long)val;
+ shifted >>= get_mode_size_bits(mode)-1;
+ shifted >>= 1;
+ return shifted == 0;
+ }
+}
+
+static bool conv_upper_bits_clean(const ir_node *node, ir_mode *mode)
+{
+ ir_mode *dest_mode = get_irn_mode(node);
+ const ir_node *op = get_Conv_op(node);
+ ir_mode *src_mode = get_irn_mode(op);
+ if (mode_is_float(src_mode))
+ return true;
+
+ unsigned src_bits = get_mode_size_bits(src_mode);
+ unsigned dest_bits = get_mode_size_bits(dest_mode);
+ /* downconvs are a nop */
+ if (src_bits >= dest_bits)
+ return be_upper_bits_clean(op, mode);
+ /* upconvs are fine if src is big enough or if sign matches */
+ if (src_bits <= get_mode_size_bits(mode)
+ && mode_is_signed(src_mode) == mode_is_signed(mode))
+ return true;
+ return false;
+}
+
+static bool proj_upper_bits_clean(const ir_node *node, ir_mode *mode)
+{
+ const ir_node *pred = get_Proj_pred(node);
+ switch (get_irn_opcode(pred)) {
+ case iro_Load: {
+ ir_mode *load_mode = get_Load_mode(pred);
+ unsigned load_bits = get_mode_size_bits(load_mode);
+ if (load_bits > get_mode_size_bits(mode))
+ return false;
+ if (mode_is_signed(load_mode) != mode_is_signed(mode))
+ return false;
+ return true;
+ }
+ default:
+ break;
}
+ return false;
+}
- return 0;
+void be_set_upper_bits_clean_function(ir_op *op, upper_bits_clean_func func)
+{
+ op->ops.generic1 = (op_func)func;
}
-ir_node *be_get_abs_op(ir_node *sel)
+void be_start_transform_setup(void)
{
- ir_node *cmp_left = get_Cmp_left(sel);
- return cmp_left;
+ ir_clear_opcodes_generic_func();
+
+ be_set_transform_function(op_Bad, be_duplicate_node);
+ be_set_transform_function(op_be_Copy, be_duplicate_node);
+ be_set_transform_function(op_be_CopyKeep, be_duplicate_node);
+ be_set_transform_function(op_be_IncSP, be_duplicate_node);
+ be_set_transform_function(op_be_Keep, be_duplicate_node);
+ be_set_transform_function(op_be_Return, be_duplicate_node);
+ be_set_transform_function(op_be_Start, be_duplicate_node);
+ be_set_transform_function(op_Block, transform_block);
+ be_set_transform_function(op_End, transform_end);
+ be_set_transform_function(op_NoMem, be_duplicate_node);
+ be_set_transform_function(op_Pin, be_duplicate_node);
+ be_set_transform_function(op_Start, be_duplicate_node);
+ be_set_transform_function(op_Sync, be_duplicate_node);
+
+ be_set_upper_bits_clean_function(op_And, and_upper_bits_clean);
+ be_set_upper_bits_clean_function(op_Const, const_upper_bits_clean);
+ be_set_upper_bits_clean_function(op_Conv, conv_upper_bits_clean);
+ be_set_upper_bits_clean_function(op_Eor, bit_binop_upper_bits_clean);
+ be_set_upper_bits_clean_function(op_Mux, mux_upper_bits_clean);
+ be_set_upper_bits_clean_function(op_Or, bit_binop_upper_bits_clean);
+ be_set_upper_bits_clean_function(op_Proj, proj_upper_bits_clean);
+ be_set_upper_bits_clean_function(op_Shr, shr_upper_bits_clean);
+ be_set_upper_bits_clean_function(op_Shrs, shrs_upper_bits_clean);
}
projects / libfirm / blobdiff