16  * Ext2 and ext4 use this cache for deduplication of extended attribute blocks.
21  * identifies a cache entry.
33 	/* Maximum entries in cache to avoid degrading hash too much */
38 	/* Number of entries in cache */
41 	/* Work for shrinking when the cache has too many entries */
47 static unsigned long mb_cache_shrink(struct mb_cache *cache,
50 static inline struct hlist_bl_head *mb_cache_entry_head(struct mb_cache *cache,  in mb_cache_entry_head()  argument
53 	return &cache->c_hash[hash_32(key, cache->c_bucket_bits)];  in mb_cache_entry_head()
58  * in cache
63  * mb_cache_entry_create - create entry in cache
64  * @cache - cache where the entry should be created
70  * Creates entry in @cache with key @key and value @value. The function returns
71  * -EBUSY if entry with the same key and value already exists in cache.
74 int mb_cache_entry_create(struct mb_cache *cache, gfp_t mask, u32 key,  in mb_cache_entry_create()  argument
82 	if (cache->c_entry_count >= cache->c_max_entries)  in mb_cache_entry_create()
83 		schedule_work(&cache->c_shrink_work);  in mb_cache_entry_create()
85 	if (cache->c_entry_count >= 2*cache->c_max_entries)  in mb_cache_entry_create()
86 		mb_cache_shrink(cache, SYNC_SHRINK_BATCH);  in mb_cache_entry_create()
97 	 * avoids nesting of cache->c_list_lock into hash table bit locks which  in mb_cache_entry_create()
105 	head = mb_cache_entry_head(cache, key);  in mb_cache_entry_create()
116 	spin_lock(&cache->c_list_lock);  in mb_cache_entry_create()
117 	list_add_tail(&entry->e_list, &cache->c_list);  in mb_cache_entry_create()
118 	cache->c_entry_count++;  in mb_cache_entry_create()
119 	spin_unlock(&cache->c_list_lock);  in mb_cache_entry_create()
120 	mb_cache_entry_put(cache, entry);  in mb_cache_entry_create()
126 void __mb_cache_entry_free(struct mb_cache *cache, struct mb_cache_entry *entry)  in __mb_cache_entry_free()  argument
130 	head = mb_cache_entry_head(cache, entry->e_key);  in __mb_cache_entry_free()
151 static struct mb_cache_entry *__entry_find(struct mb_cache *cache,  in __entry_find()  argument
159 	head = mb_cache_entry_head(cache, key);  in __entry_find()
177 		mb_cache_entry_put(cache, old_entry);  in __entry_find()
184  * @cache: cache where we should search
187  * Search in @cache for a reusable entry with key @key. Grabs reference to the
190 struct mb_cache_entry *mb_cache_entry_find_first(struct mb_cache *cache,  in mb_cache_entry_find_first()  argument
193 	return __entry_find(cache, NULL, key);  in mb_cache_entry_find_first()
199  * @cache: cache where we should search
207 struct mb_cache_entry *mb_cache_entry_find_next(struct mb_cache *cache,  in mb_cache_entry_find_next()  argument
210 	return __entry_find(cache, entry, entry->e_key);  in mb_cache_entry_find_next()
215  * mb_cache_entry_get - get a cache entry by value (and key)
216  * @cache - cache we work with
220 struct mb_cache_entry *mb_cache_entry_get(struct mb_cache *cache, u32 key,  in mb_cache_entry_get()  argument
227 	head = mb_cache_entry_head(cache, key);  in mb_cache_entry_get()
241 /* mb_cache_entry_delete_or_get - remove a cache entry if it has no users
242  * @cache - cache we work with
246  * Remove entry from cache @cache with key @key and value @value. The removal
248  * entry was successfully removed or there's no entry in cache. Otherwise the
252 struct mb_cache_entry *mb_cache_entry_delete_or_get(struct mb_cache *cache,  in mb_cache_entry_delete_or_get()  argument
257 	entry = mb_cache_entry_get(cache, key, value);  in mb_cache_entry_delete_or_get()
268 	spin_lock(&cache->c_list_lock);  in mb_cache_entry_delete_or_get()
271 	cache->c_entry_count--;  in mb_cache_entry_delete_or_get()
272 	spin_unlock(&cache->c_list_lock);  in mb_cache_entry_delete_or_get()
273 	__mb_cache_entry_free(cache, entry);  in mb_cache_entry_delete_or_get()
278 /* mb_cache_entry_touch - cache entry got used
279  * @cache - cache the entry belongs to
282  * Marks entry as used to give hit higher chances of surviving in cache.
284 void mb_cache_entry_touch(struct mb_cache *cache,  in mb_cache_entry_touch()  argument
294 	struct mb_cache *cache = container_of(shrink, struct mb_cache,  in mb_cache_count()  local
297 	return cache->c_entry_count;  in mb_cache_count()
300 /* Shrink number of entries in cache */
301 static unsigned long mb_cache_shrink(struct mb_cache *cache,  in mb_cache_shrink()  argument
307 	spin_lock(&cache->c_list_lock);  in mb_cache_shrink()
308 	while (nr_to_scan-- && !list_empty(&cache->c_list)) {  in mb_cache_shrink()
309 		entry = list_first_entry(&cache->c_list,  in mb_cache_shrink()
315 			list_move_tail(&entry->e_list, &cache->c_list);  in mb_cache_shrink()
319 		cache->c_entry_count--;  in mb_cache_shrink()
320 		spin_unlock(&cache->c_list_lock);  in mb_cache_shrink()
321 		__mb_cache_entry_free(cache, entry);  in mb_cache_shrink()
324 		spin_lock(&cache->c_list_lock);  in mb_cache_shrink()
326 	spin_unlock(&cache->c_list_lock);  in mb_cache_shrink()
334 	struct mb_cache *cache = container_of(shrink, struct mb_cache,  in mb_cache_scan()  local
336 	return mb_cache_shrink(cache, sc->nr_to_scan);  in mb_cache_scan()
339 /* We shrink 1/X of the cache when we have too many entries in it */
344 	struct mb_cache *cache = container_of(work, struct mb_cache,  in mb_cache_shrink_worker()  local
346 	mb_cache_shrink(cache, cache->c_max_entries / SHRINK_DIVISOR);  in mb_cache_shrink_worker()
350  * mb_cache_create - create cache
353  * Create cache for keys with 2^bucket_bits hash entries.
357 	struct mb_cache *cache;  in mb_cache_create()  local
361 	cache = kzalloc(sizeof(struct mb_cache), GFP_KERNEL);  in mb_cache_create()
362 	if (!cache)  in mb_cache_create()
364 	cache->c_bucket_bits = bucket_bits;  in mb_cache_create()
365 	cache->c_max_entries = bucket_count << 4;  in mb_cache_create()
366 	INIT_LIST_HEAD(&cache->c_list);  in mb_cache_create()
367 	spin_lock_init(&cache->c_list_lock);  in mb_cache_create()
368 	cache->c_hash = kmalloc_array(bucket_count,  in mb_cache_create()
371 	if (!cache->c_hash) {  in mb_cache_create()
372 		kfree(cache);  in mb_cache_create()
376 		INIT_HLIST_BL_HEAD(&cache->c_hash[i]);  in mb_cache_create()
378 	cache->c_shrink.count_objects = mb_cache_count;  in mb_cache_create()
379 	cache->c_shrink.scan_objects = mb_cache_scan;  in mb_cache_create()
380 	cache->c_shrink.seeks = DEFAULT_SEEKS;  in mb_cache_create()
381 	if (register_shrinker(&cache->c_shrink, "mbcache-shrinker")) {  in mb_cache_create()
382 		kfree(cache->c_hash);  in mb_cache_create()
383 		kfree(cache);  in mb_cache_create()
387 	INIT_WORK(&cache->c_shrink_work, mb_cache_shrink_worker);  in mb_cache_create()
389 	return cache;  in mb_cache_create()
397  * mb_cache_destroy - destroy cache
398  * @cache: the cache to destroy
400  * Free all entries in cache and cache itself. Caller must make sure nobody
401  * (except shrinker) can reach @cache when calling this.
403 void mb_cache_destroy(struct mb_cache *cache)  in mb_cache_destroy()  argument
407 	unregister_shrinker(&cache->c_shrink);  in mb_cache_destroy()
410 	 * We don't bother with any locking. Cache must not be used at this  in mb_cache_destroy()
413 	list_for_each_entry_safe(entry, next, &cache->c_list, e_list) {  in mb_cache_destroy()
416 		mb_cache_entry_put(cache, entry);  in mb_cache_destroy()
418 	kfree(cache->c_hash);  in mb_cache_destroy()
419 	kfree(cache);  in mb_cache_destroy()
442 MODULE_DESCRIPTION("Meta block cache (for extended attributes)");