1 /*
2 * Copyright (c) 1997, 2017, 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 "aot/aotLoader.hpp"
27 #include "classfile/classFileParser.hpp"
28 #include "classfile/classFileStream.hpp"
29 #include "classfile/classLoader.hpp"
30 #include "classfile/javaClasses.hpp"
31 #include "classfile/moduleEntry.hpp"
32 #include "classfile/systemDictionary.hpp"
33 #include "classfile/systemDictionaryShared.hpp"
34 #include "classfile/verifier.hpp"
35 #include "classfile/vmSymbols.hpp"
36 #include "code/dependencyContext.hpp"
37 #include "compiler/compileBroker.hpp"
38 #include "gc/shared/collectedHeap.inline.hpp"
39 #include "gc/shared/specialized_oop_closures.hpp"
40 #include "interpreter/oopMapCache.hpp"
41 #include "interpreter/rewriter.hpp"
42 #include "jvmtifiles/jvmti.h"
43 #include "logging/log.hpp"
44 #include "logging/logMessage.hpp"
45 #include "memory/heapInspection.hpp"
46 #include "memory/iterator.inline.hpp"
47 #include "memory/metadataFactory.hpp"
48 #include "memory/metaspaceShared.hpp"
49 #include "memory/oopFactory.hpp"
50 #include "memory/resourceArea.hpp"
51 #include "oops/fieldStreams.hpp"
52 #include "oops/instanceClassLoaderKlass.hpp"
53 #include "oops/instanceKlass.inline.hpp"
54 #include "oops/instanceMirrorKlass.hpp"
55 #include "oops/instanceOop.hpp"
56 #include "oops/klass.inline.hpp"
57 #include "oops/method.hpp"
58 #include "oops/oop.inline.hpp"
59 #include "oops/symbol.hpp"
60 #include "prims/jvm.h"
61 #include "prims/jvmtiExport.hpp"
62 #include "prims/jvmtiRedefineClasses.hpp"
63 #include "prims/jvmtiThreadState.hpp"
64 #include "prims/methodComparator.hpp"
65 #include "runtime/atomic.hpp"
66 #include "runtime/fieldDescriptor.hpp"
67 #include "runtime/handles.inline.hpp"
68 #include "runtime/javaCalls.hpp"
69 #include "runtime/mutexLocker.hpp"
70 #include "runtime/orderAccess.inline.hpp"
71 #include "runtime/thread.inline.hpp"
72 #include "services/classLoadingService.hpp"
73 #include "services/threadService.hpp"
74 #include "utilities/dtrace.hpp"
75 #include "utilities/macros.hpp"
76 #include "utilities/stringUtils.hpp"
77 #ifdef COMPILER1
78 #include "c1/c1_Compiler.hpp"
79 #endif
80
81 #ifdef DTRACE_ENABLED
82
83
84 #define HOTSPOT_CLASS_INITIALIZATION_required HOTSPOT_CLASS_INITIALIZATION_REQUIRED
85 #define HOTSPOT_CLASS_INITIALIZATION_recursive HOTSPOT_CLASS_INITIALIZATION_RECURSIVE
86 #define HOTSPOT_CLASS_INITIALIZATION_concurrent HOTSPOT_CLASS_INITIALIZATION_CONCURRENT
87 #define HOTSPOT_CLASS_INITIALIZATION_erroneous HOTSPOT_CLASS_INITIALIZATION_ERRONEOUS
88 #define HOTSPOT_CLASS_INITIALIZATION_super__failed HOTSPOT_CLASS_INITIALIZATION_SUPER_FAILED
89 #define HOTSPOT_CLASS_INITIALIZATION_clinit HOTSPOT_CLASS_INITIALIZATION_CLINIT
90 #define HOTSPOT_CLASS_INITIALIZATION_error HOTSPOT_CLASS_INITIALIZATION_ERROR
91 #define HOTSPOT_CLASS_INITIALIZATION_end HOTSPOT_CLASS_INITIALIZATION_END
92 #define DTRACE_CLASSINIT_PROBE(type, thread_type) \
93 { \
94 char* data = NULL; \
95 int len = 0; \
96 Symbol* clss_name = name(); \
97 if (clss_name != NULL) { \
98 data = (char*)clss_name->bytes(); \
99 len = clss_name->utf8_length(); \
100 } \
101 HOTSPOT_CLASS_INITIALIZATION_##type( \
102 data, len, class_loader(), thread_type); \
103 }
104
105 #define DTRACE_CLASSINIT_PROBE_WAIT(type, thread_type, wait) \
106 { \
107 char* data = NULL; \
108 int len = 0; \
109 Symbol* clss_name = name(); \
110 if (clss_name != NULL) { \
111 data = (char*)clss_name->bytes(); \
112 len = clss_name->utf8_length(); \
113 } \
114 HOTSPOT_CLASS_INITIALIZATION_##type( \
115 data, len, class_loader(), thread_type, wait); \
116 }
117
118 #else // ndef DTRACE_ENABLED
119
120 #define DTRACE_CLASSINIT_PROBE(type, thread_type)
121 #define DTRACE_CLASSINIT_PROBE_WAIT(type, thread_type, wait)
122
123 #endif // ndef DTRACE_ENABLED
124
125 volatile int InstanceKlass::_total_instanceKlass_count = 0;
126
127 static inline bool is_class_loader(const Symbol* class_name,
128 const ClassFileParser& parser) {
129 assert(class_name != NULL, "invariant");
130
131 if (class_name == vmSymbols::java_lang_ClassLoader()) {
132 return true;
133 }
134
135 if (SystemDictionary::ClassLoader_klass_loaded()) {
136 const Klass* const super_klass = parser.super_klass();
137 if (super_klass != NULL) {
138 if (super_klass->is_subtype_of(SystemDictionary::ClassLoader_klass())) {
139 return true;
140 }
141 }
142 }
143 return false;
144 }
145
146 InstanceKlass* InstanceKlass::allocate_instance_klass(const ClassFileParser& parser, TRAPS) {
147 const int size = InstanceKlass::size(parser.vtable_size(),
148 parser.itable_size(),
149 nonstatic_oop_map_size(parser.total_oop_map_count()),
150 parser.is_interface(),
151 parser.is_anonymous(),
152 should_store_fingerprint());
153
154 const Symbol* const class_name = parser.class_name();
155 assert(class_name != NULL, "invariant");
156 ClassLoaderData* loader_data = parser.loader_data();
157 assert(loader_data != NULL, "invariant");
158
159 InstanceKlass* ik;
160
161 // Allocation
162 if (REF_NONE == parser.reference_type()) {
163 if (class_name == vmSymbols::java_lang_Class()) {
164 // mirror
165 ik = new (loader_data, size, THREAD) InstanceMirrorKlass(parser);
166 }
167 else if (is_class_loader(class_name, parser)) {
168 // class loader
169 ik = new (loader_data, size, THREAD) InstanceClassLoaderKlass(parser);
170 }
171 else {
172 // normal
173 ik = new (loader_data, size, THREAD) InstanceKlass(parser, InstanceKlass::_misc_kind_other);
174 }
175 }
176 else {
177 // reference
178 ik = new (loader_data, size, THREAD) InstanceRefKlass(parser);
179 }
180
181 // Check for pending exception before adding to the loader data and incrementing
182 // class count. Can get OOM here.
183 if (HAS_PENDING_EXCEPTION) {
184 return NULL;
185 }
186
187 assert(ik != NULL, "invariant");
188
189 const bool publicize = !parser.is_internal();
190
191 // Add all classes to our internal class loader list here,
192 // including classes in the bootstrap (NULL) class loader.
193 loader_data->add_class(ik, publicize);
194 Atomic::inc(&_total_instanceKlass_count);
195
196 return ik;
197 }
198
199
200 // copy method ordering from resource area to Metaspace
201 void InstanceKlass::copy_method_ordering(const intArray* m, TRAPS) {
202 if (m != NULL) {
203 // allocate a new array and copy contents (memcpy?)
204 _method_ordering = MetadataFactory::new_array<int>(class_loader_data(), m->length(), CHECK);
205 for (int i = 0; i < m->length(); i++) {
206 _method_ordering->at_put(i, m->at(i));
207 }
208 } else {
209 _method_ordering = Universe::the_empty_int_array();
210 }
211 }
212
213 // create a new array of vtable_indices for default methods
214 Array<int>* InstanceKlass::create_new_default_vtable_indices(int len, TRAPS) {
215 Array<int>* vtable_indices = MetadataFactory::new_array<int>(class_loader_data(), len, CHECK_NULL);
216 assert(default_vtable_indices() == NULL, "only create once");
217 set_default_vtable_indices(vtable_indices);
218 return vtable_indices;
219 }
220
221 InstanceKlass::InstanceKlass(const ClassFileParser& parser, unsigned kind) :
222 _static_field_size(parser.static_field_size()),
223 _nonstatic_oop_map_size(nonstatic_oop_map_size(parser.total_oop_map_count())),
224 _itable_len(parser.itable_size()),
225 _reference_type(parser.reference_type()) {
226 set_vtable_length(parser.vtable_size());
227 set_kind(kind);
228 set_access_flags(parser.access_flags());
229 set_is_anonymous(parser.is_anonymous());
230 set_layout_helper(Klass::instance_layout_helper(parser.layout_size(),
231 false));
232
233 assert(NULL == _methods, "underlying memory not zeroed?");
234 assert(is_instance_klass(), "is layout incorrect?");
235 assert(size_helper() == parser.layout_size(), "incorrect size_helper?");
236 }
237
238 void InstanceKlass::deallocate_methods(ClassLoaderData* loader_data,
239 Array<Method*>* methods) {
240 if (methods != NULL && methods != Universe::the_empty_method_array() &&
241 !methods->is_shared()) {
242 for (int i = 0; i < methods->length(); i++) {
243 Method* method = methods->at(i);
244 if (method == NULL) continue; // maybe null if error processing
245 // Only want to delete methods that are not executing for RedefineClasses.
246 // The previous version will point to them so they're not totally dangling
247 assert (!method->on_stack(), "shouldn't be called with methods on stack");
248 MetadataFactory::free_metadata(loader_data, method);
249 }
250 MetadataFactory::free_array<Method*>(loader_data, methods);
251 }
252 }
253
254 void InstanceKlass::deallocate_interfaces(ClassLoaderData* loader_data,
255 const Klass* super_klass,
256 Array<Klass*>* local_interfaces,
257 Array<Klass*>* transitive_interfaces) {
258 // Only deallocate transitive interfaces if not empty, same as super class
259 // or same as local interfaces. See code in parseClassFile.
260 Array<Klass*>* ti = transitive_interfaces;
261 if (ti != Universe::the_empty_klass_array() && ti != local_interfaces) {
262 // check that the interfaces don't come from super class
263 Array<Klass*>* sti = (super_klass == NULL) ? NULL :
264 InstanceKlass::cast(super_klass)->transitive_interfaces();
265 if (ti != sti && ti != NULL && !ti->is_shared()) {
266 MetadataFactory::free_array<Klass*>(loader_data, ti);
267 }
268 }
269
270 // local interfaces can be empty
271 if (local_interfaces != Universe::the_empty_klass_array() &&
272 local_interfaces != NULL && !local_interfaces->is_shared()) {
273 MetadataFactory::free_array<Klass*>(loader_data, local_interfaces);
274 }
275 }
276
277 // This function deallocates the metadata and C heap pointers that the
278 // InstanceKlass points to.
279 void InstanceKlass::deallocate_contents(ClassLoaderData* loader_data) {
280
281 // Orphan the mirror first, CMS thinks it's still live.
282 if (java_mirror() != NULL) {
283 java_lang_Class::set_klass(java_mirror(), NULL);
284 }
285
286 // Need to take this class off the class loader data list.
287 loader_data->remove_class(this);
288
289 // The array_klass for this class is created later, after error handling.
290 // For class redefinition, we keep the original class so this scratch class
291 // doesn't have an array class. Either way, assert that there is nothing
292 // to deallocate.
293 assert(array_klasses() == NULL, "array classes shouldn't be created for this class yet");
294
295 // Release C heap allocated data that this might point to, which includes
296 // reference counting symbol names.
297 release_C_heap_structures();
298
299 deallocate_methods(loader_data, methods());
300 set_methods(NULL);
301
302 if (method_ordering() != NULL &&
303 method_ordering() != Universe::the_empty_int_array() &&
304 !method_ordering()->is_shared()) {
305 MetadataFactory::free_array<int>(loader_data, method_ordering());
306 }
307 set_method_ordering(NULL);
308
309 // default methods can be empty
310 if (default_methods() != NULL &&
311 default_methods() != Universe::the_empty_method_array() &&
312 !default_methods()->is_shared()) {
313 MetadataFactory::free_array<Method*>(loader_data, default_methods());
314 }
315 // Do NOT deallocate the default methods, they are owned by superinterfaces.
316 set_default_methods(NULL);
317
318 // default methods vtable indices can be empty
319 if (default_vtable_indices() != NULL &&
320 !default_vtable_indices()->is_shared()) {
321 MetadataFactory::free_array<int>(loader_data, default_vtable_indices());
322 }
323 set_default_vtable_indices(NULL);
324
325
326 // This array is in Klass, but remove it with the InstanceKlass since
327 // this place would be the only caller and it can share memory with transitive
328 // interfaces.
329 if (secondary_supers() != NULL &&
330 secondary_supers() != Universe::the_empty_klass_array() &&
331 secondary_supers() != transitive_interfaces() &&
332 !secondary_supers()->is_shared()) {
333 MetadataFactory::free_array<Klass*>(loader_data, secondary_supers());
334 }
335 set_secondary_supers(NULL);
336
337 deallocate_interfaces(loader_data, super(), local_interfaces(), transitive_interfaces());
338 set_transitive_interfaces(NULL);
339 set_local_interfaces(NULL);
340
341 if (fields() != NULL && !fields()->is_shared()) {
342 MetadataFactory::free_array<jushort>(loader_data, fields());
343 }
344 set_fields(NULL, 0);
345
346 // If a method from a redefined class is using this constant pool, don't
347 // delete it, yet. The new class's previous version will point to this.
348 if (constants() != NULL) {
349 assert (!constants()->on_stack(), "shouldn't be called if anything is onstack");
350 if (!constants()->is_shared()) {
351 MetadataFactory::free_metadata(loader_data, constants());
352 }
353 // Delete any cached resolution errors for the constant pool
354 SystemDictionary::delete_resolution_error(constants());
355
356 set_constants(NULL);
357 }
358
359 if (inner_classes() != NULL &&
360 inner_classes() != Universe::the_empty_short_array() &&
361 !inner_classes()->is_shared()) {
362 MetadataFactory::free_array<jushort>(loader_data, inner_classes());
363 }
364 set_inner_classes(NULL);
365
366 // We should deallocate the Annotations instance if it's not in shared spaces.
367 if (annotations() != NULL && !annotations()->is_shared()) {
368 MetadataFactory::free_metadata(loader_data, annotations());
369 }
370 set_annotations(NULL);
371 }
372
373 bool InstanceKlass::should_be_initialized() const {
374 return !is_initialized();
375 }
376
377 klassItable InstanceKlass::itable() const {
378 return klassItable(const_cast<InstanceKlass*>(this));
379 }
380
381 void InstanceKlass::eager_initialize(Thread *thread) {
382 if (!EagerInitialization) return;
383
384 if (this->is_not_initialized()) {
385 // abort if the the class has a class initializer
386 if (this->class_initializer() != NULL) return;
387
388 // abort if it is java.lang.Object (initialization is handled in genesis)
389 Klass* super_klass = super();
390 if (super_klass == NULL) return;
391
392 // abort if the super class should be initialized
393 if (!InstanceKlass::cast(super_klass)->is_initialized()) return;
394
395 // call body to expose the this pointer
396 eager_initialize_impl();
397 }
398 }
399
400 // JVMTI spec thinks there are signers and protection domain in the
401 // instanceKlass. These accessors pretend these fields are there.
402 // The hprof specification also thinks these fields are in InstanceKlass.
403 oop InstanceKlass::protection_domain() const {
404 // return the protection_domain from the mirror
405 return java_lang_Class::protection_domain(java_mirror());
406 }
407
408 // To remove these from requires an incompatible change and CCC request.
409 objArrayOop InstanceKlass::signers() const {
410 // return the signers from the mirror
411 return java_lang_Class::signers(java_mirror());
412 }
413
414 oop InstanceKlass::init_lock() const {
415 // return the init lock from the mirror
416 oop lock = java_lang_Class::init_lock(java_mirror());
417 // Prevent reordering with any access of initialization state
418 OrderAccess::loadload();
419 assert((oop)lock != NULL || !is_not_initialized(), // initialized or in_error state
420 "only fully initialized state can have a null lock");
421 return lock;
422 }
423
424 // Set the initialization lock to null so the object can be GC'ed. Any racing
425 // threads to get this lock will see a null lock and will not lock.
426 // That's okay because they all check for initialized state after getting
427 // the lock and return.
428 void InstanceKlass::fence_and_clear_init_lock() {
429 // make sure previous stores are all done, notably the init_state.
430 OrderAccess::storestore();
431 java_lang_Class::set_init_lock(java_mirror(), NULL);
432 assert(!is_not_initialized(), "class must be initialized now");
433 }
434
435 void InstanceKlass::eager_initialize_impl() {
436 EXCEPTION_MARK;
437 HandleMark hm(THREAD);
438 Handle h_init_lock(THREAD, init_lock());
439 ObjectLocker ol(h_init_lock, THREAD, h_init_lock() != NULL);
440
441 // abort if someone beat us to the initialization
442 if (!is_not_initialized()) return; // note: not equivalent to is_initialized()
443
444 ClassState old_state = init_state();
445 link_class_impl(true, THREAD);
446 if (HAS_PENDING_EXCEPTION) {
447 CLEAR_PENDING_EXCEPTION;
448 // Abort if linking the class throws an exception.
449
450 // Use a test to avoid redundantly resetting the state if there's
451 // no change. Set_init_state() asserts that state changes make
452 // progress, whereas here we might just be spinning in place.
453 if (old_state != _init_state)
454 set_init_state(old_state);
455 } else {
456 // linking successfull, mark class as initialized
457 set_init_state(fully_initialized);
458 fence_and_clear_init_lock();
459 // trace
460 if (log_is_enabled(Info, class, init)) {
461 ResourceMark rm(THREAD);
462 log_info(class, init)("[Initialized %s without side effects]", external_name());
463 }
464 }
465 }
466
467
468 // See "The Virtual Machine Specification" section 2.16.5 for a detailed explanation of the class initialization
469 // process. The step comments refers to the procedure described in that section.
470 // Note: implementation moved to static method to expose the this pointer.
471 void InstanceKlass::initialize(TRAPS) {
472 if (this->should_be_initialized()) {
473 initialize_impl(CHECK);
474 // Note: at this point the class may be initialized
475 // OR it may be in the state of being initialized
476 // in case of recursive initialization!
477 } else {
478 assert(is_initialized(), "sanity check");
479 }
480 }
481
482
483 bool InstanceKlass::verify_code(bool throw_verifyerror, TRAPS) {
484 // 1) Verify the bytecodes
485 Verifier::Mode mode =
486 throw_verifyerror ? Verifier::ThrowException : Verifier::NoException;
487 return Verifier::verify(this, mode, should_verify_class(), THREAD);
488 }
489
490
491 // Used exclusively by the shared spaces dump mechanism to prevent
492 // classes mapped into the shared regions in new VMs from appearing linked.
493
494 void InstanceKlass::unlink_class() {
495 assert(is_linked(), "must be linked");
496 _init_state = loaded;
497 }
498
499 void InstanceKlass::link_class(TRAPS) {
500 assert(is_loaded(), "must be loaded");
501 if (!is_linked()) {
502 link_class_impl(true, CHECK);
503 }
504 }
505
506 // Called to verify that a class can link during initialization, without
507 // throwing a VerifyError.
508 bool InstanceKlass::link_class_or_fail(TRAPS) {
509 assert(is_loaded(), "must be loaded");
510 if (!is_linked()) {
511 link_class_impl(false, CHECK_false);
512 }
513 return is_linked();
514 }
515
516 bool InstanceKlass::link_class_impl(bool throw_verifyerror, TRAPS) {
517 if (DumpSharedSpaces && is_in_error_state()) {
518 // This is for CDS dumping phase only -- we use the in_error_state to indicate that
519 // the class has failed verification. Throwing the NoClassDefFoundError here is just
520 // a convenient way to stop repeat attempts to verify the same (bad) class.
521 //
522 // Note that the NoClassDefFoundError is not part of the JLS, and should not be thrown
523 // if we are executing Java code. This is not a problem for CDS dumping phase since
524 // it doesn't execute any Java code.
525 ResourceMark rm(THREAD);
526 Exceptions::fthrow(THREAD_AND_LOCATION,
527 vmSymbols::java_lang_NoClassDefFoundError(),
528 "Class %s, or one of its supertypes, failed class initialization",
529 external_name());
530 return false;
531 }
532 // return if already verified
533 if (is_linked()) {
534 return true;
535 }
536
537 // Timing
538 // timer handles recursion
539 assert(THREAD->is_Java_thread(), "non-JavaThread in link_class_impl");
540 JavaThread* jt = (JavaThread*)THREAD;
541
542 // link super class before linking this class
543 Klass* super_klass = super();
544 if (super_klass != NULL) {
545 if (super_klass->is_interface()) { // check if super class is an interface
546 ResourceMark rm(THREAD);
547 Exceptions::fthrow(
548 THREAD_AND_LOCATION,
549 vmSymbols::java_lang_IncompatibleClassChangeError(),
550 "class %s has interface %s as super class",
551 external_name(),
552 super_klass->external_name()
553 );
554 return false;
555 }
556
557 InstanceKlass* ik_super = InstanceKlass::cast(super_klass);
558 ik_super->link_class_impl(throw_verifyerror, CHECK_false);
559 }
560
561 // link all interfaces implemented by this class before linking this class
562 Array<Klass*>* interfaces = local_interfaces();
563 int num_interfaces = interfaces->length();
564 for (int index = 0; index < num_interfaces; index++) {
565 InstanceKlass* interk = InstanceKlass::cast(interfaces->at(index));
566 interk->link_class_impl(throw_verifyerror, CHECK_false);
567 }
568
569 // in case the class is linked in the process of linking its superclasses
570 if (is_linked()) {
571 return true;
572 }
573
574 // trace only the link time for this klass that includes
575 // the verification time
576 PerfClassTraceTime vmtimer(ClassLoader::perf_class_link_time(),
577 ClassLoader::perf_class_link_selftime(),
578 ClassLoader::perf_classes_linked(),
579 jt->get_thread_stat()->perf_recursion_counts_addr(),
580 jt->get_thread_stat()->perf_timers_addr(),
581 PerfClassTraceTime::CLASS_LINK);
582
583 // verification & rewriting
584 {
585 HandleMark hm(THREAD);
586 Handle h_init_lock(THREAD, init_lock());
587 ObjectLocker ol(h_init_lock, THREAD, h_init_lock() != NULL);
588 // rewritten will have been set if loader constraint error found
589 // on an earlier link attempt
590 // don't verify or rewrite if already rewritten
591 //
592
593 if (!is_linked()) {
594 if (!is_rewritten()) {
595 {
596 bool verify_ok = verify_code(throw_verifyerror, THREAD);
597 if (!verify_ok) {
598 return false;
599 }
600 }
601
602 // Just in case a side-effect of verify linked this class already
603 // (which can sometimes happen since the verifier loads classes
604 // using custom class loaders, which are free to initialize things)
605 if (is_linked()) {
606 return true;
607 }
608
609 // also sets rewritten
610 rewrite_class(CHECK_false);
611 } else if (is_shared()) {
612 SystemDictionaryShared::check_verification_constraints(this, CHECK_false);
613 }
614
615 // relocate jsrs and link methods after they are all rewritten
616 link_methods(CHECK_false);
617
618 // Initialize the vtable and interface table after
619 // methods have been rewritten since rewrite may
620 // fabricate new Method*s.
621 // also does loader constraint checking
622 //
623 // initialize_vtable and initialize_itable need to be rerun for
624 // a shared class if the class is not loaded by the NULL classloader.
625 ClassLoaderData * loader_data = class_loader_data();
626 if (!(is_shared() &&
627 loader_data->is_the_null_class_loader_data())) {
628 ResourceMark rm(THREAD);
629 vtable().initialize_vtable(true, CHECK_false);
630 itable().initialize_itable(true, CHECK_false);
631 }
632 #ifdef ASSERT
633 else {
634 vtable().verify(tty, true);
635 // In case itable verification is ever added.
636 // itable().verify(tty, true);
637 }
638 #endif
639 set_init_state(linked);
640 if (JvmtiExport::should_post_class_prepare()) {
641 Thread *thread = THREAD;
642 assert(thread->is_Java_thread(), "thread->is_Java_thread()");
643 JvmtiExport::post_class_prepare((JavaThread *) thread, this);
644 }
645 }
646 }
647 return true;
648 }
649
650
651 // Rewrite the byte codes of all of the methods of a class.
652 // The rewriter must be called exactly once. Rewriting must happen after
653 // verification but before the first method of the class is executed.
654 void InstanceKlass::rewrite_class(TRAPS) {
655 assert(is_loaded(), "must be loaded");
656 if (is_rewritten()) {
657 assert(is_shared(), "rewriting an unshared class?");
658 return;
659 }
660 Rewriter::rewrite(this, CHECK);
661 set_rewritten();
662 }
663
664 // Now relocate and link method entry points after class is rewritten.
665 // This is outside is_rewritten flag. In case of an exception, it can be
666 // executed more than once.
667 void InstanceKlass::link_methods(TRAPS) {
668 int len = methods()->length();
669 for (int i = len-1; i >= 0; i--) {
670 methodHandle m(THREAD, methods()->at(i));
671
672 // Set up method entry points for compiler and interpreter .
673 m->link_method(m, CHECK);
674 }
675 }
676
677 // Eagerly initialize superinterfaces that declare default methods (concrete instance: any access)
678 void InstanceKlass::initialize_super_interfaces(TRAPS) {
679 assert (has_nonstatic_concrete_methods(), "caller should have checked this");
680 for (int i = 0; i < local_interfaces()->length(); ++i) {
681 Klass* iface = local_interfaces()->at(i);
682 InstanceKlass* ik = InstanceKlass::cast(iface);
683
684 // Initialization is depth first search ie. we start with top of the inheritance tree
685 // has_nonstatic_concrete_methods drives searching superinterfaces since it
686 // means has_nonstatic_concrete_methods in its superinterface hierarchy
687 if (ik->has_nonstatic_concrete_methods()) {
688 ik->initialize_super_interfaces(CHECK);
689 }
690
691 // Only initialize() interfaces that "declare" concrete methods.
692 if (ik->should_be_initialized() && ik->declares_nonstatic_concrete_methods()) {
693 ik->initialize(CHECK);
694 }
695 }
696 }
697
698 void InstanceKlass::initialize_impl(TRAPS) {
699 HandleMark hm(THREAD);
700
701 // Make sure klass is linked (verified) before initialization
702 // A class could already be verified, since it has been reflected upon.
703 link_class(CHECK);
704
705 DTRACE_CLASSINIT_PROBE(required, -1);
706
707 bool wait = false;
708
709 // refer to the JVM book page 47 for description of steps
710 // Step 1
711 {
712 Handle h_init_lock(THREAD, init_lock());
713 ObjectLocker ol(h_init_lock, THREAD, h_init_lock() != NULL);
714
715 Thread *self = THREAD; // it's passed the current thread
716
717 // Step 2
718 // If we were to use wait() instead of waitInterruptibly() then
719 // we might end up throwing IE from link/symbol resolution sites
720 // that aren't expected to throw. This would wreak havoc. See 6320309.
721 while(is_being_initialized() && !is_reentrant_initialization(self)) {
722 wait = true;
723 ol.waitUninterruptibly(CHECK);
724 }
725
726 // Step 3
727 if (is_being_initialized() && is_reentrant_initialization(self)) {
728 DTRACE_CLASSINIT_PROBE_WAIT(recursive, -1, wait);
729 return;
730 }
731
732 // Step 4
733 if (is_initialized()) {
734 DTRACE_CLASSINIT_PROBE_WAIT(concurrent, -1, wait);
735 return;
736 }
737
738 // Step 5
739 if (is_in_error_state()) {
740 DTRACE_CLASSINIT_PROBE_WAIT(erroneous, -1, wait);
741 ResourceMark rm(THREAD);
742 const char* desc = "Could not initialize class ";
743 const char* className = external_name();
744 size_t msglen = strlen(desc) + strlen(className) + 1;
745 char* message = NEW_RESOURCE_ARRAY(char, msglen);
746 if (NULL == message) {
747 // Out of memory: can't create detailed error message
748 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), className);
749 } else {
750 jio_snprintf(message, msglen, "%s%s", desc, className);
751 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), message);
752 }
753 }
754
755 // Step 6
756 set_init_state(being_initialized);
757 set_init_thread(self);
758 }
759
760 // Step 7
761 // Next, if C is a class rather than an interface, initialize it's super class and super
762 // interfaces.
763 if (!is_interface()) {
764 Klass* super_klass = super();
765 if (super_klass != NULL && super_klass->should_be_initialized()) {
766 super_klass->initialize(THREAD);
767 }
768 // If C implements any interface that declares a non-static, concrete method,
769 // the initialization of C triggers initialization of its super interfaces.
770 // Only need to recurse if has_nonstatic_concrete_methods which includes declaring and
771 // having a superinterface that declares, non-static, concrete methods
772 if (!HAS_PENDING_EXCEPTION && has_nonstatic_concrete_methods()) {
773 initialize_super_interfaces(THREAD);
774 }
775
776 // If any exceptions, complete abruptly, throwing the same exception as above.
777 if (HAS_PENDING_EXCEPTION) {
778 Handle e(THREAD, PENDING_EXCEPTION);
779 CLEAR_PENDING_EXCEPTION;
780 {
781 EXCEPTION_MARK;
782 // Locks object, set state, and notify all waiting threads
783 set_initialization_state_and_notify(initialization_error, THREAD);
784 CLEAR_PENDING_EXCEPTION;
785 }
786 DTRACE_CLASSINIT_PROBE_WAIT(super__failed, -1, wait);
787 THROW_OOP(e());
788 }
789 }
790
791
792 // Look for aot compiled methods for this klass, including class initializer.
793 AOTLoader::load_for_klass(this, THREAD);
794
795 // Step 8
796 {
797 assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl");
798 JavaThread* jt = (JavaThread*)THREAD;
799 DTRACE_CLASSINIT_PROBE_WAIT(clinit, -1, wait);
800 // Timer includes any side effects of class initialization (resolution,
801 // etc), but not recursive entry into call_class_initializer().
802 PerfClassTraceTime timer(ClassLoader::perf_class_init_time(),
803 ClassLoader::perf_class_init_selftime(),
804 ClassLoader::perf_classes_inited(),
805 jt->get_thread_stat()->perf_recursion_counts_addr(),
806 jt->get_thread_stat()->perf_timers_addr(),
807 PerfClassTraceTime::CLASS_CLINIT);
808 call_class_initializer(THREAD);
809 }
810
811 // Step 9
812 if (!HAS_PENDING_EXCEPTION) {
813 set_initialization_state_and_notify(fully_initialized, CHECK);
814 {
815 debug_only(vtable().verify(tty, true);)
816 }
817 }
818 else {
819 // Step 10 and 11
820 Handle e(THREAD, PENDING_EXCEPTION);
821 CLEAR_PENDING_EXCEPTION;
822 // JVMTI has already reported the pending exception
823 // JVMTI internal flag reset is needed in order to report ExceptionInInitializerError
824 JvmtiExport::clear_detected_exception((JavaThread*)THREAD);
825 {
826 EXCEPTION_MARK;
827 set_initialization_state_and_notify(initialization_error, THREAD);
828 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, class initialization error is thrown below
829 // JVMTI has already reported the pending exception
830 // JVMTI internal flag reset is needed in order to report ExceptionInInitializerError
831 JvmtiExport::clear_detected_exception((JavaThread*)THREAD);
832 }
833 DTRACE_CLASSINIT_PROBE_WAIT(error, -1, wait);
834 if (e->is_a(SystemDictionary::Error_klass())) {
835 THROW_OOP(e());
836 } else {
837 JavaCallArguments args(e);
838 THROW_ARG(vmSymbols::java_lang_ExceptionInInitializerError(),
839 vmSymbols::throwable_void_signature(),
840 &args);
841 }
842 }
843 DTRACE_CLASSINIT_PROBE_WAIT(end, -1, wait);
844 }
845
846
847 void InstanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) {
848 Handle h_init_lock(THREAD, init_lock());
849 if (h_init_lock() != NULL) {
850 ObjectLocker ol(h_init_lock, THREAD);
851 set_init_state(state);
852 fence_and_clear_init_lock();
853 ol.notify_all(CHECK);
854 } else {
855 assert(h_init_lock() != NULL, "The initialization state should never be set twice");
856 set_init_state(state);
857 }
858 }
859
860 // The embedded _implementor field can only record one implementor.
861 // When there are more than one implementors, the _implementor field
862 // is set to the interface Klass* itself. Following are the possible
863 // values for the _implementor field:
864 // NULL - no implementor
865 // implementor Klass* - one implementor
866 // self - more than one implementor
867 //
868 // The _implementor field only exists for interfaces.
869 void InstanceKlass::add_implementor(Klass* k) {
870 assert(Compile_lock->owned_by_self(), "");
871 assert(is_interface(), "not interface");
872 // Filter out my subinterfaces.
873 // (Note: Interfaces are never on the subklass list.)
874 if (InstanceKlass::cast(k)->is_interface()) return;
875
876 // Filter out subclasses whose supers already implement me.
877 // (Note: CHA must walk subclasses of direct implementors
878 // in order to locate indirect implementors.)
879 Klass* sk = k->super();
880 if (sk != NULL && InstanceKlass::cast(sk)->implements_interface(this))
881 // We only need to check one immediate superclass, since the
882 // implements_interface query looks at transitive_interfaces.
883 // Any supers of the super have the same (or fewer) transitive_interfaces.
884 return;
885
886 Klass* ik = implementor();
887 if (ik == NULL) {
888 set_implementor(k);
889 } else if (ik != this) {
890 // There is already an implementor. Use itself as an indicator of
891 // more than one implementors.
892 set_implementor(this);
893 }
894
895 // The implementor also implements the transitive_interfaces
896 for (int index = 0; index < local_interfaces()->length(); index++) {
897 InstanceKlass::cast(local_interfaces()->at(index))->add_implementor(k);
898 }
899 }
900
901 void InstanceKlass::init_implementor() {
902 if (is_interface()) {
903 set_implementor(NULL);
904 }
905 }
906
907
908 void InstanceKlass::process_interfaces(Thread *thread) {
909 // link this class into the implementors list of every interface it implements
910 for (int i = local_interfaces()->length() - 1; i >= 0; i--) {
911 assert(local_interfaces()->at(i)->is_klass(), "must be a klass");
912 InstanceKlass* interf = InstanceKlass::cast(local_interfaces()->at(i));
913 assert(interf->is_interface(), "expected interface");
914 interf->add_implementor(this);
915 }
916 }
917
918 bool InstanceKlass::can_be_primary_super_slow() const {
919 if (is_interface())
920 return false;
921 else
922 return Klass::can_be_primary_super_slow();
923 }
924
925 GrowableArray<Klass*>* InstanceKlass::compute_secondary_supers(int num_extra_slots) {
926 // The secondaries are the implemented interfaces.
927 Array<Klass*>* interfaces = transitive_interfaces();
928 int num_secondaries = num_extra_slots + interfaces->length();
929 if (num_secondaries == 0) {
930 // Must share this for correct bootstrapping!
931 set_secondary_supers(Universe::the_empty_klass_array());
932 return NULL;
933 } else if (num_extra_slots == 0) {
934 // The secondary super list is exactly the same as the transitive interfaces.
935 // Redefine classes has to be careful not to delete this!
936 set_secondary_supers(interfaces);
937 return NULL;
938 } else {
939 // Copy transitive interfaces to a temporary growable array to be constructed
940 // into the secondary super list with extra slots.
941 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(interfaces->length());
942 for (int i = 0; i < interfaces->length(); i++) {
943 secondaries->push(interfaces->at(i));
944 }
945 return secondaries;
946 }
947 }
948
949 bool InstanceKlass::compute_is_subtype_of(Klass* k) {
950 if (k->is_interface()) {
951 return implements_interface(k);
952 } else {
953 return Klass::compute_is_subtype_of(k);
954 }
955 }
956
957 bool InstanceKlass::implements_interface(Klass* k) const {
958 if (this == k) return true;
959 assert(k->is_interface(), "should be an interface class");
960 for (int i = 0; i < transitive_interfaces()->length(); i++) {
961 if (transitive_interfaces()->at(i) == k) {
962 return true;
963 }
964 }
965 return false;
966 }
967
968 bool InstanceKlass::is_same_or_direct_interface(Klass *k) const {
969 // Verify direct super interface
970 if (this == k) return true;
971 assert(k->is_interface(), "should be an interface class");
972 for (int i = 0; i < local_interfaces()->length(); i++) {
973 if (local_interfaces()->at(i) == k) {
974 return true;
975 }
976 }
977 return false;
978 }
979
980 objArrayOop InstanceKlass::allocate_objArray(int n, int length, TRAPS) {
981 if (length < 0) THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
982 if (length > arrayOopDesc::max_array_length(T_OBJECT)) {
983 report_java_out_of_memory("Requested array size exceeds VM limit");
984 JvmtiExport::post_array_size_exhausted();
985 THROW_OOP_0(Universe::out_of_memory_error_array_size());
986 }
987 int size = objArrayOopDesc::object_size(length);
988 Klass* ak = array_klass(n, CHECK_NULL);
989 objArrayOop o =
990 (objArrayOop)CollectedHeap::array_allocate(ak, size, length, CHECK_NULL);
991 return o;
992 }
993
994 instanceOop InstanceKlass::register_finalizer(instanceOop i, TRAPS) {
995 if (TraceFinalizerRegistration) {
996 tty->print("Registered ");
997 i->print_value_on(tty);
998 tty->print_cr(" (" INTPTR_FORMAT ") as finalizable", p2i(i));
999 }
1000 instanceHandle h_i(THREAD, i);
1001 // Pass the handle as argument, JavaCalls::call expects oop as jobjects
1002 JavaValue result(T_VOID);
1003 JavaCallArguments args(h_i);
1004 methodHandle mh (THREAD, Universe::finalizer_register_method());
1005 JavaCalls::call(&result, mh, &args, CHECK_NULL);
1006 return h_i();
1007 }
1008
1009 instanceOop InstanceKlass::allocate_instance(TRAPS) {
1010 bool has_finalizer_flag = has_finalizer(); // Query before possible GC
1011 int size = size_helper(); // Query before forming handle.
1012
1013 instanceOop i;
1014
1015 i = (instanceOop)CollectedHeap::obj_allocate(this, size, CHECK_NULL);
1016 if (has_finalizer_flag && !RegisterFinalizersAtInit) {
1017 i = register_finalizer(i, CHECK_NULL);
1018 }
1019 return i;
1020 }
1021
1022 void InstanceKlass::check_valid_for_instantiation(bool throwError, TRAPS) {
1023 if (is_interface() || is_abstract()) {
1024 ResourceMark rm(THREAD);
1025 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError()
1026 : vmSymbols::java_lang_InstantiationException(), external_name());
1027 }
1028 if (this == SystemDictionary::Class_klass()) {
1029 ResourceMark rm(THREAD);
1030 THROW_MSG(throwError ? vmSymbols::java_lang_IllegalAccessError()
1031 : vmSymbols::java_lang_IllegalAccessException(), external_name());
1032 }
1033 }
1034
1035 Klass* InstanceKlass::array_klass_impl(bool or_null, int n, TRAPS) {
1036 // Need load-acquire for lock-free read
1037 if (array_klasses_acquire() == NULL) {
1038 if (or_null) return NULL;
1039
1040 ResourceMark rm;
1041 JavaThread *jt = (JavaThread *)THREAD;
1042 {
1043 // Atomic creation of array_klasses
1044 MutexLocker mc(Compile_lock, THREAD); // for vtables
1045 MutexLocker ma(MultiArray_lock, THREAD);
1046
1047 // Check if update has already taken place
1048 if (array_klasses() == NULL) {
1049 Klass* k = ObjArrayKlass::allocate_objArray_klass(class_loader_data(), 1, this, CHECK_NULL);
1050 // use 'release' to pair with lock-free load
1051 release_set_array_klasses(k);
1052 }
1053 }
1054 }
1055 // _this will always be set at this point
1056 ObjArrayKlass* oak = (ObjArrayKlass*)array_klasses();
1057 if (or_null) {
1058 return oak->array_klass_or_null(n);
1059 }
1060 return oak->array_klass(n, THREAD);
1061 }
1062
1063 Klass* InstanceKlass::array_klass_impl(bool or_null, TRAPS) {
1064 return array_klass_impl(or_null, 1, THREAD);
1065 }
1066
1067 static int call_class_initializer_counter = 0; // for debugging
1068
1069 Method* InstanceKlass::class_initializer() const {
1070 Method* clinit = find_method(
1071 vmSymbols::class_initializer_name(), vmSymbols::void_method_signature());
1072 if (clinit != NULL && clinit->has_valid_initializer_flags()) {
1073 return clinit;
1074 }
1075 return NULL;
1076 }
1077
1078 void InstanceKlass::call_class_initializer(TRAPS) {
1079 if (ReplayCompiles &&
1080 (ReplaySuppressInitializers == 1 ||
1081 (ReplaySuppressInitializers >= 2 && class_loader() != NULL))) {
1082 // Hide the existence of the initializer for the purpose of replaying the compile
1083 return;
1084 }
1085
1086 methodHandle h_method(THREAD, class_initializer());
1087 assert(!is_initialized(), "we cannot initialize twice");
1088 if (log_is_enabled(Info, class, init)) {
1089 ResourceMark rm;
1090 outputStream* log = Log(class, init)::info_stream();
1091 log->print("%d Initializing ", call_class_initializer_counter++);
1092 name()->print_value_on(log);
1093 log->print_cr("%s (" INTPTR_FORMAT ")", h_method() == NULL ? "(no method)" : "", p2i(this));
1094 }
1095 if (h_method() != NULL) {
1096 JavaCallArguments args; // No arguments
1097 JavaValue result(T_VOID);
1098 JavaCalls::call(&result, h_method, &args, CHECK); // Static call (no args)
1099 }
1100 }
1101
1102
1103 void InstanceKlass::mask_for(const methodHandle& method, int bci,
1104 InterpreterOopMap* entry_for) {
1105 // Lazily create the _oop_map_cache at first request
1106 // Lock-free access requires load_ptr_acquire.
1107 OopMapCache* oop_map_cache =
1108 static_cast<OopMapCache*>(OrderAccess::load_ptr_acquire(&_oop_map_cache));
1109 if (oop_map_cache == NULL) {
1110 MutexLocker x(OopMapCacheAlloc_lock);
1111 // Check if _oop_map_cache was allocated while we were waiting for this lock
1112 if ((oop_map_cache = _oop_map_cache) == NULL) {
1113 oop_map_cache = new OopMapCache();
1114 // Ensure _oop_map_cache is stable, since it is examined without a lock
1115 OrderAccess::release_store_ptr(&_oop_map_cache, oop_map_cache);
1116 }
1117 }
1118 // _oop_map_cache is constant after init; lookup below does its own locking.
1119 oop_map_cache->lookup(method, bci, entry_for);
1120 }
1121
1122
1123 bool InstanceKlass::find_local_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1124 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1125 Symbol* f_name = fs.name();
1126 Symbol* f_sig = fs.signature();
1127 if (f_name == name && f_sig == sig) {
1128 fd->reinitialize(const_cast<InstanceKlass*>(this), fs.index());
1129 return true;
1130 }
1131 }
1132 return false;
1133 }
1134
1135
1136 Klass* InstanceKlass::find_interface_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1137 const int n = local_interfaces()->length();
1138 for (int i = 0; i < n; i++) {
1139 Klass* intf1 = local_interfaces()->at(i);
1140 assert(intf1->is_interface(), "just checking type");
1141 // search for field in current interface
1142 if (InstanceKlass::cast(intf1)->find_local_field(name, sig, fd)) {
1143 assert(fd->is_static(), "interface field must be static");
1144 return intf1;
1145 }
1146 // search for field in direct superinterfaces
1147 Klass* intf2 = InstanceKlass::cast(intf1)->find_interface_field(name, sig, fd);
1148 if (intf2 != NULL) return intf2;
1149 }
1150 // otherwise field lookup fails
1151 return NULL;
1152 }
1153
1154
1155 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1156 // search order according to newest JVM spec (5.4.3.2, p.167).
1157 // 1) search for field in current klass
1158 if (find_local_field(name, sig, fd)) {
1159 return const_cast<InstanceKlass*>(this);
1160 }
1161 // 2) search for field recursively in direct superinterfaces
1162 { Klass* intf = find_interface_field(name, sig, fd);
1163 if (intf != NULL) return intf;
1164 }
1165 // 3) apply field lookup recursively if superclass exists
1166 { Klass* supr = super();
1167 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, fd);
1168 }
1169 // 4) otherwise field lookup fails
1170 return NULL;
1171 }
1172
1173
1174 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, bool is_static, fieldDescriptor* fd) const {
1175 // search order according to newest JVM spec (5.4.3.2, p.167).
1176 // 1) search for field in current klass
1177 if (find_local_field(name, sig, fd)) {
1178 if (fd->is_static() == is_static) return const_cast<InstanceKlass*>(this);
1179 }
1180 // 2) search for field recursively in direct superinterfaces
1181 if (is_static) {
1182 Klass* intf = find_interface_field(name, sig, fd);
1183 if (intf != NULL) return intf;
1184 }
1185 // 3) apply field lookup recursively if superclass exists
1186 { Klass* supr = super();
1187 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, is_static, fd);
1188 }
1189 // 4) otherwise field lookup fails
1190 return NULL;
1191 }
1192
1193
1194 bool InstanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
1195 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1196 if (fs.offset() == offset) {
1197 fd->reinitialize(const_cast<InstanceKlass*>(this), fs.index());
1198 if (fd->is_static() == is_static) return true;
1199 }
1200 }
1201 return false;
1202 }
1203
1204
1205 bool InstanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
1206 Klass* klass = const_cast<InstanceKlass*>(this);
1207 while (klass != NULL) {
1208 if (InstanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) {
1209 return true;
1210 }
1211 klass = klass->super();
1212 }
1213 return false;
1214 }
1215
1216
1217 void InstanceKlass::methods_do(void f(Method* method)) {
1218 // Methods aren't stable until they are loaded. This can be read outside
1219 // a lock through the ClassLoaderData for profiling
1220 if (!is_loaded()) {
1221 return;
1222 }
1223
1224 int len = methods()->length();
1225 for (int index = 0; index < len; index++) {
1226 Method* m = methods()->at(index);
1227 assert(m->is_method(), "must be method");
1228 f(m);
1229 }
1230 }
1231
1232
1233 void InstanceKlass::do_local_static_fields(FieldClosure* cl) {
1234 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1235 if (fs.access_flags().is_static()) {
1236 fieldDescriptor& fd = fs.field_descriptor();
1237 cl->do_field(&fd);
1238 }
1239 }
1240 }
1241
1242
1243 void InstanceKlass::do_local_static_fields(void f(fieldDescriptor*, Handle, TRAPS), Handle mirror, TRAPS) {
1244 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1245 if (fs.access_flags().is_static()) {
1246 fieldDescriptor& fd = fs.field_descriptor();
1247 f(&fd, mirror, CHECK);
1248 }
1249 }
1250 }
1251
1252
1253 static int compare_fields_by_offset(int* a, int* b) {
1254 return a[0] - b[0];
1255 }
1256
1257 void InstanceKlass::do_nonstatic_fields(FieldClosure* cl) {
1258 InstanceKlass* super = superklass();
1259 if (super != NULL) {
1260 super->do_nonstatic_fields(cl);
1261 }
1262 fieldDescriptor fd;
1263 int length = java_fields_count();
1264 // In DebugInfo nonstatic fields are sorted by offset.
1265 int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1), mtClass);
1266 int j = 0;
1267 for (int i = 0; i < length; i += 1) {
1268 fd.reinitialize(this, i);
1269 if (!fd.is_static()) {
1270 fields_sorted[j + 0] = fd.offset();
1271 fields_sorted[j + 1] = i;
1272 j += 2;
1273 }
1274 }
1275 if (j > 0) {
1276 length = j;
1277 // _sort_Fn is defined in growableArray.hpp.
1278 qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset);
1279 for (int i = 0; i < length; i += 2) {
1280 fd.reinitialize(this, fields_sorted[i + 1]);
1281 assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields");
1282 cl->do_field(&fd);
1283 }
1284 }
1285 FREE_C_HEAP_ARRAY(int, fields_sorted);
1286 }
1287
1288
1289 void InstanceKlass::array_klasses_do(void f(Klass* k, TRAPS), TRAPS) {
1290 if (array_klasses() != NULL)
1291 ArrayKlass::cast(array_klasses())->array_klasses_do(f, THREAD);
1292 }
1293
1294 void InstanceKlass::array_klasses_do(void f(Klass* k)) {
1295 if (array_klasses() != NULL)
1296 ArrayKlass::cast(array_klasses())->array_klasses_do(f);
1297 }
1298
1299 #ifdef ASSERT
1300 static int linear_search(const Array<Method*>* methods,
1301 const Symbol* name,
1302 const Symbol* signature) {
1303 const int len = methods->length();
1304 for (int index = 0; index < len; index++) {
1305 const Method* const m = methods->at(index);
1306 assert(m->is_method(), "must be method");
1307 if (m->signature() == signature && m->name() == name) {
1308 return index;
1309 }
1310 }
1311 return -1;
1312 }
1313 #endif
1314
1315 static int binary_search(const Array<Method*>* methods, const Symbol* name) {
1316 int len = methods->length();
1317 // methods are sorted, so do binary search
1318 int l = 0;
1319 int h = len - 1;
1320 while (l <= h) {
1321 int mid = (l + h) >> 1;
1322 Method* m = methods->at(mid);
1323 assert(m->is_method(), "must be method");
1324 int res = m->name()->fast_compare(name);
1325 if (res == 0) {
1326 return mid;
1327 } else if (res < 0) {
1328 l = mid + 1;
1329 } else {
1330 h = mid - 1;
1331 }
1332 }
1333 return -1;
1334 }
1335
1336 // find_method looks up the name/signature in the local methods array
1337 Method* InstanceKlass::find_method(const Symbol* name,
1338 const Symbol* signature) const {
1339 return find_method_impl(name, signature, find_overpass, find_static, find_private);
1340 }
1341
1342 Method* InstanceKlass::find_method_impl(const Symbol* name,
1343 const Symbol* signature,
1344 OverpassLookupMode overpass_mode,
1345 StaticLookupMode static_mode,
1346 PrivateLookupMode private_mode) const {
1347 return InstanceKlass::find_method_impl(methods(),
1348 name,
1349 signature,
1350 overpass_mode,
1351 static_mode,
1352 private_mode);
1353 }
1354
1355 // find_instance_method looks up the name/signature in the local methods array
1356 // and skips over static methods
1357 Method* InstanceKlass::find_instance_method(const Array<Method*>* methods,
1358 const Symbol* name,
1359 const Symbol* signature) {
1360 Method* const meth = InstanceKlass::find_method_impl(methods,
1361 name,
1362 signature,
1363 find_overpass,
1364 skip_static,
1365 find_private);
1366 assert(((meth == NULL) || !meth->is_static()),
1367 "find_instance_method should have skipped statics");
1368 return meth;
1369 }
1370
1371 // find_instance_method looks up the name/signature in the local methods array
1372 // and skips over static methods
1373 Method* InstanceKlass::find_instance_method(const Symbol* name, const Symbol* signature) const {
1374 return InstanceKlass::find_instance_method(methods(), name, signature);
1375 }
1376
1377 // Find looks up the name/signature in the local methods array
1378 // and filters on the overpass, static and private flags
1379 // This returns the first one found
1380 // note that the local methods array can have up to one overpass, one static
1381 // and one instance (private or not) with the same name/signature
1382 Method* InstanceKlass::find_local_method(const Symbol* name,
1383 const Symbol* signature,
1384 OverpassLookupMode overpass_mode,
1385 StaticLookupMode static_mode,
1386 PrivateLookupMode private_mode) const {
1387 return InstanceKlass::find_method_impl(methods(),
1388 name,
1389 signature,
1390 overpass_mode,
1391 static_mode,
1392 private_mode);
1393 }
1394
1395 // Find looks up the name/signature in the local methods array
1396 // and filters on the overpass, static and private flags
1397 // This returns the first one found
1398 // note that the local methods array can have up to one overpass, one static
1399 // and one instance (private or not) with the same name/signature
1400 Method* InstanceKlass::find_local_method(const Array<Method*>* methods,
1401 const Symbol* name,
1402 const Symbol* signature,
1403 OverpassLookupMode overpass_mode,
1404 StaticLookupMode static_mode,
1405 PrivateLookupMode private_mode) {
1406 return InstanceKlass::find_method_impl(methods,
1407 name,
1408 signature,
1409 overpass_mode,
1410 static_mode,
1411 private_mode);
1412 }
1413
1414 Method* InstanceKlass::find_method(const Array<Method*>* methods,
1415 const Symbol* name,
1416 const Symbol* signature) {
1417 return InstanceKlass::find_method_impl(methods,
1418 name,
1419 signature,
1420 find_overpass,
1421 find_static,
1422 find_private);
1423 }
1424
1425 Method* InstanceKlass::find_method_impl(const Array<Method*>* methods,
1426 const Symbol* name,
1427 const Symbol* signature,
1428 OverpassLookupMode overpass_mode,
1429 StaticLookupMode static_mode,
1430 PrivateLookupMode private_mode) {
1431 int hit = find_method_index(methods, name, signature, overpass_mode, static_mode, private_mode);
1432 return hit >= 0 ? methods->at(hit): NULL;
1433 }
1434
1435 // true if method matches signature and conforms to skipping_X conditions.
1436 static bool method_matches(const Method* m,
1437 const Symbol* signature,
1438 bool skipping_overpass,
1439 bool skipping_static,
1440 bool skipping_private) {
1441 return ((m->signature() == signature) &&
1442 (!skipping_overpass || !m->is_overpass()) &&
1443 (!skipping_static || !m->is_static()) &&
1444 (!skipping_private || !m->is_private()));
1445 }
1446
1447 // Used directly for default_methods to find the index into the
1448 // default_vtable_indices, and indirectly by find_method
1449 // find_method_index looks in the local methods array to return the index
1450 // of the matching name/signature. If, overpass methods are being ignored,
1451 // the search continues to find a potential non-overpass match. This capability
1452 // is important during method resolution to prefer a static method, for example,
1453 // over an overpass method.
1454 // There is the possibility in any _method's array to have the same name/signature
1455 // for a static method, an overpass method and a local instance method
1456 // To correctly catch a given method, the search criteria may need
1457 // to explicitly skip the other two. For local instance methods, it
1458 // is often necessary to skip private methods
1459 int InstanceKlass::find_method_index(const Array<Method*>* methods,
1460 const Symbol* name,
1461 const Symbol* signature,
1462 OverpassLookupMode overpass_mode,
1463 StaticLookupMode static_mode,
1464 PrivateLookupMode private_mode) {
1465 const bool skipping_overpass = (overpass_mode == skip_overpass);
1466 const bool skipping_static = (static_mode == skip_static);
1467 const bool skipping_private = (private_mode == skip_private);
1468 const int hit = binary_search(methods, name);
1469 if (hit != -1) {
1470 const Method* const m = methods->at(hit);
1471
1472 // Do linear search to find matching signature. First, quick check
1473 // for common case, ignoring overpasses if requested.
1474 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) {
1475 return hit;
1476 }
1477
1478 // search downwards through overloaded methods
1479 int i;
1480 for (i = hit - 1; i >= 0; --i) {
1481 const Method* const m = methods->at(i);
1482 assert(m->is_method(), "must be method");
1483 if (m->name() != name) {
1484 break;
1485 }
1486 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) {
1487 return i;
1488 }
1489 }
1490 // search upwards
1491 for (i = hit + 1; i < methods->length(); ++i) {
1492 const Method* const m = methods->at(i);
1493 assert(m->is_method(), "must be method");
1494 if (m->name() != name) {
1495 break;
1496 }
1497 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) {
1498 return i;
1499 }
1500 }
1501 // not found
1502 #ifdef ASSERT
1503 const int index = (skipping_overpass || skipping_static || skipping_private) ? -1 :
1504 linear_search(methods, name, signature);
1505 assert(-1 == index, "binary search should have found entry %d", index);
1506 #endif
1507 }
1508 return -1;
1509 }
1510
1511 int InstanceKlass::find_method_by_name(const Symbol* name, int* end) const {
1512 return find_method_by_name(methods(), name, end);
1513 }
1514
1515 int InstanceKlass::find_method_by_name(const Array<Method*>* methods,
1516 const Symbol* name,
1517 int* end_ptr) {
1518 assert(end_ptr != NULL, "just checking");
1519 int start = binary_search(methods, name);
1520 int end = start + 1;
1521 if (start != -1) {
1522 while (start - 1 >= 0 && (methods->at(start - 1))->name() == name) --start;
1523 while (end < methods->length() && (methods->at(end))->name() == name) ++end;
1524 *end_ptr = end;
1525 return start;
1526 }
1527 return -1;
1528 }
1529
1530 // uncached_lookup_method searches both the local class methods array and all
1531 // superclasses methods arrays, skipping any overpass methods in superclasses.
1532 Method* InstanceKlass::uncached_lookup_method(const Symbol* name,
1533 const Symbol* signature,
1534 OverpassLookupMode overpass_mode) const {
1535 OverpassLookupMode overpass_local_mode = overpass_mode;
1536 const Klass* klass = this;
1537 while (klass != NULL) {
1538 Method* const method = InstanceKlass::cast(klass)->find_method_impl(name,
1539 signature,
1540 overpass_local_mode,
1541 find_static,
1542 find_private);
1543 if (method != NULL) {
1544 return method;
1545 }
1546 klass = klass->super();
1547 overpass_local_mode = skip_overpass; // Always ignore overpass methods in superclasses
1548 }
1549 return NULL;
1550 }
1551
1552 #ifdef ASSERT
1553 // search through class hierarchy and return true if this class or
1554 // one of the superclasses was redefined
1555 bool InstanceKlass::has_redefined_this_or_super() const {
1556 const Klass* klass = this;
1557 while (klass != NULL) {
1558 if (InstanceKlass::cast(klass)->has_been_redefined()) {
1559 return true;
1560 }
1561 klass = klass->super();
1562 }
1563 return false;
1564 }
1565 #endif
1566
1567 // lookup a method in the default methods list then in all transitive interfaces
1568 // Do NOT return private or static methods
1569 Method* InstanceKlass::lookup_method_in_ordered_interfaces(Symbol* name,
1570 Symbol* signature) const {
1571 Method* m = NULL;
1572 if (default_methods() != NULL) {
1573 m = find_method(default_methods(), name, signature);
1574 }
1575 // Look up interfaces
1576 if (m == NULL) {
1577 m = lookup_method_in_all_interfaces(name, signature, find_defaults);
1578 }
1579 return m;
1580 }
1581
1582 // lookup a method in all the interfaces that this class implements
1583 // Do NOT return private or static methods, new in JDK8 which are not externally visible
1584 // They should only be found in the initial InterfaceMethodRef
1585 Method* InstanceKlass::lookup_method_in_all_interfaces(Symbol* name,
1586 Symbol* signature,
1587 DefaultsLookupMode defaults_mode) const {
1588 Array<Klass*>* all_ifs = transitive_interfaces();
1589 int num_ifs = all_ifs->length();
1590 InstanceKlass *ik = NULL;
1591 for (int i = 0; i < num_ifs; i++) {
1592 ik = InstanceKlass::cast(all_ifs->at(i));
1593 Method* m = ik->lookup_method(name, signature);
1594 if (m != NULL && m->is_public() && !m->is_static() &&
1595 ((defaults_mode != skip_defaults) || !m->is_default_method())) {
1596 return m;
1597 }
1598 }
1599 return NULL;
1600 }
1601
1602 /* jni_id_for_impl for jfieldIds only */
1603 JNIid* InstanceKlass::jni_id_for_impl(int offset) {
1604 MutexLocker ml(JfieldIdCreation_lock);
1605 // Retry lookup after we got the lock
1606 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset);
1607 if (probe == NULL) {
1608 // Slow case, allocate new static field identifier
1609 probe = new JNIid(this, offset, jni_ids());
1610 set_jni_ids(probe);
1611 }
1612 return probe;
1613 }
1614
1615
1616 /* jni_id_for for jfieldIds only */
1617 JNIid* InstanceKlass::jni_id_for(int offset) {
1618 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset);
1619 if (probe == NULL) {
1620 probe = jni_id_for_impl(offset);
1621 }
1622 return probe;
1623 }
1624
1625 u2 InstanceKlass::enclosing_method_data(int offset) const {
1626 const Array<jushort>* const inner_class_list = inner_classes();
1627 if (inner_class_list == NULL) {
1628 return 0;
1629 }
1630 const int length = inner_class_list->length();
1631 if (length % inner_class_next_offset == 0) {
1632 return 0;
1633 }
1634 const int index = length - enclosing_method_attribute_size;
1635 assert(offset < enclosing_method_attribute_size, "invalid offset");
1636 return inner_class_list->at(index + offset);
1637 }
1638
1639 void InstanceKlass::set_enclosing_method_indices(u2 class_index,
1640 u2 method_index) {
1641 Array<jushort>* inner_class_list = inner_classes();
1642 assert (inner_class_list != NULL, "_inner_classes list is not set up");
1643 int length = inner_class_list->length();
1644 if (length % inner_class_next_offset == enclosing_method_attribute_size) {
1645 int index = length - enclosing_method_attribute_size;
1646 inner_class_list->at_put(
1647 index + enclosing_method_class_index_offset, class_index);
1648 inner_class_list->at_put(
1649 index + enclosing_method_method_index_offset, method_index);
1650 }
1651 }
1652
1653 // Lookup or create a jmethodID.
1654 // This code is called by the VMThread and JavaThreads so the
1655 // locking has to be done very carefully to avoid deadlocks
1656 // and/or other cache consistency problems.
1657 //
1658 jmethodID InstanceKlass::get_jmethod_id(const methodHandle& method_h) {
1659 size_t idnum = (size_t)method_h->method_idnum();
1660 jmethodID* jmeths = methods_jmethod_ids_acquire();
1661 size_t length = 0;
1662 jmethodID id = NULL;
1663
1664 // We use a double-check locking idiom here because this cache is
1665 // performance sensitive. In the normal system, this cache only
1666 // transitions from NULL to non-NULL which is safe because we use
1667 // release_set_methods_jmethod_ids() to advertise the new cache.
1668 // A partially constructed cache should never be seen by a racing
1669 // thread. We also use release_store_ptr() to save a new jmethodID
1670 // in the cache so a partially constructed jmethodID should never be
1671 // seen either. Cache reads of existing jmethodIDs proceed without a
1672 // lock, but cache writes of a new jmethodID requires uniqueness and
1673 // creation of the cache itself requires no leaks so a lock is
1674 // generally acquired in those two cases.
1675 //
1676 // If the RedefineClasses() API has been used, then this cache can
1677 // grow and we'll have transitions from non-NULL to bigger non-NULL.
1678 // Cache creation requires no leaks and we require safety between all
1679 // cache accesses and freeing of the old cache so a lock is generally
1680 // acquired when the RedefineClasses() API has been used.
1681
1682 if (jmeths != NULL) {
1683 // the cache already exists
1684 if (!idnum_can_increment()) {
1685 // the cache can't grow so we can just get the current values
1686 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
1687 } else {
1688 // cache can grow so we have to be more careful
1689 if (Threads::number_of_threads() == 0 ||
1690 SafepointSynchronize::is_at_safepoint()) {
1691 // we're single threaded or at a safepoint - no locking needed
1692 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
1693 } else {
1694 MutexLocker ml(JmethodIdCreation_lock);
1695 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
1696 }
1697 }
1698 }
1699 // implied else:
1700 // we need to allocate a cache so default length and id values are good
1701
1702 if (jmeths == NULL || // no cache yet
1703 length <= idnum || // cache is too short
1704 id == NULL) { // cache doesn't contain entry
1705
1706 // This function can be called by the VMThread so we have to do all
1707 // things that might block on a safepoint before grabbing the lock.
1708 // Otherwise, we can deadlock with the VMThread or have a cache
1709 // consistency issue. These vars keep track of what we might have
1710 // to free after the lock is dropped.
1711 jmethodID to_dealloc_id = NULL;
1712 jmethodID* to_dealloc_jmeths = NULL;
1713
1714 // may not allocate new_jmeths or use it if we allocate it
1715 jmethodID* new_jmeths = NULL;
1716 if (length <= idnum) {
1717 // allocate a new cache that might be used
1718 size_t size = MAX2(idnum+1, (size_t)idnum_allocated_count());
1719 new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1, mtClass);
1720 memset(new_jmeths, 0, (size+1)*sizeof(jmethodID));
1721 // cache size is stored in element[0], other elements offset by one
1722 new_jmeths[0] = (jmethodID)size;
1723 }
1724
1725 // allocate a new jmethodID that might be used
1726 jmethodID new_id = NULL;
1727 if (method_h->is_old() && !method_h->is_obsolete()) {
1728 // The method passed in is old (but not obsolete), we need to use the current version
1729 Method* current_method = method_with_idnum((int)idnum);
1730 assert(current_method != NULL, "old and but not obsolete, so should exist");
1731 new_id = Method::make_jmethod_id(class_loader_data(), current_method);
1732 } else {
1733 // It is the current version of the method or an obsolete method,
1734 // use the version passed in
1735 new_id = Method::make_jmethod_id(class_loader_data(), method_h());
1736 }
1737
1738 if (Threads::number_of_threads() == 0 ||
1739 SafepointSynchronize::is_at_safepoint()) {
1740 // we're single threaded or at a safepoint - no locking needed
1741 id = get_jmethod_id_fetch_or_update(idnum, new_id, new_jmeths,
1742 &to_dealloc_id, &to_dealloc_jmeths);
1743 } else {
1744 MutexLocker ml(JmethodIdCreation_lock);
1745 id = get_jmethod_id_fetch_or_update(idnum, new_id, new_jmeths,
1746 &to_dealloc_id, &to_dealloc_jmeths);
1747 }
1748
1749 // The lock has been dropped so we can free resources.
1750 // Free up either the old cache or the new cache if we allocated one.
1751 if (to_dealloc_jmeths != NULL) {
1752 FreeHeap(to_dealloc_jmeths);
1753 }
1754 // free up the new ID since it wasn't needed
1755 if (to_dealloc_id != NULL) {
1756 Method::destroy_jmethod_id(class_loader_data(), to_dealloc_id);
1757 }
1758 }
1759 return id;
1760 }
1761
1762 // Figure out how many jmethodIDs haven't been allocated, and make
1763 // sure space for them is pre-allocated. This makes getting all
1764 // method ids much, much faster with classes with more than 8
1765 // methods, and has a *substantial* effect on performance with jvmti
1766 // code that loads all jmethodIDs for all classes.
1767 void InstanceKlass::ensure_space_for_methodids(int start_offset) {
1768 int new_jmeths = 0;
1769 int length = methods()->length();
1770 for (int index = start_offset; index < length; index++) {
1771 Method* m = methods()->at(index);
1772 jmethodID id = m->find_jmethod_id_or_null();
1773 if (id == NULL) {
1774 new_jmeths++;
1775 }
1776 }
1777 if (new_jmeths != 0) {
1778 Method::ensure_jmethod_ids(class_loader_data(), new_jmeths);
1779 }
1780 }
1781
1782 // Common code to fetch the jmethodID from the cache or update the
1783 // cache with the new jmethodID. This function should never do anything
1784 // that causes the caller to go to a safepoint or we can deadlock with
1785 // the VMThread or have cache consistency issues.
1786 //
1787 jmethodID InstanceKlass::get_jmethod_id_fetch_or_update(
1788 size_t idnum, jmethodID new_id,
1789 jmethodID* new_jmeths, jmethodID* to_dealloc_id_p,
1790 jmethodID** to_dealloc_jmeths_p) {
1791 assert(new_id != NULL, "sanity check");
1792 assert(to_dealloc_id_p != NULL, "sanity check");
1793 assert(to_dealloc_jmeths_p != NULL, "sanity check");
1794 assert(Threads::number_of_threads() == 0 ||
1795 SafepointSynchronize::is_at_safepoint() ||
1796 JmethodIdCreation_lock->owned_by_self(), "sanity check");
1797
1798 // reacquire the cache - we are locked, single threaded or at a safepoint
1799 jmethodID* jmeths = methods_jmethod_ids_acquire();
1800 jmethodID id = NULL;
1801 size_t length = 0;
1802
1803 if (jmeths == NULL || // no cache yet
1804 (length = (size_t)jmeths[0]) <= idnum) { // cache is too short
1805 if (jmeths != NULL) {
1806 // copy any existing entries from the old cache
1807 for (size_t index = 0; index < length; index++) {
1808 new_jmeths[index+1] = jmeths[index+1];
1809 }
1810 *to_dealloc_jmeths_p = jmeths; // save old cache for later delete
1811 }
1812 release_set_methods_jmethod_ids(jmeths = new_jmeths);
1813 } else {
1814 // fetch jmethodID (if any) from the existing cache
1815 id = jmeths[idnum+1];
1816 *to_dealloc_jmeths_p = new_jmeths; // save new cache for later delete
1817 }
1818 if (id == NULL) {
1819 // No matching jmethodID in the existing cache or we have a new
1820 // cache or we just grew the cache. This cache write is done here
1821 // by the first thread to win the foot race because a jmethodID
1822 // needs to be unique once it is generally available.
1823 id = new_id;
1824
1825 // The jmethodID cache can be read while unlocked so we have to
1826 // make sure the new jmethodID is complete before installing it
1827 // in the cache.
1828 OrderAccess::release_store_ptr(&jmeths[idnum+1], id);
1829 } else {
1830 *to_dealloc_id_p = new_id; // save new id for later delete
1831 }
1832 return id;
1833 }
1834
1835
1836 // Common code to get the jmethodID cache length and the jmethodID
1837 // value at index idnum if there is one.
1838 //
1839 void InstanceKlass::get_jmethod_id_length_value(jmethodID* cache,
1840 size_t idnum, size_t *length_p, jmethodID* id_p) {
1841 assert(cache != NULL, "sanity check");
1842 assert(length_p != NULL, "sanity check");
1843 assert(id_p != NULL, "sanity check");
1844
1845 // cache size is stored in element[0], other elements offset by one
1846 *length_p = (size_t)cache[0];
1847 if (*length_p <= idnum) { // cache is too short
1848 *id_p = NULL;
1849 } else {
1850 *id_p = cache[idnum+1]; // fetch jmethodID (if any)
1851 }
1852 }
1853
1854
1855 // Lookup a jmethodID, NULL if not found. Do no blocking, no allocations, no handles
1856 jmethodID InstanceKlass::jmethod_id_or_null(Method* method) {
1857 size_t idnum = (size_t)method->method_idnum();
1858 jmethodID* jmeths = methods_jmethod_ids_acquire();
1859 size_t length; // length assigned as debugging crumb
1860 jmethodID id = NULL;
1861 if (jmeths != NULL && // If there is a cache
1862 (length = (size_t)jmeths[0]) > idnum) { // and if it is long enough,
1863 id = jmeths[idnum+1]; // Look up the id (may be NULL)
1864 }
1865 return id;
1866 }
1867
1868 inline DependencyContext InstanceKlass::dependencies() {
1869 DependencyContext dep_context(&_dep_context);
1870 return dep_context;
1871 }
1872
1873 int InstanceKlass::mark_dependent_nmethods(KlassDepChange& changes) {
1874 return dependencies().mark_dependent_nmethods(changes);
1875 }
1876
1877 void InstanceKlass::add_dependent_nmethod(nmethod* nm) {
1878 dependencies().add_dependent_nmethod(nm);
1879 }
1880
1881 void InstanceKlass::remove_dependent_nmethod(nmethod* nm, bool delete_immediately) {
1882 dependencies().remove_dependent_nmethod(nm, delete_immediately);
1883 }
1884
1885 #ifndef PRODUCT
1886 void InstanceKlass::print_dependent_nmethods(bool verbose) {
1887 dependencies().print_dependent_nmethods(verbose);
1888 }
1889
1890 bool InstanceKlass::is_dependent_nmethod(nmethod* nm) {
1891 return dependencies().is_dependent_nmethod(nm);
1892 }
1893 #endif //PRODUCT
1894
1895 void InstanceKlass::clean_weak_instanceklass_links(BoolObjectClosure* is_alive) {
1896 clean_implementors_list(is_alive);
1897 clean_method_data(is_alive);
1898
1899 // Since GC iterates InstanceKlasses sequentially, it is safe to remove stale entries here.
1900 DependencyContext dep_context(&_dep_context);
1901 dep_context.expunge_stale_entries();
1902 }
1903
1904 void InstanceKlass::clean_implementors_list(BoolObjectClosure* is_alive) {
1905 assert(class_loader_data()->is_alive(is_alive), "this klass should be live");
1906 if (is_interface()) {
1907 if (ClassUnloading) {
1908 Klass* impl = implementor();
1909 if (impl != NULL) {
1910 if (!impl->is_loader_alive(is_alive)) {
1911 // remove this guy
1912 Klass** klass = adr_implementor();
1913 assert(klass != NULL, "null klass");
1914 if (klass != NULL) {
1915 *klass = NULL;
1916 }
1917 }
1918 }
1919 }
1920 }
1921 }
1922
1923 void InstanceKlass::clean_method_data(BoolObjectClosure* is_alive) {
1924 for (int m = 0; m < methods()->length(); m++) {
1925 MethodData* mdo = methods()->at(m)->method_data();
1926 if (mdo != NULL) {
1927 mdo->clean_method_data(is_alive);
1928 }
1929 }
1930 }
1931
1932 bool InstanceKlass::supers_have_passed_fingerprint_checks() {
1933 if (java_super() != NULL && !java_super()->has_passed_fingerprint_check()) {
1934 ResourceMark rm;
1935 log_trace(class, fingerprint)("%s : super %s not fingerprinted", external_name(), java_super()->external_name());
1936 return false;
1937 }
1938
1939 Array<Klass*>* local_interfaces = this->local_interfaces();
1940 if (local_interfaces != NULL) {
1941 int length = local_interfaces->length();
1942 for (int i = 0; i < length; i++) {
1943 InstanceKlass* intf = InstanceKlass::cast(local_interfaces->at(i));
1944 if (!intf->has_passed_fingerprint_check()) {
1945 ResourceMark rm;
1946 log_trace(class, fingerprint)("%s : interface %s not fingerprinted", external_name(), intf->external_name());
1947 return false;
1948 }
1949 }
1950 }
1951
1952 return true;
1953 }
1954
1955 bool InstanceKlass::should_store_fingerprint() {
1956 #if INCLUDE_AOT
1957 // We store the fingerprint into the InstanceKlass only in the following 2 cases:
1958 if (CalculateClassFingerprint) {
1959 // (1) We are running AOT to generate a shared library.
1960 return true;
1961 }
1962 if (DumpSharedSpaces) {
1963 // (2) We are running -Xshare:dump to create a shared archive
1964 return true;
1965 }
1966 #endif
1967
1968 // In all other cases we might set the _misc_has_passed_fingerprint_check bit,
1969 // but do not store the 64-bit fingerprint to save space.
1970 return false;
1971 }
1972
1973 bool InstanceKlass::has_stored_fingerprint() const {
1974 #if INCLUDE_AOT
1975 return should_store_fingerprint() || is_shared();
1976 #else
1977 return false;
1978 #endif
1979 }
1980
1981 uint64_t InstanceKlass::get_stored_fingerprint() const {
1982 address adr = adr_fingerprint();
1983 if (adr != NULL) {
1984 return (uint64_t)Bytes::get_native_u8(adr); // adr may not be 64-bit aligned
1985 }
1986 return 0;
1987 }
1988
1989 void InstanceKlass::store_fingerprint(uint64_t fingerprint) {
1990 address adr = adr_fingerprint();
1991 if (adr != NULL) {
1992 Bytes::put_native_u8(adr, (u8)fingerprint); // adr may not be 64-bit aligned
1993
1994 ResourceMark rm;
1995 log_trace(class, fingerprint)("stored as " PTR64_FORMAT " for class %s", fingerprint, external_name());
1996 }
1997 }
1998
1999 void InstanceKlass::remove_unshareable_info() {
2000 Klass::remove_unshareable_info();
2001
2002 if (is_in_error_state()) {
2003 // Classes are attempted to link during dumping and may fail,
2004 // but these classes are still in the dictionary and class list in CLD.
2005 // Check in_error state first because in_error is > linked state, so
2006 // is_linked() is true.
2007 // If there's a linking error, there is nothing else to remove.
2008 return;
2009 }
2010
2011 // Unlink the class
2012 if (is_linked()) {
2013 unlink_class();
2014 }
2015 init_implementor();
2016
2017 constants()->remove_unshareable_info();
2018
2019 assert(_dep_context == DependencyContext::EMPTY, "dependency context is not shareable");
2020
2021 for (int i = 0; i < methods()->length(); i++) {
2022 Method* m = methods()->at(i);
2023 m->remove_unshareable_info();
2024 }
2025 }
2026
2027 static void restore_unshareable_in_class(Klass* k, TRAPS) {
2028 // Array classes have null protection domain.
2029 // --> see ArrayKlass::complete_create_array_klass()
2030 k->restore_unshareable_info(ClassLoaderData::the_null_class_loader_data(), Handle(), CHECK);
2031 }
2032
2033 void InstanceKlass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) {
2034 set_package(loader_data, CHECK);
2035 Klass::restore_unshareable_info(loader_data, protection_domain, CHECK);
2036
2037 Array<Method*>* methods = this->methods();
2038 int num_methods = methods->length();
2039 for (int index2 = 0; index2 < num_methods; ++index2) {
2040 methodHandle m(THREAD, methods->at(index2));
2041 m->restore_unshareable_info(CHECK);
2042 }
2043 if (JvmtiExport::has_redefined_a_class()) {
2044 // Reinitialize vtable because RedefineClasses may have changed some
2045 // entries in this vtable for super classes so the CDS vtable might
2046 // point to old or obsolete entries. RedefineClasses doesn't fix up
2047 // vtables in the shared system dictionary, only the main one.
2048 // It also redefines the itable too so fix that too.
2049 ResourceMark rm(THREAD);
2050 vtable().initialize_vtable(false, CHECK);
2051 itable().initialize_itable(false, CHECK);
2052 }
2053
2054 // restore constant pool resolved references
2055 constants()->restore_unshareable_info(CHECK);
2056
2057 array_klasses_do(restore_unshareable_in_class, CHECK);
2058 }
2059
2060 // returns true IFF is_in_error_state() has been changed as a result of this call.
2061 bool InstanceKlass::check_sharing_error_state() {
2062 assert(DumpSharedSpaces, "should only be called during dumping");
2063 bool old_state = is_in_error_state();
2064
2065 if (!is_in_error_state()) {
2066 bool bad = false;
2067 for (InstanceKlass* sup = java_super(); sup; sup = sup->java_super()) {
2068 if (sup->is_in_error_state()) {
2069 bad = true;
2070 break;
2071 }
2072 }
2073 if (!bad) {
2074 Array<Klass*>* interfaces = transitive_interfaces();
2075 for (int i = 0; i < interfaces->length(); i++) {
2076 Klass* iface = interfaces->at(i);
2077 if (InstanceKlass::cast(iface)->is_in_error_state()) {
2078 bad = true;
2079 break;
2080 }
2081 }
2082 }
2083
2084 if (bad) {
2085 set_in_error_state();
2086 }
2087 }
2088
2089 return (old_state != is_in_error_state());
2090 }
2091
2092 #if INCLUDE_JVMTI
2093 static void clear_all_breakpoints(Method* m) {
2094 m->clear_all_breakpoints();
2095 }
2096 #endif
2097
2098 void InstanceKlass::notify_unload_class(InstanceKlass* ik) {
2099 // notify the debugger
2100 if (JvmtiExport::should_post_class_unload()) {
2101 JvmtiExport::post_class_unload(ik);
2102 }
2103
2104 // notify ClassLoadingService of class unload
2105 ClassLoadingService::notify_class_unloaded(ik);
2106 }
2107
2108 void InstanceKlass::release_C_heap_structures(InstanceKlass* ik) {
2109 // Clean up C heap
2110 ik->release_C_heap_structures();
2111 ik->constants()->release_C_heap_structures();
2112 }
2113
2114 void InstanceKlass::release_C_heap_structures() {
2115 // Can't release the constant pool here because the constant pool can be
2116 // deallocated separately from the InstanceKlass for default methods and
2117 // redefine classes.
2118
2119 // Deallocate oop map cache
2120 if (_oop_map_cache != NULL) {
2121 delete _oop_map_cache;
2122 _oop_map_cache = NULL;
2123 }
2124
2125 // Deallocate JNI identifiers for jfieldIDs
2126 JNIid::deallocate(jni_ids());
2127 set_jni_ids(NULL);
2128
2129 jmethodID* jmeths = methods_jmethod_ids_acquire();
2130 if (jmeths != (jmethodID*)NULL) {
2131 release_set_methods_jmethod_ids(NULL);
2132 FreeHeap(jmeths);
2133 }
2134
2135 // Release dependencies.
2136 // It is desirable to use DC::remove_all_dependents() here, but, unfortunately,
2137 // it is not safe (see JDK-8143408). The problem is that the klass dependency
2138 // context can contain live dependencies, since there's a race between nmethod &
2139 // klass unloading. If the klass is dead when nmethod unloading happens, relevant
2140 // dependencies aren't removed from the context associated with the class (see
2141 // nmethod::flush_dependencies). It ends up during klass unloading as seemingly
2142 // live dependencies pointing to unloaded nmethods and causes a crash in
2143 // DC::remove_all_dependents() when it touches unloaded nmethod.
2144 dependencies().wipe();
2145
2146 #if INCLUDE_JVMTI
2147 // Deallocate breakpoint records
2148 if (breakpoints() != 0x0) {
2149 methods_do(clear_all_breakpoints);
2150 assert(breakpoints() == 0x0, "should have cleared breakpoints");
2151 }
2152
2153 // deallocate the cached class file
2154 if (_cached_class_file != NULL && !MetaspaceShared::is_in_shared_space(_cached_class_file)) {
2155 os::free(_cached_class_file);
2156 _cached_class_file = NULL;
2157 }
2158 #endif
2159
2160 // Decrement symbol reference counts associated with the unloaded class.
2161 if (_name != NULL) _name->decrement_refcount();
2162 // unreference array name derived from this class name (arrays of an unloaded
2163 // class can't be referenced anymore).
2164 if (_array_name != NULL) _array_name->decrement_refcount();
2165 if (_source_debug_extension != NULL) FREE_C_HEAP_ARRAY(char, _source_debug_extension);
2166
2167 assert(_total_instanceKlass_count >= 1, "Sanity check");
2168 Atomic::dec(&_total_instanceKlass_count);
2169 }
2170
2171 void InstanceKlass::set_source_debug_extension(const char* array, int length) {
2172 if (array == NULL) {
2173 _source_debug_extension = NULL;
2174 } else {
2175 // Adding one to the attribute length in order to store a null terminator
2176 // character could cause an overflow because the attribute length is
2177 // already coded with an u4 in the classfile, but in practice, it's
2178 // unlikely to happen.
2179 assert((length+1) > length, "Overflow checking");
2180 char* sde = NEW_C_HEAP_ARRAY(char, (length + 1), mtClass);
2181 for (int i = 0; i < length; i++) {
2182 sde[i] = array[i];
2183 }
2184 sde[length] = '\0';
2185 _source_debug_extension = sde;
2186 }
2187 }
2188
2189 address InstanceKlass::static_field_addr(int offset) {
2190 return (address)(offset + InstanceMirrorKlass::offset_of_static_fields() + cast_from_oop<intptr_t>(java_mirror()));
2191 }
2192
2193
2194 const char* InstanceKlass::signature_name() const {
2195 int hash_len = 0;
2196 char hash_buf[40];
2197
2198 // If this is an anonymous class, append a hash to make the name unique
2199 if (is_anonymous()) {
2200 intptr_t hash = (java_mirror() != NULL) ? java_mirror()->identity_hash() : 0;
2201 jio_snprintf(hash_buf, sizeof(hash_buf), "/" UINTX_FORMAT, (uintx)hash);
2202 hash_len = (int)strlen(hash_buf);
2203 }
2204
2205 // Get the internal name as a c string
2206 const char* src = (const char*) (name()->as_C_string());
2207 const int src_length = (int)strlen(src);
2208
2209 char* dest = NEW_RESOURCE_ARRAY(char, src_length + hash_len + 3);
2210
2211 // Add L as type indicator
2212 int dest_index = 0;
2213 dest[dest_index++] = 'L';
2214
2215 // Add the actual class name
2216 for (int src_index = 0; src_index < src_length; ) {
2217 dest[dest_index++] = src[src_index++];
2218 }
2219
2220 // If we have a hash, append it
2221 for (int hash_index = 0; hash_index < hash_len; ) {
2222 dest[dest_index++] = hash_buf[hash_index++];
2223 }
2224
2225 // Add the semicolon and the NULL
2226 dest[dest_index++] = ';';
2227 dest[dest_index] = '\0';
2228 return dest;
2229 }
2230
2231 // Used to obtain the package name from a fully qualified class name.
2232 Symbol* InstanceKlass::package_from_name(const Symbol* name, TRAPS) {
2233 if (name == NULL) {
2234 return NULL;
2235 } else {
2236 if (name->utf8_length() <= 0) {
2237 return NULL;
2238 }
2239 ResourceMark rm;
2240 const char* package_name = ClassLoader::package_from_name((const char*) name->as_C_string());
2241 if (package_name == NULL) {
2242 return NULL;
2243 }
2244 Symbol* pkg_name = SymbolTable::new_symbol(package_name, THREAD);
2245 return pkg_name;
2246 }
2247 }
2248
2249 ModuleEntry* InstanceKlass::module() const {
2250 if (!in_unnamed_package()) {
2251 return _package_entry->module();
2252 }
2253 const Klass* host = host_klass();
2254 if (host == NULL) {
2255 return class_loader_data()->unnamed_module();
2256 }
2257 return host->class_loader_data()->unnamed_module();
2258 }
2259
2260 void InstanceKlass::set_package(ClassLoaderData* loader_data, TRAPS) {
2261
2262 // ensure java/ packages only loaded by boot or platform builtin loaders
2263 Handle class_loader(THREAD, loader_data->class_loader());
2264 check_prohibited_package(name(), class_loader, CHECK);
2265
2266 TempNewSymbol pkg_name = package_from_name(name(), CHECK);
2267
2268 if (pkg_name != NULL && loader_data != NULL) {
2269
2270 // Find in class loader's package entry table.
2271 _package_entry = loader_data->packages()->lookup_only(pkg_name);
2272
2273 // If the package name is not found in the loader's package
2274 // entry table, it is an indication that the package has not
2275 // been defined. Consider it defined within the unnamed module.
2276 if (_package_entry == NULL) {
2277 ResourceMark rm;
2278
2279 if (!ModuleEntryTable::javabase_defined()) {
2280 // Before java.base is defined during bootstrapping, define all packages in
2281 // the java.base module. If a non-java.base package is erroneously placed
2282 // in the java.base module it will be caught later when java.base
2283 // is defined by ModuleEntryTable::verify_javabase_packages check.
2284 assert(ModuleEntryTable::javabase_moduleEntry() != NULL, JAVA_BASE_NAME " module is NULL");
2285 _package_entry = loader_data->packages()->lookup(pkg_name, ModuleEntryTable::javabase_moduleEntry());
2286 } else {
2287 assert(loader_data->unnamed_module() != NULL, "unnamed module is NULL");
2288 _package_entry = loader_data->packages()->lookup(pkg_name,
2289 loader_data->unnamed_module());
2290 }
2291
2292 // A package should have been successfully created
2293 assert(_package_entry != NULL, "Package entry for class %s not found, loader %s",
2294 name()->as_C_string(), loader_data->loader_name());
2295 }
2296
2297 if (log_is_enabled(Debug, module)) {
2298 ResourceMark rm;
2299 ModuleEntry* m = _package_entry->module();
2300 log_trace(module)("Setting package: class: %s, package: %s, loader: %s, module: %s",
2301 external_name(),
2302 pkg_name->as_C_string(),
2303 loader_data->loader_name(),
2304 (m->is_named() ? m->name()->as_C_string() : UNNAMED_MODULE));
2305 }
2306 } else {
2307 ResourceMark rm;
2308 log_trace(module)("Setting package: class: %s, package: unnamed, loader: %s, module: %s",
2309 external_name(),
2310 (loader_data != NULL) ? loader_data->loader_name() : "NULL",
2311 UNNAMED_MODULE);
2312 }
2313 }
2314
2315
2316 // different versions of is_same_class_package
2317
2318 bool InstanceKlass::is_same_class_package(const Klass* class2) const {
2319 oop classloader1 = this->class_loader();
2320 PackageEntry* classpkg1 = this->package();
2321 if (class2->is_objArray_klass()) {
2322 class2 = ObjArrayKlass::cast(class2)->bottom_klass();
2323 }
2324
2325 oop classloader2;
2326 PackageEntry* classpkg2;
2327 if (class2->is_instance_klass()) {
2328 classloader2 = class2->class_loader();
2329 classpkg2 = class2->package();
2330 } else {
2331 assert(class2->is_typeArray_klass(), "should be type array");
2332 classloader2 = NULL;
2333 classpkg2 = NULL;
2334 }
2335
2336 // Same package is determined by comparing class loader
2337 // and package entries. Both must be the same. This rule
2338 // applies even to classes that are defined in the unnamed
2339 // package, they still must have the same class loader.
2340 if ((classloader1 == classloader2) && (classpkg1 == classpkg2)) {
2341 return true;
2342 }
2343
2344 return false;
2345 }
2346
2347 // return true if this class and other_class are in the same package. Classloader
2348 // and classname information is enough to determine a class's package
2349 bool InstanceKlass::is_same_class_package(oop other_class_loader,
2350 const Symbol* other_class_name) const {
2351 if (class_loader() != other_class_loader) {
2352 return false;
2353 }
2354 if (name()->fast_compare(other_class_name) == 0) {
2355 return true;
2356 }
2357
2358 {
2359 ResourceMark rm;
2360
2361 bool bad_class_name = false;
2362 const char* other_pkg =
2363 ClassLoader::package_from_name((const char*) other_class_name->as_C_string(), &bad_class_name);
2364 if (bad_class_name) {
2365 return false;
2366 }
2367 // Check that package_from_name() returns NULL, not "", if there is no package.
2368 assert(other_pkg == NULL || strlen(other_pkg) > 0, "package name is empty string");
2369
2370 const Symbol* const this_package_name =
2371 this->package() != NULL ? this->package()->name() : NULL;
2372
2373 if (this_package_name == NULL || other_pkg == NULL) {
2374 // One of the two doesn't have a package. Only return true if the other
2375 // one also doesn't have a package.
2376 return (const char*)this_package_name == other_pkg;
2377 }
2378
2379 // Check if package is identical
2380 return this_package_name->equals(other_pkg);
2381 }
2382 }
2383
2384 // Returns true iff super_method can be overridden by a method in targetclassname
2385 // See JLS 3rd edition 8.4.6.1
2386 // Assumes name-signature match
2387 // "this" is InstanceKlass of super_method which must exist
2388 // note that the InstanceKlass of the method in the targetclassname has not always been created yet
2389 bool InstanceKlass::is_override(const methodHandle& super_method, Handle targetclassloader, Symbol* targetclassname, TRAPS) {
2390 // Private methods can not be overridden
2391 if (super_method->is_private()) {
2392 return false;
2393 }
2394 // If super method is accessible, then override
2395 if ((super_method->is_protected()) ||
2396 (super_method->is_public())) {
2397 return true;
2398 }
2399 // Package-private methods are not inherited outside of package
2400 assert(super_method->is_package_private(), "must be package private");
2401 return(is_same_class_package(targetclassloader(), targetclassname));
2402 }
2403
2404 // Only boot and platform class loaders can define classes in "java/" packages.
2405 void InstanceKlass::check_prohibited_package(Symbol* class_name,
2406 Handle class_loader,
2407 TRAPS) {
2408 if (!class_loader.is_null() &&
2409 !SystemDictionary::is_platform_class_loader(class_loader()) &&
2410 class_name != NULL) {
2411 ResourceMark rm(THREAD);
2412 char* name = class_name->as_C_string();
2413 if (strncmp(name, JAVAPKG, JAVAPKG_LEN) == 0 && name[JAVAPKG_LEN] == '/') {
2414 TempNewSymbol pkg_name = InstanceKlass::package_from_name(class_name, CHECK);
2415 assert(pkg_name != NULL, "Error in parsing package name starting with 'java/'");
2416 name = pkg_name->as_C_string();
2417 const char* class_loader_name = SystemDictionary::loader_name(class_loader());
2418 StringUtils::replace_no_expand(name, "/", ".");
2419 const char* msg_text1 = "Class loader (instance of): ";
2420 const char* msg_text2 = " tried to load prohibited package name: ";
2421 size_t len = strlen(msg_text1) + strlen(class_loader_name) + strlen(msg_text2) + strlen(name) + 1;
2422 char* message = NEW_RESOURCE_ARRAY_IN_THREAD(THREAD, char, len);
2423 jio_snprintf(message, len, "%s%s%s%s", msg_text1, class_loader_name, msg_text2, name);
2424 THROW_MSG(vmSymbols::java_lang_SecurityException(), message);
2425 }
2426 }
2427 return;
2428 }
2429
2430 // tell if two classes have the same enclosing class (at package level)
2431 bool InstanceKlass::is_same_package_member(const Klass* class2, TRAPS) const {
2432 if (class2 == this) return true;
2433 if (!class2->is_instance_klass()) return false;
2434
2435 // must be in same package before we try anything else
2436 if (!is_same_class_package(class2))
2437 return false;
2438
2439 // As long as there is an outer_this.getEnclosingClass,
2440 // shift the search outward.
2441 const InstanceKlass* outer_this = this;
2442 for (;;) {
2443 // As we walk along, look for equalities between outer_this and class2.
2444 // Eventually, the walks will terminate as outer_this stops
2445 // at the top-level class around the original class.
2446 bool ignore_inner_is_member;
2447 const Klass* next = outer_this->compute_enclosing_class(&ignore_inner_is_member,
2448 CHECK_false);
2449 if (next == NULL) break;
2450 if (next == class2) return true;
2451 outer_this = InstanceKlass::cast(next);
2452 }
2453
2454 // Now do the same for class2.
2455 const InstanceKlass* outer2 = InstanceKlass::cast(class2);
2456 for (;;) {
2457 bool ignore_inner_is_member;
2458 Klass* next = outer2->compute_enclosing_class(&ignore_inner_is_member,
2459 CHECK_false);
2460 if (next == NULL) break;
2461 // Might as well check the new outer against all available values.
2462 if (next == this) return true;
2463 if (next == outer_this) return true;
2464 outer2 = InstanceKlass::cast(next);
2465 }
2466
2467 // If by this point we have not found an equality between the
2468 // two classes, we know they are in separate package members.
2469 return false;
2470 }
2471
2472 bool InstanceKlass::find_inner_classes_attr(int* ooff, int* noff, TRAPS) const {
2473 constantPoolHandle i_cp(THREAD, constants());
2474 for (InnerClassesIterator iter(this); !iter.done(); iter.next()) {
2475 int ioff = iter.inner_class_info_index();
2476 if (ioff != 0) {
2477 // Check to see if the name matches the class we're looking for
2478 // before attempting to find the class.
2479 if (i_cp->klass_name_at_matches(this, ioff)) {
2480 Klass* inner_klass = i_cp->klass_at(ioff, CHECK_false);
2481 if (this == inner_klass) {
2482 *ooff = iter.outer_class_info_index();
2483 *noff = iter.inner_name_index();
2484 return true;
2485 }
2486 }
2487 }
2488 }
2489 return false;
2490 }
2491
2492 InstanceKlass* InstanceKlass::compute_enclosing_class(bool* inner_is_member, TRAPS) const {
2493 InstanceKlass* outer_klass = NULL;
2494 *inner_is_member = false;
2495 int ooff = 0, noff = 0;
2496 bool has_inner_classes_attr = find_inner_classes_attr(&ooff, &noff, THREAD);
2497 if (has_inner_classes_attr) {
2498 constantPoolHandle i_cp(THREAD, constants());
2499 if (ooff != 0) {
2500 Klass* ok = i_cp->klass_at(ooff, CHECK_NULL);
2501 outer_klass = InstanceKlass::cast(ok);
2502 *inner_is_member = true;
2503 }
2504 if (NULL == outer_klass) {
2505 // It may be anonymous; try for that.
2506 int encl_method_class_idx = enclosing_method_class_index();
2507 if (encl_method_class_idx != 0) {
2508 Klass* ok = i_cp->klass_at(encl_method_class_idx, CHECK_NULL);
2509 outer_klass = InstanceKlass::cast(ok);
2510 *inner_is_member = false;
2511 }
2512 }
2513 }
2514
2515 // If no inner class attribute found for this class.
2516 if (NULL == outer_klass) return NULL;
2517
2518 // Throws an exception if outer klass has not declared k as an inner klass
2519 // We need evidence that each klass knows about the other, or else
2520 // the system could allow a spoof of an inner class to gain access rights.
2521 Reflection::check_for_inner_class(outer_klass, this, *inner_is_member, CHECK_NULL);
2522 return outer_klass;
2523 }
2524
2525 jint InstanceKlass::compute_modifier_flags(TRAPS) const {
2526 jint access = access_flags().as_int();
2527
2528 // But check if it happens to be member class.
2529 InnerClassesIterator iter(this);
2530 for (; !iter.done(); iter.next()) {
2531 int ioff = iter.inner_class_info_index();
2532 // Inner class attribute can be zero, skip it.
2533 // Strange but true: JVM spec. allows null inner class refs.
2534 if (ioff == 0) continue;
2535
2536 // only look at classes that are already loaded
2537 // since we are looking for the flags for our self.
2538 Symbol* inner_name = constants()->klass_name_at(ioff);
2539 if (name() == inner_name) {
2540 // This is really a member class.
2541 access = iter.inner_access_flags();
2542 break;
2543 }
2544 }
2545 // Remember to strip ACC_SUPER bit
2546 return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS;
2547 }
2548
2549 jint InstanceKlass::jvmti_class_status() const {
2550 jint result = 0;
2551
2552 if (is_linked()) {
2553 result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED;
2554 }
2555
2556 if (is_initialized()) {
2557 assert(is_linked(), "Class status is not consistent");
2558 result |= JVMTI_CLASS_STATUS_INITIALIZED;
2559 }
2560 if (is_in_error_state()) {
2561 result |= JVMTI_CLASS_STATUS_ERROR;
2562 }
2563 return result;
2564 }
2565
2566 Method* InstanceKlass::method_at_itable(Klass* holder, int index, TRAPS) {
2567 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable();
2568 int method_table_offset_in_words = ioe->offset()/wordSize;
2569 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words())
2570 / itableOffsetEntry::size();
2571
2572 for (int cnt = 0 ; ; cnt ++, ioe ++) {
2573 // If the interface isn't implemented by the receiver class,
2574 // the VM should throw IncompatibleClassChangeError.
2575 if (cnt >= nof_interfaces) {
2576 THROW_NULL(vmSymbols::java_lang_IncompatibleClassChangeError());
2577 }
2578
2579 Klass* ik = ioe->interface_klass();
2580 if (ik == holder) break;
2581 }
2582
2583 itableMethodEntry* ime = ioe->first_method_entry(this);
2584 Method* m = ime[index].method();
2585 if (m == NULL) {
2586 THROW_NULL(vmSymbols::java_lang_AbstractMethodError());
2587 }
2588 return m;
2589 }
2590
2591
2592 #if INCLUDE_JVMTI
2593 // update default_methods for redefineclasses for methods that are
2594 // not yet in the vtable due to concurrent subclass define and superinterface
2595 // redefinition
2596 // Note: those in the vtable, should have been updated via adjust_method_entries
2597 void InstanceKlass::adjust_default_methods(InstanceKlass* holder, bool* trace_name_printed) {
2598 // search the default_methods for uses of either obsolete or EMCP methods
2599 if (default_methods() != NULL) {
2600 for (int index = 0; index < default_methods()->length(); index ++) {
2601 Method* old_method = default_methods()->at(index);
2602 if (old_method == NULL || old_method->method_holder() != holder || !old_method->is_old()) {
2603 continue; // skip uninteresting entries
2604 }
2605 assert(!old_method->is_deleted(), "default methods may not be deleted");
2606
2607 Method* new_method = holder->method_with_idnum(old_method->orig_method_idnum());
2608
2609 assert(new_method != NULL, "method_with_idnum() should not be NULL");
2610 assert(old_method != new_method, "sanity check");
2611
2612 default_methods()->at_put(index, new_method);
2613 if (log_is_enabled(Info, redefine, class, update)) {
2614 ResourceMark rm;
2615 if (!(*trace_name_printed)) {
2616 log_info(redefine, class, update)
2617 ("adjust: klassname=%s default methods from name=%s",
2618 external_name(), old_method->method_holder()->external_name());
2619 *trace_name_printed = true;
2620 }
2621 log_debug(redefine, class, update, vtables)
2622 ("default method update: %s(%s) ",
2623 new_method->name()->as_C_string(), new_method->signature()->as_C_string());
2624 }
2625 }
2626 }
2627 }
2628 #endif // INCLUDE_JVMTI
2629
2630 // On-stack replacement stuff
2631 void InstanceKlass::add_osr_nmethod(nmethod* n) {
2632 // only one compilation can be active
2633 {
2634 // This is a short non-blocking critical region, so the no safepoint check is ok.
2635 MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
2636 assert(n->is_osr_method(), "wrong kind of nmethod");
2637 n->set_osr_link(osr_nmethods_head());
2638 set_osr_nmethods_head(n);
2639 // Raise the highest osr level if necessary
2640 if (TieredCompilation) {
2641 Method* m = n->method();
2642 m->set_highest_osr_comp_level(MAX2(m->highest_osr_comp_level(), n->comp_level()));
2643 }
2644 }
2645
2646 // Get rid of the osr methods for the same bci that have lower levels.
2647 if (TieredCompilation) {
2648 for (int l = CompLevel_limited_profile; l < n->comp_level(); l++) {
2649 nmethod *inv = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), l, true);
2650 if (inv != NULL && inv->is_in_use()) {
2651 inv->make_not_entrant();
2652 }
2653 }
2654 }
2655 }
2656
2657 // Remove osr nmethod from the list. Return true if found and removed.
2658 bool InstanceKlass::remove_osr_nmethod(nmethod* n) {
2659 // This is a short non-blocking critical region, so the no safepoint check is ok.
2660 MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
2661 assert(n->is_osr_method(), "wrong kind of nmethod");
2662 nmethod* last = NULL;
2663 nmethod* cur = osr_nmethods_head();
2664 int max_level = CompLevel_none; // Find the max comp level excluding n
2665 Method* m = n->method();
2666 // Search for match
2667 bool found = false;
2668 while(cur != NULL && cur != n) {
2669 if (TieredCompilation && m == cur->method()) {
2670 // Find max level before n
2671 max_level = MAX2(max_level, cur->comp_level());
2672 }
2673 last = cur;
2674 cur = cur->osr_link();
2675 }
2676 nmethod* next = NULL;
2677 if (cur == n) {
2678 found = true;
2679 next = cur->osr_link();
2680 if (last == NULL) {
2681 // Remove first element
2682 set_osr_nmethods_head(next);
2683 } else {
2684 last->set_osr_link(next);
2685 }
2686 }
2687 n->set_osr_link(NULL);
2688 if (TieredCompilation) {
2689 cur = next;
2690 while (cur != NULL) {
2691 // Find max level after n
2692 if (m == cur->method()) {
2693 max_level = MAX2(max_level, cur->comp_level());
2694 }
2695 cur = cur->osr_link();
2696 }
2697 m->set_highest_osr_comp_level(max_level);
2698 }
2699 return found;
2700 }
2701
2702 int InstanceKlass::mark_osr_nmethods(const Method* m) {
2703 // This is a short non-blocking critical region, so the no safepoint check is ok.
2704 MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
2705 nmethod* osr = osr_nmethods_head();
2706 int found = 0;
2707 while (osr != NULL) {
2708 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
2709 if (osr->method() == m) {
2710 osr->mark_for_deoptimization();
2711 found++;
2712 }
2713 osr = osr->osr_link();
2714 }
2715 return found;
2716 }
2717
2718 nmethod* InstanceKlass::lookup_osr_nmethod(const Method* m, int bci, int comp_level, bool match_level) const {
2719 // This is a short non-blocking critical region, so the no safepoint check is ok.
2720 MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
2721 nmethod* osr = osr_nmethods_head();
2722 nmethod* best = NULL;
2723 while (osr != NULL) {
2724 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
2725 // There can be a time when a c1 osr method exists but we are waiting
2726 // for a c2 version. When c2 completes its osr nmethod we will trash
2727 // the c1 version and only be able to find the c2 version. However
2728 // while we overflow in the c1 code at back branches we don't want to
2729 // try and switch to the same code as we are already running
2730
2731 if (osr->method() == m &&
2732 (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) {
2733 if (match_level) {
2734 if (osr->comp_level() == comp_level) {
2735 // Found a match - return it.
2736 return osr;
2737 }
2738 } else {
2739 if (best == NULL || (osr->comp_level() > best->comp_level())) {
2740 if (osr->comp_level() == CompLevel_highest_tier) {
2741 // Found the best possible - return it.
2742 return osr;
2743 }
2744 best = osr;
2745 }
2746 }
2747 }
2748 osr = osr->osr_link();
2749 }
2750 if (best != NULL && best->comp_level() >= comp_level && match_level == false) {
2751 return best;
2752 }
2753 return NULL;
2754 }
2755
2756 // -----------------------------------------------------------------------------------------------------
2757 // Printing
2758
2759 #ifndef PRODUCT
2760
2761 #define BULLET " - "
2762
2763 static const char* state_names[] = {
2764 "allocated", "loaded", "linked", "being_initialized", "fully_initialized", "initialization_error"
2765 };
2766
2767 static void print_vtable(intptr_t* start, int len, outputStream* st) {
2768 for (int i = 0; i < len; i++) {
2769 intptr_t e = start[i];
2770 st->print("%d : " INTPTR_FORMAT, i, e);
2771 if (e != 0 && ((Metadata*)e)->is_metaspace_object()) {
2772 st->print(" ");
2773 ((Metadata*)e)->print_value_on(st);
2774 }
2775 st->cr();
2776 }
2777 }
2778
2779 static void print_vtable(vtableEntry* start, int len, outputStream* st) {
2780 return print_vtable(reinterpret_cast<intptr_t*>(start), len, st);
2781 }
2782
2783 void InstanceKlass::print_on(outputStream* st) const {
2784 assert(is_klass(), "must be klass");
2785 Klass::print_on(st);
2786
2787 st->print(BULLET"instance size: %d", size_helper()); st->cr();
2788 st->print(BULLET"klass size: %d", size()); st->cr();
2789 st->print(BULLET"access: "); access_flags().print_on(st); st->cr();
2790 st->print(BULLET"state: "); st->print_cr("%s", state_names[_init_state]);
2791 st->print(BULLET"name: "); name()->print_value_on(st); st->cr();
2792 st->print(BULLET"super: "); super()->print_value_on_maybe_null(st); st->cr();
2793 st->print(BULLET"sub: ");
2794 Klass* sub = subklass();
2795 int n;
2796 for (n = 0; sub != NULL; n++, sub = sub->next_sibling()) {
2797 if (n < MaxSubklassPrintSize) {
2798 sub->print_value_on(st);
2799 st->print(" ");
2800 }
2801 }
2802 if (n >= MaxSubklassPrintSize) st->print("(" INTX_FORMAT " more klasses...)", n - MaxSubklassPrintSize);
2803 st->cr();
2804
2805 if (is_interface()) {
2806 st->print_cr(BULLET"nof implementors: %d", nof_implementors());
2807 if (nof_implementors() == 1) {
2808 st->print_cr(BULLET"implementor: ");
2809 st->print(" ");
2810 implementor()->print_value_on(st);
2811 st->cr();
2812 }
2813 }
2814
2815 st->print(BULLET"arrays: "); array_klasses()->print_value_on_maybe_null(st); st->cr();
2816 st->print(BULLET"methods: "); methods()->print_value_on(st); st->cr();
2817 if (Verbose || WizardMode) {
2818 Array<Method*>* method_array = methods();
2819 for (int i = 0; i < method_array->length(); i++) {
2820 st->print("%d : ", i); method_array->at(i)->print_value(); st->cr();
2821 }
2822 }
2823 st->print(BULLET"method ordering: "); method_ordering()->print_value_on(st); st->cr();
2824 st->print(BULLET"default_methods: "); default_methods()->print_value_on(st); st->cr();
2825 if (Verbose && default_methods() != NULL) {
2826 Array<Method*>* method_array = default_methods();
2827 for (int i = 0; i < method_array->length(); i++) {
2828 st->print("%d : ", i); method_array->at(i)->print_value(); st->cr();
2829 }
2830 }
2831 if (default_vtable_indices() != NULL) {
2832 st->print(BULLET"default vtable indices: "); default_vtable_indices()->print_value_on(st); st->cr();
2833 }
2834 st->print(BULLET"local interfaces: "); local_interfaces()->print_value_on(st); st->cr();
2835 st->print(BULLET"trans. interfaces: "); transitive_interfaces()->print_value_on(st); st->cr();
2836 st->print(BULLET"constants: "); constants()->print_value_on(st); st->cr();
2837 if (class_loader_data() != NULL) {
2838 st->print(BULLET"class loader data: ");
2839 class_loader_data()->print_value_on(st);
2840 st->cr();
2841 }
2842 st->print(BULLET"host class: "); host_klass()->print_value_on_maybe_null(st); st->cr();
2843 if (source_file_name() != NULL) {
2844 st->print(BULLET"source file: ");
2845 source_file_name()->print_value_on(st);
2846 st->cr();
2847 }
2848 if (source_debug_extension() != NULL) {
2849 st->print(BULLET"source debug extension: ");
2850 st->print("%s", source_debug_extension());
2851 st->cr();
2852 }
2853 st->print(BULLET"class annotations: "); class_annotations()->print_value_on(st); st->cr();
2854 st->print(BULLET"class type annotations: "); class_type_annotations()->print_value_on(st); st->cr();
2855 st->print(BULLET"field annotations: "); fields_annotations()->print_value_on(st); st->cr();
2856 st->print(BULLET"field type annotations: "); fields_type_annotations()->print_value_on(st); st->cr();
2857 {
2858 bool have_pv = false;
2859 // previous versions are linked together through the InstanceKlass
2860 for (InstanceKlass* pv_node = previous_versions();
2861 pv_node != NULL;
2862 pv_node = pv_node->previous_versions()) {
2863 if (!have_pv)
2864 st->print(BULLET"previous version: ");
2865 have_pv = true;
2866 pv_node->constants()->print_value_on(st);
2867 }
2868 if (have_pv) st->cr();
2869 }
2870
2871 if (generic_signature() != NULL) {
2872 st->print(BULLET"generic signature: ");
2873 generic_signature()->print_value_on(st);
2874 st->cr();
2875 }
2876 st->print(BULLET"inner classes: "); inner_classes()->print_value_on(st); st->cr();
2877 st->print(BULLET"java mirror: "); java_mirror()->print_value_on(st); st->cr();
2878 st->print(BULLET"vtable length %d (start addr: " INTPTR_FORMAT ")", vtable_length(), p2i(start_of_vtable())); st->cr();
2879 if (vtable_length() > 0 && (Verbose || WizardMode)) print_vtable(start_of_vtable(), vtable_length(), st);
2880 st->print(BULLET"itable length %d (start addr: " INTPTR_FORMAT ")", itable_length(), p2i(start_of_itable())); st->cr();
2881 if (itable_length() > 0 && (Verbose || WizardMode)) print_vtable(start_of_itable(), itable_length(), st);
2882 st->print_cr(BULLET"---- static fields (%d words):", static_field_size());
2883 FieldPrinter print_static_field(st);
2884 ((InstanceKlass*)this)->do_local_static_fields(&print_static_field);
2885 st->print_cr(BULLET"---- non-static fields (%d words):", nonstatic_field_size());
2886 FieldPrinter print_nonstatic_field(st);
2887 InstanceKlass* ik = const_cast<InstanceKlass*>(this);
2888 ik->do_nonstatic_fields(&print_nonstatic_field);
2889
2890 st->print(BULLET"non-static oop maps: ");
2891 OopMapBlock* map = start_of_nonstatic_oop_maps();
2892 OopMapBlock* end_map = map + nonstatic_oop_map_count();
2893 while (map < end_map) {
2894 st->print("%d-%d ", map->offset(), map->offset() + heapOopSize*(map->count() - 1));
2895 map++;
2896 }
2897 st->cr();
2898 }
2899
2900 #endif //PRODUCT
2901
2902 void InstanceKlass::print_value_on(outputStream* st) const {
2903 assert(is_klass(), "must be klass");
2904 if (Verbose || WizardMode) access_flags().print_on(st);
2905 name()->print_value_on(st);
2906 }
2907
2908 #ifndef PRODUCT
2909
2910 void FieldPrinter::do_field(fieldDescriptor* fd) {
2911 _st->print(BULLET);
2912 if (_obj == NULL) {
2913 fd->print_on(_st);
2914 _st->cr();
2915 } else {
2916 fd->print_on_for(_st, _obj);
2917 _st->cr();
2918 }
2919 }
2920
2921
2922 void InstanceKlass::oop_print_on(oop obj, outputStream* st) {
2923 Klass::oop_print_on(obj, st);
2924
2925 if (this == SystemDictionary::String_klass()) {
2926 typeArrayOop value = java_lang_String::value(obj);
2927 juint length = java_lang_String::length(obj);
2928 if (value != NULL &&
2929 value->is_typeArray() &&
2930 length <= (juint) value->length()) {
2931 st->print(BULLET"string: ");
2932 java_lang_String::print(obj, st);
2933 st->cr();
2934 if (!WizardMode) return; // that is enough
2935 }
2936 }
2937
2938 st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj));
2939 FieldPrinter print_field(st, obj);
2940 do_nonstatic_fields(&print_field);
2941
2942 if (this == SystemDictionary::Class_klass()) {
2943 st->print(BULLET"signature: ");
2944 java_lang_Class::print_signature(obj, st);
2945 st->cr();
2946 Klass* mirrored_klass = java_lang_Class::as_Klass(obj);
2947 st->print(BULLET"fake entry for mirror: ");
2948 mirrored_klass->print_value_on_maybe_null(st);
2949 st->cr();
2950 Klass* array_klass = java_lang_Class::array_klass(obj);
2951 st->print(BULLET"fake entry for array: ");
2952 array_klass->print_value_on_maybe_null(st);
2953 st->cr();
2954 st->print_cr(BULLET"fake entry for oop_size: %d", java_lang_Class::oop_size(obj));
2955 st->print_cr(BULLET"fake entry for static_oop_field_count: %d", java_lang_Class::static_oop_field_count(obj));
2956 Klass* real_klass = java_lang_Class::as_Klass(obj);
2957 if (real_klass != NULL && real_klass->is_instance_klass()) {
2958 InstanceKlass::cast(real_klass)->do_local_static_fields(&print_field);
2959 }
2960 } else if (this == SystemDictionary::MethodType_klass()) {
2961 st->print(BULLET"signature: ");
2962 java_lang_invoke_MethodType::print_signature(obj, st);
2963 st->cr();
2964 }
2965 }
2966
2967 #endif //PRODUCT
2968
2969 void InstanceKlass::oop_print_value_on(oop obj, outputStream* st) {
2970 st->print("a ");
2971 name()->print_value_on(st);
2972 obj->print_address_on(st);
2973 if (this == SystemDictionary::String_klass()
2974 && java_lang_String::value(obj) != NULL) {
2975 ResourceMark rm;
2976 int len = java_lang_String::length(obj);
2977 int plen = (len < 24 ? len : 12);
2978 char* str = java_lang_String::as_utf8_string(obj, 0, plen);
2979 st->print(" = \"%s\"", str);
2980 if (len > plen)
2981 st->print("...[%d]", len);
2982 } else if (this == SystemDictionary::Class_klass()) {
2983 Klass* k = java_lang_Class::as_Klass(obj);
2984 st->print(" = ");
2985 if (k != NULL) {
2986 k->print_value_on(st);
2987 } else {
2988 const char* tname = type2name(java_lang_Class::primitive_type(obj));
2989 st->print("%s", tname ? tname : "type?");
2990 }
2991 } else if (this == SystemDictionary::MethodType_klass()) {
2992 st->print(" = ");
2993 java_lang_invoke_MethodType::print_signature(obj, st);
2994 } else if (java_lang_boxing_object::is_instance(obj)) {
2995 st->print(" = ");
2996 java_lang_boxing_object::print(obj, st);
2997 } else if (this == SystemDictionary::LambdaForm_klass()) {
2998 oop vmentry = java_lang_invoke_LambdaForm::vmentry(obj);
2999 if (vmentry != NULL) {
3000 st->print(" => ");
3001 vmentry->print_value_on(st);
3002 }
3003 } else if (this == SystemDictionary::MemberName_klass()) {
3004 Metadata* vmtarget = java_lang_invoke_MemberName::vmtarget(obj);
3005 if (vmtarget != NULL) {
3006 st->print(" = ");
3007 vmtarget->print_value_on(st);
3008 } else {
3009 java_lang_invoke_MemberName::clazz(obj)->print_value_on(st);
3010 st->print(".");
3011 java_lang_invoke_MemberName::name(obj)->print_value_on(st);
3012 }
3013 }
3014 }
3015
3016 const char* InstanceKlass::internal_name() const {
3017 return external_name();
3018 }
3019
3020 void InstanceKlass::print_class_load_logging(ClassLoaderData* loader_data,
3021 const char* module_name,
3022 const ClassFileStream* cfs) const {
3023 if (!log_is_enabled(Info, class, load)) {
3024 return;
3025 }
3026
3027 ResourceMark rm;
3028 LogMessage(class, load) msg;
3029 stringStream info_stream;
3030
3031 // Name and class hierarchy info
3032 info_stream.print("%s", external_name());
3033
3034 // Source
3035 if (cfs != NULL) {
3036 if (cfs->source() != NULL) {
3037 if (module_name != NULL) {
3038 if (ClassLoader::is_jrt(cfs->source())) {
3039 info_stream.print(" source: jrt:/%s", module_name);
3040 } else {
3041 info_stream.print(" source: %s", cfs->source());
3042 }
3043 } else {
3044 info_stream.print(" source: %s", cfs->source());
3045 }
3046 } else if (loader_data == ClassLoaderData::the_null_class_loader_data()) {
3047 Thread* THREAD = Thread::current();
3048 Klass* caller =
3049 THREAD->is_Java_thread()
3050 ? ((JavaThread*)THREAD)->security_get_caller_class(1)
3051 : NULL;
3052 // caller can be NULL, for example, during a JVMTI VM_Init hook
3053 if (caller != NULL) {
3054 info_stream.print(" source: instance of %s", caller->external_name());
3055 } else {
3056 // source is unknown
3057 }
3058 } else {
3059 oop class_loader = loader_data->class_loader();
3060 info_stream.print(" source: %s", class_loader->klass()->external_name());
3061 }
3062 } else {
3063 info_stream.print(" source: shared objects file");
3064 }
3065
3066 msg.info("%s", info_stream.as_string());
3067
3068 if (log_is_enabled(Debug, class, load)) {
3069 stringStream debug_stream;
3070
3071 // Class hierarchy info
3072 debug_stream.print(" klass: " INTPTR_FORMAT " super: " INTPTR_FORMAT,
3073 p2i(this), p2i(superklass()));
3074
3075 // Interfaces
3076 if (local_interfaces() != NULL && local_interfaces()->length() > 0) {
3077 debug_stream.print(" interfaces:");
3078 int length = local_interfaces()->length();
3079 for (int i = 0; i < length; i++) {
3080 debug_stream.print(" " INTPTR_FORMAT,
3081 p2i(InstanceKlass::cast(local_interfaces()->at(i))));
3082 }
3083 }
3084
3085 // Class loader
3086 debug_stream.print(" loader: [");
3087 loader_data->print_value_on(&debug_stream);
3088 debug_stream.print("]");
3089
3090 // Classfile checksum
3091 if (cfs) {
3092 debug_stream.print(" bytes: %d checksum: %08x",
3093 cfs->length(),
3094 ClassLoader::crc32(0, (const char*)cfs->buffer(),
3095 cfs->length()));
3096 }
3097
3098 msg.debug("%s", debug_stream.as_string());
3099 }
3100 }
3101
3102 #if INCLUDE_SERVICES
3103 // Size Statistics
3104 void InstanceKlass::collect_statistics(KlassSizeStats *sz) const {
3105 Klass::collect_statistics(sz);
3106
3107 sz->_inst_size = wordSize * size_helper();
3108 sz->_vtab_bytes = wordSize * vtable_length();
3109 sz->_itab_bytes = wordSize * itable_length();
3110 sz->_nonstatic_oopmap_bytes = wordSize * nonstatic_oop_map_size();
3111
3112 int n = 0;
3113 n += (sz->_methods_array_bytes = sz->count_array(methods()));
3114 n += (sz->_method_ordering_bytes = sz->count_array(method_ordering()));
3115 n += (sz->_local_interfaces_bytes = sz->count_array(local_interfaces()));
3116 n += (sz->_transitive_interfaces_bytes = sz->count_array(transitive_interfaces()));
3117 n += (sz->_fields_bytes = sz->count_array(fields()));
3118 n += (sz->_inner_classes_bytes = sz->count_array(inner_classes()));
3119 sz->_ro_bytes += n;
3120
3121 const ConstantPool* cp = constants();
3122 if (cp) {
3123 cp->collect_statistics(sz);
3124 }
3125
3126 const Annotations* anno = annotations();
3127 if (anno) {
3128 anno->collect_statistics(sz);
3129 }
3130
3131 const Array<Method*>* methods_array = methods();
3132 if (methods()) {
3133 for (int i = 0; i < methods_array->length(); i++) {
3134 Method* method = methods_array->at(i);
3135 if (method) {
3136 sz->_method_count ++;
3137 method->collect_statistics(sz);
3138 }
3139 }
3140 }
3141 }
3142 #endif // INCLUDE_SERVICES
3143
3144 // Verification
3145
3146 class VerifyFieldClosure: public OopClosure {
3147 protected:
3148 template <class T> void do_oop_work(T* p) {
3149 oop obj = oopDesc::load_decode_heap_oop(p);
3150 if (!obj->is_oop_or_null()) {
3151 tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p2i(p), p2i(obj));
3152 Universe::print_on(tty);
3153 guarantee(false, "boom");
3154 }
3155 }
3156 public:
3157 virtual void do_oop(oop* p) { VerifyFieldClosure::do_oop_work(p); }
3158 virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); }
3159 };
3160
3161 void InstanceKlass::verify_on(outputStream* st) {
3162 #ifndef PRODUCT
3163 // Avoid redundant verifies, this really should be in product.
3164 if (_verify_count == Universe::verify_count()) return;
3165 _verify_count = Universe::verify_count();
3166 #endif
3167
3168 // Verify Klass
3169 Klass::verify_on(st);
3170
3171 // Verify that klass is present in ClassLoaderData
3172 guarantee(class_loader_data()->contains_klass(this),
3173 "this class isn't found in class loader data");
3174
3175 // Verify vtables
3176 if (is_linked()) {
3177 // $$$ This used to be done only for m/s collections. Doing it
3178 // always seemed a valid generalization. (DLD -- 6/00)
3179 vtable().verify(st);
3180 }
3181
3182 // Verify first subklass
3183 if (subklass() != NULL) {
3184 guarantee(subklass()->is_klass(), "should be klass");
3185 }
3186
3187 // Verify siblings
3188 Klass* super = this->super();
3189 Klass* sib = next_sibling();
3190 if (sib != NULL) {
3191 if (sib == this) {
3192 fatal("subclass points to itself " PTR_FORMAT, p2i(sib));
3193 }
3194
3195 guarantee(sib->is_klass(), "should be klass");
3196 guarantee(sib->super() == super, "siblings should have same superklass");
3197 }
3198
3199 // Verify implementor fields
3200 Klass* im = implementor();
3201 if (im != NULL) {
3202 guarantee(is_interface(), "only interfaces should have implementor set");
3203 guarantee(im->is_klass(), "should be klass");
3204 guarantee(!im->is_interface() || im == this,
3205 "implementors cannot be interfaces");
3206 }
3207
3208 // Verify local interfaces
3209 if (local_interfaces()) {
3210 Array<Klass*>* local_interfaces = this->local_interfaces();
3211 for (int j = 0; j < local_interfaces->length(); j++) {
3212 Klass* e = local_interfaces->at(j);
3213 guarantee(e->is_klass() && e->is_interface(), "invalid local interface");
3214 }
3215 }
3216
3217 // Verify transitive interfaces
3218 if (transitive_interfaces() != NULL) {
3219 Array<Klass*>* transitive_interfaces = this->transitive_interfaces();
3220 for (int j = 0; j < transitive_interfaces->length(); j++) {
3221 Klass* e = transitive_interfaces->at(j);
3222 guarantee(e->is_klass() && e->is_interface(), "invalid transitive interface");
3223 }
3224 }
3225
3226 // Verify methods
3227 if (methods() != NULL) {
3228 Array<Method*>* methods = this->methods();
3229 for (int j = 0; j < methods->length(); j++) {
3230 guarantee(methods->at(j)->is_method(), "non-method in methods array");
3231 }
3232 for (int j = 0; j < methods->length() - 1; j++) {
3233 Method* m1 = methods->at(j);
3234 Method* m2 = methods->at(j + 1);
3235 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
3236 }
3237 }
3238
3239 // Verify method ordering
3240 if (method_ordering() != NULL) {
3241 Array<int>* method_ordering = this->method_ordering();
3242 int length = method_ordering->length();
3243 if (JvmtiExport::can_maintain_original_method_order() ||
3244 ((UseSharedSpaces || DumpSharedSpaces) && length != 0)) {
3245 guarantee(length == methods()->length(), "invalid method ordering length");
3246 jlong sum = 0;
3247 for (int j = 0; j < length; j++) {
3248 int original_index = method_ordering->at(j);
3249 guarantee(original_index >= 0, "invalid method ordering index");
3250 guarantee(original_index < length, "invalid method ordering index");
3251 sum += original_index;
3252 }
3253 // Verify sum of indices 0,1,...,length-1
3254 guarantee(sum == ((jlong)length*(length-1))/2, "invalid method ordering sum");
3255 } else {
3256 guarantee(length == 0, "invalid method ordering length");
3257 }
3258 }
3259
3260 // Verify default methods
3261 if (default_methods() != NULL) {
3262 Array<Method*>* methods = this->default_methods();
3263 for (int j = 0; j < methods->length(); j++) {
3264 guarantee(methods->at(j)->is_method(), "non-method in methods array");
3265 }
3266 for (int j = 0; j < methods->length() - 1; j++) {
3267 Method* m1 = methods->at(j);
3268 Method* m2 = methods->at(j + 1);
3269 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
3270 }
3271 }
3272
3273 // Verify JNI static field identifiers
3274 if (jni_ids() != NULL) {
3275 jni_ids()->verify(this);
3276 }
3277
3278 // Verify other fields
3279 if (array_klasses() != NULL) {
3280 guarantee(array_klasses()->is_klass(), "should be klass");
3281 }
3282 if (constants() != NULL) {
3283 guarantee(constants()->is_constantPool(), "should be constant pool");
3284 }
3285 const Klass* host = host_klass();
3286 if (host != NULL) {
3287 guarantee(host->is_klass(), "should be klass");
3288 }
3289 }
3290
3291 void InstanceKlass::oop_verify_on(oop obj, outputStream* st) {
3292 Klass::oop_verify_on(obj, st);
3293 VerifyFieldClosure blk;
3294 obj->oop_iterate_no_header(&blk);
3295 }
3296
3297
3298 // JNIid class for jfieldIDs only
3299 // Note to reviewers:
3300 // These JNI functions are just moved over to column 1 and not changed
3301 // in the compressed oops workspace.
3302 JNIid::JNIid(Klass* holder, int offset, JNIid* next) {
3303 _holder = holder;
3304 _offset = offset;
3305 _next = next;
3306 debug_only(_is_static_field_id = false;)
3307 }
3308
3309
3310 JNIid* JNIid::find(int offset) {
3311 JNIid* current = this;
3312 while (current != NULL) {
3313 if (current->offset() == offset) return current;
3314 current = current->next();
3315 }
3316 return NULL;
3317 }
3318
3319 void JNIid::deallocate(JNIid* current) {
3320 while (current != NULL) {
3321 JNIid* next = current->next();
3322 delete current;
3323 current = next;
3324 }
3325 }
3326
3327
3328 void JNIid::verify(Klass* holder) {
3329 int first_field_offset = InstanceMirrorKlass::offset_of_static_fields();
3330 int end_field_offset;
3331 end_field_offset = first_field_offset + (InstanceKlass::cast(holder)->static_field_size() * wordSize);
3332
3333 JNIid* current = this;
3334 while (current != NULL) {
3335 guarantee(current->holder() == holder, "Invalid klass in JNIid");
3336 #ifdef ASSERT
3337 int o = current->offset();
3338 if (current->is_static_field_id()) {
3339 guarantee(o >= first_field_offset && o < end_field_offset, "Invalid static field offset in JNIid");
3340 }
3341 #endif
3342 current = current->next();
3343 }
3344 }
3345
3346
3347 #ifdef ASSERT
3348 void InstanceKlass::set_init_state(ClassState state) {
3349 bool good_state = is_shared() ? (_init_state <= state)
3350 : (_init_state < state);
3351 assert(good_state || state == allocated, "illegal state transition");
3352 _init_state = (u1)state;
3353 }
3354 #endif
3355
3356 #if INCLUDE_JVMTI
3357
3358 // RedefineClasses() support for previous versions
3359
3360 // Globally, there is at least one previous version of a class to walk
3361 // during class unloading, which is saved because old methods in the class
3362 // are still running. Otherwise the previous version list is cleaned up.
3363 bool InstanceKlass::_has_previous_versions = false;
3364
3365 // Returns true if there are previous versions of a class for class
3366 // unloading only. Also resets the flag to false. purge_previous_version
3367 // will set the flag to true if there are any left, i.e., if there's any
3368 // work to do for next time. This is to avoid the expensive code cache
3369 // walk in CLDG::do_unloading().
3370 bool InstanceKlass::has_previous_versions_and_reset() {
3371 bool ret = _has_previous_versions;
3372 log_trace(redefine, class, iklass, purge)("Class unloading: has_previous_versions = %s",
3373 ret ? "true" : "false");
3374 _has_previous_versions = false;
3375 return ret;
3376 }
3377
3378 // Purge previous versions before adding new previous versions of the class and
3379 // during class unloading.
3380 void InstanceKlass::purge_previous_version_list() {
3381 assert(SafepointSynchronize::is_at_safepoint(), "only called at safepoint");
3382 assert(has_been_redefined(), "Should only be called for main class");
3383
3384 // Quick exit.
3385 if (previous_versions() == NULL) {
3386 return;
3387 }
3388
3389 // This klass has previous versions so see what we can cleanup
3390 // while it is safe to do so.
3391
3392 int deleted_count = 0; // leave debugging breadcrumbs
3393 int live_count = 0;
3394 ClassLoaderData* loader_data = class_loader_data();
3395 assert(loader_data != NULL, "should never be null");
3396
3397 ResourceMark rm;
3398 log_trace(redefine, class, iklass, purge)("%s: previous versions", external_name());
3399
3400 // previous versions are linked together through the InstanceKlass
3401 InstanceKlass* pv_node = previous_versions();
3402 InstanceKlass* last = this;
3403 int version = 0;
3404
3405 // check the previous versions list
3406 for (; pv_node != NULL; ) {
3407
3408 ConstantPool* pvcp = pv_node->constants();
3409 assert(pvcp != NULL, "cp ref was unexpectedly cleared");
3410
3411 if (!pvcp->on_stack()) {
3412 // If the constant pool isn't on stack, none of the methods
3413 // are executing. Unlink this previous_version.
3414 // The previous version InstanceKlass is on the ClassLoaderData deallocate list
3415 // so will be deallocated during the next phase of class unloading.
3416 log_trace(redefine, class, iklass, purge)
3417 ("previous version " INTPTR_FORMAT " is dead.", p2i(pv_node));
3418 // For debugging purposes.
3419 pv_node->set_is_scratch_class();
3420 // Unlink from previous version list.
3421 assert(pv_node->class_loader_data() == loader_data, "wrong loader_data");
3422 InstanceKlass* next = pv_node->previous_versions();
3423 pv_node->link_previous_versions(NULL); // point next to NULL
3424 last->link_previous_versions(next);
3425 // Add to the deallocate list after unlinking
3426 loader_data->add_to_deallocate_list(pv_node);
3427 pv_node = next;
3428 deleted_count++;
3429 version++;
3430 continue;
3431 } else {
3432 log_trace(redefine, class, iklass, purge)("previous version " INTPTR_FORMAT " is alive", p2i(pv_node));
3433 assert(pvcp->pool_holder() != NULL, "Constant pool with no holder");
3434 guarantee (!loader_data->is_unloading(), "unloaded classes can't be on the stack");
3435 live_count++;
3436 // found a previous version for next time we do class unloading
3437 _has_previous_versions = true;
3438 }
3439
3440 // At least one method is live in this previous version.
3441 // Reset dead EMCP methods not to get breakpoints.
3442 // All methods are deallocated when all of the methods for this class are no
3443 // longer running.
3444 Array<Method*>* method_refs = pv_node->methods();
3445 if (method_refs != NULL) {
3446 log_trace(redefine, class, iklass, purge)("previous methods length=%d", method_refs->length());
3447 for (int j = 0; j < method_refs->length(); j++) {
3448 Method* method = method_refs->at(j);
3449
3450 if (!method->on_stack()) {
3451 // no breakpoints for non-running methods
3452 if (method->is_running_emcp()) {
3453 method->set_running_emcp(false);
3454 }
3455 } else {
3456 assert (method->is_obsolete() || method->is_running_emcp(),
3457 "emcp method cannot run after emcp bit is cleared");
3458 log_trace(redefine, class, iklass, purge)
3459 ("purge: %s(%s): prev method @%d in version @%d is alive",
3460 method->name()->as_C_string(), method->signature()->as_C_string(), j, version);
3461 }
3462 }
3463 }
3464 // next previous version
3465 last = pv_node;
3466 pv_node = pv_node->previous_versions();
3467 version++;
3468 }
3469 log_trace(redefine, class, iklass, purge)
3470 ("previous version stats: live=%d, deleted=%d", live_count, deleted_count);
3471 }
3472
3473 void InstanceKlass::mark_newly_obsolete_methods(Array<Method*>* old_methods,
3474 int emcp_method_count) {
3475 int obsolete_method_count = old_methods->length() - emcp_method_count;
3476
3477 if (emcp_method_count != 0 && obsolete_method_count != 0 &&
3478 _previous_versions != NULL) {
3479 // We have a mix of obsolete and EMCP methods so we have to
3480 // clear out any matching EMCP method entries the hard way.
3481 int local_count = 0;
3482 for (int i = 0; i < old_methods->length(); i++) {
3483 Method* old_method = old_methods->at(i);
3484 if (old_method->is_obsolete()) {
3485 // only obsolete methods are interesting
3486 Symbol* m_name = old_method->name();
3487 Symbol* m_signature = old_method->signature();
3488
3489 // previous versions are linked together through the InstanceKlass
3490 int j = 0;
3491 for (InstanceKlass* prev_version = _previous_versions;
3492 prev_version != NULL;
3493 prev_version = prev_version->previous_versions(), j++) {
3494
3495 Array<Method*>* method_refs = prev_version->methods();
3496 for (int k = 0; k < method_refs->length(); k++) {
3497 Method* method = method_refs->at(k);
3498
3499 if (!method->is_obsolete() &&
3500 method->name() == m_name &&
3501 method->signature() == m_signature) {
3502 // The current RedefineClasses() call has made all EMCP
3503 // versions of this method obsolete so mark it as obsolete
3504 log_trace(redefine, class, iklass, add)
3505 ("%s(%s): flush obsolete method @%d in version @%d",
3506 m_name->as_C_string(), m_signature->as_C_string(), k, j);
3507
3508 method->set_is_obsolete();
3509 break;
3510 }
3511 }
3512
3513 // The previous loop may not find a matching EMCP method, but
3514 // that doesn't mean that we can optimize and not go any
3515 // further back in the PreviousVersion generations. The EMCP
3516 // method for this generation could have already been made obsolete,
3517 // but there still may be an older EMCP method that has not
3518 // been made obsolete.
3519 }
3520
3521 if (++local_count >= obsolete_method_count) {
3522 // no more obsolete methods so bail out now
3523 break;
3524 }
3525 }
3526 }
3527 }
3528 }
3529
3530 // Save the scratch_class as the previous version if any of the methods are running.
3531 // The previous_versions are used to set breakpoints in EMCP methods and they are
3532 // also used to clean MethodData links to redefined methods that are no longer running.
3533 void InstanceKlass::add_previous_version(InstanceKlass* scratch_class,
3534 int emcp_method_count) {
3535 assert(Thread::current()->is_VM_thread(),
3536 "only VMThread can add previous versions");
3537
3538 ResourceMark rm;
3539 log_trace(redefine, class, iklass, add)
3540 ("adding previous version ref for %s, EMCP_cnt=%d", scratch_class->external_name(), emcp_method_count);
3541
3542 // Clean out old previous versions for this class
3543 purge_previous_version_list();
3544
3545 // Mark newly obsolete methods in remaining previous versions. An EMCP method from
3546 // a previous redefinition may be made obsolete by this redefinition.
3547 Array<Method*>* old_methods = scratch_class->methods();
3548 mark_newly_obsolete_methods(old_methods, emcp_method_count);
3549
3550 // If the constant pool for this previous version of the class
3551 // is not marked as being on the stack, then none of the methods
3552 // in this previous version of the class are on the stack so
3553 // we don't need to add this as a previous version.
3554 ConstantPool* cp_ref = scratch_class->constants();
3555 if (!cp_ref->on_stack()) {
3556 log_trace(redefine, class, iklass, add)("scratch class not added; no methods are running");
3557 // For debugging purposes.
3558 scratch_class->set_is_scratch_class();
3559 scratch_class->class_loader_data()->add_to_deallocate_list(scratch_class);
3560 return;
3561 }
3562
3563 if (emcp_method_count != 0) {
3564 // At least one method is still running, check for EMCP methods
3565 for (int i = 0; i < old_methods->length(); i++) {
3566 Method* old_method = old_methods->at(i);
3567 if (!old_method->is_obsolete() && old_method->on_stack()) {
3568 // if EMCP method (not obsolete) is on the stack, mark as EMCP so that
3569 // we can add breakpoints for it.
3570
3571 // We set the method->on_stack bit during safepoints for class redefinition
3572 // and use this bit to set the is_running_emcp bit.
3573 // After the safepoint, the on_stack bit is cleared and the running emcp
3574 // method may exit. If so, we would set a breakpoint in a method that
3575 // is never reached, but this won't be noticeable to the programmer.
3576 old_method->set_running_emcp(true);
3577 log_trace(redefine, class, iklass, add)
3578 ("EMCP method %s is on_stack " INTPTR_FORMAT, old_method->name_and_sig_as_C_string(), p2i(old_method));
3579 } else if (!old_method->is_obsolete()) {
3580 log_trace(redefine, class, iklass, add)
3581 ("EMCP method %s is NOT on_stack " INTPTR_FORMAT, old_method->name_and_sig_as_C_string(), p2i(old_method));
3582 }
3583 }
3584 }
3585
3586 // Add previous version if any methods are still running.
3587 // Set has_previous_version flag for processing during class unloading.
3588 _has_previous_versions = true;
3589 log_trace(redefine, class, iklass, add) ("scratch class added; one of its methods is on_stack.");
3590 assert(scratch_class->previous_versions() == NULL, "shouldn't have a previous version");
3591 scratch_class->link_previous_versions(previous_versions());
3592 link_previous_versions(scratch_class);
3593 } // end add_previous_version()
3594
3595 #endif // INCLUDE_JVMTI
3596
3597 Method* InstanceKlass::method_with_idnum(int idnum) {
3598 Method* m = NULL;
3599 if (idnum < methods()->length()) {
3600 m = methods()->at(idnum);
3601 }
3602 if (m == NULL || m->method_idnum() != idnum) {
3603 for (int index = 0; index < methods()->length(); ++index) {
3604 m = methods()->at(index);
3605 if (m->method_idnum() == idnum) {
3606 return m;
3607 }
3608 }
3609 // None found, return null for the caller to handle.
3610 return NULL;
3611 }
3612 return m;
3613 }
3614
3615
3616 Method* InstanceKlass::method_with_orig_idnum(int idnum) {
3617 if (idnum >= methods()->length()) {
3618 return NULL;
3619 }
3620 Method* m = methods()->at(idnum);
3621 if (m != NULL && m->orig_method_idnum() == idnum) {
3622 return m;
3623 }
3624 // Obsolete method idnum does not match the original idnum
3625 for (int index = 0; index < methods()->length(); ++index) {
3626 m = methods()->at(index);
3627 if (m->orig_method_idnum() == idnum) {
3628 return m;
3629 }
3630 }
3631 // None found, return null for the caller to handle.
3632 return NULL;
3633 }
3634
3635
3636 Method* InstanceKlass::method_with_orig_idnum(int idnum, int version) {
3637 InstanceKlass* holder = get_klass_version(version);
3638 if (holder == NULL) {
3639 return NULL; // The version of klass is gone, no method is found
3640 }
3641 Method* method = holder->method_with_orig_idnum(idnum);
3642 return method;
3643 }
3644
3645 #if INCLUDE_JVMTI
3646 JvmtiCachedClassFileData* InstanceKlass::get_cached_class_file() {
3647 if (MetaspaceShared::is_in_shared_space(_cached_class_file)) {
3648 // Ignore the archived class stream data
3649 return NULL;
3650 } else {
3651 return _cached_class_file;
3652 }
3653 }
3654
3655 jint InstanceKlass::get_cached_class_file_len() {
3656 return VM_RedefineClasses::get_cached_class_file_len(_cached_class_file);
3657 }
3658
3659 unsigned char * InstanceKlass::get_cached_class_file_bytes() {
3660 return VM_RedefineClasses::get_cached_class_file_bytes(_cached_class_file);
3661 }
3662
3663 #if INCLUDE_CDS
3664 JvmtiCachedClassFileData* InstanceKlass::get_archived_class_data() {
3665 assert(this->is_shared(), "class should be shared");
3666 if (MetaspaceShared::is_in_shared_space(_cached_class_file)) {
3667 return _cached_class_file;
3668 } else {
3669 return NULL;
3670 }
3671 }
3672 #endif
3673 #endif