| /* |
| * Copyright (c) 2017, 2023, Oracle and/or its affiliates. All rights reserved. |
| * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| * |
| * This code is free software; you can redistribute it and/or modify it |
| * under the terms of the GNU General Public License version 2 only, as |
| * published by the Free Software Foundation. |
| * |
| * This code is distributed in the hope that it will be useful, but WITHOUT |
| * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| * version 2 for more details (a copy is included in the LICENSE file that |
| * accompanied this code). |
| * |
| * You should have received a copy of the GNU General Public License version |
| * 2 along with this work; if not, write to the Free Software Foundation, |
| * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| * |
| * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| * or visit www.oracle.com if you need additional information or have any |
| * questions. |
| */ |
| |
| #ifndef SHARE_GC_Z_ZGRANULEMAP_INLINE_HPP |
| #define SHARE_GC_Z_ZGRANULEMAP_INLINE_HPP |
| |
| #include "gc/z/zGranuleMap.hpp" |
| |
| #include "gc/z/zAddress.inline.hpp" |
| #include "gc/z/zArray.inline.hpp" |
| #include "gc/z/zGlobals.hpp" |
| #include "memory/allocation.inline.hpp" |
| #include "runtime/atomic.hpp" |
| #include "utilities/align.hpp" |
| #include "utilities/debug.hpp" |
| |
| template <typename T> |
| inline ZGranuleMap<T>::ZGranuleMap(size_t max_offset) |
| : _size(max_offset >> ZGranuleSizeShift), |
| _map(MmapArrayAllocator<T>::allocate(_size, mtGC)) { |
| assert(is_aligned(max_offset, ZGranuleSize), "Misaligned"); |
| } |
| |
| template <typename T> |
| inline ZGranuleMap<T>::~ZGranuleMap() { |
| MmapArrayAllocator<T>::free(_map, _size); |
| } |
| |
| template <typename T> |
| inline size_t ZGranuleMap<T>::index_for_offset(zoffset offset) const { |
| const size_t index = untype(offset) >> ZGranuleSizeShift; |
| assert(index < _size, "Invalid index"); |
| |
| return index; |
| } |
| |
| template <typename T> |
| inline T ZGranuleMap<T>::at(size_t index) const { |
| assert(index < _size, "Invalid index"); |
| return Atomic::load(_map + index); |
| } |
| |
| template <typename T> |
| inline T ZGranuleMap<T>::get(zoffset offset) const { |
| const size_t index = index_for_offset(offset); |
| return at(index); |
| } |
| |
| template <typename T> |
| inline void ZGranuleMap<T>::put(zoffset offset, T value) { |
| const size_t index = index_for_offset(offset); |
| Atomic::store(_map + index, value); |
| } |
| |
| template <typename T> |
| inline void ZGranuleMap<T>::put(zoffset offset, size_t size, T value) { |
| assert(is_aligned(size, ZGranuleSize), "Misaligned"); |
| |
| const size_t start_index = index_for_offset(offset); |
| const size_t end_index = start_index + (size >> ZGranuleSizeShift); |
| for (size_t index = start_index; index < end_index; index++) { |
| Atomic::store(_map + index, value); |
| } |
| } |
| |
| template <typename T> |
| inline T ZGranuleMap<T>::get_acquire(zoffset offset) const { |
| const size_t index = index_for_offset(offset); |
| return Atomic::load_acquire(_map + index); |
| } |
| |
| template <typename T> |
| inline void ZGranuleMap<T>::release_put(zoffset offset, T value) { |
| const size_t index = index_for_offset(offset); |
| Atomic::release_store(_map + index, value); |
| } |
| |
| template <typename T> |
| inline void ZGranuleMap<T>::release_put(zoffset offset, size_t size, T value) { |
| OrderAccess::release(); |
| put(offset, size, value); |
| } |
| |
| template <typename T, bool Parallel> |
| inline ZGranuleMapIterator<T, Parallel>::ZGranuleMapIterator(const ZGranuleMap<T>* granule_map) |
| : ZArrayIteratorImpl<T, Parallel>(granule_map->_map, granule_map->_size) {} |
| |
| #endif // SHARE_GC_Z_ZGRANULEMAP_INLINE_HPP |