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;
114 static unsigned long parman_lsort_new_index_find(struct parman *parman,
117 list_for_each_entry_from_reverse(prio, &parman->prio_list, list) {
125 static void __parman_prio_move(struct parman *parman, struct parman_prio *prio,
129 parman->ops->move(parman->priv, item->index, to_index, count);
132 static void parman_prio_shift_down(struct parman *parman,
142 __parman_prio_move(parman, prio, item, to_index, 1);
147 static void parman_prio_shift_up(struct parman *parman,
157 __parman_prio_move(parman, prio, item, to_index, 1);
162 static void parman_prio_item_remove(struct parman *parman,
175 __parman_prio_move(parman, prio, last_item, to_index, 1);
181 static int parman_lsort_item_add(struct parman *parman,
189 if (parman->count + 1 > parman->limit_count) {
190 err = parman_enlarge(parman);
195 new_index = parman_lsort_new_index_find(parman, prio);
196 list_for_each_entry_reverse(prio2, &parman->prio_list, list) {
199 parman_prio_shift_down(parman, prio2);
203 parman->count++;
207 static void parman_lsort_item_remove(struct parman *parman,
211 parman_prio_item_remove(parman, prio, item);
212 list_for_each_entry_continue(prio, &parman->prio_list, list)
213 parman_prio_shift_up(parman, prio);
214 parman->count--;
215 if (parman->limit_count - parman->count >= parman->ops->resize_step)
216 parman_shrink(parman);
229 * parman_create - creates a new parman instance
235 * Each parman instance manages an array area with chunks of entries
260 * The goal of parman is to maintain the priority ordering. The caller
261 * provides @ops with callbacks parman uses to move the items
264 * Returns a pointer to newly created parman instance in case of success,
267 struct parman *parman_create(const struct parman_ops *ops, void *priv)
269 struct parman *parman;
271 parman = kzalloc(sizeof(*parman), GFP_KERNEL);
272 if (!parman)
274 INIT_LIST_HEAD(&parman->prio_list);
275 parman->ops = ops;
276 parman->priv = priv;
277 parman->limit_count = ops->base_count;
278 parman->algo = parman_algos[ops->algo];
279 return parman;
284 * parman_destroy - destroys existing parman instance
285 * @parman: parman instance
289 void parman_destroy(struct parman *parman)
291 WARN_ON(!list_empty(&parman->prio_list));
292 kfree(parman);
297 * parman_prio_init - initializes a parman priority chunk
298 * @parman: parman instance
299 * @prio: parman prio structure to be initialized
307 void parman_prio_init(struct parman *parman, struct parman_prio *prio,
317 list_for_each(pos, &parman->prio_list) {
327 * parman_prio_fini - finalizes use of parman priority chunk
328 * @prio: parman prio structure
340 * parman_item_add - adds a parman item under defined priority
341 * @parman: parman instance
342 * @prio: parman prio instance to add the item to
343 * @item: parman item instance
347 * Adds item to a array managed by parman instance under the specified priority.
351 int parman_item_add(struct parman *parman, struct parman_prio *prio,
354 return parman->algo->item_add(parman, prio, item);
359 * parman_item_remove - deletes parman item
360 * @parman: parman instance
361 * @prio: parman prio instance to delete the item from
362 * @item: parman item instance
366 void parman_item_remove(struct parman *parman, struct parman_prio *prio,
369 parman->algo->item_remove(parman, prio, item);