* bt-load.c (migrate_btr_defs): Remove unneeded NULL check.
* df.c (df_free): Likewise.
* ra-build.c (ra_build_free, ra_build_free_all): Likewise.
* tree-ssa-loop-ivopts.c (set_use_iv_cost): Likewise.
From-SVN: r91280
2004-11-25 Nathan Sidwell <nathan@codesourcery.com>
+ * bt-load.c (migrate_btr_defs): Remove unneeded NULL check.
+ * df.c (df_free): Likewise.
+ * ra-build.c (ra_build_free, ra_build_free_all): Likewise.
+ * tree-ssa-loop-ivopts.c (set_use_iv_cost): Likewise.
+
* basic-block.h (OBSTACK_ALLOC_REG_SET): Rename to ...
(ALLOC_REG_SET): ... here.
(FREE_REG_SET): Adjust.
}
}
else
- {
- if (def->live_range)
- BITMAP_XFREE (def->live_range);
- }
+ BITMAP_XFREE (def->live_range);
}
free (btrs_live);
df->regs = 0;
df->reg_size = 0;
- if (df->bbs_modified)
- BITMAP_XFREE (df->bbs_modified);
+ BITMAP_XFREE (df->bbs_modified);
df->bbs_modified = 0;
- if (df->insns_modified)
- BITMAP_XFREE (df->insns_modified);
+ BITMAP_XFREE (df->insns_modified);
df->insns_modified = 0;
BITMAP_XFREE (df->all_blocks);
{
struct tagged_conflict *cl;
for (cl = web_parts[i].sub_conflicts; cl; cl = cl->next)
- {
- if (cl->conflicts)
- BITMAP_XFREE (cl->conflicts);
- }
+ BITMAP_XFREE (cl->conflicts);
web_parts[i].sub_conflicts = NULL;
}
{
struct tagged_conflict *cl;
for (cl = web_parts[i].sub_conflicts; cl; cl = cl->next)
- {
- if (cl->conflicts)
- BITMAP_XFREE (cl->conflicts);
- }
+ BITMAP_XFREE (cl->conflicts);
web_parts[i].sub_conflicts = NULL;
}
sbitmap_free (live_over_abnormal);
if (cost == INFTY)
{
- if (depends_on)
- BITMAP_XFREE (depends_on);
+ BITMAP_XFREE (depends_on);
return;
}