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

Tue, 19 May 2009 04:05:31 -0700

author
apetrusenko
date
Tue, 19 May 2009 04:05:31 -0700
changeset 1231
29e7d79232b9
parent 1230
215f81b4d9b3
child 1279
bd02caa94611
permissions
-rw-r--r--

6819065: G1: eliminate high serial card table clearing time
Reviewed-by: iveresov, tonyp

     1 /*
     2  * Copyright 2001-2007 Sun Microsystems, Inc.  All Rights Reserved.
     3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     4  *
     5  * This code is free software; you can redistribute it and/or modify it
     6  * under the terms of the GNU General Public License version 2 only, as
     7  * published by the Free Software Foundation.
     8  *
     9  * This code is distributed in the hope that it will be useful, but WITHOUT
    10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    12  * version 2 for more details (a copy is included in the LICENSE file that
    13  * accompanied this code).
    14  *
    15  * You should have received a copy of the GNU General Public License version
    16  * 2 along with this work; if not, write to the Free Software Foundation,
    17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
    18  *
    19  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
    20  * CA 95054 USA or visit www.sun.com if you need additional information or
    21  * have any questions.
    22  *
    23  */
    25 // Forward Decl.
    26 class ConcurrentG1Refine;
    28 // The G1 Concurrent Refinement Thread (could be several in the future).
    30 class ConcurrentG1RefineThread: public ConcurrentGCThread {
    31   friend class VMStructs;
    32   friend class G1CollectedHeap;
    34   double _vtime_start;  // Initial virtual time.
    35   double _vtime_accum;  // Initial virtual time.
    36   int _worker_id;
    37   int _worker_id_offset;
    39   // The refinement threads collection is linked list. A predecessor can activate a successor
    40   // when the number of the rset update buffer crosses a certain threshold. A successor
    41   // would self-deactivate when the number of the buffers falls below the threshold.
    42   bool _active;
    43   ConcurrentG1RefineThread *       _next;
    44  public:
    45   virtual void run();
    47   bool is_active()  { return _active;  }
    48   void activate()   { _active = true;  }
    49   void deactivate() { _active = false; }
    51  private:
    52   ConcurrentG1Refine*              _cg1r;
    54   COTracker                        _co_tracker;
    55   double                           _interval_ms;
    57   void decreaseInterval(int processing_time_ms) {
    58     double min_interval_ms = (double) processing_time_ms;
    59     _interval_ms = 0.8 * _interval_ms;
    60     if (_interval_ms < min_interval_ms)
    61       _interval_ms = min_interval_ms;
    62   }
    63   void increaseInterval(int processing_time_ms) {
    64     double max_interval_ms = 9.0 * (double) processing_time_ms;
    65     _interval_ms = 1.1 * _interval_ms;
    66     if (max_interval_ms > 0 && _interval_ms > max_interval_ms)
    67       _interval_ms = max_interval_ms;
    68   }
    70   void sleepBeforeNextCycle();
    72   // For use by G1CollectedHeap, which is a friend.
    73   static SuspendibleThreadSet* sts() { return &_sts; }
    75  public:
    76   // Constructor
    77   ConcurrentG1RefineThread(ConcurrentG1Refine* cg1r, ConcurrentG1RefineThread* next,
    78                            int worker_id_offset, int worker_id);
    80   // Printing
    81   void print();
    83   // Total virtual time so far.
    84   double vtime_accum() { return _vtime_accum; }
    86   ConcurrentG1Refine* cg1r()                     { return _cg1r;     }
    88   void            sample_young_list_rs_lengths();
    90   // Yield for GC
    91   void            yield();
    93   // shutdown
    94   void stop();
    95 };

mercurial