Lines Matching full:elements

13  * function pointer to call when deleting elements.  A data structure for
17  * the elements are grouped in time.  When reaping occurs, all the elements in
26  * All the elements added in the first two seconds are appended to the first
27  * list.  Elements added in the third second go into the second list, and so on.
33  * if it were called at t=11s, there could be elements in the first list that
36  * elements that remain in the first list.  It's therefore possible for elements
42  * every (t/g) seconds.  If it is called less frequently, unused elements will
49  * expired elements in groups of some appreciable size.  This automatically
54  * The elements could have been stored in just one list, but an array of
65  * this happens, all the elements on the LRU list need to be migrated to the end
72  * An MRU Cache is a dynamic data structure that stores its elements in a way
74  * intervals based on insertion time.  This allows elements to be efficiently
94 	struct list_head	reap_list; /* Elements overdue for reaping. */
142 		 * If the LRU list isn't empty, migrate its elements to the tail  in _xfs_mru_cache_migrate()
157 		 * If reaping is so far behind that all the elements on all the  in _xfs_mru_cache_migrate()
219  * When destroying or reaping, all the elements that were migrated to the reap
312  * count and a free function to use when deleting elements.  This function
377  * guaranteed that all the free functions for all the elements have finished