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