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