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