| /* |
| * Copyright (c) 2016, 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_ZMARKSTACK_HPP |
| #define SHARE_GC_Z_ZMARKSTACK_HPP |
| |
| #include "gc/z/zGlobals.hpp" |
| #include "gc/z/zMarkStackEntry.hpp" |
| #include "utilities/globalDefinitions.hpp" |
| |
| class ZMarkTerminate; |
| |
| template <typename T, size_t S> |
| class ZStack { |
| private: |
| size_t _top; |
| ZStack<T, S>* _next; |
| T _slots[S]; |
| |
| bool is_full() const; |
| |
| public: |
| ZStack(); |
| |
| bool is_empty() const; |
| |
| bool push(T value); |
| bool pop(T& value); |
| |
| ZStack<T, S>* next() const; |
| ZStack<T, S>** next_addr(); |
| }; |
| |
| template <typename T> |
| class ZStackList { |
| private: |
| uintptr_t _base; |
| T* volatile _head; |
| |
| T* encode_versioned_pointer(const T* stack, uint32_t version) const; |
| void decode_versioned_pointer(const T* vstack, T** stack, uint32_t* version) const; |
| |
| public: |
| explicit ZStackList(uintptr_t base); |
| |
| bool is_empty() const; |
| |
| void push(T* stack); |
| T* pop(); |
| |
| void clear(); |
| }; |
| |
| using ZMarkStack = ZStack<ZMarkStackEntry, ZMarkStackSlots>; |
| using ZMarkStackList = ZStackList<ZMarkStack>; |
| using ZMarkStackMagazine = ZStack<ZMarkStack*, ZMarkStackMagazineSlots>; |
| using ZMarkStackMagazineList = ZStackList<ZMarkStackMagazine>; |
| |
| static_assert(sizeof(ZMarkStack) == ZMarkStackSize, "ZMarkStack size mismatch"); |
| static_assert(sizeof(ZMarkStackMagazine) <= ZMarkStackSize, "ZMarkStackMagazine size too large"); |
| |
| class ZMarkStripe { |
| private: |
| ZCACHE_ALIGNED ZMarkStackList _published; |
| ZCACHE_ALIGNED ZMarkStackList _overflowed; |
| |
| public: |
| explicit ZMarkStripe(uintptr_t base = 0); |
| |
| bool is_empty() const; |
| |
| void publish_stack(ZMarkStack* stack, ZMarkTerminate* terminate, bool publish); |
| ZMarkStack* steal_stack(); |
| }; |
| |
| class ZMarkStripeSet { |
| private: |
| size_t _nstripes_mask; |
| ZMarkStripe _stripes[ZMarkStripesMax]; |
| |
| public: |
| explicit ZMarkStripeSet(uintptr_t base); |
| |
| void set_nstripes(size_t nstripes); |
| size_t nstripes() const; |
| |
| bool is_empty() const; |
| |
| size_t stripe_id(const ZMarkStripe* stripe) const; |
| ZMarkStripe* stripe_at(size_t index); |
| ZMarkStripe* stripe_next(ZMarkStripe* stripe); |
| ZMarkStripe* stripe_for_worker(uint nworkers, uint worker_id); |
| ZMarkStripe* stripe_for_addr(uintptr_t addr); |
| }; |
| |
| class ZMarkStackAllocator; |
| |
| class ZMarkThreadLocalStacks { |
| private: |
| ZMarkStackMagazine* _magazine; |
| ZMarkStack* _stacks[ZMarkStripesMax]; |
| |
| ZMarkStack* allocate_stack(ZMarkStackAllocator* allocator); |
| void free_stack(ZMarkStackAllocator* allocator, ZMarkStack* stack); |
| |
| bool push_slow(ZMarkStackAllocator* allocator, |
| ZMarkStripe* stripe, |
| ZMarkStack** stackp, |
| ZMarkTerminate* terminate, |
| ZMarkStackEntry entry, |
| bool publish); |
| |
| bool pop_slow(ZMarkStackAllocator* allocator, |
| ZMarkStripe* stripe, |
| ZMarkStack** stackp, |
| ZMarkStackEntry& entry); |
| |
| public: |
| ZMarkThreadLocalStacks(); |
| |
| bool is_empty(const ZMarkStripeSet* stripes) const; |
| |
| void install(ZMarkStripeSet* stripes, |
| ZMarkStripe* stripe, |
| ZMarkStack* stack); |
| |
| ZMarkStack* steal(ZMarkStripeSet* stripes, |
| ZMarkStripe* stripe); |
| |
| bool push(ZMarkStackAllocator* allocator, |
| ZMarkStripeSet* stripes, |
| ZMarkStripe* stripe, |
| ZMarkTerminate* terminate, |
| ZMarkStackEntry entry, |
| bool publish); |
| |
| bool pop(ZMarkStackAllocator* allocator, |
| ZMarkStripeSet* stripes, |
| ZMarkStripe* stripe, |
| ZMarkStackEntry& entry); |
| |
| bool flush(ZMarkStackAllocator* allocator, |
| ZMarkStripeSet* stripes, |
| ZMarkTerminate* terminate); |
| |
| void free(ZMarkStackAllocator* allocator); |
| }; |
| |
| #endif // SHARE_GC_Z_ZMARKSTACK_HPP |