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

ysr@777 1 /*
johnc@2060 2 * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved.
ysr@777 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
ysr@777 4 *
ysr@777 5 * This code is free software; you can redistribute it and/or modify it
ysr@777 6 * under the terms of the GNU General Public License version 2 only, as
ysr@777 7 * published by the Free Software Foundation.
ysr@777 8 *
ysr@777 9 * This code is distributed in the hope that it will be useful, but WITHOUT
ysr@777 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
ysr@777 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
ysr@777 12 * version 2 for more details (a copy is included in the LICENSE file that
ysr@777 13 * accompanied this code).
ysr@777 14 *
ysr@777 15 * You should have received a copy of the GNU General Public License version
ysr@777 16 * 2 along with this work; if not, write to the Free Software Foundation,
ysr@777 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
ysr@777 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.
ysr@777 22 *
ysr@777 23 */
ysr@777 24
ysr@777 25 /*
ysr@777 26 * This really ought to be an inline function, but apparently the C++
ysr@777 27 * compiler sometimes sees fit to ignore inline declarations. Sigh.
ysr@777 28 */
ysr@777 29
ysr@777 30 // This must a ifdef'ed because the counting it controls is in a
ysr@777 31 // perf-critical inner loop.
ysr@777 32 #define FILTERINTOCSCLOSURE_DOHISTOGRAMCOUNT 0
ysr@777 33
ysr@1280 34 template <class T> inline void FilterIntoCSClosure::do_oop_nv(T* p) {
ysr@1280 35 T heap_oop = oopDesc::load_heap_oop(p);
ysr@1280 36 if (!oopDesc::is_null(heap_oop) &&
ysr@1280 37 _g1->obj_in_cs(oopDesc::decode_heap_oop_not_null(heap_oop))) {
ysr@777 38 _oc->do_oop(p);
ysr@777 39 #if FILTERINTOCSCLOSURE_DOHISTOGRAMCOUNT
johnc@2060 40 if (_dcto_cl != NULL)
johnc@2060 41 _dcto_cl->incr_count();
ysr@777 42 #endif
ysr@777 43 }
ysr@777 44 }
ysr@777 45
ysr@777 46 #define FILTEROUTOFREGIONCLOSURE_DOHISTOGRAMCOUNT 0
ysr@777 47
ysr@1280 48 template <class T> inline void FilterOutOfRegionClosure::do_oop_nv(T* p) {
ysr@1280 49 T heap_oop = oopDesc::load_heap_oop(p);
ysr@1280 50 if (!oopDesc::is_null(heap_oop)) {
ysr@1280 51 HeapWord* obj_hw = (HeapWord*)oopDesc::decode_heap_oop_not_null(heap_oop);
ysr@1280 52 if (obj_hw < _r_bottom || obj_hw >= _r_end) {
ysr@1280 53 _oc->do_oop(p);
ysr@777 54 #if FILTEROUTOFREGIONCLOSURE_DOHISTOGRAMCOUNT
ysr@1280 55 _out_of_region++;
ysr@777 56 #endif
ysr@1280 57 }
ysr@777 58 }
ysr@777 59 }
ysr@777 60
ysr@1280 61 template <class T> inline void FilterInHeapRegionAndIntoCSClosure::do_oop_nv(T* p) {
ysr@1280 62 T heap_oop = oopDesc::load_heap_oop(p);
ysr@1280 63 if (!oopDesc::is_null(heap_oop) &&
ysr@1280 64 _g1->obj_in_cs(oopDesc::decode_heap_oop_not_null(heap_oop)))
ysr@777 65 _oc->do_oop(p);
ysr@777 66 }
ysr@777 67
ysr@1280 68 template <class T> inline void FilterAndMarkInHeapRegionAndIntoCSClosure::do_oop_nv(T* p) {
ysr@1280 69 T heap_oop = oopDesc::load_heap_oop(p);
ysr@1280 70 if (!oopDesc::is_null(heap_oop)) {
ysr@1280 71 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
ysr@777 72 HeapRegion* hr = _g1->heap_region_containing((HeapWord*) obj);
ysr@777 73 if (hr != NULL) {
ysr@777 74 if (hr->in_collection_set())
ysr@777 75 _oc->do_oop(p);
ysr@777 76 else if (!hr->is_young())
ysr@777 77 _cm->grayRoot(obj);
ysr@777 78 }
ysr@777 79 }
ysr@777 80 }
ysr@777 81
ysr@1280 82 // This closure is applied to the fields of the objects that have just been copied.
ysr@1280 83 template <class T> inline void G1ParScanClosure::do_oop_nv(T* p) {
ysr@1280 84 T heap_oop = oopDesc::load_heap_oop(p);
ysr@1280 85
ysr@1280 86 if (!oopDesc::is_null(heap_oop)) {
ysr@1280 87 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
ysr@1280 88 if (_g1->in_cset_fast_test(obj)) {
ysr@1280 89 // We're not going to even bother checking whether the object is
ysr@1280 90 // already forwarded or not, as this usually causes an immediate
ysr@1280 91 // stall. We'll try to prefetch the object (for write, given that
ysr@1280 92 // we might need to install the forwarding reference) and we'll
ysr@1280 93 // get back to it when pop it from the queue
ysr@1280 94 Prefetch::write(obj->mark_addr(), 0);
ysr@1280 95 Prefetch::read(obj->mark_addr(), (HeapWordSize*2));
ysr@1280 96
ysr@1280 97 // slightly paranoid test; I'm trying to catch potential
ysr@1280 98 // problems before we go into push_on_queue to know where the
ysr@1280 99 // problem is coming from
ysr@1280 100 assert(obj == oopDesc::load_decode_heap_oop(p),
ysr@1280 101 "p should still be pointing to obj");
ysr@1280 102 _par_scan_state->push_on_queue(p);
ysr@1280 103 } else {
ysr@1280 104 _par_scan_state->update_rs(_from, p, _par_scan_state->queue_num());
ysr@1280 105 }
ysr@1280 106 }
ysr@777 107 }
iveresov@1696 108
iveresov@1696 109 template <class T> inline void G1ParPushHeapRSClosure::do_oop_nv(T* p) {
iveresov@1696 110 T heap_oop = oopDesc::load_heap_oop(p);
iveresov@1696 111
iveresov@1696 112 if (!oopDesc::is_null(heap_oop)) {
iveresov@1696 113 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
iveresov@1696 114 if (_g1->in_cset_fast_test(obj)) {
iveresov@1696 115 Prefetch::write(obj->mark_addr(), 0);
iveresov@1696 116 Prefetch::read(obj->mark_addr(), (HeapWordSize*2));
johnc@2060 117
johnc@2060 118 // Place on the references queue
iveresov@1696 119 _par_scan_state->push_on_queue(p);
iveresov@1696 120 }
iveresov@1696 121 }
iveresov@1696 122 }
johnc@2060 123

mercurial