Searched refs:task_card_bm (Results 1 - 3 of 3) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DconcurrentMark.inline.hpp82 BitMap* task_card_bm) {
95 assert(task_card_bm != NULL, "pre-condition");
115 set_card_bitmap_range(task_card_bm, start_idx, end_idx, false /* is_par */);
124 BitMap* task_card_bm = count_card_bitmap_for(worker_id); local
125 count_region(mr, hr, marked_bytes_array, task_card_bm);
140 BitMap* task_card_bm) {
142 count_region(mr, hr, marked_bytes_array, task_card_bm);
151 BitMap* task_card_bm = count_card_bitmap_for(worker_id); local
153 count_object(obj, hr, marked_bytes_array, task_card_bm);
161 BitMap* task_card_bm) {
80 count_region(MemRegion mr, HeapRegion* hr, size_t* marked_bytes_array, BitMap* task_card_bm) argument
137 count_object(oop obj, HeapRegion* hr, size_t* marked_bytes_array, BitMap* task_card_bm) argument
158 par_mark_and_count(oop obj, HeapRegion* hr, size_t* marked_bytes_array, BitMap* task_card_bm) argument
[all...]
H A DconcurrentMark.hpp843 BitMap* task_card_bm = &_count_card_bitmaps[worker_id]; local
844 assert(task_card_bm->size() == _card_bm.size(), "size mismatch");
845 return task_card_bm;
868 BitMap* task_card_bm);
882 BitMap* task_card_bm);
892 BitMap* task_card_bm);
H A DconcurrentMark.cpp2991 BitMap* task_card_bm = _cm->count_card_bitmap_for(i); local
2999 BitMap::idx_t scan_idx = task_card_bm->get_next_one_offset(start_idx, limit_idx);
3002 assert(task_card_bm->at(scan_idx) == true, "should be");
3012 scan_idx = task_card_bm->get_next_one_offset(next_idx, limit_idx);
3095 BitMap* task_card_bm = count_card_bitmap_for(i); local
3098 assert(task_card_bm->size() == _card_bm.size(), "size mismatch");
3102 task_card_bm->clear();

Completed in 47 milliseconds