5 RT-Thread 线程插入至相同优先级表,没有遍历就绪表，线程节点顺序不乱了吗

发布于 2021-04-14 10:15:39 浏览：838 订阅该版

```
/*源码中没有遍历优先级表，就直接插入节点*/
```
```
void rt_schedule_insert_thread(struct rt_thread *thread)
{
    register rt_base_t temp;

RT_ASSERT(thread != RT_NULL);

/* disable interrupt */
    temp = rt_hw_interrupt_disable();

/* it's current thread, it should be RUNNING thread */
    if (thread == rt_current_thread)
    {
        thread->stat = RT_THREAD_RUNNING | (thread->stat & ~RT_THREAD_STAT_MASK);
        goto __exit;
    }

/* READY thread, insert to ready queue */
    thread->stat = RT_THREAD_READY | (thread->stat & ~RT_THREAD_STAT_MASK);
    /* insert thread to ready list */
    /*没有遍历优先级表，就直接插入节点，是同一优先级表只有一个线程结点吗？*/
    rt_list_insert_before(&(rt_thread_priority_table[thread->current_priority]),
                          &(thread->tlist));

RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("insert thread[%.*s], the priority: %d\n",
                                      RT_NAME_MAX, thread->name, thread->current_priority));

/* ... */
    rt_thread_ready_priority_group |= thread->number_mask;

/**
 * @brief insert a node before a list
 *
 * @param n new node to be inserted
 * @param l list to insert it
 */
rt_inline void rt_list_insert_before(rt_list_t *l,rt_list_t *n)
{
    l->prev->next = n;
    n->prev = l->prev;

l->prev = n;
    n->next = l;
}
```