* @file
* @brief Cliff Click's Combined Analysis/Optimization
* @author Michael Beck
- * @version $Id$
*
* This is a slightly enhanced version of Cliff Clicks combo algorithm
* - support for commutative nodes is added, Add(a,b) and Add(b,a) ARE congruent
/**
* Dump partition and type for a node.
*/
-static int dump_partition_hook(FILE *F, ir_node *n, ir_node *local)
+static int dump_partition_hook(FILE *F, const ir_node *n, const ir_node *local)
{
- ir_node *irn = local != NULL ? local : n;
+ const ir_node *irn = local != NULL ? local : n;
node_t *node = get_irn_node(irn);
ir_fprintf(F, "info2 : \"partition %u type %+F\"\n", node->part->nr, node->type);
int i;
ir_node *block = node->node;
- if (block == get_irg_start_block(current_ir_graph) || has_Block_entity(block)) {
+ if (block == get_irg_start_block(current_ir_graph) || get_Block_entity(block) != NULL) {
/* start block and labelled blocks are always reachable */
node->type.tv = tarval_reachable;
return;
*/
static int can_exchange(ir_node *pred, ir_node *block)
{
- if (is_Start(pred) || has_Block_entity(block))
+ if (is_Start(pred) || get_Block_entity(block) != NULL)
return 0;
else if (is_Jmp(pred))
return 1;