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