< prev index next >

src/hotspot/cpu/s390/gc/shared/barrierSetAssembler_s390.cpp

Print this page




   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 "gc/shared/barrierSetAssembler.hpp"
  28 #include "interpreter/interp_masm.hpp"
  29 
  30 #define __ masm->
  31 
  32 void BarrierSetAssembler::arraycopy_epilogue(MacroAssembler* masm, DecoratorSet decorators, BasicType type,
  33                                              Register dst, Register count, bool do_return) {
  34   if (do_return) { __ z_br(Z_R14); }
  35 }
  36 
  37 void BarrierSetAssembler::load_at(MacroAssembler* masm, DecoratorSet decorators, BasicType type,
  38                                   const Address& addr, Register dst, Register tmp1, Register tmp2, Label *is_null) {
  39   bool on_heap = (decorators & IN_HEAP) != 0;
  40   bool on_root = (decorators & IN_ROOT) != 0;
  41   assert(on_heap || on_root, "where?");
  42 
  43   switch (type) {
  44   case T_ARRAY:
  45   case T_OBJECT: {
  46     if (UseCompressedOops && on_heap) {




   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 "asm/macroAssembler.inline.hpp"
  28 #include "gc/shared/barrierSetAssembler.hpp"
  29 #include "interpreter/interp_masm.hpp"
  30 
  31 #define __ masm->
  32 
  33 void BarrierSetAssembler::arraycopy_epilogue(MacroAssembler* masm, DecoratorSet decorators, BasicType type,
  34                                              Register dst, Register count, bool do_return) {
  35   if (do_return) { __ z_br(Z_R14); }
  36 }
  37 
  38 void BarrierSetAssembler::load_at(MacroAssembler* masm, DecoratorSet decorators, BasicType type,
  39                                   const Address& addr, Register dst, Register tmp1, Register tmp2, Label *is_null) {
  40   bool on_heap = (decorators & IN_HEAP) != 0;
  41   bool on_root = (decorators & IN_ROOT) != 0;
  42   assert(on_heap || on_root, "where?");
  43 
  44   switch (type) {
  45   case T_ARRAY:
  46   case T_OBJECT: {
  47     if (UseCompressedOops && on_heap) {


< prev index next >