1.1 --- a/src/share/vm/gc_implementation/parallelScavenge/parMarkBitMap.hpp Sun May 19 20:31:30 2013 +0200
1.2 +++ b/src/share/vm/gc_implementation/parallelScavenge/parMarkBitMap.hpp Mon May 20 10:44:33 2013 -0700
1.3 @@ -1,5 +1,5 @@
1.4 /*
1.5 - * Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved.
1.6 + * Copyright (c) 2005, 2013, Oracle and/or its affiliates. All rights reserved.
1.7 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.8 *
1.9 * This code is free software; you can redistribute it and/or modify it
1.10 @@ -131,6 +131,8 @@
1.11 inline size_t region_size() const;
1.12 inline size_t size() const;
1.13
1.14 + size_t reserved_byte_size() const { return _reserved_byte_size; }
1.15 +
1.16 // Convert a heap address to/from a bit index.
1.17 inline idx_t addr_to_bit(HeapWord* addr) const;
1.18 inline HeapWord* bit_to_addr(idx_t bit) const;
1.19 @@ -176,10 +178,11 @@
1.20 BitMap _beg_bits;
1.21 BitMap _end_bits;
1.22 PSVirtualSpace* _virtual_space;
1.23 + size_t _reserved_byte_size;
1.24 };
1.25
1.26 inline ParMarkBitMap::ParMarkBitMap():
1.27 - _beg_bits(), _end_bits(), _region_start(NULL), _region_size(0), _virtual_space(NULL)
1.28 + _beg_bits(), _end_bits(), _region_start(NULL), _region_size(0), _virtual_space(NULL), _reserved_byte_size(0)
1.29 { }
1.30
1.31 inline void ParMarkBitMap::clear_range(idx_t beg, idx_t end)
