• J
    dm btree: fix a bug in dm_btree_find_next_single() · e7e0f730
    Joe Thornber 提交于
    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: NJoe Thornber <ejt@redhat.com>
    Signed-off-by: NMike Snitzer <snitzer@redhat.com>
    e7e0f730
dm-btree.c 22.1 KB