5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
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 //////////////////////////////////////////////////////////////////////////
26 // BlockOffsetTable inlines
27 //////////////////////////////////////////////////////////////////////////
28 inline HeapWord* BlockOffsetTable::block_start(const void* addr) const {
29 if (addr >= _bottom && addr < _end) {
30 return block_start_unsafe(addr);
31 } else {
32 return NULL;
33 }
34 }
35
36 //////////////////////////////////////////////////////////////////////////
37 // BlockOffsetSharedArray inlines
38 //////////////////////////////////////////////////////////////////////////
39 inline size_t BlockOffsetSharedArray::index_for(const void* p) const {
40 char* pc = (char*)p;
41 assert(pc >= (char*)_reserved.start() &&
42 pc < (char*)_reserved.end(),
43 "p not in range.");
44 size_t delta = pointer_delta(pc, _reserved.start(), sizeof(char));
71 freed(blk, blk + size);
72 }
73
74 inline void BlockOffsetArrayNonContigSpace::freed(HeapWord* blk_start,
75 HeapWord* blk_end) {
76 // Verify that the BOT shows [blk_start, blk_end) to be one block.
77 verify_single_block(blk_start, blk_end);
78 // adjust _unallocated_block upward or downward
79 // as appropriate
80 if (BlockOffsetArrayUseUnallocatedBlock) {
81 assert(_unallocated_block <= _end,
82 "Inconsistent value for _unallocated_block");
83 if (blk_end >= _unallocated_block && blk_start <= _unallocated_block) {
84 // CMS-specific note: a block abutting _unallocated_block to
85 // its left is being freed, a new block is being added or
86 // we are resetting following a compaction
87 _unallocated_block = blk_start;
88 }
89 }
90 }
|
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
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 #ifndef SHARE_VM_MEMORY_BLOCKOFFSETTABLE_INLINE_HPP
26 #define SHARE_VM_MEMORY_BLOCKOFFSETTABLE_INLINE_HPP
27
28 #include "memory/blockOffsetTable.hpp"
29 #include "memory/space.hpp"
30 #include "runtime/safepoint.hpp"
31 #ifndef SERIALGC
32 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.hpp"
33 #endif
34
35 //////////////////////////////////////////////////////////////////////////
36 // BlockOffsetTable inlines
37 //////////////////////////////////////////////////////////////////////////
38 inline HeapWord* BlockOffsetTable::block_start(const void* addr) const {
39 if (addr >= _bottom && addr < _end) {
40 return block_start_unsafe(addr);
41 } else {
42 return NULL;
43 }
44 }
45
46 //////////////////////////////////////////////////////////////////////////
47 // BlockOffsetSharedArray inlines
48 //////////////////////////////////////////////////////////////////////////
49 inline size_t BlockOffsetSharedArray::index_for(const void* p) const {
50 char* pc = (char*)p;
51 assert(pc >= (char*)_reserved.start() &&
52 pc < (char*)_reserved.end(),
53 "p not in range.");
54 size_t delta = pointer_delta(pc, _reserved.start(), sizeof(char));
81 freed(blk, blk + size);
82 }
83
84 inline void BlockOffsetArrayNonContigSpace::freed(HeapWord* blk_start,
85 HeapWord* blk_end) {
86 // Verify that the BOT shows [blk_start, blk_end) to be one block.
87 verify_single_block(blk_start, blk_end);
88 // adjust _unallocated_block upward or downward
89 // as appropriate
90 if (BlockOffsetArrayUseUnallocatedBlock) {
91 assert(_unallocated_block <= _end,
92 "Inconsistent value for _unallocated_block");
93 if (blk_end >= _unallocated_block && blk_start <= _unallocated_block) {
94 // CMS-specific note: a block abutting _unallocated_block to
95 // its left is being freed, a new block is being added or
96 // we are resetting following a compaction
97 _unallocated_block = blk_start;
98 }
99 }
100 }
101
102 #endif // SHARE_VM_MEMORY_BLOCKOFFSETTABLE_INLINE_HPP
|