Mercurial > hg > graal-compiler
annotate src/share/vm/oops/constantPoolOop.hpp @ 431:a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
Summary: low-level privileged sun.misc.Unsafe.defineAnonymousClass
Reviewed-by: kvn
| author | jrose |
|---|---|
| date | Wed, 12 Nov 2008 22:33:26 -0800 |
| parents | d1605aabd0a1 |
| children | 0af8b0718fc9 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 196 | 2 * Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved. |
| 0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 * | |
| 5 * This code is free software; you can redistribute it and/or modify it | |
| 6 * under the terms of the GNU General Public License version 2 only, as | |
| 7 * published by the Free Software Foundation. | |
| 8 * | |
| 9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
| 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 12 * version 2 for more details (a copy is included in the LICENSE file that | |
| 13 * accompanied this code). | |
| 14 * | |
| 15 * You should have received a copy of the GNU General Public License version | |
| 16 * 2 along with this work; if not, write to the Free Software Foundation, | |
| 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
| 18 * | |
| 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
| 20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
| 21 * have any questions. | |
| 22 * | |
| 23 */ | |
| 24 | |
| 25 // A constantPool is an array containing class constants as described in the | |
| 26 // class file. | |
| 27 // | |
| 28 // Most of the constant pool entries are written during class parsing, which | |
| 29 // is safe. For klass and string types, the constant pool entry is | |
| 30 // modified when the entry is resolved. If a klass or string constant pool | |
| 31 // entry is read without a lock, only the resolved state guarantees that | |
| 32 // the entry in the constant pool is a klass or String object and | |
| 33 // not a symbolOop. | |
| 34 | |
| 35 class SymbolHashMap; | |
| 36 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
37 class constantPoolOopDesc : public oopDesc { |
| 0 | 38 friend class VMStructs; |
| 39 friend class BytecodeInterpreter; // Directly extracts an oop in the pool for fast instanceof/checkcast | |
| 40 private: | |
| 41 typeArrayOop _tags; // the tag array describing the constant pool's contents | |
| 42 constantPoolCacheOop _cache; // the cache holding interpreter runtime information | |
| 43 klassOop _pool_holder; // the corresponding class | |
|
431
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
44 int _flags; // a few header bits to describe contents for GC |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
45 int _length; // number of elements in the array |
| 0 | 46 // only set to non-zero if constant pool is merged by RedefineClasses |
| 47 int _orig_length; | |
| 48 | |
| 49 void set_tags(typeArrayOop tags) { oop_store_without_check((oop*)&_tags, tags); } | |
| 50 void tag_at_put(int which, jbyte t) { tags()->byte_at_put(which, t); } | |
| 51 void release_tag_at_put(int which, jbyte t) { tags()->release_byte_at_put(which, t); } | |
| 52 | |
|
431
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
53 enum FlagBit { |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
54 FB_has_pseudo_string = 2 |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
55 }; |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
56 |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
57 int flags() const { return _flags; } |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
58 void set_flags(int f) { _flags = f; } |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
59 bool flag_at(FlagBit fb) const { return (_flags & (1 << (int)fb)) != 0; } |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
60 void set_flag_at(FlagBit fb); |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
61 // no clear_flag_at function; they only increase |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
62 |
| 0 | 63 private: |
| 64 intptr_t* base() const { return (intptr_t*) (((char*) this) + sizeof(constantPoolOopDesc)); } | |
| 65 oop* tags_addr() { return (oop*)&_tags; } | |
| 66 oop* cache_addr() { return (oop*)&_cache; } | |
| 67 | |
| 68 oop* obj_at_addr(int which) const { | |
| 69 assert(is_within_bounds(which), "index out of bounds"); | |
| 70 return (oop*) &base()[which]; | |
| 71 } | |
| 72 | |
| 73 jint* int_at_addr(int which) const { | |
| 74 assert(is_within_bounds(which), "index out of bounds"); | |
| 75 return (jint*) &base()[which]; | |
| 76 } | |
| 77 | |
| 78 jlong* long_at_addr(int which) const { | |
| 79 assert(is_within_bounds(which), "index out of bounds"); | |
| 80 return (jlong*) &base()[which]; | |
| 81 } | |
| 82 | |
| 83 jfloat* float_at_addr(int which) const { | |
| 84 assert(is_within_bounds(which), "index out of bounds"); | |
| 85 return (jfloat*) &base()[which]; | |
| 86 } | |
| 87 | |
| 88 jdouble* double_at_addr(int which) const { | |
| 89 assert(is_within_bounds(which), "index out of bounds"); | |
| 90 return (jdouble*) &base()[which]; | |
| 91 } | |
| 92 | |
| 93 public: | |
| 94 typeArrayOop tags() const { return _tags; } | |
| 95 | |
|
431
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
96 bool has_pseudo_string() const { return flag_at(FB_has_pseudo_string); } |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
97 void set_pseudo_string() { set_flag_at(FB_has_pseudo_string); } |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
98 |
| 0 | 99 // Klass holding pool |
| 100 klassOop pool_holder() const { return _pool_holder; } | |
| 101 void set_pool_holder(klassOop k) { oop_store_without_check((oop*)&_pool_holder, (oop) k); } | |
| 102 oop* pool_holder_addr() { return (oop*)&_pool_holder; } | |
| 103 | |
| 104 // Interpreter runtime support | |
| 105 constantPoolCacheOop cache() const { return _cache; } | |
| 106 void set_cache(constantPoolCacheOop cache){ oop_store((oop*)&_cache, cache); } | |
| 107 | |
| 108 // Assembly code support | |
| 109 static int tags_offset_in_bytes() { return offset_of(constantPoolOopDesc, _tags); } | |
| 110 static int cache_offset_in_bytes() { return offset_of(constantPoolOopDesc, _cache); } | |
| 111 static int pool_holder_offset_in_bytes() { return offset_of(constantPoolOopDesc, _pool_holder); } | |
| 112 | |
| 113 // Storing constants | |
| 114 | |
| 115 void klass_at_put(int which, klassOop k) { | |
| 116 oop_store_without_check((volatile oop *)obj_at_addr(which), oop(k)); | |
| 117 // The interpreter assumes when the tag is stored, the klass is resolved | |
| 118 // and the klassOop is a klass rather than a symbolOop, so we need | |
| 119 // hardware store ordering here. | |
| 120 release_tag_at_put(which, JVM_CONSTANT_Class); | |
| 121 if (UseConcMarkSweepGC) { | |
| 122 // In case the earlier card-mark was consumed by a concurrent | |
| 123 // marking thread before the tag was updated, redirty the card. | |
| 124 oop_store_without_check((volatile oop *)obj_at_addr(which), oop(k)); | |
| 125 } | |
| 126 } | |
| 127 | |
| 128 // For temporary use while constructing constant pool | |
| 129 void klass_index_at_put(int which, int name_index) { | |
| 130 tag_at_put(which, JVM_CONSTANT_ClassIndex); | |
| 131 *int_at_addr(which) = name_index; | |
| 132 } | |
| 133 | |
| 134 // Temporary until actual use | |
| 135 void unresolved_klass_at_put(int which, symbolOop s) { | |
| 136 // Overwrite the old index with a GC friendly value so | |
| 137 // that if GC looks during the transition it won't try | |
| 138 // to treat a small integer as oop. | |
| 139 *obj_at_addr(which) = NULL; | |
| 140 release_tag_at_put(which, JVM_CONSTANT_UnresolvedClass); | |
| 141 oop_store_without_check(obj_at_addr(which), oop(s)); | |
| 142 } | |
| 143 | |
| 144 // Temporary until actual use | |
| 145 void unresolved_string_at_put(int which, symbolOop s) { | |
| 146 *obj_at_addr(which) = NULL; | |
| 147 release_tag_at_put(which, JVM_CONSTANT_UnresolvedString); | |
| 148 oop_store_without_check(obj_at_addr(which), oop(s)); | |
| 149 } | |
| 150 | |
| 151 void int_at_put(int which, jint i) { | |
| 152 tag_at_put(which, JVM_CONSTANT_Integer); | |
| 153 *int_at_addr(which) = i; | |
| 154 } | |
| 155 | |
| 156 void long_at_put(int which, jlong l) { | |
| 157 tag_at_put(which, JVM_CONSTANT_Long); | |
| 158 // *long_at_addr(which) = l; | |
| 159 Bytes::put_native_u8((address)long_at_addr(which), *((u8*) &l)); | |
| 160 } | |
| 161 | |
| 162 void float_at_put(int which, jfloat f) { | |
| 163 tag_at_put(which, JVM_CONSTANT_Float); | |
| 164 *float_at_addr(which) = f; | |
| 165 } | |
| 166 | |
| 167 void double_at_put(int which, jdouble d) { | |
| 168 tag_at_put(which, JVM_CONSTANT_Double); | |
| 169 // *double_at_addr(which) = d; | |
| 170 // u8 temp = *(u8*) &d; | |
| 171 Bytes::put_native_u8((address) double_at_addr(which), *((u8*) &d)); | |
| 172 } | |
| 173 | |
| 174 void symbol_at_put(int which, symbolOop s) { | |
| 175 tag_at_put(which, JVM_CONSTANT_Utf8); | |
| 176 oop_store_without_check(obj_at_addr(which), oop(s)); | |
| 177 } | |
| 178 | |
| 179 void string_at_put(int which, oop str) { | |
| 180 oop_store((volatile oop*)obj_at_addr(which), str); | |
| 181 release_tag_at_put(which, JVM_CONSTANT_String); | |
| 182 if (UseConcMarkSweepGC) { | |
| 183 // In case the earlier card-mark was consumed by a concurrent | |
| 184 // marking thread before the tag was updated, redirty the card. | |
| 185 oop_store_without_check((volatile oop *)obj_at_addr(which), str); | |
| 186 } | |
| 187 } | |
| 188 | |
| 189 // For temporary use while constructing constant pool | |
| 190 void string_index_at_put(int which, int string_index) { | |
| 191 tag_at_put(which, JVM_CONSTANT_StringIndex); | |
| 192 *int_at_addr(which) = string_index; | |
| 193 } | |
| 194 | |
| 195 void field_at_put(int which, int class_index, int name_and_type_index) { | |
| 196 tag_at_put(which, JVM_CONSTANT_Fieldref); | |
| 197 *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index; | |
| 198 } | |
| 199 | |
| 200 void method_at_put(int which, int class_index, int name_and_type_index) { | |
| 201 tag_at_put(which, JVM_CONSTANT_Methodref); | |
| 202 *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index; | |
| 203 } | |
| 204 | |
| 205 void interface_method_at_put(int which, int class_index, int name_and_type_index) { | |
| 206 tag_at_put(which, JVM_CONSTANT_InterfaceMethodref); | |
| 207 *int_at_addr(which) = ((jint) name_and_type_index<<16) | class_index; // Not so nice | |
| 208 } | |
| 209 | |
| 210 void name_and_type_at_put(int which, int name_index, int signature_index) { | |
| 211 tag_at_put(which, JVM_CONSTANT_NameAndType); | |
| 212 *int_at_addr(which) = ((jint) signature_index<<16) | name_index; // Not so nice | |
| 213 } | |
| 214 | |
| 215 // Tag query | |
| 216 | |
| 217 constantTag tag_at(int which) const { return (constantTag)tags()->byte_at_acquire(which); } | |
| 218 | |
| 219 // Whether the entry is a pointer that must be GC'd. | |
| 220 bool is_pointer_entry(int which) { | |
| 221 constantTag tag = tag_at(which); | |
| 222 return tag.is_klass() || | |
| 223 tag.is_unresolved_klass() || | |
| 224 tag.is_symbol() || | |
| 225 tag.is_unresolved_string() || | |
| 226 tag.is_string(); | |
| 227 } | |
| 228 | |
| 229 // Fetching constants | |
| 230 | |
| 231 klassOop klass_at(int which, TRAPS) { | |
| 232 constantPoolHandle h_this(THREAD, this); | |
| 233 return klass_at_impl(h_this, which, CHECK_NULL); | |
| 234 } | |
| 235 | |
| 236 symbolOop klass_name_at(int which); // Returns the name, w/o resolving. | |
| 237 | |
| 238 klassOop resolved_klass_at(int which) { // Used by Compiler | |
| 239 guarantee(tag_at(which).is_klass(), "Corrupted constant pool"); | |
| 240 // Must do an acquire here in case another thread resolved the klass | |
| 241 // behind our back, lest we later load stale values thru the oop. | |
| 242 return klassOop((oop)OrderAccess::load_ptr_acquire(obj_at_addr(which))); | |
| 243 } | |
| 244 | |
| 245 // This method should only be used with a cpool lock or during parsing or gc | |
| 246 symbolOop unresolved_klass_at(int which) { // Temporary until actual use | |
| 247 symbolOop s = symbolOop((oop)OrderAccess::load_ptr_acquire(obj_at_addr(which))); | |
| 248 // check that the klass is still unresolved. | |
| 249 assert(tag_at(which).is_unresolved_klass(), "Corrupted constant pool"); | |
| 250 return s; | |
| 251 } | |
| 252 | |
| 253 // RedefineClasses() API support: | |
| 254 symbolOop klass_at_noresolve(int which) { return klass_name_at(which); } | |
| 255 | |
| 256 jint int_at(int which) { | |
| 257 assert(tag_at(which).is_int(), "Corrupted constant pool"); | |
| 258 return *int_at_addr(which); | |
| 259 } | |
| 260 | |
| 261 jlong long_at(int which) { | |
| 262 assert(tag_at(which).is_long(), "Corrupted constant pool"); | |
| 263 // return *long_at_addr(which); | |
| 264 u8 tmp = Bytes::get_native_u8((address)&base()[which]); | |
| 265 return *((jlong*)&tmp); | |
| 266 } | |
| 267 | |
| 268 jfloat float_at(int which) { | |
| 269 assert(tag_at(which).is_float(), "Corrupted constant pool"); | |
| 270 return *float_at_addr(which); | |
| 271 } | |
| 272 | |
| 273 jdouble double_at(int which) { | |
| 274 assert(tag_at(which).is_double(), "Corrupted constant pool"); | |
| 275 u8 tmp = Bytes::get_native_u8((address)&base()[which]); | |
| 276 return *((jdouble*)&tmp); | |
| 277 } | |
| 278 | |
| 279 symbolOop symbol_at(int which) { | |
| 280 assert(tag_at(which).is_utf8(), "Corrupted constant pool"); | |
| 281 return symbolOop(*obj_at_addr(which)); | |
| 282 } | |
| 283 | |
| 284 oop string_at(int which, TRAPS) { | |
| 285 constantPoolHandle h_this(THREAD, this); | |
| 286 return string_at_impl(h_this, which, CHECK_NULL); | |
| 287 } | |
| 288 | |
|
431
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
289 // A "pseudo-string" is an non-string oop that has found is way into |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
290 // a String entry. |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
291 // Under AnonymousClasses this can happen if the user patches a live |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
292 // object into a CONSTANT_String entry of an anonymous class. |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
293 // Method oops internally created for method handles may also |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
294 // use pseudo-strings to link themselves to related metaobjects. |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
295 |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
296 bool is_pseudo_string_at(int which); |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
297 |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
298 oop pseudo_string_at(int which) { |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
299 assert(tag_at(which).is_string(), "Corrupted constant pool"); |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
300 return *obj_at_addr(which); |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
301 } |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
302 |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
303 void pseudo_string_at_put(int which, oop x) { |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
304 assert(AnonymousClasses, ""); |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
305 set_pseudo_string(); // mark header |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
306 assert(tag_at(which).is_string() || tag_at(which).is_unresolved_string(), "Corrupted constant pool"); |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
307 string_at_put(which, x); // this works just fine |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
308 } |
|
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
309 |
| 0 | 310 // only called when we are sure a string entry is already resolved (via an |
| 311 // earlier string_at call. | |
| 312 oop resolved_string_at(int which) { | |
| 313 assert(tag_at(which).is_string(), "Corrupted constant pool"); | |
| 314 // Must do an acquire here in case another thread resolved the klass | |
| 315 // behind our back, lest we later load stale values thru the oop. | |
| 316 return (oop)OrderAccess::load_ptr_acquire(obj_at_addr(which)); | |
| 317 } | |
| 318 | |
| 319 // This method should only be used with a cpool lock or during parsing or gc | |
| 320 symbolOop unresolved_string_at(int which) { // Temporary until actual use | |
| 321 symbolOop s = symbolOop((oop)OrderAccess::load_ptr_acquire(obj_at_addr(which))); | |
| 322 // check that the string is still unresolved. | |
| 323 assert(tag_at(which).is_unresolved_string(), "Corrupted constant pool"); | |
| 324 return s; | |
| 325 } | |
| 326 | |
| 327 // Returns an UTF8 for a CONSTANT_String entry at a given index. | |
| 328 // UTF8 char* representation was chosen to avoid conversion of | |
| 329 // java_lang_Strings at resolved entries into symbolOops | |
| 330 // or vice versa. | |
|
431
a45484ea312d
6653858: dynamic languages need to be able to load anonymous classes
jrose
parents:
196
diff
changeset
|
331 // Caller is responsible for checking for pseudo-strings. |
| 0 | 332 char* string_at_noresolve(int which); |
| 333 | |
| 334 jint name_and_type_at(int which) { | |
| 335 assert(tag_at(which).is_name_and_type(), "Corrupted constant pool"); | |
| 336 return *int_at_addr(which); | |
| 337 } | |
| 338 | |
| 339 // The following methods (klass_ref_at, klass_ref_at_noresolve, name_ref_at, | |
| 340 // signature_ref_at, klass_ref_index_at, name_and_type_ref_index_at, | |
| 341 // name_ref_index_at, signature_ref_index_at) all expect constant pool indices | |
| 342 // from the bytecodes to be passed in, which are actually potentially byte-swapped | |
| 343 // contstant pool cache indices. See field_or_method_at. | |
| 344 | |
| 345 // Lookup for entries consisting of (klass_index, name_and_type index) | |
| 346 klassOop klass_ref_at(int which, TRAPS); | |
| 347 symbolOop klass_ref_at_noresolve(int which); | |
| 348 symbolOop name_ref_at(int which); | |
| 349 symbolOop signature_ref_at(int which); // the type descriptor | |
| 350 | |
| 351 int klass_ref_index_at(int which); | |
| 352 int name_and_type_ref_index_at(int which); | |
| 353 | |
| 354 // Lookup for entries consisting of (name_index, signature_index) | |
| 355 int name_ref_index_at(int which); | |
| 356 int signature_ref_index_at(int which); | |
| 357 | |
| 358 BasicType basic_type_for_signature_at(int which); | |
| 359 | |
| 360 // Resolve string constants (to prevent allocation during compilation) | |
| 361 void resolve_string_constants(TRAPS) { | |
| 362 constantPoolHandle h_this(THREAD, this); | |
| 363 resolve_string_constants_impl(h_this, CHECK); | |
| 364 } | |
| 365 | |
| 366 // Klass name matches name at offset | |
| 367 bool klass_name_at_matches(instanceKlassHandle k, int which); | |
| 368 | |
| 369 // Sizing | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
370 int length() const { return _length; } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
371 void set_length(int length) { _length = length; } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
372 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
373 // Tells whether index is within bounds. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
374 bool is_within_bounds(int index) const { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
375 return 0 <= index && index < length(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
376 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
0
diff
changeset
|
377 |
| 0 | 378 static int header_size() { return sizeof(constantPoolOopDesc)/HeapWordSize; } |
| 379 static int object_size(int length) { return align_object_size(header_size() + length); } | |
| 380 int object_size() { return object_size(length()); } | |
| 381 | |
| 382 friend class constantPoolKlass; | |
| 383 friend class ClassFileParser; | |
| 384 friend class SystemDictionary; | |
| 385 | |
| 386 // Used by compiler to prevent classloading. | |
| 387 static klassOop klass_at_if_loaded (constantPoolHandle this_oop, int which); | |
| 388 static klassOop klass_ref_at_if_loaded (constantPoolHandle this_oop, int which); | |
| 389 // Same as above - but does LinkResolving. | |
| 390 static klassOop klass_ref_at_if_loaded_check(constantPoolHandle this_oop, int which, TRAPS); | |
| 391 | |
| 392 // Routines currently used for annotations (only called by jvm.cpp) but which might be used in the | |
| 393 // future by other Java code. These take constant pool indices rather than possibly-byte-swapped | |
| 394 // constant pool cache indices as do the peer methods above. | |
| 395 symbolOop uncached_name_ref_at(int which); | |
| 396 symbolOop uncached_signature_ref_at(int which); | |
| 397 int uncached_klass_ref_index_at(int which); | |
| 398 int uncached_name_and_type_ref_index_at(int which); | |
| 399 | |
| 400 // Sharing | |
| 401 int pre_resolve_shared_klasses(TRAPS); | |
| 402 void shared_symbols_iterate(OopClosure* closure0); | |
| 403 void shared_tags_iterate(OopClosure* closure0); | |
| 404 void shared_strings_iterate(OopClosure* closure0); | |
| 405 | |
| 406 // Debugging | |
| 407 const char* printable_name_at(int which) PRODUCT_RETURN0; | |
| 408 | |
| 409 private: | |
| 410 | |
| 411 // Takes either a constant pool cache index in possibly byte-swapped | |
| 412 // byte order (which comes from the bytecodes after rewriting) or, | |
| 413 // if "uncached" is true, a vanilla constant pool index | |
| 414 jint field_or_method_at(int which, bool uncached) { | |
| 415 int i = -1; | |
| 416 if (uncached || cache() == NULL) { | |
| 417 i = which; | |
| 418 } else { | |
| 419 // change byte-ordering and go via cache | |
| 420 i = cache()->entry_at(Bytes::swap_u2(which))->constant_pool_index(); | |
| 421 } | |
| 422 assert(tag_at(i).is_field_or_method(), "Corrupted constant pool"); | |
| 423 return *int_at_addr(i); | |
| 424 } | |
| 425 | |
| 426 // Used while constructing constant pool (only by ClassFileParser) | |
| 427 jint klass_index_at(int which) { | |
| 428 assert(tag_at(which).is_klass_index(), "Corrupted constant pool"); | |
| 429 return *int_at_addr(which); | |
| 430 } | |
| 431 | |
| 432 jint string_index_at(int which) { | |
| 433 assert(tag_at(which).is_string_index(), "Corrupted constant pool"); | |
| 434 return *int_at_addr(which); | |
| 435 } | |
| 436 | |
| 437 // Performs the LinkResolver checks | |
| 438 static void verify_constant_pool_resolve(constantPoolHandle this_oop, KlassHandle klass, TRAPS); | |
| 439 | |
| 440 // Implementation of methods that needs an exposed 'this' pointer, in order to | |
| 441 // handle GC while executing the method | |
| 442 static klassOop klass_at_impl(constantPoolHandle this_oop, int which, TRAPS); | |
| 443 static oop string_at_impl(constantPoolHandle this_oop, int which, TRAPS); | |
| 444 | |
| 445 // Resolve string constants (to prevent allocation during compilation) | |
| 446 static void resolve_string_constants_impl(constantPoolHandle this_oop, TRAPS); | |
| 447 | |
| 448 public: | |
| 449 // Merging constantPoolOop support: | |
| 450 bool compare_entry_to(int index1, constantPoolHandle cp2, int index2, TRAPS); | |
| 451 void copy_cp_to(int start_i, int end_i, constantPoolHandle to_cp, int to_i, | |
| 452 TRAPS); | |
| 453 void copy_entry_to(int from_i, constantPoolHandle to_cp, int to_i, TRAPS); | |
| 454 int find_matching_entry(int pattern_i, constantPoolHandle search_cp, TRAPS); | |
| 455 int orig_length() const { return _orig_length; } | |
| 456 void set_orig_length(int orig_length) { _orig_length = orig_length; } | |
| 457 | |
| 458 | |
| 459 // JVMTI accesss - GetConstantPool, RetransformClasses, ... | |
| 460 friend class JvmtiConstantPoolReconstituter; | |
| 461 | |
| 462 private: | |
| 463 jint cpool_entry_size(jint idx); | |
| 464 jint hash_entries_to(SymbolHashMap *symmap, SymbolHashMap *classmap); | |
| 465 | |
| 466 // Copy cpool bytes into byte array. | |
| 467 // Returns: | |
| 468 // int > 0, count of the raw cpool bytes that have been copied | |
| 469 // 0, OutOfMemory error | |
| 470 // -1, Internal error | |
| 471 int copy_cpool_bytes(int cpool_size, | |
| 472 SymbolHashMap* tbl, | |
| 473 unsigned char *bytes); | |
| 474 }; | |
| 475 | |
| 476 class SymbolHashMapEntry : public CHeapObj { | |
| 477 private: | |
| 478 unsigned int _hash; // 32-bit hash for item | |
| 479 SymbolHashMapEntry* _next; // Next element in the linked list for this bucket | |
| 480 symbolOop _symbol; // 1-st part of the mapping: symbol => value | |
| 481 u2 _value; // 2-nd part of the mapping: symbol => value | |
| 482 | |
| 483 public: | |
| 484 unsigned int hash() const { return _hash; } | |
| 485 void set_hash(unsigned int hash) { _hash = hash; } | |
| 486 | |
| 487 SymbolHashMapEntry* next() const { return _next; } | |
| 488 void set_next(SymbolHashMapEntry* next) { _next = next; } | |
| 489 | |
| 490 symbolOop symbol() const { return _symbol; } | |
| 491 void set_symbol(symbolOop sym) { _symbol = sym; } | |
| 492 | |
| 493 u2 value() const { return _value; } | |
| 494 void set_value(u2 value) { _value = value; } | |
| 495 | |
| 496 SymbolHashMapEntry(unsigned int hash, symbolOop symbol, u2 value) | |
| 497 : _hash(hash), _symbol(symbol), _value(value), _next(NULL) {} | |
| 498 | |
| 499 }; // End SymbolHashMapEntry class | |
| 500 | |
| 501 | |
| 502 class SymbolHashMapBucket : public CHeapObj { | |
| 503 | |
| 504 private: | |
| 505 SymbolHashMapEntry* _entry; | |
| 506 | |
| 507 public: | |
| 508 SymbolHashMapEntry* entry() const { return _entry; } | |
| 509 void set_entry(SymbolHashMapEntry* entry) { _entry = entry; } | |
| 510 void clear() { _entry = NULL; } | |
| 511 | |
| 512 }; // End SymbolHashMapBucket class | |
| 513 | |
| 514 | |
| 515 class SymbolHashMap: public CHeapObj { | |
| 516 | |
| 517 private: | |
| 518 // Default number of entries in the table | |
| 519 enum SymbolHashMap_Constants { | |
| 520 _Def_HashMap_Size = 256 | |
| 521 }; | |
| 522 | |
| 523 int _table_size; | |
| 524 SymbolHashMapBucket* _buckets; | |
| 525 | |
| 526 void initialize_table(int table_size) { | |
| 527 _table_size = table_size; | |
| 528 _buckets = NEW_C_HEAP_ARRAY(SymbolHashMapBucket, table_size); | |
| 529 for (int index = 0; index < table_size; index++) { | |
| 530 _buckets[index].clear(); | |
| 531 } | |
| 532 } | |
| 533 | |
| 534 public: | |
| 535 | |
| 536 int table_size() const { return _table_size; } | |
| 537 | |
| 538 SymbolHashMap() { initialize_table(_Def_HashMap_Size); } | |
| 539 SymbolHashMap(int table_size) { initialize_table(table_size); } | |
| 540 | |
| 541 // hash P(31) from Kernighan & Ritchie | |
| 542 static unsigned int compute_hash(const char* str, int len) { | |
| 543 unsigned int hash = 0; | |
| 544 while (len-- > 0) { | |
| 545 hash = 31*hash + (unsigned) *str; | |
| 546 str++; | |
| 547 } | |
| 548 return hash; | |
| 549 } | |
| 550 | |
| 551 SymbolHashMapEntry* bucket(int i) { | |
| 552 return _buckets[i].entry(); | |
| 553 } | |
| 554 | |
| 555 void add_entry(symbolOop sym, u2 value); | |
| 556 SymbolHashMapEntry* find_entry(symbolOop sym); | |
| 557 | |
| 558 u2 symbol_to_value(symbolOop sym) { | |
| 559 SymbolHashMapEntry *entry = find_entry(sym); | |
| 560 return (entry == NULL) ? 0 : entry->value(); | |
| 561 } | |
| 562 | |
| 563 ~SymbolHashMap() { | |
| 564 SymbolHashMapEntry* next; | |
| 565 for (int i = 0; i < _table_size; i++) { | |
| 566 for (SymbolHashMapEntry* cur = bucket(i); cur != NULL; cur = next) { | |
| 567 next = cur->next(); | |
| 568 delete(cur); | |
| 569 } | |
| 570 } | |
| 571 delete _buckets; | |
| 572 } | |
| 573 }; // End SymbolHashMap class |