X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbera.c;h=a7584a52c30b451d36ca99f22982fb9aaa8ce411;hb=1209ae49db1b42e9d39269eb3a86b187f0c263d9;hp=90ea5c9e2d5127b76b1e71dcfd38718db8083ae6;hpb=5c4c889a99e6bd23a35e108b4b4e9a6cbd9e695b;p=libfirm diff --git a/ir/be/bera.c b/ir/be/bera.c index 90ea5c9e2..a7584a52c 100644 --- a/ir/be/bera.c +++ b/ir/be/bera.c @@ -1,97 +1,70 @@ +/* + * 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. + */ + /** - * Base routines for register allocation. - * @author Sebastian Hack - * @date 22.11.2004 + * @file + * @brief Base routines for register allocation. + * @author Sebastian Hack + * @date 22.11.2004 */ -#ifdef HAVE_CONFIG_H #include "config.h" -#endif + +#include #include "pset.h" -#include "impl.h" #include "irnode.h" #include "irmode.h" #include "irdom.h" +#include "iredges.h" +#include "irtools.h" +#include "bera.h" #include "beutil.h" -#include "besched_t.h" +#include "besched.h" #include "belive_t.h" +#include "bemodule.h" -int value_dominates(const ir_node *a, const ir_node *b) -{ - int res = 0; - const ir_node *ba = get_block(a); - const ir_node *bb = get_block(b); +/** The list of register allocators */ +static be_module_list_entry_t *register_allocators = NULL; +static be_ra_t *selected_allocator = NULL; - /* - * a and b are not in the same block, - * so dominance is determined by the dominance of the blocks. - */ - if(ba != bb) - res = block_dominates(ba, bb); - - /* - * Dominance is determined by the time steps of the schedule. - */ - else { - sched_timestep_t as = sched_get_time_step(a); - sched_timestep_t bs = sched_get_time_step(b); - res = as <= bs; - } - - return res; +void be_register_allocator(const char *name, be_ra_t *allocator) +{ + if (selected_allocator == NULL) + selected_allocator = allocator; + be_add_module_to_list(®ister_allocators, name, allocator); } -/** - * Check, if two values interfere. - * @param a The first value. - * @param b The second value. - * @return 1, if a and b interfere, 0 if not. - */ -int values_interfere(const ir_node *a, const ir_node *b) +void be_allocate_registers(ir_graph *irg) { - int a2b = value_dominates(a, b); - int b2a = value_dominates(b, a); - - /* If there is no dominance relation, they do not interfere. */ - if(a2b + b2a > 0) { - const ir_edge_t *edge; - ir_node *bb = get_nodes_block(b); - - /* - * Adjust a and b so, that a dominates b if - * a dominates b or vice versa. - */ - if(b2a) { - const ir_node *t = a; - a = b; - b = t; - } + assert(selected_allocator != NULL); + if (selected_allocator != NULL) { + selected_allocator->allocate(irg); + } +} - /* - * If a is live end in b's block it is - * live at b's definition (a dominates b) - */ - if(is_live_end(bb, a)) - return 1; +BE_REGISTER_MODULE_CONSTRUCTOR(be_init_ra) +void be_init_ra(void) +{ + lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be"); - /* - * Look at all usages of a. - * If there's one usage of a in the block of b, then - * we check, if this use is dominated by b, if that's true - * a and b interfere. - * Uses of a not in b's block can be disobeyed, because the - * check for a being live at the end of b's block is already - * performed. - */ - foreach_out_edge(a, edge) { - const ir_node *user = edge->src; - if(get_nodes_block(user) == bb - && !is_Phi(user) - && value_dominates(b, user)) - return 1; - } - } - return 0; + be_add_module_list_opt(be_grp, "regalloc", "register allocator", + ®ister_allocators, (void**) &selected_allocator); }