X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_t.h;h=62d8ff60d5ec18383a693f72a5c204a21a806723;hb=29087feac9466883c278e53eec325d5e3099df1d;hp=bddf79f7497cbc9c22630285e8fd26ac42974932;hpb=87965f5c94d561cb15233b80711123f6edc80b30;p=libfirm diff --git a/ir/be/bechordal_t.h b/ir/be/bechordal_t.h index bddf79f74..62d8ff60d 100644 --- a/ir/be/bechordal_t.h +++ b/ir/be/bechordal_t.h @@ -1,85 +1,77 @@ +/* + * 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. + */ /** - * 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 */ - -#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.h" #include "bechordal.h" -#include "belive.h" -#include "beirg.h" - -typedef struct _be_ra_chordal_opts_t be_ra_chordal_opts_t; - -/** Defines an invalid register index. */ -#define NO_COLOR (-1) +#include "beifg.h" /** * A liveness interval border. */ -typedef struct _border_t { +struct border_t { DEBUG_ONLY(unsigned magic;) /**< A magic number for checking. */ - struct list_head list; /**< list head for queuing. */ - struct _border_t *other_end; /**< The other end of the border. */ - 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_real : 1; /**< Is the def/use real? Or is it just inserted - at block beginnings or ends to ensure that inside - a block, each value has one begin and one end. */ -} border_t; + struct list_head list; /**< list head for queuing. */ + border_t *other_end; /**< The other end of the border. */ + 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_real : 1; /**< Is the def/use real? Or is it just + inserted at block beginnings or ends + to ensure that inside a block, each + value has one begin and one end. */ +}; /** * Environment for each of the chordal register allocator phases */ -struct _be_chordal_env_t { - struct obstack obst; /**< An obstack for temporary storage. */ +struct be_chordal_env_t { + struct obstack obst; /**< An obstack for temporary storage. */ be_ra_chordal_opts_t *opts; /**< A pointer to the chordal ra options. */ - be_irg_t *birg; /**< Back-end IRG session. */ - ir_graph *irg; /**< The graph under examination. */ + ir_graph *irg; /**< The graph under examination. */ const arch_register_class_t *cls; /**< The current register class. */ - pmap *border_heads; /**< Maps blocks to border heads. */ - be_ifg_t *ifg; /**< The interference graph. */ - bitset_t *ignore_colors; /**< A set of colors which shall be ignored in register allocation. */ - DEBUG_ONLY(firm_dbg_module_t *dbg;) /**< Debug module for the chordal register allocator. */ + pmap *border_heads; /**< Maps blocks to border heads. */ + be_ifg_t *ifg; /**< The interference graph. */ + bitset_t *allocatable_regs; /**< set of allocatable registers */ }; -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); +static inline struct list_head *get_block_border_head(be_chordal_env_t const *const inf, ir_node *const bl) +{ + return pmap_get(list_head, inf->border_heads, bl); } -#define get_block_border_head(info, bl) _get_block_border_head(info, bl) - -#define foreach_border_head(head, pos) list_for_each_entry_reverse(border_t, pos, head, list) -#define border_next(b) (list_entry((b)->list.next, border_t, list)) -#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) - -void be_ra_chordal_color(be_chordal_env_t *chordal_env); +#define foreach_border_head(head, pos) list_for_each_entry_reverse(border_t, pos, head, list) enum { /* Dump flags */ @@ -93,7 +85,8 @@ enum { BE_CH_DUMP_CONSTR = (1 << 7), BE_CH_DUMP_SPILLSLOTS = (1 << 8), BE_CH_DUMP_LOWER = (1 << 9), - BE_CH_DUMP_APPEL = (1 << 10), + BE_CH_DUMP_SPLIT = (1 << 10), + BE_CH_DUMP_APPEL = (1 << 11), BE_CH_DUMP_ALL = 2 * BE_CH_DUMP_APPEL - 1, /* lower perm options */ @@ -106,15 +99,12 @@ enum { BE_CH_VRFY_ASSERT = 3, }; -struct _be_ra_chordal_opts_t { - int dump_flags; - int lower_perm_opt; - int vrfy_option; - - char ilp_server[128]; - char ilp_solver[128]; +struct be_ra_chordal_opts_t { + unsigned dump_flags; + int lower_perm_opt; + int vrfy_option; }; -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 */