Mon, 10 May 2010 12:31:52 -0700
6951188: CMS: move PromotionInfo into its own file
Summary: Moved PromotionInfo and friends into new files promotionInfo.{h,c}pp from their previous compactibleFreeListSpace.{h,c}pp home.
Reviewed-by: apetrusenko
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright (c) 2007 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 | // Trim our work_queue so its length is below max at return |
duke@435 | 26 | inline void Par_MarkRefsIntoAndScanClosure::trim_queue(uint max) { |
duke@435 | 27 | while (_work_queue->size() > max) { |
duke@435 | 28 | oop newOop; |
duke@435 | 29 | if (_work_queue->pop_local(newOop)) { |
duke@435 | 30 | assert(newOop->is_oop(), "Expected an oop"); |
duke@435 | 31 | assert(_bit_map->isMarked((HeapWord*)newOop), |
duke@435 | 32 | "only grey objects on this stack"); |
duke@435 | 33 | // iterate over the oops in this oop, marking and pushing |
duke@435 | 34 | // the ones in CMS heap (i.e. in _span). |
duke@435 | 35 | newOop->oop_iterate(&_par_pushAndMarkClosure); |
duke@435 | 36 | } |
duke@435 | 37 | } |
duke@435 | 38 | } |
duke@435 | 39 | |
jmasa@1370 | 40 | #ifndef PRODUCT |
jmasa@1370 | 41 | void KlassRememberingOopClosure::check_remember_klasses() const { |
jmasa@1370 | 42 | assert(_should_remember_klasses == must_remember_klasses(), |
jmasa@1370 | 43 | "Should remember klasses in this context."); |
jmasa@1370 | 44 | } |
jmasa@1370 | 45 | #endif |
jmasa@1370 | 46 | |
jmasa@1370 | 47 | void KlassRememberingOopClosure::remember_klass(Klass* k) { |
jmasa@1370 | 48 | if (!_revisit_stack->push(oop(k))) { |
duke@435 | 49 | fatal("Revisit stack overflow in PushOrMarkClosure"); |
duke@435 | 50 | } |
jmasa@1370 | 51 | check_remember_klasses(); |
duke@435 | 52 | } |
duke@435 | 53 | |
ysr@1376 | 54 | inline void PushOrMarkClosure::remember_mdo(DataLayout* v) { |
ysr@1376 | 55 | // TBD |
ysr@1376 | 56 | } |
ysr@1376 | 57 | |
ysr@1376 | 58 | |
jmasa@1370 | 59 | void Par_KlassRememberingOopClosure::remember_klass(Klass* k) { |
duke@435 | 60 | if (!_revisit_stack->par_push(oop(k))) { |
ysr@1376 | 61 | fatal("Revisit stack overflow in Par_KlassRememberingOopClosure"); |
duke@435 | 62 | } |
jmasa@1370 | 63 | check_remember_klasses(); |
duke@435 | 64 | } |
duke@435 | 65 | |
ysr@1376 | 66 | inline void Par_PushOrMarkClosure::remember_mdo(DataLayout* v) { |
ysr@1376 | 67 | // TBD |
ysr@1376 | 68 | } |
ysr@1376 | 69 | |
duke@435 | 70 | inline void PushOrMarkClosure::do_yield_check() { |
duke@435 | 71 | _parent->do_yield_check(); |
duke@435 | 72 | } |
duke@435 | 73 | |
duke@435 | 74 | inline void Par_PushOrMarkClosure::do_yield_check() { |
duke@435 | 75 | _parent->do_yield_check(); |
duke@435 | 76 | } |