*/
static ir_node *lookup(ir_node *e)
{
- ir_node *value = ir_nodemap_get(&value_map, e);
+ ir_node *value = (ir_node*)ir_nodemap_get(&value_map, e);
if (value != NULL)
return identify_remember(value);
return NULL;
-} /* lookup */
+}
/**
* Return the block info of a block.
*/
static block_info *get_block_info(ir_node *block)
{
- return get_irn_link(block);
-} /* get_block_info */
+ return (block_info*)get_irn_link(block);
+}
/**
* Allocate a block info for a block.
return 0;
mode = get_irn_mode(n);
if (!mode_is_data(mode)) {
- if (! is_Div(n) && ! is_Mod(n) && ! is_DivMod(n))
+ if (! is_Div(n) && ! is_Mod(n))
return 0;
if (! is_NoMem(get_fragile_op_mem(n)))
return 0;
* @param txt a text to describe the set
* @param block the owner block of the set
*/
-static void dump_value_set(ir_valueset_t *set, char *txt, ir_node *block)
+static void dump_value_set(ir_valueset_t *set, const char *txt, ir_node *block)
{
ir_valueset_iterator_t iter;
ir_node *value, *expr;
#endif /* DEBUG_libfirm */
/**
- * Topological walker. Allocates block info for every block and place nodes in topological
- * order into the nodes set.
+ * Topological walker. Allocates block info for every block and place nodes in
+ * topological order into the nodes set.
*/
static void topo_walker(ir_node *irn, void *ctx)
{
- pre_env *env = ctx;
+ pre_env *env = (pre_env*)ctx;
ir_node *block;
block_info *info;
ir_node *value;
info = get_block_info(block);
ir_valueset_insert(info->exp_gen, value, irn);
-} /* topo_walker */
+}
/**
* Computes Avail_out(block):
*/
static void compute_avail_top_down(ir_node *block, void *ctx)
{
- pre_env *env = ctx;
+ pre_env *env = (pre_env*)ctx;
block_info *dom_info;
block_info *info = get_block_info(block);
ir_node *dom_blk;
value_union(info->avail_out, info->exp_gen);
dump_value_set(info->avail_out, "Avail_out", block);
-} /* compute_avail_top_down */
+}
/**
* check if a node n is clean in block block.
ir_node *trans;
leader = leader != NULL ? leader : pred;
- trans = ir_valueset_lookup(translated, leader);
+ trans = (ir_node*)ir_valueset_lookup(translated, leader);
if ((trans != NULL && trans != leader) || (is_Phi(leader) && get_nodes_block(leader) == block))
break;
ir_node *trans;
leader = leader != NULL ? leader : pred;
- trans = ir_valueset_lookup(translated, leader);
+ trans = (ir_node*)ir_valueset_lookup(translated, leader);
if (trans == NULL)
trans = leader;
*/
static void compute_antic(ir_node *block, void *ctx)
{
- pre_env *env = ctx;
+ pre_env *env = (pre_env*)ctx;
block_info *succ_info;
block_info *info = get_block_info(block);
ir_node *succ, *value, *expr;
*/
static void insert_nodes(ir_node *block, void *ctx)
{
- pre_env *env = ctx;
+ pre_env *env = (pre_env*)ctx;
ir_node *value, *expr, *idom, *first_s, *worklist;
block_info *curr_info, *idom_info;
int pos, arity = get_irn_arity(block);
v_prime = value;
pred_info = get_block_info(pred_blk);
- e_dprime = ir_valueset_lookup(pred_info->avail_out, v_prime);
+ e_dprime = (ir_node*)ir_valueset_lookup(pred_info->avail_out, v_prime);
if (e_dprime == NULL) {
pred_info->avail = e_prime;
/* ignore bad blocks. */
if (is_Bad(pred_blk)) {
- in[pos] = new_Bad();
+ ir_graph *irg = get_irn_irg(pred_blk);
+ in[pos] = new_r_Bad(irg, mode_X);
continue;
}
*/
static void eliminate(ir_node *irn, void *ctx)
{
- pre_env *env = ctx;
+ pre_env *env = (pre_env*)ctx;
if (!is_Block(irn)) {
ir_node *block = get_nodes_block(irn);
ir_node *value = lookup(irn);
if (value != NULL) {
- ir_node *expr = ir_valueset_lookup(bl->avail_out, value);
+ ir_node *expr = (ir_node*)ir_valueset_lookup(bl->avail_out, value);
if (expr != NULL && expr != irn) {
elim_pair *p = OALLOC(env->obst, elim_pair);
/* pin the graph again: This is needed due to the use of set_opt_global_cse(1) */
set_irg_pinned(irg, op_pin_state_pinned);
restore_optimization_state(&state);
-
- if (a_env.pairs) {
- set_irg_outs_inconsistent(irg);
- set_irg_loopinfo_inconsistent(irg);
- }
} /* do_gvn_pre */
/* Creates an ir_graph pass for do_gvn_pre. */