Lines Matching refs:entry
26 struct btrfs_lru_cache_entry *entry; in match_entry() local
28 list_for_each_entry(entry, head, list) { in match_entry()
29 if (entry->key == key && entry->gen == gen) in match_entry()
30 return entry; in match_entry()
49 struct btrfs_lru_cache_entry *entry; in btrfs_lru_cache_lookup() local
55 entry = match_entry(head, key, gen); in btrfs_lru_cache_lookup()
56 if (entry) in btrfs_lru_cache_lookup()
57 list_move_tail(&entry->lru_list, &cache->lru_list); in btrfs_lru_cache_lookup()
59 return entry; in btrfs_lru_cache_lookup()
71 struct btrfs_lru_cache_entry *entry) in btrfs_lru_cache_remove() argument
73 struct list_head *prev = entry->list.prev; in btrfs_lru_cache_remove()
78 list_del(&entry->list); in btrfs_lru_cache_remove()
79 list_del(&entry->lru_list); in btrfs_lru_cache_remove()
89 head = mtree_erase(&cache->entries, entry->key); in btrfs_lru_cache_remove()
94 kfree(entry); in btrfs_lru_cache_remove()
158 struct btrfs_lru_cache_entry *entry; in btrfs_lru_cache_clear() local
161 list_for_each_entry_safe(entry, tmp, &cache->lru_list, lru_list) in btrfs_lru_cache_clear()
162 btrfs_lru_cache_remove(cache, entry); in btrfs_lru_cache_clear()