+/*
+ * Copyright (C) 1995-2007 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 headers for liveness analysis.
- * @author Sebastian Hack
- * @date 6.12.2004
+ * @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
-#ifndef _BELIVE_T_H
-#define _BELIVE_T_H
+#include "irgraph_t.h"
+#include "irphase_t.h"
+#include "irhooks.h"
-#include "config.h"
+#include "pset.h"
+#include "bitset.h"
#include "belive.h"
-#include "pset.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. */
-} block_live_info_t;
+#define USE_LIVE_CHK
-typedef struct _node_live_info_t {
- int is_phi_op; /**< Marks the node as a phi operand. */
-} node_live_info_t;
+#ifdef USE_LIVE_CHK
+#include "irlivechk.h"
+#endif
-typedef struct _live_info_t {
- union {
- block_live_info_t block;
- node_live_info_t node;
- } v;
-} live_info_t;
+struct _be_lv_t {
+ ir_phase ph;
+ ir_graph *irg;
+ bitset_t *nodes;
+ hook_entry_t hook_info;
+#ifdef USE_LIVE_CHK
+ lv_chk_t *lvc;
+#endif
+};
-extern size_t live_irn_data_offset;
+struct _be_lv_info_node_t {
+ unsigned idx;
+ unsigned flags;
+};
-#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)
+struct _be_lv_info_head_t {
+ unsigned n_members;
+ unsigned n_size;
+};
-#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))
+struct _be_lv_info_t {
+ union {
+ struct _be_lv_info_head_t head;
+ struct _be_lv_info_node_t node;
+ } u;
+};
-static INLINE int __is_phi_operand(const ir_node *irn)
+static INLINE int _be_lv_next_irn(const struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i)
{
- assert(!is_Block(irn) && "No block node allowed here");
- return get_node_live_info(irn)->is_phi_op;
-}
+ struct _be_lv_info_t *arr = phase_get_irn_data(&lv->ph, bl);
-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 (arr) {
+ int n_members = (int) arr[0].u.head.n_members;
- assert(is_Block(block) && "Need a block here");
- return pset_find_ptr(info->in, irn) != NULL;
+ while(i < n_members) {
+ if(arr[i + 1].u.node.flags & flags) {
+ return i;
+ }
+ ++i;
+ }
+ }
+
+ return -1;
}
-static INLINE int __is_live_out(const ir_node *block, const ir_node *irn)
+static INLINE ir_node *_be_lv_get_irn(const struct _be_lv_t *lv, const ir_node *bl, int i)
{
- 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;
+ 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);
}
-static INLINE pset *__get_live_in(const ir_node *block)
+struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *bl, const ir_node *irn);
+
+static INLINE int _be_is_live_xxx(const struct _be_lv_t *li, const ir_node *block, const ir_node *irn, unsigned flags)
{
- assert(is_Block(block) && "Need a block here");
- return get_block_live_info(block)->in;
+ if (li->nodes) {
+ struct _be_lv_info_node_t *info = be_lv_get(li, block, irn);
+ return info ? (info->flags & flags) != 0 : 0;
+ }
+
+#ifdef USE_LIVE_CHK
+ else
+ return (lv_chk_bl_xxx(li->lvc, block, irn) & flags) != 0;
+#else
+ assert(li->nodes && "node sets must be computed");
+ return 0;
+#endif /* USE_LIVE_CHK */
}
-static INLINE pset *__get_live_out(const ir_node *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))
+
+
+static INLINE pset *_be_lv_pset_put(const struct _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)->out;
+ int i;
+ be_lv_foreach(lv, block, state, i)
+ pset_insert_ptr(s, _be_lv_get_irn(lv, block, i));
+ 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 get_live_in(bl) __get_live_in(bl)
-#define get_live_out(bl) __get_live_out(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)
-#endif
+#define be_lv_has_info_about(lv, irn) bitset_is_set((lv)->nodes, get_irn_idx(irn))
+
+#endif /* FIRM_BE_BELIVE_T_H */
projects / libfirm / blobdiff