Kernel/threads.c

   1 /*
   2  * Acess2
   3  * threads.c
   4  * - Common Thread Control
   5  */
   6 #include <acess.h>
   7 #include <threads.h>
   8 #include <threads_int.h>
   9 #include <errno.h>
  10 #include <mutex.h>
  11 #include <semaphore.h>
  12 #include <hal_proc.h>
  13
  14 // Configuration
  15 #define DEBUG_TRACE_TICKETS     0       // Trace ticket counts
  16 #define DEBUG_TRACE_STATE       0       // Trace state changes (sleep/wake)
  17 #define SEMAPHORE_DEBUG         0
  18
  19 // --- Schedulers ---
  20 #define SCHED_UNDEF     0
  21 #define SCHED_LOTTERY   1       // Lottery scheduler
  22 #define SCHED_RR_SIM    2       // Single Queue Round Robin
  23 #define SCHED_RR_PRI    3       // Multi Queue Round Robin
  24 // Set scheduler type
  25 #define SCHEDULER_TYPE  SCHED_RR_PRI
  26
  27 // === CONSTANTS ===
  28 #define DEFAULT_QUANTUM 5
  29 #define DEFAULT_PRIORITY        5
  30 #define MIN_PRIORITY            10
  31 const enum eConfigTypes cCONFIG_TYPES[] = {
  32         CFGT_HEAPSTR,   // e.g. CFG_VFS_CWD
  33         CFGT_INT,       // e.g. CFG_VFS_MAXFILES
  34         CFGT_NULL
  35 };
  36
  37 // === IMPORTS ===
  38
  39 // === PROTOTYPES ===
  40 void    Threads_Init(void);
  41 #if 0
  42  int    Threads_SetName(const char *NewName);
  43 #endif
  44 char    *Threads_GetName(int ID);
  45 #if 0
  46 void    Threads_SetPriority(tThread *Thread, int Pri);
  47 tThread *Threads_CloneTCB(Uint *Err, Uint Flags);
  48  int    Threads_WaitTID(int TID, int *status);
  49 tThread *Threads_GetThread(Uint TID);
  50 #endif
  51 void    Threads_AddToDelete(tThread *Thread);
  52 tThread *Threads_int_DelFromQueue(tThread **List, tThread *Thread);
  53 #if 0
  54 void    Threads_Exit(int TID, int Status);
  55 void    Threads_Kill(tThread *Thread, int Status);
  56 void    Threads_Yield(void);
  57 void    Threads_Sleep(void);
  58  int    Threads_Wake(tThread *Thread);
  59 void    Threads_AddActive(tThread *Thread);
  60 tThread *Threads_RemActive(void);
  61 #endif
  62 void    Threads_ToggleTrace(int TID);
  63 void    Threads_Fault(int Num);
  64 void    Threads_SegFault(tVAddr Addr);
  65 #if 0
  66  int    Threads_GetPID(void);
  67  int    Threads_GetTID(void);
  68 tUID    Threads_GetUID(void);
  69 tGID    Threads_GetGID(void);
  70  int    Threads_SetUID(Uint *Errno, tUID ID);
  71  int    Threads_SetGID(Uint *Errno, tUID ID);
  72 #endif
  73 void    Threads_Dump(void);
  74 void    Threads_DumpActive(void);
  75 #if 0
  76  int    Mutex_Acquire(tMutex *Mutex);
  77 void    Mutex_Release(tMutex *Mutex);
  78  int    Mutex_IsLocked(tMutex *Mutex);
  79 #endif
  80
  81 // === GLOBALS ===
  82 // -- Core Thread --
  83 // Only used for the core kernel
  84 tThread gThreadZero = {
  85         .Status         = THREAD_STAT_ACTIVE,   // Status
  86         .ThreadName     = (char*)"ThreadZero",  // Name
  87         .Quantum        = DEFAULT_QUANTUM,      // Default Quantum
  88         .Remaining      = DEFAULT_QUANTUM,      // Current Quantum
  89         .Priority       = DEFAULT_PRIORITY      // Number of tickets
  90         };
  91 // -- Processes --
  92 // --- Locks ---
  93 tShortSpinlock  glThreadListLock;       ///\note NEVER use a heap function while locked
  94 // --- Current State ---
  95 volatile int    giNumActiveThreads = 0; // Number of threads on the active queue
  96 volatile Uint   giNextTID = 1;  // Next TID to allocate
  97 // --- Thread Lists ---
  98 tThread *gAllThreads = NULL;            // All allocated threads
  99 tThread *gSleepingThreads = NULL;       // Sleeping Threads
 100 tThread *gDeleteThreads = NULL;         // Threads to delete
 101  int    giNumCPUs = 1;  // Number of CPUs
 102 BOOL     gaThreads_NoTaskSwitch[MAX_CPUS];      // Disables task switches for each core (Pseudo-IF)
 103 // --- Scheduler Types ---
 104 #if SCHEDULER_TYPE == SCHED_LOTTERY
 105 const int       caiTICKET_COUNTS[MIN_PRIORITY+1] = {100,81,64,49,36,25,16,9,4,1,0};
 106 volatile int    giFreeTickets = 0;      // Number of tickets held by non-scheduled threads
 107 tThread *gActiveThreads = NULL;         // Currently Running Threads
 108 #elif SCHEDULER_TYPE == SCHED_RR_SIM
 109 tThread *gActiveThreads = NULL;         // Currently Running Threads
 110 #elif SCHEDULER_TYPE == SCHED_RR_PRI
 111 tThread *gaActiveThreads[MIN_PRIORITY+1];       // Active threads for each priority level
 112 #else
 113 # error "Unkown scheduler type"
 114 #endif
 115
 116 // === CODE ===
 117 /**
 118  * \fn void Threads_Init(void)
 119  * \brief Initialse the thread list
 120  */
 121 void Threads_Init(void)
 122 {
 123         ArchThreads_Init();
 124
 125         Log_Debug("Threads", "Offsets of tThread");
 126         Log_Debug("Threads", ".Priority = %i", offsetof(tThread, Priority));
 127
 128         // Create Initial Task
 129         #if SCHEDULER_TYPE == SCHED_RR_PRI
 130         gaActiveThreads[gThreadZero.Priority] = &gThreadZero;
 131         #else
 132         gActiveThreads = &gThreadZero;
 133         #endif
 134
 135         gAllThreads = &gThreadZero;
 136         giNumActiveThreads = 1;
 137
 138         Proc_Start();
 139 }
 140
 141 /**
 142  * \fn void Threads_SetName(const char *NewName)
 143  * \brief Sets the current thread's name
 144  * \param NewName       New name for the thread
 145  * \return Boolean Failure
 146  */
 147 int Threads_SetName(const char *NewName)
 148 {
 149         tThread *cur = Proc_GetCurThread();
 150         char    *oldname = cur->ThreadName;
 151
 152         // NOTE: There is a possibility of non-thread safety here
 153         // A thread could read the current name pointer before it is zeroed
 154
 155         cur->ThreadName = NULL;
 156
 157         if( IsHeap(oldname) )   free( oldname );
 158
 159         cur->ThreadName = strdup(NewName);
 160         return 0;
 161 }
 162
 163 /**
 164  * \fn char *Threads_GetName(int ID)
 165  * \brief Gets a thread's name
 166  * \param ID    Thread ID (-1 indicates current thread)
 167  * \return Pointer to name
 168  * \retval NULL Failure
 169  */
 170 char *Threads_GetName(tTID ID)
 171 {
 172         if(ID == -1) {
 173                 return Proc_GetCurThread()->ThreadName;
 174         }
 175         return Threads_GetThread(ID)->ThreadName;
 176 }
 177
 178 /**
 179  * \fn void Threads_SetPriority(tThread *Thread, int Pri)
 180  * \brief Sets the priority of a task
 181  * \param Thread        Thread to update ticket count (NULL means current thread)
 182  * \param Pri   New priority
 183  */
 184 void Threads_SetPriority(tThread *Thread, int Pri)
 185 {
 186         // Get current thread
 187         if(Thread == NULL)      Thread = Proc_GetCurThread();
 188         // Bounds checking
 189         // - If < 0, set to lowest priority
 190         // - Minumum priority is actualy a high number, 0 is highest
 191         if(Pri < 0)     Pri = MIN_PRIORITY;
 192         if(Pri > MIN_PRIORITY)  Pri = MIN_PRIORITY;
 193
 194         // Do we actually have to do anything?
 195         if( Pri == Thread->Priority )   return;
 196
 197         #if SCHEDULER_TYPE == SCHED_RR_PRI
 198         SHORTLOCK( &glThreadListLock );
 199         // Remove from old priority
 200         Threads_int_DelFromQueue( &gaActiveThreads[Thread->Priority], Thread );
 201         // And add to new
 202         Thread->Next = gaActiveThreads[Pri];
 203         gaActiveThreads[Pri] = Thread;
 204         Thread->Priority = Pri;
 205         SHORTREL( &glThreadListLock );
 206         #else
 207         // If this isn't the current thread, we need to lock
 208         if( Thread != Proc_GetCurThread() )
 209         {
 210                 SHORTLOCK( &glThreadListLock );
 211
 212                 #if SCHEDULER_TYPE == SCHED_LOTTERY
 213                 giFreeTickets -= caiTICKET_COUNTS[Thread->Priority] - caiTICKET_COUNTS[Pri];
 214                 # if DEBUG_TRACE_TICKETS
 215                 Log("Threads_SetTickets: new giFreeTickets = %i [-%i+%i]",
 216                         giFreeTickets,
 217                         caiTICKET_COUNTS[Thread->Priority], caiTICKET_COUNTS[Pri]);
 218                 # endif
 219                 #endif
 220                 Thread->Priority = Pri;
 221                 SHORTREL( &glThreadListLock );
 222         }
 223         else
 224                 Thread->Priority = Pri;
 225         #endif
 226
 227         #if DEBUG_TRACE_STATE
 228         Log("Threads_SetPriority: %p(%i %s) pri set %i",
 229                 Thread, Thread->TID, Thread->ThreadName,
 230                 Pri);
 231         #endif
 232 }
 233
 234 /**
 235  * \fn tThread *Threads_CloneTCB(Uint *Err, Uint Flags)
 236  * \brief Clone the TCB of the current thread
 237  * \param Err   Error pointer
 238  * \param Flags Flags for something... (What is this for?)
 239  */
 240 tThread *Threads_CloneTCB(Uint *Err, Uint Flags)
 241 {
 242         tThread *cur, *new;
 243          int    i;
 244         cur = Proc_GetCurThread();
 245
 246         // Allocate and duplicate
 247         new = malloc(sizeof(tThread));
 248         if(new == NULL) { *Err = -ENOMEM; return NULL; }
 249         memcpy(new, cur, sizeof(tThread));
 250
 251         new->CurCPU = -1;
 252         new->Next = NULL;
 253         memset( &new->IsLocked, 0, sizeof(new->IsLocked));
 254         new->Status = THREAD_STAT_PREINIT;
 255         new->RetStatus = 0;
 256
 257         // Get Thread ID
 258         new->TID = giNextTID++;
 259         new->Parent = cur;
 260         new->bInstrTrace = 0;
 261
 262         // Clone Name
 263         new->ThreadName = strdup(cur->ThreadName);
 264
 265         // Set Thread Group ID (PID)
 266         if(Flags & CLONE_VM)
 267                 new->TGID = new->TID;
 268         else
 269                 new->TGID = cur->TGID;
 270
 271         // Messages are not inherited
 272         new->Messages = NULL;
 273         new->LastMessage = NULL;
 274
 275         // Set State
 276         new->Remaining = new->Quantum = cur->Quantum;
 277         new->Priority = cur->Priority;
 278
 279         // Set Signal Handlers
 280         new->CurFaultNum = 0;
 281         new->FaultHandler = cur->FaultHandler;
 282
 283         for( i = 0; i < NUM_CFG_ENTRIES; i ++ )
 284         {
 285                 switch(cCONFIG_TYPES[i])
 286                 {
 287                 default:
 288                         new->Config[i] = cur->Config[i];
 289                         break;
 290                 case CFGT_HEAPSTR:
 291                         if(cur->Config[i])
 292                                 new->Config[i] = (Uint) strdup( (void*)cur->Config[i] );
 293                         else
 294                                 new->Config[i] = 0;
 295                         break;
 296                 }
 297         }
 298
 299         // Maintain a global list of threads
 300         SHORTLOCK( &glThreadListLock );
 301         new->GlobalPrev = NULL; // Protect against bugs
 302         new->GlobalNext = gAllThreads;
 303         gAllThreads->GlobalPrev = new;
 304         gAllThreads = new;
 305         SHORTREL( &glThreadListLock );
 306
 307         return new;
 308 }
 309
 310 /**
 311  * \fn tThread *Threads_CloneTCB(Uint *Err, Uint Flags)
 312  * \brief Clone the TCB of the current thread
 313  */
 314 tThread *Threads_CloneThreadZero(void)
 315 {
 316         tThread *cur, *new;
 317          int    i;
 318         cur = Proc_GetCurThread();
 319
 320         // Allocate and duplicate
 321         new = malloc(sizeof(tThread));
 322         if(new == NULL) {
 323                 return NULL;
 324         }
 325         memcpy(new, &gThreadZero, sizeof(tThread));
 326
 327         new->CurCPU = -1;
 328         new->Next = NULL;
 329         memset( &new->IsLocked, 0, sizeof(new->IsLocked));
 330         new->Status = THREAD_STAT_PREINIT;
 331         new->RetStatus = 0;
 332
 333         // Get Thread ID
 334         new->TID = giNextTID++;
 335         new->Parent = 0;
 336
 337         // Clone Name
 338         new->ThreadName = NULL;
 339
 340         // Messages are not inherited
 341         new->Messages = NULL;
 342         new->LastMessage = NULL;
 343
 344         // Set State
 345         new->Remaining = new->Quantum = cur->Quantum;
 346         new->Priority = cur->Priority;
 347         new->bInstrTrace = 0;
 348
 349         // Set Signal Handlers
 350         new->CurFaultNum = 0;
 351         new->FaultHandler = cur->FaultHandler;
 352
 353         for( i = 0; i < NUM_CFG_ENTRIES; i ++ )
 354         {
 355                 switch(cCONFIG_TYPES[i])
 356                 {
 357                 default:
 358                         new->Config[i] = cur->Config[i];
 359                         break;
 360                 case CFGT_HEAPSTR:
 361                         if(cur->Config[i])
 362                                 new->Config[i] = (Uint) strdup( (void*)cur->Config[i] );
 363                         else
 364                                 new->Config[i] = 0;
 365                         break;
 366                 }
 367         }
 368
 369         // Maintain a global list of threads
 370         SHORTLOCK( &glThreadListLock );
 371         new->GlobalPrev = NULL; // Protect against bugs
 372         new->GlobalNext = gAllThreads;
 373         gAllThreads->GlobalPrev = new;
 374         gAllThreads = new;
 375         SHORTREL( &glThreadListLock );
 376
 377         return new;
 378 }
 379
 380 /**
 381  * \brief Get a configuration pointer from the Per-Thread data area
 382  * \param ID    Config slot ID
 383  * \return Pointer at ID
 384  */
 385 Uint *Threads_GetCfgPtr(int ID)
 386 {
 387         if(ID < 0 || ID >= NUM_CFG_ENTRIES) {
 388                 Warning("Threads_GetCfgPtr: Index %i is out of bounds", ID);
 389                 return NULL;
 390         }
 391
 392         return &Proc_GetCurThread()->Config[ID];
 393 }
 394
 395 /**
 396  * \brief Wait for a task to change state
 397  * \param TID   Thread ID to wait on (-1: Any child thread, 0: Any Child/Sibling, <-1: -PID)
 398  * \param Status        Thread return status
 399  * \return TID of child that changed state
 400  */
 401 tTID Threads_WaitTID(int TID, int *Status)
 402 {
 403         // Any Child
 404         if(TID == -1) {
 405                 Log_Error("Threads", "TODO: Threads_WaitTID(TID=-1) - Any Child");
 406                 return -1;
 407         }
 408
 409         // Any peer/child thread
 410         if(TID == 0) {
 411                 Log_Error("Threads", "TODO: Threads_WaitTID(TID=0) - Any Child/Sibling");
 412                 return -1;
 413         }
 414
 415         // TGID = abs(TID)
 416         if(TID < -1) {
 417                 Log_Error("Threads", "TODO: Threads_WaitTID(TID<0) - TGID");
 418                 return -1;
 419         }
 420
 421         // Specific Thread
 422         if(TID > 0) {
 423                 tThread *t = Threads_GetThread(TID);
 424                  int    initStatus = t->Status;
 425                 tTID    ret;
 426
 427                 // Wait for the thread to die!
 428                 if(initStatus != THREAD_STAT_ZOMBIE) {
 429                         // TODO: Handle child also being suspended if wanted
 430                         while(t->Status != THREAD_STAT_ZOMBIE) {
 431                                 Threads_Sleep();
 432                                 Log_Debug("Threads", "%i waiting for %i, t->Status = %i",
 433                                         Threads_GetTID(), t->TID, t->Status);
 434                         }
 435                 }
 436
 437                 // Set return status
 438                 Log_Debug("Threads", "%i waiting for %i, t->Status = %i",
 439                         Threads_GetTID(), t->TID, t->Status);
 440                 ret = t->TID;
 441                 switch(t->Status)
 442                 {
 443                 case THREAD_STAT_ZOMBIE:
 444                         // Kill the thread
 445                         t->Status = THREAD_STAT_DEAD;
 446                         // TODO: Child return value?
 447                         if(Status)      *Status = t->RetStatus;
 448                         // add to delete queue
 449                         Threads_AddToDelete( t );
 450                         break;
 451                 default:
 452                         if(Status)      *Status = -1;
 453                         break;
 454                 }
 455                 return ret;
 456         }
 457
 458         return -1;
 459 }
 460
 461 /**
 462  * \brief Gets a thread given its TID
 463  * \param TID   Thread ID
 464  * \return Thread pointer
 465  */
 466 tThread *Threads_GetThread(Uint TID)
 467 {
 468         tThread *thread;
 469
 470         // Search global list
 471         for(thread = gAllThreads;
 472                 thread;
 473                 thread = thread->GlobalNext)
 474         {
 475                 if(thread->TID == TID)
 476                         return thread;
 477         }
 478
 479         Log("Unable to find TID %i on main list\n", TID);
 480
 481         return NULL;
 482 }
 483
 484 /**
 485  * \brief Adds a thread to the delete queue
 486  * \param Thread        Thread to delete
 487  */
 488 void Threads_AddToDelete(tThread *Thread)
 489 {
 490         // Add to delete queue
 491         // TODO: Is locking needed?
 492         if(gDeleteThreads) {
 493                 Thread->Next = gDeleteThreads;
 494                 gDeleteThreads = Thread;
 495         } else {
 496                 Thread->Next = NULL;
 497                 gDeleteThreads = Thread;
 498         }
 499 }
 500
 501 /**
 502  * \brief Deletes an entry from a list
 503  * \param List  Pointer to the list head
 504  * \param Thread        Thread to find
 505  * \return \a Thread
 506  */
 507 tThread *Threads_int_DelFromQueue(tThread **List, tThread *Thread)
 508 {
 509         tThread *ret, *prev = NULL;
 510
 511         for(ret = *List;
 512                 ret && ret != Thread;
 513                 prev = ret, ret = ret->Next
 514                 );
 515
 516         // Is the thread on the list
 517         if(!ret) {
 518                 //LogF("%p(%s) is not on list %p\n", Thread, Thread->ThreadName, List);
 519                 return NULL;
 520         }
 521
 522         if( !prev ) {
 523                 *List = Thread->Next;
 524                 //LogF("%p(%s) removed from head of %p\n", Thread, Thread->ThreadName, List);
 525         }
 526         else {
 527                 prev->Next = Thread->Next;
 528                 //LogF("%p(%s) removed from %p (prev=%p)\n", Thread, Thread->ThreadName, List, prev);
 529         }
 530
 531         return Thread;
 532 }
 533
 534 /**
 535  * \brief Exit the current process (or another?)
 536  * \param TID   Thread ID to kill
 537  * \param Status        Exit status
 538  */
 539 void Threads_Exit(int TID, int Status)
 540 {
 541         if( TID == 0 )
 542                 Threads_Kill( Proc_GetCurThread(), (Uint)Status & 0xFF );
 543         else
 544                 Threads_Kill( Threads_GetThread(TID), (Uint)Status & 0xFF );
 545
 546         // Halt forever, just in case
 547         for(;;) HALT();
 548 }
 549
 550 /**
 551  * \fn void Threads_Kill(tThread *Thread, int Status)
 552  * \brief Kill a thread
 553  * \param Thread        Thread to kill
 554  * \param Status        Status code to return to the parent
 555  */
 556 void Threads_Kill(tThread *Thread, int Status)
 557 {
 558         tMsg    *msg;
 559          int    isCurThread = Thread == Proc_GetCurThread();
 560
 561         // TODO: Kill all children
 562         #if 1
 563         {
 564                 tThread *child;
 565                 // TODO: I should keep a .Parent pointer, and a .Children list
 566                 for(child = gAllThreads;
 567                         child;
 568                         child = child->GlobalNext)
 569                 {
 570                         if(child->Parent == Thread)
 571                                 Threads_Kill(child, -1);
 572                 }
 573         }
 574         #endif
 575
 576         ///\note Double lock is needed due to overlap of lock areas
 577
 578         // Lock thread (stop us recieving messages)
 579         SHORTLOCK( &Thread->IsLocked );
 580
 581         // Clear Message Queue
 582         while( Thread->Messages )
 583         {
 584                 msg = Thread->Messages->Next;
 585                 free( Thread->Messages );
 586                 Thread->Messages = msg;
 587         }
 588
 589         // Lock thread list
 590         SHORTLOCK( &glThreadListLock );
 591
 592         switch(Thread->Status)
 593         {
 594         case THREAD_STAT_PREINIT:       // Only on main list
 595                 break;
 596
 597         // Currently active thread
 598         case THREAD_STAT_ACTIVE:
 599                 #if SCHEDULER_TYPE == SCHED_RR_PRI
 600                 if( Threads_int_DelFromQueue( &gaActiveThreads[Thread->Priority], Thread ) )
 601                 #else
 602                 if( Threads_int_DelFromQueue( &gActiveThreads, Thread ) )
 603                 #endif
 604                 {
 605                         // Ensure that we are not rescheduled
 606                         Thread->Remaining = 0;  // Clear Remaining Quantum
 607                         Thread->Quantum = 0;    // Clear Quantum to indicate dead thread
 608
 609                         // Update bookkeeping
 610                         giNumActiveThreads --;
 611                         #if SCHEDULER_TYPE == SCHED_LOTTERY
 612                         if( Thread != Proc_GetCurThread() )
 613                                 giFreeTickets -= caiTICKET_COUNTS[ Thread->Priority ];
 614                         #endif
 615                 }
 616                 else
 617                 {
 618                         Log_Warning("Threads",
 619                                 "Threads_Kill - Thread %p(%i,%s) marked as active, but not on list",
 620                                 Thread, Thread->TID, Thread->ThreadName
 621                                 );
 622                 }
 623                 break;
 624         // Kill it while it sleeps!
 625         case THREAD_STAT_SLEEPING:
 626                 if( !Threads_int_DelFromQueue( &gSleepingThreads, Thread ) )
 627                 {
 628                         Log_Warning("Threads",
 629                                 "Threads_Kill - Thread %p(%i,%s) marked as sleeping, but not on list",
 630                                 Thread, Thread->TID, Thread->ThreadName
 631                                 );
 632                 }
 633                 break;
 634
 635         // Brains!... You cannot kill
 636         case THREAD_STAT_ZOMBIE:
 637                 Log_Warning("Threads", "Threads_Kill - Thread %p(%i,%s) is undead, you cannot kill it",
 638                         Thread, Thread->TID, Thread->ThreadName);
 639                 SHORTREL( &glThreadListLock );
 640                 SHORTREL( &Thread->IsLocked );
 641                 return ;
 642
 643         default:
 644                 Log_Warning("Threads", "Threads_Kill - BUG Un-checked status (%i)",
 645                         Thread->Status);
 646                 break;
 647         }
 648
 649         // Save exit status
 650         Thread->RetStatus = Status;
 651
 652         // Don't Zombie if we are being killed because our parent is
 653         if(Status == -1)
 654         {
 655                 Thread->Status = THREAD_STAT_DEAD;
 656                 Threads_AddToDelete( Thread );
 657         } else {
 658                 Thread->Status = THREAD_STAT_ZOMBIE;
 659                 // Wake parent
 660                 Threads_Wake( Thread->Parent );
 661         }
 662
 663         Log("Thread %i went *hurk* (%i)", Thread->TID, Status);
 664
 665         // Release spinlocks
 666         SHORTREL( &glThreadListLock );
 667         SHORTREL( &Thread->IsLocked );  // TODO: We may not actually be released...
 668
 669         // And, reschedule
 670         if(isCurThread) {
 671                 for( ;; )
 672                         HALT();
 673         }
 674 }
 675
 676 /**
 677  * \brief Yield remainder of the current thread's timeslice
 678  */
 679 void Threads_Yield(void)
 680 {
 681         tThread *thread = Proc_GetCurThread();
 682         thread->Remaining = 0;
 683         //while(thread->Remaining == 0)
 684                 HALT();
 685 }
 686
 687 /**
 688  * \fn void Threads_Sleep(void)
 689  * \brief Take the current process off the run queue
 690  */
 691 void Threads_Sleep(void)
 692 {
 693         tThread *cur = Proc_GetCurThread();
 694
 695         // Acquire Spinlock
 696         SHORTLOCK( &glThreadListLock );
 697
 698         // Don't sleep if there is a message waiting
 699         if( cur->Messages ) {
 700                 SHORTREL( &glThreadListLock );
 701                 return;
 702         }
 703
 704         // Remove us from running queue
 705         Threads_RemActive();
 706         // Mark thread as sleeping
 707         cur->Status = THREAD_STAT_SLEEPING;
 708
 709         // Add to Sleeping List (at the top)
 710         cur->Next = gSleepingThreads;
 711         gSleepingThreads = cur;
 712
 713
 714         #if DEBUG_TRACE_STATE
 715         Log("Threads_Sleep: %p (%i %s) sleeping", cur, cur->TID, cur->ThreadName);
 716         #endif
 717
 718         // Release Spinlock
 719         SHORTREL( &glThreadListLock );
 720
 721         while(cur->Status != THREAD_STAT_ACTIVE)        HALT();
 722 }
 723
 724
 725 /**
 726  * \fn int Threads_Wake( tThread *Thread )
 727  * \brief Wakes a sleeping/waiting thread up
 728  * \param Thread        Thread to wake
 729  * \return Boolean Failure (Returns ERRNO)
 730  * \warning This should ONLY be called with task switches disabled
 731  */
 732 int Threads_Wake(tThread *Thread)
 733 {
 734         if(!Thread)
 735                 return -EINVAL;
 736
 737         switch(Thread->Status)
 738         {
 739         case THREAD_STAT_ACTIVE:
 740                 Log("Threads_Wake - Waking awake thread (%i)", Thread->TID);
 741                 return -EALREADY;
 742
 743         case THREAD_STAT_SLEEPING:
 744                 SHORTLOCK( &glThreadListLock );
 745                 // Remove from sleeping queue
 746                 Threads_int_DelFromQueue(&gSleepingThreads, Thread);
 747
 748                 Threads_AddActive( Thread );
 749
 750                 #if DEBUG_TRACE_STATE
 751                 Log("Threads_Sleep: %p (%i %s) woken", Thread, Thread->TID, Thread->ThreadName);
 752                 #endif
 753                 SHORTREL( &glThreadListLock );
 754                 return -EOK;
 755
 756         case THREAD_STAT_SEMAPHORESLEEP: {
 757                 tSemaphore      *sem;
 758                 tThread *th, *prev=NULL;
 759
 760                 sem = Thread->WaitPointer;
 761
 762                 SHORTLOCK( &sem->Protector );
 763
 764                 // Remove from sleeping queue
 765                 for( th = sem->Waiting; th; prev = th, th = th->Next )
 766                         if( th == Thread )      break;
 767                 if( th )
 768                 {
 769                         if(prev)
 770                                 prev->Next = Thread->Next;
 771                         else
 772                                 sem->Waiting = Thread->Next;
 773                         if(sem->LastWaiting == Thread)
 774                                 sem->LastWaiting = prev;
 775                 }
 776                 else
 777                 {
 778                         prev = NULL;
 779                         for( th = sem->Signaling; th; prev = th, th = th->Next )
 780                                 if( th == Thread )      break;
 781                         if( !th ) {
 782                                 Log_Warning("Threads", "Thread %p(%i %s) is not on semaphore %p(%s:%s)",
 783                                         Thread, Thread->TID, Thread->ThreadName,
 784                                         sem, sem->ModName, sem->Name);
 785                                 return -EINTERNAL;
 786                         }
 787
 788                         if(prev)
 789                                 prev->Next = Thread->Next;
 790                         else
 791                                 sem->Signaling = Thread->Next;
 792                         if(sem->LastSignaling == Thread)
 793                                 sem->LastSignaling = prev;
 794                 }
 795
 796                 SHORTLOCK( &glThreadListLock );
 797                 Threads_AddActive( Thread );
 798                 SHORTREL( &glThreadListLock );
 799
 800                 #if DEBUG_TRACE_STATE
 801                 Log("Threads_Sleep: %p(%i %s) woken from semaphore", Thread, Thread->TID, Thread->ThreadName);
 802                 #endif
 803                 SHORTREL( &sem->Protector );
 804                 } return -EOK;
 805
 806         case THREAD_STAT_WAITING:
 807                 Warning("Threads_Wake - Waiting threads are not currently supported");
 808                 return -ENOTIMPL;
 809
 810         case THREAD_STAT_DEAD:
 811                 Warning("Threads_Wake - Attempt to wake dead thread (%i)", Thread->TID);
 812                 return -ENOTIMPL;
 813
 814         default:
 815                 Warning("Threads_Wake - Unknown process status (%i)\n", Thread->Status);
 816                 return -EINTERNAL;
 817         }
 818 }
 819
 820 /**
 821  * \brief Wake a thread given the TID
 822  * \param TID   Thread ID to wake
 823  * \return Boolean Faulure (errno)
 824  */
 825 int Threads_WakeTID(tTID TID)
 826 {
 827         tThread *thread = Threads_GetThread(TID);
 828          int    ret;
 829         if(!thread)
 830                 return -ENOENT;
 831         ret = Threads_Wake( thread );
 832         //Log_Debug("Threads", "TID %i woke %i (%p)", Threads_GetTID(), TID, thread);
 833         return ret;
 834 }
 835
 836 void Threads_ToggleTrace(int TID)
 837 {
 838         tThread *thread = Threads_GetThread(TID);
 839         if(!thread)     return ;
 840         thread->bInstrTrace = !thread->bInstrTrace;
 841 }
 842
 843 /**
 844  * \brief Adds a thread to the active queue
 845  */
 846 void Threads_AddActive(tThread *Thread)
 847 {
 848         SHORTLOCK( &glThreadListLock );
 849
 850         if( Thread->Status == THREAD_STAT_ACTIVE ) {
 851                 tThread *cur = Proc_GetCurThread();
 852                 Warning("WTF, CPU%i %p (%i %s) is adding %p (%i %s) when it is active",
 853                         GetCPUNum(), cur, cur->TID, cur->ThreadName, Thread, Thread->TID, Thread->ThreadName);
 854                 SHORTREL( &glThreadListLock );
 855                 return ;
 856         }
 857
 858         // Set state
 859         Thread->Status = THREAD_STAT_ACTIVE;
 860 //      Thread->CurCPU = -1;
 861         // Add to active list
 862         {
 863                 tThread *tmp, *prev = NULL;
 864                 #if SCHEDULER_TYPE == SCHED_RR_PRI
 865                 for( tmp = gaActiveThreads[Thread->Priority]; tmp; prev = tmp, tmp = tmp->Next );
 866                 if(prev)
 867                         prev->Next = Thread;
 868                 else
 869                         gaActiveThreads[Thread->Priority] = Thread;
 870                 #else
 871                 for( tmp = gActiveThreads; tmp; prev = tmp, tmp = tmp->Next );
 872                 if(prev)
 873                         prev->Next = Thread;
 874                 else
 875                         gActiveThreads = Thread;
 876                 #endif
 877                 Thread->Next = NULL;
 878         }
 879
 880         // Update bookkeeping
 881         giNumActiveThreads ++;
 882
 883         #if SCHEDULER_TYPE == SCHED_LOTTERY
 884         {
 885                  int    delta;
 886                 // Only change the ticket count if the thread is un-scheduled
 887                 if(Thread->CurCPU != -1)
 888                         delta = 0;
 889                 else
 890                         delta = caiTICKET_COUNTS[ Thread->Priority ];
 891
 892                 giFreeTickets += delta;
 893                 # if DEBUG_TRACE_TICKETS
 894                 Log("CPU%i %p (%i %s) added, new giFreeTickets = %i [+%i]",
 895                         GetCPUNum(), Thread, Thread->TID, Thread->ThreadName,
 896                         giFreeTickets, delta
 897                         );
 898                 # endif
 899         }
 900         #endif
 901
 902         SHORTREL( &glThreadListLock );
 903 }
 904
 905 /**
 906  * \brief Removes the current thread from the active queue
 907  * \warning This should ONLY be called with task switches disabled
 908  * \return Current thread pointer
 909  */
 910 tThread *Threads_RemActive(void)
 911 {
 912         tThread *ret = Proc_GetCurThread();
 913
 914         SHORTLOCK( &glThreadListLock );
 915
 916         // Delete from active queue
 917         #if SCHEDULER_TYPE == SCHED_RR_PRI
 918         if( !Threads_int_DelFromQueue(&gaActiveThreads[ret->Priority], ret) )
 919         #else
 920         if( !Threads_int_DelFromQueue(&gActiveThreads, ret) )
 921         #endif
 922         {
 923                 SHORTREL( &glThreadListLock );
 924                 Log_Warning("Threads", "Current thread %p(%i %s) is not on active queue",
 925                         ret, ret->TID, ret->ThreadName
 926                         );
 927                 return NULL;
 928         }
 929
 930         ret->Next = NULL;
 931         ret->Remaining = 0;
 932
 933         giNumActiveThreads --;
 934         // no need to decrement tickets, scheduler did it for us
 935
 936         #if SCHEDULER_TYPE == SCHED_LOTTERY && DEBUG_TRACE_TICKETS
 937         Log("CPU%i %p (%i %s) removed, giFreeTickets = %i [nc]",
 938                 GetCPUNum(), ret, ret->TID, ret->ThreadName, giFreeTickets);
 939         #endif
 940
 941         SHORTREL( &glThreadListLock );
 942
 943         return ret;
 944 }
 945
 946 /**
 947  * \fn void Threads_SetFaultHandler(Uint Handler)
 948  * \brief Sets the signal handler for a signal
 949  */
 950 void Threads_SetFaultHandler(Uint Handler)
 951 {
 952         //Log_Debug("Threads", "Threads_SetFaultHandler: Handler = %p", Handler);
 953         Proc_GetCurThread()->FaultHandler = Handler;
 954 }
 955
 956 /**
 957  * \fn void Threads_Fault(int Num)
 958  * \brief Calls a fault handler
 959  */
 960 void Threads_Fault(int Num)
 961 {
 962         tThread *thread = Proc_GetCurThread();
 963
 964         if(!thread)     return ;
 965
 966         Log_Log("Threads", "Threads_Fault: thread->FaultHandler = %p", thread->FaultHandler);
 967
 968         switch(thread->FaultHandler)
 969         {
 970         case 0: // Panic?
 971                 Threads_Kill(thread, -1);
 972                 HALT();
 973                 return ;
 974         case 1: // Dump Core?
 975                 Threads_Kill(thread, -1);
 976                 HALT();
 977                 return ;
 978         }
 979
 980         // Double Fault? Oh, F**k
 981         if(thread->CurFaultNum != 0) {
 982                 Threads_Kill(thread, -1);       // For now, just kill
 983                 HALT();
 984         }
 985
 986         thread->CurFaultNum = Num;
 987
 988         Proc_CallFaultHandler(thread);
 989 }
 990
 991 extern void     MM_DumpTables(tVAddr Start, tVAddr End);
 992
 993 /**
 994  * \fn void Threads_SegFault(tVAddr Addr)
 995  * \brief Called when a Segment Fault occurs
 996  */
 997 void Threads_SegFault(tVAddr Addr)
 998 {
 999         Log_Warning("Threads", "Thread #%i committed a segfault at address %p", Proc_GetCurThread()->TID, Addr);
1000         MM_DumpTables(0, 0xC0000000);
1001         Threads_Fault( 1 );
1002         //Threads_Exit( 0, -1 );
1003 }
1004
1005 // --- Process Structure Access Functions ---
1006 tPID Threads_GetPID(void)
1007 {
1008         return Proc_GetCurThread()->TGID;
1009 }
1010 tTID Threads_GetTID(void)
1011 {
1012         return Proc_GetCurThread()->TID;
1013 }
1014 tUID Threads_GetUID(void)
1015 {
1016         return Proc_GetCurThread()->UID;
1017 }
1018 tGID Threads_GetGID(void)
1019 {
1020         return Proc_GetCurThread()->GID;
1021 }
1022
1023 int Threads_SetUID(Uint *Errno, tUID ID)
1024 {
1025         tThread *t = Proc_GetCurThread();
1026         if( t->UID != 0 ) {
1027                 *Errno = -EACCES;
1028                 return -1;
1029         }
1030         Log_Debug("Threads", "TID %i's UID set to %i", t->TID, ID);
1031         t->UID = ID;
1032         return 0;
1033 }
1034
1035 int Threads_SetGID(Uint *Errno, tGID ID)
1036 {
1037         tThread *t = Proc_GetCurThread();
1038         if( t->UID != 0 ) {
1039                 *Errno = -EACCES;
1040                 return -1;
1041         }
1042         Log_Debug("Threads", "TID %i's GID set to %i", t->TID, ID);
1043         t->GID = ID;
1044         return 0;
1045 }
1046
1047 /**
1048  * \fn void Threads_Dump(void)
1049  */
1050 void Threads_DumpActive(void)
1051 {
1052         tThread *thread;
1053         #if SCHEDULER_TYPE == SCHED_RR_PRI
1054          int    i;
1055         #endif
1056
1057         Log("Active Threads: (%i reported)", giNumActiveThreads);
1058
1059         #if SCHEDULER_TYPE == SCHED_RR_PRI
1060         for( i = 0; i < MIN_PRIORITY+1; i++ )
1061         {
1062                 for(thread=gaActiveThreads[i];thread;thread=thread->Next)
1063         #else
1064                 for(thread=gActiveThreads;thread;thread=thread->Next)
1065         #endif
1066                 {
1067                         Log(" %p %i (%i) - %s (CPU %i)",
1068                                 thread, thread->TID, thread->TGID, thread->ThreadName, thread->CurCPU);
1069                         if(thread->Status != THREAD_STAT_ACTIVE)
1070                                 Log("  ERROR State (%i) != THREAD_STAT_ACTIVE (%i)", thread->Status, THREAD_STAT_ACTIVE);
1071                         Log("  Priority %i, Quantum %i", thread->Priority, thread->Quantum);
1072                         Log("  KStack 0x%x", thread->KernelStack);
1073                         if( thread->bInstrTrace )
1074                                 Log("  Tracing Enabled");
1075                         Proc_DumpThreadCPUState(thread);
1076                 }
1077
1078         #if SCHEDULER_TYPE == SCHED_RR_PRI
1079         }
1080         #endif
1081 }
1082
1083 /**
1084  * \fn void Threads_Dump(void)
1085  * \brief Dumps a list of currently running threads
1086  */
1087 void Threads_Dump(void)
1088 {
1089         tThread *thread;
1090
1091         Log("--- Thread Dump ---");
1092         Threads_DumpActive();
1093
1094         Log("All Threads:");
1095         for(thread=gAllThreads;thread;thread=thread->GlobalNext)
1096         {
1097                 Log(" %p %i (%i) - %s (CPU %i)",
1098                         thread, thread->TID, thread->TGID, thread->ThreadName, thread->CurCPU);
1099                 Log("  State %i (%s)", thread->Status, casTHREAD_STAT[thread->Status]);
1100                 switch(thread->Status)
1101                 {
1102                 case THREAD_STAT_MUTEXSLEEP:
1103                         Log("  Mutex Pointer: %p", thread->WaitPointer);
1104                         break;
1105                 case THREAD_STAT_SEMAPHORESLEEP:
1106                         Log("  Semaphore Pointer: %p", thread->WaitPointer);
1107                         Log("  Semaphore Name: %s:%s",
1108                                 ((tSemaphore*)thread->WaitPointer)->ModName,
1109                                 ((tSemaphore*)thread->WaitPointer)->Name
1110                                 );
1111                         break;
1112                 case THREAD_STAT_ZOMBIE:
1113                         Log("  Return Status: %i", thread->RetStatus);
1114                         break;
1115                 default:        break;
1116                 }
1117                 Log("  Priority %i, Quantum %i", thread->Priority, thread->Quantum);
1118                 Log("  KStack 0x%x", thread->KernelStack);
1119                 if( thread->bInstrTrace )
1120                         Log("  Tracing Enabled");
1121                 Proc_DumpThreadCPUState(thread);
1122         }
1123 }
1124
1125 /**
1126  * \brief Gets the next thread to run
1127  * \param CPU   Current CPU
1128  * \param Last  The thread the CPU was running
1129  */
1130 tThread *Threads_GetNextToRun(int CPU, tThread *Last)
1131 {
1132         tThread *thread;
1133
1134         // If this CPU has the lock, we must let it complete
1135         if( CPU_HAS_LOCK( &glThreadListLock ) )
1136                 return Last;
1137
1138         // Don't change threads if the current CPU has switches disabled
1139         if( gaThreads_NoTaskSwitch[CPU] )
1140                 return Last;
1141
1142
1143         // Lock thread list
1144         SHORTLOCK( &glThreadListLock );
1145
1146         // Clear Delete Queue
1147         // - I should probably put this in a worker thread to avoid calling free() in the scheduler
1148         //   DEFINITELY - free() can deadlock in this case
1149         //   I'll do it when it becomes an issue
1150         while(gDeleteThreads)
1151         {
1152                 thread = gDeleteThreads->Next;
1153                 // Only free if structure is unused
1154                 if( !IS_LOCKED(&gDeleteThreads->IsLocked) )
1155                 {
1156                         // Set to dead
1157                         gDeleteThreads->Status = THREAD_STAT_BURIED;
1158                         // Free name
1159                         if( IsHeap(gDeleteThreads->ThreadName) )
1160                                 free(gDeleteThreads->ThreadName);
1161                         // Remove from global list
1162                         if( gDeleteThreads == gAllThreads )
1163                                 gAllThreads = gDeleteThreads->GlobalNext;
1164                         else
1165                                 gDeleteThreads->GlobalPrev->GlobalNext = gDeleteThreads->GlobalNext;
1166                         free( gDeleteThreads );
1167                 }
1168                 gDeleteThreads = thread;
1169         }
1170
1171         // Make sure the current (well, old) thread is marked as de-scheduled
1172         if(Last)        Last->CurCPU = -1;
1173
1174         // No active threads, just take a nap
1175         if(giNumActiveThreads == 0) {
1176                 SHORTREL( &glThreadListLock );
1177                 #if DEBUG_TRACE_TICKETS
1178                 Log("No active threads");
1179                 #endif
1180                 return NULL;
1181         }
1182
1183         #if SCHEDULER_TYPE != SCHED_RR_PRI
1184         // Special case: 1 thread
1185         if(giNumActiveThreads == 1) {
1186                 if( gActiveThreads->CurCPU == -1 )
1187                         gActiveThreads->CurCPU = CPU;
1188
1189                 SHORTREL( &glThreadListLock );
1190
1191                 if( gActiveThreads->CurCPU == CPU )
1192                         return gActiveThreads;
1193
1194                 return NULL;    // CPU has nothing to do
1195         }
1196         #endif
1197
1198         // Allow the old thread to be scheduled again
1199         if( Last ) {
1200                 if( Last->Status == THREAD_STAT_ACTIVE ) {
1201                         #if SCHEDULER_TYPE == SCHED_LOTTERY
1202                         giFreeTickets += caiTICKET_COUNTS[ Last->Priority ];
1203                         # if DEBUG_TRACE_TICKETS
1204                         LogF("Log: CPU%i released %p (%i %s) into the pool (%i [+%i] tickets in pool)\n",
1205                                 CPU, Last, Last->TID, Last->ThreadName, giFreeTickets,
1206                                 caiTICKET_COUNTS[ Last->Priority ]);
1207                         # endif
1208                         #endif
1209                 }
1210                 #if SCHEDULER_TYPE == SCHED_LOTTERY && DEBUG_TRACE_TICKETS
1211                 else
1212                         LogF("Log: CPU%i released %p (%i %s)->Status = %i (Released,not in pool)\n",
1213                                 CPU, Last, Last->TID, Last->ThreadName, Last->Status);
1214                 #endif
1215                 Last->CurCPU = -1;
1216         }
1217
1218         // ---
1219         // Lottery Scheduler
1220         // ---
1221         #if SCHEDULER_TYPE == SCHED_LOTTERY
1222         {
1223                  int    ticket, number;
1224                 # if 1
1225                 number = 0;
1226                 for(thread = gActiveThreads; thread; thread = thread->Next) {
1227                         if(thread->CurCPU >= 0) continue;
1228                         if(thread->Status != THREAD_STAT_ACTIVE)
1229                                 Panic("Bookkeeping fail - %p %i(%s) is on the active queue with a status of %i",
1230                                         thread, thread->TID, thread->ThreadName, thread->Status);
1231                         if(thread->Next == thread) {
1232                                 Panic("Bookkeeping fail - %p %i(%s) loops back on itself",
1233                                         thread, thread->TID, thread->ThreadName, thread->Status);
1234                         }
1235                         number += caiTICKET_COUNTS[ thread->Priority ];
1236                 }
1237                 if(number != giFreeTickets) {
1238                         Panic("Bookkeeping fail (giFreeTickets(%i) != number(%i)) - CPU%i",
1239                                 giFreeTickets, number, CPU);
1240                 }
1241                 # endif
1242
1243                 // No free tickets (all tasks delegated to cores)
1244                 if( giFreeTickets == 0 ) {
1245                         SHORTREL(&glThreadListLock);
1246                         return NULL;
1247                 }
1248
1249                 // Get the ticket number
1250                 ticket = number = rand() % giFreeTickets;
1251
1252                 // Find the next thread
1253                 for(thread=gActiveThreads;thread;thread=thread->Next)
1254                 {
1255                         if(thread->CurCPU >= 0) continue;
1256                         if( caiTICKET_COUNTS[ thread->Priority ] > number)      break;
1257                         number -= caiTICKET_COUNTS[ thread->Priority ];
1258                 }
1259
1260                 // If we didn't find a thread, something went wrong
1261                 if(thread == NULL)
1262                 {
1263                         number = 0;
1264                         for(thread=gActiveThreads;thread;thread=thread->Next) {
1265                                 if(thread->CurCPU >= 0) continue;
1266                                 number += caiTICKET_COUNTS[ thread->Priority ];
1267                         }
1268                         Panic("Bookeeping Failed - giFreeTickets(%i) > true count (%i)",
1269                                 giFreeTickets, number);
1270                 }
1271
1272                 giFreeTickets -= caiTICKET_COUNTS[ thread->Priority ];
1273                 # if DEBUG_TRACE_TICKETS
1274                 LogF("Log: CPU%i allocated %p (%i %s), (%i [-%i] tickets in pool), \n",
1275                         CPU, thread, thread->TID, thread->ThreadName,
1276                         giFreeTickets, caiTICKET_COUNTS[ thread->Priority ]);
1277                 # endif
1278         }
1279
1280         // ---
1281         // Priority based round robin scheduler
1282         // ---
1283         #elif SCHEDULER_TYPE == SCHED_RR_PRI
1284         {
1285                  int    i;
1286                 for( i = 0; i < MIN_PRIORITY + 1; i ++ )
1287                 {
1288                         for(thread = gaActiveThreads[i]; thread; thread = thread->Next)
1289                         {
1290                                 if( thread->CurCPU == -1 )      break;
1291                         }
1292                         // If we fall onto the same queue again, special handling is
1293                         // needed
1294                         if( Last && i == Last->Priority ) {
1295                                 tThread *savedThread = thread;
1296
1297                                 // Find the next unscheduled thread in the list
1298                                 for( thread = Last->Next; thread; thread = thread->Next )
1299                                 {
1300                                         if( thread->CurCPU == -1 )      break;
1301                                 }
1302                                 // If we don't find anything after, just use the one
1303                                 // found above.
1304                                 if( !thread )   thread = savedThread;
1305                         }
1306                         // Found a thread? Schedule it!
1307                         if( thread )    break;
1308                 }
1309
1310                 // Anything to do?
1311                 if( !thread ) {
1312                         SHORTREL(&glThreadListLock);
1313                         return NULL;
1314                 }
1315         }
1316         #elif SCHEDULER_TYPE == SCHED_RR_SIM
1317         {
1318                 // Find the next unscheduled thread in the list
1319                 for( thread = Last->Next; thread; thread = thread->Next )
1320                 {
1321                         if( thread->CurCPU == -1 )      break;
1322                 }
1323                 // If we don't find anything after, search from the beginning
1324                 if( !thread )
1325                 {
1326                         for(thread = gActiveThreads; thread; thread = thread->Next)
1327                         {
1328                                 if( thread->CurCPU == -1 )      break;
1329                         }
1330                 }
1331
1332                 // Anything to do?
1333                 if( !thread ) {
1334                         SHORTREL(&glThreadListLock);
1335                         return NULL;
1336                 }
1337         }
1338         #else
1339         # error "Unimplemented scheduling algorithm"
1340         #endif
1341
1342         // Make the new thread non-schedulable
1343         thread->CurCPU = CPU;
1344
1345         SHORTREL( &glThreadListLock );
1346
1347         return thread;
1348 }
1349
1350 // Acquire mutex (see mutex.h for documentation)
1351 int Mutex_Acquire(tMutex *Mutex)
1352 {
1353         tThread *us = Proc_GetCurThread();
1354
1355         // Get protector
1356         SHORTLOCK( &Mutex->Protector );
1357
1358         //Log("Mutex_Acquire: (%p)", Mutex);
1359
1360         // Check if the lock is already held
1361         if( Mutex->Owner ) {
1362                 SHORTLOCK( &glThreadListLock );
1363                 // - Remove from active list
1364                 us = Threads_RemActive();
1365                 us->Next = NULL;
1366                 // - Mark as sleeping
1367                 us->Status = THREAD_STAT_MUTEXSLEEP;
1368                 us->WaitPointer = Mutex;
1369
1370                 // - Add to waiting
1371                 if(Mutex->LastWaiting) {
1372                         Mutex->LastWaiting->Next = us;
1373                         Mutex->LastWaiting = us;
1374                 }
1375                 else {
1376                         Mutex->Waiting = us;
1377                         Mutex->LastWaiting = us;
1378                 }
1379
1380                 #if DEBUG_TRACE_STATE
1381                 Log("%p (%i %s) waiting on mutex %p",
1382                         us, us->TID, us->ThreadName, Mutex);
1383                 #endif
1384
1385                 #if 0
1386                 {
1387                          int    i = 0;
1388                         tThread *t;
1389                         for( t = Mutex->Waiting; t; t = t->Next, i++ )
1390                                 Log("[%i] (tMutex)%p->Waiting[%i] = %p (%i %s)", us->TID, Mutex, i,
1391                                         t, t->TID, t->ThreadName);
1392                 }
1393                 #endif
1394
1395                 SHORTREL( &glThreadListLock );
1396                 SHORTREL( &Mutex->Protector );
1397                 while(us->Status == THREAD_STAT_MUTEXSLEEP)     Threads_Yield();
1398                 // We're only woken when we get the lock
1399                 us->WaitPointer = NULL;
1400         }
1401         // Ooh, let's take it!
1402         else {
1403                 Mutex->Owner = us;
1404                 SHORTREL( &Mutex->Protector );
1405         }
1406
1407         #if 0
1408         extern tMutex   glPhysAlloc;
1409         if( Mutex != &glPhysAlloc )
1410                 LogF("Mutex %p taken by %i %p\n", Mutex, us->TID, __builtin_return_address(0));
1411         #endif
1412
1413         return 0;
1414 }
1415
1416 // Release a mutex
1417 void Mutex_Release(tMutex *Mutex)
1418 {
1419         SHORTLOCK( &Mutex->Protector );
1420         //Log("Mutex_Release: (%p)", Mutex);
1421         if( Mutex->Waiting ) {
1422                 Mutex->Owner = Mutex->Waiting;  // Set owner
1423                 Mutex->Waiting = Mutex->Waiting->Next;  // Next!
1424                 // Reset ->LastWaiting to NULL if we have just removed the last waiting thread
1425                 // 2010-10-02 21:50 - Comemerating the death of the longest single
1426                 //                    blocker in the Acess2 history. REMEMBER TO
1427                 //                    FUCKING MAINTAIN YOUR FUCKING LISTS DIPWIT
1428                 if( Mutex->LastWaiting == Mutex->Owner )
1429                         Mutex->LastWaiting = NULL;
1430
1431                 // Wake new owner
1432                 SHORTLOCK( &glThreadListLock );
1433                 if( Mutex->Owner->Status != THREAD_STAT_ACTIVE )
1434                         Threads_AddActive(Mutex->Owner);
1435                 SHORTREL( &glThreadListLock );
1436         }
1437         else {
1438                 Mutex->Owner = NULL;
1439         }
1440         SHORTREL( &Mutex->Protector );
1441
1442         #if 0
1443         extern tMutex   glPhysAlloc;
1444         if( Mutex != &glPhysAlloc )
1445                 LogF("Mutex %p released by %i %p\n", Mutex, Threads_GetTID(), __builtin_return_address(0));
1446         #endif
1447 }
1448
1449 // Check if a mutex is locked
1450 int Mutex_IsLocked(tMutex *Mutex)
1451 {
1452         return Mutex->Owner != NULL;
1453 }
1454
1455 //
1456 // Initialise a semaphore
1457 //
1458 void Semaphore_Init(tSemaphore *Sem, int Value, int MaxValue, const char *Module, const char *Name)
1459 {
1460         memset(Sem, 0, sizeof(tSemaphore));
1461         Sem->Value = Value;
1462         Sem->ModName = Module;
1463         Sem->Name = Name;
1464         Sem->MaxValue = MaxValue;
1465 }
1466 //
1467 // Wait for items to be avaliable
1468 //
1469 int Semaphore_Wait(tSemaphore *Sem, int MaxToTake)
1470 {
1471         tThread *us;
1472          int    taken;
1473         if( MaxToTake < 0 ) {
1474                 Log_Warning("Threads", "Semaphore_Wait: User bug - MaxToTake(%i) < 0, Sem=%p(%s)",
1475                         MaxToTake, Sem, Sem->Name);
1476         }
1477
1478         SHORTLOCK( &Sem->Protector );
1479
1480         // Check if there's already items avaliable
1481         if( Sem->Value > 0 ) {
1482                 // Take what we need
1483                 if( MaxToTake && Sem->Value > MaxToTake )
1484                         taken = MaxToTake;
1485                 else
1486                         taken = Sem->Value;
1487                 Sem->Value -= taken;
1488         }
1489         else
1490         {
1491                 SHORTLOCK( &glThreadListLock );
1492
1493                 // - Remove from active list
1494                 us = Threads_RemActive();
1495                 us->Next = NULL;
1496                 // - Mark as sleeping
1497                 us->Status = THREAD_STAT_SEMAPHORESLEEP;
1498                 us->WaitPointer = Sem;
1499                 us->RetStatus = MaxToTake;      // Use RetStatus as a temp variable
1500
1501                 // - Add to waiting
1502                 if(Sem->LastWaiting) {
1503                         Sem->LastWaiting->Next = us;
1504                         Sem->LastWaiting = us;
1505                 }
1506                 else {
1507                         Sem->Waiting = us;
1508                         Sem->LastWaiting = us;
1509                 }
1510
1511                 #if DEBUG_TRACE_STATE || SEMAPHORE_DEBUG
1512                 Log("%p (%i %s) waiting on semaphore %p %s:%s",
1513                         us, us->TID, us->ThreadName,
1514                         Sem, Sem->ModName, Sem->Name);
1515                 #endif
1516
1517                 SHORTREL( &Sem->Protector );    // Release first to make sure it is released
1518                 SHORTREL( &glThreadListLock );
1519                 while(us->Status == THREAD_STAT_SEMAPHORESLEEP) Threads_Yield();
1520                 // We're only woken when there's something avaliable (or a signal arrives)
1521                 us->WaitPointer = NULL;
1522
1523                 taken = us->RetStatus;
1524
1525                 // Get the lock again
1526                 SHORTLOCK( &Sem->Protector );
1527         }
1528
1529         // While there is space, and there are thread waiting
1530         // wake the first thread and give it what it wants (or what's left)
1531         while( (Sem->MaxValue == 0 || Sem->Value < Sem->MaxValue) && Sem->Signaling )
1532         {
1533                  int    given;
1534                 tThread *toWake = Sem->Signaling;
1535
1536                 Sem->Signaling = Sem->Signaling->Next;
1537                 // Reset ->LastWaiting to NULL if we have just removed the last waiting thread
1538                 if( Sem->Signaling == NULL )
1539                         Sem->LastSignaling = NULL;
1540
1541                 // Figure out how much to give
1542                 if( toWake->RetStatus && Sem->Value + toWake->RetStatus < Sem->MaxValue )
1543                         given = toWake->RetStatus;
1544                 else
1545                         given = Sem->MaxValue - Sem->Value;
1546                 Sem->Value -= given;
1547
1548
1549                 #if DEBUG_TRACE_STATE || SEMAPHORE_DEBUG
1550                 Log("%p (%i %s) woken by wait on %p %s:%s",
1551                         toWake, toWake->TID, toWake->ThreadName,
1552                         Sem, Sem->ModName, Sem->Name);
1553                 #endif
1554
1555                 // Save the number we gave to the thread's status
1556                 toWake->RetStatus = given;
1557
1558                 // Wake the sleeper
1559                 SHORTLOCK( &glThreadListLock );
1560                 if( toWake->Status != THREAD_STAT_ACTIVE )
1561                         Threads_AddActive(toWake);
1562                 SHORTREL( &glThreadListLock );
1563         }
1564         SHORTREL( &Sem->Protector );
1565
1566         return taken;
1567 }
1568
1569 //
1570 // Add items to a semaphore
1571 //
1572 int Semaphore_Signal(tSemaphore *Sem, int AmmountToAdd)
1573 {
1574          int    given;
1575          int    added;
1576
1577         if( AmmountToAdd < 0 ) {
1578                 Log_Warning("Threads", "Semaphore_Signal: User bug - AmmountToAdd(%i) < 0, Sem=%p(%s)",
1579                         AmmountToAdd, Sem, Sem->Name);
1580         }
1581         SHORTLOCK( &Sem->Protector );
1582
1583         // Check if we have to block
1584         if( Sem->MaxValue && Sem->Value == Sem->MaxValue )
1585         {
1586                 tThread *us;
1587                 #if 0
1588                 Log_Debug("Threads", "Semaphore_Signal: IDLE Sem = %s:%s", Sem->ModName, Sem->Name);
1589                 Log_Debug("Threads", "Semaphore_Signal: Sem->Value(%i) == Sem->MaxValue(%i)", Sem->Value, Sem->MaxValue);
1590                 #endif
1591
1592                 SHORTLOCK( &glThreadListLock );
1593                 // - Remove from active list
1594                 us = Threads_RemActive();
1595                 us->Next = NULL;
1596                 // - Mark as sleeping
1597                 us->Status = THREAD_STAT_SEMAPHORESLEEP;
1598                 us->WaitPointer = Sem;
1599                 us->RetStatus = AmmountToAdd;   // Use RetStatus as a temp variable
1600
1601                 // - Add to waiting
1602                 if(Sem->LastSignaling) {
1603                         Sem->LastSignaling->Next = us;
1604                         Sem->LastSignaling = us;
1605                 }
1606                 else {
1607                         Sem->Signaling = us;
1608                         Sem->LastSignaling = us;
1609                 }
1610
1611                 #if DEBUG_TRACE_STATE || SEMAPHORE_DEBUG
1612                 Log("%p (%i %s) signaling semaphore %p %s:%s",
1613                         us, us->TID, us->ThreadName,
1614                         Sem, Sem->ModName, Sem->Name);
1615                 #endif
1616
1617                 SHORTREL( &glThreadListLock );
1618                 SHORTREL( &Sem->Protector );
1619                 while(us->Status == THREAD_STAT_SEMAPHORESLEEP) Threads_Yield();
1620                 // We're only woken when there's something avaliable
1621                 us->WaitPointer = NULL;
1622
1623                 added = us->RetStatus;
1624
1625                 // Get the lock again
1626                 SHORTLOCK( &Sem->Protector );
1627         }
1628         // Non blocking
1629         else
1630         {
1631                 // Figure out how much we need to take off
1632                 if( Sem->MaxValue && Sem->Value + AmmountToAdd > Sem->MaxValue)
1633                         added = Sem->MaxValue - Sem->Value;
1634                 else
1635                         added = AmmountToAdd;
1636                 Sem->Value += added;
1637         }
1638
1639         // While there are items avaliable, and there are thread waiting
1640         // wake the first thread and give it what it wants (or what's left)
1641         while( Sem->Value && Sem->Waiting )
1642         {
1643                 tThread *toWake = Sem->Waiting;
1644
1645                 // Remove thread from list (double ended, so clear LastWaiting if needed)
1646                 Sem->Waiting = Sem->Waiting->Next;
1647                 if( Sem->Waiting == NULL )
1648                         Sem->LastWaiting = NULL;
1649
1650                 // Figure out how much to give to woken thread
1651                 // - Requested count is stored in ->RetStatus
1652                 if( toWake->RetStatus && Sem->Value > toWake->RetStatus )
1653                         given = toWake->RetStatus;
1654                 else
1655                         given = Sem->Value;
1656                 Sem->Value -= given;
1657
1658                 // Save the number we gave to the thread's status
1659                 toWake->RetStatus = given;
1660
1661                 if(toWake->bInstrTrace)
1662                         Log("%s(%i) given %i from %p", toWake->ThreadName, toWake->TID, given, Sem);
1663                 #if DEBUG_TRACE_STATE || SEMAPHORE_DEBUG
1664                 Log("%p (%i %s) woken by signal on %p %s:%s",
1665                         toWake, toWake->TID, toWake->ThreadName,
1666                         Sem, Sem->ModName, Sem->Name);
1667                 #endif
1668
1669                 // Wake the sleeper
1670                 SHORTLOCK( &glThreadListLock );
1671                 if( toWake->Status != THREAD_STAT_ACTIVE )
1672                         Threads_AddActive(toWake);
1673                 else
1674                         Warning("Thread %p (%i %s) is already awake", toWake, toWake->TID, toWake->ThreadName);
1675                 SHORTREL( &glThreadListLock );
1676         }
1677         SHORTREL( &Sem->Protector );
1678
1679         return added;
1680 }
1681
1682 //
1683 // Get the current value of a semaphore
1684 //
1685 int Semaphore_GetValue(tSemaphore *Sem)
1686 {
1687         return Sem->Value;
1688 }
1689
1690 // === EXPORTS ===
1691 EXPORT(Threads_GetUID);
1692 EXPORT(Threads_GetGID);
1693 EXPORT(Mutex_Acquire);
1694 EXPORT(Mutex_Release);
1695 EXPORT(Mutex_IsLocked);
1696 EXPORT(Semaphore_Init);
1697 EXPORT(Semaphore_Wait);
1698 EXPORT(Semaphore_Signal);