src/share/vm/gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp

Sat, 01 Dec 2007 00:00:00 +0000

author
duke
date
Sat, 01 Dec 2007 00:00:00 +0000
changeset 435
a61af66fc99e
child 1370
05f89f00a864
permissions
-rw-r--r--

Initial load

     1 /*
     2  * Copyright (c) 2007 Sun Microsystems, Inc.  All Rights Reserved.
     3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     4  *
     5  * This code is free software; you can redistribute it and/or modify it
     6  * under the terms of the GNU General Public License version 2 only, as
     7  * published by the Free Software Foundation.
     8  *
     9  * This code is distributed in the hope that it will be useful, but WITHOUT
    10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    12  * version 2 for more details (a copy is included in the LICENSE file that
    13  * accompanied this code).
    14  *
    15  * You should have received a copy of the GNU General Public License version
    16  * 2 along with this work; if not, write to the Free Software Foundation,
    17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
    18  *
    19  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
    20  * CA 95054 USA or visit www.sun.com if you need additional information or
    21  * have any questions.
    22  *
    23  */
    25 // Trim our work_queue so its length is below max at return
    26 inline void Par_MarkRefsIntoAndScanClosure::trim_queue(uint max) {
    27   while (_work_queue->size() > max) {
    28     oop newOop;
    29     if (_work_queue->pop_local(newOop)) {
    30       assert(newOop->is_oop(), "Expected an oop");
    31       assert(_bit_map->isMarked((HeapWord*)newOop),
    32              "only grey objects on this stack");
    33       // iterate over the oops in this oop, marking and pushing
    34       // the ones in CMS heap (i.e. in _span).
    35       newOop->oop_iterate(&_par_pushAndMarkClosure);
    36     }
    37   }
    38 }
    40 inline void PushOrMarkClosure::remember_klass(Klass* k) {
    41   if (!_revisitStack->push(oop(k))) {
    42     fatal("Revisit stack overflow in PushOrMarkClosure");
    43   }
    44 }
    46 inline void Par_PushOrMarkClosure::remember_klass(Klass* k) {
    47   if (!_revisit_stack->par_push(oop(k))) {
    48     fatal("Revisit stack overflow in PushOrMarkClosure");
    49   }
    50 }
    52 inline void PushOrMarkClosure::do_yield_check() {
    53   _parent->do_yield_check();
    54 }
    56 inline void Par_PushOrMarkClosure::do_yield_check() {
    57   _parent->do_yield_check();
    58 }

mercurial