/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
static int get_conv_costs(const ir_node *node, ir_mode *dest_mode)
{
ir_mode *mode = get_irn_mode(node);
- size_t arity;
- size_t i;
+ int arity;
+ int i;
int costs;
if (mode == dest_mode)
/* Take the minimum of the conversion costs for Phi predecessors as only one
* branch is actually executed at a time */
if (is_Phi(node)) {
- size_t i;
- size_t arity = get_Phi_n_preds(node);
+ int i;
+ int arity = get_Phi_n_preds(node);
int costs;
costs = get_conv_costs(get_Phi_pred(node, 0), dest_mode);
{
ir_mode *mode = get_irn_mode(node);
ir_graph *irg = get_irn_irg(node);
- size_t arity;
- size_t conv_arity;
- size_t i;
+ int arity;
+ int conv_arity;
+ int i;
ir_node *new_node;
ir_node **ins;
invalidate |= changed;
} while (changed);
- if (invalidate) {
- set_irg_outs_inconsistent(irg);
- }
return invalidate;
}