maple_tree: avoid checking other gaps after getting the largest gap
authorPeng Zhang <zhangpeng.00@bytedance.com>
Fri, 15 Dec 2023 07:46:32 +0000 (15:46 +0800)
committerAndrew Morton <akpm@linux-foundation.org>
Wed, 20 Dec 2023 22:48:14 +0000 (14:48 -0800)
The last range stored in maple tree is typically quite large.  By checking
if it exceeds the sum of the remaining ranges in that node, it is possible
to avoid checking all other gaps.

Running the maple tree test suite in user mode almost always results in a
near 100% hit rate for this optimization.

Link: https://lkml.kernel.org/r/20231215074632.82045-1-zhangpeng.00@bytedance.com
Signed-off-by: Peng Zhang <zhangpeng.00@bytedance.com>
Reviewed-by: Liam R. Howlett <Liam.Howlett@oracle.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
lib/maple_tree.c

index c9a970ea20dd5e514650efcde5819fb3838b1e09..6f241bb38799201defb1b31154920dcc257b9831 100644 (file)
@@ -1518,6 +1518,9 @@ static unsigned long mas_leaf_max_gap(struct ma_state *mas)
                gap = ULONG_MAX - pivots[max_piv];
                if (gap > max_gap)
                        max_gap = gap;
+
+               if (max_gap > pivots[max_piv] - mas->min)
+                       return max_gap;
        }
 
        for (; i <= max_piv; i++) {