truffle: src/share/vm/gc_implementation/g1/g1CollectedHeap.cpp comparison

comparison src/share/vm/gc_implementation/g1/g1CollectedHeap.cpp @ 620:bcedf688d882

Merge

author	tonyp
date	Mon, 09 Mar 2009 11:32:57 -0400
parents	d8c7fa77a6dc 7ea5ca260b28
children	87fa6e083d82 660978a2a31a

comparison

equal deleted inserted replaced

-:3db67f76d308
+:bcedf688d882
 return true;
 }
 int calls() { return _calls; }
 };
+class RedirtyLoggedCardTableEntryFastClosure : public CardTableEntryClosure {
+public:
+bool do_card_ptr(jbyte* card_ptr, int worker_i) {
+*card_ptr = CardTableModRefBS::dirty_card_val();
+return true;
+}
+};
 YoungList::YoungList(G1CollectedHeap* g1h)
 : _g1h(g1h), _head(NULL),
 _scan_only_head(NULL), _scan_only_tail(NULL), _curr_scan_only(NULL),
 _length(0), _scan_only_length(0),
 _last_sampled_rs_lengths(0),
 // dirty-card logging system, some cards may be dirty by weak-ref
 // processing, and may be enqueued.  But the whole card table is
 // dirtied, so this should abandon those logs, and set "do_traversal"
 // to true.
 concurrent_g1_refine()->set_pya_restart();
+assert(!G1DeferredRSUpdate
+|| (G1DeferredRSUpdate && (dirty_card_queue_set().completed_buffers_num() == 0)), "Should not be any");
 assert(regions_accounted_for(), "Region leakage!");
 }
 if (g1_policy()->in_young_gc_mode()) {
 _young_list->reset_sampled_info();
 JavaThread::dirty_card_queue_set().initialize(DirtyCardQ_CBL_mon,
 DirtyCardQ_FL_lock,
 G1DirtyCardQueueMax,
 Shared_DirtyCardQ_lock);
 }
+if (G1DeferredRSUpdate) {
+dirty_card_queue_set().initialize(DirtyCardQ_CBL_mon,
+DirtyCardQ_FL_lock,
+0,
+Shared_DirtyCardQ_lock,
+&JavaThread::dirty_card_queue_set());
+}
 // In case we're keeping closure specialization stats, initialize those
 // counts and that mechanism.
 SpecializationStats::clear();
 _gc_alloc_region_list = NULL;
 };
 void
 G1CollectedHeap::checkConcurrentMark() {
 VerifyMarkedObjsClosure verifycl(this);
-doConcurrentMark();
 //    MutexLockerEx x(getMarkBitMapLock(),
 //              Mutex::_no_safepoint_check_flag);
 object_iterate(&verifycl);
 }
 g1_policy()->record_collection_pause_start(start_time_sec,
 start_used_bytes);
 guarantee(_in_cset_fast_test == NULL, "invariant");
 guarantee(_in_cset_fast_test_base == NULL, "invariant");
-_in_cset_fast_test_length = n_regions();
+_in_cset_fast_test_length = max_regions();
 _in_cset_fast_test_base =
 NEW_C_HEAP_ARRAY(bool, _in_cset_fast_test_length);
 memset(_in_cset_fast_test_base, false,
 _in_cset_fast_test_length * sizeof(bool));
 // We're biasing _in_cset_fast_test to avoid subtracting the
 #endif // G1_DEBUG
 }
 }
 };
