scheduler.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437
  1. /*
  2. * File : scheduler.c
  3. * This file is part of RT-Thread RTOS
  4. * COPYRIGHT (C) 2006 - 2009, RT-Thread Development Team
  5. *
  6. * The license and distribution terms for this file may be
  7. * found in the file LICENSE in this distribution or at
  8. * http://www.rt-thread.org/license/LICENSE
  9. *
  10. * Change Logs:
  11. * Date Author Notes
  12. * 2006-03-17 Bernard the first version
  13. * 2006-04-28 Bernard fix the scheduler algorthm
  14. * 2006-04-30 Bernard add SCHEDULER_DEBUG
  15. * 2006-05-27 Bernard fix the scheduler algorthm for same priority thread
  16. * schedule
  17. * 2006-06-04 Bernard rewrite the scheduler algorithm
  18. * 2006-08-03 Bernard add hook support
  19. * 2006-09-05 Bernard add 32 priority level support
  20. * 2006-09-24 Bernard add rt_system_scheduler_start function
  21. * 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.
  26. */
  27. #include <rtthread.h>
  28. #include <rthw.h>
  29. #include "kservice.h"
  30. /* #define SCHEDULER_DEBUG */
  31. static rt_int16_t rt_scheduler_lock_nest;
  32. extern volatile rt_uint8_t rt_interrupt_nest;
  33. rt_list_t rt_thread_priority_table[RT_THREAD_PRIORITY_MAX];
  34. struct rt_thread* rt_current_thread;
  35. rt_uint8_t rt_current_priority;
  36. #if RT_THREAD_PRIORITY_MAX > 32
  37. /* maximun priority level, 256 */
  38. rt_uint32_t rt_thread_ready_priority_group;
  39. rt_uint8_t rt_thread_ready_table[32];
  40. #else
  41. /* maximun priority level, 32 */
  42. rt_uint32_t rt_thread_ready_priority_group;
  43. #endif
  44. rt_list_t rt_thread_defunct;
  45. const rt_uint8_t rt_lowest_bitmap[] =
  46. {
  47. /* 00 */ 0, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  48. /* 10 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  49. /* 20 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  50. /* 30 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  51. /* 40 */ 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  52. /* 50 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  53. /* 60 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  54. /* 70 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  55. /* 80 */ 7, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  56. /* 90 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  57. /* A0 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  58. /* B0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  59. /* C0 */ 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  60. /* D0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  61. /* E0 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
  62. /* F0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0
  63. };
  64. #ifdef RT_USING_HOOK
  65. static void (*rt_scheduler_hook)(struct rt_thread* from, struct rt_thread* to);
  66. /**
  67. * @addtogroup Hook
  68. */
  69. /*@{*/
  70. /**
  71. * This function will set a hook function, which will be invoked when thread
  72. * switch happens.
  73. *
  74. * @param hook the hook function
  75. */
  76. void rt_scheduler_sethook(void (*hook)(struct rt_thread* from, struct rt_thread* to))
  77. {
  78. rt_scheduler_hook = hook;
  79. }
  80. /*@}*/
  81. #endif
  82. #ifdef RT_USING_OVERFLOW_CHECK
  83. static void _rt_scheduler_stack_check(struct rt_thread* thread)
  84. {
  85. RT_ASSERT(thread != RT_NULL);
  86. if ( (rt_uint32_t)thread->sp <= (rt_uint32_t)thread->stack_addr ||
  87. (rt_uint32_t)thread->sp >
  88. (rt_uint32_t)thread->stack_addr + (rt_uint32_t)thread->stack_size )
  89. {
  90. rt_uint32_t level;
  91. rt_kprintf("thread:%s stack overflow\n", thread->name);
  92. #ifdef RT_USING_FINSH
  93. {
  94. extern long list_thread(void);
  95. list_thread();
  96. }
  97. #endif
  98. level = rt_hw_interrupt_disable();
  99. while (level);
  100. }
  101. else if ((rt_uint32_t)thread->sp <= ((rt_uint32_t)thread->stack_addr + 32))
  102. {
  103. rt_kprintf("warning: %s stack is close to end of stack address.\n",
  104. thread->name);
  105. }
  106. }
  107. #endif
  108. /**
  109. * @ingroup SystemInit
  110. * This function will initialize the system scheduler
  111. *
  112. */
  113. void rt_system_scheduler_init(void)
  114. {
  115. register rt_base_t offset;
  116. rt_scheduler_lock_nest = 0;
  117. for (offset = 0; offset < RT_THREAD_PRIORITY_MAX; offset ++)
  118. {
  119. rt_list_init(&rt_thread_priority_table[offset]);
  120. }
  121. rt_current_priority = RT_THREAD_PRIORITY_MAX - 1;
  122. rt_current_thread = RT_NULL;
  123. /* init ready priority group */
  124. rt_thread_ready_priority_group = 0;
  125. #if RT_THREAD_PRIORITY_MAX > 32
  126. /* init ready table */
  127. rt_memset(rt_thread_ready_table, 0, sizeof(rt_thread_ready_table));
  128. #endif
  129. /* init thread defunct */
  130. rt_list_init(&rt_thread_defunct);
  131. }
  132. /**
  133. * @ingroup SystemInit
  134. * This function will startup scheduler. It will select one thread
  135. * with the highest priority level, then switch to it.
  136. */
  137. void rt_system_scheduler_start()
  138. {
  139. register struct rt_thread *to_thread;
  140. register rt_ubase_t highest_ready_priority;
  141. #if RT_THREAD_PRIORITY_MAX == 8
  142. highest_ready_priority = rt_lowest_bitmap[rt_thread_ready_priority_group];
  143. #else
  144. register rt_ubase_t number;
  145. /* find out the highest priority task */
  146. if (rt_thread_ready_priority_group & 0xff)
  147. {
  148. number = rt_lowest_bitmap[rt_thread_ready_priority_group & 0xff];
  149. }
  150. else if (rt_thread_ready_priority_group & 0xff00)
  151. {
  152. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 8) & 0xff] + 8;
  153. }
  154. else if (rt_thread_ready_priority_group & 0xff0000)
  155. {
  156. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 16) & 0xff] + 16;
  157. }
  158. else
  159. {
  160. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 24) & 0xff] + 24;
  161. }
  162. #if RT_THREAD_PRIORITY_MAX > 32
  163. highest_ready_priority = (number << 3) + rt_lowest_bitmap[rt_thread_ready_table[number]];
  164. #else
  165. highest_ready_priority = number;
  166. #endif
  167. #endif
  168. /* get switch to thread */
  169. to_thread = rt_list_entry(rt_thread_priority_table[highest_ready_priority].next,
  170. struct rt_thread, tlist);
  171. rt_current_thread = to_thread;
  172. /* switch to new thread */
  173. rt_hw_context_switch_to((rt_uint32_t)&to_thread->sp);
  174. /* never come back */
  175. }
  176. /**
  177. * @addtogroup Thread
  178. */
  179. /*@{*/
  180. /**
  181. * This function will perform one schedule. It will select one thread
  182. * with the highest priority level, then switch to it.
  183. */
  184. void rt_schedule()
  185. {
  186. rt_base_t level;
  187. struct rt_thread *to_thread;
  188. struct rt_thread *from_thread;
  189. /* disable interrupt */
  190. level = rt_hw_interrupt_disable();
  191. /* check the scheduler is enabled or not */
  192. if (rt_scheduler_lock_nest == 0)
  193. {
  194. register rt_ubase_t highest_ready_priority;
  195. #if RT_THREAD_PRIORITY_MAX == 8
  196. highest_ready_priority = rt_lowest_bitmap[rt_thread_ready_priority_group];
  197. #else
  198. register rt_ubase_t number;
  199. /* find out the highest priority task */
  200. if (rt_thread_ready_priority_group & 0xff)
  201. {
  202. number = rt_lowest_bitmap[rt_thread_ready_priority_group & 0xff];
  203. }
  204. else if (rt_thread_ready_priority_group & 0xff00)
  205. {
  206. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 8) & 0xff] + 8;
  207. }
  208. else if (rt_thread_ready_priority_group & 0xff0000)
  209. {
  210. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 16) & 0xff] + 16;
  211. }
  212. else
  213. {
  214. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 24) & 0xff] + 24;
  215. }
  216. #if RT_THREAD_PRIORITY_MAX > 32
  217. highest_ready_priority = (number << 3) + rt_lowest_bitmap[rt_thread_ready_table[number]];
  218. #else
  219. highest_ready_priority = number;
  220. #endif
  221. #endif
  222. /* get switch to thread */
  223. to_thread = rt_list_entry(rt_thread_priority_table[highest_ready_priority].next,
  224. struct rt_thread, tlist);
  225. /* if the destination thread is not the same as current thread */
  226. if (to_thread != rt_current_thread)
  227. {
  228. rt_current_priority = highest_ready_priority;
  229. from_thread = rt_current_thread;
  230. rt_current_thread = to_thread;
  231. #ifdef RT_USING_MODULE
  232. rt_module_set ((rt_current_thread->module_id != RT_NULL) ?
  233. (rt_module_t)rt_current_thread->module_id : RT_NULL);
  234. #endif
  235. #ifdef RT_USING_HOOK
  236. if (rt_scheduler_hook != RT_NULL) rt_scheduler_hook(from_thread, to_thread);
  237. #endif
  238. /* switch to new thread */
  239. #ifdef SCHEDULER_DEBUG
  240. rt_kprintf("[%d]switch to priority#%d thread:%s\n", rt_interrupt_nest,
  241. highest_ready_priority, to_thread->name);
  242. #endif
  243. #ifdef RT_USING_OVERFLOW_CHECK
  244. _rt_scheduler_stack_check(to_thread);
  245. #endif
  246. if (rt_interrupt_nest == 0)
  247. {
  248. rt_hw_context_switch((rt_uint32_t)&from_thread->sp, (rt_uint32_t)&to_thread->sp);
  249. }
  250. else
  251. {
  252. #ifdef SCHEDULER_DEBUG
  253. rt_kprintf("switch in interrupt\n");
  254. #endif
  255. rt_hw_context_switch_interrupt((rt_uint32_t)&from_thread->sp,
  256. (rt_uint32_t)&to_thread->sp);
  257. }
  258. }
  259. }
  260. /* enable interrupt */
  261. rt_hw_interrupt_enable(level);
  262. }
  263. /*
  264. * This function will insert a thread to system ready queue. The state of
  265. * thread will be set as READY and remove from suspend queue.
  266. *
  267. * @param thread the thread to be inserted
  268. * @note Please do not invoke this function in user application.
  269. */
  270. void rt_schedule_insert_thread(struct rt_thread* thread)
  271. {
  272. register rt_base_t temp;
  273. RT_ASSERT(thread != RT_NULL);
  274. /* disable interrupt */
  275. temp = rt_hw_interrupt_disable();
  276. /* change stat */
  277. thread->stat = RT_THREAD_READY;
  278. /* insert thread to ready list */
  279. rt_list_insert_before(&(rt_thread_priority_table[thread->current_priority]),
  280. &(thread->tlist));
  281. /* set priority mask */
  282. #ifdef SCHEDULER_DEBUG
  283. #if RT_THREAD_PRIORITY_MAX <= 32
  284. rt_kprintf("insert thread, the priority: %d\n", thread->current_priority);
  285. #else
  286. rt_kprintf("insert thread, the priority: %d 0x%x %d\n", thread->number, thread->number_mask, thread->high_mask);
  287. #endif
  288. #endif
  289. #if RT_THREAD_PRIORITY_MAX > 32
  290. rt_thread_ready_table[thread->number] |= thread->high_mask;
  291. #endif
  292. rt_thread_ready_priority_group |= thread->number_mask;
  293. /* enable interrupt */
  294. rt_hw_interrupt_enable(temp);
  295. }
  296. /*
  297. * This function will remove a thread from system ready queue.
  298. *
  299. * @param thread the thread to be removed
  300. *
  301. * @note Please do not invoke this function in user application.
  302. */
  303. void rt_schedule_remove_thread(struct rt_thread* thread)
  304. {
  305. register rt_base_t temp;
  306. RT_ASSERT(thread != RT_NULL);
  307. /* disable interrupt */
  308. temp = rt_hw_interrupt_disable();
  309. #ifdef SCHEDULER_DEBUG
  310. #if RT_THREAD_PRIORITY_MAX <= 32
  311. rt_kprintf("remove thread, the priority: %d\n", thread->current_priority);
  312. #else
  313. rt_kprintf("remove thread, the priority: %d 0x%x %d\n", thread->number,
  314. thread->number_mask, thread->high_mask);
  315. #endif
  316. #endif
  317. /* remove thread from ready list */
  318. rt_list_remove(&(thread->tlist));
  319. if (rt_list_isempty(&(rt_thread_priority_table[thread->current_priority])))
  320. {
  321. #if RT_THREAD_PRIORITY_MAX > 32
  322. rt_thread_ready_table[thread->number] &= ~thread->high_mask;
  323. if (rt_thread_ready_table[thread->number] == 0)
  324. {
  325. rt_thread_ready_priority_group &= ~thread->number_mask;
  326. }
  327. #else
  328. rt_thread_ready_priority_group &= ~thread->number_mask;
  329. #endif
  330. }
  331. /* enable interrupt */
  332. rt_hw_interrupt_enable(temp);
  333. }
  334. /**
  335. * This function will lock the thread scheduler.
  336. */
  337. void rt_enter_critical()
  338. {
  339. register rt_base_t level;
  340. /* disable interrupt */
  341. level = rt_hw_interrupt_disable();
  342. /* the maximal number of nest is RT_UINT16_MAX, which is big
  343. * enough and does not check here */
  344. rt_scheduler_lock_nest++;
  345. /* enable interrupt */
  346. rt_hw_interrupt_enable(level);
  347. }
  348. /**
  349. * This function will unlock the thread scheduler.
  350. */
  351. void rt_exit_critical()
  352. {
  353. register rt_base_t level;
  354. /* disable interrupt */
  355. level = rt_hw_interrupt_disable();
  356. rt_scheduler_lock_nest --;
  357. if (rt_scheduler_lock_nest <= 0)
  358. {
  359. rt_scheduler_lock_nest = 0;
  360. /* enable interrupt */
  361. rt_hw_interrupt_enable(level);
  362. rt_schedule();
  363. }
  364. else
  365. {
  366. /* enable interrupt */
  367. rt_hw_interrupt_enable(level);
  368. }
  369. }
  370. /*@}*/