scheduler_mp.c 23 KB

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