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 "irgraph_t.h"
31 #include "irnodehashmap.h"
44 #include "irlivechk.h"
53 hook_entry_t hook_info;
59 typedef struct be_lv_info_node_t be_lv_info_node_t;
60 struct be_lv_info_node_t {
65 struct be_lv_info_head_t {
71 struct be_lv_info_head_t head;
72 struct be_lv_info_node_t node;
75 static inline int _be_lv_next_irn(const be_lv_t *lv, const ir_node *block,
76 unsigned flags, int i)
78 be_lv_info_t *arr = (be_lv_info_t*)ir_nodehashmap_get(&lv->map, block);
80 int n_members = (int) arr[0].head.n_members;
81 while(i < n_members) {
82 if(arr[i + 1].node.flags & flags) {
92 static inline ir_node *_be_lv_get_irn(const be_lv_t *lv, const ir_node *block,
95 be_lv_info_t *arr = (be_lv_info_t*)ir_nodehashmap_get(&lv->map, block);
96 return get_idx_irn(lv->irg, arr[i + 1].node.idx);
99 be_lv_info_node_t *be_lv_get(const be_lv_t *li, const ir_node *block,
102 static inline unsigned _be_is_live_xxx(const be_lv_t *li, const ir_node *block,
103 const ir_node *irn, unsigned flags)
107 if (li->nodes != NULL) {
108 be_lv_info_node_t *info = be_lv_get(li, block, irn);
109 res = info != NULL ? (info->flags & flags) != 0 : 0;
114 res = (lv_chk_bl_xxx(li->lvc, block, irn) & flags) != 0;
120 #define be_lv_foreach(lv, bl, flags, i) \
121 for (i = _be_lv_next_irn(lv, bl, flags, 0); i >= 0; i = _be_lv_next_irn(lv, bl, flags, i + 1))
124 static inline pset *_be_lv_pset_put(const be_lv_t *lv, const ir_node *block,
128 be_lv_foreach(lv, block, state, i)
129 pset_insert_ptr(s, _be_lv_get_irn(lv, block, i));
133 #define be_lv_get_irn(lv, bl, i) _be_lv_get_irn(lv, bl, i)
134 #define be_lv_pset_put_in(lv, bl, s) _be_lv_pset_put(lv, bl, be_lv_state_in, s)
135 #define be_lv_pset_put_out(lv, bl, s) _be_lv_pset_put(lv, bl, be_lv_state_out, s)
136 #define be_lv_pset_put_end(lv, bl, s) _be_lv_pset_put(lv, bl, be_lv_state_end, s)
138 #define be_is_live_in(lv, bl, irn) _be_is_live_xxx(lv, bl, irn, be_lv_state_in)
139 #define be_is_live_end(lv, bl, irn) _be_is_live_xxx(lv, bl, irn, be_lv_state_end)
140 #define be_is_live_out(lv, bl, irn) _be_is_live_xxx(lv, bl, irn, be_lv_state_out)
142 #define be_lv_has_info_about(lv, irn) bitset_is_set((lv)->nodes, get_irn_idx(irn))