Lines Matching +full:1 +full:- +full:cell
1 // SPDX-License-Identifier: GPL-2.0-only
9 #include "dm-bio-prison-v1.h"
10 #include "dm-bio-prison-v2.h"
17 /*----------------------------------------------------------------*/
23 struct rb_root cell; member
34 /*----------------------------------------------------------------*/
50 prison->num_locks = num_locks; in dm_bio_prison_create()
52 for (i = 0; i < prison->num_locks; i++) { in dm_bio_prison_create()
53 spin_lock_init(&prison->regions[i].lock); in dm_bio_prison_create()
54 prison->regions[i].cell = RB_ROOT; in dm_bio_prison_create()
57 ret = mempool_init_slab_pool(&prison->cell_pool, MIN_CELLS, _cell_cache); in dm_bio_prison_create()
69 mempool_exit(&prison->cell_pool); in dm_bio_prison_destroy()
76 return mempool_alloc(&prison->cell_pool, gfp); in dm_bio_prison_alloc_cell()
81 struct dm_bio_prison_cell *cell) in dm_bio_prison_free_cell() argument
83 mempool_free(cell, &prison->cell_pool); in dm_bio_prison_free_cell()
89 struct dm_bio_prison_cell *cell) in __setup_new_cell() argument
91 memcpy(&cell->key, key, sizeof(cell->key)); in __setup_new_cell()
92 cell->holder = holder; in __setup_new_cell()
93 bio_list_init(&cell->bios); in __setup_new_cell()
99 if (lhs->virtual < rhs->virtual) in cmp_keys()
100 return -1; in cmp_keys()
102 if (lhs->virtual > rhs->virtual) in cmp_keys()
103 return 1; in cmp_keys()
105 if (lhs->dev < rhs->dev) in cmp_keys()
106 return -1; in cmp_keys()
108 if (lhs->dev > rhs->dev) in cmp_keys()
109 return 1; in cmp_keys()
111 if (lhs->block_end <= rhs->block_begin) in cmp_keys()
112 return -1; in cmp_keys()
114 if (lhs->block_begin >= rhs->block_end) in cmp_keys()
115 return 1; in cmp_keys()
122 return dm_hash_locks_index((key->block_begin >> BIO_PRISON_MAX_RANGE_SHIFT), in lock_nr()
128 if (WARN_ON_ONCE(key->block_end - key->block_begin > BIO_PRISON_MAX_RANGE)) in dm_cell_key_has_valid_range()
130 if (WARN_ON_ONCE((key->block_begin >> BIO_PRISON_MAX_RANGE_SHIFT) != in dm_cell_key_has_valid_range()
131 (key->block_end - 1) >> BIO_PRISON_MAX_RANGE_SHIFT)) in dm_cell_key_has_valid_range()
145 struct rb_node **new = &root->rb_node, *parent = NULL; in __bio_detain()
148 struct dm_bio_prison_cell *cell = in __bio_detain() local
151 r = cmp_keys(key, &cell->key); in __bio_detain()
155 new = &((*new)->rb_left); in __bio_detain()
157 new = &((*new)->rb_right); in __bio_detain()
160 bio_list_add(&cell->bios, inmate); in __bio_detain()
161 *cell_result = cell; in __bio_detain()
162 return 1; in __bio_detain()
169 rb_link_node(&cell_prealloc->node, parent, new); in __bio_detain()
170 rb_insert_color(&cell_prealloc->node, root); in __bio_detain()
182 unsigned l = lock_nr(key, prison->num_locks); in bio_detain()
184 spin_lock_irq(&prison->regions[l].lock); in bio_detain()
185 r = __bio_detain(&prison->regions[l].cell, key, inmate, cell_prealloc, cell_result); in bio_detain()
186 spin_unlock_irq(&prison->regions[l].lock); in bio_detain()
205 struct dm_bio_prison_cell *cell, in __cell_release() argument
208 rb_erase(&cell->node, root); in __cell_release()
211 if (cell->holder) in __cell_release()
212 bio_list_add(inmates, cell->holder); in __cell_release()
213 bio_list_merge(inmates, &cell->bios); in __cell_release()
218 struct dm_bio_prison_cell *cell, in dm_cell_release() argument
221 unsigned l = lock_nr(&cell->key, prison->num_locks); in dm_cell_release()
223 spin_lock_irq(&prison->regions[l].lock); in dm_cell_release()
224 __cell_release(&prison->regions[l].cell, cell, bios); in dm_cell_release()
225 spin_unlock_irq(&prison->regions[l].lock); in dm_cell_release()
233 struct dm_bio_prison_cell *cell, in __cell_release_no_holder() argument
236 rb_erase(&cell->node, root); in __cell_release_no_holder()
237 bio_list_merge(inmates, &cell->bios); in __cell_release_no_holder()
241 struct dm_bio_prison_cell *cell, in dm_cell_release_no_holder() argument
244 unsigned l = lock_nr(&cell->key, prison->num_locks); in dm_cell_release_no_holder()
247 spin_lock_irqsave(&prison->regions[l].lock, flags); in dm_cell_release_no_holder()
248 __cell_release_no_holder(&prison->regions[l].cell, cell, inmates); in dm_cell_release_no_holder()
249 spin_unlock_irqrestore(&prison->regions[l].lock, flags); in dm_cell_release_no_holder()
254 struct dm_bio_prison_cell *cell, blk_status_t error) in dm_cell_error() argument
260 dm_cell_release(prison, cell, &bios); in dm_cell_error()
263 bio->bi_status = error; in dm_cell_error()
272 struct dm_bio_prison_cell *cell) in dm_cell_visit_release() argument
274 unsigned l = lock_nr(&cell->key, prison->num_locks); in dm_cell_visit_release()
275 spin_lock_irq(&prison->regions[l].lock); in dm_cell_visit_release()
276 visit_fn(context, cell); in dm_cell_visit_release()
277 rb_erase(&cell->node, &prison->regions[l].cell); in dm_cell_visit_release()
278 spin_unlock_irq(&prison->regions[l].lock); in dm_cell_visit_release()
282 /*----------------------------------------------------------------*/
308 spin_lock_init(&ds->lock); in dm_deferred_set_create()
309 ds->current_entry = 0; in dm_deferred_set_create()
310 ds->sweeper = 0; in dm_deferred_set_create()
312 ds->entries[i].ds = ds; in dm_deferred_set_create()
313 ds->entries[i].count = 0; in dm_deferred_set_create()
314 INIT_LIST_HEAD(&ds->entries[i].work_items); in dm_deferred_set_create()
332 spin_lock_irqsave(&ds->lock, flags); in dm_deferred_entry_inc()
333 entry = ds->entries + ds->current_entry; in dm_deferred_entry_inc()
334 entry->count++; in dm_deferred_entry_inc()
335 spin_unlock_irqrestore(&ds->lock, flags); in dm_deferred_entry_inc()
343 return (index + 1) % DEFERRED_SET_SIZE; in ds_next()
348 while ((ds->sweeper != ds->current_entry) && in __sweep()
349 !ds->entries[ds->sweeper].count) { in __sweep()
350 list_splice_init(&ds->entries[ds->sweeper].work_items, head); in __sweep()
351 ds->sweeper = ds_next(ds->sweeper); in __sweep()
354 if ((ds->sweeper == ds->current_entry) && !ds->entries[ds->sweeper].count) in __sweep()
355 list_splice_init(&ds->entries[ds->sweeper].work_items, head); in __sweep()
362 spin_lock_irqsave(&entry->ds->lock, flags); in dm_deferred_entry_dec()
363 BUG_ON(!entry->count); in dm_deferred_entry_dec()
364 --entry->count; in dm_deferred_entry_dec()
365 __sweep(entry->ds, head); in dm_deferred_entry_dec()
366 spin_unlock_irqrestore(&entry->ds->lock, flags); in dm_deferred_entry_dec()
371 * Returns 1 if deferred or 0 if no pending items to delay job.
375 int r = 1; in dm_deferred_set_add_work()
378 spin_lock_irq(&ds->lock); in dm_deferred_set_add_work()
379 if ((ds->sweeper == ds->current_entry) && in dm_deferred_set_add_work()
380 !ds->entries[ds->current_entry].count) in dm_deferred_set_add_work()
383 list_add(work, &ds->entries[ds->current_entry].work_items); in dm_deferred_set_add_work()
384 next_entry = ds_next(ds->current_entry); in dm_deferred_set_add_work()
385 if (!ds->entries[next_entry].count) in dm_deferred_set_add_work()
386 ds->current_entry = next_entry; in dm_deferred_set_add_work()
388 spin_unlock_irq(&ds->lock); in dm_deferred_set_add_work()
394 /*----------------------------------------------------------------*/
400 return -ENOMEM; in dm_bio_prison_init_v1()
436 while (i--) in dm_bio_prison_init()
446 while (i--) in dm_bio_prison_exit()
457 MODULE_AUTHOR("Joe Thornber <dm-devel@lists.linux.dev>");