X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbechordal_t.h;h=e7cc1df457059aa00ab537e77ee615e54cef7a88;hb=929bd10ba046d7482e572d97ec592a4055c65970;hp=45f27c80f68372d33bc49891a9e62ce15ab51f43;hpb=03ffa62ef4f525aa0c45dbe766a17bc94b161695;p=libfirm diff --git a/ir/be/bechordal_t.h b/ir/be/bechordal_t.h index 45f27c80f..e7cc1df45 100644 --- a/ir/be/bechordal_t.h +++ b/ir/be/bechordal_t.h @@ -1,104 +1,110 @@ +/* + * 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 datastructures 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 FIRM_BE_BECHORDAL_T_H +#define FIRM_BE_BECHORDAL_T_H -#ifndef _BECHORDAL_T_H -#define _BECHORDAL_T_H - -#include - -#include "bitset.h" +#include "firm_types.h" #include "list.h" -#include "obst.h" -#include "pset.h" #include "pmap.h" -#include "set.h" +#include "bitset.h" +#include "obst.h" +#include "debug.h" -#include "irnode.h" -#include "irgraph.h" #include "bechordal.h" - -/** Defines an invalid register index. */ -#define NO_COLOR (-1) - -#define BUILD_GRAPH - -#define DBG_CHORDAL "firm.be.ra.chordal" +#include "beifg.h" /** * A liveness interval border. */ -typedef struct _border_t { -#ifdef DEBUG_libfirm - unsigned magic; /**< A magic number for checking. */ -#endif - 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 border_t { + DEBUG_ONLY(unsigned magic;) /**< A magic number for checking. */ + 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. */ - pmap *border_heads; /**< Maps blocks to border heads. */ - ir_graph *irg; /**< The graph the reg alloc is running on. */ - -#ifdef BUILD_GRAPH - set *nodes; /**< The interference graph nodes. */ - set *edges; /**< The interference graph edges. */ -#endif - - bitset_t *live; /**< A liveness bitset. */ - bitset_t *colors; /**< The color mask. */ - bitset_t *in_colors; /**< Colors used by live in values. */ - int colors_n; /**< The number of colors. */ - const arch_env_t *arch_env; /**< The arch interface environment. */ - const arch_register_class_t *cls; /**< The current register class. */ - void *data; /**< Some pointer, to which different - phases can attach data to. */ +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. */ + 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 *allocatable_regs; /**< set of allocatable registers */ }; -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(be_chordal_env_t const *const inf, ir_node *const bl) { - return pmap_get(inf->border_heads, bl); + return pmap_get(list_head, inf->border_heads, bl); } -#define get_block_border_head(info, bl) _get_block_border_head(info, bl) - -int nodes_interfere(const be_chordal_env_t *env, const ir_node *a, const ir_node *b); - -#ifdef BUILD_GRAPH -typedef struct _if_node_t { - int nnr; - pset *neighb; -} if_node_t; - -typedef struct _if_edge_t { - int src, tgt; -} if_edge_t; - -set *be_ra_get_ifg_edges(const be_chordal_env_t *env); -set *be_ra_get_ifg_nodes(const be_chordal_env_t *env); -int ifg_has_edge(const be_chordal_env_t *env, const if_node_t *n1, const if_node_t* n2); +#define foreach_border_head(head, pos) list_for_each_entry_reverse(border_t, pos, head, list) + +enum { + /* Dump flags */ + BE_CH_DUMP_NONE = (1 << 0), + BE_CH_DUMP_SPILL = (1 << 1), + BE_CH_DUMP_LIVE = (1 << 2), + BE_CH_DUMP_COLOR = (1 << 3), + BE_CH_DUMP_COPYMIN = (1 << 4), + BE_CH_DUMP_SSADESTR = (1 << 5), + BE_CH_DUMP_TREE_INTV = (1 << 6), + BE_CH_DUMP_CONSTR = (1 << 7), + BE_CH_DUMP_SPILLSLOTS = (1 << 8), + BE_CH_DUMP_LOWER = (1 << 9), + 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 */ + BE_CH_LOWER_PERM_SWAP = 1, + BE_CH_LOWER_PERM_COPY = 2, + + /* verify options */ + BE_CH_VRFY_OFF = 1, + BE_CH_VRFY_WARN = 2, + BE_CH_VRFY_ASSERT = 3, +}; -#define ifn_get_degree(ifnode) pset_count(ifnode->neighb) -#define foreach_neighb(ifnode, curr) \ - for(curr=pset_first(ifnode->neighb); curr; curr=pset_next(ifnode->neighb)) -#endif +struct be_ra_chordal_opts_t { + unsigned dump_flags; + int lower_perm_opt; + int vrfy_option; +}; -extern void be_ra_chordal_spill(be_chordal_env_t *env); +void check_for_memory_operands(ir_graph *irg); -#endif /* _BECHORDAL_T_H */ +#endif /* FIRM_BE_BECHORDAL_T_H */