Refactor dequeuing logic for the new scheduler

This commit refactors mo_dequeue_task() to support data structures for
the new scheduler.

 - Set the RR cursor to NULL when no task remains in the ready queue
 - Circularly advance the RR cursor if it currently points to
   the task being dequeued, avoid RR cursor points to unlinked node.

Author: vicLin8712

kernel/task.c

@@ -404,16 +404,32 @@ static void sched_enqueue_task(tcb_t *task)
     return;
 }
 
-/* Remove task from ready queues - state-based approach for compatibility */
+/* Remove task from ready queue */
 void sched_dequeue_task(tcb_t *task)
 {
     if (unlikely(!task))
         return;
 
-    /* For tasks that need to be removed from ready state (suspended/cancelled),
-     * we rely on the state change. The scheduler will skip non-ready tasks
-     * when it encounters them during the round-robin traversal.
-     */
+    uint8_t prio_level = task->prio_level;
+
+    /* For task that need to be removed from ready/running state, it need be
+     * removed from corresponding ready queue. */
+    list_t *rq = kcb->ready_queues[prio_level];
+    list_node_t **cursor = &kcb->rr_cursors[prio_level];
+
+    /* Safely move cursor to next task node. */
+    if (&task->rq_node == *cursor)
+        *cursor = list_cnext(rq, *cursor);
+
+    /* Remove ready queue node */
+    list_remove_node(rq, &task->rq_node);
+
+    /* Update task count in ready queue */
+    if (!--kcb->queue_counts[prio_level]) {
+        *cursor = NULL;
+        bitmap_clean(task->prio_level);
+    }
+    return;
 }
 
 /* Handle time slice expiration for current task */