函数逻辑报告 |
Source Code:kernel\sched\fair.c |
Create Date:2022-07-27 10:39:03 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:清空队列指针
函数原型:static void clear_buddies(struct cfs_rq *cfs_rq, struct sched_entity *se)
返回类型:void
参数:
类型 | 参数 | 名称 |
---|---|---|
struct cfs_rq * | cfs_rq | |
struct sched_entity * | se |
4065 | 如果last恒等于se则__clear_buddies_last(se) |
4068 | 如果next恒等于se则__clear_buddies_next(se) |
4071 | 如果skip恒等于se则__clear_buddies_skip(se) |
名称 | 描述 |
---|---|
dequeue_entity | |
check_preempt_tick | 检查当前进程是否需要被抢占 |
pick_next_entity | Pick the next process, keeping these things in mind, in this order:* 1) keep things fair between processes/task groups* 2) pick the "next" process, since someone really wants that to run* 3) pick the "last" process, for cache locality* 4) do not run the |
yield_task_fair | sched_yield() is very simple* The magic of dealing with the ->skip buddy is in pick_next_entity. |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |