< prev index next >

src/hotspot/share/gc/shenandoah/shenandoahBarrierSet.hpp

Print this page

  1 /*
  2  * Copyright (c) 2013, 2021, Red Hat, Inc. 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_SHENANDOAH_SHENANDOAHBARRIERSET_HPP
 26 #define SHARE_GC_SHENANDOAH_SHENANDOAHBARRIERSET_HPP
 27 
 28 #include "gc/shared/barrierSet.hpp"
 29 #include "gc/shared/bufferNode.hpp"

 30 #include "gc/shenandoah/shenandoahSATBMarkQueueSet.hpp"
 31 
 32 class ShenandoahHeap;
 33 class ShenandoahBarrierSetAssembler;
 34 
 35 class ShenandoahBarrierSet: public BarrierSet {
 36 private:
 37   ShenandoahHeap* const _heap;

 38   BufferNode::Allocator _satb_mark_queue_buffer_allocator;
 39   ShenandoahSATBMarkQueueSet _satb_mark_queue_set;
 40 
 41 public:
 42   ShenandoahBarrierSet(ShenandoahHeap* heap);
 43 
 44   static ShenandoahBarrierSetAssembler* assembler();
 45 
 46   inline static ShenandoahBarrierSet* barrier_set() {
 47     return barrier_set_cast<ShenandoahBarrierSet>(BarrierSet::barrier_set());
 48   }
 49 




 50   static ShenandoahSATBMarkQueueSet& satb_mark_queue_set() {
 51     return barrier_set()->_satb_mark_queue_set;
 52   }
 53 
 54   static bool need_load_reference_barrier(DecoratorSet decorators, BasicType type);
 55   static bool need_keep_alive_barrier(DecoratorSet decorators, BasicType type);
 56 
 57   static bool is_strong_access(DecoratorSet decorators) {
 58     return (decorators & (ON_WEAK_OOP_REF | ON_PHANTOM_OOP_REF)) == 0;
 59   }
 60 
 61   static bool is_weak_access(DecoratorSet decorators) {
 62     return (decorators & ON_WEAK_OOP_REF) != 0;
 63   }
 64 
 65   static bool is_phantom_access(DecoratorSet decorators) {
 66     return (decorators & ON_PHANTOM_OOP_REF) != 0;
 67   }
 68 
 69   static bool is_native_access(DecoratorSet decorators) {

 95 
 96   inline void enqueue(oop obj);
 97 
 98   inline oop load_reference_barrier(oop obj);
 99 
100   template <class T>
101   inline oop load_reference_barrier_mutator(oop obj, T* load_addr);
102 
103   template <class T>
104   inline oop load_reference_barrier(DecoratorSet decorators, oop obj, T* load_addr);
105 
106   template <typename T>
107   inline oop oop_load(DecoratorSet decorators, T* addr);
108 
109   template <typename T>
110   inline oop oop_cmpxchg(DecoratorSet decorators, T* addr, oop compare_value, oop new_value);
111 
112   template <typename T>
113   inline oop oop_xchg(DecoratorSet decorators, T* addr, oop new_value);
114 





115 private:
116   template <class T>
117   inline void arraycopy_marking(T* src, T* dst, size_t count);
118   template <class T>
119   inline void arraycopy_evacuation(T* src, size_t count);
120   template <class T>
121   inline void arraycopy_update(T* src, size_t count);
122 
123   inline void clone_marking(oop src);
124   inline void clone_evacuation(oop src);
125   inline void clone_update(oop src);
126 
127   template <class T, bool HAS_FWD, bool EVAC, bool ENQUEUE>
128   inline void arraycopy_work(T* src, size_t count);
129 
130   inline bool need_bulk_update(HeapWord* dst);
131 public:
132   // Callbacks for runtime accesses.
133   template <DecoratorSet decorators, typename BarrierSetT = ShenandoahBarrierSet>
134   class AccessBarrier: public BarrierSet::AccessBarrier<decorators, BarrierSetT> {
135     typedef BarrierSet::AccessBarrier<decorators, BarrierSetT> Raw;
136 
137   private:

  1 /*
  2  * Copyright (c) 2013, 2021, Red Hat, Inc. All rights reserved.
  3  * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
  4  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
  5  *
  6  * This code is free software; you can redistribute it and/or modify it
  7  * under the terms of the GNU General Public License version 2 only, as
  8  * published by the Free Software Foundation.
  9  *
 10  * This code is distributed in the hope that it will be useful, but WITHOUT
 11  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 12  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 13  * version 2 for more details (a copy is included in the LICENSE file that
 14  * accompanied this code).
 15  *
 16  * You should have received a copy of the GNU General Public License version
 17  * 2 along with this work; if not, write to the Free Software Foundation,
 18  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 19  *
 20  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 21  * or visit www.oracle.com if you need additional information or have any
 22  * questions.
 23  *
 24  */
 25 
 26 #ifndef SHARE_GC_SHENANDOAH_SHENANDOAHBARRIERSET_HPP
 27 #define SHARE_GC_SHENANDOAH_SHENANDOAHBARRIERSET_HPP
 28 
 29 #include "gc/shared/barrierSet.hpp"
 30 #include "gc/shared/bufferNode.hpp"
 31 #include "gc/shenandoah/shenandoahCardTable.hpp"
 32 #include "gc/shenandoah/shenandoahSATBMarkQueueSet.hpp"
 33 
 34 class ShenandoahHeap;
 35 class ShenandoahBarrierSetAssembler;
 36 
 37 class ShenandoahBarrierSet: public BarrierSet {
 38 private:
 39   ShenandoahHeap* const _heap;
 40   ShenandoahCardTable* _card_table;
 41   BufferNode::Allocator _satb_mark_queue_buffer_allocator;
 42   ShenandoahSATBMarkQueueSet _satb_mark_queue_set;
 43 
 44 public:
 45   ShenandoahBarrierSet(ShenandoahHeap* heap, MemRegion heap_region);
 46 
 47   static ShenandoahBarrierSetAssembler* assembler();
 48 
 49   inline static ShenandoahBarrierSet* barrier_set() {
 50     return barrier_set_cast<ShenandoahBarrierSet>(BarrierSet::barrier_set());
 51   }
 52 
 53   inline ShenandoahCardTable* card_table() {
 54     return _card_table;
 55   }
 56 
 57   static ShenandoahSATBMarkQueueSet& satb_mark_queue_set() {
 58     return barrier_set()->_satb_mark_queue_set;
 59   }
 60 
 61   static bool need_load_reference_barrier(DecoratorSet decorators, BasicType type);
 62   static bool need_keep_alive_barrier(DecoratorSet decorators, BasicType type);
 63 
 64   static bool is_strong_access(DecoratorSet decorators) {
 65     return (decorators & (ON_WEAK_OOP_REF | ON_PHANTOM_OOP_REF)) == 0;
 66   }
 67 
 68   static bool is_weak_access(DecoratorSet decorators) {
 69     return (decorators & ON_WEAK_OOP_REF) != 0;
 70   }
 71 
 72   static bool is_phantom_access(DecoratorSet decorators) {
 73     return (decorators & ON_PHANTOM_OOP_REF) != 0;
 74   }
 75 
 76   static bool is_native_access(DecoratorSet decorators) {

102 
103   inline void enqueue(oop obj);
104 
105   inline oop load_reference_barrier(oop obj);
106 
107   template <class T>
108   inline oop load_reference_barrier_mutator(oop obj, T* load_addr);
109 
110   template <class T>
111   inline oop load_reference_barrier(DecoratorSet decorators, oop obj, T* load_addr);
112 
113   template <typename T>
114   inline oop oop_load(DecoratorSet decorators, T* addr);
115 
116   template <typename T>
117   inline oop oop_cmpxchg(DecoratorSet decorators, T* addr, oop compare_value, oop new_value);
118 
119   template <typename T>
120   inline oop oop_xchg(DecoratorSet decorators, T* addr, oop new_value);
121 
122   template <DecoratorSet decorators, typename T>
123   void write_ref_field_post(T* field);
124 
125   void write_ref_array(HeapWord* start, size_t count);
126 
127 private:
128   template <class T>
129   inline void arraycopy_marking(T* src, T* dst, size_t count, bool is_old_marking);
130   template <class T>
131   inline void arraycopy_evacuation(T* src, size_t count);
132   template <class T>
133   inline void arraycopy_update(T* src, size_t count);
134 
135   inline void clone_marking(oop src);
136   inline void clone_evacuation(oop src);
137   inline void clone_update(oop src);
138 
139   template <class T, bool HAS_FWD, bool EVAC, bool ENQUEUE>
140   inline void arraycopy_work(T* src, size_t count);
141 
142   inline bool need_bulk_update(HeapWord* dst);
143 public:
144   // Callbacks for runtime accesses.
145   template <DecoratorSet decorators, typename BarrierSetT = ShenandoahBarrierSet>
146   class AccessBarrier: public BarrierSet::AccessBarrier<decorators, BarrierSetT> {
147     typedef BarrierSet::AccessBarrier<decorators, BarrierSetT> Raw;
148 
149   private:
< prev index next >