/* Simple bitmaps.
|
/* Simple bitmaps.
|
Copyright (C) 1999, 2000, 2002, 2003, 2004, 2006, 2007, 2008, 2010
|
Copyright (C) 1999, 2000, 2002, 2003, 2004, 2006, 2007, 2008, 2010
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify it under
|
GCC is free software; you can redistribute it and/or modify it under
|
the terms of the GNU General Public License as published by the Free
|
the terms of the GNU General Public License as published by the Free
|
Software Foundation; either version 3, or (at your option) any later
|
Software Foundation; either version 3, or (at your option) any later
|
version.
|
version.
|
|
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
for more details.
|
for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING3. If not see
|
along with GCC; see the file COPYING3. If not see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
#ifndef GCC_SBITMAP_H
|
#ifndef GCC_SBITMAP_H
|
#define GCC_SBITMAP_H
|
#define GCC_SBITMAP_H
|
|
|
/* It's not clear yet whether using bitmap.[ch] will be a win.
|
/* It's not clear yet whether using bitmap.[ch] will be a win.
|
It should be straightforward to convert so for now we keep things simple
|
It should be straightforward to convert so for now we keep things simple
|
while more important issues are dealt with. */
|
while more important issues are dealt with. */
|
|
|
#define SBITMAP_ELT_BITS ((unsigned) HOST_BITS_PER_WIDEST_FAST_INT)
|
#define SBITMAP_ELT_BITS ((unsigned) HOST_BITS_PER_WIDEST_FAST_INT)
|
#define SBITMAP_ELT_TYPE unsigned HOST_WIDEST_FAST_INT
|
#define SBITMAP_ELT_TYPE unsigned HOST_WIDEST_FAST_INT
|
|
|
/* Can't use SBITMAP_ELT_BITS in this macro because it contains a
|
/* Can't use SBITMAP_ELT_BITS in this macro because it contains a
|
cast. There is no perfect macro in GCC to test against. This
|
cast. There is no perfect macro in GCC to test against. This
|
suffices for roughly 99% of the hosts we run on, and the rest
|
suffices for roughly 99% of the hosts we run on, and the rest
|
don't have 256 bit integers. */
|
don't have 256 bit integers. */
|
#if HOST_BITS_PER_WIDEST_FAST_INT > 255
|
#if HOST_BITS_PER_WIDEST_FAST_INT > 255
|
#error Need to increase size of datatype used for popcount
|
#error Need to increase size of datatype used for popcount
|
#endif
|
#endif
|
|
|
struct simple_bitmap_def
|
struct simple_bitmap_def
|
{
|
{
|
unsigned char *popcount; /* Population count. */
|
unsigned char *popcount; /* Population count. */
|
unsigned int n_bits; /* Number of bits. */
|
unsigned int n_bits; /* Number of bits. */
|
unsigned int size; /* Size in elements. */
|
unsigned int size; /* Size in elements. */
|
SBITMAP_ELT_TYPE elms[1]; /* The elements. */
|
SBITMAP_ELT_TYPE elms[1]; /* The elements. */
|
};
|
};
|
|
|
/* Return the set size needed for N elements. */
|
/* Return the set size needed for N elements. */
|
#define SBITMAP_SET_SIZE(N) (((N) + SBITMAP_ELT_BITS - 1) / SBITMAP_ELT_BITS)
|
#define SBITMAP_SET_SIZE(N) (((N) + SBITMAP_ELT_BITS - 1) / SBITMAP_ELT_BITS)
|
#define SBITMAP_SIZE_BYTES(BITMAP) ((BITMAP)->size * sizeof (SBITMAP_ELT_TYPE))
|
#define SBITMAP_SIZE_BYTES(BITMAP) ((BITMAP)->size * sizeof (SBITMAP_ELT_TYPE))
|
|
|
/* Test if bit number bitno in the bitmap is set. */
|
/* Test if bit number bitno in the bitmap is set. */
|
#define TEST_BIT(BITMAP, BITNO) \
|
#define TEST_BIT(BITMAP, BITNO) \
|
((BITMAP)->elms [(BITNO) / SBITMAP_ELT_BITS] >> (BITNO) % SBITMAP_ELT_BITS & 1)
|
((BITMAP)->elms [(BITNO) / SBITMAP_ELT_BITS] >> (BITNO) % SBITMAP_ELT_BITS & 1)
|
|
|
/* Set bit number BITNO in the sbitmap MAP. Updates population count
|
/* Set bit number BITNO in the sbitmap MAP. Updates population count
|
if this bitmap has one. */
|
if this bitmap has one. */
|
|
|
static inline void
|
static inline void
|
SET_BIT (sbitmap map, unsigned int bitno)
|
SET_BIT (sbitmap map, unsigned int bitno)
|
{
|
{
|
if (map->popcount)
|
if (map->popcount)
|
{
|
{
|
bool oldbit;
|
bool oldbit;
|
oldbit = TEST_BIT (map, bitno);
|
oldbit = TEST_BIT (map, bitno);
|
if (!oldbit)
|
if (!oldbit)
|
map->popcount[bitno / SBITMAP_ELT_BITS]++;
|
map->popcount[bitno / SBITMAP_ELT_BITS]++;
|
}
|
}
|
map->elms[bitno / SBITMAP_ELT_BITS]
|
map->elms[bitno / SBITMAP_ELT_BITS]
|
|= (SBITMAP_ELT_TYPE) 1 << (bitno) % SBITMAP_ELT_BITS;
|
|= (SBITMAP_ELT_TYPE) 1 << (bitno) % SBITMAP_ELT_BITS;
|
}
|
}
|
|
|
|
|
|
|
/* Reset bit number BITNO in the sbitmap MAP. Updates population
|
/* Reset bit number BITNO in the sbitmap MAP. Updates population
|
count if this bitmap has one. */
|
count if this bitmap has one. */
|
|
|
static inline void
|
static inline void
|
RESET_BIT (sbitmap map, unsigned int bitno)
|
RESET_BIT (sbitmap map, unsigned int bitno)
|
{
|
{
|
if (map->popcount)
|
if (map->popcount)
|
{
|
{
|
bool oldbit;
|
bool oldbit;
|
oldbit = TEST_BIT (map, bitno);
|
oldbit = TEST_BIT (map, bitno);
|
if (oldbit)
|
if (oldbit)
|
map->popcount[bitno / SBITMAP_ELT_BITS]--;
|
map->popcount[bitno / SBITMAP_ELT_BITS]--;
|
}
|
}
|
map->elms[bitno / SBITMAP_ELT_BITS]
|
map->elms[bitno / SBITMAP_ELT_BITS]
|
&= ~((SBITMAP_ELT_TYPE) 1 << (bitno) % SBITMAP_ELT_BITS);
|
&= ~((SBITMAP_ELT_TYPE) 1 << (bitno) % SBITMAP_ELT_BITS);
|
}
|
}
|
|
|
/* The iterator for sbitmap. */
|
/* The iterator for sbitmap. */
|
typedef struct {
|
typedef struct {
|
/* The pointer to the first word of the bitmap. */
|
/* The pointer to the first word of the bitmap. */
|
const SBITMAP_ELT_TYPE *ptr;
|
const SBITMAP_ELT_TYPE *ptr;
|
|
|
/* The size of the bitmap. */
|
/* The size of the bitmap. */
|
unsigned int size;
|
unsigned int size;
|
|
|
/* The current word index. */
|
/* The current word index. */
|
unsigned int word_num;
|
unsigned int word_num;
|
|
|
/* The current bit index (not modulo SBITMAP_ELT_BITS). */
|
/* The current bit index (not modulo SBITMAP_ELT_BITS). */
|
unsigned int bit_num;
|
unsigned int bit_num;
|
|
|
/* The words currently visited. */
|
/* The words currently visited. */
|
SBITMAP_ELT_TYPE word;
|
SBITMAP_ELT_TYPE word;
|
} sbitmap_iterator;
|
} sbitmap_iterator;
|
|
|
/* Initialize the iterator I with sbitmap BMP and the initial index
|
/* Initialize the iterator I with sbitmap BMP and the initial index
|
MIN. */
|
MIN. */
|
|
|
static inline void
|
static inline void
|
sbitmap_iter_init (sbitmap_iterator *i, const_sbitmap bmp, unsigned int min)
|
sbitmap_iter_init (sbitmap_iterator *i, const_sbitmap bmp, unsigned int min)
|
{
|
{
|
i->word_num = min / (unsigned int) SBITMAP_ELT_BITS;
|
i->word_num = min / (unsigned int) SBITMAP_ELT_BITS;
|
i->bit_num = min;
|
i->bit_num = min;
|
i->size = bmp->size;
|
i->size = bmp->size;
|
i->ptr = bmp->elms;
|
i->ptr = bmp->elms;
|
|
|
if (i->word_num >= i->size)
|
if (i->word_num >= i->size)
|
i->word = 0;
|
i->word = 0;
|
else
|
else
|
i->word = (i->ptr[i->word_num]
|
i->word = (i->ptr[i->word_num]
|
>> (i->bit_num % (unsigned int) SBITMAP_ELT_BITS));
|
>> (i->bit_num % (unsigned int) SBITMAP_ELT_BITS));
|
}
|
}
|
|
|
/* Return true if we have more bits to visit, in which case *N is set
|
/* Return true if we have more bits to visit, in which case *N is set
|
to the index of the bit to be visited. Otherwise, return
|
to the index of the bit to be visited. Otherwise, return
|
false. */
|
false. */
|
|
|
static inline bool
|
static inline bool
|
sbitmap_iter_cond (sbitmap_iterator *i, unsigned int *n)
|
sbitmap_iter_cond (sbitmap_iterator *i, unsigned int *n)
|
{
|
{
|
/* Skip words that are zeros. */
|
/* Skip words that are zeros. */
|
for (; i->word == 0; i->word = i->ptr[i->word_num])
|
for (; i->word == 0; i->word = i->ptr[i->word_num])
|
{
|
{
|
i->word_num++;
|
i->word_num++;
|
|
|
/* If we have reached the end, break. */
|
/* If we have reached the end, break. */
|
if (i->word_num >= i->size)
|
if (i->word_num >= i->size)
|
return false;
|
return false;
|
|
|
i->bit_num = i->word_num * SBITMAP_ELT_BITS;
|
i->bit_num = i->word_num * SBITMAP_ELT_BITS;
|
}
|
}
|
|
|
/* Skip bits that are zero. */
|
/* Skip bits that are zero. */
|
for (; (i->word & 1) == 0; i->word >>= 1)
|
for (; (i->word & 1) == 0; i->word >>= 1)
|
i->bit_num++;
|
i->bit_num++;
|
|
|
*n = i->bit_num;
|
*n = i->bit_num;
|
|
|
return true;
|
return true;
|
}
|
}
|
|
|
/* Advance to the next bit. */
|
/* Advance to the next bit. */
|
|
|
static inline void
|
static inline void
|
sbitmap_iter_next (sbitmap_iterator *i)
|
sbitmap_iter_next (sbitmap_iterator *i)
|
{
|
{
|
i->word >>= 1;
|
i->word >>= 1;
|
i->bit_num++;
|
i->bit_num++;
|
}
|
}
|
|
|
/* Loop over all elements of SBITMAP, starting with MIN. In each
|
/* Loop over all elements of SBITMAP, starting with MIN. In each
|
iteration, N is set to the index of the bit being visited. ITER is
|
iteration, N is set to the index of the bit being visited. ITER is
|
an instance of sbitmap_iterator used to iterate the bitmap. */
|
an instance of sbitmap_iterator used to iterate the bitmap. */
|
|
|
#define EXECUTE_IF_SET_IN_SBITMAP(SBITMAP, MIN, N, ITER) \
|
#define EXECUTE_IF_SET_IN_SBITMAP(SBITMAP, MIN, N, ITER) \
|
for (sbitmap_iter_init (&(ITER), (SBITMAP), (MIN)); \
|
for (sbitmap_iter_init (&(ITER), (SBITMAP), (MIN)); \
|
sbitmap_iter_cond (&(ITER), &(N)); \
|
sbitmap_iter_cond (&(ITER), &(N)); \
|
sbitmap_iter_next (&(ITER)))
|
sbitmap_iter_next (&(ITER)))
|
|
|
#define EXECUTE_IF_SET_IN_SBITMAP_REV(SBITMAP, N, CODE) \
|
#define EXECUTE_IF_SET_IN_SBITMAP_REV(SBITMAP, N, CODE) \
|
do { \
|
do { \
|
unsigned int word_num_; \
|
unsigned int word_num_; \
|
unsigned int bit_num_; \
|
unsigned int bit_num_; \
|
unsigned int size_ = (SBITMAP)->size; \
|
unsigned int size_ = (SBITMAP)->size; \
|
SBITMAP_ELT_TYPE *ptr_ = (SBITMAP)->elms; \
|
SBITMAP_ELT_TYPE *ptr_ = (SBITMAP)->elms; \
|
\
|
\
|
for (word_num_ = size_; word_num_ > 0; word_num_--) \
|
for (word_num_ = size_; word_num_ > 0; word_num_--) \
|
{ \
|
{ \
|
SBITMAP_ELT_TYPE word_ = ptr_[word_num_ - 1]; \
|
SBITMAP_ELT_TYPE word_ = ptr_[word_num_ - 1]; \
|
\
|
\
|
if (word_ != 0) \
|
if (word_ != 0) \
|
for (bit_num_ = SBITMAP_ELT_BITS; bit_num_ > 0; bit_num_--) \
|
for (bit_num_ = SBITMAP_ELT_BITS; bit_num_ > 0; bit_num_--) \
|
{ \
|
{ \
|
SBITMAP_ELT_TYPE _mask = (SBITMAP_ELT_TYPE)1 << (bit_num_ - 1);\
|
SBITMAP_ELT_TYPE _mask = (SBITMAP_ELT_TYPE)1 << (bit_num_ - 1);\
|
\
|
\
|
if ((word_ & _mask) != 0) \
|
if ((word_ & _mask) != 0) \
|
{ \
|
{ \
|
word_ &= ~ _mask; \
|
word_ &= ~ _mask; \
|
(N) = (word_num_ - 1) * SBITMAP_ELT_BITS + bit_num_ - 1;\
|
(N) = (word_num_ - 1) * SBITMAP_ELT_BITS + bit_num_ - 1;\
|
CODE; \
|
CODE; \
|
if (word_ == 0) \
|
if (word_ == 0) \
|
break; \
|
break; \
|
} \
|
} \
|
} \
|
} \
|
} \
|
} \
|
} while (0)
|
} while (0)
|
|
|
#define sbitmap_free(MAP) (free((MAP)->popcount), free((MAP)))
|
#define sbitmap_free(MAP) (free((MAP)->popcount), free((MAP)))
|
#define sbitmap_vector_free(VEC) free(VEC)
|
#define sbitmap_vector_free(VEC) free(VEC)
|
|
|
struct int_list;
|
struct int_list;
|
|
|
extern void dump_sbitmap (FILE *, const_sbitmap);
|
extern void dump_sbitmap (FILE *, const_sbitmap);
|
extern void dump_sbitmap_file (FILE *, const_sbitmap);
|
extern void dump_sbitmap_file (FILE *, const_sbitmap);
|
extern void dump_sbitmap_vector (FILE *, const char *, const char *, sbitmap *,
|
extern void dump_sbitmap_vector (FILE *, const char *, const char *, sbitmap *,
|
int);
|
int);
|
extern sbitmap sbitmap_alloc (unsigned int);
|
extern sbitmap sbitmap_alloc (unsigned int);
|
extern sbitmap sbitmap_alloc_with_popcount (unsigned int);
|
extern sbitmap sbitmap_alloc_with_popcount (unsigned int);
|
extern sbitmap *sbitmap_vector_alloc (unsigned int, unsigned int);
|
extern sbitmap *sbitmap_vector_alloc (unsigned int, unsigned int);
|
extern sbitmap sbitmap_resize (sbitmap, unsigned int, int);
|
extern sbitmap sbitmap_resize (sbitmap, unsigned int, int);
|
extern void sbitmap_copy (sbitmap, const_sbitmap);
|
extern void sbitmap_copy (sbitmap, const_sbitmap);
|
extern void sbitmap_copy_n (sbitmap, const_sbitmap, unsigned int);
|
extern void sbitmap_copy_n (sbitmap, const_sbitmap, unsigned int);
|
extern int sbitmap_equal (const_sbitmap, const_sbitmap);
|
extern int sbitmap_equal (const_sbitmap, const_sbitmap);
|
extern bool sbitmap_empty_p (const_sbitmap);
|
extern bool sbitmap_empty_p (const_sbitmap);
|
extern bool sbitmap_range_empty_p (const_sbitmap, unsigned int, unsigned int);
|
extern bool sbitmap_range_empty_p (const_sbitmap, unsigned int, unsigned int);
|
extern void sbitmap_zero (sbitmap);
|
extern void sbitmap_zero (sbitmap);
|
extern void sbitmap_ones (sbitmap);
|
extern void sbitmap_ones (sbitmap);
|
extern void sbitmap_vector_zero (sbitmap *, unsigned int);
|
extern void sbitmap_vector_zero (sbitmap *, unsigned int);
|
extern void sbitmap_vector_ones (sbitmap *, unsigned int);
|
extern void sbitmap_vector_ones (sbitmap *, unsigned int);
|
|
|
extern void sbitmap_union_of_diff (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_union_of_diff (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_union_of_diff_cg (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_union_of_diff_cg (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_difference (sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_difference (sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_not (sbitmap, const_sbitmap);
|
extern void sbitmap_not (sbitmap, const_sbitmap);
|
extern void sbitmap_a_or_b_and_c (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_a_or_b_and_c (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_or_b_and_c_cg (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_or_b_and_c_cg (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_a_and_b_or_c (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_a_and_b_or_c (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_and_b_or_c_cg (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_and_b_or_c_cg (sbitmap, const_sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_any_common_bits (const_sbitmap, const_sbitmap);
|
extern bool sbitmap_any_common_bits (const_sbitmap, const_sbitmap);
|
extern void sbitmap_a_and_b (sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_a_and_b (sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_and_b_cg (sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_and_b_cg (sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_a_or_b (sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_a_or_b (sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_or_b_cg (sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_or_b_cg (sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_a_xor_b (sbitmap, const_sbitmap, const_sbitmap);
|
extern void sbitmap_a_xor_b (sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_xor_b_cg (sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_xor_b_cg (sbitmap, const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_subset_b_p (const_sbitmap, const_sbitmap);
|
extern bool sbitmap_a_subset_b_p (const_sbitmap, const_sbitmap);
|
|
|
extern int sbitmap_first_set_bit (const_sbitmap);
|
extern int sbitmap_first_set_bit (const_sbitmap);
|
extern int sbitmap_last_set_bit (const_sbitmap);
|
extern int sbitmap_last_set_bit (const_sbitmap);
|
|
|
extern void sbitmap_intersect_of_predsucc (sbitmap, sbitmap *, int,
|
extern void sbitmap_intersect_of_predsucc (sbitmap, sbitmap *, int,
|
struct int_list **);
|
struct int_list **);
|
#define sbitmap_intersect_of_predecessors sbitmap_intersect_of_predsucc
|
#define sbitmap_intersect_of_predecessors sbitmap_intersect_of_predsucc
|
#define sbitmap_intersect_of_successors sbitmap_intersect_of_predsucc
|
#define sbitmap_intersect_of_successors sbitmap_intersect_of_predsucc
|
|
|
extern void sbitmap_union_of_predsucc (sbitmap, sbitmap *, int,
|
extern void sbitmap_union_of_predsucc (sbitmap, sbitmap *, int,
|
struct int_list **);
|
struct int_list **);
|
#define sbitmap_union_of_predecessors sbitmap_union_of_predsucc
|
#define sbitmap_union_of_predecessors sbitmap_union_of_predsucc
|
#define sbitmap_union_of_successors sbitmap_union_of_predsucc
|
#define sbitmap_union_of_successors sbitmap_union_of_predsucc
|
|
|
/* Intersection and Union of preds/succs using the new flow graph
|
/* Intersection and Union of preds/succs using the new flow graph
|
structure instead of the pred/succ arrays. */
|
structure instead of the pred/succ arrays. */
|
|
|
extern void sbitmap_intersection_of_succs (sbitmap, sbitmap *, int);
|
extern void sbitmap_intersection_of_succs (sbitmap, sbitmap *, int);
|
extern void sbitmap_intersection_of_preds (sbitmap, sbitmap *, int);
|
extern void sbitmap_intersection_of_preds (sbitmap, sbitmap *, int);
|
extern void sbitmap_union_of_succs (sbitmap, sbitmap *, int);
|
extern void sbitmap_union_of_succs (sbitmap, sbitmap *, int);
|
extern void sbitmap_union_of_preds (sbitmap, sbitmap *, int);
|
extern void sbitmap_union_of_preds (sbitmap, sbitmap *, int);
|
|
|
extern void debug_sbitmap (const_sbitmap);
|
extern void debug_sbitmap (const_sbitmap);
|
extern sbitmap sbitmap_realloc (sbitmap, unsigned int);
|
extern sbitmap sbitmap_realloc (sbitmap, unsigned int);
|
extern unsigned long sbitmap_popcount(const_sbitmap, unsigned long);
|
extern unsigned long sbitmap_popcount(const_sbitmap, unsigned long);
|
extern void sbitmap_verify_popcount (const_sbitmap);
|
extern void sbitmap_verify_popcount (const_sbitmap);
|
#endif /* ! GCC_SBITMAP_H */
|
#endif /* ! GCC_SBITMAP_H */
|
|
|