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