Tue, 21 Aug 2012 14:10:39 -0700
7185699: G1: Prediction model discrepancies
Summary: Correct the result value of G1CollectedHeap::pending_card_num(). Change the code that calculates the GC efficiency of a non-young heap region to use historical data from mixed GCs and the actual number of live bytes when predicting how long it would take to collect the region. Changes were also reviewed by Thomas Schatzl.
Reviewed-by: azeemj, brutisso
1 /*
2 * Copyright (c) 2001, 2012, 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_G1REMSET_INLINE_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_G1REMSET_INLINE_HPP
28 #include "gc_implementation/g1/g1RemSet.hpp"
29 #include "gc_implementation/g1/heapRegionRemSet.hpp"
30 #include "oops/oop.inline.hpp"
32 inline uint G1RemSet::n_workers() {
33 if (_g1->workers() != NULL) {
34 return _g1->workers()->total_workers();
35 } else {
36 return 1;
37 }
38 }
40 template <class T>
41 inline void G1RemSet::write_ref(HeapRegion* from, T* p) {
42 par_write_ref(from, p, 0);
43 }
45 template <class T>
46 inline void G1RemSet::par_write_ref(HeapRegion* from, T* p, int tid) {
47 oop obj = oopDesc::load_decode_heap_oop(p);
48 #ifdef ASSERT
49 // can't do because of races
50 // assert(obj == NULL || obj->is_oop(), "expected an oop");
52 // Do the safe subset of is_oop
53 if (obj != NULL) {
54 #ifdef CHECK_UNHANDLED_OOPS
55 oopDesc* o = obj.obj();
56 #else
57 oopDesc* o = obj;
58 #endif // CHECK_UNHANDLED_OOPS
59 assert((intptr_t)o % MinObjAlignmentInBytes == 0, "not oop aligned");
60 assert(Universe::heap()->is_in_reserved(obj), "must be in heap");
61 }
62 #endif // ASSERT
64 assert(from == NULL || from->is_in_reserved(p), "p is not in from");
66 HeapRegion* to = _g1->heap_region_containing(obj);
67 if (to != NULL && from != to) {
68 assert(to->rem_set() != NULL, "Need per-region 'into' remsets.");
69 to->rem_set()->add_reference(p, tid);
70 }
71 }
73 template <class T>
74 inline void UpdateRSOopClosure::do_oop_work(T* p) {
75 assert(_from != NULL, "from region must be non-NULL");
76 _rs->par_write_ref(_from, p, _worker_i);
77 }
79 template <class T>
80 inline void UpdateRSetImmediate::do_oop_work(T* p) {
81 assert(_from->is_in_reserved(p), "paranoia");
82 T heap_oop = oopDesc::load_heap_oop(p);
83 if (!oopDesc::is_null(heap_oop) && !_from->is_survivor()) {
84 _g1_rem_set->par_write_ref(_from, p, 0);
85 }
86 }
88 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1REMSET_INLINE_HPP