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