X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbelive_t.h;h=6d79f0124cc90e6c7b70827096f05dc2c1d4c1bb;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=b23a3ee3bd9307fe81ebca9fda79f76fae550280;hpb=fe38209ec98906bdf35f078d1582e72ecec25ac4;p=libfirm

diff --git a/ir/be/belive_t.h b/ir/be/belive_t.h
index b23a3ee3b..6d79f0124 100644
--- a/ir/be/belive_t.h
+++ b/ir/be/belive_t.h
@@ -1,57 +1,78 @@
-/**
- * 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 <stdbool.h>
+#include "be_types.h"
 #include "irgraph_t.h"
-#include "iredges_t.h"
-#include "irphase_t.h"
+#include "irnodehashmap.h"
 #include "irhooks.h"
+#include "irlivechk.h"
+#include "statev.h"
 
 #include "pset.h"
-#include "set.h"
-#include "list.h"
-#include "hashptr.h"
 #include "bitset.h"
 
 #include "belive.h"
 
-struct _be_lv_t {
-	ir_phase ph;
-	ir_graph *irg;
-	bitset_t *nodes;
-	hook_entry_t hook_info;
+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;
 };
 
-struct _be_lv_info_node_t {
+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 {
+struct be_lv_info_head_t {
 	unsigned n_members;
 	unsigned n_size;
 };
 
-struct _be_lv_info_t {
-	union {
-		struct _be_lv_info_head_t head;
-		struct _be_lv_info_node_t node;
-	} u;
+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 struct _be_lv_t *lv, const ir_node *bl, unsigned flags, int i)
+static inline int _be_lv_next_irn(const be_lv_t *lv, const ir_node *block,
+                                  unsigned flags, int i)
 {
-	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;
-
+	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].u.node.flags & flags) {
+			if(arr[i + 1].node.flags & flags) {
 				return i;
 			}
 			++i;
@@ -61,25 +82,37 @@ 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 be_lv_t *lv, const ir_node *block,
+                                      int i)
 {
-	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);
+	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);
 }
 
-struct _be_lv_info_node_t *be_lv_get(const struct _be_lv_t *li, const ir_node *bl, const ir_node *irn);
+be_lv_info_node_t *be_lv_get(const be_lv_t *li, const ir_node *block,
+                             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)
+static inline unsigned _be_is_live_xxx(const 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;
+	unsigned res;
+
+	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;
+	}
+
+	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)
+static inline pset *_be_lv_pset_put(const be_lv_t *lv, const ir_node *block,
+                                    int state, pset *s)
 {
 	int i;
 	be_lv_foreach(lv, block, state, i)