用“dentry”造句大全，dentry造句
The dentry cache is built using a hash table and is hashed by the name of the object.
dentry緩存的條目從dentry_cacheslab分配器分配，並且在緩存存在壓力時使用最近不使用(least - recently - used,LRU)算法刪除條目。
使用散列表創建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.
