/*
- * 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.
- *
- * 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$
*/
-#ifdef HAVE_CONFIG_H
#include "config.h"
-#endif
#include "pdeq.h"
#include "irop_t.h"
#include "trouts.h"
#include "cgana.h"
#include "debug.h"
+#include "execfreq_t.h"
-#include "beirg_t.h"
+#include "beirg.h"
+#include "beabi.h"
#include "betranshlp.h"
+#include "belive.h"
+#include "benode.h"
typedef struct be_transform_env_t {
ir_graph *irg; /**< The irg, the node should be created in */
- int visited; /**< visited count that indicates whether a
- node is already transformed */
waitq *worklist; /**< worklist of nodes that still need to be
transformed */
ir_node *old_anchor; /**< the old anchor node in the old irg */
static be_transform_env_t env;
-void be_set_transformed_node(ir_node *old_node, ir_node *new_node) {
+void be_set_transformed_node(ir_node *old_node, ir_node *new_node)
+{
set_irn_link(old_node, new_node);
+ mark_irn_visited(old_node);
}
-int be_is_transformed(const ir_node *node) {
+int be_is_transformed(const ir_node *node)
+{
return irn_visited(node);
}
-static INLINE ir_node *be_get_transformed_node(ir_node *old_node) {
- assert(irn_visited(old_node));
- return (ir_node*) get_irn_link(old_node);
+static inline ir_node *be_get_transformed_node(ir_node *old_node)
+{
+ if (irn_visited(old_node)) {
+ ir_node *new_node = (ir_node*)get_irn_link(old_node);
+ assert(new_node != NULL);
+ return new_node;
+ }
+ return NULL;
}
-void be_duplicate_deps(ir_node *old_node, ir_node *new_node) {
- int i;
+void be_duplicate_deps(ir_node *old_node, ir_node *new_node)
+{
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_duplicate_node(ir_node *node) {
+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
+ * be_duplicate_node entries) */
+ assert(op->ops.generic == NULL
+ || op->ops.generic == (op_func) be_duplicate_node);
+ op->ops.generic = (op_func) func;
+}
+
+/**
+ * Transform helper for blocks.
+ */
+static ir_node *transform_block(ir_node *node)
+{
+ 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;
+
+ /* 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)
+{
ir_node *block = be_transform_node(get_nodes_block(node));
ir_graph *irg = env.irg;
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 = alloca(arity * sizeof(ins[0]));
- for (i = 0; i < arity; ++i) {
+ ir_node **ins = ALLOCAN(ir_node*, arity);
+ for (int i = 0; i < arity; ++i) {
ir_node *in = get_irn_n(node, i);
ins[i] = be_transform_node(in);
}
new_node = new_ir_node(dbgi, irg, block, op, mode, arity, ins);
}
- copy_node_attr(node, new_node);
+ copy_node_attr(irg, node, new_node);
be_duplicate_deps(node, new_node);
-#ifdef DEBUG_libfirm
new_node->node_nr = node->node_nr;
-#endif
-
return new_node;
}
-/**
- * Calls transformation function for given node and marks it visited.
- */
-ir_node *be_transform_node(ir_node *node) {
- ir_node *new_node;
- ir_op *op;
-
- if (irn_visited(node)) {
- new_node = be_get_transformed_node(node);
- assert(new_node != NULL);
+ir_node *be_transform_node(ir_node *node)
+{
+ ir_node *new_node = be_get_transformed_node(node);
+ if (new_node != NULL)
return new_node;
- }
- mark_irn_visited(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) {
- be_transform_func *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);
- } else {
- new_node = be_duplicate_node(node);
- }
+ new_node = transform(node);
+ assert(new_node != NULL);
be_set_transformed_node(node, new_node);
- mark_irn_visited(new_node);
- hook_dead_node_elim_subst(current_ir_graph, node, new_node);
return new_node;
}
-/**
- * enqueue all inputs into the transform queue.
- */
-void be_enqueue_preds(ir_node *node) {
- int i, arity;
-
+void be_enqueue_preds(ir_node *node)
+{
/* 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);
}
/**
* Rewire nodes which are potential loops (like Phis) to avoid endless loops.
*/
-static void fix_loops(ir_node *node) {
- int i, arity;
- int changed;
-
+static void fix_loops(ir_node *node)
+{
assert(node_is_in_irgs_storage(env.irg, node));
- if (irn_visited(node))
+ if (irn_visited_else_mark(node))
return;
- mark_irn_visited(node);
-
- changed = 0;
+ bool changed = false;
if (! is_Block(node)) {
ir_node *block = get_nodes_block(node);
- ir_node *new_block = get_irn_link(block);
+ 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 = get_irn_link(in);
+ 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)) {
+ 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 = get_irn_link(in);
+ 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);
}
- if(changed) {
- identify_remember(current_ir_graph->value_table, node);
+ if (changed) {
+ identify_remember(node);
}
}
-ir_node *be_pre_transform_node(ir_node *place) {
+ir_node *be_pre_transform_node(ir_node *place)
+{
if (place == NULL)
return NULL;
return be_transform_node(place);
}
-ir_node *be_get_old_anchor(int anchor)
-{
- return get_irn_n(env.old_anchor, anchor);
-}
-
-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);
- }
+ set_irg_anchor(irg, anchor, transformed);
}
/**
* Transforms all nodes. Deletes the old obstack and creates a new one.
*/
-static void transform_nodes(ir_graph *irg, arch_pretrans_nodes *pre_transform,
- void *cg)
+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.visited = get_irg_visited(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_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)(cg);
+ pre_transform();
/* process worklist (this should transform all nodes in the graph) */
while (! waitq_empty(env.worklist)) {
- ir_node *node = waitq_get(env.worklist);
+ ir_node *node = (ir_node*)waitq_get(env.worklist);
be_transform_node(node);
}
/* 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)
continue;
- anchor = get_irn_link(anchor);
+ anchor = (ir_node*)get_irn_link(anchor);
fix_loops(anchor);
set_irn_n(new_anchor, i, anchor);
}
- set_irn_n(new_anchor, -1, get_irg_anchor(irg, anchor_end_block));
del_waitq(env.worklist);
free_End(old_end);
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 *old_start_block = get_irn_n(env.old_anchor, anchor_start_block);
- ir_node *block;
-
- /*
- * We replace the ProjX from the start node with a jump,
- * so the startblock has no preds anymore now
- */
- if (node == old_start_block) {
- return new_rd_Block(dbgi, irg, 0, NULL);
- }
-
- /* we use the old blocks for now, because jumps allow cycles in the graph
- * we have to fix this later */
- 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(node, block);
-
-#ifdef DEBUG_libfirm
- block->node_nr = node->node_nr;
-#endif
- be_set_transformed_node(node, block);
-
- /* 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(node, new_end);
- be_duplicate_deps(node, new_end);
-
- set_irg_end(irg, new_end);
- be_set_transformed_node(new_end, 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(be_irg_t *birg, arch_pretrans_nodes *func, void *cg)
+void be_transform_graph(ir_graph *irg, arch_pretrans_nodes *func)
{
- ir_graph *irg = birg->irg;
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(sizeof(*new_obst));
- obstack_init(new_obst);
- irg->obst = new_obst;
+ struct obstack old_obst = irg->obst;
+ obstack_init(&irg->obst);
irg->last_node_idx = 0;
- /* create new value table for CSE */
- del_identities(irg->value_table);
- irg->value_table = new_identities();
+ free_vrp_data(irg);
- /* enter special helper */
- op_Block->ops.generic = (op_func)gen_Block;
- op_End->ops.generic = (op_func)gen_End;
+ /* create new value table for CSE */
+ new_identities(irg);
/* do the main transformation */
- transform_nodes(irg, func, cg);
-
- /* we don't want the globals anchor anymore */
- set_irg_globals(irg, new_r_Bad(irg));
+ 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_birg_liveness(birg));
- /* Hack for now, something is buggy with invalidate liveness... */
- birg->lv = NULL;
- be_invalidate_dom_front(birg);
+ be_invalidate_live_chk(irg);
+ confirm_irg_properties(irg, IR_GRAPH_PROPERTIES_NONE);
/* recalculate edges */
- edges_deactivate(irg);
edges_activate(irg);
+}
+
+bool be_upper_bits_clean(const ir_node *node, ir_mode *mode)
+{
+ 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);
+ }
+}
- if (birg->lv) {
- be_liveness_free(birg->lv);
- birg->lv = be_liveness(birg);
+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;
+}
+
+void be_set_upper_bits_clean_function(ir_op *op, upper_bits_clean_func func)
+{
+ op->ops.generic1 = (op_func)func;
+}
+
+void be_start_transform_setup(void)
+{
+ 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