Searched refs:end_index (Results 1 - 8 of 8) sorted by relevance
/openjdk7/hotspot/src/share/vm/oops/ |
H A D | objArrayKlass.inline.hpp | 50 const size_t end_index = beg_index + stride; 53 T* const end = base + end_index; 60 if (end_index < len) { 61 MarkSweep::push_objarray(a, end_index); // Push the continuation. 84 const size_t end_index = beg_index + stride; 87 T* const end = base + end_index; 94 if (end_index < len) { 95 cm->push_objarray(a, end_index); // Push the continuation.
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | blockOffsetTable.cpp | 106 size_t end_index = index_for(end-1)+1; local 108 (end_index - start_index) * sizeof(_offset_array[0])); 280 size_t end_index = _array->index_for(blk_end - 1); local 290 assert(start_index <= end_index, "monotonicity of index_for()"); 303 if (start_index < end_index) { 305 HeapWord* rem_end = _array->address_for_index(end_index) + N_words; 314 check_all_cards(start_index + 1, end_index); 438 // the split start; end_index is one more than the index of 440 size_t end_index = _array->index_for(end_addr - 1) + 1; local 445 size_t num_suff_cards = end_index 751 size_t end_index = _array->index_for(blk_end - 1); local [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | g1BlockOffsetTable.cpp | 250 size_t end_index = _array->index_for(blk_end - 1); local 260 assert(start_index <= end_index, "monotonicity of index_for()"); 273 if (start_index < end_index) { 275 HeapWord* rem_end = _array->address_for_index(end_index) + N_words; 284 check_all_cards(start_index + 1, end_index); 518 size_t end_index = _array->index_for(blk_end - 1); local 521 if (index + 1 <= end_index) { 523 // Calculate rem_end this way because end_index 525 HeapWord* rem_end = _array->address_for_index(end_index) + N_words; 529 index = end_index [all...] |
H A D | concurrentMark.cpp | 1260 BitMap::idx_t end_index = (BitMap::idx_t) hr->last_hc_index(); local 1261 _region_bm->par_at_put_range(index, end_index, true);
|
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | bitMap.inline.hpp | 36 inline void BitMap::verify_range(idx_t beg_index, idx_t end_index) const { 37 assert(beg_index <= end_index, "BitMap range error"); 39 if (end_index != _size) verify_index(end_index);
|
H A D | bitMap.hpp | 105 inline void verify_range(idx_t beg_index, idx_t end_index) const
|
/openjdk7/hotspot/src/share/vm/code/ |
H A D | debugInfoRec.cpp | 67 int end_index = arr->length(); local 70 for (int i = end_index; --i >= start_index; ) {
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | phaseX.cpp | 1651 uint end_index = block->_nodes.size(); local 1653 for( uint instruction_index = 1; instruction_index < end_index; ++instruction_index ) { 1694 end_index = block->_nodes.size() - 1; // Recompute new block size
|
Completed in 90 milliseconds