heapRegionSet.hpp 9.6 KB
Newer Older
1
/*
2
 * Copyright (c) 2011, 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 19 20 21 22 23 24 25 26 27 28 29 30
 * 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.
 *
 * 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.
 *
 */

#ifndef SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONSET_HPP
#define SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONSET_HPP

#include "gc_implementation/g1/heapRegion.hpp"

// Large buffer for some cases where the output might be larger than normal.
T
tonyp 已提交
31 32
#define HRS_ERR_MSG_BUFSZ 512
typedef FormatBuffer<HRS_ERR_MSG_BUFSZ> hrs_err_msg;
33 34 35 36 37 38 39 40

// Set verification will be forced either if someone defines
// HEAP_REGION_SET_FORCE_VERIFY to be 1, or in builds in which
// asserts are compiled in.
#ifndef HEAP_REGION_SET_FORCE_VERIFY
#define HEAP_REGION_SET_FORCE_VERIFY defined(ASSERT)
#endif // HEAP_REGION_SET_FORCE_VERIFY

41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73
class hrs_ext_msg;

class HRSMtSafeChecker : public CHeapObj<mtGC> {
public:
  virtual void check() = 0;
};

class MasterFreeRegionListMtSafeChecker    : public HRSMtSafeChecker { public: void check(); };
class SecondaryFreeRegionListMtSafeChecker : public HRSMtSafeChecker { public: void check(); };
class HumongousRegionSetMtSafeChecker      : public HRSMtSafeChecker { public: void check(); };
class OldRegionSetMtSafeChecker            : public HRSMtSafeChecker { public: void check(); };

class HeapRegionSetCount VALUE_OBJ_CLASS_SPEC {
  friend class VMStructs;
  uint   _length;
  size_t _capacity;

public:
  HeapRegionSetCount() : _length(0), _capacity(0) { }

  const uint   length()   const { return _length;   }
  const size_t capacity() const { return _capacity; }

  void increment(uint length_to_add, size_t capacity_to_add) {
    _length += length_to_add;
    _capacity += capacity_to_add;
  }

  void decrement(const uint length_to_remove, const size_t capacity_to_remove) {
    _length -= length_to_remove;
    _capacity -= capacity_to_remove;
  }
};
74 75 76 77 78 79 80

// Base class for all the classes that represent heap region sets. It
// contains the basic attributes that each set needs to maintain
// (e.g., length, region num, used bytes sum) plus any shared
// functionality (e.g., verification).

class HeapRegionSetBase VALUE_OBJ_CLASS_SPEC {
81
  friend class VMStructs;
82 83 84 85
private:
  bool _is_humongous;
  bool _is_empty;
  HRSMtSafeChecker* _mt_safety_checker;
86 87 88 89 90

protected:
  // The number of regions added to the set. If the set contains
  // only humongous regions, this reflects only 'starts humongous'
  // regions and does not include 'continues humongous' ones.
91
  HeapRegionSetCount _count;
92 93 94

  const char* _name;

95
  bool _verify_in_progress;
T
tonyp 已提交
96

97
  // verify_region() is used to ensure that the contents of a region
98 99
  // added to / removed from a set are consistent.
  void verify_region(HeapRegion* hr) PRODUCT_RETURN;
100 101 102

  // Indicates whether all regions in the set should be humongous or
  // not. Only used during verification.
103
  bool regions_humongous() { return _is_humongous; }
104 105 106

  // Indicates whether all regions in the set should be empty or
  // not. Only used during verification.
107
  bool regions_empty() { return _is_empty; }
108

109 110 111 112 113
  void check_mt_safety() {
    if (_mt_safety_checker != NULL) {
      _mt_safety_checker->check();
    }
  }
114

T
tonyp 已提交
115
  virtual void fill_in_ext_msg_extra(hrs_ext_msg* msg) { }
116

117
  HeapRegionSetBase(const char* name, bool humongous, bool empty, HRSMtSafeChecker* mt_safety_checker);
118 119 120 121

public:
  const char* name() { return _name; }

122
  uint length() const { return _count.length(); }
123

124
  bool is_empty() { return _count.length() == 0; }
125 126

  size_t total_capacity_bytes() {
127
    return _count.capacity();
128 129
  }

130 131 132 133 134 135 136 137 138 139 140 141
  // It updates the fields of the set to reflect hr being added to
  // the set and tags the region appropriately.
  inline void add(HeapRegion* hr);

  // It updates the fields of the set to reflect hr being removed
  // from the set and tags the region appropriately.
  inline void remove(HeapRegion* hr);

  // fill_in_ext_msg() writes the the values of the set's attributes
  // in the custom err_msg (hrs_ext_msg). fill_in_ext_msg_extra()
  // allows subclasses to append further information.
  void fill_in_ext_msg(hrs_ext_msg* msg, const char* message);
142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162

  virtual void verify();
  void verify_start();
  void verify_next_region(HeapRegion* hr);
  void verify_end();

#if HEAP_REGION_SET_FORCE_VERIFY
  void verify_optional() {
    verify();
  }
#else // HEAP_REGION_SET_FORCE_VERIFY
  void verify_optional() { }
#endif // HEAP_REGION_SET_FORCE_VERIFY

