aoqi@0: /*
aoqi@0:  * Copyright (c) 2005, 2013, Oracle and/or its affiliates. All rights reserved.
aoqi@0:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0:  *
aoqi@0:  * This code is free software; you can redistribute it and/or modify it
aoqi@0:  * under the terms of the GNU General Public License version 2 only, as
aoqi@0:  * published by the Free Software Foundation.
aoqi@0:  *
aoqi@0:  * This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
aoqi@0:  * version 2 for more details (a copy is included in the LICENSE file that
aoqi@0:  * accompanied this code).
aoqi@0:  *
aoqi@0:  * You should have received a copy of the GNU General Public License version
aoqi@0:  * 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0:  *
aoqi@0:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0:  * or visit www.oracle.com if you need additional information or have any
aoqi@0:  * questions.
aoqi@0:  *
aoqi@0:  */
aoqi@0: 
aoqi@0: #include "precompiled.hpp"
aoqi@0: #include "gc_implementation/parallelScavenge/parMarkBitMap.hpp"
aoqi@0: #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
aoqi@0: #include "oops/oop.inline.hpp"
aoqi@0: #include "runtime/os.hpp"
aoqi@0: #include "utilities/bitMap.inline.hpp"
aoqi@0: #include "services/memTracker.hpp"
aoqi@0: #ifdef TARGET_OS_FAMILY_linux
aoqi@0: # include "os_linux.inline.hpp"
aoqi@0: #endif
aoqi@0: #ifdef TARGET_OS_FAMILY_solaris
aoqi@0: # include "os_solaris.inline.hpp"
aoqi@0: #endif
aoqi@0: #ifdef TARGET_OS_FAMILY_windows
aoqi@0: # include "os_windows.inline.hpp"
aoqi@0: #endif
aoqi@0: #ifdef TARGET_OS_FAMILY_aix
aoqi@0: # include "os_aix.inline.hpp"
aoqi@0: #endif
aoqi@0: #ifdef TARGET_OS_FAMILY_bsd
aoqi@0: # include "os_bsd.inline.hpp"
aoqi@0: #endif
aoqi@0: 
aoqi@0: bool
aoqi@0: ParMarkBitMap::initialize(MemRegion covered_region)
aoqi@0: {
aoqi@0:   const idx_t bits = bits_required(covered_region);
aoqi@0:   // The bits will be divided evenly between two bitmaps; each of them should be
aoqi@0:   // an integral number of words.
aoqi@0:   assert(bits % (BitsPerWord * 2) == 0, "region size unaligned");
aoqi@0: 
aoqi@0:   const size_t words = bits / BitsPerWord;
aoqi@0:   const size_t raw_bytes = words * sizeof(idx_t);
aoqi@0:   const size_t page_sz = os::page_size_for_region(raw_bytes, raw_bytes, 10);
aoqi@0:   const size_t granularity = os::vm_allocation_granularity();
aoqi@0:   _reserved_byte_size = align_size_up(raw_bytes, MAX2(page_sz, granularity));
aoqi@0: 
aoqi@0:   const size_t rs_align = page_sz == (size_t) os::vm_page_size() ? 0 :
aoqi@0:     MAX2(page_sz, granularity);
aoqi@0:   ReservedSpace rs(_reserved_byte_size, rs_align, rs_align > 0);
aoqi@0:   os::trace_page_sizes("par bitmap", raw_bytes, raw_bytes, page_sz,
aoqi@0:                        rs.base(), rs.size());
aoqi@0: 
aoqi@0:   MemTracker::record_virtual_memory_type((address)rs.base(), mtGC);
aoqi@0: 
aoqi@0:   _virtual_space = new PSVirtualSpace(rs, page_sz);
aoqi@0:   if (_virtual_space != NULL && _virtual_space->expand_by(_reserved_byte_size)) {
aoqi@0:     _region_start = covered_region.start();
aoqi@0:     _region_size = covered_region.word_size();
aoqi@0:     idx_t* map = (idx_t*)_virtual_space->reserved_low_addr();
aoqi@0:     _beg_bits.set_map(map);
aoqi@0:     _beg_bits.set_size(bits / 2);
aoqi@0:     _end_bits.set_map(map + words / 2);
aoqi@0:     _end_bits.set_size(bits / 2);
aoqi@0:     return true;
aoqi@0:   }
aoqi@0: 
aoqi@0:   _region_start = 0;
aoqi@0:   _region_size = 0;
aoqi@0:   if (_virtual_space != NULL) {
aoqi@0:     delete _virtual_space;
aoqi@0:     _virtual_space = NULL;
aoqi@0:     // Release memory reserved in the space.
aoqi@0:     rs.release();
aoqi@0:   }
aoqi@0:   return false;
aoqi@0: }
aoqi@0: 
aoqi@0: #ifdef ASSERT
aoqi@0: extern size_t mark_bitmap_count;
aoqi@0: extern size_t mark_bitmap_size;
aoqi@0: #endif  // #ifdef ASSERT
aoqi@0: 
aoqi@0: bool
aoqi@0: ParMarkBitMap::mark_obj(HeapWord* addr, size_t size)
aoqi@0: {
aoqi@0:   const idx_t beg_bit = addr_to_bit(addr);
aoqi@0:   if (_beg_bits.par_set_bit(beg_bit)) {
aoqi@0:     const idx_t end_bit = addr_to_bit(addr + size - 1);
aoqi@0:     bool end_bit_ok = _end_bits.par_set_bit(end_bit);
aoqi@0:     assert(end_bit_ok, "concurrency problem");
aoqi@0:     DEBUG_ONLY(Atomic::inc_ptr(&mark_bitmap_count));
aoqi@0:     DEBUG_ONLY(Atomic::add_ptr(size, &mark_bitmap_size));
aoqi@0:     return true;
aoqi@0:   }
aoqi@0:   return false;
aoqi@0: }
aoqi@0: 
aoqi@0: size_t ParMarkBitMap::live_words_in_range(HeapWord* beg_addr, oop end_obj) const
aoqi@0: {
aoqi@0:   assert(beg_addr <= (HeapWord*)end_obj, "bad range");
aoqi@0:   assert(is_marked(end_obj), "end_obj must be live");
aoqi@0: 
aoqi@0:   idx_t live_bits = 0;
aoqi@0: 
aoqi@0:   // The bitmap routines require the right boundary to be word-aligned.
aoqi@0:   const idx_t end_bit = addr_to_bit((HeapWord*)end_obj);
aoqi@0:   const idx_t range_end = BitMap::word_align_up(end_bit);
aoqi@0: 
aoqi@0:   idx_t beg_bit = find_obj_beg(addr_to_bit(beg_addr), range_end);
aoqi@0:   while (beg_bit < end_bit) {
aoqi@0:     idx_t tmp_end = find_obj_end(beg_bit, range_end);
aoqi@0:     assert(tmp_end < end_bit, "missing end bit");
aoqi@0:     live_bits += tmp_end - beg_bit + 1;
aoqi@0:     beg_bit = find_obj_beg(tmp_end + 1, range_end);
aoqi@0:   }
aoqi@0:   return bits_to_words(live_bits);
aoqi@0: }
aoqi@0: 
aoqi@0: ParMarkBitMap::IterationStatus
aoqi@0: ParMarkBitMap::iterate(ParMarkBitMapClosure* live_closure,
aoqi@0:                        idx_t range_beg, idx_t range_end) const
aoqi@0: {
aoqi@0:   DEBUG_ONLY(verify_bit(range_beg);)
aoqi@0:   DEBUG_ONLY(verify_bit(range_end);)
aoqi@0:   assert(range_beg <= range_end, "live range invalid");
aoqi@0: 
aoqi@0:   // The bitmap routines require the right boundary to be word-aligned.
aoqi@0:   const idx_t search_end = BitMap::word_align_up(range_end);
aoqi@0: 
aoqi@0:   idx_t cur_beg = find_obj_beg(range_beg, search_end);
aoqi@0:   while (cur_beg < range_end) {
aoqi@0:     const idx_t cur_end = find_obj_end(cur_beg, search_end);
aoqi@0:     if (cur_end >= range_end) {
aoqi@0:       // The obj ends outside the range.
aoqi@0:       live_closure->set_source(bit_to_addr(cur_beg));
aoqi@0:       return incomplete;
aoqi@0:     }
aoqi@0: 
aoqi@0:     const size_t size = obj_size(cur_beg, cur_end);
aoqi@0:     IterationStatus status = live_closure->do_addr(bit_to_addr(cur_beg), size);
aoqi@0:     if (status != incomplete) {
aoqi@0:       assert(status == would_overflow || status == full, "sanity");
aoqi@0:       return status;
aoqi@0:     }
aoqi@0: 
aoqi@0:     // Successfully processed the object; look for the next object.
aoqi@0:     cur_beg = find_obj_beg(cur_end + 1, search_end);
aoqi@0:   }
aoqi@0: 
aoqi@0:   live_closure->set_source(bit_to_addr(range_end));
aoqi@0:   return complete;
aoqi@0: }
aoqi@0: 
aoqi@0: ParMarkBitMap::IterationStatus
aoqi@0: ParMarkBitMap::iterate(ParMarkBitMapClosure* live_closure,
aoqi@0:                        ParMarkBitMapClosure* dead_closure,
aoqi@0:                        idx_t range_beg, idx_t range_end,
aoqi@0:                        idx_t dead_range_end) const
aoqi@0: {
aoqi@0:   DEBUG_ONLY(verify_bit(range_beg);)
aoqi@0:   DEBUG_ONLY(verify_bit(range_end);)
aoqi@0:   DEBUG_ONLY(verify_bit(dead_range_end);)
aoqi@0:   assert(range_beg <= range_end, "live range invalid");
aoqi@0:   assert(range_end <= dead_range_end, "dead range invalid");
aoqi@0: 
aoqi@0:   // The bitmap routines require the right boundary to be word-aligned.
aoqi@0:   const idx_t live_search_end = BitMap::word_align_up(range_end);
aoqi@0:   const idx_t dead_search_end = BitMap::word_align_up(dead_range_end);
aoqi@0: 
aoqi@0:   idx_t cur_beg = range_beg;
aoqi@0:   if (range_beg < range_end && is_unmarked(range_beg)) {
aoqi@0:     // The range starts with dead space.  Look for the next object, then fill.
aoqi@0:     cur_beg = find_obj_beg(range_beg + 1, dead_search_end);
aoqi@0:     const idx_t dead_space_end = MIN2(cur_beg - 1, dead_range_end - 1);
aoqi@0:     const size_t size = obj_size(range_beg, dead_space_end);
aoqi@0:     dead_closure->do_addr(bit_to_addr(range_beg), size);
aoqi@0:   }
aoqi@0: 
aoqi@0:   while (cur_beg < range_end) {
aoqi@0:     const idx_t cur_end = find_obj_end(cur_beg, live_search_end);
aoqi@0:     if (cur_end >= range_end) {
aoqi@0:       // The obj ends outside the range.
aoqi@0:       live_closure->set_source(bit_to_addr(cur_beg));
aoqi@0:       return incomplete;
aoqi@0:     }
aoqi@0: 
aoqi@0:     const size_t size = obj_size(cur_beg, cur_end);
aoqi@0:     IterationStatus status = live_closure->do_addr(bit_to_addr(cur_beg), size);
aoqi@0:     if (status != incomplete) {
aoqi@0:       assert(status == would_overflow || status == full, "sanity");
aoqi@0:       return status;
aoqi@0:     }
aoqi@0: 
aoqi@0:     // Look for the start of the next object.
aoqi@0:     const idx_t dead_space_beg = cur_end + 1;
aoqi@0:     cur_beg = find_obj_beg(dead_space_beg, dead_search_end);
aoqi@0:     if (cur_beg > dead_space_beg) {
aoqi@0:       // Found dead space; compute the size and invoke the dead closure.
aoqi@0:       const idx_t dead_space_end = MIN2(cur_beg - 1, dead_range_end - 1);
aoqi@0:       const size_t size = obj_size(dead_space_beg, dead_space_end);
aoqi@0:       dead_closure->do_addr(bit_to_addr(dead_space_beg), size);
aoqi@0:     }
aoqi@0:   }
aoqi@0: 
aoqi@0:   live_closure->set_source(bit_to_addr(range_end));
aoqi@0:   return complete;
aoqi@0: }
aoqi@0: 
aoqi@0: #ifdef ASSERT
aoqi@0: void ParMarkBitMap::verify_clear() const
aoqi@0: {
aoqi@0:   const idx_t* const beg = (const idx_t*)_virtual_space->committed_low_addr();
aoqi@0:   const idx_t* const end = (const idx_t*)_virtual_space->committed_high_addr();
aoqi@0:   for (const idx_t* p = beg; p < end; ++p) {
aoqi@0:     assert(*p == 0, "bitmap not clear");
aoqi@0:   }
aoqi@0: }
aoqi@0: #endif  // #ifdef ASSERT