1 /*
   2  * Copyright (c) 2018, 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/modRefBarrierSetAssembler.hpp"
  28 
  29 #define __ masm->
  30 
  31 void ModRefBarrierSetAssembler::arraycopy_prologue(MacroAssembler* masm, DecoratorSet decorators, BasicType type,
  32                                                    Register src, Register dst, Register count) {
  33   bool checkcast = (decorators & ARRAYCOPY_CHECKCAST) != 0;
  34   bool disjoint = (decorators & ARRAYCOPY_DISJOINT) != 0;
  35   bool obj_int = type == T_OBJECT LP64_ONLY(&& UseCompressedOops);
  36 
  37   if (type == T_OBJECT || type == T_ARRAY) {
  38 #ifdef _LP64
  39     if (!checkcast && !obj_int) {
  40       // Save count for barrier
  41       __ movptr(r11, count);
  42     } else if (disjoint && obj_int) {
  43       // Save dst in r11 in the disjoint case
  44       __ movq(r11, dst);
  45     }
  46 #else
  47     if (disjoint) {
  48       __ mov(rdx, dst);          // save 'to'
  49     }
  50 #endif
  51     gen_write_ref_array_pre_barrier(masm, decorators, dst, count);
  52   }
  53 }
  54 
  55 void ModRefBarrierSetAssembler::arraycopy_epilogue(MacroAssembler* masm, DecoratorSet decorators, BasicType type,
  56                                                    Register src, Register dst, Register count) {
  57   bool checkcast = (decorators & ARRAYCOPY_CHECKCAST) != 0;
  58   bool disjoint = (decorators & ARRAYCOPY_DISJOINT) != 0;
  59   bool obj_int = type == T_OBJECT LP64_ONLY(&& UseCompressedOops);
  60   Register tmp = rax;
  61 
  62   if (type == T_OBJECT || type == T_ARRAY) {
  63 #ifdef _LP64
  64     if (!checkcast && !obj_int) {
  65       // Save count for barrier
  66       count = r11;
  67     } else if (disjoint && obj_int) {
  68       // Use the saved dst in the disjoint case
  69       dst = r11;
  70     } else if (checkcast) {
  71       tmp = rscratch1;
  72     }
  73 #else
  74     if (disjoint) {
  75       __ mov(dst, rdx); // restore 'to'
  76     }
  77 #endif
  78     gen_write_ref_array_post_barrier(masm, decorators, dst, count, tmp);
  79   }
  80 }
  81 
  82 void ModRefBarrierSetAssembler::store_at(MacroAssembler* masm, DecoratorSet decorators, BasicType type,
  83                                          Address dst, Register val, Register tmp1, Register tmp2) {
  84   if (type == T_OBJECT || type == T_ARRAY) {
  85     oop_store_at(masm, decorators, type, dst, val, tmp1, tmp2);
  86   } else {
  87     BarrierSetAssembler::store_at(masm, decorators, type, dst, val, tmp1, tmp2);
  88   }
  89 }