1 /*
2 * Copyright (c) 1997, 2017, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "classfile/dictionary.hpp"
27 #include "classfile/javaClasses.hpp"
28 #include "classfile/systemDictionary.hpp"
29 #include "classfile/vmSymbols.hpp"
30 #include "gc/shared/collectedHeap.inline.hpp"
31 #include "logging/log.hpp"
32 #include "memory/heapInspection.hpp"
33 #include "memory/metadataFactory.hpp"
34 #include "memory/metaspaceClosure.hpp"
35 #include "memory/metaspaceShared.hpp"
36 #include "memory/oopFactory.hpp"
37 #include "memory/resourceArea.hpp"
38 #include "oops/instanceKlass.hpp"
39 #include "oops/klass.inline.hpp"
40 #include "oops/oop.inline.hpp"
41 #include "runtime/atomic.hpp"
42 #include "runtime/orderAccess.inline.hpp"
43 #include "trace/traceMacros.hpp"
44 #include "utilities/macros.hpp"
45 #include "utilities/stack.inline.hpp"
46
47 void Klass::set_java_mirror(Handle m) {
48 assert(!m.is_null(), "New mirror should never be null.");
49 assert(_java_mirror.resolve() == NULL, "should only be used to initialize mirror");
50 _java_mirror = class_loader_data()->add_handle(m);
51 }
52
53 oop Klass::java_mirror() const {
54 return _java_mirror.resolve();
55 }
56
57 bool Klass::is_cloneable() const {
58 return _access_flags.is_cloneable_fast() ||
59 is_subtype_of(SystemDictionary::Cloneable_klass());
60 }
61
62 void Klass::set_is_cloneable() {
63 if (name() != vmSymbols::java_lang_invoke_MemberName()) {
64 _access_flags.set_is_cloneable_fast();
65 } else {
66 assert(is_final(), "no subclasses allowed");
67 // MemberName cloning should not be intrinsified and always happen in JVM_Clone.
68 }
69 }
70
71 void Klass::set_name(Symbol* n) {
72 _name = n;
73 if (_name != NULL) _name->increment_refcount();
74 }
75
76 bool Klass::is_subclass_of(const Klass* k) const {
77 // Run up the super chain and check
78 if (this == k) return true;
79
80 Klass* t = const_cast<Klass*>(this)->super();
81
82 while (t != NULL) {
83 if (t == k) return true;
84 t = t->super();
85 }
86 return false;
87 }
88
89 bool Klass::search_secondary_supers(Klass* k) const {
90 // Put some extra logic here out-of-line, before the search proper.
91 // This cuts down the size of the inline method.
92
93 // This is necessary, since I am never in my own secondary_super list.
94 if (this == k)
95 return true;
96 // Scan the array-of-objects for a match
97 int cnt = secondary_supers()->length();
98 for (int i = 0; i < cnt; i++) {
99 if (secondary_supers()->at(i) == k) {
100 ((Klass*)this)->set_secondary_super_cache(k);
101 return true;
102 }
103 }
104 return false;
105 }
106
107 // Return self, except for abstract classes with exactly 1
108 // implementor. Then return the 1 concrete implementation.
109 Klass *Klass::up_cast_abstract() {
110 Klass *r = this;
111 while( r->is_abstract() ) { // Receiver is abstract?
112 Klass *s = r->subklass(); // Check for exactly 1 subklass
113 if( !s || s->next_sibling() ) // Oops; wrong count; give up
114 return this; // Return 'this' as a no-progress flag
115 r = s; // Loop till find concrete class
116 }
117 return r; // Return the 1 concrete class
118 }
119
120 // Find LCA in class hierarchy
121 Klass *Klass::LCA( Klass *k2 ) {
122 Klass *k1 = this;
123 while( 1 ) {
124 if( k1->is_subtype_of(k2) ) return k2;
125 if( k2->is_subtype_of(k1) ) return k1;
126 k1 = k1->super();
127 k2 = k2->super();
128 }
129 }
130
131
132 void Klass::check_valid_for_instantiation(bool throwError, TRAPS) {
133 ResourceMark rm(THREAD);
134 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError()
135 : vmSymbols::java_lang_InstantiationException(), external_name());
136 }
137
138
139 void Klass::copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS) {
140 THROW(vmSymbols::java_lang_ArrayStoreException());
141 }
142
143
144 void Klass::initialize(TRAPS) {
145 ShouldNotReachHere();
146 }
147
148 bool Klass::compute_is_subtype_of(Klass* k) {
149 assert(k->is_klass(), "argument must be a class");
150 return is_subclass_of(k);
151 }
152
153 Klass* Klass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const {
154 #ifdef ASSERT
155 tty->print_cr("Error: find_field called on a klass oop."
156 " Likely error: reflection method does not correctly"
157 " wrap return value in a mirror object.");
158 #endif
159 ShouldNotReachHere();
160 return NULL;
161 }
162
163 Method* Klass::uncached_lookup_method(const Symbol* name, const Symbol* signature, OverpassLookupMode overpass_mode) const {
164 #ifdef ASSERT
165 tty->print_cr("Error: uncached_lookup_method called on a klass oop."
166 " Likely error: reflection method does not correctly"
167 " wrap return value in a mirror object.");
168 #endif
169 ShouldNotReachHere();
170 return NULL;
171 }
172
173 void* Klass::operator new(size_t size, ClassLoaderData* loader_data, size_t word_size, bool is_value, TRAPS) throw() {
174 // Pad size in case need adjust to even/odd klass ptr
175 uintptr_t addr = (uintptr_t) Metaspace::allocate(loader_data, word_size + (1 << LogKlassAlignment), MetaspaceObj::ClassType, THREAD);
176 // values are odd, otherwise make even (and vice versa)
177 if (is_value ^ (((addr & KlassPtrEvenOddMask) >> LogKlassAlignmentInBytes) != 0)) {
178 addr += (1 << LogKlassAlignmentInBytes);
179 }
180 assert(is_aligned(addr, (1 << LogKlassAlignmentInBytes)), "Klass base alignment incorrect");
181 assert( is_value || ((addr & KlassPtrEvenOddMask) == 0), "Klass even alignment incorrect");
182 assert(!is_value || ((addr & KlassPtrEvenOddMask) != 0), "Klass odd alignment incorrect");
183 return (void*) addr;
184 }
185
186
187 // "Normal" instantiation is preceeded by a MetaspaceObj allocation
188 // which zeros out memory - calloc equivalent.
189 // The constructor is also used from CppVtableCloner,
190 // which doesn't zero out the memory before calling the constructor.
191 // Need to set the _java_mirror field explicitly to not hit an assert that the field
192 // should be NULL before setting it.
193 Klass::Klass() : _prototype_header(markOopDesc::prototype()),
194 _shared_class_path_index(-1),
195 _java_mirror(NULL) {
196
197 _primary_supers[0] = this;
198 set_super_check_offset(in_bytes(primary_supers_offset()));
199 }
200
201 jint Klass::array_layout_helper(BasicType etype) {
202 assert(etype >= T_BOOLEAN && etype <= T_OBJECT, "valid etype");
203 // Note that T_ARRAY is not allowed here.
204 int hsize = arrayOopDesc::base_offset_in_bytes(etype);
205 int esize = type2aelembytes(etype);
206 bool isobj = (etype == T_OBJECT);
207 int tag = isobj ? _lh_array_tag_obj_value : _lh_array_tag_type_value;
208 int lh = array_layout_helper(tag, hsize, etype, exact_log2(esize));
209
210 assert(lh < (int)_lh_neutral_value, "must look like an array layout");
211 assert(layout_helper_is_array(lh), "correct kind");
212 assert(layout_helper_is_objArray(lh) == isobj, "correct kind");
213 assert(layout_helper_is_typeArray(lh) == !isobj, "correct kind");
214 assert(layout_helper_header_size(lh) == hsize, "correct decode");
215 assert(layout_helper_element_type(lh) == etype, "correct decode");
216 assert(1 << layout_helper_log2_element_size(lh) == esize, "correct decode");
217
218 return lh;
219 }
220
221 bool Klass::can_be_primary_super_slow() const {
222 if (super() == NULL)
223 return true;
224 else if (super()->super_depth() >= primary_super_limit()-1)
225 return false;
226 else
227 return true;
228 }
229
230 void Klass::initialize_supers(Klass* k, TRAPS) {
231 if (FastSuperclassLimit == 0) {
232 // None of the other machinery matters.
233 set_super(k);
234 return;
235 }
236 if (k == NULL) {
237 set_super(NULL);
238 _primary_supers[0] = this;
239 assert(super_depth() == 0, "Object must already be initialized properly");
240 } else if (k != super() || k == SystemDictionary::Object_klass()) {
241 assert(super() == NULL || super() == SystemDictionary::Object_klass(),
242 "initialize this only once to a non-trivial value");
243 set_super(k);
244 Klass* sup = k;
245 int sup_depth = sup->super_depth();
246 juint my_depth = MIN2(sup_depth + 1, (int)primary_super_limit());
247 if (!can_be_primary_super_slow())
248 my_depth = primary_super_limit();
249 for (juint i = 0; i < my_depth; i++) {
250 _primary_supers[i] = sup->_primary_supers[i];
251 }
252 Klass* *super_check_cell;
253 if (my_depth < primary_super_limit()) {
254 _primary_supers[my_depth] = this;
255 super_check_cell = &_primary_supers[my_depth];
256 } else {
257 // Overflow of the primary_supers array forces me to be secondary.
258 super_check_cell = &_secondary_super_cache;
259 }
260 set_super_check_offset((address)super_check_cell - (address) this);
261
262 #ifdef ASSERT
263 {
264 juint j = super_depth();
265 assert(j == my_depth, "computed accessor gets right answer");
266 Klass* t = this;
267 while (!t->can_be_primary_super()) {
268 t = t->super();
269 j = t->super_depth();
270 }
271 for (juint j1 = j+1; j1 < primary_super_limit(); j1++) {
272 assert(primary_super_of_depth(j1) == NULL, "super list padding");
273 }
274 while (t != NULL) {
275 assert(primary_super_of_depth(j) == t, "super list initialization");
276 t = t->super();
277 --j;
278 }
279 assert(j == (juint)-1, "correct depth count");
280 }
281 #endif
282 }
283
284 if (secondary_supers() == NULL) {
285
286 // Now compute the list of secondary supertypes.
287 // Secondaries can occasionally be on the super chain,
288 // if the inline "_primary_supers" array overflows.
289 int extras = 0;
290 Klass* p;
291 for (p = super(); !(p == NULL || p->can_be_primary_super()); p = p->super()) {
292 ++extras;
293 }
294
295 ResourceMark rm(THREAD); // need to reclaim GrowableArrays allocated below
296
297 // Compute the "real" non-extra secondaries.
298 GrowableArray<Klass*>* secondaries = compute_secondary_supers(extras);
299 if (secondaries == NULL) {
300 // secondary_supers set by compute_secondary_supers
301 return;
302 }
303
304 GrowableArray<Klass*>* primaries = new GrowableArray<Klass*>(extras);
305
306 for (p = super(); !(p == NULL || p->can_be_primary_super()); p = p->super()) {
307 int i; // Scan for overflow primaries being duplicates of 2nd'arys
308
309 // This happens frequently for very deeply nested arrays: the
310 // primary superclass chain overflows into the secondary. The
311 // secondary list contains the element_klass's secondaries with
312 // an extra array dimension added. If the element_klass's
313 // secondary list already contains some primary overflows, they
314 // (with the extra level of array-ness) will collide with the
315 // normal primary superclass overflows.
316 for( i = 0; i < secondaries->length(); i++ ) {
317 if( secondaries->at(i) == p )
318 break;
319 }
320 if( i < secondaries->length() )
321 continue; // It's a dup, don't put it in
322 primaries->push(p);
323 }
324 // Combine the two arrays into a metadata object to pack the array.
325 // The primaries are added in the reverse order, then the secondaries.
326 int new_length = primaries->length() + secondaries->length();
327 Array<Klass*>* s2 = MetadataFactory::new_array<Klass*>(
328 class_loader_data(), new_length, CHECK);
329 int fill_p = primaries->length();
330 for (int j = 0; j < fill_p; j++) {
331 s2->at_put(j, primaries->pop()); // add primaries in reverse order.
332 }
333 for( int j = 0; j < secondaries->length(); j++ ) {
334 s2->at_put(j+fill_p, secondaries->at(j)); // add secondaries on the end.
335 }
336
337 #ifdef ASSERT
338 // We must not copy any NULL placeholders left over from bootstrap.
339 for (int j = 0; j < s2->length(); j++) {
340 assert(s2->at(j) != NULL, "correct bootstrapping order");
341 }
342 #endif
343
344 set_secondary_supers(s2);
345 }
346 }
347
348 GrowableArray<Klass*>* Klass::compute_secondary_supers(int num_extra_slots) {
349 assert(num_extra_slots == 0, "override for complex klasses");
350 set_secondary_supers(Universe::the_empty_klass_array());
351 return NULL;
352 }
353
354
355 InstanceKlass* Klass::superklass() const {
356 assert(super() == NULL || super()->is_instance_klass(), "must be instance klass");
357 return _super == NULL ? NULL : InstanceKlass::cast(_super);
358 }
359
360 void Klass::set_subklass(Klass* s) {
361 assert(s != this, "sanity check");
362 _subklass = s;
363 }
364
365 void Klass::set_next_sibling(Klass* s) {
366 assert(s != this, "sanity check");
367 _next_sibling = s;
368 }
369
370 void Klass::append_to_sibling_list() {
371 debug_only(verify();)
372 // add ourselves to superklass' subklass list
373 InstanceKlass* super = superklass();
374 if (super == NULL) return; // special case: class Object
375 assert((!super->is_interface() // interfaces cannot be supers
376 && (super->superklass() == NULL || !is_interface())),
377 "an interface can only be a subklass of Object");
378 Klass* prev_first_subklass = super->subklass();
379 if (prev_first_subklass != NULL) {
380 // set our sibling to be the superklass' previous first subklass
381 set_next_sibling(prev_first_subklass);
382 }
383 // make ourselves the superklass' first subklass
384 super->set_subklass(this);
385 debug_only(verify();)
386 }
387
388 bool Klass::is_loader_alive(BoolObjectClosure* is_alive) {
389 #ifdef ASSERT
390 // The class is alive iff the class loader is alive.
391 oop loader = class_loader();
392 bool loader_alive = (loader == NULL) || is_alive->do_object_b(loader);
393 #endif // ASSERT
394
395 // The class is alive if it's mirror is alive (which should be marked if the
396 // loader is alive) unless it's an anoymous class.
397 bool mirror_alive = is_alive->do_object_b(java_mirror());
398 assert(!mirror_alive || loader_alive, "loader must be alive if the mirror is"
399 " but not the other way around with anonymous classes");
400 return mirror_alive;
401 }
402
403 void Klass::clean_weak_klass_links(BoolObjectClosure* is_alive, bool clean_alive_klasses) {
404 if (!ClassUnloading) {
405 return;
406 }
407
408 Klass* root = SystemDictionary::Object_klass();
409 Stack<Klass*, mtGC> stack;
410
411 stack.push(root);
412 while (!stack.is_empty()) {
413 Klass* current = stack.pop();
414
415 assert(current->is_loader_alive(is_alive), "just checking, this should be live");
416
417 // Find and set the first alive subklass
418 Klass* sub = current->subklass();
419 while (sub != NULL && !sub->is_loader_alive(is_alive)) {
420 #ifndef PRODUCT
421 if (log_is_enabled(Trace, class, unload)) {
422 ResourceMark rm;
423 log_trace(class, unload)("unlinking class (subclass): %s", sub->external_name());
424 }
425 #endif
426 sub = sub->next_sibling();
427 }
428 current->set_subklass(sub);
429 if (sub != NULL) {
430 stack.push(sub);
431 }
432
433 // Find and set the first alive sibling
434 Klass* sibling = current->next_sibling();
435 while (sibling != NULL && !sibling->is_loader_alive(is_alive)) {
436 if (log_is_enabled(Trace, class, unload)) {
437 ResourceMark rm;
438 log_trace(class, unload)("[Unlinking class (sibling) %s]", sibling->external_name());
439 }
440 sibling = sibling->next_sibling();
441 }
442 current->set_next_sibling(sibling);
443 if (sibling != NULL) {
444 stack.push(sibling);
445 }
446
447 // Clean the implementors list and method data.
448 if (clean_alive_klasses && current->is_instance_klass()) {
449 InstanceKlass* ik = InstanceKlass::cast(current);
450 ik->clean_weak_instanceklass_links(is_alive);
451
452 // JVMTI RedefineClasses creates previous versions that are not in
453 // the class hierarchy, so process them here.
454 while ((ik = ik->previous_versions()) != NULL) {
455 ik->clean_weak_instanceklass_links(is_alive);
456 }
457 }
458 }
459 }
460
461 void Klass::metaspace_pointers_do(MetaspaceClosure* it) {
462 if (log_is_enabled(Trace, cds)) {
463 ResourceMark rm;
464 log_trace(cds)("Iter(Klass): %p (%s)", this, external_name());
465 }
466
467 it->push(&_name);
468 it->push(&_secondary_super_cache);
469 it->push(&_secondary_supers);
470 for (int i = 0; i < _primary_super_limit; i++) {
471 it->push(&_primary_supers[i]);
472 }
473 it->push(&_super);
474 it->push(&_subklass);
475 it->push(&_next_sibling);
476 it->push(&_next_link);
477
478 vtableEntry* vt = start_of_vtable();
479 for (int i=0; i<vtable_length(); i++) {
480 it->push(vt[i].method_addr());
481 }
482 }
483
484 void Klass::remove_unshareable_info() {
485 assert (DumpSharedSpaces, "only called for DumpSharedSpaces");
486 TRACE_REMOVE_ID(this);
487 if (log_is_enabled(Trace, cds, unshareable)) {
488 ResourceMark rm;
489 log_trace(cds, unshareable)("remove: %s", external_name());
490 }
491
492 set_subklass(NULL);
493 set_next_sibling(NULL);
494 set_next_link(NULL);
495
496 // Null out class_loader_data because we don't share that yet.
497 set_class_loader_data(NULL);
498 set_is_shared();
499 }
500
501 void Klass::remove_java_mirror() {
502 assert (DumpSharedSpaces, "only called for DumpSharedSpaces");
503 if (log_is_enabled(Trace, cds, unshareable)) {
504 ResourceMark rm;
505 log_trace(cds, unshareable)("remove java_mirror: %s", external_name());
506 }
507 // Just null out the mirror. The class_loader_data() no longer exists.
508 _java_mirror = NULL;
509 }
510
511 void Klass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) {
512 assert(is_klass(), "ensure C++ vtable is restored");
513 assert(is_shared(), "must be set");
514 TRACE_RESTORE_ID(this);
515 if (log_is_enabled(Trace, cds, unshareable)) {
516 ResourceMark rm;
517 log_trace(cds, unshareable)("restore: %s", external_name());
518 }
519
520 // If an exception happened during CDS restore, some of these fields may already be
521 // set. We leave the class on the CLD list, even if incomplete so that we don't
522 // modify the CLD list outside a safepoint.
523 if (class_loader_data() == NULL) {
524 // Restore class_loader_data to the null class loader data
525 set_class_loader_data(loader_data);
526
527 // Add to null class loader list first before creating the mirror
528 // (same order as class file parsing)
529 loader_data->add_class(this);
530 }
531
532 // Recreate the class mirror.
533 // Only recreate it if not present. A previous attempt to restore may have
534 // gotten an OOM later but keep the mirror if it was created.
535 if (java_mirror() == NULL) {
536 Handle loader(THREAD, loader_data->class_loader());
537 ModuleEntry* module_entry = NULL;
538 Klass* k = this;
539 if (k->is_objArray_klass()) {
540 k = ObjArrayKlass::cast(k)->bottom_klass();
541 }
542 // Obtain klass' module.
543 if (k->is_instance_klass()) {
544 InstanceKlass* ik = (InstanceKlass*) k;
545 module_entry = ik->module();
546 } else {
547 module_entry = ModuleEntryTable::javabase_moduleEntry();
548 }
549 // Obtain java.lang.Module, if available
550 Handle module_handle(THREAD, ((module_entry != NULL) ? module_entry->module() : (oop)NULL));
551 java_lang_Class::create_mirror(this, loader, module_handle, protection_domain, CHECK);
552 }
553 }
554
555 Klass* Klass::array_klass_or_null(int rank) {
556 EXCEPTION_MARK;
557 // No exception can be thrown by array_klass_impl when called with or_null == true.
558 // (In anycase, the execption mark will fail if it do so)
559 return array_klass_impl(true, rank, THREAD);
560 }
561
562
563 Klass* Klass::array_klass_or_null() {
564 EXCEPTION_MARK;
565 // No exception can be thrown by array_klass_impl when called with or_null == true.
566 // (In anycase, the execption mark will fail if it do so)
567 return array_klass_impl(true, THREAD);
568 }
569
570
571 Klass* Klass::array_klass_impl(bool or_null, int rank, TRAPS) {
572 fatal("array_klass should be dispatched to InstanceKlass, ObjArrayKlass or TypeArrayKlass");
573 return NULL;
574 }
575
576
577 Klass* Klass::array_klass_impl(bool or_null, TRAPS) {
578 fatal("array_klass should be dispatched to InstanceKlass, ObjArrayKlass or TypeArrayKlass");
579 return NULL;
580 }
581
582 oop Klass::class_loader() const { return class_loader_data()->class_loader(); }
583
584 // In product mode, this function doesn't have virtual function calls so
585 // there might be some performance advantage to handling InstanceKlass here.
586 const char* Klass::external_name() const {
587 if (is_instance_klass()) {
588 const InstanceKlass* ik = static_cast<const InstanceKlass*>(this);
589 if (ik->is_anonymous()) {
590 intptr_t hash = 0;
591 if (ik->java_mirror() != NULL) {
592 // java_mirror might not be created yet, return 0 as hash.
593 hash = ik->java_mirror()->identity_hash();
594 }
595 char hash_buf[40];
596 sprintf(hash_buf, "/" UINTX_FORMAT, (uintx)hash);
597 size_t hash_len = strlen(hash_buf);
598
599 size_t result_len = name()->utf8_length();
600 char* result = NEW_RESOURCE_ARRAY(char, result_len + hash_len + 1);
601 name()->as_klass_external_name(result, (int) result_len + 1);
602 assert(strlen(result) == result_len, "");
603 strcpy(result + result_len, hash_buf);
604 assert(strlen(result) == result_len + hash_len, "");
605 return result;
606 }
607 }
608 if (name() == NULL) return "<unknown>";
609 return name()->as_klass_external_name();
610 }
611
612
613 const char* Klass::signature_name() const {
614 if (name() == NULL) return "<unknown>";
615 return name()->as_C_string();
616 }
617
618 // Unless overridden, modifier_flags is 0.
619 jint Klass::compute_modifier_flags(TRAPS) const {
620 return 0;
621 }
622
623 int Klass::atomic_incr_biased_lock_revocation_count() {
624 return (int) Atomic::add(1, &_biased_lock_revocation_count);
625 }
626
627 // Unless overridden, jvmti_class_status has no flags set.
628 jint Klass::jvmti_class_status() const {
629 return 0;
630 }
631
632
633 // Printing
634
635 void Klass::print_on(outputStream* st) const {
636 ResourceMark rm;
637 // print title
638 st->print("%s", internal_name());
639 print_address_on(st);
640 st->cr();
641 }
642
643 void Klass::oop_print_on(oop obj, outputStream* st) {
644 ResourceMark rm;
645 // print title
646 st->print_cr("%s ", internal_name());
647 obj->print_address_on(st);
648
649 if (WizardMode) {
650 // print header
651 obj->mark()->print_on(st);
652 }
653
654 // print class
655 st->print(" - klass: ");
656 obj->klass()->print_value_on(st);
657 st->cr();
658 }
659
660 void Klass::oop_print_value_on(oop obj, outputStream* st) {
661 // print title
662 ResourceMark rm; // Cannot print in debug mode without this
663 st->print("%s", internal_name());
664 obj->print_address_on(st);
665 }
666
667 #if INCLUDE_SERVICES
668 // Size Statistics
669 void Klass::collect_statistics(KlassSizeStats *sz) const {
670 sz->_klass_bytes = sz->count(this);
671 sz->_mirror_bytes = sz->count(java_mirror());
672 sz->_secondary_supers_bytes = sz->count_array(secondary_supers());
673
674 sz->_ro_bytes += sz->_secondary_supers_bytes;
675 sz->_rw_bytes += sz->_klass_bytes + sz->_mirror_bytes;
676 }
677 #endif // INCLUDE_SERVICES
678
679 // Verification
680
681 void Klass::verify_on(outputStream* st) {
682
683 // This can be expensive, but it is worth checking that this klass is actually
684 // in the CLD graph but not in production.
685 assert(Metaspace::contains((address)this), "Should be");
686
687 guarantee(this->is_klass(),"should be klass");
688
689 if (super() != NULL) {
690 guarantee(super()->is_klass(), "should be klass");
691 }
692 if (secondary_super_cache() != NULL) {
693 Klass* ko = secondary_super_cache();
694 guarantee(ko->is_klass(), "should be klass");
695 }
696 for ( uint i = 0; i < primary_super_limit(); i++ ) {
697 Klass* ko = _primary_supers[i];
698 if (ko != NULL) {
699 guarantee(ko->is_klass(), "should be klass");
700 }
701 }
702
703 if (java_mirror() != NULL) {
704 guarantee(oopDesc::is_oop(java_mirror()), "should be instance");
705 }
706 }
707
708 void Klass::oop_verify_on(oop obj, outputStream* st) {
709 guarantee(oopDesc::is_oop(obj), "should be oop");
710 guarantee(obj->klass()->is_klass(), "klass field is not a klass");
711 }
712
713 klassVtable Klass::vtable() const {
714 return klassVtable(const_cast<Klass*>(this), start_of_vtable(), vtable_length() / vtableEntry::size());
715 }
716
717 vtableEntry* Klass::start_of_vtable() const {
718 return (vtableEntry*) ((address)this + in_bytes(vtable_start_offset()));
719 }
720
721 Method* Klass::method_at_vtable(int index) {
722 #ifndef PRODUCT
723 assert(index >= 0, "valid vtable index");
724 if (DebugVtables) {
725 verify_vtable_index(index);
726 }
727 #endif
728 return start_of_vtable()[index].method();
729 }
730
731 ByteSize Klass::vtable_start_offset() {
732 return in_ByteSize(InstanceKlass::header_size() * wordSize);
733 }
734
735 #ifndef PRODUCT
736
737 bool Klass::verify_vtable_index(int i) {
738 int limit = vtable_length()/vtableEntry::size();
739 assert(i >= 0 && i < limit, "index %d out of bounds %d", i, limit);
740 return true;
741 }
742
743 bool Klass::verify_itable_index(int i) {
744 assert(is_instance_klass(), "");
745 int method_count = klassItable::method_count_for_interface(this);
746 assert(i >= 0 && i < method_count, "index out of bounds");
747 return true;
748 }
749
750 #endif