X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbera.h;h=fcab788da823ee204cafeb9257ae9f87b265947b;hb=2bc25d820b8f3f04feb5693e73bf5d446cdbcb50;hp=2f1bc2e0e900f87f6f37ae6cf637c2dffc74c72f;hpb=87965f5c94d561cb15233b80711123f6edc80b30;p=libfirm diff --git a/ir/be/bera.h b/ir/be/bera.h index 2f1bc2e0e..fcab788da 100644 --- a/ir/be/bera.h +++ b/ir/be/bera.h @@ -1,22 +1,38 @@ -/** - * Register allocation functions. - * @author Sebastian Hack - * @date 13.1.2005 +/* + * Copyright (C) 1995-2007 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. */ -#ifndef _BERA_H -#define _BERA_H - -#include "firm_config.h" +/** + * @file + * @brief Base routines for register allocation. + * @author Sebastian Hack + * @date 13.01.2005 + * @version $Id$ + */ +#ifndef FIRM_BE_BERA_H +#define FIRM_BE_BERA_H #include -#include "firm_types.h" +#include "irnode.h" -#include "be.h" #include "belive.h" #include "beirg.h" -#include "bemodule.h" typedef struct { lc_timer_t *t_prolog; /**< timer for prolog */ @@ -45,29 +61,6 @@ void be_register_allocator(const char *name, be_ra_t *allocator); */ void be_allocate_registers(be_irg_t *birg); -/** - * Check, if two values interfere. - * @param lv Liveness information. - * @param a The first value. - * @param b The second value. - * @return 1, if @p a and @p b interfere, 0 if not. - */ -int values_interfere(const be_lv_t *lv, const ir_node *a, const ir_node *b); - -/** - * Check, if a value dominates the other one. - * Note, that this function also considers the schedule and does thus - * more than block_dominates(). - * - * @param a The first. - * @param b The second value. - * @return 1 if a dominates b, 0 else. - */ -int value_dominates(const ir_node *a, const ir_node *b); - -/** - * Like value_dominates(), but the nodes have to be in the same block - */ -int value_dominates_intrablock(const ir_node *a, const ir_node *b); +int (values_interfere)(const be_irg_t *birg, const ir_node *a, const ir_node *b); -#endif /* _BERA_H */ +#endif /* FIRM_BE_BERA_H */