1 /* 2 * Copyright (c) 2016, Oracle and/or its affiliates. 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 "asm/macroAssembler.inline.hpp" 27 #include "gc/shared/modRefBSCodeGen.hpp" 28 29 #define __ masm-> 30 31 void ModRefBSCodeGen::arraycopy_prologue(MacroAssembler* masm, DecoratorSet decorators, BasicType type, 32 Register src, Register dst, Register count) { 33 bool covariant = (decorators & DEST_COVARIANT) != 0; 34 bool conjoint = (decorators & DEST_CONJOINT) != 0; 35 bool disjoint = (decorators & DEST_DISJOINT) != 0; 36 bool obj_int = type == T_OBJECT LP64_ONLY(&& UseCompressedOops); 37 38 if (type == T_OBJECT || type == T_ARRAY) { 39 if (covariant && !obj_int) { 40 // Save count for barrier 41 __ movptr(r11, count); 42 } else if (covariant && disjoint && obj_int) { 43 // Save dst in r11 in the disjoint covariant case 44 __ movq(r11, dst); 45 } 46 gen_write_ref_array_pre_barrier(masm, decorators, dst, count); 47 } 48 } 49 50 void ModRefBSCodeGen::arraycopy_epilogue(MacroAssembler* masm, DecoratorSet decorators, BasicType type, 51 Register src, Register dst, Register count) { 52 bool covariant = (decorators & DEST_COVARIANT) != 0; 53 bool contravariant = (decorators & DEST_CONTRAVARIANT) != 0; 54 bool disjoint = (decorators & DEST_DISJOINT) != 0; 55 bool obj_int = type == T_OBJECT LP64_ONLY(&& UseCompressedOops); 56 Register tmp = rax; 57 58 if (type == T_OBJECT || type == T_ARRAY) { 59 if (covariant && !obj_int) { 60 // Save count for barrier 61 count = r11; 62 } else if (covariant && disjoint && obj_int) { 63 // Use the saved dst in the disjoint covariant case 64 dst = r11; 65 } else if (contravariant && disjoint) { 66 tmp = rscratch1; 67 } 68 gen_write_ref_array_post_barrier(masm, decorators, dst, count, tmp); 69 } 70 } 71 72 void ModRefBSCodeGen::oop_store_at(MacroAssembler* masm, DecoratorSet decorators, BasicType type, 73 Address dst, Register val, Register tmp1, Register tmp2) { 74 BarrierSetCodeGen::store_at(masm, decorators, type, dst, val, tmp1, tmp2); 75 } 76 77 void ModRefBSCodeGen::store_at(MacroAssembler* masm, DecoratorSet decorators, BasicType type, 78 Address dst, Register val, Register tmp1, Register tmp2) { 79 if (type == T_OBJECT || type == T_ARRAY) { 80 oop_store_at(masm, decorators, type, dst, val, tmp1, tmp2); 81 } else { 82 BarrierSetCodeGen::store_at(masm, decorators, type, dst, val, tmp1, tmp2); 83 } 84 }