jdk8-mips64-public/hotspot: src/share/vm/gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp@e018e6884bd8

6631166: CMS: better heuristics when combatting fragmentation
Summary: Autonomic per-worker free block cache sizing, tunable coalition policies, fixes to per-size block statistics, retuned gain and bandwidth of some feedback loop filters to allow quicker reactivity to abrupt changes in ambient demand, and other heuristics to reduce fragmentation of the CMS old gen. Also tightened some assertions, including those related to locking.
Reviewed-by: jmasa

     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 #ifndef PRODUCT

    41 void KlassRememberingOopClosure::check_remember_klasses() const {

    42   assert(_should_remember_klasses == must_remember_klasses(),

    43     "Should remember klasses in this context.");

    44 }

    45 #endif

    47 void KlassRememberingOopClosure::remember_klass(Klass* k) {

    48   if (!_revisit_stack->push(oop(k))) {

    49     fatal("Revisit stack overflow in PushOrMarkClosure");

    50   }

    51   check_remember_klasses();

    52 }

    54 inline void PushOrMarkClosure::remember_mdo(DataLayout* v) {

    55   // TBD

    56 }

    59 void Par_KlassRememberingOopClosure::remember_klass(Klass* k) {

    60   if (!_revisit_stack->par_push(oop(k))) {

    61     fatal("Revisit stack overflow in Par_KlassRememberingOopClosure");

    62   }

    63   check_remember_klasses();

    64 }

    66 inline void Par_PushOrMarkClosure::remember_mdo(DataLayout* v) {

    67   // TBD

    68 }

    70 inline void PushOrMarkClosure::do_yield_check() {

    71   _parent->do_yield_check();

    72 }

    74 inline void Par_PushOrMarkClosure::do_yield_check() {

    75   _parent->do_yield_check();

    76 }

Mercurial > jdk8-mips64-public > hotspot / file revision

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

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