< prev index next >

src/share/vm/gc/g1/heapRegionSet.inline.hpp

Print this page

        

*** 31,41 **** check_mt_safety(); assert_heap_region_set(hr->containing_set() == NULL, "should not already have a containing set"); assert_heap_region_set(hr->next() == NULL, "should not already be linked"); assert_heap_region_set(hr->prev() == NULL, "should not already be linked"); ! _count.increment(1u, hr->capacity()); hr->set_containing_set(this); verify_region(hr); } inline void HeapRegionSetBase::remove(HeapRegion* hr) { --- 31,41 ---- check_mt_safety(); assert_heap_region_set(hr->containing_set() == NULL, "should not already have a containing set"); assert_heap_region_set(hr->next() == NULL, "should not already be linked"); assert_heap_region_set(hr->prev() == NULL, "should not already be linked"); ! _length++; hr->set_containing_set(this); verify_region(hr); } inline void HeapRegionSetBase::remove(HeapRegion* hr) {
*** 43,54 **** verify_region(hr); assert_heap_region_set(hr->next() == NULL, "should already be unlinked"); assert_heap_region_set(hr->prev() == NULL, "should already be unlinked"); hr->set_containing_set(NULL); ! assert_heap_region_set(_count.length() > 0, "pre-condition"); ! _count.decrement(1u, hr->capacity()); } inline void FreeRegionList::add_ordered(HeapRegion* hr) { assert_free_region_list((length() == 0 && _head == NULL && _tail == NULL && _last == NULL) || (length() > 0 && _head != NULL && _tail != NULL), --- 43,54 ---- verify_region(hr); assert_heap_region_set(hr->next() == NULL, "should already be unlinked"); assert_heap_region_set(hr->prev() == NULL, "should already be unlinked"); hr->set_containing_set(NULL); ! assert_heap_region_set(_length > 0, "pre-condition"); ! _length--; } inline void FreeRegionList::add_ordered(HeapRegion* hr) { assert_free_region_list((length() == 0 && _head == NULL && _tail == NULL && _last == NULL) || (length() > 0 && _head != NULL && _tail != NULL),
< prev index next >