Lines Matching defs:store
10 * The MRU Cache data structure consists of a data store, an array of lists and
37 * to remain in the data store even after they've been inactive for up to
78 * both the data store and to one of the lists. It must also be possible to
81 * a) Walk a list, removing the corresponding data store entry for each item.
82 * b) Look up a data store entry, then access its list entry directly.
92 struct radix_tree_root store; /* Core storage data structure. */
134 /* Nothing to do if the data store is empty. */
198 * If the data store is empty, initialise time zero, leave grp set to
221 * data store, removing it from the reap list, calling the client's free
238 /* Remove the element from the data store. */
239 radix_tree_delete(&mru->store, elem->key);
356 INIT_RADIX_TREE(&mru->store, GFP_ATOMIC);
415 * To insert an element, call xfs_mru_cache_insert() with the data store, the
438 error = radix_tree_insert(&mru->store, key, elem);
449 * xfs_mru_cache_remove() with the data store and the element's key. On success
465 elem = radix_tree_delete(&mru->store, key);
475 * with the data store and the element's key.
491 * data store and the element's key. If found, the element will be moved to the
521 elem = radix_tree_lookup(&mru->store, key);
535 * with the data store pointer.