2011-01-19 19:30:42 -05:00
|
|
|
/*
|
2014-02-28 15:27:09 +01:00
|
|
|
* Copyright (c) 2011, 2014, Oracle and/or its affiliates. All rights reserved.
|
2011-01-19 19:30:42 -05:00
|
|
|
* 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.
|
2011-03-04 17:13:19 -05:00
|
|
|
#define HRS_ERR_MSG_BUFSZ 512
|
|
|
|
typedef FormatBuffer<HRS_ERR_MSG_BUFSZ> hrs_err_msg;
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
// 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
|
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
};
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
// 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 {
|
2012-01-18 10:30:12 -05:00
|
|
|
friend class VMStructs;
|
2014-03-14 10:15:46 +01:00
|
|
|
private:
|
|
|
|
bool _is_humongous;
|
|
|
|
bool _is_empty;
|
|
|
|
HRSMtSafeChecker* _mt_safety_checker;
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
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.
|
2014-03-14 10:15:46 +01:00
|
|
|
HeapRegionSetCount _count;
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
const char* _name;
|
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
bool _verify_in_progress;
|
2011-11-07 22:11:12 -05:00
|
|
|
|
2011-01-19 19:30:42 -05:00
|
|
|
// verify_region() is used to ensure that the contents of a region
|
2014-03-14 10:15:46 +01:00
|
|
|
// added to / removed from a set are consistent.
|
|
|
|
void verify_region(HeapRegion* hr) PRODUCT_RETURN;
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
// Indicates whether all regions in the set should be humongous or
|
|
|
|
// not. Only used during verification.
|
2014-03-14 10:15:46 +01:00
|
|
|
bool regions_humongous() { return _is_humongous; }
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
// Indicates whether all regions in the set should be empty or
|
|
|
|
// not. Only used during verification.
|
2014-03-14 10:15:46 +01:00
|
|
|
bool regions_empty() { return _is_empty; }
|
2011-01-19 19:30:42 -05:00
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
void check_mt_safety() {
|
|
|
|
if (_mt_safety_checker != NULL) {
|
|
|
|
_mt_safety_checker->check();
|
|
|
|
}
|
|
|
|
}
|
2011-01-19 19:30:42 -05:00
|
|
|
|
2011-03-04 17:13:19 -05:00
|
|
|
virtual void fill_in_ext_msg_extra(hrs_ext_msg* msg) { }
|
2011-01-19 19:30:42 -05:00
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
HeapRegionSetBase(const char* name, bool humongous, bool empty, HRSMtSafeChecker* mt_safety_checker);
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
public:
|
|
|
|
const char* name() { return _name; }
|
|
|
|
|
2014-07-21 10:00:31 +02:00
|
|
|
uint length() const { return _count.length(); }
|
2011-01-19 19:30:42 -05:00
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
bool is_empty() { return _count.length() == 0; }
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
size_t total_capacity_bytes() {
|
2014-03-14 10:15:46 +01:00
|
|
|
return _count.capacity();
|
2011-01-19 19:30:42 -05:00
|
|
|
}
|
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
// 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);
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
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.
|
2011-03-04 17:13:19 -05:00
|
|
|
class hrs_ext_msg : public hrs_err_msg {
|
2011-01-19 19:30:42 -05:00
|
|
|
public:
|
2014-08-18 16:10:44 +02:00
|
|
|
hrs_ext_msg(HeapRegionSetBase* set, const char* message) : hrs_err_msg("%s", "") {
|
2011-01-19 19:30:42 -05:00
|
|
|
set->fill_in_ext_msg(this, message);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2011-03-04 17:13:19 -05:00
|
|
|
#define hrs_assert_sets_match(_set1_, _set2_) \
|
2011-01-19 19:30:42 -05:00
|
|
|
do { \
|
|
|
|
assert(((_set1_)->regions_humongous() == \
|
|
|
|
(_set2_)->regions_humongous()) && \
|
|
|
|
((_set1_)->regions_empty() == (_set2_)->regions_empty()), \
|
2011-03-04 17:13:19 -05:00
|
|
|
hrs_err_msg("the contents of set %s and set %s should match", \
|
2011-01-19 19:30:42 -05:00
|
|
|
(_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:
|
2014-03-14 10:15:46 +01:00
|
|
|
HeapRegionSet(const char* name, bool humongous, HRSMtSafeChecker* mt_safety_checker):
|
|
|
|
HeapRegionSetBase(name, humongous, false /* empty */, mt_safety_checker) { }
|
2011-01-19 19:30:42 -05:00
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
void bulk_remove(const HeapRegionSetCount& removed) {
|
|
|
|
_count.decrement(removed.length(), removed.capacity());
|
|
|
|
}
|
2011-01-19 19:30:42 -05:00
|
|
|
};
|
|
|
|
|
2014-02-28 15:27:09 +01:00
|
|
|
// A set that links all the regions added to it in a doubly-linked
|
2014-08-18 16:10:44 +02:00
|
|
|
// sorted list. We should try to avoid doing operations that iterate over
|
2011-01-19 19:30:42 -05:00
|
|
|
// such lists in performance critical paths. Typically we should
|
2014-08-18 16:10:44 +02:00
|
|
|
// add / remove one region at a time or concatenate two lists.
|
2011-01-19 19:30:42 -05:00
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
class FreeRegionListIterator;
|
2011-01-19 19:30:42 -05:00
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
class FreeRegionList : public HeapRegionSetBase {
|
|
|
|
friend class FreeRegionListIterator;
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
private:
|
|
|
|
HeapRegion* _head;
|
|
|
|
HeapRegion* _tail;
|
|
|
|
|
2014-02-28 15:27:09 +01:00
|
|
|
// _last is used to keep track of where we added an element the last
|
2014-08-18 16:10:44 +02:00
|
|
|
// time. It helps to improve performance when adding several ordered items in a row.
|
2014-02-28 15:27:09 +01:00
|
|
|
HeapRegion* _last;
|
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
static uint _unrealistically_long_length;
|
|
|
|
|
2014-08-18 16:10:44 +02:00
|
|
|
inline HeapRegion* remove_from_head_impl();
|
|
|
|
inline HeapRegion* remove_from_tail_impl();
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
protected:
|
2011-03-04 17:13:19 -05:00
|
|
|
virtual void fill_in_ext_msg_extra(hrs_ext_msg* msg);
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
// See the comment for HeapRegionSetBase::clear()
|
|
|
|
virtual void clear();
|
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
public:
|
|
|
|
FreeRegionList(const char* name, HRSMtSafeChecker* mt_safety_checker = NULL):
|
|
|
|
HeapRegionSetBase(name, false /* humongous */, true /* empty */, mt_safety_checker) {
|
2011-01-19 19:30:42 -05:00
|
|
|
clear();
|
|
|
|
}
|
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
void verify_list();
|
|
|
|
|
2014-08-18 16:10:44 +02:00
|
|
|
#ifdef ASSERT
|
|
|
|
bool contains(HeapRegion* hr) const {
|
|
|
|
return hr->containing_set() == this;
|
|
|
|
}
|
|
|
|
#endif
|
2014-03-14 10:15:46 +01:00
|
|
|
|
|
|
|
static void set_unrealistically_long_length(uint len);
|
|
|
|
|
2014-02-28 15:27:09 +01:00
|
|
|
// 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.
|
2014-08-18 16:10:44 +02:00
|
|
|
HeapRegion* remove_region(bool from_head);
|
2014-02-28 15:27:09 +01:00
|
|
|
|
|
|
|
// Merge two ordered lists. The result is also ordered. The order is
|
|
|
|
// determined by hrs_index.
|
|
|
|
void add_ordered(FreeRegionList* from_list);
|
|
|
|
|
2011-01-19 19:30:42 -05:00
|
|
|
// It empties the list by removing all regions from it.
|
|
|
|
void remove_all();
|
|
|
|
|
2014-08-18 16:10:44 +02:00
|
|
|
// 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);
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
virtual void verify();
|
|
|
|
|
|
|
|
virtual void print_on(outputStream* out, bool print_contents = false);
|
|
|
|
};
|
|
|
|
|
2011-03-04 17:13:19 -05:00
|
|
|
// Iterator class that provides a convenient way to iterate over the
|
2014-08-18 16:10:44 +02:00
|
|
|
// regions of a FreeRegionList.
|
2011-01-19 19:30:42 -05:00
|
|
|
|
2014-03-14 10:15:46 +01:00
|
|
|
class FreeRegionListIterator : public StackObj {
|
2011-01-19 19:30:42 -05:00
|
|
|
private:
|
2014-03-14 10:15:46 +01:00
|
|
|
FreeRegionList* _list;
|
2014-02-28 15:27:09 +01:00
|
|
|
HeapRegion* _curr;
|
2011-01-19 19:30:42 -05:00
|
|
|
|
|
|
|
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;
|
2014-03-14 10:15:46 +01:00
|
|
|
_list->verify_region(hr);
|
2011-01-19 19:30:42 -05:00
|
|
|
_curr = hr->next();
|
|
|
|
return hr;
|
|
|
|
}
|
|
|
|
|
2014-02-28 15:27:09 +01:00
|
|
|
FreeRegionListIterator(FreeRegionList* list) : _curr(NULL), _list(list) {
|
2014-08-18 16:10:44 +02:00
|
|
|
_curr = list->_head;
|
2011-01-19 19:30:42 -05:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif // SHARE_VM_GC_IMPLEMENTATION_G1_HEAPREGIONSET_HPP
|