src/share/vm/oops/klassKlass.cpp

Thu, 23 Jun 2011 17:14:06 -0700

author
jrose
date
Thu, 23 Jun 2011 17:14:06 -0700
changeset 2982
ddd894528dbc
parent 2658
c7f3d0b4570f
permissions
-rw-r--r--

7056328: JSR 292 invocation sometimes fails in adapters for types not on boot class path
Reviewed-by: never

duke@435 1 /*
stefank@2534 2 * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #include "precompiled.hpp"
stefank@2314 26 #include "gc_implementation/shared/markSweep.inline.hpp"
stefank@2314 27 #include "gc_interface/collectedHeap.hpp"
stefank@2314 28 #include "gc_interface/collectedHeap.inline.hpp"
stefank@2314 29 #include "memory/oopFactory.hpp"
stefank@2314 30 #include "memory/permGen.hpp"
stefank@2314 31 #include "oops/constantPoolKlass.hpp"
stefank@2314 32 #include "oops/instanceKlass.hpp"
stefank@2314 33 #include "oops/instanceOop.hpp"
stefank@2314 34 #include "oops/klassKlass.hpp"
stefank@2314 35 #include "oops/klassOop.hpp"
stefank@2314 36 #include "oops/methodKlass.hpp"
stefank@2314 37 #include "oops/objArrayKlass.hpp"
stefank@2314 38 #include "oops/oop.inline.hpp"
stefank@2314 39 #include "oops/oop.inline2.hpp"
coleenp@2497 40 #include "oops/symbol.hpp"
stefank@2314 41 #include "oops/typeArrayKlass.hpp"
stefank@2314 42 #include "runtime/handles.inline.hpp"
stefank@2314 43 #ifndef SERIALGC
never@2658 44 #include "gc_implementation/parNew/parOopClosures.inline.hpp"
never@2658 45 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp"
never@2658 46 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp"
never@2658 47 #include "memory/cardTableRS.hpp"
stefank@2314 48 #include "oops/oop.pcgc.inline.hpp"
stefank@2314 49 #endif
duke@435 50
duke@435 51 int klassKlass::oop_size(oop obj) const {
duke@435 52 assert (obj->is_klass(), "must be a klassOop");
duke@435 53 return klassOop(obj)->klass_part()->klass_oop_size();
duke@435 54 }
duke@435 55
duke@435 56 klassOop klassKlass::create_klass(TRAPS) {
duke@435 57 KlassHandle h_this_klass;
duke@435 58 klassKlass o;
duke@435 59 // for bootstrapping, handles may not be available yet.
duke@435 60 klassOop k = base_create_klass_oop(h_this_klass, header_size(), o.vtbl_value(), CHECK_NULL);
duke@435 61 k->set_klass(k); // point to thyself
duke@435 62 // Do not try to allocate mirror, java.lang.Class not loaded at this point.
duke@435 63 // See Universe::fixup_mirrors()
duke@435 64 return k;
duke@435 65 }
duke@435 66
duke@435 67 void klassKlass::oop_follow_contents(oop obj) {
duke@435 68 Klass* k = Klass::cast(klassOop(obj));
duke@435 69 // If we are alive it is valid to keep our superclass and subtype caches alive
duke@435 70 MarkSweep::mark_and_push(k->adr_super());
duke@435 71 for (juint i = 0; i < Klass::primary_super_limit(); i++)
duke@435 72 MarkSweep::mark_and_push(k->adr_primary_supers()+i);
duke@435 73 MarkSweep::mark_and_push(k->adr_secondary_super_cache());
duke@435 74 MarkSweep::mark_and_push(k->adr_secondary_supers());
duke@435 75 MarkSweep::mark_and_push(k->adr_java_mirror());
duke@435 76 // We follow the subklass and sibling links at the end of the
duke@435 77 // marking phase, since otherwise following them will prevent
duke@435 78 // class unloading (all classes are transitively linked from
duke@435 79 // java.lang.Object).
duke@435 80 MarkSweep::revisit_weak_klass_link(k);
duke@435 81 obj->follow_header();
duke@435 82 }
duke@435 83
duke@435 84 #ifndef SERIALGC
duke@435 85 void klassKlass::oop_follow_contents(ParCompactionManager* cm,
duke@435 86 oop obj) {
duke@435 87 Klass* k = Klass::cast(klassOop(obj));
duke@435 88 // If we are alive it is valid to keep our superclass and subtype caches alive
duke@435 89 PSParallelCompact::mark_and_push(cm, k->adr_super());
duke@435 90 for (juint i = 0; i < Klass::primary_super_limit(); i++)
duke@435 91 PSParallelCompact::mark_and_push(cm, k->adr_primary_supers()+i);
duke@435 92 PSParallelCompact::mark_and_push(cm, k->adr_secondary_super_cache());
duke@435 93 PSParallelCompact::mark_and_push(cm, k->adr_secondary_supers());
duke@435 94 PSParallelCompact::mark_and_push(cm, k->adr_java_mirror());
duke@435 95 // We follow the subklass and sibling links at the end of the
duke@435 96 // marking phase, since otherwise following them will prevent
duke@435 97 // class unloading (all classes are transitively linked from
duke@435 98 // java.lang.Object).
duke@435 99 PSParallelCompact::revisit_weak_klass_link(cm, k);
duke@435 100 obj->follow_header(cm);
duke@435 101 }
duke@435 102 #endif // SERIALGC
duke@435 103
duke@435 104 int klassKlass::oop_oop_iterate(oop obj, OopClosure* blk) {
duke@435 105 // Get size before changing pointers
duke@435 106 int size = oop_size(obj);
duke@435 107 Klass* k = Klass::cast(klassOop(obj));
duke@435 108 blk->do_oop(k->adr_super());
duke@435 109 for (juint i = 0; i < Klass::primary_super_limit(); i++)
duke@435 110 blk->do_oop(k->adr_primary_supers()+i);
duke@435 111 blk->do_oop(k->adr_secondary_super_cache());
duke@435 112 blk->do_oop(k->adr_secondary_supers());
duke@435 113 blk->do_oop(k->adr_java_mirror());
duke@435 114 // The following are in the perm gen and are treated
duke@435 115 // specially in a later phase of a perm gen collection; ...
duke@435 116 assert(oop(k)->is_perm(), "should be in perm");
duke@435 117 assert(oop(k->subklass())->is_perm_or_null(), "should be in perm");
duke@435 118 assert(oop(k->next_sibling())->is_perm_or_null(), "should be in perm");
duke@435 119 // ... don't scan them normally, but remember this klassKlass
duke@435 120 // for later (see, for instance, oop_follow_contents above
duke@435 121 // for what MarkSweep does with it.
duke@435 122 if (blk->should_remember_klasses()) {
duke@435 123 blk->remember_klass(k);
duke@435 124 }
duke@435 125 obj->oop_iterate_header(blk);
duke@435 126 return size;
duke@435 127 }
duke@435 128
duke@435 129
duke@435 130 int klassKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) {
duke@435 131 // Get size before changing pointers
duke@435 132 int size = oop_size(obj);
duke@435 133 Klass* k = Klass::cast(klassOop(obj));
duke@435 134 oop* adr;
duke@435 135 adr = k->adr_super();
duke@435 136 if (mr.contains(adr)) blk->do_oop(adr);
duke@435 137 for (juint i = 0; i < Klass::primary_super_limit(); i++) {
duke@435 138 adr = k->adr_primary_supers()+i;
duke@435 139 if (mr.contains(adr)) blk->do_oop(adr);
duke@435 140 }
duke@435 141 adr = k->adr_secondary_super_cache();
duke@435 142 if (mr.contains(adr)) blk->do_oop(adr);
duke@435 143 adr = k->adr_secondary_supers();
duke@435 144 if (mr.contains(adr)) blk->do_oop(adr);
duke@435 145 adr = k->adr_java_mirror();
duke@435 146 if (mr.contains(adr)) blk->do_oop(adr);
duke@435 147 // The following are "weak links" in the perm gen and are
duke@435 148 // treated specially in a later phase of a perm gen collection.
duke@435 149 assert(oop(k)->is_perm(), "should be in perm");
duke@435 150 assert(oop(k->adr_subklass())->is_perm(), "should be in perm");
duke@435 151 assert(oop(k->adr_next_sibling())->is_perm(), "should be in perm");
duke@435 152 if (blk->should_remember_klasses()
duke@435 153 && (mr.contains(k->adr_subklass())
duke@435 154 || mr.contains(k->adr_next_sibling()))) {
duke@435 155 blk->remember_klass(k);
duke@435 156 }
duke@435 157 obj->oop_iterate_header(blk, mr);
duke@435 158 return size;
duke@435 159 }
duke@435 160
duke@435 161
duke@435 162 int klassKlass::oop_adjust_pointers(oop obj) {
duke@435 163 // Get size before changing pointers
duke@435 164 int size = oop_size(obj);
duke@435 165 obj->adjust_header();
duke@435 166
duke@435 167 Klass* k = Klass::cast(klassOop(obj));
duke@435 168
duke@435 169 MarkSweep::adjust_pointer(k->adr_super());
duke@435 170 for (juint i = 0; i < Klass::primary_super_limit(); i++)
duke@435 171 MarkSweep::adjust_pointer(k->adr_primary_supers()+i);
duke@435 172 MarkSweep::adjust_pointer(k->adr_secondary_super_cache());
duke@435 173 MarkSweep::adjust_pointer(k->adr_secondary_supers());
duke@435 174 MarkSweep::adjust_pointer(k->adr_java_mirror());
duke@435 175 MarkSweep::adjust_pointer(k->adr_subklass());
duke@435 176 MarkSweep::adjust_pointer(k->adr_next_sibling());
duke@435 177 return size;
duke@435 178 }
duke@435 179
duke@435 180 #ifndef SERIALGC
duke@435 181 void klassKlass::oop_push_contents(PSPromotionManager* pm, oop obj) {
never@2658 182 Klass* k = Klass::cast(klassOop(obj));
never@2658 183
never@2658 184 oop* p = k->adr_java_mirror();
never@2658 185 if (PSScavenge::should_scavenge(p)) {
never@2658 186 pm->claim_or_forward_depth(p);
never@2658 187 }
duke@435 188 }
duke@435 189
duke@435 190 int klassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) {
duke@435 191 Klass* k = Klass::cast(klassOop(obj));
duke@435 192
duke@435 193 oop* const beg_oop = k->oop_block_beg();
duke@435 194 oop* const end_oop = k->oop_block_end();
duke@435 195 for (oop* cur_oop = beg_oop; cur_oop < end_oop; ++cur_oop) {
duke@435 196 PSParallelCompact::adjust_pointer(cur_oop);
duke@435 197 }
duke@435 198
duke@435 199 return oop_size(obj);
duke@435 200 }
duke@435 201 #endif // SERIALGC
duke@435 202
duke@435 203
duke@435 204 // Printing
duke@435 205
duke@435 206 void klassKlass::oop_print_on(oop obj, outputStream* st) {
duke@435 207 Klass::oop_print_on(obj, st);
duke@435 208 }
duke@435 209
duke@435 210 void klassKlass::oop_print_value_on(oop obj, outputStream* st) {
duke@435 211 Klass::oop_print_value_on(obj, st);
duke@435 212 }
duke@435 213
duke@435 214 const char* klassKlass::internal_name() const {
duke@435 215 return "{other class}";
duke@435 216 }
duke@435 217
duke@435 218
duke@435 219 // Verification
duke@435 220
duke@435 221 void klassKlass::oop_verify_on(oop obj, outputStream* st) {
duke@435 222 Klass::oop_verify_on(obj, st);
duke@435 223 guarantee(obj->is_perm(), "should be in permspace");
duke@435 224 guarantee(obj->is_klass(), "should be klass");
duke@435 225
duke@435 226 Klass* k = Klass::cast(klassOop(obj));
duke@435 227 if (k->super() != NULL) {
duke@435 228 guarantee(k->super()->is_perm(), "should be in permspace");
duke@435 229 guarantee(k->super()->is_klass(), "should be klass");
duke@435 230 }
duke@435 231 klassOop ko = k->secondary_super_cache();
duke@435 232 if( ko != NULL ) {
duke@435 233 guarantee(ko->is_perm(), "should be in permspace");
duke@435 234 guarantee(ko->is_klass(), "should be klass");
duke@435 235 }
duke@435 236 for( uint i = 0; i < primary_super_limit(); i++ ) {
duke@435 237 oop ko = k->adr_primary_supers()[i]; // Cannot use normal accessor because it asserts
duke@435 238 if( ko != NULL ) {
duke@435 239 guarantee(ko->is_perm(), "should be in permspace");
duke@435 240 guarantee(ko->is_klass(), "should be klass");
duke@435 241 }
duke@435 242 }
duke@435 243
duke@435 244 if (k->java_mirror() != NULL || (k->oop_is_instance() && instanceKlass::cast(klassOop(obj))->is_loaded())) {
duke@435 245 guarantee(k->java_mirror() != NULL, "should be allocated");
never@2658 246 guarantee(k->java_mirror()->is_perm() || !JavaObjectsInPerm, "should be in permspace");
duke@435 247 guarantee(k->java_mirror()->is_instance(), "should be instance");
duke@435 248 }
duke@435 249 }

mercurial