aboutsummaryrefslogtreecommitdiff
path: root/tools/perf/scripts/python/bin/export-to-postgresql-report
diff options
context:
space:
mode:
authorJoe Thornber <[email protected]>2016-07-01 11:09:13 +0100
committerMike Snitzer <[email protected]>2016-07-20 12:43:34 -0400
commite7e0f730477dea190fbc18c2d93338dacee82cea (patch)
treea32f1e357ed773559a8db6a9cf8315c4ae78cbd5 /tools/perf/scripts/python/bin/export-to-postgresql-report
parent89d3d9a1e38a6bd453038cfdc7e1576ef2d19719 (diff)
dm btree: fix a bug in dm_btree_find_next_single()
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 <[email protected]> Signed-off-by: Mike Snitzer <[email protected]>
Diffstat (limited to 'tools/perf/scripts/python/bin/export-to-postgresql-report')
0 files changed, 0 insertions, 0 deletions