| 1 | /* |
| 2 | * Copyright (c) 2015, 2019, Oracle and/or its affiliates. All rights reserved. |
| 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 | * |
| 5 | * This code is free software; you can redistribute it and/or modify it |
| 6 | * under the terms of the GNU General Public License version 2 only, as |
| 7 | * published by the Free Software Foundation. |
| 8 | * |
| 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| 13 | * accompanied this code). |
| 14 | * |
| 15 | * You should have received a copy of the GNU General Public License version |
| 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| 18 | * |
| 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| 20 | * or visit www.oracle.com if you need additional information or have any |
| 21 | * questions. |
| 22 | * |
| 23 | */ |
| 24 | |
| 25 | #ifndef SHARE_GC_G1_G1ALLOCATOR_INLINE_HPP |
| 26 | #define SHARE_GC_G1_G1ALLOCATOR_INLINE_HPP |
| 27 | |
| 28 | #include "gc/g1/g1Allocator.hpp" |
| 29 | #include "gc/g1/g1AllocRegion.inline.hpp" |
| 30 | #include "gc/shared/plab.inline.hpp" |
| 31 | #include "memory/universe.hpp" |
| 32 | |
| 33 | inline MutatorAllocRegion* G1Allocator::mutator_alloc_region() { |
| 34 | return &_mutator_alloc_region; |
| 35 | } |
| 36 | |
| 37 | inline SurvivorGCAllocRegion* G1Allocator::survivor_gc_alloc_region() { |
| 38 | return &_survivor_gc_alloc_region; |
| 39 | } |
| 40 | |
| 41 | inline OldGCAllocRegion* G1Allocator::old_gc_alloc_region() { |
| 42 | return &_old_gc_alloc_region; |
| 43 | } |
| 44 | |
| 45 | inline HeapWord* G1Allocator::attempt_allocation(size_t min_word_size, |
| 46 | size_t desired_word_size, |
| 47 | size_t* actual_word_size) { |
| 48 | HeapWord* result = mutator_alloc_region()->attempt_retained_allocation(min_word_size, desired_word_size, actual_word_size); |
| 49 | if (result != NULL) { |
| 50 | return result; |
| 51 | } |
| 52 | return mutator_alloc_region()->attempt_allocation(min_word_size, desired_word_size, actual_word_size); |
| 53 | } |
| 54 | |
| 55 | inline HeapWord* G1Allocator::attempt_allocation_locked(size_t word_size) { |
| 56 | HeapWord* result = mutator_alloc_region()->attempt_allocation_locked(word_size); |
| 57 | assert(result != NULL || mutator_alloc_region()->get() == NULL, |
| 58 | "Must not have a mutator alloc region if there is no memory, but is " PTR_FORMAT, p2i(mutator_alloc_region()->get())); |
| 59 | return result; |
| 60 | } |
| 61 | |
| 62 | inline HeapWord* G1Allocator::attempt_allocation_force(size_t word_size) { |
| 63 | return mutator_alloc_region()->attempt_allocation_force(word_size); |
| 64 | } |
| 65 | |
| 66 | inline PLAB* G1PLABAllocator::alloc_buffer(G1HeapRegionAttr dest) { |
| 67 | assert(dest.is_valid(), |
| 68 | "Allocation buffer index out of bounds: %s" , dest.get_type_str()); |
| 69 | assert(_alloc_buffers[dest.type()] != NULL, |
| 70 | "Allocation buffer is NULL: %s" , dest.get_type_str()); |
| 71 | return _alloc_buffers[dest.type()]; |
| 72 | } |
| 73 | |
| 74 | inline HeapWord* G1PLABAllocator::plab_allocate(G1HeapRegionAttr dest, |
| 75 | size_t word_sz) { |
| 76 | PLAB* buffer = alloc_buffer(dest); |
| 77 | if (_survivor_alignment_bytes == 0 || !dest.is_young()) { |
| 78 | return buffer->allocate(word_sz); |
| 79 | } else { |
| 80 | return buffer->allocate_aligned(word_sz, _survivor_alignment_bytes); |
| 81 | } |
| 82 | } |
| 83 | |
| 84 | inline HeapWord* G1PLABAllocator::allocate(G1HeapRegionAttr dest, |
| 85 | size_t word_sz, |
| 86 | bool* refill_failed) { |
| 87 | HeapWord* const obj = plab_allocate(dest, word_sz); |
| 88 | if (obj != NULL) { |
| 89 | return obj; |
| 90 | } |
| 91 | return allocate_direct_or_new_plab(dest, word_sz, refill_failed); |
| 92 | } |
| 93 | |
| 94 | // Create the maps which is used to identify archive objects. |
| 95 | inline void G1ArchiveAllocator::enable_archive_object_check() { |
| 96 | if (_archive_check_enabled) { |
| 97 | return; |
| 98 | } |
| 99 | |
| 100 | _archive_check_enabled = true; |
| 101 | size_t length = G1CollectedHeap::heap()->max_reserved_capacity(); |
| 102 | _closed_archive_region_map.initialize((HeapWord*)Universe::heap()->base(), |
| 103 | (HeapWord*)Universe::heap()->base() + length, |
| 104 | HeapRegion::GrainBytes); |
| 105 | _open_archive_region_map.initialize((HeapWord*)Universe::heap()->base(), |
| 106 | (HeapWord*)Universe::heap()->base() + length, |
| 107 | HeapRegion::GrainBytes); |
| 108 | } |
| 109 | |
| 110 | // Set the regions containing the specified address range as archive. |
| 111 | inline void G1ArchiveAllocator::set_range_archive(MemRegion range, bool open) { |
| 112 | assert(_archive_check_enabled, "archive range check not enabled" ); |
| 113 | log_info(gc, cds)("Mark %s archive regions in map: [" PTR_FORMAT ", " PTR_FORMAT "]" , |
| 114 | open ? "open" : "closed" , |
| 115 | p2i(range.start()), |
| 116 | p2i(range.last())); |
| 117 | if (open) { |
| 118 | _open_archive_region_map.set_by_address(range, true); |
| 119 | } else { |
| 120 | _closed_archive_region_map.set_by_address(range, true); |
| 121 | } |
| 122 | } |
| 123 | |
| 124 | // Clear the archive regions map containing the specified address range. |
| 125 | inline void G1ArchiveAllocator::clear_range_archive(MemRegion range, bool open) { |
| 126 | assert(_archive_check_enabled, "archive range check not enabled" ); |
| 127 | log_info(gc, cds)("Clear %s archive regions in map: [" PTR_FORMAT ", " PTR_FORMAT "]" , |
| 128 | open ? "open" : "closed" , |
| 129 | p2i(range.start()), |
| 130 | p2i(range.last())); |
| 131 | if (open) { |
| 132 | _open_archive_region_map.set_by_address(range, false); |
| 133 | } else { |
| 134 | _closed_archive_region_map.set_by_address(range, false); |
| 135 | } |
| 136 | } |
| 137 | |
| 138 | // Check if an object is in a closed archive region using the _archive_region_map. |
| 139 | inline bool G1ArchiveAllocator::in_closed_archive_range(oop object) { |
| 140 | // This is the out-of-line part of is_closed_archive_object test, done separately |
| 141 | // to avoid additional performance impact when the check is not enabled. |
| 142 | return _closed_archive_region_map.get_by_address((HeapWord*)object); |
| 143 | } |
| 144 | |
| 145 | inline bool G1ArchiveAllocator::in_open_archive_range(oop object) { |
| 146 | return _open_archive_region_map.get_by_address((HeapWord*)object); |
| 147 | } |
| 148 | |
| 149 | // Check if archive object checking is enabled, to avoid calling in_open/closed_archive_range |
| 150 | // unnecessarily. |
| 151 | inline bool G1ArchiveAllocator::archive_check_enabled() { |
| 152 | return _archive_check_enabled; |
| 153 | } |
| 154 | |
| 155 | inline bool G1ArchiveAllocator::is_closed_archive_object(oop object) { |
| 156 | return (archive_check_enabled() && in_closed_archive_range(object)); |
| 157 | } |
| 158 | |
| 159 | inline bool G1ArchiveAllocator::is_open_archive_object(oop object) { |
| 160 | return (archive_check_enabled() && in_open_archive_range(object)); |
| 161 | } |
| 162 | |
| 163 | inline bool G1ArchiveAllocator::is_archived_object(oop object) { |
| 164 | return (archive_check_enabled() && (in_closed_archive_range(object) || |
| 165 | in_open_archive_range(object))); |
| 166 | } |
| 167 | |
| 168 | #endif // SHARE_GC_G1_G1ALLOCATOR_INLINE_HPP |
| 169 | |