-class RecreateRSetEntriesClosure: public OopClosure {
+class UpdateRSetImmediate : public OopsInHeapRegionClosure {
 private:
 G1CollectedHeap* _g1;
 G1RemSet* _g1_rem_set;
-HeapRegion* _from;
 public:
-RecreateRSetEntriesClosure(G1CollectedHeap* g1, HeapRegion* from) :
+UpdateRSetImmediate(G1CollectedHeap* g1) :
-_g1(g1), _g1_rem_set(g1->g1_rem_set()), _from(from)
+_g1(g1), _g1_rem_set(g1->g1_rem_set()) {}
-{}
 void do_oop(narrowOop* p) {
 guarantee(false, "NYI");
 }
 void do_oop(oop* p) {
 assert(_from->is_in_reserved(p), "paranoia");
-if (*p != NULL) {
+if (*p != NULL && !_from->is_survivor()) {
-_g1_rem_set->write_ref(_from, p);
+_g1_rem_set->par_write_ref(_from, p, 0);
 }
 }
 };
+class UpdateRSetDeferred : public OopsInHeapRegionClosure {
+private:
+G1CollectedHeap* _g1;
+DirtyCardQueue *_dcq;
+CardTableModRefBS* _ct_bs;
+public:
+UpdateRSetDeferred(G1CollectedHeap* g1, DirtyCardQueue* dcq) :
+_g1(g1), _ct_bs((CardTableModRefBS*)_g1->barrier_set()), _dcq(dcq) {}
+void do_oop(narrowOop* p) {
+guarantee(false, "NYI");
+}
+void do_oop(oop* p) {
+assert(_from->is_in_reserved(p), "paranoia");
+if (!_from->is_in_reserved(*p) && !_from->is_survivor()) {
+size_t card_index = _ct_bs->index_for(p);
+if (_ct_bs->mark_card_deferred(card_index)) {
+_dcq->enqueue((jbyte*)_ct_bs->byte_for_index(card_index));
+}
+}
+}
+};
 class RemoveSelfPointerClosure: public ObjectClosure {
 private:
 G1CollectedHeap* _g1;
 ConcurrentMark* _cm;
 HeapRegion* _hr;
 size_t _prev_marked_bytes;
 size_t _next_marked_bytes;
+OopsInHeapRegionClosure *_cl;
 public:
-RemoveSelfPointerClosure(G1CollectedHeap* g1, HeapRegion* hr) :
+RemoveSelfPointerClosure(G1CollectedHeap* g1, OopsInHeapRegionClosure* cl) :
-_g1(g1), _cm(_g1->concurrent_mark()), _hr(hr),
+_g1(g1), _cm(_g1->concurrent_mark()),  _prev_marked_bytes(0),
-_prev_marked_bytes(0), _next_marked_bytes(0)
+_next_marked_bytes(0), _cl(cl) {}
-{}
 size_t prev_marked_bytes() { return _prev_marked_bytes; }
 size_t next_marked_bytes() { return _next_marked_bytes; }
 // The original idea here was to coalesce evacuated and dead objects.
 // card in the collection set and coming across an array that
 // was being chunked and looking malformed. The problem is
 // that, if evacuation fails, we might have remembered set
 // entries missing given that we skipped cards on the
 // collection set. So, we'll recreate such entries now.
-RecreateRSetEntriesClosure cl(_g1, _hr);
+obj->oop_iterate(_cl);
-obj->oop_iterate(&cl);
 assert(_cm->isPrevMarked(obj), "Should be marked!");
 } else {
 // The object has been either evacuated or is dead. Fill it with a
 // dummy object.
 MemRegion mr((HeapWord*)obj, obj->size());
 }
 }
 };
 void G1CollectedHeap::remove_self_forwarding_pointers() {
+UpdateRSetImmediate immediate_update(_g1h);
+DirtyCardQueue dcq(&_g1h->dirty_card_queue_set());
+UpdateRSetDeferred deferred_update(_g1h, &dcq);
+OopsInHeapRegionClosure *cl;
+if (G1DeferredRSUpdate) {
+cl = &deferred_update;
+} else {
+cl = &immediate_update;
+}
 HeapRegion* cur = g1_policy()->collection_set();
 while (cur != NULL) {
 assert(g1_policy()->assertMarkedBytesDataOK(), "Should be!");
+RemoveSelfPointerClosure rspc(_g1h, cl);
 if (cur->evacuation_failed()) {
-RemoveSelfPointerClosure rspc(_g1h, cur);
 assert(cur->in_collection_set(), "bad CS");
+cl->set_region(cur);
 cur->object_iterate(&rspc);
 // A number of manipulations to make the TAMS be the current top,
 // and the marked bytes be the ones observed in the iteration.
 if (_g1h->concurrent_mark()->at_least_one_mark_complete()) {
 class G1ParScanThreadState : public StackObj {
 protected:
 G1CollectedHeap* _g1h;
 RefToScanQueue*  _refs;
+DirtyCardQueue   _dcq;
+CardTableModRefBS* _ct_bs;
+G1RemSet* _g1_rem;
 typedef GrowableArray<oop*> OverflowQueue;
 OverflowQueue* _overflowed_refs;
 G1ParGCAllocBuffer _alloc_buffers[GCAllocPurposeCount];
 void   add_to_alloc_buffer_waste(size_t waste) { _alloc_buffer_waste += waste; }
 void   add_to_undo_waste(size_t waste)         { _undo_waste += waste; }
+DirtyCardQueue& dirty_card_queue()             { return _dcq;  }
+CardTableModRefBS* ctbs()                      { return _ct_bs; }
+void immediate_rs_update(HeapRegion* from, oop* p, int tid) {
+_g1_rem->par_write_ref(from, p, tid);
+}
+void deferred_rs_update(HeapRegion* from, oop* p, int tid) {
+// If the new value of the field points to the same region or
+// is the to-space, we don't need to include it in the Rset updates.
+if (!from->is_in_reserved(*p) && !from->is_survivor()) {
+size_t card_index = ctbs()->index_for(p);
+// If the card hasn't been added to the buffer, do it.
+if (ctbs()->mark_card_deferred(card_index)) {
+dirty_card_queue().enqueue((jbyte*)ctbs()->byte_for_index(card_index));
+}
+}
+}
 public:
 G1ParScanThreadState(G1CollectedHeap* g1h, int queue_num)
 : _g1h(g1h),
 _refs(g1h->task_queue(queue_num)),
+_dcq(&g1h->dirty_card_queue_set()),
+_ct_bs((CardTableModRefBS*)_g1h->barrier_set()),
+_g1_rem(g1h->g1_rem_set()),
 _hash_seed(17), _queue_num(queue_num),
 _term_attempts(0),
 _age_table(false),
 #if G1_DETAILED_STATS
 _pushes(0), _pops(0), _steals(0),
 }
 int refs_to_scan()                             { return refs()->size();                 }
 int overflowed_refs_to_scan()                  { return overflowed_refs()->length();    }
+void update_rs(HeapRegion* from, oop* p, int tid) {
+if (G1DeferredRSUpdate) {
+deferred_rs_update(from, p, tid);
+} else {
+immediate_rs_update(from, p, tid);
+}
+}
 HeapWord* allocate_slow(GCAllocPurpose purpose, size_t word_sz) {
 HeapWord* obj = NULL;
 if (word_sz * 100 <
 (size_t)(ParallelGCG1AllocBufferSize / HeapWordSize) *
 }
 }
 }
 };
 G1ParClosureSuper::G1ParClosureSuper(G1CollectedHeap* g1, G1ParScanThreadState* par_scan_state) :
 _g1(g1), _g1_rem(_g1->g1_rem_set()), _cm(_g1->concurrent_mark()),
 _par_scan_state(par_scan_state) { }
 // This closure is applied to the fields of the objects that have just been copied.
 // problems before we go into push_on_queue to know where the
 // problem is coming from
 assert(obj == *p, "the value of *p should not have changed");
 _par_scan_state->push_on_queue(p);
 } else {
-_g1_rem->par_write_ref(_from, p, _par_scan_state->queue_num());
+_par_scan_state->update_rs(_from, p, _par_scan_state->queue_num());
 }
 }
 }
 void G1ParCopyHelper::mark_forwardee(oop* p) {
 } else {
 *p = copy_to_survivor_space(obj);
 }
 // When scanning the RS, we only care about objs in CS.
 if (barrier == G1BarrierRS) {
-_g1_rem->par_write_ref(_from, p, _par_scan_state->queue_num());
+_par_scan_state->update_rs(_from, p, _par_scan_state->queue_num());
 }
 }
 // When scanning moved objs, must look at all oops.
 if (barrier == G1BarrierEvac && obj != NULL) {
-_g1_rem->par_write_ref(_from, p, _par_scan_state->queue_num());
+_par_scan_state->update_rs(_from, p, _par_scan_state->queue_num());
 }
 if (do_gen_barrier && obj != NULL) {
 par_do_barrier(p);
 }
 pss.set_partial_scan_closure(&partial_scan_cl);
 G1ParScanExtRootClosure         only_scan_root_cl(_g1h, &pss);
 G1ParScanPermClosure            only_scan_perm_cl(_g1h, &pss);
 G1ParScanHeapRSClosure          only_scan_heap_rs_cl(_g1h, &pss);
 G1ParScanAndMarkExtRootClosure  scan_mark_root_cl(_g1h, &pss);
 G1ParScanAndMarkPermClosure     scan_mark_perm_cl(_g1h, &pss);
 G1ParScanAndMarkHeapRSClosure   scan_mark_heap_rs_cl(_g1h, &pss);
 OopsInHeapRegionClosure        *scan_root_cl;
 set_evacuation_failed(false);
 g1_rem_set()->prepare_for_oops_into_collection_set_do();
 concurrent_g1_refine()->set_use_cache(false);
 int n_workers = (ParallelGCThreads > 0 ? workers()->total_workers() : 1);
 set_par_threads(n_workers);
 G1ParTask g1_par_task(this, n_workers, _task_queues);
 init_for_evac_failure(NULL);
 change_strong_roots_parity();  // In preparation for parallel strong roots.
 rem_set()->prepare_for_younger_refs_iterate(true);
