Home
last modified time | relevance | path

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

/linux/include/linux/
H A 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)
289 void __rcu *slot[MAPLE_NODE_SLOTS];
/linux/tools/testing/shared/
H A Dmaple-shared.h7 #define MAPLE_32BIT (MAPLE_NODE_SLOTS > 31)
/linux/scripts/gdb/linux/
H A Dconstants.py.in98 LX_VALUE(MAPLE_NODE_SLOTS)
/linux/lib/
H A Dmaple_tree.c100 [maple_dense] = MAPLE_NODE_SLOTS,
109 [maple_dense] = MAPLE_NODE_SLOTS,
125 [maple_dense] = MAPLE_NODE_SLOTS / 2,
1217 mas->offset = MAPLE_NODE_SLOTS; in mas_start()
1223 mas->offset = MAPLE_NODE_SLOTS; in mas_start()
4828 if (unlikely(mas->offset == MAPLE_NODE_SLOTS)) in mas_empty_area_rev()
6831 for (i = 0; i < MAPLE_NODE_SLOTS; i++) { in mt_dump_node()
H A Dtest_maple_tree.c16 #define MAPLE_32BIT (MAPLE_NODE_SLOTS > 31)
/linux/tools/testing/radix-tree/
H A Dmaple.c550 mas->offset = MAPLE_NODE_SLOTS; in mas_tree_walk()
568 if (likely(mas->offset != MAPLE_NODE_SLOTS)) in mas_range_load()