93 	struct list_head	*lists;    /* Array of lists, one per grp.  */  member
145 		lru_list = mru->lists + mru->lru_grp;  in _xfs_mru_cache_migrate()
171 		lru_list = mru->lists + ((mru->lru_grp + grp) % mru->grp_count);  in _xfs_mru_cache_migrate()
215 	list_add_tail(&elem->list_node, mru->lists + grp);  in _xfs_mru_cache_list_insert()
271 	ASSERT(mru && mru->lists);  in _xfs_mru_cache_reap()
272 	if (!mru || !mru->lists)  in _xfs_mru_cache_reap()
342 	mru->lists = kzalloc(mru->grp_count * sizeof(*mru->lists),  in xfs_mru_cache_create()
344 	if (!mru->lists) {  in xfs_mru_cache_create()
350 		INIT_LIST_HEAD(mru->lists + grp);  in xfs_mru_cache_create()
378 	if (!mru || !mru->lists)  in xfs_mru_cache_flush()
398 	if (!mru || !mru->lists)  in xfs_mru_cache_destroy()
403 	kfree(mru->lists);  in xfs_mru_cache_destroy()
458 	ASSERT(mru && mru->lists);  in xfs_mru_cache_remove()
459 	if (!mru || !mru->lists)  in xfs_mru_cache_remove()
514 	ASSERT(mru && mru->lists);  in xfs_mru_cache_lookup()
515 	if (!mru || !mru->lists)  in xfs_mru_cache_lookup()