Zdenek Kabelac 284627f811 radix_tree: eliminate node16 to node4 degradation ...

Remove _degrade_to_n4() function and the node16 -> node4 degradation path
during removal operations. Instead, only free node16 when it becomes
completely empty. Lookup performance is identical.
Allocation overhead is removed with very low waste of memory since
this degradation case is rare in practice.

2025-10-17 13:43:03 +02:00

..

hash.c

cleanup: typos in comments

2024-08-30 16:51:15 +02:00

hash.h

device_mapper: move hash.[hc] to base/data-struct

2018-06-08 13:54:19 +01:00

list.c

base: Move list to base/data-struct

2018-06-08 11:24:18 +01:00

list.h

list: use container_of

2020-05-20 16:01:20 +02:00

radix-tree-adaptive.c

radix_tree: eliminate node16 to node4 degradation

2025-10-17 13:43:03 +02:00

radix-tree-simple.c

cleanup: match function prototype with definition

2025-02-17 15:51:03 +01:00

radix-tree.c

radix_tree: add radix_tree_values

2024-06-03 15:30:05 +02:00

radix-tree.h

radix_tree: add radix_tree_uniq_insert

2024-10-24 17:24:40 +02:00