Lines Matching refs:parman
2 * lib/parman.c - Manager for linear priority array areas
41 #include <linux/parman.h>
44 int (*item_add)(struct parman *parman, struct parman_prio *prio,
46 void (*item_remove)(struct parman *parman, struct parman_prio *prio,
50 struct parman {
59 static int parman_enlarge(struct parman *parman)
61 unsigned long new_count = parman->limit_count +
62 parman->ops->resize_step;
65 err = parman->ops->resize(parman->priv, new_count);
68 parman->limit_count = new_count;
72 static int parman_shrink(struct parman *parman)
74 unsigned long new_count = parman->limit_count -
75 parman->ops->resize_step;
78 if (new_count < parman->ops->base_count)
80 err = parman->ops->resize(parman->priv, new_count);
83 parman->limit_count = new_count;
115 static unsigned long parman_lsort_new_index_find(struct parman *parman,
118 list_for_each_entry_from_reverse(prio, &parman->prio_list, list) {
126 static void __parman_prio_move(struct parman *parman, struct parman_prio *prio,
130 parman->ops->move(parman->priv, item->index, to_index, count);
133 static void parman_prio_shift_down(struct parman *parman,
143 __parman_prio_move(parman, prio, item, to_index, 1);
148 static void parman_prio_shift_up(struct parman *parman,
158 __parman_prio_move(parman, prio, item, to_index, 1);
163 static void parman_prio_item_remove(struct parman *parman,
176 __parman_prio_move(parman, prio, last_item, to_index, 1);
182 static int parman_lsort_item_add(struct parman *parman,
190 if (parman->count + 1 > parman->limit_count) {
191 err = parman_enlarge(parman);
196 new_index = parman_lsort_new_index_find(parman, prio);
197 list_for_each_entry_reverse(prio2, &parman->prio_list, list) {
200 parman_prio_shift_down(parman, prio2);
204 parman->count++;
208 static void parman_lsort_item_remove(struct parman *parman,
212 parman_prio_item_remove(parman, prio, item);
213 list_for_each_entry_continue(prio, &parman->prio_list, list)
214 parman_prio_shift_up(parman, prio);
215 parman->count--;
216 if (parman->limit_count - parman->count >= parman->ops->resize_step)
217 parman_shrink(parman);
230 * parman_create - creates a new parman instance
236 * Each parman instance manages an array area with chunks of entries
261 * The goal of parman is to maintain the priority ordering. The caller
262 * provides @ops with callbacks parman uses to move the items
265 * Returns a pointer to newly created parman instance in case of success,
268 struct parman *parman_create(const struct parman_ops *ops, void *priv)
270 struct parman *parman;
272 parman = kzalloc(sizeof(*parman), GFP_KERNEL);
273 if (!parman)
275 INIT_LIST_HEAD(&parman->prio_list);
276 parman->ops = ops;
277 parman->priv = priv;
278 parman->limit_count = ops->base_count;
279 parman->algo = parman_algos[ops->algo];
280 return parman;
285 * parman_destroy - destroys existing parman instance
286 * @parman: parman instance
290 void parman_destroy(struct parman *parman)
292 WARN_ON(!list_empty(&parman->prio_list));
293 kfree(parman);
298 * parman_prio_init - initializes a parman priority chunk
299 * @parman: parman instance
300 * @prio: parman prio structure to be initialized
308 void parman_prio_init(struct parman *parman, struct parman_prio *prio,
318 list_for_each(pos, &parman->prio_list) {
328 * parman_prio_fini - finalizes use of parman priority chunk
329 * @prio: parman prio structure
341 * parman_item_add - adds a parman item under defined priority
342 * @parman: parman instance
343 * @prio: parman prio instance to add the item to
344 * @item: parman item instance
348 * Adds item to a array managed by parman instance under the specified priority.
352 int parman_item_add(struct parman *parman, struct parman_prio *prio,
355 return parman->algo->item_add(parman, prio, item);
360 * parman_item_del - deletes parman item
361 * @parman: parman instance
362 * @prio: parman prio instance to delete the item from
363 * @item: parman item instance
367 void parman_item_remove(struct parman *parman, struct parman_prio *prio,
370 parman->algo->item_remove(parman, prio, item);