1 /*
2 * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "jvm.h"
27 #include "classfile/classLoaderData.hpp"
28 #include "classfile/javaClasses.inline.hpp"
29 #include "classfile/metadataOnStackMark.hpp"
30 #include "classfile/stringTable.hpp"
31 #include "classfile/systemDictionary.hpp"
32 #include "classfile/vmSymbols.hpp"
33 #include "interpreter/linkResolver.hpp"
34 #include "memory/allocation.inline.hpp"
35 #include "memory/heapInspection.hpp"
36 #include "memory/heapShared.hpp"
37 #include "memory/metadataFactory.hpp"
38 #include "memory/metaspaceClosure.hpp"
39 #include "memory/metaspaceShared.hpp"
40 #include "memory/oopFactory.hpp"
41 #include "memory/resourceArea.hpp"
42 #include "oops/array.inline.hpp"
43 #include "oops/constantPool.inline.hpp"
44 #include "oops/cpCache.inline.hpp"
45 #include "oops/instanceKlass.hpp"
46 #include "oops/objArrayKlass.hpp"
47 #include "oops/objArrayOop.inline.hpp"
48 #include "oops/oop.inline.hpp"
49 #include "oops/typeArrayOop.inline.hpp"
50 #include "runtime/fieldType.hpp"
51 #include "runtime/handles.inline.hpp"
52 #include "runtime/init.hpp"
53 #include "runtime/javaCalls.hpp"
54 #include "runtime/signature.hpp"
55 #include "runtime/vframe.inline.hpp"
56 #include "utilities/copy.hpp"
57
58 constantTag ConstantPool::tag_at(int which) const { return (constantTag)tags()->at_acquire(which); }
59
60 void ConstantPool::release_tag_at_put(int which, jbyte t) { tags()->release_at_put(which, t); }
61
62 ConstantPool* ConstantPool::allocate(ClassLoaderData* loader_data, int length, TRAPS) {
63 Array<u1>* tags = MetadataFactory::new_array<u1>(loader_data, length, 0, CHECK_NULL);
64 int size = ConstantPool::size(length);
65 return new (loader_data, size, MetaspaceObj::ConstantPoolType, THREAD) ConstantPool(tags);
66 }
67
68 #ifdef ASSERT
69
70 // MetaspaceObj allocation invariant is calloc equivalent memory
71 // simple verification of this here (JVM_CONSTANT_Invalid == 0 )
72 static bool tag_array_is_zero_initialized(Array<u1>* tags) {
73 assert(tags != NULL, "invariant");
74 const int length = tags->length();
75 for (int index = 0; index < length; ++index) {
76 if (JVM_CONSTANT_Invalid != tags->at(index)) {
77 return false;
78 }
79 }
80 return true;
81 }
82
83 #endif
84
85 ConstantPool::ConstantPool(Array<u1>* tags) :
86 _tags(tags),
87 _length(tags->length()) {
88
89 assert(_tags != NULL, "invariant");
90 assert(tags->length() == _length, "invariant");
91 assert(tag_array_is_zero_initialized(tags), "invariant");
92 assert(0 == flags(), "invariant");
93 assert(0 == version(), "invariant");
94 assert(NULL == _pool_holder, "invariant");
95 }
96
97 void ConstantPool::deallocate_contents(ClassLoaderData* loader_data) {
98 if (cache() != NULL) {
99 MetadataFactory::free_metadata(loader_data, cache());
100 set_cache(NULL);
101 }
102
103 MetadataFactory::free_array<Klass*>(loader_data, resolved_klasses());
104 set_resolved_klasses(NULL);
105
106 MetadataFactory::free_array<jushort>(loader_data, operands());
107 set_operands(NULL);
108
109 release_C_heap_structures();
110
111 // free tag array
112 MetadataFactory::free_array<u1>(loader_data, tags());
113 set_tags(NULL);
114 }
115
116 void ConstantPool::release_C_heap_structures() {
117 // walk constant pool and decrement symbol reference counts
118 unreference_symbols();
119 }
120
121 void ConstantPool::metaspace_pointers_do(MetaspaceClosure* it) {
122 log_trace(cds)("Iter(ConstantPool): %p", this);
123
124 it->push(&_tags, MetaspaceClosure::_writable);
125 it->push(&_cache);
126 it->push(&_pool_holder);
127 it->push(&_operands);
128 it->push(&_resolved_klasses, MetaspaceClosure::_writable);
129
130 for (int i = 0; i < length(); i++) {
131 // The only MSO's embedded in the CP entries are Symbols:
132 // JVM_CONSTANT_String (normal and pseudo)
133 // JVM_CONSTANT_Utf8
134 constantTag ctag = tag_at(i);
135 if (ctag.is_string() || ctag.is_utf8()) {
136 it->push(symbol_at_addr(i));
137 }
138 }
139 }
140
141 objArrayOop ConstantPool::resolved_references() const {
142 return (objArrayOop)_cache->resolved_references();
143 }
144
145 // Called from outside constant pool resolution where a resolved_reference array
146 // may not be present.
147 objArrayOop ConstantPool::resolved_references_or_null() const {
148 if (_cache == NULL) {
149 return NULL;
150 } else {
151 return (objArrayOop)_cache->resolved_references();
152 }
153 }
154
155 // Create resolved_references array and mapping array for original cp indexes
156 // The ldc bytecode was rewritten to have the resolved reference array index so need a way
157 // to map it back for resolving and some unlikely miscellaneous uses.
158 // The objects created by invokedynamic are appended to this list.
159 void ConstantPool::initialize_resolved_references(ClassLoaderData* loader_data,
160 const intStack& reference_map,
161 int constant_pool_map_length,
162 TRAPS) {
163 // Initialized the resolved object cache.
164 int map_length = reference_map.length();
165 if (map_length > 0) {
166 // Only need mapping back to constant pool entries. The map isn't used for
167 // invokedynamic resolved_reference entries. For invokedynamic entries,
168 // the constant pool cache index has the mapping back to both the constant
169 // pool and to the resolved reference index.
170 if (constant_pool_map_length > 0) {
171 Array<u2>* om = MetadataFactory::new_array<u2>(loader_data, constant_pool_map_length, CHECK);
172
173 for (int i = 0; i < constant_pool_map_length; i++) {
174 int x = reference_map.at(i);
175 assert(x == (int)(jushort) x, "klass index is too big");
176 om->at_put(i, (jushort)x);
177 }
178 set_reference_map(om);
179 }
180
181 // Create Java array for holding resolved strings, methodHandles,
182 // methodTypes, invokedynamic and invokehandle appendix objects, etc.
183 objArrayOop stom = oopFactory::new_objArray(SystemDictionary::Object_klass(), map_length, CHECK);
184 Handle refs_handle (THREAD, (oop)stom); // must handleize.
185 set_resolved_references(loader_data->add_handle(refs_handle));
186 }
187 }
188
189 void ConstantPool::allocate_resolved_klasses(ClassLoaderData* loader_data, int num_klasses, TRAPS) {
190 // A ConstantPool can't possibly have 0xffff valid class entries,
191 // because entry #0 must be CONSTANT_Invalid, and each class entry must refer to a UTF8
192 // entry for the class's name. So at most we will have 0xfffe class entries.
193 // This allows us to use 0xffff (ConstantPool::_temp_resolved_klass_index) to indicate
194 // UnresolvedKlass entries that are temporarily created during class redefinition.
195 assert(num_klasses < CPKlassSlot::_temp_resolved_klass_index, "sanity");
196 assert(resolved_klasses() == NULL, "sanity");
197 Array<Klass*>* rk = MetadataFactory::new_array<Klass*>(loader_data, num_klasses, CHECK);
198 set_resolved_klasses(rk);
199 }
200
201 void ConstantPool::initialize_unresolved_klasses(ClassLoaderData* loader_data, TRAPS) {
202 int len = length();
203 int num_klasses = 0;
204 for (int i = 1; i <len; i++) {
205 switch (tag_at(i).value()) {
206 case JVM_CONSTANT_ClassIndex:
207 {
208 const int class_index = klass_index_at(i);
209 unresolved_klass_at_put(i, class_index, num_klasses++);
210 }
211 break;
212 #ifndef PRODUCT
213 case JVM_CONSTANT_Class:
214 case JVM_CONSTANT_UnresolvedClass:
215 case JVM_CONSTANT_UnresolvedClassInError:
216 // All of these should have been reverted back to ClassIndex before calling
217 // this function.
218 ShouldNotReachHere();
219 #endif
220 }
221 }
222 allocate_resolved_klasses(loader_data, num_klasses, THREAD);
223 }
224
225 // Unsafe anonymous class support:
226 void ConstantPool::klass_at_put(int class_index, int name_index, int resolved_klass_index, Klass* k, Symbol* name) {
227 assert(is_within_bounds(class_index), "index out of bounds");
228 assert(is_within_bounds(name_index), "index out of bounds");
229 assert((resolved_klass_index & 0xffff0000) == 0, "must be");
230 *int_at_addr(class_index) =
231 build_int_from_shorts((jushort)resolved_klass_index, (jushort)name_index);
232
233 symbol_at_put(name_index, name);
234 name->increment_refcount();
235 Klass** adr = resolved_klasses()->adr_at(resolved_klass_index);
236 OrderAccess::release_store(adr, k);
237
238 // The interpreter assumes when the tag is stored, the klass is resolved
239 // and the Klass* non-NULL, so we need hardware store ordering here.
240 if (k != NULL) {
241 release_tag_at_put(class_index, JVM_CONSTANT_Class);
242 } else {
243 release_tag_at_put(class_index, JVM_CONSTANT_UnresolvedClass);
244 }
245 }
246
247 // Unsafe anonymous class support:
248 void ConstantPool::klass_at_put(int class_index, Klass* k) {
249 assert(k != NULL, "must be valid klass");
250 CPKlassSlot kslot = klass_slot_at(class_index);
251 int resolved_klass_index = kslot.resolved_klass_index();
252 Klass** adr = resolved_klasses()->adr_at(resolved_klass_index);
253 OrderAccess::release_store(adr, k);
254
255 // The interpreter assumes when the tag is stored, the klass is resolved
256 // and the Klass* non-NULL, so we need hardware store ordering here.
257 release_tag_at_put(class_index, JVM_CONSTANT_Class);
258 }
259
260 #if INCLUDE_CDS_JAVA_HEAP
261 // Archive the resolved references
262 void ConstantPool::archive_resolved_references(Thread* THREAD) {
263 if (_cache == NULL) {
264 return; // nothing to do
265 }
266
267 InstanceKlass *ik = pool_holder();
268 if (!(ik->is_shared_boot_class() || ik->is_shared_platform_class() ||
269 ik->is_shared_app_class())) {
270 // Archiving resolved references for classes from non-builtin loaders
271 // is not yet supported.
272 set_resolved_references(NULL);
273 return;
274 }
275
276 objArrayOop rr = resolved_references();
277 Array<u2>* ref_map = reference_map();
278 if (rr != NULL) {
279 int ref_map_len = ref_map == NULL ? 0 : ref_map->length();
280 int rr_len = rr->length();
281 for (int i = 0; i < rr_len; i++) {
282 oop p = rr->obj_at(i);
283 rr->obj_at_put(i, NULL);
284 if (p != NULL && i < ref_map_len) {
285 int index = object_to_cp_index(i);
286 // Skip the entry if the string hash code is 0 since the string
287 // is not included in the shared string_table, see StringTable::copy_shared_string.
288 if (tag_at(index).is_string() && java_lang_String::hash_code(p) != 0) {
289 oop op = StringTable::create_archived_string(p, THREAD);
290 // If the String object is not archived (possibly too large),
291 // NULL is returned. Also set it in the array, so we won't
292 // have a 'bad' reference in the archived resolved_reference
293 // array.
294 rr->obj_at_put(i, op);
295 }
296 }
297 }
298
299 oop archived = HeapShared::archive_heap_object(rr, THREAD);
300 // If the resolved references array is not archived (too large),
301 // the 'archived' object is NULL. No need to explicitly check
302 // the return value of archive_heap_object here. At runtime, the
303 // resolved references will be created using the normal process
304 // when there is no archived value.
305 _cache->set_archived_references(archived);
306 set_resolved_references(NULL);
307 }
308 }
309
310 void ConstantPool::resolve_class_constants(TRAPS) {
311 assert(DumpSharedSpaces, "used during dump time only");
312 // The _cache may be NULL if the _pool_holder klass fails verification
313 // at dump time due to missing dependencies.
314 if (cache() == NULL || reference_map() == NULL) {
315 return; // nothing to do
316 }
317
318 constantPoolHandle cp(THREAD, this);
319 for (int index = 1; index < length(); index++) { // Index 0 is unused
320 if (tag_at(index).is_string() && !cp->is_pseudo_string_at(index)) {
321 int cache_index = cp->cp_to_object_index(index);
322 string_at_impl(cp, index, cache_index, CHECK);
323 }
324 }
325 }
326 #endif
327
328 // CDS support. Create a new resolved_references array.
329 void ConstantPool::restore_unshareable_info(TRAPS) {
330 assert(is_constantPool(), "ensure C++ vtable is restored");
331 assert(on_stack(), "should always be set for shared constant pools");
332 assert(is_shared(), "should always be set for shared constant pools");
333 assert(_cache != NULL, "constant pool _cache should not be NULL");
334
335 // Only create the new resolved references array if it hasn't been attempted before
336 if (resolved_references() != NULL) return;
337
338 // restore the C++ vtable from the shared archive
339 restore_vtable();
340
341 if (SystemDictionary::Object_klass_loaded()) {
342 ClassLoaderData* loader_data = pool_holder()->class_loader_data();
343 #if INCLUDE_CDS_JAVA_HEAP
344 if (HeapShared::open_archive_heap_region_mapped() &&
345 _cache->archived_references() != NULL) {
346 oop archived = _cache->archived_references();
347 // Create handle for the archived resolved reference array object
348 Handle refs_handle(THREAD, archived);
349 set_resolved_references(loader_data->add_handle(refs_handle));
350 } else
351 #endif
352 {
353 // No mapped archived resolved reference array
354 // Recreate the object array and add to ClassLoaderData.
355 int map_length = resolved_reference_length();
356 if (map_length > 0) {
357 objArrayOop stom = oopFactory::new_objArray(SystemDictionary::Object_klass(), map_length, CHECK);
358 Handle refs_handle(THREAD, (oop)stom); // must handleize.
359 set_resolved_references(loader_data->add_handle(refs_handle));
360 }
361 }
362 }
363 }
364
365 void ConstantPool::remove_unshareable_info() {
366 // Resolved references are not in the shared archive.
367 // Save the length for restoration. It is not necessarily the same length
368 // as reference_map.length() if invokedynamic is saved. It is needed when
369 // re-creating the resolved reference array if archived heap data cannot be map
370 // at runtime.
371 set_resolved_reference_length(
372 resolved_references() != NULL ? resolved_references()->length() : 0);
373
374 // If archiving heap objects is not allowed, clear the resolved references.
375 // Otherwise, it is cleared after the resolved references array is cached
376 // (see archive_resolved_references()).
377 if (!HeapShared::is_heap_object_archiving_allowed()) {
378 set_resolved_references(NULL);
379 }
380
381 // Shared ConstantPools are in the RO region, so the _flags cannot be modified.
382 // The _on_stack flag is used to prevent ConstantPools from deallocation during
383 // class redefinition. Since shared ConstantPools cannot be deallocated anyway,
384 // we always set _on_stack to true to avoid having to change _flags during runtime.
385 _flags |= (_on_stack | _is_shared);
386 int num_klasses = 0;
387 for (int index = 1; index < length(); index++) { // Index 0 is unused
388 assert(!tag_at(index).is_unresolved_klass_in_error(), "This must not happen during dump time");
389 if (tag_at(index).is_klass()) {
390 // This class was resolved as a side effect of executing Java code
391 // during dump time. We need to restore it back to an UnresolvedClass,
392 // so that the proper class loading and initialization can happen
393 // at runtime.
394 CPKlassSlot kslot = klass_slot_at(index);
395 int resolved_klass_index = kslot.resolved_klass_index();
396 int name_index = kslot.name_index();
397 assert(tag_at(name_index).is_symbol(), "sanity");
398 resolved_klasses()->at_put(resolved_klass_index, NULL);
399 tag_at_put(index, JVM_CONSTANT_UnresolvedClass);
400 assert(klass_name_at(index) == symbol_at(name_index), "sanity");
401 }
402 }
403 if (cache() != NULL) {
404 cache()->remove_unshareable_info();
405 }
406 }
407
408 int ConstantPool::cp_to_object_index(int cp_index) {
409 // this is harder don't do this so much.
410 int i = reference_map()->find(cp_index);
411 // We might not find the index for jsr292 call.
412 return (i < 0) ? _no_index_sentinel : i;
413 }
414
415 void ConstantPool::string_at_put(int which, int obj_index, oop str) {
416 resolved_references()->obj_at_put(obj_index, str);
417 }
418
419 void ConstantPool::trace_class_resolution(const constantPoolHandle& this_cp, Klass* k) {
420 ResourceMark rm;
421 int line_number = -1;
422 const char * source_file = NULL;
423 if (JavaThread::current()->has_last_Java_frame()) {
424 // try to identify the method which called this function.
425 vframeStream vfst(JavaThread::current());
426 if (!vfst.at_end()) {
427 line_number = vfst.method()->line_number_from_bci(vfst.bci());
428 Symbol* s = vfst.method()->method_holder()->source_file_name();
429 if (s != NULL) {
430 source_file = s->as_C_string();
431 }
432 }
433 }
434 if (k != this_cp->pool_holder()) {
435 // only print something if the classes are different
436 if (source_file != NULL) {
437 log_debug(class, resolve)("%s %s %s:%d",
438 this_cp->pool_holder()->external_name(),
439 k->external_name(), source_file, line_number);
440 } else {
441 log_debug(class, resolve)("%s %s",
442 this_cp->pool_holder()->external_name(),
443 k->external_name());
444 }
445 }
446 }
447
448 Klass* ConstantPool::klass_at_impl(const constantPoolHandle& this_cp, int which,
449 bool save_resolution_error, TRAPS) {
450 assert(THREAD->is_Java_thread(), "must be a Java thread");
451
452 // A resolved constantPool entry will contain a Klass*, otherwise a Symbol*.
453 // It is not safe to rely on the tag bit's here, since we don't have a lock, and
454 // the entry and tag is not updated atomicly.
455 CPKlassSlot kslot = this_cp->klass_slot_at(which);
456 int resolved_klass_index = kslot.resolved_klass_index();
457 int name_index = kslot.name_index();
458 assert(this_cp->tag_at(name_index).is_symbol(), "sanity");
459
460 Klass* klass = this_cp->resolved_klasses()->at(resolved_klass_index);
461 if (klass != NULL) {
462 return klass;
463 }
464
465 // This tag doesn't change back to unresolved class unless at a safepoint.
466 if (this_cp->tag_at(which).is_unresolved_klass_in_error()) {
467 // The original attempt to resolve this constant pool entry failed so find the
468 // class of the original error and throw another error of the same class
469 // (JVMS 5.4.3).
470 // If there is a detail message, pass that detail message to the error.
471 // The JVMS does not strictly require us to duplicate the same detail message,
472 // or any internal exception fields such as cause or stacktrace. But since the
473 // detail message is often a class name or other literal string, we will repeat it
474 // if we can find it in the symbol table.
475 throw_resolution_error(this_cp, which, CHECK_0);
476 ShouldNotReachHere();
477 }
478
479 Handle mirror_handle;
480 Symbol* name = this_cp->symbol_at(name_index);
481 Handle loader (THREAD, this_cp->pool_holder()->class_loader());
482 Handle protection_domain (THREAD, this_cp->pool_holder()->protection_domain());
483 Klass* k = SystemDictionary::resolve_or_fail(name, loader, protection_domain, true, THREAD);
484 if (!HAS_PENDING_EXCEPTION) {
485 // preserve the resolved klass from unloading
486 mirror_handle = Handle(THREAD, k->java_mirror());
487 // Do access check for klasses
488 verify_constant_pool_resolve(this_cp, k, THREAD);
489 }
490
491 // Failed to resolve class. We must record the errors so that subsequent attempts
492 // to resolve this constant pool entry fail with the same error (JVMS 5.4.3).
493 if (HAS_PENDING_EXCEPTION) {
494 if (save_resolution_error) {
495 save_and_throw_exception(this_cp, which, constantTag(JVM_CONSTANT_UnresolvedClass), CHECK_NULL);
496 // If CHECK_NULL above doesn't return the exception, that means that
497 // some other thread has beaten us and has resolved the class.
498 // To preserve old behavior, we return the resolved class.
499 klass = this_cp->resolved_klasses()->at(resolved_klass_index);
500 assert(klass != NULL, "must be resolved if exception was cleared");
501 return klass;
502 } else {
503 return NULL; // return the pending exception
504 }
505 }
506
507 // Make this class loader depend upon the class loader owning the class reference
508 ClassLoaderData* this_key = this_cp->pool_holder()->class_loader_data();
509 this_key->record_dependency(k);
510
511 // logging for class+resolve.
512 if (log_is_enabled(Debug, class, resolve)){
513 trace_class_resolution(this_cp, k);
514 }
515 Klass** adr = this_cp->resolved_klasses()->adr_at(resolved_klass_index);
516 OrderAccess::release_store(adr, k);
517 // The interpreter assumes when the tag is stored, the klass is resolved
518 // and the Klass* stored in _resolved_klasses is non-NULL, so we need
519 // hardware store ordering here.
520 this_cp->release_tag_at_put(which, JVM_CONSTANT_Class);
521 return k;
522 }
523
524
525 // Does not update ConstantPool* - to avoid any exception throwing. Used
526 // by compiler and exception handling. Also used to avoid classloads for
527 // instanceof operations. Returns NULL if the class has not been loaded or
528 // if the verification of constant pool failed
529 Klass* ConstantPool::klass_at_if_loaded(const constantPoolHandle& this_cp, int which) {
530 CPKlassSlot kslot = this_cp->klass_slot_at(which);
531 int resolved_klass_index = kslot.resolved_klass_index();
532 int name_index = kslot.name_index();
533 assert(this_cp->tag_at(name_index).is_symbol(), "sanity");
534
535 Klass* k = this_cp->resolved_klasses()->at(resolved_klass_index);
536 if (k != NULL) {
537 return k;
538 } else {
539 Thread *thread = Thread::current();
540 Symbol* name = this_cp->symbol_at(name_index);
541 oop loader = this_cp->pool_holder()->class_loader();
542 oop protection_domain = this_cp->pool_holder()->protection_domain();
543 Handle h_prot (thread, protection_domain);
544 Handle h_loader (thread, loader);
545 Klass* k = SystemDictionary::find(name, h_loader, h_prot, thread);
546
547 if (k != NULL) {
548 // Make sure that resolving is legal
549 EXCEPTION_MARK;
550 // return NULL if verification fails
551 verify_constant_pool_resolve(this_cp, k, THREAD);
552 if (HAS_PENDING_EXCEPTION) {
553 CLEAR_PENDING_EXCEPTION;
554 return NULL;
555 }
556 return k;
557 } else {
558 return k;
559 }
560 }
561 }
562
563 Method* ConstantPool::method_at_if_loaded(const constantPoolHandle& cpool,
564 int which) {
565 if (cpool->cache() == NULL) return NULL; // nothing to load yet
566 int cache_index = decode_cpcache_index(which, true);
567 if (!(cache_index >= 0 && cache_index < cpool->cache()->length())) {
568 // FIXME: should be an assert
569 log_debug(class, resolve)("bad operand %d in:", which); cpool->print();
570 return NULL;
571 }
572 ConstantPoolCacheEntry* e = cpool->cache()->entry_at(cache_index);
573 return e->method_if_resolved(cpool);
574 }
575
576
577 bool ConstantPool::has_appendix_at_if_loaded(const constantPoolHandle& cpool, int which) {
578 if (cpool->cache() == NULL) return false; // nothing to load yet
579 int cache_index = decode_cpcache_index(which, true);
580 ConstantPoolCacheEntry* e = cpool->cache()->entry_at(cache_index);
581 return e->has_appendix();
582 }
583
584 oop ConstantPool::appendix_at_if_loaded(const constantPoolHandle& cpool, int which) {
585 if (cpool->cache() == NULL) return NULL; // nothing to load yet
586 int cache_index = decode_cpcache_index(which, true);
587 ConstantPoolCacheEntry* e = cpool->cache()->entry_at(cache_index);
588 return e->appendix_if_resolved(cpool);
589 }
590
591
592 bool ConstantPool::has_method_type_at_if_loaded(const constantPoolHandle& cpool, int which) {
593 if (cpool->cache() == NULL) return false; // nothing to load yet
594 int cache_index = decode_cpcache_index(which, true);
595 ConstantPoolCacheEntry* e = cpool->cache()->entry_at(cache_index);
596 return e->has_method_type();
597 }
598
599 oop ConstantPool::method_type_at_if_loaded(const constantPoolHandle& cpool, int which) {
600 if (cpool->cache() == NULL) return NULL; // nothing to load yet
601 int cache_index = decode_cpcache_index(which, true);
602 ConstantPoolCacheEntry* e = cpool->cache()->entry_at(cache_index);
603 return e->method_type_if_resolved(cpool);
604 }
605
606
607 Symbol* ConstantPool::impl_name_ref_at(int which, bool uncached) {
608 int name_index = name_ref_index_at(impl_name_and_type_ref_index_at(which, uncached));
609 return symbol_at(name_index);
610 }
611
612
613 Symbol* ConstantPool::impl_signature_ref_at(int which, bool uncached) {
614 int signature_index = signature_ref_index_at(impl_name_and_type_ref_index_at(which, uncached));
615 return symbol_at(signature_index);
616 }
617
618 int ConstantPool::impl_name_and_type_ref_index_at(int which, bool uncached) {
619 int i = which;
620 if (!uncached && cache() != NULL) {
621 if (ConstantPool::is_invokedynamic_index(which)) {
622 // Invokedynamic index is index into the constant pool cache
623 int pool_index = invokedynamic_cp_cache_entry_at(which)->constant_pool_index();
624 pool_index = invoke_dynamic_name_and_type_ref_index_at(pool_index);
625 assert(tag_at(pool_index).is_name_and_type(), "");
626 return pool_index;
627 }
628 // change byte-ordering and go via cache
629 i = remap_instruction_operand_from_cache(which);
630 } else {
631 if (tag_at(which).is_invoke_dynamic() ||
632 tag_at(which).is_dynamic_constant() ||
633 tag_at(which).is_dynamic_constant_in_error()) {
634 int pool_index = invoke_dynamic_name_and_type_ref_index_at(which);
635 assert(tag_at(pool_index).is_name_and_type(), "");
636 return pool_index;
637 }
638 }
639 assert(tag_at(i).is_field_or_method(), "Corrupted constant pool");
640 assert(!tag_at(i).is_invoke_dynamic() &&
641 !tag_at(i).is_dynamic_constant() &&
642 !tag_at(i).is_dynamic_constant_in_error(), "Must be handled above");
643 jint ref_index = *int_at_addr(i);
644 return extract_high_short_from_int(ref_index);
645 }
646
647 constantTag ConstantPool::impl_tag_ref_at(int which, bool uncached) {
648 int pool_index = which;
649 if (!uncached && cache() != NULL) {
650 if (ConstantPool::is_invokedynamic_index(which)) {
651 // Invokedynamic index is index into resolved_references
652 pool_index = invokedynamic_cp_cache_entry_at(which)->constant_pool_index();
653 } else {
654 // change byte-ordering and go via cache
655 pool_index = remap_instruction_operand_from_cache(which);
656 }
657 }
658 return tag_at(pool_index);
659 }
660
661 int ConstantPool::impl_klass_ref_index_at(int which, bool uncached) {
662 guarantee(!ConstantPool::is_invokedynamic_index(which),
663 "an invokedynamic instruction does not have a klass");
664 int i = which;
665 if (!uncached && cache() != NULL) {
666 // change byte-ordering and go via cache
667 i = remap_instruction_operand_from_cache(which);
668 }
669 assert(tag_at(i).is_field_or_method(), "Corrupted constant pool");
670 jint ref_index = *int_at_addr(i);
671 return extract_low_short_from_int(ref_index);
672 }
673
674
675
676 int ConstantPool::remap_instruction_operand_from_cache(int operand) {
677 int cpc_index = operand;
678 DEBUG_ONLY(cpc_index -= CPCACHE_INDEX_TAG);
679 assert((int)(u2)cpc_index == cpc_index, "clean u2");
680 int member_index = cache()->entry_at(cpc_index)->constant_pool_index();
681 return member_index;
682 }
683
684
685 void ConstantPool::verify_constant_pool_resolve(const constantPoolHandle& this_cp, Klass* k, TRAPS) {
686 if (!(k->is_instance_klass() || k->is_objArray_klass())) {
687 return; // short cut, typeArray klass is always accessible
688 }
689 Klass* holder = this_cp->pool_holder();
690 bool fold_type_to_class = true;
691 LinkResolver::check_klass_accessability(holder, k, fold_type_to_class, CHECK);
692 }
693
694
695 int ConstantPool::name_ref_index_at(int which_nt) {
696 jint ref_index = name_and_type_at(which_nt);
697 return extract_low_short_from_int(ref_index);
698 }
699
700
701 int ConstantPool::signature_ref_index_at(int which_nt) {
702 jint ref_index = name_and_type_at(which_nt);
703 return extract_high_short_from_int(ref_index);
704 }
705
706
707 Klass* ConstantPool::klass_ref_at(int which, TRAPS) {
708 return klass_at(klass_ref_index_at(which), THREAD);
709 }
710
711 Symbol* ConstantPool::klass_name_at(int which) const {
712 return symbol_at(klass_slot_at(which).name_index());
713 }
714
715 Symbol* ConstantPool::klass_ref_at_noresolve(int which) {
716 jint ref_index = klass_ref_index_at(which);
717 return klass_at_noresolve(ref_index);
718 }
719
720 Symbol* ConstantPool::uncached_klass_ref_at_noresolve(int which) {
721 jint ref_index = uncached_klass_ref_index_at(which);
722 return klass_at_noresolve(ref_index);
723 }
724
725 char* ConstantPool::string_at_noresolve(int which) {
726 return unresolved_string_at(which)->as_C_string();
727 }
728
729 BasicType ConstantPool::basic_type_for_signature_at(int which) const {
730 return FieldType::basic_type(symbol_at(which));
731 }
732
733
734 void ConstantPool::resolve_string_constants_impl(const constantPoolHandle& this_cp, TRAPS) {
735 for (int index = 1; index < this_cp->length(); index++) { // Index 0 is unused
736 if (this_cp->tag_at(index).is_string()) {
737 this_cp->string_at(index, CHECK);
738 }
739 }
740 }
741
742 Symbol* ConstantPool::exception_message(const constantPoolHandle& this_cp, int which, constantTag tag, oop pending_exception) {
743 // Dig out the detailed message to reuse if possible
744 Symbol* message = java_lang_Throwable::detail_message(pending_exception);
745 if (message != NULL) {
746 return message;
747 }
748
749 // Return specific message for the tag
750 switch (tag.value()) {
751 case JVM_CONSTANT_UnresolvedClass:
752 // return the class name in the error message
753 message = this_cp->klass_name_at(which);
754 break;
755 case JVM_CONSTANT_MethodHandle:
756 // return the method handle name in the error message
757 message = this_cp->method_handle_name_ref_at(which);
758 break;
759 case JVM_CONSTANT_MethodType:
760 // return the method type signature in the error message
761 message = this_cp->method_type_signature_at(which);
762 break;
763 default:
764 ShouldNotReachHere();
765 }
766
767 return message;
768 }
769
770 void ConstantPool::throw_resolution_error(const constantPoolHandle& this_cp, int which, TRAPS) {
771 Symbol* message = NULL;
772 Symbol* error = SystemDictionary::find_resolution_error(this_cp, which, &message);
773 assert(error != NULL, "checking");
774 CLEAR_PENDING_EXCEPTION;
775 if (message != NULL) {
776 ResourceMark rm;
777 THROW_MSG(error, message->as_C_string());
778 } else {
779 THROW(error);
780 }
781 }
782
783 // If resolution for Class, Dynamic constant, MethodHandle or MethodType fails, save the
784 // exception in the resolution error table, so that the same exception is thrown again.
785 void ConstantPool::save_and_throw_exception(const constantPoolHandle& this_cp, int which,
786 constantTag tag, TRAPS) {
787 Symbol* error = PENDING_EXCEPTION->klass()->name();
788
789 int error_tag = tag.error_value();
790
791 if (!PENDING_EXCEPTION->
792 is_a(SystemDictionary::LinkageError_klass())) {
793 // Just throw the exception and don't prevent these classes from
794 // being loaded due to virtual machine errors like StackOverflow
795 // and OutOfMemoryError, etc, or if the thread was hit by stop()
796 // Needs clarification to section 5.4.3 of the VM spec (see 6308271)
797 } else if (this_cp->tag_at(which).value() != error_tag) {
798 Symbol* message = exception_message(this_cp, which, tag, PENDING_EXCEPTION);
799 SystemDictionary::add_resolution_error(this_cp, which, error, message);
800 // CAS in the tag. If a thread beat us to registering this error that's fine.
801 // If another thread resolved the reference, this is a race condition. This
802 // thread may have had a security manager or something temporary.
803 // This doesn't deterministically get an error. So why do we save this?
804 // We save this because jvmti can add classes to the bootclass path after
805 // this error, so it needs to get the same error if the error is first.
806 jbyte old_tag = Atomic::cmpxchg((jbyte)error_tag,
807 (jbyte*)this_cp->tag_addr_at(which), (jbyte)tag.value());
808 if (old_tag != error_tag && old_tag != tag.value()) {
809 // MethodHandles and MethodType doesn't change to resolved version.
810 assert(this_cp->tag_at(which).is_klass(), "Wrong tag value");
811 // Forget the exception and use the resolved class.
812 CLEAR_PENDING_EXCEPTION;
813 }
814 } else {
815 // some other thread put this in error state
816 throw_resolution_error(this_cp, which, CHECK);
817 }
818 }
819
820 constantTag ConstantPool::constant_tag_at(int which) {
821 constantTag tag = tag_at(which);
822 if (tag.is_dynamic_constant() ||
823 tag.is_dynamic_constant_in_error()) {
824 // have to look at the signature for this one
825 Symbol* constant_type = uncached_signature_ref_at(which);
826 return constantTag::ofBasicType(FieldType::basic_type(constant_type));
827 }
828 return tag;
829 }
830
831 BasicType ConstantPool::basic_type_for_constant_at(int which) {
832 constantTag tag = tag_at(which);
833 if (tag.is_dynamic_constant() ||
834 tag.is_dynamic_constant_in_error()) {
835 // have to look at the signature for this one
836 Symbol* constant_type = uncached_signature_ref_at(which);
837 return FieldType::basic_type(constant_type);
838 }
839 return tag.basic_type();
840 }
841
842 // Called to resolve constants in the constant pool and return an oop.
843 // Some constant pool entries cache their resolved oop. This is also
844 // called to create oops from constants to use in arguments for invokedynamic
845 oop ConstantPool::resolve_constant_at_impl(const constantPoolHandle& this_cp,
846 int index, int cache_index,
847 bool* status_return, TRAPS) {
848 oop result_oop = NULL;
849 Handle throw_exception;
850
851 if (cache_index == _possible_index_sentinel) {
852 // It is possible that this constant is one which is cached in the objects.
853 // We'll do a linear search. This should be OK because this usage is rare.
854 // FIXME: If bootstrap specifiers stress this code, consider putting in
855 // a reverse index. Binary search over a short array should do it.
856 assert(index > 0, "valid index");
857 cache_index = this_cp->cp_to_object_index(index);
858 }
859 assert(cache_index == _no_index_sentinel || cache_index >= 0, "");
860 assert(index == _no_index_sentinel || index >= 0, "");
861
862 if (cache_index >= 0) {
863 result_oop = this_cp->resolved_references()->obj_at(cache_index);
864 if (result_oop != NULL) {
865 if (oopDesc::equals(result_oop, Universe::the_null_sentinel())) {
866 DEBUG_ONLY(int temp_index = (index >= 0 ? index : this_cp->object_to_cp_index(cache_index)));
867 assert(this_cp->tag_at(temp_index).is_dynamic_constant(), "only condy uses the null sentinel");
868 result_oop = NULL;
869 }
870 if (status_return != NULL) (*status_return) = true;
871 return result_oop;
872 // That was easy...
873 }
874 index = this_cp->object_to_cp_index(cache_index);
875 }
876
877 jvalue prim_value; // temp used only in a few cases below
878
879 constantTag tag = this_cp->tag_at(index);
880
881 if (status_return != NULL) {
882 // don't trigger resolution if the constant might need it
883 switch (tag.value()) {
884 case JVM_CONSTANT_Class:
885 {
886 CPKlassSlot kslot = this_cp->klass_slot_at(index);
887 int resolved_klass_index = kslot.resolved_klass_index();
888 if (this_cp->resolved_klasses()->at(resolved_klass_index) == NULL) {
889 (*status_return) = false;
890 return NULL;
891 }
892 // the klass is waiting in the CP; go get it
893 break;
894 }
895 case JVM_CONSTANT_String:
896 case JVM_CONSTANT_Integer:
897 case JVM_CONSTANT_Float:
898 case JVM_CONSTANT_Long:
899 case JVM_CONSTANT_Double:
900 // these guys trigger OOM at worst
901 break;
902 default:
903 (*status_return) = false;
904 return NULL;
905 }
906 // from now on there is either success or an OOME
907 (*status_return) = true;
908 }
909
910 switch (tag.value()) {
911
912 case JVM_CONSTANT_UnresolvedClass:
913 case JVM_CONSTANT_UnresolvedClassInError:
914 case JVM_CONSTANT_Class:
915 {
916 assert(cache_index == _no_index_sentinel, "should not have been set");
917 Klass* resolved = klass_at_impl(this_cp, index, true, CHECK_NULL);
918 // ldc wants the java mirror.
919 result_oop = resolved->java_mirror();
920 break;
921 }
922
923 case JVM_CONSTANT_Dynamic:
924 {
925 Klass* current_klass = this_cp->pool_holder();
926 Symbol* constant_name = this_cp->uncached_name_ref_at(index);
927 Symbol* constant_type = this_cp->uncached_signature_ref_at(index);
928
929 // The initial step in resolving an unresolved symbolic reference to a
930 // dynamically-computed constant is to resolve the symbolic reference to a
931 // method handle which will be the bootstrap method for the dynamically-computed
932 // constant. If resolution of the java.lang.invoke.MethodHandle for the bootstrap
933 // method fails, then a MethodHandleInError is stored at the corresponding
934 // bootstrap method's CP index for the CONSTANT_MethodHandle_info. No need to
935 // set a DynamicConstantInError here since any subsequent use of this
936 // bootstrap method will encounter the resolution of MethodHandleInError.
937 oop bsm_info = this_cp->resolve_bootstrap_specifier_at(index, THREAD);
938 Exceptions::wrap_dynamic_exception(CHECK_NULL);
939 assert(bsm_info != NULL, "");
940 // FIXME: Cache this once per BootstrapMethods entry, not once per CONSTANT_Dynamic.
941 Handle bootstrap_specifier = Handle(THREAD, bsm_info);
942
943 // Resolve the Dynamically-Computed constant to invoke the BSM in order to obtain the resulting oop.
944 Handle value = SystemDictionary::link_dynamic_constant(current_klass,
945 index,
946 bootstrap_specifier,
947 constant_name,
948 constant_type,
949 THREAD);
950 result_oop = value();
951 Exceptions::wrap_dynamic_exception(THREAD);
952 if (HAS_PENDING_EXCEPTION) {
953 // Resolution failure of the dynamically-computed constant, save_and_throw_exception
954 // will check for a LinkageError and store a DynamicConstantInError.
955 save_and_throw_exception(this_cp, index, tag, CHECK_NULL);
956 }
957 BasicType type = FieldType::basic_type(constant_type);
958 if (!is_reference_type(type)) {
959 // Make sure the primitive value is properly boxed.
960 // This is a JDK responsibility.
961 const char* fail = NULL;
962 if (result_oop == NULL) {
963 fail = "null result instead of box";
964 } else if (!is_java_primitive(type)) {
965 // FIXME: support value types via unboxing
966 fail = "can only handle references and primitives";
967 } else if (!java_lang_boxing_object::is_instance(result_oop, type)) {
968 fail = "primitive is not properly boxed";
969 }
970 if (fail != NULL) {
971 // Since this exception is not a LinkageError, throw exception
972 // but do not save a DynamicInError resolution result.
973 // See section 5.4.3 of the VM spec.
974 THROW_MSG_NULL(vmSymbols::java_lang_InternalError(), fail);
975 }
976 }
977 break;
978 }
979
980 case JVM_CONSTANT_String:
981 assert(cache_index != _no_index_sentinel, "should have been set");
982 if (this_cp->is_pseudo_string_at(index)) {
983 result_oop = this_cp->pseudo_string_at(index, cache_index);
984 break;
985 }
986 result_oop = string_at_impl(this_cp, index, cache_index, CHECK_NULL);
987 break;
988
989 case JVM_CONSTANT_DynamicInError:
990 case JVM_CONSTANT_MethodHandleInError:
991 case JVM_CONSTANT_MethodTypeInError:
992 {
993 throw_resolution_error(this_cp, index, CHECK_NULL);
994 break;
995 }
996
997 case JVM_CONSTANT_MethodHandle:
998 {
999 int ref_kind = this_cp->method_handle_ref_kind_at(index);
1000 int callee_index = this_cp->method_handle_klass_index_at(index);
1001 Symbol* name = this_cp->method_handle_name_ref_at(index);
1002 Symbol* signature = this_cp->method_handle_signature_ref_at(index);
1003 constantTag m_tag = this_cp->tag_at(this_cp->method_handle_index_at(index));
1004 { ResourceMark rm(THREAD);
1005 log_debug(class, resolve)("resolve JVM_CONSTANT_MethodHandle:%d [%d/%d/%d] %s.%s",
1006 ref_kind, index, this_cp->method_handle_index_at(index),
1007 callee_index, name->as_C_string(), signature->as_C_string());
1008 }
1009
1010 Klass* callee = klass_at_impl(this_cp, callee_index, true, CHECK_NULL);
1011
1012 // Check constant pool method consistency
1013 if ((callee->is_interface() && m_tag.is_method()) ||
1014 ((!callee->is_interface() && m_tag.is_interface_method()))) {
1015 ResourceMark rm(THREAD);
1016 char buf[400];
1017 jio_snprintf(buf, sizeof(buf),
1018 "Inconsistent constant pool data in classfile for class %s. "
1019 "Method %s%s at index %d is %s and should be %s",
1020 callee->name()->as_C_string(), name->as_C_string(), signature->as_C_string(), index,
1021 callee->is_interface() ? "CONSTANT_MethodRef" : "CONSTANT_InterfaceMethodRef",
1022 callee->is_interface() ? "CONSTANT_InterfaceMethodRef" : "CONSTANT_MethodRef");
1023 THROW_MSG_NULL(vmSymbols::java_lang_IncompatibleClassChangeError(), buf);
1024 }
1025
1026 Klass* klass = this_cp->pool_holder();
1027 Handle value = SystemDictionary::link_method_handle_constant(klass, ref_kind,
1028 callee, name, signature,
1029 THREAD);
1030 result_oop = value();
1031 if (HAS_PENDING_EXCEPTION) {
1032 save_and_throw_exception(this_cp, index, tag, CHECK_NULL);
1033 }
1034 break;
1035 }
1036
1037 case JVM_CONSTANT_MethodType:
1038 {
1039 Symbol* signature = this_cp->method_type_signature_at(index);
1040 { ResourceMark rm(THREAD);
1041 log_debug(class, resolve)("resolve JVM_CONSTANT_MethodType [%d/%d] %s",
1042 index, this_cp->method_type_index_at(index),
1043 signature->as_C_string());
1044 }
1045 Klass* klass = this_cp->pool_holder();
1046 Handle value = SystemDictionary::find_method_handle_type(signature, klass, THREAD);
1047 result_oop = value();
1048 if (HAS_PENDING_EXCEPTION) {
1049 save_and_throw_exception(this_cp, index, tag, CHECK_NULL);
1050 }
1051 break;
1052 }
1053
1054 case JVM_CONSTANT_Integer:
1055 assert(cache_index == _no_index_sentinel, "should not have been set");
1056 prim_value.i = this_cp->int_at(index);
1057 result_oop = java_lang_boxing_object::create(T_INT, &prim_value, CHECK_NULL);
1058 break;
1059
1060 case JVM_CONSTANT_Float:
1061 assert(cache_index == _no_index_sentinel, "should not have been set");
1062 prim_value.f = this_cp->float_at(index);
1063 result_oop = java_lang_boxing_object::create(T_FLOAT, &prim_value, CHECK_NULL);
1064 break;
1065
1066 case JVM_CONSTANT_Long:
1067 assert(cache_index == _no_index_sentinel, "should not have been set");
1068 prim_value.j = this_cp->long_at(index);
1069 result_oop = java_lang_boxing_object::create(T_LONG, &prim_value, CHECK_NULL);
1070 break;
1071
1072 case JVM_CONSTANT_Double:
1073 assert(cache_index == _no_index_sentinel, "should not have been set");
1074 prim_value.d = this_cp->double_at(index);
1075 result_oop = java_lang_boxing_object::create(T_DOUBLE, &prim_value, CHECK_NULL);
1076 break;
1077
1078 default:
1079 DEBUG_ONLY( tty->print_cr("*** %p: tag at CP[%d/%d] = %d",
1080 this_cp(), index, cache_index, tag.value()));
1081 assert(false, "unexpected constant tag");
1082 break;
1083 }
1084
1085 if (cache_index >= 0) {
1086 // Benign race condition: resolved_references may already be filled in.
1087 // The important thing here is that all threads pick up the same result.
1088 // It doesn't matter which racing thread wins, as long as only one
1089 // result is used by all threads, and all future queries.
1090 oop new_result = (result_oop == NULL ? Universe::the_null_sentinel() : result_oop);
1091 oop old_result = this_cp->resolved_references()
1092 ->atomic_compare_exchange_oop(cache_index, new_result, NULL);
1093 if (old_result == NULL) {
1094 return result_oop; // was installed
1095 } else {
1096 // Return the winning thread's result. This can be different than
1097 // the result here for MethodHandles.
1098 if (oopDesc::equals(old_result, Universe::the_null_sentinel()))
1099 old_result = NULL;
1100 return old_result;
1101 }
1102 } else {
1103 assert(!oopDesc::equals(result_oop, Universe::the_null_sentinel()), "");
1104 return result_oop;
1105 }
1106 }
1107
1108 oop ConstantPool::uncached_string_at(int which, TRAPS) {
1109 Symbol* sym = unresolved_string_at(which);
1110 oop str = StringTable::intern(sym, CHECK_(NULL));
1111 assert(java_lang_String::is_instance(str), "must be string");
1112 return str;
1113 }
1114
1115
1116 oop ConstantPool::resolve_bootstrap_specifier_at_impl(const constantPoolHandle& this_cp, int index, TRAPS) {
1117 assert((this_cp->tag_at(index).is_invoke_dynamic() ||
1118 this_cp->tag_at(index).is_dynamic_constant()), "Corrupted constant pool");
1119 Handle bsm;
1120 int argc;
1121 {
1122 // JVM_CONSTANT_InvokeDynamic is an ordered pair of [bootm, name&mtype], plus optional arguments
1123 // JVM_CONSTANT_Dynamic is an ordered pair of [bootm, name&ftype], plus optional arguments
1124 // In both cases, the bootm, being a JVM_CONSTANT_MethodHandle, has its own cache entry.
1125 // It is accompanied by the optional arguments.
1126 int bsm_index = this_cp->invoke_dynamic_bootstrap_method_ref_index_at(index);
1127 oop bsm_oop = this_cp->resolve_possibly_cached_constant_at(bsm_index, CHECK_NULL);
1128 if (!java_lang_invoke_MethodHandle::is_instance(bsm_oop)) {
1129 THROW_MSG_NULL(vmSymbols::java_lang_LinkageError(), "BSM not an MethodHandle");
1130 }
1131
1132 // Extract the optional static arguments.
1133 argc = this_cp->invoke_dynamic_argument_count_at(index);
1134
1135 // if there are no static arguments, return the bsm by itself:
1136 if (argc == 0 && UseBootstrapCallInfo < 2) return bsm_oop;
1137
1138 bsm = Handle(THREAD, bsm_oop);
1139 }
1140
1141 // We are going to return an ordered pair of {bsm, info}, using a 2-array.
1142 objArrayHandle info;
1143 {
1144 objArrayOop info_oop = oopFactory::new_objArray(SystemDictionary::Object_klass(), 2, CHECK_NULL);
1145 info = objArrayHandle(THREAD, info_oop);
1146 }
1147
1148 info->obj_at_put(0, bsm());
1149
1150 bool use_BSCI;
1151 switch (UseBootstrapCallInfo) {
1152 default: use_BSCI = true; break; // stress mode
1153 case 0: use_BSCI = false; break; // stress mode
1154 case 1: // normal mode
1155 // If we were to support an alternative mode of BSM invocation,
1156 // we'd convert to pull mode here if the BSM could be a candidate
1157 // for that alternative mode. We can't easily test for things
1158 // like varargs here, but we can get away with approximate testing,
1159 // since the JDK runtime will make up the difference either way.
1160 // For now, exercise the pull-mode path if the BSM is of arity 2,
1161 // or if there is a potential condy loop (see below).
1162 oop mt_oop = java_lang_invoke_MethodHandle::type(bsm());
1163 use_BSCI = (java_lang_invoke_MethodType::ptype_count(mt_oop) == 2);
1164 break;
1165 }
1166
1167 // Here's a reason to use BSCI even if it wasn't requested:
1168 // If a condy uses a condy argument, we want to avoid infinite
1169 // recursion (condy loops) in the C code. It's OK in Java,
1170 // because Java has stack overflow checking, so we punt
1171 // potentially cyclic cases from C to Java.
1172 if (!use_BSCI && this_cp->tag_at(index).is_dynamic_constant()) {
1173 bool found_unresolved_condy = false;
1174 for (int i = 0; i < argc; i++) {
1175 int arg_index = this_cp->invoke_dynamic_argument_index_at(index, i);
1176 if (this_cp->tag_at(arg_index).is_dynamic_constant()) {
1177 // potential recursion point condy -> condy
1178 bool found_it = false;
1179 this_cp->find_cached_constant_at(arg_index, found_it, CHECK_NULL);
1180 if (!found_it) { found_unresolved_condy = true; break; }
1181 }
1182 }
1183 if (found_unresolved_condy)
1184 use_BSCI = true;
1185 }
1186
1187 const int SMALL_ARITY = 5;
1188 if (use_BSCI && argc <= SMALL_ARITY && UseBootstrapCallInfo <= 2) {
1189 // If there are only a few arguments, and none of them need linking,
1190 // push them, instead of asking the JDK runtime to turn around and
1191 // pull them, saving a JVM/JDK transition in some simple cases.
1192 bool all_resolved = true;
1193 for (int i = 0; i < argc; i++) {
1194 bool found_it = false;
1195 int arg_index = this_cp->invoke_dynamic_argument_index_at(index, i);
1196 this_cp->find_cached_constant_at(arg_index, found_it, CHECK_NULL);
1197 if (!found_it) { all_resolved = false; break; }
1198 }
1199 if (all_resolved)
1200 use_BSCI = false;
1201 }
1202
1203 if (!use_BSCI) {
1204 // return {bsm, {arg...}}; resolution of arguments is done immediately, before JDK code is called
1205 objArrayOop args_oop = oopFactory::new_objArray(SystemDictionary::Object_klass(), argc, CHECK_NULL);
1206 info->obj_at_put(1, args_oop); // may overwrite with args[0] below
1207 objArrayHandle args(THREAD, args_oop);
1208 copy_bootstrap_arguments_at_impl(this_cp, index, 0, argc, args, 0, true, Handle(), CHECK_NULL);
1209 if (argc == 1) {
1210 // try to discard the singleton array
1211 oop arg_oop = args->obj_at(0);
1212 if (arg_oop != NULL && !arg_oop->is_array()) {
1213 // JVM treats arrays and nulls specially in this position,
1214 // but other things are just single arguments
1215 info->obj_at_put(1, arg_oop);
1216 }
1217 }
1218 } else {
1219 // return {bsm, {arg_count, pool_index}}; JDK code must pull the arguments as needed
1220 typeArrayOop ints_oop = oopFactory::new_typeArray(T_INT, 2, CHECK_NULL);
1221 ints_oop->int_at_put(0, argc);
1222 ints_oop->int_at_put(1, index);
1223 info->obj_at_put(1, ints_oop);
1224 }
1225 return info();
1226 }
1227
1228 void ConstantPool::copy_bootstrap_arguments_at_impl(const constantPoolHandle& this_cp, int index,
1229 int start_arg, int end_arg,
1230 objArrayHandle info, int pos,
1231 bool must_resolve, Handle if_not_available,
1232 TRAPS) {
1233 int argc;
1234 int limit = pos + end_arg - start_arg;
1235 // checks: index in range [0..this_cp->length),
1236 // tag at index, start..end in range [0..argc],
1237 // info array non-null, pos..limit in [0..info.length]
1238 if ((0 >= index || index >= this_cp->length()) ||
1239 !(this_cp->tag_at(index).is_invoke_dynamic() ||
1240 this_cp->tag_at(index).is_dynamic_constant()) ||
1241 (0 > start_arg || start_arg > end_arg) ||
1242 (end_arg > (argc = this_cp->invoke_dynamic_argument_count_at(index))) ||
1243 (0 > pos || pos > limit) ||
1244 (info.is_null() || limit > info->length())) {
1245 // An index or something else went wrong; throw an error.
1246 // Since this is an internal API, we don't expect this,
1247 // so we don't bother to craft a nice message.
1248 THROW_MSG(vmSymbols::java_lang_LinkageError(), "bad BSM argument access");
1249 }
1250 // now we can loop safely
1251 int info_i = pos;
1252 for (int i = start_arg; i < end_arg; i++) {
1253 int arg_index = this_cp->invoke_dynamic_argument_index_at(index, i);
1254 oop arg_oop;
1255 if (must_resolve) {
1256 arg_oop = this_cp->resolve_possibly_cached_constant_at(arg_index, CHECK);
1257 } else {
1258 bool found_it = false;
1259 arg_oop = this_cp->find_cached_constant_at(arg_index, found_it, CHECK);
1260 if (!found_it) arg_oop = if_not_available();
1261 }
1262 info->obj_at_put(info_i++, arg_oop);
1263 }
1264 }
1265
1266 oop ConstantPool::string_at_impl(const constantPoolHandle& this_cp, int which, int obj_index, TRAPS) {
1267 // If the string has already been interned, this entry will be non-null
1268 oop str = this_cp->resolved_references()->obj_at(obj_index);
1269 assert(!oopDesc::equals(str, Universe::the_null_sentinel()), "");
1270 if (str != NULL) return str;
1271 Symbol* sym = this_cp->unresolved_string_at(which);
1272 str = StringTable::intern(sym, CHECK_(NULL));
1273 this_cp->string_at_put(which, obj_index, str);
1274 assert(java_lang_String::is_instance(str), "must be string");
1275 return str;
1276 }
1277
1278
1279 bool ConstantPool::klass_name_at_matches(const InstanceKlass* k, int which) {
1280 // Names are interned, so we can compare Symbol*s directly
1281 Symbol* cp_name = klass_name_at(which);
1282 return (cp_name == k->name());
1283 }
1284
1285
1286 // Iterate over symbols and decrement ones which are Symbol*s
1287 // This is done during GC.
1288 // Only decrement the UTF8 symbols. Strings point to
1289 // these symbols but didn't increment the reference count.
1290 void ConstantPool::unreference_symbols() {
1291 for (int index = 1; index < length(); index++) { // Index 0 is unused
1292 constantTag tag = tag_at(index);
1293 if (tag.is_symbol()) {
1294 symbol_at(index)->decrement_refcount();
1295 }
1296 }
1297 }
1298
1299
1300 // Compare this constant pool's entry at index1 to the constant pool
1301 // cp2's entry at index2.
1302 bool ConstantPool::compare_entry_to(int index1, const constantPoolHandle& cp2,
1303 int index2, TRAPS) {
1304
1305 // The error tags are equivalent to non-error tags when comparing
1306 jbyte t1 = tag_at(index1).non_error_value();
1307 jbyte t2 = cp2->tag_at(index2).non_error_value();
1308
1309 if (t1 != t2) {
1310 // Not the same entry type so there is nothing else to check. Note
1311 // that this style of checking will consider resolved/unresolved
1312 // class pairs as different.
1313 // From the ConstantPool* API point of view, this is correct
1314 // behavior. See VM_RedefineClasses::merge_constant_pools() to see how this
1315 // plays out in the context of ConstantPool* merging.
1316 return false;
1317 }
1318
1319 switch (t1) {
1320 case JVM_CONSTANT_Class:
1321 {
1322 Klass* k1 = klass_at(index1, CHECK_false);
1323 Klass* k2 = cp2->klass_at(index2, CHECK_false);
1324 if (k1 == k2) {
1325 return true;
1326 }
1327 } break;
1328
1329 case JVM_CONSTANT_ClassIndex:
1330 {
1331 int recur1 = klass_index_at(index1);
1332 int recur2 = cp2->klass_index_at(index2);
1333 bool match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
1334 if (match) {
1335 return true;
1336 }
1337 } break;
1338
1339 case JVM_CONSTANT_Double:
1340 {
1341 jdouble d1 = double_at(index1);
1342 jdouble d2 = cp2->double_at(index2);
1343 if (d1 == d2) {
1344 return true;
1345 }
1346 } break;
1347
1348 case JVM_CONSTANT_Fieldref:
1349 case JVM_CONSTANT_InterfaceMethodref:
1350 case JVM_CONSTANT_Methodref:
1351 {
1352 int recur1 = uncached_klass_ref_index_at(index1);
1353 int recur2 = cp2->uncached_klass_ref_index_at(index2);
1354 bool match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
1355 if (match) {
1356 recur1 = uncached_name_and_type_ref_index_at(index1);
1357 recur2 = cp2->uncached_name_and_type_ref_index_at(index2);
1358 match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
1359 if (match) {
1360 return true;
1361 }
1362 }
1363 } break;
1364
1365 case JVM_CONSTANT_Float:
1366 {
1367 jfloat f1 = float_at(index1);
1368 jfloat f2 = cp2->float_at(index2);
1369 if (f1 == f2) {
1370 return true;
1371 }
1372 } break;
1373
1374 case JVM_CONSTANT_Integer:
1375 {
1376 jint i1 = int_at(index1);
1377 jint i2 = cp2->int_at(index2);
1378 if (i1 == i2) {
1379 return true;
1380 }
1381 } break;
1382
1383 case JVM_CONSTANT_Long:
1384 {
1385 jlong l1 = long_at(index1);
1386 jlong l2 = cp2->long_at(index2);
1387 if (l1 == l2) {
1388 return true;
1389 }
1390 } break;
1391
1392 case JVM_CONSTANT_NameAndType:
1393 {
1394 int recur1 = name_ref_index_at(index1);
1395 int recur2 = cp2->name_ref_index_at(index2);
1396 bool match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
1397 if (match) {
1398 recur1 = signature_ref_index_at(index1);
1399 recur2 = cp2->signature_ref_index_at(index2);
1400 match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
1401 if (match) {
1402 return true;
1403 }
1404 }
1405 } break;
1406
1407 case JVM_CONSTANT_StringIndex:
1408 {
1409 int recur1 = string_index_at(index1);
1410 int recur2 = cp2->string_index_at(index2);
1411 bool match = compare_entry_to(recur1, cp2, recur2, CHECK_false);
1412 if (match) {
1413 return true;
1414 }
1415 } break;
1416
1417 case JVM_CONSTANT_UnresolvedClass:
1418 {
1419 Symbol* k1 = klass_name_at(index1);
1420 Symbol* k2 = cp2->klass_name_at(index2);
1421 if (k1 == k2) {
1422 return true;
1423 }
1424 } break;
1425
1426 case JVM_CONSTANT_MethodType:
1427 {
1428 int k1 = method_type_index_at(index1);
1429 int k2 = cp2->method_type_index_at(index2);
1430 bool match = compare_entry_to(k1, cp2, k2, CHECK_false);
1431 if (match) {
1432 return true;
1433 }
1434 } break;
1435
1436 case JVM_CONSTANT_MethodHandle:
1437 {
1438 int k1 = method_handle_ref_kind_at(index1);
1439 int k2 = cp2->method_handle_ref_kind_at(index2);
1440 if (k1 == k2) {
1441 int i1 = method_handle_index_at(index1);
1442 int i2 = cp2->method_handle_index_at(index2);
1443 bool match = compare_entry_to(i1, cp2, i2, CHECK_false);
1444 if (match) {
1445 return true;
1446 }
1447 }
1448 } break;
1449
1450 case JVM_CONSTANT_Dynamic:
1451 {
1452 int k1 = invoke_dynamic_name_and_type_ref_index_at(index1);
1453 int k2 = cp2->invoke_dynamic_name_and_type_ref_index_at(index2);
1454 int i1 = invoke_dynamic_bootstrap_specifier_index(index1);
1455 int i2 = cp2->invoke_dynamic_bootstrap_specifier_index(index2);
1456 // separate statements and variables because CHECK_false is used
1457 bool match_entry = compare_entry_to(k1, cp2, k2, CHECK_false);
1458 bool match_operand = compare_operand_to(i1, cp2, i2, CHECK_false);
1459 return (match_entry && match_operand);
1460 } break;
1461
1462 case JVM_CONSTANT_InvokeDynamic:
1463 {
1464 int k1 = invoke_dynamic_name_and_type_ref_index_at(index1);
1465 int k2 = cp2->invoke_dynamic_name_and_type_ref_index_at(index2);
1466 int i1 = invoke_dynamic_bootstrap_specifier_index(index1);
1467 int i2 = cp2->invoke_dynamic_bootstrap_specifier_index(index2);
1468 // separate statements and variables because CHECK_false is used
1469 bool match_entry = compare_entry_to(k1, cp2, k2, CHECK_false);
1470 bool match_operand = compare_operand_to(i1, cp2, i2, CHECK_false);
1471 return (match_entry && match_operand);
1472 } break;
1473
1474 case JVM_CONSTANT_String:
1475 {
1476 Symbol* s1 = unresolved_string_at(index1);
1477 Symbol* s2 = cp2->unresolved_string_at(index2);
1478 if (s1 == s2) {
1479 return true;
1480 }
1481 } break;
1482
1483 case JVM_CONSTANT_Utf8:
1484 {
1485 Symbol* s1 = symbol_at(index1);
1486 Symbol* s2 = cp2->symbol_at(index2);
1487 if (s1 == s2) {
1488 return true;
1489 }
1490 } break;
1491
1492 // Invalid is used as the tag for the second constant pool entry
1493 // occupied by JVM_CONSTANT_Double or JVM_CONSTANT_Long. It should
1494 // not be seen by itself.
1495 case JVM_CONSTANT_Invalid: // fall through
1496
1497 default:
1498 ShouldNotReachHere();
1499 break;
1500 }
1501
1502 return false;
1503 } // end compare_entry_to()
1504
1505
1506 // Resize the operands array with delta_len and delta_size.
1507 // Used in RedefineClasses for CP merge.
1508 void ConstantPool::resize_operands(int delta_len, int delta_size, TRAPS) {
1509 int old_len = operand_array_length(operands());
1510 int new_len = old_len + delta_len;
1511 int min_len = (delta_len > 0) ? old_len : new_len;
1512
1513 int old_size = operands()->length();
1514 int new_size = old_size + delta_size;
1515 int min_size = (delta_size > 0) ? old_size : new_size;
1516
1517 ClassLoaderData* loader_data = pool_holder()->class_loader_data();
1518 Array<u2>* new_ops = MetadataFactory::new_array<u2>(loader_data, new_size, CHECK);
1519
1520 // Set index in the resized array for existing elements only
1521 for (int idx = 0; idx < min_len; idx++) {
1522 int offset = operand_offset_at(idx); // offset in original array
1523 operand_offset_at_put(new_ops, idx, offset + 2*delta_len); // offset in resized array
1524 }
1525 // Copy the bootstrap specifiers only
1526 Copy::conjoint_memory_atomic(operands()->adr_at(2*old_len),
1527 new_ops->adr_at(2*new_len),
1528 (min_size - 2*min_len) * sizeof(u2));
1529 // Explicitly deallocate old operands array.
1530 // Note, it is not needed for 7u backport.
1531 if ( operands() != NULL) { // the safety check
1532 MetadataFactory::free_array<u2>(loader_data, operands());
1533 }
1534 set_operands(new_ops);
1535 } // end resize_operands()
1536
1537
1538 // Extend the operands array with the length and size of the ext_cp operands.
1539 // Used in RedefineClasses for CP merge.
1540 void ConstantPool::extend_operands(const constantPoolHandle& ext_cp, TRAPS) {
1541 int delta_len = operand_array_length(ext_cp->operands());
1542 if (delta_len == 0) {
1543 return; // nothing to do
1544 }
1545 int delta_size = ext_cp->operands()->length();
1546
1547 assert(delta_len > 0 && delta_size > 0, "extended operands array must be bigger");
1548
1549 if (operand_array_length(operands()) == 0) {
1550 ClassLoaderData* loader_data = pool_holder()->class_loader_data();
1551 Array<u2>* new_ops = MetadataFactory::new_array<u2>(loader_data, delta_size, CHECK);
1552 // The first element index defines the offset of second part
1553 operand_offset_at_put(new_ops, 0, 2*delta_len); // offset in new array
1554 set_operands(new_ops);
1555 } else {
1556 resize_operands(delta_len, delta_size, CHECK);
1557 }
1558
1559 } // end extend_operands()
1560
1561
1562 // Shrink the operands array to a smaller array with new_len length.
1563 // Used in RedefineClasses for CP merge.
1564 void ConstantPool::shrink_operands(int new_len, TRAPS) {
1565 int old_len = operand_array_length(operands());
1566 if (new_len == old_len) {
1567 return; // nothing to do
1568 }
1569 assert(new_len < old_len, "shrunken operands array must be smaller");
1570
1571 int free_base = operand_next_offset_at(new_len - 1);
1572 int delta_len = new_len - old_len;
1573 int delta_size = 2*delta_len + free_base - operands()->length();
1574
1575 resize_operands(delta_len, delta_size, CHECK);
1576
1577 } // end shrink_operands()
1578
1579
1580 void ConstantPool::copy_operands(const constantPoolHandle& from_cp,
1581 const constantPoolHandle& to_cp,
1582 TRAPS) {
1583
1584 int from_oplen = operand_array_length(from_cp->operands());
1585 int old_oplen = operand_array_length(to_cp->operands());
1586 if (from_oplen != 0) {
1587 ClassLoaderData* loader_data = to_cp->pool_holder()->class_loader_data();
1588 // append my operands to the target's operands array
1589 if (old_oplen == 0) {
1590 // Can't just reuse from_cp's operand list because of deallocation issues
1591 int len = from_cp->operands()->length();
1592 Array<u2>* new_ops = MetadataFactory::new_array<u2>(loader_data, len, CHECK);
1593 Copy::conjoint_memory_atomic(
1594 from_cp->operands()->adr_at(0), new_ops->adr_at(0), len * sizeof(u2));
1595 to_cp->set_operands(new_ops);
1596 } else {
1597 int old_len = to_cp->operands()->length();
1598 int from_len = from_cp->operands()->length();
1599 int old_off = old_oplen * sizeof(u2);
1600 int from_off = from_oplen * sizeof(u2);
1601 // Use the metaspace for the destination constant pool
1602 Array<u2>* new_operands = MetadataFactory::new_array<u2>(loader_data, old_len + from_len, CHECK);
1603 int fillp = 0, len = 0;
1604 // first part of dest
1605 Copy::conjoint_memory_atomic(to_cp->operands()->adr_at(0),
1606 new_operands->adr_at(fillp),
1607 (len = old_off) * sizeof(u2));
1608 fillp += len;
1609 // first part of src
1610 Copy::conjoint_memory_atomic(from_cp->operands()->adr_at(0),
1611 new_operands->adr_at(fillp),
1612 (len = from_off) * sizeof(u2));
1613 fillp += len;
1614 // second part of dest
1615 Copy::conjoint_memory_atomic(to_cp->operands()->adr_at(old_off),
1616 new_operands->adr_at(fillp),
1617 (len = old_len - old_off) * sizeof(u2));
1618 fillp += len;
1619 // second part of src
1620 Copy::conjoint_memory_atomic(from_cp->operands()->adr_at(from_off),
1621 new_operands->adr_at(fillp),
1622 (len = from_len - from_off) * sizeof(u2));
1623 fillp += len;
1624 assert(fillp == new_operands->length(), "");
1625
1626 // Adjust indexes in the first part of the copied operands array.
1627 for (int j = 0; j < from_oplen; j++) {
1628 int offset = operand_offset_at(new_operands, old_oplen + j);
1629 assert(offset == operand_offset_at(from_cp->operands(), j), "correct copy");
1630 offset += old_len; // every new tuple is preceded by old_len extra u2's
1631 operand_offset_at_put(new_operands, old_oplen + j, offset);
1632 }
1633
1634 // replace target operands array with combined array
1635 to_cp->set_operands(new_operands);
1636 }
1637 }
1638 } // end copy_operands()
1639
1640
1641 // Copy this constant pool's entries at start_i to end_i (inclusive)
1642 // to the constant pool to_cp's entries starting at to_i. A total of
1643 // (end_i - start_i) + 1 entries are copied.
1644 void ConstantPool::copy_cp_to_impl(const constantPoolHandle& from_cp, int start_i, int end_i,
1645 const constantPoolHandle& to_cp, int to_i, TRAPS) {
1646
1647
1648 int dest_i = to_i; // leave original alone for debug purposes
1649
1650 for (int src_i = start_i; src_i <= end_i; /* see loop bottom */ ) {
1651 copy_entry_to(from_cp, src_i, to_cp, dest_i, CHECK);
1652
1653 switch (from_cp->tag_at(src_i).value()) {
1654 case JVM_CONSTANT_Double:
1655 case JVM_CONSTANT_Long:
1656 // double and long take two constant pool entries
1657 src_i += 2;
1658 dest_i += 2;
1659 break;
1660
1661 default:
1662 // all others take one constant pool entry
1663 src_i++;
1664 dest_i++;
1665 break;
1666 }
1667 }
1668 copy_operands(from_cp, to_cp, CHECK);
1669
1670 } // end copy_cp_to_impl()
1671
1672
1673 // Copy this constant pool's entry at from_i to the constant pool
1674 // to_cp's entry at to_i.
1675 void ConstantPool::copy_entry_to(const constantPoolHandle& from_cp, int from_i,
1676 const constantPoolHandle& to_cp, int to_i,
1677 TRAPS) {
1678
1679 int tag = from_cp->tag_at(from_i).value();
1680 switch (tag) {
1681 case JVM_CONSTANT_ClassIndex:
1682 {
1683 jint ki = from_cp->klass_index_at(from_i);
1684 to_cp->klass_index_at_put(to_i, ki);
1685 } break;
1686
1687 case JVM_CONSTANT_Double:
1688 {
1689 jdouble d = from_cp->double_at(from_i);
1690 to_cp->double_at_put(to_i, d);
1691 // double takes two constant pool entries so init second entry's tag
1692 to_cp->tag_at_put(to_i + 1, JVM_CONSTANT_Invalid);
1693 } break;
1694
1695 case JVM_CONSTANT_Fieldref:
1696 {
1697 int class_index = from_cp->uncached_klass_ref_index_at(from_i);
1698 int name_and_type_index = from_cp->uncached_name_and_type_ref_index_at(from_i);
1699 to_cp->field_at_put(to_i, class_index, name_and_type_index);
1700 } break;
1701
1702 case JVM_CONSTANT_Float:
1703 {
1704 jfloat f = from_cp->float_at(from_i);
1705 to_cp->float_at_put(to_i, f);
1706 } break;
1707
1708 case JVM_CONSTANT_Integer:
1709 {
1710 jint i = from_cp->int_at(from_i);
1711 to_cp->int_at_put(to_i, i);
1712 } break;
1713
1714 case JVM_CONSTANT_InterfaceMethodref:
1715 {
1716 int class_index = from_cp->uncached_klass_ref_index_at(from_i);
1717 int name_and_type_index = from_cp->uncached_name_and_type_ref_index_at(from_i);
1718 to_cp->interface_method_at_put(to_i, class_index, name_and_type_index);
1719 } break;
1720
1721 case JVM_CONSTANT_Long:
1722 {
1723 jlong l = from_cp->long_at(from_i);
1724 to_cp->long_at_put(to_i, l);
1725 // long takes two constant pool entries so init second entry's tag
1726 to_cp->tag_at_put(to_i + 1, JVM_CONSTANT_Invalid);
1727 } break;
1728
1729 case JVM_CONSTANT_Methodref:
1730 {
1731 int class_index = from_cp->uncached_klass_ref_index_at(from_i);
1732 int name_and_type_index = from_cp->uncached_name_and_type_ref_index_at(from_i);
1733 to_cp->method_at_put(to_i, class_index, name_and_type_index);
1734 } break;
1735
1736 case JVM_CONSTANT_NameAndType:
1737 {
1738 int name_ref_index = from_cp->name_ref_index_at(from_i);
1739 int signature_ref_index = from_cp->signature_ref_index_at(from_i);
1740 to_cp->name_and_type_at_put(to_i, name_ref_index, signature_ref_index);
1741 } break;
1742
1743 case JVM_CONSTANT_StringIndex:
1744 {
1745 jint si = from_cp->string_index_at(from_i);
1746 to_cp->string_index_at_put(to_i, si);
1747 } break;
1748
1749 case JVM_CONSTANT_Class:
1750 case JVM_CONSTANT_UnresolvedClass:
1751 case JVM_CONSTANT_UnresolvedClassInError:
1752 {
1753 // Revert to JVM_CONSTANT_ClassIndex
1754 int name_index = from_cp->klass_slot_at(from_i).name_index();
1755 assert(from_cp->tag_at(name_index).is_symbol(), "sanity");
1756 to_cp->klass_index_at_put(to_i, name_index);
1757 } break;
1758
1759 case JVM_CONSTANT_String:
1760 {
1761 Symbol* s = from_cp->unresolved_string_at(from_i);
1762 to_cp->unresolved_string_at_put(to_i, s);
1763 } break;
1764
1765 case JVM_CONSTANT_Utf8:
1766 {
1767 Symbol* s = from_cp->symbol_at(from_i);
1768 // Need to increase refcount, the old one will be thrown away and deferenced
1769 s->increment_refcount();
1770 to_cp->symbol_at_put(to_i, s);
1771 } break;
1772
1773 case JVM_CONSTANT_MethodType:
1774 case JVM_CONSTANT_MethodTypeInError:
1775 {
1776 jint k = from_cp->method_type_index_at(from_i);
1777 to_cp->method_type_index_at_put(to_i, k);
1778 } break;
1779
1780 case JVM_CONSTANT_MethodHandle:
1781 case JVM_CONSTANT_MethodHandleInError:
1782 {
1783 int k1 = from_cp->method_handle_ref_kind_at(from_i);
1784 int k2 = from_cp->method_handle_index_at(from_i);
1785 to_cp->method_handle_index_at_put(to_i, k1, k2);
1786 } break;
1787
1788 case JVM_CONSTANT_Dynamic:
1789 case JVM_CONSTANT_DynamicInError:
1790 {
1791 int k1 = from_cp->invoke_dynamic_bootstrap_specifier_index(from_i);
1792 int k2 = from_cp->invoke_dynamic_name_and_type_ref_index_at(from_i);
1793 k1 += operand_array_length(to_cp->operands()); // to_cp might already have operands
1794 to_cp->dynamic_constant_at_put(to_i, k1, k2);
1795 } break;
1796
1797 case JVM_CONSTANT_InvokeDynamic:
1798 {
1799 int k1 = from_cp->invoke_dynamic_bootstrap_specifier_index(from_i);
1800 int k2 = from_cp->invoke_dynamic_name_and_type_ref_index_at(from_i);
1801 k1 += operand_array_length(to_cp->operands()); // to_cp might already have operands
1802 to_cp->invoke_dynamic_at_put(to_i, k1, k2);
1803 } break;
1804
1805 // Invalid is used as the tag for the second constant pool entry
1806 // occupied by JVM_CONSTANT_Double or JVM_CONSTANT_Long. It should
1807 // not be seen by itself.
1808 case JVM_CONSTANT_Invalid: // fall through
1809
1810 default:
1811 {
1812 ShouldNotReachHere();
1813 } break;
1814 }
1815 } // end copy_entry_to()
1816
1817 // Search constant pool search_cp for an entry that matches this
1818 // constant pool's entry at pattern_i. Returns the index of a
1819 // matching entry or zero (0) if there is no matching entry.
1820 int ConstantPool::find_matching_entry(int pattern_i,
1821 const constantPoolHandle& search_cp, TRAPS) {
1822
1823 // index zero (0) is not used
1824 for (int i = 1; i < search_cp->length(); i++) {
1825 bool found = compare_entry_to(pattern_i, search_cp, i, CHECK_0);
1826 if (found) {
1827 return i;
1828 }
1829 }
1830
1831 return 0; // entry not found; return unused index zero (0)
1832 } // end find_matching_entry()
1833
1834
1835 // Compare this constant pool's bootstrap specifier at idx1 to the constant pool
1836 // cp2's bootstrap specifier at idx2.
1837 bool ConstantPool::compare_operand_to(int idx1, const constantPoolHandle& cp2, int idx2, TRAPS) {
1838 int k1 = operand_bootstrap_method_ref_index_at(idx1);
1839 int k2 = cp2->operand_bootstrap_method_ref_index_at(idx2);
1840 bool match = compare_entry_to(k1, cp2, k2, CHECK_false);
1841
1842 if (!match) {
1843 return false;
1844 }
1845 int argc = operand_argument_count_at(idx1);
1846 if (argc == cp2->operand_argument_count_at(idx2)) {
1847 for (int j = 0; j < argc; j++) {
1848 k1 = operand_argument_index_at(idx1, j);
1849 k2 = cp2->operand_argument_index_at(idx2, j);
1850 match = compare_entry_to(k1, cp2, k2, CHECK_false);
1851 if (!match) {
1852 return false;
1853 }
1854 }
1855 return true; // got through loop; all elements equal
1856 }
1857 return false;
1858 } // end compare_operand_to()
1859
1860 // Search constant pool search_cp for a bootstrap specifier that matches
1861 // this constant pool's bootstrap specifier at pattern_i index.
1862 // Return the index of a matching bootstrap specifier or (-1) if there is no match.
1863 int ConstantPool::find_matching_operand(int pattern_i,
1864 const constantPoolHandle& search_cp, int search_len, TRAPS) {
1865 for (int i = 0; i < search_len; i++) {
1866 bool found = compare_operand_to(pattern_i, search_cp, i, CHECK_(-1));
1867 if (found) {
1868 return i;
1869 }
1870 }
1871 return -1; // bootstrap specifier not found; return unused index (-1)
1872 } // end find_matching_operand()
1873
1874
1875 #ifndef PRODUCT
1876
1877 const char* ConstantPool::printable_name_at(int which) {
1878
1879 constantTag tag = tag_at(which);
1880
1881 if (tag.is_string()) {
1882 return string_at_noresolve(which);
1883 } else if (tag.is_klass() || tag.is_unresolved_klass()) {
1884 return klass_name_at(which)->as_C_string();
1885 } else if (tag.is_symbol()) {
1886 return symbol_at(which)->as_C_string();
1887 }
1888 return "";
1889 }
1890
1891 #endif // PRODUCT
1892
1893
1894 // JVMTI GetConstantPool support
1895
1896 // For debugging of constant pool
1897 const bool debug_cpool = false;
1898
1899 #define DBG(code) do { if (debug_cpool) { (code); } } while(0)
1900
1901 static void print_cpool_bytes(jint cnt, u1 *bytes) {
1902 const char* WARN_MSG = "Must not be such entry!";
1903 jint size = 0;
1904 u2 idx1, idx2;
1905
1906 for (jint idx = 1; idx < cnt; idx++) {
1907 jint ent_size = 0;
1908 u1 tag = *bytes++;
1909 size++; // count tag
1910
1911 printf("const #%03d, tag: %02d ", idx, tag);
1912 switch(tag) {
1913 case JVM_CONSTANT_Invalid: {
1914 printf("Invalid");
1915 break;
1916 }
1917 case JVM_CONSTANT_Unicode: {
1918 printf("Unicode %s", WARN_MSG);
1919 break;
1920 }
1921 case JVM_CONSTANT_Utf8: {
1922 u2 len = Bytes::get_Java_u2(bytes);
1923 char str[128];
1924 if (len > 127) {
1925 len = 127;
1926 }
1927 strncpy(str, (char *) (bytes+2), len);
1928 str[len] = '\0';
1929 printf("Utf8 \"%s\"", str);
1930 ent_size = 2 + len;
1931 break;
1932 }
1933 case JVM_CONSTANT_Integer: {
1934 u4 val = Bytes::get_Java_u4(bytes);
1935 printf("int %d", *(int *) &val);
1936 ent_size = 4;
1937 break;
1938 }
1939 case JVM_CONSTANT_Float: {
1940 u4 val = Bytes::get_Java_u4(bytes);
1941 printf("float %5.3ff", *(float *) &val);
1942 ent_size = 4;
1943 break;
1944 }
1945 case JVM_CONSTANT_Long: {
1946 u8 val = Bytes::get_Java_u8(bytes);
1947 printf("long " INT64_FORMAT, (int64_t) *(jlong *) &val);
1948 ent_size = 8;
1949 idx++; // Long takes two cpool slots
1950 break;
1951 }
1952 case JVM_CONSTANT_Double: {
1953 u8 val = Bytes::get_Java_u8(bytes);
1954 printf("double %5.3fd", *(jdouble *)&val);
1955 ent_size = 8;
1956 idx++; // Double takes two cpool slots
1957 break;
1958 }
1959 case JVM_CONSTANT_Class: {
1960 idx1 = Bytes::get_Java_u2(bytes);
1961 printf("class #%03d", idx1);
1962 ent_size = 2;
1963 break;
1964 }
1965 case JVM_CONSTANT_String: {
1966 idx1 = Bytes::get_Java_u2(bytes);
1967 printf("String #%03d", idx1);
1968 ent_size = 2;
1969 break;
1970 }
1971 case JVM_CONSTANT_Fieldref: {
1972 idx1 = Bytes::get_Java_u2(bytes);
1973 idx2 = Bytes::get_Java_u2(bytes+2);
1974 printf("Field #%03d, #%03d", (int) idx1, (int) idx2);
1975 ent_size = 4;
1976 break;
1977 }
1978 case JVM_CONSTANT_Methodref: {
1979 idx1 = Bytes::get_Java_u2(bytes);
1980 idx2 = Bytes::get_Java_u2(bytes+2);
1981 printf("Method #%03d, #%03d", idx1, idx2);
1982 ent_size = 4;
1983 break;
1984 }
1985 case JVM_CONSTANT_InterfaceMethodref: {
1986 idx1 = Bytes::get_Java_u2(bytes);
1987 idx2 = Bytes::get_Java_u2(bytes+2);
1988 printf("InterfMethod #%03d, #%03d", idx1, idx2);
1989 ent_size = 4;
1990 break;
1991 }
1992 case JVM_CONSTANT_NameAndType: {
1993 idx1 = Bytes::get_Java_u2(bytes);
1994 idx2 = Bytes::get_Java_u2(bytes+2);
1995 printf("NameAndType #%03d, #%03d", idx1, idx2);
1996 ent_size = 4;
1997 break;
1998 }
1999 case JVM_CONSTANT_ClassIndex: {
2000 printf("ClassIndex %s", WARN_MSG);
2001 break;
2002 }
2003 case JVM_CONSTANT_UnresolvedClass: {
2004 printf("UnresolvedClass: %s", WARN_MSG);
2005 break;
2006 }
2007 case JVM_CONSTANT_UnresolvedClassInError: {
2008 printf("UnresolvedClassInErr: %s", WARN_MSG);
2009 break;
2010 }
2011 case JVM_CONSTANT_StringIndex: {
2012 printf("StringIndex: %s", WARN_MSG);
2013 break;
2014 }
2015 }
2016 printf(";\n");
2017 bytes += ent_size;
2018 size += ent_size;
2019 }
2020 printf("Cpool size: %d\n", size);
2021 fflush(0);
2022 return;
2023 } /* end print_cpool_bytes */
2024
2025
2026 // Returns size of constant pool entry.
2027 jint ConstantPool::cpool_entry_size(jint idx) {
2028 switch(tag_at(idx).value()) {
2029 case JVM_CONSTANT_Invalid:
2030 case JVM_CONSTANT_Unicode:
2031 return 1;
2032
2033 case JVM_CONSTANT_Utf8:
2034 return 3 + symbol_at(idx)->utf8_length();
2035
2036 case JVM_CONSTANT_Class:
2037 case JVM_CONSTANT_String:
2038 case JVM_CONSTANT_ClassIndex:
2039 case JVM_CONSTANT_UnresolvedClass:
2040 case JVM_CONSTANT_UnresolvedClassInError:
2041 case JVM_CONSTANT_StringIndex:
2042 case JVM_CONSTANT_MethodType:
2043 case JVM_CONSTANT_MethodTypeInError:
2044 return 3;
2045
2046 case JVM_CONSTANT_MethodHandle:
2047 case JVM_CONSTANT_MethodHandleInError:
2048 return 4; //tag, ref_kind, ref_index
2049
2050 case JVM_CONSTANT_Integer:
2051 case JVM_CONSTANT_Float:
2052 case JVM_CONSTANT_Fieldref:
2053 case JVM_CONSTANT_Methodref:
2054 case JVM_CONSTANT_InterfaceMethodref:
2055 case JVM_CONSTANT_NameAndType:
2056 return 5;
2057
2058 case JVM_CONSTANT_Dynamic:
2059 case JVM_CONSTANT_DynamicInError:
2060 case JVM_CONSTANT_InvokeDynamic:
2061 // u1 tag, u2 bsm, u2 nt
2062 return 5;
2063
2064 case JVM_CONSTANT_Long:
2065 case JVM_CONSTANT_Double:
2066 return 9;
2067 }
2068 assert(false, "cpool_entry_size: Invalid constant pool entry tag");
2069 return 1;
2070 } /* end cpool_entry_size */
2071
2072
2073 // SymbolHashMap is used to find a constant pool index from a string.
2074 // This function fills in SymbolHashMaps, one for utf8s and one for
2075 // class names, returns size of the cpool raw bytes.
2076 jint ConstantPool::hash_entries_to(SymbolHashMap *symmap,
2077 SymbolHashMap *classmap) {
2078 jint size = 0;
2079
2080 for (u2 idx = 1; idx < length(); idx++) {
2081 u2 tag = tag_at(idx).value();
2082 size += cpool_entry_size(idx);
2083
2084 switch(tag) {
2085 case JVM_CONSTANT_Utf8: {
2086 Symbol* sym = symbol_at(idx);
2087 symmap->add_entry(sym, idx);
2088 DBG(printf("adding symbol entry %s = %d\n", sym->as_utf8(), idx));
2089 break;
2090 }
2091 case JVM_CONSTANT_Class:
2092 case JVM_CONSTANT_UnresolvedClass:
2093 case JVM_CONSTANT_UnresolvedClassInError: {
2094 Symbol* sym = klass_name_at(idx);
2095 classmap->add_entry(sym, idx);
2096 DBG(printf("adding class entry %s = %d\n", sym->as_utf8(), idx));
2097 break;
2098 }
2099 case JVM_CONSTANT_Long:
2100 case JVM_CONSTANT_Double: {
2101 idx++; // Both Long and Double take two cpool slots
2102 break;
2103 }
2104 }
2105 }
2106 return size;
2107 } /* end hash_utf8_entries_to */
2108
2109
2110 // Copy cpool bytes.
2111 // Returns:
2112 // 0, in case of OutOfMemoryError
2113 // -1, in case of internal error
2114 // > 0, count of the raw cpool bytes that have been copied
2115 int ConstantPool::copy_cpool_bytes(int cpool_size,
2116 SymbolHashMap* tbl,
2117 unsigned char *bytes) {
2118 u2 idx1, idx2;
2119 jint size = 0;
2120 jint cnt = length();
2121 unsigned char *start_bytes = bytes;
2122
2123 for (jint idx = 1; idx < cnt; idx++) {
2124 u1 tag = tag_at(idx).value();
2125 jint ent_size = cpool_entry_size(idx);
2126
2127 assert(size + ent_size <= cpool_size, "Size mismatch");
2128
2129 *bytes = tag;
2130 DBG(printf("#%03hd tag=%03hd, ", (short)idx, (short)tag));
2131 switch(tag) {
2132 case JVM_CONSTANT_Invalid: {
2133 DBG(printf("JVM_CONSTANT_Invalid"));
2134 break;
2135 }
2136 case JVM_CONSTANT_Unicode: {
2137 assert(false, "Wrong constant pool tag: JVM_CONSTANT_Unicode");
2138 DBG(printf("JVM_CONSTANT_Unicode"));
2139 break;
2140 }
2141 case JVM_CONSTANT_Utf8: {
2142 Symbol* sym = symbol_at(idx);
2143 char* str = sym->as_utf8();
2144 // Warning! It's crashing on x86 with len = sym->utf8_length()
2145 int len = (int) strlen(str);
2146 Bytes::put_Java_u2((address) (bytes+1), (u2) len);
2147 for (int i = 0; i < len; i++) {
2148 bytes[3+i] = (u1) str[i];
2149 }
2150 DBG(printf("JVM_CONSTANT_Utf8: %s ", str));
2151 break;
2152 }
2153 case JVM_CONSTANT_Integer: {
2154 jint val = int_at(idx);
2155 Bytes::put_Java_u4((address) (bytes+1), *(u4*)&val);
2156 break;
2157 }
2158 case JVM_CONSTANT_Float: {
2159 jfloat val = float_at(idx);
2160 Bytes::put_Java_u4((address) (bytes+1), *(u4*)&val);
2161 break;
2162 }
2163 case JVM_CONSTANT_Long: {
2164 jlong val = long_at(idx);
2165 Bytes::put_Java_u8((address) (bytes+1), *(u8*)&val);
2166 idx++; // Long takes two cpool slots
2167 break;
2168 }
2169 case JVM_CONSTANT_Double: {
2170 jdouble val = double_at(idx);
2171 Bytes::put_Java_u8((address) (bytes+1), *(u8*)&val);
2172 idx++; // Double takes two cpool slots
2173 break;
2174 }
2175 case JVM_CONSTANT_Class:
2176 case JVM_CONSTANT_UnresolvedClass:
2177 case JVM_CONSTANT_UnresolvedClassInError: {
2178 *bytes = JVM_CONSTANT_Class;
2179 Symbol* sym = klass_name_at(idx);
2180 idx1 = tbl->symbol_to_value(sym);
2181 assert(idx1 != 0, "Have not found a hashtable entry");
2182 Bytes::put_Java_u2((address) (bytes+1), idx1);
2183 DBG(printf("JVM_CONSTANT_Class: idx=#%03hd, %s", idx1, sym->as_utf8()));
2184 break;
2185 }
2186 case JVM_CONSTANT_String: {
2187 *bytes = JVM_CONSTANT_String;
2188 Symbol* sym = unresolved_string_at(idx);
2189 idx1 = tbl->symbol_to_value(sym);
2190 assert(idx1 != 0, "Have not found a hashtable entry");
2191 Bytes::put_Java_u2((address) (bytes+1), idx1);
2192 DBG(printf("JVM_CONSTANT_String: idx=#%03hd, %s", idx1, sym->as_utf8()));
2193 break;
2194 }
2195 case JVM_CONSTANT_Fieldref:
2196 case JVM_CONSTANT_Methodref:
2197 case JVM_CONSTANT_InterfaceMethodref: {
2198 idx1 = uncached_klass_ref_index_at(idx);
2199 idx2 = uncached_name_and_type_ref_index_at(idx);
2200 Bytes::put_Java_u2((address) (bytes+1), idx1);
2201 Bytes::put_Java_u2((address) (bytes+3), idx2);
2202 DBG(printf("JVM_CONSTANT_Methodref: %hd %hd", idx1, idx2));
2203 break;
2204 }
2205 case JVM_CONSTANT_NameAndType: {
2206 idx1 = name_ref_index_at(idx);
2207 idx2 = signature_ref_index_at(idx);
2208 Bytes::put_Java_u2((address) (bytes+1), idx1);
2209 Bytes::put_Java_u2((address) (bytes+3), idx2);
2210 DBG(printf("JVM_CONSTANT_NameAndType: %hd %hd", idx1, idx2));
2211 break;
2212 }
2213 case JVM_CONSTANT_ClassIndex: {
2214 *bytes = JVM_CONSTANT_Class;
2215 idx1 = klass_index_at(idx);
2216 Bytes::put_Java_u2((address) (bytes+1), idx1);
2217 DBG(printf("JVM_CONSTANT_ClassIndex: %hd", idx1));
2218 break;
2219 }
2220 case JVM_CONSTANT_StringIndex: {
2221 *bytes = JVM_CONSTANT_String;
2222 idx1 = string_index_at(idx);
2223 Bytes::put_Java_u2((address) (bytes+1), idx1);
2224 DBG(printf("JVM_CONSTANT_StringIndex: %hd", idx1));
2225 break;
2226 }
2227 case JVM_CONSTANT_MethodHandle:
2228 case JVM_CONSTANT_MethodHandleInError: {
2229 *bytes = JVM_CONSTANT_MethodHandle;
2230 int kind = method_handle_ref_kind_at(idx);
2231 idx1 = method_handle_index_at(idx);
2232 *(bytes+1) = (unsigned char) kind;
2233 Bytes::put_Java_u2((address) (bytes+2), idx1);
2234 DBG(printf("JVM_CONSTANT_MethodHandle: %d %hd", kind, idx1));
2235 break;
2236 }
2237 case JVM_CONSTANT_MethodType:
2238 case JVM_CONSTANT_MethodTypeInError: {
2239 *bytes = JVM_CONSTANT_MethodType;
2240 idx1 = method_type_index_at(idx);
2241 Bytes::put_Java_u2((address) (bytes+1), idx1);
2242 DBG(printf("JVM_CONSTANT_MethodType: %hd", idx1));
2243 break;
2244 }
2245 case JVM_CONSTANT_Dynamic:
2246 case JVM_CONSTANT_DynamicInError: {
2247 *bytes = tag;
2248 idx1 = extract_low_short_from_int(*int_at_addr(idx));
2249 idx2 = extract_high_short_from_int(*int_at_addr(idx));
2250 assert(idx2 == invoke_dynamic_name_and_type_ref_index_at(idx), "correct half of u4");
2251 Bytes::put_Java_u2((address) (bytes+1), idx1);
2252 Bytes::put_Java_u2((address) (bytes+3), idx2);
2253 DBG(printf("JVM_CONSTANT_Dynamic: %hd %hd", idx1, idx2));
2254 break;
2255 }
2256 case JVM_CONSTANT_InvokeDynamic: {
2257 *bytes = tag;
2258 idx1 = extract_low_short_from_int(*int_at_addr(idx));
2259 idx2 = extract_high_short_from_int(*int_at_addr(idx));
2260 assert(idx2 == invoke_dynamic_name_and_type_ref_index_at(idx), "correct half of u4");
2261 Bytes::put_Java_u2((address) (bytes+1), idx1);
2262 Bytes::put_Java_u2((address) (bytes+3), idx2);
2263 DBG(printf("JVM_CONSTANT_InvokeDynamic: %hd %hd", idx1, idx2));
2264 break;
2265 }
2266 }
2267 DBG(printf("\n"));
2268 bytes += ent_size;
2269 size += ent_size;
2270 }
2271 assert(size == cpool_size, "Size mismatch");
2272
2273 // Keep temorarily for debugging until it's stable.
2274 DBG(print_cpool_bytes(cnt, start_bytes));
2275 return (int)(bytes - start_bytes);
2276 } /* end copy_cpool_bytes */
2277
2278 #undef DBG
2279
2280
2281 void ConstantPool::set_on_stack(const bool value) {
2282 if (value) {
2283 // Only record if it's not already set.
2284 if (!on_stack()) {
2285 assert(!is_shared(), "should always be set for shared constant pools");
2286 _flags |= _on_stack;
2287 MetadataOnStackMark::record(this);
2288 }
2289 } else {
2290 // Clearing is done single-threadedly.
2291 if (!is_shared()) {
2292 _flags &= ~_on_stack;
2293 }
2294 }
2295 }
2296
2297 // JSR 292 support for patching constant pool oops after the class is linked and
2298 // the oop array for resolved references are created.
2299 // We can't do this during classfile parsing, which is how the other indexes are
2300 // patched. The other patches are applied early for some error checking
2301 // so only defer the pseudo_strings.
2302 void ConstantPool::patch_resolved_references(GrowableArray<Handle>* cp_patches) {
2303 for (int index = 1; index < cp_patches->length(); index++) { // Index 0 is unused
2304 Handle patch = cp_patches->at(index);
2305 if (patch.not_null()) {
2306 assert (tag_at(index).is_string(), "should only be string left");
2307 // Patching a string means pre-resolving it.
2308 // The spelling in the constant pool is ignored.
2309 // The constant reference may be any object whatever.
2310 // If it is not a real interned string, the constant is referred
2311 // to as a "pseudo-string", and must be presented to the CP
2312 // explicitly, because it may require scavenging.
2313 int obj_index = cp_to_object_index(index);
2314 pseudo_string_at_put(index, obj_index, patch());
2315 DEBUG_ONLY(cp_patches->at_put(index, Handle());)
2316 }
2317 }
2318 #ifdef ASSERT
2319 // Ensure that all the patches have been used.
2320 for (int index = 0; index < cp_patches->length(); index++) {
2321 assert(cp_patches->at(index).is_null(),
2322 "Unused constant pool patch at %d in class file %s",
2323 index,
2324 pool_holder()->external_name());
2325 }
2326 #endif // ASSERT
2327 }
2328
2329 #ifndef PRODUCT
2330
2331 // CompileTheWorld support. Preload all classes loaded references in the passed in constantpool
2332 void ConstantPool::preload_and_initialize_all_classes(ConstantPool* obj, TRAPS) {
2333 guarantee(obj->is_constantPool(), "object must be constant pool");
2334 constantPoolHandle cp(THREAD, (ConstantPool*)obj);
2335 guarantee(cp->pool_holder() != NULL, "must be fully loaded");
2336
2337 for (int i = 0; i< cp->length(); i++) {
2338 if (cp->tag_at(i).is_unresolved_klass()) {
2339 // This will force loading of the class
2340 Klass* klass = cp->klass_at(i, CHECK);
2341 if (klass->is_instance_klass()) {
2342 // Force initialization of class
2343 InstanceKlass::cast(klass)->initialize(CHECK);
2344 }
2345 }
2346 }
2347 }
2348
2349 #endif
2350
2351
2352 // Printing
2353
2354 void ConstantPool::print_on(outputStream* st) const {
2355 assert(is_constantPool(), "must be constantPool");
2356 st->print_cr("%s", internal_name());
2357 if (flags() != 0) {
2358 st->print(" - flags: 0x%x", flags());
2359 if (has_preresolution()) st->print(" has_preresolution");
2360 if (on_stack()) st->print(" on_stack");
2361 st->cr();
2362 }
2363 if (pool_holder() != NULL) {
2364 st->print_cr(" - holder: " INTPTR_FORMAT, p2i(pool_holder()));
2365 }
2366 st->print_cr(" - cache: " INTPTR_FORMAT, p2i(cache()));
2367 st->print_cr(" - resolved_references: " INTPTR_FORMAT, p2i(resolved_references()));
2368 st->print_cr(" - reference_map: " INTPTR_FORMAT, p2i(reference_map()));
2369 st->print_cr(" - resolved_klasses: " INTPTR_FORMAT, p2i(resolved_klasses()));
2370
2371 for (int index = 1; index < length(); index++) { // Index 0 is unused
2372 ((ConstantPool*)this)->print_entry_on(index, st);
2373 switch (tag_at(index).value()) {
2374 case JVM_CONSTANT_Long :
2375 case JVM_CONSTANT_Double :
2376 index++; // Skip entry following eigth-byte constant
2377 }
2378
2379 }
2380 st->cr();
2381 }
2382
2383 // Print one constant pool entry
2384 void ConstantPool::print_entry_on(const int index, outputStream* st) {
2385 EXCEPTION_MARK;
2386 st->print(" - %3d : ", index);
2387 tag_at(index).print_on(st);
2388 st->print(" : ");
2389 switch (tag_at(index).value()) {
2390 case JVM_CONSTANT_Class :
2391 { Klass* k = klass_at(index, CATCH);
2392 guarantee(k != NULL, "need klass");
2393 k->print_value_on(st);
2394 st->print(" {" PTR_FORMAT "}", p2i(k));
2395 }
2396 break;
2397 case JVM_CONSTANT_Fieldref :
2398 case JVM_CONSTANT_Methodref :
2399 case JVM_CONSTANT_InterfaceMethodref :
2400 st->print("klass_index=%d", uncached_klass_ref_index_at(index));
2401 st->print(" name_and_type_index=%d", uncached_name_and_type_ref_index_at(index));
2402 break;
2403 case JVM_CONSTANT_String :
2404 if (is_pseudo_string_at(index)) {
2405 oop anObj = pseudo_string_at(index);
2406 anObj->print_value_on(st);
2407 st->print(" {" PTR_FORMAT "}", p2i(anObj));
2408 } else {
2409 unresolved_string_at(index)->print_value_on(st);
2410 }
2411 break;
2412 case JVM_CONSTANT_Integer :
2413 st->print("%d", int_at(index));
2414 break;
2415 case JVM_CONSTANT_Float :
2416 st->print("%f", float_at(index));
2417 break;
2418 case JVM_CONSTANT_Long :
2419 st->print_jlong(long_at(index));
2420 break;
2421 case JVM_CONSTANT_Double :
2422 st->print("%lf", double_at(index));
2423 break;
2424 case JVM_CONSTANT_NameAndType :
2425 st->print("name_index=%d", name_ref_index_at(index));
2426 st->print(" signature_index=%d", signature_ref_index_at(index));
2427 break;
2428 case JVM_CONSTANT_Utf8 :
2429 symbol_at(index)->print_value_on(st);
2430 break;
2431 case JVM_CONSTANT_ClassIndex: {
2432 int name_index = *int_at_addr(index);
2433 st->print("klass_index=%d ", name_index);
2434 symbol_at(name_index)->print_value_on(st);
2435 }
2436 break;
2437 case JVM_CONSTANT_UnresolvedClass : // fall-through
2438 case JVM_CONSTANT_UnresolvedClassInError: {
2439 CPKlassSlot kslot = klass_slot_at(index);
2440 int resolved_klass_index = kslot.resolved_klass_index();
2441 int name_index = kslot.name_index();
2442 assert(tag_at(name_index).is_symbol(), "sanity");
2443
2444 Klass* klass = resolved_klasses()->at(resolved_klass_index);
2445 if (klass != NULL) {
2446 klass->print_value_on(st);
2447 } else {
2448 symbol_at(name_index)->print_value_on(st);
2449 }
2450 }
2451 break;
2452 case JVM_CONSTANT_MethodHandle :
2453 case JVM_CONSTANT_MethodHandleInError :
2454 st->print("ref_kind=%d", method_handle_ref_kind_at(index));
2455 st->print(" ref_index=%d", method_handle_index_at(index));
2456 break;
2457 case JVM_CONSTANT_MethodType :
2458 case JVM_CONSTANT_MethodTypeInError :
2459 st->print("signature_index=%d", method_type_index_at(index));
2460 break;
2461 case JVM_CONSTANT_Dynamic :
2462 case JVM_CONSTANT_DynamicInError :
2463 {
2464 st->print("bootstrap_method_index=%d", invoke_dynamic_bootstrap_method_ref_index_at(index));
2465 st->print(" type_index=%d", invoke_dynamic_name_and_type_ref_index_at(index));
2466 int argc = invoke_dynamic_argument_count_at(index);
2467 if (argc > 0) {
2468 for (int arg_i = 0; arg_i < argc; arg_i++) {
2469 int arg = invoke_dynamic_argument_index_at(index, arg_i);
2470 st->print((arg_i == 0 ? " arguments={%d" : ", %d"), arg);
2471 }
2472 st->print("}");
2473 }
2474 }
2475 break;
2476 case JVM_CONSTANT_InvokeDynamic :
2477 {
2478 st->print("bootstrap_method_index=%d", invoke_dynamic_bootstrap_method_ref_index_at(index));
2479 st->print(" name_and_type_index=%d", invoke_dynamic_name_and_type_ref_index_at(index));
2480 int argc = invoke_dynamic_argument_count_at(index);
2481 if (argc > 0) {
2482 for (int arg_i = 0; arg_i < argc; arg_i++) {
2483 int arg = invoke_dynamic_argument_index_at(index, arg_i);
2484 st->print((arg_i == 0 ? " arguments={%d" : ", %d"), arg);
2485 }
2486 st->print("}");
2487 }
2488 }
2489 break;
2490 default:
2491 ShouldNotReachHere();
2492 break;
2493 }
2494 st->cr();
2495 }
2496
2497 void ConstantPool::print_value_on(outputStream* st) const {
2498 assert(is_constantPool(), "must be constantPool");
2499 st->print("constant pool [%d]", length());
2500 if (has_preresolution()) st->print("/preresolution");
2501 if (operands() != NULL) st->print("/operands[%d]", operands()->length());
2502 print_address_on(st);
2503 if (pool_holder() != NULL) {
2504 st->print(" for ");
2505 pool_holder()->print_value_on(st);
2506 bool extra = (pool_holder()->constants() != this);
2507 if (extra) st->print(" (extra)");
2508 }
2509 if (cache() != NULL) {
2510 st->print(" cache=" PTR_FORMAT, p2i(cache()));
2511 }
2512 }
2513
2514 #if INCLUDE_SERVICES
2515 // Size Statistics
2516 void ConstantPool::collect_statistics(KlassSizeStats *sz) const {
2517 sz->_cp_all_bytes += (sz->_cp_bytes = sz->count(this));
2518 sz->_cp_all_bytes += (sz->_cp_tags_bytes = sz->count_array(tags()));
2519 sz->_cp_all_bytes += (sz->_cp_cache_bytes = sz->count(cache()));
2520 sz->_cp_all_bytes += (sz->_cp_operands_bytes = sz->count_array(operands()));
2521 sz->_cp_all_bytes += (sz->_cp_refmap_bytes = sz->count_array(reference_map()));
2522
2523 sz->_ro_bytes += sz->_cp_operands_bytes + sz->_cp_tags_bytes +
2524 sz->_cp_refmap_bytes;
2525 sz->_rw_bytes += sz->_cp_bytes + sz->_cp_cache_bytes;
2526 }
2527 #endif // INCLUDE_SERVICES
2528
2529 // Verification
2530
2531 void ConstantPool::verify_on(outputStream* st) {
2532 guarantee(is_constantPool(), "object must be constant pool");
2533 for (int i = 0; i< length(); i++) {
2534 constantTag tag = tag_at(i);
2535 if (tag.is_klass() || tag.is_unresolved_klass()) {
2536 guarantee(klass_name_at(i)->refcount() != 0, "should have nonzero reference count");
2537 } else if (tag.is_symbol()) {
2538 CPSlot entry = slot_at(i);
2539 guarantee(entry.get_symbol()->refcount() != 0, "should have nonzero reference count");
2540 } else if (tag.is_string()) {
2541 CPSlot entry = slot_at(i);
2542 guarantee(entry.get_symbol()->refcount() != 0, "should have nonzero reference count");
2543 }
2544 }
2545 if (cache() != NULL) {
2546 // Note: cache() can be NULL before a class is completely setup or
2547 // in temporary constant pools used during constant pool merging
2548 guarantee(cache()->is_constantPoolCache(), "should be constant pool cache");
2549 }
2550 if (pool_holder() != NULL) {
2551 // Note: pool_holder() can be NULL in temporary constant pools
2552 // used during constant pool merging
2553 guarantee(pool_holder()->is_klass(), "should be klass");
2554 }
2555 }
2556
2557
2558 SymbolHashMap::~SymbolHashMap() {
2559 SymbolHashMapEntry* next;
2560 for (int i = 0; i < _table_size; i++) {
2561 for (SymbolHashMapEntry* cur = bucket(i); cur != NULL; cur = next) {
2562 next = cur->next();
2563 delete(cur);
2564 }
2565 }
2566 FREE_C_HEAP_ARRAY(SymbolHashMapBucket, _buckets);
2567 }
2568
2569 void SymbolHashMap::add_entry(Symbol* sym, u2 value) {
2570 char *str = sym->as_utf8();
2571 unsigned int hash = compute_hash(str, sym->utf8_length());
2572 unsigned int index = hash % table_size();
2573
2574 // check if already in map
2575 // we prefer the first entry since it is more likely to be what was used in
2576 // the class file
2577 for (SymbolHashMapEntry *en = bucket(index); en != NULL; en = en->next()) {
2578 assert(en->symbol() != NULL, "SymbolHashMapEntry symbol is NULL");
2579 if (en->hash() == hash && en->symbol() == sym) {
2580 return; // already there
2581 }
2582 }
2583
2584 SymbolHashMapEntry* entry = new SymbolHashMapEntry(hash, sym, value);
2585 entry->set_next(bucket(index));
2586 _buckets[index].set_entry(entry);
2587 assert(entry->symbol() != NULL, "SymbolHashMapEntry symbol is NULL");
2588 }
2589
2590 SymbolHashMapEntry* SymbolHashMap::find_entry(Symbol* sym) {
2591 assert(sym != NULL, "SymbolHashMap::find_entry - symbol is NULL");
2592 char *str = sym->as_utf8();
2593 int len = sym->utf8_length();
2594 unsigned int hash = SymbolHashMap::compute_hash(str, len);
2595 unsigned int index = hash % table_size();
2596 for (SymbolHashMapEntry *en = bucket(index); en != NULL; en = en->next()) {
2597 assert(en->symbol() != NULL, "SymbolHashMapEntry symbol is NULL");
2598 if (en->hash() == hash && en->symbol() == sym) {
2599 return en;
2600 }
2601 }
2602 return NULL;
2603 }
2604
2605 void SymbolHashMap::initialize_table(int table_size) {
2606 _table_size = table_size;
2607 _buckets = NEW_C_HEAP_ARRAY(SymbolHashMapBucket, table_size, mtSymbol);
2608 for (int index = 0; index < table_size; index++) {
2609 _buckets[index].clear();
2610 }
2611 }