  virtual void print_on(outputStream* out, bool print_contents = false);
};

// Customized err_msg for heap region sets. Apart from a
// assert/guarantee-specific message it also prints out the values of
// the fields of the associated set. This can be very helpful in
// diagnosing failures.
T
tonyp 已提交
163
class hrs_ext_msg : public hrs_err_msg {
164
public:
165
  hrs_ext_msg(HeapRegionSetBase* set, const char* message) : hrs_err_msg("%s", "") {
166 167 168 169
    set->fill_in_ext_msg(this, message);
  }
};

T
tonyp 已提交
170
#define hrs_assert_sets_match(_set1_, _set2_)                                 \
171 172 173 174
  do {                                                                        \
    assert(((_set1_)->regions_humongous() ==                                  \
                                            (_set2_)->regions_humongous()) && \
           ((_set1_)->regions_empty() == (_set2_)->regions_empty()),          \
T
tonyp 已提交
175
           hrs_err_msg("the contents of set %s and set %s should match",      \
176 177 178 179 180 181 182 183 184 185
                       (_set1_)->name(), (_set2_)->name()));                  \
  } while (0)

// This class represents heap region sets whose members are not
// explicitly tracked. It's helpful to group regions using such sets
// so that we can reason about all the region groups in the heap using
// the same interface (namely, the HeapRegionSetBase API).

class HeapRegionSet : public HeapRegionSetBase {
public:
186 187
  HeapRegionSet(const char* name, bool humongous, HRSMtSafeChecker* mt_safety_checker):
    HeapRegionSetBase(name, humongous, false /* empty */, mt_safety_checker) { }
188

189 190 191
  void bulk_remove(const HeapRegionSetCount& removed) {
    _count.decrement(removed.length(), removed.capacity());
  }
192 193
};

194
// A set that links all the regions added to it in a doubly-linked
195
// sorted list. We should try to avoid doing operations that iterate over
196
// such lists in performance critical paths. Typically we should
197
// add / remove one region at a time or concatenate two lists.
198

199
class FreeRegionListIterator;
200

201 202
class FreeRegionList : public HeapRegionSetBase {
  friend class FreeRegionListIterator;
203 204 205 206 207

private:
  HeapRegion* _head;
  HeapRegion* _tail;

208
  // _last is used to keep track of where we added an element the last
209
  // time. It helps to improve performance when adding several ordered items in a row.
210 211
  HeapRegion* _last;

212 213
  static uint _unrealistically_long_length;

214 215
  inline HeapRegion* remove_from_head_impl();
  inline HeapRegion* remove_from_tail_impl();
216 217

protected:
T
tonyp 已提交
218
  virtual void fill_in_ext_msg_extra(hrs_ext_msg* msg);
219 220 221 222

  // See the comment for HeapRegionSetBase::clear()
  virtual void clear();

223 224 225
public:
  FreeRegionList(const char* name, HRSMtSafeChecker* mt_safety_checker = NULL):
    HeapRegionSetBase(name, false /* humongous */, true /* empty */, mt_safety_checker) {
226 227 228
    clear();
  }

229 230
  void verify_list();

231 232 233 234 235
#ifdef ASSERT
  bool contains(HeapRegion* hr) const {
    return hr->containing_set() == this;
  }
#endif
236 237 238

  static void set_unrealistically_long_length(uint len);

239 240 241 242 243 244
  // Add hr to the list. The region should not be a member of another set.
  // Assumes that the list is ordered and will preserve that order. The order
  // is determined by hrs_index.
  inline void add_ordered(HeapRegion* hr);

  // Removes from head or tail based on the given argument.
245
  HeapRegion* remove_region(bool from_head);
246 247 248 249 250

  // Merge two ordered lists. The result is also ordered. The order is
  // determined by hrs_index.
  void add_ordered(FreeRegionList* from_list);

251 252 253
  // It empties the list by removing all regions from it.
  void remove_all();

254 255 256 257
  // Remove all (contiguous) regions from first to first + num_regions -1 from
  // this list.
  // Num_regions must be > 1.
  void remove_starting_at(HeapRegion* first, uint num_regions);
258 259 260 261 262 263

  virtual void verify();

  virtual void print_on(outputStream* out, bool print_contents = false);
};

T
tonyp 已提交
264
// Iterator class that provides a convenient way to iterate over the
265
// regions of a FreeRegionList.
266

267
class FreeRegionListIterator : public StackObj {
268
private:
269
  FreeRegionList* _list;
270
  HeapRegion*     _curr;
271 272 273 274 275 276 277 278 279 280 281 282 283 284

public:
  bool more_available() {
    return _curr != NULL;
  }

  HeapRegion* get_next() {
    assert(more_available(),
           "get_next() should be called when more regions are available");

    // If we are going to introduce a count in the iterator we should
    // do the "cycle" check.

    HeapRegion* hr = _curr;
285
    _list->verify_region(hr);
286 287 288 289
    _curr = hr->next();
    return hr;
  }

290
  FreeRegionListIterator(FreeRegionList* list) : _curr(NULL), _list(list) {
291
    _curr = list->_head;
292 293 294 295
  }
};

#endif // SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONSET_HPP