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 Klass* klass = this->get_value_field_klass_or_null(fs.index());
1127 if (klass == NULL) {
1128 klass = SystemDictionary::resolve_or_fail(fs.signature()->fundamental_name(THREAD), Handle(THREAD, class_loader()),
1129 Handle(THREAD, protection_domain()), true, CHECK);
1130 this->set_value_field_klass(fs.index(), InstanceKlass::cast(klass));
1131 }
1132 if (!klass->is_value()) {
1133 THROW(vmSymbols::java_lang_IncompatibleClassChangeError());
1134 }
1135 InstanceKlass* field_klass = InstanceKlass::cast(klass);
1136 field_klass->initialize(CHECK);
1137 }
1138 }
1139 }
1140
1141
1142 // Look for aot compiled methods for this klass, including class initializer.
1143 AOTLoader::load_for_klass(this, THREAD);
1144
1145 // Step 9
1146 {
1147 DTRACE_CLASSINIT_PROBE_WAIT(clinit, -1, wait);
1148 // Timer includes any side effects of class initialization (resolution,
1149 // etc), but not recursive entry into call_class_initializer().
1150 PerfClassTraceTime timer(ClassLoader::perf_class_init_time(),
1151 ClassLoader::perf_class_init_selftime(),
1152 ClassLoader::perf_classes_inited(),
1153 jt->get_thread_stat()->perf_recursion_counts_addr(),
1154 jt->get_thread_stat()->perf_timers_addr(),
1155 PerfClassTraceTime::CLASS_CLINIT);
1156 call_class_initializer(THREAD);
1157 }
1158
1159 // Step 10
1160 if (!HAS_PENDING_EXCEPTION) {
1161 set_initialization_state_and_notify(fully_initialized, CHECK);
1162 {
1163 debug_only(vtable().verify(tty, true);)
1164 }
1165 }
1166 else {
1167 // Step 11 and 12
1168 Handle e(THREAD, PENDING_EXCEPTION);
1169 CLEAR_PENDING_EXCEPTION;
1170 // JVMTI has already reported the pending exception
1171 // JVMTI internal flag reset is needed in order to report ExceptionInInitializerError
1172 JvmtiExport::clear_detected_exception(jt);
1173 {
1174 EXCEPTION_MARK;
1175 set_initialization_state_and_notify(initialization_error, THREAD);
1176 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, class initialization error is thrown below
1177 // JVMTI has already reported the pending exception
1178 // JVMTI internal flag reset is needed in order to report ExceptionInInitializerError
1179 JvmtiExport::clear_detected_exception(jt);
1180 }
1181 DTRACE_CLASSINIT_PROBE_WAIT(error, -1, wait);
1182 if (e->is_a(SystemDictionary::Error_klass())) {
1183 THROW_OOP(e());
1184 } else {
1185 JavaCallArguments args(e);
1186 THROW_ARG(vmSymbols::java_lang_ExceptionInInitializerError(),
1187 vmSymbols::throwable_void_signature(),
1188 &args);
1189 }
1190 }
1191 DTRACE_CLASSINIT_PROBE_WAIT(end, -1, wait);
1192 }
1193
1194
1195 void InstanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) {
1196 Handle h_init_lock(THREAD, init_lock());
1197 if (h_init_lock() != NULL) {
1198 ObjectLocker ol(h_init_lock, THREAD);
1199 set_init_thread(NULL); // reset _init_thread before changing _init_state
1200 set_init_state(state);
1201 fence_and_clear_init_lock();
1202 ol.notify_all(CHECK);
1203 } else {
1204 assert(h_init_lock() != NULL, "The initialization state should never be set twice");
1205 set_init_thread(NULL); // reset _init_thread before changing _init_state
1206 set_init_state(state);
1207 }
1208 }
1209
1210 Klass* InstanceKlass::implementor() const {
1211 Klass* volatile* k = adr_implementor();
1212 if (k == NULL) {
1213 return NULL;
1214 } else {
1215 // This load races with inserts, and therefore needs acquire.
1216 Klass* kls = OrderAccess::load_acquire(k);
1217 if (kls != NULL && !kls->is_loader_alive()) {
1218 return NULL; // don't return unloaded class
1219 } else {
1220 return kls;
1221 }
1222 }
1223 }
1224
1225
1226 void InstanceKlass::set_implementor(Klass* k) {
1227 assert_lock_strong(Compile_lock);
1228 assert(is_interface(), "not interface");
1229 Klass* volatile* addr = adr_implementor();
1230 assert(addr != NULL, "null addr");
1231 if (addr != NULL) {
1232 OrderAccess::release_store(addr, k);
1233 }
1234 }
1235
1236 int InstanceKlass::nof_implementors() const {
1237 Klass* k = implementor();
1238 if (k == NULL) {
1239 return 0;
1240 } else if (k != this) {
1241 return 1;
1242 } else {
1243 return 2;
1244 }
1245 }
1246
1247 // The embedded _implementor field can only record one implementor.
1248 // When there are more than one implementors, the _implementor field
1249 // is set to the interface Klass* itself. Following are the possible
1250 // values for the _implementor field:
1251 // NULL - no implementor
1252 // implementor Klass* - one implementor
1253 // self - more than one implementor
1254 //
1255 // The _implementor field only exists for interfaces.
1256 void InstanceKlass::add_implementor(Klass* k) {
1257 assert_lock_strong(Compile_lock);
1258 assert(is_interface(), "not interface");
1259 // Filter out my subinterfaces.
1260 // (Note: Interfaces are never on the subklass list.)
1261 if (InstanceKlass::cast(k)->is_interface()) return;
1262
1263 // Filter out subclasses whose supers already implement me.
1264 // (Note: CHA must walk subclasses of direct implementors
1265 // in order to locate indirect implementors.)
1266 Klass* sk = k->super();
1267 if (sk != NULL && InstanceKlass::cast(sk)->implements_interface(this))
1268 // We only need to check one immediate superclass, since the
1269 // implements_interface query looks at transitive_interfaces.
1270 // Any supers of the super have the same (or fewer) transitive_interfaces.
1271 return;
1272
1273 Klass* ik = implementor();
1274 if (ik == NULL) {
1275 set_implementor(k);
1276 } else if (ik != this) {
1277 // There is already an implementor. Use itself as an indicator of
1278 // more than one implementors.
1279 set_implementor(this);
1280 }
1281
1282 // The implementor also implements the transitive_interfaces
1283 for (int index = 0; index < local_interfaces()->length(); index++) {
1284 InstanceKlass::cast(local_interfaces()->at(index))->add_implementor(k);
1285 }
1286 }
1287
1288 void InstanceKlass::init_implementor() {
1289 if (is_interface()) {
1290 set_implementor(NULL);
1291 }
1292 }
1293
1294
1295 void InstanceKlass::process_interfaces(Thread *thread) {
1296 // link this class into the implementors list of every interface it implements
1297 for (int i = local_interfaces()->length() - 1; i >= 0; i--) {
1298 assert(local_interfaces()->at(i)->is_klass(), "must be a klass");
1299 InstanceKlass* interf = InstanceKlass::cast(local_interfaces()->at(i));
1300 assert(interf->is_interface(), "expected interface");
1301 interf->add_implementor(this);
1302 }
1303 }
1304
1305 bool InstanceKlass::can_be_primary_super_slow() const {
1306 if (is_interface())
1307 return false;
1308 else
1309 return Klass::can_be_primary_super_slow();
1310 }
1311
1312 GrowableArray<Klass*>* InstanceKlass::compute_secondary_supers(int num_extra_slots,
1313 Array<InstanceKlass*>* transitive_interfaces) {
1314 // The secondaries are the implemented interfaces.
1315 Array<InstanceKlass*>* interfaces = transitive_interfaces;
1316 int num_secondaries = num_extra_slots + interfaces->length();
1317 if (num_secondaries == 0) {
1318 // Must share this for correct bootstrapping!
1319 set_secondary_supers(Universe::the_empty_klass_array());
1320 return NULL;
1321 } else if (num_extra_slots == 0) {
1322 // The secondary super list is exactly the same as the transitive interfaces, so
1323 // let's use it instead of making a copy.
1324 // Redefine classes has to be careful not to delete this!
1325 // We need the cast because Array<Klass*> is NOT a supertype of Array<InstanceKlass*>,
1326 // (but it's safe to do here because we won't write into _secondary_supers from this point on).
1327 set_secondary_supers((Array<Klass*>*)(address)interfaces);
1328 return NULL;
1329 } else {
1330 // Copy transitive interfaces to a temporary growable array to be constructed
1331 // into the secondary super list with extra slots.
1332 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(interfaces->length());
1333 for (int i = 0; i < interfaces->length(); i++) {
1334 secondaries->push(interfaces->at(i));
1335 }
1336 return secondaries;
1337 }
1338 }
1339
1340 bool InstanceKlass::implements_interface(Klass* k) const {
1341 if (this == k) return true;
1342 assert(k->is_interface(), "should be an interface class");
1343 for (int i = 0; i < transitive_interfaces()->length(); i++) {
1344 if (transitive_interfaces()->at(i) == k) {
1345 return true;
1346 }
1347 }
1348 return false;
1349 }
1350
1351 bool InstanceKlass::is_same_or_direct_interface(Klass *k) const {
1352 // Verify direct super interface
1353 if (this == k) return true;
1354 assert(k->is_interface(), "should be an interface class");
1355 for (int i = 0; i < local_interfaces()->length(); i++) {
1356 if (local_interfaces()->at(i) == k) {
1357 return true;
1358 }
1359 }
1360 return false;
1361 }
1362
1363 objArrayOop InstanceKlass::allocate_objArray(int n, int length, TRAPS) {
1364 check_array_allocation_length(length, arrayOopDesc::max_array_length(T_OBJECT), CHECK_NULL);
1365 int size = objArrayOopDesc::object_size(length);
1366 Klass* ak = array_klass(n, CHECK_NULL);
1367 objArrayOop o = (objArrayOop)Universe::heap()->array_allocate(ak, size, length,
1368 /* do_zero */ true, CHECK_NULL);
1369 return o;
1370 }
1371
1372 instanceOop InstanceKlass::register_finalizer(instanceOop i, TRAPS) {
1373 if (TraceFinalizerRegistration) {
1374 tty->print("Registered ");
1375 i->print_value_on(tty);
1376 tty->print_cr(" (" INTPTR_FORMAT ") as finalizable", p2i(i));
1377 }
1378 instanceHandle h_i(THREAD, i);
1379 // Pass the handle as argument, JavaCalls::call expects oop as jobjects
1380 JavaValue result(T_VOID);
1381 JavaCallArguments args(h_i);
1382 methodHandle mh (THREAD, Universe::finalizer_register_method());
1383 JavaCalls::call(&result, mh, &args, CHECK_NULL);
1384 return h_i();
1385 }
1386
1387 instanceOop InstanceKlass::allocate_instance(TRAPS) {
1388 bool has_finalizer_flag = has_finalizer(); // Query before possible GC
1389 int size = size_helper(); // Query before forming handle.
1390
1391 instanceOop i;
1392
1393 i = (instanceOop)Universe::heap()->obj_allocate(this, size, CHECK_NULL);
1394 if (has_finalizer_flag && !RegisterFinalizersAtInit) {
1395 i = register_finalizer(i, CHECK_NULL);
1396 }
1397 return i;
1398 }
1399
1400 instanceHandle InstanceKlass::allocate_instance_handle(TRAPS) {
1401 return instanceHandle(THREAD, allocate_instance(THREAD));
1402 }
1403
1404 void InstanceKlass::check_valid_for_instantiation(bool throwError, TRAPS) {
1405 if (is_interface() || is_abstract()) {
1406 ResourceMark rm(THREAD);
1407 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError()
1408 : vmSymbols::java_lang_InstantiationException(), external_name());
1409 }
1410 if (this == SystemDictionary::Class_klass()) {
1411 ResourceMark rm(THREAD);
1412 THROW_MSG(throwError ? vmSymbols::java_lang_IllegalAccessError()
1413 : vmSymbols::java_lang_IllegalAccessException(), external_name());
1414 }
1415 }
1416
1417 Klass* InstanceKlass::array_klass_impl(ArrayStorageProperties storage_props, bool or_null, int n, TRAPS) {
1418 assert(storage_props.is_empty(), "Unexpected");
1419 // Need load-acquire for lock-free read
1420 if (array_klasses_acquire() == NULL) {
1421 if (or_null) return NULL;
1422
1423 ResourceMark rm;
1424 {
1425 // Atomic creation of array_klasses
1426 MutexLocker ma(MultiArray_lock, THREAD);
1427
1428 // Check if update has already taken place
1429 if (array_klasses() == NULL) {
1430 Klass* k = ObjArrayKlass::allocate_objArray_klass(storage_props, 1, this, CHECK_NULL);
1431 // use 'release' to pair with lock-free load
1432 release_set_array_klasses(k);
1433 }
1434 }
1435 }
1436 // _this will always be set at this point
1437 ObjArrayKlass* oak = (ObjArrayKlass*)array_klasses();
1438 if (or_null) {
1439 return oak->array_klass_or_null(storage_props, n);
1440 }
1441 return oak->array_klass(storage_props, n, THREAD);
1442 }
1443
1444 Klass* InstanceKlass::array_klass_impl(ArrayStorageProperties storage_props, bool or_null, TRAPS) {
1445 return array_klass_impl(storage_props, or_null, 1, THREAD);
1446 }
1447
1448 static int call_class_initializer_counter = 0; // for debugging
1449
1450 Method* InstanceKlass::class_initializer() const {
1451 Method* clinit = find_method(
1452 vmSymbols::class_initializer_name(), vmSymbols::void_method_signature());
1453 if (clinit != NULL && clinit->is_class_initializer()) {
1454 return clinit;
1455 }
1456 return NULL;
1457 }
1458
1459 void InstanceKlass::call_class_initializer(TRAPS) {
1460 if (ReplayCompiles &&
1461 (ReplaySuppressInitializers == 1 ||
1462 (ReplaySuppressInitializers >= 2 && class_loader() != NULL))) {
1463 // Hide the existence of the initializer for the purpose of replaying the compile
1464 return;
1465 }
1466
1467 methodHandle h_method(THREAD, class_initializer());
1468 assert(!is_initialized(), "we cannot initialize twice");
1469 LogTarget(Info, class, init) lt;
1470 if (lt.is_enabled()) {
1471 ResourceMark rm;
1472 LogStream ls(lt);
1473 ls.print("%d Initializing ", call_class_initializer_counter++);
1474 name()->print_value_on(&ls);
1475 ls.print_cr("%s (" INTPTR_FORMAT ")", h_method() == NULL ? "(no method)" : "", p2i(this));
1476 }
1477 if (h_method() != NULL) {
1478 JavaCallArguments args; // No arguments
1479 JavaValue result(T_VOID);
1480 JavaCalls::call(&result, h_method, &args, CHECK); // Static call (no args)
1481 }
1482 }
1483
1484
1485 void InstanceKlass::mask_for(const methodHandle& method, int bci,
1486 InterpreterOopMap* entry_for) {
1487 // Lazily create the _oop_map_cache at first request
1488 // Lock-free access requires load_acquire.
1489 OopMapCache* oop_map_cache = OrderAccess::load_acquire(&_oop_map_cache);
1490 if (oop_map_cache == NULL) {
1491 MutexLocker x(OopMapCacheAlloc_lock, Mutex::_no_safepoint_check_flag);
1492 // Check if _oop_map_cache was allocated while we were waiting for this lock
1493 if ((oop_map_cache = _oop_map_cache) == NULL) {
1494 oop_map_cache = new OopMapCache();
1495 // Ensure _oop_map_cache is stable, since it is examined without a lock
1496 OrderAccess::release_store(&_oop_map_cache, oop_map_cache);
1497 }
1498 }
1499 // _oop_map_cache is constant after init; lookup below does its own locking.
1500 oop_map_cache->lookup(method, bci, entry_for);
1501 }
1502
1503
1504 bool InstanceKlass::find_local_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1505 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1506 Symbol* f_name = fs.name();
1507 Symbol* f_sig = fs.signature();
1508 if (f_name == name && f_sig == sig) {
1509 fd->reinitialize(const_cast<InstanceKlass*>(this), fs.index());
1510 return true;
1511 }
1512 }
1513 return false;
1514 }
1515
1516
1517 Klass* InstanceKlass::find_interface_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1518 const int n = local_interfaces()->length();
1519 for (int i = 0; i < n; i++) {
1520 Klass* intf1 = local_interfaces()->at(i);
1521 assert(intf1->is_interface(), "just checking type");
1522 // search for field in current interface
1523 if (InstanceKlass::cast(intf1)->find_local_field(name, sig, fd)) {
1524 assert(fd->is_static(), "interface field must be static");
1525 return intf1;
1526 }
1527 // search for field in direct superinterfaces
1528 Klass* intf2 = InstanceKlass::cast(intf1)->find_interface_field(name, sig, fd);
1529 if (intf2 != NULL) return intf2;
1530 }
1531 // otherwise field lookup fails
1532 return NULL;
1533 }
1534
1535
1536 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
1537 // search order according to newest JVM spec (5.4.3.2, p.167).
1538 // 1) search for field in current klass
1539 if (find_local_field(name, sig, fd)) {
1540 return const_cast<InstanceKlass*>(this);
1541 }
1542 // 2) search for field recursively in direct superinterfaces
1543 { Klass* intf = find_interface_field(name, sig, fd);
1544 if (intf != NULL) return intf;
1545 }
1546 // 3) apply field lookup recursively if superclass exists
1547 { Klass* supr = super();
1548 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, fd);
1549 }
1550 // 4) otherwise field lookup fails
1551 return NULL;
1552 }
1553
1554
1555 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, bool is_static, fieldDescriptor* fd) const {
1556 // search order according to newest JVM spec (5.4.3.2, p.167).
1557 // 1) search for field in current klass
1558 if (find_local_field(name, sig, fd)) {
1559 if (fd->is_static() == is_static) return const_cast<InstanceKlass*>(this);
1560 }
1561 // 2) search for field recursively in direct superinterfaces
1562 if (is_static) {
1563 Klass* intf = find_interface_field(name, sig, fd);
1564 if (intf != NULL) return intf;
1565 }
1566 // 3) apply field lookup recursively if superclass exists
1567 { Klass* supr = super();
1568 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, is_static, fd);
1569 }
1570 // 4) otherwise field lookup fails
1571 return NULL;
1572 }
1573
1574
1575 bool InstanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
1576 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1577 if (fs.offset() == offset) {
1578 fd->reinitialize(const_cast<InstanceKlass*>(this), fs.index());
1579 if (fd->is_static() == is_static) return true;
1580 }
1581 }
1582 return false;
1583 }
1584
1585
1586 bool InstanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const {
1587 Klass* klass = const_cast<InstanceKlass*>(this);
1588 while (klass != NULL) {
1589 if (InstanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) {
1590 return true;
1591 }
1592 klass = klass->super();
1593 }
1594 return false;
1595 }
1596
1597
1598 void InstanceKlass::methods_do(void f(Method* method)) {
1599 // Methods aren't stable until they are loaded. This can be read outside
1600 // a lock through the ClassLoaderData for profiling
1601 if (!is_loaded()) {
1602 return;
1603 }
1604
1605 int len = methods()->length();
1606 for (int index = 0; index < len; index++) {
1607 Method* m = methods()->at(index);
1608 assert(m->is_method(), "must be method");
1609 f(m);
1610 }
1611 }
1612
1613
1614 void InstanceKlass::do_local_static_fields(FieldClosure* cl) {
1615 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1616 if (fs.access_flags().is_static()) {
1617 fieldDescriptor& fd = fs.field_descriptor();
1618 cl->do_field(&fd);
1619 }
1620 }
1621 }
1622
1623
1624 void InstanceKlass::do_local_static_fields(void f(fieldDescriptor*, Handle, TRAPS), Handle mirror, TRAPS) {
1625 for (JavaFieldStream fs(this); !fs.done(); fs.next()) {
1626 if (fs.access_flags().is_static()) {
1627 fieldDescriptor& fd = fs.field_descriptor();
1628 f(&fd, mirror, CHECK);
1629 }
1630 }
1631 }
1632
1633
1634 static int compare_fields_by_offset(int* a, int* b) {
1635 return a[0] - b[0];
1636 }
1637
1638 void InstanceKlass::do_nonstatic_fields(FieldClosure* cl) {
1639 InstanceKlass* super = superklass();
1640 if (super != NULL) {
1641 super->do_nonstatic_fields(cl);
1642 }
1643 fieldDescriptor fd;
1644 int length = java_fields_count();
1645 // In DebugInfo nonstatic fields are sorted by offset.
1646 int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1), mtClass);
1647 int j = 0;
1648 for (int i = 0; i < length; i += 1) {
1649 fd.reinitialize(this, i);
1650 if (!fd.is_static()) {
1651 fields_sorted[j + 0] = fd.offset();
1652 fields_sorted[j + 1] = i;
1653 j += 2;
1654 }
1655 }
1656 if (j > 0) {
1657 length = j;
1658 // _sort_Fn is defined in growableArray.hpp.
1659 qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset);
1660 for (int i = 0; i < length; i += 2) {
1661 fd.reinitialize(this, fields_sorted[i + 1]);
1662 assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields");
1663 cl->do_field(&fd);
1664 }
1665 }
1666 FREE_C_HEAP_ARRAY(int, fields_sorted);
1667 }
1668
1669
1670 void InstanceKlass::array_klasses_do(void f(Klass* k)) {
1671 if (array_klasses() != NULL)
1672 ArrayKlass::cast(array_klasses())->array_klasses_do(f);
1673 }
1674
1675 #ifdef ASSERT
1676 static int linear_search(const Array<Method*>* methods,
1677 const Symbol* name,
1678 const Symbol* signature) {
1679 const int len = methods->length();
1680 for (int index = 0; index < len; index++) {
1681 const Method* const m = methods->at(index);
1682 assert(m->is_method(), "must be method");
1683 if (m->signature() == signature && m->name() == name) {
1684 return index;
1685 }
1686 }
1687 return -1;
1688 }
1689 #endif
1690
1691 static int binary_search(const Array<Method*>* methods, const Symbol* name) {
1692 int len = methods->length();
1693 // methods are sorted, so do binary search
1694 int l = 0;
1695 int h = len - 1;
1696 while (l <= h) {
1697 int mid = (l + h) >> 1;
1698 Method* m = methods->at(mid);
1699 assert(m->is_method(), "must be method");
1700 int res = m->name()->fast_compare(name);
1701 if (res == 0) {
1702 return mid;
1703 } else if (res < 0) {
1704 l = mid + 1;
1705 } else {
1706 h = mid - 1;
1707 }
1708 }
1709 return -1;
1710 }
1711
1712 // find_method looks up the name/signature in the local methods array
1713 Method* InstanceKlass::find_method(const Symbol* name,
1714 const Symbol* signature) const {
1715 return find_method_impl(name, signature, find_overpass, find_static, find_private);
1716 }
1717
1718 Method* InstanceKlass::find_method_impl(const Symbol* name,
1719 const Symbol* signature,
1720 OverpassLookupMode overpass_mode,
1721 StaticLookupMode static_mode,
1722 PrivateLookupMode private_mode) const {
1723 return InstanceKlass::find_method_impl(methods(),
1724 name,
1725 signature,
1726 overpass_mode,
1727 static_mode,
1728 private_mode);
1729 }
1730
1731 // find_instance_method looks up the name/signature in the local methods array
1732 // and skips over static methods
1733 Method* InstanceKlass::find_instance_method(const Array<Method*>* methods,
1734 const Symbol* name,
1735 const Symbol* signature,
1736 PrivateLookupMode private_mode) {
1737 Method* const meth = InstanceKlass::find_method_impl(methods,
1738 name,
1739 signature,
1740 find_overpass,
1741 skip_static,
1742 private_mode);
1743 assert(((meth == NULL) || !meth->is_static()),
1744 "find_instance_method should have skipped statics");
1745 return meth;
1746 }
1747
1748 // find_instance_method looks up the name/signature in the local methods array
1749 // and skips over static methods
1750 Method* InstanceKlass::find_instance_method(const Symbol* name,
1751 const Symbol* signature,
1752 PrivateLookupMode private_mode) const {
1753 return InstanceKlass::find_instance_method(methods(), name, signature, private_mode);
1754 }
1755
1756 // Find looks up the name/signature in the local methods array
1757 // and filters on the overpass, static and private flags
1758 // This returns the first one found
1759 // note that the local methods array can have up to one overpass, one static
1760 // and one instance (private or not) with the same name/signature
1761 Method* InstanceKlass::find_local_method(const Symbol* name,
1762 const Symbol* signature,
1763 OverpassLookupMode overpass_mode,
1764 StaticLookupMode static_mode,
1765 PrivateLookupMode private_mode) const {
1766 return InstanceKlass::find_method_impl(methods(),
1767 name,
1768 signature,
1769 overpass_mode,
1770 static_mode,
1771 private_mode);
1772 }
1773
1774 // Find looks up the name/signature in the local methods array
1775 // and filters on the overpass, static and private flags
1776 // This returns the first one found
1777 // note that the local methods array can have up to one overpass, one static
1778 // and one instance (private or not) with the same name/signature
1779 Method* InstanceKlass::find_local_method(const Array<Method*>* methods,
1780 const Symbol* name,
1781 const Symbol* signature,
1782 OverpassLookupMode overpass_mode,
1783 StaticLookupMode static_mode,
1784 PrivateLookupMode private_mode) {
1785 return InstanceKlass::find_method_impl(methods,
1786 name,
1787 signature,
1788 overpass_mode,
1789 static_mode,
1790 private_mode);
1791 }
1792
1793 Method* InstanceKlass::find_method(const Array<Method*>* methods,
1794 const Symbol* name,
1795 const Symbol* signature) {
1796 return InstanceKlass::find_method_impl(methods,
1797 name,
1798 signature,
1799 find_overpass,
1800 find_static,
1801 find_private);
1802 }
1803
1804 Method* InstanceKlass::find_method_impl(const Array<Method*>* methods,
1805 const Symbol* name,
1806 const Symbol* signature,
1807 OverpassLookupMode overpass_mode,
1808 StaticLookupMode static_mode,
1809 PrivateLookupMode private_mode) {
1810 int hit = find_method_index(methods, name, signature, overpass_mode, static_mode, private_mode);
1811 return hit >= 0 ? methods->at(hit): NULL;
1812 }
1813
1814 // true if method matches signature and conforms to skipping_X conditions.
1815 static bool method_matches(const Method* m,
1816 const Symbol* signature,
1817 bool skipping_overpass,
1818 bool skipping_static,
1819 bool skipping_private) {
1820 return ((m->signature() == signature) &&
1821 (!skipping_overpass || !m->is_overpass()) &&
1822 (!skipping_static || !m->is_static()) &&
1823 (!skipping_private || !m->is_private()));
1824 }
1825
1826 // Used directly for default_methods to find the index into the
1827 // default_vtable_indices, and indirectly by find_method
1828 // find_method_index looks in the local methods array to return the index
1829 // of the matching name/signature. If, overpass methods are being ignored,
1830 // the search continues to find a potential non-overpass match. This capability
1831 // is important during method resolution to prefer a static method, for example,
1832 // over an overpass method.
1833 // There is the possibility in any _method's array to have the same name/signature
1834 // for a static method, an overpass method and a local instance method
1835 // To correctly catch a given method, the search criteria may need
1836 // to explicitly skip the other two. For local instance methods, it
1837 // is often necessary to skip private methods
1838 int InstanceKlass::find_method_index(const Array<Method*>* methods,
1839 const Symbol* name,
1840 const Symbol* signature,
1841 OverpassLookupMode overpass_mode,
1842 StaticLookupMode static_mode,
1843 PrivateLookupMode private_mode) {
1844 const bool skipping_overpass = (overpass_mode == skip_overpass);
1845 const bool skipping_static = (static_mode == skip_static);
1846 const bool skipping_private = (private_mode == skip_private);
1847 const int hit = binary_search(methods, name);
1848 if (hit != -1) {
1849 const Method* const m = methods->at(hit);
1850
1851 // Do linear search to find matching signature. First, quick check
1852 // for common case, ignoring overpasses if requested.
1853 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) {
1854 return hit;
1855 }
1856
1857 // search downwards through overloaded methods
1858 int i;
1859 for (i = hit - 1; i >= 0; --i) {
1860 const Method* const m = methods->at(i);
1861 assert(m->is_method(), "must be method");
1862 if (m->name() != name) {
1863 break;
1864 }
1865 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) {
1866 return i;
1867 }
1868 }
1869 // search upwards
1870 for (i = hit + 1; i < methods->length(); ++i) {
1871 const Method* const m = methods->at(i);
1872 assert(m->is_method(), "must be method");
1873 if (m->name() != name) {
1874 break;
1875 }
1876 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) {
1877 return i;
1878 }
1879 }
1880 // not found
1881 #ifdef ASSERT
1882 const int index = (skipping_overpass || skipping_static || skipping_private) ? -1 :
1883 linear_search(methods, name, signature);
1884 assert(-1 == index, "binary search should have found entry %d", index);
1885 #endif
1886 }
1887 return -1;
1888 }
1889
1890 int InstanceKlass::find_method_by_name(const Symbol* name, int* end) const {
1891 return find_method_by_name(methods(), name, end);
1892 }
1893
1894 int InstanceKlass::find_method_by_name(const Array<Method*>* methods,
1895 const Symbol* name,
1896 int* end_ptr) {
1897 assert(end_ptr != NULL, "just checking");
1898 int start = binary_search(methods, name);
1899 int end = start + 1;
1900 if (start != -1) {
1901 while (start - 1 >= 0 && (methods->at(start - 1))->name() == name) --start;
1902 while (end < methods->length() && (methods->at(end))->name() == name) ++end;
1903 *end_ptr = end;
1904 return start;
1905 }
1906 return -1;
1907 }
1908
1909 // uncached_lookup_method searches both the local class methods array and all
1910 // superclasses methods arrays, skipping any overpass methods in superclasses,
1911 // and possibly skipping private methods.
1912 Method* InstanceKlass::uncached_lookup_method(const Symbol* name,
1913 const Symbol* signature,
1914 OverpassLookupMode overpass_mode,
1915 PrivateLookupMode private_mode) const {
1916 OverpassLookupMode overpass_local_mode = overpass_mode;
1917 const Klass* klass = this;
1918 while (klass != NULL) {
1919 Method* const method = InstanceKlass::cast(klass)->find_method_impl(name,
1920 signature,
1921 overpass_local_mode,
1922 find_static,
1923 private_mode);
1924 if (method != NULL) {
1925 return method;
1926 }
1927 if (name == vmSymbols::object_initializer_name()) {
1928 break; // <init> is never inherited, not even as a static factory
1929 }
1930 klass = klass->super();
1931 overpass_local_mode = skip_overpass; // Always ignore overpass methods in superclasses
1932 }
1933 return NULL;
1934 }
1935
1936 #ifdef ASSERT
1937 // search through class hierarchy and return true if this class or
1938 // one of the superclasses was redefined
1939 bool InstanceKlass::has_redefined_this_or_super() const {
1940 const Klass* klass = this;
1941 while (klass != NULL) {
1942 if (InstanceKlass::cast(klass)->has_been_redefined()) {
1943 return true;
1944 }
1945 klass = klass->super();
1946 }
1947 return false;
1948 }
1949 #endif
1950
1951 // lookup a method in the default methods list then in all transitive interfaces
1952 // Do NOT return private or static methods
1953 Method* InstanceKlass::lookup_method_in_ordered_interfaces(Symbol* name,
1954 Symbol* signature) const {
1955 Method* m = NULL;
1956 if (default_methods() != NULL) {
1957 m = find_method(default_methods(), name, signature);
1958 }
1959 // Look up interfaces
1960 if (m == NULL) {
1961 m = lookup_method_in_all_interfaces(name, signature, find_defaults);
1962 }
1963 return m;
1964 }
1965
1966 // lookup a method in all the interfaces that this class implements
1967 // Do NOT return private or static methods, new in JDK8 which are not externally visible
1968 // They should only be found in the initial InterfaceMethodRef
1969 Method* InstanceKlass::lookup_method_in_all_interfaces(Symbol* name,
1970 Symbol* signature,
1971 DefaultsLookupMode defaults_mode) const {
1972 Array<InstanceKlass*>* all_ifs = transitive_interfaces();
1973 int num_ifs = all_ifs->length();
1974 InstanceKlass *ik = NULL;
1975 for (int i = 0; i < num_ifs; i++) {
1976 ik = all_ifs->at(i);
1977 Method* m = ik->lookup_method(name, signature);
1978 if (m != NULL && m->is_public() && !m->is_static() &&
1979 ((defaults_mode != skip_defaults) || !m->is_default_method())) {
1980 return m;
1981 }
1982 }
1983 return NULL;
1984 }
1985
1986 /* jni_id_for_impl for jfieldIds only */
1987 JNIid* InstanceKlass::jni_id_for_impl(int offset) {
1988 MutexLocker ml(JfieldIdCreation_lock);
1989 // Retry lookup after we got the lock
1990 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset);
1991 if (probe == NULL) {
1992 // Slow case, allocate new static field identifier
1993 probe = new JNIid(this, offset, jni_ids());
1994 set_jni_ids(probe);
1995 }
1996 return probe;
1997 }
1998
1999
2000 /* jni_id_for for jfieldIds only */
2001 JNIid* InstanceKlass::jni_id_for(int offset) {
2002 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset);
2003 if (probe == NULL) {
2004 probe = jni_id_for_impl(offset);
2005 }
2006 return probe;
2007 }
2008
2009 u2 InstanceKlass::enclosing_method_data(int offset) const {
2010 const Array<jushort>* const inner_class_list = inner_classes();
2011 if (inner_class_list == NULL) {
2012 return 0;
2013 }
2014 const int length = inner_class_list->length();
2015 if (length % inner_class_next_offset == 0) {
2016 return 0;
2017 }
2018 const int index = length - enclosing_method_attribute_size;
2019 assert(offset < enclosing_method_attribute_size, "invalid offset");
2020 return inner_class_list->at(index + offset);
2021 }
2022
2023 void InstanceKlass::set_enclosing_method_indices(u2 class_index,
2024 u2 method_index) {
2025 Array<jushort>* inner_class_list = inner_classes();
2026 assert (inner_class_list != NULL, "_inner_classes list is not set up");
2027 int length = inner_class_list->length();
2028 if (length % inner_class_next_offset == enclosing_method_attribute_size) {
2029 int index = length - enclosing_method_attribute_size;
2030 inner_class_list->at_put(
2031 index + enclosing_method_class_index_offset, class_index);
2032 inner_class_list->at_put(
2033 index + enclosing_method_method_index_offset, method_index);
2034 }
2035 }
2036
2037 // Lookup or create a jmethodID.
2038 // This code is called by the VMThread and JavaThreads so the
2039 // locking has to be done very carefully to avoid deadlocks
2040 // and/or other cache consistency problems.
2041 //
2042 jmethodID InstanceKlass::get_jmethod_id(const methodHandle& method_h) {
2043 size_t idnum = (size_t)method_h->method_idnum();
2044 jmethodID* jmeths = methods_jmethod_ids_acquire();
2045 size_t length = 0;
2046 jmethodID id = NULL;
2047
2048 // We use a double-check locking idiom here because this cache is
2049 // performance sensitive. In the normal system, this cache only
2050 // transitions from NULL to non-NULL which is safe because we use
2051 // release_set_methods_jmethod_ids() to advertise the new cache.
2052 // A partially constructed cache should never be seen by a racing
2053 // thread. We also use release_store() to save a new jmethodID
2054 // in the cache so a partially constructed jmethodID should never be
2055 // seen either. Cache reads of existing jmethodIDs proceed without a
2056 // lock, but cache writes of a new jmethodID requires uniqueness and
2057 // creation of the cache itself requires no leaks so a lock is
2058 // generally acquired in those two cases.
2059 //
2060 // If the RedefineClasses() API has been used, then this cache can
2061 // grow and we'll have transitions from non-NULL to bigger non-NULL.
2062 // Cache creation requires no leaks and we require safety between all
2063 // cache accesses and freeing of the old cache so a lock is generally
2064 // acquired when the RedefineClasses() API has been used.
2065
2066 if (jmeths != NULL) {
2067 // the cache already exists
2068 if (!idnum_can_increment()) {
2069 // the cache can't grow so we can just get the current values
2070 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
2071 } else {
2072 // cache can grow so we have to be more careful
2073 if (Threads::number_of_threads() == 0 ||
2074 SafepointSynchronize::is_at_safepoint()) {
2075 // we're single threaded or at a safepoint - no locking needed
2076 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
2077 } else {
2078 MutexLocker ml(JmethodIdCreation_lock);
2079 get_jmethod_id_length_value(jmeths, idnum, &length, &id);
2080 }
2081 }
2082 }
2083 // implied else:
2084 // we need to allocate a cache so default length and id values are good
2085
2086 if (jmeths == NULL || // no cache yet
2087 length <= idnum || // cache is too short
2088 id == NULL) { // cache doesn't contain entry
2089
2090 // This function can be called by the VMThread so we have to do all
2091 // things that might block on a safepoint before grabbing the lock.
2092 // Otherwise, we can deadlock with the VMThread or have a cache
2093 // consistency issue. These vars keep track of what we might have
2094 // to free after the lock is dropped.
2095 jmethodID to_dealloc_id = NULL;
2096 jmethodID* to_dealloc_jmeths = NULL;
2097
2098 // may not allocate new_jmeths or use it if we allocate it
2099 jmethodID* new_jmeths = NULL;
2100 if (length <= idnum) {
2101 // allocate a new cache that might be used
2102 size_t size = MAX2(idnum+1, (size_t)idnum_allocated_count());
2103 new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1, mtClass);
2104 memset(new_jmeths, 0, (size+1)*sizeof(jmethodID));
2105 // cache size is stored in element[0], other elements offset by one
2106 new_jmeths[0] = (jmethodID)size;
2107 }
2108
2109 // allocate a new jmethodID that might be used
2110 jmethodID new_id = NULL;
2111 if (method_h->is_old() && !method_h->is_obsolete()) {
2112 // The method passed in is old (but not obsolete), we need to use the current version
2113 Method* current_method = method_with_idnum((int)idnum);
2114 assert(current_method != NULL, "old and but not obsolete, so should exist");
2115 new_id = Method::make_jmethod_id(class_loader_data(), current_method);
2116 } else {
2117 // It is the current version of the method or an obsolete method,
2118 // use the version passed in
2119 new_id = Method::make_jmethod_id(class_loader_data(), method_h());
2120 }
2121
2122 if (Threads::number_of_threads() == 0 ||
2123 SafepointSynchronize::is_at_safepoint()) {
2124 // we're single threaded or at a safepoint - no locking needed
2125 id = get_jmethod_id_fetch_or_update(idnum, new_id, new_jmeths,
2126 &to_dealloc_id, &to_dealloc_jmeths);
2127 } else {
2128 MutexLocker ml(JmethodIdCreation_lock);
2129 id = get_jmethod_id_fetch_or_update(idnum, new_id, new_jmeths,
2130 &to_dealloc_id, &to_dealloc_jmeths);
2131 }
2132
2133 // The lock has been dropped so we can free resources.
2134 // Free up either the old cache or the new cache if we allocated one.
2135 if (to_dealloc_jmeths != NULL) {
2136 FreeHeap(to_dealloc_jmeths);
2137 }
2138 // free up the new ID since it wasn't needed
2139 if (to_dealloc_id != NULL) {
2140 Method::destroy_jmethod_id(class_loader_data(), to_dealloc_id);
2141 }
2142 }
2143 return id;
2144 }
2145
2146 // Figure out how many jmethodIDs haven't been allocated, and make
2147 // sure space for them is pre-allocated. This makes getting all
2148 // method ids much, much faster with classes with more than 8
2149 // methods, and has a *substantial* effect on performance with jvmti
2150 // code that loads all jmethodIDs for all classes.
2151 void InstanceKlass::ensure_space_for_methodids(int start_offset) {
2152 int new_jmeths = 0;
2153 int length = methods()->length();
2154 for (int index = start_offset; index < length; index++) {
2155 Method* m = methods()->at(index);
2156 jmethodID id = m->find_jmethod_id_or_null();
2157 if (id == NULL) {
2158 new_jmeths++;
2159 }
2160 }
2161 if (new_jmeths != 0) {
2162 Method::ensure_jmethod_ids(class_loader_data(), new_jmeths);
2163 }
2164 }
2165
2166 // Common code to fetch the jmethodID from the cache or update the
2167 // cache with the new jmethodID. This function should never do anything
2168 // that causes the caller to go to a safepoint or we can deadlock with
2169 // the VMThread or have cache consistency issues.
2170 //
2171 jmethodID InstanceKlass::get_jmethod_id_fetch_or_update(
2172 size_t idnum, jmethodID new_id,
2173 jmethodID* new_jmeths, jmethodID* to_dealloc_id_p,
2174 jmethodID** to_dealloc_jmeths_p) {
2175 assert(new_id != NULL, "sanity check");
2176 assert(to_dealloc_id_p != NULL, "sanity check");
2177 assert(to_dealloc_jmeths_p != NULL, "sanity check");
2178 assert(Threads::number_of_threads() == 0 ||
2179 SafepointSynchronize::is_at_safepoint() ||
2180 JmethodIdCreation_lock->owned_by_self(), "sanity check");
2181
2182 // reacquire the cache - we are locked, single threaded or at a safepoint
2183 jmethodID* jmeths = methods_jmethod_ids_acquire();
2184 jmethodID id = NULL;
2185 size_t length = 0;
2186
2187 if (jmeths == NULL || // no cache yet
2188 (length = (size_t)jmeths[0]) <= idnum) { // cache is too short
2189 if (jmeths != NULL) {
2190 // copy any existing entries from the old cache
2191 for (size_t index = 0; index < length; index++) {
2192 new_jmeths[index+1] = jmeths[index+1];
2193 }
2194 *to_dealloc_jmeths_p = jmeths; // save old cache for later delete
2195 }
2196 release_set_methods_jmethod_ids(jmeths = new_jmeths);
2197 } else {
2198 // fetch jmethodID (if any) from the existing cache
2199 id = jmeths[idnum+1];
2200 *to_dealloc_jmeths_p = new_jmeths; // save new cache for later delete
2201 }
2202 if (id == NULL) {
2203 // No matching jmethodID in the existing cache or we have a new
2204 // cache or we just grew the cache. This cache write is done here
2205 // by the first thread to win the foot race because a jmethodID
2206 // needs to be unique once it is generally available.
2207 id = new_id;
2208
2209 // The jmethodID cache can be read while unlocked so we have to
2210 // make sure the new jmethodID is complete before installing it
2211 // in the cache.
2212 OrderAccess::release_store(&jmeths[idnum+1], id);
2213 } else {
2214 *to_dealloc_id_p = new_id; // save new id for later delete
2215 }
2216 return id;
2217 }
2218
2219
2220 // Common code to get the jmethodID cache length and the jmethodID
2221 // value at index idnum if there is one.
2222 //
2223 void InstanceKlass::get_jmethod_id_length_value(jmethodID* cache,
2224 size_t idnum, size_t *length_p, jmethodID* id_p) {
2225 assert(cache != NULL, "sanity check");
2226 assert(length_p != NULL, "sanity check");
2227 assert(id_p != NULL, "sanity check");
2228
2229 // cache size is stored in element[0], other elements offset by one
2230 *length_p = (size_t)cache[0];
2231 if (*length_p <= idnum) { // cache is too short
2232 *id_p = NULL;
2233 } else {
2234 *id_p = cache[idnum+1]; // fetch jmethodID (if any)
2235 }
2236 }
2237
2238
2239 // Lookup a jmethodID, NULL if not found. Do no blocking, no allocations, no handles
2240 jmethodID InstanceKlass::jmethod_id_or_null(Method* method) {
2241 size_t idnum = (size_t)method->method_idnum();
2242 jmethodID* jmeths = methods_jmethod_ids_acquire();
2243 size_t length; // length assigned as debugging crumb
2244 jmethodID id = NULL;
2245 if (jmeths != NULL && // If there is a cache
2246 (length = (size_t)jmeths[0]) > idnum) { // and if it is long enough,
2247 id = jmeths[idnum+1]; // Look up the id (may be NULL)
2248 }
2249 return id;
2250 }
2251
2252 inline DependencyContext InstanceKlass::dependencies() {
2253 DependencyContext dep_context(&_dep_context, &_dep_context_last_cleaned);
2254 return dep_context;
2255 }
2256
2257 int InstanceKlass::mark_dependent_nmethods(KlassDepChange& changes) {
2258 return dependencies().mark_dependent_nmethods(changes);
2259 }
2260
2261 void InstanceKlass::add_dependent_nmethod(nmethod* nm) {
2262 dependencies().add_dependent_nmethod(nm);
2263 }
2264
2265 void InstanceKlass::remove_dependent_nmethod(nmethod* nm) {
2266 dependencies().remove_dependent_nmethod(nm);
2267 }
2268
2269 void InstanceKlass::clean_dependency_context() {
2270 dependencies().clean_unloading_dependents();
2271 }
2272
2273 #ifndef PRODUCT
2274 void InstanceKlass::print_dependent_nmethods(bool verbose) {
2275 dependencies().print_dependent_nmethods(verbose);
2276 }
2277
2278 bool InstanceKlass::is_dependent_nmethod(nmethod* nm) {
2279 return dependencies().is_dependent_nmethod(nm);
2280 }
2281 #endif //PRODUCT
2282
2283 void InstanceKlass::clean_weak_instanceklass_links() {
2284 clean_implementors_list();
2285 clean_method_data();
2286 }
2287
2288 void InstanceKlass::clean_implementors_list() {
2289 assert(is_loader_alive(), "this klass should be live");
2290 if (is_interface()) {
2291 assert (ClassUnloading, "only called for ClassUnloading");
2292 for (;;) {
2293 // Use load_acquire due to competing with inserts
2294 Klass* impl = OrderAccess::load_acquire(adr_implementor());
2295 if (impl != NULL && !impl->is_loader_alive()) {
2296 // NULL this field, might be an unloaded klass or NULL
2297 Klass* volatile* klass = adr_implementor();
2298 if (Atomic::cmpxchg((Klass*)NULL, klass, impl) == impl) {
2299 // Successfully unlinking implementor.
2300 if (log_is_enabled(Trace, class, unload)) {
2301 ResourceMark rm;
2302 log_trace(class, unload)("unlinking class (implementor): %s", impl->external_name());
2303 }
2304 return;
2305 }
2306 } else {
2307 return;
2308 }
2309 }
2310 }
2311 }
2312
2313 void InstanceKlass::clean_method_data() {
2314 for (int m = 0; m < methods()->length(); m++) {
2315 MethodData* mdo = methods()->at(m)->method_data();
2316 if (mdo != NULL) {
2317 MutexLocker ml(SafepointSynchronize::is_at_safepoint() ? NULL : mdo->extra_data_lock());
2318 mdo->clean_method_data(/*always_clean*/false);
2319 }
2320 }
2321 }
2322
2323 bool InstanceKlass::supers_have_passed_fingerprint_checks() {
2324 if (java_super() != NULL && !java_super()->has_passed_fingerprint_check()) {
2325 ResourceMark rm;
2326 log_trace(class, fingerprint)("%s : super %s not fingerprinted", external_name(), java_super()->external_name());
2327 return false;
2328 }
2329
2330 Array<InstanceKlass*>* local_interfaces = this->local_interfaces();
2331 if (local_interfaces != NULL) {
2332 int length = local_interfaces->length();
2333 for (int i = 0; i < length; i++) {
2334 InstanceKlass* intf = local_interfaces->at(i);
2335 if (!intf->has_passed_fingerprint_check()) {
2336 ResourceMark rm;
2337 log_trace(class, fingerprint)("%s : interface %s not fingerprinted", external_name(), intf->external_name());
2338 return false;
2339 }
2340 }
2341 }
2342
2343 return true;
2344 }
2345
2346 bool InstanceKlass::should_store_fingerprint(bool is_unsafe_anonymous) {
2347 #if INCLUDE_AOT
2348 // We store the fingerprint into the InstanceKlass only in the following 2 cases:
2349 if (CalculateClassFingerprint) {
2350 // (1) We are running AOT to generate a shared library.
2351 return true;
2352 }
2353 if (DumpSharedSpaces || DynamicDumpSharedSpaces) {
2354 // (2) We are running -Xshare:dump or -XX:ArchiveClassesAtExit to create a shared archive
2355 return true;
2356 }
2357 if (UseAOT && is_unsafe_anonymous) {
2358 // (3) We are using AOT code from a shared library and see an unsafe anonymous class
2359 return true;
2360 }
2361 #endif
2362
2363 // In all other cases we might set the _misc_has_passed_fingerprint_check bit,
2364 // but do not store the 64-bit fingerprint to save space.
2365 return false;
2366 }
2367
2368 bool InstanceKlass::has_stored_fingerprint() const {
2369 #if INCLUDE_AOT
2370 return should_store_fingerprint() || is_shared();
2371 #else
2372 return false;
2373 #endif
2374 }
2375
2376 uint64_t InstanceKlass::get_stored_fingerprint() const {
2377 address adr = adr_fingerprint();
2378 if (adr != NULL) {
2379 return (uint64_t)Bytes::get_native_u8(adr); // adr may not be 64-bit aligned
2380 }
2381 return 0;
2382 }
2383
2384 void InstanceKlass::store_fingerprint(uint64_t fingerprint) {
2385 address adr = adr_fingerprint();
2386 if (adr != NULL) {
2387 Bytes::put_native_u8(adr, (u8)fingerprint); // adr may not be 64-bit aligned
2388
2389 ResourceMark rm;
2390 log_trace(class, fingerprint)("stored as " PTR64_FORMAT " for class %s", fingerprint, external_name());
2391 }
2392 }
2393
2394 void InstanceKlass::metaspace_pointers_do(MetaspaceClosure* it) {
2395 Klass::metaspace_pointers_do(it);
2396
2397 if (log_is_enabled(Trace, cds)) {
2398 ResourceMark rm;
2399 log_trace(cds)("Iter(InstanceKlass): %p (%s)", this, external_name());
2400 }
2401
2402 it->push(&_annotations);
2403 it->push((Klass**)&_array_klasses);
2404 it->push(&_constants);
2405 it->push(&_inner_classes);
2406 it->push(&_array_name);
2407 #if INCLUDE_JVMTI
2408 it->push(&_previous_versions);
2409 #endif
2410 it->push(&_methods);
2411 it->push(&_default_methods);
2412 it->push(&_local_interfaces);
2413 it->push(&_transitive_interfaces);
2414 it->push(&_method_ordering);
2415 it->push(&_default_vtable_indices);
2416 it->push(&_fields);
2417
2418 if (itable_length() > 0) {
2419 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable();
2420 int method_table_offset_in_words = ioe->offset()/wordSize;
2421 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words())
2422 / itableOffsetEntry::size();
2423
2424 for (int i = 0; i < nof_interfaces; i ++, ioe ++) {
2425 if (ioe->interface_klass() != NULL) {
2426 it->push(ioe->interface_klass_addr());
2427 itableMethodEntry* ime = ioe->first_method_entry(this);
2428 int n = klassItable::method_count_for_interface(ioe->interface_klass());
2429 for (int index = 0; index < n; index ++) {
2430 it->push(ime[index].method_addr());
2431 }
2432 }
2433 }
2434 }
2435
2436 it->push(&_nest_members);
2437 }
2438
2439 void InstanceKlass::remove_unshareable_info() {
2440 Klass::remove_unshareable_info();
2441
2442 if (is_in_error_state()) {
2443 // Classes are attempted to link during dumping and may fail,
2444 // but these classes are still in the dictionary and class list in CLD.
2445 // Check in_error state first because in_error is > linked state, so
2446 // is_linked() is true.
2447 // If there's a linking error, there is nothing else to remove.
2448 return;
2449 }
2450
2451 // Reset to the 'allocated' state to prevent any premature accessing to
2452 // a shared class at runtime while the class is still being loaded and
2453 // restored. A class' init_state is set to 'loaded' at runtime when it's
2454 // being added to class hierarchy (see SystemDictionary:::add_to_hierarchy()).
2455 _init_state = allocated;
2456
2457 {
2458 MutexLocker ml(Compile_lock);
2459 init_implementor();
2460 }
2461
2462 constants()->remove_unshareable_info();
2463
2464 for (int i = 0; i < methods()->length(); i++) {
2465 Method* m = methods()->at(i);
2466 m->remove_unshareable_info();
2467 }
2468
2469 // do array classes also.
2470 if (array_klasses() != NULL) {
2471 array_klasses()->remove_unshareable_info();
2472 }
2473
2474 // These are not allocated from metaspace. They are safe to set to NULL.
2475 _source_debug_extension = NULL;
2476 _dep_context = NULL;
2477 _osr_nmethods_head = NULL;
2478 #if INCLUDE_JVMTI
2479 _breakpoints = NULL;
2480 _previous_versions = NULL;
2481 _cached_class_file = NULL;
2482 #endif
2483
2484 _init_thread = NULL;
2485 _methods_jmethod_ids = NULL;
2486 _jni_ids = NULL;
2487 _oop_map_cache = NULL;
2488 // clear _nest_host to ensure re-load at runtime
2489 _nest_host = NULL;
2490 }
2491
2492 void InstanceKlass::remove_java_mirror() {
2493 Klass::remove_java_mirror();
2494
2495 // do array classes also.
2496 if (array_klasses() != NULL) {
2497 array_klasses()->remove_java_mirror();
2498 }
2499 }
2500
2501 void InstanceKlass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) {
2502 // SystemDictionary::add_to_hierarchy() sets the init_state to loaded
2503 // before the InstanceKlass is added to the SystemDictionary. Make
2504 // sure the current state is <loaded.
2505 assert(!is_loaded(), "invalid init state");
2506 set_package(loader_data, CHECK);
2507 Klass::restore_unshareable_info(loader_data, protection_domain, CHECK);
2508
2509 Array<Method*>* methods = this->methods();
2510 int num_methods = methods->length();
2511 for (int index = 0; index < num_methods; ++index) {
2512 methods->at(index)->restore_unshareable_info(CHECK);
2513 }
2514 if (JvmtiExport::has_redefined_a_class()) {
2515 // Reinitialize vtable because RedefineClasses may have changed some
2516 // entries in this vtable for super classes so the CDS vtable might
2517 // point to old or obsolete entries. RedefineClasses doesn't fix up
2518 // vtables in the shared system dictionary, only the main one.
2519 // It also redefines the itable too so fix that too.
2520 vtable().initialize_vtable(false, CHECK);
2521 itable().initialize_itable(false, CHECK);
2522 }
2523
2524 // restore constant pool resolved references
2525 constants()->restore_unshareable_info(CHECK);
2526
2527 if (array_klasses() != NULL) {
2528 // Array classes have null protection domain.
2529 // --> see ArrayKlass::complete_create_array_klass()
2530 array_klasses()->restore_unshareable_info(ClassLoaderData::the_null_class_loader_data(), Handle(), CHECK);
2531 }
2532 }
2533
2534 // returns true IFF is_in_error_state() has been changed as a result of this call.
2535 bool InstanceKlass::check_sharing_error_state() {
2536 assert(DumpSharedSpaces, "should only be called during dumping");
2537 bool old_state = is_in_error_state();
2538
2539 if (!is_in_error_state()) {
2540 bool bad = false;
2541 for (InstanceKlass* sup = java_super(); sup; sup = sup->java_super()) {
2542 if (sup->is_in_error_state()) {
2543 bad = true;
2544 break;
2545 }
2546 }
2547 if (!bad) {
2548 Array<InstanceKlass*>* interfaces = transitive_interfaces();
2549 for (int i = 0; i < interfaces->length(); i++) {
2550 InstanceKlass* iface = interfaces->at(i);
2551 if (iface->is_in_error_state()) {
2552 bad = true;
2553 break;
2554 }
2555 }
2556 }
2557
2558 if (bad) {
2559 set_in_error_state();
2560 }
2561 }
2562
2563 return (old_state != is_in_error_state());
2564 }
2565
2566 void InstanceKlass::set_class_loader_type(s2 loader_type) {
2567 switch (loader_type) {
2568 case ClassLoader::BOOT_LOADER:
2569 _misc_flags |= _misc_is_shared_boot_class;
2570 break;
2571 case ClassLoader::PLATFORM_LOADER:
2572 _misc_flags |= _misc_is_shared_platform_class;
2573 break;
2574 case ClassLoader::APP_LOADER:
2575 _misc_flags |= _misc_is_shared_app_class;
2576 break;
2577 default:
2578 ShouldNotReachHere();
2579 break;
2580 }
2581 }
2582
2583 #if INCLUDE_JVMTI
2584 static void clear_all_breakpoints(Method* m) {
2585 m->clear_all_breakpoints();
2586 }
2587 #endif
2588
2589 void InstanceKlass::unload_class(InstanceKlass* ik) {
2590 // Release dependencies.
2591 ik->dependencies().remove_all_dependents();
2592
2593 // notify the debugger
2594 if (JvmtiExport::should_post_class_unload()) {
2595 JvmtiExport::post_class_unload(ik);
2596 }
2597
2598 // notify ClassLoadingService of class unload
2599 ClassLoadingService::notify_class_unloaded(ik);
2600
2601 if (DumpSharedSpaces || DynamicDumpSharedSpaces) {
2602 SystemDictionaryShared::remove_dumptime_info(ik);
2603 }
2604
2605 if (log_is_enabled(Info, class, unload)) {
2606 ResourceMark rm;
2607 log_info(class, unload)("unloading class %s " INTPTR_FORMAT, ik->external_name(), p2i(ik));
2608 }
2609
2610 Events::log_class_unloading(Thread::current(), ik);
2611
2612 #if INCLUDE_JFR
2613 assert(ik != NULL, "invariant");
2614 EventClassUnload event;
2615 event.set_unloadedClass(ik);
2616 event.set_definingClassLoader(ik->class_loader_data());
2617 event.commit();
2618 #endif
2619 }
2620
2621 void InstanceKlass::release_C_heap_structures(InstanceKlass* ik) {
2622 // Clean up C heap
2623 ik->release_C_heap_structures();
2624 ik->constants()->release_C_heap_structures();
2625 }
2626
2627 void InstanceKlass::release_C_heap_structures() {
2628 // Can't release the constant pool here because the constant pool can be
2629 // deallocated separately from the InstanceKlass for default methods and
2630 // redefine classes.
2631
2632 // Deallocate oop map cache
2633 if (_oop_map_cache != NULL) {
2634 delete _oop_map_cache;
2635 _oop_map_cache = NULL;
2636 }
2637
2638 // Deallocate JNI identifiers for jfieldIDs
2639 JNIid::deallocate(jni_ids());
2640 set_jni_ids(NULL);
2641
2642 jmethodID* jmeths = methods_jmethod_ids_acquire();
2643 if (jmeths != (jmethodID*)NULL) {
2644 release_set_methods_jmethod_ids(NULL);
2645 FreeHeap(jmeths);
2646 }
2647
2648 assert(_dep_context == NULL,
2649 "dependencies should already be cleaned");
2650
2651 #if INCLUDE_JVMTI
2652 // Deallocate breakpoint records
2653 if (breakpoints() != 0x0) {
2654 methods_do(clear_all_breakpoints);
2655 assert(breakpoints() == 0x0, "should have cleared breakpoints");
2656 }
2657
2658 // deallocate the cached class file
2659 if (_cached_class_file != NULL) {
2660 os::free(_cached_class_file);
2661 _cached_class_file = NULL;
2662 }
2663 #endif
2664
2665 // Decrement symbol reference counts associated with the unloaded class.
2666 if (_name != NULL) _name->decrement_refcount();
2667 // unreference array name derived from this class name (arrays of an unloaded
2668 // class can't be referenced anymore).
2669 if (_array_name != NULL) _array_name->decrement_refcount();
2670 if (_value_types != NULL) {
2671 for (int i = 0; i < _value_types->length(); i++) {
2672 Symbol* s = _value_types->at(i)._class_name;
2673 if (s != NULL) {
2674 s->decrement_refcount();
2675 }
2676 }
2677 }
2678 if (_source_debug_extension != NULL) FREE_C_HEAP_ARRAY(char, _source_debug_extension);
2679 }
2680
2681 void InstanceKlass::set_source_debug_extension(const char* array, int length) {
2682 if (array == NULL) {
2683 _source_debug_extension = NULL;
2684 } else {
2685 // Adding one to the attribute length in order to store a null terminator
2686 // character could cause an overflow because the attribute length is
2687 // already coded with an u4 in the classfile, but in practice, it's
2688 // unlikely to happen.
2689 assert((length+1) > length, "Overflow checking");
2690 char* sde = NEW_C_HEAP_ARRAY(char, (length + 1), mtClass);
2691 for (int i = 0; i < length; i++) {
2692 sde[i] = array[i];
2693 }
2694 sde[length] = '\0';
2695 _source_debug_extension = sde;
2696 }
2697 }
2698
2699 const char* InstanceKlass::signature_name() const {
2700 return signature_name_of(is_value() ? 'Q' : 'L');
2701 }
2702
2703 const char* InstanceKlass::signature_name_of(char c) const {
2704 int hash_len = 0;
2705 char hash_buf[40];
2706
2707 // If this is an unsafe anonymous class, append a hash to make the name unique
2708 if (is_unsafe_anonymous()) {
2709 intptr_t hash = (java_mirror() != NULL) ? java_mirror()->identity_hash() : 0;
2710 jio_snprintf(hash_buf, sizeof(hash_buf), "/" UINTX_FORMAT, (uintx)hash);
2711 hash_len = (int)strlen(hash_buf);
2712 }
2713
2714 // Get the internal name as a c string
2715 const char* src = (const char*) (name()->as_C_string());
2716 const int src_length = (int)strlen(src);
2717
2718 char* dest = NEW_RESOURCE_ARRAY(char, src_length + hash_len + 3);
2719
2720 // Add L or Q as type indicator
2721 int dest_index = 0;
2722 dest[dest_index++] = c;
2723
2724 // Add the actual class name
2725 for (int src_index = 0; src_index < src_length; ) {
2726 dest[dest_index++] = src[src_index++];
2727 }
2728
2729 // If we have a hash, append it
2730 for (int hash_index = 0; hash_index < hash_len; ) {
2731 dest[dest_index++] = hash_buf[hash_index++];
2732 }
2733
2734 // Add the semicolon and the NULL
2735 dest[dest_index++] = ';';
2736 dest[dest_index] = '\0';
2737 return dest;
2738 }
2739
2740 // Used to obtain the package name from a fully qualified class name.
2741 Symbol* InstanceKlass::package_from_name(const Symbol* name, TRAPS) {
2742 if (name == NULL) {
2743 return NULL;
2744 } else {
2745 if (name->utf8_length() <= 0) {
2746 return NULL;
2747 }
2748 ResourceMark rm;
2749 const char* package_name = ClassLoader::package_from_name((const char*) name->as_C_string());
2750 if (package_name == NULL) {
2751 return NULL;
2752 }
2753 Symbol* pkg_name = SymbolTable::new_symbol(package_name);
2754 return pkg_name;
2755 }
2756 }
2757
2758 ModuleEntry* InstanceKlass::module() const {
2759 // For an unsafe anonymous class return the host class' module
2760 if (is_unsafe_anonymous()) {
2761 assert(unsafe_anonymous_host() != NULL, "unsafe anonymous class must have a host class");
2762 return unsafe_anonymous_host()->module();
2763 }
2764
2765 // Class is in a named package
2766 if (!in_unnamed_package()) {
2767 return _package_entry->module();
2768 }
2769
2770 // Class is in an unnamed package, return its loader's unnamed module
2771 return class_loader_data()->unnamed_module();
2772 }
2773
2774 void InstanceKlass::set_package(ClassLoaderData* loader_data, TRAPS) {
2775
2776 // ensure java/ packages only loaded by boot or platform builtin loaders
2777 check_prohibited_package(name(), loader_data, CHECK);
2778
2779 TempNewSymbol pkg_name = package_from_name(name(), CHECK);
2780
2781 if (pkg_name != NULL && loader_data != NULL) {
2782
2783 // Find in class loader's package entry table.
2784 _package_entry = loader_data->packages()->lookup_only(pkg_name);
2785
2786 // If the package name is not found in the loader's package
2787 // entry table, it is an indication that the package has not
2788 // been defined. Consider it defined within the unnamed module.
2789 if (_package_entry == NULL) {
2790 ResourceMark rm;
2791
2792 if (!ModuleEntryTable::javabase_defined()) {
2793 // Before java.base is defined during bootstrapping, define all packages in
2794 // the java.base module. If a non-java.base package is erroneously placed
2795 // in the java.base module it will be caught later when java.base
2796 // is defined by ModuleEntryTable::verify_javabase_packages check.
2797 assert(ModuleEntryTable::javabase_moduleEntry() != NULL, JAVA_BASE_NAME " module is NULL");
2798 _package_entry = loader_data->packages()->lookup(pkg_name, ModuleEntryTable::javabase_moduleEntry());
2799 } else {
2800 assert(loader_data->unnamed_module() != NULL, "unnamed module is NULL");
2801 _package_entry = loader_data->packages()->lookup(pkg_name,
2802 loader_data->unnamed_module());
2803 }
2804
2805 // A package should have been successfully created
2806 assert(_package_entry != NULL, "Package entry for class %s not found, loader %s",
2807 name()->as_C_string(), loader_data->loader_name_and_id());
2808 }
2809
2810 if (log_is_enabled(Debug, module)) {
2811 ResourceMark rm;
2812 ModuleEntry* m = _package_entry->module();
2813 log_trace(module)("Setting package: class: %s, package: %s, loader: %s, module: %s",
2814 external_name(),
2815 pkg_name->as_C_string(),
2816 loader_data->loader_name_and_id(),
2817 (m->is_named() ? m->name()->as_C_string() : UNNAMED_MODULE));
2818 }
2819 } else {
2820 ResourceMark rm;
2821 log_trace(module)("Setting package: class: %s, package: unnamed, loader: %s, module: %s",
2822 external_name(),
2823 (loader_data != NULL) ? loader_data->loader_name_and_id() : "NULL",
2824 UNNAMED_MODULE);
2825 }
2826 }
2827
2828
2829 // different versions of is_same_class_package
2830
2831 bool InstanceKlass::is_same_class_package(const Klass* class2) const {
2832 oop classloader1 = this->class_loader();
2833 PackageEntry* classpkg1 = this->package();
2834 if (class2->is_objArray_klass()) {
2835 class2 = ObjArrayKlass::cast(class2)->bottom_klass();
2836 }
2837
2838 oop classloader2;
2839 PackageEntry* classpkg2;
2840 if (class2->is_instance_klass()) {
2841 classloader2 = class2->class_loader();
2842 classpkg2 = class2->package();
2843 } else {
2844 assert(class2->is_typeArray_klass(), "should be type array");
2845 classloader2 = NULL;
2846 classpkg2 = NULL;
2847 }
2848
2849 // Same package is determined by comparing class loader
2850 // and package entries. Both must be the same. This rule
2851 // applies even to classes that are defined in the unnamed
2852 // package, they still must have the same class loader.
2853 if (oopDesc::equals(classloader1, classloader2) && (classpkg1 == classpkg2)) {
2854 return true;
2855 }
2856
2857 return false;
2858 }
2859
2860 // return true if this class and other_class are in the same package. Classloader
2861 // and classname information is enough to determine a class's package
2862 bool InstanceKlass::is_same_class_package(oop other_class_loader,
2863 const Symbol* other_class_name) const {
2864 if (!oopDesc::equals(class_loader(), other_class_loader)) {
2865 return false;
2866 }
2867 if (name()->fast_compare(other_class_name) == 0) {
2868 return true;
2869 }
2870
2871 {
2872 ResourceMark rm;
2873
2874 bool bad_class_name = false;
2875 const char* other_pkg =
2876 ClassLoader::package_from_name((const char*) other_class_name->as_C_string(), &bad_class_name);
2877 if (bad_class_name) {
2878 return false;
2879 }
2880 // Check that package_from_name() returns NULL, not "", if there is no package.
2881 assert(other_pkg == NULL || strlen(other_pkg) > 0, "package name is empty string");
2882
2883 const Symbol* const this_package_name =
2884 this->package() != NULL ? this->package()->name() : NULL;
2885
2886 if (this_package_name == NULL || other_pkg == NULL) {
2887 // One of the two doesn't have a package. Only return true if the other
2888 // one also doesn't have a package.
2889 return (const char*)this_package_name == other_pkg;
2890 }
2891
2892 // Check if package is identical
2893 return this_package_name->equals(other_pkg);
2894 }
2895 }
2896
2897 // Returns true iff super_method can be overridden by a method in targetclassname
2898 // See JLS 3rd edition 8.4.6.1
2899 // Assumes name-signature match
2900 // "this" is InstanceKlass of super_method which must exist
2901 // note that the InstanceKlass of the method in the targetclassname has not always been created yet
2902 bool InstanceKlass::is_override(const methodHandle& super_method, Handle targetclassloader, Symbol* targetclassname, TRAPS) {
2903 // Private methods can not be overridden
2904 if (super_method->is_private()) {
2905 return false;
2906 }
2907 // If super method is accessible, then override
2908 if ((super_method->is_protected()) ||
2909 (super_method->is_public())) {
2910 return true;
2911 }
2912 // Package-private methods are not inherited outside of package
2913 assert(super_method->is_package_private(), "must be package private");
2914 return(is_same_class_package(targetclassloader(), targetclassname));
2915 }
2916
2917 // Only boot and platform class loaders can define classes in "java/" packages.
2918 void InstanceKlass::check_prohibited_package(Symbol* class_name,
2919 ClassLoaderData* loader_data,
2920 TRAPS) {
2921 if (!loader_data->is_boot_class_loader_data() &&
2922 !loader_data->is_platform_class_loader_data() &&
2923 class_name != NULL) {
2924 ResourceMark rm(THREAD);
2925 char* name = class_name->as_C_string();
2926 if (strncmp(name, JAVAPKG, JAVAPKG_LEN) == 0 && name[JAVAPKG_LEN] == '/') {
2927 TempNewSymbol pkg_name = InstanceKlass::package_from_name(class_name, CHECK);
2928 assert(pkg_name != NULL, "Error in parsing package name starting with 'java/'");
2929 name = pkg_name->as_C_string();
2930 const char* class_loader_name = loader_data->loader_name_and_id();
2931 StringUtils::replace_no_expand(name, "/", ".");
2932 const char* msg_text1 = "Class loader (instance of): ";
2933 const char* msg_text2 = " tried to load prohibited package name: ";
2934 size_t len = strlen(msg_text1) + strlen(class_loader_name) + strlen(msg_text2) + strlen(name) + 1;
2935 char* message = NEW_RESOURCE_ARRAY_IN_THREAD(THREAD, char, len);
2936 jio_snprintf(message, len, "%s%s%s%s", msg_text1, class_loader_name, msg_text2, name);
2937 THROW_MSG(vmSymbols::java_lang_SecurityException(), message);
2938 }
2939 }
2940 return;
2941 }
2942
2943 bool InstanceKlass::find_inner_classes_attr(int* ooff, int* noff, TRAPS) const {
2944 constantPoolHandle i_cp(THREAD, constants());
2945 for (InnerClassesIterator iter(this); !iter.done(); iter.next()) {
2946 int ioff = iter.inner_class_info_index();
2947 if (ioff != 0) {
2948 // Check to see if the name matches the class we're looking for
2949 // before attempting to find the class.
2950 if (i_cp->klass_name_at_matches(this, ioff)) {
2951 Klass* inner_klass = i_cp->klass_at(ioff, CHECK_false);
2952 if (this == inner_klass) {
2953 *ooff = iter.outer_class_info_index();
2954 *noff = iter.inner_name_index();
2955 return true;
2956 }
2957 }
2958 }
2959 }
2960 return false;
2961 }
2962
2963 InstanceKlass* InstanceKlass::compute_enclosing_class(bool* inner_is_member, TRAPS) const {
2964 InstanceKlass* outer_klass = NULL;
2965 *inner_is_member = false;
2966 int ooff = 0, noff = 0;
2967 bool has_inner_classes_attr = find_inner_classes_attr(&ooff, &noff, THREAD);
2968 if (has_inner_classes_attr) {
2969 constantPoolHandle i_cp(THREAD, constants());
2970 if (ooff != 0) {
2971 Klass* ok = i_cp->klass_at(ooff, CHECK_NULL);
2972 outer_klass = InstanceKlass::cast(ok);
2973 *inner_is_member = true;
2974 }
2975 if (NULL == outer_klass) {
2976 // It may be unsafe anonymous; try for that.
2977 int encl_method_class_idx = enclosing_method_class_index();
2978 if (encl_method_class_idx != 0) {
2979 Klass* ok = i_cp->klass_at(encl_method_class_idx, CHECK_NULL);
2980 outer_klass = InstanceKlass::cast(ok);
2981 *inner_is_member = false;
2982 }
2983 }
2984 }
2985
2986 // If no inner class attribute found for this class.
2987 if (NULL == outer_klass) return NULL;
2988
2989 // Throws an exception if outer klass has not declared k as an inner klass
2990 // We need evidence that each klass knows about the other, or else
2991 // the system could allow a spoof of an inner class to gain access rights.
2992 Reflection::check_for_inner_class(outer_klass, this, *inner_is_member, CHECK_NULL);
2993 return outer_klass;
2994 }
2995
2996 jint InstanceKlass::compute_modifier_flags(TRAPS) const {
2997 jint access = access_flags().as_int();
2998
2999 // But check if it happens to be member class.
3000 InnerClassesIterator iter(this);
3001 for (; !iter.done(); iter.next()) {
3002 int ioff = iter.inner_class_info_index();
3003 // Inner class attribute can be zero, skip it.
3004 // Strange but true: JVM spec. allows null inner class refs.
3005 if (ioff == 0) continue;
3006
3007 // only look at classes that are already loaded
3008 // since we are looking for the flags for our self.
3009 Symbol* inner_name = constants()->klass_name_at(ioff);
3010 if (name() == inner_name) {
3011 // This is really a member class.
3012 access = iter.inner_access_flags();
3013 break;
3014 }
3015 }
3016 // Remember to strip ACC_SUPER bit
3017 return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS;
3018 }
3019
3020 jint InstanceKlass::jvmti_class_status() const {
3021 jint result = 0;
3022
3023 if (is_linked()) {
3024 result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED;
3025 }
3026
3027 if (is_initialized()) {
3028 assert(is_linked(), "Class status is not consistent");
3029 result |= JVMTI_CLASS_STATUS_INITIALIZED;
3030 }
3031 if (is_in_error_state()) {
3032 result |= JVMTI_CLASS_STATUS_ERROR;
3033 }
3034 return result;
3035 }
3036
3037 Method* InstanceKlass::method_at_itable(Klass* holder, int index, TRAPS) {
3038 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable();
3039 int method_table_offset_in_words = ioe->offset()/wordSize;
3040 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words())
3041 / itableOffsetEntry::size();
3042
3043 for (int cnt = 0 ; ; cnt ++, ioe ++) {
3044 // If the interface isn't implemented by the receiver class,
3045 // the VM should throw IncompatibleClassChangeError.
3046 if (cnt >= nof_interfaces) {
3047 ResourceMark rm(THREAD);
3048 stringStream ss;
3049 bool same_module = (module() == holder->module());
3050 ss.print("Receiver class %s does not implement "
3051 "the interface %s defining the method to be called "
3052 "(%s%s%s)",
3053 external_name(), holder->external_name(),
3054 (same_module) ? joint_in_module_of_loader(holder) : class_in_module_of_loader(),
3055 (same_module) ? "" : "; ",
3056 (same_module) ? "" : holder->class_in_module_of_loader());
3057 THROW_MSG_NULL(vmSymbols::java_lang_IncompatibleClassChangeError(), ss.as_string());
3058 }
3059
3060 Klass* ik = ioe->interface_klass();
3061 if (ik == holder) break;
3062 }
3063
3064 itableMethodEntry* ime = ioe->first_method_entry(this);
3065 Method* m = ime[index].method();
3066 if (m == NULL) {
3067 THROW_NULL(vmSymbols::java_lang_AbstractMethodError());
3068 }
3069 return m;
3070 }
3071
3072
3073 #if INCLUDE_JVMTI
3074 // update default_methods for redefineclasses for methods that are
3075 // not yet in the vtable due to concurrent subclass define and superinterface
3076 // redefinition
3077 // Note: those in the vtable, should have been updated via adjust_method_entries
3078 void InstanceKlass::adjust_default_methods(bool* trace_name_printed) {
3079 // search the default_methods for uses of either obsolete or EMCP methods
3080 if (default_methods() != NULL) {
3081 for (int index = 0; index < default_methods()->length(); index ++) {
3082 Method* old_method = default_methods()->at(index);
3083 if (old_method == NULL || !old_method->is_old()) {
3084 continue; // skip uninteresting entries
3085 }
3086 assert(!old_method->is_deleted(), "default methods may not be deleted");
3087 Method* new_method = old_method->get_new_method();
3088 default_methods()->at_put(index, new_method);
3089
3090 if (log_is_enabled(Info, redefine, class, update)) {
3091 ResourceMark rm;
3092 if (!(*trace_name_printed)) {
3093 log_info(redefine, class, update)
3094 ("adjust: klassname=%s default methods from name=%s",
3095 external_name(), old_method->method_holder()->external_name());
3096 *trace_name_printed = true;
3097 }
3098 log_debug(redefine, class, update, vtables)
3099 ("default method update: %s(%s) ",
3100 new_method->name()->as_C_string(), new_method->signature()->as_C_string());
3101 }
3102 }
3103 }
3104 }
3105 #endif // INCLUDE_JVMTI
3106
3107 // On-stack replacement stuff
3108 void InstanceKlass::add_osr_nmethod(nmethod* n) {
3109 #ifndef PRODUCT
3110 if (TieredCompilation) {
3111 nmethod * prev = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), n->comp_level(), true);
3112 assert(prev == NULL || !prev->is_in_use(),
3113 "redundunt OSR recompilation detected. memory leak in CodeCache!");
3114 }
3115 #endif
3116 // only one compilation can be active
3117 {
3118 // This is a short non-blocking critical region, so the no safepoint check is ok.
3119 MutexLocker ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
3120 assert(n->is_osr_method(), "wrong kind of nmethod");
3121 n->set_osr_link(osr_nmethods_head());
3122 set_osr_nmethods_head(n);
3123 // Raise the highest osr level if necessary
3124 if (TieredCompilation) {
3125 Method* m = n->method();
3126 m->set_highest_osr_comp_level(MAX2(m->highest_osr_comp_level(), n->comp_level()));
3127 }
3128 }
3129
3130 // Get rid of the osr methods for the same bci that have lower levels.
3131 if (TieredCompilation) {
3132 for (int l = CompLevel_limited_profile; l < n->comp_level(); l++) {
3133 nmethod *inv = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), l, true);
3134 if (inv != NULL && inv->is_in_use()) {
3135 inv->make_not_entrant();
3136 }
3137 }
3138 }
3139 }
3140
3141 // Remove osr nmethod from the list. Return true if found and removed.
3142 bool InstanceKlass::remove_osr_nmethod(nmethod* n) {
3143 // This is a short non-blocking critical region, so the no safepoint check is ok.
3144 MutexLocker ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
3145 assert(n->is_osr_method(), "wrong kind of nmethod");
3146 nmethod* last = NULL;
3147 nmethod* cur = osr_nmethods_head();
3148 int max_level = CompLevel_none; // Find the max comp level excluding n
3149 Method* m = n->method();
3150 // Search for match
3151 bool found = false;
3152 while(cur != NULL && cur != n) {
3153 if (TieredCompilation && m == cur->method()) {
3154 // Find max level before n
3155 max_level = MAX2(max_level, cur->comp_level());
3156 }
3157 last = cur;
3158 cur = cur->osr_link();
3159 }
3160 nmethod* next = NULL;
3161 if (cur == n) {
3162 found = true;
3163 next = cur->osr_link();
3164 if (last == NULL) {
3165 // Remove first element
3166 set_osr_nmethods_head(next);
3167 } else {
3168 last->set_osr_link(next);
3169 }
3170 }
3171 n->set_osr_link(NULL);
3172 if (TieredCompilation) {
3173 cur = next;
3174 while (cur != NULL) {
3175 // Find max level after n
3176 if (m == cur->method()) {
3177 max_level = MAX2(max_level, cur->comp_level());
3178 }
3179 cur = cur->osr_link();
3180 }
3181 m->set_highest_osr_comp_level(max_level);
3182 }
3183 return found;
3184 }
3185
3186 int InstanceKlass::mark_osr_nmethods(const Method* m) {
3187 // This is a short non-blocking critical region, so the no safepoint check is ok.
3188 MutexLocker ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
3189 nmethod* osr = osr_nmethods_head();
3190 int found = 0;
3191 while (osr != NULL) {
3192 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
3193 if (osr->method() == m) {
3194 osr->mark_for_deoptimization();
3195 found++;
3196 }
3197 osr = osr->osr_link();
3198 }
3199 return found;
3200 }
3201
3202 nmethod* InstanceKlass::lookup_osr_nmethod(const Method* m, int bci, int comp_level, bool match_level) const {
3203 // This is a short non-blocking critical region, so the no safepoint check is ok.
3204 MutexLocker ml(OsrList_lock, Mutex::_no_safepoint_check_flag);
3205 nmethod* osr = osr_nmethods_head();
3206 nmethod* best = NULL;
3207 while (osr != NULL) {
3208 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain");
3209 // There can be a time when a c1 osr method exists but we are waiting
3210 // for a c2 version. When c2 completes its osr nmethod we will trash
3211 // the c1 version and only be able to find the c2 version. However
3212 // while we overflow in the c1 code at back branches we don't want to
3213 // try and switch to the same code as we are already running
3214
3215 if (osr->method() == m &&
3216 (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) {
3217 if (match_level) {
3218 if (osr->comp_level() == comp_level) {
3219 // Found a match - return it.
3220 return osr;
3221 }
3222 } else {
3223 if (best == NULL || (osr->comp_level() > best->comp_level())) {
3224 if (osr->comp_level() == CompLevel_highest_tier) {
3225 // Found the best possible - return it.
3226 return osr;
3227 }
3228 best = osr;
3229 }
3230 }
3231 }
3232 osr = osr->osr_link();
3233 }
3234
3235 assert(match_level == false || best == NULL, "shouldn't pick up anything if match_level is set");
3236 if (best != NULL && best->comp_level() >= comp_level) {
3237 return best;
3238 }
3239 return NULL;
3240 }
3241
3242 // -----------------------------------------------------------------------------------------------------
3243 // Printing
3244
3245 #ifndef PRODUCT
3246
3247 #define BULLET " - "
3248
3249 static const char* state_names[] = {
3250 "allocated", "loaded", "linked", "being_initialized", "fully_initialized", "initialization_error"
3251 };
3252
3253 static void print_vtable(address self, intptr_t* start, int len, outputStream* st) {
3254 ResourceMark rm;
3255 int* forward_refs = NEW_RESOURCE_ARRAY(int, len);
3256 for (int i = 0; i < len; i++) forward_refs[i] = 0;
3257 for (int i = 0; i < len; i++) {
3258 intptr_t e = start[i];
3259 st->print("%d : " INTPTR_FORMAT, i, e);
3260 if (forward_refs[i] != 0) {
3261 int from = forward_refs[i];
3262 int off = (int) start[from];
3263 st->print(" (offset %d <= [%d])", off, from);
3264 }
3265 if (MetaspaceObj::is_valid((Metadata*)e)) {
3266 st->print(" ");
3267 ((Metadata*)e)->print_value_on(st);
3268 } else if (self != NULL && e > 0 && e < 0x10000) {
3269 address location = self + e;
3270 int index = (int)((intptr_t*)location - start);
3271 st->print(" (offset %d => [%d])", (int)e, index);
3272 if (index >= 0 && index < len)
3273 forward_refs[index] = i;
3274 }
3275 st->cr();
3276 }
3277 }
3278
3279 static void print_vtable(vtableEntry* start, int len, outputStream* st) {
3280 return print_vtable(NULL, reinterpret_cast<intptr_t*>(start), len, st);
3281 }
3282
3283 template<typename T>
3284 static void print_array_on(outputStream* st, Array<T>* array) {
3285 if (array == NULL) { st->print_cr("NULL"); return; }
3286 array->print_value_on(st); st->cr();
3287 if (Verbose || WizardMode) {
3288 for (int i = 0; i < array->length(); i++) {
3289 st->print("%d : ", i); array->at(i)->print_value_on(st); st->cr();
3290 }
3291 }
3292 }
3293
3294 static void print_array_on(outputStream* st, Array<int>* array) {
3295 if (array == NULL) { st->print_cr("NULL"); return; }
3296 array->print_value_on(st); st->cr();
3297 if (Verbose || WizardMode) {
3298 for (int i = 0; i < array->length(); i++) {
3299 st->print("%d : %d", i, array->at(i)); st->cr();
3300 }
3301 }
3302 }
3303
3304 void InstanceKlass::print_on(outputStream* st) const {
3305 assert(is_klass(), "must be klass");
3306 Klass::print_on(st);
3307
3308 st->print(BULLET"instance size: %d", size_helper()); st->cr();
3309 st->print(BULLET"klass size: %d", size()); st->cr();
3310 st->print(BULLET"access: "); access_flags().print_on(st); st->cr();
3311 st->print(BULLET"misc flags: 0x%x", _misc_flags); st->cr();
3312 st->print(BULLET"state: "); st->print_cr("%s", state_names[_init_state]);
3313 st->print(BULLET"name: "); name()->print_value_on(st); st->cr();
3314 st->print(BULLET"super: "); Metadata::print_value_on_maybe_null(st, super()); st->cr();
3315 st->print(BULLET"sub: ");
3316 Klass* sub = subklass();
3317 int n;
3318 for (n = 0; sub != NULL; n++, sub = sub->next_sibling()) {
3319 if (n < MaxSubklassPrintSize) {
3320 sub->print_value_on(st);
3321 st->print(" ");
3322 }
3323 }
3324 if (n >= MaxSubklassPrintSize) st->print("(" INTX_FORMAT " more klasses...)", n - MaxSubklassPrintSize);
3325 st->cr();
3326
3327 if (is_interface()) {
3328 st->print_cr(BULLET"nof implementors: %d", nof_implementors());
3329 if (nof_implementors() == 1) {
3330 st->print_cr(BULLET"implementor: ");
3331 st->print(" ");
3332 implementor()->print_value_on(st);
3333 st->cr();
3334 }
3335 }
3336
3337 st->print(BULLET"arrays: "); Metadata::print_value_on_maybe_null(st, array_klasses()); st->cr();
3338 st->print(BULLET"methods: "); print_array_on(st, methods());
3339 st->print(BULLET"method ordering: "); print_array_on(st, method_ordering());
3340 st->print(BULLET"default_methods: "); print_array_on(st, default_methods());
3341 if (default_vtable_indices() != NULL) {
3342 st->print(BULLET"default vtable indices: "); print_array_on(st, default_vtable_indices());
3343 }
3344 st->print(BULLET"local interfaces: "); print_array_on(st, local_interfaces());
3345 st->print(BULLET"trans. interfaces: "); print_array_on(st, transitive_interfaces());
3346 st->print(BULLET"constants: "); constants()->print_value_on(st); st->cr();
3347 if (class_loader_data() != NULL) {
3348 st->print(BULLET"class loader data: ");
3349 class_loader_data()->print_value_on(st);
3350 st->cr();
3351 }
3352 st->print(BULLET"unsafe anonymous host class: "); Metadata::print_value_on_maybe_null(st, unsafe_anonymous_host()); st->cr();
3353 if (source_file_name() != NULL) {
3354 st->print(BULLET"source file: ");
3355 source_file_name()->print_value_on(st);
3356 st->cr();
3357 }
3358 if (source_debug_extension() != NULL) {
3359 st->print(BULLET"source debug extension: ");
3360 st->print("%s", source_debug_extension());
3361 st->cr();
3362 }
3363 st->print(BULLET"class annotations: "); class_annotations()->print_value_on(st); st->cr();
3364 st->print(BULLET"class type annotations: "); class_type_annotations()->print_value_on(st); st->cr();
3365 st->print(BULLET"field annotations: "); fields_annotations()->print_value_on(st); st->cr();
3366 st->print(BULLET"field type annotations: "); fields_type_annotations()->print_value_on(st); st->cr();
3367 {
3368 bool have_pv = false;
3369 // previous versions are linked together through the InstanceKlass
3370 for (InstanceKlass* pv_node = previous_versions();
3371 pv_node != NULL;
3372 pv_node = pv_node->previous_versions()) {
3373 if (!have_pv)
3374 st->print(BULLET"previous version: ");
3375 have_pv = true;
3376 pv_node->constants()->print_value_on(st);
3377 }
3378 if (have_pv) st->cr();
3379 }
3380
3381 if (generic_signature() != NULL) {
3382 st->print(BULLET"generic signature: ");
3383 generic_signature()->print_value_on(st);
3384 st->cr();
3385 }
3386 st->print(BULLET"inner classes: "); inner_classes()->print_value_on(st); st->cr();
3387 st->print(BULLET"nest members: "); nest_members()->print_value_on(st); st->cr();
3388 if (java_mirror() != NULL) {
3389 st->print(BULLET"java mirror: ");
3390 java_mirror()->print_value_on(st);
3391 st->cr();
3392 } else {
3393 st->print_cr(BULLET"java mirror: NULL");
3394 }
3395 st->print(BULLET"vtable length %d (start addr: " INTPTR_FORMAT ")", vtable_length(), p2i(start_of_vtable())); st->cr();
3396 if (vtable_length() > 0 && (Verbose || WizardMode)) print_vtable(start_of_vtable(), vtable_length(), st);
3397 st->print(BULLET"itable length %d (start addr: " INTPTR_FORMAT ")", itable_length(), p2i(start_of_itable())); st->cr();
3398 if (itable_length() > 0 && (Verbose || WizardMode)) print_vtable(NULL, start_of_itable(), itable_length(), st);
3399 st->print_cr(BULLET"---- static fields (%d words):", static_field_size());
3400 FieldPrinter print_static_field(st);
3401 ((InstanceKlass*)this)->do_local_static_fields(&print_static_field);
3402 st->print_cr(BULLET"---- non-static fields (%d words):", nonstatic_field_size());
3403 FieldPrinter print_nonstatic_field(st);
3404 InstanceKlass* ik = const_cast<InstanceKlass*>(this);
3405 ik->do_nonstatic_fields(&print_nonstatic_field);
3406
3407 st->print(BULLET"non-static oop maps: ");
3408 OopMapBlock* map = start_of_nonstatic_oop_maps();
3409 OopMapBlock* end_map = map + nonstatic_oop_map_count();
3410 while (map < end_map) {
3411 st->print("%d-%d ", map->offset(), map->offset() + heapOopSize*(map->count() - 1));
3412 map++;
3413 }
3414 st->cr();
3415 }
3416
3417 #endif //PRODUCT
3418
3419 void InstanceKlass::print_value_on(outputStream* st) const {
3420 assert(is_klass(), "must be klass");
3421 if (Verbose || WizardMode) access_flags().print_on(st);
3422 name()->print_value_on(st);
3423 }
3424
3425 #ifndef PRODUCT
3426
3427 void FieldPrinter::do_field(fieldDescriptor* fd) {
3428 _st->print(BULLET);
3429 if (_obj == NULL) {
3430 fd->print_on(_st);
3431 _st->cr();
3432 } else {
3433 fd->print_on_for(_st, _obj);
3434 _st->cr();
3435 }
3436 }
3437
3438
3439 void InstanceKlass::oop_print_on(oop obj, outputStream* st) {
3440 Klass::oop_print_on(obj, st);
3441
3442 if (this == SystemDictionary::String_klass()) {
3443 typeArrayOop value = java_lang_String::value(obj);
3444 juint length = java_lang_String::length(obj);
3445 if (value != NULL &&
3446 value->is_typeArray() &&
3447 length <= (juint) value->length()) {
3448 st->print(BULLET"string: ");
3449 java_lang_String::print(obj, st);
3450 st->cr();
3451 if (!WizardMode) return; // that is enough
3452 }
3453 }
3454
3455 st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj));
3456 FieldPrinter print_field(st, obj);
3457 do_nonstatic_fields(&print_field);
3458
3459 if (this == SystemDictionary::Class_klass()) {
3460 st->print(BULLET"signature: ");
3461 java_lang_Class::print_signature(obj, st);
3462 st->cr();
3463 Klass* mirrored_klass = java_lang_Class::as_Klass(obj);
3464 st->print(BULLET"fake entry for mirror: ");
3465 Metadata::print_value_on_maybe_null(st, mirrored_klass);
3466 st->cr();
3467 Klass* array_klass = java_lang_Class::array_klass_acquire(obj);
3468 st->print(BULLET"fake entry for array: ");
3469 Metadata::print_value_on_maybe_null(st, array_klass);
3470 st->cr();
3471 st->print_cr(BULLET"fake entry for oop_size: %d", java_lang_Class::oop_size(obj));
3472 st->print_cr(BULLET"fake entry for static_oop_field_count: %d", java_lang_Class::static_oop_field_count(obj));
3473 Klass* real_klass = java_lang_Class::as_Klass(obj);
3474 if (real_klass != NULL && real_klass->is_instance_klass()) {
3475 InstanceKlass::cast(real_klass)->do_local_static_fields(&print_field);
3476 }
3477 } else if (this == SystemDictionary::MethodType_klass()) {
3478 st->print(BULLET"signature: ");
3479 java_lang_invoke_MethodType::print_signature(obj, st);
3480 st->cr();
3481 }
3482 }
3483
3484 bool InstanceKlass::verify_itable_index(int i) {
3485 int method_count = klassItable::method_count_for_interface(this);
3486 assert(i >= 0 && i < method_count, "index out of bounds");
3487 return true;
3488 }
3489
3490 #endif //PRODUCT
3491
3492 void InstanceKlass::oop_print_value_on(oop obj, outputStream* st) {
3493 st->print("a ");
3494 name()->print_value_on(st);
3495 obj->print_address_on(st);
3496 if (this == SystemDictionary::String_klass()
3497 && java_lang_String::value(obj) != NULL) {
3498 ResourceMark rm;
3499 int len = java_lang_String::length(obj);
3500 int plen = (len < 24 ? len : 12);
3501 char* str = java_lang_String::as_utf8_string(obj, 0, plen);
3502 st->print(" = \"%s\"", str);
3503 if (len > plen)
3504 st->print("...[%d]", len);
3505 } else if (this == SystemDictionary::Class_klass()) {
3506 Klass* k = java_lang_Class::as_Klass(obj);
3507 st->print(" = ");
3508 if (k != NULL) {
3509 k->print_value_on(st);
3510 } else {
3511 const char* tname = type2name(java_lang_Class::primitive_type(obj));
3512 st->print("%s", tname ? tname : "type?");
3513 }
3514 } else if (this == SystemDictionary::MethodType_klass()) {
3515 st->print(" = ");
3516 java_lang_invoke_MethodType::print_signature(obj, st);
3517 } else if (java_lang_boxing_object::is_instance(obj)) {
3518 st->print(" = ");
3519 java_lang_boxing_object::print(obj, st);
3520 } else if (this == SystemDictionary::LambdaForm_klass()) {
3521 oop vmentry = java_lang_invoke_LambdaForm::vmentry(obj);
3522 if (vmentry != NULL) {
3523 st->print(" => ");
3524 vmentry->print_value_on(st);
3525 }
3526 } else if (this == SystemDictionary::MemberName_klass()) {
3527 Metadata* vmtarget = java_lang_invoke_MemberName::vmtarget(obj);
3528 if (vmtarget != NULL) {
3529 st->print(" = ");
3530 vmtarget->print_value_on(st);
3531 } else {
3532 java_lang_invoke_MemberName::clazz(obj)->print_value_on(st);
3533 st->print(".");
3534 java_lang_invoke_MemberName::name(obj)->print_value_on(st);
3535 }
3536 }
3537 }
3538
3539 const char* InstanceKlass::internal_name() const {
3540 return external_name();
3541 }
3542
3543 void InstanceKlass::print_class_load_logging(ClassLoaderData* loader_data,
3544 const char* module_name,
3545 const ClassFileStream* cfs) const {
3546 if (!log_is_enabled(Info, class, load)) {
3547 return;
3548 }
3549
3550 ResourceMark rm;
3551 LogMessage(class, load) msg;
3552 stringStream info_stream;
3553
3554 // Name and class hierarchy info
3555 info_stream.print("%s", external_name());
3556
3557 // Source
3558 if (cfs != NULL) {
3559 if (cfs->source() != NULL) {
3560 if (module_name != NULL) {
3561 // When the boot loader created the stream, it didn't know the module name
3562 // yet. Let's format it now.
3563 if (cfs->from_boot_loader_modules_image()) {
3564 info_stream.print(" source: jrt:/%s", module_name);
3565 } else {
3566 info_stream.print(" source: %s", cfs->source());
3567 }
3568 } else {
3569 info_stream.print(" source: %s", cfs->source());
3570 }
3571 } else if (loader_data == ClassLoaderData::the_null_class_loader_data()) {
3572 Thread* THREAD = Thread::current();
3573 Klass* caller =
3574 THREAD->is_Java_thread()
3575 ? ((JavaThread*)THREAD)->security_get_caller_class(1)
3576 : NULL;
3577 // caller can be NULL, for example, during a JVMTI VM_Init hook
3578 if (caller != NULL) {
3579 info_stream.print(" source: instance of %s", caller->external_name());
3580 } else {
3581 // source is unknown
3582 }
3583 } else {
3584 oop class_loader = loader_data->class_loader();
3585 info_stream.print(" source: %s", class_loader->klass()->external_name());
3586 }
3587 } else {
3588 assert(this->is_shared(), "must be");
3589 if (MetaspaceShared::is_shared_dynamic((void*)this)) {
3590 info_stream.print(" source: shared objects file (top)");
3591 } else {
3592 info_stream.print(" source: shared objects file");
3593 }
3594 }
3595
3596 msg.info("%s", info_stream.as_string());
3597
3598 if (log_is_enabled(Debug, class, load)) {
3599 stringStream debug_stream;
3600
3601 // Class hierarchy info
3602 debug_stream.print(" klass: " INTPTR_FORMAT " super: " INTPTR_FORMAT,
3603 p2i(this), p2i(superklass()));
3604
3605 // Interfaces
3606 if (local_interfaces() != NULL && local_interfaces()->length() > 0) {
3607 debug_stream.print(" interfaces:");
3608 int length = local_interfaces()->length();
3609 for (int i = 0; i < length; i++) {
3610 debug_stream.print(" " INTPTR_FORMAT,
3611 p2i(InstanceKlass::cast(local_interfaces()->at(i))));
3612 }
3613 }
3614
3615 // Class loader
3616 debug_stream.print(" loader: [");
3617 loader_data->print_value_on(&debug_stream);
3618 debug_stream.print("]");
3619
3620 // Classfile checksum
3621 if (cfs) {
3622 debug_stream.print(" bytes: %d checksum: %08x",
3623 cfs->length(),
3624 ClassLoader::crc32(0, (const char*)cfs->buffer(),
3625 cfs->length()));
3626 }
3627
3628 msg.debug("%s", debug_stream.as_string());
3629 }
3630 }
3631
3632 #if INCLUDE_SERVICES
3633 // Size Statistics
3634 void InstanceKlass::collect_statistics(KlassSizeStats *sz) const {
3635 Klass::collect_statistics(sz);
3636
3637 sz->_inst_size = wordSize * size_helper();
3638 sz->_vtab_bytes = wordSize * vtable_length();
3639 sz->_itab_bytes = wordSize * itable_length();
3640 sz->_nonstatic_oopmap_bytes = wordSize * nonstatic_oop_map_size();
3641
3642 int n = 0;
3643 n += (sz->_methods_array_bytes = sz->count_array(methods()));
3644 n += (sz->_method_ordering_bytes = sz->count_array(method_ordering()));
3645 n += (sz->_local_interfaces_bytes = sz->count_array(local_interfaces()));
3646 n += (sz->_transitive_interfaces_bytes = sz->count_array(transitive_interfaces()));
3647 n += (sz->_fields_bytes = sz->count_array(fields()));
3648 n += (sz->_inner_classes_bytes = sz->count_array(inner_classes()));
3649 n += (sz->_nest_members_bytes = sz->count_array(nest_members()));
3650 sz->_ro_bytes += n;
3651
3652 const ConstantPool* cp = constants();
3653 if (cp) {
3654 cp->collect_statistics(sz);
3655 }
3656
3657 const Annotations* anno = annotations();
3658 if (anno) {
3659 anno->collect_statistics(sz);
3660 }
3661
3662 const Array<Method*>* methods_array = methods();
3663 if (methods()) {
3664 for (int i = 0; i < methods_array->length(); i++) {
3665 Method* method = methods_array->at(i);
3666 if (method) {
3667 sz->_method_count ++;
3668 method->collect_statistics(sz);
3669 }
3670 }
3671 }
3672 }
3673 #endif // INCLUDE_SERVICES
3674
3675 // Verification
3676
3677 class VerifyFieldClosure: public BasicOopIterateClosure {
3678 protected:
3679 template <class T> void do_oop_work(T* p) {
3680 oop obj = RawAccess<>::oop_load(p);
3681 if (!oopDesc::is_oop_or_null(obj)) {
3682 tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p2i(p), p2i(obj));
3683 Universe::print_on(tty);
3684 guarantee(false, "boom");
3685 }
3686 }
3687 public:
3688 virtual void do_oop(oop* p) { VerifyFieldClosure::do_oop_work(p); }
3689 virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); }
3690 };
3691
3692 void InstanceKlass::verify_on(outputStream* st) {
3693 #ifndef PRODUCT
3694 // Avoid redundant verifies, this really should be in product.
3695 if (_verify_count == Universe::verify_count()) return;
3696 _verify_count = Universe::verify_count();
3697 #endif
3698
3699 // Verify Klass
3700 Klass::verify_on(st);
3701
3702 // Verify that klass is present in ClassLoaderData
3703 guarantee(class_loader_data()->contains_klass(this),
3704 "this class isn't found in class loader data");
3705
3706 // Verify vtables
3707 if (is_linked()) {
3708 // $$$ This used to be done only for m/s collections. Doing it
3709 // always seemed a valid generalization. (DLD -- 6/00)
3710 vtable().verify(st);
3711 }
3712
3713 // Verify first subklass
3714 if (subklass() != NULL) {
3715 guarantee(subklass()->is_klass(), "should be klass");
3716 }
3717
3718 // Verify siblings
3719 Klass* super = this->super();
3720 Klass* sib = next_sibling();
3721 if (sib != NULL) {
3722 if (sib == this) {
3723 fatal("subclass points to itself " PTR_FORMAT, p2i(sib));
3724 }
3725
3726 guarantee(sib->is_klass(), "should be klass");
3727 guarantee(sib->super() == super, "siblings should have same superklass");
3728 }
3729
3730 // Verify local interfaces
3731 if (local_interfaces()) {
3732 Array<InstanceKlass*>* local_interfaces = this->local_interfaces();
3733 for (int j = 0; j < local_interfaces->length(); j++) {
3734 InstanceKlass* e = local_interfaces->at(j);
3735 guarantee(e->is_klass() && e->is_interface(), "invalid local interface");
3736 }
3737 }
3738
3739 // Verify transitive interfaces
3740 if (transitive_interfaces() != NULL) {
3741 Array<InstanceKlass*>* transitive_interfaces = this->transitive_interfaces();
3742 for (int j = 0; j < transitive_interfaces->length(); j++) {
3743 InstanceKlass* e = transitive_interfaces->at(j);
3744 guarantee(e->is_klass() && e->is_interface(), "invalid transitive interface");
3745 }
3746 }
3747
3748 // Verify methods
3749 if (methods() != NULL) {
3750 Array<Method*>* methods = this->methods();
3751 for (int j = 0; j < methods->length(); j++) {
3752 guarantee(methods->at(j)->is_method(), "non-method in methods array");
3753 }
3754 for (int j = 0; j < methods->length() - 1; j++) {
3755 Method* m1 = methods->at(j);
3756 Method* m2 = methods->at(j + 1);
3757 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
3758 }
3759 }
3760
3761 // Verify method ordering
3762 if (method_ordering() != NULL) {
3763 Array<int>* method_ordering = this->method_ordering();
3764 int length = method_ordering->length();
3765 if (JvmtiExport::can_maintain_original_method_order() ||
3766 ((UseSharedSpaces || DumpSharedSpaces) && length != 0)) {
3767 guarantee(length == methods()->length(), "invalid method ordering length");
3768 jlong sum = 0;
3769 for (int j = 0; j < length; j++) {
3770 int original_index = method_ordering->at(j);
3771 guarantee(original_index >= 0, "invalid method ordering index");
3772 guarantee(original_index < length, "invalid method ordering index");
3773 sum += original_index;
3774 }
3775 // Verify sum of indices 0,1,...,length-1
3776 guarantee(sum == ((jlong)length*(length-1))/2, "invalid method ordering sum");
3777 } else {
3778 guarantee(length == 0, "invalid method ordering length");
3779 }
3780 }
3781
3782 // Verify default methods
3783 if (default_methods() != NULL) {
3784 Array<Method*>* methods = this->default_methods();
3785 for (int j = 0; j < methods->length(); j++) {
3786 guarantee(methods->at(j)->is_method(), "non-method in methods array");
3787 }
3788 for (int j = 0; j < methods->length() - 1; j++) {
3789 Method* m1 = methods->at(j);
3790 Method* m2 = methods->at(j + 1);
3791 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly");
3792 }
3793 }
3794
3795 // Verify JNI static field identifiers
3796 if (jni_ids() != NULL) {
3797 jni_ids()->verify(this);
3798 }
3799
3800 // Verify other fields
3801 if (array_klasses() != NULL) {
3802 guarantee(array_klasses()->is_klass(), "should be klass");
3803 }
3804 if (constants() != NULL) {
3805 guarantee(constants()->is_constantPool(), "should be constant pool");
3806 }
3807 const Klass* anonymous_host = unsafe_anonymous_host();
3808 if (anonymous_host != NULL) {
3809 guarantee(anonymous_host->is_klass(), "should be klass");
3810 }
3811 }
3812
3813 void InstanceKlass::oop_verify_on(oop obj, outputStream* st) {
3814 Klass::oop_verify_on(obj, st);
3815 VerifyFieldClosure blk;
3816 obj->oop_iterate(&blk);
3817 }
3818
3819
3820 // JNIid class for jfieldIDs only
3821 // Note to reviewers:
3822 // These JNI functions are just moved over to column 1 and not changed
3823 // in the compressed oops workspace.
3824 JNIid::JNIid(Klass* holder, int offset, JNIid* next) {
3825 _holder = holder;
3826 _offset = offset;
3827 _next = next;
3828 debug_only(_is_static_field_id = false;)
3829 }
3830
3831
3832 JNIid* JNIid::find(int offset) {
3833 JNIid* current = this;
3834 while (current != NULL) {
3835 if (current->offset() == offset) return current;
3836 current = current->next();
3837 }
3838 return NULL;
3839 }
3840
3841 void JNIid::deallocate(JNIid* current) {
3842 while (current != NULL) {
3843 JNIid* next = current->next();
3844 delete current;
3845 current = next;
3846 }
3847 }
3848
3849
3850 void JNIid::verify(Klass* holder) {
3851 int first_field_offset = InstanceMirrorKlass::offset_of_static_fields();
3852 int end_field_offset;
3853 end_field_offset = first_field_offset + (InstanceKlass::cast(holder)->static_field_size() * wordSize);
3854
3855 JNIid* current = this;
3856 while (current != NULL) {
3857 guarantee(current->holder() == holder, "Invalid klass in JNIid");
3858 #ifdef ASSERT
3859 int o = current->offset();
3860 if (current->is_static_field_id()) {
3861 guarantee(o >= first_field_offset && o < end_field_offset, "Invalid static field offset in JNIid");
3862 }
3863 #endif
3864 current = current->next();
3865 }
3866 }
3867
3868 void InstanceKlass::set_init_state(ClassState state) {
3869 #ifdef ASSERT
3870 bool good_state = is_shared() ? (_init_state <= state)
3871 : (_init_state < state);
3872 assert(good_state || state == allocated, "illegal state transition");
3873 #endif
3874 assert(_init_thread == NULL, "should be cleared before state change");
3875 _init_state = (u1)state;
3876 }
3877
3878 #if INCLUDE_JVMTI
3879
3880 // RedefineClasses() support for previous versions
3881
3882 // Globally, there is at least one previous version of a class to walk
3883 // during class unloading, which is saved because old methods in the class
3884 // are still running. Otherwise the previous version list is cleaned up.
3885 bool InstanceKlass::_has_previous_versions = false;
3886
3887 // Returns true if there are previous versions of a class for class
3888 // unloading only. Also resets the flag to false. purge_previous_version
3889 // will set the flag to true if there are any left, i.e., if there's any
3890 // work to do for next time. This is to avoid the expensive code cache
3891 // walk in CLDG::clean_deallocate_lists().
3892 bool InstanceKlass::has_previous_versions_and_reset() {
3893 bool ret = _has_previous_versions;
3894 log_trace(redefine, class, iklass, purge)("Class unloading: has_previous_versions = %s",
3895 ret ? "true" : "false");
3896 _has_previous_versions = false;
3897 return ret;
3898 }
3899
3900 // Purge previous versions before adding new previous versions of the class and
3901 // during class unloading.
3902 void InstanceKlass::purge_previous_version_list() {
3903 assert(SafepointSynchronize::is_at_safepoint(), "only called at safepoint");
3904 assert(has_been_redefined(), "Should only be called for main class");
3905
3906 // Quick exit.
3907 if (previous_versions() == NULL) {
3908 return;
3909 }
3910
3911 // This klass has previous versions so see what we can cleanup
3912 // while it is safe to do so.
3913
3914 int deleted_count = 0; // leave debugging breadcrumbs
3915 int live_count = 0;
3916 ClassLoaderData* loader_data = class_loader_data();
3917 assert(loader_data != NULL, "should never be null");
3918
3919 ResourceMark rm;
3920 log_trace(redefine, class, iklass, purge)("%s: previous versions", external_name());
3921
3922 // previous versions are linked together through the InstanceKlass
3923 InstanceKlass* pv_node = previous_versions();
3924 InstanceKlass* last = this;
3925 int version = 0;
3926
3927 // check the previous versions list
3928 for (; pv_node != NULL; ) {
3929
3930 ConstantPool* pvcp = pv_node->constants();
3931 assert(pvcp != NULL, "cp ref was unexpectedly cleared");
3932
3933 if (!pvcp->on_stack()) {
3934 // If the constant pool isn't on stack, none of the methods
3935 // are executing. Unlink this previous_version.
3936 // The previous version InstanceKlass is on the ClassLoaderData deallocate list
3937 // so will be deallocated during the next phase of class unloading.
3938 log_trace(redefine, class, iklass, purge)
3939 ("previous version " INTPTR_FORMAT " is dead.", p2i(pv_node));
3940 // For debugging purposes.
3941 pv_node->set_is_scratch_class();
3942 // Unlink from previous version list.
3943 assert(pv_node->class_loader_data() == loader_data, "wrong loader_data");
3944 InstanceKlass* next = pv_node->previous_versions();
3945 pv_node->link_previous_versions(NULL); // point next to NULL
3946 last->link_previous_versions(next);
3947 // Add to the deallocate list after unlinking
3948 loader_data->add_to_deallocate_list(pv_node);
3949 pv_node = next;
3950 deleted_count++;
3951 version++;
3952 continue;
3953 } else {
3954 log_trace(redefine, class, iklass, purge)("previous version " INTPTR_FORMAT " is alive", p2i(pv_node));
3955 assert(pvcp->pool_holder() != NULL, "Constant pool with no holder");
3956 guarantee (!loader_data->is_unloading(), "unloaded classes can't be on the stack");
3957 live_count++;
3958 // found a previous version for next time we do class unloading
3959 _has_previous_versions = true;
3960 }
3961
3962 // At least one method is live in this previous version.
3963 // Reset dead EMCP methods not to get breakpoints.
3964 // All methods are deallocated when all of the methods for this class are no
3965 // longer running.
3966 Array<Method*>* method_refs = pv_node->methods();
3967 if (method_refs != NULL) {
3968 log_trace(redefine, class, iklass, purge)("previous methods length=%d", method_refs->length());
3969 for (int j = 0; j < method_refs->length(); j++) {
3970 Method* method = method_refs->at(j);
3971
3972 if (!method->on_stack()) {
3973 // no breakpoints for non-running methods
3974 if (method->is_running_emcp()) {
3975 method->set_running_emcp(false);
3976 }
3977 } else {
3978 assert (method->is_obsolete() || method->is_running_emcp(),
3979 "emcp method cannot run after emcp bit is cleared");
3980 log_trace(redefine, class, iklass, purge)
3981 ("purge: %s(%s): prev method @%d in version @%d is alive",
3982 method->name()->as_C_string(), method->signature()->as_C_string(), j, version);
3983 }
3984 }
3985 }
3986 // next previous version
3987 last = pv_node;
3988 pv_node = pv_node->previous_versions();
3989 version++;
3990 }
3991 log_trace(redefine, class, iklass, purge)
3992 ("previous version stats: live=%d, deleted=%d", live_count, deleted_count);
3993 }
3994
3995 void InstanceKlass::mark_newly_obsolete_methods(Array<Method*>* old_methods,
3996 int emcp_method_count) {
3997 int obsolete_method_count = old_methods->length() - emcp_method_count;
3998
3999 if (emcp_method_count != 0 && obsolete_method_count != 0 &&
4000 _previous_versions != NULL) {
4001 // We have a mix of obsolete and EMCP methods so we have to
4002 // clear out any matching EMCP method entries the hard way.
4003 int local_count = 0;
4004 for (int i = 0; i < old_methods->length(); i++) {
4005 Method* old_method = old_methods->at(i);
4006 if (old_method->is_obsolete()) {
4007 // only obsolete methods are interesting
4008 Symbol* m_name = old_method->name();
4009 Symbol* m_signature = old_method->signature();
4010
4011 // previous versions are linked together through the InstanceKlass
4012 int j = 0;
4013 for (InstanceKlass* prev_version = _previous_versions;
4014 prev_version != NULL;
4015 prev_version = prev_version->previous_versions(), j++) {
4016
4017 Array<Method*>* method_refs = prev_version->methods();
4018 for (int k = 0; k < method_refs->length(); k++) {
4019 Method* method = method_refs->at(k);
4020
4021 if (!method->is_obsolete() &&
4022 method->name() == m_name &&
4023 method->signature() == m_signature) {
4024 // The current RedefineClasses() call has made all EMCP
4025 // versions of this method obsolete so mark it as obsolete
4026 log_trace(redefine, class, iklass, add)
4027 ("%s(%s): flush obsolete method @%d in version @%d",
4028 m_name->as_C_string(), m_signature->as_C_string(), k, j);
4029
4030 method->set_is_obsolete();
4031 break;
4032 }
4033 }
4034
4035 // The previous loop may not find a matching EMCP method, but
4036 // that doesn't mean that we can optimize and not go any
4037 // further back in the PreviousVersion generations. The EMCP
4038 // method for this generation could have already been made obsolete,
4039 // but there still may be an older EMCP method that has not
4040 // been made obsolete.
4041 }
4042
4043 if (++local_count >= obsolete_method_count) {
4044 // no more obsolete methods so bail out now
4045 break;
4046 }
4047 }
4048 }
4049 }
4050 }
4051
4052 // Save the scratch_class as the previous version if any of the methods are running.
4053 // The previous_versions are used to set breakpoints in EMCP methods and they are
4054 // also used to clean MethodData links to redefined methods that are no longer running.
4055 void InstanceKlass::add_previous_version(InstanceKlass* scratch_class,
4056 int emcp_method_count) {
4057 assert(Thread::current()->is_VM_thread(),
4058 "only VMThread can add previous versions");
4059
4060 ResourceMark rm;
4061 log_trace(redefine, class, iklass, add)
4062 ("adding previous version ref for %s, EMCP_cnt=%d", scratch_class->external_name(), emcp_method_count);
4063
4064 // Clean out old previous versions for this class
4065 purge_previous_version_list();
4066
4067 // Mark newly obsolete methods in remaining previous versions. An EMCP method from
4068 // a previous redefinition may be made obsolete by this redefinition.
4069 Array<Method*>* old_methods = scratch_class->methods();
4070 mark_newly_obsolete_methods(old_methods, emcp_method_count);
4071
4072 // If the constant pool for this previous version of the class
4073 // is not marked as being on the stack, then none of the methods
4074 // in this previous version of the class are on the stack so
4075 // we don't need to add this as a previous version.
4076 ConstantPool* cp_ref = scratch_class->constants();
4077 if (!cp_ref->on_stack()) {
4078 log_trace(redefine, class, iklass, add)("scratch class not added; no methods are running");
4079 // For debugging purposes.
4080 scratch_class->set_is_scratch_class();
4081 scratch_class->class_loader_data()->add_to_deallocate_list(scratch_class);
4082 return;
4083 }
4084
4085 if (emcp_method_count != 0) {
4086 // At least one method is still running, check for EMCP methods
4087 for (int i = 0; i < old_methods->length(); i++) {
4088 Method* old_method = old_methods->at(i);
4089 if (!old_method->is_obsolete() && old_method->on_stack()) {
4090 // if EMCP method (not obsolete) is on the stack, mark as EMCP so that
4091 // we can add breakpoints for it.
4092
4093 // We set the method->on_stack bit during safepoints for class redefinition
4094 // and use this bit to set the is_running_emcp bit.
4095 // After the safepoint, the on_stack bit is cleared and the running emcp
4096 // method may exit. If so, we would set a breakpoint in a method that
4097 // is never reached, but this won't be noticeable to the programmer.
4098 old_method->set_running_emcp(true);
4099 log_trace(redefine, class, iklass, add)
4100 ("EMCP method %s is on_stack " INTPTR_FORMAT, old_method->name_and_sig_as_C_string(), p2i(old_method));
4101 } else if (!old_method->is_obsolete()) {
4102 log_trace(redefine, class, iklass, add)
4103 ("EMCP method %s is NOT on_stack " INTPTR_FORMAT, old_method->name_and_sig_as_C_string(), p2i(old_method));
4104 }
4105 }
4106 }
4107
4108 // Add previous version if any methods are still running.
4109 // Set has_previous_version flag for processing during class unloading.
4110 _has_previous_versions = true;
4111 log_trace(redefine, class, iklass, add) ("scratch class added; one of its methods is on_stack.");
4112 assert(scratch_class->previous_versions() == NULL, "shouldn't have a previous version");
4113 scratch_class->link_previous_versions(previous_versions());
4114 link_previous_versions(scratch_class);
4115 } // end add_previous_version()
4116
4117 #endif // INCLUDE_JVMTI
4118
4119 Method* InstanceKlass::method_with_idnum(int idnum) {
4120 Method* m = NULL;
4121 if (idnum < methods()->length()) {
4122 m = methods()->at(idnum);
4123 }
4124 if (m == NULL || m->method_idnum() != idnum) {
4125 for (int index = 0; index < methods()->length(); ++index) {
4126 m = methods()->at(index);
4127 if (m->method_idnum() == idnum) {
4128 return m;
4129 }
4130 }
4131 // None found, return null for the caller to handle.
4132 return NULL;
4133 }
4134 return m;
4135 }
4136
4137
4138 Method* InstanceKlass::method_with_orig_idnum(int idnum) {
4139 if (idnum >= methods()->length()) {
4140 return NULL;
4141 }
4142 Method* m = methods()->at(idnum);
4143 if (m != NULL && m->orig_method_idnum() == idnum) {
4144 return m;
4145 }
4146 // Obsolete method idnum does not match the original idnum
4147 for (int index = 0; index < methods()->length(); ++index) {
4148 m = methods()->at(index);
4149 if (m->orig_method_idnum() == idnum) {
4150 return m;
4151 }
4152 }
4153 // None found, return null for the caller to handle.
4154 return NULL;
4155 }
4156
4157
4158 Method* InstanceKlass::method_with_orig_idnum(int idnum, int version) {
4159 InstanceKlass* holder = get_klass_version(version);
4160 if (holder == NULL) {
4161 return NULL; // The version of klass is gone, no method is found
4162 }
4163 Method* method = holder->method_with_orig_idnum(idnum);
4164 return method;
4165 }
4166
4167 #if INCLUDE_JVMTI
4168 JvmtiCachedClassFileData* InstanceKlass::get_cached_class_file() {
4169 return _cached_class_file;
4170 }
4171
4172 jint InstanceKlass::get_cached_class_file_len() {
4173 return VM_RedefineClasses::get_cached_class_file_len(_cached_class_file);
4174 }
4175
4176 unsigned char * InstanceKlass::get_cached_class_file_bytes() {
4177 return VM_RedefineClasses::get_cached_class_file_bytes(_cached_class_file);
4178 }
4179 #endif
4180
4181 #define THROW_DVT_ERROR(s) \
4182 Exceptions::fthrow(THREAD_AND_LOCATION, vmSymbols::java_lang_IncompatibleClassChangeError(), \
4183 "ValueCapableClass class '%s' %s", external_name(),(s)); \
4184 return