24
25 #include "precompiled.hpp"
26 #include "gc_implementation/parallelScavenge/parMarkBitMap.hpp"
27 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
28 #include "oops/oop.inline.hpp"
29 #include "runtime/atomic.inline.hpp"
30 #include "runtime/os.hpp"
31 #include "utilities/bitMap.inline.hpp"
32 #include "services/memTracker.hpp"
33
34 bool
35 ParMarkBitMap::initialize(MemRegion covered_region)
36 {
37 const idx_t bits = bits_required(covered_region);
38 // The bits will be divided evenly between two bitmaps; each of them should be
39 // an integral number of words.
40 assert(bits % (BitsPerWord * 2) == 0, "region size unaligned");
41
42 const size_t words = bits / BitsPerWord;
43 const size_t raw_bytes = words * sizeof(idx_t);
44 const size_t page_sz = os::page_size_for_region(raw_bytes, 10);
45 const size_t granularity = os::vm_allocation_granularity();
46 _reserved_byte_size = align_size_up(raw_bytes, MAX2(page_sz, granularity));
47
48 const size_t rs_align = page_sz == (size_t) os::vm_page_size() ? 0 :
49 MAX2(page_sz, granularity);
50 ReservedSpace rs(_reserved_byte_size, rs_align, rs_align > 0);
51 os::trace_page_sizes("par bitmap", raw_bytes, raw_bytes, page_sz,
52 rs.base(), rs.size());
53
54 MemTracker::record_virtual_memory_type((address)rs.base(), mtGC);
55
56 _virtual_space = new PSVirtualSpace(rs, page_sz);
57 if (_virtual_space != NULL && _virtual_space->expand_by(_reserved_byte_size)) {
58 _region_start = covered_region.start();
59 _region_size = covered_region.word_size();
60 BitMap::bm_word_t* map = (BitMap::bm_word_t*)_virtual_space->reserved_low_addr();
61 _beg_bits.set_map(map);
62 _beg_bits.set_size(bits / 2);
63 _end_bits.set_map(map + words / 2);
64 _end_bits.set_size(bits / 2);
|
24
25 #include "precompiled.hpp"
26 #include "gc_implementation/parallelScavenge/parMarkBitMap.hpp"
27 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
28 #include "oops/oop.inline.hpp"
29 #include "runtime/atomic.inline.hpp"
30 #include "runtime/os.hpp"
31 #include "utilities/bitMap.inline.hpp"
32 #include "services/memTracker.hpp"
33
34 bool
35 ParMarkBitMap::initialize(MemRegion covered_region)
36 {
37 const idx_t bits = bits_required(covered_region);
38 // The bits will be divided evenly between two bitmaps; each of them should be
39 // an integral number of words.
40 assert(bits % (BitsPerWord * 2) == 0, "region size unaligned");
41
42 const size_t words = bits / BitsPerWord;
43 const size_t raw_bytes = words * sizeof(idx_t);
44 const size_t page_sz = os::page_size_for_region_aligned(raw_bytes, 10);
45 const size_t granularity = os::vm_allocation_granularity();
46 _reserved_byte_size = align_size_up(raw_bytes, MAX2(page_sz, granularity));
47
48 const size_t rs_align = page_sz == (size_t) os::vm_page_size() ? 0 :
49 MAX2(page_sz, granularity);
50 ReservedSpace rs(_reserved_byte_size, rs_align, rs_align > 0);
51 os::trace_page_sizes("par bitmap", raw_bytes, raw_bytes, page_sz,
52 rs.base(), rs.size());
53
54 MemTracker::record_virtual_memory_type((address)rs.base(), mtGC);
55
56 _virtual_space = new PSVirtualSpace(rs, page_sz);
57 if (_virtual_space != NULL && _virtual_space->expand_by(_reserved_byte_size)) {
58 _region_start = covered_region.start();
59 _region_size = covered_region.word_size();
60 BitMap::bm_word_t* map = (BitMap::bm_word_t*)_virtual_space->reserved_low_addr();
61 _beg_bits.set_map(map);
62 _beg_bits.set_size(bits / 2);
63 _end_bits.set_map(map + words / 2);
64 _end_bits.set_size(bits / 2);
|