Sat, 01 Sep 2012 13:25:18 -0400
6964458: Reimplement class meta-data storage to use native memory
Summary: Remove PermGen, allocate meta-data in metaspace linked to class loaders, rewrite GC walking, rewrite and rename metadata to be C++ classes
Reviewed-by: jmasa, stefank, never, coleenp, kvn, brutisso, mgerdin, dholmes, jrose, twisti, roland
Contributed-by: jmasa <jon.masamitsu@oracle.com>, stefank <stefan.karlsson@oracle.com>, mgerdin <mikael.gerdin@oracle.com>, never <tom.rodriguez@oracle.com>
duke@435 | 1 | /* |
coleenp@4037 | 2 | * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #ifndef SHARE_VM_OOPS_TYPEARRAYOOP_HPP |
stefank@2314 | 26 | #define SHARE_VM_OOPS_TYPEARRAYOOP_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "oops/arrayOop.hpp" |
stefank@2314 | 29 | #include "oops/typeArrayKlass.hpp" |
stefank@2314 | 30 | #ifdef TARGET_OS_ARCH_linux_x86 |
stefank@2314 | 31 | # include "orderAccess_linux_x86.inline.hpp" |
stefank@2314 | 32 | #endif |
stefank@2314 | 33 | #ifdef TARGET_OS_ARCH_linux_sparc |
stefank@2314 | 34 | # include "orderAccess_linux_sparc.inline.hpp" |
stefank@2314 | 35 | #endif |
stefank@2314 | 36 | #ifdef TARGET_OS_ARCH_linux_zero |
stefank@2314 | 37 | # include "orderAccess_linux_zero.inline.hpp" |
stefank@2314 | 38 | #endif |
stefank@2314 | 39 | #ifdef TARGET_OS_ARCH_solaris_x86 |
stefank@2314 | 40 | # include "orderAccess_solaris_x86.inline.hpp" |
stefank@2314 | 41 | #endif |
stefank@2314 | 42 | #ifdef TARGET_OS_ARCH_solaris_sparc |
stefank@2314 | 43 | # include "orderAccess_solaris_sparc.inline.hpp" |
stefank@2314 | 44 | #endif |
stefank@2314 | 45 | #ifdef TARGET_OS_ARCH_windows_x86 |
stefank@2314 | 46 | # include "orderAccess_windows_x86.inline.hpp" |
stefank@2314 | 47 | #endif |
bobv@2508 | 48 | #ifdef TARGET_OS_ARCH_linux_arm |
bobv@2508 | 49 | # include "orderAccess_linux_arm.inline.hpp" |
bobv@2508 | 50 | #endif |
bobv@2508 | 51 | #ifdef TARGET_OS_ARCH_linux_ppc |
bobv@2508 | 52 | # include "orderAccess_linux_ppc.inline.hpp" |
bobv@2508 | 53 | #endif |
never@3156 | 54 | #ifdef TARGET_OS_ARCH_bsd_x86 |
never@3156 | 55 | # include "orderAccess_bsd_x86.inline.hpp" |
never@3156 | 56 | #endif |
never@3156 | 57 | #ifdef TARGET_OS_ARCH_bsd_zero |
never@3156 | 58 | # include "orderAccess_bsd_zero.inline.hpp" |
never@3156 | 59 | #endif |
stefank@2314 | 60 | |
duke@435 | 61 | // A typeArrayOop is an array containing basic types (non oop elements). |
duke@435 | 62 | // It is used for arrays of {characters, singles, doubles, bytes, shorts, integers, longs} |
duke@435 | 63 | #include <limits.h> |
duke@435 | 64 | |
duke@435 | 65 | class typeArrayOopDesc : public arrayOopDesc { |
duke@435 | 66 | protected: |
duke@435 | 67 | jchar* char_base() const { return (jchar*) base(T_CHAR); } |
duke@435 | 68 | jboolean* bool_base() const { return (jboolean*)base(T_BOOLEAN); } |
duke@435 | 69 | jbyte* byte_base() const { return (jbyte*) base(T_BYTE); } |
duke@435 | 70 | jint* int_base() const { return (jint*) base(T_INT); } |
duke@435 | 71 | jlong* long_base() const { return (jlong*) base(T_LONG); } |
duke@435 | 72 | jshort* short_base() const { return (jshort*) base(T_SHORT); } |
duke@435 | 73 | jfloat* float_base() const { return (jfloat*) base(T_FLOAT); } |
duke@435 | 74 | jdouble* double_base() const { return (jdouble*) base(T_DOUBLE); } |
duke@435 | 75 | |
duke@435 | 76 | friend class typeArrayKlass; |
duke@435 | 77 | |
duke@435 | 78 | public: |
duke@435 | 79 | jbyte* byte_at_addr(int which) const { |
duke@435 | 80 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 81 | return &byte_base()[which]; |
duke@435 | 82 | } |
duke@435 | 83 | |
duke@435 | 84 | jboolean* bool_at_addr(int which) const { |
duke@435 | 85 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 86 | return &bool_base()[which]; |
duke@435 | 87 | } |
duke@435 | 88 | |
duke@435 | 89 | jchar* char_at_addr(int which) const { |
duke@435 | 90 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 91 | return &char_base()[which]; |
duke@435 | 92 | } |
duke@435 | 93 | |
duke@435 | 94 | jint* int_at_addr(int which) const { |
duke@435 | 95 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 96 | return &int_base()[which]; |
duke@435 | 97 | } |
duke@435 | 98 | |
duke@435 | 99 | jshort* short_at_addr(int which) const { |
duke@435 | 100 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 101 | return &short_base()[which]; |
duke@435 | 102 | } |
duke@435 | 103 | |
duke@435 | 104 | jushort* ushort_at_addr(int which) const { // for field descriptor arrays |
duke@435 | 105 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 106 | return (jushort*) &short_base()[which]; |
duke@435 | 107 | } |
duke@435 | 108 | |
duke@435 | 109 | jlong* long_at_addr(int which) const { |
duke@435 | 110 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 111 | return &long_base()[which]; |
duke@435 | 112 | } |
duke@435 | 113 | |
duke@435 | 114 | jfloat* float_at_addr(int which) const { |
duke@435 | 115 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 116 | return &float_base()[which]; |
duke@435 | 117 | } |
duke@435 | 118 | |
duke@435 | 119 | jdouble* double_at_addr(int which) const { |
duke@435 | 120 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 121 | return &double_base()[which]; |
duke@435 | 122 | } |
duke@435 | 123 | |
duke@435 | 124 | jbyte byte_at(int which) const { return *byte_at_addr(which); } |
duke@435 | 125 | void byte_at_put(int which, jbyte contents) { *byte_at_addr(which) = contents; } |
duke@435 | 126 | |
duke@435 | 127 | jboolean bool_at(int which) const { return *bool_at_addr(which); } |
duke@435 | 128 | void bool_at_put(int which, jboolean contents) { *bool_at_addr(which) = contents; } |
duke@435 | 129 | |
duke@435 | 130 | jchar char_at(int which) const { return *char_at_addr(which); } |
duke@435 | 131 | void char_at_put(int which, jchar contents) { *char_at_addr(which) = contents; } |
duke@435 | 132 | |
duke@435 | 133 | jint int_at(int which) const { return *int_at_addr(which); } |
duke@435 | 134 | void int_at_put(int which, jint contents) { *int_at_addr(which) = contents; } |
duke@435 | 135 | |
duke@435 | 136 | jshort short_at(int which) const { return *short_at_addr(which); } |
duke@435 | 137 | void short_at_put(int which, jshort contents) { *short_at_addr(which) = contents; } |
duke@435 | 138 | |
duke@435 | 139 | jushort ushort_at(int which) const { return *ushort_at_addr(which); } |
duke@435 | 140 | void ushort_at_put(int which, jushort contents) { *ushort_at_addr(which) = contents; } |
duke@435 | 141 | |
duke@435 | 142 | jlong long_at(int which) const { return *long_at_addr(which); } |
duke@435 | 143 | void long_at_put(int which, jlong contents) { *long_at_addr(which) = contents; } |
duke@435 | 144 | |
duke@435 | 145 | jfloat float_at(int which) const { return *float_at_addr(which); } |
duke@435 | 146 | void float_at_put(int which, jfloat contents) { *float_at_addr(which) = contents; } |
duke@435 | 147 | |
duke@435 | 148 | jdouble double_at(int which) const { return *double_at_addr(which); } |
duke@435 | 149 | void double_at_put(int which, jdouble contents) { *double_at_addr(which) = contents; } |
duke@435 | 150 | |
duke@435 | 151 | jbyte byte_at_acquire(int which) const { return OrderAccess::load_acquire(byte_at_addr(which)); } |
duke@435 | 152 | void release_byte_at_put(int which, jbyte contents) { OrderAccess::release_store(byte_at_addr(which), contents); } |
duke@435 | 153 | |
coleenp@4037 | 154 | // Java thinks metadata arrays are just arrays of either long or int, since |
coleenp@4037 | 155 | // there doesn't seem to be T_ADDRESS, so this is a bit of unfortunate |
coleenp@4037 | 156 | // casting |
coleenp@4037 | 157 | #ifdef _LP64 |
coleenp@4037 | 158 | Metadata* metadata_at(int which) const { |
coleenp@4037 | 159 | return (Metadata*)*long_at_addr(which); } |
coleenp@4037 | 160 | void metadata_at_put(int which, Metadata* contents) { |
coleenp@4037 | 161 | *long_at_addr(which) = (long)contents; |
coleenp@4037 | 162 | } |
coleenp@4037 | 163 | #else |
coleenp@4037 | 164 | Metadata* metadata_at(int which) const { |
coleenp@4037 | 165 | return (Metadata*)*int_at_addr(which); } |
coleenp@4037 | 166 | void metadata_at_put(int which, Metadata* contents) { |
coleenp@4037 | 167 | *int_at_addr(which) = (int)contents; |
coleenp@4037 | 168 | } |
coleenp@4037 | 169 | #endif // _LP64 |
coleenp@4037 | 170 | |
duke@435 | 171 | // Sizing |
duke@435 | 172 | |
duke@435 | 173 | // Returns the number of words necessary to hold an array of "len" |
duke@435 | 174 | // elements each of the given "byte_size". |
duke@435 | 175 | private: |
duke@435 | 176 | static int object_size(int lh, int length) { |
duke@435 | 177 | int instance_header_size = Klass::layout_helper_header_size(lh); |
duke@435 | 178 | int element_shift = Klass::layout_helper_log2_element_size(lh); |
duke@435 | 179 | DEBUG_ONLY(BasicType etype = Klass::layout_helper_element_type(lh)); |
duke@435 | 180 | assert(length <= arrayOopDesc::max_array_length(etype), "no overflow"); |
duke@435 | 181 | |
duke@435 | 182 | julong size_in_bytes = length; |
duke@435 | 183 | size_in_bytes <<= element_shift; |
duke@435 | 184 | size_in_bytes += instance_header_size; |
duke@435 | 185 | julong size_in_words = ((size_in_bytes + (HeapWordSize-1)) >> LogHeapWordSize); |
duke@435 | 186 | assert(size_in_words <= (julong)max_jint, "no overflow"); |
duke@435 | 187 | |
duke@435 | 188 | return align_object_size((intptr_t)size_in_words); |
duke@435 | 189 | } |
duke@435 | 190 | |
duke@435 | 191 | public: |
duke@435 | 192 | int object_size() { |
duke@435 | 193 | typeArrayKlass* tk = typeArrayKlass::cast(klass()); |
duke@435 | 194 | return object_size(tk->layout_helper(), length()); |
duke@435 | 195 | } |
duke@435 | 196 | }; |
stefank@2314 | 197 | |
stefank@2314 | 198 | #endif // SHARE_VM_OOPS_TYPEARRAYOOP_HPP |