Adapted to stat events

[libfirm] / ir / be / belive_t.h

diff --git a/ir/be/belive_t.h b/ir/be/belive_t.h
index 6f1e965..1b7041e 100644 (file)
--- a/ir/be/belive_t.h
+++ b/ir/be/belive_t.h
@@ -1,30 +1,55 @@
-/**
- * Internal headers for liveness analysis.
- * @author Sebastian Hack
- * @date 6.12.2004
+/*
+ * 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.
  */
 
-#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 "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_lv_t {
-       phase_t ph;
+       ir_phase ph;
        ir_graph *irg;
        bitset_t *nodes;
        hook_entry_t hook_info;
+#ifdef USE_LIVE_CHK
+       lv_chk_t *lvc;
+#endif
 };
 
 struct _be_lv_info_node_t {
@@ -46,8 +71,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) {
@@ -61,9 +87,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);
 }
 
@@ -71,12 +97,22 @@ 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;
+       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 */
 }
 
 #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)
@@ -98,4 +134,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 */