superrob1500
/
mirror-linux
mirror of https://github.com/torvalds/linux
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

test_maple_tree: test exhausted upper limit of mtree_alloc_cyclic() 

When the upper bound of the search is exhausted, the maple state may be
returned in an error state of -EBUSY.  This means maple state needs to be
reset before the second search in mas_alloc_cylic() to ensure the search
happens.  This test ensures the issue is not recreated.

Link: https://lkml.kernel.org/r/20241216190113.1226145-3-Liam.Howlett@oracle.com
Signed-off-by: Liam R. Howlett <Liam.Howlett@Oracle.com>
Reviewed-by: Yang Erkun <yangerkun@huawei.com>
Cc: Christian Brauner <brauner@kernel.org>
Cc: Chuck Lever <chuck.lever@oracle.com> says:
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
pull/1134/merge
Liam R. Howlett 2024-12-16 14:01:13 -05:00 committed by Andrew Morton
parent e2c9e6190d
commit b02fcc082a
1 changed files with 28 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
lib/test_maple_tree.c
View File

@ -3738,6 +3738,34 @@ static noinline void __init alloc_cyclic_testing(struct maple_tree *mt)
} }
mtree_destroy(mt); mtree_destroy(mt);
/*
* Issue with reverse search was discovered
* https://lore.kernel.org/all/20241216060600.287B4C4CED0@smtp.kernel.org/
* Exhausting the allocation area and forcing the search to wrap needs a
* mas_reset() in mas_alloc_cyclic().
*/
next = 0;
mt_init_flags(mt, MT_FLAGS_ALLOC_RANGE);
for (int i = 0; i < 1023; i++) {
mtree_alloc_cyclic(mt, &location, mt, 2, 1024, &next, GFP_KERNEL);
MT_BUG_ON(mt, i != location - 2);
MT_BUG_ON(mt, i != next - 3);
MT_BUG_ON(mt, mtree_load(mt, location) != mt);
}
mtree_erase(mt, 123);
MT_BUG_ON(mt, mtree_load(mt, 123) != NULL);
mtree_alloc_cyclic(mt, &location, mt, 2, 1024, &next, GFP_KERNEL);
MT_BUG_ON(mt, 123 != location);
MT_BUG_ON(mt, 124 != next);
MT_BUG_ON(mt, mtree_load(mt, location) != mt);
mtree_erase(mt, 100);
mtree_alloc_cyclic(mt, &location, mt, 2, 1024, &next, GFP_KERNEL);
MT_BUG_ON(mt, 100 != location);
MT_BUG_ON(mt, 101 != next);
MT_BUG_ON(mt, mtree_load(mt, location) != mt);
mtree_destroy(mt);
/* Overflow test */ /* Overflow test */
next = ULONG_MAX - 1; next = ULONG_MAX - 1;
ret = mtree_alloc_cyclic(mt, &location, mt, 2, ULONG_MAX, &next, GFP_KERNEL); ret = mtree_alloc_cyclic(mt, &location, mt, 2, ULONG_MAX, &next, GFP_KERNEL);