scheduler.c 12 KB

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