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