X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive_t.h;h=ba6dc316d008a42220577e75f55ae24dcf98716e;hb=70481aa342e22f5f285dc863b366a56393d888af;hp=6675f3c70c063a7060c8ecfb95cfe38a98919558;hpb=c65b13d98017c671496ff61e970790bba264f375;p=libfirm diff --git a/ir/be/belive_t.h b/ir/be/belive_t.h index 6675f3c70..ba6dc316d 100644 --- a/ir/be/belive_t.h +++ b/ir/be/belive_t.h @@ -1,31 +1,61 @@ -/** - * 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 + * @version $Id$ + */ +#ifndef FIRM_BE_BELIVE_T_H +#define FIRM_BE_BELIVE_T_H #include "irgraph_t.h" -#include "iredges_t.h" #include "irphase_t.h" #include "irhooks.h" +#include "dfs.h" +#include "statev.h" #include "pset.h" -#include "set.h" -#include "list.h" -#include "hashptr.h" #include "bitset.h" #include "belive.h" +#define USE_LIVE_CHK + +#ifdef USE_LIVE_CHK +#include "irlivechk.h" +#endif + +struct be_irg_t; + struct _be_lv_t { - phase_t ph; + ir_phase ph; ir_graph *irg; + dfs_t *dfs; + const struct be_irg_t *birg; bitset_t *nodes; hook_entry_t hook_info; - DEBUG_ONLY(firm_dbg_module_t *dbg;) +#ifdef USE_LIVE_CHK + lv_chk_t *lvc; +#endif }; struct _be_lv_info_node_t { @@ -47,8 +77,9 @@ struct _be_lv_info_t { static INLINE int _be_lv_next_irn(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i) { - struct _be_lv_info_t *arr = phase_get_irn_data(&lv->ph, bl); - if(arr) { + struct _be_lv_info_t *arr = phase_get_irn_data(&lv->ph, bl); + + if (arr) { int n_members = (int) arr[0].u.head.n_members; while(i < n_members) { @@ -62,9 +93,9 @@ static INLINE int _be_lv_next_irn(const struct _be_lv_t *lv, const ir_node *bl, return -1; } -static INLINE ir_node * _be_lv_get_irn(const struct _be_lv_t *lv, const ir_node *bl, int i) +static INLINE ir_node *_be_lv_get_irn(const struct _be_lv_t *lv, const ir_node *bl, int i) { - struct _be_lv_info_t *arr = phase_get_irn_data(&lv->ph, bl); + struct _be_lv_info_t *arr = phase_get_irn_data(&lv->ph, bl); return get_idx_irn(lv->irg, arr[i + 1].u.node.idx); } @@ -72,12 +103,23 @@ struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *b static INLINE int _be_is_live_xxx(const struct _be_lv_t *li, const ir_node *block, const ir_node *irn, unsigned flags) { - struct _be_lv_info_node_t *info = be_lv_get(li, block, irn); - return info ? (info->flags & flags) != 0 : 0; + int res; + + if (li->nodes) { + struct _be_lv_info_node_t *info = be_lv_get(li, block, irn); + res = info ? (info->flags & flags) != 0 : 0; + } + +#ifdef USE_LIVE_CHK + else + res = (lv_chk_bl_xxx(li->lvc, block, irn) & flags) != 0; +#endif /* USE_LIVE_CHK */ + + return res; } #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)) + for (i = _be_lv_next_irn(lv, bl, flags, 0); i >= 0; i = _be_lv_next_irn(lv, bl, flags, i + 1)) static INLINE pset *_be_lv_pset_put(const struct _be_lv_t *lv, const ir_node *block, int state, pset *s) @@ -99,4 +141,4 @@ static INLINE pset *_be_lv_pset_put(const struct _be_lv_t *lv, const ir_node *bl #define be_lv_has_info_about(lv, irn) bitset_is_set((lv)->nodes, get_irn_idx(irn)) -#endif +#endif /* FIRM_BE_BELIVE_T_H */