annotate src/share/vm/oops/constantPool.cpp @ 4848:51af5fae397d

8015265: revise the fix for 8007037 Reviewed-by: sspitsyn, dholmes, dcubed
author ccheung
date Fri, 24 May 2013 17:19:56 -0700
parents c115fac239eb
children a1ebd310d5c1
rev   line source
duke@0 1 /*
coleenp@4108 2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
trims@1472 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1472 20 * or visit www.oracle.com if you need additional information or have any
trims@1472 21 * questions.
duke@0 22 *
duke@0 23 */
duke@0 24
stefank@1885 25 #include "precompiled.hpp"
coleenp@3656 26 #include "classfile/classLoaderData.hpp"
stefank@1885 27 #include "classfile/javaClasses.hpp"
coleenp@4132 28 #include "classfile/metadataOnStackMark.hpp"
stefank@1885 29 #include "classfile/symbolTable.hpp"
stefank@1885 30 #include "classfile/systemDictionary.hpp"
stefank@1885 31 #include "classfile/vmSymbols.hpp"
stefank@1885 32 #include "interpreter/linkResolver.hpp"
acorn@4139 33 #include "memory/heapInspection.hpp"
coleenp@3656 34 #include "memory/metadataFactory.hpp"
stefank@1885 35 #include "memory/oopFactory.hpp"
coleenp@3656 36 #include "oops/constantPool.hpp"
stefank@1885 37 #include "oops/instanceKlass.hpp"
stefank@1885 38 #include "oops/objArrayKlass.hpp"
stefank@1885 39 #include "runtime/fieldType.hpp"
stefank@1885 40 #include "runtime/init.hpp"
coleenp@3656 41 #include "runtime/javaCalls.hpp"
stefank@1885 42 #include "runtime/signature.hpp"
iklam@4645 43 #include "runtime/synchronizer.hpp"
stefank@1885 44 #include "runtime/vframe.hpp"
duke@0 45
coleenp@3656 46 ConstantPool* ConstantPool::allocate(ClassLoaderData* loader_data, int length, TRAPS) {
coleenp@3656 47 // Tags are RW but comment below applies to tags also.
coleenp@3656 48 Array<u1>* tags = MetadataFactory::new_writeable_array<u1>(loader_data, length, 0, CHECK_NULL);
coleenp@3656 49
coleenp@3656 50 int size = ConstantPool::size(length);
coleenp@3656 51
coleenp@3656 52 // CDS considerations:
coleenp@3656 53 // Allocate read-write but may be able to move to read-only at dumping time
coleenp@3656 54 // if all the klasses are resolved. The only other field that is writable is
coleenp@3656 55 // the resolved_references array, which is recreated at startup time.
coleenp@3656 56 // But that could be moved to InstanceKlass (although a pain to access from
coleenp@3656 57 // assembly code). Maybe it could be moved to the cpCache which is RW.
coleenp@3656 58 return new (loader_data, size, false, THREAD) ConstantPool(tags);
coleenp@3656 59 }
coleenp@3656 60
coleenp@3656 61 ConstantPool::ConstantPool(Array<u1>* tags) {
coleenp@3656 62 set_length(tags->length());
coleenp@3656 63 set_tags(NULL);
coleenp@3656 64 set_cache(NULL);
coleenp@3656 65 set_reference_map(NULL);
coleenp@3656 66 set_resolved_references(NULL);
coleenp@3656 67 set_operands(NULL);
coleenp@3656 68 set_pool_holder(NULL);
coleenp@3656 69 set_flags(0);
coleenp@4132 70
coleenp@3656 71 // only set to non-zero if constant pool is merged by RedefineClasses
coleenp@4108 72 set_version(0);
coleenp@3656 73
coleenp@3656 74 // initialize tag array
coleenp@3656 75 int length = tags->length();
coleenp@3656 76 for (int index = 0; index < length; index++) {
coleenp@3656 77 tags->at_put(index, JVM_CONSTANT_Invalid);
coleenp@3656 78 }
coleenp@3656 79 set_tags(tags);
coleenp@3656 80 }
coleenp@3656 81
coleenp@3656 82 void ConstantPool::deallocate_contents(ClassLoaderData* loader_data) {
coleenp@3656 83 MetadataFactory::free_metadata(loader_data, cache());
coleenp@3656 84 set_cache(NULL);
coleenp@3656 85 MetadataFactory::free_array<jushort>(loader_data, operands());
coleenp@3656 86 set_operands(NULL);
coleenp@3656 87
coleenp@3656 88 release_C_heap_structures();
coleenp@3656 89
coleenp@3656 90 // free tag array
coleenp@3656 91 MetadataFactory::free_array<u1>(loader_data, tags());
coleenp@3656 92 set_tags(NULL);
coleenp@3656 93 }
coleenp@3656 94
coleenp@3656 95 void ConstantPool::release_C_heap_structures() {
coleenp@3656 96 // walk constant pool and decrement symbol reference counts
coleenp@3656 97 unreference_symbols();
coleenp@3656 98 }
coleenp@3656 99
coleenp@3656 100 objArrayOop ConstantPool::resolved_references() const {
coleenp@3656 101 return (objArrayOop)JNIHandles::resolve(_resolved_references);
coleenp@3656 102 }
coleenp@3656 103
coleenp@3656 104 // Create resolved_references array and mapping array for original cp indexes
coleenp@3656 105 // The ldc bytecode was rewritten to have the resolved reference array index so need a way
coleenp@3656 106 // to map it back for resolving and some unlikely miscellaneous uses.
coleenp@3656 107 // The objects created by invokedynamic are appended to this list.
coleenp@3656 108 void ConstantPool::initialize_resolved_references(ClassLoaderData* loader_data,
coleenp@3656 109 intStack reference_map,
coleenp@3656 110 int constant_pool_map_length,
coleenp@3656 111 TRAPS) {
coleenp@3656 112 // Initialized the resolved object cache.
coleenp@3656 113 int map_length = reference_map.length();
coleenp@3656 114 if (map_length > 0) {
coleenp@3656 115 // Only need mapping back to constant pool entries. The map isn't used for
coleenp@3656 116 // invokedynamic resolved_reference entries. The constant pool cache index
coleenp@3656 117 // has the mapping back to both the constant pool and to the resolved
coleenp@3656 118 // reference index.
coleenp@3656 119 if (constant_pool_map_length > 0) {
coleenp@3656 120 Array<u2>* om = MetadataFactory::new_array<u2>(loader_data, map_length, CHECK);
coleenp@3656 121
coleenp@3656 122 for (int i = 0; i < constant_pool_map_length; i++) {
coleenp@3656 123 int x = reference_map.at(i);
coleenp@3656 124 assert(x == (int)(jushort) x, "klass index is too big");
coleenp@3656 125 om->at_put(i, (jushort)x);
coleenp@3656 126 }
coleenp@3656 127 set_reference_map(om);
coleenp@3656 128 }
coleenp@3656 129
coleenp@3656 130 // Create Java array for holding resolved strings, methodHandles,
coleenp@3656 131 // methodTypes, invokedynamic and invokehandle appendix objects, etc.
coleenp@3656 132 objArrayOop stom = oopFactory::new_objArray(SystemDictionary::Object_klass(), map_length, CHECK);
coleenp@3656 133 Handle refs_handle (THREAD, (oop)stom); // must handleize.
coleenp@3656 134 set_resolved_references(loader_data->add_handle(refs_handle));
coleenp@3656 135 }
coleenp@3656 136 }
coleenp@3656 137
coleenp@3656 138 // CDS support. Create a new resolved_references array.
coleenp@3656 139 void ConstantPool::restore_unshareable_info(TRAPS) {
coleenp@3664 140
coleenp@3664 141 // restore the C++ vtable from the shared archive
coleenp@3664 142 restore_vtable();
coleenp@3664 143
coleenp@3656 144 if (SystemDictionary::Object_klass_loaded()) {
coleenp@3656 145 // Recreate the object array and add to ClassLoaderData.
coleenp@3656 146 int map_length = resolved_reference_length();
coleenp@3656 147 if (map_length > 0) {
coleenp@3656 148 objArrayOop stom = oopFactory::new_objArray(SystemDictionary::Object_klass(), map_length, CHECK);
coleenp@3656 149 Handle refs_handle (THREAD, (oop)stom); // must handleize.
coleenp@3656 150
coleenp@3656 151 ClassLoaderData* loader_data = pool_holder()->class_loader_data();
coleenp@3656 152 set_resolved_references(loader_data->add_handle(refs_handle));
coleenp@3656 153 }
coleenp@3656 154 }
coleenp@3656 155 }
coleenp@3656 156
coleenp@3656 157 void ConstantPool::remove_unshareable_info() {
coleenp@3656 158 // Resolved references are not in the shared archive.
coleenp@3656 159 // Save the length for restoration. It is not necessarily the same length
coleenp@3656 160 // as reference_map.length() if invokedynamic is saved.
coleenp@3656 161 set_resolved_reference_length(
coleenp@3656 162 resolved_references() != NULL ? resolved_references()->length() : 0);
coleenp@3656 163 set_resolved_references(NULL);
iklam@4645 164 }
iklam@4645 165
iklam@4645 166 oop ConstantPool::lock() {
iklam@4645 167 if (_pool_holder) {
iklam@4645 168 // We re-use the _pool_holder's init_lock to reduce footprint.
iklam@4645 169 // Notes on deadlocks:
iklam@4645 170 // [1] This lock is a Java oop, so it can be recursively locked by
iklam@4645 171 // the same thread without self-deadlocks.
iklam@4645 172 // [2] Deadlock will happen if there is circular dependency between
iklam@4645 173 // the <clinit> of two Java classes. However, in this case,
iklam@4645 174 // the deadlock would have happened long before we reach
iklam@4645 175 // ConstantPool::lock(), so reusing init_lock does not
iklam@4645 176 // increase the possibility of deadlock.
iklam@4645 177 return _pool_holder->init_lock();
iklam@4645 178 } else {
iklam@4645 179 return NULL;
iklam@4645 180 }
coleenp@3656 181 }
coleenp@3656 182
coleenp@3656 183 int ConstantPool::cp_to_object_index(int cp_index) {
coleenp@3656 184 // this is harder don't do this so much.
coleenp@3656 185 for (int i = 0; i< reference_map()->length(); i++) {
coleenp@3656 186 if (reference_map()->at(i) == cp_index) return i;
coleenp@3656 187 // Zero entry is divider between constant pool indices for strings,
coleenp@3656 188 // method handles and method types. After that the index is a constant
coleenp@3656 189 // pool cache index for invokedynamic. Stop when zero (which can never
coleenp@3656 190 // be a constant pool index)
coleenp@3656 191 if (reference_map()->at(i) == 0) break;
coleenp@3656 192 }
coleenp@3656 193 // We might not find the index.
coleenp@3656 194 return _no_index_sentinel;
coleenp@3656 195 }
coleenp@3656 196
coleenp@3656 197 Klass* ConstantPool::klass_at_impl(constantPoolHandle this_oop, int which, TRAPS) {
coleenp@3656 198 // A resolved constantPool entry will contain a Klass*, otherwise a Symbol*.
duke@0 199 // It is not safe to rely on the tag bit's here, since we don't have a lock, and the entry and
duke@0 200 // tag is not updated atomicly.
coleenp@3656 201
coleenp@2069 202 CPSlot entry = this_oop->slot_at(which);
coleenp@3656 203 if (entry.is_resolved()) {
coleenp@3656 204 assert(entry.get_klass()->is_klass(), "must be");
duke@0 205 // Already resolved - return entry.
coleenp@3656 206 return entry.get_klass();
duke@0 207 }
duke@0 208
duke@0 209 // Acquire lock on constant oop while doing update. After we get the lock, we check if another object
duke@0 210 // already has updated the object
duke@0 211 assert(THREAD->is_Java_thread(), "must be a Java thread");
duke@0 212 bool do_resolve = false;
duke@0 213 bool in_error = false;
duke@0 214
coleenp@3656 215 // Create a handle for the mirror. This will preserve the resolved class
coleenp@3656 216 // until the loader_data is registered.
coleenp@3656 217 Handle mirror_handle;
coleenp@3656 218
coleenp@2069 219 Symbol* name = NULL;
duke@0 220 Handle loader;
iklam@4645 221 {
iklam@4645 222 oop cplock = this_oop->lock();
iklam@4645 223 ObjectLocker ol(cplock , THREAD, cplock != NULL);
duke@0 224
duke@0 225 if (this_oop->tag_at(which).is_unresolved_klass()) {
duke@0 226 if (this_oop->tag_at(which).is_unresolved_klass_in_error()) {
duke@0 227 in_error = true;
duke@0 228 } else {
duke@0 229 do_resolve = true;
coleenp@2069 230 name = this_oop->unresolved_klass_at(which);
coleenp@3880 231 loader = Handle(THREAD, this_oop->pool_holder()->class_loader());
duke@0 232 }
duke@0 233 }
duke@0 234 } // unlocking constantPool
duke@0 235
duke@0 236
duke@0 237 // The original attempt to resolve this constant pool entry failed so find the
duke@0 238 // original error and throw it again (JVMS 5.4.3).
duke@0 239 if (in_error) {
coleenp@2069 240 Symbol* error = SystemDictionary::find_resolution_error(this_oop, which);
coleenp@2069 241 guarantee(error != (Symbol*)NULL, "tag mismatch with resolution error table");
duke@0 242 ResourceMark rm;
duke@0 243 // exception text will be the class name
duke@0 244 const char* className = this_oop->unresolved_klass_at(which)->as_C_string();
duke@0 245 THROW_MSG_0(error, className);
duke@0 246 }
duke@0 247
duke@0 248 if (do_resolve) {
duke@0 249 // this_oop must be unlocked during resolve_or_fail
coleenp@3880 250 oop protection_domain = this_oop->pool_holder()->protection_domain();
duke@0 251 Handle h_prot (THREAD, protection_domain);
coleenp@3656 252 Klass* k_oop = SystemDictionary::resolve_or_fail(name, loader, h_prot, true, THREAD);
duke@0 253 KlassHandle k;
duke@0 254 if (!HAS_PENDING_EXCEPTION) {
duke@0 255 k = KlassHandle(THREAD, k_oop);
coleenp@3656 256 // preserve the resolved klass.
coleenp@3656 257 mirror_handle = Handle(THREAD, k_oop->java_mirror());
duke@0 258 // Do access check for klasses
duke@0 259 verify_constant_pool_resolve(this_oop, k, THREAD);
duke@0 260 }
duke@0 261
duke@0 262 // Failed to resolve class. We must record the errors so that subsequent attempts
duke@0 263 // to resolve this constant pool entry fail with the same error (JVMS 5.4.3).
duke@0 264 if (HAS_PENDING_EXCEPTION) {
duke@0 265 ResourceMark rm;
coleenp@3656 266 Symbol* error = PENDING_EXCEPTION->klass()->name();
duke@0 267
duke@0 268 bool throw_orig_error = false;
duke@0 269 {
iklam@4645 270 oop cplock = this_oop->lock();
iklam@4645 271 ObjectLocker ol(cplock, THREAD, cplock != NULL);
duke@0 272
duke@0 273 // some other thread has beaten us and has resolved the class.
duke@0 274 if (this_oop->tag_at(which).is_klass()) {
duke@0 275 CLEAR_PENDING_EXCEPTION;
duke@0 276 entry = this_oop->resolved_klass_at(which);
coleenp@3656 277 return entry.get_klass();
duke@0 278 }
duke@0 279
duke@0 280 if (!PENDING_EXCEPTION->
never@1142 281 is_a(SystemDictionary::LinkageError_klass())) {
duke@0 282 // Just throw the exception and don't prevent these classes from
duke@0 283 // being loaded due to virtual machine errors like StackOverflow
duke@0 284 // and OutOfMemoryError, etc, or if the thread was hit by stop()
duke@0 285 // Needs clarification to section 5.4.3 of the VM spec (see 6308271)
duke@0 286 }
duke@0 287 else if (!this_oop->tag_at(which).is_unresolved_klass_in_error()) {
duke@0 288 SystemDictionary::add_resolution_error(this_oop, which, error);
duke@0 289 this_oop->tag_at_put(which, JVM_CONSTANT_UnresolvedClassInError);
duke@0 290 } else {
duke@0 291 // some other thread has put the class in error state.
coleenp@2069 292 error = SystemDictionary::find_resolution_error(this_oop, which);
coleenp@2069 293 assert(error != NULL, "checking");
duke@0 294 throw_orig_error = true;
duke@0 295 }
duke@0 296 } // unlocked
duke@0 297
duke@0 298 if (throw_orig_error) {
duke@0 299 CLEAR_PENDING_EXCEPTION;
duke@0 300 ResourceMark rm;
duke@0 301 const char* className = this_oop->unresolved_klass_at(which)->as_C_string();
duke@0 302 THROW_MSG_0(error, className);
duke@0 303 }
duke@0 304
duke@0 305 return 0;
duke@0 306 }
duke@0 307
coleenp@3656 308 if (TraceClassResolution && !k()->oop_is_array()) {
duke@0 309 // skip resolving the constant pool so that this code get's
duke@0 310 // called the next time some bytecodes refer to this class.
duke@0 311 ResourceMark rm;
duke@0 312 int line_number = -1;
duke@0 313 const char * source_file = NULL;
duke@0 314 if (JavaThread::current()->has_last_Java_frame()) {
duke@0 315 // try to identify the method which called this function.
duke@0 316 vframeStream vfst(JavaThread::current());
duke@0 317 if (!vfst.at_end()) {
duke@0 318 line_number = vfst.method()->line_number_from_bci(vfst.bci());
coleenp@3880 319 Symbol* s = vfst.method()->method_holder()->source_file_name();
duke@0 320 if (s != NULL) {
duke@0 321 source_file = s->as_C_string();
duke@0 322 }
duke@0 323 }
duke@0 324 }
duke@0 325 if (k() != this_oop->pool_holder()) {
duke@0 326 // only print something if the classes are different
duke@0 327 if (source_file != NULL) {
duke@0 328 tty->print("RESOLVE %s %s %s:%d\n",
coleenp@3880 329 this_oop->pool_holder()->external_name(),
coleenp@3656 330 InstanceKlass::cast(k())->external_name(), source_file, line_number);
duke@0 331 } else {
duke@0 332 tty->print("RESOLVE %s %s\n",
coleenp@3880 333 this_oop->pool_holder()->external_name(),
coleenp@3656 334 InstanceKlass::cast(k())->external_name());
duke@0 335 }
duke@0 336 }
duke@0 337 return k();
duke@0 338 } else {
iklam@4645 339 oop cplock = this_oop->lock();
iklam@4645 340 ObjectLocker ol(cplock, THREAD, cplock != NULL);
duke@0 341 // Only updated constant pool - if it is resolved.
duke@0 342 do_resolve = this_oop->tag_at(which).is_unresolved_klass();
duke@0 343 if (do_resolve) {
coleenp@3880 344 ClassLoaderData* this_key = this_oop->pool_holder()->class_loader_data();
coleenp@3936 345 this_key->record_dependency(k(), CHECK_NULL); // Can throw OOM
duke@0 346 this_oop->klass_at_put(which, k());
duke@0 347 }
duke@0 348 }
duke@0 349 }
duke@0 350
duke@0 351 entry = this_oop->resolved_klass_at(which);
coleenp@3656 352 assert(entry.is_resolved() && entry.get_klass()->is_klass(), "must be resolved at this point");
coleenp@3656 353 return entry.get_klass();
duke@0 354 }
duke@0 355
duke@0 356
coleenp@3656 357 // Does not update ConstantPool* - to avoid any exception throwing. Used
duke@0 358 // by compiler and exception handling. Also used to avoid classloads for
duke@0 359 // instanceof operations. Returns NULL if the class has not been loaded or
duke@0 360 // if the verification of constant pool failed
coleenp@3656 361 Klass* ConstantPool::klass_at_if_loaded(constantPoolHandle this_oop, int which) {
coleenp@2069 362 CPSlot entry = this_oop->slot_at(which);
coleenp@3656 363 if (entry.is_resolved()) {
coleenp@3656 364 assert(entry.get_klass()->is_klass(), "must be");
coleenp@3656 365 return entry.get_klass();
duke@0 366 } else {
coleenp@3656 367 assert(entry.is_unresolved(), "must be either symbol or klass");
duke@0 368 Thread *thread = Thread::current();
coleenp@2069 369 Symbol* name = entry.get_symbol();
coleenp@3880 370 oop loader = this_oop->pool_holder()->class_loader();
coleenp@3880 371 oop protection_domain = this_oop->pool_holder()->protection_domain();
duke@0 372 Handle h_prot (thread, protection_domain);
duke@0 373 Handle h_loader (thread, loader);
coleenp@3656 374 Klass* k = SystemDictionary::find(name, h_loader, h_prot, thread);
duke@0 375
duke@0 376 if (k != NULL) {
duke@0 377 // Make sure that resolving is legal
duke@0 378 EXCEPTION_MARK;
duke@0 379 KlassHandle klass(THREAD, k);
duke@0 380 // return NULL if verification fails
duke@0 381 verify_constant_pool_resolve(this_oop, klass, THREAD);
duke@0 382 if (HAS_PENDING_EXCEPTION) {
duke@0 383 CLEAR_PENDING_EXCEPTION;
duke@0 384 return NULL;
duke@0 385 }
duke@0 386 return klass();
duke@0 387 } else {
duke@0 388 return k;
duke@0 389 }
duke@0 390 }
duke@0 391 }
duke@0 392
duke@0 393
coleenp@3656 394 Klass* ConstantPool::klass_ref_at_if_loaded(constantPoolHandle this_oop, int which) {
duke@0 395 return klass_at_if_loaded(this_oop, this_oop->klass_ref_index_at(which));
duke@0 396 }
duke@0 397
duke@0 398
duke@0 399 // This is an interface for the compiler that allows accessing non-resolved entries
duke@0 400 // in the constant pool - but still performs the validations tests. Must be used
duke@0 401 // in a pre-parse of the compiler - to determine what it can do and not do.
duke@0 402 // Note: We cannot update the ConstantPool from the vm_thread.
coleenp@3656 403 Klass* ConstantPool::klass_ref_at_if_loaded_check(constantPoolHandle this_oop, int index, TRAPS) {
duke@0 404 int which = this_oop->klass_ref_index_at(index);
coleenp@2069 405 CPSlot entry = this_oop->slot_at(which);
coleenp@3656 406 if (entry.is_resolved()) {
coleenp@3656 407 assert(entry.get_klass()->is_klass(), "must be");
coleenp@3656 408 return entry.get_klass();
duke@0 409 } else {
coleenp@3656 410 assert(entry.is_unresolved(), "must be either symbol or klass");
coleenp@2069 411 Symbol* name = entry.get_symbol();
coleenp@3880 412 oop loader = this_oop->pool_holder()->class_loader();
coleenp@3880 413 oop protection_domain = this_oop->pool_holder()->protection_domain();
duke@0 414 Handle h_loader(THREAD, loader);
duke@0 415 Handle h_prot (THREAD, protection_domain);
duke@0 416 KlassHandle k(THREAD, SystemDictionary::find(name, h_loader, h_prot, THREAD));
duke@0 417
duke@0 418 // Do access check for klasses
duke@0 419 if( k.not_null() ) verify_constant_pool_resolve(this_oop, k, CHECK_NULL);
duke@0 420 return k();
duke@0 421 }
duke@0 422 }
duke@0 423
duke@0 424
coleenp@3656 425 Method* ConstantPool::method_at_if_loaded(constantPoolHandle cpool,
twisti@3582 426 int which) {
brutisso@3067 427 if (cpool->cache() == NULL) return NULL; // nothing to load yet
coleenp@3656 428 int cache_index = decode_cpcache_index(which, true);
jrose@2557 429 if (!(cache_index >= 0 && cache_index < cpool->cache()->length())) {
coleenp@3656 430 // FIXME: should be an assert
jrose@2557 431 if (PrintMiscellaneous && (Verbose||WizardMode)) {
twisti@3582 432 tty->print_cr("bad operand %d in:", which); cpool->print();
jrose@2557 433 }
jrose@2557 434 return NULL;
jrose@2557 435 }
jrose@2557 436 ConstantPoolCacheEntry* e = cpool->cache()->entry_at(cache_index);
twisti@3582 437 return e->method_if_resolved(cpool);
twisti@3582 438 }
twisti@3582 439
twisti@3582 440
coleenp@3656 441 bool ConstantPool::has_appendix_at_if_loaded(constantPoolHandle cpool, int which) {
twisti@3582 442 if (cpool->cache() == NULL) return false; // nothing to load yet
coleenp@3656 443 int cache_index = decode_cpcache_index(which, true);
coleenp@3656 444 ConstantPoolCacheEntry* e = cpool->cache()->entry_at(cache_index);
twisti@3582 445 return e->has_appendix();
twisti@3582 446 }
twisti@3582 447
coleenp@3656 448 oop ConstantPool::appendix_at_if_loaded(constantPoolHandle cpool, int which) {
twisti@3582 449 if (cpool->cache() == NULL) return NULL; // nothing to load yet
coleenp@3656 450 int cache_index = decode_cpcache_index(which, true);
coleenp@3656 451 ConstantPoolCacheEntry* e = cpool->cache()->entry_at(cache_index);
coleenp@3656 452 return e->appendix_if_resolved(cpool);
jrose@2557 453 }
jrose@2557 454
jrose@2557 455
twisti@3753 456 bool ConstantPool::has_method_type_at_if_loaded(constantPoolHandle cpool, int which) {
twisti@3753 457 if (cpool->cache() == NULL) return false; // nothing to load yet
twisti@3753 458 int cache_index = decode_cpcache_index(which, true);
twisti@3753 459 ConstantPoolCacheEntry* e = cpool->cache()->entry_at(cache_index);
twisti@3753 460 return e->has_method_type();
twisti@3753 461 }
twisti@3753 462
twisti@3753 463 oop ConstantPool::method_type_at_if_loaded(constantPoolHandle cpool, int which) {
twisti@3753 464 if (cpool->cache() == NULL) return NULL; // nothing to load yet
twisti@3753 465 int cache_index = decode_cpcache_index(which, true);
twisti@3753 466 ConstantPoolCacheEntry* e = cpool->cache()->entry_at(cache_index);
twisti@3753 467 return e->method_type_if_resolved(cpool);
twisti@3753 468 }
twisti@3753 469
twisti@3753 470
coleenp@3656 471 Symbol* ConstantPool::impl_name_ref_at(int which, bool uncached) {
jrose@726 472 int name_index = name_ref_index_at(impl_name_and_type_ref_index_at(which, uncached));
duke@0 473 return symbol_at(name_index);
duke@0 474 }
duke@0 475
duke@0 476
coleenp@3656 477 Symbol* ConstantPool::impl_signature_ref_at(int which, bool uncached) {
jrose@726 478 int signature_index = signature_ref_index_at(impl_name_and_type_ref_index_at(which, uncached));
duke@0 479 return symbol_at(signature_index);
duke@0 480 }
duke@0 481
duke@0 482
coleenp@3656 483 int ConstantPool::impl_name_and_type_ref_index_at(int which, bool uncached) {
jrose@1059 484 int i = which;
jrose@1059 485 if (!uncached && cache() != NULL) {
coleenp@3656 486 if (ConstantPool::is_invokedynamic_index(which)) {
coleenp@3656 487 // Invokedynamic index is index into resolved_references
coleenp@3656 488 int pool_index = invokedynamic_cp_cache_entry_at(which)->constant_pool_index();
jrose@2316 489 pool_index = invoke_dynamic_name_and_type_ref_index_at(pool_index);
jrose@1583 490 assert(tag_at(pool_index).is_name_and_type(), "");
jrose@1583 491 return pool_index;
jrose@1583 492 }
jrose@1059 493 // change byte-ordering and go via cache
jrose@1059 494 i = remap_instruction_operand_from_cache(which);
jrose@1059 495 } else {
jrose@1838 496 if (tag_at(which).is_invoke_dynamic()) {
jrose@1838 497 int pool_index = invoke_dynamic_name_and_type_ref_index_at(which);
jrose@1838 498 assert(tag_at(pool_index).is_name_and_type(), "");
jrose@1838 499 return pool_index;
jrose@1838 500 }
jrose@1059 501 }
jrose@1059 502 assert(tag_at(i).is_field_or_method(), "Corrupted constant pool");
jrose@1838 503 assert(!tag_at(i).is_invoke_dynamic(), "Must be handled above");
jrose@1059 504 jint ref_index = *int_at_addr(i);
duke@0 505 return extract_high_short_from_int(ref_index);
duke@0 506 }
duke@0 507
duke@0 508
coleenp@3656 509 int ConstantPool::impl_klass_ref_index_at(int which, bool uncached) {
coleenp@3656 510 guarantee(!ConstantPool::is_invokedynamic_index(which),
jrose@1059 511 "an invokedynamic instruction does not have a klass");
jrose@1059 512 int i = which;
jrose@1059 513 if (!uncached && cache() != NULL) {
jrose@1059 514 // change byte-ordering and go via cache
jrose@1059 515 i = remap_instruction_operand_from_cache(which);
jrose@1059 516 }
jrose@1059 517 assert(tag_at(i).is_field_or_method(), "Corrupted constant pool");
jrose@1059 518 jint ref_index = *int_at_addr(i);
duke@0 519 return extract_low_short_from_int(ref_index);
duke@0 520 }
duke@0 521
duke@0 522
jrose@726 523
coleenp@3656 524 int ConstantPool::remap_instruction_operand_from_cache(int operand) {
jrose@1486 525 int cpc_index = operand;
jrose@1486 526 DEBUG_ONLY(cpc_index -= CPCACHE_INDEX_TAG);
jrose@1486 527 assert((int)(u2)cpc_index == cpc_index, "clean u2");
jrose@1059 528 int member_index = cache()->entry_at(cpc_index)->constant_pool_index();
jrose@1059 529 return member_index;
jrose@726 530 }
jrose@726 531
jrose@726 532
coleenp@3656 533 void ConstantPool::verify_constant_pool_resolve(constantPoolHandle this_oop, KlassHandle k, TRAPS) {
duke@0 534 if (k->oop_is_instance() || k->oop_is_objArray()) {
duke@0 535 instanceKlassHandle holder (THREAD, this_oop->pool_holder());
coleenp@3764 536 Klass* elem_oop = k->oop_is_instance() ? k() : ObjArrayKlass::cast(k())->bottom_klass();
duke@0 537 KlassHandle element (THREAD, elem_oop);
duke@0 538
duke@0 539 // The element type could be a typeArray - we only need the access check if it is
duke@0 540 // an reference to another class
duke@0 541 if (element->oop_is_instance()) {
duke@0 542 LinkResolver::check_klass_accessability(holder, element, CHECK);
duke@0 543 }
duke@0 544 }
duke@0 545 }
duke@0 546
duke@0 547
coleenp@3656 548 int ConstantPool::name_ref_index_at(int which_nt) {
jrose@726 549 jint ref_index = name_and_type_at(which_nt);
duke@0 550 return extract_low_short_from_int(ref_index);
duke@0 551 }
duke@0 552
duke@0 553
coleenp@3656 554 int ConstantPool::signature_ref_index_at(int which_nt) {
jrose@726 555 jint ref_index = name_and_type_at(which_nt);
duke@0 556 return extract_high_short_from_int(ref_index);
duke@0 557 }
duke@0 558
duke@0 559
coleenp@3656 560 Klass* ConstantPool::klass_ref_at(int which, TRAPS) {
duke@0 561 return klass_at(klass_ref_index_at(which), CHECK_NULL);
duke@0 562 }
duke@0 563
duke@0 564
coleenp@3656 565 Symbol* ConstantPool::klass_name_at(int which) {
duke@0 566 assert(tag_at(which).is_unresolved_klass() || tag_at(which).is_klass(),
duke@0 567 "Corrupted constant pool");
coleenp@3656 568 // A resolved constantPool entry will contain a Klass*, otherwise a Symbol*.
duke@0 569 // It is not safe to rely on the tag bit's here, since we don't have a lock, and the entry and
duke@0 570 // tag is not updated atomicly.
coleenp@2069 571 CPSlot entry = slot_at(which);
coleenp@3656 572 if (entry.is_resolved()) {
duke@0 573 // Already resolved - return entry's name.
coleenp@3656 574 assert(entry.get_klass()->is_klass(), "must be");
coleenp@3656 575 return entry.get_klass()->name();
duke@0 576 } else {
coleenp@3656 577 assert(entry.is_unresolved(), "must be either symbol or klass");
coleenp@2069 578 return entry.get_symbol();
duke@0 579 }
duke@0 580 }
duke@0 581
coleenp@3656 582 Symbol* ConstantPool::klass_ref_at_noresolve(int which) {
duke@0 583 jint ref_index = klass_ref_index_at(which);
duke@0 584 return klass_at_noresolve(ref_index);
duke@0 585 }
duke@0 586
coleenp@3656 587 Symbol* ConstantPool::uncached_klass_ref_at_noresolve(int which) {
jrose@1524 588 jint ref_index = uncached_klass_ref_index_at(which);
jrose@1524 589 return klass_at_noresolve(ref_index);
jrose@1524 590 }
jrose@1524 591
coleenp@3656 592 char* ConstantPool::string_at_noresolve(int which) {
coleenp@3656 593 Symbol* s = unresolved_string_at(which);
coleenp@3656 594 if (s == NULL) {
coleenp@3656 595 return (char*)"<pseudo-string>";
duke@0 596 } else {
coleenp@3656 597 return unresolved_string_at(which)->as_C_string();
duke@0 598 }
duke@0 599 }
duke@0 600
coleenp@3656 601 BasicType ConstantPool::basic_type_for_signature_at(int which) {
duke@0 602 return FieldType::basic_type(symbol_at(which));
duke@0 603 }
duke@0 604
duke@0 605
coleenp@3656 606 void ConstantPool::resolve_string_constants_impl(constantPoolHandle this_oop, TRAPS) {
duke@0 607 for (int index = 1; index < this_oop->length(); index++) { // Index 0 is unused
coleenp@3656 608 if (this_oop->tag_at(index).is_string()) {
duke@0 609 this_oop->string_at(index, CHECK);
duke@0 610 }
duke@0 611 }
duke@0 612 }
duke@0 613
coleenp@3656 614 // Resolve all the classes in the constant pool. If they are all resolved,
coleenp@3656 615 // the constant pool is read-only. Enhancement: allocate cp entries to
coleenp@3656 616 // another metaspace, and copy to read-only or read-write space if this
coleenp@3656 617 // bit is set.
coleenp@3656 618 bool ConstantPool::resolve_class_constants(TRAPS) {
coleenp@3656 619 constantPoolHandle cp(THREAD, this);
coleenp@3656 620 for (int index = 1; index < length(); index++) { // Index 0 is unused
coleenp@3656 621 if (tag_at(index).is_unresolved_klass() &&
coleenp@3656 622 klass_at_if_loaded(cp, index) == NULL) {
coleenp@3656 623 return false;
jrose@1838 624 }
coleenp@3656 625 }
coleenp@3656 626 // set_preresolution(); or some bit for future use
coleenp@3656 627 return true;
jrose@1838 628 }
jrose@1838 629
coleenp@3656 630 // If resolution for MethodHandle or MethodType fails, save the exception
coleenp@3656 631 // in the resolution error table, so that the same exception is thrown again.
coleenp@3656 632 void ConstantPool::save_and_throw_exception(constantPoolHandle this_oop, int which,
coleenp@3656 633 int tag, TRAPS) {
coleenp@3656 634 ResourceMark rm;
coleenp@3656 635 Symbol* error = PENDING_EXCEPTION->klass()->name();
iklam@4645 636 oop cplock = this_oop->lock();
iklam@4645 637 ObjectLocker ol(cplock, THREAD, cplock != NULL); // lock cpool to change tag.
coleenp@3656 638
coleenp@3656 639 int error_tag = (tag == JVM_CONSTANT_MethodHandle) ?
coleenp@3656 640 JVM_CONSTANT_MethodHandleInError : JVM_CONSTANT_MethodTypeInError;
coleenp@3656 641
coleenp@3656 642 if (!PENDING_EXCEPTION->
coleenp@3656 643 is_a(SystemDictionary::LinkageError_klass())) {
coleenp@3656 644 // Just throw the exception and don't prevent these classes from
coleenp@3656 645 // being loaded due to virtual machine errors like StackOverflow
coleenp@3656 646 // and OutOfMemoryError, etc, or if the thread was hit by stop()
coleenp@3656 647 // Needs clarification to section 5.4.3 of the VM spec (see 6308271)
coleenp@3656 648
coleenp@3656 649 } else if (this_oop->tag_at(which).value() != error_tag) {
coleenp@3656 650 SystemDictionary::add_resolution_error(this_oop, which, error);
coleenp@3656 651 this_oop->tag_at_put(which, error_tag);
coleenp@3656 652 } else {
coleenp@3656 653 // some other thread has put the class in error state.
coleenp@3656 654 error = SystemDictionary::find_resolution_error(this_oop, which);
coleenp@3656 655 assert(error != NULL, "checking");
coleenp@3656 656 CLEAR_PENDING_EXCEPTION;
coleenp@3656 657 THROW_MSG(error, "");
coleenp@3656 658 }
coleenp@3656 659 }
coleenp@3656 660
coleenp@3656 661
coleenp@3656 662 // Called to resolve constants in the constant pool and return an oop.
coleenp@3656 663 // Some constant pool entries cache their resolved oop. This is also
coleenp@3656 664 // called to create oops from constants to use in arguments for invokedynamic
coleenp@3656 665 oop ConstantPool::resolve_constant_at_impl(constantPoolHandle this_oop, int index, int cache_index, TRAPS) {
jrose@1524 666 oop result_oop = NULL;
jrose@1838 667 Handle throw_exception;
jrose@1838 668
jrose@1838 669 if (cache_index == _possible_index_sentinel) {
coleenp@3656 670 // It is possible that this constant is one which is cached in the objects.
jrose@1838 671 // We'll do a linear search. This should be OK because this usage is rare.
jrose@1838 672 assert(index > 0, "valid index");
coleenp@3656 673 cache_index = this_oop->cp_to_object_index(index);
jrose@1838 674 }
jrose@1838 675 assert(cache_index == _no_index_sentinel || cache_index >= 0, "");
jrose@1838 676 assert(index == _no_index_sentinel || index >= 0, "");
jrose@1838 677
jrose@1524 678 if (cache_index >= 0) {
coleenp@3656 679 result_oop = this_oop->resolved_references()->obj_at(cache_index);
jrose@1524 680 if (result_oop != NULL) {
coleenp@3656 681 return result_oop;
jrose@1838 682 // That was easy...
jrose@1524 683 }
coleenp@3656 684 index = this_oop->object_to_cp_index(cache_index);
jrose@1524 685 }
jrose@1524 686
jrose@1838 687 jvalue prim_value; // temp used only in a few cases below
jrose@1838 688
jrose@1524 689 int tag_value = this_oop->tag_at(index).value();
coleenp@3656 690
jrose@1524 691 switch (tag_value) {
jrose@1524 692
jrose@1524 693 case JVM_CONSTANT_UnresolvedClass:
jrose@1524 694 case JVM_CONSTANT_UnresolvedClassInError:
jrose@1524 695 case JVM_CONSTANT_Class:
jrose@1524 696 {
coleenp@3656 697 assert(cache_index == _no_index_sentinel, "should not have been set");
coleenp@3656 698 Klass* resolved = klass_at_impl(this_oop, index, CHECK_NULL);
jrose@1524 699 // ldc wants the java mirror.
never@2231 700 result_oop = resolved->java_mirror();
jrose@1524 701 break;
jrose@1524 702 }
jrose@1524 703
jrose@1524 704 case JVM_CONSTANT_String:
coleenp@3656 705 assert(cache_index != _no_index_sentinel, "should have been set");
jrose@1524 706 if (this_oop->is_pseudo_string_at(index)) {
coleenp@3656 707 result_oop = this_oop->pseudo_string_at(index, cache_index);
jrose@1524 708 break;
jrose@1524 709 }
coleenp@3656 710 result_oop = string_at_impl(this_oop, index, cache_index, CHECK_NULL);
jrose@1524 711 break;
jrose@1524 712
coleenp@3656 713 case JVM_CONSTANT_MethodHandleInError:
coleenp@3656 714 case JVM_CONSTANT_MethodTypeInError:
coleenp@3656 715 {
coleenp@3656 716 Symbol* error = SystemDictionary::find_resolution_error(this_oop, index);
coleenp@3656 717 guarantee(error != (Symbol*)NULL, "tag mismatch with resolution error table");
coleenp@3656 718 ResourceMark rm;
coleenp@3656 719 THROW_MSG_0(error, "");
coleenp@3656 720 break;
coleenp@3656 721 }
coleenp@3656 722
jrose@1524 723 case JVM_CONSTANT_MethodHandle:
jrose@1524 724 {
jrose@1524 725 int ref_kind = this_oop->method_handle_ref_kind_at(index);
jrose@1524 726 int callee_index = this_oop->method_handle_klass_index_at(index);
coleenp@2069 727 Symbol* name = this_oop->method_handle_name_ref_at(index);
coleenp@2069 728 Symbol* signature = this_oop->method_handle_signature_ref_at(index);
jrose@1524 729 if (PrintMiscellaneous)
jrose@1524 730 tty->print_cr("resolve JVM_CONSTANT_MethodHandle:%d [%d/%d/%d] %s.%s",
jrose@1524 731 ref_kind, index, this_oop->method_handle_index_at(index),
jrose@1524 732 callee_index, name->as_C_string(), signature->as_C_string());
jrose@1524 733 KlassHandle callee;
coleenp@3656 734 { Klass* k = klass_at_impl(this_oop, callee_index, CHECK_NULL);
jrose@1524 735 callee = KlassHandle(THREAD, k);
jrose@1524 736 }
jrose@1524 737 KlassHandle klass(THREAD, this_oop->pool_holder());
jrose@1524 738 Handle value = SystemDictionary::link_method_handle_constant(klass, ref_kind,
jrose@1524 739 callee, name, signature,
jrose@1838 740 THREAD);
coleenp@3656 741 result_oop = value();
jrose@1838 742 if (HAS_PENDING_EXCEPTION) {
coleenp@3656 743 save_and_throw_exception(this_oop, index, tag_value, CHECK_NULL);
jrose@1838 744 }
jrose@1524 745 break;
jrose@1524 746 }
jrose@1524 747
jrose@1524 748 case JVM_CONSTANT_MethodType:
jrose@1524 749 {
coleenp@2069 750 Symbol* signature = this_oop->method_type_signature_at(index);
jrose@1524 751 if (PrintMiscellaneous)
jrose@1524 752 tty->print_cr("resolve JVM_CONSTANT_MethodType [%d/%d] %s",
jrose@1524 753 index, this_oop->method_type_index_at(index),
jrose@1524 754 signature->as_C_string());
jrose@1524 755 KlassHandle klass(THREAD, this_oop->pool_holder());
twisti@3582 756 Handle value = SystemDictionary::find_method_handle_type(signature, klass, THREAD);
coleenp@3656 757 result_oop = value();
jrose@1838 758 if (HAS_PENDING_EXCEPTION) {
coleenp@3656 759 save_and_throw_exception(this_oop, index, tag_value, CHECK_NULL);
jrose@1838 760 }
jrose@1524 761 break;
jrose@1524 762 }
jrose@1524 763
jrose@1524 764 case JVM_CONSTANT_Integer:
coleenp@3656 765 assert(cache_index == _no_index_sentinel, "should not have been set");
jrose@1838 766 prim_value.i = this_oop->int_at(index);
jrose@1838 767 result_oop = java_lang_boxing_object::create(T_INT, &prim_value, CHECK_NULL);
jrose@1838 768 break;
jrose@1838 769
jrose@1524 770 case JVM_CONSTANT_Float:
coleenp@3656 771 assert(cache_index == _no_index_sentinel, "should not have been set");
jrose@1838 772 prim_value.f = this_oop->float_at(index);
jrose@1838 773 result_oop = java_lang_boxing_object::create(T_FLOAT, &prim_value, CHECK_NULL);
jrose@1838 774 break;
jrose@1838 775
jrose@1524 776 case JVM_CONSTANT_Long:
coleenp@3656 777 assert(cache_index == _no_index_sentinel, "should not have been set");
jrose@1838 778 prim_value.j = this_oop->long_at(index);
jrose@1838 779 result_oop = java_lang_boxing_object::create(T_LONG, &prim_value, CHECK_NULL);
jrose@1838 780 break;
jrose@1838 781
jrose@1524 782 case JVM_CONSTANT_Double:
coleenp@3656 783 assert(cache_index == _no_index_sentinel, "should not have been set");
jrose@1838 784 prim_value.d = this_oop->double_at(index);
jrose@1838 785 result_oop = java_lang_boxing_object::create(T_DOUBLE, &prim_value, CHECK_NULL);
jrose@1524 786 break;
jrose@1524 787
jrose@1524 788 default:
jrose@1524 789 DEBUG_ONLY( tty->print_cr("*** %p: tag at CP[%d/%d] = %d",
jrose@1524 790 this_oop(), index, cache_index, tag_value) );
jrose@1524 791 assert(false, "unexpected constant tag");
jrose@1524 792 break;
jrose@1524 793 }
jrose@1524 794
jrose@1524 795 if (cache_index >= 0) {
jrose@1524 796 // Cache the oop here also.
jrose@1838 797 Handle result_handle(THREAD, result_oop);
iklam@4645 798 oop cplock = this_oop->lock();
iklam@4645 799 ObjectLocker ol(cplock, THREAD, cplock != NULL); // don't know if we really need this
coleenp@3656 800 oop result = this_oop->resolved_references()->obj_at(cache_index);
coleenp@3656 801 // Benign race condition: resolved_references may already be filled in while we were trying to lock.
jrose@1838 802 // The important thing here is that all threads pick up the same result.
jrose@1838 803 // It doesn't matter which racing thread wins, as long as only one
jrose@1838 804 // result is used by all threads, and all future queries.
jrose@1838 805 // That result may be either a resolved constant or a failure exception.
coleenp@3656 806 if (result == NULL) {
coleenp@3656 807 this_oop->resolved_references()->obj_at_put(cache_index, result_handle());
coleenp@3656 808 return result_handle();
coleenp@3656 809 } else {
coleenp@3656 810 // Return the winning thread's result. This can be different than
coleenp@3656 811 // result_handle() for MethodHandles.
coleenp@3656 812 return result;
jrose@1524 813 }
jrose@1524 814 } else {
jrose@1524 815 return result_oop;
jrose@1524 816 }
jrose@1524 817 }
jrose@1524 818
coleenp@3656 819 oop ConstantPool::uncached_string_at(int which, TRAPS) {
coleenp@3656 820 Symbol* sym = unresolved_string_at(which);
coleenp@3656 821 oop str = StringTable::intern(sym, CHECK_(NULL));
coleenp@3656 822 assert(java_lang_String::is_instance(str), "must be string");
coleenp@3656 823 return str;
coleenp@3656 824 }
twisti@3582 825
coleenp@3656 826
coleenp@3656 827 oop ConstantPool::resolve_bootstrap_specifier_at_impl(constantPoolHandle this_oop, int index, TRAPS) {
twisti@3582 828 assert(this_oop->tag_at(index).is_invoke_dynamic(), "Corrupted constant pool");
twisti@3582 829
twisti@3582 830 Handle bsm;
twisti@3582 831 int argc;
twisti@3582 832 {
twisti@3582 833 // JVM_CONSTANT_InvokeDynamic is an ordered pair of [bootm, name&type], plus optional arguments
twisti@3582 834 // The bootm, being a JVM_CONSTANT_MethodHandle, has its own cache entry.
twisti@3582 835 // It is accompanied by the optional arguments.
twisti@3582 836 int bsm_index = this_oop->invoke_dynamic_bootstrap_method_ref_index_at(index);
twisti@3582 837 oop bsm_oop = this_oop->resolve_possibly_cached_constant_at(bsm_index, CHECK_NULL);
twisti@3582 838 if (!java_lang_invoke_MethodHandle::is_instance(bsm_oop)) {
twisti@3582 839 THROW_MSG_NULL(vmSymbols::java_lang_LinkageError(), "BSM not an MethodHandle");
twisti@3582 840 }
twisti@3582 841
twisti@3582 842 // Extract the optional static arguments.
twisti@3582 843 argc = this_oop->invoke_dynamic_argument_count_at(index);
twisti@3582 844 if (argc == 0) return bsm_oop;
twisti@3582 845
twisti@3582 846 bsm = Handle(THREAD, bsm_oop);
twisti@3582 847 }
twisti@3582 848
twisti@3582 849 objArrayHandle info;
twisti@3582 850 {
twisti@3582 851 objArrayOop info_oop = oopFactory::new_objArray(SystemDictionary::Object_klass(), 1+argc, CHECK_NULL);
twisti@3582 852 info = objArrayHandle(THREAD, info_oop);
twisti@3582 853 }
twisti@3582 854
twisti@3582 855 info->obj_at_put(0, bsm());
twisti@3582 856 for (int i = 0; i < argc; i++) {
twisti@3582 857 int arg_index = this_oop->invoke_dynamic_argument_index_at(index, i);
twisti@3582 858 oop arg_oop = this_oop->resolve_possibly_cached_constant_at(arg_index, CHECK_NULL);
twisti@3582 859 info->obj_at_put(1+i, arg_oop);
twisti@3582 860 }
twisti@3582 861
twisti@3582 862 return info();
twisti@3582 863 }
twisti@3582 864
coleenp@3656 865 oop ConstantPool::string_at_impl(constantPoolHandle this_oop, int which, int obj_index, TRAPS) {
coleenp@3656 866 // If the string has already been interned, this entry will be non-null
coleenp@3656 867 oop str = this_oop->resolved_references()->obj_at(obj_index);
coleenp@3656 868 if (str != NULL) return str;
coleenp@3656 869
coleenp@2069 870 Symbol* sym = this_oop->unresolved_string_at(which);
coleenp@3656 871 str = StringTable::intern(sym, CHECK_(NULL));
coleenp@3656 872 this_oop->string_at_put(which, obj_index, str);
coleenp@2069 873 assert(java_lang_String::is_instance(str), "must be string");
coleenp@2069 874 return str;
duke@0 875 }
duke@0 876
duke@0 877
coleenp@3656 878 bool ConstantPool::klass_name_at_matches(instanceKlassHandle k,
duke@0 879 int which) {
coleenp@2069 880 // Names are interned, so we can compare Symbol*s directly
coleenp@2069 881 Symbol* cp_name = klass_name_at(which);
duke@0 882 return (cp_name == k->name());
duke@0 883 }
duke@0 884
duke@0 885
coleenp@2069 886 // Iterate over symbols and decrement ones which are Symbol*s.
coleenp@2069 887 // This is done during GC so do not need to lock constantPool unless we
coleenp@2069 888 // have per-thread safepoints.
coleenp@2069 889 // Only decrement the UTF8 symbols. Unresolved classes and strings point to
coleenp@2069 890 // these symbols but didn't increment the reference count.
coleenp@3656 891 void ConstantPool::unreference_symbols() {
coleenp@2069 892 for (int index = 1; index < length(); index++) { // Index 0 is unused
coleenp@2069 893 constantTag tag = tag_at(index);
coleenp@2069 894 if (tag.is_symbol()) {
coleenp@2069 895 symbol_at(index)->decrement_refcount();
coleenp@2069 896 }
coleenp@2069 897 }
coleenp@2069 898 }
duke@0 899
duke@0 900
duke@0 901 // Compare this constant pool's entry at index1 to the constant pool
duke@0 902 // cp2's entry at index2.
coleenp@3656 903 bool ConstantPool::compare_entry_to(int index1, constantPoolHandle cp2,
duke@0 904 int index2, TRAPS) {
duke@0 905
duke@0 906 jbyte t1 = tag_at(index1).value();
duke@0 907 jbyte t2 = cp2->tag_at(index2).value();
duke@0 908
duke@0 909
duke@0 910 // JVM_CONSTANT_UnresolvedClassInError is equal to JVM_CONSTANT_UnresolvedClass
duke@0 911 // when comparing
duke@0 912 if (t1 == JVM_CONSTANT_UnresolvedClassInError) {
duke@0 913 t1 = JVM_CONSTANT_UnresolvedClass;
duke@0 914 }
duke@0 915 if (t2 == JVM_CONSTANT_UnresolvedClassInError) {
duke@0 916 t2 = JVM_CONSTANT_UnresolvedClass;
duke@0 917 }
duke@0 918
duke@0 919 if (t1 != t2) {
duke@0 920 // Not the same entry type so there is nothing else to check. Note
duke@0 921 // that this style of checking will consider resolved/unresolved
coleenp@3656 922 // class pairs as different.
coleenp@3656 923 // From the ConstantPool* API point of view, this is correct
coleenp@3656 924 // behavior. See VM_RedefineClasses::merge_constant_pools() to see how this
coleenp@3656 925 // plays out in the context of ConstantPool* merging.
duke@0 926 return false;
duke@0 927 }
duke@0 928
duke@0 929 switch (t1) {
duke@0 930 case JVM_CONSTANT_Class:
duke@0 931 {
coleenp@3656 932 Klass* k1 = klass_at(index1, CHECK_false);
coleenp@3656 933 Klass* k2 = cp2->klass_at(index2, CHECK_false);
duke@0 934 if (k1 == k2) {
duke@0 935 return true;
duke@0 936 }
duke@0 937 } break;
duke@0 938
duke@0 939 case JVM_CONSTANT_ClassIndex:
duke@0 940 {
duke@0 941 int recur1 = klass_index_at(index1);
duke@0 942 int recur2 = cp2->klass_index_at(index2);
duke@0 943 bool match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
duke@0 944 if (match) {
duke@0 945 return true;
duke@0 946 }
duke@0 947 } break;
duke@0 948
duke@0 949 case JVM_CONSTANT_Double:
duke@0 950 {
duke@0 951 jdouble d1 = double_at(index1);
duke@0 952 jdouble d2 = cp2->double_at(index2);
duke@0 953 if (d1 == d2) {
duke@0 954 return true;
duke@0 955 }
duke@0 956 } break;
duke@0 957
duke@0 958 case JVM_CONSTANT_Fieldref:
duke@0 959 case JVM_CONSTANT_InterfaceMethodref:
duke@0 960 case JVM_CONSTANT_Methodref:
duke@0 961 {
duke@0 962 int recur1 = uncached_klass_ref_index_at(index1);
duke@0 963 int recur2 = cp2->uncached_klass_ref_index_at(index2);
duke@0 964 bool match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
duke@0 965 if (match) {
duke@0 966 recur1 = uncached_name_and_type_ref_index_at(index1);
duke@0 967 recur2 = cp2->uncached_name_and_type_ref_index_at(index2);
duke@0 968 match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
duke@0 969 if (match) {
duke@0 970 return true;
duke@0 971 }
duke@0 972 }
duke@0 973 } break;
duke@0 974
duke@0 975 case JVM_CONSTANT_Float:
duke@0 976 {
duke@0 977 jfloat f1 = float_at(index1);
duke@0 978 jfloat f2 = cp2->float_at(index2);
duke@0 979 if (f1 == f2) {
duke@0 980 return true;
duke@0 981 }
duke@0 982 } break;
duke@0 983
duke@0 984 case JVM_CONSTANT_Integer:
duke@0 985 {
duke@0 986 jint i1 = int_at(index1);
duke@0 987 jint i2 = cp2->int_at(index2);
duke@0 988 if (i1 == i2) {
duke@0 989 return true;
duke@0 990 }
duke@0 991 } break;
duke@0 992
duke@0 993 case JVM_CONSTANT_Long:
duke@0 994 {
duke@0 995 jlong l1 = long_at(index1);
duke@0 996 jlong l2 = cp2->long_at(index2);
duke@0 997 if (l1 == l2) {
duke@0 998 return true;
duke@0 999 }
duke@0 1000 } break;
duke@0 1001
duke@0 1002 case JVM_CONSTANT_NameAndType:
duke@0 1003 {
duke@0 1004 int recur1 = name_ref_index_at(index1);
duke@0 1005 int recur2 = cp2->name_ref_index_at(index2);
duke@0 1006 bool match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
duke@0 1007 if (match) {
duke@0 1008 recur1 = signature_ref_index_at(index1);
duke@0 1009 recur2 = cp2->signature_ref_index_at(index2);
duke@0 1010 match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
duke@0 1011 if (match) {
duke@0 1012 return true;
duke@0 1013 }
duke@0 1014 }
duke@0 1015 } break;
duke@0 1016
duke@0 1017 case JVM_CONSTANT_StringIndex:
duke@0 1018 {
duke@0 1019 int recur1 = string_index_at(index1);
duke@0 1020 int recur2 = cp2->string_index_at(index2);
duke@0 1021 bool match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
duke@0 1022 if (match) {
duke@0 1023 return true;
duke@0 1024 }
duke@0 1025 } break;
duke@0 1026
duke@0 1027 case JVM_CONSTANT_UnresolvedClass:
duke@0 1028 {
coleenp@2069 1029 Symbol* k1 = unresolved_klass_at(index1);
coleenp@2069 1030 Symbol* k2 = cp2->unresolved_klass_at(index2);
duke@0 1031 if (k1 == k2) {
duke@0 1032 return true;
duke@0 1033 }
duke@0 1034 } break;
duke@0 1035
jrose@1524 1036 case JVM_CONSTANT_MethodType:
jrose@1524 1037 {
jrose@1524 1038 int k1 = method_type_index_at(index1);
jrose@1524 1039 int k2 = cp2->method_type_index_at(index2);
jrose@1924 1040 bool match = compare_entry_to(k1, cp2, k2, CHECK_false);
jrose@1924 1041 if (match) {
jrose@1524 1042 return true;
jrose@1524 1043 }
jrose@1524 1044 } break;
jrose@1524 1045
jrose@1524 1046 case JVM_CONSTANT_MethodHandle:
jrose@1524 1047 {
jrose@1524 1048 int k1 = method_handle_ref_kind_at(index1);
jrose@1524 1049 int k2 = cp2->method_handle_ref_kind_at(index2);
jrose@1524 1050 if (k1 == k2) {
jrose@1524 1051 int i1 = method_handle_index_at(index1);
jrose@1524 1052 int i2 = cp2->method_handle_index_at(index2);
jrose@1924 1053 bool match = compare_entry_to(i1, cp2, i2, CHECK_false);
jrose@1924 1054 if (match) {
jrose@1524 1055 return true;
jrose@1524 1056 }
jrose@1524 1057 }
jrose@1524 1058 } break;
jrose@1524 1059
jrose@1583 1060 case JVM_CONSTANT_InvokeDynamic:
jrose@1583 1061 {
sspitsyn@4644 1062 int k1 = invoke_dynamic_name_and_type_ref_index_at(index1);
sspitsyn@4644 1063 int k2 = cp2->invoke_dynamic_name_and_type_ref_index_at(index2);
sspitsyn@4644 1064 int i1 = invoke_dynamic_bootstrap_specifier_index(index1);
sspitsyn@4644 1065 int i2 = cp2->invoke_dynamic_bootstrap_specifier_index(index2);
ccheung@4848 1066 // separate statements and variables because CHECK_false is used
ccheung@4848 1067 bool match_entry = compare_entry_to(k1, cp2, k2, CHECK_false);
ccheung@4848 1068 bool match_operand = compare_operand_to(i1, cp2, i2, CHECK_false);
ccheung@4848 1069 return (match_entry && match_operand);
jrose@1583 1070 } break;
jrose@1583 1071
coleenp@3656 1072 case JVM_CONSTANT_String:
duke@0 1073 {
coleenp@2069 1074 Symbol* s1 = unresolved_string_at(index1);
coleenp@2069 1075 Symbol* s2 = cp2->unresolved_string_at(index2);
duke@0 1076 if (s1 == s2) {
duke@0 1077 return true;
duke@0 1078 }
duke@0 1079 } break;
duke@0 1080
duke@0 1081 case JVM_CONSTANT_Utf8:
duke@0 1082 {
coleenp@2069 1083 Symbol* s1 = symbol_at(index1);
coleenp@2069 1084 Symbol* s2 = cp2->symbol_at(index2);
duke@0 1085 if (s1 == s2) {
duke@0 1086 return true;
duke@0 1087 }
duke@0 1088 } break;
duke@0 1089
duke@0 1090 // Invalid is used as the tag for the second constant pool entry
duke@0 1091 // occupied by JVM_CONSTANT_Double or JVM_CONSTANT_Long. It should
duke@0 1092 // not be seen by itself.
duke@0 1093 case JVM_CONSTANT_Invalid: // fall through
duke@0 1094
duke@0 1095 default:
duke@0 1096 ShouldNotReachHere();
duke@0 1097 break;
duke@0 1098 }
duke@0 1099
duke@0 1100 return false;
duke@0 1101 } // end compare_entry_to()
duke@0 1102
duke@0 1103
sspitsyn@4644 1104 // Resize the operands array with delta_len and delta_size.
sspitsyn@4644 1105 // Used in RedefineClasses for CP merge.
sspitsyn@4644 1106 void ConstantPool::resize_operands(int delta_len, int delta_size, TRAPS) {
sspitsyn@4644 1107 int old_len = operand_array_length(operands());
sspitsyn@4644 1108 int new_len = old_len + delta_len;
sspitsyn@4644 1109 int min_len = (delta_len > 0) ? old_len : new_len;
sspitsyn@4644 1110
sspitsyn@4644 1111 int old_size = operands()->length();
sspitsyn@4644 1112 int new_size = old_size + delta_size;
sspitsyn@4644 1113 int min_size = (delta_size > 0) ? old_size : new_size;
sspitsyn@4644 1114
sspitsyn@4644 1115 ClassLoaderData* loader_data = pool_holder()->class_loader_data();
sspitsyn@4644 1116 Array<u2>* new_ops = MetadataFactory::new_array<u2>(loader_data, new_size, CHECK);
sspitsyn@4644 1117
sspitsyn@4644 1118 // Set index in the resized array for existing elements only
sspitsyn@4644 1119 for (int idx = 0; idx < min_len; idx++) {
sspitsyn@4644 1120 int offset = operand_offset_at(idx); // offset in original array
sspitsyn@4644 1121 operand_offset_at_put(new_ops, idx, offset + 2*delta_len); // offset in resized array
sspitsyn@4644 1122 }
sspitsyn@4644 1123 // Copy the bootstrap specifiers only
sspitsyn@4644 1124 Copy::conjoint_memory_atomic(operands()->adr_at(2*old_len),
sspitsyn@4644 1125 new_ops->adr_at(2*new_len),
sspitsyn@4644 1126 (min_size - 2*min_len) * sizeof(u2));
sspitsyn@4644 1127 // Explicitly deallocate old operands array.
sspitsyn@4644 1128 // Note, it is not needed for 7u backport.
sspitsyn@4644 1129 if ( operands() != NULL) { // the safety check
sspitsyn@4644 1130 MetadataFactory::free_array<u2>(loader_data, operands());
sspitsyn@4644 1131 }
sspitsyn@4644 1132 set_operands(new_ops);
sspitsyn@4644 1133 } // end resize_operands()
sspitsyn@4644 1134
sspitsyn@4644 1135
sspitsyn@4644 1136 // Extend the operands array with the length and size of the ext_cp operands.
sspitsyn@4644 1137 // Used in RedefineClasses for CP merge.
sspitsyn@4644 1138 void ConstantPool::extend_operands(constantPoolHandle ext_cp, TRAPS) {
sspitsyn@4644 1139 int delta_len = operand_array_length(ext_cp->operands());
sspitsyn@4644 1140 if (delta_len == 0) {
sspitsyn@4644 1141 return; // nothing to do
sspitsyn@4644 1142 }
sspitsyn@4644 1143 int delta_size = ext_cp->operands()->length();
sspitsyn@4644 1144
sspitsyn@4644 1145 assert(delta_len > 0 && delta_size > 0, "extended operands array must be bigger");
sspitsyn@4644 1146
sspitsyn@4644 1147 if (operand_array_length(operands()) == 0) {
sspitsyn@4644 1148 ClassLoaderData* loader_data = pool_holder()->class_loader_data();
sspitsyn@4644 1149 Array<u2>* new_ops = MetadataFactory::new_array<u2>(loader_data, delta_size, CHECK);
sspitsyn@4644 1150 // The first element index defines the offset of second part
sspitsyn@4644 1151 operand_offset_at_put(new_ops, 0, 2*delta_len); // offset in new array
sspitsyn@4644 1152 set_operands(new_ops);
sspitsyn@4644 1153 } else {
sspitsyn@4644 1154 resize_operands(delta_len, delta_size, CHECK);
sspitsyn@4644 1155 }
sspitsyn@4644 1156
sspitsyn@4644 1157 } // end extend_operands()
sspitsyn@4644 1158
sspitsyn@4644 1159
sspitsyn@4644 1160 // Shrink the operands array to a smaller array with new_len length.
sspitsyn@4644 1161 // Used in RedefineClasses for CP merge.
sspitsyn@4644 1162 void ConstantPool::shrink_operands(int new_len, TRAPS) {
sspitsyn@4644 1163 int old_len = operand_array_length(operands());
sspitsyn@4644 1164 if (new_len == old_len) {
sspitsyn@4644 1165 return; // nothing to do
sspitsyn@4644 1166 }
sspitsyn@4644 1167 assert(new_len < old_len, "shrunken operands array must be smaller");
sspitsyn@4644 1168
sspitsyn@4644 1169 int free_base = operand_next_offset_at(new_len - 1);
sspitsyn@4644 1170 int delta_len = new_len - old_len;
sspitsyn@4644 1171 int delta_size = 2*delta_len + free_base - operands()->length();
sspitsyn@4644 1172
sspitsyn@4644 1173 resize_operands(delta_len, delta_size, CHECK);
sspitsyn@4644 1174
sspitsyn@4644 1175 } // end shrink_operands()
sspitsyn@4644 1176
sspitsyn@4644 1177
sspitsyn@4135 1178 void ConstantPool::copy_operands(constantPoolHandle from_cp,
sspitsyn@4135 1179 constantPoolHandle to_cp,
sspitsyn@4135 1180 TRAPS) {
jrose@1924 1181
jrose@1924 1182 int from_oplen = operand_array_length(from_cp->operands());
jrose@1924 1183 int old_oplen = operand_array_length(to_cp->operands());
jrose@1924 1184 if (from_oplen != 0) {
kamg@3874 1185 ClassLoaderData* loader_data = to_cp->pool_holder()->class_loader_data();
jrose@1924 1186 // append my operands to the target's operands array
jrose@1924 1187 if (old_oplen == 0) {
kamg@3874 1188 // Can't just reuse from_cp's operand list because of deallocation issues
kamg@3874 1189 int len = from_cp->operands()->length();
kamg@3874 1190 Array<u2>* new_ops = MetadataFactory::new_array<u2>(loader_data, len, CHECK);
kamg@3874 1191 Copy::conjoint_memory_atomic(
kamg@3874 1192 from_cp->operands()->adr_at(0), new_ops->adr_at(0), len * sizeof(u2));
kamg@3874 1193 to_cp->set_operands(new_ops);
jrose@1924 1194 } else {
jrose@1924 1195 int old_len = to_cp->operands()->length();
jrose@1924 1196 int from_len = from_cp->operands()->length();
jrose@1924 1197 int old_off = old_oplen * sizeof(u2);
jrose@1924 1198 int from_off = from_oplen * sizeof(u2);
coleenp@3656 1199 // Use the metaspace for the destination constant pool
coleenp@3656 1200 Array<u2>* new_operands = MetadataFactory::new_array<u2>(loader_data, old_len + from_len, CHECK);
jrose@1924 1201 int fillp = 0, len = 0;
jrose@1924 1202 // first part of dest
coleenp@3656 1203 Copy::conjoint_memory_atomic(to_cp->operands()->adr_at(0),
coleenp@3656 1204 new_operands->adr_at(fillp),
jrose@1924 1205 (len = old_off) * sizeof(u2));
jrose@1924 1206 fillp += len;
jrose@1924 1207 // first part of src
sspitsyn@4147 1208 Copy::conjoint_memory_atomic(from_cp->operands()->adr_at(0),
coleenp@3656 1209 new_operands->adr_at(fillp),
jrose@1924 1210 (len = from_off) * sizeof(u2));
jrose@1924 1211 fillp += len;
jrose@1924 1212 // second part of dest
coleenp@3656 1213 Copy::conjoint_memory_atomic(to_cp->operands()->adr_at(old_off),
coleenp@3656 1214 new_operands->adr_at(fillp),
jrose@1924 1215 (len = old_len - old_off) * sizeof(u2));
jrose@1924 1216 fillp += len;
jrose@1924 1217 // second part of src
sspitsyn@4147 1218 Copy::conjoint_memory_atomic(from_cp->operands()->adr_at(from_off),
coleenp@3656 1219 new_operands->adr_at(fillp),
jrose@1924 1220 (len = from_len - from_off) * sizeof(u2));
jrose@1924 1221 fillp += len;
jrose@1924 1222 assert(fillp == new_operands->length(), "");
jrose@1924 1223
jrose@1924 1224 // Adjust indexes in the first part of the copied operands array.
jrose@1924 1225 for (int j = 0; j < from_oplen; j++) {
coleenp@3656 1226 int offset = operand_offset_at(new_operands, old_oplen + j);
jrose@1924 1227 assert(offset == operand_offset_at(from_cp->operands(), j), "correct copy");
jrose@1924 1228 offset += old_len; // every new tuple is preceded by old_len extra u2's
coleenp@3656 1229 operand_offset_at_put(new_operands, old_oplen + j, offset);
jrose@1924 1230 }
jrose@1924 1231
jrose@1924 1232 // replace target operands array with combined array
coleenp@3656 1233 to_cp->set_operands(new_operands);
jrose@1924 1234 }
jrose@1924 1235 }
sspitsyn@4135 1236 } // end copy_operands()
jrose@1924 1237
sspitsyn@4135 1238
sspitsyn@4135 1239 // Copy this constant pool's entries at start_i to end_i (inclusive)
sspitsyn@4135 1240 // to the constant pool to_cp's entries starting at to_i. A total of
sspitsyn@4135 1241 // (end_i - start_i) + 1 entries are copied.
sspitsyn@4135 1242 void ConstantPool::copy_cp_to_impl(constantPoolHandle from_cp, int start_i, int end_i,
sspitsyn@4135 1243 constantPoolHandle to_cp, int to_i, TRAPS) {
sspitsyn@4135 1244
sspitsyn@4135 1245
sspitsyn@4135 1246 int dest_i = to_i; // leave original alone for debug purposes
sspitsyn@4135 1247
sspitsyn@4135 1248 for (int src_i = start_i; src_i <= end_i; /* see loop bottom */ ) {
sspitsyn@4135 1249 copy_entry_to(from_cp, src_i, to_cp, dest_i, CHECK);
sspitsyn@4135 1250
sspitsyn@4135 1251 switch (from_cp->tag_at(src_i).value()) {
sspitsyn@4135 1252 case JVM_CONSTANT_Double:
sspitsyn@4135 1253 case JVM_CONSTANT_Long:
sspitsyn@4135 1254 // double and long take two constant pool entries
sspitsyn@4135 1255 src_i += 2;
sspitsyn@4135 1256 dest_i += 2;
sspitsyn@4135 1257 break;
sspitsyn@4135 1258
sspitsyn@4135 1259 default:
sspitsyn@4135 1260 // all others take one constant pool entry
sspitsyn@4135 1261 src_i++;
sspitsyn@4135 1262 dest_i++;
sspitsyn@4135 1263 break;
sspitsyn@4135 1264 }
sspitsyn@4135 1265 }
sspitsyn@4135 1266 copy_operands(from_cp, to_cp, CHECK);
sspitsyn@4135 1267
sspitsyn@4135 1268 } // end copy_cp_to_impl()
duke@0 1269
duke@0 1270
duke@0 1271 // Copy this constant pool's entry at from_i to the constant pool
duke@0 1272 // to_cp's entry at to_i.
coleenp@3656 1273 void ConstantPool::copy_entry_to(constantPoolHandle from_cp, int from_i,
jrose@1924 1274 constantPoolHandle to_cp, int to_i,
jrose@1924 1275 TRAPS) {
duke@0 1276
jrose@1924 1277 int tag = from_cp->tag_at(from_i).value();
jrose@1924 1278 switch (tag) {
duke@0 1279 case JVM_CONSTANT_Class:
duke@0 1280 {
coleenp@3656 1281 Klass* k = from_cp->klass_at(from_i, CHECK);
duke@0 1282 to_cp->klass_at_put(to_i, k);
duke@0 1283 } break;
duke@0 1284
duke@0 1285 case JVM_CONSTANT_ClassIndex:
duke@0 1286 {
jrose@1924 1287 jint ki = from_cp->klass_index_at(from_i);
duke@0 1288 to_cp->klass_index_at_put(to_i, ki);
duke@0 1289 } break;
duke@0 1290
duke@0 1291 case JVM_CONSTANT_Double:
duke@0 1292 {
jrose@1924 1293 jdouble d = from_cp->double_at(from_i);
duke@0 1294 to_cp->double_at_put(to_i, d);
duke@0 1295 // double takes two constant pool entries so init second entry's tag
duke@0 1296 to_cp->tag_at_put(to_i + 1, JVM_CONSTANT_Invalid);
duke@0 1297 } break;
duke@0 1298
duke@0 1299 case JVM_CONSTANT_Fieldref:
duke@0 1300 {
jrose@1924 1301 int class_index = from_cp->uncached_klass_ref_index_at(from_i);
jrose@1924 1302 int name_and_type_index = from_cp->uncached_name_and_type_ref_index_at(from_i);
duke@0 1303 to_cp->field_at_put(to_i, class_index, name_and_type_index);
duke@0 1304 } break;
duke@0 1305
duke@0 1306 case JVM_CONSTANT_Float:
duke@0 1307 {
jrose@1924 1308 jfloat f = from_cp->float_at(from_i);
duke@0 1309 to_cp->float_at_put(to_i, f);
duke@0 1310 } break;
duke@0 1311
duke@0 1312 case JVM_CONSTANT_Integer:
duke@0 1313 {
jrose@1924 1314 jint i = from_cp->int_at(from_i);
duke@0 1315 to_cp->int_at_put(to_i, i);
duke@0 1316 } break;
duke@0 1317
duke@0 1318 case JVM_CONSTANT_InterfaceMethodref:
duke@0 1319 {
jrose@1924 1320 int class_index = from_cp->uncached_klass_ref_index_at(from_i);
jrose@1924 1321 int name_and_type_index = from_cp->uncached_name_and_type_ref_index_at(from_i);
duke@0 1322 to_cp->interface_method_at_put(to_i, class_index, name_and_type_index);
duke@0 1323 } break;
duke@0 1324
duke@0 1325 case JVM_CONSTANT_Long:
duke@0 1326 {
jrose@1924 1327 jlong l = from_cp->long_at(from_i);
duke@0 1328 to_cp->long_at_put(to_i, l);
duke@0 1329 // long takes two constant pool entries so init second entry's tag
duke@0 1330 to_cp->tag_at_put(to_i + 1, JVM_CONSTANT_Invalid);
duke@0 1331 } break;
duke@0 1332
duke@0 1333 case JVM_CONSTANT_Methodref:
duke@0 1334 {
jrose@1924 1335 int class_index = from_cp->uncached_klass_ref_index_at(from_i);
jrose@1924 1336 int name_and_type_index = from_cp->uncached_name_and_type_ref_index_at(from_i);
duke@0 1337 to_cp->method_at_put(to_i, class_index, name_and_type_index);
duke@0 1338 } break;
duke@0 1339
duke@0 1340 case JVM_CONSTANT_NameAndType:
duke@0 1341 {
jrose@1924 1342 int name_ref_index = from_cp->name_ref_index_at(from_i);
jrose@1924 1343 int signature_ref_index = from_cp->signature_ref_index_at(from_i);
duke@0 1344 to_cp->name_and_type_at_put(to_i, name_ref_index, signature_ref_index);
duke@0 1345 } break;
duke@0 1346
duke@0 1347 case JVM_CONSTANT_StringIndex:
duke@0 1348 {
jrose@1924 1349 jint si = from_cp->string_index_at(from_i);
duke@0 1350 to_cp->string_index_at_put(to_i, si);
duke@0 1351 } break;
duke@0 1352
duke@0 1353 case JVM_CONSTANT_UnresolvedClass:
duke@0 1354 {
coleenp@2187 1355 // Can be resolved after checking tag, so check the slot first.
coleenp@2187 1356 CPSlot entry = from_cp->slot_at(from_i);
coleenp@3656 1357 if (entry.is_resolved()) {
coleenp@3656 1358 assert(entry.get_klass()->is_klass(), "must be");
coleenp@2187 1359 // Already resolved
coleenp@3656 1360 to_cp->klass_at_put(to_i, entry.get_klass());
coleenp@2187 1361 } else {
coleenp@2187 1362 to_cp->unresolved_klass_at_put(to_i, entry.get_symbol());
coleenp@2187 1363 }
duke@0 1364 } break;
duke@0 1365
duke@0 1366 case JVM_CONSTANT_UnresolvedClassInError:
duke@0 1367 {
coleenp@2069 1368 Symbol* k = from_cp->unresolved_klass_at(from_i);
duke@0 1369 to_cp->unresolved_klass_at_put(to_i, k);
duke@0 1370 to_cp->tag_at_put(to_i, JVM_CONSTANT_UnresolvedClassInError);
duke@0 1371 } break;
duke@0 1372
duke@0 1373
coleenp@3656 1374 case JVM_CONSTANT_String:
duke@0 1375 {
coleenp@3656 1376 Symbol* s = from_cp->unresolved_string_at(from_i);
coleenp@3656 1377 to_cp->unresolved_string_at_put(to_i, s);
duke@0 1378 } break;
duke@0 1379
duke@0 1380 case JVM_CONSTANT_Utf8:
duke@0 1381 {
coleenp@2069 1382 Symbol* s = from_cp->symbol_at(from_i);
coleenp@3656 1383 // Need to increase refcount, the old one will be thrown away and deferenced
coleenp@3656 1384 s->increment_refcount();
duke@0 1385 to_cp->symbol_at_put(to_i, s);
duke@0 1386 } break;
duke@0 1387
jrose@1524 1388 case JVM_CONSTANT_MethodType:
jrose@1524 1389 {
jrose@1924 1390 jint k = from_cp->method_type_index_at(from_i);
jrose@1524 1391 to_cp->method_type_index_at_put(to_i, k);
jrose@1524 1392 } break;
jrose@1524 1393
jrose@1524 1394 case JVM_CONSTANT_MethodHandle:
jrose@1524 1395 {
jrose@1924 1396 int k1 = from_cp->method_handle_ref_kind_at(from_i);
jrose@1924 1397 int k2 = from_cp->method_handle_index_at(from_i);
jrose@1524 1398 to_cp->method_handle_index_at_put(to_i, k1, k2);
jrose@1524 1399 } break;
jrose@1524 1400
jrose@1583 1401 case JVM_CONSTANT_InvokeDynamic:
jrose@1583 1402 {
jrose@1924 1403 int k1 = from_cp->invoke_dynamic_bootstrap_specifier_index(from_i);
jrose@1924 1404 int k2 = from_cp->invoke_dynamic_name_and_type_ref_index_at(from_i);
jrose@1924 1405 k1 += operand_array_length(to_cp->operands()); // to_cp might already have operands
jrose@1924 1406 to_cp->invoke_dynamic_at_put(to_i, k1, k2);
jrose@1583 1407 } break;
jrose@1583 1408
duke@0 1409 // Invalid is used as the tag for the second constant pool entry
duke@0 1410 // occupied by JVM_CONSTANT_Double or JVM_CONSTANT_Long. It should
duke@0 1411 // not be seen by itself.
duke@0 1412 case JVM_CONSTANT_Invalid: // fall through
duke@0 1413
duke@0 1414 default:
duke@0 1415 {
duke@0 1416 ShouldNotReachHere();
duke@0 1417 } break;
duke@0 1418 }
duke@0 1419 } // end copy_entry_to()
duke@0 1420
duke@0 1421
duke@0 1422 // Search constant pool search_cp for an entry that matches this
duke@0 1423 // constant pool's entry at pattern_i. Returns the index of a
duke@0 1424 // matching entry or zero (0) if there is no matching entry.
coleenp@3656 1425 int ConstantPool::find_matching_entry(int pattern_i,
duke@0 1426 constantPoolHandle search_cp, TRAPS) {
duke@0 1427
duke@0 1428 // index zero (0) is not used
duke@0 1429 for (int i = 1; i < search_cp->length(); i++) {
duke@0 1430 bool found = compare_entry_to(pattern_i, search_cp, i, CHECK_0);
duke@0 1431 if (found) {
duke@0 1432 return i;
duke@0 1433 }
duke@0 1434 }
duke@0 1435
duke@0 1436 return 0; // entry not found; return unused index zero (0)
duke@0 1437 } // end find_matching_entry()
duke@0 1438
duke@0 1439
sspitsyn@4644 1440 // Compare this constant pool's bootstrap specifier at idx1 to the constant pool
sspitsyn@4644 1441 // cp2's bootstrap specifier at idx2.
sspitsyn@4644 1442 bool ConstantPool::compare_operand_to(int idx1, constantPoolHandle cp2, int idx2, TRAPS) {
sspitsyn@4644 1443 int k1 = operand_bootstrap_method_ref_index_at(idx1);
sspitsyn@4644 1444 int k2 = cp2->operand_bootstrap_method_ref_index_at(idx2);
sspitsyn@4644 1445 bool match = compare_entry_to(k1, cp2, k2, CHECK_false);
sspitsyn@4644 1446
sspitsyn@4644 1447 if (!match) {
sspitsyn@4644 1448 return false;
sspitsyn@4644 1449 }
sspitsyn@4644 1450 int argc = operand_argument_count_at(idx1);
sspitsyn@4644 1451 if (argc == cp2->operand_argument_count_at(idx2)) {
sspitsyn@4644 1452 for (int j = 0; j < argc; j++) {
sspitsyn@4644 1453 k1 = operand_argument_index_at(idx1, j);
sspitsyn@4644 1454 k2 = cp2->operand_argument_index_at(idx2, j);
sspitsyn@4644 1455 match = compare_entry_to(k1, cp2, k2, CHECK_false);
sspitsyn@4644 1456 if (!match) {
sspitsyn@4644 1457 return false;
sspitsyn@4644 1458 }
sspitsyn@4644 1459 }
sspitsyn@4644 1460 return true; // got through loop; all elements equal
sspitsyn@4644 1461 }
sspitsyn@4644 1462 return false;
sspitsyn@4644 1463 } // end compare_operand_to()
sspitsyn@4644 1464
sspitsyn@4644 1465 // Search constant pool search_cp for a bootstrap specifier that matches
sspitsyn@4644 1466 // this constant pool's bootstrap specifier at pattern_i index.
sspitsyn@4644 1467 // Return the index of a matching bootstrap specifier or (-1) if there is no match.
sspitsyn@4644 1468 int ConstantPool::find_matching_operand(int pattern_i,
sspitsyn@4644 1469 constantPoolHandle search_cp, int search_len, TRAPS) {
sspitsyn@4644 1470 for (int i = 0; i < search_len; i++) {
sspitsyn@4644 1471 bool found = compare_operand_to(pattern_i, search_cp, i, CHECK_(-1));
sspitsyn@4644 1472 if (found) {
sspitsyn@4644 1473 return i;
sspitsyn@4644 1474 }
sspitsyn@4644 1475 }
sspitsyn@4644 1476 return -1; // bootstrap specifier not found; return unused index (-1)
sspitsyn@4644 1477 } // end find_matching_operand()
sspitsyn@4644 1478
sspitsyn@4644 1479
duke@0 1480 #ifndef PRODUCT
duke@0 1481
coleenp@3656 1482 const char* ConstantPool::printable_name_at(int which) {
duke@0 1483
duke@0 1484 constantTag tag = tag_at(which);
duke@0 1485
coleenp@3656 1486 if (tag.is_string()) {
duke@0 1487 return string_at_noresolve(which);
duke@0 1488 } else if (tag.is_klass() || tag.is_unresolved_klass()) {
duke@0 1489 return klass_name_at(which)->as_C_string();
duke@0 1490 } else if (tag.is_symbol()) {
duke@0 1491 return symbol_at(which)->as_C_string();
duke@0 1492 }
duke@0 1493 return "";
duke@0 1494 }
duke@0 1495
duke@0 1496 #endif // PRODUCT
duke@0 1497
duke@0 1498
duke@0 1499 // JVMTI GetConstantPool support
duke@0 1500
mikael@4540 1501 // For debugging of constant pool
mikael@4540 1502 const bool debug_cpool = false;
duke@0 1503
mikael@4540 1504 #define DBG(code) do { if (debug_cpool) { (code); } } while(0)
duke@0 1505
duke@0 1506 static void print_cpool_bytes(jint cnt, u1 *bytes) {
mikael@4540 1507 const char* WARN_MSG = "Must not be such entry!";
duke@0 1508 jint size = 0;
duke@0 1509 u2 idx1, idx2;
duke@0 1510
duke@0 1511 for (jint idx = 1; idx < cnt; idx++) {
duke@0 1512 jint ent_size = 0;
duke@0 1513 u1 tag = *bytes++;
duke@0 1514 size++; // count tag
duke@0 1515
duke@0 1516 printf("const #%03d, tag: %02d ", idx, tag);
duke@0 1517 switch(tag) {
duke@0 1518 case JVM_CONSTANT_Invalid: {
duke@0 1519 printf("Invalid");
duke@0 1520 break;
duke@0 1521 }
duke@0 1522 case JVM_CONSTANT_Unicode: {
duke@0 1523 printf("Unicode %s", WARN_MSG);
duke@0 1524 break;
duke@0 1525 }
duke@0 1526 case JVM_CONSTANT_Utf8: {
duke@0 1527 u2 len = Bytes::get_Java_u2(bytes);
duke@0 1528 char str[128];
duke@0 1529 if (len > 127) {
duke@0 1530 len = 127;
duke@0 1531 }
duke@0 1532 strncpy(str, (char *) (bytes+2), len);
duke@0 1533 str[len] = '\0';
duke@0 1534 printf("Utf8 \"%s\"", str);
duke@0 1535 ent_size = 2 + len;
duke@0 1536 break;
duke@0 1537 }
duke@0 1538 case JVM_CONSTANT_Integer: {
duke@0 1539 u4 val = Bytes::get_Java_u4(bytes);
duke@0 1540 printf("int %d", *(int *) &val);
duke@0 1541 ent_size = 4;
duke@0 1542 break;
duke@0 1543 }
duke@0 1544 case JVM_CONSTANT_Float: {
duke@0 1545 u4 val = Bytes::get_Java_u4(bytes);
duke@0 1546 printf("float %5.3ff", *(float *) &val);
duke@0 1547 ent_size = 4;
duke@0 1548 break;
duke@0 1549 }
duke@0 1550 case JVM_CONSTANT_Long: {
duke@0 1551 u8 val = Bytes::get_Java_u8(bytes);
never@2731 1552 printf("long "INT64_FORMAT, (int64_t) *(jlong *) &val);
duke@0 1553 ent_size = 8;
duke@0 1554 idx++; // Long takes two cpool slots
duke@0 1555 break;
duke@0 1556 }
duke@0 1557 case JVM_CONSTANT_Double: {
duke@0 1558 u8 val = Bytes::get_Java_u8(bytes);
duke@0 1559 printf("double %5.3fd", *(jdouble *)&val);
duke@0 1560 ent_size = 8;
duke@0 1561 idx++; // Double takes two cpool slots
duke@0 1562 break;
duke@0 1563 }
duke@0 1564 case JVM_CONSTANT_Class: {
duke@0 1565 idx1 = Bytes::get_Java_u2(bytes);
duke@0 1566 printf("class #%03d", idx1);
duke@0 1567 ent_size = 2;
duke@0 1568 break;
duke@0 1569 }
duke@0 1570 case JVM_CONSTANT_String: {
duke@0 1571 idx1 = Bytes::get_Java_u2(bytes);
duke@0 1572 printf("String #%03d", idx1);
duke@0 1573 ent_size = 2;
duke@0 1574 break;
duke@0 1575 }
duke@0 1576 case JVM_CONSTANT_Fieldref: {
duke@0 1577 idx1 = Bytes::get_Java_u2(bytes);
duke@0 1578 idx2 = Bytes::get_Java_u2(bytes+2);
duke@0 1579 printf("Field #%03d, #%03d", (int) idx1, (int) idx2);
duke@0 1580 ent_size = 4;
duke@0 1581 break;
duke@0 1582 }
duke@0 1583 case JVM_CONSTANT_Methodref: {
duke@0 1584 idx1 = Bytes::get_Java_u2(bytes);
duke@0 1585 idx2 = Bytes::get_Java_u2(bytes+2);
duke@0 1586 printf("Method #%03d, #%03d", idx1, idx2);
duke@0 1587 ent_size = 4;
duke@0 1588 break;
duke@0 1589 }
duke@0 1590 case JVM_CONSTANT_InterfaceMethodref: {
duke@0 1591 idx1 = Bytes::get_Java_u2(bytes);
duke@0 1592 idx2 = Bytes::get_Java_u2(bytes+2);
duke@0 1593 printf("InterfMethod #%03d, #%03d", idx1, idx2);
duke@0 1594 ent_size = 4;
duke@0 1595 break;
duke@0 1596 }
duke@0 1597 case JVM_CONSTANT_NameAndType: {
duke@0 1598 idx1 = Bytes::get_Java_u2(bytes);
duke@0 1599 idx2 = Bytes::get_Java_u2(bytes+2);
duke@0 1600 printf("NameAndType #%03d, #%03d", idx1, idx2);
duke@0 1601 ent_size = 4;
duke@0 1602 break;
duke@0 1603 }
duke@0 1604 case JVM_CONSTANT_ClassIndex: {
duke@0 1605 printf("ClassIndex %s", WARN_MSG);
duke@0 1606 break;
duke@0 1607 }
duke@0 1608 case JVM_CONSTANT_UnresolvedClass: {
duke@0 1609 printf("UnresolvedClass: %s", WARN_MSG);
duke@0 1610 break;
duke@0 1611 }
duke@0 1612 case JVM_CONSTANT_UnresolvedClassInError: {
duke@0 1613 printf("UnresolvedClassInErr: %s", WARN_MSG);
duke@0 1614 break;
duke@0 1615 }
duke@0 1616 case JVM_CONSTANT_StringIndex: {
duke@0 1617 printf("StringIndex: %s", WARN_MSG);
duke@0 1618 break;
duke@0 1619 }
duke@0 1620 }
duke@0 1621 printf(";\n");
duke@0 1622 bytes += ent_size;
duke@0 1623 size += ent_size;
duke@0 1624 }
duke@0 1625 printf("Cpool size: %d\n", size);
duke@0 1626 fflush(0);
duke@0 1627 return;
duke@0 1628 } /* end print_cpool_bytes */
duke@0 1629
duke@0 1630
duke@0 1631 // Returns size of constant pool entry.
coleenp@3656 1632 jint ConstantPool::cpool_entry_size(jint idx) {
duke@0 1633 switch(tag_at(idx).value()) {
duke@0 1634 case JVM_CONSTANT_Invalid:
duke@0 1635 case JVM_CONSTANT_Unicode:
duke@0 1636 return 1;
duke@0 1637
duke@0 1638 case JVM_CONSTANT_Utf8:
duke@0 1639 return 3 + symbol_at(idx)->utf8_length();
duke@0 1640
duke@0 1641 case JVM_CONSTANT_Class:
duke@0 1642 case JVM_CONSTANT_String:
duke@0 1643 case JVM_CONSTANT_ClassIndex:
duke@0 1644 case JVM_CONSTANT_UnresolvedClass:
duke@0 1645 case JVM_CONSTANT_UnresolvedClassInError:
duke@0 1646 case JVM_CONSTANT_StringIndex:
jrose@1524 1647 case JVM_CONSTANT_MethodType:
duke@0 1648 return 3;
duke@0 1649
jrose@1524 1650 case JVM_CONSTANT_MethodHandle:
jrose@1524 1651 return 4; //tag, ref_kind, ref_index
jrose@1524 1652
duke@0 1653 case JVM_CONSTANT_Integer:
duke@0 1654 case JVM_CONSTANT_Float:
duke@0 1655 case JVM_CONSTANT_Fieldref:
duke@0 1656 case JVM_CONSTANT_Methodref:
duke@0 1657 case JVM_CONSTANT_InterfaceMethodref:
duke@0 1658 case JVM_CONSTANT_NameAndType:
jrose@1838 1659 return 5;
jrose@1838 1660
jrose@1583 1661 case JVM_CONSTANT_InvokeDynamic:
jrose@1924 1662 // u1 tag, u2 bsm, u2 nt
jrose@1924 1663 return 5;
duke@0 1664
duke@0 1665 case JVM_CONSTANT_Long:
duke@0 1666 case JVM_CONSTANT_Double:
duke@0 1667 return 9;
duke@0 1668 }
duke@0 1669 assert(false, "cpool_entry_size: Invalid constant pool entry tag");
duke@0 1670 return 1;
duke@0 1671 } /* end cpool_entry_size */
duke@0 1672
duke@0 1673
duke@0 1674 // SymbolHashMap is used to find a constant pool index from a string.
duke@0 1675 // This function fills in SymbolHashMaps, one for utf8s and one for
duke@0 1676 // class names, returns size of the cpool raw bytes.
coleenp@3656 1677 jint ConstantPool::hash_entries_to(SymbolHashMap *symmap,
duke@0 1678 SymbolHashMap *classmap) {
duke@0 1679 jint size = 0;
duke@0 1680
duke@0 1681 for (u2 idx = 1; idx < length(); idx++) {
duke@0 1682 u2 tag = tag_at(idx).value();
duke@0 1683 size += cpool_entry_size(idx);
duke@0 1684
duke@0 1685 switch(tag) {
duke@0 1686 case JVM_CONSTANT_Utf8: {
coleenp@2069 1687 Symbol* sym = symbol_at(idx);
duke@0 1688 symmap->add_entry(sym, idx);
duke@0 1689 DBG(printf("adding symbol entry %s = %d\n", sym->as_utf8(), idx));
duke@0 1690 break;
duke@0 1691 }
duke@0 1692 case JVM_CONSTANT_Class:
duke@0 1693 case JVM_CONSTANT_UnresolvedClass:
duke@0 1694 case JVM_CONSTANT_UnresolvedClassInError: {
coleenp@2069 1695 Symbol* sym = klass_name_at(idx);
duke@0 1696 classmap->add_entry(sym, idx);
duke@0 1697 DBG(printf("adding class entry %s = %d\n", sym->as_utf8(), idx));
duke@0 1698 break;
duke@0 1699 }
duke@0 1700 case JVM_CONSTANT_Long:
duke@0 1701 case JVM_CONSTANT_Double: {
duke@0 1702 idx++; // Both Long and Double take two cpool slots
duke@0 1703 break;
duke@0 1704 }
duke@0 1705 }
duke@0 1706 }
duke@0 1707 return size;
duke@0 1708 } /* end hash_utf8_entries_to */
duke@0 1709
duke@0 1710
duke@0 1711 // Copy cpool bytes.
duke@0 1712 // Returns:
duke@0 1713 // 0, in case of OutOfMemoryError
duke@0 1714 // -1, in case of internal error
duke@0 1715 // > 0, count of the raw cpool bytes that have been copied
coleenp@3656 1716 int ConstantPool::copy_cpool_bytes(int cpool_size,
duke@0 1717 SymbolHashMap* tbl,
duke@0 1718 unsigned char *bytes) {
duke@0 1719 u2 idx1, idx2;
duke@0 1720 jint size = 0;
duke@0 1721 jint cnt = length();
duke@0 1722 unsigned char *start_bytes = bytes;
duke@0 1723
duke@0 1724 for (jint idx = 1; idx < cnt; idx++) {
duke@0 1725 u1 tag = tag_at(idx).value();
duke@0 1726 jint ent_size = cpool_entry_size(idx);
duke@0 1727
duke@0 1728 assert(size + ent_size <= cpool_size, "Size mismatch");
duke@0 1729
duke@0 1730 *bytes = tag;
duke@0 1731 DBG(printf("#%03hd tag=%03hd, ", idx, tag));
duke@0 1732 switch(tag) {
duke@0 1733 case JVM_CONSTANT_Invalid: {
duke@0 1734 DBG(printf("JVM_CONSTANT_Invalid"));
duke@0 1735 break;
duke@0 1736 }
duke@0 1737 case JVM_CONSTANT_Unicode: {
duke@0 1738 assert(false, "Wrong constant pool tag: JVM_CONSTANT_Unicode");
duke@0 1739 DBG(printf("JVM_CONSTANT_Unicode"));
duke@0 1740 break;
duke@0 1741 }
duke@0 1742 case JVM_CONSTANT_Utf8: {
coleenp@2069 1743 Symbol* sym = symbol_at(idx);
duke@0 1744 char* str = sym->as_utf8();
duke@0 1745 // Warning! It's crashing on x86 with len = sym->utf8_length()
duke@0 1746 int len = (int) strlen(str);
duke@0 1747 Bytes::put_Java_u2((address) (bytes+1), (u2) len);
duke@0 1748 for (int i = 0; i < len; i++) {
duke@0 1749 bytes[3+i] = (u1) str[i];
duke@0 1750 }
duke@0 1751 DBG(printf("JVM_CONSTANT_Utf8: %s ", str));
duke@0 1752 break;
duke@0 1753 }
duke@0 1754 case JVM_CONSTANT_Integer: {
duke@0 1755 jint val = int_at(idx);
duke@0 1756 Bytes::put_Java_u4((address) (bytes+1), *(u4*)&val);
duke@0 1757 break;
duke@0 1758 }
duke@0 1759 case JVM_CONSTANT_Float: {
duke@0 1760 jfloat val = float_at(idx);
duke@0 1761 Bytes::put_Java_u4((address) (bytes+1), *(u4*)&val);
duke@0 1762 break;
duke@0 1763 }
duke@0 1764 case JVM_CONSTANT_Long: {
duke@0 1765 jlong val = long_at(idx);
duke@0 1766 Bytes::put_Java_u8((address) (bytes+1), *(u8*)&val);
duke@0 1767 idx++; // Long takes two cpool slots
duke@0 1768 break;
duke@0 1769 }
duke@0 1770 case JVM_CONSTANT_Double: {
duke@0 1771 jdouble val = double_at(idx);
duke@0 1772 Bytes::put_Java_u8((address) (bytes+1), *(u8*)&val);
duke@0 1773 idx++; // Double takes two cpool slots
duke@0 1774 break;
duke@0 1775 }
duke@0 1776 case JVM_CONSTANT_Class:
duke@0 1777 case JVM_CONSTANT_UnresolvedClass:
duke@0 1778 case JVM_CONSTANT_UnresolvedClassInError: {
duke@0 1779 *bytes = JVM_CONSTANT_Class;
coleenp@2069 1780 Symbol* sym = klass_name_at(idx);
duke@0 1781 idx1 = tbl->symbol_to_value(sym);
duke@0 1782 assert(idx1 != 0, "Have not found a hashtable entry");
duke@0 1783 Bytes::put_Java_u2((address) (bytes+1), idx1);
duke@0 1784 DBG(printf("JVM_CONSTANT_Class: idx=#%03hd, %s", idx1, sym->as_utf8()));
duke@0 1785 break;
duke@0 1786 }
duke@0 1787 case JVM_CONSTANT_String: {
duke@0 1788 *bytes = JVM_CONSTANT_String;
coleenp@2069 1789 Symbol* sym = unresolved_string_at(idx);
duke@0 1790 idx1 = tbl->symbol_to_value(sym);
duke@0 1791 assert(idx1 != 0, "Have not found a hashtable entry");
duke@0 1792 Bytes::put_Java_u2((address) (bytes+1), idx1);
mikael@4540 1793 DBG(printf("JVM_CONSTANT_String: idx=#%03hd, %s", idx1, sym->as_utf8()));
duke@0 1794 break;
duke@0 1795 }
duke@0 1796 case JVM_CONSTANT_Fieldref:
duke@0 1797 case JVM_CONSTANT_Methodref:
duke@0 1798 case JVM_CONSTANT_InterfaceMethodref: {
duke@0 1799 idx1 = uncached_klass_ref_index_at(idx);
duke@0 1800 idx2 = uncached_name_and_type_ref_index_at(idx);
duke@0 1801 Bytes::put_Java_u2((address) (bytes+1), idx1);
duke@0 1802 Bytes::put_Java_u2((address) (bytes+3), idx2);
duke@0 1803 DBG(printf("JVM_CONSTANT_Methodref: %hd %hd", idx1, idx2));
duke@0 1804 break;
duke@0 1805 }
duke@0 1806 case JVM_CONSTANT_NameAndType: {
duke@0 1807 idx1 = name_ref_index_at(idx);
duke@0 1808 idx2 = signature_ref_index_at(idx);
duke@0 1809 Bytes::put_Java_u2((address) (bytes+1), idx1);
duke@0 1810 Bytes::put_Java_u2((address) (bytes+3), idx2);
duke@0 1811 DBG(printf("JVM_CONSTANT_NameAndType: %hd %hd", idx1, idx2));
duke@0 1812 break;
duke@0 1813 }
duke@0 1814 case JVM_CONSTANT_ClassIndex: {
duke@0 1815 *bytes = JVM_CONSTANT_Class;
duke@0 1816 idx1 = klass_index_at(idx);
duke@0 1817 Bytes::put_Java_u2((address) (bytes+1), idx1);
duke@0 1818 DBG(printf("JVM_CONSTANT_ClassIndex: %hd", idx1));
duke@0 1819 break;
duke@0 1820 }
duke@0 1821 case JVM_CONSTANT_StringIndex: {
duke@0 1822 *bytes = JVM_CONSTANT_String;
duke@0 1823 idx1 = string_index_at(idx);
duke@0 1824 Bytes::put_Java_u2((address) (bytes+1), idx1);
duke@0 1825 DBG(printf("JVM_CONSTANT_StringIndex: %hd", idx1));
duke@0 1826 break;
duke@0 1827 }
coleenp@3656 1828 case JVM_CONSTANT_MethodHandle:
coleenp@3656 1829 case JVM_CONSTANT_MethodHandleInError: {
jrose@1524 1830 *bytes = JVM_CONSTANT_MethodHandle;
jrose@1524 1831 int kind = method_handle_ref_kind_at(idx);
jrose@1524 1832 idx1 = method_handle_index_at(idx);
jrose@1524 1833 *(bytes+1) = (unsigned char) kind;
jrose@1524 1834 Bytes::put_Java_u2((address) (bytes+2), idx1);
jrose@1524 1835 DBG(printf("JVM_CONSTANT_MethodHandle: %d %hd", kind, idx1));
jrose@1524 1836 break;
jrose@1524 1837 }
coleenp@3656 1838 case JVM_CONSTANT_MethodType:
coleenp@3656 1839 case JVM_CONSTANT_MethodTypeInError: {
jrose@1524 1840 *bytes = JVM_CONSTANT_MethodType;
jrose@1524 1841 idx1 = method_type_index_at(idx);
jrose@1524 1842 Bytes::put_Java_u2((address) (bytes+1), idx1);
jrose@1524 1843 DBG(printf("JVM_CONSTANT_MethodType: %hd", idx1));
jrose@1524 1844 break;
jrose@1524 1845 }
jrose@1583 1846 case JVM_CONSTANT_InvokeDynamic: {
jrose@1924 1847 *bytes = tag;
jrose@1924 1848 idx1 = extract_low_short_from_int(*int_at_addr(idx));
jrose@1924 1849 idx2 = extract_high_short_from_int(*int_at_addr(idx));
jrose@1924 1850 assert(idx2 == invoke_dynamic_name_and_type_ref_index_at(idx), "correct half of u4");
jrose@1583 1851 Bytes::put_Java_u2((address) (bytes+1), idx1);
jrose@1583 1852 Bytes::put_Java_u2((address) (bytes+3), idx2);
jrose@1924 1853 DBG(printf("JVM_CONSTANT_InvokeDynamic: %hd %hd", idx1, idx2));
jrose@1583 1854 break;
jrose@1583 1855 }
duke@0 1856 }
duke@0 1857 DBG(printf("\n"));
duke@0 1858 bytes += ent_size;
duke@0 1859 size += ent_size;
duke@0 1860 }
duke@0 1861 assert(size == cpool_size, "Size mismatch");
duke@0 1862
duke@0 1863 // Keep temorarily for debugging until it's stable.
duke@0 1864 DBG(print_cpool_bytes(cnt, start_bytes));
duke@0 1865 return (int)(bytes - start_bytes);
duke@0 1866 } /* end copy_cpool_bytes */
duke@0 1867
mikael@4540 1868 #undef DBG
mikael@4540 1869
duke@0 1870
coleenp@3656 1871 void ConstantPool::set_on_stack(const bool value) {
coleenp@4132 1872 if (value) {
coleenp@4132 1873 _flags |= _on_stack;
coleenp@4132 1874 } else {
coleenp@4132 1875 _flags &= ~_on_stack;
coleenp@4132 1876 }
coleenp@3656 1877 if (value) MetadataOnStackMark::record(this);
coleenp@3656 1878 }
coleenp@3656 1879
coleenp@3656 1880 // JSR 292 support for patching constant pool oops after the class is linked and
coleenp@3656 1881 // the oop array for resolved references are created.
coleenp@3656 1882 // We can't do this during classfile parsing, which is how the other indexes are
coleenp@3656 1883 // patched. The other patches are applied early for some error checking
coleenp@3656 1884 // so only defer the pseudo_strings.
coleenp@3656 1885 void ConstantPool::patch_resolved_references(
coleenp@3656 1886 GrowableArray<Handle>* cp_patches) {
coleenp@3656 1887 assert(EnableInvokeDynamic, "");
coleenp@3656 1888 for (int index = 1; index < cp_patches->length(); index++) { // Index 0 is unused
coleenp@3656 1889 Handle patch = cp_patches->at(index);
coleenp@3656 1890 if (patch.not_null()) {
coleenp@3656 1891 assert (tag_at(index).is_string(), "should only be string left");
coleenp@3656 1892 // Patching a string means pre-resolving it.
coleenp@3656 1893 // The spelling in the constant pool is ignored.
coleenp@3656 1894 // The constant reference may be any object whatever.
coleenp@3656 1895 // If it is not a real interned string, the constant is referred
coleenp@3656 1896 // to as a "pseudo-string", and must be presented to the CP
coleenp@3656 1897 // explicitly, because it may require scavenging.
coleenp@3656 1898 int obj_index = cp_to_object_index(index);
coleenp@3656 1899 pseudo_string_at_put(index, obj_index, patch());
coleenp@3656 1900 DEBUG_ONLY(cp_patches->at_put(index, Handle());)
coleenp@3656 1901 }
coleenp@3656 1902 }
coleenp@3656 1903 #ifdef ASSERT
coleenp@3656 1904 // Ensure that all the patches have been used.
coleenp@3656 1905 for (int index = 0; index < cp_patches->length(); index++) {
coleenp@3656 1906 assert(cp_patches->at(index).is_null(),
coleenp@3656 1907 err_msg("Unused constant pool patch at %d in class file %s",
coleenp@3656 1908 index,
coleenp@3880 1909 pool_holder()->external_name()));
coleenp@3656 1910 }
coleenp@3656 1911 #endif // ASSERT
coleenp@3656 1912 }
coleenp@3656 1913
coleenp@3656 1914 #ifndef PRODUCT
coleenp@3656 1915
coleenp@3656 1916 // CompileTheWorld support. Preload all classes loaded references in the passed in constantpool
coleenp@3656 1917 void ConstantPool::preload_and_initialize_all_classes(ConstantPool* obj, TRAPS) {
coleenp@3656 1918 guarantee(obj->is_constantPool(), "object must be constant pool");
coleenp@3656 1919 constantPoolHandle cp(THREAD, (ConstantPool*)obj);
coleenp@3656 1920 guarantee(cp->pool_holder() != NULL, "must be fully loaded");
coleenp@3656 1921
coleenp@3656 1922 for (int i = 0; i< cp->length(); i++) {
coleenp@3656 1923 if (cp->tag_at(i).is_unresolved_klass()) {
coleenp@3656 1924 // This will force loading of the class
coleenp@3656 1925 Klass* klass = cp->klass_at(i, CHECK);
coleenp@3656 1926 if (klass->oop_is_instance()) {
coleenp@3656 1927 // Force initialization of class
coleenp@3656 1928 InstanceKlass::cast(klass)->initialize(CHECK);
coleenp@3656 1929 }
coleenp@3656 1930 }
coleenp@3656 1931 }
coleenp@3656 1932 }
coleenp@3656 1933
coleenp@3656 1934 #endif
coleenp@3656 1935
coleenp@3656 1936
coleenp@3656 1937 // Printing
coleenp@3656 1938
coleenp@3656 1939 void ConstantPool::print_on(outputStream* st) const {
coleenp@3656 1940 EXCEPTION_MARK;
coleenp@3656 1941 assert(is_constantPool(), "must be constantPool");
coleenp@3656 1942 st->print_cr(internal_name());
coleenp@3656 1943 if (flags() != 0) {
coleenp@3656 1944 st->print(" - flags: 0x%x", flags());
coleenp@3656 1945 if (has_preresolution()) st->print(" has_preresolution");
coleenp@4132 1946 if (on_stack()) st->print(" on_stack");
coleenp@3656 1947 st->cr();
coleenp@3656 1948 }
coleenp@3656 1949 if (pool_holder() != NULL) {
coleenp@3656 1950 st->print_cr(" - holder: " INTPTR_FORMAT, pool_holder());
coleenp@3656 1951 }
coleenp@3656 1952 st->print_cr(" - cache: " INTPTR_FORMAT, cache());
coleenp@3656 1953 st->print_cr(" - resolved_references: " INTPTR_FORMAT, resolved_references());
coleenp@3656 1954 st->print_cr(" - reference_map: " INTPTR_FORMAT, reference_map());
coleenp@3656 1955
coleenp@3656 1956 for (int index = 1; index < length(); index++) { // Index 0 is unused
coleenp@3656 1957 ((ConstantPool*)this)->print_entry_on(index, st);
coleenp@3656 1958 switch (tag_at(index).value()) {
coleenp@3656 1959 case JVM_CONSTANT_Long :
coleenp@3656 1960 case JVM_CONSTANT_Double :
coleenp@3656 1961 index++; // Skip entry following eigth-byte constant
coleenp@3656 1962 }
coleenp@3656 1963
coleenp@3656 1964 }
coleenp@3656 1965 st->cr();
coleenp@3656 1966 }
coleenp@3656 1967
coleenp@3656 1968 // Print one constant pool entry
coleenp@3656 1969 void ConstantPool::print_entry_on(const int index, outputStream* st) {
coleenp@3656 1970 EXCEPTION_MARK;
coleenp@3656 1971 st->print(" - %3d : ", index);
coleenp@3656 1972 tag_at(index).print_on(st);
coleenp@3656 1973 st->print(" : ");
coleenp@3656 1974 switch (tag_at(index).value()) {
coleenp@3656 1975 case JVM_CONSTANT_Class :
coleenp@3656 1976 { Klass* k = klass_at(index, CATCH);
morris@4430 1977 guarantee(k != NULL, "need klass");
coleenp@3656 1978 k->print_value_on(st);
coleenp@3656 1979 st->print(" {0x%lx}", (address)k);
coleenp@3656 1980 }
coleenp@3656 1981 break;
coleenp@3656 1982 case JVM_CONSTANT_Fieldref :
coleenp@3656 1983 case JVM_CONSTANT_Methodref :
coleenp@3656 1984 case JVM_CONSTANT_InterfaceMethodref :
coleenp@3656 1985 st->print("klass_index=%d", uncached_klass_ref_index_at(index));
coleenp@3656 1986 st->print(" name_and_type_index=%d", uncached_name_and_type_ref_index_at(index));
coleenp@3656 1987 break;
coleenp@3656 1988 case JVM_CONSTANT_String :
coleenp@4288 1989 if (is_pseudo_string_at(index)) {
coleenp@4288 1990 oop anObj = pseudo_string_at(index);
coleenp@4288 1991 anObj->print_value_on(st);
coleenp@4288 1992 st->print(" {0x%lx}", (address)anObj);
coleenp@4288 1993 } else {
coleenp@4288 1994 unresolved_string_at(index)->print_value_on(st);
coleenp@4288 1995 }
coleenp@3656 1996 break;
coleenp@3656 1997 case JVM_CONSTANT_Integer :
coleenp@3656 1998 st->print("%d", int_at(index));
coleenp@3656 1999 break;
coleenp@3656 2000 case JVM_CONSTANT_Float :
coleenp@3656 2001 st->print("%f", float_at(index));
coleenp@3656 2002 break;
coleenp@3656 2003 case JVM_CONSTANT_Long :
coleenp@3656 2004 st->print_jlong(long_at(index));
coleenp@3656 2005 break;
coleenp@3656 2006 case JVM_CONSTANT_Double :
coleenp@3656 2007 st->print("%lf", double_at(index));
coleenp@3656 2008 break;
coleenp@3656 2009 case JVM_CONSTANT_NameAndType :
coleenp@3656 2010 st->print("name_index=%d", name_ref_index_at(index));
coleenp@3656 2011 st->print(" signature_index=%d", signature_ref_index_at(index));
coleenp@3656 2012 break;
coleenp@3656 2013 case JVM_CONSTANT_Utf8 :
coleenp@3656 2014 symbol_at(index)->print_value_on(st);
coleenp@3656 2015 break;
coleenp@3656 2016 case JVM_CONSTANT_UnresolvedClass : // fall-through
coleenp@3656 2017 case JVM_CONSTANT_UnresolvedClassInError: {
coleenp@3656 2018 // unresolved_klass_at requires lock or safe world.
coleenp@3656 2019 CPSlot entry = slot_at(index);
coleenp@3656 2020 if (entry.is_resolved()) {
coleenp@3656 2021 entry.get_klass()->print_value_on(st);
coleenp@3656 2022 } else {
coleenp@3656 2023 entry.get_symbol()->print_value_on(st);
coleenp@3656 2024 }
coleenp@3656 2025 }
coleenp@3656 2026 break;
coleenp@3656 2027 case JVM_CONSTANT_MethodHandle :
coleenp@3656 2028 case JVM_CONSTANT_MethodHandleInError :
coleenp@3656 2029 st->print("ref_kind=%d", method_handle_ref_kind_at(index));
coleenp@3656 2030 st->print(" ref_index=%d", method_handle_index_at(index));
coleenp@3656 2031 break;
coleenp@3656 2032 case JVM_CONSTANT_MethodType :
coleenp@3656 2033 case JVM_CONSTANT_MethodTypeInError :
coleenp@3656 2034 st->print("signature_index=%d", method_type_index_at(index));
coleenp@3656 2035 break;
coleenp@3656 2036 case JVM_CONSTANT_InvokeDynamic :
coleenp@3656 2037 {
coleenp@3656 2038 st->print("bootstrap_method_index=%d", invoke_dynamic_bootstrap_method_ref_index_at(index));
coleenp@3656 2039 st->print(" name_and_type_index=%d", invoke_dynamic_name_and_type_ref_index_at(index));
coleenp@3656 2040 int argc = invoke_dynamic_argument_count_at(index);
coleenp@3656 2041 if (argc > 0) {
coleenp@3656 2042 for (int arg_i = 0; arg_i < argc; arg_i++) {
coleenp@3656 2043 int arg = invoke_dynamic_argument_index_at(index, arg_i);
coleenp@3656 2044 st->print((arg_i == 0 ? " arguments={%d" : ", %d"), arg);
coleenp@3656 2045 }
coleenp@3656 2046 st->print("}");
coleenp@3656 2047 }
coleenp@3656 2048 }
coleenp@3656 2049 break;
coleenp@3656 2050 default:
coleenp@3656 2051 ShouldNotReachHere();
coleenp@3656 2052 break;
coleenp@3656 2053 }
coleenp@3656 2054 st->cr();
coleenp@3656 2055 }
coleenp@3656 2056
coleenp@3656 2057 void ConstantPool::print_value_on(outputStream* st) const {
coleenp@3656 2058 assert(is_constantPool(), "must be constantPool");
coleenp@3656 2059 st->print("constant pool [%d]", length());
coleenp@3656 2060 if (has_preresolution()) st->print("/preresolution");
coleenp@3656 2061 if (operands() != NULL) st->print("/operands[%d]", operands()->length());
coleenp@3656 2062 print_address_on(st);
coleenp@3656 2063 st->print(" for ");
coleenp@3656 2064 pool_holder()->print_value_on(st);
coleenp@3656 2065 if (pool_holder() != NULL) {
coleenp@3880 2066 bool extra = (pool_holder()->constants() != this);
coleenp@3656 2067 if (extra) st->print(" (extra)");
coleenp@3656 2068 }
coleenp@3656 2069 if (cache() != NULL) {
coleenp@3656 2070 st->print(" cache=" PTR_FORMAT, cache());
coleenp@3656 2071 }
coleenp@3656 2072 }
coleenp@3656 2073
acorn@4139 2074 #if INCLUDE_SERVICES
acorn@4139 2075 // Size Statistics
acorn@4139 2076 void ConstantPool::collect_statistics(KlassSizeStats *sz) const {
acorn@4139 2077 sz->_cp_all_bytes += (sz->_cp_bytes = sz->count(this));
acorn@4139 2078 sz->_cp_all_bytes += (sz->_cp_tags_bytes = sz->count_array(tags()));
acorn@4139 2079 sz->_cp_all_bytes += (sz->_cp_cache_bytes = sz->count(cache()));
acorn@4139 2080 sz->_cp_all_bytes += (sz->_cp_operands_bytes = sz->count_array(operands()));
acorn@4139 2081 sz->_cp_all_bytes += (sz->_cp_refmap_bytes = sz->count_array(reference_map()));
acorn@4139 2082
acorn@4139 2083 sz->_ro_bytes += sz->_cp_operands_bytes + sz->_cp_tags_bytes +
acorn@4139 2084 sz->_cp_refmap_bytes;
acorn@4139 2085 sz->_rw_bytes += sz->_cp_bytes + sz->_cp_cache_bytes;
acorn@4139 2086 }
acorn@4139 2087 #endif // INCLUDE_SERVICES
coleenp@3656 2088
coleenp@3656 2089 // Verification
coleenp@3656 2090
coleenp@3656 2091 void ConstantPool::verify_on(outputStream* st) {
coleenp@3656 2092 guarantee(is_constantPool(), "object must be constant pool");
coleenp@3656 2093 for (int i = 0; i< length(); i++) {
coleenp@3656 2094 constantTag tag = tag_at(i);
coleenp@3656 2095 CPSlot entry = slot_at(i);
coleenp@3656 2096 if (tag.is_klass()) {
coleenp@3656 2097 if (entry.is_resolved()) {
coleenp@3656 2098 guarantee(entry.get_klass()->is_metadata(), "should be metadata");
coleenp@3656 2099 guarantee(entry.get_klass()->is_klass(), "should be klass");
coleenp@3656 2100 }
coleenp@3656 2101 } else if (tag.is_unresolved_klass()) {
coleenp@3656 2102 if (entry.is_resolved()) {
coleenp@3656 2103 guarantee(entry.get_klass()->is_metadata(), "should be metadata");
coleenp@3656 2104 guarantee(entry.get_klass()->is_klass(), "should be klass");
coleenp@3656 2105 }
coleenp@3656 2106 } else if (tag.is_symbol()) {
coleenp@3656 2107 guarantee(entry.get_symbol()->refcount() != 0, "should have nonzero reference count");
coleenp@3656 2108 } else if (tag.is_string()) {
coleenp@3656 2109 guarantee(entry.get_symbol()->refcount() != 0, "should have nonzero reference count");
coleenp@3656 2110 }
coleenp@3656 2111 }
coleenp@3656 2112 if (cache() != NULL) {
coleenp@3656 2113 // Note: cache() can be NULL before a class is completely setup or
coleenp@3656 2114 // in temporary constant pools used during constant pool merging
coleenp@3656 2115 guarantee(cache()->is_metadata(), "should be metadata");
coleenp@3656 2116 guarantee(cache()->is_constantPoolCache(), "should be constant pool cache");
coleenp@3656 2117 }
coleenp@3656 2118 if (pool_holder() != NULL) {
coleenp@3656 2119 // Note: pool_holder() can be NULL in temporary constant pools
coleenp@3656 2120 // used during constant pool merging
coleenp@3656 2121 guarantee(pool_holder()->is_metadata(), "should be metadata");
coleenp@3656 2122 guarantee(pool_holder()->is_klass(), "should be klass");
coleenp@3656 2123 }
coleenp@3656 2124 }
coleenp@3656 2125
coleenp@3656 2126
coleenp@2069 2127 void SymbolHashMap::add_entry(Symbol* sym, u2 value) {
duke@0 2128 char *str = sym->as_utf8();
duke@0 2129 unsigned int hash = compute_hash(str, sym->utf8_length());
duke@0 2130 unsigned int index = hash % table_size();
duke@0 2131
duke@0 2132 // check if already in map
duke@0 2133 // we prefer the first entry since it is more likely to be what was used in
duke@0 2134 // the class file
duke@0 2135 for (SymbolHashMapEntry *en = bucket(index); en != NULL; en = en->next()) {
duke@0 2136 assert(en->symbol() != NULL, "SymbolHashMapEntry symbol is NULL");
duke@0 2137 if (en->hash() == hash && en->symbol() == sym) {
duke@0 2138 return; // already there
duke@0 2139 }
duke@0 2140 }
duke@0 2141
duke@0 2142 SymbolHashMapEntry* entry = new SymbolHashMapEntry(hash, sym, value);
duke@0 2143 entry->set_next(bucket(index));
duke@0 2144 _buckets[index].set_entry(entry);
duke@0 2145 assert(entry->symbol() != NULL, "SymbolHashMapEntry symbol is NULL");
duke@0 2146 }
duke@0 2147
coleenp@2069 2148 SymbolHashMapEntry* SymbolHashMap::find_entry(Symbol* sym) {
duke@0 2149 assert(sym != NULL, "SymbolHashMap::find_entry - symbol is NULL");
duke@0 2150 char *str = sym->as_utf8();
duke@0 2151 int len = sym->utf8_length();
duke@0 2152 unsigned int hash = SymbolHashMap::compute_hash(str, len);
duke@0 2153 unsigned int index = hash % table_size();
duke@0 2154 for (SymbolHashMapEntry *en = bucket(index); en != NULL; en = en->next()) {
duke@0 2155 assert(en->symbol() != NULL, "SymbolHashMapEntry symbol is NULL");
duke@0 2156 if (en->hash() == hash && en->symbol() == sym) {
duke@0 2157 return en;
duke@0 2158 }
duke@0 2159 }
duke@0 2160 return NULL;
duke@0 2161 }