equal
deleted
inserted
replaced
69 |
69 |
70 initialize_reserved_region((HeapWord*)heap_rs.base(), (HeapWord*)(heap_rs.base() + heap_rs.size())); |
70 initialize_reserved_region((HeapWord*)heap_rs.base(), (HeapWord*)(heap_rs.base() + heap_rs.size())); |
71 |
71 |
72 PSCardTable* card_table = new PSCardTable(reserved_region()); |
72 PSCardTable* card_table = new PSCardTable(reserved_region()); |
73 card_table->initialize(); |
73 card_table->initialize(); |
74 CardTableModRefBS* const barrier_set = new CardTableModRefBS(card_table); |
74 CardTableBarrierSet* const barrier_set = new CardTableBarrierSet(card_table); |
75 barrier_set->initialize(); |
75 barrier_set->initialize(); |
76 set_barrier_set(barrier_set); |
76 set_barrier_set(barrier_set); |
77 |
77 |
78 // Make up the generations |
78 // Make up the generations |
79 // Calculate the maximum size that a generation can grow. This |
79 // Calculate the maximum size that a generation can grow. This |
624 assert(heap != NULL, "Uninitialized access to ParallelScavengeHeap::heap()"); |
624 assert(heap != NULL, "Uninitialized access to ParallelScavengeHeap::heap()"); |
625 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Not a ParallelScavengeHeap"); |
625 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Not a ParallelScavengeHeap"); |
626 return (ParallelScavengeHeap*)heap; |
626 return (ParallelScavengeHeap*)heap; |
627 } |
627 } |
628 |
628 |
629 CardTableModRefBS* ParallelScavengeHeap::barrier_set() { |
629 CardTableBarrierSet* ParallelScavengeHeap::barrier_set() { |
630 return barrier_set_cast<CardTableModRefBS>(CollectedHeap::barrier_set()); |
630 return barrier_set_cast<CardTableBarrierSet>(CollectedHeap::barrier_set()); |
631 } |
631 } |
632 |
632 |
633 PSCardTable* ParallelScavengeHeap::card_table() { |
633 PSCardTable* ParallelScavengeHeap::card_table() { |
634 return static_cast<PSCardTable*>(barrier_set()->card_table()); |
634 return static_cast<PSCardTable*>(barrier_set()->card_table()); |
635 } |
635 } |