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