< prev index next >

src/share/vm/gc/cms/concurrentMarkSweepGeneration.hpp

Print this page

        

*** 294,305 **** size_t capacity() { return _capacity; } void set_capacity(size_t c) { _capacity = c; } size_t end() { assert(_index <= capacity(), ! err_msg("_index (" SIZE_FORMAT ") > _capacity (" SIZE_FORMAT "): out of bounds", ! _index, _capacity)); return _index; } // exclusive HeapWord* nth(size_t n) { assert(n < end(), "Out of bounds access"); --- 294,305 ---- size_t capacity() { return _capacity; } void set_capacity(size_t c) { _capacity = c; } size_t end() { assert(_index <= capacity(), ! "_index (" SIZE_FORMAT ") > _capacity (" SIZE_FORMAT "): out of bounds", ! _index, _capacity); return _index; } // exclusive HeapWord* nth(size_t n) { assert(n < end(), "Out of bounds access");
*** 320,332 **** if (_index < _capacity) { _array[_index++] = p; } else { ++_overflows; assert(_index == _capacity, ! err_msg("_index (" SIZE_FORMAT ") > _capacity (" SIZE_FORMAT "): out of bounds at overflow#" SIZE_FORMAT, ! _index, _capacity, _overflows)); } } }; // --- 320,332 ---- if (_index < _capacity) { _array[_index++] = p; } else { ++_overflows; assert(_index == _capacity, ! "_index (" SIZE_FORMAT ") > _capacity (" SIZE_FORMAT "): out of bounds at overflow#" SIZE_FORMAT, ! _index, _capacity, _overflows); } } }; //
< prev index next >