1. 21 7月, 2016 1 次提交
    • 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
  2. 19 7月, 2016 30 次提交
  3. 06 7月, 2016 1 次提交
  4. 02 7月, 2016 1 次提交
  5. 01 7月, 2016 2 次提交
  6. 17 6月, 2016 1 次提交
  7. 15 6月, 2016 4 次提交
新手
引导
客服 返回
顶部