函数逻辑报告 |
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 |
函数名称: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.
函数原型:static inline int step_into(struct nameidata *nd, struct path *path, int flags, struct inode *inode, unsigned seq)
返回类型:int
参数:
类型 | 参数 | 名称 |
---|---|---|
struct nameidata * | nd | |
struct path * | path | |
int | flags | |
struct inode * | inode | |
unsigned | seq |
1765 | 如果此条件成立可能性大(为编译器优化)(!d_is_symlink(dentry))或非flags按位与WALK_FOLLOW或flags按位与llow links at the end 的值则 |
1774 | 如果flags按位与RCU pathwalk mode; semi-internal 则 |
名称 | 描述 |
---|---|
walk_component | |
do_last | Handle the last step of open() |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |