duke@435: /*
drchase@6680:  * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "memory/allocation.inline.hpp"
stefank@2314: #include "utilities/bitMap.inline.hpp"
stefank@2314: #include "utilities/copy.hpp"
stefank@2314: #ifdef TARGET_OS_FAMILY_linux
stefank@2314: # include "os_linux.inline.hpp"
stefank@2314: #endif
stefank@2314: #ifdef TARGET_OS_FAMILY_solaris
stefank@2314: # include "os_solaris.inline.hpp"
stefank@2314: #endif
stefank@2314: #ifdef TARGET_OS_FAMILY_windows
stefank@2314: # include "os_windows.inline.hpp"
stefank@2314: #endif
goetz@6461: #ifdef TARGET_OS_FAMILY_aix
goetz@6461: # include "os_aix.inline.hpp"
goetz@6461: #endif
never@3156: #ifdef TARGET_OS_FAMILY_bsd
never@3156: # include "os_bsd.inline.hpp"
never@3156: #endif
duke@435: 
duke@435: 
ysr@777: BitMap::BitMap(bm_word_t* map, idx_t size_in_bits) :
brutisso@5278:   _map(map), _size(size_in_bits), _map_allocator(false)
ysr@777: {
ysr@777:   assert(sizeof(bm_word_t) == BytesPerWord, "Implementation assumption.");
duke@435:   assert(size_in_bits >= 0, "just checking");
duke@435: }
duke@435: 
duke@435: 
ysr@777: BitMap::BitMap(idx_t size_in_bits, bool in_resource_area) :
brutisso@5278:   _map(NULL), _size(0), _map_allocator(false)
ysr@777: {
ysr@777:   assert(sizeof(bm_word_t) == BytesPerWord, "Implementation assumption.");
ysr@777:   resize(size_in_bits, in_resource_area);
duke@435: }
duke@435: 
ysr@777: void BitMap::resize(idx_t size_in_bits, bool in_resource_area) {
duke@435:   assert(size_in_bits >= 0, "just checking");
ysr@777:   idx_t old_size_in_words = size_in_words();
ysr@777:   bm_word_t* old_map = map();
ysr@777: 
duke@435:   _size = size_in_bits;
ysr@777:   idx_t new_size_in_words = size_in_words();
ysr@777:   if (in_resource_area) {
ysr@777:     _map = NEW_RESOURCE_ARRAY(bm_word_t, new_size_in_words);
ysr@777:   } else {
brutisso@5278:     if (old_map != NULL) {
brutisso@5278:       _map_allocator.free();
brutisso@5278:     }
brutisso@5278:     _map = _map_allocator.allocate(new_size_in_words);
ysr@777:   }
ysr@777:   Copy::disjoint_words((HeapWord*)old_map, (HeapWord*) _map,
ysr@777:                        MIN2(old_size_in_words, new_size_in_words));
duke@435:   if (new_size_in_words > old_size_in_words) {
duke@435:     clear_range_of_words(old_size_in_words, size_in_words());
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BitMap::set_range_within_word(idx_t beg, idx_t end) {
duke@435:   // With a valid range (beg <= end), this test ensures that end != 0, as
duke@435:   // required by inverted_bit_mask_for_range.  Also avoids an unnecessary write.
duke@435:   if (beg != end) {
ysr@777:     bm_word_t mask = inverted_bit_mask_for_range(beg, end);
duke@435:     *word_addr(beg) |= ~mask;
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BitMap::clear_range_within_word(idx_t beg, idx_t end) {
duke@435:   // With a valid range (beg <= end), this test ensures that end != 0, as
duke@435:   // required by inverted_bit_mask_for_range.  Also avoids an unnecessary write.
duke@435:   if (beg != end) {
ysr@777:     bm_word_t mask = inverted_bit_mask_for_range(beg, end);
duke@435:     *word_addr(beg) &= mask;
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BitMap::par_put_range_within_word(idx_t beg, idx_t end, bool value) {
duke@435:   assert(value == 0 || value == 1, "0 for clear, 1 for set");
duke@435:   // With a valid range (beg <= end), this test ensures that end != 0, as
duke@435:   // required by inverted_bit_mask_for_range.  Also avoids an unnecessary write.
duke@435:   if (beg != end) {
duke@435:     intptr_t* pw  = (intptr_t*)word_addr(beg);
duke@435:     intptr_t  w   = *pw;
duke@435:     intptr_t  mr  = (intptr_t)inverted_bit_mask_for_range(beg, end);
duke@435:     intptr_t  nw  = value ? (w | ~mr) : (w & mr);
duke@435:     while (true) {
duke@435:       intptr_t res = Atomic::cmpxchg_ptr(nw, pw, w);
duke@435:       if (res == w) break;
tschatzl@6304:       w  = res;
duke@435:       nw = value ? (w | ~mr) : (w & mr);
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BitMap::set_range(idx_t beg, idx_t end) {
duke@435:   verify_range(beg, end);
duke@435: 
duke@435:   idx_t beg_full_word = word_index_round_up(beg);
duke@435:   idx_t end_full_word = word_index(end);
duke@435: 
duke@435:   if (beg_full_word < end_full_word) {
duke@435:     // The range includes at least one full word.
duke@435:     set_range_within_word(beg, bit_index(beg_full_word));
duke@435:     set_range_of_words(beg_full_word, end_full_word);
duke@435:     set_range_within_word(bit_index(end_full_word), end);
duke@435:   } else {
duke@435:     // The range spans at most 2 partial words.
duke@435:     idx_t boundary = MIN2(bit_index(beg_full_word), end);
duke@435:     set_range_within_word(beg, boundary);
duke@435:     set_range_within_word(boundary, end);
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BitMap::clear_range(idx_t beg, idx_t end) {
duke@435:   verify_range(beg, end);
duke@435: 
duke@435:   idx_t beg_full_word = word_index_round_up(beg);
duke@435:   idx_t end_full_word = word_index(end);
duke@435: 
duke@435:   if (beg_full_word < end_full_word) {
duke@435:     // The range includes at least one full word.
duke@435:     clear_range_within_word(beg, bit_index(beg_full_word));
duke@435:     clear_range_of_words(beg_full_word, end_full_word);
duke@435:     clear_range_within_word(bit_index(end_full_word), end);
duke@435:   } else {
duke@435:     // The range spans at most 2 partial words.
duke@435:     idx_t boundary = MIN2(bit_index(beg_full_word), end);
duke@435:     clear_range_within_word(beg, boundary);
duke@435:     clear_range_within_word(boundary, end);
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BitMap::set_large_range(idx_t beg, idx_t end) {
duke@435:   verify_range(beg, end);
duke@435: 
duke@435:   idx_t beg_full_word = word_index_round_up(beg);
duke@435:   idx_t end_full_word = word_index(end);
duke@435: 
duke@435:   assert(end_full_word - beg_full_word >= 32,
duke@435:          "the range must include at least 32 bytes");
duke@435: 
duke@435:   // The range includes at least one full word.
duke@435:   set_range_within_word(beg, bit_index(beg_full_word));
duke@435:   set_large_range_of_words(beg_full_word, end_full_word);
duke@435:   set_range_within_word(bit_index(end_full_word), end);
duke@435: }
duke@435: 
duke@435: void BitMap::clear_large_range(idx_t beg, idx_t end) {
duke@435:   verify_range(beg, end);
duke@435: 
duke@435:   idx_t beg_full_word = word_index_round_up(beg);
duke@435:   idx_t end_full_word = word_index(end);
duke@435: 
duke@435:   assert(end_full_word - beg_full_word >= 32,
duke@435:          "the range must include at least 32 bytes");
duke@435: 
duke@435:   // The range includes at least one full word.
duke@435:   clear_range_within_word(beg, bit_index(beg_full_word));
duke@435:   clear_large_range_of_words(beg_full_word, end_full_word);
duke@435:   clear_range_within_word(bit_index(end_full_word), end);
duke@435: }
duke@435: 
duke@435: void BitMap::at_put(idx_t offset, bool value) {
duke@435:   if (value) {
duke@435:     set_bit(offset);
duke@435:   } else {
duke@435:     clear_bit(offset);
duke@435:   }
duke@435: }
duke@435: 
duke@435: // Return true to indicate that this thread changed
duke@435: // the bit, false to indicate that someone else did.
duke@435: // In either case, the requested bit is in the
duke@435: // requested state some time during the period that
duke@435: // this thread is executing this call. More importantly,
duke@435: // if no other thread is executing an action to
duke@435: // change the requested bit to a state other than
duke@435: // the one that this thread is trying to set it to,
duke@435: // then the the bit is in the expected state
duke@435: // at exit from this method. However, rather than
duke@435: // make such a strong assertion here, based on
duke@435: // assuming such constrained use (which though true
duke@435: // today, could change in the future to service some
duke@435: // funky parallel algorithm), we encourage callers
duke@435: // to do such verification, as and when appropriate.
duke@435: bool BitMap::par_at_put(idx_t bit, bool value) {
duke@435:   return value ? par_set_bit(bit) : par_clear_bit(bit);
duke@435: }
duke@435: 
duke@435: void BitMap::at_put_grow(idx_t offset, bool value) {
duke@435:   if (offset >= size()) {
duke@435:     resize(2 * MAX2(size(), offset));
duke@435:   }
duke@435:   at_put(offset, value);
duke@435: }
duke@435: 
duke@435: void BitMap::at_put_range(idx_t start_offset, idx_t end_offset, bool value) {
duke@435:   if (value) {
duke@435:     set_range(start_offset, end_offset);
duke@435:   } else {
duke@435:     clear_range(start_offset, end_offset);
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BitMap::par_at_put_range(idx_t beg, idx_t end, bool value) {
duke@435:   verify_range(beg, end);
duke@435: 
duke@435:   idx_t beg_full_word = word_index_round_up(beg);
duke@435:   idx_t end_full_word = word_index(end);
duke@435: 
duke@435:   if (beg_full_word < end_full_word) {
duke@435:     // The range includes at least one full word.
duke@435:     par_put_range_within_word(beg, bit_index(beg_full_word), value);
duke@435:     if (value) {
duke@435:       set_range_of_words(beg_full_word, end_full_word);
duke@435:     } else {
duke@435:       clear_range_of_words(beg_full_word, end_full_word);
duke@435:     }
duke@435:     par_put_range_within_word(bit_index(end_full_word), end, value);
duke@435:   } else {
duke@435:     // The range spans at most 2 partial words.
duke@435:     idx_t boundary = MIN2(bit_index(beg_full_word), end);
duke@435:     par_put_range_within_word(beg, boundary, value);
duke@435:     par_put_range_within_word(boundary, end, value);
duke@435:   }
duke@435: 
duke@435: }
duke@435: 
duke@435: void BitMap::at_put_large_range(idx_t beg, idx_t end, bool value) {
duke@435:   if (value) {
duke@435:     set_large_range(beg, end);
duke@435:   } else {
duke@435:     clear_large_range(beg, end);
duke@435:   }
duke@435: }
duke@435: 
duke@435: void BitMap::par_at_put_large_range(idx_t beg, idx_t end, bool value) {
duke@435:   verify_range(beg, end);
duke@435: 
duke@435:   idx_t beg_full_word = word_index_round_up(beg);
duke@435:   idx_t end_full_word = word_index(end);
duke@435: 
duke@435:   assert(end_full_word - beg_full_word >= 32,
duke@435:          "the range must include at least 32 bytes");
duke@435: 
duke@435:   // The range includes at least one full word.
duke@435:   par_put_range_within_word(beg, bit_index(beg_full_word), value);
duke@435:   if (value) {
duke@435:     set_large_range_of_words(beg_full_word, end_full_word);
duke@435:   } else {
duke@435:     clear_large_range_of_words(beg_full_word, end_full_word);
duke@435:   }
duke@435:   par_put_range_within_word(bit_index(end_full_word), end, value);
duke@435: }
duke@435: 
duke@435: bool BitMap::contains(const BitMap other) const {
duke@435:   assert(size() == other.size(), "must have same size");
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
duke@435:   idx_t size = size_in_words();
duke@435:   for (idx_t index = 0; index < size_in_words(); index++) {
ysr@777:     bm_word_t word_union = dest_map[index] | other_map[index];
duke@435:     // If this has more bits set than dest_map[index], then other is not a
duke@435:     // subset.
duke@435:     if (word_union != dest_map[index]) return false;
duke@435:   }
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: bool BitMap::intersects(const BitMap other) const {
duke@435:   assert(size() == other.size(), "must have same size");
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
duke@435:   idx_t size = size_in_words();
duke@435:   for (idx_t index = 0; index < size_in_words(); index++) {
duke@435:     if ((dest_map[index] & other_map[index]) != 0) return true;
duke@435:   }
duke@435:   // Otherwise, no intersection.
duke@435:   return false;
duke@435: }
duke@435: 
duke@435: void BitMap::set_union(BitMap other) {
duke@435:   assert(size() == other.size(), "must have same size");
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
duke@435:   idx_t size = size_in_words();
duke@435:   for (idx_t index = 0; index < size_in_words(); index++) {
duke@435:     dest_map[index] = dest_map[index] | other_map[index];
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void BitMap::set_difference(BitMap other) {
duke@435:   assert(size() == other.size(), "must have same size");
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
duke@435:   idx_t size = size_in_words();
duke@435:   for (idx_t index = 0; index < size_in_words(); index++) {
duke@435:     dest_map[index] = dest_map[index] & ~(other_map[index]);
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void BitMap::set_intersection(BitMap other) {
duke@435:   assert(size() == other.size(), "must have same size");
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
duke@435:   idx_t size = size_in_words();
duke@435:   for (idx_t index = 0; index < size; index++) {
duke@435:     dest_map[index]  = dest_map[index] & other_map[index];
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
ysr@777: void BitMap::set_intersection_at_offset(BitMap other, idx_t offset) {
ysr@777:   assert(other.size() >= offset, "offset not in range");
ysr@777:   assert(other.size() - offset >= size(), "other not large enough");
ysr@777:   // XXX Ideally, we would remove this restriction.
ysr@777:   guarantee((offset % (sizeof(bm_word_t) * BitsPerByte)) == 0,
ysr@777:             "Only handle aligned cases so far.");
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
ysr@777:   idx_t offset_word_ind = word_index(offset);
ysr@777:   idx_t size = size_in_words();
ysr@777:   for (idx_t index = 0; index < size; index++) {
ysr@777:     dest_map[index] = dest_map[index] & other_map[offset_word_ind + index];
ysr@777:   }
ysr@777: }
ysr@777: 
duke@435: bool BitMap::set_union_with_result(BitMap other) {
duke@435:   assert(size() == other.size(), "must have same size");
duke@435:   bool changed = false;
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
duke@435:   idx_t size = size_in_words();
duke@435:   for (idx_t index = 0; index < size; index++) {
duke@435:     idx_t temp = map(index) | other_map[index];
duke@435:     changed = changed || (temp != map(index));
duke@435:     map()[index] = temp;
duke@435:   }
duke@435:   return changed;
duke@435: }
duke@435: 
duke@435: 
duke@435: bool BitMap::set_difference_with_result(BitMap other) {
duke@435:   assert(size() == other.size(), "must have same size");
duke@435:   bool changed = false;
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
duke@435:   idx_t size = size_in_words();
duke@435:   for (idx_t index = 0; index < size; index++) {
ysr@777:     bm_word_t temp = dest_map[index] & ~(other_map[index]);
duke@435:     changed = changed || (temp != dest_map[index]);
duke@435:     dest_map[index] = temp;
duke@435:   }
duke@435:   return changed;
duke@435: }
duke@435: 
duke@435: 
duke@435: bool BitMap::set_intersection_with_result(BitMap other) {
duke@435:   assert(size() == other.size(), "must have same size");
duke@435:   bool changed = false;
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
duke@435:   idx_t size = size_in_words();
duke@435:   for (idx_t index = 0; index < size; index++) {
ysr@777:     bm_word_t orig = dest_map[index];
ysr@777:     bm_word_t temp = orig & other_map[index];
duke@435:     changed = changed || (temp != orig);
duke@435:     dest_map[index]  = temp;
duke@435:   }
duke@435:   return changed;
duke@435: }
duke@435: 
duke@435: 
duke@435: void BitMap::set_from(BitMap other) {
duke@435:   assert(size() == other.size(), "must have same size");
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
duke@435:   idx_t size = size_in_words();
duke@435:   for (idx_t index = 0; index < size; index++) {
duke@435:     dest_map[index] = other_map[index];
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: bool BitMap::is_same(BitMap other) {
duke@435:   assert(size() == other.size(), "must have same size");
ysr@777:   bm_word_t* dest_map = map();
ysr@777:   bm_word_t* other_map = other.map();
duke@435:   idx_t size = size_in_words();
duke@435:   for (idx_t index = 0; index < size; index++) {
duke@435:     if (dest_map[index] != other_map[index]) return false;
duke@435:   }
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: bool BitMap::is_full() const {
ysr@777:   bm_word_t* word = map();
duke@435:   idx_t rest = size();
duke@435:   for (; rest >= (idx_t) BitsPerWord; rest -= BitsPerWord) {
ysr@777:     if (*word != (bm_word_t) AllBits) return false;
duke@435:     word++;
duke@435:   }
ysr@777:   return rest == 0 || (*word | ~right_n_bits((int)rest)) == (bm_word_t) AllBits;
duke@435: }
duke@435: 
duke@435: 
duke@435: bool BitMap::is_empty() const {
ysr@777:   bm_word_t* word = map();
duke@435:   idx_t rest = size();
duke@435:   for (; rest >= (idx_t) BitsPerWord; rest -= BitsPerWord) {
ysr@777:     if (*word != (bm_word_t) NoBits) return false;
duke@435:     word++;
duke@435:   }
ysr@777:   return rest == 0 || (*word & right_n_bits((int)rest)) == (bm_word_t) NoBits;
duke@435: }
duke@435: 
duke@435: void BitMap::clear_large() {
duke@435:   clear_large_range_of_words(0, size_in_words());
duke@435: }
duke@435: 
duke@435: // Note that if the closure itself modifies the bitmap
duke@435: // then modifications in and to the left of the _bit_ being
duke@435: // currently sampled will not be seen. Note also that the
duke@435: // interval [leftOffset, rightOffset) is right open.
ysr@777: bool BitMap::iterate(BitMapClosure* blk, idx_t leftOffset, idx_t rightOffset) {
duke@435:   verify_range(leftOffset, rightOffset);
duke@435: 
duke@435:   idx_t startIndex = word_index(leftOffset);
duke@435:   idx_t endIndex   = MIN2(word_index(rightOffset) + 1, size_in_words());
duke@435:   for (idx_t index = startIndex, offset = leftOffset;
duke@435:        offset < rightOffset && index < endIndex;
duke@435:        offset = (++index) << LogBitsPerWord) {
duke@435:     idx_t rest = map(index) >> (offset & (BitsPerWord - 1));
ysr@777:     for (; offset < rightOffset && rest != (bm_word_t)NoBits; offset++) {
duke@435:       if (rest & 1) {
ysr@777:         if (!blk->do_bit(offset)) return false;
duke@435:         //  resample at each closure application
duke@435:         // (see, for instance, CMS bug 4525989)
duke@435:         rest = map(index) >> (offset & (BitsPerWord -1));
duke@435:       }
duke@435:       rest = rest >> 1;
duke@435:     }
duke@435:   }
ysr@777:   return true;
duke@435: }
duke@435: 
ysr@777: BitMap::idx_t* BitMap::_pop_count_table = NULL;
duke@435: 
ysr@777: void BitMap::init_pop_count_table() {
ysr@777:   if (_pop_count_table == NULL) {
zgu@3900:     BitMap::idx_t *table = NEW_C_HEAP_ARRAY(idx_t, 256, mtInternal);
ysr@777:     for (uint i = 0; i < 256; i++) {
ysr@777:       table[i] = num_set_bits(i);
ysr@777:     }
duke@435: 
ysr@777:     intptr_t res = Atomic::cmpxchg_ptr((intptr_t)  table,
ysr@777:                                        (intptr_t*) &_pop_count_table,
ysr@777:                                        (intptr_t)  NULL_WORD);
ysr@777:     if (res != NULL_WORD) {
ysr@777:       guarantee( _pop_count_table == (void*) res, "invariant" );
zgu@3900:       FREE_C_HEAP_ARRAY(bm_word_t, table, mtInternal);
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
ysr@777: BitMap::idx_t BitMap::num_set_bits(bm_word_t w) {
ysr@777:   idx_t bits = 0;
duke@435: 
ysr@777:   while (w != 0) {
ysr@777:     while ((w & 1) == 0) {
ysr@777:       w >>= 1;
ysr@777:     }
ysr@777:     bits++;
ysr@777:     w >>= 1;
duke@435:   }
ysr@777:   return bits;
ysr@777: }
duke@435: 
ysr@777: BitMap::idx_t BitMap::num_set_bits_from_table(unsigned char c) {
ysr@777:   assert(_pop_count_table != NULL, "precondition");
ysr@777:   return _pop_count_table[c];
ysr@777: }
duke@435: 
ysr@777: BitMap::idx_t BitMap::count_one_bits() const {
ysr@777:   init_pop_count_table(); // If necessary.
ysr@777:   idx_t sum = 0;
ysr@777:   typedef unsigned char uchar;
ysr@777:   for (idx_t i = 0; i < size_in_words(); i++) {
ysr@777:     bm_word_t w = map()[i];
ysr@777:     for (size_t j = 0; j < sizeof(bm_word_t); j++) {
ysr@777:       sum += num_set_bits_from_table(uchar(w & 255));
ysr@777:       w >>= 8;
duke@435:     }
duke@435:   }
ysr@777:   return sum;
duke@435: }
duke@435: 
stefank@4904: void BitMap::print_on_error(outputStream* st, const char* prefix) const {
stefank@4904:   st->print_cr("%s[" PTR_FORMAT ", " PTR_FORMAT ")",
drchase@6680:       prefix, p2i(map()), p2i((char*)map() + (size() >> LogBitsPerByte)));
stefank@4904: }
ysr@777: 
duke@435: #ifndef PRODUCT
duke@435: 
duke@435: void BitMap::print_on(outputStream* st) const {
drchase@6680:   tty->print("Bitmap(" SIZE_FORMAT "):", size());
duke@435:   for (idx_t index = 0; index < size(); index++) {
duke@435:     tty->print("%c", at(index) ? '1' : '0');
duke@435:   }
duke@435:   tty->cr();
duke@435: }
duke@435: 
duke@435: #endif
duke@435: 
duke@435: 
ysr@777: BitMap2D::BitMap2D(bm_word_t* map, idx_t size_in_slots, idx_t bits_per_slot)
duke@435:   : _bits_per_slot(bits_per_slot)
duke@435:   , _map(map, size_in_slots * bits_per_slot)
duke@435: {
duke@435: }
duke@435: 
duke@435: 
duke@435: BitMap2D::BitMap2D(idx_t size_in_slots, idx_t bits_per_slot)
duke@435:   : _bits_per_slot(bits_per_slot)
duke@435:   , _map(size_in_slots * bits_per_slot)
duke@435: {
duke@435: }