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