scheduler.c 12.9 KB
Newer Older
1 2 3
/*
 * File      : scheduler.c
 * This file is part of RT-Thread RTOS
D
dzzxzz 已提交
4
 * COPYRIGHT (C) 2006 - 2012, RT-Thread Development Team
5 6 7
 *
 * The license and distribution terms for this file may be
 * found in the file LICENSE in this distribution or at
B
bernard.xiong 已提交
8
 * http://www.rt-thread.org/license/LICENSE
9 10 11 12 13 14
 *
 * Change Logs:
 * Date           Author       Notes
 * 2006-03-17     Bernard      the first version
 * 2006-04-28     Bernard      fix the scheduler algorthm
 * 2006-04-30     Bernard      add SCHEDULER_DEBUG
15 16
 * 2006-05-27     Bernard      fix the scheduler algorthm for same priority
 *                             thread schedule
17 18 19 20 21
 * 2006-06-04     Bernard      rewrite the scheduler algorithm
 * 2006-08-03     Bernard      add hook support
 * 2006-09-05     Bernard      add 32 priority level support
 * 2006-09-24     Bernard      add rt_system_scheduler_start function
 * 2009-09-16     Bernard      fix _rt_scheduler_stack_check
22
 * 2010-04-11     yi.qiu       add module feature
23
 * 2010-07-13     Bernard      fix the maximal number of rt_scheduler_lock_nest
24
 *                             issue found by kuronca
25
 * 2010-12-13     Bernard      add defunct list initialization even if not use heap.
B
bernard.xiong@gmail.com 已提交
26
 * 2011-05-10     Bernard      clean scheduler debug log.
27 28 29 30 31 32
 */

#include <rtthread.h>
#include <rthw.h>

static rt_int16_t rt_scheduler_lock_nest;
33
extern volatile rt_uint8_t rt_interrupt_nest;
34 35

rt_list_t rt_thread_priority_table[RT_THREAD_PRIORITY_MAX];
D
dzzxzz 已提交
36
struct rt_thread *rt_current_thread;
37 38 39 40

rt_uint8_t rt_current_priority;

#if RT_THREAD_PRIORITY_MAX > 32
41
/* Maximum priority level, 256 */
42 43 44
rt_uint32_t rt_thread_ready_priority_group;
rt_uint8_t rt_thread_ready_table[32];
#else
45
/* Maximum priority level, 32 */
46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71
rt_uint32_t rt_thread_ready_priority_group;
#endif

rt_list_t rt_thread_defunct;

const rt_uint8_t rt_lowest_bitmap[] =
{
    /* 00 */ 0, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* 10 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* 20 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* 30 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* 40 */ 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* 50 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* 60 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* 70 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* 80 */ 7, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* 90 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* A0 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* B0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* C0 */ 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* D0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* E0 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
    /* F0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0
};

#ifdef RT_USING_HOOK
D
dzzxzz 已提交
72
static void (*rt_scheduler_hook)(struct rt_thread *from, struct rt_thread *to);
73 74 75 76

/**
 * @addtogroup Hook
 */
D
dzzxzz 已提交
77

78 79 80 81 82 83 84 85
/*@{*/

/**
 * This function will set a hook function, which will be invoked when thread
 * switch happens.
 *
 * @param hook the hook function
 */
86 87
void
rt_scheduler_sethook(void (*hook)(struct rt_thread *from, struct rt_thread *to))
88
{
89
    rt_scheduler_hook = hook;
90 91 92 93 94 95
}

/*@}*/
#endif

#ifdef RT_USING_OVERFLOW_CHECK
D
dzzxzz 已提交
96
static void _rt_scheduler_stack_check(struct rt_thread *thread)
97
{
98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120
    RT_ASSERT(thread != RT_NULL);

    if ((rt_uint32_t)thread->sp <= (rt_uint32_t)thread->stack_addr ||
        (rt_uint32_t)thread->sp >
        (rt_uint32_t)thread->stack_addr + (rt_uint32_t)thread->stack_size)
    {
        rt_uint32_t level;

        rt_kprintf("thread:%s stack overflow\n", thread->name);
        #ifdef RT_USING_FINSH
        {
            extern long list_thread(void);
            list_thread();
        }
        #endif
        level = rt_hw_interrupt_disable();
        while (level);
    }
    else if ((rt_uint32_t)thread->sp <= ((rt_uint32_t)thread->stack_addr + 32))
    {
        rt_kprintf("warning: %s stack is close to end of stack address.\n",
                   thread->name);
    }
121 122 123 124 125
}
#endif

/**
 * @ingroup SystemInit
B
bernard.xiong@gmail.com 已提交
126
 * This function will initialize the system scheduler
127 128 129
 */
void rt_system_scheduler_init(void)
{
130
    register rt_base_t offset;
131

132
    rt_scheduler_lock_nest = 0;
133

134
    RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("start scheduler: max priority 0x%02x\n",
135
                                      RT_THREAD_PRIORITY_MAX));
B
bernard.xiong@gmail.com 已提交
136

137 138 139 140
    for (offset = 0; offset < RT_THREAD_PRIORITY_MAX; offset ++)
    {
        rt_list_init(&rt_thread_priority_table[offset]);
    }
141

142 143
    rt_current_priority = RT_THREAD_PRIORITY_MAX - 1;
    rt_current_thread = RT_NULL;
144

145 146
    /* initialize ready priority group */
    rt_thread_ready_priority_group = 0;
147 148

#if RT_THREAD_PRIORITY_MAX > 32
149 150
    /* initialize ready table */
    rt_memset(rt_thread_ready_table, 0, sizeof(rt_thread_ready_table));
151 152
#endif

153 154
    /* initialize thread defunct */
    rt_list_init(&rt_thread_defunct);
155 156 157
}

