#include <stdio.h>
+/* statev is expensive here, only enable when needed */
+#define DISABLE_STATEV
+
#include "irgraph_t.h"
#include "irnode_t.h"
#include "irnodemap.h"
#include "irlivechk.h"
-#include "statev.h"
+#include "statev_t.h"
typedef struct bl_info_t {
const ir_node *block; /**< The block. */
return info;
}
-/**
- * Filter function to select all nodes for which liveness is computed.
- * @param irn A node.
- * @return 1 if the node shall be considered in liveness, 0 if not.
- */
-static inline int is_liveness_node(const ir_node *irn)
-{
- switch (get_irn_opcode(irn)) {
- case iro_Block:
- case iro_Bad:
- case iro_End:
- case iro_Anchor:
- return 0;
- default:
- break;
- }
-
- return 1;
-}
-
/**
* Compute the transitive closure on the reduced graph.
* The reduced graph is the original graph without back edges.
const ir_node *bl = (const ir_node*) dfs_get_post_num_node(lv->dfs, i);
bl_info_t *bi = get_block_info(lv, bl);
- const ir_edge_t *edge;
-
bitset_set(bi->red_reachable, bi->id);
foreach_block_succ (bl, edge) {
ir_node *succ = get_edge_src_irn(edge);
bitset_t *tmp = bitset_alloca(lv->n_blocks);
bl_info_t *bi = get_block_info(lv, bl);
- size_t elm;
-
DBG((lv->dbg, LEVEL_2, "computing T_%d\n", bi->id));
/* put all back edge sources reachable (reduced) from here in tmp */
/* iterate over them ... */
bitset_foreach(tmp, elm) {
bl_info_t *si = lv->map[elm];
- const ir_edge_t *edge;
/* and find back edge targets which are not reduced reachable from bl */
foreach_block_succ (si->block, edge) {
static inline void compute_back_edge_chains(lv_chk_t *lv)
{
- size_t elm;
int i, n;
DBG((lv->dbg, LEVEL_2, "back edge sources: %B\n", lv->back_edge_src));
const ir_node *bl = (const ir_node*) dfs_get_post_num_node(lv->dfs, i);
bl_info_t *bi = get_block_info(lv, bl);
- const ir_edge_t *edge;
-
if (!bitset_is_set(lv->back_edge_tgt, bi->id)) {
foreach_block_succ (bl, edge) {
ir_node *succ = get_edge_src_irn(edge);
* the algorithm is simple. Just check for uses not inside this block.
*/
if (def_bl == bl) {
- const ir_edge_t *edge;
-
stat_ev("lv_chk_def_block");
DBG((lv->dbg, LEVEL_2, "lv check same block %+F in %+F\n", var, bl));
foreach_out_edge (var, edge) {
size_t i;
unsigned min_dom, max_dom;
- const ir_edge_t *edge;
/* if the block has no DFS info, it cannot be reached.
* This can happen in functions with endless loops.