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