1 /*
2 * Copyright (c) 2018, 2022, 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 #include "precompiled.hpp"
26 #include "c1/c1_IR.hpp"
27 #include "gc/shared/satbMarkQueue.hpp"
28 #include "gc/shenandoah/shenandoahBarrierSet.hpp"
29 #include "gc/shenandoah/shenandoahBarrierSetAssembler.hpp"
30 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
31 #include "gc/shenandoah/shenandoahHeapRegion.hpp"
32 #include "gc/shenandoah/shenandoahRuntime.hpp"
33 #include "gc/shenandoah/shenandoahThreadLocalData.hpp"
34 #include "gc/shenandoah/c1/shenandoahBarrierSetC1.hpp"
35
36 #ifdef ASSERT
37 #define __ gen->lir(__FILE__, __LINE__)->
38 #else
39 #define __ gen->lir()->
40 #endif
41
42 void ShenandoahPreBarrierStub::emit_code(LIR_Assembler* ce) {
43 ShenandoahBarrierSetAssembler* bs = (ShenandoahBarrierSetAssembler*)BarrierSet::barrier_set()->barrier_set_assembler();
44 bs->gen_pre_barrier_stub(ce, this);
45 }
46
47 void ShenandoahLoadReferenceBarrierStub::emit_code(LIR_Assembler* ce) {
176 }
177 return obj;
178 }
179
180 LIR_Opr ShenandoahBarrierSetC1::iu_barrier(LIRGenerator* gen, LIR_Opr obj, CodeEmitInfo* info, DecoratorSet decorators) {
181 if (ShenandoahIUBarrier) {
182 obj = ensure_in_register(gen, obj, T_OBJECT);
183 pre_barrier(gen, info, decorators, LIR_OprFact::illegalOpr, obj);
184 }
185 return obj;
186 }
187
188 void ShenandoahBarrierSetC1::store_at_resolved(LIRAccess& access, LIR_Opr value) {
189 if (access.is_oop()) {
190 if (ShenandoahSATBBarrier) {
191 pre_barrier(access.gen(), access.access_emit_info(), access.decorators(), access.resolved_addr(), LIR_OprFact::illegalOpr /* pre_val */);
192 }
193 value = iu_barrier(access.gen(), value, access.access_emit_info(), access.decorators());
194 }
195 BarrierSetC1::store_at_resolved(access, value);
196 }
197
198 LIR_Opr ShenandoahBarrierSetC1::resolve_address(LIRAccess& access, bool resolve_in_register) {
199 // We must resolve in register when patching. This is to avoid
200 // having a patch area in the load barrier stub, since the call
201 // into the runtime to patch will not have the proper oop map.
202 const bool patch_before_barrier = access.is_oop() && (access.decorators() & C1_NEEDS_PATCHING) != 0;
203 return BarrierSetC1::resolve_address(access, resolve_in_register || patch_before_barrier);
204 }
205
206 void ShenandoahBarrierSetC1::load_at_resolved(LIRAccess& access, LIR_Opr result) {
207 // 1: non-reference load, no additional barrier is needed
208 if (!access.is_oop()) {
209 BarrierSetC1::load_at_resolved(access, result);
210 return;
211 }
212
213 LIRGenerator* gen = access.gen();
214 DecoratorSet decorators = access.decorators();
215 BasicType type = access.type();
274 _load_reference_barrier_strong_rt_code_blob = Runtime1::generate_blob(buffer_blob, -1,
275 "shenandoah_load_reference_barrier_strong_slow",
276 false, &lrb_strong_code_gen_cl);
277
278 C1ShenandoahLoadReferenceBarrierCodeGenClosure lrb_strong_native_code_gen_cl(ON_STRONG_OOP_REF | IN_NATIVE);
279 _load_reference_barrier_strong_native_rt_code_blob = Runtime1::generate_blob(buffer_blob, -1,
280 "shenandoah_load_reference_barrier_strong_native_slow",
281 false, &lrb_strong_native_code_gen_cl);
282
283 C1ShenandoahLoadReferenceBarrierCodeGenClosure lrb_weak_code_gen_cl(ON_WEAK_OOP_REF);
284 _load_reference_barrier_weak_rt_code_blob = Runtime1::generate_blob(buffer_blob, -1,
285 "shenandoah_load_reference_barrier_weak_slow",
286 false, &lrb_weak_code_gen_cl);
287
288 C1ShenandoahLoadReferenceBarrierCodeGenClosure lrb_phantom_code_gen_cl(ON_PHANTOM_OOP_REF | IN_NATIVE);
289 _load_reference_barrier_phantom_rt_code_blob = Runtime1::generate_blob(buffer_blob, -1,
290 "shenandoah_load_reference_barrier_phantom_slow",
291 false, &lrb_phantom_code_gen_cl);
292 }
293 }
|
1 /*
2 * Copyright (c) 2018, 2022, 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 #include "precompiled.hpp"
27 #include "c1/c1_IR.hpp"
28 #include "gc/shared/satbMarkQueue.hpp"
29 #include "gc/shenandoah/mode/shenandoahMode.hpp"
30 #include "gc/shenandoah/shenandoahBarrierSet.hpp"
31 #include "gc/shenandoah/shenandoahBarrierSetAssembler.hpp"
32 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
33 #include "gc/shenandoah/shenandoahHeapRegion.hpp"
34 #include "gc/shenandoah/shenandoahRuntime.hpp"
35 #include "gc/shenandoah/shenandoahThreadLocalData.hpp"
36 #include "gc/shenandoah/c1/shenandoahBarrierSetC1.hpp"
37
38 #ifdef ASSERT
39 #define __ gen->lir(__FILE__, __LINE__)->
40 #else
41 #define __ gen->lir()->
42 #endif
43
44 void ShenandoahPreBarrierStub::emit_code(LIR_Assembler* ce) {
45 ShenandoahBarrierSetAssembler* bs = (ShenandoahBarrierSetAssembler*)BarrierSet::barrier_set()->barrier_set_assembler();
46 bs->gen_pre_barrier_stub(ce, this);
47 }
48
49 void ShenandoahLoadReferenceBarrierStub::emit_code(LIR_Assembler* ce) {
178 }
179 return obj;
180 }
181
182 LIR_Opr ShenandoahBarrierSetC1::iu_barrier(LIRGenerator* gen, LIR_Opr obj, CodeEmitInfo* info, DecoratorSet decorators) {
183 if (ShenandoahIUBarrier) {
184 obj = ensure_in_register(gen, obj, T_OBJECT);
185 pre_barrier(gen, info, decorators, LIR_OprFact::illegalOpr, obj);
186 }
187 return obj;
188 }
189
190 void ShenandoahBarrierSetC1::store_at_resolved(LIRAccess& access, LIR_Opr value) {
191 if (access.is_oop()) {
192 if (ShenandoahSATBBarrier) {
193 pre_barrier(access.gen(), access.access_emit_info(), access.decorators(), access.resolved_addr(), LIR_OprFact::illegalOpr /* pre_val */);
194 }
195 value = iu_barrier(access.gen(), value, access.access_emit_info(), access.decorators());
196 }
197 BarrierSetC1::store_at_resolved(access, value);
198
199 if (ShenandoahCardBarrier && access.is_oop()) {
200 DecoratorSet decorators = access.decorators();
201 bool is_array = (decorators & IS_ARRAY) != 0;
202 bool on_anonymous = (decorators & ON_UNKNOWN_OOP_REF) != 0;
203
204 bool precise = is_array || on_anonymous;
205 LIR_Opr post_addr = precise ? access.resolved_addr() : access.base().opr();
206 post_barrier(access, post_addr, value);
207 }
208 }
209
210 LIR_Opr ShenandoahBarrierSetC1::resolve_address(LIRAccess& access, bool resolve_in_register) {
211 // We must resolve in register when patching. This is to avoid
212 // having a patch area in the load barrier stub, since the call
213 // into the runtime to patch will not have the proper oop map.
214 const bool patch_before_barrier = access.is_oop() && (access.decorators() & C1_NEEDS_PATCHING) != 0;
215 return BarrierSetC1::resolve_address(access, resolve_in_register || patch_before_barrier);
216 }
217
218 void ShenandoahBarrierSetC1::load_at_resolved(LIRAccess& access, LIR_Opr result) {
219 // 1: non-reference load, no additional barrier is needed
220 if (!access.is_oop()) {
221 BarrierSetC1::load_at_resolved(access, result);
222 return;
223 }
224
225 LIRGenerator* gen = access.gen();
226 DecoratorSet decorators = access.decorators();
227 BasicType type = access.type();
286 _load_reference_barrier_strong_rt_code_blob = Runtime1::generate_blob(buffer_blob, -1,
287 "shenandoah_load_reference_barrier_strong_slow",
288 false, &lrb_strong_code_gen_cl);
289
290 C1ShenandoahLoadReferenceBarrierCodeGenClosure lrb_strong_native_code_gen_cl(ON_STRONG_OOP_REF | IN_NATIVE);
291 _load_reference_barrier_strong_native_rt_code_blob = Runtime1::generate_blob(buffer_blob, -1,
292 "shenandoah_load_reference_barrier_strong_native_slow",
293 false, &lrb_strong_native_code_gen_cl);
294
295 C1ShenandoahLoadReferenceBarrierCodeGenClosure lrb_weak_code_gen_cl(ON_WEAK_OOP_REF);
296 _load_reference_barrier_weak_rt_code_blob = Runtime1::generate_blob(buffer_blob, -1,
297 "shenandoah_load_reference_barrier_weak_slow",
298 false, &lrb_weak_code_gen_cl);
299
300 C1ShenandoahLoadReferenceBarrierCodeGenClosure lrb_phantom_code_gen_cl(ON_PHANTOM_OOP_REF | IN_NATIVE);
301 _load_reference_barrier_phantom_rt_code_blob = Runtime1::generate_blob(buffer_blob, -1,
302 "shenandoah_load_reference_barrier_phantom_slow",
303 false, &lrb_phantom_code_gen_cl);
304 }
305 }
306
307 void ShenandoahBarrierSetC1::post_barrier(LIRAccess& access, LIR_Opr addr, LIR_Opr new_val) {
308 assert(ShenandoahCardBarrier, "Did you mean to enable ShenandoahCardBarrier?");
309
310 DecoratorSet decorators = access.decorators();
311 LIRGenerator* gen = access.gen();
312 bool in_heap = (decorators & IN_HEAP) != 0;
313 if (!in_heap) {
314 return;
315 }
316
317 BarrierSet* bs = BarrierSet::barrier_set();
318 ShenandoahBarrierSet* ctbs = barrier_set_cast<ShenandoahBarrierSet>(bs);
319 CardTable* ct = ctbs->card_table();
320 LIR_Const* card_table_base = new LIR_Const(ct->byte_map_base());
321 if (addr->is_address()) {
322 LIR_Address* address = addr->as_address_ptr();
323 // ptr cannot be an object because we use this barrier for array card marks
324 // and addr can point in the middle of an array.
325 LIR_Opr ptr = gen->new_pointer_register();
326 if (!address->index()->is_valid() && address->disp() == 0) {
327 __ move(address->base(), ptr);
328 } else {
329 assert(address->disp() != max_jint, "lea doesn't support patched addresses!");
330 __ leal(addr, ptr);
331 }
332 addr = ptr;
333 }
334 assert(addr->is_register(), "must be a register at this point");
335
336 LIR_Opr tmp = gen->new_pointer_register();
337 if (two_operand_lir_form) {
338 __ move(addr, tmp);
339 __ unsigned_shift_right(tmp, CardTable::card_shift(), tmp);
340 } else {
341 __ unsigned_shift_right(addr, CardTable::card_shift(), tmp);
342 }
343
344 LIR_Address* card_addr;
345 if (gen->can_inline_as_constant(card_table_base)) {
346 card_addr = new LIR_Address(tmp, card_table_base->as_jint(), T_BYTE);
347 } else {
348 card_addr = new LIR_Address(tmp, gen->load_constant(card_table_base), T_BYTE);
349 }
350
351 LIR_Opr dirty = LIR_OprFact::intConst(CardTable::dirty_card_val());
352 if (UseCondCardMark) {
353 LIR_Opr cur_value = gen->new_register(T_INT);
354 __ move(card_addr, cur_value);
355
356 LabelObj* L_already_dirty = new LabelObj();
357 __ cmp(lir_cond_equal, cur_value, dirty);
358 __ branch(lir_cond_equal, L_already_dirty->label());
359 __ move(dirty, card_addr);
360 __ branch_destination(L_already_dirty->label());
361 } else {
362 __ move(dirty, card_addr);
363 }
364 }
|