equal
deleted
inserted
replaced
152 |
152 |
153 // The number of regions we could create by expansion. |
153 // The number of regions we could create by expansion. |
154 uint _expansion_regions; |
154 uint _expansion_regions; |
155 |
155 |
156 // The block offset table for the G1 heap. |
156 // The block offset table for the G1 heap. |
157 G1BlockOffsetSharedArray* _bot_shared; |
157 G1BlockOffsetTable* _bot; |
158 |
158 |
159 // Tears down the region sets / lists so that they are empty and the |
159 // Tears down the region sets / lists so that they are empty and the |
160 // regions on the heap do not belong to a region set / list. The |
160 // regions on the heap do not belong to a region set / list. The |
161 // only exception is the humongous set which we leave unaltered. If |
161 // only exception is the humongous set which we leave unaltered. If |
162 // free_list_only is true, it will only tear down the master free |
162 // free_list_only is true, it will only tear down the master free |
1006 |
1006 |
1007 // Apply the given closure on all cards in the Dirty Card Queue Set, emptying it. |
1007 // Apply the given closure on all cards in the Dirty Card Queue Set, emptying it. |
1008 void iterate_dirty_card_closure(CardTableEntryClosure* cl, uint worker_i); |
1008 void iterate_dirty_card_closure(CardTableEntryClosure* cl, uint worker_i); |
1009 |
1009 |
1010 // The shared block offset table array. |
1010 // The shared block offset table array. |
1011 G1BlockOffsetSharedArray* bot_shared() const { return _bot_shared; } |
1011 G1BlockOffsetTable* bot() const { return _bot; } |
1012 |
1012 |
1013 // Reference Processing accessors |
1013 // Reference Processing accessors |
1014 |
1014 |
1015 // The STW reference processor.... |
1015 // The STW reference processor.... |
1016 ReferenceProcessor* ref_processor_stw() const { return _ref_processor_stw; } |
1016 ReferenceProcessor* ref_processor_stw() const { return _ref_processor_stw; } |