Searched refs:MAPLE_ALLOC_SLOTS (Results 1 – 3 of 3) sorted by relevance
| /linux-6.15/include/linux/ |
| H A D | maple_tree.h | 32 #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.15/tools/testing/radix-tree/ |
| H A D | maple.c | 82 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()
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()
362 MT_BUG_ON(mt, mas.alloc->node_count != MAPLE_ALLOC_SLOTS); in check_new_node()
365 mas_node_count(&mas, MAPLE_ALLOC_SLOTS + 2); /* Request */ in check_new_node()
383 for (i = 1; i <= MAPLE_ALLOC_SLOTS + 1; i++) { in check_new_node()
455 mas_node_count(&mas, MAPLE_ALLOC_SLOTS - 1); /* Request */ in check_new_node()
[all …]
|
| /linux-6.15/lib/ |
| H A D | maple_tree.c | 1208 if (head->node_count < MAPLE_ALLOC_SLOTS) { in mas_push_node()
1248 if (!allocated || mas->alloc->node_count == MAPLE_ALLOC_SLOTS) { in mas_alloc_nodes()
1268 max_req = MAPLE_ALLOC_SLOTS - node->node_count; in mas_alloc_nodes()
1285 } while (unlikely(node->node_count == MAPLE_ALLOC_SLOTS)); in mas_alloc_nodes()
|