src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp

changeset 447
6432c3bb6240
parent 435
a61af66fc99e
child 548
ba764ed4b6f2
     1.1 --- a/src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp	Tue Feb 26 15:57:49 2008 -0800
     1.2 +++ b/src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp	Fri Feb 29 14:42:56 2008 -0800
     1.3 @@ -418,7 +418,7 @@
     1.4    // chunk exists, return NULL.
     1.5    FreeChunk* find_chunk_at_end();
     1.6  
     1.7 -  bool adaptive_freelists() { return _adaptive_freelists; }
     1.8 +  bool adaptive_freelists() const { return _adaptive_freelists; }
     1.9  
    1.10    void set_collector(CMSCollector* collector) { _collector = collector; }
    1.11  
    1.12 @@ -566,7 +566,7 @@
    1.13    FreeChunk* allocateScratch(size_t size);
    1.14  
    1.15    // returns true if either the small or large linear allocation buffer is empty.
    1.16 -  bool       linearAllocationWouldFail();
    1.17 +  bool       linearAllocationWouldFail() const;
    1.18  
    1.19    // Adjust the chunk for the minimum size.  This version is called in
    1.20    // most cases in CompactibleFreeListSpace methods.
    1.21 @@ -585,6 +585,9 @@
    1.22    void      addChunkAndRepairOffsetTable(HeapWord* chunk, size_t size,
    1.23                bool coalesced);
    1.24  
    1.25 +  // Support for decisions regarding concurrent collection policy
    1.26 +  bool should_concurrent_collect() const;
    1.27 +
    1.28    // Support for compaction
    1.29    void prepare_for_compaction(CompactPoint* cp);
    1.30    void adjust_pointers();
    1.31 @@ -622,7 +625,7 @@
    1.32    // coalescing of chunks during the sweep of garbage.
    1.33  
    1.34    // Print the statistics for the free lists.
    1.35 -  void printFLCensus(int sweepCt)         const;
    1.36 +  void printFLCensus(size_t sweep_count) const;
    1.37  
    1.38    // Statistics functions
    1.39    // Initialize census for lists before the sweep.
    1.40 @@ -635,12 +638,11 @@
    1.41    // Clear the census for each of the free lists.
    1.42    void clearFLCensus();
    1.43    // Perform functions for the census after the end of the sweep.
    1.44 -  void endSweepFLCensus(int sweepCt);
    1.45 +  void endSweepFLCensus(size_t sweep_count);
    1.46    // Return true if the count of free chunks is greater
    1.47    // than the desired number of free chunks.
    1.48    bool coalOverPopulated(size_t size);
    1.49  
    1.50 -
    1.51  // Record (for each size):
    1.52  //
    1.53  //   split-births = #chunks added due to splits in (prev-sweep-end,

mercurial