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