/* * Copyright (c) 2018, 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. * */ #include "precompiled.hpp" #include "gc/shared/barrierSetAssembler.hpp" #include "gc/shared/collectedHeap.hpp" #include "memory/universe.hpp" #include "runtime/jniHandles.hpp" #include "runtime/thread.hpp" #define __ masm-> void BarrierSetAssembler::load_at(MacroAssembler* masm, DecoratorSet decorators, BasicType type, Register dst, Address src, Register tmp1, Register tmp_thread) { // LR is live. It must be saved around calls. bool in_heap = (decorators & IN_HEAP) != 0; bool in_native = (decorators & IN_NATIVE) != 0; bool is_not_null = (decorators & IS_NOT_NULL) != 0; switch (type) { case T_OBJECT: case T_ARRAY: { if (in_heap) { if (UseCompressedOops) { __ ldrw(dst, src); if (is_not_null) { __ decode_heap_oop_not_null(dst); } else { __ decode_heap_oop(dst); } } else { __ ldr(dst, src); } } else { assert(in_native, "why else?"); __ ldr(dst, src); } break; } case T_BOOLEAN: __ load_unsigned_byte (dst, src); break; case T_BYTE: __ load_signed_byte (dst, src); break; case T_CHAR: __ load_unsigned_short(dst, src); break; case T_SHORT: __ load_signed_short (dst, src); break; case T_INT: __ ldrw (dst, src); break; case T_LONG: __ ldr (dst, src); break; case T_ADDRESS: __ ldr (dst, src); break; case T_FLOAT: __ ldrs (v0, src); break; case T_DOUBLE: __ ldrd (v0, src); break; default: Unimplemented(); } } void BarrierSetAssembler::store_at(MacroAssembler* masm, DecoratorSet decorators, BasicType type, Address dst, Register val, Register tmp1, Register tmp2, Register tmp3) { bool in_heap = (decorators & IN_HEAP) != 0; bool in_native = (decorators & IN_NATIVE) != 0; bool is_not_null = (decorators & IS_NOT_NULL) != 0; switch (type) { case T_OBJECT: case T_ARRAY: { if (in_heap) { if (val == noreg) { assert(!is_not_null, "inconsistent access"); if (UseCompressedOops) { __ strw(zr, dst); } else { __ str(zr, dst); } } else { if (UseCompressedOops) { assert(!dst.uses(val), "not enough registers"); if (is_not_null) { __ encode_heap_oop_not_null(val); } else { __ encode_heap_oop(val); } __ strw(val, dst); } else { __ str(val, dst); } } } else { assert(in_native, "why else?"); assert(val != noreg, "not supported"); __ str(val, dst); } break; } case T_BOOLEAN: __ andw(val, val, 0x1); // boolean is true if LSB is 1 __ strb(val, dst); break; case T_BYTE: __ strb(val, dst); break; case T_CHAR: __ strh(val, dst); break; case T_SHORT: __ strh(val, dst); break; case T_INT: __ strw(val, dst); break; case T_LONG: __ str (val, dst); break; case T_ADDRESS: __ str (val, dst); break; case T_FLOAT: __ strs(v0, dst); break; case T_DOUBLE: __ strd(v0, dst); break; default: Unimplemented(); } } void BarrierSetAssembler::obj_equals(MacroAssembler* masm, Register obj1, Register obj2) { __ cmp(obj1, obj2); } void BarrierSetAssembler::try_resolve_jobject_in_native(MacroAssembler* masm, Register jni_env, Register obj, Register tmp, Label& slowpath) { // If mask changes we need to ensure that the inverse is still encodable as an immediate STATIC_ASSERT(JNIHandles::weak_tag_mask == 1); __ andr(obj, obj, ~JNIHandles::weak_tag_mask); __ ldr(obj, Address(obj, 0)); // *obj } // Defines obj, preserves var_size_in_bytes, okay for t2 == var_size_in_bytes. void BarrierSetAssembler::tlab_allocate(MacroAssembler* masm, Register obj, Register var_size_in_bytes, int con_size_in_bytes, Register t1, Register t2, Label& slow_case) { assert_different_registers(obj, t2); assert_different_registers(obj, var_size_in_bytes); Register end = t2; // verify_tlab(); __ ldr(obj, Address(rthread, JavaThread::tlab_top_offset())); if (var_size_in_bytes == noreg) { __ lea(end, Address(obj, con_size_in_bytes)); } else { __ lea(end, Address(obj, var_size_in_bytes)); } __ ldr(rscratch1, Address(rthread, JavaThread::tlab_end_offset())); __ cmp(end, rscratch1); __ br(Assembler::HI, slow_case); // update the tlab top pointer __ str(end, Address(rthread, JavaThread::tlab_top_offset())); // recover var_size_in_bytes if necessary if (var_size_in_bytes == end) { __ sub(var_size_in_bytes, var_size_in_bytes, obj); } // verify_tlab(); } // Defines obj, preserves var_size_in_bytes void BarrierSetAssembler::eden_allocate(MacroAssembler* masm, Register obj, Register var_size_in_bytes, int con_size_in_bytes, Register t1, Label& slow_case) { assert_different_registers(obj, var_size_in_bytes, t1); if (!Universe::heap()->supports_inline_contig_alloc()) { __ b(slow_case); } else { Register end = t1; Register heap_end = rscratch2; Label retry; __ bind(retry); { unsigned long offset; __ adrp(rscratch1, ExternalAddress((address) Universe::heap()->end_addr()), offset); __ ldr(heap_end, Address(rscratch1, offset)); } ExternalAddress heap_top((address) Universe::heap()->top_addr()); // Get the current top of the heap { unsigned long offset; __ adrp(rscratch1, heap_top, offset); // Use add() here after ARDP, rather than lea(). // lea() does not generate anything if its offset is zero. // However, relocs expect to find either an ADD or a load/store // insn after an ADRP. add() always generates an ADD insn, even // for add(Rn, Rn, 0). __ add(rscratch1, rscratch1, offset); __ ldaxr(obj, rscratch1); } // Adjust it my the size of our new object if (var_size_in_bytes == noreg) { __ lea(end, Address(obj, con_size_in_bytes)); } else { __ lea(end, Address(obj, var_size_in_bytes)); } // if end < obj then we wrapped around high memory __ cmp(end, obj); __ br(Assembler::LO, slow_case); __ cmp(end, heap_end); __ br(Assembler::HI, slow_case); // If heap_top hasn't been changed by some other thread, update it. __ stlxr(rscratch2, end, rscratch1); __ cbnzw(rscratch2, retry); incr_allocated_bytes(masm, var_size_in_bytes, con_size_in_bytes, t1); } } void BarrierSetAssembler::incr_allocated_bytes(MacroAssembler* masm, Register var_size_in_bytes, int con_size_in_bytes, Register t1) { assert(t1->is_valid(), "need temp reg"); __ ldr(t1, Address(rthread, in_bytes(JavaThread::allocated_bytes_offset()))); if (var_size_in_bytes->is_valid()) { __ add(t1, t1, var_size_in_bytes); } else { __ add(t1, t1, con_size_in_bytes); } __ str(t1, Address(rthread, in_bytes(JavaThread::allocated_bytes_offset()))); } void BarrierSetAssembler::nmethod_entry_barrier(MacroAssembler* masm) { // FIXME: 8210498: nmethod entry barriers is not implemented #if 0 BarrierSetNMethod* bs_nm = BarrierSet::barrier_set()->barrier_set_nmethod(); if (bs_nm == NULL) { return; } Label continuation; Address disarmed_addr(rthread, in_bytes(bs_nm->thread_disarmed_offset())); __ align(8); __ ldr(rscratch1, disarmed_addr); __ cbz(rscratch1, continuation); __ blr(RuntimeAddress(StubRoutines::aarch64::method_entry_barrier())); __ bind(continuation); #endif }