Thu, 12 Jan 2012 00:06:47 -0800
6484965: G1: piggy-back liveness accounting phase on marking
Summary: Remove the separate counting phase of concurrent marking by tracking the amount of marked bytes and the cards spanned by marked objects in marking task/worker thread local data structures, which are updated as individual objects are marked.
Reviewed-by: brutisso, tonyp
1 /*
2 * Copyright (c) 2001, 2011, 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 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1OOPCLOSURES_INLINE_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_G1OOPCLOSURES_INLINE_HPP
28 #include "gc_implementation/g1/concurrentMark.inline.hpp"
29 #include "gc_implementation/g1/g1CollectedHeap.hpp"
30 #include "gc_implementation/g1/g1OopClosures.hpp"
31 #include "gc_implementation/g1/g1RemSet.hpp"
33 /*
34 * This really ought to be an inline function, but apparently the C++
35 * compiler sometimes sees fit to ignore inline declarations. Sigh.
36 */
38 // This must a ifdef'ed because the counting it controls is in a
39 // perf-critical inner loop.
40 #define FILTERINTOCSCLOSURE_DOHISTOGRAMCOUNT 0
42 template <class T> inline void FilterIntoCSClosure::do_oop_nv(T* p) {
43 T heap_oop = oopDesc::load_heap_oop(p);
44 if (!oopDesc::is_null(heap_oop) &&
45 _g1->obj_in_cs(oopDesc::decode_heap_oop_not_null(heap_oop))) {
46 _oc->do_oop(p);
47 #if FILTERINTOCSCLOSURE_DOHISTOGRAMCOUNT
48 if (_dcto_cl != NULL)
49 _dcto_cl->incr_count();
50 #endif
51 }
52 }
54 #define FILTEROUTOFREGIONCLOSURE_DOHISTOGRAMCOUNT 0
56 template <class T> inline void FilterOutOfRegionClosure::do_oop_nv(T* p) {
57 T heap_oop = oopDesc::load_heap_oop(p);
58 if (!oopDesc::is_null(heap_oop)) {
59 HeapWord* obj_hw = (HeapWord*)oopDesc::decode_heap_oop_not_null(heap_oop);
60 if (obj_hw < _r_bottom || obj_hw >= _r_end) {
61 _oc->do_oop(p);
62 #if FILTEROUTOFREGIONCLOSURE_DOHISTOGRAMCOUNT
63 _out_of_region++;
64 #endif
65 }
66 }
67 }
69 // This closure is applied to the fields of the objects that have just been copied.
70 template <class T> inline void G1ParScanClosure::do_oop_nv(T* p) {
71 T heap_oop = oopDesc::load_heap_oop(p);
73 if (!oopDesc::is_null(heap_oop)) {
74 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
75 if (_g1->in_cset_fast_test(obj)) {
76 // We're not going to even bother checking whether the object is
77 // already forwarded or not, as this usually causes an immediate
78 // stall. We'll try to prefetch the object (for write, given that
79 // we might need to install the forwarding reference) and we'll
80 // get back to it when pop it from the queue
81 Prefetch::write(obj->mark_addr(), 0);
82 Prefetch::read(obj->mark_addr(), (HeapWordSize*2));
84 // slightly paranoid test; I'm trying to catch potential
85 // problems before we go into push_on_queue to know where the
86 // problem is coming from
87 assert((obj == oopDesc::load_decode_heap_oop(p)) ||
88 (obj->is_forwarded() &&
89 obj->forwardee() == oopDesc::load_decode_heap_oop(p)),
90 "p should still be pointing to obj or to its forwardee");
92 _par_scan_state->push_on_queue(p);
93 } else {
94 _par_scan_state->update_rs(_from, p, _par_scan_state->queue_num());
95 }
96 }
97 }
99 template <class T> inline void G1ParPushHeapRSClosure::do_oop_nv(T* p) {
100 T heap_oop = oopDesc::load_heap_oop(p);
102 if (!oopDesc::is_null(heap_oop)) {
103 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop);
104 if (_g1->in_cset_fast_test(obj)) {
105 Prefetch::write(obj->mark_addr(), 0);
106 Prefetch::read(obj->mark_addr(), (HeapWordSize*2));
108 // Place on the references queue
109 _par_scan_state->push_on_queue(p);
110 }
111 }
112 }
114 template <class T> inline void G1CMOopClosure::do_oop_nv(T* p) {
115 assert(_g1h->is_in_g1_reserved((HeapWord*) p), "invariant");
116 assert(!_g1h->is_on_master_free_list(
117 _g1h->heap_region_containing((HeapWord*) p)), "invariant");
119 oop obj = oopDesc::load_decode_heap_oop(p);
120 if (_cm->verbose_high()) {
121 gclog_or_tty->print_cr("[%d] we're looking at location "
122 "*"PTR_FORMAT" = "PTR_FORMAT,
123 _task->task_id(), p, (void*) obj);
124 }
125 _task->deal_with_reference(obj);
126 }
128 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1OOPCLOSURES_INLINE_HPP