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