#include "config.h"
#endif
+/* statev is expensive here, only enable when needed */
+#define DISABLE_STATEV
+
#include "impl.h"
#include "iredges_t.h"
#include "irgwalk.h"
/*
* inserting the variables sorted by their ID is probably
* more efficient since the binary sorted set insertion
- * will not need to move arounf the data.
+ * will not need to move around the data.
* However, if sorting the variables a priori pays off
* needs to be checked, hence the define.
*/
void be_liveness_free(be_lv_t *lv)
{
be_liveness_invalidate(lv);
- free(lv);
+#ifdef USE_LIVE_CHK
+ lv_chk_free(lv->lvc);
+ dfs_free(lv->dfs);
+#endif
+ xfree(lv);
}
void be_liveness_remove(be_lv_t *lv, const ir_node *irn)
ir_nodeset_remove(nodeset, proj);
}
}
- }
-
- if (arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
+ } else if (arch_irn_consider_in_reg_alloc(arch_env, cls, node)) {
ir_nodeset_remove(nodeset, node);
}