+assert(dirty_card_queue_set().completed_buffers_num() == 0, "Should be empty");
 double start_par = os::elapsedTime();
 if (ParallelGCThreads > 0) {
 // The individual threads will set their evac-failure closures.
 workers()->run_task(&g1_par_task);
 } else {
 g1_par_task.work(0);
 {
 G1IsAliveClosure is_alive(this);
 G1KeepAliveClosure keep_alive(this);
 JNIHandles::weak_oops_do(&is_alive, &keep_alive);
 }
 g1_rem_set()->cleanup_after_oops_into_collection_set_do();
 concurrent_g1_refine()->set_use_cache(true);
 finalize_for_evac_failure();
 // Must do this before removing self-forwarding pointers, which clears
 // the per-region evac-failure flags.
 concurrent_mark()->complete_marking_in_collection_set();
 if (evacuation_failed()) {
 remove_self_forwarding_pointers();
 if (PrintGCDetails) {
 gclog_or_tty->print(" (evacuation failed)");
 } else if (PrintGC) {
 gclog_or_tty->print("--");
 }
+}
+if (G1DeferredRSUpdate) {
+RedirtyLoggedCardTableEntryFastClosure redirty;
+dirty_card_queue_set().set_closure(&redirty);
+dirty_card_queue_set().apply_closure_to_all_completed_buffers();
+JavaThread::dirty_card_queue_set().merge_bufferlists(&dirty_card_queue_set());
+assert(dirty_card_queue_set().completed_buffers_num() == 0, "All should be consumed");
 }
 COMPILER2_PRESENT(DerivedPointerTable::update_pointers());
 }

Mercurial > hg > truffle

comparison src/share/vm/gc_implementation/g1/g1CollectedHeap.cpp @ 620:bcedf688d882