jdk8-mips64-public/hotspot: comparison src/share/vm/gc_implementation/g1/concurrentMark.inline.hpp

-:877914d90c57
+:d30fa85f9994
 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_CONCURRENTMARK_INLINE_HPP
 #define SHARE_VM_GC_IMPLEMENTATION_G1_CONCURRENTMARK_INLINE_HPP
 #include "gc_implementation/g1/concurrentMark.hpp"
 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
+// Returns the index in the liveness accounting card bitmap
+// for the given address
+inline BitMap::idx_t ConcurrentMark::card_bitmap_index_for(HeapWord* addr) {
+// Below, the term "card num" means the result of shifting an address
+// by the card shift -- address 0 corresponds to card number 0.  One
+// must subtract the card num of the bottom of the heap to obtain a
+// card table index.
+intptr_t card_num = intptr_t(uintptr_t(addr) >> CardTableModRefBS::card_shift);
+return card_num - heap_bottom_card_num();
+}
+// Counts the given memory region in the given task/worker
+// counting data structures.
+inline void ConcurrentMark::count_region(MemRegion mr, HeapRegion* hr,
+size_t* marked_bytes_array,
+BitMap* task_card_bm) {
+G1CollectedHeap* g1h = _g1h;
+HeapWord* start = mr.start();
+HeapWord* last = mr.last();
+size_t region_size_bytes = mr.byte_size();
+size_t index = hr->hrs_index();
+assert(!hr->continuesHumongous(), "should not be HC region");
+assert(hr == g1h->heap_region_containing(start), "sanity");
+assert(hr == g1h->heap_region_containing(mr.last()), "sanity");
+assert(marked_bytes_array != NULL, "pre-condition");
+assert(task_card_bm != NULL, "pre-condition");
+// Add to the task local marked bytes for this region.
+marked_bytes_array[index] += region_size_bytes;
+BitMap::idx_t start_idx = card_bitmap_index_for(start);
+BitMap::idx_t last_idx = card_bitmap_index_for(last);
+// The card bitmap is task/worker specific => no need to use 'par' routines.
+// Set bits in the inclusive bit range [start_idx, last_idx].
+//
+// For small ranges use a simple loop; otherwise use set_range
+// The range are the cards that are spanned by the object/region
+// so 8 cards will allow objects/regions up to 4K to be handled
+// using the loop.
+if ((last_idx - start_idx) <= 8) {
+for (BitMap::idx_t i = start_idx; i <= last_idx; i += 1) {
+task_card_bm->set_bit(i);
+}
+} else {
+assert(last_idx < task_card_bm->size(), "sanity");
+// Note: BitMap::set_range() is exclusive.
+task_card_bm->set_range(start_idx, last_idx+1);
+}
+}
+// Counts the given memory region, which may be a single object, in the
+// task/worker counting data structures for the given worker id.
+inline void ConcurrentMark::count_region(MemRegion mr, uint worker_id) {
+size_t* marked_bytes_array = count_marked_bytes_array_for(worker_id);
+BitMap* task_card_bm = count_card_bitmap_for(worker_id);
+HeapWord* addr = mr.start();
+HeapRegion* hr = _g1h->heap_region_containing_raw(addr);
+count_region(mr, hr, marked_bytes_array, task_card_bm);
+}
+// Counts the given object in the given task/worker counting data structures.
+inline void ConcurrentMark::count_object(oop obj,
+HeapRegion* hr,
+size_t* marked_bytes_array,
+BitMap* task_card_bm) {
+MemRegion mr((HeapWord*)obj, obj->size());
+count_region(mr, hr, marked_bytes_array, task_card_bm);
+}
+// Counts the given object in the task/worker counting data
+// structures for the given worker id.
+inline void ConcurrentMark::count_object(oop obj, HeapRegion* hr, uint worker_id) {
+size_t* marked_bytes_array = count_marked_bytes_array_for(worker_id);
+BitMap* task_card_bm = count_card_bitmap_for(worker_id);
+HeapWord* addr = (HeapWord*) obj;
+count_object(obj, hr, marked_bytes_array, task_card_bm);
+}
+// Attempts to mark the given object and, if successful, counts
+// the object in the given task/worker counting structures.
+inline bool ConcurrentMark::par_mark_and_count(oop obj,
+HeapRegion* hr,
+size_t* marked_bytes_array,
+BitMap* task_card_bm) {
+HeapWord* addr = (HeapWord*)obj;
+if (_nextMarkBitMap->parMark(addr)) {
+// Update the task specific count data for the object.
+count_object(obj, hr, marked_bytes_array, task_card_bm);
+return true;
+}
+return false;
+}
+// Attempts to mark the given object and, if successful, counts
+// the object in the task/worker counting structures for the
+// given worker id.
+inline bool ConcurrentMark::par_mark_and_count(oop obj,
+HeapRegion* hr,
+uint worker_id) {
+HeapWord* addr = (HeapWord*)obj;
+if (_nextMarkBitMap->parMark(addr)) {
+// Update the task specific count data for the object.
+count_object(obj, hr, worker_id);
+return true;
+}
+return false;
+}
+// As above - but we don't know the heap region containing the
+// object and so have to supply it.
+inline bool ConcurrentMark::par_mark_and_count(oop obj, uint worker_id) {
+HeapWord* addr = (HeapWord*)obj;
+HeapRegion* hr = _g1h->heap_region_containing_raw(addr);
+return par_mark_and_count(obj, hr, worker_id);
+}
+// Similar to the above routine but we already know the size, in words, of
+// the object that we wish to mark/count
+inline bool ConcurrentMark::par_mark_and_count(oop obj,
+size_t word_size,
+uint worker_id) {
+HeapWord* addr = (HeapWord*)obj;
+if (_nextMarkBitMap->parMark(addr)) {
+// Update the task specific count data for the object.
+MemRegion mr(addr, word_size);
+count_region(mr, worker_id);
+return true;
+}
+return false;
+}
+// Unconditionally mark the given object, and unconditinally count
+// the object in the counting structures for worker id 0.
+// Should *not* be called from parallel code.
+inline bool ConcurrentMark::mark_and_count(oop obj, HeapRegion* hr) {
+HeapWord* addr = (HeapWord*)obj;
+_nextMarkBitMap->mark(addr);
+// Update the task specific count data for the object.
+count_object(obj, hr, 0 /* worker_id */);
+return true;
+}
+// As above - but we don't have the heap region containing the
+// object, so we have to supply it.
+inline bool ConcurrentMark::mark_and_count(oop obj) {
+HeapWord* addr = (HeapWord*)obj;
+HeapRegion* hr = _g1h->heap_region_containing_raw(addr);
+return mark_and_count(obj, hr);
+}
 inline bool CMBitMapRO::iterate(BitMapClosure* cl, MemRegion mr) {
 HeapWord* start_addr = MAX2(startWord(), mr.start());
 HeapWord* end_addr = MIN2(endWord(), mr.end());
 ++_refs_reached;
 HeapWord* objAddr = (HeapWord*) obj;
 assert(obj->is_oop_or_null(true /* ignore mark word */), "Error");
 if (_g1h->is_in_g1_reserved(objAddr)) {
 assert(obj != NULL, "null check is implicit");
 if (!_nextMarkBitMap->isMarked(objAddr)) {
 // Only get the containing region if the object is not marked on the
 // bitmap (otherwise, it's a waste of time since we won't do
 // anything with it).
 gclog_or_tty->print_cr("[%d] "PTR_FORMAT" is not considered marked",
 _task_id, (void*) obj);
 }
 // we need to mark it first
-if (_nextMarkBitMap->parMark(objAddr)) {
+if (_cm->par_mark_and_count(obj, hr, _marked_bytes_array, _card_bm)) {
 // No OrderAccess:store_load() is needed. It is implicit in the
-// CAS done in parMark(objAddr) above
+// CAS done in CMBitMap::parMark() call in the routine above.
 HeapWord* global_finger = _cm->finger();
 #if _CHECK_BOTH_FINGERS_
 // we will check both the local and global fingers
 // Note we are overriding the read-only view of the prev map here, via
 // the cast.
 ((CMBitMap*)_prevMarkBitMap)->mark((HeapWord*) p);
 }
-inline void ConcurrentMark::markNext(oop p) {
+inline void ConcurrentMark::grayRoot(oop obj, size_t word_size, uint worker_id) {
-assert(!_nextMarkBitMap->isMarked((HeapWord*) p), "sanity");
-_nextMarkBitMap->mark((HeapWord*) p);
-}
-inline void ConcurrentMark::grayRoot(oop obj, size_t word_size) {
 HeapWord* addr = (HeapWord*) obj;
 // Currently we don't do anything with word_size but we will use it
 // in the very near future in the liveness calculation piggy-backing
 // changes.
 word_size * HeapWordSize, hr->capacity(),
 HR_FORMAT_PARAMS(hr)));
 #endif // ASSERT
 if (!_nextMarkBitMap->isMarked(addr)) {
-_nextMarkBitMap->parMark(addr);
+par_mark_and_count(obj, word_size, worker_id);
 }
 }
 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_CONCURRENTMARK_INLINE_HPP

Mercurial > jdk8-mips64-public > hotspot / file comparison

comparison: src/share/vm/gc_implementation/g1/concurrentMark.inline.hpp

src/share/vm/gc_implementation/g1/concurrentMark.inline.hpp