Thu, 03 Oct 2013 18:50:58 -0400
8025004: -XX:+CheckUnhandledOops asserts for JDK 8 Solaris fastdebug binaries
Summary: Remove unnecessary volatile keyword on stack locals within instanceKlass.cpp to work around Solaris Studio C++ compiler issue
Reviewed-by: coleenp, dcubed
Contributed-by: lois.foltan@oracle.com
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/jvmtiRedefineClasses.hpp"
52 #include "prims/methodComparator.hpp"
53 #include "runtime/fieldDescriptor.hpp"
54 #include "runtime/handles.inline.hpp"
55 #include "runtime/javaCalls.hpp"
56 #include "runtime/mutexLocker.hpp"
57 #include "runtime/thread.inline.hpp"
58 #include "services/classLoadingService.hpp"
59 #include "services/threadService.hpp"
60 #include "utilities/dtrace.hpp"
61 #include "utilities/macros.hpp"
62 #if INCLUDE_ALL_GCS
63 #include "gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp"
64 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
65 #include "gc_implementation/g1/g1OopClosures.inline.hpp"
66 #include "gc_implementation/g1/g1RemSet.inline.hpp"
67 #include "gc_implementation/g1/heapRegionSeq.inline.hpp"
68 #include "gc_implementation/parNew/parOopClosures.inline.hpp"
69 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.inline.hpp"
70 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
71 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
72 #include "oops/oop.pcgc.inline.hpp"
73 #endif // INCLUDE_ALL_GCS
74 #ifdef COMPILER1
75 #include "c1/c1_Compiler.hpp"
76 #endif
78 #ifdef DTRACE_ENABLED
80 #ifndef USDT2
82 HS_DTRACE_PROBE_DECL4(hotspot, class__initialization__required,
83 char*, intptr_t, oop, intptr_t);
84 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__recursive,
85 char*, intptr_t, oop, intptr_t, int);
86 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__concurrent,
87 char*, intptr_t, oop, intptr_t, int);
88 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__erroneous,
89 char*, intptr_t, oop, intptr_t, int);
90 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__super__failed,
91 char*, intptr_t, oop, intptr_t, int);
92 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__clinit,
93 char*, intptr_t, oop, intptr_t, int);
94 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__error,
95 char*, intptr_t, oop, intptr_t, int);
96 HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__end,
97 char*, intptr_t, oop, intptr_t, int);
99 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) \
100 { \
101 char* data = NULL; \
102 int len = 0; \
103 Symbol* name = (clss)->name(); \
104 if (name != NULL) { \
105 data = (char*)name->bytes(); \
106 len = name->utf8_length(); \
107 } \
108 HS_DTRACE_PROBE4(hotspot, class__initialization__##type, \
109 data, len, SOLARIS_ONLY((void *))(clss)->class_loader(), thread_type); \
110 }
112 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) \
113 { \
114 char* data = NULL; \
115 int len = 0; \
116 Symbol* name = (clss)->name(); \
117 if (name != NULL) { \
118 data = (char*)name->bytes(); \
119 len = name->utf8_length(); \
120 } \
121 HS_DTRACE_PROBE5(hotspot, class__initialization__##type, \
122 data, len, SOLARIS_ONLY((void *))(clss)->class_loader(), thread_type, wait); \
123 }
124 #else /* USDT2 */
126 #define HOTSPOT_CLASS_INITIALIZATION_required HOTSPOT_CLASS_INITIALIZATION_REQUIRED
127 #define HOTSPOT_CLASS_INITIALIZATION_recursive HOTSPOT_CLASS_INITIALIZATION_RECURSIVE
128 #define HOTSPOT_CLASS_INITIALIZATION_concurrent HOTSPOT_CLASS_INITIALIZATION_CONCURRENT
129 #define HOTSPOT_CLASS_INITIALIZATION_erroneous HOTSPOT_CLASS_INITIALIZATION_ERRONEOUS
130 #define HOTSPOT_CLASS_INITIALIZATION_super__failed HOTSPOT_CLASS_INITIALIZATION_SUPER_FAILED
131 #define HOTSPOT_CLASS_INITIALIZATION_clinit HOTSPOT_CLASS_INITIALIZATION_CLINIT
132 #define HOTSPOT_CLASS_INITIALIZATION_error HOTSPOT_CLASS_INITIALIZATION_ERROR
133 #define HOTSPOT_CLASS_INITIALIZATION_end HOTSPOT_CLASS_INITIALIZATION_END
134 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) \
135 { \
136 char* data = NULL; \
137 int len = 0; \
138 Symbol* name = (clss)->name(); \
139 if (name != NULL) { \
140 data = (char*)name->bytes(); \
141 len = name->utf8_length(); \
142 } \
143 HOTSPOT_CLASS_INITIALIZATION_##type( \
144 data, len, (clss)->class_loader(), thread_type); \
145 }
147 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) \
148 { \
149 char* data = NULL; \
150 int len = 0; \
151 Symbol* name = (clss)->name(); \
152 if (name != NULL) { \
153 data = (char*)name->bytes(); \
154 len = name->utf8_length(); \
155 } \
156 HOTSPOT_CLASS_INITIALIZATION_##type( \
157 data, len, (clss)->class_loader(), thread_type, wait); \
158 }
159 #endif /* USDT2 */
161 #else // ndef DTRACE_ENABLED
163 #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type)
164 #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait)
166 #endif // ndef DTRACE_ENABLED
168 volatile int InstanceKlass::_total_instanceKlass_count = 0;
170 InstanceKlass* InstanceKlass::allocate_instance_klass(
171 ClassLoaderData* loader_data,
172 int vtable_len,
173 int itable_len,
174 int static_field_size,
175 int nonstatic_oop_map_size,
176 ReferenceType rt,
177 AccessFlags access_flags,
178 Symbol* name,
179 Klass* super_klass,
180 bool is_anonymous,
181 TRAPS) {
183 int size = InstanceKlass::size(vtable_len, itable_len, nonstatic_oop_map_size,
184 access_flags.is_interface(), is_anonymous);
186 // Allocation
187 InstanceKlass* ik;
188 if (rt == REF_NONE) {
189 if (name == vmSymbols::java_lang_Class()) {
190 ik = new (loader_data, size, THREAD) InstanceMirrorKlass(
191 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
192 access_flags, is_anonymous);
193 } else if (name == vmSymbols::java_lang_ClassLoader() ||
194 (SystemDictionary::ClassLoader_klass_loaded() &&
195 super_klass != NULL &&
196 super_klass->is_subtype_of(SystemDictionary::ClassLoader_klass()))) {
197 ik = new (loader_data, size, THREAD) InstanceClassLoaderKlass(
198 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
199 access_flags, is_anonymous);
200 } else {
201 // normal class
202 ik = new (loader_data, size, THREAD) InstanceKlass(
203 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
204 access_flags, is_anonymous);
205 }
206 } else {
207 // reference klass
208 ik = new (loader_data, size, THREAD) InstanceRefKlass(
209 vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt,
210 access_flags, is_anonymous);
211 }
213 // Check for pending exception before adding to the loader data and incrementing
214 // class count. Can get OOM here.
215 if (HAS_PENDING_EXCEPTION) {
216 return NULL;
217 }
219 // Add all classes to our internal class loader list here,
220 // including classes in the bootstrap (NULL) class loader.
221 loader_data->add_class(ik);
223 Atomic::inc(&_total_instanceKlass_count);
224 return ik;
225 }
228 // copy method ordering from resource area to Metaspace
229 void InstanceKlass::copy_method_ordering(intArray* m, TRAPS) {
230 if (m != NULL) {
231 // allocate a new array and copy contents (memcpy?)
232 _method_ordering = MetadataFactory::new_array<int>(class_loader_data(), m->length(), CHECK);
233 for (int i = 0; i < m->length(); i++) {
234 _method_ordering->at_put(i, m->at(i));
235 }
236 } else {
237 _method_ordering = Universe::the_empty_int_array();
238 }
239 }
242 InstanceKlass::InstanceKlass(int vtable_len,
243 int itable_len,
244 int static_field_size,
245 int nonstatic_oop_map_size,
246 ReferenceType rt,
247 AccessFlags access_flags,
248 bool is_anonymous) {
249 No_Safepoint_Verifier no_safepoint; // until k becomes parsable
251 int iksize = InstanceKlass::size(vtable_len, itable_len, nonstatic_oop_map_size,
252 access_flags.is_interface(), is_anonymous);
254 set_vtable_length(vtable_len);
255 set_itable_length(itable_len);
256 set_static_field_size(static_field_size);
257 set_nonstatic_oop_map_size(nonstatic_oop_map_size);
258 set_access_flags(access_flags);
259 _misc_flags = 0; // initialize to zero
260 set_is_anonymous(is_anonymous);
261 assert(size() == iksize, "wrong size for object");
263 set_array_klasses(NULL);
264 set_methods(NULL);
265 set_method_ordering(NULL);
266 set_local_interfaces(NULL);
267 set_transitive_interfaces(NULL);
268 init_implementor();
269 set_fields(NULL, 0);
270 set_constants(NULL);
271 set_class_loader_data(NULL);
272 set_source_file_name_index(0);
273 set_source_debug_extension(NULL, 0);
274 set_array_name(NULL);
275 set_inner_classes(NULL);
276 set_static_oop_field_count(0);
277 set_nonstatic_field_size(0);
278 set_is_marked_dependent(false);
279 set_init_state(InstanceKlass::allocated);
280 set_init_thread(NULL);
281 set_reference_type(rt);
282 set_oop_map_cache(NULL);
283 set_jni_ids(NULL);
284 set_osr_nmethods_head(NULL);
285 set_breakpoints(NULL);
286 init_previous_versions();
287 set_generic_signature_index(0);
288 release_set_methods_jmethod_ids(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);
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 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 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 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 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 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->reinitialize(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->reinitialize(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 = fs.field_descriptor();
1254 cl->do_field(&fd);
1255 }
1256 }
1257 }
1260 void InstanceKlass::do_local_static_fields(void f(fieldDescriptor*, TRAPS), TRAPS) {
1261 instanceKlassHandle h_this(THREAD, this);
1262 do_local_static_fields_impl(h_this, f, CHECK);
1263 }
1266 void InstanceKlass::do_local_static_fields_impl(instanceKlassHandle this_oop, void f(fieldDescriptor* fd, TRAPS), TRAPS) {
1267 for (JavaFieldStream fs(this_oop()); !fs.done(); fs.next()) {
1268 if (fs.access_flags().is_static()) {
1269 fieldDescriptor& fd = fs.field_descriptor();
1270 f(&fd, CHECK);
1271 }
1272 }
1273 }
1276 static int compare_fields_by_offset(int* a, int* b) {
1277 return a[0] - b[0];
1278 }
1280 void InstanceKlass::do_nonstatic_fields(FieldClosure* cl) {
1281 InstanceKlass* super = superklass();
1282 if (super != NULL) {
1283 super->do_nonstatic_fields(cl);
1284 }
1285 fieldDescriptor fd;
1286 int length = java_fields_count();
1287 // In DebugInfo nonstatic fields are sorted by offset.
1288 int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1), mtClass);
1289 int j = 0;
1290 for (int i = 0; i < length; i += 1) {
1291 fd.reinitialize(this, i);
1292 if (!fd.is_static()) {
1293 fields_sorted[j + 0] = fd.offset();
1294 fields_sorted[j + 1] = i;
1295 j += 2;
1296 }
1297 }
1298 if (j > 0) {
1299 length = j;
1300 // _sort_Fn is defined in growableArray.hpp.
1301 qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset);
1302 for (int i = 0; i < length; i += 2) {
1303 fd.reinitialize(this, fields_sorted[i + 1]);
1304 assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields");
1305 cl->do_field(&fd);
1306 }
1307 }
1308 FREE_C_HEAP_ARRAY(int, fields_sorted, mtClass);
1309 }
1312 void InstanceKlass::array_klasses_do(void f(Klass* k, TRAPS), TRAPS) {
1313 if (array_klasses() != NULL)
1314 ArrayKlass::cast(array_klasses())->array_klasses_do(f, THREAD);
1315 }
1317 void InstanceKlass::array_klasses_do(void f(Klass* k)) {
1318 if (array_klasses() != NULL)
1319 ArrayKlass::cast(array_klasses())->array_klasses_do(f);
1320 }
1322 #ifdef ASSERT
1323 static int linear_search(Array<Method*>* methods, Symbol* name, Symbol* signature) {
1324 int len = methods->length();
1325 for (int index = 0; index < len; index++) {
1326 Method* m = methods->at(index);
1327 assert(m->is_method(), "must be method");
1328 if (m->signature() == signature && m->name() == name) {
1329 return index;
1330 }
1331 }
1332 return -1;
1333 }
1334 #endif
1336 static int binary_search(Array<Method*>* methods, Symbol* name) {
1337 int len = methods->length();
1338 // methods are sorted, so do binary search
1339 int l = 0;
1340 int h = len - 1;
1341 while (l <= h) {
1342 int mid = (l + h) >> 1;
1343 Method* m = methods->at(mid);
1344 assert(m->is_method(), "must be method");
1345 int res = m->name()->fast_compare(name);
1346 if (res == 0) {
1347 return mid;
1348 } else if (res < 0) {
1349 l = mid + 1;
1350 } else {
1351 h = mid - 1;
1352 }
1353 }
1354 return -1;
1355 }
1357 Method* InstanceKlass::find_method(Symbol* name, Symbol* signature) const {
1358 return InstanceKlass::find_method(methods(), name, signature);
1359 }
1361 Method* InstanceKlass::find_method(
1362 Array<Method*>* methods, Symbol* name, Symbol* signature) {
1363 int hit = binary_search(methods, name);
1364 if (hit != -1) {
1365 Method* m = methods->at(hit);
1366 // Do linear search to find matching signature. First, quick check
1367 // for common case
1368 if (m->signature() == signature) return m;
1369 // search downwards through overloaded methods
1370 int i;
1371 for (i = hit - 1; i >= 0; --i) {
1372 Method* m = methods->at(i);
1373 assert(m->is_method(), "must be method");
1374 if (m->name() != name) break;
1375 if (m->signature() == signature) return m;
1376 }
1377 // search upwards
1378 for (i = hit + 1; i < methods->length(); ++i) {
1379 Method* m = methods->at(i);
1380 assert(m->is_method(), "must be method");
1381 if (m->name() != name) break;
1382 if (m->signature() == signature) return m;
1383 }
1384 // not found
1385 #ifdef ASSERT
1386 int index = linear_search(methods, name, signature);
1387 assert(index == -1, err_msg("binary search should have found entry %d", index));
1388 #endif
1389 }
1390 return NULL;
1391 }
1393 int InstanceKlass::find_method_by_name(Symbol* name, int* end) {
1394 return find_method_by_name(methods(), name, end);
1395 }
1397 int InstanceKlass::find_method_by_name(
1398 Array<Method*>* methods, Symbol* name, int* end_ptr) {
1399 assert(end_ptr != NULL, "just checking");
1400 int start = binary_search(methods, name);
1401 int end = start + 1;
1402 if (start != -1) {
1403 while (start - 1 >= 0 && (methods->at(start - 1))->name() == name) --start;
1404 while (end < methods->length() && (methods->at(end))->name() == name) ++end;
1405 *end_ptr = end;
1406 return start;
1407 }
1408 return -1;
1409 }
1411 Method* InstanceKlass::uncached_lookup_method(Symbol* name, Symbol* signature) const {
1412 Klass* klass = const_cast<InstanceKlass*>(this);
1413 while (klass != NULL) {
1414 Method* method = InstanceKlass::cast(klass)->find_method(name, signature);
1415 if (method != NULL) return method;
1416 klass = InstanceKlass::cast(klass)->super();
1417 }
1418 return NULL;
1419 }
1421 // lookup a method in all the interfaces that this class implements
1422 // Do NOT return private or static methods, new in JDK8 which are not externally visible
1423 // They should only be found in the initial InterfaceMethodRef
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 && m->is_public() && !m->is_static()) {
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 //
1689 // Walk the list of dependent nmethods searching for nmethods which
1690 // are dependent on the changes that were passed in and mark them for
1691 // deoptimization. Returns the number of nmethods found.
1692 //
1693 int InstanceKlass::mark_dependent_nmethods(DepChange& changes) {
1694 assert_locked_or_safepoint(CodeCache_lock);
1695 int found = 0;
1696 nmethodBucket* b = _dependencies;
1697 while (b != NULL) {
1698 nmethod* nm = b->get_nmethod();
1699 // since dependencies aren't removed until an nmethod becomes a zombie,
1700 // the dependency list may contain nmethods which aren't alive.
1701 if (nm->is_alive() && !nm->is_marked_for_deoptimization() && nm->check_dependency_on(changes)) {
1702 if (TraceDependencies) {
1703 ResourceMark rm;
1704 tty->print_cr("Marked for deoptimization");
1705 tty->print_cr(" context = %s", this->external_name());
1706 changes.print();
1707 nm->print();
1708 nm->print_dependencies();
1709 }
1710 nm->mark_for_deoptimization();
1711 found++;
1712 }
1713 b = b->next();
1714 }
1715 return found;
1716 }
1719 //
1720 // Add an nmethodBucket to the list of dependencies for this nmethod.
1721 // It's possible that an nmethod has multiple dependencies on this klass
1722 // so a count is kept for each bucket to guarantee that creation and
1723 // deletion of dependencies is consistent.
1724 //
1725 void InstanceKlass::add_dependent_nmethod(nmethod* nm) {
1726 assert_locked_or_safepoint(CodeCache_lock);
1727 nmethodBucket* b = _dependencies;
1728 nmethodBucket* last = NULL;
1729 while (b != NULL) {
1730 if (nm == b->get_nmethod()) {
1731 b->increment();
1732 return;
1733 }
1734 b = b->next();
1735 }
1736 _dependencies = new nmethodBucket(nm, _dependencies);
1737 }
1740 //
1741 // Decrement count of the nmethod in the dependency list and remove
1742 // the bucket competely when the count goes to 0. This method must
1743 // find a corresponding bucket otherwise there's a bug in the
1744 // recording of dependecies.
1745 //
1746 void InstanceKlass::remove_dependent_nmethod(nmethod* nm) {
1747 assert_locked_or_safepoint(CodeCache_lock);
1748 nmethodBucket* b = _dependencies;
1749 nmethodBucket* last = NULL;
1750 while (b != NULL) {
1751 if (nm == b->get_nmethod()) {
1752 if (b->decrement() == 0) {
1753 if (last == NULL) {
1754 _dependencies = b->next();
1755 } else {
1756 last->set_next(b->next());
1757 }
1758 delete b;
1759 }
1760 return;
1761 }
1762 last = b;
1763 b = b->next();
1764 }
1765 #ifdef ASSERT
1766 tty->print_cr("### %s can't find dependent nmethod:", this->external_name());
1767 nm->print();
1768 #endif // ASSERT
1769 ShouldNotReachHere();
1770 }
1773 #ifndef PRODUCT
1774 void InstanceKlass::print_dependent_nmethods(bool verbose) {
1775 nmethodBucket* b = _dependencies;
1776 int idx = 0;
1777 while (b != NULL) {
1778 nmethod* nm = b->get_nmethod();
1779 tty->print("[%d] count=%d { ", idx++, b->count());
1780 if (!verbose) {
1781 nm->print_on(tty, "nmethod");
1782 tty->print_cr(" } ");
1783 } else {
1784 nm->print();
1785 nm->print_dependencies();
1786 tty->print_cr("--- } ");
1787 }
1788 b = b->next();
1789 }
1790 }
1793 bool InstanceKlass::is_dependent_nmethod(nmethod* nm) {
1794 nmethodBucket* b = _dependencies;
1795 while (b != NULL) {
1796 if (nm == b->get_nmethod()) {
1797 return true;
1798 }
1799 b = b->next();
1800 }
1801 return false;
1802 }
1803 #endif //PRODUCT
1806 // Garbage collection
1808 #ifdef ASSERT
1809 template <class T> void assert_is_in(T *p) {
1810 T heap_oop = oopDesc::load_heap_oop(p);
1811 if (!oopDesc::is_null(heap_oop)) {
1812 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
1813 assert(Universe::heap()->is_in(o), "should be in heap");
1814 }
1815 }
1816 template <class T> void assert_is_in_closed_subset(T *p) {
1817 T heap_oop = oopDesc::load_heap_oop(p);
1818 if (!oopDesc::is_null(heap_oop)) {
1819 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
1820 assert(Universe::heap()->is_in_closed_subset(o),
1821 err_msg("should be in closed *p " INTPTR_FORMAT " " INTPTR_FORMAT, (address)p, (address)o));
1822 }
1823 }
1824 template <class T> void assert_is_in_reserved(T *p) {
1825 T heap_oop = oopDesc::load_heap_oop(p);
1826 if (!oopDesc::is_null(heap_oop)) {
1827 oop o = oopDesc::decode_heap_oop_not_null(heap_oop);
1828 assert(Universe::heap()->is_in_reserved(o), "should be in reserved");
1829 }
1830 }
1831 template <class T> void assert_nothing(T *p) {}
1833 #else
1834 template <class T> void assert_is_in(T *p) {}
1835 template <class T> void assert_is_in_closed_subset(T *p) {}
1836 template <class T> void assert_is_in_reserved(T *p) {}
1837 template <class T> void assert_nothing(T *p) {}
1838 #endif // ASSERT
1840 //
1841 // Macros that iterate over areas of oops which are specialized on type of
1842 // oop pointer either narrow or wide, depending on UseCompressedOops
1843 //
1844 // Parameters are:
1845 // T - type of oop to point to (either oop or narrowOop)
1846 // start_p - starting pointer for region to iterate over
1847 // count - number of oops or narrowOops to iterate over
1848 // do_oop - action to perform on each oop (it's arbitrary C code which
1849 // makes it more efficient to put in a macro rather than making
1850 // it a template function)
1851 // assert_fn - assert function which is template function because performance
1852 // doesn't matter when enabled.
1853 #define InstanceKlass_SPECIALIZED_OOP_ITERATE( \
1854 T, start_p, count, do_oop, \
1855 assert_fn) \
1856 { \
1857 T* p = (T*)(start_p); \
1858 T* const end = p + (count); \
1859 while (p < end) { \
1860 (assert_fn)(p); \
1861 do_oop; \
1862 ++p; \
1863 } \
1864 }
1866 #define InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE( \
1867 T, start_p, count, do_oop, \
1868 assert_fn) \
1869 { \
1870 T* const start = (T*)(start_p); \
1871 T* p = start + (count); \
1872 while (start < p) { \
1873 --p; \
1874 (assert_fn)(p); \
1875 do_oop; \
1876 } \
1877 }
1879 #define InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE( \
1880 T, start_p, count, low, high, \
1881 do_oop, assert_fn) \
1882 { \
1883 T* const l = (T*)(low); \
1884 T* const h = (T*)(high); \
1885 assert(mask_bits((intptr_t)l, sizeof(T)-1) == 0 && \
1886 mask_bits((intptr_t)h, sizeof(T)-1) == 0, \
1887 "bounded region must be properly aligned"); \
1888 T* p = (T*)(start_p); \
1889 T* end = p + (count); \
1890 if (p < l) p = l; \
1891 if (end > h) end = h; \
1892 while (p < end) { \
1893 (assert_fn)(p); \
1894 do_oop; \
1895 ++p; \
1896 } \
1897 }
1900 // The following macros call specialized macros, passing either oop or
1901 // narrowOop as the specialization type. These test the UseCompressedOops
1902 // flag.
1903 #define InstanceKlass_OOP_MAP_ITERATE(obj, do_oop, assert_fn) \
1904 { \
1905 /* Compute oopmap block range. The common case \
1906 is nonstatic_oop_map_size == 1. */ \
1907 OopMapBlock* map = start_of_nonstatic_oop_maps(); \
1908 OopMapBlock* const end_map = map + nonstatic_oop_map_count(); \
1909 if (UseCompressedOops) { \
1910 while (map < end_map) { \
1911 InstanceKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \
1912 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \
1913 do_oop, assert_fn) \
1914 ++map; \
1915 } \
1916 } else { \
1917 while (map < end_map) { \
1918 InstanceKlass_SPECIALIZED_OOP_ITERATE(oop, \
1919 obj->obj_field_addr<oop>(map->offset()), map->count(), \
1920 do_oop, assert_fn) \
1921 ++map; \
1922 } \
1923 } \
1924 }
1926 #define InstanceKlass_OOP_MAP_REVERSE_ITERATE(obj, do_oop, assert_fn) \
1927 { \
1928 OopMapBlock* const start_map = start_of_nonstatic_oop_maps(); \
1929 OopMapBlock* map = start_map + nonstatic_oop_map_count(); \
1930 if (UseCompressedOops) { \
1931 while (start_map < map) { \
1932 --map; \
1933 InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(narrowOop, \
1934 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \
1935 do_oop, assert_fn) \
1936 } \
1937 } else { \
1938 while (start_map < map) { \
1939 --map; \
1940 InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(oop, \
1941 obj->obj_field_addr<oop>(map->offset()), map->count(), \
1942 do_oop, assert_fn) \
1943 } \
1944 } \
1945 }
1947 #define InstanceKlass_BOUNDED_OOP_MAP_ITERATE(obj, low, high, do_oop, \
1948 assert_fn) \
1949 { \
1950 /* Compute oopmap block range. The common case is \
1951 nonstatic_oop_map_size == 1, so we accept the \
1952 usually non-existent extra overhead of examining \
1953 all the maps. */ \
1954 OopMapBlock* map = start_of_nonstatic_oop_maps(); \
1955 OopMapBlock* const end_map = map + nonstatic_oop_map_count(); \
1956 if (UseCompressedOops) { \
1957 while (map < end_map) { \
1958 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \
1959 obj->obj_field_addr<narrowOop>(map->offset()), map->count(), \
1960 low, high, \
1961 do_oop, assert_fn) \
1962 ++map; \
1963 } \
1964 } else { \
1965 while (map < end_map) { \
1966 InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \
1967 obj->obj_field_addr<oop>(map->offset()), map->count(), \
1968 low, high, \
1969 do_oop, assert_fn) \
1970 ++map; \
1971 } \
1972 } \
1973 }
1975 void InstanceKlass::oop_follow_contents(oop obj) {
1976 assert(obj != NULL, "can't follow the content of NULL object");
1977 MarkSweep::follow_klass(obj->klass());
1978 InstanceKlass_OOP_MAP_ITERATE( \
1979 obj, \
1980 MarkSweep::mark_and_push(p), \
1981 assert_is_in_closed_subset)
1982 }
1984 #if INCLUDE_ALL_GCS
1985 void InstanceKlass::oop_follow_contents(ParCompactionManager* cm,
1986 oop obj) {
1987 assert(obj != NULL, "can't follow the content of NULL object");
1988 PSParallelCompact::follow_klass(cm, obj->klass());
1989 // Only mark the header and let the scan of the meta-data mark
1990 // everything else.
1991 InstanceKlass_OOP_MAP_ITERATE( \
1992 obj, \
1993 PSParallelCompact::mark_and_push(cm, p), \
1994 assert_is_in)
1995 }
1996 #endif // INCLUDE_ALL_GCS
1998 // closure's do_metadata() method dictates whether the given closure should be
1999 // applied to the klass ptr in the object header.
2001 #define if_do_metadata_checked(closure, nv_suffix) \
2002 /* Make sure the non-virtual and the virtual versions match. */ \
2003 assert(closure->do_metadata##nv_suffix() == closure->do_metadata(), \
2004 "Inconsistency in do_metadata"); \
2005 if (closure->do_metadata##nv_suffix())
2007 #define InstanceKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \
2008 \
2009 int InstanceKlass::oop_oop_iterate##nv_suffix(oop obj, OopClosureType* closure) { \
2010 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\
2011 /* header */ \
2012 if_do_metadata_checked(closure, nv_suffix) { \
2013 closure->do_klass##nv_suffix(obj->klass()); \
2014 } \
2015 InstanceKlass_OOP_MAP_ITERATE( \
2016 obj, \
2017 SpecializationStats:: \
2018 record_do_oop_call##nv_suffix(SpecializationStats::ik); \
2019 (closure)->do_oop##nv_suffix(p), \
2020 assert_is_in_closed_subset) \
2021 return size_helper(); \
2022 }
2024 #if INCLUDE_ALL_GCS
2025 #define InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \
2026 \
2027 int InstanceKlass::oop_oop_iterate_backwards##nv_suffix(oop obj, \
2028 OopClosureType* closure) { \
2029 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik); \
2030 /* header */ \
2031 if_do_metadata_checked(closure, nv_suffix) { \
2032 closure->do_klass##nv_suffix(obj->klass()); \
2033 } \
2034 /* instance variables */ \
2035 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \
2036 obj, \
2037 SpecializationStats::record_do_oop_call##nv_suffix(SpecializationStats::ik);\
2038 (closure)->do_oop##nv_suffix(p), \
2039 assert_is_in_closed_subset) \
2040 return size_helper(); \
2041 }
2042 #endif // INCLUDE_ALL_GCS
2044 #define InstanceKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \
2045 \
2046 int InstanceKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \
2047 OopClosureType* closure, \
2048 MemRegion mr) { \
2049 SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\
2050 if_do_metadata_checked(closure, nv_suffix) { \
2051 if (mr.contains(obj)) { \
2052 closure->do_klass##nv_suffix(obj->klass()); \
2053 } \
2054 } \
2055 InstanceKlass_BOUNDED_OOP_MAP_ITERATE( \
2056 obj, mr.start(), mr.end(), \
2057 (closure)->do_oop##nv_suffix(p), \
2058 assert_is_in_closed_subset) \
2059 return size_helper(); \
2060 }
2062 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN)
2063 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN)
2064 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN_m)
2065 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN_m)
2066 #if INCLUDE_ALL_GCS
2067 ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN)
2068 ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN)
2069 #endif // INCLUDE_ALL_GCS
2071 int InstanceKlass::oop_adjust_pointers(oop obj) {
2072 int size = size_helper();
2073 InstanceKlass_OOP_MAP_ITERATE( \
2074 obj, \
2075 MarkSweep::adjust_pointer(p), \
2076 assert_is_in)
2077 MarkSweep::adjust_klass(obj->klass());
2078 return size;
2079 }
2081 #if INCLUDE_ALL_GCS
2082 void InstanceKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
2083 InstanceKlass_OOP_MAP_REVERSE_ITERATE( \
2084 obj, \
2085 if (PSScavenge::should_scavenge(p)) { \
2086 pm->claim_or_forward_depth(p); \
2087 }, \
2088 assert_nothing )
2089 }
2091 int InstanceKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
2092 int size = size_helper();
2093 InstanceKlass_OOP_MAP_ITERATE( \
2094 obj, \
2095 PSParallelCompact::adjust_pointer(p), \
2096 assert_is_in)
2097 obj->update_header(cm);
2098 return size;
2099 }
2101 #endif // INCLUDE_ALL_GCS
2103 void InstanceKlass::clean_implementors_list(BoolObjectClosure* is_alive) {
2104 assert(is_loader_alive(is_alive), "this klass should be live");
2105 if (is_interface()) {
2106 if (ClassUnloading) {
2107 Klass* impl = implementor();
2108 if (impl != NULL) {
2109 if (!impl->is_loader_alive(is_alive)) {
2110 // remove this guy
2111 Klass** klass = adr_implementor();
2112 assert(klass != NULL, "null klass");
2113 if (klass != NULL) {
2114 *klass = NULL;
2115 }
2116 }
2117 }
2118 }
2119 }
2120 }
2122 void InstanceKlass::clean_method_data(BoolObjectClosure* is_alive) {
2123 for (int m = 0; m < methods()->length(); m++) {
2124 MethodData* mdo = methods()->at(m)->method_data();
2125 if (mdo != NULL) {
2126 for (ProfileData* data = mdo->first_data();
2127 mdo->is_valid(data);
2128 data = mdo->next_data(data)) {
2129 data->clean_weak_klass_links(is_alive);
2130 }
2131 }
2132 }
2133 }
2136 static void remove_unshareable_in_class(Klass* k) {
2137 // remove klass's unshareable info
2138 k->remove_unshareable_info();
2139 }
2141 void InstanceKlass::remove_unshareable_info() {
2142 Klass::remove_unshareable_info();
2143 // Unlink the class
2144 if (is_linked()) {
2145 unlink_class();
2146 }
2147 init_implementor();
2149 constants()->remove_unshareable_info();
2151 for (int i = 0; i < methods()->length(); i++) {
2152 Method* m = methods()->at(i);
2153 m->remove_unshareable_info();
2154 }
2156 // do array classes also.
2157 array_klasses_do(remove_unshareable_in_class);
2158 }
2160 void restore_unshareable_in_class(Klass* k, TRAPS) {
2161 k->restore_unshareable_info(CHECK);
2162 }
2164 void InstanceKlass::restore_unshareable_info(TRAPS) {
2165 Klass::restore_unshareable_info(CHECK);
2166 instanceKlassHandle ik(THREAD, this);
2168 Array<Method*>* methods = ik->methods();
2169 int num_methods = methods->length();
2170 for (int index2 = 0; index2 < num_methods; ++index2) {
2171 methodHandle m(THREAD, methods->at(index2));
2172 m()->link_method(m, CHECK);
2173 // restore method's vtable by calling a virtual function
2174 m->restore_vtable();
2175 }
2176 if (JvmtiExport::has_redefined_a_class()) {
2177 // Reinitialize vtable because RedefineClasses may have changed some
2178 // entries in this vtable for super classes so the CDS vtable might
2179 // point to old or obsolete entries. RedefineClasses doesn't fix up
2180 // vtables in the shared system dictionary, only the main one.
2181 // It also redefines the itable too so fix that too.
2182 ResourceMark rm(THREAD);
2183 ik->vtable()->initialize_vtable(false, CHECK);
2184 ik->itable()->initialize_itable(false, CHECK);
2185 }
2187 // restore constant pool resolved references
2188 ik->constants()->restore_unshareable_info(CHECK);
2190 ik->array_klasses_do(restore_unshareable_in_class, CHECK);
2191 }
2193 static void clear_all_breakpoints(Method* m) {
2194 m->clear_all_breakpoints();
2195 }
2198 void InstanceKlass::notify_unload_class(InstanceKlass* ik) {
2199 // notify the debugger
2200 if (JvmtiExport::should_post_class_unload()) {
2201 JvmtiExport::post_class_unload(ik);
2202 }
2204 // notify ClassLoadingService of class unload
2205 ClassLoadingService::notify_class_unloaded(ik);
2206 }
2208 void InstanceKlass::release_C_heap_structures(InstanceKlass* ik) {
2209 // Clean up C heap
2210 ik->release_C_heap_structures();
2211 ik->constants()->release_C_heap_structures();
2212 }
2214 void InstanceKlass::release_C_heap_structures() {
2216 // Can't release the constant pool here because the constant pool can be
2217 // deallocated separately from the InstanceKlass for default methods and
2218 // redefine classes.
2220 // Deallocate oop map cache
2221 if (_oop_map_cache != NULL) {
2222 delete _oop_map_cache;
2223 _oop_map_cache = NULL;
2224 }
2226 // Deallocate JNI identifiers for jfieldIDs
2227 JNIid::deallocate(jni_ids());
2228 set_jni_ids(NULL);
2230 jmethodID* jmeths = methods_jmethod_ids_acquire();
2231 if (jmeths != (jmethodID*)NULL) {
2232 release_set_methods_jmethod_ids(NULL);
2233 FreeHeap(jmeths);
2234 }
2236 // Deallocate MemberNameTable
2237 {
2238 Mutex* lock_or_null = SafepointSynchronize::is_at_safepoint() ? NULL : MemberNameTable_lock;
2239 MutexLockerEx ml(lock_or_null, Mutex::_no_safepoint_check_flag);
2240 MemberNameTable* mnt = member_names();
2241 if (mnt != NULL) {
2242 delete mnt;
2243 set_member_names(NULL);
2244 }
2245 }
2247 // release dependencies
2248 nmethodBucket* b = _dependencies;
2249 _dependencies = NULL;
2250 while (b != NULL) {
2251 nmethodBucket* next = b->next();
2252 delete b;
2253 b = next;
2254 }
2256 // Deallocate breakpoint records
2257 if (breakpoints() != 0x0) {
2258 methods_do(clear_all_breakpoints);
2259 assert(breakpoints() == 0x0, "should have cleared breakpoints");
2260 }
2262 // deallocate information about previous versions
2263 if (_previous_versions != NULL) {
2264 for (int i = _previous_versions->length() - 1; i >= 0; i--) {
2265 PreviousVersionNode * pv_node = _previous_versions->at(i);
2266 delete pv_node;
2267 }
2268 delete _previous_versions;
2269 _previous_versions = NULL;
2270 }
2272 // deallocate the cached class file
2273 if (_cached_class_file != NULL) {
2274 os::free(_cached_class_file, mtClass);
2275 _cached_class_file = NULL;
2276 }
2278 // Decrement symbol reference counts associated with the unloaded class.
2279 if (_name != NULL) _name->decrement_refcount();
2280 // unreference array name derived from this class name (arrays of an unloaded
2281 // class can't be referenced anymore).
2282 if (_array_name != NULL) _array_name->decrement_refcount();
2283 if (_source_debug_extension != NULL) FREE_C_HEAP_ARRAY(char, _source_debug_extension, mtClass);
2285 assert(_total_instanceKlass_count >= 1, "Sanity check");
2286 Atomic::dec(&_total_instanceKlass_count);
2287 }
2289 void InstanceKlass::set_source_debug_extension(char* array, int length) {
2290 if (array == NULL) {
2291 _source_debug_extension = NULL;
2292 } else {
2293 // Adding one to the attribute length in order to store a null terminator
2294 // character could cause an overflow because the attribute length is
2295 // already coded with an u4 in the classfile, but in practice, it's
2296 // unlikely to happen.
2297 assert((length+1) > length, "Overflow checking");
2298 char* sde = NEW_C_HEAP_ARRAY(char, (length + 1), mtClass);
2299 for (int i = 0; i < length; i++) {
2300 sde[i] = array[i];
2301 }
2302 sde[length] = '\0';
2303 _source_debug_extension = sde;
2304 }
2305 }
2307 address InstanceKlass::static_field_addr(int offset) {
2308 return (address)(offset + InstanceMirrorKlass::offset_of_static_fields() + cast_from_oop<intptr_t>(java_mirror()));
2309 }
2312 const char* InstanceKlass::signature_name() const {
2313 const char* src = (const char*) (name()->as_C_string());
2314 const int src_length = (int)strlen(src);
2315 char* dest = NEW_RESOURCE_ARRAY(char, src_length + 3);
2316 int src_index = 0;
2317 int dest_index = 0;
2318 dest[dest_index++] = 'L';
2319 while (src_index < src_length) {
2320 dest[dest_index++] = src[src_index++];
2321 }
2322 dest[dest_index++] = ';';
2323 dest[dest_index] = '\0';
2324 return dest;
2325 }
2327 // different verisons of is_same_class_package
2328 bool InstanceKlass::is_same_class_package(Klass* class2) {
2329 Klass* class1 = this;
2330 oop classloader1 = InstanceKlass::cast(class1)->class_loader();
2331 Symbol* classname1 = class1->name();
2333 if (class2->oop_is_objArray()) {
2334 class2 = ObjArrayKlass::cast(class2)->bottom_klass();
2335 }
2336 oop classloader2;
2337 if (class2->oop_is_instance()) {
2338 classloader2 = InstanceKlass::cast(class2)->class_loader();
2339 } else {
2340 assert(class2->oop_is_typeArray(), "should be type array");
2341 classloader2 = NULL;
2342 }
2343 Symbol* classname2 = class2->name();
2345 return InstanceKlass::is_same_class_package(classloader1, classname1,
2346 classloader2, classname2);
2347 }
2349 bool InstanceKlass::is_same_class_package(oop classloader2, Symbol* classname2) {
2350 Klass* class1 = this;
2351 oop classloader1 = InstanceKlass::cast(class1)->class_loader();
2352 Symbol* classname1 = class1->name();
2354 return InstanceKlass::is_same_class_package(classloader1, classname1,
2355 classloader2, classname2);
2356 }
2358 // return true if two classes are in the same package, classloader
2359 // and classname information is enough to determine a class's package
2360 bool InstanceKlass::is_same_class_package(oop class_loader1, Symbol* class_name1,
2361 oop class_loader2, Symbol* class_name2) {
2362 if (class_loader1 != class_loader2) {
2363 return false;
2364 } else if (class_name1 == class_name2) {
2365 return true; // skip painful bytewise comparison
2366 } else {
2367 ResourceMark rm;
2369 // The Symbol*'s are in UTF8 encoding. Since we only need to check explicitly
2370 // for ASCII characters ('/', 'L', '['), we can keep them in UTF8 encoding.
2371 // Otherwise, we just compare jbyte values between the strings.
2372 const jbyte *name1 = class_name1->base();
2373 const jbyte *name2 = class_name2->base();
2375 const jbyte *last_slash1 = UTF8::strrchr(name1, class_name1->utf8_length(), '/');
2376 const jbyte *last_slash2 = UTF8::strrchr(name2, class_name2->utf8_length(), '/');
2378 if ((last_slash1 == NULL) || (last_slash2 == NULL)) {
2379 // One of the two doesn't have a package. Only return true
2380 // if the other one also doesn't have a package.
2381 return last_slash1 == last_slash2;
2382 } else {
2383 // Skip over '['s
2384 if (*name1 == '[') {
2385 do {
2386 name1++;
2387 } while (*name1 == '[');
2388 if (*name1 != 'L') {
2389 // Something is terribly wrong. Shouldn't be here.
2390 return false;
2391 }
2392 }
2393 if (*name2 == '[') {
2394 do {
2395 name2++;
2396 } while (*name2 == '[');
2397 if (*name2 != 'L') {
2398 // Something is terribly wrong. Shouldn't be here.
2399 return false;
2400 }
2401 }
2403 // Check that package part is identical
2404 int length1 = last_slash1 - name1;
2405 int length2 = last_slash2 - name2;
2407 return UTF8::equal(name1, length1, name2, length2);
2408 }
2409 }
2410 }
2412 // Returns true iff super_method can be overridden by a method in targetclassname
2413 // See JSL 3rd edition 8.4.6.1
2414 // Assumes name-signature match
2415 // "this" is InstanceKlass of super_method which must exist
2416 // note that the InstanceKlass of the method in the targetclassname has not always been created yet
2417 bool InstanceKlass::is_override(methodHandle super_method, Handle targetclassloader, Symbol* targetclassname, TRAPS) {
2418 // Private methods can not be overridden
2419 if (super_method->is_private()) {
2420 return false;
2421 }
2422 // If super method is accessible, then override
2423 if ((super_method->is_protected()) ||
2424 (super_method->is_public())) {
2425 return true;
2426 }
2427 // Package-private methods are not inherited outside of package
2428 assert(super_method->is_package_private(), "must be package private");
2429 return(is_same_class_package(targetclassloader(), targetclassname));
2430 }
2432 /* defined for now in jvm.cpp, for historical reasons *--
2433 Klass* InstanceKlass::compute_enclosing_class_impl(instanceKlassHandle self,
2434 Symbol*& simple_name_result, TRAPS) {
2435 ...
2436 }
2437 */
2439 // tell if two classes have the same enclosing class (at package level)
2440 bool InstanceKlass::is_same_package_member_impl(instanceKlassHandle class1,
2441 Klass* class2_oop, TRAPS) {
2442 if (class2_oop == class1()) return true;
2443 if (!class2_oop->oop_is_instance()) return false;
2444 instanceKlassHandle class2(THREAD, class2_oop);
2446 // must be in same package before we try anything else
2447 if (!class1->is_same_class_package(class2->class_loader(), class2->name()))
2448 return false;
2450 // As long as there is an outer1.getEnclosingClass,
2451 // shift the search outward.
2452 instanceKlassHandle outer1 = class1;
2453 for (;;) {
2454 // As we walk along, look for equalities between outer1 and class2.
2455 // Eventually, the walks will terminate as outer1 stops
2456 // at the top-level class around the original class.
2457 bool ignore_inner_is_member;
2458 Klass* next = outer1->compute_enclosing_class(&ignore_inner_is_member,
2459 CHECK_false);
2460 if (next == NULL) break;
2461 if (next == class2()) return true;
2462 outer1 = instanceKlassHandle(THREAD, next);
2463 }
2465 // Now do the same for class2.
2466 instanceKlassHandle outer2 = class2;
2467 for (;;) {
2468 bool ignore_inner_is_member;
2469 Klass* next = outer2->compute_enclosing_class(&ignore_inner_is_member,
2470 CHECK_false);
2471 if (next == NULL) break;
2472 // Might as well check the new outer against all available values.
2473 if (next == class1()) return true;
2474 if (next == outer1()) return true;
2475 outer2 = instanceKlassHandle(THREAD, next);
2476 }
2478 // If by this point we have not found an equality between the
2479 // two classes, we know they are in separate package members.
2480 return false;
2481 }
2484 jint InstanceKlass::compute_modifier_flags(TRAPS) const {
2485 jint access = access_flags().as_int();
2487 // But check if it happens to be member class.
2488 instanceKlassHandle ik(THREAD, this);
2489 InnerClassesIterator iter(ik);
2490 for (; !iter.done(); iter.next()) {
2491 int ioff = iter.inner_class_info_index();
2492 // Inner class attribute can be zero, skip it.
2493 // Strange but true: JVM spec. allows null inner class refs.
2494 if (ioff == 0) continue;
2496 // only look at classes that are already loaded
2497 // since we are looking for the flags for our self.
2498 Symbol* inner_name = ik->constants()->klass_name_at(ioff);
2499 if ((ik->name() == inner_name)) {
2500 // This is really a member class.
2501 access = iter.inner_access_flags();
2502 break;
2503 }
2504 }
2505 // Remember to strip ACC_SUPER bit
2506 return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS;
2507 }
2509 jint InstanceKlass::jvmti_class_status() const {
2510 jint result = 0;
2512 if (is_linked()) {
2513 result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED;
2514 }
2516 if (is_initialized()) {
2517 assert(is_linked(), "Class status is not consistent");
2518 result |= JVMTI_CLASS_STATUS_INITIALIZED;
2519 }
2520 if (is_in_error_state()) {
2521 result |= JVMTI_CLASS_STATUS_ERROR;
2522 }
2523 return result;
2524 }
2526 Method* InstanceKlass::method_at_itable(Klass* holder, int index, TRAPS) {
2527 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable();
2528 int method_table_offset_in_words = ioe->offset()/wordSize;
2529 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words())
2530 / itableOffsetEntry::size();
2532 for (int cnt = 0 ; ; cnt ++, ioe ++) {
2533 // If the interface isn't implemented by the receiver class,
2534 // the VM should throw IncompatibleClassChangeError.
2535 if (cnt >= nof_interfaces) {
2536 THROW_NULL(vmSymbols::java_lang_IncompatibleClassChangeError());
2537 }
2539 Klass* ik = ioe->interface_klass();
2540 if (ik == holder) break;
2541 }
2543 itableMethodEntry* ime = ioe->first_method_entry(this);
2544 Method* m = ime[index].method();
2545 if (m == NULL) {
2546 THROW_NULL(vmSymbols::java_lang_AbstractMethodError());
2547 }
2548 return m;
2549 }
2551 // On-stack replacement stuff
2552 void InstanceKlass::add_osr_nmethod(nmethod* n) {
2553 // only one compilation can be active
2554 NEEDS_CLEANUP
2555 // This is a short non-blocking critical region, so the no safepoint check is ok.
2556 OsrList_lock->lock_without_safepoint_check();
2557 assert(n->is_osr_method(), "wrong kind of nmethod");
2558 n->set_osr_link(osr_nmethods_head());
2559 set_osr_nmethods_head(n);
2560 // Raise the highest osr level if necessary
2561 if (TieredCompilation) {
2562 Method* m = n->method();
2563 m->set_highest_osr_comp_level(MAX2(m->highest_osr_comp_level(), n->comp_level()));
2564 }
2565 // Remember to unlock again
2566 OsrList_lock->unlock();
2568 // Get rid of the osr methods for the same bci that have lower levels.
2569 if (TieredCompilation) {
2570 for (int l = CompLevel_limited_profile; l < n->comp_level(); l++) {
2571 nmethod *inv = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), l, true);
2572 if (inv != NULL && inv->is_in_use()) {
2573 inv->make_not_entrant();
2574 }
2575 }
2576 }
2577 }
2580 void InstanceKlass::remove_osr_nmethod(nmethod* n) {
2581 // This is a short non-blocking critical region, so the no safepoint check is ok.
2582 OsrList_lock->lock_without_safepoint_check();
2583 assert(n->is_osr_method(), "wrong kind of nmethod");
2584 nmethod* last = NULL;
2585 nmethod* cur = osr_nmethods_head();
2586 int max_level = CompLevel_none; // Find the max comp level excluding n
2587 Method* m = n->method();
2588 // Search for match
2589 while(cur != NULL && cur != n) {
2590 if (TieredCompilation) {
2591 // Find max level before n
2592 max_level = MAX2(max_level, cur->comp_level());
2593 }
2594 last = cur;
2595 cur = cur->osr_link();
2596 }
2597 nmethod* next = NULL;
2598 if (cur == n) {
2599 next = cur->osr_link();
2600 if (last == NULL) {
2601 // Remove first element
2602 set_osr_nmethods_head(next);
2603 } else {
2604 last->set_osr_link(next);
2605 }
2606 }
2607 n->set_osr_link(NULL);
2608 if (TieredCompilation) {
2609 cur = next;
2610 while (cur != NULL) {
2611 // Find max level after n
2612 max_level = MAX2(max_level, cur->comp_level());
2613 cur = cur->osr_link();
2614 }
2615 m->set_highest_osr_comp_level(max_level);
2616 }
2617 // Remember to unlock again
2618 OsrList_lock->unlock();
2619 }
2621 nmethod* InstanceKlass::lookup_osr_nmethod(const Method* m, int bci, int comp_level, bool match_level) const {
2622 // This is a short non-blocking critical region, so the no safepoint check is ok.
2623 OsrList_lock->lock_without_safepoint_check();
2624 nmethod* osr = osr_nmethods_head();
2625 nmethod* best = NULL;
2626 while (osr != NULL) {
2627 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
2628 // There can be a time when a c1 osr method exists but we are waiting
2629 // for a c2 version. When c2 completes its osr nmethod we will trash
2630 // the c1 version and only be able to find the c2 version. However
2631 // while we overflow in the c1 code at back branches we don't want to
2632 // try and switch to the same code as we are already running
2634 if (osr->method() == m &&
2635 (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) {
2636 if (match_level) {
2637 if (osr->comp_level() == comp_level) {
2638 // Found a match - return it.
2639 OsrList_lock->unlock();
2640 return osr;
2641 }
2642 } else {
2643 if (best == NULL || (osr->comp_level() > best->comp_level())) {
2644 if (osr->comp_level() == CompLevel_highest_tier) {
2645 // Found the best possible - return it.
2646 OsrList_lock->unlock();
2647 return osr;
2648 }
2649 best = osr;
2650 }
2651 }
2652 }
2653 osr = osr->osr_link();
2654 }
2655 OsrList_lock->unlock();
2656 if (best != NULL && best->comp_level() >= comp_level && match_level == false) {
2657 return best;
2658 }
2659 return NULL;
2660 }
2662 void InstanceKlass::add_member_name(int index, Handle mem_name) {
2663 jweak mem_name_wref = JNIHandles::make_weak_global(mem_name);
2664 MutexLocker ml(MemberNameTable_lock);
2665 assert(0 <= index && index < idnum_allocated_count(), "index is out of bounds");
2666 DEBUG_ONLY(No_Safepoint_Verifier nsv);
2668 if (_member_names == NULL) {
2669 _member_names = new (ResourceObj::C_HEAP, mtClass) MemberNameTable(idnum_allocated_count());
2670 }
2671 _member_names->add_member_name(index, mem_name_wref);
2672 }
2674 oop InstanceKlass::get_member_name(int index) {
2675 MutexLocker ml(MemberNameTable_lock);
2676 assert(0 <= index && index < idnum_allocated_count(), "index is out of bounds");
2677 DEBUG_ONLY(No_Safepoint_Verifier nsv);
2679 if (_member_names == NULL) {
2680 return NULL;
2681 }
2682 oop mem_name =_member_names->get_member_name(index);
2683 return mem_name;
2684 }
2686 // -----------------------------------------------------------------------------------------------------
2687 // Printing
2689 #ifndef PRODUCT
2691 #define BULLET " - "
2693 static const char* state_names[] = {
2694 "allocated", "loaded", "linked", "being_initialized", "fully_initialized", "initialization_error"
2695 };
2697 static void print_vtable(intptr_t* start, int len, outputStream* st) {
2698 for (int i = 0; i < len; i++) {
2699 intptr_t e = start[i];
2700 st->print("%d : " INTPTR_FORMAT, i, e);
2701 if (e != 0 && ((Metadata*)e)->is_metaspace_object()) {
2702 st->print(" ");
2703 ((Metadata*)e)->print_value_on(st);
2704 }
2705 st->cr();
2706 }
2707 }
2709 void InstanceKlass::print_on(outputStream* st) const {
2710 assert(is_klass(), "must be klass");
2711 Klass::print_on(st);
2713 st->print(BULLET"instance size: %d", size_helper()); st->cr();
2714 st->print(BULLET"klass size: %d", size()); st->cr();
2715 st->print(BULLET"access: "); access_flags().print_on(st); st->cr();
2716 st->print(BULLET"state: "); st->print_cr(state_names[_init_state]);
2717 st->print(BULLET"name: "); name()->print_value_on(st); st->cr();
2718 st->print(BULLET"super: "); super()->print_value_on_maybe_null(st); st->cr();
2719 st->print(BULLET"sub: ");
2720 Klass* sub = subklass();
2721 int n;
2722 for (n = 0; sub != NULL; n++, sub = sub->next_sibling()) {
2723 if (n < MaxSubklassPrintSize) {
2724 sub->print_value_on(st);
2725 st->print(" ");
2726 }
2727 }
2728 if (n >= MaxSubklassPrintSize) st->print("(%d more klasses...)", n - MaxSubklassPrintSize);
2729 st->cr();
2731 if (is_interface()) {
2732 st->print_cr(BULLET"nof implementors: %d", nof_implementors());
2733 if (nof_implementors() == 1) {
2734 st->print_cr(BULLET"implementor: ");
2735 st->print(" ");
2736 implementor()->print_value_on(st);
2737 st->cr();
2738 }
2739 }
2741 st->print(BULLET"arrays: "); array_klasses()->print_value_on_maybe_null(st); st->cr();
2742 st->print(BULLET"methods: "); methods()->print_value_on(st); st->cr();
2743 if (Verbose || WizardMode) {
2744 Array<Method*>* method_array = methods();
2745 for(int i = 0; i < method_array->length(); i++) {
2746 st->print("%d : ", i); method_array->at(i)->print_value(); st->cr();
2747 }
2748 }
2749 st->print(BULLET"method ordering: "); method_ordering()->print_value_on(st); st->cr();
2750 st->print(BULLET"local interfaces: "); local_interfaces()->print_value_on(st); st->cr();
2751 st->print(BULLET"trans. interfaces: "); transitive_interfaces()->print_value_on(st); st->cr();
2752 st->print(BULLET"constants: "); constants()->print_value_on(st); st->cr();
2753 if (class_loader_data() != NULL) {
2754 st->print(BULLET"class loader data: ");
2755 class_loader_data()->print_value_on(st);
2756 st->cr();
2757 }
2758 st->print(BULLET"host class: "); host_klass()->print_value_on_maybe_null(st); st->cr();
2759 if (source_file_name() != NULL) {
2760 st->print(BULLET"source file: ");
2761 source_file_name()->print_value_on(st);
2762 st->cr();
2763 }
2764 if (source_debug_extension() != NULL) {
2765 st->print(BULLET"source debug extension: ");
2766 st->print("%s", source_debug_extension());
2767 st->cr();
2768 }
2769 st->print(BULLET"class annotations: "); class_annotations()->print_value_on(st); st->cr();
2770 st->print(BULLET"class type annotations: "); class_type_annotations()->print_value_on(st); st->cr();
2771 st->print(BULLET"field annotations: "); fields_annotations()->print_value_on(st); st->cr();
2772 st->print(BULLET"field type annotations: "); fields_type_annotations()->print_value_on(st); st->cr();
2773 {
2774 bool have_pv = false;
2775 PreviousVersionWalker pvw(Thread::current(), (InstanceKlass*)this);
2776 for (PreviousVersionNode * pv_node = pvw.next_previous_version();
2777 pv_node != NULL; pv_node = pvw.next_previous_version()) {
2778 if (!have_pv)
2779 st->print(BULLET"previous version: ");
2780 have_pv = true;
2781 pv_node->prev_constant_pool()->print_value_on(st);
2782 }
2783 if (have_pv) st->cr();
2784 } // pvw is cleaned up
2786 if (generic_signature() != NULL) {
2787 st->print(BULLET"generic signature: ");
2788 generic_signature()->print_value_on(st);
2789 st->cr();
2790 }
2791 st->print(BULLET"inner classes: "); inner_classes()->print_value_on(st); st->cr();
2792 st->print(BULLET"java mirror: "); java_mirror()->print_value_on(st); st->cr();
2793 st->print(BULLET"vtable length %d (start addr: " INTPTR_FORMAT ")", vtable_length(), start_of_vtable()); st->cr();
2794 if (vtable_length() > 0 && (Verbose || WizardMode)) print_vtable(start_of_vtable(), vtable_length(), st);
2795 st->print(BULLET"itable length %d (start addr: " INTPTR_FORMAT ")", itable_length(), start_of_itable()); st->cr();
2796 if (itable_length() > 0 && (Verbose || WizardMode)) print_vtable(start_of_itable(), itable_length(), st);
2797 st->print_cr(BULLET"---- static fields (%d words):", static_field_size());
2798 FieldPrinter print_static_field(st);
2799 ((InstanceKlass*)this)->do_local_static_fields(&print_static_field);
2800 st->print_cr(BULLET"---- non-static fields (%d words):", nonstatic_field_size());
2801 FieldPrinter print_nonstatic_field(st);
2802 ((InstanceKlass*)this)->do_nonstatic_fields(&print_nonstatic_field);
2804 st->print(BULLET"non-static oop maps: ");
2805 OopMapBlock* map = start_of_nonstatic_oop_maps();
2806 OopMapBlock* end_map = map + nonstatic_oop_map_count();
2807 while (map < end_map) {
2808 st->print("%d-%d ", map->offset(), map->offset() + heapOopSize*(map->count() - 1));
2809 map++;
2810 }
2811 st->cr();
2812 }
2814 #endif //PRODUCT
2816 void InstanceKlass::print_value_on(outputStream* st) const {
2817 assert(is_klass(), "must be klass");
2818 if (Verbose || WizardMode) access_flags().print_on(st);
2819 name()->print_value_on(st);
2820 }
2822 #ifndef PRODUCT
2824 void FieldPrinter::do_field(fieldDescriptor* fd) {
2825 _st->print(BULLET);
2826 if (_obj == NULL) {
2827 fd->print_on(_st);
2828 _st->cr();
2829 } else {
2830 fd->print_on_for(_st, _obj);
2831 _st->cr();
2832 }
2833 }
2836 void InstanceKlass::oop_print_on(oop obj, outputStream* st) {
2837 Klass::oop_print_on(obj, st);
2839 if (this == SystemDictionary::String_klass()) {
2840 typeArrayOop value = java_lang_String::value(obj);
2841 juint offset = java_lang_String::offset(obj);
2842 juint length = java_lang_String::length(obj);
2843 if (value != NULL &&
2844 value->is_typeArray() &&
2845 offset <= (juint) value->length() &&
2846 offset + length <= (juint) value->length()) {
2847 st->print(BULLET"string: ");
2848 Handle h_obj(obj);
2849 java_lang_String::print(h_obj, st);
2850 st->cr();
2851 if (!WizardMode) return; // that is enough
2852 }
2853 }
2855 st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj));
2856 FieldPrinter print_field(st, obj);
2857 do_nonstatic_fields(&print_field);
2859 if (this == SystemDictionary::Class_klass()) {
2860 st->print(BULLET"signature: ");
2861 java_lang_Class::print_signature(obj, st);
2862 st->cr();
2863 Klass* mirrored_klass = java_lang_Class::as_Klass(obj);
2864 st->print(BULLET"fake entry for mirror: ");
2865 mirrored_klass->print_value_on_maybe_null(st);
2866 st->cr();
2867 Klass* array_klass = java_lang_Class::array_klass(obj);
2868 st->print(BULLET"fake entry for array: ");
2869 array_klass->print_value_on_maybe_null(st);
2870 st->cr();
2871 st->print_cr(BULLET"fake entry for oop_size: %d", java_lang_Class::oop_size(obj));
2872 st->print_cr(BULLET"fake entry for static_oop_field_count: %d", java_lang_Class::static_oop_field_count(obj));
2873 Klass* real_klass = java_lang_Class::as_Klass(obj);
2874 if (real_klass != NULL && real_klass->oop_is_instance()) {
2875 InstanceKlass::cast(real_klass)->do_local_static_fields(&print_field);
2876 }
2877 } else if (this == SystemDictionary::MethodType_klass()) {
2878 st->print(BULLET"signature: ");
2879 java_lang_invoke_MethodType::print_signature(obj, st);
2880 st->cr();
2881 }
2882 }
2884 #endif //PRODUCT
2886 void InstanceKlass::oop_print_value_on(oop obj, outputStream* st) {
2887 st->print("a ");
2888 name()->print_value_on(st);
2889 obj->print_address_on(st);
2890 if (this == SystemDictionary::String_klass()
2891 && java_lang_String::value(obj) != NULL) {
2892 ResourceMark rm;
2893 int len = java_lang_String::length(obj);
2894 int plen = (len < 24 ? len : 12);
2895 char* str = java_lang_String::as_utf8_string(obj, 0, plen);
2896 st->print(" = \"%s\"", str);
2897 if (len > plen)
2898 st->print("...[%d]", len);
2899 } else if (this == SystemDictionary::Class_klass()) {
2900 Klass* k = java_lang_Class::as_Klass(obj);
2901 st->print(" = ");
2902 if (k != NULL) {
2903 k->print_value_on(st);
2904 } else {
2905 const char* tname = type2name(java_lang_Class::primitive_type(obj));
2906 st->print("%s", tname ? tname : "type?");
2907 }
2908 } else if (this == SystemDictionary::MethodType_klass()) {
2909 st->print(" = ");
2910 java_lang_invoke_MethodType::print_signature(obj, st);
2911 } else if (java_lang_boxing_object::is_instance(obj)) {
2912 st->print(" = ");
2913 java_lang_boxing_object::print(obj, st);
2914 } else if (this == SystemDictionary::LambdaForm_klass()) {
2915 oop vmentry = java_lang_invoke_LambdaForm::vmentry(obj);
2916 if (vmentry != NULL) {
2917 st->print(" => ");
2918 vmentry->print_value_on(st);
2919 }
2920 } else if (this == SystemDictionary::MemberName_klass()) {
2921 Metadata* vmtarget = java_lang_invoke_MemberName::vmtarget(obj);
2922 if (vmtarget != NULL) {
2923 st->print(" = ");
2924 vmtarget->print_value_on(st);
2925 } else {
2926 java_lang_invoke_MemberName::clazz(obj)->print_value_on(st);
2927 st->print(".");
2928 java_lang_invoke_MemberName::name(obj)->print_value_on(st);
2929 }
2930 }
2931 }
2933 const char* InstanceKlass::internal_name() const {
2934 return external_name();
2935 }
2937 #if INCLUDE_SERVICES
2938 // Size Statistics
2939 void InstanceKlass::collect_statistics(KlassSizeStats *sz) const {
2940 Klass::collect_statistics(sz);
2942 sz->_inst_size = HeapWordSize * size_helper();
2943 sz->_vtab_bytes = HeapWordSize * align_object_offset(vtable_length());
2944 sz->_itab_bytes = HeapWordSize * align_object_offset(itable_length());
2945 sz->_nonstatic_oopmap_bytes = HeapWordSize *
2946 ((is_interface() || is_anonymous()) ?
2947 align_object_offset(nonstatic_oop_map_size()) :
2948 nonstatic_oop_map_size());
2950 int n = 0;
2951 n += (sz->_methods_array_bytes = sz->count_array(methods()));
2952 n += (sz->_method_ordering_bytes = sz->count_array(method_ordering()));
2953 n += (sz->_local_interfaces_bytes = sz->count_array(local_interfaces()));
2954 n += (sz->_transitive_interfaces_bytes = sz->count_array(transitive_interfaces()));
2955 n += (sz->_fields_bytes = sz->count_array(fields()));
2956 n += (sz->_inner_classes_bytes = sz->count_array(inner_classes()));
2957 sz->_ro_bytes += n;
2959 const ConstantPool* cp = constants();
2960 if (cp) {
2961 cp->collect_statistics(sz);
2962 }
2964 const Annotations* anno = annotations();
2965 if (anno) {
2966 anno->collect_statistics(sz);
2967 }
2969 const Array<Method*>* methods_array = methods();
2970 if (methods()) {
2971 for (int i = 0; i < methods_array->length(); i++) {
2972 Method* method = methods_array->at(i);
2973 if (method) {
2974 sz->_method_count ++;
2975 method->collect_statistics(sz);
2976 }
2977 }
2978 }
2979 }
2980 #endif // INCLUDE_SERVICES
2982 // Verification
2984 class VerifyFieldClosure: public OopClosure {
2985 protected:
2986 template <class T> void do_oop_work(T* p) {
2987 oop obj = oopDesc::load_decode_heap_oop(p);
2988 if (!obj->is_oop_or_null()) {
2989 tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p, (address)obj);
2990 Universe::print();
2991 guarantee(false, "boom");
2992 }
2993 }
2994 public:
2995 virtual void do_oop(oop* p) { VerifyFieldClosure::do_oop_work(p); }
2996 virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); }
2997 };
2999 void InstanceKlass::verify_on(outputStream* st, bool check_dictionary) {
3000 #ifndef PRODUCT
3001 // Avoid redundant verifies, this really should be in product.
3002 if (_verify_count == Universe::verify_count()) return;
3003 _verify_count = Universe::verify_count();
3004 #endif
3006 // Verify Klass
3007 Klass::verify_on(st, check_dictionary);
3009 // Verify that klass is present in SystemDictionary if not already
3010 // verifying the SystemDictionary.
3011 if (is_loaded() && !is_anonymous() && check_dictionary) {
3012 Symbol* h_name = name();
3013 SystemDictionary::verify_obj_klass_present(h_name, class_loader_data());
3014 }
3016 // Verify vtables
3017 if (is_linked()) {
3018 ResourceMark rm;
3019 // $$$ This used to be done only for m/s collections. Doing it
3020 // always seemed a valid generalization. (DLD -- 6/00)
3021 vtable()->verify(st);
3022 }
3024 // Verify first subklass
3025 if (subklass_oop() != NULL) {
3026 guarantee(subklass_oop()->is_klass(), "should be klass");
3027 }
3029 // Verify siblings
3030 Klass* super = this->super();
3031 Klass* sib = next_sibling();
3032 if (sib != NULL) {
3033 if (sib == this) {
3034 fatal(err_msg("subclass points to itself " PTR_FORMAT, sib));
3035 }
3037 guarantee(sib->is_klass(), "should be klass");
3038 guarantee(sib->super() == super, "siblings should have same superklass");
3039 }
3041 // Verify implementor fields
3042 Klass* im = implementor();
3043 if (im != NULL) {
3044 guarantee(is_interface(), "only interfaces should have implementor set");
3045 guarantee(im->is_klass(), "should be klass");
3046 guarantee(!im->is_interface() || im == this,
3047 "implementors cannot be interfaces");
3048 }
3050 // Verify local interfaces
3051 if (local_interfaces()) {
3052 Array<Klass*>* local_interfaces = this->local_interfaces();
3053 for (int j = 0; j < local_interfaces->length(); j++) {
3054 Klass* e = local_interfaces->at(j);
3055 guarantee(e->is_klass() && e->is_interface(), "invalid local interface");
3056 }
3057 }
3059 // Verify transitive interfaces
3060 if (transitive_interfaces() != NULL) {
3061 Array<Klass*>* transitive_interfaces = this->transitive_interfaces();
3062 for (int j = 0; j < transitive_interfaces->length(); j++) {
3063 Klass* e = transitive_interfaces->at(j);
3064 guarantee(e->is_klass() && e->is_interface(), "invalid transitive interface");
3065 }
3066 }
3068 // Verify methods
3069 if (methods() != NULL) {
3070 Array<Method*>* methods = this->methods();
3071 for (int j = 0; j < methods->length(); j++) {
3072 guarantee(methods->at(j)->is_method(), "non-method in methods array");
3073 }
3074 for (int j = 0; j < methods->length() - 1; j++) {
3075 Method* m1 = methods->at(j);
3076 Method* m2 = methods->at(j + 1);
3077 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
3078 }
3079 }
3081 // Verify method ordering
3082 if (method_ordering() != NULL) {
3083 Array<int>* method_ordering = this->method_ordering();
3084 int length = method_ordering->length();
3085 if (JvmtiExport::can_maintain_original_method_order() ||
3086 ((UseSharedSpaces || DumpSharedSpaces) && length != 0)) {
3087 guarantee(length == methods()->length(), "invalid method ordering length");
3088 jlong sum = 0;
3089 for (int j = 0; j < length; j++) {
3090 int original_index = method_ordering->at(j);
3091 guarantee(original_index >= 0, "invalid method ordering index");
3092 guarantee(original_index < length, "invalid method ordering index");
3093 sum += original_index;
3094 }
3095 // Verify sum of indices 0,1,...,length-1
3096 guarantee(sum == ((jlong)length*(length-1))/2, "invalid method ordering sum");
3097 } else {
3098 guarantee(length == 0, "invalid method ordering length");
3099 }
3100 }
3102 // Verify JNI static field identifiers
3103 if (jni_ids() != NULL) {
3104 jni_ids()->verify(this);
3105 }
3107 // Verify other fields
3108 if (array_klasses() != NULL) {
3109 guarantee(array_klasses()->is_klass(), "should be klass");
3110 }
3111 if (constants() != NULL) {
3112 guarantee(constants()->is_constantPool(), "should be constant pool");
3113 }
3114 const Klass* host = host_klass();
3115 if (host != NULL) {
3116 guarantee(host->is_klass(), "should be klass");
3117 }
3118 }
3120 void InstanceKlass::oop_verify_on(oop obj, outputStream* st) {
3121 Klass::oop_verify_on(obj, st);
3122 VerifyFieldClosure blk;
3123 obj->oop_iterate_no_header(&blk);
3124 }
3127 // JNIid class for jfieldIDs only
3128 // Note to reviewers:
3129 // These JNI functions are just moved over to column 1 and not changed
3130 // in the compressed oops workspace.
3131 JNIid::JNIid(Klass* holder, int offset, JNIid* next) {
3132 _holder = holder;
3133 _offset = offset;
3134 _next = next;
3135 debug_only(_is_static_field_id = false;)
3136 }
3139 JNIid* JNIid::find(int offset) {
3140 JNIid* current = this;
3141 while (current != NULL) {
3142 if (current->offset() == offset) return current;
3143 current = current->next();
3144 }
3145 return NULL;
3146 }
3148 void JNIid::deallocate(JNIid* current) {
3149 while (current != NULL) {
3150 JNIid* next = current->next();
3151 delete current;
3152 current = next;
3153 }
3154 }
3157 void JNIid::verify(Klass* holder) {
3158 int first_field_offset = InstanceMirrorKlass::offset_of_static_fields();
3159 int end_field_offset;
3160 end_field_offset = first_field_offset + (InstanceKlass::cast(holder)->static_field_size() * wordSize);
3162 JNIid* current = this;
3163 while (current != NULL) {
3164 guarantee(current->holder() == holder, "Invalid klass in JNIid");
3165 #ifdef ASSERT
3166 int o = current->offset();
3167 if (current->is_static_field_id()) {
3168 guarantee(o >= first_field_offset && o < end_field_offset, "Invalid static field offset in JNIid");
3169 }
3170 #endif
3171 current = current->next();
3172 }
3173 }
3176 #ifdef ASSERT
3177 void InstanceKlass::set_init_state(ClassState state) {
3178 bool good_state = is_shared() ? (_init_state <= state)
3179 : (_init_state < state);
3180 assert(good_state || state == allocated, "illegal state transition");
3181 _init_state = (u1)state;
3182 }
3183 #endif
3186 // RedefineClasses() support for previous versions:
3188 // Purge previous versions
3189 static void purge_previous_versions_internal(InstanceKlass* ik, int emcp_method_count) {
3190 if (ik->previous_versions() != NULL) {
3191 // This klass has previous versions so see what we can cleanup
3192 // while it is safe to do so.
3194 int deleted_count = 0; // leave debugging breadcrumbs
3195 int live_count = 0;
3196 ClassLoaderData* loader_data = ik->class_loader_data() == NULL ?
3197 ClassLoaderData::the_null_class_loader_data() :
3198 ik->class_loader_data();
3200 // RC_TRACE macro has an embedded ResourceMark
3201 RC_TRACE(0x00000200, ("purge: %s: previous version length=%d",
3202 ik->external_name(), ik->previous_versions()->length()));
3204 for (int i = ik->previous_versions()->length() - 1; i >= 0; i--) {
3205 // check the previous versions array
3206 PreviousVersionNode * pv_node = ik->previous_versions()->at(i);
3207 ConstantPool* cp_ref = pv_node->prev_constant_pool();
3208 assert(cp_ref != NULL, "cp ref was unexpectedly cleared");
3210 ConstantPool* pvcp = cp_ref;
3211 if (!pvcp->on_stack()) {
3212 // If the constant pool isn't on stack, none of the methods
3213 // are executing. Delete all the methods, the constant pool and
3214 // and this previous version node.
3215 GrowableArray<Method*>* method_refs = pv_node->prev_EMCP_methods();
3216 if (method_refs != NULL) {
3217 for (int j = method_refs->length() - 1; j >= 0; j--) {
3218 Method* method = method_refs->at(j);
3219 assert(method != NULL, "method ref was unexpectedly cleared");
3220 method_refs->remove_at(j);
3221 // method will be freed with associated class.
3222 }
3223 }
3224 // Remove the constant pool
3225 delete pv_node;
3226 // Since we are traversing the array backwards, we don't have to
3227 // do anything special with the index.
3228 ik->previous_versions()->remove_at(i);
3229 deleted_count++;
3230 continue;
3231 } else {
3232 RC_TRACE(0x00000200, ("purge: previous version @%d is alive", i));
3233 assert(pvcp->pool_holder() != NULL, "Constant pool with no holder");
3234 guarantee (!loader_data->is_unloading(), "unloaded classes can't be on the stack");
3235 live_count++;
3236 }
3238 // At least one method is live in this previous version, clean out
3239 // the others or mark them as obsolete.
3240 GrowableArray<Method*>* method_refs = pv_node->prev_EMCP_methods();
3241 if (method_refs != NULL) {
3242 RC_TRACE(0x00000200, ("purge: previous methods length=%d",
3243 method_refs->length()));
3244 for (int j = method_refs->length() - 1; j >= 0; j--) {
3245 Method* method = method_refs->at(j);
3246 assert(method != NULL, "method ref was unexpectedly cleared");
3248 // Remove the emcp method if it's not executing
3249 // If it's been made obsolete by a redefinition of a non-emcp
3250 // method, mark it as obsolete but leave it to clean up later.
3251 if (!method->on_stack()) {
3252 method_refs->remove_at(j);
3253 } else if (emcp_method_count == 0) {
3254 method->set_is_obsolete();
3255 } else {
3256 // RC_TRACE macro has an embedded ResourceMark
3257 RC_TRACE(0x00000200,
3258 ("purge: %s(%s): prev method @%d in version @%d is alive",
3259 method->name()->as_C_string(),
3260 method->signature()->as_C_string(), j, i));
3261 }
3262 }
3263 }
3264 }
3265 assert(ik->previous_versions()->length() == live_count, "sanity check");
3266 RC_TRACE(0x00000200,
3267 ("purge: previous version stats: live=%d, deleted=%d", live_count,
3268 deleted_count));
3269 }
3270 }
3272 // External interface for use during class unloading.
3273 void InstanceKlass::purge_previous_versions(InstanceKlass* ik) {
3274 // Call with >0 emcp methods since they are not currently being redefined.
3275 purge_previous_versions_internal(ik, 1);
3276 }
3279 // Potentially add an information node that contains pointers to the
3280 // interesting parts of the previous version of the_class.
3281 // This is also where we clean out any unused references.
3282 // Note that while we delete nodes from the _previous_versions
3283 // array, we never delete the array itself until the klass is
3284 // unloaded. The has_been_redefined() query depends on that fact.
3285 //
3286 void InstanceKlass::add_previous_version(instanceKlassHandle ikh,
3287 BitMap* emcp_methods, int emcp_method_count) {
3288 assert(Thread::current()->is_VM_thread(),
3289 "only VMThread can add previous versions");
3291 if (_previous_versions == NULL) {
3292 // This is the first previous version so make some space.
3293 // Start with 2 elements under the assumption that the class
3294 // won't be redefined much.
3295 _previous_versions = new (ResourceObj::C_HEAP, mtClass)
3296 GrowableArray<PreviousVersionNode *>(2, true);
3297 }
3299 ConstantPool* cp_ref = ikh->constants();
3301 // RC_TRACE macro has an embedded ResourceMark
3302 RC_TRACE(0x00000400, ("adding previous version ref for %s @%d, EMCP_cnt=%d "
3303 "on_stack=%d",
3304 ikh->external_name(), _previous_versions->length(), emcp_method_count,
3305 cp_ref->on_stack()));
3307 // If the constant pool for this previous version of the class
3308 // is not marked as being on the stack, then none of the methods
3309 // in this previous version of the class are on the stack so
3310 // we don't need to create a new PreviousVersionNode. However,
3311 // we still need to examine older previous versions below.
3312 Array<Method*>* old_methods = ikh->methods();
3314 if (cp_ref->on_stack()) {
3315 PreviousVersionNode * pv_node = NULL;
3316 if (emcp_method_count == 0) {
3317 // non-shared ConstantPool gets a reference
3318 pv_node = new PreviousVersionNode(cp_ref, NULL);
3319 RC_TRACE(0x00000400,
3320 ("add: all methods are obsolete; flushing any EMCP refs"));
3321 } else {
3322 int local_count = 0;
3323 GrowableArray<Method*>* method_refs = new (ResourceObj::C_HEAP, mtClass)
3324 GrowableArray<Method*>(emcp_method_count, true);
3325 for (int i = 0; i < old_methods->length(); i++) {
3326 if (emcp_methods->at(i)) {
3327 // this old method is EMCP. Save it only if it's on the stack
3328 Method* old_method = old_methods->at(i);
3329 if (old_method->on_stack()) {
3330 method_refs->append(old_method);
3331 }
3332 if (++local_count >= emcp_method_count) {
3333 // no more EMCP methods so bail out now
3334 break;
3335 }
3336 }
3337 }
3338 // non-shared ConstantPool gets a reference
3339 pv_node = new PreviousVersionNode(cp_ref, method_refs);
3340 }
3341 // append new previous version.
3342 _previous_versions->append(pv_node);
3343 }
3345 // Since the caller is the VMThread and we are at a safepoint, this
3346 // is a good time to clear out unused references.
3348 RC_TRACE(0x00000400, ("add: previous version length=%d",
3349 _previous_versions->length()));
3351 // Purge previous versions not executing on the stack
3352 purge_previous_versions_internal(this, emcp_method_count);
3354 int obsolete_method_count = old_methods->length() - emcp_method_count;
3356 if (emcp_method_count != 0 && obsolete_method_count != 0 &&
3357 _previous_versions->length() > 0) {
3358 // We have a mix of obsolete and EMCP methods so we have to
3359 // clear out any matching EMCP method entries the hard way.
3360 int local_count = 0;
3361 for (int i = 0; i < old_methods->length(); i++) {
3362 if (!emcp_methods->at(i)) {
3363 // only obsolete methods are interesting
3364 Method* old_method = old_methods->at(i);
3365 Symbol* m_name = old_method->name();
3366 Symbol* m_signature = old_method->signature();
3368 // we might not have added the last entry
3369 for (int j = _previous_versions->length() - 1; j >= 0; j--) {
3370 // check the previous versions array for non executing obsolete methods
3371 PreviousVersionNode * pv_node = _previous_versions->at(j);
3373 GrowableArray<Method*>* method_refs = pv_node->prev_EMCP_methods();
3374 if (method_refs == NULL) {
3375 // We have run into a PreviousVersion generation where
3376 // all methods were made obsolete during that generation's
3377 // RedefineClasses() operation. At the time of that
3378 // operation, all EMCP methods were flushed so we don't
3379 // have to go back any further.
3380 //
3381 // A NULL method_refs is different than an empty method_refs.
3382 // We cannot infer any optimizations about older generations
3383 // from an empty method_refs for the current generation.
3384 break;
3385 }
3387 for (int k = method_refs->length() - 1; k >= 0; k--) {
3388 Method* method = method_refs->at(k);
3390 if (!method->is_obsolete() &&
3391 method->name() == m_name &&
3392 method->signature() == m_signature) {
3393 // The current RedefineClasses() call has made all EMCP
3394 // versions of this method obsolete so mark it as obsolete
3395 // and remove the reference.
3396 RC_TRACE(0x00000400,
3397 ("add: %s(%s): flush obsolete method @%d in version @%d",
3398 m_name->as_C_string(), m_signature->as_C_string(), k, j));
3400 method->set_is_obsolete();
3401 // Leave obsolete methods on the previous version list to
3402 // clean up later.
3403 break;
3404 }
3405 }
3407 // The previous loop may not find a matching EMCP method, but
3408 // that doesn't mean that we can optimize and not go any
3409 // further back in the PreviousVersion generations. The EMCP
3410 // method for this generation could have already been deleted,
3411 // but there still may be an older EMCP method that has not
3412 // been deleted.
3413 }
3415 if (++local_count >= obsolete_method_count) {
3416 // no more obsolete methods so bail out now
3417 break;
3418 }
3419 }
3420 }
3421 }
3422 } // end add_previous_version()
3425 // Determine if InstanceKlass has a previous version.
3426 bool InstanceKlass::has_previous_version() const {
3427 return (_previous_versions != NULL && _previous_versions->length() > 0);
3428 } // end has_previous_version()
3431 Method* InstanceKlass::method_with_idnum(int idnum) {
3432 Method* m = NULL;
3433 if (idnum < methods()->length()) {
3434 m = methods()->at(idnum);
3435 }
3436 if (m == NULL || m->method_idnum() != idnum) {
3437 for (int index = 0; index < methods()->length(); ++index) {
3438 m = methods()->at(index);
3439 if (m->method_idnum() == idnum) {
3440 return m;
3441 }
3442 }
3443 // None found, return null for the caller to handle.
3444 return NULL;
3445 }
3446 return m;
3447 }
3449 jint InstanceKlass::get_cached_class_file_len() {
3450 return VM_RedefineClasses::get_cached_class_file_len(_cached_class_file);
3451 }
3453 unsigned char * InstanceKlass::get_cached_class_file_bytes() {
3454 return VM_RedefineClasses::get_cached_class_file_bytes(_cached_class_file);
3455 }
3458 // Construct a PreviousVersionNode entry for the array hung off
3459 // the InstanceKlass.
3460 PreviousVersionNode::PreviousVersionNode(ConstantPool* prev_constant_pool,
3461 GrowableArray<Method*>* prev_EMCP_methods) {
3463 _prev_constant_pool = prev_constant_pool;
3464 _prev_EMCP_methods = prev_EMCP_methods;
3465 }
3468 // Destroy a PreviousVersionNode
3469 PreviousVersionNode::~PreviousVersionNode() {
3470 if (_prev_constant_pool != NULL) {
3471 _prev_constant_pool = NULL;
3472 }
3474 if (_prev_EMCP_methods != NULL) {
3475 delete _prev_EMCP_methods;
3476 }
3477 }
3479 // Construct a helper for walking the previous versions array
3480 PreviousVersionWalker::PreviousVersionWalker(Thread* thread, InstanceKlass *ik) {
3481 _thread = thread;
3482 _previous_versions = ik->previous_versions();
3483 _current_index = 0;
3484 _current_p = NULL;
3485 _current_constant_pool_handle = constantPoolHandle(thread, ik->constants());
3486 }
3489 // Return the interesting information for the next previous version
3490 // of the klass. Returns NULL if there are no more previous versions.
3491 PreviousVersionNode* PreviousVersionWalker::next_previous_version() {
3492 if (_previous_versions == NULL) {
3493 // no previous versions so nothing to return
3494 return NULL;
3495 }
3497 _current_p = NULL; // reset to NULL
3498 _current_constant_pool_handle = NULL;
3500 int length = _previous_versions->length();
3502 while (_current_index < length) {
3503 PreviousVersionNode * pv_node = _previous_versions->at(_current_index++);
3505 // Save a handle to the constant pool for this previous version,
3506 // which keeps all the methods from being deallocated.
3507 _current_constant_pool_handle = constantPoolHandle(_thread, pv_node->prev_constant_pool());
3508 _current_p = pv_node;
3509 return pv_node;
3510 }
3512 return NULL;
3513 } // end next_previous_version()