1 /*
2 * Copyright (c) 1997, 2019, 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 "jvm.h"
27 #include "aot/aotLoader.hpp"
28 #include "classfile/classFileParser.hpp"
29 #include "classfile/classFileStream.hpp"
30 #include "classfile/classLoader.hpp"
31 #include "classfile/classLoaderData.inline.hpp"
32 #include "classfile/javaClasses.hpp"
33 #include "classfile/moduleEntry.hpp"
34 #include "classfile/symbolTable.hpp"
35 #include "classfile/systemDictionary.hpp"
36 #include "classfile/systemDictionaryShared.hpp"
37 #include "classfile/verifier.hpp"
38 #include "classfile/vmSymbols.hpp"
39 #include "code/dependencyContext.hpp"
40 #include "compiler/compileBroker.hpp"
41 #include "gc/shared/collectedHeap.inline.hpp"
42 #include "interpreter/oopMapCache.hpp"
43 #include "interpreter/rewriter.hpp"
44 #include "jvmtifiles/jvmti.h"
45 #include "logging/log.hpp"
46 #include "logging/logMessage.hpp"
47 #include "logging/logStream.hpp"
48 #include "memory/allocation.inline.hpp"
49 #include "memory/heapInspection.hpp"
50 #include "memory/iterator.inline.hpp"
51 #include "memory/metadataFactory.hpp"
52 #include "memory/metaspaceClosure.hpp"
53 #include "memory/metaspaceShared.hpp"
54 #include "memory/oopFactory.hpp"
55 #include "memory/resourceArea.hpp"
56 #include "memory/universe.hpp"
57 #include "oops/fieldStreams.hpp"
58 #include "oops/constantPool.hpp"
59 #include "oops/instanceClassLoaderKlass.hpp"
60 #include "oops/instanceKlass.inline.hpp"
61 #include "oops/instanceMirrorKlass.hpp"
62 #include "oops/instanceOop.hpp"
63 #include "oops/klass.inline.hpp"
64 #include "oops/method.hpp"
65 #include "oops/oop.inline.hpp"
66 #include "oops/symbol.hpp"
67 #include "oops/valueKlass.hpp"
68 #include "prims/jvmtiExport.hpp"
69 #include "prims/jvmtiRedefineClasses.hpp"
70 #include "prims/jvmtiThreadState.hpp"
71 #include "prims/methodComparator.hpp"
72 #include "runtime/atomic.hpp"
73 #include "runtime/fieldDescriptor.inline.hpp"
74 #include "runtime/handles.inline.hpp"
75 #include "runtime/javaCalls.hpp"
76 #include "runtime/mutexLocker.hpp"
77 #include "runtime/orderAccess.hpp"
78 #include "runtime/thread.inline.hpp"
79 #include "services/classLoadingService.hpp"
80 #include "services/threadService.hpp"
81 #include "utilities/dtrace.hpp"
82 #include "utilities/events.hpp"
83 #include "utilities/macros.hpp"
84 #include "utilities/stringUtils.hpp"
85 #ifdef COMPILER1
86 #include "c1/c1_Compiler.hpp"
87 #endif
88 #if INCLUDE_JFR
89 #include "jfr/jfrEvents.hpp"
90 #endif
91
92
93 #ifdef DTRACE_ENABLED
94
95
96 #define HOTSPOT_CLASS_INITIALIZATION_required HOTSPOT_CLASS_INITIALIZATION_REQUIRED
97 #define HOTSPOT_CLASS_INITIALIZATION_recursive HOTSPOT_CLASS_INITIALIZATION_RECURSIVE
98 #define HOTSPOT_CLASS_INITIALIZATION_concurrent HOTSPOT_CLASS_INITIALIZATION_CONCURRENT
99 #define HOTSPOT_CLASS_INITIALIZATION_erroneous HOTSPOT_CLASS_INITIALIZATION_ERRONEOUS
100 #define HOTSPOT_CLASS_INITIALIZATION_super__failed HOTSPOT_CLASS_INITIALIZATION_SUPER_FAILED
101 #define HOTSPOT_CLASS_INITIALIZATION_clinit HOTSPOT_CLASS_INITIALIZATION_CLINIT
102 #define HOTSPOT_CLASS_INITIALIZATION_error HOTSPOT_CLASS_INITIALIZATION_ERROR
103 #define HOTSPOT_CLASS_INITIALIZATION_end HOTSPOT_CLASS_INITIALIZATION_END
104 #define DTRACE_CLASSINIT_PROBE(type, thread_type) \
105 { \
106 char* data = NULL; \
107 int len = 0; \
108 Symbol* clss_name = name(); \
109 if (clss_name != NULL) { \
110 data = (char*)clss_name->bytes(); \
111 len = clss_name->utf8_length(); \
112 } \
113 HOTSPOT_CLASS_INITIALIZATION_##type( \
114 data, len, (void*)class_loader(), thread_type); \
115 }
116
117 #define DTRACE_CLASSINIT_PROBE_WAIT(type, thread_type, wait) \
118 { \
119 char* data = NULL; \
120 int len = 0; \
121 Symbol* clss_name = name(); \
122 if (clss_name != NULL) { \
123 data = (char*)clss_name->bytes(); \
124 len = clss_name->utf8_length(); \
125 } \
126 HOTSPOT_CLASS_INITIALIZATION_##type( \
127 data, len, (void*)class_loader(), thread_type, wait); \
128 }
129
130 #else // ndef DTRACE_ENABLED
131
132 #define DTRACE_CLASSINIT_PROBE(type, thread_type)
133 #define DTRACE_CLASSINIT_PROBE_WAIT(type, thread_type, wait)
134
135 #endif // ndef DTRACE_ENABLED
136
137 static inline bool is_class_loader(const Symbol* class_name,
138 const ClassFileParser& parser) {
139 assert(class_name != NULL, "invariant");
140
141 if (class_name == vmSymbols::java_lang_ClassLoader()) {
142 return true;
143 }
144
145 if (SystemDictionary::ClassLoader_klass_loaded()) {
146 const Klass* const super_klass = parser.super_klass();
147 if (super_klass != NULL) {
148 if (super_klass->is_subtype_of(SystemDictionary::ClassLoader_klass())) {
149 return true;
150 }
151 }
152 }
153 return false;
154 }
155
156 // called to verify that k is a member of this nest
157 bool InstanceKlass::has_nest_member(InstanceKlass* k, TRAPS) const {
158 if (_nest_members == NULL || _nest_members == Universe::the_empty_short_array()) {
159 if (log_is_enabled(Trace, class, nestmates)) {
160 ResourceMark rm(THREAD);
161 log_trace(class, nestmates)("Checked nest membership of %s in non-nest-host class %s",
162 k->external_name(), this->external_name());
163 }
164 return false;
165 }
166
167 if (log_is_enabled(Trace, class, nestmates)) {
168 ResourceMark rm(THREAD);
169 log_trace(class, nestmates)("Checking nest membership of %s in %s",
170 k->external_name(), this->external_name());
171 }
172
173 // Check for a resolved cp entry , else fall back to a name check.
174 // We don't want to resolve any class other than the one being checked.
175 for (int i = 0; i < _nest_members->length(); i++) {
176 int cp_index = _nest_members->at(i);
177 if (_constants->tag_at(cp_index).is_klass()) {
178 Klass* k2 = _constants->klass_at(cp_index, CHECK_false);
179 if (k2 == k) {
180 log_trace(class, nestmates)("- class is listed at nest_members[%d] => cp[%d]", i, cp_index);
181 return true;
182 }
183 }
184 else {
185 Symbol* name = _constants->klass_name_at(cp_index);
186 if (name == k->name()) {
187 log_trace(class, nestmates)("- Found it at nest_members[%d] => cp[%d]", i, cp_index);
188
189 // Names match so check actual klass - this may trigger class loading if
190 // it doesn't match (though that should be impossible). But to be safe we
191 // have to check for a compiler thread executing here.
192 if (!THREAD->can_call_java() && !_constants->tag_at(cp_index).is_klass()) {
193 log_trace(class, nestmates)("- validation required resolution in an unsuitable thread");
194 return false;
195 }
196
197 Klass* k2 = _constants->klass_at(cp_index, CHECK_false);
198 if (k2 == k) {
199 log_trace(class, nestmates)("- class is listed as a nest member");
200 return true;
201 }
202 else {
203 // same name but different klass!
204 log_trace(class, nestmates)(" - klass comparison failed!");
205 // can't have two names the same, so we're done
206 return false;
207 }
208 }
209 }
210 }
211 log_trace(class, nestmates)("- class is NOT a nest member!");
212 return false;
213 }
214
215 // Return nest-host class, resolving, validating and saving it if needed.
216 // In cases where this is called from a thread that can not do classloading
217 // (such as a native JIT thread) then we simply return NULL, which in turn
218 // causes the access check to return false. Such code will retry the access
219 // from a more suitable environment later.
220 InstanceKlass* InstanceKlass::nest_host(Symbol* validationException, TRAPS) {
221 InstanceKlass* nest_host_k = _nest_host;
222 if (nest_host_k == NULL) {
223 // need to resolve and save our nest-host class. This could be attempted
224 // concurrently but as the result is idempotent and we don't use the class
225 // then we do not need any synchronization beyond what is implicitly used
226 // during class loading.
227 if (_nest_host_index != 0) { // we have a real nest_host
228 // Before trying to resolve check if we're in a suitable context
229 if (!THREAD->can_call_java() && !_constants->tag_at(_nest_host_index).is_klass()) {
230 if (log_is_enabled(Trace, class, nestmates)) {
231 ResourceMark rm(THREAD);
232 log_trace(class, nestmates)("Rejected resolution of nest-host of %s in unsuitable thread",
233 this->external_name());
234 }
235 return NULL;
236 }
237
238 if (log_is_enabled(Trace, class, nestmates)) {
239 ResourceMark rm(THREAD);
240 log_trace(class, nestmates)("Resolving nest-host of %s using cp entry for %s",
241 this->external_name(),
242 _constants->klass_name_at(_nest_host_index)->as_C_string());
243 }
244
245 Klass* k = _constants->klass_at(_nest_host_index, THREAD);
246 if (HAS_PENDING_EXCEPTION) {
247 Handle exc_h = Handle(THREAD, PENDING_EXCEPTION);
248 if (exc_h->is_a(SystemDictionary::NoClassDefFoundError_klass())) {
249 // throw a new CDNFE with the original as its cause, and a clear msg
250 ResourceMark rm(THREAD);
251 char buf[200];
252 CLEAR_PENDING_EXCEPTION;
253 jio_snprintf(buf, sizeof(buf),
254 "Unable to load nest-host class (%s) of %s",
255 _constants->klass_name_at(_nest_host_index)->as_C_string(),
256 this->external_name());
257 log_trace(class, nestmates)("%s - NoClassDefFoundError", buf);
258 THROW_MSG_CAUSE_NULL(vmSymbols::java_lang_NoClassDefFoundError(), buf, exc_h);
259 }
260 // All other exceptions pass through (OOME, StackOverflowError, LinkageErrors etc).
261 return NULL;
262 }
263
264 // A valid nest-host is an instance class in the current package that lists this
265 // class as a nest member. If any of these conditions are not met we post the
266 // requested exception type (if any) and return NULL
267
268 const char* error = NULL;
269
270 // JVMS 5.4.4 indicates package check comes first
271 if (is_same_class_package(k)) {
272
273 // Now check actual membership. We can't be a member if our "host" is
274 // not an instance class.
275 if (k->is_instance_klass()) {
276 nest_host_k = InstanceKlass::cast(k);
277
278 bool is_member = nest_host_k->has_nest_member(this, CHECK_NULL);
279 if (is_member) {
280 // save resolved nest-host value
281 _nest_host = nest_host_k;
282
283 if (log_is_enabled(Trace, class, nestmates)) {
284 ResourceMark rm(THREAD);
285 log_trace(class, nestmates)("Resolved nest-host of %s to %s",
286 this->external_name(), k->external_name());
287 }
288 return nest_host_k;
289 }
290 }
291 error = "current type is not listed as a nest member";
292 } else {
293 error = "types are in different packages";
294 }
295
296 if (log_is_enabled(Trace, class, nestmates)) {
297 ResourceMark rm(THREAD);
298 log_trace(class, nestmates)
299 ("Type %s (loader: %s) is not a nest member of "
300 "resolved type %s (loader: %s): %s",
301 this->external_name(),
302 this->class_loader_data()->loader_name_and_id(),
303 k->external_name(),
304 k->class_loader_data()->loader_name_and_id(),
305 error);
306 }
307
308 if (validationException != NULL && THREAD->can_call_java()) {
309 ResourceMark rm(THREAD);
310 Exceptions::fthrow(THREAD_AND_LOCATION,
311 validationException,
312 "Type %s (loader: %s) is not a nest member of %s (loader: %s): %s",
313 this->external_name(),
314 this->class_loader_data()->loader_name_and_id(),
315 k->external_name(),
316 k->class_loader_data()->loader_name_and_id(),
317 error
318 );
319 }
320 return NULL;
321 } else {
322 if (log_is_enabled(Trace, class, nestmates)) {
323 ResourceMark rm(THREAD);
324 log_trace(class, nestmates)("Type %s is not part of a nest: setting nest-host to self",
325 this->external_name());
326 }
327 // save resolved nest-host value
328 return (_nest_host = this);
329 }
330 }
331 return nest_host_k;
332 }
333
334 // check if 'this' and k are nestmates (same nest_host), or k is our nest_host,
335 // or we are k's nest_host - all of which is covered by comparing the two
336 // resolved_nest_hosts
337 bool InstanceKlass::has_nestmate_access_to(InstanceKlass* k, TRAPS) {
338
339 assert(this != k, "this should be handled by higher-level code");
340
341 // Per JVMS 5.4.4 we first resolve and validate the current class, then
342 // the target class k. Resolution exceptions will be passed on by upper
343 // layers. IncompatibleClassChangeErrors from membership validation failures
344 // will also be passed through.
345
346 Symbol* icce = vmSymbols::java_lang_IncompatibleClassChangeError();
347 InstanceKlass* cur_host = nest_host(icce, CHECK_false);
348 if (cur_host == NULL) {
349 return false;
350 }
351
352 Klass* k_nest_host = k->nest_host(icce, CHECK_false);
353 if (k_nest_host == NULL) {
354 return false;
355 }
356
357 bool access = (cur_host == k_nest_host);
358
359 if (log_is_enabled(Trace, class, nestmates)) {
360 ResourceMark rm(THREAD);
361 log_trace(class, nestmates)("Class %s does %shave nestmate access to %s",
362 this->external_name(),
363 access ? "" : "NOT ",
364 k->external_name());
365 }
366
367 return access;
368 }
369
370 InstanceKlass* InstanceKlass::allocate_instance_klass(const ClassFileParser& parser, TRAPS) {
371 const int size = InstanceKlass::size(parser.vtable_size(),
372 parser.itable_size(),
373 nonstatic_oop_map_size(parser.total_oop_map_count()),
374 parser.is_interface(),
375 parser.is_unsafe_anonymous(),
376 should_store_fingerprint(parser.is_unsafe_anonymous()),
377 parser.has_flattenable_fields() ? parser.java_fields_count() : 0,
378 parser.is_value_type());
379
380 const Symbol* const class_name = parser.class_name();
381 assert(class_name != NULL, "invariant");
382 ClassLoaderData* loader_data = parser.loader_data();
383 assert(loader_data != NULL, "invariant");
384
385 InstanceKlass* ik;
386
387 // Allocation
388 if (REF_NONE == parser.reference_type()) {
389 if (class_name == vmSymbols::java_lang_Class()) {
390 // mirror
391 ik = new (loader_data, size, THREAD) InstanceMirrorKlass(parser);
392 } else if (is_class_loader(class_name, parser)) {
393 // class loader
394 ik = new (loader_data, size, THREAD) InstanceClassLoaderKlass(parser);
395 } else if (parser.is_value_type()) {
396 // value type
397 ik = new (loader_data, size, THREAD) ValueKlass(parser);
398 } else {
399 // normal
400 ik = new (loader_data, size, THREAD) InstanceKlass(parser, InstanceKlass::_misc_kind_other);
401 }
402 } else {
403 // reference
404 ik = new (loader_data, size, THREAD) InstanceRefKlass(parser);
405 }
406
407 // Check for pending exception before adding to the loader data and incrementing
408 // class count. Can get OOM here.
409 if (HAS_PENDING_EXCEPTION) {
410 return NULL;
411 }
412
413 #ifdef ASSERT
414 assert(ik->size() == size, "");
415 ik->bounds_check((address) ik->start_of_vtable(), false, size);
416 ik->bounds_check((address) ik->start_of_itable(), false, size);
417 ik->bounds_check((address) ik->end_of_itable(), true, size);
418 ik->bounds_check((address) ik->end_of_nonstatic_oop_maps(), true, size);
419 #endif //ASSERT
420 return ik;
421 }
422
423 #ifndef PRODUCT
424 bool InstanceKlass::bounds_check(address addr, bool edge_ok, intptr_t size_in_bytes) const {
425 const char* bad = NULL;
426 address end = NULL;
427 if (addr < (address)this) {
428 bad = "before";
429 } else if (addr == (address)this) {
430 if (edge_ok) return true;
431 bad = "just before";
432 } else if (addr == (end = (address)this + sizeof(intptr_t) * (size_in_bytes < 0 ? size() : size_in_bytes))) {
433 if (edge_ok) return true;
434 bad = "just after";
435 } else if (addr > end) {
436 bad = "after";
437 } else {
438 return true;
439 }
440 tty->print_cr("%s object bounds: " INTPTR_FORMAT " [" INTPTR_FORMAT ".." INTPTR_FORMAT "]",
441 bad, (intptr_t)addr, (intptr_t)this, (intptr_t)end);
442 Verbose = WizardMode = true; this->print(); //@@
443 return false;
444 }
445 #endif //PRODUCT
446
447 // copy method ordering from resource area to Metaspace
448 void InstanceKlass::copy_method_ordering(const intArray* m, TRAPS) {
449 if (m != NULL) {
450 // allocate a new array and copy contents (memcpy?)
451 _method_ordering = MetadataFactory::new_array<int>(class_loader_data(), m->length(), CHECK);
452 for (int i = 0; i < m->length(); i++) {
453 _method_ordering->at_put(i, m->at(i));
454 }
455 } else {
456 _method_ordering = Universe::the_empty_int_array();
457 }
458 }
459
460 // create a new array of vtable_indices for default methods
461 Array<int>* InstanceKlass::create_new_default_vtable_indices(int len, TRAPS) {
462 Array<int>* vtable_indices = MetadataFactory::new_array<int>(class_loader_data(), len, CHECK_NULL);
463 assert(default_vtable_indices() == NULL, "only create once");
464 set_default_vtable_indices(vtable_indices);
465 return vtable_indices;
466 }
467
468 InstanceKlass::InstanceKlass(const ClassFileParser& parser, unsigned kind, KlassID id) :
469 Klass(id),
470 _nest_members(NULL),
471 _nest_host_index(0),
472 _nest_host(NULL),
473 _static_field_size(parser.static_field_size()),
474 _nonstatic_oop_map_size(nonstatic_oop_map_size(parser.total_oop_map_count())),
475 _itable_len(parser.itable_size()),
476 _extra_flags(0),
477 _init_thread(NULL),
478 _init_state(allocated),
479 _reference_type(parser.reference_type()),
480 _adr_valueklass_fixed_block(NULL)
481 {
482 set_vtable_length(parser.vtable_size());
483 set_kind(kind);
484 set_access_flags(parser.access_flags());
485 set_is_unsafe_anonymous(parser.is_unsafe_anonymous());
486 set_layout_helper(Klass::instance_layout_helper(parser.layout_size(),
487 false));
488 if (parser.has_flattenable_fields()) {
489 set_has_value_fields();
490 }
491 _java_fields_count = parser.java_fields_count();
492
493 assert(NULL == _methods, "underlying memory not zeroed?");
494 assert(is_instance_klass(), "is layout incorrect?");
495 assert(size_helper() == parser.layout_size(), "incorrect size_helper?");
496
497 if (DumpSharedSpaces || DynamicDumpSharedSpaces) {
498 SystemDictionaryShared::init_dumptime_info(this);
499 }
500 }
501
502 void InstanceKlass::deallocate_methods(ClassLoaderData* loader_data,
503 Array<Method*>* methods) {
504 if (methods != NULL && methods != Universe::the_empty_method_array() &&
505 !methods->is_shared()) {
506 for (int i = 0; i < methods->length(); i++) {
507 Method* method = methods->at(i);
508 if (method == NULL) continue; // maybe null if error processing
509 // Only want to delete methods that are not executing for RedefineClasses.
510 // The previous version will point to them so they're not totally dangling
511 assert (!method->on_stack(), "shouldn't be called with methods on stack");
512 MetadataFactory::free_metadata(loader_data, method);
513 }
514 MetadataFactory::free_array<Method*>(loader_data, methods);
515 }
516 }
517
518 void InstanceKlass::deallocate_interfaces(ClassLoaderData* loader_data,
519 const Klass* super_klass,
520 Array<InstanceKlass*>* local_interfaces,
521 Array<InstanceKlass*>* transitive_interfaces) {
522 // Only deallocate transitive interfaces if not empty, same as super class
523 // or same as local interfaces. See code in parseClassFile.
524 Array<InstanceKlass*>* ti = transitive_interfaces;
525 if (ti != Universe::the_empty_instance_klass_array() && ti != local_interfaces) {
526 // check that the interfaces don't come from super class
527 Array<InstanceKlass*>* sti = (super_klass == NULL) ? NULL :
528 InstanceKlass::cast(super_klass)->transitive_interfaces();
529 if (ti != sti && ti != NULL && !ti->is_shared()) {
530 MetadataFactory::free_array<InstanceKlass*>(loader_data, ti);
531 }
532 }
533
534 // local interfaces can be empty
535 if (local_interfaces != Universe::the_empty_instance_klass_array() &&
536 local_interfaces != NULL && !local_interfaces->is_shared()) {
537 MetadataFactory::free_array<InstanceKlass*>(loader_data, local_interfaces);
538 }
539 }
540
541 // This function deallocates the metadata and C heap pointers that the
542 // InstanceKlass points to.
543 void InstanceKlass::deallocate_contents(ClassLoaderData* loader_data) {
544
545 // Orphan the mirror first, CMS thinks it's still live.
546 if (java_mirror() != NULL) {
547 java_lang_Class::set_klass(java_mirror(), NULL);
548 }
549
550 // Also remove mirror from handles
551 loader_data->remove_handle(_java_mirror);
552
553 // Need to take this class off the class loader data list.
554 loader_data->remove_class(this);
555
556 // The array_klass for this class is created later, after error handling.
557 // For class redefinition, we keep the original class so this scratch class
558 // doesn't have an array class. Either way, assert that there is nothing
559 // to deallocate.
560 assert(array_klasses() == NULL, "array classes shouldn't be created for this class yet");
561
562 // Release C heap allocated data that this might point to, which includes
563 // reference counting symbol names.
564 release_C_heap_structures();
565
566 deallocate_methods(loader_data, methods());
567 set_methods(NULL);
568
569 if (method_ordering() != NULL &&
570 method_ordering() != Universe::the_empty_int_array() &&
571 !method_ordering()->is_shared()) {
572 MetadataFactory::free_array<int>(loader_data, method_ordering());
573 }
574 set_method_ordering(NULL);
575
576 // default methods can be empty
577 if (default_methods() != NULL &&
578 default_methods() != Universe::the_empty_method_array() &&
579 !default_methods()->is_shared()) {
580 MetadataFactory::free_array<Method*>(loader_data, default_methods());
581 }
582 // Do NOT deallocate the default methods, they are owned by superinterfaces.
583 set_default_methods(NULL);
584
585 // default methods vtable indices can be empty
586 if (default_vtable_indices() != NULL &&
587 !default_vtable_indices()->is_shared()) {
588 MetadataFactory::free_array<int>(loader_data, default_vtable_indices());
589 }
590 set_default_vtable_indices(NULL);
591
592
593 // This array is in Klass, but remove it with the InstanceKlass since
594 // this place would be the only caller and it can share memory with transitive
595 // interfaces.
596 if (secondary_supers() != NULL &&
597 secondary_supers() != Universe::the_empty_klass_array() &&
598 // see comments in compute_secondary_supers about the following cast
599 (address)(secondary_supers()) != (address)(transitive_interfaces()) &&
600 !secondary_supers()->is_shared()) {
601 MetadataFactory::free_array<Klass*>(loader_data, secondary_supers());
602 }
603 set_secondary_supers(NULL);
604
605 deallocate_interfaces(loader_data, super(), local_interfaces(), transitive_interfaces());
606 set_transitive_interfaces(NULL);
607 set_local_interfaces(NULL);
608
609 if (fields() != NULL && !fields()->is_shared()) {
610 MetadataFactory::free_array<jushort>(loader_data, fields());
611 }
612 set_fields(NULL, 0);
613
614 // If a method from a redefined class is using this constant pool, don't
615 // delete it, yet. The new class's previous version will point to this.
616 if (constants() != NULL) {
617 assert (!constants()->on_stack(), "shouldn't be called if anything is onstack");
618 if (!constants()->is_shared()) {
619 MetadataFactory::free_metadata(loader_data, constants());
620 }
621 // Delete any cached resolution errors for the constant pool
622 SystemDictionary::delete_resolution_error(constants());
623
624 set_constants(NULL);
625 }
626
627 if (inner_classes() != NULL &&
628 inner_classes() != Universe::the_empty_short_array() &&
629 !inner_classes()->is_shared()) {
630 MetadataFactory::free_array<jushort>(loader_data, inner_classes());
631 }
632 set_inner_classes(NULL);
633
634 if (nest_members() != NULL &&
635 nest_members() != Universe::the_empty_short_array() &&
636 !nest_members()->is_shared()) {
637 MetadataFactory::free_array<jushort>(loader_data, nest_members());
638 }
639 set_nest_members(NULL);
640
641 // We should deallocate the Annotations instance if it's not in shared spaces.
642 if (annotations() != NULL && !annotations()->is_shared()) {
643 MetadataFactory::free_metadata(loader_data, annotations());
644 }
645 set_annotations(NULL);
646
647 if (DumpSharedSpaces || DynamicDumpSharedSpaces) {
648 SystemDictionaryShared::remove_dumptime_info(this);
649 }
650 }
651
652 bool InstanceKlass::should_be_initialized() const {
653 return !is_initialized();
654 }
655
656 klassItable InstanceKlass::itable() const {
657 return klassItable(const_cast<InstanceKlass*>(this));
658 }
659
660 void InstanceKlass::eager_initialize(Thread *thread) {
661 if (!EagerInitialization) return;
662
663 if (this->is_not_initialized()) {
664 // abort if the the class has a class initializer
665 if (this->class_initializer() != NULL) return;
666
667 // abort if it is java.lang.Object (initialization is handled in genesis)
668 Klass* super_klass = super();
669 if (super_klass == NULL) return;
670
671 // abort if the super class should be initialized
672 if (!InstanceKlass::cast(super_klass)->is_initialized()) return;
673
674 // call body to expose the this pointer
675 eager_initialize_impl();
676 }
677 }
678
679 // JVMTI spec thinks there are signers and protection domain in the
680 // instanceKlass. These accessors pretend these fields are there.
681 // The hprof specification also thinks these fields are in InstanceKlass.
682 oop InstanceKlass::protection_domain() const {
683 // return the protection_domain from the mirror
684 return java_lang_Class::protection_domain(java_mirror());
685 }
686
687 // To remove these from requires an incompatible change and CCC request.
688 objArrayOop InstanceKlass::signers() const {
689 // return the signers from the mirror
690 return java_lang_Class::signers(java_mirror());
691 }
692
693 oop InstanceKlass::init_lock() const {
694 // return the init lock from the mirror
695 oop lock = java_lang_Class::init_lock(java_mirror());
696 // Prevent reordering with any access of initialization state
697 OrderAccess::loadload();
698 assert((oop)lock != NULL || !is_not_initialized(), // initialized or in_error state
699 "only fully initialized state can have a null lock");
700 return lock;
701 }
702
703 // Set the initialization lock to null so the object can be GC'ed. Any racing
704 // threads to get this lock will see a null lock and will not lock.
705 // That's okay because they all check for initialized state after getting
706 // the lock and return.
707 void InstanceKlass::fence_and_clear_init_lock() {
708 // make sure previous stores are all done, notably the init_state.
709 OrderAccess::storestore();
710 java_lang_Class::set_init_lock(java_mirror(), NULL);
711 assert(!is_not_initialized(), "class must be initialized now");
712 }
713
714 void InstanceKlass::eager_initialize_impl() {
715 EXCEPTION_MARK;
716 HandleMark hm(THREAD);
717 Handle h_init_lock(THREAD, init_lock());
718 ObjectLocker ol(h_init_lock, THREAD, h_init_lock() != NULL);
719
720 // abort if someone beat us to the initialization
721 if (!is_not_initialized()) return; // note: not equivalent to is_initialized()
722
723 ClassState old_state = init_state();
724 link_class_impl(THREAD);
725 if (HAS_PENDING_EXCEPTION) {
726 CLEAR_PENDING_EXCEPTION;
727 // Abort if linking the class throws an exception.
728
729 // Use a test to avoid redundantly resetting the state if there's
730 // no change. Set_init_state() asserts that state changes make
731 // progress, whereas here we might just be spinning in place.
732 if (old_state != _init_state)
733 set_init_state(old_state);
734 } else {
735 // linking successfull, mark class as initialized
736 set_init_state(fully_initialized);
737 fence_and_clear_init_lock();
738 // trace
739 if (log_is_enabled(Info, class, init)) {
740 ResourceMark rm(THREAD);
741 log_info(class, init)("[Initialized %s without side effects]", external_name());
742 }
743 }
744 }
745
746
747 // See "The Virtual Machine Specification" section 2.16.5 for a detailed explanation of the class initialization
748 // process. The step comments refers to the procedure described in that section.
749 // Note: implementation moved to static method to expose the this pointer.
750 void InstanceKlass::initialize(TRAPS) {
751 if (this->should_be_initialized()) {
752 initialize_impl(CHECK);
753 // Note: at this point the class may be initialized
754 // OR it may be in the state of being initialized
755 // in case of recursive initialization!
756 } else {
757 assert(is_initialized(), "sanity check");
758 }
759 }
760
761
762 bool InstanceKlass::verify_code(TRAPS) {
763 // 1) Verify the bytecodes
764 return Verifier::verify(this, should_verify_class(), THREAD);
765 }
766
767 void InstanceKlass::link_class(TRAPS) {
768 assert(is_loaded(), "must be loaded");
769 if (!is_linked()) {
770 link_class_impl(CHECK);
771 }
772 }
773
774 // Called to verify that a class can link during initialization, without
775 // throwing a VerifyError.
776 bool InstanceKlass::link_class_or_fail(TRAPS) {
777 assert(is_loaded(), "must be loaded");
778 if (!is_linked()) {
779 link_class_impl(CHECK_false);
780 }
781 return is_linked();
782 }
783
784 bool InstanceKlass::link_class_impl(TRAPS) {
785 if (DumpSharedSpaces && is_in_error_state()) {
786 // This is for CDS dumping phase only -- we use the in_error_state to indicate that
787 // the class has failed verification. Throwing the NoClassDefFoundError here is just
788 // a convenient way to stop repeat attempts to verify the same (bad) class.
789 //
790 // Note that the NoClassDefFoundError is not part of the JLS, and should not be thrown
791 // if we are executing Java code. This is not a problem for CDS dumping phase since
792 // it doesn't execute any Java code.
793 ResourceMark rm(THREAD);
794 Exceptions::fthrow(THREAD_AND_LOCATION,
795 vmSymbols::java_lang_NoClassDefFoundError(),
796 "Class %s, or one of its supertypes, failed class initialization",
797 external_name());
798 return false;
799 }
800 // return if already verified
801 if (is_linked()) {
802 return true;
803 }
804
805 // Timing
806 // timer handles recursion
807 assert(THREAD->is_Java_thread(), "non-JavaThread in link_class_impl");
808 JavaThread* jt = (JavaThread*)THREAD;
809
810 // link super class before linking this class
811 Klass* super_klass = super();
812 if (super_klass != NULL) {
813 if (super_klass->is_interface()) { // check if super class is an interface
814 ResourceMark rm(THREAD);
815 Exceptions::fthrow(
816 THREAD_AND_LOCATION,
817 vmSymbols::java_lang_IncompatibleClassChangeError(),
818 "class %s has interface %s as super class",
819 external_name(),
820 super_klass->external_name()
821 );
822 return false;
823 }
824
825 InstanceKlass* ik_super = InstanceKlass::cast(super_klass);
826 ik_super->link_class_impl(CHECK_false);
827 }
828
829 // link all interfaces implemented by this class before linking this class
830 Array<InstanceKlass*>* interfaces = local_interfaces();
831 int num_interfaces = interfaces->length();
832 for (int index = 0; index < num_interfaces; index++) {
833 InstanceKlass* interk = interfaces->at(index);
834 interk->link_class_impl(CHECK_false);
835 }
836
837
838 // If a class declares a method that uses a value class as an argument
839 // type or return value type, this value class must be loaded during the
840 // linking of this class because size and properties of the value class
841 // must be known in order to be able to perform value type optimizations.
842 // The implementation below is an approximation of this rule, the code
843 // iterates over all methods of the current class (including overridden
844 // methods), not only the methods declared by this class. This
845 // approximation makes the code simpler, and doesn't change the semantic
846 // because classes declaring methods overridden by the current class are
847 // linked (and have performed their own pre-loading) before the linking
848 // of the current class.
849 // This is also the moment to detect potential mismatch between the
850 // ValueTypes attribute and the kind of the class effectively loaded.
851
852
853 // Note:
854 // Value class types used for flattenable fields are loaded during
855 // the loading phase (see ClassFileParser::post_process_parsed_stream()).
856 // Value class types used as element types for array creation
857 // are not pre-loaded. Their loading is triggered by either anewarray
858 // or multianewarray bytecodes.
859
860 // Could it be possible to do the following processing only if the
861 // class uses value types?
862 {
863 ResourceMark rm(THREAD);
864 for (int i = 0; i < methods()->length(); i++) {
865 Method* m = methods()->at(i);
866 for (SignatureStream ss(m->signature()); !ss.is_done(); ss.next()) {
867 Symbol* sig = ss.as_symbol();
868 if (ss.is_object()) {
869 Symbol* symb = sig;
870 if (ss.is_array()) {
871 int i=0;
872 while (sig->char_at(i) == '[') i++;
873 if (i == sig->utf8_length() - 1 ) continue; // primitive array
874 symb = SymbolTable::new_symbol(sig->as_C_string() + i + 1,
875 sig->utf8_length() - 3);
876 }
877 if (ss.type() == T_VALUETYPE) {
878 oop loader = class_loader();
879 oop protection_domain = this->protection_domain();
880 Klass* klass = SystemDictionary::resolve_or_fail(symb,
881 Handle(THREAD, loader), Handle(THREAD, protection_domain), true,
882 CHECK_false);
883 if (symb != sig) {
884 symb->decrement_refcount();
885 }
886 if (klass == NULL) {
887 THROW_(vmSymbols::java_lang_LinkageError(), false);
888 }
889 if (!klass->is_value()) {
890 THROW_(vmSymbols::java_lang_IncompatibleClassChangeError(), false);
891 }
892 }
893 }
894 }
895 }
896 }
897
898 // in case the class is linked in the process of linking its superclasses
899 if (is_linked()) {
900 return true;
901 }
902
903 // trace only the link time for this klass that includes
904 // the verification time
905 PerfClassTraceTime vmtimer(ClassLoader::perf_class_link_time(),
906 ClassLoader::perf_class_link_selftime(),
907 ClassLoader::perf_classes_linked(),
908 jt->get_thread_stat()->perf_recursion_counts_addr(),
909 jt->get_thread_stat()->perf_timers_addr(),
910 PerfClassTraceTime::CLASS_LINK);
911
912 // verification & rewriting
913 {
914 HandleMark hm(THREAD);
915 Handle h_init_lock(THREAD, init_lock());
916 ObjectLocker ol(h_init_lock, THREAD, h_init_lock() != NULL);
917 // rewritten will have been set if loader constraint error found
918 // on an earlier link attempt
919 // don't verify or rewrite if already rewritten
920 //
921
922 if (!is_linked()) {
923 if (!is_rewritten()) {
924 {
925 bool verify_ok = verify_code(THREAD);
926 if (!verify_ok) {
927 return false;
928 }
929 }
930
931 // Just in case a side-effect of verify linked this class already
932 // (which can sometimes happen since the verifier loads classes
933 // using custom class loaders, which are free to initialize things)
934 if (is_linked()) {
935 return true;
936 }
937
938 // also sets rewritten
939 rewrite_class(CHECK_false);
940 } else if (is_shared()) {
941 SystemDictionaryShared::check_verification_constraints(this, CHECK_false);
942 }
943
944 // relocate jsrs and link methods after they are all rewritten
945 link_methods(CHECK_false);
946
947 // Initialize the vtable and interface table after
948 // methods have been rewritten since rewrite may
949 // fabricate new Method*s.
950 // also does loader constraint checking
951 //
952 // initialize_vtable and initialize_itable need to be rerun for
953 // a shared class if the class is not loaded by the NULL classloader.
954 ClassLoaderData * loader_data = class_loader_data();
955 if (!(is_shared() &&
956 loader_data->is_the_null_class_loader_data())) {
957 vtable().initialize_vtable(true, CHECK_false);
958 itable().initialize_itable(true, CHECK_false);
959 }
960 #ifdef ASSERT
961 else {
962 vtable().verify(tty, true);
963 // In case itable verification is ever added.
964 // itable().verify(tty, true);
965 }
966 #endif
967
968 set_init_state(linked);
969 if (JvmtiExport::should_post_class_prepare()) {
970 Thread *thread = THREAD;
971 assert(thread->is_Java_thread(), "thread->is_Java_thread()");
972 JvmtiExport::post_class_prepare((JavaThread *) thread, this);
973 }
974 }
975 }
976 return true;
977 }
978
979 // Rewrite the byte codes of all of the methods of a class.
980 // The rewriter must be called exactly once. Rewriting must happen after
981 // verification but before the first method of the class is executed.
982 void InstanceKlass::rewrite_class(TRAPS) {
983 assert(is_loaded(), "must be loaded");
984 if (is_rewritten()) {
985 assert(is_shared(), "rewriting an unshared class?");
986 return;
987 }
988 Rewriter::rewrite(this, CHECK);
989 set_rewritten();
990 }
991
992 // Now relocate and link method entry points after class is rewritten.
993 // This is outside is_rewritten flag. In case of an exception, it can be
994 // executed more than once.
995 void InstanceKlass::link_methods(TRAPS) {
996 int len = methods()->length();
997 for (int i = len-1; i >= 0; i--) {
998 methodHandle m(THREAD, methods()->at(i));
999
1000 // Set up method entry points for compiler and interpreter .
1001 m->link_method(m, CHECK);
1002 }
1003 }
1004
1005 // Eagerly initialize superinterfaces that declare default methods (concrete instance: any access)
1006 void InstanceKlass::initialize_super_interfaces(TRAPS) {
1007 assert (has_nonstatic_concrete_methods(), "caller should have checked this");
1008 for (int i = 0; i < local_interfaces()->length(); ++i) {
1009 InstanceKlass* ik = local_interfaces()->at(i);
1010
1011 // Initialization is depth first search ie. we start with top of the inheritance tree
1012 // has_nonstatic_concrete_methods drives searching superinterfaces since it
1013 // means has_nonstatic_concrete_methods in its superinterface hierarchy
1014 if (ik->has_nonstatic_concrete_methods()) {
1015 ik->initialize_super_interfaces(CHECK);
1016 }
1017
1018 // Only initialize() interfaces that "declare" concrete methods.
1019 if (ik->should_be_initialized() && ik->declares_nonstatic_concrete_methods()) {
1020 ik->initialize(CHECK);
1021 }
1022 }
1023 }
1024
1025 void InstanceKlass::initialize_impl(TRAPS) {
1026 HandleMark hm(THREAD);
1027
1028 // Make sure klass is linked (verified) before initialization
1029 // A class could already be verified, since it has been reflected upon.
1030 link_class(CHECK);
1031
1032 DTRACE_CLASSINIT_PROBE(required, -1);
1033
1034 bool wait = false;
1035
1036 assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl");
1037 JavaThread* jt = (JavaThread*)THREAD;
1038
1039 // refer to the JVM book page 47 for description of steps
1040 // Step 1
1041 {
1042 Handle h_init_lock(THREAD, init_lock());
1043 ObjectLocker ol(h_init_lock, THREAD, h_init_lock() != NULL);
1044
1045 // Step 2
1046 // If we were to use wait() instead of waitInterruptibly() then
1047 // we might end up throwing IE from link/symbol resolution sites
1048 // that aren't expected to throw. This would wreak havoc. See 6320309.
1049 while (is_being_initialized() && !is_reentrant_initialization(jt)) {
1050 wait = true;
1051 jt->set_class_to_be_initialized(this);
1052 ol.waitUninterruptibly(jt);
1053 jt->set_class_to_be_initialized(NULL);
1054 }
1055
1056 // Step 3
1057 if (is_being_initialized() && is_reentrant_initialization(jt)) {
1058 DTRACE_CLASSINIT_PROBE_WAIT(recursive, -1, wait);
1059 return;
1060 }
1061
1062 // Step 4
1063 if (is_initialized()) {
1064 DTRACE_CLASSINIT_PROBE_WAIT(concurrent, -1, wait);
1065 return;
1066 }
1067
1068 // Step 5
1069 if (is_in_error_state()) {
1070 DTRACE_CLASSINIT_PROBE_WAIT(erroneous, -1, wait);
1071 ResourceMark rm(THREAD);
1072 const char* desc = "Could not initialize class ";
1073 const char* className = external_name();
1074 size_t msglen = strlen(desc) + strlen(className) + 1;
1075 char* message = NEW_RESOURCE_ARRAY(char, msglen);
1076 if (NULL == message) {
1077 // Out of memory: can't create detailed error message
1078 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), className);
1079 } else {
1080 jio_snprintf(message, msglen, "%s%s", desc, className);
1081 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), message);
1082 }
1083 }
1084
1085 // Step 6
1086 set_init_state(being_initialized);
1087 set_init_thread(jt);
1088 }
1089
1090 // Step 7
1091 // Next, if C is a class rather than an interface, initialize it's super class and super
1092 // interfaces.
1093 if (!is_interface()) {
1094 Klass* super_klass = super();
1095 if (super_klass != NULL && super_klass->should_be_initialized()) {
1096 super_klass->initialize(THREAD);
1097 }
1098 // If C implements any interface that declares a non-static, concrete method,
1099 // the initialization of C triggers initialization of its super interfaces.
1100 // Only need to recurse if has_nonstatic_concrete_methods which includes declaring and
1101 // having a superinterface that declares, non-static, concrete methods
1102 if (!HAS_PENDING_EXCEPTION && has_nonstatic_concrete_methods()) {
1103 initialize_super_interfaces(THREAD);
1104 }
1105
1106 // If any exceptions, complete abruptly, throwing the same exception as above.
1107 if (HAS_PENDING_EXCEPTION) {
1108 Handle e(THREAD, PENDING_EXCEPTION);
1109 CLEAR_PENDING_EXCEPTION;
1110 {
1111 EXCEPTION_MARK;
1112 // Locks object, set state, and notify all waiting threads
1113 set_initialization_state_and_notify(initialization_error, THREAD);
1114 CLEAR_PENDING_EXCEPTION;
1115 }
1116 DTRACE_CLASSINIT_PROBE_WAIT(super__failed, -1, wait);
1117 THROW_OOP(e());
1118 }
1119 }
1120
1121 // Step 8
1122 // Initialize classes of flattenable fields
1123 {
1124 for (AllFieldStream fs(this); !fs.done(); fs.next()) {
1125 if (fs.is_flattenable()) {
1126 InstanceKlass* field_klass = InstanceKlass::cast(this->get_value_field_klass(fs.index()));
1127 field_klass->initialize(CHECK);
1128 }
1129 }
1130 }
1131
1132
1133 // Look for aot compiled methods for this klass, including class initializer.
1134 AOTLoader::load_for_klass(this, THREAD);
1135
1136 // Step 9
1137 {
1138 DTRACE_CLASSINIT_PROBE_WAIT(clinit, -1, wait);
1139 // Timer includes any side effects of class initialization (resolution,
1140 // etc), but not recursive entry into call_class_initializer().
1141 PerfClassTraceTime timer(ClassLoader::perf_class_init_time(),
1142 ClassLoader::perf_class_init_selftime(),
1143 ClassLoader::perf_classes_inited(),
1144 jt->get_thread_stat()->perf_recursion_counts_addr(),
1145 jt->get_thread_stat()->perf_timers_addr(),
1146 PerfClassTraceTime::CLASS_CLINIT);
1147 call_class_initializer(THREAD);
1148 }
1149
1150 // Step 10
1151 if (!HAS_PENDING_EXCEPTION) {
1152 set_initialization_state_and_notify(fully_initialized, CHECK);
1153 {
1154 debug_only(vtable().verify(tty, true);)
1155 }
1156 }
1157 else {
1158 // Step 11 and 12
1159 Handle e(THREAD, PENDING_EXCEPTION);
1160 CLEAR_PENDING_EXCEPTION;
1161 // JVMTI has already reported the pending exception
1162 // JVMTI internal flag reset is needed in order to report ExceptionInInitializerError
1163 JvmtiExport::clear_detected_exception(jt);
1164 {
1165 EXCEPTION_MARK;
1166 set_initialization_state_and_notify(initialization_error, THREAD);
1167 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, class initialization error is thrown below
1168 // JVMTI has already reported the pending exception
1169 // JVMTI internal flag reset is needed in order to report ExceptionInInitializerError
1170 JvmtiExport::clear_detected_exception(jt);
1171 }
1172 DTRACE_CLASSINIT_PROBE_WAIT(error, -1, wait);
1173 if (e->is_a(SystemDictionary::Error_klass())) {
1174 THROW_OOP(e());
1175 } else {
1176 JavaCallArguments args(e);
1177 THROW_ARG(vmSymbols::java_lang_ExceptionInInitializerError(),
1178 vmSymbols::throwable_void_signature(),
1179 &args);
1180 }
1181 }
1182 DTRACE_CLASSINIT_PROBE_WAIT(end, -1, wait);
1183 }
1184
1185
1186 void InstanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) {
1187 Handle h_init_lock(THREAD, init_lock());
1188 if (h_init_lock() != NULL) {
1189 ObjectLocker ol(h_init_lock, THREAD);
1190 set_init_thread(NULL); // reset _init_thread before changing _init_state
1191 set_init_state(state);
1192 fence_and_clear_init_lock();
1193 ol.notify_all(CHECK);
1194 } else {
1195 assert(h_init_lock() != NULL, "The initialization state should never be set twice");
1196 set_init_thread(NULL); // reset _init_thread before changing _init_state
1197 set_init_state(state);
1198 }
1199 }
1200
1201 Klass* InstanceKlass::implementor() const {
1202 Klass* volatile* k = adr_implementor();
1203 if (k == NULL) {
1204 return NULL;
1205 } else {
1206 // This load races with inserts, and therefore needs acquire.
1207 Klass* kls = OrderAccess::load_acquire(k);
1208 if (kls != NULL && !kls->is_loader_alive()) {
1209 return NULL; // don't return unloaded class
1210 } else {
1211 return kls;
1212 }
1213 }
1214 }
1215
1216
1217 void InstanceKlass::set_implementor(Klass* k) {
1218 assert_lock_strong(Compile_lock);
1219 assert(is_interface(), "not interface");
1220 Klass* volatile* addr = adr_implementor();
1221 assert(addr != NULL, "null addr");
1222 if (addr != NULL) {
1223 OrderAccess::release_store(addr, k);
1224 }
1225 }
1226
1227 int InstanceKlass::nof_implementors() const {
1228 Klass* k = implementor();
1229 if (k == NULL) {
1230 return 0;
1231 } else if (k != this) {
1232 return 1;
1233 } else {
1234 return 2;
1235 }
1236 }
1237
1238 // The embedded _implementor field can only record one implementor.
1239 // When there are more than one implementors, the _implementor field
1240 // is set to the interface Klass* itself. Following are the possible
1241 // values for the _implementor field:
1242 // NULL - no implementor
1243 // implementor Klass* - one implementor
1244 // self - more than one implementor
1245 //
1246 // The _implementor field only exists for interfaces.
1247 void InstanceKlass::add_implementor(Klass* k) {
1248 assert_lock_strong(Compile_lock);
1249 assert(is_interface(), "not interface");
1250 // Filter out my subinterfaces.
1251 // (Note: Interfaces are never on the subklass list.)
1252 if (InstanceKlass::cast(k)->is_interface()) return;
1253
1254 // Filter out subclasses whose supers already implement me.
1255 // (Note: CHA must walk subclasses of direct implementors
1256 // in order to locate indirect implementors.)
1257 Klass* sk = k->super();
1258 if (sk != NULL && InstanceKlass::cast(sk)->implements_interface(this))
1259 // We only need to check one immediate superclass, since the
1260 // implements_interface query looks at transitive_interfaces.
1261 // Any supers of the super have the same (or fewer) transitive_interfaces.
1262 return;
1263
1264 Klass* ik = implementor();
1265 if (ik == NULL) {
1266 set_implementor(k);
1267 } else if (ik != this) {
1268 // There is already an implementor. Use itself as an indicator of
1269 // more than one implementors.
1270 set_implementor(this);
1271 }
1272
1273 // The implementor also implements the transitive_interfaces
1274 for (int index = 0; index < local_interfaces()->length(); index++) {
1275 InstanceKlass::cast(local_interfaces()->at(index))->add_implementor(k);
1276 }
1277 }
1278
1279 void InstanceKlass::init_implementor() {
1280 if (is_interface()) {
1281 set_implementor(NULL);
1282 }
1283 }
1284
1285
1286 void InstanceKlass::process_interfaces(Thread *thread) {
1287 // link this class into the implementors list of every interface it implements
1288 for (int i = local_interfaces()->length() - 1; i >= 0; i--) {
1289 assert(local_interfaces()->at(i)->is_klass(), "must be a klass");
1290 InstanceKlass* interf = InstanceKlass::cast(local_interfaces()->at(i));
1291 assert(interf->is_interface(), "expected interface");
1292 interf->add_implementor(this);
1293 }
1294 }
1295
1296 bool InstanceKlass::can_be_primary_super_slow() const {
1297 if (is_interface())
1298 return false;
1299 else
1300 return Klass::can_be_primary_super_slow();
1301 }
1302
1303 GrowableArray<Klass*>* InstanceKlass::compute_secondary_supers(int num_extra_slots,
1304 Array<InstanceKlass*>* transitive_interfaces) {
1305 // The secondaries are the implemented interfaces.
1306 Array<InstanceKlass*>* interfaces = transitive_interfaces;
1307 int num_secondaries = num_extra_slots + interfaces->length();
1308 if (num_secondaries == 0) {
1309 // Must share this for correct bootstrapping!
1310 set_secondary_supers(Universe::the_empty_klass_array());
1311 return NULL;
1312 } else if (num_extra_slots == 0) {
1313 // The secondary super list is exactly the same as the transitive interfaces, so
1314 // let's use it instead of making a copy.
1315 // Redefine classes has to be careful not to delete this!
1316 // We need the cast because Array<Klass*> is NOT a supertype of Array<InstanceKlass*>,
1317 // (but it's safe to do here because we won't write into _secondary_supers from this point on).
1318 set_secondary_supers((Array<Klass*>*)(address)interfaces);
1319 return NULL;
1320 } else {
1321 // Copy transitive interfaces to a temporary growable array to be constructed
1322 // into the secondary super list with extra slots.
1323 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(interfaces->length());
1324 for (int i = 0; i < interfaces->length(); i++) {
1325 secondaries->push(interfaces->at(i));
1326 }
1327 return secondaries;
1328 }
1329 }
1330
1331 bool InstanceKlass::implements_interface(Klass* k) const {
1332 if (this == k) return true;
1333 assert(k->is_interface(), "should be an interface class");
1334 for (int i = 0; i < transitive_interfaces()->length(); i++) {
1335 if (transitive_interfaces()->at(i) == k) {
1336 return true;
1337 }
1338 }
1339 return false;
1340 }
1341
1342 bool InstanceKlass::is_same_or_direct_interface(Klass *k) const {
1343 // Verify direct super interface
1344 if (this == k) return true;
1345 assert(k->is_interface(), "should be an interface class");
1346 for (int i = 0; i < local_interfaces()->length(); i++) {
1347 if (local_interfaces()->at(i) == k) {
1348 return true;
1349 }
1350 }
1351 return false;
1352 }
1353
1354 objArrayOop InstanceKlass::allocate_objArray(int n, int length, TRAPS) {
1355 check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_NULL);
1356 int size = objArrayOopDesc::object_size(length);
1357 Klass* ak = array_klass(n, CHECK_NULL);
1358 objArrayOop o = (objArrayOop)Universe::heap()->array_allocate(ak, size, length,
1359 /* do_zero */ true, CHECK_NULL);
1360 return o;
1361 }
1362
1363 instanceOop InstanceKlass::register_finalizer(instanceOop i, TRAPS) {
1364 if (TraceFinalizerRegistration) {
1365 tty->print("Registered ");
1366 i->print_value_on(tty);
1367 tty->print_cr(" (" INTPTR_FORMAT ") as finalizable", p2i(i));
1368 }
1369 instanceHandle h_i(THREAD, i);
1370 // Pass the handle as argument, JavaCalls::call expects oop as jobjects
1371 JavaValue result(T_VOID);
1372 JavaCallArguments args(h_i);
1373 methodHandle mh (THREAD, Universe::finalizer_register_method());
1374 JavaCalls::call(&result, mh, &args, CHECK_NULL);
1375 return h_i();
1376 }
1377
1378 instanceOop InstanceKlass::allocate_instance(TRAPS) {
1379 bool has_finalizer_flag = has_finalizer(); // Query before possible GC
1380 int size = size_helper(); // Query before forming handle.
1381
1382 instanceOop i;
1383
1384 i = (instanceOop)Universe::heap()->obj_allocate(this, size, CHECK_NULL);
1385 if (has_finalizer_flag && !RegisterFinalizersAtInit) {
1386 i = register_finalizer(i, CHECK_NULL);
1387 }
1388 return i;
1389 }
1390
1391 instanceHandle InstanceKlass::allocate_instance_handle(TRAPS) {
1392 return instanceHandle(THREAD, allocate_instance(THREAD));
1393 }
1394
1395 void InstanceKlass::check_valid_for_instantiation(bool throwError, TRAPS) {
1396 if (is_interface() || is_abstract()) {
1397 ResourceMark rm(THREAD);
1398 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError()
1399 : vmSymbols::java_lang_InstantiationException(), external_name());
1400 }
1401 if (this == SystemDictionary::Class_klass()) {
1402 ResourceMark rm(THREAD);
1403 THROW_MSG(throwError ? vmSymbols::java_lang_IllegalAccessError()
1404 : vmSymbols::java_lang_IllegalAccessException(), external_name());
1405 }
1406 }
1407
1408 Klass* InstanceKlass::array_klass_impl(ArrayStorageProperties storage_props, bool or_null, int n, TRAPS) {
1409 assert(storage_props.is_empty(), "Unexpected");
1410 // Need load-acquire for lock-free read
1411 if (array_klasses_acquire() == NULL) {
1412 if (or_null) return NULL;
1413
1414 ResourceMark rm;
1415 {
1416 // Atomic creation of array_klasses
1417 MutexLocker ma(MultiArray_lock, THREAD);
1418
1419 // Check if update has already taken place
1420 if (array_klasses() == NULL) {
1421 Klass* k = ObjArrayKlass::allocate_objArray_klass(storage_props, 1, this, CHECK_NULL);
1422 // use 'release' to pair with lock-free load
1423 release_set_array_klasses(k);
1424 }
1425 }
1426 }
1427 // _this will always be set at this point
1428 ObjArrayKlass* oak = (ObjArrayKlass*)array_klasses();
1429 if (or_null) {
1430 return oak->array_klass_or_null(storage_props, n);
1431 }
1432 return oak->array_klass(storage_props, n, THREAD);
1433 }
1434
1435 Klass* InstanceKlass::array_klass_impl(ArrayStorageProperties storage_props, bool or_null, TRAPS) {
1436 return array_klass_impl(storage_props, or_null, 1, THREAD);
1437 }
1438
1439 static int call_class_initializer_counter = 0; // for debugging
1440
1441 Method* InstanceKlass::class_initializer() const {
1442 Method* clinit = find_method(
1443 vmSymbols::class_initializer_name(), vmSymbols::void_method_signature());
1444 if (clinit != NULL && clinit->is_class_initializer()) {
1445 return clinit;
1446 }
1447 return NULL;
1448 }
1449
1450 void InstanceKlass::call_class_initializer(TRAPS) {
1451 if (ReplayCompiles &&
1452 (ReplaySuppressInitializers == 1 ||
1453 (ReplaySuppressInitializers >= 2 && class_loader() != NULL))) {
1454 // Hide the existence of the initializer for the purpose of replaying the compile
1455 return;
1456 }
1457
1458 methodHandle h_method(THREAD, class_initializer());
1459 assert(!is_initialized(), "we cannot initialize twice");
1460 LogTarget(Info, class, init) lt;
1461 if (lt.is_enabled()) {
1462 ResourceMark rm;
1463 LogStream ls(lt);
1464 ls.print("%d Initializing ", call_class_initializer_counter++);
1465 name()->print_value_on(&ls);
1466 ls.print_cr("%s (" INTPTR_FORMAT ")", h_method() == NULL ? "(no method)" : "", p2i(this));
1467 }
1468 if (h_method() != NULL) {
1469 JavaCallArguments args; // No arguments
1470 JavaValue result(T_VOID);
1471 JavaCalls::call(&result, h_method, &args, CHECK); // Static call (no args)
1472 }
1473 }
1474
1475
1476 void InstanceKlass::mask_for(const methodHandle& method, int bci,
1477 InterpreterOopMap* entry_for) {
1478 // Lazily create the _oop_map_cache at first request
1479 // Lock-free access requires load_acquire.
1480 OopMapCache* oop_map_cache = OrderAccess::load_acquire(&_oop_map_cache);
1481 if (oop_map_cache == NULL) {
1482 MutexLocker x(OopMapCacheAlloc_lock, Mutex::_no_safepoint_check_flag);
1483 // Check if _oop_map_cache was allocated while we were waiting for this lock
1484 if ((oop_map_cache = _oop_map_cache) == NULL) {
1485 oop_map_cache = new OopMapCache();
1486 // Ensure _oop_map_cache is stable, since it is examined without a lock
1487 OrderAccess::release_store(&_oop_map_cache, oop_map_cache);
1488 }
1489 }
1490 // _oop_map_cache is constant after init; lookup below does its own locking.
1491 oop_map_cache->lookup(method, bci, entry_for);
1492 }
1493
1494
1495 bool InstanceKlass::find_local_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1496 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1497 Symbol* f_name = fs.name();
1498 Symbol* f_sig = fs.signature();
1499 if (f_name == name && f_sig == sig) {
1500 fd->reinitialize(const_cast<InstanceKlass*>(this), fs.index());
1501 return true;
1502 }
1503 }
1504 return false;
1505 }
1506
1507
1508 Klass* InstanceKlass::find_interface_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1509 const int n = local_interfaces()->length();
1510 for (int i = 0; i < n; i++) {
1511 Klass* intf1 = local_interfaces()->at(i);
1512 assert(intf1->is_interface(), "just checking type");
1513 // search for field in current interface
1514 if (InstanceKlass::cast(intf1)->find_local_field(name, sig, fd)) {
1515 assert(fd->is_static(), "interface field must be static");
1516 return intf1;
1517 }
1518 // search for field in direct superinterfaces
1519 Klass* intf2 = InstanceKlass::cast(intf1)->find_interface_field(name, sig, fd);
1520 if (intf2 != NULL) return intf2;
1521 }
1522 // otherwise field lookup fails
1523 return NULL;
1524 }
1525
1526
1527 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1528 // search order according to newest JVM spec (5.4.3.2, p.167).
1529 // 1) search for field in current klass
1530 if (find_local_field(name, sig, fd)) {
1531 return const_cast<InstanceKlass*>(this);
1532 }
1533 // 2) search for field recursively in direct superinterfaces
1534 { Klass* intf = find_interface_field(name, sig, fd);
1535 if (intf != NULL) return intf;
1536 }
1537 // 3) apply field lookup recursively if superclass exists
1538 { Klass* supr = super();
1539 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, fd);
1540 }
1541 // 4) otherwise field lookup fails
1542 return NULL;
1543 }
1544
1545
1546 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, bool is_static, fieldDescriptor* fd) const {
1547 // search order according to newest JVM spec (5.4.3.2, p.167).
1548 // 1) search for field in current klass
1549 if (find_local_field(name, sig, fd)) {
1550 if (fd->is_static() == is_static) return const_cast<InstanceKlass*>(this);
1551 }
1552 // 2) search for field recursively in direct superinterfaces
1553 if (is_static) {
1554 Klass* intf = find_interface_field(name, sig, fd);
1555 if (intf != NULL) return intf;
1556 }
1557 // 3) apply field lookup recursively if superclass exists
1558 { Klass* supr = super();
1559 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, is_static, fd);
1560 }
1561 // 4) otherwise field lookup fails
1562 return NULL;
1563 }
1564
1565
1566 bool InstanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
1567 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1568 if (fs.offset() == offset) {
1569 fd->reinitialize(const_cast<InstanceKlass*>(this), fs.index());
1570 if (fd->is_static() == is_static) return true;
1571 }
1572 }
1573 return false;
1574 }
1575
1576
1577 bool InstanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
1578 Klass* klass = const_cast<InstanceKlass*>(this);
1579 while (klass != NULL) {
1580 if (InstanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) {
1581 return true;
1582 }
1583 klass = klass->super();
1584 }
1585 return false;
1586 }
1587
1588
1589 void InstanceKlass::methods_do(void f(Method* method)) {
1590 // Methods aren't stable until they are loaded. This can be read outside
1591 // a lock through the ClassLoaderData for profiling
1592 if (!is_loaded()) {
1593 return;
1594 }
1595
1596 int len = methods()->length();
1597 for (int index = 0; index < len; index++) {
1598 Method* m = methods()->at(index);
1599 assert(m->is_method(), "must be method");
1600 f(m);
1601 }
1602 }
1603
1604
1605 void InstanceKlass::do_local_static_fields(FieldClosure* cl) {
1606 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1607 if (fs.access_flags().is_static()) {
1608 fieldDescriptor& fd = fs.field_descriptor();
1609 cl->do_field(&fd);
1610 }
1611 }
1612 }
1613
1614
1615 void InstanceKlass::do_local_static_fields(void f(fieldDescriptor*, Handle, TRAPS), Handle mirror, TRAPS) {
1616 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1617 if (fs.access_flags().is_static()) {
1618 fieldDescriptor& fd = fs.field_descriptor();
1619 f(&fd, mirror, CHECK);
1620 }
1621 }
1622 }
1623
1624
1625 static int compare_fields_by_offset(int* a, int* b) {
1626 return a[0] - b[0];
1627 }
1628
1629 void InstanceKlass::do_nonstatic_fields(FieldClosure* cl) {
1630 InstanceKlass* super = superklass();
1631 if (super != NULL) {
1632 super->do_nonstatic_fields(cl);
1633 }
1634 fieldDescriptor fd;
1635 int length = java_fields_count();
1636 // In DebugInfo nonstatic fields are sorted by offset.
1637 int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1), mtClass);
1638 int j = 0;
1639 for (int i = 0; i < length; i += 1) {
1640 fd.reinitialize(this, i);
1641 if (!fd.is_static()) {
1642 fields_sorted[j + 0] = fd.offset();
1643 fields_sorted[j + 1] = i;
1644 j += 2;
1645 }
1646 }
1647 if (j > 0) {
1648 length = j;
1649 // _sort_Fn is defined in growableArray.hpp.
1650 qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset);
1651 for (int i = 0; i < length; i += 2) {
1652 fd.reinitialize(this, fields_sorted[i + 1]);
1653 assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields");
1654 cl->do_field(&fd);
1655 }
1656 }
1657 FREE_C_HEAP_ARRAY(int, fields_sorted);
1658 }
1659
1660
1661 void InstanceKlass::array_klasses_do(void f(Klass* k)) {
1662 if (array_klasses() != NULL)
1663 ArrayKlass::cast(array_klasses())->array_klasses_do(f);
1664 }
1665
1666 #ifdef ASSERT
1667 static int linear_search(const Array<Method*>* methods,
1668 const Symbol* name,
1669 const Symbol* signature) {
1670 const int len = methods->length();
1671 for (int index = 0; index < len; index++) {
1672 const Method* const m = methods->at(index);
1673 assert(m->is_method(), "must be method");
1674 if (m->signature() == signature && m->name() == name) {
1675 return index;
1676 }
1677 }
1678 return -1;
1679 }
1680 #endif
1681
1682 static int binary_search(const Array<Method*>* methods, const Symbol* name) {
1683 int len = methods->length();
1684 // methods are sorted, so do binary search
1685 int l = 0;
1686 int h = len - 1;
1687 while (l <= h) {
1688 int mid = (l + h) >> 1;
1689 Method* m = methods->at(mid);
1690 assert(m->is_method(), "must be method");
1691 int res = m->name()->fast_compare(name);
1692 if (res == 0) {
1693 return mid;
1694 } else if (res < 0) {
1695 l = mid + 1;
1696 } else {
1697 h = mid - 1;
1698 }
1699 }
1700 return -1;
1701 }
1702
1703 // find_method looks up the name/signature in the local methods array
1704 Method* InstanceKlass::find_method(const Symbol* name,
1705 const Symbol* signature) const {
1706 return find_method_impl(name, signature, find_overpass, find_static, find_private);
1707 }
1708
1709 Method* InstanceKlass::find_method_impl(const Symbol* name,
1710 const Symbol* signature,
1711 OverpassLookupMode overpass_mode,
1712 StaticLookupMode static_mode,
1713 PrivateLookupMode private_mode) const {
1714 return InstanceKlass::find_method_impl(methods(),
1715 name,
1716 signature,
1717 overpass_mode,
1718 static_mode,
1719 private_mode);
1720 }
1721
1722 // find_instance_method looks up the name/signature in the local methods array
1723 // and skips over static methods
1724 Method* InstanceKlass::find_instance_method(const Array<Method*>* methods,
1725 const Symbol* name,
1726 const Symbol* signature,
1727 PrivateLookupMode private_mode) {
1728 Method* const meth = InstanceKlass::find_method_impl(methods,
1729 name,
1730 signature,
1731 find_overpass,
1732 skip_static,
1733 private_mode);
1734 assert(((meth == NULL) || !meth->is_static()),
1735 "find_instance_method should have skipped statics");
1736 return meth;
1737 }
1738
1739 // find_instance_method looks up the name/signature in the local methods array
1740 // and skips over static methods
1741 Method* InstanceKlass::find_instance_method(const Symbol* name,
1742 const Symbol* signature,
1743 PrivateLookupMode private_mode) const {
1744 return InstanceKlass::find_instance_method(methods(), name, signature, private_mode);
1745 }
1746
1747 // Find looks up the name/signature in the local methods array
1748 // and filters on the overpass, static and private flags
1749 // This returns the first one found
1750 // note that the local methods array can have up to one overpass, one static
1751 // and one instance (private or not) with the same name/signature
1752 Method* InstanceKlass::find_local_method(const Symbol* name,
1753 const Symbol* signature,
1754 OverpassLookupMode overpass_mode,
1755 StaticLookupMode static_mode,
1756 PrivateLookupMode private_mode) const {
1757 return InstanceKlass::find_method_impl(methods(),
1758 name,
1759 signature,
1760 overpass_mode,
1761 static_mode,
1762 private_mode);
1763 }
1764
1765 // Find looks up the name/signature in the local methods array
1766 // and filters on the overpass, static and private flags
1767 // This returns the first one found
1768 // note that the local methods array can have up to one overpass, one static
1769 // and one instance (private or not) with the same name/signature
1770 Method* InstanceKlass::find_local_method(const Array<Method*>* methods,
1771 const Symbol* name,
1772 const Symbol* signature,
1773 OverpassLookupMode overpass_mode,
1774 StaticLookupMode static_mode,
1775 PrivateLookupMode private_mode) {
1776 return InstanceKlass::find_method_impl(methods,
1777 name,
1778 signature,
1779 overpass_mode,
1780 static_mode,
1781 private_mode);
1782 }
1783
1784 Method* InstanceKlass::find_method(const Array<Method*>* methods,
1785 const Symbol* name,
1786 const Symbol* signature) {
1787 return InstanceKlass::find_method_impl(methods,
1788 name,
1789 signature,
1790 find_overpass,
1791 find_static,
1792 find_private);
1793 }
1794
1795 Method* InstanceKlass::find_method_impl(const Array<Method*>* methods,
1796 const Symbol* name,
1797 const Symbol* signature,
1798 OverpassLookupMode overpass_mode,
1799 StaticLookupMode static_mode,
1800 PrivateLookupMode private_mode) {
1801 int hit = find_method_index(methods, name, signature, overpass_mode, static_mode, private_mode);
1802 return hit >= 0 ? methods->at(hit): NULL;
1803 }
1804
1805 // true if method matches signature and conforms to skipping_X conditions.
1806 static bool method_matches(const Method* m,
1807 const Symbol* signature,
1808 bool skipping_overpass,
1809 bool skipping_static,
1810 bool skipping_private) {
1811 return ((m->signature() == signature) &&
1812 (!skipping_overpass || !m->is_overpass()) &&
1813 (!skipping_static || !m->is_static()) &&
1814 (!skipping_private || !m->is_private()));
1815 }
1816
1817 // Used directly for default_methods to find the index into the
1818 // default_vtable_indices, and indirectly by find_method
1819 // find_method_index looks in the local methods array to return the index
1820 // of the matching name/signature. If, overpass methods are being ignored,
1821 // the search continues to find a potential non-overpass match. This capability
1822 // is important during method resolution to prefer a static method, for example,
1823 // over an overpass method.
1824 // There is the possibility in any _method's array to have the same name/signature
1825 // for a static method, an overpass method and a local instance method
1826 // To correctly catch a given method, the search criteria may need
1827 // to explicitly skip the other two. For local instance methods, it
1828 // is often necessary to skip private methods
1829 int InstanceKlass::find_method_index(const Array<Method*>* methods,
1830 const Symbol* name,
1831 const Symbol* signature,
1832 OverpassLookupMode overpass_mode,
1833 StaticLookupMode static_mode,
1834 PrivateLookupMode private_mode) {
1835 const bool skipping_overpass = (overpass_mode == skip_overpass);
1836 const bool skipping_static = (static_mode == skip_static);
1837 const bool skipping_private = (private_mode == skip_private);
1838 const int hit = binary_search(methods, name);
1839 if (hit != -1) {
1840 const Method* const m = methods->at(hit);
1841
1842 // Do linear search to find matching signature. First, quick check
1843 // for common case, ignoring overpasses if requested.
1844 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) {
1845 return hit;
1846 }
1847
1848 // search downwards through overloaded methods
1849 int i;
1850 for (i = hit - 1; i >= 0; --i) {
1851 const Method* const m = methods->at(i);
1852 assert(m->is_method(), "must be method");
1853 if (m->name() != name) {
1854 break;
1855 }
1856 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) {
1857 return i;
1858 }
1859 }
1860 // search upwards
1861 for (i = hit + 1; i < methods->length(); ++i) {
1862 const Method* const m = methods->at(i);
1863 assert(m->is_method(), "must be method");
1864 if (m->name() != name) {
1865 break;
1866 }
1867 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) {
1868 return i;
1869 }
1870 }
1871 // not found
1872 #ifdef ASSERT
1873 const int index = (skipping_overpass || skipping_static || skipping_private) ? -1 :
1874 linear_search(methods, name, signature);
1875 assert(-1 == index, "binary search should have found entry %d", index);
1876 #endif
1877 }
1878 return -1;
1879 }
1880
1881 int InstanceKlass::find_method_by_name(const Symbol* name, int* end) const {
1882 return find_method_by_name(methods(), name, end);
1883 }
1884
1885 int InstanceKlass::find_method_by_name(const Array<Method*>* methods,
1886 const Symbol* name,
1887 int* end_ptr) {
1888 assert(end_ptr != NULL, "just checking");
1889 int start = binary_search(methods, name);
1890 int end = start + 1;
1891 if (start != -1) {
1892 while (start - 1 >= 0 && (methods->at(start - 1))->name() == name) --start;
1893 while (end < methods->length() && (methods->at(end))->name() == name) ++end;
1894 *end_ptr = end;
1895 return start;
1896 }
1897 return -1;
1898 }
1899
1900 // uncached_lookup_method searches both the local class methods array and all
1901 // superclasses methods arrays, skipping any overpass methods in superclasses,
1902 // and possibly skipping private methods.
1903 Method* InstanceKlass::uncached_lookup_method(const Symbol* name,
1904 const Symbol* signature,
1905 OverpassLookupMode overpass_mode,
1906 PrivateLookupMode private_mode) const {
1907 OverpassLookupMode overpass_local_mode = overpass_mode;
1908 const Klass* klass = this;
1909 while (klass != NULL) {
1910 Method* const method = InstanceKlass::cast(klass)->find_method_impl(name,
1911 signature,
1912 overpass_local_mode,
1913 find_static,
1914 private_mode);
1915 if (method != NULL) {
1916 return method;
1917 }
1918 if (name == vmSymbols::object_initializer_name()) {
1919 break; // <init> is never inherited, not even as a static factory
1920 }
1921 klass = klass->super();
1922 overpass_local_mode = skip_overpass; // Always ignore overpass methods in superclasses
1923 }
1924 return NULL;
1925 }
1926
1927 #ifdef ASSERT
1928 // search through class hierarchy and return true if this class or
1929 // one of the superclasses was redefined
1930 bool InstanceKlass::has_redefined_this_or_super() const {
1931 const Klass* klass = this;
1932 while (klass != NULL) {
1933 if (InstanceKlass::cast(klass)->has_been_redefined()) {
1934 return true;
1935 }
1936 klass = klass->super();
1937 }
1938 return false;
1939 }
1940 #endif
1941
1942 // lookup a method in the default methods list then in all transitive interfaces
1943 // Do NOT return private or static methods
1944 Method* InstanceKlass::lookup_method_in_ordered_interfaces(Symbol* name,
1945 Symbol* signature) const {
1946 Method* m = NULL;
1947 if (default_methods() != NULL) {
1948 m = find_method(default_methods(), name, signature);
1949 }
1950 // Look up interfaces
1951 if (m == NULL) {
1952 m = lookup_method_in_all_interfaces(name, signature, find_defaults);
1953 }
1954 return m;
1955 }
1956
1957 // lookup a method in all the interfaces that this class implements
1958 // Do NOT return private or static methods, new in JDK8 which are not externally visible
1959 // They should only be found in the initial InterfaceMethodRef
1960 Method* InstanceKlass::lookup_method_in_all_interfaces(Symbol* name,
1961 Symbol* signature,
1962 DefaultsLookupMode defaults_mode) const {
1963 Array<InstanceKlass*>* all_ifs = transitive_interfaces();
1964 int num_ifs = all_ifs->length();
1965 InstanceKlass *ik = NULL;
1966 for (int i = 0; i < num_ifs; i++) {
1967 ik = all_ifs->at(i);
1968 Method* m = ik->lookup_method(name, signature);
1969 if (m != NULL && m->is_public() && !m->is_static() &&
1970 ((defaults_mode != skip_defaults) || !m->is_default_method())) {
1971 return m;
1972 }
1973 }
1974 return NULL;
1975 }
1976
1977 /* jni_id_for_impl for jfieldIds only */
1978 JNIid* InstanceKlass::jni_id_for_impl(int offset) {
1979 MutexLocker ml(JfieldIdCreation_lock);
1980 // Retry lookup after we got the lock
1981 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset);
1982 if (probe == NULL) {
1983 // Slow case, allocate new static field identifier
1984 probe = new JNIid(this, offset, jni_ids());
1985 set_jni_ids(probe);
1986 }
1987 return probe;
1988 }
1989
1990
1991 /* jni_id_for for jfieldIds only */
1992 JNIid* InstanceKlass::jni_id_for(int offset) {
1993 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset);
1994 if (probe == NULL) {
1995 probe = jni_id_for_impl(offset);
1996 }
1997 return probe;
1998 }
1999
2000 u2 InstanceKlass::enclosing_method_data(int offset) const {
2001 const Array<jushort>* const inner_class_list = inner_classes();
2002 if (inner_class_list == NULL) {
2003 return 0;
2004 }
2005 const int length = inner_class_list->length();
2006 if (length % inner_class_next_offset == 0) {
2007 return 0;
2008 }
2009 const int index = length - enclosing_method_attribute_size;
2010 assert(offset < enclosing_method_attribute_size, "invalid offset");
2011 return inner_class_list->at(index + offset);
2012 }
2013
2014 void InstanceKlass::set_enclosing_method_indices(u2 class_index,
2015 u2 method_index) {
2016 Array<jushort>* inner_class_list = inner_classes();
2017 assert (inner_class_list != NULL, "_inner_classes list is not set up");
2018 int length = inner_class_list->length();
2019 if (length % inner_class_next_offset == enclosing_method_attribute_size) {
2020 int index = length - enclosing_method_attribute_size;
2021 inner_class_list->at_put(
2022 index + enclosing_method_class_index_offset, class_index);
2023 inner_class_list->at_put(
2024 index + enclosing_method_method_index_offset, method_index);
2025 }
2026 }
2027
2028 // Lookup or create a jmethodID.
2029 // This code is called by the VMThread and JavaThreads so the
2030 // locking has to be done very carefully to avoid deadlocks
2031 // and/or other cache consistency problems.
2032 //
2033 jmethodID InstanceKlass::get_jmethod_id(const methodHandle& method_h) {
2034 size_t idnum = (size_t)method_h->method_idnum();
2035 jmethodID* jmeths = methods_jmethod_ids_acquire();
2036 size_t length = 0;
2037 jmethodID id = NULL;
2038
2039 // We use a double-check locking idiom here because this cache is
2040 // performance sensitive. In the normal system, this cache only
2041 // transitions from NULL to non-NULL which is safe because we use
2042 // release_set_methods_jmethod_ids() to advertise the new cache.
2043 // A partially constructed cache should never be seen by a racing
2044 // thread. We also use release_store() to save a new jmethodID
2045 // in the cache so a partially constructed jmethodID should never be
2046 // seen either. Cache reads of existing jmethodIDs proceed without a
2047 // lock, but cache writes of a new jmethodID requires uniqueness and
2048 // creation of the cache itself requires no leaks so a lock is
2049 // generally acquired in those two cases.
2050 //
2051 // If the RedefineClasses() API has been used, then this cache can
2052 // grow and we'll have transitions from non-NULL to bigger non-NULL.
2053 // Cache creation requires no leaks and we require safety between all
2054 // cache accesses and freeing of the old cache so a lock is generally
2055 // acquired when the RedefineClasses() API has been used.
2056
2057 if (jmeths != NULL) {
2058 // the cache already exists
2059 if (!idnum_can_increment()) {
2060 // the cache can't grow so we can just get the current values
2061 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
2062 } else {
2063 // cache can grow so we have to be more careful
2064 if (Threads::number_of_threads() == 0 ||
2065 SafepointSynchronize::is_at_safepoint()) {
2066 // we're single threaded or at a safepoint - no locking needed
2067 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
2068 } else {
2069 MutexLocker ml(JmethodIdCreation_lock);
2070 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
2071 }
2072 }
2073 }
2074 // implied else:
2075 // we need to allocate a cache so default length and id values are good
2076
2077 if (jmeths == NULL || // no cache yet
2078 length <= idnum || // cache is too short
2079 id == NULL) { // cache doesn't contain entry
2080
2081 // This function can be called by the VMThread so we have to do all
2082 // things that might block on a safepoint before grabbing the lock.
2083 // Otherwise, we can deadlock with the VMThread or have a cache
2084 // consistency issue. These vars keep track of what we might have
2085 // to free after the lock is dropped.
2086 jmethodID to_dealloc_id = NULL;
2087 jmethodID* to_dealloc_jmeths = NULL;
2088
2089 // may not allocate new_jmeths or use it if we allocate it
2090 jmethodID* new_jmeths = NULL;
2091 if (length <= idnum) {
2092 // allocate a new cache that might be used
2093 size_t size = MAX2(idnum+1, (size_t)idnum_allocated_count());
2094 new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1, mtClass);
2095 memset(new_jmeths, 0, (size+1)*sizeof(jmethodID));
2096 // cache size is stored in element[0], other elements offset by one
2097 new_jmeths[0] = (jmethodID)size;
2098 }
2099
2100 // allocate a new jmethodID that might be used
2101 jmethodID new_id = NULL;
2102 if (method_h->is_old() && !method_h->is_obsolete()) {
2103 // The method passed in is old (but not obsolete), we need to use the current version
2104 Method* current_method = method_with_idnum((int)idnum);
2105 assert(current_method != NULL, "old and but not obsolete, so should exist");
2106 new_id = Method::make_jmethod_id(class_loader_data(), current_method);
2107 } else {
2108 // It is the current version of the method or an obsolete method,
2109 // use the version passed in
2110 new_id = Method::make_jmethod_id(class_loader_data(), method_h());
2111 }
2112
2113 if (Threads::number_of_threads() == 0 ||
2114 SafepointSynchronize::is_at_safepoint()) {
2115 // we're single threaded or at a safepoint - no locking needed
2116 id = get_jmethod_id_fetch_or_update(idnum, new_id, new_jmeths,
2117 &to_dealloc_id, &to_dealloc_jmeths);
2118 } else {
2119 MutexLocker ml(JmethodIdCreation_lock);
2120 id = get_jmethod_id_fetch_or_update(idnum, new_id, new_jmeths,
2121 &to_dealloc_id, &to_dealloc_jmeths);
2122 }
2123
2124 // The lock has been dropped so we can free resources.
2125 // Free up either the old cache or the new cache if we allocated one.
2126 if (to_dealloc_jmeths != NULL) {
2127 FreeHeap(to_dealloc_jmeths);
2128 }
2129 // free up the new ID since it wasn't needed
2130 if (to_dealloc_id != NULL) {
2131 Method::destroy_jmethod_id(class_loader_data(), to_dealloc_id);
2132 }
2133 }
2134 return id;
2135 }
2136
2137 // Figure out how many jmethodIDs haven't been allocated, and make
2138 // sure space for them is pre-allocated. This makes getting all
2139 // method ids much, much faster with classes with more than 8
2140 // methods, and has a *substantial* effect on performance with jvmti
2141 // code that loads all jmethodIDs for all classes.
2142 void InstanceKlass::ensure_space_for_methodids(int start_offset) {
2143 int new_jmeths = 0;
2144 int length = methods()->length();
2145 for (int index = start_offset; index < length; index++) {
2146 Method* m = methods()->at(index);
2147 jmethodID id = m->find_jmethod_id_or_null();
2148 if (id == NULL) {
2149 new_jmeths++;
2150 }
2151 }
2152 if (new_jmeths != 0) {
2153 Method::ensure_jmethod_ids(class_loader_data(), new_jmeths);
2154 }
2155 }
2156
2157 // Common code to fetch the jmethodID from the cache or update the
2158 // cache with the new jmethodID. This function should never do anything
2159 // that causes the caller to go to a safepoint or we can deadlock with
2160 // the VMThread or have cache consistency issues.
2161 //
2162 jmethodID InstanceKlass::get_jmethod_id_fetch_or_update(
2163 size_t idnum, jmethodID new_id,
2164 jmethodID* new_jmeths, jmethodID* to_dealloc_id_p,
2165 jmethodID** to_dealloc_jmeths_p) {
2166 assert(new_id != NULL, "sanity check");
2167 assert(to_dealloc_id_p != NULL, "sanity check");
2168 assert(to_dealloc_jmeths_p != NULL, "sanity check");
2169 assert(Threads::number_of_threads() == 0 ||
2170 SafepointSynchronize::is_at_safepoint() ||
2171 JmethodIdCreation_lock->owned_by_self(), "sanity check");
2172
2173 // reacquire the cache - we are locked, single threaded or at a safepoint
2174 jmethodID* jmeths = methods_jmethod_ids_acquire();
2175 jmethodID id = NULL;
2176 size_t length = 0;
2177
2178 if (jmeths == NULL || // no cache yet
2179 (length = (size_t)jmeths[0]) <= idnum) { // cache is too short
2180 if (jmeths != NULL) {
2181 // copy any existing entries from the old cache
2182 for (size_t index = 0; index < length; index++) {
2183 new_jmeths[index+1] = jmeths[index+1];
2184 }
2185 *to_dealloc_jmeths_p = jmeths; // save old cache for later delete
2186 }
2187 release_set_methods_jmethod_ids(jmeths = new_jmeths);
2188 } else {
2189 // fetch jmethodID (if any) from the existing cache
2190 id = jmeths[idnum+1];
2191 *to_dealloc_jmeths_p = new_jmeths; // save new cache for later delete
2192 }
2193 if (id == NULL) {
2194 // No matching jmethodID in the existing cache or we have a new
2195 // cache or we just grew the cache. This cache write is done here
2196 // by the first thread to win the foot race because a jmethodID
2197 // needs to be unique once it is generally available.
2198 id = new_id;
2199
2200 // The jmethodID cache can be read while unlocked so we have to
2201 // make sure the new jmethodID is complete before installing it
2202 // in the cache.
2203 OrderAccess::release_store(&jmeths[idnum+1], id);
2204 } else {
2205 *to_dealloc_id_p = new_id; // save new id for later delete
2206 }
2207 return id;
2208 }
2209
2210
2211 // Common code to get the jmethodID cache length and the jmethodID
2212 // value at index idnum if there is one.
2213 //
2214 void InstanceKlass::get_jmethod_id_length_value(jmethodID* cache,
2215 size_t idnum, size_t *length_p, jmethodID* id_p) {
2216 assert(cache != NULL, "sanity check");
2217 assert(length_p != NULL, "sanity check");
2218 assert(id_p != NULL, "sanity check");
2219
2220 // cache size is stored in element[0], other elements offset by one
2221 *length_p = (size_t)cache[0];
2222 if (*length_p <= idnum) { // cache is too short
2223 *id_p = NULL;
2224 } else {
2225 *id_p = cache[idnum+1]; // fetch jmethodID (if any)
2226 }
2227 }
2228
2229
2230 // Lookup a jmethodID, NULL if not found. Do no blocking, no allocations, no handles
2231 jmethodID InstanceKlass::jmethod_id_or_null(Method* method) {
2232 size_t idnum = (size_t)method->method_idnum();
2233 jmethodID* jmeths = methods_jmethod_ids_acquire();
2234 size_t length; // length assigned as debugging crumb
2235 jmethodID id = NULL;
2236 if (jmeths != NULL && // If there is a cache
2237 (length = (size_t)jmeths[0]) > idnum) { // and if it is long enough,
2238 id = jmeths[idnum+1]; // Look up the id (may be NULL)
2239 }
2240 return id;
2241 }
2242
2243 inline DependencyContext InstanceKlass::dependencies() {
2244 DependencyContext dep_context(&_dep_context, &_dep_context_last_cleaned);
2245 return dep_context;
2246 }
2247
2248 int InstanceKlass::mark_dependent_nmethods(KlassDepChange& changes) {
2249 return dependencies().mark_dependent_nmethods(changes);
2250 }
2251
2252 void InstanceKlass::add_dependent_nmethod(nmethod* nm) {
2253 dependencies().add_dependent_nmethod(nm);
2254 }
2255
2256 void InstanceKlass::remove_dependent_nmethod(nmethod* nm) {
2257 dependencies().remove_dependent_nmethod(nm);
2258 }
2259
2260 void InstanceKlass::clean_dependency_context() {
2261 dependencies().clean_unloading_dependents();
2262 }
2263
2264 #ifndef PRODUCT
2265 void InstanceKlass::print_dependent_nmethods(bool verbose) {
2266 dependencies().print_dependent_nmethods(verbose);
2267 }
2268
2269 bool InstanceKlass::is_dependent_nmethod(nmethod* nm) {
2270 return dependencies().is_dependent_nmethod(nm);
2271 }
2272 #endif //PRODUCT
2273
2274 void InstanceKlass::clean_weak_instanceklass_links() {
2275 clean_implementors_list();
2276 clean_method_data();
2277 }
2278
2279 void InstanceKlass::clean_implementors_list() {
2280 assert(is_loader_alive(), "this klass should be live");
2281 if (is_interface()) {
2282 assert (ClassUnloading, "only called for ClassUnloading");
2283 for (;;) {
2284 // Use load_acquire due to competing with inserts
2285 Klass* impl = OrderAccess::load_acquire(adr_implementor());
2286 if (impl != NULL && !impl->is_loader_alive()) {
2287 // NULL this field, might be an unloaded klass or NULL
2288 Klass* volatile* klass = adr_implementor();
2289 if (Atomic::cmpxchg((Klass*)NULL, klass, impl) == impl) {
2290 // Successfully unlinking implementor.
2291 if (log_is_enabled(Trace, class, unload)) {
2292 ResourceMark rm;
2293 log_trace(class, unload)("unlinking class (implementor): %s", impl->external_name());
2294 }
2295 return;
2296 }
2297 } else {
2298 return;
2299 }
2300 }
2301 }
2302 }
2303
2304 void InstanceKlass::clean_method_data() {
2305 for (int m = 0; m < methods()->length(); m++) {
2306 MethodData* mdo = methods()->at(m)->method_data();
2307 if (mdo != NULL) {
2308 MutexLocker ml(SafepointSynchronize::is_at_safepoint() ? NULL : mdo->extra_data_lock());
2309 mdo->clean_method_data(/*always_clean*/false);
2310 }
2311 }
2312 }
2313
2314 bool InstanceKlass::supers_have_passed_fingerprint_checks() {
2315 if (java_super() != NULL && !java_super()->has_passed_fingerprint_check()) {
2316 ResourceMark rm;
2317 log_trace(class, fingerprint)("%s : super %s not fingerprinted", external_name(), java_super()->external_name());
2318 return false;
2319 }
2320
2321 Array<InstanceKlass*>* local_interfaces = this->local_interfaces();
2322 if (local_interfaces != NULL) {
2323 int length = local_interfaces->length();
2324 for (int i = 0; i < length; i++) {
2325 InstanceKlass* intf = local_interfaces->at(i);
2326 if (!intf->has_passed_fingerprint_check()) {
2327 ResourceMark rm;
2328 log_trace(class, fingerprint)("%s : interface %s not fingerprinted", external_name(), intf->external_name());
2329 return false;
2330 }
2331 }
2332 }
2333
2334 return true;
2335 }
2336
2337 bool InstanceKlass::should_store_fingerprint(bool is_unsafe_anonymous) {
2338 #if INCLUDE_AOT
2339 // We store the fingerprint into the InstanceKlass only in the following 2 cases:
2340 if (CalculateClassFingerprint) {
2341 // (1) We are running AOT to generate a shared library.
2342 return true;
2343 }
2344 if (DumpSharedSpaces || DynamicDumpSharedSpaces) {
2345 // (2) We are running -Xshare:dump or -XX:ArchiveClassesAtExit to create a shared archive
2346 return true;
2347 }
2348 if (UseAOT && is_unsafe_anonymous) {
2349 // (3) We are using AOT code from a shared library and see an unsafe anonymous class
2350 return true;
2351 }
2352 #endif
2353
2354 // In all other cases we might set the _misc_has_passed_fingerprint_check bit,
2355 // but do not store the 64-bit fingerprint to save space.
2356 return false;
2357 }
2358
2359 bool InstanceKlass::has_stored_fingerprint() const {
2360 #if INCLUDE_AOT
2361 return should_store_fingerprint() || is_shared();
2362 #else
2363 return false;
2364 #endif
2365 }
2366
2367 uint64_t InstanceKlass::get_stored_fingerprint() const {
2368 address adr = adr_fingerprint();
2369 if (adr != NULL) {
2370 return (uint64_t)Bytes::get_native_u8(adr); // adr may not be 64-bit aligned
2371 }
2372 return 0;
2373 }
2374
2375 void InstanceKlass::store_fingerprint(uint64_t fingerprint) {
2376 address adr = adr_fingerprint();
2377 if (adr != NULL) {
2378 Bytes::put_native_u8(adr, (u8)fingerprint); // adr may not be 64-bit aligned
2379
2380 ResourceMark rm;
2381 log_trace(class, fingerprint)("stored as " PTR64_FORMAT " for class %s", fingerprint, external_name());
2382 }
2383 }
2384
2385 void InstanceKlass::metaspace_pointers_do(MetaspaceClosure* it) {
2386 Klass::metaspace_pointers_do(it);
2387
2388 if (log_is_enabled(Trace, cds)) {
2389 ResourceMark rm;
2390 log_trace(cds)("Iter(InstanceKlass): %p (%s)", this, external_name());
2391 }
2392
2393 it->push(&_annotations);
2394 it->push((Klass**)&_array_klasses);
2395 it->push(&_constants);
2396 it->push(&_inner_classes);
2397 it->push(&_array_name);
2398 #if INCLUDE_JVMTI
2399 it->push(&_previous_versions);
2400 #endif
2401 it->push(&_methods);
2402 it->push(&_default_methods);
2403 it->push(&_local_interfaces);
2404 it->push(&_transitive_interfaces);
2405 it->push(&_method_ordering);
2406 it->push(&_default_vtable_indices);
2407 it->push(&_fields);
2408
2409 if (itable_length() > 0) {
2410 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable();
2411 int method_table_offset_in_words = ioe->offset()/wordSize;
2412 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words())
2413 / itableOffsetEntry::size();
2414
2415 for (int i = 0; i < nof_interfaces; i ++, ioe ++) {
2416 if (ioe->interface_klass() != NULL) {
2417 it->push(ioe->interface_klass_addr());
2418 itableMethodEntry* ime = ioe->first_method_entry(this);
2419 int n = klassItable::method_count_for_interface(ioe->interface_klass());
2420 for (int index = 0; index < n; index ++) {
2421 it->push(ime[index].method_addr());
2422 }
2423 }
2424 }
2425 }
2426
2427 it->push(&_nest_members);
2428 }
2429
2430 void InstanceKlass::remove_unshareable_info() {
2431 Klass::remove_unshareable_info();
2432
2433 if (is_in_error_state()) {
2434 // Classes are attempted to link during dumping and may fail,
2435 // but these classes are still in the dictionary and class list in CLD.
2436 // Check in_error state first because in_error is > linked state, so
2437 // is_linked() is true.
2438 // If there's a linking error, there is nothing else to remove.
2439 return;
2440 }
2441
2442 // Reset to the 'allocated' state to prevent any premature accessing to
2443 // a shared class at runtime while the class is still being loaded and
2444 // restored. A class' init_state is set to 'loaded' at runtime when it's
2445 // being added to class hierarchy (see SystemDictionary:::add_to_hierarchy()).
2446 _init_state = allocated;
2447
2448 {
2449 MutexLocker ml(Compile_lock);
2450 init_implementor();
2451 }
2452
2453 constants()->remove_unshareable_info();
2454
2455 for (int i = 0; i < methods()->length(); i++) {
2456 Method* m = methods()->at(i);
2457 m->remove_unshareable_info();
2458 }
2459
2460 // do array classes also.
2461 if (array_klasses() != NULL) {
2462 array_klasses()->remove_unshareable_info();
2463 }
2464
2465 // These are not allocated from metaspace. They are safe to set to NULL.
2466 _source_debug_extension = NULL;
2467 _dep_context = NULL;
2468 _osr_nmethods_head = NULL;
2469 #if INCLUDE_JVMTI
2470 _breakpoints = NULL;
2471 _previous_versions = NULL;
2472 _cached_class_file = NULL;
2473 #endif
2474
2475 _init_thread = NULL;
2476 _methods_jmethod_ids = NULL;
2477 _jni_ids = NULL;
2478 _oop_map_cache = NULL;
2479 // clear _nest_host to ensure re-load at runtime
2480 _nest_host = NULL;
2481 }
2482
2483 void InstanceKlass::remove_java_mirror() {
2484 Klass::remove_java_mirror();
2485
2486 // do array classes also.
2487 if (array_klasses() != NULL) {
2488 array_klasses()->remove_java_mirror();
2489 }
2490 }
2491
2492 void InstanceKlass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) {
2493 // SystemDictionary::add_to_hierarchy() sets the init_state to loaded
2494 // before the InstanceKlass is added to the SystemDictionary. Make
2495 // sure the current state is <loaded.
2496 assert(!is_loaded(), "invalid init state");
2497 set_package(loader_data, CHECK);
2498 Klass::restore_unshareable_info(loader_data, protection_domain, CHECK);
2499
2500 Array<Method*>* methods = this->methods();
2501 int num_methods = methods->length();
2502 for (int index = 0; index < num_methods; ++index) {
2503 methods->at(index)->restore_unshareable_info(CHECK);
2504 }
2505 if (JvmtiExport::has_redefined_a_class()) {
2506 // Reinitialize vtable because RedefineClasses may have changed some
2507 // entries in this vtable for super classes so the CDS vtable might
2508 // point to old or obsolete entries. RedefineClasses doesn't fix up
2509 // vtables in the shared system dictionary, only the main one.
2510 // It also redefines the itable too so fix that too.
2511 vtable().initialize_vtable(false, CHECK);
2512 itable().initialize_itable(false, CHECK);
2513 }
2514
2515 // restore constant pool resolved references
2516 constants()->restore_unshareable_info(CHECK);
2517
2518 if (array_klasses() != NULL) {
2519 // Array classes have null protection domain.
2520 // --> see ArrayKlass::complete_create_array_klass()
2521 array_klasses()->restore_unshareable_info(ClassLoaderData::the_null_class_loader_data(), Handle(), CHECK);
2522 }
2523 }
2524
2525 // returns true IFF is_in_error_state() has been changed as a result of this call.
2526 bool InstanceKlass::check_sharing_error_state() {
2527 assert(DumpSharedSpaces, "should only be called during dumping");
2528 bool old_state = is_in_error_state();
2529
2530 if (!is_in_error_state()) {
2531 bool bad = false;
2532 for (InstanceKlass* sup = java_super(); sup; sup = sup->java_super()) {
2533 if (sup->is_in_error_state()) {
2534 bad = true;
2535 break;
2536 }
2537 }
2538 if (!bad) {
2539 Array<InstanceKlass*>* interfaces = transitive_interfaces();
2540 for (int i = 0; i < interfaces->length(); i++) {
2541 InstanceKlass* iface = interfaces->at(i);
2542 if (iface->is_in_error_state()) {
2543 bad = true;
2544 break;
2545 }
2546 }
2547 }
2548
2549 if (bad) {
2550 set_in_error_state();
2551 }
2552 }
2553
2554 return (old_state != is_in_error_state());
2555 }
2556
2557 void InstanceKlass::set_class_loader_type(s2 loader_type) {
2558 switch (loader_type) {
2559 case ClassLoader::BOOT_LOADER:
2560 _misc_flags |= _misc_is_shared_boot_class;
2561 break;
2562 case ClassLoader::PLATFORM_LOADER:
2563 _misc_flags |= _misc_is_shared_platform_class;
2564 break;
2565 case ClassLoader::APP_LOADER:
2566 _misc_flags |= _misc_is_shared_app_class;
2567 break;
2568 default:
2569 ShouldNotReachHere();
2570 break;
2571 }
2572 }
2573
2574 #if INCLUDE_JVMTI
2575 static void clear_all_breakpoints(Method* m) {
2576 m->clear_all_breakpoints();
2577 }
2578 #endif
2579
2580 void InstanceKlass::unload_class(InstanceKlass* ik) {
2581 // Release dependencies.
2582 ik->dependencies().remove_all_dependents();
2583
2584 // notify the debugger
2585 if (JvmtiExport::should_post_class_unload()) {
2586 JvmtiExport::post_class_unload(ik);
2587 }
2588
2589 // notify ClassLoadingService of class unload
2590 ClassLoadingService::notify_class_unloaded(ik);
2591
2592 if (DumpSharedSpaces || DynamicDumpSharedSpaces) {
2593 SystemDictionaryShared::remove_dumptime_info(ik);
2594 }
2595
2596 if (log_is_enabled(Info, class, unload)) {
2597 ResourceMark rm;
2598 log_info(class, unload)("unloading class %s " INTPTR_FORMAT, ik->external_name(), p2i(ik));
2599 }
2600
2601 Events::log_class_unloading(Thread::current(), ik);
2602
2603 #if INCLUDE_JFR
2604 assert(ik != NULL, "invariant");
2605 EventClassUnload event;
2606 event.set_unloadedClass(ik);
2607 event.set_definingClassLoader(ik->class_loader_data());
2608 event.commit();
2609 #endif
2610 }
2611
2612 void InstanceKlass::release_C_heap_structures(InstanceKlass* ik) {
2613 // Clean up C heap
2614 ik->release_C_heap_structures();
2615 ik->constants()->release_C_heap_structures();
2616 }
2617
2618 void InstanceKlass::release_C_heap_structures() {
2619 // Can't release the constant pool here because the constant pool can be
2620 // deallocated separately from the InstanceKlass for default methods and
2621 // redefine classes.
2622
2623 // Deallocate oop map cache
2624 if (_oop_map_cache != NULL) {
2625 delete _oop_map_cache;
2626 _oop_map_cache = NULL;
2627 }
2628
2629 // Deallocate JNI identifiers for jfieldIDs
2630 JNIid::deallocate(jni_ids());
2631 set_jni_ids(NULL);
2632
2633 jmethodID* jmeths = methods_jmethod_ids_acquire();
2634 if (jmeths != (jmethodID*)NULL) {
2635 release_set_methods_jmethod_ids(NULL);
2636 FreeHeap(jmeths);
2637 }
2638
2639 assert(_dep_context == NULL,
2640 "dependencies should already be cleaned");
2641
2642 #if INCLUDE_JVMTI
2643 // Deallocate breakpoint records
2644 if (breakpoints() != 0x0) {
2645 methods_do(clear_all_breakpoints);
2646 assert(breakpoints() == 0x0, "should have cleared breakpoints");
2647 }
2648
2649 // deallocate the cached class file
2650 if (_cached_class_file != NULL) {
2651 os::free(_cached_class_file);
2652 _cached_class_file = NULL;
2653 }
2654 #endif
2655
2656 // Decrement symbol reference counts associated with the unloaded class.
2657 if (_name != NULL) _name->decrement_refcount();
2658 // unreference array name derived from this class name (arrays of an unloaded
2659 // class can't be referenced anymore).
2660 if (_array_name != NULL) _array_name->decrement_refcount();
2661 if (_value_types != NULL) {
2662 for (int i = 0; i < _value_types->length(); i++) {
2663 Symbol* s = _value_types->at(i)._class_name;
2664 if (s != NULL) {
2665 s->decrement_refcount();
2666 }
2667 }
2668 }
2669 if (_source_debug_extension != NULL) FREE_C_HEAP_ARRAY(char, _source_debug_extension);
2670 }
2671
2672 void InstanceKlass::set_source_debug_extension(const char* array, int length) {
2673 if (array == NULL) {
2674 _source_debug_extension = NULL;
2675 } else {
2676 // Adding one to the attribute length in order to store a null terminator
2677 // character could cause an overflow because the attribute length is
2678 // already coded with an u4 in the classfile, but in practice, it's
2679 // unlikely to happen.
2680 assert((length+1) > length, "Overflow checking");
2681 char* sde = NEW_C_HEAP_ARRAY(char, (length + 1), mtClass);
2682 for (int i = 0; i < length; i++) {
2683 sde[i] = array[i];
2684 }
2685 sde[length] = '\0';
2686 _source_debug_extension = sde;
2687 }
2688 }
2689
2690 const char* InstanceKlass::signature_name() const {
2691 return signature_name_of(is_value() ? 'Q' : 'L');
2692 }
2693
2694 const char* InstanceKlass::signature_name_of(char c) const {
2695 int hash_len = 0;
2696 char hash_buf[40];
2697
2698 // If this is an unsafe anonymous class, append a hash to make the name unique
2699 if (is_unsafe_anonymous()) {
2700 intptr_t hash = (java_mirror() != NULL) ? java_mirror()->identity_hash() : 0;
2701 jio_snprintf(hash_buf, sizeof(hash_buf), "/" UINTX_FORMAT, (uintx)hash);
2702 hash_len = (int)strlen(hash_buf);
2703 }
2704
2705 // Get the internal name as a c string
2706 const char* src = (const char*) (name()->as_C_string());
2707 const int src_length = (int)strlen(src);
2708
2709 char* dest = NEW_RESOURCE_ARRAY(char, src_length + hash_len + 3);
2710
2711 // Add L or Q as type indicator
2712 int dest_index = 0;
2713 dest[dest_index++] = c;
2714
2715 // Add the actual class name
2716 for (int src_index = 0; src_index < src_length; ) {
2717 dest[dest_index++] = src[src_index++];
2718 }
2719
2720 // If we have a hash, append it
2721 for (int hash_index = 0; hash_index < hash_len; ) {
2722 dest[dest_index++] = hash_buf[hash_index++];
2723 }
2724
2725 // Add the semicolon and the NULL
2726 dest[dest_index++] = ';';
2727 dest[dest_index] = '\0';
2728 return dest;
2729 }
2730
2731 // Used to obtain the package name from a fully qualified class name.
2732 Symbol* InstanceKlass::package_from_name(const Symbol* name, TRAPS) {
2733 if (name == NULL) {
2734 return NULL;
2735 } else {
2736 if (name->utf8_length() <= 0) {
2737 return NULL;
2738 }
2739 ResourceMark rm;
2740 const char* package_name = ClassLoader::package_from_name((const char*) name->as_C_string());
2741 if (package_name == NULL) {
2742 return NULL;
2743 }
2744 Symbol* pkg_name = SymbolTable::new_symbol(package_name);
2745 return pkg_name;
2746 }
2747 }
2748
2749 ModuleEntry* InstanceKlass::module() const {
2750 // For an unsafe anonymous class return the host class' module
2751 if (is_unsafe_anonymous()) {
2752 assert(unsafe_anonymous_host() != NULL, "unsafe anonymous class must have a host class");
2753 return unsafe_anonymous_host()->module();
2754 }
2755
2756 // Class is in a named package
2757 if (!in_unnamed_package()) {
2758 return _package_entry->module();
2759 }
2760
2761 // Class is in an unnamed package, return its loader's unnamed module
2762 return class_loader_data()->unnamed_module();
2763 }
2764
2765 void InstanceKlass::set_package(ClassLoaderData* loader_data, TRAPS) {
2766
2767 // ensure java/ packages only loaded by boot or platform builtin loaders
2768 check_prohibited_package(name(), loader_data, CHECK);
2769
2770 TempNewSymbol pkg_name = package_from_name(name(), CHECK);
2771
2772 if (pkg_name != NULL && loader_data != NULL) {
2773
2774 // Find in class loader's package entry table.
2775 _package_entry = loader_data->packages()->lookup_only(pkg_name);
2776
2777 // If the package name is not found in the loader's package
2778 // entry table, it is an indication that the package has not
2779 // been defined. Consider it defined within the unnamed module.
2780 if (_package_entry == NULL) {
2781 ResourceMark rm;
2782
2783 if (!ModuleEntryTable::javabase_defined()) {
2784 // Before java.base is defined during bootstrapping, define all packages in
2785 // the java.base module. If a non-java.base package is erroneously placed
2786 // in the java.base module it will be caught later when java.base
2787 // is defined by ModuleEntryTable::verify_javabase_packages check.
2788 assert(ModuleEntryTable::javabase_moduleEntry() != NULL, JAVA_BASE_NAME " module is NULL");
2789 _package_entry = loader_data->packages()->lookup(pkg_name, ModuleEntryTable::javabase_moduleEntry());
2790 } else {
2791 assert(loader_data->unnamed_module() != NULL, "unnamed module is NULL");
2792 _package_entry = loader_data->packages()->lookup(pkg_name,
2793 loader_data->unnamed_module());
2794 }
2795
2796 // A package should have been successfully created
2797 assert(_package_entry != NULL, "Package entry for class %s not found, loader %s",
2798 name()->as_C_string(), loader_data->loader_name_and_id());
2799 }
2800
2801 if (log_is_enabled(Debug, module)) {
2802 ResourceMark rm;
2803 ModuleEntry* m = _package_entry->module();
2804 log_trace(module)("Setting package: class: %s, package: %s, loader: %s, module: %s",
2805 external_name(),
2806 pkg_name->as_C_string(),
2807 loader_data->loader_name_and_id(),
2808 (m->is_named() ? m->name()->as_C_string() : UNNAMED_MODULE));
2809 }
2810 } else {
2811 ResourceMark rm;
2812 log_trace(module)("Setting package: class: %s, package: unnamed, loader: %s, module: %s",
2813 external_name(),
2814 (loader_data != NULL) ? loader_data->loader_name_and_id() : "NULL",
2815 UNNAMED_MODULE);
2816 }
2817 }
2818
2819
2820 // different versions of is_same_class_package
2821
2822 bool InstanceKlass::is_same_class_package(const Klass* class2) const {
2823 oop classloader1 = this->class_loader();
2824 PackageEntry* classpkg1 = this->package();
2825 if (class2->is_objArray_klass()) {
2826 class2 = ObjArrayKlass::cast(class2)->bottom_klass();
2827 }
2828
2829 oop classloader2;
2830 PackageEntry* classpkg2;
2831 if (class2->is_instance_klass()) {
2832 classloader2 = class2->class_loader();
2833 classpkg2 = class2->package();
2834 } else {
2835 assert(class2->is_typeArray_klass(), "should be type array");
2836 classloader2 = NULL;
2837 classpkg2 = NULL;
2838 }
2839
2840 // Same package is determined by comparing class loader
2841 // and package entries. Both must be the same. This rule
2842 // applies even to classes that are defined in the unnamed
2843 // package, they still must have the same class loader.
2844 if (oopDesc::equals(classloader1, classloader2) && (classpkg1 == classpkg2)) {
2845 return true;
2846 }
2847
2848 return false;
2849 }
2850
2851 // return true if this class and other_class are in the same package. Classloader
2852 // and classname information is enough to determine a class's package
2853 bool InstanceKlass::is_same_class_package(oop other_class_loader,
2854 const Symbol* other_class_name) const {
2855 if (!oopDesc::equals(class_loader(), other_class_loader)) {
2856 return false;
2857 }
2858 if (name()->fast_compare(other_class_name) == 0) {
2859 return true;
2860 }
2861
2862 {
2863 ResourceMark rm;
2864
2865 bool bad_class_name = false;
2866 const char* other_pkg =
2867 ClassLoader::package_from_name((const char*) other_class_name->as_C_string(), &bad_class_name);
2868 if (bad_class_name) {
2869 return false;
2870 }
2871 // Check that package_from_name() returns NULL, not "", if there is no package.
2872 assert(other_pkg == NULL || strlen(other_pkg) > 0, "package name is empty string");
2873
2874 const Symbol* const this_package_name =
2875 this->package() != NULL ? this->package()->name() : NULL;
2876
2877 if (this_package_name == NULL || other_pkg == NULL) {
2878 // One of the two doesn't have a package. Only return true if the other
2879 // one also doesn't have a package.
2880 return (const char*)this_package_name == other_pkg;
2881 }
2882
2883 // Check if package is identical
2884 return this_package_name->equals(other_pkg);
2885 }
2886 }
2887
2888 // Returns true iff super_method can be overridden by a method in targetclassname
2889 // See JLS 3rd edition 8.4.6.1
2890 // Assumes name-signature match
2891 // "this" is InstanceKlass of super_method which must exist
2892 // note that the InstanceKlass of the method in the targetclassname has not always been created yet
2893 bool InstanceKlass::is_override(const methodHandle& super_method, Handle targetclassloader, Symbol* targetclassname, TRAPS) {
2894 // Private methods can not be overridden
2895 if (super_method->is_private()) {
2896 return false;
2897 }
2898 // If super method is accessible, then override
2899 if ((super_method->is_protected()) ||
2900 (super_method->is_public())) {
2901 return true;
2902 }
2903 // Package-private methods are not inherited outside of package
2904 assert(super_method->is_package_private(), "must be package private");
2905 return(is_same_class_package(targetclassloader(), targetclassname));
2906 }
2907
2908 // Only boot and platform class loaders can define classes in "java/" packages.
2909 void InstanceKlass::check_prohibited_package(Symbol* class_name,
2910 ClassLoaderData* loader_data,
2911 TRAPS) {
2912 if (!loader_data->is_boot_class_loader_data() &&
2913 !loader_data->is_platform_class_loader_data() &&
2914 class_name != NULL) {
2915 ResourceMark rm(THREAD);
2916 char* name = class_name->as_C_string();
2917 if (strncmp(name, JAVAPKG, JAVAPKG_LEN) == 0 && name[JAVAPKG_LEN] == '/') {
2918 TempNewSymbol pkg_name = InstanceKlass::package_from_name(class_name, CHECK);
2919 assert(pkg_name != NULL, "Error in parsing package name starting with 'java/'");
2920 name = pkg_name->as_C_string();
2921 const char* class_loader_name = loader_data->loader_name_and_id();
2922 StringUtils::replace_no_expand(name, "/", ".");
2923 const char* msg_text1 = "Class loader (instance of): ";
2924 const char* msg_text2 = " tried to load prohibited package name: ";
2925 size_t len = strlen(msg_text1) + strlen(class_loader_name) + strlen(msg_text2) + strlen(name) + 1;
2926 char* message = NEW_RESOURCE_ARRAY_IN_THREAD(THREAD, char, len);
2927 jio_snprintf(message, len, "%s%s%s%s", msg_text1, class_loader_name, msg_text2, name);
2928 THROW_MSG(vmSymbols::java_lang_SecurityException(), message);
2929 }
2930 }
2931 return;
2932 }
2933
2934 bool InstanceKlass::find_inner_classes_attr(int* ooff, int* noff, TRAPS) const {
2935 constantPoolHandle i_cp(THREAD, constants());
2936 for (InnerClassesIterator iter(this); !iter.done(); iter.next()) {
2937 int ioff = iter.inner_class_info_index();
2938 if (ioff != 0) {
2939 // Check to see if the name matches the class we're looking for
2940 // before attempting to find the class.
2941 if (i_cp->klass_name_at_matches(this, ioff)) {
2942 Klass* inner_klass = i_cp->klass_at(ioff, CHECK_false);
2943 if (this == inner_klass) {
2944 *ooff = iter.outer_class_info_index();
2945 *noff = iter.inner_name_index();
2946 return true;
2947 }
2948 }
2949 }
2950 }
2951 return false;
2952 }
2953
2954 InstanceKlass* InstanceKlass::compute_enclosing_class(bool* inner_is_member, TRAPS) const {
2955 InstanceKlass* outer_klass = NULL;
2956 *inner_is_member = false;
2957 int ooff = 0, noff = 0;
2958 bool has_inner_classes_attr = find_inner_classes_attr(&ooff, &noff, THREAD);
2959 if (has_inner_classes_attr) {
2960 constantPoolHandle i_cp(THREAD, constants());
2961 if (ooff != 0) {
2962 Klass* ok = i_cp->klass_at(ooff, CHECK_NULL);
2963 outer_klass = InstanceKlass::cast(ok);
2964 *inner_is_member = true;
2965 }
2966 if (NULL == outer_klass) {
2967 // It may be unsafe anonymous; try for that.
2968 int encl_method_class_idx = enclosing_method_class_index();
2969 if (encl_method_class_idx != 0) {
2970 Klass* ok = i_cp->klass_at(encl_method_class_idx, CHECK_NULL);
2971 outer_klass = InstanceKlass::cast(ok);
2972 *inner_is_member = false;
2973 }
2974 }
2975 }
2976
2977 // If no inner class attribute found for this class.
2978 if (NULL == outer_klass) return NULL;
2979
2980 // Throws an exception if outer klass has not declared k as an inner klass
2981 // We need evidence that each klass knows about the other, or else
2982 // the system could allow a spoof of an inner class to gain access rights.
2983 Reflection::check_for_inner_class(outer_klass, this, *inner_is_member, CHECK_NULL);
2984 return outer_klass;
2985 }
2986
2987 jint InstanceKlass::compute_modifier_flags(TRAPS) const {
2988 jint access = access_flags().as_int();
2989
2990 // But check if it happens to be member class.
2991 InnerClassesIterator iter(this);
2992 for (; !iter.done(); iter.next()) {
2993 int ioff = iter.inner_class_info_index();
2994 // Inner class attribute can be zero, skip it.
2995 // Strange but true: JVM spec. allows null inner class refs.
2996 if (ioff == 0) continue;
2997
2998 // only look at classes that are already loaded
2999 // since we are looking for the flags for our self.
3000 Symbol* inner_name = constants()->klass_name_at(ioff);
3001 if (name() == inner_name) {
3002 // This is really a member class.
3003 access = iter.inner_access_flags();
3004 break;
3005 }
3006 }
3007 // Remember to strip ACC_SUPER bit
3008 return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS;
3009 }
3010
3011 jint InstanceKlass::jvmti_class_status() const {
3012 jint result = 0;
3013
3014 if (is_linked()) {
3015 result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED;
3016 }
3017
3018 if (is_initialized()) {
3019 assert(is_linked(), "Class status is not consistent");
3020 result |= JVMTI_CLASS_STATUS_INITIALIZED;
3021 }
3022 if (is_in_error_state()) {
3023 result |= JVMTI_CLASS_STATUS_ERROR;
3024 }
3025 return result;
3026 }
3027
3028 Method* InstanceKlass::method_at_itable(Klass* holder, int index, TRAPS) {
3029 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable();
3030 int method_table_offset_in_words = ioe->offset()/wordSize;
3031 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words())
3032 / itableOffsetEntry::size();
3033
3034 for (int cnt = 0 ; ; cnt ++, ioe ++) {
3035 // If the interface isn't implemented by the receiver class,
3036 // the VM should throw IncompatibleClassChangeError.
3037 if (cnt >= nof_interfaces) {
3038 ResourceMark rm(THREAD);
3039 stringStream ss;
3040 bool same_module = (module() == holder->module());
3041 ss.print("Receiver class %s does not implement "
3042 "the interface %s defining the method to be called "
3043 "(%s%s%s)",
3044 external_name(), holder->external_name(),
3045 (same_module) ? joint_in_module_of_loader(holder) : class_in_module_of_loader(),
3046 (same_module) ? "" : "; ",
3047 (same_module) ? "" : holder->class_in_module_of_loader());
3048 THROW_MSG_NULL(vmSymbols::java_lang_IncompatibleClassChangeError(), ss.as_string());
3049 }
3050
3051 Klass* ik = ioe->interface_klass();
3052 if (ik == holder) break;
3053 }
3054
3055 itableMethodEntry* ime = ioe->first_method_entry(this);
3056 Method* m = ime[index].method();
3057 if (m == NULL) {
3058 THROW_NULL(vmSymbols::java_lang_AbstractMethodError());
3059 }
3060 return m;
3061 }
3062
3063
3064 #if INCLUDE_JVMTI
3065 // update default_methods for redefineclasses for methods that are
3066 // not yet in the vtable due to concurrent subclass define and superinterface
3067 // redefinition
3068 // Note: those in the vtable, should have been updated via adjust_method_entries
3069 void InstanceKlass::adjust_default_methods(bool* trace_name_printed) {
3070 // search the default_methods for uses of either obsolete or EMCP methods
3071 if (default_methods() != NULL) {
3072 for (int index = 0; index < default_methods()->length(); index ++) {
3073 Method* old_method = default_methods()->at(index);
3074 if (old_method == NULL || !old_method->is_old()) {
3075 continue; // skip uninteresting entries
3076 }
3077 assert(!old_method->is_deleted(), "default methods may not be deleted");
3078 Method* new_method = old_method->get_new_method();
3079 default_methods()->at_put(index, new_method);
3080
3081 if (log_is_enabled(Info, redefine, class, update)) {
3082 ResourceMark rm;
3083 if (!(*trace_name_printed)) {
3084 log_info(redefine, class, update)
3085 ("adjust: klassname=%s default methods from name=%s",
3086 external_name(), old_method->method_holder()->external_name());
3087 *trace_name_printed = true;
3088 }
3089 log_debug(redefine, class, update, vtables)
3090 ("default method update: %s(%s) ",
3091 new_method->name()->as_C_string(), new_method->signature()->as_C_string());
3092 }
3093 }
3094 }
3095 }
3096 #endif // INCLUDE_JVMTI
3097
3098 // On-stack replacement stuff
3099 void InstanceKlass::add_osr_nmethod(nmethod* n) {
3100 #ifndef PRODUCT
3101 if (TieredCompilation) {
3102 nmethod * prev = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), n->comp_level(), true);
3103 assert(prev == NULL || !prev->is_in_use(),
3104 "redundunt OSR recompilation detected. memory leak in CodeCache!");
3105 }
3106 #endif
3107 // only one compilation can be active
3108 {
3109 // This is a short non-blocking critical region, so the no safepoint check is ok.
3110 MutexLocker ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
3111 assert(n->is_osr_method(), "wrong kind of nmethod");
3112 n->set_osr_link(osr_nmethods_head());
3113 set_osr_nmethods_head(n);
3114 // Raise the highest osr level if necessary
3115 if (TieredCompilation) {
3116 Method* m = n->method();
3117 m->set_highest_osr_comp_level(MAX2(m->highest_osr_comp_level(), n->comp_level()));
3118 }
3119 }
3120
3121 // Get rid of the osr methods for the same bci that have lower levels.
3122 if (TieredCompilation) {
3123 for (int l = CompLevel_limited_profile; l < n->comp_level(); l++) {
3124 nmethod *inv = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), l, true);
3125 if (inv != NULL && inv->is_in_use()) {
3126 inv->make_not_entrant();
3127 }
3128 }
3129 }
3130 }
3131
3132 // Remove osr nmethod from the list. Return true if found and removed.
3133 bool InstanceKlass::remove_osr_nmethod(nmethod* n) {
3134 // This is a short non-blocking critical region, so the no safepoint check is ok.
3135 MutexLocker ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
3136 assert(n->is_osr_method(), "wrong kind of nmethod");
3137 nmethod* last = NULL;
3138 nmethod* cur = osr_nmethods_head();
3139 int max_level = CompLevel_none; // Find the max comp level excluding n
3140 Method* m = n->method();
3141 // Search for match
3142 bool found = false;
3143 while(cur != NULL && cur != n) {
3144 if (TieredCompilation && m == cur->method()) {
3145 // Find max level before n
3146 max_level = MAX2(max_level, cur->comp_level());
3147 }
3148 last = cur;
3149 cur = cur->osr_link();
3150 }
3151 nmethod* next = NULL;
3152 if (cur == n) {
3153 found = true;
3154 next = cur->osr_link();
3155 if (last == NULL) {
3156 // Remove first element
3157 set_osr_nmethods_head(next);
3158 } else {
3159 last->set_osr_link(next);
3160 }
3161 }
3162 n->set_osr_link(NULL);
3163 if (TieredCompilation) {
3164 cur = next;
3165 while (cur != NULL) {
3166 // Find max level after n
3167 if (m == cur->method()) {
3168 max_level = MAX2(max_level, cur->comp_level());
3169 }
3170 cur = cur->osr_link();
3171 }
3172 m->set_highest_osr_comp_level(max_level);
3173 }
3174 return found;
3175 }
3176
3177 int InstanceKlass::mark_osr_nmethods(const Method* m) {
3178 // This is a short non-blocking critical region, so the no safepoint check is ok.
3179 MutexLocker ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
3180 nmethod* osr = osr_nmethods_head();
3181 int found = 0;
3182 while (osr != NULL) {
3183 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
3184 if (osr->method() == m) {
3185 osr->mark_for_deoptimization();
3186 found++;
3187 }
3188 osr = osr->osr_link();
3189 }
3190 return found;
3191 }
3192
3193 nmethod* InstanceKlass::lookup_osr_nmethod(const Method* m, int bci, int comp_level, bool match_level) const {
3194 // This is a short non-blocking critical region, so the no safepoint check is ok.
3195 MutexLocker ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
3196 nmethod* osr = osr_nmethods_head();
3197 nmethod* best = NULL;
3198 while (osr != NULL) {
3199 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
3200 // There can be a time when a c1 osr method exists but we are waiting
3201 // for a c2 version. When c2 completes its osr nmethod we will trash
3202 // the c1 version and only be able to find the c2 version. However
3203 // while we overflow in the c1 code at back branches we don't want to
3204 // try and switch to the same code as we are already running
3205
3206 if (osr->method() == m &&
3207 (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) {
3208 if (match_level) {
3209 if (osr->comp_level() == comp_level) {
3210 // Found a match - return it.
3211 return osr;
3212 }
3213 } else {
3214 if (best == NULL || (osr->comp_level() > best->comp_level())) {
3215 if (osr->comp_level() == CompLevel_highest_tier) {
3216 // Found the best possible - return it.
3217 return osr;
3218 }
3219 best = osr;
3220 }
3221 }
3222 }
3223 osr = osr->osr_link();
3224 }
3225
3226 assert(match_level == false || best == NULL, "shouldn't pick up anything if match_level is set");
3227 if (best != NULL && best->comp_level() >= comp_level) {
3228 return best;
3229 }
3230 return NULL;
3231 }
3232
3233 // -----------------------------------------------------------------------------------------------------
3234 // Printing
3235
3236 #ifndef PRODUCT
3237
3238 #define BULLET " - "
3239
3240 static const char* state_names[] = {
3241 "allocated", "loaded", "linked", "being_initialized", "fully_initialized", "initialization_error"
3242 };
3243
3244 static void print_vtable(address self, intptr_t* start, int len, outputStream* st) {
3245 ResourceMark rm;
3246 int* forward_refs = NEW_RESOURCE_ARRAY(int, len);
3247 for (int i = 0; i < len; i++) forward_refs[i] = 0;
3248 for (int i = 0; i < len; i++) {
3249 intptr_t e = start[i];
3250 st->print("%d : " INTPTR_FORMAT, i, e);
3251 if (forward_refs[i] != 0) {
3252 int from = forward_refs[i];
3253 int off = (int) start[from];
3254 st->print(" (offset %d <= [%d])", off, from);
3255 }
3256 if (MetaspaceObj::is_valid((Metadata*)e)) {
3257 st->print(" ");
3258 ((Metadata*)e)->print_value_on(st);
3259 } else if (self != NULL && e > 0 && e < 0x10000) {
3260 address location = self + e;
3261 int index = (int)((intptr_t*)location - start);
3262 st->print(" (offset %d => [%d])", (int)e, index);
3263 if (index >= 0 && index < len)
3264 forward_refs[index] = i;
3265 }
3266 st->cr();
3267 }
3268 }
3269
3270 static void print_vtable(vtableEntry* start, int len, outputStream* st) {
3271 return print_vtable(NULL, reinterpret_cast<intptr_t*>(start), len, st);
3272 }
3273
3274 template<typename T>
3275 static void print_array_on(outputStream* st, Array<T>* array) {
3276 if (array == NULL) { st->print_cr("NULL"); return; }
3277 array->print_value_on(st); st->cr();
3278 if (Verbose || WizardMode) {
3279 for (int i = 0; i < array->length(); i++) {
3280 st->print("%d : ", i); array->at(i)->print_value_on(st); st->cr();
3281 }
3282 }
3283 }
3284
3285 static void print_array_on(outputStream* st, Array<int>* array) {
3286 if (array == NULL) { st->print_cr("NULL"); return; }
3287 array->print_value_on(st); st->cr();
3288 if (Verbose || WizardMode) {
3289 for (int i = 0; i < array->length(); i++) {
3290 st->print("%d : %d", i, array->at(i)); st->cr();
3291 }
3292 }
3293 }
3294
3295 void InstanceKlass::print_on(outputStream* st) const {
3296 assert(is_klass(), "must be klass");
3297 Klass::print_on(st);
3298
3299 st->print(BULLET"instance size: %d", size_helper()); st->cr();
3300 st->print(BULLET"klass size: %d", size()); st->cr();
3301 st->print(BULLET"access: "); access_flags().print_on(st); st->cr();
3302 st->print(BULLET"misc flags: 0x%x", _misc_flags); st->cr();
3303 st->print(BULLET"state: "); st->print_cr("%s", state_names[_init_state]);
3304 st->print(BULLET"name: "); name()->print_value_on(st); st->cr();
3305 st->print(BULLET"super: "); Metadata::print_value_on_maybe_null(st, super()); st->cr();
3306 st->print(BULLET"sub: ");
3307 Klass* sub = subklass();
3308 int n;
3309 for (n = 0; sub != NULL; n++, sub = sub->next_sibling()) {
3310 if (n < MaxSubklassPrintSize) {
3311 sub->print_value_on(st);
3312 st->print(" ");
3313 }
3314 }
3315 if (n >= MaxSubklassPrintSize) st->print("(" INTX_FORMAT " more klasses...)", n - MaxSubklassPrintSize);
3316 st->cr();
3317
3318 if (is_interface()) {
3319 st->print_cr(BULLET"nof implementors: %d", nof_implementors());
3320 if (nof_implementors() == 1) {
3321 st->print_cr(BULLET"implementor: ");
3322 st->print(" ");
3323 implementor()->print_value_on(st);
3324 st->cr();
3325 }
3326 }
3327
3328 st->print(BULLET"arrays: "); Metadata::print_value_on_maybe_null(st, array_klasses()); st->cr();
3329 st->print(BULLET"methods: "); print_array_on(st, methods());
3330 st->print(BULLET"method ordering: "); print_array_on(st, method_ordering());
3331 st->print(BULLET"default_methods: "); print_array_on(st, default_methods());
3332 if (default_vtable_indices() != NULL) {
3333 st->print(BULLET"default vtable indices: "); print_array_on(st, default_vtable_indices());
3334 }
3335 st->print(BULLET"local interfaces: "); print_array_on(st, local_interfaces());
3336 st->print(BULLET"trans. interfaces: "); print_array_on(st, transitive_interfaces());
3337 st->print(BULLET"constants: "); constants()->print_value_on(st); st->cr();
3338 if (class_loader_data() != NULL) {
3339 st->print(BULLET"class loader data: ");
3340 class_loader_data()->print_value_on(st);
3341 st->cr();
3342 }
3343 st->print(BULLET"unsafe anonymous host class: "); Metadata::print_value_on_maybe_null(st, unsafe_anonymous_host()); st->cr();
3344 if (source_file_name() != NULL) {
3345 st->print(BULLET"source file: ");
3346 source_file_name()->print_value_on(st);
3347 st->cr();
3348 }
3349 if (source_debug_extension() != NULL) {
3350 st->print(BULLET"source debug extension: ");
3351 st->print("%s", source_debug_extension());
3352 st->cr();
3353 }
3354 st->print(BULLET"class annotations: "); class_annotations()->print_value_on(st); st->cr();
3355 st->print(BULLET"class type annotations: "); class_type_annotations()->print_value_on(st); st->cr();
3356 st->print(BULLET"field annotations: "); fields_annotations()->print_value_on(st); st->cr();
3357 st->print(BULLET"field type annotations: "); fields_type_annotations()->print_value_on(st); st->cr();
3358 {
3359 bool have_pv = false;
3360 // previous versions are linked together through the InstanceKlass
3361 for (InstanceKlass* pv_node = previous_versions();
3362 pv_node != NULL;
3363 pv_node = pv_node->previous_versions()) {
3364 if (!have_pv)
3365 st->print(BULLET"previous version: ");
3366 have_pv = true;
3367 pv_node->constants()->print_value_on(st);
3368 }
3369 if (have_pv) st->cr();
3370 }
3371
3372 if (generic_signature() != NULL) {
3373 st->print(BULLET"generic signature: ");
3374 generic_signature()->print_value_on(st);
3375 st->cr();
3376 }
3377 st->print(BULLET"inner classes: "); inner_classes()->print_value_on(st); st->cr();
3378 st->print(BULLET"nest members: "); nest_members()->print_value_on(st); st->cr();
3379 if (java_mirror() != NULL) {
3380 st->print(BULLET"java mirror: ");
3381 java_mirror()->print_value_on(st);
3382 st->cr();
3383 } else {
3384 st->print_cr(BULLET"java mirror: NULL");
3385 }
3386 st->print(BULLET"vtable length %d (start addr: " INTPTR_FORMAT ")", vtable_length(), p2i(start_of_vtable())); st->cr();
3387 if (vtable_length() > 0 && (Verbose || WizardMode)) print_vtable(start_of_vtable(), vtable_length(), st);
3388 st->print(BULLET"itable length %d (start addr: " INTPTR_FORMAT ")", itable_length(), p2i(start_of_itable())); st->cr();
3389 if (itable_length() > 0 && (Verbose || WizardMode)) print_vtable(NULL, start_of_itable(), itable_length(), st);
3390 st->print_cr(BULLET"---- static fields (%d words):", static_field_size());
3391 FieldPrinter print_static_field(st);
3392 ((InstanceKlass*)this)->do_local_static_fields(&print_static_field);
3393 st->print_cr(BULLET"---- non-static fields (%d words):", nonstatic_field_size());
3394 FieldPrinter print_nonstatic_field(st);
3395 InstanceKlass* ik = const_cast<InstanceKlass*>(this);
3396 ik->do_nonstatic_fields(&print_nonstatic_field);
3397
3398 st->print(BULLET"non-static oop maps: ");
3399 OopMapBlock* map = start_of_nonstatic_oop_maps();
3400 OopMapBlock* end_map = map + nonstatic_oop_map_count();
3401 while (map < end_map) {
3402 st->print("%d-%d ", map->offset(), map->offset() + heapOopSize*(map->count() - 1));
3403 map++;
3404 }
3405 st->cr();
3406 }
3407
3408 #endif //PRODUCT
3409
3410 void InstanceKlass::print_value_on(outputStream* st) const {
3411 assert(is_klass(), "must be klass");
3412 if (Verbose || WizardMode) access_flags().print_on(st);
3413 name()->print_value_on(st);
3414 }
3415
3416 #ifndef PRODUCT
3417
3418 void FieldPrinter::do_field(fieldDescriptor* fd) {
3419 _st->print(BULLET);
3420 if (_obj == NULL) {
3421 fd->print_on(_st);
3422 _st->cr();
3423 } else {
3424 fd->print_on_for(_st, _obj);
3425 _st->cr();
3426 }
3427 }
3428
3429
3430 void InstanceKlass::oop_print_on(oop obj, outputStream* st) {
3431 Klass::oop_print_on(obj, st);
3432
3433 if (this == SystemDictionary::String_klass()) {
3434 typeArrayOop value = java_lang_String::value(obj);
3435 juint length = java_lang_String::length(obj);
3436 if (value != NULL &&
3437 value->is_typeArray() &&
3438 length <= (juint) value->length()) {
3439 st->print(BULLET"string: ");
3440 java_lang_String::print(obj, st);
3441 st->cr();
3442 if (!WizardMode) return; // that is enough
3443 }
3444 }
3445
3446 st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj));
3447 FieldPrinter print_field(st, obj);
3448 do_nonstatic_fields(&print_field);
3449
3450 if (this == SystemDictionary::Class_klass()) {
3451 st->print(BULLET"signature: ");
3452 java_lang_Class::print_signature(obj, st);
3453 st->cr();
3454 Klass* mirrored_klass = java_lang_Class::as_Klass(obj);
3455 st->print(BULLET"fake entry for mirror: ");
3456 Metadata::print_value_on_maybe_null(st, mirrored_klass);
3457 st->cr();
3458 Klass* array_klass = java_lang_Class::array_klass_acquire(obj);
3459 st->print(BULLET"fake entry for array: ");
3460 Metadata::print_value_on_maybe_null(st, array_klass);
3461 st->cr();
3462 st->print_cr(BULLET"fake entry for oop_size: %d", java_lang_Class::oop_size(obj));
3463 st->print_cr(BULLET"fake entry for static_oop_field_count: %d", java_lang_Class::static_oop_field_count(obj));
3464 Klass* real_klass = java_lang_Class::as_Klass(obj);
3465 if (real_klass != NULL && real_klass->is_instance_klass()) {
3466 InstanceKlass::cast(real_klass)->do_local_static_fields(&print_field);
3467 }
3468 } else if (this == SystemDictionary::MethodType_klass()) {
3469 st->print(BULLET"signature: ");
3470 java_lang_invoke_MethodType::print_signature(obj, st);
3471 st->cr();
3472 }
3473 }
3474
3475 bool InstanceKlass::verify_itable_index(int i) {
3476 int method_count = klassItable::method_count_for_interface(this);
3477 assert(i >= 0 && i < method_count, "index out of bounds");
3478 return true;
3479 }
3480
3481 #endif //PRODUCT
3482
3483 void InstanceKlass::oop_print_value_on(oop obj, outputStream* st) {
3484 st->print("a ");
3485 name()->print_value_on(st);
3486 obj->print_address_on(st);
3487 if (this == SystemDictionary::String_klass()
3488 && java_lang_String::value(obj) != NULL) {
3489 ResourceMark rm;
3490 int len = java_lang_String::length(obj);
3491 int plen = (len < 24 ? len : 12);
3492 char* str = java_lang_String::as_utf8_string(obj, 0, plen);
3493 st->print(" = \"%s\"", str);
3494 if (len > plen)
3495 st->print("...[%d]", len);
3496 } else if (this == SystemDictionary::Class_klass()) {
3497 Klass* k = java_lang_Class::as_Klass(obj);
3498 st->print(" = ");
3499 if (k != NULL) {
3500 k->print_value_on(st);
3501 } else {
3502 const char* tname = type2name(java_lang_Class::primitive_type(obj));
3503 st->print("%s", tname ? tname : "type?");
3504 }
3505 } else if (this == SystemDictionary::MethodType_klass()) {
3506 st->print(" = ");
3507 java_lang_invoke_MethodType::print_signature(obj, st);
3508 } else if (java_lang_boxing_object::is_instance(obj)) {
3509 st->print(" = ");
3510 java_lang_boxing_object::print(obj, st);
3511 } else if (this == SystemDictionary::LambdaForm_klass()) {
3512 oop vmentry = java_lang_invoke_LambdaForm::vmentry(obj);
3513 if (vmentry != NULL) {
3514 st->print(" => ");
3515 vmentry->print_value_on(st);
3516 }
3517 } else if (this == SystemDictionary::MemberName_klass()) {
3518 Metadata* vmtarget = java_lang_invoke_MemberName::vmtarget(obj);
3519 if (vmtarget != NULL) {
3520 st->print(" = ");
3521 vmtarget->print_value_on(st);
3522 } else {
3523 java_lang_invoke_MemberName::clazz(obj)->print_value_on(st);
3524 st->print(".");
3525 java_lang_invoke_MemberName::name(obj)->print_value_on(st);
3526 }
3527 }
3528 }
3529
3530 const char* InstanceKlass::internal_name() const {
3531 return external_name();
3532 }
3533
3534 void InstanceKlass::print_class_load_logging(ClassLoaderData* loader_data,
3535 const char* module_name,
3536 const ClassFileStream* cfs) const {
3537 if (!log_is_enabled(Info, class, load)) {
3538 return;
3539 }
3540
3541 ResourceMark rm;
3542 LogMessage(class, load) msg;
3543 stringStream info_stream;
3544
3545 // Name and class hierarchy info
3546 info_stream.print("%s", external_name());
3547
3548 // Source
3549 if (cfs != NULL) {
3550 if (cfs->source() != NULL) {
3551 if (module_name != NULL) {
3552 // When the boot loader created the stream, it didn't know the module name
3553 // yet. Let's format it now.
3554 if (cfs->from_boot_loader_modules_image()) {
3555 info_stream.print(" source: jrt:/%s", module_name);
3556 } else {
3557 info_stream.print(" source: %s", cfs->source());
3558 }
3559 } else {
3560 info_stream.print(" source: %s", cfs->source());
3561 }
3562 } else if (loader_data == ClassLoaderData::the_null_class_loader_data()) {
3563 Thread* THREAD = Thread::current();
3564 Klass* caller =
3565 THREAD->is_Java_thread()
3566 ? ((JavaThread*)THREAD)->security_get_caller_class(1)
3567 : NULL;
3568 // caller can be NULL, for example, during a JVMTI VM_Init hook
3569 if (caller != NULL) {
3570 info_stream.print(" source: instance of %s", caller->external_name());
3571 } else {
3572 // source is unknown
3573 }
3574 } else {
3575 oop class_loader = loader_data->class_loader();
3576 info_stream.print(" source: %s", class_loader->klass()->external_name());
3577 }
3578 } else {
3579 assert(this->is_shared(), "must be");
3580 if (MetaspaceShared::is_shared_dynamic((void*)this)) {
3581 info_stream.print(" source: shared objects file (top)");
3582 } else {
3583 info_stream.print(" source: shared objects file");
3584 }
3585 }
3586
3587 msg.info("%s", info_stream.as_string());
3588
3589 if (log_is_enabled(Debug, class, load)) {
3590 stringStream debug_stream;
3591
3592 // Class hierarchy info
3593 debug_stream.print(" klass: " INTPTR_FORMAT " super: " INTPTR_FORMAT,
3594 p2i(this), p2i(superklass()));
3595
3596 // Interfaces
3597 if (local_interfaces() != NULL && local_interfaces()->length() > 0) {
3598 debug_stream.print(" interfaces:");
3599 int length = local_interfaces()->length();
3600 for (int i = 0; i < length; i++) {
3601 debug_stream.print(" " INTPTR_FORMAT,
3602 p2i(InstanceKlass::cast(local_interfaces()->at(i))));
3603 }
3604 }
3605
3606 // Class loader
3607 debug_stream.print(" loader: [");
3608 loader_data->print_value_on(&debug_stream);
3609 debug_stream.print("]");
3610
3611 // Classfile checksum
3612 if (cfs) {
3613 debug_stream.print(" bytes: %d checksum: %08x",
3614 cfs->length(),
3615 ClassLoader::crc32(0, (const char*)cfs->buffer(),
3616 cfs->length()));
3617 }
3618
3619 msg.debug("%s", debug_stream.as_string());
3620 }
3621 }
3622
3623 #if INCLUDE_SERVICES
3624 // Size Statistics
3625 void InstanceKlass::collect_statistics(KlassSizeStats *sz) const {
3626 Klass::collect_statistics(sz);
3627
3628 sz->_inst_size = wordSize * size_helper();
3629 sz->_vtab_bytes = wordSize * vtable_length();
3630 sz->_itab_bytes = wordSize * itable_length();
3631 sz->_nonstatic_oopmap_bytes = wordSize * nonstatic_oop_map_size();
3632
3633 int n = 0;
3634 n += (sz->_methods_array_bytes = sz->count_array(methods()));
3635 n += (sz->_method_ordering_bytes = sz->count_array(method_ordering()));
3636 n += (sz->_local_interfaces_bytes = sz->count_array(local_interfaces()));
3637 n += (sz->_transitive_interfaces_bytes = sz->count_array(transitive_interfaces()));
3638 n += (sz->_fields_bytes = sz->count_array(fields()));
3639 n += (sz->_inner_classes_bytes = sz->count_array(inner_classes()));
3640 n += (sz->_nest_members_bytes = sz->count_array(nest_members()));
3641 sz->_ro_bytes += n;
3642
3643 const ConstantPool* cp = constants();
3644 if (cp) {
3645 cp->collect_statistics(sz);
3646 }
3647
3648 const Annotations* anno = annotations();
3649 if (anno) {
3650 anno->collect_statistics(sz);
3651 }
3652
3653 const Array<Method*>* methods_array = methods();
3654 if (methods()) {
3655 for (int i = 0; i < methods_array->length(); i++) {
3656 Method* method = methods_array->at(i);
3657 if (method) {
3658 sz->_method_count ++;
3659 method->collect_statistics(sz);
3660 }
3661 }
3662 }
3663 }
3664 #endif // INCLUDE_SERVICES
3665
3666 // Verification
3667
3668 class VerifyFieldClosure: public BasicOopIterateClosure {
3669 protected:
3670 template <class T> void do_oop_work(T* p) {
3671 oop obj = RawAccess<>::oop_load(p);
3672 if (!oopDesc::is_oop_or_null(obj)) {
3673 tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p2i(p), p2i(obj));
3674 Universe::print_on(tty);
3675 guarantee(false, "boom");
3676 }
3677 }
3678 public:
3679 virtual void do_oop(oop* p) { VerifyFieldClosure::do_oop_work(p); }
3680 virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); }
3681 };
3682
3683 void InstanceKlass::verify_on(outputStream* st) {
3684 #ifndef PRODUCT
3685 // Avoid redundant verifies, this really should be in product.
3686 if (_verify_count == Universe::verify_count()) return;
3687 _verify_count = Universe::verify_count();
3688 #endif
3689
3690 // Verify Klass
3691 Klass::verify_on(st);
3692
3693 // Verify that klass is present in ClassLoaderData
3694 guarantee(class_loader_data()->contains_klass(this),
3695 "this class isn't found in class loader data");
3696
3697 // Verify vtables
3698 if (is_linked()) {
3699 // $$$ This used to be done only for m/s collections. Doing it
3700 // always seemed a valid generalization. (DLD -- 6/00)
3701 vtable().verify(st);
3702 }
3703
3704 // Verify first subklass
3705 if (subklass() != NULL) {
3706 guarantee(subklass()->is_klass(), "should be klass");
3707 }
3708
3709 // Verify siblings
3710 Klass* super = this->super();
3711 Klass* sib = next_sibling();
3712 if (sib != NULL) {
3713 if (sib == this) {
3714 fatal("subclass points to itself " PTR_FORMAT, p2i(sib));
3715 }
3716
3717 guarantee(sib->is_klass(), "should be klass");
3718 guarantee(sib->super() == super, "siblings should have same superklass");
3719 }
3720
3721 // Verify local interfaces
3722 if (local_interfaces()) {
3723 Array<InstanceKlass*>* local_interfaces = this->local_interfaces();
3724 for (int j = 0; j < local_interfaces->length(); j++) {
3725 InstanceKlass* e = local_interfaces->at(j);
3726 guarantee(e->is_klass() && e->is_interface(), "invalid local interface");
3727 }
3728 }
3729
3730 // Verify transitive interfaces
3731 if (transitive_interfaces() != NULL) {
3732 Array<InstanceKlass*>* transitive_interfaces = this->transitive_interfaces();
3733 for (int j = 0; j < transitive_interfaces->length(); j++) {
3734 InstanceKlass* e = transitive_interfaces->at(j);
3735 guarantee(e->is_klass() && e->is_interface(), "invalid transitive interface");
3736 }
3737 }
3738
3739 // Verify methods
3740 if (methods() != NULL) {
3741 Array<Method*>* methods = this->methods();
3742 for (int j = 0; j < methods->length(); j++) {
3743 guarantee(methods->at(j)->is_method(), "non-method in methods array");
3744 }
3745 for (int j = 0; j < methods->length() - 1; j++) {
3746 Method* m1 = methods->at(j);
3747 Method* m2 = methods->at(j + 1);
3748 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
3749 }
3750 }
3751
3752 // Verify method ordering
3753 if (method_ordering() != NULL) {
3754 Array<int>* method_ordering = this->method_ordering();
3755 int length = method_ordering->length();
3756 if (JvmtiExport::can_maintain_original_method_order() ||
3757 ((UseSharedSpaces || DumpSharedSpaces) && length != 0)) {
3758 guarantee(length == methods()->length(), "invalid method ordering length");
3759 jlong sum = 0;
3760 for (int j = 0; j < length; j++) {
3761 int original_index = method_ordering->at(j);
3762 guarantee(original_index >= 0, "invalid method ordering index");
3763 guarantee(original_index < length, "invalid method ordering index");
3764 sum += original_index;
3765 }
3766 // Verify sum of indices 0,1,...,length-1
3767 guarantee(sum == ((jlong)length*(length-1))/2, "invalid method ordering sum");
3768 } else {
3769 guarantee(length == 0, "invalid method ordering length");
3770 }
3771 }
3772
3773 // Verify default methods
3774 if (default_methods() != NULL) {
3775 Array<Method*>* methods = this->default_methods();
3776 for (int j = 0; j < methods->length(); j++) {
3777 guarantee(methods->at(j)->is_method(), "non-method in methods array");
3778 }
3779 for (int j = 0; j < methods->length() - 1; j++) {
3780 Method* m1 = methods->at(j);
3781 Method* m2 = methods->at(j + 1);
3782 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
3783 }
3784 }
3785
3786 // Verify JNI static field identifiers
3787 if (jni_ids() != NULL) {
3788 jni_ids()->verify(this);
3789 }
3790
3791 // Verify other fields
3792 if (array_klasses() != NULL) {
3793 guarantee(array_klasses()->is_klass(), "should be klass");
3794 }
3795 if (constants() != NULL) {
3796 guarantee(constants()->is_constantPool(), "should be constant pool");
3797 }
3798 const Klass* anonymous_host = unsafe_anonymous_host();
3799 if (anonymous_host != NULL) {
3800 guarantee(anonymous_host->is_klass(), "should be klass");
3801 }
3802 }
3803
3804 void InstanceKlass::oop_verify_on(oop obj, outputStream* st) {
3805 Klass::oop_verify_on(obj, st);
3806 VerifyFieldClosure blk;
3807 obj->oop_iterate(&blk);
3808 }
3809
3810
3811 // JNIid class for jfieldIDs only
3812 // Note to reviewers:
3813 // These JNI functions are just moved over to column 1 and not changed
3814 // in the compressed oops workspace.
3815 JNIid::JNIid(Klass* holder, int offset, JNIid* next) {
3816 _holder = holder;
3817 _offset = offset;
3818 _next = next;
3819 debug_only(_is_static_field_id = false;)
3820 }
3821
3822
3823 JNIid* JNIid::find(int offset) {
3824 JNIid* current = this;
3825 while (current != NULL) {
3826 if (current->offset() == offset) return current;
3827 current = current->next();
3828 }
3829 return NULL;
3830 }
3831
3832 void JNIid::deallocate(JNIid* current) {
3833 while (current != NULL) {
3834 JNIid* next = current->next();
3835 delete current;
3836 current = next;
3837 }
3838 }
3839
3840
3841 void JNIid::verify(Klass* holder) {
3842 int first_field_offset = InstanceMirrorKlass::offset_of_static_fields();
3843 int end_field_offset;
3844 end_field_offset = first_field_offset + (InstanceKlass::cast(holder)->static_field_size() * wordSize);
3845
3846 JNIid* current = this;
3847 while (current != NULL) {
3848 guarantee(current->holder() == holder, "Invalid klass in JNIid");
3849 #ifdef ASSERT
3850 int o = current->offset();
3851 if (current->is_static_field_id()) {
3852 guarantee(o >= first_field_offset && o < end_field_offset, "Invalid static field offset in JNIid");
3853 }
3854 #endif
3855 current = current->next();
3856 }
3857 }
3858
3859 void InstanceKlass::set_init_state(ClassState state) {
3860 #ifdef ASSERT
3861 bool good_state = is_shared() ? (_init_state <= state)
3862 : (_init_state < state);
3863 assert(good_state || state == allocated, "illegal state transition");
3864 #endif
3865 assert(_init_thread == NULL, "should be cleared before state change");
3866 _init_state = (u1)state;
3867 }
3868
3869 #if INCLUDE_JVMTI
3870
3871 // RedefineClasses() support for previous versions
3872
3873 // Globally, there is at least one previous version of a class to walk
3874 // during class unloading, which is saved because old methods in the class
3875 // are still running. Otherwise the previous version list is cleaned up.
3876 bool InstanceKlass::_has_previous_versions = false;
3877
3878 // Returns true if there are previous versions of a class for class
3879 // unloading only. Also resets the flag to false. purge_previous_version
3880 // will set the flag to true if there are any left, i.e., if there's any
3881 // work to do for next time. This is to avoid the expensive code cache
3882 // walk in CLDG::clean_deallocate_lists().
3883 bool InstanceKlass::has_previous_versions_and_reset() {
3884 bool ret = _has_previous_versions;
3885 log_trace(redefine, class, iklass, purge)("Class unloading: has_previous_versions = %s",
3886 ret ? "true" : "false");
3887 _has_previous_versions = false;
3888 return ret;
3889 }
3890
3891 // Purge previous versions before adding new previous versions of the class and
3892 // during class unloading.
3893 void InstanceKlass::purge_previous_version_list() {
3894 assert(SafepointSynchronize::is_at_safepoint(), "only called at safepoint");
3895 assert(has_been_redefined(), "Should only be called for main class");
3896
3897 // Quick exit.
3898 if (previous_versions() == NULL) {
3899 return;
3900 }
3901
3902 // This klass has previous versions so see what we can cleanup
3903 // while it is safe to do so.
3904
3905 int deleted_count = 0; // leave debugging breadcrumbs
3906 int live_count = 0;
3907 ClassLoaderData* loader_data = class_loader_data();
3908 assert(loader_data != NULL, "should never be null");
3909
3910 ResourceMark rm;
3911 log_trace(redefine, class, iklass, purge)("%s: previous versions", external_name());
3912
3913 // previous versions are linked together through the InstanceKlass
3914 InstanceKlass* pv_node = previous_versions();
3915 InstanceKlass* last = this;
3916 int version = 0;
3917
3918 // check the previous versions list
3919 for (; pv_node != NULL; ) {
3920
3921 ConstantPool* pvcp = pv_node->constants();
3922 assert(pvcp != NULL, "cp ref was unexpectedly cleared");
3923
3924 if (!pvcp->on_stack()) {
3925 // If the constant pool isn't on stack, none of the methods
3926 // are executing. Unlink this previous_version.
3927 // The previous version InstanceKlass is on the ClassLoaderData deallocate list
3928 // so will be deallocated during the next phase of class unloading.
3929 log_trace(redefine, class, iklass, purge)
3930 ("previous version " INTPTR_FORMAT " is dead.", p2i(pv_node));
3931 // For debugging purposes.
3932 pv_node->set_is_scratch_class();
3933 // Unlink from previous version list.
3934 assert(pv_node->class_loader_data() == loader_data, "wrong loader_data");
3935 InstanceKlass* next = pv_node->previous_versions();
3936 pv_node->link_previous_versions(NULL); // point next to NULL
3937 last->link_previous_versions(next);
3938 // Add to the deallocate list after unlinking
3939 loader_data->add_to_deallocate_list(pv_node);
3940 pv_node = next;
3941 deleted_count++;
3942 version++;
3943 continue;
3944 } else {
3945 log_trace(redefine, class, iklass, purge)("previous version " INTPTR_FORMAT " is alive", p2i(pv_node));
3946 assert(pvcp->pool_holder() != NULL, "Constant pool with no holder");
3947 guarantee (!loader_data->is_unloading(), "unloaded classes can't be on the stack");
3948 live_count++;
3949 // found a previous version for next time we do class unloading
3950 _has_previous_versions = true;
3951 }
3952
3953 // At least one method is live in this previous version.
3954 // Reset dead EMCP methods not to get breakpoints.
3955 // All methods are deallocated when all of the methods for this class are no
3956 // longer running.
3957 Array<Method*>* method_refs = pv_node->methods();
3958 if (method_refs != NULL) {
3959 log_trace(redefine, class, iklass, purge)("previous methods length=%d", method_refs->length());
3960 for (int j = 0; j < method_refs->length(); j++) {
3961 Method* method = method_refs->at(j);
3962
3963 if (!method->on_stack()) {
3964 // no breakpoints for non-running methods
3965 if (method->is_running_emcp()) {
3966 method->set_running_emcp(false);
3967 }
3968 } else {
3969 assert (method->is_obsolete() || method->is_running_emcp(),
3970 "emcp method cannot run after emcp bit is cleared");
3971 log_trace(redefine, class, iklass, purge)
3972 ("purge: %s(%s): prev method @%d in version @%d is alive",
3973 method->name()->as_C_string(), method->signature()->as_C_string(), j, version);
3974 }
3975 }
3976 }
3977 // next previous version
3978 last = pv_node;
3979 pv_node = pv_node->previous_versions();
3980 version++;
3981 }
3982 log_trace(redefine, class, iklass, purge)
3983 ("previous version stats: live=%d, deleted=%d", live_count, deleted_count);
3984 }
3985
3986 void InstanceKlass::mark_newly_obsolete_methods(Array<Method*>* old_methods,
3987 int emcp_method_count) {
3988 int obsolete_method_count = old_methods->length() - emcp_method_count;
3989
3990 if (emcp_method_count != 0 && obsolete_method_count != 0 &&
3991 _previous_versions != NULL) {
3992 // We have a mix of obsolete and EMCP methods so we have to
3993 // clear out any matching EMCP method entries the hard way.
3994 int local_count = 0;
3995 for (int i = 0; i < old_methods->length(); i++) {
3996 Method* old_method = old_methods->at(i);
3997 if (old_method->is_obsolete()) {
3998 // only obsolete methods are interesting
3999 Symbol* m_name = old_method->name();
4000 Symbol* m_signature = old_method->signature();
4001
4002 // previous versions are linked together through the InstanceKlass
4003 int j = 0;
4004 for (InstanceKlass* prev_version = _previous_versions;
4005 prev_version != NULL;
4006 prev_version = prev_version->previous_versions(), j++) {
4007
4008 Array<Method*>* method_refs = prev_version->methods();
4009 for (int k = 0; k < method_refs->length(); k++) {
4010 Method* method = method_refs->at(k);
4011
4012 if (!method->is_obsolete() &&
4013 method->name() == m_name &&
4014 method->signature() == m_signature) {
4015 // The current RedefineClasses() call has made all EMCP
4016 // versions of this method obsolete so mark it as obsolete
4017 log_trace(redefine, class, iklass, add)
4018 ("%s(%s): flush obsolete method @%d in version @%d",
4019 m_name->as_C_string(), m_signature->as_C_string(), k, j);
4020
4021 method->set_is_obsolete();
4022 break;
4023 }
4024 }
4025
4026 // The previous loop may not find a matching EMCP method, but
4027 // that doesn't mean that we can optimize and not go any
4028 // further back in the PreviousVersion generations. The EMCP
4029 // method for this generation could have already been made obsolete,
4030 // but there still may be an older EMCP method that has not
4031 // been made obsolete.
4032 }
4033
4034 if (++local_count >= obsolete_method_count) {
4035 // no more obsolete methods so bail out now
4036 break;
4037 }
4038 }
4039 }
4040 }
4041 }
4042
4043 // Save the scratch_class as the previous version if any of the methods are running.
4044 // The previous_versions are used to set breakpoints in EMCP methods and they are
4045 // also used to clean MethodData links to redefined methods that are no longer running.
4046 void InstanceKlass::add_previous_version(InstanceKlass* scratch_class,
4047 int emcp_method_count) {
4048 assert(Thread::current()->is_VM_thread(),
4049 "only VMThread can add previous versions");
4050
4051 ResourceMark rm;
4052 log_trace(redefine, class, iklass, add)
4053 ("adding previous version ref for %s, EMCP_cnt=%d", scratch_class->external_name(), emcp_method_count);
4054
4055 // Clean out old previous versions for this class
4056 purge_previous_version_list();
4057
4058 // Mark newly obsolete methods in remaining previous versions. An EMCP method from
4059 // a previous redefinition may be made obsolete by this redefinition.
4060 Array<Method*>* old_methods = scratch_class->methods();
4061 mark_newly_obsolete_methods(old_methods, emcp_method_count);
4062
4063 // If the constant pool for this previous version of the class
4064 // is not marked as being on the stack, then none of the methods
4065 // in this previous version of the class are on the stack so
4066 // we don't need to add this as a previous version.
4067 ConstantPool* cp_ref = scratch_class->constants();
4068 if (!cp_ref->on_stack()) {
4069 log_trace(redefine, class, iklass, add)("scratch class not added; no methods are running");
4070 // For debugging purposes.
4071 scratch_class->set_is_scratch_class();
4072 scratch_class->class_loader_data()->add_to_deallocate_list(scratch_class);
4073 return;
4074 }
4075
4076 if (emcp_method_count != 0) {
4077 // At least one method is still running, check for EMCP methods
4078 for (int i = 0; i < old_methods->length(); i++) {
4079 Method* old_method = old_methods->at(i);
4080 if (!old_method->is_obsolete() && old_method->on_stack()) {
4081 // if EMCP method (not obsolete) is on the stack, mark as EMCP so that
4082 // we can add breakpoints for it.
4083
4084 // We set the method->on_stack bit during safepoints for class redefinition
4085 // and use this bit to set the is_running_emcp bit.
4086 // After the safepoint, the on_stack bit is cleared and the running emcp
4087 // method may exit. If so, we would set a breakpoint in a method that
4088 // is never reached, but this won't be noticeable to the programmer.
4089 old_method->set_running_emcp(true);
4090 log_trace(redefine, class, iklass, add)
4091 ("EMCP method %s is on_stack " INTPTR_FORMAT, old_method->name_and_sig_as_C_string(), p2i(old_method));
4092 } else if (!old_method->is_obsolete()) {
4093 log_trace(redefine, class, iklass, add)
4094 ("EMCP method %s is NOT on_stack " INTPTR_FORMAT, old_method->name_and_sig_as_C_string(), p2i(old_method));
4095 }
4096 }
4097 }
4098
4099 // Add previous version if any methods are still running.
4100 // Set has_previous_version flag for processing during class unloading.
4101 _has_previous_versions = true;
4102 log_trace(redefine, class, iklass, add) ("scratch class added; one of its methods is on_stack.");
4103 assert(scratch_class->previous_versions() == NULL, "shouldn't have a previous version");
4104 scratch_class->link_previous_versions(previous_versions());
4105 link_previous_versions(scratch_class);
4106 } // end add_previous_version()
4107
4108 #endif // INCLUDE_JVMTI
4109
4110 Method* InstanceKlass::method_with_idnum(int idnum) {
4111 Method* m = NULL;
4112 if (idnum < methods()->length()) {
4113 m = methods()->at(idnum);
4114 }
4115 if (m == NULL || m->method_idnum() != idnum) {
4116 for (int index = 0; index < methods()->length(); ++index) {
4117 m = methods()->at(index);
4118 if (m->method_idnum() == idnum) {
4119 return m;
4120 }
4121 }
4122 // None found, return null for the caller to handle.
4123 return NULL;
4124 }
4125 return m;
4126 }
4127
4128
4129 Method* InstanceKlass::method_with_orig_idnum(int idnum) {
4130 if (idnum >= methods()->length()) {
4131 return NULL;
4132 }
4133 Method* m = methods()->at(idnum);
4134 if (m != NULL && m->orig_method_idnum() == idnum) {
4135 return m;
4136 }
4137 // Obsolete method idnum does not match the original idnum
4138 for (int index = 0; index < methods()->length(); ++index) {
4139 m = methods()->at(index);
4140 if (m->orig_method_idnum() == idnum) {
4141 return m;
4142 }
4143 }
4144 // None found, return null for the caller to handle.
4145 return NULL;
4146 }
4147
4148
4149 Method* InstanceKlass::method_with_orig_idnum(int idnum, int version) {
4150 InstanceKlass* holder = get_klass_version(version);
4151 if (holder == NULL) {
4152 return NULL; // The version of klass is gone, no method is found
4153 }
4154 Method* method = holder->method_with_orig_idnum(idnum);
4155 return method;
4156 }
4157
4158 #if INCLUDE_JVMTI
4159 JvmtiCachedClassFileData* InstanceKlass::get_cached_class_file() {
4160 return _cached_class_file;
4161 }
4162
4163 jint InstanceKlass::get_cached_class_file_len() {
4164 return VM_RedefineClasses::get_cached_class_file_len(_cached_class_file);
4165 }
4166
4167 unsigned char * InstanceKlass::get_cached_class_file_bytes() {
4168 return VM_RedefineClasses::get_cached_class_file_bytes(_cached_class_file);
4169 }
4170 #endif
4171
4172 #define THROW_DVT_ERROR(s) \
4173 Exceptions::fthrow(THREAD_AND_LOCATION, vmSymbols::java_lang_IncompatibleClassChangeError(), \
4174 "ValueCapableClass class '%s' %s", external_name(),(s)); \
4175 return
--- EOF ---