Mon, 09 Jun 2008 11:51:19 -0400
6687581: Make CMS work with compressed oops
Summary: Make FreeChunk read markword instead of LSB in _klass pointer to indicate that it's a FreeChunk for compressed oops.
Reviewed-by: ysr, jmasa
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1997-2006 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_klassKlass.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | int klassKlass::oop_size(oop obj) const { |
duke@435 | 29 | assert (obj->is_klass(), "must be a klassOop"); |
duke@435 | 30 | return klassOop(obj)->klass_part()->klass_oop_size(); |
duke@435 | 31 | } |
duke@435 | 32 | |
duke@435 | 33 | klassOop klassKlass::create_klass(TRAPS) { |
duke@435 | 34 | KlassHandle h_this_klass; |
duke@435 | 35 | klassKlass o; |
duke@435 | 36 | // for bootstrapping, handles may not be available yet. |
duke@435 | 37 | klassOop k = base_create_klass_oop(h_this_klass, header_size(), o.vtbl_value(), CHECK_NULL); |
duke@435 | 38 | k->set_klass(k); // point to thyself |
duke@435 | 39 | // Do not try to allocate mirror, java.lang.Class not loaded at this point. |
duke@435 | 40 | // See Universe::fixup_mirrors() |
duke@435 | 41 | return k; |
duke@435 | 42 | } |
duke@435 | 43 | |
duke@435 | 44 | void klassKlass::oop_follow_contents(oop obj) { |
duke@435 | 45 | Klass* k = Klass::cast(klassOop(obj)); |
duke@435 | 46 | // If we are alive it is valid to keep our superclass and subtype caches alive |
duke@435 | 47 | MarkSweep::mark_and_push(k->adr_super()); |
duke@435 | 48 | for (juint i = 0; i < Klass::primary_super_limit(); i++) |
duke@435 | 49 | MarkSweep::mark_and_push(k->adr_primary_supers()+i); |
duke@435 | 50 | MarkSweep::mark_and_push(k->adr_secondary_super_cache()); |
duke@435 | 51 | MarkSweep::mark_and_push(k->adr_secondary_supers()); |
duke@435 | 52 | MarkSweep::mark_and_push(k->adr_java_mirror()); |
duke@435 | 53 | MarkSweep::mark_and_push(k->adr_name()); |
duke@435 | 54 | // We follow the subklass and sibling links at the end of the |
duke@435 | 55 | // marking phase, since otherwise following them will prevent |
duke@435 | 56 | // class unloading (all classes are transitively linked from |
duke@435 | 57 | // java.lang.Object). |
duke@435 | 58 | MarkSweep::revisit_weak_klass_link(k); |
duke@435 | 59 | obj->follow_header(); |
duke@435 | 60 | } |
duke@435 | 61 | |
duke@435 | 62 | #ifndef SERIALGC |
duke@435 | 63 | void klassKlass::oop_follow_contents(ParCompactionManager* cm, |
duke@435 | 64 | oop obj) { |
duke@435 | 65 | Klass* k = Klass::cast(klassOop(obj)); |
duke@435 | 66 | // If we are alive it is valid to keep our superclass and subtype caches alive |
duke@435 | 67 | PSParallelCompact::mark_and_push(cm, k->adr_super()); |
duke@435 | 68 | for (juint i = 0; i < Klass::primary_super_limit(); i++) |
duke@435 | 69 | PSParallelCompact::mark_and_push(cm, k->adr_primary_supers()+i); |
duke@435 | 70 | PSParallelCompact::mark_and_push(cm, k->adr_secondary_super_cache()); |
duke@435 | 71 | PSParallelCompact::mark_and_push(cm, k->adr_secondary_supers()); |
duke@435 | 72 | PSParallelCompact::mark_and_push(cm, k->adr_java_mirror()); |
duke@435 | 73 | PSParallelCompact::mark_and_push(cm, k->adr_name()); |
duke@435 | 74 | // We follow the subklass and sibling links at the end of the |
duke@435 | 75 | // marking phase, since otherwise following them will prevent |
duke@435 | 76 | // class unloading (all classes are transitively linked from |
duke@435 | 77 | // java.lang.Object). |
duke@435 | 78 | PSParallelCompact::revisit_weak_klass_link(cm, k); |
duke@435 | 79 | obj->follow_header(cm); |
duke@435 | 80 | } |
duke@435 | 81 | #endif // SERIALGC |
duke@435 | 82 | |
duke@435 | 83 | int klassKlass::oop_oop_iterate(oop obj, OopClosure* blk) { |
duke@435 | 84 | // Get size before changing pointers |
duke@435 | 85 | int size = oop_size(obj); |
duke@435 | 86 | Klass* k = Klass::cast(klassOop(obj)); |
duke@435 | 87 | blk->do_oop(k->adr_super()); |
duke@435 | 88 | for (juint i = 0; i < Klass::primary_super_limit(); i++) |
duke@435 | 89 | blk->do_oop(k->adr_primary_supers()+i); |
duke@435 | 90 | blk->do_oop(k->adr_secondary_super_cache()); |
duke@435 | 91 | blk->do_oop(k->adr_secondary_supers()); |
duke@435 | 92 | blk->do_oop(k->adr_java_mirror()); |
duke@435 | 93 | blk->do_oop(k->adr_name()); |
duke@435 | 94 | // The following are in the perm gen and are treated |
duke@435 | 95 | // specially in a later phase of a perm gen collection; ... |
duke@435 | 96 | assert(oop(k)->is_perm(), "should be in perm"); |
duke@435 | 97 | assert(oop(k->subklass())->is_perm_or_null(), "should be in perm"); |
duke@435 | 98 | assert(oop(k->next_sibling())->is_perm_or_null(), "should be in perm"); |
duke@435 | 99 | // ... don't scan them normally, but remember this klassKlass |
duke@435 | 100 | // for later (see, for instance, oop_follow_contents above |
duke@435 | 101 | // for what MarkSweep does with it. |
duke@435 | 102 | if (blk->should_remember_klasses()) { |
duke@435 | 103 | blk->remember_klass(k); |
duke@435 | 104 | } |
duke@435 | 105 | obj->oop_iterate_header(blk); |
duke@435 | 106 | return size; |
duke@435 | 107 | } |
duke@435 | 108 | |
duke@435 | 109 | |
duke@435 | 110 | int klassKlass::oop_oop_iterate_m(oop obj, OopClosure* blk, MemRegion mr) { |
duke@435 | 111 | // Get size before changing pointers |
duke@435 | 112 | int size = oop_size(obj); |
duke@435 | 113 | Klass* k = Klass::cast(klassOop(obj)); |
duke@435 | 114 | oop* adr; |
duke@435 | 115 | adr = k->adr_super(); |
duke@435 | 116 | if (mr.contains(adr)) blk->do_oop(adr); |
duke@435 | 117 | for (juint i = 0; i < Klass::primary_super_limit(); i++) { |
duke@435 | 118 | adr = k->adr_primary_supers()+i; |
duke@435 | 119 | if (mr.contains(adr)) blk->do_oop(adr); |
duke@435 | 120 | } |
duke@435 | 121 | adr = k->adr_secondary_super_cache(); |
duke@435 | 122 | if (mr.contains(adr)) blk->do_oop(adr); |
duke@435 | 123 | adr = k->adr_secondary_supers(); |
duke@435 | 124 | if (mr.contains(adr)) blk->do_oop(adr); |
duke@435 | 125 | adr = k->adr_java_mirror(); |
duke@435 | 126 | if (mr.contains(adr)) blk->do_oop(adr); |
duke@435 | 127 | adr = k->adr_name(); |
duke@435 | 128 | if (mr.contains(adr)) blk->do_oop(adr); |
duke@435 | 129 | // The following are "weak links" in the perm gen and are |
duke@435 | 130 | // treated specially in a later phase of a perm gen collection. |
duke@435 | 131 | assert(oop(k)->is_perm(), "should be in perm"); |
duke@435 | 132 | assert(oop(k->adr_subklass())->is_perm(), "should be in perm"); |
duke@435 | 133 | assert(oop(k->adr_next_sibling())->is_perm(), "should be in perm"); |
duke@435 | 134 | if (blk->should_remember_klasses() |
duke@435 | 135 | && (mr.contains(k->adr_subklass()) |
duke@435 | 136 | || mr.contains(k->adr_next_sibling()))) { |
duke@435 | 137 | blk->remember_klass(k); |
duke@435 | 138 | } |
duke@435 | 139 | obj->oop_iterate_header(blk, mr); |
duke@435 | 140 | return size; |
duke@435 | 141 | } |
duke@435 | 142 | |
duke@435 | 143 | |
duke@435 | 144 | int klassKlass::oop_adjust_pointers(oop obj) { |
duke@435 | 145 | // Get size before changing pointers |
duke@435 | 146 | int size = oop_size(obj); |
duke@435 | 147 | obj->adjust_header(); |
duke@435 | 148 | |
duke@435 | 149 | Klass* k = Klass::cast(klassOop(obj)); |
duke@435 | 150 | |
duke@435 | 151 | MarkSweep::adjust_pointer(k->adr_super()); |
duke@435 | 152 | for (juint i = 0; i < Klass::primary_super_limit(); i++) |
duke@435 | 153 | MarkSweep::adjust_pointer(k->adr_primary_supers()+i); |
duke@435 | 154 | MarkSweep::adjust_pointer(k->adr_secondary_super_cache()); |
duke@435 | 155 | MarkSweep::adjust_pointer(k->adr_secondary_supers()); |
duke@435 | 156 | MarkSweep::adjust_pointer(k->adr_java_mirror()); |
duke@435 | 157 | MarkSweep::adjust_pointer(k->adr_name()); |
duke@435 | 158 | MarkSweep::adjust_pointer(k->adr_subklass()); |
duke@435 | 159 | MarkSweep::adjust_pointer(k->adr_next_sibling()); |
duke@435 | 160 | return size; |
duke@435 | 161 | } |
duke@435 | 162 | |
duke@435 | 163 | #ifndef SERIALGC |
duke@435 | 164 | void klassKlass::oop_copy_contents(PSPromotionManager* pm, oop obj) { |
duke@435 | 165 | } |
duke@435 | 166 | |
duke@435 | 167 | void klassKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { |
duke@435 | 168 | } |
duke@435 | 169 | |
duke@435 | 170 | int klassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { |
duke@435 | 171 | Klass* k = Klass::cast(klassOop(obj)); |
duke@435 | 172 | |
duke@435 | 173 | oop* const beg_oop = k->oop_block_beg(); |
duke@435 | 174 | oop* const end_oop = k->oop_block_end(); |
duke@435 | 175 | for (oop* cur_oop = beg_oop; cur_oop < end_oop; ++cur_oop) { |
duke@435 | 176 | PSParallelCompact::adjust_pointer(cur_oop); |
duke@435 | 177 | } |
duke@435 | 178 | |
duke@435 | 179 | return oop_size(obj); |
duke@435 | 180 | } |
duke@435 | 181 | |
duke@435 | 182 | int klassKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, |
duke@435 | 183 | HeapWord* beg_addr, HeapWord* end_addr) { |
duke@435 | 184 | Klass* k = Klass::cast(klassOop(obj)); |
duke@435 | 185 | |
duke@435 | 186 | oop* const beg_oop = MAX2((oop*)beg_addr, k->oop_block_beg()); |
duke@435 | 187 | oop* const end_oop = MIN2((oop*)end_addr, k->oop_block_end()); |
duke@435 | 188 | for (oop* cur_oop = beg_oop; cur_oop < end_oop; ++cur_oop) { |
duke@435 | 189 | PSParallelCompact::adjust_pointer(cur_oop); |
duke@435 | 190 | } |
duke@435 | 191 | |
duke@435 | 192 | return oop_size(obj); |
duke@435 | 193 | } |
duke@435 | 194 | #endif // SERIALGC |
duke@435 | 195 | |
duke@435 | 196 | |
duke@435 | 197 | #ifndef PRODUCT |
duke@435 | 198 | |
duke@435 | 199 | // Printing |
duke@435 | 200 | |
duke@435 | 201 | void klassKlass::oop_print_on(oop obj, outputStream* st) { |
duke@435 | 202 | Klass::oop_print_on(obj, st); |
duke@435 | 203 | } |
duke@435 | 204 | |
duke@435 | 205 | |
duke@435 | 206 | void klassKlass::oop_print_value_on(oop obj, outputStream* st) { |
duke@435 | 207 | Klass::oop_print_value_on(obj, st); |
duke@435 | 208 | } |
duke@435 | 209 | |
duke@435 | 210 | #endif |
duke@435 | 211 | |
duke@435 | 212 | const char* klassKlass::internal_name() const { |
duke@435 | 213 | return "{other class}"; |
duke@435 | 214 | } |
duke@435 | 215 | |
duke@435 | 216 | |
duke@435 | 217 | // Verification |
duke@435 | 218 | |
duke@435 | 219 | void klassKlass::oop_verify_on(oop obj, outputStream* st) { |
duke@435 | 220 | Klass::oop_verify_on(obj, st); |
duke@435 | 221 | guarantee(obj->is_perm(), "should be in permspace"); |
duke@435 | 222 | guarantee(obj->is_klass(), "should be klass"); |
duke@435 | 223 | |
duke@435 | 224 | Klass* k = Klass::cast(klassOop(obj)); |
duke@435 | 225 | if (k->super() != NULL) { |
duke@435 | 226 | guarantee(k->super()->is_perm(), "should be in permspace"); |
duke@435 | 227 | guarantee(k->super()->is_klass(), "should be klass"); |
duke@435 | 228 | } |
duke@435 | 229 | klassOop ko = k->secondary_super_cache(); |
duke@435 | 230 | if( ko != NULL ) { |
duke@435 | 231 | guarantee(ko->is_perm(), "should be in permspace"); |
duke@435 | 232 | guarantee(ko->is_klass(), "should be klass"); |
duke@435 | 233 | } |
duke@435 | 234 | for( uint i = 0; i < primary_super_limit(); i++ ) { |
duke@435 | 235 | oop ko = k->adr_primary_supers()[i]; // Cannot use normal accessor because it asserts |
duke@435 | 236 | if( ko != NULL ) { |
duke@435 | 237 | guarantee(ko->is_perm(), "should be in permspace"); |
duke@435 | 238 | guarantee(ko->is_klass(), "should be klass"); |
duke@435 | 239 | } |
duke@435 | 240 | } |
duke@435 | 241 | |
duke@435 | 242 | if (k->java_mirror() != NULL || (k->oop_is_instance() && instanceKlass::cast(klassOop(obj))->is_loaded())) { |
duke@435 | 243 | guarantee(k->java_mirror() != NULL, "should be allocated"); |
duke@435 | 244 | guarantee(k->java_mirror()->is_perm(), "should be in permspace"); |
duke@435 | 245 | guarantee(k->java_mirror()->is_instance(), "should be instance"); |
duke@435 | 246 | } |
duke@435 | 247 | if (k->name() != NULL) { |
duke@435 | 248 | guarantee(Universe::heap()->is_in_permanent(k->name()), |
duke@435 | 249 | "should be in permspace"); |
duke@435 | 250 | guarantee(k->name()->is_symbol(), "should be symbol"); |
duke@435 | 251 | } |
duke@435 | 252 | } |