Home
last modified time | relevance | path

Searched refs:MAPLE_ALLOC_SLOTS (Results 1 – 3 of 3) sorted by relevance

/linux-6.12.1/include/linux/
Dmaple_tree.h32 #define MAPLE_ALLOC_SLOTS (MAPLE_NODE_SLOTS - 1) macro
38 #define MAPLE_ALLOC_SLOTS (MAPLE_NODE_SLOTS - 2) macro
136 struct maple_alloc *slot[MAPLE_ALLOC_SLOTS];
/linux-6.12.1/tools/testing/radix-tree/
Dmaple.c82 mas_node_count_gfp(mas, MAPLE_ALLOC_SLOTS + 1, GFP_KERNEL); in check_mas_alloc_node_count()
83 mas_node_count_gfp(mas, MAPLE_ALLOC_SLOTS + 3, GFP_KERNEL); in check_mas_alloc_node_count()
293 for (j = 0; j < MAPLE_ALLOC_SLOTS; j++) { in check_new_node()
348 mas_node_count(&mas, MAPLE_ALLOC_SLOTS + 1); /* Request */ in check_new_node()
351 MT_BUG_ON(mt, mas_allocated(&mas) != MAPLE_ALLOC_SLOTS + 1); in check_new_node()
352 MT_BUG_ON(mt, mas.alloc->node_count != MAPLE_ALLOC_SLOTS); in check_new_node()
357 MT_BUG_ON(mt, mas_allocated(&mas) != MAPLE_ALLOC_SLOTS); in check_new_node()
358 MT_BUG_ON(mt, mas.alloc->node_count != MAPLE_ALLOC_SLOTS - 1); in check_new_node()
361 MT_BUG_ON(mt, mas_allocated(&mas) != MAPLE_ALLOC_SLOTS + 1); in check_new_node()
362 MT_BUG_ON(mt, mas.alloc->node_count != MAPLE_ALLOC_SLOTS); in check_new_node()
[all …]
/linux-6.12.1/lib/
Dmaple_tree.c1196 if (count && (head->node_count < MAPLE_ALLOC_SLOTS)) { in mas_push_node()
1240 if (!allocated || mas->alloc->node_count == MAPLE_ALLOC_SLOTS) { in mas_alloc_nodes()
1260 max_req = MAPLE_ALLOC_SLOTS - node->node_count; in mas_alloc_nodes()