Thu, 31 Mar 2011 14:00:41 -0700
7032129: Native memory usage grow unexpectedly for vm/oom/*InternedString tests
Reviewed-by: kvn, kamg, jcoomes
duke@435 | 1 | /* |
never@2700 | 2 | * Copyright (c) 2003, 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 "classfile/javaClasses.hpp" |
stefank@2314 | 27 | #include "classfile/loaderConstraints.hpp" |
stefank@2314 | 28 | #include "classfile/symbolTable.hpp" |
stefank@2314 | 29 | #include "classfile/systemDictionary.hpp" |
stefank@2314 | 30 | #include "gc_implementation/shared/spaceDecorator.hpp" |
stefank@2314 | 31 | #include "memory/classify.hpp" |
stefank@2314 | 32 | #include "memory/filemap.hpp" |
stefank@2314 | 33 | #include "memory/oopFactory.hpp" |
stefank@2314 | 34 | #include "memory/resourceArea.hpp" |
stefank@2314 | 35 | #include "oops/methodDataOop.hpp" |
stefank@2314 | 36 | #include "oops/oop.inline.hpp" |
stefank@2314 | 37 | #include "runtime/javaCalls.hpp" |
stefank@2314 | 38 | #include "runtime/signature.hpp" |
stefank@2314 | 39 | #include "runtime/vmThread.hpp" |
stefank@2314 | 40 | #include "runtime/vm_operations.hpp" |
stefank@2314 | 41 | #include "utilities/copy.hpp" |
duke@435 | 42 | |
duke@435 | 43 | |
duke@435 | 44 | // Closure to set up the fingerprint field for all methods. |
duke@435 | 45 | |
duke@435 | 46 | class FingerprintMethodsClosure: public ObjectClosure { |
duke@435 | 47 | public: |
duke@435 | 48 | void do_object(oop obj) { |
duke@435 | 49 | if (obj->is_method()) { |
duke@435 | 50 | methodOop mobj = (methodOop)obj; |
duke@435 | 51 | ResourceMark rm; |
duke@435 | 52 | (new Fingerprinter(mobj))->fingerprint(); |
duke@435 | 53 | } |
duke@435 | 54 | } |
duke@435 | 55 | }; |
duke@435 | 56 | |
duke@435 | 57 | |
duke@435 | 58 | |
duke@435 | 59 | // Closure to set the hash value (String.hash field) in all of the |
duke@435 | 60 | // String objects in the heap. Setting the hash value is not required. |
duke@435 | 61 | // However, setting the value in advance prevents the value from being |
duke@435 | 62 | // written later, increasing the likelihood that the shared page contain |
duke@435 | 63 | // the hash can be shared. |
duke@435 | 64 | // |
duke@435 | 65 | // NOTE THAT the algorithm in StringTable::hash_string() MUST MATCH the |
duke@435 | 66 | // algorithm in java.lang.String.hashCode(). |
duke@435 | 67 | |
duke@435 | 68 | class StringHashCodeClosure: public OopClosure { |
duke@435 | 69 | private: |
duke@435 | 70 | Thread* THREAD; |
duke@435 | 71 | int hash_offset; |
duke@435 | 72 | public: |
duke@435 | 73 | StringHashCodeClosure(Thread* t) { |
duke@435 | 74 | THREAD = t; |
duke@435 | 75 | hash_offset = java_lang_String::hash_offset_in_bytes(); |
duke@435 | 76 | } |
duke@435 | 77 | |
coleenp@548 | 78 | void do_oop(oop* p) { |
coleenp@548 | 79 | if (p != NULL) { |
coleenp@548 | 80 | oop obj = *p; |
never@1577 | 81 | if (obj->klass() == SystemDictionary::String_klass()) { |
duke@435 | 82 | |
never@2700 | 83 | int hash = java_lang_String::hash_string(obj); |
duke@435 | 84 | obj->int_field_put(hash_offset, hash); |
duke@435 | 85 | } |
duke@435 | 86 | } |
duke@435 | 87 | } |
coleenp@548 | 88 | void do_oop(narrowOop* p) { ShouldNotReachHere(); } |
duke@435 | 89 | }; |
duke@435 | 90 | |
duke@435 | 91 | |
duke@435 | 92 | // Remove data from objects which should not appear in the shared file |
duke@435 | 93 | // (as it pertains only to the current JVM). |
duke@435 | 94 | |
duke@435 | 95 | class RemoveUnshareableInfoClosure : public ObjectClosure { |
duke@435 | 96 | public: |
duke@435 | 97 | void do_object(oop obj) { |
duke@435 | 98 | // Zap data from the objects which is pertains only to this JVM. We |
duke@435 | 99 | // want that data recreated in new JVMs when the shared file is used. |
duke@435 | 100 | if (obj->is_method()) { |
duke@435 | 101 | ((methodOop)obj)->remove_unshareable_info(); |
duke@435 | 102 | } |
duke@435 | 103 | else if (obj->is_klass()) { |
duke@435 | 104 | Klass::cast((klassOop)obj)->remove_unshareable_info(); |
duke@435 | 105 | } |
duke@435 | 106 | |
duke@435 | 107 | // Don't save compiler related special oops (shouldn't be any yet). |
duke@435 | 108 | if (obj->is_methodData() || obj->is_compiledICHolder()) { |
duke@435 | 109 | ShouldNotReachHere(); |
duke@435 | 110 | } |
duke@435 | 111 | } |
duke@435 | 112 | }; |
duke@435 | 113 | |
duke@435 | 114 | |
duke@435 | 115 | static bool mark_object(oop obj) { |
duke@435 | 116 | if (obj != NULL && |
duke@435 | 117 | !obj->is_shared() && |
duke@435 | 118 | !obj->is_forwarded() && |
duke@435 | 119 | !obj->is_gc_marked()) { |
duke@435 | 120 | obj->set_mark(markOopDesc::prototype()->set_marked()); |
duke@435 | 121 | return true; |
duke@435 | 122 | } |
duke@435 | 123 | |
duke@435 | 124 | return false; |
duke@435 | 125 | } |
duke@435 | 126 | |
coleenp@2497 | 127 | |
coleenp@2497 | 128 | class MoveSymbols : public SymbolClosure { |
coleenp@2497 | 129 | private: |
coleenp@2497 | 130 | char* _start; |
coleenp@2497 | 131 | char* _end; |
coleenp@2497 | 132 | char* _top; |
coleenp@2497 | 133 | int _count; |
coleenp@2497 | 134 | |
coleenp@2497 | 135 | bool in_shared_space(Symbol* sym) const { |
coleenp@2497 | 136 | return (char*)sym >= _start && (char*)sym < _end; |
coleenp@2497 | 137 | } |
coleenp@2497 | 138 | |
coleenp@2497 | 139 | Symbol* get_shared_copy(Symbol* sym) { |
coleenp@2497 | 140 | return sym->refcount() > 0 ? NULL : (Symbol*)(_start - sym->refcount()); |
coleenp@2497 | 141 | } |
coleenp@2497 | 142 | |
coleenp@2497 | 143 | Symbol* make_shared_copy(Symbol* sym) { |
coleenp@2497 | 144 | Symbol* new_sym = (Symbol*)_top; |
coleenp@2497 | 145 | int size = sym->object_size(); |
coleenp@2497 | 146 | _top += size * HeapWordSize; |
coleenp@2497 | 147 | if (_top <= _end) { |
coleenp@2497 | 148 | Copy::disjoint_words((HeapWord*)sym, (HeapWord*)new_sym, size); |
coleenp@2497 | 149 | // Encode a reference to the copy as a negative distance from _start |
coleenp@2497 | 150 | // When a symbol is being copied to a shared space |
coleenp@2497 | 151 | // during CDS archive creation, the original symbol is marked |
coleenp@2497 | 152 | // as relocated by putting a negative value to its _refcount field, |
coleenp@2497 | 153 | // This value is also used to find where exactly the shared copy is |
coleenp@2497 | 154 | // (see MoveSymbols::get_shared_copy), so that the other references |
coleenp@2497 | 155 | // to this symbol could be changed to point to the shared copy. |
coleenp@2497 | 156 | sym->_refcount = (int)(_start - (char*)new_sym); |
coleenp@2497 | 157 | // Mark the symbol in the shared archive as immortal so it is read only |
coleenp@2497 | 158 | // and not refcounted. |
coleenp@2497 | 159 | new_sym->_refcount = -1; |
coleenp@2497 | 160 | _count++; |
coleenp@2497 | 161 | } else { |
coleenp@2497 | 162 | report_out_of_shared_space(SharedMiscData); |
coleenp@2497 | 163 | } |
coleenp@2497 | 164 | return new_sym; |
coleenp@2497 | 165 | } |
coleenp@2497 | 166 | |
coleenp@2497 | 167 | public: |
coleenp@2497 | 168 | MoveSymbols(char* top, char* end) : |
coleenp@2497 | 169 | _start(top), _end(end), _top(top), _count(0) { } |
coleenp@2497 | 170 | |
coleenp@2497 | 171 | char* get_top() const { return _top; } |
coleenp@2497 | 172 | int count() const { return _count; } |
coleenp@2497 | 173 | |
coleenp@2497 | 174 | void do_symbol(Symbol** p) { |
coleenp@2497 | 175 | Symbol* sym = load_symbol(p); |
coleenp@2497 | 176 | if (sym != NULL && !in_shared_space(sym)) { |
coleenp@2497 | 177 | Symbol* new_sym = get_shared_copy(sym); |
coleenp@2497 | 178 | if (new_sym == NULL) { |
coleenp@2497 | 179 | // The symbol has not been relocated yet; copy it to _top address |
coleenp@2497 | 180 | assert(sym->refcount() > 0, "should have positive reference count"); |
coleenp@2497 | 181 | new_sym = make_shared_copy(sym); |
coleenp@2497 | 182 | } |
coleenp@2497 | 183 | // Make the reference point to the shared copy of the symbol |
coleenp@2497 | 184 | store_symbol(p, new_sym); |
coleenp@2497 | 185 | } |
coleenp@2497 | 186 | } |
coleenp@2497 | 187 | }; |
coleenp@2497 | 188 | |
coleenp@2497 | 189 | |
duke@435 | 190 | // Closure: mark objects closure. |
duke@435 | 191 | |
duke@435 | 192 | class MarkObjectsOopClosure : public OopClosure { |
duke@435 | 193 | public: |
coleenp@548 | 194 | void do_oop(oop* p) { mark_object(*p); } |
coleenp@548 | 195 | void do_oop(narrowOop* p) { ShouldNotReachHere(); } |
duke@435 | 196 | }; |
duke@435 | 197 | |
duke@435 | 198 | |
duke@435 | 199 | class MarkObjectsSkippingKlassesOopClosure : public OopClosure { |
duke@435 | 200 | public: |
duke@435 | 201 | void do_oop(oop* pobj) { |
duke@435 | 202 | oop obj = *pobj; |
duke@435 | 203 | if (obj != NULL && |
duke@435 | 204 | !obj->is_klass()) { |
duke@435 | 205 | mark_object(obj); |
duke@435 | 206 | } |
duke@435 | 207 | } |
coleenp@548 | 208 | void do_oop(narrowOop* pobj) { ShouldNotReachHere(); } |
duke@435 | 209 | }; |
duke@435 | 210 | |
duke@435 | 211 | |
duke@435 | 212 | static void mark_object_recursive_skipping_klasses(oop obj) { |
duke@435 | 213 | mark_object(obj); |
duke@435 | 214 | if (obj != NULL) { |
duke@435 | 215 | MarkObjectsSkippingKlassesOopClosure mark_all; |
duke@435 | 216 | obj->oop_iterate(&mark_all); |
duke@435 | 217 | } |
duke@435 | 218 | } |
duke@435 | 219 | |
duke@435 | 220 | |
coleenp@2497 | 221 | // Closure: mark common read-only objects |
duke@435 | 222 | |
duke@435 | 223 | class MarkCommonReadOnly : public ObjectClosure { |
duke@435 | 224 | private: |
duke@435 | 225 | MarkObjectsOopClosure mark_all; |
duke@435 | 226 | public: |
duke@435 | 227 | void do_object(oop obj) { |
duke@435 | 228 | |
duke@435 | 229 | // Mark all constMethod objects. |
duke@435 | 230 | |
duke@435 | 231 | if (obj->is_constMethod()) { |
duke@435 | 232 | mark_object(obj); |
duke@435 | 233 | mark_object(constMethodOop(obj)->stackmap_data()); |
duke@435 | 234 | // Exception tables are needed by ci code during compilation. |
duke@435 | 235 | mark_object(constMethodOop(obj)->exception_table()); |
duke@435 | 236 | } |
duke@435 | 237 | |
duke@435 | 238 | // Mark objects referenced by klass objects which are read-only. |
duke@435 | 239 | |
duke@435 | 240 | else if (obj->is_klass()) { |
duke@435 | 241 | Klass* k = Klass::cast((klassOop)obj); |
duke@435 | 242 | mark_object(k->secondary_supers()); |
duke@435 | 243 | |
duke@435 | 244 | // The METHODS() OBJARRAYS CANNOT BE MADE READ-ONLY, even though |
duke@435 | 245 | // it is never modified. Otherwise, they will be pre-marked; the |
duke@435 | 246 | // GC marking phase will skip them; and by skipping them will fail |
duke@435 | 247 | // to mark the methods objects referenced by the array. |
duke@435 | 248 | |
duke@435 | 249 | if (obj->blueprint()->oop_is_instanceKlass()) { |
duke@435 | 250 | instanceKlass* ik = instanceKlass::cast((klassOop)obj); |
duke@435 | 251 | mark_object(ik->method_ordering()); |
duke@435 | 252 | mark_object(ik->local_interfaces()); |
duke@435 | 253 | mark_object(ik->transitive_interfaces()); |
duke@435 | 254 | mark_object(ik->fields()); |
duke@435 | 255 | |
duke@435 | 256 | mark_object(ik->class_annotations()); |
duke@435 | 257 | |
duke@435 | 258 | mark_object_recursive_skipping_klasses(ik->fields_annotations()); |
duke@435 | 259 | mark_object_recursive_skipping_klasses(ik->methods_annotations()); |
duke@435 | 260 | mark_object_recursive_skipping_klasses(ik->methods_parameter_annotations()); |
duke@435 | 261 | mark_object_recursive_skipping_klasses(ik->methods_default_annotations()); |
duke@435 | 262 | |
duke@435 | 263 | typeArrayOop inner_classes = ik->inner_classes(); |
duke@435 | 264 | if (inner_classes != NULL) { |
duke@435 | 265 | mark_object(inner_classes); |
duke@435 | 266 | } |
duke@435 | 267 | } |
duke@435 | 268 | } |
duke@435 | 269 | } |
duke@435 | 270 | }; |
duke@435 | 271 | |
duke@435 | 272 | |
coleenp@2497 | 273 | // Closure: find symbol references in Java Heap objects |
duke@435 | 274 | |
coleenp@2497 | 275 | class CommonSymbolsClosure : public ObjectClosure { |
duke@435 | 276 | private: |
coleenp@2497 | 277 | SymbolClosure* _closure; |
duke@435 | 278 | public: |
coleenp@2497 | 279 | CommonSymbolsClosure(SymbolClosure* closure) : _closure(closure) { } |
coleenp@2497 | 280 | |
duke@435 | 281 | void do_object(oop obj) { |
duke@435 | 282 | |
coleenp@2497 | 283 | // Traverse symbols referenced by method objects. |
duke@435 | 284 | |
duke@435 | 285 | if (obj->is_method()) { |
duke@435 | 286 | methodOop m = methodOop(obj); |
coleenp@2497 | 287 | constantPoolOop constants = m->constants(); |
coleenp@2497 | 288 | _closure->do_symbol(constants->symbol_at_addr(m->name_index())); |
coleenp@2497 | 289 | _closure->do_symbol(constants->symbol_at_addr(m->signature_index())); |
duke@435 | 290 | } |
duke@435 | 291 | |
coleenp@2497 | 292 | // Traverse symbols referenced by klass objects which are read-only. |
duke@435 | 293 | |
duke@435 | 294 | else if (obj->is_klass()) { |
coleenp@2497 | 295 | Klass* k = Klass::cast((klassOop)obj); |
coleenp@2497 | 296 | k->shared_symbols_iterate(_closure); |
duke@435 | 297 | |
duke@435 | 298 | if (obj->blueprint()->oop_is_instanceKlass()) { |
duke@435 | 299 | instanceKlass* ik = instanceKlass::cast((klassOop)obj); |
duke@435 | 300 | typeArrayOop inner_classes = ik->inner_classes(); |
duke@435 | 301 | if (inner_classes != NULL) { |
coleenp@2497 | 302 | constantPoolOop constants = ik->constants(); |
coleenp@2497 | 303 | int n = inner_classes->length(); |
coleenp@2497 | 304 | for (int i = 0; i < n; i += instanceKlass::inner_class_next_offset) { |
duke@435 | 305 | int ioff = i + instanceKlass::inner_class_inner_name_offset; |
duke@435 | 306 | int index = inner_classes->ushort_at(ioff); |
duke@435 | 307 | if (index != 0) { |
coleenp@2497 | 308 | _closure->do_symbol(constants->symbol_at_addr(index)); |
duke@435 | 309 | } |
duke@435 | 310 | } |
duke@435 | 311 | } |
duke@435 | 312 | } |
duke@435 | 313 | } |
duke@435 | 314 | |
coleenp@2497 | 315 | // Traverse symbols referenced by other constantpool entries. |
duke@435 | 316 | |
coleenp@2497 | 317 | else if (obj->is_constantPool()) { |
coleenp@2497 | 318 | constantPoolOop(obj)->shared_symbols_iterate(_closure); |
duke@435 | 319 | } |
duke@435 | 320 | } |
duke@435 | 321 | }; |
duke@435 | 322 | |
duke@435 | 323 | |
duke@435 | 324 | // Closure: mark char arrays used by strings |
duke@435 | 325 | |
duke@435 | 326 | class MarkStringValues : public ObjectClosure { |
duke@435 | 327 | private: |
duke@435 | 328 | MarkObjectsOopClosure mark_all; |
duke@435 | 329 | public: |
duke@435 | 330 | void do_object(oop obj) { |
duke@435 | 331 | |
duke@435 | 332 | // Character arrays referenced by String objects are read-only. |
duke@435 | 333 | |
duke@435 | 334 | if (java_lang_String::is_instance(obj)) { |
duke@435 | 335 | mark_object(java_lang_String::value(obj)); |
duke@435 | 336 | } |
duke@435 | 337 | } |
duke@435 | 338 | }; |
duke@435 | 339 | |
duke@435 | 340 | |
duke@435 | 341 | #ifdef DEBUG |
duke@435 | 342 | // Closure: Check for objects left in the heap which have not been moved. |
duke@435 | 343 | |
duke@435 | 344 | class CheckRemainingObjects : public ObjectClosure { |
duke@435 | 345 | private: |
duke@435 | 346 | int count; |
duke@435 | 347 | |
duke@435 | 348 | public: |
duke@435 | 349 | CheckRemainingObjects() { |
duke@435 | 350 | count = 0; |
duke@435 | 351 | } |
duke@435 | 352 | |
duke@435 | 353 | void do_object(oop obj) { |
duke@435 | 354 | if (!obj->is_shared() && |
duke@435 | 355 | !obj->is_forwarded()) { |
duke@435 | 356 | ++count; |
duke@435 | 357 | if (Verbose) { |
duke@435 | 358 | tty->print("Unreferenced object: "); |
duke@435 | 359 | obj->print_on(tty); |
duke@435 | 360 | } |
duke@435 | 361 | } |
duke@435 | 362 | } |
duke@435 | 363 | |
duke@435 | 364 | void status() { |
duke@435 | 365 | tty->print_cr("%d objects no longer referenced, not shared.", count); |
duke@435 | 366 | } |
duke@435 | 367 | }; |
duke@435 | 368 | #endif |
duke@435 | 369 | |
duke@435 | 370 | |
duke@435 | 371 | // Closure: Mark remaining objects read-write, except Strings. |
duke@435 | 372 | |
duke@435 | 373 | class MarkReadWriteObjects : public ObjectClosure { |
duke@435 | 374 | private: |
duke@435 | 375 | MarkObjectsOopClosure mark_objects; |
duke@435 | 376 | public: |
duke@435 | 377 | void do_object(oop obj) { |
duke@435 | 378 | |
duke@435 | 379 | // The METHODS() OBJARRAYS CANNOT BE MADE READ-ONLY, even though |
duke@435 | 380 | // it is never modified. Otherwise, they will be pre-marked; the |
duke@435 | 381 | // GC marking phase will skip them; and by skipping them will fail |
duke@435 | 382 | // to mark the methods objects referenced by the array. |
duke@435 | 383 | |
duke@435 | 384 | if (obj->is_klass()) { |
duke@435 | 385 | mark_object(obj); |
duke@435 | 386 | Klass* k = klassOop(obj)->klass_part(); |
duke@435 | 387 | mark_object(k->java_mirror()); |
duke@435 | 388 | if (obj->blueprint()->oop_is_instanceKlass()) { |
duke@435 | 389 | instanceKlass* ik = (instanceKlass*)k; |
duke@435 | 390 | mark_object(ik->methods()); |
duke@435 | 391 | mark_object(ik->constants()); |
duke@435 | 392 | } |
duke@435 | 393 | if (obj->blueprint()->oop_is_javaArray()) { |
duke@435 | 394 | arrayKlass* ak = (arrayKlass*)k; |
duke@435 | 395 | mark_object(ak->component_mirror()); |
duke@435 | 396 | } |
duke@435 | 397 | return; |
duke@435 | 398 | } |
duke@435 | 399 | |
duke@435 | 400 | // Mark constantPool tags and the constantPoolCache. |
duke@435 | 401 | |
duke@435 | 402 | else if (obj->is_constantPool()) { |
duke@435 | 403 | constantPoolOop pool = constantPoolOop(obj); |
duke@435 | 404 | mark_object(pool->cache()); |
duke@435 | 405 | pool->shared_tags_iterate(&mark_objects); |
duke@435 | 406 | return; |
duke@435 | 407 | } |
duke@435 | 408 | |
duke@435 | 409 | // Mark all method objects. |
duke@435 | 410 | |
duke@435 | 411 | if (obj->is_method()) { |
duke@435 | 412 | mark_object(obj); |
duke@435 | 413 | } |
duke@435 | 414 | } |
duke@435 | 415 | }; |
duke@435 | 416 | |
duke@435 | 417 | |
duke@435 | 418 | // Closure: Mark String objects read-write. |
duke@435 | 419 | |
duke@435 | 420 | class MarkStringObjects : public ObjectClosure { |
duke@435 | 421 | private: |
duke@435 | 422 | MarkObjectsOopClosure mark_objects; |
duke@435 | 423 | public: |
duke@435 | 424 | void do_object(oop obj) { |
duke@435 | 425 | |
duke@435 | 426 | // Mark String objects referenced by constant pool entries. |
duke@435 | 427 | |
duke@435 | 428 | if (obj->is_constantPool()) { |
duke@435 | 429 | constantPoolOop pool = constantPoolOop(obj); |
duke@435 | 430 | pool->shared_strings_iterate(&mark_objects); |
duke@435 | 431 | return; |
duke@435 | 432 | } |
duke@435 | 433 | } |
duke@435 | 434 | }; |
duke@435 | 435 | |
duke@435 | 436 | |
duke@435 | 437 | // Move objects matching specified type (ie. lock_bits) to the specified |
duke@435 | 438 | // space. |
duke@435 | 439 | |
duke@435 | 440 | class MoveMarkedObjects : public ObjectClosure { |
duke@435 | 441 | private: |
duke@435 | 442 | OffsetTableContigSpace* _space; |
duke@435 | 443 | bool _read_only; |
duke@435 | 444 | |
duke@435 | 445 | public: |
duke@435 | 446 | MoveMarkedObjects(OffsetTableContigSpace* space, bool read_only) { |
duke@435 | 447 | _space = space; |
duke@435 | 448 | _read_only = read_only; |
duke@435 | 449 | } |
duke@435 | 450 | |
duke@435 | 451 | void do_object(oop obj) { |
duke@435 | 452 | if (obj->is_shared()) { |
duke@435 | 453 | return; |
duke@435 | 454 | } |
duke@435 | 455 | if (obj->is_gc_marked() && obj->forwardee() == NULL) { |
duke@435 | 456 | int s = obj->size(); |
duke@435 | 457 | oop sh_obj = (oop)_space->allocate(s); |
duke@435 | 458 | if (sh_obj == NULL) { |
coleenp@2497 | 459 | report_out_of_shared_space(_read_only ? SharedReadOnly : SharedReadWrite); |
duke@435 | 460 | } |
duke@435 | 461 | if (PrintSharedSpaces && Verbose && WizardMode) { |
duke@435 | 462 | tty->print_cr("\nMoveMarkedObjects: " PTR_FORMAT " -> " PTR_FORMAT " %s", obj, sh_obj, |
duke@435 | 463 | (_read_only ? "ro" : "rw")); |
duke@435 | 464 | } |
duke@435 | 465 | Copy::aligned_disjoint_words((HeapWord*)obj, (HeapWord*)sh_obj, s); |
duke@435 | 466 | obj->forward_to(sh_obj); |
duke@435 | 467 | if (_read_only) { |
duke@435 | 468 | // Readonly objects: set hash value to self pointer and make gc_marked. |
duke@435 | 469 | sh_obj->forward_to(sh_obj); |
duke@435 | 470 | } else { |
duke@435 | 471 | sh_obj->init_mark(); |
duke@435 | 472 | } |
duke@435 | 473 | } |
duke@435 | 474 | } |
duke@435 | 475 | }; |
duke@435 | 476 | |
duke@435 | 477 | static void mark_and_move(oop obj, MoveMarkedObjects* move) { |
duke@435 | 478 | if (mark_object(obj)) move->do_object(obj); |
duke@435 | 479 | } |
duke@435 | 480 | |
duke@435 | 481 | enum order_policy { |
duke@435 | 482 | OP_favor_startup = 0, |
duke@435 | 483 | OP_balanced = 1, |
duke@435 | 484 | OP_favor_runtime = 2 |
duke@435 | 485 | }; |
duke@435 | 486 | |
duke@435 | 487 | static void mark_and_move_for_policy(order_policy policy, oop obj, MoveMarkedObjects* move) { |
duke@435 | 488 | if (SharedOptimizeColdStartPolicy >= policy) mark_and_move(obj, move); |
duke@435 | 489 | } |
duke@435 | 490 | |
duke@435 | 491 | class MarkAndMoveOrderedReadOnly : public ObjectClosure { |
duke@435 | 492 | private: |
duke@435 | 493 | MoveMarkedObjects *_move_ro; |
duke@435 | 494 | |
duke@435 | 495 | public: |
duke@435 | 496 | MarkAndMoveOrderedReadOnly(MoveMarkedObjects *move_ro) : _move_ro(move_ro) {} |
duke@435 | 497 | |
duke@435 | 498 | void do_object(oop obj) { |
duke@435 | 499 | if (obj->is_klass() && obj->blueprint()->oop_is_instanceKlass()) { |
duke@435 | 500 | instanceKlass* ik = instanceKlass::cast((klassOop)obj); |
duke@435 | 501 | int i; |
duke@435 | 502 | |
duke@435 | 503 | if (ik->super() != NULL) { |
duke@435 | 504 | do_object(ik->super()); |
duke@435 | 505 | } |
duke@435 | 506 | |
duke@435 | 507 | objArrayOop interfaces = ik->local_interfaces(); |
duke@435 | 508 | mark_and_move_for_policy(OP_favor_startup, interfaces, _move_ro); |
duke@435 | 509 | for(i = 0; i < interfaces->length(); i++) { |
duke@435 | 510 | klassOop k = klassOop(interfaces->obj_at(i)); |
duke@435 | 511 | do_object(k); |
duke@435 | 512 | } |
duke@435 | 513 | |
duke@435 | 514 | objArrayOop methods = ik->methods(); |
duke@435 | 515 | for(i = 0; i < methods->length(); i++) { |
duke@435 | 516 | methodOop m = methodOop(methods->obj_at(i)); |
duke@435 | 517 | mark_and_move_for_policy(OP_favor_startup, m->constMethod(), _move_ro); |
duke@435 | 518 | mark_and_move_for_policy(OP_favor_runtime, m->constMethod()->exception_table(), _move_ro); |
duke@435 | 519 | mark_and_move_for_policy(OP_favor_runtime, m->constMethod()->stackmap_data(), _move_ro); |
duke@435 | 520 | } |
duke@435 | 521 | |
duke@435 | 522 | mark_and_move_for_policy(OP_favor_startup, ik->transitive_interfaces(), _move_ro); |
duke@435 | 523 | mark_and_move_for_policy(OP_favor_startup, ik->fields(), _move_ro); |
duke@435 | 524 | |
duke@435 | 525 | mark_and_move_for_policy(OP_favor_runtime, ik->secondary_supers(), _move_ro); |
duke@435 | 526 | mark_and_move_for_policy(OP_favor_runtime, ik->method_ordering(), _move_ro); |
duke@435 | 527 | mark_and_move_for_policy(OP_favor_runtime, ik->class_annotations(), _move_ro); |
duke@435 | 528 | mark_and_move_for_policy(OP_favor_runtime, ik->fields_annotations(), _move_ro); |
duke@435 | 529 | mark_and_move_for_policy(OP_favor_runtime, ik->methods_annotations(), _move_ro); |
duke@435 | 530 | mark_and_move_for_policy(OP_favor_runtime, ik->methods_parameter_annotations(), _move_ro); |
duke@435 | 531 | mark_and_move_for_policy(OP_favor_runtime, ik->methods_default_annotations(), _move_ro); |
duke@435 | 532 | mark_and_move_for_policy(OP_favor_runtime, ik->inner_classes(), _move_ro); |
duke@435 | 533 | mark_and_move_for_policy(OP_favor_runtime, ik->secondary_supers(), _move_ro); |
duke@435 | 534 | } |
duke@435 | 535 | } |
duke@435 | 536 | }; |
duke@435 | 537 | |
duke@435 | 538 | class MarkAndMoveOrderedReadWrite: public ObjectClosure { |
duke@435 | 539 | private: |
duke@435 | 540 | MoveMarkedObjects *_move_rw; |
duke@435 | 541 | |
duke@435 | 542 | public: |
duke@435 | 543 | MarkAndMoveOrderedReadWrite(MoveMarkedObjects *move_rw) : _move_rw(move_rw) {} |
duke@435 | 544 | |
duke@435 | 545 | void do_object(oop obj) { |
duke@435 | 546 | if (obj->is_klass() && obj->blueprint()->oop_is_instanceKlass()) { |
duke@435 | 547 | instanceKlass* ik = instanceKlass::cast((klassOop)obj); |
duke@435 | 548 | int i; |
duke@435 | 549 | |
duke@435 | 550 | mark_and_move_for_policy(OP_favor_startup, ik->as_klassOop(), _move_rw); |
duke@435 | 551 | |
duke@435 | 552 | if (ik->super() != NULL) { |
duke@435 | 553 | do_object(ik->super()); |
duke@435 | 554 | } |
duke@435 | 555 | |
duke@435 | 556 | objArrayOop interfaces = ik->local_interfaces(); |
duke@435 | 557 | for(i = 0; i < interfaces->length(); i++) { |
duke@435 | 558 | klassOop k = klassOop(interfaces->obj_at(i)); |
duke@435 | 559 | mark_and_move_for_policy(OP_favor_startup, k, _move_rw); |
duke@435 | 560 | do_object(k); |
duke@435 | 561 | } |
duke@435 | 562 | |
duke@435 | 563 | objArrayOop methods = ik->methods(); |
duke@435 | 564 | mark_and_move_for_policy(OP_favor_startup, methods, _move_rw); |
duke@435 | 565 | for(i = 0; i < methods->length(); i++) { |
duke@435 | 566 | methodOop m = methodOop(methods->obj_at(i)); |
duke@435 | 567 | mark_and_move_for_policy(OP_favor_startup, m, _move_rw); |
duke@435 | 568 | mark_and_move_for_policy(OP_favor_startup, ik->constants(), _move_rw); // idempotent |
duke@435 | 569 | mark_and_move_for_policy(OP_balanced, ik->constants()->cache(), _move_rw); // idempotent |
duke@435 | 570 | mark_and_move_for_policy(OP_balanced, ik->constants()->tags(), _move_rw); // idempotent |
duke@435 | 571 | } |
duke@435 | 572 | |
duke@435 | 573 | mark_and_move_for_policy(OP_favor_startup, ik->as_klassOop()->klass(), _move_rw); |
duke@435 | 574 | mark_and_move_for_policy(OP_favor_startup, ik->constants()->klass(), _move_rw); |
duke@435 | 575 | |
duke@435 | 576 | // Although Java mirrors are marked in MarkReadWriteObjects, |
duke@435 | 577 | // apparently they were never moved into shared spaces since |
duke@435 | 578 | // MoveMarkedObjects skips marked instance oops. This may |
duke@435 | 579 | // be a bug in the original implementation or simply the vestige |
duke@435 | 580 | // of an abandoned experiment. Nevertheless we leave a hint |
duke@435 | 581 | // here in case this capability is ever correctly implemented. |
duke@435 | 582 | // |
duke@435 | 583 | // mark_and_move_for_policy(OP_favor_runtime, ik->java_mirror(), _move_rw); |
duke@435 | 584 | } |
duke@435 | 585 | } |
duke@435 | 586 | |
duke@435 | 587 | }; |
duke@435 | 588 | |
duke@435 | 589 | // Adjust references in oops to refer to shared spaces. |
duke@435 | 590 | |
duke@435 | 591 | class ResolveForwardingClosure: public OopClosure { |
duke@435 | 592 | public: |
duke@435 | 593 | void do_oop(oop* p) { |
duke@435 | 594 | oop obj = *p; |
duke@435 | 595 | if (!obj->is_shared()) { |
duke@435 | 596 | if (obj != NULL) { |
duke@435 | 597 | oop f = obj->forwardee(); |
duke@435 | 598 | guarantee(f->is_shared(), "Oop doesn't refer to shared space."); |
duke@435 | 599 | *p = f; |
duke@435 | 600 | } |
duke@435 | 601 | } |
duke@435 | 602 | } |
coleenp@548 | 603 | void do_oop(narrowOop* pobj) { ShouldNotReachHere(); } |
duke@435 | 604 | }; |
duke@435 | 605 | |
duke@435 | 606 | |
coleenp@2497 | 607 | // The methods array must be reordered by Symbol* address. |
coleenp@2497 | 608 | // (See classFileParser.cpp where methods in a class are originally |
coleenp@2497 | 609 | // sorted). The addresses of symbols have been changed as a result |
coleenp@2497 | 610 | // of moving to the shared space. |
duke@435 | 611 | |
duke@435 | 612 | class SortMethodsClosure: public ObjectClosure { |
coleenp@2497 | 613 | public: |
coleenp@2497 | 614 | void do_object(oop obj) { |
coleenp@2497 | 615 | if (obj->blueprint()->oop_is_instanceKlass()) { |
coleenp@2497 | 616 | instanceKlass* ik = instanceKlass::cast((klassOop)obj); |
coleenp@2497 | 617 | methodOopDesc::sort_methods(ik->methods(), |
coleenp@2497 | 618 | ik->methods_annotations(), |
coleenp@2497 | 619 | ik->methods_parameter_annotations(), |
coleenp@2497 | 620 | ik->methods_default_annotations(), |
coleenp@2497 | 621 | true /* idempotent, slow */); |
coleenp@2497 | 622 | } |
coleenp@2497 | 623 | } |
coleenp@2497 | 624 | }; |
coleenp@2497 | 625 | |
coleenp@2497 | 626 | // Itable indices are calculated based on methods array order |
coleenp@2497 | 627 | // (see klassItable::compute_itable_index()). Must reinitialize |
coleenp@2497 | 628 | // after ALL methods of ALL classes have been reordered. |
coleenp@2497 | 629 | // We assume that since checkconstraints is false, this method |
coleenp@2497 | 630 | // cannot throw an exception. An exception here would be |
coleenp@2497 | 631 | // problematic since this is the VMThread, not a JavaThread. |
coleenp@2497 | 632 | |
coleenp@2497 | 633 | class ReinitializeItables: public ObjectClosure { |
duke@435 | 634 | private: |
duke@435 | 635 | Thread* _thread; |
duke@435 | 636 | |
duke@435 | 637 | public: |
coleenp@2497 | 638 | ReinitializeItables(Thread* thread) : _thread(thread) {} |
duke@435 | 639 | |
duke@435 | 640 | void do_object(oop obj) { |
duke@435 | 641 | if (obj->blueprint()->oop_is_instanceKlass()) { |
duke@435 | 642 | instanceKlass* ik = instanceKlass::cast((klassOop)obj); |
coleenp@2497 | 643 | ik->itable()->initialize_itable(false, _thread); |
duke@435 | 644 | } |
duke@435 | 645 | } |
duke@435 | 646 | }; |
duke@435 | 647 | |
duke@435 | 648 | |
duke@435 | 649 | // Adjust references in oops to refer to shared spaces. |
duke@435 | 650 | |
duke@435 | 651 | class PatchOopsClosure: public ObjectClosure { |
duke@435 | 652 | private: |
duke@435 | 653 | Thread* _thread; |
duke@435 | 654 | ResolveForwardingClosure resolve; |
duke@435 | 655 | |
duke@435 | 656 | public: |
duke@435 | 657 | PatchOopsClosure(Thread* thread) : _thread(thread) {} |
duke@435 | 658 | |
duke@435 | 659 | void do_object(oop obj) { |
duke@435 | 660 | obj->oop_iterate_header(&resolve); |
duke@435 | 661 | obj->oop_iterate(&resolve); |
duke@435 | 662 | |
duke@435 | 663 | assert(obj->klass()->is_shared(), "Klass not pointing into shared space."); |
duke@435 | 664 | |
duke@435 | 665 | // If the object is a Java object or class which might (in the |
duke@435 | 666 | // future) contain a reference to a young gen object, add it to the |
duke@435 | 667 | // list. |
duke@435 | 668 | |
duke@435 | 669 | if (obj->is_klass() || obj->is_instance()) { |
duke@435 | 670 | if (obj->is_klass() || |
never@1577 | 671 | obj->is_a(SystemDictionary::Class_klass()) || |
never@1577 | 672 | obj->is_a(SystemDictionary::Throwable_klass())) { |
duke@435 | 673 | // Do nothing |
duke@435 | 674 | } |
never@1577 | 675 | else if (obj->is_a(SystemDictionary::String_klass())) { |
duke@435 | 676 | // immutable objects. |
duke@435 | 677 | } else { |
duke@435 | 678 | // someone added an object we hadn't accounted for. |
duke@435 | 679 | ShouldNotReachHere(); |
duke@435 | 680 | } |
duke@435 | 681 | } |
duke@435 | 682 | } |
duke@435 | 683 | }; |
duke@435 | 684 | |
duke@435 | 685 | |
duke@435 | 686 | // Empty the young and old generations. |
duke@435 | 687 | |
duke@435 | 688 | class ClearSpaceClosure : public SpaceClosure { |
duke@435 | 689 | public: |
duke@435 | 690 | void do_space(Space* s) { |
jmasa@698 | 691 | s->clear(SpaceDecorator::Mangle); |
duke@435 | 692 | } |
duke@435 | 693 | }; |
duke@435 | 694 | |
duke@435 | 695 | |
duke@435 | 696 | // Closure for serializing initialization data out to a data area to be |
duke@435 | 697 | // written to the shared file. |
duke@435 | 698 | |
duke@435 | 699 | class WriteClosure : public SerializeOopClosure { |
duke@435 | 700 | private: |
duke@435 | 701 | oop* top; |
duke@435 | 702 | char* end; |
duke@435 | 703 | |
duke@435 | 704 | inline void check_space() { |
duke@435 | 705 | if ((char*)top + sizeof(oop) > end) { |
coleenp@2497 | 706 | report_out_of_shared_space(SharedMiscData); |
duke@435 | 707 | } |
duke@435 | 708 | } |
duke@435 | 709 | |
duke@435 | 710 | |
duke@435 | 711 | public: |
duke@435 | 712 | WriteClosure(char* md_top, char* md_end) { |
duke@435 | 713 | top = (oop*)md_top; |
duke@435 | 714 | end = md_end; |
duke@435 | 715 | } |
duke@435 | 716 | |
duke@435 | 717 | char* get_top() { return (char*)top; } |
duke@435 | 718 | |
duke@435 | 719 | void do_oop(oop* p) { |
duke@435 | 720 | check_space(); |
duke@435 | 721 | oop obj = *p; |
duke@435 | 722 | assert(obj->is_oop_or_null(), "invalid oop"); |
duke@435 | 723 | assert(obj == NULL || obj->is_shared(), |
duke@435 | 724 | "Oop in shared space not pointing into shared space."); |
duke@435 | 725 | *top = obj; |
duke@435 | 726 | ++top; |
duke@435 | 727 | } |
duke@435 | 728 | |
coleenp@548 | 729 | void do_oop(narrowOop* pobj) { ShouldNotReachHere(); } |
coleenp@548 | 730 | |
duke@435 | 731 | void do_int(int* p) { |
duke@435 | 732 | check_space(); |
duke@435 | 733 | *top = (oop)(intptr_t)*p; |
duke@435 | 734 | ++top; |
duke@435 | 735 | } |
duke@435 | 736 | |
duke@435 | 737 | void do_size_t(size_t* p) { |
duke@435 | 738 | check_space(); |
duke@435 | 739 | *top = (oop)(intptr_t)*p; |
duke@435 | 740 | ++top; |
duke@435 | 741 | } |
duke@435 | 742 | |
duke@435 | 743 | void do_ptr(void** p) { |
duke@435 | 744 | check_space(); |
duke@435 | 745 | *top = (oop)*p; |
duke@435 | 746 | ++top; |
duke@435 | 747 | } |
duke@435 | 748 | |
duke@435 | 749 | void do_ptr(HeapWord** p) { do_ptr((void **) p); } |
duke@435 | 750 | |
duke@435 | 751 | void do_tag(int tag) { |
duke@435 | 752 | check_space(); |
duke@435 | 753 | *top = (oop)(intptr_t)tag; |
duke@435 | 754 | ++top; |
duke@435 | 755 | } |
duke@435 | 756 | |
duke@435 | 757 | void do_region(u_char* start, size_t size) { |
duke@435 | 758 | if ((char*)top + size > end) { |
coleenp@2497 | 759 | report_out_of_shared_space(SharedMiscData); |
duke@435 | 760 | } |
duke@435 | 761 | assert((intptr_t)start % sizeof(oop) == 0, "bad alignment"); |
duke@435 | 762 | assert(size % sizeof(oop) == 0, "bad size"); |
duke@435 | 763 | do_tag((int)size); |
duke@435 | 764 | while (size > 0) { |
duke@435 | 765 | *top = *(oop*)start; |
duke@435 | 766 | ++top; |
duke@435 | 767 | start += sizeof(oop); |
duke@435 | 768 | size -= sizeof(oop); |
duke@435 | 769 | } |
duke@435 | 770 | } |
duke@435 | 771 | |
duke@435 | 772 | bool reading() const { return false; } |
duke@435 | 773 | }; |
duke@435 | 774 | |
duke@435 | 775 | |
duke@435 | 776 | class ResolveConstantPoolsClosure : public ObjectClosure { |
duke@435 | 777 | private: |
duke@435 | 778 | TRAPS; |
duke@435 | 779 | public: |
duke@435 | 780 | ResolveConstantPoolsClosure(Thread *t) { |
duke@435 | 781 | __the_thread__ = t; |
duke@435 | 782 | } |
duke@435 | 783 | void do_object(oop obj) { |
duke@435 | 784 | if (obj->is_constantPool()) { |
duke@435 | 785 | constantPoolOop cpool = (constantPoolOop)obj; |
duke@435 | 786 | int unresolved = cpool->pre_resolve_shared_klasses(THREAD); |
duke@435 | 787 | } |
duke@435 | 788 | } |
duke@435 | 789 | }; |
duke@435 | 790 | |
duke@435 | 791 | |
duke@435 | 792 | // Print a summary of the contents of the read/write spaces to help |
duke@435 | 793 | // identify objects which might be able to be made read-only. At this |
duke@435 | 794 | // point, the objects have been written, and we can trash them as |
duke@435 | 795 | // needed. |
duke@435 | 796 | |
duke@435 | 797 | static void print_contents() { |
duke@435 | 798 | if (PrintSharedSpaces) { |
duke@435 | 799 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 800 | CompactingPermGenGen* gen = (CompactingPermGenGen*)gch->perm_gen(); |
duke@435 | 801 | |
duke@435 | 802 | // High level summary of the read-only space: |
duke@435 | 803 | |
duke@435 | 804 | ClassifyObjectClosure coc; |
duke@435 | 805 | tty->cr(); tty->print_cr("ReadOnly space:"); |
duke@435 | 806 | gen->ro_space()->object_iterate(&coc); |
duke@435 | 807 | coc.print(); |
duke@435 | 808 | |
duke@435 | 809 | // High level summary of the read-write space: |
duke@435 | 810 | |
duke@435 | 811 | coc.reset(); |
duke@435 | 812 | tty->cr(); tty->print_cr("ReadWrite space:"); |
duke@435 | 813 | gen->rw_space()->object_iterate(&coc); |
duke@435 | 814 | coc.print(); |
duke@435 | 815 | |
duke@435 | 816 | // Reset counters |
duke@435 | 817 | |
duke@435 | 818 | ClearAllocCountClosure cacc; |
duke@435 | 819 | gen->ro_space()->object_iterate(&cacc); |
duke@435 | 820 | gen->rw_space()->object_iterate(&cacc); |
duke@435 | 821 | coc.reset(); |
duke@435 | 822 | |
duke@435 | 823 | // Lower level summary of the read-only space: |
duke@435 | 824 | |
duke@435 | 825 | gen->ro_space()->object_iterate(&coc); |
duke@435 | 826 | tty->cr(); tty->print_cr("ReadOnly space:"); |
duke@435 | 827 | ClassifyInstanceKlassClosure cikc; |
duke@435 | 828 | gen->rw_space()->object_iterate(&cikc); |
duke@435 | 829 | cikc.print(); |
duke@435 | 830 | |
duke@435 | 831 | // Reset counters |
duke@435 | 832 | |
duke@435 | 833 | gen->ro_space()->object_iterate(&cacc); |
duke@435 | 834 | gen->rw_space()->object_iterate(&cacc); |
duke@435 | 835 | coc.reset(); |
duke@435 | 836 | |
duke@435 | 837 | // Lower level summary of the read-write space: |
duke@435 | 838 | |
duke@435 | 839 | gen->rw_space()->object_iterate(&coc); |
duke@435 | 840 | cikc.reset(); |
duke@435 | 841 | tty->cr(); tty->print_cr("ReadWrite space:"); |
duke@435 | 842 | gen->rw_space()->object_iterate(&cikc); |
duke@435 | 843 | cikc.print(); |
duke@435 | 844 | } |
duke@435 | 845 | } |
duke@435 | 846 | |
duke@435 | 847 | |
duke@435 | 848 | // Patch C++ vtable pointer in klass oops. |
duke@435 | 849 | |
duke@435 | 850 | // Klass objects contain references to c++ vtables in the JVM library. |
duke@435 | 851 | // Fix them to point to our constructed vtables. However, don't iterate |
duke@435 | 852 | // across the space while doing this, as that causes the vtables to be |
duke@435 | 853 | // patched, undoing our useful work. Instead, iterate to make a list, |
duke@435 | 854 | // then use the list to do the fixing. |
acorn@843 | 855 | // |
acorn@843 | 856 | // Our constructed vtables: |
acorn@843 | 857 | // Dump time: |
acorn@843 | 858 | // 1. init_self_patching_vtbl_list: table of pointers to current virtual method addrs |
acorn@843 | 859 | // 2. generate_vtable_methods: create jump table, appended to above vtbl_list |
acorn@843 | 860 | // 3. PatchKlassVtables: for Klass list, patch the vtable entry to point to jump table |
acorn@843 | 861 | // rather than to current vtbl |
acorn@843 | 862 | // Table layout: NOTE FIXED SIZE |
acorn@843 | 863 | // 1. vtbl pointers |
acorn@843 | 864 | // 2. #Klass X #virtual methods per Klass |
acorn@843 | 865 | // 1 entry for each, in the order: |
acorn@843 | 866 | // Klass1:method1 entry, Klass1:method2 entry, ... Klass1:method<num_virtuals> entry |
acorn@843 | 867 | // Klass2:method1 entry, Klass2:method2 entry, ... Klass2:method<num_virtuals> entry |
acorn@843 | 868 | // ... |
acorn@843 | 869 | // Klass<vtbl_list_size>:method1 entry, Klass<vtbl_list_size>:method2 entry, |
acorn@843 | 870 | // ... Klass<vtbl_list_size>:method<num_virtuals> entry |
acorn@843 | 871 | // Sample entry: (Sparc): |
acorn@843 | 872 | // save(sp, -256, sp) |
acorn@843 | 873 | // ba,pt common_code |
acorn@843 | 874 | // mov XXX, %L0 %L0 gets: Klass index <<8 + method index (note: max method index 255) |
acorn@843 | 875 | // |
acorn@843 | 876 | // Restore time: |
acorn@843 | 877 | // 1. initialize_oops: reserve space for table |
acorn@843 | 878 | // 2. init_self_patching_vtbl_list: update pointers to NEW virtual method addrs in text |
acorn@843 | 879 | // |
acorn@843 | 880 | // Execution time: |
acorn@843 | 881 | // First virtual method call for any object of these Klass types: |
acorn@843 | 882 | // 1. object->klass->klass_part |
acorn@843 | 883 | // 2. vtable entry for that klass_part points to the jump table entries |
acorn@843 | 884 | // 3. branches to common_code with %O0/klass_part, %L0: Klass index <<8 + method index |
acorn@843 | 885 | // 4. common_code: |
acorn@843 | 886 | // Get address of new vtbl pointer for this Klass from updated table |
acorn@843 | 887 | // Update new vtbl pointer in the Klass: future virtual calls go direct |
acorn@843 | 888 | // Jump to method, using new vtbl pointer and method index |
duke@435 | 889 | |
duke@435 | 890 | class PatchKlassVtables: public ObjectClosure { |
duke@435 | 891 | private: |
duke@435 | 892 | GrowableArray<klassOop>* _klass_objects; |
duke@435 | 893 | |
duke@435 | 894 | public: |
coleenp@2497 | 895 | PatchKlassVtables() { |
duke@435 | 896 | _klass_objects = new GrowableArray<klassOop>(); |
duke@435 | 897 | } |
duke@435 | 898 | |
duke@435 | 899 | void do_object(oop obj) { |
duke@435 | 900 | if (obj->is_klass()) { |
duke@435 | 901 | _klass_objects->append(klassOop(obj)); |
duke@435 | 902 | } |
duke@435 | 903 | } |
duke@435 | 904 | |
coleenp@2497 | 905 | void patch(void** vtbl_list, void* new_vtable_start) { |
coleenp@2497 | 906 | int n = _klass_objects->length(); |
coleenp@2497 | 907 | for (int i = 0; i < n; i++) { |
duke@435 | 908 | klassOop obj = (klassOop)_klass_objects->at(i); |
duke@435 | 909 | Klass* k = obj->klass_part(); |
coleenp@2497 | 910 | *(void**)k = CompactingPermGenGen::find_matching_vtbl_ptr( |
coleenp@2497 | 911 | vtbl_list, new_vtable_start, k); |
duke@435 | 912 | } |
duke@435 | 913 | } |
duke@435 | 914 | }; |
duke@435 | 915 | |
coleenp@2497 | 916 | // Walk through all symbols and patch their vtable pointers. |
coleenp@2497 | 917 | // Note that symbols have vtable pointers only in non-product builds |
coleenp@2497 | 918 | // (see allocation.hpp). |
coleenp@2497 | 919 | |
coleenp@2497 | 920 | #ifndef PRODUCT |
coleenp@2497 | 921 | class PatchSymbolVtables: public SymbolClosure { |
coleenp@2497 | 922 | private: |
coleenp@2497 | 923 | void* _new_vtbl_ptr; |
coleenp@2497 | 924 | |
coleenp@2497 | 925 | public: |
coleenp@2497 | 926 | PatchSymbolVtables(void** vtbl_list, void* new_vtable_start) { |
coleenp@2497 | 927 | Symbol s; |
coleenp@2497 | 928 | _new_vtbl_ptr = CompactingPermGenGen::find_matching_vtbl_ptr( |
coleenp@2497 | 929 | vtbl_list, new_vtable_start, &s); |
coleenp@2497 | 930 | } |
coleenp@2497 | 931 | |
coleenp@2497 | 932 | void do_symbol(Symbol** p) { |
coleenp@2497 | 933 | Symbol* sym = load_symbol(p); |
coleenp@2497 | 934 | *(void**)sym = _new_vtbl_ptr; |
coleenp@2497 | 935 | } |
coleenp@2497 | 936 | }; |
coleenp@2497 | 937 | #endif |
coleenp@2497 | 938 | |
duke@435 | 939 | |
duke@435 | 940 | // Populate the shared space. |
duke@435 | 941 | |
duke@435 | 942 | class VM_PopulateDumpSharedSpace: public VM_Operation { |
duke@435 | 943 | private: |
duke@435 | 944 | GrowableArray<oop> *_class_promote_order; |
duke@435 | 945 | OffsetTableContigSpace* _ro_space; |
duke@435 | 946 | OffsetTableContigSpace* _rw_space; |
duke@435 | 947 | VirtualSpace* _md_vs; |
duke@435 | 948 | VirtualSpace* _mc_vs; |
duke@435 | 949 | |
duke@435 | 950 | public: |
duke@435 | 951 | VM_PopulateDumpSharedSpace(GrowableArray<oop> *class_promote_order, |
duke@435 | 952 | OffsetTableContigSpace* ro_space, |
duke@435 | 953 | OffsetTableContigSpace* rw_space, |
duke@435 | 954 | VirtualSpace* md_vs, VirtualSpace* mc_vs) { |
duke@435 | 955 | _class_promote_order = class_promote_order; |
duke@435 | 956 | _ro_space = ro_space; |
duke@435 | 957 | _rw_space = rw_space; |
duke@435 | 958 | _md_vs = md_vs; |
duke@435 | 959 | _mc_vs = mc_vs; |
duke@435 | 960 | } |
duke@435 | 961 | |
duke@435 | 962 | VMOp_Type type() const { return VMOp_PopulateDumpSharedSpace; } |
duke@435 | 963 | void doit() { |
duke@435 | 964 | Thread* THREAD = VMThread::vm_thread(); |
duke@435 | 965 | NOT_PRODUCT(SystemDictionary::verify();) |
duke@435 | 966 | // The following guarantee is meant to ensure that no loader constraints |
duke@435 | 967 | // exist yet, since the constraints table is not shared. This becomes |
duke@435 | 968 | // more important now that we don't re-initialize vtables/itables for |
duke@435 | 969 | // shared classes at runtime, where constraints were previously created. |
duke@435 | 970 | guarantee(SystemDictionary::constraints()->number_of_entries() == 0, |
duke@435 | 971 | "loader constraints are not saved"); |
jrose@1145 | 972 | // Revisit and implement this if we prelink method handle call sites: |
never@1149 | 973 | guarantee(SystemDictionary::invoke_method_table() == NULL || |
never@1149 | 974 | SystemDictionary::invoke_method_table()->number_of_entries() == 0, |
jrose@1145 | 975 | "invoke method table is not saved"); |
duke@435 | 976 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 977 | |
duke@435 | 978 | // At this point, many classes have been loaded. |
duke@435 | 979 | |
duke@435 | 980 | // Update all the fingerprints in the shared methods. |
duke@435 | 981 | |
duke@435 | 982 | tty->print("Calculating fingerprints ... "); |
duke@435 | 983 | FingerprintMethodsClosure fpmc; |
duke@435 | 984 | gch->object_iterate(&fpmc); |
duke@435 | 985 | tty->print_cr("done. "); |
duke@435 | 986 | |
duke@435 | 987 | // Remove all references outside the heap. |
duke@435 | 988 | |
duke@435 | 989 | tty->print("Removing unshareable information ... "); |
duke@435 | 990 | RemoveUnshareableInfoClosure ruic; |
duke@435 | 991 | gch->object_iterate(&ruic); |
duke@435 | 992 | tty->print_cr("done. "); |
duke@435 | 993 | |
duke@435 | 994 | // Move the objects in three passes. |
duke@435 | 995 | |
duke@435 | 996 | MarkObjectsOopClosure mark_all; |
duke@435 | 997 | MarkCommonReadOnly mark_common_ro; |
duke@435 | 998 | MarkStringValues mark_string_values; |
duke@435 | 999 | MarkReadWriteObjects mark_rw; |
duke@435 | 1000 | MarkStringObjects mark_strings; |
duke@435 | 1001 | MoveMarkedObjects move_ro(_ro_space, true); |
duke@435 | 1002 | MoveMarkedObjects move_rw(_rw_space, false); |
duke@435 | 1003 | |
duke@435 | 1004 | // The SharedOptimizeColdStart VM option governs the new layout |
duke@435 | 1005 | // algorithm for promoting classes into the shared archive. |
duke@435 | 1006 | // The general idea is to minimize cold start time by laying |
duke@435 | 1007 | // out the objects in the order they are accessed at startup time. |
duke@435 | 1008 | // By doing this we are trying to eliminate out-of-order accesses |
duke@435 | 1009 | // in the shared archive. This benefits cold startup time by making |
duke@435 | 1010 | // disk reads as sequential as possible during class loading and |
duke@435 | 1011 | // bootstrapping activities. There may also be a small secondary |
duke@435 | 1012 | // effect of better "packing" of more commonly used data on a smaller |
duke@435 | 1013 | // number of pages, although no direct benefit has been measured from |
duke@435 | 1014 | // this effect. |
duke@435 | 1015 | // |
duke@435 | 1016 | // At the class level of granularity, the promotion order is dictated |
duke@435 | 1017 | // by the classlist file whose generation is discussed elsewhere. |
duke@435 | 1018 | // |
duke@435 | 1019 | // At smaller granularity, optimal ordering was determined by an |
duke@435 | 1020 | // offline analysis of object access order in the shared archive. |
duke@435 | 1021 | // The dbx watchpoint facility, combined with SA post-processing, |
duke@435 | 1022 | // was used to observe common access patterns primarily during |
duke@435 | 1023 | // classloading. This information was used to craft the promotion |
duke@435 | 1024 | // order seen in the following closures. |
duke@435 | 1025 | // |
duke@435 | 1026 | // The observed access order is mostly governed by what happens |
duke@435 | 1027 | // in SystemDictionary::load_shared_class(). NOTE WELL - care |
duke@435 | 1028 | // should be taken when making changes to this method, because it |
duke@435 | 1029 | // may invalidate assumptions made about access order! |
duke@435 | 1030 | // |
duke@435 | 1031 | // (Ideally, there would be a better way to manage changes to |
duke@435 | 1032 | // the access order. Unfortunately a generic in-VM solution for |
duke@435 | 1033 | // dynamically observing access order and optimizing shared |
duke@435 | 1034 | // archive layout is pretty difficult. We go with the static |
duke@435 | 1035 | // analysis because the code is fairly mature at this point |
duke@435 | 1036 | // and we're betting that the access order won't change much.) |
duke@435 | 1037 | |
duke@435 | 1038 | MarkAndMoveOrderedReadOnly mark_and_move_ordered_ro(&move_ro); |
duke@435 | 1039 | MarkAndMoveOrderedReadWrite mark_and_move_ordered_rw(&move_rw); |
duke@435 | 1040 | |
duke@435 | 1041 | // Set up the share data and shared code segments. |
duke@435 | 1042 | |
duke@435 | 1043 | char* md_top = _md_vs->low(); |
duke@435 | 1044 | char* md_end = _md_vs->high(); |
duke@435 | 1045 | char* mc_top = _mc_vs->low(); |
duke@435 | 1046 | char* mc_end = _mc_vs->high(); |
duke@435 | 1047 | |
duke@435 | 1048 | // Reserve space for the list of klassOops whose vtables are used |
duke@435 | 1049 | // for patching others as needed. |
duke@435 | 1050 | |
duke@435 | 1051 | void** vtbl_list = (void**)md_top; |
duke@435 | 1052 | int vtbl_list_size = CompactingPermGenGen::vtbl_list_size; |
duke@435 | 1053 | Universe::init_self_patching_vtbl_list(vtbl_list, vtbl_list_size); |
duke@435 | 1054 | |
duke@435 | 1055 | md_top += vtbl_list_size * sizeof(void*); |
duke@435 | 1056 | void* vtable = md_top; |
duke@435 | 1057 | |
duke@435 | 1058 | // Reserve space for a new dummy vtable for klass objects in the |
duke@435 | 1059 | // heap. Generate self-patching vtable entries. |
duke@435 | 1060 | |
duke@435 | 1061 | CompactingPermGenGen::generate_vtable_methods(vtbl_list, |
duke@435 | 1062 | &vtable, |
duke@435 | 1063 | &md_top, md_end, |
duke@435 | 1064 | &mc_top, mc_end); |
duke@435 | 1065 | |
coleenp@2497 | 1066 | // Reserve space for the total size and the number of stored symbols. |
coleenp@2497 | 1067 | |
coleenp@2497 | 1068 | md_top += sizeof(intptr_t) * 2; |
coleenp@2497 | 1069 | |
coleenp@2497 | 1070 | MoveSymbols move_symbols(md_top, md_end); |
coleenp@2497 | 1071 | CommonSymbolsClosure traverse_common_symbols(&move_symbols); |
coleenp@2497 | 1072 | |
coleenp@2497 | 1073 | // Phase 1a: remove symbols with _refcount == 0 |
coleenp@2497 | 1074 | |
coleenp@2497 | 1075 | SymbolTable::unlink(); |
coleenp@2497 | 1076 | |
coleenp@2497 | 1077 | // Phase 1b: move commonly used symbols referenced by oop fields. |
coleenp@2497 | 1078 | |
coleenp@2497 | 1079 | tty->print("Moving common symbols to metadata section at " PTR_FORMAT " ... ", |
coleenp@2497 | 1080 | move_symbols.get_top()); |
coleenp@2497 | 1081 | gch->object_iterate(&traverse_common_symbols); |
coleenp@2497 | 1082 | tty->print_cr("done. "); |
coleenp@2497 | 1083 | |
coleenp@2497 | 1084 | // Phase 1c: move known names and signatures. |
coleenp@2497 | 1085 | |
coleenp@2497 | 1086 | tty->print("Moving vmSymbols to metadata section at " PTR_FORMAT " ... ", |
coleenp@2497 | 1087 | move_symbols.get_top()); |
coleenp@2497 | 1088 | vmSymbols::symbols_do(&move_symbols); |
coleenp@2497 | 1089 | tty->print_cr("done. "); |
coleenp@2497 | 1090 | |
coleenp@2497 | 1091 | // Phase 1d: move the remaining symbols by scanning the whole SymbolTable. |
coleenp@2497 | 1092 | |
coleenp@2497 | 1093 | void* extra_symbols = move_symbols.get_top(); |
coleenp@2497 | 1094 | tty->print("Moving the remaining symbols to metadata section at " PTR_FORMAT " ... ", |
coleenp@2497 | 1095 | move_symbols.get_top()); |
coleenp@2497 | 1096 | SymbolTable::symbols_do(&move_symbols); |
coleenp@2497 | 1097 | tty->print_cr("done. "); |
coleenp@2497 | 1098 | |
coleenp@2497 | 1099 | // Record the total length of all symbols at the beginning of the block. |
coleenp@2497 | 1100 | ((intptr_t*)md_top)[-2] = move_symbols.get_top() - md_top; |
coleenp@2497 | 1101 | ((intptr_t*)md_top)[-1] = move_symbols.count(); |
coleenp@2497 | 1102 | tty->print_cr("Moved %d symbols, %d bytes.", |
coleenp@2497 | 1103 | move_symbols.count(), move_symbols.get_top() - md_top); |
coleenp@2497 | 1104 | // Advance the pointer to the end of symbol store. |
coleenp@2497 | 1105 | md_top = move_symbols.get_top(); |
coleenp@2497 | 1106 | |
coleenp@2497 | 1107 | |
coleenp@2497 | 1108 | // Phase 2: move commonly used read-only objects to the read-only space. |
coleenp@2497 | 1109 | |
coleenp@2497 | 1110 | if (SharedOptimizeColdStart) { |
coleenp@2497 | 1111 | tty->print("Moving pre-ordered read-only objects to shared space at " PTR_FORMAT " ... ", |
coleenp@2497 | 1112 | _ro_space->top()); |
coleenp@2497 | 1113 | for (int i = 0; i < _class_promote_order->length(); i++) { |
coleenp@2497 | 1114 | oop obj = _class_promote_order->at(i); |
coleenp@2497 | 1115 | mark_and_move_ordered_ro.do_object(obj); |
coleenp@2497 | 1116 | } |
coleenp@2497 | 1117 | tty->print_cr("done. "); |
coleenp@2497 | 1118 | } |
coleenp@2497 | 1119 | |
coleenp@2497 | 1120 | tty->print("Moving read-only objects to shared space at " PTR_FORMAT " ... ", |
coleenp@2497 | 1121 | _ro_space->top()); |
coleenp@2497 | 1122 | gch->object_iterate(&mark_common_ro); |
coleenp@2497 | 1123 | gch->object_iterate(&move_ro); |
coleenp@2497 | 1124 | tty->print_cr("done. "); |
coleenp@2497 | 1125 | |
coleenp@2497 | 1126 | // Phase 3: move String character arrays to the read-only space. |
coleenp@2497 | 1127 | |
coleenp@2497 | 1128 | tty->print("Moving string char arrays to shared space at " PTR_FORMAT " ... ", |
coleenp@2497 | 1129 | _ro_space->top()); |
coleenp@2497 | 1130 | gch->object_iterate(&mark_string_values); |
coleenp@2497 | 1131 | gch->object_iterate(&move_ro); |
coleenp@2497 | 1132 | tty->print_cr("done. "); |
coleenp@2497 | 1133 | |
coleenp@2497 | 1134 | // Phase 4: move read-write objects to the read-write space, except |
coleenp@2497 | 1135 | // Strings. |
coleenp@2497 | 1136 | |
coleenp@2497 | 1137 | if (SharedOptimizeColdStart) { |
coleenp@2497 | 1138 | tty->print("Moving pre-ordered read-write objects to shared space at " PTR_FORMAT " ... ", |
coleenp@2497 | 1139 | _rw_space->top()); |
coleenp@2497 | 1140 | for (int i = 0; i < _class_promote_order->length(); i++) { |
coleenp@2497 | 1141 | oop obj = _class_promote_order->at(i); |
coleenp@2497 | 1142 | mark_and_move_ordered_rw.do_object(obj); |
coleenp@2497 | 1143 | } |
coleenp@2497 | 1144 | tty->print_cr("done. "); |
coleenp@2497 | 1145 | } |
coleenp@2497 | 1146 | tty->print("Moving read-write objects to shared space at " PTR_FORMAT " ... ", |
coleenp@2497 | 1147 | _rw_space->top()); |
coleenp@2497 | 1148 | Universe::oops_do(&mark_all, true); |
coleenp@2497 | 1149 | SystemDictionary::oops_do(&mark_all); |
coleenp@2497 | 1150 | oop tmp = Universe::arithmetic_exception_instance(); |
coleenp@2497 | 1151 | mark_object(java_lang_Throwable::message(tmp)); |
coleenp@2497 | 1152 | gch->object_iterate(&mark_rw); |
coleenp@2497 | 1153 | gch->object_iterate(&move_rw); |
coleenp@2497 | 1154 | tty->print_cr("done. "); |
coleenp@2497 | 1155 | |
coleenp@2497 | 1156 | // Phase 5: move String objects to the read-write space. |
coleenp@2497 | 1157 | |
coleenp@2497 | 1158 | tty->print("Moving String objects to shared space at " PTR_FORMAT " ... ", |
coleenp@2497 | 1159 | _rw_space->top()); |
coleenp@2497 | 1160 | StringTable::oops_do(&mark_all); |
coleenp@2497 | 1161 | gch->object_iterate(&mark_strings); |
coleenp@2497 | 1162 | gch->object_iterate(&move_rw); |
coleenp@2497 | 1163 | tty->print_cr("done. "); |
coleenp@2497 | 1164 | tty->print_cr("Read-write space ends at " PTR_FORMAT ", %d bytes.", |
coleenp@2497 | 1165 | _rw_space->top(), _rw_space->used()); |
coleenp@2497 | 1166 | |
coleenp@2497 | 1167 | #ifdef DEBUG |
coleenp@2497 | 1168 | // Check: scan for objects which were not moved. |
coleenp@2497 | 1169 | |
coleenp@2497 | 1170 | CheckRemainingObjects check_objects; |
coleenp@2497 | 1171 | gch->object_iterate(&check_objects); |
coleenp@2497 | 1172 | check_objects.status(); |
coleenp@2497 | 1173 | #endif |
coleenp@2497 | 1174 | |
coleenp@2497 | 1175 | // Resolve forwarding in objects and saved C++ structures |
coleenp@2497 | 1176 | tty->print("Updating references to shared objects ... "); |
coleenp@2497 | 1177 | ResolveForwardingClosure resolve; |
coleenp@2497 | 1178 | Universe::oops_do(&resolve); |
coleenp@2497 | 1179 | SystemDictionary::oops_do(&resolve); |
coleenp@2497 | 1180 | StringTable::oops_do(&resolve); |
coleenp@2497 | 1181 | |
duke@435 | 1182 | // Fix (forward) all of the references in these shared objects (which |
duke@435 | 1183 | // are required to point ONLY to objects in the shared spaces). |
duke@435 | 1184 | // Also, create a list of all objects which might later contain a |
duke@435 | 1185 | // reference to a younger generation object. |
duke@435 | 1186 | |
duke@435 | 1187 | CompactingPermGenGen* gen = (CompactingPermGenGen*)gch->perm_gen(); |
duke@435 | 1188 | PatchOopsClosure patch(THREAD); |
duke@435 | 1189 | gen->ro_space()->object_iterate(&patch); |
duke@435 | 1190 | gen->rw_space()->object_iterate(&patch); |
duke@435 | 1191 | |
duke@435 | 1192 | // Previously method sorting was done concurrently with forwarding |
duke@435 | 1193 | // pointer resolution in the shared spaces. This imposed an ordering |
duke@435 | 1194 | // restriction in that methods were required to be promoted/patched |
duke@435 | 1195 | // before their holder classes. (Because constant pool pointers in |
duke@435 | 1196 | // methodKlasses are required to be resolved before their holder class |
duke@435 | 1197 | // is visited for sorting, otherwise methods are sorted by incorrect, |
duke@435 | 1198 | // pre-forwarding addresses.) |
duke@435 | 1199 | // |
duke@435 | 1200 | // Now, we reorder methods as a separate step after ALL forwarding |
duke@435 | 1201 | // pointer resolution, so that methods can be promoted in any order |
duke@435 | 1202 | // with respect to their holder classes. |
duke@435 | 1203 | |
coleenp@2497 | 1204 | SortMethodsClosure sort; |
duke@435 | 1205 | gen->ro_space()->object_iterate(&sort); |
duke@435 | 1206 | gen->rw_space()->object_iterate(&sort); |
coleenp@2497 | 1207 | |
coleenp@2497 | 1208 | ReinitializeItables reinit_itables(THREAD); |
coleenp@2497 | 1209 | gen->ro_space()->object_iterate(&reinit_itables); |
coleenp@2497 | 1210 | gen->rw_space()->object_iterate(&reinit_itables); |
duke@435 | 1211 | tty->print_cr("done. "); |
duke@435 | 1212 | tty->cr(); |
duke@435 | 1213 | |
duke@435 | 1214 | // Reorder the system dictionary. (Moving the symbols opps affects |
duke@435 | 1215 | // how the hash table indices are calculated.) |
duke@435 | 1216 | |
duke@435 | 1217 | SystemDictionary::reorder_dictionary(); |
duke@435 | 1218 | |
duke@435 | 1219 | // Empty the non-shared heap (because most of the objects were |
duke@435 | 1220 | // copied out, and the remainder cannot be considered valid oops). |
duke@435 | 1221 | |
duke@435 | 1222 | ClearSpaceClosure csc; |
duke@435 | 1223 | for (int i = 0; i < gch->n_gens(); ++i) { |
duke@435 | 1224 | gch->get_gen(i)->space_iterate(&csc); |
duke@435 | 1225 | } |
duke@435 | 1226 | csc.do_space(gen->the_space()); |
duke@435 | 1227 | NOT_PRODUCT(SystemDictionary::verify();) |
duke@435 | 1228 | |
duke@435 | 1229 | // Copy the String table, the symbol table, and the system |
duke@435 | 1230 | // dictionary to the shared space in usable form. Copy the hastable |
duke@435 | 1231 | // buckets first [read-write], then copy the linked lists of entries |
duke@435 | 1232 | // [read-only]. |
duke@435 | 1233 | |
duke@435 | 1234 | SymbolTable::reverse(extra_symbols); |
duke@435 | 1235 | NOT_PRODUCT(SymbolTable::verify()); |
duke@435 | 1236 | SymbolTable::copy_buckets(&md_top, md_end); |
duke@435 | 1237 | |
duke@435 | 1238 | StringTable::reverse(); |
duke@435 | 1239 | NOT_PRODUCT(StringTable::verify()); |
duke@435 | 1240 | StringTable::copy_buckets(&md_top, md_end); |
duke@435 | 1241 | |
duke@435 | 1242 | SystemDictionary::reverse(); |
duke@435 | 1243 | SystemDictionary::copy_buckets(&md_top, md_end); |
duke@435 | 1244 | |
duke@435 | 1245 | ClassLoader::verify(); |
duke@435 | 1246 | ClassLoader::copy_package_info_buckets(&md_top, md_end); |
duke@435 | 1247 | ClassLoader::verify(); |
duke@435 | 1248 | |
duke@435 | 1249 | SymbolTable::copy_table(&md_top, md_end); |
duke@435 | 1250 | StringTable::copy_table(&md_top, md_end); |
duke@435 | 1251 | SystemDictionary::copy_table(&md_top, md_end); |
duke@435 | 1252 | ClassLoader::verify(); |
duke@435 | 1253 | ClassLoader::copy_package_info_table(&md_top, md_end); |
duke@435 | 1254 | ClassLoader::verify(); |
duke@435 | 1255 | |
duke@435 | 1256 | // Print debug data. |
duke@435 | 1257 | |
duke@435 | 1258 | if (PrintSharedSpaces) { |
duke@435 | 1259 | const char* fmt = "%s space: " PTR_FORMAT " out of " PTR_FORMAT " bytes allocated at " PTR_FORMAT "."; |
duke@435 | 1260 | tty->print_cr(fmt, "ro", _ro_space->used(), _ro_space->capacity(), |
duke@435 | 1261 | _ro_space->bottom()); |
duke@435 | 1262 | tty->print_cr(fmt, "rw", _rw_space->used(), _rw_space->capacity(), |
duke@435 | 1263 | _rw_space->bottom()); |
duke@435 | 1264 | } |
duke@435 | 1265 | |
duke@435 | 1266 | // Write the oop data to the output array. |
duke@435 | 1267 | |
duke@435 | 1268 | WriteClosure wc(md_top, md_end); |
duke@435 | 1269 | CompactingPermGenGen::serialize_oops(&wc); |
duke@435 | 1270 | md_top = wc.get_top(); |
duke@435 | 1271 | |
duke@435 | 1272 | // Update the vtable pointers in all of the Klass objects in the |
duke@435 | 1273 | // heap. They should point to newly generated vtable. |
duke@435 | 1274 | |
coleenp@2497 | 1275 | PatchKlassVtables pkvt; |
duke@435 | 1276 | _rw_space->object_iterate(&pkvt); |
coleenp@2497 | 1277 | pkvt.patch(vtbl_list, vtable); |
coleenp@2497 | 1278 | |
coleenp@2497 | 1279 | #ifndef PRODUCT |
coleenp@2497 | 1280 | // Update the vtable pointers in all symbols, |
coleenp@2497 | 1281 | // but only in non-product builds where symbols DO have virtual methods. |
coleenp@2497 | 1282 | PatchSymbolVtables psvt(vtbl_list, vtable); |
coleenp@2497 | 1283 | SymbolTable::symbols_do(&psvt); |
coleenp@2497 | 1284 | #endif |
duke@435 | 1285 | |
duke@435 | 1286 | char* saved_vtbl = (char*)malloc(vtbl_list_size * sizeof(void*)); |
duke@435 | 1287 | memmove(saved_vtbl, vtbl_list, vtbl_list_size * sizeof(void*)); |
duke@435 | 1288 | memset(vtbl_list, 0, vtbl_list_size * sizeof(void*)); |
duke@435 | 1289 | |
duke@435 | 1290 | // Create and write the archive file that maps the shared spaces. |
duke@435 | 1291 | |
duke@435 | 1292 | FileMapInfo* mapinfo = new FileMapInfo(); |
duke@435 | 1293 | mapinfo->populate_header(gch->gen_policy()->max_alignment()); |
duke@435 | 1294 | |
duke@435 | 1295 | // Pass 1 - update file offsets in header. |
duke@435 | 1296 | mapinfo->write_header(); |
duke@435 | 1297 | mapinfo->write_space(CompactingPermGenGen::ro, _ro_space, true); |
duke@435 | 1298 | _ro_space->set_saved_mark(); |
duke@435 | 1299 | mapinfo->write_space(CompactingPermGenGen::rw, _rw_space, false); |
duke@435 | 1300 | _rw_space->set_saved_mark(); |
duke@435 | 1301 | mapinfo->write_region(CompactingPermGenGen::md, _md_vs->low(), |
xlu@722 | 1302 | pointer_delta(md_top, _md_vs->low(), sizeof(char)), |
xlu@722 | 1303 | SharedMiscDataSize, |
duke@435 | 1304 | false, false); |
duke@435 | 1305 | mapinfo->write_region(CompactingPermGenGen::mc, _mc_vs->low(), |
xlu@722 | 1306 | pointer_delta(mc_top, _mc_vs->low(), sizeof(char)), |
xlu@722 | 1307 | SharedMiscCodeSize, |
duke@435 | 1308 | true, true); |
duke@435 | 1309 | |
duke@435 | 1310 | // Pass 2 - write data. |
duke@435 | 1311 | mapinfo->open_for_write(); |
duke@435 | 1312 | mapinfo->write_header(); |
duke@435 | 1313 | mapinfo->write_space(CompactingPermGenGen::ro, _ro_space, true); |
duke@435 | 1314 | mapinfo->write_space(CompactingPermGenGen::rw, _rw_space, false); |
duke@435 | 1315 | mapinfo->write_region(CompactingPermGenGen::md, _md_vs->low(), |
xlu@722 | 1316 | pointer_delta(md_top, _md_vs->low(), sizeof(char)), |
xlu@722 | 1317 | SharedMiscDataSize, |
duke@435 | 1318 | false, false); |
duke@435 | 1319 | mapinfo->write_region(CompactingPermGenGen::mc, _mc_vs->low(), |
xlu@722 | 1320 | pointer_delta(mc_top, _mc_vs->low(), sizeof(char)), |
xlu@722 | 1321 | SharedMiscCodeSize, |
duke@435 | 1322 | true, true); |
duke@435 | 1323 | mapinfo->close(); |
duke@435 | 1324 | |
duke@435 | 1325 | // Summarize heap. |
duke@435 | 1326 | memmove(vtbl_list, saved_vtbl, vtbl_list_size * sizeof(void*)); |
duke@435 | 1327 | print_contents(); |
duke@435 | 1328 | } |
duke@435 | 1329 | }; // class VM_PopulateDumpSharedSpace |
duke@435 | 1330 | |
duke@435 | 1331 | |
duke@435 | 1332 | // Populate the shared spaces and dump to a file. |
duke@435 | 1333 | |
duke@435 | 1334 | jint CompactingPermGenGen::dump_shared(GrowableArray<oop>* class_promote_order, TRAPS) { |
duke@435 | 1335 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 1336 | |
duke@435 | 1337 | // Calculate hash values for all of the (interned) strings to avoid |
duke@435 | 1338 | // writes to shared pages in the future. |
duke@435 | 1339 | |
duke@435 | 1340 | tty->print("Calculating hash values for String objects .. "); |
duke@435 | 1341 | StringHashCodeClosure shcc(THREAD); |
duke@435 | 1342 | StringTable::oops_do(&shcc); |
duke@435 | 1343 | tty->print_cr("done. "); |
duke@435 | 1344 | |
duke@435 | 1345 | CompactingPermGenGen* gen = (CompactingPermGenGen*)gch->perm_gen(); |
duke@435 | 1346 | VM_PopulateDumpSharedSpace op(class_promote_order, |
duke@435 | 1347 | gen->ro_space(), gen->rw_space(), |
duke@435 | 1348 | gen->md_space(), gen->mc_space()); |
duke@435 | 1349 | VMThread::execute(&op); |
duke@435 | 1350 | return JNI_OK; |
duke@435 | 1351 | } |
duke@435 | 1352 | |
coleenp@2497 | 1353 | void* CompactingPermGenGen::find_matching_vtbl_ptr(void** vtbl_list, |
coleenp@2497 | 1354 | void* new_vtable_start, |
coleenp@2497 | 1355 | void* obj) { |
coleenp@2497 | 1356 | void* old_vtbl_ptr = *(void**)obj; |
coleenp@2497 | 1357 | for (int i = 0; i < vtbl_list_size; i++) { |
coleenp@2497 | 1358 | if (vtbl_list[i] == old_vtbl_ptr) { |
coleenp@2497 | 1359 | return (void**)new_vtable_start + i * num_virtuals; |
coleenp@2497 | 1360 | } |
coleenp@2497 | 1361 | } |
coleenp@2497 | 1362 | ShouldNotReachHere(); |
coleenp@2497 | 1363 | return NULL; |
coleenp@2497 | 1364 | } |
coleenp@2497 | 1365 | |
duke@435 | 1366 | |
duke@435 | 1367 | class LinkClassesClosure : public ObjectClosure { |
duke@435 | 1368 | private: |
duke@435 | 1369 | Thread* THREAD; |
duke@435 | 1370 | |
duke@435 | 1371 | public: |
duke@435 | 1372 | LinkClassesClosure(Thread* thread) : THREAD(thread) {} |
duke@435 | 1373 | |
duke@435 | 1374 | void do_object(oop obj) { |
duke@435 | 1375 | if (obj->is_klass()) { |
duke@435 | 1376 | Klass* k = Klass::cast((klassOop) obj); |
duke@435 | 1377 | if (k->oop_is_instance()) { |
duke@435 | 1378 | instanceKlass* ik = (instanceKlass*) k; |
duke@435 | 1379 | // Link the class to cause the bytecodes to be rewritten and the |
duke@435 | 1380 | // cpcache to be created. |
duke@435 | 1381 | if (ik->get_init_state() < instanceKlass::linked) { |
duke@435 | 1382 | ik->link_class(THREAD); |
duke@435 | 1383 | guarantee(!HAS_PENDING_EXCEPTION, "exception in class rewriting"); |
duke@435 | 1384 | } |
duke@435 | 1385 | |
duke@435 | 1386 | // Create String objects from string initializer symbols. |
duke@435 | 1387 | ik->constants()->resolve_string_constants(THREAD); |
duke@435 | 1388 | guarantee(!HAS_PENDING_EXCEPTION, "exception resolving string constants"); |
duke@435 | 1389 | } |
duke@435 | 1390 | } |
duke@435 | 1391 | } |
duke@435 | 1392 | }; |
duke@435 | 1393 | |
duke@435 | 1394 | |
duke@435 | 1395 | // Support for a simple checksum of the contents of the class list |
duke@435 | 1396 | // file to prevent trivial tampering. The algorithm matches that in |
duke@435 | 1397 | // the MakeClassList program used by the J2SE build process. |
duke@435 | 1398 | #define JSUM_SEED ((jlong)CONST64(0xcafebabebabecafe)) |
duke@435 | 1399 | static jlong |
duke@435 | 1400 | jsum(jlong start, const char *buf, const int len) |
duke@435 | 1401 | { |
duke@435 | 1402 | jlong h = start; |
duke@435 | 1403 | char *p = (char *)buf, *e = p + len; |
duke@435 | 1404 | while (p < e) { |
duke@435 | 1405 | char c = *p++; |
duke@435 | 1406 | if (c <= ' ') { |
duke@435 | 1407 | /* Skip spaces and control characters */ |
duke@435 | 1408 | continue; |
duke@435 | 1409 | } |
duke@435 | 1410 | h = 31 * h + c; |
duke@435 | 1411 | } |
duke@435 | 1412 | return h; |
duke@435 | 1413 | } |
duke@435 | 1414 | |
duke@435 | 1415 | |
duke@435 | 1416 | |
duke@435 | 1417 | |
duke@435 | 1418 | |
duke@435 | 1419 | // Preload classes from a list, populate the shared spaces and dump to a |
duke@435 | 1420 | // file. |
duke@435 | 1421 | |
duke@435 | 1422 | void GenCollectedHeap::preload_and_dump(TRAPS) { |
duke@435 | 1423 | TraceTime timer("Dump Shared Spaces", TraceStartupTime); |
duke@435 | 1424 | ResourceMark rm; |
duke@435 | 1425 | |
duke@435 | 1426 | // Preload classes to be shared. |
ikrylov@2322 | 1427 | // Should use some os:: method rather than fopen() here. aB. |
duke@435 | 1428 | // Construct the path to the class list (in jre/lib) |
duke@435 | 1429 | // Walk up two directories from the location of the VM and |
duke@435 | 1430 | // optionally tack on "lib" (depending on platform) |
duke@435 | 1431 | char class_list_path[JVM_MAXPATHLEN]; |
duke@435 | 1432 | os::jvm_path(class_list_path, sizeof(class_list_path)); |
duke@435 | 1433 | for (int i = 0; i < 3; i++) { |
duke@435 | 1434 | char *end = strrchr(class_list_path, *os::file_separator()); |
duke@435 | 1435 | if (end != NULL) *end = '\0'; |
duke@435 | 1436 | } |
duke@435 | 1437 | int class_list_path_len = (int)strlen(class_list_path); |
duke@435 | 1438 | if (class_list_path_len >= 3) { |
duke@435 | 1439 | if (strcmp(class_list_path + class_list_path_len - 3, "lib") != 0) { |
duke@435 | 1440 | strcat(class_list_path, os::file_separator()); |
duke@435 | 1441 | strcat(class_list_path, "lib"); |
duke@435 | 1442 | } |
duke@435 | 1443 | } |
duke@435 | 1444 | strcat(class_list_path, os::file_separator()); |
duke@435 | 1445 | strcat(class_list_path, "classlist"); |
duke@435 | 1446 | |
duke@435 | 1447 | FILE* file = fopen(class_list_path, "r"); |
duke@435 | 1448 | if (file != NULL) { |
duke@435 | 1449 | jlong computed_jsum = JSUM_SEED; |
duke@435 | 1450 | jlong file_jsum = 0; |
duke@435 | 1451 | |
duke@435 | 1452 | char class_name[256]; |
duke@435 | 1453 | int class_count = 0; |
duke@435 | 1454 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 1455 | gch->_preloading_shared_classes = true; |
duke@435 | 1456 | GrowableArray<oop>* class_promote_order = new GrowableArray<oop>(); |
duke@435 | 1457 | |
duke@435 | 1458 | // Preload (and intern) strings which will be used later. |
duke@435 | 1459 | |
duke@435 | 1460 | StringTable::intern("main", THREAD); |
duke@435 | 1461 | StringTable::intern("([Ljava/lang/String;)V", THREAD); |
duke@435 | 1462 | StringTable::intern("Ljava/lang/Class;", THREAD); |
duke@435 | 1463 | |
duke@435 | 1464 | StringTable::intern("I", THREAD); // Needed for StringBuffer persistence? |
duke@435 | 1465 | StringTable::intern("Z", THREAD); // Needed for StringBuffer persistence? |
duke@435 | 1466 | |
duke@435 | 1467 | // sun.io.Converters |
duke@435 | 1468 | static const char obj_array_sig[] = "[[Ljava/lang/Object;"; |
duke@435 | 1469 | SymbolTable::lookup(obj_array_sig, (int)strlen(obj_array_sig), THREAD); |
duke@435 | 1470 | |
duke@435 | 1471 | // java.util.HashMap |
duke@435 | 1472 | static const char map_entry_array_sig[] = "[Ljava/util/Map$Entry;"; |
duke@435 | 1473 | SymbolTable::lookup(map_entry_array_sig, (int)strlen(map_entry_array_sig), |
duke@435 | 1474 | THREAD); |
duke@435 | 1475 | |
duke@435 | 1476 | tty->print("Loading classes to share ... "); |
duke@435 | 1477 | while ((fgets(class_name, sizeof class_name, file)) != NULL) { |
duke@435 | 1478 | if (*class_name == '#') { |
duke@435 | 1479 | jint fsh, fsl; |
duke@435 | 1480 | if (sscanf(class_name, "# %8x%8x\n", &fsh, &fsl) == 2) { |
duke@435 | 1481 | file_jsum = ((jlong)(fsh) << 32) | (fsl & 0xffffffff); |
duke@435 | 1482 | } |
duke@435 | 1483 | |
duke@435 | 1484 | continue; |
duke@435 | 1485 | } |
duke@435 | 1486 | // Remove trailing newline |
duke@435 | 1487 | size_t name_len = strlen(class_name); |
duke@435 | 1488 | class_name[name_len-1] = '\0'; |
duke@435 | 1489 | |
duke@435 | 1490 | computed_jsum = jsum(computed_jsum, class_name, (const int)name_len - 1); |
duke@435 | 1491 | |
duke@435 | 1492 | // Got a class name - load it. |
coleenp@2497 | 1493 | TempNewSymbol class_name_symbol = SymbolTable::new_symbol(class_name, THREAD); |
duke@435 | 1494 | guarantee(!HAS_PENDING_EXCEPTION, "Exception creating a symbol."); |
duke@435 | 1495 | klassOop klass = SystemDictionary::resolve_or_null(class_name_symbol, |
duke@435 | 1496 | THREAD); |
duke@435 | 1497 | guarantee(!HAS_PENDING_EXCEPTION, "Exception resolving a class."); |
duke@435 | 1498 | if (klass != NULL) { |
duke@435 | 1499 | if (PrintSharedSpaces) { |
duke@435 | 1500 | tty->print_cr("Shared spaces preloaded: %s", class_name); |
duke@435 | 1501 | } |
duke@435 | 1502 | |
duke@435 | 1503 | |
duke@435 | 1504 | instanceKlass* ik = instanceKlass::cast(klass); |
duke@435 | 1505 | |
duke@435 | 1506 | // Should be class load order as per -XX:+TraceClassLoadingPreorder |
duke@435 | 1507 | class_promote_order->append(ik->as_klassOop()); |
duke@435 | 1508 | |
duke@435 | 1509 | // Link the class to cause the bytecodes to be rewritten and the |
duke@435 | 1510 | // cpcache to be created. The linking is done as soon as classes |
duke@435 | 1511 | // are loaded in order that the related data structures (klass, |
duke@435 | 1512 | // cpCache, Sting constants) are located together. |
duke@435 | 1513 | |
duke@435 | 1514 | if (ik->get_init_state() < instanceKlass::linked) { |
duke@435 | 1515 | ik->link_class(THREAD); |
duke@435 | 1516 | guarantee(!(HAS_PENDING_EXCEPTION), "exception in class rewriting"); |
duke@435 | 1517 | } |
duke@435 | 1518 | |
duke@435 | 1519 | // Create String objects from string initializer symbols. |
duke@435 | 1520 | |
duke@435 | 1521 | ik->constants()->resolve_string_constants(THREAD); |
duke@435 | 1522 | |
duke@435 | 1523 | class_count++; |
duke@435 | 1524 | } else { |
duke@435 | 1525 | if (PrintSharedSpaces) { |
duke@435 | 1526 | tty->cr(); |
duke@435 | 1527 | tty->print_cr(" Preload failed: %s", class_name); |
duke@435 | 1528 | } |
duke@435 | 1529 | } |
duke@435 | 1530 | file_jsum = 0; // Checksum must be on last line of file |
duke@435 | 1531 | } |
duke@435 | 1532 | if (computed_jsum != file_jsum) { |
duke@435 | 1533 | tty->cr(); |
duke@435 | 1534 | tty->print_cr("Preload failed: checksum of class list was incorrect."); |
duke@435 | 1535 | exit(1); |
duke@435 | 1536 | } |
duke@435 | 1537 | |
duke@435 | 1538 | tty->print_cr("done. "); |
duke@435 | 1539 | |
duke@435 | 1540 | if (PrintSharedSpaces) { |
duke@435 | 1541 | tty->print_cr("Shared spaces: preloaded %d classes", class_count); |
duke@435 | 1542 | } |
duke@435 | 1543 | |
duke@435 | 1544 | // Rewrite and unlink classes. |
duke@435 | 1545 | tty->print("Rewriting and unlinking classes ... "); |
duke@435 | 1546 | // Make heap parsable |
duke@435 | 1547 | ensure_parsability(false); // arg is actually don't care |
duke@435 | 1548 | |
duke@435 | 1549 | // Link any classes which got missed. (It's not quite clear why |
duke@435 | 1550 | // they got missed.) This iteration would be unsafe if we weren't |
duke@435 | 1551 | // single-threaded at this point; however we can't do it on the VM |
duke@435 | 1552 | // thread because it requires object allocation. |
duke@435 | 1553 | LinkClassesClosure lcc(Thread::current()); |
duke@435 | 1554 | object_iterate(&lcc); |
jcoomes@2661 | 1555 | ensure_parsability(false); // arg is actually don't care |
duke@435 | 1556 | tty->print_cr("done. "); |
duke@435 | 1557 | |
duke@435 | 1558 | // Create and dump the shared spaces. |
duke@435 | 1559 | jint err = CompactingPermGenGen::dump_shared(class_promote_order, THREAD); |
duke@435 | 1560 | if (err != JNI_OK) { |
duke@435 | 1561 | fatal("Dumping shared spaces failed."); |
duke@435 | 1562 | } |
duke@435 | 1563 | |
duke@435 | 1564 | } else { |
duke@435 | 1565 | char errmsg[JVM_MAXPATHLEN]; |
ikrylov@2322 | 1566 | os::lasterror(errmsg, JVM_MAXPATHLEN); |
duke@435 | 1567 | tty->print_cr("Loading classlist failed: %s", errmsg); |
duke@435 | 1568 | exit(1); |
duke@435 | 1569 | } |
duke@435 | 1570 | |
duke@435 | 1571 | // Since various initialization steps have been undone by this process, |
duke@435 | 1572 | // it is not reasonable to continue running a java process. |
duke@435 | 1573 | exit(0); |
duke@435 | 1574 | } |