Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/gc_implementation/g1/concurrentG1RefineThread.hpp@15c5903cf9e1 (annotated)
src/share/vm/gc_implementation/g1/concurrentG1RefineThread.hpp
Mon, 03 Aug 2009 12:59:30 -0700
- author
- johnc
- date
- Mon, 03 Aug 2009 12:59:30 -0700
- changeset 1324
- 15c5903cf9e1
- parent 1279
- bd02caa94611
- child 1371
- e1fdf4fd34dc
- permissions
- -rw-r--r--
6865703: G1: Parallelize hot card cache cleanup
Summary: Have the GC worker threads clear the hot card cache in parallel by having each worker thread claim a chunk of the card cache and process the cards in that chunk. The size of the chunks that each thread will claim is determined at VM initialization from the size of the card cache and the number of worker threads.
Reviewed-by: jmasa, tonyp
| ysr@777 | 1 | /* |
| xdono@1279 | 2 | * Copyright 2001-2009 Sun Microsystems, Inc. All Rights Reserved. |
| ysr@777 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| ysr@777 | 4 | * |
| ysr@777 | 5 | * This code is free software; you can redistribute it and/or modify it |
| ysr@777 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| ysr@777 | 7 | * published by the Free Software Foundation. |
| ysr@777 | 8 | * |
| ysr@777 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| ysr@777 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| ysr@777 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| ysr@777 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| ysr@777 | 13 | * accompanied this code). |
| ysr@777 | 14 | * |
| ysr@777 | 15 | * You should have received a copy of the GNU General Public License version |
| ysr@777 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| ysr@777 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| ysr@777 | 18 | * |
| ysr@777 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
| ysr@777 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
| ysr@777 | 21 | * have any questions. |
| ysr@777 | 22 | * |
| ysr@777 | 23 | */ |
| ysr@777 | 24 | |
| ysr@777 | 25 | // Forward Decl. |
| ysr@777 | 26 | class ConcurrentG1Refine; |
| ysr@777 | 27 | |
| ysr@777 | 28 | // The G1 Concurrent Refinement Thread (could be several in the future). |
| ysr@777 | 29 | |
| ysr@777 | 30 | class ConcurrentG1RefineThread: public ConcurrentGCThread { |
| ysr@777 | 31 | friend class VMStructs; |
| ysr@777 | 32 | friend class G1CollectedHeap; |
| ysr@777 | 33 | |
| ysr@777 | 34 | double _vtime_start; // Initial virtual time. |
| ysr@777 | 35 | double _vtime_accum; // Initial virtual time. |
| iveresov@1229 | 36 | int _worker_id; |
| iveresov@1230 | 37 | int _worker_id_offset; |
| ysr@777 | 38 | |
| iveresov@1229 | 39 | // The refinement threads collection is linked list. A predecessor can activate a successor |
| iveresov@1229 | 40 | // when the number of the rset update buffer crosses a certain threshold. A successor |
| iveresov@1229 | 41 | // would self-deactivate when the number of the buffers falls below the threshold. |
| iveresov@1229 | 42 | bool _active; |
| iveresov@1229 | 43 | ConcurrentG1RefineThread * _next; |
| ysr@777 | 44 | public: |
| ysr@777 | 45 | virtual void run(); |
| ysr@777 | 46 | |
| iveresov@1229 | 47 | bool is_active() { return _active; } |
| iveresov@1229 | 48 | void activate() { _active = true; } |
| iveresov@1229 | 49 | void deactivate() { _active = false; } |
| iveresov@1229 | 50 | |
| ysr@777 | 51 | private: |
| ysr@777 | 52 | ConcurrentG1Refine* _cg1r; |
| ysr@777 | 53 | |
| ysr@777 | 54 | COTracker _co_tracker; |
| ysr@777 | 55 | double _interval_ms; |
| ysr@777 | 56 | |
| ysr@777 | 57 | void decreaseInterval(int processing_time_ms) { |
| ysr@777 | 58 | double min_interval_ms = (double) processing_time_ms; |
| ysr@777 | 59 | _interval_ms = 0.8 * _interval_ms; |
| ysr@777 | 60 | if (_interval_ms < min_interval_ms) |
| ysr@777 | 61 | _interval_ms = min_interval_ms; |
| ysr@777 | 62 | } |
| ysr@777 | 63 | void increaseInterval(int processing_time_ms) { |
| ysr@777 | 64 | double max_interval_ms = 9.0 * (double) processing_time_ms; |
| ysr@777 | 65 | _interval_ms = 1.1 * _interval_ms; |
| ysr@777 | 66 | if (max_interval_ms > 0 && _interval_ms > max_interval_ms) |
| ysr@777 | 67 | _interval_ms = max_interval_ms; |
| ysr@777 | 68 | } |
| ysr@777 | 69 | |
| ysr@777 | 70 | void sleepBeforeNextCycle(); |
| ysr@777 | 71 | |
| ysr@777 | 72 | // For use by G1CollectedHeap, which is a friend. |
| ysr@777 | 73 | static SuspendibleThreadSet* sts() { return &_sts; } |
| ysr@777 | 74 | |
| ysr@777 | 75 | public: |
| ysr@777 | 76 | // Constructor |
| iveresov@1230 | 77 | ConcurrentG1RefineThread(ConcurrentG1Refine* cg1r, ConcurrentG1RefineThread* next, |
| iveresov@1230 | 78 | int worker_id_offset, int worker_id); |
| ysr@777 | 79 | |
| ysr@777 | 80 | // Printing |
| ysr@777 | 81 | void print(); |
| ysr@777 | 82 | |
| ysr@777 | 83 | // Total virtual time so far. |
| ysr@777 | 84 | double vtime_accum() { return _vtime_accum; } |
| ysr@777 | 85 | |
| ysr@777 | 86 | ConcurrentG1Refine* cg1r() { return _cg1r; } |
| ysr@777 | 87 | |
| ysr@777 | 88 | void sample_young_list_rs_lengths(); |
| ysr@777 | 89 | |
| ysr@777 | 90 | // Yield for GC |
| ysr@777 | 91 | void yield(); |
| ysr@777 | 92 | |
| ysr@777 | 93 | // shutdown |
| iveresov@1229 | 94 | void stop(); |
| ysr@777 | 95 | }; |
