Lines Matching refs:end_index
106 size_t end_index = index_for(end-1)+1;
108 (end_index - start_index) * sizeof(_offset_array[0]));
280 size_t end_index = _array->index_for(blk_end - 1);
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;
445 size_t num_suff_cards = end_index - suff_index;
456 set_remainder_to_point_to_start_incl(suff_index + 1, end_index - 1, true /* reducing */);
472 if (right_index >= end_index - 1) { // last iteration
473 right_index = end_index - 1;
494 if (right_index >= end_index - 1) { // last iteration
495 right_index = end_index - 1;
751 size_t end_index = _array->index_for(blk_end - 1);
754 if (_next_offset_index + 1 <= end_index) {
756 // Calculate rem_end this way because end_index
758 HeapWord* rem_end = _array->address_for_index(end_index) + N_words;
763 _next_offset_index = end_index + 1;
764 // Calculate _next_offset_threshold this way because end_index
766 _next_offset_threshold = _array->address_for_index(end_index) + N_words;
779 for (size_t j = orig_next_offset_index + 1; j <= end_index; j++) {