-/**
- * 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
-
-#include "config.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 <stdbool.h>
+#include "irnodehashmap.h"
+#include "irhooks.h"
+#include "irlivechk.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. */
- 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))
-
-static INLINE int _is_phi_operand(const ir_node *irn)
+#include "bearch.h"
+
+#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)
+
+struct be_lv_t {
+ ir_nodehashmap_t map;
+ struct obstack obst;
+ bool sets_valid;
+ ir_graph *irg;
+ lv_chk_t *lvc;
+};
+
+typedef struct be_lv_info_node_t be_lv_info_node_t;
+struct be_lv_info_node_t {
+ ir_node *node;
+ 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;
-}
-
-static INLINE int _is_live_in(const ir_node *block, const ir_node *irn)
-{
- block_live_info_t *info = get_block_live_info(block);
-
- assert(is_Block(block) && "Need a block here");
- return pset_find_ptr(info->in, irn) != NULL;
-}
+ unsigned res;
-static INLINE int _is_live_out(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->out, irn) != NULL;
+ return res;
}
-static INLINE int _is_live_end(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->end, irn) != NULL;
-}
+ be_lv_info_t *info;
+ size_t i;
+} lv_iterator_t;
-static INLINE pset *_get_live_in(const ir_node *block)
+static inline lv_iterator_t be_lv_iteration_begin(const be_lv_t *lv,
+ const ir_node *block)
{
- assert(is_Block(block) && "Need a block here");
- return get_block_live_info(block)->in;
+ lv_iterator_t res;
+ res.info = ir_nodehashmap_get(be_lv_info_t, &lv->map, block);
+ res.i = res.info != NULL ? res.info[0].head.n_members : 0;
+ return res;
}
-static INLINE pset *_get_live_out(const ir_node *block)
+static inline ir_node *be_lv_iteration_next(lv_iterator_t *iterator, be_lv_state_t flags)
{
- assert(is_Block(block) && "Need a block here");
- return get_block_live_info(block)->out;
+ while (iterator->i != 0) {
+ const be_lv_info_t *info = iterator->info + iterator->i--;
+ if (info->node.flags & flags)
+ return info->node.node;
+ }
+ return NULL;
}
-static INLINE pset *_get_live_end(const ir_node *block)
+static inline ir_node *be_lv_iteration_cls_next(lv_iterator_t *iterator, be_lv_state_t flags, const arch_register_class_t *cls)
{
- assert(is_Block(block) && "Need a block here");
- return get_block_live_info(block)->end;
+ while (iterator->i != 0) {
+ const be_lv_info_t *info = iterator->info + iterator->i--;
+ if (!(info->node.flags & flags))
+ continue;
+
+ ir_node *node = info->node.node;
+ ir_mode *mode = get_irn_mode(node);
+ if (!mode_is_datab(mode))
+ continue;
+ if (!arch_irn_consider_in_reg_alloc(cls, node))
+ continue;
+ return node;
+ }
+ return NULL;
}
-#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_foreach(lv, block, flags, node) \
+ for (bool once = true; once;) \
+ for (lv_iterator_t iter = be_lv_iteration_begin((lv), (block)); once; once = false) \
+ for (ir_node *node; (node = be_lv_iteration_next(&iter, (flags))) != NULL;)
-/**
- * Initialize the liveness module.
- * To be called from be_init().
- */
-void be_liveness_init(void);
+#define be_lv_foreach_cls(lv, block, flags, cls, node) \
+ for (bool once = true; once;) \
+ for (lv_iterator_t iter = be_lv_iteration_begin((lv), (block)); once; once = false) \
+ for (ir_node *node; (node = be_lv_iteration_cls_next(&iter, (flags), (cls))) != NULL;)
#endif