/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
#include "irloop.h"
#include "analyze_irg_args.h"
#include "irprintf.h"
-#include "compute_loop_info.h"
#include "irgopt.h"
#include "xmalloc.h"
{
const ent_leaves_t *c1 = elt;
const ent_leaves_t *c2 = key;
+ (void) size;
return c1->ent != c2->ent;
}
{
const sels_t *c1 = elt;
const sels_t *c2 = key;
+ (void) size;
return c1->sel != c2->sel;
}
{
const call_access_t *c1 = elt;
const call_access_t *c2 = key;
+ (void) size;
return c1->call != c2->call;
}
{
const path_t *p1 = elt;
const path_t *p2 = key;
+ (void) size;
/* we can use memcmp here, because identical tarvals should have identical addresses */
return memcmp(p1->path, p2->path, p1->path_len * sizeof(p1->path[0]));
int *accessed_leaves_vnum = NULL; /**< An arraw, where are saved the value number, that
are synced from call's sync node, if we need it.*/
- if(get_irn_node_nr(call) == 2763)
- printf("\nHi\n");
-
call_blk = get_nodes_block(call);
val_arr = get_irn_link(call_blk);
/* An array to save the memory edges, that must be
remove_critical_cf_edges(irg);
/* Call algorithm that computes the out edges.*/
- if (get_irg_outs_state(irg) != outs_consistent)
- compute_irg_outs(irg);
+ assure_irg_outs(irg);
/* Call algorithm that computes the loop information.*/
- compute_loop_info(irg);
+ construct_cf_backedges(irg);
+
/* Call algorithm that computes the dominance information.*/
- compute_doms(irg);
+ assure_doms(irg);
/* Find possible scalar replacements */
if (find_possible_replacements(irg)) {
}
}
- if(get_firm_verbosity())
- printf("vnumber in data flow= %i\n", vnum);
-
/* Allocate value number for the globule memory edge.
* and a value number for the value numbers state.*/
vnum = vnum + 2;