scheduler.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447
  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
  16. * thread 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
  76. 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. void rt_system_scheduler_init(void)
  113. {
  114. register rt_base_t offset;
  115. rt_scheduler_lock_nest = 0;
  116. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("start scheduler: max priority 0x%02x\n",
  117. RT_THREAD_PRIORITY_MAX));
  118. for (offset = 0; offset < RT_THREAD_PRIORITY_MAX; offset ++)
  119. {
  120. rt_list_init(&rt_thread_priority_table[offset]);
  121. }
  122. rt_current_priority = RT_THREAD_PRIORITY_MAX - 1;
  123. rt_current_thread = RT_NULL;
  124. /* initialize ready priority group */
  125. rt_thread_ready_priority_group = 0;
  126. #if RT_THREAD_PRIORITY_MAX > 32
  127. /* initialize ready table */
  128. rt_memset(rt_thread_ready_table, 0, sizeof(rt_thread_ready_table));
  129. #endif
  130. /* initialize thread defunct */
  131. rt_list_init(&rt_thread_defunct);
  132. }
  133. /**
  134. * @ingroup SystemInit
  135. * This function will startup scheduler. It will select one thread
  136. * with the highest priority level, then switch to it.
  137. */
  138. void rt_system_scheduler_start(void)
  139. {
  140. register struct rt_thread *to_thread;
  141. register rt_ubase_t highest_ready_priority;
  142. #if RT_THREAD_PRIORITY_MAX == 8
  143. highest_ready_priority = rt_lowest_bitmap[rt_thread_ready_priority_group];
  144. #else
  145. register rt_ubase_t number;
  146. /* find out the highest priority task */
  147. if (rt_thread_ready_priority_group & 0xff)
  148. {
  149. number = rt_lowest_bitmap[rt_thread_ready_priority_group & 0xff];
  150. }
  151. else if (rt_thread_ready_priority_group & 0xff00)
  152. {
  153. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 8) & 0xff] + 8;
  154. }
  155. else if (rt_thread_ready_priority_group & 0xff0000)
  156. {
  157. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 16) & 0xff] + 16;
  158. }
  159. else
  160. {
  161. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 24) & 0xff] + 24;
  162. }
  163. #if RT_THREAD_PRIORITY_MAX > 32
  164. highest_ready_priority = (number << 3) +
  165. rt_lowest_bitmap[rt_thread_ready_table[number]];
  166. #else
  167. highest_ready_priority = number;
  168. #endif
  169. #endif
  170. /* get switch to thread */
  171. to_thread = rt_list_entry(rt_thread_priority_table[highest_ready_priority].next,
  172. struct rt_thread,
  173. tlist);
  174. rt_current_thread = to_thread;
  175. /* switch to new thread */
  176. rt_hw_context_switch_to((rt_uint32_t)&to_thread->sp);
  177. /* never come back */
  178. }
  179. /**
  180. * @addtogroup Thread
  181. */
  182. /*@{*/
  183. /**
  184. * This function will perform one schedule. It will select one thread
  185. * with the highest priority level, then switch to it.
  186. */
  187. void rt_schedule(void)
  188. {
  189. rt_base_t level;
  190. struct rt_thread *to_thread;
  191. struct rt_thread *from_thread;
  192. /* disable interrupt */
  193. level = rt_hw_interrupt_disable();
  194. /* check the scheduler is enabled or not */
  195. if (rt_scheduler_lock_nest == 0)
  196. {
  197. register rt_ubase_t highest_ready_priority;
  198. #if RT_THREAD_PRIORITY_MAX == 8
  199. highest_ready_priority = rt_lowest_bitmap[rt_thread_ready_priority_group];
  200. #else
  201. register rt_ubase_t number;
  202. /* find out the highest priority task */
  203. if (rt_thread_ready_priority_group & 0xff)
  204. {
  205. number = rt_lowest_bitmap[rt_thread_ready_priority_group & 0xff];
  206. }
  207. else if (rt_thread_ready_priority_group & 0xff00)
  208. {
  209. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 8) & 0xff] + 8;
  210. }
  211. else if (rt_thread_ready_priority_group & 0xff0000)
  212. {
  213. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 16) & 0xff] + 16;
  214. }
  215. else
  216. {
  217. number = rt_lowest_bitmap[(rt_thread_ready_priority_group >> 24) & 0xff] + 24;
  218. }
  219. #if RT_THREAD_PRIORITY_MAX > 32
  220. highest_ready_priority = (number << 3) +
  221. rt_lowest_bitmap[rt_thread_ready_table[number]];
  222. #else
  223. highest_ready_priority = number;
  224. #endif
  225. #endif
  226. /* get switch to thread */
  227. to_thread = rt_list_entry(rt_thread_priority_table[highest_ready_priority].next,
  228. struct rt_thread,
  229. tlist);
  230. /* if the destination thread is not the same as current thread */
  231. if (to_thread != rt_current_thread)
  232. {
  233. rt_current_priority = highest_ready_priority;
  234. from_thread = rt_current_thread;
  235. rt_current_thread = to_thread;
  236. RT_OBJECT_HOOK_CALL(rt_scheduler_hook, (from_thread, to_thread));
  237. /* switch to new thread */
  238. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER,
  239. ("[%d]switch to priority#%d thread:%s\n",
  240. rt_interrupt_nest,
  241. highest_ready_priority,
  242. to_thread->name));
  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,
  249. (rt_uint32_t)&to_thread->sp);
  250. }
  251. else
  252. {
  253. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("switch in interrupt\n"));
  254. rt_hw_context_switch_interrupt((rt_uint32_t)&from_thread->sp,
  255. (rt_uint32_t)&to_thread->sp);
  256. }
  257. }
  258. }
  259. /* enable interrupt */
  260. rt_hw_interrupt_enable(level);
  261. }
  262. /*
  263. * This function will insert a thread to system ready queue. The state of
  264. * thread will be set as READY and remove from suspend queue.
  265. *
  266. * @param thread the thread to be inserted
  267. * @note Please do not invoke this function in user application.
  268. */
  269. void rt_schedule_insert_thread(struct rt_thread *thread)
  270. {
  271. register rt_base_t temp;
  272. RT_ASSERT(thread != RT_NULL);
  273. /* disable interrupt */
  274. temp = rt_hw_interrupt_disable();
  275. /* change stat */
  276. thread->stat = RT_THREAD_READY;
  277. /* insert thread to ready list */
  278. rt_list_insert_before(&(rt_thread_priority_table[thread->current_priority]),
  279. &(thread->tlist));
  280. /* set priority mask */
  281. #if RT_THREAD_PRIORITY_MAX <= 32
  282. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("insert thread[%s], the priority: %d\n",
  283. thread->name, thread->current_priority));
  284. #else
  285. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER,
  286. ("insert thread[%s], the priority: %d 0x%x %d\n",
  287. thread->name,
  288. thread->number,
  289. thread->number_mask,
  290. thread->high_mask));
  291. #endif
  292. #if RT_THREAD_PRIORITY_MAX > 32
  293. rt_thread_ready_table[thread->number] |= thread->high_mask;
  294. #endif
  295. rt_thread_ready_priority_group |= thread->number_mask;
  296. /* enable interrupt */
  297. rt_hw_interrupt_enable(temp);
  298. }
  299. /*
  300. * This function will remove a thread from system ready queue.
  301. *
  302. * @param thread the thread to be removed
  303. *
  304. * @note Please do not invoke this function in user application.
  305. */
  306. void rt_schedule_remove_thread(struct rt_thread *thread)
  307. {
  308. register rt_base_t temp;
  309. RT_ASSERT(thread != RT_NULL);
  310. /* disable interrupt */
  311. temp = rt_hw_interrupt_disable();
  312. #if RT_THREAD_PRIORITY_MAX <= 32
  313. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("remove thread[%s], the priority: %d\n",
  314. thread->name, thread->current_priority));
  315. #else
  316. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER,
  317. ("remove thread[%s], the priority: %d 0x%x %d\n",
  318. thread->name,
  319. thread->number,
  320. thread->number_mask,
  321. thread->high_mask));
  322. #endif
  323. /* remove thread from ready list */
  324. rt_list_remove(&(thread->tlist));
  325. if (rt_list_isempty(&(rt_thread_priority_table[thread->current_priority])))
  326. {
  327. #if RT_THREAD_PRIORITY_MAX > 32
  328. rt_thread_ready_table[thread->number] &= ~thread->high_mask;
  329. if (rt_thread_ready_table[thread->number] == 0)
  330. {
  331. rt_thread_ready_priority_group &= ~thread->number_mask;
  332. }
  333. #else
  334. rt_thread_ready_priority_group &= ~thread->number_mask;
  335. #endif
  336. }
  337. /* enable interrupt */
  338. rt_hw_interrupt_enable(temp);
  339. }
  340. /**
  341. * This function will lock the thread scheduler.
  342. */
  343. void rt_enter_critical(void)
  344. {
  345. register rt_base_t level;
  346. /* disable interrupt */
  347. level = rt_hw_interrupt_disable();
  348. /*
  349. * the maximal number of nest is RT_UINT16_MAX, which is big
  350. * enough and does not check here
  351. */
  352. rt_scheduler_lock_nest ++;
  353. /* enable interrupt */
  354. rt_hw_interrupt_enable(level);
  355. }
  356. /**
  357. * This function will unlock the thread scheduler.
  358. */
  359. void rt_exit_critical(void)
  360. {
  361. register rt_base_t level;
  362. /* disable interrupt */
  363. level = rt_hw_interrupt_disable();
  364. rt_scheduler_lock_nest --;
  365. if (rt_scheduler_lock_nest <= 0)
  366. {
  367. rt_scheduler_lock_nest = 0;
  368. /* enable interrupt */
  369. rt_hw_interrupt_enable(level);
  370. rt_schedule();
  371. }
  372. else
  373. {
  374. /* enable interrupt */
  375. rt_hw_interrupt_enable(level);
  376. }
  377. }
  378. /*@}*/