/**
158
 * @ingroup SystemInit
159 160 161
 * This function will startup scheduler. It will select one thread
 * with the highest priority level, then switch to it.
 */
D
dzzxzz 已提交
162
void rt_system_scheduler_start(void)
163
{
164 165
    register struct rt_thread *to_thread;
    register rt_ubase_t highest_ready_priority;
166

167
#if RT_THREAD_PRIORITY_MAX == 8
168
    highest_ready_priority = rt_lowest_bitmap[rt_thread_ready_priority_group];
169
#else
170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187
    register rt_ubase_t number;
    /* find out the highest priority task */
    if (rt_thread_ready_priority_group & 0xff)
    {
        number = rt_lowest_bitmap[rt_thread_ready_priority_group & 0xff];
    }
    else if (rt_thread_ready_priority_group & 0xff00)
    {
        number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 8) & 0xff] + 8;
    }
    else if (rt_thread_ready_priority_group & 0xff0000)
    {
        number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 16) & 0xff] + 16;
    }
    else
    {
        number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 24) & 0xff] + 24;
    }
188 189

#if RT_THREAD_PRIORITY_MAX > 32
190 191
    highest_ready_priority = (number << 3) +
                             rt_lowest_bitmap[rt_thread_ready_table[number]];
192
#else
193
    highest_ready_priority = number;
194
#endif
195 196
#endif

197 198 199 200
    /* get switch to thread */
    to_thread = rt_list_entry(rt_thread_priority_table[highest_ready_priority].next,
                              struct rt_thread,
                              tlist);
201

202
    rt_current_thread = to_thread;
203

204 205
    /* switch to new thread */
    rt_hw_context_switch_to((rt_uint32_t)&to_thread->sp);
206

207
    /* never come back */
208 209 210 211 212
}

/**
 * @addtogroup Thread
 */
D
dzzxzz 已提交
213

214 215 216 217 218 219
/*@{*/

/**
 * This function will perform one schedule. It will select one thread
 * with the highest priority level, then switch to it.
 */
D
dzzxzz 已提交
220
void rt_schedule(void)
221
{
222 223 224
    rt_base_t level;
    struct rt_thread *to_thread;
    struct rt_thread *from_thread;
225

226 227
    /* disable interrupt */
    level = rt_hw_interrupt_disable();
228

229 230 231 232
    /* check the scheduler is enabled or not */
    if (rt_scheduler_lock_nest == 0)
    {
        register rt_ubase_t highest_ready_priority;
233 234

#if RT_THREAD_PRIORITY_MAX == 8
235
        highest_ready_priority = rt_lowest_bitmap[rt_thread_ready_priority_group];
236
#else
237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254
        register rt_ubase_t number;
        /* find out the highest priority task */
        if (rt_thread_ready_priority_group & 0xff)
        {
            number = rt_lowest_bitmap[rt_thread_ready_priority_group & 0xff];
        }
        else if (rt_thread_ready_priority_group & 0xff00)
        {
            number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 8) & 0xff] + 8;
        }
        else if (rt_thread_ready_priority_group & 0xff0000)
        {
            number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 16) & 0xff] + 16;
        }
        else
        {
            number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 24) & 0xff] + 24;
        }
255 256

#if RT_THREAD_PRIORITY_MAX > 32
257 258
        highest_ready_priority = (number << 3) +
                                 rt_lowest_bitmap[rt_thread_ready_table[number]];
259
#else
260
        highest_ready_priority = number;
261
#endif
262
#endif
263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278
        /* get switch to thread */
        to_thread = rt_list_entry(rt_thread_priority_table[highest_ready_priority].next,
                                  struct rt_thread,
                                  tlist);

        /* if the destination thread is not the same as current thread */
        if (to_thread != rt_current_thread)
        {
            rt_current_priority = highest_ready_priority;
            from_thread         = rt_current_thread;
            rt_current_thread   = to_thread;

            RT_OBJECT_HOOK_CALL(rt_scheduler_hook, (from_thread, to_thread));

            /* switch to new thread */
            RT_DEBUG_LOG(RT_DEBUG_SCHEDULER,
279 280 281 282
                         ("[%d]switch to priority#%d thread:%s\n",
                          rt_interrupt_nest,
                          highest_ready_priority,
                          to_thread->name));
283

284
#ifdef RT_USING_OVERFLOW_CHECK
285
            _rt_scheduler_stack_check(to_thread);
286 287
#endif

288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304
            if (rt_interrupt_nest == 0)
            {
                rt_hw_context_switch((rt_uint32_t)&from_thread->sp,
                                     (rt_uint32_t)&to_thread->sp);
            }
            else
            {
                RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("switch in interrupt\n"));

                rt_hw_context_switch_interrupt((rt_uint32_t)&from_thread->sp,
                                               (rt_uint32_t)&to_thread->sp);
            }
        }
    }

    /* enable interrupt */
    rt_hw_interrupt_enable(level);
