dentry造句怎么写

dentry缓存的条目从dentry_cacheslab分配器分配，并且在缓存存在压力时使用最近不使用(least - recently - used,LRU)算法删除条目。

使用散列表创建dentry缓存，并且根据对象名分配缓存。

The dentry cache is built using a hash table and is hashed by the name of the object.

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.