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