|
1 /* |
|
2 * Copyright 2000-2002 Sun Microsystems, Inc. All Rights Reserved. |
|
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
|
4 * |
|
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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
|
20 * CA 95054 USA or visit www.sun.com if you need additional information or |
|
21 * have any 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)); |
|
45 size_t result = delta >> LogN; |
|
46 assert(result < _vs.committed_size(), "bad index from address"); |
|
47 return result; |
|
48 } |
|
49 |
|
50 inline HeapWord* BlockOffsetSharedArray::address_for_index(size_t index) const { |
|
51 assert(index < _vs.committed_size(), "bad index"); |
|
52 HeapWord* result = _reserved.start() + (index << LogN_words); |
|
53 assert(result >= _reserved.start() && result < _reserved.end(), |
|
54 "bad address from index"); |
|
55 return result; |
|
56 } |
|
57 |
|
58 |
|
59 ////////////////////////////////////////////////////////////////////////// |
|
60 // BlockOffsetArrayNonContigSpace inlines |
|
61 ////////////////////////////////////////////////////////////////////////// |
|
62 inline void BlockOffsetArrayNonContigSpace::freed(HeapWord* blk_start, |
|
63 HeapWord* blk_end) { |
|
64 // Verify that the BOT shows [blk_start, blk_end) to be one block. |
|
65 verify_single_block(blk_start, blk_end); |
|
66 // adjust _unallocated_block upward or downward |
|
67 // as appropriate |
|
68 if (BlockOffsetArrayUseUnallocatedBlock) { |
|
69 assert(_unallocated_block <= _end, |
|
70 "Inconsistent value for _unallocated_block"); |
|
71 if (blk_end >= _unallocated_block && blk_start <= _unallocated_block) { |
|
72 // CMS-specific note: a block abutting _unallocated_block to |
|
73 // its left is being freed, a new block is being added or |
|
74 // we are resetting following a compaction |
|
75 _unallocated_block = blk_start; |
|
76 } |
|
77 } |
|
78 } |