2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Internal headers for liveness analysis.
23 * @author Sebastian Hack
26 #ifndef FIRM_BE_BELIVE_T_H
27 #define FIRM_BE_BELIVE_T_H
30 #include "irnodehashmap.h"
32 #include "irlivechk.h"
35 #define be_is_live_in(lv, bl, irn) _be_is_live_xxx(lv, bl, irn, be_lv_state_in)
36 #define be_is_live_end(lv, bl, irn) _be_is_live_xxx(lv, bl, irn, be_lv_state_end)
37 #define be_is_live_out(lv, bl, irn) _be_is_live_xxx(lv, bl, irn, be_lv_state_out)
47 typedef struct be_lv_info_node_t be_lv_info_node_t;
48 struct be_lv_info_node_t {
53 struct be_lv_info_head_t {
59 struct be_lv_info_head_t head;
60 struct be_lv_info_node_t node;
63 be_lv_info_node_t *be_lv_get(const be_lv_t *li, const ir_node *block,
66 static inline unsigned _be_is_live_xxx(const be_lv_t *li, const ir_node *block,
67 const ir_node *irn, unsigned flags)
72 be_lv_info_node_t *info = be_lv_get(li, block, irn);
73 res = info != NULL ? (info->flags & flags) != 0 : 0;
75 res = (lv_chk_bl_xxx(li->lvc, block, irn) & flags) != 0;
81 typedef struct lv_iterator_t
87 static inline lv_iterator_t be_lv_iteration_begin(const be_lv_t *lv,
91 res.info = ir_nodehashmap_get(be_lv_info_t, &lv->map, block);
92 res.i = res.info != NULL ? res.info[0].head.n_members : 0;
96 static inline ir_node *be_lv_iteration_next(lv_iterator_t *iterator, be_lv_state_t flags)
98 while (iterator->i != 0) {
99 const be_lv_info_t *info = iterator->info + iterator->i--;
100 if (info->node.flags & flags)
101 return info->node.node;
106 #define be_lv_foreach(lv, block, flags, node) \
107 for (bool once = true; once;) \
108 for (lv_iterator_t iter = be_lv_iteration_begin((lv), (block)); once; once = false) \
109 for (ir_node *node; (node = be_lv_iteration_next(&iter, (flags))) != NULL;)