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: #include "precompiled.hpp" stefank@2314: #include "gc_implementation/g1/g1BlockOffsetTable.inline.hpp" mgerdin@6987: #include "gc_implementation/g1/heapRegion.hpp" stefank@2314: #include "memory/space.hpp" stefank@2314: #include "oops/oop.inline.hpp" stefank@2314: #include "runtime/java.hpp" zgu@3900: #include "services/memTracker.hpp" ysr@777: drchase@6680: PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC drchase@6680: ysr@777: ////////////////////////////////////////////////////////////////////// ysr@777: // G1BlockOffsetSharedArray ysr@777: ////////////////////////////////////////////////////////////////////// ysr@777: tschatzl@7051: G1BlockOffsetSharedArray::G1BlockOffsetSharedArray(MemRegion heap, G1RegionToSpaceMapper* storage) : tschatzl@7051: _reserved(), _end(NULL), _listener(), _offset_array(NULL) { zgu@3900: tschatzl@7051: _reserved = heap; tschatzl@7051: _end = NULL; zgu@3900: tschatzl@7051: MemRegion bot_reserved = storage->reserved(); tschatzl@7051: tschatzl@7051: _offset_array = (u_char*)bot_reserved.start(); tschatzl@7051: _end = _reserved.end(); tschatzl@7051: tschatzl@7051: storage->set_mapping_changed_listener(&_listener); tschatzl@7051: ysr@777: if (TraceBlockOffsetTable) { ysr@777: gclog_or_tty->print_cr("G1BlockOffsetSharedArray::G1BlockOffsetSharedArray: "); ysr@777: gclog_or_tty->print_cr(" " ysr@777: " rs.base(): " INTPTR_FORMAT ysr@777: " rs.size(): " INTPTR_FORMAT ysr@777: " rs end(): " INTPTR_FORMAT, tschatzl@7051: bot_reserved.start(), bot_reserved.byte_size(), bot_reserved.end()); ysr@777: } ysr@777: } ysr@777: ysr@777: bool G1BlockOffsetSharedArray::is_card_boundary(HeapWord* p) const { ysr@777: assert(p >= _reserved.start(), "just checking"); ysr@777: size_t delta = pointer_delta(p, _reserved.start()); ysr@777: return (delta & right_n_bits(LogN_words)) == (size_t)NoBits; ysr@777: } ysr@777: ysr@777: ////////////////////////////////////////////////////////////////////// ysr@777: // G1BlockOffsetArray ysr@777: ////////////////////////////////////////////////////////////////////// ysr@777: ysr@777: G1BlockOffsetArray::G1BlockOffsetArray(G1BlockOffsetSharedArray* array, brutisso@7256: MemRegion mr) : ysr@777: G1BlockOffsetTable(mr.start(), mr.end()), ysr@777: _unallocated_block(_bottom), brutisso@7256: _array(array), _gsp(NULL) { ysr@777: assert(_bottom <= _end, "arguments out of order"); ysr@777: } ysr@777: mgerdin@6987: void G1BlockOffsetArray::set_space(G1OffsetTableContigSpace* sp) { mgerdin@6987: _gsp = sp; ysr@777: } ysr@777: ysr@777: // The arguments follow the normal convention of denoting ysr@777: // a right-open interval: [start, end) ysr@777: void ysr@777: G1BlockOffsetArray:: set_remainder_to_point_to_start(HeapWord* start, HeapWord* end) { ysr@777: ysr@777: if (start >= end) { ysr@777: // The start address is equal to the end address (or to ysr@777: // the right of the end address) so there are not cards ysr@777: // that need to be updated.. ysr@777: return; ysr@777: } ysr@777: ysr@777: // Write the backskip value for each region. ysr@777: // ysr@777: // offset ysr@777: // card 2nd 3rd ysr@777: // | +- 1st | | ysr@777: // v v v v ysr@777: // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+- ysr@777: // |x|0|0|0|0|0|0|0|1|1|1|1|1|1| ... |1|1|1|1|2|2|2|2|2|2| ... ysr@777: // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+- ysr@777: // 11 19 75 ysr@777: // 12 ysr@777: // ysr@777: // offset card is the card that points to the start of an object ysr@777: // x - offset value of offset card ysr@777: // 1st - start of first logarithmic region ysr@777: // 0 corresponds to logarithmic value N_words + 0 and 2**(3 * 0) = 1 ysr@777: // 2nd - start of second logarithmic region ysr@777: // 1 corresponds to logarithmic value N_words + 1 and 2**(3 * 1) = 8 ysr@777: // 3rd - start of third logarithmic region ysr@777: // 2 corresponds to logarithmic value N_words + 2 and 2**(3 * 2) = 64 ysr@777: // ysr@777: // integer below the block offset entry is an example of ysr@777: // the index of the entry ysr@777: // ysr@777: // Given an address, ysr@777: // Find the index for the address ysr@777: // Find the block offset table entry ysr@777: // Convert the entry to a back slide ysr@777: // (e.g., with today's, offset = 0x81 => ysr@777: // back slip = 2**(3*(0x81 - N_words)) = 2**3) = 8 ysr@777: // Move back N (e.g., 8) entries and repeat with the ysr@777: // value of the new entry ysr@777: // ysr@777: size_t start_card = _array->index_for(start); ysr@777: size_t end_card = _array->index_for(end-1); ysr@777: assert(start ==_array->address_for_index(start_card), "Precondition"); ysr@777: assert(end ==_array->address_for_index(end_card)+N_words, "Precondition"); ysr@777: set_remainder_to_point_to_start_incl(start_card, end_card); // closed interval ysr@777: } ysr@777: ysr@777: // Unlike the normal convention in this code, the argument here denotes ysr@777: // a closed, inclusive interval: [start_card, end_card], cf set_remainder_to_point_to_start() ysr@777: // above. ysr@777: void ysr@777: G1BlockOffsetArray::set_remainder_to_point_to_start_incl(size_t start_card, size_t end_card) { ysr@777: if (start_card > end_card) { ysr@777: return; ysr@777: } ysr@777: assert(start_card > _array->index_for(_bottom), "Cannot be first card"); ysr@777: assert(_array->offset_array(start_card-1) <= N_words, tonyp@2241: "Offset card has an unexpected value"); ysr@777: size_t start_card_for_region = start_card; ysr@777: u_char offset = max_jubyte; ysr@777: for (int i = 0; i < BlockOffsetArray::N_powers; i++) { ysr@777: // -1 so that the the card with the actual offset is counted. Another -1 ysr@777: // so that the reach ends in this region and not at the start ysr@777: // of the next. ysr@777: size_t reach = start_card - 1 + (BlockOffsetArray::power_to_cards_back(i+1) - 1); ysr@777: offset = N_words + i; ysr@777: if (reach >= end_card) { ysr@777: _array->set_offset_array(start_card_for_region, end_card, offset); ysr@777: start_card_for_region = reach + 1; ysr@777: break; ysr@777: } ysr@777: _array->set_offset_array(start_card_for_region, reach, offset); ysr@777: start_card_for_region = reach + 1; ysr@777: } ysr@777: assert(start_card_for_region > end_card, "Sanity check"); ysr@777: DEBUG_ONLY(check_all_cards(start_card, end_card);) ysr@777: } ysr@777: ysr@777: // The card-interval [start_card, end_card] is a closed interval; this ysr@777: // is an expensive check -- use with care and only under protection of ysr@777: // suitable flag. ysr@777: void G1BlockOffsetArray::check_all_cards(size_t start_card, size_t end_card) const { ysr@777: ysr@777: if (end_card < start_card) { ysr@777: return; ysr@777: } ysr@777: guarantee(_array->offset_array(start_card) == N_words, "Wrong value in second card"); ysr@777: for (size_t c = start_card + 1; c <= end_card; c++ /* yeah! */) { ysr@777: u_char entry = _array->offset_array(c); ysr@777: if (c - start_card > BlockOffsetArray::power_to_cards_back(1)) { johnc@4300: guarantee(entry > N_words, johnc@4300: err_msg("Should be in logarithmic region - " johnc@4300: "entry: " UINT32_FORMAT ", " johnc@4300: "_array->offset_array(c): " UINT32_FORMAT ", " johnc@4300: "N_words: " UINT32_FORMAT, johnc@4300: entry, _array->offset_array(c), N_words)); ysr@777: } ysr@777: size_t backskip = BlockOffsetArray::entry_to_cards_back(entry); ysr@777: size_t landing_card = c - backskip; ysr@777: guarantee(landing_card >= (start_card - 1), "Inv"); ysr@777: if (landing_card >= start_card) { johnc@4300: guarantee(_array->offset_array(landing_card) <= entry, johnc@4300: err_msg("Monotonicity - landing_card offset: " UINT32_FORMAT ", " johnc@4300: "entry: " UINT32_FORMAT, johnc@4300: _array->offset_array(landing_card), entry)); ysr@777: } else { ysr@777: guarantee(landing_card == start_card - 1, "Tautology"); johnc@4300: // Note that N_words is the maximum offset value johnc@4300: guarantee(_array->offset_array(landing_card) <= N_words, johnc@4300: err_msg("landing card offset: " UINT32_FORMAT ", " johnc@4300: "N_words: " UINT32_FORMAT, johnc@4300: _array->offset_array(landing_card), N_words)); ysr@777: } ysr@777: } ysr@777: } ysr@777: ysr@777: HeapWord* G1BlockOffsetArray::block_start_unsafe(const void* addr) { ysr@777: assert(_bottom <= addr && addr < _end, ysr@777: "addr must be covered by this Array"); ysr@777: // Must read this exactly once because it can be modified by parallel ysr@777: // allocation. ysr@777: HeapWord* ub = _unallocated_block; ysr@777: if (BlockOffsetArrayUseUnallocatedBlock && addr >= ub) { ysr@777: assert(ub < _end, "tautology (see above)"); ysr@777: return ub; ysr@777: } ysr@777: // Otherwise, find the block start using the table. ysr@777: HeapWord* q = block_at_or_preceding(addr, false, 0); ysr@777: return forward_to_block_containing_addr(q, addr); ysr@777: } ysr@777: ysr@777: // This duplicates a little code from the above: unavoidable. ysr@777: HeapWord* ysr@777: G1BlockOffsetArray::block_start_unsafe_const(const void* addr) const { ysr@777: assert(_bottom <= addr && addr < _end, ysr@777: "addr must be covered by this Array"); ysr@777: // Must read this exactly once because it can be modified by parallel ysr@777: // allocation. ysr@777: HeapWord* ub = _unallocated_block; ysr@777: if (BlockOffsetArrayUseUnallocatedBlock && addr >= ub) { ysr@777: assert(ub < _end, "tautology (see above)"); ysr@777: return ub; ysr@777: } ysr@777: // Otherwise, find the block start using the table. ysr@777: HeapWord* q = block_at_or_preceding(addr, false, 0); mgerdin@6987: HeapWord* n = q + block_size(q); ysr@777: return forward_to_block_containing_addr_const(q, n, addr); ysr@777: } ysr@777: ysr@777: ysr@777: HeapWord* ysr@777: G1BlockOffsetArray::forward_to_block_containing_addr_slow(HeapWord* q, ysr@777: HeapWord* n, ysr@777: const void* addr) { ysr@777: // We're not in the normal case. We need to handle an important subcase ysr@777: // here: LAB allocation. An allocation previously recorded in the ysr@777: // offset table was actually a lab allocation, and was divided into ysr@777: // several objects subsequently. Fix this situation as we answer the ysr@777: // query, by updating entries as we cross them. iveresov@787: iveresov@787: // If the fist object's end q is at the card boundary. Start refining iveresov@787: // with the corresponding card (the value of the entry will be basically iveresov@787: // set to 0). If the object crosses the boundary -- start from the next card. coleenp@4037: size_t n_index = _array->index_for(n); iveresov@787: size_t next_index = _array->index_for(n) + !_array->is_card_boundary(n); coleenp@4037: // Calculate a consistent next boundary. If "n" is not at the boundary coleenp@4037: // already, step to the boundary. coleenp@4037: HeapWord* next_boundary = _array->address_for_index(n_index) + coleenp@4037: (n_index == next_index ? 0 : N_words); coleenp@4037: assert(next_boundary <= _array->_end, coleenp@4037: err_msg("next_boundary is beyond the end of the covered region " coleenp@4037: " next_boundary " PTR_FORMAT " _array->_end " PTR_FORMAT, coleenp@4037: next_boundary, _array->_end)); mgerdin@6987: if (addr >= gsp()->top()) return gsp()->top(); mgerdin@6987: while (next_boundary < addr) { mgerdin@6987: while (n <= next_boundary) { 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: } mgerdin@6987: assert(q <= next_boundary && n > next_boundary, "Consequence of loop"); mgerdin@6987: // [q, n) is the block that crosses the boundary. mgerdin@6987: alloc_block_work2(&next_boundary, &next_index, q, n); ysr@777: } ysr@777: return forward_to_block_containing_addr_const(q, n, addr); ysr@777: } ysr@777: ysr@777: // Note that the committed size of the covered space may have changed, ysr@777: // so the table size might also wish to change. ysr@777: void G1BlockOffsetArray::resize(size_t new_word_size) { ysr@777: HeapWord* new_end = _bottom + new_word_size; ysr@777: _end = new_end; // update _end ysr@777: } ysr@777: ysr@777: // ysr@777: // threshold_ ysr@777: // | _index_ ysr@777: // v v ysr@777: // +-------+-------+-------+-------+-------+ ysr@777: // | i-1 | i | i+1 | i+2 | i+3 | ysr@777: // +-------+-------+-------+-------+-------+ ysr@777: // ( ^ ] ysr@777: // block-start ysr@777: // ysr@777: void G1BlockOffsetArray::alloc_block_work2(HeapWord** threshold_, size_t* index_, ysr@777: HeapWord* blk_start, HeapWord* blk_end) { ysr@777: // For efficiency, do copy-in/copy-out. ysr@777: HeapWord* threshold = *threshold_; ysr@777: size_t index = *index_; ysr@777: ysr@777: assert(blk_start != NULL && blk_end > blk_start, ysr@777: "phantom block"); ysr@777: assert(blk_end > threshold, "should be past threshold"); jcoomes@1844: assert(blk_start <= threshold, "blk_start should be at or before threshold"); ysr@777: assert(pointer_delta(threshold, blk_start) <= N_words, ysr@777: "offset should be <= BlockOffsetSharedArray::N"); ysr@777: assert(Universe::heap()->is_in_reserved(blk_start), ysr@777: "reference must be into the heap"); ysr@777: assert(Universe::heap()->is_in_reserved(blk_end-1), ysr@777: "limit must be within the heap"); ysr@777: assert(threshold == _array->_reserved.start() + index*N_words, ysr@777: "index must agree with threshold"); ysr@777: ysr@777: DEBUG_ONLY(size_t orig_index = index;) ysr@777: ysr@777: // Mark the card that holds the offset into the block. Note ysr@777: // that _next_offset_index and _next_offset_threshold are not ysr@777: // updated until the end of this method. ysr@777: _array->set_offset_array(index, threshold, blk_start); ysr@777: ysr@777: // We need to now mark the subsequent cards that this blk spans. ysr@777: ysr@777: // Index of card on which blk ends. ysr@777: size_t end_index = _array->index_for(blk_end - 1); ysr@777: ysr@777: // Are there more cards left to be updated? ysr@777: if (index + 1 <= end_index) { ysr@777: HeapWord* rem_st = _array->address_for_index(index + 1); ysr@777: // Calculate rem_end this way because end_index ysr@777: // may be the last valid index in the covered region. ysr@777: HeapWord* rem_end = _array->address_for_index(end_index) + N_words; ysr@777: set_remainder_to_point_to_start(rem_st, rem_end); ysr@777: } ysr@777: ysr@777: index = end_index + 1; ysr@777: // Calculate threshold_ this way because end_index ysr@777: // may be the last valid index in the covered region. ysr@777: threshold = _array->address_for_index(end_index) + N_words; ysr@777: assert(threshold >= blk_end, "Incorrect offset threshold"); ysr@777: ysr@777: // index_ and threshold_ updated here. ysr@777: *threshold_ = threshold; ysr@777: *index_ = index; ysr@777: ysr@777: #ifdef ASSERT ysr@777: // The offset can be 0 if the block starts on a boundary. That ysr@777: // is checked by an assertion above. ysr@777: size_t start_index = _array->index_for(blk_start); johnc@4300: HeapWord* boundary = _array->address_for_index(start_index); ysr@777: assert((_array->offset_array(orig_index) == 0 && ysr@777: blk_start == boundary) || ysr@777: (_array->offset_array(orig_index) > 0 && ysr@777: _array->offset_array(orig_index) <= N_words), johnc@4300: err_msg("offset array should have been set - " johnc@4300: "orig_index offset: " UINT32_FORMAT ", " johnc@4300: "blk_start: " PTR_FORMAT ", " johnc@4300: "boundary: " PTR_FORMAT, johnc@4300: _array->offset_array(orig_index), johnc@4300: blk_start, boundary)); ysr@777: for (size_t j = orig_index + 1; j <= end_index; j++) { ysr@777: assert(_array->offset_array(j) > 0 && ysr@777: _array->offset_array(j) <= ysr@777: (u_char) (N_words+BlockOffsetArray::N_powers-1), johnc@4300: err_msg("offset array should have been set - " johnc@4300: UINT32_FORMAT " not > 0 OR " johnc@4300: UINT32_FORMAT " not <= " UINT32_FORMAT, johnc@4300: _array->offset_array(j), johnc@4300: _array->offset_array(j), johnc@4300: (u_char) (N_words+BlockOffsetArray::N_powers-1))); ysr@777: } ysr@777: #endif ysr@777: } ysr@777: tonyp@2453: bool tonyp@2453: G1BlockOffsetArray::verify_for_object(HeapWord* obj_start, tonyp@2453: size_t word_size) const { tonyp@2453: size_t first_card = _array->index_for(obj_start); tonyp@2453: size_t last_card = _array->index_for(obj_start + word_size - 1); tonyp@2453: if (!_array->is_card_boundary(obj_start)) { tonyp@2453: // If the object is not on a card boundary the BOT entry of the tonyp@2453: // first card should point to another object so we should not tonyp@2453: // check that one. tonyp@2453: first_card += 1; tonyp@2453: } tonyp@2453: for (size_t card = first_card; card <= last_card; card += 1) { tonyp@2453: HeapWord* card_addr = _array->address_for_index(card); tonyp@2453: HeapWord* block_start = block_start_const(card_addr); tonyp@2453: if (block_start != obj_start) { kevinw@9327: gclog_or_tty->print_cr("block start: " PTR_FORMAT " is incorrect - " kevinw@9327: "card index: " SIZE_FORMAT " " kevinw@9327: "card addr: " PTR_FORMAT " BOT entry: %u " kevinw@9327: "obj: " PTR_FORMAT " word size: " SIZE_FORMAT " " kevinw@9327: "cards: [" SIZE_FORMAT "," SIZE_FORMAT "]", tonyp@2453: block_start, card, card_addr, tonyp@2453: _array->offset_array(card), tonyp@2453: obj_start, word_size, first_card, last_card); tonyp@2453: return false; tonyp@2453: } tonyp@2453: } tonyp@2453: return true; tonyp@2453: } tonyp@2453: tonyp@2453: #ifndef PRODUCT tonyp@2241: void tonyp@2453: G1BlockOffsetArray::print_on(outputStream* out) { tonyp@2453: size_t from_index = _array->index_for(_bottom); tonyp@2453: size_t to_index = _array->index_for(_end); kevinw@9327: out->print_cr(">> BOT for area [" PTR_FORMAT "," PTR_FORMAT ") " kevinw@9327: "cards [" SIZE_FORMAT "," SIZE_FORMAT ")", tonyp@2453: _bottom, _end, from_index, to_index); tonyp@2453: for (size_t i = from_index; i < to_index; ++i) { kevinw@9327: out->print_cr(" entry " SIZE_FORMAT_W(8) " | " PTR_FORMAT " : %3u", tonyp@2453: i, _array->address_for_index(i), tonyp@2453: (uint) _array->offset_array(i)); tonyp@2453: } tonyp@2241: } tonyp@2453: #endif // !PRODUCT tonyp@2241: ysr@777: ////////////////////////////////////////////////////////////////////// ysr@777: // G1BlockOffsetArrayContigSpace ysr@777: ////////////////////////////////////////////////////////////////////// ysr@777: ysr@777: HeapWord* ysr@777: G1BlockOffsetArrayContigSpace::block_start_unsafe(const void* addr) { ysr@777: assert(_bottom <= addr && addr < _end, ysr@777: "addr must be covered by this Array"); ysr@777: HeapWord* q = block_at_or_preceding(addr, true, _next_offset_index-1); ysr@777: return forward_to_block_containing_addr(q, addr); ysr@777: } ysr@777: ysr@777: HeapWord* ysr@777: G1BlockOffsetArrayContigSpace:: ysr@777: block_start_unsafe_const(const void* addr) const { ysr@777: assert(_bottom <= addr && addr < _end, ysr@777: "addr must be covered by this Array"); ysr@777: HeapWord* q = block_at_or_preceding(addr, true, _next_offset_index-1); mgerdin@6987: HeapWord* n = q + block_size(q); ysr@777: return forward_to_block_containing_addr_const(q, n, addr); ysr@777: } ysr@777: ysr@777: G1BlockOffsetArrayContigSpace:: ysr@777: G1BlockOffsetArrayContigSpace(G1BlockOffsetSharedArray* array, ysr@777: MemRegion mr) : brutisso@7256: G1BlockOffsetArray(array, mr) ysr@777: { ysr@777: _next_offset_threshold = NULL; ysr@777: _next_offset_index = 0; ysr@777: } ysr@777: tschatzl@7051: HeapWord* G1BlockOffsetArrayContigSpace::initialize_threshold_raw() { tschatzl@7051: assert(!Universe::heap()->is_in_reserved(_array->_offset_array), tschatzl@7051: "just checking"); tschatzl@7051: _next_offset_index = _array->index_for_raw(_bottom); tschatzl@7051: _next_offset_index++; tschatzl@7051: _next_offset_threshold = tschatzl@7051: _array->address_for_index_raw(_next_offset_index); tschatzl@7051: return _next_offset_threshold; tschatzl@7051: } tschatzl@7051: tschatzl@7051: void G1BlockOffsetArrayContigSpace::zero_bottom_entry_raw() { tschatzl@7051: assert(!Universe::heap()->is_in_reserved(_array->_offset_array), tschatzl@7051: "just checking"); tschatzl@7051: size_t bottom_index = _array->index_for_raw(_bottom); tschatzl@7051: assert(_array->address_for_index_raw(bottom_index) == _bottom, tschatzl@7051: "Precondition of call"); tschatzl@7051: _array->set_offset_array_raw(bottom_index, 0); tschatzl@7051: } tschatzl@7051: ysr@777: HeapWord* G1BlockOffsetArrayContigSpace::initialize_threshold() { ysr@777: assert(!Universe::heap()->is_in_reserved(_array->_offset_array), ysr@777: "just checking"); ysr@777: _next_offset_index = _array->index_for(_bottom); ysr@777: _next_offset_index++; ysr@777: _next_offset_threshold = ysr@777: _array->address_for_index(_next_offset_index); ysr@777: return _next_offset_threshold; ysr@777: } ysr@777: tonyp@2241: void tonyp@2453: G1BlockOffsetArrayContigSpace::set_for_starts_humongous(HeapWord* new_top) { tonyp@2453: assert(new_top <= _end, "_end should have already been updated"); tonyp@2241: tonyp@2453: // The first BOT entry should have offset 0. tschatzl@7050: reset_bot(); tonyp@2453: alloc_block(_bottom, new_top); tonyp@2453: } tonyp@2453: tonyp@2453: #ifndef PRODUCT tonyp@2453: void tonyp@2453: G1BlockOffsetArrayContigSpace::print_on(outputStream* out) { tonyp@2453: G1BlockOffsetArray::print_on(out); kevinw@9327: out->print_cr(" next offset threshold: " PTR_FORMAT, _next_offset_threshold); kevinw@9327: out->print_cr(" next offset index: " SIZE_FORMAT, _next_offset_index); tonyp@2241: } tonyp@2453: #endif // !PRODUCT