The dentry cache is built using a hash table and is hashed by the name of the object.
使用散列表创建dentry缓存，并且根据对象名分配缓存。
Lookups are performed on the dentry cache, which result in an object in the inode cache.
查找是在dentry缓存中执行的，这将导致inode缓存中出现一个对象。
You can find the functions associated with the dentry cache in ./linux/fs/dcache.c (and ./linux/include/linux/dcache.h).
您可以在./linux/fs/dcache.c和 ./linux/include/linux/dcache.h 中找到与dentry缓存相关的函数。
Entries for the dentry cache are allocated from the dentry_cache slab allocator and use a least-recently-used (LRU) algorithm to prune entries when memory pressure exists.
dentry缓存的条目从dentry_cacheslab分配器分配，并且在缓存存在压力时使用最近不使用(least - recently - used,LRU)算法删除条目。
Entries for the dentry cache are allocated from the dentry_cache slab allocator and use a least-recently-used (LRU) algorithm to prune entries when memory pressure exists.
dentry缓存的条目从dentry_cacheslab分配器分配，并且在缓存存在压力时使用最近不使用(least - recently - used,LRU)算法删除条目。
应用推荐