Path: blob/aarch64-shenandoah-jdk8u272-b10/hotspot/src/share/vm/memory/blockOffsetTable.inline.hpp
32285 views
/*1* Copyright (c) 2000, 2012, Oracle and/or its affiliates. All rights reserved.2* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.3*4* This code is free software; you can redistribute it and/or modify it5* under the terms of the GNU General Public License version 2 only, as6* published by the Free Software Foundation.7*8* This code is distributed in the hope that it will be useful, but WITHOUT9* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or10* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License11* version 2 for more details (a copy is included in the LICENSE file that12* accompanied this code).13*14* You should have received a copy of the GNU General Public License version15* 2 along with this work; if not, write to the Free Software Foundation,16* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.17*18* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA19* or visit www.oracle.com if you need additional information or have any20* questions.21*22*/2324#ifndef SHARE_VM_MEMORY_BLOCKOFFSETTABLE_INLINE_HPP25#define SHARE_VM_MEMORY_BLOCKOFFSETTABLE_INLINE_HPP2627#include "memory/blockOffsetTable.hpp"28#include "memory/space.hpp"29#include "runtime/safepoint.hpp"3031//////////////////////////////////////////////////////////////////////////32// BlockOffsetTable inlines33//////////////////////////////////////////////////////////////////////////34inline HeapWord* BlockOffsetTable::block_start(const void* addr) const {35if (addr >= _bottom && addr < _end) {36return block_start_unsafe(addr);37} else {38return NULL;39}40}4142//////////////////////////////////////////////////////////////////////////43// BlockOffsetSharedArray inlines44//////////////////////////////////////////////////////////////////////////45inline size_t BlockOffsetSharedArray::index_for(const void* p) const {46char* pc = (char*)p;47assert(pc >= (char*)_reserved.start() &&48pc < (char*)_reserved.end(),49"p not in range.");50size_t delta = pointer_delta(pc, _reserved.start(), sizeof(char));51size_t result = delta >> LogN;52assert(result < _vs.committed_size(), "bad index from address");53return result;54}5556inline HeapWord* BlockOffsetSharedArray::address_for_index(size_t index) const {57assert(index < _vs.committed_size(), "bad index");58HeapWord* result = _reserved.start() + (index << LogN_words);59assert(result >= _reserved.start() && result < _reserved.end(),60"bad address from index");61return result;62}6364inline void BlockOffsetSharedArray::check_reducing_assertion(bool reducing) {65assert(reducing || !SafepointSynchronize::is_at_safepoint() || init_to_zero() ||66Thread::current()->is_VM_thread() ||67Thread::current()->is_ConcurrentGC_thread() ||68((!Thread::current()->is_ConcurrentGC_thread()) &&69ParGCRareEvent_lock->owned_by_self()), "Crack");70}7172//////////////////////////////////////////////////////////////////////////73// BlockOffsetArrayNonContigSpace inlines74//////////////////////////////////////////////////////////////////////////75inline void BlockOffsetArrayNonContigSpace::freed(HeapWord* blk,76size_t size) {77freed(blk, blk + size);78}7980inline void BlockOffsetArrayNonContigSpace::freed(HeapWord* blk_start,81HeapWord* blk_end) {82// Verify that the BOT shows [blk_start, blk_end) to be one block.83verify_single_block(blk_start, blk_end);84// adjust _unallocated_block upward or downward85// as appropriate86if (BlockOffsetArrayUseUnallocatedBlock) {87assert(_unallocated_block <= _end,88"Inconsistent value for _unallocated_block");89if (blk_end >= _unallocated_block && blk_start <= _unallocated_block) {90// CMS-specific note: a block abutting _unallocated_block to91// its left is being freed, a new block is being added or92// we are resetting following a compaction93_unallocated_block = blk_start;94}95}96}9798#endif // SHARE_VM_MEMORY_BLOCKOFFSETTABLE_INLINE_HPP99100101