src/share/vm/gc_implementation/g1/g1CollectedHeap.hpp

rev 5920 : 8035406: Improve data structure for Code Cache remembered sets
Summary: Change the code cache remembered sets data structure from a GrowableArray to a chunked list of nmethods. This makes the data structure more amenable to parallelization, and decreases freeing time.
Reviewed-by:
rev 5921 : 8027295: Free CSet takes ~50% of young pause time
Summary: Improve fast card cache iteration and avoid taking locks when freeing the collection set.
Reviewed-by:

*** 837,850 ****
    // adding it to the free list that's passed as a parameter (this is
    // usually a local list which will be appended to the master free
    // list later). The used bytes of freed regions are accumulated in
    // pre_used. If par is true, the region's RSet will not be freed
    // up. The assumption is that this will be done later.
    void free_region(HeapRegion* hr,
                     size_t* pre_used,
                     FreeRegionList* free_list,
!                    bool par);
  
    // Frees a humongous region by collapsing it into individual regions
    // and calling free_region() for each of them. The freed regions
    // will be added to the free list that's passed as a parameter (this
    // is usually a local list which will be appended to the master free
--- 837,852 ----
    // adding it to the free list that's passed as a parameter (this is
    // usually a local list which will be appended to the master free
    // list later). The used bytes of freed regions are accumulated in
    // pre_used. If par is true, the region's RSet will not be freed
    // up. The assumption is that this will be done later.
+   // The locked parameter indicates if the caller has already taken
+   // care of proper synchronization. This may allow some optimizations.
    void free_region(HeapRegion* hr,
                     size_t* pre_used,
                     FreeRegionList* free_list,
!                    bool par, bool locked = false);
  
    // Frees a humongous region by collapsing it into individual regions
    // and calling free_region() for each of them. The freed regions
    // will be added to the free list that's passed as a parameter (this
    // is usually a local list which will be appended to the master free