Tue, 07 Oct 2008 11:01:35 -0700
Merge
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 2001-2005 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_objectStartArray.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | void ObjectStartArray::initialize(MemRegion reserved_region) { |
duke@435 | 29 | // We're based on the assumption that we use the same |
duke@435 | 30 | // size blocks as the card table. |
duke@435 | 31 | assert((int)block_size == (int)CardTableModRefBS::card_size, "Sanity"); |
duke@435 | 32 | assert((int)block_size <= 512, "block_size must be less than or equal to 512"); |
duke@435 | 33 | |
duke@435 | 34 | // Calculate how much space must be reserved |
duke@435 | 35 | _reserved_region = reserved_region; |
duke@435 | 36 | |
duke@435 | 37 | size_t bytes_to_reserve = reserved_region.word_size() / block_size_in_words; |
duke@435 | 38 | assert(bytes_to_reserve > 0, "Sanity"); |
duke@435 | 39 | |
duke@435 | 40 | bytes_to_reserve = |
duke@435 | 41 | align_size_up(bytes_to_reserve, os::vm_allocation_granularity()); |
duke@435 | 42 | |
duke@435 | 43 | // Do not use large-pages for the backing store. The one large page region |
duke@435 | 44 | // will be used for the heap proper. |
duke@435 | 45 | ReservedSpace backing_store(bytes_to_reserve); |
duke@435 | 46 | if (!backing_store.is_reserved()) { |
duke@435 | 47 | vm_exit_during_initialization("Could not reserve space for ObjectStartArray"); |
duke@435 | 48 | } |
duke@435 | 49 | |
duke@435 | 50 | // We do not commit any memory initially |
duke@435 | 51 | if (!_virtual_space.initialize(backing_store, 0)) { |
duke@435 | 52 | vm_exit_during_initialization("Could not commit space for ObjectStartArray"); |
duke@435 | 53 | } |
duke@435 | 54 | |
duke@435 | 55 | _raw_base = (jbyte*)_virtual_space.low_boundary(); |
duke@435 | 56 | if (_raw_base == NULL) { |
duke@435 | 57 | vm_exit_during_initialization("Could not get raw_base address"); |
duke@435 | 58 | } |
duke@435 | 59 | |
duke@435 | 60 | _offset_base = _raw_base - (size_t(reserved_region.start()) >> block_shift); |
duke@435 | 61 | |
duke@435 | 62 | _covered_region.set_start(reserved_region.start()); |
duke@435 | 63 | _covered_region.set_word_size(0); |
duke@435 | 64 | |
duke@435 | 65 | _blocks_region.set_start((HeapWord*)_raw_base); |
duke@435 | 66 | _blocks_region.set_word_size(0); |
duke@435 | 67 | } |
duke@435 | 68 | |
duke@435 | 69 | void ObjectStartArray::set_covered_region(MemRegion mr) { |
duke@435 | 70 | assert(_reserved_region.contains(mr), "MemRegion outside of reserved space"); |
duke@435 | 71 | assert(_reserved_region.start() == mr.start(), "Attempt to move covered region"); |
duke@435 | 72 | |
duke@435 | 73 | HeapWord* low_bound = mr.start(); |
duke@435 | 74 | HeapWord* high_bound = mr.end(); |
duke@435 | 75 | assert((uintptr_t(low_bound) & (block_size - 1)) == 0, "heap must start at block boundary"); |
duke@435 | 76 | assert((uintptr_t(high_bound) & (block_size - 1)) == 0, "heap must end at block boundary"); |
duke@435 | 77 | |
duke@435 | 78 | size_t requested_blocks_size_in_bytes = mr.word_size() / block_size_in_words; |
duke@435 | 79 | |
duke@435 | 80 | // Only commit memory in page sized chunks |
duke@435 | 81 | requested_blocks_size_in_bytes = |
duke@435 | 82 | align_size_up(requested_blocks_size_in_bytes, os::vm_page_size()); |
duke@435 | 83 | |
duke@435 | 84 | _covered_region = mr; |
duke@435 | 85 | |
duke@435 | 86 | size_t current_blocks_size_in_bytes = _blocks_region.byte_size(); |
duke@435 | 87 | |
duke@435 | 88 | if (requested_blocks_size_in_bytes > current_blocks_size_in_bytes) { |
duke@435 | 89 | // Expand |
duke@435 | 90 | size_t expand_by = requested_blocks_size_in_bytes - current_blocks_size_in_bytes; |
duke@435 | 91 | if (!_virtual_space.expand_by(expand_by)) { |
duke@435 | 92 | vm_exit_out_of_memory(expand_by, "object start array expansion"); |
duke@435 | 93 | } |
duke@435 | 94 | // Clear *only* the newly allocated region |
duke@435 | 95 | memset(_blocks_region.end(), clean_block, expand_by); |
duke@435 | 96 | } |
duke@435 | 97 | |
duke@435 | 98 | if (requested_blocks_size_in_bytes < current_blocks_size_in_bytes) { |
duke@435 | 99 | // Shrink |
duke@435 | 100 | size_t shrink_by = current_blocks_size_in_bytes - requested_blocks_size_in_bytes; |
duke@435 | 101 | _virtual_space.shrink_by(shrink_by); |
duke@435 | 102 | } |
duke@435 | 103 | |
duke@435 | 104 | _blocks_region.set_word_size(requested_blocks_size_in_bytes / sizeof(HeapWord)); |
duke@435 | 105 | |
duke@435 | 106 | assert(requested_blocks_size_in_bytes % sizeof(HeapWord) == 0, "Block table not expanded in word sized increment"); |
duke@435 | 107 | assert(requested_blocks_size_in_bytes == _blocks_region.byte_size(), "Sanity"); |
duke@435 | 108 | assert(block_for_addr(low_bound) == &_raw_base[0], "Checking start of map"); |
duke@435 | 109 | assert(block_for_addr(high_bound-1) <= &_raw_base[_blocks_region.byte_size()-1], "Checking end of map"); |
duke@435 | 110 | } |
duke@435 | 111 | |
duke@435 | 112 | void ObjectStartArray::reset() { |
duke@435 | 113 | memset(_blocks_region.start(), clean_block, _blocks_region.byte_size()); |
duke@435 | 114 | } |
duke@435 | 115 | |
duke@435 | 116 | |
duke@435 | 117 | bool ObjectStartArray::object_starts_in_range(HeapWord* start_addr, |
duke@435 | 118 | HeapWord* end_addr) const { |
duke@435 | 119 | assert(start_addr <= end_addr, "range is wrong"); |
duke@435 | 120 | if (start_addr > end_addr) { |
duke@435 | 121 | return false; |
duke@435 | 122 | } |
duke@435 | 123 | |
duke@435 | 124 | jbyte* start_block = block_for_addr(start_addr); |
duke@435 | 125 | jbyte* end_block = block_for_addr(end_addr); |
duke@435 | 126 | |
duke@435 | 127 | for (jbyte* block = start_block; block <= end_block; block++) { |
duke@435 | 128 | if (*block != clean_block) { |
duke@435 | 129 | return true; |
duke@435 | 130 | } |
duke@435 | 131 | } |
duke@435 | 132 | // No object starts in this slice; verify this using |
duke@435 | 133 | // more traditional methods: |
duke@435 | 134 | assert(object_start(end_addr - 1) <= start_addr, |
duke@435 | 135 | "Oops an object does start in this slice?"); |
duke@435 | 136 | return false; |
duke@435 | 137 | } |