X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Frts%2FSchedule.c;h=ef5b539fa75368c43c086165e5189957aa63dbcb;hb=2edb47935ae6e86c1e55efba9f2fa0ddf69dcd6f;hp=fb6749a48e6282e3af593cf8a79972908beba161;hpb=c6ff5639cde8f7ffd005b5d89449adcfa90a5c01;p=ghc-hetmet.git diff --git a/ghc/rts/Schedule.c b/ghc/rts/Schedule.c index fb6749a..ef5b539 100644 --- a/ghc/rts/Schedule.c +++ b/ghc/rts/Schedule.c @@ -1,11 +1,18 @@ -/* ----------------------------------------------------------------------------- - * $Id: Schedule.c,v 1.29 1999/11/02 17:19:16 simonmar Exp $ +/* --------------------------------------------------------------------------- + * $Id: Schedule.c,v 1.47 2000/02/29 14:38:19 simonmar Exp $ * * (c) The GHC Team, 1998-1999 * * Scheduler * - * ---------------------------------------------------------------------------*/ + * The main scheduling code in GranSim is quite different from that in std + * (concurrent) Haskell: while concurrent Haskell just iterates over the + * threads in the runnable queue, GranSim is event driven, i.e. it iterates + * over the events in the global event queue. -- HWL + * --------------------------------------------------------------------------*/ + +//@node Main scheduling code, , , +//@section Main scheduling code /* Version with scheduler monitor support for SMPs. @@ -27,6 +34,23 @@ SDM & KH, 10/99 */ +//@menu +//* Includes:: +//* Variables and Data structures:: +//* Prototypes:: +//* Main scheduling loop:: +//* Suspend and Resume:: +//* Run queue code:: +//* Garbage Collextion Routines:: +//* Blocking Queue Routines:: +//* Exception Handling Routines:: +//* Debugging Routines:: +//* Index:: +//@end menu + +//@node Includes, Variables and Data structures, Main scheduling code, Main scheduling code +//@subsection Includes + #include "Rts.h" #include "SchedAPI.h" #include "RtsUtils.h" @@ -40,12 +64,28 @@ #include "StgMiscClosures.h" #include "Storage.h" #include "Evaluator.h" +#include "Exception.h" #include "Printer.h" #include "Main.h" #include "Signals.h" #include "Profiling.h" #include "Sanity.h" #include "Stats.h" +#include "Sparks.h" +#if defined(GRAN) || defined(PAR) +# include "GranSimRts.h" +# include "GranSim.h" +# include "ParallelRts.h" +# include "Parallel.h" +# include "ParallelDebug.h" +# include "FetchMe.h" +# include "HLC.h" +#endif + +#include + +//@node Variables and Data structures, Prototypes, Includes, Main scheduling code +//@subsection Variables and Data structures /* Main threads: * @@ -61,6 +101,7 @@ * * Main threads information is kept in a linked list: */ +//@cindex StgMainThread typedef struct StgMainThread_ { StgTSO * tso; SchedulerStatus stat; @@ -79,6 +120,29 @@ static StgMainThread *main_threads; /* Thread queues. * Locks required: sched_mutex. */ + +#if defined(GRAN) + +StgTSO* ActiveTSO = NULL; /* for assigning system costs; GranSim-Light only */ +/* rtsTime TimeOfNextEvent, EndOfTimeSlice; now in GranSim.c */ + +/* + In GranSim we have a runable and a blocked queue for each processor. + In order to minimise code changes new arrays run_queue_hds/tls + are created. run_queue_hd is then a short cut (macro) for + run_queue_hds[CurrentProc] (see GranSim.h). + -- HWL +*/ +StgTSO *run_queue_hds[MAX_PROC], *run_queue_tls[MAX_PROC]; +StgTSO *blocked_queue_hds[MAX_PROC], *blocked_queue_tls[MAX_PROC]; +StgTSO *ccalling_threadss[MAX_PROC]; + +#else /* !GRAN */ + +//@cindex run_queue_hd +//@cindex run_queue_tl +//@cindex blocked_queue_hd +//@cindex blocked_queue_tl StgTSO *run_queue_hd, *run_queue_tl; StgTSO *blocked_queue_hd, *blocked_queue_tl; @@ -87,12 +151,9 @@ StgTSO *blocked_queue_hd, *blocked_queue_tl; */ static StgTSO *suspended_ccalling_threads; -#ifndef SMP -static rtsBool in_ccall_gc; -#endif - static void GetRoots(void); static StgTSO *threadStackOverflow(StgTSO *tso); +#endif /* KH: The following two flags are shared memory locations. There is no need to lock them, since they are only unset at the end of a scheduler @@ -100,13 +161,17 @@ static StgTSO *threadStackOverflow(StgTSO *tso); */ /* flag set by signal handler to precipitate a context switch */ +//@cindex context_switch nat context_switch; + /* if this flag is set as well, give up execution */ -static nat interrupted; +//@cindex interrupted +rtsBool interrupted; /* Next thread ID to allocate. * Locks required: sched_mutex */ +//@cindex next_thread_id StgThreadID next_thread_id = 1; /* @@ -131,10 +196,19 @@ StgThreadID next_thread_id = 1; * Locks required: sched_mutex. */ #ifdef SMP -Capability *free_capabilities; /* Available capabilities for running threads */ -nat n_free_capabilities; /* total number of available capabilities */ +//@cindex free_capabilities +//@cindex n_free_capabilities +Capability *free_capabilities; /* Available capabilities for running threads */ +nat n_free_capabilities; /* total number of available capabilities */ #else -Capability MainRegTable; /* for non-SMP, we have one global capability */ +//@cindex MainRegTable +Capability MainRegTable; /* for non-SMP, we have one global capability */ +#endif + +#if defined(GRAN) +StgTSO *CurrentTSOs[MAX_PROC]; +#else +StgTSO *CurrentTSO; #endif rtsBool ready_to_gc; @@ -142,16 +216,25 @@ rtsBool ready_to_gc; /* All our current task ids, saved in case we need to kill them later. */ #ifdef SMP +//@cindex task_ids task_info *task_ids; #endif void addToBlockedQueue ( StgTSO *tso ); static void schedule ( void ); -static void initThread ( StgTSO *tso, nat stack_size ); -static void interruptStgRts ( void ); + void interruptStgRts ( void ); +static StgTSO * createThread_ ( nat size, rtsBool have_lock ); + +#ifdef DEBUG +static void sched_belch(char *s, ...); +#endif #ifdef SMP +//@cindex sched_mutex +//@cindex term_mutex +//@cindex thread_ready_cond +//@cindex gc_pending_cond pthread_mutex_t sched_mutex = PTHREAD_MUTEX_INITIALIZER; pthread_mutex_t term_mutex = PTHREAD_MUTEX_INITIALIZER; pthread_cond_t thread_ready_cond = PTHREAD_COND_INITIALIZER; @@ -160,7 +243,25 @@ pthread_cond_t gc_pending_cond = PTHREAD_COND_INITIALIZER; nat await_death; #endif -/* ----------------------------------------------------------------------------- +#if defined(PAR) +StgTSO *LastTSO; +rtsTime TimeOfLastYield; +#endif + +/* + * The thread state for the main thread. +// ToDo: check whether not needed any more +StgTSO *MainTSO; + */ + + +//@node Prototypes, Main scheduling loop, Variables and Data structures, Main scheduling code +//@subsection Prototypes + +//@node Main scheduling loop, Suspend and Resume, Prototypes, Main scheduling code +//@subsection Main scheduling loop + +/* --------------------------------------------------------------------------- Main scheduling loop. We use round-robin scheduling, each thread returning to the @@ -179,25 +280,169 @@ nat await_death; * waiting for work, or * waiting for a GC to complete. - -------------------------------------------------------------------------- */ - + ------------------------------------------------------------------------ */ +//@cindex schedule static void schedule( void ) { StgTSO *t; Capability *cap; StgThreadReturnCode ret; +#if defined(GRAN) + rtsEvent *event; +#elif defined(PAR) + rtsSpark spark; + StgTSO *tso; + GlobalTaskId pe; +#endif ACQUIRE_LOCK(&sched_mutex); +#if defined(GRAN) +# error ToDo: implement GranSim scheduler +#elif defined(PAR) + while (!GlobalStopPending) { /* GlobalStopPending set in par_exit */ + + if (PendingFetches != END_BF_QUEUE) { + processFetches(); + } +#else while (1) { +#endif + + /* If we're interrupted (the user pressed ^C, or some other + * termination condition occurred), kill all the currently running + * threads. + */ + if (interrupted) { + IF_DEBUG(scheduler, sched_belch("interrupted")); + for (t = run_queue_hd; t != END_TSO_QUEUE; t = t->link) { + deleteThread(t); + } + for (t = blocked_queue_hd; t != END_TSO_QUEUE; t = t->link) { + deleteThread(t); + } + run_queue_hd = run_queue_tl = END_TSO_QUEUE; + blocked_queue_hd = blocked_queue_tl = END_TSO_QUEUE; + } + + /* Go through the list of main threads and wake up any + * clients whose computations have finished. ToDo: this + * should be done more efficiently without a linear scan + * of the main threads list, somehow... + */ +#ifdef SMP + { + StgMainThread *m, **prev; + prev = &main_threads; + for (m = main_threads; m != NULL; m = m->link) { + switch (m->tso->whatNext) { + case ThreadComplete: + if (m->ret) { + *(m->ret) = (StgClosure *)m->tso->sp[0]; + } + *prev = m->link; + m->stat = Success; + pthread_cond_broadcast(&m->wakeup); + break; + case ThreadKilled: + *prev = m->link; + if (interrupted) { + m->stat = Interrupted; + } else { + m->stat = Killed; + } + pthread_cond_broadcast(&m->wakeup); + break; + default: + break; + } + } + } +#else + /* If our main thread has finished or been killed, return. + */ + { + StgMainThread *m = main_threads; + if (m->tso->whatNext == ThreadComplete + || m->tso->whatNext == ThreadKilled) { + main_threads = main_threads->link; + if (m->tso->whatNext == ThreadComplete) { + /* we finished successfully, fill in the return value */ + if (m->ret) { *(m->ret) = (StgClosure *)m->tso->sp[0]; }; + m->stat = Success; + return; + } else { + if (interrupted) { + m->stat = Interrupted; + } else { + m->stat = Killed; + } + return; + } + } + } +#endif + + /* Top up the run queue from our spark pool. We try to make the + * number of threads in the run queue equal to the number of + * free capabilities. + */ +#if defined(SMP) + { + nat n = n_free_capabilities; + StgTSO *tso = run_queue_hd; + + /* Count the run queue */ + while (n > 0 && tso != END_TSO_QUEUE) { + tso = tso->link; + n--; + } + + for (; n > 0; n--) { + StgClosure *spark; + spark = findSpark(); + if (spark == NULL) { + break; /* no more sparks in the pool */ + } else { + /* I'd prefer this to be done in activateSpark -- HWL */ + /* tricky - it needs to hold the scheduler lock and + * not try to re-acquire it -- SDM */ + StgTSO *tso; + tso = createThread_(RtsFlags.GcFlags.initialStkSize, rtsTrue); + pushClosure(tso,spark); + PUSH_ON_RUN_QUEUE(tso); +#ifdef PAR + advisory_thread_count++; +#endif + + IF_DEBUG(scheduler, + sched_belch("turning spark of closure %p into a thread", + (StgClosure *)spark)); + } + } + /* We need to wake up the other tasks if we just created some + * work for them. + */ + if (n_free_capabilities - n > 1) { + pthread_cond_signal(&thread_ready_cond); + } + } +#endif /* SMP */ - /* Check whether any waiting threads need to be woken up. - * If the run queue is empty, we can wait indefinitely for - * something to happen. + /* Check whether any waiting threads need to be woken up. If the + * run queue is empty, and there are no other tasks running, we + * can wait indefinitely for something to happen. + * ToDo: what if another client comes along & requests another + * main thread? */ if (blocked_queue_hd != END_TSO_QUEUE) { - awaitEvent(run_queue_hd == END_TSO_QUEUE); + awaitEvent( + (run_queue_hd == END_TSO_QUEUE) +#ifdef SMP + && (n_free_capabilities == RtsFlags.ParFlags.nNodes) +#endif + ); } /* check for signals each time around the scheduler */ @@ -207,13 +452,41 @@ schedule( void ) } #endif + /* Detect deadlock: when we have no threads to run, there are + * no threads waiting on I/O or sleeping, and all the other + * tasks are waiting for work, we must have a deadlock. Inform + * all the main threads. + */ +#ifdef SMP + if (blocked_queue_hd == END_TSO_QUEUE + && run_queue_hd == END_TSO_QUEUE + && (n_free_capabilities == RtsFlags.ParFlags.nNodes) + ) { + StgMainThread *m; + for (m = main_threads; m != NULL; m = m->link) { + m->ret = NULL; + m->stat = Deadlock; + pthread_cond_broadcast(&m->wakeup); + } + main_threads = NULL; + } +#else /* ! SMP */ + if (blocked_queue_hd == END_TSO_QUEUE + && run_queue_hd == END_TSO_QUEUE) { + StgMainThread *m = main_threads; + m->ret = NULL; + m->stat = Deadlock; + main_threads = m->link; + return; + } +#endif + #ifdef SMP /* If there's a GC pending, don't do anything until it has * completed. */ if (ready_to_gc) { - IF_DEBUG(scheduler,fprintf(stderr,"schedule (task %ld): waiting for GC\n", - pthread_self());); + IF_DEBUG(scheduler,sched_belch("waiting for GC")); pthread_cond_wait(&gc_pending_cond, &sched_mutex); } @@ -221,19 +494,120 @@ schedule( void ) * capability. */ while (run_queue_hd == END_TSO_QUEUE || free_capabilities == NULL) { - IF_DEBUG(scheduler, - fprintf(stderr, "schedule (task %ld): waiting for work\n", - pthread_self());); + IF_DEBUG(scheduler, sched_belch("waiting for work")); pthread_cond_wait(&thread_ready_cond, &sched_mutex); - IF_DEBUG(scheduler, - fprintf(stderr, "schedule (task %ld): work now available\n", - pthread_self());); + IF_DEBUG(scheduler, sched_belch("work now available")); } #endif + +#if defined(GRAN) +# error ToDo: implement GranSim scheduler +#elif defined(PAR) + /* ToDo: phps merge with spark activation above */ + /* check whether we have local work and send requests if we have none */ + if (run_queue_hd == END_TSO_QUEUE) { /* no runnable threads */ + /* :-[ no local threads => look out for local sparks */ + if (advisory_thread_count < RtsFlags.ParFlags.maxThreads && + (pending_sparks_hd[REQUIRED_POOL] < pending_sparks_tl[REQUIRED_POOL] || + pending_sparks_hd[ADVISORY_POOL] < pending_sparks_tl[ADVISORY_POOL])) { + /* + * ToDo: add GC code check that we really have enough heap afterwards!! + * Old comment: + * If we're here (no runnable threads) and we have pending + * sparks, we must have a space problem. Get enough space + * to turn one of those pending sparks into a + * thread... + */ + + spark = findSpark(); /* get a spark */ + if (spark != (rtsSpark) NULL) { + tso = activateSpark(spark); /* turn the spark into a thread */ + IF_PAR_DEBUG(verbose, + belch("== [%x] schedule: Created TSO %p (%d); %d threads active", + mytid, tso, tso->id, advisory_thread_count)); + + if (tso==END_TSO_QUEUE) { /* failed to activate spark->back to loop */ + belch("^^ failed to activate spark"); + goto next_thread; + } /* otherwise fall through & pick-up new tso */ + } else { + IF_PAR_DEBUG(verbose, + belch("^^ no local sparks (spark pool contains only NFs: %d)", + spark_queue_len(ADVISORY_POOL))); + goto next_thread; + } + } else + /* =8-[ no local sparks => look for work on other PEs */ + { + /* + * We really have absolutely no work. Send out a fish + * (there may be some out there already), and wait for + * something to arrive. We clearly can't run any threads + * until a SCHEDULE or RESUME arrives, and so that's what + * we're hoping to see. (Of course, we still have to + * respond to other types of messages.) + */ + if (//!fishing && + outstandingFishes < RtsFlags.ParFlags.maxFishes ) { // && + // (last_fish_arrived_at+FISH_DELAY < CURRENT_TIME)) { + /* fishing set in sendFish, processFish; + avoid flooding system with fishes via delay */ + pe = choosePE(); + sendFish(pe, mytid, NEW_FISH_AGE, NEW_FISH_HISTORY, + NEW_FISH_HUNGER); + } + + processMessages(); + goto next_thread; + // ReSchedule(0); + } + } else if (PacketsWaiting()) { /* Look for incoming messages */ + processMessages(); + } + + /* Now we are sure that we have some work available */ + ASSERT(run_queue_hd != END_TSO_QUEUE); + /* Take a thread from the run queue, if we have work */ + t = take_off_run_queue(END_TSO_QUEUE); + + /* ToDo: write something to the log-file + if (RTSflags.ParFlags.granSimStats && !sameThread) + DumpGranEvent(GR_SCHEDULE, RunnableThreadsHd); + */ + + CurrentTSO = t; + + IF_DEBUG(scheduler, belch("--^^ %d sparks on [%#x] (hd=%x; tl=%x; lim=%x)", + spark_queue_len(ADVISORY_POOL), CURRENT_PROC, + pending_sparks_hd[ADVISORY_POOL], + pending_sparks_tl[ADVISORY_POOL], + pending_sparks_lim[ADVISORY_POOL])); + + IF_DEBUG(scheduler, belch("--== %d threads on [%#x] (hd=%x; tl=%x)", + run_queue_len(), CURRENT_PROC, + run_queue_hd, run_queue_tl)); + + if (t != LastTSO) { + /* + we are running a different TSO, so write a schedule event to log file + NB: If we use fair scheduling we also have to write a deschedule + event for LastTSO; with unfair scheduling we know that the + previous tso has blocked whenever we switch to another tso, so + we don't need it in GUM for now + */ + DumpRawGranEvent(CURRENT_PROC, CURRENT_PROC, + GR_SCHEDULE, t, (StgClosure *)NULL, 0, 0); + + } + +#else /* !GRAN && !PAR */ /* grab a thread from the run queue */ t = POP_RUN_QUEUE(); + IF_DEBUG(sanity,checkTSO(t)); + +#endif /* grab a capability */ @@ -249,19 +623,16 @@ schedule( void ) /* set the context_switch flag */ - if (run_queue_hd == END_TSO_QUEUE) + if (run_queue_hd == END_TSO_QUEUE) context_switch = 0; else context_switch = 1; - + RELEASE_LOCK(&sched_mutex); -#ifdef SMP - IF_DEBUG(scheduler,fprintf(stderr,"schedule (task %ld): running thread %d\n", pthread_self(),t->id)); -#else - IF_DEBUG(scheduler,fprintf(stderr,"schedule: running thread %d\n",t->id)); -#endif + IF_DEBUG(scheduler,sched_belch("running thread %d", t->id)); + /* +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ */ /* Run the current thread */ switch (cap->rCurrentTSO->whatNext) { @@ -278,17 +649,13 @@ schedule( void ) break; case ThreadEnterHugs: #ifdef INTERPRETER - { - IF_DEBUG(scheduler,belch("schedule: entering Hugs")); - LoadThreadState(); - /* CHECK_SENSIBLE_REGS(); */ - { - StgClosure* c = (StgClosure *)Sp[0]; - Sp += 1; - ret = enter(c); - } - SaveThreadState(); - break; + { + StgClosure* c; + IF_DEBUG(scheduler,sched_belch("entering Hugs")); + c = (StgClosure *)(cap->rCurrentTSO->sp[0]); + cap->rCurrentTSO->sp += 1; + ret = enter(cap,c); + break; } #else barf("Panic: entered a BCO but no bytecode interpreter in this build"); @@ -296,6 +663,7 @@ schedule( void ) default: barf("schedule: invalid whatNext field"); } + /* +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ */ /* Costs for the scheduler are assigned to CCS_SYSTEM */ #ifdef PROFILING @@ -305,9 +673,9 @@ schedule( void ) ACQUIRE_LOCK(&sched_mutex); #ifdef SMP - IF_DEBUG(scheduler,fprintf(stderr,"schedule (task %ld): ", pthread_self());); + IF_DEBUG(scheduler,fprintf(stderr,"scheduler (task %ld): ", pthread_self());); #else - IF_DEBUG(scheduler,fprintf(stderr,"schedule: ");); + IF_DEBUG(scheduler,fprintf(stderr,"scheduler: ");); #endif t = cap->rCurrentTSO; @@ -338,18 +706,29 @@ schedule( void ) /* This TSO has moved, so update any pointers to it from the * main thread stack. It better not be on any other queues... - * (it shouldn't be) + * (it shouldn't be). */ for (m = main_threads; m != NULL; m = m->link) { if (m->tso == t) { m->tso = new_t; } } + threadPaused(new_t); + ready_to_gc = rtsTrue; + context_switch = 1; PUSH_ON_RUN_QUEUE(new_t); } break; case ThreadYielding: +#if defined(GRAN) + IF_DEBUG(gran, + DumpGranEvent(GR_DESCHEDULE, t)); + globalGranStats.tot_yields++; +#elif defined(PAR) + IF_DEBUG(par, + DumpGranEvent(GR_DESCHEDULE, t)); +#endif /* put the thread back on the run queue. Then, if we're ready to * GC, check whether this is the last task to stop. If so, wake * up the GC thread. getThread will block during a GC until the @@ -370,6 +749,13 @@ schedule( void ) break; case ThreadBlocked: +#if defined(GRAN) +# error ToDo: implement GranSim scheduler +#elif defined(PAR) + IF_DEBUG(par, + DumpGranEvent(GR_DESCHEDULE, t)); +#else +#endif /* don't need to do anything. Either the thread is blocked on * I/O, in which case we'll have called addToBlockedQueue * previously, or it's blocked on an MVar or Blackhole, in which @@ -390,6 +776,13 @@ schedule( void ) */ IF_DEBUG(scheduler,belch("thread %ld finished", t->id)); t->whatNext = ThreadComplete; +#if defined(GRAN) + // ToDo: endThread(t, CurrentProc); // clean-up the thread +#elif defined(PAR) + advisory_thread_count--; + if (RtsFlags.ParFlags.ParStats.Full) + DumpEndEvent(CURRENT_PROC, t, rtsFalse /* not mandatory */); +#endif break; default: @@ -403,17 +796,18 @@ schedule( void ) #endif #ifdef SMP - if (ready_to_gc && n_free_capabilities == RtsFlags.ConcFlags.nNodes) { + if (ready_to_gc && n_free_capabilities == RtsFlags.ParFlags.nNodes) #else - if (ready_to_gc) { + if (ready_to_gc) #endif + { /* everybody back, start the GC. * Could do it in this thread, or signal a condition var * to do it in another thread. Either way, we need to * broadcast on gc_pending_cond afterward. */ #ifdef SMP - IF_DEBUG(scheduler,belch("schedule (task %ld): doing GC", pthread_self())); + IF_DEBUG(scheduler,sched_belch("doing GC")); #endif GarbageCollect(GetRoots); ready_to_gc = rtsFalse; @@ -421,60 +815,47 @@ schedule( void ) pthread_cond_broadcast(&gc_pending_cond); #endif } - - /* Go through the list of main threads and wake up any - * clients whose computations have finished. ToDo: this - * should be done more efficiently without a linear scan - * of the main threads list, somehow... - */ -#ifdef SMP - { - StgMainThread *m, **prev; - prev = &main_threads; - for (m = main_threads; m != NULL; m = m->link) { - if (m->tso->whatNext == ThreadComplete) { - if (m->ret) { - *(m->ret) = (StgClosure *)m->tso->sp[0]; - } - *prev = m->link; - m->stat = Success; - pthread_cond_broadcast(&m->wakeup); - } - if (m->tso->whatNext == ThreadKilled) { - *prev = m->link; - m->stat = Killed; - pthread_cond_broadcast(&m->wakeup); - } - } - } -#else - /* If our main thread has finished or been killed, return. - * If we were re-entered as a result of a _ccall_gc, then - * pop the blocked thread off the ccalling_threads stack back - * into CurrentTSO. - */ - { - StgMainThread *m = main_threads; - if (m->tso->whatNext == ThreadComplete - || m->tso->whatNext == ThreadKilled) { - main_threads = main_threads->link; - if (m->tso->whatNext == ThreadComplete) { - /* we finished successfully, fill in the return value */ - if (m->ret) { *(m->ret) = (StgClosure *)m->tso->sp[0]; }; - m->stat = Success; - return; - } else { - m->stat = Killed; - return; - } - } - } -#endif +#if defined(GRAN) + next_thread: + IF_GRAN_DEBUG(unused, + print_eventq(EventHd)); + event = get_next_event(); + +#elif defined(PAR) + next_thread: + /* ToDo: wait for next message to arrive rather than busy wait */ + +#else /* GRAN */ + /* not any more + next_thread: + t = take_off_run_queue(END_TSO_QUEUE); + */ +#endif /* GRAN */ } /* end of while(1) */ } -/* ----------------------------------------------------------------------------- +/* A hack for Hugs concurrency support. Needs sanitisation (?) */ +void deleteAllThreads ( void ) +{ + StgTSO* t; + IF_DEBUG(scheduler,sched_belch("deleteAllThreads()")); + for (t = run_queue_hd; t != END_TSO_QUEUE; t = t->link) { + deleteThread(t); + } + for (t = blocked_queue_hd; t != END_TSO_QUEUE; t = t->link) { + deleteThread(t); + } + run_queue_hd = run_queue_tl = END_TSO_QUEUE; + blocked_queue_hd = blocked_queue_tl = END_TSO_QUEUE; +} + +/* startThread and insertThread are now in GranSim.c -- HWL */ + +//@node Suspend and Resume, Run queue code, Main scheduling loop, Main scheduling code +//@subsection Suspend and Resume + +/* --------------------------------------------------------------------------- * Suspending & resuming Haskell threads. * * When making a "safe" call to C (aka _ccall_GC), the task gives back @@ -487,7 +868,7 @@ schedule( void ) * duration of the call, on the susepended_ccalling_threads queue. We * give out a token to the task, which it can use to resume the thread * on return from the C function. - * -------------------------------------------------------------------------- */ + * ------------------------------------------------------------------------- */ StgInt suspendThread( Capability *cap ) @@ -496,15 +877,8 @@ suspendThread( Capability *cap ) ACQUIRE_LOCK(&sched_mutex); -#ifdef SMP - IF_DEBUG(scheduler, - fprintf(stderr, "schedule (task %ld): thread %d did a _ccall_gc\n", - pthread_self(), cap->rCurrentTSO->id)); -#else IF_DEBUG(scheduler, - fprintf(stderr, "schedule: thread %d did a _ccall_gc\n", - cap->rCurrentTSO->id)); -#endif + sched_belch("thread %d did a _ccall_gc\n", cap->rCurrentTSO->id)); threadPaused(cap->rCurrentTSO); cap->rCurrentTSO->link = suspended_ccalling_threads; @@ -546,13 +920,9 @@ resumeThread( StgInt tok ) #ifdef SMP while (free_capabilities == NULL) { - IF_DEBUG(scheduler, - fprintf(stderr,"schedule (task %ld): waiting to resume\n", - pthread_self())); + IF_DEBUG(scheduler, sched_belch("waiting to resume")); pthread_cond_wait(&thread_ready_cond, &sched_mutex); - IF_DEBUG(scheduler,fprintf(stderr, - "schedule (task %ld): resuming thread %d\n", - pthread_self(), tso->id)); + IF_DEBUG(scheduler, sched_belch("resuming thread %d", tso->id)); } cap = free_capabilities; free_capabilities = cap->link; @@ -567,17 +937,18 @@ resumeThread( StgInt tok ) return cap; } -/* ----------------------------------------------------------------------------- + +/* --------------------------------------------------------------------------- * Static functions - * -------------------------------------------------------------------------- */ + * ------------------------------------------------------------------------ */ static void unblockThread(StgTSO *tso); -/* ----------------------------------------------------------------------------- +/* --------------------------------------------------------------------------- * Comparing Thread ids. * * This is used from STG land in the implementation of the * instances of Eq/Ord for ThreadIds. - * -------------------------------------------------------------------------- */ + * ------------------------------------------------------------------------ */ int cmp_thread(const StgTSO *tso1, const StgTSO *tso2) { @@ -589,7 +960,7 @@ int cmp_thread(const StgTSO *tso1, const StgTSO *tso2) return 0; } -/* ----------------------------------------------------------------------------- +/* --------------------------------------------------------------------------- Create a new thread. The new thread starts with the given stack size. Before the @@ -599,41 +970,79 @@ int cmp_thread(const StgTSO *tso1, const StgTSO *tso2) createGenThread() and createIOThread() (in SchedAPI.h) are convenient packaged versions of this function. - -------------------------------------------------------------------------- */ + ------------------------------------------------------------------------ */ +//@cindex createThread +#if defined(GRAN) +/* currently pri (priority) is only used in a GRAN setup -- HWL */ +StgTSO * +createThread(nat stack_size, StgInt pri) +{ + return createThread_(stack_size, rtsFalse, pri); +} +static StgTSO * +createThread_(nat size, rtsBool have_lock, StgInt pri) +{ +#else StgTSO * createThread(nat stack_size) { - StgTSO *tso; + return createThread_(stack_size, rtsFalse); +} + +static StgTSO * +createThread_(nat size, rtsBool have_lock) +{ +#endif + StgTSO *tso; + nat stack_size; + + /* First check whether we should create a thread at all */ +#if defined(PAR) + /* check that no more than RtsFlags.ParFlags.maxThreads threads are created */ + if (advisory_thread_count >= RtsFlags.ParFlags.maxThreads) { + threadsIgnored++; + belch("{createThread}Daq ghuH: refusing to create another thread; no more than %d threads allowed (currently %d)", + RtsFlags.ParFlags.maxThreads, advisory_thread_count); + return END_TSO_QUEUE; + } + threadsCreated++; +#endif + +#if defined(GRAN) + ASSERT(!RtsFlags.GranFlags.Light || CurrentProc==0); +#endif + + // ToDo: check whether size = stack_size - TSO_STRUCT_SIZEW /* catch ridiculously small stack sizes */ - if (stack_size < MIN_STACK_WORDS + TSO_STRUCT_SIZEW) { - stack_size = MIN_STACK_WORDS + TSO_STRUCT_SIZEW; + if (size < MIN_STACK_WORDS + TSO_STRUCT_SIZEW) { + size = MIN_STACK_WORDS + TSO_STRUCT_SIZEW; } - tso = (StgTSO *)allocate(stack_size); - TICK_ALLOC_TSO(stack_size-sizeofW(StgTSO),0); + tso = (StgTSO *)allocate(size); + TICK_ALLOC_TSO(size-sizeofW(StgTSO),0); - initThread(tso, stack_size - TSO_STRUCT_SIZEW); - return tso; -} + stack_size = size - TSO_STRUCT_SIZEW; -void -initThread(StgTSO *tso, nat stack_size) -{ - SET_INFO(tso,&TSO_info); + // Hmm, this CCS_MAIN is not protected by a PROFILING cpp var; + SET_HDR(tso, &TSO_info, CCS_MAIN); +#if defined(GRAN) + SET_GRAN_HDR(tso, ThisPE); +#endif tso->whatNext = ThreadEnterGHC; - + /* tso->id needs to be unique. For now we use a heavyweight mutex to protect the increment operation on next_thread_id. In future, we could use an atomic increment instead. */ - ACQUIRE_LOCK(&sched_mutex); + if (!have_lock) { ACQUIRE_LOCK(&sched_mutex); } tso->id = next_thread_id++; - RELEASE_LOCK(&sched_mutex); + if (!have_lock) { RELEASE_LOCK(&sched_mutex); } tso->why_blocked = NotBlocked; + tso->blocked_exceptions = NULL; tso->splim = (P_)&(tso->stack) + RESERVED_STACK_WORDS; tso->stack_size = stack_size; @@ -650,21 +1059,79 @@ initThread(StgTSO *tso, nat stack_size) SET_HDR((StgClosure*)tso->sp,(StgInfoTable *)&stg_stop_thread_info,CCS_MAIN); tso->su = (StgUpdateFrame*)tso->sp; - IF_DEBUG(scheduler,belch("schedule: Initialised thread %ld, stack size = %lx words", - tso->id, tso->stack_size)); + IF_DEBUG(scheduler,belch("---- Initialised TSO %ld (%p), stack size = %lx words", + tso->id, tso, tso->stack_size)); -} + // ToDo: check this +#if defined(GRAN) + tso->link = END_TSO_QUEUE; + /* uses more flexible routine in GranSim */ + insertThread(tso, CurrentProc); +#else + /* In a non-GranSim setup the pushing of a TSO onto the runq is separated + from its creation + */ +#endif +#if defined(GRAN) + tso->gran.pri = pri; + tso->gran.magic = TSO_MAGIC; // debugging only + tso->gran.sparkname = 0; + tso->gran.startedat = CURRENT_TIME; + tso->gran.exported = 0; + tso->gran.basicblocks = 0; + tso->gran.allocs = 0; + tso->gran.exectime = 0; + tso->gran.fetchtime = 0; + tso->gran.fetchcount = 0; + tso->gran.blocktime = 0; + tso->gran.blockcount = 0; + tso->gran.blockedat = 0; + tso->gran.globalsparks = 0; + tso->gran.localsparks = 0; + if (RtsFlags.GranFlags.Light) + tso->gran.clock = Now; /* local clock */ + else + tso->gran.clock = 0; + + IF_DEBUG(gran,printTSO(tso)); +#elif defined(PAR) + tso->par.sparkname = 0; + tso->par.startedat = CURRENT_TIME; + tso->par.exported = 0; + tso->par.basicblocks = 0; + tso->par.allocs = 0; + tso->par.exectime = 0; + tso->par.fetchtime = 0; + tso->par.fetchcount = 0; + tso->par.blocktime = 0; + tso->par.blockcount = 0; + tso->par.blockedat = 0; + tso->par.globalsparks = 0; + tso->par.localsparks = 0; +#endif -/* ----------------------------------------------------------------------------- - * scheduleThread() - * - * scheduleThread puts a thread on the head of the runnable queue. +#if defined(GRAN) + globalGranStats.tot_threads_created++; + globalGranStats.threads_created_on_PE[CurrentProc]++; + globalGranStats.tot_sq_len += spark_queue_len(CurrentProc); + globalGranStats.tot_sq_probes++; +#endif + + IF_DEBUG(scheduler,sched_belch("created thread %ld, stack size = %lx words", + tso->id, tso->stack_size)); + return tso; +} + +/* --------------------------------------------------------------------------- + * scheduleThread() + * + * scheduleThread puts a thread on the head of the runnable queue. * This will usually be done immediately after a thread is created. * The caller of scheduleThread must create the thread using e.g. * createThread and push an appropriate closure * on this thread's stack before the scheduler is invoked. - * -------------------------------------------------------------------------- */ + * ------------------------------------------------------------------------ */ void scheduleThread(StgTSO *tso) @@ -683,14 +1150,13 @@ scheduleThread(StgTSO *tso) RELEASE_LOCK(&sched_mutex); } - -/* ----------------------------------------------------------------------------- +/* --------------------------------------------------------------------------- * startTasks() * * Start up Posix threads to run each of the scheduler tasks. * I believe the task ids are not needed in the system as defined. - * KH @ 25/10/99 - * -------------------------------------------------------------------------- */ + * KH @ 25/10/99 + * ------------------------------------------------------------------------ */ #ifdef SMP static void * @@ -701,7 +1167,7 @@ taskStart( void *arg STG_UNUSED ) } #endif -/* ----------------------------------------------------------------------------- +/* --------------------------------------------------------------------------- * initScheduler() * * Initialise the scheduler. This resets all the queues - if the @@ -709,23 +1175,13 @@ taskStart( void *arg STG_UNUSED ) * next pass. * * This now calls startTasks(), so should only be called once! KH @ 25/10/99 - * -------------------------------------------------------------------------- */ + * ------------------------------------------------------------------------ */ #ifdef SMP static void term_handler(int sig STG_UNUSED) { - nat i; - pthread_t me = pthread_self(); - - for (i = 0; i < RtsFlags.ConcFlags.nNodes; i++) { - if (task_ids[i].id == me) { - task_ids[i].mut_time = usertime() - task_ids[i].gc_time; - if (task_ids[i].mut_time < 0.0) { - task_ids[i].mut_time = 0.0; - } - } - } + stat_workerStop(); ACQUIRE_LOCK(&term_mutex); await_death--; RELEASE_LOCK(&term_mutex); @@ -733,12 +1189,26 @@ term_handler(int sig STG_UNUSED) } #endif -void initScheduler(void) +//@cindex initScheduler +void +initScheduler(void) { +#if defined(GRAN) + nat i; + + for (i=0; i<=MAX_PROC; i++) { + run_queue_hds[i] = END_TSO_QUEUE; + run_queue_tls[i] = END_TSO_QUEUE; + blocked_queue_hds[i] = END_TSO_QUEUE; + blocked_queue_tls[i] = END_TSO_QUEUE; + ccalling_threadss[i] = END_TSO_QUEUE; + } +#else run_queue_hd = END_TSO_QUEUE; run_queue_tl = END_TSO_QUEUE; blocked_queue_hd = END_TSO_QUEUE; blocked_queue_tl = END_TSO_QUEUE; +#endif suspended_ccalling_threads = END_TSO_QUEUE; @@ -770,17 +1240,21 @@ void initScheduler(void) Capability *cap, *prev; cap = NULL; prev = NULL; - for (i = 0; i < RtsFlags.ConcFlags.nNodes; i++) { + for (i = 0; i < RtsFlags.ParFlags.nNodes; i++) { cap = stgMallocBytes(sizeof(Capability), "initScheduler:capabilities"); cap->link = prev; prev = cap; } free_capabilities = cap; - n_free_capabilities = RtsFlags.ConcFlags.nNodes; + n_free_capabilities = RtsFlags.ParFlags.nNodes; } - IF_DEBUG(scheduler,fprintf(stderr,"schedule: Allocated %d capabilities\n", + IF_DEBUG(scheduler,fprintf(stderr,"scheduler: Allocated %d capabilities\n", n_free_capabilities);); #endif + +#if defined(SMP) || defined(PAR) + initSparkPools(); +#endif } #ifdef SMP @@ -792,17 +1266,22 @@ startTasks( void ) pthread_t tid; /* make some space for saving all the thread ids */ - task_ids = stgMallocBytes(RtsFlags.ConcFlags.nNodes * sizeof(task_info), + task_ids = stgMallocBytes(RtsFlags.ParFlags.nNodes * sizeof(task_info), "initScheduler:task_ids"); /* and create all the threads */ - for (i = 0; i < RtsFlags.ConcFlags.nNodes; i++) { + for (i = 0; i < RtsFlags.ParFlags.nNodes; i++) { r = pthread_create(&tid,NULL,taskStart,NULL); if (r != 0) { barf("startTasks: Can't create new Posix thread"); } task_ids[i].id = tid; - IF_DEBUG(scheduler,fprintf(stderr,"schedule: Started task: %ld\n",tid);); + task_ids[i].mut_time = 0.0; + task_ids[i].mut_etime = 0.0; + task_ids[i].gc_time = 0.0; + task_ids[i].gc_etime = 0.0; + task_ids[i].elapsedtimestart = elapsedtime(); + IF_DEBUG(scheduler,fprintf(stderr,"scheduler: Started task: %ld\n",tid);); } } #endif @@ -811,7 +1290,7 @@ void exitScheduler( void ) { #ifdef SMP - nat i; + nat i; /* Don't want to use pthread_cancel, since we'd have to install * these silly exception handlers (pthread_cleanup_{push,pop}) around @@ -819,13 +1298,13 @@ exitScheduler( void ) */ #if 0 /* Cancel all our tasks */ - for (i = 0; i < RtsFlags.ConcFlags.nNodes; i++) { + for (i = 0; i < RtsFlags.ParFlags.nNodes; i++) { pthread_cancel(task_ids[i].id); } /* Wait for all the tasks to terminate */ - for (i = 0; i < RtsFlags.ConcFlags.nNodes; i++) { - IF_DEBUG(scheduler,fprintf(stderr,"schedule: waiting for task %ld\n", + for (i = 0; i < RtsFlags.ParFlags.nNodes; i++) { + IF_DEBUG(scheduler,fprintf(stderr,"scheduler: waiting for task %ld\n", task_ids[i].id)); pthread_join(task_ids[i].id, NULL); } @@ -833,8 +1312,8 @@ exitScheduler( void ) /* Send 'em all a SIGHUP. That should shut 'em up. */ - await_death = RtsFlags.ConcFlags.nNodes; - for (i = 0; i < RtsFlags.ConcFlags.nNodes; i++) { + await_death = RtsFlags.ParFlags.nNodes; + for (i = 0; i < RtsFlags.ParFlags.nNodes; i++) { pthread_kill(task_ids[i].id,SIGTERM); } while (await_death > 0) { @@ -888,302 +1367,138 @@ waitThread(StgTSO *tso, /*out*/StgClosure **ret) m->link = main_threads; main_threads = m; + IF_DEBUG(scheduler, fprintf(stderr, "scheduler: new main thread (%d)\n", + m->tso->id)); + #ifdef SMP - pthread_cond_wait(&m->wakeup, &sched_mutex); + do { + pthread_cond_wait(&m->wakeup, &sched_mutex); + } while (m->stat == NoStatus); #else schedule(); + ASSERT(m->stat != NoStatus); #endif stat = m->stat; - ASSERT(stat != NoStatus); #ifdef SMP pthread_cond_destroy(&m->wakeup); #endif + + IF_DEBUG(scheduler, fprintf(stderr, "scheduler: main thread (%d) finished\n", + m->tso->id)); free(m); RELEASE_LOCK(&sched_mutex); + return stat; } - -#if 0 -SchedulerStatus schedule(StgTSO *main, StgClosure **ret_val) -{ - StgTSO *t; - StgThreadReturnCode ret; - StgTSO **MainTSO; - rtsBool in_ccall_gc; +//@node Run queue code, Garbage Collextion Routines, Suspend and Resume, Main scheduling code +//@subsection Run queue code - /* Return value is NULL by default, it is only filled in if the - * main thread completes successfully. - */ - if (ret_val) { *ret_val = NULL; } +#if 0 +/* + NB: In GranSim we have many run queues; run_queue_hd is actually a macro + unfolding to run_queue_hds[CurrentProc], thus CurrentProc is an + implicit global variable that has to be correct when calling these + fcts -- HWL +*/ - /* Save away a pointer to the main thread so that we can keep track - * of it should a garbage collection happen. We keep a stack of - * main threads in order to support scheduler re-entry. We can't - * use the normal TSO linkage for this stack, because the main TSO - * may need to be linked onto other queues. - */ - main_threads[next_main_thread] = main; - MainTSO = &main_threads[next_main_thread]; - next_main_thread++; - IF_DEBUG(scheduler, - fprintf(stderr, "Scheduler entered: nesting = %d\n", - next_main_thread);); +/* Put the new thread on the head of the runnable queue. + * The caller of createThread better push an appropriate closure + * on this thread's stack before the scheduler is invoked. + */ +static /* inline */ void +add_to_run_queue(tso) +StgTSO* tso; +{ + ASSERT(tso!=run_queue_hd && tso!=run_queue_tl); + tso->link = run_queue_hd; + run_queue_hd = tso; + if (run_queue_tl == END_TSO_QUEUE) { + run_queue_tl = tso; + } +} - /* Are we being re-entered? - */ - if (CurrentTSO != NULL) { - /* This happens when a _ccall_gc from Haskell ends up re-entering - * the scheduler. - * - * Block the current thread (put it on the ccalling_queue) and - * continue executing. The calling thread better have stashed - * away its state properly and left its stack with a proper stack - * frame on the top. - */ - threadPaused(CurrentTSO); - CurrentTSO->link = ccalling_threads; - ccalling_threads = CurrentTSO; - in_ccall_gc = rtsTrue; - IF_DEBUG(scheduler, - fprintf(stderr, "Re-entry, thread %d did a _ccall_gc\n", - CurrentTSO->id);); +/* Put the new thread at the end of the runnable queue. */ +static /* inline */ void +push_on_run_queue(tso) +StgTSO* tso; +{ + ASSERT(get_itbl((StgClosure *)tso)->type == TSO); + ASSERT(run_queue_hd!=NULL && run_queue_tl!=NULL); + ASSERT(tso!=run_queue_hd && tso!=run_queue_tl); + if (run_queue_hd == END_TSO_QUEUE) { + run_queue_hd = tso; } else { - in_ccall_gc = rtsFalse; + run_queue_tl->link = tso; } + run_queue_tl = tso; +} - /* Take a thread from the run queue. - */ - t = POP_RUN_QUEUE(); +/* + Should be inlined because it's used very often in schedule. The tso + argument is actually only needed in GranSim, where we want to have the + possibility to schedule *any* TSO on the run queue, irrespective of the + actual ordering. Therefore, if tso is not the nil TSO then we traverse + the run queue and dequeue the tso, adjusting the links in the queue. +*/ +//@cindex take_off_run_queue +static /* inline */ StgTSO* +take_off_run_queue(StgTSO *tso) { + StgTSO *t, *prev; - while (t != END_TSO_QUEUE) { - CurrentTSO = t; + /* + qetlaHbogh Qu' ngaSbogh ghomDaQ {tso} yIteq! - /* If we have more threads on the run queue, set up a context - * switch at some point in the future. - */ - if (run_queue_hd != END_TSO_QUEUE || blocked_queue_hd != END_TSO_QUEUE) { - context_switch = 1; + if tso is specified, unlink that tso from the run_queue (doesn't have + to be at the beginning of the queue); GranSim only + */ + if (tso!=END_TSO_QUEUE) { + /* find tso in queue */ + for (t=run_queue_hd, prev=END_TSO_QUEUE; + t!=END_TSO_QUEUE && t!=tso; + prev=t, t=t->link) + /* nothing */ ; + ASSERT(t==tso); + /* now actually dequeue the tso */ + if (prev!=END_TSO_QUEUE) { + ASSERT(run_queue_hd!=t); + prev->link = t->link; } else { - context_switch = 0; - } - IF_DEBUG(scheduler, belch("Running thread %ld...\n", t->id)); - - /* Be friendly to the storage manager: we're about to *run* this - * thread, so we better make sure the TSO is mutable. - */ - if (t->mut_link == NULL) { - recordMutable((StgMutClosure *)t); - } - - /* Run the current thread */ - switch (t->whatNext) { - case ThreadKilled: - case ThreadComplete: - /* thread already killed. Drop it and carry on. */ - goto next_thread; - case ThreadEnterGHC: - ret = StgRun((StgFunPtr) stg_enterStackTop); - break; - case ThreadRunGHC: - ret = StgRun((StgFunPtr) stg_returnToStackTop); - break; - case ThreadEnterHugs: -#ifdef INTERPRETER - { - IF_DEBUG(scheduler,belch("entering Hugs")); - LoadThreadState(); - /* CHECK_SENSIBLE_REGS(); */ - { - StgClosure* c = (StgClosure *)Sp[0]; - Sp += 1; - ret = enter(c); - } - SaveThreadState(); - break; - } -#else - barf("Panic: entered a BCO but no bytecode interpreter in this build"); -#endif - default: - barf("schedule: invalid whatNext field"); - } - - /* We may have garbage collected while running the thread - * (eg. something nefarious like _ccall_GC_ performGC), and hence - * CurrentTSO may have moved. Update t to reflect this. - */ - t = CurrentTSO; - CurrentTSO = NULL; - - /* Costs for the scheduler are assigned to CCS_SYSTEM */ -#ifdef PROFILING - CCCS = CCS_SYSTEM; -#endif - - switch (ret) { - - case HeapOverflow: - IF_DEBUG(scheduler,belch("Thread %ld stopped: HeapOverflow\n", t->id)); - threadPaused(t); - PUSH_ON_RUN_QUEUE(t); - GarbageCollect(GetRoots); - break; - - case StackOverflow: - IF_DEBUG(scheduler,belch("Thread %ld stopped, StackOverflow\n", t->id)); - { - nat i; - /* enlarge the stack */ - StgTSO *new_t = threadStackOverflow(t); - - /* This TSO has moved, so update any pointers to it from the - * main thread stack. It better not be on any other queues... - * (it shouldn't be) - */ - for (i = 0; i < next_main_thread; i++) { - if (main_threads[i] == t) { - main_threads[i] = new_t; - } - } - t = new_t; - } - PUSH_ON_RUN_QUEUE(t); - break; - - case ThreadYielding: - IF_DEBUG(scheduler, - if (t->whatNext == ThreadEnterHugs) { - /* ToDo: or maybe a timer expired when we were in Hugs? - * or maybe someone hit ctrl-C - */ - belch("Thread %ld stopped to switch to Hugs\n", t->id); - } else { - belch("Thread %ld stopped, timer expired\n", t->id); - } - ); - threadPaused(t); - if (interrupted) { - IF_DEBUG(scheduler,belch("Scheduler interrupted - returning")); - deleteThread(t); - while (run_queue_hd != END_TSO_QUEUE) { - run_queue_hd = t->link; - deleteThread(t); - } - run_queue_tl = END_TSO_QUEUE; - /* ToDo: should I do the same with blocked queues? */ - return Interrupted; - } - - /* Put the thread back on the run queue, at the end. - * t->link is already set to END_TSO_QUEUE. - */ - APPEND_TO_RUN_QUEUE(t); - break; - - case ThreadBlocked: - IF_DEBUG(scheduler, - fprintf(stderr, "Thread %d stopped, ", t->id); - printThreadBlockage(t); - fprintf(stderr, "\n")); - threadPaused(t); - /* assume the thread has put itself on some blocked queue - * somewhere. - */ - break; - - case ThreadFinished: - IF_DEBUG(scheduler,fprintf(stderr,"thread %ld finished\n", t->id)); - t->whatNext = ThreadComplete; - break; - - default: - barf("schedule: invalid thread return code"); + /* t is at beginning of thread queue */ + ASSERT(run_queue_hd==t); + run_queue_hd = t->link; } - - /* check for signals each time around the scheduler */ -#ifndef __MINGW32__ - if (signals_pending()) { - start_signal_handlers(); + /* t is at end of thread queue */ + if (t->link==END_TSO_QUEUE) { + ASSERT(t==run_queue_tl); + run_queue_tl = prev; + } else { + ASSERT(run_queue_tl!=t); } -#endif - /* If our main thread has finished or been killed, return. - * If we were re-entered as a result of a _ccall_gc, then - * pop the blocked thread off the ccalling_threads stack back - * into CurrentTSO. - */ - if ((*MainTSO)->whatNext == ThreadComplete - || (*MainTSO)->whatNext == ThreadKilled) { - next_main_thread--; - if (in_ccall_gc) { - CurrentTSO = ccalling_threads; - ccalling_threads = ccalling_threads->link; - /* remember to stub the link field of CurrentTSO */ - CurrentTSO->link = END_TSO_QUEUE; - } - if ((*MainTSO)->whatNext == ThreadComplete) { - /* we finished successfully, fill in the return value */ - if (ret_val) { *ret_val = (StgClosure *)(*MainTSO)->sp[0]; }; - return Success; - } else { - return Killed; + t->link = END_TSO_QUEUE; + } else { + /* take tso from the beginning of the queue; std concurrent code */ + t = run_queue_hd; + if (t != END_TSO_QUEUE) { + run_queue_hd = t->link; + t->link = END_TSO_QUEUE; + if (run_queue_hd == END_TSO_QUEUE) { + run_queue_tl = END_TSO_QUEUE; } } - - next_thread: - /* Checked whether any waiting threads need to be woken up. - * If the run queue is empty, we can wait indefinitely for - * something to happen. - */ - if (blocked_queue_hd != END_TSO_QUEUE) { - awaitEvent(run_queue_hd == END_TSO_QUEUE); - } - - t = POP_RUN_QUEUE(); } - - /* If we got to here, then we ran out of threads to run, but the - * main thread hasn't finished yet. It must be blocked on an MVar - * or a black hole somewhere, so we return deadlock. - */ - return Deadlock; + return t; } -#endif -/* ----------------------------------------------------------------------------- - Debugging: why is a thread blocked - -------------------------------------------------------------------------- */ +#endif /* 0 */ -#ifdef DEBUG -void printThreadBlockage(StgTSO *tso) -{ - switch (tso->why_blocked) { - case BlockedOnRead: - fprintf(stderr,"blocked on read from fd %d", tso->block_info.fd); - break; - case BlockedOnWrite: - fprintf(stderr,"blocked on write to fd %d", tso->block_info.fd); - break; - case BlockedOnDelay: - fprintf(stderr,"blocked on delay of %d ms", tso->block_info.delay); - break; - case BlockedOnMVar: - fprintf(stderr,"blocked on an MVar"); - break; - case BlockedOnBlackHole: - fprintf(stderr,"blocked on a black hole"); - break; - case NotBlocked: - fprintf(stderr,"not blocked"); - break; - } -} -#endif +//@node Garbage Collextion Routines, Blocking Queue Routines, Run queue code, Main scheduling code +//@subsection Garbage Collextion Routines -/* ----------------------------------------------------------------------------- +/* --------------------------------------------------------------------------- Where are the roots that we know about? - all the threads on the runnable queue @@ -1191,7 +1506,7 @@ void printThreadBlockage(StgTSO *tso) - all the thread currently executing a _ccall_GC - all the "main threads" - -------------------------------------------------------------------------- */ + ------------------------------------------------------------------------ */ /* This has to be protected either by the scheduler monitor, or by the garbage collection monitor (probably the latter). @@ -1202,17 +1517,43 @@ static void GetRoots(void) { StgMainThread *m; +#if defined(GRAN) + { + nat i; + for (i=0; i<=RtsFlags.GranFlags.proc; i++) { + if ((run_queue_hds[i] != END_TSO_QUEUE) && ((run_queue_hds[i] != NULL))) + run_queue_hds[i] = (StgTSO *)MarkRoot((StgClosure *)run_queue_hds[i]); + if ((run_queue_tls[i] != END_TSO_QUEUE) && ((run_queue_tls[i] != NULL))) + run_queue_tls[i] = (StgTSO *)MarkRoot((StgClosure *)run_queue_tls[i]); + + if ((blocked_queue_hds[i] != END_TSO_QUEUE) && ((blocked_queue_hds[i] != NULL))) + blocked_queue_hds[i] = (StgTSO *)MarkRoot((StgClosure *)blocked_queue_hds[i]); + if ((blocked_queue_tls[i] != END_TSO_QUEUE) && ((blocked_queue_tls[i] != NULL))) + blocked_queue_tls[i] = (StgTSO *)MarkRoot((StgClosure *)blocked_queue_tls[i]); + if ((ccalling_threadss[i] != END_TSO_QUEUE) && ((ccalling_threadss[i] != NULL))) + ccalling_threadss[i] = (StgTSO *)MarkRoot((StgClosure *)ccalling_threadss[i]); + } + } + + markEventQueue(); + +#else /* !GRAN */ run_queue_hd = (StgTSO *)MarkRoot((StgClosure *)run_queue_hd); run_queue_tl = (StgTSO *)MarkRoot((StgClosure *)run_queue_tl); blocked_queue_hd = (StgTSO *)MarkRoot((StgClosure *)blocked_queue_hd); blocked_queue_tl = (StgTSO *)MarkRoot((StgClosure *)blocked_queue_tl); +#endif for (m = main_threads; m != NULL; m = m->link) { m->tso = (StgTSO *)MarkRoot((StgClosure *)m->tso); } suspended_ccalling_threads = (StgTSO *)MarkRoot((StgClosure *)suspended_ccalling_threads); + +#if defined(SMP) || defined(PAR) || defined(GRAN) + markSparkQueue(); +#endif } /* ----------------------------------------------------------------------------- @@ -1254,9 +1595,10 @@ performGCWithRoots(void (*get_roots)(void)) /* ----------------------------------------------------------------------------- Stack overflow - If the thread has reached its maximum stack size, - then bomb out. Otherwise relocate the TSO into a larger chunk of - memory and adjust its stack size appropriately. + If the thread has reached its maximum stack size, then raise the + StackOverflow exception in the offending thread. Otherwise + relocate the TSO into a larger chunk of memory and adjust its stack + size appropriately. -------------------------------------------------------------------------- */ static StgTSO * @@ -1266,6 +1608,7 @@ threadStackOverflow(StgTSO *tso) StgPtr new_sp; StgTSO *dest; + IF_DEBUG(sanity,checkTSO(tso)); if (tso->stack_size >= tso->max_stack_size) { #if 0 /* If we're debugging, just print out the top of the stack */ @@ -1292,7 +1635,7 @@ threadStackOverflow(StgTSO *tso) new_tso_size = round_to_mblocks(new_tso_size); /* Be MBLOCK-friendly */ new_stack_size = new_tso_size - TSO_STRUCT_SIZEW; - IF_DEBUG(scheduler, fprintf(stderr,"schedule: increasing stack size from %d words to %d.\n", tso->stack_size, new_stack_size)); + IF_DEBUG(scheduler, fprintf(stderr,"scheduler: increasing stack size from %d words to %d.\n", tso->stack_size, new_stack_size)); dest = (StgTSO *)allocate(new_tso_size); TICK_ALLOC_TSO(new_tso_size-sizeofW(StgTSO),0); @@ -1313,14 +1656,15 @@ threadStackOverflow(StgTSO *tso) /* and relocate the update frame list */ relocate_TSO(tso, dest); - /* Mark the old one as dead so we don't try to scavenge it during - * garbage collection (the TSO will likely be on a mutables list in - * some generation, but it'll get collected soon enough). It's - * important to set the sp and su values to just beyond the end of - * the stack, so we don't attempt to scavenge any part of the dead - * TSO's stack. + /* Mark the old TSO as relocated. We have to check for relocated + * TSOs in the garbage collector and any primops that deal with TSOs. + * + * It's important to set the sp and su values to just beyond the end + * of the stack, so we don't attempt to scavenge any part of the + * dead TSO's stack. */ - tso->whatNext = ThreadKilled; + tso->whatNext = ThreadRelocated; + tso->link = dest; tso->sp = (P_)&(tso->stack[tso->stack_size]); tso->su = (StgUpdateFrame *)tso->sp; tso->why_blocked = NotBlocked; @@ -1331,19 +1675,159 @@ threadStackOverflow(StgTSO *tso) IF_DEBUG(scheduler,printTSO(dest)); #endif -#if 0 - /* This will no longer work: KH */ - if (tso == MainTSO) { /* hack */ - MainTSO = dest; - } -#endif return dest; } -/* ----------------------------------------------------------------------------- +//@node Blocking Queue Routines, Exception Handling Routines, Garbage Collextion Routines, Main scheduling code +//@subsection Blocking Queue Routines + +/* --------------------------------------------------------------------------- Wake up a queue that was blocked on some resource. - -------------------------------------------------------------------------- */ + ------------------------------------------------------------------------ */ + +/* ToDo: check push_on_run_queue vs. PUSH_ON_RUN_QUEUE */ + +#if defined(GRAN) +static inline void +unblockCount ( StgBlockingQueueElement *bqe, StgClosure *node ) +{ +} +#elif defined(PAR) +static inline void +unblockCount ( StgBlockingQueueElement *bqe, StgClosure *node ) +{ + /* write RESUME events to log file and + update blocked and fetch time (depending on type of the orig closure) */ + if (RtsFlags.ParFlags.ParStats.Full) { + DumpRawGranEvent(CURRENT_PROC, CURRENT_PROC, + GR_RESUMEQ, ((StgTSO *)bqe), ((StgTSO *)bqe)->block_info.closure, + 0, 0 /* spark_queue_len(ADVISORY_POOL) */); + + switch (get_itbl(node)->type) { + case FETCH_ME_BQ: + ((StgTSO *)bqe)->par.fetchtime += CURRENT_TIME-((StgTSO *)bqe)->par.blockedat; + break; + case RBH: + case FETCH_ME: + case BLACKHOLE_BQ: + ((StgTSO *)bqe)->par.blocktime += CURRENT_TIME-((StgTSO *)bqe)->par.blockedat; + break; + default: + barf("{unblockOneLocked}Daq Qagh: unexpected closure in blocking queue"); + } + } +} +#endif + +#if defined(GRAN) +static StgBlockingQueueElement * +unblockOneLocked(StgBlockingQueueElement *bqe, StgClosure *node) +{ + StgBlockingQueueElement *next; + PEs node_loc, tso_loc; + + node_loc = where_is(node); // should be lifted out of loop + tso = (StgTSO *)bqe; // wastes an assignment to get the type right + tso_loc = where_is(tso); + if (IS_LOCAL_TO(PROCS(node),tso_loc)) { // TSO is local + /* !fake_fetch => TSO is on CurrentProc is same as IS_LOCAL_TO */ + ASSERT(CurrentProc!=node_loc || tso_loc==CurrentProc); + bq_processing_time += RtsFlags.GranFlags.Costs.lunblocktime; + // insertThread(tso, node_loc); + new_event(tso_loc, tso_loc, + CurrentTime[CurrentProc]+bq_processing_time, + ResumeThread, + tso, node, (rtsSpark*)NULL); + tso->link = END_TSO_QUEUE; // overwrite link just to be sure + // len_local++; + // len++; + } else { // TSO is remote (actually should be FMBQ) + bq_processing_time += RtsFlags.GranFlags.Costs.mpacktime; + bq_processing_time += RtsFlags.GranFlags.Costs.gunblocktime; + new_event(tso_loc, CurrentProc, + CurrentTime[CurrentProc]+bq_processing_time+ + RtsFlags.GranFlags.Costs.latency, + UnblockThread, + tso, node, (rtsSpark*)NULL); + tso->link = END_TSO_QUEUE; // overwrite link just to be sure + bq_processing_time += RtsFlags.GranFlags.Costs.mtidytime; + // len++; + } + /* the thread-queue-overhead is accounted for in either Resume or UnblockThread */ + IF_GRAN_DEBUG(bq, + fprintf(stderr," %s TSO %d (%p) [PE %d] (blocked_on=%p) (next=%p) ,", + (node_loc==tso_loc ? "Local" : "Global"), + tso->id, tso, CurrentProc, tso->blocked_on, tso->link)) + tso->blocked_on = NULL; + IF_DEBUG(scheduler,belch("-- Waking up thread %ld (%p)", + tso->id, tso)); + } + + /* if this is the BQ of an RBH, we have to put back the info ripped out of + the closure to make room for the anchor of the BQ */ + if (next!=END_BQ_QUEUE) { + ASSERT(get_itbl(node)->type == RBH && get_itbl(next)->type == CONSTR); + /* + ASSERT((info_ptr==&RBH_Save_0_info) || + (info_ptr==&RBH_Save_1_info) || + (info_ptr==&RBH_Save_2_info)); + */ + /* cf. convertToRBH in RBH.c for writing the RBHSave closure */ + ((StgRBH *)node)->blocking_queue = ((StgRBHSave *)next)->payload[0]; + ((StgRBH *)node)->mut_link = ((StgRBHSave *)next)->payload[1]; + + IF_GRAN_DEBUG(bq, + belch("## Filled in RBH_Save for %p (%s) at end of AwBQ", + node, info_type(node))); + } +} +#elif defined(PAR) +static StgBlockingQueueElement * +unblockOneLocked(StgBlockingQueueElement *bqe, StgClosure *node) +{ + StgBlockingQueueElement *next; + + switch (get_itbl(bqe)->type) { + case TSO: + ASSERT(((StgTSO *)bqe)->why_blocked != NotBlocked); + /* if it's a TSO just push it onto the run_queue */ + next = bqe->link; + // ((StgTSO *)bqe)->link = END_TSO_QUEUE; // debugging? + PUSH_ON_RUN_QUEUE((StgTSO *)bqe); + THREAD_RUNNABLE(); + unblockCount(bqe, node); + /* reset blocking status after dumping event */ + ((StgTSO *)bqe)->why_blocked = NotBlocked; + break; + + case BLOCKED_FETCH: + /* if it's a BLOCKED_FETCH put it on the PendingFetches list */ + next = bqe->link; + bqe->link = PendingFetches; + PendingFetches = bqe; + break; + +# if defined(DEBUG) + /* can ignore this case in a non-debugging setup; + see comments on RBHSave closures above */ + case CONSTR: + /* check that the closure is an RBHSave closure */ + ASSERT(get_itbl((StgClosure *)bqe) == &RBH_Save_0_info || + get_itbl((StgClosure *)bqe) == &RBH_Save_1_info || + get_itbl((StgClosure *)bqe) == &RBH_Save_2_info); + break; + + default: + barf("{unblockOneLocked}Daq Qagh: Unexpected IP (%#lx; %s) in blocking queue at %#lx\n", + get_itbl((StgClosure *)bqe), info_type((StgClosure *)bqe), + (StgClosure *)bqe); +# endif + } + // IF_DEBUG(scheduler,sched_belch("waking up thread %ld", tso->id)); + return next; +} +#else /* !GRAN && !PAR */ static StgTSO * unblockOneLocked(StgTSO *tso) { @@ -1355,15 +1839,30 @@ unblockOneLocked(StgTSO *tso) next = tso->link; PUSH_ON_RUN_QUEUE(tso); THREAD_RUNNABLE(); -#ifdef SMP - IF_DEBUG(scheduler,belch("schedule (task %ld): waking up thread %ld", - pthread_self(), tso->id)); -#else - IF_DEBUG(scheduler,belch("schedule: waking up thread %ld", tso->id)); -#endif + IF_DEBUG(scheduler,sched_belch("waking up thread %ld", tso->id)); return next; } +#endif +#if defined(GRAN) +inline StgTSO * +unblockOne(StgTSO *tso, StgClosure *node) +{ + ACQUIRE_LOCK(&sched_mutex); + tso = unblockOneLocked(tso, node); + RELEASE_LOCK(&sched_mutex); + return tso; +} +#elif defined(PAR) +inline StgTSO * +unblockOne(StgTSO *tso, StgClosure *node) +{ + ACQUIRE_LOCK(&sched_mutex); + tso = unblockOneLocked(tso, node); + RELEASE_LOCK(&sched_mutex); + return tso; +} +#else inline StgTSO * unblockOne(StgTSO *tso) { @@ -1372,7 +1871,99 @@ unblockOne(StgTSO *tso) RELEASE_LOCK(&sched_mutex); return tso; } +#endif + +#if defined(GRAN) +void +awakenBlockedQueue(StgBlockingQueueElement *q, StgClosure *node) +{ + StgBlockingQueueElement *bqe, *next; + StgTSO *tso; + PEs node_loc, tso_loc; + rtsTime bq_processing_time = 0; + nat len = 0, len_local = 0; + + IF_GRAN_DEBUG(bq, + belch("## AwBQ for node %p on PE %d @ %ld by TSO %d (%p): ", \ + node, CurrentProc, CurrentTime[CurrentProc], + CurrentTSO->id, CurrentTSO)); + + node_loc = where_is(node); + + ASSERT(get_itbl(q)->type == TSO || // q is either a TSO or an RBHSave + get_itbl(q)->type == CONSTR); // closure (type constructor) + ASSERT(is_unique(node)); + + /* FAKE FETCH: magically copy the node to the tso's proc; + no Fetch necessary because in reality the node should not have been + moved to the other PE in the first place + */ + if (CurrentProc!=node_loc) { + IF_GRAN_DEBUG(bq, + belch("## node %p is on PE %d but CurrentProc is %d (TSO %d); assuming fake fetch and adjusting bitmask (old: %#x)", + node, node_loc, CurrentProc, CurrentTSO->id, + // CurrentTSO, where_is(CurrentTSO), + node->header.gran.procs)); + node->header.gran.procs = (node->header.gran.procs) | PE_NUMBER(CurrentProc); + IF_GRAN_DEBUG(bq, + belch("## new bitmask of node %p is %#x", + node, node->header.gran.procs)); + if (RtsFlags.GranFlags.GranSimStats.Global) { + globalGranStats.tot_fake_fetches++; + } + } + + bqe = q; + // ToDo: check: ASSERT(CurrentProc==node_loc); + while (get_itbl(bqe)->type==TSO) { // q != END_TSO_QUEUE) { + //next = bqe->link; + /* + bqe points to the current element in the queue + next points to the next element in the queue + */ + //tso = (StgTSO *)bqe; // wastes an assignment to get the type right + //tso_loc = where_is(tso); + bqe = unblockOneLocked(bqe, node); + } + + /* statistics gathering */ + /* ToDo: fix counters + if (RtsFlags.GranFlags.GranSimStats.Global) { + globalGranStats.tot_bq_processing_time += bq_processing_time; + globalGranStats.tot_bq_len += len; // total length of all bqs awakened + globalGranStats.tot_bq_len_local += len_local; // same for local TSOs only + globalGranStats.tot_awbq++; // total no. of bqs awakened + } + IF_GRAN_DEBUG(bq, + fprintf(stderr,"## BQ Stats of %p: [%d entries, %d local] %s\n", + node, len, len_local, (next!=END_TSO_QUEUE) ? "RBH" : "")); + */ +} +#elif defined(PAR) +void +awakenBlockedQueue(StgBlockingQueueElement *q, StgClosure *node) +{ + StgBlockingQueueElement *bqe, *next; + + ACQUIRE_LOCK(&sched_mutex); + + IF_PAR_DEBUG(verbose, + belch("## AwBQ for node %p on [%x]: ", + node, mytid)); + + ASSERT(get_itbl(q)->type == TSO || + get_itbl(q)->type == BLOCKED_FETCH || + get_itbl(q)->type == CONSTR); + + bqe = q; + while (get_itbl(bqe)->type==TSO || + get_itbl(bqe)->type==BLOCKED_FETCH) { + bqe = unblockOneLocked(bqe, node); + } + RELEASE_LOCK(&sched_mutex); +} +#else /* !GRAN && !PAR */ void awakenBlockedQueue(StgTSO *tso) { @@ -1382,11 +1973,15 @@ awakenBlockedQueue(StgTSO *tso) } RELEASE_LOCK(&sched_mutex); } +#endif -/* ----------------------------------------------------------------------------- +//@node Exception Handling Routines, Debugging Routines, Blocking Queue Routines, Main scheduling code +//@subsection Exception Handling Routines + +/* --------------------------------------------------------------------------- Interrupt execution - usually called inside a signal handler so it mustn't do anything fancy. - -------------------------------------------------------------------------- */ + ------------------------------------------------------------------------ */ void interruptStgRts(void) @@ -1400,6 +1995,7 @@ interruptStgRts(void) This is for use when we raise an exception in another thread, which may be blocked. + This has nothing to do with the UnblockThread event in GranSim. -- HWL -------------------------------------------------------------------------- */ static void @@ -1449,17 +2045,43 @@ unblockThread(StgTSO *tso) barf("unblockThread (BLACKHOLE): TSO not found"); } + case BlockedOnException: + { + StgTSO *target = tso->block_info.tso; + + ASSERT(get_itbl(target)->type == TSO); + ASSERT(target->blocked_exceptions != NULL); + + last = &target->blocked_exceptions; + for (t = target->blocked_exceptions; t != END_TSO_QUEUE; + last = &t->link, t = t->link) { + ASSERT(get_itbl(t)->type == TSO); + if (t == tso) { + *last = tso->link; + goto done; + } + } + barf("unblockThread (Exception): TSO not found"); + } + case BlockedOnDelay: case BlockedOnRead: case BlockedOnWrite: { - last = &blocked_queue_hd; + StgTSO *prev = NULL; for (t = blocked_queue_hd; t != END_TSO_QUEUE; - last = &t->link, t = t->link) { + prev = t, t = t->link) { if (t == tso) { - *last = tso->link; - if (blocked_queue_tl == t) { - blocked_queue_tl = tso->link; + if (prev == NULL) { + blocked_queue_hd = t->link; + if (blocked_queue_tl == t) { + blocked_queue_tl = END_TSO_QUEUE; + } + } else { + prev->link = t->link; + if (blocked_queue_tl == t) { + blocked_queue_tl = prev; + } } goto done; } @@ -1528,7 +2150,7 @@ raiseAsync(StgTSO *tso, StgClosure *exception) return; } - IF_DEBUG(scheduler, belch("schedule: Raising exception in thread %ld.", tso->id)); + IF_DEBUG(scheduler, sched_belch("raising exception in thread %ld.", tso->id)); /* Remove it from any blocking queues */ unblockThread(tso); @@ -1548,29 +2170,50 @@ raiseAsync(StgTSO *tso, StgClosure *exception) StgAP_UPD * ap; /* If we find a CATCH_FRAME, and we've got an exception to raise, - * then build PAP(handler,exception), and leave it on top of - * the stack ready to enter. + * then build PAP(handler,exception,realworld#), and leave it on + * top of the stack ready to enter. */ if (get_itbl(su)->type == CATCH_FRAME && exception != NULL) { StgCatchFrame *cf = (StgCatchFrame *)su; /* we've got an exception to raise, so let's pass it to the * handler in this frame. */ - ap = (StgAP_UPD *)allocate(sizeofW(StgPAP) + 1); - TICK_ALLOC_UPD_PAP(2,0); + ap = (StgAP_UPD *)allocate(sizeofW(StgPAP) + 2); + TICK_ALLOC_UPD_PAP(3,0); SET_HDR(ap,&PAP_info,cf->header.prof.ccs); - ap->n_args = 1; - ap->fun = cf->handler; + ap->n_args = 2; + ap->fun = cf->handler; /* :: Exception -> IO a */ ap->payload[0] = (P_)exception; + ap->payload[1] = ARG_TAG(0); /* realworld token */ - /* sp currently points to the word above the CATCH_FRAME on the - * stack. Replace the CATCH_FRAME with a pointer to the new handler - * application. + /* throw away the stack from Sp up to and including the + * CATCH_FRAME. */ - sp += sizeofW(StgCatchFrame); - sp[0] = (W_)ap; + sp = (P_)su + sizeofW(StgCatchFrame) - 1; tso->su = cf->link; + + /* Restore the blocked/unblocked state for asynchronous exceptions + * at the CATCH_FRAME. + * + * If exceptions were unblocked at the catch, arrange that they + * are unblocked again after executing the handler by pushing an + * unblockAsyncExceptions_ret stack frame. + */ + if (!cf->exceptions_blocked) { + *(sp--) = (W_)&unblockAsyncExceptionszh_ret_info; + } + + /* Ensure that async exceptions are blocked when running the handler. + */ + if (tso->blocked_exceptions == NULL) { + tso->blocked_exceptions = END_TSO_QUEUE; + } + + /* Put the newly-built PAP on top of the stack, ready to execute + * when the thread restarts. + */ + sp[0] = (W_)ap; tso->sp = sp; tso->whatNext = ThreadEnterGHC; return; @@ -1599,7 +2242,7 @@ raiseAsync(StgTSO *tso, StgClosure *exception) TICK_ALLOC_UP_THK(words+1,0); IF_DEBUG(scheduler, - fprintf(stderr, "schedule: Updating "); + fprintf(stderr, "scheduler: Updating "); printPtr((P_)su->updatee); fprintf(stderr, " with "); printObj((StgClosure *)ap); @@ -1609,7 +2252,7 @@ raiseAsync(StgTSO *tso, StgClosure *exception) * this will also wake up any threads currently * waiting on the result. */ - UPD_IND(su->updatee,ap); /* revert the black hole */ + UPD_IND_NOLOCK(su->updatee,ap); /* revert the black hole */ su = su->link; sp += sizeofW(StgUpdateFrame) -1; sp[0] = (W_)ap; /* push onto stack */ @@ -1635,7 +2278,7 @@ raiseAsync(StgTSO *tso, StgClosure *exception) o->payload[1] = cf->handler; IF_DEBUG(scheduler, - fprintf(stderr, "schedule: Built "); + fprintf(stderr, "scheduler: Built "); printObj((StgClosure *)o); ); @@ -1661,7 +2304,7 @@ raiseAsync(StgTSO *tso, StgClosure *exception) payloadCPtr(o,0) = (StgClosure *)ap; IF_DEBUG(scheduler, - fprintf(stderr, "schedule: Built "); + fprintf(stderr, "scheduler: Built "); printObj((StgClosure *)o); ); @@ -1688,3 +2331,243 @@ raiseAsync(StgTSO *tso, StgClosure *exception) barf("raiseAsync"); } +//@node Debugging Routines, Index, Exception Handling Routines, Main scheduling code +//@subsection Debugging Routines + +/* ----------------------------------------------------------------------------- + Debugging: why is a thread blocked + -------------------------------------------------------------------------- */ + +#ifdef DEBUG + +void printThreadBlockage(StgTSO *tso) +{ + switch (tso->why_blocked) { + case BlockedOnRead: + fprintf(stderr,"blocked on read from fd %d", tso->block_info.fd); + break; + case BlockedOnWrite: + fprintf(stderr,"blocked on write to fd %d", tso->block_info.fd); + break; + case BlockedOnDelay: + fprintf(stderr,"blocked on delay of %d ms", tso->block_info.delay); + break; + case BlockedOnMVar: + fprintf(stderr,"blocked on an MVar"); + break; + case BlockedOnException: + fprintf(stderr,"blocked on delivering an exception to thread %d", + tso->block_info.tso->id); + break; + case BlockedOnBlackHole: + fprintf(stderr,"blocked on a black hole"); + break; + case NotBlocked: + fprintf(stderr,"not blocked"); + break; +#if defined(PAR) + case BlockedOnGA: + fprintf(stderr,"blocked on global address"); + break; +#endif + } +} + +/* + Print a whole blocking queue attached to node (debugging only). +*/ +//@cindex print_bq +# if defined(PAR) +void +print_bq (StgClosure *node) +{ + StgBlockingQueueElement *bqe; + StgTSO *tso; + rtsBool end; + + fprintf(stderr,"## BQ of closure %p (%s): ", + node, info_type(node)); + + /* should cover all closures that may have a blocking queue */ + ASSERT(get_itbl(node)->type == BLACKHOLE_BQ || + get_itbl(node)->type == FETCH_ME_BQ || + get_itbl(node)->type == RBH); + + ASSERT(node!=(StgClosure*)NULL); // sanity check + /* + NB: In a parallel setup a BQ of an RBH must end with an RBH_Save closure; + */ + for (bqe = ((StgBlockingQueue*)node)->blocking_queue, end = (bqe==END_BQ_QUEUE); + !end; // iterate until bqe points to a CONSTR + end = (get_itbl(bqe)->type == CONSTR) || (bqe->link==END_BQ_QUEUE), bqe = end ? END_BQ_QUEUE : bqe->link) { + ASSERT(bqe != END_BQ_QUEUE); // sanity check + ASSERT(bqe != (StgTSO*)NULL); // sanity check + /* types of closures that may appear in a blocking queue */ + ASSERT(get_itbl(bqe)->type == TSO || + get_itbl(bqe)->type == BLOCKED_FETCH || + get_itbl(bqe)->type == CONSTR); + /* only BQs of an RBH end with an RBH_Save closure */ + ASSERT(get_itbl(bqe)->type != CONSTR || get_itbl(node)->type == RBH); + + switch (get_itbl(bqe)->type) { + case TSO: + fprintf(stderr," TSO %d (%x),", + ((StgTSO *)bqe)->id, ((StgTSO *)bqe)); + break; + case BLOCKED_FETCH: + fprintf(stderr," BF (node=%p, ga=((%x, %d, %x)),", + ((StgBlockedFetch *)bqe)->node, + ((StgBlockedFetch *)bqe)->ga.payload.gc.gtid, + ((StgBlockedFetch *)bqe)->ga.payload.gc.slot, + ((StgBlockedFetch *)bqe)->ga.weight); + break; + case CONSTR: + fprintf(stderr," %s (IP %p),", + (get_itbl(bqe) == &RBH_Save_0_info ? "RBH_Save_0" : + get_itbl(bqe) == &RBH_Save_1_info ? "RBH_Save_1" : + get_itbl(bqe) == &RBH_Save_2_info ? "RBH_Save_2" : + "RBH_Save_?"), get_itbl(bqe)); + break; + default: + barf("Unexpected closure type %s in blocking queue of %p (%s)", + info_type(bqe), node, info_type(node)); + break; + } + } /* for */ + fputc('\n', stderr); +} +# elif defined(GRAN) +void +print_bq (StgClosure *node) +{ + StgBlockingQueueElement *bqe; + StgTSO *tso; + PEs node_loc, tso_loc; + rtsBool end; + + /* should cover all closures that may have a blocking queue */ + ASSERT(get_itbl(node)->type == BLACKHOLE_BQ || + get_itbl(node)->type == FETCH_ME_BQ || + get_itbl(node)->type == RBH); + + ASSERT(node!=(StgClosure*)NULL); // sanity check + node_loc = where_is(node); + + fprintf(stderr,"## BQ of closure %p (%s) on [PE %d]: ", + node, info_type(node), node_loc); + + /* + NB: In a parallel setup a BQ of an RBH must end with an RBH_Save closure; + */ + for (bqe = ((StgBlockingQueue*)node)->blocking_queue, end = (bqe==END_BQ_QUEUE); + !end; // iterate until bqe points to a CONSTR + end = (get_itbl(bqe)->type == CONSTR) || (bqe->link==END_BQ_QUEUE), bqe = end ? END_BQ_QUEUE : bqe->link) { + ASSERT(bqe != END_BQ_QUEUE); // sanity check + ASSERT(bqe != (StgTSO*)NULL); // sanity check + /* types of closures that may appear in a blocking queue */ + ASSERT(get_itbl(bqe)->type == TSO || + get_itbl(bqe)->type == CONSTR); + /* only BQs of an RBH end with an RBH_Save closure */ + ASSERT(get_itbl(bqe)->type != CONSTR || get_itbl(node)->type == RBH); + + tso_loc = where_is((StgClosure *)bqe); + switch (get_itbl(bqe)->type) { + case TSO: + fprintf(stderr," TSO %d (%x) on [PE %d],", + ((StgTSO *)bqe)->id, ((StgTSO *)bqe), tso_loc); + break; + case CONSTR: + fprintf(stderr," %s (IP %p),", + (get_itbl(bqe) == &RBH_Save_0_info ? "RBH_Save_0" : + get_itbl(bqe) == &RBH_Save_1_info ? "RBH_Save_1" : + get_itbl(bqe) == &RBH_Save_2_info ? "RBH_Save_2" : + "RBH_Save_?"), get_itbl(bqe)); + break; + default: + barf("Unexpected closure type %s in blocking queue of %p (%s)", + info_type(bqe), node, info_type(node)); + break; + } + } /* for */ + fputc('\n', stderr); +} +#else +/* + Nice and easy: only TSOs on the blocking queue +*/ +void +print_bq (StgClosure *node) +{ + StgTSO *tso; + + ASSERT(node!=(StgClosure*)NULL); // sanity check + for (tso = ((StgBlockingQueue*)node)->blocking_queue; + tso != END_TSO_QUEUE; + tso=tso->link) { + ASSERT(tso!=NULL && tso!=END_TSO_QUEUE); // sanity check + ASSERT(get_itbl(tso)->type == TSO); // guess what, sanity check + fprintf(stderr," TSO %d (%p),", tso->id, tso); + } + fputc('\n', stderr); +} +# endif + +#if defined(PAR) +static nat +run_queue_len(void) +{ + nat i; + StgTSO *tso; + + for (i=0, tso=run_queue_hd; + tso != END_TSO_QUEUE; + i++, tso=tso->link) + /* nothing */ + + return i; +} +#endif + +static void +sched_belch(char *s, ...) +{ + va_list ap; + va_start(ap,s); +#ifdef SMP + fprintf(stderr, "scheduler (task %ld): ", pthread_self()); +#else + fprintf(stderr, "scheduler: "); +#endif + vfprintf(stderr, s, ap); + fprintf(stderr, "\n"); +} + +#endif /* DEBUG */ + +//@node Index, , Debugging Routines, Main scheduling code +//@subsection Index + +//@index +//* MainRegTable:: @cindex\s-+MainRegTable +//* StgMainThread:: @cindex\s-+StgMainThread +//* awaken_blocked_queue:: @cindex\s-+awaken_blocked_queue +//* blocked_queue_hd:: @cindex\s-+blocked_queue_hd +//* blocked_queue_tl:: @cindex\s-+blocked_queue_tl +//* context_switch:: @cindex\s-+context_switch +//* createThread:: @cindex\s-+createThread +//* free_capabilities:: @cindex\s-+free_capabilities +//* gc_pending_cond:: @cindex\s-+gc_pending_cond +//* initScheduler:: @cindex\s-+initScheduler +//* interrupted:: @cindex\s-+interrupted +//* n_free_capabilities:: @cindex\s-+n_free_capabilities +//* next_thread_id:: @cindex\s-+next_thread_id +//* print_bq:: @cindex\s-+print_bq +//* run_queue_hd:: @cindex\s-+run_queue_hd +//* run_queue_tl:: @cindex\s-+run_queue_tl +//* sched_mutex:: @cindex\s-+sched_mutex +//* schedule:: @cindex\s-+schedule +//* take_off_run_queue:: @cindex\s-+take_off_run_queue +//* task_ids:: @cindex\s-+task_ids +//* term_mutex:: @cindex\s-+term_mutex +//* thread_ready_cond:: @cindex\s-+thread_ready_cond +//@end index