Searched defs:end_bit (Results 1 - 3 of 3) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DparMarkBitMap.cpp101 const idx_t end_bit = addr_to_bit(addr + size - 1); local
102 bool end_bit_ok = _end_bits.par_set_bit(end_bit);
119 const idx_t end_bit = addr_to_bit(end_addr); local
120 const idx_t range_end = BitMap::word_align_up(end_bit);
123 while (beg_bit < end_bit) {
125 if (tmp_end < end_bit) {
129 live_bits += end_bit - beg_bit; // No + 1 here; end_bit is not counted.
144 const idx_t end_bit = addr_to_bit((HeapWord*)end_obj); local
145 const idx_t range_end = BitMap::word_align_up(end_bit);
[all...]
H A DparMarkBitMap.hpp74 inline size_t obj_size(idx_t beg_bit, idx_t end_bit) const;
323 inline size_t ParMarkBitMap::obj_size(idx_t beg_bit, idx_t end_bit) const
326 DEBUG_ONLY(verify_bit(end_bit);)
327 return bits_to_words(end_bit - beg_bit + 1);
340 const idx_t end_bit = _end_bits.get_next_one_offset_inline(beg_bit, size()); local
342 assert(end_bit < size(), "end bit missing");
343 return obj_size(beg_bit, end_bit);
412 const idx_t end_bit = addr_to_bit(end);
413 const idx_t search_end = BitMap::word_align_up(end_bit);
414 const idx_t res_bit = MIN2(find_obj_beg(beg_bit, search_end), end_bit);
[all...]
H A DpsParallelCompact.cpp988 const idx_t end_bit = BitMap::word_align_up(_mark_bitmap.addr_to_bit(top)); local
989 _mark_bitmap.clear_range(beg_bit, end_bit);
3479 const size_t end_bit = bitmap->find_obj_end(beg_bit, range_end); local
3480 if (end_bit < range_end - 1) {
3481 live_bits += end_bit - beg_bit + 1;
3482 beg_bit = bitmap->find_obj_beg(end_bit + 1, range_end);

Completed in 45 milliseconds