X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyheur3.c;h=18cae3964d163c6c11473eb5199725394f3b11df;hb=3f807bf48426a29da4129ff29c44a4b4690c45f6;hp=d22a6f4b7970ae93ebd21ed4f4803433f7cd501c;hpb=8535fe8732b0acf822be252812a7158ce5b8134a;p=libfirm diff --git a/ir/be/becopyheur3.c b/ir/be/becopyheur3.c index d22a6f4b7..18cae3964 100644 --- a/ir/be/becopyheur3.c +++ b/ir/be/becopyheur3.c @@ -1,14 +1,37 @@ +/* + * 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. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. + */ + /** - * More experiments on coalescing. - * @author Sebastian Hack - * @date 25.07.2006 + * @file + * @brief More experiments on coalescing with Java implementation. + * @author Sebastian Hack + * @date 25.07.2006 + * @version $Id$ */ #ifdef HAVE_CONFIG_H -#include +#include "config.h" #endif -#include -#include +#ifdef WITH_JVM + +#include "lc_opts.h" +#include "lc_opts_enum.h" #include #include @@ -22,7 +45,6 @@ #include "bitset.h" #include "raw_bitset.h" -#include "irphase_t.h" #include "irgraph_t.h" #include "irnode_t.h" #include "irprintf.h" @@ -60,7 +82,7 @@ static lc_opt_enum_mask_var_t dump_var = { static const lc_opt_table_entry_t options[] = { LC_OPT_ENT_ENUM_MASK("dump", "dump ifg cloud", &dump_var), LC_OPT_ENT_INT ("dbg", "debug level for the Java coalescer", &dbg_level), - { NULL } + LC_OPT_LAST }; void be_init_copyheur3(void) @@ -128,8 +150,8 @@ int co_solve_heuristic_java(copy_opt_t *co) } } - node_map = malloc((get_irg_last_idx(co->irg) + 1) * sizeof(node_map[0])); - inv_node_map = malloc((get_irg_last_idx(co->irg) + 1) * sizeof(inv_node_map[0])); + node_map = xmalloc((get_irg_last_idx(co->irg) + 1) * sizeof(node_map[0])); + inv_node_map = xmalloc((get_irg_last_idx(co->irg) + 1) * sizeof(inv_node_map[0])); curr_idx = 0; be_ifg_foreach_node(ifg, nodes_it, n) { @@ -217,3 +239,5 @@ int co_solve_heuristic_java(copy_opt_t *co) bitset_free(nodes); return 0; } + +#endif