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