#include "hashtab.h"
#include "tree-dump.h"
#include "tree-ssa-live.h"
-#include "toplev.h"
+#include "diagnostic-core.h"
/* This set of routines implements a coalesce_list. This is an object which
{
gcc_assert (cl->cost_one_list == NULL);
htab_delete (cl->list);
- if (cl->sorted)
- free (cl->sorted);
+ free (cl->sorted);
gcc_assert (cl->num_sorted == 0);
free (cl);
}
{
bitmap b;
-#ifdef ENABLE_CHECKING
- gcc_assert (x < ptr->size);
- gcc_assert (y < ptr->size);
- gcc_assert (x != y);
-#endif
+ gcc_checking_assert (x < ptr->size);
+ gcc_checking_assert (y < ptr->size);
+ gcc_checking_assert (x != y);
b = ptr->conflicts[x];
if (b)
static inline void
ssa_conflicts_add (ssa_conflicts_p ptr, unsigned x, unsigned y)
{
-#ifdef ENABLE_CHECKING
- gcc_assert (x < ptr->size);
- gcc_assert (y < ptr->size);
- gcc_assert (x != y);
-#endif
+ gcc_checking_assert (x < ptr->size);
+ gcc_checking_assert (y < ptr->size);
+ gcc_checking_assert (x != y);
ssa_conflicts_add_one (ptr, x, y);
ssa_conflicts_add_one (ptr, y, x);
}
root = basevar_index (ptr->map, partition);
/* If this base var wasn't live before, it is now. Clear the element list
since it was delayed until needed. */
- if (!bitmap_bit_p (ptr->live_base_var, root))
- {
- bitmap_set_bit (ptr->live_base_var, root);
- bitmap_clear (ptr->live_base_partitions[root]);
- }
+ if (bitmap_set_bit (ptr->live_base_var, root))
+ bitmap_clear (ptr->live_base_partitions[root]);
bitmap_set_bit (ptr->live_base_partitions[root], partition);
}