1 /*
2 * Copyright (c) 2019, 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 #ifndef SHARE_GC_SHARED_BARRIERSET_INLINE_HPP
25 #define SHARE_GC_SHARED_BARRIERSET_INLINE_HPP
26
27 #include "gc/shared/barrierSet.hpp"
28
29 #include "oops/accessDecorators.hpp"
30 #include "oops/arrayOop.hpp"
31 #include "oops/compressedOops.inline.hpp"
32 #include "oops/objArrayOop.inline.hpp"
33 #include "oops/oop.hpp"
34 #include "runtime/javaThread.hpp"
35 #include "runtime/thread.hpp"
36
37 template <DecoratorSet decorators, typename BarrierSetT>
38 template <typename T>
39 inline void BarrierSet::AccessBarrier<decorators, BarrierSetT>::oop_arraycopy_in_heap(arrayOop src_obj, size_t src_offset_in_bytes, T* src_raw,
40 arrayOop dst_obj, size_t dst_offset_in_bytes, T* dst_raw,
41 size_t length) {
42 T* src = arrayOopDesc::obj_offset_to_raw(src_obj, src_offset_in_bytes, src_raw);
43 T* dst = arrayOopDesc::obj_offset_to_raw(dst_obj, dst_offset_in_bytes, dst_raw);
44
45 if ((!HasDecorator<decorators, ARRAYCOPY_CHECKCAST>::value) &&
46 (!HasDecorator<decorators, ARRAYCOPY_NOTNULL>::value)) {
47 // Covariant, copy without checks
48 Raw::oop_arraycopy(nullptr, 0, src, nullptr, 0, dst, length);
49 return;
50 }
51
52 // Copy each element with checking casts
53 Klass* const dst_klass = objArrayOop(dst_obj)->element_klass();
54 for (const T* const end = src + length; src < end; src++, dst++) {
55 const T elem = *src;
56 if (HasDecorator<decorators, ARRAYCOPY_NOTNULL>::value && CompressedOops::is_null(elem)) {
57 throw_array_null_pointer_store_exception(src_obj, dst_obj, JavaThread::current());
58 return;
59 }
60 if (HasDecorator<decorators, ARRAYCOPY_CHECKCAST>::value &&
61 (!oopDesc::is_instanceof_or_null(CompressedOops::decode(elem), dst_klass))) {
62 throw_array_store_exception(src_obj, dst_obj, JavaThread::current());
63 return;
64 }
65 *dst = elem;
66 }
67 }
68
69 #endif // SHARE_GC_SHARED_BARRIERSET_INLINE_HPP