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