Home
last modified time | relevance | path

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

/linux-6.1.9/include/linux/
Dmaple_tree.h30 #define MAPLE_NODE_SLOTS 31 /* 256 bytes including ->parent */ macro
34 #define MAPLE_ALLOC_SLOTS (MAPLE_NODE_SLOTS - 1)
37 #define MAPLE_NODE_SLOTS 63 /* 256 bytes including ->parent */ macro
41 #define MAPLE_ALLOC_SLOTS (MAPLE_NODE_SLOTS - 2)
274 void __rcu *slot[MAPLE_NODE_SLOTS];
/linux-6.1.9/lib/
Dmaple_tree.c84 [maple_dense] = MAPLE_NODE_SLOTS,
93 [maple_dense] = MAPLE_NODE_SLOTS,
109 [maple_dense] = MAPLE_NODE_SLOTS / 2,
1361 mas->offset = MAPLE_NODE_SLOTS; in mas_start()
1367 mas->offset = MAPLE_NODE_SLOTS; in mas_start()
5257 if (unlikely(offset == MAPLE_NODE_SLOTS)) in mas_empty_area()
5320 if (unlikely(mas->offset == MAPLE_NODE_SLOTS)) in mas_empty_area_rev()
5361 if (mas->offset == MAPLE_NODE_SLOTS) in mas_alloc()
5395 if (mas->offset == MAPLE_NODE_SLOTS) in mas_rev_alloc()
6810 for (i = 0; i < MAPLE_NODE_SLOTS; i++) { in mt_dump_node()
Dtest_maple_tree.c18 #define MAPLE_32BIT (MAPLE_NODE_SLOTS > 31)
/linux-6.1.9/tools/testing/radix-tree/
Dmaple.c12 #define MAPLE_32BIT (MAPLE_NODE_SLOTS > 31)
906 mas->offset = MAPLE_NODE_SLOTS; in mas_tree_walk()
924 if (likely(mas->offset != MAPLE_NODE_SLOTS)) in mas_range_load()