函数逻辑报告 |
Source Code:kernel\sched\fair.c |
Create Date:2022-07-27 10:39:25 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:yield_to_task_fair
函数原型:static bool yield_to_task_fair(struct rq *rq, struct task_struct *p, bool preempt)
返回类型:bool
参数:
类型 | 参数 | 名称 |
---|---|---|
struct rq * | rq | |
struct task_struct * | p | |
bool | preempt |
6850 | 如果非on_rq或throttled_hierarchy(cfs_rq_of(se))则返回:false |
6854 | set_next_buddy(se) |
6856 | sched_yield() is very simple* The magic of dealing with the ->skip buddy is in pick_next_entity. |
6858 | 返回:true |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |