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