函数逻辑报告 |
Source Code:fs\namei.c |
Create Date:2022-07-29 10:34:56 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:pick_link
函数原型:static int pick_link(struct nameidata *nd, struct path *link, struct inode *inode, unsigned seq)
返回类型:int
参数:
类型 | 参数 | 名称 |
---|---|---|
struct nameidata * | nd | |
struct path * | link | |
struct inode * | inode | |
unsigned | seq |
1717 | 如果此条件成立可能性小(为编译器优化)(total_link_count++ >= MAXSYMLINKS)则 |
1718 | path_to_nameidata(link, nd) |
1719 | 返回:负ELOOP |
1721 | 如果非flags按位与RCU pathwalk mode; semi-internal 的值则 |
1725 | error等于nd_alloc_stack(nd) |
1726 | 如果此条件成立可能性小(为编译器优化)(error)则 |
1729 | drop_links(nd) |
1730 | depth等于0 |
1731 | flags与等于RCU pathwalk mode; semi-internal 的反 |
1732 | mnt = NULL |
1733 | dentry = NULL |
1735 | 否则如果此条件成立可能性大(为编译器优化)(lazy_walk - try to switch to ref-walk mode)恒等于0则error等于nd_alloc_stack(nd) |
1738 | 如果error则 |
1746 | clear_delayed_call( & done) |
1747 | link_inode等于inode |
1749 | 返回:1 |
名称 | 描述 |
---|---|
step_into | Do we need to follow links? We _really_ want to be able* to do this check without having to look at inode->i_op,* so we keep a cache of "no, this doesn't need follow_link"* for the common case. |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |