79 lines
3.2 KiB
C++
79 lines
3.2 KiB
C++
/*
|
|
* Copyright 2000-2002 Sun Microsystems, Inc. All Rights Reserved.
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
*
|
|
* This code is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License version 2 only, as
|
|
* published by the Free Software Foundation.
|
|
*
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
* accompanied this code).
|
|
*
|
|
* You should have received a copy of the GNU General Public License version
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*
|
|
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
* CA 95054 USA or visit www.sun.com if you need additional information or
|
|
* have any questions.
|
|
*
|
|
*/
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
// BlockOffsetTable inlines
|
|
//////////////////////////////////////////////////////////////////////////
|
|
inline HeapWord* BlockOffsetTable::block_start(const void* addr) const {
|
|
if (addr >= _bottom && addr < _end) {
|
|
return block_start_unsafe(addr);
|
|
} else {
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
// BlockOffsetSharedArray inlines
|
|
//////////////////////////////////////////////////////////////////////////
|
|
inline size_t BlockOffsetSharedArray::index_for(const void* p) const {
|
|
char* pc = (char*)p;
|
|
assert(pc >= (char*)_reserved.start() &&
|
|
pc < (char*)_reserved.end(),
|
|
"p not in range.");
|
|
size_t delta = pointer_delta(pc, _reserved.start(), sizeof(char));
|
|
size_t result = delta >> LogN;
|
|
assert(result < _vs.committed_size(), "bad index from address");
|
|
return result;
|
|
}
|
|
|
|
inline HeapWord* BlockOffsetSharedArray::address_for_index(size_t index) const {
|
|
assert(index < _vs.committed_size(), "bad index");
|
|
HeapWord* result = _reserved.start() + (index << LogN_words);
|
|
assert(result >= _reserved.start() && result < _reserved.end(),
|
|
"bad address from index");
|
|
return result;
|
|
}
|
|
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
// BlockOffsetArrayNonContigSpace inlines
|
|
//////////////////////////////////////////////////////////////////////////
|
|
inline void BlockOffsetArrayNonContigSpace::freed(HeapWord* blk_start,
|
|
HeapWord* blk_end) {
|
|
// Verify that the BOT shows [blk_start, blk_end) to be one block.
|
|
verify_single_block(blk_start, blk_end);
|
|
// adjust _unallocated_block upward or downward
|
|
// as appropriate
|
|
if (BlockOffsetArrayUseUnallocatedBlock) {
|
|
assert(_unallocated_block <= _end,
|
|
"Inconsistent value for _unallocated_block");
|
|
if (blk_end >= _unallocated_block && blk_start <= _unallocated_block) {
|
|
// CMS-specific note: a block abutting _unallocated_block to
|
|
// its left is being freed, a new block is being added or
|
|
// we are resetting following a compaction
|
|
_unallocated_block = blk_start;
|
|
}
|
|
}
|
|
}
|