1 /* 2 * Copyright (c) 2017, 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 #ifndef SHARE_VM_OOPS_VALUEKLASS_INLINE_HPP 25 #define SHARE_VM_OOPS_VALUEKLASS_INLINE_HPP 26 27 #include "memory/iterator.hpp" 28 #include "oops/klass.hpp" 29 #include "oops/valueArrayKlass.hpp" 30 #include "oops/oop.inline.hpp" 31 #include "oops/valueKlass.hpp" 32 #include "utilities/macros.hpp" 33 34 inline ValueKlass* ValueKlass::cast(Klass* k) { 35 assert(k->is_value(), "cast to ValueKlass"); 36 return (ValueKlass*) k; 37 } 38 39 inline address ValueKlass::data_for_oop(oop o) const { 40 return ((address) (void*) o) + first_field_offset(); 41 } 42 43 inline oop ValueKlass::oop_for_data(address data) const { 44 oop o = (oop) (data - first_field_offset()); 45 assert(oopDesc::is_oop(o, false), "Not an oop"); 46 return o; 47 } 48 49 inline void ValueKlass::value_copy_payload_to_new_oop(void* src, oop dst) { 50 HeapAccess<IS_DEST_UNINITIALIZED>::value_copy(src, data_for_oop(dst), this); 51 } 52 53 inline void ValueKlass::value_copy_oop_to_new_oop(oop src, oop dst) { 54 HeapAccess<IS_DEST_UNINITIALIZED>::value_copy(data_for_oop(src), data_for_oop(dst), this); 55 } 56 57 inline void ValueKlass::value_copy_oop_to_new_payload(oop src, void* dst) { 58 HeapAccess<IS_DEST_UNINITIALIZED>::value_copy(data_for_oop(src), dst, this); 59 } 60 61 inline void ValueKlass::value_copy_oop_to_payload(oop src, void* dst) { 62 HeapAccess<>::value_copy(data_for_oop(src), dst, this); 63 } 64 65 66 template <typename T, class OopClosureType> 67 void ValueKlass::oop_iterate_specialized(const address oop_addr, OopClosureType* closure) { 68 OopMapBlock* map = start_of_nonstatic_oop_maps(); 69 OopMapBlock* const end_map = map + nonstatic_oop_map_count(); 70 71 for (; map < end_map; map++) { 72 T* p = (T*) (oop_addr + map->offset()); 73 T* const end = p + map->count(); 74 for (; p < end; ++p) { 75 Devirtualizer::do_oop(closure, p); 76 } 77 } 78 } 79 80 template <typename T, class OopClosureType> 81 inline void ValueKlass::oop_iterate_specialized_bounded(const address oop_addr, OopClosureType* closure, void* lo, void* hi) { 82 OopMapBlock* map = start_of_nonstatic_oop_maps(); 83 OopMapBlock* const end_map = map + nonstatic_oop_map_count(); 84 85 T* const l = (T*) lo; 86 T* const h = (T*) hi; 87 88 for (; map < end_map; map++) { 89 T* p = (T*) (oop_addr + map->offset()); 90 T* end = p + map->count(); 91 if (p < l) { 92 p = l; 93 } 94 if (end > h) { 95 end = h; 96 } 97 for (; p < end; ++p) { 98 Devirtualizer::do_oop(closure, p); 99 } 100 } 101 } 102 103 104 #endif // SHARE_VM_OOPS_VALUEKLASS_INLINE_HPP