annotate src/share/vm/gc_implementation/g1/concurrentG1Refine.hpp @ 5820:87ee5ee27509

Added tag jdk8-b132 for changeset 0c94c41dcd70
author katleman
date Tue, 04 Mar 2014 11:51:03 -0800
parents 194f52aa2f23
children
rev   line source
ysr@342 1 /*
johnc@4643 2 * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved.
ysr@342 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
ysr@342 4 *
ysr@342 5 * This code is free software; you can redistribute it and/or modify it
ysr@342 6 * under the terms of the GNU General Public License version 2 only, as
ysr@342 7 * published by the Free Software Foundation.
ysr@342 8 *
ysr@342 9 * This code is distributed in the hope that it will be useful, but WITHOUT
ysr@342 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
ysr@342 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
ysr@342 12 * version 2 for more details (a copy is included in the LICENSE file that
ysr@342 13 * accompanied this code).
ysr@342 14 *
ysr@342 15 * You should have received a copy of the GNU General Public License version
ysr@342 16 * 2 along with this work; if not, write to the Free Software Foundation,
ysr@342 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
ysr@342 18 *
trims@1472 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1472 20 * or visit www.oracle.com if you need additional information or have any
trims@1472 21 * questions.
ysr@342 22 *
ysr@342 23 */
ysr@342 24
stefank@1879 25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_CONCURRENTG1REFINE_HPP
stefank@1879 26 #define SHARE_VM_GC_IMPLEMENTATION_G1_CONCURRENTG1REFINE_HPP
stefank@1879 27
johnc@4643 28 #include "gc_implementation/g1/g1HotCardCache.hpp"
stefank@1879 29 #include "memory/allocation.hpp"
stefank@1879 30 #include "runtime/thread.hpp"
stefank@1879 31 #include "utilities/globalDefinitions.hpp"
stefank@1879 32
ysr@342 33 // Forward decl
ysr@342 34 class ConcurrentG1RefineThread;
johnc@4643 35 class G1CollectedHeap;
johnc@4643 36 class G1HotCardCache;
ysr@342 37 class G1RemSet;
tschatzl@4769 38 class DirtyCardQueue;
ysr@342 39
zgu@3465 40 class ConcurrentG1Refine: public CHeapObj<mtGC> {
iveresov@794 41 ConcurrentG1RefineThread** _threads;
iveresov@794 42 int _n_threads;
iveresov@1111 43 int _n_worker_threads;
iveresov@1111 44 /*
iveresov@1111 45 * The value of the update buffer queue length falls into one of 3 zones:
iveresov@1111 46 * green, yellow, red. If the value is in [0, green) nothing is
iveresov@1111 47 * done, the buffers are left unprocessed to enable the caching effect of the
iveresov@1111 48 * dirtied cards. In the yellow zone [green, yellow) the concurrent refinement
iveresov@1111 49 * threads are gradually activated. In [yellow, red) all threads are
iveresov@1111 50 * running. If the length becomes red (max queue length) the mutators start
iveresov@1111 51 * processing the buffers.
iveresov@1111 52 *
tonyp@1282 53 * There are some interesting cases (when G1UseAdaptiveConcRefinement
tonyp@1282 54 * is turned off):
iveresov@1111 55 * 1) green = yellow = red = 0. In this case the mutator will process all
iveresov@1111 56 * buffers. Except for those that are created by the deferred updates
iveresov@1111 57 * machinery during a collection.
iveresov@1111 58 * 2) green = 0. Means no caching. Can be a good way to minimize the
iveresov@1111 59 * amount of time spent updating rsets during a collection.
iveresov@1111 60 */
iveresov@1111 61 int _green_zone;
iveresov@1111 62 int _yellow_zone;
iveresov@1111 63 int _red_zone;
iveresov@1111 64
iveresov@1111 65 int _thread_threshold_step;
iveresov@1111 66
johnc@4643 67 // We delay the refinement of 'hot' cards using the hot card cache.
johnc@4643 68 G1HotCardCache _hot_card_cache;
johnc@4643 69
iveresov@1111 70 // Reset the threshold step value based of the current zone boundaries.
iveresov@1111 71 void reset_threshold_step();
johnc@890 72
ysr@342 73 public:
johnc@4643 74 ConcurrentG1Refine(G1CollectedHeap* g1h);
ysr@342 75 ~ConcurrentG1Refine();
ysr@342 76
ysr@342 77 void init(); // Accomplish some initialization that has to wait.
iveresov@794 78 void stop();
ysr@342 79
iveresov@1111 80 void reinitialize_threads();
iveresov@1111 81
tschatzl@4769 82 // Iterate over all concurrent refinement threads
iveresov@794 83 void threads_do(ThreadClosure *tc);
ysr@342 84
tschatzl@4769 85 // Iterate over all worker refinement threads
tschatzl@4769 86 void worker_threads_do(ThreadClosure * tc);
tschatzl@4769 87
tschatzl@4769 88 // The RS sampling thread
tschatzl@4769 89 ConcurrentG1RefineThread * sampling_thread() const;
tschatzl@4769 90
iveresov@1111 91 static int thread_num();
tonyp@1019 92
tonyp@1019 93 void print_worker_threads_on(outputStream* st) const;
iveresov@1111 94
iveresov@1111 95 void set_green_zone(int x) { _green_zone = x; }
iveresov@1111 96 void set_yellow_zone(int x) { _yellow_zone = x; }
iveresov@1111 97 void set_red_zone(int x) { _red_zone = x; }
iveresov@1111 98
iveresov@1111 99 int green_zone() const { return _green_zone; }
iveresov@1111 100 int yellow_zone() const { return _yellow_zone; }
iveresov@1111 101 int red_zone() const { return _red_zone; }
iveresov@1111 102
iveresov@1111 103 int total_thread_num() const { return _n_threads; }
iveresov@1111 104 int worker_thread_num() const { return _n_worker_threads; }
iveresov@1111 105
iveresov@1111 106 int thread_threshold_step() const { return _thread_threshold_step; }
johnc@4643 107
johnc@4643 108 G1HotCardCache* hot_card_cache() { return &_hot_card_cache; }
ysr@342 109 };
stefank@1879 110
stefank@1879 111 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_CONCURRENTG1REFINE_HPP