X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeifg.c;h=c047a14b7bdda6cbd75c9014b1a29bde706b1e40;hb=554dbf627a86307df50a784e5476d929c36882e8;hp=1b5a2dcdf2bca7cd2742bd04984905be2c1e75cb;hpb=423c859509f75769c66d1509110d7c678c6158d4;p=libfirm diff --git a/ir/be/beifg.c b/ir/be/beifg.c index 1b5a2dcdf..c047a14b7 100644 --- a/ir/be/beifg.c +++ b/ir/be/beifg.c @@ -1,38 +1,38 @@ -/** - * @file beifg.c - * @date 18.11.2005 - * @author Sebastian Hack +/* + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. * - * Copyright (C) 2005 Universitaet Karlsruhe - * Released under the GPL + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ -#include - -#ifdef HAVE_CONFIG_H +/** + * @file + * @brief Interface for interference graphs. + * @author Sebastian Hack + * @date 18.11.2005 + * @version $Id$ + */ #include "config.h" -#endif - -#ifdef HAVE_MALLOC_H -#include -#endif -#ifdef __linux__ -#include -#endif /* __linux__ */ - -#ifdef HAVE_ALLOCA_H -#include -#endif +#include -#ifdef WITH_LIBCORE -#include -#include -#include -#endif /* WITH_LIBCORE */ +#include "lc_opts.h" +#include "lc_opts_enum.h" +#include "timing.h" #include "bitset.h" - #include "irgwalk.h" #include "irnode_t.h" #include "irprintf.h" @@ -40,12 +40,14 @@ #include "irbitset.h" #include "beifg_t.h" #include "beifg_impl.h" -#include "irphase.h" #include "irphase_t.h" -#include "bechordal.h" +#include "error.h" +#include "xmalloc.h" #include "becopystat.h" #include "becopyopt.h" +#include "beirg.h" +#include "bemodule.h" /** Defines values for the ifg performance test */ #define BE_CH_PERFORMANCETEST_MIN_NODES (50) @@ -54,39 +56,36 @@ typedef struct _coloring_t coloring_t; struct _coloring_t { - phase_t ph; - const arch_env_t *arch_env; - ir_graph *irg; + ir_phase ph; + ir_graph *irg; }; -size_t (be_ifg_nodes_iter_size)(const void *self) +size_t (be_ifg_nodes_iter_size)(const be_ifg_t *ifg) { - const be_ifg_t *ifg = self; return ifg->impl->nodes_iter_size; } -size_t (be_ifg_neighbours_iter_size)(const void *self) +size_t (be_ifg_neighbours_iter_size)(const be_ifg_t *ifg) { - const be_ifg_t *ifg = self; return ifg->impl->neighbours_iter_size; } -size_t (be_ifg_cliques_iter_size)(const void *self) +size_t (be_ifg_cliques_iter_size)(const be_ifg_t *ifg) { - const be_ifg_t *ifg = self; return ifg->impl->cliques_iter_size; } -static void *regs_irn_data_init(phase_t *ph, ir_node *irn, void *data) +static void *regs_irn_data_init(ir_phase *ph, const ir_node *irn, void *data) { - coloring_t *coloring = (coloring_t *) ph; - return (void *) arch_get_irn_register(coloring->arch_env, irn); + (void)ph; + (void)data; + + return (void*)arch_get_irn_register(irn); } -coloring_t *coloring_init(coloring_t *c, ir_graph *irg, const arch_env_t *aenv) +static coloring_t *coloring_init(coloring_t *c, ir_graph *irg) { - phase_init(&c->ph, "regs_map", irg, PHASE_DEFAULT_GROWTH, regs_irn_data_init); - c->arch_env = aenv; + phase_init(&c->ph, "regs_map", irg, PHASE_DEFAULT_GROWTH, regs_irn_data_init, NULL); c->irg = irg; return c; } @@ -102,89 +101,77 @@ static void restore_irn_color(ir_node *irn, void *c) coloring_t *coloring = c; const arch_register_t *reg = phase_get_irn_data(&coloring->ph, irn); if(reg) - arch_set_irn_register(coloring->arch_env, irn, reg); + arch_set_irn_register(irn, reg); } -void coloring_save(coloring_t *c) +static void coloring_save(coloring_t *c) { irg_walk_graph(c->irg, NULL, get_irn_color, c); } -void coloring_restore(coloring_t *c) +static void coloring_restore(coloring_t *c) { irg_walk_graph(c->irg, NULL, restore_irn_color, c); } -void (be_ifg_free)(void *self) +void (be_ifg_free)(be_ifg_t *ifg) { - be_ifg_t *ifg = self; - ifg->impl->free(self); + ifg->impl->free(ifg); } -int (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b) +int (be_ifg_connected)(const be_ifg_t *ifg, const ir_node *a, const ir_node *b) { - const be_ifg_t *ifg = self; - return ifg->impl->connected(self, a, b); + return ifg->impl->connected(ifg, a, b); } -ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn) +ir_node *(be_ifg_neighbours_begin)(const be_ifg_t *ifg, void *iter, const ir_node *irn) { - const be_ifg_t *ifg = self; - return ifg->impl->neighbours_begin(self, iter, irn); + return ifg->impl->neighbours_begin(ifg, iter, irn); } -ir_node *(be_ifg_neighbours_next)(const void *self, void *iter) +ir_node *(be_ifg_neighbours_next)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - return ifg->impl->neighbours_next(self, iter); + return ifg->impl->neighbours_next(ifg, iter); } -void (be_ifg_neighbours_break)(const void *self, void *iter) +void (be_ifg_neighbours_break)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - ifg->impl->neighbours_break(self, iter); + ifg->impl->neighbours_break(ifg, iter); } -ir_node *(be_ifg_nodes_begin)(const void *self, void *iter) +ir_node *(be_ifg_nodes_begin)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - return ifg->impl->nodes_begin(self, iter); + return ifg->impl->nodes_begin(ifg, iter); } -ir_node *(be_ifg_nodes_next)(const void *self, void *iter) +ir_node *(be_ifg_nodes_next)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - return ifg->impl->nodes_next(self, iter); + return ifg->impl->nodes_next(ifg, iter); } -void (be_ifg_nodes_break)(const void *self, void *iter) +void (be_ifg_nodes_break)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - ifg->impl->nodes_break(self, iter); + ifg->impl->nodes_break(ifg, iter); } -int (be_ifg_cliques_begin)(const void *self, void *iter, ir_node **buf) +int (be_ifg_cliques_begin)(const be_ifg_t *ifg, void *iter, ir_node **buf) { - const be_ifg_t *ifg = self; - return ifg->impl->cliques_begin(self, iter, buf); + return ifg->impl->cliques_begin(ifg, iter, buf); } -int (be_ifg_cliques_next)(const void *self, void *iter) +int (be_ifg_cliques_next)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - return ifg->impl->cliques_next(self, iter); + return ifg->impl->cliques_next(ifg, iter); } -void (be_ifg_cliques_break)(const void *self, void *iter) +void (be_ifg_cliques_break)(const be_ifg_t *ifg, void *iter) { - const be_ifg_t *ifg = self; - ifg->impl->cliques_break(self, iter); + ifg->impl->cliques_break(ifg, iter); } -int (be_ifg_degree)(const void *self, const ir_node *irn) +int (be_ifg_degree)(const be_ifg_t *ifg, const ir_node *irn) { - const be_ifg_t *ifg = self; - return ifg->impl->degree(self, irn); + return ifg->impl->degree(ifg, irn); } @@ -193,7 +180,7 @@ int be_ifg_is_simplicial(const be_ifg_t *ifg, const ir_node *irn) int degree = be_ifg_degree(ifg, irn); void *iter = be_ifg_neighbours_iter_alloca(ifg); - ir_node **neighbours = xmalloc(degree * sizeof(neighbours[0])); + ir_node **neighbours = XMALLOCN(ir_node*, degree); ir_node *curr; int i, j; @@ -270,8 +257,8 @@ static int be_ifg_check_cmp_nodes(const void *a, const void *b) const ir_node *node_a = *(ir_node **)a; const ir_node *node_b = *(ir_node **)b; - long nr_a = get_irn_node_nr(node_a); - long nr_b = get_irn_node_nr(node_b); + long nr_a = get_irn_idx(node_a); + long nr_b = get_irn_idx(node_b); return QSORT_CMP(nr_a, nr_b); } @@ -285,7 +272,7 @@ void be_ifg_check_sorted(const be_ifg_t *ifg) const int node_count = be_ifg_check_get_node_count(ifg); int i = 0; - ir_node **all_nodes = xmalloc(node_count * sizeof(all_nodes[0])); + ir_node **all_nodes = XMALLOCN(ir_node*, node_count); be_ifg_foreach_node(ifg, iter1, n) { @@ -303,7 +290,7 @@ void be_ifg_check_sorted(const be_ifg_t *ifg) for (i = 0; i < node_count; i++) { - ir_node **neighbours = xmalloc(node_count * sizeof(neighbours[0])); + ir_node **neighbours = XMALLOCN(ir_node*, node_count); int j = 0; int k = 0; int degree = 0; @@ -343,7 +330,7 @@ void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f) const int node_count = be_ifg_check_get_node_count(ifg); int i = 0; - ir_node **all_nodes = xmalloc(node_count * sizeof(all_nodes[0])); + ir_node **all_nodes = XMALLOCN(ir_node*, node_count); be_ifg_foreach_node(ifg, iter1, n) { @@ -361,7 +348,7 @@ void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f) for (i = 0; i < node_count; i++) { - ir_node **neighbours = xmalloc(node_count * sizeof(neighbours[0])); + ir_node **neighbours = XMALLOCN(ir_node*, node_count); int j = 0; int k = 0; int degree = 0; @@ -394,7 +381,6 @@ void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f) void be_ifg_check_performance(be_chordal_env_t *chordal_env) { -#ifdef WITH_LIBCORE int tests = BE_CH_PERFORMANCETEST_COUNT; coloring_t coloring; @@ -405,30 +391,30 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) copy_opt_t *co; be_ifg_t *old_if = chordal_env->ifg; - lc_timer_t *timer = lc_timer_register("getTime","get Time of copy minimization using the ifg"); + ir_timer_t *timer = ir_timer_register("getTime","get Time of copy minimization using the ifg"); unsigned long elapsed_usec = 0; 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_init(&coloring, chordal_env->irg); coloring_save(&coloring); - lc_timer_reset(timer); + ir_timer_reset(timer); for (i = 0; iifg = be_ifg_std_new(chordal_env); - lc_timer_stop(timer); - rt = lc_timer_leave_high_priority(); + ir_timer_stop(timer); + rt = ir_timer_leave_high_priority(); - used_memory = lc_get_heap_used_bytes() - used_memory; + used_memory = ir_get_heap_used_bytes() - used_memory; coloring_restore(&coloring); @@ -437,13 +423,13 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) co_build_ou_structure(co); co_build_graph_structure(co); - rt = lc_timer_enter_high_priority(); - lc_timer_start(timer); + rt = ir_timer_enter_high_priority(); + ir_timer_start(timer); co_solve_heuristic_new(co); - lc_timer_stop(timer); - rt = lc_timer_leave_high_priority(); + ir_timer_stop(timer); + rt = ir_timer_leave_high_priority(); co_free_graph_structure(co); co_free_ou_structure(co); @@ -452,7 +438,7 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) } - elapsed_usec = lc_timer_elapsed_usec(timer); + elapsed_usec = ir_timer_elapsed_usec(timer); /* calculating average */ elapsed_usec = elapsed_usec / tests; @@ -463,17 +449,17 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) for (i = 0; iifg = be_ifg_clique_new(chordal_env); - lc_timer_stop(timer); - rt = lc_timer_leave_high_priority(); + ir_timer_stop(timer); + rt = ir_timer_leave_high_priority(); - used_memory = lc_get_heap_used_bytes() - used_memory; + used_memory = ir_get_heap_used_bytes() - used_memory; coloring_restore(&coloring); @@ -482,13 +468,13 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) co_build_ou_structure(co); co_build_graph_structure(co); - rt = lc_timer_enter_high_priority(); - lc_timer_start(timer); + rt = ir_timer_enter_high_priority(); + ir_timer_start(timer); co_solve_heuristic_new(co); - lc_timer_stop(timer); - rt = lc_timer_leave_high_priority(); + ir_timer_stop(timer); + rt = ir_timer_leave_high_priority(); co_free_graph_structure(co); co_free_ou_structure(co); @@ -497,7 +483,7 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) } - elapsed_usec = lc_timer_elapsed_usec(timer); + elapsed_usec = ir_timer_elapsed_usec(timer); /* calculating average */ elapsed_usec = elapsed_usec / tests; @@ -508,17 +494,17 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) for (i = 0; iifg = be_ifg_list_new(chordal_env); - lc_timer_stop(timer); - rt = lc_timer_leave_high_priority(); + ir_timer_stop(timer); + rt = ir_timer_leave_high_priority(); - used_memory = lc_get_heap_used_bytes() - used_memory; + used_memory = ir_get_heap_used_bytes() - used_memory; coloring_restore(&coloring); @@ -527,13 +513,13 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) co_build_ou_structure(co); co_build_graph_structure(co); - rt = lc_timer_enter_high_priority(); - lc_timer_start(timer); + rt = ir_timer_enter_high_priority(); + ir_timer_start(timer); co_solve_heuristic_new(co); - lc_timer_stop(timer); - rt = lc_timer_leave_high_priority(); + ir_timer_stop(timer); + rt = ir_timer_leave_high_priority(); co_free_graph_structure(co); co_free_ou_structure(co); @@ -542,7 +528,7 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) } - elapsed_usec = lc_timer_elapsed_usec(timer); + elapsed_usec = ir_timer_elapsed_usec(timer); /* calculating average */ elapsed_usec = elapsed_usec / tests; @@ -553,17 +539,17 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) for (i = 0; iifg = be_ifg_pointer_new(chordal_env); - lc_timer_stop(timer); - rt = lc_timer_leave_high_priority(); + ir_timer_stop(timer); + rt = ir_timer_leave_high_priority(); - used_memory = lc_get_heap_used_bytes() - used_memory; + used_memory = ir_get_heap_used_bytes() - used_memory; coloring_restore(&coloring); @@ -572,13 +558,13 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) co_build_ou_structure(co); co_build_graph_structure(co); - rt = lc_timer_enter_high_priority(); - lc_timer_start(timer); + rt = ir_timer_enter_high_priority(); + ir_timer_start(timer); co_solve_heuristic_new(co); - lc_timer_stop(timer); - rt = lc_timer_leave_high_priority(); + ir_timer_stop(timer); + rt = ir_timer_leave_high_priority(); co_free_graph_structure(co); co_free_ou_structure(co); @@ -587,7 +573,7 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) } - elapsed_usec = lc_timer_elapsed_usec(timer); + elapsed_usec = ir_timer_elapsed_usec(timer); /* calculating average */ elapsed_usec = elapsed_usec / tests; @@ -599,7 +585,6 @@ void be_ifg_check_performance(be_chordal_env_t *chordal_env) } 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) @@ -651,57 +636,180 @@ void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump bitset_free(nodes); } -static void int_comp_rec(const be_chordal_env_t *cenv, ir_node *n, bitset_t *seen) +static void int_comp_rec(be_ifg_t *ifg, ir_node *n, bitset_t *seen) { - void *neigh_it = be_ifg_neighbours_iter_alloca(cenv->ifg); + void *neigh_it = be_ifg_neighbours_iter_alloca(ifg); ir_node *m; - be_ifg_foreach_neighbour(cenv->ifg, neigh_it, n, m) { - if(!bitset_contains_irn(seen, m) && !arch_irn_is(cenv->birg->main_env->arch_env, m, ignore)) { - bitset_add_irn(seen, m); - int_comp_rec(cenv, m, seen); - } + be_ifg_foreach_neighbour(ifg, neigh_it, n, m) { + if (bitset_contains_irn(seen, m)) + continue; + + if (arch_get_register_req_out(m)->type & arch_register_req_type_ignore) + continue; + + bitset_add_irn(seen, m); + int_comp_rec(ifg, m, seen); } } -static int int_component_stat(const be_chordal_env_t *cenv) +static int int_component_stat(be_irg_t *birg, be_ifg_t *ifg) { - int n_comp = 0; - void *nodes_it = be_ifg_nodes_iter_alloca(cenv->ifg); - bitset_t *seen = bitset_irg_malloc(cenv->irg); + int n_comp = 0; + void *nodes_it = be_ifg_nodes_iter_alloca(ifg); + bitset_t *seen = bitset_irg_malloc(birg->irg); ir_node *n; - be_ifg_foreach_node(cenv->ifg, nodes_it, n) { - if(!bitset_contains_irn(seen, n) && !arch_irn_is(cenv->birg->main_env->arch_env, n, ignore)) { - ++n_comp; - bitset_add_irn(seen, n); - int_comp_rec(cenv, n, seen); - } + be_ifg_foreach_node(ifg, nodes_it, n) { + if (bitset_contains_irn(seen, n)) + continue; + + if (arch_get_register_req_out(n)->type & arch_register_req_type_ignore) + continue; + + ++n_comp; + bitset_add_irn(seen, n); + int_comp_rec(ifg, n, seen); } free(seen); return n_comp; } -void be_ifg_stat(const be_chordal_env_t *cenv, be_ifg_stat_t *stat) +void be_ifg_stat(be_irg_t *birg, be_ifg_t *ifg, be_ifg_stat_t *stat) { - void *nodes_it = be_ifg_nodes_iter_alloca(cenv->ifg); - void *neigh_it = be_ifg_neighbours_iter_alloca(cenv->ifg); - bitset_t *nodes = bitset_irg_malloc(cenv->irg); - - ir_node *n, *m; + void *nodes_it = be_ifg_nodes_iter_alloca(ifg); + void *neigh_it = be_ifg_neighbours_iter_alloca(ifg); + bitset_t *nodes = bitset_irg_malloc(birg->irg); + ir_node *n, *m; memset(stat, 0, sizeof(stat[0])); - be_ifg_foreach_node(cenv->ifg, nodes_it, n) { + + be_ifg_foreach_node(ifg, nodes_it, n) { stat->n_nodes += 1; - be_ifg_foreach_neighbour(cenv->ifg, neigh_it, n, m) { + be_ifg_foreach_neighbour(ifg, neigh_it, n, m) { bitset_add_irn(nodes, n); stat->n_edges += !bitset_contains_irn(nodes, m); } } - stat->n_comps = int_component_stat(cenv); + stat->n_comps = int_component_stat(birg, ifg); bitset_free(nodes); } + +enum { + BE_IFG_STD = 1, + BE_IFG_FAST = 2, + BE_IFG_CLIQUE = 3, + BE_IFG_POINTER = 4, + BE_IFG_LIST = 5, + BE_IFG_CHECK = 6 +}; + +static int ifg_flavor = BE_IFG_STD; + +static const lc_opt_enum_int_items_t ifg_flavor_items[] = { + { "std", BE_IFG_STD }, + { "fast", BE_IFG_FAST }, + { "clique", BE_IFG_CLIQUE }, + { "pointer", BE_IFG_POINTER }, + { "list", BE_IFG_LIST }, + { "check", BE_IFG_CHECK }, + { NULL, 0 } +}; + +static lc_opt_enum_int_var_t ifg_flavor_var = { + &ifg_flavor, ifg_flavor_items +}; + +static const lc_opt_table_entry_t be_ifg_options[] = { + LC_OPT_ENT_ENUM_PTR ("ifg", "interference graph flavour", &ifg_flavor_var), + LC_OPT_LAST +}; + +void be_init_ifg(void) +{ + lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be"); + lc_opt_entry_t *ifg_grp = lc_opt_get_grp(be_grp, "ifg"); + + lc_opt_add_table(ifg_grp, be_ifg_options); +} + +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_ifg); + +static FILE *be_ifg_open(const be_chordal_env_t *env, const char *prefix) +{ + FILE *result; + char buf[1024]; + + ir_snprintf(buf, sizeof(buf), "%s%F_%s.log", prefix, env->irg, env->cls->name); + result = fopen(buf, "wt"); + if(result == NULL) { + panic("Couldn't open '%s' for writing.", buf); + } + + return result; +} + +static void check_ifg_implementations(const be_chordal_env_t *chordal_env) +{ + be_ifg_t *ifg; + FILE *f; + + f = be_ifg_open(chordal_env, "std"); + ifg = be_ifg_std_new(chordal_env); + be_ifg_check_sorted_to_file(ifg, f); + fclose(f); + be_ifg_free(ifg); + + f = be_ifg_open(chordal_env, "list"); + ifg = be_ifg_list_new(chordal_env); + be_ifg_check_sorted_to_file(ifg, f); + fclose(f); + be_ifg_free(ifg); + + f = be_ifg_open(chordal_env, "clique"); + ifg = be_ifg_clique_new(chordal_env); + be_ifg_check_sorted_to_file(ifg, f); + fclose(f); + be_ifg_free(ifg); + + f = be_ifg_open(chordal_env, "pointer"); + ifg = be_ifg_pointer_new(chordal_env); + be_ifg_check_sorted_to_file(ifg, f); + fclose(f); + be_ifg_free(ifg); +}; + +be_ifg_t *be_create_ifg(const be_chordal_env_t *chordal_env) +{ + be_ifg_t *ifg = NULL; + + switch (ifg_flavor) { + default: + assert(0); + fprintf(stderr, "no valid ifg flavour selected. falling back to std\n"); + case BE_IFG_STD: + case BE_IFG_FAST: + ifg = be_ifg_std_new(chordal_env); + break; + case BE_IFG_CLIQUE: + ifg = be_ifg_clique_new(chordal_env); + break; + case BE_IFG_POINTER: + ifg = be_ifg_pointer_new(chordal_env); + break; + case BE_IFG_LIST: + ifg = be_ifg_list_new(chordal_env); + break; + case BE_IFG_CHECK: + check_ifg_implementations(chordal_env); + /* Build the interference graph. */ + ifg = be_ifg_std_new(chordal_env); + break; + } + + return ifg; +}