Base scheduler queues off linked lists and do cleanup/consolidation

Abstracts threading from itself a bit, changes the way its queues are
handled and does type hiding for that as well.

Do alot here due to already required major brain surgery.

Threads may now be on a run queue and a wait queue simultaneously so
that the expired timer only has to wake the thread but not remove it
from the wait queue which simplifies the implicit wake handling.

List formats change for wait queues-- doubly-linked, not circular.
Timeout queue is now singly-linked. The run queue is still circular
as before.

Adds a better thread slot allocator that may keep the slot marked as
used regardless of the thread state. Assists in dumping special tasks
that switch_thread was tasked to perform (blocking tasks).

Deletes alot of code yet surprisingly, gets larger than expected.
Well, I'm not not minding that for the time being-- omlettes and break
a few eggs and all that.

Change-Id: I0834d7bb16b2aecb2f63b58886eeda6ae4f29d59

1 files changed, 3 insertions, 4 deletions

diff --git a/firmware/kernel/include/mrsw_lock.h b/firmware/kernel/include/mrsw_lock.h
index d919f7be26..7511f87e93 100644
--- a/firmware/kernel/include/mrsw_lock.h
+++ b/firmware/kernel/include/mrsw_lock.h
@@ -39,10 +39,9 @@
  */
 struct mrsw_lock
 {
-    int volatile count; /* rd/wr counter; >0 = reader(s), <0 = writer */
-    struct thread_entry *queue;
-    struct blocker_splay splay; /* priority inheritance info
-                                   for waiters */
+    int volatile         count; /* counter; >0 = reader(s), <0 = writer */
+    struct __wait_queue  queue; /* waiter list */
+    struct blocker_splay splay; /* priority inheritance/owner info  */
     uint8_t rdrecursion[MAXTHREADS]; /* per-thread reader recursion counts */
     IF_COP( struct corelock cl; )
 };