Fri, 03 Dec 2010 15:53:57 -0800
7001379: bootstrap method data needs to be moved from constant pool to a classfile attribute
Reviewed-by: twisti
duke@435 | 1 | /* |
jrose@1934 | 2 | * Copyright (c) 1997, 2010, 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" |
stefank@2314 | 29 | #include "oops/cpCacheOop.hpp" |
stefank@2314 | 30 | #include "oops/typeArrayOop.hpp" |
stefank@2314 | 31 | #include "utilities/constantTag.hpp" |
stefank@2314 | 32 | #ifdef TARGET_ARCH_x86 |
stefank@2314 | 33 | # include "bytes_x86.hpp" |
stefank@2314 | 34 | #endif |
stefank@2314 | 35 | #ifdef TARGET_ARCH_sparc |
stefank@2314 | 36 | # include "bytes_sparc.hpp" |
stefank@2314 | 37 | #endif |
stefank@2314 | 38 | #ifdef TARGET_ARCH_zero |
stefank@2314 | 39 | # include "bytes_zero.hpp" |
stefank@2314 | 40 | #endif |
stefank@2314 | 41 | |
duke@435 | 42 | // A constantPool is an array containing class constants as described in the |
duke@435 | 43 | // class file. |
duke@435 | 44 | // |
duke@435 | 45 | // Most of the constant pool entries are written during class parsing, which |
duke@435 | 46 | // is safe. For klass and string types, the constant pool entry is |
duke@435 | 47 | // modified when the entry is resolved. If a klass or string constant pool |
duke@435 | 48 | // entry is read without a lock, only the resolved state guarantees that |
duke@435 | 49 | // the entry in the constant pool is a klass or String object and |
duke@435 | 50 | // not a symbolOop. |
duke@435 | 51 | |
duke@435 | 52 | class SymbolHashMap; |
duke@435 | 53 | |
coleenp@548 | 54 | class constantPoolOopDesc : public oopDesc { |
duke@435 | 55 | friend class VMStructs; |
duke@435 | 56 | friend class BytecodeInterpreter; // Directly extracts an oop in the pool for fast instanceof/checkcast |
duke@435 | 57 | private: |
duke@435 | 58 | typeArrayOop _tags; // the tag array describing the constant pool's contents |
duke@435 | 59 | constantPoolCacheOop _cache; // the cache holding interpreter runtime information |
duke@435 | 60 | klassOop _pool_holder; // the corresponding class |
jrose@2268 | 61 | typeArrayOop _operands; // for variable-sized (InvokeDynamic) nodes, usually empty |
jrose@866 | 62 | int _flags; // a few header bits to describe contents for GC |
coleenp@548 | 63 | int _length; // number of elements in the array |
jmasa@953 | 64 | volatile bool _is_conc_safe; // if true, safe for concurrent |
jmasa@953 | 65 | // GC processing |
duke@435 | 66 | // only set to non-zero if constant pool is merged by RedefineClasses |
duke@435 | 67 | int _orig_length; |
duke@435 | 68 | |
duke@435 | 69 | void set_tags(typeArrayOop tags) { oop_store_without_check((oop*)&_tags, tags); } |
duke@435 | 70 | void tag_at_put(int which, jbyte t) { tags()->byte_at_put(which, t); } |
duke@435 | 71 | void release_tag_at_put(int which, jbyte t) { tags()->release_byte_at_put(which, t); } |
duke@435 | 72 | |
jrose@2268 | 73 | void set_operands(typeArrayOop operands) { oop_store_without_check((oop*)&_operands, operands); } |
jrose@2268 | 74 | |
jrose@866 | 75 | enum FlagBit { |
jrose@1161 | 76 | FB_has_invokedynamic = 1, |
jrose@866 | 77 | FB_has_pseudo_string = 2 |
jrose@866 | 78 | }; |
jrose@866 | 79 | |
jrose@866 | 80 | int flags() const { return _flags; } |
jrose@866 | 81 | void set_flags(int f) { _flags = f; } |
jrose@866 | 82 | bool flag_at(FlagBit fb) const { return (_flags & (1 << (int)fb)) != 0; } |
jrose@866 | 83 | void set_flag_at(FlagBit fb); |
jrose@866 | 84 | // no clear_flag_at function; they only increase |
jrose@866 | 85 | |
duke@435 | 86 | private: |
duke@435 | 87 | intptr_t* base() const { return (intptr_t*) (((char*) this) + sizeof(constantPoolOopDesc)); } |
duke@435 | 88 | oop* tags_addr() { return (oop*)&_tags; } |
duke@435 | 89 | oop* cache_addr() { return (oop*)&_cache; } |
jrose@2268 | 90 | oop* operands_addr() { return (oop*)&_operands; } |
duke@435 | 91 | |
duke@435 | 92 | oop* obj_at_addr(int which) const { |
duke@435 | 93 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 94 | return (oop*) &base()[which]; |
duke@435 | 95 | } |
duke@435 | 96 | |
duke@435 | 97 | jint* int_at_addr(int which) const { |
duke@435 | 98 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 99 | return (jint*) &base()[which]; |
duke@435 | 100 | } |
duke@435 | 101 | |
duke@435 | 102 | jlong* long_at_addr(int which) const { |
duke@435 | 103 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 104 | return (jlong*) &base()[which]; |
duke@435 | 105 | } |
duke@435 | 106 | |
duke@435 | 107 | jfloat* float_at_addr(int which) const { |
duke@435 | 108 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 109 | return (jfloat*) &base()[which]; |
duke@435 | 110 | } |
duke@435 | 111 | |
duke@435 | 112 | jdouble* double_at_addr(int which) const { |
duke@435 | 113 | assert(is_within_bounds(which), "index out of bounds"); |
duke@435 | 114 | return (jdouble*) &base()[which]; |
duke@435 | 115 | } |
duke@435 | 116 | |
duke@435 | 117 | public: |
duke@435 | 118 | typeArrayOop tags() const { return _tags; } |
jrose@2268 | 119 | typeArrayOop operands() const { return _operands; } |
duke@435 | 120 | |
jrose@866 | 121 | bool has_pseudo_string() const { return flag_at(FB_has_pseudo_string); } |
jrose@1161 | 122 | bool has_invokedynamic() const { return flag_at(FB_has_invokedynamic); } |
jrose@866 | 123 | void set_pseudo_string() { set_flag_at(FB_has_pseudo_string); } |
jrose@1161 | 124 | void set_invokedynamic() { set_flag_at(FB_has_invokedynamic); } |
jrose@866 | 125 | |
duke@435 | 126 | // Klass holding pool |
duke@435 | 127 | klassOop pool_holder() const { return _pool_holder; } |
duke@435 | 128 | void set_pool_holder(klassOop k) { oop_store_without_check((oop*)&_pool_holder, (oop) k); } |
duke@435 | 129 | oop* pool_holder_addr() { return (oop*)&_pool_holder; } |
duke@435 | 130 | |
duke@435 | 131 | // Interpreter runtime support |
duke@435 | 132 | constantPoolCacheOop cache() const { return _cache; } |
duke@435 | 133 | void set_cache(constantPoolCacheOop cache){ oop_store((oop*)&_cache, cache); } |
duke@435 | 134 | |
duke@435 | 135 | // Assembly code support |
duke@435 | 136 | static int tags_offset_in_bytes() { return offset_of(constantPoolOopDesc, _tags); } |
duke@435 | 137 | static int cache_offset_in_bytes() { return offset_of(constantPoolOopDesc, _cache); } |
jrose@2268 | 138 | static int operands_offset_in_bytes() { return offset_of(constantPoolOopDesc, _operands); } |
duke@435 | 139 | static int pool_holder_offset_in_bytes() { return offset_of(constantPoolOopDesc, _pool_holder); } |
duke@435 | 140 | |
duke@435 | 141 | // Storing constants |
duke@435 | 142 | |
duke@435 | 143 | void klass_at_put(int which, klassOop k) { |
duke@435 | 144 | oop_store_without_check((volatile oop *)obj_at_addr(which), oop(k)); |
duke@435 | 145 | // The interpreter assumes when the tag is stored, the klass is resolved |
duke@435 | 146 | // and the klassOop is a klass rather than a symbolOop, so we need |
duke@435 | 147 | // hardware store ordering here. |
duke@435 | 148 | release_tag_at_put(which, JVM_CONSTANT_Class); |
duke@435 | 149 | if (UseConcMarkSweepGC) { |
duke@435 | 150 | // In case the earlier card-mark was consumed by a concurrent |
duke@435 | 151 | // marking thread before the tag was updated, redirty the card. |
duke@435 | 152 | oop_store_without_check((volatile oop *)obj_at_addr(which), oop(k)); |
duke@435 | 153 | } |
duke@435 | 154 | } |
duke@435 | 155 | |
duke@435 | 156 | // For temporary use while constructing constant pool |
duke@435 | 157 | void klass_index_at_put(int which, int name_index) { |
duke@435 | 158 | tag_at_put(which, JVM_CONSTANT_ClassIndex); |
duke@435 | 159 | *int_at_addr(which) = name_index; |
duke@435 | 160 | } |
duke@435 | 161 | |
duke@435 | 162 | // Temporary until actual use |
duke@435 | 163 | void unresolved_klass_at_put(int which, symbolOop s) { |
duke@435 | 164 | // Overwrite the old index with a GC friendly value so |
duke@435 | 165 | // that if GC looks during the transition it won't try |
duke@435 | 166 | // to treat a small integer as oop. |
duke@435 | 167 | *obj_at_addr(which) = NULL; |
duke@435 | 168 | release_tag_at_put(which, JVM_CONSTANT_UnresolvedClass); |
duke@435 | 169 | oop_store_without_check(obj_at_addr(which), oop(s)); |
duke@435 | 170 | } |
duke@435 | 171 | |
jrose@1957 | 172 | void method_handle_index_at_put(int which, int ref_kind, int ref_index) { |
jrose@1957 | 173 | tag_at_put(which, JVM_CONSTANT_MethodHandle); |
jrose@1957 | 174 | *int_at_addr(which) = ((jint) ref_index<<16) | ref_kind; |
jrose@1957 | 175 | } |
jrose@1957 | 176 | |
jrose@1957 | 177 | void method_type_index_at_put(int which, int ref_index) { |
jrose@1957 | 178 | tag_at_put(which, JVM_CONSTANT_MethodType); |
jrose@1957 | 179 | *int_at_addr(which) = ref_index; |
jrose@1957 | 180 | } |
jrose@1957 | 181 | |
jrose@2353 | 182 | void invoke_dynamic_at_put(int which, int bootstrap_specifier_index, int name_and_type_index) { |
jrose@2015 | 183 | tag_at_put(which, JVM_CONSTANT_InvokeDynamic); |
jrose@2353 | 184 | *int_at_addr(which) = ((jint) name_and_type_index<<16) | bootstrap_specifier_index; |
jrose@2015 | 185 | } |
jrose@2353 | 186 | |
jrose@2353 | 187 | void invoke_dynamic_trans_at_put(int which, int bootstrap_method_index, int name_and_type_index) { |
jrose@2353 | 188 | tag_at_put(which, JVM_CONSTANT_InvokeDynamicTrans); |
jrose@2353 | 189 | *int_at_addr(which) = ((jint) name_and_type_index<<16) | bootstrap_method_index; |
jrose@2353 | 190 | assert(AllowTransitionalJSR292, ""); |
jrose@2268 | 191 | } |
jrose@2015 | 192 | |
duke@435 | 193 | // Temporary until actual use |
duke@435 | 194 | void unresolved_string_at_put(int which, symbolOop s) { |
duke@435 | 195 | *obj_at_addr(which) = NULL; |
duke@435 | 196 | release_tag_at_put(which, JVM_CONSTANT_UnresolvedString); |
duke@435 | 197 | oop_store_without_check(obj_at_addr(which), oop(s)); |
duke@435 | 198 | } |
duke@435 | 199 | |
duke@435 | 200 | void int_at_put(int which, jint i) { |
duke@435 | 201 | tag_at_put(which, JVM_CONSTANT_Integer); |
duke@435 | 202 | *int_at_addr(which) = i; |
duke@435 | 203 | } |
duke@435 | 204 | |
duke@435 | 205 | void long_at_put(int which, jlong l) { |
duke@435 | 206 | tag_at_put(which, JVM_CONSTANT_Long); |
duke@435 | 207 | // *long_at_addr(which) = l; |
duke@435 | 208 | Bytes::put_native_u8((address)long_at_addr(which), *((u8*) &l)); |
duke@435 | 209 | } |
duke@435 | 210 | |
duke@435 | 211 | void float_at_put(int which, jfloat f) { |
duke@435 | 212 | tag_at_put(which, JVM_CONSTANT_Float); |
duke@435 | 213 | *float_at_addr(which) = f; |
duke@435 | 214 | } |
duke@435 | 215 | |
duke@435 | 216 | void double_at_put(int which, jdouble d) { |
duke@435 | 217 | tag_at_put(which, JVM_CONSTANT_Double); |
duke@435 | 218 | // *double_at_addr(which) = d; |
duke@435 | 219 | // u8 temp = *(u8*) &d; |
duke@435 | 220 | Bytes::put_native_u8((address) double_at_addr(which), *((u8*) &d)); |
duke@435 | 221 | } |
duke@435 | 222 | |
duke@435 | 223 | void symbol_at_put(int which, symbolOop s) { |
duke@435 | 224 | tag_at_put(which, JVM_CONSTANT_Utf8); |
duke@435 | 225 | oop_store_without_check(obj_at_addr(which), oop(s)); |
duke@435 | 226 | } |
duke@435 | 227 | |
duke@435 | 228 | void string_at_put(int which, oop str) { |
duke@435 | 229 | oop_store((volatile oop*)obj_at_addr(which), str); |
duke@435 | 230 | release_tag_at_put(which, JVM_CONSTANT_String); |
duke@435 | 231 | if (UseConcMarkSweepGC) { |
duke@435 | 232 | // In case the earlier card-mark was consumed by a concurrent |
duke@435 | 233 | // marking thread before the tag was updated, redirty the card. |
duke@435 | 234 | oop_store_without_check((volatile oop *)obj_at_addr(which), str); |
duke@435 | 235 | } |
duke@435 | 236 | } |
duke@435 | 237 | |
twisti@1573 | 238 | void object_at_put(int which, oop str) { |
twisti@1573 | 239 | oop_store((volatile oop*) obj_at_addr(which), str); |
twisti@1573 | 240 | release_tag_at_put(which, JVM_CONSTANT_Object); |
twisti@1573 | 241 | if (UseConcMarkSweepGC) { |
twisti@1573 | 242 | // In case the earlier card-mark was consumed by a concurrent |
twisti@1573 | 243 | // marking thread before the tag was updated, redirty the card. |
twisti@1573 | 244 | oop_store_without_check((volatile oop*) obj_at_addr(which), str); |
twisti@1573 | 245 | } |
twisti@1573 | 246 | } |
twisti@1573 | 247 | |
duke@435 | 248 | // For temporary use while constructing constant pool |
duke@435 | 249 | void string_index_at_put(int which, int string_index) { |
duke@435 | 250 | tag_at_put(which, JVM_CONSTANT_StringIndex); |
duke@435 | 251 | *int_at_addr(which) = string_index; |
duke@435 | 252 | } |
duke@435 | 253 | |
duke@435 | 254 | void field_at_put(int which, int class_index, int name_and_type_index) { |
duke@435 | 255 | tag_at_put(which, JVM_CONSTANT_Fieldref); |
duke@435 | 256 | *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index; |
duke@435 | 257 | } |
duke@435 | 258 | |
duke@435 | 259 | void method_at_put(int which, int class_index, int name_and_type_index) { |
duke@435 | 260 | tag_at_put(which, JVM_CONSTANT_Methodref); |
duke@435 | 261 | *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index; |
duke@435 | 262 | } |
duke@435 | 263 | |
duke@435 | 264 | void interface_method_at_put(int which, int class_index, int name_and_type_index) { |
duke@435 | 265 | tag_at_put(which, JVM_CONSTANT_InterfaceMethodref); |
duke@435 | 266 | *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index; // Not so nice |
duke@435 | 267 | } |
duke@435 | 268 | |
duke@435 | 269 | void name_and_type_at_put(int which, int name_index, int signature_index) { |
duke@435 | 270 | tag_at_put(which, JVM_CONSTANT_NameAndType); |
duke@435 | 271 | *int_at_addr(which) = ((jint) signature_index<<16) | name_index; // Not so nice |
duke@435 | 272 | } |
duke@435 | 273 | |
duke@435 | 274 | // Tag query |
duke@435 | 275 | |
duke@435 | 276 | constantTag tag_at(int which) const { return (constantTag)tags()->byte_at_acquire(which); } |
duke@435 | 277 | |
duke@435 | 278 | // Whether the entry is a pointer that must be GC'd. |
duke@435 | 279 | bool is_pointer_entry(int which) { |
duke@435 | 280 | constantTag tag = tag_at(which); |
duke@435 | 281 | return tag.is_klass() || |
duke@435 | 282 | tag.is_unresolved_klass() || |
duke@435 | 283 | tag.is_symbol() || |
duke@435 | 284 | tag.is_unresolved_string() || |
twisti@1573 | 285 | tag.is_string() || |
twisti@1573 | 286 | tag.is_object(); |
duke@435 | 287 | } |
duke@435 | 288 | |
duke@435 | 289 | // Fetching constants |
duke@435 | 290 | |
duke@435 | 291 | klassOop klass_at(int which, TRAPS) { |
duke@435 | 292 | constantPoolHandle h_this(THREAD, this); |
duke@435 | 293 | return klass_at_impl(h_this, which, CHECK_NULL); |
duke@435 | 294 | } |
duke@435 | 295 | |
duke@435 | 296 | symbolOop klass_name_at(int which); // Returns the name, w/o resolving. |
duke@435 | 297 | |
duke@435 | 298 | klassOop resolved_klass_at(int which) { // Used by Compiler |
duke@435 | 299 | guarantee(tag_at(which).is_klass(), "Corrupted constant pool"); |
duke@435 | 300 | // Must do an acquire here in case another thread resolved the klass |
duke@435 | 301 | // behind our back, lest we later load stale values thru the oop. |
duke@435 | 302 | return klassOop((oop)OrderAccess::load_ptr_acquire(obj_at_addr(which))); |
duke@435 | 303 | } |
duke@435 | 304 | |
duke@435 | 305 | // This method should only be used with a cpool lock or during parsing or gc |
duke@435 | 306 | symbolOop unresolved_klass_at(int which) { // Temporary until actual use |
duke@435 | 307 | symbolOop s = symbolOop((oop)OrderAccess::load_ptr_acquire(obj_at_addr(which))); |
duke@435 | 308 | // check that the klass is still unresolved. |
duke@435 | 309 | assert(tag_at(which).is_unresolved_klass(), "Corrupted constant pool"); |
duke@435 | 310 | return s; |
duke@435 | 311 | } |
duke@435 | 312 | |
duke@435 | 313 | // RedefineClasses() API support: |
duke@435 | 314 | symbolOop klass_at_noresolve(int which) { return klass_name_at(which); } |
duke@435 | 315 | |
duke@435 | 316 | jint int_at(int which) { |
duke@435 | 317 | assert(tag_at(which).is_int(), "Corrupted constant pool"); |
duke@435 | 318 | return *int_at_addr(which); |
duke@435 | 319 | } |
duke@435 | 320 | |
duke@435 | 321 | jlong long_at(int which) { |
duke@435 | 322 | assert(tag_at(which).is_long(), "Corrupted constant pool"); |
duke@435 | 323 | // return *long_at_addr(which); |
duke@435 | 324 | u8 tmp = Bytes::get_native_u8((address)&base()[which]); |
duke@435 | 325 | return *((jlong*)&tmp); |
duke@435 | 326 | } |
duke@435 | 327 | |
duke@435 | 328 | jfloat float_at(int which) { |
duke@435 | 329 | assert(tag_at(which).is_float(), "Corrupted constant pool"); |
duke@435 | 330 | return *float_at_addr(which); |
duke@435 | 331 | } |
duke@435 | 332 | |
duke@435 | 333 | jdouble double_at(int which) { |
duke@435 | 334 | assert(tag_at(which).is_double(), "Corrupted constant pool"); |
duke@435 | 335 | u8 tmp = Bytes::get_native_u8((address)&base()[which]); |
duke@435 | 336 | return *((jdouble*)&tmp); |
duke@435 | 337 | } |
duke@435 | 338 | |
duke@435 | 339 | symbolOop symbol_at(int which) { |
duke@435 | 340 | assert(tag_at(which).is_utf8(), "Corrupted constant pool"); |
duke@435 | 341 | return symbolOop(*obj_at_addr(which)); |
duke@435 | 342 | } |
duke@435 | 343 | |
duke@435 | 344 | oop string_at(int which, TRAPS) { |
duke@435 | 345 | constantPoolHandle h_this(THREAD, this); |
duke@435 | 346 | return string_at_impl(h_this, which, CHECK_NULL); |
duke@435 | 347 | } |
duke@435 | 348 | |
twisti@1573 | 349 | oop object_at(int which) { |
twisti@1573 | 350 | assert(tag_at(which).is_object(), "Corrupted constant pool"); |
twisti@1573 | 351 | return *obj_at_addr(which); |
twisti@1573 | 352 | } |
twisti@1573 | 353 | |
jrose@866 | 354 | // A "pseudo-string" is an non-string oop that has found is way into |
jrose@866 | 355 | // a String entry. |
jrose@866 | 356 | // Under AnonymousClasses this can happen if the user patches a live |
jrose@866 | 357 | // object into a CONSTANT_String entry of an anonymous class. |
jrose@866 | 358 | // Method oops internally created for method handles may also |
jrose@866 | 359 | // use pseudo-strings to link themselves to related metaobjects. |
jrose@866 | 360 | |
jrose@866 | 361 | bool is_pseudo_string_at(int which); |
jrose@866 | 362 | |
jrose@866 | 363 | oop pseudo_string_at(int which) { |
jrose@866 | 364 | assert(tag_at(which).is_string(), "Corrupted constant pool"); |
jrose@866 | 365 | return *obj_at_addr(which); |
jrose@866 | 366 | } |
jrose@866 | 367 | |
jrose@866 | 368 | void pseudo_string_at_put(int which, oop x) { |
jrose@866 | 369 | assert(AnonymousClasses, ""); |
jrose@866 | 370 | set_pseudo_string(); // mark header |
jrose@866 | 371 | assert(tag_at(which).is_string() || tag_at(which).is_unresolved_string(), "Corrupted constant pool"); |
jrose@866 | 372 | string_at_put(which, x); // this works just fine |
jrose@866 | 373 | } |
jrose@866 | 374 | |
duke@435 | 375 | // only called when we are sure a string entry is already resolved (via an |
duke@435 | 376 | // earlier string_at call. |
duke@435 | 377 | oop resolved_string_at(int which) { |
duke@435 | 378 | assert(tag_at(which).is_string(), "Corrupted constant pool"); |
duke@435 | 379 | // Must do an acquire here in case another thread resolved the klass |
duke@435 | 380 | // behind our back, lest we later load stale values thru the oop. |
duke@435 | 381 | return (oop)OrderAccess::load_ptr_acquire(obj_at_addr(which)); |
duke@435 | 382 | } |
duke@435 | 383 | |
duke@435 | 384 | // This method should only be used with a cpool lock or during parsing or gc |
duke@435 | 385 | symbolOop unresolved_string_at(int which) { // Temporary until actual use |
duke@435 | 386 | symbolOop s = symbolOop((oop)OrderAccess::load_ptr_acquire(obj_at_addr(which))); |
duke@435 | 387 | // check that the string is still unresolved. |
duke@435 | 388 | assert(tag_at(which).is_unresolved_string(), "Corrupted constant pool"); |
duke@435 | 389 | return s; |
duke@435 | 390 | } |
duke@435 | 391 | |
duke@435 | 392 | // Returns an UTF8 for a CONSTANT_String entry at a given index. |
duke@435 | 393 | // UTF8 char* representation was chosen to avoid conversion of |
duke@435 | 394 | // java_lang_Strings at resolved entries into symbolOops |
duke@435 | 395 | // or vice versa. |
jrose@866 | 396 | // Caller is responsible for checking for pseudo-strings. |
duke@435 | 397 | char* string_at_noresolve(int which); |
duke@435 | 398 | |
duke@435 | 399 | jint name_and_type_at(int which) { |
duke@435 | 400 | assert(tag_at(which).is_name_and_type(), "Corrupted constant pool"); |
duke@435 | 401 | return *int_at_addr(which); |
duke@435 | 402 | } |
duke@435 | 403 | |
jrose@1957 | 404 | int method_handle_ref_kind_at(int which) { |
jrose@1957 | 405 | assert(tag_at(which).is_method_handle(), "Corrupted constant pool"); |
jrose@1957 | 406 | return extract_low_short_from_int(*int_at_addr(which)); // mask out unwanted ref_index bits |
jrose@1957 | 407 | } |
jrose@1957 | 408 | int method_handle_index_at(int which) { |
jrose@1957 | 409 | assert(tag_at(which).is_method_handle(), "Corrupted constant pool"); |
jrose@1957 | 410 | return extract_high_short_from_int(*int_at_addr(which)); // shift out unwanted ref_kind bits |
jrose@1957 | 411 | } |
jrose@1957 | 412 | int method_type_index_at(int which) { |
jrose@1957 | 413 | assert(tag_at(which).is_method_type(), "Corrupted constant pool"); |
jrose@1957 | 414 | return *int_at_addr(which); |
jrose@1957 | 415 | } |
jrose@1957 | 416 | // Derived queries: |
jrose@1957 | 417 | symbolOop method_handle_name_ref_at(int which) { |
jrose@1957 | 418 | int member = method_handle_index_at(which); |
jrose@1957 | 419 | return impl_name_ref_at(member, true); |
jrose@1957 | 420 | } |
jrose@1957 | 421 | symbolOop method_handle_signature_ref_at(int which) { |
jrose@1957 | 422 | int member = method_handle_index_at(which); |
jrose@1957 | 423 | return impl_signature_ref_at(member, true); |
jrose@1957 | 424 | } |
jrose@1957 | 425 | int method_handle_klass_index_at(int which) { |
jrose@1957 | 426 | int member = method_handle_index_at(which); |
jrose@1957 | 427 | return impl_klass_ref_index_at(member, true); |
jrose@1957 | 428 | } |
jrose@1957 | 429 | symbolOop method_type_signature_at(int which) { |
jrose@1957 | 430 | int sym = method_type_index_at(which); |
jrose@1957 | 431 | return symbol_at(sym); |
jrose@1957 | 432 | } |
jrose@2268 | 433 | |
jrose@2353 | 434 | int invoke_dynamic_name_and_type_ref_index_at(int which) { |
jrose@2353 | 435 | assert(tag_at(which).is_invoke_dynamic(), "Corrupted constant pool"); |
jrose@2353 | 436 | return extract_high_short_from_int(*int_at_addr(which)); |
jrose@2268 | 437 | } |
jrose@2353 | 438 | int invoke_dynamic_bootstrap_specifier_index(int which) { |
jrose@2353 | 439 | assert(tag_at(which).value() == JVM_CONSTANT_InvokeDynamic, "Corrupted constant pool"); |
jrose@2353 | 440 | return extract_low_short_from_int(*int_at_addr(which)); |
jrose@2268 | 441 | } |
jrose@2353 | 442 | int invoke_dynamic_operand_base(int which) { |
jrose@2353 | 443 | int bootstrap_specifier_index = invoke_dynamic_bootstrap_specifier_index(which); |
jrose@2353 | 444 | return operand_offset_at(operands(), bootstrap_specifier_index); |
jrose@2268 | 445 | } |
jrose@2353 | 446 | // The first part of the operands array consists of an index into the second part. |
jrose@2353 | 447 | // Extract a 32-bit index value from the first part. |
jrose@2353 | 448 | static int operand_offset_at(typeArrayOop operands, int bootstrap_specifier_index) { |
jrose@2353 | 449 | int n = (bootstrap_specifier_index * 2); |
jrose@2353 | 450 | assert(n >= 0 && n+2 <= operands->length(), "oob"); |
jrose@2353 | 451 | // The first 32-bit index points to the beginning of the second part |
jrose@2353 | 452 | // of the operands array. Make sure this index is in the first part. |
jrose@2353 | 453 | DEBUG_ONLY(int second_part = build_int_from_shorts(operands->short_at(0), |
jrose@2353 | 454 | operands->short_at(1))); |
jrose@2353 | 455 | assert(second_part == 0 || n+2 <= second_part, "oob (2)"); |
jrose@2353 | 456 | int offset = build_int_from_shorts(operands->short_at(n+0), |
jrose@2353 | 457 | operands->short_at(n+1)); |
jrose@2353 | 458 | // The offset itself must point into the second part of the array. |
jrose@2353 | 459 | assert(offset == 0 || offset >= second_part && offset <= operands->length(), "oob (3)"); |
jrose@2353 | 460 | return offset; |
jrose@2268 | 461 | } |
jrose@2353 | 462 | static void operand_offset_at_put(typeArrayOop operands, int bootstrap_specifier_index, int offset) { |
jrose@2353 | 463 | int n = bootstrap_specifier_index * 2; |
jrose@2353 | 464 | assert(n >= 0 && n+2 <= operands->length(), "oob"); |
jrose@2353 | 465 | operands->short_at_put(n+0, extract_low_short_from_int(offset)); |
jrose@2353 | 466 | operands->short_at_put(n+1, extract_high_short_from_int(offset)); |
jrose@2268 | 467 | } |
jrose@2353 | 468 | static int operand_array_length(typeArrayOop operands) { |
jrose@2353 | 469 | if (operands == NULL || operands->length() == 0) return 0; |
jrose@2353 | 470 | int second_part = operand_offset_at(operands, 0); |
jrose@2353 | 471 | return (second_part / 2); |
jrose@2268 | 472 | } |
jrose@2268 | 473 | |
jrose@2353 | 474 | #ifdef ASSERT |
jrose@2353 | 475 | // operand tuples fit together exactly, end to end |
jrose@2353 | 476 | static int operand_limit_at(typeArrayOop operands, int bootstrap_specifier_index) { |
jrose@2353 | 477 | int nextidx = bootstrap_specifier_index + 1; |
jrose@2353 | 478 | if (nextidx == operand_array_length(operands)) |
jrose@2353 | 479 | return operands->length(); |
jrose@2353 | 480 | else |
jrose@2353 | 481 | return operand_offset_at(operands, nextidx); |
jrose@2353 | 482 | } |
jrose@2353 | 483 | int invoke_dynamic_operand_limit(int which) { |
jrose@2353 | 484 | int bootstrap_specifier_index = invoke_dynamic_bootstrap_specifier_index(which); |
jrose@2353 | 485 | return operand_limit_at(operands(), bootstrap_specifier_index); |
jrose@2353 | 486 | } |
jrose@2353 | 487 | #endif //ASSERT |
jrose@2353 | 488 | |
jrose@2353 | 489 | // layout of InvokeDynamic bootstrap method specifier (in second part of operands array): |
jrose@2268 | 490 | enum { |
jrose@2268 | 491 | _indy_bsm_offset = 0, // CONSTANT_MethodHandle bsm |
jrose@2353 | 492 | _indy_argc_offset = 1, // u2 argc |
jrose@2353 | 493 | _indy_argv_offset = 2 // u2 argv[argc] |
jrose@2268 | 494 | }; |
jrose@2015 | 495 | int invoke_dynamic_bootstrap_method_ref_index_at(int which) { |
jrose@2015 | 496 | assert(tag_at(which).is_invoke_dynamic(), "Corrupted constant pool"); |
jrose@2353 | 497 | if (tag_at(which).value() == JVM_CONSTANT_InvokeDynamicTrans) |
jrose@2353 | 498 | return extract_low_short_from_int(*int_at_addr(which)); |
jrose@2353 | 499 | int op_base = invoke_dynamic_operand_base(which); |
jrose@2353 | 500 | return operands()->short_at(op_base + _indy_bsm_offset); |
jrose@2268 | 501 | } |
jrose@2268 | 502 | int invoke_dynamic_argument_count_at(int which) { |
jrose@2268 | 503 | assert(tag_at(which).is_invoke_dynamic(), "Corrupted constant pool"); |
jrose@2353 | 504 | if (tag_at(which).value() == JVM_CONSTANT_InvokeDynamicTrans) |
jrose@2353 | 505 | return 0; |
jrose@2353 | 506 | int op_base = invoke_dynamic_operand_base(which); |
jrose@2353 | 507 | int argc = operands()->short_at(op_base + _indy_argc_offset); |
jrose@2353 | 508 | DEBUG_ONLY(int end_offset = op_base + _indy_argv_offset + argc; |
jrose@2353 | 509 | int next_offset = invoke_dynamic_operand_limit(which)); |
jrose@2353 | 510 | assert(end_offset == next_offset, "matched ending"); |
jrose@2268 | 511 | return argc; |
jrose@2268 | 512 | } |
jrose@2268 | 513 | int invoke_dynamic_argument_index_at(int which, int j) { |
jrose@2353 | 514 | int op_base = invoke_dynamic_operand_base(which); |
jrose@2353 | 515 | DEBUG_ONLY(int argc = operands()->short_at(op_base + _indy_argc_offset)); |
jrose@2353 | 516 | assert((uint)j < (uint)argc, "oob"); |
jrose@2353 | 517 | return operands()->short_at(op_base + _indy_argv_offset + j); |
jrose@2015 | 518 | } |
jrose@1957 | 519 | |
jrose@1161 | 520 | // The following methods (name/signature/klass_ref_at, klass_ref_at_noresolve, |
jrose@1494 | 521 | // name_and_type_ref_index_at) all expect to be passed indices obtained |
jrose@2265 | 522 | // directly from the bytecode. |
jrose@1494 | 523 | // If the indices are meant to refer to fields or methods, they are |
jrose@2265 | 524 | // actually rewritten constant pool cache indices. |
jrose@1494 | 525 | // The routine remap_instruction_operand_from_cache manages the adjustment |
jrose@1494 | 526 | // of these values back to constant pool indices. |
jrose@1161 | 527 | |
jrose@1494 | 528 | // There are also "uncached" versions which do not adjust the operand index; see below. |
duke@435 | 529 | |
jrose@2265 | 530 | // FIXME: Consider renaming these with a prefix "cached_" to make the distinction clear. |
jrose@2265 | 531 | // In a few cases (the verifier) there are uses before a cpcache has been built, |
jrose@2265 | 532 | // which are handled by a dynamic check in remap_instruction_operand_from_cache. |
jrose@2265 | 533 | // FIXME: Remove the dynamic check, and adjust all callers to specify the correct mode. |
jrose@2265 | 534 | |
duke@435 | 535 | // Lookup for entries consisting of (klass_index, name_and_type index) |
duke@435 | 536 | klassOop klass_ref_at(int which, TRAPS); |
duke@435 | 537 | symbolOop klass_ref_at_noresolve(int which); |
jrose@1161 | 538 | symbolOop name_ref_at(int which) { return impl_name_ref_at(which, false); } |
jrose@1161 | 539 | symbolOop signature_ref_at(int which) { return impl_signature_ref_at(which, false); } |
duke@435 | 540 | |
jrose@1161 | 541 | int klass_ref_index_at(int which) { return impl_klass_ref_index_at(which, false); } |
jrose@1161 | 542 | int name_and_type_ref_index_at(int which) { return impl_name_and_type_ref_index_at(which, false); } |
duke@435 | 543 | |
duke@435 | 544 | // Lookup for entries consisting of (name_index, signature_index) |
jrose@1161 | 545 | int name_ref_index_at(int which_nt); // == low-order jshort of name_and_type_at(which_nt) |
jrose@1161 | 546 | int signature_ref_index_at(int which_nt); // == high-order jshort of name_and_type_at(which_nt) |
duke@435 | 547 | |
duke@435 | 548 | BasicType basic_type_for_signature_at(int which); |
duke@435 | 549 | |
duke@435 | 550 | // Resolve string constants (to prevent allocation during compilation) |
duke@435 | 551 | void resolve_string_constants(TRAPS) { |
duke@435 | 552 | constantPoolHandle h_this(THREAD, this); |
duke@435 | 553 | resolve_string_constants_impl(h_this, CHECK); |
duke@435 | 554 | } |
duke@435 | 555 | |
jrose@2268 | 556 | private: |
jrose@2268 | 557 | enum { _no_index_sentinel = -1, _possible_index_sentinel = -2 }; |
jrose@2268 | 558 | public: |
jrose@2268 | 559 | |
jrose@1957 | 560 | // Resolve late bound constants. |
jrose@1957 | 561 | oop resolve_constant_at(int index, TRAPS) { |
jrose@1957 | 562 | constantPoolHandle h_this(THREAD, this); |
jrose@2268 | 563 | return resolve_constant_at_impl(h_this, index, _no_index_sentinel, THREAD); |
jrose@1957 | 564 | } |
jrose@1957 | 565 | |
jrose@1957 | 566 | oop resolve_cached_constant_at(int cache_index, TRAPS) { |
jrose@1957 | 567 | constantPoolHandle h_this(THREAD, this); |
jrose@2268 | 568 | return resolve_constant_at_impl(h_this, _no_index_sentinel, cache_index, THREAD); |
jrose@2268 | 569 | } |
jrose@2268 | 570 | |
jrose@2268 | 571 | oop resolve_possibly_cached_constant_at(int pool_index, TRAPS) { |
jrose@2268 | 572 | constantPoolHandle h_this(THREAD, this); |
jrose@2268 | 573 | return resolve_constant_at_impl(h_this, pool_index, _possible_index_sentinel, THREAD); |
jrose@1957 | 574 | } |
jrose@1957 | 575 | |
duke@435 | 576 | // Klass name matches name at offset |
duke@435 | 577 | bool klass_name_at_matches(instanceKlassHandle k, int which); |
duke@435 | 578 | |
duke@435 | 579 | // Sizing |
coleenp@548 | 580 | int length() const { return _length; } |
coleenp@548 | 581 | void set_length(int length) { _length = length; } |
coleenp@548 | 582 | |
coleenp@548 | 583 | // Tells whether index is within bounds. |
coleenp@548 | 584 | bool is_within_bounds(int index) const { |
coleenp@548 | 585 | return 0 <= index && index < length(); |
coleenp@548 | 586 | } |
coleenp@548 | 587 | |
duke@435 | 588 | static int header_size() { return sizeof(constantPoolOopDesc)/HeapWordSize; } |
duke@435 | 589 | static int object_size(int length) { return align_object_size(header_size() + length); } |
duke@435 | 590 | int object_size() { return object_size(length()); } |
duke@435 | 591 | |
jmasa@953 | 592 | bool is_conc_safe() { return _is_conc_safe; } |
jmasa@953 | 593 | void set_is_conc_safe(bool v) { _is_conc_safe = v; } |
jmasa@953 | 594 | |
duke@435 | 595 | friend class constantPoolKlass; |
duke@435 | 596 | friend class ClassFileParser; |
duke@435 | 597 | friend class SystemDictionary; |
duke@435 | 598 | |
duke@435 | 599 | // Used by compiler to prevent classloading. |
duke@435 | 600 | static klassOop klass_at_if_loaded (constantPoolHandle this_oop, int which); |
duke@435 | 601 | static klassOop klass_ref_at_if_loaded (constantPoolHandle this_oop, int which); |
duke@435 | 602 | // Same as above - but does LinkResolving. |
duke@435 | 603 | static klassOop klass_ref_at_if_loaded_check(constantPoolHandle this_oop, int which, TRAPS); |
duke@435 | 604 | |
duke@435 | 605 | // Routines currently used for annotations (only called by jvm.cpp) but which might be used in the |
jrose@2265 | 606 | // future by other Java code. These take constant pool indices rather than |
duke@435 | 607 | // constant pool cache indices as do the peer methods above. |
jrose@1957 | 608 | symbolOop uncached_klass_ref_at_noresolve(int which); |
jrose@1161 | 609 | symbolOop uncached_name_ref_at(int which) { return impl_name_ref_at(which, true); } |
jrose@1161 | 610 | symbolOop uncached_signature_ref_at(int which) { return impl_signature_ref_at(which, true); } |
jrose@1161 | 611 | int uncached_klass_ref_index_at(int which) { return impl_klass_ref_index_at(which, true); } |
jrose@1161 | 612 | int uncached_name_and_type_ref_index_at(int which) { return impl_name_and_type_ref_index_at(which, true); } |
duke@435 | 613 | |
duke@435 | 614 | // Sharing |
duke@435 | 615 | int pre_resolve_shared_klasses(TRAPS); |
duke@435 | 616 | void shared_symbols_iterate(OopClosure* closure0); |
duke@435 | 617 | void shared_tags_iterate(OopClosure* closure0); |
duke@435 | 618 | void shared_strings_iterate(OopClosure* closure0); |
duke@435 | 619 | |
duke@435 | 620 | // Debugging |
duke@435 | 621 | const char* printable_name_at(int which) PRODUCT_RETURN0; |
duke@435 | 622 | |
jrose@1920 | 623 | #ifdef ASSERT |
jrose@1920 | 624 | enum { CPCACHE_INDEX_TAG = 0x10000 }; // helps keep CP cache indices distinct from CP indices |
jrose@1957 | 625 | #else |
jrose@1957 | 626 | enum { CPCACHE_INDEX_TAG = 0 }; // in product mode, this zero value is a no-op |
jrose@1920 | 627 | #endif //ASSERT |
jrose@1920 | 628 | |
duke@435 | 629 | private: |
duke@435 | 630 | |
jrose@1161 | 631 | symbolOop impl_name_ref_at(int which, bool uncached); |
jrose@1161 | 632 | symbolOop impl_signature_ref_at(int which, bool uncached); |
jrose@1161 | 633 | int impl_klass_ref_index_at(int which, bool uncached); |
jrose@1161 | 634 | int impl_name_and_type_ref_index_at(int which, bool uncached); |
jrose@1161 | 635 | |
jrose@1920 | 636 | int remap_instruction_operand_from_cache(int operand); // operand must be biased by CPCACHE_INDEX_TAG |
duke@435 | 637 | |
duke@435 | 638 | // Used while constructing constant pool (only by ClassFileParser) |
duke@435 | 639 | jint klass_index_at(int which) { |
duke@435 | 640 | assert(tag_at(which).is_klass_index(), "Corrupted constant pool"); |
duke@435 | 641 | return *int_at_addr(which); |
duke@435 | 642 | } |
duke@435 | 643 | |
duke@435 | 644 | jint string_index_at(int which) { |
duke@435 | 645 | assert(tag_at(which).is_string_index(), "Corrupted constant pool"); |
duke@435 | 646 | return *int_at_addr(which); |
duke@435 | 647 | } |
duke@435 | 648 | |
duke@435 | 649 | // Performs the LinkResolver checks |
duke@435 | 650 | static void verify_constant_pool_resolve(constantPoolHandle this_oop, KlassHandle klass, TRAPS); |
duke@435 | 651 | |
duke@435 | 652 | // Implementation of methods that needs an exposed 'this' pointer, in order to |
duke@435 | 653 | // handle GC while executing the method |
duke@435 | 654 | static klassOop klass_at_impl(constantPoolHandle this_oop, int which, TRAPS); |
duke@435 | 655 | static oop string_at_impl(constantPoolHandle this_oop, int which, TRAPS); |
duke@435 | 656 | |
duke@435 | 657 | // Resolve string constants (to prevent allocation during compilation) |
duke@435 | 658 | static void resolve_string_constants_impl(constantPoolHandle this_oop, TRAPS); |
duke@435 | 659 | |
jrose@1957 | 660 | static oop resolve_constant_at_impl(constantPoolHandle this_oop, int index, int cache_index, TRAPS); |
jrose@1957 | 661 | |
duke@435 | 662 | public: |
duke@435 | 663 | // Merging constantPoolOop support: |
duke@435 | 664 | bool compare_entry_to(int index1, constantPoolHandle cp2, int index2, TRAPS); |
jrose@2353 | 665 | void copy_cp_to(int start_i, int end_i, constantPoolHandle to_cp, int to_i, TRAPS) { |
jrose@2353 | 666 | constantPoolHandle h_this(THREAD, this); |
jrose@2353 | 667 | copy_cp_to_impl(h_this, start_i, end_i, to_cp, to_i, THREAD); |
jrose@2353 | 668 | } |
jrose@2353 | 669 | static void copy_cp_to_impl(constantPoolHandle from_cp, int start_i, int end_i, constantPoolHandle to_cp, int to_i, TRAPS); |
jrose@2353 | 670 | static void copy_entry_to(constantPoolHandle from_cp, int from_i, constantPoolHandle to_cp, int to_i, TRAPS); |
duke@435 | 671 | int find_matching_entry(int pattern_i, constantPoolHandle search_cp, TRAPS); |
duke@435 | 672 | int orig_length() const { return _orig_length; } |
duke@435 | 673 | void set_orig_length(int orig_length) { _orig_length = orig_length; } |
duke@435 | 674 | |
duke@435 | 675 | |
duke@435 | 676 | // JVMTI accesss - GetConstantPool, RetransformClasses, ... |
duke@435 | 677 | friend class JvmtiConstantPoolReconstituter; |
duke@435 | 678 | |
duke@435 | 679 | private: |
duke@435 | 680 | jint cpool_entry_size(jint idx); |
duke@435 | 681 | jint hash_entries_to(SymbolHashMap *symmap, SymbolHashMap *classmap); |
duke@435 | 682 | |
duke@435 | 683 | // Copy cpool bytes into byte array. |
duke@435 | 684 | // Returns: |
duke@435 | 685 | // int > 0, count of the raw cpool bytes that have been copied |
duke@435 | 686 | // 0, OutOfMemory error |
duke@435 | 687 | // -1, Internal error |
duke@435 | 688 | int copy_cpool_bytes(int cpool_size, |
duke@435 | 689 | SymbolHashMap* tbl, |
duke@435 | 690 | unsigned char *bytes); |
duke@435 | 691 | }; |
duke@435 | 692 | |
duke@435 | 693 | class SymbolHashMapEntry : public CHeapObj { |
duke@435 | 694 | private: |
duke@435 | 695 | unsigned int _hash; // 32-bit hash for item |
duke@435 | 696 | SymbolHashMapEntry* _next; // Next element in the linked list for this bucket |
duke@435 | 697 | symbolOop _symbol; // 1-st part of the mapping: symbol => value |
duke@435 | 698 | u2 _value; // 2-nd part of the mapping: symbol => value |
duke@435 | 699 | |
duke@435 | 700 | public: |
duke@435 | 701 | unsigned int hash() const { return _hash; } |
duke@435 | 702 | void set_hash(unsigned int hash) { _hash = hash; } |
duke@435 | 703 | |
duke@435 | 704 | SymbolHashMapEntry* next() const { return _next; } |
duke@435 | 705 | void set_next(SymbolHashMapEntry* next) { _next = next; } |
duke@435 | 706 | |
duke@435 | 707 | symbolOop symbol() const { return _symbol; } |
duke@435 | 708 | void set_symbol(symbolOop sym) { _symbol = sym; } |
duke@435 | 709 | |
duke@435 | 710 | u2 value() const { return _value; } |
duke@435 | 711 | void set_value(u2 value) { _value = value; } |
duke@435 | 712 | |
duke@435 | 713 | SymbolHashMapEntry(unsigned int hash, symbolOop symbol, u2 value) |
duke@435 | 714 | : _hash(hash), _symbol(symbol), _value(value), _next(NULL) {} |
duke@435 | 715 | |
duke@435 | 716 | }; // End SymbolHashMapEntry class |
duke@435 | 717 | |
duke@435 | 718 | |
duke@435 | 719 | class SymbolHashMapBucket : public CHeapObj { |
duke@435 | 720 | |
duke@435 | 721 | private: |
duke@435 | 722 | SymbolHashMapEntry* _entry; |
duke@435 | 723 | |
duke@435 | 724 | public: |
duke@435 | 725 | SymbolHashMapEntry* entry() const { return _entry; } |
duke@435 | 726 | void set_entry(SymbolHashMapEntry* entry) { _entry = entry; } |
duke@435 | 727 | void clear() { _entry = NULL; } |
duke@435 | 728 | |
duke@435 | 729 | }; // End SymbolHashMapBucket class |
duke@435 | 730 | |
duke@435 | 731 | |
duke@435 | 732 | class SymbolHashMap: public CHeapObj { |
duke@435 | 733 | |
duke@435 | 734 | private: |
duke@435 | 735 | // Default number of entries in the table |
duke@435 | 736 | enum SymbolHashMap_Constants { |
duke@435 | 737 | _Def_HashMap_Size = 256 |
duke@435 | 738 | }; |
duke@435 | 739 | |
duke@435 | 740 | int _table_size; |
duke@435 | 741 | SymbolHashMapBucket* _buckets; |
duke@435 | 742 | |
duke@435 | 743 | void initialize_table(int table_size) { |
duke@435 | 744 | _table_size = table_size; |
duke@435 | 745 | _buckets = NEW_C_HEAP_ARRAY(SymbolHashMapBucket, table_size); |
duke@435 | 746 | for (int index = 0; index < table_size; index++) { |
duke@435 | 747 | _buckets[index].clear(); |
duke@435 | 748 | } |
duke@435 | 749 | } |
duke@435 | 750 | |
duke@435 | 751 | public: |
duke@435 | 752 | |
duke@435 | 753 | int table_size() const { return _table_size; } |
duke@435 | 754 | |
duke@435 | 755 | SymbolHashMap() { initialize_table(_Def_HashMap_Size); } |
duke@435 | 756 | SymbolHashMap(int table_size) { initialize_table(table_size); } |
duke@435 | 757 | |
duke@435 | 758 | // hash P(31) from Kernighan & Ritchie |
duke@435 | 759 | static unsigned int compute_hash(const char* str, int len) { |
duke@435 | 760 | unsigned int hash = 0; |
duke@435 | 761 | while (len-- > 0) { |
duke@435 | 762 | hash = 31*hash + (unsigned) *str; |
duke@435 | 763 | str++; |
duke@435 | 764 | } |
duke@435 | 765 | return hash; |
duke@435 | 766 | } |
duke@435 | 767 | |
duke@435 | 768 | SymbolHashMapEntry* bucket(int i) { |
duke@435 | 769 | return _buckets[i].entry(); |
duke@435 | 770 | } |
duke@435 | 771 | |
duke@435 | 772 | void add_entry(symbolOop sym, u2 value); |
duke@435 | 773 | SymbolHashMapEntry* find_entry(symbolOop sym); |
duke@435 | 774 | |
duke@435 | 775 | u2 symbol_to_value(symbolOop sym) { |
duke@435 | 776 | SymbolHashMapEntry *entry = find_entry(sym); |
duke@435 | 777 | return (entry == NULL) ? 0 : entry->value(); |
duke@435 | 778 | } |
duke@435 | 779 | |
duke@435 | 780 | ~SymbolHashMap() { |
duke@435 | 781 | SymbolHashMapEntry* next; |
duke@435 | 782 | for (int i = 0; i < _table_size; i++) { |
duke@435 | 783 | for (SymbolHashMapEntry* cur = bucket(i); cur != NULL; cur = next) { |
duke@435 | 784 | next = cur->next(); |
duke@435 | 785 | delete(cur); |
duke@435 | 786 | } |
duke@435 | 787 | } |
duke@435 | 788 | delete _buckets; |
duke@435 | 789 | } |
duke@435 | 790 | }; // End SymbolHashMap class |
stefank@2314 | 791 | |
stefank@2314 | 792 | #endif // SHARE_VM_OOPS_CONSTANTPOOLOOP_HPP |