ysr@777: /*
drchase@6680:  * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved.
ysr@777:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
ysr@777:  *
ysr@777:  * This code is free software; you can redistribute it and/or modify it
ysr@777:  * under the terms of the GNU General Public License version 2 only, as
ysr@777:  * published by the Free Software Foundation.
ysr@777:  *
ysr@777:  * This code is distributed in the hope that it will be useful, but WITHOUT
ysr@777:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
ysr@777:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
ysr@777:  * version 2 for more details (a copy is included in the LICENSE file that
ysr@777:  * accompanied this code).
ysr@777:  *
ysr@777:  * You should have received a copy of the GNU General Public License version
ysr@777:  * 2 along with this work; if not, write to the Free Software Foundation,
ysr@777:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
ysr@777:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
ysr@777:  *
ysr@777:  */
ysr@777: 
stefank@2314: #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1BLOCKOFFSETTABLE_INLINE_HPP
stefank@2314: #define SHARE_VM_GC_IMPLEMENTATION_G1_G1BLOCKOFFSETTABLE_INLINE_HPP
stefank@2314: 
stefank@2314: #include "gc_implementation/g1/g1BlockOffsetTable.hpp"
mgerdin@6990: #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
mgerdin@6990: #include "gc_implementation/g1/heapRegion.inline.hpp"
stefank@2314: #include "memory/space.hpp"
stefank@2314: 
ysr@777: inline HeapWord* G1BlockOffsetTable::block_start(const void* addr) {
ysr@777:   if (addr >= _bottom && addr < _end) {
ysr@777:     return block_start_unsafe(addr);
ysr@777:   } else {
ysr@777:     return NULL;
ysr@777:   }
ysr@777: }
ysr@777: 
ysr@777: inline HeapWord*
ysr@777: G1BlockOffsetTable::block_start_const(const void* addr) const {
ysr@777:   if (addr >= _bottom && addr < _end) {
ysr@777:     return block_start_unsafe_const(addr);
ysr@777:   } else {
ysr@777:     return NULL;
ysr@777:   }
ysr@777: }
ysr@777: 
tschatzl@7051: #define check_index(index, msg)                                                \
tschatzl@7051:   assert((index) < (_reserved.word_size() >> LogN_words),                      \
tschatzl@7051:          err_msg("%s - index: "SIZE_FORMAT", _vs.committed_size: "SIZE_FORMAT, \
tschatzl@7051:                  msg, (index), (_reserved.word_size() >> LogN_words)));        \
tschatzl@7051:   assert(G1CollectedHeap::heap()->is_in_exact(address_for_index_raw(index)),   \
tschatzl@7051:          err_msg("Index "SIZE_FORMAT" corresponding to "PTR_FORMAT             \
tschatzl@7051:                  " (%u) is not in committed area.",                            \
tschatzl@7051:                  (index),                                                      \
tschatzl@7051:                  p2i(address_for_index_raw(index)),                            \
tschatzl@7051:                  G1CollectedHeap::heap()->addr_to_region(address_for_index_raw(index))));
tschatzl@7051: 
tschatzl@7051: u_char G1BlockOffsetSharedArray::offset_array(size_t index) const {
tschatzl@7051:   check_index(index, "index out of range");
tschatzl@7051:   return _offset_array[index];
tschatzl@7051: }
tschatzl@7051: 
aph@9697: inline void G1BlockOffsetSharedArray::set_offset_array_raw(size_t index, u_char offset) {
aph@9697:   _offset_array[index] = offset;
aph@9697: }
aph@9697: 
tschatzl@7051: void G1BlockOffsetSharedArray::set_offset_array(size_t index, u_char offset) {
tschatzl@7051:   check_index(index, "index out of range");
tschatzl@7051:   set_offset_array_raw(index, offset);
tschatzl@7051: }
tschatzl@7051: 
tschatzl@7051: void G1BlockOffsetSharedArray::set_offset_array(size_t index, HeapWord* high, HeapWord* low) {
tschatzl@7051:   check_index(index, "index out of range");
tschatzl@7051:   assert(high >= low, "addresses out of order");
tschatzl@7051:   size_t offset = pointer_delta(high, low);
tschatzl@7051:   check_offset(offset, "offset too large");
tschatzl@7051:   set_offset_array(index, (u_char)offset);
tschatzl@7051: }
tschatzl@7051: 
tschatzl@7051: void G1BlockOffsetSharedArray::set_offset_array(size_t left, size_t right, u_char offset) {
tschatzl@7051:   check_index(right, "right index out of range");
tschatzl@7051:   assert(left <= right, "indexes out of order");
tschatzl@7051:   size_t num_cards = right - left + 1;
tschatzl@7051:   if (UseMemSetInBOT) {
aph@9697:     memset(const_cast<u_char*> (&_offset_array[left]), offset, num_cards);
tschatzl@7051:   } else {
tschatzl@7051:     size_t i = left;
tschatzl@7051:     const size_t end = i + num_cards;
tschatzl@7051:     for (; i < end; i++) {
tschatzl@7051:       _offset_array[i] = offset;
tschatzl@7051:     }
tschatzl@7051:   }
tschatzl@7051: }
tschatzl@7051: 
tschatzl@7051: // Variant of index_for that does not check the index for validity.
tschatzl@7051: inline size_t G1BlockOffsetSharedArray::index_for_raw(const void* p) const {
tschatzl@7051:   return pointer_delta((char*)p, _reserved.start(), sizeof(char)) >> LogN;
tschatzl@7051: }
tschatzl@7051: 
ysr@777: inline size_t G1BlockOffsetSharedArray::index_for(const void* p) const {
ysr@777:   char* pc = (char*)p;
ysr@777:   assert(pc >= (char*)_reserved.start() &&
ysr@777:          pc <  (char*)_reserved.end(),
johnc@4300:          err_msg("p (" PTR_FORMAT ") not in reserved [" PTR_FORMAT ", " PTR_FORMAT ")",
drchase@6680:                  p2i(p), p2i(_reserved.start()), p2i(_reserved.end())));
tschatzl@7051:   size_t result = index_for_raw(p);
johnc@4300:   check_index(result, "bad index from address");
ysr@777:   return result;
ysr@777: }
ysr@777: 
ysr@777: inline HeapWord*
ysr@777: G1BlockOffsetSharedArray::address_for_index(size_t index) const {
johnc@4300:   check_index(index, "index out of range");
tschatzl@7051:   HeapWord* result = address_for_index_raw(index);
ysr@777:   assert(result >= _reserved.start() && result < _reserved.end(),
coleenp@4037:          err_msg("bad address from index result " PTR_FORMAT
coleenp@4037:                  " _reserved.start() " PTR_FORMAT " _reserved.end() "
coleenp@4037:                  PTR_FORMAT,
drchase@6680:                  p2i(result), p2i(_reserved.start()), p2i(_reserved.end())));
ysr@777:   return result;
ysr@777: }
ysr@777: 
tschatzl@7051: #undef check_index
tschatzl@7051: 
mgerdin@6987: inline size_t
mgerdin@6987: G1BlockOffsetArray::block_size(const HeapWord* p) const {
mgerdin@6987:   return gsp()->block_size(p);
mgerdin@6987: }
mgerdin@6987: 
ysr@777: inline HeapWord*
ysr@777: G1BlockOffsetArray::block_at_or_preceding(const void* addr,
ysr@777:                                           bool has_max_index,
ysr@777:                                           size_t max_index) const {
ysr@777:   assert(_array->offset_array(0) == 0, "objects can't cross covered areas");
ysr@777:   size_t index = _array->index_for(addr);
ysr@777:   // We must make sure that the offset table entry we use is valid.  If
ysr@777:   // "addr" is past the end, start at the last known one and go forward.
ysr@777:   if (has_max_index) {
ysr@777:     index = MIN2(index, max_index);
ysr@777:   }
ysr@777:   HeapWord* q = _array->address_for_index(index);
ysr@777: 
ysr@777:   uint offset = _array->offset_array(index);  // Extend u_char to uint.
ysr@777:   while (offset >= N_words) {
ysr@777:     // The excess of the offset from N_words indicates a power of Base
ysr@777:     // to go back by.
ysr@777:     size_t n_cards_back = BlockOffsetArray::entry_to_cards_back(offset);
ysr@777:     q -= (N_words * n_cards_back);
mgerdin@6987:     assert(q >= gsp()->bottom(), "Went below bottom!");
ysr@777:     index -= n_cards_back;
ysr@777:     offset = _array->offset_array(index);
ysr@777:   }
ysr@777:   assert(offset < N_words, "offset too large");
ysr@777:   q -= offset;
ysr@777:   return q;
ysr@777: }
ysr@777: 
ysr@777: inline HeapWord*
ysr@777: G1BlockOffsetArray::
ysr@777: forward_to_block_containing_addr_const(HeapWord* q, HeapWord* n,
ysr@777:                                        const void* addr) const {
mgerdin@6987:   if (addr >= gsp()->top()) return gsp()->top();
mgerdin@6987:   while (n <= addr) {
mgerdin@6987:     q = n;
mgerdin@6987:     oop obj = oop(q);
mgerdin@6987:     if (obj->klass_or_null() == NULL) return q;
stefank@6992:     n += block_size(q);
ysr@777:   }
ysr@777:   assert(q <= n, "wrong order for q and addr");
ysr@777:   assert(addr < n, "wrong order for addr and n");
ysr@777:   return q;
ysr@777: }
ysr@777: 
ysr@777: inline HeapWord*
ysr@777: G1BlockOffsetArray::forward_to_block_containing_addr(HeapWord* q,
ysr@777:                                                      const void* addr) {
ysr@1280:   if (oop(q)->klass_or_null() == NULL) return q;
mgerdin@6987:   HeapWord* n = q + block_size(q);
ysr@777:   // In the normal case, where the query "addr" is a card boundary, and the
ysr@777:   // offset table chunks are the same size as cards, the block starting at
ysr@777:   // "q" will contain addr, so the test below will fail, and we'll fall
ysr@777:   // through quickly.
ysr@777:   if (n <= addr) {
ysr@777:     q = forward_to_block_containing_addr_slow(q, n, addr);
ysr@777:   }
ysr@777:   assert(q <= addr, "wrong order for current and arg");
ysr@777:   return q;
ysr@777: }
ysr@777: 
stefank@2314: #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1BLOCKOFFSETTABLE_INLINE_HPP