backend: created a (not so nice) macro to iterate over all values defined by an instr...

[libfirm] / ir / be / belive_t.h

diff --git a/ir/be/belive_t.h b/ir/be/belive_t.h
index 1b7041e..4f49293 100644 (file)
--- a/ir/be/belive_t.h
+++ b/ir/be/belive_t.h
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
@@ -30,6 +30,8 @@
 #include "irgraph_t.h"
 #include "irphase_t.h"
 #include "irhooks.h"
+#include "dfs.h"
+#include "statev.h"
 
 #include "pset.h"
 #include "bitset.h"
@@ -45,6 +47,7 @@
 struct _be_lv_t {
        ir_phase ph;
        ir_graph *irg;
+       dfs_t *dfs;
        bitset_t *nodes;
        hook_entry_t hook_info;
 #ifdef USE_LIVE_CHK
@@ -69,7 +72,7 @@ struct _be_lv_info_t {
        } u;
 };
 
-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 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);
 
@@ -87,7 +90,7 @@ 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);
        return get_idx_irn(lv->irg, arr[i + 1].u.node.idx);
@@ -95,27 +98,28 @@ static INLINE ir_node *_be_lv_get_irn(const struct _be_lv_t *lv, const ir_node *
 
 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)
+static inline int _be_is_live_xxx(const struct _be_lv_t *li, const ir_node *block, const ir_node *irn, unsigned flags)
 {
+       int res;
+
        if (li->nodes) {
                struct _be_lv_info_node_t *info = be_lv_get(li, block, irn);
-               return info ? (info->flags & flags) != 0 : 0;
+               res = 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;
+               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))
 
 
-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 struct _be_lv_t *lv, const ir_node *block, int state, pset *s)
 {
        int i;
        be_lv_foreach(lv, block, state, i)
@@ -134,4 +138,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 /* FIRM_BE_BELIVE_T_H */
+#endif