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