g1RemSet.hpp 6.9 KB
Newer Older
1
/*
2
 * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved.
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
19 20 21
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
22 23 24
 *
 */

25 26 27
#ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1REMSET_HPP
#define SHARE_VM_GC_IMPLEMENTATION_G1_G1REMSET_HPP

28 29
#include "gc_implementation/g1/g1RemSetSummary.hpp"

30 31 32 33 34 35
// A G1RemSet provides ways of iterating over pointers into a selected
// collection set.

class G1CollectedHeap;
class CardTableModRefBarrierSet;
class ConcurrentG1Refine;
36
class G1ParPushHeapRSClosure;
37

38 39 40 41
// A G1RemSet in which each heap region has a rem set that records the
// external heap references into it.  Uses a mod ref bs to track updates,
// so that they can be used to update the individual region remsets.

Z
zgu 已提交
42
class G1RemSet: public CHeapObj<mtGC> {
43 44
private:
  G1RemSetSummary _prev_period_summary;
45 46
protected:
  G1CollectedHeap* _g1;
47
  size_t _conc_refine_cards;
48
  uint n_workers();
49 50 51 52 53 54 55 56 57 58 59 60

protected:
  enum SomePrivateConstants {
    UpdateRStoMergeSync  = 0,
    MergeRStoDoDirtySync = 1,
    DoDirtySync          = 2,
    LastSync             = 3,

    SeqTask              = 0,
    NumSeqTasks          = 1
  };

61 62
  CardTableModRefBS*     _ct_bs;
  G1CollectorPolicy*     _g1p;
63

64
  ConcurrentG1Refine*    _cg1r;
65

66 67
  size_t*                _cards_scanned;
  size_t                 _total_cards_scanned;
68

J
johnc 已提交
69 70
  // Used for caching the closure that is responsible for scanning
  // references into the collection set.
71
  G1ParPushHeapRSClosure** _cset_rs_update_cl;
72

73 74
  // Print the given summary info
  virtual void print_summary_info(G1RemSetSummary * summary, const char * header = NULL);
75 76 77 78 79 80
public:
  // This is called to reset dual hash tables after the gc pause
  // is finished and the initial hash table is no longer being
  // scanned.
  void cleanupHRRS();

81 82
  G1RemSet(G1CollectedHeap* g1, CardTableModRefBS* ct_bs);
  ~G1RemSet();
83

J
johnc 已提交
84 85 86 87 88 89 90 91 92 93 94 95 96 97
  // Invoke "blk->do_oop" on all pointers into the collection set
  // from objects in regions outside the collection set (having
  // invoked "blk->set_region" to set the "from" region correctly
  // beforehand.)
  //
  // Invoke code_root_cl->do_code_blob on the unmarked nmethods
  // on the strong code roots list for each region in the
  // collection set.
  //
  // The "worker_i" param is for the parallel case where the id
  // of the worker thread calling this function can be helpful in
  // partitioning the work to be done. It should be the same as
  // the "i" passed to the calling thread's work(i) function.
  // In the sequential case this param will be ignored.
98
  void oops_into_collection_set_do(G1ParPushHeapRSClosure* blk,
99
                                   CodeBlobClosure* code_root_cl,
100
                                   uint worker_i);
101

102 103 104 105 106
  // Prepare for and cleanup after an oops_into_collection_set_do
  // call.  Must call each of these once before and after (in sequential
  // code) any threads call oops_into_collection_set_do.  (This offers an
  // opportunity to sequential setup and teardown of structures needed by a
  // parallel iteration over the CS's RS.)
107 108
  void prepare_for_oops_into_collection_set_do();
  void cleanup_after_oops_into_collection_set_do();
109

110
  void scanRS(G1ParPushHeapRSClosure* oc,
111
              CodeBlobClosure* code_root_cl,
112
              uint worker_i);
J
johnc 已提交
113

114
  void updateRS(DirtyCardQueue* into_cset_dcq, uint worker_i);
115 116 117 118 119 120

  CardTableModRefBS* ct_bs() { return _ct_bs; }
  size_t cardsScanned() { return _total_cards_scanned; }

  // Record, if necessary, the fact that *p (where "p" is in region "from",
  // which is required to be non-NULL) has changed to a new non-NULL value.
121 122
  template <class T> void write_ref(HeapRegion* from, T* p);
  template <class T> void par_write_ref(HeapRegion* from, T* p, int tid);
123

124 125 126 127
  // Requires "region_bm" and "card_bm" to be bitmaps with 1 bit per region
  // or card, respectively, such that a region or card with a corresponding
  // 0 bit contains no part of any live object.  Eliminates any remembered
  // set entries that correspond to dead heap ranges.
128
  void scrub(BitMap* region_bm, BitMap* card_bm);
129 130 131 132

  // Like the above, but assumes is called in parallel: "worker_num" is the
  // parallel thread id of the current thread, and "claim_val" is the
  // value that should be used to claim heap regions.
133
  void scrub_par(BitMap* region_bm, BitMap* card_bm,
134
                 uint worker_num, int claim_val);
135

136
  // Refine the card corresponding to "card_ptr".
137 138 139
  // If check_for_refs_into_cset is true, a true result is returned
  // if the given card contains oops that have references into the
  // current collection set.
140
  virtual bool refine_card(jbyte* card_ptr,
141
                           uint worker_i,
142
                           bool check_for_refs_into_cset);
143

144
  // Print accumulated summary info from the start of the VM.
145
  virtual void print_summary_info();
146

147
  // Print accumulated summary info from the last time called.
148
  virtual void print_periodic_summary_info(const char* header);
149

150
  // Prepare remembered set for verification.
151
  virtual void prepare_for_verify();
152 153 154 155

  size_t conc_refine_cards() const {
    return _conc_refine_cards;
  }
156 157 158 159 160 161 162 163 164 165 166 167 168 169
};

class CountNonCleanMemRegionClosure: public MemRegionClosure {
  G1CollectedHeap* _g1;
  int _n;
  HeapWord* _start_first;
public:
  CountNonCleanMemRegionClosure(G1CollectedHeap* g1) :
    _g1(g1), _n(0), _start_first(NULL)
  {}
  void do_MemRegion(MemRegion mr);
  int n() { return _n; };
  HeapWord* start_first() { return _start_first; }
};
170

171
class UpdateRSOopClosure: public ExtendedOopClosure {
172
  HeapRegion* _from;
173
  G1RemSet* _rs;
174
  uint _worker_i;
175 176 177

  template <class T> void do_oop_work(T* p);

178
public:
179
  UpdateRSOopClosure(G1RemSet* rs, uint worker_i = 0) :
180 181
    _from(NULL), _rs(rs), _worker_i(worker_i)
  {}
182 183 184 185 186 187

  void set_from(HeapRegion* from) {
    assert(from != NULL, "from region must be non-NULL");
    _from = from;
  }

188 189
  virtual void do_oop(narrowOop* p) { do_oop_work(p); }
  virtual void do_oop(oop* p)       { do_oop_work(p); }
190 191 192 193 194

  // Override: this closure is idempotent.
  //  bool idempotent() { return true; }
  bool apply_to_weak_ref_discovered_field() { return true; }
};
J
johnc 已提交
195

196
#endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1REMSET_HPP