#include "statev.h"
-typedef struct _bl_info_t {
+typedef struct bl_info_t {
const ir_node *block; /**< The block. */
int be_tgt_calc : 1;
#define get_block_info(lv, bl) ((bl_info_t *) phase_get_irn_data(&(lv)->ph, bl))
-struct _lv_chk_t {
+struct lv_chk_t {
ir_phase ph;
const dfs_t *dfs;
int n_blocks;
DEBUG_ONLY(firm_dbg_module_t *dbg;)
};
-static void *init_block_data(ir_phase *ph, const ir_node *irn, void *old)
+static void *init_block_data(ir_phase *ph, const ir_node *irn)
{
- lv_chk_t *lv = container_of(ph, lv_chk_t, ph);
+ lv_chk_t *lv = firm_container_of(ph, lv_chk_t, ph);
bl_info_t *bi = phase_alloc(ph, sizeof(bi[0]));
bi->id = get_Block_dom_tree_pre_num(irn);
bi->red_reachable = bitset_obstack_alloc(phase_obst(ph), lv->n_blocks);
bi->be_tgt_reach = bitset_obstack_alloc(phase_obst(ph), lv->n_blocks);
bi->be_tgt_calc = 0;
- (void) old;
return bi;
}
case iro_End:
case iro_Anchor:
return 0;
- default:;
+ default:
+ break;
}
return 1;
bitset_t *tmp = bitset_alloca(lv->n_blocks);
bl_info_t *bi = get_block_info(lv, bl);
- bitset_pos_t elm;
+ unsigned elm;
DBG((lv->dbg, LEVEL_2, "computing T_%d\n", bi->id));
static inline void compute_back_edge_chains(lv_chk_t *lv)
{
- bitset_pos_t elm;
+ unsigned elm;
int i, n;
DBG((lv->dbg, LEVEL_2, "back edge sources: %B\n", lv->back_edge_src));