2009-09-21 07:43:51 +08:00
|
|
|
/*
|
|
|
|
* File : scheduler.c
|
|
|
|
* This file is part of RT-Thread RTOS
|
2012-03-17 14:43:49 +08:00
|
|
|
* COPYRIGHT (C) 2006 - 2012, RT-Thread Development Team
|
2009-09-21 07:43:51 +08:00
|
|
|
*
|
2013-06-24 17:06:09 +08:00
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License along
|
|
|
|
* with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
2009-09-21 07:43:51 +08:00
|
|
|
*
|
|
|
|
* 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
|
2012-12-25 17:17:21 +08:00
|
|
|
* 2006-05-27 Bernard fix the scheduler algorthm for same priority
|
|
|
|
* thread schedule
|
2009-09-21 07:43:51 +08:00
|
|
|
* 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
|
2010-07-13 15:36:37 +08:00
|
|
|
* 2010-04-11 yi.qiu add module feature
|
2012-12-25 17:17:21 +08:00
|
|
|
* 2010-07-13 Bernard fix the maximal number of rt_scheduler_lock_nest
|
2010-07-13 15:36:37 +08:00
|
|
|
* issue found by kuronca
|
2010-12-13 13:26:15 +08:00
|
|
|
* 2010-12-13 Bernard add defunct list initialization even if not use heap.
|
2011-05-14 08:12:49 +08:00
|
|
|
* 2011-05-10 Bernard clean scheduler debug log.
|
2013-12-21 11:24:37 +08:00
|
|
|
* 2013-12-21 Grissiom add rt_critical_level
|
2009-09-21 07:43:51 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <rtthread.h>
|
|
|
|
#include <rthw.h>
|
|
|
|
|
|
|
|
static rt_int16_t rt_scheduler_lock_nest;
|
2010-04-14 08:40:20 +08:00
|
|
|
extern volatile rt_uint8_t rt_interrupt_nest;
|
2013-03-23 11:27:29 +08:00
|
|
|
extern int __rt_ffs(int value);
|
2009-09-21 07:43:51 +08:00
|
|
|
|
|
|
|
rt_list_t rt_thread_priority_table[RT_THREAD_PRIORITY_MAX];
|
2011-09-21 11:56:42 +08:00
|
|
|
struct rt_thread *rt_current_thread;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
|
|
|
rt_uint8_t rt_current_priority;
|
|
|
|
|
|
|
|
#if RT_THREAD_PRIORITY_MAX > 32
|
2012-04-14 11:51:34 +08:00
|
|
|
/* Maximum priority level, 256 */
|
2009-09-21 07:43:51 +08:00
|
|
|
rt_uint32_t rt_thread_ready_priority_group;
|
|
|
|
rt_uint8_t rt_thread_ready_table[32];
|
|
|
|
#else
|
2012-04-14 11:51:34 +08:00
|
|
|
/* Maximum priority level, 32 */
|
2009-09-21 07:43:51 +08:00
|
|
|
rt_uint32_t rt_thread_ready_priority_group;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
rt_list_t rt_thread_defunct;
|
|
|
|
|
|
|
|
#ifdef RT_USING_HOOK
|
2011-09-21 11:56:42 +08:00
|
|
|
static void (*rt_scheduler_hook)(struct rt_thread *from, struct rt_thread *to);
|
2009-09-21 07:43:51 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @addtogroup Hook
|
|
|
|
*/
|
2012-03-17 14:43:49 +08:00
|
|
|
|
2009-09-21 07:43:51 +08:00
|
|
|
/*@{*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will set a hook function, which will be invoked when thread
|
|
|
|
* switch happens.
|
|
|
|
*
|
|
|
|
* @param hook the hook function
|
|
|
|
*/
|
2012-12-25 17:17:21 +08:00
|
|
|
void
|
|
|
|
rt_scheduler_sethook(void (*hook)(struct rt_thread *from, struct rt_thread *to))
|
2009-09-21 07:43:51 +08:00
|
|
|
{
|
2012-12-25 17:17:21 +08:00
|
|
|
rt_scheduler_hook = hook;
|
2009-09-21 07:43:51 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*@}*/
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef RT_USING_OVERFLOW_CHECK
|
2011-09-21 11:56:42 +08:00
|
|
|
static void _rt_scheduler_stack_check(struct rt_thread *thread)
|
2009-09-21 07:43:51 +08:00
|
|
|
{
|
2012-12-25 17:17:21 +08:00
|
|
|
RT_ASSERT(thread != RT_NULL);
|
|
|
|
|
2016-06-01 16:06:49 +08:00
|
|
|
if (*((rt_uint8_t *)thread->stack_addr) != '#' ||
|
|
|
|
(rt_uint32_t)thread->sp <= (rt_uint32_t)thread->stack_addr ||
|
2012-12-25 17:17:21 +08:00
|
|
|
(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);
|
|
|
|
}
|
2009-09-21 07:43:51 +08:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @ingroup SystemInit
|
2010-11-29 08:04:55 +08:00
|
|
|
* This function will initialize the system scheduler
|
2009-09-21 07:43:51 +08:00
|
|
|
*/
|
|
|
|
void rt_system_scheduler_init(void)
|
|
|
|
{
|
2012-12-25 17:17:21 +08:00
|
|
|
register rt_base_t offset;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
rt_scheduler_lock_nest = 0;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("start scheduler: max priority 0x%02x\n",
|
2012-12-20 15:25:19 +08:00
|
|
|
RT_THREAD_PRIORITY_MAX));
|
2011-05-14 08:12:49 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
for (offset = 0; offset < RT_THREAD_PRIORITY_MAX; offset ++)
|
|
|
|
{
|
|
|
|
rt_list_init(&rt_thread_priority_table[offset]);
|
|
|
|
}
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
rt_current_priority = RT_THREAD_PRIORITY_MAX - 1;
|
|
|
|
rt_current_thread = RT_NULL;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* initialize ready priority group */
|
|
|
|
rt_thread_ready_priority_group = 0;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
|
|
|
#if RT_THREAD_PRIORITY_MAX > 32
|
2012-12-25 17:17:21 +08:00
|
|
|
/* initialize ready table */
|
|
|
|
rt_memset(rt_thread_ready_table, 0, sizeof(rt_thread_ready_table));
|
2009-09-21 07:43:51 +08:00
|
|
|
#endif
|
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* initialize thread defunct */
|
|
|
|
rt_list_init(&rt_thread_defunct);
|
2009-09-21 07:43:51 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2010-04-01 07:21:02 +08:00
|
|
|
* @ingroup SystemInit
|
2009-09-21 07:43:51 +08:00
|
|
|
* This function will startup scheduler. It will select one thread
|
|
|
|
* with the highest priority level, then switch to it.
|
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
void rt_system_scheduler_start(void)
|
2009-09-21 07:43:51 +08:00
|
|
|
{
|
2012-12-25 17:17:21 +08:00
|
|
|
register struct rt_thread *to_thread;
|
|
|
|
register rt_ubase_t highest_ready_priority;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2013-03-23 11:27:29 +08:00
|
|
|
#if RT_THREAD_PRIORITY_MAX > 32
|
2012-12-25 17:17:21 +08:00
|
|
|
register rt_ubase_t number;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2013-03-23 11:27:29 +08:00
|
|
|
number = __rt_ffs(rt_thread_ready_priority_group) - 1;
|
|
|
|
highest_ready_priority = (number << 3) + __rt_ffs(rt_thread_ready_table[number]) - 1;
|
2009-09-21 07:43:51 +08:00
|
|
|
#else
|
2013-03-23 11:27:29 +08:00
|
|
|
highest_ready_priority = __rt_ffs(rt_thread_ready_priority_group) - 1;
|
2009-09-21 07:43:51 +08:00
|
|
|
#endif
|
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* get switch to thread */
|
|
|
|
to_thread = rt_list_entry(rt_thread_priority_table[highest_ready_priority].next,
|
|
|
|
struct rt_thread,
|
|
|
|
tlist);
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
rt_current_thread = to_thread;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* switch to new thread */
|
|
|
|
rt_hw_context_switch_to((rt_uint32_t)&to_thread->sp);
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* never come back */
|
2009-09-21 07:43:51 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @addtogroup Thread
|
|
|
|
*/
|
2012-03-17 14:43:49 +08:00
|
|
|
|
2009-09-21 07:43:51 +08:00
|
|
|
/*@{*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will perform one schedule. It will select one thread
|
|
|
|
* with the highest priority level, then switch to it.
|
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
void rt_schedule(void)
|
2009-09-21 07:43:51 +08:00
|
|
|
{
|
2012-12-25 17:17:21 +08:00
|
|
|
rt_base_t level;
|
|
|
|
struct rt_thread *to_thread;
|
|
|
|
struct rt_thread *from_thread;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* disable interrupt */
|
|
|
|
level = rt_hw_interrupt_disable();
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* check the scheduler is enabled or not */
|
|
|
|
if (rt_scheduler_lock_nest == 0)
|
|
|
|
{
|
|
|
|
register rt_ubase_t highest_ready_priority;
|
2010-04-01 07:21:02 +08:00
|
|
|
|
2013-03-23 11:27:29 +08:00
|
|
|
#if RT_THREAD_PRIORITY_MAX <= 32
|
|
|
|
highest_ready_priority = __rt_ffs(rt_thread_ready_priority_group) - 1;
|
2010-04-01 07:21:02 +08:00
|
|
|
#else
|
2012-12-25 17:17:21 +08:00
|
|
|
register rt_ubase_t number;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2013-03-23 11:27:29 +08:00
|
|
|
number = __rt_ffs(rt_thread_ready_priority_group) - 1;
|
|
|
|
highest_ready_priority = (number << 3) + __rt_ffs(rt_thread_ready_table[number]) - 1;
|
2009-09-21 07:43:51 +08:00
|
|
|
#endif
|
2013-03-23 11:27:29 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* 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)
|
|
|
|
{
|
2012-12-29 20:29:03 +08:00
|
|
|
rt_current_priority = (rt_uint8_t)highest_ready_priority;
|
2012-12-25 17:17:21 +08:00
|
|
|
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,
|
2013-08-19 10:08:11 +08:00
|
|
|
("[%d]switch to priority#%d "
|
|
|
|
"thread:%.*s(sp:0x%p), "
|
|
|
|
"from thread:%.*s(sp: 0x%p)\n",
|
|
|
|
rt_interrupt_nest, highest_ready_priority,
|
|
|
|
RT_NAME_MAX, to_thread->name, to_thread->sp,
|
|
|
|
RT_NAME_MAX, from_thread->name, from_thread->sp));
|
2011-06-12 18:01:48 +08:00
|
|
|
|
2009-09-21 07:43:51 +08:00
|
|
|
#ifdef RT_USING_OVERFLOW_CHECK
|
2012-12-25 17:17:21 +08:00
|
|
|
_rt_scheduler_stack_check(to_thread);
|
2009-09-21 07:43:51 +08:00
|
|
|
#endif
|
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
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);
|
2009-09-21 07:43:51 +08:00
|
|
|
}
|
|
|
|
|
2010-11-29 08:04:55 +08:00
|
|
|
/*
|
2009-09-21 07:43:51 +08:00
|
|
|
* 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.
|
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
void rt_schedule_insert_thread(struct rt_thread *thread)
|
2009-09-21 07:43:51 +08:00
|
|
|
{
|
2012-12-25 17:17:21 +08:00
|
|
|
register rt_base_t temp;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
RT_ASSERT(thread != RT_NULL);
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* disable interrupt */
|
|
|
|
temp = rt_hw_interrupt_disable();
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* change stat */
|
|
|
|
thread->stat = RT_THREAD_READY;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* insert thread to ready list */
|
|
|
|
rt_list_insert_before(&(rt_thread_priority_table[thread->current_priority]),
|
|
|
|
&(thread->tlist));
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* set priority mask */
|
2010-04-01 07:21:02 +08:00
|
|
|
#if RT_THREAD_PRIORITY_MAX <= 32
|
2013-08-19 10:08:11 +08:00
|
|
|
RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("insert thread[%.*s], the priority: %d\n",
|
|
|
|
RT_NAME_MAX, thread->name, thread->current_priority));
|
2009-09-21 07:43:51 +08:00
|
|
|
#else
|
2012-12-25 17:17:21 +08:00
|
|
|
RT_DEBUG_LOG(RT_DEBUG_SCHEDULER,
|
2013-08-19 10:08:11 +08:00
|
|
|
("insert thread[%.*s], the priority: %d 0x%x %d\n",
|
|
|
|
RT_NAME_MAX,
|
2012-12-20 15:25:19 +08:00
|
|
|
thread->name,
|
|
|
|
thread->number,
|
|
|
|
thread->number_mask,
|
|
|
|
thread->high_mask));
|
2009-09-21 07:43:51 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
#if RT_THREAD_PRIORITY_MAX > 32
|
2012-12-25 17:17:21 +08:00
|
|
|
rt_thread_ready_table[thread->number] |= thread->high_mask;
|
2009-09-21 07:43:51 +08:00
|
|
|
#endif
|
2012-12-25 17:17:21 +08:00
|
|
|
rt_thread_ready_priority_group |= thread->number_mask;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* enable interrupt */
|
|
|
|
rt_hw_interrupt_enable(temp);
|
2009-09-21 07:43:51 +08:00
|
|
|
}
|
|
|
|
|
2010-11-29 08:04:55 +08:00
|
|
|
/*
|
2009-09-21 07:43:51 +08:00
|
|
|
* 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.
|
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
void rt_schedule_remove_thread(struct rt_thread *thread)
|
2009-09-21 07:43:51 +08:00
|
|
|
{
|
2012-12-25 17:17:21 +08:00
|
|
|
register rt_base_t temp;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
RT_ASSERT(thread != RT_NULL);
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* disable interrupt */
|
|
|
|
temp = rt_hw_interrupt_disable();
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2010-04-01 07:21:02 +08:00
|
|
|
#if RT_THREAD_PRIORITY_MAX <= 32
|
2013-08-19 10:08:11 +08:00
|
|
|
RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("remove thread[%.*s], the priority: %d\n",
|
|
|
|
RT_NAME_MAX, thread->name,
|
|
|
|
thread->current_priority));
|
2009-09-21 07:43:51 +08:00
|
|
|
#else
|
2012-12-25 17:17:21 +08:00
|
|
|
RT_DEBUG_LOG(RT_DEBUG_SCHEDULER,
|
2013-08-19 10:08:11 +08:00
|
|
|
("remove thread[%.*s], the priority: %d 0x%x %d\n",
|
|
|
|
RT_NAME_MAX,
|
2012-12-20 15:25:19 +08:00
|
|
|
thread->name,
|
|
|
|
thread->number,
|
|
|
|
thread->number_mask,
|
|
|
|
thread->high_mask));
|
2009-09-21 07:43:51 +08:00
|
|
|
#endif
|
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* remove thread from ready list */
|
|
|
|
rt_list_remove(&(thread->tlist));
|
|
|
|
if (rt_list_isempty(&(rt_thread_priority_table[thread->current_priority])))
|
|
|
|
{
|
2009-09-21 07:43:51 +08:00
|
|
|
#if RT_THREAD_PRIORITY_MAX > 32
|
2012-12-25 17:17:21 +08:00
|
|
|
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;
|
|
|
|
}
|
2009-09-21 07:43:51 +08:00
|
|
|
#else
|
2012-12-25 17:17:21 +08:00
|
|
|
rt_thread_ready_priority_group &= ~thread->number_mask;
|
2009-09-21 07:43:51 +08:00
|
|
|
#endif
|
2012-12-25 17:17:21 +08:00
|
|
|
}
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* enable interrupt */
|
|
|
|
rt_hw_interrupt_enable(temp);
|
2009-09-21 07:43:51 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will lock the thread scheduler.
|
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
void rt_enter_critical(void)
|
2009-09-21 07:43:51 +08:00
|
|
|
{
|
2012-12-25 17:17:21 +08:00
|
|
|
register rt_base_t level;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* disable interrupt */
|
|
|
|
level = rt_hw_interrupt_disable();
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/*
|
|
|
|
* the maximal number of nest is RT_UINT16_MAX, which is big
|
|
|
|
* enough and does not check here
|
|
|
|
*/
|
|
|
|
rt_scheduler_lock_nest ++;
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2012-12-25 17:17:21 +08:00
|
|
|
/* enable interrupt */
|
|
|
|
rt_hw_interrupt_enable(level);
|
2009-09-21 07:43:51 +08:00
|
|
|
}
|
2015-08-03 16:01:50 +08:00
|
|
|
RTM_EXPORT(rt_enter_critical);
|
2009-09-21 07:43:51 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will unlock the thread scheduler.
|
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
void rt_exit_critical(void)
|
2009-09-21 07:43:51 +08:00
|
|
|
{
|
2012-12-25 17:17:21 +08:00
|
|
|
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);
|
|
|
|
}
|
2009-09-21 07:43:51 +08:00
|
|
|
}
|
2015-08-03 16:01:50 +08:00
|
|
|
RTM_EXPORT(rt_exit_critical);
|
2009-09-21 07:43:51 +08:00
|
|
|
|
2013-12-21 11:24:37 +08:00
|
|
|
/**
|
|
|
|
* Get the scheduler lock level
|
|
|
|
*
|
|
|
|
* @return the level of the scheduler lock. 0 means unlocked.
|
|
|
|
*/
|
|
|
|
rt_uint16_t rt_critical_level(void)
|
|
|
|
{
|
|
|
|
return rt_scheduler_lock_nest;
|
|
|
|
}
|
2015-08-03 16:01:50 +08:00
|
|
|
RTM_EXPORT(rt_critical_level);
|
2009-09-21 07:43:51 +08:00
|
|
|
/*@}*/
|
|
|
|
|