Home
last modified time | relevance | path

Searched refs:MAPLE_NODE_SLOTS (Results 1 – 5 of 5) sorted by relevance

/linux-6.12.1/include/linux/
Dmaple_tree.h29 #define MAPLE_NODE_SLOTS 31 /* 256 bytes including ->parent */ macro
32 #define MAPLE_ALLOC_SLOTS (MAPLE_NODE_SLOTS - 1)
35 #define MAPLE_NODE_SLOTS 63 /* 256 bytes including ->parent */ macro
38 #define MAPLE_ALLOC_SLOTS (MAPLE_NODE_SLOTS - 2)
296 void __rcu *slot[MAPLE_NODE_SLOTS];
/linux-6.12.1/tools/testing/shared/
Dmaple-shared.h7 #define MAPLE_32BIT (MAPLE_NODE_SLOTS > 31)
/linux-6.12.1/lib/
Dmaple_tree.c87 [maple_dense] = MAPLE_NODE_SLOTS,
96 [maple_dense] = MAPLE_NODE_SLOTS,
112 [maple_dense] = MAPLE_NODE_SLOTS / 2,
1378 mas->offset = MAPLE_NODE_SLOTS; in mas_start()
1384 mas->offset = MAPLE_NODE_SLOTS; in mas_start()
5117 if (unlikely(offset == MAPLE_NODE_SLOTS)) in mas_empty_area()
5180 if (unlikely(mas->offset == MAPLE_NODE_SLOTS)) in mas_empty_area_rev()
7264 for (i = 0; i < MAPLE_NODE_SLOTS; i++) { in mt_dump_node()
Dtest_maple_tree.c16 #define MAPLE_32BIT (MAPLE_NODE_SLOTS > 31)
/linux-6.12.1/tools/testing/radix-tree/
Dmaple.c13 #define MAPLE_32BIT (MAPLE_NODE_SLOTS > 31)
958 mas->offset = MAPLE_NODE_SLOTS; in mas_tree_walk()
976 if (likely(mas->offset != MAPLE_NODE_SLOTS)) in mas_range_load()