X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive_t.h;h=1ebfd04f646daf39f04c19a62ec2faa2f22dac6f;hb=dfc8071b06fbef877b269aac45b08de8dc5409c5;hp=61ce41236a65e1a7a68f48f98182da7b5ddd15b9;hpb=afd4d9d4b9cc42d04f8d3b8bb79bb0673a05c51e;p=libfirm diff --git a/ir/be/belive_t.h b/ir/be/belive_t.h index 61ce41236..1ebfd04f6 100644 --- a/ir/be/belive_t.h +++ b/ir/be/belive_t.h @@ -1,103 +1,138 @@ -/** - * Internal headers for liveness analysis. - * @author Sebastian Hack - * @date 6.12.2004 +/* + * 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. */ -#ifndef _BELIVE_T_H -#define _BELIVE_T_H +/** + * @file + * @brief Internal headers for liveness analysis. + * @author Sebastian Hack + * @date 06.12.2004 + */ +#ifndef FIRM_BE_BELIVE_T_H +#define FIRM_BE_BELIVE_T_H -#include "config.h" +#include +#include "be_types.h" +#include "irgraph_t.h" +#include "irnodehashmap.h" +#include "irhooks.h" +#include "irlivechk.h" +#include "statev_t.h" -#include "belive.h" #include "pset.h" +#include "bitset.h" -typedef struct _block_live_info_t { - pset *in; /**< The set of all values live in at that block. */ - pset *out; /**< The set of all values live out. */ - pset *end; /**< The set of all values live at the end - of the block (contains all live out). */ -} block_live_info_t; - -typedef struct _node_live_info_t { - int is_phi_op; /**< Marks the node as a phi operand. */ -} node_live_info_t; - -typedef struct _live_info_t { - union { - block_live_info_t block; - node_live_info_t node; - } v; -} live_info_t; - -extern size_t live_irn_data_offset; - -#define get_irn_live_info(irn) get_irn_data(irn, live_info_t, live_irn_data_offset) -#define get_live_info_irn(inf) get_irn_data_base(inf, live_irn_data_offset) - -#define get_block_live_info(irn) (&(get_irn_live_info(irn)->v.block)) -#define get_node_live_info(irn) (&(get_irn_live_info(irn)->v.node)) +#include "belive.h" -static INLINE int __is_phi_operand(const ir_node *irn) +struct be_lv_t { + ir_nodehashmap_t map; + struct obstack obst; + bool sets_valid; + ir_graph *irg; + hook_entry_t hook_info; + lv_chk_t *lvc; +}; + +typedef struct be_lv_info_node_t be_lv_info_node_t; +struct be_lv_info_node_t { + unsigned idx; + unsigned flags; +}; + +struct be_lv_info_head_t { + unsigned n_members; + unsigned n_size; +}; + +union be_lv_info_t { + struct be_lv_info_head_t head; + struct be_lv_info_node_t node; +}; + +be_lv_info_node_t *be_lv_get(const be_lv_t *li, const ir_node *block, + const ir_node *irn); + +static inline unsigned _be_is_live_xxx(const be_lv_t *li, const ir_node *block, + const ir_node *irn, unsigned flags) { - assert(!is_Block(irn) && "No block node allowed here"); - return get_node_live_info(irn)->is_phi_op; -} + unsigned res; -static INLINE int __is_live_in(const ir_node *block, const ir_node *irn) -{ - block_live_info_t *info = get_block_live_info(block); + if (li->sets_valid) { + be_lv_info_node_t *info = be_lv_get(li, block, irn); + res = info != NULL ? (info->flags & flags) != 0 : 0; + } else { + res = (lv_chk_bl_xxx(li->lvc, block, irn) & flags) != 0; + } - assert(is_Block(block) && "Need a block here"); - return pset_find_ptr(info->in, irn) != NULL; + return res; } -static INLINE int __is_live_out(const ir_node *block, const ir_node *irn) +typedef struct lv_iterator_t { - block_live_info_t *info = get_block_live_info(block); - - assert(is_Block(block) && "Need a block here"); - return pset_find_ptr(info->out, irn) != NULL; -} - -static INLINE int __is_live_end(const ir_node *block, const ir_node *irn) + be_lv_info_t *info; + ir_graph *irg; + be_lv_state_t flags; + size_t i; +} lv_iterator_t; + +static inline lv_iterator_t be_lv_iteration_begin(const be_lv_t *lv, + const ir_node *block, be_lv_state_t flags) { - block_live_info_t *info = get_block_live_info(block); - - assert(is_Block(block) && "Need a block here"); - return pset_find_ptr(info->end, irn) != NULL; + lv_iterator_t res; + res.info = ir_nodehashmap_get(be_lv_info_t, &lv->map, block); + res.irg = get_Block_irg(block); + res.flags = flags; + res.i = res.info != NULL ? res.info[0].head.n_members : 0; + return res; } -static INLINE pset *__get_live_in(const ir_node *block) +static inline ir_node *be_lv_iteration_next(lv_iterator_t *iterator) { - assert(is_Block(block) && "Need a block here"); - return get_block_live_info(block)->in; + while (iterator->i != 0) { + const be_lv_info_t *info = iterator->info + iterator->i--; + if (info->node.flags & iterator->flags) + return get_idx_irn(iterator->irg, info->node.idx); + } + return NULL; } -static INLINE pset *__get_live_out(const ir_node *block) -{ - assert(is_Block(block) && "Need a block here"); - return get_block_live_info(block)->out; -} +#define be_lv_foreach(lv, block, flags, node) \ + for (bool once = true; once;) \ + for (lv_iterator_t iter = be_lv_iteration_begin((lv), (block), (flags)); once; once = false) \ + for (ir_node *node; (node = be_lv_iteration_next(&iter)) != NULL;) -static INLINE pset *__get_live_end(const ir_node *block) +static inline pset *_be_lv_pset_put(const be_lv_t *lv, const ir_node *block, + int state, pset *s) { - assert(is_Block(block) && "Need a block here"); - return get_block_live_info(block)->end; + be_lv_foreach(lv, block, state, node) + pset_insert_ptr(s, node); + return s; } -#define is_phi_operand(irn) __is_phi_operand(irn) -#define is_live_in(bl,irn) __is_live_in(bl, irn) -#define is_live_out(bl,irn) __is_live_out(bl, irn) -#define is_live_end(bl,irn) __is_live_end(bl, irn) -#define get_live_in(bl) __get_live_in(bl) -#define get_live_out(bl) __get_live_out(bl) -#define get_live_end(bl) __get_live_end(bl) +#define be_lv_get_irn(lv, bl, i) _be_lv_get_irn(lv, bl, i) +#define be_lv_pset_put_in(lv, bl, s) _be_lv_pset_put(lv, bl, be_lv_state_in, s) +#define be_lv_pset_put_out(lv, bl, s) _be_lv_pset_put(lv, bl, be_lv_state_out, s) +#define be_lv_pset_put_end(lv, bl, s) _be_lv_pset_put(lv, bl, be_lv_state_end, s) -/** - * Initialize the liveness module. - * To be called from be_init(). - */ -void be_liveness_init(void); +#define be_is_live_in(lv, bl, irn) _be_is_live_xxx(lv, bl, irn, be_lv_state_in) +#define be_is_live_end(lv, bl, irn) _be_is_live_xxx(lv, bl, irn, be_lv_state_end) +#define be_is_live_out(lv, bl, irn) _be_is_live_xxx(lv, bl, irn, be_lv_state_out) + +#define be_lv_has_info_about(lv, irn) bitset_is_set((lv)->nodes, get_irn_idx(irn)) #endif