Wed, 02 Feb 2011 11:35:26 -0500
7016023: Enable building ARM and PPC from src/closed repository
Reviewed-by: dholmes, bdelsart
duke@435 | 1 | /* |
jmasa@2188 | 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 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "memory/allocation.hpp" |
stefank@2314 | 27 | #include "memory/allocation.inline.hpp" |
stefank@2314 | 28 | #include "runtime/os.hpp" |
stefank@2314 | 29 | #include "utilities/workgroup.hpp" |
duke@435 | 30 | |
duke@435 | 31 | // Definitions of WorkGang methods. |
duke@435 | 32 | |
duke@435 | 33 | AbstractWorkGang::AbstractWorkGang(const char* name, |
ysr@777 | 34 | bool are_GC_task_threads, |
ysr@777 | 35 | bool are_ConcurrentGC_threads) : |
duke@435 | 36 | _name(name), |
ysr@777 | 37 | _are_GC_task_threads(are_GC_task_threads), |
ysr@777 | 38 | _are_ConcurrentGC_threads(are_ConcurrentGC_threads) { |
ysr@777 | 39 | |
ysr@777 | 40 | assert(!(are_GC_task_threads && are_ConcurrentGC_threads), |
ysr@777 | 41 | "They cannot both be STW GC and Concurrent threads" ); |
ysr@777 | 42 | |
duke@435 | 43 | // Other initialization. |
duke@435 | 44 | _monitor = new Monitor(/* priority */ Mutex::leaf, |
duke@435 | 45 | /* name */ "WorkGroup monitor", |
ysr@777 | 46 | /* allow_vm_block */ are_GC_task_threads); |
duke@435 | 47 | assert(monitor() != NULL, "Failed to allocate monitor"); |
duke@435 | 48 | _terminate = false; |
duke@435 | 49 | _task = NULL; |
duke@435 | 50 | _sequence_number = 0; |
duke@435 | 51 | _started_workers = 0; |
duke@435 | 52 | _finished_workers = 0; |
duke@435 | 53 | } |
duke@435 | 54 | |
duke@435 | 55 | WorkGang::WorkGang(const char* name, |
ysr@777 | 56 | int workers, |
ysr@777 | 57 | bool are_GC_task_threads, |
ysr@777 | 58 | bool are_ConcurrentGC_threads) : |
jmasa@2188 | 59 | AbstractWorkGang(name, are_GC_task_threads, are_ConcurrentGC_threads) { |
duke@435 | 60 | // Save arguments. |
duke@435 | 61 | _total_workers = workers; |
jmasa@2188 | 62 | } |
jmasa@2188 | 63 | |
jmasa@2188 | 64 | GangWorker* WorkGang::allocate_worker(int which) { |
jmasa@2188 | 65 | GangWorker* new_worker = new GangWorker(this, which); |
jmasa@2188 | 66 | return new_worker; |
jmasa@2188 | 67 | } |
jmasa@2188 | 68 | |
jmasa@2188 | 69 | // The current implementation will exit if the allocation |
jmasa@2188 | 70 | // of any worker fails. Still, return a boolean so that |
jmasa@2188 | 71 | // a future implementation can possibly do a partial |
jmasa@2188 | 72 | // initialization of the workers and report such to the |
jmasa@2188 | 73 | // caller. |
jmasa@2188 | 74 | bool WorkGang::initialize_workers() { |
ysr@777 | 75 | |
duke@435 | 76 | if (TraceWorkGang) { |
jmasa@2188 | 77 | tty->print_cr("Constructing work gang %s with %d threads", |
jmasa@2188 | 78 | name(), |
jmasa@2188 | 79 | total_workers()); |
duke@435 | 80 | } |
jmasa@2188 | 81 | _gang_workers = NEW_C_HEAP_ARRAY(GangWorker*, total_workers()); |
ysr@777 | 82 | if (gang_workers() == NULL) { |
ysr@777 | 83 | vm_exit_out_of_memory(0, "Cannot create GangWorker array."); |
jmasa@2188 | 84 | return false; |
jmasa@2188 | 85 | } |
jmasa@2188 | 86 | os::ThreadType worker_type; |
jmasa@2188 | 87 | if (are_ConcurrentGC_threads()) { |
jmasa@2188 | 88 | worker_type = os::cgc_thread; |
jmasa@2188 | 89 | } else { |
jmasa@2188 | 90 | worker_type = os::pgc_thread; |
ysr@777 | 91 | } |
duke@435 | 92 | for (int worker = 0; worker < total_workers(); worker += 1) { |
jmasa@2188 | 93 | GangWorker* new_worker = allocate_worker(worker); |
duke@435 | 94 | assert(new_worker != NULL, "Failed to allocate GangWorker"); |
duke@435 | 95 | _gang_workers[worker] = new_worker; |
jmasa@2188 | 96 | if (new_worker == NULL || !os::create_thread(new_worker, worker_type)) { |
duke@435 | 97 | vm_exit_out_of_memory(0, "Cannot create worker GC thread. Out of system resources."); |
jmasa@2188 | 98 | return false; |
jmasa@2188 | 99 | } |
duke@435 | 100 | if (!DisableStartThread) { |
duke@435 | 101 | os::start_thread(new_worker); |
duke@435 | 102 | } |
duke@435 | 103 | } |
jmasa@2188 | 104 | return true; |
duke@435 | 105 | } |
duke@435 | 106 | |
duke@435 | 107 | AbstractWorkGang::~AbstractWorkGang() { |
duke@435 | 108 | if (TraceWorkGang) { |
duke@435 | 109 | tty->print_cr("Destructing work gang %s", name()); |
duke@435 | 110 | } |
duke@435 | 111 | stop(); // stop all the workers |
duke@435 | 112 | for (int worker = 0; worker < total_workers(); worker += 1) { |
duke@435 | 113 | delete gang_worker(worker); |
duke@435 | 114 | } |
duke@435 | 115 | delete gang_workers(); |
duke@435 | 116 | delete monitor(); |
duke@435 | 117 | } |
duke@435 | 118 | |
duke@435 | 119 | GangWorker* AbstractWorkGang::gang_worker(int i) const { |
duke@435 | 120 | // Array index bounds checking. |
duke@435 | 121 | GangWorker* result = NULL; |
duke@435 | 122 | assert(gang_workers() != NULL, "No workers for indexing"); |
duke@435 | 123 | assert(((i >= 0) && (i < total_workers())), "Worker index out of bounds"); |
duke@435 | 124 | result = _gang_workers[i]; |
duke@435 | 125 | assert(result != NULL, "Indexing to null worker"); |
duke@435 | 126 | return result; |
duke@435 | 127 | } |
duke@435 | 128 | |
duke@435 | 129 | void WorkGang::run_task(AbstractGangTask* task) { |
duke@435 | 130 | // This thread is executed by the VM thread which does not block |
duke@435 | 131 | // on ordinary MutexLocker's. |
duke@435 | 132 | MutexLockerEx ml(monitor(), Mutex::_no_safepoint_check_flag); |
duke@435 | 133 | if (TraceWorkGang) { |
duke@435 | 134 | tty->print_cr("Running work gang %s task %s", name(), task->name()); |
duke@435 | 135 | } |
duke@435 | 136 | // Tell all the workers to run a task. |
duke@435 | 137 | assert(task != NULL, "Running a null task"); |
duke@435 | 138 | // Initialize. |
duke@435 | 139 | _task = task; |
duke@435 | 140 | _sequence_number += 1; |
duke@435 | 141 | _started_workers = 0; |
duke@435 | 142 | _finished_workers = 0; |
duke@435 | 143 | // Tell the workers to get to work. |
duke@435 | 144 | monitor()->notify_all(); |
duke@435 | 145 | // Wait for them to be finished |
duke@435 | 146 | while (finished_workers() < total_workers()) { |
duke@435 | 147 | if (TraceWorkGang) { |
duke@435 | 148 | tty->print_cr("Waiting in work gang %s: %d/%d finished sequence %d", |
duke@435 | 149 | name(), finished_workers(), total_workers(), |
duke@435 | 150 | _sequence_number); |
duke@435 | 151 | } |
duke@435 | 152 | monitor()->wait(/* no_safepoint_check */ true); |
duke@435 | 153 | } |
duke@435 | 154 | _task = NULL; |
duke@435 | 155 | if (TraceWorkGang) { |
duke@435 | 156 | tty->print_cr("/nFinished work gang %s: %d/%d sequence %d", |
duke@435 | 157 | name(), finished_workers(), total_workers(), |
duke@435 | 158 | _sequence_number); |
duke@435 | 159 | } |
duke@435 | 160 | } |
duke@435 | 161 | |
duke@435 | 162 | void AbstractWorkGang::stop() { |
duke@435 | 163 | // Tell all workers to terminate, then wait for them to become inactive. |
duke@435 | 164 | MutexLockerEx ml(monitor(), Mutex::_no_safepoint_check_flag); |
duke@435 | 165 | if (TraceWorkGang) { |
duke@435 | 166 | tty->print_cr("Stopping work gang %s task %s", name(), task()->name()); |
duke@435 | 167 | } |
duke@435 | 168 | _task = NULL; |
duke@435 | 169 | _terminate = true; |
duke@435 | 170 | monitor()->notify_all(); |
duke@435 | 171 | while (finished_workers() < total_workers()) { |
duke@435 | 172 | if (TraceWorkGang) { |
duke@435 | 173 | tty->print_cr("Waiting in work gang %s: %d/%d finished", |
duke@435 | 174 | name(), finished_workers(), total_workers()); |
duke@435 | 175 | } |
duke@435 | 176 | monitor()->wait(/* no_safepoint_check */ true); |
duke@435 | 177 | } |
duke@435 | 178 | } |
duke@435 | 179 | |
duke@435 | 180 | void AbstractWorkGang::internal_worker_poll(WorkData* data) const { |
duke@435 | 181 | assert(monitor()->owned_by_self(), "worker_poll is an internal method"); |
duke@435 | 182 | assert(data != NULL, "worker data is null"); |
duke@435 | 183 | data->set_terminate(terminate()); |
duke@435 | 184 | data->set_task(task()); |
duke@435 | 185 | data->set_sequence_number(sequence_number()); |
duke@435 | 186 | } |
duke@435 | 187 | |
duke@435 | 188 | void AbstractWorkGang::internal_note_start() { |
duke@435 | 189 | assert(monitor()->owned_by_self(), "note_finish is an internal method"); |
duke@435 | 190 | _started_workers += 1; |
duke@435 | 191 | } |
duke@435 | 192 | |
duke@435 | 193 | void AbstractWorkGang::internal_note_finish() { |
duke@435 | 194 | assert(monitor()->owned_by_self(), "note_finish is an internal method"); |
duke@435 | 195 | _finished_workers += 1; |
duke@435 | 196 | } |
duke@435 | 197 | |
duke@435 | 198 | void AbstractWorkGang::print_worker_threads_on(outputStream* st) const { |
duke@435 | 199 | uint num_thr = total_workers(); |
duke@435 | 200 | for (uint i = 0; i < num_thr; i++) { |
duke@435 | 201 | gang_worker(i)->print_on(st); |
duke@435 | 202 | st->cr(); |
duke@435 | 203 | } |
duke@435 | 204 | } |
duke@435 | 205 | |
duke@435 | 206 | void AbstractWorkGang::threads_do(ThreadClosure* tc) const { |
duke@435 | 207 | assert(tc != NULL, "Null ThreadClosure"); |
duke@435 | 208 | uint num_thr = total_workers(); |
duke@435 | 209 | for (uint i = 0; i < num_thr; i++) { |
duke@435 | 210 | tc->do_thread(gang_worker(i)); |
duke@435 | 211 | } |
duke@435 | 212 | } |
duke@435 | 213 | |
duke@435 | 214 | // GangWorker methods. |
duke@435 | 215 | |
duke@435 | 216 | GangWorker::GangWorker(AbstractWorkGang* gang, uint id) { |
duke@435 | 217 | _gang = gang; |
duke@435 | 218 | set_id(id); |
duke@435 | 219 | set_name("Gang worker#%d (%s)", id, gang->name()); |
duke@435 | 220 | } |
duke@435 | 221 | |
duke@435 | 222 | void GangWorker::run() { |
duke@435 | 223 | initialize(); |
duke@435 | 224 | loop(); |
duke@435 | 225 | } |
duke@435 | 226 | |
duke@435 | 227 | void GangWorker::initialize() { |
duke@435 | 228 | this->initialize_thread_local_storage(); |
duke@435 | 229 | assert(_gang != NULL, "No gang to run in"); |
duke@435 | 230 | os::set_priority(this, NearMaxPriority); |
duke@435 | 231 | if (TraceWorkGang) { |
duke@435 | 232 | tty->print_cr("Running gang worker for gang %s id %d", |
duke@435 | 233 | gang()->name(), id()); |
duke@435 | 234 | } |
duke@435 | 235 | // The VM thread should not execute here because MutexLocker's are used |
duke@435 | 236 | // as (opposed to MutexLockerEx's). |
duke@435 | 237 | assert(!Thread::current()->is_VM_thread(), "VM thread should not be part" |
duke@435 | 238 | " of a work gang"); |
duke@435 | 239 | } |
duke@435 | 240 | |
duke@435 | 241 | void GangWorker::loop() { |
duke@435 | 242 | int previous_sequence_number = 0; |
duke@435 | 243 | Monitor* gang_monitor = gang()->monitor(); |
duke@435 | 244 | for ( ; /* !terminate() */; ) { |
duke@435 | 245 | WorkData data; |
duke@435 | 246 | int part; // Initialized below. |
duke@435 | 247 | { |
duke@435 | 248 | // Grab the gang mutex. |
duke@435 | 249 | MutexLocker ml(gang_monitor); |
duke@435 | 250 | // Wait for something to do. |
duke@435 | 251 | // Polling outside the while { wait } avoids missed notifies |
duke@435 | 252 | // in the outer loop. |
duke@435 | 253 | gang()->internal_worker_poll(&data); |
duke@435 | 254 | if (TraceWorkGang) { |
duke@435 | 255 | tty->print("Polled outside for work in gang %s worker %d", |
duke@435 | 256 | gang()->name(), id()); |
duke@435 | 257 | tty->print(" terminate: %s", |
duke@435 | 258 | data.terminate() ? "true" : "false"); |
duke@435 | 259 | tty->print(" sequence: %d (prev: %d)", |
duke@435 | 260 | data.sequence_number(), previous_sequence_number); |
duke@435 | 261 | if (data.task() != NULL) { |
duke@435 | 262 | tty->print(" task: %s", data.task()->name()); |
duke@435 | 263 | } else { |
duke@435 | 264 | tty->print(" task: NULL"); |
duke@435 | 265 | } |
duke@435 | 266 | tty->cr(); |
duke@435 | 267 | } |
duke@435 | 268 | for ( ; /* break or return */; ) { |
duke@435 | 269 | // Terminate if requested. |
duke@435 | 270 | if (data.terminate()) { |
duke@435 | 271 | gang()->internal_note_finish(); |
duke@435 | 272 | gang_monitor->notify_all(); |
duke@435 | 273 | return; |
duke@435 | 274 | } |
duke@435 | 275 | // Check for new work. |
duke@435 | 276 | if ((data.task() != NULL) && |
duke@435 | 277 | (data.sequence_number() != previous_sequence_number)) { |
duke@435 | 278 | gang()->internal_note_start(); |
duke@435 | 279 | gang_monitor->notify_all(); |
duke@435 | 280 | part = gang()->started_workers() - 1; |
duke@435 | 281 | break; |
duke@435 | 282 | } |
duke@435 | 283 | // Nothing to do. |
duke@435 | 284 | gang_monitor->wait(/* no_safepoint_check */ true); |
duke@435 | 285 | gang()->internal_worker_poll(&data); |
duke@435 | 286 | if (TraceWorkGang) { |
duke@435 | 287 | tty->print("Polled inside for work in gang %s worker %d", |
duke@435 | 288 | gang()->name(), id()); |
duke@435 | 289 | tty->print(" terminate: %s", |
duke@435 | 290 | data.terminate() ? "true" : "false"); |
duke@435 | 291 | tty->print(" sequence: %d (prev: %d)", |
duke@435 | 292 | data.sequence_number(), previous_sequence_number); |
duke@435 | 293 | if (data.task() != NULL) { |
duke@435 | 294 | tty->print(" task: %s", data.task()->name()); |
duke@435 | 295 | } else { |
duke@435 | 296 | tty->print(" task: NULL"); |
duke@435 | 297 | } |
duke@435 | 298 | tty->cr(); |
duke@435 | 299 | } |
duke@435 | 300 | } |
duke@435 | 301 | // Drop gang mutex. |
duke@435 | 302 | } |
duke@435 | 303 | if (TraceWorkGang) { |
duke@435 | 304 | tty->print("Work for work gang %s id %d task %s part %d", |
duke@435 | 305 | gang()->name(), id(), data.task()->name(), part); |
duke@435 | 306 | } |
duke@435 | 307 | assert(data.task() != NULL, "Got null task"); |
duke@435 | 308 | data.task()->work(part); |
duke@435 | 309 | { |
duke@435 | 310 | if (TraceWorkGang) { |
duke@435 | 311 | tty->print("Finish for work gang %s id %d task %s part %d", |
duke@435 | 312 | gang()->name(), id(), data.task()->name(), part); |
duke@435 | 313 | } |
duke@435 | 314 | // Grab the gang mutex. |
duke@435 | 315 | MutexLocker ml(gang_monitor); |
duke@435 | 316 | gang()->internal_note_finish(); |
duke@435 | 317 | // Tell the gang you are done. |
duke@435 | 318 | gang_monitor->notify_all(); |
duke@435 | 319 | // Drop the gang mutex. |
duke@435 | 320 | } |
duke@435 | 321 | previous_sequence_number = data.sequence_number(); |
duke@435 | 322 | } |
duke@435 | 323 | } |
duke@435 | 324 | |
duke@435 | 325 | bool GangWorker::is_GC_task_thread() const { |
ysr@777 | 326 | return gang()->are_GC_task_threads(); |
ysr@777 | 327 | } |
ysr@777 | 328 | |
ysr@777 | 329 | bool GangWorker::is_ConcurrentGC_thread() const { |
ysr@777 | 330 | return gang()->are_ConcurrentGC_threads(); |
duke@435 | 331 | } |
duke@435 | 332 | |
duke@435 | 333 | void GangWorker::print_on(outputStream* st) const { |
duke@435 | 334 | st->print("\"%s\" ", name()); |
duke@435 | 335 | Thread::print_on(st); |
duke@435 | 336 | st->cr(); |
duke@435 | 337 | } |
duke@435 | 338 | |
duke@435 | 339 | // Printing methods |
duke@435 | 340 | |
duke@435 | 341 | const char* AbstractWorkGang::name() const { |
duke@435 | 342 | return _name; |
duke@435 | 343 | } |
duke@435 | 344 | |
duke@435 | 345 | #ifndef PRODUCT |
duke@435 | 346 | |
duke@435 | 347 | const char* AbstractGangTask::name() const { |
duke@435 | 348 | return _name; |
duke@435 | 349 | } |
duke@435 | 350 | |
duke@435 | 351 | #endif /* PRODUCT */ |
duke@435 | 352 | |
duke@435 | 353 | // *** WorkGangBarrierSync |
duke@435 | 354 | |
duke@435 | 355 | WorkGangBarrierSync::WorkGangBarrierSync() |
duke@435 | 356 | : _monitor(Mutex::safepoint, "work gang barrier sync", true), |
ysr@777 | 357 | _n_workers(0), _n_completed(0), _should_reset(false) { |
duke@435 | 358 | } |
duke@435 | 359 | |
duke@435 | 360 | WorkGangBarrierSync::WorkGangBarrierSync(int n_workers, const char* name) |
duke@435 | 361 | : _monitor(Mutex::safepoint, name, true), |
ysr@777 | 362 | _n_workers(n_workers), _n_completed(0), _should_reset(false) { |
duke@435 | 363 | } |
duke@435 | 364 | |
duke@435 | 365 | void WorkGangBarrierSync::set_n_workers(int n_workers) { |
duke@435 | 366 | _n_workers = n_workers; |
duke@435 | 367 | _n_completed = 0; |
ysr@777 | 368 | _should_reset = false; |
duke@435 | 369 | } |
duke@435 | 370 | |
duke@435 | 371 | void WorkGangBarrierSync::enter() { |
duke@435 | 372 | MutexLockerEx x(monitor(), Mutex::_no_safepoint_check_flag); |
ysr@777 | 373 | if (should_reset()) { |
ysr@777 | 374 | // The should_reset() was set and we are the first worker to enter |
ysr@777 | 375 | // the sync barrier. We will zero the n_completed() count which |
ysr@777 | 376 | // effectively resets the barrier. |
ysr@777 | 377 | zero_completed(); |
ysr@777 | 378 | set_should_reset(false); |
ysr@777 | 379 | } |
duke@435 | 380 | inc_completed(); |
duke@435 | 381 | if (n_completed() == n_workers()) { |
ysr@777 | 382 | // At this point we would like to reset the barrier to be ready in |
ysr@777 | 383 | // case it is used again. However, we cannot set n_completed() to |
ysr@777 | 384 | // 0, even after the notify_all(), given that some other workers |
ysr@777 | 385 | // might still be waiting for n_completed() to become == |
ysr@777 | 386 | // n_workers(). So, if we set n_completed() to 0, those workers |
ysr@777 | 387 | // will get stuck (as they will wake up, see that n_completed() != |
ysr@777 | 388 | // n_workers() and go back to sleep). Instead, we raise the |
ysr@777 | 389 | // should_reset() flag and the barrier will be reset the first |
ysr@777 | 390 | // time a worker enters it again. |
ysr@777 | 391 | set_should_reset(true); |
duke@435 | 392 | monitor()->notify_all(); |
ysr@777 | 393 | } else { |
duke@435 | 394 | while (n_completed() != n_workers()) { |
duke@435 | 395 | monitor()->wait(/* no_safepoint_check */ true); |
duke@435 | 396 | } |
duke@435 | 397 | } |
duke@435 | 398 | } |
duke@435 | 399 | |
duke@435 | 400 | // SubTasksDone functions. |
duke@435 | 401 | |
duke@435 | 402 | SubTasksDone::SubTasksDone(int n) : |
duke@435 | 403 | _n_tasks(n), _n_threads(1), _tasks(NULL) { |
duke@435 | 404 | _tasks = NEW_C_HEAP_ARRAY(jint, n); |
duke@435 | 405 | guarantee(_tasks != NULL, "alloc failure"); |
duke@435 | 406 | clear(); |
duke@435 | 407 | } |
duke@435 | 408 | |
duke@435 | 409 | bool SubTasksDone::valid() { |
duke@435 | 410 | return _tasks != NULL; |
duke@435 | 411 | } |
duke@435 | 412 | |
jmasa@2188 | 413 | void SubTasksDone::set_n_threads(int t) { |
duke@435 | 414 | #ifdef ASSERT |
duke@435 | 415 | assert(_claimed == 0 || _threads_completed == _n_threads, |
duke@435 | 416 | "should not be called while tasks are being processed!"); |
duke@435 | 417 | #endif |
duke@435 | 418 | _n_threads = (t == 0 ? 1 : t); |
duke@435 | 419 | } |
duke@435 | 420 | |
duke@435 | 421 | void SubTasksDone::clear() { |
duke@435 | 422 | for (int i = 0; i < _n_tasks; i++) { |
duke@435 | 423 | _tasks[i] = 0; |
duke@435 | 424 | } |
duke@435 | 425 | _threads_completed = 0; |
duke@435 | 426 | #ifdef ASSERT |
duke@435 | 427 | _claimed = 0; |
duke@435 | 428 | #endif |
duke@435 | 429 | } |
duke@435 | 430 | |
duke@435 | 431 | bool SubTasksDone::is_task_claimed(int t) { |
duke@435 | 432 | assert(0 <= t && t < _n_tasks, "bad task id."); |
duke@435 | 433 | jint old = _tasks[t]; |
duke@435 | 434 | if (old == 0) { |
duke@435 | 435 | old = Atomic::cmpxchg(1, &_tasks[t], 0); |
duke@435 | 436 | } |
duke@435 | 437 | assert(_tasks[t] == 1, "What else?"); |
duke@435 | 438 | bool res = old != 0; |
duke@435 | 439 | #ifdef ASSERT |
duke@435 | 440 | if (!res) { |
duke@435 | 441 | assert(_claimed < _n_tasks, "Too many tasks claimed; missing clear?"); |
duke@435 | 442 | Atomic::inc(&_claimed); |
duke@435 | 443 | } |
duke@435 | 444 | #endif |
duke@435 | 445 | return res; |
duke@435 | 446 | } |
duke@435 | 447 | |
duke@435 | 448 | void SubTasksDone::all_tasks_completed() { |
duke@435 | 449 | jint observed = _threads_completed; |
duke@435 | 450 | jint old; |
duke@435 | 451 | do { |
duke@435 | 452 | old = observed; |
duke@435 | 453 | observed = Atomic::cmpxchg(old+1, &_threads_completed, old); |
duke@435 | 454 | } while (observed != old); |
duke@435 | 455 | // If this was the last thread checking in, clear the tasks. |
duke@435 | 456 | if (observed+1 == _n_threads) clear(); |
duke@435 | 457 | } |
duke@435 | 458 | |
duke@435 | 459 | |
duke@435 | 460 | SubTasksDone::~SubTasksDone() { |
duke@435 | 461 | if (_tasks != NULL) FREE_C_HEAP_ARRAY(jint, _tasks); |
duke@435 | 462 | } |
duke@435 | 463 | |
duke@435 | 464 | // *** SequentialSubTasksDone |
duke@435 | 465 | |
duke@435 | 466 | void SequentialSubTasksDone::clear() { |
duke@435 | 467 | _n_tasks = _n_claimed = 0; |
duke@435 | 468 | _n_threads = _n_completed = 0; |
duke@435 | 469 | } |
duke@435 | 470 | |
duke@435 | 471 | bool SequentialSubTasksDone::valid() { |
duke@435 | 472 | return _n_threads > 0; |
duke@435 | 473 | } |
duke@435 | 474 | |
duke@435 | 475 | bool SequentialSubTasksDone::is_task_claimed(int& t) { |
duke@435 | 476 | jint* n_claimed_ptr = &_n_claimed; |
duke@435 | 477 | t = *n_claimed_ptr; |
duke@435 | 478 | while (t < _n_tasks) { |
duke@435 | 479 | jint res = Atomic::cmpxchg(t+1, n_claimed_ptr, t); |
duke@435 | 480 | if (res == t) { |
duke@435 | 481 | return false; |
duke@435 | 482 | } |
duke@435 | 483 | t = *n_claimed_ptr; |
duke@435 | 484 | } |
duke@435 | 485 | return true; |
duke@435 | 486 | } |
duke@435 | 487 | |
duke@435 | 488 | bool SequentialSubTasksDone::all_tasks_completed() { |
duke@435 | 489 | jint* n_completed_ptr = &_n_completed; |
duke@435 | 490 | jint complete = *n_completed_ptr; |
duke@435 | 491 | while (true) { |
duke@435 | 492 | jint res = Atomic::cmpxchg(complete+1, n_completed_ptr, complete); |
duke@435 | 493 | if (res == complete) { |
duke@435 | 494 | break; |
duke@435 | 495 | } |
duke@435 | 496 | complete = res; |
duke@435 | 497 | } |
duke@435 | 498 | if (complete+1 == _n_threads) { |
duke@435 | 499 | clear(); |
duke@435 | 500 | return true; |
duke@435 | 501 | } |
duke@435 | 502 | return false; |
duke@435 | 503 | } |
ysr@777 | 504 | |
ysr@777 | 505 | bool FreeIdSet::_stat_init = false; |
ysr@777 | 506 | FreeIdSet* FreeIdSet::_sets[NSets]; |
ysr@777 | 507 | bool FreeIdSet::_safepoint; |
ysr@777 | 508 | |
ysr@777 | 509 | FreeIdSet::FreeIdSet(int sz, Monitor* mon) : |
ysr@777 | 510 | _sz(sz), _mon(mon), _hd(0), _waiters(0), _index(-1), _claimed(0) |
ysr@777 | 511 | { |
ysr@777 | 512 | _ids = new int[sz]; |
ysr@777 | 513 | for (int i = 0; i < sz; i++) _ids[i] = i+1; |
ysr@777 | 514 | _ids[sz-1] = end_of_list; // end of list. |
ysr@777 | 515 | if (_stat_init) { |
ysr@777 | 516 | for (int j = 0; j < NSets; j++) _sets[j] = NULL; |
ysr@777 | 517 | _stat_init = true; |
ysr@777 | 518 | } |
ysr@777 | 519 | // Add to sets. (This should happen while the system is still single-threaded.) |
ysr@777 | 520 | for (int j = 0; j < NSets; j++) { |
ysr@777 | 521 | if (_sets[j] == NULL) { |
ysr@777 | 522 | _sets[j] = this; |
ysr@777 | 523 | _index = j; |
ysr@777 | 524 | break; |
ysr@777 | 525 | } |
ysr@777 | 526 | } |
ysr@777 | 527 | guarantee(_index != -1, "Too many FreeIdSets in use!"); |
ysr@777 | 528 | } |
ysr@777 | 529 | |
ysr@777 | 530 | FreeIdSet::~FreeIdSet() { |
ysr@777 | 531 | _sets[_index] = NULL; |
ysr@777 | 532 | } |
ysr@777 | 533 | |
ysr@777 | 534 | void FreeIdSet::set_safepoint(bool b) { |
ysr@777 | 535 | _safepoint = b; |
ysr@777 | 536 | if (b) { |
ysr@777 | 537 | for (int j = 0; j < NSets; j++) { |
ysr@777 | 538 | if (_sets[j] != NULL && _sets[j]->_waiters > 0) { |
ysr@777 | 539 | Monitor* mon = _sets[j]->_mon; |
ysr@777 | 540 | mon->lock_without_safepoint_check(); |
ysr@777 | 541 | mon->notify_all(); |
ysr@777 | 542 | mon->unlock(); |
ysr@777 | 543 | } |
ysr@777 | 544 | } |
ysr@777 | 545 | } |
ysr@777 | 546 | } |
ysr@777 | 547 | |
ysr@777 | 548 | #define FID_STATS 0 |
ysr@777 | 549 | |
ysr@777 | 550 | int FreeIdSet::claim_par_id() { |
ysr@777 | 551 | #if FID_STATS |
ysr@777 | 552 | thread_t tslf = thr_self(); |
ysr@777 | 553 | tty->print("claim_par_id[%d]: sz = %d, claimed = %d\n", tslf, _sz, _claimed); |
ysr@777 | 554 | #endif |
ysr@777 | 555 | MutexLockerEx x(_mon, Mutex::_no_safepoint_check_flag); |
ysr@777 | 556 | while (!_safepoint && _hd == end_of_list) { |
ysr@777 | 557 | _waiters++; |
ysr@777 | 558 | #if FID_STATS |
ysr@777 | 559 | if (_waiters > 5) { |
ysr@777 | 560 | tty->print("claim_par_id waiting[%d]: %d waiters, %d claimed.\n", |
ysr@777 | 561 | tslf, _waiters, _claimed); |
ysr@777 | 562 | } |
ysr@777 | 563 | #endif |
ysr@777 | 564 | _mon->wait(Mutex::_no_safepoint_check_flag); |
ysr@777 | 565 | _waiters--; |
ysr@777 | 566 | } |
ysr@777 | 567 | if (_hd == end_of_list) { |
ysr@777 | 568 | #if FID_STATS |
ysr@777 | 569 | tty->print("claim_par_id[%d]: returning EOL.\n", tslf); |
ysr@777 | 570 | #endif |
ysr@777 | 571 | return -1; |
ysr@777 | 572 | } else { |
ysr@777 | 573 | int res = _hd; |
ysr@777 | 574 | _hd = _ids[res]; |
ysr@777 | 575 | _ids[res] = claimed; // For debugging. |
ysr@777 | 576 | _claimed++; |
ysr@777 | 577 | #if FID_STATS |
ysr@777 | 578 | tty->print("claim_par_id[%d]: returning %d, claimed = %d.\n", |
ysr@777 | 579 | tslf, res, _claimed); |
ysr@777 | 580 | #endif |
ysr@777 | 581 | return res; |
ysr@777 | 582 | } |
ysr@777 | 583 | } |
ysr@777 | 584 | |
ysr@777 | 585 | bool FreeIdSet::claim_perm_id(int i) { |
ysr@777 | 586 | assert(0 <= i && i < _sz, "Out of range."); |
ysr@777 | 587 | MutexLockerEx x(_mon, Mutex::_no_safepoint_check_flag); |
ysr@777 | 588 | int prev = end_of_list; |
ysr@777 | 589 | int cur = _hd; |
ysr@777 | 590 | while (cur != end_of_list) { |
ysr@777 | 591 | if (cur == i) { |
ysr@777 | 592 | if (prev == end_of_list) { |
ysr@777 | 593 | _hd = _ids[cur]; |
ysr@777 | 594 | } else { |
ysr@777 | 595 | _ids[prev] = _ids[cur]; |
ysr@777 | 596 | } |
ysr@777 | 597 | _ids[cur] = claimed; |
ysr@777 | 598 | _claimed++; |
ysr@777 | 599 | return true; |
ysr@777 | 600 | } else { |
ysr@777 | 601 | prev = cur; |
ysr@777 | 602 | cur = _ids[cur]; |
ysr@777 | 603 | } |
ysr@777 | 604 | } |
ysr@777 | 605 | return false; |
ysr@777 | 606 | |
ysr@777 | 607 | } |
ysr@777 | 608 | |
ysr@777 | 609 | void FreeIdSet::release_par_id(int id) { |
ysr@777 | 610 | MutexLockerEx x(_mon, Mutex::_no_safepoint_check_flag); |
ysr@777 | 611 | assert(_ids[id] == claimed, "Precondition."); |
ysr@777 | 612 | _ids[id] = _hd; |
ysr@777 | 613 | _hd = id; |
ysr@777 | 614 | _claimed--; |
ysr@777 | 615 | #if FID_STATS |
ysr@777 | 616 | tty->print("[%d] release_par_id(%d), waiters =%d, claimed = %d.\n", |
ysr@777 | 617 | thr_self(), id, _waiters, _claimed); |
ysr@777 | 618 | #endif |
ysr@777 | 619 | if (_waiters > 0) |
ysr@777 | 620 | // Notify all would be safer, but this is OK, right? |
ysr@777 | 621 | _mon->notify_all(); |
ysr@777 | 622 | } |