13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "gc/parallel/parMarkBitMap.inline.hpp"
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,
|
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "gc/parallel/parMarkBitMap.inline.hpp"
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/align.hpp"
34 #include "utilities/bitMap.inline.hpp"
35
36 bool
37 ParMarkBitMap::initialize(MemRegion covered_region)
38 {
39 const idx_t bits = bits_required(covered_region);
40 // The bits will be divided evenly between two bitmaps; each of them should be
41 // an integral number of words.
42 assert(bits % (BitsPerWord * 2) == 0, "region size unaligned");
43
44 const size_t words = bits / BitsPerWord;
45 const size_t raw_bytes = words * sizeof(idx_t);
46 const size_t page_sz = os::page_size_for_region_aligned(raw_bytes, 10);
47 const size_t granularity = os::vm_allocation_granularity();
48 _reserved_byte_size = align_up(raw_bytes, MAX2(page_sz, granularity));
49
50 const size_t rs_align = page_sz == (size_t) os::vm_page_size() ? 0 :
51 MAX2(page_sz, granularity);
52 ReservedSpace rs(_reserved_byte_size, rs_align, rs_align > 0);
53 os::trace_page_sizes("Mark Bitmap", raw_bytes, raw_bytes, page_sz,
|