rts/Capability.c

   1 /* ---------------------------------------------------------------------------
   2  *
   3  * (c) The GHC Team, 2003-2006
   4  *
   5  * Capabilities
   6  *
   7  * A Capability represent the token required to execute STG code,
   8  * and all the state an OS thread/task needs to run Haskell code:
   9  * its STG registers, a pointer to its TSO, a nursery etc. During
  10  * STG execution, a pointer to the capabilitity is kept in a
  11  * register (BaseReg; actually it is a pointer to cap->r).
  12  *
  13  * Only in an THREADED_RTS build will there be multiple capabilities,
  14  * for non-threaded builds there is only one global capability, namely
  15  * MainCapability.
  16  *
  17  * --------------------------------------------------------------------------*/
  18
  19 #include "PosixSource.h"
  20 #include "Rts.h"
  21
  22 #include "Capability.h"
  23 #include "Schedule.h"
  24 #include "Sparks.h"
  25 #include "Trace.h"
  26 #include "sm/GC.h" // for gcWorkerThread()
  27 #include "STM.h"
  28 #include "RtsUtils.h"
  29
  30 // one global capability, this is the Capability for non-threaded
  31 // builds, and for +RTS -N1
  32 Capability MainCapability;
  33
  34 nat n_capabilities = 0;
  35 Capability *capabilities = NULL;
  36
  37 // Holds the Capability which last became free.  This is used so that
  38 // an in-call has a chance of quickly finding a free Capability.
  39 // Maintaining a global free list of Capabilities would require global
  40 // locking, so we don't do that.
  41 Capability *last_free_capability = NULL;
  42
  43 /* GC indicator, in scope for the scheduler, init'ed to false */
  44 volatile StgWord waiting_for_gc = 0;
  45
  46 /* Let foreign code get the current Capability -- assuming there is one!
  47  * This is useful for unsafe foreign calls because they are called with
  48  * the current Capability held, but they are not passed it. For example,
  49  * see see the integer-gmp package which calls allocateLocal() in its
  50  * stgAllocForGMP() function (which gets called by gmp functions).
  51  * */
  52 Capability * rts_unsafeGetMyCapability (void)
  53 {
  54 #if defined(THREADED_RTS)
  55   return myTask()->cap;
  56 #else
  57   return &MainCapability;
  58 #endif
  59 }
  60
  61 #if defined(THREADED_RTS)
  62 STATIC_INLINE rtsBool
  63 globalWorkToDo (void)
  64 {
  65     return blackholes_need_checking
  66         || sched_state >= SCHED_INTERRUPTING
  67         ;
  68 }
  69 #endif
  70
  71 #if defined(THREADED_RTS)
  72 StgClosure *
  73 findSpark (Capability *cap)
  74 {
  75   Capability *robbed;
  76   StgClosurePtr spark;
  77   rtsBool retry;
  78   nat i = 0;
  79
  80   if (!emptyRunQueue(cap) || cap->returning_tasks_hd != NULL) {
  81       // If there are other threads, don't try to run any new
  82       // sparks: sparks might be speculative, we don't want to take
  83       // resources away from the main computation.
  84       return 0;
  85   }
  86
  87   do {
  88       retry = rtsFalse;
  89
  90       // first try to get a spark from our own pool.
  91       // We should be using reclaimSpark(), because it works without
  92       // needing any atomic instructions:
  93       //   spark = reclaimSpark(cap->sparks);
  94       // However, measurements show that this makes at least one benchmark
  95       // slower (prsa) and doesn't affect the others.
  96       spark = tryStealSpark(cap);
  97       if (spark != NULL) {
  98           cap->sparks_converted++;
  99
 100           // Post event for running a spark from capability's own pool.
 101           traceEventRunSpark(cap, cap->r.rCurrentTSO);
 102
 103           return spark;
 104       }
 105       if (!emptySparkPoolCap(cap)) {
 106           retry = rtsTrue;
 107       }
 108
 109       if (n_capabilities == 1) { return NULL; } // makes no sense...
 110
 111       debugTrace(DEBUG_sched,
 112                  "cap %d: Trying to steal work from other capabilities",
 113                  cap->no);
 114
 115       /* visit cap.s 0..n-1 in sequence until a theft succeeds. We could
 116       start at a random place instead of 0 as well.  */
 117       for ( i=0 ; i < n_capabilities ; i++ ) {
 118           robbed = &capabilities[i];
 119           if (cap == robbed)  // ourselves...
 120               continue;
 121
 122           if (emptySparkPoolCap(robbed)) // nothing to steal here
 123               continue;
 124
 125           spark = tryStealSpark(robbed);
 126           if (spark == NULL && !emptySparkPoolCap(robbed)) {
 127               // we conflicted with another thread while trying to steal;
 128               // try again later.
 129               retry = rtsTrue;
 130           }
 131
 132           if (spark != NULL) {
 133               cap->sparks_converted++;
 134
 135               traceEventStealSpark(cap, cap->r.rCurrentTSO, robbed->no);
 136
 137               return spark;
 138           }
 139           // otherwise: no success, try next one
 140       }
 141   } while (retry);
 142
 143   debugTrace(DEBUG_sched, "No sparks stolen");
 144   return NULL;
 145 }
 146
 147 // Returns True if any spark pool is non-empty at this moment in time
 148 // The result is only valid for an instant, of course, so in a sense
 149 // is immediately invalid, and should not be relied upon for
 150 // correctness.
 151 rtsBool
 152 anySparks (void)
 153 {
 154     nat i;
 155
 156     for (i=0; i < n_capabilities; i++) {
 157         if (!emptySparkPoolCap(&capabilities[i])) {
 158             return rtsTrue;
 159         }
 160     }
 161     return rtsFalse;
 162 }
 163 #endif
 164
 165 /* -----------------------------------------------------------------------------
 166  * Manage the returning_tasks lists.
 167  *
 168  * These functions require cap->lock
 169  * -------------------------------------------------------------------------- */
 170
 171 #if defined(THREADED_RTS)
 172 STATIC_INLINE void
 173 newReturningTask (Capability *cap, Task *task)
 174 {
 175     ASSERT_LOCK_HELD(&cap->lock);
 176     ASSERT(task->next == NULL);
 177     if (cap->returning_tasks_hd) {
 178         ASSERT(cap->returning_tasks_tl->next == NULL);
 179         cap->returning_tasks_tl->next = task;
 180     } else {
 181         cap->returning_tasks_hd = task;
 182     }
 183     cap->returning_tasks_tl = task;
 184 }
 185
 186 STATIC_INLINE Task *
 187 popReturningTask (Capability *cap)
 188 {
 189     ASSERT_LOCK_HELD(&cap->lock);
 190     Task *task;
 191     task = cap->returning_tasks_hd;
 192     ASSERT(task);
 193     cap->returning_tasks_hd = task->next;
 194     if (!cap->returning_tasks_hd) {
 195         cap->returning_tasks_tl = NULL;
 196     }
 197     task->next = NULL;
 198     return task;
 199 }
 200 #endif
 201
 202 /* ----------------------------------------------------------------------------
 203  * Initialisation
 204  *
 205  * The Capability is initially marked not free.
 206  * ------------------------------------------------------------------------- */
 207
 208 static void
 209 initCapability( Capability *cap, nat i )
 210 {
 211     nat g;
 212
 213     cap->no = i;
 214     cap->in_haskell        = rtsFalse;
 215
 216     cap->run_queue_hd      = END_TSO_QUEUE;
 217     cap->run_queue_tl      = END_TSO_QUEUE;
 218
 219 #if defined(THREADED_RTS)
 220     initMutex(&cap->lock);
 221     cap->running_task      = NULL; // indicates cap is free
 222     cap->spare_workers     = NULL;
 223     cap->suspended_ccalls  = NULL;
 224     cap->returning_tasks_hd = NULL;
 225     cap->returning_tasks_tl = NULL;
 226     cap->wakeup_queue_hd    = END_TSO_QUEUE;
 227     cap->wakeup_queue_tl    = END_TSO_QUEUE;
 228     cap->sparks_created     = 0;
 229     cap->sparks_converted   = 0;
 230     cap->sparks_pruned      = 0;
 231 #endif
 232
 233     cap->f.stgEagerBlackholeInfo = (W_)&__stg_EAGER_BLACKHOLE_info;
 234     cap->f.stgGCEnter1     = (StgFunPtr)__stg_gc_enter_1;
 235     cap->f.stgGCFun        = (StgFunPtr)__stg_gc_fun;
 236
 237     cap->mut_lists  = stgMallocBytes(sizeof(bdescr *) *
 238                                      RtsFlags.GcFlags.generations,
 239                                      "initCapability");
 240     cap->saved_mut_lists = stgMallocBytes(sizeof(bdescr *) *
 241                                           RtsFlags.GcFlags.generations,
 242                                           "initCapability");
 243
 244     for (g = 0; g < RtsFlags.GcFlags.generations; g++) {
 245         cap->mut_lists[g] = NULL;
 246     }
 247
 248     cap->free_tvar_watch_queues = END_STM_WATCH_QUEUE;
 249     cap->free_invariant_check_queues = END_INVARIANT_CHECK_QUEUE;
 250     cap->free_trec_chunks = END_STM_CHUNK_LIST;
 251     cap->free_trec_headers = NO_TREC;
 252     cap->transaction_tokens = 0;
 253     cap->context_switch = 0;
 254     cap->pinned_object_block = NULL;
 255 }
 256
 257 /* ---------------------------------------------------------------------------
 258  * Function:  initCapabilities()
 259  *
 260  * Purpose:   set up the Capability handling. For the THREADED_RTS build,
 261  *            we keep a table of them, the size of which is
 262  *            controlled by the user via the RTS flag -N.
 263  *
 264  * ------------------------------------------------------------------------- */
 265 void
 266 initCapabilities( void )
 267 {
 268 #if defined(THREADED_RTS)
 269     nat i;
 270
 271 #ifndef REG_Base
 272     // We can't support multiple CPUs if BaseReg is not a register
 273     if (RtsFlags.ParFlags.nNodes > 1) {
 274         errorBelch("warning: multiple CPUs not supported in this build, reverting to 1");
 275         RtsFlags.ParFlags.nNodes = 1;
 276     }
 277 #endif
 278
 279     n_capabilities = RtsFlags.ParFlags.nNodes;
 280
 281     if (n_capabilities == 1) {
 282         capabilities = &MainCapability;
 283         // THREADED_RTS must work on builds that don't have a mutable
 284         // BaseReg (eg. unregisterised), so in this case
 285         // capabilities[0] must coincide with &MainCapability.
 286     } else {
 287         capabilities = stgMallocBytes(n_capabilities * sizeof(Capability),
 288                                       "initCapabilities");
 289     }
 290
 291     for (i = 0; i < n_capabilities; i++) {
 292         initCapability(&capabilities[i], i);
 293     }
 294
 295     debugTrace(DEBUG_sched, "allocated %d capabilities", n_capabilities);
 296
 297 #else /* !THREADED_RTS */
 298
 299     n_capabilities = 1;
 300     capabilities = &MainCapability;
 301     initCapability(&MainCapability, 0);
 302
 303 #endif
 304
 305     // There are no free capabilities to begin with.  We will start
 306     // a worker Task to each Capability, which will quickly put the
 307     // Capability on the free list when it finds nothing to do.
 308     last_free_capability = &capabilities[0];
 309 }
 310
 311 /* ----------------------------------------------------------------------------
 312  * setContextSwitches: cause all capabilities to context switch as
 313  * soon as possible.
 314  * ------------------------------------------------------------------------- */
 315
 316 void setContextSwitches(void)
 317 {
 318     nat i;
 319     for (i=0; i < n_capabilities; i++) {
 320         contextSwitchCapability(&capabilities[i]);
 321     }
 322 }
 323
 324 /* ----------------------------------------------------------------------------
 325  * Give a Capability to a Task.  The task must currently be sleeping
 326  * on its condition variable.
 327  *
 328  * Requires cap->lock (modifies cap->running_task).
 329  *
 330  * When migrating a Task, the migrater must take task->lock before
 331  * modifying task->cap, to synchronise with the waking up Task.
 332  * Additionally, the migrater should own the Capability (when
 333  * migrating the run queue), or cap->lock (when migrating
 334  * returning_workers).
 335  *
 336  * ------------------------------------------------------------------------- */
 337
 338 #if defined(THREADED_RTS)
 339 STATIC_INLINE void
 340 giveCapabilityToTask (Capability *cap USED_IF_DEBUG, Task *task)
 341 {
 342     ASSERT_LOCK_HELD(&cap->lock);
 343     ASSERT(task->cap == cap);
 344     debugTrace(DEBUG_sched, "passing capability %d to %s %p",
 345                cap->no, task->incall->tso ? "bound task" : "worker",
 346                (void *)task->id);
 347     ACQUIRE_LOCK(&task->lock);
 348     task->wakeup = rtsTrue;
 349     // the wakeup flag is needed because signalCondition() doesn't
 350     // flag the condition if the thread is already runniing, but we want
 351     // it to be sticky.
 352     signalCondition(&task->cond);
 353     RELEASE_LOCK(&task->lock);
 354 }
 355 #endif
 356
 357 /* ----------------------------------------------------------------------------
 358  * Function:  releaseCapability(Capability*)
 359  *
 360  * Purpose:   Letting go of a capability. Causes a
 361  *            'returning worker' thread or a 'waiting worker'
 362  *            to wake up, in that order.
 363  * ------------------------------------------------------------------------- */
 364
 365 #if defined(THREADED_RTS)
 366 void
 367 releaseCapability_ (Capability* cap,
 368                     rtsBool always_wakeup)
 369 {
 370     Task *task;
 371
 372     task = cap->running_task;
 373
 374     ASSERT_PARTIAL_CAPABILITY_INVARIANTS(cap,task);
 375
 376     cap->running_task = NULL;
 377
 378     // Check to see whether a worker thread can be given
 379     // the go-ahead to return the result of an external call..
 380     if (cap->returning_tasks_hd != NULL) {
 381         giveCapabilityToTask(cap,cap->returning_tasks_hd);
 382         // The Task pops itself from the queue (see waitForReturnCapability())
 383         return;
 384     }
 385
 386     if (waiting_for_gc == PENDING_GC_SEQ) {
 387       last_free_capability = cap; // needed?
 388       debugTrace(DEBUG_sched, "GC pending, set capability %d free", cap->no);
 389       return;
 390     }
 391
 392
 393     // If the next thread on the run queue is a bound thread,
 394     // give this Capability to the appropriate Task.
 395     if (!emptyRunQueue(cap) && cap->run_queue_hd->bound) {
 396         // Make sure we're not about to try to wake ourselves up
 397         // ASSERT(task != cap->run_queue_hd->bound);
 398         // assertion is false: in schedule() we force a yield after
 399         // ThreadBlocked, but the thread may be back on the run queue
 400         // by now.
 401         task = cap->run_queue_hd->bound->task;
 402         giveCapabilityToTask(cap,task);
 403         return;
 404     }
 405
 406     if (!cap->spare_workers) {
 407         // Create a worker thread if we don't have one.  If the system
 408         // is interrupted, we only create a worker task if there
 409         // are threads that need to be completed.  If the system is
 410         // shutting down, we never create a new worker.
 411         if (sched_state < SCHED_SHUTTING_DOWN || !emptyRunQueue(cap)) {
 412             debugTrace(DEBUG_sched,
 413                        "starting new worker on capability %d", cap->no);
 414             startWorkerTask(cap);
 415             return;
 416         }
 417     }
 418
 419     // If we have an unbound thread on the run queue, or if there's
 420     // anything else to do, give the Capability to a worker thread.
 421     if (always_wakeup ||
 422         !emptyRunQueue(cap) || !emptyWakeupQueue(cap) ||
 423         !emptySparkPoolCap(cap) || globalWorkToDo()) {
 424         if (cap->spare_workers) {
 425             giveCapabilityToTask(cap,cap->spare_workers);
 426             // The worker Task pops itself from the queue;
 427             return;
 428         }
 429     }
 430
 431     last_free_capability = cap;
 432     debugTrace(DEBUG_sched, "freeing capability %d", cap->no);
 433 }
 434
 435 void
 436 releaseCapability (Capability* cap USED_IF_THREADS)
 437 {
 438     ACQUIRE_LOCK(&cap->lock);
 439     releaseCapability_(cap, rtsFalse);
 440     RELEASE_LOCK(&cap->lock);
 441 }
 442
 443 void
 444 releaseAndWakeupCapability (Capability* cap USED_IF_THREADS)
 445 {
 446     ACQUIRE_LOCK(&cap->lock);
 447     releaseCapability_(cap, rtsTrue);
 448     RELEASE_LOCK(&cap->lock);
 449 }
 450
 451 static void
 452 releaseCapabilityAndQueueWorker (Capability* cap USED_IF_THREADS)
 453 {
 454     Task *task;
 455
 456     ACQUIRE_LOCK(&cap->lock);
 457
 458     task = cap->running_task;
 459
 460     // If the current task is a worker, save it on the spare_workers
 461     // list of this Capability.  A worker can mark itself as stopped,
 462     // in which case it is not replaced on the spare_worker queue.
 463     // This happens when the system is shutting down (see
 464     // Schedule.c:workerStart()).
 465     if (!isBoundTask(task) && !task->stopped) {
 466         task->next = cap->spare_workers;
 467         cap->spare_workers = task;
 468     }
 469     // Bound tasks just float around attached to their TSOs.
 470
 471     releaseCapability_(cap,rtsFalse);
 472
 473     RELEASE_LOCK(&cap->lock);
 474 }
 475 #endif
 476
 477 /* ----------------------------------------------------------------------------
 478  * waitForReturnCapability( Task *task )
 479  *
 480  * Purpose:  when an OS thread returns from an external call,
 481  * it calls waitForReturnCapability() (via Schedule.resumeThread())
 482  * to wait for permission to enter the RTS & communicate the
 483  * result of the external call back to the Haskell thread that
 484  * made it.
 485  *
 486  * ------------------------------------------------------------------------- */
 487 void
 488 waitForReturnCapability (Capability **pCap, Task *task)
 489 {
 490 #if !defined(THREADED_RTS)
 491
 492     MainCapability.running_task = task;
 493     task->cap = &MainCapability;
 494     *pCap = &MainCapability;
 495
 496 #else
 497     Capability *cap = *pCap;
 498
 499     if (cap == NULL) {
 500         // Try last_free_capability first
 501         cap = last_free_capability;
 502         if (cap->running_task) {
 503             nat i;
 504             // otherwise, search for a free capability
 505             cap = NULL;
 506             for (i = 0; i < n_capabilities; i++) {
 507                 if (!capabilities[i].running_task) {
 508                     cap = &capabilities[i];
 509                     break;
 510                 }
 511             }
 512             if (cap == NULL) {
 513                 // Can't find a free one, use last_free_capability.
 514                 cap = last_free_capability;
 515             }
 516         }
 517
 518         // record the Capability as the one this Task is now assocated with.
 519         task->cap = cap;
 520
 521     } else {
 522         ASSERT(task->cap == cap);
 523     }
 524
 525     ACQUIRE_LOCK(&cap->lock);
 526
 527     debugTrace(DEBUG_sched, "returning; I want capability %d", cap->no);
 528
 529     if (!cap->running_task) {
 530         // It's free; just grab it
 531         cap->running_task = task;
 532         RELEASE_LOCK(&cap->lock);
 533     } else {
 534         newReturningTask(cap,task);
 535         RELEASE_LOCK(&cap->lock);
 536
 537         for (;;) {
 538             ACQUIRE_LOCK(&task->lock);
 539             // task->lock held, cap->lock not held
 540             if (!task->wakeup) waitCondition(&task->cond, &task->lock);
 541             cap = task->cap;
 542             task->wakeup = rtsFalse;
 543             RELEASE_LOCK(&task->lock);
 544
 545             // now check whether we should wake up...
 546             ACQUIRE_LOCK(&cap->lock);
 547             if (cap->running_task == NULL) {
 548                 if (cap->returning_tasks_hd != task) {
 549                     giveCapabilityToTask(cap,cap->returning_tasks_hd);
 550                     RELEASE_LOCK(&cap->lock);
 551                     continue;
 552                 }
 553                 cap->running_task = task;
 554                 popReturningTask(cap);
 555                 RELEASE_LOCK(&cap->lock);
 556                 break;
 557             }
 558             RELEASE_LOCK(&cap->lock);
 559         }
 560
 561     }
 562
 563     ASSERT_FULL_CAPABILITY_INVARIANTS(cap,task);
 564
 565     debugTrace(DEBUG_sched, "resuming capability %d", cap->no);
 566
 567     *pCap = cap;
 568 #endif
 569 }
 570
 571 #if defined(THREADED_RTS)
 572 /* ----------------------------------------------------------------------------
 573  * yieldCapability
 574  * ------------------------------------------------------------------------- */
 575
 576 void
 577 yieldCapability (Capability** pCap, Task *task)
 578 {
 579     Capability *cap = *pCap;
 580
 581     if (waiting_for_gc == PENDING_GC_PAR) {
 582         traceEventGcStart(cap);
 583         gcWorkerThread(cap);
 584         traceEventGcEnd(cap);
 585         return;
 586     }
 587
 588         debugTrace(DEBUG_sched, "giving up capability %d", cap->no);
 589
 590         // We must now release the capability and wait to be woken up
 591         // again.
 592         task->wakeup = rtsFalse;
 593         releaseCapabilityAndQueueWorker(cap);
 594
 595         for (;;) {
 596             ACQUIRE_LOCK(&task->lock);
 597             // task->lock held, cap->lock not held
 598             if (!task->wakeup) waitCondition(&task->cond, &task->lock);
 599             cap = task->cap;
 600             task->wakeup = rtsFalse;
 601             RELEASE_LOCK(&task->lock);
 602
 603             debugTrace(DEBUG_sched, "woken up on capability %d", cap->no);
 604
 605             ACQUIRE_LOCK(&cap->lock);
 606             if (cap->running_task != NULL) {
 607                 debugTrace(DEBUG_sched,
 608                            "capability %d is owned by another task", cap->no);
 609                 RELEASE_LOCK(&cap->lock);
 610                 continue;
 611             }
 612
 613             if (task->incall->tso == NULL) {
 614                 ASSERT(cap->spare_workers != NULL);
 615                 // if we're not at the front of the queue, release it
 616                 // again.  This is unlikely to happen.
 617                 if (cap->spare_workers != task) {
 618                     giveCapabilityToTask(cap,cap->spare_workers);
 619                     RELEASE_LOCK(&cap->lock);
 620                     continue;
 621                 }
 622                 cap->spare_workers = task->next;
 623                 task->next = NULL;
 624             }
 625             cap->running_task = task;
 626             RELEASE_LOCK(&cap->lock);
 627             break;
 628         }
 629
 630         debugTrace(DEBUG_sched, "resuming capability %d", cap->no);
 631         ASSERT(cap->running_task == task);
 632
 633     *pCap = cap;
 634
 635     ASSERT_FULL_CAPABILITY_INVARIANTS(cap,task);
 636
 637     return;
 638 }
 639
 640 /* ----------------------------------------------------------------------------
 641  * Wake up a thread on a Capability.
 642  *
 643  * This is used when the current Task is running on a Capability and
 644  * wishes to wake up a thread on a different Capability.
 645  * ------------------------------------------------------------------------- */
 646
 647 void
 648 wakeupThreadOnCapability (Capability *my_cap,
 649                           Capability *other_cap,
 650                           StgTSO *tso)
 651 {
 652     ACQUIRE_LOCK(&other_cap->lock);
 653
 654     // ASSUMES: cap->lock is held (asserted in wakeupThreadOnCapability)
 655     if (tso->bound) {
 656         ASSERT(tso->bound->task->cap == tso->cap);
 657         tso->bound->task->cap = other_cap;
 658     }
 659     tso->cap = other_cap;
 660
 661     ASSERT(tso->bound ? tso->bound->task->cap == other_cap : 1);
 662
 663     if (other_cap->running_task == NULL) {
 664         // nobody is running this Capability, we can add our thread
 665         // directly onto the run queue and start up a Task to run it.
 666
 667         other_cap->running_task = myTask();
 668             // precond for releaseCapability_() and appendToRunQueue()
 669
 670         appendToRunQueue(other_cap,tso);
 671
 672         releaseCapability_(other_cap,rtsFalse);
 673     } else {
 674         appendToWakeupQueue(my_cap,other_cap,tso);
 675         other_cap->context_switch = 1;
 676         // someone is running on this Capability, so it cannot be
 677         // freed without first checking the wakeup queue (see
 678         // releaseCapability_).
 679     }
 680
 681     RELEASE_LOCK(&other_cap->lock);
 682 }
 683
 684 /* ----------------------------------------------------------------------------
 685  * prodCapability
 686  *
 687  * If a Capability is currently idle, wake up a Task on it.  Used to
 688  * get every Capability into the GC.
 689  * ------------------------------------------------------------------------- */
 690
 691 void
 692 prodCapability (Capability *cap, Task *task)
 693 {
 694     ACQUIRE_LOCK(&cap->lock);
 695     if (!cap->running_task) {
 696         cap->running_task = task;
 697         releaseCapability_(cap,rtsTrue);
 698     }
 699     RELEASE_LOCK(&cap->lock);
 700 }
 701
 702 /* ----------------------------------------------------------------------------
 703  * shutdownCapability
 704  *
 705  * At shutdown time, we want to let everything exit as cleanly as
 706  * possible.  For each capability, we let its run queue drain, and
 707  * allow the workers to stop.
 708  *
 709  * This function should be called when interrupted and
 710  * shutting_down_scheduler = rtsTrue, thus any worker that wakes up
 711  * will exit the scheduler and call taskStop(), and any bound thread
 712  * that wakes up will return to its caller.  Runnable threads are
 713  * killed.
 714  *
 715  * ------------------------------------------------------------------------- */
 716
 717 void
 718 shutdownCapability (Capability *cap, Task *task, rtsBool safe)
 719 {
 720     nat i;
 721
 722     task->cap = cap;
 723
 724     // Loop indefinitely until all the workers have exited and there
 725     // are no Haskell threads left.  We used to bail out after 50
 726     // iterations of this loop, but that occasionally left a worker
 727     // running which caused problems later (the closeMutex() below
 728     // isn't safe, for one thing).
 729
 730     for (i = 0; /* i < 50 */; i++) {
 731         ASSERT(sched_state == SCHED_SHUTTING_DOWN);
 732
 733         debugTrace(DEBUG_sched,
 734                    "shutting down capability %d, attempt %d", cap->no, i);
 735         ACQUIRE_LOCK(&cap->lock);
 736         if (cap->running_task) {
 737             RELEASE_LOCK(&cap->lock);
 738             debugTrace(DEBUG_sched, "not owner, yielding");
 739             yieldThread();
 740             continue;
 741         }
 742         cap->running_task = task;
 743
 744         if (cap->spare_workers) {
 745             // Look for workers that have died without removing
 746             // themselves from the list; this could happen if the OS
 747             // summarily killed the thread, for example.  This
 748             // actually happens on Windows when the system is
 749             // terminating the program, and the RTS is running in a
 750             // DLL.
 751             Task *t, *prev;
 752             prev = NULL;
 753             for (t = cap->spare_workers; t != NULL; t = t->next) {
 754                 if (!osThreadIsAlive(t->id)) {
 755                     debugTrace(DEBUG_sched,
 756                                "worker thread %p has died unexpectedly", (void *)t->id);
 757                         if (!prev) {
 758                             cap->spare_workers = t->next;
 759                         } else {
 760                             prev->next = t->next;
 761                         }
 762                         prev = t;
 763                 }
 764             }
 765         }
 766
 767         if (!emptyRunQueue(cap) || cap->spare_workers) {
 768             debugTrace(DEBUG_sched,
 769                        "runnable threads or workers still alive, yielding");
 770             releaseCapability_(cap,rtsFalse); // this will wake up a worker
 771             RELEASE_LOCK(&cap->lock);
 772             yieldThread();
 773             continue;
 774         }
 775
 776         // If "safe", then busy-wait for any threads currently doing
 777         // foreign calls.  If we're about to unload this DLL, for
 778         // example, we need to be sure that there are no OS threads
 779         // that will try to return to code that has been unloaded.
 780         // We can be a bit more relaxed when this is a standalone
 781         // program that is about to terminate, and let safe=false.
 782         if (cap->suspended_ccalls && safe) {
 783             debugTrace(DEBUG_sched,
 784                        "thread(s) are involved in foreign calls, yielding");
 785             cap->running_task = NULL;
 786             RELEASE_LOCK(&cap->lock);
 787             // The IO manager thread might have been slow to start up,
 788             // so the first attempt to kill it might not have
 789             // succeeded.  Just in case, try again - the kill message
 790             // will only be sent once.
 791             //
 792             // To reproduce this deadlock: run ffi002(threaded1)
 793             // repeatedly on a loaded machine.
 794             ioManagerDie();
 795             yieldThread();
 796             continue;
 797         }
 798
 799         traceEventShutdown(cap);
 800         RELEASE_LOCK(&cap->lock);
 801         break;
 802     }
 803     // we now have the Capability, its run queue and spare workers
 804     // list are both empty.
 805
 806     // ToDo: we can't drop this mutex, because there might still be
 807     // threads performing foreign calls that will eventually try to
 808     // return via resumeThread() and attempt to grab cap->lock.
 809     // closeMutex(&cap->lock);
 810 }
 811
 812 /* ----------------------------------------------------------------------------
 813  * tryGrabCapability
 814  *
 815  * Attempt to gain control of a Capability if it is free.
 816  *
 817  * ------------------------------------------------------------------------- */
 818
 819 rtsBool
 820 tryGrabCapability (Capability *cap, Task *task)
 821 {
 822     if (cap->running_task != NULL) return rtsFalse;
 823     ACQUIRE_LOCK(&cap->lock);
 824     if (cap->running_task != NULL) {
 825         RELEASE_LOCK(&cap->lock);
 826         return rtsFalse;
 827     }
 828     task->cap = cap;
 829     cap->running_task = task;
 830     RELEASE_LOCK(&cap->lock);
 831     return rtsTrue;
 832 }
 833
 834
 835 #endif /* THREADED_RTS */
 836
 837 static void
 838 freeCapability (Capability *cap)
 839 {
 840     stgFree(cap->mut_lists);
 841     stgFree(cap->saved_mut_lists);
 842 #if defined(THREADED_RTS)
 843     freeSparkPool(cap->sparks);
 844 #endif
 845 }
 846
 847 void
 848 freeCapabilities (void)
 849 {
 850 #if defined(THREADED_RTS)
 851     nat i;
 852     for (i=0; i < n_capabilities; i++) {
 853         freeCapability(&capabilities[i]);
 854     }
 855 #else
 856     freeCapability(&MainCapability);
 857 #endif
 858 }
 859
 860 /* ---------------------------------------------------------------------------
 861    Mark everything directly reachable from the Capabilities.  When
 862    using multiple GC threads, each GC thread marks all Capabilities
 863    for which (c `mod` n == 0), for Capability c and thread n.
 864    ------------------------------------------------------------------------ */
 865
 866 void
 867 markSomeCapabilities (evac_fn evac, void *user, nat i0, nat delta,
 868                       rtsBool prune_sparks USED_IF_THREADS)
 869 {
 870     nat i;
 871     Capability *cap;
 872     InCall *incall;
 873
 874     // Each GC thread is responsible for following roots from the
 875     // Capability of the same number.  There will usually be the same
 876     // or fewer Capabilities as GC threads, but just in case there
 877     // are more, we mark every Capability whose number is the GC
 878     // thread's index plus a multiple of the number of GC threads.
 879     for (i = i0; i < n_capabilities; i += delta) {
 880         cap = &capabilities[i];
 881         evac(user, (StgClosure **)(void *)&cap->run_queue_hd);
 882         evac(user, (StgClosure **)(void *)&cap->run_queue_tl);
 883 #if defined(THREADED_RTS)
 884         evac(user, (StgClosure **)(void *)&cap->wakeup_queue_hd);
 885         evac(user, (StgClosure **)(void *)&cap->wakeup_queue_tl);
 886 #endif
 887         for (incall = cap->suspended_ccalls; incall != NULL;
 888              incall=incall->next) {
 889             evac(user, (StgClosure **)(void *)&incall->suspended_tso);
 890         }
 891
 892 #if defined(THREADED_RTS)
 893         if (prune_sparks) {
 894             pruneSparkQueue (evac, user, cap);
 895         } else {
 896             traverseSparkQueue (evac, user, cap);
 897         }
 898 #endif
 899     }
 900
 901 #if !defined(THREADED_RTS)
 902     evac(user, (StgClosure **)(void *)&blocked_queue_hd);
 903     evac(user, (StgClosure **)(void *)&blocked_queue_tl);
 904     evac(user, (StgClosure **)(void *)&sleeping_queue);
 905 #endif
 906 }
 907
 908 void
 909 markCapabilities (evac_fn evac, void *user)
 910 {
 911     markSomeCapabilities(evac, user, 0, 1, rtsFalse);
 912 }