Lines Matching refs:cache_queue_policy_
74 static void destroy_cache_queue_policy(struct cache_queue_policy_ *);
75 static struct cache_queue_policy_ *init_cache_queue_policy(void);
81 * cache_queue_policy_ with cache_update_item function changed.
111 struct cache_queue_policy_ *queue_policy;
115 queue_policy = (struct cache_queue_policy_ *)policy;
125 struct cache_queue_policy_ *queue_policy;
129 queue_policy = (struct cache_queue_policy_ *)policy;
138 struct cache_queue_policy_ *queue_policy;
141 queue_policy = (struct cache_queue_policy_ *)policy;
149 struct cache_queue_policy_ *queue_policy;
152 queue_policy = (struct cache_queue_policy_ *)policy;
162 struct cache_queue_policy_ *queue_policy;
166 queue_policy = (struct cache_queue_policy_ *)policy;
177 struct cache_queue_policy_ *queue_policy;
181 queue_policy = (struct cache_queue_policy_ *)policy;
190 * Initializes cache_queue_policy_ by filling the structure with the functions
193 static struct cache_queue_policy_ *
196 struct cache_queue_policy_ *retval;
224 destroy_cache_queue_policy(struct cache_queue_policy_ *queue_policy)
240 * Makes cache_queue_policy_ behave like FIFO policy - we don't do anything,
257 struct cache_queue_policy_ *retval;
270 struct cache_queue_policy_ *queue_policy;
273 queue_policy = (struct cache_queue_policy_ *)policy;
279 * Makes cache_queue_policy_ behave like LRU policy. On each update, cache
287 struct cache_queue_policy_ *queue_policy;
291 queue_policy = (struct cache_queue_policy_ *)policy;
302 struct cache_queue_policy_ *retval;
315 struct cache_queue_policy_ *queue_policy;
318 queue_policy = (struct cache_queue_policy_ *)policy;
325 * LRU and FIFO (both based on cache_queue_policy_). Almost all cache_policy_