72 // by the card shift -- address 0 corresponds to card number 0. One 73 // must subtract the card num of the bottom of the heap to obtain a 74 // card table index. 75 intptr_t card_num = intptr_t(uintptr_t(addr) >> CardTableModRefBS::card_shift); 76 return card_num - heap_bottom_card_num(); 77 } 78 79 // Counts the given memory region in the given task/worker 80 // counting data structures. 81 inline void ConcurrentMark::count_region(MemRegion mr, HeapRegion* hr, 82 size_t* marked_bytes_array, 83 BitMap* task_card_bm) { 84 G1CollectedHeap* g1h = _g1h; 85 CardTableModRefBS* ct_bs = g1h->g1_barrier_set(); 86 87 HeapWord* start = mr.start(); 88 HeapWord* end = mr.end(); 89 size_t region_size_bytes = mr.byte_size(); 90 uint index = hr->hrm_index(); 91 92 assert(!hr->is_continues_humongous(), "should not be HC region"); 93 assert(hr == g1h->heap_region_containing(start), "sanity"); 94 assert(hr == g1h->heap_region_containing(mr.last()), "sanity"); 95 assert(marked_bytes_array != NULL, "pre-condition"); 96 assert(task_card_bm != NULL, "pre-condition"); 97 98 // Add to the task local marked bytes for this region. 99 marked_bytes_array[index] += region_size_bytes; 100 101 BitMap::idx_t start_idx = card_bitmap_index_for(start); 102 BitMap::idx_t end_idx = card_bitmap_index_for(end); 103 104 // Note: if we're looking at the last region in heap - end 105 // could be actually just beyond the end of the heap; end_idx 106 // will then correspond to a (non-existent) card that is also 107 // just beyond the heap. 108 if (g1h->is_in_g1_reserved(end) && !ct_bs->is_card_aligned(end)) { 109 // end of region is not card aligned - increment to cover 110 // all the cards spanned by the region. 111 end_idx += 1; 112 } 113 // The card bitmap is task/worker specific => no need to use 114 // the 'par' BitMap routines. 115 // Set bits in the exclusive bit range [start_idx, end_idx). 116 set_card_bitmap_range(task_card_bm, start_idx, end_idx, false /* is_par */); 117 } 118 119 // Counts the given memory region in the task/worker counting 120 // data structures for the given worker id. 121 inline void ConcurrentMark::count_region(MemRegion mr, 122 HeapRegion* hr, 123 uint worker_id) { 124 size_t* marked_bytes_array = count_marked_bytes_array_for(worker_id); 125 BitMap* task_card_bm = count_card_bitmap_for(worker_id); 126 count_region(mr, hr, marked_bytes_array, task_card_bm); 127 } 128 129 // Counts the given object in the given task/worker counting data structures. 130 inline void ConcurrentMark::count_object(oop obj, 131 HeapRegion* hr, 132 size_t* marked_bytes_array, 133 BitMap* task_card_bm) { 134 MemRegion mr((HeapWord*)obj, obj->size()); 135 count_region(mr, hr, marked_bytes_array, task_card_bm); 136 } 137 138 // Attempts to mark the given object and, if successful, counts 139 // the object in the given task/worker counting structures. 140 inline bool ConcurrentMark::par_mark_and_count(oop obj, 141 HeapRegion* hr, 142 size_t* marked_bytes_array, 143 BitMap* task_card_bm) { 144 HeapWord* addr = (HeapWord*)obj; 145 if (_nextMarkBitMap->parMark(addr)) { 146 // Update the task specific count data for the object. 147 count_object(obj, hr, marked_bytes_array, task_card_bm); 148 return true; 149 } 150 return false; 151 } 152 153 // Attempts to mark the given object and, if successful, counts 154 // the object in the task/worker counting structures for the 155 // given worker id. 156 inline bool ConcurrentMark::par_mark_and_count(oop obj, 157 size_t word_size, 158 HeapRegion* hr, 159 uint worker_id) { 160 HeapWord* addr = (HeapWord*)obj; 161 if (_nextMarkBitMap->parMark(addr)) { 162 MemRegion mr(addr, word_size); 163 count_region(mr, hr, worker_id); 164 return true; 165 } 166 return false; 167 } 168 169 inline bool CMBitMapRO::iterate(BitMapClosure* cl, MemRegion mr) { 170 HeapWord* start_addr = MAX2(startWord(), mr.start()); 171 HeapWord* end_addr = MIN2(endWord(), mr.end()); 172 173 if (end_addr > start_addr) { 174 // Right-open interval [start-offset, end-offset). 175 BitMap::idx_t start_offset = heapWordToOffset(start_addr); 176 BitMap::idx_t end_offset = heapWordToOffset(end_addr); 177 178 start_offset = _bm.get_next_one_offset(start_offset, end_offset); 179 while (start_offset < end_offset) { 180 if (!cl->do_bit(start_offset)) { 181 return false; 182 } 183 HeapWord* next_addr = MIN2(nextObject(offsetToHeapWord(start_offset)), end_addr); 334 // references, and the metadata is built-in. 335 process_grey_object<false>(obj); 336 } else { 337 push(obj); 338 } 339 } 340 } 341 } 342 343 inline void CMTask::deal_with_reference(oop obj) { 344 increment_refs_reached(); 345 346 HeapWord* objAddr = (HeapWord*) obj; 347 assert(obj->is_oop_or_null(true /* ignore mark word */), "Expected an oop or NULL at " PTR_FORMAT, p2i(obj)); 348 if (_g1h->is_in_g1_reserved(objAddr)) { 349 assert(obj != NULL, "null check is implicit"); 350 if (!_nextMarkBitMap->isMarked(objAddr)) { 351 // Only get the containing region if the object is not marked on the 352 // bitmap (otherwise, it's a waste of time since we won't do 353 // anything with it). 354 HeapRegion* hr = _g1h->heap_region_containing_raw(obj); 355 if (!hr->obj_allocated_since_next_marking(obj)) { 356 make_reference_grey(obj, hr); 357 } 358 } 359 } 360 } 361 362 inline void ConcurrentMark::markPrev(oop p) { 363 assert(!_prevMarkBitMap->isMarked((HeapWord*) p), "sanity"); 364 // Note we are overriding the read-only view of the prev map here, via 365 // the cast. 366 ((CMBitMap*)_prevMarkBitMap)->mark((HeapWord*) p); 367 } 368 369 inline void ConcurrentMark::grayRoot(oop obj, size_t word_size, 370 uint worker_id, HeapRegion* hr) { 371 assert(obj != NULL, "pre-condition"); 372 HeapWord* addr = (HeapWord*) obj; 373 if (hr == NULL) { 374 hr = _g1h->heap_region_containing_raw(addr); 375 } else { 376 assert(hr->is_in(addr), "pre-condition"); 377 } 378 assert(hr != NULL, "sanity"); 379 // Given that we're looking for a region that contains an object 380 // header it's impossible to get back a HC region. 381 assert(!hr->is_continues_humongous(), "sanity"); 382 383 // We cannot assert that word_size == obj->size() given that obj 384 // might not be in a consistent state (another thread might be in 385 // the process of copying it). So the best thing we can do is to 386 // assert that word_size is under an upper bound which is its 387 // containing region's capacity. 388 assert(word_size * HeapWordSize <= hr->capacity(), 389 "size: " SIZE_FORMAT " capacity: " SIZE_FORMAT " " HR_FORMAT, 390 word_size * HeapWordSize, hr->capacity(), 391 HR_FORMAT_PARAMS(hr)); 392 393 if (addr < hr->next_top_at_mark_start()) { 394 if (!_nextMarkBitMap->isMarked(addr)) { 395 par_mark_and_count(obj, word_size, hr, worker_id); 396 } 397 } 398 } 399 400 #endif // SHARE_VM_GC_G1_CONCURRENTMARK_INLINE_HPP | 72 // by the card shift -- address 0 corresponds to card number 0. One 73 // must subtract the card num of the bottom of the heap to obtain a 74 // card table index. 75 intptr_t card_num = intptr_t(uintptr_t(addr) >> CardTableModRefBS::card_shift); 76 return card_num - heap_bottom_card_num(); 77 } 78 79 // Counts the given memory region in the given task/worker 80 // counting data structures. 81 inline void ConcurrentMark::count_region(MemRegion mr, HeapRegion* hr, 82 size_t* marked_bytes_array, 83 BitMap* task_card_bm) { 84 G1CollectedHeap* g1h = _g1h; 85 CardTableModRefBS* ct_bs = g1h->g1_barrier_set(); 86 87 HeapWord* start = mr.start(); 88 HeapWord* end = mr.end(); 89 size_t region_size_bytes = mr.byte_size(); 90 uint index = hr->hrm_index(); 91 92 assert(hr == g1h->heap_region_containing(start), "sanity"); 93 assert(marked_bytes_array != NULL, "pre-condition"); 94 assert(task_card_bm != NULL, "pre-condition"); 95 96 // Add to the task local marked bytes for this region. 97 marked_bytes_array[index] += region_size_bytes; 98 99 BitMap::idx_t start_idx = card_bitmap_index_for(start); 100 BitMap::idx_t end_idx = card_bitmap_index_for(end); 101 102 // Note: if we're looking at the last region in heap - end 103 // could be actually just beyond the end of the heap; end_idx 104 // will then correspond to a (non-existent) card that is also 105 // just beyond the heap. 106 if (g1h->is_in_g1_reserved(end) && !ct_bs->is_card_aligned(end)) { 107 // end of region is not card aligned - increment to cover 108 // all the cards spanned by the region. 109 end_idx += 1; 110 } 111 // The card bitmap is task/worker specific => no need to use 112 // the 'par' BitMap routines. 113 // Set bits in the exclusive bit range [start_idx, end_idx). 114 set_card_bitmap_range(task_card_bm, start_idx, end_idx, false /* is_par */); 115 } 116 117 // Counts the given object in the given task/worker counting data structures. 118 inline void ConcurrentMark::count_object(oop obj, 119 HeapRegion* hr, 120 size_t* marked_bytes_array, 121 BitMap* task_card_bm, 122 size_t word_size) { 123 assert(!hr->is_continues_humongous(), "Cannot enter count_object with continues humongous"); 124 if (!hr->is_starts_humongous()) { 125 MemRegion mr((HeapWord*)obj, word_size); 126 count_region(mr, hr, marked_bytes_array, task_card_bm); 127 } else { 128 do { 129 MemRegion mr(hr->bottom(), hr->top()); 130 count_region(mr, hr, marked_bytes_array, task_card_bm); 131 hr = _g1h->next_region_by_index(hr); 132 } while (hr != NULL && hr->is_continues_humongous()); 133 } 134 } 135 136 // Attempts to mark the given object and, if successful, counts 137 // the object in the given task/worker counting structures. 138 inline bool ConcurrentMark::par_mark_and_count(oop obj, 139 HeapRegion* hr, 140 size_t* marked_bytes_array, 141 BitMap* task_card_bm) { 142 if (_nextMarkBitMap->parMark((HeapWord*)obj)) { 143 // Update the task specific count data for the object. 144 count_object(obj, hr, marked_bytes_array, task_card_bm, obj->size()); 145 return true; 146 } 147 return false; 148 } 149 150 // Attempts to mark the given object and, if successful, counts 151 // the object in the task/worker counting structures for the 152 // given worker id. 153 inline bool ConcurrentMark::par_mark_and_count(oop obj, 154 size_t word_size, 155 HeapRegion* hr, 156 uint worker_id) { 157 if (_nextMarkBitMap->parMark((HeapWord*)obj)) { 158 size_t* marked_bytes_array = count_marked_bytes_array_for(worker_id); 159 BitMap* task_card_bm = count_card_bitmap_for(worker_id); 160 count_object(obj, hr, marked_bytes_array, task_card_bm, word_size); 161 return true; 162 } 163 return false; 164 } 165 166 inline bool CMBitMapRO::iterate(BitMapClosure* cl, MemRegion mr) { 167 HeapWord* start_addr = MAX2(startWord(), mr.start()); 168 HeapWord* end_addr = MIN2(endWord(), mr.end()); 169 170 if (end_addr > start_addr) { 171 // Right-open interval [start-offset, end-offset). 172 BitMap::idx_t start_offset = heapWordToOffset(start_addr); 173 BitMap::idx_t end_offset = heapWordToOffset(end_addr); 174 175 start_offset = _bm.get_next_one_offset(start_offset, end_offset); 176 while (start_offset < end_offset) { 177 if (!cl->do_bit(start_offset)) { 178 return false; 179 } 180 HeapWord* next_addr = MIN2(nextObject(offsetToHeapWord(start_offset)), end_addr); 331 // references, and the metadata is built-in. 332 process_grey_object<false>(obj); 333 } else { 334 push(obj); 335 } 336 } 337 } 338 } 339 340 inline void CMTask::deal_with_reference(oop obj) { 341 increment_refs_reached(); 342 343 HeapWord* objAddr = (HeapWord*) obj; 344 assert(obj->is_oop_or_null(true /* ignore mark word */), "Expected an oop or NULL at " PTR_FORMAT, p2i(obj)); 345 if (_g1h->is_in_g1_reserved(objAddr)) { 346 assert(obj != NULL, "null check is implicit"); 347 if (!_nextMarkBitMap->isMarked(objAddr)) { 348 // Only get the containing region if the object is not marked on the 349 // bitmap (otherwise, it's a waste of time since we won't do 350 // anything with it). 351 HeapRegion* hr = _g1h->heap_region_containing(obj); 352 if (!hr->obj_allocated_since_next_marking(obj)) { 353 make_reference_grey(obj, hr); 354 } 355 } 356 } 357 } 358 359 inline void ConcurrentMark::markPrev(oop p) { 360 assert(!_prevMarkBitMap->isMarked((HeapWord*) p), "sanity"); 361 // Note we are overriding the read-only view of the prev map here, via 362 // the cast. 363 ((CMBitMap*)_prevMarkBitMap)->mark((HeapWord*) p); 364 } 365 366 inline void ConcurrentMark::grayRoot(oop obj, size_t word_size, 367 uint worker_id, HeapRegion* hr) { 368 assert(obj != NULL, "pre-condition"); 369 HeapWord* addr = (HeapWord*) obj; 370 if (hr == NULL) { 371 hr = _g1h->heap_region_containing(addr); 372 } else { 373 assert(hr->is_in(addr), "pre-condition"); 374 } 375 assert(hr != NULL, "sanity"); 376 // Given that we're looking for a region that contains an object 377 // header it's impossible to get back a HC region. 378 assert(!hr->is_continues_humongous(), "sanity"); 379 380 if (addr < hr->next_top_at_mark_start()) { 381 if (!_nextMarkBitMap->isMarked(addr)) { 382 par_mark_and_count(obj, word_size, hr, worker_id); 383 } 384 } 385 } 386 387 #endif // SHARE_VM_GC_G1_CONCURRENTMARK_INLINE_HPP |