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

/linux-master/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)
284 void __rcu *slot[MAPLE_NODE_SLOTS];
399 * node will be of type maple_alloc. maple_alloc has MAPLE_NODE_SLOTS - 1 for
402 * node. The scaling beyond MAPLE_NODE_SLOTS - 1 is handled by storing further
/linux-master/lib/
H A Dmaple_tree.c87 [maple_dense] = MAPLE_NODE_SLOTS,
96 [maple_dense] = MAPLE_NODE_SLOTS,
112 [maple_dense] = MAPLE_NODE_SLOTS / 2,
1379 mas->offset = MAPLE_NODE_SLOTS;
1385 mas->offset = MAPLE_NODE_SLOTS;
4992 * no gap found. (return, slot == MAPLE_NODE_SLOTS)
4993 * found the gap. (return, slot != MAPLE_NODE_SLOTS)
5078 if (unlikely(offset == MAPLE_NODE_SLOTS))
5141 if (unlikely(mas->offset == MAPLE_NODE_SLOTS))
7254 for (i = 0; i < MAPLE_NODE_SLOTS;
[all...]
H A Dtest_maple_tree.c16 #define MAPLE_32BIT (MAPLE_NODE_SLOTS > 31)
/linux-master/tools/testing/radix-tree/
H A Dmaple.c13 #define MAPLE_32BIT (MAPLE_NODE_SLOTS > 31)
956 mas->offset = MAPLE_NODE_SLOTS;
974 if (likely(mas->offset != MAPLE_NODE_SLOTS))
[all...]

Completed in 244 milliseconds