203 	struct xfs_mru_cache_elem *elem)  in _xfs_mru_cache_list_insert()  argument
226 	list_add_tail(&elem->list_node, mru->lists + grp);  in _xfs_mru_cache_list_insert()
243 	struct xfs_mru_cache_elem *elem, *next;  in _xfs_mru_cache_clear_reap_list()  local
247 	list_for_each_entry_safe(elem, next, &mru->reap_list, list_node) {  in _xfs_mru_cache_clear_reap_list()
250 		radix_tree_delete(&mru->store, elem->key);  in _xfs_mru_cache_clear_reap_list()
256 		list_move(&elem->list_node, &tmp);  in _xfs_mru_cache_clear_reap_list()
260 	list_for_each_entry_safe(elem, next, &tmp, list_node) {  in _xfs_mru_cache_clear_reap_list()
261 		list_del_init(&elem->list_node);  in _xfs_mru_cache_clear_reap_list()
262 		mru->free_func(elem);  in _xfs_mru_cache_clear_reap_list()
432 	struct xfs_mru_cache_elem *elem)  in xfs_mru_cache_insert()  argument
443 	INIT_LIST_HEAD(&elem->list_node);  in xfs_mru_cache_insert()
444 	elem->key = key;  in xfs_mru_cache_insert()
447 	error = radix_tree_insert(&mru->store, key, elem);  in xfs_mru_cache_insert()
450 		_xfs_mru_cache_list_insert(mru, elem);  in xfs_mru_cache_insert()
467 	struct xfs_mru_cache_elem *elem;  in xfs_mru_cache_remove()  local
474 	elem = radix_tree_delete(&mru->store, key);  in xfs_mru_cache_remove()
475 	if (elem)  in xfs_mru_cache_remove()
476 		list_del(&elem->list_node);  in xfs_mru_cache_remove()
479 	return elem;  in xfs_mru_cache_remove()
491 	struct xfs_mru_cache_elem *elem;  in xfs_mru_cache_delete()  local
493 	elem = xfs_mru_cache_remove(mru, key);  in xfs_mru_cache_delete()
494 	if (elem)  in xfs_mru_cache_delete()
495 		mru->free_func(elem);  in xfs_mru_cache_delete()
523 	struct xfs_mru_cache_elem *elem;  in xfs_mru_cache_lookup()  local
530 	elem = radix_tree_lookup(&mru->store, key);  in xfs_mru_cache_lookup()
531 	if (elem) {  in xfs_mru_cache_lookup()
532 		list_del(&elem->list_node);  in xfs_mru_cache_lookup()
533 		_xfs_mru_cache_list_insert(mru, elem);  in xfs_mru_cache_lookup()
538 	return elem;  in xfs_mru_cache_lookup()