22 Sep, 2016
2 commits
-
More efficient way to iterate an array due to prefetching (makes use of
the new dm_btree_cursor_* api).Signed-off-by: Joe Thornber
Signed-off-by: Mike Snitzer -
dm_array_new() creates a new, populated array more efficiently than
starting with an empty one and resizing.Signed-off-by: Joe Thornber
Signed-off-by: Mike Snitzer
01 Nov, 2015
1 commit
-
dm_bm_unlock and dm_tm_unlock return an integer value but the returned
value is always 0. The calling code sometimes checks the return value
and sometimes doesn't.Eliminate these unnecessary return values and also the checks for them.
Signed-off-by: Mikulas Patocka
Signed-off-by: Mike Snitzer
02 Dec, 2014
1 commit
-
This could've been quite bad (to return success but not update the new
root to point at the old) but in practice the only known consumer of the
dm array code is the DM cache target. And the DM cache target passes in
the same old root to array_resize() anyway.Signed-off-by: Joe Thornber
Signed-off-by: Mike Snitzer
14 Dec, 2013
1 commit
-
An old array block could have its reference count decremented below
zero when it is being replaced in the btree by a new array block.The fix is to increment the old ablock's reference count just before
inserting a new ablock into the btree.Signed-off-by: Joe Thornber
Signed-off-by: Mike Snitzer
Cc: stable@vger.kernel.org # 3.9+
06 Nov, 2013
1 commit
-
Entries would be lost if the old tail block was partially filled.
Signed-off-by: Joe Thornber
Signed-off-by: Mike Snitzer
Cc: stable@vger.kernel.org # 3.9+
02 Mar, 2013
1 commit
-
Add a transactional array.
Signed-off-by: Joe Thornber
Signed-off-by: Alasdair G Kergon