annotate hotspot/src/share/vm/gc_implementation/g1/g1RemSet.hpp @ 17854:d65bc1546091

8013895: G1: G1SummarizeRSetStats output on Linux needs improvemen Summary: Fixed the output of G1SummarizeRSetStats: too small datatype for the number of concurrently processed cards, added concurrent remembered set thread time retrieval for Linux and Windows (BSD uses os::elapsedTime() now), and other cleanup. The information presented during VM operation is now relative to the previous output, not always cumulative if G1SummarizeRSetStatsPeriod > 0. At VM exit, the code prints a cumulative summary. Reviewed-by: johnc, jwilhelm
author tschatzl
date Tue, 28 May 2013 09:32:06 +0200
parents 4bd0581aa231
children d247781beec7
rev   line source
ysr@1374 1 /*
johnc@17327 2 * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved.
ysr@1374 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
ysr@1374 4 *
ysr@1374 5 * This code is free software; you can redistribute it and/or modify it
ysr@1374 6 * under the terms of the GNU General Public License version 2 only, as
ysr@1374 7 * published by the Free Software Foundation.
ysr@1374 8 *
ysr@1374 9 * This code is distributed in the hope that it will be useful, but WITHOUT
ysr@1374 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
ysr@1374 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
ysr@1374 12 * version 2 for more details (a copy is included in the LICENSE file that
ysr@1374 13 * accompanied this code).
ysr@1374 14 *
ysr@1374 15 * You should have received a copy of the GNU General Public License version
ysr@1374 16 * 2 along with this work; if not, write to the Free Software Foundation,
ysr@1374 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
ysr@1374 18 *
trims@5547 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@5547 20 * or visit www.oracle.com if you need additional information or have any
trims@5547 21 * questions.
ysr@1374 22 *
ysr@1374 23 */
ysr@1374 24
stefank@7397 25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1REMSET_HPP
stefank@7397 26 #define SHARE_VM_GC_IMPLEMENTATION_G1_G1REMSET_HPP
stefank@7397 27
tschatzl@17854 28 #include "gc_implementation/g1/g1RemSetSummary.hpp"
tschatzl@17854 29
ysr@1374 30 // A G1RemSet provides ways of iterating over pointers into a selected
ysr@1374 31 // collection set.
ysr@1374 32
ysr@1374 33 class G1CollectedHeap;
ysr@1374 34 class CardTableModRefBarrierSet;
ysr@1374 35 class ConcurrentG1Refine;
ysr@1374 36
johnc@6958 37 // A G1RemSet in which each heap region has a rem set that records the
johnc@6958 38 // external heap references into it. Uses a mod ref bs to track updates,
johnc@6958 39 // so that they can be used to update the individual region remsets.
johnc@6958 40
zgu@13195 41 class G1RemSet: public CHeapObj<mtGC> {
tschatzl@17854 42 private:
tschatzl@17854 43 G1RemSetSummary _prev_period_summary;
ysr@1374 44 protected:
ysr@1374 45 G1CollectedHeap* _g1;
tschatzl@17854 46 size_t _conc_refine_cards;
jmasa@11396 47 uint n_workers();
ysr@1374 48
ysr@1374 49 protected:
ysr@1374 50 enum SomePrivateConstants {
ysr@1374 51 UpdateRStoMergeSync = 0,
ysr@1374 52 MergeRStoDoDirtySync = 1,
ysr@1374 53 DoDirtySync = 2,
ysr@1374 54 LastSync = 3,
ysr@1374 55
ysr@1374 56 SeqTask = 0,
ysr@1374 57 NumSeqTasks = 1
ysr@1374 58 };
ysr@1374 59
johnc@17108 60 CardTableModRefBS* _ct_bs;
johnc@17108 61 SubTasksDone* _seq_task;
johnc@17108 62 G1CollectorPolicy* _g1p;
ysr@1374 63
johnc@17108 64 ConcurrentG1Refine* _cg1r;
ysr@1374 65
johnc@17108 66 size_t* _cards_scanned;
johnc@17108 67 size_t _total_cards_scanned;
ysr@1374 68
johnc@6247 69 // Used for caching the closure that is responsible for scanning
johnc@6247 70 // references into the collection set.
johnc@6247 71 OopsInHeapRegionClosure** _cset_rs_update_cl;
ysr@3262 72
tschatzl@17854 73 // Print the given summary info
tschatzl@17854 74 virtual void print_summary_info(G1RemSetSummary * summary, const char * header = NULL);
ysr@1374 75 public:
ysr@1374 76 // This is called to reset dual hash tables after the gc pause
ysr@1374 77 // is finished and the initial hash table is no longer being
ysr@1374 78 // scanned.
ysr@1374 79 void cleanupHRRS();
ysr@1374 80
johnc@6958 81 G1RemSet(G1CollectedHeap* g1, CardTableModRefBS* ct_bs);
johnc@6958 82 ~G1RemSet();
ysr@1374 83
johnc@6958 84 // Invoke "blk->do_oop" on all pointers into the CS in objects in regions
johnc@6958 85 // outside the CS (having invoked "blk->set_region" to set the "from"
johnc@6958 86 // region correctly beforehand.) The "worker_i" param is for the
johnc@6958 87 // parallel case where the number of the worker thread calling this
johnc@6958 88 // function can be helpful in partitioning the work to be done. It
johnc@6958 89 // should be the same as the "i" passed to the calling thread's
johnc@6958 90 // work(i) function. In the sequential case this param will be ingored.
johnc@17327 91 void oops_into_collection_set_do(OopsInHeapRegionClosure* blk, int worker_i);
ysr@1374 92
johnc@6958 93 // Prepare for and cleanup after an oops_into_collection_set_do
johnc@6958 94 // call. Must call each of these once before and after (in sequential
johnc@6958 95 // code) any threads call oops_into_collection_set_do. (This offers an
johnc@6958 96 // opportunity to sequential setup and teardown of structures needed by a
johnc@6958 97 // parallel iteration over the CS's RS.)
ysr@1374 98 void prepare_for_oops_into_collection_set_do();
ysr@1374 99 void cleanup_after_oops_into_collection_set_do();
johnc@6958 100
ysr@1374 101 void scanRS(OopsInHeapRegionClosure* oc, int worker_i);
johnc@6247 102 void updateRS(DirtyCardQueue* into_cset_dcq, int worker_i);
johnc@6958 103
ysr@1374 104 CardTableModRefBS* ct_bs() { return _ct_bs; }
ysr@1374 105 size_t cardsScanned() { return _total_cards_scanned; }
ysr@1374 106
ysr@1374 107 // Record, if necessary, the fact that *p (where "p" is in region "from",
ysr@1374 108 // which is required to be non-NULL) has changed to a new non-NULL value.
johnc@7385 109 template <class T> void write_ref(HeapRegion* from, T* p);
johnc@7385 110 template <class T> void par_write_ref(HeapRegion* from, T* p, int tid);
ysr@1374 111
johnc@6958 112 // Requires "region_bm" and "card_bm" to be bitmaps with 1 bit per region
johnc@6958 113 // or card, respectively, such that a region or card with a corresponding
johnc@6958 114 // 0 bit contains no part of any live object. Eliminates any remembered
johnc@6958 115 // set entries that correspond to dead heap ranges.
ysr@1374 116 void scrub(BitMap* region_bm, BitMap* card_bm);
johnc@6958 117
johnc@6958 118 // Like the above, but assumes is called in parallel: "worker_num" is the
johnc@6958 119 // parallel thread id of the current thread, and "claim_val" is the
johnc@6958 120 // value that should be used to claim heap regions.
ysr@1374 121 void scrub_par(BitMap* region_bm, BitMap* card_bm,
jmasa@11396 122 uint worker_num, int claim_val);
ysr@1374 123
johnc@17327 124 // Refine the card corresponding to "card_ptr".
johnc@6958 125 // If check_for_refs_into_cset is true, a true result is returned
johnc@6958 126 // if the given card contains oops that have references into the
johnc@6958 127 // current collection set.
johnc@17327 128 virtual bool refine_card(jbyte* card_ptr,
johnc@17327 129 int worker_i,
johnc@17327 130 bool check_for_refs_into_cset);
ysr@1374 131
tschatzl@17854 132 // Print accumulated summary info from the start of the VM.
ysr@1374 133 virtual void print_summary_info();
johnc@6958 134
tschatzl@17854 135 // Print accumulated summary info from the last time called.
tschatzl@17854 136 virtual void print_periodic_summary_info();
tschatzl@17854 137
johnc@6958 138 // Prepare remembered set for verification.
ysr@1374 139 virtual void prepare_for_verify();
tschatzl@17854 140
tschatzl@17854 141 size_t conc_refine_cards() const {
tschatzl@17854 142 return _conc_refine_cards;
tschatzl@17854 143 }
ysr@1374 144 };
ysr@1374 145
ysr@1374 146 class CountNonCleanMemRegionClosure: public MemRegionClosure {
ysr@1374 147 G1CollectedHeap* _g1;
ysr@1374 148 int _n;
ysr@1374 149 HeapWord* _start_first;
ysr@1374 150 public:
ysr@1374 151 CountNonCleanMemRegionClosure(G1CollectedHeap* g1) :
ysr@1374 152 _g1(g1), _n(0), _start_first(NULL)
ysr@1374 153 {}
ysr@1374 154 void do_MemRegion(MemRegion mr);
ysr@1374 155 int n() { return _n; };
ysr@1374 156 HeapWord* start_first() { return _start_first; }
ysr@1374 157 };
apetrusenko@2152 158
coleenp@13728 159 class UpdateRSOopClosure: public ExtendedOopClosure {
apetrusenko@2152 160 HeapRegion* _from;
johnc@6958 161 G1RemSet* _rs;
apetrusenko@2152 162 int _worker_i;
ysr@3262 163
ysr@3262 164 template <class T> void do_oop_work(T* p);
ysr@3262 165
apetrusenko@2152 166 public:
johnc@6958 167 UpdateRSOopClosure(G1RemSet* rs, int worker_i = 0) :
johnc@7385 168 _from(NULL), _rs(rs), _worker_i(worker_i)
johnc@7385 169 {}
apetrusenko@2152 170
apetrusenko@2152 171 void set_from(HeapRegion* from) {
apetrusenko@2152 172 assert(from != NULL, "from region must be non-NULL");
apetrusenko@2152 173 _from = from;
apetrusenko@2152 174 }
apetrusenko@2152 175
ysr@3262 176 virtual void do_oop(narrowOop* p) { do_oop_work(p); }
ysr@3262 177 virtual void do_oop(oop* p) { do_oop_work(p); }
apetrusenko@2152 178
apetrusenko@2152 179 // Override: this closure is idempotent.
apetrusenko@2152 180 // bool idempotent() { return true; }
apetrusenko@2152 181 bool apply_to_weak_ref_discovered_field() { return true; }
apetrusenko@2152 182 };
johnc@6247 183
johnc@6247 184 class UpdateRSetImmediate: public OopsInHeapRegionClosure {
johnc@6247 185 private:
johnc@6247 186 G1RemSet* _g1_rem_set;
johnc@6247 187
johnc@6247 188 template <class T> void do_oop_work(T* p);
johnc@6247 189 public:
johnc@6247 190 UpdateRSetImmediate(G1RemSet* rs) :
johnc@6247 191 _g1_rem_set(rs) {}
johnc@6247 192
johnc@6247 193 virtual void do_oop(narrowOop* p) { do_oop_work(p); }
johnc@6247 194 virtual void do_oop( oop* p) { do_oop_work(p); }
johnc@6247 195 };
johnc@7385 196
stefank@7397 197
stefank@7397 198 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1REMSET_HPP