函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:fs\dcache.c Create Date:2022-07-29 10:37:24
Last Modify:2020-03-18 10:27:32 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：d_hash

函数原型：static inline struct hlist_bl_head *d_hash(unsigned int hash)

返回类型：struct hlist_bl_head

参数：

类型参数名称
unsigned inthash
103  返回:dentry_hashtable加hash右移This is the single most critical data structure when it comes* to the dcache: the hashtable for lookups. Somebody should try* to make this good - I've just made it work.* This hash-function tries to avoid losing too many bits of hash位的值
调用者
名称描述
___d_dropd_drop - drop a dentry*@dentry: dentry to drop* d_drop() unhashes the entry from the parent dentry hashes, so that it won't* be found through a VFS lookup any more
__d_lookup_rcu__d_lookup_rcu - search for a dentry (racy, store-free)*@parent: parent dentry*@name: qstr of name we wish to find*@seqp: returns d_seq value at the point where the dentry was found* Returns: dentry, or NULL* __d_lookup_rcu is the dcache lookup function
__d_lookup__d_lookup - search for a dentry (racy)*@parent: parent dentry*@name: qstr of name we wish to find* Returns: dentry, or NULL* __d_lookup is like d_lookup, however it may (rarely) return a* false-negative result due to unrelated rename activity
__d_rehash