scheduler_mp.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756
  1. /*
  2. * Copyright (c) 2006-2023, RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2006-03-17 Bernard the first version
  9. * 2006-04-28 Bernard fix the scheduler algorthm
  10. * 2006-04-30 Bernard add SCHEDULER_DEBUG
  11. * 2006-05-27 Bernard fix the scheduler algorthm for same priority
  12. * thread schedule
  13. * 2006-06-04 Bernard rewrite the scheduler algorithm
  14. * 2006-08-03 Bernard add hook support
  15. * 2006-09-05 Bernard add 32 priority level support
  16. * 2006-09-24 Bernard add rt_system_scheduler_start function
  17. * 2009-09-16 Bernard fix _rt_scheduler_stack_check
  18. * 2010-04-11 yi.qiu add module feature
  19. * 2010-07-13 Bernard fix the maximal number of rt_scheduler_lock_nest
  20. * issue found by kuronca
  21. * 2010-12-13 Bernard add defunct list initialization even if not use heap.
  22. * 2011-05-10 Bernard clean scheduler debug log.
  23. * 2013-12-21 Grissiom add rt_critical_level
  24. * 2018-11-22 Jesven remove the current task from ready queue
  25. * add per cpu ready queue
  26. * add _scheduler_get_highest_priority_thread to find highest priority task
  27. * rt_schedule_insert_thread won't insert current task to ready queue
  28. * in smp version, rt_hw_context_switch_interrupt maybe switch to
  29. * new task directly
  30. * 2022-01-07 Gabriel Moving __on_rt_xxxxx_hook to scheduler.c
  31. * 2023-03-27 rose_man Split into scheduler upc and scheduler_mp.c
  32. */
  33. #include <rtthread.h>
  34. #include <rthw.h>
  35. rt_list_t rt_thread_priority_table[RT_THREAD_PRIORITY_MAX];
  36. rt_uint32_t rt_thread_ready_priority_group;
  37. #if RT_THREAD_PRIORITY_MAX > 32
  38. /* Maximum priority level, 256 */
  39. rt_uint8_t rt_thread_ready_table[32];
  40. #endif /* RT_THREAD_PRIORITY_MAX > 32 */
  41. #ifndef __on_rt_scheduler_hook
  42. #define __on_rt_scheduler_hook(from, to) __ON_HOOK_ARGS(rt_scheduler_hook, (from, to))
  43. #endif
  44. #ifndef __on_rt_scheduler_switch_hook
  45. #define __on_rt_scheduler_switch_hook(tid) __ON_HOOK_ARGS(rt_scheduler_switch_hook, (tid))
  46. #endif
  47. #if defined(RT_USING_HOOK) && defined(RT_HOOK_USING_FUNC_PTR)
  48. static void (*rt_scheduler_hook)(struct rt_thread *from, struct rt_thread *to);
  49. static void (*rt_scheduler_switch_hook)(struct rt_thread *tid);
  50. /**
  51. * @addtogroup Hook
  52. */
  53. /**@{*/
  54. /**
  55. * @brief This function will set a hook function, which will be invoked when thread
  56. * switch happens.
  57. *
  58. * @param hook is the hook function.
  59. */
  60. void rt_scheduler_sethook(void (*hook)(struct rt_thread *from, struct rt_thread *to))
  61. {
  62. rt_scheduler_hook = hook;
  63. }
  64. /**
  65. * @brief This function will set a hook function, which will be invoked when context
  66. * switch happens.
  67. *
  68. * @param hook is the hook function.
  69. */
  70. void rt_scheduler_switch_sethook(void (*hook)(struct rt_thread *tid))
  71. {
  72. rt_scheduler_switch_hook = hook;
  73. }
  74. /**@}*/
  75. #endif /* RT_USING_HOOK */
  76. #ifdef RT_USING_OVERFLOW_CHECK
  77. static void _scheduler_stack_check(struct rt_thread *thread)
  78. {
  79. RT_ASSERT(thread != RT_NULL);
  80. #ifdef RT_USING_SMART
  81. #ifndef ARCH_MM_MMU
  82. struct rt_lwp *lwp = thread ? (struct rt_lwp *)thread->lwp : 0;
  83. /* if stack pointer locate in user data section skip stack check. */
  84. if (lwp && ((rt_uint32_t)thread->sp > (rt_uint32_t)lwp->data_entry &&
  85. (rt_uint32_t)thread->sp <= (rt_uint32_t)lwp->data_entry + (rt_uint32_t)lwp->data_size))
  86. {
  87. return;
  88. }
  89. #endif /* not defined ARCH_MM_MMU */
  90. #endif /* RT_USING_SMART */
  91. #ifdef ARCH_CPU_STACK_GROWS_UPWARD
  92. if (*((rt_uint8_t *)((rt_ubase_t)thread->stack_addr + thread->stack_size - 1)) != '#' ||
  93. #else
  94. if (*((rt_uint8_t *)thread->stack_addr) != '#' ||
  95. #endif /* ARCH_CPU_STACK_GROWS_UPWARD */
  96. (rt_ubase_t)thread->sp <= (rt_ubase_t)thread->stack_addr ||
  97. (rt_ubase_t)thread->sp >
  98. (rt_ubase_t)thread->stack_addr + (rt_ubase_t)thread->stack_size)
  99. {
  100. rt_base_t level;
  101. rt_kprintf("thread:%s stack overflow\n", thread->name);
  102. level = rt_hw_interrupt_disable();
  103. while (level);
  104. }
  105. #ifdef ARCH_CPU_STACK_GROWS_UPWARD
  106. else if ((rt_ubase_t)thread->sp > ((rt_ubase_t)thread->stack_addr + thread->stack_size))
  107. {
  108. rt_kprintf("warning: %s stack is close to the top of stack address.\n",
  109. thread->name);
  110. }
  111. #else
  112. else if ((rt_ubase_t)thread->sp <= ((rt_ubase_t)thread->stack_addr + 32))
  113. {
  114. rt_kprintf("warning: %s stack is close to end of stack address.\n",
  115. thread->name);
  116. }
  117. #endif /* ARCH_CPU_STACK_GROWS_UPWARD */
  118. }
  119. #endif /* RT_USING_OVERFLOW_CHECK */
  120. /*
  121. * get the highest priority thread in ready queue
  122. */
  123. static struct rt_thread* _scheduler_get_highest_priority_thread(rt_ubase_t *highest_prio)
  124. {
  125. struct rt_thread *highest_priority_thread;
  126. rt_ubase_t highest_ready_priority, local_highest_ready_priority;
  127. struct rt_cpu* pcpu = rt_cpu_self();
  128. #if RT_THREAD_PRIORITY_MAX > 32
  129. rt_ubase_t number;
  130. number = __rt_ffs(rt_thread_ready_priority_group) - 1;
  131. highest_ready_priority = (number << 3) + __rt_ffs(rt_thread_ready_table[number]) - 1;
  132. number = __rt_ffs(pcpu->priority_group) - 1;
  133. local_highest_ready_priority = (number << 3) + __rt_ffs(pcpu->ready_table[number]) - 1;
  134. #else
  135. highest_ready_priority = __rt_ffs(rt_thread_ready_priority_group) - 1;
  136. local_highest_ready_priority = __rt_ffs(pcpu->priority_group) - 1;
  137. #endif /* RT_THREAD_PRIORITY_MAX > 32 */
  138. /* get highest ready priority thread */
  139. if (highest_ready_priority < local_highest_ready_priority)
  140. {
  141. *highest_prio = highest_ready_priority;
  142. highest_priority_thread = rt_list_entry(rt_thread_priority_table[highest_ready_priority].next,
  143. struct rt_thread,
  144. tlist);
  145. }
  146. else
  147. {
  148. *highest_prio = local_highest_ready_priority;
  149. highest_priority_thread = rt_list_entry(pcpu->priority_table[local_highest_ready_priority].next,
  150. struct rt_thread,
  151. tlist);
  152. }
  153. return highest_priority_thread;
  154. }
  155. /**
  156. * @brief This function will initialize the system scheduler.
  157. */
  158. void rt_system_scheduler_init(void)
  159. {
  160. int cpu;
  161. rt_base_t offset;
  162. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("start scheduler: max priority 0x%02x\n",
  163. RT_THREAD_PRIORITY_MAX));
  164. for (offset = 0; offset < RT_THREAD_PRIORITY_MAX; offset ++)
  165. {
  166. rt_list_init(&rt_thread_priority_table[offset]);
  167. }
  168. for (cpu = 0; cpu < RT_CPUS_NR; cpu++)
  169. {
  170. struct rt_cpu *pcpu = rt_cpu_index(cpu);
  171. for (offset = 0; offset < RT_THREAD_PRIORITY_MAX; offset ++)
  172. {
  173. rt_list_init(&pcpu->priority_table[offset]);
  174. }
  175. pcpu->irq_switch_flag = 0;
  176. pcpu->current_priority = RT_THREAD_PRIORITY_MAX - 1;
  177. pcpu->current_thread = RT_NULL;
  178. pcpu->priority_group = 0;
  179. #if RT_THREAD_PRIORITY_MAX > 32
  180. rt_memset(pcpu->ready_table, 0, sizeof(pcpu->ready_table));
  181. #endif /* RT_THREAD_PRIORITY_MAX > 32 */
  182. }
  183. /* initialize ready priority group */
  184. rt_thread_ready_priority_group = 0;
  185. #if RT_THREAD_PRIORITY_MAX > 32
  186. /* initialize ready table */
  187. rt_memset(rt_thread_ready_table, 0, sizeof(rt_thread_ready_table));
  188. #endif /* RT_THREAD_PRIORITY_MAX > 32 */
  189. }
  190. /**
  191. * @brief This function will startup the scheduler. It will select one thread
  192. * with the highest priority level, then switch to it.
  193. */
  194. void rt_system_scheduler_start(void)
  195. {
  196. struct rt_thread *to_thread;
  197. rt_ubase_t highest_ready_priority;
  198. to_thread = _scheduler_get_highest_priority_thread(&highest_ready_priority);
  199. to_thread->oncpu = rt_hw_cpu_id();
  200. rt_schedule_remove_thread(to_thread);
  201. to_thread->stat = RT_THREAD_RUNNING;
  202. /* switch to new thread */
  203. rt_hw_context_switch_to((rt_ubase_t)&to_thread->sp, to_thread);
  204. /* never come back */
  205. }
  206. /**
  207. * @addtogroup Thread
  208. */
  209. /**@{*/
  210. /**
  211. * @brief This function will handle IPI interrupt and do a scheduling in system.
  212. *
  213. * @param vector is the number of IPI interrupt for system scheduling.
  214. *
  215. * @param param is not used, and can be set to RT_NULL.
  216. *
  217. * @note this function should be invoke or register as ISR in BSP.
  218. */
  219. void rt_scheduler_ipi_handler(int vector, void *param)
  220. {
  221. rt_schedule();
  222. }
  223. /**
  224. * @brief This function will perform one scheduling. It will select one thread
  225. * with the highest priority level in global ready queue or local ready queue,
  226. * then switch to it.
  227. */
  228. void rt_schedule(void)
  229. {
  230. rt_base_t level;
  231. struct rt_thread *to_thread;
  232. struct rt_thread *current_thread;
  233. struct rt_cpu *pcpu;
  234. int cpu_id;
  235. /* disable interrupt */
  236. level = rt_hw_interrupt_disable();
  237. cpu_id = rt_hw_cpu_id();
  238. pcpu = rt_cpu_index(cpu_id);
  239. current_thread = pcpu->current_thread;
  240. /* whether do switch in interrupt */
  241. if (pcpu->irq_nest)
  242. {
  243. pcpu->irq_switch_flag = 1;
  244. rt_hw_interrupt_enable(level);
  245. goto __exit;
  246. }
  247. #ifdef RT_USING_SIGNALS
  248. if ((current_thread->stat & RT_THREAD_SUSPEND_MASK) == RT_THREAD_SUSPEND_MASK)
  249. {
  250. /* if current_thread signal is in pending */
  251. if ((current_thread->stat & RT_THREAD_STAT_SIGNAL_MASK) & RT_THREAD_STAT_SIGNAL_PENDING)
  252. {
  253. #ifdef RT_USING_SMART
  254. rt_thread_wakeup(current_thread);
  255. #else
  256. rt_thread_resume(current_thread);
  257. #endif
  258. }
  259. }
  260. #endif /* RT_USING_SIGNALS */
  261. if (current_thread->scheduler_lock_nest == 1) /* whether lock scheduler */
  262. {
  263. rt_ubase_t highest_ready_priority;
  264. if (rt_thread_ready_priority_group != 0 || pcpu->priority_group != 0)
  265. {
  266. to_thread = _scheduler_get_highest_priority_thread(&highest_ready_priority);
  267. current_thread->oncpu = RT_CPU_DETACHED;
  268. if ((current_thread->stat & RT_THREAD_STAT_MASK) == RT_THREAD_RUNNING)
  269. {
  270. if (current_thread->bind_cpu == RT_CPUS_NR || current_thread->bind_cpu == cpu_id)
  271. {
  272. if (current_thread->current_priority < highest_ready_priority)
  273. {
  274. to_thread = current_thread;
  275. }
  276. else if (current_thread->current_priority == highest_ready_priority && (current_thread->stat & RT_THREAD_STAT_YIELD_MASK) == 0)
  277. {
  278. to_thread = current_thread;
  279. }
  280. else
  281. {
  282. rt_schedule_insert_thread(current_thread);
  283. }
  284. }
  285. else
  286. {
  287. rt_schedule_insert_thread(current_thread);
  288. }
  289. current_thread->stat &= ~RT_THREAD_STAT_YIELD_MASK;
  290. }
  291. to_thread->oncpu = cpu_id;
  292. if (to_thread != current_thread)
  293. {
  294. /* if the destination thread is not the same as current thread */
  295. pcpu->current_priority = (rt_uint8_t)highest_ready_priority;
  296. RT_OBJECT_HOOK_CALL(rt_scheduler_hook, (current_thread, to_thread));
  297. rt_schedule_remove_thread(to_thread);
  298. to_thread->stat = RT_THREAD_RUNNING | (to_thread->stat & ~RT_THREAD_STAT_MASK);
  299. /* switch to new thread */
  300. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER,
  301. ("[%d]switch to priority#%d "
  302. "thread:%.*s(sp:0x%08x), "
  303. "from thread:%.*s(sp: 0x%08x)\n",
  304. pcpu->irq_nest, highest_ready_priority,
  305. RT_NAME_MAX, to_thread->name, to_thread->sp,
  306. RT_NAME_MAX, current_thread->name, current_thread->sp));
  307. #ifdef RT_USING_OVERFLOW_CHECK
  308. _scheduler_stack_check(to_thread);
  309. #endif /* RT_USING_OVERFLOW_CHECK */
  310. RT_OBJECT_HOOK_CALL(rt_scheduler_switch_hook, (current_thread));
  311. rt_hw_context_switch((rt_ubase_t)&current_thread->sp,
  312. (rt_ubase_t)&to_thread->sp, to_thread);
  313. }
  314. }
  315. }
  316. /* enable interrupt */
  317. rt_hw_interrupt_enable(level);
  318. #ifdef RT_USING_SIGNALS
  319. /* check stat of thread for signal */
  320. level = rt_hw_interrupt_disable();
  321. if (current_thread->stat & RT_THREAD_STAT_SIGNAL_PENDING)
  322. {
  323. extern void rt_thread_handle_sig(rt_bool_t clean_state);
  324. current_thread->stat &= ~RT_THREAD_STAT_SIGNAL_PENDING;
  325. rt_hw_interrupt_enable(level);
  326. /* check signal status */
  327. rt_thread_handle_sig(RT_TRUE);
  328. }
  329. else
  330. {
  331. rt_hw_interrupt_enable(level);
  332. }
  333. #endif /* RT_USING_SIGNALS */
  334. __exit:
  335. return ;
  336. }
  337. /**
  338. * @brief This function checks whether a scheduling is needed after an IRQ context switching. If yes,
  339. * it will select one thread with the highest priority level, and then switch
  340. * to it.
  341. */
  342. void rt_scheduler_do_irq_switch(void *context)
  343. {
  344. int cpu_id;
  345. rt_base_t level;
  346. struct rt_cpu* pcpu;
  347. struct rt_thread *to_thread;
  348. struct rt_thread *current_thread;
  349. level = rt_hw_interrupt_disable();
  350. cpu_id = rt_hw_cpu_id();
  351. pcpu = rt_cpu_index(cpu_id);
  352. current_thread = pcpu->current_thread;
  353. #ifdef RT_USING_SIGNALS
  354. if ((current_thread->stat & RT_THREAD_SUSPEND_MASK) == RT_THREAD_SUSPEND_MASK)
  355. {
  356. /* if current_thread signal is in pending */
  357. if ((current_thread->stat & RT_THREAD_STAT_SIGNAL_MASK) & RT_THREAD_STAT_SIGNAL_PENDING)
  358. {
  359. #ifdef RT_USING_SMART
  360. rt_thread_wakeup(current_thread);
  361. #else
  362. rt_thread_resume(current_thread);
  363. #endif
  364. }
  365. }
  366. #endif /* RT_USING_SIGNALS */
  367. if (pcpu->irq_switch_flag == 0)
  368. {
  369. rt_hw_interrupt_enable(level);
  370. return;
  371. }
  372. if (current_thread->scheduler_lock_nest == 1 && pcpu->irq_nest == 0)
  373. {
  374. rt_ubase_t highest_ready_priority;
  375. /* clear irq switch flag */
  376. pcpu->irq_switch_flag = 0;
  377. if (rt_thread_ready_priority_group != 0 || pcpu->priority_group != 0)
  378. {
  379. to_thread = _scheduler_get_highest_priority_thread(&highest_ready_priority);
  380. current_thread->oncpu = RT_CPU_DETACHED;
  381. if ((current_thread->stat & RT_THREAD_STAT_MASK) == RT_THREAD_RUNNING)
  382. {
  383. if (current_thread->bind_cpu == RT_CPUS_NR || current_thread->bind_cpu == cpu_id)
  384. {
  385. if (current_thread->current_priority < highest_ready_priority)
  386. {
  387. to_thread = current_thread;
  388. }
  389. else if (current_thread->current_priority == highest_ready_priority && (current_thread->stat & RT_THREAD_STAT_YIELD_MASK) == 0)
  390. {
  391. to_thread = current_thread;
  392. }
  393. else
  394. {
  395. rt_schedule_insert_thread(current_thread);
  396. }
  397. }
  398. else
  399. {
  400. rt_schedule_insert_thread(current_thread);
  401. }
  402. current_thread->stat &= ~RT_THREAD_STAT_YIELD_MASK;
  403. }
  404. to_thread->oncpu = cpu_id;
  405. if (to_thread != current_thread)
  406. {
  407. /* if the destination thread is not the same as current thread */
  408. pcpu->current_priority = (rt_uint8_t)highest_ready_priority;
  409. RT_OBJECT_HOOK_CALL(rt_scheduler_hook, (current_thread, to_thread));
  410. rt_schedule_remove_thread(to_thread);
  411. to_thread->stat = RT_THREAD_RUNNING | (to_thread->stat & ~RT_THREAD_STAT_MASK);
  412. #ifdef RT_USING_OVERFLOW_CHECK
  413. _scheduler_stack_check(to_thread);
  414. #endif /* RT_USING_OVERFLOW_CHECK */
  415. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("switch in interrupt\n"));
  416. RT_ASSERT(current_thread->cpus_lock_nest > 0);
  417. current_thread->cpus_lock_nest--;
  418. current_thread->scheduler_lock_nest--;
  419. RT_OBJECT_HOOK_CALL(rt_scheduler_switch_hook, (current_thread));
  420. rt_hw_context_switch_interrupt(context, (rt_ubase_t)&current_thread->sp,
  421. (rt_ubase_t)&to_thread->sp, to_thread);
  422. }
  423. }
  424. }
  425. rt_hw_interrupt_enable(level);
  426. }
  427. /**
  428. * @brief This function will insert a thread to the system ready queue. The state of
  429. * thread will be set as READY and the thread will be removed from suspend queue.
  430. *
  431. * @param thread is the thread to be inserted.
  432. *
  433. * @note Please do not invoke this function in user application.
  434. */
  435. void rt_schedule_insert_thread(struct rt_thread *thread)
  436. {
  437. int cpu_id;
  438. int bind_cpu;
  439. rt_uint32_t cpu_mask;
  440. rt_base_t level;
  441. RT_ASSERT(thread != RT_NULL);
  442. /* disable interrupt */
  443. level = rt_hw_interrupt_disable();
  444. /* it should be RUNNING thread */
  445. if (thread->oncpu != RT_CPU_DETACHED)
  446. {
  447. thread->stat = RT_THREAD_RUNNING | (thread->stat & ~RT_THREAD_STAT_MASK);
  448. goto __exit;
  449. }
  450. /* READY thread, insert to ready queue */
  451. thread->stat = RT_THREAD_READY | (thread->stat & ~RT_THREAD_STAT_MASK);
  452. cpu_id = rt_hw_cpu_id();
  453. bind_cpu = thread->bind_cpu ;
  454. /* insert thread to ready list */
  455. if (bind_cpu == RT_CPUS_NR)
  456. {
  457. #if RT_THREAD_PRIORITY_MAX > 32
  458. rt_thread_ready_table[thread->number] |= thread->high_mask;
  459. #endif /* RT_THREAD_PRIORITY_MAX > 32 */
  460. rt_thread_ready_priority_group |= thread->number_mask;
  461. /* there is no time slices left(YIELD), inserting thread before ready list*/
  462. if((thread->stat & RT_THREAD_STAT_YIELD_MASK) != 0)
  463. {
  464. rt_list_insert_before(&(rt_thread_priority_table[thread->current_priority]),
  465. &(thread->tlist));
  466. }
  467. /* there are some time slices left, inserting thread after ready list to schedule it firstly at next time*/
  468. else
  469. {
  470. rt_list_insert_after(&(rt_thread_priority_table[thread->current_priority]),
  471. &(thread->tlist));
  472. }
  473. cpu_mask = RT_CPU_MASK ^ (1 << cpu_id);
  474. rt_hw_ipi_send(RT_SCHEDULE_IPI, cpu_mask);
  475. }
  476. else
  477. {
  478. struct rt_cpu *pcpu = rt_cpu_index(bind_cpu);
  479. #if RT_THREAD_PRIORITY_MAX > 32
  480. pcpu->ready_table[thread->number] |= thread->high_mask;
  481. #endif /* RT_THREAD_PRIORITY_MAX > 32 */
  482. pcpu->priority_group |= thread->number_mask;
  483. /* there is no time slices left(YIELD), inserting thread before ready list*/
  484. if((thread->stat & RT_THREAD_STAT_YIELD_MASK) != 0)
  485. {
  486. rt_list_insert_before(&(rt_cpu_index(bind_cpu)->priority_table[thread->current_priority]),
  487. &(thread->tlist));
  488. }
  489. /* there are some time slices left, inserting thread after ready list to schedule it firstly at next time*/
  490. else
  491. {
  492. rt_list_insert_after(&(rt_cpu_index(bind_cpu)->priority_table[thread->current_priority]),
  493. &(thread->tlist));
  494. }
  495. if (cpu_id != bind_cpu)
  496. {
  497. cpu_mask = 1 << bind_cpu;
  498. rt_hw_ipi_send(RT_SCHEDULE_IPI, cpu_mask);
  499. }
  500. }
  501. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("insert thread[%.*s], the priority: %d\n",
  502. RT_NAME_MAX, thread->name, thread->current_priority));
  503. __exit:
  504. /* enable interrupt */
  505. rt_hw_interrupt_enable(level);
  506. }
  507. /**
  508. * @brief This function will remove a thread from system ready queue.
  509. *
  510. * @param thread is the thread to be removed.
  511. *
  512. * @note Please do not invoke this function in user application.
  513. */
  514. void rt_schedule_remove_thread(struct rt_thread *thread)
  515. {
  516. rt_base_t level;
  517. RT_ASSERT(thread != RT_NULL);
  518. /* disable interrupt */
  519. level = rt_hw_interrupt_disable();
  520. RT_DEBUG_LOG(RT_DEBUG_SCHEDULER, ("remove thread[%.*s], the priority: %d\n",
  521. RT_NAME_MAX, thread->name,
  522. thread->current_priority));
  523. /* remove thread from ready list */
  524. rt_list_remove(&(thread->tlist));
  525. if (thread->bind_cpu == RT_CPUS_NR)
  526. {
  527. if (rt_list_isempty(&(rt_thread_priority_table[thread->current_priority])))
  528. {
  529. #if RT_THREAD_PRIORITY_MAX > 32
  530. rt_thread_ready_table[thread->number] &= ~thread->high_mask;
  531. if (rt_thread_ready_table[thread->number] == 0)
  532. {
  533. rt_thread_ready_priority_group &= ~thread->number_mask;
  534. }
  535. #else
  536. rt_thread_ready_priority_group &= ~thread->number_mask;
  537. #endif /* RT_THREAD_PRIORITY_MAX > 32 */
  538. }
  539. }
  540. else
  541. {
  542. struct rt_cpu *pcpu = rt_cpu_index(thread->bind_cpu);
  543. if (rt_list_isempty(&(pcpu->priority_table[thread->current_priority])))
  544. {
  545. #if RT_THREAD_PRIORITY_MAX > 32
  546. pcpu->ready_table[thread->number] &= ~thread->high_mask;
  547. if (pcpu->ready_table[thread->number] == 0)
  548. {
  549. pcpu->priority_group &= ~thread->number_mask;
  550. }
  551. #else
  552. pcpu->priority_group &= ~thread->number_mask;
  553. #endif /* RT_THREAD_PRIORITY_MAX > 32 */
  554. }
  555. }
  556. /* enable interrupt */
  557. rt_hw_interrupt_enable(level);
  558. }
  559. /**
  560. * @brief This function will lock the thread scheduler.
  561. */
  562. void rt_enter_critical(void)
  563. {
  564. rt_base_t level;
  565. struct rt_thread *current_thread;
  566. /* disable interrupt */
  567. level = rt_hw_local_irq_disable();
  568. current_thread = rt_cpu_self()->current_thread;
  569. if (!current_thread)
  570. {
  571. rt_hw_local_irq_enable(level);
  572. return;
  573. }
  574. /*
  575. * the maximal number of nest is RT_UINT16_MAX, which is big
  576. * enough and does not check here
  577. */
  578. {
  579. rt_uint16_t lock_nest = current_thread->cpus_lock_nest;
  580. current_thread->cpus_lock_nest++;
  581. RT_ASSERT(current_thread->cpus_lock_nest != 0);
  582. if (lock_nest == 0)
  583. {
  584. current_thread->scheduler_lock_nest ++;
  585. rt_hw_spin_lock(&_cpus_lock);
  586. }
  587. }
  588. /* critical for local cpu */
  589. current_thread->critical_lock_nest ++;
  590. /* lock scheduler for local cpu */
  591. current_thread->scheduler_lock_nest ++;
  592. /* enable interrupt */
  593. rt_hw_local_irq_enable(level);
  594. }
  595. RTM_EXPORT(rt_enter_critical);
  596. /**
  597. * @brief This function will unlock the thread scheduler.
  598. */
  599. void rt_exit_critical(void)
  600. {
  601. rt_base_t level;
  602. struct rt_thread *current_thread;
  603. /* disable interrupt */
  604. level = rt_hw_local_irq_disable();
  605. current_thread = rt_cpu_self()->current_thread;
  606. if (!current_thread)
  607. {
  608. rt_hw_local_irq_enable(level);
  609. return;
  610. }
  611. current_thread->scheduler_lock_nest --;
  612. current_thread->critical_lock_nest --;
  613. RT_ASSERT(current_thread->cpus_lock_nest > 0);
  614. current_thread->cpus_lock_nest--;
  615. if (current_thread->cpus_lock_nest == 0)
  616. {
  617. current_thread->scheduler_lock_nest --;
  618. rt_hw_spin_unlock(&_cpus_lock);
  619. }
  620. if (current_thread->scheduler_lock_nest <= 0)
  621. {
  622. current_thread->scheduler_lock_nest = 0;
  623. /* enable interrupt */
  624. rt_hw_local_irq_enable(level);
  625. rt_schedule();
  626. }
  627. else
  628. {
  629. /* enable interrupt */
  630. rt_hw_local_irq_enable(level);
  631. }
  632. }
  633. RTM_EXPORT(rt_exit_critical);
  634. /**
  635. * @brief Get the scheduler lock level.
  636. *
  637. * @return the level of the scheduler lock. 0 means unlocked.
  638. */
  639. rt_uint16_t rt_critical_level(void)
  640. {
  641. struct rt_thread *current_thread = rt_cpu_self()->current_thread;
  642. return current_thread->critical_lock_nest;
  643. }
  644. RTM_EXPORT(rt_critical_level);
  645. /**@}*/