src/share/vm/gc_implementation/g1/g1OopClosures.inline.hpp

Mon, 09 Aug 2010 05:41:05 -0700

author
jcoomes
date
Mon, 09 Aug 2010 05:41:05 -0700
changeset 2064
5f429ee79634
parent 2060
2d160770d2e5
child 2314
f95d63e2154a
permissions
-rw-r--r--

6966222: G1: simplify TaskQueue overflow handling
Reviewed-by: tonyp, ysr

     1 /*
     2  * Copyright (c) 2001, 2010, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
    20  * or visit www.oracle.com if you need additional information or have any
    21  * questions.
    22  *
    23  */
    25 /*
    26  * This really ought to be an inline function, but apparently the C++
    27  * compiler sometimes sees fit to ignore inline declarations.  Sigh.
    28  */
    30 // This must a ifdef'ed because the counting it controls is in a
    31 // perf-critical inner loop.
    32 #define FILTERINTOCSCLOSURE_DOHISTOGRAMCOUNT 0
    34 template <class T> inline void FilterIntoCSClosure::do_oop_nv(T* p) {
    35   T heap_oop = oopDesc::load_heap_oop(p);
    36   if (!oopDesc::is_null(heap_oop) &&
    37       _g1->obj_in_cs(oopDesc::decode_heap_oop_not_null(heap_oop))) {
    38     _oc->do_oop(p);
    39 #if FILTERINTOCSCLOSURE_DOHISTOGRAMCOUNT
    40     if (_dcto_cl != NULL)
    41       _dcto_cl->incr_count();
    42 #endif
    43   }
    44 }
    46 #define FILTEROUTOFREGIONCLOSURE_DOHISTOGRAMCOUNT 0
    48 template <class T> inline void FilterOutOfRegionClosure::do_oop_nv(T* p) {
    49   T heap_oop = oopDesc::load_heap_oop(p);
    50   if (!oopDesc::is_null(heap_oop)) {
    51     HeapWord* obj_hw = (HeapWord*)oopDesc::decode_heap_oop_not_null(heap_oop);
    52     if (obj_hw < _r_bottom || obj_hw >= _r_end) {
    53       _oc->do_oop(p);
    54 #if FILTEROUTOFREGIONCLOSURE_DOHISTOGRAMCOUNT
    55       _out_of_region++;
    56 #endif
    57     }
    58   }
    59 }
    61 template <class T> inline void FilterInHeapRegionAndIntoCSClosure::do_oop_nv(T* p) {
    62   T heap_oop = oopDesc::load_heap_oop(p);
    63   if (!oopDesc::is_null(heap_oop) &&
    64       _g1->obj_in_cs(oopDesc::decode_heap_oop_not_null(heap_oop)))
    65     _oc->do_oop(p);
    66 }
    68 template <class T> inline void FilterAndMarkInHeapRegionAndIntoCSClosure::do_oop_nv(T* p) {
    69   T heap_oop = oopDesc::load_heap_oop(p);
    70   if (!oopDesc::is_null(heap_oop)) {
    71     oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
    72     HeapRegion* hr = _g1->heap_region_containing((HeapWord*) obj);
    73     if (hr != NULL) {
    74       if (hr->in_collection_set())
    75         _oc->do_oop(p);
    76       else if (!hr->is_young())
    77         _cm->grayRoot(obj);
    78     }
    79   }
    80 }
    82 // This closure is applied to the fields of the objects that have just been copied.
    83 template <class T> inline void G1ParScanClosure::do_oop_nv(T* p) {
    84   T heap_oop = oopDesc::load_heap_oop(p);
    86   if (!oopDesc::is_null(heap_oop)) {
    87     oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
    88     if (_g1->in_cset_fast_test(obj)) {
    89       // We're not going to even bother checking whether the object is
    90       // already forwarded or not, as this usually causes an immediate
    91       // stall. We'll try to prefetch the object (for write, given that
    92       // we might need to install the forwarding reference) and we'll
    93       // get back to it when pop it from the queue
    94       Prefetch::write(obj->mark_addr(), 0);
    95       Prefetch::read(obj->mark_addr(), (HeapWordSize*2));
    97       // slightly paranoid test; I'm trying to catch potential
    98       // problems before we go into push_on_queue to know where the
    99       // problem is coming from
   100       assert(obj == oopDesc::load_decode_heap_oop(p),
   101              "p should still be pointing to obj");
   102       _par_scan_state->push_on_queue(p);
   103     } else {
   104       _par_scan_state->update_rs(_from, p, _par_scan_state->queue_num());
   105     }
   106   }
   107 }
   109 template <class T> inline void G1ParPushHeapRSClosure::do_oop_nv(T* p) {
   110   T heap_oop = oopDesc::load_heap_oop(p);
   112   if (!oopDesc::is_null(heap_oop)) {
   113     oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
   114     if (_g1->in_cset_fast_test(obj)) {
   115       Prefetch::write(obj->mark_addr(), 0);
   116       Prefetch::read(obj->mark_addr(), (HeapWordSize*2));
   118       // Place on the references queue
   119       _par_scan_state->push_on_queue(p);
   120     }
   121   }
   122 }

mercurial