X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fsbitmap.h;h=7e2bc707677750baa8b1ea13a06ba1c6c83ddb5c;hb=9636921b6f9c9162ae3aeb278b588b6ee37a3842;hp=a77759917dd53165408e8cac0d073642f519459a;hpb=0019492df5a20c5b3b6d6cd6a52e26be03ddb58e;p=pf3gnuchains%2Fgcc-fork.git diff --git a/gcc/sbitmap.h b/gcc/sbitmap.h index a77759917dd..7e2bc707677 100644 --- a/gcc/sbitmap.h +++ b/gcc/sbitmap.h @@ -1,136 +1,270 @@ /* Simple bitmaps. - Copyright (C) 1999 Free Software Foundation, Inc. + Copyright (C) 1999, 2000, 2002, 2003, 2004, 2006, 2007, 2008 + Free Software Foundation, Inc. -This file is part of GNU CC. +This file is part of GCC. -GNU CC 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 Software Foundation; either version 2, or (at your option) -any later version. +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 +Software Foundation; either version 3, or (at your option) any later +version. -GNU CC is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of -MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -GNU General Public License for more details. +GCC is distributed in the hope that it will be useful, but WITHOUT ANY +WARRANTY; without even the implied warranty of MERCHANTABILITY or +FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License +for more details. You should have received a copy of the GNU General Public License -along with GNU CC; see the file COPYING. If not, write to -the Free Software Foundation, 59 Temple Place - Suite 330, -Boston, MA 02111-1307, USA. */ +along with GCC; see the file COPYING3. If not see +. */ -#ifndef _SBITMAP_H -#define _SBITMAP_H 1 +#ifndef GCC_SBITMAP_H +#define GCC_SBITMAP_H /* 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 while more important issues are dealt with. */ -#define SBITMAP_ELT_BITS HOST_BITS_PER_WIDE_INT -#define SBITMAP_ELT_TYPE unsigned HOST_WIDE_INT - -typedef struct simple_bitmap_def { - /* Number of bits. */ - int n_bits; - /* Size in elements. */ - int size; - /* Size in bytes. */ - int bytes; - /* The elements. */ - SBITMAP_ELT_TYPE elms[1]; +#define SBITMAP_ELT_BITS ((unsigned) HOST_BITS_PER_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 + 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 + don't have 256 bit integers. */ +#if HOST_BITS_PER_WIDEST_FAST_INT > 255 +#error Need to increase size of datatype used for popcount +#endif + +typedef struct simple_bitmap_def +{ + unsigned char *popcount; /* Population count. */ + unsigned int n_bits; /* Number of bits. */ + unsigned int size; /* Size in elements. */ + SBITMAP_ELT_TYPE elms[1]; /* The elements. */ } *sbitmap; +typedef const struct simple_bitmap_def *const_sbitmap; typedef SBITMAP_ELT_TYPE *sbitmap_ptr; +typedef const SBITMAP_ELT_TYPE *const_sbitmap_ptr; /* 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)) + +/* Test if bit number bitno in the bitmap is set. */ +#define TEST_BIT(BITMAP, BITNO) \ +((BITMAP)->elms [(BITNO) / SBITMAP_ELT_BITS] >> (BITNO) % SBITMAP_ELT_BITS & 1) + +/* Set bit number BITNO in the sbitmap MAP. Updates population count + if this bitmap has one. */ + +static inline void +SET_BIT (sbitmap map, unsigned int bitno) +{ + if (map->popcount) + { + bool oldbit; + oldbit = TEST_BIT (map, bitno); + if (!oldbit) + map->popcount[bitno / SBITMAP_ELT_BITS]++; + } + map->elms[bitno / SBITMAP_ELT_BITS] + |= (SBITMAP_ELT_TYPE) 1 << (bitno) % SBITMAP_ELT_BITS; +} + + + +/* Reset bit number BITNO in the sbitmap MAP. Updates population + count if this bitmap has one. */ + +static inline void +RESET_BIT (sbitmap map, unsigned int bitno) +{ + if (map->popcount) + { + bool oldbit; + oldbit = TEST_BIT (map, bitno); + if (oldbit) + map->popcount[bitno / SBITMAP_ELT_BITS]--; + } + map->elms[bitno / SBITMAP_ELT_BITS] + &= ~((SBITMAP_ELT_TYPE) 1 << (bitno) % SBITMAP_ELT_BITS); +} + +/* The iterator for sbitmap. */ +typedef struct { + /* The pointer to the first word of the bitmap. */ + const SBITMAP_ELT_TYPE *ptr; + + /* The size of the bitmap. */ + unsigned int size; + + /* The current word index. */ + unsigned int word_num; + + /* The current bit index (not modulo SBITMAP_ELT_BITS). */ + unsigned int bit_num; + + /* The words currently visited. */ + SBITMAP_ELT_TYPE word; +} sbitmap_iterator; + +/* Initialize the iterator I with sbitmap BMP and the initial index + MIN. */ -/* set bit number bitno in the bitmap */ -#define SET_BIT(bitmap, bitno) \ - ((bitmap)->elms [(bitno) / SBITMAP_ELT_BITS] \ - |= (SBITMAP_ELT_TYPE) 1 << (bitno) % SBITMAP_ELT_BITS) +static inline void +sbitmap_iter_init (sbitmap_iterator *i, const_sbitmap bmp, unsigned int min) +{ + i->word_num = min / (unsigned int) SBITMAP_ELT_BITS; + i->bit_num = min; + i->size = bmp->size; + i->ptr = bmp->elms; -/* test if bit number bitno in the bitmap is set */ -#define TEST_BIT(bitmap, bitno) \ -((bitmap)->elms [(bitno) / SBITMAP_ELT_BITS] >> (bitno) % SBITMAP_ELT_BITS & 1) + if (i->word_num >= i->size) + i->word = 0; + else + i->word = (i->ptr[i->word_num] + >> (i->bit_num % (unsigned int) SBITMAP_ELT_BITS)); +} -/* reset bit number bitno in the bitmap */ -#define RESET_BIT(bitmap, bitno) \ - ((bitmap)->elms [(bitno) / SBITMAP_ELT_BITS] \ - &= ~((SBITMAP_ELT_TYPE) 1 << (bitno) % SBITMAP_ELT_BITS)) +/* 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 + false. */ -/* Loop over all elements of SBITSET, starting with MIN. */ -#define EXECUTE_IF_SET_IN_SBITMAP(SBITMAP, MIN, N, CODE) \ +static inline bool +sbitmap_iter_cond (sbitmap_iterator *i, unsigned int *n) +{ + /* Skip words that are zeros. */ + for (; i->word == 0; i->word = i->ptr[i->word_num]) + { + i->word_num++; + + /* If we have reached the end, break. */ + if (i->word_num >= i->size) + return false; + + i->bit_num = i->word_num * SBITMAP_ELT_BITS; + } + + /* Skip bits that are zero. */ + for (; (i->word & 1) == 0; i->word >>= 1) + i->bit_num++; + + *n = i->bit_num; + + return true; +} + +/* Advance to the next bit. */ + +static inline void +sbitmap_iter_next (sbitmap_iterator *i) +{ + i->word >>= 1; + i->bit_num++; +} + +/* 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 + an instance of sbitmap_iterator used to iterate the bitmap. */ + +#define EXECUTE_IF_SET_IN_SBITMAP(SBITMAP, MIN, N, ITER) \ + for (sbitmap_iter_init (&(ITER), (SBITMAP), (MIN)); \ + sbitmap_iter_cond (&(ITER), &(N)); \ + sbitmap_iter_next (&(ITER))) + +#define EXECUTE_IF_SET_IN_SBITMAP_REV(SBITMAP, N, CODE) \ do { \ - unsigned int bit_num_ = (MIN) % (unsigned) SBITMAP_ELT_BITS; \ - unsigned int word_num_ = (MIN) / (unsigned) SBITMAP_ELT_BITS; \ + unsigned int word_num_; \ + unsigned int bit_num_; \ unsigned int size_ = (SBITMAP)->size; \ SBITMAP_ELT_TYPE *ptr_ = (SBITMAP)->elms; \ \ - while (word_num_ < size_) \ + for (word_num_ = size_; word_num_ > 0; word_num_--) \ { \ - SBITMAP_ELT_TYPE word_ = ptr_[word_num_]; \ + SBITMAP_ELT_TYPE word_ = ptr_[word_num_ - 1]; \ + \ if (word_ != 0) \ - { \ - for (; bit_num_ < SBITMAP_ELT_BITS; ++bit_num_) \ - { \ - SBITMAP_ELT_TYPE mask_ = (SBITMAP_ELT_TYPE)1 << bit_num_; \ - if ((word_ & mask_) != 0) \ - { \ - word_ &= ~mask_; \ - (N) = word_num_ * SBITMAP_ELT_BITS + bit_num_; \ - CODE; \ - if (word_ == 0) \ - break; \ - } \ - } \ - } \ - bit_num_ = 0; \ - word_num_++; \ - } \ + for (bit_num_ = SBITMAP_ELT_BITS; bit_num_ > 0; bit_num_--) \ + { \ + SBITMAP_ELT_TYPE _mask = (SBITMAP_ELT_TYPE)1 << (bit_num_ - 1);\ + \ + if ((word_ & _mask) != 0) \ + { \ + word_ &= ~ _mask; \ + (N) = (word_num_ - 1) * SBITMAP_ELT_BITS + bit_num_ - 1;\ + CODE; \ + if (word_ == 0) \ + break; \ + } \ + } \ + } \ } while (0) -#define sbitmap_free(map) free(map) -#define sbitmap_vector_free(vec) free(vec) +#define sbitmap_free(MAP) (free((MAP)->popcount), free((MAP))) +#define sbitmap_vector_free(VEC) free(VEC) -extern void dump_sbitmap PARAMS ((FILE *, sbitmap)); -extern void dump_sbitmap_vector PARAMS ((FILE *, const char *, const char *, - sbitmap *, int)); +struct int_list; -extern sbitmap sbitmap_alloc PARAMS ((int)); -extern sbitmap *sbitmap_vector_alloc PARAMS ((int, int)); +extern void dump_sbitmap (FILE *, const_sbitmap); +extern void dump_sbitmap_file (FILE *, const_sbitmap); +extern void dump_sbitmap_vector (FILE *, const char *, const char *, sbitmap *, + int); +extern sbitmap sbitmap_alloc (unsigned int); +extern sbitmap sbitmap_alloc_with_popcount (unsigned int); +extern sbitmap *sbitmap_vector_alloc (unsigned int, unsigned int); +extern sbitmap sbitmap_resize (sbitmap, unsigned int, int); +extern void sbitmap_copy (sbitmap, const_sbitmap); +extern void sbitmap_copy_n (sbitmap, const_sbitmap, unsigned int); +extern int sbitmap_equal (const_sbitmap, const_sbitmap); +extern bool sbitmap_empty_p (const_sbitmap); +extern bool sbitmap_range_empty_p (const_sbitmap, unsigned int, unsigned int); +extern void sbitmap_zero (sbitmap); +extern void sbitmap_ones (sbitmap); +extern void sbitmap_vector_zero (sbitmap *, unsigned int); +extern void sbitmap_vector_ones (sbitmap *, unsigned int); -extern void sbitmap_copy PARAMS ((sbitmap, sbitmap)); -extern void sbitmap_zero PARAMS ((sbitmap)); -extern void sbitmap_ones PARAMS ((sbitmap)); -extern void sbitmap_vector_zero PARAMS ((sbitmap *, int)); -extern void sbitmap_vector_ones PARAMS ((sbitmap *, int)); +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 void sbitmap_difference (sbitmap, const_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 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 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 void sbitmap_a_and_b (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 bool sbitmap_a_or_b_cg (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_subset_b_p (const_sbitmap, const_sbitmap); -extern int sbitmap_union_of_diff PARAMS ((sbitmap, sbitmap, sbitmap, sbitmap)); -extern void sbitmap_difference PARAMS ((sbitmap, sbitmap, sbitmap)); -extern void sbitmap_not PARAMS ((sbitmap, sbitmap)); -extern int sbitmap_a_or_b_and_c PARAMS ((sbitmap, sbitmap, sbitmap, sbitmap)); -extern int sbitmap_a_and_b_or_c PARAMS ((sbitmap, sbitmap, sbitmap, sbitmap)); -extern int sbitmap_a_and_b PARAMS ((sbitmap, sbitmap, sbitmap)); -extern int sbitmap_a_or_b PARAMS ((sbitmap, sbitmap, sbitmap)); -extern int sbitmap_a_subset_b_p PARAMS ((sbitmap, sbitmap)); +extern int sbitmap_first_set_bit (const_sbitmap); +extern int sbitmap_last_set_bit (const_sbitmap); -struct int_list; -extern void sbitmap_intersect_of_predsucc PARAMS ((sbitmap, sbitmap *, - int, struct int_list **)); +extern void sbitmap_intersect_of_predsucc (sbitmap, sbitmap *, int, + struct int_list **); #define sbitmap_intersect_of_predecessors sbitmap_intersect_of_predsucc #define sbitmap_intersect_of_successors sbitmap_intersect_of_predsucc -extern void sbitmap_union_of_predsucc PARAMS ((sbitmap, sbitmap *, int, - struct int_list **)); +extern void sbitmap_union_of_predsucc (sbitmap, sbitmap *, int, + struct int_list **); #define sbitmap_union_of_predecessors 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. */ -extern void sbitmap_intersection_of_succs PARAMS ((sbitmap, sbitmap *, int)); -extern void sbitmap_intersection_of_preds PARAMS ((sbitmap, sbitmap *, int)); -extern void sbitmap_union_of_succs PARAMS ((sbitmap, sbitmap *, int)); -extern void sbitmap_union_of_preds PARAMS ((sbitmap, sbitmap *, int)); +extern void sbitmap_intersection_of_succs (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_preds (sbitmap, sbitmap *, int); -#endif /* _SBITMAP_H */ +extern void debug_sbitmap (const_sbitmap); +extern sbitmap sbitmap_realloc (sbitmap, unsigned int); +extern unsigned long sbitmap_popcount(const_sbitmap, unsigned long); +extern void sbitmap_verify_popcount (const_sbitmap); +#endif /* ! GCC_SBITMAP_H */