633769c926
The maple tree node limits are implied by the parent. When walking up the tree, the limit may not be known until a slot that does not have implied limits are encountered. However, if the node is the left-most or right-most node, the walking up to find that limit can be skipped. This commit also fixes the debug/testing code that was not setting the limit on walking down the tree as that optimization is not compatible with this change. Link: https://lkml.kernel.org/r/20230518145544.1722059-4-Liam.Howlett@oracle.com Signed-off-by: Liam R. Howlett <Liam.Howlett@oracle.com> Reviewed-by: Peng Zhang <zhangpeng.00@bytedance.com> Cc: David Binderman <dcb314@hotmail.com> Cc: Sergey Senozhatsky <senozhatsky@chromium.org> Cc: Vernon Yang <vernon2gm@gmail.com> Cc: Wei Yang <richard.weiyang@gmail.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> |
||
---|---|---|
.. | ||
generated | ||
linux | ||
trace/events | ||
.gitignore | ||
benchmark.c | ||
bitmap.c | ||
idr-test.c | ||
iteration_check_2.c | ||
iteration_check.c | ||
linux.c | ||
main.c | ||
Makefile | ||
maple.c | ||
multiorder.c | ||
regression1.c | ||
regression2.c | ||
regression3.c | ||
regression4.c | ||
regression.h | ||
tag_check.c | ||
test.c | ||
test.h | ||
xarray.c |