mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-08-27 19:29:37 +00:00
![]() dm_btree_find_next_single() can short-circuit the search for a block with a return of -ENODATA if all entries are higher than the search key passed to lower_bound(). This hasn't been a problem because of the way the btree has been used by DM thinp. But it must be fixed now in preparation for fixing the race in DM thinp's handling of simultaneous block discard vs allocation. Otherwise, once that fix is in place, some of the blocks in a discard would not be unmapped as expected. Signed-off-by: Joe Thornber <ejt@redhat.com> Signed-off-by: Mike Snitzer <snitzer@redhat.com> |
||
---|---|---|
.. | ||
dm-array.c | ||
dm-array.h | ||
dm-bitset.c | ||
dm-bitset.h | ||
dm-block-manager.c | ||
dm-block-manager.h | ||
dm-btree-internal.h | ||
dm-btree-remove.c | ||
dm-btree-spine.c | ||
dm-btree.c | ||
dm-btree.h | ||
dm-persistent-data-internal.h | ||
dm-space-map-common.c | ||
dm-space-map-common.h | ||
dm-space-map-disk.c | ||
dm-space-map-disk.h | ||
dm-space-map-metadata.c | ||
dm-space-map-metadata.h | ||
dm-space-map.h | ||
dm-transaction-manager.c | ||
dm-transaction-manager.h | ||
Kconfig | ||
Makefile |