1 /*
2 * Copyright (c) 2018, 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_C2_SHENANDOAHBARRIERSETC2_HPP
26 #define SHARE_GC_SHENANDOAH_C2_SHENANDOAHBARRIERSETC2_HPP
27
28 #include "gc/shared/c2/barrierSetC2.hpp"
29 #include "gc/shared/gc_globals.hpp"
30 #include "gc/shenandoah/shenandoahBarrierSetAssembler.hpp"
31 #include "gc/shenandoah/shenandoahRuntime.hpp"
32 #include "gc/shenandoah/shenandoahThreadLocalData.hpp"
33 #include "opto/machnode.hpp"
34 #include "utilities/growableArray.hpp"
35
36 static const uint8_t ShenandoahBitStrong = 1 << 0; // Barrier: LRB, strong
37 static const uint8_t ShenandoahBitWeak = 1 << 1; // Barrier: LRB, weak
38 static const uint8_t ShenandoahBitPhantom = 1 << 2; // Barrier: LRB, phantom
39 static const uint8_t ShenandoahBitKeepAlive = 1 << 3; // Barrier: KeepAlive (SATB for stores, KA for loads)
40 static const uint8_t ShenandoahBitCardMark = 1 << 4; // Barrier: CM
41 static const uint8_t ShenandoahBitNotNull = 1 << 5; // Metadata: src/dst is not null
42 static const uint8_t ShenandoahBitNative = 1 << 6; // Metadata: access is in native, not in heap
43 static const uint8_t ShenandoahBitElided = 1 << 7; // Metadata: barrier is elided
44
45 // Barrier data that implies real barriers, not additional metadata.
46 static const uint8_t ShenandoahBitsReal = ShenandoahBitStrong | ShenandoahBitWeak | ShenandoahBitPhantom |
47 ShenandoahBitKeepAlive |
48 ShenandoahBitCardMark;
49
50 class ShenandoahBarrierStubC2;
51
52 class ShenandoahBarrierSetC2State : public BarrierSetC2State {
53 GrowableArray<ShenandoahBarrierStubC2*>* _stubs;
54 int _trampoline_stubs_count;
55 int _stubs_start_offset;
56 int _save_slots_offset;
57
58 public:
59 explicit ShenandoahBarrierSetC2State(Arena* comp_arena);
60
61 bool needs_liveness_data(const MachNode* mach) const override;
62 bool needs_livein_data() const override;
63
64 GrowableArray<ShenandoahBarrierStubC2*>* stubs() {
65 return _stubs;
66 }
67
68 void inc_trampoline_stubs_count() {
69 assert(_trampoline_stubs_count != INT_MAX, "Overflow");
70 ++_trampoline_stubs_count;
71 }
72
73 int trampoline_stubs_count() {
74 return _trampoline_stubs_count;
75 }
76
77 void set_stubs_start_offset(int offset) {
78 _stubs_start_offset = offset;
79 }
80
81 int stubs_start_offset() {
82 return _stubs_start_offset;
83 }
84
85 void set_save_slots_stack_offset(int offset) {
86 _save_slots_offset = offset;
87 }
88
89 int save_slots_stack_offset() {
90 assert(_save_slots_offset >= 0, "should be set");
91 return _save_slots_offset;
92 }
93 };
94
95 class ShenandoahBarrierSetC2 : public BarrierSetC2 {
96
97 static bool clone_needs_barrier(const TypeOopPtr* src_type, bool& is_oop_array);
98
99 static bool can_remove_load_barrier(Node* node);
100
101 static void refine_load(Node* node);
102 static void refine_store(const Node* node);
103
104 protected:
105 virtual Node* load_at_resolved(C2Access& access, const Type* val_type) const;
106 virtual Node* store_at_resolved(C2Access& access, C2AccessValue& val) const;
107 virtual Node* atomic_cmpxchg_val_at_resolved(C2AtomicParseAccess& access, Node* expected_val,
108 Node* new_val, const Type* val_type) const;
109 virtual Node* atomic_cmpxchg_bool_at_resolved(C2AtomicParseAccess& access, Node* expected_val,
110 Node* new_val, const Type* value_type) const;
111 virtual Node* atomic_xchg_at_resolved(C2AtomicParseAccess& access, Node* new_val, const Type* val_type) const;
112
113 public:
114 static ShenandoahBarrierSetC2* bsc2();
115
116 ShenandoahBarrierSetC2State* state() const;
117
118 // This is the entry-point for the backend to perform accesses through the Access API.
119 virtual void clone(GraphKit* kit, Node* src_base, Node* dst_base, Node* size, bool is_array) const;
120 virtual void clone_at_expansion(PhaseMacroExpand* phase, ArrayCopyNode* ac) const;
121
122 // These are general helper methods used by C2
123 virtual bool array_copy_requires_gc_barriers(bool tightly_coupled_alloc, BasicType type, bool is_clone,
124 bool is_clone_instance, ArrayCopyPhase phase) const;
125
126 // Support for GC barriers emitted during parsing
127 virtual bool expand_barriers(Compile* C, PhaseIterGVN& igvn) const;
128
129 // Support for macro expanded GC barriers
130 virtual void eliminate_gc_barrier(PhaseMacroExpand* macro, Node* node) const;
131 virtual void eliminate_gc_barrier_data(Node* node) const;
132
133 // Allow barrier sets to have shared state that is preserved across a compilation unit.
134 // This could for example comprise macro nodes to be expanded during macro expansion.
135 virtual void* create_barrier_state(Arena* comp_arena) const;
136
137 #ifdef ASSERT
138 virtual void verify_gc_barriers(Compile* compile, CompilePhase phase) const;
139 static void verify_gc_barrier_assert(bool cond, const char* msg, uint8_t bd, Node* n);
140 #endif
141
142 int reserved_slots() const { return 4; }
143 int estimate_stub_size() const /* override */;
144 void emit_stubs(CodeBuffer& cb) const /* override */;
145 void late_barrier_analysis() const /* override*/ {
146 compute_liveness_at_stubs();
147 analyze_dominating_barriers();
148 }
149
150 void elide_dominated_barrier(MachNode* mach) const;
151 void analyze_dominating_barriers() const;
152 void strip_extra_data(const Node* node) const;
153 void strip_extra_data(Node_List& accesses) const;
154
155 virtual uint estimated_barrier_size(const Node* node) const;
156
157 static void print_barrier_data(outputStream* os, uint8_t data);
158 };
159
160 class ShenandoahBarrierStubC2 : public BarrierStubC2 {
161 Register _obj;
162 Address const _addr;
163 const bool _do_load;
164 const bool _narrow;
165 const bool _maybe_null;
166 const bool _needs_load_ref_barrier;
167 const bool _needs_load_ref_weak_barrier;
168 const bool _needs_keep_alive_barrier;
169 const int _fastpath_branch_offset;
170 bool _test_and_branch_reachable;
171 bool _skip_trampoline;
172 Label _test_and_branch_reachable_entry;
173 int _save_slots_idx;
174
175 static void register_stub(ShenandoahBarrierStubC2* stub);
176 static void inc_trampoline_stubs_count();
177 static int trampoline_stubs_count();
178 static int stubs_start_offset();
179 static int save_slots_stack_offset();
180
181 // Manage save slots on stack. We cannot move SP freely when in statically-sized
182 // C2 frame. These methods emulate the stack where a stub can save registers temporarily
183 // without moving SP.
184 void push_save_register(MacroAssembler& masm, Register reg);
185 void pop_save_register(MacroAssembler& masm, Register reg);
186 bool push_save_register_if_live(MacroAssembler& masm, Register reg);
187 int push_save_slot();
188 int pop_save_slot();
189
190 bool is_live(Register reg);
191 Register select_temp_register(bool& selected_live, Address addr, Register reg1);
192
193 void keepalive(MacroAssembler& masm, Register obj, Register tmp1, Register tmp2);
194 void lrb(MacroAssembler& masm, Register obj, Address addr, Register tmp);
195
196 address keepalive_runtime_entry_addr();
197 address lrb_runtime_entry_addr();
198
199 void emit_code_actual(MacroAssembler& masm);
200
201 int get_stub_size();
202 void post_init(int offset);
203
204 public:
205 ShenandoahBarrierStubC2(const MachNode* node, Register obj, Address addr, bool narrow, bool do_load, int offset) :
206 BarrierStubC2(node),
207 _obj(obj),
208 _addr(addr),
209 _do_load(do_load),
210 _narrow(narrow),
211 _maybe_null(maybe_null(node)),
212 _needs_load_ref_barrier(needs_load_ref_barrier(node)),
213 _needs_load_ref_weak_barrier(needs_load_ref_barrier_weak(node)),
214 _needs_keep_alive_barrier(needs_keep_alive_barrier(node)),
215 _fastpath_branch_offset(offset),
216 _test_and_branch_reachable(),
217 _skip_trampoline(),
218 _test_and_branch_reachable_entry(),
219 _save_slots_idx(0) {
220 assert(!_narrow || is_heap_access(node), "Only heap accesses can be narrow");
221 post_init(offset);
222 }
223
224 static bool is_heap_access(const MachNode* node) {
225 return (node->barrier_data() & ShenandoahBitNative) == 0;
226 }
227 static bool needs_slow_barrier(const MachNode* node) {
228 return needs_load_ref_barrier(node) || needs_keep_alive_barrier(node);
229 }
230 static bool needs_load_ref_barrier(const MachNode* node) {
231 return (node->barrier_data() & (ShenandoahBitStrong | ShenandoahBitWeak | ShenandoahBitPhantom)) != 0;
232 }
233 static bool needs_load_ref_barrier_weak(const MachNode* node) {
234 return (node->barrier_data() & (ShenandoahBitWeak | ShenandoahBitPhantom)) != 0;
235 }
236 static bool needs_keep_alive_barrier(const MachNode* node) {
237 return (node->barrier_data() & ShenandoahBitKeepAlive) != 0;
238 }
239 static bool needs_card_barrier(const MachNode* node) {
240 return (node->barrier_data() & ShenandoahBitCardMark) != 0;
241 }
242 static bool maybe_null(const MachNode* node) {
243 return (node->barrier_data() & ShenandoahBitNotNull) == 0;
244 }
245
246 static ShenandoahBarrierStubC2* create(const MachNode* node, Register obj, Address addr, bool narrow, bool do_load, int offset = 0);
247 void emit_code(MacroAssembler& masm);
248
249 void enter_if_gc_state(MacroAssembler& masm, const char test_state);
250 };
251 #endif // SHARE_GC_SHENANDOAH_C2_SHENANDOAHBARRIERSETC2_HPP