class ssa_block_ranges
{
public:
- virtual bool set_bb_range (const basic_block bb, const irange &r) = 0;
- virtual bool get_bb_range (irange &r, const basic_block bb) = 0;
- virtual bool bb_range_p (const basic_block bb) = 0;
+ virtual bool set_bb_range (const_basic_block bb, const irange &r) = 0;
+ virtual bool get_bb_range (irange &r, const_basic_block bb) = 0;
+ virtual bool bb_range_p (const_basic_block bb) = 0;
void dump(FILE *f);
};
public:
sbr_vector (tree t, irange_allocator *allocator);
- virtual bool set_bb_range (const basic_block bb, const irange &r) OVERRIDE;
- virtual bool get_bb_range (irange &r, const basic_block bb) OVERRIDE;
- virtual bool bb_range_p (const basic_block bb) OVERRIDE;
+ virtual bool set_bb_range (const_basic_block bb, const irange &r) OVERRIDE;
+ virtual bool get_bb_range (irange &r, const_basic_block bb) OVERRIDE;
+ virtual bool bb_range_p (const_basic_block bb) OVERRIDE;
protected:
irange **m_tab; // Non growing vector.
int m_tab_size;
// Set the range for block BB to be R.
bool
-sbr_vector::set_bb_range (const basic_block bb, const irange &r)
+sbr_vector::set_bb_range (const_basic_block bb, const irange &r)
{
irange *m;
gcc_checking_assert (bb->index < m_tab_size);
// there is no range.
bool
-sbr_vector::get_bb_range (irange &r, const basic_block bb)
+sbr_vector::get_bb_range (irange &r, const_basic_block bb)
{
gcc_checking_assert (bb->index < m_tab_size);
irange *m = m_tab[bb->index];
// Return true if a range is present.
bool
-sbr_vector::bb_range_p (const basic_block bb)
+sbr_vector::bb_range_p (const_basic_block bb)
{
gcc_checking_assert (bb->index < m_tab_size);
return m_tab[bb->index] != NULL;
{
public:
sbr_sparse_bitmap (tree t, irange_allocator *allocator, bitmap_obstack *bm);
- virtual bool set_bb_range (const basic_block bb, const irange &r) OVERRIDE;
- virtual bool get_bb_range (irange &r, const basic_block bb) OVERRIDE;
- virtual bool bb_range_p (const basic_block bb) OVERRIDE;
+ virtual bool set_bb_range (const_basic_block bb, const irange &r) OVERRIDE;
+ virtual bool get_bb_range (irange &r, const_basic_block bb) OVERRIDE;
+ virtual bool bb_range_p (const_basic_block bb) OVERRIDE;
private:
void bitmap_set_quad (bitmap head, int quad, int quad_value);
int bitmap_get_quad (const_bitmap head, int quad);
// Set the range on entry to basic block BB to R.
bool
-sbr_sparse_bitmap::set_bb_range (const basic_block bb, const irange &r)
+sbr_sparse_bitmap::set_bb_range (const_basic_block bb, const irange &r)
{
if (r.undefined_p ())
{
// there is no range.
bool
-sbr_sparse_bitmap::get_bb_range (irange &r, const basic_block bb)
+sbr_sparse_bitmap::get_bb_range (irange &r, const_basic_block bb)
{
int value = bitmap_get_quad (bitvec, bb->index);
// Return true if a range is present.
bool
-sbr_sparse_bitmap::bb_range_p (const basic_block bb)
+sbr_sparse_bitmap::bb_range_p (const_basic_block bb)
{
return (bitmap_get_quad (bitvec, bb->index) != 0);
}
// If it has not been accessed yet, allocate it first.
bool
-block_range_cache::set_bb_range (tree name, const basic_block bb,
+block_range_cache::set_bb_range (tree name, const_basic_block bb,
const irange &r)
{
unsigned v = SSA_NAME_VERSION (name);
// is one.
bool
-block_range_cache::get_bb_range (irange &r, tree name, const basic_block bb)
+block_range_cache::get_bb_range (irange &r, tree name, const_basic_block bb)
{
ssa_block_ranges *ptr = query_block_ranges (name);
if (ptr)
// Return true if NAME has a range set in block BB.
bool
-block_range_cache::bb_range_p (tree name, const basic_block bb)
+block_range_cache::bb_range_p (tree name, const_basic_block bb)
{
ssa_block_ranges *ptr = query_block_ranges (name);
if (ptr)