#include "irnode_t.h"
#include "irprintf.h"
#include "irtools.h"
+#include "irbitset.h"
#include "beifg_t.h"
#include "beifg_impl.h"
#include "irphase.h"
{
if(!node_is_in_irgs_storage(ifg->env->irg, n))
{
- printf ("+%F is in ifg but not in the current irg!",n);
+ ir_printf("+%F is in ifg but not in the current irg!", n);
assert (node_is_in_irgs_storage(ifg->env->irg, n));
}
void be_ifg_check_performance(be_chordal_env_t *chordal_env)
{
+#ifdef WITH_LIBCORE
int tests = BE_CH_PERFORMANCETEST_COUNT;
coloring_t coloring;
lc_timer_t *timer = lc_timer_register("getTime","get Time of copy minimization using the ifg");
unsigned long elapsed_usec = 0;
- if ((int) get_irg_estimated_node_cnt >= BE_CH_PERFORMANCETEST_MIN_NODES)
+ if (get_irg_estimated_node_cnt(chordal_env->irg) >= BE_CH_PERFORMANCETEST_MIN_NODES)
{
coloring_init(&coloring, chordal_env->irg, chordal_env->birg->main_env->arch_env);
coloring_save(&coloring);
ir_printf("\nstd:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
- i=0;
used_memory=0;
elapsed_usec=0;
ir_printf("\nclique:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
- i=0;
used_memory=0;
elapsed_usec=0;
ir_printf("\nlist:; %+F; %u; %u ",current_ir_graph, used_memory, elapsed_usec);
- i=0;
used_memory=0;
elapsed_usec=0;
}
chordal_env->ifg = old_if;
+#endif /* WITH_LIBCORE */
}
void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self)
fprintf(file, "}\n");
bitset_free(nodes);
}
+
+void be_ifg_stat(const be_ifg_t *ifg, ir_graph *irg, be_ifg_stat_t *stat)
+{
+ void *nodes_it = be_ifg_nodes_iter_alloca(ifg);
+ void *neigh_it = be_ifg_neighbours_iter_alloca(ifg);
+ bitset_t *nodes = bitset_irg_malloc(irg);
+
+ ir_node *n, *m;
+
+ memset(stat, 0, sizeof(stat[0]));
+ be_ifg_foreach_node(ifg, nodes_it, n) {
+ stat->n_nodes += 1;
+ be_ifg_foreach_neighbour(ifg, neigh_it, n, m) {
+ bitset_add_irn(nodes, n);
+ stat->n_edges += !bitset_contains_irn(nodes, m);
+ }
+ }
+
+ bitset_free(nodes);
+}