annotate src/share/vm/oops/constantPool.cpp @ 4540:cc32ccaaf47f

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