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

Thu, 06 Jan 2011 23:50:02 -0800

author
ysr
date
Thu, 06 Jan 2011 23:50:02 -0800
changeset 2452
4947ee68d19c
parent 2314
f95d63e2154a
child 2647
a181f3a124dd
permissions
-rw-r--r--

7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
Summary: The recorded _sweep_limit may not necessarily remain a block boundary as the old generation expands during a concurrent cycle. Terminal actions inside the sweep closure need to be aware of this as they cross over the limit.
Reviewed-by: johnc, minqi

duke@435 1 /*
ysr@2192 2 * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #ifndef SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_CONCURRENTMARKSWEEPTHREAD_HPP
stefank@2314 26 #define SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_CONCURRENTMARKSWEEPTHREAD_HPP
stefank@2314 27
stefank@2314 28 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.hpp"
stefank@2314 29 #include "gc_implementation/shared/concurrentGCThread.hpp"
stefank@2314 30 #ifdef TARGET_OS_FAMILY_linux
stefank@2314 31 # include "thread_linux.inline.hpp"
stefank@2314 32 #endif
stefank@2314 33 #ifdef TARGET_OS_FAMILY_solaris
stefank@2314 34 # include "thread_solaris.inline.hpp"
stefank@2314 35 #endif
stefank@2314 36 #ifdef TARGET_OS_FAMILY_windows
stefank@2314 37 # include "thread_windows.inline.hpp"
stefank@2314 38 #endif
stefank@2314 39
duke@435 40 class ConcurrentMarkSweepGeneration;
duke@435 41 class CMSCollector;
duke@435 42
duke@435 43 // The Concurrent Mark Sweep GC Thread (could be several in the future).
duke@435 44 class ConcurrentMarkSweepThread: public ConcurrentGCThread {
duke@435 45 friend class VMStructs;
duke@435 46 friend class ConcurrentMarkSweepGeneration; // XXX should remove friendship
duke@435 47 friend class CMSCollector;
duke@435 48 public:
duke@435 49 virtual void run();
duke@435 50
duke@435 51 private:
duke@435 52 static ConcurrentMarkSweepThread* _cmst;
duke@435 53 static CMSCollector* _collector;
duke@435 54 static SurrogateLockerThread* _slt;
duke@435 55 static SurrogateLockerThread::SLT_msg_type _sltBuffer;
duke@435 56 static Monitor* _sltMonitor;
duke@435 57
duke@435 58 ConcurrentMarkSweepThread* _next;
duke@435 59
duke@435 60 static bool _should_terminate;
duke@435 61
duke@435 62 enum CMS_flag_type {
duke@435 63 CMS_nil = NoBits,
duke@435 64 CMS_cms_wants_token = nth_bit(0),
duke@435 65 CMS_cms_has_token = nth_bit(1),
duke@435 66 CMS_vm_wants_token = nth_bit(2),
duke@435 67 CMS_vm_has_token = nth_bit(3)
duke@435 68 };
duke@435 69
duke@435 70 static int _CMS_flag;
duke@435 71
duke@435 72 static bool CMS_flag_is_set(int b) { return (_CMS_flag & b) != 0; }
duke@435 73 static bool set_CMS_flag(int b) { return (_CMS_flag |= b) != 0; }
duke@435 74 static bool clear_CMS_flag(int b) { return (_CMS_flag &= ~b) != 0; }
duke@435 75 void sleepBeforeNextCycle();
duke@435 76
duke@435 77 // CMS thread should yield for a young gen collection, direct allocation,
duke@435 78 // and iCMS activity.
duke@435 79 static char _pad_1[64 - sizeof(jint)]; // prevent cache-line sharing
duke@435 80 static volatile jint _pending_yields;
duke@435 81 static volatile jint _pending_decrements; // decrements to _pending_yields
duke@435 82 static char _pad_2[64 - sizeof(jint)]; // prevent cache-line sharing
duke@435 83
duke@435 84 // Tracing messages, enabled by CMSTraceThreadState.
duke@435 85 static inline void trace_state(const char* desc);
duke@435 86
duke@435 87 static volatile bool _icms_enabled; // iCMS enabled?
duke@435 88 static volatile bool _should_run; // iCMS may run
duke@435 89 static volatile bool _should_stop; // iCMS should stop
duke@435 90
duke@435 91 // debugging
duke@435 92 void verify_ok_to_terminate() const PRODUCT_RETURN;
duke@435 93
duke@435 94 public:
duke@435 95 // Constructor
duke@435 96 ConcurrentMarkSweepThread(CMSCollector* collector);
duke@435 97
duke@435 98 static void makeSurrogateLockerThread(TRAPS);
duke@435 99 static SurrogateLockerThread* slt() { return _slt; }
duke@435 100
duke@435 101 // Tester
duke@435 102 bool is_ConcurrentGC_thread() const { return true; }
duke@435 103
duke@435 104 static void threads_do(ThreadClosure* tc);
duke@435 105
duke@435 106 // Printing
duke@435 107 void print_on(outputStream* st) const;
duke@435 108 void print() const { print_on(tty); }
duke@435 109 static void print_all_on(outputStream* st);
duke@435 110 static void print_all() { print_all_on(tty); }
duke@435 111
duke@435 112 // Returns the CMS Thread
duke@435 113 static ConcurrentMarkSweepThread* cmst() { return _cmst; }
duke@435 114 static CMSCollector* collector() { return _collector; }
duke@435 115
duke@435 116 // Create and start the CMS Thread, or stop it on shutdown
duke@435 117 static ConcurrentMarkSweepThread* start(CMSCollector* collector);
duke@435 118 static void stop();
duke@435 119 static bool should_terminate() { return _should_terminate; }
duke@435 120
duke@435 121 // Synchronization using CMS token
duke@435 122 static void synchronize(bool is_cms_thread);
duke@435 123 static void desynchronize(bool is_cms_thread);
duke@435 124 static bool vm_thread_has_cms_token() {
duke@435 125 return CMS_flag_is_set(CMS_vm_has_token);
duke@435 126 }
duke@435 127 static bool cms_thread_has_cms_token() {
duke@435 128 return CMS_flag_is_set(CMS_cms_has_token);
duke@435 129 }
duke@435 130 static bool vm_thread_wants_cms_token() {
duke@435 131 return CMS_flag_is_set(CMS_vm_wants_token);
duke@435 132 }
duke@435 133 static bool cms_thread_wants_cms_token() {
duke@435 134 return CMS_flag_is_set(CMS_cms_wants_token);
duke@435 135 }
duke@435 136
duke@435 137 // Wait on CMS lock until the next synchronous GC
ysr@2242 138 // or given timeout, whichever is earlier. A timeout value
ysr@2242 139 // of 0 indicates that there is no upper bound on the wait time.
ysr@2242 140 // A concurrent full gc request terminates the wait.
ysr@2242 141 void wait_on_cms_lock(long t_millis);
duke@435 142
ysr@2192 143 // The CMS thread will yield during the work portion of its cycle
duke@435 144 // only when requested to. Both synchronous and asychronous requests
ysr@2192 145 // are provided:
ysr@2192 146 // (1) A synchronous request is used for young gen collections and
ysr@2192 147 // for direct allocations. The requesting thread increments
ysr@2192 148 // _pending_yields at the beginning of an operation, and decrements
ysr@2192 149 // _pending_yields when that operation is completed.
ysr@2192 150 // In turn, the CMS thread yields when _pending_yields is positive,
ysr@2192 151 // and continues to yield until the value reverts to 0.
ysr@2192 152 // (2) An asynchronous request, on the other hand, is used by iCMS
ysr@2192 153 // for the stop_icms() operation. A single yield satisfies all of
ysr@2192 154 // the outstanding asynch yield requests, of which there may
ysr@2192 155 // occasionally be several in close succession. To accomplish
ysr@2192 156 // this, an asynch-requesting thread atomically increments both
ysr@2192 157 // _pending_yields and _pending_decrements. An asynchr requesting
ysr@2192 158 // thread does not wait and "acknowledge" completion of an operation
ysr@2192 159 // and deregister the request, like the synchronous version described
ysr@2192 160 // above does. In turn, after yielding, the CMS thread decrements both
ysr@2192 161 // _pending_yields and _pending_decrements by the value seen in
ysr@2192 162 // _pending_decrements before the decrement.
ysr@2192 163 // NOTE: The above scheme is isomorphic to having two request counters,
ysr@2192 164 // one for async requests and one for sync requests, and for the CMS thread
ysr@2192 165 // to check the sum of the two counters to decide whether it should yield
ysr@2192 166 // and to clear only the async counter when it yields. However, it turns out
ysr@2192 167 // to be more efficient for CMS code to just check a single counter
ysr@2192 168 // _pending_yields that holds the sum (of both sync and async requests), and
ysr@2192 169 // a second counter _pending_decrements that only holds the async requests,
ysr@2192 170 // for greater efficiency, since in a typical CMS run, there are many more
ysr@2192 171 // pontential (i.e. static) yield points than there are actual
ysr@2192 172 // (i.e. dynamic) yields because of requests, which are few and far between.
ysr@2192 173 //
duke@435 174 // Note that, while "_pending_yields >= _pending_decrements" is an invariant,
duke@435 175 // we cannot easily test that invariant, since the counters are manipulated via
duke@435 176 // atomic instructions without explicit locking and we cannot read
duke@435 177 // the two counters atomically together: one suggestion is to
duke@435 178 // use (for example) 16-bit counters so as to be able to read the
duke@435 179 // two counters atomically even on 32-bit platforms. Notice that
ysr@2192 180 // the second assert in acknowledge_yield_request() below does indeed
duke@435 181 // check a form of the above invariant, albeit indirectly.
duke@435 182
duke@435 183 static void increment_pending_yields() {
duke@435 184 Atomic::inc(&_pending_yields);
duke@435 185 assert(_pending_yields >= 0, "can't be negative");
duke@435 186 }
duke@435 187 static void decrement_pending_yields() {
duke@435 188 Atomic::dec(&_pending_yields);
duke@435 189 assert(_pending_yields >= 0, "can't be negative");
duke@435 190 }
duke@435 191 static void asynchronous_yield_request() {
ysr@2192 192 assert(CMSIncrementalMode, "Currently only used w/iCMS");
duke@435 193 increment_pending_yields();
duke@435 194 Atomic::inc(&_pending_decrements);
duke@435 195 assert(_pending_decrements >= 0, "can't be negative");
duke@435 196 }
duke@435 197 static void acknowledge_yield_request() {
duke@435 198 jint decrement = _pending_decrements;
duke@435 199 if (decrement > 0) {
ysr@2192 200 assert(CMSIncrementalMode, "Currently only used w/iCMS");
duke@435 201 // Order important to preserve: _pending_yields >= _pending_decrements
duke@435 202 Atomic::add(-decrement, &_pending_decrements);
duke@435 203 Atomic::add(-decrement, &_pending_yields);
duke@435 204 assert(_pending_decrements >= 0, "can't be negative");
duke@435 205 assert(_pending_yields >= 0, "can't be negative");
duke@435 206 }
duke@435 207 }
duke@435 208 static bool should_yield() { return _pending_yields > 0; }
duke@435 209
duke@435 210 // CMS incremental mode.
duke@435 211 static void start_icms(); // notify thread to start a quantum of work
duke@435 212 static void stop_icms(); // request thread to stop working
duke@435 213 void icms_wait(); // if asked to stop, wait until notified to start
duke@435 214
duke@435 215 // Incremental mode is enabled globally by the flag CMSIncrementalMode. It
duke@435 216 // must also be enabled/disabled dynamically to allow foreground collections.
duke@435 217 static inline void enable_icms() { _icms_enabled = true; }
duke@435 218 static inline void disable_icms() { _icms_enabled = false; }
duke@435 219 static inline void set_icms_enabled(bool val) { _icms_enabled = val; }
duke@435 220 static inline bool icms_enabled() { return _icms_enabled; }
duke@435 221 };
duke@435 222
duke@435 223 inline void ConcurrentMarkSweepThread::trace_state(const char* desc) {
duke@435 224 if (CMSTraceThreadState) {
duke@435 225 char buf[128];
duke@435 226 TimeStamp& ts = gclog_or_tty->time_stamp();
duke@435 227 if (!ts.is_updated()) {
duke@435 228 ts.update();
duke@435 229 }
duke@435 230 jio_snprintf(buf, sizeof(buf), " [%.3f: CMSThread %s] ",
duke@435 231 ts.seconds(), desc);
duke@435 232 buf[sizeof(buf) - 1] = '\0';
duke@435 233 gclog_or_tty->print(buf);
duke@435 234 }
duke@435 235 }
duke@435 236
ysr@2192 237 // For scoped increment/decrement of (synchronous) yield requests
duke@435 238 class CMSSynchronousYieldRequest: public StackObj {
duke@435 239 public:
duke@435 240 CMSSynchronousYieldRequest() {
duke@435 241 ConcurrentMarkSweepThread::increment_pending_yields();
duke@435 242 }
duke@435 243 ~CMSSynchronousYieldRequest() {
duke@435 244 ConcurrentMarkSweepThread::decrement_pending_yields();
duke@435 245 }
duke@435 246 };
duke@435 247
duke@435 248 // Used to emit a warning in case of unexpectedly excessive
duke@435 249 // looping (in "apparently endless loops") in CMS code.
duke@435 250 class CMSLoopCountWarn: public StackObj {
duke@435 251 private:
duke@435 252 const char* _src;
duke@435 253 const char* _msg;
duke@435 254 const intx _threshold;
duke@435 255 intx _ticks;
duke@435 256
duke@435 257 public:
duke@435 258 inline CMSLoopCountWarn(const char* src, const char* msg,
duke@435 259 const intx threshold) :
duke@435 260 _src(src), _msg(msg), _threshold(threshold), _ticks(0) { }
duke@435 261
duke@435 262 inline void tick() {
duke@435 263 _ticks++;
duke@435 264 if (CMSLoopWarn && _ticks % _threshold == 0) {
duke@435 265 warning("%s has looped %d times %s", _src, _ticks, _msg);
duke@435 266 }
duke@435 267 }
duke@435 268 };
stefank@2314 269
stefank@2314 270 #endif // SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_CONCURRENTMARKSWEEPTHREAD_HPP

mercurial