Thu, 25 Apr 2013 12:55:49 -0700
8008962: NPG: Memory regression: One extra Monitor per ConstantPool
Summary: Re-use InstanceKlass::_init_lock locking ConstantPool as well.
Reviewed-by: dholmes, coleenp, acorn
duke@435 | 1 | /* |
coleenp@4466 | 2 | * Copyright (c) 1997, 2013, 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_CONSTANTPOOLOOP_HPP |
stefank@2314 | 26 | #define SHARE_VM_OOPS_CONSTANTPOOLOOP_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "oops/arrayOop.hpp" |
coleenp@4037 | 29 | #include "oops/cpCache.hpp" |
coleenp@4037 | 30 | #include "oops/objArrayOop.hpp" |
coleenp@2497 | 31 | #include "oops/symbol.hpp" |
stefank@2314 | 32 | #include "oops/typeArrayOop.hpp" |
coleenp@4037 | 33 | #include "runtime/handles.hpp" |
stefank@2314 | 34 | #include "utilities/constantTag.hpp" |
stefank@2314 | 35 | #ifdef TARGET_ARCH_x86 |
stefank@2314 | 36 | # include "bytes_x86.hpp" |
stefank@2314 | 37 | #endif |
stefank@2314 | 38 | #ifdef TARGET_ARCH_sparc |
stefank@2314 | 39 | # include "bytes_sparc.hpp" |
stefank@2314 | 40 | #endif |
stefank@2314 | 41 | #ifdef TARGET_ARCH_zero |
stefank@2314 | 42 | # include "bytes_zero.hpp" |
stefank@2314 | 43 | #endif |
bobv@2508 | 44 | #ifdef TARGET_ARCH_arm |
bobv@2508 | 45 | # include "bytes_arm.hpp" |
bobv@2508 | 46 | #endif |
bobv@2508 | 47 | #ifdef TARGET_ARCH_ppc |
bobv@2508 | 48 | # include "bytes_ppc.hpp" |
bobv@2508 | 49 | #endif |
stefank@2314 | 50 | |
duke@435 | 51 | // A constantPool is an array containing class constants as described in the |
duke@435 | 52 | // class file. |
duke@435 | 53 | // |
duke@435 | 54 | // Most of the constant pool entries are written during class parsing, which |
coleenp@4037 | 55 | // is safe. For klass types, the constant pool entry is |
coleenp@4037 | 56 | // modified when the entry is resolved. If a klass constant pool |
duke@435 | 57 | // entry is read without a lock, only the resolved state guarantees that |
coleenp@4037 | 58 | // the entry in the constant pool is a klass object and not a Symbol*. |
duke@435 | 59 | |
duke@435 | 60 | class SymbolHashMap; |
duke@435 | 61 | |
coleenp@2497 | 62 | class CPSlot VALUE_OBJ_CLASS_SPEC { |
coleenp@2497 | 63 | intptr_t _ptr; |
coleenp@2497 | 64 | public: |
coleenp@2497 | 65 | CPSlot(intptr_t ptr): _ptr(ptr) {} |
coleenp@4037 | 66 | CPSlot(Klass* ptr): _ptr((intptr_t)ptr) {} |
coleenp@2497 | 67 | CPSlot(Symbol* ptr): _ptr((intptr_t)ptr | 1) {} |
coleenp@2497 | 68 | |
coleenp@2497 | 69 | intptr_t value() { return _ptr; } |
coleenp@4037 | 70 | bool is_resolved() { return (_ptr & 1) == 0; } |
coleenp@4037 | 71 | bool is_unresolved() { return (_ptr & 1) == 1; } |
coleenp@2497 | 72 | |
coleenp@4037 | 73 | Symbol* get_symbol() { |
coleenp@4037 | 74 | assert(is_unresolved(), "bad call"); |
coleenp@4037 | 75 | return (Symbol*)(_ptr & ~1); |
coleenp@2497 | 76 | } |
coleenp@4037 | 77 | Klass* get_klass() { |
coleenp@4037 | 78 | assert(is_resolved(), "bad call"); |
coleenp@4037 | 79 | return (Klass*)_ptr; |
coleenp@2497 | 80 | } |
coleenp@2497 | 81 | }; |
coleenp@2497 | 82 | |
acorn@4497 | 83 | class KlassSizeStats; |
coleenp@4037 | 84 | class ConstantPool : public Metadata { |
duke@435 | 85 | friend class VMStructs; |
duke@435 | 86 | friend class BytecodeInterpreter; // Directly extracts an oop in the pool for fast instanceof/checkcast |
coleenp@4037 | 87 | friend class Universe; // For null constructor |
duke@435 | 88 | private: |
coleenp@4037 | 89 | Array<u1>* _tags; // the tag array describing the constant pool's contents |
coleenp@4251 | 90 | ConstantPoolCache* _cache; // the cache holding interpreter runtime information |
coleenp@4251 | 91 | InstanceKlass* _pool_holder; // the corresponding class |
coleenp@4037 | 92 | Array<u2>* _operands; // for variable-sized (InvokeDynamic) nodes, usually empty |
coleenp@4037 | 93 | |
coleenp@4037 | 94 | // Array of resolved objects from the constant pool and map from resolved |
coleenp@4037 | 95 | // object index to original constant pool index |
coleenp@4037 | 96 | jobject _resolved_references; |
coleenp@4037 | 97 | Array<u2>* _reference_map; |
coleenp@4037 | 98 | |
coleenp@4490 | 99 | enum { |
coleenp@4643 | 100 | _has_preresolution = 1, // Flags |
coleenp@4643 | 101 | _on_stack = 2 |
coleenp@4490 | 102 | }; |
coleenp@4490 | 103 | |
coleenp@4490 | 104 | int _flags; // old fashioned bit twiddling |
coleenp@548 | 105 | int _length; // number of elements in the array |
coleenp@4037 | 106 | |
coleenp@4037 | 107 | union { |
coleenp@4037 | 108 | // set for CDS to restore resolved references |
coleenp@4037 | 109 | int _resolved_reference_length; |
coleenp@4466 | 110 | // keeps version number for redefined classes (used in backtrace) |
coleenp@4466 | 111 | int _version; |
coleenp@4037 | 112 | } _saved; |
duke@435 | 113 | |
duke@435 | 114 | |
coleenp@4037 | 115 | void set_tags(Array<u1>* tags) { _tags = tags; } |
coleenp@4037 | 116 | void tag_at_put(int which, jbyte t) { tags()->at_put(which, t); } |
coleenp@4037 | 117 | void release_tag_at_put(int which, jbyte t) { tags()->release_at_put(which, t); } |
coleenp@4037 | 118 | |
coleenp@4037 | 119 | void set_operands(Array<u2>* operands) { _operands = operands; } |
jrose@2268 | 120 | |
coleenp@4490 | 121 | int flags() const { return _flags; } |
coleenp@4490 | 122 | void set_flags(int f) { _flags = f; } |
jrose@866 | 123 | |
duke@435 | 124 | private: |
coleenp@4037 | 125 | intptr_t* base() const { return (intptr_t*) (((char*) this) + sizeof(ConstantPool)); } |
duke@435 | 126 | |
coleenp@2497 | 127 | CPSlot slot_at(int which) { |
coleenp@2497 | 128 | assert(is_within_bounds(which), "index out of bounds"); |
coleenp@4037 | 129 | // Uses volatile because the klass slot changes without a lock. |
coleenp@2497 | 130 | volatile intptr_t adr = (intptr_t)OrderAccess::load_ptr_acquire(obj_at_addr_raw(which)); |
coleenp@4037 | 131 | assert(adr != 0 || which == 0, "cp entry for klass should not be zero"); |
coleenp@2497 | 132 | return CPSlot(adr); |
coleenp@2497 | 133 | } |
coleenp@2497 | 134 | |
coleenp@2497 | 135 | void slot_at_put(int which, CPSlot s) const { |
coleenp@2497 | 136 | assert(is_within_bounds(which), "index out of bounds"); |
coleenp@4037 | 137 | assert(s.value() != 0, "Caught something"); |
coleenp@2497 | 138 | *(intptr_t*)&base()[which] = s.value(); |
coleenp@2497 | 139 | } |
coleenp@4037 | 140 | intptr_t* obj_at_addr_raw(int which) const { |
duke@435 | 141 | assert(is_within_bounds(which), "index out of bounds"); |
coleenp@4037 | 142 | return (intptr_t*) &base()[which]; |
coleenp@2497 | 143 | } |
coleenp@2497 | 144 | |
duke@435 | 145 | jint* int_at_addr(int which) const { |
duke@435 | 146 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 147 | return (jint*) &base()[which]; |
duke@435 | 148 | } |
duke@435 | 149 | |
duke@435 | 150 | jlong* long_at_addr(int which) const { |
duke@435 | 151 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 152 | return (jlong*) &base()[which]; |
duke@435 | 153 | } |
duke@435 | 154 | |
duke@435 | 155 | jfloat* float_at_addr(int which) const { |
duke@435 | 156 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 157 | return (jfloat*) &base()[which]; |
duke@435 | 158 | } |
duke@435 | 159 | |
duke@435 | 160 | jdouble* double_at_addr(int which) const { |
duke@435 | 161 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 162 | return (jdouble*) &base()[which]; |
duke@435 | 163 | } |
duke@435 | 164 | |
coleenp@4037 | 165 | ConstantPool(Array<u1>* tags); |
coleenp@4037 | 166 | ConstantPool() { assert(DumpSharedSpaces || UseSharedSpaces, "only for CDS"); } |
duke@435 | 167 | public: |
coleenp@4037 | 168 | static ConstantPool* allocate(ClassLoaderData* loader_data, int length, TRAPS); |
coleenp@4037 | 169 | |
coleenp@4037 | 170 | bool is_constantPool() const volatile { return true; } |
coleenp@4037 | 171 | |
coleenp@4037 | 172 | Array<u1>* tags() const { return _tags; } |
coleenp@4037 | 173 | Array<u2>* operands() const { return _operands; } |
duke@435 | 174 | |
coleenp@4490 | 175 | bool has_preresolution() const { return (_flags & _has_preresolution) != 0; } |
coleenp@4490 | 176 | void set_has_preresolution() { _flags |= _has_preresolution; } |
jrose@866 | 177 | |
coleenp@4037 | 178 | // Redefine classes support. If a method refering to this constant pool |
coleenp@4037 | 179 | // is on the executing stack, or as a handle in vm code, this constant pool |
coleenp@4037 | 180 | // can't be removed from the set of previous versions saved in the instance |
coleenp@4037 | 181 | // class. |
coleenp@4490 | 182 | bool on_stack() const { return (_flags &_on_stack) != 0; } |
coleenp@4037 | 183 | void set_on_stack(const bool value); |
coleenp@4037 | 184 | |
duke@435 | 185 | // Klass holding pool |
coleenp@4251 | 186 | InstanceKlass* pool_holder() const { return _pool_holder; } |
coleenp@4251 | 187 | void set_pool_holder(InstanceKlass* k) { _pool_holder = k; } |
coleenp@4251 | 188 | InstanceKlass** pool_holder_addr() { return &_pool_holder; } |
duke@435 | 189 | |
duke@435 | 190 | // Interpreter runtime support |
coleenp@4037 | 191 | ConstantPoolCache* cache() const { return _cache; } |
coleenp@4037 | 192 | void set_cache(ConstantPoolCache* cache){ _cache = cache; } |
coleenp@4037 | 193 | |
coleenp@4037 | 194 | // Create object cache in the constant pool |
coleenp@4037 | 195 | void initialize_resolved_references(ClassLoaderData* loader_data, |
coleenp@4037 | 196 | intStack reference_map, |
coleenp@4037 | 197 | int constant_pool_map_length, |
coleenp@4037 | 198 | TRAPS); |
coleenp@4037 | 199 | |
coleenp@4037 | 200 | // resolved strings, methodHandles and callsite objects from the constant pool |
coleenp@4037 | 201 | objArrayOop resolved_references() const; |
coleenp@4037 | 202 | // mapping resolved object array indexes to cp indexes and back. |
coleenp@4037 | 203 | int object_to_cp_index(int index) { return _reference_map->at(index); } |
coleenp@4037 | 204 | int cp_to_object_index(int index); |
coleenp@4037 | 205 | |
coleenp@4037 | 206 | // Invokedynamic indexes. |
coleenp@4037 | 207 | // They must look completely different from normal indexes. |
coleenp@4037 | 208 | // The main reason is that byte swapping is sometimes done on normal indexes. |
coleenp@4037 | 209 | // Finally, it is helpful for debugging to tell the two apart. |
coleenp@4037 | 210 | static bool is_invokedynamic_index(int i) { return (i < 0); } |
coleenp@4037 | 211 | static int decode_invokedynamic_index(int i) { assert(is_invokedynamic_index(i), ""); return ~i; } |
coleenp@4037 | 212 | static int encode_invokedynamic_index(int i) { assert(!is_invokedynamic_index(i), ""); return ~i; } |
coleenp@4037 | 213 | |
coleenp@4037 | 214 | |
coleenp@4037 | 215 | // The invokedynamic points at a CP cache entry. This entry points back |
coleenp@4037 | 216 | // at the original CP entry (CONSTANT_InvokeDynamic) and also (via f2) at an entry |
coleenp@4037 | 217 | // in the resolved_references array (which provides the appendix argument). |
coleenp@4037 | 218 | int invokedynamic_cp_cache_index(int index) const { |
coleenp@4037 | 219 | assert (is_invokedynamic_index(index), "should be a invokedynamic index"); |
coleenp@4037 | 220 | int cache_index = decode_invokedynamic_index(index); |
coleenp@4037 | 221 | return cache_index; |
coleenp@4037 | 222 | } |
coleenp@4037 | 223 | ConstantPoolCacheEntry* invokedynamic_cp_cache_entry_at(int index) const { |
coleenp@4037 | 224 | // decode index that invokedynamic points to. |
coleenp@4037 | 225 | int cp_cache_index = invokedynamic_cp_cache_index(index); |
coleenp@4037 | 226 | return cache()->entry_at(cp_cache_index); |
coleenp@4037 | 227 | } |
duke@435 | 228 | |
duke@435 | 229 | // Assembly code support |
coleenp@4037 | 230 | static int tags_offset_in_bytes() { return offset_of(ConstantPool, _tags); } |
coleenp@4037 | 231 | static int cache_offset_in_bytes() { return offset_of(ConstantPool, _cache); } |
coleenp@4037 | 232 | static int pool_holder_offset_in_bytes() { return offset_of(ConstantPool, _pool_holder); } |
coleenp@4037 | 233 | static int resolved_references_offset_in_bytes() { return offset_of(ConstantPool, _resolved_references); } |
coleenp@4037 | 234 | static int reference_map_offset_in_bytes() { return offset_of(ConstantPool, _reference_map); } |
duke@435 | 235 | |
duke@435 | 236 | // Storing constants |
duke@435 | 237 | |
coleenp@4037 | 238 | void klass_at_put(int which, Klass* k) { |
coleenp@2497 | 239 | assert(k != NULL, "resolved class shouldn't be null"); |
coleenp@4037 | 240 | assert(is_within_bounds(which), "index out of bounds"); |
coleenp@4037 | 241 | OrderAccess::release_store_ptr((Klass* volatile *)obj_at_addr_raw(which), k); |
duke@435 | 242 | // The interpreter assumes when the tag is stored, the klass is resolved |
coleenp@4037 | 243 | // and the Klass* is a klass rather than a Symbol*, so we need |
duke@435 | 244 | // hardware store ordering here. |
duke@435 | 245 | release_tag_at_put(which, JVM_CONSTANT_Class); |
duke@435 | 246 | } |
duke@435 | 247 | |
duke@435 | 248 | // For temporary use while constructing constant pool |
duke@435 | 249 | void klass_index_at_put(int which, int name_index) { |
duke@435 | 250 | tag_at_put(which, JVM_CONSTANT_ClassIndex); |
duke@435 | 251 | *int_at_addr(which) = name_index; |
duke@435 | 252 | } |
duke@435 | 253 | |
duke@435 | 254 | // Temporary until actual use |
coleenp@2497 | 255 | void unresolved_klass_at_put(int which, Symbol* s) { |
duke@435 | 256 | release_tag_at_put(which, JVM_CONSTANT_UnresolvedClass); |
coleenp@2497 | 257 | slot_at_put(which, s); |
duke@435 | 258 | } |
duke@435 | 259 | |
jrose@1957 | 260 | void method_handle_index_at_put(int which, int ref_kind, int ref_index) { |
jrose@1957 | 261 | tag_at_put(which, JVM_CONSTANT_MethodHandle); |
jrose@1957 | 262 | *int_at_addr(which) = ((jint) ref_index<<16) | ref_kind; |
jrose@1957 | 263 | } |
jrose@1957 | 264 | |
jrose@1957 | 265 | void method_type_index_at_put(int which, int ref_index) { |
jrose@1957 | 266 | tag_at_put(which, JVM_CONSTANT_MethodType); |
jrose@1957 | 267 | *int_at_addr(which) = ref_index; |
jrose@1957 | 268 | } |
jrose@1957 | 269 | |
jrose@2353 | 270 | void invoke_dynamic_at_put(int which, int bootstrap_specifier_index, int name_and_type_index) { |
jrose@2015 | 271 | tag_at_put(which, JVM_CONSTANT_InvokeDynamic); |
jrose@2353 | 272 | *int_at_addr(which) = ((jint) name_and_type_index<<16) | bootstrap_specifier_index; |
jrose@2015 | 273 | } |
jrose@2353 | 274 | |
coleenp@2497 | 275 | void unresolved_string_at_put(int which, Symbol* s) { |
coleenp@4037 | 276 | release_tag_at_put(which, JVM_CONSTANT_String); |
coleenp@4037 | 277 | *symbol_at_addr(which) = s; |
duke@435 | 278 | } |
duke@435 | 279 | |
duke@435 | 280 | void int_at_put(int which, jint i) { |
duke@435 | 281 | tag_at_put(which, JVM_CONSTANT_Integer); |
duke@435 | 282 | *int_at_addr(which) = i; |
duke@435 | 283 | } |
duke@435 | 284 | |
duke@435 | 285 | void long_at_put(int which, jlong l) { |
duke@435 | 286 | tag_at_put(which, JVM_CONSTANT_Long); |
duke@435 | 287 | // *long_at_addr(which) = l; |
duke@435 | 288 | Bytes::put_native_u8((address)long_at_addr(which), *((u8*) &l)); |
duke@435 | 289 | } |
duke@435 | 290 | |
duke@435 | 291 | void float_at_put(int which, jfloat f) { |
duke@435 | 292 | tag_at_put(which, JVM_CONSTANT_Float); |
duke@435 | 293 | *float_at_addr(which) = f; |
duke@435 | 294 | } |
duke@435 | 295 | |
duke@435 | 296 | void double_at_put(int which, jdouble d) { |
duke@435 | 297 | tag_at_put(which, JVM_CONSTANT_Double); |
duke@435 | 298 | // *double_at_addr(which) = d; |
duke@435 | 299 | // u8 temp = *(u8*) &d; |
duke@435 | 300 | Bytes::put_native_u8((address) double_at_addr(which), *((u8*) &d)); |
duke@435 | 301 | } |
duke@435 | 302 | |
coleenp@2497 | 303 | Symbol** symbol_at_addr(int which) const { |
coleenp@2497 | 304 | assert(is_within_bounds(which), "index out of bounds"); |
coleenp@2497 | 305 | return (Symbol**) &base()[which]; |
coleenp@2497 | 306 | } |
coleenp@2497 | 307 | |
coleenp@2497 | 308 | void symbol_at_put(int which, Symbol* s) { |
coleenp@2497 | 309 | assert(s->refcount() != 0, "should have nonzero refcount"); |
duke@435 | 310 | tag_at_put(which, JVM_CONSTANT_Utf8); |
coleenp@4037 | 311 | *symbol_at_addr(which) = s; |
duke@435 | 312 | } |
duke@435 | 313 | |
coleenp@4037 | 314 | void string_at_put(int which, int obj_index, oop str) { |
coleenp@4037 | 315 | resolved_references()->obj_at_put(obj_index, str); |
duke@435 | 316 | } |
duke@435 | 317 | |
duke@435 | 318 | // For temporary use while constructing constant pool |
duke@435 | 319 | void string_index_at_put(int which, int string_index) { |
duke@435 | 320 | tag_at_put(which, JVM_CONSTANT_StringIndex); |
duke@435 | 321 | *int_at_addr(which) = string_index; |
duke@435 | 322 | } |
duke@435 | 323 | |
duke@435 | 324 | void field_at_put(int which, int class_index, int name_and_type_index) { |
duke@435 | 325 | tag_at_put(which, JVM_CONSTANT_Fieldref); |
duke@435 | 326 | *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index; |
duke@435 | 327 | } |
duke@435 | 328 | |
duke@435 | 329 | void method_at_put(int which, int class_index, int name_and_type_index) { |
duke@435 | 330 | tag_at_put(which, JVM_CONSTANT_Methodref); |
duke@435 | 331 | *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index; |
duke@435 | 332 | } |
duke@435 | 333 | |
duke@435 | 334 | void interface_method_at_put(int which, int class_index, int name_and_type_index) { |
duke@435 | 335 | tag_at_put(which, JVM_CONSTANT_InterfaceMethodref); |
duke@435 | 336 | *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index; // Not so nice |
duke@435 | 337 | } |
duke@435 | 338 | |
duke@435 | 339 | void name_and_type_at_put(int which, int name_index, int signature_index) { |
duke@435 | 340 | tag_at_put(which, JVM_CONSTANT_NameAndType); |
duke@435 | 341 | *int_at_addr(which) = ((jint) signature_index<<16) | name_index; // Not so nice |
duke@435 | 342 | } |
duke@435 | 343 | |
duke@435 | 344 | // Tag query |
duke@435 | 345 | |
coleenp@4037 | 346 | constantTag tag_at(int which) const { return (constantTag)tags()->at_acquire(which); } |
coleenp@2497 | 347 | |
duke@435 | 348 | // Fetching constants |
duke@435 | 349 | |
coleenp@4037 | 350 | Klass* klass_at(int which, TRAPS) { |
duke@435 | 351 | constantPoolHandle h_this(THREAD, this); |
duke@435 | 352 | return klass_at_impl(h_this, which, CHECK_NULL); |
duke@435 | 353 | } |
duke@435 | 354 | |
coleenp@2497 | 355 | Symbol* klass_name_at(int which); // Returns the name, w/o resolving. |
duke@435 | 356 | |
coleenp@4037 | 357 | Klass* resolved_klass_at(int which) { // Used by Compiler |
duke@435 | 358 | guarantee(tag_at(which).is_klass(), "Corrupted constant pool"); |
duke@435 | 359 | // Must do an acquire here in case another thread resolved the klass |
duke@435 | 360 | // behind our back, lest we later load stale values thru the oop. |
coleenp@4037 | 361 | return CPSlot((Klass*)OrderAccess::load_ptr_acquire(obj_at_addr_raw(which))).get_klass(); |
duke@435 | 362 | } |
duke@435 | 363 | |
duke@435 | 364 | // This method should only be used with a cpool lock or during parsing or gc |
coleenp@2497 | 365 | Symbol* unresolved_klass_at(int which) { // Temporary until actual use |
coleenp@4037 | 366 | Symbol* s = CPSlot((Symbol*)OrderAccess::load_ptr_acquire(obj_at_addr_raw(which))).get_symbol(); |
duke@435 | 367 | // check that the klass is still unresolved. |
duke@435 | 368 | assert(tag_at(which).is_unresolved_klass(), "Corrupted constant pool"); |
duke@435 | 369 | return s; |
duke@435 | 370 | } |
duke@435 | 371 | |
duke@435 | 372 | // RedefineClasses() API support: |
coleenp@2497 | 373 | Symbol* klass_at_noresolve(int which) { return klass_name_at(which); } |
duke@435 | 374 | |
duke@435 | 375 | jint int_at(int which) { |
duke@435 | 376 | assert(tag_at(which).is_int(), "Corrupted constant pool"); |
duke@435 | 377 | return *int_at_addr(which); |
duke@435 | 378 | } |
duke@435 | 379 | |
duke@435 | 380 | jlong long_at(int which) { |
duke@435 | 381 | assert(tag_at(which).is_long(), "Corrupted constant pool"); |
duke@435 | 382 | // return *long_at_addr(which); |
duke@435 | 383 | u8 tmp = Bytes::get_native_u8((address)&base()[which]); |
duke@435 | 384 | return *((jlong*)&tmp); |
duke@435 | 385 | } |
duke@435 | 386 | |
duke@435 | 387 | jfloat float_at(int which) { |
duke@435 | 388 | assert(tag_at(which).is_float(), "Corrupted constant pool"); |
duke@435 | 389 | return *float_at_addr(which); |
duke@435 | 390 | } |
duke@435 | 391 | |
duke@435 | 392 | jdouble double_at(int which) { |
duke@435 | 393 | assert(tag_at(which).is_double(), "Corrupted constant pool"); |
duke@435 | 394 | u8 tmp = Bytes::get_native_u8((address)&base()[which]); |
duke@435 | 395 | return *((jdouble*)&tmp); |
duke@435 | 396 | } |
duke@435 | 397 | |
coleenp@2497 | 398 | Symbol* symbol_at(int which) { |
duke@435 | 399 | assert(tag_at(which).is_utf8(), "Corrupted constant pool"); |
coleenp@4037 | 400 | return *symbol_at_addr(which); |
duke@435 | 401 | } |
duke@435 | 402 | |
coleenp@4037 | 403 | oop string_at(int which, int obj_index, TRAPS) { |
coleenp@4037 | 404 | constantPoolHandle h_this(THREAD, this); |
coleenp@4037 | 405 | return string_at_impl(h_this, which, obj_index, THREAD); |
coleenp@4037 | 406 | } |
duke@435 | 407 | oop string_at(int which, TRAPS) { |
coleenp@4037 | 408 | int obj_index = cp_to_object_index(which); |
coleenp@4037 | 409 | return string_at(which, obj_index, THREAD); |
duke@435 | 410 | } |
duke@435 | 411 | |
coleenp@4037 | 412 | // Version that can be used before string oop array is created. |
coleenp@4037 | 413 | oop uncached_string_at(int which, TRAPS); |
coleenp@4037 | 414 | |
jrose@866 | 415 | // A "pseudo-string" is an non-string oop that has found is way into |
jrose@866 | 416 | // a String entry. |
twisti@2698 | 417 | // Under EnableInvokeDynamic this can happen if the user patches a live |
jrose@866 | 418 | // object into a CONSTANT_String entry of an anonymous class. |
jrose@866 | 419 | // Method oops internally created for method handles may also |
jrose@866 | 420 | // use pseudo-strings to link themselves to related metaobjects. |
jrose@866 | 421 | |
coleenp@4037 | 422 | bool is_pseudo_string_at(int which) { |
coleenp@4037 | 423 | // A pseudo string is a string that doesn't have a symbol in the cpSlot |
coleenp@4037 | 424 | return unresolved_string_at(which) == NULL; |
jrose@866 | 425 | } |
jrose@866 | 426 | |
coleenp@4037 | 427 | oop pseudo_string_at(int which, int obj_index) { |
coleenp@4037 | 428 | assert(tag_at(which).is_string(), "Corrupted constant pool"); |
coleenp@4037 | 429 | assert(unresolved_string_at(which) == NULL, "shouldn't have symbol"); |
coleenp@4037 | 430 | oop s = resolved_references()->obj_at(obj_index); |
coleenp@4037 | 431 | return s; |
coleenp@4037 | 432 | } |
coleenp@4037 | 433 | |
coleenp@4643 | 434 | oop pseudo_string_at(int which) { |
coleenp@4643 | 435 | assert(tag_at(which).is_string(), "Corrupted constant pool"); |
coleenp@4643 | 436 | assert(unresolved_string_at(which) == NULL, "shouldn't have symbol"); |
coleenp@4643 | 437 | int obj_index = cp_to_object_index(which); |
coleenp@4643 | 438 | oop s = resolved_references()->obj_at(obj_index); |
coleenp@4643 | 439 | return s; |
coleenp@4643 | 440 | } |
coleenp@4643 | 441 | |
coleenp@4037 | 442 | void pseudo_string_at_put(int which, int obj_index, oop x) { |
twisti@2698 | 443 | assert(EnableInvokeDynamic, ""); |
coleenp@4037 | 444 | assert(tag_at(which).is_string(), "Corrupted constant pool"); |
coleenp@4643 | 445 | unresolved_string_at_put(which, NULL); // indicates patched string |
coleenp@4037 | 446 | string_at_put(which, obj_index, x); // this works just fine |
jrose@866 | 447 | } |
jrose@866 | 448 | |
duke@435 | 449 | // only called when we are sure a string entry is already resolved (via an |
duke@435 | 450 | // earlier string_at call. |
duke@435 | 451 | oop resolved_string_at(int which) { |
duke@435 | 452 | assert(tag_at(which).is_string(), "Corrupted constant pool"); |
duke@435 | 453 | // Must do an acquire here in case another thread resolved the klass |
duke@435 | 454 | // behind our back, lest we later load stale values thru the oop. |
coleenp@4142 | 455 | // we might want a volatile_obj_at in ObjArrayKlass. |
coleenp@4037 | 456 | int obj_index = cp_to_object_index(which); |
coleenp@4037 | 457 | return resolved_references()->obj_at(obj_index); |
duke@435 | 458 | } |
duke@435 | 459 | |
coleenp@4037 | 460 | Symbol* unresolved_string_at(int which) { |
coleenp@4037 | 461 | assert(tag_at(which).is_string(), "Corrupted constant pool"); |
coleenp@4037 | 462 | Symbol* s = *symbol_at_addr(which); |
duke@435 | 463 | return s; |
duke@435 | 464 | } |
duke@435 | 465 | |
duke@435 | 466 | // Returns an UTF8 for a CONSTANT_String entry at a given index. |
duke@435 | 467 | // UTF8 char* representation was chosen to avoid conversion of |
coleenp@2497 | 468 | // java_lang_Strings at resolved entries into Symbol*s |
duke@435 | 469 | // or vice versa. |
jrose@866 | 470 | // Caller is responsible for checking for pseudo-strings. |
duke@435 | 471 | char* string_at_noresolve(int which); |
duke@435 | 472 | |
duke@435 | 473 | jint name_and_type_at(int which) { |
duke@435 | 474 | assert(tag_at(which).is_name_and_type(), "Corrupted constant pool"); |
duke@435 | 475 | return *int_at_addr(which); |
duke@435 | 476 | } |
duke@435 | 477 | |
jrose@1957 | 478 | int method_handle_ref_kind_at(int which) { |
jrose@1957 | 479 | assert(tag_at(which).is_method_handle(), "Corrupted constant pool"); |
jrose@1957 | 480 | return extract_low_short_from_int(*int_at_addr(which)); // mask out unwanted ref_index bits |
jrose@1957 | 481 | } |
jrose@1957 | 482 | int method_handle_index_at(int which) { |
jrose@1957 | 483 | assert(tag_at(which).is_method_handle(), "Corrupted constant pool"); |
jrose@1957 | 484 | return extract_high_short_from_int(*int_at_addr(which)); // shift out unwanted ref_kind bits |
jrose@1957 | 485 | } |
jrose@1957 | 486 | int method_type_index_at(int which) { |
jrose@1957 | 487 | assert(tag_at(which).is_method_type(), "Corrupted constant pool"); |
jrose@1957 | 488 | return *int_at_addr(which); |
jrose@1957 | 489 | } |
jrose@1957 | 490 | // Derived queries: |
coleenp@2497 | 491 | Symbol* method_handle_name_ref_at(int which) { |
jrose@1957 | 492 | int member = method_handle_index_at(which); |
jrose@1957 | 493 | return impl_name_ref_at(member, true); |
jrose@1957 | 494 | } |
coleenp@2497 | 495 | Symbol* method_handle_signature_ref_at(int which) { |
jrose@1957 | 496 | int member = method_handle_index_at(which); |
jrose@1957 | 497 | return impl_signature_ref_at(member, true); |
jrose@1957 | 498 | } |
jrose@1957 | 499 | int method_handle_klass_index_at(int which) { |
jrose@1957 | 500 | int member = method_handle_index_at(which); |
jrose@1957 | 501 | return impl_klass_ref_index_at(member, true); |
jrose@1957 | 502 | } |
coleenp@2497 | 503 | Symbol* method_type_signature_at(int which) { |
jrose@1957 | 504 | int sym = method_type_index_at(which); |
jrose@1957 | 505 | return symbol_at(sym); |
jrose@1957 | 506 | } |
jrose@2268 | 507 | |
jrose@2353 | 508 | int invoke_dynamic_name_and_type_ref_index_at(int which) { |
jrose@2353 | 509 | assert(tag_at(which).is_invoke_dynamic(), "Corrupted constant pool"); |
jrose@2353 | 510 | return extract_high_short_from_int(*int_at_addr(which)); |
jrose@2268 | 511 | } |
jrose@2353 | 512 | int invoke_dynamic_bootstrap_specifier_index(int which) { |
jrose@2353 | 513 | assert(tag_at(which).value() == JVM_CONSTANT_InvokeDynamic, "Corrupted constant pool"); |
jrose@2353 | 514 | return extract_low_short_from_int(*int_at_addr(which)); |
jrose@2268 | 515 | } |
jrose@2353 | 516 | int invoke_dynamic_operand_base(int which) { |
jrose@2353 | 517 | int bootstrap_specifier_index = invoke_dynamic_bootstrap_specifier_index(which); |
jrose@2353 | 518 | return operand_offset_at(operands(), bootstrap_specifier_index); |
jrose@2268 | 519 | } |
jrose@2353 | 520 | // The first part of the operands array consists of an index into the second part. |
jrose@2353 | 521 | // Extract a 32-bit index value from the first part. |
coleenp@4037 | 522 | static int operand_offset_at(Array<u2>* operands, int bootstrap_specifier_index) { |
jrose@2353 | 523 | int n = (bootstrap_specifier_index * 2); |
jrose@2353 | 524 | assert(n >= 0 && n+2 <= operands->length(), "oob"); |
jrose@2353 | 525 | // The first 32-bit index points to the beginning of the second part |
jrose@2353 | 526 | // of the operands array. Make sure this index is in the first part. |
coleenp@4037 | 527 | DEBUG_ONLY(int second_part = build_int_from_shorts(operands->at(0), |
coleenp@4037 | 528 | operands->at(1))); |
jrose@2353 | 529 | assert(second_part == 0 || n+2 <= second_part, "oob (2)"); |
coleenp@4037 | 530 | int offset = build_int_from_shorts(operands->at(n+0), |
coleenp@4037 | 531 | operands->at(n+1)); |
jrose@2353 | 532 | // The offset itself must point into the second part of the array. |
jrose@2353 | 533 | assert(offset == 0 || offset >= second_part && offset <= operands->length(), "oob (3)"); |
jrose@2353 | 534 | return offset; |
jrose@2268 | 535 | } |
coleenp@4037 | 536 | static void operand_offset_at_put(Array<u2>* operands, int bootstrap_specifier_index, int offset) { |
jrose@2353 | 537 | int n = bootstrap_specifier_index * 2; |
jrose@2353 | 538 | assert(n >= 0 && n+2 <= operands->length(), "oob"); |
coleenp@4037 | 539 | operands->at_put(n+0, extract_low_short_from_int(offset)); |
coleenp@4037 | 540 | operands->at_put(n+1, extract_high_short_from_int(offset)); |
jrose@2268 | 541 | } |
coleenp@4037 | 542 | static int operand_array_length(Array<u2>* operands) { |
jrose@2353 | 543 | if (operands == NULL || operands->length() == 0) return 0; |
jrose@2353 | 544 | int second_part = operand_offset_at(operands, 0); |
jrose@2353 | 545 | return (second_part / 2); |
jrose@2268 | 546 | } |
jrose@2268 | 547 | |
jrose@2353 | 548 | #ifdef ASSERT |
jrose@2353 | 549 | // operand tuples fit together exactly, end to end |
coleenp@4037 | 550 | static int operand_limit_at(Array<u2>* operands, int bootstrap_specifier_index) { |
jrose@2353 | 551 | int nextidx = bootstrap_specifier_index + 1; |
jrose@2353 | 552 | if (nextidx == operand_array_length(operands)) |
jrose@2353 | 553 | return operands->length(); |
jrose@2353 | 554 | else |
jrose@2353 | 555 | return operand_offset_at(operands, nextidx); |
jrose@2353 | 556 | } |
jrose@2353 | 557 | int invoke_dynamic_operand_limit(int which) { |
jrose@2353 | 558 | int bootstrap_specifier_index = invoke_dynamic_bootstrap_specifier_index(which); |
jrose@2353 | 559 | return operand_limit_at(operands(), bootstrap_specifier_index); |
jrose@2353 | 560 | } |
jrose@2353 | 561 | #endif //ASSERT |
jrose@2353 | 562 | |
jrose@2353 | 563 | // layout of InvokeDynamic bootstrap method specifier (in second part of operands array): |
jrose@2268 | 564 | enum { |
jrose@2268 | 565 | _indy_bsm_offset = 0, // CONSTANT_MethodHandle bsm |
jrose@2353 | 566 | _indy_argc_offset = 1, // u2 argc |
jrose@2353 | 567 | _indy_argv_offset = 2 // u2 argv[argc] |
jrose@2268 | 568 | }; |
sspitsyn@4983 | 569 | |
sspitsyn@4983 | 570 | // These functions are used in RedefineClasses for CP merge |
sspitsyn@4983 | 571 | |
sspitsyn@4983 | 572 | int operand_offset_at(int bootstrap_specifier_index) { |
sspitsyn@4983 | 573 | assert(0 <= bootstrap_specifier_index && |
sspitsyn@4983 | 574 | bootstrap_specifier_index < operand_array_length(operands()), |
sspitsyn@4983 | 575 | "Corrupted CP operands"); |
sspitsyn@4983 | 576 | return operand_offset_at(operands(), bootstrap_specifier_index); |
sspitsyn@4983 | 577 | } |
sspitsyn@4983 | 578 | int operand_bootstrap_method_ref_index_at(int bootstrap_specifier_index) { |
sspitsyn@4983 | 579 | int offset = operand_offset_at(bootstrap_specifier_index); |
sspitsyn@4983 | 580 | return operands()->at(offset + _indy_bsm_offset); |
sspitsyn@4983 | 581 | } |
sspitsyn@4983 | 582 | int operand_argument_count_at(int bootstrap_specifier_index) { |
sspitsyn@4983 | 583 | int offset = operand_offset_at(bootstrap_specifier_index); |
sspitsyn@4983 | 584 | int argc = operands()->at(offset + _indy_argc_offset); |
sspitsyn@4983 | 585 | return argc; |
sspitsyn@4983 | 586 | } |
sspitsyn@4983 | 587 | int operand_argument_index_at(int bootstrap_specifier_index, int j) { |
sspitsyn@4983 | 588 | int offset = operand_offset_at(bootstrap_specifier_index); |
sspitsyn@4983 | 589 | return operands()->at(offset + _indy_argv_offset + j); |
sspitsyn@4983 | 590 | } |
sspitsyn@4983 | 591 | int operand_next_offset_at(int bootstrap_specifier_index) { |
sspitsyn@4983 | 592 | int offset = operand_offset_at(bootstrap_specifier_index) + _indy_argv_offset |
sspitsyn@4983 | 593 | + operand_argument_count_at(bootstrap_specifier_index); |
sspitsyn@4983 | 594 | return offset; |
sspitsyn@4983 | 595 | } |
sspitsyn@4983 | 596 | // Compare a bootsrap specifier in the operands arrays |
sspitsyn@4983 | 597 | bool compare_operand_to(int bootstrap_specifier_index1, constantPoolHandle cp2, |
sspitsyn@4983 | 598 | int bootstrap_specifier_index2, TRAPS); |
sspitsyn@4983 | 599 | // Find a bootsrap specifier in the operands array |
sspitsyn@4983 | 600 | int find_matching_operand(int bootstrap_specifier_index, constantPoolHandle search_cp, |
sspitsyn@4983 | 601 | int operands_cur_len, TRAPS); |
sspitsyn@4983 | 602 | // Resize the operands array with delta_len and delta_size |
sspitsyn@4983 | 603 | void resize_operands(int delta_len, int delta_size, TRAPS); |
sspitsyn@4983 | 604 | // Extend the operands array with the length and size of the ext_cp operands |
sspitsyn@4983 | 605 | void extend_operands(constantPoolHandle ext_cp, TRAPS); |
sspitsyn@4983 | 606 | // Shrink the operands array to a smaller array with new_len length |
sspitsyn@4983 | 607 | void shrink_operands(int new_len, TRAPS); |
sspitsyn@4983 | 608 | |
sspitsyn@4983 | 609 | |
jrose@2015 | 610 | int invoke_dynamic_bootstrap_method_ref_index_at(int which) { |
jrose@2015 | 611 | assert(tag_at(which).is_invoke_dynamic(), "Corrupted constant pool"); |
jrose@2353 | 612 | int op_base = invoke_dynamic_operand_base(which); |
coleenp@4037 | 613 | return operands()->at(op_base + _indy_bsm_offset); |
jrose@2268 | 614 | } |
jrose@2268 | 615 | int invoke_dynamic_argument_count_at(int which) { |
jrose@2268 | 616 | assert(tag_at(which).is_invoke_dynamic(), "Corrupted constant pool"); |
jrose@2353 | 617 | int op_base = invoke_dynamic_operand_base(which); |
coleenp@4037 | 618 | int argc = operands()->at(op_base + _indy_argc_offset); |
jrose@2353 | 619 | DEBUG_ONLY(int end_offset = op_base + _indy_argv_offset + argc; |
jrose@2353 | 620 | int next_offset = invoke_dynamic_operand_limit(which)); |
jrose@2353 | 621 | assert(end_offset == next_offset, "matched ending"); |
jrose@2268 | 622 | return argc; |
jrose@2268 | 623 | } |
jrose@2268 | 624 | int invoke_dynamic_argument_index_at(int which, int j) { |
jrose@2353 | 625 | int op_base = invoke_dynamic_operand_base(which); |
coleenp@4037 | 626 | DEBUG_ONLY(int argc = operands()->at(op_base + _indy_argc_offset)); |
jrose@2353 | 627 | assert((uint)j < (uint)argc, "oob"); |
coleenp@4037 | 628 | return operands()->at(op_base + _indy_argv_offset + j); |
jrose@2015 | 629 | } |
jrose@1957 | 630 | |
jrose@1161 | 631 | // The following methods (name/signature/klass_ref_at, klass_ref_at_noresolve, |
jrose@1494 | 632 | // name_and_type_ref_index_at) all expect to be passed indices obtained |
jrose@2265 | 633 | // directly from the bytecode. |
jrose@1494 | 634 | // If the indices are meant to refer to fields or methods, they are |
jrose@2265 | 635 | // actually rewritten constant pool cache indices. |
jrose@1494 | 636 | // The routine remap_instruction_operand_from_cache manages the adjustment |
jrose@1494 | 637 | // of these values back to constant pool indices. |
jrose@1161 | 638 | |
jrose@1494 | 639 | // There are also "uncached" versions which do not adjust the operand index; see below. |
duke@435 | 640 | |
jrose@2265 | 641 | // FIXME: Consider renaming these with a prefix "cached_" to make the distinction clear. |
jrose@2265 | 642 | // In a few cases (the verifier) there are uses before a cpcache has been built, |
jrose@2265 | 643 | // which are handled by a dynamic check in remap_instruction_operand_from_cache. |
jrose@2265 | 644 | // FIXME: Remove the dynamic check, and adjust all callers to specify the correct mode. |
jrose@2265 | 645 | |
duke@435 | 646 | // Lookup for entries consisting of (klass_index, name_and_type index) |
coleenp@4037 | 647 | Klass* klass_ref_at(int which, TRAPS); |
coleenp@2497 | 648 | Symbol* klass_ref_at_noresolve(int which); |
coleenp@2497 | 649 | Symbol* name_ref_at(int which) { return impl_name_ref_at(which, false); } |
coleenp@2497 | 650 | Symbol* signature_ref_at(int which) { return impl_signature_ref_at(which, false); } |
duke@435 | 651 | |
jrose@1161 | 652 | int klass_ref_index_at(int which) { return impl_klass_ref_index_at(which, false); } |
jrose@1161 | 653 | int name_and_type_ref_index_at(int which) { return impl_name_and_type_ref_index_at(which, false); } |
duke@435 | 654 | |
duke@435 | 655 | // Lookup for entries consisting of (name_index, signature_index) |
jrose@1161 | 656 | int name_ref_index_at(int which_nt); // == low-order jshort of name_and_type_at(which_nt) |
jrose@1161 | 657 | int signature_ref_index_at(int which_nt); // == high-order jshort of name_and_type_at(which_nt) |
duke@435 | 658 | |
duke@435 | 659 | BasicType basic_type_for_signature_at(int which); |
duke@435 | 660 | |
duke@435 | 661 | // Resolve string constants (to prevent allocation during compilation) |
duke@435 | 662 | void resolve_string_constants(TRAPS) { |
duke@435 | 663 | constantPoolHandle h_this(THREAD, this); |
duke@435 | 664 | resolve_string_constants_impl(h_this, CHECK); |
duke@435 | 665 | } |
duke@435 | 666 | |
coleenp@4037 | 667 | // CDS support |
coleenp@4037 | 668 | void remove_unshareable_info(); |
coleenp@4037 | 669 | void restore_unshareable_info(TRAPS); |
coleenp@4037 | 670 | bool resolve_class_constants(TRAPS); |
coleenp@4045 | 671 | // The ConstantPool vtable is restored by this call when the ConstantPool is |
coleenp@4045 | 672 | // in the shared archive. See patch_klass_vtables() in metaspaceShared.cpp for |
coleenp@4045 | 673 | // all the gory details. SA, dtrace and pstack helpers distinguish metadata |
coleenp@4045 | 674 | // by their vtable. |
coleenp@4045 | 675 | void restore_vtable() { guarantee(is_constantPool(), "vtable restored by this call"); } |
coleenp@4037 | 676 | |
jrose@2268 | 677 | private: |
jrose@2268 | 678 | enum { _no_index_sentinel = -1, _possible_index_sentinel = -2 }; |
jrose@2268 | 679 | public: |
jrose@2268 | 680 | |
jrose@1957 | 681 | // Resolve late bound constants. |
jrose@1957 | 682 | oop resolve_constant_at(int index, TRAPS) { |
jrose@1957 | 683 | constantPoolHandle h_this(THREAD, this); |
jrose@2268 | 684 | return resolve_constant_at_impl(h_this, index, _no_index_sentinel, THREAD); |
jrose@1957 | 685 | } |
jrose@1957 | 686 | |
jrose@1957 | 687 | oop resolve_cached_constant_at(int cache_index, TRAPS) { |
jrose@1957 | 688 | constantPoolHandle h_this(THREAD, this); |
jrose@2268 | 689 | return resolve_constant_at_impl(h_this, _no_index_sentinel, cache_index, THREAD); |
jrose@2268 | 690 | } |
jrose@2268 | 691 | |
jrose@2268 | 692 | oop resolve_possibly_cached_constant_at(int pool_index, TRAPS) { |
jrose@2268 | 693 | constantPoolHandle h_this(THREAD, this); |
jrose@2268 | 694 | return resolve_constant_at_impl(h_this, pool_index, _possible_index_sentinel, THREAD); |
jrose@1957 | 695 | } |
jrose@1957 | 696 | |
twisti@3969 | 697 | oop resolve_bootstrap_specifier_at(int index, TRAPS) { |
twisti@3969 | 698 | constantPoolHandle h_this(THREAD, this); |
twisti@3969 | 699 | return resolve_bootstrap_specifier_at_impl(h_this, index, THREAD); |
twisti@3969 | 700 | } |
twisti@3969 | 701 | |
duke@435 | 702 | // Klass name matches name at offset |
duke@435 | 703 | bool klass_name_at_matches(instanceKlassHandle k, int which); |
duke@435 | 704 | |
duke@435 | 705 | // Sizing |
coleenp@548 | 706 | int length() const { return _length; } |
coleenp@548 | 707 | void set_length(int length) { _length = length; } |
coleenp@548 | 708 | |
coleenp@548 | 709 | // Tells whether index is within bounds. |
coleenp@548 | 710 | bool is_within_bounds(int index) const { |
coleenp@548 | 711 | return 0 <= index && index < length(); |
coleenp@548 | 712 | } |
coleenp@548 | 713 | |
acorn@4497 | 714 | // Sizing (in words) |
coleenp@4037 | 715 | static int header_size() { return sizeof(ConstantPool)/HeapWordSize; } |
coleenp@4037 | 716 | static int size(int length) { return align_object_size(header_size() + length); } |
coleenp@4037 | 717 | int size() const { return size(length()); } |
acorn@4497 | 718 | #if INCLUDE_SERVICES |
acorn@4497 | 719 | void collect_statistics(KlassSizeStats *sz) const; |
acorn@4497 | 720 | #endif |
duke@435 | 721 | |
duke@435 | 722 | friend class ClassFileParser; |
duke@435 | 723 | friend class SystemDictionary; |
duke@435 | 724 | |
duke@435 | 725 | // Used by compiler to prevent classloading. |
twisti@4133 | 726 | static Method* method_at_if_loaded (constantPoolHandle this_oop, int which); |
twisti@4133 | 727 | static bool has_appendix_at_if_loaded (constantPoolHandle this_oop, int which); |
twisti@4133 | 728 | static oop appendix_at_if_loaded (constantPoolHandle this_oop, int which); |
twisti@4133 | 729 | static bool has_method_type_at_if_loaded (constantPoolHandle this_oop, int which); |
twisti@4133 | 730 | static oop method_type_at_if_loaded (constantPoolHandle this_oop, int which); |
twisti@4133 | 731 | static Klass* klass_at_if_loaded (constantPoolHandle this_oop, int which); |
twisti@4133 | 732 | static Klass* klass_ref_at_if_loaded (constantPoolHandle this_oop, int which); |
duke@435 | 733 | // Same as above - but does LinkResolving. |
twisti@4133 | 734 | static Klass* klass_ref_at_if_loaded_check(constantPoolHandle this_oop, int which, TRAPS); |
duke@435 | 735 | |
duke@435 | 736 | // Routines currently used for annotations (only called by jvm.cpp) but which might be used in the |
jrose@2265 | 737 | // future by other Java code. These take constant pool indices rather than |
duke@435 | 738 | // constant pool cache indices as do the peer methods above. |
coleenp@2497 | 739 | Symbol* uncached_klass_ref_at_noresolve(int which); |
coleenp@2497 | 740 | Symbol* uncached_name_ref_at(int which) { return impl_name_ref_at(which, true); } |
coleenp@2497 | 741 | Symbol* uncached_signature_ref_at(int which) { return impl_signature_ref_at(which, true); } |
jrose@1161 | 742 | int uncached_klass_ref_index_at(int which) { return impl_klass_ref_index_at(which, true); } |
jrose@1161 | 743 | int uncached_name_and_type_ref_index_at(int which) { return impl_name_and_type_ref_index_at(which, true); } |
duke@435 | 744 | |
duke@435 | 745 | // Sharing |
duke@435 | 746 | int pre_resolve_shared_klasses(TRAPS); |
duke@435 | 747 | |
duke@435 | 748 | // Debugging |
duke@435 | 749 | const char* printable_name_at(int which) PRODUCT_RETURN0; |
duke@435 | 750 | |
jrose@1920 | 751 | #ifdef ASSERT |
jrose@1920 | 752 | enum { CPCACHE_INDEX_TAG = 0x10000 }; // helps keep CP cache indices distinct from CP indices |
jrose@1957 | 753 | #else |
jrose@1957 | 754 | enum { CPCACHE_INDEX_TAG = 0 }; // in product mode, this zero value is a no-op |
jrose@1920 | 755 | #endif //ASSERT |
jrose@1920 | 756 | |
coleenp@4037 | 757 | static int decode_cpcache_index(int raw_index, bool invokedynamic_ok = false) { |
coleenp@4037 | 758 | if (invokedynamic_ok && is_invokedynamic_index(raw_index)) |
coleenp@4037 | 759 | return decode_invokedynamic_index(raw_index); |
coleenp@4037 | 760 | else |
coleenp@4037 | 761 | return raw_index - CPCACHE_INDEX_TAG; |
coleenp@4037 | 762 | } |
twisti@3969 | 763 | |
duke@435 | 764 | private: |
duke@435 | 765 | |
coleenp@4037 | 766 | void set_resolved_references(jobject s) { _resolved_references = s; } |
coleenp@4037 | 767 | Array<u2>* reference_map() const { return _reference_map; } |
coleenp@4037 | 768 | void set_reference_map(Array<u2>* o) { _reference_map = o; } |
coleenp@4037 | 769 | |
coleenp@4037 | 770 | // patch JSR 292 resolved references after the class is linked. |
coleenp@4037 | 771 | void patch_resolved_references(GrowableArray<Handle>* cp_patches); |
coleenp@4037 | 772 | |
coleenp@2497 | 773 | Symbol* impl_name_ref_at(int which, bool uncached); |
coleenp@2497 | 774 | Symbol* impl_signature_ref_at(int which, bool uncached); |
jrose@1161 | 775 | int impl_klass_ref_index_at(int which, bool uncached); |
jrose@1161 | 776 | int impl_name_and_type_ref_index_at(int which, bool uncached); |
jrose@1161 | 777 | |
jrose@1920 | 778 | int remap_instruction_operand_from_cache(int operand); // operand must be biased by CPCACHE_INDEX_TAG |
duke@435 | 779 | |
duke@435 | 780 | // Used while constructing constant pool (only by ClassFileParser) |
duke@435 | 781 | jint klass_index_at(int which) { |
duke@435 | 782 | assert(tag_at(which).is_klass_index(), "Corrupted constant pool"); |
duke@435 | 783 | return *int_at_addr(which); |
duke@435 | 784 | } |
duke@435 | 785 | |
duke@435 | 786 | jint string_index_at(int which) { |
duke@435 | 787 | assert(tag_at(which).is_string_index(), "Corrupted constant pool"); |
duke@435 | 788 | return *int_at_addr(which); |
duke@435 | 789 | } |
duke@435 | 790 | |
duke@435 | 791 | // Performs the LinkResolver checks |
duke@435 | 792 | static void verify_constant_pool_resolve(constantPoolHandle this_oop, KlassHandle klass, TRAPS); |
duke@435 | 793 | |
duke@435 | 794 | // Implementation of methods that needs an exposed 'this' pointer, in order to |
duke@435 | 795 | // handle GC while executing the method |
coleenp@4037 | 796 | static Klass* klass_at_impl(constantPoolHandle this_oop, int which, TRAPS); |
coleenp@4037 | 797 | static oop string_at_impl(constantPoolHandle this_oop, int which, int obj_index, TRAPS); |
duke@435 | 798 | |
duke@435 | 799 | // Resolve string constants (to prevent allocation during compilation) |
duke@435 | 800 | static void resolve_string_constants_impl(constantPoolHandle this_oop, TRAPS); |
duke@435 | 801 | |
jrose@1957 | 802 | static oop resolve_constant_at_impl(constantPoolHandle this_oop, int index, int cache_index, TRAPS); |
coleenp@4037 | 803 | static void save_and_throw_exception(constantPoolHandle this_oop, int which, int tag_value, TRAPS); |
twisti@3969 | 804 | static oop resolve_bootstrap_specifier_at_impl(constantPoolHandle this_oop, int index, TRAPS); |
jrose@1957 | 805 | |
duke@435 | 806 | public: |
coleenp@4037 | 807 | // Merging ConstantPool* support: |
duke@435 | 808 | bool compare_entry_to(int index1, constantPoolHandle cp2, int index2, TRAPS); |
jrose@2353 | 809 | void copy_cp_to(int start_i, int end_i, constantPoolHandle to_cp, int to_i, TRAPS) { |
jrose@2353 | 810 | constantPoolHandle h_this(THREAD, this); |
jrose@2353 | 811 | copy_cp_to_impl(h_this, start_i, end_i, to_cp, to_i, THREAD); |
jrose@2353 | 812 | } |
jrose@2353 | 813 | static void copy_cp_to_impl(constantPoolHandle from_cp, int start_i, int end_i, constantPoolHandle to_cp, int to_i, TRAPS); |
jrose@2353 | 814 | static void copy_entry_to(constantPoolHandle from_cp, int from_i, constantPoolHandle to_cp, int to_i, TRAPS); |
sspitsyn@4493 | 815 | static void copy_operands(constantPoolHandle from_cp, constantPoolHandle to_cp, TRAPS); |
duke@435 | 816 | int find_matching_entry(int pattern_i, constantPoolHandle search_cp, TRAPS); |
coleenp@4466 | 817 | int version() const { return _saved._version; } |
coleenp@4466 | 818 | void set_version(int version) { _saved._version = version; } |
coleenp@4466 | 819 | void increment_and_save_version(int version) { |
coleenp@4467 | 820 | _saved._version = version >= 0 ? (version + 1) : version; // keep overflow |
coleenp@4466 | 821 | } |
coleenp@4037 | 822 | |
coleenp@4037 | 823 | void set_resolved_reference_length(int length) { _saved._resolved_reference_length = length; } |
coleenp@4037 | 824 | int resolved_reference_length() const { return _saved._resolved_reference_length; } |
iklam@4984 | 825 | |
iklam@4984 | 826 | // lock() may return null -- constant pool updates may happen before this lock is |
iklam@4984 | 827 | // initialized, because the _pool_holder has not been fully initialized and |
iklam@4984 | 828 | // has not been registered into the system dictionary. In this case, no other |
iklam@4984 | 829 | // thread can be modifying this constantpool, so no synchronization is |
iklam@4984 | 830 | // necessary. |
iklam@4984 | 831 | // |
iklam@4984 | 832 | // Use cplock() like this: |
iklam@4984 | 833 | // oop cplock = cp->lock(); |
iklam@4984 | 834 | // ObjectLocker ol(cplock , THREAD, cplock != NULL); |
iklam@4984 | 835 | oop lock(); |
duke@435 | 836 | |
coleenp@2497 | 837 | // Decrease ref counts of symbols that are in the constant pool |
coleenp@2497 | 838 | // when the holder class is unloaded |
coleenp@2497 | 839 | void unreference_symbols(); |
duke@435 | 840 | |
coleenp@4037 | 841 | // Deallocate constant pool for RedefineClasses |
coleenp@4037 | 842 | void deallocate_contents(ClassLoaderData* loader_data); |
coleenp@4037 | 843 | void release_C_heap_structures(); |
coleenp@4037 | 844 | |
duke@435 | 845 | // JVMTI accesss - GetConstantPool, RetransformClasses, ... |
duke@435 | 846 | friend class JvmtiConstantPoolReconstituter; |
duke@435 | 847 | |
duke@435 | 848 | private: |
duke@435 | 849 | jint cpool_entry_size(jint idx); |
duke@435 | 850 | jint hash_entries_to(SymbolHashMap *symmap, SymbolHashMap *classmap); |
duke@435 | 851 | |
duke@435 | 852 | // Copy cpool bytes into byte array. |
duke@435 | 853 | // Returns: |
duke@435 | 854 | // int > 0, count of the raw cpool bytes that have been copied |
duke@435 | 855 | // 0, OutOfMemory error |
duke@435 | 856 | // -1, Internal error |
duke@435 | 857 | int copy_cpool_bytes(int cpool_size, |
duke@435 | 858 | SymbolHashMap* tbl, |
duke@435 | 859 | unsigned char *bytes); |
coleenp@4037 | 860 | |
coleenp@4037 | 861 | public: |
coleenp@4037 | 862 | // Verify |
coleenp@4037 | 863 | void verify_on(outputStream* st); |
coleenp@4037 | 864 | |
coleenp@4037 | 865 | // Printing |
coleenp@4037 | 866 | void print_on(outputStream* st) const; |
coleenp@4037 | 867 | void print_value_on(outputStream* st) const; |
coleenp@4037 | 868 | void print_entry_on(int index, outputStream* st); |
coleenp@4037 | 869 | |
coleenp@4037 | 870 | const char* internal_name() const { return "{constant pool}"; } |
coleenp@4037 | 871 | |
coleenp@4037 | 872 | #ifndef PRODUCT |
coleenp@4037 | 873 | // Compile the world support |
coleenp@4037 | 874 | static void preload_and_initialize_all_classes(ConstantPool* constant_pool, TRAPS); |
coleenp@4037 | 875 | #endif |
duke@435 | 876 | }; |
duke@435 | 877 | |
zgu@3900 | 878 | class SymbolHashMapEntry : public CHeapObj<mtSymbol> { |
duke@435 | 879 | private: |
duke@435 | 880 | unsigned int _hash; // 32-bit hash for item |
duke@435 | 881 | SymbolHashMapEntry* _next; // Next element in the linked list for this bucket |
coleenp@2497 | 882 | Symbol* _symbol; // 1-st part of the mapping: symbol => value |
duke@435 | 883 | u2 _value; // 2-nd part of the mapping: symbol => value |
duke@435 | 884 | |
duke@435 | 885 | public: |
duke@435 | 886 | unsigned int hash() const { return _hash; } |
duke@435 | 887 | void set_hash(unsigned int hash) { _hash = hash; } |
duke@435 | 888 | |
duke@435 | 889 | SymbolHashMapEntry* next() const { return _next; } |
duke@435 | 890 | void set_next(SymbolHashMapEntry* next) { _next = next; } |
duke@435 | 891 | |
coleenp@2497 | 892 | Symbol* symbol() const { return _symbol; } |
coleenp@2497 | 893 | void set_symbol(Symbol* sym) { _symbol = sym; } |
duke@435 | 894 | |
duke@435 | 895 | u2 value() const { return _value; } |
duke@435 | 896 | void set_value(u2 value) { _value = value; } |
duke@435 | 897 | |
coleenp@2497 | 898 | SymbolHashMapEntry(unsigned int hash, Symbol* symbol, u2 value) |
duke@435 | 899 | : _hash(hash), _symbol(symbol), _value(value), _next(NULL) {} |
duke@435 | 900 | |
duke@435 | 901 | }; // End SymbolHashMapEntry class |
duke@435 | 902 | |
duke@435 | 903 | |
zgu@3900 | 904 | class SymbolHashMapBucket : public CHeapObj<mtSymbol> { |
duke@435 | 905 | |
duke@435 | 906 | private: |
duke@435 | 907 | SymbolHashMapEntry* _entry; |
duke@435 | 908 | |
duke@435 | 909 | public: |
duke@435 | 910 | SymbolHashMapEntry* entry() const { return _entry; } |
duke@435 | 911 | void set_entry(SymbolHashMapEntry* entry) { _entry = entry; } |
duke@435 | 912 | void clear() { _entry = NULL; } |
duke@435 | 913 | |
duke@435 | 914 | }; // End SymbolHashMapBucket class |
duke@435 | 915 | |
duke@435 | 916 | |
zgu@3900 | 917 | class SymbolHashMap: public CHeapObj<mtSymbol> { |
duke@435 | 918 | |
duke@435 | 919 | private: |
duke@435 | 920 | // Default number of entries in the table |
duke@435 | 921 | enum SymbolHashMap_Constants { |
duke@435 | 922 | _Def_HashMap_Size = 256 |
duke@435 | 923 | }; |
duke@435 | 924 | |
duke@435 | 925 | int _table_size; |
duke@435 | 926 | SymbolHashMapBucket* _buckets; |
duke@435 | 927 | |
duke@435 | 928 | void initialize_table(int table_size) { |
duke@435 | 929 | _table_size = table_size; |
zgu@3900 | 930 | _buckets = NEW_C_HEAP_ARRAY(SymbolHashMapBucket, table_size, mtSymbol); |
duke@435 | 931 | for (int index = 0; index < table_size; index++) { |
duke@435 | 932 | _buckets[index].clear(); |
duke@435 | 933 | } |
duke@435 | 934 | } |
duke@435 | 935 | |
duke@435 | 936 | public: |
duke@435 | 937 | |
duke@435 | 938 | int table_size() const { return _table_size; } |
duke@435 | 939 | |
duke@435 | 940 | SymbolHashMap() { initialize_table(_Def_HashMap_Size); } |
duke@435 | 941 | SymbolHashMap(int table_size) { initialize_table(table_size); } |
duke@435 | 942 | |
duke@435 | 943 | // hash P(31) from Kernighan & Ritchie |
duke@435 | 944 | static unsigned int compute_hash(const char* str, int len) { |
duke@435 | 945 | unsigned int hash = 0; |
duke@435 | 946 | while (len-- > 0) { |
duke@435 | 947 | hash = 31*hash + (unsigned) *str; |
duke@435 | 948 | str++; |
duke@435 | 949 | } |
duke@435 | 950 | return hash; |
duke@435 | 951 | } |
duke@435 | 952 | |
duke@435 | 953 | SymbolHashMapEntry* bucket(int i) { |
duke@435 | 954 | return _buckets[i].entry(); |
duke@435 | 955 | } |
duke@435 | 956 | |
coleenp@2497 | 957 | void add_entry(Symbol* sym, u2 value); |
coleenp@2497 | 958 | SymbolHashMapEntry* find_entry(Symbol* sym); |
duke@435 | 959 | |
coleenp@2497 | 960 | u2 symbol_to_value(Symbol* sym) { |
duke@435 | 961 | SymbolHashMapEntry *entry = find_entry(sym); |
duke@435 | 962 | return (entry == NULL) ? 0 : entry->value(); |
duke@435 | 963 | } |
duke@435 | 964 | |
duke@435 | 965 | ~SymbolHashMap() { |
duke@435 | 966 | SymbolHashMapEntry* next; |
duke@435 | 967 | for (int i = 0; i < _table_size; i++) { |
duke@435 | 968 | for (SymbolHashMapEntry* cur = bucket(i); cur != NULL; cur = next) { |
duke@435 | 969 | next = cur->next(); |
duke@435 | 970 | delete(cur); |
duke@435 | 971 | } |
duke@435 | 972 | } |
duke@435 | 973 | delete _buckets; |
duke@435 | 974 | } |
duke@435 | 975 | }; // End SymbolHashMap class |
stefank@2314 | 976 | |
stefank@2314 | 977 | #endif // SHARE_VM_OOPS_CONSTANTPOOLOOP_HPP |