305 306
}

B
bernard.xiong@gmail.com 已提交
307
/*
308 309 310 311 312 313
 * This function will insert a thread to system ready queue. The state of
 * thread will be set as READY and remove from suspend queue.
 *
 * @param thread the thread to be inserted
 * @note Please do not invoke this function in user application.
 */
D
dzzxzz 已提交
314
void rt_schedule_insert_thread(struct rt_thread *thread)
315
{
316
    register rt_base_t temp;
317

318
    RT_ASSERT(thread != RT_NULL);
319

320 321
    /* disable interrupt */
    temp = rt_hw_interrupt_disable();
322

323 324
    /* change stat */
    thread->stat = RT_THREAD_READY;
325

326 327 328
    /* insert thread to ready list */
    rt_list_insert_before(&(rt_thread_priority_table[thread->current_priority]),
                          &(thread->tlist));
329

330
    /* set priority mask */
331
#if RT_THREAD_PRIORITY_MAX <= 32
332
    RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("insert thread[%s], the priority: %d\n", 
333
                                      thread->name, thread->current_priority));
334
#else
335
    RT_DEBUG_LOG(RT_DEBUG_SCHEDULER,
336 337 338 339 340
                 ("insert thread[%s], the priority: %d 0x%x %d\n", 
                  thread->name,
                  thread->number,
                  thread->number_mask,
                  thread->high_mask));
341 342 343
#endif

#if RT_THREAD_PRIORITY_MAX > 32
344
    rt_thread_ready_table[thread->number] |= thread->high_mask;
345
#endif
346
    rt_thread_ready_priority_group |= thread->number_mask;
347

348 349
    /* enable interrupt */
    rt_hw_interrupt_enable(temp);
350 351
}

B
bernard.xiong@gmail.com 已提交
352
/*
353 354 355 356 357 358
 * This function will remove a thread from system ready queue.
 *
 * @param thread the thread to be removed
 *
 * @note Please do not invoke this function in user application.
 */
D
dzzxzz 已提交
359
void rt_schedule_remove_thread(struct rt_thread *thread)
360
{
361
    register rt_base_t temp;
362

363
    RT_ASSERT(thread != RT_NULL);
364

365 366
    /* disable interrupt */
    temp = rt_hw_interrupt_disable();
367

368
#if RT_THREAD_PRIORITY_MAX <= 32
369
    RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("remove thread[%s], the priority: %d\n", 
370
                                      thread->name, thread->current_priority));
371
#else
372
    RT_DEBUG_LOG(RT_DEBUG_SCHEDULER,
373 374 375 376 377
                 ("remove thread[%s], the priority: %d 0x%x %d\n", 
                  thread->name,
                  thread->number,
                  thread->number_mask,
                  thread->high_mask));
378 379
#endif

380 381 382 383
    /* remove thread from ready list */
    rt_list_remove(&(thread->tlist));
    if (rt_list_isempty(&(rt_thread_priority_table[thread->current_priority])))
    {
384
#if RT_THREAD_PRIORITY_MAX > 32
385 386 387 388 389
        rt_thread_ready_table[thread->number] &= ~thread->high_mask;
        if (rt_thread_ready_table[thread->number] == 0)
        {
            rt_thread_ready_priority_group &= ~thread->number_mask;
        }
390
#else
391
        rt_thread_ready_priority_group &= ~thread->number_mask;
392
#endif
393
    }
394

395 396
    /* enable interrupt */
    rt_hw_interrupt_enable(temp);
397 398 399 400 401
}

/**
 * This function will lock the thread scheduler.
 */
D
dzzxzz 已提交
402
void rt_enter_critical(void)
403
{
404
    register rt_base_t level;
405

406 407
    /* disable interrupt */
    level = rt_hw_interrupt_disable();
408

409 410 411 412 413
    /*
     * the maximal number of nest is RT_UINT16_MAX, which is big
     * enough and does not check here
     */
    rt_scheduler_lock_nest ++;
414

415 416
    /* enable interrupt */
    rt_hw_interrupt_enable(level);
417 418 419 420 421
}

/**
 * This function will unlock the thread scheduler.
 */
D
dzzxzz 已提交
422
void rt_exit_critical(void)
423
{
424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443
    register rt_base_t level;

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

    rt_scheduler_lock_nest --;

    if (rt_scheduler_lock_nest <= 0)
    {
        rt_scheduler_lock_nest = 0;
        /* enable interrupt */
        rt_hw_interrupt_enable(level);

        rt_schedule();
    }
    else
    {
        /* enable interrupt */
        rt_hw_interrupt_enable(level);
    }
444 445 446 447
}

/*@}*/