comparison src/share/vm/gc_implementation/g1/heapRegion.hpp @ 6011:f7a8920427a6

7145441: G1: collection set chooser-related cleanup Summary: Cleanup of the CSet chooser class: standardize on uints for region num and indexes (instead of int, jint, etc.), make the method / field naming style more consistent, remove a lot of dead code. Reviewed-by: johnc, brutisso
author tonyp
date Wed, 18 Apr 2012 13:39:55 -0400
parents 720b6a76dd9d
children 8a2e5a6a19a4
comparison
equal deleted inserted replaced
6010:720b6a76dd9d 6011:f7a8920427a6
279 // We use concurrent marking to determine the amount of live data 279 // We use concurrent marking to determine the amount of live data
280 // in each heap region. 280 // in each heap region.
281 size_t _prev_marked_bytes; // Bytes known to be live via last completed marking. 281 size_t _prev_marked_bytes; // Bytes known to be live via last completed marking.
282 size_t _next_marked_bytes; // Bytes known to be live via in-progress marking. 282 size_t _next_marked_bytes; // Bytes known to be live via in-progress marking.
283 283
284 // See "sort_index" method. -1 means is not in the array. 284 // The calculated GC efficiency of the region.
285 int _sort_index;
286
287 // <PREDICTION>
288 double _gc_efficiency; 285 double _gc_efficiency;
289 // </PREDICTION>
290 286
291 enum YoungType { 287 enum YoungType {
292 NotYoung, // a region is not young 288 NotYoung, // a region is not young
293 Young, // a region is young 289 Young, // a region is young
294 Survivor // a region is young and it contains survivors 290 Survivor // a region is young and it contains survivors
627 623
628 // Returns "false" iff no object in the region was allocated when the 624 // Returns "false" iff no object in the region was allocated when the
629 // last mark phase ended. 625 // last mark phase ended.
630 bool is_marked() { return _prev_top_at_mark_start != bottom(); } 626 bool is_marked() { return _prev_top_at_mark_start != bottom(); }
631 627
632 // If "is_marked()" is true, then this is the index of the region in
633 // an array constructed at the end of marking of the regions in a
634 // "desirability" order.
635 int sort_index() {
636 return _sort_index;
637 }
638 void set_sort_index(int i) {
639 _sort_index = i;
640 }
641
642 void init_top_at_conc_mark_count() { 628 void init_top_at_conc_mark_count() {
643 _top_at_conc_mark_count = bottom(); 629 _top_at_conc_mark_count = bottom();
644 } 630 }
645 631
646 void set_top_at_conc_mark_count(HeapWord *cur) { 632 void set_top_at_conc_mark_count(HeapWord *cur) {