Wed, 01 May 2013 08:07:59 -0700
8013418: assert(i == total_args_passed) in AdapterHandlerLibrary::get_adapter since 8-b87
Summary: Do not treat static methods as miranda methods.
Reviewed-by: dholmes, acorn
1 /*
2 * Copyright (c) 1997, 2013, 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 */
25 #include "precompiled.hpp"
26 #include "classfile/javaClasses.hpp"
27 #include "classfile/systemDictionary.hpp"
28 #include "classfile/verifier.hpp"
29 #include "classfile/vmSymbols.hpp"
30 #include "compiler/compileBroker.hpp"
31 #include "gc_implementation/shared/markSweep.inline.hpp"
32 #include "gc_interface/collectedHeap.inline.hpp"
33 #include "interpreter/oopMapCache.hpp"
34 #include "interpreter/rewriter.hpp"
35 #include "jvmtifiles/jvmti.h"
36 #include "memory/genOopClosures.inline.hpp"
37 #include "memory/heapInspection.hpp"
38 #include "memory/metadataFactory.hpp"
39 #include "memory/oopFactory.hpp"
40 #include "oops/fieldStreams.hpp"
41 #include "oops/instanceClassLoaderKlass.hpp"
42 #include "oops/instanceKlass.hpp"
43 #include "oops/instanceMirrorKlass.hpp"
44 #include "oops/instanceOop.hpp"
45 #include "oops/klass.inline.hpp"
46 #include "oops/method.hpp"
47 #include "oops/oop.inline.hpp"
48 #include "oops/symbol.hpp"
49 #include "prims/jvmtiExport.hpp"
50 #include "prims/jvmtiRedefineClassesTrace.hpp"
51 #include "prims/methodComparator.hpp"
52 #include "runtime/fieldDescriptor.hpp"
53 #include "runtime/handles.inline.hpp"
54 #include "runtime/javaCalls.hpp"
55 #include "runtime/mutexLocker.hpp"
56 #include "runtime/thread.inline.hpp"
57 #include "services/classLoadingService.hpp"
58 #include "services/threadService.hpp"
59 #include "utilities/dtrace.hpp"
60 #include "utilities/macros.hpp"
61 #if INCLUDE_ALL_GCS
62 #include "gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp"
63 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
64 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
65 #include "gc_implementation/g1/g1RemSet.inline.hpp"
66 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
67 #include "gc_implementation/parNew/parOopClosures.inline.hpp"
68 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.inline.hpp"
69 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
70 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
71 #include "oops/oop.pcgc.inline.hpp"
72 #endif // INCLUDE_ALL_GCS
73 #ifdef COMPILER1
74 #include "c1/c1_Compiler.hpp"
75 #endif
77 #ifdef DTRACE_ENABLED
79 #ifndef USDT2
81 HS_DTRACE_PROBE_DECL4(hotspot, class__initialization__required,
82 char*, intptr_t, oop, intptr_t);
83 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__recursive,
84 char*, intptr_t, oop, intptr_t, int);
85 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__concurrent,
86 char*, intptr_t, oop, intptr_t, int);
87 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__erroneous,
88 char*, intptr_t, oop, intptr_t, int);
89 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__super__failed,
90 char*, intptr_t, oop, intptr_t, int);
91 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__clinit,
92 char*, intptr_t, oop, intptr_t, int);
93 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__error,
94 char*, intptr_t, oop, intptr_t, int);
95 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__end,
96 char*, intptr_t, oop, intptr_t, int);
98 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) \
99 { \
100 char* data = NULL; \
101 int len = 0; \
102 Symbol* name = (clss)->name(); \
103 if (name != NULL) { \
104 data = (char*)name->bytes(); \
105 len = name->utf8_length(); \
106 } \
107 HS_DTRACE_PROBE4(hotspot, class__initialization__##type, \
108 data, len, (clss)->class_loader(), thread_type); \
109 }
111 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) \
112 { \
113 char* data = NULL; \
114 int len = 0; \
115 Symbol* name = (clss)->name(); \
116 if (name != NULL) { \
117 data = (char*)name->bytes(); \
118 len = name->utf8_length(); \
119 } \
120 HS_DTRACE_PROBE5(hotspot, class__initialization__##type, \
121 data, len, (clss)->class_loader(), thread_type, wait); \
122 }
123 #else /* USDT2 */
125 #define HOTSPOT_CLASS_INITIALIZATION_required HOTSPOT_CLASS_INITIALIZATION_REQUIRED
126 #define HOTSPOT_CLASS_INITIALIZATION_recursive HOTSPOT_CLASS_INITIALIZATION_RECURSIVE
127 #define HOTSPOT_CLASS_INITIALIZATION_concurrent HOTSPOT_CLASS_INITIALIZATION_CONCURRENT
128 #define HOTSPOT_CLASS_INITIALIZATION_erroneous HOTSPOT_CLASS_INITIALIZATION_ERRONEOUS
129 #define HOTSPOT_CLASS_INITIALIZATION_super__failed HOTSPOT_CLASS_INITIALIZATION_SUPER_FAILED
130 #define HOTSPOT_CLASS_INITIALIZATION_clinit HOTSPOT_CLASS_INITIALIZATION_CLINIT
131 #define HOTSPOT_CLASS_INITIALIZATION_error HOTSPOT_CLASS_INITIALIZATION_ERROR
132 #define HOTSPOT_CLASS_INITIALIZATION_end HOTSPOT_CLASS_INITIALIZATION_END
133 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) \
134 { \
135 char* data = NULL; \
136 int len = 0; \
137 Symbol* name = (clss)->name(); \
138 if (name != NULL) { \
139 data = (char*)name->bytes(); \
140 len = name->utf8_length(); \
141 } \
142 HOTSPOT_CLASS_INITIALIZATION_##type( \
143 data, len, (clss)->class_loader(), thread_type); \
144 }
146 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) \
147 { \
148 char* data = NULL; \
149 int len = 0; \
150 Symbol* name = (clss)->name(); \
151 if (name != NULL) { \
152 data = (char*)name->bytes(); \
153 len = name->utf8_length(); \
154 } \
155 HOTSPOT_CLASS_INITIALIZATION_##type( \
156 data, len, (clss)->class_loader(), thread_type, wait); \
157 }
158 #endif /* USDT2 */
160 #else // ndef DTRACE_ENABLED
162 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type)
163 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait)
165 #endif // ndef DTRACE_ENABLED
167 volatile int InstanceKlass::_total_instanceKlass_count = 0;
169 InstanceKlass* InstanceKlass::allocate_instance_klass(
170 ClassLoaderData* loader_data,
171 int vtable_len,
172 int itable_len,
173 int static_field_size,
174 int nonstatic_oop_map_size,
175 ReferenceType rt,
176 AccessFlags access_flags,
177 Symbol* name,
178 Klass* super_klass,
179 bool is_anonymous,
180 TRAPS) {
182 int size = InstanceKlass::size(vtable_len, itable_len, nonstatic_oop_map_size,
183 access_flags.is_interface(), is_anonymous);
185 // Allocation
186 InstanceKlass* ik;
187 if (rt == REF_NONE) {
188 if (name == vmSymbols::java_lang_Class()) {
189 ik = new (loader_data, size, THREAD) InstanceMirrorKlass(
190 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
191 access_flags, is_anonymous);
192 } else if (name == vmSymbols::java_lang_ClassLoader() ||
193 (SystemDictionary::ClassLoader_klass_loaded() &&
194 super_klass != NULL &&
195 super_klass->is_subtype_of(SystemDictionary::ClassLoader_klass()))) {
196 ik = new (loader_data, size, THREAD) InstanceClassLoaderKlass(
197 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
198 access_flags, is_anonymous);
199 } else {
200 // normal class
201 ik = new (loader_data, size, THREAD) InstanceKlass(
202 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
203 access_flags, is_anonymous);
204 }
205 } else {
206 // reference klass
207 ik = new (loader_data, size, THREAD) InstanceRefKlass(
208 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
209 access_flags, is_anonymous);
210 }
212 // Check for pending exception before adding to the loader data and incrementing
213 // class count. Can get OOM here.
214 if (HAS_PENDING_EXCEPTION) {
215 return NULL;
216 }
218 // Add all classes to our internal class loader list here,
219 // including classes in the bootstrap (NULL) class loader.
220 loader_data->add_class(ik);
222 Atomic::inc(&_total_instanceKlass_count);
223 return ik;
224 }
227 // copy method ordering from resource area to Metaspace
228 void InstanceKlass::copy_method_ordering(intArray* m, TRAPS) {
229 if (m != NULL) {
230 // allocate a new array and copy contents (memcpy?)
231 _method_ordering = MetadataFactory::new_array<int>(class_loader_data(), m->length(), CHECK);
232 for (int i = 0; i < m->length(); i++) {
233 _method_ordering->at_put(i, m->at(i));
234 }
235 } else {
236 _method_ordering = Universe::the_empty_int_array();
237 }
238 }
241 InstanceKlass::InstanceKlass(int vtable_len,
242 int itable_len,
243 int static_field_size,
244 int nonstatic_oop_map_size,
245 ReferenceType rt,
246 AccessFlags access_flags,
247 bool is_anonymous) {
248 No_Safepoint_Verifier no_safepoint; // until k becomes parsable
250 int iksize = InstanceKlass::size(vtable_len, itable_len, nonstatic_oop_map_size,
251 access_flags.is_interface(), is_anonymous);
253 set_vtable_length(vtable_len);
254 set_itable_length(itable_len);
255 set_static_field_size(static_field_size);
256 set_nonstatic_oop_map_size(nonstatic_oop_map_size);
257 set_access_flags(access_flags);
258 _misc_flags = 0; // initialize to zero
259 set_is_anonymous(is_anonymous);
260 assert(size() == iksize, "wrong size for object");
262 set_array_klasses(NULL);
263 set_methods(NULL);
264 set_method_ordering(NULL);
265 set_local_interfaces(NULL);
266 set_transitive_interfaces(NULL);
267 init_implementor();
268 set_fields(NULL, 0);
269 set_constants(NULL);
270 set_class_loader_data(NULL);
271 set_protection_domain(NULL);
272 set_signers(NULL);
273 set_source_file_name(NULL);
274 set_source_debug_extension(NULL, 0);
275 set_array_name(NULL);
276 set_inner_classes(NULL);
277 set_static_oop_field_count(0);
278 set_nonstatic_field_size(0);
279 set_is_marked_dependent(false);
280 set_init_state(InstanceKlass::allocated);
281 set_init_thread(NULL);
282 set_init_lock(NULL);
283 set_reference_type(rt);
284 set_oop_map_cache(NULL);
285 set_jni_ids(NULL);
286 set_osr_nmethods_head(NULL);
287 set_breakpoints(NULL);
288 init_previous_versions();
289 set_generic_signature(NULL);
290 release_set_methods_jmethod_ids(NULL);
291 release_set_methods_cached_itable_indices(NULL);
292 set_annotations(NULL);
293 set_jvmti_cached_class_field_map(NULL);
294 set_initial_method_idnum(0);
295 _dependencies = NULL;
296 set_jvmti_cached_class_field_map(NULL);
297 set_cached_class_file(NULL, 0);
298 set_initial_method_idnum(0);
299 set_minor_version(0);
300 set_major_version(0);
301 NOT_PRODUCT(_verify_count = 0;)
303 // initialize the non-header words to zero
304 intptr_t* p = (intptr_t*)this;
305 for (int index = InstanceKlass::header_size(); index < iksize; index++) {
306 p[index] = NULL_WORD;
307 }
309 // Set temporary value until parseClassFile updates it with the real instance
310 // size.
311 set_layout_helper(Klass::instance_layout_helper(0, true));
312 }
315 void InstanceKlass::deallocate_methods(ClassLoaderData* loader_data,
316 Array<Method*>* methods) {
317 if (methods != NULL && methods != Universe::the_empty_method_array()) {
318 for (int i = 0; i < methods->length(); i++) {
319 Method* method = methods->at(i);
320 if (method == NULL) continue; // maybe null if error processing
321 // Only want to delete methods that are not executing for RedefineClasses.
322 // The previous version will point to them so they're not totally dangling
323 assert (!method->on_stack(), "shouldn't be called with methods on stack");
324 MetadataFactory::free_metadata(loader_data, method);
325 }
326 MetadataFactory::free_array<Method*>(loader_data, methods);
327 }
328 }
330 void InstanceKlass::deallocate_interfaces(ClassLoaderData* loader_data,
331 Klass* super_klass,
332 Array<Klass*>* local_interfaces,
333 Array<Klass*>* transitive_interfaces) {
334 // Only deallocate transitive interfaces if not empty, same as super class
335 // or same as local interfaces. See code in parseClassFile.
336 Array<Klass*>* ti = transitive_interfaces;
337 if (ti != Universe::the_empty_klass_array() && ti != local_interfaces) {
338 // check that the interfaces don't come from super class
339 Array<Klass*>* sti = (super_klass == NULL) ? NULL :
340 InstanceKlass::cast(super_klass)->transitive_interfaces();
341 if (ti != sti) {
342 MetadataFactory::free_array<Klass*>(loader_data, ti);
343 }
344 }
346 // local interfaces can be empty
347 if (local_interfaces != Universe::the_empty_klass_array()) {
348 MetadataFactory::free_array<Klass*>(loader_data, local_interfaces);
349 }
350 }
352 // This function deallocates the metadata and C heap pointers that the
353 // InstanceKlass points to.
354 void InstanceKlass::deallocate_contents(ClassLoaderData* loader_data) {
356 // Orphan the mirror first, CMS thinks it's still live.
357 if (java_mirror() != NULL) {
358 java_lang_Class::set_klass(java_mirror(), NULL);
359 }
361 // Need to take this class off the class loader data list.
362 loader_data->remove_class(this);
364 // The array_klass for this class is created later, after error handling.
365 // For class redefinition, we keep the original class so this scratch class
366 // doesn't have an array class. Either way, assert that there is nothing
367 // to deallocate.
368 assert(array_klasses() == NULL, "array classes shouldn't be created for this class yet");
370 // Release C heap allocated data that this might point to, which includes
371 // reference counting symbol names.
372 release_C_heap_structures();
374 deallocate_methods(loader_data, methods());
375 set_methods(NULL);
377 if (method_ordering() != Universe::the_empty_int_array()) {
378 MetadataFactory::free_array<int>(loader_data, method_ordering());
379 }
380 set_method_ordering(NULL);
382 // This array is in Klass, but remove it with the InstanceKlass since
383 // this place would be the only caller and it can share memory with transitive
384 // interfaces.
385 if (secondary_supers() != Universe::the_empty_klass_array() &&
386 secondary_supers() != transitive_interfaces()) {
387 MetadataFactory::free_array<Klass*>(loader_data, secondary_supers());
388 }
389 set_secondary_supers(NULL);
391 deallocate_interfaces(loader_data, super(), local_interfaces(), transitive_interfaces());
392 set_transitive_interfaces(NULL);
393 set_local_interfaces(NULL);
395 MetadataFactory::free_array<jushort>(loader_data, fields());
396 set_fields(NULL, 0);
398 // If a method from a redefined class is using this constant pool, don't
399 // delete it, yet. The new class's previous version will point to this.
400 if (constants() != NULL) {
401 assert (!constants()->on_stack(), "shouldn't be called if anything is onstack");
402 MetadataFactory::free_metadata(loader_data, constants());
403 set_constants(NULL);
404 }
406 if (inner_classes() != Universe::the_empty_short_array()) {
407 MetadataFactory::free_array<jushort>(loader_data, inner_classes());
408 }
409 set_inner_classes(NULL);
411 // Null out Java heap objects, although these won't be walked to keep
412 // alive once this InstanceKlass is deallocated.
413 set_protection_domain(NULL);
414 set_signers(NULL);
415 set_init_lock(NULL);
417 // We should deallocate the Annotations instance
418 MetadataFactory::free_metadata(loader_data, annotations());
419 set_annotations(NULL);
420 }
422 bool InstanceKlass::should_be_initialized() const {
423 return !is_initialized();
424 }
426 klassVtable* InstanceKlass::vtable() const {
427 return new klassVtable(this, start_of_vtable(), vtable_length() / vtableEntry::size());
428 }
430 klassItable* InstanceKlass::itable() const {
431 return new klassItable(instanceKlassHandle(this));
432 }
434 void InstanceKlass::eager_initialize(Thread *thread) {
435 if (!EagerInitialization) return;
437 if (this->is_not_initialized()) {
438 // abort if the the class has a class initializer
439 if (this->class_initializer() != NULL) return;
441 // abort if it is java.lang.Object (initialization is handled in genesis)
442 Klass* super = this->super();
443 if (super == NULL) return;
445 // abort if the super class should be initialized
446 if (!InstanceKlass::cast(super)->is_initialized()) return;
448 // call body to expose the this pointer
449 instanceKlassHandle this_oop(thread, this);
450 eager_initialize_impl(this_oop);
451 }
452 }
455 void InstanceKlass::eager_initialize_impl(instanceKlassHandle this_oop) {
456 EXCEPTION_MARK;
457 volatile oop init_lock = this_oop->init_lock();
458 ObjectLocker ol(init_lock, THREAD);
460 // abort if someone beat us to the initialization
461 if (!this_oop->is_not_initialized()) return; // note: not equivalent to is_initialized()
463 ClassState old_state = this_oop->init_state();
464 link_class_impl(this_oop, true, THREAD);
465 if (HAS_PENDING_EXCEPTION) {
466 CLEAR_PENDING_EXCEPTION;
467 // Abort if linking the class throws an exception.
469 // Use a test to avoid redundantly resetting the state if there's
470 // no change. Set_init_state() asserts that state changes make
471 // progress, whereas here we might just be spinning in place.
472 if( old_state != this_oop->_init_state )
473 this_oop->set_init_state (old_state);
474 } else {
475 // linking successfull, mark class as initialized
476 this_oop->set_init_state (fully_initialized);
477 // trace
478 if (TraceClassInitialization) {
479 ResourceMark rm(THREAD);
480 tty->print_cr("[Initialized %s without side effects]", this_oop->external_name());
481 }
482 }
483 }
486 // See "The Virtual Machine Specification" section 2.16.5 for a detailed explanation of the class initialization
487 // process. The step comments refers to the procedure described in that section.
488 // Note: implementation moved to static method to expose the this pointer.
489 void InstanceKlass::initialize(TRAPS) {
490 if (this->should_be_initialized()) {
491 HandleMark hm(THREAD);
492 instanceKlassHandle this_oop(THREAD, this);
493 initialize_impl(this_oop, CHECK);
494 // Note: at this point the class may be initialized
495 // OR it may be in the state of being initialized
496 // in case of recursive initialization!
497 } else {
498 assert(is_initialized(), "sanity check");
499 }
500 }
503 bool InstanceKlass::verify_code(
504 instanceKlassHandle this_oop, bool throw_verifyerror, TRAPS) {
505 // 1) Verify the bytecodes
506 Verifier::Mode mode =
507 throw_verifyerror ? Verifier::ThrowException : Verifier::NoException;
508 return Verifier::verify(this_oop, mode, this_oop->should_verify_class(), CHECK_false);
509 }
512 // Used exclusively by the shared spaces dump mechanism to prevent
513 // classes mapped into the shared regions in new VMs from appearing linked.
515 void InstanceKlass::unlink_class() {
516 assert(is_linked(), "must be linked");
517 _init_state = loaded;
518 }
520 void InstanceKlass::link_class(TRAPS) {
521 assert(is_loaded(), "must be loaded");
522 if (!is_linked()) {
523 HandleMark hm(THREAD);
524 instanceKlassHandle this_oop(THREAD, this);
525 link_class_impl(this_oop, true, CHECK);
526 }
527 }
529 // Called to verify that a class can link during initialization, without
530 // throwing a VerifyError.
531 bool InstanceKlass::link_class_or_fail(TRAPS) {
532 assert(is_loaded(), "must be loaded");
533 if (!is_linked()) {
534 HandleMark hm(THREAD);
535 instanceKlassHandle this_oop(THREAD, this);
536 link_class_impl(this_oop, false, CHECK_false);
537 }
538 return is_linked();
539 }
541 bool InstanceKlass::link_class_impl(
542 instanceKlassHandle this_oop, bool throw_verifyerror, TRAPS) {
543 // check for error state
544 if (this_oop->is_in_error_state()) {
545 ResourceMark rm(THREAD);
546 THROW_MSG_(vmSymbols::java_lang_NoClassDefFoundError(),
547 this_oop->external_name(), false);
548 }
549 // return if already verified
550 if (this_oop->is_linked()) {
551 return true;
552 }
554 // Timing
555 // timer handles recursion
556 assert(THREAD->is_Java_thread(), "non-JavaThread in link_class_impl");
557 JavaThread* jt = (JavaThread*)THREAD;
559 // link super class before linking this class
560 instanceKlassHandle super(THREAD, this_oop->super());
561 if (super.not_null()) {
562 if (super->is_interface()) { // check if super class is an interface
563 ResourceMark rm(THREAD);
564 Exceptions::fthrow(
565 THREAD_AND_LOCATION,
566 vmSymbols::java_lang_IncompatibleClassChangeError(),
567 "class %s has interface %s as super class",
568 this_oop->external_name(),
569 super->external_name()
570 );
571 return false;
572 }
574 link_class_impl(super, throw_verifyerror, CHECK_false);
575 }
577 // link all interfaces implemented by this class before linking this class
578 Array<Klass*>* interfaces = this_oop->local_interfaces();
579 int num_interfaces = interfaces->length();
580 for (int index = 0; index < num_interfaces; index++) {
581 HandleMark hm(THREAD);
582 instanceKlassHandle ih(THREAD, interfaces->at(index));
583 link_class_impl(ih, throw_verifyerror, CHECK_false);
584 }
586 // in case the class is linked in the process of linking its superclasses
587 if (this_oop->is_linked()) {
588 return true;
589 }
591 // trace only the link time for this klass that includes
592 // the verification time
593 PerfClassTraceTime vmtimer(ClassLoader::perf_class_link_time(),
594 ClassLoader::perf_class_link_selftime(),
595 ClassLoader::perf_classes_linked(),
596 jt->get_thread_stat()->perf_recursion_counts_addr(),
597 jt->get_thread_stat()->perf_timers_addr(),
598 PerfClassTraceTime::CLASS_LINK);
600 // verification & rewriting
601 {
602 volatile oop init_lock = this_oop->init_lock();
603 ObjectLocker ol(init_lock, THREAD);
604 // rewritten will have been set if loader constraint error found
605 // on an earlier link attempt
606 // don't verify or rewrite if already rewritten
608 if (!this_oop->is_linked()) {
609 if (!this_oop->is_rewritten()) {
610 {
611 // Timer includes any side effects of class verification (resolution,
612 // etc), but not recursive entry into verify_code().
613 PerfClassTraceTime timer(ClassLoader::perf_class_verify_time(),
614 ClassLoader::perf_class_verify_selftime(),
615 ClassLoader::perf_classes_verified(),
616 jt->get_thread_stat()->perf_recursion_counts_addr(),
617 jt->get_thread_stat()->perf_timers_addr(),
618 PerfClassTraceTime::CLASS_VERIFY);
619 bool verify_ok = verify_code(this_oop, throw_verifyerror, THREAD);
620 if (!verify_ok) {
621 return false;
622 }
623 }
625 // Just in case a side-effect of verify linked this class already
626 // (which can sometimes happen since the verifier loads classes
627 // using custom class loaders, which are free to initialize things)
628 if (this_oop->is_linked()) {
629 return true;
630 }
632 // also sets rewritten
633 this_oop->rewrite_class(CHECK_false);
634 }
636 // relocate jsrs and link methods after they are all rewritten
637 this_oop->link_methods(CHECK_false);
639 // Initialize the vtable and interface table after
640 // methods have been rewritten since rewrite may
641 // fabricate new Method*s.
642 // also does loader constraint checking
643 if (!this_oop()->is_shared()) {
644 ResourceMark rm(THREAD);
645 this_oop->vtable()->initialize_vtable(true, CHECK_false);
646 this_oop->itable()->initialize_itable(true, CHECK_false);
647 }
648 #ifdef ASSERT
649 else {
650 ResourceMark rm(THREAD);
651 this_oop->vtable()->verify(tty, true);
652 // In case itable verification is ever added.
653 // this_oop->itable()->verify(tty, true);
654 }
655 #endif
656 this_oop->set_init_state(linked);
657 if (JvmtiExport::should_post_class_prepare()) {
658 Thread *thread = THREAD;
659 assert(thread->is_Java_thread(), "thread->is_Java_thread()");
660 JvmtiExport::post_class_prepare((JavaThread *) thread, this_oop());
661 }
662 }
663 }
664 return true;
665 }
668 // Rewrite the byte codes of all of the methods of a class.
669 // The rewriter must be called exactly once. Rewriting must happen after
670 // verification but before the first method of the class is executed.
671 void InstanceKlass::rewrite_class(TRAPS) {
672 assert(is_loaded(), "must be loaded");
673 instanceKlassHandle this_oop(THREAD, this);
674 if (this_oop->is_rewritten()) {
675 assert(this_oop()->is_shared(), "rewriting an unshared class?");
676 return;
677 }
678 Rewriter::rewrite(this_oop, CHECK);
679 this_oop->set_rewritten();
680 }
682 // Now relocate and link method entry points after class is rewritten.
683 // This is outside is_rewritten flag. In case of an exception, it can be
684 // executed more than once.
685 void InstanceKlass::link_methods(TRAPS) {
686 int len = methods()->length();
687 for (int i = len-1; i >= 0; i--) {
688 methodHandle m(THREAD, methods()->at(i));
690 // Set up method entry points for compiler and interpreter .
691 m->link_method(m, CHECK);
693 // This is for JVMTI and unrelated to relocator but the last thing we do
694 #ifdef ASSERT
695 if (StressMethodComparator) {
696 ResourceMark rm(THREAD);
697 static int nmc = 0;
698 for (int j = i; j >= 0 && j >= i-4; j--) {
699 if ((++nmc % 1000) == 0) tty->print_cr("Have run MethodComparator %d times...", nmc);
700 bool z = MethodComparator::methods_EMCP(m(),
701 methods()->at(j));
702 if (j == i && !z) {
703 tty->print("MethodComparator FAIL: "); m->print(); m->print_codes();
704 assert(z, "method must compare equal to itself");
705 }
706 }
707 }
708 #endif //ASSERT
709 }
710 }
713 void InstanceKlass::initialize_impl(instanceKlassHandle this_oop, TRAPS) {
714 // Make sure klass is linked (verified) before initialization
715 // A class could already be verified, since it has been reflected upon.
716 this_oop->link_class(CHECK);
718 DTRACE_CLASSINIT_PROBE(required, InstanceKlass::cast(this_oop()), -1);
720 bool wait = false;
722 // refer to the JVM book page 47 for description of steps
723 // Step 1
724 {
725 volatile oop init_lock = this_oop->init_lock();
726 ObjectLocker ol(init_lock, THREAD);
728 Thread *self = THREAD; // it's passed the current thread
730 // Step 2
731 // If we were to use wait() instead of waitInterruptibly() then
732 // we might end up throwing IE from link/symbol resolution sites
733 // that aren't expected to throw. This would wreak havoc. See 6320309.
734 while(this_oop->is_being_initialized() && !this_oop->is_reentrant_initialization(self)) {
735 wait = true;
736 ol.waitUninterruptibly(CHECK);
737 }
739 // Step 3
740 if (this_oop->is_being_initialized() && this_oop->is_reentrant_initialization(self)) {
741 DTRACE_CLASSINIT_PROBE_WAIT(recursive, InstanceKlass::cast(this_oop()), -1,wait);
742 return;
743 }
745 // Step 4
746 if (this_oop->is_initialized()) {
747 DTRACE_CLASSINIT_PROBE_WAIT(concurrent, InstanceKlass::cast(this_oop()), -1,wait);
748 return;
749 }
751 // Step 5
752 if (this_oop->is_in_error_state()) {
753 DTRACE_CLASSINIT_PROBE_WAIT(erroneous, InstanceKlass::cast(this_oop()), -1,wait);
754 ResourceMark rm(THREAD);
755 const char* desc = "Could not initialize class ";
756 const char* className = this_oop->external_name();
757 size_t msglen = strlen(desc) + strlen(className) + 1;
758 char* message = NEW_RESOURCE_ARRAY(char, msglen);
759 if (NULL == message) {
760 // Out of memory: can't create detailed error message
761 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), className);
762 } else {
763 jio_snprintf(message, msglen, "%s%s", desc, className);
764 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), message);
765 }
766 }
768 // Step 6
769 this_oop->set_init_state(being_initialized);
770 this_oop->set_init_thread(self);
771 }
773 // Step 7
774 Klass* super_klass = this_oop->super();
775 if (super_klass != NULL && !this_oop->is_interface() && super_klass->should_be_initialized()) {
776 super_klass->initialize(THREAD);
778 if (HAS_PENDING_EXCEPTION) {
779 Handle e(THREAD, PENDING_EXCEPTION);
780 CLEAR_PENDING_EXCEPTION;
781 {
782 EXCEPTION_MARK;
783 this_oop->set_initialization_state_and_notify(initialization_error, THREAD); // Locks object, set state, and notify all waiting threads
784 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, superclass initialization error is thrown below
785 }
786 DTRACE_CLASSINIT_PROBE_WAIT(super__failed, InstanceKlass::cast(this_oop()), -1,wait);
787 THROW_OOP(e());
788 }
789 }
791 if (this_oop->has_default_methods()) {
792 // Step 7.5: initialize any interfaces which have default methods
793 for (int i = 0; i < this_oop->local_interfaces()->length(); ++i) {
794 Klass* iface = this_oop->local_interfaces()->at(i);
795 InstanceKlass* ik = InstanceKlass::cast(iface);
796 if (ik->has_default_methods() && ik->should_be_initialized()) {
797 ik->initialize(THREAD);
799 if (HAS_PENDING_EXCEPTION) {
800 Handle e(THREAD, PENDING_EXCEPTION);
801 CLEAR_PENDING_EXCEPTION;
802 {
803 EXCEPTION_MARK;
804 // Locks object, set state, and notify all waiting threads
805 this_oop->set_initialization_state_and_notify(
806 initialization_error, THREAD);
808 // ignore any exception thrown, superclass initialization error is
809 // thrown below
810 CLEAR_PENDING_EXCEPTION;
811 }
812 DTRACE_CLASSINIT_PROBE_WAIT(
813 super__failed, InstanceKlass::cast(this_oop()), -1, wait);
814 THROW_OOP(e());
815 }
816 }
817 }
818 }
820 // Step 8
821 {
822 assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl");
823 JavaThread* jt = (JavaThread*)THREAD;
824 DTRACE_CLASSINIT_PROBE_WAIT(clinit, InstanceKlass::cast(this_oop()), -1,wait);
825 // Timer includes any side effects of class initialization (resolution,
826 // etc), but not recursive entry into call_class_initializer().
827 PerfClassTraceTime timer(ClassLoader::perf_class_init_time(),
828 ClassLoader::perf_class_init_selftime(),
829 ClassLoader::perf_classes_inited(),
830 jt->get_thread_stat()->perf_recursion_counts_addr(),
831 jt->get_thread_stat()->perf_timers_addr(),
832 PerfClassTraceTime::CLASS_CLINIT);
833 this_oop->call_class_initializer(THREAD);
834 }
836 // Step 9
837 if (!HAS_PENDING_EXCEPTION) {
838 this_oop->set_initialization_state_and_notify(fully_initialized, CHECK);
839 { ResourceMark rm(THREAD);
840 debug_only(this_oop->vtable()->verify(tty, true);)
841 }
842 }
843 else {
844 // Step 10 and 11
845 Handle e(THREAD, PENDING_EXCEPTION);
846 CLEAR_PENDING_EXCEPTION;
847 {
848 EXCEPTION_MARK;
849 this_oop->set_initialization_state_and_notify(initialization_error, THREAD);
850 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, class initialization error is thrown below
851 }
852 DTRACE_CLASSINIT_PROBE_WAIT(error, InstanceKlass::cast(this_oop()), -1,wait);
853 if (e->is_a(SystemDictionary::Error_klass())) {
854 THROW_OOP(e());
855 } else {
856 JavaCallArguments args(e);
857 THROW_ARG(vmSymbols::java_lang_ExceptionInInitializerError(),
858 vmSymbols::throwable_void_signature(),
859 &args);
860 }
861 }
862 DTRACE_CLASSINIT_PROBE_WAIT(end, InstanceKlass::cast(this_oop()), -1,wait);
863 }
866 // Note: implementation moved to static method to expose the this pointer.
867 void InstanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) {
868 instanceKlassHandle kh(THREAD, this);
869 set_initialization_state_and_notify_impl(kh, state, CHECK);
870 }
872 void InstanceKlass::set_initialization_state_and_notify_impl(instanceKlassHandle this_oop, ClassState state, TRAPS) {
873 volatile oop init_lock = this_oop->init_lock();
874 ObjectLocker ol(init_lock, THREAD);
875 this_oop->set_init_state(state);
876 ol.notify_all(CHECK);
877 }
879 // The embedded _implementor field can only record one implementor.
880 // When there are more than one implementors, the _implementor field
881 // is set to the interface Klass* itself. Following are the possible
882 // values for the _implementor field:
883 // NULL - no implementor
884 // implementor Klass* - one implementor
885 // self - more than one implementor
886 //
887 // The _implementor field only exists for interfaces.
888 void InstanceKlass::add_implementor(Klass* k) {
889 assert(Compile_lock->owned_by_self(), "");
890 assert(is_interface(), "not interface");
891 // Filter out my subinterfaces.
892 // (Note: Interfaces are never on the subklass list.)
893 if (InstanceKlass::cast(k)->is_interface()) return;
895 // Filter out subclasses whose supers already implement me.
896 // (Note: CHA must walk subclasses of direct implementors
897 // in order to locate indirect implementors.)
898 Klass* sk = InstanceKlass::cast(k)->super();
899 if (sk != NULL && InstanceKlass::cast(sk)->implements_interface(this))
900 // We only need to check one immediate superclass, since the
901 // implements_interface query looks at transitive_interfaces.
902 // Any supers of the super have the same (or fewer) transitive_interfaces.
903 return;
905 Klass* ik = implementor();
906 if (ik == NULL) {
907 set_implementor(k);
908 } else if (ik != this) {
909 // There is already an implementor. Use itself as an indicator of
910 // more than one implementors.
911 set_implementor(this);
912 }
914 // The implementor also implements the transitive_interfaces
915 for (int index = 0; index < local_interfaces()->length(); index++) {
916 InstanceKlass::cast(local_interfaces()->at(index))->add_implementor(k);
917 }
918 }
920 void InstanceKlass::init_implementor() {
921 if (is_interface()) {
922 set_implementor(NULL);
923 }
924 }
927 void InstanceKlass::process_interfaces(Thread *thread) {
928 // link this class into the implementors list of every interface it implements
929 Klass* this_as_klass_oop = this;
930 for (int i = local_interfaces()->length() - 1; i >= 0; i--) {
931 assert(local_interfaces()->at(i)->is_klass(), "must be a klass");
932 InstanceKlass* interf = InstanceKlass::cast(local_interfaces()->at(i));
933 assert(interf->is_interface(), "expected interface");
934 interf->add_implementor(this_as_klass_oop);
935 }
936 }
938 bool InstanceKlass::can_be_primary_super_slow() const {
939 if (is_interface())
940 return false;
941 else
942 return Klass::can_be_primary_super_slow();
943 }
945 GrowableArray<Klass*>* InstanceKlass::compute_secondary_supers(int num_extra_slots) {
946 // The secondaries are the implemented interfaces.
947 InstanceKlass* ik = InstanceKlass::cast(this);
948 Array<Klass*>* interfaces = ik->transitive_interfaces();
949 int num_secondaries = num_extra_slots + interfaces->length();
950 if (num_secondaries == 0) {
951 // Must share this for correct bootstrapping!
952 set_secondary_supers(Universe::the_empty_klass_array());
953 return NULL;
954 } else if (num_extra_slots == 0) {
955 // The secondary super list is exactly the same as the transitive interfaces.
956 // Redefine classes has to be careful not to delete this!
957 set_secondary_supers(interfaces);
958 return NULL;
959 } else {
960 // Copy transitive interfaces to a temporary growable array to be constructed
961 // into the secondary super list with extra slots.
962 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(interfaces->length());
963 for (int i = 0; i < interfaces->length(); i++) {
964 secondaries->push(interfaces->at(i));
965 }
966 return secondaries;
967 }
968 }
970 bool InstanceKlass::compute_is_subtype_of(Klass* k) {
971 if (k->is_interface()) {
972 return implements_interface(k);
973 } else {
974 return Klass::compute_is_subtype_of(k);
975 }
976 }
978 bool InstanceKlass::implements_interface(Klass* k) const {
979 if (this == k) return true;
980 assert(k->is_interface(), "should be an interface class");
981 for (int i = 0; i < transitive_interfaces()->length(); i++) {
982 if (transitive_interfaces()->at(i) == k) {
983 return true;
984 }
985 }
986 return false;
987 }
989 objArrayOop InstanceKlass::allocate_objArray(int n, int length, TRAPS) {
990 if (length < 0) THROW_0(vmSymbols::java_lang_NegativeArraySizeException());
991 if (length > arrayOopDesc::max_array_length(T_OBJECT)) {
992 report_java_out_of_memory("Requested array size exceeds VM limit");
993 JvmtiExport::post_array_size_exhausted();
994 THROW_OOP_0(Universe::out_of_memory_error_array_size());
995 }
996 int size = objArrayOopDesc::object_size(length);
997 Klass* ak = array_klass(n, CHECK_NULL);
998 KlassHandle h_ak (THREAD, ak);
999 objArrayOop o =
1000 (objArrayOop)CollectedHeap::array_allocate(h_ak, size, length, CHECK_NULL);
1001 return o;
1002 }
1004 instanceOop InstanceKlass::register_finalizer(instanceOop i, TRAPS) {
1005 if (TraceFinalizerRegistration) {
1006 tty->print("Registered ");
1007 i->print_value_on(tty);
1008 tty->print_cr(" (" INTPTR_FORMAT ") as finalizable", (address)i);
1009 }
1010 instanceHandle h_i(THREAD, i);
1011 // Pass the handle as argument, JavaCalls::call expects oop as jobjects
1012 JavaValue result(T_VOID);
1013 JavaCallArguments args(h_i);
1014 methodHandle mh (THREAD, Universe::finalizer_register_method());
1015 JavaCalls::call(&result, mh, &args, CHECK_NULL);
1016 return h_i();
1017 }
1019 instanceOop InstanceKlass::allocate_instance(TRAPS) {
1020 bool has_finalizer_flag = has_finalizer(); // Query before possible GC
1021 int size = size_helper(); // Query before forming handle.
1023 KlassHandle h_k(THREAD, this);
1025 instanceOop i;
1027 i = (instanceOop)CollectedHeap::obj_allocate(h_k, size, CHECK_NULL);
1028 if (has_finalizer_flag && !RegisterFinalizersAtInit) {
1029 i = register_finalizer(i, CHECK_NULL);
1030 }
1031 return i;
1032 }
1034 void InstanceKlass::check_valid_for_instantiation(bool throwError, TRAPS) {
1035 if (is_interface() || is_abstract()) {
1036 ResourceMark rm(THREAD);
1037 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError()
1038 : vmSymbols::java_lang_InstantiationException(), external_name());
1039 }
1040 if (this == SystemDictionary::Class_klass()) {
1041 ResourceMark rm(THREAD);
1042 THROW_MSG(throwError ? vmSymbols::java_lang_IllegalAccessError()
1043 : vmSymbols::java_lang_IllegalAccessException(), external_name());
1044 }
1045 }
1047 Klass* InstanceKlass::array_klass_impl(bool or_null, int n, TRAPS) {
1048 instanceKlassHandle this_oop(THREAD, this);
1049 return array_klass_impl(this_oop, or_null, n, THREAD);
1050 }
1052 Klass* InstanceKlass::array_klass_impl(instanceKlassHandle this_oop, bool or_null, int n, TRAPS) {
1053 if (this_oop->array_klasses() == NULL) {
1054 if (or_null) return NULL;
1056 ResourceMark rm;
1057 JavaThread *jt = (JavaThread *)THREAD;
1058 {
1059 // Atomic creation of array_klasses
1060 MutexLocker mc(Compile_lock, THREAD); // for vtables
1061 MutexLocker ma(MultiArray_lock, THREAD);
1063 // Check if update has already taken place
1064 if (this_oop->array_klasses() == NULL) {
1065 Klass* k = ObjArrayKlass::allocate_objArray_klass(this_oop->class_loader_data(), 1, this_oop, CHECK_NULL);
1066 this_oop->set_array_klasses(k);
1067 }
1068 }
1069 }
1070 // _this will always be set at this point
1071 ObjArrayKlass* oak = (ObjArrayKlass*)this_oop->array_klasses();
1072 if (or_null) {
1073 return oak->array_klass_or_null(n);
1074 }
1075 return oak->array_klass(n, CHECK_NULL);
1076 }
1078 Klass* InstanceKlass::array_klass_impl(bool or_null, TRAPS) {
1079 return array_klass_impl(or_null, 1, THREAD);
1080 }
1082 void InstanceKlass::call_class_initializer(TRAPS) {
1083 instanceKlassHandle ik (THREAD, this);
1084 call_class_initializer_impl(ik, THREAD);
1085 }
1087 static int call_class_initializer_impl_counter = 0; // for debugging
1089 Method* InstanceKlass::class_initializer() {
1090 Method* clinit = find_method(
1091 vmSymbols::class_initializer_name(), vmSymbols::void_method_signature());
1092 if (clinit != NULL && clinit->has_valid_initializer_flags()) {
1093 return clinit;
1094 }
1095 return NULL;
1096 }
1098 void InstanceKlass::call_class_initializer_impl(instanceKlassHandle this_oop, TRAPS) {
1099 if (ReplayCompiles &&
1100 (ReplaySuppressInitializers == 1 ||
1101 ReplaySuppressInitializers >= 2 && this_oop->class_loader() != NULL)) {
1102 // Hide the existence of the initializer for the purpose of replaying the compile
1103 return;
1104 }
1106 methodHandle h_method(THREAD, this_oop->class_initializer());
1107 assert(!this_oop->is_initialized(), "we cannot initialize twice");
1108 if (TraceClassInitialization) {
1109 tty->print("%d Initializing ", call_class_initializer_impl_counter++);
1110 this_oop->name()->print_value();
1111 tty->print_cr("%s (" INTPTR_FORMAT ")", h_method() == NULL ? "(no method)" : "", (address)this_oop());
1112 }
1113 if (h_method() != NULL) {
1114 JavaCallArguments args; // No arguments
1115 JavaValue result(T_VOID);
1116 JavaCalls::call(&result, h_method, &args, CHECK); // Static call (no args)
1117 }
1118 }
1121 void InstanceKlass::mask_for(methodHandle method, int bci,
1122 InterpreterOopMap* entry_for) {
1123 // Dirty read, then double-check under a lock.
1124 if (_oop_map_cache == NULL) {
1125 // Otherwise, allocate a new one.
1126 MutexLocker x(OopMapCacheAlloc_lock);
1127 // First time use. Allocate a cache in C heap
1128 if (_oop_map_cache == NULL) {
1129 _oop_map_cache = new OopMapCache();
1130 }
1131 }
1132 // _oop_map_cache is constant after init; lookup below does is own locking.
1133 _oop_map_cache->lookup(method, bci, entry_for);
1134 }
1137 bool InstanceKlass::find_local_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1138 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1139 Symbol* f_name = fs.name();
1140 Symbol* f_sig = fs.signature();
1141 if (f_name == name && f_sig == sig) {
1142 fd->initialize(const_cast<InstanceKlass*>(this), fs.index());
1143 return true;
1144 }
1145 }
1146 return false;
1147 }
1150 Klass* InstanceKlass::find_interface_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1151 const int n = local_interfaces()->length();
1152 for (int i = 0; i < n; i++) {
1153 Klass* intf1 = local_interfaces()->at(i);
1154 assert(intf1->is_interface(), "just checking type");
1155 // search for field in current interface
1156 if (InstanceKlass::cast(intf1)->find_local_field(name, sig, fd)) {
1157 assert(fd->is_static(), "interface field must be static");
1158 return intf1;
1159 }
1160 // search for field in direct superinterfaces
1161 Klass* intf2 = InstanceKlass::cast(intf1)->find_interface_field(name, sig, fd);
1162 if (intf2 != NULL) return intf2;
1163 }
1164 // otherwise field lookup fails
1165 return NULL;
1166 }
1169 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1170 // search order according to newest JVM spec (5.4.3.2, p.167).
1171 // 1) search for field in current klass
1172 if (find_local_field(name, sig, fd)) {
1173 return const_cast<InstanceKlass*>(this);
1174 }
1175 // 2) search for field recursively in direct superinterfaces
1176 { Klass* intf = find_interface_field(name, sig, fd);
1177 if (intf != NULL) return intf;
1178 }
1179 // 3) apply field lookup recursively if superclass exists
1180 { Klass* supr = super();
1181 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, fd);
1182 }
1183 // 4) otherwise field lookup fails
1184 return NULL;
1185 }
1188 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, bool is_static, fieldDescriptor* fd) const {
1189 // search order according to newest JVM spec (5.4.3.2, p.167).
1190 // 1) search for field in current klass
1191 if (find_local_field(name, sig, fd)) {
1192 if (fd->is_static() == is_static) return const_cast<InstanceKlass*>(this);
1193 }
1194 // 2) search for field recursively in direct superinterfaces
1195 if (is_static) {
1196 Klass* intf = find_interface_field(name, sig, fd);
1197 if (intf != NULL) return intf;
1198 }
1199 // 3) apply field lookup recursively if superclass exists
1200 { Klass* supr = super();
1201 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, is_static, fd);
1202 }
1203 // 4) otherwise field lookup fails
1204 return NULL;
1205 }
1208 bool InstanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
1209 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1210 if (fs.offset() == offset) {
1211 fd->initialize(const_cast<InstanceKlass*>(this), fs.index());
1212 if (fd->is_static() == is_static) return true;
1213 }
1214 }
1215 return false;
1216 }
1219 bool InstanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
1220 Klass* klass = const_cast<InstanceKlass*>(this);
1221 while (klass != NULL) {
1222 if (InstanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) {
1223 return true;
1224 }
1225 klass = klass->super();
1226 }
1227 return false;
1228 }
1231 void InstanceKlass::methods_do(void f(Method* method)) {
1232 int len = methods()->length();
1233 for (int index = 0; index < len; index++) {
1234 Method* m = methods()->at(index);
1235 assert(m->is_method(), "must be method");
1236 f(m);
1237 }
1238 }
1241 void InstanceKlass::do_local_static_fields(FieldClosure* cl) {
1242 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1243 if (fs.access_flags().is_static()) {
1244 fieldDescriptor fd;
1245 fd.initialize(this, fs.index());
1246 cl->do_field(&fd);
1247 }
1248 }
1249 }
1252 void InstanceKlass::do_local_static_fields(void f(fieldDescriptor*, TRAPS), TRAPS) {
1253 instanceKlassHandle h_this(THREAD, this);
1254 do_local_static_fields_impl(h_this, f, CHECK);
1255 }
1258 void InstanceKlass::do_local_static_fields_impl(instanceKlassHandle this_oop, void f(fieldDescriptor* fd, TRAPS), TRAPS) {
1259 for (JavaFieldStream fs(this_oop()); !fs.done(); fs.next()) {
1260 if (fs.access_flags().is_static()) {
1261 fieldDescriptor fd;
1262 fd.initialize(this_oop(), fs.index());
1263 f(&fd, CHECK);
1264 }
1265 }
1266 }
1269 static int compare_fields_by_offset(int* a, int* b) {
1270 return a[0] - b[0];
1271 }
1273 void InstanceKlass::do_nonstatic_fields(FieldClosure* cl) {
1274 InstanceKlass* super = superklass();
1275 if (super != NULL) {
1276 super->do_nonstatic_fields(cl);
1277 }
1278 fieldDescriptor fd;
1279 int length = java_fields_count();
1280 // In DebugInfo nonstatic fields are sorted by offset.
1281 int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1), mtClass);
1282 int j = 0;
1283 for (int i = 0; i < length; i += 1) {
1284 fd.initialize(this, i);
1285 if (!fd.is_static()) {
1286 fields_sorted[j + 0] = fd.offset();
1287 fields_sorted[j + 1] = i;
1288 j += 2;
1289 }
1290 }
1291 if (j > 0) {
1292 length = j;
1293 // _sort_Fn is defined in growableArray.hpp.
1294 qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset);
1295 for (int i = 0; i < length; i += 2) {
1296 fd.initialize(this, fields_sorted[i + 1]);
1297 assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields");
1298 cl->do_field(&fd);
1299 }
1300 }
1301 FREE_C_HEAP_ARRAY(int, fields_sorted, mtClass);
1302 }
1305 void InstanceKlass::array_klasses_do(void f(Klass* k, TRAPS), TRAPS) {
1306 if (array_klasses() != NULL)
1307 ArrayKlass::cast(array_klasses())->array_klasses_do(f, THREAD);
1308 }
1310 void InstanceKlass::array_klasses_do(void f(Klass* k)) {
1311 if (array_klasses() != NULL)
1312 ArrayKlass::cast(array_klasses())->array_klasses_do(f);
1313 }
1316 void InstanceKlass::with_array_klasses_do(void f(Klass* k)) {
1317 f(this);
1318 array_klasses_do(f);
1319 }
1321 #ifdef ASSERT
1322 static int linear_search(Array<Method*>* methods, Symbol* name, Symbol* signature) {
1323 int len = methods->length();
1324 for (int index = 0; index < len; index++) {
1325 Method* m = methods->at(index);
1326 assert(m->is_method(), "must be method");
1327 if (m->signature() == signature && m->name() == name) {
1328 return index;
1329 }
1330 }
1331 return -1;
1332 }
1333 #endif
1335 static int binary_search(Array<Method*>* methods, Symbol* name) {
1336 int len = methods->length();
1337 // methods are sorted, so do binary search
1338 int l = 0;
1339 int h = len - 1;
1340 while (l <= h) {
1341 int mid = (l + h) >> 1;
1342 Method* m = methods->at(mid);
1343 assert(m->is_method(), "must be method");
1344 int res = m->name()->fast_compare(name);
1345 if (res == 0) {
1346 return mid;
1347 } else if (res < 0) {
1348 l = mid + 1;
1349 } else {
1350 h = mid - 1;
1351 }
1352 }
1353 return -1;
1354 }
1356 Method* InstanceKlass::find_method(Symbol* name, Symbol* signature) const {
1357 return InstanceKlass::find_method(methods(), name, signature);
1358 }
1360 Method* InstanceKlass::find_method(
1361 Array<Method*>* methods, Symbol* name, Symbol* signature) {
1362 int hit = binary_search(methods, name);
1363 if (hit != -1) {
1364 Method* m = methods->at(hit);
1365 // Do linear search to find matching signature. First, quick check
1366 // for common case
1367 if (m->signature() == signature) return m;
1368 // search downwards through overloaded methods
1369 int i;
1370 for (i = hit - 1; i >= 0; --i) {
1371 Method* m = methods->at(i);
1372 assert(m->is_method(), "must be method");
1373 if (m->name() != name) break;
1374 if (m->signature() == signature) return m;
1375 }
1376 // search upwards
1377 for (i = hit + 1; i < methods->length(); ++i) {
1378 Method* m = methods->at(i);
1379 assert(m->is_method(), "must be method");
1380 if (m->name() != name) break;
1381 if (m->signature() == signature) return m;
1382 }
1383 // not found
1384 #ifdef ASSERT
1385 int index = linear_search(methods, name, signature);
1386 assert(index == -1, err_msg("binary search should have found entry %d", index));
1387 #endif
1388 }
1389 return NULL;
1390 }
1392 int InstanceKlass::find_method_by_name(Symbol* name, int* end) {
1393 return find_method_by_name(methods(), name, end);
1394 }
1396 int InstanceKlass::find_method_by_name(
1397 Array<Method*>* methods, Symbol* name, int* end_ptr) {
1398 assert(end_ptr != NULL, "just checking");
1399 int start = binary_search(methods, name);
1400 int end = start + 1;
1401 if (start != -1) {
1402 while (start - 1 >= 0 && (methods->at(start - 1))->name() == name) --start;
1403 while (end < methods->length() && (methods->at(end))->name() == name) ++end;
1404 *end_ptr = end;
1405 return start;
1406 }
1407 return -1;
1408 }
1410 Method* InstanceKlass::uncached_lookup_method(Symbol* name, Symbol* signature) const {
1411 Klass* klass = const_cast<InstanceKlass*>(this);
1412 while (klass != NULL) {
1413 Method* method = InstanceKlass::cast(klass)->find_method(name, signature);
1414 if (method != NULL) return method;
1415 klass = InstanceKlass::cast(klass)->super();
1416 }
1417 return NULL;
1418 }
1420 // lookup a method in all the interfaces that this class implements
1421 Method* InstanceKlass::lookup_method_in_all_interfaces(Symbol* name,
1422 Symbol* signature) const {
1423 Array<Klass*>* all_ifs = transitive_interfaces();
1424 int num_ifs = all_ifs->length();
1425 InstanceKlass *ik = NULL;
1426 for (int i = 0; i < num_ifs; i++) {
1427 ik = InstanceKlass::cast(all_ifs->at(i));
1428 Method* m = ik->lookup_method(name, signature);
1429 if (m != NULL) {
1430 return m;
1431 }
1432 }
1433 return NULL;
1434 }
1436 /* jni_id_for_impl for jfieldIds only */
1437 JNIid* InstanceKlass::jni_id_for_impl(instanceKlassHandle this_oop, int offset) {
1438 MutexLocker ml(JfieldIdCreation_lock);
1439 // Retry lookup after we got the lock
1440 JNIid* probe = this_oop->jni_ids() == NULL ? NULL : this_oop->jni_ids()->find(offset);
1441 if (probe == NULL) {
1442 // Slow case, allocate new static field identifier
1443 probe = new JNIid(this_oop(), offset, this_oop->jni_ids());
1444 this_oop->set_jni_ids(probe);
1445 }
1446 return probe;
1447 }
1450 /* jni_id_for for jfieldIds only */
1451 JNIid* InstanceKlass::jni_id_for(int offset) {
1452 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset);
1453 if (probe == NULL) {
1454 probe = jni_id_for_impl(this, offset);
1455 }
1456 return probe;
1457 }
1459 u2 InstanceKlass::enclosing_method_data(int offset) {
1460 Array<jushort>* inner_class_list = inner_classes();
1461 if (inner_class_list == NULL) {
1462 return 0;
1463 }
1464 int length = inner_class_list->length();
1465 if (length % inner_class_next_offset == 0) {
1466 return 0;
1467 } else {
1468 int index = length - enclosing_method_attribute_size;
1469 assert(offset < enclosing_method_attribute_size, "invalid offset");
1470 return inner_class_list->at(index + offset);
1471 }
1472 }
1474 void InstanceKlass::set_enclosing_method_indices(u2 class_index,
1475 u2 method_index) {
1476 Array<jushort>* inner_class_list = inner_classes();
1477 assert (inner_class_list != NULL, "_inner_classes list is not set up");
1478 int length = inner_class_list->length();
1479 if (length % inner_class_next_offset == enclosing_method_attribute_size) {
1480 int index = length - enclosing_method_attribute_size;
1481 inner_class_list->at_put(
1482 index + enclosing_method_class_index_offset, class_index);
1483 inner_class_list->at_put(
1484 index + enclosing_method_method_index_offset, method_index);
1485 }
1486 }
1488 // Lookup or create a jmethodID.
1489 // This code is called by the VMThread and JavaThreads so the
1490 // locking has to be done very carefully to avoid deadlocks
1491 // and/or other cache consistency problems.
1492 //
1493 jmethodID InstanceKlass::get_jmethod_id(instanceKlassHandle ik_h, methodHandle method_h) {
1494 size_t idnum = (size_t)method_h->method_idnum();
1495 jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire();
1496 size_t length = 0;
1497 jmethodID id = NULL;
1499 // We use a double-check locking idiom here because this cache is
1500 // performance sensitive. In the normal system, this cache only
1501 // transitions from NULL to non-NULL which is safe because we use
1502 // release_set_methods_jmethod_ids() to advertise the new cache.
1503 // A partially constructed cache should never be seen by a racing
1504 // thread. We also use release_store_ptr() to save a new jmethodID
1505 // in the cache so a partially constructed jmethodID should never be
1506 // seen either. Cache reads of existing jmethodIDs proceed without a
1507 // lock, but cache writes of a new jmethodID requires uniqueness and
1508 // creation of the cache itself requires no leaks so a lock is
1509 // generally acquired in those two cases.
1510 //
1511 // If the RedefineClasses() API has been used, then this cache can
1512 // grow and we'll have transitions from non-NULL to bigger non-NULL.
1513 // Cache creation requires no leaks and we require safety between all
1514 // cache accesses and freeing of the old cache so a lock is generally
1515 // acquired when the RedefineClasses() API has been used.
1517 if (jmeths != NULL) {
1518 // the cache already exists
1519 if (!ik_h->idnum_can_increment()) {
1520 // the cache can't grow so we can just get the current values
1521 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
1522 } else {
1523 // cache can grow so we have to be more careful
1524 if (Threads::number_of_threads() == 0 ||
1525 SafepointSynchronize::is_at_safepoint()) {
1526 // we're single threaded or at a safepoint - no locking needed
1527 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
1528 } else {
1529 MutexLocker ml(JmethodIdCreation_lock);
1530 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
1531 }
1532 }
1533 }
1534 // implied else:
1535 // we need to allocate a cache so default length and id values are good
1537 if (jmeths == NULL || // no cache yet
1538 length <= idnum || // cache is too short
1539 id == NULL) { // cache doesn't contain entry
1541 // This function can be called by the VMThread so we have to do all
1542 // things that might block on a safepoint before grabbing the lock.
1543 // Otherwise, we can deadlock with the VMThread or have a cache
1544 // consistency issue. These vars keep track of what we might have
1545 // to free after the lock is dropped.
1546 jmethodID to_dealloc_id = NULL;
1547 jmethodID* to_dealloc_jmeths = NULL;
1549 // may not allocate new_jmeths or use it if we allocate it
1550 jmethodID* new_jmeths = NULL;
1551 if (length <= idnum) {
1552 // allocate a new cache that might be used
1553 size_t size = MAX2(idnum+1, (size_t)ik_h->idnum_allocated_count());
1554 new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1, mtClass);
1555 memset(new_jmeths, 0, (size+1)*sizeof(jmethodID));
1556 // cache size is stored in element[0], other elements offset by one
1557 new_jmeths[0] = (jmethodID)size;
1558 }
1560 // allocate a new jmethodID that might be used
1561 jmethodID new_id = NULL;
1562 if (method_h->is_old() && !method_h->is_obsolete()) {
1563 // The method passed in is old (but not obsolete), we need to use the current version
1564 Method* current_method = ik_h->method_with_idnum((int)idnum);
1565 assert(current_method != NULL, "old and but not obsolete, so should exist");
1566 new_id = Method::make_jmethod_id(ik_h->class_loader_data(), current_method);
1567 } else {
1568 // It is the current version of the method or an obsolete method,
1569 // use the version passed in
1570 new_id = Method::make_jmethod_id(ik_h->class_loader_data(), method_h());
1571 }
1573 if (Threads::number_of_threads() == 0 ||
1574 SafepointSynchronize::is_at_safepoint()) {
1575 // we're single threaded or at a safepoint - no locking needed
1576 id = get_jmethod_id_fetch_or_update(ik_h, idnum, new_id, new_jmeths,
1577 &to_dealloc_id, &to_dealloc_jmeths);
1578 } else {
1579 MutexLocker ml(JmethodIdCreation_lock);
1580 id = get_jmethod_id_fetch_or_update(ik_h, idnum, new_id, new_jmeths,
1581 &to_dealloc_id, &to_dealloc_jmeths);
1582 }
1584 // The lock has been dropped so we can free resources.
1585 // Free up either the old cache or the new cache if we allocated one.
1586 if (to_dealloc_jmeths != NULL) {
1587 FreeHeap(to_dealloc_jmeths);
1588 }
1589 // free up the new ID since it wasn't needed
1590 if (to_dealloc_id != NULL) {
1591 Method::destroy_jmethod_id(ik_h->class_loader_data(), to_dealloc_id);
1592 }
1593 }
1594 return id;
1595 }
1598 // Common code to fetch the jmethodID from the cache or update the
1599 // cache with the new jmethodID. This function should never do anything
1600 // that causes the caller to go to a safepoint or we can deadlock with
1601 // the VMThread or have cache consistency issues.
1602 //
1603 jmethodID InstanceKlass::get_jmethod_id_fetch_or_update(
1604 instanceKlassHandle ik_h, size_t idnum, jmethodID new_id,
1605 jmethodID* new_jmeths, jmethodID* to_dealloc_id_p,
1606 jmethodID** to_dealloc_jmeths_p) {
1607 assert(new_id != NULL, "sanity check");
1608 assert(to_dealloc_id_p != NULL, "sanity check");
1609 assert(to_dealloc_jmeths_p != NULL, "sanity check");
1610 assert(Threads::number_of_threads() == 0 ||
1611 SafepointSynchronize::is_at_safepoint() ||
1612 JmethodIdCreation_lock->owned_by_self(), "sanity check");
1614 // reacquire the cache - we are locked, single threaded or at a safepoint
1615 jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire();
1616 jmethodID id = NULL;
1617 size_t length = 0;
1619 if (jmeths == NULL || // no cache yet
1620 (length = (size_t)jmeths[0]) <= idnum) { // cache is too short
1621 if (jmeths != NULL) {
1622 // copy any existing entries from the old cache
1623 for (size_t index = 0; index < length; index++) {
1624 new_jmeths[index+1] = jmeths[index+1];
1625 }
1626 *to_dealloc_jmeths_p = jmeths; // save old cache for later delete
1627 }
1628 ik_h->release_set_methods_jmethod_ids(jmeths = new_jmeths);
1629 } else {
1630 // fetch jmethodID (if any) from the existing cache
1631 id = jmeths[idnum+1];
1632 *to_dealloc_jmeths_p = new_jmeths; // save new cache for later delete
1633 }
1634 if (id == NULL) {
1635 // No matching jmethodID in the existing cache or we have a new
1636 // cache or we just grew the cache. This cache write is done here
1637 // by the first thread to win the foot race because a jmethodID
1638 // needs to be unique once it is generally available.
1639 id = new_id;
1641 // The jmethodID cache can be read while unlocked so we have to
1642 // make sure the new jmethodID is complete before installing it
1643 // in the cache.
1644 OrderAccess::release_store_ptr(&jmeths[idnum+1], id);
1645 } else {
1646 *to_dealloc_id_p = new_id; // save new id for later delete
1647 }
1648 return id;
1649 }
1652 // Common code to get the jmethodID cache length and the jmethodID
1653 // value at index idnum if there is one.
1654 //
1655 void InstanceKlass::get_jmethod_id_length_value(jmethodID* cache,
1656 size_t idnum, size_t *length_p, jmethodID* id_p) {
1657 assert(cache != NULL, "sanity check");
1658 assert(length_p != NULL, "sanity check");
1659 assert(id_p != NULL, "sanity check");
1661 // cache size is stored in element[0], other elements offset by one
1662 *length_p = (size_t)cache[0];
1663 if (*length_p <= idnum) { // cache is too short
1664 *id_p = NULL;
1665 } else {
1666 *id_p = cache[idnum+1]; // fetch jmethodID (if any)
1667 }
1668 }
1671 // Lookup a jmethodID, NULL if not found. Do no blocking, no allocations, no handles
1672 jmethodID InstanceKlass::jmethod_id_or_null(Method* method) {
1673 size_t idnum = (size_t)method->method_idnum();
1674 jmethodID* jmeths = methods_jmethod_ids_acquire();
1675 size_t length; // length assigned as debugging crumb
1676 jmethodID id = NULL;
1677 if (jmeths != NULL && // If there is a cache
1678 (length = (size_t)jmeths[0]) > idnum) { // and if it is long enough,
1679 id = jmeths[idnum+1]; // Look up the id (may be NULL)
1680 }
1681 return id;
1682 }
1685 // Cache an itable index
1686 void InstanceKlass::set_cached_itable_index(size_t idnum, int index) {
1687 int* indices = methods_cached_itable_indices_acquire();
1688 int* to_dealloc_indices = NULL;
1690 // We use a double-check locking idiom here because this cache is
1691 // performance sensitive. In the normal system, this cache only
1692 // transitions from NULL to non-NULL which is safe because we use
1693 // release_set_methods_cached_itable_indices() to advertise the
1694 // new cache. A partially constructed cache should never be seen
1695 // by a racing thread. Cache reads and writes proceed without a
1696 // lock, but creation of the cache itself requires no leaks so a
1697 // lock is generally acquired in that case.
1698 //
1699 // If the RedefineClasses() API has been used, then this cache can
1700 // grow and we'll have transitions from non-NULL to bigger non-NULL.
1701 // Cache creation requires no leaks and we require safety between all
1702 // cache accesses and freeing of the old cache so a lock is generally
1703 // acquired when the RedefineClasses() API has been used.
1705 if (indices == NULL || idnum_can_increment()) {
1706 // we need a cache or the cache can grow
1707 MutexLocker ml(JNICachedItableIndex_lock);
1708 // reacquire the cache to see if another thread already did the work
1709 indices = methods_cached_itable_indices_acquire();
1710 size_t length = 0;
1711 // cache size is stored in element[0], other elements offset by one
1712 if (indices == NULL || (length = (size_t)indices[0]) <= idnum) {
1713 size_t size = MAX2(idnum+1, (size_t)idnum_allocated_count());
1714 int* new_indices = NEW_C_HEAP_ARRAY(int, size+1, mtClass);
1715 new_indices[0] = (int)size;
1716 // copy any existing entries
1717 size_t i;
1718 for (i = 0; i < length; i++) {
1719 new_indices[i+1] = indices[i+1];
1720 }
1721 // Set all the rest to -1
1722 for (i = length; i < size; i++) {
1723 new_indices[i+1] = -1;
1724 }
1725 if (indices != NULL) {
1726 // We have an old cache to delete so save it for after we
1727 // drop the lock.
1728 to_dealloc_indices = indices;
1729 }
1730 release_set_methods_cached_itable_indices(indices = new_indices);
1731 }
1733 if (idnum_can_increment()) {
1734 // this cache can grow so we have to write to it safely
1735 indices[idnum+1] = index;
1736 }
1737 } else {
1738 CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops());
1739 }
1741 if (!idnum_can_increment()) {
1742 // The cache cannot grow and this JNI itable index value does not
1743 // have to be unique like a jmethodID. If there is a race to set it,
1744 // it doesn't matter.
1745 indices[idnum+1] = index;
1746 }
1748 if (to_dealloc_indices != NULL) {
1749 // we allocated a new cache so free the old one
1750 FreeHeap(to_dealloc_indices);
1751 }
1752 }
1755 // Retrieve a cached itable index
1756 int InstanceKlass::cached_itable_index(size_t idnum) {
1757 int* indices = methods_cached_itable_indices_acquire();
1758 if (indices != NULL && ((size_t)indices[0]) > idnum) {
1759 // indices exist and are long enough, retrieve possible cached
1760 return indices[idnum+1];
1761 }
1762 return -1;
1763 }
1766 //
1767 // Walk the list of dependent nmethods searching for nmethods which
1768 // are dependent on the changes that were passed in and mark them for
1769 // deoptimization. Returns the number of nmethods found.
1770 //
1771 int InstanceKlass::mark_dependent_nmethods(DepChange& changes) {
1772 assert_locked_or_safepoint(CodeCache_lock);
1773 int found = 0;
1774 nmethodBucket* b = _dependencies;
1775 while (b != NULL) {
1776 nmethod* nm = b->get_nmethod();
1777 // since dependencies aren't removed until an nmethod becomes a zombie,
1778 // the dependency list may contain nmethods which aren't alive.
1779 if (nm->is_alive() && !nm->is_marked_for_deoptimization() && nm->check_dependency_on(changes)) {
1780 if (TraceDependencies) {
1781 ResourceMark rm;
1782 tty->print_cr("Marked for deoptimization");
1783 tty->print_cr(" context = %s", this->external_name());
1784 changes.print();
1785 nm->print();
1786 nm->print_dependencies();
1787 }
1788 nm->mark_for_deoptimization();
1789 found++;
1790 }
1791 b = b->next();
1792 }
1793 return found;
1794 }
1797 //
1798 // Add an nmethodBucket to the list of dependencies for this nmethod.
1799 // It's possible that an nmethod has multiple dependencies on this klass
1800 // so a count is kept for each bucket to guarantee that creation and
1801 // deletion of dependencies is consistent.
1802 //
1803 void InstanceKlass::add_dependent_nmethod(nmethod* nm) {
1804 assert_locked_or_safepoint(CodeCache_lock);
1805 nmethodBucket* b = _dependencies;
1806 nmethodBucket* last = NULL;
1807 while (b != NULL) {
1808 if (nm == b->get_nmethod()) {
1809 b->increment();
1810 return;
1811 }
1812 b = b->next();
1813 }
1814 _dependencies = new nmethodBucket(nm, _dependencies);
1815 }
1818 //
1819 // Decrement count of the nmethod in the dependency list and remove
1820 // the bucket competely when the count goes to 0. This method must
1821 // find a corresponding bucket otherwise there's a bug in the
1822 // recording of dependecies.
1823 //
1824 void InstanceKlass::remove_dependent_nmethod(nmethod* nm) {
1825 assert_locked_or_safepoint(CodeCache_lock);
1826 nmethodBucket* b = _dependencies;
1827 nmethodBucket* last = NULL;
1828 while (b != NULL) {
1829 if (nm == b->get_nmethod()) {
1830 if (b->decrement() == 0) {
1831 if (last == NULL) {
1832 _dependencies = b->next();
1833 } else {
1834 last->set_next(b->next());
1835 }
1836 delete b;
1837 }
1838 return;
1839 }
1840 last = b;
1841 b = b->next();
1842 }
1843 #ifdef ASSERT
1844 tty->print_cr("### %s can't find dependent nmethod:", this->external_name());
1845 nm->print();
1846 #endif // ASSERT
1847 ShouldNotReachHere();
1848 }
1851 #ifndef PRODUCT
1852 void InstanceKlass::print_dependent_nmethods(bool verbose) {
1853 nmethodBucket* b = _dependencies;
1854 int idx = 0;
1855 while (b != NULL) {
1856 nmethod* nm = b->get_nmethod();
1857 tty->print("[%d] count=%d { ", idx++, b->count());
1858 if (!verbose) {
1859 nm->print_on(tty, "nmethod");
1860 tty->print_cr(" } ");
1861 } else {
1862 nm->print();
1863 nm->print_dependencies();
1864 tty->print_cr("--- } ");
1865 }
1866 b = b->next();
1867 }
1868 }
1871 bool InstanceKlass::is_dependent_nmethod(nmethod* nm) {
1872 nmethodBucket* b = _dependencies;
1873 while (b != NULL) {
1874 if (nm == b->get_nmethod()) {
1875 return true;
1876 }
1877 b = b->next();
1878 }
1879 return false;
1880 }
1881 #endif //PRODUCT
1884 // Garbage collection
1886 void InstanceKlass::oops_do(OopClosure* cl) {
1887 Klass::oops_do(cl);
1889 cl->do_oop(adr_protection_domain());
1890 cl->do_oop(adr_signers());
1891 cl->do_oop(adr_init_lock());
1893 // Don't walk the arrays since they are walked from the ClassLoaderData objects.
1894 }
1896 #ifdef ASSERT
1897 template <class T> void assert_is_in(T *p) {
1898 T heap_oop = oopDesc::load_heap_oop(p);
1899 if (!oopDesc::is_null(heap_oop)) {
1900 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
1901 assert(Universe::heap()->is_in(o), "should be in heap");
1902 }
1903 }
1904 template <class T> void assert_is_in_closed_subset(T *p) {
1905 T heap_oop = oopDesc::load_heap_oop(p);
1906 if (!oopDesc::is_null(heap_oop)) {
1907 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
1908 assert(Universe::heap()->is_in_closed_subset(o),
1909 err_msg("should be in closed *p " INTPTR_FORMAT " " INTPTR_FORMAT, (address)p, (address)o));
1910 }
1911 }
1912 template <class T> void assert_is_in_reserved(T *p) {
1913 T heap_oop = oopDesc::load_heap_oop(p);
1914 if (!oopDesc::is_null(heap_oop)) {
1915 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
1916 assert(Universe::heap()->is_in_reserved(o), "should be in reserved");
1917 }
1918 }
1919 template <class T> void assert_nothing(T *p) {}
1921 #else
1922 template <class T> void assert_is_in(T *p) {}
1923 template <class T> void assert_is_in_closed_subset(T *p) {}
1924 template <class T> void assert_is_in_reserved(T *p) {}
1925 template <class T> void assert_nothing(T *p) {}
1926 #endif // ASSERT
1928 //
1929 // Macros that iterate over areas of oops which are specialized on type of
1930 // oop pointer either narrow or wide, depending on UseCompressedOops
1931 //
1932 // Parameters are:
1933 // T - type of oop to point to (either oop or narrowOop)
1934 // start_p - starting pointer for region to iterate over
1935 // count - number of oops or narrowOops to iterate over
1936 // do_oop - action to perform on each oop (it's arbitrary C code which
1937 // makes it more efficient to put in a macro rather than making
1938 // it a template function)
1939 // assert_fn - assert function which is template function because performance
1940 // doesn't matter when enabled.
1941 #define InstanceKlass_SPECIALIZED_OOP_ITERATE( \
1942 T, start_p, count, do_oop, \
1943 assert_fn) \
1944 { \
1945 T* p = (T*)(start_p); \
1946 T* const end = p + (count); \
1947 while (p < end) { \
1948 (assert_fn)(p); \
1949 do_oop; \
1950 ++p; \
1951 } \
1952 }
1954 #define InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE( \
1955 T, start_p, count, do_oop, \
1956 assert_fn) \
1957 { \
1958 T* const start = (T*)(start_p); \
1959 T* p = start + (count); \
1960 while (start < p) { \
1961 --p; \
1962 (assert_fn)(p); \
1963 do_oop; \
1964 } \
1965 }
1967 #define InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE( \
1968 T, start_p, count, low, high, \
1969 do_oop, assert_fn) \
1970 { \
1971 T* const l = (T*)(low); \
1972 T* const h = (T*)(high); \
1973 assert(mask_bits((intptr_t)l, sizeof(T)-1) == 0 && \
1974 mask_bits((intptr_t)h, sizeof(T)-1) == 0, \
1975 "bounded region must be properly aligned"); \
1976 T* p = (T*)(start_p); \
1977 T* end = p + (count); \
1978 if (p < l) p = l; \
1979 if (end > h) end = h; \
1980 while (p < end) { \
1981 (assert_fn)(p); \
1982 do_oop; \
1983 ++p; \
1984 } \
1985 }
1988 // The following macros call specialized macros, passing either oop or
1989 // narrowOop as the specialization type. These test the UseCompressedOops
1990 // flag.
1991 #define InstanceKlass_OOP_MAP_ITERATE(obj, do_oop, assert_fn) \
1992 { \
1993 /* Compute oopmap block range. The common case \
1994 is nonstatic_oop_map_size == 1. */ \
1995 OopMapBlock* map = start_of_nonstatic_oop_maps(); \
1996 OopMapBlock* const end_map = map + nonstatic_oop_map_count(); \
1997 if (UseCompressedOops) { \
1998 while (map < end_map) { \
1999 InstanceKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
2000 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \
2001 do_oop, assert_fn) \
2002 ++map; \
2003 } \
2004 } else { \
2005 while (map < end_map) { \
2006 InstanceKlass_SPECIALIZED_OOP_ITERATE(oop, \
2007 obj->obj_field_addr<oop>(map->offset()), map->count(), \
2008 do_oop, assert_fn) \
2009 ++map; \
2010 } \
2011 } \
2012 }
2014 #define InstanceKlass_OOP_MAP_REVERSE_ITERATE(obj, do_oop, assert_fn) \
2015 { \
2016 OopMapBlock* const start_map = start_of_nonstatic_oop_maps(); \
2017 OopMapBlock* map = start_map + nonstatic_oop_map_count(); \
2018 if (UseCompressedOops) { \
2019 while (start_map < map) { \
2020 --map; \
2021 InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(narrowOop, \
2022 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \
2023 do_oop, assert_fn) \
2024 } \
2025 } else { \
2026 while (start_map < map) { \
2027 --map; \
2028 InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(oop, \
2029 obj->obj_field_addr<oop>(map->offset()), map->count(), \
2030 do_oop, assert_fn) \
2031 } \
2032 } \
2033 }
2035 #define InstanceKlass_BOUNDED_OOP_MAP_ITERATE(obj, low, high, do_oop, \
2036 assert_fn) \
2037 { \
2038 /* Compute oopmap block range. The common case is \
2039 nonstatic_oop_map_size == 1, so we accept the \
2040 usually non-existent extra overhead of examining \
2041 all the maps. */ \
2042 OopMapBlock* map = start_of_nonstatic_oop_maps(); \
2043 OopMapBlock* const end_map = map + nonstatic_oop_map_count(); \
2044 if (UseCompressedOops) { \
2045 while (map < end_map) { \
2046 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
2047 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \
2048 low, high, \
2049 do_oop, assert_fn) \
2050 ++map; \
2051 } \
2052 } else { \
2053 while (map < end_map) { \
2054 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
2055 obj->obj_field_addr<oop>(map->offset()), map->count(), \
2056 low, high, \
2057 do_oop, assert_fn) \
2058 ++map; \
2059 } \
2060 } \
2061 }
2063 void InstanceKlass::oop_follow_contents(oop obj) {
2064 assert(obj != NULL, "can't follow the content of NULL object");
2065 MarkSweep::follow_klass(obj->klass());
2066 InstanceKlass_OOP_MAP_ITERATE( \
2067 obj, \
2068 MarkSweep::mark_and_push(p), \
2069 assert_is_in_closed_subset)
2070 }
2072 #if INCLUDE_ALL_GCS
2073 void InstanceKlass::oop_follow_contents(ParCompactionManager* cm,
2074 oop obj) {
2075 assert(obj != NULL, "can't follow the content of NULL object");
2076 PSParallelCompact::follow_klass(cm, obj->klass());
2077 // Only mark the header and let the scan of the meta-data mark
2078 // everything else.
2079 InstanceKlass_OOP_MAP_ITERATE( \
2080 obj, \
2081 PSParallelCompact::mark_and_push(cm, p), \
2082 assert_is_in)
2083 }
2084 #endif // INCLUDE_ALL_GCS
2086 // closure's do_metadata() method dictates whether the given closure should be
2087 // applied to the klass ptr in the object header.
2089 #define if_do_metadata_checked(closure, nv_suffix) \
2090 /* Make sure the non-virtual and the virtual versions match. */ \
2091 assert(closure->do_metadata##nv_suffix() == closure->do_metadata(), \
2092 "Inconsistency in do_metadata"); \
2093 if (closure->do_metadata##nv_suffix())
2095 #define InstanceKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
2096 \
2097 int InstanceKlass::oop_oop_iterate##nv_suffix(oop obj, OopClosureType* closure) { \
2098 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\
2099 /* header */ \
2100 if_do_metadata_checked(closure, nv_suffix) { \
2101 closure->do_klass##nv_suffix(obj->klass()); \
2102 } \
2103 InstanceKlass_OOP_MAP_ITERATE( \
2104 obj, \
2105 SpecializationStats:: \
2106 record_do_oop_call##nv_suffix(SpecializationStats::ik); \
2107 (closure)->do_oop##nv_suffix(p), \
2108 assert_is_in_closed_subset) \
2109 return size_helper(); \
2110 }
2112 #if INCLUDE_ALL_GCS
2113 #define InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \
2114 \
2115 int InstanceKlass::oop_oop_iterate_backwards##nv_suffix(oop obj, \
2116 OopClosureType* closure) { \
2117 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik); \
2118 /* header */ \
2119 if_do_metadata_checked(closure, nv_suffix) { \
2120 closure->do_klass##nv_suffix(obj->klass()); \
2121 } \
2122 /* instance variables */ \
2123 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \
2124 obj, \
2125 SpecializationStats::record_do_oop_call##nv_suffix(SpecializationStats::ik);\
2126 (closure)->do_oop##nv_suffix(p), \
2127 assert_is_in_closed_subset) \
2128 return size_helper(); \
2129 }
2130 #endif // INCLUDE_ALL_GCS
2132 #define InstanceKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \
2133 \
2134 int InstanceKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \
2135 OopClosureType* closure, \
2136 MemRegion mr) { \
2137 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\
2138 if_do_metadata_checked(closure, nv_suffix) { \
2139 if (mr.contains(obj)) { \
2140 closure->do_klass##nv_suffix(obj->klass()); \
2141 } \
2142 } \
2143 InstanceKlass_BOUNDED_OOP_MAP_ITERATE( \
2144 obj, mr.start(), mr.end(), \
2145 (closure)->do_oop##nv_suffix(p), \
2146 assert_is_in_closed_subset) \
2147 return size_helper(); \
2148 }
2150 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN)
2151 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN)
2152 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN_m)
2153 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN_m)
2154 #if INCLUDE_ALL_GCS
2155 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN)
2156 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN)
2157 #endif // INCLUDE_ALL_GCS
2159 int InstanceKlass::oop_adjust_pointers(oop obj) {
2160 int size = size_helper();
2161 InstanceKlass_OOP_MAP_ITERATE( \
2162 obj, \
2163 MarkSweep::adjust_pointer(p), \
2164 assert_is_in)
2165 MarkSweep::adjust_klass(obj->klass());
2166 return size;
2167 }
2169 #if INCLUDE_ALL_GCS
2170 void InstanceKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
2171 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \
2172 obj, \
2173 if (PSScavenge::should_scavenge(p)) { \
2174 pm->claim_or_forward_depth(p); \
2175 }, \
2176 assert_nothing )
2177 }
2179 int InstanceKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
2180 int size = size_helper();
2181 InstanceKlass_OOP_MAP_ITERATE( \
2182 obj, \
2183 PSParallelCompact::adjust_pointer(p), \
2184 assert_is_in)
2185 obj->update_header(cm);
2186 return size;
2187 }
2189 #endif // INCLUDE_ALL_GCS
2191 void InstanceKlass::clean_implementors_list(BoolObjectClosure* is_alive) {
2192 assert(is_loader_alive(is_alive), "this klass should be live");
2193 if (is_interface()) {
2194 if (ClassUnloading) {
2195 Klass* impl = implementor();
2196 if (impl != NULL) {
2197 if (!impl->is_loader_alive(is_alive)) {
2198 // remove this guy
2199 Klass** klass = adr_implementor();
2200 assert(klass != NULL, "null klass");
2201 if (klass != NULL) {
2202 *klass = NULL;
2203 }
2204 }
2205 }
2206 }
2207 }
2208 }
2210 void InstanceKlass::clean_method_data(BoolObjectClosure* is_alive) {
2211 for (int m = 0; m < methods()->length(); m++) {
2212 MethodData* mdo = methods()->at(m)->method_data();
2213 if (mdo != NULL) {
2214 for (ProfileData* data = mdo->first_data();
2215 mdo->is_valid(data);
2216 data = mdo->next_data(data)) {
2217 data->clean_weak_klass_links(is_alive);
2218 }
2219 }
2220 }
2221 }
2224 static void remove_unshareable_in_class(Klass* k) {
2225 // remove klass's unshareable info
2226 k->remove_unshareable_info();
2227 }
2229 void InstanceKlass::remove_unshareable_info() {
2230 Klass::remove_unshareable_info();
2231 // Unlink the class
2232 if (is_linked()) {
2233 unlink_class();
2234 }
2235 init_implementor();
2237 constants()->remove_unshareable_info();
2239 for (int i = 0; i < methods()->length(); i++) {
2240 Method* m = methods()->at(i);
2241 m->remove_unshareable_info();
2242 }
2244 // Need to reinstate when reading back the class.
2245 set_init_lock(NULL);
2247 // do array classes also.
2248 array_klasses_do(remove_unshareable_in_class);
2249 }
2251 void restore_unshareable_in_class(Klass* k, TRAPS) {
2252 k->restore_unshareable_info(CHECK);
2253 }
2255 void InstanceKlass::restore_unshareable_info(TRAPS) {
2256 Klass::restore_unshareable_info(CHECK);
2257 instanceKlassHandle ik(THREAD, this);
2259 Array<Method*>* methods = ik->methods();
2260 int num_methods = methods->length();
2261 for (int index2 = 0; index2 < num_methods; ++index2) {
2262 methodHandle m(THREAD, methods->at(index2));
2263 m()->link_method(m, CHECK);
2264 // restore method's vtable by calling a virtual function
2265 m->restore_vtable();
2266 }
2267 if (JvmtiExport::has_redefined_a_class()) {
2268 // Reinitialize vtable because RedefineClasses may have changed some
2269 // entries in this vtable for super classes so the CDS vtable might
2270 // point to old or obsolete entries. RedefineClasses doesn't fix up
2271 // vtables in the shared system dictionary, only the main one.
2272 // It also redefines the itable too so fix that too.
2273 ResourceMark rm(THREAD);
2274 ik->vtable()->initialize_vtable(false, CHECK);
2275 ik->itable()->initialize_itable(false, CHECK);
2276 }
2278 // Allocate a simple java object for a lock.
2279 // This needs to be a java object because during class initialization
2280 // it can be held across a java call.
2281 typeArrayOop r = oopFactory::new_typeArray(T_INT, 0, CHECK);
2282 Handle h(THREAD, (oop)r);
2283 ik->set_init_lock(h());
2285 // restore constant pool resolved references
2286 ik->constants()->restore_unshareable_info(CHECK);
2288 ik->array_klasses_do(restore_unshareable_in_class, CHECK);
2289 }
2291 static void clear_all_breakpoints(Method* m) {
2292 m->clear_all_breakpoints();
2293 }
2296 void InstanceKlass::notify_unload_class(InstanceKlass* ik) {
2297 // notify the debugger
2298 if (JvmtiExport::should_post_class_unload()) {
2299 JvmtiExport::post_class_unload(ik);
2300 }
2302 // notify ClassLoadingService of class unload
2303 ClassLoadingService::notify_class_unloaded(ik);
2304 }
2306 void InstanceKlass::release_C_heap_structures(InstanceKlass* ik) {
2307 // Clean up C heap
2308 ik->release_C_heap_structures();
2309 ik->constants()->release_C_heap_structures();
2310 }
2312 void InstanceKlass::release_C_heap_structures() {
2314 // Can't release the constant pool here because the constant pool can be
2315 // deallocated separately from the InstanceKlass for default methods and
2316 // redefine classes.
2318 // Deallocate oop map cache
2319 if (_oop_map_cache != NULL) {
2320 delete _oop_map_cache;
2321 _oop_map_cache = NULL;
2322 }
2324 // Deallocate JNI identifiers for jfieldIDs
2325 JNIid::deallocate(jni_ids());
2326 set_jni_ids(NULL);
2328 jmethodID* jmeths = methods_jmethod_ids_acquire();
2329 if (jmeths != (jmethodID*)NULL) {
2330 release_set_methods_jmethod_ids(NULL);
2331 FreeHeap(jmeths);
2332 }
2334 MemberNameTable* mnt = member_names();
2335 if (mnt != NULL) {
2336 delete mnt;
2337 set_member_names(NULL);
2338 }
2340 int* indices = methods_cached_itable_indices_acquire();
2341 if (indices != (int*)NULL) {
2342 release_set_methods_cached_itable_indices(NULL);
2343 FreeHeap(indices);
2344 }
2346 // release dependencies
2347 nmethodBucket* b = _dependencies;
2348 _dependencies = NULL;
2349 while (b != NULL) {
2350 nmethodBucket* next = b->next();
2351 delete b;
2352 b = next;
2353 }
2355 // Deallocate breakpoint records
2356 if (breakpoints() != 0x0) {
2357 methods_do(clear_all_breakpoints);
2358 assert(breakpoints() == 0x0, "should have cleared breakpoints");
2359 }
2361 // deallocate information about previous versions
2362 if (_previous_versions != NULL) {
2363 for (int i = _previous_versions->length() - 1; i >= 0; i--) {
2364 PreviousVersionNode * pv_node = _previous_versions->at(i);
2365 delete pv_node;
2366 }
2367 delete _previous_versions;
2368 _previous_versions = NULL;
2369 }
2371 // deallocate the cached class file
2372 if (_cached_class_file_bytes != NULL) {
2373 os::free(_cached_class_file_bytes, mtClass);
2374 _cached_class_file_bytes = NULL;
2375 _cached_class_file_len = 0;
2376 }
2378 // Decrement symbol reference counts associated with the unloaded class.
2379 if (_name != NULL) _name->decrement_refcount();
2380 // unreference array name derived from this class name (arrays of an unloaded
2381 // class can't be referenced anymore).
2382 if (_array_name != NULL) _array_name->decrement_refcount();
2383 if (_source_file_name != NULL) _source_file_name->decrement_refcount();
2384 if (_source_debug_extension != NULL) FREE_C_HEAP_ARRAY(char, _source_debug_extension, mtClass);
2386 assert(_total_instanceKlass_count >= 1, "Sanity check");
2387 Atomic::dec(&_total_instanceKlass_count);
2388 }
2390 void InstanceKlass::set_source_file_name(Symbol* n) {
2391 _source_file_name = n;
2392 if (_source_file_name != NULL) _source_file_name->increment_refcount();
2393 }
2395 void InstanceKlass::set_source_debug_extension(char* array, int length) {
2396 if (array == NULL) {
2397 _source_debug_extension = NULL;
2398 } else {
2399 // Adding one to the attribute length in order to store a null terminator
2400 // character could cause an overflow because the attribute length is
2401 // already coded with an u4 in the classfile, but in practice, it's
2402 // unlikely to happen.
2403 assert((length+1) > length, "Overflow checking");
2404 char* sde = NEW_C_HEAP_ARRAY(char, (length + 1), mtClass);
2405 for (int i = 0; i < length; i++) {
2406 sde[i] = array[i];
2407 }
2408 sde[length] = '\0';
2409 _source_debug_extension = sde;
2410 }
2411 }
2413 address InstanceKlass::static_field_addr(int offset) {
2414 return (address)(offset + InstanceMirrorKlass::offset_of_static_fields() + (intptr_t)java_mirror());
2415 }
2418 const char* InstanceKlass::signature_name() const {
2419 const char* src = (const char*) (name()->as_C_string());
2420 const int src_length = (int)strlen(src);
2421 char* dest = NEW_RESOURCE_ARRAY(char, src_length + 3);
2422 int src_index = 0;
2423 int dest_index = 0;
2424 dest[dest_index++] = 'L';
2425 while (src_index < src_length) {
2426 dest[dest_index++] = src[src_index++];
2427 }
2428 dest[dest_index++] = ';';
2429 dest[dest_index] = '\0';
2430 return dest;
2431 }
2433 // different verisons of is_same_class_package
2434 bool InstanceKlass::is_same_class_package(Klass* class2) {
2435 Klass* class1 = this;
2436 oop classloader1 = InstanceKlass::cast(class1)->class_loader();
2437 Symbol* classname1 = class1->name();
2439 if (class2->oop_is_objArray()) {
2440 class2 = ObjArrayKlass::cast(class2)->bottom_klass();
2441 }
2442 oop classloader2;
2443 if (class2->oop_is_instance()) {
2444 classloader2 = InstanceKlass::cast(class2)->class_loader();
2445 } else {
2446 assert(class2->oop_is_typeArray(), "should be type array");
2447 classloader2 = NULL;
2448 }
2449 Symbol* classname2 = class2->name();
2451 return InstanceKlass::is_same_class_package(classloader1, classname1,
2452 classloader2, classname2);
2453 }
2455 bool InstanceKlass::is_same_class_package(oop classloader2, Symbol* classname2) {
2456 Klass* class1 = this;
2457 oop classloader1 = InstanceKlass::cast(class1)->class_loader();
2458 Symbol* classname1 = class1->name();
2460 return InstanceKlass::is_same_class_package(classloader1, classname1,
2461 classloader2, classname2);
2462 }
2464 // return true if two classes are in the same package, classloader
2465 // and classname information is enough to determine a class's package
2466 bool InstanceKlass::is_same_class_package(oop class_loader1, Symbol* class_name1,
2467 oop class_loader2, Symbol* class_name2) {
2468 if (class_loader1 != class_loader2) {
2469 return false;
2470 } else if (class_name1 == class_name2) {
2471 return true; // skip painful bytewise comparison
2472 } else {
2473 ResourceMark rm;
2475 // The Symbol*'s are in UTF8 encoding. Since we only need to check explicitly
2476 // for ASCII characters ('/', 'L', '['), we can keep them in UTF8 encoding.
2477 // Otherwise, we just compare jbyte values between the strings.
2478 const jbyte *name1 = class_name1->base();
2479 const jbyte *name2 = class_name2->base();
2481 const jbyte *last_slash1 = UTF8::strrchr(name1, class_name1->utf8_length(), '/');
2482 const jbyte *last_slash2 = UTF8::strrchr(name2, class_name2->utf8_length(), '/');
2484 if ((last_slash1 == NULL) || (last_slash2 == NULL)) {
2485 // One of the two doesn't have a package. Only return true
2486 // if the other one also doesn't have a package.
2487 return last_slash1 == last_slash2;
2488 } else {
2489 // Skip over '['s
2490 if (*name1 == '[') {
2491 do {
2492 name1++;
2493 } while (*name1 == '[');
2494 if (*name1 != 'L') {
2495 // Something is terribly wrong. Shouldn't be here.
2496 return false;
2497 }
2498 }
2499 if (*name2 == '[') {
2500 do {
2501 name2++;
2502 } while (*name2 == '[');
2503 if (*name2 != 'L') {
2504 // Something is terribly wrong. Shouldn't be here.
2505 return false;
2506 }
2507 }
2509 // Check that package part is identical
2510 int length1 = last_slash1 - name1;
2511 int length2 = last_slash2 - name2;
2513 return UTF8::equal(name1, length1, name2, length2);
2514 }
2515 }
2516 }
2518 // Returns true iff super_method can be overridden by a method in targetclassname
2519 // See JSL 3rd edition 8.4.6.1
2520 // Assumes name-signature match
2521 // "this" is InstanceKlass of super_method which must exist
2522 // note that the InstanceKlass of the method in the targetclassname has not always been created yet
2523 bool InstanceKlass::is_override(methodHandle super_method, Handle targetclassloader, Symbol* targetclassname, TRAPS) {
2524 // Private methods can not be overridden
2525 if (super_method->is_private()) {
2526 return false;
2527 }
2528 // If super method is accessible, then override
2529 if ((super_method->is_protected()) ||
2530 (super_method->is_public())) {
2531 return true;
2532 }
2533 // Package-private methods are not inherited outside of package
2534 assert(super_method->is_package_private(), "must be package private");
2535 return(is_same_class_package(targetclassloader(), targetclassname));
2536 }
2538 /* defined for now in jvm.cpp, for historical reasons *--
2539 Klass* InstanceKlass::compute_enclosing_class_impl(instanceKlassHandle self,
2540 Symbol*& simple_name_result, TRAPS) {
2541 ...
2542 }
2543 */
2545 // tell if two classes have the same enclosing class (at package level)
2546 bool InstanceKlass::is_same_package_member_impl(instanceKlassHandle class1,
2547 Klass* class2_oop, TRAPS) {
2548 if (class2_oop == class1()) return true;
2549 if (!class2_oop->oop_is_instance()) return false;
2550 instanceKlassHandle class2(THREAD, class2_oop);
2552 // must be in same package before we try anything else
2553 if (!class1->is_same_class_package(class2->class_loader(), class2->name()))
2554 return false;
2556 // As long as there is an outer1.getEnclosingClass,
2557 // shift the search outward.
2558 instanceKlassHandle outer1 = class1;
2559 for (;;) {
2560 // As we walk along, look for equalities between outer1 and class2.
2561 // Eventually, the walks will terminate as outer1 stops
2562 // at the top-level class around the original class.
2563 bool ignore_inner_is_member;
2564 Klass* next = outer1->compute_enclosing_class(&ignore_inner_is_member,
2565 CHECK_false);
2566 if (next == NULL) break;
2567 if (next == class2()) return true;
2568 outer1 = instanceKlassHandle(THREAD, next);
2569 }
2571 // Now do the same for class2.
2572 instanceKlassHandle outer2 = class2;
2573 for (;;) {
2574 bool ignore_inner_is_member;
2575 Klass* next = outer2->compute_enclosing_class(&ignore_inner_is_member,
2576 CHECK_false);
2577 if (next == NULL) break;
2578 // Might as well check the new outer against all available values.
2579 if (next == class1()) return true;
2580 if (next == outer1()) return true;
2581 outer2 = instanceKlassHandle(THREAD, next);
2582 }
2584 // If by this point we have not found an equality between the
2585 // two classes, we know they are in separate package members.
2586 return false;
2587 }
2590 jint InstanceKlass::compute_modifier_flags(TRAPS) const {
2591 jint access = access_flags().as_int();
2593 // But check if it happens to be member class.
2594 instanceKlassHandle ik(THREAD, this);
2595 InnerClassesIterator iter(ik);
2596 for (; !iter.done(); iter.next()) {
2597 int ioff = iter.inner_class_info_index();
2598 // Inner class attribute can be zero, skip it.
2599 // Strange but true: JVM spec. allows null inner class refs.
2600 if (ioff == 0) continue;
2602 // only look at classes that are already loaded
2603 // since we are looking for the flags for our self.
2604 Symbol* inner_name = ik->constants()->klass_name_at(ioff);
2605 if ((ik->name() == inner_name)) {
2606 // This is really a member class.
2607 access = iter.inner_access_flags();
2608 break;
2609 }
2610 }
2611 // Remember to strip ACC_SUPER bit
2612 return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS;
2613 }
2615 jint InstanceKlass::jvmti_class_status() const {
2616 jint result = 0;
2618 if (is_linked()) {
2619 result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED;
2620 }
2622 if (is_initialized()) {
2623 assert(is_linked(), "Class status is not consistent");
2624 result |= JVMTI_CLASS_STATUS_INITIALIZED;
2625 }
2626 if (is_in_error_state()) {
2627 result |= JVMTI_CLASS_STATUS_ERROR;
2628 }
2629 return result;
2630 }
2632 Method* InstanceKlass::method_at_itable(Klass* holder, int index, TRAPS) {
2633 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable();
2634 int method_table_offset_in_words = ioe->offset()/wordSize;
2635 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words())
2636 / itableOffsetEntry::size();
2638 for (int cnt = 0 ; ; cnt ++, ioe ++) {
2639 // If the interface isn't implemented by the receiver class,
2640 // the VM should throw IncompatibleClassChangeError.
2641 if (cnt >= nof_interfaces) {
2642 THROW_NULL(vmSymbols::java_lang_IncompatibleClassChangeError());
2643 }
2645 Klass* ik = ioe->interface_klass();
2646 if (ik == holder) break;
2647 }
2649 itableMethodEntry* ime = ioe->first_method_entry(this);
2650 Method* m = ime[index].method();
2651 if (m == NULL) {
2652 THROW_NULL(vmSymbols::java_lang_AbstractMethodError());
2653 }
2654 return m;
2655 }
2657 // On-stack replacement stuff
2658 void InstanceKlass::add_osr_nmethod(nmethod* n) {
2659 // only one compilation can be active
2660 NEEDS_CLEANUP
2661 // This is a short non-blocking critical region, so the no safepoint check is ok.
2662 OsrList_lock->lock_without_safepoint_check();
2663 assert(n->is_osr_method(), "wrong kind of nmethod");
2664 n->set_osr_link(osr_nmethods_head());
2665 set_osr_nmethods_head(n);
2666 // Raise the highest osr level if necessary
2667 if (TieredCompilation) {
2668 Method* m = n->method();
2669 m->set_highest_osr_comp_level(MAX2(m->highest_osr_comp_level(), n->comp_level()));
2670 }
2671 // Remember to unlock again
2672 OsrList_lock->unlock();
2674 // Get rid of the osr methods for the same bci that have lower levels.
2675 if (TieredCompilation) {
2676 for (int l = CompLevel_limited_profile; l < n->comp_level(); l++) {
2677 nmethod *inv = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), l, true);
2678 if (inv != NULL && inv->is_in_use()) {
2679 inv->make_not_entrant();
2680 }
2681 }
2682 }
2683 }
2686 void InstanceKlass::remove_osr_nmethod(nmethod* n) {
2687 // This is a short non-blocking critical region, so the no safepoint check is ok.
2688 OsrList_lock->lock_without_safepoint_check();
2689 assert(n->is_osr_method(), "wrong kind of nmethod");
2690 nmethod* last = NULL;
2691 nmethod* cur = osr_nmethods_head();
2692 int max_level = CompLevel_none; // Find the max comp level excluding n
2693 Method* m = n->method();
2694 // Search for match
2695 while(cur != NULL && cur != n) {
2696 if (TieredCompilation) {
2697 // Find max level before n
2698 max_level = MAX2(max_level, cur->comp_level());
2699 }
2700 last = cur;
2701 cur = cur->osr_link();
2702 }
2703 nmethod* next = NULL;
2704 if (cur == n) {
2705 next = cur->osr_link();
2706 if (last == NULL) {
2707 // Remove first element
2708 set_osr_nmethods_head(next);
2709 } else {
2710 last->set_osr_link(next);
2711 }
2712 }
2713 n->set_osr_link(NULL);
2714 if (TieredCompilation) {
2715 cur = next;
2716 while (cur != NULL) {
2717 // Find max level after n
2718 max_level = MAX2(max_level, cur->comp_level());
2719 cur = cur->osr_link();
2720 }
2721 m->set_highest_osr_comp_level(max_level);
2722 }
2723 // Remember to unlock again
2724 OsrList_lock->unlock();
2725 }
2727 nmethod* InstanceKlass::lookup_osr_nmethod(Method* const m, int bci, int comp_level, bool match_level) const {
2728 // This is a short non-blocking critical region, so the no safepoint check is ok.
2729 OsrList_lock->lock_without_safepoint_check();
2730 nmethod* osr = osr_nmethods_head();
2731 nmethod* best = NULL;
2732 while (osr != NULL) {
2733 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
2734 // There can be a time when a c1 osr method exists but we are waiting
2735 // for a c2 version. When c2 completes its osr nmethod we will trash
2736 // the c1 version and only be able to find the c2 version. However
2737 // while we overflow in the c1 code at back branches we don't want to
2738 // try and switch to the same code as we are already running
2740 if (osr->method() == m &&
2741 (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) {
2742 if (match_level) {
2743 if (osr->comp_level() == comp_level) {
2744 // Found a match - return it.
2745 OsrList_lock->unlock();
2746 return osr;
2747 }
2748 } else {
2749 if (best == NULL || (osr->comp_level() > best->comp_level())) {
2750 if (osr->comp_level() == CompLevel_highest_tier) {
2751 // Found the best possible - return it.
2752 OsrList_lock->unlock();
2753 return osr;
2754 }
2755 best = osr;
2756 }
2757 }
2758 }
2759 osr = osr->osr_link();
2760 }
2761 OsrList_lock->unlock();
2762 if (best != NULL && best->comp_level() >= comp_level && match_level == false) {
2763 return best;
2764 }
2765 return NULL;
2766 }
2768 void InstanceKlass::add_member_name(Handle mem_name) {
2769 jweak mem_name_wref = JNIHandles::make_weak_global(mem_name);
2770 MutexLocker ml(MemberNameTable_lock);
2771 DEBUG_ONLY(No_Safepoint_Verifier nsv);
2773 if (_member_names == NULL) {
2774 _member_names = new (ResourceObj::C_HEAP, mtClass) MemberNameTable();
2775 }
2776 _member_names->add_member_name(mem_name_wref);
2777 }
2779 // -----------------------------------------------------------------------------------------------------
2780 // Printing
2782 #ifndef PRODUCT
2784 #define BULLET " - "
2786 static const char* state_names[] = {
2787 "allocated", "loaded", "linked", "being_initialized", "fully_initialized", "initialization_error"
2788 };
2790 void InstanceKlass::print_on(outputStream* st) const {
2791 assert(is_klass(), "must be klass");
2792 Klass::print_on(st);
2794 st->print(BULLET"instance size: %d", size_helper()); st->cr();
2795 st->print(BULLET"klass size: %d", size()); st->cr();
2796 st->print(BULLET"access: "); access_flags().print_on(st); st->cr();
2797 st->print(BULLET"state: "); st->print_cr(state_names[_init_state]);
2798 st->print(BULLET"name: "); name()->print_value_on(st); st->cr();
2799 st->print(BULLET"super: "); super()->print_value_on_maybe_null(st); st->cr();
2800 st->print(BULLET"sub: ");
2801 Klass* sub = subklass();
2802 int n;
2803 for (n = 0; sub != NULL; n++, sub = sub->next_sibling()) {
2804 if (n < MaxSubklassPrintSize) {
2805 sub->print_value_on(st);
2806 st->print(" ");
2807 }
2808 }
2809 if (n >= MaxSubklassPrintSize) st->print("(%d more klasses...)", n - MaxSubklassPrintSize);
2810 st->cr();
2812 if (is_interface()) {
2813 st->print_cr(BULLET"nof implementors: %d", nof_implementors());
2814 if (nof_implementors() == 1) {
2815 st->print_cr(BULLET"implementor: ");
2816 st->print(" ");
2817 implementor()->print_value_on(st);
2818 st->cr();
2819 }
2820 }
2822 st->print(BULLET"arrays: "); array_klasses()->print_value_on_maybe_null(st); st->cr();
2823 st->print(BULLET"methods: "); methods()->print_value_on(st); st->cr();
2824 if (Verbose) {
2825 Array<Method*>* method_array = methods();
2826 for(int i = 0; i < method_array->length(); i++) {
2827 st->print("%d : ", i); method_array->at(i)->print_value(); st->cr();
2828 }
2829 }
2830 st->print(BULLET"method ordering: "); method_ordering()->print_value_on(st); st->cr();
2831 st->print(BULLET"local interfaces: "); local_interfaces()->print_value_on(st); st->cr();
2832 st->print(BULLET"trans. interfaces: "); transitive_interfaces()->print_value_on(st); st->cr();
2833 st->print(BULLET"constants: "); constants()->print_value_on(st); st->cr();
2834 if (class_loader_data() != NULL) {
2835 st->print(BULLET"class loader data: ");
2836 class_loader_data()->print_value_on(st);
2837 st->cr();
2838 }
2839 st->print(BULLET"protection domain: "); ((InstanceKlass*)this)->protection_domain()->print_value_on(st); st->cr();
2840 st->print(BULLET"host class: "); host_klass()->print_value_on_maybe_null(st); st->cr();
2841 st->print(BULLET"signers: "); signers()->print_value_on(st); st->cr();
2842 st->print(BULLET"init_lock: "); ((oop)_init_lock)->print_value_on(st); st->cr();
2843 if (source_file_name() != NULL) {
2844 st->print(BULLET"source file: ");
2845 source_file_name()->print_value_on(st);
2846 st->cr();
2847 }
2848 if (source_debug_extension() != NULL) {
2849 st->print(BULLET"source debug extension: ");
2850 st->print("%s", source_debug_extension());
2851 st->cr();
2852 }
2853 st->print(BULLET"class annotations: "); class_annotations()->print_value_on(st); st->cr();
2854 st->print(BULLET"class type annotations: "); class_type_annotations()->print_value_on(st); st->cr();
2855 st->print(BULLET"field annotations: "); fields_annotations()->print_value_on(st); st->cr();
2856 st->print(BULLET"field type annotations: "); fields_type_annotations()->print_value_on(st); st->cr();
2857 {
2858 ResourceMark rm;
2859 // PreviousVersionInfo objects returned via PreviousVersionWalker
2860 // contain a GrowableArray of handles. We have to clean up the
2861 // GrowableArray _after_ the PreviousVersionWalker destructor
2862 // has destroyed the handles.
2863 {
2864 bool have_pv = false;
2865 PreviousVersionWalker pvw((InstanceKlass*)this);
2866 for (PreviousVersionInfo * pv_info = pvw.next_previous_version();
2867 pv_info != NULL; pv_info = pvw.next_previous_version()) {
2868 if (!have_pv)
2869 st->print(BULLET"previous version: ");
2870 have_pv = true;
2871 pv_info->prev_constant_pool_handle()()->print_value_on(st);
2872 }
2873 if (have_pv) st->cr();
2874 } // pvw is cleaned up
2875 } // rm is cleaned up
2877 if (generic_signature() != NULL) {
2878 st->print(BULLET"generic signature: ");
2879 generic_signature()->print_value_on(st);
2880 st->cr();
2881 }
2882 st->print(BULLET"inner classes: "); inner_classes()->print_value_on(st); st->cr();
2883 st->print(BULLET"java mirror: "); java_mirror()->print_value_on(st); st->cr();
2884 st->print(BULLET"vtable length %d (start addr: " INTPTR_FORMAT ")", vtable_length(), start_of_vtable()); st->cr();
2885 st->print(BULLET"itable length %d (start addr: " INTPTR_FORMAT ")", itable_length(), start_of_itable()); st->cr();
2886 st->print_cr(BULLET"---- static fields (%d words):", static_field_size());
2887 FieldPrinter print_static_field(st);
2888 ((InstanceKlass*)this)->do_local_static_fields(&print_static_field);
2889 st->print_cr(BULLET"---- non-static fields (%d words):", nonstatic_field_size());
2890 FieldPrinter print_nonstatic_field(st);
2891 ((InstanceKlass*)this)->do_nonstatic_fields(&print_nonstatic_field);
2893 st->print(BULLET"non-static oop maps: ");
2894 OopMapBlock* map = start_of_nonstatic_oop_maps();
2895 OopMapBlock* end_map = map + nonstatic_oop_map_count();
2896 while (map < end_map) {
2897 st->print("%d-%d ", map->offset(), map->offset() + heapOopSize*(map->count() - 1));
2898 map++;
2899 }
2900 st->cr();
2901 }
2903 #endif //PRODUCT
2905 void InstanceKlass::print_value_on(outputStream* st) const {
2906 assert(is_klass(), "must be klass");
2907 name()->print_value_on(st);
2908 }
2910 #ifndef PRODUCT
2912 void FieldPrinter::do_field(fieldDescriptor* fd) {
2913 _st->print(BULLET);
2914 if (_obj == NULL) {
2915 fd->print_on(_st);
2916 _st->cr();
2917 } else {
2918 fd->print_on_for(_st, _obj);
2919 _st->cr();
2920 }
2921 }
2924 void InstanceKlass::oop_print_on(oop obj, outputStream* st) {
2925 Klass::oop_print_on(obj, st);
2927 if (this == SystemDictionary::String_klass()) {
2928 typeArrayOop value = java_lang_String::value(obj);
2929 juint offset = java_lang_String::offset(obj);
2930 juint length = java_lang_String::length(obj);
2931 if (value != NULL &&
2932 value->is_typeArray() &&
2933 offset <= (juint) value->length() &&
2934 offset + length <= (juint) value->length()) {
2935 st->print(BULLET"string: ");
2936 Handle h_obj(obj);
2937 java_lang_String::print(h_obj, st);
2938 st->cr();
2939 if (!WizardMode) return; // that is enough
2940 }
2941 }
2943 st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj));
2944 FieldPrinter print_field(st, obj);
2945 do_nonstatic_fields(&print_field);
2947 if (this == SystemDictionary::Class_klass()) {
2948 st->print(BULLET"signature: ");
2949 java_lang_Class::print_signature(obj, st);
2950 st->cr();
2951 Klass* mirrored_klass = java_lang_Class::as_Klass(obj);
2952 st->print(BULLET"fake entry for mirror: ");
2953 mirrored_klass->print_value_on_maybe_null(st);
2954 st->cr();
2955 Klass* array_klass = java_lang_Class::array_klass(obj);
2956 st->print(BULLET"fake entry for array: ");
2957 array_klass->print_value_on_maybe_null(st);
2958 st->cr();
2959 st->print_cr(BULLET"fake entry for oop_size: %d", java_lang_Class::oop_size(obj));
2960 st->print_cr(BULLET"fake entry for static_oop_field_count: %d", java_lang_Class::static_oop_field_count(obj));
2961 Klass* real_klass = java_lang_Class::as_Klass(obj);
2962 if (real_klass != NULL && real_klass->oop_is_instance()) {
2963 InstanceKlass::cast(real_klass)->do_local_static_fields(&print_field);
2964 }
2965 } else if (this == SystemDictionary::MethodType_klass()) {
2966 st->print(BULLET"signature: ");
2967 java_lang_invoke_MethodType::print_signature(obj, st);
2968 st->cr();
2969 }
2970 }
2972 #endif //PRODUCT
2974 void InstanceKlass::oop_print_value_on(oop obj, outputStream* st) {
2975 st->print("a ");
2976 name()->print_value_on(st);
2977 obj->print_address_on(st);
2978 if (this == SystemDictionary::String_klass()
2979 && java_lang_String::value(obj) != NULL) {
2980 ResourceMark rm;
2981 int len = java_lang_String::length(obj);
2982 int plen = (len < 24 ? len : 12);
2983 char* str = java_lang_String::as_utf8_string(obj, 0, plen);
2984 st->print(" = \"%s\"", str);
2985 if (len > plen)
2986 st->print("...[%d]", len);
2987 } else if (this == SystemDictionary::Class_klass()) {
2988 Klass* k = java_lang_Class::as_Klass(obj);
2989 st->print(" = ");
2990 if (k != NULL) {
2991 k->print_value_on(st);
2992 } else {
2993 const char* tname = type2name(java_lang_Class::primitive_type(obj));
2994 st->print("%s", tname ? tname : "type?");
2995 }
2996 } else if (this == SystemDictionary::MethodType_klass()) {
2997 st->print(" = ");
2998 java_lang_invoke_MethodType::print_signature(obj, st);
2999 } else if (java_lang_boxing_object::is_instance(obj)) {
3000 st->print(" = ");
3001 java_lang_boxing_object::print(obj, st);
3002 } else if (this == SystemDictionary::LambdaForm_klass()) {
3003 oop vmentry = java_lang_invoke_LambdaForm::vmentry(obj);
3004 if (vmentry != NULL) {
3005 st->print(" => ");
3006 vmentry->print_value_on(st);
3007 }
3008 } else if (this == SystemDictionary::MemberName_klass()) {
3009 Metadata* vmtarget = java_lang_invoke_MemberName::vmtarget(obj);
3010 if (vmtarget != NULL) {
3011 st->print(" = ");
3012 vmtarget->print_value_on(st);
3013 } else {
3014 java_lang_invoke_MemberName::clazz(obj)->print_value_on(st);
3015 st->print(".");
3016 java_lang_invoke_MemberName::name(obj)->print_value_on(st);
3017 }
3018 }
3019 }
3021 const char* InstanceKlass::internal_name() const {
3022 return external_name();
3023 }
3025 #if INCLUDE_SERVICES
3026 // Size Statistics
3027 void InstanceKlass::collect_statistics(KlassSizeStats *sz) const {
3028 Klass::collect_statistics(sz);
3030 sz->_inst_size = HeapWordSize * size_helper();
3031 sz->_vtab_bytes = HeapWordSize * align_object_offset(vtable_length());
3032 sz->_itab_bytes = HeapWordSize * align_object_offset(itable_length());
3033 sz->_nonstatic_oopmap_bytes = HeapWordSize *
3034 ((is_interface() || is_anonymous()) ?
3035 align_object_offset(nonstatic_oop_map_size()) :
3036 nonstatic_oop_map_size());
3038 int n = 0;
3039 n += (sz->_methods_array_bytes = sz->count_array(methods()));
3040 n += (sz->_method_ordering_bytes = sz->count_array(method_ordering()));
3041 n += (sz->_local_interfaces_bytes = sz->count_array(local_interfaces()));
3042 n += (sz->_transitive_interfaces_bytes = sz->count_array(transitive_interfaces()));
3043 n += (sz->_signers_bytes = sz->count_array(signers()));
3044 n += (sz->_fields_bytes = sz->count_array(fields()));
3045 n += (sz->_inner_classes_bytes = sz->count_array(inner_classes()));
3046 sz->_ro_bytes += n;
3048 const ConstantPool* cp = constants();
3049 if (cp) {
3050 cp->collect_statistics(sz);
3051 }
3053 const Annotations* anno = annotations();
3054 if (anno) {
3055 anno->collect_statistics(sz);
3056 }
3058 const Array<Method*>* methods_array = methods();
3059 if (methods()) {
3060 for (int i = 0; i < methods_array->length(); i++) {
3061 Method* method = methods_array->at(i);
3062 if (method) {
3063 sz->_method_count ++;
3064 method->collect_statistics(sz);
3065 }
3066 }
3067 }
3068 }
3069 #endif // INCLUDE_SERVICES
3071 // Verification
3073 class VerifyFieldClosure: public OopClosure {
3074 protected:
3075 template <class T> void do_oop_work(T* p) {
3076 oop obj = oopDesc::load_decode_heap_oop(p);
3077 if (!obj->is_oop_or_null()) {
3078 tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p, (address)obj);
3079 Universe::print();
3080 guarantee(false, "boom");
3081 }
3082 }
3083 public:
3084 virtual void do_oop(oop* p) { VerifyFieldClosure::do_oop_work(p); }
3085 virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); }
3086 };
3088 void InstanceKlass::verify_on(outputStream* st) {
3089 Klass::verify_on(st);
3090 Thread *thread = Thread::current();
3092 #ifndef PRODUCT
3093 // Avoid redundant verifies
3094 if (_verify_count == Universe::verify_count()) return;
3095 _verify_count = Universe::verify_count();
3096 #endif
3097 // Verify that klass is present in SystemDictionary
3098 if (is_loaded() && !is_anonymous()) {
3099 Symbol* h_name = name();
3100 SystemDictionary::verify_obj_klass_present(h_name, class_loader_data());
3101 }
3103 // Verify static fields
3104 VerifyFieldClosure blk;
3106 // Verify vtables
3107 if (is_linked()) {
3108 ResourceMark rm(thread);
3109 // $$$ This used to be done only for m/s collections. Doing it
3110 // always seemed a valid generalization. (DLD -- 6/00)
3111 vtable()->verify(st);
3112 }
3114 // Verify first subklass
3115 if (subklass_oop() != NULL) {
3116 guarantee(subklass_oop()->is_metadata(), "should be in metaspace");
3117 guarantee(subklass_oop()->is_klass(), "should be klass");
3118 }
3120 // Verify siblings
3121 Klass* super = this->super();
3122 Klass* sib = next_sibling();
3123 if (sib != NULL) {
3124 if (sib == this) {
3125 fatal(err_msg("subclass points to itself " PTR_FORMAT, sib));
3126 }
3128 guarantee(sib->is_metadata(), "should be in metaspace");
3129 guarantee(sib->is_klass(), "should be klass");
3130 guarantee(sib->super() == super, "siblings should have same superklass");
3131 }
3133 // Verify implementor fields
3134 Klass* im = implementor();
3135 if (im != NULL) {
3136 guarantee(is_interface(), "only interfaces should have implementor set");
3137 guarantee(im->is_klass(), "should be klass");
3138 guarantee(!im->is_interface() || im == this,
3139 "implementors cannot be interfaces");
3140 }
3142 // Verify local interfaces
3143 if (local_interfaces()) {
3144 Array<Klass*>* local_interfaces = this->local_interfaces();
3145 for (int j = 0; j < local_interfaces->length(); j++) {
3146 Klass* e = local_interfaces->at(j);
3147 guarantee(e->is_klass() && e->is_interface(), "invalid local interface");
3148 }
3149 }
3151 // Verify transitive interfaces
3152 if (transitive_interfaces() != NULL) {
3153 Array<Klass*>* transitive_interfaces = this->transitive_interfaces();
3154 for (int j = 0; j < transitive_interfaces->length(); j++) {
3155 Klass* e = transitive_interfaces->at(j);
3156 guarantee(e->is_klass() && e->is_interface(), "invalid transitive interface");
3157 }
3158 }
3160 // Verify methods
3161 if (methods() != NULL) {
3162 Array<Method*>* methods = this->methods();
3163 for (int j = 0; j < methods->length(); j++) {
3164 guarantee(methods->at(j)->is_metadata(), "should be in metaspace");
3165 guarantee(methods->at(j)->is_method(), "non-method in methods array");
3166 }
3167 for (int j = 0; j < methods->length() - 1; j++) {
3168 Method* m1 = methods->at(j);
3169 Method* m2 = methods->at(j + 1);
3170 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
3171 }
3172 }
3174 // Verify method ordering
3175 if (method_ordering() != NULL) {
3176 Array<int>* method_ordering = this->method_ordering();
3177 int length = method_ordering->length();
3178 if (JvmtiExport::can_maintain_original_method_order() ||
3179 ((UseSharedSpaces || DumpSharedSpaces) && length != 0)) {
3180 guarantee(length == methods()->length(), "invalid method ordering length");
3181 jlong sum = 0;
3182 for (int j = 0; j < length; j++) {
3183 int original_index = method_ordering->at(j);
3184 guarantee(original_index >= 0, "invalid method ordering index");
3185 guarantee(original_index < length, "invalid method ordering index");
3186 sum += original_index;
3187 }
3188 // Verify sum of indices 0,1,...,length-1
3189 guarantee(sum == ((jlong)length*(length-1))/2, "invalid method ordering sum");
3190 } else {
3191 guarantee(length == 0, "invalid method ordering length");
3192 }
3193 }
3195 // Verify JNI static field identifiers
3196 if (jni_ids() != NULL) {
3197 jni_ids()->verify(this);
3198 }
3200 // Verify other fields
3201 if (array_klasses() != NULL) {
3202 guarantee(array_klasses()->is_metadata(), "should be in metaspace");
3203 guarantee(array_klasses()->is_klass(), "should be klass");
3204 }
3205 if (constants() != NULL) {
3206 guarantee(constants()->is_metadata(), "should be in metaspace");
3207 guarantee(constants()->is_constantPool(), "should be constant pool");
3208 }
3209 if (protection_domain() != NULL) {
3210 guarantee(protection_domain()->is_oop(), "should be oop");
3211 }
3212 const Klass* host = host_klass();
3213 if (host != NULL) {
3214 guarantee(host->is_metadata(), "should be in metaspace");
3215 guarantee(host->is_klass(), "should be klass");
3216 }
3217 if (signers() != NULL) {
3218 guarantee(signers()->is_objArray(), "should be obj array");
3219 }
3220 }
3222 void InstanceKlass::oop_verify_on(oop obj, outputStream* st) {
3223 Klass::oop_verify_on(obj, st);
3224 VerifyFieldClosure blk;
3225 obj->oop_iterate_no_header(&blk);
3226 }
3229 // JNIid class for jfieldIDs only
3230 // Note to reviewers:
3231 // These JNI functions are just moved over to column 1 and not changed
3232 // in the compressed oops workspace.
3233 JNIid::JNIid(Klass* holder, int offset, JNIid* next) {
3234 _holder = holder;
3235 _offset = offset;
3236 _next = next;
3237 debug_only(_is_static_field_id = false;)
3238 }
3241 JNIid* JNIid::find(int offset) {
3242 JNIid* current = this;
3243 while (current != NULL) {
3244 if (current->offset() == offset) return current;
3245 current = current->next();
3246 }
3247 return NULL;
3248 }
3250 void JNIid::deallocate(JNIid* current) {
3251 while (current != NULL) {
3252 JNIid* next = current->next();
3253 delete current;
3254 current = next;
3255 }
3256 }
3259 void JNIid::verify(Klass* holder) {
3260 int first_field_offset = InstanceMirrorKlass::offset_of_static_fields();
3261 int end_field_offset;
3262 end_field_offset = first_field_offset + (InstanceKlass::cast(holder)->static_field_size() * wordSize);
3264 JNIid* current = this;
3265 while (current != NULL) {
3266 guarantee(current->holder() == holder, "Invalid klass in JNIid");
3267 #ifdef ASSERT
3268 int o = current->offset();
3269 if (current->is_static_field_id()) {
3270 guarantee(o >= first_field_offset && o < end_field_offset, "Invalid static field offset in JNIid");
3271 }
3272 #endif
3273 current = current->next();
3274 }
3275 }
3278 #ifdef ASSERT
3279 void InstanceKlass::set_init_state(ClassState state) {
3280 bool good_state = is_shared() ? (_init_state <= state)
3281 : (_init_state < state);
3282 assert(good_state || state == allocated, "illegal state transition");
3283 _init_state = (u1)state;
3284 }
3285 #endif
3288 // RedefineClasses() support for previous versions:
3290 // Purge previous versions
3291 static void purge_previous_versions_internal(InstanceKlass* ik, int emcp_method_count) {
3292 if (ik->previous_versions() != NULL) {
3293 // This klass has previous versions so see what we can cleanup
3294 // while it is safe to do so.
3296 int deleted_count = 0; // leave debugging breadcrumbs
3297 int live_count = 0;
3298 ClassLoaderData* loader_data = ik->class_loader_data() == NULL ?
3299 ClassLoaderData::the_null_class_loader_data() :
3300 ik->class_loader_data();
3302 // RC_TRACE macro has an embedded ResourceMark
3303 RC_TRACE(0x00000200, ("purge: %s: previous version length=%d",
3304 ik->external_name(), ik->previous_versions()->length()));
3306 for (int i = ik->previous_versions()->length() - 1; i >= 0; i--) {
3307 // check the previous versions array
3308 PreviousVersionNode * pv_node = ik->previous_versions()->at(i);
3309 ConstantPool* cp_ref = pv_node->prev_constant_pool();
3310 assert(cp_ref != NULL, "cp ref was unexpectedly cleared");
3312 ConstantPool* pvcp = cp_ref;
3313 if (!pvcp->on_stack()) {
3314 // If the constant pool isn't on stack, none of the methods
3315 // are executing. Delete all the methods, the constant pool and
3316 // and this previous version node.
3317 GrowableArray<Method*>* method_refs = pv_node->prev_EMCP_methods();
3318 if (method_refs != NULL) {
3319 for (int j = method_refs->length() - 1; j >= 0; j--) {
3320 Method* method = method_refs->at(j);
3321 assert(method != NULL, "method ref was unexpectedly cleared");
3322 method_refs->remove_at(j);
3323 // method will be freed with associated class.
3324 }
3325 }
3326 // Remove the constant pool
3327 delete pv_node;
3328 // Since we are traversing the array backwards, we don't have to
3329 // do anything special with the index.
3330 ik->previous_versions()->remove_at(i);
3331 deleted_count++;
3332 continue;
3333 } else {
3334 RC_TRACE(0x00000200, ("purge: previous version @%d is alive", i));
3335 assert(pvcp->pool_holder() != NULL, "Constant pool with no holder");
3336 guarantee (!loader_data->is_unloading(), "unloaded classes can't be on the stack");
3337 live_count++;
3338 }
3340 // At least one method is live in this previous version, clean out
3341 // the others or mark them as obsolete.
3342 GrowableArray<Method*>* method_refs = pv_node->prev_EMCP_methods();
3343 if (method_refs != NULL) {
3344 RC_TRACE(0x00000200, ("purge: previous methods length=%d",
3345 method_refs->length()));
3346 for (int j = method_refs->length() - 1; j >= 0; j--) {
3347 Method* method = method_refs->at(j);
3348 assert(method != NULL, "method ref was unexpectedly cleared");
3350 // Remove the emcp method if it's not executing
3351 // If it's been made obsolete by a redefinition of a non-emcp
3352 // method, mark it as obsolete but leave it to clean up later.
3353 if (!method->on_stack()) {
3354 method_refs->remove_at(j);
3355 } else if (emcp_method_count == 0) {
3356 method->set_is_obsolete();
3357 } else {
3358 // RC_TRACE macro has an embedded ResourceMark
3359 RC_TRACE(0x00000200,
3360 ("purge: %s(%s): prev method @%d in version @%d is alive",
3361 method->name()->as_C_string(),
3362 method->signature()->as_C_string(), j, i));
3363 }
3364 }
3365 }
3366 }
3367 assert(ik->previous_versions()->length() == live_count, "sanity check");
3368 RC_TRACE(0x00000200,
3369 ("purge: previous version stats: live=%d, deleted=%d", live_count,
3370 deleted_count));
3371 }
3372 }
3374 // External interface for use during class unloading.
3375 void InstanceKlass::purge_previous_versions(InstanceKlass* ik) {
3376 // Call with >0 emcp methods since they are not currently being redefined.
3377 purge_previous_versions_internal(ik, 1);
3378 }
3381 // Potentially add an information node that contains pointers to the
3382 // interesting parts of the previous version of the_class.
3383 // This is also where we clean out any unused references.
3384 // Note that while we delete nodes from the _previous_versions
3385 // array, we never delete the array itself until the klass is
3386 // unloaded. The has_been_redefined() query depends on that fact.
3387 //
3388 void InstanceKlass::add_previous_version(instanceKlassHandle ikh,
3389 BitMap* emcp_methods, int emcp_method_count) {
3390 assert(Thread::current()->is_VM_thread(),
3391 "only VMThread can add previous versions");
3393 if (_previous_versions == NULL) {
3394 // This is the first previous version so make some space.
3395 // Start with 2 elements under the assumption that the class
3396 // won't be redefined much.
3397 _previous_versions = new (ResourceObj::C_HEAP, mtClass)
3398 GrowableArray<PreviousVersionNode *>(2, true);
3399 }
3401 ConstantPool* cp_ref = ikh->constants();
3403 // RC_TRACE macro has an embedded ResourceMark
3404 RC_TRACE(0x00000400, ("adding previous version ref for %s @%d, EMCP_cnt=%d "
3405 "on_stack=%d",
3406 ikh->external_name(), _previous_versions->length(), emcp_method_count,
3407 cp_ref->on_stack()));
3409 // If the constant pool for this previous version of the class
3410 // is not marked as being on the stack, then none of the methods
3411 // in this previous version of the class are on the stack so
3412 // we don't need to create a new PreviousVersionNode. However,
3413 // we still need to examine older previous versions below.
3414 Array<Method*>* old_methods = ikh->methods();
3416 if (cp_ref->on_stack()) {
3417 PreviousVersionNode * pv_node = NULL;
3418 if (emcp_method_count == 0) {
3419 // non-shared ConstantPool gets a reference
3420 pv_node = new PreviousVersionNode(cp_ref, !cp_ref->is_shared(), NULL);
3421 RC_TRACE(0x00000400,
3422 ("add: all methods are obsolete; flushing any EMCP refs"));
3423 } else {
3424 int local_count = 0;
3425 GrowableArray<Method*>* method_refs = new (ResourceObj::C_HEAP, mtClass)
3426 GrowableArray<Method*>(emcp_method_count, true);
3427 for (int i = 0; i < old_methods->length(); i++) {
3428 if (emcp_methods->at(i)) {
3429 // this old method is EMCP. Save it only if it's on the stack
3430 Method* old_method = old_methods->at(i);
3431 if (old_method->on_stack()) {
3432 method_refs->append(old_method);
3433 }
3434 if (++local_count >= emcp_method_count) {
3435 // no more EMCP methods so bail out now
3436 break;
3437 }
3438 }
3439 }
3440 // non-shared ConstantPool gets a reference
3441 pv_node = new PreviousVersionNode(cp_ref, !cp_ref->is_shared(), method_refs);
3442 }
3443 // append new previous version.
3444 _previous_versions->append(pv_node);
3445 }
3447 // Since the caller is the VMThread and we are at a safepoint, this
3448 // is a good time to clear out unused references.
3450 RC_TRACE(0x00000400, ("add: previous version length=%d",
3451 _previous_versions->length()));
3453 // Purge previous versions not executing on the stack
3454 purge_previous_versions_internal(this, emcp_method_count);
3456 int obsolete_method_count = old_methods->length() - emcp_method_count;
3458 if (emcp_method_count != 0 && obsolete_method_count != 0 &&
3459 _previous_versions->length() > 0) {
3460 // We have a mix of obsolete and EMCP methods so we have to
3461 // clear out any matching EMCP method entries the hard way.
3462 int local_count = 0;
3463 for (int i = 0; i < old_methods->length(); i++) {
3464 if (!emcp_methods->at(i)) {
3465 // only obsolete methods are interesting
3466 Method* old_method = old_methods->at(i);
3467 Symbol* m_name = old_method->name();
3468 Symbol* m_signature = old_method->signature();
3470 // we might not have added the last entry
3471 for (int j = _previous_versions->length() - 1; j >= 0; j--) {
3472 // check the previous versions array for non executing obsolete methods
3473 PreviousVersionNode * pv_node = _previous_versions->at(j);
3475 GrowableArray<Method*>* method_refs = pv_node->prev_EMCP_methods();
3476 if (method_refs == NULL) {
3477 // We have run into a PreviousVersion generation where
3478 // all methods were made obsolete during that generation's
3479 // RedefineClasses() operation. At the time of that
3480 // operation, all EMCP methods were flushed so we don't
3481 // have to go back any further.
3482 //
3483 // A NULL method_refs is different than an empty method_refs.
3484 // We cannot infer any optimizations about older generations
3485 // from an empty method_refs for the current generation.
3486 break;
3487 }
3489 for (int k = method_refs->length() - 1; k >= 0; k--) {
3490 Method* method = method_refs->at(k);
3492 if (!method->is_obsolete() &&
3493 method->name() == m_name &&
3494 method->signature() == m_signature) {
3495 // The current RedefineClasses() call has made all EMCP
3496 // versions of this method obsolete so mark it as obsolete
3497 // and remove the reference.
3498 RC_TRACE(0x00000400,
3499 ("add: %s(%s): flush obsolete method @%d in version @%d",
3500 m_name->as_C_string(), m_signature->as_C_string(), k, j));
3502 method->set_is_obsolete();
3503 // Leave obsolete methods on the previous version list to
3504 // clean up later.
3505 break;
3506 }
3507 }
3509 // The previous loop may not find a matching EMCP method, but
3510 // that doesn't mean that we can optimize and not go any
3511 // further back in the PreviousVersion generations. The EMCP
3512 // method for this generation could have already been deleted,
3513 // but there still may be an older EMCP method that has not
3514 // been deleted.
3515 }
3517 if (++local_count >= obsolete_method_count) {
3518 // no more obsolete methods so bail out now
3519 break;
3520 }
3521 }
3522 }
3523 }
3524 } // end add_previous_version()
3527 // Determine if InstanceKlass has a previous version.
3528 bool InstanceKlass::has_previous_version() const {
3529 return (_previous_versions != NULL && _previous_versions->length() > 0);
3530 } // end has_previous_version()
3533 Method* InstanceKlass::method_with_idnum(int idnum) {
3534 Method* m = NULL;
3535 if (idnum < methods()->length()) {
3536 m = methods()->at(idnum);
3537 }
3538 if (m == NULL || m->method_idnum() != idnum) {
3539 for (int index = 0; index < methods()->length(); ++index) {
3540 m = methods()->at(index);
3541 if (m->method_idnum() == idnum) {
3542 return m;
3543 }
3544 }
3545 }
3546 return m;
3547 }
3550 // Construct a PreviousVersionNode entry for the array hung off
3551 // the InstanceKlass.
3552 PreviousVersionNode::PreviousVersionNode(ConstantPool* prev_constant_pool,
3553 bool prev_cp_is_weak, GrowableArray<Method*>* prev_EMCP_methods) {
3555 _prev_constant_pool = prev_constant_pool;
3556 _prev_cp_is_weak = prev_cp_is_weak;
3557 _prev_EMCP_methods = prev_EMCP_methods;
3558 }
3561 // Destroy a PreviousVersionNode
3562 PreviousVersionNode::~PreviousVersionNode() {
3563 if (_prev_constant_pool != NULL) {
3564 _prev_constant_pool = NULL;
3565 }
3567 if (_prev_EMCP_methods != NULL) {
3568 delete _prev_EMCP_methods;
3569 }
3570 }
3573 // Construct a PreviousVersionInfo entry
3574 PreviousVersionInfo::PreviousVersionInfo(PreviousVersionNode *pv_node) {
3575 _prev_constant_pool_handle = constantPoolHandle(); // NULL handle
3576 _prev_EMCP_method_handles = NULL;
3578 ConstantPool* cp = pv_node->prev_constant_pool();
3579 assert(cp != NULL, "constant pool ref was unexpectedly cleared");
3580 if (cp == NULL) {
3581 return; // robustness
3582 }
3584 // make the ConstantPool* safe to return
3585 _prev_constant_pool_handle = constantPoolHandle(cp);
3587 GrowableArray<Method*>* method_refs = pv_node->prev_EMCP_methods();
3588 if (method_refs == NULL) {
3589 // the InstanceKlass did not have any EMCP methods
3590 return;
3591 }
3593 _prev_EMCP_method_handles = new GrowableArray<methodHandle>(10);
3595 int n_methods = method_refs->length();
3596 for (int i = 0; i < n_methods; i++) {
3597 Method* method = method_refs->at(i);
3598 assert (method != NULL, "method has been cleared");
3599 if (method == NULL) {
3600 continue; // robustness
3601 }
3602 // make the Method* safe to return
3603 _prev_EMCP_method_handles->append(methodHandle(method));
3604 }
3605 }
3608 // Destroy a PreviousVersionInfo
3609 PreviousVersionInfo::~PreviousVersionInfo() {
3610 // Since _prev_EMCP_method_handles is not C-heap allocated, we
3611 // don't have to delete it.
3612 }
3615 // Construct a helper for walking the previous versions array
3616 PreviousVersionWalker::PreviousVersionWalker(InstanceKlass *ik) {
3617 _previous_versions = ik->previous_versions();
3618 _current_index = 0;
3619 // _hm needs no initialization
3620 _current_p = NULL;
3621 }
3624 // Destroy a PreviousVersionWalker
3625 PreviousVersionWalker::~PreviousVersionWalker() {
3626 // Delete the current info just in case the caller didn't walk to
3627 // the end of the previous versions list. No harm if _current_p is
3628 // already NULL.
3629 delete _current_p;
3631 // When _hm is destroyed, all the Handles returned in
3632 // PreviousVersionInfo objects will be destroyed.
3633 // Also, after this destructor is finished it will be
3634 // safe to delete the GrowableArray allocated in the
3635 // PreviousVersionInfo objects.
3636 }
3639 // Return the interesting information for the next previous version
3640 // of the klass. Returns NULL if there are no more previous versions.
3641 PreviousVersionInfo* PreviousVersionWalker::next_previous_version() {
3642 if (_previous_versions == NULL) {
3643 // no previous versions so nothing to return
3644 return NULL;
3645 }
3647 delete _current_p; // cleanup the previous info for the caller
3648 _current_p = NULL; // reset to NULL so we don't delete same object twice
3650 int length = _previous_versions->length();
3652 while (_current_index < length) {
3653 PreviousVersionNode * pv_node = _previous_versions->at(_current_index++);
3654 PreviousVersionInfo * pv_info = new (ResourceObj::C_HEAP, mtClass)
3655 PreviousVersionInfo(pv_node);
3657 constantPoolHandle cp_h = pv_info->prev_constant_pool_handle();
3658 assert (!cp_h.is_null(), "null cp found in previous version");
3660 // The caller will need to delete pv_info when they are done with it.
3661 _current_p = pv_info;
3662 return pv_info;
3663 }
3665 // all of the underlying nodes' info has been deleted
3666 return NULL;
3667 } // end next_previous_version()