X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_t.h;h=90e4eff0886ea9f67f3b1e111a131b722aabc09c;hb=39cb52264857d7c21c7141ba82bb55adaa78064d;hp=a696031ca481c90dd81c9e871f696bc240945bde;hpb=4d5c3365a58cba59993045a9e08e686d8ae079a7;p=libfirm diff --git a/ir/be/bechordal_t.h b/ir/be/bechordal_t.h index a696031ca..90e4eff08 100644 --- a/ir/be/bechordal_t.h +++ b/ir/be/bechordal_t.h @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -17,40 +17,26 @@ * PURPOSE. */ - /** - * Internal data structures for the chordal register allocator. - * @author Sebastian Hack - * @date 25.1.2005 + * @file + * @brief Internal data structures for the chordal register allocator. + * @author Sebastian Hack + * @date 25.01.2005 + * @version $Id$ */ - -#ifndef _BECHORDAL_T_H -#define _BECHORDAL_T_H +#ifndef FIRM_BE_BECHORDAL_T_H +#define FIRM_BE_BECHORDAL_T_H #include "firm_types.h" -#include "firm_config.h" - -#include - -#include "bitset.h" #include "list.h" -#include "obst.h" -#include "pset.h" #include "pmap.h" -#include "set.h" - -#include "execfreq.h" +#include "bitset.h" +#include "obst.h" +#include "debug.h" -#include "be_t.h" -#include "beifg.h" -#include "bera.h" -#include "bearch_t.h" #include "bechordal.h" -#include "belive.h" -#include "beirg_t.h" - -typedef struct be_ra_chordal_opts_t be_ra_chordal_opts_t; -typedef struct border_t border_t; +#include "beirg.h" +#include "beifg.h" /** Defines an invalid register index. */ #define NO_COLOR (-1) @@ -65,7 +51,7 @@ struct border_t { ir_node *irn; /**< The node. */ unsigned step; /**< The number equal to the interval border. */ unsigned pressure; /**< The pressure at this interval border. (The border itself is counting). */ - unsigned is_def : 1; /**< Does this border denote a use or a def. */ + unsigned is_def : 1; /**< Does this border denote a use or a def. */ unsigned is_real : 1; /**< Is the def/use real? Or is it just inserted at block beginnings or ends to ensure that inside a block, each @@ -86,7 +72,7 @@ struct be_chordal_env_t { bitset_t *ignore_colors;/**< A set of colors which shall be ignored in register allocation. */ }; -static INLINE struct list_head *_get_block_border_head(const be_chordal_env_t *inf, ir_node *bl) { +static inline struct list_head *_get_block_border_head(const be_chordal_env_t *inf, ir_node *bl) { return pmap_get(inf->border_heads, bl); } @@ -97,7 +83,7 @@ static INLINE struct list_head *_get_block_border_head(const be_chordal_env_t *i #define border_prev(b) (list_entry((b)->list.prev, border_t, list)) #define chordal_has_class(chordal_env, irn) \ - arch_irn_consider_in_reg_alloc(chordal_env->birg->main_env->arch_env, chordal_env->cls, irn) + arch_irn_consider_in_reg_alloc(chordal_env->cls, irn) void be_ra_chordal_color(be_chordal_env_t *chordal_env); @@ -135,6 +121,6 @@ struct be_ra_chordal_opts_t { char ilp_solver[128]; }; -void be_pre_spill_prepare_constr(be_chordal_env_t *cenv); +void check_for_memory_operands(ir_graph *irg); -#endif /* _BECHORDAL_T_H */ +#endif /* FIRM_BE_BECHORDAL_T_H */