X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive_t.h;h=6d79f0124cc90e6c7b70827096f05dc2c1d4c1bb;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=57bcc837d62f74696bf51cafbcf15544c95799c3;hpb=d26125ca5720072a4975d37c0a17f7ad6c18de2d;p=libfirm diff --git a/ir/be/belive_t.h b/ir/be/belive_t.h index 57bcc837d..6d79f0124 100644 --- a/ir/be/belive_t.h +++ b/ir/be/belive_t.h @@ -1,62 +1,134 @@ -/** - * 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.h" #include "pset.h" +#include "bitset.h" + +#include "belive.h" + +struct be_lv_t { + ir_nodehashmap_t map; + struct obstack obst; + bool sets_valid; + ir_graph *irg; + bitset_t *nodes; + 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; +}; + +static inline int _be_lv_next_irn(const be_lv_t *lv, const ir_node *block, + unsigned flags, int i) +{ + be_lv_info_t *arr = (be_lv_info_t*)ir_nodehashmap_get(&lv->map, block); + if (arr != NULL) { + int n_members = (int) arr[0].head.n_members; + while(i < n_members) { + if(arr[i + 1].node.flags & flags) { + return i; + } + ++i; + } + } + + return -1; +} -typedef struct _block_live_info_t { - pset *in; - pset *out; -} block_live_info_t; - -typedef struct _node_live_info_t { - unsigned last_use_in_block : 1; -} node_live_info_t; +static inline ir_node *_be_lv_get_irn(const be_lv_t *lv, const ir_node *block, + int i) +{ + be_lv_info_t *arr = (be_lv_info_t*)ir_nodehashmap_get(&lv->map, block); + return get_idx_irn(lv->irg, arr[i + 1].node.idx); +} -typedef struct _live_info_t { - union { - block_live_info_t block; - node_live_info_t node; - } v; -} live_info_t; +be_lv_info_node_t *be_lv_get(const be_lv_t *li, const ir_node *block, + const ir_node *irn); -extern size_t live_irn_data_offset; +static inline unsigned _be_is_live_xxx(const be_lv_t *li, const ir_node *block, + const ir_node *irn, unsigned flags) +{ + unsigned res; -#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) + 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; + } -#define get_block_live_info(irn) &(get_irn_live_info(irn)->v.block) + return 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); +#define be_lv_foreach(lv, bl, flags, i) \ + for (i = _be_lv_next_irn(lv, bl, flags, 0); i >= 0; i = _be_lv_next_irn(lv, bl, flags, i + 1)) - assert(is_Block(block) && "Need a block here"); - return pset_find_ptr(info->in, irn) != NULL; -} -static INLINE int _is_live_out(const ir_node *block, const ir_node *irn) +static inline pset *_be_lv_pset_put(const be_lv_t *lv, const ir_node *block, + int state, pset *s) { - 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; + int i; + be_lv_foreach(lv, block, state, i) + pset_insert_ptr(s, _be_lv_get_irn(lv, block, i)); + return s; } -#define is_live_in(block,irn) _is_live_in(block, irn) -#define is_live_out(block,irn) _is_live_out(block, irn) +#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