函数逻辑报告 | 
Source Code:fs\namei.c | 
Create Date:2022-07-29 10:34:57 | 
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick | 
| 首页 | 函数Tree | 
| 注解内核,赢得工具 | 下载SCCT | English | 
函数名称:Name resolution.* This is the basic name resolution function, turning a pathname into* the final dentry. We expect 'base' to be positive and a directory.* Returns 0 and nd will have valid dentry and mnt on success.
函数原型:static int link_path_walk(const char *name, struct nameidata *nd)
返回类型:int
参数:
| 类型 | 参数 | 名称 | 
|---|---|---|
| const char * | name | |
| struct nameidata * | nd | 
| 2062 | name自加 | 
| 2063 | 如果非name则返回:0 | 
| 2067 | 循环 | 
| 2071 | err等于may_lookup(nd) | 
| 2078 | 如果name[0]恒等于'.'则switch hashlen_len(hash_len) | 
| 2079 | 当:hashlen_len(hash_len)恒等于2 | 
| 2085 | 当:hashlen_len(hash_len)恒等于1 | 
| 2088 | 如果此条件成立可能性大(为编译器优化)(type == LAST_NORM)则 | 
| 2090 | flags与等于LOOKUP_JUMPED的反 | 
| 2091 | 如果此条件成立可能性小(为编译器优化)( protected by d_lock & d_flags entries )则 | 
| 2105 | name加等于hashlen_len(hash_len) | 
| 2112 | 循环 | 
| 2113 | name自加 | 
| 2114 | 当此条件成立可能性小(为编译器优化)( * name == '/')循环 | 
| 2115 | 如果此条件成立可能性小(为编译器优化)(! * name)则 | 
| 2126 | 否则 | 
| 2128 | err等于walk_component(nd, WALK_FOLLOW | WALK_MORE) | 
| 2133 | 如果err则 | 
| 2148 | 如果此条件成立可能性小(为编译器优化)(!d_can_lookup(dentry))则 | 
| 2149 | 如果flags按位与RCU pathwalk mode; semi-internal 则 | 
| 2150 | 如果lazy_walk - try to switch to ref-walk mode则返回:负ECHILD | 
| 2153 | 返回:负ENOTDIR | 
| 名称 | 描述 | 
|---|---|
| path_lookupat | Returns 0 and nd will be valid on success; Retuns error, otherwise. | 
| path_parentat | Returns 0 and nd will be valid on success; Retuns error, otherwise. | 
| path_mountpoint | path_mountpoint - look up a path to be umounted*@nd: lookup context*@flags: lookup flags*@path: pointer to container for result* Look up the given name, but don't attempt to revalidate the last component. | 
| path_openat | 
| 源代码转换工具 开放的插件接口  | X | 
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码  |