1.1 --- a/src/share/vm/gc_implementation/parallelScavenge/parMarkBitMap.hpp Wed Jun 04 13:51:09 2008 -0700
1.2 +++ b/src/share/vm/gc_implementation/parallelScavenge/parMarkBitMap.hpp Thu Jun 05 15:57:56 2008 -0700
1.3 @@ -192,16 +192,16 @@
1.4 };
1.5
1.6 inline ParMarkBitMap::ParMarkBitMap():
1.7 - _beg_bits(NULL, 0),
1.8 - _end_bits(NULL, 0)
1.9 + _beg_bits(),
1.10 + _end_bits()
1.11 {
1.12 _region_start = 0;
1.13 _virtual_space = 0;
1.14 }
1.15
1.16 inline ParMarkBitMap::ParMarkBitMap(MemRegion covered_region):
1.17 - _beg_bits(NULL, 0),
1.18 - _end_bits(NULL, 0)
1.19 + _beg_bits(),
1.20 + _end_bits()
1.21 {
1.22 initialize(covered_region);
1.23 }
1.24 @@ -325,7 +325,7 @@
1.25
1.26 inline size_t ParMarkBitMap::obj_size(idx_t beg_bit) const
1.27 {
1.28 - const idx_t end_bit = _end_bits.find_next_one_bit(beg_bit, size());
1.29 + const idx_t end_bit = _end_bits.get_next_one_offset_inline(beg_bit, size());
1.30 assert(is_marked(beg_bit), "obj not marked");
1.31 assert(end_bit < size(), "end bit missing");
1.32 return obj_size(beg_bit, end_bit);
1.33 @@ -384,13 +384,13 @@
1.34 inline ParMarkBitMap::idx_t
1.35 ParMarkBitMap::find_obj_beg(idx_t beg, idx_t end) const
1.36 {
1.37 - return _beg_bits.find_next_one_bit(beg, end);
1.38 + return _beg_bits.get_next_one_offset_inline_aligned_right(beg, end);
1.39 }
1.40
1.41 inline ParMarkBitMap::idx_t
1.42 ParMarkBitMap::find_obj_end(idx_t beg, idx_t end) const
1.43 {
1.44 - return _end_bits.find_next_one_bit(beg, end);
1.45 + return _end_bits.get_next_one_offset_inline_aligned_right(beg, end);
1.46 }
1.47
1.48 inline HeapWord*
